nx86set.pas 19 KB

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