39   R3 = R0 ^ R1;
40   R0 = ABS R0;  define
57   DIVS(R0, R1);
58   DIVQ(R0, R1);
59   DIVQ(R0, R1);
60   DIVQ(R0, R1);
61   DIVQ(R0, R1);
62   DIVQ(R0, R1);
63   DIVQ(R0, R1);
64   DIVQ(R0, R1);
65   DIVQ(R0, R1);
66   DIVQ(R0, R1);
67   DIVQ(R0, R1);
68   DIVQ(R0, R1);
69   DIVQ(R0, R1);
70   DIVQ(R0, R1);
71   DIVQ(R0, R1);
72   DIVQ(R0, R1);
73   DIVQ(R0, R1);
75   R0 = R0.L (Z);  define
91   CC = R0 == 0;                   /* check for division of zero */
94   CC = R0 == R1;                  /* check for identical operands */
114   R2 = R0 << 1;                   /* R2 lsw of dividend  */
115   R6 = R0 ^ R1;                   /* Get sign */
118   R0 = 0 ;                        /* Clear msw partial remainder */  define
120   R6 = R0 ^ R1;                   /* Get new quotient bit */
125         R0 = R0 << 1 || R5 = [SP];  define
126         R0 = R0 | R7;             /* and add carry */  define
130         R0 = R0 + R5;             /* do add or subtract, as indicated by AQ */  define
131         R6 = R0 ^ R1;             /* Generate next quotient bit */
153   CC = R0 == R1;                  /* check for identical operands => 1 */
157   R2 = R0;                        /* assume divide by 1 => numerator */
161   R0 = R2;                        /* Return an identity value */  define
164   IF CC R0 = R2;
180   R2 = R0 >> 31;
187   R0 = LSHIFT R0 by R1.L;  define
190   R2 = -R0;                       // negate result if necessary
192   IF CC R0 = R2;
196   R0 = 0;  define