aoptcpu.pas 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468
  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_IMUL:
  140. Result:=OptPass1Imul(p);
  141. A_CMP:
  142. Result:=OptPass1Cmp(p);
  143. A_VPXORD,
  144. A_VPXORQ,
  145. A_VXORPS,
  146. A_VXORPD,
  147. A_VPXOR:
  148. Result:=OptPass1VPXor(p);
  149. A_XORPS,
  150. A_XORPD,
  151. A_PXOR:
  152. Result:=OptPass1PXor(p);
  153. A_FLD:
  154. Result:=OptPass1FLD(p);
  155. A_FSTP,A_FISTP:
  156. Result:=OptPass1FSTP(p);
  157. A_LEA:
  158. Result:=OptPass1LEA(p);
  159. A_MOV:
  160. Result:=OptPass1MOV(p);
  161. A_MOVSX,
  162. A_MOVZX :
  163. Result:=OptPass1Movx(p);
  164. A_TEST:
  165. Result:=OptPass1Test(p);
  166. A_PUSH:
  167. begin
  168. if (taicpu(p).opsize = S_W) and
  169. (taicpu(p).oper[0]^.typ = Top_Const) and
  170. GetNextInstruction(p, hp1) and
  171. (tai(hp1).typ = ait_instruction) and
  172. (taicpu(hp1).opcode = A_PUSH) and
  173. (taicpu(hp1).oper[0]^.typ = Top_Const) and
  174. (taicpu(hp1).opsize = S_W) then
  175. begin
  176. taicpu(p).changeopsize(S_L);
  177. taicpu(p).loadConst(0,taicpu(p).oper[0]^.val shl 16 + word(taicpu(hp1).oper[0]^.val));
  178. asml.remove(hp1);
  179. hp1.free;
  180. Result:=true;
  181. end;
  182. end;
  183. A_SHL, A_SAL:
  184. Result:=OptPass1SHLSAL(p);
  185. A_SHR:
  186. Result:=OptPass1SHR(p);
  187. A_SUB:
  188. Result:=OptPass1Sub(p);
  189. A_Jcc:
  190. Result:=OptPass1Jcc(p);
  191. A_MOVDQA,
  192. A_MOVAPD,
  193. A_MOVAPS,
  194. A_MOVUPD,
  195. A_MOVUPS,
  196. A_VMOVAPS,
  197. A_VMOVAPD,
  198. A_VMOVUPS,
  199. A_VMOVUPD:
  200. Result:=OptPass1_V_MOVAP(p);
  201. A_VDIVSD,
  202. A_VDIVSS,
  203. A_VSUBSD,
  204. A_VSUBSS,
  205. A_VMULSD,
  206. A_VMULSS,
  207. A_VADDSD,
  208. A_VADDSS,
  209. A_VANDPD,
  210. A_VANDPS,
  211. A_VORPD,
  212. A_VORPS:
  213. Result:=OptPass1VOP(p);
  214. A_MULSD,
  215. A_MULSS,
  216. A_ADDSD,
  217. A_ADDSS:
  218. Result:=OptPass1OP(p);
  219. A_VMOVSD,
  220. A_VMOVSS,
  221. A_MOVSD,
  222. A_MOVSS:
  223. Result:=OptPass1MOVXX(p);
  224. A_SHRX,
  225. A_SHLX:
  226. Result:=OptPass1SHXX(p);
  227. A_VMOVDQA,
  228. A_VMOVDQU:
  229. Result:=OptPass1VMOVDQ(p);
  230. A_VCVTSS2SD,
  231. A_CVTSS2SD:
  232. Result:=OptPass1_V_Cvtss2sd(p);
  233. A_CLC,
  234. A_STC:
  235. Result:=OptPass1STCCLC(p);
  236. else
  237. ;
  238. end;
  239. end;
  240. else
  241. ;
  242. end;
  243. { If this flag is set, force another run of pass 1 even if p wasn't
  244. changed }
  245. if aoc_ForceNewIteration in OptsToCheck then
  246. begin
  247. Exclude(OptsToCheck, aoc_ForceNewIteration);
  248. if not Result then
  249. begin
  250. if (p.typ in SkipInstr) then
  251. UpdateUsedRegs(p);
  252. p := tai(p.Next);
  253. Result := True;
  254. end;
  255. end;
  256. end;
  257. function TCPUAsmOptimizer.PeepHoleOptPass2Cpu(var p: tai): boolean;
  258. begin
  259. Result:=false;
  260. case p.Typ Of
  261. Ait_Instruction:
  262. begin
  263. if InsContainsSegRef(taicpu(p)) then
  264. exit;
  265. case taicpu(p).opcode Of
  266. A_ADD:
  267. Result:=OptPass2ADD(p);
  268. A_CMP:
  269. Result:=OptPass2CMP(p);
  270. A_TEST:
  271. Result:=OptPass2TEST(p);
  272. A_Jcc:
  273. Result:=OptPass2Jcc(p);
  274. A_Lea:
  275. Result:=OptPass2Lea(p);
  276. A_FSTP,A_FISTP:
  277. Result:=OptPass1FSTP(p);
  278. A_IMUL:
  279. Result:=OptPass2Imul(p);
  280. A_JMP:
  281. Result:=OptPass2Jmp(p);
  282. A_MOV:
  283. Result:=OptPass2MOV(p);
  284. A_MOVZX:
  285. Result:=OptPass2Movx(p);
  286. A_SUB:
  287. Result:=OptPass2SUB(p);
  288. A_SETcc:
  289. Result:=OptPass2SETcc(p);
  290. A_CLC,
  291. A_STC:
  292. Result:=OptPass2STCCLC(p);
  293. else
  294. ;
  295. end;
  296. end;
  297. else
  298. ;
  299. end;
  300. { If this flag is set, force another run of pass 2 even if p wasn't
  301. changed (-O3 only), but otherwise move p ahead by 1 instruction
  302. and treat as if Result was set to True }
  303. if aoc_ForceNewIteration in OptsToCheck then
  304. begin
  305. Exclude(OptsToCheck, aoc_ForceNewIteration);
  306. if not Result then
  307. begin
  308. if (p.typ in SkipInstr) then
  309. UpdateUsedRegs(p);
  310. p := tai(p.Next);
  311. Result := True;
  312. end;
  313. end;
  314. end;
  315. function TCPUAsmOptimizer.PostPeepHoleOptsCpu(var p : tai) : boolean;
  316. var
  317. hp1: tai;
  318. begin
  319. Result:=false;
  320. case p.Typ Of
  321. Ait_Instruction:
  322. begin
  323. if InsContainsSegRef(taicpu(p)) then
  324. Exit;
  325. case taicpu(p).opcode Of
  326. A_CALL:
  327. Result:=PostPeepHoleOptCall(p);
  328. A_LEA:
  329. Result:=PostPeepholeOptLea(p);
  330. A_CMP:
  331. Result:=PostPeepholeOptCmp(p);
  332. A_MOV:
  333. Result:=PostPeepholeOptMov(p);
  334. A_MOVZX:
  335. { if register vars are on, it's possible there is code like }
  336. { "cmpl $3,%eax; movzbl 8(%ebp),%ebx; je .Lxxx" }
  337. { so we can't safely replace the movzx then with xor/mov, }
  338. { since that would change the flags (JM) }
  339. if PostPeepholeOptMovzx(p) then
  340. Result := True
  341. else if not(cs_opt_regvar in current_settings.optimizerswitches) then
  342. begin
  343. if (taicpu(p).oper[1]^.typ = top_reg) then
  344. if (taicpu(p).oper[0]^.typ = top_reg)
  345. then
  346. case taicpu(p).opsize of
  347. S_BL:
  348. begin
  349. if IsGP32Reg(taicpu(p).oper[1]^.reg) and
  350. not(cs_opt_size in current_settings.optimizerswitches) and
  351. (current_settings.optimizecputype = cpu_Pentium) then
  352. {Change "movzbl %reg1, %reg2" to
  353. "xorl %reg2, %reg2; movb %reg1, %reg2" for Pentium and
  354. PentiumMMX}
  355. begin
  356. hp1 := taicpu.op_reg_reg(A_XOR, S_L,
  357. taicpu(p).oper[1]^.reg, taicpu(p).oper[1]^.reg);
  358. InsertLLItem(p.previous, p, hp1);
  359. taicpu(p).opcode := A_MOV;
  360. taicpu(p).changeopsize(S_B);
  361. setsubreg(taicpu(p).oper[1]^.reg,R_SUBL);
  362. Result := True;
  363. end;
  364. end;
  365. else
  366. ;
  367. end
  368. else if (taicpu(p).oper[0]^.typ = top_ref) and
  369. (taicpu(p).oper[0]^.ref^.base <> taicpu(p).oper[1]^.reg) and
  370. (taicpu(p).oper[0]^.ref^.index <> taicpu(p).oper[1]^.reg) and
  371. not(cs_opt_size in current_settings.optimizerswitches) and
  372. IsGP32Reg(taicpu(p).oper[1]^.reg) and
  373. (current_settings.optimizecputype = cpu_Pentium) and
  374. (taicpu(p).opsize = S_BL) then
  375. {changes "movzbl mem, %reg" to "xorl %reg, %reg; movb mem, %reg8" for
  376. Pentium and PentiumMMX}
  377. begin
  378. hp1 := taicpu.Op_reg_reg(A_XOR, S_L, taicpu(p).oper[1]^.reg,
  379. taicpu(p).oper[1]^.reg);
  380. taicpu(p).opcode := A_MOV;
  381. taicpu(p).changeopsize(S_B);
  382. setsubreg(taicpu(p).oper[1]^.reg,R_SUBL);
  383. InsertLLItem(p.previous, p, hp1);
  384. Result := True;
  385. end;
  386. end;
  387. A_TEST, A_OR:
  388. Result:=PostPeepholeOptTestOr(p);
  389. A_AND:
  390. Result:=PostPeepholeOptAnd(p);
  391. A_MOVSX:
  392. Result:=PostPeepholeOptMOVSX(p);
  393. A_SHR:
  394. Result:=PostPeepholeOptShr(p);
  395. A_ADD,
  396. A_SUB:
  397. Result:=PostPeepholeOptADDSUB(p);
  398. A_XOR:
  399. Result:=PostPeepholeOptXor(p);
  400. A_VPXOR:
  401. Result:=PostPeepholeOptVPXOR(p);
  402. else
  403. ;
  404. end;
  405. { Optimise any reference-type operands (if Result is True, the
  406. instruction will be checked on the next iteration) }
  407. if not Result then
  408. OptimizeRefs(taicpu(p));
  409. end;
  410. else
  411. ;
  412. end;
  413. { If this flag is set, something was optimised ahead of p, so move
  414. ahead by 1 instruction but treat as if Result was set to True }
  415. if aoc_ForceNewIteration in OptsToCheck then
  416. begin
  417. Exclude(OptsToCheck, aoc_ForceNewIteration);
  418. if not Result then
  419. begin
  420. if (p.typ in SkipInstr) then
  421. UpdateUsedRegs(p);
  422. p := tai(p.Next);
  423. Result := True;
  424. end;
  425. end;
  426. end;
  427. begin
  428. casmoptimizer:=TCpuAsmOptimizer;
  429. end.