Lines Matching defs:and
195 long and b32 $r0 $r0 0x3ff
213 long and b32 $r0 $r0 0x3ff
279 long and b32 $r0 $r0 0x1f
296 long and b32 $r0 $r0 0x1f
559 // Step 1: classify input according to exponent and value, and calculate
561 // bit 52 (bit 20 of the upper half) and is 11 bits in length
579 // behavior is both seen on the CPU and the blob
582 and b32 $r4 $r1 0x7ff00000
609 and b32 $r7 $r1 0x800fffff
614 // 2), calculate rcp and do newton-raphson step once
626 // The formula used here (and above) is:
628 // The following code uses 2 FMAs for each step, and it will basically
641 // Step 5: Exponent recovery and final processing
650 // These 2 sources are calculated in the first two lines below, and then
665 // Norms: convert exponents back and return
675 and b32 $r1 $r1 0x80000000
688 and b32 $r1 $r1 0x800fffff
713 and b32 $r2 $r1 0x7fffffff
715 // 2. denorms and small normal values: using their original value will
717 // steps below. Take 2 as a threshold in exponent field, and multiply
729 long and b32 $r2 $r2 $r6
733 // For 0/inf/nan, make sure the sign bit agrees with input and return
734 and b32 $r1 $r1 0x80000000
772 // Requires at least 4 GPRs and 32 bytes of l[] memory to temporarily save GPRs.
791 // check state of the warp and continue if it didn't cause the trap
795 and b32 0 $c $r1 $r3
812 // store $c and $p registers
814 // store $trapstat and $warperr
889 // load PC (may be unaligned and spread out)
895 // invalidate caches and exit