cgutils.pas 15 KB

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