nx86set.pas 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470
  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:=(tsetdef(right.resultdef).settype=smallset) and not is_signed(left.resultdef) and
  137. ((left.resultdef.typ=orddef) and (torddef(left.resultdef).high.svalue<32) or
  138. (left.resultdef.typ=enumdef) and (tenumdef(left.resultdef).max<32));
  139. { Can we generate jumps? Possible for all types of sets }
  140. genjumps:=(right.nodetype=setconstn) and
  141. analizeset(tsetconstnode(right).value_set,use_small);
  142. { calculate both operators }
  143. { the complex one first }
  144. { not in case of genjumps, because then we don't secondpass }
  145. { right at all (so we have to make sure that "right" really is }
  146. { "right" and not "swapped left" in that case) }
  147. if not(genjumps) then
  148. firstcomplex(self);
  149. secondpass(left);
  150. { Only process the right if we are not generating jumps }
  151. if not genjumps then
  152. begin
  153. secondpass(right);
  154. end;
  155. if codegenerror then
  156. exit;
  157. { ofcourse not commutative }
  158. if nf_swapped in flags then
  159. swapleftright;
  160. orgopsize := def_cgsize(left.resultdef);
  161. opsize := OS_32;
  162. if is_signed(left.resultdef) then
  163. opsize := tcgsize(ord(opsize)+(ord(OS_S8)-ord(OS_8)));
  164. if not(left.location.loc in [LOC_REGISTER,LOC_CREGISTER,LOC_REFERENCE,LOC_CREFERENCE,LOC_CONSTANT]) then
  165. location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,true);
  166. if (right.location.loc in [LOC_SUBSETREG,LOC_CSUBSETREG]) then
  167. location_force_reg(current_asmdata.CurrAsmList,right.location,opsize,true);
  168. if genjumps then
  169. begin
  170. { It gives us advantage to check for the set elements
  171. separately instead of using the SET_IN_BYTE procedure.
  172. To do: Build in support for LOC_JUMP }
  173. { load and zero or sign extend as necessary }
  174. location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,false);
  175. pleftreg:=left.location.register;
  176. { Get a label to jump to the end }
  177. location_reset(location,LOC_FLAGS,OS_NO);
  178. { It's better to use the zero flag when there are
  179. no ranges }
  180. if ranges then
  181. location.resflags:=F_C
  182. else
  183. location.resflags:=F_E;
  184. current_asmdata.getjumplabel(l);
  185. { how much have we already substracted from the x in the }
  186. { "x in [y..z]" expression }
  187. adjustment := 0;
  188. for i:=1 to numparts do
  189. if setparts[i].range then
  190. { use fact that a <= x <= b <=> cardinal(x-a) <= cardinal(b-a) }
  191. begin
  192. { is the range different from all legal values? }
  193. if (setparts[i].stop-setparts[i].start <> 255) or not (orgopsize = OS_8) then
  194. begin
  195. { yes, is the lower bound <> 0? }
  196. if (setparts[i].start <> 0) then
  197. begin
  198. location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,false);
  199. hreg:=left.location.register;
  200. pleftreg:=hreg;
  201. cg.a_op_const_reg(current_asmdata.CurrAsmList,OP_SUB,opsize,setparts[i].start-adjustment,pleftreg);
  202. end;
  203. { new total value substracted from x: }
  204. { adjustment + (setparts[i].start - adjustment) }
  205. adjustment := setparts[i].start;
  206. { check if result < b-a+1 (not "result <= b-a", since }
  207. { we need a carry in case the element is in the range }
  208. { (this will never overflow since we check at the }
  209. { beginning whether stop-start <> 255) }
  210. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_B,setparts[i].stop-setparts[i].start+1,pleftreg,l);
  211. end
  212. else
  213. { if setparts[i].start = 0 and setparts[i].stop = 255, }
  214. { it's always true since "in" is only allowed for bytes }
  215. begin
  216. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_STC,S_NO));
  217. cg.a_jmp_always(current_asmdata.CurrAsmList,l);
  218. end;
  219. end
  220. else
  221. begin
  222. { Emit code to check if left is an element }
  223. current_asmdata.CurrAsmList.concat(taicpu.op_const_reg(A_CMP,TCGSize2OpSize[opsize],setparts[i].stop-adjustment,
  224. pleftreg));
  225. { Result should be in carry flag when ranges are used }
  226. if ranges then
  227. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_STC,S_NO));
  228. { If found, jump to end }
  229. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_E,l);
  230. end;
  231. if ranges and
  232. { if the last one was a range, the carry flag is already }
  233. { set appropriately }
  234. not(setparts[numparts].range) then
  235. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
  236. { To compensate for not doing a second pass }
  237. right.location.reference.symbol:=nil;
  238. { Now place the end label }
  239. cg.a_label(current_asmdata.CurrAsmList,l);
  240. end
  241. else
  242. begin
  243. location_reset(location,LOC_FLAGS,OS_NO);
  244. setbase:=tsetdef(right.resultdef).setbase;
  245. { We will now generated code to check the set itself, no jmps,
  246. handle smallsets separate, because it allows faster checks }
  247. if use_small then
  248. begin
  249. if left.location.loc=LOC_CONSTANT then
  250. begin
  251. location.resflags:=F_NE;
  252. case right.location.loc of
  253. LOC_REGISTER,
  254. LOC_CREGISTER:
  255. begin
  256. emit_const_reg(A_TEST,TCGSize2OpSize[right.location.size],
  257. 1 shl ((left.location.value-setbase) and 31),right.location.register);
  258. end;
  259. LOC_REFERENCE,
  260. LOC_CREFERENCE :
  261. begin
  262. emit_const_ref(A_TEST,TCGSize2OpSize[right.location.size],1 shl ((left.location.value-setbase) and 31),
  263. right.location.reference);
  264. end;
  265. else
  266. internalerror(200203312);
  267. end;
  268. end
  269. else
  270. begin
  271. location_force_reg(current_asmdata.CurrAsmList,left.location,OS_32,true);
  272. register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
  273. if (tcgsize2size[right.location.size] < 4) or
  274. (right.location.loc = LOC_CONSTANT) then
  275. location_force_reg(current_asmdata.CurrAsmList,right.location,OS_32,true);
  276. hreg:=left.location.register;
  277. case right.location.loc of
  278. LOC_REGISTER,
  279. LOC_CREGISTER :
  280. begin
  281. emit_reg_reg(A_BT,S_L,hreg,right.location.register);
  282. end;
  283. LOC_CREFERENCE,
  284. LOC_REFERENCE :
  285. begin
  286. emit_reg_ref(A_BT,S_L,hreg,right.location.reference);
  287. end;
  288. else
  289. internalerror(2002032210);
  290. end;
  291. location.resflags:=F_C;
  292. end;
  293. end
  294. else
  295. begin
  296. if right.location.loc=LOC_CONSTANT then
  297. begin
  298. location.resflags:=F_C;
  299. current_asmdata.getjumplabel(l);
  300. current_asmdata.getjumplabel(l2);
  301. { load constants to a register }
  302. if (left.location.loc=LOC_CONSTANT) or
  303. (setbase<>0) then
  304. begin
  305. location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,true);
  306. register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
  307. end;
  308. case left.location.loc of
  309. LOC_REGISTER,
  310. LOC_CREGISTER:
  311. begin
  312. hreg:=cg.makeregsize(current_asmdata.CurrAsmList,left.location.register,opsize);
  313. cg.a_load_reg_reg(current_asmdata.CurrAsmList,left.location.size,opsize,left.location.register,hreg);
  314. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_BE,31,hreg,l);
  315. { reset carry flag }
  316. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
  317. cg.a_jmp_always(current_asmdata.CurrAsmList,l2);
  318. cg.a_label(current_asmdata.CurrAsmList,l);
  319. { We have to load the value into a register because
  320. btl does not accept values only refs or regs (PFV) }
  321. hreg2:=cg.getintregister(current_asmdata.CurrAsmList,OS_32);
  322. cg.a_load_const_reg(current_asmdata.CurrAsmList,OS_32,right.location.value,hreg2);
  323. emit_reg_reg(A_BT,S_L,hreg,hreg2);
  324. end;
  325. else
  326. begin
  327. emit_const_ref(A_CMP,TCGSize2OpSize[orgopsize],31,left.location.reference);
  328. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_BE,l);
  329. { reset carry flag }
  330. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
  331. cg.a_jmp_always(current_asmdata.CurrAsmList,l2);
  332. cg.a_label(current_asmdata.CurrAsmList,l);
  333. hreg:=cg.getintregister(current_asmdata.CurrAsmList,OS_32);
  334. cg.a_load_ref_reg(current_asmdata.CurrAsmList,OS_32,OS_32,left.location.reference,hreg);
  335. { We have to load the value into a register because
  336. btl does not accept values only refs or regs (PFV) }
  337. hreg2:=cg.getintregister(current_asmdata.CurrAsmList,OS_32);
  338. cg.a_load_const_reg(current_asmdata.CurrAsmList,OS_32,right.location.value,hreg2);
  339. emit_reg_reg(A_BT,S_L,hreg,hreg2);
  340. end;
  341. end;
  342. cg.a_label(current_asmdata.CurrAsmList,l2);
  343. end { of right.location.loc=LOC_CONSTANT }
  344. { do search in a normal set which could have >32 elementsm
  345. but also used if the left side contains values > 32 or < 0 }
  346. else if left.location.loc=LOC_CONSTANT then
  347. begin
  348. if (left.location.value<setbase) or (((left.location.value-setbase) shr 3) >= right.resultdef.size) then
  349. {should be caught earlier }
  350. internalerror(2007020201);
  351. location.resflags:=F_NE;
  352. case right.location.loc of
  353. LOC_REFERENCE,LOC_CREFERENCE:
  354. begin
  355. inc(right.location.reference.offset,(left.location.value-setbase) shr 3);
  356. emit_const_ref(A_TEST,S_B,1 shl (left.location.value and 7),right.location.reference);
  357. end;
  358. LOC_REGISTER,LOC_CREGISTER:
  359. begin
  360. emit_const_reg(A_TEST,TCGSize2OpSize[right.location.size],1 shl (left.location.value-setbase),right.location.register);
  361. end;
  362. else
  363. internalerror(2007051901);
  364. end;
  365. end
  366. else
  367. begin
  368. location_force_reg(current_asmdata.CurrAsmList,left.location,opsize,false);
  369. register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
  370. pleftreg:=left.location.register;
  371. if (opsize >= OS_S8) or { = if signed }
  372. ((left.resultdef.typ=orddef) and
  373. ((torddef(left.resultdef).low < int64(tsetdef(right.resultdef).setbase)) or
  374. (torddef(left.resultdef).high > int64(tsetdef(right.resultdef).setmax)))) or
  375. ((left.resultdef.typ=enumdef) and
  376. ((tenumdef(left.resultdef).min < tsetdef(right.resultdef).setbase) or
  377. (tenumdef(left.resultdef).max > tsetdef(right.resultdef).setmax))) then
  378. begin
  379. { we have to check if the value is < 0 or > setmax }
  380. current_asmdata.getjumplabel(l);
  381. current_asmdata.getjumplabel(l2);
  382. { BE will be false for negative values }
  383. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_BE,tsetdef(right.resultdef).setmax-tsetdef(right.resultdef).setbase,pleftreg,l);
  384. { reset carry flag }
  385. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
  386. cg.a_jmp_always(current_asmdata.CurrAsmList,l2);
  387. cg.a_label(current_asmdata.CurrAsmList,l);
  388. pleftreg:=left.location.register;
  389. case right.location.loc of
  390. LOC_REGISTER, LOC_CREGISTER :
  391. emit_reg_reg(A_BT,S_L,pleftreg,right.location.register);
  392. LOC_CREFERENCE, LOC_REFERENCE :
  393. emit_reg_ref(A_BT,S_L,pleftreg,right.location.reference);
  394. else
  395. internalerror(2007020301);
  396. end;
  397. cg.a_label(current_asmdata.CurrAsmList,l2);
  398. location.resflags:=F_C;
  399. end
  400. else
  401. begin
  402. case right.location.loc of
  403. LOC_REGISTER, LOC_CREGISTER :
  404. emit_reg_reg(A_BT,S_L,pleftreg,right.location.register);
  405. LOC_CREFERENCE, LOC_REFERENCE :
  406. emit_reg_ref(A_BT,S_L,pleftreg,right.location.reference);
  407. else
  408. internalerror(2007020302);
  409. end;
  410. location.resflags:=F_C;
  411. end;
  412. end;
  413. end;
  414. end;
  415. if not genjumps then
  416. location_freetemp(current_asmdata.CurrAsmList,right.location);
  417. end;
  418. begin
  419. cinnode:=tx86innode;
  420. end.