aoptcpu.pas 16 KB

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