12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135 |
- {
- $Id$
- Copyright (c) 1998-2002 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 fpcdefs.inc}
- Interface
- Uses aasmbase,aasmtai,aasmcpu, cpuinfo, cpubase, optbase;
- function CSE(asmL: TAAsmoutput; first, last: Tai; pass: longint): boolean;
- function doReplaceReg(hp: Taicpu; newReg, orgReg: tregister): boolean;
- function changeOp(var o: toper; newReg, orgReg: tregister): boolean;
- function storeBack(p1: Tai; orgReg, newReg: tregister): boolean;
- function NoHardCodedRegs(p: Taicpu; orgReg, newReg: TRegister): boolean;
- function RegSizesOK(oldReg,newReg: TRegister; p: Taicpu): boolean;
- Implementation
- Uses
- {$ifdef replaceregdebug}cutils,{$endif}
- globtype, verbose, cgbase, globals, daopt386, cginfo, rgobj, rropt386;
- {
- Function TaiInSequence(P: Tai; Const Seq: TContent): Boolean;
- Var P1: Tai;
- 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 := Tai(p1.Next);
- End;
- TaiInSequence := TmpResult;
- End;
- }
- function modifiesConflictingMemLocation(p1: Tai; reg: tregister; c: tregContent;
- var regsStillValid: tregset): boolean;
- var
- p, hp: Taicpu;
- tmpRef: treference;
- r,regCounter: tregister;
- opCount: byte;
- dummy: boolean;
- begin
- modifiesConflictingMemLocation := false;
- if p1.typ <> ait_instruction then
- exit;
- p := Taicpu(p1);
- case p.opcode of
- A_MOV,A_MOVSX,A_MOVZX:
- if p.oper[1].typ = top_ref then
- for regCounter.enum := R_EAX to R_EDI do
- begin
- if p.oper[0].typ<>top_reg then
- break;
- if writeToMemDestroysContents(reg32(p.oper[0].reg),p.oper[1].ref^,
- regCounter,c[regCounter.enum],dummy) then
- begin
- exclude(regsStillValid,regCounter.enum);
- modifiesConflictingMemLocation := not(reg.enum in regsStillValid);
- end;
- end
- else
- { if is_reg_var[reg32(p.oper[1].reg)] then }
- for regCounter.enum := R_EAX to R_EDI do
- begin
- if writeDestroysContents(p.oper[1],regCounter,c[regCounter.enum]) then
- begin
- exclude(regsStillValid,regCounter.enum);
- modifiesConflictingMemLocation := not(reg.enum in regsStillValid);
- end
- end;
- A_DIV, A_IDIV, A_MUL, A_IMUL:
- begin
- if (p.ops = 1) then
- begin
- r.enum:=R_EDX;
- if (RS_EDX in rg.is_reg_var_int) 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).enum = R_EDX) and
- getNextInstruction(hp,hp) and
- (hp.typ = ait_instruction) and
- (hp.opcode = A_POP) and
- (hp.oper[0].reg.enum = R_EDX))) then
- for regCounter.enum := R_EAX to R_EDI do
- if writeToRegDestroysContents(r,regCounter,c[regCounter.enum]) then
- begin
- exclude(regsStillValid,R_EDX);
- modifiesConflictingMemLocation := not(reg.enum in regsStillValid);
- end
- end
- else
- { only possible for imul }
- { last operand is always destination }
- if ((p.oper[p.ops-1].reg.number shr 8) in rg.is_reg_var_int) then
- for regCounter.enum := R_EAX to R_EDI do
- begin
- if writeDestroysContents(p.oper[p.ops-1],regCounter,c[regCounter.enum]) then
- begin
- exclude(regsStillValid,regCounter.enum);
- modifiesConflictingMemLocation := not(reg.enum 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.enum := R_EAX to R_EDI do
- if writeDestroysContents(p.oper[0],regCounter,c[regCounter.enum]) then
- begin
- exclude(regsStillValid,regCounter.enum);
- modifiesConflictingMemLocation := not(reg.enum 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.enum := R_EAX to R_EDI do
- if writeDestroysContents(p.oper[1],regCounter,c[regCounter.enum]) then
- begin
- exclude(regsStillValid,regCounter.enum);
- modifiesConflictingMemLocation := not(reg.enum 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.enum := R_EAX to R_EDI do
- if writeDestroysContents(p.oper[2],regCounter,c[regCounter.enum]) then
- begin
- exclude(regsStillValid,regCounter.enum);
- modifiesConflictingMemLocation := not(reg.enum in regsStillValid);
- end;
- Ch_WMemEDI:
- begin
- fillchar(tmpref,sizeof(tmpref),0);
- tmpRef.base.enum := R_EDI;
- tmpRef.index.enum := R_EDI;
- r.enum:=R_NO;
- for regCounter.enum := R_EAX to R_EDI do
- if writeToMemDestroysContents(r,tmpRef,regCounter,c[regCounter.enum],dummy) then
- begin
- exclude(regsStillValid,regCounter.enum);
- modifiesConflictingMemLocation := not(reg.enum in regsStillValid);
- end;
- end;
- end;
- end;
- end;
- function isSimpleMemLoc(const ref: treference): boolean;
- begin
- { isSimpleMemLoc :=
- (ref.index.enum = R_NO) and
- not(ref.base.enum in (rg.usableregsint+[R_EDI]));}
- isSimpleMemLoc :=
- (ref.index.enum = R_NO) and
- not(ref.base.enum in [R_EAX,R_EBX,R_ECX,R_EDX,R_ESI,R_EDI]);
- 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: Tai; var prev: Tai; Reg: TRegister; Var Found: Longint;
- Var RegInfo: TRegInfo; findPrevSeqs: boolean): Boolean;
- var
- regsNotRead, regsStillValid : tregset;
- checkingPrevSequences,
- passedFlagsModifyingInstr,
- passedJump : boolean;
- function getPrevSequence(p: Tai; reg: tregister; currentPrev: Tai; var newPrev: Tai): tregister;
- const
- current_reg: tregister = (enum:R_NO;number:0);
- function stillValid(p: Tai): boolean;
- begin
- stillValid :=
- (p.typ = ait_instruction) and
- (Taicpu(p).opcode <> a_jmp) and
- (pTaiprop(p.optinfo)^.regs[reg.enum].wstate =
- pTaiprop(currentPrev.optinfo)^.regs[reg.enum].wstate) and
- { in case destroyreg is called with doIncState = false }
- (pTaiprop(p.optinfo)^.regs[reg.enum].typ =
- pTaiprop(currentPrev.optinfo)^.regs[reg.enum].typ) and
- (reg.enum in (regsNotRead * regsStillValid));
- passedJump :=
- (p.typ = ait_instruction) and
- (Taicpu(p).is_jmp);
- passedFlagsModifyingInstr :=
- instrWritesFlags(currentPrev);
- end;
- function findChangedRegister(p: Tai): tregister;
- var
- regCounter: tregister;
- begin
- for regCounter.enum := succ(current_reg.enum) to R_EDI do
- with pTaiprop(p.optinfo)^.regs[regCounter.enum] do
- if ((startmod <>
- pTaiprop(currentPrev.optinfo)^.regs[regCounter.enum].startmod) or
- (nrOfMods <>
- pTaiprop(currentPrev.optinfo)^.regs[regCounter.enum].nrOfMods)) and
- (pTaiprop(p.optinfo)^.regs[regCounter.enum].typ in
- [con_ref,con_noRemoveRef]) then
- begin
- findChangedRegister := regCounter;
- current_reg := regCounter;
- exit;
- end;
- current_reg.enum := R_NO;
- findChangedRegister.enum := R_NO;
- end;
- var
- hp, prevFound: Tai;
- tmpResult, regCounter: tregister;
- begin
- if not(current_reg.enum in [R_NO,R_EDI]) then
- begin
- tmpResult := findChangedRegister(currentPrev);
- if tmpResult.enum <> R_NO then
- begin
- getPrevSequence := tmpResult;
- exit;
- end;
- end;
- getPrevSequence.enum := R_NO;
- passedJump := passedJump or
- ((currentPrev.typ = ait_instruction) and
- (Taicpu(currentPrev).is_jmp));
- passedFlagsModifyingInstr := instrWritesFlags(currentPrev);
- { if (passedJump and not(reg.enum in (rg.usableregsint+[R_EDI]))) or
- not getLastInstruction(currentPrev,hp) then
- exit;}
- if (passedJump and not(reg.enum in [R_EAX,R_EBX,R_ECX,R_EDX,R_ESI,R_EDI])) or
- not getLastInstruction(currentPrev,hp) then
- exit;
- prevFound := currentPrev;
- tmpResult.enum := R_NO;
- while (tmpResult.enum = R_NO) and
- stillValid(hp) and
- (pTaiprop(prevFound.optinfo)^.canBeRemoved or
- not(modifiesConflictingMemLocation(prevFound,reg,
- pTaiprop(p.optinfo)^.regs,regsStillValid))) do
- begin
- { only update the regsread for the instructions we already passed }
- if not(pTaiprop(prevFound.optinfo)^.canBeRemoved) then
- for regCounter.enum := R_EAX to R_EDI do
- if regReadByInstruction(regCounter,prevFound) then
- exclude(regsNotRead,regCounter.enum);
- { in case getPreviousInstruction fails and sets hp to nil in the }
- { next iteration }
- prevFound := hp;
- if not(pTaiprop(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.enum in (rg.usableregsint+[R_EDI]))) or}
- (passedJump and not(reg.enum in [R_EAX,R_EBX,R_ECX,R_EDX,R_ESI,R_EDI])) or
- not getLastInstruction(hp,hp) then
- break;
- end;
- getPrevSequence := tmpResult;
- if tmpResult.enum <> R_NO then
- newPrev := prevFound;
- end;
- function getNextRegToTest(var prev: Tai; currentReg: tregister): tregister;
- begin
- if not checkingPrevSequences then
- begin
- Repeat
- Inc(currentReg.enum);
- Until (currentReg.enum > R_EDI) or
- (pTaiprop(prev.optInfo)^.regs[currentReg.enum].typ
- in [con_ref,con_noRemoveRef]);
- if currentReg.enum > R_EDI then
- begin
- if (Taicpu(p).oper[0].typ <> top_ref) or
- isSimpleMemLoc(Taicpu(p).oper[0].ref^) then
- begin
- checkingPrevSequences := true;
- passedJump := false;
- end
- else
- getNextRegToTest.enum := R_NO;
- end
- else getNextRegToTest := currentReg;
- end;
- if checkingPrevSequences then
- if findPrevSeqs then
- getNextRegToTest :=
- getPrevSequence(p,reg,prev,prev)
- else
- getNextRegToTest.enum := R_NO;
- end;
- Var hp2, hp3{, EndMod},highPrev, orgPrev: Tai;
- {Cnt,} OldNrOfMods: Longint;
- startRegInfo, OrgRegInfo, HighRegInfo: TRegInfo;
- regModified: array[R_NO..R_EDI] of boolean;
- HighFound, OrgRegFound: Byte;
- RegCounter, regCounter2, tmpreg, base, index: TRegister;
- OrgRegResult: Boolean;
- TmpResult, flagResultsNeeded: Boolean;
- 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 := [R_EBP, R_ESP];
- new2OldReg[R_EBP].enum := R_EBP;
- new2OldReg[R_ESP].enum := R_ESP;
- oldRegsEncountered := newRegsEncountered;
- end;
- checkingPrevSequences := false;
- passedFlagsModifyingInstr := false;
- flagResultsNeeded := false;
- regsNotRead := [R_EAX,R_EBX,R_ECX,R_EDX,R_ESP,R_EBP,R_EDI,R_ESI];
- regsStillValid := regsNotRead;
- GetLastInstruction(p, prev);
- tmpreg.enum:=R_NO;
- regCounter := getNextRegToTest(prev,tmpreg);
- While (RegCounter.enum <> R_NO) Do
- Begin
- fillchar(regModified,sizeof(regModified),0);
- regInfo := startRegInfo;
- Found := 0;
- hp2 := PTaiProp(prev.OptInfo)^.Regs[RegCounter.enum].StartMod;
- If (prev <> PTaiProp(prev.OptInfo)^.Regs[RegCounter.enum].StartMod)
- Then OldNrOfMods := PTaiProp(prev.OptInfo)^.Regs[RegCounter.enum].NrOfMods
- Else OldNrOfMods := 1;
- hp3 := p;
- While (Found <> OldNrOfMods) And
- { old new }
- InstructionsEquivalent(hp2, hp3, RegInfo) Do
- Begin
- if not checkingPrevSequences and
- (hp3.typ = ait_instruction) and
- ((Taicpu(hp3).opcode = A_MOV) or
- (Taicpu(hp3).opcode = A_MOVZX) or
- (Taicpu(hp3).opcode = A_LEA) or
- (Taicpu(hp3).opcode = A_MOVSX)) and
- (Taicpu(hp3).oper[1].typ = top_reg) and
- not(regInOp(Taicpu(hp3).oper[1].reg,
- Taicpu(hp3).oper[0])) then
- begin
- tmpreg := reg32(Taicpu(hp3).oper[1].reg);
- regInfo.lastReload[tmpreg.enum] := hp3;
- case Taicpu(hp3).oper[0].typ of
- top_ref:
- begin
- base := reg32(Taicpu(hp3).oper[0].ref^.base);
- index := reg32(Taicpu(hp3).oper[0].ref^.index);
- if (found <> 0) and
- ((base.enum = R_NO) or
- regModified[base.enum] or
- (base.enum = current_procinfo.framepointer.enum)) and
- ((index.enum = R_NO) or
- regModified[index.enum]) and
- not(regInRef(tmpReg,Taicpu(hp3).oper[0].ref^)) then
- with pTaiprop(hp3.optinfo)^.regs[tmpreg.enum] do
- if nrOfMods > (oldNrOfMods - found) then
- oldNrOfMods := found + nrOfMods;
- end;
- top_reg:
- if regModified[reg32(Taicpu(hp3).oper[0].reg).enum] then
- with pTaiprop(hp3.optinfo)^.regs[tmpreg.enum] do
- if nrOfMods > (oldNrOfMods - found) then
- oldNrOfMods := found + nrOfMods;
- end;
- end;
- for regCounter2.enum := R_EAX to R_EDI do
- regModified[regCounter2.enum] := regModified[regCounter2.enum] or
- regModifiedByInstruction(regCounter2,hp3);
- if flagResultsNeeded then
- flagResultsNeeded := not instrReadsFlags(hp3);
- if not flagResultsNeeded then
- flagResultsNeeded := pTaiprop(hp3.optinfo)^.FlagsUsed;
- GetNextInstruction(hp2, hp2);
- GetNextInstruction(hp3, hp3);
- Inc(Found);
- End;
- for regCounter2.enum := R_EAX to R_EDI do
- if (regInfo.new2OldReg[regCounter2.enum].enum <> R_NO) and
- (regCounter2.enum in PTaiProp(hp3.optInfo)^.usedRegs) and
- not regLoadedWithNewValue(regCounter2,false,hp3) then
- include(regInfo.regsStillUsedAfterSeq,regCounter2.enum);
- if checkingPrevSequences then
- begin
- for regCounter2.enum := R_EAX to R_EDI do
- if not(regInfo.new2OldReg[regCounter2.enum].enum in [R_NO,regCounter2.enum]) and
- (not(regCounter2.enum in (regsNotRead * regsStillValid)) or
- not(regInfo.new2OldReg[regCounter2.enum].enum in regsStillValid)) then
- begin
- found := 0;
- break;
- end;
- if passedFlagsModifyingInstr and flagResultsNeeded then
- found := 0;
- end;
- If (Found <> OldNrOfMods) or
- { the following is to avoid problems with rangecheck code (see testcse2) }
- (assigned(hp3) and
- ((reg.enum in regInfo.regsLoadedForRef) and
- (reg.enum in PTaiProp(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 := PTaiProp(Tai(p).OptInfo)^.Regs[Reg.enum].NrOfMods
- End
- Else TmpResult := True;
- If TmpResult And
- (Found > HighFound)
- Then
- Begin
- highPrev := prev;
- HighFound := Found;
- HighRegInfo := RegInfo;
- End;
- If (RegCounter.enum = Reg.enum) 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: Tai);
- Const alignSearch = 12;
- var regsUsable: TRegSet;
- prevInstrCount, nextInstrCount: Longint;
- prevState, nextWState,nextRState: Array[R_EAX..R_EDI] of byte;
- regCounter, lastRemoved: TRegister;
- prev, next: Tai;
- {$ifdef alignregdebug}
- temp: Tai;
- {$endif alignregdebug}
- begin
- regsUsable := [R_EAX,R_ECX,R_EDX,R_EBX,{R_ESP,R_EBP,}R_ESI,R_EDI];
- for regCounter.enum := R_EAX to R_EDI do
- begin
- prevState[regCounter.enum] := PTaiProp(p.optInfo)^.Regs[regCounter.enum].wState;
- nextWState[regCounter.enum] := PTaiProp(p.optInfo)^.Regs[regCounter.enum].wState;
- nextRState[regCounter.enum] := PTaiProp(p.optInfo)^.Regs[regCounter.enum].rState;
- end;
- getLastInstruction(p,prev);
- getNextInstruction(p,next);
- lastRemoved := Tai_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 := tai_comment.Create(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[TaiCpu(prev).opcode].ch[1] <> Ch_ALL) and
- (TaiCpu(prev).opcode <> A_JMP) then
- begin
- inc(prevInstrCount);
- for regCounter.enum := R_EAX to R_EDI do
- begin
- if (regCounter.enum in regsUsable) And
- (PTaiProp(prev.optInfo)^.Regs[regCounter.enum].wState <>
- prevState[regCounter.enum]) then
- begin
- lastRemoved := regCounter;
- exclude(regsUsable,regCounter.enum);
- {$ifdef alignregdebug}
- temp := tai_comment.Create(strpnew(
- std_reg2str[regCounter.enum]+' 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 := tai_comment.Create(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.enum] :=
- PTaiProp(prev.optInfo)^.Regs[regCounter.enum].wState;
- end;
- getLastInstruction(prev,prev);
- end
- else
- If GetLastInstruction(prev,prev) and
- assigned(prev.optinfo) then
- for regCounter.enum := R_EAX to R_EDI do
- prevState[regCounter.enum] :=
- PTaiProp(prev.optInfo)^.Regs[regCounter.enum].wState
- end;
- if assigned(next) and assigned(next.optInfo) and
- (nextInstrCount < alignSearch) then
- begin
- if (next.typ = ait_instruction) and
- (insProp[TaiCpu(next).opcode].ch[1] <> Ch_ALL) and
- (TaiCpu(next).opcode <> A_JMP) then
- begin
- inc(nextInstrCount);
- for regCounter.enum := R_EAX to R_EDI do
- begin
- if (regCounter.enum in regsUsable) And
- ((PTaiProp(next.optInfo)^.Regs[regCounter.enum].wState <>
- nextWState[regCounter.enum]) or
- (PTaiProp(next.optInfo)^.Regs[regCounter.enum].rState <>
- nextRState[regCounter.enum])) Then
- begin
- lastRemoved := regCounter;
- exclude(regsUsable,regCounter.enum);
- {$ifdef alignregdebug}
- temp := tai_comment.Create(strpnew(
- std_reg2str[regCounter.enum]+' 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 := tai_comment.Create(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.enum] :=
- PTaiProp(next.optInfo)^.Regs[regCounter.enum].wState;
- nextRState[regCounter.enum] :=
- PTaiProp(next.optInfo)^.Regs[regCounter.enum].rState;
- end
- end
- else
- for regCounter.enum := R_EAX to R_EDI do
- begin
- nextWState[regCounter.enum] :=
- PTaiProp(next.optInfo)^.Regs[regCounter.enum].wState;
- nextRState[regCounter.enum] :=
- PTaiProp(next.optInfo)^.Regs[regCounter.enum].rState;
- end;
- getNextInstruction(next,next);
- end;
- end;
- if regsUsable <> [] then
- for regCounter.enum := R_EAX to R_EDI do
- if regCounter.enum in regsUsable then
- begin
- lastRemoved := regCounter;
- break
- end;
- {$ifdef alignregdebug}
- next := tai_comment.Create(strpnew(std_reg2str[lastRemoved.enum]+
- ' 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}
- Tai_align(p).reg := lastRemoved;
- End;
- procedure clearmemwrites(p: tai; reg: tregister);
- var
- beginmemwrite: tai;
- begin
- beginmemwrite := pTaiprop(p.optinfo)^.regs[reg.enum].memwrite;
- repeat
- pTaiprop(p.optinfo)^.regs[reg.enum].memwrite := nil;
- until not getnextinstruction(p,p) or
- (pTaiprop(p.optinfo)^.regs[reg.enum].memwrite <> beginmemwrite);
- end;
- Procedure ClearRegContentsFrom(reg: TRegister; p, endP: Tai);
- { 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: Tai;
- l: longint;
- {$endif replaceregdebug}
- regcounter: tregister;
- oldStartmod: Tai;
- begin
- {$ifdef replaceregdebug}
- l := random(1000);
- hp := tai_comment.Create(strpnew(
- 'cleared '+std_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}
- PTaiProp(p.optInfo)^.Regs[reg.enum].typ := con_unknown;
- While (p <> endP) Do
- Begin
- for regcounter.enum := R_EAX to R_EDI do
- if (regcounter.enum <> reg.enum) and
- assigned(pTaiprop(p.optinfo)^.regs[reg.enum].memwrite) and
- reginref(regcounter,pTaiprop(p.optinfo)^.regs[reg.enum].memwrite.oper[1].ref^) then
- clearmemwrites(p,regcounter);
- with PTaiProp(p.optInfo)^.Regs[reg.enum] do
- begin
- typ := con_unknown;
- memwrite := nil;
- end;
- getNextInstruction(p,p);
- end;
- oldStartmod := PTaiProp(p.optInfo)^.Regs[reg.enum].startmod;
- repeat
- with PTaiProp(p.optInfo)^.Regs[reg.enum] do
- begin
- typ := con_unknown;
- memwrite := nil;
- end;
- until not getNextInstruction(p,p) or
- (PTaiProp(p.optInfo)^.Regs[reg.enum].startmod <> oldStartmod);
- {$ifdef replaceregdebug}
- if assigned(p) then
- begin
- hp := tai_comment.Create(strpnew(
- 'cleared '+std_reg2str[reg.enum]+' 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;
- Procedure RestoreRegContentsTo(reg: TRegister; const c: TContent; p, endP: Tai);
- var
- {$ifdef replaceregdebug}
- hp: Tai;
- l: longint;
- {$endif replaceregdebug}
- tmpState: byte;
- begin
- {$ifdef replaceregdebug}
- l := random(1000);
- hp := tai_comment.Create(strpnew(
- 'restored '+std_reg2str[reg.enum]+' 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}
- { PTaiProp(p.optInfo)^.Regs[reg] := c;}
- While (p <> endP) Do
- Begin
- PTaiProp(p.optInfo)^.Regs[reg.enum] := c;
- getNextInstruction(p,p);
- end;
- tmpState := PTaiProp(p.optInfo)^.Regs[reg.enum].wState;
- repeat
- PTaiProp(p.optInfo)^.Regs[reg.enum] := c;
- until not getNextInstruction(p,p) or
- (PTaiProp(p.optInfo)^.Regs[reg.enum].wState <> tmpState) or
- (p.typ = ait_label);
- if assigned(p) and
- (p.typ = ait_label) then
- clearRegContentsFrom(reg,p,p);
- {$ifdef replaceregdebug}
- if assigned(p) then
- begin
- hp := tai_comment.Create(strpnew(
- 'restored '+std_reg2str[reg.enum]+' 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: Taicpu; 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.enum <> R_ECX) and (newReg.enum <> 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; newReg, orgReg: TRegister): boolean;
- begin
- changeReg := true;
- if reg.enum = newReg.enum then
- reg := orgReg
- else if (reg.enum in regset8bit) and
- (reg.enum = changeregsize(newReg,S_B).enum) then
- reg := changeregsize(orgReg,S_B)
- else if (reg.enum in regset16bit) and
- (reg.enum = changeregsize(newReg,S_W).enum) then
- reg := changeregsize(orgReg,S_W)
- else
- changeReg := false;
- end;
- function changeOp(var o: toper; newReg, orgReg: tregister): boolean;
- var
- tmpresult: boolean;
- begin
- changeOp := false;
- case o.typ of
- top_reg: changeOp := changeReg(o.reg,newReg,orgReg);
- top_ref:
- begin
- tmpresult := changeReg(o.ref^.base,newReg,orgReg);
- changeop := changeReg(o.ref^.index,newReg,orgReg) or tmpresult;
- end;
- end;
- end;
- procedure updateStates(orgReg,newReg: tregister; hp: Tai; writeStateToo: boolean);
- var
- prev: Tai;
- newOrgRegRState, newOrgRegWState: byte;
- begin
- if getLastInstruction(hp,prev) then
- with pTaiprop(prev.optinfo)^ do
- begin
- {$ifopt r+}
- {$define rangeon}
- {$r-}
- {$endif}
- newOrgRegRState := regs[orgReg.enum].rState +
- pTaiprop(hp.optinfo)^.regs[newReg.enum].rState - regs[newReg.enum].rstate;
- if writeStateToo then
- newOrgRegWState := regs[orgReg.enum].wState +
- pTaiprop(hp.optinfo)^.regs[newReg.enum].wState - regs[newReg.enum].wstate;
- {$ifdef rangeon}
- {$undef rangeon}
- {$r+}
- {$endif}
- end
- else
- with pTaiprop(hp.optinfo)^.regs[newReg.enum] do
- begin
- newOrgRegRState := rState;
- if writeStateToo then
- newOrgRegWState := wState;
- end;
- with pTaiprop(hp.optinfo)^.regs[orgReg.enum] do
- begin
- rState := newOrgRegRState;
- if writeStateToo then
- wState := newOrgRegwState;
- end;
- end;
- function doReplaceReg(hp: Taicpu; newReg, orgReg: tregister): boolean;
- var
- opCount: longint;
- tmpResult: boolean;
- begin
- for opCount := 0 to hp.ops-1 do
- tmpResult :=
- changeOp(hp.oper[opCount],newReg,orgReg) or tmpResult;
- doReplaceReg := tmpResult;
- end;
- function RegSizesOK(oldReg,newReg: TRegister; p: Taicpu): 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.enum in [R_AL..R_DH]) then
- begin
- RegSizesOK := false;
- break
- end
- end;
- end;
- function doReplaceReadReg(p: Taicpu; newReg,orgReg: tregister): 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],newReg,orgReg) then
- begin
- { updateStates(orgReg,newReg,p,false);}
- doReplaceReadReg := true;
- end;
- if p.ops = 3 then
- if changeOp(p.oper[1],newReg,orgReg) 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],newReg,orgReg) 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,newReg,orgReg) 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,newReg,orgReg) 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,newReg,orgReg) then
- begin
- { updateStates(orgReg,newReg,p,false);}
- doReplaceReadReg := true;
- end;
- end;
- end;
- end;
- end;
- procedure updateState(reg: tregister; p: Tai);
- { 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 pTaiprop(p.optinfo)^.regs[reg.enum] 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 pTaiprop(p.optinfo)^.regs[reg.enum] 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 pTaiprop(p.optinfo)^.regs[reg.enum] do
- begin
- if doRState then
- rState := newRState;
- if doWState then
- wState := newWState;
- end;
- if not getNextInstruction(p,p) then
- break;
- with pTaiprop(p.optinfo)^.regs[reg.enum] 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 storeBack(p1: Tai; orgReg, newReg: tregister): boolean;
- { returns true if p1 contains an instruction that stores the contents }
- { of newReg back to orgReg }
- begin
- storeBack :=
- (p1.typ = ait_instruction) and
- (Taicpu(p1).opcode = A_MOV) and
- (Taicpu(p1).oper[0].typ = top_reg) and
- (Taicpu(p1).oper[0].reg.enum = newReg.enum) and
- (Taicpu(p1).oper[1].typ = top_reg) and
- (Taicpu(p1).oper[1].reg.enum = orgReg.enum);
- end;
- function ReplaceReg(asmL: TAAsmOutput; orgReg, newReg: TRegister; p: Tai;
- const c: TContent; orgRegCanBeModified: Boolean;
- var returnEndP: Tai): 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: Tai;
- removeLast, sequenceEnd, tmpResult, newRegModified, orgRegRead,
- stateChanged, readStateChanged: Boolean;
- 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) and
- not(Taicpu(endp).is_jmp);
- if tmpresult and not assigned(endp.optInfo) then
- begin
- { hp := tai_comment.Create(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 (PTaiProp(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, orgReg, newReg);
- sequenceEnd :=
- { no support for (i)div, mul and imul with hardcoded operands }
- (noHardCodedRegs(Taicpu(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,Taicpu(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,Taicpu(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 *)
- (* already check at the top
- (endp.typ = ait_instruction) and *)
- NoHardCodedRegs(Taicpu(endP),orgReg,newReg) and
- RegSizesOk(orgReg,newReg,Taicpu(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(Taicpu(endP),orgReg,newReg) and
- RegSizesOk(orgReg,newReg,Taicpu(endP)) and
- not(newRegModified and
- (orgReg.enum in PTaiProp(endp.optInfo)^.usedRegs) and
- not(RegLoadedWithNewValue(orgReg,true,Taicpu(endP))))));
- if SequenceEnd then
- begin
- {$ifdef replaceregdebug}
- hp := tai_comment.Create(strpnew(
- 'replacing '+std_reg2str[newreg]+' with '+std_reg2str[orgreg]+
- ' from here...')));
- hp.next := p;
- hp.previous := p.previous;
- p.previous := hp;
- if assigned(hp.previous) then
- hp.previous^.next := hp;
- hp := tai_comment.Create(strpnew(
- 'replaced '+std_reg2str[newreg]+' with '+std_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(PTaiProp(hp.optInfo)^.canBeRemoved) and }
- (hp.typ = ait_instruction) then
- stateChanged :=
- doReplaceReg(Taicpu(hp),newReg,orgReg) 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(Taicpu(endP),newReg,orgReg);
- 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
- pTaiprop(endp.optinfo)^.canBeRemoved := true;
- allocRegBetween(asml,orgReg,p,endP);
- end
- {$ifdef replaceregdebug}
- else
- begin
- hp := tai_comment.Create(strpnew(
- 'replacing '+std_reg2str[newreg]+' with '+std_reg2str[orgreg]+
- ' from here...')));
- hp.previous := p.previous;
- hp.next := p;
- p.previous := hp;
- if assigned(hp.previous) then
- hp.previous^.next := hp;
- hp := tai_comment.Create(strpnew(
- 'replacing '+std_reg2str[newreg]+' with '+std_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: Tai; size: topsize; l: aword; Var Res: TRegister): Boolean;
- {Finds a register which contains the constant l}
- Var Counter: TRegister;
- {$ifdef testing}
- hp: Tai;
- {$endif testing}
- tmpresult: boolean;
- Begin
- Counter.enum := R_NO;
- repeat
- inc(counter.enum);
- tmpresult := (pTaiprop(p.optInfo)^.regs[counter.enum].typ in
- [con_const,con_noRemoveConst]) and
- (Taicpu(PTaiProp(p.OptInfo)^.Regs[Counter.enum].StartMod).opsize = size) and
- (Taicpu(PTaiProp(p.OptInfo)^.Regs[Counter.enum].StartMod).oper[0].typ = top_const) and
- (Taicpu(PTaiProp(p.OptInfo)^.Regs[Counter.enum].StartMod).oper[0].val = l);
- {$ifdef testing}
- if (pTaiprop(p.optInfo)^.regs[counter.enum].typ in [con_const,con_noRemoveConst]) then
- begin
- hp := tai_comment.Create(strpnew(
- 'checking const load of '+tostr(l)+' here...')));
- hp.next := PTaiProp(p.OptInfo)^.Regs[Counter.enum].StartMod;
- hp.previous := PTaiProp(p.OptInfo)^.Regs[Counter.enum].StartMod^.previous;
- PTaiProp(p.OptInfo)^.Regs[Counter.enum].StartMod^.previous := hp;
- if assigned(hp.previous) then
- hp.previous^.next := hp;
- end;
- {$endif testing}
- until tmpresult or (Counter.enum = R_EDI);
- if tmpResult then
- res := Taicpu(PTaiProp(p.OptInfo)^.Regs[Counter.enum].StartMod).oper[1].reg;
- FindRegWithConst := tmpResult;
- End;
- procedure removePrevNotUsedLoad(p: Tai; 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: Tai;
- begin
- if getLastInstruction(p,hp1) then
- with pTaiprop(hp1.optInfo)^.regs[reg.enum] do
- if (typ in [con_ref,con_invalid,con_const]) and
- (nrOfMods = 1) and
- (rState = pTaiprop(startmod.optInfo)^.regs[reg.enum].rState) and
- (not(check) or
- (not(regInInstruction(reg.enum,p)) and
- (not(reg.enum in [R_EAX,R_EBX,R_ECX,R_EDX]) and
- { (not(reg.enum in rg.usableregsint) and}
- (startmod.typ = ait_instruction) and
- ((Taicpu(startmod).opcode = A_MOV) or
- (Taicpu(startmod).opcode = A_MOVZX) or
- (Taicpu(startmod).opcode = A_MOVSX) or
- (Taicpu(startmod).opcode = A_LEA)) and
- (Taicpu(startmod).oper[0].typ = top_ref) and
- (Taicpu(startmod).oper[0].ref^.base.enum = R_ESP)) or
- not(reg.enum in pTaiprop(hp1.optInfo)^.usedRegs) or
- findRegDealloc(reg,p))) then
- pTaiprop(startMod.optInfo)^.canBeRemoved := true;
- end;
- {$ifdef notused}
- function is_mov_for_div(p: Taicpu): boolean;
- begin
- is_mov_for_div :=
- (p.opcode = A_MOV) and
- (p.oper[0].typ = top_const) and
- (p.oper[1].typ = top_reg) and
- (p.oper[1].reg = R_EDX) and
- getNextInstruction(p,p) and
- (p.typ = ait_instruction) and
- ((p.opcode = A_DIV) or
- (p.opcode = A_IDIV));
- end;
- {$endif notused}
- function memtoreg(const t: Taicpu; const ref: treference; var startp: tai): tregister;
- var
- hp: tai;
- p: pTaiprop;
- regcounter: tregister;
- optimizable: boolean;
- begin
- if not getlastinstruction(t,hp) or
- not issimplememloc(ref) then
- begin
- memtoreg.enum := R_NO;
- exit;
- end;
- p := pTaiprop(hp.optinfo);
- optimizable := false;
- for regcounter.enum := R_EAX to R_EDI do
- begin
- if (assigned(p^.regs[regcounter.enum].memwrite) and
- refsequal(ref,p^.regs[regcounter.enum].memwrite.oper[1].ref^)) then
- begin
- optimizable := true;
- hp := p^.regs[regcounter.enum].memwrite;
- end
- else if ((p^.regs[regcounter.enum].typ in [CON_REF,CON_NOREMOVEREF]) and
- (p^.regs[regcounter.enum].nrofmods = 1) and
- ((Taicpu(p^.regs[regcounter.enum].startmod).opcode = A_MOV) or
- (Taicpu(p^.regs[regcounter.enum].startmod).opcode = A_MOVZX) or
- (Taicpu(p^.regs[regcounter.enum].startmod).opcode = A_MOVSX)) and
- (taicpu(p^.regs[regcounter.enum].startmod).oper[0].typ = top_ref) and
- refsequal(ref,taicpu(p^.regs[regcounter.enum].startmod).oper[0].ref^)) then
- begin
- optimizable := true;
- hp := p^.regs[regcounter.enum].startmod;
- end;
- if optimizable then
- if ((t.opsize <> S_B) or
- (regcounter.enum <> R_EDI)) and
- sizescompatible(Taicpu(hp).opsize,t.opsize) then
- begin
- case t.opsize of
- S_B,S_BW,S_BL:
- memtoreg := changeregsize(regcounter,S_B);
- S_W,S_WL:
- memtoreg := changeregsize(regcounter,S_W);
- S_L:
- memtoreg := regcounter;
- end;
- startp := hp;
- exit;
- end;
- end;
- memtoreg.enum := R_NO;
- end;
- procedure removeLocalStores(const t1: tai);
- {var
- p: tai;
- regcount: tregister; }
- begin
- {
- for regcount := LoGPReg to HiGPReg do
- if assigned(pTaiProp(t1.optinfo)^.regs[regcount].memwrite) and
- (taicpu(pTaiProp(t1.optinfo)^.regs[regcount].memwrite).oper[1].ref^.base
- = current_procinfo.framepointer) then
- begin
- pTaiProp(pTaiProp(t1.optinfo)^.regs[regcount].memwrite.optinfo)^.canberemoved := true;
- clearmemwrites(pTaiProp(t1.optinfo)^.regs[regcount].memwrite,regcount);
- end;
- }
- end;
- procedure DoCSE(AsmL: TAAsmOutput; First, Last: Tai; findPrevSeqs, doSubOpts: boolean);
- {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,} orgNrOfMods: longint;
- p, hp1, hp2, prevSeq, prevSeq_next: Tai;
- hp3, hp4: Tai;
- hp5 : Tai;
- RegInfo: TRegInfo;
- RegCounter: TRegister;
- Begin
- p := First;
- SkipHead(p);
- While (p <> Last) Do
- Begin
- Case p.typ Of
- ait_align:
- if not(Tai_align(p).use_op) then
- SetAlignReg(p);
- ait_instruction:
- Begin
- Case Taicpu(p).opcode Of
- A_CALL:
- for regCounter.enum := R_EAX to R_EBX do
- removePrevNotUsedLoad(p,regCounter,true);
- A_CLD: If GetLastInstruction(p, hp1) And
- (PTaiProp(hp1.OptInfo)^.DirFlag = F_NotSet) Then
- PTaiProp(Tai(p).OptInfo)^.CanBeRemoved := True;
- A_LEA, A_MOV, A_MOVZX, A_MOVSX:
- Begin
- hp2 := p;
- Case Taicpu(p).oper[0].typ Of
- top_ref, top_reg:
- if (Taicpu(p).oper[1].typ = top_reg) then
- Begin
- With PTaiProp(p.OptInfo)^.Regs[Reg32(Taicpu(p).oper[1].reg).enum] Do
- Begin
- if (startmod = p) then
- orgNrOfMods := nrOfMods
- else
- orgNrOfMods := 0;
- If (p = StartMod) And
- GetLastInstruction (p, hp1) And
- not(hp1.typ in [ait_marker,ait_label]) then
- {so we don't try to check a sequence when p is the first instruction of the block}
- begin
- {$ifdef csdebug}
- hp5 := tai_comment.Create(strpnew(
- 'cse checking '+std_reg2str[Reg32(Taicpu(p).oper[1].reg)])));
- insertLLItem(asml,p,p.next,hp5);
- {$endif csdebug}
- If CheckSequence(p,prevSeq,Taicpu(p).oper[1].reg, Cnt, RegInfo, findPrevSeqs) 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 }
- *)
- { not anymore: if the start of a new sequence is found while checking (e.g. }
- { above that of eax while checking edx, this new sequence is automatically }
- { also checked }
- Cnt2 := 1;
- While Cnt2 <= Cnt Do
- Begin
- (*
- If not(regInInstruction(Taicpu(hp2).oper[1].reg, p)) and
- not(pTaiprop(p.optinfo)^.canBeRemoved) then
- begin
- if (p.typ = ait_instruction) And
- ((Taicpu(p).OpCode = A_MOV) or
- (Taicpu(p).opcode = A_MOVZX) or
- (Taicpu(p).opcode = A_MOVSX)) And
- (Taicpu(p).oper[1].typ = top_reg) then
- if not is_mov_for_div(Taicpu(p)) then
- begin
- regCounter := reg32(Taicpu(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 := pTaiprop(p.optinfo)^.regs[regCounter].nrofmods downto 1 do
- begin
- if regModifiedByInstruction(regCounter,hp5) then
- PTaiProp(hp5.OptInfo)^.CanBeRemoved := True;
- getNextInstruction(hp5,hp5);
- end;
- end
- {$endif noremove}
- end
- {$ifndef noremove}
- else
- PTaiProp(p.OptInfo)^.CanBeRemoved := True
- {$endif noremove}
- end
- *)
- {$ifndef noremove}
- (* else *)
- PTaiProp(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 := tai_comment.Create(strpnew('New: '+std_reg2str[RegCounter]+', Old: '+
- std_reg2str[RegInfo.New2OldReg[RegCounter]])));
- InsertLLItem(AsmL, Tai(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.enum := R_EAX To R_EDI Do
- If Not(RegCounter.enum in [R_ESP,current_procinfo.framepointer.enum]) And
- (RegInfo.New2OldReg[RegCounter.enum].enum <> R_NO) Then
- Begin
- AllocRegBetween(AsmL,RegInfo.New2OldReg[RegCounter.enum],
- PTaiProp(prevSeq.OptInfo)^.Regs[RegInfo.New2OldReg[RegCounter.enum].enum].StartMod,hp2);
- if hp4 <> prevSeq then
- begin
- if assigned(reginfo.lastReload[regCounter.enum]) then
- getLastInstruction(reginfo.lastReload[regCounter.enum],hp3)
- else if assigned(reginfo.lastReload[regInfo.New2OldReg[regCounter.enum].enum]) then
- getLastInstruction(reginfo.lastReload[regInfo.new2OldReg[regCounter.enum].enum],hp3)
- else hp3 := hp4;
- clearRegContentsFrom(regCounter,prevSeq_next,hp3);
- getnextInstruction(hp3,hp3);
- allocRegBetween(asmL,regCounter,prevSeq,hp3);
- end;
- If Not(RegCounter.enum In RegInfo.RegsLoadedForRef) And
- {old reg new reg}
- (RegInfo.New2OldReg[RegCounter.enum].enum <> RegCounter.enum) Then
- Begin
- getLastInstruction(p,hp3);
- If (hp4 <> prevSeq) or
- {not(regCounter.enum in rg.usableregsint + [R_EDI,R_ESI]) or}
- not(regCounter.enum in [R_EAX,R_EBX,R_ECX,R_EDX,R_EDI,R_ESI]) or
- not ReplaceReg(asmL,RegInfo.New2OldReg[RegCounter.enum],
- regCounter,hp3,
- PTaiProp(PrevSeq.optInfo)^.Regs[regCounter.enum],true,hp5) then
- begin
- hp3 := Tai_Marker.Create(NoPropInfoStart);
- InsertLLItem(AsmL, prevSeq_next.previous,Tai(prevSeq_next), hp3);
- hp5 := Taicpu.Op_Reg_Reg(A_MOV, S_L,
- {old reg new reg}
- RegInfo.New2OldReg[RegCounter.enum], RegCounter);
- new(pTaiprop(hp5.optinfo));
- pTaiprop(hp5.optinfo)^ := pTaiprop(prevSeq_next.optinfo)^;
- pTaiprop(hp5.optinfo)^.canBeRemoved := false;
- InsertLLItem(AsmL, prevSeq_next.previous, Tai(prevSeq_next), hp5);
- hp3 := Tai_Marker.Create(NoPropInfoEnd);
- InsertLLItem(AsmL, prevSeq_next.previous, Tai(prevSeq_next), hp3);
- { adjusts states in previous instruction so that it will }
- { definitely be different from the previous or next state }
- incstate(pTaiprop(hp5.optinfo)^.
- regs[RegInfo.New2OldReg[RegCounter.enum].enum].rstate,20);
- incstate(pTaiprop(hp5.optinfo)^.
- regs[regCounter.enum].wstate,20);
- updateState(RegInfo.New2OldReg[RegCounter.enum],hp5);
- 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.enum 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,
- PTaiProp(hp4.OptInfo)^.Regs[RegCounter.enum],
- hp2,hp3);
- End;
- End;
- (*
- If hp1 <> nil Then
- p := hp1;
- *)
- Continue;
- End
- (*
- Else
- If (PTaiProp(p.OptInfo)^.
- regs[reg32(Taicpu(p).oper[1].reg)].typ
- in [con_ref,con_noRemoveRef]) and
- (PTaiProp(p.OptInfo)^.CanBeRemoved) Then
- if (cnt > 0) then
- begin
- p := hp2;
- Cnt2 := 1;
- While Cnt2 <= Cnt Do
- Begin
- If RegInInstruction(Taicpu(hp2).oper[1].reg, p) Then
- PTaiProp(p.OptInfo)^.CanBeRemoved := False;
- Inc(Cnt2);
- GetNextInstruction(p, p);
- End;
- Continue;
- End
- else
- begin
- { Fix for web bug 972 }
- regCounter := Reg32(Taicpu(p).oper[1].reg);
- cnt := PTaiProp(p.optInfo)^.Regs[regCounter].nrOfMods;
- hp3 := p;
- for cnt2 := 1 to cnt do
- if not(regModifiedByInstruction(regCounter,hp3) and
- not(PTaiProp(hp3.optInfo)^.canBeRemoved)) then
- getNextInstruction(hp3,hp3)
- else
- break;
- getLastInstruction(p,hp4);
- RestoreRegContentsTo(regCounter,
- PTaiProp(hp4.optInfo)^.Regs[regCounter],
- p,hp3);
- end;
- *)
- End;
- End;
- { try to replace the new reg with the old reg }
- if not(PTaiProp(p.optInfo)^.canBeRemoved) then
- if (Taicpu(p).oper[0].typ = top_reg) and
- (Taicpu(p).oper[1].typ = top_reg) and
- { only remove if we're not storing something in a regvar }
- (Taicpu(p).oper[1].reg.enum in [R_EAX,R_EBX,R_ECX,R_EDX,R_ESI,R_EDI]) and
- { (Taicpu(p).oper[1].reg.enum in (rg.usableregsint+[R_EDI])) and}
- (Taicpu(p).opcode = A_MOV) and
- getLastInstruction(p,hp4) and
- { we only have to start replacing from the instruction after the mov, }
- { but replacereg only starts with getnextinstruction(p,p) }
- replaceReg(asmL,Taicpu(p).oper[0].reg,
- Taicpu(p).oper[1].reg,p,
- pTaiprop(hp4.optInfo)^.regs[Taicpu(p).oper[1].reg.enum],false,hp1) then
- begin
- pTaiprop(p.optInfo)^.canBeRemoved := true;
- allocRegBetween(asmL,Taicpu(p).oper[0].reg,
- pTaiProp(p.optInfo)^.regs[Taicpu(p).oper[0].reg.enum].startMod,hp1);
- end
- else
- begin
- if (Taicpu(p).oper[1].typ = top_reg) and
- not regInOp(Taicpu(p).oper[1].reg,Taicpu(p).oper[0]) then
- removePrevNotUsedLoad(p,reg32(Taicpu(p).oper[1].reg),false);
- if doSubOpts and
- (Taicpu(p).opcode <> A_LEA) and
- (Taicpu(p).oper[0].typ = top_ref) then
- begin
- regcounter :=
- memtoreg(taicpu(p),
- Taicpu(p).oper[0].ref^,hp5);
- if regcounter.enum <> R_NO then
- if (taicpu(p).opcode = A_MOV) and
- (taicpu(p).oper[1].typ = top_reg) and
- (taicpu(p).oper[1].reg.enum = regcounter.enum) then
- begin
- pTaiProp(p.optinfo)^.canberemoved := true;
- allocregbetween(asml,reg32(regcounter),hp5,p);
- end
- else
- begin
- Taicpu(p).loadreg(0,regcounter);
- regcounter := reg32(regcounter);
- allocregbetween(asml,regcounter,hp5,p);
- incstate(pTaiProp(p.optinfo)^.regs[regcounter.enum].rstate,1);
- updatestate(regcounter,p);
- end;
- end;
- end;
- { at first, only try optimizations of large blocks, because doing }
- { doing smaller ones may prevent bigger ones from completing in }
- { in the next pass }
- if not doSubOpts and (orgNrOfMods <> 0) then
- begin
- p := hp2;
- for cnt := 1 to pred(orgNrOfMods) do
- getNextInstruction(p,p);
- end;
- End;
- top_symbol,Top_Const:
- Begin
- Case Taicpu(p).oper[1].typ Of
- Top_Reg:
- Begin
- regCounter := Reg32(Taicpu(p).oper[1].reg);
- If GetLastInstruction(p, hp1) Then
- With PTaiProp(hp1.OptInfo)^.Regs[regCounter.enum] Do
- if (typ in [con_const,con_noRemoveConst]) and
- (Taicpu(startMod).opsize >= Taicpu(p).opsize) and
- opsequal(Taicpu(StartMod).oper[0],Taicpu(p).oper[0]) Then
- begin
- PTaiProp(p.OptInfo)^.CanBeRemoved := True;
- allocRegBetween(asmL,regCounter,startMod,p);
- end
- else
- removePrevNotUsedLoad(p,reg32(Taicpu(p).oper[1].reg),false);
- End;
- Top_Ref:
- if (Taicpu(p).oper[0].typ = top_const) and
- getLastInstruction(p,hp1) and
- findRegWithConst(hp1,Taicpu(p).opsize,Taicpu(p).oper[0].val,regCounter) then
- begin
- Taicpu(p).loadreg(0,regCounter);
- allocRegBetween(AsmL,reg32(regCounter),
- PTaiProp(hp1.optinfo)^.regs[reg32(regCounter).enum].startMod,p);
- end;
- End;
- End;
- End;
- End;
- A_LEAVE:
- begin
- if getlastinstruction(p,hp1) then
- removeLocalStores(hp1);
- end;
- A_STD: If GetLastInstruction(p, hp1) And
- (PTaiProp(hp1.OptInfo)^.DirFlag = F_Set) Then
- PTaiProp(Tai(p).OptInfo)^.CanBeRemoved := True;
- else
- begin
- for cnt := 1 to maxch do
- begin
- case InsProp[taicpu(p).opcode].Ch[cnt] of
- Ch_ROp1:
- if (taicpu(p).oper[0].typ = top_ref) and
- ((taicpu(p).opcode < A_F2XM1) or
- ((taicpu(p).opcode > A_IN) and
- (taicpu(p).opcode < A_OUT)) or
- (taicpu(p).opcode = A_PUSH) or
- ((taicpu(p).opcode >= A_RCL) and
- (taicpu(p).opcode <= A_XOR))) then
- begin
- regcounter :=
- memtoreg(taicpu(p),
- Taicpu(p).oper[0].ref^,hp5);
- if regcounter.enum <> R_NO then
- begin
- Taicpu(p).loadreg(0,regcounter);
- regcounter := reg32(regcounter);
- allocregbetween(asml,regcounter,hp5,p);
- incstate(pTaiProp(p.optinfo)^.regs[regcounter.enum].rstate,1);
- updatestate(regcounter,p);
- end;
- end;
- Ch_MOp1:
- if Not(CS_LittleSize in aktglobalswitches) And
- (taicpu(p).oper[0].typ = top_ref) then
- begin
- regcounter :=
- memtoreg(taicpu(p),
- Taicpu(p).oper[0].ref^,hp5);
- if (regcounter.enum <> R_NO) (* and
- (not getNextInstruction(p,hp1) or
- (RegLoadedWithNewValue(reg32(regcounter),false,hp1) or
- FindRegDealloc(reg32(regcounter),hp1))) *) then
- begin
- hp1 := Tai_Marker.Create(NoPropInfoEnd);
- insertllitem(asml,p,p.next,hp1);
- hp1 := taicpu.op_reg_ref(A_MOV,reg2opsize(regcounter),
- regcounter,taicpu(p).oper[0].ref^);
- new(pTaiprop(hp1.optinfo));
- pTaiProp(hp1.optinfo)^ := pTaiProp(p.optinfo)^;
- insertllitem(asml,p,p.next,hp1);
- incstate(pTaiProp(hp1.optinfo)^.regs[reg32(regcounter).enum].rstate,1);
- updatestate(reg32(regcounter),hp1);
- hp1 := Tai_Marker.Create(NoPropInfoStart);
- insertllitem(asml,p,p.next,hp1);
- Taicpu(p).loadreg(0,regcounter);
- regcounter := reg32(regcounter);
- allocregbetween(asml,regcounter,hp5,
- tai(p.next.next));
- end;
- end;
- Ch_ROp2:
- if ((taicpu(p).opcode = A_CMP) or
- (taicpu(p).opcode = A_TEST)) and
- (taicpu(p).oper[1].typ = top_ref) then
- begin
- regcounter :=
- memtoreg(taicpu(p),
- Taicpu(p).oper[1].ref^,hp5);
- if regcounter.enum <> R_NO then
- begin
- Taicpu(p).loadreg(1,regcounter);
- regcounter := reg32(regcounter);
- allocregbetween(asml,regcounter,hp5,p);
- incstate(pTaiProp(p.optinfo)^.regs[regcounter.enum].rstate,1);
- updatestate(regcounter,p);
- end;
- end;
- Ch_MOp2:
- if not(cs_littlesize in aktglobalswitches) and
- (taicpu(p).oper[1].typ = top_ref) and
- ((taicpu(p).opcode < A_BT) or
- ((taicpu(p).opcode > A_IN) and
- (taicpu(p).opcode < A_OUT)) or
- (taicpu(p).opcode = A_PUSH) or
- ((taicpu(p).opcode >= A_RCL) and
- (taicpu(p).opcode <= A_XOR))) then
- begin
- regcounter :=
- memtoreg(taicpu(p),
- Taicpu(p).oper[1].ref^,hp5);
- if (regcounter.enum <> R_NO) (* and
- (not getNextInstruction(p,hp1) or
- (RegLoadedWithNewValue(reg32(regcounter),false,hp1) or
- FindRegDealloc(reg32(regcounter),hp1))) *) then
- begin
- hp1 := Tai_Marker.Create(NoPropInfoEnd);
- insertllitem(asml,p,p.next,hp1);
- hp1 := taicpu.op_reg_ref(A_MOV,reg2opsize(regcounter),
- regcounter,taicpu(p).oper[1].ref^);
- new(pTaiprop(hp1.optinfo));
- pTaiProp(hp1.optinfo)^ := pTaiProp(p.optinfo)^;
- insertllitem(asml,p,p.next,hp1);
- incstate(pTaiProp(hp1.optinfo)^.regs[reg32(regcounter).enum].rstate,1);
- updatestate(reg32(regcounter),hp1);
- hp1 := Tai_Marker.Create(NoPropInfoStart);
- insertllitem(asml,p,p.next,hp1);
- Taicpu(p).loadreg(1,regcounter);
- regcounter := reg32(regcounter);
- allocregbetween(asml,regcounter,hp5,
- tai(p.next.next));
- end;
- end;
- end;
- end;
- end;
- End
- End;
- End;
- GetNextInstruction(p, p);
- End;
- End;
- function removeInstructs(asmL: TAAsmoutput; first, last: Tai): boolean;
- { Removes the marked instructions and disposes the PTaiProps of the other }
- { instructions }
- Var
- p, hp1: Tai;
- nopropinfolevel: longint;
- begin
- removeInstructs := false;
- p := First;
- nopropinfolevel := 0;
- While (p <> Last) Do
- Begin
- If (p.typ = ait_marker) and
- (Tai_marker(p).kind = noPropInfoStart) then
- begin
- hp1 := Tai(p.next);
- asmL.remove(p);
- p.free;
- nopropinfolevel := 1;
- while (nopropinfolevel <> 0) do
- begin
- p := Tai(hp1.next);
- {$ifndef noinstremove}
- { allocregbetween can insert new ait_regalloc objects }
- { without optinfo }
- if (hp1.typ = ait_marker) then
- begin
- case Tai_marker(hp1).kind of
- { they can be nested! }
- noPropInfoStart: inc(nopropinfolevel);
- noPropInfoEnd: dec(nopropinfolevel);
- else
- begin
- hp1 := p;
- continue;
- end;
- end;
- asmL.remove(hp1);
- hp1.free;
- end
- else if assigned(hp1.optinfo) then
- if pTaiprop(hp1.optinfo)^.canBeRemoved then
- begin
- dispose(pTaiprop(hp1.optinfo));
- hp1.optinfo := nil;
- asmL.remove(hp1);
- hp1.free;
- end
- else
- {$endif noinstremove}
- begin
- dispose(pTaiprop(hp1.optinfo));
- hp1.optinfo := nil;
- end;
- hp1 := p;
- end;
- end
- else
- {$ifndef noinstremove}
- if assigned(p.optInfo) and
- PTaiProp(p.optInfo)^.canBeRemoved then
- begin
- hp1 := Tai(p.next);
- AsmL.Remove(p);
- p.free;
- p := hp1;
- removeInstructs := true;
- End
- Else
- {$endif noinstremove}
- Begin
- p.OptInfo := nil;
- p := Tai(p.next);;
- End;
- End;
- End;
- function CSE(AsmL: TAAsmOutput; First, Last: Tai; pass: longint): boolean;
- Begin
- DoCSE(AsmL, First, Last, not(cs_slowoptimize in aktglobalswitches) or (pass >= 2),
- not(cs_slowoptimize in aktglobalswitches) or (pass >= 1));
- { register renaming }
- if not(cs_slowoptimize in aktglobalswitches) or (pass > 0) then
- doRenaming(asmL, first, last);
- cse := removeInstructs(asmL, first, last);
- End;
- End.
- {
- $Log$
- Revision 1.49 2003-07-24 10:45:40 jonas
- * fixed nil pointer access
- Revision 1.48 2003/06/08 18:48:03 jonas
- * first small steps towards an oop optimizer
- Revision 1.47 2003/06/03 21:09:05 peter
- * internal changeregsize for optimizer
- * fix with a hack to not remove the first instruction of a block
- which will leave blockstart pointing to invalid memory
- Revision 1.46 2003/05/30 23:57:08 peter
- * more sparc cleanup
- * accumulator removed, splitted in function_return_reg (called) and
- function_result_reg (caller)
- Revision 1.45 2003/05/16 14:33:31 peter
- * regvar fixes
- Revision 1.44 2003/04/27 11:21:35 peter
- * aktprocdef renamed to current_procdef
- * procinfo renamed to current_procinfo
- * procinfo will now be stored in current_module so it can be
- cleaned up properly
- * gen_main_procsym changed to create_main_proc and release_main_proc
- to also generate a tprocinfo structure
- * fixed unit implicit initfinal
- Revision 1.43 2003/03/28 19:16:57 peter
- * generic constructor working for i386
- * remove fixed self register
- * esi added as address register for i386
- Revision 1.42 2003/03/18 18:15:53 peter
- * changed reg2opsize to function
- Revision 1.41 2003/02/26 21:15:43 daniel
- * Fixed the optimizer
- Revision 1.40 2003/02/19 22:00:15 daniel
- * Code generator converted to new register notation
- - Horribily outdated todo.txt removed
- Revision 1.39 2003/01/08 18:43:57 daniel
- * Tregister changed into a record
- Revision 1.38 2002/08/18 20:06:29 peter
- * inlining is now also allowed in interface
- * renamed write/load to ppuwrite/ppuload
- * tnode storing in ppu
- * nld,ncon,nbas are already updated for storing in ppu
- Revision 1.37 2002/08/17 09:23:44 florian
- * first part of procinfo rewrite
- Revision 1.36 2002/07/01 18:46:31 peter
- * internal linker
- * reorganized aasm layer
- Revision 1.35 2002/05/18 13:34:22 peter
- * readded missing revisions
- Revision 1.34 2002/05/16 19:46:51 carl
- + defines.inc -> fpcdefs.inc to avoid conflicts if compiling by hand
- + try to fix temp allocation (still in ifdef)
- + generic constructor calls
- + start of tassembler / tmodulebase class cleanup
- Revision 1.32 2002/04/21 15:32:59 carl
- * changeregsize -> rg.makeregsize
- Revision 1.31 2002/04/20 21:37:07 carl
- + generic FPC_CHECKPOINTER
- + first parameter offset in stack now portable
- * rename some constants
- + move some cpu stuff to other units
- - remove unused constents
- * fix stacksize for some targets
- * fix generic size problems which depend now on EXTEND_SIZE constant
- * removing frame pointer in routines is only available for : i386,m68k and vis targets
- Revision 1.30 2002/04/15 19:44:20 peter
- * fixed stackcheck that would be called recursively when a stack
- error was found
- * generic changeregsize(reg,size) for i386 register resizing
- * removed some more routines from cga unit
- * fixed returnvalue handling
- * fixed default stacksize of linux and go32v2, 8kb was a bit small :-)
- Revision 1.29 2002/04/15 19:12:09 carl
- + target_info.size_of_pointer -> pointer_size
- + some cleanup of unused types/variables
- * move several constants from cpubase to their specific units
- (where they are used)
- + att_Reg2str -> gas_reg2str
- + int_reg2str -> std_reg2str
- Revision 1.28 2002/04/14 17:00:49 carl
- + att_reg2str -> std_reg2str
- Revision 1.27 2002/04/04 19:06:10 peter
- * removed unused units
- * use tlocation.size in cg.a_*loc*() routines
- Revision 1.26 2002/04/02 17:11:34 peter
- * tlocation,treference update
- * LOC_CONSTANT added for better constant handling
- * secondadd splitted in multiple routines
- * location_force_reg added for loading a location to a register
- of a specified size
- * secondassignment parses now first the right and then the left node
- (this is compatible with Kylix). This saves a lot of push/pop especially
- with string operations
- * adapted some routines to use the new cg methods
- Revision 1.25 2002/03/31 20:26:38 jonas
- + a_loadfpu_* and a_loadmm_* methods in tcg
- * register allocation is now handled by a class and is mostly processor
- independent (+rgobj.pas and i386/rgcpu.pas)
- * temp allocation is now handled by a class (+tgobj.pas, -i386\tgcpu.pas)
- * some small improvements and fixes to the optimizer
- * some register allocation fixes
- * some fpuvaroffset fixes in the unary minus node
- * push/popusedregisters is now called rg.save/restoreusedregisters and
- (for i386) uses temps instead of push/pop's when using -Op3 (that code is
- also better optimizable)
- * fixed and optimized register saving/restoring for new/dispose nodes
- * LOC_FPU locations now also require their "register" field to be set to
- R_ST, not R_ST0 (the latter is used for LOC_CFPUREGISTER locations only)
- - list field removed of the tnode class because it's not used currently
- and can cause hard-to-find bugs
- Revision 1.24 2002/03/04 19:10:12 peter
- * removed compiler warnings
- }
|