Lines Matching refs:is
2 * udiv.S: This routine was taken from glibc-1.09 and is covered
7 /* This file is generated from divrem.m4; DO NOT EDIT! */
33 * is the log base (2^N) of the quotient.
37 * Current estimate for non-large dividend is
39 * A large dividend is one greater than 2^(31-TOPBITS) and takes a
56 ! wrong as possible, but that is what SunOS does...).
72 ! Here the dividend is >= 2**(31-N) or so. We must be careful here,
74 ! The number of bits in the result here is N*ITER+SC, where SC <= N.
170 ! remainder is positive
175 ! remainder is positive
180 ! remainder is positive
185 ! remainder is positive
191 ! remainder is negative
197 ! remainder is negative
202 ! remainder is positive
208 ! remainder is negative
214 ! remainder is negative
219 ! remainder is positive
224 ! remainder is positive
230 ! remainder is negative
236 ! remainder is negative
241 ! remainder is positive
247 ! remainder is negative
253 ! remainder is negative
258 ! remainder is positive
263 ! remainder is positive
268 ! remainder is positive
274 ! remainder is negative
280 ! remainder is negative
285 ! remainder is positive
291 ! remainder is negative
297 ! remainder is negative
302 ! remainder is positive
307 ! remainder is positive
313 ! remainder is negative
319 ! remainder is negative
324 ! remainder is positive
330 ! remainder is negative