23   R2 = R1 << 16;  define
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
90   R2 = R0 >> 16;  define
92   R2 = R3 - R2;		/* shifted divisor < upper 16 bits of dividend */  define
112   R2 = R2.L (Z);  define
129   R2 = R1 >> 1;  define
136   R2 = R0 >> 1;  define
137   R2 = R0 >> 1;  define
151        R2 = R2 << 1;              /* Shift 64 bit dividend up by 1 bit */  define
176   R2 = R2 + R6;                   /* if yes, add one to quotient(Q) */  define
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
213   R2 = R0 >> 31;  define
233   R2 = R0;  define
262   R2 = R3;		/* Preserve Q */  define
264   R2 = R0 - R2;		/* E = X - M */  define
270   R2 = R2 >> 16;		/* E >> 16 */  define