span.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584
  1. #include "l.h"
  2. void
  3. span(void)
  4. {
  5. Prog *p;
  6. Sym *setext;
  7. Optab *o;
  8. int m;
  9. long c;
  10. if(debug['v'])
  11. Bprint(&bso, "%5.2f span\n", cputime());
  12. Bflush(&bso);
  13. c = INITTEXT;
  14. for(p = firstp; p != P; p = p->link) {
  15. p->pc = c;
  16. o = oplook(p);
  17. m = o->size;
  18. if(m == 0) {
  19. if(p->as == ATEXT) {
  20. curtext = p;
  21. autosize = p->to.offset + 8;
  22. if(p->from.sym != S)
  23. p->from.sym->value = c;
  24. continue;
  25. }
  26. diag("zero-width instruction\n%P\n", p);
  27. continue;
  28. }
  29. c += m;
  30. }
  31. c = rnd(c, 8);
  32. setext = lookup("etext", 0);
  33. if(setext != S) {
  34. setext->value = c;
  35. textsize = c - INITTEXT;
  36. }
  37. if(INITRND)
  38. INITDAT = rnd(c, INITRND);
  39. if(debug['v'])
  40. Bprint(&bso, "tsize = %lux\n", textsize);
  41. Bflush(&bso);
  42. }
  43. void
  44. xdefine(char *p, int t, long v)
  45. {
  46. Sym *s;
  47. s = lookup(p, 0);
  48. if(s->type == 0 || s->type == SXREF) {
  49. s->type = t;
  50. s->value = v;
  51. }
  52. }
  53. vlong /* BUG? */
  54. regoff(Adr *a)
  55. {
  56. offset = 0;
  57. aclass(a);
  58. return offset;
  59. }
  60. /*
  61. * note that we can't generate every 32 bit constant with MOVQA+MOVQAH, hence the
  62. * comparison with 0x7fff8000. offset >= this value gets incorrectly sign extended in
  63. * the 64 bit register.
  64. */
  65. aclass(Adr *a)
  66. {
  67. Sym *s;
  68. int t;
  69. switch(a->type) {
  70. case D_NONE:
  71. return C_NONE;
  72. case D_REG:
  73. return C_REG;
  74. case D_FREG:
  75. return C_FREG;
  76. case D_FCREG:
  77. return C_FCREG;
  78. case D_PREG:
  79. return C_PREG;
  80. case D_PCC:
  81. return C_PCC;
  82. case D_OREG:
  83. switch(a->name) {
  84. case D_EXTERN:
  85. case D_STATIC:
  86. if(a->sym == 0) {
  87. print("null sym external\n");
  88. print("%D\n", a);
  89. return C_GOK;
  90. }
  91. t = a->sym->type;
  92. if(t == 0 || t == SXREF) {
  93. diag("undefined external: %s in %s\n",
  94. a->sym->name, TNAME);
  95. a->sym->type = SDATA;
  96. }
  97. offset = a->sym->value + a->offset - BIG;
  98. if(offset >= -BIG && offset < BIG)
  99. return C_SEXT;
  100. if (offset >= -0x80000000LL && offset < 0x7fff8000LL)
  101. return C_LEXT;
  102. badoff:
  103. diag("offset out of range: 0x%lux", offset);
  104. return C_GOK;
  105. case D_AUTO:
  106. offset = autosize + a->offset;
  107. if(offset >= -BIG && offset < BIG)
  108. return C_SAUTO;
  109. if (offset >= -0x80000000LL && offset < 0x7fff8000LL)
  110. return C_LAUTO;
  111. goto badoff;
  112. case D_PARAM:
  113. offset = autosize + a->offset + 8L;
  114. if(offset >= -BIG && offset < BIG)
  115. return C_SAUTO;
  116. if (offset >= -0x80000000LL && offset < 0x7fff8000LL)
  117. return C_LAUTO;
  118. goto badoff;
  119. case D_NONE:
  120. offset = a->offset;
  121. if(offset == 0)
  122. return C_ZOREG;
  123. if(offset >= -BIG && offset < BIG)
  124. return C_SOREG;
  125. if (offset >= -0x80000000LL && offset < 0x7fff8000LL)
  126. return C_LOREG;
  127. goto badoff;
  128. }
  129. return C_GOK;
  130. case D_CONST:
  131. switch(a->name) {
  132. case D_NONE:
  133. offset = a->offset;
  134. if(offset > 0) {
  135. if(offset <= 0xffLL)
  136. return C_BCON;
  137. if(offset <= 0x7fffLL)
  138. return C_SCON;
  139. if((offset & 0xffffLL) == 0 && offset <= 0x7fff0000LL)
  140. return C_UCON;
  141. if (offset < 0x7fff8000LL)
  142. return C_LCON;
  143. return C_QCON;
  144. }
  145. if(offset == 0)
  146. return C_ZCON;
  147. if(offset >= -0x100LL)
  148. return C_NCON;
  149. if(offset >= -0x8000LL)
  150. return C_SCON;
  151. if((offset & 0xffffLL) == 0 && offset >= -0x80000000LL)
  152. return C_UCON;
  153. if (offset >= -0x80000000LL)
  154. return C_LCON;
  155. return C_QCON;
  156. case D_EXTERN:
  157. case D_STATIC:
  158. s = a->sym;
  159. if(s == 0) {
  160. print("null sym const\n");
  161. print("%D\n", a);
  162. return C_GOK;
  163. }
  164. t = s->type;
  165. if(t == 0 || t == SXREF) {
  166. diag("undefined external: %s in %s\n",
  167. s->name, TNAME);
  168. s->type = SDATA;
  169. }
  170. if(s->type == STEXT || s->type == SLEAF) {
  171. offset = s->value + a->offset;
  172. return C_LCON;
  173. }
  174. offset = s->value + a->offset - BIG;
  175. if (offset == 0L) {
  176. offset = s->value + a->offset + INITDAT;
  177. return C_LCON; /* botch */
  178. }
  179. if(offset >= -BIG && offset < BIG && offset != 0L)
  180. return C_SECON;
  181. if (offset >= -0x80000000LL && offset < 0x7fff8000L && offset != 0LL /*&& offset >= -INITDAT*/)
  182. return C_LECON;
  183. /*offset = s->value + a->offset + INITDAT;*/
  184. /* if (offset >= -BIG && offset < BIG)
  185. return C_SCON;
  186. if (offset >= -0x80000000LL && offset < 0x7fff8000LL)
  187. return C_LCON; */
  188. goto badoff;
  189. /*return C_QCON;*/
  190. case D_AUTO:
  191. offset = autosize + a->offset;
  192. if(offset >= -BIG && offset < BIG)
  193. return C_SACON;
  194. if (offset >= -0x80000000LL && offset < 0x7fff8000LL)
  195. return C_LACON;
  196. goto badoff;
  197. case D_PARAM:
  198. offset = autosize + a->offset + 8L;
  199. if(offset >= -BIG && offset < BIG)
  200. return C_SACON;
  201. if (offset >= -0x80000000LL && offset < 0x7fff8000LL)
  202. return C_LACON;
  203. goto badoff;
  204. }
  205. return C_GOK;
  206. case D_BRANCH:
  207. return C_SBRA;
  208. }
  209. return C_GOK;
  210. }
  211. Optab*
  212. oplook(Prog *p)
  213. {
  214. int a1, a2, a3, r;
  215. char *c1, *c3;
  216. Optab *o, *e;
  217. a1 = p->optab;
  218. if(a1)
  219. return optab+(a1-1);
  220. a1 = p->from.class;
  221. if(a1 == 0) {
  222. a1 = aclass(&p->from) + 1;
  223. p->from.class = a1;
  224. }
  225. a1--;
  226. a3 = p->to.class;
  227. if(a3 == 0) {
  228. a3 = aclass(&p->to) + 1;
  229. p->to.class = a3;
  230. }
  231. a3--;
  232. a2 = C_NONE;
  233. if(p->reg != NREG)
  234. a2 = C_REG;
  235. r = p->as;
  236. o = oprange[r].start;
  237. if(o == 0) {
  238. a1 = opcross[repop[r]][a1][a2][a3];
  239. if(a1) {
  240. p->optab = a1+1;
  241. return optab+a1;
  242. }
  243. o = oprange[r].stop; /* just generate an error */
  244. }
  245. e = oprange[r].stop;
  246. c1 = xcmp[a1];
  247. c3 = xcmp[a3];
  248. for(; o<e; o++)
  249. if(o->a2 == a2)
  250. if(c1[o->a1])
  251. if(c3[o->a3]) {
  252. p->optab = (o-optab)+1;
  253. return o;
  254. }
  255. diag("illegal combination %A %d %d %d (opcross %d)\n",
  256. p->as, p->from.class-1, a2, a3, a1);
  257. if(!debug['a'])
  258. prasm(p);
  259. o = optab;
  260. p->optab = (o-optab)+1;
  261. return o;
  262. }
  263. int
  264. cmp(int a, int b)
  265. {
  266. if(a == b)
  267. return 1;
  268. switch(a) {
  269. case C_QCON:
  270. if(b == C_ZCON || b == C_BCON || b == C_NCON || b == C_SCON || b == C_UCON || b == C_LCON)
  271. return 1;
  272. break;
  273. case C_LCON:
  274. if(b == C_ZCON || b == C_BCON || b == C_NCON || b == C_SCON || b == C_UCON)
  275. return 1;
  276. break;
  277. case C_UCON:
  278. if(b == C_ZCON)
  279. return 1;
  280. break;
  281. case C_SCON:
  282. if(b == C_ZCON || b == C_BCON || b == C_NCON)
  283. return 1;
  284. break;
  285. case C_BCON:
  286. if(b == C_ZCON)
  287. return 1;
  288. break;
  289. case C_LACON:
  290. if(b == C_SACON)
  291. return 1;
  292. break;
  293. case C_LBRA:
  294. if(b == C_SBRA)
  295. return 1;
  296. break;
  297. case C_LEXT:
  298. if(b == C_SEXT)
  299. return 1;
  300. break;
  301. case C_LAUTO:
  302. if(b == C_SAUTO)
  303. return 1;
  304. break;
  305. case C_REG:
  306. /* if(b == C_ZCON)
  307. return 1; */
  308. break;
  309. case C_LOREG:
  310. if(b == C_ZOREG || b == C_SOREG)
  311. return 1;
  312. break;
  313. case C_SOREG:
  314. if(b == C_ZOREG)
  315. return 1;
  316. break;
  317. }
  318. return 0;
  319. }
  320. int
  321. ocmp(void *a1, void *a2)
  322. {
  323. Optab *p1, *p2;
  324. int n;
  325. p1 = a1;
  326. p2 = a2;
  327. n = p1->as - p2->as;
  328. if(n)
  329. return n;
  330. n = p1->a1 - p2->a1;
  331. if(n)
  332. return n;
  333. n = p1->a2 - p2->a2;
  334. if(n)
  335. return n;
  336. n = p1->a3 - p2->a3;
  337. if(n)
  338. return n;
  339. return 0;
  340. }
  341. void
  342. buildop(void)
  343. {
  344. int i, n, r;
  345. for(i=0; i<32; i++)
  346. for(n=0; n<32; n++)
  347. xcmp[i][n] = cmp(n, i);
  348. for(n=0; optab[n].as != AXXX; n++)
  349. ;
  350. qsort(optab, n, sizeof(optab[0]), ocmp);
  351. for(i=0; i<n; i++) {
  352. r = optab[i].as;
  353. oprange[r].start = optab+i;
  354. while(optab[i].as == r)
  355. i++;
  356. oprange[r].stop = optab+i;
  357. i--;
  358. switch(r)
  359. {
  360. default:
  361. diag("unknown op in build: %A\n", r);
  362. errorexit();
  363. case AADDQ:
  364. oprange[AS4ADDQ] = oprange[r];
  365. oprange[AS8ADDQ] = oprange[r];
  366. oprange[ASUBQ] = oprange[r];
  367. oprange[AS4SUBQ] = oprange[r];
  368. oprange[AS8SUBQ] = oprange[r];
  369. break;
  370. case AADDL:
  371. oprange[AADDLV] = oprange[r];
  372. oprange[AS4ADDL] = oprange[r];
  373. oprange[AS8ADDL] = oprange[r];
  374. oprange[AADDQV] = oprange[r];
  375. oprange[ASUBQV] = oprange[r];
  376. oprange[ASUBL] = oprange[r];
  377. oprange[ASUBLV] = oprange[r];
  378. oprange[AS4SUBL] = oprange[r];
  379. oprange[AS8SUBL] = oprange[r];
  380. break;
  381. case AAND:
  382. oprange[AANDNOT] = oprange[r];
  383. oprange[AOR] = oprange[r];
  384. oprange[AORNOT] = oprange[r];
  385. oprange[AXOR] = oprange[r];
  386. oprange[AXORNOT] = oprange[r];
  387. break;
  388. case AMULQ:
  389. oprange[ACMPEQ] = oprange[r];
  390. oprange[ACMPGT] = oprange[r];
  391. oprange[ACMPGE] = oprange[r];
  392. oprange[ACMPUGT] = oprange[r];
  393. oprange[ACMPUGE] = oprange[r];
  394. oprange[ACMPBLE] = oprange[r];
  395. oprange[ACMOVEQ] = oprange[r];
  396. oprange[ACMOVNE] = oprange[r];
  397. oprange[ACMOVLT] = oprange[r];
  398. oprange[ACMOVGE] = oprange[r];
  399. oprange[ACMOVLE] = oprange[r];
  400. oprange[ACMOVGT] = oprange[r];
  401. oprange[ACMOVLBS] = oprange[r];
  402. oprange[ACMOVLBC] = oprange[r];
  403. oprange[AMULL] = oprange[r];
  404. oprange[AMULLV] = oprange[r];
  405. oprange[AMULQV] = oprange[r];
  406. oprange[AUMULH] = oprange[r];
  407. oprange[ASLLQ] = oprange[r];
  408. oprange[ASRLQ] = oprange[r];
  409. oprange[ASRAQ] = oprange[r];
  410. oprange[AEXTBL] = oprange[r];
  411. oprange[AEXTWL] = oprange[r];
  412. oprange[AEXTLL] = oprange[r];
  413. oprange[AEXTQL] = oprange[r];
  414. oprange[AEXTWH] = oprange[r];
  415. oprange[AEXTLH] = oprange[r];
  416. oprange[AEXTQH] = oprange[r];
  417. oprange[AINSBL] = oprange[r];
  418. oprange[AINSWL] = oprange[r];
  419. oprange[AINSLL] = oprange[r];
  420. oprange[AINSQL] = oprange[r];
  421. oprange[AINSWH] = oprange[r];
  422. oprange[AINSLH] = oprange[r];
  423. oprange[AINSQH] = oprange[r];
  424. oprange[AMSKBL] = oprange[r];
  425. oprange[AMSKWL] = oprange[r];
  426. oprange[AMSKLL] = oprange[r];
  427. oprange[AMSKQL] = oprange[r];
  428. oprange[AMSKWH] = oprange[r];
  429. oprange[AMSKLH] = oprange[r];
  430. oprange[AMSKQH] = oprange[r];
  431. oprange[AZAP] = oprange[r];
  432. oprange[AZAPNOT] = oprange[r];
  433. break;
  434. case ABEQ:
  435. oprange[ABNE] = oprange[r];
  436. oprange[ABGE] = oprange[r];
  437. oprange[ABLE] = oprange[r];
  438. oprange[ABGT] = oprange[r];
  439. oprange[ABLT] = oprange[r];
  440. break;
  441. case AFBEQ:
  442. oprange[AFBNE] = oprange[r];
  443. oprange[AFBGE] = oprange[r];
  444. oprange[AFBLE] = oprange[r];
  445. oprange[AFBGT] = oprange[r];
  446. oprange[AFBLT] = oprange[r];
  447. break;
  448. case AMOVQ:
  449. oprange[AMOVL] = oprange[r];
  450. oprange[AMOVLU] = oprange[r];
  451. oprange[AMOVQU] = oprange[r];
  452. oprange[AMOVA] = oprange[r];
  453. oprange[AMOVAH] = oprange[r];
  454. oprange[AMOVBU] = oprange[r];
  455. oprange[AMOVWU] = oprange[r];
  456. oprange[AMOVB] = oprange[r];
  457. oprange[AMOVW] = oprange[r];
  458. break;
  459. case AMOVT:
  460. oprange[AMOVS] = oprange[r];
  461. break;
  462. case AADDT:
  463. oprange[AADDS] = oprange[r];
  464. oprange[ACMPTEQ] = oprange[r];
  465. oprange[ACMPTGT] = oprange[r];
  466. oprange[ACMPTGE] = oprange[r];
  467. oprange[ACMPTUN] = oprange[r];
  468. oprange[ADIVS] = oprange[r];
  469. oprange[ADIVT] = oprange[r];
  470. oprange[AMULS] = oprange[r];
  471. oprange[AMULT] = oprange[r];
  472. oprange[ASUBS] = oprange[r];
  473. oprange[ASUBT] = oprange[r];
  474. oprange[ACPYS] = oprange[r];
  475. oprange[ACPYSN] = oprange[r];
  476. oprange[ACPYSE] = oprange[r];
  477. oprange[ACVTLQ] = oprange[r];
  478. oprange[ACVTQL] = oprange[r];
  479. oprange[AFCMOVEQ] = oprange[r];
  480. oprange[AFCMOVNE] = oprange[r];
  481. oprange[AFCMOVLT] = oprange[r];
  482. oprange[AFCMOVGE] = oprange[r];
  483. oprange[AFCMOVLE] = oprange[r];
  484. oprange[AFCMOVGT] = oprange[r];
  485. break;
  486. case ACVTTQ:
  487. oprange[ACVTQT] = oprange[r];
  488. oprange[ACVTTS] = oprange[r];
  489. oprange[ACVTQS] = oprange[r];
  490. break;
  491. case AJMP:
  492. case AJSR:
  493. break;
  494. case ACALL_PAL:
  495. break;
  496. case AMOVQL:
  497. oprange[AMOVLL] = oprange[r];
  498. break;
  499. case AMOVQC:
  500. oprange[AMOVLC] = oprange[r];
  501. break;
  502. case AMOVQP:
  503. oprange[AMOVLP] = oprange[r];
  504. break;
  505. case AREI:
  506. oprange[AMB] = oprange[r];
  507. oprange[ATRAPB] = oprange[r];
  508. break;
  509. case AFETCH:
  510. oprange[AFETCHM] = oprange[r];
  511. break;
  512. case AWORD:
  513. case ATEXT:
  514. break;
  515. }
  516. }
  517. }
  518. void
  519. buildrep(int x, int as)
  520. {
  521. Opcross *p;
  522. Optab *e, *s, *o;
  523. int a1, a2, a3, n;
  524. if(C_NONE != 0 || C_REG != 1 || C_GOK >= 32 || x >= nelem(opcross)) {
  525. diag("assumptions fail in buildrep");
  526. errorexit();
  527. }
  528. repop[as] = x;
  529. p = (opcross + x);
  530. s = oprange[as].start;
  531. e = oprange[as].stop;
  532. for(o=e-1; o>=s; o--) {
  533. n = o-optab;
  534. for(a2=0; a2<2; a2++) {
  535. if(a2) {
  536. if(o->a2 == C_NONE)
  537. continue;
  538. } else
  539. if(o->a2 != C_NONE)
  540. continue;
  541. for(a1=0; a1<32; a1++) {
  542. if(!xcmp[a1][o->a1])
  543. continue;
  544. for(a3=0; a3<32; a3++)
  545. if(xcmp[a3][o->a3])
  546. (*p)[a1][a2][a3] = n;
  547. }
  548. }
  549. }
  550. oprange[as].start = 0;
  551. }