aoptcpu.pas 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378
  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_AND:
  84. Result:=PrePeepholeOptAND(p);
  85. A_XOR:
  86. begin
  87. if (taicpu(p).oper[0]^.typ = top_reg) and
  88. (taicpu(p).oper[1]^.typ = top_reg) and
  89. (taicpu(p).oper[0]^.reg = taicpu(p).oper[1]^.reg) then
  90. { temporarily change this to 'mov reg,0' to make it easier }
  91. { for the CSE. Will be changed back in pass 2 }
  92. begin
  93. taicpu(p).opcode := A_MOV;
  94. taicpu(p).loadConst(0,0);
  95. Result:=true;
  96. end;
  97. end;
  98. else
  99. { Do nothing };
  100. end;
  101. end;
  102. else
  103. { Do nothing };
  104. end;
  105. Break;
  106. until False;
  107. end;
  108. function TCPUAsmOPtimizer.PeepHoleOptPass1Cpu(var p: tai): boolean;
  109. var
  110. hp1 : tai;
  111. begin
  112. result:=False;
  113. case p.Typ Of
  114. ait_instruction:
  115. begin
  116. current_filepos:=taicpu(p).fileinfo;
  117. if InsContainsSegRef(taicpu(p)) then
  118. exit;
  119. case taicpu(p).opcode Of
  120. A_ADD:
  121. Result:=OptPass1ADD(p);
  122. A_AND:
  123. Result:=OptPass1And(p);
  124. A_IMUL:
  125. Result:=OptPass1Imul(p);
  126. A_CMP:
  127. Result:=OptPass1Cmp(p);
  128. A_VPXORD,
  129. A_VPXORQ,
  130. A_VXORPS,
  131. A_VXORPD,
  132. A_VPXOR:
  133. Result:=OptPass1VPXor(p);
  134. A_XORPS,
  135. A_XORPD,
  136. A_PXOR:
  137. Result:=OptPass1PXor(p);
  138. A_FLD:
  139. Result:=OptPass1FLD(p);
  140. A_FSTP,A_FISTP:
  141. Result:=OptPass1FSTP(p);
  142. A_LEA:
  143. Result:=OptPass1LEA(p);
  144. A_MOV:
  145. Result:=OptPass1MOV(p);
  146. A_MOVSX,
  147. A_MOVZX :
  148. Result:=OptPass1Movx(p);
  149. A_TEST:
  150. Result:=OptPass1Test(p);
  151. A_PUSH:
  152. begin
  153. if (taicpu(p).opsize = S_W) and
  154. (taicpu(p).oper[0]^.typ = Top_Const) and
  155. GetNextInstruction(p, hp1) and
  156. (tai(hp1).typ = ait_instruction) and
  157. (taicpu(hp1).opcode = A_PUSH) and
  158. (taicpu(hp1).oper[0]^.typ = Top_Const) and
  159. (taicpu(hp1).opsize = S_W) then
  160. begin
  161. taicpu(p).changeopsize(S_L);
  162. taicpu(p).loadConst(0,taicpu(p).oper[0]^.val shl 16 + word(taicpu(hp1).oper[0]^.val));
  163. asml.remove(hp1);
  164. hp1.free;
  165. Result:=true;
  166. end;
  167. end;
  168. A_SHL, A_SAL:
  169. Result:=OptPass1SHLSAL(p);
  170. A_SUB:
  171. Result:=OptPass1Sub(p);
  172. A_Jcc:
  173. Result:=OptPass1Jcc(p);
  174. A_MOVAPD,
  175. A_MOVAPS,
  176. A_MOVUPD,
  177. A_MOVUPS,
  178. A_VMOVAPS,
  179. A_VMOVAPD,
  180. A_VMOVUPS,
  181. A_VMOVUPD:
  182. Result:=OptPass1_V_MOVAP(p);
  183. A_VDIVSD,
  184. A_VDIVSS,
  185. A_VSUBSD,
  186. A_VSUBSS,
  187. A_VMULSD,
  188. A_VMULSS,
  189. A_VADDSD,
  190. A_VADDSS,
  191. A_VANDPD,
  192. A_VANDPS,
  193. A_VORPD,
  194. A_VORPS:
  195. Result:=OptPass1VOP(p);
  196. A_MULSD,
  197. A_MULSS,
  198. A_ADDSD,
  199. A_ADDSS:
  200. Result:=OptPass1OP(p);
  201. A_VMOVSD,
  202. A_VMOVSS,
  203. A_MOVSD,
  204. A_MOVSS:
  205. Result:=OptPass1MOVXX(p);
  206. A_SHRX,
  207. A_SHLX:
  208. Result:=OptPass1SHXX(p);
  209. else
  210. ;
  211. end;
  212. end;
  213. else
  214. ;
  215. end;
  216. end;
  217. function TCPUAsmOptimizer.PeepHoleOptPass2Cpu(var p: tai): boolean;
  218. begin
  219. Result:=false;
  220. case p.Typ Of
  221. Ait_Instruction:
  222. begin
  223. if InsContainsSegRef(taicpu(p)) then
  224. exit;
  225. case taicpu(p).opcode Of
  226. A_ADD:
  227. Result:=OptPass2ADD(p);
  228. A_Jcc:
  229. Result:=OptPass2Jcc(p);
  230. A_Lea:
  231. Result:=OptPass2Lea(p);
  232. A_FSTP,A_FISTP:
  233. Result:=OptPass1FSTP(p);
  234. A_IMUL:
  235. Result:=OptPass2Imul(p);
  236. A_JMP:
  237. Result:=OptPass2Jmp(p);
  238. A_MOV:
  239. Result:=OptPass2MOV(p);
  240. A_MOVZX:
  241. Result:=OptPass2Movx(p);
  242. A_SUB:
  243. Result:=OptPass2SUB(p);
  244. A_SETcc:
  245. Result:=OptPass2SETcc(p);
  246. else
  247. ;
  248. end;
  249. end;
  250. else
  251. ;
  252. end;
  253. end;
  254. function TCPUAsmOptimizer.PostPeepHoleOptsCpu(var p : tai) : boolean;
  255. var
  256. hp1: tai;
  257. begin
  258. Result:=false;
  259. case p.Typ Of
  260. Ait_Instruction:
  261. begin
  262. if InsContainsSegRef(taicpu(p)) then
  263. Exit;
  264. case taicpu(p).opcode Of
  265. A_CALL:
  266. Result:=PostPeepHoleOptCall(p);
  267. A_LEA:
  268. Result:=PostPeepholeOptLea(p);
  269. A_CMP:
  270. Result:=PostPeepholeOptCmp(p);
  271. A_MOV:
  272. Result:=PostPeepholeOptMov(p);
  273. A_MOVZX:
  274. { if register vars are on, it's possible there is code like }
  275. { "cmpl $3,%eax; movzbl 8(%ebp),%ebx; je .Lxxx" }
  276. { so we can't safely replace the movzx then with xor/mov, }
  277. { since that would change the flags (JM) }
  278. if PostPeepholeOptMovzx(p) then
  279. Result := True
  280. else if not(cs_opt_regvar in current_settings.optimizerswitches) then
  281. begin
  282. if (taicpu(p).oper[1]^.typ = top_reg) then
  283. if (taicpu(p).oper[0]^.typ = top_reg)
  284. then
  285. case taicpu(p).opsize of
  286. S_BL:
  287. begin
  288. if IsGP32Reg(taicpu(p).oper[1]^.reg) and
  289. not(cs_opt_size in current_settings.optimizerswitches) and
  290. (current_settings.optimizecputype = cpu_Pentium) then
  291. {Change "movzbl %reg1, %reg2" to
  292. "xorl %reg2, %reg2; movb %reg1, %reg2" for Pentium and
  293. PentiumMMX}
  294. begin
  295. hp1 := taicpu.op_reg_reg(A_XOR, S_L,
  296. taicpu(p).oper[1]^.reg, taicpu(p).oper[1]^.reg);
  297. InsertLLItem(p.previous, p, hp1);
  298. taicpu(p).opcode := A_MOV;
  299. taicpu(p).changeopsize(S_B);
  300. setsubreg(taicpu(p).oper[1]^.reg,R_SUBL);
  301. Result := True;
  302. end;
  303. end;
  304. else
  305. ;
  306. end
  307. else if (taicpu(p).oper[0]^.typ = top_ref) and
  308. (taicpu(p).oper[0]^.ref^.base <> taicpu(p).oper[1]^.reg) and
  309. (taicpu(p).oper[0]^.ref^.index <> taicpu(p).oper[1]^.reg) and
  310. not(cs_opt_size in current_settings.optimizerswitches) and
  311. IsGP32Reg(taicpu(p).oper[1]^.reg) and
  312. (current_settings.optimizecputype = cpu_Pentium) and
  313. (taicpu(p).opsize = S_BL) then
  314. {changes "movzbl mem, %reg" to "xorl %reg, %reg; movb mem, %reg8" for
  315. Pentium and PentiumMMX}
  316. begin
  317. hp1 := taicpu.Op_reg_reg(A_XOR, S_L, taicpu(p).oper[1]^.reg,
  318. taicpu(p).oper[1]^.reg);
  319. taicpu(p).opcode := A_MOV;
  320. taicpu(p).changeopsize(S_B);
  321. setsubreg(taicpu(p).oper[1]^.reg,R_SUBL);
  322. InsertLLItem(p.previous, p, hp1);
  323. Result := True;
  324. end;
  325. end;
  326. A_TEST, A_OR:
  327. Result:=PostPeepholeOptTestOr(p);
  328. A_AND:
  329. Result:=PostPeepholeOptAnd(p);
  330. A_MOVSX:
  331. Result:=PostPeepholeOptMOVSX(p);
  332. A_SHR:
  333. Result:=PostPeepholeOptShr(p);
  334. else
  335. ;
  336. end;
  337. { Optimise any reference-type operands (if Result is True, the
  338. instruction will be checked on the next iteration) }
  339. if not Result then
  340. OptimizeRefs(taicpu(p));
  341. end;
  342. else
  343. ;
  344. end;
  345. end;
  346. begin
  347. casmoptimizer:=TCpuAsmOptimizer;
  348. end.