csopt386.pas 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643
  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. Procedure DoCSE(AsmL: PAasmOutput; First, Last: Pai);
  229. {marks the instructions that can be removed by RemoveInstructs. They're not
  230. removed immediately because sometimes an instruction needs to be checked in
  231. two different sequences}
  232. Var Cnt, Cnt2: Longint;
  233. p, hp1, hp2: Pai;
  234. hp3, hp4: Pai;
  235. {$ifdef csdebug}
  236. hp5: pai;
  237. {$endif csdebug}
  238. RegInfo: TRegInfo;
  239. RegCounter: TRegister;
  240. TmpState: Byte;
  241. Begin
  242. p := First;
  243. SkipHead(p);
  244. First := p;
  245. While (p <> Last) Do
  246. Begin
  247. Case p^.typ Of
  248. ait_instruction:
  249. Begin
  250. Case Paicpu(p)^.opcode Of
  251. A_CLD: If GetLastInstruction(p, hp1) And
  252. (PPaiProp(hp1^.OptInfo)^.DirFlag = F_NotSet) Then
  253. PPaiProp(Pai(p)^.OptInfo)^.CanBeRemoved := True;
  254. A_MOV, A_MOVZX, A_MOVSX:
  255. Begin
  256. Case Paicpu(p)^.oper[0].typ Of
  257. Top_Ref:
  258. Begin {destination is always a register in this case}
  259. With PPaiProp(p^.OptInfo)^.Regs[Reg32(Paicpu(p)^.oper[1].reg)] Do
  260. Begin
  261. If (p = StartMod) And
  262. GetLastInstruction (p, hp1) And
  263. (hp1^.typ <> ait_marker)
  264. Then
  265. {so we don't try to check a sequence when p is the first instruction of the block}
  266. If CheckSequence(p, Paicpu(p)^.oper[1].reg, Cnt, RegInfo) And
  267. (Cnt > 0) Then
  268. Begin
  269. hp1 := nil;
  270. { although it's perfectly ok to remove an instruction which doesn't contain }
  271. { the register that we've just checked (CheckSequence takes care of that), }
  272. { the sequence containing this other register should also be completely }
  273. { checked and removed, otherwise we may get situations like this: }
  274. { }
  275. { movl 12(%ebp), %edx movl 12(%ebp), %edx }
  276. { movl 16(%ebp), %eax movl 16(%ebp), %eax }
  277. { movl 8(%edx), %edx movl 8(%edx), %edx }
  278. { movl (%eax), eax movl (%eax), eax }
  279. { cmpl %eax, %edx cmpl %eax, %edx }
  280. { jnz l123 getting converted to jnz l123 }
  281. { movl 12(%ebp), %edx movl 4(%eax), eax }
  282. { movl 16(%ebp), %eax }
  283. { movl 8(%edx), %edx }
  284. { movl 4(%eax), eax }
  285. hp2 := p;
  286. Cnt2 := 1;
  287. While Cnt2 <= Cnt Do
  288. Begin
  289. If (hp1 = nil) And
  290. Not(RegInInstruction(Paicpu(hp2)^.oper[1].reg, p) Or
  291. RegInInstruction(Reg32(Paicpu(hp2)^.oper[1].reg), p)) And
  292. Not((p^.typ = ait_instruction) And
  293. (paicpu(p)^.OpCode = A_MOV) And
  294. (paicpu(p)^.Oper[0].typ = top_ref) And
  295. (PPaiProp(p^.OptInfo)^.Regs[Reg32(paicpu(p)^.Oper[1].reg)].NrOfMods
  296. <= (Cnt - Cnt2 + 1)))
  297. Then hp1 := p;
  298. {$ifndef noremove}
  299. PPaiProp(p^.OptInfo)^.CanBeRemoved := True;
  300. {$endif noremove}
  301. Inc(Cnt2);
  302. GetNextInstruction(p, p);
  303. End;
  304. hp3 := New(Pai_Marker,Init(NoPropInfoStart));
  305. InsertLLItem(AsmL, Pai(hp2^.Previous), hp2, hp3);
  306. {hp4 is used to get the contents of the registers before the sequence}
  307. GetLastInstruction(hp2, hp4);
  308. {$IfDef CSDebug}
  309. For RegCounter := R_EAX To R_EDI Do
  310. If (RegCounter in RegInfo.RegsLoadedForRef) Then
  311. Begin
  312. hp5 := new(pai_asm_comment,init(strpnew('New: '+att_reg2str[RegCounter]+', Old: '+
  313. att_reg2str[RegInfo.New2OldReg[RegCounter]])));
  314. InsertLLItem(AsmL, Pai(hp2^.previous), hp2, hp5);
  315. End;
  316. {$EndIf CSDebug}
  317. { If some registers were different in the old and the new sequence, move }
  318. { the contents of those old registers to the new ones }
  319. For RegCounter := R_EAX To R_EDI Do
  320. If Not(RegCounter in [R_ESP,procinfo^.framepointer]) And
  321. (RegInfo.New2OldReg[RegCounter] <> R_NO) Then
  322. Begin
  323. AllocRegBetween(AsmL,RegInfo.New2OldReg[RegCounter],
  324. PPaiProp(hp4^.OptInfo)^.Regs[RegInfo.New2OldReg[RegCounter]].StartMod,hp2);
  325. If Not(RegCounter In RegInfo.RegsLoadedForRef) And
  326. {old reg new reg}
  327. (RegInfo.New2OldReg[RegCounter] <> RegCounter) Then
  328. Begin
  329. hp3 := New(Paicpu,Op_Reg_Reg(A_MOV, S_L,
  330. {old reg new reg}
  331. RegInfo.New2OldReg[RegCounter], RegCounter));
  332. InsertLLItem(AsmL, Pai(hp2^.previous), hp2, hp3);
  333. End
  334. Else
  335. { imagine the following code: }
  336. { normal wrong optimized }
  337. { movl 8(%ebp), %eax movl 8(%ebp), %eax }
  338. { movl (%eax), %eax movl (%eax), %eax }
  339. { cmpl 8(%ebp), %eax cmpl 8(%ebp), %eax }
  340. { jne l1 jne l1 }
  341. { movl 8(%ebp), %eax }
  342. { movl (%eax), %edi movl %eax, %edi }
  343. { movl %edi, -4(%ebp) movl %edi, -4(%ebp) }
  344. { movl 8(%ebp), %eax }
  345. { pushl 70(%eax) pushl 70(%eax) }
  346. { }
  347. { The error is that at the moment that the last instruction is executed, }
  348. { %eax doesn't contain 8(%ebp) anymore. Solution: the contents of }
  349. { registers that are completely removed from a sequence (= registers in }
  350. { RegLoadedForRef, have to be changed to their contents from before the }
  351. { sequence. }
  352. Begin
  353. {load Cnt2 with the total number of instructions of this sequence}
  354. Cnt2 := PPaiProp(hp4^.OptInfo)^.
  355. Regs[RegInfo.New2OldReg[RegCounter]].NrOfMods;
  356. hp3 := hp2;
  357. For Cnt := 1 to Pred(Cnt2) Do
  358. GetNextInstruction(hp3, hp3);
  359. TmpState := PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState;
  360. GetNextInstruction(hp3, hp3);
  361. {$ifdef csdebug}
  362. Writeln('Cnt2: ',Cnt2);
  363. hp5 := new(pai_asm_comment,init(strpnew('starting here...')));
  364. InsertLLItem(AsmL, Pai(hp2^.previous), hp2, hp5);
  365. {$endif csdebug}
  366. hp3 := hp2;
  367. {first change the contents of the register inside the sequence}
  368. For Cnt := 1 to Cnt2 Do
  369. Begin
  370. {save the WState of the last pai object of the sequence for later use}
  371. TmpState := PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState;
  372. {$ifdef csdebug}
  373. hp5 := new(pai_asm_comment,init(strpnew('WState for '+att_reg2str[Regcounter]+': '
  374. +tostr(tmpstate))));
  375. InsertLLItem(AsmL, hp3, pai(hp3^.next), hp5);
  376. {$endif csdebug}
  377. PPaiProp(hp3^.OptInfo)^.Regs[RegCounter] :=
  378. PPaiProp(hp4^.OptInfo)^.Regs[RegCounter];
  379. GetNextInstruction(hp3, hp3);
  380. End;
  381. {here, hp3 = p = Pai object right after the sequence, TmpState = WState of
  382. RegCounter at the last Pai object of the sequence}
  383. GetLastInstruction(hp3, hp3);
  384. While GetNextInstruction(hp3, hp3) And
  385. (PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState
  386. = TmpState) Do
  387. {$ifdef csdebug}
  388. begin
  389. hp5 := new(pai_asm_comment,init(strpnew('WState for '+att_reg2str[Regcounter]+': '+
  390. tostr(PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState))));
  391. InsertLLItem(AsmL, hp3, pai(hp3^.next), hp5);
  392. {$endif csdebug}
  393. PPaiProp(hp3^.OptInfo)^.Regs[RegCounter] :=
  394. PPaiProp(hp4^.OptInfo)^.Regs[RegCounter];
  395. {$ifdef csdebug}
  396. end;
  397. {$endif csdebug}
  398. {$ifdef csdebug}
  399. hp5 := new(pai_asm_comment,init(strpnew('stopping here...')));
  400. InsertLLItem(AsmL, hp3, pai(hp3^.next), hp5);
  401. {$endif csdebug}
  402. End;
  403. End;
  404. hp3 := New(Pai_Marker,Init(NoPropInfoEnd));
  405. InsertLLItem(AsmL, Pai(hp2^.Previous), hp2, hp3);
  406. If hp1 <> nil Then p := hp1;
  407. Continue;
  408. End
  409. Else
  410. If (Cnt > 0) And
  411. (PPaiProp(p^.OptInfo)^.
  412. Regs[Reg32(Paicpu(p)^.oper[1].reg)].Typ = Con_Ref) And
  413. (PPaiProp(p^.OptInfo)^.CanBeRemoved) Then
  414. Begin
  415. hp2 := p;
  416. Cnt2 := 1;
  417. While Cnt2 <= Cnt Do
  418. Begin
  419. If RegInInstruction(Paicpu(hp2)^.oper[1].reg, p) Or
  420. RegInInstruction(Reg32(Paicpu(hp2)^.oper[1].reg), p) Then
  421. PPaiProp(p^.OptInfo)^.CanBeRemoved := False;
  422. Inc(Cnt2);
  423. GetNextInstruction(p, p);
  424. End;
  425. Continue;
  426. End;
  427. End;
  428. End;
  429. Top_Const:
  430. Begin
  431. Case Paicpu(p)^.oper[1].typ Of
  432. Top_Reg:
  433. Begin
  434. If GetLastInstruction(p, hp1) Then
  435. With PPaiProp(hp1^.OptInfo)^.Regs[Reg32(Paicpu(p)^.oper[1].reg)] Do
  436. If (Typ = Con_Const) And
  437. (StartMod = p) Then
  438. PPaiProp(p^.OptInfo)^.CanBeRemoved := True;
  439. End;
  440. { Top_Ref:;}
  441. End;
  442. End;
  443. End;
  444. End;
  445. A_STD: If GetLastInstruction(p, hp1) And
  446. (PPaiProp(hp1^.OptInfo)^.DirFlag = F_Set) Then
  447. PPaiProp(Pai(p)^.OptInfo)^.CanBeRemoved := True;
  448. A_XOR:
  449. Begin
  450. If (Paicpu(p)^.oper[0].typ = top_reg) And
  451. (Paicpu(p)^.oper[0].typ = top_reg) And
  452. (Paicpu(p)^.oper[1].reg = Paicpu(p)^.oper[1].reg) And
  453. GetLastInstruction(p, hp1) And
  454. (PPaiProp(hp1^.OptInfo)^.Regs[Reg32(Paicpu(p)^.oper[1].reg)].typ = con_const) And
  455. (PPaiProp(hp1^.OptInfo)^.Regs[Reg32(Paicpu(p)^.oper[1].reg)].StartMod = nil)
  456. Then PPaiProp(p^.OptInfo)^.CanBeRemoved := True
  457. End
  458. End
  459. End;
  460. End;
  461. GetNextInstruction(p, p);
  462. End;
  463. End;
  464. Procedure RemoveInstructs(AsmL: PAasmOutput; First, Last: Pai);
  465. {Removes the marked instructions and disposes the PPaiProps of the other
  466. instructions, restoring their line number}
  467. Var p, hp1: Pai;
  468. {$IfDef TP}
  469. TmpLine: Longint;
  470. {$EndIf TP}
  471. InstrCnt: Longint;
  472. Begin
  473. p := First;
  474. SkipHead(P);
  475. InstrCnt := 1;
  476. While (p <> Last) Do
  477. Begin
  478. {$ifndef noinstremove}
  479. If PPaiProp(p^.OptInfo)^.CanBeRemoved
  480. Then
  481. Begin
  482. {$IfDef TP}
  483. Dispose(PPaiProp(p^.OptInfo));
  484. {$EndIf}
  485. GetNextInstruction(p, hp1);
  486. AsmL^.Remove(p);
  487. Dispose(p, Done);
  488. p := hp1;
  489. Inc(InstrCnt);
  490. End
  491. Else
  492. {$endif noinstremove}
  493. Begin
  494. {$IfDef TP}
  495. Dispose(PPaiProp(p^.OptInfo));
  496. {$EndIf TP}
  497. p^.OptInfo := nil;
  498. GetNextInstruction(p, p);
  499. Inc(InstrCnt);
  500. End;
  501. End;
  502. {$IfNDef TP}
  503. FreeMem(PaiPropBlock, NrOfPaiObjs*(((SizeOf(TPaiProp)+3)div 4)*4))
  504. {$EndIf TP}
  505. End;
  506. Procedure CSE(AsmL: PAasmOutput; First, Last: Pai);
  507. Begin
  508. DoCSE(AsmL, First, Last);
  509. RemoveInstructs(AsmL, First, Last);
  510. End;
  511. End.
  512. {
  513. $Log$
  514. Revision 1.27 1999-10-01 13:51:40 jonas
  515. * CSE now updates the RegAlloc's
  516. Revision 1.26 1999/09/30 14:43:13 jonas
  517. * fixed small efficiency which caused some missed optimizations (saves 1
  518. assembler instruction on the whole compiler/RTL source tree! :)
  519. Revision 1.25 1999/09/27 23:44:50 peter
  520. * procinfo is now a pointer
  521. * support for result setting in sub procedure
  522. Revision 1.24 1999/08/25 11:59:58 jonas
  523. * changed pai386, paippc and paiapha (same for tai*) to paicpu (taicpu)
  524. Revision 1.23 1999/08/04 00:22:58 florian
  525. * renamed i386asm and i386base to cpuasm and cpubase
  526. Revision 1.22 1999/06/03 15:45:08 jonas
  527. * sequences are now checked only once (previously, some long ones were
  528. checked once completely and then several times partially)
  529. Revision 1.21 1999/05/08 20:38:03 jonas
  530. * seperate OPTimizer INFO pointer field in tai object
  531. Revision 1.20 1999/05/01 13:24:19 peter
  532. * merged nasm compiler
  533. * old asm moved to oldasm/
  534. Revision 1.2 1999/03/29 16:05:45 peter
  535. * optimizer working for ag386bin
  536. Revision 1.1 1999/03/26 00:01:09 peter
  537. * first things for optimizer (compiles but cycle crashes)
  538. Revision 1.19 1999/02/26 00:48:17 peter
  539. * assembler writers fixed for ag386bin
  540. Revision 1.18 1998/12/29 18:48:22 jonas
  541. + optimize pascal code surrounding assembler blocks
  542. Revision 1.17 1998/12/17 16:37:39 jonas
  543. + extra checks in RegsEquivalent so some more optimizations can be done (which
  544. where disabled by the second fix from revision 1.22)
  545. Revision 1.16 1998/12/02 16:23:31 jonas
  546. * changed "if longintvar in set" to case or "if () or () .." statements
  547. * tree.pas: changed inlinenumber (and associated constructor/vars) to a byte
  548. Revision 1.15 1998/11/24 19:47:24 jonas
  549. * fixed problems posiible with 3 operand instructions
  550. Revision 1.14 1998/11/09 19:40:48 jonas
  551. * fixed comments from last commit (apparently there's still a 255 char limit :( )
  552. Revision 1.13 1998/11/09 19:33:39 jonas
  553. * changed specific bugfix (which was actually wrong implemented, but
  554. did the right thing in most cases nevertheless) to general bugfix
  555. * fixed bug that caused
  556. mov (ebp), edx mov (ebp), edx
  557. mov (edx), edx mov (edx), edx
  558. ... being changed to ...
  559. mov (ebp), edx mov edx, eax
  560. mov (eax), eax
  561. but this disabled another small correct optimization...
  562. Revision 1.12 1998/10/20 09:32:54 peter
  563. * removed some unused vars
  564. Revision 1.11 1998/10/07 16:24:52 jonas
  565. * changed state to WState (WriteState), added RState for future use in
  566. instruction scheduling
  567. Revision 1.10 1998/10/02 17:29:23 jonas
  568. * much better interregister CSE
  569. Revision 1.9 1998/10/01 20:21:49 jonas
  570. * inter-register CSE, still requires some tweaks (peepholeoptpass2, better RegAlloc)
  571. Revision 1.8 1998/09/21 08:45:09 pierre
  572. + added vmt_offset in tobjectdef.write for fututre use
  573. (first steps to have objects without vmt if no virtual !!)
  574. + added fpu_used field for tabstractprocdef :
  575. sets this level to 2 if the functions return with value in FPU
  576. (is then set to correct value at parsing of implementation)
  577. THIS MIGHT refuse some code with FPU expression too complex
  578. that were accepted before and even in some cases
  579. that don't overflow in fact
  580. ( like if f : float; is a forward that finally in implementation
  581. only uses one fpu register !!)
  582. Nevertheless I think that it will improve security on
  583. FPU operations !!
  584. * most other changes only for UseBrowser code
  585. (added symtable references for record and objects)
  586. local switch for refs to args and local of each function
  587. (static symtable still missing)
  588. UseBrowser still not stable and probably broken by
  589. the definition hash array !!
  590. Revision 1.7 1998/09/20 17:12:35 jonas
  591. * small fix for uncertain optimizations & more cleaning up
  592. Revision 1.5 1998/09/16 17:59:59 jonas
  593. * optimizer now completely dependant on GetNext/GetLast instruction, works again with -dRegAlloc
  594. Revision 1.4 1998/08/06 19:40:27 jonas
  595. * removed $ before and after Log in comment
  596. Revision 1.3 1998/08/05 16:00:12 florian
  597. * some fixes for ansi strings
  598. * log to Log changed
  599. }