R=ken2
https://golang.org/cl/183136
l = n->left;
r = n->right;
o = n->op;
+
+ if(n->op == OEXREG || (nn != Z && nn->op == OEXREG)) {
+ gmove(n, nn);
+ return;
+ }
+
if(n->addable >= INDEXED) {
if(nn == Z) {
switch(o) {
* (20) * (X) ==> 7 multiplier in indexing
* (X,7) + (13,1) ==> 8 adder in indexing (addresses)
* (8) ==> &9(OINDEX) index, almost addressable
+ * 100 extern register
*
* calculate complexity (number of registers)
*/
break;
case OEXREG:
- n->addable = 10;
+ n->addable = 0;
break;
case OREGISTER: