2
0

cgutils.pas 18 KB

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