20   CC = R0 < R1 (IU);    /* If X < Y, always return 0 */  define
21   IF CC JUMP .Lreturn_ident;
24   CC = R2 <= R0 (IU);  define
25   IF CC JUMP .Lidents;
30   CC = R2;  define
31   IF CC JUMP .Ly_16bit;
39   AQ = CC;             /* Clear AQ (CC==0) */
78   CC = ! BITTST(R0, 31);  define
84   CC &= AZ;
93   CC &= CARRY;
94   IF CC JUMP .Lshift_and_correct;
104   CC = R0 == 0;        /* 0/Y => 0 */  define
105   IF CC JUMP .Lreturn_r0;
106   CC = R0 == R1;       /* X==Y => 1 */  define
107   IF CC JUMP .Lreturn_ident;
108   CC = R1 == 1;        /* X/1 => X */  define
109   IF CC JUMP .Lreturn_ident;
113   CC = R2 == 1;  define
114   IF CC JUMP .Lpower_of_two;
128   CC = R1 < 0;  define
130   IF CC R1 = R2;                  /* Possibly-shifted R1 */
131   IF !CC R6 = R3;                 /* R1 doesn't, so at most 1 shifted */
138   CC = R0 < 0;  define
139   IF CC P0 = R6;                  /* Number of values divided */
140   IF !CC R2 = R0;                 /* Shifted R0 */
154        CC = R7 < 0;               /* Check quotient(AQ) */  define
156        IF CC R5 = R1;             /* and if AQ==1, we'll add it. */
164   CC = P0 == 0;                   /* Check how many inputs we shifted */  define
165   IF CC JUMP .Lno_mult;            /* if none... */
167   CC = P0 == 1;  define
168   IF CC R2 = R6;                  /* if 1, Q = Q*2 */
169   IF !CC R1 = P2;                 /* if 2, restore stored divisor */
174   CC = R1 <= R5 (IU);             /* Check if divisor <= Z? */  define
175   R6 = CC;                        /* if yes, R6 = 1 */
184   CC = R0 < R1 (IU);    /* If X < Y, always return 0 */  define
186   IF CC JUMP .Ltrue_return_ident;
188   CC = R1 == 0;  define
189   IF CC JUMP .Ltrue_return_ident;
191   CC = R0 == R1;       /* X==Y => 1 */  define
192   IF CC JUMP .Ltrue_return_ident;
214   CC = R1 < 0;  define
215   IF CC JUMP .Ltrue_return_ident;
235   CC=!CC;
236   AQ = CC;                        /* Clear AQ, got here with CC = 0 */
271   CC = R2 == R3;  define
274   IF CC R0 = R1;