Lines Matching refs:BitShift
127 template <int BitShift>
134 modulus <= MaximumValue(BitShift), in MultiplyModLazy()
135 "Modulus " << modulus << " exceeds bound " << MaximumValue(BitShift)); in MultiplyModLazy()
136 HEXL_CHECK(x <= MaximumValue(BitShift), in MultiplyModLazy()
137 "Operand " << x << " exceeds bound " << MaximumValue(BitShift)); in MultiplyModLazy()
139 uint64_t Q = MultiplyUInt64Hi<BitShift>(x, y_barrett_factor); in MultiplyModLazy()
148 template <int BitShift>
150 HEXL_CHECK(BitShift == 64 || BitShift == 52, in MultiplyModLazy()
151 "Unsupported BitShift " << BitShift); in MultiplyModLazy()
152 HEXL_CHECK(x <= MaximumValue(BitShift), in MultiplyModLazy()
153 "Operand " << x << " exceeds bound " << MaximumValue(BitShift)); in MultiplyModLazy()
157 modulus <= MaximumValue(BitShift), in MultiplyModLazy()
158 "Modulus " << modulus << " exceeds bound " << MaximumValue(BitShift)); in MultiplyModLazy()
160 uint64_t y_barrett = MultiplyFactor(y, BitShift, modulus).BarrettFactor(); in MultiplyModLazy()
161 return MultiplyModLazy<BitShift>(x, y, y_barrett, modulus); in MultiplyModLazy()
269 template <int BitShift>
272 HEXL_CHECK(BitShift == 64 || BitShift == 52, in MontgomeryReduce()
273 "Unsupported BitShift " << BitShift); in MontgomeryReduce()
283 if (BitShift == 52) { in MontgomeryReduce()
296 t_hi = t_hi << (BitShift - r); in MontgomeryReduce()