Lines Matching refs:divisor

159               const DynamicAPInt &divisor) {
161     denoms[i] = divisor;
164   // Find the greatest common divisor (GCD) of the dividends and divisor for
165   // each valid division. Divide the dividends and divisor by the GCD to
170                  const DynamicAPInt &divisor);
208 /// The parameter `dividend` corresponds to `expr` above, `divisor` to `d`, and
213 /// The divisor must be positive.
215                                               const DynamicAPInt &divisor,
218                                               const DynamicAPInt &divisor,
225 /// function of other variables (where the divisor is a positive constant).
235 /// the representation could be computed, `dividend` and `divisor` are set,
241                                     DynamicAPInt &divisor);
248                                     unsigned &divisor);