LEFT | RIGHT |
(no file at all) | |
1 // Inferno utils/5c/reg.c | 1 // Inferno utils/5c/reg.c |
2 // http://code.google.com/p/inferno-os/source/browse/utils/5g/reg.c | 2 // http://code.google.com/p/inferno-os/source/browse/utils/5g/reg.c |
3 // | 3 // |
4 // Copyright © 1994-1999 Lucent Technologies Inc. All rights reserved. | 4 // Copyright © 1994-1999 Lucent Technologies Inc. All rights reserved. |
5 // Portions Copyright © 1995-1997 C H Forsyth (forsyth@terzarima.net) | 5 // Portions Copyright © 1995-1997 C H Forsyth (forsyth@terzarima.net) |
6 // Portions Copyright © 1997-1999 Vita Nuova Limited | 6 // Portions Copyright © 1997-1999 Vita Nuova Limited |
7 // Portions Copyright © 2000-2007 Vita Nuova Holdings Limited (www.vitanuov
a.com) | 7 // Portions Copyright © 2000-2007 Vita Nuova Holdings Limited (www.vitanuov
a.com) |
8 // Portions Copyright © 2004,2006 Bruce Ellis | 8 // Portions Copyright © 2004,2006 Bruce Ellis |
9 // Portions Copyright © 2005-2007 C H Forsyth (forsyth@terzarima.net) | 9 // Portions Copyright © 2005-2007 C H Forsyth (forsyth@terzarima.net) |
10 // Revisions Copyright © 2000-2007 Lucent Technologies Inc. and others | 10 // Revisions Copyright © 2000-2007 Lucent Technologies Inc. and others |
(...skipping 122 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
133 { | 133 { |
134 Reg *r, *r1; | 134 Reg *r, *r1; |
135 Prog *p; | 135 Prog *p; |
136 int i, z, nr; | 136 int i, z, nr; |
137 uint32 vreg; | 137 uint32 vreg; |
138 Bits bit; | 138 Bits bit; |
139 | 139 |
140 if(first == 0) { | 140 if(first == 0) { |
141 fmtinstall('Q', Qconv); | 141 fmtinstall('Q', Qconv); |
142 } | 142 } |
| 143 |
143 first++; | 144 first++; |
144 | |
145 if(debug['K']) { | 145 if(debug['K']) { |
146 » » if(first != 2) | 146 » » if(first != 13) |
147 return; | 147 return; |
148 // debug['R'] = 2; | 148 // debug['R'] = 2; |
149 // debug['P'] = 2; | 149 // debug['P'] = 2; |
150 print("optimizing %S\n", curfn->nname->sym); | 150 print("optimizing %S\n", curfn->nname->sym); |
151 } | 151 } |
152 | 152 |
153 // count instructions | 153 // count instructions |
154 nr = 0; | 154 nr = 0; |
155 for(p=firstp; p!=P; p=p->link) | 155 for(p=firstp; p!=P; p=p->link) |
156 nr++; | 156 nr++; |
(...skipping 1279 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1436 } | 1436 } |
1437 // r1 = r->s1; | 1437 // r1 = r->s1; |
1438 // if(r1 != R) { | 1438 // if(r1 != R) { |
1439 // print(" succ:"); | 1439 // print(" succ:"); |
1440 // for(; r1 != R; r1 = r1->s1) | 1440 // for(; r1 != R; r1 = r1->s1) |
1441 // print(" %.4ud", r1->prog->loc); | 1441 // print(" %.4ud", r1->prog->loc); |
1442 // print("\n"); | 1442 // print("\n"); |
1443 // } | 1443 // } |
1444 } | 1444 } |
1445 } | 1445 } |
LEFT | RIGHT |