Lines Matching +full:23 +full:- +full:64
1 /* SPDX-License-Identifier: GPL-2.0 */
14 * __divqu: 64-bit unsigned long divide
15 * __remqu: 64-bit unsigned long remainder
16 * __divqs/__remqs: signed 64-bit
17 * __divlu/__remlu: unsigned 32-bit
18 * __divls/__remls: signed 32-bit
27 * This is a rather simple bit-at-a-time algorithm: it's very good
28 * at dividing random 64-bit numbers, but the more usual case where
37 * $0 - current bit
38 * $1 - shifted divisor
39 * $2 - modulus/quotient
41 * $23 - return address
42 * $24 - dividend
43 * $25 - divisor
45 * $27 - quotient/modulus
46 * $28 - compare status
80 * For 32-bit operations, we need to extend to 64-bit
100 .frame $30,STACK,$23
118 * shift divisor left, using 3-bit shifts for
119 * 32-bit divides as we can't overflow. Three-bit
154 ret $31,($23),1
162 * -a / b = a / -b = -(a / b)
163 * -a % b = -(a % b)
164 * a % -b = a % b
173 .frame $30,STACK,$23
182 stq $23,16($30)
187 bsr $23,ufunction
193 ldq $23,16($30)
197 ret $31,($23),1