28   T q2 = min / ad;               // Init. q2 = 2**p/|d|.  in SignedDivisionByConstant()  local
29   T r2 = min - q2 * ad;          // Init. r2 = rem(2**p, |d|).  in SignedDivisionByConstant()
39     q2 = 2 * q2;     // Update q2 = 2**p/|d|.  in SignedDivisionByConstant()
42       q2 = q2 + 1;  in SignedDivisionByConstant()
47   T mul = q2 + 1;  in SignedDivisionByConstant()
66   T q2 = max / d;         // Init. q2 = (2**p - 1)/d.  in UnsignedDivisionByConstant()  local
67   T r2 = max - q2 * d;    // Init. r2 = rem(2**p - 1, d).  in UnsignedDivisionByConstant()
79       if (q2 >= max) a = true;  in UnsignedDivisionByConstant()
80       q2 = 2 * q2 + 1;  in UnsignedDivisionByConstant()
83       if (q2 >= min) a = true;  in UnsignedDivisionByConstant()
84       q2 = 2 * q2;  in UnsignedDivisionByConstant()
89   return MagicNumbersForDivision<T>(q2 + 1, p - bits, a);  in UnsignedDivisionByConstant()