gc.h 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356
  1. #include "../cc/cc.h"
  2. #include "../2c/2.out.h"
  3. /*
  4. * 2c/68020
  5. * Motorola 68020
  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 ALLOP OEND
  16. #define NRGN 300
  17. #define FNX 100
  18. #define INDEXED 9
  19. #define PRE 1
  20. #define POST 2
  21. #define TEST 4
  22. typedef struct Adr Adr;
  23. typedef struct Prog Prog;
  24. typedef struct Txt Txt;
  25. typedef struct Cases Case;
  26. typedef struct Reg Reg;
  27. typedef struct Rgn Rgn;
  28. typedef struct Var Var;
  29. typedef struct Multab Multab;
  30. typedef struct C1 C1;
  31. typedef struct Index Index;
  32. struct Index
  33. {
  34. int o0;
  35. int o1;
  36. };
  37. EXTERN struct
  38. {
  39. Node* regtree;
  40. Node* basetree;
  41. short scale;
  42. } idx;
  43. struct Adr
  44. {
  45. long displace;
  46. long offset;
  47. char sval[NSNAME];
  48. double dval;
  49. Sym* sym;
  50. short type;
  51. short index;
  52. short scale;
  53. short field;
  54. short etype;
  55. };
  56. #define A ((Adr*)0)
  57. struct Prog
  58. {
  59. Adr from;
  60. Adr to;
  61. Prog* link;
  62. long lineno;
  63. short as;
  64. };
  65. #define P ((Prog*)0)
  66. struct Txt
  67. {
  68. short movas;
  69. short postext;
  70. char preclr;
  71. };
  72. struct Cases
  73. {
  74. long val;
  75. long label;
  76. uchar def;
  77. Case* link;
  78. };
  79. #define C ((Case*)0)
  80. struct Var
  81. {
  82. long offset;
  83. Sym* sym;
  84. char type;
  85. char etype;
  86. };
  87. struct Reg
  88. {
  89. long pc;
  90. long rpo; /* reverse post ordering */
  91. Bits set;
  92. Bits use1;
  93. Bits use2;
  94. Bits refbehind;
  95. Bits refahead;
  96. Bits calbehind;
  97. Bits calahead;
  98. Bits regdiff;
  99. Bits act;
  100. ulong regu;
  101. long loop; /* could be shorter */
  102. Reg* log5;
  103. long active;
  104. Reg* p1;
  105. Reg* p2;
  106. Reg* p2link;
  107. Reg* s1;
  108. Reg* s2;
  109. Reg* link;
  110. Prog* prog;
  111. };
  112. #define R ((Reg*)0)
  113. struct Rgn
  114. {
  115. Reg* enter;
  116. short costr;
  117. short costa;
  118. short varno;
  119. short regno;
  120. };
  121. struct Multab
  122. {
  123. short val;
  124. char code[6];
  125. };
  126. struct C1
  127. {
  128. long val;
  129. long label;
  130. };
  131. #define BLOAD(r) band(bnot(r->refbehind), r->refahead)
  132. #define BSTORE(r) band(bnot(r->calbehind), r->calahead)
  133. #define LOAD(r) (~r->refbehind.b[z] & r->refahead.b[z])
  134. #define STORE(r) (~r->calbehind.b[z] & r->calahead.b[z])
  135. #define bset(a,n) ((a).b[(n)/32]&(1L<<(n)%32))
  136. #define CLOAD 8
  137. #define CREF 5
  138. #define CTEST 2
  139. #define CXREF 3
  140. #define CINF 1000
  141. #define LOOP 3
  142. EXTERN Bits externs;
  143. EXTERN Bits params;
  144. EXTERN Bits addrs;
  145. EXTERN ulong regbits;
  146. #define B_INDIR (1<<0)
  147. #define B_ADDR (1<<1)
  148. EXTERN int mvbits;
  149. EXTERN int changer;
  150. EXTERN int changea;
  151. EXTERN Txt txt[NTYPE][NTYPE];
  152. EXTERN short opxt[ALLOP][NTYPE];
  153. EXTERN Txt* txtp;
  154. EXTERN int multabsize;
  155. EXTERN Reg* firstr;
  156. EXTERN Reg* lastr;
  157. EXTERN Reg zreg;
  158. EXTERN Reg* freer;
  159. EXTERN long argoff;
  160. EXTERN long breakpc;
  161. EXTERN Case* cases;
  162. EXTERN long continpc;
  163. EXTERN Prog* firstp;
  164. EXTERN Reg* firstr;
  165. EXTERN int inargs;
  166. EXTERN Prog* lastp;
  167. EXTERN int retok;
  168. EXTERN long mnstring;
  169. EXTERN Node* nodrat;
  170. EXTERN Node* nodret;
  171. EXTERN long nrathole;
  172. EXTERN long nstatic;
  173. EXTERN int nregion;
  174. EXTERN long nstring;
  175. EXTERN int nvar;
  176. EXTERN Prog* p;
  177. EXTERN long pc;
  178. EXTERN Rgn region[NRGN];
  179. EXTERN Rgn* rgp;
  180. EXTERN char string[NSNAME];
  181. EXTERN Sym* symrathole;
  182. EXTERN Sym* symstatic;
  183. EXTERN Var var[NVAR];
  184. EXTERN long* idom;
  185. EXTERN Reg** rpo2r;
  186. EXTERN long maxnr;
  187. EXTERN Prog zprog;
  188. EXTERN uchar regused[NREG];
  189. EXTERN uchar aregused[NREG];
  190. EXTERN uchar fregused[NREG];
  191. EXTERN uchar regbase[I_MASK];
  192. EXTERN long exregoffset;
  193. EXTERN long exaregoffset;
  194. EXTERN long exfregoffset;
  195. extern char* anames[];
  196. extern Multab multab[];
  197. void cgen(Node*, int, Node*);
  198. void lcgen(Node*, int, Node*);
  199. void bcgen(Node*, int);
  200. void boolgen(Node*, int, int, Node*, Node*);
  201. void sugen(Node*, int, Node*, long);
  202. void listinit(void);
  203. int Bconv(Fmt*);
  204. int Pconv(Fmt*);
  205. int Aconv(Fmt*);
  206. int Xconv(Fmt*);
  207. int Dconv(Fmt*);
  208. int Rconv(Fmt*);
  209. int Sconv(Fmt*);
  210. void peep(void);
  211. void excise(Reg*);
  212. Reg* uniqp(Reg*);
  213. Reg* uniqs(Reg*);
  214. int findtst(Reg*, Prog*, int);
  215. int setcc(Prog*, Prog*);
  216. int compat(Adr*, Adr*);
  217. int aregind(Adr*);
  218. int asize(int);
  219. int usedin(int, Adr*);
  220. Reg* findccr(Reg*);
  221. int setccr(Prog*);
  222. Reg* findop(Reg*, int, int, int);
  223. int regtyp(int);
  224. int anyvar(Adr*);
  225. int subprop(Reg*);
  226. int copyprop(Reg*);
  227. int copy1(Adr*, Adr*, Reg*, int);
  228. int copyu(Prog*, Adr*, Adr*);
  229. int copyas(Adr*, Adr*);
  230. int tasas(Adr*, Adr*);
  231. int copyau(Adr*, Adr*);
  232. int copysub(Adr*, Adr*, Adr*, Prog*, int);
  233. ulong RtoB(int);
  234. ulong AtoB(int);
  235. ulong FtoB(int);
  236. int BtoR(ulong);
  237. int BtoA(ulong);
  238. int BtoF(ulong);
  239. Reg* rega(void);
  240. int rcmp(const void*, const void*);
  241. void regopt(Prog*);
  242. void addmove(Reg*, int, int, int);
  243. Bits mkvar(Adr*, int);
  244. void prop(Reg*, Bits, Bits);
  245. void loopit(Reg*, long);
  246. void synch(Reg*, Bits);
  247. ulong allreg(ulong, Rgn*);
  248. void paint1(Reg*, int);
  249. ulong paint2(Reg*, int);
  250. void paint3(Reg*, int, ulong, int);
  251. void addreg(Adr*, int);
  252. void codgen(Node*, Node*);
  253. void gen(Node*);
  254. void usedset(Node*, int);
  255. void noretval(int);
  256. Node* nodconst(long);
  257. int swcmp(const void*, const void*);
  258. void doswit(int, Node*);
  259. void swit1(C1*, int, long, int, Node*);
  260. void cas(void);
  261. int bitload(Node*, int, int, int, Node*);
  262. void bitstore(Node*, int, int, int, int, Node*);
  263. long outstring(char*, long);
  264. int doinc(Node*, int);
  265. void setsp(void);
  266. void adjsp(long);
  267. int simplv(Node*);
  268. int eval(Node*, int);
  269. void outcode(void);
  270. void ieeedtod(Ieee*, double);
  271. int nodalloc(Type*, int, Node*);
  272. int mulcon(Node*, Node*, int, Node*);
  273. int shlcon(Node*, Node*, int, Node*);
  274. int mulcon1(Node*, long, int, Node*);
  275. void nullwarn(Node*, Node*);
  276. void tindex(Type*, Type*);
  277. void ginit(void);
  278. void gclean(void);
  279. void oinit(int, int, int, int, int, int);
  280. Prog* prg(void);
  281. void nextpc(void);
  282. void gargs(Node*);
  283. void naddr(Node*, Adr*, int);
  284. int regalloc(Type*, int);
  285. int regaddr(int);
  286. int regpair(int);
  287. int regret(Type*);
  288. void regfree(int);
  289. void gmove(Type*, Type*, int, Node*, int, Node*);
  290. void gopcode(int, Type*, int, Node*, int, Node*);
  291. void asopt(void);
  292. int relindex(int);
  293. void gbranch(int);
  294. void fpbranch(void);
  295. void patch(Prog*, long);
  296. void gpseudo(int, Sym*, int, long);
  297. void indx(Node*);
  298. void bcomplex(Node*);
  299. /*
  300. * com64
  301. */
  302. int com64(Node*);
  303. void com64init(void);
  304. void bool64(Node*);
  305. #pragma varargck type "A" int
  306. #pragma varargck type "B" Bits
  307. #pragma varargck type "D" Adr*
  308. #pragma varargck type "N" Adr*
  309. #pragma varargck type "P" Prog*
  310. #pragma varargck type "S" char*
  311. #pragma varargck type "R" int
  312. #pragma varargck type "X" Index