cgutils.pas 17 KB

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