Lines Matching refs:R1
20 CC = R0 < R1 (IU); /* If X < Y, always return 0 */
23 R2 = R1 << 16;
28 R3 = R1 >> 15; /* and Y is a 15-bit number */
47 DIVQ(R0, R1); // 1
48 DIVQ(R0, R1); // 2
49 DIVQ(R0, R1); // 3
50 DIVQ(R0, R1); // 4
51 DIVQ(R0, R1); // 5
52 DIVQ(R0, R1); // 6
53 DIVQ(R0, R1); // 7
54 DIVQ(R0, R1); // 8
55 DIVQ(R0, R1); // 9
56 DIVQ(R0, R1); // 10
57 DIVQ(R0, R1); // 11
58 DIVQ(R0, R1); // 12
59 DIVQ(R0, R1); // 13
60 DIVQ(R0, R1); // 14
61 DIVQ(R0, R1); // 15
62 DIVQ(R0, R1); // 16
89 R3 = R1 >> 1; /* Pre-scaled divisor for primitive case */
106 CC = R0 == R1; /* X==Y => 1 */
108 CC = R1 == 1; /* X/1 => X */
111 R2.L = ONES R1;
124 P2 = R1;
125 /* If either R0 or R1 have sign set, */
128 CC = R1 < 0;
129 R2 = R1 >> 1;
130 IF CC R1 = R2; /* Possibly-shifted R1 */
131 IF !CC R6 = R3; /* R1 doesn't, so at most 1 shifted */
134 R3 = -R1;
156 IF CC R5 = R1; /* and if AQ==1, we'll add it. */
158 R7 = R3 ^ R1; /* Generate next quotient bit */
169 IF !CC R1 = P2; /* if 2, restore stored divisor */
172 R3 *= R1; /* Q * divisor */
174 CC = R1 <= R5 (IU); /* Check if divisor <= Z? */
184 CC = R0 < R1 (IU); /* If X < Y, always return 0 */
188 CC = R1 == 0;
191 CC = R0 == R1; /* X==Y => 1 */
214 CC = R1 < 0;
217 R1.l = SIGNBITS R1;
218 R1 = R1.L (Z);
219 R1 += -30;
220 R0 = LSHIFT R0 by R1.L;
234 // R3 is already R1 >> 1
263 R2 *= R1; /* M = Q * Y */
273 R1 = R0 - R3;
274 IF CC R0 = R1;