cgutils.pas 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503
  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. islocal: boolean; // true (local variable), false (memory offset)
  98. {$endif wasm}
  99. volatility: tvolatilityset;
  100. alignment : byte;
  101. end;
  102. const
  103. ctempposinvalid: treftemppos = (val: low(treftemppos.val));
  104. type
  105. tsubsetregister = record
  106. subsetreg : tregister;
  107. startbit, bitlen: byte;
  108. subsetregsize: tcgsize;
  109. end;
  110. tsubsetreference = record
  111. ref: treference;
  112. bitindexreg: tregister;
  113. startbit, bitlen: byte;
  114. end;
  115. tlocation = record
  116. loc : TCGLoc;
  117. size : TCGSize;
  118. case TCGLoc of
  119. {$ifdef cpuflags}
  120. LOC_FLAGS : (resflags : tresflags);
  121. {$endif cpuflags}
  122. LOC_CONSTANT : (
  123. case longint of
  124. {$if defined(cpu64bitalu) or defined(cpuhighleveltarget)}
  125. 1 : (value : Int64);
  126. {$else cpu64bitalu or cpuhighleveltarget}
  127. {$ifdef FPC_BIG_ENDIAN}
  128. 1 : (_valuedummy,value : longint);
  129. {$else FPC_BIG_ENDIAN}
  130. 1 : (value : longint);
  131. {$endif FPC_BIG_ENDIAN}
  132. {$endif cpu64bitalu or cpuhighleveltarget}
  133. 2 : (value64 : Int64);
  134. );
  135. LOC_CREFERENCE,
  136. LOC_REFERENCE : (reference : treference);
  137. { segment in reference at the same place as in loc_register }
  138. LOC_REGISTER,
  139. LOC_CREGISTER : (
  140. case longint of
  141. 1 : (register : tregister;
  142. { some x86_64 targets require two function result registers }
  143. registerhi : tregister;
  144. {$ifdef m68k}
  145. { some m68k OSes require that the result is returned in d0 and a0
  146. the second location must be stored here }
  147. registeralias : tregister;
  148. {$endif m68k}
  149. );
  150. {$ifdef cpu64bitalu}
  151. { overlay a 128 Bit register type }
  152. 2 : (register128 : tregister128);
  153. {$else if not defined(cpuhighleveltarget}
  154. { overlay a 64 Bit register type }
  155. 2 : (register64 : tregister64);
  156. {$endif cpu64bitalu and not cpuhighleveltarget}
  157. {$ifdef cpu8bitalu}
  158. 3 : (registers : array[0..3] of tregister);
  159. {$endif cpu8bitalu}
  160. );
  161. LOC_SUBSETREG,
  162. LOC_CSUBSETREG : (
  163. sreg: tsubsetregister;
  164. );
  165. LOC_SUBSETREF : (
  166. sref: tsubsetreference;
  167. );
  168. LOC_JUMP : (
  169. truelabel, falselabel: tasmlabel;
  170. );
  171. end;
  172. { trerefence handling }
  173. {# Clear to zero a treference }
  174. procedure reference_reset(var ref : treference; alignment: longint; volatility: tvolatilityset);
  175. {# Clear to zero a treference, and set is base address
  176. to base register.
  177. }
  178. procedure reference_reset_base(var ref : treference;base : tregister;offset : longint; temppos : treftemppos; alignment : longint; volatility: tvolatilityset);
  179. procedure reference_reset_symbol(var ref : treference;sym : tasmsymbol;offset, alignment : longint; volatility: tvolatilityset);
  180. { This routine verifies if two references are the same, and
  181. if so, returns TRUE, otherwise returns false.
  182. }
  183. function references_equal(const sref,dref : treference) : boolean;
  184. { tlocation handling }
  185. { cannot be used for loc_(c)reference, because that one requires an alignment }
  186. procedure location_reset(var l : tlocation;lt:TCGNonRefLoc;lsize:TCGSize);
  187. { for loc_(c)reference }
  188. procedure location_reset_ref(var l : tlocation;lt:TCGRefLoc;lsize:TCGSize; alignment: longint; volatility: tvolatilityset);
  189. { for loc_jump }
  190. procedure location_reset_jump(out l: tlocation; truelab, falselab: tasmlabel);
  191. procedure location_copy(var destloc:tlocation; const sourceloc : tlocation);
  192. procedure location_swap(var destloc,sourceloc : tlocation);
  193. function location_reg2string(const locreg: tlocation): string;
  194. { returns r with the given alignment }
  195. function setalignment(const r : treference;b : byte) : treference;
  196. { Helper function which calculate "magic" values for replacement of division
  197. by constant operation by multiplication. See the "PowerPC compiler developer
  198. manual" for more information.
  199. N is number of bits to handle, functionality tested for values 32 and 64. }
  200. procedure calc_divconst_magic_signed(N: byte; d: aInt; out magic_m: aInt; out magic_s: byte);
  201. procedure calc_divconst_magic_unsigned(N: byte; d: aWord; out magic_m: aWord; out magic_add: boolean; out magic_shift: byte);
  202. implementation
  203. uses
  204. systems,
  205. verbose,
  206. cgobj;
  207. {****************************************************************************
  208. TReference
  209. ****************************************************************************}
  210. procedure reference_reset(var ref: treference; alignment: longint; volatility: tvolatilityset);
  211. begin
  212. FillChar(ref,sizeof(treference),0);
  213. {$ifdef arm}
  214. ref.signindex:=1;
  215. {$endif arm}
  216. ref.alignment:=alignment;
  217. ref.volatility:=volatility;
  218. ref.temppos:=ctempposinvalid;
  219. end;
  220. procedure reference_reset_base(var ref: treference; base: tregister; offset : longint; temppos : treftemppos ; alignment : longint; volatility: tvolatilityset);
  221. begin
  222. reference_reset(ref,alignment,volatility);
  223. ref.base:=base;
  224. ref.offset:=offset;
  225. ref.temppos:=temppos;
  226. end;
  227. procedure reference_reset_symbol(var ref: treference; sym: tasmsymbol; offset, alignment: longint; volatility: tvolatilityset);
  228. begin
  229. reference_reset(ref,alignment,volatility);
  230. ref.symbol:=sym;
  231. ref.offset:=offset;
  232. ref.temppos:=ctempposinvalid;
  233. end;
  234. function references_equal(const sref,dref : treference):boolean;
  235. begin
  236. references_equal:=CompareByte(sref,dref,sizeof(treference))=0;
  237. end;
  238. { returns r with the given alignment }
  239. function setalignment(const r : treference;b : byte) : treference;
  240. begin
  241. result:=r;
  242. result.alignment:=b;
  243. end;
  244. {****************************************************************************
  245. TLocation
  246. ****************************************************************************}
  247. procedure location_reset(var l : tlocation;lt:TCGNonRefLoc;lsize:TCGSize);
  248. begin
  249. FillChar(l,sizeof(tlocation),0);
  250. l.loc:=lt;
  251. l.size:=lsize;
  252. if l.loc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_JUMP] then
  253. { call location_reset_ref/jump instead }
  254. internalerror(2009020705);
  255. end;
  256. procedure location_reset_ref(var l: tlocation; lt: TCGRefLoc; lsize: TCGSize; alignment: longint; volatility: tvolatilityset);
  257. begin
  258. FillChar(l,sizeof(tlocation),0);
  259. l.loc:=lt;
  260. l.size:=lsize;
  261. {$ifdef arm}
  262. l.reference.signindex:=1;
  263. {$endif arm}
  264. l.reference.alignment:=alignment;
  265. l.reference.volatility:=volatility;
  266. l.reference.temppos:=ctempposinvalid;
  267. end;
  268. procedure location_reset_jump(out l: tlocation; truelab, falselab: tasmlabel);
  269. begin
  270. FillChar(l,sizeof(tlocation),0);
  271. l.loc:=LOC_JUMP;
  272. l.size:=OS_NO;
  273. l.truelabel:=truelab;
  274. l.falselabel:=falselab;
  275. end;
  276. procedure location_copy(var destloc:tlocation; const sourceloc : tlocation);
  277. begin
  278. destloc:=sourceloc;
  279. end;
  280. procedure location_swap(var destloc,sourceloc : tlocation);
  281. var
  282. swapl : tlocation;
  283. begin
  284. swapl := destloc;
  285. destloc := sourceloc;
  286. sourceloc := swapl;
  287. end;
  288. function location_reg2string(const locreg: tlocation): string;
  289. begin
  290. if not (locreg.loc in [LOC_REGISTER,LOC_CREGISTER,
  291. LOC_MMXREGISTER,LOC_CMMXREGISTER,
  292. LOC_MMREGISTER,LOC_CMMREGISTER,
  293. LOC_FPUREGISTER,LOC_CFPUREGISTER]) then
  294. internalerror(2013122301);
  295. if locreg.loc in [LOC_REGISTER,LOC_CREGISTER] then
  296. begin
  297. case locreg.size of
  298. {$if defined(cpu64bitalu)}
  299. OS_128,OS_S128:
  300. result:=std_regname(locreg.registerhi)+':'+std_regname(locreg.register);
  301. {$elseif defined(cpu32bitalu)}
  302. OS_64,OS_S64:
  303. result:=std_regname(locreg.registerhi)+':'+std_regname(locreg.register);
  304. {$elseif defined(cpu16bitalu)}
  305. OS_64,OS_S64:
  306. if getsupreg(locreg.register)<first_int_imreg then
  307. result:='??:'+std_regname(locreg.registerhi)
  308. +':??:'+std_regname(locreg.register)
  309. else
  310. result:=std_regname(cg.GetNextReg(locreg.registerhi))+':'+std_regname(locreg.registerhi)
  311. +':'+std_regname(cg.GetNextReg(locreg.register))+':'+std_regname(locreg.register);
  312. OS_32,OS_S32:
  313. if getsupreg(locreg.register)<first_int_imreg then
  314. result:='??:'+std_regname(locreg.register)
  315. else
  316. result:=std_regname(cg.GetNextReg(locreg.register))
  317. +':'+std_regname(locreg.register);
  318. {$elseif defined(cpu8bitalu)}
  319. OS_64,OS_S64:
  320. if getsupreg(locreg.register)<first_int_imreg then
  321. result:='??:??:??:'+std_regname(locreg.registerhi)
  322. +':??:??:??:'+std_regname(locreg.register)
  323. else
  324. result:=std_regname(cg.GetNextReg(cg.GetNextReg(cg.GetNextReg(locreg.registerhi))))
  325. +':'+std_regname(cg.GetNextReg(cg.GetNextReg(locreg.registerhi)))
  326. +':'+std_regname(cg.GetNextReg(locreg.registerhi))
  327. +':'+std_regname(locreg.registerhi)
  328. +':'+std_regname(cg.GetNextReg(cg.GetNextReg(cg.GetNextReg(locreg.register))))
  329. +':'+std_regname(cg.GetNextReg(cg.GetNextReg(locreg.register)))
  330. +':'+std_regname(cg.GetNextReg(locreg.register))
  331. +':'+std_regname(locreg.register);
  332. OS_32,OS_S32:
  333. if getsupreg(locreg.register)<first_int_imreg then
  334. result:='??:??:??:'+std_regname(locreg.register)
  335. else
  336. result:=std_regname(cg.GetNextReg(cg.GetNextReg(cg.GetNextReg(locreg.register))))
  337. +':'+std_regname(cg.GetNextReg(cg.GetNextReg(locreg.register)))
  338. +':'+std_regname(cg.GetNextReg(locreg.register))+':'+std_regname(locreg.register);
  339. OS_16,OS_S16:
  340. if getsupreg(locreg.register)<first_int_imreg then
  341. result:='??:'+std_regname(locreg.register)
  342. else
  343. result:=std_regname(cg.GetNextReg(locreg.register))+':'+std_regname(locreg.register);
  344. {$endif}
  345. else
  346. result:=std_regname(locreg.register);
  347. end;
  348. end
  349. else
  350. begin
  351. if locreg.registerhi<>NR_NO then
  352. result:=std_regname(locreg.registerhi)+':'+std_regname(locreg.register)
  353. else
  354. result:=std_regname(locreg.register);
  355. end;
  356. end;
  357. {$push}
  358. {$r-,q-}
  359. procedure calc_divconst_magic_signed(N: byte; d: aInt; out magic_m: aInt; out magic_s: byte);
  360. var
  361. p: aInt;
  362. ad,anc,delta,q1,r1,q2,r2,t: aWord;
  363. two_N_minus_1: aWord;
  364. begin
  365. assert((d<-1) or (d>1));
  366. two_N_minus_1:=aWord(1) shl (N-1);
  367. ad:=abs(d);
  368. t:=two_N_minus_1+(aWord(d) shr (N-1));
  369. anc:=t-1-t mod ad; { absolute value of nc }
  370. p:=(N-1); { initialize p }
  371. q1:=two_N_minus_1 div anc; { initialize q1 = 2**p/abs(nc) }
  372. r1:=two_N_minus_1-q1*anc; { initialize r1 = rem(2**p,abs(nc)) }
  373. q2:=two_N_minus_1 div ad; { initialize q2 = 2**p/abs(d) }
  374. r2:=two_N_minus_1-q2*ad; { initialize r2 = rem(2**p,abs(d)) }
  375. repeat
  376. inc(p);
  377. q1:=2*q1; { update q1 = 2**p/abs(nc) }
  378. r1:=2*r1; { update r1 = rem(2**p/abs(nc)) }
  379. if (r1>=anc) then { must be unsigned comparison }
  380. begin
  381. inc(q1);
  382. dec(r1,anc);
  383. end;
  384. q2:=2*q2; { update q2 = 2p/abs(d) }
  385. r2:=2*r2; { update r2 = rem(2p/abs(d)) }
  386. if (r2>=ad) then { must be unsigned comparison }
  387. begin
  388. inc(q2);
  389. dec(r2,ad);
  390. end;
  391. delta:=ad-r2;
  392. until not ((q1<delta) or ((q1=delta) and (r1=0)));
  393. magic_m:=q2+1;
  394. if (d<0) then
  395. magic_m:=-magic_m; { resulting magic number }
  396. magic_s:=p-N; { resulting shift }
  397. end;
  398. procedure calc_divconst_magic_unsigned(N: byte; d: aWord; out magic_m: aWord; out magic_add: boolean; out magic_shift: byte);
  399. var
  400. p: aInt;
  401. nc,delta,q1,r1,q2,r2,two_N_minus_1 : aWord;
  402. mask: aWord;
  403. begin
  404. two_N_minus_1:=aWord(1) shl (N-1);
  405. magic_add:=false;
  406. {$push}
  407. {$warnings off }
  408. mask:=aWord(not 0) shr ((64-N) and (sizeof(aWord)*8-1));
  409. nc:=(mask-(-d) mod aInt(d));
  410. {$pop}
  411. p:=N-1; { initialize p }
  412. q1:=two_N_minus_1 div nc; { initialize q1 = 2**p/nc }
  413. r1:=two_N_minus_1-q1*nc; { initialize r1 = rem(2**p,nc) }
  414. q2:=(two_N_minus_1-1) div d; { initialize q2 = (2**p-1)/d }
  415. r2:=(two_N_minus_1-1)-q2*d; { initialize r2 = rem((2**p-1),d) }
  416. repeat
  417. inc(p);
  418. if (r1>=(nc-r1)) then
  419. begin
  420. q1:=2*q1+1; { update q1 }
  421. r1:=2*r1-nc; { update r1 }
  422. end
  423. else
  424. begin
  425. q1:=2*q1; { update q1 }
  426. r1:=2*r1; { update r1 }
  427. end;
  428. if ((r2+1)>=(d-r2)) then
  429. begin
  430. if (q2>=(two_N_minus_1-1)) then
  431. magic_add:=true;
  432. q2:=2*q2+1; { update q2 }
  433. r2:=2*r2+1-d; { update r2 }
  434. end
  435. else
  436. begin
  437. if (q2>=two_N_minus_1) then
  438. magic_add:=true;
  439. q2:=2*q2; { update q2 }
  440. r2:=2*r2+1; { update r2 }
  441. end;
  442. delta:=d-1-r2;
  443. until not ((p<(2*N)) and ((q1<delta) or ((q1=delta) and (r1=0))));
  444. magic_m:=(q2+1) and mask; { resulting magic number }
  445. magic_shift:=p-N; { resulting shift }
  446. end;
  447. {$pop}
  448. end.