gc.h 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374
  1. #include "../cc/cc.h"
  2. #include "../8c/8.out.h"
  3. /*
  4. * 8c/386
  5. * Intel 386
  6. */
  7. #define SZ_CHAR 1
  8. #define SZ_SHORT 2
  9. #define SZ_INT 4
  10. #define SZ_LONG 4
  11. #define SZ_IND 4
  12. #define SZ_FLOAT 4
  13. #define SZ_VLONG 8
  14. #define SZ_DOUBLE 8
  15. #define FNX 100
  16. typedef struct Adr Adr;
  17. typedef struct Prog Prog;
  18. typedef struct Case Case;
  19. typedef struct C1 C1;
  20. typedef struct Var Var;
  21. typedef struct Reg Reg;
  22. typedef struct Rgn Rgn;
  23. typedef struct Renv Renv;
  24. EXTERN struct
  25. {
  26. Node* regtree;
  27. Node* basetree;
  28. short scale;
  29. short reg;
  30. short ptr;
  31. } idx;
  32. struct Adr
  33. {
  34. long offset;
  35. double dval;
  36. char sval[NSNAME];
  37. Sym* sym;
  38. uchar type;
  39. uchar index;
  40. uchar etype;
  41. uchar scale; /* doubles as width in DATA op */
  42. };
  43. #define A ((Adr*)0)
  44. #define INDEXED 9
  45. struct Prog
  46. {
  47. Adr from;
  48. Adr to;
  49. Prog* link;
  50. long lineno;
  51. short as;
  52. };
  53. #define P ((Prog*)0)
  54. struct Case
  55. {
  56. Case* link;
  57. long val;
  58. long label;
  59. char def;
  60. };
  61. #define C ((Case*)0)
  62. struct C1
  63. {
  64. long val;
  65. long label;
  66. };
  67. struct Var
  68. {
  69. long offset;
  70. Sym* sym;
  71. char name;
  72. char etype;
  73. };
  74. struct Reg
  75. {
  76. long pc;
  77. long rpo; /* reverse post ordering */
  78. Bits set;
  79. Bits use1;
  80. Bits use2;
  81. Bits refbehind;
  82. Bits refahead;
  83. Bits calbehind;
  84. Bits calahead;
  85. Bits regdiff;
  86. Bits act;
  87. long regu;
  88. long loop; /* could be shorter */
  89. Reg* log5;
  90. long active;
  91. Reg* p1;
  92. Reg* p2;
  93. Reg* p2link;
  94. Reg* s1;
  95. Reg* s2;
  96. Reg* link;
  97. Prog* prog;
  98. };
  99. #define R ((Reg*)0)
  100. struct Renv
  101. {
  102. int safe;
  103. Node base;
  104. Node* saved;
  105. Node* scope;
  106. };
  107. #define NRGN 600
  108. struct Rgn
  109. {
  110. Reg* enter;
  111. short cost;
  112. short varno;
  113. short regno;
  114. };
  115. EXTERN long breakpc;
  116. EXTERN Case* cases;
  117. EXTERN Node constnode;
  118. EXTERN Node fconstnode;
  119. EXTERN long continpc;
  120. EXTERN long curarg;
  121. EXTERN long cursafe;
  122. EXTERN Prog* firstp;
  123. EXTERN Prog* lastp;
  124. EXTERN long maxargsafe;
  125. EXTERN int mnstring;
  126. EXTERN int retok;
  127. EXTERN Node* nodrat;
  128. EXTERN Node* nodret;
  129. EXTERN Node* nodsafe;
  130. EXTERN long nrathole;
  131. EXTERN long nstring;
  132. EXTERN Prog* p;
  133. EXTERN long pc;
  134. EXTERN Node regnode;
  135. EXTERN Node fregnode0;
  136. EXTERN Node fregnode1;
  137. EXTERN char string[NSNAME];
  138. EXTERN Sym* symrathole;
  139. EXTERN Node znode;
  140. EXTERN Prog zprog;
  141. EXTERN int reg[D_NONE];
  142. EXTERN long exregoffset;
  143. EXTERN long exfregoffset;
  144. #define BLOAD(r) band(bnot(r->refbehind), r->refahead)
  145. #define BSTORE(r) band(bnot(r->calbehind), r->calahead)
  146. #define LOAD(r) (~r->refbehind.b[z] & r->refahead.b[z])
  147. #define STORE(r) (~r->calbehind.b[z] & r->calahead.b[z])
  148. #define bset(a,n) ((a).b[(n)/32]&(1L<<(n)%32))
  149. #define CLOAD 5
  150. #define CREF 5
  151. #define CINF 1000
  152. #define LOOP 3
  153. EXTERN Rgn region[NRGN];
  154. EXTERN Rgn* rgp;
  155. EXTERN int nregion;
  156. EXTERN int nvar;
  157. EXTERN Bits externs;
  158. EXTERN Bits params;
  159. EXTERN Bits consts;
  160. EXTERN Bits addrs;
  161. EXTERN long regbits;
  162. EXTERN long exregbits;
  163. EXTERN int change;
  164. EXTERN int suppress;
  165. EXTERN Reg* firstr;
  166. EXTERN Reg* lastr;
  167. EXTERN Reg zreg;
  168. EXTERN Reg* freer;
  169. EXTERN Var var[NVAR];
  170. EXTERN long* idom;
  171. EXTERN Reg** rpo2r;
  172. EXTERN long maxnr;
  173. extern char* anames[];
  174. /*
  175. * sgen.c
  176. */
  177. void codgen(Node*, Node*);
  178. void gen(Node*);
  179. void noretval(int);
  180. void usedset(Node*, int);
  181. void xcom(Node*);
  182. void indx(Node*);
  183. int bcomplex(Node*, Node*);
  184. /*
  185. * cgen.c
  186. */
  187. void zeroregm(Node*);
  188. void cgen(Node*, Node*);
  189. void reglcgen(Node*, Node*, Node*);
  190. void lcgen(Node*, Node*);
  191. void bcgen(Node*, int);
  192. void boolgen(Node*, int, Node*);
  193. void sugen(Node*, Node*, long);
  194. int needreg(Node*, int);
  195. /*
  196. * cgen64.c
  197. */
  198. int vaddr(Node*, int);
  199. void loadpair(Node*, Node*);
  200. int cgen64(Node*, Node*);
  201. void testv(Node*, int);
  202. /*
  203. * txt.c
  204. */
  205. void ginit(void);
  206. void gclean(void);
  207. void nextpc(void);
  208. void gargs(Node*, Node*, Node*);
  209. void garg1(Node*, Node*, Node*, int, Node**);
  210. Node* nodconst(long);
  211. Node* nodfconst(double);
  212. int nodreg(Node*, Node*, int);
  213. int isreg(Node*, int);
  214. void regret(Node*, Node*);
  215. void regalloc(Node*, Node*, Node*);
  216. void regfree(Node*);
  217. void regialloc(Node*, Node*, Node*);
  218. void regsalloc(Node*, Node*);
  219. void regaalloc1(Node*, Node*);
  220. void regaalloc(Node*, Node*);
  221. void regind(Node*, Node*);
  222. void gprep(Node*, Node*);
  223. void naddr(Node*, Adr*);
  224. void gmove(Node*, Node*);
  225. void gins(int a, Node*, Node*);
  226. void fgopcode(int, Node*, Node*, int, int);
  227. void gopcode(int, Type*, Node*, Node*);
  228. int samaddr(Node*, Node*);
  229. void gbranch(int);
  230. void patch(Prog*, long);
  231. int sconst(Node*);
  232. void gpseudo(int, Sym*, Node*);
  233. /*
  234. * swt.c
  235. */
  236. int swcmp(const void*, const void*);
  237. void doswit(Node*);
  238. void swit1(C1*, int, long, Node*);
  239. void cas(void);
  240. void bitload(Node*, Node*, Node*, Node*, Node*);
  241. void bitstore(Node*, Node*, Node*, Node*, Node*);
  242. long outstring(char*, long);
  243. void nullwarn(Node*, Node*);
  244. void sextern(Sym*, Node*, long, long);
  245. void gextern(Sym*, Node*, long, long);
  246. void outcode(void);
  247. void ieeedtod(Ieee*, double);
  248. /*
  249. * list
  250. */
  251. void listinit(void);
  252. int Pconv(Fmt*);
  253. int Aconv(Fmt*);
  254. int Dconv(Fmt*);
  255. int Sconv(Fmt*);
  256. int Rconv(Fmt*);
  257. int Xconv(Fmt*);
  258. int Bconv(Fmt*);
  259. /*
  260. * reg.c
  261. */
  262. Reg* rega(void);
  263. int rcmp(const void*, const void*);
  264. void regopt(Prog*);
  265. void addmove(Reg*, int, int, int);
  266. Bits mkvar(Reg*, Adr*);
  267. void prop(Reg*, Bits, Bits);
  268. void loopit(Reg*, long);
  269. void synch(Reg*, Bits);
  270. ulong allreg(ulong, Rgn*);
  271. void paint1(Reg*, int);
  272. ulong paint2(Reg*, int);
  273. void paint3(Reg*, int, long, int);
  274. void addreg(Adr*, int);
  275. /*
  276. * peep.c
  277. */
  278. void peep(void);
  279. void excise(Reg*);
  280. Reg* uniqp(Reg*);
  281. Reg* uniqs(Reg*);
  282. int regtyp(Adr*);
  283. int anyvar(Adr*);
  284. int subprop(Reg*);
  285. int copyprop(Reg*);
  286. int copy1(Adr*, Adr*, Reg*, int);
  287. int copyu(Prog*, Adr*, Adr*);
  288. int copyas(Adr*, Adr*);
  289. int copyau(Adr*, Adr*);
  290. int copysub(Adr*, Adr*, Adr*, int);
  291. int copysub1(Prog*, Adr*, Adr*, int);
  292. long RtoB(int);
  293. long FtoB(int);
  294. int BtoR(long);
  295. int BtoF(long);
  296. #define D_HI D_NONE
  297. #define D_LO D_NONE
  298. /*
  299. * bound
  300. */
  301. void comtarg(void);
  302. /*
  303. * com64
  304. */
  305. int cond(int);
  306. int com64(Node*);
  307. void com64init(void);
  308. void bool64(Node*);
  309. long lo64v(Node*);
  310. long hi64v(Node*);
  311. Node* lo64(Node*);
  312. Node* hi64(Node*);
  313. /*
  314. * div/mul
  315. */
  316. void sdivgen(Node*, Node*, Node*, Node*);
  317. void udivgen(Node*, Node*, Node*, Node*);
  318. void sdiv2(long, int, Node*, Node*);
  319. void smod2(long, int, Node*, Node*);
  320. void mulgen(Type*, Node*, Node*);
  321. void genmuladd(Node*, Node*, int, Node*);
  322. void shiftit(Type*, Node*, Node*);
  323. #pragma varargck type "A" int
  324. #pragma varargck type "B" Bits
  325. #pragma varargck type "D" Adr*
  326. #pragma varargck type "P" Prog*
  327. #pragma varargck type "R" int
  328. #pragma varargck type "S" char*
  329. /* wrecklessly steal a field */
  330. #define rplink label