23   R2 = R1 << 16;  define
24   CC = R2 <= R0 (IU);
27   R2 = R0 >> 31;       /* if X is a 31-bit number */  define
29   R2 = R2 | R3;        /* then it's okay to use the DIVQ builtins (fallthrough to fast)*/  define
30   CC = R2;
90   R2 = R0 >> 16;  define
92   R2 = R3 - R2;		/* shifted divisor < upper 16 bits of dividend */  define
111   R2.L = ONES R1;
112   R2 = R2.L (Z);  define
113   CC = R2 == 1;
129   R2 = R1 >> 1;  define
130   IF CC R1 = R2;                  /* Possibly-shifted R1 */
136   R2 = R0 >> 1;  define
137   R2 = R0 >> 1;  define
140   IF !CC R2 = R0;                 /* Shifted R0 */
150 .Lulst:  R6 = R2 >> 31;             /* R6 = sign bit of R2, for carry */
151        R2 = R2 << 1;              /* Shift 64 bit dividend up by 1 bit */  define
162 .Lulend: R2 = R2 + R5;              /* and "shift" it in. */
166   R6 = R2 << 1;
168   IF CC R2 = R6;                  /* if 1, Q = Q*2 */
171   R3 = R2;                        /* Copy of R2 */
176   R2 = R2 + R6;                   /* if yes, add one to quotient(Q) */  define
180   R0 = R2;                        /* Store quotient */
185   R2 = 0;  define
187   R2 = -1 (X);         /* X/0 => 0xFFFFFFFF */  define
190   R2 = -R2;            /* R2 now 1 */  define
193   R2 = R0;             /* X/1 => X */  define
197   R0 = R2;
213   R2 = R0 >> 31;  define
233   R2 = R0;  define
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 */  define
263   R2 *= R1;		/* M = Q * Y */
264   R2 = R0 - R2;		/* E = X - M */  define
270   R2 = R2 >> 16;		/* E >> 16 */  define
271   CC = R2 == R3;