Lines Matching refs:the
4 * The contents of this file are subject to the terms of the
6 * (the "License"). You may not use this file except in compliance
7 * with the License.
9 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
11 * See the License for the specific language governing permissions
12 * and limitations under the License.
15 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16 * If applicable, add the following below this CDDL HEADER, with the
38 * dividend -- the thing being divided
46 * TOPBITS -- how many bits are in the top "decade" of a number:
49 * Q -- the partial quotient under development -- initally 0
50 * R -- the remainder so far -- initially == the dividend
51 * ITER -- number of iterations of the main division loop will
53 * Note that this is log_base_(2^4) of the quotient.
54 * V -- the current comparand -- initially divisor*2^(ITER*4-1)
59 * different path, as the upper bits of the quotient must be developed
77 * this is the recursive definition of how we develop quotient digits.
79 * $1 -- the current depth, 1<=$1<=4
80 * $2 -- the current accumulation of quotient bits
83 * insert the bits in the quotient.
136 ! here, the %o0 is >= 2^(31-4) or so. We must be careful here, as
138 ! total number of bits in the result here is 4*%o4+%g3, where %g3 <= 4.
140 ! the top decade: so don't even bother to compare to %o3.
153 ! here if the %o1 overflowed when Shifting
154 ! this means that %o3 has the high-order bit set
172 ! we have to be careful here. We know that %o3 >= %o5, so we can do the
173 ! first divide step without thinking. BUT, the others are conditional,
174 ! and are only done if %o3 >= 0. Because both %o3 and %o5 may have the high-
175 ! order bit set in the first step, just falling into the regular
176 ! division loop will mess up the first time around.
213 ! do the main division iteration