20 * calculate addressability as follows
23 * REGISTER ==> 11 register
24 * INDREG ==> 12 *[(reg)+offset]
26 * ADD(2, 20) ==> 2 $name+offset
27 * ADD(3, 20) ==> 3 $(reg)+offset
28 * &12 ==> 3 $(reg)+offset
31 * *3 ==> 12 *(reg)+offset
32 * calculate complexity (number of registers)
84 if(l->addable == 20) {
90 if(r->addable == 20) {
106 r->type = types[TINT];
118 r->type = types[TINT];
128 r->type = types[TINT];
139 r->type = types[TINT];
150 r->type = types[TINT];
184 n->complex = l->complex;
186 if(r->complex == n->complex)
187 n->complex = r->complex+1;
189 if(r->complex > n->complex)
190 n->complex = r->complex;
215 * immediate operators, make const on right
217 if(l->op == OCONST) {
220 n->op = invrel[relindex(n->op)];
229 * immediate operators, make const on right
231 if(l->op == OCONST) {