ncgset.pas 44 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994
  1. {
  2. Copyright (c) 1998-2002 by Florian Klaempfl and Carl Eric Codere
  3. Generate generic assembler for in set/case labels
  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 ncgset;
  18. {$i fpcdefs.inc}
  19. interface
  20. uses
  21. globtype,globals,constexp,symtype,
  22. node,nset,cpubase,cgbase,cgutils,cgobj,aasmbase,aasmtai,aasmdata;
  23. type
  24. tcgsetelementnode = class(tsetelementnode)
  25. procedure pass_generate_code;override;
  26. end;
  27. Tsetpart=record
  28. range : boolean; {Part is a range.}
  29. start,stop : byte; {Start/stop when range; Stop=element when an element.}
  30. end;
  31. Tsetparts=array[1..8] of Tsetpart;
  32. { tcginnode }
  33. tcginnode = class(tinnode)
  34. procedure in_smallset(uopsize: tcgsize; opdef: tdef; setbase: aint); virtual;
  35. function pass_1: tnode;override;
  36. procedure pass_generate_code;override;
  37. protected
  38. function checkgenjumps(out setparts: Tsetparts; out numparts: byte; out use_small: boolean): boolean; virtual;
  39. function analizeset(const Aset:Tconstset;out setparts: Tsetparts; out numparts: byte;is_small:boolean):boolean;virtual;
  40. end;
  41. tcgcasenode = class(tcasenode)
  42. {
  43. Emits the case node statement. Contrary to the intel
  44. 80x86 version, this version does not emit jump tables,
  45. because of portability problems.
  46. }
  47. procedure pass_generate_code;override;
  48. protected
  49. with_sign : boolean;
  50. opsize : tdef;
  51. jmp_gt,jmp_lt,jmp_le : topcmp;
  52. { register with case expression }
  53. hregister,hregister2 : tregister;
  54. endlabel,elselabel : tasmlabel;
  55. { true, if we can omit the range check of the jump table }
  56. jumptable_no_range : boolean;
  57. { has the implementation jumptable support }
  58. min_label : tconstexprint;
  59. function blocklabel(id:longint):tasmlabel;
  60. procedure optimizevalues(var max_linear_list:aint;var max_dist:aword);virtual;
  61. function has_jumptable : boolean;virtual;
  62. procedure genjumptable(hp : pcaselabel;min_,max_ : aint); virtual;
  63. procedure genlinearlist(hp : pcaselabel); virtual;
  64. procedure genlinearcmplist(hp : pcaselabel); virtual;
  65. end;
  66. implementation
  67. uses
  68. systems,
  69. verbose,
  70. symconst,symdef,defutil,
  71. paramgr,
  72. procinfo,pass_2,tgobj,
  73. nbas,ncon,nflw,
  74. ncgutil,hlcgobj;
  75. {*****************************************************************************
  76. TCGSETELEMENTNODE
  77. *****************************************************************************}
  78. procedure tcgsetelementnode.pass_generate_code;
  79. begin
  80. { load first value in 32bit register }
  81. secondpass(left);
  82. if left.location.loc in [LOC_REGISTER,LOC_CREGISTER] then
  83. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,left.resultdef,u32inttype,false);
  84. { also a second value ? }
  85. if assigned(right) then
  86. begin
  87. secondpass(right);
  88. if codegenerror then
  89. exit;
  90. if right.location.loc in [LOC_REGISTER,LOC_CREGISTER] then
  91. hlcg.location_force_reg(current_asmdata.CurrAsmList,right.location,right.resultdef,u32inttype,false);
  92. end;
  93. { we doesn't modify the left side, we check only the type }
  94. location_copy(location,left.location);
  95. end;
  96. {*****************************************************************************
  97. *****************************************************************************}
  98. function tcginnode.analizeset(const Aset:Tconstset; out setparts:tsetparts; out numparts: byte; is_small:boolean):boolean;
  99. var
  100. compares,maxcompares:word;
  101. i:byte;
  102. begin
  103. analizeset:=false;
  104. fillchar(setparts,sizeof(setparts),0);
  105. numparts:=0;
  106. compares:=0;
  107. { Lots of comparisions take a lot of time, so do not allow
  108. too much comparisions. 8 comparisions are, however, still
  109. smalller than emitting the set }
  110. if cs_opt_size in current_settings.optimizerswitches then
  111. maxcompares:=8
  112. else
  113. maxcompares:=5;
  114. { when smallset is possible allow only 3 compares the smallset
  115. code is for littlesize also smaller when more compares are used }
  116. if is_small then
  117. maxcompares:=3;
  118. for i:=0 to 255 do
  119. if i in Aset then
  120. begin
  121. if (numparts=0) or (i<>setparts[numparts].stop+1) then
  122. begin
  123. {Set element is a separate element.}
  124. inc(compares);
  125. if compares>maxcompares then
  126. exit;
  127. inc(numparts);
  128. setparts[numparts].range:=false;
  129. setparts[numparts].stop:=i;
  130. end
  131. else
  132. {Set element is part of a range.}
  133. if not setparts[numparts].range then
  134. begin
  135. {Transform an element into a range.}
  136. setparts[numparts].range:=true;
  137. setparts[numparts].start:=setparts[numparts].stop;
  138. setparts[numparts].stop:=i;
  139. { there's only one compare per range anymore. Only a }
  140. { sub is added, but that's much faster than a }
  141. { cmp/jcc combo so neglect its effect }
  142. { inc(compares);
  143. if compares>maxcompares then
  144. exit; }
  145. end
  146. else
  147. begin
  148. {Extend a range.}
  149. setparts[numparts].stop:=i;
  150. end;
  151. end;
  152. analizeset:=true;
  153. end;
  154. procedure tcginnode.in_smallset(uopsize: tcgsize; opdef: tdef; setbase: aint);
  155. begin
  156. { location is always LOC_REGISTER }
  157. location_reset(location, LOC_REGISTER, uopsize{def_cgsize(resultdef)});
  158. { allocate a register for the result }
  159. location.register := cg.getintregister(current_asmdata.CurrAsmList, uopsize);
  160. {**************************** SMALL SET **********************}
  161. if left.location.loc=LOC_CONSTANT then
  162. begin
  163. hlcg.a_bit_test_const_loc_reg(current_asmdata.CurrAsmList,
  164. right.resultdef, resultdef,
  165. left.location.value-setbase, right.location,
  166. location.register);
  167. end
  168. else
  169. begin
  170. hlcg.location_force_reg(current_asmdata.CurrAsmList, left.location,
  171. left.resultdef, opdef, true);
  172. register_maybe_adjust_setbase(current_asmdata.CurrAsmList, left.location,
  173. setbase);
  174. hlcg.a_bit_test_reg_loc_reg(current_asmdata.CurrAsmList, left.resultdef,
  175. right.resultdef, resultdef, left.location.register, right.location,
  176. location.register);
  177. end;
  178. location.size := def_cgsize(resultdef);
  179. location.register := cg.makeregsize(current_asmdata.CurrAsmList,
  180. location.register, location.size);
  181. end;
  182. function tcginnode.checkgenjumps(out setparts: Tsetparts; out numparts: byte;out use_small: boolean): boolean;
  183. begin
  184. { check if we can use smallset operation using btl which is limited
  185. to 32 bits, the left side may also not contain higher values !! }
  186. use_small:=is_smallset(right.resultdef) and
  187. not is_signed(left.resultdef) and
  188. ((left.resultdef.typ=orddef) and (torddef(left.resultdef).high<32) or
  189. (left.resultdef.typ=enumdef) and (tenumdef(left.resultdef).max<32));
  190. { Can we generate jumps? Possible for all types of sets }
  191. checkgenjumps:=(right.nodetype=setconstn) and
  192. analizeset(Tsetconstnode(right).value_set^,setparts,numparts,use_small);
  193. end;
  194. function tcginnode.pass_1: tnode;
  195. var
  196. setparts: Tsetparts;
  197. numparts: byte;
  198. use_small: boolean;
  199. begin
  200. result := inherited pass_1;
  201. if not(assigned(result)) and
  202. checkgenjumps(setparts,numparts,use_small) then
  203. expectloc := LOC_JUMP;
  204. end;
  205. procedure tcginnode.pass_generate_code;
  206. var
  207. adjustment,
  208. setbase : aint;
  209. l, l2 : tasmlabel;
  210. otl, ofl : tasmlabel;
  211. hr,
  212. pleftreg : tregister;
  213. setparts : Tsetparts;
  214. opsize : tcgsize;
  215. opdef : tdef;
  216. uopsize : tcgsize;
  217. uopdef : tdef;
  218. orgopsize : tcgsize;
  219. orgopdef : tdef;
  220. genjumps,
  221. use_small,
  222. isjump : boolean;
  223. i,numparts : byte;
  224. needslabel : Boolean;
  225. begin
  226. { We check first if we can generate jumps, this can be done
  227. because the resultdef is already set in firstpass }
  228. genjumps := checkgenjumps(setparts,numparts,use_small);
  229. orgopsize := def_cgsize(left.resultdef);
  230. orgopdef := left.resultdef;
  231. uopsize := OS_32;
  232. uopdef := u32inttype;
  233. if is_signed(left.resultdef) then
  234. begin
  235. opsize := OS_S32;
  236. opdef := s32inttype;
  237. end
  238. else
  239. begin
  240. opsize := uopsize;
  241. opdef := uopdef;
  242. end;
  243. needslabel := false;
  244. isjump:=false;
  245. if (left.expectloc=LOC_JUMP) then
  246. begin
  247. otl:=current_procinfo.CurrTrueLabel;
  248. current_asmdata.getjumplabel(current_procinfo.CurrTrueLabel);
  249. ofl:=current_procinfo.CurrFalseLabel;
  250. current_asmdata.getjumplabel(current_procinfo.CurrFalseLabel);
  251. isjump:=true;
  252. end
  253. else if not genjumps then
  254. { calculate both operators }
  255. { the complex one first }
  256. { only if left will not be a LOC_JUMP, to keep complexity in the }
  257. { code generator down. This almost never happens anyway, only in }
  258. { case like "if ((a in someset) in someboolset) then" etc }
  259. { also not in case of genjumps, because then we don't secondpass }
  260. { right at all (so we have to make sure that "right" really is }
  261. { "right" and not "swapped left" in that case) }
  262. firstcomplex(self);
  263. secondpass(left);
  264. if isjump then
  265. begin
  266. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,orgopdef,opdef,true);
  267. left.resultdef:=opdef;
  268. current_procinfo.CurrTrueLabel:=otl;
  269. current_procinfo.CurrFalseLabel:=ofl;
  270. end
  271. else if (left.location.loc=LOC_JUMP) then
  272. internalerror(2007070101);
  273. { Only process the right if we are not generating jumps }
  274. if not genjumps then
  275. secondpass(right);
  276. if codegenerror then
  277. exit;
  278. { ofcourse not commutative }
  279. if nf_swapped in flags then
  280. swapleftright;
  281. setbase:=tsetdef(right.resultdef).setbase;
  282. if genjumps then
  283. begin
  284. { location is always LOC_JUMP }
  285. location_reset(location,LOC_JUMP,OS_NO);
  286. { If register is used, use only lower 8 bits }
  287. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,left.resultdef,opdef,false);
  288. pleftreg := left.location.register;
  289. { how much have we already substracted from the x in the }
  290. { "x in [y..z]" expression }
  291. adjustment := 0;
  292. hr:=NR_NO;
  293. for i:=1 to numparts do
  294. if setparts[i].range then
  295. { use fact that a <= x <= b <=> aword(x-a) <= aword(b-a) }
  296. begin
  297. { is the range different from all legal values? }
  298. if (setparts[i].stop-setparts[i].start <> 255) or not (orgopsize = OS_8) then
  299. begin
  300. { yes, is the lower bound <> 0? }
  301. if (setparts[i].start <> 0) then
  302. { we're going to substract from the left register, }
  303. { so in case of a LOC_CREGISTER first move the value }
  304. { to edi (not done before because now we can do the }
  305. { move and substract in one instruction with LEA) }
  306. if (left.location.loc = LOC_CREGISTER) and
  307. (hr<>pleftreg) then
  308. begin
  309. { don't change this back to a_op_const_reg/a_load_reg_reg, since pleftreg must not be modified }
  310. hr:=hlcg.getintregister(current_asmdata.CurrAsmList,opdef);
  311. hlcg.a_op_const_reg_reg(current_asmdata.CurrAsmList,OP_SUB,opdef,setparts[i].start,pleftreg,hr);
  312. pleftreg:=hr;
  313. end
  314. else
  315. begin
  316. { otherwise, the value is already in a register }
  317. { that can be modified }
  318. hlcg.a_op_const_reg(current_asmdata.CurrAsmList,OP_SUB,opdef,
  319. setparts[i].start-adjustment,pleftreg)
  320. end;
  321. { new total value substracted from x: }
  322. { adjustment + (setparts[i].start - adjustment) }
  323. adjustment := setparts[i].start;
  324. { check if result < b-a+1 (not "result <= b-a", since }
  325. { we need a carry in case the element is in the range }
  326. { (this will never overflow since we check at the }
  327. { beginning whether stop-start <> 255) }
  328. hlcg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, uopdef, OC_B,
  329. setparts[i].stop-setparts[i].start+1,pleftreg,current_procinfo.CurrTrueLabel);
  330. end
  331. else
  332. { if setparts[i].start = 0 and setparts[i].stop = 255, }
  333. { it's always true since "in" is only allowed for bytes }
  334. begin
  335. hlcg.a_jmp_always(current_asmdata.CurrAsmList,current_procinfo.CurrTrueLabel);
  336. end;
  337. end
  338. else
  339. begin
  340. { Emit code to check if left is an element }
  341. hlcg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, opdef, OC_EQ,
  342. setparts[i].stop-adjustment,pleftreg,current_procinfo.CurrTrueLabel);
  343. end;
  344. { To compensate for not doing a second pass }
  345. right.location.reference.symbol:=nil;
  346. hlcg.a_jmp_always(current_asmdata.CurrAsmList,current_procinfo.CurrFalseLabel);
  347. end
  348. else
  349. {*****************************************************************}
  350. { NO JUMP TABLE GENERATION }
  351. {*****************************************************************}
  352. begin
  353. { We will now generated code to check the set itself, no jmps,
  354. handle smallsets separate, because it allows faster checks }
  355. if use_small then
  356. begin
  357. in_smallset(uopsize, opdef, setbase);
  358. end
  359. else
  360. {************************** NOT SMALL SET ********************}
  361. begin
  362. { location is always LOC_REGISTER }
  363. location_reset(location, LOC_REGISTER, uopsize{def_cgsize(resultdef)});
  364. { allocate a register for the result }
  365. location.register := cg.getintregister(current_asmdata.CurrAsmList, uopsize);
  366. if right.location.loc=LOC_CONSTANT then
  367. begin
  368. { can it actually occur currently? CEC }
  369. { yes: "if bytevar in [1,3,5,7,9,11,13,15]" (JM) }
  370. { note: this code assumes that left in [0..255], which is a valid }
  371. { assumption (other cases will be caught by range checking) (JM) }
  372. { load left in register }
  373. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,left.resultdef,resultdef,true);
  374. register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
  375. { emit bit test operation -- warning: do not use
  376. location_force_reg() to force a set into a register, except
  377. to a register of the same size as the set. The reason is
  378. that on big endian systems, this would require moving the
  379. set to the most significant part of the new register,
  380. and location_force_register can't do that (it does not
  381. know the type).
  382. a_bit_test_reg_loc_reg() properly takes into account the
  383. size of the set to adjust the register index to test }
  384. hlcg.a_bit_test_reg_loc_reg(current_asmdata.CurrAsmList,
  385. left.resultdef,right.resultdef,resultdef,
  386. left.location.register,right.location,location.register);
  387. { now zero the result if left > nr_of_bits_in_right_register }
  388. hr := cg.getintregister(current_asmdata.CurrAsmList,location.size);
  389. { if left > tcgsize2size[opsize]*8 then hr := 0 else hr := $ffffffff }
  390. { (left.location.size = location.size at this point) }
  391. cg.a_op_const_reg_reg(current_asmdata.CurrAsmList, OP_SUB, location.size, tcgsize2size[opsize]*8, left.location.register, hr);
  392. cg.a_op_const_reg(current_asmdata.CurrAsmList, OP_SAR, location.size, (tcgsize2size[opsize]*8)-1, hr);
  393. { if left > tcgsize2size[opsize]*8-1, then result := 0 else result := result of bit test }
  394. cg.a_op_reg_reg(current_asmdata.CurrAsmList, OP_AND, location.size, hr, location.register);
  395. end { of right.location.loc=LOC_CONSTANT }
  396. { do search in a normal set which could have >32 elements
  397. but also used if the left side contains higher values > 32 }
  398. else if (left.location.loc=LOC_CONSTANT) then
  399. begin
  400. if (left.location.value < setbase) or (((left.location.value-setbase) shr 3) >= right.resultdef.size) then
  401. {should be caught earlier }
  402. internalerror(2007020402);
  403. hlcg.a_bit_test_const_loc_reg(current_asmdata.CurrAsmList,left.resultdef,resultdef,left.location.value-setbase,
  404. right.location,location.register);
  405. end
  406. else
  407. begin
  408. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,left.resultdef,opdef,true);
  409. register_maybe_adjust_setbase(current_asmdata.CurrAsmList,left.location,setbase);
  410. pleftreg := left.location.register;
  411. if (opsize >= OS_S8) or { = if signed }
  412. ((left.resultdef.typ=orddef) and
  413. ((torddef(left.resultdef).low < int64(tsetdef(right.resultdef).setbase)) or
  414. (torddef(left.resultdef).high > int64(tsetdef(right.resultdef).setmax)))) or
  415. ((left.resultdef.typ=enumdef) and
  416. ((tenumdef(left.resultdef).min < aint(tsetdef(right.resultdef).setbase)) or
  417. (tenumdef(left.resultdef).max > aint(tsetdef(right.resultdef).setmax)))) then
  418. begin
  419. current_asmdata.getjumplabel(l);
  420. current_asmdata.getjumplabel(l2);
  421. needslabel := True;
  422. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, left.location.size, OC_BE, tsetdef(right.resultdef).setmax-tsetdef(right.resultdef).setbase, pleftreg, l);
  423. cg.a_load_const_reg(current_asmdata.CurrAsmList, location.size, 0, location.register);
  424. cg.a_jmp_always(current_asmdata.CurrAsmList, l2);
  425. cg.a_label(current_asmdata.CurrAsmList, l);
  426. end;
  427. hlcg.a_bit_test_reg_loc_reg(current_asmdata.CurrAsmList,left.resultdef,right.resultdef,resultdef,
  428. pleftreg,right.location,location.register);
  429. if needslabel then
  430. cg.a_label(current_asmdata.CurrAsmList, l2);
  431. end;
  432. location.size := def_cgsize(resultdef);
  433. location.register := cg.makeregsize(current_asmdata.CurrAsmList, location.register, location.size);
  434. end;
  435. end;
  436. location_freetemp(current_asmdata.CurrAsmList, right.location);
  437. end;
  438. {*****************************************************************************
  439. TCGCASENODE
  440. *****************************************************************************}
  441. function tcgcasenode.blocklabel(id:longint):tasmlabel;
  442. begin
  443. if not assigned(blocks[id]) then
  444. internalerror(200411301);
  445. result:=pcaseblock(blocks[id])^.blocklabel;
  446. end;
  447. procedure tcgcasenode.optimizevalues(var max_linear_list:aint;var max_dist:aword);
  448. begin
  449. { no changes by default }
  450. end;
  451. function tcgcasenode.has_jumptable : boolean;
  452. begin
  453. { No jumptable support in the default implementation }
  454. has_jumptable:=false;
  455. end;
  456. procedure tcgcasenode.genjumptable(hp : pcaselabel;min_,max_ : aint);
  457. begin
  458. internalerror(200209161);
  459. end;
  460. procedure tcgcasenode.genlinearlist(hp : pcaselabel);
  461. var
  462. first : boolean;
  463. last : TConstExprInt;
  464. scratch_reg: tregister;
  465. procedure genitem(t : pcaselabel);
  466. procedure gensub(value:aint);
  467. begin
  468. { here, since the sub and cmp are separate we need
  469. to move the result before subtract to help
  470. the register allocator
  471. }
  472. hlcg.a_load_reg_reg(current_asmdata.CurrAsmList, opsize, opsize, hregister, scratch_reg);
  473. hlcg.a_op_const_reg(current_asmdata.CurrAsmList, OP_SUB, opsize, value, hregister);
  474. end;
  475. begin
  476. if assigned(t^.less) then
  477. genitem(t^.less);
  478. { do we need to test the first value? }
  479. if first and (t^._low>get_min_value(left.resultdef)) then
  480. hlcg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,jmp_lt,aint(t^._low.svalue),hregister,elselabel);
  481. if t^._low=t^._high then
  482. begin
  483. if t^._low-last=0 then
  484. hlcg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,OC_EQ,0,hregister,blocklabel(t^.blockid))
  485. else
  486. begin
  487. gensub(aint(t^._low.svalue-last.svalue));
  488. hlcg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,
  489. OC_EQ,aint(t^._low.svalue-last.svalue),scratch_reg,blocklabel(t^.blockid));
  490. end;
  491. last:=t^._low;
  492. end
  493. else
  494. begin
  495. { it begins with the smallest label, if the value }
  496. { is even smaller then jump immediately to the }
  497. { ELSE-label }
  498. if first then
  499. begin
  500. { have we to ajust the first value ? }
  501. if (t^._low>get_min_value(left.resultdef)) or (get_min_value(left.resultdef)<>0) then
  502. gensub(aint(t^._low.svalue));
  503. end
  504. else
  505. begin
  506. { if there is no unused label between the last and the }
  507. { present label then the lower limit can be checked }
  508. { immediately. else check the range in between: }
  509. gensub(aint(t^._low.svalue-last.svalue));
  510. hlcg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, opsize,jmp_lt,aint(t^._low.svalue-last.svalue),scratch_reg,elselabel);
  511. end;
  512. gensub(aint(t^._high.svalue-t^._low.svalue));
  513. hlcg.a_cmp_const_reg_label(current_asmdata.CurrAsmList,opsize,jmp_le,aint(t^._high.svalue-t^._low.svalue),scratch_reg,blocklabel(t^.blockid));
  514. last:=t^._high;
  515. end;
  516. first:=false;
  517. if assigned(t^.greater) then
  518. genitem(t^.greater);
  519. end;
  520. begin
  521. { do we need to generate cmps? }
  522. if (with_sign and (min_label<0)) then
  523. genlinearcmplist(hp)
  524. else
  525. begin
  526. last:=0;
  527. first:=true;
  528. scratch_reg:=hlcg.getintregister(current_asmdata.CurrAsmList,opsize);
  529. genitem(hp);
  530. hlcg.a_jmp_always(current_asmdata.CurrAsmList,elselabel);
  531. end;
  532. end;
  533. procedure tcgcasenode.genlinearcmplist(hp : pcaselabel);
  534. var
  535. last : TConstExprInt;
  536. lastwasrange: boolean;
  537. procedure genitem(t : pcaselabel);
  538. {$ifndef cpu64bitalu}
  539. var
  540. l1 : tasmlabel;
  541. {$endif not cpu64bitalu}
  542. begin
  543. if assigned(t^.less) then
  544. genitem(t^.less);
  545. if t^._low=t^._high then
  546. begin
  547. {$ifdef cpu32bitalu}
  548. if def_cgsize(opsize) in [OS_S64,OS_64] then
  549. begin
  550. current_asmdata.getjumplabel(l1);
  551. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_32, OC_NE, aint(hi(int64(t^._low.svalue))),hregister2,l1);
  552. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_32, OC_EQ, aint(lo(int64(t^._low.svalue))),hregister, blocklabel(t^.blockid));
  553. cg.a_label(current_asmdata.CurrAsmList,l1);
  554. end
  555. else
  556. {$endif cpu32bitalu}
  557. {$ifdef cpu16bitalu)}
  558. if def_cgsize(opsize) in [OS_S64,OS_64] then
  559. begin
  560. current_asmdata.getjumplabel(l1);
  561. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_NE, aint(hi(hi(int64(t^._low.svalue)))),GetNextReg(hregister2),l1);
  562. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_NE, aint(lo(hi(int64(t^._low.svalue)))),hregister2,l1);
  563. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_NE, aint(hi(lo(int64(t^._low.svalue)))),GetNextReg(hregister),l1);
  564. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_EQ, aint(lo(lo(int64(t^._low.svalue)))),hregister, blocklabel(t^.blockid));
  565. cg.a_label(current_asmdata.CurrAsmList,l1);
  566. end
  567. else if def_cgsize(opsize) in [OS_S32,OS_32] then
  568. begin
  569. current_asmdata.getjumplabel(l1);
  570. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_NE, aint(hi(int32(t^._low.svalue))),GetNextReg(hregister),l1);
  571. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_EQ, aint(lo(int32(t^._low.svalue))),hregister, blocklabel(t^.blockid));
  572. cg.a_label(current_asmdata.CurrAsmList,l1);
  573. end
  574. else
  575. {$endif cpu16bitalu}
  576. begin
  577. hlcg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, opsize, OC_EQ, aint(t^._low.svalue),hregister, blocklabel(t^.blockid));
  578. end;
  579. { Reset last here, because we've only checked for one value and need to compare
  580. for the next range both the lower and upper bound }
  581. lastwasrange := false;
  582. end
  583. else
  584. begin
  585. { it begins with the smallest label, if the value }
  586. { is even smaller then jump immediately to the }
  587. { ELSE-label }
  588. if not lastwasrange or (t^._low-last>1) then
  589. begin
  590. {$ifdef cpu32bitalu}
  591. if def_cgsize(opsize) in [OS_64,OS_S64] then
  592. begin
  593. current_asmdata.getjumplabel(l1);
  594. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_32, jmp_lt, aint(hi(int64(t^._low.svalue))),
  595. hregister2, elselabel);
  596. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_32, jmp_gt, aint(hi(int64(t^._low.svalue))),
  597. hregister2, l1);
  598. { the comparisation of the low dword must be always unsigned! }
  599. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_32, OC_B, aint(lo(int64(t^._low.svalue))), hregister, elselabel);
  600. cg.a_label(current_asmdata.CurrAsmList,l1);
  601. end
  602. else
  603. {$endif cpu32bitalu}
  604. {$ifdef cpu16bitalu}
  605. if def_cgsize(opsize) in [OS_64,OS_S64] then
  606. begin
  607. current_asmdata.getjumplabel(l1);
  608. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, jmp_lt, aint(hi(hi(int64(t^._low.svalue)))),
  609. GetNextReg(hregister2), elselabel);
  610. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, jmp_gt, aint(hi(hi(int64(t^._low.svalue)))),
  611. GetNextReg(hregister2), l1);
  612. { the comparison of the low words must be always unsigned! }
  613. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_B, aint(lo(hi(int64(t^._low.svalue)))),
  614. hregister2, elselabel);
  615. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_A, aint(lo(hi(int64(t^._low.svalue)))),
  616. hregister2, l1);
  617. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_B, aint(hi(lo(int64(t^._low.svalue)))),
  618. GetNextReg(hregister), elselabel);
  619. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_A, aint(hi(lo(int64(t^._low.svalue)))),
  620. GetNextReg(hregister), l1);
  621. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_B, aint(lo(lo(int64(t^._low.svalue)))), hregister, elselabel);
  622. cg.a_label(current_asmdata.CurrAsmList,l1);
  623. end
  624. else if def_cgsize(opsize) in [OS_32,OS_S32] then
  625. begin
  626. current_asmdata.getjumplabel(l1);
  627. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, jmp_lt, aint(hi(int32(t^._low.svalue))),
  628. GetNextReg(hregister), elselabel);
  629. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, jmp_gt, aint(hi(int32(t^._low.svalue))),
  630. GetNextReg(hregister), l1);
  631. { the comparisation of the low dword must be always unsigned! }
  632. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_B, aint(lo(int32(t^._low.svalue))), hregister, elselabel);
  633. cg.a_label(current_asmdata.CurrAsmList,l1);
  634. end
  635. else
  636. {$endif cpu16bitalu}
  637. begin
  638. hlcg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, opsize, jmp_lt, aint(t^._low.svalue), hregister,
  639. elselabel);
  640. end;
  641. end;
  642. {$ifdef cpu32bitalu}
  643. if def_cgsize(opsize) in [OS_S64,OS_64] then
  644. begin
  645. current_asmdata.getjumplabel(l1);
  646. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_32, jmp_lt, aint(hi(int64(t^._high.svalue))), hregister2,
  647. blocklabel(t^.blockid));
  648. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_32, jmp_gt, aint(hi(int64(t^._high.svalue))), hregister2,
  649. l1);
  650. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_32, OC_BE, aint(lo(int64(t^._high.svalue))), hregister, blocklabel(t^.blockid));
  651. cg.a_label(current_asmdata.CurrAsmList,l1);
  652. end
  653. else
  654. {$endif cpu32bitalu}
  655. {$ifdef cpu16bitalu}
  656. if def_cgsize(opsize) in [OS_S64,OS_64] then
  657. begin
  658. current_asmdata.getjumplabel(l1);
  659. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, jmp_lt, aint(hi(hi(int64(t^._high.svalue)))), GetNextReg(hregister2),
  660. blocklabel(t^.blockid));
  661. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, jmp_gt, aint(hi(hi(int64(t^._high.svalue)))), GetNextReg(hregister2),
  662. l1);
  663. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_B, aint(lo(hi(int64(t^._high.svalue)))), hregister2,
  664. blocklabel(t^.blockid));
  665. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_A, aint(lo(hi(int64(t^._high.svalue)))), hregister2,
  666. l1);
  667. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_B, aint(hi(lo(int64(t^._high.svalue)))), GetNextReg(hregister),
  668. blocklabel(t^.blockid));
  669. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_A, aint(hi(lo(int64(t^._high.svalue)))), GetNextReg(hregister),
  670. l1);
  671. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_BE, aint(lo(lo(int64(t^._high.svalue)))), hregister, blocklabel(t^.blockid));
  672. cg.a_label(current_asmdata.CurrAsmList,l1);
  673. end
  674. else if def_cgsize(opsize) in [OS_S32,OS_32] then
  675. begin
  676. current_asmdata.getjumplabel(l1);
  677. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, jmp_lt, aint(hi(int32(t^._high.svalue))), GetNextReg(hregister),
  678. blocklabel(t^.blockid));
  679. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, jmp_gt, aint(hi(int32(t^._high.svalue))), GetNextReg(hregister),
  680. l1);
  681. cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, OS_16, OC_BE, aint(lo(int32(t^._high.svalue))), hregister, blocklabel(t^.blockid));
  682. cg.a_label(current_asmdata.CurrAsmList,l1);
  683. end
  684. else
  685. {$endif cpu16bitalu}
  686. begin
  687. hlcg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, opsize, jmp_le, aint(t^._high.svalue), hregister, blocklabel(t^.blockid));
  688. end;
  689. last:=t^._high;
  690. lastwasrange := true;
  691. end;
  692. if assigned(t^.greater) then
  693. genitem(t^.greater);
  694. end;
  695. begin
  696. last:=0;
  697. lastwasrange:=false;
  698. genitem(hp);
  699. hlcg.a_jmp_always(current_asmdata.CurrAsmList,elselabel);
  700. end;
  701. procedure tcgcasenode.pass_generate_code;
  702. var
  703. oldflowcontrol: tflowcontrol;
  704. i : longint;
  705. distv,
  706. lv,hv,
  707. max_label: tconstexprint;
  708. labelcnt : aint;
  709. max_linear_list : aint;
  710. otl, ofl: tasmlabel;
  711. isjump : boolean;
  712. max_dist,
  713. dist : aword;
  714. oldexecutionweight : longint;
  715. begin
  716. location_reset(location,LOC_VOID,OS_NO);
  717. oldflowcontrol := flowcontrol;
  718. include(flowcontrol,fc_inflowcontrol);
  719. { Allocate labels }
  720. current_asmdata.getjumplabel(endlabel);
  721. current_asmdata.getjumplabel(elselabel);
  722. for i:=0 to blocks.count-1 do
  723. current_asmdata.getjumplabel(pcaseblock(blocks[i])^.blocklabel);
  724. with_sign:=is_signed(left.resultdef);
  725. if with_sign then
  726. begin
  727. jmp_gt:=OC_GT;
  728. jmp_lt:=OC_LT;
  729. jmp_le:=OC_LTE;
  730. end
  731. else
  732. begin
  733. jmp_gt:=OC_A;
  734. jmp_lt:=OC_B;
  735. jmp_le:=OC_BE;
  736. end;
  737. { save current current_procinfo.CurrTrueLabel and current_procinfo.CurrFalseLabel }
  738. isjump:=false;
  739. if left.expectloc=LOC_JUMP then
  740. begin
  741. otl:=current_procinfo.CurrTrueLabel;
  742. current_asmdata.getjumplabel(current_procinfo.CurrTrueLabel);
  743. ofl:=current_procinfo.CurrFalseLabel;
  744. current_asmdata.getjumplabel(current_procinfo.CurrFalseLabel);
  745. isjump:=true;
  746. end;
  747. secondpass(left);
  748. { determines the size of the operand }
  749. opsize:=left.resultdef;
  750. { copy the case expression to a register }
  751. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,left.resultdef,opsize,false);
  752. {$ifndef cpu64bitalu}
  753. if def_cgsize(opsize) in [OS_S64,OS_64] then
  754. begin
  755. hregister:=left.location.register64.reglo;
  756. hregister2:=left.location.register64.reghi;
  757. end
  758. else
  759. {$endif not cpu64bitalu}
  760. hregister:=left.location.register;
  761. if isjump then
  762. begin
  763. current_procinfo.CurrTrueLabel:=otl;
  764. current_procinfo.CurrFalseLabel:=ofl;
  765. end
  766. else
  767. if (left.location.loc=LOC_JUMP) then
  768. internalerror(2006050501);
  769. { we need the min_label always to choose between }
  770. { cmps and subs/decs }
  771. min_label:=case_get_min(labels);
  772. { Generate the jumps }
  773. {$ifdef OLDREGVARS}
  774. load_all_regvars(current_asmdata.CurrAsmList);
  775. {$endif OLDREGVARS}
  776. {$ifndef cpu64bitalu}
  777. if def_cgsize(opsize) in [OS_64,OS_S64] then
  778. genlinearcmplist(labels)
  779. else
  780. {$endif not cpu64bitalu}
  781. begin
  782. if cs_opt_level1 in current_settings.optimizerswitches then
  783. begin
  784. { procedures are empirically passed on }
  785. { consumption can also be calculated }
  786. { but does it pay on the different }
  787. { processors? }
  788. { moreover can the size only be appro- }
  789. { ximated as it is not known if rel8, }
  790. { rel16 or rel32 jumps are used }
  791. max_label:=case_get_max(labels);
  792. labelcnt:=case_count_labels(labels);
  793. { can we omit the range check of the jump table ? }
  794. getrange(left.resultdef,lv,hv);
  795. jumptable_no_range:=(lv=min_label) and (hv=max_label);
  796. { hack a little bit, because the range can be greater }
  797. { than the positive range of a aint }
  798. if (min_label<0) and (max_label>0) then
  799. distv:=max_label+min_label
  800. else
  801. distv:=max_label-min_label;
  802. if (distv>=0) then
  803. dist:=distv.uvalue
  804. else
  805. dist:=-distv.svalue;
  806. { optimize for size ? }
  807. if cs_opt_size in current_settings.optimizerswitches then
  808. begin
  809. if has_jumptable and
  810. (min_label>=int64(low(aint))) and
  811. (max_label<=high(aint)) and
  812. not((labelcnt<=2) or
  813. ((max_label-min_label)<0) or
  814. ((max_label-min_label)>3*labelcnt)) then
  815. begin
  816. { if the labels less or more a continuum then }
  817. genjumptable(labels,min_label.svalue,max_label.svalue);
  818. end
  819. else
  820. begin
  821. { a linear list is always smaller than a jump tree }
  822. genlinearlist(labels);
  823. end;
  824. end
  825. else
  826. begin
  827. max_dist:=4*labelcnt;
  828. if jumptable_no_range then
  829. max_linear_list:=4
  830. else
  831. max_linear_list:=2;
  832. { allow processor specific values }
  833. optimizevalues(max_linear_list,max_dist);
  834. if (labelcnt<=max_linear_list) then
  835. genlinearlist(labels)
  836. else
  837. begin
  838. if (has_jumptable) and
  839. (dist<max_dist) and
  840. (min_label>=int64(low(aint))) and
  841. (max_label<=high(aint)) then
  842. genjumptable(labels,min_label.svalue,max_label.svalue)
  843. else
  844. genlinearlist(labels);
  845. end;
  846. end;
  847. end
  848. else
  849. { it's always not bad }
  850. genlinearlist(labels);
  851. end;
  852. { estimates the repeat of each instruction }
  853. oldexecutionweight:=cg.executionweight;
  854. cg.executionweight:=cg.executionweight div case_count_labels(labels);
  855. if cg.executionweight<1 then
  856. cg.executionweight:=1;
  857. { generate the instruction blocks }
  858. for i:=0 to blocks.count-1 do
  859. begin
  860. current_asmdata.CurrAsmList.concat(cai_align.create(current_settings.alignment.jumpalign));
  861. cg.a_label(current_asmdata.CurrAsmList,pcaseblock(blocks[i])^.blocklabel);
  862. secondpass(pcaseblock(blocks[i])^.statement);
  863. { don't come back to case line }
  864. current_filepos:=current_asmdata.CurrAsmList.getlasttaifilepos^;
  865. {$ifdef OLDREGVARS}
  866. load_all_regvars(current_asmdata.CurrAsmList);
  867. {$endif OLDREGVARS}
  868. hlcg.a_jmp_always(current_asmdata.CurrAsmList,endlabel);
  869. end;
  870. current_asmdata.CurrAsmList.concat(cai_align.create(current_settings.alignment.jumpalign));
  871. { ...and the else block }
  872. hlcg.a_label(current_asmdata.CurrAsmList,elselabel);
  873. if assigned(elseblock) then
  874. begin
  875. secondpass(elseblock);
  876. {$ifdef OLDREGVARS}
  877. load_all_regvars(current_asmdata.CurrAsmList);
  878. {$endif OLDREGVARS}
  879. end;
  880. cg.executionweight:=oldexecutionweight;
  881. current_asmdata.CurrAsmList.concat(cai_align.create(current_settings.alignment.jumpalign));
  882. hlcg.a_label(current_asmdata.CurrAsmList,endlabel);
  883. { Reset labels }
  884. for i:=0 to blocks.count-1 do
  885. pcaseblock(blocks[i])^.blocklabel:=nil;
  886. flowcontrol := oldflowcontrol + (flowcontrol - [fc_inflowcontrol]);
  887. end;
  888. begin
  889. csetelementnode:=tcgsetelementnode;
  890. cinnode:=tcginnode;
  891. ccasenode:=tcgcasenode;
  892. end.