Lines Matching defs:Mod
1014 APInt Mod = APInt::getSignedMinValue(W+1);
1016 MultiplyFactor = MultiplyFactor.multiplicativeInverse(Mod);
6923 /// A * X = B (mod N)
6955 APInt Mod(BW + 1, 0);
6956 Mod.setBit(BW - Mult2); // Mod = N / D
6957 APInt I = AD.multiplicativeInverse(Mod);
6960 // I * (B / D) mod (N / D)
6961 APInt Result = (I * B.lshr(Mult2).zext(BW + 1)).urem(Mod);
7091 // Start + Step*N = 0 (mod 2^BW)
7095 // Step*N = -Start (mod 2^BW)
7122 // 1*N = -Start; -1*N = Start (mod 2^BW), so:
7151 // 2^(N + k) * Distance' = (StepV == 2^N) * X (mod 2^W) ... (0)
