Lines Matching +full:64 +full:m
29 #if BITS_PER_LONG == 64
83 /* compute m = ((p << 64) + b - 1) / b */ \
90 /* test our ___m with res = m * x / (p << 64) */ \
102 * additional bit to represent m which would overflow \
103 * a 64-bit variable. \
105 * Instead we do m = p / b and n / b = (n * m + m) / p. \
108 /* Compute m = (p << 64) / b */ \
113 /* Reduce m / p to help avoid overflow handling later. */ \
118 * Perform (m_bias + m * n) / (1 << 64). \
130 * Prototype: uint64_t __arch_xprod_64(const uint64_t m, uint64_t n, bool bias)
131 * Semantic: retval = ((bias ? m : 0) + m * n) >> 64
133 * The product is a 128-bit value, scaled down to 64 bits.
142 uint64_t __arch_xprod_64(const uint64_t m, uint64_t n, bool bias) in __arch_xprod_64() argument
144 uint32_t m_lo = m; in __arch_xprod_64()
145 uint32_t m_hi = m >> 32; in __arch_xprod_64()
151 bool no_ovf = __builtin_constant_p(m) && in __arch_xprod_64()
152 ((m >> 32) + (m & 0xffffffff) < 0x100000000); in __arch_xprod_64()
155 x = (uint64_t)m_lo * n_lo + (bias ? m : 0); in __arch_xprod_64()
178 * to check for type safety (n must be 64bit)