Lines Matching +full:25 +full:a
22 * $24 and $25, and return the result in $27. Register $28 may
27 * This is a rather simple bit-at-a-time algorithm: it's very good
43 * $25 - divisor
77 #define GETSIGN(x) xor $24,$25,x
114 bis $25,$25,divisor # E :
129 * In spite of the DIV_ONLY being either a non-instruction
141 * Thus using a large shift isn't worth it (and
142 * s8add pairs better than a sll..)
163 * Keep things nicely bundled... use a nop instead of not
216 * -a / b = a / -b = -(a / b)
217 * -a % b = -(a % b)
218 * a % -b = a % b
229 bis $24,$25,$28 # E :
235 stq $25,8($30) # L :
241 subq $31,$25,$28 # E : U L U L
244 cmovlt $25,$28,$25 /* abs($25) */ # E : Latency 2, extra map slot
249 ldq $25,8($30) # L :