aoptcpu.pas 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376
  1. {
  2. Copyright (c) 1998-2002 by Florian Klaempfl and Jonas Maebe
  3. This unit contains the peephole optimizer for i386
  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. unit aoptcpu;
  18. {$i fpcdefs.inc}
  19. { $define DEBUG_AOPTCPU}
  20. Interface
  21. uses
  22. cgbase,
  23. cpubase, aopt, aoptx86,
  24. Aasmbase,aasmtai,aasmdata;
  25. Type
  26. TCpuAsmOptimizer = class(TX86AsmOptimizer)
  27. function PrePeepHoleOptsCpu(var p: tai): boolean; override;
  28. function PeepHoleOptPass1Cpu(var p: tai): boolean; override;
  29. function PeepHoleOptPass2Cpu(var p: tai): boolean; override;
  30. function PostPeepHoleOptsCpu(var p : tai) : boolean; override;
  31. end;
  32. Var
  33. AsmOptimizer : TCpuAsmOptimizer;
  34. Implementation
  35. uses
  36. verbose,globtype,globals,
  37. cpuinfo,
  38. aasmcpu,
  39. aoptutils,
  40. aasmcfi,
  41. procinfo,
  42. cgutils,
  43. { units we should get rid off: }
  44. symsym,symconst;
  45. { Checks if the register is a 32 bit general purpose register }
  46. function isgp32reg(reg: TRegister): boolean;
  47. begin
  48. {$push}{$warnings off}
  49. isgp32reg:=(getregtype(reg)=R_INTREGISTER) and (getsupreg(reg)>=RS_EAX) and (getsupreg(reg)<=RS_EBX);
  50. {$pop}
  51. end;
  52. { returns true if p contains a memory operand with a segment set }
  53. function InsContainsSegRef(p: taicpu): boolean;
  54. var
  55. i: longint;
  56. begin
  57. result:=true;
  58. for i:=0 to p.opercnt-1 do
  59. if (p.oper[i]^.typ=top_ref) and
  60. (p.oper[i]^.ref^.segment<>NR_NO) then
  61. exit;
  62. result:=false;
  63. end;
  64. function TCPUAsmOPtimizer.PrePeepHoleOptsCpu(var p: tai): boolean;
  65. begin
  66. repeat
  67. Result:=False;
  68. case p.typ of
  69. ait_instruction:
  70. begin
  71. if InsContainsSegRef(taicpu(p)) then
  72. begin
  73. p := tai(p.next);
  74. { Nothing's actually changed, so no need to set Result to True,
  75. but try again to see if an instruction immediately follows }
  76. Continue;
  77. end;
  78. case taicpu(p).opcode Of
  79. A_IMUL:
  80. Result:=PrePeepholeOptIMUL(p);
  81. A_SAR,A_SHR:
  82. Result:=PrePeepholeOptSxx(p);
  83. A_XOR:
  84. begin
  85. if (taicpu(p).oper[0]^.typ = top_reg) and
  86. (taicpu(p).oper[1]^.typ = top_reg) and
  87. (taicpu(p).oper[0]^.reg = taicpu(p).oper[1]^.reg) then
  88. { temporarily change this to 'mov reg,0' to make it easier }
  89. { for the CSE. Will be changed back in pass 2 }
  90. begin
  91. taicpu(p).opcode := A_MOV;
  92. taicpu(p).loadConst(0,0);
  93. Result:=true;
  94. end;
  95. end;
  96. else
  97. { Do nothing };
  98. end;
  99. end;
  100. else
  101. { Do nothing };
  102. end;
  103. Break;
  104. until False;
  105. end;
  106. function TCPUAsmOPtimizer.PeepHoleOptPass1Cpu(var p: tai): boolean;
  107. var
  108. hp1 : tai;
  109. begin
  110. result:=False;
  111. case p.Typ Of
  112. ait_instruction:
  113. begin
  114. current_filepos:=taicpu(p).fileinfo;
  115. if InsContainsSegRef(taicpu(p)) then
  116. exit;
  117. case taicpu(p).opcode Of
  118. A_ADD:
  119. Result:=OptPass1ADD(p);
  120. A_AND:
  121. Result:=OptPass1And(p);
  122. A_IMUL:
  123. Result:=OptPass1Imul(p);
  124. A_CMP:
  125. Result:=OptPass1Cmp(p);
  126. A_VPXORD,
  127. A_VPXORQ,
  128. A_VXORPS,
  129. A_VXORPD,
  130. A_VPXOR:
  131. Result:=OptPass1VPXor(p);
  132. A_XORPS,
  133. A_XORPD,
  134. A_PXOR:
  135. Result:=OptPass1PXor(p);
  136. A_FLD:
  137. Result:=OptPass1FLD(p);
  138. A_FSTP,A_FISTP:
  139. Result:=OptPass1FSTP(p);
  140. A_LEA:
  141. Result:=OptPass1LEA(p);
  142. A_MOV:
  143. Result:=OptPass1MOV(p);
  144. A_MOVSX,
  145. A_MOVZX :
  146. Result:=OptPass1Movx(p);
  147. A_TEST:
  148. Result:=OptPass1Test(p);
  149. A_PUSH:
  150. begin
  151. if (taicpu(p).opsize = S_W) and
  152. (taicpu(p).oper[0]^.typ = Top_Const) and
  153. GetNextInstruction(p, hp1) and
  154. (tai(hp1).typ = ait_instruction) and
  155. (taicpu(hp1).opcode = A_PUSH) and
  156. (taicpu(hp1).oper[0]^.typ = Top_Const) and
  157. (taicpu(hp1).opsize = S_W) then
  158. begin
  159. taicpu(p).changeopsize(S_L);
  160. taicpu(p).loadConst(0,taicpu(p).oper[0]^.val shl 16 + word(taicpu(hp1).oper[0]^.val));
  161. asml.remove(hp1);
  162. hp1.free;
  163. Result:=true;
  164. end;
  165. end;
  166. A_SHL, A_SAL:
  167. Result:=OptPass1SHLSAL(p);
  168. A_SUB:
  169. Result:=OptPass1Sub(p);
  170. A_Jcc:
  171. Result:=OptPass1Jcc(p);
  172. A_MOVAPD,
  173. A_MOVAPS,
  174. A_MOVUPD,
  175. A_MOVUPS,
  176. A_VMOVAPS,
  177. A_VMOVAPD,
  178. A_VMOVUPS,
  179. A_VMOVUPD:
  180. Result:=OptPass1_V_MOVAP(p);
  181. A_VDIVSD,
  182. A_VDIVSS,
  183. A_VSUBSD,
  184. A_VSUBSS,
  185. A_VMULSD,
  186. A_VMULSS,
  187. A_VADDSD,
  188. A_VADDSS,
  189. A_VANDPD,
  190. A_VANDPS,
  191. A_VORPD,
  192. A_VORPS:
  193. Result:=OptPass1VOP(p);
  194. A_MULSD,
  195. A_MULSS,
  196. A_ADDSD,
  197. A_ADDSS:
  198. Result:=OptPass1OP(p);
  199. A_VMOVSD,
  200. A_VMOVSS,
  201. A_MOVSD,
  202. A_MOVSS:
  203. Result:=OptPass1MOVXX(p);
  204. A_SHRX,
  205. A_SHLX:
  206. Result:=OptPass1SHXX(p);
  207. else
  208. ;
  209. end;
  210. end;
  211. else
  212. ;
  213. end;
  214. end;
  215. function TCPUAsmOptimizer.PeepHoleOptPass2Cpu(var p: tai): boolean;
  216. begin
  217. Result:=false;
  218. case p.Typ Of
  219. Ait_Instruction:
  220. begin
  221. if InsContainsSegRef(taicpu(p)) then
  222. exit;
  223. case taicpu(p).opcode Of
  224. A_ADD:
  225. Result:=OptPass2ADD(p);
  226. A_Jcc:
  227. Result:=OptPass2Jcc(p);
  228. A_Lea:
  229. Result:=OptPass2Lea(p);
  230. A_FSTP,A_FISTP:
  231. Result:=OptPass1FSTP(p);
  232. A_IMUL:
  233. Result:=OptPass2Imul(p);
  234. A_JMP:
  235. Result:=OptPass2Jmp(p);
  236. A_MOV:
  237. Result:=OptPass2MOV(p);
  238. A_MOVZX:
  239. Result:=OptPass2Movx(p);
  240. A_SUB:
  241. Result:=OptPass2SUB(p);
  242. A_SETcc:
  243. Result:=OptPass2SETcc(p);
  244. else
  245. ;
  246. end;
  247. end;
  248. else
  249. ;
  250. end;
  251. end;
  252. function TCPUAsmOptimizer.PostPeepHoleOptsCpu(var p : tai) : boolean;
  253. var
  254. hp1: tai;
  255. begin
  256. Result:=false;
  257. case p.Typ Of
  258. Ait_Instruction:
  259. begin
  260. if InsContainsSegRef(taicpu(p)) then
  261. Exit;
  262. case taicpu(p).opcode Of
  263. A_CALL:
  264. Result:=PostPeepHoleOptCall(p);
  265. A_LEA:
  266. Result:=PostPeepholeOptLea(p);
  267. A_CMP:
  268. Result:=PostPeepholeOptCmp(p);
  269. A_MOV:
  270. Result:=PostPeepholeOptMov(p);
  271. A_MOVZX:
  272. { if register vars are on, it's possible there is code like }
  273. { "cmpl $3,%eax; movzbl 8(%ebp),%ebx; je .Lxxx" }
  274. { so we can't safely replace the movzx then with xor/mov, }
  275. { since that would change the flags (JM) }
  276. if PostPeepholeOptMovzx(p) then
  277. Result := True
  278. else if not(cs_opt_regvar in current_settings.optimizerswitches) then
  279. begin
  280. if (taicpu(p).oper[1]^.typ = top_reg) then
  281. if (taicpu(p).oper[0]^.typ = top_reg)
  282. then
  283. case taicpu(p).opsize of
  284. S_BL:
  285. begin
  286. if IsGP32Reg(taicpu(p).oper[1]^.reg) and
  287. not(cs_opt_size in current_settings.optimizerswitches) and
  288. (current_settings.optimizecputype = cpu_Pentium) then
  289. {Change "movzbl %reg1, %reg2" to
  290. "xorl %reg2, %reg2; movb %reg1, %reg2" for Pentium and
  291. PentiumMMX}
  292. begin
  293. hp1 := taicpu.op_reg_reg(A_XOR, S_L,
  294. taicpu(p).oper[1]^.reg, taicpu(p).oper[1]^.reg);
  295. InsertLLItem(p.previous, p, hp1);
  296. taicpu(p).opcode := A_MOV;
  297. taicpu(p).changeopsize(S_B);
  298. setsubreg(taicpu(p).oper[1]^.reg,R_SUBL);
  299. Result := True;
  300. end;
  301. end;
  302. else
  303. ;
  304. end
  305. else if (taicpu(p).oper[0]^.typ = top_ref) and
  306. (taicpu(p).oper[0]^.ref^.base <> taicpu(p).oper[1]^.reg) and
  307. (taicpu(p).oper[0]^.ref^.index <> taicpu(p).oper[1]^.reg) and
  308. not(cs_opt_size in current_settings.optimizerswitches) and
  309. IsGP32Reg(taicpu(p).oper[1]^.reg) and
  310. (current_settings.optimizecputype = cpu_Pentium) and
  311. (taicpu(p).opsize = S_BL) then
  312. {changes "movzbl mem, %reg" to "xorl %reg, %reg; movb mem, %reg8" for
  313. Pentium and PentiumMMX}
  314. begin
  315. hp1 := taicpu.Op_reg_reg(A_XOR, S_L, taicpu(p).oper[1]^.reg,
  316. taicpu(p).oper[1]^.reg);
  317. taicpu(p).opcode := A_MOV;
  318. taicpu(p).changeopsize(S_B);
  319. setsubreg(taicpu(p).oper[1]^.reg,R_SUBL);
  320. InsertLLItem(p.previous, p, hp1);
  321. Result := True;
  322. end;
  323. end;
  324. A_TEST, A_OR:
  325. Result:=PostPeepholeOptTestOr(p);
  326. A_AND:
  327. Result:=PostPeepholeOptAnd(p);
  328. A_MOVSX:
  329. Result:=PostPeepholeOptMOVSX(p);
  330. A_SHR:
  331. Result:=PostPeepholeOptShr(p);
  332. else
  333. ;
  334. end;
  335. { Optimise any reference-type operands (if Result is True, the
  336. instruction will be checked on the next iteration) }
  337. if not Result then
  338. OptimizeRefs(taicpu(p));
  339. end;
  340. else
  341. ;
  342. end;
  343. end;
  344. begin
  345. casmoptimizer:=TCpuAsmOptimizer;
  346. end.