csopt386.pas 33 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789
  1. {
  2. $Id$
  3. Copyright (c) 1997-98 by Jonas Maebe
  4. This unit contains the common subexpression elimination procedure.
  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 CSOpt386;
  19. Interface
  20. Uses aasm;
  21. {Procedure CSOpt386(First, Last: Pai);}
  22. Procedure CSE(AsmL: PAasmOutput; First, Last: Pai);
  23. Implementation
  24. Uses
  25. CObjects, verbose, hcodegen, globals,cpubase,cpuasm,DAOpt386;
  26. {
  27. Function PaiInSequence(P: Pai; Const Seq: TContent): Boolean;
  28. Var P1: Pai;
  29. Counter: Byte;
  30. TmpResult: Boolean;
  31. Begin
  32. TmpResult := False;
  33. P1 := Seq.StartMod;
  34. Counter := 1;
  35. While Not(TmpResult) And
  36. (Counter <= Seq.NrOfMods) Do
  37. Begin
  38. If (P = P1) Then TmpResult := True;
  39. Inc(Counter);
  40. p1 := Pai(p1^.Next);
  41. End;
  42. PaiInSequence := TmpResult;
  43. End;
  44. }
  45. Function CheckSequence(p: Pai; Reg: TRegister; Var Found: Longint; Var RegInfo: TRegInfo): Boolean;
  46. {checks whether the current instruction sequence (starting with p) and the
  47. one between StartMod and EndMod of Reg are the same. If so, the number of
  48. instructions that match is stored in Found and true is returned, otherwise
  49. Found holds the number of instructions between StartMod and EndMod and false
  50. is returned}
  51. Var hp2, hp3{, EndMod}: Pai;
  52. PrevNonRemovablePai: Pai;
  53. Cnt, OldNrOfMods: Longint;
  54. OrgRegInfo, HighRegInfo: TRegInfo;
  55. HighFound, OrgRegFound: Byte;
  56. RegCounter: TRegister;
  57. OrgRegResult: Boolean;
  58. TmpResult: Boolean;
  59. TmpState: Byte;
  60. Begin {CheckSequence}
  61. Reg := Reg32(Reg);
  62. TmpResult := False;
  63. FillChar(OrgRegInfo, SizeOf(OrgRegInfo), 0);
  64. OrgRegFound := 0;
  65. HighFound := 0;
  66. OrgRegResult := False;
  67. RegCounter := R_EAX;
  68. GetLastInstruction(p, PrevNonRemovablePai);
  69. While (RegCounter <= R_EDI) And
  70. (PPaiProp(PrevNonRemovablePai^.OptInfo)^.Regs[RegCounter].Typ <> Con_Ref) Do
  71. Inc(RegCounter);
  72. While (RegCounter <= R_EDI) Do
  73. Begin
  74. FillChar(RegInfo, SizeOf(RegInfo), 0);
  75. RegInfo.NewRegsEncountered := [procinfo^.FramePointer, R_ESP];
  76. RegInfo.OldRegsEncountered := RegInfo.NewRegsEncountered;
  77. RegInfo.New2OldReg[procinfo^.FramePointer] := procinfo^.FramePointer;
  78. RegInfo.New2OldReg[R_ESP] := R_ESP;
  79. Found := 0;
  80. hp2 := PPaiProp(PrevNonRemovablePai^.OptInfo)^.Regs[RegCounter].StartMod;
  81. If (PrevNonRemovablePai <> PPaiProp(PrevNonRemovablePai^.OptInfo)^.Regs[RegCounter].StartMod)
  82. Then OldNrOfMods := PPaiProp(PrevNonRemovablePai^.OptInfo)^.Regs[RegCounter].NrOfMods
  83. Else OldNrOfMods := 1;
  84. hp3 := p;
  85. While (Found <> OldNrOfMods) And
  86. { old new }
  87. InstructionsEquivalent(hp2, hp3, RegInfo) Do
  88. Begin
  89. GetNextInstruction(hp2, hp2);
  90. GetNextInstruction(hp3, hp3);
  91. Inc(Found)
  92. End;
  93. If (Found <> OldNrOfMods) Then
  94. Begin
  95. TmpResult := False;
  96. If (found > 0) then
  97. {this is correct because we only need to turn off the CanBeRemoved flag
  98. when an instruction has already been processed by CheckSequence
  99. (otherwise CanBeRemoved can't be true and thus can't have to be turned off).
  100. If it has already been processed by CheckSequence and flagged to be
  101. removed, it means that it has been checked against a previous sequence
  102. and that it was equal (otherwise CheckSequence would have returned false
  103. and the instruction wouldn't have been removed). If this "If found > 0"
  104. check is left out, incorrect optimizations are performed.}
  105. Found := PPaiProp(Pai(p)^.OptInfo)^.Regs[Reg].NrOfMods
  106. End
  107. Else TmpResult := True;
  108. If TmpResult And
  109. (Found > HighFound)
  110. Then
  111. Begin
  112. HighFound := Found;
  113. HighRegInfo := RegInfo;
  114. End;
  115. If (RegCounter = Reg) Then
  116. Begin
  117. OrgRegFound := Found;
  118. OrgRegResult := TmpResult;
  119. OrgRegInfo := RegInfo
  120. End;
  121. Repeat
  122. Inc(RegCounter);
  123. Until (RegCounter > R_EDI) or
  124. ((PPaiProp(PrevNonRemovablePai^.OptInfo)^.Regs[RegCounter].Typ = Con_Ref) {And
  125. ((Regcounter = Reg) Or
  126. Not(PaiInSequence(p, PPaiProp(PrevNonRemovablePai^.OptInfo)^.Regs[RegCounter]))) }
  127. );
  128. End;
  129. If (HighFound > 0) And
  130. (Not(OrgRegResult) Or
  131. (HighFound > OrgRegFound))
  132. Then
  133. Begin
  134. {$ifndef fpc}
  135. TmpResult := True;
  136. {$else fpc}
  137. CheckSequence := True;
  138. {$endif fpc}
  139. RegInfo := HighRegInfo;
  140. Found := HighFound
  141. End
  142. Else
  143. Begin
  144. {$ifndef fpc}
  145. TmpResult := OrgRegResult;
  146. {$else fpc}
  147. CheckSequence := OrgRegResult;
  148. {$endif fpc}
  149. Found := OrgRegFound;
  150. RegInfo := OrgRegInfo;
  151. End;
  152. { sometimes, registers in RegsLoadedForRef (which normally aren't/shouldn't }
  153. { be used anymore after the sequence, are still used nevertheless (when }
  154. { range checking is on for instance, because this is not "normal" generated }
  155. { code, but more or less manually inserted) }
  156. {$ifndef fpc}
  157. If TmpResult Then
  158. {$else fpc}
  159. If CheckSequence And (Found > 0) Then
  160. {$endif fpc}
  161. For RegCounter := R_EAX to R_EDI Do
  162. If (RegCounter in RegInfo.RegsLoadedForRef) And
  163. (RegInfo.New2OldReg[RegCounter] <> RegCounter) Then
  164. Begin
  165. OldNrOfMods := PPaiProp(PrevNonRemovablePai^.OptInfo)^.
  166. Regs[RegInfo.New2OldReg[RegCounter]].NrOfMods;
  167. hp2 := p;
  168. For Cnt := 1 to Pred(OldNrOfMods) Do
  169. GetNextInstruction(hp2, hp2);
  170. { hp2 now containts the last instruction of the sequence }
  171. { get the writestate at this point of the register in TmpState }
  172. TmpState := PPaiProp(hp2^.OptInfo)^.Regs[RegCounter].WState;
  173. { hp3 := first instruction after the sequence }
  174. GetNextInstruction(hp2, hp2);
  175. { now, even though reg is in RegsLoadedForRef, sometimes it's still used }
  176. { afterwards. It is not if either it is not in usedregs anymore after the }
  177. { sequence, or if it is loaded with a new value right after the sequence }
  178. If (TmpState = PPaiProp(hp2^.OptInfo)^.Regs[RegCounter].WState) And
  179. (RegCounter in PPaiProp(hp2^.OptInfo)^.UsedRegs) Then
  180. { it is still used, so remove it from RegsLoadedForRef }
  181. Begin
  182. {$ifdef regrefdebug}
  183. hp3 := new(pai_asm_comment,init(strpnew(att_reg2str[regcounter]+
  184. ' removed from regsloadedforref')));
  185. hp3^.fileinfo := hp2^.fileinfo;
  186. hp3^.next := hp2^.next;
  187. hp3^.previous := hp2;
  188. hp2^.next := hp3;
  189. If assigned(hp3^.next) then
  190. Pai(hp3^.next)^.previous := hp3;
  191. {$endif regrefdebug}
  192. Exclude(RegInfo.RegsLoadedForRef,RegCounter);
  193. End;
  194. End;
  195. {$ifndef fpc}
  196. CheckSequence := TmpResult;
  197. {$endif fpc}
  198. End; {CheckSequence}
  199. Procedure AllocRegBetween(AsmL: PAasmOutput; Reg: TRegister; p1, p2: Pai);
  200. { allocates register Reg between (and including) instructions p1 and p2 }
  201. { the type of p1 and p2 must not be in SkipInstr }
  202. var hp: pai;
  203. Begin
  204. If not(assigned(p1)) Then
  205. { this happens with registers which are loaded implicitely, outside the }
  206. { current block (e.g. esi with self) }
  207. exit;
  208. Repeat
  209. If Assigned(p1^.OptInfo) Then
  210. Include(PPaiProp(p1^.OptInfo)^.UsedRegs,Reg);
  211. p1 := Pai(p1^.next);
  212. Repeat
  213. While (p1^.typ in (SkipInstr-[ait_regalloc])) Do
  214. p1 := Pai(p1^.next);
  215. { remove all allocation/deallocation info about the register in between }
  216. If (p1^.typ = ait_regalloc) Then
  217. If (PaiRegAlloc(p1)^.Reg = Reg) Then
  218. Begin
  219. hp := Pai(p1^.Next);
  220. AsmL^.Remove(p1);
  221. Dispose(p1, Done);
  222. p1 := hp;
  223. End
  224. Else p1 := Pai(p1^.next);
  225. Until Not(p1^.typ in SkipInstr);
  226. Until p1 = p2;
  227. End;
  228. {$ifdef alignreg}
  229. Procedure SetAlignReg(p: Pai);
  230. Const alignSearch = 12;
  231. var regsUsable: TRegSet;
  232. prevInstrCount, nextInstrCount: Longint;
  233. prevState, nextWState,nextRState: Array[R_EAX..R_EDI] of byte;
  234. regCounter, lastRemoved: TRegister;
  235. prev, next: Pai;
  236. {$ifdef alignregdebug}
  237. temp: Pai;
  238. {$endif alignregdebug}
  239. begin
  240. regsUsable := [R_EAX,R_ECX,R_EDX,R_EBX,{R_ESP,R_EBP,}R_ESI,R_EDI];
  241. for regCounter := R_EAX to R_EDI do
  242. begin
  243. prevState[regCounter] := PPaiProp(p^.optInfo)^.Regs[regCounter].wState;
  244. nextWState[regCounter] := PPaiProp(p^.optInfo)^.Regs[regCounter].wState;
  245. nextRState[regCounter] := PPaiProp(p^.optInfo)^.Regs[regCounter].rState;
  246. end;
  247. getLastInstruction(p,prev);
  248. getNextInstruction(p,next);
  249. lastRemoved := pai_align(p)^.reg;
  250. nextInstrCount := 0;
  251. prevInstrCount := 0;
  252. while ((assigned(prev) and
  253. assigned(prev^.optInfo) and
  254. (prevInstrCount < alignSearch)) or
  255. (assigned(next) and
  256. assigned(next^.optInfo) and
  257. (nextInstrCount < alignSearch))) And
  258. (regsUsable <> []) do
  259. begin
  260. {$ifdef alignregdebug}
  261. if assigned(prev) then
  262. begin
  263. temp := new(pai_asm_comment,init(strpnew('got here')));
  264. temp^.next := prev^.next;
  265. temp^.previous := prev;
  266. prev^.next := temp;
  267. if assigned(temp^.next) then
  268. temp^.next^.previous := temp;
  269. end;
  270. {$endif alignregdebug}
  271. if assigned(prev) and assigned(prev^.optinfo) and
  272. (prevInstrCount < alignSearch) then
  273. begin
  274. if (prev^.typ = ait_instruction) And
  275. (insProp[PaiCpu(prev)^.opcode].ch[1] <> Ch_ALL) and
  276. (PaiCpu(prev)^.opcode <> A_JMP) then
  277. begin
  278. inc(prevInstrCount);
  279. for regCounter := R_EAX to R_EDI do
  280. begin
  281. if (regCounter in regsUsable) And
  282. (PPaiProp(prev^.optInfo)^.Regs[regCounter].wState <>
  283. prevState[regCounter]) then
  284. begin
  285. lastRemoved := regCounter;
  286. exclude(regsUsable,regCounter);
  287. {$ifdef alignregdebug}
  288. temp := new(pai_asm_comment,init(strpnew(
  289. att_reg2str[regCounter]+' removed')));
  290. temp^.next := prev^.next;
  291. temp^.previous := prev;
  292. prev^.next := temp;
  293. if assigned(temp^.next) then
  294. temp^.next^.previous := temp;
  295. if regsUsable = [] then
  296. begin
  297. temp := new(pai_asm_comment,init(strpnew(
  298. 'regsUsable empty here')));
  299. temp^.next := prev^.next;
  300. temp^.previous := prev;
  301. prev^.next := temp;
  302. if assigned(temp^.next) then
  303. temp^.next^.previous := temp;
  304. end;
  305. {$endif alignregdebug}
  306. end;
  307. prevState[regCounter] :=
  308. PPaiProp(prev^.optInfo)^.Regs[regCounter].wState;
  309. end;
  310. getLastInstruction(prev,prev);
  311. end
  312. else
  313. If GetLastInstruction(prev,prev) and
  314. assigned(prev^.optinfo) then
  315. for regCounter := R_EAX to R_EDI do
  316. prevState[regCounter] :=
  317. PPaiProp(prev^.optInfo)^.Regs[regCounter].wState
  318. end;
  319. if assigned(next) and assigned(next^.optInfo) and
  320. (nextInstrCount < alignSearch) then
  321. begin
  322. if (next^.typ = ait_instruction) and
  323. (insProp[PaiCpu(next)^.opcode].ch[1] <> Ch_ALL) and
  324. (PaiCpu(next)^.opcode <> A_JMP) then
  325. begin
  326. inc(nextInstrCount);
  327. for regCounter := R_EAX to R_EDI do
  328. begin
  329. if (regCounter in regsUsable) And
  330. ((PPaiProp(next^.optInfo)^.Regs[regCounter].wState <>
  331. nextWState[regCounter]) or
  332. (PPaiProp(next^.optInfo)^.Regs[regCounter].rState <>
  333. nextRState[regCounter])) Then
  334. begin
  335. lastRemoved := regCounter;
  336. exclude(regsUsable,regCounter);
  337. {$ifdef alignregdebug}
  338. temp := new(pai_asm_comment,init(strpnew(
  339. att_reg2str[regCounter]+' removed')));
  340. temp^.next := next^.next;
  341. temp^.previous := next;
  342. next^.next := temp;
  343. if assigned(temp^.next) then
  344. temp^.next^.previous := temp;
  345. if regsUsable = [] then
  346. begin
  347. temp := new(pai_asm_comment,init(strpnew(
  348. 'regsUsable empty here')));
  349. temp^.next := next^.next;
  350. temp^.previous := next;
  351. next^.next := temp;
  352. if assigned(temp^.next) then
  353. temp^.next^.previous := temp;
  354. end;
  355. {$endif alignregdebug}
  356. end;
  357. nextWState[regCounter] :=
  358. PPaiProp(next^.optInfo)^.Regs[regCounter].wState;
  359. nextRState[regCounter] :=
  360. PPaiProp(next^.optInfo)^.Regs[regCounter].rState;
  361. end
  362. end
  363. else
  364. for regCounter := R_EAX to R_EDI do
  365. begin
  366. nextWState[regCounter] :=
  367. PPaiProp(next^.optInfo)^.Regs[regCounter].wState;
  368. nextRState[regCounter] :=
  369. PPaiProp(next^.optInfo)^.Regs[regCounter].rState;
  370. end;
  371. getNextInstruction(next,next);
  372. end;
  373. end;
  374. if regsUsable <> [] then
  375. for regCounter := R_EAX to R_EDI do
  376. if regCounter in regsUsable then
  377. begin
  378. lastRemoved := regCounter;
  379. break
  380. end;
  381. {$ifdef alignregdebug}
  382. next := new(pai_asm_comment,init(strpnew(att_reg2str[lastRemoved]+
  383. ' chosen as alignment register')));
  384. next^.next := p^.next;
  385. next^.previous := p;
  386. p^.next := next;
  387. if assigned(next^.next) then
  388. next^.next^.previous := next;
  389. {$endif alignregdebug}
  390. pai_align(p)^.reg := lastRemoved;
  391. End;
  392. {$endif alignreg}
  393. Procedure DoCSE(AsmL: PAasmOutput; First, Last: Pai);
  394. {marks the instructions that can be removed by RemoveInstructs. They're not
  395. removed immediately because sometimes an instruction needs to be checked in
  396. two different sequences}
  397. Var Cnt, Cnt2: Longint;
  398. p, hp1, hp2: Pai;
  399. hp3, hp4: Pai;
  400. {$ifdef csdebug}
  401. hp5: pai;
  402. {$endif csdebug}
  403. RegInfo: TRegInfo;
  404. RegCounter: TRegister;
  405. TmpState: Byte;
  406. Begin
  407. p := First;
  408. SkipHead(p);
  409. First := p;
  410. While (p <> Last) Do
  411. Begin
  412. Case p^.typ Of
  413. {$ifdef alignreg}
  414. ait_align:
  415. SetAlignReg(p);
  416. {$endif alignreg}
  417. ait_instruction:
  418. Begin
  419. Case Paicpu(p)^.opcode Of
  420. A_CLD: If GetLastInstruction(p, hp1) And
  421. (PPaiProp(hp1^.OptInfo)^.DirFlag = F_NotSet) Then
  422. PPaiProp(Pai(p)^.OptInfo)^.CanBeRemoved := True;
  423. A_MOV, A_MOVZX, A_MOVSX:
  424. Begin
  425. Case Paicpu(p)^.oper[0].typ Of
  426. Top_Ref:
  427. Begin {destination is always a register in this case}
  428. With PPaiProp(p^.OptInfo)^.Regs[Reg32(Paicpu(p)^.oper[1].reg)] Do
  429. Begin
  430. If (p = StartMod) And
  431. GetLastInstruction (p, hp1) And
  432. (hp1^.typ <> ait_marker)
  433. Then
  434. {so we don't try to check a sequence when p is the first instruction of the block}
  435. If CheckSequence(p, Paicpu(p)^.oper[1].reg, Cnt, RegInfo) And
  436. (Cnt > 0) Then
  437. Begin
  438. hp1 := nil;
  439. { although it's perfectly ok to remove an instruction which doesn't contain }
  440. { the register that we've just checked (CheckSequence takes care of that), }
  441. { the sequence containing this other register should also be completely }
  442. { checked and removed, otherwise we may get situations like this: }
  443. { }
  444. { movl 12(%ebp), %edx movl 12(%ebp), %edx }
  445. { movl 16(%ebp), %eax movl 16(%ebp), %eax }
  446. { movl 8(%edx), %edx movl 8(%edx), %edx }
  447. { movl (%eax), eax movl (%eax), eax }
  448. { cmpl %eax, %edx cmpl %eax, %edx }
  449. { jnz l123 getting converted to jnz l123 }
  450. { movl 12(%ebp), %edx movl 4(%eax), eax }
  451. { movl 16(%ebp), %eax }
  452. { movl 8(%edx), %edx }
  453. { movl 4(%eax), eax }
  454. hp2 := p;
  455. Cnt2 := 1;
  456. While Cnt2 <= Cnt Do
  457. Begin
  458. If (hp1 = nil) And
  459. Not(RegInInstruction(Paicpu(hp2)^.oper[1].reg, p) Or
  460. RegInInstruction(Reg32(Paicpu(hp2)^.oper[1].reg), p)) And
  461. Not((p^.typ = ait_instruction) And
  462. (paicpu(p)^.OpCode = A_MOV) And
  463. (paicpu(p)^.Oper[0].typ = top_ref) And
  464. (PPaiProp(p^.OptInfo)^.Regs[Reg32(paicpu(p)^.Oper[1].reg)].NrOfMods
  465. <= (Cnt - Cnt2 + 1)))
  466. Then hp1 := p;
  467. {$ifndef noremove}
  468. PPaiProp(p^.OptInfo)^.CanBeRemoved := True;
  469. {$endif noremove}
  470. Inc(Cnt2);
  471. GetNextInstruction(p, p);
  472. End;
  473. hp3 := New(Pai_Marker,Init(NoPropInfoStart));
  474. InsertLLItem(AsmL, Pai(hp2^.Previous), hp2, hp3);
  475. {hp4 is used to get the contents of the registers before the sequence}
  476. GetLastInstruction(hp2, hp4);
  477. {$IfDef CSDebug}
  478. For RegCounter := R_EAX To R_EDI Do
  479. If (RegCounter in RegInfo.RegsLoadedForRef) Then
  480. Begin
  481. hp5 := new(pai_asm_comment,init(strpnew('New: '+att_reg2str[RegCounter]+', Old: '+
  482. att_reg2str[RegInfo.New2OldReg[RegCounter]])));
  483. InsertLLItem(AsmL, Pai(hp2^.previous), hp2, hp5);
  484. End;
  485. {$EndIf CSDebug}
  486. { If some registers were different in the old and the new sequence, move }
  487. { the contents of those old registers to the new ones }
  488. For RegCounter := R_EAX To R_EDI Do
  489. If Not(RegCounter in [R_ESP,procinfo^.framepointer]) And
  490. (RegInfo.New2OldReg[RegCounter] <> R_NO) Then
  491. Begin
  492. AllocRegBetween(AsmL,RegInfo.New2OldReg[RegCounter],
  493. PPaiProp(hp4^.OptInfo)^.Regs[RegInfo.New2OldReg[RegCounter]].StartMod,hp2);
  494. If Not(RegCounter In RegInfo.RegsLoadedForRef) And
  495. {old reg new reg}
  496. (RegInfo.New2OldReg[RegCounter] <> RegCounter) Then
  497. Begin
  498. hp3 := New(Paicpu,Op_Reg_Reg(A_MOV, S_L,
  499. {old reg new reg}
  500. RegInfo.New2OldReg[RegCounter], RegCounter));
  501. InsertLLItem(AsmL, Pai(hp2^.previous), hp2, hp3);
  502. End
  503. Else
  504. { imagine the following code: }
  505. { normal wrong optimized }
  506. { movl 8(%ebp), %eax movl 8(%ebp), %eax }
  507. { movl (%eax), %eax movl (%eax), %eax }
  508. { cmpl 8(%ebp), %eax cmpl 8(%ebp), %eax }
  509. { jne l1 jne l1 }
  510. { movl 8(%ebp), %eax }
  511. { movl (%eax), %edi movl %eax, %edi }
  512. { movl %edi, -4(%ebp) movl %edi, -4(%ebp) }
  513. { movl 8(%ebp), %eax }
  514. { pushl 70(%eax) pushl 70(%eax) }
  515. { }
  516. { The error is that at the moment that the last instruction is executed, }
  517. { %eax doesn't contain 8(%ebp) anymore. Solution: the contents of }
  518. { registers that are completely removed from a sequence (= registers in }
  519. { RegLoadedForRef, have to be changed to their contents from before the }
  520. { sequence. }
  521. If RegCounter in RegInfo.RegsLoadedForRef Then
  522. Begin
  523. {load Cnt2 with the total number of instructions of this sequence}
  524. Cnt2 := PPaiProp(hp4^.OptInfo)^.
  525. Regs[RegInfo.New2OldReg[RegCounter]].NrOfMods;
  526. hp3 := hp2;
  527. For Cnt := 1 to Pred(Cnt2) Do
  528. GetNextInstruction(hp3, hp3);
  529. TmpState := PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState;
  530. GetNextInstruction(hp3, hp3);
  531. {$ifdef csdebug}
  532. Writeln('Cnt2: ',Cnt2);
  533. hp5 := new(pai_asm_comment,init(strpnew('starting here...')));
  534. InsertLLItem(AsmL, Pai(hp2^.previous), hp2, hp5);
  535. {$endif csdebug}
  536. hp3 := hp2;
  537. {first change the contents of the register inside the sequence}
  538. For Cnt := 1 to Cnt2 Do
  539. Begin
  540. {save the WState of the last pai object of the sequence for later use}
  541. TmpState := PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState;
  542. {$ifdef csdebug}
  543. hp5 := new(pai_asm_comment,init(strpnew('WState for '+att_reg2str[Regcounter]+': '
  544. +tostr(tmpstate))));
  545. InsertLLItem(AsmL, hp3, pai(hp3^.next), hp5);
  546. {$endif csdebug}
  547. PPaiProp(hp3^.OptInfo)^.Regs[RegCounter] :=
  548. PPaiProp(hp4^.OptInfo)^.Regs[RegCounter];
  549. GetNextInstruction(hp3, hp3);
  550. End;
  551. {here, hp3 = p = Pai object right after the sequence, TmpState = WState of
  552. RegCounter at the last Pai object of the sequence}
  553. GetLastInstruction(hp3, hp3);
  554. While GetNextInstruction(hp3, hp3) And
  555. (PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState
  556. = TmpState) Do
  557. {$ifdef csdebug}
  558. begin
  559. hp5 := new(pai_asm_comment,init(strpnew('WState for '+att_reg2str[Regcounter]+': '+
  560. tostr(PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState))));
  561. InsertLLItem(AsmL, hp3, pai(hp3^.next), hp5);
  562. {$endif csdebug}
  563. PPaiProp(hp3^.OptInfo)^.Regs[RegCounter] :=
  564. PPaiProp(hp4^.OptInfo)^.Regs[RegCounter];
  565. {$ifdef csdebug}
  566. end;
  567. {$endif csdebug}
  568. {$ifdef csdebug}
  569. hp5 := new(pai_asm_comment,init(strpnew('stopping here...')));
  570. InsertLLItem(AsmL, hp3, pai(hp3^.next), hp5);
  571. {$endif csdebug}
  572. End;
  573. End;
  574. hp3 := New(Pai_Marker,Init(NoPropInfoEnd));
  575. InsertLLItem(AsmL, Pai(hp2^.Previous), hp2, hp3);
  576. If hp1 <> nil Then p := hp1;
  577. Continue;
  578. End
  579. Else
  580. If (Cnt > 0) And
  581. (PPaiProp(p^.OptInfo)^.
  582. Regs[Reg32(Paicpu(p)^.oper[1].reg)].Typ = Con_Ref) And
  583. (PPaiProp(p^.OptInfo)^.CanBeRemoved) Then
  584. Begin
  585. hp2 := p;
  586. Cnt2 := 1;
  587. While Cnt2 <= Cnt Do
  588. Begin
  589. If RegInInstruction(Paicpu(hp2)^.oper[1].reg, p) Or
  590. RegInInstruction(Reg32(Paicpu(hp2)^.oper[1].reg), p) Then
  591. PPaiProp(p^.OptInfo)^.CanBeRemoved := False;
  592. Inc(Cnt2);
  593. GetNextInstruction(p, p);
  594. End;
  595. Continue;
  596. End;
  597. End;
  598. End;
  599. Top_Const:
  600. Begin
  601. Case Paicpu(p)^.oper[1].typ Of
  602. Top_Reg:
  603. Begin
  604. If GetLastInstruction(p, hp1) Then
  605. With PPaiProp(hp1^.OptInfo)^.Regs[Reg32(Paicpu(p)^.oper[1].reg)] Do
  606. If (Typ = Con_Const) And
  607. (StartMod = p) Then
  608. PPaiProp(p^.OptInfo)^.CanBeRemoved := True;
  609. End;
  610. { Top_Ref:;}
  611. End;
  612. End;
  613. End;
  614. End;
  615. A_STD: If GetLastInstruction(p, hp1) And
  616. (PPaiProp(hp1^.OptInfo)^.DirFlag = F_Set) Then
  617. PPaiProp(Pai(p)^.OptInfo)^.CanBeRemoved := True;
  618. A_XOR:
  619. Begin
  620. If (Paicpu(p)^.oper[0].typ = top_reg) And
  621. (Paicpu(p)^.oper[0].typ = top_reg) And
  622. (Paicpu(p)^.oper[1].reg = Paicpu(p)^.oper[1].reg) And
  623. GetLastInstruction(p, hp1) And
  624. (PPaiProp(hp1^.OptInfo)^.Regs[Reg32(Paicpu(p)^.oper[1].reg)].typ = con_const) And
  625. (PPaiProp(hp1^.OptInfo)^.Regs[Reg32(Paicpu(p)^.oper[1].reg)].StartMod = nil)
  626. Then PPaiProp(p^.OptInfo)^.CanBeRemoved := True
  627. End
  628. End
  629. End;
  630. End;
  631. GetNextInstruction(p, p);
  632. End;
  633. End;
  634. Procedure RemoveInstructs(AsmL: PAasmOutput; First, Last: Pai);
  635. {Removes the marked instructions and disposes the PPaiProps of the other
  636. instructions, restoring their line number}
  637. Var p, hp1: Pai;
  638. {$IfDef TP}
  639. TmpLine: Longint;
  640. {$EndIf TP}
  641. InstrCnt: Longint;
  642. Begin
  643. p := First;
  644. SkipHead(P);
  645. InstrCnt := 1;
  646. While (p <> Last) Do
  647. Begin
  648. {$ifndef noinstremove}
  649. If PPaiProp(p^.OptInfo)^.CanBeRemoved
  650. Then
  651. Begin
  652. {$IfDef TP}
  653. Dispose(PPaiProp(p^.OptInfo));
  654. {$EndIf}
  655. GetNextInstruction(p, hp1);
  656. AsmL^.Remove(p);
  657. Dispose(p, Done);
  658. p := hp1;
  659. Inc(InstrCnt);
  660. End
  661. Else
  662. {$endif noinstremove}
  663. Begin
  664. {$IfDef TP}
  665. Dispose(PPaiProp(p^.OptInfo));
  666. {$EndIf TP}
  667. p^.OptInfo := nil;
  668. GetNextInstruction(p, p);
  669. Inc(InstrCnt);
  670. End;
  671. End;
  672. {$IfNDef TP}
  673. FreeMem(PaiPropBlock, NrOfPaiObjs*(((SizeOf(TPaiProp)+3)div 4)*4))
  674. {$EndIf TP}
  675. End;
  676. Procedure CSE(AsmL: PAasmOutput; First, Last: Pai);
  677. Begin
  678. DoCSE(AsmL, First, Last);
  679. RemoveInstructs(AsmL, First, Last);
  680. End;
  681. End.
  682. {
  683. $Log$
  684. Revision 1.31 1999-11-06 16:21:57 jonas
  685. + search optimial register to use in alignment code (compile with
  686. -dalignreg, -dalignregdebug to see chosen register in
  687. assembler code). Still needs support in ag386bin.
  688. Revision 1.30 1999/11/06 14:34:20 peter
  689. * truncated log to 20 revs
  690. Revision 1.29 1999/11/05 16:01:46 jonas
  691. + first implementation of choosing least used register for alignment code
  692. (not yet working, between ifdef alignreg)
  693. Revision 1.28 1999/10/11 11:11:31 jonas
  694. * fixed bug which sometimes caused a crash when optimizing blocks of code with
  695. assembler blocks (didn't notice before because of lack of zero page protection
  696. under Win9x :( )
  697. Revision 1.27 1999/10/01 13:51:40 jonas
  698. * CSE now updates the RegAlloc's
  699. Revision 1.26 1999/09/30 14:43:13 jonas
  700. * fixed small efficiency which caused some missed optimizations (saves 1
  701. assembler instruction on the whole compiler/RTL source tree! :)
  702. Revision 1.25 1999/09/27 23:44:50 peter
  703. * procinfo is now a pointer
  704. * support for result setting in sub procedure
  705. Revision 1.24 1999/08/25 11:59:58 jonas
  706. * changed pai386, paippc and paiapha (same for tai*) to paicpu (taicpu)
  707. Revision 1.23 1999/08/04 00:22:58 florian
  708. * renamed i386asm and i386base to cpuasm and cpubase
  709. Revision 1.22 1999/06/03 15:45:08 jonas
  710. * sequences are now checked only once (previously, some long ones were
  711. checked once completely and then several times partially)
  712. Revision 1.21 1999/05/08 20:38:03 jonas
  713. * seperate OPTimizer INFO pointer field in tai object
  714. Revision 1.20 1999/05/01 13:24:19 peter
  715. * merged nasm compiler
  716. * old asm moved to oldasm/
  717. Revision 1.2 1999/03/29 16:05:45 peter
  718. * optimizer working for ag386bin
  719. Revision 1.1 1999/03/26 00:01:09 peter
  720. * first things for optimizer (compiles but cycle crashes)
  721. Revision 1.19 1999/02/26 00:48:17 peter
  722. * assembler writers fixed for ag386bin
  723. Revision 1.18 1998/12/29 18:48:22 jonas
  724. + optimize pascal code surrounding assembler blocks
  725. Revision 1.17 1998/12/17 16:37:39 jonas
  726. + extra checks in RegsEquivalent so some more optimizations can be done (which
  727. where disabled by the second fix from revision 1.22)
  728. Revision 1.16 1998/12/02 16:23:31 jonas
  729. * changed "if longintvar in set" to case or "if () or () .." statements
  730. * tree.pas: changed inlinenumber (and associated constructor/vars) to a byte
  731. Revision 1.15 1998/11/24 19:47:24 jonas
  732. * fixed problems posiible with 3 operand instructions
  733. Revision 1.14 1998/11/09 19:40:48 jonas
  734. * fixed comments from last commit (apparently there's still a 255 char limit :( )
  735. Revision 1.13 1998/11/09 19:33:39 jonas
  736. * changed specific bugfix (which was actually wrong implemented, but
  737. did the right thing in most cases nevertheless) to general bugfix
  738. * fixed bug that caused
  739. mov (ebp), edx mov (ebp), edx
  740. mov (edx), edx mov (edx), edx
  741. ... being changed to ...
  742. mov (ebp), edx mov edx, eax
  743. mov (eax), eax
  744. but this disabled another small correct optimization...
  745. Revision 1.12 1998/10/20 09:32:54 peter
  746. * removed some unused vars
  747. }