rgx86.pas 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444
  1. {
  2. Copyright (c) 1998-2002 by Florian Klaempfl
  3. This unit implements the x86 specific class for the register
  4. allocator
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16. ****************************************************************************
  17. }
  18. unit rgx86;
  19. {$i fpcdefs.inc}
  20. interface
  21. uses
  22. cclasses,globtype,
  23. cpubase,cpuinfo,cgbase,cgutils,
  24. aasmbase,aasmtai,aasmdata,aasmcpu,
  25. rgobj;
  26. type
  27. trgx86 = class(trgobj)
  28. function get_spill_subreg(r : tregister) : tsubregister;override;
  29. function do_spill_replace(list:TAsmList;instr:taicpu;orgreg:tsuperregister;const spilltemp:treference):boolean;override;
  30. end;
  31. tpushedsavedloc = record
  32. case byte of
  33. 0: (pushed: boolean);
  34. 1: (ofs: longint);
  35. end;
  36. tpushedsavedfpu = array[tsuperregister] of tpushedsavedloc;
  37. trgx86fpu = class
  38. { The "usableregsxxx" contain all registers of type "xxx" that }
  39. { aren't currently allocated to a regvar. The "unusedregsxxx" }
  40. { contain all registers of type "xxx" that aren't currently }
  41. { allocated }
  42. unusedregsfpu,usableregsfpu : Tsuperregisterset;
  43. { these counters contain the number of elements in the }
  44. { unusedregsxxx/usableregsxxx sets }
  45. countunusedregsfpu : byte;
  46. { Contains the registers which are really used by the proc itself.
  47. It doesn't take care of registers used by called procedures
  48. }
  49. used_in_proc : tcpuregisterset;
  50. {reg_pushes_other : regvarother_longintarray;
  51. is_reg_var_other : regvarother_booleanarray;
  52. regvar_loaded_other : regvarother_booleanarray;}
  53. fpuvaroffset : byte;
  54. constructor create;
  55. function getregisterfpu(list: TAsmList) : tregister;
  56. procedure ungetregisterfpu(list: TAsmList; r : tregister);
  57. { pushes and restores registers }
  58. procedure saveusedfpuregisters(list:TAsmList;
  59. var saved:Tpushedsavedfpu;
  60. const s:Tcpuregisterset);
  61. procedure restoreusedfpuregisters(list:TAsmList;
  62. const saved:Tpushedsavedfpu);
  63. { corrects the fpu stack register by ofs }
  64. function correct_fpuregister(r : tregister;ofs : byte) : tregister;
  65. end;
  66. implementation
  67. uses
  68. systems,
  69. verbose;
  70. const
  71. { This value is used in tsaved. If the array value is equal
  72. to this, then this means that this register is not used.}
  73. reg_not_saved = $7fffffff;
  74. {******************************************************************************
  75. Trgcpu
  76. ******************************************************************************}
  77. function trgx86.get_spill_subreg(r : tregister) : tsubregister;
  78. begin
  79. result:=getsubreg(r);
  80. end;
  81. function trgx86.do_spill_replace(list:TAsmList;instr:taicpu;orgreg:tsuperregister;const spilltemp:treference):boolean;
  82. {Decide wether a "replace" spill is possible, i.e. wether we can replace a register
  83. in an instruction by a memory reference. For example, in "mov ireg26d,0", the imaginary
  84. register ireg26d can be replaced by a memory reference.}
  85. var
  86. n,replaceoper : longint;
  87. is_subh: Boolean;
  88. begin
  89. result:=false;
  90. with instr do
  91. begin
  92. replaceoper:=-1;
  93. case ops of
  94. 1 :
  95. begin
  96. if (oper[0]^.typ=top_reg) and
  97. (getregtype(oper[0]^.reg)=regtype) then
  98. begin
  99. if get_alias(getsupreg(oper[0]^.reg))<>orgreg then
  100. internalerror(200410101);
  101. replaceoper:=0;
  102. end;
  103. end;
  104. 2,3 :
  105. begin
  106. { avx instruction?
  107. currently this rule is sufficient but it might be extended }
  108. if (ops=3) and (opcode<>A_SHRD) and (opcode<>A_SHLD) then
  109. begin
  110. { avx instructions allow only the first operand (at&t counting) to be a register operand }
  111. { all operands must be registers ... }
  112. if (oper[0]^.typ=top_reg) and
  113. (oper[1]^.typ=top_reg) and
  114. (oper[2]^.typ=top_reg) and
  115. { but they must be different }
  116. ((getregtype(oper[1]^.reg)<>regtype) or
  117. (get_alias(getsupreg(oper[0]^.reg))<>get_alias(getsupreg(oper[1]^.reg)))
  118. ) and
  119. ((getregtype(oper[2]^.reg)<>regtype) or
  120. (get_alias(getsupreg(oper[0]^.reg))<>get_alias(getsupreg(oper[2]^.reg)))
  121. ) and
  122. (get_alias(getsupreg(oper[0]^.reg))=orgreg) then
  123. replaceoper:=0;
  124. end
  125. else
  126. begin
  127. { We can handle opcodes with 2 and shrd/shld the same way, where the 3rd operand is const or CL,
  128. that doesn't need spilling.
  129. However, due to AT&T order inside the compiler, the 3rd operand is
  130. numbered 0, so look at operand no. 1 and 2 if we have 3 operands by
  131. adding a "n". }
  132. n:=0;
  133. if ops=3 then
  134. n:=1;
  135. if (oper[n+0]^.typ=top_reg) and
  136. (oper[n+1]^.typ=top_reg) and
  137. ((getregtype(oper[n+0]^.reg)<>regtype) or
  138. (getregtype(oper[n+1]^.reg)<>regtype) or
  139. (get_alias(getsupreg(oper[n+0]^.reg))<>get_alias(getsupreg(oper[n+1]^.reg)))) then
  140. begin
  141. if (getregtype(oper[n+0]^.reg)=regtype) and
  142. (get_alias(getsupreg(oper[n+0]^.reg))=orgreg) then
  143. replaceoper:=0+n
  144. else if (getregtype(oper[n+1]^.reg)=regtype) and
  145. (get_alias(getsupreg(oper[n+1]^.reg))=orgreg) then
  146. replaceoper:=1+n;
  147. end
  148. else if (oper[n+0]^.typ=top_reg) and
  149. (oper[n+1]^.typ=top_const) then
  150. begin
  151. if (getregtype(oper[0+n]^.reg)=regtype) and
  152. (get_alias(getsupreg(oper[0+n]^.reg))=orgreg) then
  153. replaceoper:=0+n
  154. else
  155. internalerror(200704282);
  156. end
  157. else if (oper[n+0]^.typ=top_const) and
  158. (oper[n+1]^.typ=top_reg) then
  159. begin
  160. if (getregtype(oper[1+n]^.reg)=regtype) and
  161. (get_alias(getsupreg(oper[1+n]^.reg))=orgreg) then
  162. replaceoper:=1+n
  163. else
  164. internalerror(200704283);
  165. end;
  166. case replaceoper of
  167. 0 :
  168. begin
  169. { Some instructions don't allow memory references
  170. for source }
  171. case instr.opcode of
  172. A_BT,
  173. A_BTS,
  174. A_BTC,
  175. A_BTR,
  176. { shufp* would require 16 byte alignment for memory locations so we force the source
  177. operand into a register }
  178. A_SHUFPD,
  179. A_SHUFPS :
  180. replaceoper:=-1;
  181. end;
  182. end;
  183. 1 :
  184. begin
  185. { Some instructions don't allow memory references
  186. for destination }
  187. case instr.opcode of
  188. A_CMOVcc,
  189. A_MOVZX,
  190. A_MOVSX,
  191. A_MOVSXD,
  192. A_MULSS,
  193. A_MULSD,
  194. A_SUBSS,
  195. A_SUBSD,
  196. A_ADDSD,
  197. A_ADDSS,
  198. A_DIVSD,
  199. A_DIVSS,
  200. A_SHLD,
  201. A_SHRD,
  202. A_COMISD,
  203. A_COMISS,
  204. A_CVTDQ2PD,
  205. A_CVTDQ2PS,
  206. A_CVTPD2DQ,
  207. A_CVTPD2PI,
  208. A_CVTPD2PS,
  209. A_CVTPI2PD,
  210. A_CVTPS2DQ,
  211. A_CVTPS2PD,
  212. A_CVTSD2SI,
  213. A_CVTSD2SS,
  214. A_CVTSI2SD,
  215. A_CVTSS2SD,
  216. A_CVTTPD2PI,
  217. A_CVTTPD2DQ,
  218. A_CVTTPS2DQ,
  219. A_CVTTSD2SI,
  220. A_CVTPI2PS,
  221. A_CVTPS2PI,
  222. A_CVTSI2SS,
  223. A_CVTSS2SI,
  224. A_CVTTPS2PI,
  225. A_CVTTSS2SI,
  226. A_IMUL,
  227. A_XORPD,
  228. A_XORPS,
  229. A_ORPD,
  230. A_ORPS,
  231. A_ANDPD,
  232. A_ANDPS,
  233. A_UNPCKLPS,
  234. A_UNPCKHPS,
  235. A_SHUFPD,
  236. A_SHUFPS:
  237. replaceoper:=-1;
  238. {$ifdef x86_64}
  239. A_MOV:
  240. { 64 bit constants can only be moved into registers }
  241. if (oper[0]^.typ=top_const) and
  242. (oper[1]^.typ=top_reg) and
  243. ((oper[0]^.val<low(longint)) or
  244. (oper[0]^.val>high(longint))) then
  245. replaceoper:=-1;
  246. {$endif x86_64}
  247. end;
  248. end;
  249. end;
  250. end;
  251. end;
  252. end;
  253. {$ifdef x86_64}
  254. { 32 bit operations on 32 bit registers on x86_64 can result in
  255. zeroing the upper 32 bits of the register. This does not happen
  256. with memory operations, so we have to perform these calculations
  257. in registers. }
  258. if (instr.opsize=S_L) then
  259. replaceoper:=-1;
  260. {$endif x86_64}
  261. { Replace register with spill reference }
  262. if replaceoper<>-1 then
  263. begin
  264. is_subh:=getsubreg(oper[replaceoper]^.reg)=R_SUBH;
  265. oper[replaceoper]^.typ:=top_ref;
  266. new(oper[replaceoper]^.ref);
  267. oper[replaceoper]^.ref^:=spilltemp;
  268. if is_subh then
  269. inc(oper[replaceoper]^.ref^.offset);
  270. { memory locations aren't guaranteed to be aligned }
  271. case opcode of
  272. A_MOVAPS:
  273. opcode:=A_MOVSS;
  274. A_MOVAPD:
  275. opcode:=A_MOVSD;
  276. A_VMOVAPS:
  277. opcode:=A_VMOVSS;
  278. A_VMOVAPD:
  279. opcode:=A_VMOVSD;
  280. end;
  281. result:=true;
  282. end;
  283. end;
  284. end;
  285. {******************************************************************************
  286. Trgx86fpu
  287. ******************************************************************************}
  288. constructor Trgx86fpu.create;
  289. begin
  290. used_in_proc:=[];
  291. unusedregsfpu:=usableregsfpu;
  292. end;
  293. function trgx86fpu.getregisterfpu(list: TAsmList) : tregister;
  294. begin
  295. { note: don't return R_ST0, see comments above implementation of }
  296. { a_loadfpu_* methods in cgcpu (JM) }
  297. result:=NR_ST;
  298. end;
  299. procedure trgx86fpu.ungetregisterfpu(list : TAsmList; r : tregister);
  300. begin
  301. { nothing to do, fpu stack management is handled by the load/ }
  302. { store operations in cgcpu (JM) }
  303. end;
  304. function trgx86fpu.correct_fpuregister(r : tregister;ofs : byte) : tregister;
  305. begin
  306. correct_fpuregister:=r;
  307. setsupreg(correct_fpuregister,ofs);
  308. end;
  309. procedure trgx86fpu.saveusedfpuregisters(list: TAsmList;
  310. var saved : tpushedsavedfpu;
  311. const s: tcpuregisterset);
  312. { var
  313. r : tregister;
  314. hr : treference; }
  315. begin
  316. used_in_proc:=used_in_proc+s;
  317. { TODO: firstsavefpureg}
  318. (*
  319. { don't try to save the fpu registers if not desired (e.g. for }
  320. { the 80x86) }
  321. if firstsavefpureg <> R_NO then
  322. for r.enum:=firstsavefpureg to lastsavefpureg do
  323. begin
  324. saved[r.enum].ofs:=reg_not_saved;
  325. { if the register is used by the calling subroutine and if }
  326. { it's not a regvar (those are handled separately) }
  327. if not is_reg_var_other[r.enum] and
  328. (r.enum in s) and
  329. { and is present in use }
  330. not(r.enum in unusedregsfpu) then
  331. begin
  332. { then save it }
  333. tg.GetTemp(list,extended_size,tt_persistent,hr);
  334. saved[r.enum].ofs:=hr.offset;
  335. cg.a_loadfpu_reg_ref(list,OS_FLOAT,OS_FLOAT,r,hr);
  336. cg.a_reg_dealloc(list,r);
  337. include(unusedregsfpu,r.enum);
  338. inc(countunusedregsfpu);
  339. end;
  340. end;
  341. *)
  342. end;
  343. procedure trgx86fpu.restoreusedfpuregisters(list : TAsmList;
  344. const saved : tpushedsavedfpu);
  345. {
  346. var
  347. r,r2 : tregister;
  348. hr : treference;
  349. }
  350. begin
  351. { TODO: firstsavefpureg}
  352. (*
  353. if firstsavefpureg <> R_NO then
  354. for r.enum:=lastsavefpureg downto firstsavefpureg do
  355. begin
  356. if saved[r.enum].ofs <> reg_not_saved then
  357. begin
  358. r2.enum:=R_INTREGISTER;
  359. r2.number:=NR_FRAME_POINTER_REG;
  360. reference_reset_base(hr,r2,saved[r.enum].ofs);
  361. cg.a_reg_alloc(list,r);
  362. cg.a_loadfpu_ref_reg(list,OS_FLOAT,OS_FLOAT,hr,r);
  363. if not (r.enum in unusedregsfpu) then
  364. { internalerror(10)
  365. in n386cal we always save/restore the reg *state*
  366. using save/restoreunusedstate -> the current state
  367. may not be real (JM) }
  368. else
  369. begin
  370. dec(countunusedregsfpu);
  371. exclude(unusedregsfpu,r.enum);
  372. end;
  373. tg.UnGetTemp(list,hr);
  374. end;
  375. end;
  376. *)
  377. end;
  378. (*
  379. procedure Trgx86fpu.saveotherregvars(list: TAsmList; const s: totherregisterset);
  380. var
  381. r: Tregister;
  382. begin
  383. if not(cs_opt_regvar in current_settings.optimizerswitches) then
  384. exit;
  385. if firstsavefpureg <> NR_NO then
  386. for r.enum := firstsavefpureg to lastsavefpureg do
  387. if is_reg_var_other[r.enum] and
  388. (r.enum in s) then
  389. store_regvar(list,r);
  390. end;
  391. *)
  392. end.