Lines Matching refs:modulo
1446 /// Computes the multiplicative inverse of this APInt for a given modulo. The
1451 APInt APInt::multiplicativeInverse(const APInt& modulo) const {
1452 assert(ult(modulo) && "This APInt must be smaller than the modulo");
1462 APInt r[2] = { modulo, *this };
1476 // If this APInt and the modulo are not coprime, there is no multiplicative
1478 // remainder, which is the gcd(*this,modulo) as calculated by the Euclidean
1485 // one if necessary. A simple addition of the modulo suffices because
1487 return t[i].isNegative() ? t[i] + modulo : t[i];
