nx86set.pas 28 KB

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