Lines Matching refs:R3
28 R3 = R1 >> 15; /* and Y is a 15-bit number */
29 R2 = R2 | R3; /* then it's okay to use the DIVQ builtins (fallthrough to fast)*/
71 ** R3 currently holds Y>>15, which means R3's LSB is the
83 R3 += -1; /* if so, Y is 0x00008nnn */
89 R3 = R1 >> 1; /* Pre-scaled divisor for primitive case */
92 R2 = R3 - R2; /* shifted divisor < upper 16 bits of dividend */
122 R3 = 1;
131 IF !CC R6 = R3; /* R1 doesn't, so at most 1 shifted */
134 R3 = -R1;
135 [--SP] = R3;
145 R3 = 0; /* Clear partial remainder */
152 R3 = R3 << 1 || R5 = [SP];
153 R3 = R3 | R6; /* Include any carry */
157 R3 = R3 + R5; /* Add/sub divsor to partial remainder */
158 R7 = R3 ^ R1; /* Generate next quotient bit */
171 R3 = R2; /* Copy of R2 */
172 R3 *= R1; /* Q * divisor */
173 R5 = R0 - R3; /* Z = (dividend - Q * divisor) */
234 // R3 is already R1 >> 1
237 DIVQ(R2, R3); // 1
238 DIVQ(R2, R3); // 2
239 DIVQ(R2, R3); // 3
240 DIVQ(R2, R3); // 4
241 DIVQ(R2, R3); // 5
242 DIVQ(R2, R3); // 6
243 DIVQ(R2, R3); // 7
244 DIVQ(R2, R3); // 8
245 DIVQ(R2, R3); // 9
246 DIVQ(R2, R3); // 10
247 DIVQ(R2, R3); // 11
248 DIVQ(R2, R3); // 12
249 DIVQ(R2, R3); // 13
250 DIVQ(R2, R3); // 14
251 DIVQ(R2, R3); // 15
252 DIVQ(R2, R3); // 16
261 R3 = R2.L (Z); /* Q = X' / Y' */
262 R2 = R3; /* Preserve Q */
265 R0 = R3; /* Copy Q into result reg */
269 R3 = 0xFFFF (Z);
271 CC = R2 == R3;
272 R3 = 1 ;
273 R1 = R0 - R3;