Lines Matching defs:Mod
739 APInt Mod = APInt::getSignedMinValue(W+1);
741 MultiplyFactor = MultiplyFactor.multiplicativeInverse(Mod);
5128 /// A * X = B (mod N)
5160 APInt Mod(BW + 1, 0);
5161 Mod.setBit(BW - Mult2); // Mod = N / D
5162 APInt I = AD.multiplicativeInverse(Mod);
5165 // I * (B / D) mod (N / D)
5166 APInt Result = (I * B.lshr(Mult2).zext(BW + 1)).urem(Mod);
5296 // Start + Step*N = 0 (mod 2^BW)
5300 // Step*N = -Start (mod 2^BW)
5327 // 1*N = -Start; -1*N = Start (mod 2^BW), so: