From 2f9ba77432564ca53f2c99c53c50f832ca835801 Mon Sep 17 00:00:00 2001 From: Jonas Maebe Date: Thu, 16 Apr 1998 16:53:56 +0000 Subject: [PATCH] *** empty log message *** --- compiler/aopt386.inc | 144 +-- compiler/aopt386.pas | 2166 ++++++++++++++++++++++-------------------- 2 files changed, 1225 insertions(+), 1085 deletions(-) diff --git a/compiler/aopt386.inc b/compiler/aopt386.inc index 507028d275..c34c6614f6 100644 --- a/compiler/aopt386.inc +++ b/compiler/aopt386.inc @@ -28,55 +28,6 @@ Type TwoWords = Record Word1, Word2: Word End; -Function Reg32(Reg: TRegister): TRegister; -{Returns the 32 bit component of Reg if it exists, otherwise Reg is returned} -Begin - Reg32 := Reg; - If (Reg >= R_AX) - Then - If (Reg <= R_DI) - Then Reg32 := Reg16ToReg32(Reg) - Else - If (Reg <= R_BL) - Then Reg32 := Reg8toReg32(Reg); -End; - -Function RegInRef(Reg: TRegister; Const Ref: TReference): Boolean; -Begin {checks whether Ref contains a reference to Reg} - Reg := Reg32(Reg); - RegInRef := (Ref.Base = Reg) Or (Ref.Index = Reg) -End; - -Function RegInInstruction(Reg: TRegister; p1: Pai): Boolean; -{checks if Reg is used by the instruction p1} -Var TmpResult: Boolean; -Begin - TmpResult := False; - If (Pai(p1)^.typ = ait_instruction) Then - Begin - Case Pai386(p1)^.op1t Of - Top_Reg: TmpResult := Reg = TRegister(Pai386(p1)^.op1); - Top_Ref: TmpResult := RegInRef(Reg, TReference(Pai386(p1)^.op1^)) - End; - If Not(TmpResult) Then - Case Pai386(p1)^.op2t Of - Top_Reg: - if Pai386(p1)^.op3t<>Top_reg - then TmpResult := Reg = TRegister(Pai386(p1)^.op2) - else TmpResult := longint(Reg) = twowords(Pai386(p1)^.op2).word1; - Top_Ref: TmpResult := RegInRef(Reg, TReference(Pai386(p1)^.op2^)) - End; - If Not(TmpResult) Then - Case Pai386(p1)^.op3t Of - Top_Reg: TmpResult := longint(Reg) =twowords(Pai386(p1)^.op2).word2; - Top_none:; - else - internalerror($Da); - End - End; - RegInInstruction := TmpResult -End; - Procedure ReloadOpt(AsmL: PaasmOutput); Const MaxCh = 3; @@ -638,13 +589,18 @@ Function InstructionsEqual(p1, p2: Pai): Boolean; Begin {checks whether two Pai386 instructions are equal} InstructionsEqual := Assigned(p1) And Assigned(p2) And - (Pai(p1)^.typ = ait_instruction) And - (Pai(p1)^.typ = ait_instruction) And - (Pai386(p1)^._operator = Pai386(p2)^._operator) And - (Pai386(p1)^.op1t = Pai386(p2)^.op1t) And - (Pai386(p1)^.op2t = Pai386(p2)^.op2t) And - OpsEqual(Pai386(p1)^.op1t, Pai386(p1)^.op1, Pai386(p2)^.op1) And - OpsEqual(Pai386(p1)^.op2t, Pai386(p1)^.op2, Pai386(p2)^.op2) + ((((Pai(p1)^.typ = ait_regalloc) And + (Pai(p2)^.typ = ait_regalloc)) Or + ((Pai(p1)^.typ = ait_regdealloc) And + (Pai(p2)^.typ = ait_regdealloc))) And + (PaiRegAlloc(p1)^.reg = PaiRegAlloc(p2)^.reg)) Or + ((Pai(p1)^.typ = ait_instruction) And + (Pai(p1)^.typ = ait_instruction) And + (Pai386(p1)^._operator = Pai386(p2)^._operator) And + (Pai386(p1)^.op1t = Pai386(p2)^.op1t) And + (Pai386(p1)^.op2t = Pai386(p2)^.op2t) And + OpsEqual(Pai386(p1)^.op1t, Pai386(p1)^.op1, Pai386(p2)^.op1) And + OpsEqual(Pai386(p1)^.op2t, Pai386(p1)^.op2, Pai386(p2)^.op2)) End; Function CheckSequence(p: Pai; Reg: TRegister; Var Found: Longint): Boolean; @@ -739,15 +695,15 @@ End; Begin {CheckSequence} Reg := Reg32(Reg); Found := 0; - hp2 := p; - hp3 := PPaiProp(Pai(p^.last)^.line)^.Regs[Reg].StartMod; + hp2 := PPaiProp(Pai(p^.last)^.line)^.Regs[Reg].StartMod; + hp3 := p; EndMod := PPaiProp(Pai(p^.last)^.line)^.Regs[Reg].StartMod; RegsNotYetChecked := [R_EAX..R_EDI]; For Counter := 2 to PPaiProp(Pai(p^.last)^.line)^.Regs[Reg].NrOfMods Do EndMod := Pai(EndMod^.Next); While (Found <> PPaiProp(Pai(p^.last)^.line)^.Regs[Reg].NrOfMods) And InstructionsEqual(hp2, hp3) And - NoChangedRegInRef(EndMod, hp2) Do + NoChangedRegInRef(EndMod, hp3) Do Begin hp2 := Pai(hp2^.next); hp3 := Pai(hp3^.next); @@ -756,8 +712,63 @@ Begin {CheckSequence} If (Found <> PPaiProp(Pai(p^.last)^.line)^.Regs[Reg].NrOfMods) Then Begin - CheckSequence := False; - If (found > 0) then + If ((Found+1) = PPaiProp(Pai(p^.last)^.line)^.Regs[Reg].NrOfMods) And + Assigned(hp2) And + (Pai(hp2)^.typ = ait_instruction) And + (Pai386(hp2)^._operator In [A_MOV, A_MOVZX]) And + (Pai386(hp2)^.op1t = top_ref) And + (Pai386(hp2)^.op2t = top_reg) And + Assigned(hp3) And + (Pai(hp3)^.typ = ait_instruction) And + (Pai386(hp3)^._operator In [A_MOV, A_MOVZX]) And + (Pai386(hp3)^.op1t = top_ref) And + (Pai386(hp3)^.op2t = top_reg) And + (Pai386(hp2)^._operator <> Pai386(hp3)^._operator) And + RefsEqual(TReference(Pai386(hp2)^.op1^),TReference(Pai386(hp3)^.op1^)) And + NoChangedRegInRef(EndMod, hp3) + Then + If (Pai386(hp2)^._operator = A_MOV) + Then + Begin + If (Pai386(hp2)^.Size = S_B) And + (Reg8toReg32(TRegister(Pai386(hp2)^.op2)) = + TRegister(Pai386(hp3)^.op2)) + Then + Begin + Pai386(hp2)^._operator := A_MOVZX; + Pai386(hp2)^.op2 := Pai386(hp3)^.op2; + Pai386(hp2)^.Size := S_BL; + Inc(Found); + CheckSequence := True; + End + Else + Begin + CheckSequence := False; + If (Found > 0) Then + Found := PPaiProp(Pai(p)^.line)^.Regs[Reg].NrOfMods + End + End + Else + Begin + If (Pai386(hp3)^.Size = S_B) And + (Reg8toReg32(TRegister(Pai386(hp3)^.op2)) = + TRegister(Pai386(hp2)^.op2)) + Then + Begin + CheckSequence := True; + Inc(Found) + End + Else + Begin + CheckSequence := False; + If (Found > 0) Then + Found := PPaiProp(Pai(p)^.line)^.Regs[Reg].NrOfMods + End + End + Else + Begin + CheckSequence := 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, or can't have to be turned off). @@ -766,7 +777,8 @@ Begin {CheckSequence} 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)^.line)^.Regs[Reg].NrOfMods + Found := PPaiProp(Pai(p)^.line)^.Regs[Reg].NrOfMods + End End Else CheckSequence := True; End; {CheckSequence} @@ -821,6 +833,7 @@ Begin ait_label: DestroyAllRegs(p); ait_labeled_instruction, ait_stabs, ait_stabn, ait_stab_function_name:; {nothing changes} + ait_regalloc, ait_regdealloc:; ait_instruction: Begin InstrProp := AsmInstr[Pai386(p)^._operator]; @@ -984,7 +997,7 @@ Begin (PPaiProp(Pai(p^.last)^.line)^.DirFlag = F_NotSet) Then PPaiProp(Pai(p)^.line)^.CanBeRemoved := True; {$IfDef OptimizeMovs} - A_MOV{, A_MOVZX, A_MOVSX}: + A_MOV, A_MOVZX, A_MOVSX: Begin Case Pai386(p)^.op1t Of { Top_Reg: @@ -1178,7 +1191,10 @@ End; { $Log$ - Revision 1.2 1998-04-06 22:42:32 jonas + Revision 1.3 1998-04-16 16:53:56 jonas + *** empty log message *** + + Revision 1.2 1998/04/06 22:42:32 jonas + removal of superflouos cld/std instructions Revision 1.1.1.1 1998/03/25 11:18:12 root diff --git a/compiler/aopt386.pas b/compiler/aopt386.pas index fe266ed83f..d164a20ddc 100644 --- a/compiler/aopt386.pas +++ b/compiler/aopt386.pas @@ -40,6 +40,11 @@ Unit aopt386; {$endif} ; + {ait_* types which don't result in executable code or which don't + influence the way the program runs/behaves} + Const SkipInstr = [ait_comment,ait_stabs, ait_stabn, ait_stab_function_name, + ait_regalloc, ait_regdealloc]; + Type {$ifdef tp} TLabelTable = Array[0..10000] Of Pai; @@ -47,6 +52,10 @@ Unit aopt386; TLabelTable = Array[0..2500000] Of Pai; {$endif} PLabelTable = ^TLabelTable; + twowords=record + word1,word2:word; + end; + Var LoLab, HiLab, LabDif: Longint; LTable: PLabelTable; @@ -68,9 +77,92 @@ Var LoLab, HiLab, LabDif: Longint; Else RefsEqual := False; end; +Function Reg32(Reg: TRegister): TRegister; +{Returns the 32 bit component of Reg if it exists, otherwise Reg is returned} +Begin + Reg32 := Reg; + If (Reg >= R_AX) + Then + If (Reg <= R_DI) + Then Reg32 := Reg16ToReg32(Reg) + Else + If (Reg <= R_BL) + Then Reg32 := Reg8toReg32(Reg); +End; + +Function RegInRef(Reg: TRegister; Const Ref: TReference): Boolean; +Begin {checks whether Ref contains a reference to Reg} + Reg := Reg32(Reg); + RegInRef := (Ref.Base = Reg) Or (Ref.Index = Reg) +End; + +Function RegInInstruction(Reg: TRegister; p1: Pai): Boolean; +{checks if Reg is used by the instruction p1} +Var TmpResult: Boolean; +Begin + TmpResult := False; + If (Pai(p1)^.typ = ait_instruction) Then + Begin + Case Pai386(p1)^.op1t Of + Top_Reg: TmpResult := Reg = TRegister(Pai386(p1)^.op1); + Top_Ref: TmpResult := RegInRef(Reg, TReference(Pai386(p1)^.op1^)) + End; + If Not(TmpResult) Then + Case Pai386(p1)^.op2t Of + Top_Reg: + if Pai386(p1)^.op3t<>Top_reg + then TmpResult := Reg = TRegister(Pai386(p1)^.op2) + else TmpResult := longint(Reg) = twowords(Pai386(p1)^.op2).word1; + Top_Ref: TmpResult := RegInRef(Reg, TReference(Pai386(p1)^.op2^)) + End; + If Not(TmpResult) Then + Case Pai386(p1)^.op3t Of + Top_Reg: TmpResult := longint(Reg) =twowords(Pai386(p1)^.op2).word2; + Top_none:; + else + internalerror($Da); + End + End; + RegInInstruction := TmpResult +End; + {$i aopt386.inc} {aopt386.inc contains the reloading optimizer} + Function GetNextInstruction(Current: Pai; Var Next: Pai): Boolean; + {skips ait_regalloc, ait_regdealloc and ait_stab* objects and puts the + next pai object in Next. Returns false if there isn't any} + Begin + GetNextInstruction := False; + Current := Pai(Current^.Next); + While Assigned(Current) And + (Pai(Current)^.typ In SkipInstr) Do + Current := Pai(Current^.Next); + If Assigned(Current) + Then + Begin + Next := Current; + GetNextInstruction := True; + End; + End; + + Function GetLastInstruction(Current: Pai; Var Last: Pai): Boolean; + {skips ait_regalloc, ait_regdealloc and ait_stab* objects and puts the + last pai object in Last. Returns false if there isn't any} + Begin + GetLastInstruction := False; + Current := Pai(Current^.Last); + While Assigned(Current) And + (Pai(Current)^.typ In SkipInstr) Do + Current := Pai(Current^.Last); + If Assigned(Current) + Then + Begin + Last := Current; + GetLastInstruction := True; + End; + End; + Function FindLabel(L: PLabel; Var hp: Pai): Boolean; {searches for the specified label starting from hp as long as the @@ -85,7 +177,8 @@ Var LoLab, HiLab, LabDif: Longint; Begin TempP := hp; - While Assigned(TempP) and (pai(TempP)^.typ = ait_label) Do + While Assigned(TempP) and + (pai(TempP)^.typ In SkipInstr + [ait_label]) Do If (pai_label(TempP)^.l <> L) Then TempP := Pai(TempP^.next) Else @@ -114,6 +207,7 @@ Var LoLab, HiLab, LabDif: Longint; TmpRef: PReference; + RegsUsed: Set of TRegister; { inserts new_one between prev and foll } Procedure InsertLLItem(prev, foll, new_one: PLinkedList_Item); @@ -135,18 +229,6 @@ Var LoLab, HiLab, LabDif: Longint; Else If Assigned(Foll) Then AsmL^.Insert(new_one) End; - - Function GetNextInstr(hp: Pai): Pai; - {skips all labels and returns the next "real" instruction; it is assumed - that hp is of the type ait_label} - Begin - While assigned(hp^.next) and (pai(hp^.next)^.typ = ait_label) Do - hp := pai(hp^.next); - If assigned(hp^.next) - Then GetNextInstr := pai(hp^.next) - Else GetNextInstr := hp; - End; - Procedure GetFinalDestination(hp: pai_labeled); {traces sucessive jumps to their final destination and sets it, e.g. je l1 je l3 @@ -159,13 +241,25 @@ Var LoLab, HiLab, LabDif: Longint; Var p1: pai; + Function SkipLabels(hp: Pai): Pai; + {skips all labels and returns the next "real" instruction; it is + assumed that hp is of the type ait_label} + Begin + While assigned(hp^.next) and + (pai(hp^.next)^.typ In SkipInstr + [ait_label]) Do + hp := pai(hp^.next); + If assigned(hp^.next) + Then SkipLabels := pai(hp^.next) + Else SkipLabels := hp; + End; + Begin If (hp^.lab^.nb >= LoLab) and (hp^.lab^.nb <= HiLab) and {range check, necessary?} (Pointer(LTable^[hp^.lab^.nb-LoLab]) <> Pointer(0)) Then Begin p1 := LTable^[hp^.lab^.nb-LoLab]; {the jump's destination} - p1 := GetNextInstr(p1); + p1 := SkipLabels(p1); If (pai(p1)^.typ = ait_labeled_instruction) and ((pai_labeled(p1)^._operator = A_JMP) or (pai_labeled(p1)^._operator = hp^._operator)) @@ -189,922 +283,938 @@ Var LoLab, HiLab, LabDif: Longint; Else IsGP32reg := False End; - type twowords=record - word1,word2:word; - end; - begin p:=pai(asml^.first); + RegsUsed := []; while assigned(p) do begin - if (p^.typ=ait_labeled_instruction) then - begin + Case p^.typ Of + ait_labeled_instruction: + begin {the following if-block removes all code between a jmp and the next label, because it can never be executed} - If (pai_labeled(p)^._operator = A_JMP) Then - Begin - hp1 := pai(p^.next); - While Assigned(hp1) and (hp1^.typ <> ait_label) Do - Begin - AsmL^.Remove(hp1); - Dispose(hp1, done); - hp1 := pai(p^.next); - End; - End; - if (assigned(p^.next)) then - begin - hp2 := pai(p^.next^.next); - if (pai(p^.next)^.typ=ait_labeled_instruction) and - (pai_labeled(p^.next)^._operator=A_JMP) and - FindLabel(pai_labeled(p)^.lab, hp2) then - begin - case pai_labeled(p)^._operator of - A_JE : pai_labeled(p)^._operator:=A_JNE; - A_JNE : pai_labeled(p)^._operator:=A_JE; - A_JL : pai_labeled(p)^._operator:=A_JGE; - A_JG : pai_labeled(p)^._operator:=A_JLE; - A_JLE : pai_labeled(p)^._operator:=A_JG; - A_JGE : pai_labeled(p)^._operator:=A_JL; - A_JNZ : pai_labeled(p)^._operator:=A_JZ; - A_JNO : pai_labeled(p)^._operator:=A_JO; - A_JZ : pai_labeled(p)^._operator:=A_JNZ; - A_JS : pai_labeled(p)^._operator:=A_JNS; - A_JNS : pai_labeled(p)^._operator:=A_JS; - A_JO : pai_labeled(p)^._operator:=A_JNO; - A_JC : pai_labeled(p)^._operator:=A_JNC; - A_JNC : pai_labeled(p)^._operator:=A_JC; - A_JA : pai_labeled(p)^._operator:=A_JBE; - A_JAE : pai_labeled(p)^._operator:=A_JB; - A_JB : pai_labeled(p)^._operator:=A_JAE; - A_JBE : pai_labeled(p)^._operator:=A_JA; - else + If (pai_labeled(p)^._operator = A_JMP) Then + Begin + hp1 := pai(p^.next); + While Assigned(hp1) and (hp1^.typ <> ait_label) Do + Begin + AsmL^.Remove(hp1); + Dispose(hp1, done); + hp1 := pai(p^.next); + End; + End; + if GetNextInstruction(p, hp1) then + begin +{ hp2 := pai(p^.next^.next);} + if (pai(hp1)^.typ=ait_labeled_instruction) and + (pai_labeled(hp1)^._operator=A_JMP) and + GetNextInstruction(hp1, hp2) And + FindLabel(pai_labeled(p)^.lab, hp2) + then + begin + case pai_labeled(p)^._operator of + A_JE : pai_labeled(p)^._operator:=A_JNE; + A_JNE : pai_labeled(p)^._operator:=A_JE; + A_JL : pai_labeled(p)^._operator:=A_JGE; + A_JG : pai_labeled(p)^._operator:=A_JLE; + A_JLE : pai_labeled(p)^._operator:=A_JG; + A_JGE : pai_labeled(p)^._operator:=A_JL; + A_JNZ : pai_labeled(p)^._operator:=A_JZ; + A_JNO : pai_labeled(p)^._operator:=A_JO; + A_JZ : pai_labeled(p)^._operator:=A_JNZ; + A_JS : pai_labeled(p)^._operator:=A_JNS; + A_JNS : pai_labeled(p)^._operator:=A_JS; + A_JO : pai_labeled(p)^._operator:=A_JNO; + A_JC : pai_labeled(p)^._operator:=A_JNC; + A_JNC : pai_labeled(p)^._operator:=A_JC; + A_JA : pai_labeled(p)^._operator:=A_JBE; + A_JAE : pai_labeled(p)^._operator:=A_JB; + A_JB : pai_labeled(p)^._operator:=A_JAE; + A_JBE : pai_labeled(p)^._operator:=A_JA; + else + begin + If (LabDif <> 0) Then GetFinalDestination(pai_labeled(p)); + p:=pai(p^.next); + continue; + end; + end; + Dec(pai_label(hp2)^.l^.refcount); + If (pai_label(hp2)^.l^.refcount = 0) Then + Begin + pai_label(hp2)^.l^.is_used := False; + AsmL^.remove(hp2); + Dispose(hp2, done); + End; + pai_labeled(p)^.lab:=pai_labeled(hp1)^.lab; + Inc(pai_labeled(p)^.lab^.refcount); +{ hp1:=pai(p^.next);} + asml^.remove(hp1); + dispose(hp1,done); + If (LabDif <> 0) Then GetFinalDestination(pai_labeled(p)); + end + else + Begin +{ hp2:=pai(p^.next);} + if FindLabel(pai_labeled(p)^.lab, hp1) then begin - If (LabDif <> 0) Then GetFinalDestination(pai_labeled(p)); - p:=pai(p^.next); + hp2:=pai(hp1^.next); + asml^.remove(p); + dispose(p,done); + If Not(pai_label(hp1)^.l^.is_used) Then + Begin + AsmL^.remove(hp1); + Dispose(hp1, done); + End; + p:=hp2; continue; end; + If (LabDif <> 0) Then GetFinalDestination(pai_labeled(p)); end; - Dec(pai_label(hp2)^.l^.refcount); - If (pai_label(hp2)^.l^.refcount = 0) Then - Begin - pai_label(hp2)^.l^.is_used := False; - AsmL^.remove(hp2); - Dispose(hp2, done); - End; - pai_labeled(p)^.lab:=pai_labeled(p^.next)^.lab; - Inc(pai_labeled(p)^.lab^.refcount); - hp1:=pai(p^.next); - asml^.remove(hp1); - dispose(hp1,done); - If (LabDif <> 0) Then GetFinalDestination(pai_labeled(p)); - end - else - Begin - hp2:=pai(p^.next); - if FindLabel(pai_labeled(p)^.lab, hp2) then - begin - hp1:=pai(hp2^.next); - asml^.remove(p); - dispose(p,done); - If Not(pai_label(hp2)^.l^.is_used) Then - Begin - AsmL^.remove(hp2); - Dispose(hp2, done); - End; - p:=hp1; - continue; - end; - If (LabDif <> 0) Then GetFinalDestination(pai_labeled(p)); - end; - end - end - else - if p^.typ=ait_instruction - Then - Begin - If (Pai386(p)^.op1t = top_ref) Then - With TReference(Pai386(p)^.op1^) Do - Begin - If (base = R_NO) And - (scalefactor = 1) - Then - Begin - base := index; - index := r_no - End - End; - If (Pai386(p)^.op2t = top_ref) Then - With TReference(Pai386(p)^.op2^) Do - Begin - If (base = R_NO) And - (scalefactor = 1) - Then - Begin - base := index; - index := r_no - End - End; - Case Pai386(p)^._operator Of - A_AND: - Begin - If (Pai386(p)^.op1t = top_const) And - (Pai386(p)^.op2t = top_reg) And - Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_instruction) And - (Pai386(p^.next)^._operator = A_AND) And - (Pai386(p^.next)^.op1t = top_const) And - (Pai386(p^.next)^.op2t = top_reg) And - (Pai386(p)^.op2 = Pai386(p^.next)^.op2) - Then + end + end; + ait_instruction: + Begin + If (Pai386(p)^.op1t = top_ref) Then + With TReference(Pai386(p)^.op1^) Do + Begin + If (base = R_NO) And + (scalefactor = 1) + Then + Begin + base := index; + index := r_no + End + End; + If (Pai386(p)^.op2t = top_ref) Then + With TReference(Pai386(p)^.op2^) Do + Begin + If (base = R_NO) And + (scalefactor = 1) + Then + Begin + base := index; + index := r_no + End + End; + Case Pai386(p)^._operator Of + A_AND: + Begin + If (Pai386(p)^.op1t = top_const) And + (Pai386(p)^.op2t = top_reg) And +{ Assigned(p^.next) And} + GetNextInstruction(p, hp1) And + (Pai(hp1)^.typ = ait_instruction) And + (Pai386(hp1)^._operator = A_AND) And + (Pai386(hp1)^.op1t = top_const) And + (Pai386(hp1)^.op2t = top_reg) And + (Pai386(hp1)^.op2 = Pai386(hp1)^.op2) + Then {change "and const1, reg; and const2, reg" to "and (const1 and const2), reg"} - Begin - Pai386(p)^.op1 := Pointer(Longint(Pai386(p)^.op1) And Longint(Pai386(p^.next)^.op1)); - hp1 := Pai(p^.next); - AsmL^.Remove(hp1); - Dispose(hp1, Done) - End; - { - Else - If (Pai386(p)^.op2t = top_reg) And - Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_labeled_instruction) - Then Pai386(p)^._operator := A_TEST; - change "and x, reg; jxx" to "test x, reg - } - End; - A_CMP: + Begin + Pai386(p)^.op1 := Pointer(Longint(Pai386(p)^.op1) And Longint(Pai386(hp1)^.op1)); +{ hp1 := Pai(p^.next);} + AsmL^.Remove(hp1); + Dispose(hp1, Done) + End; + { + Else + If (Pai386(p)^.op2t = top_reg) And + Assigned(p^.next) And + (Pai(p^.next)^.typ = ait_labeled_instruction) + Then Pai386(p)^._operator := A_TEST; + change "and x, reg; jxx" to "test x, reg + } + End; + A_CMP: + Begin + If (Pai386(p)^.op1t = top_const) And + (Pai386(p)^.op2t = top_reg) And + (Pai386(p)^.op1 = Pointer(0)) Then + {change "cmp $0, %reg" to "test %reg, %reg"} Begin - If (Pai386(p)^.op1t = top_const) And - (Pai386(p)^.op2t = top_reg) And - (Pai386(p)^.op1 = Pointer(0)) Then - {change "cmp $0, %reg" to "test %reg, %reg"} - Begin - Pai386(p)^._operator := A_TEST; - Pai386(p)^.opxt := Top_reg+Top_reg shl 4; - Pai386(p)^.op1 := Pai386(p)^.op2; - End; + Pai386(p)^._operator := A_TEST; + Pai386(p)^.opxt := Top_reg+Top_reg shl 4; + Pai386(p)^.op1 := Pai386(p)^.op2; End; - A_FSTP: - Begin - If (Pai386(p)^.op1t = top_ref) And - Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_instruction) And - (Pai386(p^.next)^._operator = A_FLD) And - (Pai386(p^.next)^.op1t = top_ref) And - (Pai386(p)^.Size = Pai386(p)^.Size) And - RefsEqual(TReference(Pai386(p)^.op1^), TReference(Pai386(p^.next)^.op1^)) - Then - Begin - hp1 := pai(p^.next^.next); - If Assigned(hp1) And - (hp1^.typ = ait_instruction) And - ((Pai386(hp1)^._operator = A_LEAVE) Or - (Pai386(hp1)^._operator = A_RET)) And - (TReference(Pai386(p)^.op1^).Base = ProcInfo.FramePointer) And - (TReference(Pai386(p)^.op1^).Offset >= ProcInfo.RetOffset) And - (TReference(Pai386(p)^.op1^).Index = R_NO) - Then - Begin - hp2 := Pai(p^.next); - AsmL^.Remove(p); - AsmL^.Remove(hp2); - Dispose(p, Done); - Dispose(hp2, Done); - p := hp1; - Continue - End - Else - Begin - Pai386(p)^._operator := A_FST; - hp1 := Pai(p^.next); - AsmL^.Remove(hp1); - Dispose(hp1, done) - End - End; - End; - A_IMUL: - {changes certain "imul const, %reg"'s to lea sequences} - Begin - If (Pai386(p)^.op1t = Top_Const) And - (Pai386(p)^.op2t = Top_Reg) And - (Pai386(p)^.Size = S_L) And - ((Pai386(p)^.op3t = Top_Reg) or - (Pai386(p)^.op3t = Top_None)) And - (Opt_Processors < PentiumPro) And - (Longint(Pai386(p)^.op1) <= 12) And - Not(CS_LittleSize in AktSwitches) And - ((Assigned(p^.next) And - Not((Pai(p^.next)^.typ = ait_labeled_instruction) And - ((pai_labeled(p^.next)^._operator = A_JO) or - (pai_labeled(p^.next)^._operator = A_JNO)))) or - Not(Assigned(p^.next))) Then - Begin - New(TmpRef); - TmpRef^.segment := R_DEFAULT_SEG; - TmpRef^.symbol := nil; - TmpRef^.isintvalue := false; - TmpRef^.offset := 0; - Case Longint(Pai386(p)^.op1) Of - 3: Begin - {imul 3, reg1, reg2 to - lea (reg1,reg1,2), reg2 - imul 3, reg1 to - lea (reg1,reg1,2), reg1} - TmpRef^.base := TRegister(Pai386(p)^.op2); - TmpRef^.Index := TRegister(Pai386(p)^.op2); - TmpRef^.ScaleFactor := 2; - If (Pai386(p)^.op3t = Top_None) - Then hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, TRegister(Pai386(p)^.op2))) - Else hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, - TRegister(twowords(Pai386(p)^.op2).word2))); - hp1^.line := p^.line; - InsertLLItem(p^.last, p^.next, hp1); - Dispose(p, Done); - p := hp1; + End; + A_FSTP: + Begin + If (Pai386(p)^.op1t = top_ref) And +{ Assigned(p^.next) And} + GetNextInstruction(p, hp1) And + (Pai(hp1)^.typ = ait_instruction) And + (Pai386(hp1)^._operator = A_FLD) And + (Pai386(hp1)^.op1t = top_ref) And + (Pai386(p)^.Size = Pai386(p)^.Size) And + RefsEqual(TReference(Pai386(p)^.op1^), TReference(Pai386(hp1)^.op1^)) + Then + Begin +{ hp1 := pai(p^.next^.next);} + If {Assigned(hp1) And} + GetNextInstruction(hp1, hp2) And + (hp2^.typ = ait_instruction) And + ((Pai386(hp2)^._operator = A_LEAVE) Or + (Pai386(hp2)^._operator = A_RET)) And + (TReference(Pai386(p)^.op1^).Base = ProcInfo.FramePointer) And + (TReference(Pai386(p)^.op1^).Offset >= ProcInfo.RetOffset) And + (TReference(Pai386(p)^.op1^).Index = R_NO) + Then + Begin +{ hp2 := Pai(p^.next);} + AsmL^.Remove(p); + AsmL^.Remove(hp1); + Dispose(p, Done); + Dispose(hp1, Done); + p := hp2; + Continue + End + Else + Begin + Pai386(p)^._operator := A_FST; +{ hp1 := Pai(p^.next);} + AsmL^.Remove(hp1); + Dispose(hp1, done) + End + End; + End; + A_IMUL: + {changes certain "imul const, %reg"'s to lea sequences} + Begin + If (Pai386(p)^.op1t = Top_Const) And + (Pai386(p)^.op2t = Top_Reg) And + (Pai386(p)^.Size = S_L) And + ((Pai386(p)^.op3t = Top_Reg) or + (Pai386(p)^.op3t = Top_None)) And + (Opt_Processors < PentiumPro) And + (Longint(Pai386(p)^.op1) <= 12) And + Not(CS_LittleSize in AktSwitches) And + (Not(GetNextInstruction(p, hp1)) Or + {GetNextInstruction(p, hp1) And} + Not((Pai(hp1)^.typ = ait_labeled_instruction) And + ((pai_labeled(hp1)^._operator = A_JO) or + (pai_labeled(hp1)^._operator = A_JNO)))) + Then + Begin + New(TmpRef); + TmpRef^.segment := R_DEFAULT_SEG; + TmpRef^.symbol := nil; + TmpRef^.isintvalue := false; + TmpRef^.offset := 0; + Case Longint(Pai386(p)^.op1) Of + 3: Begin + {imul 3, reg1, reg2 to + lea (reg1,reg1,2), reg2 + imul 3, reg1 to + lea (reg1,reg1,2), reg1} + TmpRef^.base := TRegister(Pai386(p)^.op2); + TmpRef^.Index := TRegister(Pai386(p)^.op2); + TmpRef^.ScaleFactor := 2; + If (Pai386(p)^.op3t = Top_None) + Then hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, TRegister(Pai386(p)^.op2))) + Else hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, + TRegister(twowords(Pai386(p)^.op2).word2))); + hp1^.line := p^.line; + InsertLLItem(p^.last, p^.next, hp1); + Dispose(p, Done); + p := hp1; + End; + 5: Begin + {imul 5, reg1, reg2 to + lea (reg1,reg1,4), reg2 + imul 5, reg1 to + lea (reg1,reg1,4), reg1} + TmpRef^.base := TRegister(Pai386(p)^.op2); + TmpRef^.Index := TRegister(Pai386(p)^.op2); + TmpRef^.ScaleFactor := 4; + If (Pai386(p)^.op3t = Top_None) + Then hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, TRegister(Pai386(p)^.op2))) + Else hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, + TRegister(twowords(Pai386(p)^.op2).word2))); + hp1^.line:= p^.line; + InsertLLItem(p^.last, p^.next, hp1); + Dispose(p, Done); + p := hp1; + End; + 6: Begin + {imul 6, reg1, reg2 to + lea (,reg1,2), reg2 + lea (reg2,reg1,4), reg2 + imul 6, reg1 to + lea (reg1,reg1,2), reg1 + add reg1, reg1} + If (Opt_Processors <= i486) + Then + Begin + TmpRef^.Index := TRegister(Pai386(p)^.op2); + If (Pai386(p)^.op3t = Top_Reg) + Then + Begin + TmpRef^.base := TRegister(twowords(Pai386(p)^.op2).word2); + TmpRef^.ScaleFactor := 4; + hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, + TRegister(twowords(Pai386(p)^.op2).word2))); + End + Else + Begin + Dispose(TmpRef); + hp1 := New(Pai386, op_reg_reg(A_ADD, S_L, + TRegister(Pai386(p)^.op2),TRegister(Pai386(p)^.op2))); + End; + hp1^.line := p^.line; + InsertLLItem(p, p^.next, hp1); + New(TmpRef); + TmpRef^.segment := R_DEFAULT_SEG; + TmpRef^.symbol := nil; + TmpRef^.isintvalue := false; + TmpRef^.offset := 0; + TmpRef^.Index := TRegister(Pai386(p)^.op2); + TmpRef^.ScaleFactor := 2; + If (Pai386(p)^.op3t = Top_Reg) + Then + Begin + TmpRef^.base := R_NO; + hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, + TRegister(twowords(Pai386(p)^.op2).word2))); + End + Else + Begin + TmpRef^.base := TRegister(Pai386(p)^.op2); + hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, TRegister(Pai386(p)^.op2))); + End; + hp1^.line := p^.line; + InsertLLItem(p^.last, p^.next, hp1); + Dispose(p, Done); + p := Pai(hp1^.next); + End + Else Dispose(TmpRef); + End; + 9: Begin + {imul 9, reg1, reg2 to + lea (reg1,reg1,8), reg2 + imul 9, reg1 to + lea (reg1,reg1,8), reg1} + TmpRef^.base := TRegister(Pai386(p)^.op2); + TmpRef^.Index := TRegister(Pai386(p)^.op2); + TmpRef^.ScaleFactor := 8; + If (Pai386(p)^.op3t = Top_None) + Then hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, TRegister(Pai386(p)^.op2))) + Else hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, + TRegister(twowords(Pai386(p)^.op2).word2))); + hp1^.line := p^.line; + InsertLLItem(p^.last, p^.next, hp1); + Dispose(p, Done); + p := hp1; End; - 5: Begin - {imul 5, reg1, reg2 to - lea (reg1,reg1,4), reg2 - imul 5, reg1 to - lea (reg1,reg1,4), reg1} - TmpRef^.base := TRegister(Pai386(p)^.op2); - TmpRef^.Index := TRegister(Pai386(p)^.op2); - TmpRef^.ScaleFactor := 4; - If (Pai386(p)^.op3t = Top_None) - Then hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, TRegister(Pai386(p)^.op2))) - Else hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, - TRegister(twowords(Pai386(p)^.op2).word2))); - hp1^.line:= p^.line; - InsertLLItem(p^.last, p^.next, hp1); - Dispose(p, Done); - p := hp1; - End; - 6: Begin - {imul 6, reg1, reg2 to - lea (,reg1,2), reg2 - lea (reg2,reg1,4), reg2 - imul 6, reg1 to - lea (reg1,reg1,2), reg1 - add reg1, reg1} - If (Opt_Processors <= i486) Then - Begin - TmpRef^.Index := TRegister(Pai386(p)^.op2); - If (Pai386(p)^.op3t = Top_Reg) - Then - Begin - TmpRef^.base := TRegister(twowords(Pai386(p)^.op2).word2); - TmpRef^.ScaleFactor := 4; - hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, - TRegister(twowords(Pai386(p)^.op2).word2))); - End - Else - Begin - Dispose(TmpRef); - hp1 := New(Pai386, op_reg_reg(A_ADD, S_L, - TRegister(Pai386(p)^.op2),TRegister(Pai386(p)^.op2))); - End; - hp1^.line := p^.line; - InsertLLItem(p, p^.next, hp1); - New(TmpRef); - TmpRef^.segment := R_DEFAULT_SEG; - TmpRef^.symbol := nil; - TmpRef^.isintvalue := false; - TmpRef^.offset := 0; - TmpRef^.Index := TRegister(Pai386(p)^.op2); - TmpRef^.ScaleFactor := 2; - If (Pai386(p)^.op3t = Top_Reg) - Then - Begin - TmpRef^.base := R_NO; - hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, - TRegister(twowords(Pai386(p)^.op2).word2))); - End - Else - Begin - TmpRef^.base := TRegister(Pai386(p)^.op2); - hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, TRegister(Pai386(p)^.op2))); - End; - hp1^.line := p^.line; - InsertLLItem(p^.last, p^.next, hp1); - Dispose(p, Done); - p := Pai(hp1^.next); - End - Else Dispose(TmpRef); - End; - 9: Begin - {imul 9, reg1, reg2 to - lea (reg1,reg1,8), reg2 - imul 9, reg1 to - lea (reg1,reg1,8), reg1} - TmpRef^.base := TRegister(Pai386(p)^.op2); - TmpRef^.Index := TRegister(Pai386(p)^.op2); - TmpRef^.ScaleFactor := 8; - If (Pai386(p)^.op3t = Top_None) - Then hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, TRegister(Pai386(p)^.op2))) - Else hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, - TRegister(twowords(Pai386(p)^.op2).word2))); - hp1^.line := p^.line; - InsertLLItem(p^.last, p^.next, hp1); - Dispose(p, Done); - p := hp1; - End; - 10: Begin - {imul 10, reg1, reg2 to - lea (reg1,reg1,4), reg2 - add reg2, reg2 - imul 10, reg1 to - lea (reg1,reg1,4), reg1 - add reg1, reg1} - If (Opt_Processors <= i486) Then - Begin - If (Pai386(p)^.op3t = Top_Reg) - Then - hp1 := New(Pai386, op_reg_reg(A_ADD, S_L, - Tregister(twowords(Pai386(p)^.op2).word2), - Tregister(twowords(Pai386(p)^.op2).word2))) - Else hp1 := New(Pai386, op_reg_reg(A_ADD, S_L, - TRegister(Pai386(p)^.op2), TRegister(Pai386(p)^.op2))); - hp1^.line := p^.line; - InsertLLItem(p, p^.next, hp1); - TmpRef^.base := TRegister(Pai386(p)^.op2); - TmpRef^.Index := TRegister(Pai386(p)^.op2); - TmpRef^.ScaleFactor := 4; - If (Pai386(p)^.op3t = Top_Reg) - Then - hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, - TRegister(twowords(Pai386(p)^.op2).word2))) - Else - hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, - TRegister(Pai386(p)^.op2))); - hp1^.line := p^.line; - InsertLLItem(p^.last, p^.next, hp1); - Dispose(p, Done); - p := Pai(hp1^.next); - End - Else Dispose(TmpRef); - End; - 12: Begin - {imul 12, reg1, reg2 to - lea (,reg1,4), reg2 - lea (,reg1,8) reg2 - imul 12, reg1 to - lea (reg1,reg1,2), reg1 - lea (,reg1,4), reg1} - If (Opt_Processors <= i486) Then - Begin - TmpRef^.Index := TRegister(Pai386(p)^.op2); - If (Pai386(p)^.op3t = Top_Reg) - Then - Begin - TmpRef^.base := TRegister(twowords(Pai386(p)^.op2).word2); - TmpRef^.ScaleFactor := 8; - hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, - TRegister(twowords(Pai386(p)^.op2).word2))); - End - Else - Begin - TmpRef^.base := R_NO; - TmpRef^.ScaleFactor := 4; - hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, - TRegister(Pai386(p)^.op2))); - End; - hp1^.line := p^.line; - InsertLLItem(p, p^.next, hp1); - New(TmpRef); - TmpRef^.segment := R_DEFAULT_SEG; - TmpRef^.symbol := nil; - TmpRef^.isintvalue := false; - TmpRef^.offset := 0; - TmpRef^.Index := TRegister(Pai386(p)^.op2); - If (Pai386(p)^.op3t = Top_Reg) - Then - Begin - TmpRef^.base := R_NO; - TmpRef^.ScaleFactor := 4; - hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, - TRegister(twowords(Pai386(p)^.op2).word2))); - End - Else - Begin - TmpRef^.base := TRegister(Pai386(p)^.op2); - TmpRef^.ScaleFactor := 2; - hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, - TRegister(Pai386(p)^.op2))); - End; - hp1^.line := p^.line; - InsertLLItem(p^.last, p^.next, hp1); - Dispose(p, Done); - p := Pai(hp1^.next); - End - Else Dispose(TmpRef); + 10: Begin + {imul 10, reg1, reg2 to + lea (reg1,reg1,4), reg2 + add reg2, reg2 + imul 10, reg1 to + lea (reg1,reg1,4), reg1 + add reg1, reg1} + If (Opt_Processors <= i486) Then + Begin + If (Pai386(p)^.op3t = Top_Reg) + Then + hp1 := New(Pai386, op_reg_reg(A_ADD, S_L, + Tregister(twowords(Pai386(p)^.op2).word2), + Tregister(twowords(Pai386(p)^.op2).word2))) + Else hp1 := New(Pai386, op_reg_reg(A_ADD, S_L, + TRegister(Pai386(p)^.op2), TRegister(Pai386(p)^.op2))); + hp1^.line := p^.line; + InsertLLItem(p, p^.next, hp1); + TmpRef^.base := TRegister(Pai386(p)^.op2); + TmpRef^.Index := TRegister(Pai386(p)^.op2); + TmpRef^.ScaleFactor := 4; + If (Pai386(p)^.op3t = Top_Reg) + Then + hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, + TRegister(twowords(Pai386(p)^.op2).word2))) + Else + hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, + TRegister(Pai386(p)^.op2))); + hp1^.line := p^.line; + InsertLLItem(p^.last, p^.next, hp1); + Dispose(p, Done); + p := Pai(hp1^.next); End Else Dispose(TmpRef); - End; - End; - End; - A_LEA: - Begin - {changes "lea (%reg1), %reg2" into "mov %reg1, %reg2"} - If (PReference(Pai386(p)^.op1)^.Base >= R_EAX) And - (PReference(Pai386(p)^.op1)^.Base <= R_EDI) And - (PReference(Pai386(p)^.op1)^.Index = R_NO) And - (PReference(Pai386(p)^.op1)^.Offset = 0) And - (Not(Assigned(PReference(Pai386(p)^.op1)^.Symbol))) Then - Begin - hp1 := New(Pai386, op_reg_reg(A_MOV, S_L,PReference(Pai386(p)^.op1)^.Base, - TRegister(Pai386(p)^.op2))); - hp1^.line := p^.line; - InsertLLItem(p^.last,p^.next, hp1); - Dispose(p, Done); - p := hp1; - Continue; - End; - End; - A_MOV: - Begin - If (Pai386(p)^.op2t = top_reg) And - (TRegister(Pai386(p)^.op2) In [R_EAX, R_EBX, R_EDX, R_EDI]) And - Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_instruction) And - (Pai386(p^.next)^._operator = A_MOV) And - (Pai386(p^.next)^.op1t = top_reg) And - (Pai386(p^.next)^.op1 = Pai386(p)^.op2) - Then - {we have "mov x, %treg; mov %treg, y} - If (Pai386(p^.next)^.op2t <> top_reg) Or - RegInInstruction(TRegister(Pai386(p^.next)^.op2), Pai(p^.next^.next)) - Then - {we've got "mov x, %treg; mov %treg, y; XXX y" (ie. y is used in - the third instruction)} - Case Pai386(p)^.op1t Of - top_reg: - {change "mov %reg, %treg; mov %treg, y" - to "mov %reg, y"} - Begin - Pai386(p^.next)^.op1 := Pai386(p)^.op1; - hp1 := Pai(p^.next); - AsmL^.Remove(p); - Dispose(p, Done); - p := hp1; - continue; - End; - top_ref: - If (Pai386(p^.next)^.op2t = top_reg) - Then - {change "mov mem, %treg; mov %treg, %reg" - to "mov mem, %reg"} - Begin - Pai386(p)^.op2 := Pai386(p^.next)^.op2; - hp1 := Pai(p^.next); - AsmL^.Remove(hp1); - Dispose(hp1, Done); - continue; - End; - End - Else - {remove an instruction which never makes sense: we've got - "mov mem, %reg1; mov %reg1, %edi" and then EDI isn't used anymore!} - Begin - If (TRegister(Pai386(p^.next)^.op2) = R_EDI) And - Not(Assigned(p^.next^.next) And - (Pai(p^.next^.next)^.typ = ait_instruction) And - (Pai386(p^.next^.next)^.op2t = top_reg) And - (Pai386(p^.next^.next)^.op2 = Pointer(R_ESI))) Then - Begin - hp1 := pai(p^.next); - AsmL^.Remove(hp1); - Dispose(hp1, Done); - Continue; - End - End - Else - {Change "mov %reg1, %reg2; xxx %reg2, ???" to - "mov %reg1, %reg2; xxx %reg1, ???" to - avoid a write/read penalty} - If (Pai386(p)^.op1t = top_reg) And - (Pai386(p)^.op2t = top_reg) And - Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_instruction) And - (Pai386(p^.next)^.op1t = top_reg) And - (Pai386(p^.next)^.op1 = Pai386(p)^.op2) - Then - {we have "mov %reg1, %reg2; XXX %reg2, ???"} - Begin - If ((Pai386(p^.next)^._operator = A_OR) Or - (Pai386(p^.next)^._operator = A_TEST)) And - (Pai386(p^.next)^.op2t = top_reg) And - (Pai386(p^.next)^.op1 = Pai386(p^.next)^.op2) - Then - {we have "mov %reg1, %reg2; test/or %reg2, %reg2"} - Begin - If Assigned(p^.next^.next) And - (Pai(p^.next^.next)^.typ = ait_labeled_instruction) And - (TRegister(Pai386(p)^.op2) <> R_ESI) - Then - {change "mov %reg1, %reg2; test/or %reg2, %reg2; jxx" to - "test %reg1, %reg1; jxx"} - Begin - hp1 := pai(p^.next); - Pai386(hp1)^.op1 := Pai386(p)^.op1; - Pai386(hp1)^.op2 := Pai386(p)^.op1; - AsmL^.Remove(p); - Dispose(p, done); - p := hp1; - continue - End - Else - {change "mov %reg1, %reg2; test/or %reg2, %reg2" to - "mov %reg1, %reg2; test/or %reg1, %reg1"} - Begin - Pai386(p^.next)^.op1 := Pai386(p)^.op1; - Pai386(p^.next)^.op2 := Pai386(p)^.op1; - End; - End - Else -{ If (Pai386(p^.next)^._operator - In [A_PUSH, A_OR, A_XOR, A_AND, A_TEST])} - {change "mov %reg1, %reg2; push/or/xor/... %reg2, ???" to - "mov %reg1, %reg2; push/or/xor/... %reg1, ???"} - End - Else - {leave out the mov from "mov reg, x(%frame_pointer); leave/ret" (with - x >= RetOffset) as it doesn't do anything (it writes either to a - parameter or to the temporary storage room for the function - result)} - If Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_instruction) - Then - If ((Pai386(p^.next)^._operator = A_LEAVE) Or - (Pai386(p^.next)^._operator = A_RET)) And - (Pai386(p)^.op2t = top_ref) And - (TReference(Pai386(p)^.op2^).base = ProcInfo.FramePointer) And - (TReference(Pai386(p)^.op2^).offset >= ProcInfo.RetOffset) And - (TReference(Pai386(p)^.op2^).index = R_NO) And - (Pai386(p)^.op1t = top_reg) - Then - Begin - hp1 := Pai(p^.next); - AsmL^.Remove(p); - Dispose(p, done); - p := hp1; - End - Else - If (Pai386(p)^.op1t = top_reg) And - (Pai386(p)^.op2t = top_ref) And - (Pai386(p)^.Size = Pai386(p^.next)^.Size) And - (Pai386(p^.next)^._operator = A_CMP) And - (Pai386(p^.next)^.op2t = top_ref) And - RefsEqual(TReference(Pai386(p)^.op2^), - TReference(Pai386(p^.next)^.op2^)) - Then - {change "mov reg, mem1; cmp x, mem1" to "mov reg, mem1; cmp x, reg1"} - Begin - Dispose(PReference(Pai386(p^.next)^.op2)); - Pai386(p^.next)^.opxt := Pai386(p^.next)^.op1t + (top_reg shl 4); - Pai386(p^.next)^.op2 := Pai386(p)^.op1 - End; - { Next instruction is also a MOV ? } - If assigned(p^.next) and - (pai(p^.next)^.typ = ait_instruction) and - (Pai386(p^.next)^._operator = A_MOV) - Then - Begin - { Removes the second statement from - mov %reg, mem - mov mem, %reg } - If (Pai386(p^.next)^.op1t = Pai386(p)^.op2t) and - (Pai386(p^.next)^.op2t = Pai386(p)^.op1t) Then - Begin - If (Pai386(p^.next)^.op2t = top_ref) Then - TmpBool1 := RefsEqual(TReference(Pai386(p^.next)^.op2^), TReference(Pai386(p)^.op1^)) - Else - TmpBool1 := Pai386(p^.next)^.op2 = Pai386(p)^.op1; - If TmpBool1 - Then - Begin - If (Pai386(p^.next)^.op1t = top_ref) - Then - TmpBool1 := RefsEqual(TReference(Pai386(p^.next)^.op1^), - TReference(Pai386(p)^.op2^)) - Else TmpBool1 := (Pai386(p^.next)^.op1 = Pai386(p)^.op2); - If TmpBool1 Then - Begin - hp1 := pai(p^.next); - AsmL^.remove(hp1); - Dispose(hp1,done); - End; - End - Else - Begin - hp1 := pai(p^.next^.next); - If (Pai386(p)^.op1t = top_ref) And - (Pai386(p)^.op2t = top_reg) And - (Pai386(p^.next)^.op1t = top_reg) And - (Pai386(p^.next)^.op1 = Pai386(p)^.op2) And - (Pai386(p^.next)^.op2t = top_ref) And - Assigned(hp1) And - (Pai(hp1)^.typ = ait_instruction) And - (Pai386(hp1)^._operator = A_MOV) And - (Pai386(hp1)^.op2t = top_reg) And - (Pai386(hp1)^.op1t = top_ref) And - RefsEqual(TReference(Pai386(hp1)^.op1^), - TReference(Pai386(p^.next)^.op2^)) - Then - { mov mem1, reg1 - mov reg1, mem2 - mov mem2, reg2 - to: - mov mem1, reg2 - mov reg2, mem2} - If (TRegister(Pai386(p)^.op2) <> R_ESI) - Then - Begin - Pai386(p)^.op2 := Pai386(hp1)^.op2; - Pai386(p^.next)^.op1 := Pai386(hp1)^.op2; - AsmL^.Remove(hp1); - Dispose(hp1,Done); - End - Else - { mov mem1, esi - mov esi, mem2 - mov mem2, reg2 - to: - mov mem1, esi - mov mem1, reg2 - mov esi, mem2} - Begin - Pai386(p^.next)^.opxt := top_ref + top_reg shl 4; - Pai386(p^.next)^.op1 := Pai386(p)^.op2; - TReference(Pai386(p^.next)^.op1^) := TReference(Pai386(p)^.op1^); - Pai386(p^.next)^.op2 := Pai386(hp1)^.op2; - Pai386(hp1)^.opxt := top_reg + top_ref shl 4; - Pai386(hp1)^.op2 := Pai386(hp1)^.op1; - Pai386(hp1)^.op1 := Pointer(R_ESI) - End; - End; - End - Else -(* { movl [mem1],reg1 - movl [mem1],reg2 - to: - movl [mem1],reg1 - movl reg1,reg2 } - If (Pai386(p)^.op1t = top_ref) and - (Pai386(p)^.op2t = top_reg) and - (Pai386(p^.next)^.op1t = top_ref) and - (Pai386(p^.next)^.op2t = top_reg) and - (Pai386(p)^.size = Pai386(p^.next)^.size) and - RefsEqual(TReference(Pai386(p)^.op1^),TReference(Pai386(p^.next)^.op1^)) and - (TRegister(Pai386(p)^.op2)<>TReference(Pai386(p^.next)^.op1^).base) and - (TRegister(Pai386(p)^.op2)<>TReference(Pai386(p^.next)^.op1^).index) then - Begin - Dispose(PReference(Pai386(p^.next)^.op1)); - Pai386(p^.next)^.op1:=Pai386(p)^.op2; - Pai386(p^.next)^.opxt:=Top_reg+Top_reg shl 4; - End - Else*) - { movl const1,[mem1] - movl [mem1],reg1 - to: - movl const1,reg1 - movl reg1,[mem1] } - If (Pai386(p)^.op1t = top_const) and - (Pai386(p)^.op2t = top_ref) and - (Pai386(p^.next)^.op1t = top_ref) and - (Pai386(p^.next)^.op2t = top_reg) and - (Pai386(p)^.size = Pai386(p^.next)^.size) and - RefsEqual(TReference(Pai386(p^.next)^.op1^),TReference(Pai386(p)^.op2^)) then - Begin - Pai386(p^.next)^.op1:=Pai386(p^.next)^.op2; - Pai386(p^.next)^.op2:=Pai386(p)^.op2; - Pai386(p^.next)^.opxt:=Top_reg+Top_ref shl 4; - Pai386(p)^.op2:=Pai386(p^.next)^.op1; - Pai386(p)^.opxt:=Top_const+(top_reg shl 4); - End - End; - {changes "mov $0, %reg" into "xor %reg, %reg"} - If (Pai386(p)^.op1t = Top_Const) And - (Pai386(p)^.op1 = Pointer(0)) And - (Pai386(p)^.op2t = Top_Reg) - Then - Begin - Pai386(p)^._operator := A_XOR; - Pai386(p)^.opxt := Top_Reg+Top_reg shl 4; - Pai386(p)^.op1 := Pai386(p)^.op2; End; - End; - A_MOVZX: - Begin - {removes superfluous And's after movzx's} - If (Pai386(p)^.op2t = top_reg) And - Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_instruction) And - (Pai386(p^.next)^._operator = A_AND) And - (Pai386(p^.next)^.op1t = top_const) And - (Pai386(p^.next)^.op2t = top_reg) And - (Pai386(p^.next)^.op2 = Pai386(p)^.op2) - Then - Case Pai386(p)^.Size Of - S_BL, S_BW: - If (Longint(Pai386(p^.next)^.op1) = $ff) + 12: Begin + {imul 12, reg1, reg2 to + lea (,reg1,4), reg2 + lea (,reg1,8) reg2 + imul 12, reg1 to + lea (reg1,reg1,2), reg1 + lea (,reg1,4), reg1} + If (Opt_Processors <= i486) Then Begin - hp1 := Pai(p^.next); - AsmL^.Remove(hp1); - Dispose(hp1, Done); - End; - S_WL: - If (Longint(Pai386(p^.next)^.op1) = $ffff) - Then - Begin - hp1 := Pai(p^.next); - AsmL^.Remove(hp1); - Dispose(hp1, Done); - End; - End; - {changes some movzx constructs to faster synonims (all examples - are given with eax/ax, but are also valid for other registers)} - If (Pai386(p)^.op2t = top_reg) Then - If (Pai386(p)^.op1t = top_reg) - Then - Case Pai386(p)^.size of - S_BW: - Begin - If (TRegister(Pai386(p)^.op1) = Reg16ToReg8(TRegister(Pai386(p)^.op2))) And - Not(CS_LittleSize In AktSwitches) - Then - {Change "movzbw %al, %ax" to "andw $0x0ffh, %ax"} - Begin - Pai386(p)^._operator := A_AND; - Pai386(p)^.opxt := top_const+Top_reg shl 4; - Longint(Pai386(p)^.op1) := $ff; - Pai386(p)^.Size := S_W - End - Else - If Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_instruction) And - (Pai386(p^.next)^._operator = A_AND) And - (Pai386(p^.next)^.op1t = top_const) And - (Pai386(p^.next)^.op2t = top_reg) And - (Pai386(p^.next)^.op2 = Pai386(p)^.op2) - Then - {Change "movzbw %reg1, %reg2; andw $const, %reg2" - to "movw %reg1, reg2; andw $(const1 and $ff), %reg2"} - Begin - Pai386(p)^._operator := A_MOV; - Pai386(p)^.Size := S_W; - Pai386(p)^.op1 := Pointer(Reg8ToReg16(TRegister(Pai386(p)^.op1))); - Pai386(p^.next)^.op1 := Pointer(Longint(Pai386(p^.next)^.op1) - And $ff); - End; - End; - S_BL: - Begin - If (TRegister(Pai386(p)^.op1) = Reg32ToReg8(TRegister(Pai386(p)^.op2))) And - Not(CS_LittleSize in AktSwitches) - Then - {Change "movzbl %al, %eax" to "andl $0x0ffh, %eax"} - Begin - Pai386(p)^._operator := A_AND; - Pai386(p)^.opxt := top_const+Top_reg shl 4; - Longint(Pai386(p)^.op1) := $ff; - Pai386(p)^.Size := S_L; - End - Else - If Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_instruction) And - (Pai386(p^.next)^._operator = A_AND) And - (Pai386(p^.next)^.op1t = top_const) And - (Pai386(p^.next)^.op2t = top_reg) And - (Pai386(p^.next)^.op2 = Pai386(p)^.op2) - Then - {Change "movzbl %reg1, %reg2; andl $const, %reg2" - to "movl %reg1, reg2; andl $(const1 and $ff), %reg2"} - Begin - Pai386(p)^._operator := A_MOV; - Pai386(p)^.Size := S_L; - Pai386(p)^.op1 := Pointer(Reg8ToReg32(TRegister(Pai386(p)^.op1))); - Pai386(p^.next)^.op1 := Pointer(Longint(Pai386(p^.next)^.op1) - And $ff); - End - Else - If IsGP32Reg(TRegister(Pai386(p)^.op2)) And - Not(CS_LittleSize in AktSwitches) And - (Opt_Processors >= Pentium) And - (Opt_Processors < PentiumPro) - Then - {Change "movzbl %reg1, %reg2" to - "xorl %reg2, %reg2; movb %reg1, %reg2" for Pentium and - PentiumMMX} - Begin - hp1 := New(Pai386, op_reg_reg(A_XOR, S_L, - TRegister(Pai386(p)^.op2), - TRegister(Pai386(p)^.op2))); - hp1^.line := p^.line; - InsertLLItem(p^.last, p, hp1); - Pai386(p)^._operator := A_MOV; - Pai386(p)^.size := S_B; - Pai386(p)^.op2 := - Pointer(Reg32ToReg8(TRegister(Pai386(p)^.op2))); - InsertLLItem(p, p^.next, hp2); - End; - End; - S_WL: - Begin - If (TRegister(Pai386(p)^.op1) = Reg32ToReg16(TRegister(Pai386(p)^.op2))) And - Not(CS_LittleSize In AktSwitches) - Then - {Change "movzwl %ax, %eax" to "andl $0x0ffffh, %eax"} - Begin - Pai386(p)^._operator := A_AND; - Pai386(p)^.opxt := top_const+Top_reg shl 4; - Longint(Pai386(p)^.op1) := $ffff; - Pai386(p)^.Size := S_L - End - Else - If Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_instruction) And - (Pai386(p^.next)^._operator = A_AND) And - (Pai386(p^.next)^.op1t = top_const) And - (Pai386(p^.next)^.op2t = top_reg) And - (Pai386(p^.next)^.op2 = Pai386(p)^.op2) - Then - {Change "movzwl %reg1, %reg2; andl $const, %reg2" - to "movl %reg1, reg2; andl $(const1 and $ffff), %reg2"} - Begin - Pai386(p)^._operator := A_MOV; - Pai386(p)^.Size := S_L; - Pai386(p)^.op1 := Pointer(Reg16ToReg32(TRegister(Pai386(p)^.op1))); - Pai386(p^.next)^.op1 := Pointer(Longint(Pai386(p^.next)^.op1) - And $ffff); - End; - End; - End - Else - If (Pai386(p)^.op1t = top_ref) Then - Begin - If (PReference(Pai386(p)^.op1)^.base <> TRegister(Pai386(p)^.op2)) And - (PReference(Pai386(p)^.op1)^.index <> TRegister(Pai386(p)^.op2)) And - Not(CS_LittleSize in AktSwitches) And - IsGP32Reg(TRegister(Pai386(p)^.op2)) And - (Opt_Processors >= Pentium) And - (Opt_Processors < PentiumPro) And - (Pai386(p)^.Size = S_BL) + TmpRef^.Index := TRegister(Pai386(p)^.op2); + If (Pai386(p)^.op3t = Top_Reg) Then - {changes "movzbl mem, %reg" to "xorl %reg, %reg; movb mem, %reg8" for - Pentium and PentiumMMX} Begin - hp1 := New(Pai386,op_reg_reg(A_XOR, S_L, TRegister(Pai386(p)^.op2), - TRegister(Pai386(p)^.op2))); - hp1^.line := p^.line; - Pai386(p)^._operator := A_MOV; - Pai386(p)^.size := S_B; - Pai386(p)^.op2 := Pointer(Reg32ToReg8(TRegister(Pai386(p)^.op2))); - InsertLLItem(p^.last, p, hp1); + TmpRef^.base := TRegister(twowords(Pai386(p)^.op2).word2); + TmpRef^.ScaleFactor := 8; + hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, + TRegister(twowords(Pai386(p)^.op2).word2))); End Else - If Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_instruction) And - (Pai386(p^.next)^._operator = A_AND) And - (Pai386(p^.next)^.op1t = Top_Const) And - (Pai386(p^.next)^.op2t = Top_Reg) And - (Pai386(p^.next)^.op2 = Pai386(p)^.op2) Then - Begin - Pai386(p)^._operator := A_MOV; - Case Pai386(p)^.Size Of - S_BL: - Begin - Pai386(p)^.Size := S_L; - Pai386(p^.next)^.op1 := Pointer(Longint(Pai386(p^.next)^.op1) - And $ff); - End; - S_WL: - Begin - Pai386(p)^.Size := S_L; - Pai386(p^.next)^.op1 := Pointer(Longint(Pai386(p^.next)^.op1) - And $ffff); - End; - S_BW: - Begin - Pai386(p)^.Size := S_W; - Pai386(p^.next)^.op1 := Pointer(Longint(Pai386(p^.next)^.op1) - And $ff); - End; - End; - End; + Begin + TmpRef^.base := R_NO; + TmpRef^.ScaleFactor := 4; + hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, + TRegister(Pai386(p)^.op2))); + End; + hp1^.line := p^.line; + InsertLLItem(p, p^.next, hp1); + New(TmpRef); + TmpRef^.segment := R_DEFAULT_SEG; + TmpRef^.symbol := nil; + TmpRef^.isintvalue := false; + TmpRef^.offset := 0; + TmpRef^.Index := TRegister(Pai386(p)^.op2); + If (Pai386(p)^.op3t = Top_Reg) + Then + Begin + TmpRef^.base := R_NO; + TmpRef^.ScaleFactor := 4; + hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, + TRegister(twowords(Pai386(p)^.op2).word2))); + End + Else + Begin + TmpRef^.base := TRegister(Pai386(p)^.op2); + TmpRef^.ScaleFactor := 2; + hp1 := New(Pai386, op_ref_reg(A_LEA, S_L, TmpRef, + TRegister(Pai386(p)^.op2))); + End; + hp1^.line := p^.line; + InsertLLItem(p^.last, p^.next, hp1); + Dispose(p, Done); + p := Pai(hp1^.next); + End + Else Dispose(TmpRef); + End + Else Dispose(TmpRef); + End; + End; + End; + A_LEA: + Begin + {changes "lea (%reg1), %reg2" into "mov %reg1, %reg2"} + If (PReference(Pai386(p)^.op1)^.Base >= R_EAX) And + (PReference(Pai386(p)^.op1)^.Base <= R_EDI) And + (PReference(Pai386(p)^.op1)^.Index = R_NO) And + (PReference(Pai386(p)^.op1)^.Offset = 0) And + (Not(Assigned(PReference(Pai386(p)^.op1)^.Symbol))) Then + Begin + hp1 := New(Pai386, op_reg_reg(A_MOV, S_L,PReference(Pai386(p)^.op1)^.Base, + TRegister(Pai386(p)^.op2))); + hp1^.line := p^.line; + InsertLLItem(p^.last,p^.next, hp1); + Dispose(p, Done); + p := hp1; + Continue; + End; + End; + A_MOV: + Begin + If (Pai386(p)^.op2t = top_reg) And + (TRegister(Pai386(p)^.op2) In [R_EAX, R_EBX, R_EDX, R_EDI]) And +{ Assigned(p^.next) And} + GetNextInstruction(p, hp1) And + (Pai(hp1)^.typ = ait_instruction) And + (Pai386(hp1)^._operator = A_MOV) And + (Pai386(hp1)^.op1t = top_reg) And + (Pai386(hp1)^.op1 = Pai386(p)^.op2) + Then + {we have "mov x, %treg; mov %treg, y} + If (Pai386(hp1)^.op2t <> top_reg) Or + (GetNextInstruction(hp1, hp2) And + RegInInstruction(TRegister(Pai386(hp1)^.op2), hp2)) + Then + {we've got "mov x, %treg; mov %treg, y; XXX y" (ie. y is used in + the third instruction)} + Case Pai386(p)^.op1t Of + top_reg: + {change "mov %reg, %treg; mov %treg, y" + to "mov %reg, y"} + Begin + Pai386(hp1)^.op1 := Pai386(p)^.op1; +{ hp1 := Pai(p^.next);} + AsmL^.Remove(p); + Dispose(p, Done); + p := hp1; + continue; + End; + top_ref: + If (Pai386(hp1)^.op2t = top_reg) + Then + {change "mov mem, %treg; mov %treg, %reg" + to "mov mem, %reg"} + Begin + Pai386(p)^.op2 := Pai386(hp1)^.op2; +{ hp1 := Pai(p^.next);} + AsmL^.Remove(hp1); + Dispose(hp1, Done); + continue; + End; + End + Else + {remove an instruction which never makes sense: we've got + "mov mem, %reg1; mov %reg1, %edi" and then EDI isn't used anymore!} + Begin + If (TRegister(Pai386(hp1)^.op2) = R_EDI) And + Not({Assigned(p^.next^.next) And} + GetNextInstruction(hp1, hp2) And + (Pai(hp2)^.typ = ait_instruction) And + (Pai386(hp2)^.op2t = top_reg) And + (Pai386(hp2)^.op2 = Pointer(R_ESI))) Then + Begin +{ hp1 := pai(p^.next);} + AsmL^.Remove(hp1); + Dispose(hp1, Done); + Continue; + End + End + Else + {Change "mov %reg1, %reg2; xxx %reg2, ???" to + "mov %reg1, %reg2; xxx %reg1, ???" to + avoid a write/read penalty} + If (Pai386(p)^.op1t = top_reg) And + (Pai386(p)^.op2t = top_reg) And +{ Assigned(p^.next) And} + GetNextInstruction(p,hp1) And + (Pai(hp1)^.typ = ait_instruction) And + (Pai386(hp1)^.op1t = top_reg) And + (Pai386(hp1)^.op1 = Pai386(p)^.op2) + Then + {we have "mov %reg1, %reg2; XXX %reg2, ???"} + Begin + If ((Pai386(hp1)^._operator = A_OR) Or + (Pai386(hp1)^._operator = A_TEST)) And + (Pai386(hp1)^.op2t = top_reg) And + (Pai386(hp1)^.op1 = Pai386(hp1)^.op2) + Then + {we have "mov %reg1, %reg2; test/or %reg2, %reg2"} + Begin + If {Assigned(p^.next^.next) And} + GetNextInstruction(hp1, hp2) And + (Pai(hp2)^.typ = ait_labeled_instruction) And + (TRegister(Pai386(p)^.op2) <> R_ESI) + Then + {change "mov %reg1, %reg2; test/or %reg2, %reg2; jxx" to + "test %reg1, %reg1; jxx"} + Begin +{ hp1 := pai(p^.next);} + Pai386(hp1)^.op1 := Pai386(p)^.op1; + Pai386(hp1)^.op2 := Pai386(p)^.op1; + AsmL^.Remove(p); + Dispose(p, done); + p := hp1; + continue + End + Else + {change "mov %reg1, %reg2; test/or %reg2, %reg2" to + "mov %reg1, %reg2; test/or %reg1, %reg1"} + Begin + Pai386(hp1)^.op1 := Pai386(p)^.op1; + Pai386(hp1)^.op2 := Pai386(p)^.op1; + End; + End + Else +{ If (Pai386(p^.next)^._operator + In [A_PUSH, A_OR, A_XOR, A_AND, A_TEST])} + {change "mov %reg1, %reg2; push/or/xor/... %reg2, ???" to + "mov %reg1, %reg2; push/or/xor/... %reg1, ???"} + End + Else + {leave out the mov from "mov reg, x(%frame_pointer); leave/ret" (with + x >= RetOffset) as it doesn't do anything (it writes either to a + parameter or to the temporary storage room for the function + result)} + If {Assigned(p^.next) And} + GetNextInstruction(p, hp1) And + (Pai(hp1)^.typ = ait_instruction) + Then + If ((Pai386(hp1)^._operator = A_LEAVE) Or + (Pai386(hp1)^._operator = A_RET)) And + (Pai386(p)^.op2t = top_ref) And + (TReference(Pai386(p)^.op2^).base = ProcInfo.FramePointer) And + (TReference(Pai386(p)^.op2^).offset >= ProcInfo.RetOffset) And + (TReference(Pai386(p)^.op2^).index = R_NO) And + (Pai386(p)^.op1t = top_reg) + Then + Begin +{ hp1 := Pai(p^.next);} + AsmL^.Remove(p); + Dispose(p, done); + p := hp1; + End + Else + If (Pai386(p)^.op1t = top_reg) And + (Pai386(p)^.op2t = top_ref) And + (Pai386(p)^.Size = Pai386(hp1)^.Size) And + (Pai386(hp1)^._operator = A_CMP) And + (Pai386(hp1)^.op2t = top_ref) And + RefsEqual(TReference(Pai386(p)^.op2^), + TReference(Pai386(hp1)^.op2^)) + Then + {change "mov reg, mem1; cmp x, mem1" to "mov reg, mem1; cmp x, reg1"} + Begin + Dispose(PReference(Pai386(hp1)^.op2)); + Pai386(hp1)^.opxt := Pai386(hp1)^.op1t + (top_reg shl 4); + Pai386(hp1)^.op2 := Pai386(p)^.op1 End; + { Next instruction is also a MOV ? } + If {assigned(p^.next) and} + GetNextInstruction(p, hp1) And + (pai(hp1)^.typ = ait_instruction) and + (Pai386(hp1)^._operator = A_MOV) + Then + Begin + { Removes the second statement from + mov %reg, mem + mov mem, %reg } + If (Pai386(hp1)^.op1t = Pai386(p)^.op2t) and + (Pai386(hp1)^.op2t = Pai386(p)^.op1t) + Then + Begin + If (Pai386(hp1)^.op2t = top_ref) + Then + TmpBool1 := RefsEqual(TReference(Pai386(hp1)^.op2^), TReference(Pai386(p)^.op1^)) + Else + TmpBool1 := Pai386(hp1)^.op2 = Pai386(p)^.op1; + If TmpBool1 + Then + Begin + If (Pai386(hp1)^.op1t = top_ref) + Then + TmpBool1 := RefsEqual(TReference(Pai386(hp1)^.op1^), + TReference(Pai386(p)^.op2^)) + Else TmpBool1 := (Pai386(hp1)^.op1 = Pai386(p)^.op2); + If TmpBool1 Then + Begin +{ hp1 := pai(p^.next);} + AsmL^.remove(hp1); + Dispose(hp1,done); + End; + End + Else + Begin +{ hp1 := pai(p^.next^.next);} + If GetNextInstruction(hp1, hp2) And + (Pai386(p)^.op1t = top_ref) And + (Pai386(p)^.op2t = top_reg) And + (Pai386(hp1)^.op1t = top_reg) And + (Pai386(hp1)^.op1 = Pai386(p)^.op2) And + (Pai386(hp1)^.op2t = top_ref) And +{ Assigned(hp1) And} + (Pai(hp2)^.typ = ait_instruction) And + (Pai386(hp2)^._operator = A_MOV) And + (Pai386(hp2)^.op2t = top_reg) And + (Pai386(hp2)^.op1t = top_ref) And + RefsEqual(TReference(Pai386(hp2)^.op1^), + TReference(Pai386(hp1)^.op2^)) + Then + If (TRegister(Pai386(p)^.op2) <> R_ESI) + Then + { mov mem1, reg1 + mov reg1, mem2 + mov mem2, reg2 + to: + mov mem1, reg2 + mov reg2, mem2} + Begin + Pai386(p)^.op2 := Pai386(hp2)^.op2; + Pai386(hp1)^.op1 := Pai386(hp2)^.op2; + AsmL^.Remove(hp2); + Dispose(hp2,Done); + End + Else + { mov mem1, esi + mov esi, mem2 + mov mem2, reg2 + to: + mov mem1, esi + mov mem1, reg2 + mov esi, mem2} + Begin + Pai386(hp1)^.opxt := top_ref + top_reg shl 4; + Pai386(hp1)^.op1 := Pai386(p)^.op2; + TReference(Pai386(hp1)^.op1^) := TReference(Pai386(p)^.op1^); + Pai386(hp1)^.op2 := Pai386(hp2)^.op2; + Pai386(hp2)^.opxt := top_reg + top_ref shl 4; + Pai386(hp2)^.op2 := Pai386(hp2)^.op1; + Pai386(hp2)^.op1 := Pointer(R_ESI) + End; + End; + End + Else +(* { movl [mem1],reg1 + movl [mem1],reg2 + to: + movl [mem1],reg1 + movl reg1,reg2 } + If (Pai386(p)^.op1t = top_ref) and + (Pai386(p)^.op2t = top_reg) and + (Pai386(hp1)^.op1t = top_ref) and + (Pai386(hp1)^.op2t = top_reg) and + (Pai386(p)^.size = Pai386(hp1)^.size) and + RefsEqual(TReference(Pai386(p)^.op1^),TReference(Pai386(hp1)^.op1^)) and + (TRegister(Pai386(p)^.op2)<>TReference(Pai386(hp1)^.op1^).base) and + (TRegister(Pai386(p)^.op2)<>TReference(Pai386(hp1)^.op1^).index) then + Begin + Dispose(PReference(Pai386(hp1)^.op1)); + Pai386(hp1)^.op1:=Pai386(p)^.op2; + Pai386(hp1)^.opxt:=Top_reg+Top_reg shl 4; + End + Else*) + { movl const1,[mem1] + movl [mem1],reg1 + to: + movl const1,reg1 + movl reg1,[mem1] } + If (Pai386(p)^.op1t = top_const) and + (Pai386(p)^.op2t = top_ref) and + (Pai386(hp1)^.op1t = top_ref) and + (Pai386(hp1)^.op2t = top_reg) and + (Pai386(p)^.size = Pai386(hp1)^.size) and + RefsEqual(TReference(Pai386(hp1)^.op1^),TReference(Pai386(p)^.op2^)) then + Begin + Pai386(hp1)^.op1:=Pai386(hp1)^.op2; + Pai386(hp1)^.op2:=Pai386(p)^.op2; + Pai386(hp1)^.opxt:=Top_reg+Top_ref shl 4; + Pai386(p)^.op2:=Pai386(hp1)^.op1; + Pai386(p)^.opxt:=Top_const+(top_reg shl 4); + End + End; + {changes "mov $0, %reg" into "xor %reg, %reg"} + If (Pai386(p)^.op1t = Top_Const) And + (Pai386(p)^.op1 = Pointer(0)) And + (Pai386(p)^.op2t = Top_Reg) + Then + Begin + Pai386(p)^._operator := A_XOR; + Pai386(p)^.opxt := Top_Reg+Top_reg shl 4; + Pai386(p)^.op1 := Pai386(p)^.op2; + End; + End; + A_MOVZX: + Begin + {removes superfluous And's after movzx's} + If (Pai386(p)^.op2t = top_reg) And +{ Assigned(p^.next) And} + GetNextInstruction(p, hp1) And + (Pai(hp1)^.typ = ait_instruction) And + (Pai386(hp1)^._operator = A_AND) And + (Pai386(hp1)^.op1t = top_const) And + (Pai386(hp1)^.op2t = top_reg) And + (Pai386(hp1)^.op2 = Pai386(p)^.op2) + Then + Case Pai386(p)^.Size Of + S_BL, S_BW: + If (Longint(Pai386(hp1)^.op1) = $ff) + Then + Begin +{ hp1 := Pai(p^.next);} + AsmL^.Remove(hp1); + Dispose(hp1, Done); + End; + S_WL: + If (Longint(Pai386(hp1)^.op1) = $ffff) + Then + Begin +{ hp1 := Pai(p^.next);} + AsmL^.Remove(hp1); + Dispose(hp1, Done); + End; + End; + {changes some movzx constructs to faster synonims (all examples + are given with eax/ax, but are also valid for other registers)} + If (Pai386(p)^.op2t = top_reg) Then + If (Pai386(p)^.op1t = top_reg) + Then + Case Pai386(p)^.size of + S_BW: + Begin + If (TRegister(Pai386(p)^.op1) = Reg16ToReg8(TRegister(Pai386(p)^.op2))) And + Not(CS_LittleSize In AktSwitches) + Then + {Change "movzbw %al, %ax" to "andw $0x0ffh, %ax"} + Begin + Pai386(p)^._operator := A_AND; + Pai386(p)^.opxt := top_const+Top_reg shl 4; + Longint(Pai386(p)^.op1) := $ff; + Pai386(p)^.Size := S_W + End + Else + If {Assigned(p^.next) And} + GetNextInstruction(p, hp1) And + (Pai(hp1)^.typ = ait_instruction) And + (Pai386(hp1)^._operator = A_AND) And + (Pai386(hp1)^.op1t = top_const) And + (Pai386(hp1)^.op2t = top_reg) And + (Pai386(hp1)^.op2 = Pai386(p)^.op2) + Then + {Change "movzbw %reg1, %reg2; andw $const, %reg2" + to "movw %reg1, reg2; andw $(const1 and $ff), %reg2"} + Begin + Pai386(p)^._operator := A_MOV; + Pai386(p)^.Size := S_W; + Pai386(p)^.op1 := Pointer(Reg8ToReg16(TRegister(Pai386(p)^.op1))); + Pai386(hp1)^.op1 := Pointer(Longint(Pai386(hp1)^.op1) And $ff); + End; + End; + S_BL: + Begin + If (TRegister(Pai386(p)^.op1) = Reg32ToReg8(TRegister(Pai386(p)^.op2))) And + Not(CS_LittleSize in AktSwitches) + Then + {Change "movzbl %al, %eax" to "andl $0x0ffh, %eax"} + Begin + Pai386(p)^._operator := A_AND; + Pai386(p)^.opxt := top_const+Top_reg shl 4; + Longint(Pai386(p)^.op1) := $ff; + Pai386(p)^.Size := S_L; + End + Else + If {Assigned(p^.next) And} + GetNextInstruction(p, hp1) And + (Pai(hp1)^.typ = ait_instruction) And + (Pai386(hp1)^._operator = A_AND) And + (Pai386(hp1)^.op1t = top_const) And + (Pai386(hp1)^.op2t = top_reg) And + (Pai386(hp1)^.op2 = Pai386(p)^.op2) + Then + {Change "movzbl %reg1, %reg2; andl $const, %reg2" + to "movl %reg1, reg2; andl $(const1 and $ff), %reg2"} + Begin + Pai386(p)^._operator := A_MOV; + Pai386(p)^.Size := S_L; + Pai386(p)^.op1 := Pointer(Reg8ToReg32(TRegister(Pai386(p)^.op1))); + Pai386(hp1)^.op1 := Pointer(Longint(Pai386(hp1)^.op1) And $ff); + End + Else + If IsGP32Reg(TRegister(Pai386(p)^.op2)) And + Not(CS_LittleSize in AktSwitches) And + (Opt_Processors >= Pentium) And + (Opt_Processors < PentiumPro) + Then + {Change "movzbl %reg1, %reg2" to + "xorl %reg2, %reg2; movb %reg1, %reg2" for Pentium and + PentiumMMX} + Begin + hp1 := New(Pai386, op_reg_reg(A_XOR, S_L, + TRegister(Pai386(p)^.op2), + TRegister(Pai386(p)^.op2))); + hp1^.line := p^.line; + InsertLLItem(p^.last, p, hp1); + Pai386(p)^._operator := A_MOV; + Pai386(p)^.size := S_B; + Pai386(p)^.op2 := + Pointer(Reg32ToReg8(TRegister(Pai386(p)^.op2))); + InsertLLItem(p, p^.next, hp2); + End; + End; + S_WL: + Begin + If (TRegister(Pai386(p)^.op1) = Reg32ToReg16(TRegister(Pai386(p)^.op2))) And + Not(CS_LittleSize In AktSwitches) + Then + {Change "movzwl %ax, %eax" to "andl $0x0ffffh, %eax"} + Begin + Pai386(p)^._operator := A_AND; + Pai386(p)^.opxt := top_const+Top_reg shl 4; + Longint(Pai386(p)^.op1) := $ffff; + Pai386(p)^.Size := S_L + End + Else + If {Assigned(p^.next) And} + GetNextInstruction(p, hp1) And + (Pai(hp1)^.typ = ait_instruction) And + (Pai386(hp1)^._operator = A_AND) And + (Pai386(hp1)^.op1t = top_const) And + (Pai386(hp1)^.op2t = top_reg) And + (Pai386(hp1)^.op2 = Pai386(p)^.op2) + Then + {Change "movzwl %reg1, %reg2; andl $const, %reg2" + to "movl %reg1, reg2; andl $(const1 and $ffff), %reg2"} + Begin + Pai386(p)^._operator := A_MOV; + Pai386(p)^.Size := S_L; + Pai386(p)^.op1 := Pointer(Reg16ToReg32(TRegister(Pai386(p)^.op1))); + Pai386(hp1)^.op1 := Pointer(Longint(Pai386(hp1)^.op1) And $ffff); + End; + End; + End + Else + If (Pai386(p)^.op1t = top_ref) Then + Begin + If (PReference(Pai386(p)^.op1)^.base <> TRegister(Pai386(p)^.op2)) And + (PReference(Pai386(p)^.op1)^.index <> TRegister(Pai386(p)^.op2)) And + Not(CS_LittleSize in AktSwitches) And + IsGP32Reg(TRegister(Pai386(p)^.op2)) And + (Opt_Processors >= Pentium) And + (Opt_Processors < PentiumPro) And + (Pai386(p)^.Size = S_BL) + Then + {changes "movzbl mem, %reg" to "xorl %reg, %reg; movb mem, %reg8" for + Pentium and PentiumMMX} + Begin + hp1 := New(Pai386,op_reg_reg(A_XOR, S_L, TRegister(Pai386(p)^.op2), + TRegister(Pai386(p)^.op2))); + hp1^.line := p^.line; + Pai386(p)^._operator := A_MOV; + Pai386(p)^.size := S_B; + Pai386(p)^.op2 := Pointer(Reg32ToReg8(TRegister(Pai386(p)^.op2))); + InsertLLItem(p^.last, p, hp1); + End + Else + If {Assigned(p^.next) And} + GetNextInstruction(p, hp1) And + (Pai(hp1)^.typ = ait_instruction) And + (Pai386(hp1)^._operator = A_AND) And + (Pai386(hp1)^.op1t = Top_Const) And + (Pai386(hp1)^.op2t = Top_Reg) And + (Pai386(hp1)^.op2 = Pai386(p)^.op2) Then + Begin + Pai386(p)^._operator := A_MOV; + Case Pai386(p)^.Size Of + S_BL: + Begin + Pai386(p)^.Size := S_L; + Pai386(hp1)^.op1 := Pointer(Longint(Pai386(hp1)^.op1) + And $ff); + End; + S_WL: + Begin + Pai386(p)^.Size := S_L; + Pai386(hp1)^.op1 := Pointer(Longint(Pai386(hp1)^.op1) + And $ffff); + End; + S_BW: + Begin + Pai386(p)^.Size := S_W; + Pai386(hp1)^.op1 := Pointer(Longint(Pai386(hp1)^.op1) + And $ff); + End; + End; + End; + End; End; A_POP: Begin if (Pai386(p)^.op1t = top_reg) And - (assigned(p^.next)) and - (pai(p^.next)^.typ=ait_instruction) and - (Pai386(p^.next)^._operator=A_PUSH) and - (Pai386(p^.next)^.op1t = top_reg) And - (Pai386(p^.next)^.op1=Pai386(p)^.op1) then +{ (assigned(p^.next)) and} + GetNextInstruction(p, hp1) And + (pai(hp1)^.typ=ait_instruction) and + (Pai386(hp1)^._operator=A_PUSH) and + (Pai386(hp1)^.op1t = top_reg) And + (Pai386(hp1)^.op1=Pai386(p)^.op1) then begin - hp2:=pai(p^.next^.next); - hp1:=pai(p^.next); + hp2:=pai(hp1^.next); asml^.remove(p); asml^.remove(hp1); dispose(p,done); @@ -1132,13 +1242,14 @@ Var LoLab, HiLab, LabDif: Longint; Begin If (Pai386(p)^.size = S_W) And (Pai386(p)^.op1t = Top_Const) And - Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_instruction) And - (Pai386(p^.next)^._operator = A_PUSH) And - (Pai386(p^.next)^.op1t = Top_Const) And - (Pai386(p^.next)^.size = S_W) Then +{ Assigned(p^.next) And} + GetNextInstruction(p, hp1) And + (Pai(hp1)^.typ = ait_instruction) And + (Pai386(hp1)^._operator = A_PUSH) And + (Pai386(hp1)^.op1t = Top_Const) And + (Pai386(hp1)^.size = S_W) Then Begin - hp1 := Pai(p^.next); +{ hp1 := Pai(p^.next);} Pai386(p)^.Size := S_L; Pai386(p)^.op1 := Pointer(Longint(Pai386(p)^.op1) shl 16 + Longint(Pai386(hp1)^.op1)); AsmL^.Remove(hp1); @@ -1166,35 +1277,36 @@ Var LoLab, HiLab, LabDif: Longint; TmpRef^.isintvalue := false; TmpRef^.offset := 0; While TmpBool1 And - Assigned(p^.next) And - (Pai(p^.next)^.typ = ait_instruction) And - ((Pai386(p^.next)^._operator = A_ADD) Or - (Pai386(p^.next)^._operator = A_SUB)) And - (Pai386(p^.next)^.op2t = Top_Reg) And - (Pai386(p^.next)^.op2 = Pai386(p)^.op2) Do +{ Assigned(p^.next) And} + GetNextInstruction(p, hp1) And + (Pai(hp1)^.typ = ait_instruction) And + ((Pai386(hp1)^._operator = A_ADD) Or + (Pai386(hp1)^._operator = A_SUB)) And + (Pai386(hp1)^.op2t = Top_Reg) And + (Pai386(hp1)^.op2 = Pai386(p)^.op2) Do Begin TmpBool1 := False; - If (Pai386(p^.next)^.op1t = Top_Const) + If (Pai386(hp1)^.op1t = Top_Const) Then Begin TmpBool1 := True; TmpBool2 := True; - If Pai386(p^.next)^._operator = A_ADD - Then Inc(TmpRef^.offset, Longint(Pai386(p^.next)^.op1)) - Else Dec(TmpRef^.offset, Longint(Pai386(p^.next)^.op1)); - hp1 := Pai(p^.next); + If Pai386(hp1)^._operator = A_ADD + Then Inc(TmpRef^.offset, Longint(Pai386(hp1)^.op1)) + Else Dec(TmpRef^.offset, Longint(Pai386(hp1)^.op1)); +{ hp1 := Pai(p^.next);} AsmL^.Remove(hp1); Dispose(hp1, Done); End Else - If (Pai386(p^.next)^.op1t = Top_Reg) And - (Pai386(p^.next)^._operator = A_ADD) And + If (Pai386(hp1)^.op1t = Top_Reg) And + (Pai386(hp1)^._operator = A_ADD) And (TmpRef^.base = R_NO) Then Begin TmpBool1 := True; TmpBool2 := True; - TmpRef^.base := TRegister(Pai386(p^.next)^.op1); - hp1 := Pai(p^.next); + TmpRef^.base := TRegister(Pai386(hp1)^.op1); +{ hp1 := Pai(p^.next);} AsmL^.Remove(hp1); Dispose(hp1, Done); End; @@ -1264,8 +1376,9 @@ Var LoLab, HiLab, LabDif: Longint; shl const2, %reg to either "sar/and", "shl/and" or just "and" depending on const1 and const2} Begin - hp1 := pai(p^.next); - If Assigned(hp1) and +{ hp1 := pai(p^.next);} + If {Assigned(hp1) and} + GetNextInstruction(p, hp1) And (pai(hp1)^.typ = ait_instruction) and (Pai386(hp1)^._operator = A_SHL) and (Pai386(p)^.op1t = top_const) and @@ -1312,103 +1425,107 @@ Var LoLab, HiLab, LabDif: Longint; AsmL^.remove(hp1); dispose(hp1, done); End; - End; - A_SUB: - {change "subl $2, %esp; pushw x" to "pushl x"} - Begin - If (Pai386(p)^.op1t = top_const) And - (Longint(Pai386(p)^.op1) = 2) And - (Pai386(p)^.op2t = top_reg) And - (TRegister(Pai386(p)^.op2) = R_ESP) - Then - Begin - hp1 := Pai(p^.next); - While Assigned(hp1) And - (Pai(hp1)^.typ = ait_instruction) And - (Pai386(hp1)^._operator <> A_PUSH) Do - hp1 := Pai(hp1^.next); - If Assigned(hp1) And - (Pai(hp1)^.typ = ait_instruction) And - (Pai386(hp1)^._operator = A_PUSH) And - (Pai386(hp1)^.Size = S_W) - Then - Begin - Pai386(hp1)^.size := S_L; - If (Pai386(hp1)^.op1t = top_reg) Then - Pai386(hp1)^.op1 := Pointer(Reg16ToReg32(TRegister(Pai386(hp1)^.op1))); - hp1 := Pai(p^.next); - AsmL^.Remove(p); - Dispose(p, Done); - p := hp1; - Continue - End - Else - If Assigned(p^.last) And - (Pai(p^.last)^.typ = ait_instruction) And - (Pai386(p^.last)^._operator = A_SUB) And - (Pai386(p^.last)^.op1t = top_const) And - (Pai386(p^.last)^.op2t = top_reg) And - (TRegister(Pai386(p^.last)^.Op2) = R_ESP) - Then - Begin - hp1 := Pai(p^.last); - Inc(Longint(Pai386(p)^.op1), Longint(Pai386(hp1)^.op1)); - AsmL^.Remove(hp1); - Dispose(hp1, Done); - End; - End; - End; - A_TEST, A_OR: - {removes the line marked with (x) from the sequence - And/or/xor/add/sub/... $x, %y - test/or %y, %y (x) - j(n)z _Label - - as the first instruction already adjusts the ZF} - Begin - If (Pai386(p)^.op1 = Pai386(p)^.op2) And - (assigned(p^.last)) And - (pai(p^.last)^.typ = ait_instruction) Then - Case Pai386(p^.last)^._operator Of - A_ADD, A_SUB, A_OR, A_XOR, A_AND, A_SHL, A_SHR: - {There are probably more instructions which can be included} - Begin - If (Pai386(p^.last)^.op2 = Pai386(p)^.op1) Then - Begin - hp1 := pai(p^.next); - asml^.remove(p); - dispose(p, done); - p := pai(hp1); - continue - End; - End; - A_DEC, A_INC, A_NEG: - Begin - If (Pai386(p^.last)^.op1 = Pai386(p)^.op1) Then - Begin - hp1 := pai(p^.next); - asml^.remove(p); - dispose(p, done); - p := pai(hp1); - continue - End; - End - End; - End; End; - End - Else - If (Pai(p)^.typ = ait_label) - Then - If Not(Pai_Label(p)^.l^.is_used) - Then - Begin - hp1 := Pai(p^.next); - AsmL^.Remove(p); - Dispose(p, Done); - p := hp1; - Continue - End; + A_SUB: + {change "subl $2, %esp; pushw x" to "pushl x"} + Begin + If (Pai386(p)^.op1t = top_const) And + (Longint(Pai386(p)^.op1) = 2) And + (Pai386(p)^.op2t = top_reg) And + (TRegister(Pai386(p)^.op2) = R_ESP) + Then + Begin + hp1 := Pai(p^.next); + While Assigned(hp1) And + (Pai(hp1)^.typ In [ait_instruction]+SkipInstr) And + (Pai386(hp1)^._operator <> A_PUSH) Do + hp1 := Pai(hp1^.next); + If Assigned(hp1) And + (Pai(hp1)^.typ = ait_instruction) And + (Pai386(hp1)^._operator = A_PUSH) And + (Pai386(hp1)^.Size = S_W) + Then + Begin + Pai386(hp1)^.size := S_L; + If (Pai386(hp1)^.op1t = top_reg) Then + Pai386(hp1)^.op1 := Pointer(Reg16ToReg32(TRegister(Pai386(hp1)^.op1))); + hp1 := Pai(p^.next); + AsmL^.Remove(p); + Dispose(p, Done); + p := hp1; + Continue + End + Else + If {Assigned(p^.last) And} + GetLastInstruction(p, hp1) And + (Pai(hp1)^.typ = ait_instruction) And + (Pai386(hp1)^._operator = A_SUB) And + (Pai386(hp1)^.op1t = top_const) And + (Pai386(hp1)^.op2t = top_reg) And + (TRegister(Pai386(hp1)^.Op2) = R_ESP) + Then + Begin +{ hp1 := Pai(p^.last);} + Inc(Longint(Pai386(p)^.op1), Longint(Pai386(hp1)^.op1)); + AsmL^.Remove(hp1); + Dispose(hp1, Done); + End; + End; + End; + A_TEST, A_OR: + {removes the line marked with (x) from the sequence + And/or/xor/add/sub/... $x, %y + test/or %y, %y (x) + j(n)z _Label + + as the first instruction already adjusts the ZF} + Begin + If (Pai386(p)^.op1 = Pai386(p)^.op2) And +{ (assigned(p^.last)) And} + GetLastInstruction(p, hp1) And + (pai(hp1)^.typ = ait_instruction) Then + Case Pai386(hp1)^._operator Of + A_ADD, A_SUB, A_OR, A_XOR, A_AND, A_SHL, A_SHR: + Begin + If (Pai386(hp1)^.op2 = Pai386(p)^.op1) Then + Begin + hp1 := pai(p^.next); + asml^.remove(p); + dispose(p, done); + p := pai(hp1); + continue + End; + End; + A_DEC, A_INC, A_NEG: + Begin + If (Pai386(hp1)^.op1 = Pai386(p)^.op1) Then + Begin + hp1 := pai(p^.next); + asml^.remove(p); + dispose(p, done); + p := pai(hp1); + continue + End; + End + End; + End; + End; + End; + ait_label: + Begin + If Not(Pai_Label(p)^.l^.is_used) + Then + Begin + hp1 := Pai(p^.next); + AsmL^.Remove(p); + Dispose(p, Done); + p := hp1; + Continue + End; + End; + ait_regalloc: UsedRegs := UsedRegs + [PaiAlloc(p)^.Reg]; + ait_regdealloc: UsedRegs := UsedRegs - [PaiAlloc(p)^.Reg]; + End; p:=pai(p^.next); end; end; @@ -1459,9 +1576,11 @@ end; Begin If (LabDif <> 0) Then Begin +{$IfDef TP} If (MaxAvail >= LabDif*SizeOf(Pai)) Then Begin +{$EndIf TP} GetMem(LTable, LabDif*SizeOf(Pai)); FillChar(LTable^, LabDif*SizeOf(Pai), 0); p := pai(AsmL^.first); @@ -1471,8 +1590,10 @@ end; LTable^[Pai_Label(p)^.l^.nb-LoLab] := p; p := pai(p^.next); End; +{$IfDef TP} End Else LabDif := 0; +{$EndIf TP} End; End; @@ -1488,7 +1609,10 @@ end; End. { $Log$ - Revision 1.4 1998-04-08 19:12:28 jonas + Revision 1.5 1998-04-16 16:53:56 jonas + *** empty log message *** + + Revision 1.4 1998/04/08 19:12:28 jonas * fixed bug where "imul 12,reg" was replaced with a wrong lea sequence Revision 1.3 1998/03/29 17:27:58 florian