cg386set.pas 35 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 by Florian Klaempfl
  4. Generate i386 assembler for in set/case nodes
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16. ****************************************************************************
  17. }
  18. unit cg386set;
  19. interface
  20. uses
  21. tree;
  22. procedure secondin(var p : ptree);
  23. procedure secondcase(var p : ptree);
  24. implementation
  25. uses
  26. cobjects,verbose,globals,systems,
  27. symtable,aasm,i386,types,
  28. cgi386,cgai386,tgeni386,hcodegen;
  29. const
  30. bytes2Sxx:array[1..4] of Topsize=(S_B,S_W,S_NO,S_L);
  31. {*****************************************************************************
  32. SecondIn
  33. *****************************************************************************}
  34. procedure secondin(var p : ptree);
  35. type
  36. Tsetpart=record
  37. range:boolean; {Part is a range.}
  38. start,stop:byte; {Start/stop when range; Stop=element when an element.}
  39. end;
  40. var
  41. pushed,ranges : boolean;
  42. hr,pleftreg : tregister;
  43. opsize : topsize;
  44. setparts:array[1..8] of Tsetpart;
  45. i,numparts:byte;
  46. href,href2:Treference;
  47. l,l2 : plabel;
  48. function analizeset(Aset:Pconstset):boolean;
  49. type
  50. byteset=set of byte;
  51. var
  52. compares,maxcompares:word;
  53. i:byte;
  54. begin
  55. analizeset:=false;
  56. ranges:=false;
  57. numparts:=0;
  58. compares:=0;
  59. {Lots of comparisions take a lot of time, so do not allow
  60. too much comparisions. 8 comparisions are, however, still
  61. smalller than emitting the set.}
  62. maxcompares:=5;
  63. if cs_littlesize in aktglobalswitches then
  64. maxcompares:=8;
  65. for i:=0 to 255 do
  66. if i in byteset(Aset^) then
  67. begin
  68. if (numparts=0) or
  69. (i<>setparts[numparts].stop+1) then
  70. begin
  71. {Set element is a separate element.}
  72. inc(compares);
  73. if compares>maxcompares then
  74. exit;
  75. inc(numparts);
  76. setparts[numparts].range:=false;
  77. setparts[numparts].stop:=i;
  78. end
  79. else
  80. {Set element is part of a range.}
  81. if not setparts[numparts].range then
  82. begin
  83. {Transform an element into a range.}
  84. setparts[numparts].range:=true;
  85. setparts[numparts].start:=
  86. setparts[numparts].stop;
  87. setparts[numparts].stop:=i;
  88. inc(compares);
  89. if compares>maxcompares then
  90. exit;
  91. end
  92. else
  93. begin
  94. {Extend a range.}
  95. setparts[numparts].stop:=i;
  96. {A range of two elements can better
  97. be checked as two separate ones.
  98. When extending a range, our range
  99. becomes larger than two elements.}
  100. ranges:=true;
  101. end;
  102. end;
  103. analizeset:=true;
  104. end;
  105. begin
  106. if psetdef(p^.right^.resulttype)^.settype=smallset then
  107. begin
  108. if p^.left^.treetype=ordconstn then
  109. begin
  110. { only compulsory }
  111. secondpass(p^.left);
  112. secondpass(p^.right);
  113. if codegenerror then
  114. exit;
  115. p^.location.resflags:=F_NE;
  116. case p^.right^.location.loc of
  117. LOC_REGISTER,LOC_CREGISTER:
  118. begin
  119. exprasmlist^.concat(new(pai386,op_const_reg(
  120. A_TEST,S_L,1 shl (p^.left^.value and 31),
  121. p^.right^.location.register)));
  122. ungetregister32(p^.right^.location.register);
  123. end
  124. else
  125. begin
  126. exprasmlist^.concat(new(pai386,op_const_ref(A_TEST,S_L,1 shl (p^.left^.value and 31),
  127. newreference(p^.right^.location.reference))));
  128. del_reference(p^.right^.location.reference);
  129. end;
  130. end;
  131. end
  132. else
  133. begin
  134. { calculate both operators }
  135. { the complex one first }
  136. firstcomplex(p);
  137. secondpass(p^.left);
  138. { are too few registers free? }
  139. pushed:=maybe_push(p^.right^.registers32,p^.left);
  140. secondpass(p^.right);
  141. if pushed then
  142. restore(p^.left);
  143. { of course not commutative }
  144. if p^.swaped then
  145. swaptree(p);
  146. case p^.left^.location.loc of
  147. LOC_REGISTER,
  148. LOC_CREGISTER:
  149. begin
  150. hr:=p^.left^.location.register;
  151. case p^.left^.location.register of
  152. R_AX,R_BX,R_CX,R_DX,R_DI,R_SI,R_SP :
  153. begin
  154. hr:=reg16toreg32(p^.left^.location.register);
  155. ungetregister32(hr);
  156. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVZX,S_WL,
  157. p^.left^.location.register,hr)));
  158. end;
  159. R_AL,R_BL,R_CL,R_DL :
  160. begin
  161. hr:=reg8toreg32(p^.left^.location.register);
  162. ungetregister32(hr);
  163. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVZX,S_BL,
  164. p^.left^.location.register,hr)));
  165. end;
  166. end;
  167. end;
  168. else
  169. begin
  170. { the set element isn't never samller than a byte }
  171. { and because it's a small set we need only 5 bits }
  172. { but 8 bits are eaiser to load }
  173. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVZX,S_BL,
  174. newreference(p^.left^.location.reference),R_EDI)));
  175. hr:=R_EDI;
  176. del_reference(p^.left^.location.reference);
  177. end;
  178. end;
  179. case p^.right^.location.loc of
  180. LOC_REGISTER,
  181. LOC_CREGISTER:
  182. exprasmlist^.concat(new(pai386,op_reg_reg(A_BT,S_L,hr,
  183. p^.right^.location.register)));
  184. else
  185. begin
  186. exprasmlist^.concat(new(pai386,op_reg_ref(A_BT,S_L,hr,
  187. newreference(p^.right^.location.reference))));
  188. del_reference(p^.right^.location.reference);
  189. end;
  190. end;
  191. p^.location.loc:=LOC_FLAGS;
  192. p^.location.resflags:=F_C;
  193. end;
  194. end
  195. else
  196. begin
  197. if p^.left^.treetype=ordconstn then
  198. begin
  199. { only compulsory }
  200. secondpass(p^.left);
  201. secondpass(p^.right);
  202. if codegenerror then
  203. exit;
  204. p^.location.resflags:=F_NE;
  205. inc(p^.right^.location.reference.offset,p^.left^.value shr 3);
  206. exprasmlist^.concat(new(pai386,op_const_ref(A_TEST,S_B,1 shl (p^.left^.value and 7),
  207. newreference(p^.right^.location.reference))));
  208. del_reference(p^.right^.location.reference);
  209. end
  210. else
  211. begin
  212. if (p^.right^.treetype=setconstrn) and
  213. analizeset(p^.right^.constset) then
  214. begin
  215. {It gives us advantage to check for the set elements
  216. separately instead of using the SET_IN_BYTE procedure.
  217. To do: Build in support for LOC_JUMP.}
  218. secondpass(p^.left);
  219. {We won't do a second pass on p^.right, because
  220. this will emit the constant set.}
  221. {If register is used, use only lower 8 bits}
  222. if p^.left^.location.loc in [LOC_REGISTER,LOC_CREGISTER] then
  223. begin
  224. pleftreg:=p^.left^.location.register;
  225. if pleftreg in [R_AL..R_DH] then
  226. begin
  227. exprasmlist^.concat(new(pai386,op_const_reg(
  228. A_AND,S_B,255,pleftreg)));
  229. opsize:=S_B;
  230. end
  231. else
  232. begin
  233. exprasmlist^.concat(new(pai386,op_const_reg(
  234. A_AND,S_L,255,pleftreg)));
  235. if pleftreg in [R_EAX..R_EDI] then
  236. opsize:=S_L
  237. else
  238. opsize:=S_W;
  239. end;
  240. end;
  241. {Get a label to jump to the end.}
  242. p^.location.loc:=LOC_FLAGS;
  243. {It's better to use the zero flag when there are
  244. no ranges.}
  245. if ranges then
  246. p^.location.resflags:=F_C
  247. else
  248. p^.location.resflags:=F_E;
  249. href.symbol := nil;
  250. clear_reference(href);
  251. getlabel(l);
  252. href.symbol:=stringdup(lab2str(l));
  253. for i:=1 to numparts do
  254. if setparts[i].range then
  255. begin
  256. {Check if left is in a range.}
  257. {Get a label to jump over the check.}
  258. href2.symbol := nil;
  259. clear_reference(href2);
  260. getlabel(l2);
  261. href.symbol:=stringdup(lab2str(l2));
  262. if setparts[i].start=setparts[i].stop-1 then
  263. begin
  264. case p^.left^.location.loc of
  265. LOC_REGISTER,
  266. LOC_CREGISTER :
  267. exprasmlist^.concat(new(pai386,op_const_reg(A_CMP,opsize,
  268. setparts[i].start,pleftreg)));
  269. else
  270. exprasmlist^.concat(new(pai386,op_const_ref(A_CMP,S_B,
  271. setparts[i].start,newreference(p^.left^.location.reference))));
  272. end;
  273. {Result should be in carry flag when ranges are used.}
  274. if ranges then
  275. exprasmlist^.concat(new(pai386,op_none(A_STC,S_NO)));
  276. {If found, jump to end.}
  277. emitl(A_JE,l);
  278. case p^.left^.location.loc of
  279. LOC_REGISTER,
  280. LOC_CREGISTER:
  281. exprasmlist^.concat(new(pai386,op_const_reg(A_CMP,opsize,
  282. setparts[i].stop,pleftreg)));
  283. else
  284. exprasmlist^.concat(new(pai386,op_const_ref(A_CMP,S_B,
  285. setparts[i].stop,newreference(p^.left^.location.reference))));
  286. end;
  287. {Result should be in carry flag when ranges are used.}
  288. if ranges then
  289. exprasmlist^.concat(new(pai386,op_none(A_STC,S_NO)));
  290. {If found, jump to end.}
  291. emitl(A_JE,l);
  292. end
  293. else
  294. begin
  295. if setparts[i].start<>0 then
  296. begin
  297. { We only check for the lower bound if it is > 0, because
  298. set elements lower than 0 do nt exist.}
  299. case p^.left^.location.loc of
  300. LOC_REGISTER,
  301. LOC_CREGISTER :
  302. exprasmlist^.concat(new(pai386,op_const_reg(A_CMP,opsize,
  303. setparts[i].start,pleftreg)));
  304. else
  305. exprasmlist^.concat(new(pai386,op_const_ref(A_CMP,S_B,
  306. setparts[i].start,newreference(p^.left^.location.reference))));
  307. end;
  308. {If lower, jump to next check.}
  309. emitl(A_JB,l2);
  310. end;
  311. { We only check for the high bound if it is < 255, because
  312. set elements higher than 255 do nt exist, the its always true,
  313. so only a JMP is generated }
  314. if setparts[i].stop<>255 then
  315. begin
  316. case p^.left^.location.loc of
  317. LOC_REGISTER,
  318. LOC_CREGISTER :
  319. exprasmlist^.concat(new(pai386,op_const_reg(A_CMP,opsize,
  320. setparts[i].stop+1,pleftreg)));
  321. else
  322. exprasmlist^.concat(new(pai386,op_const_ref(A_CMP,S_B,
  323. setparts[i].stop+1,newreference(p^.left^.location.reference))));
  324. end;
  325. {If higher, element is in set.}
  326. emitl(A_JB,l);
  327. end
  328. else
  329. begin
  330. exprasmlist^.concat(new(pai386,op_none(A_STC,S_NO)));
  331. emitl(A_JMP,l);
  332. end;
  333. end;
  334. {Emit the jump over label.}
  335. exprasmlist^.concat(new(pai_label,init(l2)));
  336. end
  337. else
  338. begin
  339. {Emit code to check if left is an element.}
  340. case p^.left^.location.loc of
  341. LOC_REGISTER,
  342. LOC_CREGISTER:
  343. exprasmlist^.concat(new(pai386,op_const_reg(A_CMP,opsize,
  344. setparts[i].stop,pleftreg)));
  345. else
  346. exprasmlist^.concat(new(pai386,op_const_ref(A_CMP,S_B,
  347. setparts[i].stop,newreference(p^.left^.location.reference))));
  348. end;
  349. {Result should be in carry flag when ranges are used.}
  350. if ranges then
  351. exprasmlist^.concat(new(pai386,op_none(A_STC,S_NO)));
  352. {If found, jump to end.}
  353. emitl(A_JE,l);
  354. end;
  355. if ranges then
  356. exprasmlist^.concat(new(pai386,op_none(A_CLC,S_NO)));
  357. {To compensate for not doing a second pass.}
  358. stringdispose(p^.right^.location.reference.symbol);
  359. {Now place the end label.}
  360. exprasmlist^.concat(new(pai_label,init(l)));
  361. case p^.left^.location.loc of
  362. LOC_REGISTER,
  363. LOC_CREGISTER:
  364. ungetregister32(pleftreg);
  365. else
  366. del_reference(p^.left^.location.reference);
  367. end;
  368. end
  369. else
  370. begin
  371. { calculate both operators }
  372. { the complex one first }
  373. firstcomplex(p);
  374. secondpass(p^.left);
  375. { are too few registers free? }
  376. pushed:=maybe_push(p^.right^.registers32,p);
  377. secondpass(p^.right);
  378. if pushed then restore(p);
  379. { of course not commutative }
  380. if p^.swaped then
  381. swaptree(p);
  382. pushsetelement(p^.left);
  383. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  384. del_reference(p^.right^.location.reference);
  385. { registers need not be save. that happens in SET_IN_BYTE }
  386. { (EDI is changed) }
  387. emitcall('SET_IN_BYTE',true);
  388. { ungetiftemp(p^.right^.location.reference); }
  389. p^.location.loc:=LOC_FLAGS;
  390. p^.location.resflags:=F_C;
  391. end;
  392. end;
  393. end;
  394. end;
  395. {*****************************************************************************
  396. SecondCase
  397. *****************************************************************************}
  398. procedure secondcase(var p : ptree);
  399. var
  400. with_sign : boolean;
  401. opsize : topsize;
  402. jmp_gt,jmp_le,jmp_lee : tasmop;
  403. hp : ptree;
  404. { register with case expression }
  405. hregister : tregister;
  406. endlabel,elselabel : plabel;
  407. { true, if we can omit the range check of the jump table }
  408. jumptable_no_range : boolean;
  409. { where to put the jump table }
  410. jumpsegment : paasmoutput;
  411. procedure gentreejmp(p : pcaserecord);
  412. var
  413. lesslabel,greaterlabel : plabel;
  414. begin
  415. emitl(A_LABEL,p^._at);
  416. { calculate labels for left and right }
  417. if (p^.less=nil) then
  418. lesslabel:=elselabel
  419. else
  420. lesslabel:=p^.less^._at;
  421. if (p^.greater=nil) then
  422. greaterlabel:=elselabel
  423. else
  424. greaterlabel:=p^.greater^._at;
  425. { calculate labels for left and right }
  426. { no range label: }
  427. if p^._low=p^._high then
  428. begin
  429. exprasmlist^.concat(new(pai386,op_const_reg(A_CMP,opsize,p^._low,hregister)));
  430. if greaterlabel=lesslabel then
  431. begin
  432. emitl(A_JNE,lesslabel);
  433. end
  434. else
  435. begin
  436. emitl(jmp_le,lesslabel);
  437. emitl(jmp_gt,greaterlabel);
  438. end;
  439. emitl(A_JMP,p^.statement);
  440. end
  441. else
  442. begin
  443. exprasmlist^.concat(new(pai386,op_const_reg(A_CMP,opsize,p^._low,hregister)));
  444. emitl(jmp_le,lesslabel);
  445. exprasmlist^.concat(new(pai386,op_const_reg(A_CMP,opsize,p^._high,hregister)));
  446. emitl(jmp_gt,greaterlabel);
  447. emitl(A_JMP,p^.statement);
  448. end;
  449. if assigned(p^.less) then
  450. gentreejmp(p^.less);
  451. if assigned(p^.greater) then
  452. gentreejmp(p^.greater);
  453. end;
  454. procedure genlinearlist(hp : pcaserecord);
  455. var
  456. first : boolean;
  457. last : longint;
  458. {helplabel : longint;}
  459. procedure genitem(t : pcaserecord);
  460. begin
  461. if assigned(t^.less) then
  462. genitem(t^.less);
  463. if t^._low=t^._high then
  464. begin
  465. if t^._low-last=1 then
  466. exprasmlist^.concat(new(pai386,op_reg(A_DEC,opsize,hregister)))
  467. else if t^._low-last=0 then
  468. exprasmlist^.concat(new(pai386,op_reg_reg(A_OR,opsize,hregister,hregister)))
  469. else
  470. exprasmlist^.concat(new(pai386,op_const_reg(A_SUB,opsize,t^._low-last,hregister)));
  471. last:=t^._low;
  472. emitl(A_JZ,t^.statement);
  473. end
  474. else
  475. begin
  476. { it begins with the smallest label, if the value }
  477. { is even smaller then jump immediately to the }
  478. { ELSE-label }
  479. if first then
  480. begin
  481. if t^._low-1=1 then
  482. exprasmlist^.concat(new(pai386,op_reg(A_DEC,opsize,
  483. hregister)))
  484. else if t^._low-1=0 then
  485. exprasmlist^.concat(new(pai386,op_reg_reg(A_OR,opsize,
  486. hregister,hregister)))
  487. else
  488. exprasmlist^.concat(new(pai386,op_const_reg(A_SUB,opsize,
  489. t^._low-1,hregister)));
  490. { work around: if the lower range=0 and we
  491. do the subtraction we have to take care
  492. of the sign!
  493. }
  494. if t^._low=0 then
  495. emitl(A_JLE,elselabel)
  496. else
  497. emitl(jmp_lee,elselabel);
  498. end
  499. { if there is no unused label between the last and the }
  500. { present label then the lower limit can be checked }
  501. { immediately. else check the range in between: }
  502. else if (t^._low-last>1)then
  503. begin
  504. if t^._low-last-1=1 then
  505. exprasmlist^.concat(new(pai386,op_reg(A_DEC,opsize,hregister)))
  506. else
  507. exprasmlist^.concat(new(pai386,op_const_reg(A_SUB,opsize,t^._low-last-1,hregister)));
  508. emitl(jmp_lee,elselabel);
  509. end;
  510. exprasmlist^.concat(new(pai386,op_const_reg(A_SUB,opsize,t^._high-t^._low+1,hregister)));
  511. emitl(jmp_lee,t^.statement);
  512. last:=t^._high;
  513. end;
  514. first:=false;
  515. if assigned(t^.greater) then
  516. genitem(t^.greater);
  517. end;
  518. var
  519. hr : tregister;
  520. begin
  521. { case register is modified by the list evalution }
  522. if (p^.left^.location.loc=LOC_CREGISTER) then
  523. begin
  524. hr:=getregister32;
  525. case opsize of
  526. S_B : hregister:=reg32toreg8(hr);
  527. S_W : hregister:=reg32toreg16(hr);
  528. S_L : hregister:=hr;
  529. end;
  530. end;
  531. last:=0;
  532. first:=true;
  533. genitem(hp);
  534. emitl(A_JMP,elselabel);
  535. end;
  536. procedure genjumptable(hp : pcaserecord;min_,max_ : longint);
  537. var
  538. table : plabel;
  539. last : longint;
  540. hr : preference;
  541. procedure genitem(t : pcaserecord);
  542. var
  543. i : longint;
  544. begin
  545. if assigned(t^.less) then
  546. genitem(t^.less);
  547. { fill possible hole }
  548. for i:=last+1 to t^._low-1 do
  549. jumpsegment^.concat(new(pai_const,init_symbol(strpnew(lab2str
  550. (elselabel)))));
  551. for i:=t^._low to t^._high do
  552. jumpsegment^.concat(new(pai_const,init_symbol(strpnew(lab2str
  553. (t^.statement)))));
  554. last:=t^._high;
  555. if assigned(t^.greater) then
  556. genitem(t^.greater);
  557. end;
  558. begin
  559. if not(jumptable_no_range) then
  560. begin
  561. exprasmlist^.concat(new(pai386,op_const_reg(A_CMP,opsize,min_,hregister)));
  562. { case expr less than min_ => goto elselabel }
  563. emitl(jmp_le,elselabel);
  564. exprasmlist^.concat(new(pai386,op_const_reg(A_CMP,opsize,max_,hregister)));
  565. emitl(jmp_gt,elselabel);
  566. end;
  567. getlabel(table);
  568. { extend with sign }
  569. if opsize=S_W then
  570. begin
  571. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVZX,S_WL,hregister,
  572. reg16toreg32(hregister))));
  573. hregister:=reg16toreg32(hregister);
  574. end
  575. else if opsize=S_B then
  576. begin
  577. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVZX,S_BL,hregister,
  578. reg8toreg32(hregister))));
  579. hregister:=reg8toreg32(hregister);
  580. end;
  581. new(hr);
  582. reset_reference(hr^);
  583. hr^.symbol:=stringdup(lab2str(table));
  584. hr^.offset:=(-min_)*4;
  585. hr^.index:=hregister;
  586. hr^.scalefactor:=4;
  587. exprasmlist^.concat(new(pai386,op_ref(A_JMP,S_NO,hr)));
  588. { !!!!! generate tables
  589. if not(cs_littlesize in aktswitches^ ) then
  590. jumpsegment^.concat(new(pai386,op_const(A_ALIGN,S_NO,4)));
  591. }
  592. jumpsegment^.concat(new(pai_label,init(table)));
  593. last:=min_;
  594. genitem(hp);
  595. { !!!!!!!
  596. if not(cs_littlesize in aktswitches^ ) then
  597. exprasmlist^.concat(new(pai386,op_const(A_ALIGN,S_NO,4)));
  598. }
  599. end;
  600. var
  601. lv,hv,min_label,max_label,labels : longint;
  602. max_linear_list : longint;
  603. begin
  604. getlabel(endlabel);
  605. getlabel(elselabel);
  606. if (cs_smartlink in aktmoduleswitches) then
  607. jumpsegment:=procinfo.aktlocaldata
  608. else
  609. jumpsegment:=datasegment;
  610. with_sign:=is_signed(p^.left^.resulttype);
  611. if with_sign then
  612. begin
  613. jmp_gt:=A_JG;
  614. jmp_le:=A_JL;
  615. jmp_lee:=A_JLE;
  616. end
  617. else
  618. begin
  619. jmp_gt:=A_JA;
  620. jmp_le:=A_JB;
  621. jmp_lee:=A_JBE;
  622. end;
  623. cleartempgen;
  624. secondpass(p^.left);
  625. { determines the size of the operand }
  626. opsize:=bytes2Sxx[p^.left^.resulttype^.size];
  627. { copy the case expression to a register }
  628. case p^.left^.location.loc of
  629. LOC_REGISTER,
  630. LOC_CREGISTER:
  631. hregister:=p^.left^.location.register;
  632. LOC_MEM,LOC_REFERENCE : begin
  633. del_reference(p^.left^.location.reference);
  634. hregister:=getregister32;
  635. case opsize of
  636. S_B : hregister:=reg32toreg8(hregister);
  637. S_W : hregister:=reg32toreg16(hregister);
  638. end;
  639. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,newreference(
  640. p^.left^.location.reference),hregister)));
  641. end;
  642. else internalerror(2002);
  643. end;
  644. { now generate the jumps }
  645. if cs_optimize in aktglobalswitches then
  646. begin
  647. { procedures are empirically passed on }
  648. { consumption can also be calculated }
  649. { but does it pay on the different }
  650. { processors? }
  651. { moreover can the size only be appro- }
  652. { ximated as it is not known if rel8, }
  653. { rel16 or rel32 jumps are used }
  654. min_label:=case_get_min(p^.nodes);
  655. max_label:=case_get_max(p^.nodes);
  656. labels:=case_count_labels(p^.nodes);
  657. { can we omit the range check of the jump table }
  658. getrange(p^.left^.resulttype,lv,hv);
  659. jumptable_no_range:=(lv=min_label) and (hv=max_label);
  660. { optimize for size ? }
  661. if cs_littlesize in aktglobalswitches then
  662. begin
  663. if (labels<=2) or ((max_label-min_label)>3*labels) then
  664. { a linear list is always smaller than a jump tree }
  665. genlinearlist(p^.nodes)
  666. else
  667. { if the labels less or more a continuum then }
  668. genjumptable(p^.nodes,min_label,max_label);
  669. end
  670. else
  671. begin
  672. if jumptable_no_range then
  673. max_linear_list:=4
  674. else
  675. max_linear_list:=2;
  676. { a jump table crashes the pipeline! }
  677. if aktoptprocessor=int486 then
  678. inc(max_linear_list,3);
  679. if aktoptprocessor=pentium then
  680. inc(max_linear_list,6);
  681. if aktoptprocessor>=pentiumpro then
  682. inc(max_linear_list,9);
  683. if (labels<=max_linear_list) then
  684. genlinearlist(p^.nodes)
  685. else
  686. begin
  687. if ((max_label-min_label)>4*labels) then
  688. begin
  689. if labels>16 then
  690. gentreejmp(p^.nodes)
  691. else
  692. genlinearlist(p^.nodes);
  693. end
  694. else
  695. genjumptable(p^.nodes,min_label,max_label);
  696. end;
  697. end;
  698. end
  699. else
  700. { it's always not bad }
  701. genlinearlist(p^.nodes);
  702. { now generate the instructions }
  703. hp:=p^.right;
  704. while assigned(hp) do
  705. begin
  706. cleartempgen;
  707. secondpass(hp^.right);
  708. emitl(A_JMP,endlabel);
  709. hp:=hp^.left;
  710. end;
  711. emitl(A_LABEL,elselabel);
  712. { ...and the else block }
  713. if assigned(p^.elseblock) then
  714. begin
  715. cleartempgen;
  716. secondpass(p^.elseblock);
  717. end;
  718. emitl(A_LABEL,endlabel);
  719. end;
  720. end.
  721. {
  722. $Log$
  723. Revision 1.4 1998-08-10 14:49:51 peter
  724. + localswitches, moduleswitches, globalswitches splitting
  725. Revision 1.3 1998/06/25 08:48:10 florian
  726. * first version of rtti support
  727. Revision 1.2 1998/06/16 08:56:18 peter
  728. + targetcpu
  729. * cleaner pmodules for newppu
  730. Revision 1.1 1998/06/05 17:44:13 peter
  731. * splitted cgi386
  732. }