12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694 |
- {
- $Id$
- Copyright (c) 1998-2000 by Jonas Maebe, member of the Free Pascal
- development team
- 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;
- {$i defines.inc}
- Interface
- Uses aasm;
- {Procedure CSOpt386(First, Last: Pai);}
- Procedure CSE(AsmL: PAasmOutput; First, Last: Pai);
- Implementation
- Uses
- {$ifdef replaceregdebug}cutils,{$endif}
- verbose, hcodegen, globals,cpubase,cpuasm,DAOpt386, tgeni386;
- {
- 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 modifiesConflictingMemLocation(p1: pai; reg: tregister; c: tregContent;
- var regsStillValid: tregset): boolean;
- var
- p, hp: paicpu;
- tmpRef: treference;
- regCounter: tregister;
- opCount: byte;
- begin
- modifiesConflictingMemLocation := false;
- if p1^.typ <> ait_instruction then
- exit;
- p := paicpu(p1);
- case p^.opcode of
- A_MOV,A_MOVSX,A_MOVZX:
- if p^.oper[1].typ = top_ref then
- for regCounter := R_EAX to R_EDI do
- begin
- if writeToMemDestroysContents(reg32(p^.oper[0].reg),p^.oper[1].ref^,
- regCounter,c[regCounter]) then
- begin
- exclude(regsStillValid,regCounter);
- modifiesConflictingMemLocation := not(reg in regsStillValid);
- end;
- end
- else
- if is_reg_var[reg32(p^.oper[1].reg)] then
- for regCounter := R_EAX to R_EDI do
- begin
- if writeDestroysContents(p^.oper[1],regCounter,c[regCounter]) then
- begin
- exclude(regsStillValid,regCounter);
- modifiesConflictingMemLocation := not(reg in regsStillValid);
- end
- end;
- A_DIV, A_IDIV, A_MUL, A_IMUL:
- begin
- if (p^.ops = 1) then
- begin
- if is_reg_var[R_EDX] and
- (not getNextInstruction(p,hp) or
- not((hp^.typ = ait_instruction) and
- (hp^.opcode = A_MOV) and
- (hp^.oper[0].typ = top_reg) and
- (reg32(hp^.oper[0].reg) = R_EDX) and
- getNextInstruction(hp,hp) and
- (hp^.typ = ait_instruction) and
- (hp^.opcode = A_POP) and
- (hp^.oper[0].reg = R_EDX))) then
- for regCounter := R_EAX to R_EDI do
- if writeToRegDestroysContents(R_EDX,regCounter,c[regCounter]) then
- begin
- exclude(regsStillValid,R_EDX);
- modifiesConflictingMemLocation := not(reg in regsStillValid);
- end
- end
- else
- { only possible for imul }
- { last operand is always destination }
- if is_reg_var[reg32(p^.oper[p^.ops-1].reg)] then
- for regCounter := R_EAX to R_EDI do
- begin
- if writeDestroysContents(p^.oper[p^.ops-1],regCounter,c[regCounter]) then
- begin
- exclude(regsStillValid,regCounter);
- modifiesConflictingMemLocation := not(reg in regsStillValid);
- end
- end
- end;
- else
- for opCount := 1 to MaxCh do
- case InsProp[p^.opcode].Ch[opCount] of
- Ch_MOp1,CH_WOp1,CH_RWOp1:
- if (p^.oper[0].typ = top_ref) or
- ((p^.oper[0].typ = top_reg) and
- is_reg_var[reg32(p^.oper[0].reg)]) then
- for regCounter := R_EAX to R_EDI do
- if writeDestroysContents(p^.oper[0],regCounter,c[regCounter]) then
- begin
- exclude(regsStillValid,regCounter);
- modifiesConflictingMemLocation := not(reg in regsStillValid);
- end;
- Ch_MOp2,CH_WOp2,CH_RWOp2:
- if (p^.oper[1].typ = top_ref) or
- ((p^.oper[1].typ = top_reg) and
- is_reg_var[reg32(p^.oper[1].reg)]) then
- for regCounter := R_EAX to R_EDI do
- if writeDestroysContents(p^.oper[1],regCounter,c[regCounter]) then
- begin
- exclude(regsStillValid,regCounter);
- modifiesConflictingMemLocation := not(reg in regsStillValid);
- end;
- Ch_MOp3,CH_WOp3,CH_RWOp3:
- if (p^.oper[2].typ = top_ref) or
- ((p^.oper[2].typ = top_reg) and
- is_reg_var[reg32(p^.oper[2].reg)]) then
- for regCounter := R_EAX to R_EDI do
- if writeDestroysContents(p^.oper[2],regCounter,c[regCounter]) then
- begin
- exclude(regsStillValid,regCounter);
- modifiesConflictingMemLocation := not(reg in regsStillValid);
- end;
- Ch_WMemEDI:
- begin
- fillchar(tmpref,sizeof(tmpref),0);
- tmpRef.base := R_EDI;
- tmpRef.index := R_EDI;
- for regCounter := R_EAX to R_EDI do
- if writeToMemDestroysContents(R_NO,tmpRef,regCounter,c[regCounter]) then
- begin
- exclude(regsStillValid,regCounter);
- modifiesConflictingMemLocation := not(reg in regsStillValid);
- end;
- end;
- end;
- end;
- end;
- function getPrevSequence(p: pai; reg: tregister; currentPrev: pai; var newPrev: pai;
- var passedJump: boolean; var regsNotRead, regsStillValid: tregset): tregister;
- const
- current_reg: tregister = R_NO;
- function stillValid(p: pai): boolean;
- begin
- stillValid :=
- (p^.typ = ait_instruction) and
- (paicpu(p)^.opcode <> a_jmp) and
- (ppaiprop(p^.optinfo)^.regs[reg].wstate =
- ppaiprop(currentPrev^.optinfo)^.regs[reg].wstate) and
- { in case destroyreg is called with doIncState = false }
- (ppaiprop(p^.optinfo)^.regs[reg].typ =
- ppaiprop(currentPrev^.optinfo)^.regs[reg].typ) and
- (reg in (regsNotRead * regsStillValid));
- passedJump :=
- (p^.typ = ait_instruction) and
- (paicpu(p)^.is_jmp);
- end;
- function findChangedRegister(p: pai): tregister;
- var
- regCounter: tregister;
- begin
- for regCounter := succ(current_reg) to R_EDI do
- with ppaiprop(p^.optinfo)^.regs[regCounter] do
- if ((startmod <>
- ppaiprop(currentPrev^.optinfo)^.regs[regCounter].startmod) or
- (nrOfMods <>
- ppaiprop(currentPrev^.optinfo)^.regs[regCounter].nrOfMods)) and
- (ppaiprop(p^.optinfo)^.regs[regCounter].typ in
- [con_ref,con_noRemoveRef]) then
- begin
- findChangedRegister := regCounter;
- current_reg := regCounter;
- exit;
- end;
- current_reg := R_NO;
- findChangedRegister := R_NO;
- end;
- var
- hp, prevFound: pai;
- tmpResult, regCounter: tregister;
- begin
- if not(current_reg in [R_NO,R_EDI]) then
- begin
- tmpResult := findChangedRegister(currentPrev);
- if tmpResult <> R_NO then
- begin
- getPrevSequence := tmpResult;
- exit;
- end;
- end;
- getPrevSequence := R_NO;
- passedJump := passedJump or
- ((currentPrev^.typ = ait_instruction) and
- (paicpu(currentPrev)^.is_jmp));
- if (passedJump and not(reg in (usableregs+[R_EDI]))) or
- not getLastInstruction(currentPrev,hp) then
- exit;
- prevFound := currentPrev;
- tmpResult := R_NO;
- while (tmpResult = R_NO) and
- stillValid(hp) and
- not(modifiesConflictingMemLocation(prevFound,reg,
- ppaiprop(p^.optinfo)^.regs,regsStillValid)) do
- begin
- { only update the regsread for the instructions we already passed }
- if not(ppaiprop(prevFound^.optinfo)^.canBeRemoved) then
- for regCounter := R_EAX to R_EDI do
- if regReadByInstruction(regCounter,prevFound) then
- exclude(regsNotRead,regCounter);
- { in case getPreviousInstruction fails and sets hp to nil in the }
- { next iteration }
- prevFound := hp;
- if not(ppaiprop(hp^.optinfo)^.canBeRemoved) then
- tmpResult := findChangedRegister(hp);
- if { do not load the self pointer or a regvar before a (conditional) }
- { jump with a new value, since if the jump is taken, the old value }
- { is (probably) still necessary }
- (passedJump and not(reg in (usableregs+[R_EDI]))) or
- not getLastInstruction(hp,hp) then
- break;
- end;
- getPrevSequence := tmpResult;
- if tmpResult <> R_NO then
- newPrev := prevFound;
- end;
- function isSimpleMemLoc(const ref: treference): boolean;
- begin
- isSimpleMemLoc :=
- (ref.index = R_NO) and
- (not(ref.base in (usableregs+[R_EDI])) or
- (assigned(ref.symbol) and
- (ref.base = R_NO) and
- (ref.index = R_NO)));
- end;
- {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}
- Function CheckSequence(p: Pai; var prev: pai; Reg: TRegister; Var Found: Longint;
- Var RegInfo: TRegInfo): Boolean;
- const
- checkingPrevSequences: boolean = false;
- var
- regsNotRead, regsStillValid: tregset;
- function getNextRegToTest(var prev: pai; currentReg: tregister): tregister;
- const
- passedJump: boolean = false;
- begin
- if not checkingPrevSequences then
- begin
- Repeat
- Inc(currentReg);
- Until (currentReg > R_EDI) or
- (ppaiprop(prev^.optInfo)^.regs[currentReg].typ
- in [con_ref,con_noRemoveRef]);
- if currentReg > R_EDI then
- begin
- if isSimpleMemLoc(paicpu(p)^.oper[0].ref^) then
- begin
- checkingPrevSequences := true;
- passedJump := false;
- end
- else
- getNextRegToTest := R_NO;
- end
- else getNextRegToTest := currentReg;
- end;
- if checkingPrevSequences then
- getNextRegToTest :=
- getPrevSequence(p,reg,prev,prev,passedJump,regsNotRead,RegsStillValid);
- end;
- Var hp2, hp3{, EndMod},highPrev, orgPrev: Pai;
- {Cnt,} OldNrOfMods: Longint;
- startRegInfo, OrgRegInfo, HighRegInfo: TRegInfo;
- HighFound, OrgRegFound: Byte;
- RegCounter, regCounter2: TRegister;
- OrgRegResult: Boolean;
- TmpResult: Boolean;
- {TmpState: Byte;}
- Begin {CheckSequence}
- Reg := Reg32(Reg);
- TmpResult := False;
- FillChar(OrgRegInfo, SizeOf(OrgRegInfo), 0);
- FillChar(startRegInfo, sizeof(startRegInfo), 0);
- OrgRegFound := 0;
- HighFound := 0;
- OrgRegResult := False;
- with startRegInfo do
- begin
- newRegsEncountered := [procinfo^.FramePointer, stack_pointer];
- new2OldReg[procinfo^.FramePointer] := procinfo^.FramePointer;
- new2OldReg[stack_pointer] := stack_pointer;
- oldRegsEncountered := newRegsEncountered;
- end;
- checkingPrevSequences := false;
- regsNotRead := [R_EAX,R_EBX,R_ECX,R_EDX,R_ESP,R_EBP,R_EDI,R_ESI];
- regsStillValid := regsNotRead;
- GetLastInstruction(p, prev);
- regCounter := getNextRegToTest(prev,R_NO);
- While (RegCounter <> R_NO) Do
- Begin
- regInfo := startRegInfo;
- Found := 0;
- hp2 := PPaiProp(prev^.OptInfo)^.Regs[RegCounter].StartMod;
- If (prev <> PPaiProp(prev^.OptInfo)^.Regs[RegCounter].StartMod)
- Then OldNrOfMods := PPaiProp(prev^.OptInfo)^.Regs[RegCounter].NrOfMods
- Else OldNrOfMods := 1;
- hp3 := p;
- While (Found <> OldNrOfMods) And
- { old new }
- InstructionsEquivalent(hp2, hp3, RegInfo) Do
- Begin
- if (hp3^.typ = ait_instruction) and
- ((paicpu(hp3)^.opcode = A_MOV) or
- (paicpu(hp3)^.opcode = A_MOVZX) or
- (paicpu(hp3)^.opcode = A_MOVSX)) and
- (paicpu(hp3)^.oper[0].typ in
- [top_const,top_ref,top_symbol]) and
- (paicpu(hp3)^.oper[1].typ = top_reg) and
- not(regInRef(reg32(paicpu(hp3)^.oper[1].reg),
- paicpu(hp3)^.oper[0].ref^)) then
- regInfo.lastReload
- [reg32(paicpu(hp3)^.oper[1].reg)] := hp3;
- GetNextInstruction(hp2, hp2);
- GetNextInstruction(hp3, hp3);
- Inc(Found)
- End;
- for regCounter2 := R_EAX to R_EDI do
- if (regInfo.new2OldReg[regCounter2] <> R_NO) and
- (regCounter2 in PPaiProp(hp3^.optInfo)^.usedRegs) and
- not regLoadedWithNewValue(regCounter2,false,hp3) then
- include(regInfo.regsStillUsedAfterSeq,regCounter2);
- if checkingPrevSequences then
- for regCounter2 := R_EAX to R_EDI do
- if not(regInfo.new2OldReg[regCounter2] in [R_NO,regCounter2]) and
- (not(regCounter2 in (regsNotRead * regsStillValid)) or
- not(regInfo.new2OldReg[regCounter2] in regsStillValid)) then
- begin
- found := 0;
- break;
- end;
- If (Found <> OldNrOfMods) or
- { the following is to avoid problems with rangecheck code (see testcse2) }
- (assigned(hp3) and
- ((reg in regInfo.regsLoadedForRef) and
- (reg in PPaiProp(hp3^.optInfo)^.usedRegs) and
- not regLoadedWithNewValue(reg,false,hp3))) then
- 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
- Else TmpResult := True;
- If TmpResult And
- (Found > HighFound)
- Then
- Begin
- highPrev := prev;
- HighFound := Found;
- HighRegInfo := RegInfo;
- End;
- If (RegCounter = Reg) Then
- Begin
- orgPrev := prev;
- OrgRegFound := Found;
- OrgRegResult := TmpResult;
- OrgRegInfo := RegInfo
- End;
- regCounter := getNextRegToTest(prev,regCounter);
- End;
- If (HighFound > 0) And
- (Not(OrgRegResult) Or
- (HighFound > OrgRegFound))
- Then
- Begin
- {$ifndef fpc}
- TmpResult := True;
- {$else fpc}
- CheckSequence := True;
- {$endif fpc}
- prev := highPrev;
- RegInfo := HighRegInfo;
- Found := HighFound
- End
- Else
- Begin
- {$ifndef fpc}
- TmpResult := OrgRegResult;
- {$else fpc}
- CheckSequence := OrgRegResult;
- {$endif fpc}
- prev := orgPrev;
- Found := OrgRegFound;
- RegInfo := OrgRegInfo;
- End;
- {$ifndef fpc}
- CheckSequence := TmpResult;
- {$endif fpc}
- End; {CheckSequence}
- Procedure SetAlignReg(p: Pai);
- Const alignSearch = 12;
- var regsUsable: TRegSet;
- prevInstrCount, nextInstrCount: Longint;
- prevState, nextWState,nextRState: Array[R_EAX..R_EDI] of byte;
- regCounter, lastRemoved: TRegister;
- prev, next: Pai;
- {$ifdef alignregdebug}
- temp: Pai;
- {$endif alignregdebug}
- begin
- regsUsable := [R_EAX,R_ECX,R_EDX,R_EBX,{R_ESP,R_EBP,}R_ESI,R_EDI];
- for regCounter := R_EAX to R_EDI do
- begin
- prevState[regCounter] := PPaiProp(p^.optInfo)^.Regs[regCounter].wState;
- nextWState[regCounter] := PPaiProp(p^.optInfo)^.Regs[regCounter].wState;
- nextRState[regCounter] := PPaiProp(p^.optInfo)^.Regs[regCounter].rState;
- end;
- getLastInstruction(p,prev);
- getNextInstruction(p,next);
- lastRemoved := pai_align(p)^.reg;
- nextInstrCount := 0;
- prevInstrCount := 0;
- while ((assigned(prev) and
- assigned(prev^.optInfo) and
- (prevInstrCount < alignSearch)) or
- (assigned(next) and
- assigned(next^.optInfo) and
- (nextInstrCount < alignSearch))) And
- (regsUsable <> []) do
- begin
- {$ifdef alignregdebug}
- if assigned(prev) then
- begin
- temp := new(pai_asm_comment,init(strpnew('got here')));
- temp^.next := prev^.next;
- temp^.previous := prev;
- prev^.next := temp;
- if assigned(temp^.next) then
- temp^.next^.previous := temp;
- end;
- {$endif alignregdebug}
- if assigned(prev) and assigned(prev^.optinfo) and
- (prevInstrCount < alignSearch) then
- begin
- if (prev^.typ = ait_instruction) And
- (insProp[PaiCpu(prev)^.opcode].ch[1] <> Ch_ALL) and
- (PaiCpu(prev)^.opcode <> A_JMP) then
- begin
- inc(prevInstrCount);
- for regCounter := R_EAX to R_EDI do
- begin
- if (regCounter in regsUsable) And
- (PPaiProp(prev^.optInfo)^.Regs[regCounter].wState <>
- prevState[regCounter]) then
- begin
- lastRemoved := regCounter;
- exclude(regsUsable,regCounter);
- {$ifdef alignregdebug}
- temp := new(pai_asm_comment,init(strpnew(
- att_reg2str[regCounter]+' removed')));
- temp^.next := prev^.next;
- temp^.previous := prev;
- prev^.next := temp;
- if assigned(temp^.next) then
- temp^.next^.previous := temp;
- if regsUsable = [] then
- begin
- temp := new(pai_asm_comment,init(strpnew(
- 'regsUsable empty here')));
- temp^.next := prev^.next;
- temp^.previous := prev;
- prev^.next := temp;
- if assigned(temp^.next) then
- temp^.next^.previous := temp;
- end;
- {$endif alignregdebug}
- end;
- prevState[regCounter] :=
- PPaiProp(prev^.optInfo)^.Regs[regCounter].wState;
- end;
- getLastInstruction(prev,prev);
- end
- else
- If GetLastInstruction(prev,prev) and
- assigned(prev^.optinfo) then
- for regCounter := R_EAX to R_EDI do
- prevState[regCounter] :=
- PPaiProp(prev^.optInfo)^.Regs[regCounter].wState
- end;
- if assigned(next) and assigned(next^.optInfo) and
- (nextInstrCount < alignSearch) then
- begin
- if (next^.typ = ait_instruction) and
- (insProp[PaiCpu(next)^.opcode].ch[1] <> Ch_ALL) and
- (PaiCpu(next)^.opcode <> A_JMP) then
- begin
- inc(nextInstrCount);
- for regCounter := R_EAX to R_EDI do
- begin
- if (regCounter in regsUsable) And
- ((PPaiProp(next^.optInfo)^.Regs[regCounter].wState <>
- nextWState[regCounter]) or
- (PPaiProp(next^.optInfo)^.Regs[regCounter].rState <>
- nextRState[regCounter])) Then
- begin
- lastRemoved := regCounter;
- exclude(regsUsable,regCounter);
- {$ifdef alignregdebug}
- temp := new(pai_asm_comment,init(strpnew(
- att_reg2str[regCounter]+' removed')));
- temp^.next := next^.next;
- temp^.previous := next;
- next^.next := temp;
- if assigned(temp^.next) then
- temp^.next^.previous := temp;
- if regsUsable = [] then
- begin
- temp := new(pai_asm_comment,init(strpnew(
- 'regsUsable empty here')));
- temp^.next := next^.next;
- temp^.previous := next;
- next^.next := temp;
- if assigned(temp^.next) then
- temp^.next^.previous := temp;
- end;
- {$endif alignregdebug}
- end;
- nextWState[regCounter] :=
- PPaiProp(next^.optInfo)^.Regs[regCounter].wState;
- nextRState[regCounter] :=
- PPaiProp(next^.optInfo)^.Regs[regCounter].rState;
- end
- end
- else
- for regCounter := R_EAX to R_EDI do
- begin
- nextWState[regCounter] :=
- PPaiProp(next^.optInfo)^.Regs[regCounter].wState;
- nextRState[regCounter] :=
- PPaiProp(next^.optInfo)^.Regs[regCounter].rState;
- end;
- getNextInstruction(next,next);
- end;
- end;
- if regsUsable <> [] then
- for regCounter := R_EAX to R_EDI do
- if regCounter in regsUsable then
- begin
- lastRemoved := regCounter;
- break
- end;
- {$ifdef alignregdebug}
- next := new(pai_asm_comment,init(strpnew(att_reg2str[lastRemoved]+
- ' chosen as alignment register')));
- next^.next := p^.next;
- next^.previous := p;
- p^.next := next;
- if assigned(next^.next) then
- next^.next^.previous := next;
- {$endif alignregdebug}
- pai_align(p)^.reg := lastRemoved;
- End;
- Procedure RestoreRegContentsTo(reg: TRegister; const c: TContent; p, endP: pai);
- var
- {$ifdef replaceregdebug}
- hp: pai;
- l: longint;
- {$endif replaceregdebug}
- tmpState: byte;
- begin
- {$ifdef replaceregdebug}
- l := random(1000);
- hp := new(pai_asm_comment,init(strpnew(
- 'restored '+att_reg2str[reg]+' with data from here... '+tostr(l))));
- hp^.next := p;
- hp^.previous := p^.previous;
- p^.previous := hp;
- if assigned(hp^.previous) then
- hp^.previous^.next := hp;
- {$endif replaceregdebug}
- { PPaiProp(p^.optInfo)^.Regs[reg] := c;}
- While (p <> endP) Do
- Begin
- PPaiProp(p^.optInfo)^.Regs[reg] := c;
- getNextInstruction(p,p);
- end;
- tmpState := PPaiProp(p^.optInfo)^.Regs[reg].wState;
- repeat
- PPaiProp(p^.optInfo)^.Regs[reg] := c;
- until not getNextInstruction(p,p) or
- (PPaiProp(p^.optInfo)^.Regs[reg].wState <> tmpState);
- {$ifdef replaceregdebug}
- if assigned(p) then
- begin
- hp := new(pai_asm_comment,init(strpnew(
- 'restored '+att_reg2str[reg]+' till here... '+tostr(l))));
- hp^.next := p;
- hp^.previous := p^.previous;
- p^.previous := hp;
- if assigned(hp^.previous) then
- hp^.previous^.next := hp;
- end;
- {$endif replaceregdebug}
- end;
- function FindRegDealloc(reg: tregister; p: pai): boolean;
- { assumes reg is a 32bit register }
- var
- hp: pai;
- first: boolean;
- begin
- findregdealloc := false;
- first := true;
- while assigned(p^.previous) and
- ((Pai(p^.previous)^.typ in (skipinstr+[ait_align])) or
- ((Pai(p^.previous)^.typ = ait_label) and
- labelCanBeSkipped(pai_label(p^.previous)))) do
- begin
- p := pai(p^.previous);
- if (p^.typ = ait_regalloc) and
- (pairegalloc(p)^.reg = reg) then
- if not(pairegalloc(p)^.allocation) then
- if first then
- begin
- findregdealloc := true;
- break;
- end
- else
- begin
- findRegDealloc :=
- getNextInstruction(p,hp) and
- regLoadedWithNewValue(reg,false,hp);
- break
- end
- else
- first := false;
- end
- end;
- Procedure ClearRegContentsFrom(reg: TRegister; p, endP: pai);
- { first clears the contents of reg from p till endP. Then the contents are }
- { cleared until the first instruction that changes reg }
- var
- {$ifdef replaceregdebug}
- hp: pai;
- l: longint;
- {$endif replaceregdebug}
- oldStartmod: pai;
- begin
- {$ifdef replaceregdebug}
- l := random(1000);
- hp := new(pai_asm_comment,init(strpnew(
- 'cleared '+att_reg2str[reg]+' from here... '+tostr(l))));
- hp^.next := p;
- hp^.previous := p^.previous;
- p^.previous := hp;
- if assigned(hp^.previous) then
- hp^.previous^.next := hp;
- {$endif replaceregdebug}
- PPaiProp(p^.optInfo)^.Regs[reg].typ := con_unknown;
- While (p <> endP) Do
- Begin
- PPaiProp(p^.optInfo)^.Regs[reg].typ := con_unknown;
- getNextInstruction(p,p);
- end;
- oldStartmod := PPaiProp(p^.optInfo)^.Regs[reg].startmod;
- repeat
- PPaiProp(p^.optInfo)^.Regs[reg].typ := con_unknown;
- until not getNextInstruction(p,p) or
- (PPaiProp(p^.optInfo)^.Regs[reg].startmod <> oldStartmod);
- {$ifdef replaceregdebug}
- if assigned(p) then
- begin
- hp := new(pai_asm_comment,init(strpnew(
- 'cleared '+att_reg2str[reg]+' till here... '+tostr(l))));
- hp^.next := p;
- hp^.previous := p^.previous;
- p^.previous := hp;
- if assigned(hp^.previous) then
- hp^.previous^.next := hp;
- end;
- {$endif replaceregdebug}
- end;
- function NoHardCodedRegs(p: paicpu; orgReg, newReg: tRegister): boolean;
- var chCount: byte;
- begin
- case p^.opcode of
- A_IMUL: noHardCodedRegs := p^.ops <> 1;
- A_SHL,A_SHR,A_SHLD,A_SHRD: noHardCodedRegs :=
- (p^.oper[0].typ <> top_reg) or
- ((orgReg <> R_ECX) and (newReg <> R_ECX));
- else
- begin
- NoHardCodedRegs := true;
- with InsProp[p^.opcode] do
- for chCount := 1 to MaxCh do
- if Ch[chCount] in ([Ch_REAX..Ch_MEDI,Ch_WMemEDI,Ch_All]-[Ch_RESP,Ch_WESP,Ch_RWESP]) then
- begin
- NoHardCodedRegs := false;
- break
- end;
- end;
- end;
- end;
- function ChangeReg(var Reg: TRegister; orgReg, newReg: TRegister): boolean;
- begin
- changeReg := true;
- if reg = newReg then
- reg := orgReg
- else if reg = regtoreg8(newReg) then
- reg := regtoreg8(orgReg)
- else if reg = regtoreg16(newReg) then
- reg := regtoreg16(orgReg)
- else changeReg := false;
- end;
- function changeOp(var o: toper; orgReg, newReg: tregister): boolean;
- begin
- case o.typ of
- top_reg: changeOp := changeReg(o.reg,orgReg,newReg);
- top_ref:
- begin
- changeOp :=
- changeReg(o.ref^.base,orgReg,newReg) or
- changeReg(o.ref^.index,orgReg,newReg);
- end;
- end;
- end;
- procedure updateStates(orgReg,newReg: tregister; hp: pai; writeStateToo: boolean);
- var
- prev: pai;
- newOrgRegRState, newOrgRegWState: byte;
- begin
- if getLastInstruction(hp,prev) then
- with ppaiprop(prev^.optinfo)^ do
- begin
- newOrgRegRState := regs[orgReg].rState +
- ppaiprop(hp^.optinfo)^.regs[newReg].rState - regs[newReg].rstate;
- if writeStateToo then
- newOrgRegWState := regs[orgReg].wState +
- ppaiprop(hp^.optinfo)^.regs[newReg].wState - regs[newReg].wstate;
- end
- else
- with ppaiprop(hp^.optinfo)^.regs[newReg] do
- begin
- newOrgRegRState := rState;
- if writeStateToo then
- newOrgRegWState := wState;
- end;
- with ppaiprop(hp^.optinfo)^.regs[orgReg] do
- begin
- rState := newOrgRegRState;
- if writeStateToo then
- wState := newOrgRegwState;
- end;
- end;
- function doReplaceReg(orgReg,newReg: tregister; hp: paicpu): boolean;
- var
- opCount: byte;
- tmpResult: boolean;
- begin
- for opCount := 0 to 2 do
- tmpResult :=
- changeOp(hp^.oper[opCount],orgReg,newReg) or tmpResult;
- doReplaceReg := tmpResult;
- end;
- function RegSizesOK(oldReg,newReg: TRegister; p: paicpu): boolean;
- { oldreg and newreg must be 32bit components }
- var opCount: byte;
- begin
- RegSizesOK := true;
- { if only one of them is a general purpose register ... }
- if (IsGP32reg(oldReg) xor IsGP32Reg(newReg)) then
- begin
- for opCount := 0 to 2 do
- if (p^.oper[opCount].typ = top_reg) and
- (p^.oper[opCount].reg in [R_AL..R_DH]) then
- begin
- RegSizesOK := false;
- break
- end
- end;
- end;
- function doReplaceReadReg(orgReg,newReg: tregister; p: paicpu): boolean;
- var opCount: byte;
- begin
- doReplaceReadReg := false;
- { handle special case }
- case p^.opcode of
- A_IMUL:
- begin
- case p^.ops of
- 1: internalerror(1301001);
- 2,3:
- begin
- if changeOp(p^.oper[0],orgReg,newReg) then
- begin
- { updateStates(orgReg,newReg,p,false);}
- doReplaceReadReg := true;
- end;
- if p^.ops = 3 then
- if changeOp(p^.oper[1],orgReg,newReg) then
- begin
- { updateStates(orgReg,newReg,p,false);}
- doReplaceReadReg := true;
- end;
- end;
- end;
- end;
- A_DIV,A_IDIV,A_MUL: internalerror(1301002);
- else
- begin
- for opCount := 0 to 2 do
- if p^.oper[opCount].typ = top_ref then
- if changeOp(p^.oper[opCount],orgReg,newReg) then
- begin
- { updateStates(orgReg,newReg,p,false);}
- doReplaceReadReg := true;
- end;
- for opCount := 1 to MaxCh do
- case InsProp[p^.opcode].Ch[opCount] of
- Ch_ROp1:
- if p^.oper[0].typ = top_reg then
- if changeReg(p^.oper[0].reg,orgReg,newReg) then
- begin
- { updateStates(orgReg,newReg,p,false);}
- doReplaceReadReg := true;
- end;
- Ch_ROp2:
- if p^.oper[1].typ = top_reg then
- if changeReg(p^.oper[1].reg,orgReg,newReg) then
- begin
- { updateStates(orgReg,newReg,p,false);}
- doReplaceReadReg := true;
- end;
- Ch_ROp3:
- if p^.oper[2].typ = top_reg then
- if changeReg(p^.oper[2].reg,orgReg,newReg) then
- begin
- { updateStates(orgReg,newReg,p,false);}
- doReplaceReadReg := true;
- end;
- end;
- end;
- end;
- end;
- procedure updateState(reg: tregister; p: pai);
- { this procedure updates the read and write states of the instructions }
- { coming after p. It's called when the read/write state of p has been }
- { changed and this change has to be propagated to the following }
- { instructions as well }
- var
- newRState, newWState: byte;
- prevRState, prevWState: byte;
- doRState, doWState: boolean;
- begin
- { get the new read/write states from p }
- with ppaiprop(p^.optinfo)^.regs[reg] do
- begin
- newRState := rState;
- newWState := wState;
- end;
- if not GetNextInstruction(p,p) then
- exit;
- { get the old read/write states from the next instruction, to know }
- { when we can stop updating }
- with ppaiprop(p^.optinfo)^.regs[reg] do
- begin
- prevRState := rState;
- prevWState := wState;
- end;
- { adjust the states if this next instruction reads/writes the register }
- if regReadByInstruction(reg,p) then
- incState(newRState,1);
- if regModifiedByInstruction(reg,p) then
- incState(newWState,1);
- { do we still have to update the read and/or write states? }
- doRState := true;
- doWState := true;
- repeat
- { update the states }
- with ppaiprop(p^.optinfo)^.regs[reg] do
- begin
- if doRState then
- rState := newRState;
- if doWState then
- wState := newWState;
- end;
- if not getNextInstruction(p,p) then
- break;
- with ppaiprop(p^.optinfo)^.regs[reg] do
- begin
- { stop updating the read state if it changes }
- doRState :=
- doRState and (rState = prevRState);
- { if, by accident, this changed state is the same as the one }
- { we've been using, change it to a value that's definitely }
- { different from the previous and next state }
- if not doRState and
- (rState = newRState) then
- begin
- incState(newRState,1);
- prevRState := rState;
- doRState := true;
- end;
- { ditto for the write state }
- doWState :=
- doWState and (WState = prevWState);
- if not doWState and
- (wState = newWState) then
- begin
- incState(newWState,1);
- prevWState := wState;
- doWState := true;
- end;
- end;
- { stop when we don't have to update either state anymore }
- until not(doRState or doWState);
- end;
- function ReplaceReg(asmL: PaasmOutput; orgReg, newReg: TRegister; p: pai;
- const c: TContent; orgRegCanBeModified: Boolean;
- var returnEndP: pai): Boolean;
- { Tries to replace orgreg with newreg in all instructions coming after p }
- { until orgreg gets loaded with a new value. Returns true if successful, }
- { false otherwise. If successful, the contents of newReg are set to c, }
- { which should hold the contents of newReg before the current sequence }
- { started }
- { if the function returns true, returnEndP holds the last instruction }
- { where newReg was replaced by orgReg }
- var endP, hp: Pai;
- removeLast, sequenceEnd, tmpResult, newRegModified, orgRegRead,
- stateChanged, readStateChanged: Boolean;
- function storeBack(p1: pai): boolean;
- { returns true if p1 contains an instruction that stores the contents }
- { of newReg back to orgReg }
- begin
- storeBack :=
- (p1^.typ = ait_instruction) and
- (paicpu(p1)^.opcode = A_MOV) and
- (paicpu(p1)^.oper[0].typ = top_reg) and
- (paicpu(p1)^.oper[0].reg = newReg) and
- (paicpu(p1)^.oper[1].typ = top_reg) and
- (paicpu(p1)^.oper[1].reg = orgReg);
- end;
- begin
- ReplaceReg := false;
- tmpResult := true;
- sequenceEnd := false;
- newRegModified := false;
- orgRegRead := false;
- removeLast := false;
- endP := p;
- while tmpResult and not sequenceEnd do
- begin
- tmpResult :=
- getNextInstruction(endP,endP) and
- (endP^.typ = ait_instruction);
- if tmpresult and not assigned(endP^.optInfo) then
- begin
- { hp := new(pai_asm_comment,init(strpnew('next no optinfo')));
- hp^.next := endp;
- hp^.previous := endp^.previous;
- endp^.previous := hp;
- if assigned(hp^.previous) then
- hp^.previous^.next := hp;}
- exit;
- end;
- If tmpResult and
- { don't take into account instructions that will be removed }
- Not (PPaiProp(endP^.optInfo)^.canBeRemoved) then
- begin
- { if the newReg gets stored back to the oldReg, we can change }
- { "mov %oldReg,%newReg; <operations on %newReg>; mov %newReg, }
- { %oldReg" to "<operations on %oldReg>" }
- removeLast := storeBack(endP);
- sequenceEnd :=
- { no support for (i)div, mul and imul with hardcoded operands }
- (noHardCodedRegs(paicpu(endP),orgReg,newReg) and
- { if newReg gets loaded with a new value, we can stop }
- { replacing newReg with oldReg here (possibly keeping }
- { the original contents of oldReg so we still know them }
- { afterwards) }
- RegLoadedWithNewValue(newReg,true,paicpu(endP)) or
- { we can also stop if we reached the end of the use of }
- { newReg's current contents }
- (GetNextInstruction(endp,hp) and
- FindRegDealloc(newReg,hp)));
- { to be able to remove the first and last instruction of }
- { movl %reg1, %reg2 }
- { <operations on %reg2> (replacing reg2 with reg1 here) }
- { movl %reg2, %reg1 }
- { %reg2 must not be use afterwards (it can be as the }
- { result of a peepholeoptimization) }
- removeLast := removeLast and sequenceEnd;
- newRegModified :=
- newRegModified or
- (not(regLoadedWithNewValue(newReg,true,paicpu(endP))) and
- RegModifiedByInstruction(newReg,endP));
- orgRegRead := newRegModified and RegReadByInstruction(orgReg,endP);
- sequenceEnd := SequenceEnd and
- (removeLast or
- { since newReg will be replaced by orgReg, we can't allow that newReg }
- { gets modified if orgReg is still read afterwards (since after }
- { replacing, this would mean that orgReg first gets modified and then }
- { gets read in the assumption it still contains the unmodified value) }
- not(newRegModified and orgRegRead)) (* and
- { since newReg will be replaced by orgReg, we can't allow that newReg }
- { gets modified if orgRegCanBeModified = false }
- { this now gets checked after the loop (JM) }
- (orgRegCanBeModified or not(newRegModified)) *);
- tmpResult :=
- not(removeLast) and
- not(newRegModified and orgRegRead) and
- (* (orgRegCanBeModified or not(newRegModified)) and *)
- (endP^.typ = ait_instruction) and
- not(paicpu(endP)^.is_jmp) and
- NoHardCodedRegs(paicpu(endP),orgReg,newReg) and
- RegSizesOk(orgReg,newReg,paicpu(endP)) and
- not RegModifiedByInstruction(orgReg,endP);
- end;
- end;
- sequenceEnd := sequenceEnd and
- (removeLast or
- (orgRegCanBeModified or not(newRegModified))) and
- (not(assigned(endp)) or
- not(endp^.typ = ait_instruction) or
- (noHardCodedRegs(paicpu(endP),orgReg,newReg) and
- RegSizesOk(orgReg,newReg,paicpu(endP)) and
- not(newRegModified and
- (orgReg in PPaiProp(endP^.optInfo)^.usedRegs) and
- not(RegLoadedWithNewValue(orgReg,true,paicpu(endP))))));
- if SequenceEnd then
- begin
- {$ifdef replaceregdebug}
- hp := new(pai_asm_comment,init(strpnew(
- 'replacing '+att_reg2str[newreg]+' with '+att_reg2str[orgreg]+
- ' from here...')));
- hp^.next := p;
- hp^.previous := p^.previous;
- p^.previous := hp;
- if assigned(hp^.previous) then
- hp^.previous^.next := hp;
- hp := new(pai_asm_comment,init(strpnew(
- 'replaced '+att_reg2str[newreg]+' with '+att_reg2str[orgreg]+
- ' till here')));
- hp^.next := endp^.next;
- hp^.previous := endp;
- endp^.next := hp;
- if assigned(hp^.next) then
- hp^.next^.previous := hp;
- {$endif replaceregdebug}
- replaceReg := true;
- returnEndP := endP;
- getNextInstruction(p,hp);
- stateChanged := false;
- while hp <> endP do
- begin
- if {not(PPaiProp(hp^.optInfo)^.canBeRemoved) and }
- (hp^.typ = ait_instruction) then
- stateChanged :=
- doReplaceReg(orgReg,newReg,paicpu(hp)) or stateChanged;
- if stateChanged then
- updateStates(orgReg,newReg,hp,true);
- getNextInstruction(hp,hp)
- end;
- if assigned(endp) and (endp^.typ = ait_instruction) then
- readStateChanged :=
- DoReplaceReadReg(orgReg,newReg,paicpu(endP));
- if stateChanged or readStateChanged then
- updateStates(orgReg,newReg,endP,stateChanged);
- if stateChanged or readStateChanged then
- updateState(orgReg,endP);
- { the replacing stops either at the moment that }
- { a) the newreg gets loaded with a new value (one not depending on the }
- { current value of newreg) }
- { b) newreg is completely replaced in this sequence and it's current value }
- { isn't used anymore }
- { In case b, the newreg was completely replaced by oldreg, so it's contents }
- { are unchanged compared the start of this sequence, so restore them }
- If removeLast or
- RegLoadedWithNewValue(newReg,true,endP) then
- GetLastInstruction(endP,hp)
- else hp := endP;
- if removeLast or
- (p <> endp) or
- not RegLoadedWithNewValue(newReg,true,endP) then
- RestoreRegContentsTo(newReg,c,p,hp);
- { In both case a and b, it is possible that the new register was modified }
- { (e.g. an add/sub), so if it was replaced by oldreg in that instruction, }
- { oldreg's contents have been changed. To take this into account, we simply }
- { set the contents of orgreg to "unknown" after this sequence }
- if newRegModified then
- ClearRegContentsFrom(orgReg,p,hp);
- if removeLast then
- ppaiprop(endP^.optinfo)^.canBeRemoved := true;
- allocRegBetween(asml,orgReg,p,endP);
- end
- {$ifdef replaceregdebug}
- else
- begin
- hp := new(pai_asm_comment,init(strpnew(
- 'replacing '+att_reg2str[newreg]+' with '+att_reg2str[orgreg]+
- ' from here...')));
- hp^.previous := p^.previous;
- hp^.next := p;
- p^.previous := hp;
- if assigned(hp^.previous) then
- hp^.previous^.next := hp;
- hp := new(pai_asm_comment,init(strpnew(
- 'replacing '+att_reg2str[newreg]+' with '+att_reg2str[orgreg]+
- ' failed here')));
- hp^.next := endp^.next;
- hp^.previous := endp;
- endp^.next := hp;
- if assigned(hp^.next) then
- hp^.next^.previous := hp;
- end;
- {$endif replaceregdebug}
- End;
- Function FindRegWithConst(p: Pai; size: topsize; l: longint; Var Res: TRegister): Boolean;
- {Finds a register which contains the constant l}
- Var Counter: TRegister;
- {$ifdef testing}
- hp: pai;
- {$endif testing}
- tmpresult: boolean;
- Begin
- Counter := R_NO;
- repeat
- inc(counter);
- tmpresult := (ppaiprop(p^.optInfo)^.regs[counter].typ in
- [con_const,con_noRemoveConst]) and
- (paicpu(PPaiProp(p^.OptInfo)^.Regs[Counter].StartMod)^.opsize = size) and
- (paicpu(PPaiProp(p^.OptInfo)^.Regs[Counter].StartMod)^.oper[0].typ = top_const) and
- (paicpu(PPaiProp(p^.OptInfo)^.Regs[Counter].StartMod)^.oper[0].val = l);
- {$ifdef testing}
- if (ppaiprop(p^.optInfo)^.regs[counter].typ in [con_const,con_noRemoveConst]) then
- begin
- hp := new(pai_asm_comment,init(strpnew(
- 'checking const load of '+tostr(l)+' here...')));
- hp^.next := PPaiProp(p^.OptInfo)^.Regs[Counter].StartMod;
- hp^.previous := PPaiProp(p^.OptInfo)^.Regs[Counter].StartMod^.previous;
- PPaiProp(p^.OptInfo)^.Regs[Counter].StartMod^.previous := hp;
- if assigned(hp^.previous) then
- hp^.previous^.next := hp;
- end;
- {$endif testing}
- until tmpresult or (Counter = R_EDI);
- res := counter;
- FindRegWithConst := tmpResult;
- End;
- procedure removePrevNotUsedLoad(p: pai; reg: tRegister; check: boolean);
- { If check = true, it means the procedure has to check whether it isn't }
- { possible that the contents are still used after p (used when removing }
- { instructions because of a "call"), otherwise this is not necessary }
- { (e.g. when you have a "mov 8(%ebp),%eax", you can be sure the previous }
- { value of %eax isn't used anymore later on) }
- var
- hp1: pai;
- begin
- if getLastInstruction(p,hp1) then
- with ppaiprop(hp1^.optInfo)^.regs[reg] do
- if (typ in [con_ref,con_invalid]) and
- (nrOfMods = 1) and
- (rState = ppaiprop(startmod^.optInfo)^.regs[reg].rState) and
- (not(check) or
- (not(regInInstruction(reg,p)) and
- (not(reg in usableregs) and
- (startmod^.typ = ait_instruction) and
- ((paicpu(startmod)^.opcode = A_MOV) or
- (paicpu(startmod)^.opcode = A_MOVZX) or
- (paicpu(startmod)^.opcode = A_MOVSX)) and
- (paicpu(startmod)^.oper[0].typ = top_ref) and
- (paicpu(startmod)^.oper[0].ref^.base = stack_pointer)) or
- not(reg in ppaiprop(hp1^.optInfo)^.usedRegs) or
- findRegDealloc(reg,p))) then
- ppaiprop(startMod^.optInfo)^.canBeRemoved := true;
- end;
- 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, cnt3: longint;
- p, hp1, hp2, prevSeq, prevSeq_next: Pai;
- hp3, hp4: pai;
- hp5 : pai;
- RegInfo: TRegInfo;
- RegCounter: TRegister;
- Begin
- p := First;
- SkipHead(p);
- First := p;
- While (p <> Last) Do
- Begin
- Case p^.typ Of
- ait_align:
- if not(pai_align(p)^.use_op) then
- SetAlignReg(p);
- ait_instruction:
- Begin
- Case Paicpu(p)^.opcode Of
- A_CALL:
- for regCounter := R_EAX to R_EBX do
- removePrevNotUsedLoad(p,regCounter,true);
- 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 Paicpu(p)^.oper[0].typ Of
- Top_Ref:
- Begin {destination is always a register in this case}
- With PPaiProp(p^.OptInfo)^.Regs[Reg32(Paicpu(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}
- begin
- {$ifdef csdebug}
- hp5 := new(pai_asm_comment,init(strpnew(
- 'cse checking '+att_reg2str[Reg32(Paicpu(p)^.oper[1].reg)])));
- insertLLItem(asml,p,p^.next,hp5);
- {$endif csdebug}
- If CheckSequence(p,prevSeq,Paicpu(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 Not(RegInInstruction(Paicpu(hp2)^.oper[1].reg, p)) then
- begin
- if ((p^.typ = ait_instruction) And
- ((paicpu(p)^.OpCode = A_MOV) or
- (paicpu(p)^.opcode = A_MOVZX) or
- (paicpu(p)^.opcode = A_MOVSX)) And
- (paicpu(p)^.Oper[0].typ in
- [top_const,top_ref,top_symbol])) and
- (paicpu(p)^.oper[1].typ = top_reg) then
- begin
- regCounter := reg32(paicpu(p)^.oper[1].reg);
- if (regCounter in reginfo.regsStillUsedAfterSeq) then
- begin
- if (hp1 = nil) then
- hp1 := reginfo.lastReload[regCounter];
- end
- {$ifndef noremove}
- else
- begin
- hp5 := p;
- for cnt3 := ppaiprop(p^.optinfo)^.regs[regCounter].nrofmods downto 1 do
- begin
- if regModifiedByInstruction(regCounter,hp5) then
- PPaiProp(hp5^.OptInfo)^.CanBeRemoved := True;
- getNextInstruction(hp5,hp5);
- end;
- end
- {$endif noremove}
- end
- end
- {$ifndef noremove}
- else
- PPaiProp(p^.OptInfo)^.CanBeRemoved := True
- {$endif noremove}
- ; Inc(Cnt2);
- GetNextInstruction(p, p);
- End;
- {hp4 is used to get the contents of the registers before the sequence}
- GetLastInstruction(hp2, hp4);
- getNextInstruction(prevSeq,prevSeq_next);
- {$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}
- { If some registers were different in the old and the new sequence, move }
- { the contents of those old registers to the new ones }
- For RegCounter := R_EAX To R_EDI Do
- If Not(RegCounter in [R_ESP,procinfo^.framepointer]) And
- (RegInfo.New2OldReg[RegCounter] <> R_NO) Then
- Begin
- AllocRegBetween(AsmL,RegInfo.New2OldReg[RegCounter],
- PPaiProp(prevSeq^.OptInfo)^.Regs[RegInfo.New2OldReg[RegCounter]].StartMod,prevSeq_next);
- if hp4 <> prevSeq then
- begin
- if assigned(reginfo.lastReload[regCounter]) then
- getLastInstruction(reginfo.lastReload[regCounter],hp3)
- else hp3 := hp4;
- if prevSeq <> hp3 then
- clearRegContentsFrom(regCounter,prevSeq_next,
- hp3);
- allocRegBetween(asmL,regCounter,prevSeq,hp3);
- end;
- If Not(RegCounter In RegInfo.RegsLoadedForRef) And
- {old reg new reg}
- (RegInfo.New2OldReg[RegCounter] <> RegCounter) Then
- Begin
- getLastInstruction(p,hp3);
- If (hp4 <> prevSeq) or
- not(regCounter in usableRegs + [R_EDI,R_ESI]) or
- not ReplaceReg(asmL,RegInfo.New2OldReg[RegCounter],
- regCounter,hp3,
- PPaiProp(PrevSeq^.optInfo)^.Regs[regCounter],true,hp5) then
- begin
- hp3 := New(Pai_Marker,Init(NoPropInfoEnd));
- InsertLLItem(AsmL, prevSeq, Pai(prevSeq^.next), hp3);
- hp3 := New(Paicpu,Op_Reg_Reg(A_MOV, S_L,
- {old reg new reg}
- RegInfo.New2OldReg[RegCounter], RegCounter));
- InsertLLItem(AsmL, prevSeq, Pai(prevSeq^.next), hp3);
- hp3 := New(Pai_Marker,Init(NoPropInfoStart));
- InsertLLItem(AsmL, prevSeq, Pai(prevSeq^.next), hp3);
- { adjusts states in previous instruction so that it will }
- { definitely be different from the previous or next state }
- incstate(ppaiprop(prevSeq_next^.optinfo)^.
- regs[RegInfo.New2OldReg[RegCounter]].rstate,20);
- incstate(ppaiprop(prevSeq_next^.optinfo)^.
- regs[regCounter].wstate,20);
- updateState(RegInfo.New2OldReg[RegCounter],
- prevSeq_next);
- end
- End
- Else
- { 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 (= registers in }
- { RegLoadedForRef, have to be changed to their contents from before the }
- { sequence. }
- If RegCounter in RegInfo.RegsLoadedForRef Then
- Begin
- hp3 := hp2;
- { cnt still holds the number of instructions }
- { of the sequence, so go to the end of it }
- for cnt2 := 1 to pred(cnt) Do
- getNextInstruction(hp3,hp3);
- { hp4 = instruction prior to start of sequence }
- restoreRegContentsTo(regCounter,
- PPaiProp(hp4^.OptInfo)^.Regs[RegCounter],
- hp2,hp3);
- End;
- End;
- If hp1 <> nil Then
- p := hp1;
- Continue;
- End
- Else
- If (PPaiProp(p^.OptInfo)^.
- regs[reg32(paicpu(p)^.oper[1].reg)].typ
- in [con_ref,con_noRemoveRef]) and
- (PPaiProp(p^.OptInfo)^.CanBeRemoved) Then
- if (cnt > 0) then
- begin
- hp2 := p;
- Cnt2 := 1;
- While Cnt2 <= Cnt Do
- Begin
- If RegInInstruction(Paicpu(hp2)^.oper[1].reg, p) Then
- PPaiProp(p^.OptInfo)^.CanBeRemoved := False;
- Inc(Cnt2);
- GetNextInstruction(p, p);
- End;
- Continue;
- End
- else
- begin
- { Fix for web bug 972 }
- regCounter := Reg32(Paicpu(p)^.oper[1].reg);
- cnt := PPaiProp(p^.optInfo)^.Regs[regCounter].nrOfMods;
- hp3 := p;
- for cnt2 := 1 to cnt do
- if not(regModifiedByInstruction(regCounter,hp3) and
- not(PPaiProp(hp3^.optInfo)^.canBeRemoved)) then
- getNextInstruction(hp3,hp3)
- else
- break;
- getLastInstruction(p,hp4);
- RestoreRegContentsTo(regCounter,
- PPaiProp(hp4^.optInfo)^.Regs[regCounter],
- p,hp3);
- end;
- End;
- End;
- if not ppaiprop(p^.optinfo)^.canBeRemoved and
- not regInRef(reg32(paicpu(p)^.oper[1].reg),
- paicpu(p)^.oper[0].ref^) then
- removePrevNotUsedLoad(p,reg32(paicpu(p)^.oper[1].reg),false);
- End;
- top_Reg:
- { try to replace the new reg with the old reg }
- if not(PPaiProp(p^.optInfo)^.canBeRemoved) and
- { only remove if we're not storing something in a regvar }
- (paicpu(p)^.oper[1].reg in (usableregs+[R_EDI])) and
- (paicpu(p)^.opcode = A_MOV) and
- getLastInstruction(p,hp4) then
- begin
- case paicpu(p)^.oper[1].typ of
- top_Reg:
- { we only have to start replacing from the instruction after the mov, }
- { but replacereg only starts with getnextinstruction(p,p) }
- if ReplaceReg(asmL,paicpu(p)^.oper[0].reg,
- paicpu(p)^.oper[1].reg,p,
- PPaiProp(hp4^.optInfo)^.Regs[paicpu(p)^.oper[1].reg],false,hp1) then
- begin
- PPaiProp(p^.optInfo)^.canBeRemoved := true;
- allocRegBetween(asmL,paicpu(p)^.oper[0].reg,
- PPaiProp(p^.optInfo)^.regs[paicpu(p)^.oper[0].reg].startMod,
- hp1);
- end
- else
- if reg32(paicpu(p)^.oper[0].reg) <> reg32(paicpu(p)^.oper[1].reg) then
- removePrevNotUsedLoad(p,reg32(paicpu(p)^.oper[1].reg),false);
- end
- end;
- top_symbol,Top_Const:
- Begin
- Case Paicpu(p)^.oper[1].typ Of
- Top_Reg:
- Begin
- regCounter := Reg32(Paicpu(p)^.oper[1].reg);
- If GetLastInstruction(p, hp1) Then
- With PPaiProp(hp1^.OptInfo)^.Regs[regCounter] Do
- if (typ in [con_const,con_noRemoveConst]) and
- (paicpu(startMod)^.opsize >= paicpu(p)^.opsize) and
- opsequal(paicpu(StartMod)^.oper[0],paicpu(p)^.oper[0]) Then
- begin
- PPaiProp(p^.OptInfo)^.CanBeRemoved := True;
- allocRegBetween(asmL,regCounter,startMod,p);
- end
- else
- removePrevNotUsedLoad(p,reg32(paicpu(p)^.oper[1].reg),false);
- End;
- Top_Ref:
- if (paicpu(p)^.oper[0].typ = top_const) and
- getLastInstruction(p,hp1) and
- findRegWithConst(hp1,paicpu(p)^.opsize,paicpu(p)^.oper[0].val,regCounter) then
- begin
- paicpu(p)^.loadreg(0,regCounter);
- allocRegBetween(AsmL,reg32(regCounter),
- PPaiProp(hp1^.optinfo)^.regs[regCounter].startMod,p);
- end;
- End;
- End;
- End;
- End;
- A_STD: If GetLastInstruction(p, hp1) And
- (PPaiProp(hp1^.OptInfo)^.DirFlag = F_Set) Then
- PPaiProp(Pai(p)^.OptInfo)^.CanBeRemoved := True;
- 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 }
- Var p, hp1: Pai;
- begin
- p := First;
- While (p <> Last) Do
- Begin
- If (p^.typ = ait_marker) and
- (pai_marker(p)^.kind in [noPropInfoStart,noPropInfoEnd]) then
- begin
- hp1 := pai(p^.next);
- asmL^.remove(p);
- dispose(p,done);
- p := hp1
- end
- else
- {$ifndef noinstremove}
- if assigned(p^.optInfo) and
- PPaiProp(p^.optInfo)^.canBeRemoved then
- begin
- hp1 := pai(p^.next);
- AsmL^.Remove(p);
- Dispose(p, Done);
- p := hp1;
- End
- Else
- {$endif noinstremove}
- Begin
- p^.OptInfo := nil;
- p := pai(p^.next);;
- End;
- End;
- FreeMem(PaiPropBlock, NrOfPaiObjs*(((SizeOf(TPaiProp)+3)div 4)*4))
- End;
- Procedure CSE(AsmL: PAasmOutput; First, Last: Pai);
- Begin
- DoCSE(AsmL, First, Last);
- RemoveInstructs(AsmL, First, Last);
- End;
- End.
- {
- $Log$
- Revision 1.14 2000-09-30 13:07:23 jonas
- * fixed support for -Or with new features of CSE
- Revision 1.13 2000/09/29 23:14:45 jonas
- * search much further back for CSE sequences (non-conflicting stores are
- now passed)
- * remove more unnecessary loads of registers (especially the self pointer)
- Revision 1.12 2000/09/26 11:49:41 jonas
- * writes to register variables and to the self pointer now also count as
- memore writes
- Revision 1.11 2000/09/25 09:50:29 jonas
- - removed TP conditional code
- Revision 1.10 2000/09/24 15:06:14 peter
- * use defines.inc
- Revision 1.9 2000/09/22 15:01:59 jonas
- * fixed some bugs in the previous improvements: in some cases, esi was
- still being replaced before a conditional jump (the code that
- detected conditional jumps sometimes skipped over them)
- Revision 1.8 2000/09/20 15:00:58 jonas
- + much improved CSE: the CSE now searches further back for sequences it
- can reuse. After I've also implemented register renaming, the effect
- should be even better (afaik web bug 1088 will then even be optimized
- properly). I don't know about the slow down factor this adds. Maybe
- a new optimization level should be introduced?
- Revision 1.7 2000/08/25 19:40:45 jonas
- * refined previous fix a bit, some instructions weren't being removed
- while they could (merged from fixes branch)
- * made checksequence a bit faster
- Revision 1.6 2000/08/23 12:55:10 jonas
- * fix for web bug 1112 and a bit of clean up in csopt386 (merged from
- fixes branch)
- Revision 1.5 2000/08/04 20:08:03 jonas
- * improved detection of range of instructions which use a register
- (merged from fixes branch)
- Revision 1.4 2000/07/21 15:19:54 jonas
- * daopt386: changes to getnextinstruction/getlastinstruction so they
- ignore labels who have is_addr set
- + daopt386/csopt386: remove loads of registers which are overwritten
- before their contents are used (especially usefull for removing superfluous
- maybe_loadesi outputs and push/pops transformed by below optimization
- + popt386: transform pop/pop/pop/.../push/push/push to sequences of
- 'movl x(%esp),%reg' (only active when compiling a go32v2 compiler
- currently because I don't know whether it's safe to do this under Win32/
- Linux (because of problems we had when using esp as frame pointer on
- those os'es)
- Revision 1.3 2000/07/14 05:11:48 michael
- + Patch to 1.1
- Revision 1.2 2000/07/13 11:32:39 michael
- + removed logs
- }
|