nx86set.pas 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471
  1. {
  2. Copyright (c) 1998-2002 by Florian Klaempfl
  3. Generate x86 assembler for in/case nodes
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 2 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program; if not, write to the Free Software
  14. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  15. ****************************************************************************
  16. }
  17. unit nx86set;
  18. {$i fpcdefs.inc}
  19. interface
  20. uses
  21. node,nset,pass_1,ncgset;
  22. type
  23. tx86innode = class(tinnode)
  24. procedure pass_generate_code;override;
  25. function pass_1 : tnode;override;
  26. end;
  27. implementation
  28. uses
  29. globtype,systems,constexp,
  30. verbose,globals,
  31. symconst,symdef,defutil,
  32. aasmbase,aasmtai,aasmdata,aasmcpu,
  33. cgbase,pass_2,tgobj,
  34. ncon,
  35. cpubase,
  36. cga,cgobj,cgutils,ncgutil,
  37. cgx86;
  38. {*****************************************************************************
  39. TX86INNODE
  40. *****************************************************************************}
  41. function tx86innode.pass_1 : tnode;
  42. begin
  43. result:=nil;
  44. { this is the only difference from the generic version }
  45. expectloc:=LOC_FLAGS;
  46. firstpass(right);
  47. firstpass(left);
  48. if codegenerror then
  49. exit;
  50. end;
  51. procedure tx86innode.pass_generate_code;
  52. type
  53. Tsetpart=record
  54. range : boolean; {Part is a range.}
  55. start,stop : byte; {Start/stop when range; Stop=element when an element.}
  56. end;
  57. var
  58. hreg,hreg2,
  59. pleftreg : tregister;
  60. opsize : tcgsize;
  61. orgopsize : tcgsize;
  62. setparts : array[1..8] of Tsetpart;
  63. setbase : aint;
  64. adjustment : longint;
  65. l,l2 : tasmlabel;
  66. i,numparts : byte;
  67. genjumps,
  68. use_small,
  69. ranges : boolean;
  70. {$ifdef CORRECT_SET_IN_FPC}
  71. AM : tasmop;
  72. {$endif CORRECT_SET_IN_FPC}
  73. function analizeset(Aset:pconstset;is_small:boolean):boolean;
  74. var
  75. compares,maxcompares:word;
  76. i:byte;
  77. begin
  78. if tnormalset(Aset^)=[] then
  79. {The expression...
  80. if expr in []
  81. ...is allways false. It should be optimized away in the
  82. resultdef pass, and thus never occur here. Since we
  83. do generate wrong code for it, do internalerror.}
  84. internalerror(2002072301);
  85. analizeset:=false;
  86. ranges:=false;
  87. numparts:=0;
  88. compares:=0;
  89. { Lots of comparisions take a lot of time, so do not allow
  90. too much comparisions. 8 comparisions are, however, still
  91. smalller than emitting the set }
  92. if cs_opt_size in current_settings.optimizerswitches then
  93. maxcompares:=8
  94. else
  95. maxcompares:=5;
  96. { when smallset is possible allow only 3 compares the smallset
  97. code is for littlesize also smaller when more compares are used }
  98. if is_small then
  99. maxcompares:=3;
  100. for i:=0 to 255 do
  101. if i in tnormalset(Aset^) then
  102. begin
  103. if (numparts=0) or (i<>setparts[numparts].stop+1) then
  104. begin
  105. {Set element is a separate element.}
  106. inc(compares);
  107. if compares>maxcompares then
  108. exit;
  109. inc(numparts);
  110. setparts[numparts].range:=false;
  111. setparts[numparts].stop:=i;
  112. end
  113. else
  114. {Set element is part of a range.}
  115. if not setparts[numparts].range then
  116. begin
  117. {Transform an element into a range.}
  118. setparts[numparts].range:=true;
  119. setparts[numparts].start:=setparts[numparts].stop;
  120. setparts[numparts].stop:=i;
  121. ranges := true;
  122. end
  123. else
  124. begin
  125. {Extend a range.}
  126. setparts[numparts].stop:=i;
  127. end;
  128. end;
  129. analizeset:=true;
  130. end;
  131. begin
  132. { We check first if we can generate jumps, this can be done
  133. because the resultdef is already set in firstpass }
  134. { check if we can use smallset operation using btl which is limited
  135. to 32 bits, the left side may also not contain higher values or be signed !! }
  136. use_small:=is_smallset(right.resultdef) and
  137. not is_signed(left.resultdef) and
  138. ((left.resultdef.typ=orddef) and (torddef(left.resultdef).high.svalue<32) or
  139. (left.resultdef.typ=enumdef) and (tenumdef(left.resultdef).max<32));
  140. { Can we generate jumps? Possible for all types of sets }
  141. genjumps:=(right.nodetype=setconstn) and
  142. analizeset(tsetconstnode(right).value_set,use_small);
  143. { calculate both operators }
  144. { the complex one first }
  145. { not in case of genjumps, because then we don't secondpass }
  146. { right at all (so we have to make sure that "right" really is }
  147. { "right" and not "swapped left" in that case) }
  148. if not(genjumps) then
  149. firstcomplex(self);
  150. secondpass(left);
  151. { Only process the right if we are not generating jumps }
  152. if not genjumps then
  153. begin
  154. secondpass(right);
  155. end;
  156. if codegenerror then
  157. exit;
  158. { ofcourse not commutative }
  159. if nf_swapped in flags then
  160. swapleftright;
  161. orgopsize := def_cgsize(left.resultdef);
  162. opsize := OS_32;
  163. if is_signed(left.resultdef) then
  164. opsize := tcgsize(ord(opsize)+(ord(OS_S8)-ord(OS_8)));
  165. if not(left.location.loc in [LOC_REGISTER,LOC_CREGISTER,LOC_REFERENCE,LOC_CREFERENCE,LOC_CONSTANT]) then
  166. location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,true);
  167. if (right.location.loc in [LOC_SUBSETREG,LOC_CSUBSETREG]) then
  168. location_force_reg(current_asmdata.CurrAsmList,right.location,opsize,true);
  169. if genjumps then
  170. begin
  171. { It gives us advantage to check for the set elements
  172. separately instead of using the SET_IN_BYTE procedure.
  173. To do: Build in support for LOC_JUMP }
  174. { load and zero or sign extend as necessary }
  175. location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,false);
  176. pleftreg:=left.location.register;
  177. { Get a label to jump to the end }
  178. location_reset(location,LOC_FLAGS,OS_NO);
  179. { It's better to use the zero flag when there are
  180. no ranges }
  181. if ranges then
  182. location.resflags:=F_C
  183. else
  184. location.resflags:=F_E;
  185. current_asmdata.getjumplabel(l);
  186. { how much have we already substracted from the x in the }
  187. { "x in [y..z]" expression }
  188. adjustment := 0;
  189. for i:=1 to numparts do
  190. if setparts[i].range then
  191. { use fact that a <= x <= b <=> cardinal(x-a) <= cardinal(b-a) }
  192. begin
  193. { is the range different from all legal values? }
  194. if (setparts[i].stop-setparts[i].start <> 255) or not (orgopsize = OS_8) then
  195. begin
  196. { yes, is the lower bound <> 0? }
  197. if (setparts[i].start <> 0) then
  198. begin
  199. location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,false);
  200. hreg:=left.location.register;
  201. pleftreg:=hreg;
  202. cg.a_op_const_reg(current_asmdata.CurrAsmList,OP_SUB,opsize,setparts[i].start-adjustment,pleftreg);
  203. end;
  204. { new total value substracted from x: }
  205. { adjustment + (setparts[i].start - adjustment) }
  206. adjustment := setparts[i].start;
  207. { check if result < b-a+1 (not "result <= b-a", since }
  208. { we need a carry in case the element is in the range }
  209. { (this will never overflow since we check at the }
  210. { beginning whether stop-start <> 255) }
  211. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_B,setparts[i].stop-setparts[i].start+1,pleftreg,l);
  212. end
  213. else
  214. { if setparts[i].start = 0 and setparts[i].stop = 255, }
  215. { it's always true since "in" is only allowed for bytes }
  216. begin
  217. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_STC,S_NO));
  218. cg.a_jmp_always(current_asmdata.CurrAsmList,l);
  219. end;
  220. end
  221. else
  222. begin
  223. { Emit code to check if left is an element }
  224. current_asmdata.CurrAsmList.concat(taicpu.op_const_reg(A_CMP,TCGSize2OpSize[opsize],setparts[i].stop-adjustment,
  225. pleftreg));
  226. { Result should be in carry flag when ranges are used }
  227. if ranges then
  228. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_STC,S_NO));
  229. { If found, jump to end }
  230. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_E,l);
  231. end;
  232. if ranges and
  233. { if the last one was a range, the carry flag is already }
  234. { set appropriately }
  235. not(setparts[numparts].range) then
  236. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
  237. { To compensate for not doing a second pass }
  238. right.location.reference.symbol:=nil;
  239. { Now place the end label }
  240. cg.a_label(current_asmdata.CurrAsmList,l);
  241. end
  242. else
  243. begin
  244. location_reset(location,LOC_FLAGS,OS_NO);
  245. setbase:=tsetdef(right.resultdef).setbase;
  246. { We will now generated code to check the set itself, no jmps,
  247. handle smallsets separate, because it allows faster checks }
  248. if use_small then
  249. begin
  250. if left.location.loc=LOC_CONSTANT then
  251. begin
  252. location.resflags:=F_NE;
  253. case right.location.loc of
  254. LOC_REGISTER,
  255. LOC_CREGISTER:
  256. begin
  257. emit_const_reg(A_TEST,TCGSize2OpSize[right.location.size],
  258. 1 shl ((left.location.value-setbase) and 31),right.location.register);
  259. end;
  260. LOC_REFERENCE,
  261. LOC_CREFERENCE :
  262. begin
  263. emit_const_ref(A_TEST,TCGSize2OpSize[right.location.size],1 shl ((left.location.value-setbase) and 31),
  264. right.location.reference);
  265. end;
  266. else
  267. internalerror(200203312);
  268. end;
  269. end
  270. else
  271. begin
  272. location_force_reg(current_asmdata.CurrAsmList,left.location,OS_32,true);
  273. register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
  274. if (tcgsize2size[right.location.size] < 4) or
  275. (right.location.loc = LOC_CONSTANT) then
  276. location_force_reg(current_asmdata.CurrAsmList,right.location,OS_32,true);
  277. hreg:=left.location.register;
  278. case right.location.loc of
  279. LOC_REGISTER,
  280. LOC_CREGISTER :
  281. begin
  282. emit_reg_reg(A_BT,S_L,hreg,right.location.register);
  283. end;
  284. LOC_CREFERENCE,
  285. LOC_REFERENCE :
  286. begin
  287. emit_reg_ref(A_BT,S_L,hreg,right.location.reference);
  288. end;
  289. else
  290. internalerror(2002032210);
  291. end;
  292. location.resflags:=F_C;
  293. end;
  294. end
  295. else
  296. begin
  297. if right.location.loc=LOC_CONSTANT then
  298. begin
  299. location.resflags:=F_C;
  300. current_asmdata.getjumplabel(l);
  301. current_asmdata.getjumplabel(l2);
  302. { load constants to a register }
  303. if (left.location.loc=LOC_CONSTANT) or
  304. (setbase<>0) then
  305. begin
  306. location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,true);
  307. register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
  308. end;
  309. case left.location.loc of
  310. LOC_REGISTER,
  311. LOC_CREGISTER:
  312. begin
  313. hreg:=cg.makeregsize(current_asmdata.CurrAsmList,left.location.register,opsize);
  314. cg.a_load_reg_reg(current_asmdata.CurrAsmList,left.location.size,opsize,left.location.register,hreg);
  315. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_BE,31,hreg,l);
  316. { reset carry flag }
  317. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
  318. cg.a_jmp_always(current_asmdata.CurrAsmList,l2);
  319. cg.a_label(current_asmdata.CurrAsmList,l);
  320. { We have to load the value into a register because
  321. btl does not accept values only refs or regs (PFV) }
  322. hreg2:=cg.getintregister(current_asmdata.CurrAsmList,OS_32);
  323. cg.a_load_const_reg(current_asmdata.CurrAsmList,OS_32,right.location.value,hreg2);
  324. emit_reg_reg(A_BT,S_L,hreg,hreg2);
  325. end;
  326. else
  327. begin
  328. emit_const_ref(A_CMP,TCGSize2OpSize[orgopsize],31,left.location.reference);
  329. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_BE,l);
  330. { reset carry flag }
  331. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
  332. cg.a_jmp_always(current_asmdata.CurrAsmList,l2);
  333. cg.a_label(current_asmdata.CurrAsmList,l);
  334. hreg:=cg.getintregister(current_asmdata.CurrAsmList,OS_32);
  335. cg.a_load_ref_reg(current_asmdata.CurrAsmList,OS_32,OS_32,left.location.reference,hreg);
  336. { We have to load the value into a register because
  337. btl does not accept values only refs or regs (PFV) }
  338. hreg2:=cg.getintregister(current_asmdata.CurrAsmList,OS_32);
  339. cg.a_load_const_reg(current_asmdata.CurrAsmList,OS_32,right.location.value,hreg2);
  340. emit_reg_reg(A_BT,S_L,hreg,hreg2);
  341. end;
  342. end;
  343. cg.a_label(current_asmdata.CurrAsmList,l2);
  344. end { of right.location.loc=LOC_CONSTANT }
  345. { do search in a normal set which could have >32 elementsm
  346. but also used if the left side contains values > 32 or < 0 }
  347. else if left.location.loc=LOC_CONSTANT then
  348. begin
  349. if (left.location.value<setbase) or (((left.location.value-setbase) shr 3) >= right.resultdef.size) then
  350. {should be caught earlier }
  351. internalerror(2007020201);
  352. location.resflags:=F_NE;
  353. case right.location.loc of
  354. LOC_REFERENCE,LOC_CREFERENCE:
  355. begin
  356. inc(right.location.reference.offset,(left.location.value-setbase) shr 3);
  357. emit_const_ref(A_TEST,S_B,1 shl (left.location.value and 7),right.location.reference);
  358. end;
  359. LOC_REGISTER,LOC_CREGISTER:
  360. begin
  361. emit_const_reg(A_TEST,TCGSize2OpSize[right.location.size],1 shl (left.location.value-setbase),right.location.register);
  362. end;
  363. else
  364. internalerror(2007051901);
  365. end;
  366. end
  367. else
  368. begin
  369. location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,false);
  370. register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
  371. pleftreg:=left.location.register;
  372. if (opsize >= OS_S8) or { = if signed }
  373. ((left.resultdef.typ=orddef) and
  374. ((torddef(left.resultdef).low < int64(tsetdef(right.resultdef).setbase)) or
  375. (torddef(left.resultdef).high > int64(tsetdef(right.resultdef).setmax)))) or
  376. ((left.resultdef.typ=enumdef) and
  377. ((tenumdef(left.resultdef).min < tsetdef(right.resultdef).setbase) or
  378. (tenumdef(left.resultdef).max > tsetdef(right.resultdef).setmax))) then
  379. begin
  380. { we have to check if the value is < 0 or > setmax }
  381. current_asmdata.getjumplabel(l);
  382. current_asmdata.getjumplabel(l2);
  383. { BE will be false for negative values }
  384. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_BE,tsetdef(right.resultdef).setmax-tsetdef(right.resultdef).setbase,pleftreg,l);
  385. { reset carry flag }
  386. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
  387. cg.a_jmp_always(current_asmdata.CurrAsmList,l2);
  388. cg.a_label(current_asmdata.CurrAsmList,l);
  389. pleftreg:=left.location.register;
  390. case right.location.loc of
  391. LOC_REGISTER, LOC_CREGISTER :
  392. emit_reg_reg(A_BT,S_L,pleftreg,right.location.register);
  393. LOC_CREFERENCE, LOC_REFERENCE :
  394. emit_reg_ref(A_BT,S_L,pleftreg,right.location.reference);
  395. else
  396. internalerror(2007020301);
  397. end;
  398. cg.a_label(current_asmdata.CurrAsmList,l2);
  399. location.resflags:=F_C;
  400. end
  401. else
  402. begin
  403. case right.location.loc of
  404. LOC_REGISTER, LOC_CREGISTER :
  405. emit_reg_reg(A_BT,S_L,pleftreg,right.location.register);
  406. LOC_CREFERENCE, LOC_REFERENCE :
  407. emit_reg_ref(A_BT,S_L,pleftreg,right.location.reference);
  408. else
  409. internalerror(2007020302);
  410. end;
  411. location.resflags:=F_C;
  412. end;
  413. end;
  414. end;
  415. end;
  416. if not genjumps then
  417. location_freetemp(current_asmdata.CurrAsmList,right.location);
  418. end;
  419. begin
  420. cinnode:=tx86innode;
  421. end.