Lines Matching refs:R1
43 CC = R0 < R1 (IU); /* If X < Y, always return 0 */
46 R2 = R1 << 16;
51 R3 = R1 >> 15; /* and Y is a 15-bit number */
70 DIVQ(R0, R1); // 1
71 DIVQ(R0, R1); // 2
72 DIVQ(R0, R1); // 3
73 DIVQ(R0, R1); // 4
74 DIVQ(R0, R1); // 5
75 DIVQ(R0, R1); // 6
76 DIVQ(R0, R1); // 7
77 DIVQ(R0, R1); // 8
78 DIVQ(R0, R1); // 9
79 DIVQ(R0, R1); // 10
80 DIVQ(R0, R1); // 11
81 DIVQ(R0, R1); // 12
82 DIVQ(R0, R1); // 13
83 DIVQ(R0, R1); // 14
84 DIVQ(R0, R1); // 15
85 DIVQ(R0, R1); // 16
112 R3 = R1 >> 1; /* Pre-scaled divisor for primitive case */
129 CC = R0 == R1; /* X==Y => 1 */
131 CC = R1 == 1; /* X/1 => X */
134 R2.L = ONES R1;
147 P2 = R1;
151 CC = R1 < 0;
152 R2 = R1 >> 1;
153 IF CC R1 = R2; /* Possibly-shifted R1 */
157 R3 = -R1;
179 IF CC R5 = R1; /* and if AQ==1, we'll add it. */
181 R7 = R3 ^ R1; /* Generate next quotient bit */
192 IF !CC R1 = P2; /* if 2, restore stored divisor */
195 R3 *= R1; /* Q * divisor */
197 CC = R1 <= R5 (IU); /* Check if divisor <= Z? */
207 CC = R0 < R1 (IU); /* If X < Y, always return 0 */
211 CC = R1 == 0;
214 CC = R0 == R1; /* X==Y => 1 */
237 CC = R1 < 0;
240 R1.l = SIGNBITS R1;
241 R1 = R1.L (Z); define
242 R1 += -30;
243 R0 = LSHIFT R0 by R1.L;
286 R2 *= R1; /* M = Q * Y */
296 R1 = R0 - R3; define
297 IF CC R0 = R1;