2 #include "../5c/5.out.h"
18 typedef struct Adr Adr;
19 typedef struct Prog Prog;
20 typedef struct Case Case;
22 typedef struct Multab Multab;
23 typedef struct Hintab Hintab;
24 typedef struct Var Var;
25 typedef struct Reg Reg;
26 typedef struct Rgn Rgn;
98 long rpo; /* reverse post ordering */
112 long loop; /* could be shorter */
140 EXTERN Node constnode;
141 EXTERN Node fconstnode;
142 EXTERN long continpc;
147 EXTERN long maxargsafe;
149 EXTERN Multab multab[20];
150 EXTERN int hintabsize;
153 EXTERN Node* nodsafe;
154 EXTERN long nrathole;
159 EXTERN char string[NSNAME];
160 EXTERN Sym* symrathole;
163 EXTERN char reg[NREG+NFREG];
164 EXTERN long exregoffset;
165 EXTERN long exfregoffset;
168 #define BLOAD(r) band(bnot(r->refbehind), r->refahead)
169 #define BSTORE(r) band(bnot(r->calbehind), r->calahead)
170 #define LOAD(r) (~r->refbehind.b[z] & r->refahead.b[z])
171 #define STORE(r) (~r->calbehind.b[z] & r->calahead.b[z])
173 #define bset(a,n) ((a).b[(n)/32]&(1L<<(n)%32))
180 EXTERN Rgn region[NRGN];
191 EXTERN long exregbits;
199 EXTERN Var var[NVAR];
204 extern char* anames[];
205 extern Hintab hintab[];
210 void codgen(Node*, Node*);
213 void usedset(Node*, int);
215 int bcomplex(Node*, Node*);
220 void cgen(Node*, Node*);
221 void cgenrel(Node*, Node*, int);
222 void reglcgen(Node*, Node*, Node*);
223 void lcgen(Node*, Node*);
224 void bcgen(Node*, int);
225 void boolgen(Node*, int, Node*);
226 void sugen(Node*, Node*, long);
227 void layout(Node*, Node*, int, int, Node*);
235 void gargs(Node*, Node*, Node*);
236 void garg1(Node*, Node*, Node*, int, Node**);
237 Node* nodconst(long);
238 Node* nod32const(vlong);
239 Node* nodfconst(double);
240 void nodreg(Node*, Node*, int);
241 void regret(Node*, Node*);
243 void regalloc(Node*, Node*, Node*);
245 void regialloc(Node*, Node*, Node*);
246 void regsalloc(Node*, Node*);
247 void regaalloc1(Node*, Node*);
248 void regaalloc(Node*, Node*);
249 void regind(Node*, Node*);
250 void gprep(Node*, Node*);
251 void raddr(Node*, Prog*);
252 void naddr(Node*, Adr*);
253 void gmovm(Node*, Node*, int);
254 void gmove(Node*, Node*);
255 void gmover(Node*, Node*);
256 void gins(int a, Node*, Node*);
257 void gopcode(int, Node*, Node*, Node*);
258 int samaddr(Node*, Node*);
260 void patch(Prog*, long);
263 void gpseudo(int, Sym*, Node*);
268 int swcmp(const void*, const void*);
270 void swit1(C1*, int, long, Node*);
271 void swit2(C1*, int, long, Node*, Node*);
273 void bitload(Node*, Node*, Node*, Node*, Node*);
274 void bitstore(Node*, Node*, Node*, Node*, Node*);
275 long outstring(char*, long);
276 int mulcon(Node*, Node*);
277 Multab* mulcon0(long);
278 void nullwarn(Node*, Node*);
279 void sextern(Sym*, Node*, long, long);
280 void gextern(Sym*, Node*, long, long);
282 void ieeedtod(Ieee*, double);
300 int rcmp(const void*, const void*);
302 void addmove(Reg*, int, int, int);
303 Bits mkvar(Adr*, int);
304 void prop(Reg*, Bits, Bits);
305 void loopit(Reg*, long);
306 void synch(Reg*, Bits);
307 ulong allreg(ulong, Rgn*);
308 void paint1(Reg*, int);
309 ulong paint2(Reg*, int);
310 void paint3(Reg*, int, long, int);
311 void addreg(Adr*, int);
326 void constprop(Adr*, Adr*, Reg*);
327 int copy1(Adr*, Adr*, Reg*, int);
328 int copyu(Prog*, Adr*, Adr*);
330 int copyas(Adr*, Adr*);
331 int copyau(Adr*, Adr*);
332 int copyau1(Prog*, Adr*);
333 int copysub(Adr*, Adr*, Adr*, int);
334 int copysub1(Prog*, Adr*, Adr*, int);
341 void predicate(void);
342 int isbranch(Prog *);
343 int predicable(Prog *p);
344 int modifiescpsr(Prog *p);
346 #pragma varargck type "A" int
347 #pragma varargck type "B" Bits
348 #pragma varargck type "D" Adr*
349 #pragma varargck type "N" Adr*
350 #pragma varargck type "R" Adr*
351 #pragma varargck type "P" Prog*
352 #pragma varargck type "S" char*