Lines Matching +full:signed +full:- +full:by
16 * Function to divide an unsigned 64 bit integer by an unsigned
17 * 31 bit integer using signed 64/32 bit division.
33 * signed 64 / 32 bit division with an upper half of 0 will in __div64_31()
46 * a signed division the quotient can get too big. To avoid this in __div64_31()
47 * the 64 bit dividend is halved, then the signed division will in __div64_31()
50 * is increased by one then checked against the base. If the in __div64_31()
73 * Function to divide an unsigned 64 bit integer by an unsigned
81 * If the most significant bit of base is set, divide n by in __div64_32()
85 * If base is already < 2^31-1 __div64_31 can be used directly. in __div64_32()
87 r = __div64_31(n, ((signed) base < 0) ? (base/2) : base); in __div64_32()
88 if ((signed) base < 0) { in __div64_32()
105 * = base*q1 - ((base&1) ? q1 : 0) + r1 in __div64_32()
108 int64_t rx = r - q; in __div64_32()
111 * loop is n=2^64-1 base=2^31+1. That gives a in __div64_32()
112 * maximum for q=(2^64-1)/2^31 = 0x1ffffffff. Since in __div64_32()
118 q--; in __div64_32()