Lines Matching +full:32 +full:bit
10 * Generic C version of 64bit/32bit division and modulo, with
11 * 64bit result and 32bit remainder.
13 * The fast case for (n>>32 == 0) is handled inline by do_div().
25 /* Not needed on 64bit architectures */
26 #if BITS_PER_LONG == 32
34 uint32_t high = rem >> 32; in __div64_32()
36 /* Reduce the thing a bit first */ in __div64_32()
40 res = (uint64_t) high << 32; in __div64_32()
41 rem -= (uint64_t) (high*base) << 32; in __div64_32()
65 * div_s64_rem - signed 64bit divide with 64bit divisor and remainder
66 * @dividend: 64bit dividend
67 * @divisor: 64bit divisor
68 * @remainder: 64bit remainder
91 * div64_u64_rem - unsigned 64bit divide with 64bit divisor and remainder
92 * @dividend: 64bit dividend
93 * @divisor: 64bit divisor
94 * @remainder: 64bit remainder
98 * is kept distinct to avoid slowing down the div64_u64 operation on 32bit
104 u32 high = divisor >> 32; in div64_u64_rem()
131 * div64_u64 - unsigned 64bit divide with 64bit divisor
132 * @dividend: 64bit dividend
133 * @divisor: 64bit divisor
144 u32 high = divisor >> 32; in div64_u64()
165 * div64_s64 - signed 64bit divide with 64bit divisor
166 * @dividend: 64bit dividend
167 * @divisor: 64bit divisor
182 #endif /* BITS_PER_LONG == 32 */