cgutils.pas 16 KB

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