cgutils.pas 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507
  1. {
  2. Copyright (c) 1998-2004 by Florian Klaempfl
  3. Some basic types and constants for the code generation
  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. { This unit exports some helper routines which are used across the code generator }
  18. unit cgutils;
  19. {$i fpcdefs.inc}
  20. interface
  21. uses
  22. globtype,
  23. cclasses,
  24. aasmbase,
  25. cpubase,cgbase;
  26. const
  27. { implementation of max function using only functionality that can be
  28. evaluated as a constant expression by the compiler -- this is
  29. basically maxcpureg = max(max(first_int_imreg,first_fpu_imreg),first_mm_imreg)-1 }
  30. tmpmaxcpufpuintreg = first_int_imreg + ((first_fpu_imreg - first_int_imreg) * ord(first_int_imreg < first_fpu_imreg));
  31. maxcpuregister = (tmpmaxcpufpuintreg + ((first_mm_imreg - tmpmaxcpufpuintreg) * ord(tmpmaxcpufpuintreg < first_mm_imreg)))-1;
  32. type
  33. { Set type definition for cpuregisters }
  34. tcpuregisterset = set of 0..maxcpuregister;
  35. tcpuregisterarray = array of tsuperregister;
  36. { use record for type-safety; should only be accessed directly by temp
  37. manager }
  38. treftemppos = record
  39. val: asizeint;
  40. end;
  41. {$packset 1}
  42. { a reference may be volatile for reading, writing, or both. E.g., local variables
  43. inside try-blocks are volatile for writes (writes must not be removed, because at
  44. any point an exception may be triggered and then all previous writes to the
  45. variable must have been performed), but not for reads (these variables' values
  46. won't be changed behind the back of the current code just because they're in a
  47. try-block) }
  48. tvolatility = (vol_read,vol_write);
  49. tvolatilityset = set of tvolatility;
  50. {$packset default}
  51. { reference record, reordered for best alignment }
  52. preference = ^treference;
  53. treference = record
  54. offset : asizeint;
  55. symbol,
  56. relsymbol : tasmsymbol;
  57. temppos : treftemppos;
  58. {$if defined(x86)}
  59. segment,
  60. {$endif defined(x86)}
  61. base,
  62. index : tregister;
  63. refaddr : trefaddr;
  64. scalefactor : byte;
  65. {$if defined(riscv32) or defined(riscv64)}
  66. symboldata : tlinkedlistitem;
  67. {$endif riscv32/64}
  68. {$ifdef arm}
  69. symboldata : tlinkedlistitem;
  70. signindex : shortint;
  71. shiftimm : byte;
  72. addressmode : taddressmode;
  73. shiftmode : tshiftmode;
  74. {$endif arm}
  75. {$ifdef aarch64}
  76. symboldata : tlinkedlistitem;
  77. shiftimm : byte;
  78. addressmode : taddressmode;
  79. shiftmode : tshiftmode;
  80. {$endif aarch64}
  81. {$ifdef avr}
  82. addressmode : taddressmode;
  83. {$endif avr}
  84. {$ifdef m68k}
  85. { indexed increment and decrement mode }
  86. { (An)+ and -(An) }
  87. direction : tdirection;
  88. {$endif m68k}
  89. {$ifdef jvm}
  90. arrayreftype: tarrayreftype;
  91. indexbase: tregister;
  92. indexsymbol: tasmsymbol;
  93. indexoffset: aint;
  94. checkcast: boolean;
  95. {$endif jvm}
  96. {$ifdef wasm}
  97. //arrayreftype: tarrayreftype;
  98. //indexbase: tregister;
  99. //indexsymbol: tasmsymbol;
  100. //indexoffset: aint;
  101. //checkcast: boolean;
  102. {$endif wasm}
  103. volatility: tvolatilityset;
  104. alignment : byte;
  105. end;
  106. const
  107. ctempposinvalid: treftemppos = (val: low(treftemppos.val));
  108. type
  109. tsubsetregister = record
  110. subsetreg : tregister;
  111. startbit, bitlen: byte;
  112. subsetregsize: tcgsize;
  113. end;
  114. tsubsetreference = record
  115. ref: treference;
  116. bitindexreg: tregister;
  117. startbit, bitlen: byte;
  118. end;
  119. tlocation = record
  120. loc : TCGLoc;
  121. size : TCGSize;
  122. case TCGLoc of
  123. {$ifdef cpuflags}
  124. LOC_FLAGS : (resflags : tresflags);
  125. {$endif cpuflags}
  126. LOC_CONSTANT : (
  127. case longint of
  128. {$if defined(cpu64bitalu) or defined(cpuhighleveltarget)}
  129. 1 : (value : Int64);
  130. {$else cpu64bitalu or cpuhighleveltarget}
  131. {$ifdef FPC_BIG_ENDIAN}
  132. 1 : (_valuedummy,value : longint);
  133. {$else FPC_BIG_ENDIAN}
  134. 1 : (value : longint);
  135. {$endif FPC_BIG_ENDIAN}
  136. {$endif cpu64bitalu or cpuhighleveltarget}
  137. 2 : (value64 : Int64);
  138. );
  139. LOC_CREFERENCE,
  140. LOC_REFERENCE : (reference : treference);
  141. { segment in reference at the same place as in loc_register }
  142. LOC_REGISTER,
  143. LOC_CREGISTER : (
  144. case longint of
  145. 1 : (register : tregister;
  146. { some x86_64 targets require two function result registers }
  147. registerhi : tregister;
  148. {$ifdef m68k}
  149. { some m68k OSes require that the result is returned in d0 and a0
  150. the second location must be stored here }
  151. registeralias : tregister;
  152. {$endif m68k}
  153. );
  154. {$ifdef cpu64bitalu}
  155. { overlay a 128 Bit register type }
  156. 2 : (register128 : tregister128);
  157. {$else if not defined(cpuhighleveltarget}
  158. { overlay a 64 Bit register type }
  159. 2 : (register64 : tregister64);
  160. {$endif cpu64bitalu and not cpuhighleveltarget}
  161. {$ifdef cpu8bitalu}
  162. 3 : (registers : array[0..3] of tregister);
  163. {$endif cpu8bitalu}
  164. );
  165. LOC_SUBSETREG,
  166. LOC_CSUBSETREG : (
  167. sreg: tsubsetregister;
  168. );
  169. LOC_SUBSETREF : (
  170. sref: tsubsetreference;
  171. );
  172. LOC_JUMP : (
  173. truelabel, falselabel: tasmlabel;
  174. );
  175. end;
  176. { trerefence handling }
  177. {# Clear to zero a treference }
  178. procedure reference_reset(var ref : treference; alignment: longint; volatility: tvolatilityset);
  179. {# Clear to zero a treference, and set is base address
  180. to base register.
  181. }
  182. procedure reference_reset_base(var ref : treference;base : tregister;offset : longint; temppos : treftemppos; alignment : longint; volatility: tvolatilityset);
  183. procedure reference_reset_symbol(var ref : treference;sym : tasmsymbol;offset, alignment : longint; volatility: tvolatilityset);
  184. { This routine verifies if two references are the same, and
  185. if so, returns TRUE, otherwise returns false.
  186. }
  187. function references_equal(const sref,dref : treference) : boolean;
  188. { tlocation handling }
  189. { cannot be used for loc_(c)reference, because that one requires an alignment }
  190. procedure location_reset(var l : tlocation;lt:TCGNonRefLoc;lsize:TCGSize);
  191. { for loc_(c)reference }
  192. procedure location_reset_ref(var l : tlocation;lt:TCGRefLoc;lsize:TCGSize; alignment: longint; volatility: tvolatilityset);
  193. { for loc_jump }
  194. procedure location_reset_jump(out l: tlocation; truelab, falselab: tasmlabel);
  195. procedure location_copy(var destloc:tlocation; const sourceloc : tlocation);
  196. procedure location_swap(var destloc,sourceloc : tlocation);
  197. function location_reg2string(const locreg: tlocation): string;
  198. { returns r with the given alignment }
  199. function setalignment(const r : treference;b : byte) : treference;
  200. { Helper function which calculate "magic" values for replacement of division
  201. by constant operation by multiplication. See the "PowerPC compiler developer
  202. manual" for more information.
  203. N is number of bits to handle, functionality tested for values 32 and 64. }
  204. procedure calc_divconst_magic_signed(N: byte; d: aInt; out magic_m: aInt; out magic_s: byte);
  205. procedure calc_divconst_magic_unsigned(N: byte; d: aWord; out magic_m: aWord; out magic_add: boolean; out magic_shift: byte);
  206. implementation
  207. uses
  208. systems,
  209. verbose,
  210. cgobj;
  211. {****************************************************************************
  212. TReference
  213. ****************************************************************************}
  214. procedure reference_reset(var ref: treference; alignment: longint; volatility: tvolatilityset);
  215. begin
  216. FillChar(ref,sizeof(treference),0);
  217. {$ifdef arm}
  218. ref.signindex:=1;
  219. {$endif arm}
  220. ref.alignment:=alignment;
  221. ref.volatility:=volatility;
  222. ref.temppos:=ctempposinvalid;
  223. end;
  224. procedure reference_reset_base(var ref: treference; base: tregister; offset : longint; temppos : treftemppos ; alignment : longint; volatility: tvolatilityset);
  225. begin
  226. reference_reset(ref,alignment,volatility);
  227. ref.base:=base;
  228. ref.offset:=offset;
  229. ref.temppos:=temppos;
  230. end;
  231. procedure reference_reset_symbol(var ref: treference; sym: tasmsymbol; offset, alignment: longint; volatility: tvolatilityset);
  232. begin
  233. reference_reset(ref,alignment,volatility);
  234. ref.symbol:=sym;
  235. ref.offset:=offset;
  236. ref.temppos:=ctempposinvalid;
  237. end;
  238. function references_equal(const sref,dref : treference):boolean;
  239. begin
  240. references_equal:=CompareByte(sref,dref,sizeof(treference))=0;
  241. end;
  242. { returns r with the given alignment }
  243. function setalignment(const r : treference;b : byte) : treference;
  244. begin
  245. result:=r;
  246. result.alignment:=b;
  247. end;
  248. {****************************************************************************
  249. TLocation
  250. ****************************************************************************}
  251. procedure location_reset(var l : tlocation;lt:TCGNonRefLoc;lsize:TCGSize);
  252. begin
  253. FillChar(l,sizeof(tlocation),0);
  254. l.loc:=lt;
  255. l.size:=lsize;
  256. if l.loc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_JUMP] then
  257. { call location_reset_ref/jump instead }
  258. internalerror(2009020705);
  259. end;
  260. procedure location_reset_ref(var l: tlocation; lt: TCGRefLoc; lsize: TCGSize; alignment: longint; volatility: tvolatilityset);
  261. begin
  262. FillChar(l,sizeof(tlocation),0);
  263. l.loc:=lt;
  264. l.size:=lsize;
  265. {$ifdef arm}
  266. l.reference.signindex:=1;
  267. {$endif arm}
  268. l.reference.alignment:=alignment;
  269. l.reference.volatility:=volatility;
  270. l.reference.temppos:=ctempposinvalid;
  271. end;
  272. procedure location_reset_jump(out l: tlocation; truelab, falselab: tasmlabel);
  273. begin
  274. FillChar(l,sizeof(tlocation),0);
  275. l.loc:=LOC_JUMP;
  276. l.size:=OS_NO;
  277. l.truelabel:=truelab;
  278. l.falselabel:=falselab;
  279. end;
  280. procedure location_copy(var destloc:tlocation; const sourceloc : tlocation);
  281. begin
  282. destloc:=sourceloc;
  283. end;
  284. procedure location_swap(var destloc,sourceloc : tlocation);
  285. var
  286. swapl : tlocation;
  287. begin
  288. swapl := destloc;
  289. destloc := sourceloc;
  290. sourceloc := swapl;
  291. end;
  292. function location_reg2string(const locreg: tlocation): string;
  293. begin
  294. if not (locreg.loc in [LOC_REGISTER,LOC_CREGISTER,
  295. LOC_MMXREGISTER,LOC_CMMXREGISTER,
  296. LOC_MMREGISTER,LOC_CMMREGISTER,
  297. LOC_FPUREGISTER,LOC_CFPUREGISTER]) then
  298. internalerror(2013122301);
  299. if locreg.loc in [LOC_REGISTER,LOC_CREGISTER] then
  300. begin
  301. case locreg.size of
  302. {$if defined(cpu64bitalu)}
  303. OS_128,OS_S128:
  304. result:=std_regname(locreg.registerhi)+':'+std_regname(locreg.register);
  305. {$elseif defined(cpu32bitalu)}
  306. OS_64,OS_S64:
  307. result:=std_regname(locreg.registerhi)+':'+std_regname(locreg.register);
  308. {$elseif defined(cpu16bitalu)}
  309. OS_64,OS_S64:
  310. if getsupreg(locreg.register)<first_int_imreg then
  311. result:='??:'+std_regname(locreg.registerhi)
  312. +':??:'+std_regname(locreg.register)
  313. else
  314. result:=std_regname(cg.GetNextReg(locreg.registerhi))+':'+std_regname(locreg.registerhi)
  315. +':'+std_regname(cg.GetNextReg(locreg.register))+':'+std_regname(locreg.register);
  316. OS_32,OS_S32:
  317. if getsupreg(locreg.register)<first_int_imreg then
  318. result:='??:'+std_regname(locreg.register)
  319. else
  320. result:=std_regname(cg.GetNextReg(locreg.register))
  321. +':'+std_regname(locreg.register);
  322. {$elseif defined(cpu8bitalu)}
  323. OS_64,OS_S64:
  324. if getsupreg(locreg.register)<first_int_imreg then
  325. result:='??:??:??:'+std_regname(locreg.registerhi)
  326. +':??:??:??:'+std_regname(locreg.register)
  327. else
  328. result:=std_regname(cg.GetNextReg(cg.GetNextReg(cg.GetNextReg(locreg.registerhi))))
  329. +':'+std_regname(cg.GetNextReg(cg.GetNextReg(locreg.registerhi)))
  330. +':'+std_regname(cg.GetNextReg(locreg.registerhi))
  331. +':'+std_regname(locreg.registerhi)
  332. +':'+std_regname(cg.GetNextReg(cg.GetNextReg(cg.GetNextReg(locreg.register))))
  333. +':'+std_regname(cg.GetNextReg(cg.GetNextReg(locreg.register)))
  334. +':'+std_regname(cg.GetNextReg(locreg.register))
  335. +':'+std_regname(locreg.register);
  336. OS_32,OS_S32:
  337. if getsupreg(locreg.register)<first_int_imreg then
  338. result:='??:??:??:'+std_regname(locreg.register)
  339. else
  340. result:=std_regname(cg.GetNextReg(cg.GetNextReg(cg.GetNextReg(locreg.register))))
  341. +':'+std_regname(cg.GetNextReg(cg.GetNextReg(locreg.register)))
  342. +':'+std_regname(cg.GetNextReg(locreg.register))+':'+std_regname(locreg.register);
  343. OS_16,OS_S16:
  344. if getsupreg(locreg.register)<first_int_imreg then
  345. result:='??:'+std_regname(locreg.register)
  346. else
  347. result:=std_regname(cg.GetNextReg(locreg.register))+':'+std_regname(locreg.register);
  348. {$endif}
  349. else
  350. result:=std_regname(locreg.register);
  351. end;
  352. end
  353. else
  354. begin
  355. if locreg.registerhi<>NR_NO then
  356. result:=std_regname(locreg.registerhi)+':'+std_regname(locreg.register)
  357. else
  358. result:=std_regname(locreg.register);
  359. end;
  360. end;
  361. {$push}
  362. {$r-,q-}
  363. procedure calc_divconst_magic_signed(N: byte; d: aInt; out magic_m: aInt; out magic_s: byte);
  364. var
  365. p: aInt;
  366. ad,anc,delta,q1,r1,q2,r2,t: aWord;
  367. two_N_minus_1: aWord;
  368. begin
  369. assert((d<-1) or (d>1));
  370. two_N_minus_1:=aWord(1) shl (N-1);
  371. ad:=abs(d);
  372. t:=two_N_minus_1+(aWord(d) shr (N-1));
  373. anc:=t-1-t mod ad; { absolute value of nc }
  374. p:=(N-1); { initialize p }
  375. q1:=two_N_minus_1 div anc; { initialize q1 = 2**p/abs(nc) }
  376. r1:=two_N_minus_1-q1*anc; { initialize r1 = rem(2**p,abs(nc)) }
  377. q2:=two_N_minus_1 div ad; { initialize q2 = 2**p/abs(d) }
  378. r2:=two_N_minus_1-q2*ad; { initialize r2 = rem(2**p,abs(d)) }
  379. repeat
  380. inc(p);
  381. q1:=2*q1; { update q1 = 2**p/abs(nc) }
  382. r1:=2*r1; { update r1 = rem(2**p/abs(nc)) }
  383. if (r1>=anc) then { must be unsigned comparison }
  384. begin
  385. inc(q1);
  386. dec(r1,anc);
  387. end;
  388. q2:=2*q2; { update q2 = 2p/abs(d) }
  389. r2:=2*r2; { update r2 = rem(2p/abs(d)) }
  390. if (r2>=ad) then { must be unsigned comparison }
  391. begin
  392. inc(q2);
  393. dec(r2,ad);
  394. end;
  395. delta:=ad-r2;
  396. until not ((q1<delta) or ((q1=delta) and (r1=0)));
  397. magic_m:=q2+1;
  398. if (d<0) then
  399. magic_m:=-magic_m; { resulting magic number }
  400. magic_s:=p-N; { resulting shift }
  401. end;
  402. procedure calc_divconst_magic_unsigned(N: byte; d: aWord; out magic_m: aWord; out magic_add: boolean; out magic_shift: byte);
  403. var
  404. p: aInt;
  405. nc,delta,q1,r1,q2,r2,two_N_minus_1 : aWord;
  406. mask: aWord;
  407. begin
  408. two_N_minus_1:=aWord(1) shl (N-1);
  409. magic_add:=false;
  410. {$push}
  411. {$warnings off }
  412. mask:=aWord(not 0) shr ((64-N) and (sizeof(aWord)*8-1));
  413. nc:=(mask-(-d) mod aInt(d));
  414. {$pop}
  415. p:=N-1; { initialize p }
  416. q1:=two_N_minus_1 div nc; { initialize q1 = 2**p/nc }
  417. r1:=two_N_minus_1-q1*nc; { initialize r1 = rem(2**p,nc) }
  418. q2:=(two_N_minus_1-1) div d; { initialize q2 = (2**p-1)/d }
  419. r2:=(two_N_minus_1-1)-q2*d; { initialize r2 = rem((2**p-1),d) }
  420. repeat
  421. inc(p);
  422. if (r1>=(nc-r1)) then
  423. begin
  424. q1:=2*q1+1; { update q1 }
  425. r1:=2*r1-nc; { update r1 }
  426. end
  427. else
  428. begin
  429. q1:=2*q1; { update q1 }
  430. r1:=2*r1; { update r1 }
  431. end;
  432. if ((r2+1)>=(d-r2)) then
  433. begin
  434. if (q2>=(two_N_minus_1-1)) then
  435. magic_add:=true;
  436. q2:=2*q2+1; { update q2 }
  437. r2:=2*r2+1-d; { update r2 }
  438. end
  439. else
  440. begin
  441. if (q2>=two_N_minus_1) then
  442. magic_add:=true;
  443. q2:=2*q2; { update q2 }
  444. r2:=2*r2+1; { update r2 }
  445. end;
  446. delta:=d-1-r2;
  447. until not ((p<(2*N)) and ((q1<delta) or ((q1=delta) and (r1=0))));
  448. magic_m:=(q2+1) and mask; { resulting magic number }
  449. magic_shift:=p-N; { resulting shift }
  450. end;
  451. {$pop}
  452. end.