nx86set.pas 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666
  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. globtype,
  22. node,nset,pass_1,ncgset;
  23. type
  24. tx86innode = class(tinnode)
  25. procedure pass_generate_code;override;
  26. function pass_1 : tnode;override;
  27. end;
  28. tx86casenode = class(tcgcasenode)
  29. function has_jumptable : boolean;override;
  30. procedure genjumptable(hp : pcaselabel;min_,max_ : aint);override;
  31. procedure genlinearlist(hp : pcaselabel);override;
  32. end;
  33. implementation
  34. uses
  35. systems,constexp,
  36. verbose,globals,
  37. symconst,symdef,defutil,
  38. aasmbase,aasmtai,aasmdata,aasmcpu,
  39. cgbase,pass_2,tgobj,
  40. ncon,
  41. cpubase,
  42. cga,cgobj,hlcgobj,cgutils,ncgutil,
  43. cgx86,
  44. procinfo;
  45. {*****************************************************************************
  46. TX86CASENODE
  47. *****************************************************************************}
  48. function tx86casenode.has_jumptable : boolean;
  49. begin
  50. has_jumptable:=true;
  51. end;
  52. procedure tx86casenode.genjumptable(hp : pcaselabel;min_,max_ : aint);
  53. var
  54. table : tasmlabel;
  55. last : TConstExprInt;
  56. indexreg : tregister;
  57. href : treference;
  58. jtlist: tasmlist;
  59. sectype: TAsmSectiontype;
  60. opcgsize: tcgsize;
  61. procedure genitem(list:TAsmList;t : pcaselabel);
  62. var
  63. i : aint;
  64. begin
  65. if assigned(t^.less) then
  66. genitem(list,t^.less);
  67. { fill possible hole }
  68. i:=last.svalue+1;
  69. while i<=t^._low.svalue-1 do
  70. begin
  71. list.concat(Tai_const.Create_sym(elselabel));
  72. inc(i);
  73. end;
  74. i:=t^._low.svalue;
  75. while i<=t^._high.svalue do
  76. begin
  77. list.concat(Tai_const.Create_sym(blocklabel(t^.blockid)));
  78. inc(i);
  79. end;
  80. last:=t^._high;
  81. if assigned(t^.greater) then
  82. genitem(list,t^.greater);
  83. end;
  84. begin
  85. last:=min_;
  86. opcgsize:=def_cgsize(opsize);
  87. if not(jumptable_no_range) then
  88. begin
  89. { a <= x <= b <-> unsigned(x-a) <= (b-a) }
  90. cg.a_op_const_reg(current_asmdata.CurrAsmList,OP_SUB,opcgsize,aint(min_),hregister);
  91. { case expr greater than max_ => goto elselabel }
  92. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opcgsize,OC_A,aint(max_)-aint(min_),hregister,elselabel);
  93. min_:=0;
  94. end;
  95. current_asmdata.getdatalabel(table);
  96. { make it a 32bit register }
  97. indexreg:=cg.makeregsize(current_asmdata.CurrAsmList,hregister,OS_INT);
  98. cg.a_load_reg_reg(current_asmdata.CurrAsmList,opcgsize,OS_INT,hregister,indexreg);
  99. { create reference }
  100. reference_reset_symbol(href,table,0,sizeof(pint));
  101. href.offset:=(-aint(min_))*sizeof(aint);
  102. href.index:=indexreg;
  103. {$ifdef i8086}
  104. cg.a_op_const_reg(current_asmdata.CurrAsmList,OP_SHL,OS_INT,1,indexreg);
  105. {$else i8086}
  106. href.scalefactor:=sizeof(aint);
  107. {$endif i8086}
  108. emit_ref(A_JMP,S_NO,href);
  109. { generate jump table }
  110. if (target_info.system in [system_i386_darwin,system_i386_iphonesim]) then
  111. begin
  112. jtlist:=current_asmdata.asmlists[al_const];
  113. sectype:=sec_rodata;
  114. end
  115. else
  116. begin
  117. jtlist:=current_procinfo.aktlocaldata;
  118. sectype:=sec_data;
  119. end;
  120. new_section(jtlist,sectype,current_procinfo.procdef.mangledname,sizeof(aint));
  121. jtlist.concat(Tai_label.Create(table));
  122. genitem(jtlist,hp);
  123. end;
  124. procedure tx86casenode.genlinearlist(hp : pcaselabel);
  125. var
  126. first : boolean;
  127. lastrange : boolean;
  128. last : TConstExprInt;
  129. cond_lt,cond_le : tresflags;
  130. opcgsize: tcgsize;
  131. procedure genitem(t : pcaselabel);
  132. begin
  133. if assigned(t^.less) then
  134. genitem(t^.less);
  135. { need we to test the first value }
  136. if first and (t^._low>get_min_value(left.resultdef)) then
  137. begin
  138. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opcgsize,jmp_lt,aint(t^._low.svalue),hregister,elselabel);
  139. end;
  140. if t^._low=t^._high then
  141. begin
  142. if t^._low-last=0 then
  143. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, opcgsize, OC_EQ,0,hregister,blocklabel(t^.blockid))
  144. else
  145. begin
  146. cg.a_op_const_reg(current_asmdata.CurrAsmList, OP_SUB, opcgsize, aint(t^._low.svalue-last.svalue), hregister);
  147. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_E,blocklabel(t^.blockid));
  148. end;
  149. last:=t^._low;
  150. lastrange:=false;
  151. end
  152. else
  153. begin
  154. { it begins with the smallest label, if the value }
  155. { is even smaller then jump immediately to the }
  156. { ELSE-label }
  157. if first then
  158. begin
  159. { have we to ajust the first value ? }
  160. if (t^._low>get_min_value(left.resultdef)) or (get_min_value(left.resultdef)<>0) then
  161. cg.a_op_const_reg(current_asmdata.CurrAsmList, OP_SUB, opcgsize, aint(t^._low.svalue), hregister);
  162. end
  163. else
  164. begin
  165. { if there is no unused label between the last and the }
  166. { present label then the lower limit can be checked }
  167. { immediately. else check the range in between: }
  168. { we need to use A_SUB, if cond_lt uses the carry flags
  169. because A_DEC does not set the correct flags, therefor
  170. using a_op_const_reg(OP_SUB) is not possible }
  171. if (cond_lt in [F_C,F_NC,F_A,F_AE,F_B,F_BE]) and (aint(t^._low.svalue-last.svalue)=1) then
  172. emit_const_reg(A_SUB,TCGSize2OpSize[opcgsize],aint(t^._low.svalue-last.svalue),hregister)
  173. else
  174. cg.a_op_const_reg(current_asmdata.CurrAsmList, OP_SUB, opcgsize, aint(t^._low.svalue-last.svalue), hregister);
  175. { no jump necessary here if the new range starts at
  176. at the value following the previous one }
  177. if ((t^._low-last) <> 1) or
  178. (not lastrange) then
  179. cg.a_jmp_flags(current_asmdata.CurrAsmList,cond_lt,elselabel);
  180. end;
  181. { we need to use A_SUB, if cond_le uses the carry flags
  182. because A_DEC does not set the correct flags, therefor
  183. using a_op_const_reg(OP_SUB) is not possible }
  184. if (cond_le in [F_C,F_NC,F_A,F_AE,F_B,F_BE]) and (aint(t^._high.svalue-t^._low.svalue)=1) then
  185. emit_const_reg(A_SUB,TCGSize2OpSize[opcgsize],aint(t^._high.svalue-t^._low.svalue),hregister)
  186. else
  187. cg.a_op_const_reg(current_asmdata.CurrAsmList, OP_SUB, opcgsize, aint(t^._high.svalue-t^._low.svalue), hregister);
  188. cg.a_jmp_flags(current_asmdata.CurrAsmList,cond_le,blocklabel(t^.blockid));
  189. last:=t^._high;
  190. lastrange:=true;
  191. end;
  192. first:=false;
  193. if assigned(t^.greater) then
  194. genitem(t^.greater);
  195. end;
  196. begin
  197. opcgsize:=def_cgsize(opsize);
  198. if with_sign then
  199. begin
  200. cond_lt:=F_L;
  201. cond_le:=F_LE;
  202. end
  203. else
  204. begin
  205. cond_lt:=F_B;
  206. cond_le:=F_BE;
  207. end;
  208. { do we need to generate cmps? }
  209. if (with_sign and (min_label<0)) then
  210. genlinearcmplist(hp)
  211. else
  212. begin
  213. last:=0;
  214. lastrange:=false;
  215. first:=true;
  216. genitem(hp);
  217. cg.a_jmp_always(current_asmdata.CurrAsmList,elselabel);
  218. end;
  219. end;
  220. {*****************************************************************************
  221. TX86INNODE
  222. *****************************************************************************}
  223. function tx86innode.pass_1 : tnode;
  224. begin
  225. result:=nil;
  226. { this is the only difference from the generic version }
  227. expectloc:=LOC_FLAGS;
  228. firstpass(right);
  229. firstpass(left);
  230. if codegenerror then
  231. exit;
  232. end;
  233. procedure tx86innode.pass_generate_code;
  234. type
  235. Tsetpart=record
  236. range : boolean; {Part is a range.}
  237. start,stop : byte; {Start/stop when range; Stop=element when an element.}
  238. end;
  239. var
  240. hreg,hreg2,
  241. pleftreg : tregister;
  242. opsize : tcgsize;
  243. opdef : torddef;
  244. orgopsize : tcgsize;
  245. setparts : array[1..8] of Tsetpart;
  246. setbase : aint;
  247. adjustment : longint;
  248. l,l2 : tasmlabel;
  249. i,numparts : byte;
  250. genjumps,
  251. use_small,
  252. ranges : boolean;
  253. {$ifdef CORRECT_SET_IN_FPC}
  254. AM : tasmop;
  255. {$endif CORRECT_SET_IN_FPC}
  256. function analizeset(Aset:pconstset;is_small:boolean):boolean;
  257. var
  258. compares,maxcompares:word;
  259. i:byte;
  260. begin
  261. if tnormalset(Aset^)=[] then
  262. {The expression...
  263. if expr in []
  264. ...is allways false. It should be optimized away in the
  265. resultdef pass, and thus never occur here. Since we
  266. do generate wrong code for it, do internalerror.}
  267. internalerror(2002072301);
  268. analizeset:=false;
  269. ranges:=false;
  270. numparts:=0;
  271. compares:=0;
  272. { Lots of comparisions take a lot of time, so do not allow
  273. too much comparisions. 8 comparisions are, however, still
  274. smalller than emitting the set }
  275. if cs_opt_size in current_settings.optimizerswitches then
  276. maxcompares:=8
  277. else
  278. maxcompares:=5;
  279. { when smallset is possible allow only 3 compares the smallset
  280. code is for littlesize also smaller when more compares are used }
  281. if is_small then
  282. maxcompares:=3;
  283. for i:=0 to 255 do
  284. if i in tnormalset(Aset^) then
  285. begin
  286. if (numparts=0) or (i<>setparts[numparts].stop+1) then
  287. begin
  288. {Set element is a separate element.}
  289. inc(compares);
  290. if compares>maxcompares then
  291. exit;
  292. inc(numparts);
  293. setparts[numparts].range:=false;
  294. setparts[numparts].stop:=i;
  295. end
  296. else
  297. {Set element is part of a range.}
  298. if not setparts[numparts].range then
  299. begin
  300. {Transform an element into a range.}
  301. setparts[numparts].range:=true;
  302. setparts[numparts].start:=setparts[numparts].stop;
  303. setparts[numparts].stop:=i;
  304. ranges := true;
  305. end
  306. else
  307. begin
  308. {Extend a range.}
  309. setparts[numparts].stop:=i;
  310. end;
  311. end;
  312. analizeset:=true;
  313. end;
  314. begin
  315. { We check first if we can generate jumps, this can be done
  316. because the resultdef is already set in firstpass }
  317. { check if we can use smallset operation using btl which is limited
  318. to 32 bits, the left side may also not contain higher values or be signed !! }
  319. use_small:=is_smallset(right.resultdef) and
  320. not is_signed(left.resultdef) and
  321. ((left.resultdef.typ=orddef) and (torddef(left.resultdef).high.svalue<32) or
  322. (left.resultdef.typ=enumdef) and (tenumdef(left.resultdef).max<32));
  323. { Can we generate jumps? Possible for all types of sets }
  324. genjumps:=(right.nodetype=setconstn) and
  325. analizeset(tsetconstnode(right).value_set,use_small);
  326. { calculate both operators }
  327. { the complex one first }
  328. { not in case of genjumps, because then we don't secondpass }
  329. { right at all (so we have to make sure that "right" really is }
  330. { "right" and not "swapped left" in that case) }
  331. if not(genjumps) then
  332. firstcomplex(self);
  333. secondpass(left);
  334. { Only process the right if we are not generating jumps }
  335. if not genjumps then
  336. begin
  337. secondpass(right);
  338. end;
  339. if codegenerror then
  340. exit;
  341. { ofcourse not commutative }
  342. if nf_swapped in flags then
  343. swapleftright;
  344. orgopsize := def_cgsize(left.resultdef);
  345. opsize := OS_32;
  346. if is_signed(left.resultdef) then
  347. opsize := tcgsize(ord(opsize)+(ord(OS_S8)-ord(OS_8)));
  348. opdef:=hlcg.tcgsize2orddef(opsize);
  349. if not(left.location.loc in [LOC_REGISTER,LOC_CREGISTER,LOC_REFERENCE,LOC_CREFERENCE,LOC_CONSTANT]) then
  350. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,left.resultdef,opdef,true);
  351. if (right.location.loc in [LOC_SUBSETREG,LOC_CSUBSETREG]) then
  352. hlcg.location_force_reg(current_asmdata.CurrAsmList,right.location,left.resultdef,opdef,true);
  353. if genjumps then
  354. begin
  355. { It gives us advantage to check for the set elements
  356. separately instead of using the SET_IN_BYTE procedure.
  357. To do: Build in support for LOC_JUMP }
  358. { load and zero or sign extend as necessary }
  359. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,left.resultdef,opdef,false);
  360. pleftreg:=left.location.register;
  361. { Get a label to jump to the end }
  362. location_reset(location,LOC_FLAGS,OS_NO);
  363. { It's better to use the zero flag when there are
  364. no ranges }
  365. if ranges then
  366. location.resflags:=F_C
  367. else
  368. location.resflags:=F_E;
  369. current_asmdata.getjumplabel(l);
  370. { how much have we already substracted from the x in the }
  371. { "x in [y..z]" expression }
  372. adjustment := 0;
  373. for i:=1 to numparts do
  374. if setparts[i].range then
  375. { use fact that a <= x <= b <=> cardinal(x-a) <= cardinal(b-a) }
  376. begin
  377. { is the range different from all legal values? }
  378. if (setparts[i].stop-setparts[i].start <> 255) or not (orgopsize = OS_8) then
  379. begin
  380. { yes, is the lower bound <> 0? }
  381. if (setparts[i].start <> 0) then
  382. begin
  383. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,left.resultdef,opdef,false);
  384. hreg:=left.location.register;
  385. pleftreg:=hreg;
  386. cg.a_op_const_reg(current_asmdata.CurrAsmList,OP_SUB,opsize,setparts[i].start-adjustment,pleftreg);
  387. end;
  388. { new total value substracted from x: }
  389. { adjustment + (setparts[i].start - adjustment) }
  390. adjustment := setparts[i].start;
  391. { check if result < b-a+1 (not "result <= b-a", since }
  392. { we need a carry in case the element is in the range }
  393. { (this will never overflow since we check at the }
  394. { beginning whether stop-start <> 255) }
  395. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_B,setparts[i].stop-setparts[i].start+1,pleftreg,l);
  396. end
  397. else
  398. { if setparts[i].start = 0 and setparts[i].stop = 255, }
  399. { it's always true since "in" is only allowed for bytes }
  400. begin
  401. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_STC,S_NO));
  402. cg.a_jmp_always(current_asmdata.CurrAsmList,l);
  403. end;
  404. end
  405. else
  406. begin
  407. { Emit code to check if left is an element }
  408. current_asmdata.CurrAsmList.concat(taicpu.op_const_reg(A_CMP,TCGSize2OpSize[opsize],setparts[i].stop-adjustment,
  409. pleftreg));
  410. { Result should be in carry flag when ranges are used }
  411. if ranges then
  412. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_STC,S_NO));
  413. { If found, jump to end }
  414. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_E,l);
  415. end;
  416. if ranges and
  417. { if the last one was a range, the carry flag is already }
  418. { set appropriately }
  419. not(setparts[numparts].range) then
  420. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
  421. { To compensate for not doing a second pass }
  422. right.location.reference.symbol:=nil;
  423. { Now place the end label }
  424. cg.a_label(current_asmdata.CurrAsmList,l);
  425. end
  426. else
  427. begin
  428. location_reset(location,LOC_FLAGS,OS_NO);
  429. setbase:=tsetdef(right.resultdef).setbase;
  430. { We will now generated code to check the set itself, no jmps,
  431. handle smallsets separate, because it allows faster checks }
  432. if use_small then
  433. begin
  434. if left.location.loc=LOC_CONSTANT then
  435. begin
  436. location.resflags:=F_NE;
  437. case right.location.loc of
  438. LOC_REGISTER,
  439. LOC_CREGISTER:
  440. begin
  441. emit_const_reg(A_TEST,TCGSize2OpSize[right.location.size],
  442. 1 shl ((left.location.value-setbase) and 31),right.location.register);
  443. end;
  444. LOC_REFERENCE,
  445. LOC_CREFERENCE :
  446. begin
  447. emit_const_ref(A_TEST,TCGSize2OpSize[right.location.size],1 shl ((left.location.value-setbase) and 31),
  448. right.location.reference);
  449. end;
  450. else
  451. internalerror(200203312);
  452. end;
  453. end
  454. else
  455. begin
  456. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,left.resultdef,u32inttype,true);
  457. register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
  458. if (tcgsize2size[right.location.size] < 4) or
  459. (right.location.loc = LOC_CONSTANT) then
  460. hlcg.location_force_reg(current_asmdata.CurrAsmList,right.location,right.resultdef,u32inttype,true);
  461. hreg:=left.location.register;
  462. case right.location.loc of
  463. LOC_REGISTER,
  464. LOC_CREGISTER :
  465. begin
  466. emit_reg_reg(A_BT,S_L,hreg,right.location.register);
  467. end;
  468. LOC_CREFERENCE,
  469. LOC_REFERENCE :
  470. begin
  471. emit_reg_ref(A_BT,S_L,hreg,right.location.reference);
  472. end;
  473. else
  474. internalerror(2002032210);
  475. end;
  476. location.resflags:=F_C;
  477. end;
  478. end
  479. else
  480. begin
  481. if right.location.loc=LOC_CONSTANT then
  482. begin
  483. location.resflags:=F_C;
  484. current_asmdata.getjumplabel(l);
  485. current_asmdata.getjumplabel(l2);
  486. { load constants to a register }
  487. if (left.location.loc=LOC_CONSTANT) or
  488. (setbase<>0) then
  489. begin
  490. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,left.resultdef,opdef,true);
  491. register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
  492. end;
  493. case left.location.loc of
  494. LOC_REGISTER,
  495. LOC_CREGISTER:
  496. begin
  497. hreg:=cg.makeregsize(current_asmdata.CurrAsmList,left.location.register,opsize);
  498. cg.a_load_reg_reg(current_asmdata.CurrAsmList,left.location.size,opsize,left.location.register,hreg);
  499. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_BE,31,hreg,l);
  500. { reset carry flag }
  501. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
  502. cg.a_jmp_always(current_asmdata.CurrAsmList,l2);
  503. cg.a_label(current_asmdata.CurrAsmList,l);
  504. { We have to load the value into a register because
  505. btl does not accept values only refs or regs (PFV) }
  506. hreg2:=cg.getintregister(current_asmdata.CurrAsmList,OS_32);
  507. cg.a_load_const_reg(current_asmdata.CurrAsmList,OS_32,right.location.value,hreg2);
  508. emit_reg_reg(A_BT,S_L,hreg,hreg2);
  509. end;
  510. else
  511. begin
  512. emit_const_ref(A_CMP,TCGSize2OpSize[orgopsize],31,left.location.reference);
  513. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_BE,l);
  514. { reset carry flag }
  515. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
  516. cg.a_jmp_always(current_asmdata.CurrAsmList,l2);
  517. cg.a_label(current_asmdata.CurrAsmList,l);
  518. hreg:=cg.getintregister(current_asmdata.CurrAsmList,OS_32);
  519. cg.a_load_ref_reg(current_asmdata.CurrAsmList,OS_32,OS_32,left.location.reference,hreg);
  520. { We have to load the value into a register because
  521. btl does not accept values only refs or regs (PFV) }
  522. hreg2:=cg.getintregister(current_asmdata.CurrAsmList,OS_32);
  523. cg.a_load_const_reg(current_asmdata.CurrAsmList,OS_32,right.location.value,hreg2);
  524. emit_reg_reg(A_BT,S_L,hreg,hreg2);
  525. end;
  526. end;
  527. cg.a_label(current_asmdata.CurrAsmList,l2);
  528. end { of right.location.loc=LOC_CONSTANT }
  529. { do search in a normal set which could have >32 elementsm
  530. but also used if the left side contains values > 32 or < 0 }
  531. else if left.location.loc=LOC_CONSTANT then
  532. begin
  533. if (left.location.value<setbase) or (((left.location.value-setbase) shr 3) >= right.resultdef.size) then
  534. {should be caught earlier }
  535. internalerror(2007020201);
  536. location.resflags:=F_NE;
  537. case right.location.loc of
  538. LOC_REFERENCE,LOC_CREFERENCE:
  539. begin
  540. inc(right.location.reference.offset,(left.location.value-setbase) shr 3);
  541. emit_const_ref(A_TEST,S_B,1 shl (left.location.value and 7),right.location.reference);
  542. end;
  543. LOC_REGISTER,LOC_CREGISTER:
  544. begin
  545. emit_const_reg(A_TEST,TCGSize2OpSize[right.location.size],1 shl (left.location.value-setbase),right.location.register);
  546. end;
  547. else
  548. internalerror(2007051901);
  549. end;
  550. end
  551. else
  552. begin
  553. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,left.resultdef,opdef,false);
  554. register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
  555. if (right.location.loc in [LOC_REGISTER,LOC_CREGISTER]) then
  556. hlcg.location_force_reg(current_asmdata.CurrAsmList,right.location,right.resultdef,opdef,true);
  557. pleftreg:=left.location.register;
  558. if (opsize >= OS_S8) or { = if signed }
  559. ((left.resultdef.typ=orddef) and
  560. ((torddef(left.resultdef).low < int64(tsetdef(right.resultdef).setbase)) or
  561. (torddef(left.resultdef).high > int64(tsetdef(right.resultdef).setmax)))) or
  562. ((left.resultdef.typ=enumdef) and
  563. ((tenumdef(left.resultdef).min < aint(tsetdef(right.resultdef).setbase)) or
  564. (tenumdef(left.resultdef).max > aint(tsetdef(right.resultdef).setmax)))) then
  565. begin
  566. { we have to check if the value is < 0 or > setmax }
  567. current_asmdata.getjumplabel(l);
  568. current_asmdata.getjumplabel(l2);
  569. { BE will be false for negative values }
  570. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_BE,tsetdef(right.resultdef).setmax-tsetdef(right.resultdef).setbase,pleftreg,l);
  571. { reset carry flag }
  572. current_asmdata.CurrAsmList.concat(taicpu.op_none(A_CLC,S_NO));
  573. cg.a_jmp_always(current_asmdata.CurrAsmList,l2);
  574. cg.a_label(current_asmdata.CurrAsmList,l);
  575. pleftreg:=left.location.register;
  576. case right.location.loc of
  577. LOC_REGISTER, LOC_CREGISTER :
  578. emit_reg_reg(A_BT,S_L,pleftreg,right.location.register);
  579. LOC_CREFERENCE, LOC_REFERENCE :
  580. emit_reg_ref(A_BT,S_L,pleftreg,right.location.reference);
  581. else
  582. internalerror(2007020301);
  583. end;
  584. cg.a_label(current_asmdata.CurrAsmList,l2);
  585. location.resflags:=F_C;
  586. end
  587. else
  588. begin
  589. case right.location.loc of
  590. LOC_REGISTER, LOC_CREGISTER :
  591. emit_reg_reg(A_BT,S_L,pleftreg,right.location.register);
  592. LOC_CREFERENCE, LOC_REFERENCE :
  593. emit_reg_ref(A_BT,S_L,pleftreg,right.location.reference);
  594. else
  595. internalerror(2007020302);
  596. end;
  597. location.resflags:=F_C;
  598. end;
  599. end;
  600. end;
  601. end;
  602. if not genjumps then
  603. location_freetemp(current_asmdata.CurrAsmList,right.location);
  604. end;
  605. begin
  606. cinnode:=tx86innode;
  607. ccasenode:=tx86casenode;
  608. end.