123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653 |
- {
- $Id$
- Copyright (c) 1997-98 by Jonas Maebe
- This unit contains the common subexpression elimination procedure.
- This program is free software; you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 2 of the License, or
- (at your option) any later version.
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
- ****************************************************************************
- }
- Unit CSOpt386;
- Interface
- Uses aasm;
- {Procedure CSOpt386(First, Last: Pai);}
- Procedure CSE(AsmL: PAasmOutput; First, Last: Pai);
- Implementation
- Uses
- CObjects, verbose, hcodegen, globals,cpubase,cpuasm,DAOpt386;
- {
- Function PaiInSequence(P: Pai; Const Seq: TContent): Boolean;
- Var P1: Pai;
- Counter: Byte;
- TmpResult: Boolean;
- Begin
- TmpResult := False;
- P1 := Seq.StartMod;
- Counter := 1;
- While Not(TmpResult) And
- (Counter <= Seq.NrOfMods) Do
- Begin
- If (P = P1) Then TmpResult := True;
- Inc(Counter);
- p1 := Pai(p1^.Next);
- End;
- PaiInSequence := TmpResult;
- End;
- }
- Function CheckSequence(p: Pai; Reg: TRegister; Var Found: Longint; Var RegInfo: TRegInfo): Boolean;
- {checks whether the current instruction sequence (starting with p) and the
- one between StartMod and EndMod of Reg are the same. If so, the number of
- instructions that match is stored in Found and true is returned, otherwise
- Found holds the number of instructions between StartMod and EndMod and false
- is returned}
- Var hp2, hp3{, EndMod}: Pai;
- PrevNonRemovablePai: Pai;
- OrgRegInfo, HighRegInfo: TRegInfo;
- HighFound, OrgRegFound: Byte;
- RegCounter: TRegister;
- OrgRegResult: Boolean;
- TmpResult: Boolean;
- OldNrOfMods: Byte;
- Begin {CheckSequence}
- Reg := Reg32(Reg);
- TmpResult := False;
- FillChar(OrgRegInfo, SizeOf(OrgRegInfo), 0);
- OrgRegFound := 0;
- HighFound := 0;
- OrgRegResult := False;
- RegCounter := R_EAX;
- GetLastInstruction(p, PrevNonRemovablePai);
- While (RegCounter <= R_EDI) And
- (PPaiProp(PrevNonRemovablePai^.OptInfo)^.Regs[RegCounter].Typ <> Con_Ref) Do
- Inc(RegCounter);
- While (RegCounter <= R_EDI) Do
- Begin
- FillChar(RegInfo, SizeOf(RegInfo), 0);
- RegInfo.NewRegsEncountered := [ProcInfo.FramePointer, R_ESP];
- RegInfo.OldRegsEncountered := RegInfo.NewRegsEncountered;
- RegInfo.New2OldReg[ProcInfo.FramePointer] := ProcInfo.FramePointer;
- RegInfo.New2OldReg[R_ESP] := R_ESP;
- Found := 0;
- hp2 := PPaiProp(PrevNonRemovablePai^.OptInfo)^.Regs[RegCounter].StartMod;
- If (PrevNonRemovablePai <> PPaiProp(PrevNonRemovablePai^.OptInfo)^.Regs[RegCounter].StartMod)
- Then OldNrOfMods := PPaiProp(PrevNonRemovablePai^.OptInfo)^.Regs[RegCounter].NrOfMods
- Else OldNrOfMods := 1;
- hp3 := p;
- While (Found <> OldNrOfMods) And
- { old new }
- InstructionsEquivalent(hp2, hp3, RegInfo) Do
- Begin
- GetNextInstruction(hp2, hp2);
- GetNextInstruction(hp3, hp3);
- Inc(Found)
- End;
- If (Found <> OldNrOfMods)
- Then
- Begin
- (* If ((Found+1) = OldNrOfMods) And
- Assigned(hp2) And
- (Pai(hp2)^.typ = ait_instruction) And
- ((Pai386(hp2)^.opcode = A_MOV) or
- (Pai386(p1)^.opcode = A_MOVZX)) And
- (Pai386(hp2)^.oper[0].typ = top_ref) And
- (Pai386(hp2)^.optype[1] = top_reg) And
- Assigned(hp3) And
- (Pai(hp3)^.typ = ait_instruction) And
- ((Pai386(hp3)^.opcode = A_MOV) or
- (Pai386(hp3)^.opcode = A_MOVZX)) And
- (Pai386(hp3)^.oper[0].typ = top_ref) And
- (Pai386(hp3)^.optype[1] = top_reg) And
- (Pai386(hp2)^.opcode <> Pai386(hp3)^.opcode) And
- RefsEquivalent(TReference(Pai386(hp2)^.oper[1]^),TReference(Pai386(hp3)^.oper[1]^), RegInfo)
- Then
- {hack to be able to optimize
- mov (mem), reg
- mov (reg), reg
- mov (reg), reg [*]
- test reg, reg and the oposite (where the marked instructions are
- jne l1 switched)
- mov (mem), reg
- mov (reg), reg
- movzx (reg), reg [*]}
- If (Pai386(hp2)^.opcode = A_MOV)
- Then
- Begin
- If (Pai386(hp2)^.opsize = S_B) And
- RegsEquivalent(Reg8toReg32(TRegister(Pai386(hp2)^.oper[1])),
- TRegister(Pai386(hp3)^.oper[1]), RegInfo)
- Then
- Begin
- Pai386(hp2)^.opcode := A_MOVZX;
- Pai386(hp2)^.opsize := S_BL;
- Pai386(hp2)^.loadoper(1,Pai386(hp3)^.oper[1]);
- Inc(Found);
- TmpResult := True;
- End
- Else
- Begin
- TmpResult := False;
- If (Found > 0) Then
- Found := PPaiProp(Pai(p)^.OptInfo)^.Regs[Reg].NrOfMods
- End
- End
- Else
- Begin
- If (Pai386(hp3)^.opsize = S_B) And
- RegsEquivalent(TRegister(Pai386(hp2)^.oper[1]),
- Reg8toReg32(TRegister(Pai386(hp3)^.oper[1])),
- RegInfo)
- Then
- Begin
- TmpResult := True;
- Inc(Found)
- End
- Else
- Begin
- TmpResult := False;
- If (Found > 0) Then
- Found := PPaiProp(Pai(p)^.OptInfo)^.Regs[Reg].NrOfMods
- End
- End
- Else *)
- Begin
- TmpResult := False;
- If (found > 0) then
- {this is correct because we only need to turn off the CanBeRemoved flag
- when an instruction has already been processed by CheckSequence
- (otherwise CanBeRemoved can't be true and thus can't have to be turned off).
- If it has already been processed by CheckSequence and flagged to be
- removed, it means that it has been checked against a previous sequence
- and that it was equal (otherwise CheckSequence would have returned false
- and the instruction wouldn't have been removed). If this "If found > 0"
- check is left out, incorrect optimizations are performed.}
- Found := PPaiProp(Pai(p)^.OptInfo)^.Regs[Reg].NrOfMods
- End
- End
- Else TmpResult := True;
- If TmpResult And
- (Found > HighFound)
- Then
- Begin
- HighFound := Found;
- HighRegInfo := RegInfo;
- End;
- If (RegCounter = Reg) Then
- Begin
- OrgRegFound := Found;
- OrgRegResult := TmpResult;
- OrgRegInfo := RegInfo
- End;
- Repeat
- Inc(RegCounter);
- Until (RegCounter > R_EDI) or
- ((PPaiProp(PrevNonRemovablePai^.OptInfo)^.Regs[RegCounter].Typ = Con_Ref) {And
- ((Regcounter = Reg) Or
- Not(PaiInSequence(p, PPaiProp(PrevNonRemovablePai^.OptInfo)^.Regs[RegCounter]))) }
- );
- End;
- If (HighFound > 0) And
- (Not(OrgRegResult) Or
- (HighFound > OrgRegFound))
- Then
- Begin
- CheckSequence := True;
- RegInfo := HighRegInfo;
- Found := HighFound
- End
- Else
- Begin
- CheckSequence := OrgRegResult;
- Found := OrgRegFound;
- RegInfo := OrgRegInfo;
- End;
- End; {CheckSequence}
- Procedure DoCSE(AsmL: PAasmOutput; First, Last: Pai);
- {marks the instructions that can be removed by RemoveInstructs. They're not
- removed immediately because sometimes an instruction needs to be checked in
- two different sequences}
- Var Cnt, Cnt2: Longint;
- p, hp1, hp2: Pai;
- hp3, hp4: Pai;
- {$ifdef csdebug}
- hp5: pai;
- {$endif csdebug}
- RegInfo: TRegInfo;
- RegCounter: TRegister;
- TmpState: Byte;
- Begin
- p := First;
- SkipHead(p);
- First := p;
- While (p <> Last) Do
- Begin
- Case p^.typ Of
- ait_instruction:
- Begin
- Case Pai386(p)^.opcode Of
- A_CLD: If GetLastInstruction(p, hp1) And
- (PPaiProp(hp1^.OptInfo)^.DirFlag = F_NotSet) Then
- PPaiProp(Pai(p)^.OptInfo)^.CanBeRemoved := True;
- A_MOV, A_MOVZX, A_MOVSX:
- Begin
- Case Pai386(p)^.oper[0].typ Of
- { Top_Reg:
- Case Pai386(p)^.optype[1] Of
- Top_Reg:;
- Top_Ref:;
- End;}
- Top_Ref:
- Begin {destination is always a register in this case}
- With PPaiProp(p^.OptInfo)^.Regs[Reg32(Pai386(p)^.oper[1].reg)] Do
- Begin
- If (p = StartMod) And
- GetLastInstruction (p, hp1) And
- (hp1^.typ <> ait_marker)
- Then
- {so we don't try to check a sequence when p is the first instruction of the block}
- If CheckSequence(p, Pai386(p)^.oper[1].reg, Cnt, RegInfo) And
- (Cnt > 0)
- Then
- Begin
- hp1 := nil;
- {although it's perfectly ok to remove an instruction which doesn't contain
- the register that we've just checked (CheckSequence takes care of that),
- the sequence containing this other register should also be completely
- checked and removed, otherwise we may get situations like this:
- movl 12(%ebp), %edx movl 12(%ebp), %edx
- movl 16(%ebp), %eax movl 16(%ebp), %eax
- movl 8(%edx), %edx movl 8(%edx), %edx
- movl (%eax), eax movl (%eax), eax
- cmpl %eax, %edx cmpl %eax, %edx
- jnz l123 getting converted to jnz l123
- movl 12(%ebp), %edx movl 4(%eax), eax
- movl 16(%ebp), %eax
- movl 8(%edx), %edx
- movl 4(%eax), eax}
- hp2 := p;
- Cnt2 := 1;
- While Cnt2 <= Cnt Do
- Begin
- If (hp1 = nil) And
- Not(RegInInstruction(Pai386(hp2)^.oper[1].reg, p) Or
- RegInInstruction(Reg32(Pai386(hp2)^.oper[1].reg), p)) And
- Not((p^.typ = ait_instruction) And
- (pai386(p)^.OpCode = A_MOV) And
- (pai386(p)^.Oper[0].typ = top_ref) And
- (PPaiProp(p^.OptInfo)^.Regs[Reg32(pai386(p)^.Oper[1].reg)].NrOfMods
- <= (Cnt - Cnt2 + 1)))
- Then hp1 := p;
- {$ifndef noremove}
- PPaiProp(p^.OptInfo)^.CanBeRemoved := True;
- {$endif noremove}
- Inc(Cnt2);
- GetNextInstruction(p, p);
- End;
- hp3 := New(Pai_Marker,Init(NoPropInfoStart));
- InsertLLItem(AsmL, Pai(hp2^.Previous), hp2, hp3);
- {imagine the following code:
- normal wrong optimized
- movl 8(%ebp), %eax movl 8(%ebp), %eax
- movl (%eax), %eax movl (%eax), %eax
- cmpl 8(%ebp), %eax cmpl 8(%ebp), %eax
- jne l1 jne l1
- movl 8(%ebp), %eax
- movl (%eax), %edi movl %eax, %edi
- movl %edi, -4(%ebp) movl %edi, -4(%ebp)
- movl 8(%ebp), %eax
- pushl 70(%eax) pushl 70(%eax)
- The error is that at the moment that the last instruction is executed,
- %eax doesn't contain 8(%ebp) anymore. Solution: the contents of registers
- that are completely removed from a sequence, have to be changed to their
- contents from before the sequence.}
- {hp4 is used to get the contents of the registers before the sequence}
- GetLastInstruction(hp2, hp4);
- {If some registers were different in the old and the new sequence, move
- the contents of those old registers to the new ones}
- {$IfDef CSDebug}
- For RegCounter := R_EAX To R_EDI Do
- If (RegCounter in RegInfo.RegsLoadedForRef) Then
- Begin
- hp5 := new(pai_asm_comment,init(strpnew('New: '+att_reg2str[RegCounter]+', Old: '+
- att_reg2str[RegInfo.New2OldReg[RegCounter]])));
- InsertLLItem(AsmL, Pai(hp2^.previous), hp2, hp5);
- End;
- {$EndIf CSDebug}
- For RegCounter := R_EAX To R_EDI Do
- Begin
- If (RegInfo.New2OldReg[RegCounter] <> R_NO) Then
- If Not(RegCounter In RegInfo.RegsLoadedForRef) And
- {old reg new reg}
- (RegInfo.New2OldReg[RegCounter] <> RegCounter) Then
- Begin
- hp3 := New(Pai386,Op_Reg_Reg(A_MOV, S_L,
- {old reg new reg}
- RegInfo.New2OldReg[RegCounter], RegCounter));
- hp3^.fileinfo := hp2^.fileinfo;
- InsertLLItem(AsmL, Pai(hp2^.previous), hp2, hp3);
- End
- Else
- If (RegCounter In RegInfo.RegsLoadedForRef) Then
- {change the contents of this register to the its contents before the
- sequence (for all instructions in and after the sequence, until the register
- is reloaded)}
- Begin
- {load Cnt2 with the total number of instructions of this sequence}
- Cnt2 := PPaiProp(hp4^.OptInfo)^.
- Regs[RegInfo.New2OldReg[RegCounter]].NrOfMods;
- {sometimes, a register can not be removed from a sequence, because it's
- still used afterwards:
- movl -8(%ebp), %eax movl -8(%ebp), %eax
- movl 70(%eax), %eax movl 70(%eax), %eax
- cmpl 74(%eax), %eax cmpl 74(%eax), %eax
- jne l1 can't be changed to jne l1
- movl -8(%ebp), %eax
- movl 70(%eax), %edi movl %eax, %edi
- boundl R_282, %edi boundl R_282, %edi
- pushl 70(%eax) pushl 70(%eax)
- because eax now contains the wrong value when 70(%eax) is pushed}
- hp3 := hp2;
- For Cnt := 1 to Pred(Cnt2) Do
- GetNextInstruction(hp3, hp3);
- TmpState := PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState;
- GetNextInstruction(hp3, hp3);
- If (TmpState <> PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState) Or
- Not(RegCounter in PPaiProp(hp3^.OptInfo)^.UsedRegs) Then
- Begin
- {$ifdef csdebug}
- Writeln('Cnt2: ',Cnt2);
- hp5 := new(pai_asm_comment,init(strpnew('starting here...')));
- InsertLLItem(AsmL, Pai(hp2^.previous), hp2, hp5);
- {$endif csdebug}
- hp3 := hp2;
- {first change the contents of the register inside the sequence}
- For Cnt := 1 to Cnt2 Do
- Begin
- {save the WState of the last pai object of the sequence for later use}
- TmpState := PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState;
- {$ifdef csdebug}
- hp5 := new(pai_asm_comment,init(strpnew('WState for '+att_reg2str[Regcounter]+': '
- +tostr(tmpstate))));
- InsertLLItem(AsmL, hp3, pai(hp3^.next), hp5);
- {$endif csdebug}
- PPaiProp(hp3^.OptInfo)^.Regs[RegCounter] :=
- PPaiProp(hp4^.OptInfo)^.Regs[RegCounter];
- GetNextInstruction(hp3, hp3);
- End;
- {here, hp3 = p = Pai object right after the sequence, TmpState = WState of
- RegCounter at the last Pai object of the sequence}
- GetLastInstruction(hp3, hp3);
- While GetNextInstruction(hp3, hp3) And
- (PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState
- = TmpState) Do
- {$ifdef csdebug}
- begin
- hp5 := new(pai_asm_comment,init(strpnew('WState for '+att_reg2str[Regcounter]+': '+
- tostr(PPaiProp(hp3^.OptInfo)^.Regs[RegCounter].WState))));
- InsertLLItem(AsmL, hp3, pai(hp3^.next), hp5);
- {$endif csdebug}
- PPaiProp(hp3^.OptInfo)^.Regs[RegCounter] :=
- PPaiProp(hp4^.OptInfo)^.Regs[RegCounter];
- {$ifdef csdebug}
- end;
- {$endif csdebug}
- End
- Else
- Begin
- {$ifdef csdebug}
- Writeln('Got there for ',att_Reg2Str[RegCounter]);
- {$endif csdebug}
- hp3 := hp2;
- For Cnt := 1 to Cnt2 Do
- Begin
- If RegModifiedByInstruction(RegCounter, hp3)
- Then PPaiProp(hp3^.OptInfo)^.CanBeRemoved := False;
- GetNextInstruction(hp3, hp3);
- End;
- End;
- {$ifdef csdebug}
- hp5 := new(pai_asm_comment,init(strpnew('stopping here...')));
- InsertLLItem(AsmL, hp3, pai(hp3^.next), hp5);
- {$endif csdebug}
- End;
- End;
- hp3 := New(Pai_Marker,Init(NoPropInfoEnd));
- InsertLLItem(AsmL, Pai(hp2^.Previous), hp2, hp3);
- If hp1 <> nil Then p := hp1;
- Continue;
- End
- Else
- If (Cnt > 0) And
- (PPaiProp(p^.OptInfo)^.
- Regs[Reg32(Pai386(p)^.oper[1].reg)].Typ = Con_Ref) And
- (PPaiProp(p^.OptInfo)^.CanBeRemoved) Then
- Begin
- hp2 := p;
- Cnt2 := 1;
- While Cnt2 <= Cnt Do
- Begin
- If RegInInstruction(Pai386(hp2)^.oper[1].reg, p) Or
- RegInInstruction(Reg32(Pai386(hp2)^.oper[1].reg), p) Then
- PPaiProp(p^.OptInfo)^.CanBeRemoved := False;
- Inc(Cnt2);
- GetNextInstruction(p, p);
- End;
- Continue;
- End;
- End;
- End;
- Top_Const:
- Begin
- Case Pai386(p)^.oper[1].typ Of
- Top_Reg:
- Begin
- If GetLastInstruction(p, hp1) Then
- With PPaiProp(hp1^.OptInfo)^.Regs[Reg32(Pai386(p)^.oper[1].reg)] Do
- If (Typ = Con_Const) And
- (StartMod = p) Then
- PPaiProp(p^.OptInfo)^.CanBeRemoved := True;
- End;
- { Top_Ref:;}
- End;
- End;
- End;
- End;
- A_STD: If GetLastInstruction(p, hp1) And
- (PPaiProp(hp1^.OptInfo)^.DirFlag = F_Set) Then
- PPaiProp(Pai(p)^.OptInfo)^.CanBeRemoved := True;
- A_XOR:
- Begin
- If (Pai386(p)^.oper[0].typ = top_reg) And
- (Pai386(p)^.oper[0].typ = top_reg) And
- (Pai386(p)^.oper[1].reg = Pai386(p)^.oper[1].reg) And
- GetLastInstruction(p, hp1) And
- (PPaiProp(hp1^.OptInfo)^.Regs[Reg32(Pai386(p)^.oper[1].reg)].typ = con_const) And
- (PPaiProp(hp1^.OptInfo)^.Regs[Reg32(Pai386(p)^.oper[1].reg)].StartMod = nil)
- Then PPaiProp(p^.OptInfo)^.CanBeRemoved := True
- End
- End
- End;
- End;
- GetNextInstruction(p, p);
- End;
- End;
- Procedure RemoveInstructs(AsmL: PAasmOutput; First, Last: Pai);
- {Removes the marked instructions and disposes the PPaiProps of the other
- instructions, restoring their line number}
- Var p, hp1: Pai;
- {$IfDef TP}
- TmpLine: Longint;
- {$EndIf TP}
- InstrCnt: Longint;
- Begin
- p := First;
- SkipHead(P);
- InstrCnt := 1;
- While (p <> Last) Do
- Begin
- {$ifndef noinstremove}
- If PPaiProp(p^.OptInfo)^.CanBeRemoved
- Then
- Begin
- {$IfDef TP}
- Dispose(PPaiProp(p^.OptInfo));
- {$EndIf}
- GetNextInstruction(p, hp1);
- AsmL^.Remove(p);
- Dispose(p, Done);
- p := hp1;
- Inc(InstrCnt);
- End
- Else
- {$endif noinstremove}
- Begin
- {$IfDef TP}
- Dispose(PPaiProp(p^.OptInfo));
- {$EndIf TP}
- p^.OptInfo := nil;
- GetNextInstruction(p, p);
- Inc(InstrCnt);
- End;
- End;
- {$IfNDef TP}
- FreeMem(PaiPropBlock, NrOfPaiObjs*(((SizeOf(TPaiProp)+3)div 4)*4))
- {$EndIf TP}
- End;
- Procedure CSE(AsmL: PAasmOutput; First, Last: Pai);
- Begin
- DoCSE(AsmL, First, Last);
- RemoveInstructs(AsmL, First, Last);
- End;
- End.
- {
- $Log$
- Revision 1.23 1999-08-04 00:22:58 florian
- * renamed i386asm and i386base to cpuasm and cpubase
- Revision 1.22 1999/06/03 15:45:08 jonas
- * sequences are now checked only once (previously, some long ones were
- checked once completely and then several times partially)
- Revision 1.21 1999/05/08 20:38:03 jonas
- * seperate OPTimizer INFO pointer field in tai object
- Revision 1.20 1999/05/01 13:24:19 peter
- * merged nasm compiler
- * old asm moved to oldasm/
- Revision 1.2 1999/03/29 16:05:45 peter
- * optimizer working for ag386bin
- Revision 1.1 1999/03/26 00:01:09 peter
- * first things for optimizer (compiles but cycle crashes)
- Revision 1.19 1999/02/26 00:48:17 peter
- * assembler writers fixed for ag386bin
- Revision 1.18 1998/12/29 18:48:22 jonas
- + optimize pascal code surrounding assembler blocks
- Revision 1.17 1998/12/17 16:37:39 jonas
- + extra checks in RegsEquivalent so some more optimizations can be done (which
- where disabled by the second fix from revision 1.22)
- Revision 1.16 1998/12/02 16:23:31 jonas
- * changed "if longintvar in set" to case or "if () or () .." statements
- * tree.pas: changed inlinenumber (and associated constructor/vars) to a byte
- Revision 1.15 1998/11/24 19:47:24 jonas
- * fixed problems posiible with 3 operand instructions
- Revision 1.14 1998/11/09 19:40:48 jonas
- * fixed comments from last commit (apparently there's still a 255 char limit :( )
- Revision 1.13 1998/11/09 19:33:39 jonas
- * changed specific bugfix (which was actually wrong implemented, but
- did the right thing in most cases nevertheless) to general bugfix
- * fixed bug that caused
- mov (ebp), edx mov (ebp), edx
- mov (edx), edx mov (edx), edx
- ... being changed to ...
- mov (ebp), edx mov edx, eax
- mov (eax), eax
- but this disabled another small correct optimization...
- Revision 1.12 1998/10/20 09:32:54 peter
- * removed some unused vars
- Revision 1.11 1998/10/07 16:24:52 jonas
- * changed state to WState (WriteState), added RState for future use in
- instruction scheduling
- Revision 1.10 1998/10/02 17:29:23 jonas
- * much better interregister CSE
- Revision 1.9 1998/10/01 20:21:49 jonas
- * inter-register CSE, still requires some tweaks (peepholeoptpass2, better RegAlloc)
- Revision 1.8 1998/09/21 08:45:09 pierre
- + added vmt_offset in tobjectdef.write for fututre use
- (first steps to have objects without vmt if no virtual !!)
- + added fpu_used field for tabstractprocdef :
- sets this level to 2 if the functions return with value in FPU
- (is then set to correct value at parsing of implementation)
- THIS MIGHT refuse some code with FPU expression too complex
- that were accepted before and even in some cases
- that don't overflow in fact
- ( like if f : float; is a forward that finally in implementation
- only uses one fpu register !!)
- Nevertheless I think that it will improve security on
- FPU operations !!
- * most other changes only for UseBrowser code
- (added symtable references for record and objects)
- local switch for refs to args and local of each function
- (static symtable still missing)
- UseBrowser still not stable and probably broken by
- the definition hash array !!
- Revision 1.7 1998/09/20 17:12:35 jonas
- * small fix for uncertain optimizations & more cleaning up
- Revision 1.5 1998/09/16 17:59:59 jonas
- * optimizer now completely dependant on GetNext/GetLast instruction, works again with -dRegAlloc
- Revision 1.4 1998/08/06 19:40:27 jonas
- * removed $ before and after Log in comment
- Revision 1.3 1998/08/05 16:00:12 florian
- * some fixes for ansi strings
- * log to Log changed
- }
|