sched.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801
  1. #include "l.h"
  2. enum
  3. {
  4. E_ICC = 1<<0,
  5. E_FCC = 1<<1,
  6. E_MEM = 1<<2,
  7. E_MEMSP = 1<<3, /* uses offset and size */
  8. E_MEMSB = 1<<4, /* uses offset and size */
  9. E_LR = 1<<5,
  10. E_CR = 1<<6,
  11. E_CTR = 1<<7,
  12. E_XER = 1<<8,
  13. E_CR0 = 0xF<<0,
  14. E_CR1 = 0xF<<4,
  15. ANYMEM = E_MEM|E_MEMSP|E_MEMSB,
  16. ALL = ~0,
  17. };
  18. typedef struct Sch Sch;
  19. typedef struct Dep Dep;
  20. struct Dep
  21. {
  22. ulong ireg;
  23. ulong freg;
  24. ulong cc;
  25. ulong cr;
  26. };
  27. struct Sch
  28. {
  29. Prog p;
  30. Dep set;
  31. Dep used;
  32. long soffset;
  33. char size;
  34. char comp;
  35. };
  36. void regused(Sch*, Prog*);
  37. int depend(Sch*, Sch*);
  38. int conflict(Sch*, Sch*);
  39. int offoverlap(Sch*, Sch*);
  40. void dumpbits(Sch*, Dep*);
  41. void
  42. sched(Prog *p0, Prog *pe)
  43. {
  44. Prog *p, *q;
  45. Sch sch[NSCHED], *s, *t, *u, *se, stmp;
  46. if(!debug['Q'])
  47. return;
  48. /*
  49. * build side structure
  50. */
  51. s = sch;
  52. for(p=p0;; p=p->link) {
  53. memset(s, 0, sizeof(*s));
  54. s->p = *p;
  55. regused(s, p);
  56. if(debug['X']) {
  57. Bprint(&bso, "%P\tset", &s->p);
  58. dumpbits(s, &s->set);
  59. Bprint(&bso, "; used");
  60. dumpbits(s, &s->used);
  61. if(s->comp)
  62. Bprint(&bso, "; compound");
  63. if(s->p.mark & LOAD)
  64. Bprint(&bso, "; load");
  65. if(s->p.mark & BRANCH)
  66. Bprint(&bso, "; branch");
  67. if(s->p.mark & FCMP)
  68. Bprint(&bso, "; fcmp");
  69. Bprint(&bso, "\n");
  70. }
  71. s++;
  72. if(p == pe)
  73. break;
  74. }
  75. se = s;
  76. for(s=se-1; s>=sch; s--) {
  77. /*
  78. * load delay. interlocked.
  79. */
  80. if(s->p.mark & LOAD) {
  81. if(s >= se-1)
  82. continue;
  83. if(!conflict(s, (s+1)))
  84. continue;
  85. /*
  86. * s is load, s+1 is immediate use of result
  87. * t is the trial instruction to insert between s and s+1
  88. */
  89. for(t=s-1; t>=sch; t--) {
  90. if(t->p.mark & BRANCH)
  91. goto no2;
  92. if(t->p.mark & FCMP)
  93. if((s+1)->p.mark & BRANCH)
  94. goto no2;
  95. if(t->p.mark & LOAD)
  96. if(conflict(t, (s+1)))
  97. goto no2;
  98. for(u=t+1; u<=s; u++)
  99. if(depend(u, t))
  100. goto no2;
  101. goto out2;
  102. no2:;
  103. }
  104. if(debug['X'])
  105. Bprint(&bso, "?l%P\n", &s->p);
  106. continue;
  107. out2:
  108. if(debug['X']) {
  109. Bprint(&bso, "!l%P\n", &t->p);
  110. Bprint(&bso, "%P\n", &s->p);
  111. }
  112. stmp = *t;
  113. memmove(t, t+1, (uchar*)s - (uchar*)t);
  114. *s = stmp;
  115. s--;
  116. continue;
  117. }
  118. /*
  119. * fop2 delay.
  120. */
  121. if(s->p.mark & FCMP) {
  122. if(s >= se-1)
  123. continue;
  124. if(!((s+1)->p.mark & BRANCH))
  125. continue;
  126. /* t is the trial instruction to use */
  127. for(t=s-1; t>=sch; t--) {
  128. for(u=t+1; u<=s; u++)
  129. if(depend(u, t))
  130. goto no3;
  131. goto out3;
  132. no3:;
  133. }
  134. if(debug['X'])
  135. Bprint(&bso, "?f%P\n", &s->p);
  136. continue;
  137. out3:
  138. if(debug['X']) {
  139. Bprint(&bso, "!f%P\n", &t->p);
  140. Bprint(&bso, "%P\n", &s->p);
  141. }
  142. stmp = *t;
  143. memmove(t, t+1, (uchar*)s - (uchar*)t);
  144. *s = stmp;
  145. s--;
  146. continue;
  147. }
  148. }
  149. /*
  150. * put it all back
  151. */
  152. for(s=sch, p=p0; s<se; s++, p=q) {
  153. q = p->link;
  154. if(q != s->p.link) {
  155. *p = s->p;
  156. p->link = q;
  157. }
  158. }
  159. if(debug['X'])
  160. Bprint(&bso, "\n");
  161. }
  162. void
  163. regused(Sch *s, Prog *realp)
  164. {
  165. int c, ar, ad, ld, sz, nr, upd;
  166. ulong m;
  167. Prog *p;
  168. p = &s->p;
  169. s->comp = compound(p);
  170. if(s->comp) {
  171. s->set.ireg |= 1<<REGTMP;
  172. s->used.ireg |= 1<<REGTMP;
  173. }
  174. ar = 0; /* dest is really reference */
  175. ad = 0; /* source/dest is really address */
  176. ld = 0; /* opcode is load instruction */
  177. sz = 32*4; /* size of load/store for overlap computation */
  178. nr = 0; /* source/dest is not really reg */
  179. upd = 0; /* move with update; changes reg */
  180. /*
  181. * flags based on opcode
  182. */
  183. switch(p->as) {
  184. case ATEXT:
  185. curtext = realp;
  186. autosize = p->to.offset + 4;
  187. ad = 1;
  188. break;
  189. case ABL:
  190. s->set.cc |= E_LR;
  191. ar = 1;
  192. ad = 1;
  193. break;
  194. case ABR:
  195. ar = 1;
  196. ad = 1;
  197. break;
  198. case ACMP:
  199. s->set.cc |= E_ICC;
  200. if(p->reg == 0)
  201. s->set.cr |= E_CR0;
  202. else
  203. s->set.cr |= (0xF<<((p->reg&7)*4));
  204. ar = 1;
  205. break;
  206. case AFCMPO:
  207. case AFCMPU:
  208. s->set.cc |= E_FCC;
  209. if(p->reg == 0)
  210. s->set.cr |= E_CR0;
  211. else
  212. s->set.cr |= (0xF<<((p->reg&7)*4));
  213. ar = 1;
  214. break;
  215. case ACRAND:
  216. case ACRANDN:
  217. case ACREQV:
  218. case ACRNAND:
  219. case ACRNOR:
  220. case ACROR:
  221. case ACRORN:
  222. case ACRXOR:
  223. s->used.cr |= 1<<p->from.reg;
  224. s->set.cr |= 1<<p->to.reg;
  225. nr = 1;
  226. break;
  227. case ABCL: /* tricky */
  228. s->used.cc |= E_FCC|E_ICC;
  229. s->used.cr = ALL;
  230. s->set.cc |= E_LR;
  231. ar = 1;
  232. break;
  233. case ABC: /* tricky */
  234. s->used.cc |= E_FCC|E_ICC;
  235. s->used.cr = ALL;
  236. ar = 1;
  237. break;
  238. case ABEQ:
  239. case ABGE:
  240. case ABGT:
  241. case ABLE:
  242. case ABLT:
  243. case ABNE:
  244. case ABVC:
  245. case ABVS:
  246. s->used.cc |= E_ICC;
  247. s->used.cr |= E_CR0;
  248. ar = 1;
  249. break;
  250. case ALSW:
  251. case AMOVMW:
  252. /* could do better */
  253. sz = 32*4;
  254. ld = 1;
  255. break;
  256. case AMOVBU:
  257. case AMOVBZU:
  258. upd = 1;
  259. sz = 1;
  260. ld = 1;
  261. break;
  262. case AMOVB:
  263. case AMOVBZ:
  264. sz = 1;
  265. ld = 1;
  266. break;
  267. case AMOVHU:
  268. case AMOVHZU:
  269. upd = 1;
  270. sz = 2;
  271. ld = 1;
  272. break;
  273. case AMOVH:
  274. case AMOVHBR:
  275. case AMOVHZ:
  276. sz = 2;
  277. ld = 1;
  278. break;
  279. case AFMOVSU:
  280. case AMOVWU:
  281. upd = 1;
  282. sz = 4;
  283. ld = 1;
  284. break;
  285. case AFMOVS:
  286. case AMOVW:
  287. case AMOVWBR:
  288. case ALWAR:
  289. sz = 4;
  290. ld = 1;
  291. break;
  292. case AFMOVDU:
  293. upd = 1;
  294. sz = 8;
  295. ld = 1;
  296. break;
  297. case AFMOVD:
  298. sz = 8;
  299. ld = 1;
  300. break;
  301. case AFMOVDCC:
  302. sz = 8;
  303. ld = 1;
  304. s->set.cc |= E_FCC;
  305. s->set.cr |= E_CR1;
  306. break;
  307. case AMOVFL:
  308. case AMOVCRFS:
  309. case AMTFSB0:
  310. case AMTFSB0CC:
  311. case AMTFSB1:
  312. case AMTFSB1CC:
  313. s->set.ireg = ALL;
  314. s->set.freg = ALL;
  315. s->set.cc = ALL;
  316. s->set.cr = ALL;
  317. break;
  318. case AADDCC:
  319. case AADDVCC:
  320. case AADDCCC:
  321. case AADDCVCC:
  322. case AADDMECC:
  323. case AADDMEVCC:
  324. case AADDECC:
  325. case AADDEVCC:
  326. case AADDZECC:
  327. case AADDZEVCC:
  328. case AANDCC:
  329. case AANDNCC:
  330. case ACNTLZWCC:
  331. case ADIVWCC:
  332. case ADIVWVCC:
  333. case ADIVWUCC:
  334. case ADIVWUVCC:
  335. case AEQVCC:
  336. case AEXTSBCC:
  337. case AEXTSHCC:
  338. case AMULHWCC:
  339. case AMULHWUCC:
  340. case AMULLWCC:
  341. case AMULLWVCC:
  342. case ANANDCC:
  343. case ANEGCC:
  344. case ANEGVCC:
  345. case ANORCC:
  346. case AORCC:
  347. case AORNCC:
  348. case AREMCC:
  349. case AREMVCC:
  350. case AREMUCC:
  351. case AREMUVCC:
  352. case ARLWMICC:
  353. case ARLWNMCC:
  354. case ASLWCC:
  355. case ASRAWCC:
  356. case ASRWCC:
  357. case ASTWCCC:
  358. case ASUBCC:
  359. case ASUBVCC:
  360. case ASUBCCC:
  361. case ASUBCVCC:
  362. case ASUBMECC:
  363. case ASUBMEVCC:
  364. case ASUBECC:
  365. case ASUBEVCC:
  366. case ASUBZECC:
  367. case ASUBZEVCC:
  368. case AXORCC:
  369. s->set.cc |= E_ICC;
  370. s->set.cr |= E_CR0;
  371. break;
  372. case AFABSCC:
  373. case AFADDCC:
  374. case AFADDSCC:
  375. case AFCTIWCC:
  376. case AFCTIWZCC:
  377. case AFDIVCC:
  378. case AFDIVSCC:
  379. case AFMADDCC:
  380. case AFMADDSCC:
  381. case AFMSUBCC:
  382. case AFMSUBSCC:
  383. case AFMULCC:
  384. case AFMULSCC:
  385. case AFNABSCC:
  386. case AFNEGCC:
  387. case AFNMADDCC:
  388. case AFNMADDSCC:
  389. case AFNMSUBCC:
  390. case AFNMSUBSCC:
  391. case AFRSPCC:
  392. case AFSUBCC:
  393. case AFSUBSCC:
  394. s->set.cc |= E_FCC;
  395. s->set.cr |= E_CR1;
  396. break;
  397. }
  398. /*
  399. * flags based on 'to' field
  400. */
  401. c = p->to.class;
  402. if(c == 0) {
  403. c = aclass(&p->to) + 1;
  404. p->to.class = c;
  405. }
  406. c--;
  407. switch(c) {
  408. default:
  409. print("unknown class %d %D\n", c, &p->to);
  410. case C_NONE:
  411. case C_ZCON:
  412. case C_SCON:
  413. case C_UCON:
  414. case C_LCON:
  415. case C_ADDCON:
  416. case C_ANDCON:
  417. case C_SBRA:
  418. case C_LBRA:
  419. break;
  420. case C_CREG:
  421. c = p->to.reg;
  422. if(c == NREG)
  423. s->set.cr = ALL;
  424. else
  425. s->set.cr |= (0xF << ((p->from.reg&7)*4));
  426. s->set.cc = ALL;
  427. break;
  428. case C_SPR:
  429. case C_SREG:
  430. case C_FPSCR:
  431. case C_MSR:
  432. case C_XER:
  433. s->set.ireg = ALL;
  434. s->set.freg = ALL;
  435. s->set.cc = ALL;
  436. s->set.cr = ALL;
  437. break;
  438. case C_LR:
  439. s->set.cc |= E_LR;
  440. break;
  441. case C_CTR:
  442. s->set.cc |= E_CTR;
  443. break;
  444. case C_ZOREG:
  445. case C_SOREG:
  446. case C_LOREG:
  447. c = p->to.reg;
  448. s->used.ireg |= 1<<c;
  449. if(upd)
  450. s->set.ireg |= 1<<c;
  451. if(ad)
  452. break;
  453. s->size = sz;
  454. s->soffset = regoff(&p->to);
  455. m = ANYMEM;
  456. if(c == REGSB)
  457. m = E_MEMSB;
  458. if(c == REGSP)
  459. m = E_MEMSP;
  460. if(ar)
  461. s->used.cc |= m;
  462. else
  463. s->set.cc |= m;
  464. break;
  465. case C_SACON:
  466. case C_LACON:
  467. s->used.ireg |= 1<<REGSP;
  468. if(upd)
  469. s->set.ireg |= 1<<c;
  470. break;
  471. case C_SECON:
  472. case C_LECON:
  473. s->used.ireg |= 1<<REGSB;
  474. if(upd)
  475. s->set.ireg |= 1<<c;
  476. break;
  477. case C_REG:
  478. if(nr)
  479. break;
  480. if(ar)
  481. s->used.ireg |= 1<<p->to.reg;
  482. else
  483. s->set.ireg |= 1<<p->to.reg;
  484. break;
  485. case C_FREG:
  486. if(ar)
  487. s->used.freg |= 1<<p->to.reg;
  488. else
  489. s->set.freg |= 1<<p->to.reg;
  490. break;
  491. case C_SAUTO:
  492. case C_LAUTO:
  493. s->used.ireg |= 1<<REGSP;
  494. if(upd)
  495. s->set.ireg |= 1<<c;
  496. if(ad)
  497. break;
  498. s->size = sz;
  499. s->soffset = regoff(&p->to);
  500. if(ar)
  501. s->used.cc |= E_MEMSP;
  502. else
  503. s->set.cc |= E_MEMSP;
  504. break;
  505. case C_SEXT:
  506. case C_LEXT:
  507. s->used.ireg |= 1<<REGSB;
  508. if(upd)
  509. s->set.ireg |= 1<<c;
  510. if(ad)
  511. break;
  512. s->size = sz;
  513. s->soffset = regoff(&p->to);
  514. if(ar)
  515. s->used.cc |= E_MEMSB;
  516. else
  517. s->set.cc |= E_MEMSB;
  518. break;
  519. }
  520. /*
  521. * flags based on 'from' field
  522. */
  523. c = p->from.class;
  524. if(c == 0) {
  525. c = aclass(&p->from) + 1;
  526. p->from.class = c;
  527. }
  528. c--;
  529. switch(c) {
  530. default:
  531. print("unknown class %d %D\n", c, &p->from);
  532. case C_NONE:
  533. case C_ZCON:
  534. case C_SCON:
  535. case C_UCON:
  536. case C_LCON:
  537. case C_ADDCON:
  538. case C_ANDCON:
  539. case C_SBRA:
  540. case C_LBRA:
  541. c = p->from.reg;
  542. if(c != NREG)
  543. s->used.ireg |= 1<<c;
  544. break;
  545. case C_CREG:
  546. c = p->from.reg;
  547. if(c == NREG)
  548. s->used.cr = ALL;
  549. else
  550. s->used.cr |= (0xF << ((p->from.reg&7)*4));
  551. s->used.cc = ALL;
  552. break;
  553. case C_SPR:
  554. case C_SREG:
  555. case C_FPSCR:
  556. case C_MSR:
  557. case C_XER:
  558. s->set.ireg = ALL;
  559. s->set.freg = ALL;
  560. s->set.cc = ALL;
  561. s->set.cr = ALL;
  562. break;
  563. case C_LR:
  564. s->used.cc |= E_LR;
  565. break;
  566. case C_CTR:
  567. s->used.cc |= E_CTR;
  568. break;
  569. case C_ZOREG:
  570. case C_SOREG:
  571. case C_LOREG:
  572. c = p->from.reg;
  573. s->used.ireg |= 1<<c;
  574. if(ld)
  575. p->mark |= LOAD;
  576. if(ad)
  577. break;
  578. s->size = sz;
  579. s->soffset = regoff(&p->from);
  580. m = ANYMEM;
  581. if(c == REGSB)
  582. m = E_MEMSB;
  583. if(c == REGSP)
  584. m = E_MEMSP;
  585. s->used.cc |= m;
  586. break;
  587. case C_SACON:
  588. case C_LACON:
  589. s->used.ireg |= 1<<REGSP;
  590. break;
  591. case C_SECON:
  592. case C_LECON:
  593. s->used.ireg |= 1<<REGSB;
  594. break;
  595. case C_REG:
  596. if(nr)
  597. break;
  598. s->used.ireg |= 1<<p->from.reg;
  599. break;
  600. case C_FREG:
  601. s->used.freg |= 1<<p->from.reg;
  602. break;
  603. case C_SAUTO:
  604. case C_LAUTO:
  605. s->used.ireg |= 1<<REGSP;
  606. if(ld)
  607. p->mark |= LOAD;
  608. if(ad)
  609. break;
  610. s->size = sz;
  611. s->soffset = regoff(&p->from);
  612. s->used.cc |= E_MEMSP;
  613. break;
  614. case C_SEXT:
  615. case C_LEXT:
  616. s->used.ireg |= 1<<REGSB;
  617. if(ld)
  618. p->mark |= LOAD;
  619. if(ad)
  620. break;
  621. s->size = sz;
  622. s->soffset = regoff(&p->from);
  623. s->used.cc |= E_MEMSB;
  624. break;
  625. }
  626. c = p->reg;
  627. if(c != NREG) {
  628. if(p->from.type == D_FREG || p->to.type == D_FREG)
  629. s->used.freg |= 1<<c;
  630. else
  631. s->used.ireg |= 1<<c;
  632. }
  633. }
  634. /*
  635. * test to see if 2 instrictions can be
  636. * interchanged without changing semantics
  637. */
  638. int
  639. depend(Sch *sa, Sch *sb)
  640. {
  641. ulong x;
  642. if(sa->set.ireg & (sb->set.ireg|sb->used.ireg))
  643. return 1;
  644. if(sb->set.ireg & sa->used.ireg)
  645. return 1;
  646. if(sa->set.freg & (sb->set.freg|sb->used.freg))
  647. return 1;
  648. if(sb->set.freg & sa->used.freg)
  649. return 1;
  650. if(sa->set.cr & (sb->set.cr|sb->used.cr))
  651. return 1;
  652. if(sb->set.cr & sa->used.cr)
  653. return 1;
  654. x = (sa->set.cc & (sb->set.cc|sb->used.cc)) |
  655. (sb->set.cc & sa->used.cc);
  656. if(x) {
  657. /*
  658. * allow SB and SP to pass each other.
  659. * allow SB to pass SB iff doffsets are ok
  660. * anything else conflicts
  661. */
  662. if(x != E_MEMSP && x != E_MEMSB)
  663. return 1;
  664. x = sa->set.cc | sb->set.cc |
  665. sa->used.cc | sb->used.cc;
  666. if(x & E_MEM)
  667. return 1;
  668. if(offoverlap(sa, sb))
  669. return 1;
  670. }
  671. return 0;
  672. }
  673. int
  674. offoverlap(Sch *sa, Sch *sb)
  675. {
  676. if(sa->soffset < sb->soffset) {
  677. if(sa->soffset+sa->size > sb->soffset)
  678. return 1;
  679. return 0;
  680. }
  681. if(sb->soffset+sb->size > sa->soffset)
  682. return 1;
  683. return 0;
  684. }
  685. /*
  686. * test 2 adjacent instructions
  687. * and find out if inserted instructions
  688. * are desired to prevent stalls.
  689. * first instruction is a load instruction.
  690. */
  691. int
  692. conflict(Sch *sa, Sch *sb)
  693. {
  694. if(sa->set.ireg & sb->used.ireg)
  695. return 1;
  696. if(sa->set.freg & sb->used.freg)
  697. return 1;
  698. if(sa->set.cr & sb->used.cr)
  699. return 1;
  700. return 0;
  701. }
  702. int
  703. compound(Prog *p)
  704. {
  705. Optab *o;
  706. o = oplook(p);
  707. if(o->size != 4)
  708. return 1;
  709. if(p->to.type == D_REG && p->to.reg == REGSB)
  710. return 1;
  711. return 0;
  712. }
  713. void
  714. dumpbits(Sch *s, Dep *d)
  715. {
  716. int i;
  717. for(i=0; i<32; i++)
  718. if(d->ireg & (1<<i))
  719. Bprint(&bso, " R%d", i);
  720. for(i=0; i<32; i++)
  721. if(d->freg & (1<<i))
  722. Bprint(&bso, " F%d", i);
  723. for(i=0; i<32; i++)
  724. if(d->cr & (1<<i))
  725. Bprint(&bso, " C%d", i);
  726. for(i=0; i<32; i++)
  727. switch(d->cc & (1<<i)) {
  728. default:
  729. break;
  730. case E_ICC:
  731. Bprint(&bso, " ICC");
  732. break;
  733. case E_FCC:
  734. Bprint(&bso, " FCC");
  735. break;
  736. case E_LR:
  737. Bprint(&bso, " LR");
  738. break;
  739. case E_CR:
  740. Bprint(&bso, " CR");
  741. break;
  742. case E_CTR:
  743. Bprint(&bso, " CTR");
  744. break;
  745. case E_XER:
  746. Bprint(&bso, " XER");
  747. break;
  748. case E_MEM:
  749. Bprint(&bso, " MEM%d", s->size);
  750. break;
  751. case E_MEMSB:
  752. Bprint(&bso, " SB%d", s->size);
  753. break;
  754. case E_MEMSP:
  755. Bprint(&bso, " SP%d", s->size);
  756. break;
  757. }
  758. }