43   CC = R0 < R1 (IU);    /* If X < Y, always return 0 */  define
44   IF CC JUMP .Lreturn_ident;
47   CC = R2 <= R0 (IU);  define
48   IF CC JUMP .Lidents;
53   CC = R2;  define
54   IF CC JUMP .Ly_16bit;
62   AQ = CC;             /* Clear AQ (CC==0) */
101   CC = ! BITTST(R0, 31);  define
107   CC &= AZ;
116   CC &= CARRY;
117   IF CC JUMP .Lshift_and_correct;
127   CC = R0 == 0;        /* 0/Y => 0 */  define
128   IF CC JUMP .Lreturn_r0;
129   CC = R0 == R1;       /* X==Y => 1 */  define
130   IF CC JUMP .Lreturn_ident;
131   CC = R1 == 1;        /* X/1 => X */  define
132   IF CC JUMP .Lreturn_ident;
136   CC = R2 == 1;  define
137   IF CC JUMP .Lpower_of_two;
151   CC = R1 < 0;  define
153   IF CC R1 = R2;                  /* Possibly-shifted R1 */
154   IF !CC R6 = R3;                 /* R1 doesn't, so at most 1 shifted */
161   CC = R0 < 0;  define
162   IF CC P0 = R6;                  /* Number of values divided */
163   IF !CC R2 = R0;                 /* Shifted R0 */
177        CC = R7 < 0;               /* Check quotient(AQ) */  define
179        IF CC R5 = R1;             /* and if AQ==1, we'll add it. */
187   CC = P0 == 0;                   /* Check how many inputs we shifted */  define
188   IF CC JUMP .Lno_mult;            /* if none... */
190   CC = P0 == 1;  define
191   IF CC R2 = R6;                  /* if 1, Q = Q*2 */
192   IF !CC R1 = P2;                 /* if 2, restore stored divisor */
197   CC = R1 <= R5 (IU);             /* Check if divisor <= Z? */  define
198   R6 = CC;                        /* if yes, R6 = 1 */
207   CC = R0 < R1 (IU);    /* If X < Y, always return 0 */  define
209   IF CC JUMP .Ltrue_return_ident;
211   CC = R1 == 0;  define
212   IF CC JUMP .Ltrue_return_ident;
214   CC = R0 == R1;       /* X==Y => 1 */  define
215   IF CC JUMP .Ltrue_return_ident;
237   CC = R1 < 0;  define
238   IF CC JUMP .Ltrue_return_ident;
258   CC=!CC;
259   AQ = CC;                        /* Clear AQ, got here with CC = 0 */
294   CC = R2 == R3;  define
297   IF CC R0 = R1;