Lines Matching +full:32 +full:m

18  * In other words, a 64-bit dividend with a 32-bit divisor producing
19  * a 64-bit result and a 32-bit remainder.  To accomplish this optimally
37 	__rem = __n >> 32;  in __div64_32()
60 uint64_t __arch_xprod_64(uint64_t m, uint64_t n, bool bias)  in __arch_xprod_64()  argument
64 	bool no_ovf = __builtin_constant_p(m) &&  in __arch_xprod_64()
65 		      ((m >> 32) + (m & 0xffffffff) < 0x100000000);  in __arch_xprod_64()
71 			: "r" (m), "r" (n)  in __arch_xprod_64()
74 		res = m;  in __arch_xprod_64()
78 			: "r" (m), "r" (n)  in __arch_xprod_64()
86 			: "r" (m), "r" (n)  in __arch_xprod_64()
96 			: "r" (m), "r" (n)  in __arch_xprod_64()
106 			: "r" (m), "r" (n)  in __arch_xprod_64()