Lines Matching refs:ONE
42 # effect, branches to one of the branch table entries located
1358 bne.b fu_in_exc # there is at least one set
1627 bne.b fu_out_exc # there is at least one set
1936 bne.b fu_in_exc_p # at least one was set
2660 bne.b iea_op_exc # at least one was set
4192 bne.b funimp_exc # at least one was set
4226 # "unskewed" the one the hardware initially gave us.
5587 #--case, reduce argument by one remainder step to make subsequent reduction
6018 #--case, reduce argument by one remainder step to make subsequent reduction
6382 #--ONE. NOTE ALSO THAT THE TRADITIONAL SCHEME THAT APPROXIMATE
6822 # Notes: This will always generate one exception -- inexact. #
6942 # 6.4. Although one can argue that the inexact flag #
8141 one:
8436 # if the input is exactly equal to one, then exit through ld_pzero.
8439 fcmp.b %fp0,&0x1 # is it equal to one?
8444 fsub.s one(%pc),%fp1 # FP1 IS X-1
8445 fadd.s one(%pc),%fp0 # FP0 IS X+1
8570 fadd.s one(%pc),%fp0 # X := ROUND(1+Z)
8595 fadd.s one(%pc),%fp0 # FP0 IS 1+X
8634 fmov.s one(%pc),%fp0
9385 # the answer is one of:
9415 # the answer is one of:
10354 # checking the exception bit. if one did occur, then we #
10578 # setoxm1i(): Return minus one for a negative src operand or #
10589 # src_one(): Return signed one according to sign of src operand. #
10597 # ld_pone(): return positive one.
10606 # ld_mone(): return negative one.
10648 # ssincosz(): When the src operand is ZERO, store a one in the
13230 # For denorms, force the j-bit to a one and do the same as for #
13232 # one. #
13336 # For denorms, force the j-bit to a one and do the same as for #
13338 # one. #
13863 # If you have a 2 DENORMs, then you can just force the j-bit to a one
13865 # If you have a DENORM and an INF or ZERO, just force the DENORM's j-bit to a one
15003 # one operand is a ZERO and the other is a DENORM or NORM. scale
15040 # operands are INF and one of {ZERO, INF, DENORM, NORM}
15050 # operands are INF and one of {ZERO, INF, DENORM, NORM}
15455 # one operand is a ZERO and the other is a DENORM or a NORM.
16175 # SNAN bit in the operand to one), and the operation continues as #
16282 # Dn is fetched and decremented by one. If Dn is not equal to -1, add #
16346 # Typically, only one of the two possible branch directions could #
16974 # Typically, only one of the two possible branch directions could #
17544 # Typically, only one of the two possible branch directions could #
19597 # tags for both if dyadic, one for monadic. If a number is an UNNORM, #
19603 # in the data register file. If it's actually out in memory, use one of #
20202 # If at any time an access error is flagged by one of the move- #
20607 # if exp now equals one, then it overflowed so call ovf_res.
20818 # if exp now equals one, then it overflowed so call ovf_res.
21356 # For a7, if the increment amount is one, then we have to #
21420 # For a7, if the decrement amount is one, then we have to #
22369 # unnorm_fix(): - changes an UNNORM to one of NORM, DENORM, or ZERO #
22382 # d0 = optype tag - is corrected to one of NORM, DENORM, or ZERO #
22484 # one of: NORM, INF, QNAN, SNAN, DENORM, UNNORM, ZERO #
22564 # one of: NORM, INF, QNAN, SNAN, DENORM, ZERO #
22627 # one of: NORM, INF, QNAN, SNAN, DENORM, ZERO #
23116 mulu.l &0xa,%d1 # mul partial product by one digit place
23188 ble.b loadlw # if not, get last one
23209 # 3. Add one for each zero encountered until a non-zero digit.
23216 # 3. Add one for each zero encountered until a non-zero digit.
23526 # only one rounding error. The grs bits are collected in #
23895 # only one rounding error. The grs bits are collected in
24186 # Since ICTR <> 0, we have already been through one adjustment,
24625 movq.l &0x1,%d0 # one byte
24662 movq.l &0x1,%d0 # one byte
Indexes created Thu Oct 23 22:10:10 GMT 2025