2 #include "../5c/5.out.h"
19 typedef struct Adr Adr;
20 typedef struct Prog Prog;
21 typedef struct Case Case;
23 typedef struct Multab Multab;
24 typedef struct Hintab Hintab;
25 typedef struct Var Var;
26 typedef struct Reg Reg;
27 typedef struct Rgn Rgn;
99 long rpo; /* reverse post ordering */
113 long loop; /* could be shorter */
141 EXTERN Node constnode;
142 EXTERN Node fconstnode;
143 EXTERN long continpc;
148 EXTERN long maxargsafe;
150 EXTERN Multab multab[20];
151 EXTERN int hintabsize;
154 EXTERN Node* nodsafe;
155 EXTERN long nrathole;
160 EXTERN char string[NSNAME];
161 EXTERN Sym* symrathole;
164 EXTERN char reg[NREG+NFREG];
165 EXTERN long exregoffset;
166 EXTERN long exfregoffset;
169 #define BLOAD(r) band(bnot(r->refbehind), r->refahead)
170 #define BSTORE(r) band(bnot(r->calbehind), r->calahead)
171 #define LOAD(r) (~r->refbehind.b[z] & r->refahead.b[z])
172 #define STORE(r) (~r->calbehind.b[z] & r->calahead.b[z])
174 #define bset(a,n) ((a).b[(n)/32]&(1L<<(n)%32))
181 EXTERN Rgn region[NRGN];
192 EXTERN long exregbits;
200 EXTERN Var var[NVAR];
205 extern char* anames[];
206 extern Hintab hintab[];
211 void codgen(Node*, Node*);
214 void usedset(Node*, int);
216 int bcomplex(Node*, Node*);
221 void cgen(Node*, Node*);
222 void cgenrel(Node*, Node*, int);
223 void reglcgen(Node*, Node*, Node*);
224 void lcgen(Node*, Node*);
225 void bcgen(Node*, int);
226 void boolgen(Node*, int, Node*);
227 void sugen(Node*, Node*, long);
228 void layout(Node*, Node*, int, int, Node*);
229 int cgen64(Node*, Node*);
237 void gargs(Node*, Node*, Node*);
238 void garg1(Node*, Node*, Node*, int, Node**);
239 Node* nodconst(long);
240 Node* nod32const(vlong);
241 Node* nodfconst(double);
242 void nodreg(Node*, Node*, int);
243 void regret(Node*, Node*);
245 void regalloc(Node*, Node*, Node*);
247 void regialloc(Node*, Node*, Node*);
248 void regsalloc(Node*, Node*);
249 void regaalloc1(Node*, Node*);
250 void regaalloc(Node*, Node*);
251 void regind(Node*, Node*);
252 void gprep(Node*, Node*);
253 void raddr(Node*, Prog*);
254 void naddr(Node*, Adr*);
255 void gmovm(Node*, Node*, int);
256 void gmove(Node*, Node*);
257 void gmover(Node*, Node*);
258 void gins(int a, Node*, Node*);
259 void gopcode(int, Node*, Node*, Node*);
260 int samaddr(Node*, Node*);
262 void patch(Prog*, long);
265 void gpseudo(int, Sym*, Node*);
270 int swcmp(const void*, const void*);
272 void swit1(C1*, int, long, Node*);
273 void swit2(C1*, int, long, Node*, Node*);
275 void bitload(Node*, Node*, Node*, Node*, Node*);
276 void bitstore(Node*, Node*, Node*, Node*, Node*);
277 long outstring(char*, long);
278 int mulcon(Node*, Node*);
279 Multab* mulcon0(long);
280 void nullwarn(Node*, Node*);
281 void sextern(Sym*, Node*, long, long);
282 void gextern(Sym*, Node*, long, long);
284 void ieeedtod(Ieee*, double);
302 int rcmp(const void*, const void*);
304 void addmove(Reg*, int, int, int);
305 Bits mkvar(Adr*, int);
306 void prop(Reg*, Bits, Bits);
307 void loopit(Reg*, long);
308 void synch(Reg*, Bits);
309 ulong allreg(ulong, Rgn*);
310 void paint1(Reg*, int);
311 ulong paint2(Reg*, int);
312 void paint3(Reg*, int, long, int);
313 void addreg(Adr*, int);
328 void constprop(Adr*, Adr*, Reg*);
329 int copy1(Adr*, Adr*, Reg*, int);
330 int copyu(Prog*, Adr*, Adr*);
332 int copyas(Adr*, Adr*);
333 int copyau(Adr*, Adr*);
334 int copyau1(Prog*, Adr*);
335 int copysub(Adr*, Adr*, Adr*, int);
336 int copysub1(Prog*, Adr*, Adr*, int);
343 void predicate(void);
344 int isbranch(Prog *);
345 int predicable(Prog *p);
346 int modifiescpsr(Prog *p);
348 #pragma varargck type "A" int
349 #pragma varargck type "B" Bits
350 #pragma varargck type "D" Adr*
351 #pragma varargck type "N" Adr*
352 #pragma varargck type "R" Adr*
353 #pragma varargck type "P" Prog*
354 #pragma varargck type "S" char*