2
0

cgutils.pas 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467
  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. LOC_JUMP : (
  142. truelabel, falselabel: tasmlabel;
  143. );
  144. end;
  145. { trerefence handling }
  146. {# Clear to zero a treference }
  147. procedure reference_reset(var ref : treference; alignment: longint);
  148. {# Clear to zero a treference, and set is base address
  149. to base register.
  150. }
  151. procedure reference_reset_base(var ref : treference;base : tregister;offset, alignment : longint);
  152. procedure reference_reset_symbol(var ref : treference;sym : tasmsymbol;offset, alignment : longint);
  153. { This routine verifies if two references are the same, and
  154. if so, returns TRUE, otherwise returns false.
  155. }
  156. function references_equal(const sref,dref : treference) : boolean;
  157. { tlocation handling }
  158. { cannot be used for loc_(c)reference, because that one requires an alignment }
  159. procedure location_reset(var l : tlocation;lt:TCGNonRefLoc;lsize:TCGSize);
  160. { for loc_(c)reference }
  161. procedure location_reset_ref(var l : tlocation;lt:TCGRefLoc;lsize:TCGSize; alignment: longint);
  162. { for loc_jump }
  163. procedure location_reset_jump(out l: tlocation; truelab, falselab: tasmlabel);
  164. procedure location_copy(var destloc:tlocation; const sourceloc : tlocation);
  165. procedure location_swap(var destloc,sourceloc : tlocation);
  166. function location_reg2string(const locreg: tlocation): string;
  167. { returns r with the given alignment }
  168. function setalignment(const r : treference;b : byte) : treference;
  169. { Helper function which calculate "magic" values for replacement of division
  170. by constant operation by multiplication. See the "PowerPC compiler developer
  171. manual" for more information.
  172. N is number of bits to handle, functionality tested for values 32 and 64. }
  173. procedure calc_divconst_magic_signed(N: byte; d: aInt; out magic_m: aInt; out magic_s: byte);
  174. procedure calc_divconst_magic_unsigned(N: byte; d: aWord; out magic_m: aWord; out magic_add: boolean; out magic_shift: byte);
  175. implementation
  176. uses
  177. systems,
  178. verbose;
  179. {****************************************************************************
  180. TReference
  181. ****************************************************************************}
  182. procedure reference_reset(var ref : treference; alignment: longint);
  183. begin
  184. FillChar(ref,sizeof(treference),0);
  185. {$ifdef arm}
  186. ref.signindex:=1;
  187. {$endif arm}
  188. ref.alignment:=alignment;
  189. end;
  190. procedure reference_reset_base(var ref : treference;base : tregister;offset, alignment : longint);
  191. begin
  192. reference_reset(ref,alignment);
  193. ref.base:=base;
  194. ref.offset:=offset;
  195. end;
  196. procedure reference_reset_symbol(var ref : treference;sym : tasmsymbol;offset, alignment : longint);
  197. begin
  198. reference_reset(ref,alignment);
  199. ref.symbol:=sym;
  200. ref.offset:=offset;
  201. end;
  202. function references_equal(const sref,dref : treference):boolean;
  203. begin
  204. references_equal:=CompareByte(sref,dref,sizeof(treference))=0;
  205. end;
  206. { returns r with the given alignment }
  207. function setalignment(const r : treference;b : byte) : treference;
  208. begin
  209. result:=r;
  210. result.alignment:=b;
  211. end;
  212. {****************************************************************************
  213. TLocation
  214. ****************************************************************************}
  215. procedure location_reset(var l : tlocation;lt:TCGNonRefLoc;lsize:TCGSize);
  216. begin
  217. FillChar(l,sizeof(tlocation),0);
  218. l.loc:=lt;
  219. l.size:=lsize;
  220. if l.loc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_JUMP] then
  221. { call location_reset_ref/jump instead }
  222. internalerror(2009020705);
  223. end;
  224. procedure location_reset_ref(var l: tlocation; lt: tcgrefloc; lsize: tcgsize;
  225. alignment: longint);
  226. begin
  227. FillChar(l,sizeof(tlocation),0);
  228. l.loc:=lt;
  229. l.size:=lsize;
  230. {$ifdef arm}
  231. l.reference.signindex:=1;
  232. {$endif arm}
  233. l.reference.alignment:=alignment;
  234. end;
  235. procedure location_reset_jump(out l: tlocation; truelab, falselab: tasmlabel);
  236. begin
  237. FillChar(l,sizeof(tlocation),0);
  238. l.loc:=LOC_JUMP;
  239. l.size:=OS_NO;
  240. l.truelabel:=truelab;
  241. l.falselabel:=falselab;
  242. end;
  243. procedure location_copy(var destloc:tlocation; const sourceloc : tlocation);
  244. begin
  245. destloc:=sourceloc;
  246. end;
  247. procedure location_swap(var destloc,sourceloc : tlocation);
  248. var
  249. swapl : tlocation;
  250. begin
  251. swapl := destloc;
  252. destloc := sourceloc;
  253. sourceloc := swapl;
  254. end;
  255. function location_reg2string(const locreg: tlocation): string;
  256. begin
  257. if not (locreg.loc in [LOC_REGISTER,LOC_CREGISTER,
  258. LOC_MMXREGISTER,LOC_CMMXREGISTER,
  259. LOC_MMREGISTER,LOC_CMMREGISTER,
  260. LOC_FPUREGISTER,LOC_CFPUREGISTER]) then
  261. internalerror(2013122301);
  262. if locreg.loc in [LOC_REGISTER,LOC_CREGISTER] then
  263. begin
  264. case locreg.size of
  265. {$if defined(cpu64bitalu)}
  266. OS_128,OS_S128:
  267. result:=std_regname(locreg.registerhi)+':'+std_regname(locreg.register);
  268. {$elseif defined(cpu32bitalu)}
  269. OS_64,OS_S64:
  270. result:=std_regname(locreg.registerhi)+':'+std_regname(locreg.register);
  271. {$elseif defined(cpu16bitalu)}
  272. OS_64,OS_S64:
  273. if getsupreg(locreg.register)<first_int_imreg then
  274. result:='??:'+std_regname(locreg.registerhi)
  275. +':??:'+std_regname(locreg.register)
  276. else
  277. result:=std_regname(GetNextReg(locreg.registerhi))+':'+std_regname(locreg.registerhi)
  278. +':'+std_regname(GetNextReg(locreg.register))+':'+std_regname(locreg.register);
  279. OS_32,OS_S32:
  280. if getsupreg(locreg.register)<first_int_imreg then
  281. result:='??:'+std_regname(locreg.register)
  282. else
  283. result:=std_regname(GetNextReg(locreg.register))
  284. +':'+std_regname(locreg.register);
  285. {$elseif defined(cpu8bitalu)}
  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(GetNextReg(GetNextReg(GetNextReg(locreg.registerhi))))
  292. +':'+std_regname(GetNextReg(GetNextReg(locreg.registerhi)))
  293. +':'+std_regname(GetNextReg(locreg.registerhi))
  294. +':'+std_regname(locreg.registerhi)
  295. +':'+std_regname(GetNextReg(GetNextReg(GetNextReg(locreg.register))))
  296. +':'+std_regname(GetNextReg(GetNextReg(locreg.register)))
  297. +':'+std_regname(GetNextReg(locreg.register))
  298. +':'+std_regname(locreg.register);
  299. OS_32,OS_S32:
  300. if getsupreg(locreg.register)<first_int_imreg then
  301. result:='??:??:??:'+std_regname(locreg.register)
  302. else
  303. result:=std_regname(GetNextReg(GetNextReg(GetNextReg(locreg.register))))
  304. +':'+std_regname(GetNextReg(GetNextReg(locreg.register)))
  305. +':'+std_regname(GetNextReg(locreg.register))+':'+std_regname(locreg.register);
  306. OS_16,OS_S16:
  307. if getsupreg(locreg.register)<first_int_imreg then
  308. result:='??:'+std_regname(locreg.register)
  309. else
  310. result:=std_regname(GetNextReg(locreg.register))+':'+std_regname(locreg.register);
  311. {$endif}
  312. else
  313. result:=std_regname(locreg.register);
  314. end;
  315. end
  316. else
  317. begin
  318. if locreg.registerhi<>NR_NO then
  319. result:=std_regname(locreg.registerhi)+':'+std_regname(locreg.register)
  320. else
  321. result:=std_regname(locreg.register);
  322. end;
  323. end;
  324. {$push}
  325. {$r-,q-}
  326. procedure calc_divconst_magic_signed(N: byte; d: aInt; out magic_m: aInt; out magic_s: byte);
  327. var
  328. p: aInt;
  329. ad,anc,delta,q1,r1,q2,r2,t: aWord;
  330. two_N_minus_1: aWord;
  331. begin
  332. assert((d<-1) or (d>1));
  333. two_N_minus_1:=aWord(1) shl (N-1);
  334. ad:=abs(d);
  335. t:=two_N_minus_1+(aWord(d) shr (N-1));
  336. anc:=t-1-t mod ad; { absolute value of nc }
  337. p:=(N-1); { initialize p }
  338. q1:=two_N_minus_1 div anc; { initialize q1 = 2**p/abs(nc) }
  339. r1:=two_N_minus_1-q1*anc; { initialize r1 = rem(2**p,abs(nc)) }
  340. q2:=two_N_minus_1 div ad; { initialize q2 = 2**p/abs(d) }
  341. r2:=two_N_minus_1-q2*ad; { initialize r2 = rem(2**p,abs(d)) }
  342. repeat
  343. inc(p);
  344. q1:=2*q1; { update q1 = 2**p/abs(nc) }
  345. r1:=2*r1; { update r1 = rem(2**p/abs(nc)) }
  346. if (r1>=anc) then { must be unsigned comparison }
  347. begin
  348. inc(q1);
  349. dec(r1,anc);
  350. end;
  351. q2:=2*q2; { update q2 = 2p/abs(d) }
  352. r2:=2*r2; { update r2 = rem(2p/abs(d)) }
  353. if (r2>=ad) then { must be unsigned comparison }
  354. begin
  355. inc(q2);
  356. dec(r2,ad);
  357. end;
  358. delta:=ad-r2;
  359. until not ((q1<delta) or ((q1=delta) and (r1=0)));
  360. magic_m:=q2+1;
  361. if (d<0) then
  362. magic_m:=-magic_m; { resulting magic number }
  363. magic_s:=p-N; { resulting shift }
  364. end;
  365. procedure calc_divconst_magic_unsigned(N: byte; d: aWord; out magic_m: aWord; out magic_add: boolean; out magic_shift: byte);
  366. var
  367. p: aInt;
  368. nc,delta,q1,r1,q2,r2,two_N_minus_1 : aWord;
  369. mask: aWord;
  370. begin
  371. two_N_minus_1:=aWord(1) shl (N-1);
  372. magic_add:=false;
  373. {$push}
  374. {$warnings off }
  375. mask:=aWord(not 0) shr ((64-N) and (sizeof(aWord)*8-1));
  376. nc:=(mask-(-d) mod aInt(d));
  377. {$pop}
  378. p:=N-1; { initialize p }
  379. q1:=two_N_minus_1 div nc; { initialize q1 = 2**p/nc }
  380. r1:=two_N_minus_1-q1*nc; { initialize r1 = rem(2**p,nc) }
  381. q2:=(two_N_minus_1-1) div d; { initialize q2 = (2**p-1)/d }
  382. r2:=(two_N_minus_1-1)-q2*d; { initialize r2 = rem((2**p-1),d) }
  383. repeat
  384. inc(p);
  385. if (r1>=(nc-r1)) then
  386. begin
  387. q1:=2*q1+1; { update q1 }
  388. r1:=2*r1-nc; { update r1 }
  389. end
  390. else
  391. begin
  392. q1:=2*q1; { update q1 }
  393. r1:=2*r1; { update r1 }
  394. end;
  395. if ((r2+1)>=(d-r2)) then
  396. begin
  397. if (q2>=(two_N_minus_1-1)) then
  398. magic_add:=true;
  399. q2:=2*q2+1; { update q2 }
  400. r2:=2*r2+1-d; { update r2 }
  401. end
  402. else
  403. begin
  404. if (q2>=two_N_minus_1) then
  405. magic_add:=true;
  406. q2:=2*q2; { update q2 }
  407. r2:=2*r2+1; { update r2 }
  408. end;
  409. delta:=d-1-r2;
  410. until not ((p<(2*N)) and ((q1<delta) or ((q1=delta) and (r1=0))));
  411. magic_m:=(q2+1) and mask; { resulting magic number }
  412. magic_shift:=p-N; { resulting shift }
  413. end;
  414. {$pop}
  415. end.