Lines Matching refs:R2
46 R2 = R1 << 16;
47 CC = R2 <= R0 (IU);
50 R2 = R0 >> 31; /* if X is a 31-bit number */
52 R2 = R2 | R3; /* then it's okay to use the DIVQ builtins (fallthrough to fast)*/
53 CC = R2;
113 R2 = R0 >> 16;
115 R2 = R3 - R2; /* shifted divisor < upper 16 bits of dividend */
126 /* Test for common identities. Value to be returned is placed in R2. */
134 R2.L = ONES R1;
135 R2 = R2.L (Z);
136 CC = R2 == 1;
152 R2 = R1 >> 1;
153 IF CC R1 = R2; /* Possibly-shifted R1 */
159 R2 = R0 >> 1;
160 R2 = R0 >> 1;
163 IF !CC R2 = R0; /* Shifted R0 */
173 .Lulst: R6 = R2 >> 31; /* R6 = sign bit of R2, for carry */
174 R2 = R2 << 1; /* Shift 64 bit dividend up by 1 bit */
185 .Lulend: R2 = R2 + R5; /* and "shift" it in. */
189 R6 = R2 << 1;
191 IF CC R2 = R6; /* if 1, Q = Q*2 */
194 R3 = R2; /* Copy of R2 */
199 R2 = R2 + R6; /* if yes, add one to quotient(Q) */
203 R0 = R2; /* Store quotient */
208 R2 = 0;
210 R2 = -1 (X); /* X/0 => 0xFFFFFFFF */
213 R2 = -R2; /* R2 now 1 */
216 R2 = R0; /* X/1 => X */
220 R0 = R2;
236 R2 = R0 >> 31;
256 R2 = R0;
260 DIVQ(R2, R3); // 1
261 DIVQ(R2, R3); // 2
262 DIVQ(R2, R3); // 3
263 DIVQ(R2, R3); // 4
264 DIVQ(R2, R3); // 5
265 DIVQ(R2, R3); // 6
266 DIVQ(R2, R3); // 7
267 DIVQ(R2, R3); // 8
268 DIVQ(R2, R3); // 9
269 DIVQ(R2, R3); // 10
270 DIVQ(R2, R3); // 11
271 DIVQ(R2, R3); // 12
272 DIVQ(R2, R3); // 13
273 DIVQ(R2, R3); // 14
274 DIVQ(R2, R3); // 15
275 DIVQ(R2, R3); // 16
284 R3 = R2.L (Z); /* Q = X' / Y' */
285 R2 = R3; /* Preserve Q */
286 R2 *= R1; /* M = Q * Y */
287 R2 = R0 - R2; /* E = X - M */
293 R2 = R2 >> 16; /* E >> 16 */
294 CC = R2 == R3;