Lines Matching full:base
198 // for rules that didn't specify a base value, their base values
200 // set all those rules' base values. We also remove any special
212 // if the rule's base value is 0, fill in a default
213 // base value (this will be 1 plus the preceding
214 // rule's base value for regular rule sets, and the
215 // same as the preceding rule's base value in fraction
249 // if it's a regular rule that already knows its base value,
251 // the default base value for the next rule
420 // (a rule is used for all values from its base value to
421 // the next rule's base value)
438 if (hi == 0) { // bad rule set, minimum base > 0
450 if (hi == 1) { // bad rule set, no prior rule to rollback to from this base
464 * the number. Basically, the base value of each rule in the rule
469 * same base value, the first one is used when the numerator of the
480 // by each rule's base value until you get an integral result)
484 // find the least common multiple of the rules' base values
503 // base value is the denominator is "numerator" times the
504 // base value divided bythe LCD. Here we check to see if
530 // if we have two successive rules that both have the winning base
550 * of its rules (with a base value less than upperBound) and returns
558 * Only rules whose base values are strictly less than upperBound
561 * be the matching rule's base value, composed appropriately with
657 // base values are higher than the upper bound (again, this helps
857 int64_t base = radix;
870 int64_t n = w / base;
871 int64_t m = n * base;
903 int64_t base = radix;
916 int64_t n = w / base;
917 int64_t m = n * base;
