Lines Matching defs:divisor

68 s64 div_s64_rem(s64 dividend, s32 divisor, s32 *remainder)
73 		quotient = div_u64_rem(-dividend, abs(divisor), (u32 *)remainder);
75 		if (divisor > 0)
78 		quotient = div_u64_rem(dividend, abs(divisor), (u32 *)remainder);
79 		if (divisor < 0)
88  * div64_u64_rem - unsigned 64bit divide with 64bit divisor and remainder
90  * @divisor:	64bit divisor
99 u64 div64_u64_rem(u64 dividend, u64 divisor, u64 *remainder)
101 	u32 high = divisor >> 32;
106 		quot = div_u64_rem(dividend, divisor, &rem32);
110 		quot = div_u64(dividend >> n, divisor >> n);
115 		*remainder = dividend - quot * divisor;
116 		if (*remainder >= divisor) {
118 			*remainder -= divisor;
128  * div64_u64 - unsigned 64bit divide with 64bit divisor
130  * @divisor:	64bit divisor
139 u64 div64_u64(u64 dividend, u64 divisor)
141 	u32 high = divisor >> 32;
145 		quot = div_u64(dividend, divisor);
148 		quot = div_u64(dividend >> n, divisor >> n);
152 		if ((dividend - quot * divisor) >= divisor)
162 s64 div64_s64_rem(s64 dividend, s64 divisor, s64 *remainder)
166 	quot = div64_u64_rem(abs(dividend), abs(divisor), (u64 *)&rem);
169 	t = (dividend ^ divisor) >> 63;
177 s64 div64_s64(s64 dividend, s64 divisor)
181 	quot = div64_u64(abs(dividend), abs(divisor));
182 	t = (dividend ^ divisor) >> 63;
193  * bigger than divisor.
196 u32 iter_div_u64_rem(u64 dividend, u32 divisor, u64 *remainder)
198 	return __iter_div_u64_rem(dividend, divisor, remainder);
269 		/* trigger runtime exception if divisor is zero */
280 	/* Left align the divisor, shifting the dividend to match */
308 	 * Get the most significant BITS_PER_ITER bits of the divisor.
325 		/* Add product to negated divisor */
339 	 * of the divisor.