Lines Matching refs:R
30 | R := X, go to Step 4.
32 | R := 2^(-L)X, j := L.
36 | 3.1 If R = Y, go to Step 9.
37 | 3.2 If R > Y, then { R := R - Y, Q := Q + 1}
39 | 3.4 k := k + 1, j := j - 1, Q := 2Q, R := 2R. Go to
42 | Step 4. At this point, R = X - QY = MOD(X,Y). Set
46 | Step 5. R = MOD(X,Y), but REM(X,Y) is requested.
47 | 5.1 If R < Y/2, then R = MOD(X,Y) = REM(X,Y). Go to
49 | 5.2 If R > Y/2, then { set Last_Subtract := true,
51 | 5.3 This is the tricky case of R = Y/2. If Q is odd,
54 | Step 6. R := signX*R.
56 | Step 7. If Last_Subtract = true, R := R - Y.
58 | Step 8. Return signQ, last 7 bits of Q, and R as required.
60 | Step 9. At this point, R = 2^(-j)*X - Q Y = Y. Thus,
62 | R := 0. Return signQ, last 7 bits of Q, and R.
88 .set R,FP_SCR2 define
89 .set R_Hi,R+4
90 .set R_Lo,R+8
210 |..(Carry,D1,D2) is R
219 |..At this point R = 2^(-L)X; Q = 0; k = 0; and k+j = L
226 |..At this point carry = 0, R = (D1,D2), Y = (D4,D5)
227 cmpl %d4,%d1 | ...compare hi(R) and hi(Y)
229 cmpl %d5,%d2 | ...compare lo(R) and lo(Y)
232 |..At this point, R = Y
237 bcss R_LT_Y | ...borrow is set iff R < Y
241 |..and Y < (D1,D2) < 2Y. Either way, perform R - Y
242 subl %d5,%d2 | ...lo(R) - lo(Y)
243 subxl %d4,%d1 | ...hi(R) - hi(Y)
248 |..At this point, Carry=0, R < Y. R = 2^(k-L)X - QY; k+j = L; j >= 0.
253 addl %d2,%d2 | ...lo(R) = 2lo(R)
254 roxll #1,%d1 | ...hi(R) = 2hi(R) + carry
255 scs %d6 | ...set Carry if 2(R) overflows
258 |..At this point, R=(Carry,D1,D2) = 2^(k-L)X - QY, j+k=L, j >= 0, R < 2Y.
263 |..k = L, j = 0, Carry = 0, R = (D1,D2) = X - QY, R < Y.
265 |..normalize R.
266 movel L_SCR1(%a6),%d0 | ...new biased expo of R
299 movew %d0,R(%a6)
300 clrw R+2(%a6)
308 fmovex R(%a6),%fp0 | ...no exception
315 movew %d0,R(%a6)
316 clrw R+2(%a6)
320 fmovex R(%a6),%fp0
391 |..R = 2^(-j)X - Q Y = Y, thus R = 0 and quotient = 2^j (Q+1)