cgutils.pas 17 KB

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