aoptx86.pas 681 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736147371473814739147401474114742147431474414745147461474714748147491475014751147521475314754147551475614757147581475914760147611476214763147641476514766147671476814769147701477114772147731477414775147761477714778147791478014781147821478314784147851478614787147881478914790147911479214793147941479514796147971479814799148001480114802148031480414805148061480714808148091481014811148121481314814148151481614817148181481914820148211482214823148241482514826148271482814829148301483114832148331483414835148361483714838148391484014841148421484314844148451484614847148481484914850148511485214853148541485514856148571485814859148601486114862148631486414865148661486714868148691487014871148721487314874148751487614877148781487914880148811488214883148841488514886148871488814889148901489114892148931489414895148961489714898148991490014901149021490314904149051490614907149081490914910149111491214913149141491514916149171491814919149201492114922149231492414925149261492714928149291493014931149321493314934149351493614937149381493914940149411494214943149441494514946149471494814949149501495114952149531495414955149561495714958149591496014961149621496314964149651496614967149681496914970149711497214973149741497514976149771497814979149801498114982149831498414985149861498714988149891499014991149921499314994149951499614997149981499915000150011500215003150041500515006150071500815009150101501115012150131501415015150161501715018150191502015021150221502315024150251502615027150281502915030150311503215033150341503515036150371503815039150401504115042150431504415045150461504715048150491505015051150521505315054150551505615057150581505915060150611506215063150641506515066150671506815069150701507115072150731507415075150761507715078150791508015081150821508315084150851508615087150881508915090150911509215093150941509515096150971509815099151001510115102151031510415105151061510715108151091511015111151121511315114151151511615117151181511915120151211512215123151241512515126151271512815129151301513115132151331513415135151361513715138151391514015141151421514315144151451514615147151481514915150151511515215153151541515515156151571515815159151601516115162151631516415165151661516715168151691517015171151721517315174151751517615177151781517915180151811518215183151841518515186151871518815189151901519115192151931519415195151961519715198151991520015201152021520315204152051520615207152081520915210152111521215213152141521515216152171521815219152201522115222152231522415225152261522715228152291523015231152321523315234152351523615237152381523915240152411524215243152441524515246152471524815249152501525115252152531525415255152561525715258152591526015261152621526315264152651526615267152681526915270152711527215273152741527515276152771527815279152801528115282152831528415285152861528715288152891529015291152921529315294152951529615297152981529915300153011530215303153041530515306153071530815309153101531115312153131531415315153161531715318153191532015321153221532315324153251532615327153281532915330153311533215333153341533515336153371533815339153401534115342153431534415345153461534715348153491535015351153521535315354153551535615357153581535915360153611536215363153641536515366153671536815369153701537115372153731537415375153761537715378153791538015381153821538315384153851538615387153881538915390153911539215393153941539515396153971539815399154001540115402154031540415405154061540715408154091541015411154121541315414154151541615417154181541915420154211542215423154241542515426154271542815429154301543115432154331543415435154361543715438154391544015441154421544315444154451544615447154481544915450154511545215453154541545515456154571545815459154601546115462154631546415465154661546715468154691547015471154721547315474154751547615477154781547915480154811548215483154841548515486154871548815489154901549115492154931549415495154961549715498154991550015501155021550315504155051550615507155081550915510155111551215513155141551515516155171551815519155201552115522155231552415525155261552715528155291553015531155321553315534155351553615537155381553915540155411554215543155441554515546155471554815549155501555115552155531555415555155561555715558155591556015561155621556315564155651556615567155681556915570155711557215573155741557515576155771557815579155801558115582155831558415585155861558715588155891559015591155921559315594155951559615597155981559915600156011560215603156041560515606156071560815609156101561115612156131561415615156161561715618156191562015621156221562315624156251562615627156281562915630156311563215633156341563515636156371563815639156401564115642156431564415645156461564715648156491565015651156521565315654156551565615657156581565915660156611566215663156641566515666156671566815669156701567115672156731567415675156761567715678156791568015681156821568315684156851568615687156881568915690156911569215693156941569515696156971569815699157001570115702157031570415705157061570715708157091571015711157121571315714157151571615717157181571915720157211572215723157241572515726157271572815729157301573115732157331573415735157361573715738157391574015741157421574315744157451574615747157481574915750157511575215753157541575515756157571575815759157601576115762157631576415765157661576715768157691577015771157721577315774157751577615777157781577915780157811578215783157841578515786157871578815789157901579115792157931579415795157961579715798157991580015801158021580315804158051580615807158081580915810158111581215813158141581515816158171581815819158201582115822158231582415825158261582715828158291583015831158321583315834
  1. {
  2. Copyright (c) 1998-2002 by Florian Klaempfl and Jonas Maebe
  3. This unit contains the peephole optimizer.
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 2 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program; if not, write to the Free Software
  14. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  15. ****************************************************************************
  16. }
  17. unit aoptx86;
  18. {$i fpcdefs.inc}
  19. { $define DEBUG_AOPTCPU}
  20. {$ifdef EXTDEBUG}
  21. {$define DEBUG_AOPTCPU}
  22. {$endif EXTDEBUG}
  23. interface
  24. uses
  25. globtype,cclasses,
  26. cpubase,
  27. aasmtai,aasmcpu,
  28. cgbase,cgutils,
  29. aopt,aoptobj;
  30. type
  31. TOptsToCheck = (
  32. aoc_MovAnd2Mov_3,
  33. aoc_ForceNewIteration
  34. );
  35. TX86AsmOptimizer = class(TAsmOptimizer)
  36. { some optimizations are very expensive to check, so the
  37. pre opt pass can be used to set some flags, depending on the found
  38. instructions if it is worth to check a certain optimization }
  39. OptsToCheck : set of TOptsToCheck;
  40. function RegLoadedWithNewValue(reg : tregister; hp : tai) : boolean; override;
  41. function InstructionLoadsFromReg(const reg : TRegister; const hp : tai) : boolean; override;
  42. class function RegReadByInstruction(reg : TRegister; hp : tai) : boolean; static;
  43. function RegInInstruction(Reg: TRegister; p1: tai): Boolean;override;
  44. function GetNextInstructionUsingReg(Current: tai; out Next: tai; reg: TRegister): Boolean;
  45. { Identical to GetNextInstructionUsingReg, but returns a value indicating
  46. how many instructions away that Next is from Current is.
  47. 0 = failure, equivalent to False in GetNextInstructionUsingReg }
  48. function GetNextInstructionUsingRegCount(Current: tai; out Next: tai; reg: TRegister): Cardinal;
  49. { This version of GetNextInstructionUsingReg will look across conditional jumps,
  50. potentially allowing further optimisation (although it might need to know if
  51. it crossed a conditional jump. }
  52. function GetNextInstructionUsingRegCond(Current: tai; out Next: tai; reg: TRegister; var JumpTracking: TLinkedList; var CrossJump: Boolean): Boolean;
  53. {
  54. In comparison with GetNextInstructionUsingReg, GetNextInstructionUsingRegTrackingUse tracks
  55. the use of a register by allocs/dealloc, so it can ignore calls.
  56. In the following example, GetNextInstructionUsingReg will return the second movq,
  57. GetNextInstructionUsingRegTrackingUse won't.
  58. movq %rdi,%rax
  59. # Register rdi released
  60. # Register rdi allocated
  61. movq %rax,%rdi
  62. While in this example:
  63. movq %rdi,%rax
  64. call proc
  65. movq %rdi,%rax
  66. GetNextInstructionUsingRegTrackingUse will return the second instruction while GetNextInstructionUsingReg
  67. won't.
  68. }
  69. function GetNextInstructionUsingRegTrackingUse(Current: tai; out Next: tai; reg: TRegister): Boolean;
  70. function RegModifiedByInstruction(Reg: TRegister; p1: tai): boolean; override;
  71. private
  72. function SkipSimpleInstructions(var hp1: tai): Boolean;
  73. protected
  74. class function IsMOVZXAcceptable: Boolean; static; inline;
  75. { Attempts to allocate a volatile integer register for use between p and hp,
  76. using AUsedRegs for the current register usage information. Returns NR_NO
  77. if no free register could be found }
  78. function GetIntRegisterBetween(RegSize: TSubRegister; var AUsedRegs: TAllUsedRegs; p, hp: tai; DontAlloc: Boolean = False): TRegister;
  79. { Attempts to allocate a volatile MM register for use between p and hp,
  80. using AUsedRegs for the current register usage information. Returns NR_NO
  81. if no free register could be found }
  82. function GetMMRegisterBetween(RegSize: TSubRegister; var AUsedRegs: TAllUsedRegs; p, hp: tai; DontAlloc: Boolean = False): TRegister;
  83. { checks whether loading a new value in reg1 overwrites the entirety of reg2 }
  84. class function Reg1WriteOverwritesReg2Entirely(reg1, reg2: tregister): boolean; static;
  85. { checks whether reading the value in reg1 depends on the value of reg2. This
  86. is very similar to SuperRegisterEquals, except it takes into account that
  87. R_SUBH and R_SUBL are independendent (e.g. reading from AL does not
  88. depend on the value in AH). }
  89. class function Reg1ReadDependsOnReg2(reg1, reg2: tregister): boolean; static;
  90. { Replaces all references to AOldReg in a memory reference to ANewReg }
  91. class function ReplaceRegisterInRef(var ref: TReference; const AOldReg, ANewReg: TRegister): Boolean; static;
  92. { Replaces all references to AOldReg in an operand to ANewReg }
  93. class function ReplaceRegisterInOper(const p: taicpu; const OperIdx: Integer; const AOldReg, ANewReg: TRegister): Boolean; static;
  94. { Replaces all references to AOldReg in an instruction to ANewReg,
  95. except where the register is being written }
  96. class function ReplaceRegisterInInstruction(const p: taicpu; const AOldReg, ANewReg: TRegister): Boolean; static;
  97. { Returns true if the reference only refers to ESP or EBP (or their 64-bit equivalents),
  98. or writes to a global symbol }
  99. class function IsRefSafe(const ref: PReference): Boolean; static;
  100. { Returns true if the given MOV instruction can be safely converted to CMOV }
  101. class function CanBeCMOV(p, cond_p: tai) : boolean; static;
  102. { Like UpdateUsedRegs, but ignores deallocations }
  103. class procedure UpdateIntRegsNoDealloc(var AUsedRegs: TAllUsedRegs; p: Tai); static;
  104. { Returns true if the given logic instruction can be converted into a BTx instruction (BT not included) }
  105. class function IsBTXAcceptable(p : tai) : boolean; static;
  106. { Converts the LEA instruction to ADD/INC/SUB/DEC. Returns True if the
  107. conversion was successful }
  108. function ConvertLEA(const p : taicpu): Boolean;
  109. function DeepMOVOpt(const p_mov: taicpu; const hp: taicpu): Boolean;
  110. function FuncMov2Func(var p: tai; const hp1: tai): Boolean;
  111. procedure DebugMsg(const s : string; p : tai);inline;
  112. class function IsExitCode(p : tai) : boolean; static;
  113. class function isFoldableArithOp(hp1 : taicpu; reg : tregister) : boolean; static;
  114. class function IsShrMovZFoldable(shr_size, movz_size: topsize; Shift: TCGInt): Boolean; static;
  115. procedure RemoveLastDeallocForFuncRes(p : tai);
  116. function DoArithCombineOpt(var p : tai) : Boolean;
  117. function DoMovCmpMemOpt(var p : tai; const hp1: tai; UpdateTmpUsedRegs: Boolean) : Boolean;
  118. function DoSETccLblRETOpt(var p: tai; const hp_label: tai_label) : Boolean;
  119. function PrePeepholeOptSxx(var p : tai) : boolean;
  120. function PrePeepholeOptIMUL(var p : tai) : boolean;
  121. function PrePeepholeOptAND(var p : tai) : boolean;
  122. function OptPass1Test(var p: tai): boolean;
  123. function OptPass1Add(var p: tai): boolean;
  124. function OptPass1AND(var p : tai) : boolean;
  125. function OptPass1_V_MOVAP(var p : tai) : boolean;
  126. function OptPass1VOP(var p : tai) : boolean;
  127. function OptPass1MOV(var p : tai) : boolean;
  128. function OptPass1Movx(var p : tai) : boolean;
  129. function OptPass1MOVXX(var p : tai) : boolean;
  130. function OptPass1OP(var p : tai) : boolean;
  131. function OptPass1LEA(var p : tai) : boolean;
  132. function OptPass1Sub(var p : tai) : boolean;
  133. function OptPass1SHLSAL(var p : tai) : boolean;
  134. function OptPass1SHR(var p : tai) : boolean;
  135. function OptPass1FSTP(var p : tai) : boolean;
  136. function OptPass1FLD(var p : tai) : boolean;
  137. function OptPass1Cmp(var p : tai) : boolean;
  138. function OptPass1PXor(var p : tai) : boolean;
  139. function OptPass1VPXor(var p: tai): boolean;
  140. function OptPass1Imul(var p : tai) : boolean;
  141. function OptPass1Jcc(var p : tai) : boolean;
  142. function OptPass1SHXX(var p: tai): boolean;
  143. function OptPass1VMOVDQ(var p: tai): Boolean;
  144. function OptPass1_V_Cvtss2sd(var p: tai): boolean;
  145. function OptPass2Movx(var p : tai): Boolean;
  146. function OptPass2MOV(var p : tai) : boolean;
  147. function OptPass2Imul(var p : tai) : boolean;
  148. function OptPass2Jmp(var p : tai) : boolean;
  149. function OptPass2Jcc(var p : tai) : boolean;
  150. function OptPass2Lea(var p: tai): Boolean;
  151. function OptPass2SUB(var p: tai): Boolean;
  152. function OptPass2ADD(var p : tai): Boolean;
  153. function OptPass2SETcc(var p : tai) : boolean;
  154. function CheckMemoryWrite(var first_mov, second_mov: taicpu): Boolean;
  155. function PostPeepholeOptMov(var p : tai) : Boolean;
  156. function PostPeepholeOptMovzx(var p : tai) : Boolean;
  157. function PostPeepholeOptXor(var p : tai) : Boolean;
  158. function PostPeepholeOptAnd(var p : tai) : boolean;
  159. function PostPeepholeOptMOVSX(var p : tai) : boolean;
  160. function PostPeepholeOptCmp(var p : tai) : Boolean;
  161. function PostPeepholeOptTestOr(var p : tai) : Boolean;
  162. function PostPeepholeOptCall(var p : tai) : Boolean;
  163. function PostPeepholeOptLea(var p : tai) : Boolean;
  164. function PostPeepholeOptPush(var p: tai): Boolean;
  165. function PostPeepholeOptShr(var p : tai) : boolean;
  166. function PostPeepholeOptADDSUB(var p : tai) : Boolean;
  167. function PostPeepholeOptVPXOR(var p: tai): Boolean;
  168. procedure ConvertJumpToRET(const p: tai; const ret_p: tai);
  169. function CheckJumpMovTransferOpt(var p: tai; hp1: tai; LoopCount: Integer; out Count: Integer): Boolean;
  170. function TrySwapMovOp(var p, hp1: tai): Boolean;
  171. function TrySwapMovCmp(var p, hp1: tai): Boolean;
  172. { Processor-dependent reference optimisation }
  173. class procedure OptimizeRefs(var p: taicpu); static;
  174. end;
  175. function MatchInstruction(const instr: tai; const op: TAsmOp; const opsize: topsizes): boolean;
  176. function MatchInstruction(const instr: tai; const op1,op2: TAsmOp; const opsize: topsizes): boolean;
  177. function MatchInstruction(const instr: tai; const op1,op2,op3: TAsmOp; const opsize: topsizes): boolean;
  178. function MatchInstruction(const instr: tai; const ops: array of TAsmOp; const opsize: topsizes): boolean;
  179. function MatchOperand(const oper: TOper; const reg: TRegister): boolean; inline;
  180. function MatchOperand(const oper: TOper; const a: tcgint): boolean; inline;
  181. function MatchOperand(const oper1: TOper; const oper2: TOper): boolean;
  182. {$if max_operands>2}
  183. function MatchOperand(const oper1: TOper; const oper2: TOper; const oper3: TOper): boolean;
  184. {$endif max_operands>2}
  185. function RefsEqual(const r1, r2: treference): boolean;
  186. { Note that Result is set to True if the references COULD overlap but the
  187. compiler cannot be sure (e.g. "(%reg1)" and "4(%reg2)" with a range of 4
  188. might still overlap because %reg2 could be equal to %reg1-4 }
  189. function RefsMightOverlap(const r1, r2: treference; const Range: asizeint): boolean;
  190. function MatchReference(const ref : treference;base,index : TRegister) : Boolean;
  191. { returns true, if ref is a reference using only the registers passed as base and index
  192. and having an offset }
  193. function MatchReferenceWithOffset(const ref : treference;base,index : TRegister) : Boolean;
  194. implementation
  195. uses
  196. cutils,verbose,
  197. systems,
  198. globals,
  199. cpuinfo,
  200. procinfo,
  201. paramgr,
  202. aasmbase,
  203. aoptbase,aoptutils,
  204. symconst,symsym,
  205. cgx86,
  206. itcpugas;
  207. {$ifdef DEBUG_AOPTCPU}
  208. const
  209. SPeepholeOptimization: shortstring = 'Peephole Optimization: ';
  210. {$else DEBUG_AOPTCPU}
  211. { Empty strings help the optimizer to remove string concatenations that won't
  212. ever appear to the user on release builds. [Kit] }
  213. const
  214. SPeepholeOptimization = '';
  215. {$endif DEBUG_AOPTCPU}
  216. LIST_STEP_SIZE = 4;
  217. {$ifndef 8086}
  218. MAX_CMOV_INSTRUCTIONS = 4;
  219. MAX_CMOV_REGISTERS = 8;
  220. {$endif 8086}
  221. type
  222. TJumpTrackingItem = class(TLinkedListItem)
  223. private
  224. FSymbol: TAsmSymbol;
  225. FRefs: LongInt;
  226. public
  227. constructor Create(ASymbol: TAsmSymbol);
  228. procedure IncRefs; {$ifdef USEINLINE}inline;{$endif USEINLINE}
  229. property Symbol: TAsmSymbol read FSymbol;
  230. property Refs: LongInt read FRefs;
  231. end;
  232. constructor TJumpTrackingItem.Create(ASymbol: TAsmSymbol);
  233. begin
  234. inherited Create;
  235. FSymbol := ASymbol;
  236. FRefs := 0;
  237. end;
  238. procedure TJumpTrackingItem.IncRefs; {$ifdef USEINLINE}inline;{$endif USEINLINE}
  239. begin
  240. Inc(FRefs);
  241. end;
  242. function MatchInstruction(const instr: tai; const op: TAsmOp; const opsize: topsizes): boolean;
  243. begin
  244. result :=
  245. (instr.typ = ait_instruction) and
  246. (taicpu(instr).opcode = op) and
  247. ((opsize = []) or (taicpu(instr).opsize in opsize));
  248. end;
  249. function MatchInstruction(const instr: tai; const op1,op2: TAsmOp; const opsize: topsizes): boolean;
  250. begin
  251. result :=
  252. (instr.typ = ait_instruction) and
  253. ((taicpu(instr).opcode = op1) or
  254. (taicpu(instr).opcode = op2)
  255. ) and
  256. ((opsize = []) or (taicpu(instr).opsize in opsize));
  257. end;
  258. function MatchInstruction(const instr: tai; const op1,op2,op3: TAsmOp; const opsize: topsizes): boolean;
  259. begin
  260. result :=
  261. (instr.typ = ait_instruction) and
  262. ((taicpu(instr).opcode = op1) or
  263. (taicpu(instr).opcode = op2) or
  264. (taicpu(instr).opcode = op3)
  265. ) and
  266. ((opsize = []) or (taicpu(instr).opsize in opsize));
  267. end;
  268. function MatchInstruction(const instr : tai;const ops : array of TAsmOp;
  269. const opsize : topsizes) : boolean;
  270. var
  271. op : TAsmOp;
  272. begin
  273. result:=false;
  274. if (instr.typ <> ait_instruction) or
  275. ((opsize <> []) and not(taicpu(instr).opsize in opsize)) then
  276. exit;
  277. for op in ops do
  278. begin
  279. if taicpu(instr).opcode = op then
  280. begin
  281. result:=true;
  282. exit;
  283. end;
  284. end;
  285. end;
  286. function MatchOperand(const oper: TOper; const reg: TRegister): boolean; inline;
  287. begin
  288. result := (oper.typ = top_reg) and (oper.reg = reg);
  289. end;
  290. function MatchOperand(const oper: TOper; const a: tcgint): boolean; inline;
  291. begin
  292. result := (oper.typ = top_const) and (oper.val = a);
  293. end;
  294. function MatchOperand(const oper1: TOper; const oper2: TOper): boolean;
  295. begin
  296. result := oper1.typ = oper2.typ;
  297. if result then
  298. case oper1.typ of
  299. top_const:
  300. Result:=oper1.val = oper2.val;
  301. top_reg:
  302. Result:=oper1.reg = oper2.reg;
  303. top_ref:
  304. Result:=RefsEqual(oper1.ref^, oper2.ref^);
  305. else
  306. internalerror(2013102801);
  307. end
  308. end;
  309. function MatchOperand(const oper1: TOper; const oper2: TOper; const oper3: TOper): boolean;
  310. begin
  311. result := (oper1.typ = oper2.typ) and (oper1.typ = oper3.typ);
  312. if result then
  313. case oper1.typ of
  314. top_const:
  315. Result:=(oper1.val = oper2.val) and (oper1.val = oper3.val);
  316. top_reg:
  317. Result:=(oper1.reg = oper2.reg) and (oper1.reg = oper3.reg);
  318. top_ref:
  319. Result:=RefsEqual(oper1.ref^, oper2.ref^) and RefsEqual(oper1.ref^, oper3.ref^);
  320. else
  321. internalerror(2020052401);
  322. end
  323. end;
  324. function RefsEqual(const r1, r2: treference): boolean;
  325. begin
  326. RefsEqual :=
  327. (r1.symbol=r2.symbol) and (r1.refaddr = r2.refaddr) and
  328. (r1.relsymbol = r2.relsymbol) and
  329. (r1.segment = r2.segment) and (r1.base = r2.base) and
  330. (r1.index = r2.index) and (r1.scalefactor = r2.scalefactor) and
  331. (r1.offset = r2.offset) and
  332. (r1.volatility + r2.volatility = []);
  333. end;
  334. function RefsMightOverlap(const r1, r2: treference; const Range: asizeint): boolean;
  335. begin
  336. if (r1.symbol<>r2.symbol) then
  337. { If the index registers are different, there's a chance one could
  338. be set so it equals the other symbol }
  339. Exit((r1.index<>r2.index) or (r1.scalefactor<>r2.scalefactor));
  340. if (r1.symbol=r2.symbol) and (r1.refaddr = r2.refaddr) and
  341. (r1.relsymbol = r2.relsymbol) and
  342. (r1.segment = r2.segment) and (r1.base = r2.base) and
  343. (r1.index = r2.index) and (r1.scalefactor = r2.scalefactor) and
  344. (r1.volatility + r2.volatility = []) then
  345. { In this case, it all depends on the offsets }
  346. Exit(abs(r1.offset - r2.offset) < Range);
  347. { There's a chance things MIGHT overlap, so take no chances }
  348. Result := True;
  349. end;
  350. function MatchReference(const ref : treference;base,index : TRegister) : Boolean;
  351. begin
  352. Result:=(ref.offset=0) and
  353. (ref.scalefactor in [0,1]) and
  354. (ref.segment=NR_NO) and
  355. (ref.symbol=nil) and
  356. (ref.relsymbol=nil) and
  357. ((base=NR_INVALID) or
  358. (ref.base=base)) and
  359. ((index=NR_INVALID) or
  360. (ref.index=index)) and
  361. (ref.volatility=[]);
  362. end;
  363. function MatchReferenceWithOffset(const ref : treference;base,index : TRegister) : Boolean;
  364. begin
  365. Result:=(ref.scalefactor in [0,1]) and
  366. (ref.segment=NR_NO) and
  367. (ref.symbol=nil) and
  368. (ref.relsymbol=nil) and
  369. ((base=NR_INVALID) or
  370. (ref.base=base)) and
  371. ((index=NR_INVALID) or
  372. (ref.index=index)) and
  373. (ref.volatility=[]);
  374. end;
  375. function InstrReadsFlags(p: tai): boolean;
  376. begin
  377. InstrReadsFlags := true;
  378. case p.typ of
  379. ait_instruction:
  380. if InsProp[taicpu(p).opcode].Ch*
  381. [Ch_RCarryFlag,Ch_RParityFlag,Ch_RAuxiliaryFlag,Ch_RZeroFlag,Ch_RSignFlag,Ch_ROverflowFlag,
  382. Ch_RWCarryFlag,Ch_RWParityFlag,Ch_RWAuxiliaryFlag,Ch_RWZeroFlag,Ch_RWSignFlag,Ch_RWOverflowFlag,
  383. Ch_RFlags,Ch_RWFlags,Ch_RFLAGScc,Ch_All]<>[] then
  384. exit;
  385. ait_label:
  386. exit;
  387. else
  388. ;
  389. end;
  390. InstrReadsFlags := false;
  391. end;
  392. function TX86AsmOptimizer.GetNextInstructionUsingReg(Current: tai; out Next: tai; reg: TRegister): Boolean;
  393. begin
  394. Next:=Current;
  395. repeat
  396. Result:=GetNextInstruction(Next,Next);
  397. until not (Result) or
  398. not(cs_opt_level3 in current_settings.optimizerswitches) or
  399. (Next.typ<>ait_instruction) or
  400. RegInInstruction(reg,Next) or
  401. is_calljmp(taicpu(Next).opcode);
  402. end;
  403. function TX86AsmOptimizer.GetNextInstructionUsingRegCount(Current: tai; out Next: tai; reg: TRegister): Cardinal;
  404. var
  405. GetNextResult: Boolean;
  406. begin
  407. Result:=0;
  408. Next:=Current;
  409. repeat
  410. GetNextResult := GetNextInstruction(Next,Next);
  411. if GetNextResult then
  412. Inc(Result)
  413. else
  414. { Must return zero upon hitting the end of the linked list without a match }
  415. Result := 0;
  416. until not (GetNextResult) or
  417. not(cs_opt_level3 in current_settings.optimizerswitches) or
  418. (Next.typ<>ait_instruction) or
  419. RegInInstruction(reg,Next) or
  420. is_calljmp(taicpu(Next).opcode);
  421. end;
  422. function TX86AsmOptimizer.GetNextInstructionUsingRegCond(Current: tai; out Next: tai; reg: TRegister; var JumpTracking: TLinkedList; var CrossJump: Boolean): Boolean;
  423. procedure TrackJump(Symbol: TAsmSymbol);
  424. var
  425. Search: TJumpTrackingItem;
  426. begin
  427. { See if an entry already exists in our jump tracking list
  428. (faster to search backwards due to the higher chance of
  429. matching destinations) }
  430. Search := TJumpTrackingItem(JumpTracking.Last);
  431. while Assigned(Search) do
  432. begin
  433. if Search.Symbol = Symbol then
  434. begin
  435. { Found it - remove it so it can be pushed to the front }
  436. JumpTracking.Remove(Search);
  437. Break;
  438. end;
  439. Search := TJumpTrackingItem(Search.Previous);
  440. end;
  441. if not Assigned(Search) then
  442. Search := TJumpTrackingItem.Create(JumpTargetOp(taicpu(Next))^.ref^.symbol);
  443. JumpTracking.Concat(Search);
  444. Search.IncRefs;
  445. end;
  446. function LabelAccountedFor(Symbol: TAsmSymbol): Boolean;
  447. var
  448. Search: TJumpTrackingItem;
  449. begin
  450. Result := False;
  451. { See if this label appears in the tracking list }
  452. Search := TJumpTrackingItem(JumpTracking.Last);
  453. while Assigned(Search) do
  454. begin
  455. if Search.Symbol = Symbol then
  456. begin
  457. { Found it - let's see what we can discover }
  458. if Search.Symbol.getrefs = Search.Refs then
  459. begin
  460. { Success - all the references are accounted for }
  461. JumpTracking.Remove(Search);
  462. Search.Free;
  463. { It is logically impossible for CrossJump to be false here
  464. because we must have run into a conditional jump for
  465. this label at some point }
  466. if not CrossJump then
  467. InternalError(2022041710);
  468. if JumpTracking.First = nil then
  469. { Tracking list is now empty - no more cross jumps }
  470. CrossJump := False;
  471. Result := True;
  472. Exit;
  473. end;
  474. { If the references don't match, it's possible to enter
  475. this label through other means, so drop out }
  476. Exit;
  477. end;
  478. Search := TJumpTrackingItem(Search.Previous);
  479. end;
  480. end;
  481. var
  482. Next_Label: tai;
  483. begin
  484. { Note, CrossJump keeps its input value if a conditional jump is not found - it doesn't get set to False }
  485. Next := Current;
  486. repeat
  487. Result := GetNextInstruction(Next,Next);
  488. if not Result then
  489. Break;
  490. if Next.typ = ait_align then
  491. Result := SkipAligns(Next, Next);
  492. if (Next.typ=ait_instruction) and is_calljmp(taicpu(Next).opcode) then
  493. if is_calljmpuncondret(taicpu(Next).opcode) then
  494. begin
  495. if (taicpu(Next).opcode = A_JMP) and
  496. { Remove dead code now to save time }
  497. RemoveDeadCodeAfterJump(taicpu(Next)) then
  498. { A jump was removed, but not the current instruction, and
  499. Result doesn't necessarily translate into an optimisation
  500. routine's Result, so use the "Force New Iteration" flag so
  501. mark a new pass }
  502. Include(OptsToCheck, aoc_ForceNewIteration);
  503. if not Assigned(JumpTracking) then
  504. begin
  505. { Cross-label optimisations often causes other optimisations
  506. to perform worse because they're not given the chance to
  507. optimise locally. In this case, don't do the cross-label
  508. optimisations yet, but flag them as a potential possibility
  509. for the next iteration of Pass 1 }
  510. if not NotFirstIteration then
  511. Include(OptsToCheck, aoc_ForceNewIteration);
  512. end
  513. else if IsJumpToLabel(taicpu(Next)) and
  514. GetNextInstruction(Next, Next_Label) and
  515. SkipAligns(Next_Label, Next_Label) then
  516. begin
  517. { If we have JMP .lbl, and the label after it has all of its
  518. references tracked, then this is probably an if-else style of
  519. block and we can keep tracking. If the label for this jump
  520. then appears later and is fully tracked, then it's the end
  521. of the if-else blocks and the code paths converge (thus
  522. marking the end of the cross-jump) }
  523. if (Next_Label.typ = ait_label) then
  524. begin
  525. if LabelAccountedFor(tai_label(Next_Label).labsym) then
  526. begin
  527. TrackJump(JumpTargetOp(taicpu(Next))^.ref^.symbol);
  528. Next := Next_Label;
  529. { CrossJump gets set to false by LabelAccountedFor if the
  530. list is completely emptied (as it indicates that all
  531. code paths have converged). We could avoid this nuance
  532. by moving the TrackJump call to before the
  533. LabelAccountedFor call, but this is slower in situations
  534. where LabelAccountedFor would return False due to the
  535. creation of a new object that is not used and destroyed
  536. soon after. }
  537. CrossJump := True;
  538. Continue;
  539. end;
  540. end
  541. else if (Next_Label.typ <> ait_marker) then
  542. { We just did a RemoveDeadCodeAfterJump, so either we find
  543. a label, the end of the procedure or some kind of marker}
  544. InternalError(2022041720);
  545. end;
  546. Result := False;
  547. Exit;
  548. end
  549. else
  550. begin
  551. if not Assigned(JumpTracking) then
  552. begin
  553. { Cross-label optimisations often causes other optimisations
  554. to perform worse because they're not given the chance to
  555. optimise locally. In this case, don't do the cross-label
  556. optimisations yet, but flag them as a potential possibility
  557. for the next iteration of Pass 1 }
  558. if not NotFirstIteration then
  559. Include(OptsToCheck, aoc_ForceNewIteration);
  560. end
  561. else if IsJumpToLabel(taicpu(Next)) then
  562. TrackJump(JumpTargetOp(taicpu(Next))^.ref^.symbol)
  563. else
  564. { Conditional jumps should always be a jump to label }
  565. InternalError(2022041701);
  566. CrossJump := True;
  567. Continue;
  568. end;
  569. if Next.typ = ait_label then
  570. begin
  571. if not Assigned(JumpTracking) then
  572. begin
  573. { Cross-label optimisations often causes other optimisations
  574. to perform worse because they're not given the chance to
  575. optimise locally. In this case, don't do the cross-label
  576. optimisations yet, but flag them as a potential possibility
  577. for the next iteration of Pass 1 }
  578. if not NotFirstIteration then
  579. Include(OptsToCheck, aoc_ForceNewIteration);
  580. end
  581. else if LabelAccountedFor(tai_label(Next).labsym) then
  582. Continue;
  583. { If we reach here, we're at a label that hasn't been seen before
  584. (or JumpTracking was nil) }
  585. Break;
  586. end;
  587. until not Result or
  588. not (cs_opt_level3 in current_settings.optimizerswitches) or
  589. not (Next.typ in [ait_label, ait_instruction]) or
  590. RegInInstruction(reg,Next);
  591. end;
  592. function TX86AsmOptimizer.GetNextInstructionUsingRegTrackingUse(Current: tai; out Next: tai; reg: TRegister): Boolean;
  593. begin
  594. if not(cs_opt_level3 in current_settings.optimizerswitches) then
  595. begin
  596. Result:=GetNextInstruction(Current,Next);
  597. exit;
  598. end;
  599. Next:=tai(Current.Next);
  600. Result:=false;
  601. while assigned(Next) do
  602. begin
  603. if ((Next.typ=ait_instruction) and is_calljmp(taicpu(Next).opcode) and not(taicpu(Next).opcode=A_CALL)) or
  604. ((Next.typ=ait_regalloc) and (getsupreg(tai_regalloc(Next).reg)=getsupreg(reg))) or
  605. ((Next.typ=ait_label) and not(labelCanBeSkipped(Tai_Label(Next)))) then
  606. exit
  607. else if (Next.typ=ait_instruction) and RegInInstruction(reg,Next) and not(taicpu(Next).opcode=A_CALL) then
  608. begin
  609. Result:=true;
  610. exit;
  611. end;
  612. Next:=tai(Next.Next);
  613. end;
  614. end;
  615. function TX86AsmOptimizer.InstructionLoadsFromReg(const reg: TRegister;const hp: tai): boolean;
  616. begin
  617. Result:=RegReadByInstruction(reg,hp);
  618. end;
  619. class function TX86AsmOptimizer.RegReadByInstruction(reg: TRegister; hp: tai): boolean;
  620. var
  621. p: taicpu;
  622. opcount: longint;
  623. begin
  624. RegReadByInstruction := false;
  625. if hp.typ <> ait_instruction then
  626. exit;
  627. p := taicpu(hp);
  628. case p.opcode of
  629. A_CALL:
  630. regreadbyinstruction := true;
  631. A_IMUL:
  632. case p.ops of
  633. 1:
  634. regReadByInstruction := RegInOp(reg,p.oper[0]^) or
  635. (
  636. ((getregtype(reg)=R_INTREGISTER) and (getsupreg(reg)=RS_EAX)) and
  637. ((getsubreg(reg)<>R_SUBH) or (p.opsize<>S_B))
  638. );
  639. 2,3:
  640. regReadByInstruction :=
  641. reginop(reg,p.oper[0]^) or
  642. reginop(reg,p.oper[1]^);
  643. else
  644. InternalError(2019112801);
  645. end;
  646. A_MUL:
  647. begin
  648. regReadByInstruction := RegInOp(reg,p.oper[0]^) or
  649. (
  650. ((getregtype(reg)=R_INTREGISTER) and (getsupreg(reg)=RS_EAX)) and
  651. ((getsubreg(reg)<>R_SUBH) or (p.opsize<>S_B))
  652. );
  653. end;
  654. A_IDIV,A_DIV:
  655. begin
  656. regReadByInstruction := RegInOp(reg,p.oper[0]^) or
  657. (
  658. (getregtype(reg)=R_INTREGISTER) and
  659. (
  660. (getsupreg(reg)=RS_EAX) or ((getsupreg(reg)=RS_EDX) and (p.opsize<>S_B))
  661. )
  662. );
  663. end;
  664. else
  665. begin
  666. if (p.opcode=A_LEA) and is_segment_reg(reg) then
  667. begin
  668. RegReadByInstruction := false;
  669. exit;
  670. end;
  671. for opcount := 0 to p.ops-1 do
  672. if (p.oper[opCount]^.typ = top_ref) and
  673. RegInRef(reg,p.oper[opcount]^.ref^) then
  674. begin
  675. RegReadByInstruction := true;
  676. exit
  677. end;
  678. { special handling for SSE MOVSD }
  679. if (p.opcode=A_MOVSD) and (p.ops>0) then
  680. begin
  681. if p.ops<>2 then
  682. internalerror(2017042702);
  683. regReadByInstruction := reginop(reg,p.oper[0]^) or
  684. (
  685. (p.oper[1]^.typ=top_reg) and (p.oper[0]^.typ=top_reg) and reginop(reg, p.oper[1]^)
  686. );
  687. exit;
  688. end;
  689. with insprop[p.opcode] do
  690. begin
  691. case getregtype(reg) of
  692. R_INTREGISTER:
  693. begin
  694. case getsupreg(reg) of
  695. RS_EAX:
  696. if [Ch_REAX,Ch_RWEAX,Ch_MEAX]*Ch<>[] then
  697. begin
  698. RegReadByInstruction := true;
  699. exit
  700. end;
  701. RS_ECX:
  702. if [Ch_RECX,Ch_RWECX,Ch_MECX]*Ch<>[] then
  703. begin
  704. RegReadByInstruction := true;
  705. exit
  706. end;
  707. RS_EDX:
  708. if [Ch_REDX,Ch_RWEDX,Ch_MEDX]*Ch<>[] then
  709. begin
  710. RegReadByInstruction := true;
  711. exit
  712. end;
  713. RS_EBX:
  714. if [Ch_REBX,Ch_RWEBX,Ch_MEBX]*Ch<>[] then
  715. begin
  716. RegReadByInstruction := true;
  717. exit
  718. end;
  719. RS_ESP:
  720. if [Ch_RESP,Ch_RWESP,Ch_MESP]*Ch<>[] then
  721. begin
  722. RegReadByInstruction := true;
  723. exit
  724. end;
  725. RS_EBP:
  726. if [Ch_REBP,Ch_RWEBP,Ch_MEBP]*Ch<>[] then
  727. begin
  728. RegReadByInstruction := true;
  729. exit
  730. end;
  731. RS_ESI:
  732. if [Ch_RESI,Ch_RWESI,Ch_MESI]*Ch<>[] then
  733. begin
  734. RegReadByInstruction := true;
  735. exit
  736. end;
  737. RS_EDI:
  738. if [Ch_REDI,Ch_RWEDI,Ch_MEDI]*Ch<>[] then
  739. begin
  740. RegReadByInstruction := true;
  741. exit
  742. end;
  743. end;
  744. end;
  745. R_MMREGISTER:
  746. begin
  747. case getsupreg(reg) of
  748. RS_XMM0:
  749. if [Ch_RXMM0,Ch_RWXMM0,Ch_MXMM0]*Ch<>[] then
  750. begin
  751. RegReadByInstruction := true;
  752. exit
  753. end;
  754. end;
  755. end;
  756. else
  757. ;
  758. end;
  759. if SuperRegistersEqual(reg,NR_DEFAULTFLAGS) then
  760. begin
  761. if (Ch_RFLAGScc in Ch) and not(getsubreg(reg) in [R_SUBW,R_SUBD,R_SUBQ]) then
  762. begin
  763. case p.condition of
  764. C_A,C_NBE, { CF=0 and ZF=0 }
  765. C_BE,C_NA: { CF=1 or ZF=1 }
  766. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGCARRY,R_SUBFLAGZERO];
  767. C_AE,C_NB,C_NC, { CF=0 }
  768. C_B,C_NAE,C_C: { CF=1 }
  769. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGCARRY];
  770. C_NE,C_NZ, { ZF=0 }
  771. C_E,C_Z: { ZF=1 }
  772. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGZERO];
  773. C_G,C_NLE, { ZF=0 and SF=OF }
  774. C_LE,C_NG: { ZF=1 or SF<>OF }
  775. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGZERO,R_SUBFLAGSIGN,R_SUBFLAGOVERFLOW];
  776. C_GE,C_NL, { SF=OF }
  777. C_L,C_NGE: { SF<>OF }
  778. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGSIGN,R_SUBFLAGOVERFLOW];
  779. C_NO, { OF=0 }
  780. C_O: { OF=1 }
  781. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGOVERFLOW];
  782. C_NP,C_PO, { PF=0 }
  783. C_P,C_PE: { PF=1 }
  784. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGPARITY];
  785. C_NS, { SF=0 }
  786. C_S: { SF=1 }
  787. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGSIGN];
  788. else
  789. internalerror(2017042701);
  790. end;
  791. if RegReadByInstruction then
  792. exit;
  793. end;
  794. case getsubreg(reg) of
  795. R_SUBW,R_SUBD,R_SUBQ:
  796. RegReadByInstruction :=
  797. [Ch_RCarryFlag,Ch_RParityFlag,Ch_RAuxiliaryFlag,Ch_RZeroFlag,Ch_RSignFlag,Ch_ROverflowFlag,
  798. Ch_RWCarryFlag,Ch_RWParityFlag,Ch_RWAuxiliaryFlag,Ch_RWZeroFlag,Ch_RWSignFlag,Ch_RWOverflowFlag,
  799. Ch_RDirFlag,Ch_RFlags,Ch_RWFlags,Ch_RFLAGScc]*Ch<>[];
  800. R_SUBFLAGCARRY:
  801. RegReadByInstruction:=[Ch_RCarryFlag,Ch_RWCarryFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  802. R_SUBFLAGPARITY:
  803. RegReadByInstruction:=[Ch_RParityFlag,Ch_RWParityFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  804. R_SUBFLAGAUXILIARY:
  805. RegReadByInstruction:=[Ch_RAuxiliaryFlag,Ch_RWAuxiliaryFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  806. R_SUBFLAGZERO:
  807. RegReadByInstruction:=[Ch_RZeroFlag,Ch_RWZeroFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  808. R_SUBFLAGSIGN:
  809. RegReadByInstruction:=[Ch_RSignFlag,Ch_RWSignFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  810. R_SUBFLAGOVERFLOW:
  811. RegReadByInstruction:=[Ch_ROverflowFlag,Ch_RWOverflowFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  812. R_SUBFLAGINTERRUPT:
  813. RegReadByInstruction:=[Ch_RFlags,Ch_RWFlags]*Ch<>[];
  814. R_SUBFLAGDIRECTION:
  815. RegReadByInstruction:=[Ch_RDirFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  816. else
  817. internalerror(2017042601);
  818. end;
  819. exit;
  820. end;
  821. if (Ch_NoReadIfEqualRegs in Ch) and (p.ops=2) and
  822. (p.oper[0]^.typ=top_reg) and (p.oper[1]^.typ=top_reg) and
  823. (p.oper[0]^.reg=p.oper[1]^.reg) then
  824. exit;
  825. if ([CH_RWOP1,CH_ROP1,CH_MOP1]*Ch<>[]) and reginop(reg,p.oper[0]^) then
  826. begin
  827. RegReadByInstruction := true;
  828. exit
  829. end;
  830. if ([Ch_RWOP2,Ch_ROP2,Ch_MOP2]*Ch<>[]) and reginop(reg,p.oper[1]^) then
  831. begin
  832. RegReadByInstruction := true;
  833. exit
  834. end;
  835. if ([Ch_RWOP3,Ch_ROP3,Ch_MOP3]*Ch<>[]) and reginop(reg,p.oper[2]^) then
  836. begin
  837. RegReadByInstruction := true;
  838. exit
  839. end;
  840. if ([Ch_RWOP4,Ch_ROP4,Ch_MOP4]*Ch<>[]) and reginop(reg,p.oper[3]^) then
  841. begin
  842. RegReadByInstruction := true;
  843. exit
  844. end;
  845. end;
  846. end;
  847. end;
  848. end;
  849. function TX86AsmOptimizer.RegInInstruction(Reg: TRegister; p1: tai): Boolean;
  850. begin
  851. result:=false;
  852. if p1.typ<>ait_instruction then
  853. exit;
  854. if (Ch_All in insprop[taicpu(p1).opcode].Ch) then
  855. exit(true);
  856. if (getregtype(reg)=R_INTREGISTER) and
  857. { change information for xmm movsd are not correct }
  858. ((taicpu(p1).opcode<>A_MOVSD) or (taicpu(p1).ops=0)) then
  859. begin
  860. case getsupreg(reg) of
  861. { RS_EAX = RS_RAX on x86-64 }
  862. RS_EAX:
  863. result:=([Ch_REAX,Ch_RRAX,Ch_WEAX,Ch_WRAX,Ch_RWEAX,Ch_RWRAX,Ch_MEAX,Ch_MRAX]*insprop[taicpu(p1).opcode].Ch)<>[];
  864. RS_ECX:
  865. result:=([Ch_RECX,Ch_RRCX,Ch_WECX,Ch_WRCX,Ch_RWECX,Ch_RWRCX,Ch_MECX,Ch_MRCX]*insprop[taicpu(p1).opcode].Ch)<>[];
  866. RS_EDX:
  867. result:=([Ch_REDX,Ch_RRDX,Ch_WEDX,Ch_WRDX,Ch_RWEDX,Ch_RWRDX,Ch_MEDX,Ch_MRDX]*insprop[taicpu(p1).opcode].Ch)<>[];
  868. RS_EBX:
  869. result:=([Ch_REBX,Ch_RRBX,Ch_WEBX,Ch_WRBX,Ch_RWEBX,Ch_RWRBX,Ch_MEBX,Ch_MRBX]*insprop[taicpu(p1).opcode].Ch)<>[];
  870. RS_ESP:
  871. result:=([Ch_RESP,Ch_RRSP,Ch_WESP,Ch_WRSP,Ch_RWESP,Ch_RWRSP,Ch_MESP,Ch_MRSP]*insprop[taicpu(p1).opcode].Ch)<>[];
  872. RS_EBP:
  873. result:=([Ch_REBP,Ch_RRBP,Ch_WEBP,Ch_WRBP,Ch_RWEBP,Ch_RWRBP,Ch_MEBP,Ch_MRBP]*insprop[taicpu(p1).opcode].Ch)<>[];
  874. RS_ESI:
  875. result:=([Ch_RESI,Ch_RRSI,Ch_WESI,Ch_WRSI,Ch_RWESI,Ch_RWRSI,Ch_MESI,Ch_MRSI,Ch_RMemEDI]*insprop[taicpu(p1).opcode].Ch)<>[];
  876. RS_EDI:
  877. result:=([Ch_REDI,Ch_RRDI,Ch_WEDI,Ch_WRDI,Ch_RWEDI,Ch_RWRDI,Ch_MEDI,Ch_MRDI,Ch_WMemEDI]*insprop[taicpu(p1).opcode].Ch)<>[];
  878. else
  879. ;
  880. end;
  881. if result then
  882. exit;
  883. end
  884. else if getregtype(reg)=R_MMREGISTER then
  885. begin
  886. case getsupreg(reg) of
  887. RS_XMM0:
  888. result:=([Ch_RXMM0,Ch_WXMM0,Ch_RWXMM0,Ch_MXMM0]*insprop[taicpu(p1).opcode].Ch)<>[];
  889. else
  890. ;
  891. end;
  892. if result then
  893. exit;
  894. end
  895. else if SuperRegistersEqual(reg,NR_DEFAULTFLAGS) then
  896. begin
  897. if ([Ch_RFlags,Ch_WFlags,Ch_RWFlags,Ch_RFLAGScc]*insprop[taicpu(p1).opcode].Ch)<>[] then
  898. exit(true);
  899. case getsubreg(reg) of
  900. R_SUBFLAGCARRY:
  901. Result:=([Ch_RCarryFlag,Ch_RWCarryFlag,Ch_W0CarryFlag,Ch_W1CarryFlag,Ch_WCarryFlag,Ch_WUCarryFlag]*insprop[taicpu(p1).opcode].Ch)<>[];
  902. R_SUBFLAGPARITY:
  903. Result:=([Ch_RParityFlag,Ch_RWParityFlag,Ch_W0ParityFlag,Ch_W1ParityFlag,Ch_WParityFlag,Ch_WUParityFlag]*insprop[taicpu(p1).opcode].Ch)<>[];
  904. R_SUBFLAGAUXILIARY:
  905. Result:=([Ch_RAuxiliaryFlag,Ch_RWAuxiliaryFlag,Ch_W0AuxiliaryFlag,Ch_W1AuxiliaryFlag,Ch_WAuxiliaryFlag,Ch_WUAuxiliaryFlag]*insprop[taicpu(p1).opcode].Ch)<>[];
  906. R_SUBFLAGZERO:
  907. Result:=([Ch_RZeroFlag,Ch_RWZeroFlag,Ch_W0ZeroFlag,Ch_W1ZeroFlag,Ch_WZeroFlag,Ch_WUZeroFlag]*insprop[taicpu(p1).opcode].Ch)<>[];
  908. R_SUBFLAGSIGN:
  909. Result:=([Ch_RSignFlag,Ch_RWSignFlag,Ch_W0SignFlag,Ch_W1SignFlag,Ch_WSignFlag,Ch_WUSignFlag]*insprop[taicpu(p1).opcode].Ch)<>[];
  910. R_SUBFLAGOVERFLOW:
  911. Result:=([Ch_ROverflowFlag,Ch_RWOverflowFlag,Ch_W0OverflowFlag,Ch_W1OverflowFlag,Ch_WOverflowFlag,Ch_WUOverflowFlag]*insprop[taicpu(p1).opcode].Ch)<>[];
  912. R_SUBFLAGINTERRUPT:
  913. Result:=([Ch_W0IntFlag,Ch_W1IntFlag,Ch_WFlags]*insprop[taicpu(p1).opcode].Ch)<>[];
  914. R_SUBFLAGDIRECTION:
  915. Result:=([Ch_RDirFlag,Ch_W0DirFlag,Ch_W1DirFlag,Ch_WFlags]*insprop[taicpu(p1).opcode].Ch)<>[];
  916. R_SUBW,R_SUBD,R_SUBQ:
  917. { Everything except the direction bits }
  918. Result:=
  919. ([Ch_RCarryFlag,Ch_RParityFlag,Ch_RAuxiliaryFlag,Ch_RZeroFlag,Ch_RSignFlag,Ch_ROverflowFlag,
  920. Ch_WCarryFlag,Ch_WParityFlag,Ch_WAuxiliaryFlag,Ch_WZeroFlag,Ch_WSignFlag,Ch_WOverflowFlag,
  921. Ch_W0CarryFlag,Ch_W0ParityFlag,Ch_W0AuxiliaryFlag,Ch_W0ZeroFlag,Ch_W0SignFlag,Ch_W0OverflowFlag,
  922. Ch_W1CarryFlag,Ch_W1ParityFlag,Ch_W1AuxiliaryFlag,Ch_W1ZeroFlag,Ch_W1SignFlag,Ch_W1OverflowFlag,
  923. Ch_WUCarryFlag,Ch_WUParityFlag,Ch_WUAuxiliaryFlag,Ch_WUZeroFlag,Ch_WUSignFlag,Ch_WUOverflowFlag,
  924. Ch_RWCarryFlag,Ch_RWParityFlag,Ch_RWAuxiliaryFlag,Ch_RWZeroFlag,Ch_RWSignFlag,Ch_RWOverflowFlag
  925. ]*insprop[taicpu(p1).opcode].Ch)<>[];
  926. else
  927. ;
  928. end;
  929. if result then
  930. exit;
  931. end
  932. else if (getregtype(reg)=R_FPUREGISTER) and (Ch_FPU in insprop[taicpu(p1).opcode].Ch) then
  933. exit(true);
  934. Result:=inherited RegInInstruction(Reg, p1);
  935. end;
  936. function TX86AsmOptimizer.RegModifiedByInstruction(Reg: TRegister; p1: tai): boolean;
  937. const
  938. WriteOps: array[0..3] of set of TInsChange =
  939. ([CH_RWOP1,CH_WOP1,CH_MOP1],
  940. [Ch_RWOP2,Ch_WOP2,Ch_MOP2],
  941. [Ch_RWOP3,Ch_WOP3,Ch_MOP3],
  942. [Ch_RWOP4,Ch_WOP4,Ch_MOP4]);
  943. var
  944. OperIdx: Integer;
  945. begin
  946. Result := False;
  947. if p1.typ <> ait_instruction then
  948. exit;
  949. with insprop[taicpu(p1).opcode] do
  950. if SuperRegistersEqual(reg,NR_DEFAULTFLAGS) then
  951. begin
  952. case getsubreg(reg) of
  953. R_SUBW,R_SUBD,R_SUBQ:
  954. Result :=
  955. [Ch_WCarryFlag,Ch_WParityFlag,Ch_WAuxiliaryFlag,Ch_WZeroFlag,Ch_WSignFlag,Ch_WOverflowFlag,
  956. Ch_RWCarryFlag,Ch_RWParityFlag,Ch_RWAuxiliaryFlag,Ch_RWZeroFlag,Ch_RWSignFlag,Ch_RWOverflowFlag,
  957. Ch_W0DirFlag,Ch_W1DirFlag,Ch_W0IntFlag,Ch_W1IntFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  958. R_SUBFLAGCARRY:
  959. Result:=[Ch_WCarryFlag,Ch_RWCarryFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  960. R_SUBFLAGPARITY:
  961. Result:=[Ch_WParityFlag,Ch_RWParityFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  962. R_SUBFLAGAUXILIARY:
  963. Result:=[Ch_WAuxiliaryFlag,Ch_RWAuxiliaryFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  964. R_SUBFLAGZERO:
  965. Result:=[Ch_WZeroFlag,Ch_RWZeroFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  966. R_SUBFLAGSIGN:
  967. Result:=[Ch_WSignFlag,Ch_RWSignFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  968. R_SUBFLAGOVERFLOW:
  969. Result:=[Ch_WOverflowFlag,Ch_RWOverflowFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  970. R_SUBFLAGINTERRUPT:
  971. Result:=[Ch_W0IntFlag,Ch_W1IntFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  972. R_SUBFLAGDIRECTION:
  973. Result:=[Ch_W0DirFlag,Ch_W1DirFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  974. else
  975. internalerror(2017042602);
  976. end;
  977. exit;
  978. end;
  979. case taicpu(p1).opcode of
  980. A_CALL:
  981. { We could potentially set Result to False if the register in
  982. question is non-volatile for the subroutine's calling convention,
  983. but this would require detecting the calling convention in use and
  984. also assuming that the routine doesn't contain malformed assembly
  985. language, for example... so it could only be done under -O4 as it
  986. would be considered a side-effect. [Kit] }
  987. Result := True;
  988. A_MOVSD:
  989. { special handling for SSE MOVSD }
  990. if (taicpu(p1).ops>0) then
  991. begin
  992. if taicpu(p1).ops<>2 then
  993. internalerror(2017042703);
  994. Result := (taicpu(p1).oper[1]^.typ=top_reg) and RegInOp(reg,taicpu(p1).oper[1]^);
  995. end;
  996. { VMOVSS and VMOVSD has two and three operand flavours, this cannot modelled by x86ins.dat
  997. so fix it here (FK)
  998. }
  999. A_VMOVSS,
  1000. A_VMOVSD:
  1001. begin
  1002. Result := (taicpu(p1).ops=3) and (taicpu(p1).oper[2]^.typ=top_reg) and RegInOp(reg,taicpu(p1).oper[2]^);
  1003. exit;
  1004. end;
  1005. A_IMUL:
  1006. Result := (taicpu(p1).oper[taicpu(p1).ops-1]^.typ=top_reg) and RegInOp(reg,taicpu(p1).oper[taicpu(p1).ops-1]^);
  1007. else
  1008. ;
  1009. end;
  1010. if Result then
  1011. exit;
  1012. with insprop[taicpu(p1).opcode] do
  1013. begin
  1014. if getregtype(reg)=R_INTREGISTER then
  1015. begin
  1016. case getsupreg(reg) of
  1017. RS_EAX:
  1018. if [Ch_WEAX,Ch_RWEAX,Ch_MEAX,Ch_WRAX,Ch_RWRAX,Ch_MRAX]*Ch<>[] then
  1019. begin
  1020. Result := True;
  1021. exit
  1022. end;
  1023. RS_ECX:
  1024. if [Ch_WECX,Ch_RWECX,Ch_MECX,Ch_WRCX,Ch_RWRCX,Ch_MRCX]*Ch<>[] then
  1025. begin
  1026. Result := True;
  1027. exit
  1028. end;
  1029. RS_EDX:
  1030. if [Ch_WEDX,Ch_RWEDX,Ch_MEDX,Ch_WRDX,Ch_RWRDX,Ch_MRDX]*Ch<>[] then
  1031. begin
  1032. Result := True;
  1033. exit
  1034. end;
  1035. RS_EBX:
  1036. if [Ch_WEBX,Ch_RWEBX,Ch_MEBX,Ch_WRBX,Ch_RWRBX,Ch_MRBX]*Ch<>[] then
  1037. begin
  1038. Result := True;
  1039. exit
  1040. end;
  1041. RS_ESP:
  1042. if [Ch_WESP,Ch_RWESP,Ch_MESP,Ch_WRSP,Ch_RWRSP,Ch_MRSP]*Ch<>[] then
  1043. begin
  1044. Result := True;
  1045. exit
  1046. end;
  1047. RS_EBP:
  1048. if [Ch_WEBP,Ch_RWEBP,Ch_MEBP,Ch_WRBP,Ch_RWRBP,Ch_MRBP]*Ch<>[] then
  1049. begin
  1050. Result := True;
  1051. exit
  1052. end;
  1053. RS_ESI:
  1054. if [Ch_WESI,Ch_RWESI,Ch_MESI,Ch_WRSI,Ch_RWRSI,Ch_MRSI]*Ch<>[] then
  1055. begin
  1056. Result := True;
  1057. exit
  1058. end;
  1059. RS_EDI:
  1060. if [Ch_WEDI,Ch_RWEDI,Ch_MEDI,Ch_WRDI,Ch_RWRDI,Ch_MRDI]*Ch<>[] then
  1061. begin
  1062. Result := True;
  1063. exit
  1064. end;
  1065. end;
  1066. end;
  1067. for OperIdx := 0 to taicpu(p1).ops - 1 do
  1068. if (WriteOps[OperIdx]*Ch<>[]) and
  1069. { The register doesn't get modified inside a reference }
  1070. (taicpu(p1).oper[OperIdx]^.typ = top_reg) and
  1071. SuperRegistersEqual(reg,taicpu(p1).oper[OperIdx]^.reg) then
  1072. begin
  1073. Result := true;
  1074. exit
  1075. end;
  1076. end;
  1077. end;
  1078. {$ifdef DEBUG_AOPTCPU}
  1079. procedure TX86AsmOptimizer.DebugMsg(const s: string;p : tai);
  1080. begin
  1081. asml.insertbefore(tai_comment.Create(strpnew(s)), p);
  1082. end;
  1083. function debug_tostr(i: tcgint): string; inline;
  1084. begin
  1085. Result := tostr(i);
  1086. end;
  1087. function debug_hexstr(i: tcgint): string;
  1088. begin
  1089. Result := '0x';
  1090. case i of
  1091. 0..$FF:
  1092. Result := Result + hexstr(i, 2);
  1093. $100..$FFFF:
  1094. Result := Result + hexstr(i, 4);
  1095. $10000..$FFFFFF:
  1096. Result := Result + hexstr(i, 6);
  1097. $1000000..$FFFFFFFF:
  1098. Result := Result + hexstr(i, 8);
  1099. else
  1100. Result := Result + hexstr(i, 16);
  1101. end;
  1102. end;
  1103. function debug_regname(r: TRegister): string; inline;
  1104. begin
  1105. Result := '%' + std_regname(r);
  1106. end;
  1107. { Debug output function - creates a string representation of an operator }
  1108. function debug_operstr(oper: TOper): string;
  1109. begin
  1110. case oper.typ of
  1111. top_const:
  1112. Result := '$' + debug_tostr(oper.val);
  1113. top_reg:
  1114. Result := debug_regname(oper.reg);
  1115. top_ref:
  1116. begin
  1117. if oper.ref^.offset <> 0 then
  1118. Result := debug_tostr(oper.ref^.offset) + '('
  1119. else
  1120. Result := '(';
  1121. if (oper.ref^.base <> NR_INVALID) and (oper.ref^.base <> NR_NO) then
  1122. begin
  1123. Result := Result + debug_regname(oper.ref^.base);
  1124. if (oper.ref^.index <> NR_INVALID) and (oper.ref^.index <> NR_NO) then
  1125. Result := Result + ',' + debug_regname(oper.ref^.index);
  1126. end
  1127. else
  1128. if (oper.ref^.index <> NR_INVALID) and (oper.ref^.index <> NR_NO) then
  1129. Result := Result + debug_regname(oper.ref^.index);
  1130. if (oper.ref^.scalefactor > 1) then
  1131. Result := Result + ',' + debug_tostr(oper.ref^.scalefactor) + ')'
  1132. else
  1133. Result := Result + ')';
  1134. end;
  1135. else
  1136. Result := '[UNKNOWN]';
  1137. end;
  1138. end;
  1139. function debug_op2str(opcode: tasmop): string; inline;
  1140. begin
  1141. Result := std_op2str[opcode];
  1142. end;
  1143. function debug_opsize2str(opsize: topsize): string; inline;
  1144. begin
  1145. Result := gas_opsize2str[opsize];
  1146. end;
  1147. {$else DEBUG_AOPTCPU}
  1148. procedure TX86AsmOptimizer.DebugMsg(const s: string;p : tai);inline;
  1149. begin
  1150. end;
  1151. function debug_tostr(i: tcgint): string; inline;
  1152. begin
  1153. Result := '';
  1154. end;
  1155. function debug_hexstr(i: tcgint): string; inline;
  1156. begin
  1157. Result := '';
  1158. end;
  1159. function debug_regname(r: TRegister): string; inline;
  1160. begin
  1161. Result := '';
  1162. end;
  1163. function debug_operstr(oper: TOper): string; inline;
  1164. begin
  1165. Result := '';
  1166. end;
  1167. function debug_op2str(opcode: tasmop): string; inline;
  1168. begin
  1169. Result := '';
  1170. end;
  1171. function debug_opsize2str(opsize: topsize): string; inline;
  1172. begin
  1173. Result := '';
  1174. end;
  1175. {$endif DEBUG_AOPTCPU}
  1176. class function TX86AsmOptimizer.IsMOVZXAcceptable: Boolean; inline;
  1177. begin
  1178. {$ifdef x86_64}
  1179. { Always fine on x86-64 }
  1180. Result := True;
  1181. {$else x86_64}
  1182. Result :=
  1183. {$ifdef i8086}
  1184. (current_settings.cputype >= cpu_386) and
  1185. {$endif i8086}
  1186. (
  1187. { Always accept if optimising for size }
  1188. (cs_opt_size in current_settings.optimizerswitches) or
  1189. { From the Pentium II onwards, MOVZX only takes 1 cycle. [Kit] }
  1190. (current_settings.optimizecputype >= cpu_Pentium2)
  1191. );
  1192. {$endif x86_64}
  1193. end;
  1194. { Attempts to allocate a volatile integer register for use between p and hp,
  1195. using AUsedRegs for the current register usage information. Returns NR_NO
  1196. if no free register could be found }
  1197. function TX86AsmOptimizer.GetIntRegisterBetween(RegSize: TSubRegister; var AUsedRegs: TAllUsedRegs; p, hp: tai; DontAlloc: Boolean = False): TRegister;
  1198. var
  1199. RegSet: TCPURegisterSet;
  1200. CurrentSuperReg: Integer;
  1201. CurrentReg: TRegister;
  1202. Currentp: tai;
  1203. Breakout: Boolean;
  1204. begin
  1205. Result := NR_NO;
  1206. RegSet :=
  1207. paramanager.get_volatile_registers_int(current_procinfo.procdef.proccalloption) +
  1208. current_procinfo.saved_regs_int;
  1209. (*
  1210. { Don't use the frame register unless explicitly allowed (fixes i40111) }
  1211. if ([cs_useebp, cs_userbp] * current_settings.optimizerswitches) = [] then
  1212. Exclude(RegSet, RS_FRAME_POINTER_REG);
  1213. *)
  1214. for CurrentSuperReg in RegSet do
  1215. begin
  1216. CurrentReg := newreg(R_INTREGISTER, TSuperRegister(CurrentSuperReg), RegSize);
  1217. if not AUsedRegs[R_INTREGISTER].IsUsed(CurrentReg)
  1218. {$if defined(i386) or defined(i8086)}
  1219. { If the target size is 8-bit, make sure we can actually encode it }
  1220. and (
  1221. (RegSize >= R_SUBW) or { Not R_SUBL or R_SUBH }
  1222. (GetSupReg(CurrentReg) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX])
  1223. )
  1224. {$endif i386 or i8086}
  1225. then
  1226. begin
  1227. Currentp := p;
  1228. Breakout := False;
  1229. while not Breakout and GetNextInstruction(Currentp, Currentp) and (Currentp <> hp) do
  1230. begin
  1231. case Currentp.typ of
  1232. ait_instruction:
  1233. begin
  1234. if RegInInstruction(CurrentReg, Currentp) then
  1235. begin
  1236. Breakout := True;
  1237. Break;
  1238. end;
  1239. { Cannot allocate across an unconditional jump }
  1240. if is_calljmpuncondret(taicpu(Currentp).opcode) then
  1241. Exit;
  1242. end;
  1243. ait_marker:
  1244. { Don't try anything more if a marker is hit }
  1245. Exit;
  1246. ait_regalloc:
  1247. if (tai_regalloc(Currentp).ratype <> ra_dealloc) and SuperRegistersEqual(CurrentReg, tai_regalloc(Currentp).reg) then
  1248. begin
  1249. Breakout := True;
  1250. Break;
  1251. end;
  1252. else
  1253. ;
  1254. end;
  1255. end;
  1256. if Breakout then
  1257. { Try the next register }
  1258. Continue;
  1259. { We have a free register available }
  1260. Result := CurrentReg;
  1261. if not DontAlloc then
  1262. AllocRegBetween(CurrentReg, p, hp, AUsedRegs);
  1263. Exit;
  1264. end;
  1265. end;
  1266. end;
  1267. { Attempts to allocate a volatile MM register for use between p and hp,
  1268. using AUsedRegs for the current register usage information. Returns NR_NO
  1269. if no free register could be found }
  1270. function TX86AsmOptimizer.GetMMRegisterBetween(RegSize: TSubRegister; var AUsedRegs: TAllUsedRegs; p, hp: tai; DontAlloc: Boolean = False): TRegister;
  1271. var
  1272. RegSet: TCPURegisterSet;
  1273. CurrentSuperReg: Integer;
  1274. CurrentReg: TRegister;
  1275. Currentp: tai;
  1276. Breakout: Boolean;
  1277. begin
  1278. Result := NR_NO;
  1279. RegSet :=
  1280. paramanager.get_volatile_registers_mm(current_procinfo.procdef.proccalloption) +
  1281. current_procinfo.saved_regs_mm;
  1282. for CurrentSuperReg in RegSet do
  1283. begin
  1284. CurrentReg := newreg(R_MMREGISTER, TSuperRegister(CurrentSuperReg), RegSize);
  1285. if not AUsedRegs[R_MMREGISTER].IsUsed(CurrentReg) then
  1286. begin
  1287. Currentp := p;
  1288. Breakout := False;
  1289. while not Breakout and GetNextInstruction(Currentp, Currentp) and (Currentp <> hp) do
  1290. begin
  1291. case Currentp.typ of
  1292. ait_instruction:
  1293. begin
  1294. if RegInInstruction(CurrentReg, Currentp) then
  1295. begin
  1296. Breakout := True;
  1297. Break;
  1298. end;
  1299. { Cannot allocate across an unconditional jump }
  1300. if is_calljmpuncondret(taicpu(Currentp).opcode) then
  1301. Exit;
  1302. end;
  1303. ait_marker:
  1304. { Don't try anything more if a marker is hit }
  1305. Exit;
  1306. ait_regalloc:
  1307. if (tai_regalloc(Currentp).ratype <> ra_dealloc) and SuperRegistersEqual(CurrentReg, tai_regalloc(Currentp).reg) then
  1308. begin
  1309. Breakout := True;
  1310. Break;
  1311. end;
  1312. else
  1313. ;
  1314. end;
  1315. end;
  1316. if Breakout then
  1317. { Try the next register }
  1318. Continue;
  1319. { We have a free register available }
  1320. Result := CurrentReg;
  1321. if not DontAlloc then
  1322. AllocRegBetween(CurrentReg, p, hp, AUsedRegs);
  1323. Exit;
  1324. end;
  1325. end;
  1326. end;
  1327. class function TX86AsmOptimizer.Reg1WriteOverwritesReg2Entirely(reg1, reg2: tregister): boolean;
  1328. begin
  1329. if not SuperRegistersEqual(reg1,reg2) then
  1330. exit(false);
  1331. if getregtype(reg1)<>R_INTREGISTER then
  1332. exit(true); {because SuperRegisterEqual is true}
  1333. case getsubreg(reg1) of
  1334. { A write to R_SUBL doesn't change R_SUBH and if reg2 is R_SUBW or
  1335. higher, it preserves the high bits, so the new value depends on
  1336. reg2's previous value. In other words, it is equivalent to doing:
  1337. reg2 := (reg2 and $ffffff00) or byte(reg1); }
  1338. R_SUBL:
  1339. exit(getsubreg(reg2)=R_SUBL);
  1340. { A write to R_SUBH doesn't change R_SUBL and if reg2 is R_SUBW or
  1341. higher, it actually does a:
  1342. reg2 := (reg2 and $ffff00ff) or (reg1 and $ff00); }
  1343. R_SUBH:
  1344. exit(getsubreg(reg2)=R_SUBH);
  1345. { If reg2 is R_SUBD or larger, a write to R_SUBW preserves the high 16
  1346. bits of reg2:
  1347. reg2 := (reg2 and $ffff0000) or word(reg1); }
  1348. R_SUBW:
  1349. exit(getsubreg(reg2) in [R_SUBL,R_SUBH,R_SUBW]);
  1350. { a write to R_SUBD always overwrites every other subregister,
  1351. because it clears the high 32 bits of R_SUBQ on x86_64 }
  1352. R_SUBD,
  1353. R_SUBQ:
  1354. exit(true);
  1355. else
  1356. internalerror(2017042801);
  1357. end;
  1358. end;
  1359. class function TX86AsmOptimizer.Reg1ReadDependsOnReg2(reg1, reg2: tregister): boolean;
  1360. begin
  1361. if not SuperRegistersEqual(reg1,reg2) then
  1362. exit(false);
  1363. if getregtype(reg1)<>R_INTREGISTER then
  1364. exit(true); {because SuperRegisterEqual is true}
  1365. case getsubreg(reg1) of
  1366. R_SUBL:
  1367. exit(getsubreg(reg2)<>R_SUBH);
  1368. R_SUBH:
  1369. exit(getsubreg(reg2)<>R_SUBL);
  1370. R_SUBW,
  1371. R_SUBD,
  1372. R_SUBQ:
  1373. exit(true);
  1374. else
  1375. internalerror(2017042802);
  1376. end;
  1377. end;
  1378. function TX86AsmOptimizer.PrePeepholeOptSxx(var p : tai) : boolean;
  1379. var
  1380. hp1 : tai;
  1381. l : TCGInt;
  1382. begin
  1383. result:=false;
  1384. if not(GetNextInstruction(p, hp1)) then
  1385. exit;
  1386. { changes the code sequence
  1387. shr/sar const1, x
  1388. shl const2, x
  1389. to
  1390. either "sar/and", "shl/and" or just "and" depending on const1 and const2 }
  1391. if (taicpu(p).oper[0]^.typ = top_const) and
  1392. MatchInstruction(hp1,A_SHL,[]) and
  1393. (taicpu(hp1).oper[0]^.typ = top_const) and
  1394. (taicpu(hp1).opsize = taicpu(p).opsize) and
  1395. (taicpu(hp1).oper[1]^.typ = taicpu(p).oper[1]^.typ) and
  1396. OpsEqual(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^) then
  1397. begin
  1398. if (taicpu(p).oper[0]^.val > taicpu(hp1).oper[0]^.val) and
  1399. not(cs_opt_size in current_settings.optimizerswitches) then
  1400. begin
  1401. { shr/sar const1, %reg
  1402. shl const2, %reg
  1403. with const1 > const2 }
  1404. DebugMsg(SPeepholeOptimization + 'SxrShl2SxrAnd 1 done',p);
  1405. taicpu(p).loadConst(0,taicpu(p).oper[0]^.val-taicpu(hp1).oper[0]^.val);
  1406. taicpu(hp1).opcode := A_AND;
  1407. l := (1 shl (taicpu(hp1).oper[0]^.val)) - 1;
  1408. case taicpu(p).opsize Of
  1409. S_B: taicpu(hp1).loadConst(0,l Xor $ff);
  1410. S_W: taicpu(hp1).loadConst(0,l Xor $ffff);
  1411. S_L: taicpu(hp1).loadConst(0,l Xor tcgint($ffffffff));
  1412. S_Q: taicpu(hp1).loadConst(0,l Xor tcgint($ffffffffffffffff));
  1413. else
  1414. Internalerror(2017050703)
  1415. end;
  1416. end
  1417. else if (taicpu(p).oper[0]^.val<taicpu(hp1).oper[0]^.val) and
  1418. not(cs_opt_size in current_settings.optimizerswitches) then
  1419. begin
  1420. { shr/sar const1, %reg
  1421. shl const2, %reg
  1422. with const1 < const2 }
  1423. DebugMsg(SPeepholeOptimization + 'SxrShl2SxrAnd 2 done',p);
  1424. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val-taicpu(p).oper[0]^.val);
  1425. taicpu(p).opcode := A_AND;
  1426. l := (1 shl (taicpu(p).oper[0]^.val))-1;
  1427. case taicpu(p).opsize Of
  1428. S_B: taicpu(p).loadConst(0,l Xor $ff);
  1429. S_W: taicpu(p).loadConst(0,l Xor $ffff);
  1430. S_L: taicpu(p).loadConst(0,l Xor tcgint($ffffffff));
  1431. S_Q: taicpu(p).loadConst(0,l Xor tcgint($ffffffffffffffff));
  1432. else
  1433. Internalerror(2017050702)
  1434. end;
  1435. end
  1436. else if (taicpu(p).oper[0]^.val = taicpu(hp1).oper[0]^.val) then
  1437. begin
  1438. { shr/sar const1, %reg
  1439. shl const2, %reg
  1440. with const1 = const2 }
  1441. DebugMsg(SPeepholeOptimization + 'SxrShl2And done',p);
  1442. taicpu(p).opcode := A_AND;
  1443. l := (1 shl (taicpu(p).oper[0]^.val))-1;
  1444. case taicpu(p).opsize Of
  1445. S_B: taicpu(p).loadConst(0,l Xor $ff);
  1446. S_W: taicpu(p).loadConst(0,l Xor $ffff);
  1447. S_L: taicpu(p).loadConst(0,l Xor tcgint($ffffffff));
  1448. S_Q: taicpu(p).loadConst(0,l Xor tcgint($ffffffffffffffff));
  1449. else
  1450. Internalerror(2017050701)
  1451. end;
  1452. RemoveInstruction(hp1);
  1453. end;
  1454. end;
  1455. end;
  1456. function TX86AsmOptimizer.PrePeepholeOptIMUL(var p : tai) : boolean;
  1457. var
  1458. opsize : topsize;
  1459. hp1, hp2 : tai;
  1460. tmpref : treference;
  1461. ShiftValue : Cardinal;
  1462. BaseValue : TCGInt;
  1463. begin
  1464. result:=false;
  1465. opsize:=taicpu(p).opsize;
  1466. { changes certain "imul const, %reg"'s to lea sequences }
  1467. if (MatchOpType(taicpu(p),top_const,top_reg) or
  1468. MatchOpType(taicpu(p),top_const,top_reg,top_reg)) and
  1469. (opsize in [S_L{$ifdef x86_64},S_Q{$endif x86_64}]) then
  1470. if (taicpu(p).oper[0]^.val = 1) then
  1471. if (taicpu(p).ops = 2) then
  1472. { remove "imul $1, reg" }
  1473. begin
  1474. DebugMsg(SPeepholeOptimization + 'Imul2Nop done',p);
  1475. Result := RemoveCurrentP(p);
  1476. end
  1477. else
  1478. { change "imul $1, reg1, reg2" to "mov reg1, reg2" }
  1479. begin
  1480. hp1 := taicpu.Op_Reg_Reg(A_MOV, opsize, taicpu(p).oper[1]^.reg,taicpu(p).oper[2]^.reg);
  1481. taicpu(hp1).fileinfo := taicpu(p).fileinfo;
  1482. asml.InsertAfter(hp1, p);
  1483. DebugMsg(SPeepholeOptimization + 'Imul2Mov done',p);
  1484. RemoveCurrentP(p, hp1);
  1485. Result := True;
  1486. end
  1487. else if ((taicpu(p).ops <= 2) or
  1488. (taicpu(p).oper[2]^.typ = Top_Reg)) and
  1489. not(cs_opt_size in current_settings.optimizerswitches) and
  1490. (not(GetNextInstruction(p, hp1)) or
  1491. not((tai(hp1).typ = ait_instruction) and
  1492. ((taicpu(hp1).opcode=A_Jcc) and
  1493. (taicpu(hp1).condition in [C_O,C_NO])))) then
  1494. begin
  1495. {
  1496. imul X, reg1, reg2 to
  1497. lea (reg1,reg1,Y), reg2
  1498. shl ZZ,reg2
  1499. imul XX, reg1 to
  1500. lea (reg1,reg1,YY), reg1
  1501. shl ZZ,reg2
  1502. This optimziation makes sense for pretty much every x86, except the VIA Nano3000: it has IMUL latency 2, lea/shl pair as well,
  1503. it does not exist as a separate optimization target in FPC though.
  1504. This optimziation can be applied as long as only two bits are set in the constant and those two bits are separated by
  1505. at most two zeros
  1506. }
  1507. reference_reset(tmpref,1,[]);
  1508. if (PopCnt(QWord(taicpu(p).oper[0]^.val))=2) and (BsrQWord(taicpu(p).oper[0]^.val)-BsfQWord(taicpu(p).oper[0]^.val)<=3) then
  1509. begin
  1510. ShiftValue:=BsfQWord(taicpu(p).oper[0]^.val);
  1511. BaseValue:=taicpu(p).oper[0]^.val shr ShiftValue;
  1512. TmpRef.base := taicpu(p).oper[1]^.reg;
  1513. TmpRef.index := taicpu(p).oper[1]^.reg;
  1514. if not(BaseValue in [3,5,9]) then
  1515. Internalerror(2018110101);
  1516. TmpRef.ScaleFactor := BaseValue-1;
  1517. if (taicpu(p).ops = 2) then
  1518. hp1 := taicpu.op_ref_reg(A_LEA, opsize, TmpRef, taicpu(p).oper[1]^.reg)
  1519. else
  1520. hp1 := taicpu.op_ref_reg(A_LEA, opsize, TmpRef, taicpu(p).oper[2]^.reg);
  1521. AsmL.InsertAfter(hp1,p);
  1522. DebugMsg(SPeepholeOptimization + 'Imul2LeaShl done',p);
  1523. taicpu(hp1).fileinfo:=taicpu(p).fileinfo;
  1524. RemoveCurrentP(p, hp1);
  1525. if ShiftValue>0 then
  1526. begin
  1527. hp2 := taicpu.op_const_reg(A_SHL, opsize, ShiftValue, taicpu(hp1).oper[1]^.reg);
  1528. AsmL.InsertAfter(hp2,hp1);
  1529. taicpu(hp2).fileinfo:=taicpu(hp1).fileinfo;
  1530. end;
  1531. Result := True;
  1532. end;
  1533. end;
  1534. end;
  1535. function TX86AsmOptimizer.PrePeepholeOptAND(var p : tai) : boolean;
  1536. begin
  1537. Result := False;
  1538. if MatchOperand(taicpu(p).oper[0]^, 0) and
  1539. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  1540. begin
  1541. DebugMsg(SPeepholeOptimization + 'AND 0 -> MOV 0', p);
  1542. taicpu(p).opcode := A_MOV;
  1543. Result := True;
  1544. end;
  1545. end;
  1546. function TX86AsmOptimizer.RegLoadedWithNewValue(reg: tregister; hp: tai): boolean;
  1547. var
  1548. p: taicpu absolute hp; { Implicit typecast }
  1549. i: Integer;
  1550. begin
  1551. Result := False;
  1552. if not assigned(hp) or
  1553. (hp.typ <> ait_instruction) then
  1554. Exit;
  1555. Prefetch(insprop[p.opcode]);
  1556. if SuperRegistersEqual(reg,NR_DEFAULTFLAGS) then
  1557. with insprop[p.opcode] do
  1558. begin
  1559. case getsubreg(reg) of
  1560. R_SUBW,R_SUBD,R_SUBQ:
  1561. Result:=
  1562. { ZF, CF, OF, SF, PF and AF must all be set in some way (ordered so the most
  1563. uncommon flags are checked first }
  1564. ([Ch_W0AuxiliaryFlag,Ch_W1AuxiliaryFlag,Ch_WAuxiliaryFlag,Ch_WUAuxiliaryFlag,Ch_WFlags] * Ch <> []) and
  1565. ([Ch_W0ParityFlag,Ch_W1ParityFlag,Ch_WParityFlag,Ch_WUParityFlag,Ch_WFlags]*Ch <> []) and
  1566. ([Ch_W0SignFlag,Ch_W1SignFlag,Ch_WSignFlag,Ch_WUSignFlag,Ch_WFlags]*Ch <> []) and
  1567. ([Ch_W0OverflowFlag,Ch_W1OverflowFlag,Ch_WOverflowFlag,Ch_WUOverflowFlag,Ch_WFlags]*Ch <> []) and
  1568. ([Ch_W0CarryFlag,Ch_W1CarryFlag,Ch_WCarryFlag,Ch_WUCarryFlag,Ch_WFlags]*Ch <> []) and
  1569. ([Ch_W0ZeroFlag,Ch_W1ZeroFlag,Ch_WZeroFlag,Ch_WUZeroFlag,Ch_WFlags]*Ch <> []);
  1570. R_SUBFLAGCARRY:
  1571. Result:=[Ch_W0CarryFlag,Ch_W1CarryFlag,Ch_WCarryFlag,Ch_WUCarryFlag,Ch_WFlags]*Ch<>[];
  1572. R_SUBFLAGPARITY:
  1573. Result:=[Ch_W0ParityFlag,Ch_W1ParityFlag,Ch_WParityFlag,Ch_WUParityFlag,Ch_WFlags]*Ch<>[];
  1574. R_SUBFLAGAUXILIARY:
  1575. Result:=[Ch_W0AuxiliaryFlag,Ch_W1AuxiliaryFlag,Ch_WAuxiliaryFlag,Ch_WUAuxiliaryFlag,Ch_WFlags]*Ch<>[];
  1576. R_SUBFLAGZERO:
  1577. Result:=[Ch_W0ZeroFlag,Ch_W1ZeroFlag,Ch_WZeroFlag,Ch_WUZeroFlag,Ch_WFlags]*Ch<>[];
  1578. R_SUBFLAGSIGN:
  1579. Result:=[Ch_W0SignFlag,Ch_W1SignFlag,Ch_WSignFlag,Ch_WUSignFlag,Ch_WFlags]*Ch<>[];
  1580. R_SUBFLAGOVERFLOW:
  1581. Result:=[Ch_W0OverflowFlag,Ch_W1OverflowFlag,Ch_WOverflowFlag,Ch_WUOverflowFlag,Ch_WFlags]*Ch<>[];
  1582. R_SUBFLAGINTERRUPT:
  1583. Result:=[Ch_W0IntFlag,Ch_W1IntFlag,Ch_WFlags]*Ch<>[];
  1584. R_SUBFLAGDIRECTION:
  1585. Result:=[Ch_W0DirFlag,Ch_W1DirFlag,Ch_WFlags]*Ch<>[];
  1586. else
  1587. internalerror(2017050501);
  1588. end;
  1589. exit;
  1590. end;
  1591. { Handle special cases first }
  1592. case p.opcode of
  1593. A_MOV, A_MOVZX, A_MOVSX, A_LEA, A_VMOVSS, A_VMOVSD, A_VMOVAPD,
  1594. A_VMOVAPS, A_VMOVQ, A_MOVSS, A_MOVSD, A_MOVQ, A_MOVAPD, A_MOVAPS:
  1595. begin
  1596. Result :=
  1597. (p.ops=2) and { A_MOVSD can have zero operands, so this check is needed }
  1598. (p.oper[1]^.typ = top_reg) and
  1599. (Reg1WriteOverwritesReg2Entirely(p.oper[1]^.reg,reg)) and
  1600. (
  1601. (p.oper[0]^.typ = top_const) or
  1602. (
  1603. (p.oper[0]^.typ = top_reg) and
  1604. not(Reg1ReadDependsOnReg2(p.oper[0]^.reg,reg))
  1605. ) or (
  1606. (p.oper[0]^.typ = top_ref) and
  1607. not RegInRef(reg,p.oper[0]^.ref^)
  1608. )
  1609. );
  1610. end;
  1611. A_MUL, A_IMUL:
  1612. Result :=
  1613. (
  1614. (p.ops=3) and { IMUL only }
  1615. (Reg1WriteOverwritesReg2Entirely(p.oper[2]^.reg,reg)) and
  1616. (
  1617. (
  1618. (p.oper[1]^.typ=top_reg) and
  1619. not Reg1ReadDependsOnReg2(p.oper[1]^.reg,reg)
  1620. ) or (
  1621. (p.oper[1]^.typ=top_ref) and
  1622. not RegInRef(reg,p.oper[1]^.ref^)
  1623. )
  1624. )
  1625. ) or (
  1626. (
  1627. (p.ops=1) and
  1628. (
  1629. (
  1630. (
  1631. (p.oper[0]^.typ=top_reg) and
  1632. not Reg1ReadDependsOnReg2(p.oper[0]^.reg,reg)
  1633. )
  1634. ) or (
  1635. (p.oper[0]^.typ=top_ref) and
  1636. not RegInRef(reg,p.oper[0]^.ref^)
  1637. )
  1638. ) and (
  1639. (
  1640. (p.opsize=S_B) and
  1641. Reg1WriteOverwritesReg2Entirely(NR_AX,reg) and
  1642. not Reg1ReadDependsOnReg2(NR_AL,reg)
  1643. ) or (
  1644. (p.opsize=S_W) and
  1645. Reg1WriteOverwritesReg2Entirely(NR_DX,reg)
  1646. ) or (
  1647. (p.opsize=S_L) and
  1648. Reg1WriteOverwritesReg2Entirely(NR_EDX,reg)
  1649. {$ifdef x86_64}
  1650. ) or (
  1651. (p.opsize=S_Q) and
  1652. Reg1WriteOverwritesReg2Entirely(NR_RDX,reg)
  1653. {$endif x86_64}
  1654. )
  1655. )
  1656. )
  1657. );
  1658. A_CBW:
  1659. Result := Reg1WriteOverwritesReg2Entirely(NR_AX,reg) and not(Reg1ReadDependsOnReg2(NR_AL,reg));
  1660. {$ifndef x86_64}
  1661. A_LDS:
  1662. Result := (reg=NR_DS) and not(RegInRef(reg,p.oper[0]^.ref^));
  1663. A_LES:
  1664. Result := (reg=NR_ES) and not(RegInRef(reg,p.oper[0]^.ref^));
  1665. {$endif not x86_64}
  1666. A_LFS:
  1667. Result := (reg=NR_FS) and not(RegInRef(reg,p.oper[0]^.ref^));
  1668. A_LGS:
  1669. Result := (reg=NR_GS) and not(RegInRef(reg,p.oper[0]^.ref^));
  1670. A_LSS:
  1671. Result := (reg=NR_SS) and not(RegInRef(reg,p.oper[0]^.ref^));
  1672. A_LAHF{$ifndef x86_64}, A_AAM{$endif not x86_64}:
  1673. Result := Reg1WriteOverwritesReg2Entirely(NR_AH,reg);
  1674. A_LODSB:
  1675. Result := Reg1WriteOverwritesReg2Entirely(NR_AL,reg);
  1676. A_LODSW:
  1677. Result := Reg1WriteOverwritesReg2Entirely(NR_AX,reg);
  1678. {$ifdef x86_64}
  1679. A_LODSQ:
  1680. Result := Reg1WriteOverwritesReg2Entirely(NR_RAX,reg);
  1681. {$endif x86_64}
  1682. A_LODSD:
  1683. Result := Reg1WriteOverwritesReg2Entirely(NR_EAX,reg);
  1684. A_FSTSW, A_FNSTSW:
  1685. Result := (p.oper[0]^.typ=top_reg) and Reg1WriteOverwritesReg2Entirely(p.oper[0]^.reg,reg);
  1686. else
  1687. begin
  1688. with insprop[p.opcode] do
  1689. begin
  1690. if (
  1691. { xor %reg,%reg etc. is classed as a new value }
  1692. (([Ch_NoReadIfEqualRegs]*Ch)<>[]) and
  1693. MatchOpType(p, top_reg, top_reg) and
  1694. (p.oper[0]^.reg = p.oper[1]^.reg) and
  1695. Reg1WriteOverwritesReg2Entirely(p.oper[1]^.reg,reg)
  1696. ) then
  1697. begin
  1698. Result := True;
  1699. Exit;
  1700. end;
  1701. { Make sure the entire register is overwritten }
  1702. if (getregtype(reg) = R_INTREGISTER) then
  1703. begin
  1704. if (p.ops > 0) then
  1705. begin
  1706. if RegInOp(reg, p.oper[0]^) then
  1707. begin
  1708. if (p.oper[0]^.typ = top_ref) then
  1709. begin
  1710. if RegInRef(reg, p.oper[0]^.ref^) then
  1711. begin
  1712. Result := False;
  1713. Exit;
  1714. end;
  1715. end
  1716. else if (p.oper[0]^.typ = top_reg) then
  1717. begin
  1718. if ([Ch_ROp1, Ch_RWOp1, Ch_MOp1]*Ch<>[]) then
  1719. begin
  1720. Result := False;
  1721. Exit;
  1722. end
  1723. else if ([Ch_WOp1]*Ch<>[]) then
  1724. begin
  1725. if Reg1WriteOverwritesReg2Entirely(p.oper[0]^.reg, reg) then
  1726. Result := True
  1727. else
  1728. begin
  1729. Result := False;
  1730. Exit;
  1731. end;
  1732. end;
  1733. end;
  1734. end;
  1735. if (p.ops > 1) then
  1736. begin
  1737. if RegInOp(reg, p.oper[1]^) then
  1738. begin
  1739. if (p.oper[1]^.typ = top_ref) then
  1740. begin
  1741. if RegInRef(reg, p.oper[1]^.ref^) then
  1742. begin
  1743. Result := False;
  1744. Exit;
  1745. end;
  1746. end
  1747. else if (p.oper[1]^.typ = top_reg) then
  1748. begin
  1749. if ([Ch_ROp2, Ch_RWOp2, Ch_MOp2]*Ch<>[]) then
  1750. begin
  1751. Result := False;
  1752. Exit;
  1753. end
  1754. else if ([Ch_WOp2]*Ch<>[]) then
  1755. begin
  1756. if Reg1WriteOverwritesReg2Entirely(p.oper[1]^.reg, reg) then
  1757. Result := True
  1758. else
  1759. begin
  1760. Result := False;
  1761. Exit;
  1762. end;
  1763. end;
  1764. end;
  1765. end;
  1766. if (p.ops > 2) then
  1767. begin
  1768. if RegInOp(reg, p.oper[2]^) then
  1769. begin
  1770. if (p.oper[2]^.typ = top_ref) then
  1771. begin
  1772. if RegInRef(reg, p.oper[2]^.ref^) then
  1773. begin
  1774. Result := False;
  1775. Exit;
  1776. end;
  1777. end
  1778. else if (p.oper[2]^.typ = top_reg) then
  1779. begin
  1780. if ([Ch_ROp3, Ch_RWOp3, Ch_MOp3]*Ch<>[]) then
  1781. begin
  1782. Result := False;
  1783. Exit;
  1784. end
  1785. else if ([Ch_WOp3]*Ch<>[]) then
  1786. begin
  1787. if Reg1WriteOverwritesReg2Entirely(p.oper[2]^.reg, reg) then
  1788. Result := True
  1789. else
  1790. begin
  1791. Result := False;
  1792. Exit;
  1793. end;
  1794. end;
  1795. end;
  1796. end;
  1797. if (p.ops > 3) and RegInOp(reg, p.oper[3]^) then
  1798. begin
  1799. if (p.oper[3]^.typ = top_ref) then
  1800. begin
  1801. if RegInRef(reg, p.oper[3]^.ref^) then
  1802. begin
  1803. Result := False;
  1804. Exit;
  1805. end;
  1806. end
  1807. else if (p.oper[3]^.typ = top_reg) then
  1808. begin
  1809. if ([Ch_ROp4, Ch_RWOp4, Ch_MOp4]*Ch<>[]) then
  1810. begin
  1811. Result := False;
  1812. Exit;
  1813. end
  1814. else if ([Ch_WOp4]*Ch<>[]) then
  1815. begin
  1816. if Reg1WriteOverwritesReg2Entirely(p.oper[3]^.reg, reg) then
  1817. Result := True
  1818. else
  1819. begin
  1820. Result := False;
  1821. Exit;
  1822. end;
  1823. end;
  1824. end;
  1825. end;
  1826. end;
  1827. end;
  1828. end;
  1829. { Don't do these ones first in case an input operand is equal to an explicit output register }
  1830. case getsupreg(reg) of
  1831. RS_EAX:
  1832. if ([Ch_WEAX{$ifdef x86_64},Ch_WRAX{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EAX, reg) then
  1833. begin
  1834. Result := True;
  1835. Exit;
  1836. end;
  1837. RS_ECX:
  1838. if ([Ch_WECX{$ifdef x86_64},Ch_WRCX{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_ECX, reg) then
  1839. begin
  1840. Result := True;
  1841. Exit;
  1842. end;
  1843. RS_EDX:
  1844. if ([Ch_REDX{$ifdef x86_64},Ch_WRDX{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EDX, reg) then
  1845. begin
  1846. Result := True;
  1847. Exit;
  1848. end;
  1849. RS_EBX:
  1850. if ([Ch_WEBX{$ifdef x86_64},Ch_WRBX{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EBX, reg) then
  1851. begin
  1852. Result := True;
  1853. Exit;
  1854. end;
  1855. RS_ESP:
  1856. if ([Ch_WESP{$ifdef x86_64},Ch_WRSP{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_ESP, reg) then
  1857. begin
  1858. Result := True;
  1859. Exit;
  1860. end;
  1861. RS_EBP:
  1862. if ([Ch_WEBP{$ifdef x86_64},Ch_WRBP{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EBP, reg) then
  1863. begin
  1864. Result := True;
  1865. Exit;
  1866. end;
  1867. RS_ESI:
  1868. if ([Ch_WESI{$ifdef x86_64},Ch_WRSI{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_ESI, reg) then
  1869. begin
  1870. Result := True;
  1871. Exit;
  1872. end;
  1873. RS_EDI:
  1874. if ([Ch_WEDI{$ifdef x86_64},Ch_WRDI{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EDI, reg) then
  1875. begin
  1876. Result := True;
  1877. Exit;
  1878. end;
  1879. else
  1880. ;
  1881. end;
  1882. end;
  1883. end;
  1884. end;
  1885. end;
  1886. end;
  1887. class function TX86AsmOptimizer.IsExitCode(p : tai) : boolean;
  1888. var
  1889. hp2,hp3 : tai;
  1890. begin
  1891. { some x86-64 issue a NOP before the real exit code }
  1892. if MatchInstruction(p,A_NOP,[]) then
  1893. GetNextInstruction(p,p);
  1894. result:=assigned(p) and (p.typ=ait_instruction) and
  1895. ((taicpu(p).opcode = A_RET) or
  1896. ((taicpu(p).opcode=A_LEAVE) and
  1897. GetNextInstruction(p,hp2) and
  1898. MatchInstruction(hp2,A_RET,[S_NO])
  1899. ) or
  1900. (((taicpu(p).opcode=A_LEA) and
  1901. MatchOpType(taicpu(p),top_ref,top_reg) and
  1902. (taicpu(p).oper[0]^.ref^.base=NR_STACK_POINTER_REG) and
  1903. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG)
  1904. ) and
  1905. GetNextInstruction(p,hp2) and
  1906. MatchInstruction(hp2,A_RET,[S_NO])
  1907. ) or
  1908. ((((taicpu(p).opcode=A_MOV) and
  1909. MatchOpType(taicpu(p),top_reg,top_reg) and
  1910. (taicpu(p).oper[0]^.reg=current_procinfo.framepointer) and
  1911. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG)) or
  1912. ((taicpu(p).opcode=A_LEA) and
  1913. MatchOpType(taicpu(p),top_ref,top_reg) and
  1914. (taicpu(p).oper[0]^.ref^.base=current_procinfo.framepointer) and
  1915. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG)
  1916. )
  1917. ) and
  1918. GetNextInstruction(p,hp2) and
  1919. MatchInstruction(hp2,A_POP,[reg2opsize(current_procinfo.framepointer)]) and
  1920. MatchOpType(taicpu(hp2),top_reg) and
  1921. (taicpu(hp2).oper[0]^.reg=current_procinfo.framepointer) and
  1922. GetNextInstruction(hp2,hp3) and
  1923. MatchInstruction(hp3,A_RET,[S_NO])
  1924. )
  1925. );
  1926. end;
  1927. class function TX86AsmOptimizer.isFoldableArithOp(hp1: taicpu; reg: tregister): boolean;
  1928. begin
  1929. isFoldableArithOp := False;
  1930. case hp1.opcode of
  1931. A_ADD,A_SUB,A_OR,A_XOR,A_AND,A_SHL,A_SHR,A_SAR:
  1932. isFoldableArithOp :=
  1933. ((taicpu(hp1).oper[0]^.typ = top_const) or
  1934. ((taicpu(hp1).oper[0]^.typ = top_reg) and
  1935. (taicpu(hp1).oper[0]^.reg <> reg))) and
  1936. (taicpu(hp1).oper[1]^.typ = top_reg) and
  1937. (taicpu(hp1).oper[1]^.reg = reg);
  1938. A_INC,A_DEC,A_NEG,A_NOT:
  1939. isFoldableArithOp :=
  1940. (taicpu(hp1).oper[0]^.typ = top_reg) and
  1941. (taicpu(hp1).oper[0]^.reg = reg);
  1942. else
  1943. ;
  1944. end;
  1945. end;
  1946. procedure TX86AsmOptimizer.RemoveLastDeallocForFuncRes(p: tai);
  1947. procedure DoRemoveLastDeallocForFuncRes( supreg: tsuperregister);
  1948. var
  1949. hp2: tai;
  1950. begin
  1951. hp2 := p;
  1952. repeat
  1953. hp2 := tai(hp2.previous);
  1954. if assigned(hp2) and
  1955. (hp2.typ = ait_regalloc) and
  1956. (tai_regalloc(hp2).ratype=ra_dealloc) and
  1957. (getregtype(tai_regalloc(hp2).reg) = R_INTREGISTER) and
  1958. (getsupreg(tai_regalloc(hp2).reg) = supreg) then
  1959. begin
  1960. RemoveInstruction(hp2);
  1961. break;
  1962. end;
  1963. until not(assigned(hp2)) or regInInstruction(newreg(R_INTREGISTER,supreg,R_SUBWHOLE),hp2);
  1964. end;
  1965. begin
  1966. case current_procinfo.procdef.returndef.typ of
  1967. arraydef,recorddef,pointerdef,
  1968. stringdef,enumdef,procdef,objectdef,errordef,
  1969. filedef,setdef,procvardef,
  1970. classrefdef,forwarddef:
  1971. DoRemoveLastDeallocForFuncRes(RS_EAX);
  1972. orddef:
  1973. if current_procinfo.procdef.returndef.size <> 0 then
  1974. begin
  1975. DoRemoveLastDeallocForFuncRes(RS_EAX);
  1976. { for int64/qword }
  1977. if current_procinfo.procdef.returndef.size = 8 then
  1978. DoRemoveLastDeallocForFuncRes(RS_EDX);
  1979. end;
  1980. else
  1981. ;
  1982. end;
  1983. end;
  1984. function TX86AsmOptimizer.OptPass1_V_MOVAP(var p : tai) : boolean;
  1985. var
  1986. hp1,hp2 : tai;
  1987. begin
  1988. result:=false;
  1989. if MatchOpType(taicpu(p),top_reg,top_reg) then
  1990. begin
  1991. { vmova* reg1,reg1
  1992. =>
  1993. <nop> }
  1994. if taicpu(p).oper[0]^.reg = taicpu(p).oper[1]^.reg then
  1995. begin
  1996. RemoveCurrentP(p);
  1997. result:=true;
  1998. exit;
  1999. end;
  2000. if GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg) then
  2001. begin
  2002. if MatchInstruction(hp1,[taicpu(p).opcode],[S_NO]) and
  2003. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) then
  2004. begin
  2005. { vmova* reg1,reg2
  2006. vmova* reg2,reg3
  2007. dealloc reg2
  2008. =>
  2009. vmova* reg1,reg3 }
  2010. TransferUsedRegs(TmpUsedRegs);
  2011. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2012. if MatchOpType(taicpu(hp1),top_reg,top_reg) and
  2013. not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  2014. begin
  2015. DebugMsg(SPeepholeOptimization + '(V)MOVA*(V)MOVA*2(V)MOVA* 1',p);
  2016. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  2017. RemoveInstruction(hp1);
  2018. result:=true;
  2019. exit;
  2020. end;
  2021. { special case:
  2022. vmova* reg1,<op>
  2023. vmova* <op>,reg1
  2024. =>
  2025. vmova* reg1,<op> }
  2026. if MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[1]^) and
  2027. ((taicpu(p).oper[0]^.typ<>top_ref) or
  2028. (not(vol_read in taicpu(p).oper[0]^.ref^.volatility))
  2029. ) then
  2030. begin
  2031. DebugMsg(SPeepholeOptimization + '(V)MOVA*(V)MOVA*2(V)MOVA* 2',p);
  2032. RemoveInstruction(hp1);
  2033. result:=true;
  2034. exit;
  2035. end
  2036. end
  2037. else if ((MatchInstruction(p,[A_MOVAPS,A_VMOVAPS],[S_NO]) and
  2038. MatchInstruction(hp1,[A_MOVSS,A_VMOVSS],[S_NO])) or
  2039. ((MatchInstruction(p,[A_MOVAPD,A_VMOVAPD],[S_NO]) and
  2040. MatchInstruction(hp1,[A_MOVSD,A_VMOVSD],[S_NO])))
  2041. ) and
  2042. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) then
  2043. begin
  2044. { vmova* reg1,reg2
  2045. vmovs* reg2,<op>
  2046. dealloc reg2
  2047. =>
  2048. vmovs* reg1,reg3 }
  2049. TransferUsedRegs(TmpUsedRegs);
  2050. UpdateUsedRegsBetween(TmpUsedRegs, p, hp1);
  2051. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  2052. begin
  2053. DebugMsg(SPeepholeOptimization + '(V)MOVA*(V)MOVS*2(V)MOVS* 1',p);
  2054. taicpu(p).opcode:=taicpu(hp1).opcode;
  2055. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  2056. RemoveInstruction(hp1);
  2057. result:=true;
  2058. exit;
  2059. end
  2060. end;
  2061. end;
  2062. if GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg) then
  2063. begin
  2064. if MatchInstruction(hp1,[A_VFMADDPD,
  2065. A_VFMADD132PD,
  2066. A_VFMADD132PS,
  2067. A_VFMADD132SD,
  2068. A_VFMADD132SS,
  2069. A_VFMADD213PD,
  2070. A_VFMADD213PS,
  2071. A_VFMADD213SD,
  2072. A_VFMADD213SS,
  2073. A_VFMADD231PD,
  2074. A_VFMADD231PS,
  2075. A_VFMADD231SD,
  2076. A_VFMADD231SS,
  2077. A_VFMADDSUB132PD,
  2078. A_VFMADDSUB132PS,
  2079. A_VFMADDSUB213PD,
  2080. A_VFMADDSUB213PS,
  2081. A_VFMADDSUB231PD,
  2082. A_VFMADDSUB231PS,
  2083. A_VFMSUB132PD,
  2084. A_VFMSUB132PS,
  2085. A_VFMSUB132SD,
  2086. A_VFMSUB132SS,
  2087. A_VFMSUB213PD,
  2088. A_VFMSUB213PS,
  2089. A_VFMSUB213SD,
  2090. A_VFMSUB213SS,
  2091. A_VFMSUB231PD,
  2092. A_VFMSUB231PS,
  2093. A_VFMSUB231SD,
  2094. A_VFMSUB231SS,
  2095. A_VFMSUBADD132PD,
  2096. A_VFMSUBADD132PS,
  2097. A_VFMSUBADD213PD,
  2098. A_VFMSUBADD213PS,
  2099. A_VFMSUBADD231PD,
  2100. A_VFMSUBADD231PS,
  2101. A_VFNMADD132PD,
  2102. A_VFNMADD132PS,
  2103. A_VFNMADD132SD,
  2104. A_VFNMADD132SS,
  2105. A_VFNMADD213PD,
  2106. A_VFNMADD213PS,
  2107. A_VFNMADD213SD,
  2108. A_VFNMADD213SS,
  2109. A_VFNMADD231PD,
  2110. A_VFNMADD231PS,
  2111. A_VFNMADD231SD,
  2112. A_VFNMADD231SS,
  2113. A_VFNMSUB132PD,
  2114. A_VFNMSUB132PS,
  2115. A_VFNMSUB132SD,
  2116. A_VFNMSUB132SS,
  2117. A_VFNMSUB213PD,
  2118. A_VFNMSUB213PS,
  2119. A_VFNMSUB213SD,
  2120. A_VFNMSUB213SS,
  2121. A_VFNMSUB231PD,
  2122. A_VFNMSUB231PS,
  2123. A_VFNMSUB231SD,
  2124. A_VFNMSUB231SS],[S_NO]) and
  2125. { we mix single and double opperations here because we assume that the compiler
  2126. generates vmovapd only after double operations and vmovaps only after single operations }
  2127. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[2]^.reg) and
  2128. GetNextInstructionUsingReg(hp1, hp2, taicpu(hp1).oper[2]^.reg) and
  2129. MatchInstruction(hp2,[A_VMOVAPD,A_VMOVAPS,A_MOVAPD,A_MOVAPS],[S_NO]) and
  2130. MatchOperand(taicpu(p).oper[0]^,taicpu(hp2).oper[1]^) then
  2131. begin
  2132. TransferUsedRegs(TmpUsedRegs);
  2133. UpdateUsedRegsBetween(TmpUsedRegs, p, hp2);
  2134. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs)) then
  2135. begin
  2136. taicpu(hp1).loadoper(2,taicpu(p).oper[0]^);
  2137. if (cs_opt_level3 in current_settings.optimizerswitches) then
  2138. RemoveCurrentP(p)
  2139. else
  2140. RemoveCurrentP(p, hp1); // hp1 is guaranteed to be the immediate next instruction in this case.
  2141. RemoveInstruction(hp2);
  2142. end;
  2143. end
  2144. else if (hp1.typ = ait_instruction) and
  2145. (((taicpu(p).opcode=A_MOVAPS) and
  2146. ((taicpu(hp1).opcode=A_ADDSS) or (taicpu(hp1).opcode=A_SUBSS) or
  2147. (taicpu(hp1).opcode=A_MULSS) or (taicpu(hp1).opcode=A_DIVSS))) or
  2148. ((taicpu(p).opcode=A_MOVAPD) and
  2149. ((taicpu(hp1).opcode=A_ADDSD) or (taicpu(hp1).opcode=A_SUBSD) or
  2150. (taicpu(hp1).opcode=A_MULSD) or (taicpu(hp1).opcode=A_DIVSD)))
  2151. ) and
  2152. GetNextInstructionUsingReg(hp1, hp2, taicpu(hp1).oper[1]^.reg) and
  2153. MatchInstruction(hp2,taicpu(p).opcode,[]) and
  2154. OpsEqual(taicpu(hp2).oper[1]^, taicpu(p).oper[0]^) and
  2155. MatchOpType(taicpu(hp2),top_reg,top_reg) and
  2156. MatchOperand(taicpu(hp2).oper[0]^,taicpu(p).oper[1]^) then
  2157. { change
  2158. movapX reg,reg2
  2159. addsX/subsX/... reg3, reg2
  2160. movapX reg2,reg
  2161. to
  2162. addsX/subsX/... reg3,reg
  2163. }
  2164. begin
  2165. TransferUsedRegs(TmpUsedRegs);
  2166. UpdateUsedRegsBetween(TmpUsedRegs, p, hp2);
  2167. If not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs)) then
  2168. begin
  2169. DebugMsg(SPeepholeOptimization + 'MovapXOpMovapX2Op ('+
  2170. debug_op2str(taicpu(p).opcode)+' '+
  2171. debug_op2str(taicpu(hp1).opcode)+' '+
  2172. debug_op2str(taicpu(hp2).opcode)+') done',p);
  2173. { we cannot eliminate the first move if
  2174. the operations uses the same register for source and dest }
  2175. if not(OpsEqual(taicpu(hp1).oper[1]^,taicpu(hp1).oper[0]^)) then
  2176. { Remember that hp1 is not necessarily the immediate
  2177. next instruction }
  2178. RemoveCurrentP(p);
  2179. taicpu(hp1).loadoper(1, taicpu(hp2).oper[1]^);
  2180. RemoveInstruction(hp2);
  2181. result:=true;
  2182. end;
  2183. end
  2184. else if (hp1.typ = ait_instruction) and
  2185. (((taicpu(p).opcode=A_VMOVAPD) and
  2186. (taicpu(hp1).opcode=A_VCOMISD)) or
  2187. ((taicpu(p).opcode=A_VMOVAPS) and
  2188. ((taicpu(hp1).opcode=A_VCOMISS))
  2189. )
  2190. ) and not(OpsEqual(taicpu(hp1).oper[1]^,taicpu(hp1).oper[0]^)) then
  2191. { change
  2192. movapX reg,reg1
  2193. vcomisX reg1,reg1
  2194. to
  2195. vcomisX reg,reg
  2196. }
  2197. begin
  2198. TransferUsedRegs(TmpUsedRegs);
  2199. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2200. If not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  2201. begin
  2202. DebugMsg(SPeepholeOptimization + 'MovapXComisX2ComisX2 ('+
  2203. debug_op2str(taicpu(p).opcode)+' '+
  2204. debug_op2str(taicpu(hp1).opcode)+') done',p);
  2205. if OpsEqual(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) then
  2206. taicpu(hp1).loadoper(0, taicpu(p).oper[0]^);
  2207. if OpsEqual(taicpu(p).oper[1]^,taicpu(hp1).oper[1]^) then
  2208. taicpu(hp1).loadoper(1, taicpu(p).oper[0]^);
  2209. RemoveCurrentP(p);
  2210. result:=true;
  2211. exit;
  2212. end;
  2213. end
  2214. end;
  2215. end;
  2216. end;
  2217. function TX86AsmOptimizer.OptPass1VOP(var p : tai) : boolean;
  2218. var
  2219. hp1 : tai;
  2220. begin
  2221. result:=false;
  2222. { replace
  2223. V<Op>X %mreg1,%mreg2,%mreg3
  2224. VMovX %mreg3,%mreg4
  2225. dealloc %mreg3
  2226. by
  2227. V<Op>X %mreg1,%mreg2,%mreg4
  2228. ?
  2229. }
  2230. if GetNextInstruction(p,hp1) and
  2231. { we mix single and double operations here because we assume that the compiler
  2232. generates vmovapd only after double operations and vmovaps only after single operations }
  2233. MatchInstruction(hp1,A_VMOVAPD,A_VMOVAPS,[S_NO]) and
  2234. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  2235. (taicpu(hp1).oper[1]^.typ=top_reg) then
  2236. begin
  2237. TransferUsedRegs(TmpUsedRegs);
  2238. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2239. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  2240. begin
  2241. taicpu(p).loadoper(2,taicpu(hp1).oper[1]^);
  2242. DebugMsg(SPeepholeOptimization + 'VOpVmov2VOp done',p);
  2243. RemoveInstruction(hp1);
  2244. result:=true;
  2245. end;
  2246. end;
  2247. end;
  2248. { Replaces all references to AOldReg in a memory reference to ANewReg }
  2249. class function TX86AsmOptimizer.ReplaceRegisterInRef(var ref: TReference; const AOldReg, ANewReg: TRegister): Boolean;
  2250. begin
  2251. Result := False;
  2252. { For safety reasons, only check for exact register matches }
  2253. { Check base register }
  2254. if (ref.base = AOldReg) then
  2255. begin
  2256. ref.base := ANewReg;
  2257. Result := True;
  2258. end;
  2259. { Check index register }
  2260. if (ref.index = AOldReg) then
  2261. begin
  2262. ref.index := ANewReg;
  2263. Result := True;
  2264. end;
  2265. end;
  2266. { Replaces all references to AOldReg in an operand to ANewReg }
  2267. class function TX86AsmOptimizer.ReplaceRegisterInOper(const p: taicpu; const OperIdx: Integer; const AOldReg, ANewReg: TRegister): Boolean;
  2268. var
  2269. OldSupReg, NewSupReg: TSuperRegister;
  2270. OldSubReg, NewSubReg: TSubRegister;
  2271. OldRegType: TRegisterType;
  2272. ThisOper: POper;
  2273. begin
  2274. ThisOper := p.oper[OperIdx]; { Faster to access overall }
  2275. Result := False;
  2276. if (AOldReg = NR_NO) or (ANewReg = NR_NO) then
  2277. InternalError(2020011801);
  2278. OldSupReg := getsupreg(AOldReg);
  2279. OldSubReg := getsubreg(AOldReg);
  2280. OldRegType := getregtype(AOldReg);
  2281. NewSupReg := getsupreg(ANewReg);
  2282. NewSubReg := getsubreg(ANewReg);
  2283. if OldRegType <> getregtype(ANewReg) then
  2284. InternalError(2020011802);
  2285. if OldSubReg <> NewSubReg then
  2286. InternalError(2020011803);
  2287. case ThisOper^.typ of
  2288. top_reg:
  2289. if (
  2290. (ThisOper^.reg = AOldReg) or
  2291. (
  2292. (OldRegType = R_INTREGISTER) and
  2293. (getsupreg(ThisOper^.reg) = OldSupReg) and
  2294. (getregtype(ThisOper^.reg) = R_INTREGISTER) and
  2295. (
  2296. (getsubreg(ThisOper^.reg) <= OldSubReg)
  2297. {$ifndef x86_64}
  2298. and (
  2299. { Under i386 and i8086, ESI, EDI, EBP and ESP
  2300. don't have an 8-bit representation }
  2301. (getsubreg(ThisOper^.reg) >= R_SUBW) or
  2302. not (NewSupReg in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  2303. )
  2304. {$endif x86_64}
  2305. )
  2306. )
  2307. ) then
  2308. begin
  2309. ThisOper^.reg := newreg(getregtype(ANewReg), NewSupReg, getsubreg(p.oper[OperIdx]^.reg));
  2310. Result := True;
  2311. end;
  2312. top_ref:
  2313. if ReplaceRegisterInRef(ThisOper^.ref^, AOldReg, ANewReg) then
  2314. Result := True;
  2315. else
  2316. ;
  2317. end;
  2318. end;
  2319. { Replaces all references to AOldReg in an instruction to ANewReg }
  2320. class function TX86AsmOptimizer.ReplaceRegisterInInstruction(const p: taicpu; const AOldReg, ANewReg: TRegister): Boolean;
  2321. const
  2322. ReadFlag: array[0..3] of TInsChange = (Ch_Rop1, Ch_Rop2, Ch_Rop3, Ch_Rop4);
  2323. var
  2324. OperIdx: Integer;
  2325. begin
  2326. Result := False;
  2327. for OperIdx := 0 to p.ops - 1 do
  2328. if (ReadFlag[OperIdx] in InsProp[p.Opcode].Ch) then
  2329. begin
  2330. { The shift and rotate instructions can only use CL }
  2331. if not (
  2332. (OperIdx = 0) and
  2333. { This second condition just helps to avoid unnecessarily
  2334. calling MatchInstruction for 10 different opcodes }
  2335. (p.oper[0]^.reg = NR_CL) and
  2336. MatchInstruction(p, [A_RCL, A_RCR, A_ROL, A_ROR, A_SAL, A_SAR, A_SHL, A_SHLD, A_SHR, A_SHRD], [])
  2337. ) then
  2338. Result := ReplaceRegisterInOper(p, OperIdx, AOldReg, ANewReg) or Result;
  2339. end
  2340. else if p.oper[OperIdx]^.typ = top_ref then
  2341. { It's okay to replace registers in references that get written to }
  2342. Result := ReplaceRegisterInOper(p, OperIdx, AOldReg, ANewReg) or Result;
  2343. end;
  2344. class function TX86AsmOptimizer.IsRefSafe(const ref: PReference): Boolean;
  2345. begin
  2346. Result :=
  2347. (ref^.index = NR_NO) and
  2348. (
  2349. {$ifdef x86_64}
  2350. (
  2351. (ref^.base = NR_RIP) and
  2352. (ref^.refaddr in [addr_pic, addr_pic_no_got])
  2353. ) or
  2354. {$endif x86_64}
  2355. (ref^.refaddr = addr_full) or
  2356. (ref^.base = NR_STACK_POINTER_REG) or
  2357. (ref^.base = current_procinfo.framepointer)
  2358. );
  2359. end;
  2360. function TX86AsmOptimizer.ConvertLEA(const p: taicpu): Boolean;
  2361. var
  2362. l: asizeint;
  2363. begin
  2364. Result := False;
  2365. { Should have been checked previously }
  2366. if p.opcode <> A_LEA then
  2367. InternalError(2020072501);
  2368. { do not mess with the stack point as adjusting it by lea is recommend, except if we optimize for size }
  2369. if (p.oper[1]^.reg=NR_STACK_POINTER_REG) and
  2370. not(cs_opt_size in current_settings.optimizerswitches) then
  2371. exit;
  2372. with p.oper[0]^.ref^ do
  2373. begin
  2374. if (base <> p.oper[1]^.reg) or
  2375. (index <> NR_NO) or
  2376. assigned(symbol) then
  2377. exit;
  2378. l:=offset;
  2379. if (l=1) and UseIncDec then
  2380. begin
  2381. p.opcode:=A_INC;
  2382. p.loadreg(0,p.oper[1]^.reg);
  2383. p.ops:=1;
  2384. DebugMsg(SPeepholeOptimization + 'Lea2Inc done',p);
  2385. end
  2386. else if (l=-1) and UseIncDec then
  2387. begin
  2388. p.opcode:=A_DEC;
  2389. p.loadreg(0,p.oper[1]^.reg);
  2390. p.ops:=1;
  2391. DebugMsg(SPeepholeOptimization + 'Lea2Dec done',p);
  2392. end
  2393. else
  2394. begin
  2395. if (l<0) and (l<>-2147483648) then
  2396. begin
  2397. p.opcode:=A_SUB;
  2398. p.loadConst(0,-l);
  2399. DebugMsg(SPeepholeOptimization + 'Lea2Sub done',p);
  2400. end
  2401. else
  2402. begin
  2403. p.opcode:=A_ADD;
  2404. p.loadConst(0,l);
  2405. DebugMsg(SPeepholeOptimization + 'Lea2Add done',p);
  2406. end;
  2407. end;
  2408. end;
  2409. Result := True;
  2410. end;
  2411. function TX86AsmOptimizer.DeepMOVOpt(const p_mov: taicpu; const hp: taicpu): Boolean;
  2412. var
  2413. CurrentReg, ReplaceReg: TRegister;
  2414. begin
  2415. Result := False;
  2416. ReplaceReg := taicpu(p_mov).oper[0]^.reg;
  2417. CurrentReg := taicpu(p_mov).oper[1]^.reg;
  2418. case hp.opcode of
  2419. A_FSTSW, A_FNSTSW,
  2420. A_IN, A_INS, A_OUT, A_OUTS,
  2421. A_CMPS, A_LODS, A_MOVS, A_SCAS, A_STOS:
  2422. { These routines have explicit operands, but they are restricted in
  2423. what they can be (e.g. IN and OUT can only read from AL, AX or
  2424. EAX. }
  2425. Exit;
  2426. A_IMUL:
  2427. begin
  2428. { The 1-operand version writes to implicit registers
  2429. The 2-operand version reads from the first operator, and reads
  2430. from and writes to the second (equivalent to Ch_ROp1, ChRWOp2).
  2431. the 3-operand version reads from a register that it doesn't write to
  2432. }
  2433. case hp.ops of
  2434. 1:
  2435. if (
  2436. (
  2437. (hp.opsize = S_B) and (getsupreg(CurrentReg) <> RS_EAX)
  2438. ) or
  2439. not (getsupreg(CurrentReg) in [RS_EAX, RS_EDX])
  2440. ) and ReplaceRegisterInOper(hp, 0, CurrentReg, ReplaceReg) then
  2441. begin
  2442. Result := True;
  2443. DebugMsg(SPeepholeOptimization + debug_regname(CurrentReg) + ' = ' + debug_regname(ReplaceReg) + '; changed to minimise pipeline stall (MovIMul2MovIMul 1)', hp);
  2444. AllocRegBetween(ReplaceReg, p_mov, hp, UsedRegs);
  2445. end;
  2446. 2:
  2447. { Only modify the first parameter }
  2448. if ReplaceRegisterInOper(hp, 0, CurrentReg, ReplaceReg) then
  2449. begin
  2450. Result := True;
  2451. DebugMsg(SPeepholeOptimization + debug_regname(CurrentReg) + ' = ' + debug_regname(ReplaceReg) + '; changed to minimise pipeline stall (MovIMul2MovIMul 2)', hp);
  2452. AllocRegBetween(ReplaceReg, p_mov, hp, UsedRegs);
  2453. end;
  2454. 3:
  2455. { Only modify the second parameter }
  2456. if ReplaceRegisterInOper(hp, 1, CurrentReg, ReplaceReg) then
  2457. begin
  2458. Result := True;
  2459. DebugMsg(SPeepholeOptimization + debug_regname(CurrentReg) + ' = ' + debug_regname(ReplaceReg) + '; changed to minimise pipeline stall (MovIMul2MovIMul 3)', hp);
  2460. AllocRegBetween(ReplaceReg, p_mov, hp, UsedRegs);
  2461. end;
  2462. else
  2463. InternalError(2020012901);
  2464. end;
  2465. end;
  2466. else
  2467. if (hp.ops > 0) and
  2468. ReplaceRegisterInInstruction(hp, CurrentReg, ReplaceReg) then
  2469. begin
  2470. Result := True;
  2471. DebugMsg(SPeepholeOptimization + debug_regname(CurrentReg) + ' = ' + debug_regname(ReplaceReg) + '; changed to minimise pipeline stall (MovXXX2MovXXX)', hp);
  2472. AllocRegBetween(ReplaceReg, p_mov, hp, UsedRegs);
  2473. end;
  2474. end;
  2475. end;
  2476. function TX86AsmOptimizer.FuncMov2Func(var p: tai; const hp1: tai): Boolean;
  2477. var
  2478. hp2: tai;
  2479. p_SourceReg, p_TargetReg: TRegister;
  2480. begin
  2481. Result := False;
  2482. { Backward optimisation. If we have:
  2483. func. %reg1,%reg2
  2484. mov %reg2,%reg3
  2485. (dealloc %reg2)
  2486. Change to:
  2487. func. %reg1,%reg3 (see comment below for what a valid func. is)
  2488. Perform similar optimisations with 1, 3 and 4-operand instructions
  2489. that only have one output.
  2490. }
  2491. if MatchOpType(taicpu(p), top_reg, top_reg) then
  2492. begin
  2493. p_SourceReg := taicpu(p).oper[0]^.reg;
  2494. p_TargetReg := taicpu(p).oper[1]^.reg;
  2495. TransferUsedRegs(TmpUsedRegs);
  2496. if not RegUsedAfterInstruction(p_SourceReg, p, TmpUsedRegs) and
  2497. GetLastInstruction(p, hp2) and
  2498. (hp2.typ = ait_instruction) and
  2499. { Have to make sure it's an instruction that only reads from
  2500. the first operands and only writes (not reads or modifies) to
  2501. the last one; in essence, a pure function such as BSR, POPCNT
  2502. or ANDN }
  2503. (
  2504. (
  2505. (taicpu(hp2).ops = 1) and
  2506. (insprop[taicpu(hp2).opcode].Ch * [Ch_Wop1] = [Ch_Wop1])
  2507. ) or
  2508. (
  2509. (taicpu(hp2).ops = 2) and
  2510. (insprop[taicpu(hp2).opcode].Ch * [Ch_Rop1, Ch_Wop2] = [Ch_Rop1, Ch_Wop2])
  2511. ) or
  2512. (
  2513. (taicpu(hp2).ops = 3) and
  2514. (insprop[taicpu(hp2).opcode].Ch * [Ch_Rop1, Ch_Rop2, Ch_Wop3] = [Ch_Rop1, Ch_Rop2, Ch_Wop3])
  2515. ) or
  2516. (
  2517. (taicpu(hp2).ops = 4) and
  2518. (insprop[taicpu(hp2).opcode].Ch * [Ch_Rop1, Ch_Rop2, Ch_Rop3, Ch_Wop4] = [Ch_Rop1, Ch_Rop2, Ch_Rop3, Ch_Wop4])
  2519. )
  2520. ) and
  2521. (taicpu(hp2).oper[taicpu(hp2).ops-1]^.typ = top_reg) and
  2522. (taicpu(hp2).oper[taicpu(hp2).ops-1]^.reg = p_SourceReg) then
  2523. begin
  2524. case taicpu(hp2).opcode of
  2525. A_FSTSW, A_FNSTSW,
  2526. A_IN, A_INS, A_OUT, A_OUTS,
  2527. A_CMPS, A_LODS, A_MOVS, A_SCAS, A_STOS:
  2528. { These routines have explicit operands, but they are restricted in
  2529. what they can be (e.g. IN and OUT can only read from AL, AX or
  2530. EAX. }
  2531. ;
  2532. else
  2533. begin
  2534. DebugMsg(SPeepholeOptimization + 'Removed MOV and changed destination on previous instruction to optimise register usage (FuncMov2Func)', p);
  2535. taicpu(hp2).oper[taicpu(hp2).ops-1]^.reg := p_TargetReg;
  2536. if not RegInInstruction(p_TargetReg, hp2) then
  2537. begin
  2538. { Since we're allocating from an earlier point, we
  2539. need to remove the register from the tracking }
  2540. ExcludeRegFromUsedRegs(p_TargetReg, TmpUsedRegs);
  2541. AllocRegBetween(p_TargetReg, hp2, p, TmpUsedRegs);
  2542. end;
  2543. RemoveCurrentp(p, hp1);
  2544. { If the Func was another MOV instruction, we might get
  2545. "mov %reg,%reg" that doesn't get removed in Pass 2
  2546. otherwise, so deal with it here (also do something
  2547. similar with lea (%reg),%reg}
  2548. if (taicpu(hp2).opcode = A_MOV) and MatchOperand(taicpu(hp2).oper[0]^, taicpu(hp2).oper[1]^.reg) then
  2549. begin
  2550. DebugMsg(SPeepholeOptimization + 'Mov2Nop 1a done', hp2);
  2551. if p = hp2 then
  2552. RemoveCurrentp(p)
  2553. else
  2554. RemoveInstruction(hp2);
  2555. end;
  2556. Result := True;
  2557. Exit;
  2558. end;
  2559. end;
  2560. end;
  2561. end;
  2562. end;
  2563. function TX86AsmOptimizer.OptPass1MOV(var p : tai) : boolean;
  2564. var
  2565. hp1, hp2, hp3: tai;
  2566. DoOptimisation, TempBool: Boolean;
  2567. {$ifdef x86_64}
  2568. NewConst: TCGInt;
  2569. {$endif x86_64}
  2570. procedure convert_mov_value(signed_movop: tasmop; max_value: tcgint); inline;
  2571. begin
  2572. if taicpu(hp1).opcode = signed_movop then
  2573. begin
  2574. if taicpu(p).oper[0]^.val > max_value shr 1 then
  2575. taicpu(p).oper[0]^.val:=taicpu(p).oper[0]^.val - max_value - 1 { Convert to signed }
  2576. end
  2577. else
  2578. taicpu(p).oper[0]^.val:=taicpu(p).oper[0]^.val and max_value; { Trim to unsigned }
  2579. end;
  2580. function TryConstMerge(var p1, p2: tai): Boolean;
  2581. var
  2582. ThisRef: TReference;
  2583. begin
  2584. Result := False;
  2585. ThisRef := taicpu(p2).oper[1]^.ref^;
  2586. { Only permit writes to the stack, since we can guarantee alignment with that }
  2587. if (ThisRef.index = NR_NO) and
  2588. (
  2589. (ThisRef.base = NR_STACK_POINTER_REG) or
  2590. (ThisRef.base = current_procinfo.framepointer)
  2591. ) then
  2592. begin
  2593. case taicpu(p).opsize of
  2594. S_B:
  2595. begin
  2596. { Word writes must be on a 2-byte boundary }
  2597. if (taicpu(p1).oper[1]^.ref^.offset mod 2) = 0 then
  2598. begin
  2599. { Reduce offset of second reference to see if it is sequential with the first }
  2600. Dec(ThisRef.offset, 1);
  2601. if RefsEqual(taicpu(p1).oper[1]^.ref^, ThisRef) then
  2602. begin
  2603. { Make sure the constants aren't represented as a
  2604. negative number, as these won't merge properly }
  2605. taicpu(p1).opsize := S_W;
  2606. taicpu(p1).oper[0]^.val := (taicpu(p1).oper[0]^.val and $FF) or ((taicpu(p2).oper[0]^.val and $FF) shl 8);
  2607. DebugMsg(SPeepholeOptimization + 'Merged two byte-sized constant writes to stack (MovMov2Mov 2a)', p1);
  2608. RemoveInstruction(p2);
  2609. Result := True;
  2610. end;
  2611. end;
  2612. end;
  2613. S_W:
  2614. begin
  2615. { Longword writes must be on a 4-byte boundary }
  2616. if (taicpu(p1).oper[1]^.ref^.offset mod 4) = 0 then
  2617. begin
  2618. { Reduce offset of second reference to see if it is sequential with the first }
  2619. Dec(ThisRef.offset, 2);
  2620. if RefsEqual(taicpu(p1).oper[1]^.ref^, ThisRef) then
  2621. begin
  2622. { Make sure the constants aren't represented as a
  2623. negative number, as these won't merge properly }
  2624. taicpu(p1).opsize := S_L;
  2625. taicpu(p1).oper[0]^.val := (taicpu(p1).oper[0]^.val and $FFFF) or ((taicpu(p2).oper[0]^.val and $FFFF) shl 16);
  2626. DebugMsg(SPeepholeOptimization + 'Merged two word-sized constant writes to stack (MovMov2Mov 2b)', p1);
  2627. RemoveInstruction(p2);
  2628. Result := True;
  2629. end;
  2630. end;
  2631. end;
  2632. {$ifdef x86_64}
  2633. S_L:
  2634. begin
  2635. { Only sign-extended 32-bit constants can be written to 64-bit memory directly, so check to
  2636. see if the constants can be encoded this way. }
  2637. NewConst := (taicpu(p1).oper[0]^.val and $FFFFFFFF) or (taicpu(p2).oper[0]^.val shl 32);
  2638. if (NewConst >= -2147483648) and (NewConst <= 2147483647) and
  2639. { Quadword writes must be on an 8-byte boundary }
  2640. ((taicpu(p1).oper[1]^.ref^.offset mod 8) = 0) then
  2641. begin
  2642. { Reduce offset of second reference to see if it is sequential with the first }
  2643. Dec(ThisRef.offset, 4);
  2644. if RefsEqual(taicpu(p1).oper[1]^.ref^, ThisRef) then
  2645. begin
  2646. { Make sure the constants aren't represented as a
  2647. negative number, as these won't merge properly }
  2648. taicpu(p1).opsize := S_Q;
  2649. { Force a typecast into a 32-bit signed integer (that will then be sign-extended to 64-bit) }
  2650. taicpu(p1).oper[0]^.val := NewConst;
  2651. DebugMsg(SPeepholeOptimization + 'Merged two longword-sized constant writes to stack (MovMov2Mov 2c)', p1);
  2652. RemoveInstruction(p2);
  2653. Result := True;
  2654. end;
  2655. end;
  2656. end;
  2657. {$endif x86_64}
  2658. else
  2659. ;
  2660. end;
  2661. end;
  2662. end;
  2663. var
  2664. GetNextInstruction_p, TempRegUsed, CrossJump: Boolean;
  2665. PreMessage, RegName1, RegName2, InputVal, MaskNum: string;
  2666. NewSize: topsize; NewOffset: asizeint;
  2667. p_SourceReg, p_TargetReg, NewMMReg: TRegister;
  2668. SourceRef, TargetRef: TReference;
  2669. MovAligned, MovUnaligned: TAsmOp;
  2670. ThisRef: TReference;
  2671. JumpTracking: TLinkedList;
  2672. begin
  2673. Result:=false;
  2674. GetNextInstruction_p:=GetNextInstruction(p, hp1);
  2675. { remove mov reg1,reg1? }
  2676. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^)
  2677. then
  2678. begin
  2679. DebugMsg(SPeepholeOptimization + 'Mov2Nop 1 done',p);
  2680. { take care of the register (de)allocs following p }
  2681. RemoveCurrentP(p, hp1);
  2682. Result:=true;
  2683. exit;
  2684. end;
  2685. { All the next optimisations require a next instruction }
  2686. if not GetNextInstruction_p or (hp1.typ <> ait_instruction) then
  2687. Exit;
  2688. { Prevent compiler warnings }
  2689. p_TargetReg := NR_NO;
  2690. if taicpu(p).oper[1]^.typ = top_reg then
  2691. begin
  2692. { Saves on a large number of dereferences }
  2693. p_TargetReg := taicpu(p).oper[1]^.reg;
  2694. { Look for:
  2695. mov %reg1,%reg2
  2696. ??? %reg2,r/m
  2697. Change to:
  2698. mov %reg1,%reg2
  2699. ??? %reg1,r/m
  2700. }
  2701. if taicpu(p).oper[0]^.typ = top_reg then
  2702. begin
  2703. if RegReadByInstruction(p_TargetReg, hp1) and
  2704. DeepMOVOpt(taicpu(p), taicpu(hp1)) then
  2705. begin
  2706. { A change has occurred, just not in p }
  2707. Result := True;
  2708. TransferUsedRegs(TmpUsedRegs);
  2709. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  2710. if not RegUsedAfterInstruction(p_TargetReg, hp1, TmpUsedRegs) and
  2711. { Just in case something didn't get modified (e.g. an
  2712. implicit register) }
  2713. not RegReadByInstruction(p_TargetReg, hp1) then
  2714. begin
  2715. { We can remove the original MOV }
  2716. DebugMsg(SPeepholeOptimization + 'Mov2Nop 3 done',p);
  2717. RemoveCurrentp(p, hp1);
  2718. { UsedRegs got updated by RemoveCurrentp }
  2719. Result := True;
  2720. Exit;
  2721. end;
  2722. { If we know a MOV instruction has become a null operation, we might as well
  2723. get rid of it now to save time. }
  2724. if (taicpu(hp1).opcode = A_MOV) and
  2725. (taicpu(hp1).oper[1]^.typ = top_reg) and
  2726. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[0]^.reg) and
  2727. { Just being a register is enough to confirm it's a null operation }
  2728. (taicpu(hp1).oper[0]^.typ = top_reg) then
  2729. begin
  2730. Result := True;
  2731. { Speed-up to reduce a pipeline stall... if we had something like...
  2732. movl %eax,%edx
  2733. movw %dx,%ax
  2734. ... the second instruction would change to movw %ax,%ax, but
  2735. given that it is now %ax that's active rather than %eax,
  2736. penalties might occur due to a partial register write, so instead,
  2737. change it to a MOVZX instruction when optimising for speed.
  2738. }
  2739. if not (cs_opt_size in current_settings.optimizerswitches) and
  2740. IsMOVZXAcceptable and
  2741. (taicpu(hp1).opsize < taicpu(p).opsize)
  2742. {$ifdef x86_64}
  2743. { operations already implicitly set the upper 64 bits to zero }
  2744. and not ((taicpu(hp1).opsize = S_L) and (taicpu(p).opsize = S_Q))
  2745. {$endif x86_64}
  2746. then
  2747. begin
  2748. DebugMsg(SPeepholeOptimization + 'Zero-extension to minimise pipeline stall (Mov2Movz)',hp1);
  2749. case taicpu(p).opsize of
  2750. S_W:
  2751. if taicpu(hp1).opsize = S_B then
  2752. taicpu(hp1).opsize := S_BL
  2753. else
  2754. InternalError(2020012911);
  2755. S_L{$ifdef x86_64}, S_Q{$endif x86_64}:
  2756. case taicpu(hp1).opsize of
  2757. S_B:
  2758. taicpu(hp1).opsize := S_BL;
  2759. S_W:
  2760. taicpu(hp1).opsize := S_WL;
  2761. else
  2762. InternalError(2020012912);
  2763. end;
  2764. else
  2765. InternalError(2020012910);
  2766. end;
  2767. taicpu(hp1).opcode := A_MOVZX;
  2768. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  2769. end
  2770. else
  2771. begin
  2772. GetNextInstruction_p := GetNextInstruction(hp1, hp2);
  2773. DebugMsg(SPeepholeOptimization + 'Mov2Nop 4 done',hp1);
  2774. RemoveInstruction(hp1);
  2775. { The instruction after what was hp1 is now the immediate next instruction,
  2776. so we can continue to make optimisations if it's present }
  2777. if not GetNextInstruction_p or (hp2.typ <> ait_instruction) then
  2778. Exit;
  2779. hp1 := hp2;
  2780. end;
  2781. end;
  2782. end;
  2783. end;
  2784. end;
  2785. { Depending on the DeepMOVOpt above, it may turn out that hp1 completely
  2786. overwrites the original destination register. e.g.
  2787. movl ###,%reg2d
  2788. movslq ###,%reg2q (### doesn't have to be the same as the first one)
  2789. In this case, we can remove the MOV (Go to "Mov2Nop 5" below)
  2790. }
  2791. if (taicpu(p).oper[1]^.typ = top_reg) and
  2792. MatchInstruction(hp1, [A_LEA, A_MOV, A_MOVSX, A_MOVZX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}], []) and
  2793. (taicpu(hp1).oper[1]^.typ = top_reg) and
  2794. Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[1]^.reg) then
  2795. begin
  2796. if RegInOp(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^) then
  2797. begin
  2798. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  2799. case taicpu(p).oper[0]^.typ of
  2800. top_const:
  2801. { We have something like:
  2802. movb $x, %regb
  2803. movzbl %regb,%regd
  2804. Change to:
  2805. movl $x, %regd
  2806. }
  2807. begin
  2808. case taicpu(hp1).opsize of
  2809. S_BW:
  2810. begin
  2811. convert_mov_value(A_MOVSX, $FF);
  2812. setsubreg(taicpu(p).oper[1]^.reg, R_SUBW);
  2813. taicpu(p).opsize := S_W;
  2814. end;
  2815. S_BL:
  2816. begin
  2817. convert_mov_value(A_MOVSX, $FF);
  2818. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  2819. taicpu(p).opsize := S_L;
  2820. end;
  2821. S_WL:
  2822. begin
  2823. convert_mov_value(A_MOVSX, $FFFF);
  2824. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  2825. taicpu(p).opsize := S_L;
  2826. end;
  2827. {$ifdef x86_64}
  2828. S_BQ:
  2829. begin
  2830. convert_mov_value(A_MOVSX, $FF);
  2831. setsubreg(taicpu(p).oper[1]^.reg, R_SUBQ);
  2832. taicpu(p).opsize := S_Q;
  2833. end;
  2834. S_WQ:
  2835. begin
  2836. convert_mov_value(A_MOVSX, $FFFF);
  2837. setsubreg(taicpu(p).oper[1]^.reg, R_SUBQ);
  2838. taicpu(p).opsize := S_Q;
  2839. end;
  2840. S_LQ:
  2841. begin
  2842. convert_mov_value(A_MOVSXD, $FFFFFFFF); { Note it's MOVSXD, not MOVSX }
  2843. setsubreg(taicpu(p).oper[1]^.reg, R_SUBQ);
  2844. taicpu(p).opsize := S_Q;
  2845. end;
  2846. {$endif x86_64}
  2847. else
  2848. { If hp1 was a MOV instruction, it should have been
  2849. optimised already }
  2850. InternalError(2020021001);
  2851. end;
  2852. DebugMsg(SPeepholeOptimization + 'MovMovXX2MovXX 2 done',p);
  2853. RemoveInstruction(hp1);
  2854. Result := True;
  2855. Exit;
  2856. end;
  2857. top_ref:
  2858. begin
  2859. { We have something like:
  2860. movb mem, %regb
  2861. movzbl %regb,%regd
  2862. Change to:
  2863. movzbl mem, %regd
  2864. }
  2865. ThisRef := taicpu(p).oper[0]^.ref^;
  2866. if (ThisRef.refaddr<>addr_full) and (IsMOVZXAcceptable or (taicpu(hp1).opcode<>A_MOVZX)) then
  2867. begin
  2868. DebugMsg(SPeepholeOptimization + 'MovMovXX2MovXX 1 done',p);
  2869. taicpu(hp1).loadref(0, ThisRef);
  2870. { Make sure any registers in the references are properly tracked }
  2871. if (ThisRef.base <> NR_NO){$ifdef x86_64} and (ThisRef.base <> NR_RIP){$endif x86_64} then
  2872. AllocRegBetween(ThisRef.base, p, hp1, UsedRegs);
  2873. if (ThisRef.index <> NR_NO) then
  2874. AllocRegBetween(ThisRef.index, p, hp1, UsedRegs);
  2875. RemoveCurrentP(p, hp1);
  2876. Result := True;
  2877. Exit;
  2878. end;
  2879. end;
  2880. else
  2881. if (taicpu(hp1).opcode <> A_MOV) and (taicpu(hp1).opcode <> A_LEA) then
  2882. { Just to make a saving, since there are no more optimisations with MOVZX and MOVSX/D }
  2883. Exit;
  2884. end;
  2885. end
  2886. { The RegInOp check makes sure that movl r/m,%reg1l; movzbl (%reg1l),%reg1l"
  2887. and "movl r/m,%reg1; leal $1(%reg1,%reg2),%reg1" etc. are not incorrectly
  2888. optimised }
  2889. else
  2890. begin
  2891. DebugMsg(SPeepholeOptimization + 'Mov2Nop 5 done',p);
  2892. RemoveCurrentP(p, hp1);
  2893. Result := True;
  2894. Exit;
  2895. end;
  2896. end;
  2897. if (taicpu(hp1).opcode = A_AND) and
  2898. (taicpu(p).oper[1]^.typ = top_reg) and
  2899. MatchOpType(taicpu(hp1),top_const,top_reg) then
  2900. begin
  2901. if MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[1]^) then
  2902. begin
  2903. case taicpu(p).opsize of
  2904. S_L:
  2905. if (taicpu(hp1).oper[0]^.val = $ffffffff) then
  2906. begin
  2907. { Optimize out:
  2908. mov x, %reg
  2909. and ffffffffh, %reg
  2910. }
  2911. DebugMsg(SPeepholeOptimization + 'MovAnd2Mov 1 done',p);
  2912. RemoveInstruction(hp1);
  2913. Result:=true;
  2914. exit;
  2915. end;
  2916. S_Q: { TODO: Confirm if this is even possible }
  2917. if (taicpu(hp1).oper[0]^.val = $ffffffffffffffff) then
  2918. begin
  2919. { Optimize out:
  2920. mov x, %reg
  2921. and ffffffffffffffffh, %reg
  2922. }
  2923. DebugMsg(SPeepholeOptimization + 'MovAnd2Mov 2 done',p);
  2924. RemoveInstruction(hp1);
  2925. Result:=true;
  2926. exit;
  2927. end;
  2928. else
  2929. ;
  2930. end;
  2931. if (
  2932. (taicpu(p).oper[0]^.typ=top_reg) or
  2933. (
  2934. (taicpu(p).oper[0]^.typ=top_ref) and
  2935. (taicpu(p).oper[0]^.ref^.refaddr<>addr_full)
  2936. )
  2937. ) and
  2938. GetNextInstruction(hp1,hp2) and
  2939. MatchInstruction(hp2,A_TEST,[]) and
  2940. (
  2941. MatchOperand(taicpu(hp1).oper[1]^,taicpu(hp2).oper[1]^) or
  2942. (
  2943. { If the register being tested is smaller than the one
  2944. that received a bitwise AND, permit it if the constant
  2945. fits into the smaller size }
  2946. (taicpu(hp1).oper[1]^.typ = top_reg) and (taicpu(hp2).oper[1]^.typ = top_reg) and
  2947. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg,taicpu(hp2).oper[1]^.reg) and
  2948. (taicpu(hp1).oper[0]^.typ = top_const) and (taicpu(hp1).oper[0]^.val >= 0) and
  2949. (GetSubReg(taicpu(hp2).oper[1]^.reg) < GetSubReg(taicpu(hp1).oper[1]^.reg)) and
  2950. (
  2951. (
  2952. (GetSubReg(taicpu(hp2).oper[1]^.reg) = R_SUBL) and
  2953. (taicpu(hp1).oper[0]^.val <= $FF)
  2954. ) or
  2955. (
  2956. (GetSubReg(taicpu(hp2).oper[1]^.reg) = R_SUBW) and
  2957. (taicpu(hp1).oper[0]^.val <= $FFFF)
  2958. {$ifdef x86_64}
  2959. ) or
  2960. (
  2961. (GetSubReg(taicpu(hp2).oper[1]^.reg) = R_SUBD) and
  2962. (taicpu(hp1).oper[0]^.val <= $FFFFFFFF)
  2963. {$endif x86_64}
  2964. )
  2965. )
  2966. )
  2967. ) and
  2968. (
  2969. MatchOperand(taicpu(hp2).oper[0]^,taicpu(hp2).oper[1]^) or
  2970. MatchOperand(taicpu(hp2).oper[0]^,-1)
  2971. ) and
  2972. GetNextInstruction(hp2,hp3) and
  2973. MatchInstruction(hp3,A_Jcc,A_Setcc,[]) and
  2974. (taicpu(hp3).condition in [C_E,C_NE]) then
  2975. begin
  2976. TransferUsedRegs(TmpUsedRegs);
  2977. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  2978. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  2979. if not(RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp2, TmpUsedRegs)) then
  2980. begin
  2981. DebugMsg(SPeepholeOptimization + 'MovAndTest2Test done',p);
  2982. taicpu(hp1).loadoper(1,taicpu(p).oper[0]^);
  2983. taicpu(hp1).opcode:=A_TEST;
  2984. { Shrink the TEST instruction down to the smallest possible size }
  2985. case taicpu(hp1).oper[0]^.val of
  2986. 0..255:
  2987. if (taicpu(hp1).opsize <> S_B)
  2988. {$ifndef x86_64}
  2989. and (
  2990. (taicpu(hp1).oper[1]^.typ <> top_reg) or
  2991. { Cannot encode byte-sized ESI, EDI, EBP or ESP under i386 }
  2992. (GetSupReg(taicpu(hp1).oper[1]^.reg) in [RS_EAX, RS_EBX, RS_ECX, RS_EDX])
  2993. )
  2994. {$endif x86_64}
  2995. then
  2996. begin
  2997. if taicpu(hp1).opsize <> taicpu(hp2).opsize then
  2998. { Only print debug message if the TEST instruction
  2999. is a different size before and after }
  3000. DebugMsg(SPeepholeOptimization + 'test' + debug_opsize2str(taicpu(hp1).opsize) + ' -> testb to reduce instruction size (Test2Test 1a)' , p);
  3001. taicpu(hp1).opsize := S_B;
  3002. if (taicpu(hp1).oper[1]^.typ = top_reg) then
  3003. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBL);
  3004. end;
  3005. 256..65535:
  3006. if (taicpu(hp1).opsize <> S_W) then
  3007. begin
  3008. if taicpu(hp1).opsize <> taicpu(hp2).opsize then
  3009. { Only print debug message if the TEST instruction
  3010. is a different size before and after }
  3011. DebugMsg(SPeepholeOptimization + 'test' + debug_opsize2str(taicpu(hp1).opsize) + ' -> testw to reduce instruction size (Test2Test 1b)' , p);
  3012. taicpu(hp1).opsize := S_W;
  3013. if (taicpu(hp1).oper[1]^.typ = top_reg) then
  3014. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBW);
  3015. end;
  3016. {$ifdef x86_64}
  3017. 65536..$7FFFFFFF:
  3018. if (taicpu(hp1).opsize <> S_L) then
  3019. begin
  3020. if taicpu(hp1).opsize <> taicpu(hp2).opsize then
  3021. { Only print debug message if the TEST instruction
  3022. is a different size before and after }
  3023. DebugMsg(SPeepholeOptimization + 'test' + debug_opsize2str(taicpu(hp1).opsize) + ' -> testl to reduce instruction size (Test2Test 1c)' , p);
  3024. taicpu(hp1).opsize := S_L;
  3025. if (taicpu(hp1).oper[1]^.typ = top_reg) then
  3026. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  3027. end;
  3028. {$endif x86_64}
  3029. else
  3030. ;
  3031. end;
  3032. RemoveInstruction(hp2);
  3033. RemoveCurrentP(p, hp1);
  3034. Result:=true;
  3035. exit;
  3036. end;
  3037. end;
  3038. end
  3039. else if IsMOVZXAcceptable and
  3040. (taicpu(p).oper[1]^.typ = top_reg) and (taicpu(hp1).oper[1]^.typ = top_reg) and
  3041. (taicpu(p).oper[0]^.typ <> top_const) and { MOVZX only supports registers and memory, not immediates (use MOV for that!) }
  3042. (getsupreg(taicpu(p).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg))
  3043. then
  3044. begin
  3045. InputVal := debug_operstr(taicpu(p).oper[0]^);
  3046. MaskNum := debug_tostr(taicpu(hp1).oper[0]^.val);
  3047. case taicpu(p).opsize of
  3048. S_B:
  3049. if (taicpu(hp1).oper[0]^.val = $ff) then
  3050. begin
  3051. { Convert:
  3052. movb x, %regl movb x, %regl
  3053. andw ffh, %regw andl ffh, %regd
  3054. To:
  3055. movzbw x, %regd movzbl x, %regd
  3056. (Identical registers, just different sizes)
  3057. }
  3058. RegName1 := debug_regname(taicpu(p).oper[1]^.reg); { 8-bit register name }
  3059. RegName2 := debug_regname(taicpu(hp1).oper[1]^.reg); { 16/32-bit register name }
  3060. case taicpu(hp1).opsize of
  3061. S_W: NewSize := S_BW;
  3062. S_L: NewSize := S_BL;
  3063. {$ifdef x86_64}
  3064. S_Q: NewSize := S_BQ;
  3065. {$endif x86_64}
  3066. else
  3067. InternalError(2018011510);
  3068. end;
  3069. end
  3070. else
  3071. NewSize := S_NO;
  3072. S_W:
  3073. if (taicpu(hp1).oper[0]^.val = $ffff) then
  3074. begin
  3075. { Convert:
  3076. movw x, %regw
  3077. andl ffffh, %regd
  3078. To:
  3079. movzwl x, %regd
  3080. (Identical registers, just different sizes)
  3081. }
  3082. RegName1 := debug_regname(taicpu(p).oper[1]^.reg); { 16-bit register name }
  3083. RegName2 := debug_regname(taicpu(hp1).oper[1]^.reg); { 32-bit register name }
  3084. case taicpu(hp1).opsize of
  3085. S_L: NewSize := S_WL;
  3086. {$ifdef x86_64}
  3087. S_Q: NewSize := S_WQ;
  3088. {$endif x86_64}
  3089. else
  3090. InternalError(2018011511);
  3091. end;
  3092. end
  3093. else
  3094. NewSize := S_NO;
  3095. else
  3096. NewSize := S_NO;
  3097. end;
  3098. if NewSize <> S_NO then
  3099. begin
  3100. PreMessage := 'mov' + debug_opsize2str(taicpu(p).opsize) + ' ' + InputVal + ',' + RegName1;
  3101. { The actual optimization }
  3102. taicpu(p).opcode := A_MOVZX;
  3103. taicpu(p).changeopsize(NewSize);
  3104. taicpu(p).oper[1]^ := taicpu(hp1).oper[1]^;
  3105. { Safeguard if "and" is followed by a conditional command }
  3106. TransferUsedRegs(TmpUsedRegs);
  3107. UpdateUsedRegs(TmpUsedRegs,tai(p.next));
  3108. if (RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)) then
  3109. begin
  3110. { At this point, the "and" command is effectively equivalent to
  3111. "test %reg,%reg". This will be handled separately by the
  3112. Peephole Optimizer. [Kit] }
  3113. DebugMsg(SPeepholeOptimization + PreMessage +
  3114. ' -> movz' + debug_opsize2str(NewSize) + ' ' + InputVal + ',' + RegName2, p);
  3115. end
  3116. else
  3117. begin
  3118. DebugMsg(SPeepholeOptimization + PreMessage + '; and' + debug_opsize2str(taicpu(hp1).opsize) + ' $' + MaskNum + ',' + RegName2 +
  3119. ' -> movz' + debug_opsize2str(NewSize) + ' ' + InputVal + ',' + RegName2, p);
  3120. RemoveInstruction(hp1);
  3121. end;
  3122. Result := True;
  3123. Exit;
  3124. end;
  3125. end;
  3126. end;
  3127. if (taicpu(hp1).opcode = A_OR) and
  3128. (taicpu(p).oper[1]^.typ = top_reg) and
  3129. MatchOperand(taicpu(p).oper[0]^, 0) and
  3130. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) then
  3131. begin
  3132. { mov 0, %reg
  3133. or ###,%reg
  3134. Change to (only if the flags are not used):
  3135. mov ###,%reg
  3136. }
  3137. TransferUsedRegs(TmpUsedRegs);
  3138. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3139. DoOptimisation := True;
  3140. { Even if the flags are used, we might be able to do the optimisation
  3141. if the conditions are predictable }
  3142. if RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  3143. begin
  3144. { Only perform if ### = %reg (the same register) or equal to 0,
  3145. so %reg is guaranteed to still have a value of zero }
  3146. if MatchOperand(taicpu(hp1).oper[0]^, 0) or
  3147. MatchOperand(taicpu(hp1).oper[0]^, taicpu(hp1).oper[1]^.reg) then
  3148. begin
  3149. hp2 := hp1;
  3150. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  3151. while RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) and
  3152. GetNextInstruction(hp2, hp3) do
  3153. begin
  3154. { Don't continue modifying if the flags state is getting changed }
  3155. if RegModifiedByInstruction(NR_DEFAULTFLAGS, hp3) then
  3156. Break;
  3157. UpdateUsedRegs(TmpUsedRegs, tai(hp3.Next));
  3158. if MatchInstruction(hp3, A_Jcc, A_SETcc, A_CMOVcc, []) then
  3159. begin
  3160. if condition_in(C_E, taicpu(hp3).condition) or (taicpu(hp3).condition in [C_NC, C_NS, C_NO]) then
  3161. begin
  3162. { Condition is always true }
  3163. case taicpu(hp3).opcode of
  3164. A_Jcc:
  3165. begin
  3166. DebugMsg(SPeepholeOptimization + 'Condition is always true (jump made unconditional)', hp3);
  3167. { Check for jump shortcuts before we destroy the condition }
  3168. DoJumpOptimizations(hp3, TempBool);
  3169. MakeUnconditional(taicpu(hp3));
  3170. Result := True;
  3171. end;
  3172. A_CMOVcc:
  3173. begin
  3174. DebugMsg(SPeepholeOptimization + 'Condition is always true (CMOVcc -> MOV)', hp3);
  3175. taicpu(hp3).opcode := A_MOV;
  3176. taicpu(hp3).condition := C_None;
  3177. Result := True;
  3178. end;
  3179. A_SETcc:
  3180. begin
  3181. DebugMsg(SPeepholeOptimization + 'Condition is always true (changed to MOV 1)', hp3);
  3182. { Convert "set(c) %reg" instruction to "movb 1,%reg" }
  3183. taicpu(hp3).opcode := A_MOV;
  3184. taicpu(hp3).ops := 2;
  3185. taicpu(hp3).condition := C_None;
  3186. taicpu(hp3).opsize := S_B;
  3187. taicpu(hp3).loadreg(1,taicpu(hp3).oper[0]^.reg);
  3188. taicpu(hp3).loadconst(0, 1);
  3189. Result := True;
  3190. end;
  3191. else
  3192. InternalError(2021090701);
  3193. end;
  3194. end
  3195. else if (taicpu(hp3).condition in [C_A, C_B, C_C, C_G, C_L, C_NE, C_NZ, C_O, C_S]) then
  3196. begin
  3197. { Condition is always false }
  3198. case taicpu(hp3).opcode of
  3199. A_Jcc:
  3200. begin
  3201. DebugMsg(SPeepholeOptimization + 'Condition is always false (jump removed)', hp3);
  3202. TAsmLabel(taicpu(hp3).oper[0]^.ref^.symbol).decrefs;
  3203. RemoveInstruction(hp3);
  3204. Result := True;
  3205. { Since hp3 was deleted, hp2 must not be updated }
  3206. Continue;
  3207. end;
  3208. A_CMOVcc:
  3209. begin
  3210. DebugMsg(SPeepholeOptimization + 'Condition is always false (conditional load removed)', hp3);
  3211. RemoveInstruction(hp3);
  3212. Result := True;
  3213. { Since hp3 was deleted, hp2 must not be updated }
  3214. Continue;
  3215. end;
  3216. A_SETcc:
  3217. begin
  3218. DebugMsg(SPeepholeOptimization + 'Condition is always false (changed to MOV 0)', hp3);
  3219. { Convert "set(c) %reg" instruction to "movb 0,%reg" }
  3220. taicpu(hp3).opcode := A_MOV;
  3221. taicpu(hp3).ops := 2;
  3222. taicpu(hp3).condition := C_None;
  3223. taicpu(hp3).opsize := S_B;
  3224. taicpu(hp3).loadreg(1,taicpu(hp3).oper[0]^.reg);
  3225. taicpu(hp3).loadconst(0, 0);
  3226. Result := True;
  3227. end;
  3228. else
  3229. InternalError(2021090702);
  3230. end;
  3231. end
  3232. else
  3233. { Uncertain what to do - don't optimise (although optimise other conditional statements if present) }
  3234. DoOptimisation := False;
  3235. end;
  3236. hp2 := hp3;
  3237. end;
  3238. { Flags are still in use - don't optimise }
  3239. if DoOptimisation and RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  3240. DoOptimisation := False;
  3241. end
  3242. else
  3243. DoOptimisation := False;
  3244. end;
  3245. if DoOptimisation then
  3246. begin
  3247. {$ifdef x86_64}
  3248. { OR only supports 32-bit sign-extended constants for 64-bit
  3249. instructions, so compensate for this if the constant is
  3250. encoded as a value greater than or equal to 2^31 }
  3251. if (taicpu(hp1).opsize = S_Q) and
  3252. (taicpu(hp1).oper[0]^.typ = top_const) and
  3253. (taicpu(hp1).oper[0]^.val >= $80000000) then
  3254. taicpu(hp1).oper[0]^.val := taicpu(hp1).oper[0]^.val or $FFFFFFFF00000000;
  3255. {$endif x86_64}
  3256. DebugMsg(SPeepholeOptimization + 'MOV 0 / OR -> MOV', p);
  3257. taicpu(hp1).opcode := A_MOV;
  3258. RemoveCurrentP(p, hp1);
  3259. Result := True;
  3260. Exit;
  3261. end;
  3262. end;
  3263. { Next instruction is also a MOV ? }
  3264. if MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) then
  3265. begin
  3266. if MatchOpType(taicpu(p), top_const, top_ref) and
  3267. MatchOpType(taicpu(hp1), top_const, top_ref) and
  3268. TryConstMerge(p, hp1) then
  3269. begin
  3270. Result := True;
  3271. { In case we have four byte writes in a row, check for 2 more
  3272. right now so we don't have to wait for another iteration of
  3273. pass 1
  3274. }
  3275. { If two byte-writes were merged, the opsize is now S_W, not S_B }
  3276. case taicpu(p).opsize of
  3277. S_W:
  3278. begin
  3279. if GetNextInstruction(p, hp1) and
  3280. MatchInstruction(hp1, A_MOV, [S_B]) and
  3281. MatchOpType(taicpu(hp1), top_const, top_ref) and
  3282. GetNextInstruction(hp1, hp2) and
  3283. MatchInstruction(hp2, A_MOV, [S_B]) and
  3284. MatchOpType(taicpu(hp2), top_const, top_ref) and
  3285. { Try to merge the two bytes }
  3286. TryConstMerge(hp1, hp2) then
  3287. { Now try to merge the two words (hp2 will get deleted) }
  3288. TryConstMerge(p, hp1);
  3289. end;
  3290. S_L:
  3291. begin
  3292. { Though this only really benefits x86_64 and not i386, it
  3293. gets a potential optimisation done faster and hence
  3294. reduces the number of times OptPass1MOV is entered }
  3295. if GetNextInstruction(p, hp1) and
  3296. MatchInstruction(hp1, A_MOV, [S_W]) and
  3297. MatchOpType(taicpu(hp1), top_const, top_ref) and
  3298. GetNextInstruction(hp1, hp2) and
  3299. MatchInstruction(hp2, A_MOV, [S_W]) and
  3300. MatchOpType(taicpu(hp2), top_const, top_ref) and
  3301. { Try to merge the two words }
  3302. TryConstMerge(hp1, hp2) then
  3303. { This will always fail on i386, so don't bother
  3304. calling it unless we're doing x86_64 }
  3305. {$ifdef x86_64}
  3306. { Now try to merge the two longwords (hp2 will get deleted) }
  3307. TryConstMerge(p, hp1)
  3308. {$endif x86_64}
  3309. ;
  3310. end;
  3311. else
  3312. ;
  3313. end;
  3314. Exit;
  3315. end;
  3316. if (taicpu(p).oper[1]^.typ = top_reg) and
  3317. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) then
  3318. begin
  3319. { Remember that p_TargetReg contains taicpu(p).oper[1]^.reg }
  3320. TransferUsedRegs(TmpUsedRegs);
  3321. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3322. { we have
  3323. mov x, %treg
  3324. mov %treg, y
  3325. }
  3326. if not(RegInOp(p_TargetReg, taicpu(hp1).oper[1]^)) then
  3327. if not(RegUsedAfterInstruction(p_TargetReg, hp1, TmpUsedRegs)) then
  3328. { we've got
  3329. mov x, %treg
  3330. mov %treg, y
  3331. with %treg is not used after }
  3332. case taicpu(p).oper[0]^.typ Of
  3333. { top_reg is covered by DeepMOVOpt }
  3334. top_const:
  3335. begin
  3336. { change
  3337. mov const, %treg
  3338. mov %treg, y
  3339. to
  3340. mov const, y
  3341. }
  3342. if (taicpu(hp1).oper[1]^.typ=top_reg) or
  3343. ((taicpu(p).oper[0]^.val>=low(longint)) and (taicpu(p).oper[0]^.val<=high(longint))) then
  3344. begin
  3345. if taicpu(hp1).oper[1]^.typ=top_reg then
  3346. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,usedregs);
  3347. taicpu(p).loadOper(1,taicpu(hp1).oper[1]^);
  3348. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 5 done',p);
  3349. RemoveInstruction(hp1);
  3350. Result:=true;
  3351. Exit;
  3352. end;
  3353. end;
  3354. top_ref:
  3355. case taicpu(hp1).oper[1]^.typ of
  3356. top_reg:
  3357. begin
  3358. { change
  3359. mov mem, %treg
  3360. mov %treg, %reg
  3361. to
  3362. mov mem, %reg"
  3363. }
  3364. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,usedregs);
  3365. taicpu(p).loadreg(1, taicpu(hp1).oper[1]^.reg);
  3366. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 3 done',p);
  3367. RemoveInstruction(hp1);
  3368. Result:=true;
  3369. Exit;
  3370. end;
  3371. top_ref:
  3372. begin
  3373. {$ifdef x86_64}
  3374. { Look for the following to simplify:
  3375. mov x(mem1), %reg
  3376. mov %reg, y(mem2)
  3377. mov x+8(mem1), %reg
  3378. mov %reg, y+8(mem2)
  3379. Change to:
  3380. movdqu x(mem1), %xmmreg
  3381. movdqu %xmmreg, y(mem2)
  3382. ...but only as long as the memory blocks don't overlap
  3383. }
  3384. SourceRef := taicpu(p).oper[0]^.ref^;
  3385. TargetRef := taicpu(hp1).oper[1]^.ref^;
  3386. if (taicpu(p).opsize = S_Q) and
  3387. GetNextInstruction(hp1, hp2) and
  3388. MatchInstruction(hp2, A_MOV, [taicpu(p).opsize]) and
  3389. MatchOpType(taicpu(hp2), top_ref, top_reg) then
  3390. begin
  3391. { Delay calling GetNextInstruction(hp2, hp3) for as long as possible }
  3392. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  3393. Inc(SourceRef.offset, 8);
  3394. if UseAVX then
  3395. begin
  3396. MovAligned := A_VMOVDQA;
  3397. MovUnaligned := A_VMOVDQU;
  3398. end
  3399. else
  3400. begin
  3401. MovAligned := A_MOVDQA;
  3402. MovUnaligned := A_MOVDQU;
  3403. end;
  3404. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) and
  3405. not RefsMightOverlap(taicpu(p).oper[0]^.ref^, TargetRef, 16) then
  3406. begin
  3407. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  3408. Inc(TargetRef.offset, 8);
  3409. if GetNextInstruction(hp2, hp3) and
  3410. MatchInstruction(hp3, A_MOV, [taicpu(p).opsize]) and
  3411. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  3412. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  3413. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  3414. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  3415. begin
  3416. NewMMReg := GetMMRegisterBetween(R_SUBMMX, UsedRegs, p, hp3);
  3417. if NewMMReg <> NR_NO then
  3418. begin
  3419. { Remember that the offsets are 8 ahead }
  3420. if ((SourceRef.offset mod 16) = 8) and
  3421. (
  3422. { Base pointer is always aligned (stack pointer won't be if there's no stack frame) }
  3423. (SourceRef.base = current_procinfo.framepointer) or
  3424. ((SourceRef.alignment >= 16) and ((SourceRef.alignment mod 16) = 0))
  3425. ) then
  3426. taicpu(p).opcode := MovAligned
  3427. else
  3428. taicpu(p).opcode := MovUnaligned;
  3429. taicpu(p).opsize := S_XMM;
  3430. taicpu(p).oper[1]^.reg := NewMMReg;
  3431. if ((TargetRef.offset mod 16) = 8) and
  3432. (
  3433. { Base pointer is always aligned (stack pointer won't be if there's no stack frame) }
  3434. (TargetRef.base = current_procinfo.framepointer) or
  3435. ((TargetRef.alignment >= 16) and ((TargetRef.alignment mod 16) = 0))
  3436. ) then
  3437. taicpu(hp1).opcode := MovAligned
  3438. else
  3439. taicpu(hp1).opcode := MovUnaligned;
  3440. taicpu(hp1).opsize := S_XMM;
  3441. taicpu(hp1).oper[0]^.reg := NewMMReg;
  3442. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(NewMMReg) + ' to merge a pair of memory moves (MovMovMovMov2MovdqMovdq 1)', p);
  3443. RemoveInstruction(hp2);
  3444. RemoveInstruction(hp3);
  3445. Result := True;
  3446. Exit;
  3447. end;
  3448. end;
  3449. end
  3450. else
  3451. begin
  3452. { See if the next references are 8 less rather than 8 greater }
  3453. Dec(SourceRef.offset, 16); { -8 the other way }
  3454. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) then
  3455. begin
  3456. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  3457. Dec(TargetRef.offset, 8); { Only 8, not 16, as it wasn't incremented unlike SourceRef }
  3458. if not RefsMightOverlap(SourceRef, TargetRef, 16) and
  3459. GetNextInstruction(hp2, hp3) and
  3460. MatchInstruction(hp3, A_MOV, [taicpu(p).opsize]) and
  3461. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  3462. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  3463. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  3464. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  3465. begin
  3466. NewMMReg := GetMMRegisterBetween(R_SUBMMX, UsedRegs, p, hp3);
  3467. if NewMMReg <> NR_NO then
  3468. begin
  3469. { hp2 and hp3 are the starting offsets, so mod = 0 this time }
  3470. if ((SourceRef.offset mod 16) = 0) and
  3471. (
  3472. { Base pointer is always aligned (stack pointer won't be if there's no stack frame) }
  3473. (SourceRef.base = current_procinfo.framepointer) or
  3474. ((SourceRef.alignment >= 16) and ((SourceRef.alignment mod 16) = 0))
  3475. ) then
  3476. taicpu(hp2).opcode := MovAligned
  3477. else
  3478. taicpu(hp2).opcode := MovUnaligned;
  3479. taicpu(hp2).opsize := S_XMM;
  3480. taicpu(hp2).oper[1]^.reg := NewMMReg;
  3481. if ((TargetRef.offset mod 16) = 0) and
  3482. (
  3483. { Base pointer is always aligned (stack pointer won't be if there's no stack frame) }
  3484. (TargetRef.base = current_procinfo.framepointer) or
  3485. ((TargetRef.alignment >= 16) and ((TargetRef.alignment mod 16) = 0))
  3486. ) then
  3487. taicpu(hp3).opcode := MovAligned
  3488. else
  3489. taicpu(hp3).opcode := MovUnaligned;
  3490. taicpu(hp3).opsize := S_XMM;
  3491. taicpu(hp3).oper[0]^.reg := NewMMReg;
  3492. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(NewMMReg) + ' to merge a pair of memory moves (MovMovMovMov2MovdqMovdq 2)', p);
  3493. RemoveInstruction(hp1);
  3494. RemoveCurrentP(p, hp2);
  3495. Result := True;
  3496. Exit;
  3497. end;
  3498. end;
  3499. end;
  3500. end;
  3501. end;
  3502. {$endif x86_64}
  3503. end;
  3504. else
  3505. { The write target should be a reg or a ref }
  3506. InternalError(2021091601);
  3507. end;
  3508. else
  3509. ;
  3510. end
  3511. else
  3512. { %treg is used afterwards, but all eventualities
  3513. other than the first MOV instruction being a constant
  3514. are covered by DeepMOVOpt, so only check for that }
  3515. if (taicpu(p).oper[0]^.typ = top_const) and
  3516. (
  3517. { For MOV operations, a size saving is only made if the register/const is byte-sized }
  3518. not (cs_opt_size in current_settings.optimizerswitches) or
  3519. (taicpu(hp1).opsize = S_B)
  3520. ) and
  3521. (
  3522. (taicpu(hp1).oper[1]^.typ = top_reg) or
  3523. ((taicpu(p).oper[0]^.val >= low(longint)) and (taicpu(p).oper[0]^.val <= high(longint)))
  3524. ) then
  3525. begin
  3526. DebugMsg(SPeepholeOptimization + debug_operstr(taicpu(hp1).oper[0]^) + ' = $' + debug_tostr(taicpu(p).oper[0]^.val) + '; changed to minimise pipeline stall (MovMov2Mov 6b)',hp1);
  3527. taicpu(hp1).loadconst(0, taicpu(p).oper[0]^.val);
  3528. end;
  3529. end;
  3530. if (taicpu(hp1).oper[0]^.typ = taicpu(p).oper[1]^.typ) and
  3531. (taicpu(hp1).oper[1]^.typ = taicpu(p).oper[0]^.typ) then
  3532. { mov reg1, mem1 or mov mem1, reg1
  3533. mov mem2, reg2 mov reg2, mem2}
  3534. begin
  3535. if OpsEqual(taicpu(hp1).oper[1]^,taicpu(p).oper[0]^) then
  3536. { mov reg1, mem1 or mov mem1, reg1
  3537. mov mem2, reg1 mov reg2, mem1}
  3538. begin
  3539. if OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  3540. { Removes the second statement from
  3541. mov reg1, mem1/reg2
  3542. mov mem1/reg2, reg1 }
  3543. begin
  3544. if taicpu(p).oper[0]^.typ=top_reg then
  3545. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,usedregs);
  3546. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 1',p);
  3547. RemoveInstruction(hp1);
  3548. Result:=true;
  3549. exit;
  3550. end
  3551. else
  3552. begin
  3553. TransferUsedRegs(TmpUsedRegs);
  3554. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  3555. if (taicpu(p).oper[1]^.typ = top_ref) and
  3556. { mov reg1, mem1
  3557. mov mem2, reg1 }
  3558. (taicpu(hp1).oper[0]^.ref^.refaddr = addr_no) and
  3559. GetNextInstruction(hp1, hp2) and
  3560. MatchInstruction(hp2,A_CMP,[taicpu(p).opsize]) and
  3561. OpsEqual(taicpu(p).oper[1]^,taicpu(hp2).oper[0]^) and
  3562. OpsEqual(taicpu(p).oper[0]^,taicpu(hp2).oper[1]^) and
  3563. not(RegUsedAfterInstruction(taicpu(p).oper[0]^.reg, hp2, TmpUsedRegs)) then
  3564. { change to
  3565. mov reg1, mem1 mov reg1, mem1
  3566. mov mem2, reg1 cmp reg1, mem2
  3567. cmp mem1, reg1
  3568. }
  3569. begin
  3570. RemoveInstruction(hp2);
  3571. taicpu(hp1).opcode := A_CMP;
  3572. taicpu(hp1).loadref(1,taicpu(hp1).oper[0]^.ref^);
  3573. taicpu(hp1).loadreg(0,taicpu(p).oper[0]^.reg);
  3574. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,UsedRegs);
  3575. DebugMsg(SPeepholeOptimization + 'MovMovCmp2MovCmp done',hp1);
  3576. end;
  3577. end;
  3578. end
  3579. else if (taicpu(p).oper[1]^.typ=top_ref) and
  3580. OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  3581. begin
  3582. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,UsedRegs);
  3583. taicpu(hp1).loadreg(0,taicpu(p).oper[0]^.reg);
  3584. DebugMsg(SPeepholeOptimization + 'MovMov2MovMov1 done',p);
  3585. end
  3586. else
  3587. begin
  3588. TransferUsedRegs(TmpUsedRegs);
  3589. if GetNextInstruction(hp1, hp2) and
  3590. MatchOpType(taicpu(p),top_ref,top_reg) and
  3591. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  3592. (taicpu(hp1).oper[1]^.typ = top_ref) and
  3593. MatchInstruction(hp2,A_MOV,[taicpu(p).opsize]) and
  3594. MatchOpType(taicpu(hp2),top_ref,top_reg) and
  3595. RefsEqual(taicpu(hp2).oper[0]^.ref^, taicpu(hp1).oper[1]^.ref^) then
  3596. if not RegInRef(taicpu(hp2).oper[1]^.reg,taicpu(hp2).oper[0]^.ref^) and
  3597. not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,tmpUsedRegs)) then
  3598. { mov mem1, %reg1
  3599. mov %reg1, mem2
  3600. mov mem2, reg2
  3601. to:
  3602. mov mem1, reg2
  3603. mov reg2, mem2}
  3604. begin
  3605. AllocRegBetween(taicpu(hp2).oper[1]^.reg,p,hp2,usedregs);
  3606. DebugMsg(SPeepholeOptimization + 'MovMovMov2MovMov 1 done',p);
  3607. taicpu(p).loadoper(1,taicpu(hp2).oper[1]^);
  3608. taicpu(hp1).loadoper(0,taicpu(hp2).oper[1]^);
  3609. RemoveInstruction(hp2);
  3610. Result := True;
  3611. end
  3612. {$ifdef i386}
  3613. { this is enabled for i386 only, as the rules to create the reg sets below
  3614. are too complicated for x86-64, so this makes this code too error prone
  3615. on x86-64
  3616. }
  3617. else if (taicpu(p).oper[1]^.reg <> taicpu(hp2).oper[1]^.reg) and
  3618. not(RegInRef(taicpu(p).oper[1]^.reg,taicpu(p).oper[0]^.ref^)) and
  3619. not(RegInRef(taicpu(hp2).oper[1]^.reg,taicpu(hp2).oper[0]^.ref^)) then
  3620. { mov mem1, reg1 mov mem1, reg1
  3621. mov reg1, mem2 mov reg1, mem2
  3622. mov mem2, reg2 mov mem2, reg1
  3623. to: to:
  3624. mov mem1, reg1 mov mem1, reg1
  3625. mov mem1, reg2 mov reg1, mem2
  3626. mov reg1, mem2
  3627. or (if mem1 depends on reg1
  3628. and/or if mem2 depends on reg2)
  3629. to:
  3630. mov mem1, reg1
  3631. mov reg1, mem2
  3632. mov reg1, reg2
  3633. }
  3634. begin
  3635. taicpu(hp1).loadRef(0,taicpu(p).oper[0]^.ref^);
  3636. taicpu(hp1).loadReg(1,taicpu(hp2).oper[1]^.reg);
  3637. taicpu(hp2).loadRef(1,taicpu(hp2).oper[0]^.ref^);
  3638. taicpu(hp2).loadReg(0,taicpu(p).oper[1]^.reg);
  3639. AllocRegBetween(taicpu(p).oper[1]^.reg,p,hp2,usedregs);
  3640. if (taicpu(p).oper[0]^.ref^.base <> NR_NO) and
  3641. (getsupreg(taicpu(p).oper[0]^.ref^.base) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX,RS_ESI,RS_EDI]) then
  3642. AllocRegBetween(taicpu(p).oper[0]^.ref^.base,p,hp2,usedregs);
  3643. if (taicpu(p).oper[0]^.ref^.index <> NR_NO) and
  3644. (getsupreg(taicpu(p).oper[0]^.ref^.index) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX,RS_ESI,RS_EDI]) then
  3645. AllocRegBetween(taicpu(p).oper[0]^.ref^.index,p,hp2,usedregs);
  3646. end
  3647. else if (taicpu(hp1).Oper[0]^.reg <> taicpu(hp2).Oper[1]^.reg) then
  3648. begin
  3649. taicpu(hp2).loadReg(0,taicpu(hp1).Oper[0]^.reg);
  3650. AllocRegBetween(taicpu(p).oper[1]^.reg,p,hp2,usedregs);
  3651. end
  3652. else
  3653. begin
  3654. RemoveInstruction(hp2);
  3655. end
  3656. {$endif i386}
  3657. ;
  3658. end;
  3659. end
  3660. { movl [mem1],reg1
  3661. movl [mem1],reg2
  3662. to
  3663. movl [mem1],reg1
  3664. movl reg1,reg2
  3665. }
  3666. else if MatchOpType(taicpu(p),top_ref,top_reg) and
  3667. MatchOpType(taicpu(hp1),top_ref,top_reg) and
  3668. (taicpu(p).opsize = taicpu(hp1).opsize) and
  3669. RefsEqual(taicpu(p).oper[0]^.ref^,taicpu(hp1).oper[0]^.ref^) and
  3670. (taicpu(p).oper[0]^.ref^.volatility=[]) and
  3671. (taicpu(hp1).oper[0]^.ref^.volatility=[]) and
  3672. not(SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.ref^.base)) and
  3673. not(SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.ref^.index)) then
  3674. begin
  3675. DebugMsg(SPeepholeOptimization + 'MovMov2MovMov 2',p);
  3676. taicpu(hp1).loadReg(0,taicpu(p).oper[1]^.reg);
  3677. end;
  3678. { movl const1,[mem1]
  3679. movl [mem1],reg1
  3680. to
  3681. movl const1,reg1
  3682. movl reg1,[mem1]
  3683. }
  3684. if MatchOpType(Taicpu(p),top_const,top_ref) and
  3685. MatchOpType(Taicpu(hp1),top_ref,top_reg) and
  3686. (taicpu(p).opsize = taicpu(hp1).opsize) and
  3687. RefsEqual(taicpu(hp1).oper[0]^.ref^,taicpu(p).oper[1]^.ref^) and
  3688. not(RegInRef(taicpu(hp1).oper[1]^.reg,taicpu(hp1).oper[0]^.ref^)) then
  3689. begin
  3690. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,usedregs);
  3691. taicpu(hp1).loadReg(0,taicpu(hp1).oper[1]^.reg);
  3692. taicpu(hp1).loadRef(1,taicpu(p).oper[1]^.ref^);
  3693. taicpu(p).loadReg(1,taicpu(hp1).oper[0]^.reg);
  3694. taicpu(hp1).fileinfo := taicpu(p).fileinfo;
  3695. DebugMsg(SPeepholeOptimization + 'MovMov2MovMov 1',p);
  3696. Result:=true;
  3697. exit;
  3698. end;
  3699. { mov x,reg1; mov y,reg1 -> mov y,reg1 is handled by the Mov2Nop 5 optimisation }
  3700. { Change:
  3701. movl %reg1,%reg2
  3702. movl x(%reg1),%reg1 (If something other than %reg1 is written to, DeepMOVOpt would have caught it)
  3703. movl x(%reg2),%regX (%regX can be %reg2 or something else)
  3704. To:
  3705. movl %reg1,%reg2 (if %regX = %reg2, then remove this instruction)
  3706. movl x(%reg1),%reg1
  3707. movl %reg1,%regX
  3708. }
  3709. if MatchOpType(taicpu(p), top_reg, top_reg) then
  3710. begin
  3711. p_SourceReg := taicpu(p).oper[0]^.reg;
  3712. { Remember that p_TargetReg contains taicpu(p).oper[1]^.reg }
  3713. if (taicpu(hp1).oper[0]^.typ = top_ref) { The other operand will be a register } and
  3714. (taicpu(hp1).oper[1]^.reg = p_SourceReg) and
  3715. RegInRef(p_SourceReg, taicpu(hp1).oper[0]^.ref^) and
  3716. GetNextInstruction(hp1, hp2) and
  3717. MatchInstruction(hp2, A_MOV, [taicpu(p).opsize]) and
  3718. (taicpu(hp2).oper[0]^.typ = top_ref) { The other operand will be a register } then
  3719. begin
  3720. SourceRef := taicpu(hp2).oper[0]^.ref^;
  3721. if RegInRef(p_TargetReg, SourceRef) and
  3722. { If %reg1 also appears in the second reference, then it will
  3723. not refer to the same memory block as the first reference }
  3724. not RegInRef(p_SourceReg, SourceRef) then
  3725. begin
  3726. { Check to see if the references match if %reg2 is changed to %reg1 }
  3727. if SourceRef.base = p_TargetReg then
  3728. SourceRef.base := p_SourceReg;
  3729. if SourceRef.index = p_TargetReg then
  3730. SourceRef.index := p_SourceReg;
  3731. { RefsEqual also checks to ensure both references are non-volatile }
  3732. if RefsEqual(taicpu(hp1).oper[0]^.ref^, SourceRef) then
  3733. begin
  3734. taicpu(hp2).loadreg(0, p_SourceReg);
  3735. DebugMsg(SPeepholeOptimization + 'Optimised register duplication and memory read (MovMovMov2MovMovMov)', p);
  3736. Result := True;
  3737. if taicpu(hp2).oper[1]^.reg = p_TargetReg then
  3738. begin
  3739. DebugMsg(SPeepholeOptimization + 'Mov2Nop 5a done', p);
  3740. RemoveCurrentP(p, hp1);
  3741. Exit;
  3742. end
  3743. else
  3744. begin
  3745. { Check to see if %reg2 is no longer in use }
  3746. TransferUsedRegs(TmpUsedRegs);
  3747. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3748. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  3749. if not RegUsedAfterInstruction(p_TargetReg, hp2, TmpUsedRegs) then
  3750. begin
  3751. DebugMsg(SPeepholeOptimization + 'Mov2Nop 5b done', p);
  3752. RemoveCurrentP(p, hp1);
  3753. Exit;
  3754. end;
  3755. end;
  3756. { If we reach this point, p and hp1 weren't actually modified,
  3757. so we can do a bit more work on this pass }
  3758. end;
  3759. end;
  3760. end;
  3761. end;
  3762. end;
  3763. {$ifdef x86_64}
  3764. { Change:
  3765. movl %reg1l,%reg2l
  3766. movq %reg2q,%reg3q (%reg1 <> %reg3)
  3767. To:
  3768. movl %reg1l,%reg2l
  3769. movl %reg1l,%reg3l (Upper 32 bits of %reg3q will be zero)
  3770. If %reg1 = %reg3, convert to:
  3771. movl %reg1l,%reg2l
  3772. andl %reg1l,%reg1l
  3773. }
  3774. if (taicpu(p).opsize = S_L) and MatchInstruction(hp1,A_MOV,[S_Q]) and
  3775. MatchOpType(taicpu(p), top_reg, top_reg) and
  3776. MatchOpType(taicpu(hp1), top_reg, top_reg) and
  3777. SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^.reg) then
  3778. begin
  3779. TransferUsedRegs(TmpUsedRegs);
  3780. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3781. taicpu(hp1).opsize := S_L;
  3782. taicpu(hp1).loadreg(0, taicpu(p).oper[0]^.reg);
  3783. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  3784. AllocRegBetween(taicpu(p).oper[0]^.reg, p, hp1, UsedRegs);
  3785. if (taicpu(p).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) then
  3786. begin
  3787. { %reg1 = %reg3 }
  3788. DebugMsg(SPeepholeOptimization + 'Made 32-to-64-bit zero extension more efficient (MovlMovq2MovlAndl 1)', hp1);
  3789. taicpu(hp1).opcode := A_AND;
  3790. end
  3791. else
  3792. begin
  3793. { %reg1 <> %reg3 }
  3794. DebugMsg(SPeepholeOptimization + 'Made 32-to-64-bit zero extension more efficient (MovlMovq2MovlMovl 1)', hp1);
  3795. end;
  3796. if not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) then
  3797. begin
  3798. DebugMsg(SPeepholeOptimization + 'Mov2Nop 8 done', p);
  3799. RemoveCurrentP(p, hp1);
  3800. Result := True;
  3801. Exit;
  3802. end
  3803. else
  3804. begin
  3805. { Initial instruction wasn't actually changed }
  3806. Include(OptsToCheck, aoc_ForceNewIteration);
  3807. { if %reg1 = %reg3, don't do the long-distance lookahead that
  3808. appears below since %reg1 has technically changed }
  3809. if taicpu(hp1).opcode = A_AND then
  3810. Exit;
  3811. end;
  3812. end;
  3813. {$endif x86_64}
  3814. { search further than the next instruction for a mov (as long as it's not a jump) }
  3815. if not is_calljmpuncondret(taicpu(hp1).opcode) and
  3816. { check as much as possible before the expensive GetNextInstructionUsingRegCond call }
  3817. (taicpu(p).oper[1]^.typ = top_reg) and
  3818. (taicpu(p).oper[0]^.typ in [top_reg,top_const]) and
  3819. not RegModifiedByInstruction(taicpu(p).oper[1]^.reg, hp1) then
  3820. begin
  3821. { we work with hp2 here, so hp1 can be still used later on when
  3822. checking for GetNextInstruction_p }
  3823. hp3 := hp1;
  3824. { Initialise CrossJump (if it becomes True at any point, it will remain True) }
  3825. CrossJump := (taicpu(hp1).opcode = A_Jcc);
  3826. { Remember that p_TargetReg contains taicpu(p).oper[1]^.reg }
  3827. TransferUsedRegs(TmpUsedRegs);
  3828. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3829. if NotFirstIteration then
  3830. JumpTracking := TLinkedList.Create
  3831. else
  3832. JumpTracking := nil;
  3833. while GetNextInstructionUsingRegCond(hp3,hp2,p_TargetReg,JumpTracking,CrossJump) and
  3834. { GetNextInstructionUsingRegCond only searches one instruction ahead unless -O3 is specified }
  3835. (hp2.typ=ait_instruction) do
  3836. begin
  3837. case taicpu(hp2).opcode of
  3838. A_POP:
  3839. if MatchOperand(taicpu(hp2).oper[0]^,p_TargetReg) then
  3840. begin
  3841. if not CrossJump and
  3842. not RegUsedBetween(p_TargetReg, p, hp2) then
  3843. begin
  3844. { We can remove the original MOV since the register
  3845. wasn't used between it and its popping from the stack }
  3846. DebugMsg(SPeepholeOptimization + 'Mov2Nop 3c done',p);
  3847. RemoveCurrentp(p, hp1);
  3848. Result := True;
  3849. JumpTracking.Free;
  3850. Exit;
  3851. end;
  3852. { Can't go any further }
  3853. Break;
  3854. end;
  3855. A_MOV:
  3856. if MatchOperand(taicpu(hp2).oper[0]^,p_TargetReg) and
  3857. ((taicpu(p).oper[0]^.typ=top_const) or
  3858. ((taicpu(p).oper[0]^.typ=top_reg) and
  3859. not(RegModifiedBetween(taicpu(p).oper[0]^.reg, p, hp2))
  3860. )
  3861. ) then
  3862. begin
  3863. { we have
  3864. mov x, %treg
  3865. mov %treg, y
  3866. }
  3867. { We don't need to call UpdateUsedRegs for every instruction between
  3868. p and hp2 because the register we're concerned about will not
  3869. become deallocated (otherwise GetNextInstructionUsingReg would
  3870. have stopped at an earlier instruction). [Kit] }
  3871. TempRegUsed :=
  3872. CrossJump { Assume the register is in use if it crossed a conditional jump } or
  3873. RegReadByInstruction(p_TargetReg, hp3) or
  3874. RegUsedAfterInstruction(p_TargetReg, hp2, TmpUsedRegs);
  3875. case taicpu(p).oper[0]^.typ Of
  3876. top_reg:
  3877. begin
  3878. { change
  3879. mov %reg, %treg
  3880. mov %treg, y
  3881. to
  3882. mov %reg, y
  3883. }
  3884. p_SourceReg := taicpu(p).oper[0]^.reg; { Saves on a handful of pointer dereferences }
  3885. RegName1 := debug_regname(taicpu(hp2).oper[0]^.reg);
  3886. if MatchOperand(taicpu(hp2).oper[1]^, p_SourceReg) then
  3887. begin
  3888. { %reg = y - remove hp2 completely (doing it here instead of relying on
  3889. the "mov %reg,%reg" optimisation might cut down on a pass iteration) }
  3890. if TempRegUsed then
  3891. begin
  3892. DebugMsg(SPeepholeOptimization + debug_regname(p_SourceReg) + ' = ' + RegName1 + '; removed unnecessary instruction (MovMov2MovNop 6b}',hp2);
  3893. AllocRegBetween(p_SourceReg, p, hp2, UsedRegs);
  3894. { Set the start of the next GetNextInstructionUsingRegCond search
  3895. to start at the entry right before hp2 (which is about to be removed) }
  3896. hp3 := tai(hp2.Previous);
  3897. RemoveInstruction(hp2);
  3898. Include(OptsToCheck, aoc_ForceNewIteration);
  3899. { See if there's more we can optimise }
  3900. Continue;
  3901. end
  3902. else
  3903. begin
  3904. RemoveInstruction(hp2);
  3905. { We can remove the original MOV too }
  3906. DebugMsg(SPeepholeOptimization + 'MovMov2NopNop 6b done',p);
  3907. RemoveCurrentP(p, hp1);
  3908. Result:=true;
  3909. JumpTracking.Free;
  3910. Exit;
  3911. end;
  3912. end
  3913. else
  3914. begin
  3915. AllocRegBetween(p_SourceReg, p, hp2, UsedRegs);
  3916. taicpu(hp2).loadReg(0, p_SourceReg);
  3917. DebugMsg(SPeepholeOptimization + RegName1 + ' = ' + debug_regname(p_SourceReg) + '; changed to minimise pipeline stall (MovMov2Mov 6a}',hp2);
  3918. { Check to see if the register also appears in the reference }
  3919. if (taicpu(hp2).oper[1]^.typ = top_ref) then
  3920. ReplaceRegisterInRef(taicpu(hp2).oper[1]^.ref^, p_TargetReg, p_SourceReg);
  3921. { Don't remove the first instruction if the temporary register is in use }
  3922. if not TempRegUsed and
  3923. { ReplaceRegisterInRef won't actually replace the register if it's a different size }
  3924. not RegInOp(p_TargetReg, taicpu(hp2).oper[1]^) then
  3925. begin
  3926. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 6 done',p);
  3927. RemoveCurrentP(p, hp1);
  3928. Result:=true;
  3929. JumpTracking.Free;
  3930. Exit;
  3931. end;
  3932. { No need to set Result to True here. If there's another instruction later
  3933. on that can be optimised, it will be detected when the main Pass 1 loop
  3934. reaches what is now hp2 and passes it through OptPass1MOV. [Kit] }
  3935. end;
  3936. end;
  3937. top_const:
  3938. if not (cs_opt_size in current_settings.optimizerswitches) or (taicpu(hp2).opsize = S_B) then
  3939. begin
  3940. { change
  3941. mov const, %treg
  3942. mov %treg, y
  3943. to
  3944. mov const, y
  3945. }
  3946. if (taicpu(hp2).oper[1]^.typ=top_reg) or
  3947. ((taicpu(p).oper[0]^.val>=low(longint)) and (taicpu(p).oper[0]^.val<=high(longint))) then
  3948. begin
  3949. RegName1 := debug_regname(taicpu(hp2).oper[0]^.reg);
  3950. taicpu(hp2).loadOper(0,taicpu(p).oper[0]^);
  3951. if TempRegUsed then
  3952. begin
  3953. { Don't remove the first instruction if the temporary register is in use }
  3954. DebugMsg(SPeepholeOptimization + RegName1 + ' = ' + debug_tostr(taicpu(p).oper[0]^.val) + '; changed to minimise pipeline stall (MovMov2Mov 7a)',hp2);
  3955. { No need to set Result to True. If there's another instruction later on
  3956. that can be optimised, it will be detected when the main Pass 1 loop
  3957. reaches what is now hp2 and passes it through OptPass1MOV. [Kit] };
  3958. end
  3959. else
  3960. begin
  3961. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 7 done',p);
  3962. RemoveCurrentP(p, hp1);
  3963. Result:=true;
  3964. Exit;
  3965. end;
  3966. end;
  3967. end;
  3968. else
  3969. Internalerror(2019103001);
  3970. end;
  3971. end
  3972. else if MatchOperand(taicpu(hp2).oper[1]^, p_TargetReg) then
  3973. begin
  3974. if not CrossJump and
  3975. not RegUsedBetween(p_TargetReg, p, hp2) and
  3976. not RegReadByInstruction(p_TargetReg, hp2) then
  3977. begin
  3978. { Register is not used before it is overwritten }
  3979. DebugMsg(SPeepholeOptimization + 'Mov2Nop 3a done',p);
  3980. RemoveCurrentp(p, hp1);
  3981. Result := True;
  3982. Exit;
  3983. end;
  3984. if (taicpu(p).oper[0]^.typ = top_const) and
  3985. (taicpu(hp2).oper[0]^.typ = top_const) then
  3986. begin
  3987. if taicpu(p).oper[0]^.val = taicpu(hp2).oper[0]^.val then
  3988. begin
  3989. { Same value - register hasn't changed }
  3990. DebugMsg(SPeepholeOptimization + 'Mov2Nop 2 done', hp2);
  3991. RemoveInstruction(hp2);
  3992. Include(OptsToCheck, aoc_ForceNewIteration);
  3993. { See if there's more we can optimise }
  3994. Continue;
  3995. end;
  3996. end;
  3997. {$ifdef x86_64}
  3998. end
  3999. { Change:
  4000. movl %reg1l,%reg2l
  4001. ...
  4002. movq %reg2q,%reg3q (%reg1 <> %reg3)
  4003. To:
  4004. movl %reg1l,%reg2l
  4005. ...
  4006. movl %reg1l,%reg3l (Upper 32 bits of %reg3q will be zero)
  4007. If %reg1 = %reg3, convert to:
  4008. movl %reg1l,%reg2l
  4009. ...
  4010. andl %reg1l,%reg1l
  4011. }
  4012. else if (taicpu(p).opsize = S_L) and MatchInstruction(hp2,A_MOV,[S_Q]) and
  4013. (taicpu(p).oper[0]^.typ = top_reg) and
  4014. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  4015. SuperRegistersEqual(p_TargetReg, taicpu(hp2).oper[0]^.reg) and
  4016. not RegModifiedBetween(p_TargetReg, p, hp2) then
  4017. begin
  4018. TempRegUsed :=
  4019. CrossJump { Assume the register is in use if it crossed a conditional jump } or
  4020. RegReadByInstruction(p_TargetReg, hp3) or
  4021. RegUsedAfterInstruction(p_TargetReg, hp2, TmpUsedRegs);
  4022. taicpu(hp2).opsize := S_L;
  4023. taicpu(hp2).loadreg(0, taicpu(p).oper[0]^.reg);
  4024. setsubreg(taicpu(hp2).oper[1]^.reg, R_SUBD);
  4025. AllocRegBetween(taicpu(p).oper[0]^.reg, p, hp2, UsedRegs);
  4026. if (taicpu(p).oper[0]^.reg = taicpu(hp2).oper[1]^.reg) then
  4027. begin
  4028. { %reg1 = %reg3 }
  4029. DebugMsg(SPeepholeOptimization + 'Made 32-to-64-bit zero extension more efficient (MovlMovq2MovlAndl 2)', hp2);
  4030. taicpu(hp2).opcode := A_AND;
  4031. end
  4032. else
  4033. begin
  4034. { %reg1 <> %reg3 }
  4035. DebugMsg(SPeepholeOptimization + 'Made 32-to-64-bit zero extension more efficient (MovlMovq2MovlMovl 2)', hp2);
  4036. end;
  4037. if not TempRegUsed then
  4038. begin
  4039. DebugMsg(SPeepholeOptimization + 'Mov2Nop 8a done', p);
  4040. RemoveCurrentP(p, hp1);
  4041. Result := True;
  4042. Exit;
  4043. end
  4044. else
  4045. begin
  4046. { Initial instruction wasn't actually changed }
  4047. Include(OptsToCheck, aoc_ForceNewIteration);
  4048. { if %reg1 = %reg3, don't do the long-distance lookahead that
  4049. appears below since %reg1 has technically changed }
  4050. if taicpu(hp2).opcode = A_AND then
  4051. Break;
  4052. end;
  4053. {$endif x86_64}
  4054. end;
  4055. A_MOVZX, A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  4056. if MatchOpType(taicpu(hp2), top_reg, top_reg) and
  4057. MatchOperand(taicpu(hp2).oper[0]^, p_TargetReg) and
  4058. SuperRegistersEqual(taicpu(hp2).oper[1]^.reg, p_TargetReg) then
  4059. begin
  4060. {
  4061. Change from:
  4062. mov ###, %reg
  4063. ...
  4064. movs/z %reg,%reg (Same register, just different sizes)
  4065. To:
  4066. movs/z ###, %reg (Longer version)
  4067. ...
  4068. (remove)
  4069. }
  4070. DebugMsg(SPeepholeOptimization + 'MovMovs/z2Mov/s/z done', p);
  4071. taicpu(p).oper[1]^.reg := taicpu(hp2).oper[1]^.reg;
  4072. { Keep the first instruction as mov if ### is a constant }
  4073. if taicpu(p).oper[0]^.typ = top_const then
  4074. taicpu(p).opsize := reg2opsize(taicpu(hp2).oper[1]^.reg)
  4075. else
  4076. begin
  4077. taicpu(p).opcode := taicpu(hp2).opcode;
  4078. taicpu(p).opsize := taicpu(hp2).opsize;
  4079. end;
  4080. DebugMsg(SPeepholeOptimization + 'Removed movs/z instruction and extended earlier write (MovMovs/z2Mov/s/z)', hp2);
  4081. AllocRegBetween(taicpu(hp2).oper[1]^.reg, p, hp2, UsedRegs);
  4082. RemoveInstruction(hp2);
  4083. Result := True;
  4084. JumpTracking.Free;
  4085. Exit;
  4086. end;
  4087. else
  4088. { Move down to the if-block below };
  4089. end;
  4090. { Also catches MOV/S/Z instructions that aren't modified }
  4091. if taicpu(p).oper[0]^.typ = top_reg then
  4092. begin
  4093. p_SourceReg := taicpu(p).oper[0]^.reg;
  4094. if
  4095. not RegModifiedByInstruction(p_SourceReg, hp3) and
  4096. not RegModifiedBetween(p_SourceReg, hp3, hp2) and
  4097. DeepMOVOpt(taicpu(p), taicpu(hp2)) then
  4098. begin
  4099. Result := True;
  4100. { Just in case something didn't get modified (e.g. an
  4101. implicit register). Also, if it does read from this
  4102. register, then there's no longer an advantage to
  4103. changing the register on subsequent instructions.}
  4104. if not RegReadByInstruction(p_TargetReg, hp2) then
  4105. begin
  4106. { If a conditional jump was crossed, do not delete
  4107. the original MOV no matter what }
  4108. if not CrossJump and
  4109. { RegEndOfLife returns True if the register is
  4110. deallocated before the next instruction or has
  4111. been loaded with a new value }
  4112. RegEndOfLife(p_TargetReg, taicpu(hp2)) then
  4113. begin
  4114. { We can remove the original MOV }
  4115. DebugMsg(SPeepholeOptimization + 'Mov2Nop 3b done',p);
  4116. RemoveCurrentp(p, hp1);
  4117. JumpTracking.Free;
  4118. Result := True;
  4119. Exit;
  4120. end;
  4121. if not RegModifiedByInstruction(p_TargetReg, hp2) then
  4122. begin
  4123. { See if there's more we can optimise }
  4124. hp3 := hp2;
  4125. Continue;
  4126. end;
  4127. end;
  4128. end;
  4129. end;
  4130. { Break out of the while loop under normal circumstances }
  4131. Break;
  4132. end;
  4133. JumpTracking.Free;
  4134. end;
  4135. if (aoc_MovAnd2Mov_3 in OptsToCheck) and
  4136. (taicpu(p).oper[1]^.typ = top_reg) and
  4137. (taicpu(p).opsize = S_L) and
  4138. GetNextInstructionUsingRegTrackingUse(p,hp2,taicpu(p).oper[1]^.reg) and
  4139. (hp2.typ = ait_instruction) and
  4140. (taicpu(hp2).opcode = A_AND) and
  4141. (MatchOpType(taicpu(hp2),top_const,top_reg) or
  4142. (MatchOpType(taicpu(hp2),top_reg,top_reg) and
  4143. MatchOperand(taicpu(hp2).oper[0]^,taicpu(hp2).oper[1]^))
  4144. ) then
  4145. begin
  4146. if SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp2).oper[1]^.reg) then
  4147. begin
  4148. if ((taicpu(hp2).oper[0]^.typ=top_const) and (taicpu(hp2).oper[0]^.val = $ffffffff)) or
  4149. ((taicpu(hp2).oper[0]^.typ=top_reg) and (taicpu(hp2).opsize=S_L)) then
  4150. begin
  4151. { Optimize out:
  4152. mov x, %reg
  4153. and ffffffffh, %reg
  4154. }
  4155. DebugMsg(SPeepholeOptimization + 'MovAnd2Mov 3 done',p);
  4156. RemoveInstruction(hp2);
  4157. Result:=true;
  4158. exit;
  4159. end;
  4160. end;
  4161. end;
  4162. { leave out the mov from "mov reg, x(%frame_pointer); leave/ret" (with
  4163. x >= RetOffset) as it doesn't do anything (it writes either to a
  4164. parameter or to the temporary storage room for the function
  4165. result)
  4166. }
  4167. if IsExitCode(hp1) and
  4168. (taicpu(p).oper[1]^.typ = top_ref) and
  4169. (taicpu(p).oper[1]^.ref^.index = NR_NO) and
  4170. (
  4171. (
  4172. (taicpu(p).oper[1]^.ref^.base = current_procinfo.FramePointer) and
  4173. not (
  4174. assigned(current_procinfo.procdef.funcretsym) and
  4175. (taicpu(p).oper[1]^.ref^.offset <= tabstractnormalvarsym(current_procinfo.procdef.funcretsym).localloc.reference.offset)
  4176. )
  4177. ) or
  4178. { Also discard writes to the stack that are below the base pointer,
  4179. as this is temporary storage rather than a function result on the
  4180. stack, say. }
  4181. (
  4182. (taicpu(p).oper[1]^.ref^.base = NR_STACK_POINTER_REG) and
  4183. (taicpu(p).oper[1]^.ref^.offset < current_procinfo.final_localsize)
  4184. )
  4185. ) then
  4186. begin
  4187. RemoveCurrentp(p, hp1);
  4188. DebugMsg(SPeepholeOptimization + 'removed deadstore before leave/ret',p);
  4189. RemoveLastDeallocForFuncRes(p);
  4190. Result:=true;
  4191. exit;
  4192. end;
  4193. if MatchInstruction(hp1,A_CMP,A_TEST,[taicpu(p).opsize]) then
  4194. begin
  4195. if MatchOpType(taicpu(p),top_reg,top_ref) and
  4196. (taicpu(hp1).oper[1]^.typ = top_ref) and
  4197. RefsEqual(taicpu(p).oper[1]^.ref^, taicpu(hp1).oper[1]^.ref^) then
  4198. begin
  4199. { change
  4200. mov reg1, mem1
  4201. test/cmp x, mem1
  4202. to
  4203. mov reg1, mem1
  4204. test/cmp x, reg1
  4205. }
  4206. taicpu(hp1).loadreg(1,taicpu(p).oper[0]^.reg);
  4207. DebugMsg(SPeepholeOptimization + 'MovTestCmp2MovTestCmp 1',hp1);
  4208. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,usedregs);
  4209. Result := True;
  4210. Exit;
  4211. end;
  4212. if DoMovCmpMemOpt(p, hp1, True) then
  4213. begin
  4214. Result := True;
  4215. Exit;
  4216. end;
  4217. end;
  4218. if MatchInstruction(hp1,A_LEA,[S_L{$ifdef x86_64},S_Q{$endif x86_64}]) and
  4219. { If the flags register is in use, don't change the instruction to an
  4220. ADD otherwise this will scramble the flags. [Kit] }
  4221. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  4222. begin
  4223. if MatchOpType(Taicpu(p),top_ref,top_reg) and
  4224. ((MatchReference(Taicpu(hp1).oper[0]^.ref^,Taicpu(hp1).oper[1]^.reg,Taicpu(p).oper[1]^.reg) and
  4225. (Taicpu(hp1).oper[0]^.ref^.base<>Taicpu(p).oper[1]^.reg)
  4226. ) or
  4227. (MatchReference(Taicpu(hp1).oper[0]^.ref^,Taicpu(p).oper[1]^.reg,Taicpu(hp1).oper[1]^.reg) and
  4228. (Taicpu(hp1).oper[0]^.ref^.index<>Taicpu(p).oper[1]^.reg)
  4229. )
  4230. ) then
  4231. { mov reg1,ref
  4232. lea reg2,[reg1,reg2]
  4233. to
  4234. add reg2,ref}
  4235. begin
  4236. TransferUsedRegs(TmpUsedRegs);
  4237. { reg1 may not be used afterwards }
  4238. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs)) then
  4239. begin
  4240. Taicpu(hp1).opcode:=A_ADD;
  4241. Taicpu(hp1).oper[0]^.ref^:=Taicpu(p).oper[0]^.ref^;
  4242. DebugMsg(SPeepholeOptimization + 'MovLea2Add done',hp1);
  4243. RemoveCurrentp(p, hp1);
  4244. result:=true;
  4245. exit;
  4246. end;
  4247. end;
  4248. { If the LEA instruction can be converted into an arithmetic instruction,
  4249. it may be possible to then fold it in the next optimisation, otherwise
  4250. there's nothing more that can be optimised here. }
  4251. if not ConvertLEA(taicpu(hp1)) then
  4252. Exit;
  4253. end;
  4254. if (taicpu(p).oper[1]^.typ = top_reg) and
  4255. (hp1.typ = ait_instruction) and
  4256. GetNextInstruction(hp1, hp2) and
  4257. MatchInstruction(hp2,A_MOV,[]) and
  4258. (SuperRegistersEqual(taicpu(hp2).oper[0]^.reg,taicpu(p).oper[1]^.reg)) and
  4259. (topsize2memsize[taicpu(hp1).opsize]>=topsize2memsize[taicpu(hp2).opsize]) and
  4260. (
  4261. IsFoldableArithOp(taicpu(hp1), taicpu(p).oper[1]^.reg)
  4262. {$ifdef x86_64}
  4263. or
  4264. (
  4265. (taicpu(p).opsize=S_L) and (taicpu(hp1).opsize=S_Q) and (taicpu(hp2).opsize=S_L) and
  4266. IsFoldableArithOp(taicpu(hp1), newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[1]^.reg),R_SUBQ))
  4267. )
  4268. {$endif x86_64}
  4269. ) then
  4270. begin
  4271. if OpsEqual(taicpu(hp2).oper[1]^, taicpu(p).oper[0]^) and
  4272. (taicpu(hp2).oper[0]^.typ=top_reg) then
  4273. { change movsX/movzX reg/ref, reg2
  4274. add/sub/or/... reg3/$const, reg2
  4275. mov reg2 reg/ref
  4276. dealloc reg2
  4277. to
  4278. add/sub/or/... reg3/$const, reg/ref }
  4279. begin
  4280. TransferUsedRegs(TmpUsedRegs);
  4281. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4282. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  4283. If not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs)) then
  4284. begin
  4285. { by example:
  4286. movswl %si,%eax movswl %si,%eax p
  4287. decl %eax addl %edx,%eax hp1
  4288. movw %ax,%si movw %ax,%si hp2
  4289. ->
  4290. movswl %si,%eax movswl %si,%eax p
  4291. decw %eax addw %edx,%eax hp1
  4292. movw %ax,%si movw %ax,%si hp2
  4293. }
  4294. DebugMsg(SPeepholeOptimization + 'MovOpMov2Op ('+
  4295. debug_op2str(taicpu(p).opcode)+debug_opsize2str(taicpu(p).opsize)+' '+
  4296. debug_op2str(taicpu(hp1).opcode)+debug_opsize2str(taicpu(hp1).opsize)+' '+
  4297. debug_op2str(taicpu(hp2).opcode)+debug_opsize2str(taicpu(hp2).opsize)+')',p);
  4298. taicpu(hp1).changeopsize(taicpu(hp2).opsize);
  4299. {
  4300. ->
  4301. movswl %si,%eax movswl %si,%eax p
  4302. decw %si addw %dx,%si hp1
  4303. movw %ax,%si movw %ax,%si hp2
  4304. }
  4305. case taicpu(hp1).ops of
  4306. 1:
  4307. begin
  4308. taicpu(hp1).loadoper(0, taicpu(hp2).oper[1]^);
  4309. if taicpu(hp1).oper[0]^.typ=top_reg then
  4310. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4311. end;
  4312. 2:
  4313. begin
  4314. taicpu(hp1).loadoper(1, taicpu(hp2).oper[1]^);
  4315. if (taicpu(hp1).oper[0]^.typ=top_reg) and
  4316. (taicpu(hp1).opcode<>A_SHL) and
  4317. (taicpu(hp1).opcode<>A_SHR) and
  4318. (taicpu(hp1).opcode<>A_SAR) then
  4319. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4320. end;
  4321. else
  4322. internalerror(2008042701);
  4323. end;
  4324. {
  4325. ->
  4326. decw %si addw %dx,%si p
  4327. }
  4328. RemoveInstruction(hp2);
  4329. RemoveCurrentP(p, hp1);
  4330. Result:=True;
  4331. Exit;
  4332. end;
  4333. end;
  4334. if MatchOpType(taicpu(hp2),top_reg,top_reg) and
  4335. not(SuperRegistersEqual(taicpu(hp1).oper[0]^.reg,taicpu(hp2).oper[1]^.reg)) and
  4336. ((topsize2memsize[taicpu(hp1).opsize]<= topsize2memsize[taicpu(hp2).opsize]) or
  4337. { opsize matters for these opcodes, we could probably work around this, but it is not worth the effort }
  4338. ((taicpu(hp1).opcode<>A_SHL) and (taicpu(hp1).opcode<>A_SHR) and (taicpu(hp1).opcode<>A_SAR))
  4339. )
  4340. {$ifdef i386}
  4341. { byte registers of esi, edi, ebp, esp are not available on i386 }
  4342. and ((taicpu(hp2).opsize<>S_B) or not(getsupreg(taicpu(hp1).oper[0]^.reg) in [RS_ESI,RS_EDI,RS_EBP,RS_ESP]))
  4343. and ((taicpu(hp2).opsize<>S_B) or not(getsupreg(taicpu(p).oper[0]^.reg) in [RS_ESI,RS_EDI,RS_EBP,RS_ESP]))
  4344. {$endif i386}
  4345. then
  4346. { change movsX/movzX reg/ref, reg2
  4347. add/sub/or/... regX/$const, reg2
  4348. mov reg2, reg3
  4349. dealloc reg2
  4350. to
  4351. movsX/movzX reg/ref, reg3
  4352. add/sub/or/... reg3/$const, reg3
  4353. }
  4354. begin
  4355. TransferUsedRegs(TmpUsedRegs);
  4356. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4357. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  4358. If not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs)) then
  4359. begin
  4360. { by example:
  4361. movswl %si,%eax movswl %si,%eax p
  4362. decl %eax addl %edx,%eax hp1
  4363. movw %ax,%si movw %ax,%si hp2
  4364. ->
  4365. movswl %si,%eax movswl %si,%eax p
  4366. decw %eax addw %edx,%eax hp1
  4367. movw %ax,%si movw %ax,%si hp2
  4368. }
  4369. DebugMsg(SPeepholeOptimization + 'MovOpMov2MovOp ('+
  4370. debug_op2str(taicpu(p).opcode)+debug_opsize2str(taicpu(p).opsize)+' '+
  4371. debug_op2str(taicpu(hp1).opcode)+debug_opsize2str(taicpu(hp1).opsize)+' '+
  4372. debug_op2str(taicpu(hp2).opcode)+debug_opsize2str(taicpu(hp2).opsize)+')',p);
  4373. { limit size of constants as well to avoid assembler errors, but
  4374. check opsize to avoid overflow when left shifting the 1 }
  4375. if (taicpu(p).oper[0]^.typ=top_const) and (topsize2memsize[taicpu(hp2).opsize]<=63) then
  4376. taicpu(p).oper[0]^.val:=taicpu(p).oper[0]^.val and ((qword(1) shl topsize2memsize[taicpu(hp2).opsize])-1);
  4377. {$ifdef x86_64}
  4378. { Be careful of, for example:
  4379. movl %reg1,%reg2
  4380. addl %reg3,%reg2
  4381. movq %reg2,%reg4
  4382. This will cause problems if the upper 32-bits of %reg3 or %reg4 are non-zero
  4383. }
  4384. if (taicpu(hp1).opsize = S_L) and (taicpu(hp2).opsize = S_Q) then
  4385. begin
  4386. taicpu(hp2).changeopsize(S_L);
  4387. setsubreg(taicpu(hp2).oper[0]^.reg, R_SUBD);
  4388. setsubreg(taicpu(hp2).oper[1]^.reg, R_SUBD);
  4389. end;
  4390. {$endif x86_64}
  4391. taicpu(hp1).changeopsize(taicpu(hp2).opsize);
  4392. taicpu(p).changeopsize(taicpu(hp2).opsize);
  4393. if taicpu(p).oper[0]^.typ=top_reg then
  4394. setsubreg(taicpu(p).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4395. taicpu(p).loadoper(1, taicpu(hp2).oper[1]^);
  4396. AllocRegBetween(taicpu(p).oper[1]^.reg,p,hp1,usedregs);
  4397. {
  4398. ->
  4399. movswl %si,%eax movswl %si,%eax p
  4400. decw %si addw %dx,%si hp1
  4401. movw %ax,%si movw %ax,%si hp2
  4402. }
  4403. case taicpu(hp1).ops of
  4404. 1:
  4405. begin
  4406. taicpu(hp1).loadoper(0, taicpu(hp2).oper[1]^);
  4407. if taicpu(hp1).oper[0]^.typ=top_reg then
  4408. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4409. end;
  4410. 2:
  4411. begin
  4412. taicpu(hp1).loadoper(1, taicpu(hp2).oper[1]^);
  4413. if (taicpu(hp1).oper[0]^.typ=top_reg) and
  4414. (taicpu(hp1).opcode<>A_SHL) and
  4415. (taicpu(hp1).opcode<>A_SHR) and
  4416. (taicpu(hp1).opcode<>A_SAR) then
  4417. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4418. end;
  4419. else
  4420. internalerror(2018111801);
  4421. end;
  4422. {
  4423. ->
  4424. decw %si addw %dx,%si p
  4425. }
  4426. RemoveInstruction(hp2);
  4427. end;
  4428. end;
  4429. end;
  4430. if MatchInstruction(hp1,A_BTS,A_BTR,[Taicpu(p).opsize]) and
  4431. GetNextInstruction(hp1, hp2) and
  4432. MatchInstruction(hp2,A_OR,[Taicpu(p).opsize]) and
  4433. MatchOperand(Taicpu(p).oper[0]^,0) and
  4434. (Taicpu(p).oper[1]^.typ = top_reg) and
  4435. MatchOperand(Taicpu(p).oper[1]^,Taicpu(hp1).oper[1]^) and
  4436. MatchOperand(Taicpu(p).oper[1]^,Taicpu(hp2).oper[1]^) then
  4437. { mov reg1,0
  4438. bts reg1,operand1 --> mov reg1,operand2
  4439. or reg1,operand2 bts reg1,operand1}
  4440. begin
  4441. Taicpu(hp2).opcode:=A_MOV;
  4442. DebugMsg(SPeepholeOptimization + 'MovBtsOr2MovBts done',hp1);
  4443. asml.remove(hp1);
  4444. insertllitem(hp2,hp2.next,hp1);
  4445. RemoveCurrentp(p, hp1);
  4446. Result:=true;
  4447. exit;
  4448. end;
  4449. if MatchInstruction(hp1,A_SUB,[Taicpu(p).opsize]) and
  4450. MatchOperand(Taicpu(p).oper[1]^,Taicpu(hp1).oper[1]^) and
  4451. GetNextInstruction(hp1, hp2) and
  4452. MatchInstruction(hp2,A_CMP,[Taicpu(p).opsize]) and
  4453. MatchOperand(Taicpu(p).oper[0]^,Taicpu(hp2).oper[1]^) and
  4454. MatchOperand(Taicpu(hp1).oper[0]^,Taicpu(hp2).oper[0]^) then
  4455. { change
  4456. mov reg1,reg2
  4457. sub reg3,reg2
  4458. cmp reg3,reg1
  4459. into
  4460. mov reg1,reg2
  4461. sub reg3,reg2
  4462. }
  4463. begin
  4464. DebugMsg(SPeepholeOptimization + 'MovSubCmp2MovSub done',p);
  4465. RemoveInstruction(hp2);
  4466. Result:=true;
  4467. exit;
  4468. end;
  4469. {
  4470. mov ref,reg0
  4471. <op> reg0,reg1
  4472. dealloc reg0
  4473. to
  4474. <op> ref,reg1
  4475. }
  4476. if MatchOpType(taicpu(p),top_ref,top_reg) and
  4477. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  4478. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  4479. MatchInstruction(hp1,[A_AND,A_OR,A_XOR,A_ADD,A_SUB,A_CMP],[Taicpu(p).opsize]) and
  4480. not(MatchOperand(taicpu(hp1).oper[0]^,taicpu(hp1).oper[1]^)) and
  4481. RegEndOfLife(taicpu(p).oper[1]^.reg,taicpu(hp1)) then
  4482. begin
  4483. taicpu(hp1).loadoper(0,taicpu(p).oper[0]^);
  4484. DebugMsg(SPeepholeOptimization + 'MovOp2Op done',hp1);
  4485. RemoveCurrentp(p, hp1);
  4486. Result:=true;
  4487. exit;
  4488. end;
  4489. if (taicpu(p).oper[0]^.typ = top_ref) and { Second operand will be a register }
  4490. MatchInstruction(hp1, A_SHR, A_SAR, [taicpu(p).opsize]) and
  4491. MatchOpType(taicpu(hp1), top_const, top_reg) and
  4492. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  4493. begin
  4494. RegName1 := debug_regname(taicpu(hp1).oper[1]^.reg);
  4495. {$ifdef x86_64}
  4496. { Convert:
  4497. movq x(ref),%reg64
  4498. shrq y,%reg64
  4499. To:
  4500. movl x+4(ref),%reg32
  4501. shrl y-32,%reg32 (Remove if y = 32)
  4502. }
  4503. if (taicpu(p).opsize = S_Q) and
  4504. (taicpu(hp1).opcode = A_SHR) and
  4505. (taicpu(hp1).oper[0]^.val >= 32) then
  4506. begin
  4507. PreMessage := 'movq ' + debug_operstr(taicpu(p).oper[0]^) + ',' + RegName1 + '; ' +
  4508. 'shrq $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + RegName1 + ' -> movl ';
  4509. { Convert to 32-bit }
  4510. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  4511. taicpu(p).opsize := S_L;
  4512. Inc(taicpu(p).oper[0]^.ref^.offset, 4);
  4513. PreMessage := PreMessage + debug_operstr(taicpu(p).oper[0]^) + ',' + debug_regname(taicpu(p).oper[1]^.reg);
  4514. if (taicpu(hp1).oper[0]^.val = 32) then
  4515. begin
  4516. DebugMsg(SPeepholeOptimization + PreMessage + ' (MovShr2Mov)', p);
  4517. RemoveInstruction(hp1);
  4518. end
  4519. else
  4520. begin
  4521. { This will potentially open up more arithmetic operations since
  4522. the peephole optimizer now has a big hint that only the lower
  4523. 32 bits are currently in use (and opcodes are smaller in size) }
  4524. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  4525. taicpu(hp1).opsize := S_L;
  4526. Dec(taicpu(hp1).oper[0]^.val, 32);
  4527. DebugMsg(SPeepholeOptimization + PreMessage +
  4528. '; shrl $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + debug_regname(taicpu(hp1).oper[1]^.reg) + ' (MovShr2MovShr)', p);
  4529. end;
  4530. Result := True;
  4531. Exit;
  4532. end;
  4533. {$endif x86_64}
  4534. { Convert:
  4535. movl x(ref),%reg
  4536. shrl $24,%reg
  4537. To:
  4538. movzbl x+3(ref),%reg
  4539. Do similar things for movl; shrl $16 -> movzwl and movw; shrw $8 -> movzbw
  4540. Also accept sar instead of shr, but convert to movsx instead of movzx
  4541. }
  4542. if taicpu(hp1).opcode = A_SHR then
  4543. MovUnaligned := A_MOVZX
  4544. else
  4545. MovUnaligned := A_MOVSX;
  4546. NewSize := S_NO;
  4547. NewOffset := 0;
  4548. case taicpu(p).opsize of
  4549. S_B:
  4550. { No valid combinations };
  4551. S_W:
  4552. if (taicpu(hp1).oper[0]^.val = 8) then
  4553. begin
  4554. NewSize := S_BW;
  4555. NewOffset := 1;
  4556. end;
  4557. S_L:
  4558. case taicpu(hp1).oper[0]^.val of
  4559. 16:
  4560. begin
  4561. NewSize := S_WL;
  4562. NewOffset := 2;
  4563. end;
  4564. 24:
  4565. begin
  4566. NewSize := S_BL;
  4567. NewOffset := 3;
  4568. end;
  4569. else
  4570. ;
  4571. end;
  4572. {$ifdef x86_64}
  4573. S_Q:
  4574. case taicpu(hp1).oper[0]^.val of
  4575. 32:
  4576. begin
  4577. if taicpu(hp1).opcode = A_SAR then
  4578. begin
  4579. { 32-bit to 64-bit is a distinct instruction }
  4580. MovUnaligned := A_MOVSXD;
  4581. NewSize := S_LQ;
  4582. NewOffset := 4;
  4583. end
  4584. else
  4585. { Should have been handled by MovShr2Mov above }
  4586. InternalError(2022081811);
  4587. end;
  4588. 48:
  4589. begin
  4590. NewSize := S_WQ;
  4591. NewOffset := 6;
  4592. end;
  4593. 56:
  4594. begin
  4595. NewSize := S_BQ;
  4596. NewOffset := 7;
  4597. end;
  4598. else
  4599. ;
  4600. end;
  4601. {$endif x86_64}
  4602. else
  4603. InternalError(2022081810);
  4604. end;
  4605. if (NewSize <> S_NO) and
  4606. (taicpu(p).oper[0]^.ref^.offset <= $7FFFFFFF - NewOffset) then
  4607. begin
  4608. PreMessage := 'mov' + debug_opsize2str(taicpu(p).opsize) + ' ' + debug_operstr(taicpu(p).oper[0]^) + ',' + RegName1 + '; ' +
  4609. 'shr' + debug_opsize2str(taicpu(p).opsize) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + RegName1 + ' -> ' +
  4610. debug_op2str(MovUnaligned);
  4611. {$ifdef x86_64}
  4612. if MovUnaligned <> A_MOVSXD then
  4613. { Don't add size suffix for MOVSXD }
  4614. {$endif x86_64}
  4615. PreMessage := PreMessage + debug_opsize2str(NewSize);
  4616. Inc(taicpu(p).oper[0]^.ref^.offset, NewOffset);
  4617. taicpu(p).opcode := MovUnaligned;
  4618. taicpu(p).opsize := NewSize;
  4619. DebugMsg(SPeepholeOptimization + PreMessage + ' ' +
  4620. debug_operstr(taicpu(p).oper[0]^) + ',' + debug_regname(taicpu(hp1).oper[1]^.reg) + ' (MovShr/Sar2Movx)', p);
  4621. RemoveInstruction(hp1);
  4622. Result := True;
  4623. Exit;
  4624. end;
  4625. end;
  4626. { Backward optimisation shared with OptPass2MOV }
  4627. if FuncMov2Func(p, hp1) then
  4628. begin
  4629. Result := True;
  4630. Exit;
  4631. end;
  4632. end;
  4633. function TX86AsmOptimizer.OptPass1MOVXX(var p : tai) : boolean;
  4634. var
  4635. hp1 : tai;
  4636. begin
  4637. Result:=false;
  4638. if taicpu(p).ops <> 2 then
  4639. exit;
  4640. if (MatchOpType(taicpu(p),top_reg,top_reg) and GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg)) or
  4641. GetNextInstruction(p,hp1) then
  4642. begin
  4643. if MatchInstruction(hp1,taicpu(p).opcode,[taicpu(p).opsize]) and
  4644. (taicpu(hp1).ops = 2) then
  4645. begin
  4646. if (taicpu(hp1).oper[0]^.typ = taicpu(p).oper[1]^.typ) and
  4647. (taicpu(hp1).oper[1]^.typ = taicpu(p).oper[0]^.typ) then
  4648. { movXX reg1, mem1 or movXX mem1, reg1
  4649. movXX mem2, reg2 movXX reg2, mem2}
  4650. begin
  4651. if OpsEqual(taicpu(hp1).oper[1]^,taicpu(p).oper[0]^) then
  4652. { movXX reg1, mem1 or movXX mem1, reg1
  4653. movXX mem2, reg1 movXX reg2, mem1}
  4654. begin
  4655. if OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  4656. begin
  4657. { Removes the second statement from
  4658. movXX reg1, mem1/reg2
  4659. movXX mem1/reg2, reg1
  4660. }
  4661. if taicpu(p).oper[0]^.typ=top_reg then
  4662. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,usedregs);
  4663. { Removes the second statement from
  4664. movXX mem1/reg1, reg2
  4665. movXX reg2, mem1/reg1
  4666. }
  4667. if (taicpu(p).oper[1]^.typ=top_reg) and
  4668. not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,UsedRegs)) then
  4669. begin
  4670. DebugMsg(SPeepholeOptimization + 'MovXXMovXX2Nop 1 done',p);
  4671. RemoveInstruction(hp1);
  4672. RemoveCurrentp(p); { p will now be equal to the instruction that follows what was hp1 }
  4673. Result:=true;
  4674. exit;
  4675. end
  4676. else if (taicpu(hp1).oper[1]^.typ<>top_ref) or (not(vol_write in taicpu(hp1).oper[1]^.ref^.volatility)) and
  4677. (taicpu(hp1).oper[0]^.typ<>top_ref) or (not(vol_read in taicpu(hp1).oper[0]^.ref^.volatility)) then
  4678. begin
  4679. DebugMsg(SPeepholeOptimization + 'MovXXMovXX2MoVXX 1 done',p);
  4680. RemoveInstruction(hp1);
  4681. Result:=true;
  4682. exit;
  4683. end;
  4684. end
  4685. end;
  4686. end;
  4687. end;
  4688. end;
  4689. end;
  4690. function TX86AsmOptimizer.OptPass1OP(var p : tai) : boolean;
  4691. var
  4692. hp1 : tai;
  4693. begin
  4694. result:=false;
  4695. { replace
  4696. <Op>X %mreg1,%mreg2 // Op in [ADD,MUL]
  4697. MovX %mreg2,%mreg1
  4698. dealloc %mreg2
  4699. by
  4700. <Op>X %mreg2,%mreg1
  4701. ?
  4702. }
  4703. if GetNextInstruction(p,hp1) and
  4704. { we mix single and double opperations here because we assume that the compiler
  4705. generates vmovapd only after double operations and vmovaps only after single operations }
  4706. MatchInstruction(hp1,A_MOVAPD,A_MOVAPS,[S_NO]) and
  4707. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  4708. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[1]^) and
  4709. (taicpu(p).oper[0]^.typ=top_reg) then
  4710. begin
  4711. TransferUsedRegs(TmpUsedRegs);
  4712. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4713. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  4714. begin
  4715. taicpu(p).loadoper(0,taicpu(hp1).oper[0]^);
  4716. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  4717. DebugMsg(SPeepholeOptimization + 'OpMov2Op done',p);
  4718. RemoveInstruction(hp1);
  4719. result:=true;
  4720. end;
  4721. end;
  4722. end;
  4723. function TX86AsmOptimizer.OptPass1Test(var p: tai) : boolean;
  4724. var
  4725. hp1, p_label, p_dist, hp1_dist: tai;
  4726. JumpLabel, JumpLabel_dist: TAsmLabel;
  4727. FirstValue, SecondValue: TCGInt;
  4728. TempBool: Boolean;
  4729. begin
  4730. Result := False;
  4731. if (taicpu(p).oper[0]^.typ = top_const) and
  4732. (taicpu(p).oper[0]^.val <> -1) then
  4733. begin
  4734. { Convert unsigned maximum constants to -1 to aid optimisation }
  4735. case taicpu(p).opsize of
  4736. S_B:
  4737. if (taicpu(p).oper[0]^.val and $FF) = $FF then
  4738. begin
  4739. taicpu(p).oper[0]^.val := -1;
  4740. Result := True;
  4741. Exit;
  4742. end;
  4743. S_W:
  4744. if (taicpu(p).oper[0]^.val and $FFFF) = $FFFF then
  4745. begin
  4746. taicpu(p).oper[0]^.val := -1;
  4747. Result := True;
  4748. Exit;
  4749. end;
  4750. S_L:
  4751. if (taicpu(p).oper[0]^.val and $FFFFFFFF) = $FFFFFFFF then
  4752. begin
  4753. taicpu(p).oper[0]^.val := -1;
  4754. Result := True;
  4755. Exit;
  4756. end;
  4757. {$ifdef x86_64}
  4758. S_Q:
  4759. { Storing anything greater than $7FFFFFFF is not possible so do
  4760. nothing };
  4761. {$endif x86_64}
  4762. else
  4763. InternalError(2021121001);
  4764. end;
  4765. end;
  4766. if GetNextInstruction(p, hp1) and
  4767. TrySwapMovCmp(p, hp1) then
  4768. begin
  4769. Result := True;
  4770. Exit;
  4771. end;
  4772. if MatchInstruction(hp1, A_Jcc, []) then
  4773. begin
  4774. TempBool := True;
  4775. if DoJumpOptimizations(hp1, TempBool) or
  4776. not TempBool then
  4777. begin
  4778. Result := True;
  4779. if Assigned(hp1) then
  4780. begin
  4781. if (hp1.typ in [ait_align]) then
  4782. SkipAligns(hp1, hp1);
  4783. { CollapseZeroDistJump will be set to the label after the
  4784. jump if it optimises, whether or not it's live or dead }
  4785. if (hp1.typ in [ait_label]) and
  4786. not (tai_label(hp1).labsym.is_used) then
  4787. GetNextInstruction(hp1, hp1);
  4788. end;
  4789. TransferUsedRegs(TmpUsedRegs);
  4790. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  4791. if not Assigned(hp1) or
  4792. (
  4793. not MatchInstruction(hp1, A_Jcc, A_SETcc, A_CMOVcc, []) and
  4794. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)
  4795. ) then
  4796. begin
  4797. { No more conditional jumps; conditional statement is no longer required }
  4798. DebugMsg(SPeepholeOptimization + 'Removed unnecessary condition (Test2Nop)', p);
  4799. RemoveCurrentP(p);
  4800. end;
  4801. Exit;
  4802. end;
  4803. end;
  4804. { Search for:
  4805. test $x,(reg/ref)
  4806. jne @lbl1
  4807. test $y,(reg/ref) (same register or reference)
  4808. jne @lbl1
  4809. Change to:
  4810. test $(x or y),(reg/ref)
  4811. jne @lbl1
  4812. (Note, this doesn't work with je instead of jne)
  4813. Also catch cases where "cmp $0,(reg/ref)" and "test %reg,%reg" are used.
  4814. Also search for:
  4815. test $x,(reg/ref)
  4816. je @lbl1
  4817. test $y,(reg/ref)
  4818. je/jne @lbl2
  4819. If (x or y) = x, then the second jump is deterministic
  4820. }
  4821. if (
  4822. (
  4823. (taicpu(p).oper[0]^.typ = top_const) or
  4824. (
  4825. { test %reg,%reg can be considered equivalent to test, -1,%reg }
  4826. (taicpu(p).oper[0]^.typ = top_reg) and
  4827. MatchOperand(taicpu(p).oper[1]^, taicpu(p).oper[0]^.reg)
  4828. )
  4829. ) and
  4830. MatchInstruction(hp1, A_JCC, [])
  4831. ) then
  4832. begin
  4833. if (taicpu(p).oper[0]^.typ = top_reg) and
  4834. MatchOperand(taicpu(p).oper[1]^, taicpu(p).oper[0]^.reg) then
  4835. FirstValue := -1
  4836. else
  4837. FirstValue := taicpu(p).oper[0]^.val;
  4838. { If we have several test/jne's in a row, it might be the case that
  4839. the second label doesn't go to the same location, but the one
  4840. after it might (e.g. test; jne @lbl1; test; jne @lbl2; test @lbl1),
  4841. so accommodate for this with a while loop.
  4842. }
  4843. hp1_dist := hp1;
  4844. if GetNextInstruction(hp1, p_dist) and
  4845. (p_dist.typ = ait_instruction) and
  4846. (
  4847. (
  4848. (taicpu(p_dist).opcode = A_TEST) and
  4849. (
  4850. (taicpu(p_dist).oper[0]^.typ = top_const) or
  4851. { test %reg,%reg can be considered equivalent to test, -1,%reg }
  4852. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p_dist).oper[0]^)
  4853. )
  4854. ) or
  4855. (
  4856. { cmp 0,%reg = test %reg,%reg }
  4857. (taicpu(p_dist).opcode = A_CMP) and
  4858. MatchOperand(taicpu(p_dist).oper[0]^, 0)
  4859. )
  4860. ) and
  4861. { Make sure the destination operands are actually the same }
  4862. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p).oper[1]^) and
  4863. GetNextInstruction(p_dist, hp1_dist) and
  4864. MatchInstruction(hp1_dist, A_JCC, []) then
  4865. begin
  4866. if
  4867. (taicpu(p_dist).opcode = A_CMP) { constant will be zero } or
  4868. (
  4869. (taicpu(p_dist).oper[0]^.typ = top_reg) and
  4870. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p_dist).oper[0]^.reg)
  4871. ) then
  4872. SecondValue := -1
  4873. else
  4874. SecondValue := taicpu(p_dist).oper[0]^.val;
  4875. { If both of the TEST constants are identical, delete the second
  4876. TEST that is unnecessary. }
  4877. if (FirstValue = SecondValue) then
  4878. begin
  4879. DebugMsg(SPeepholeOptimization + 'TEST/Jcc/TEST; removed superfluous TEST', p_dist);
  4880. RemoveInstruction(p_dist);
  4881. { Don't let the flags register become deallocated and reallocated between the jumps }
  4882. AllocRegBetween(NR_DEFAULTFLAGS, hp1, hp1_dist, UsedRegs);
  4883. Result := True;
  4884. if condition_in(taicpu(hp1_dist).condition, taicpu(hp1).condition) then
  4885. begin
  4886. { Since the second jump's condition is a subset of the first, we
  4887. know it will never branch because the first jump dominates it.
  4888. Get it out of the way now rather than wait for the jump
  4889. optimisations for a speed boost. }
  4890. if IsJumpToLabel(taicpu(hp1_dist)) then
  4891. TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol).DecRefs;
  4892. DebugMsg(SPeepholeOptimization + 'Removed dominated jump (via TEST/Jcc/TEST)', hp1_dist);
  4893. RemoveInstruction(hp1_dist);
  4894. end
  4895. else if condition_in(inverse_cond(taicpu(hp1).condition), taicpu(hp1_dist).condition) then
  4896. begin
  4897. { If the inverse of the first condition is a subset of the second,
  4898. the second one will definitely branch if the first one doesn't }
  4899. DebugMsg(SPeepholeOptimization + 'Conditional jump will always branch (via TEST/Jcc/TEST)', hp1_dist);
  4900. MakeUnconditional(taicpu(hp1_dist));
  4901. RemoveDeadCodeAfterJump(hp1_dist);
  4902. end;
  4903. Exit;
  4904. end;
  4905. if (taicpu(hp1).condition in [C_NE, C_NZ]) and
  4906. (taicpu(hp1_dist).condition in [C_NE, C_NZ]) and
  4907. { If the first instruction is test %reg,%reg or test $-1,%reg,
  4908. then the second jump will never branch, so it can also be
  4909. removed regardless of where it goes }
  4910. (
  4911. (FirstValue = -1) or
  4912. (SecondValue = -1) or
  4913. MatchOperand(taicpu(hp1_dist).oper[0]^, taicpu(hp1).oper[0]^)
  4914. ) then
  4915. begin
  4916. { Same jump location... can be a register since nothing's changed }
  4917. { If any of the entries are equivalent to test %reg,%reg, then the
  4918. merged $(x or y) is also test %reg,%reg / test $-1,%reg }
  4919. taicpu(p).loadconst(0, FirstValue or SecondValue);
  4920. if IsJumpToLabel(taicpu(hp1_dist)) then
  4921. TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol).DecRefs;
  4922. DebugMsg(SPeepholeOptimization + 'TEST/JNE/TEST/JNE merged', p);
  4923. RemoveInstruction(hp1_dist);
  4924. { Only remove the second test if no jumps or other conditional instructions follow }
  4925. TransferUsedRegs(TmpUsedRegs);
  4926. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  4927. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  4928. if not RegUsedAfterInstruction(NR_DEFAULTFLAGS, p_dist, TmpUsedRegs) then
  4929. RemoveInstruction(p_dist);
  4930. Result := True;
  4931. Exit;
  4932. end;
  4933. end;
  4934. end;
  4935. { Search for:
  4936. test %reg,%reg
  4937. j(c1) @lbl1
  4938. ...
  4939. @lbl:
  4940. test %reg,%reg (same register)
  4941. j(c2) @lbl2
  4942. If c2 is a subset of c1, change to:
  4943. test %reg,%reg
  4944. j(c1) @lbl2
  4945. (@lbl1 may become a dead label as a result)
  4946. }
  4947. if (taicpu(p).oper[1]^.typ = top_reg) and
  4948. (taicpu(p).oper[0]^.typ = top_reg) and
  4949. (taicpu(p).oper[0]^.reg = taicpu(p).oper[1]^.reg) and
  4950. MatchInstruction(hp1, A_JCC, []) and
  4951. IsJumpToLabel(taicpu(hp1)) then
  4952. begin
  4953. JumpLabel := TAsmLabel(taicpu(hp1).oper[0]^.ref^.symbol);
  4954. p_label := nil;
  4955. if Assigned(JumpLabel) then
  4956. p_label := getlabelwithsym(JumpLabel);
  4957. if Assigned(p_label) and
  4958. GetNextInstruction(p_label, p_dist) and
  4959. MatchInstruction(p_dist, A_TEST, []) and
  4960. { It's fine if the second test uses smaller sub-registers }
  4961. (taicpu(p_dist).opsize <= taicpu(p).opsize) and
  4962. MatchOpType(taicpu(p_dist), top_reg, top_reg) and
  4963. SuperRegistersEqual(taicpu(p_dist).oper[0]^.reg, taicpu(p).oper[0]^.reg) and
  4964. SuperRegistersEqual(taicpu(p_dist).oper[1]^.reg, taicpu(p).oper[1]^.reg) and
  4965. GetNextInstruction(p_dist, hp1_dist) and
  4966. MatchInstruction(hp1_dist, A_JCC, []) then { This doesn't have to be an explicit label }
  4967. begin
  4968. JumpLabel_dist := TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol);
  4969. if JumpLabel = JumpLabel_dist then
  4970. { This is an infinite loop }
  4971. Exit;
  4972. { Best optimisation when the first condition is a subset (or equal) of the second }
  4973. if condition_in(taicpu(hp1).condition, taicpu(hp1_dist).condition) then
  4974. begin
  4975. { Any registers used here will already be allocated }
  4976. if Assigned(JumpLabel) then
  4977. JumpLabel.DecRefs;
  4978. DebugMsg(SPeepholeOptimization + 'TEST/Jcc/@Lbl/TEST/Jcc -> TEST/Jcc, redirecting first jump', hp1);
  4979. taicpu(hp1).loadref(0, taicpu(hp1_dist).oper[0]^.ref^); { This also increases the reference count }
  4980. Result := True;
  4981. Exit;
  4982. end;
  4983. end;
  4984. end;
  4985. end;
  4986. function TX86AsmOptimizer.OptPass1Add(var p : tai) : boolean;
  4987. var
  4988. hp1, hp2: tai;
  4989. ActiveReg: TRegister;
  4990. OldOffset: asizeint;
  4991. ThisConst: TCGInt;
  4992. function RegDeallocated: Boolean;
  4993. begin
  4994. TransferUsedRegs(TmpUsedRegs);
  4995. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4996. Result := not(RegUsedAfterInstruction(ActiveReg,hp1,TmpUsedRegs))
  4997. end;
  4998. begin
  4999. result:=false;
  5000. hp1 := nil;
  5001. { replace
  5002. addX const,%reg1
  5003. leaX (%reg1,%reg1,Y),%reg2 // Base or index might not be equal to reg1
  5004. dealloc %reg1
  5005. by
  5006. leaX const+const*Y(%reg1,%reg1,Y),%reg2
  5007. }
  5008. if MatchOpType(taicpu(p),top_const,top_reg) then
  5009. begin
  5010. ActiveReg := taicpu(p).oper[1]^.reg;
  5011. { Ensures the entire register was updated }
  5012. if (taicpu(p).opsize >= S_L) and
  5013. GetNextInstructionUsingReg(p,hp1, ActiveReg) and
  5014. MatchInstruction(hp1,A_LEA,[]) and
  5015. (SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.base) or
  5016. SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.index)) and
  5017. (
  5018. { Cover the case where the register in the reference is also the destination register }
  5019. Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, ActiveReg) or
  5020. (
  5021. { Try to avoid the expensive check of RegUsedAfterInstruction if we know it will return False }
  5022. not SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ActiveReg) and
  5023. RegDeallocated
  5024. )
  5025. ) then
  5026. begin
  5027. OldOffset := taicpu(hp1).oper[0]^.ref^.offset;
  5028. {$push}
  5029. {$R-}{$Q-}
  5030. { Explicitly disable overflow checking for these offset calculation
  5031. as those do not matter for the final result }
  5032. if ActiveReg=taicpu(hp1).oper[0]^.ref^.base then
  5033. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val);
  5034. if ActiveReg=taicpu(hp1).oper[0]^.ref^.index then
  5035. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val*max(taicpu(hp1).oper[0]^.ref^.scalefactor,1));
  5036. {$pop}
  5037. {$ifdef x86_64}
  5038. if (taicpu(hp1).oper[0]^.ref^.offset > $7FFFFFFF) or (taicpu(hp1).oper[0]^.ref^.offset < -2147483648) then
  5039. begin
  5040. { Overflow; abort }
  5041. taicpu(hp1).oper[0]^.ref^.offset := OldOffset;
  5042. end
  5043. else
  5044. {$endif x86_64}
  5045. begin
  5046. DebugMsg(SPeepholeOptimization + 'AddLea2Lea done',p);
  5047. if not (cs_opt_level3 in current_settings.optimizerswitches) then
  5048. { hp1 is the immediate next instruction for sure - good for a quick speed boost }
  5049. RemoveCurrentP(p, hp1)
  5050. else
  5051. RemoveCurrentP(p);
  5052. result:=true;
  5053. Exit;
  5054. end;
  5055. end;
  5056. if (
  5057. { Save calling GetNextInstructionUsingReg again }
  5058. Assigned(hp1) or
  5059. GetNextInstructionUsingReg(p,hp1, ActiveReg)
  5060. ) and
  5061. MatchInstruction(hp1,A_ADD,A_SUB,[taicpu(p).opsize]) and
  5062. (taicpu(hp1).oper[1]^.reg = ActiveReg) then
  5063. begin
  5064. if taicpu(hp1).oper[0]^.typ = top_const then
  5065. begin
  5066. { Merge add const1,%reg; add/sub const2,%reg to add const1+/-const2,%reg }
  5067. if taicpu(hp1).opcode = A_ADD then
  5068. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val
  5069. else
  5070. ThisConst := taicpu(p).oper[0]^.val - taicpu(hp1).oper[0]^.val;
  5071. Result := True;
  5072. { Handle any overflows }
  5073. case taicpu(p).opsize of
  5074. S_B:
  5075. taicpu(p).oper[0]^.val := ThisConst and $FF;
  5076. S_W:
  5077. taicpu(p).oper[0]^.val := ThisConst and $FFFF;
  5078. S_L:
  5079. taicpu(p).oper[0]^.val := ThisConst and $FFFFFFFF;
  5080. {$ifdef x86_64}
  5081. S_Q:
  5082. if (ThisConst > $7FFFFFFF) or (ThisConst < -2147483648) then
  5083. { Overflow; abort }
  5084. Result := False
  5085. else
  5086. taicpu(p).oper[0]^.val := ThisConst;
  5087. {$endif x86_64}
  5088. else
  5089. InternalError(2021102610);
  5090. end;
  5091. { Result may get set to False again if the combined immediate overflows for S_Q sizes }
  5092. if Result then
  5093. begin
  5094. if (taicpu(p).oper[0]^.val < 0) and
  5095. (
  5096. ((taicpu(p).opsize = S_B) and (taicpu(p).oper[0]^.val <> -128)) or
  5097. ((taicpu(p).opsize = S_W) and (taicpu(p).oper[0]^.val <> -32768)) or
  5098. ((taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) and (taicpu(p).oper[0]^.val <> -2147483648))
  5099. ) then
  5100. begin
  5101. DebugMsg(SPeepholeOptimization + 'ADD; ADD/SUB -> SUB',p);
  5102. taicpu(p).opcode := A_SUB;
  5103. taicpu(p).oper[0]^.val := -taicpu(p).oper[0]^.val;
  5104. end
  5105. else
  5106. DebugMsg(SPeepholeOptimization + 'ADD; ADD/SUB -> ADD',p);
  5107. RemoveInstruction(hp1);
  5108. end;
  5109. end
  5110. else
  5111. begin
  5112. { Make doubly sure the flags aren't in use because the order of additions may affect them }
  5113. TransferUsedRegs(TmpUsedRegs);
  5114. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5115. hp2 := p;
  5116. while not (cs_opt_level3 in current_settings.optimizerswitches) and
  5117. GetNextInstruction(hp2, hp2) and (hp2 <> hp1) do
  5118. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  5119. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  5120. begin
  5121. { Move the constant addition to after the reg/ref addition to improve optimisation }
  5122. DebugMsg(SPeepholeOptimization + 'Add/sub swap 1a done',p);
  5123. Asml.Remove(p);
  5124. Asml.InsertAfter(p, hp1);
  5125. p := hp1;
  5126. Result := True;
  5127. Exit;
  5128. end;
  5129. end;
  5130. end;
  5131. if DoArithCombineOpt(p) then
  5132. Result:=true;
  5133. end;
  5134. end;
  5135. function TX86AsmOptimizer.OptPass1LEA(var p : tai) : boolean;
  5136. var
  5137. hp1: tai;
  5138. ref: Integer;
  5139. saveref: treference;
  5140. offsetcalc: Int64;
  5141. TempReg: TRegister;
  5142. Multiple: TCGInt;
  5143. Adjacent: Boolean;
  5144. begin
  5145. Result:=false;
  5146. { play save and throw an error if LEA uses a seg register prefix,
  5147. this is most likely an error somewhere else }
  5148. if taicpu(p).oper[0]^.ref^.Segment<>NR_NO then
  5149. internalerror(2022022001);
  5150. { changes "lea (%reg1), %reg2" into "mov %reg1, %reg2" }
  5151. if (taicpu(p).oper[0]^.ref^.base <> NR_NO) and
  5152. (taicpu(p).oper[0]^.ref^.index = NR_NO) and
  5153. (
  5154. { do not mess with leas accessing the stack pointer
  5155. unless it's a null operation }
  5156. (taicpu(p).oper[1]^.reg <> NR_STACK_POINTER_REG) or
  5157. (
  5158. (taicpu(p).oper[0]^.ref^.base = NR_STACK_POINTER_REG) and
  5159. (taicpu(p).oper[0]^.ref^.offset = 0)
  5160. )
  5161. ) and
  5162. (not(Assigned(taicpu(p).oper[0]^.ref^.Symbol))) then
  5163. begin
  5164. if (taicpu(p).oper[0]^.ref^.offset = 0) then
  5165. begin
  5166. if (taicpu(p).oper[0]^.ref^.base <> taicpu(p).oper[1]^.reg) then
  5167. begin
  5168. taicpu(p).opcode := A_MOV;
  5169. taicpu(p).loadreg(0, taicpu(p).oper[0]^.ref^.base);
  5170. DebugMsg(SPeepholeOptimization + 'Lea2Mov done',p);
  5171. end
  5172. else
  5173. begin
  5174. DebugMsg(SPeepholeOptimization + 'Lea2Nop done',p);
  5175. RemoveCurrentP(p);
  5176. end;
  5177. Result:=true;
  5178. exit;
  5179. end
  5180. else if (
  5181. { continue to use lea to adjust the stack pointer,
  5182. it is the recommended way, but only if not optimizing for size }
  5183. (taicpu(p).oper[1]^.reg<>NR_STACK_POINTER_REG) or
  5184. (cs_opt_size in current_settings.optimizerswitches)
  5185. ) and
  5186. { If the flags register is in use, don't change the instruction
  5187. to an ADD otherwise this will scramble the flags. [Kit] }
  5188. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  5189. ConvertLEA(taicpu(p)) then
  5190. begin
  5191. Result:=true;
  5192. exit;
  5193. end;
  5194. end;
  5195. { Don't optimise if the stack or frame pointer is the destination register }
  5196. if (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG) or (taicpu(p).oper[1]^.reg=current_procinfo.framepointer) then
  5197. Exit;
  5198. if GetNextInstruction(p,hp1) and
  5199. (hp1.typ=ait_instruction) then
  5200. begin
  5201. if MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) and
  5202. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  5203. MatchOpType(Taicpu(hp1),top_reg,top_reg) then
  5204. begin
  5205. TransferUsedRegs(TmpUsedRegs);
  5206. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5207. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  5208. begin
  5209. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  5210. DebugMsg(SPeepholeOptimization + 'LeaMov2Lea done',p);
  5211. RemoveInstruction(hp1);
  5212. result:=true;
  5213. exit;
  5214. end;
  5215. end;
  5216. { changes
  5217. lea <ref1>, reg1
  5218. <op> ...,<ref. with reg1>,...
  5219. to
  5220. <op> ...,<ref1>,... }
  5221. { find a reference which uses reg1 }
  5222. if (taicpu(hp1).ops>=1) and (taicpu(hp1).oper[0]^.typ=top_ref) and RegInOp(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^) then
  5223. ref:=0
  5224. else if (taicpu(hp1).ops>=2) and (taicpu(hp1).oper[1]^.typ=top_ref) and RegInOp(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[1]^) then
  5225. ref:=1
  5226. else
  5227. ref:=-1;
  5228. if (ref<>-1) and
  5229. { reg1 must be either the base or the index }
  5230. ((taicpu(hp1).oper[ref]^.ref^.base=taicpu(p).oper[1]^.reg) xor (taicpu(hp1).oper[ref]^.ref^.index=taicpu(p).oper[1]^.reg)) then
  5231. begin
  5232. { reg1 can be removed from the reference }
  5233. saveref:=taicpu(hp1).oper[ref]^.ref^;
  5234. if taicpu(hp1).oper[ref]^.ref^.base=taicpu(p).oper[1]^.reg then
  5235. taicpu(hp1).oper[ref]^.ref^.base:=NR_NO
  5236. else if taicpu(hp1).oper[ref]^.ref^.index=taicpu(p).oper[1]^.reg then
  5237. taicpu(hp1).oper[ref]^.ref^.index:=NR_NO
  5238. else
  5239. Internalerror(2019111201);
  5240. { check if the can insert all data of the lea into the second instruction }
  5241. if ((taicpu(hp1).oper[ref]^.ref^.base=taicpu(p).oper[1]^.reg) or (taicpu(hp1).oper[ref]^.ref^.scalefactor <= 1)) and
  5242. ((taicpu(p).oper[0]^.ref^.base=NR_NO) or (taicpu(hp1).oper[ref]^.ref^.base=NR_NO)) and
  5243. ((taicpu(p).oper[0]^.ref^.index=NR_NO) or (taicpu(hp1).oper[ref]^.ref^.index=NR_NO)) and
  5244. ((taicpu(p).oper[0]^.ref^.symbol=nil) or (taicpu(hp1).oper[ref]^.ref^.symbol=nil)) and
  5245. ((taicpu(p).oper[0]^.ref^.relsymbol=nil) or (taicpu(hp1).oper[ref]^.ref^.relsymbol=nil)) and
  5246. ((taicpu(p).oper[0]^.ref^.scalefactor <= 1) or (taicpu(hp1).oper[ref]^.ref^.scalefactor <= 1)) and
  5247. (taicpu(p).oper[0]^.ref^.segment=NR_NO) and (taicpu(hp1).oper[ref]^.ref^.segment=NR_NO)
  5248. {$ifdef x86_64}
  5249. and (abs(taicpu(hp1).oper[ref]^.ref^.offset+taicpu(p).oper[0]^.ref^.offset)<=$7fffffff)
  5250. and (((taicpu(p).oper[0]^.ref^.base<>NR_RIP) and (taicpu(p).oper[0]^.ref^.index<>NR_RIP)) or
  5251. ((taicpu(hp1).oper[ref]^.ref^.base=NR_NO) and (taicpu(hp1).oper[ref]^.ref^.index=NR_NO))
  5252. )
  5253. {$endif x86_64}
  5254. then
  5255. begin
  5256. { reg1 might not used by the second instruction after it is remove from the reference }
  5257. if not(RegInInstruction(taicpu(p).oper[1]^.reg,taicpu(hp1))) then
  5258. begin
  5259. TransferUsedRegs(TmpUsedRegs);
  5260. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5261. { reg1 is not updated so it might not be used afterwards }
  5262. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  5263. begin
  5264. DebugMsg(SPeepholeOptimization + 'LeaOp2Op done',p);
  5265. if taicpu(p).oper[0]^.ref^.base<>NR_NO then
  5266. taicpu(hp1).oper[ref]^.ref^.base:=taicpu(p).oper[0]^.ref^.base;
  5267. if taicpu(p).oper[0]^.ref^.index<>NR_NO then
  5268. taicpu(hp1).oper[ref]^.ref^.index:=taicpu(p).oper[0]^.ref^.index;
  5269. if taicpu(p).oper[0]^.ref^.symbol<>nil then
  5270. taicpu(hp1).oper[ref]^.ref^.symbol:=taicpu(p).oper[0]^.ref^.symbol;
  5271. if taicpu(p).oper[0]^.ref^.relsymbol<>nil then
  5272. taicpu(hp1).oper[ref]^.ref^.relsymbol:=taicpu(p).oper[0]^.ref^.relsymbol;
  5273. if taicpu(p).oper[0]^.ref^.scalefactor > 1 then
  5274. taicpu(hp1).oper[ref]^.ref^.scalefactor:=taicpu(p).oper[0]^.ref^.scalefactor;
  5275. inc(taicpu(hp1).oper[ref]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset);
  5276. RemoveCurrentP(p, hp1);
  5277. result:=true;
  5278. exit;
  5279. end
  5280. end;
  5281. end;
  5282. { recover }
  5283. taicpu(hp1).oper[ref]^.ref^:=saveref;
  5284. end;
  5285. Adjacent := RegInInstruction(taicpu(p).oper[1]^.reg, hp1);
  5286. if Adjacent or
  5287. { Check further ahead (up to 2 instructions ahead for -O2) }
  5288. GetNextInstructionUsingReg(hp1,hp1,taicpu(p).oper[1]^.reg) then
  5289. begin
  5290. { Check common LEA/LEA conditions }
  5291. if MatchInstruction(hp1,A_LEA,[taicpu(p).opsize]) and
  5292. (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg) and
  5293. (taicpu(p).oper[0]^.ref^.relsymbol = nil) and
  5294. (taicpu(p).oper[0]^.ref^.segment = NR_NO) and
  5295. (taicpu(p).oper[0]^.ref^.symbol = nil) and
  5296. (taicpu(hp1).oper[0]^.ref^.relsymbol = nil) and
  5297. (taicpu(hp1).oper[0]^.ref^.segment = NR_NO) and
  5298. (taicpu(hp1).oper[0]^.ref^.symbol = nil) and
  5299. (
  5300. { If p and hp1 are adjacent, RegModifiedBetween always returns False, so avoid
  5301. calling it (since it calls GetNextInstruction) }
  5302. Adjacent or
  5303. (
  5304. (
  5305. (taicpu(p).oper[0]^.ref^.base = NR_NO) or { Don't call RegModifiedBetween unnecessarily }
  5306. not(RegModifiedBetween(taicpu(p).oper[0]^.ref^.base,p,hp1))
  5307. ) and (
  5308. (taicpu(p).oper[0]^.ref^.index = taicpu(p).oper[0]^.ref^.base) or { Don't call RegModifiedBetween unnecessarily }
  5309. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5310. not(RegModifiedBetween(taicpu(p).oper[0]^.ref^.index,p,hp1))
  5311. )
  5312. )
  5313. ) then
  5314. begin
  5315. { changes
  5316. lea offset1(regX,scale), reg1
  5317. lea offset2(reg1,reg1), reg2
  5318. to
  5319. lea (offset1*scale*2)+offset2(regX,scale*2), reg2
  5320. and
  5321. lea offset1(regX,scale1), reg1
  5322. lea offset2(reg1,scale2), reg2
  5323. to
  5324. lea (offset1*scale1*2)+offset2(regX,scale1*scale2), reg2
  5325. and
  5326. lea offset1(regX,scale1), reg1
  5327. lea offset2(reg3,reg1,scale2), reg2
  5328. to
  5329. lea (offset1*scale*2)+offset2(reg3,regX,scale1*scale2), reg2
  5330. ... so long as the final scale does not exceed 8
  5331. (Similarly, allow the first instruction to be "lea (regX,regX),reg1")
  5332. }
  5333. if (taicpu(p).oper[0]^.ref^.base<>NR_STACK_POINTER_REG) and { lea (%rsp,scale),reg is not a valid encoding }
  5334. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  5335. (
  5336. (taicpu(p).oper[0]^.ref^.base <> taicpu(p).oper[0]^.ref^.index) or
  5337. (taicpu(p).oper[0]^.ref^.scalefactor <= 1)
  5338. ) and (
  5339. (
  5340. { lea (reg1,scale2), reg2 variant }
  5341. (taicpu(hp1).oper[0]^.ref^.base <> taicpu(p).oper[1]^.reg) and
  5342. (
  5343. Adjacent or
  5344. not RegModifiedBetween(taicpu(hp1).oper[0]^.ref^.base, p, hp1)
  5345. ) and
  5346. (
  5347. (
  5348. (taicpu(p).oper[0]^.ref^.base = NR_NO) and
  5349. (taicpu(hp1).oper[0]^.ref^.scalefactor * taicpu(p).oper[0]^.ref^.scalefactor <= 8)
  5350. ) or (
  5351. { lea (regX,regX), reg1 variant }
  5352. (taicpu(p).oper[0]^.ref^.base = taicpu(p).oper[0]^.ref^.index) and
  5353. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 4)
  5354. )
  5355. )
  5356. ) or (
  5357. { lea (reg1,reg1), reg1 variant }
  5358. (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  5359. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 1)
  5360. )
  5361. ) then
  5362. begin
  5363. { Make everything homogeneous to make calculations easier }
  5364. if (taicpu(p).oper[0]^.ref^.base <> NR_NO) then
  5365. begin
  5366. if taicpu(p).oper[0]^.ref^.index <> NR_NO then
  5367. { Convert lea (regX,regX),reg1 to lea (regX,2),reg1 }
  5368. taicpu(p).oper[0]^.ref^.scalefactor := 2
  5369. else
  5370. taicpu(p).oper[0]^.ref^.index := taicpu(p).oper[0]^.ref^.base;
  5371. taicpu(p).oper[0]^.ref^.base := NR_NO;
  5372. end;
  5373. { Make sure the offset doesn't go out of range (use 64-bit arithmetic)}
  5374. offsetcalc := taicpu(hp1).oper[0]^.ref^.offset;
  5375. Inc(offsetcalc, Int64(taicpu(p).oper[0]^.ref^.offset) * max(taicpu(hp1).oper[0]^.ref^.scalefactor, 1));
  5376. if (offsetcalc <= $7FFFFFFF) and (offsetcalc >= -2147483648) then
  5377. begin
  5378. DebugMsg(SPeepholeOptimization + 'LeaLea2Lea 2 done',p);
  5379. if (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  5380. (taicpu(hp1).oper[0]^.ref^.index <> taicpu(p).oper[1]^.reg) then
  5381. begin
  5382. { Put the register to change in the index register }
  5383. TempReg := taicpu(hp1).oper[0]^.ref^.index;
  5384. taicpu(hp1).oper[0]^.ref^.index := taicpu(hp1).oper[0]^.ref^.base;
  5385. taicpu(hp1).oper[0]^.ref^.base := TempReg;
  5386. end;
  5387. if (taicpu(hp1).oper[0]^.ref^.base <> taicpu(p).oper[1]^.reg) then
  5388. begin
  5389. { Just to prevent miscalculations }
  5390. if (taicpu(hp1).oper[0]^.ref^.scalefactor = 0) then
  5391. taicpu(hp1).oper[0]^.ref^.scalefactor := taicpu(p).oper[0]^.ref^.scalefactor
  5392. else
  5393. taicpu(hp1).oper[0]^.ref^.scalefactor := taicpu(hp1).oper[0]^.ref^.scalefactor * max(taicpu(p).oper[0]^.ref^.scalefactor, 1);
  5394. end
  5395. else
  5396. begin
  5397. taicpu(hp1).oper[0]^.ref^.base := NR_NO;
  5398. taicpu(hp1).oper[0]^.ref^.scalefactor := taicpu(p).oper[0]^.ref^.scalefactor * 2;
  5399. end;
  5400. if (taicpu(p).oper[0]^.ref^.offset <> 0) then
  5401. Inc(taicpu(hp1).oper[0]^.ref^.offset, taicpu(p).oper[0]^.ref^.offset * max(taicpu(p).oper[0]^.ref^.scalefactor, 1));
  5402. taicpu(hp1).oper[0]^.ref^.index := taicpu(p).oper[0]^.ref^.index;
  5403. RemoveCurrentP(p);
  5404. result:=true;
  5405. exit;
  5406. end;
  5407. end;
  5408. { changes
  5409. lea offset1(regX), reg1
  5410. lea offset2(reg1), reg1
  5411. to
  5412. lea offset1+offset2(regX), reg1 }
  5413. if
  5414. (
  5415. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  5416. (taicpu(p).oper[0]^.ref^.index = NR_NO)
  5417. ) or (
  5418. (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  5419. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 1) and
  5420. (
  5421. (
  5422. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5423. (taicpu(p).oper[0]^.ref^.base = NR_NO)
  5424. ) or (
  5425. (taicpu(p).oper[0]^.ref^.scalefactor <= 1) and
  5426. (
  5427. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5428. (
  5429. (taicpu(p).oper[0]^.ref^.index = taicpu(p).oper[0]^.ref^.base) and
  5430. (
  5431. (taicpu(hp1).oper[0]^.ref^.index = NR_NO) or
  5432. (taicpu(hp1).oper[0]^.ref^.base = NR_NO)
  5433. )
  5434. )
  5435. )
  5436. )
  5437. )
  5438. ) then
  5439. begin
  5440. DebugMsg(SPeepholeOptimization + 'LeaLea2Lea 1 done',p);
  5441. if taicpu(hp1).oper[0]^.ref^.index=taicpu(p).oper[1]^.reg then
  5442. begin
  5443. taicpu(hp1).oper[0]^.ref^.index:=taicpu(p).oper[0]^.ref^.base;
  5444. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset*max(taicpu(hp1).oper[0]^.ref^.scalefactor,1));
  5445. { if the register is used as index and base, we have to increase for base as well
  5446. and adapt base }
  5447. if taicpu(hp1).oper[0]^.ref^.base=taicpu(p).oper[1]^.reg then
  5448. begin
  5449. taicpu(hp1).oper[0]^.ref^.base:=taicpu(p).oper[0]^.ref^.base;
  5450. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset);
  5451. end;
  5452. end
  5453. else
  5454. begin
  5455. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset);
  5456. taicpu(hp1).oper[0]^.ref^.base:=taicpu(p).oper[0]^.ref^.base;
  5457. end;
  5458. if taicpu(p).oper[0]^.ref^.index<>NR_NO then
  5459. begin
  5460. taicpu(hp1).oper[0]^.ref^.base:=taicpu(hp1).oper[0]^.ref^.index;
  5461. taicpu(hp1).oper[0]^.ref^.index:=taicpu(p).oper[0]^.ref^.index;
  5462. taicpu(hp1).oper[0]^.ref^.scalefactor:=taicpu(p).oper[0]^.ref^.scalefactor;
  5463. end;
  5464. RemoveCurrentP(p);
  5465. result:=true;
  5466. exit;
  5467. end;
  5468. end;
  5469. { Change:
  5470. leal/q $x(%reg1),%reg2
  5471. ...
  5472. shll/q $y,%reg2
  5473. To:
  5474. leal/q $(x+2^y)(%reg1,2^y),%reg2 (if y <= 3)
  5475. }
  5476. if (taicpu(p).oper[0]^.ref^.base<>NR_STACK_POINTER_REG) and { lea (%rsp,scale),reg is not a valid encoding }
  5477. MatchInstruction(hp1, A_SHL, [taicpu(p).opsize]) and
  5478. MatchOpType(taicpu(hp1), top_const, top_reg) and
  5479. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  5480. (taicpu(hp1).oper[0]^.val <= 3) then
  5481. begin
  5482. Multiple := 1 shl taicpu(hp1).oper[0]^.val;
  5483. TransferUsedRegs(TmpUsedRegs);
  5484. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  5485. if
  5486. { This allows the optimisation in some circumstances even if the lea instruction already has a scale factor
  5487. (this works even if scalefactor is zero) }
  5488. ((Multiple * taicpu(p).oper[0]^.ref^.scalefactor) <= 8) and
  5489. { Ensure offset doesn't go out of bounds }
  5490. (abs(taicpu(p).oper[0]^.ref^.offset * Multiple) <= $7FFFFFFF) and
  5491. not (RegInUsedRegs(NR_DEFAULTFLAGS,TmpUsedRegs)) and
  5492. (
  5493. (
  5494. not SuperRegistersEqual(taicpu(p).oper[0]^.ref^.base, taicpu(p).oper[1]^.reg) and
  5495. (
  5496. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5497. (taicpu(p).oper[0]^.ref^.index = NR_INVALID) or
  5498. (
  5499. { Check for lea $x(%reg1,%reg1),%reg2 and treat as it it were lea $x(%reg1,2),%reg2 }
  5500. (taicpu(p).oper[0]^.ref^.index = taicpu(p).oper[0]^.ref^.base) and
  5501. (taicpu(p).oper[0]^.ref^.scalefactor <= 1)
  5502. )
  5503. )
  5504. ) or (
  5505. (
  5506. (taicpu(p).oper[0]^.ref^.base = NR_NO) or
  5507. (taicpu(p).oper[0]^.ref^.base = NR_INVALID)
  5508. ) and
  5509. not SuperRegistersEqual(taicpu(p).oper[0]^.ref^.index, taicpu(p).oper[1]^.reg)
  5510. )
  5511. ) then
  5512. begin
  5513. repeat
  5514. with taicpu(p).oper[0]^.ref^ do
  5515. begin
  5516. { Convert lea $x(%reg1,%reg1),%reg2 to lea $x(%reg1,2),%reg2 }
  5517. if index = base then
  5518. begin
  5519. if Multiple > 4 then
  5520. { Optimisation will no longer work because resultant
  5521. scale factor will exceed 8 }
  5522. Break;
  5523. base := NR_NO;
  5524. scalefactor := 2;
  5525. DebugMsg(SPeepholeOptimization + 'lea $x(%reg1,%reg1),%reg2 -> lea $x(%reg1,2),%reg2 for following optimisation', p);
  5526. end
  5527. else if (base <> NR_NO) and (base <> NR_INVALID) then
  5528. begin
  5529. { Scale factor only works on the index register }
  5530. index := base;
  5531. base := NR_NO;
  5532. end;
  5533. { For safety }
  5534. if scalefactor <= 1 then
  5535. begin
  5536. DebugMsg(SPeepholeOptimization + 'LeaShl2Lea 1', p);
  5537. scalefactor := Multiple;
  5538. end
  5539. else
  5540. begin
  5541. DebugMsg(SPeepholeOptimization + 'LeaShl2Lea 2', p);
  5542. scalefactor := scalefactor * Multiple;
  5543. end;
  5544. offset := offset * Multiple;
  5545. end;
  5546. RemoveInstruction(hp1);
  5547. Result := True;
  5548. Exit;
  5549. { This repeat..until loop exists for the benefit of Break }
  5550. until True;
  5551. end;
  5552. end;
  5553. end;
  5554. end;
  5555. end;
  5556. function TX86AsmOptimizer.DoArithCombineOpt(var p: tai): Boolean;
  5557. var
  5558. hp1 : tai;
  5559. SubInstr: Boolean;
  5560. ThisConst: TCGInt;
  5561. const
  5562. OverflowMin: array[S_B..S_Q] of TCGInt = (-128, -32768, -2147483648, -2147483648);
  5563. { Note: 64-bit-sized arithmetic instructions can only take signed 32-bit immediates }
  5564. OverflowMax: array[S_B..S_Q] of TCGInt = ( 255, 65535, $FFFFFFFF, 2147483647);
  5565. begin
  5566. Result := False;
  5567. if taicpu(p).oper[0]^.typ <> top_const then
  5568. { Should have been confirmed before calling }
  5569. InternalError(2021102601);
  5570. SubInstr := (taicpu(p).opcode = A_SUB);
  5571. if GetLastInstruction(p, hp1) and
  5572. (hp1.typ = ait_instruction) and
  5573. (taicpu(hp1).opsize = taicpu(p).opsize) then
  5574. begin
  5575. if not (taicpu(p).opsize in [S_B, S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  5576. { Bad size }
  5577. InternalError(2022042001);
  5578. case taicpu(hp1).opcode Of
  5579. A_INC:
  5580. if MatchOperand(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  5581. begin
  5582. if SubInstr then
  5583. ThisConst := taicpu(p).oper[0]^.val - 1
  5584. else
  5585. ThisConst := taicpu(p).oper[0]^.val + 1;
  5586. end
  5587. else
  5588. Exit;
  5589. A_DEC:
  5590. if MatchOperand(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  5591. begin
  5592. if SubInstr then
  5593. ThisConst := taicpu(p).oper[0]^.val + 1
  5594. else
  5595. ThisConst := taicpu(p).oper[0]^.val - 1;
  5596. end
  5597. else
  5598. Exit;
  5599. A_SUB:
  5600. if (taicpu(hp1).oper[0]^.typ = top_const) and
  5601. MatchOperand(taicpu(hp1).oper[1]^,taicpu(p).oper[1]^) then
  5602. begin
  5603. if SubInstr then
  5604. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val
  5605. else
  5606. ThisConst := taicpu(p).oper[0]^.val - taicpu(hp1).oper[0]^.val;
  5607. end
  5608. else
  5609. Exit;
  5610. A_ADD:
  5611. if (taicpu(hp1).oper[0]^.typ = top_const) and
  5612. MatchOperand(taicpu(hp1).oper[1]^,taicpu(p).oper[1]^) then
  5613. begin
  5614. if SubInstr then
  5615. ThisConst := taicpu(p).oper[0]^.val - taicpu(hp1).oper[0]^.val
  5616. else
  5617. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val;
  5618. end
  5619. else
  5620. Exit;
  5621. else
  5622. Exit;
  5623. end;
  5624. { Check that the values are in range }
  5625. if (ThisConst < OverflowMin[taicpu(p).opsize]) or (ThisConst > OverflowMax[taicpu(p).opsize]) then
  5626. { Overflow; abort }
  5627. Exit;
  5628. if (ThisConst = 0) then
  5629. begin
  5630. DebugMsg(SPeepholeOptimization + 'Arithmetic combine: ' +
  5631. debug_op2str(taicpu(hp1).opcode) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + debug_operstr(taicpu(hp1).oper[1]^) + '; ' +
  5632. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(taicpu(p).oper[0]^.val) + ',' + debug_operstr(taicpu(p).oper[1]^) + ' cancel out (NOP)', p);
  5633. RemoveInstruction(hp1);
  5634. hp1 := tai(p.next);
  5635. RemoveInstruction(p); { Note, the choice to not use RemoveCurrentp is deliberate }
  5636. if not GetLastInstruction(hp1, p) then
  5637. p := hp1;
  5638. end
  5639. else
  5640. begin
  5641. if taicpu(hp1).opercnt=1 then
  5642. DebugMsg(SPeepholeOptimization + 'Arithmetic combine: ' +
  5643. debug_op2str(taicpu(hp1).opcode) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + '; ' +
  5644. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(taicpu(p).oper[0]^.val) + ',' + debug_operstr(taicpu(p).oper[1]^) + ' -> ' +
  5645. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(ThisConst) + ' ' + debug_operstr(taicpu(p).oper[1]^), p)
  5646. else
  5647. DebugMsg(SPeepholeOptimization + 'Arithmetic combine: ' +
  5648. debug_op2str(taicpu(hp1).opcode) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + debug_operstr(taicpu(hp1).oper[1]^) + '; ' +
  5649. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(taicpu(p).oper[0]^.val) + ',' + debug_operstr(taicpu(p).oper[1]^) + ' -> ' +
  5650. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(ThisConst) + ' ' + debug_operstr(taicpu(p).oper[1]^), p);
  5651. RemoveInstruction(hp1);
  5652. taicpu(p).loadconst(0, ThisConst);
  5653. end;
  5654. Result := True;
  5655. end;
  5656. end;
  5657. function TX86AsmOptimizer.DoMovCmpMemOpt(var p : tai; const hp1: tai; UpdateTmpUsedRegs: Boolean) : Boolean;
  5658. begin
  5659. Result := False;
  5660. if UpdateTmpUsedRegs then
  5661. TransferUsedRegs(TmpUsedRegs);
  5662. if MatchOpType(taicpu(p),top_ref,top_reg) and
  5663. { The x86 assemblers have difficulty comparing values against absolute addresses }
  5664. (taicpu(p).oper[0]^.ref^.refaddr <> addr_full) and
  5665. (taicpu(hp1).oper[0]^.typ <> top_ref) and
  5666. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  5667. (
  5668. (
  5669. (taicpu(hp1).opcode = A_TEST)
  5670. ) or (
  5671. (taicpu(hp1).opcode = A_CMP) and
  5672. { A sanity check more than anything }
  5673. not MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg)
  5674. )
  5675. ) then
  5676. begin
  5677. { change
  5678. mov mem, %reg
  5679. cmp/test x, %reg / test %reg,%reg
  5680. (reg deallocated)
  5681. to
  5682. cmp/test x, mem / cmp 0, mem
  5683. }
  5684. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  5685. if not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) then
  5686. begin
  5687. { Convert test %reg,%reg or test $-1,%reg to cmp $0,mem }
  5688. if (taicpu(hp1).opcode = A_TEST) and
  5689. (
  5690. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) or
  5691. MatchOperand(taicpu(hp1).oper[0]^, -1)
  5692. ) then
  5693. begin
  5694. taicpu(hp1).opcode := A_CMP;
  5695. taicpu(hp1).loadconst(0, 0);
  5696. end;
  5697. taicpu(hp1).loadref(1, taicpu(p).oper[0]^.ref^);
  5698. DebugMsg(SPeepholeOptimization + 'MOV/CMP -> CMP (memory check)', p);
  5699. RemoveCurrentP(p, hp1);
  5700. Result := True;
  5701. Exit;
  5702. end;
  5703. end;
  5704. end;
  5705. function TX86AsmOptimizer.DoSETccLblRETOpt(var p: tai; const hp_label: tai_label) : Boolean;
  5706. var
  5707. hp_allocstart, hp_pos, hp2, hp3, hp4, hp5, hp6: tai;
  5708. ThisReg, SecondReg: TRegister;
  5709. JumpLoc: TAsmLabel;
  5710. NewSize: TOpSize;
  5711. begin
  5712. Result := False;
  5713. {
  5714. Convert:
  5715. j<c> .L1
  5716. .L2:
  5717. mov 1,reg
  5718. jmp .L3 (or ret, although it might not be a RET yet)
  5719. .L1:
  5720. mov 0,reg
  5721. jmp .L3 (or ret)
  5722. ( As long as .L3 <> .L1 or .L2)
  5723. To:
  5724. mov 0,reg
  5725. set<not(c)> reg
  5726. jmp .L3 (or ret)
  5727. .L2:
  5728. mov 1,reg
  5729. jmp .L3 (or ret)
  5730. .L1:
  5731. mov 0,reg
  5732. jmp .L3 (or ret)
  5733. }
  5734. if JumpTargetOp(taicpu(p))^.ref^.refaddr<>addr_full then
  5735. Exit;
  5736. JumpLoc := TAsmLabel(JumpTargetOp(taicpu(p))^.ref^.symbol);
  5737. if GetNextInstruction(hp_label, hp2) and
  5738. MatchInstruction(hp2,A_MOV,[]) and
  5739. (taicpu(hp2).oper[0]^.typ = top_const) and
  5740. (
  5741. (
  5742. (taicpu(hp2).oper[1]^.typ = top_reg)
  5743. {$ifdef i386}
  5744. { Under i386, ESI, EDI, EBP and ESP
  5745. don't have an 8-bit representation }
  5746. and not (getsupreg(taicpu(hp2).oper[1]^.reg) in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  5747. {$endif i386}
  5748. ) or (
  5749. {$ifdef i386}
  5750. (taicpu(hp2).oper[1]^.typ <> top_reg) and
  5751. {$endif i386}
  5752. (taicpu(hp2).opsize = S_B)
  5753. )
  5754. ) and
  5755. GetNextInstruction(hp2, hp3) and
  5756. MatchInstruction(hp3, A_JMP, A_RET, []) and
  5757. (
  5758. (taicpu(hp3).opcode=A_RET) or
  5759. (
  5760. (taicpu(hp3).oper[0]^.ref^.refaddr=addr_full) and
  5761. (tasmlabel(taicpu(hp3).oper[0]^.ref^.symbol)<>tai_label(hp_label).labsym)
  5762. )
  5763. ) and
  5764. GetNextInstruction(hp3, hp4) and
  5765. SkipAligns(hp4, hp4) and
  5766. (hp4.typ=ait_label) and
  5767. (tai_label(hp4).labsym=JumpLoc) and
  5768. (
  5769. not (cs_opt_size in current_settings.optimizerswitches) or
  5770. { If the initial jump is the label's only reference, then it will
  5771. become a dead label if the other conditions are met and hence
  5772. remove at least 2 instructions, including a jump }
  5773. (JumpLoc.getrefs = 1)
  5774. ) and
  5775. { Don't check if hp3 jumps to hp4 because this is a zero-distance jump
  5776. that will be optimised out }
  5777. GetNextInstruction(hp4, hp5) and
  5778. MatchInstruction(hp5,A_MOV,[taicpu(hp2).opsize]) and
  5779. (taicpu(hp5).oper[0]^.typ = top_const) and
  5780. (
  5781. ((taicpu(hp2).oper[0]^.val = 0) and (taicpu(hp5).oper[0]^.val = 1)) or
  5782. ((taicpu(hp2).oper[0]^.val = 1) and (taicpu(hp5).oper[0]^.val = 0))
  5783. ) and
  5784. MatchOperand(taicpu(hp2).oper[1]^,taicpu(hp5).oper[1]^) and
  5785. GetNextInstruction(hp5,hp6) and
  5786. (
  5787. (hp6.typ<>ait_label) or
  5788. SkipLabels(hp6, hp6)
  5789. ) and
  5790. (hp6.typ=ait_instruction) then
  5791. begin
  5792. { First, let's look at the two jumps that are hp3 and hp6 }
  5793. if not
  5794. (
  5795. (taicpu(hp6).opcode=taicpu(hp3).opcode) and { Both RET or both JMP to the same label }
  5796. (
  5797. (taicpu(hp6).opcode=A_RET) or
  5798. MatchOperand(taicpu(hp6).oper[0]^, taicpu(hp3).oper[0]^)
  5799. )
  5800. ) then
  5801. { If condition is False, then the JMP/RET instructions matched conventionally }
  5802. begin
  5803. { See if one of the jumps can be instantly converted into a RET }
  5804. if (taicpu(hp3).opcode=A_JMP) then
  5805. begin
  5806. { Reuse hp5 }
  5807. hp5 := getlabelwithsym(TAsmLabel(JumpTargetOp(taicpu(hp3))^.ref^.symbol));
  5808. { Make sure hp5 doesn't jump back to .L2 (infinite loop) }
  5809. if not Assigned(hp5) or (hp5=hp4) or not GetNextInstruction(hp5, hp5) then
  5810. Exit;
  5811. if MatchInstruction(hp5, A_RET, []) then
  5812. begin
  5813. DebugMsg(SPeepholeOptimization + 'Converted JMP to RET as part of SETcc optimisation (1st jump)', hp3);
  5814. ConvertJumpToRET(hp3, hp5);
  5815. Result := True;
  5816. end
  5817. else
  5818. Exit;
  5819. end;
  5820. if (taicpu(hp6).opcode=A_JMP) then
  5821. begin
  5822. { Reuse hp5 }
  5823. hp5 := getlabelwithsym(TAsmLabel(JumpTargetOp(taicpu(hp6))^.ref^.symbol));
  5824. if not Assigned(hp5) or not GetNextInstruction(hp5, hp5) then
  5825. Exit;
  5826. if MatchInstruction(hp5, A_RET, []) then
  5827. begin
  5828. DebugMsg(SPeepholeOptimization + 'Converted JMP to RET as part of SETcc optimisation (2nd jump)', hp6);
  5829. ConvertJumpToRET(hp6, hp5);
  5830. Result := True;
  5831. end
  5832. else
  5833. Exit;
  5834. end;
  5835. if not
  5836. (
  5837. (taicpu(hp6).opcode=taicpu(hp3).opcode) and { Both RET or both JMP to the same label }
  5838. (
  5839. (taicpu(hp6).opcode=A_RET) or
  5840. MatchOperand(taicpu(hp6).oper[0]^, taicpu(hp3).oper[0]^)
  5841. )
  5842. ) then
  5843. { Still doesn't match }
  5844. Exit;
  5845. end;
  5846. if (taicpu(hp2).oper[0]^.val = 1) then
  5847. begin
  5848. taicpu(p).condition := inverse_cond(taicpu(p).condition);
  5849. DebugMsg(SPeepholeOptimization + 'J(c)Mov1Jmp/RetMov0Jmp/Ret -> Set(~c)Jmp/Ret',p)
  5850. end
  5851. else
  5852. DebugMsg(SPeepholeOptimization + 'J(c)Mov0Jmp/RetMov1Jmp/Ret -> Set(c)Jmp/Ret',p);
  5853. if taicpu(hp2).opsize=S_B then
  5854. begin
  5855. if taicpu(hp2).oper[1]^.typ = top_reg then
  5856. begin
  5857. SecondReg := taicpu(hp2).oper[1]^.reg;
  5858. hp4:=taicpu.op_reg(A_SETcc, S_B, SecondReg);
  5859. end
  5860. else
  5861. begin
  5862. hp4:=taicpu.op_ref(A_SETcc, S_B, taicpu(hp2).oper[1]^.ref^);
  5863. SecondReg := NR_NO;
  5864. end;
  5865. hp_pos := p;
  5866. hp_allocstart := hp4;
  5867. end
  5868. else
  5869. begin
  5870. { Will be a register because the size can't be S_B otherwise }
  5871. SecondReg:=taicpu(hp2).oper[1]^.reg;
  5872. ThisReg:=newreg(R_INTREGISTER,getsupreg(SecondReg), R_SUBL);
  5873. hp4:=taicpu.op_reg(A_SETcc, S_B, ThisReg);
  5874. if (cs_opt_size in current_settings.optimizerswitches) then
  5875. begin
  5876. { Favour using MOVZX when optimising for size }
  5877. case taicpu(hp2).opsize of
  5878. S_W:
  5879. NewSize := S_BW;
  5880. S_L:
  5881. NewSize := S_BL;
  5882. {$ifdef x86_64}
  5883. S_Q:
  5884. begin
  5885. NewSize := S_BL;
  5886. { Will implicitly zero-extend to 64-bit }
  5887. setsubreg(SecondReg, R_SUBD);
  5888. end;
  5889. {$endif x86_64}
  5890. else
  5891. InternalError(2022101301);
  5892. end;
  5893. hp5:=taicpu.op_reg_reg(A_MOVZX, NewSize, ThisReg, SecondReg);
  5894. { Inserting it right before p will guarantee that the flags are also tracked }
  5895. Asml.InsertBefore(hp5, p);
  5896. { Make sure the SET instruction gets inserted before the MOVZX instruction }
  5897. hp_pos := hp5;
  5898. hp_allocstart := hp4;
  5899. end
  5900. else
  5901. begin
  5902. hp5:=taicpu.op_const_reg(A_MOV, taicpu(hp2).opsize, 0, SecondReg);
  5903. { Inserting it right before p will guarantee that the flags are also tracked }
  5904. Asml.InsertBefore(hp5, p);
  5905. hp_pos := p;
  5906. hp_allocstart := hp5;
  5907. end;
  5908. taicpu(hp5).fileinfo:=taicpu(p).fileinfo;
  5909. end;
  5910. taicpu(hp4).fileinfo := taicpu(p).fileinfo;
  5911. taicpu(hp4).condition := taicpu(p).condition;
  5912. asml.InsertBefore(hp4, hp_pos);
  5913. if taicpu(hp3).is_jmp then
  5914. begin
  5915. JumpLoc.decrefs;
  5916. MakeUnconditional(taicpu(p));
  5917. taicpu(p).loadref(0, JumpTargetOp(taicpu(hp3))^.ref^);
  5918. TAsmLabel(JumpTargetOp(taicpu(hp3))^.ref^.symbol).increfs;
  5919. end
  5920. else
  5921. ConvertJumpToRET(p, hp3);
  5922. if SecondReg <> NR_NO then
  5923. { Ensure the destination register is allocated over this region }
  5924. AllocRegBetween(SecondReg, hp_allocstart, p, UsedRegs);
  5925. if (JumpLoc.getrefs = 0) then
  5926. RemoveDeadCodeAfterJump(hp3);
  5927. Result:=true;
  5928. exit;
  5929. end;
  5930. end;
  5931. function TX86AsmOptimizer.OptPass1Sub(var p : tai) : boolean;
  5932. var
  5933. hp1, hp2: tai;
  5934. ActiveReg: TRegister;
  5935. OldOffset: asizeint;
  5936. ThisConst: TCGInt;
  5937. function RegDeallocated: Boolean;
  5938. begin
  5939. TransferUsedRegs(TmpUsedRegs);
  5940. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5941. Result := not(RegUsedAfterInstruction(ActiveReg,hp1,TmpUsedRegs))
  5942. end;
  5943. begin
  5944. Result:=false;
  5945. hp1 := nil;
  5946. { replace
  5947. subX const,%reg1
  5948. leaX (%reg1,%reg1,Y),%reg2 // Base or index might not be equal to reg1
  5949. dealloc %reg1
  5950. by
  5951. leaX -const-const*Y(%reg1,%reg1,Y),%reg2
  5952. }
  5953. if MatchOpType(taicpu(p),top_const,top_reg) then
  5954. begin
  5955. ActiveReg := taicpu(p).oper[1]^.reg;
  5956. { Ensures the entire register was updated }
  5957. if (taicpu(p).opsize >= S_L) and
  5958. GetNextInstructionUsingReg(p,hp1, ActiveReg) and
  5959. MatchInstruction(hp1,A_LEA,[]) and
  5960. (SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.base) or
  5961. SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.index)) and
  5962. (
  5963. { Cover the case where the register in the reference is also the destination register }
  5964. Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, ActiveReg) or
  5965. (
  5966. { Try to avoid the expensive check of RegUsedAfterInstruction if we know it will return False }
  5967. not SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ActiveReg) and
  5968. RegDeallocated
  5969. )
  5970. ) then
  5971. begin
  5972. OldOffset := taicpu(hp1).oper[0]^.ref^.offset;
  5973. if ActiveReg=taicpu(hp1).oper[0]^.ref^.base then
  5974. Dec(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val);
  5975. if ActiveReg=taicpu(hp1).oper[0]^.ref^.index then
  5976. Dec(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val*max(taicpu(hp1).oper[0]^.ref^.scalefactor,1));
  5977. {$ifdef x86_64}
  5978. if (taicpu(hp1).oper[0]^.ref^.offset > $7FFFFFFF) or (taicpu(hp1).oper[0]^.ref^.offset < -2147483648) then
  5979. begin
  5980. { Overflow; abort }
  5981. taicpu(hp1).oper[0]^.ref^.offset := OldOffset;
  5982. end
  5983. else
  5984. {$endif x86_64}
  5985. begin
  5986. DebugMsg(SPeepholeOptimization + 'SubLea2Lea done',p);
  5987. if not (cs_opt_level3 in current_settings.optimizerswitches) then
  5988. { hp1 is the immediate next instruction for sure - good for a quick speed boost }
  5989. RemoveCurrentP(p, hp1)
  5990. else
  5991. RemoveCurrentP(p);
  5992. result:=true;
  5993. Exit;
  5994. end;
  5995. end;
  5996. if (
  5997. { Save calling GetNextInstructionUsingReg again }
  5998. Assigned(hp1) or
  5999. GetNextInstructionUsingReg(p,hp1, ActiveReg)
  6000. ) and
  6001. MatchInstruction(hp1,A_SUB,[taicpu(p).opsize]) and
  6002. (taicpu(hp1).oper[1]^.reg = ActiveReg) then
  6003. begin
  6004. if taicpu(hp1).oper[0]^.typ = top_const then
  6005. begin
  6006. { Merge add const1,%reg; add const2,%reg to add const1+const2,%reg }
  6007. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val;
  6008. Result := True;
  6009. { Handle any overflows }
  6010. case taicpu(p).opsize of
  6011. S_B:
  6012. taicpu(p).oper[0]^.val := ThisConst and $FF;
  6013. S_W:
  6014. taicpu(p).oper[0]^.val := ThisConst and $FFFF;
  6015. S_L:
  6016. taicpu(p).oper[0]^.val := ThisConst and $FFFFFFFF;
  6017. {$ifdef x86_64}
  6018. S_Q:
  6019. if (ThisConst > $7FFFFFFF) or (ThisConst < -2147483648) then
  6020. { Overflow; abort }
  6021. Result := False
  6022. else
  6023. taicpu(p).oper[0]^.val := ThisConst;
  6024. {$endif x86_64}
  6025. else
  6026. InternalError(2021102611);
  6027. end;
  6028. { Result may get set to False again if the combined immediate overflows for S_Q sizes }
  6029. if Result then
  6030. begin
  6031. if (taicpu(p).oper[0]^.val < 0) and
  6032. (
  6033. ((taicpu(p).opsize = S_B) and (taicpu(p).oper[0]^.val <> -128)) or
  6034. ((taicpu(p).opsize = S_W) and (taicpu(p).oper[0]^.val <> -32768)) or
  6035. ((taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) and (taicpu(p).oper[0]^.val <> -2147483648))
  6036. ) then
  6037. begin
  6038. DebugMsg(SPeepholeOptimization + 'SUB; ADD/SUB -> ADD',p);
  6039. taicpu(p).opcode := A_SUB;
  6040. taicpu(p).oper[0]^.val := -taicpu(p).oper[0]^.val;
  6041. end
  6042. else
  6043. DebugMsg(SPeepholeOptimization + 'SUB; ADD/SUB -> SUB',p);
  6044. RemoveInstruction(hp1);
  6045. end;
  6046. end
  6047. else
  6048. begin
  6049. { Make doubly sure the flags aren't in use because the order of subtractions may affect them }
  6050. TransferUsedRegs(TmpUsedRegs);
  6051. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  6052. hp2 := p;
  6053. while not (cs_opt_level3 in current_settings.optimizerswitches) and
  6054. GetNextInstruction(hp2, hp2) and (hp2 <> hp1) do
  6055. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  6056. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  6057. begin
  6058. { Move the constant subtraction to after the reg/ref addition to improve optimisation }
  6059. DebugMsg(SPeepholeOptimization + 'Add/sub swap 1b done',p);
  6060. Asml.Remove(p);
  6061. Asml.InsertAfter(p, hp1);
  6062. p := hp1;
  6063. Result := True;
  6064. Exit;
  6065. end;
  6066. end;
  6067. end;
  6068. { * change "subl $2, %esp; pushw x" to "pushl x"}
  6069. { * change "sub/add const1, reg" or "dec reg" followed by
  6070. "sub const2, reg" to one "sub ..., reg" }
  6071. {$ifdef i386}
  6072. if (taicpu(p).oper[0]^.val = 2) and
  6073. (ActiveReg = NR_ESP) and
  6074. { Don't do the sub/push optimization if the sub }
  6075. { comes from setting up the stack frame (JM) }
  6076. (not(GetLastInstruction(p,hp1)) or
  6077. not(MatchInstruction(hp1,A_MOV,[S_L]) and
  6078. MatchOperand(taicpu(hp1).oper[0]^,NR_ESP) and
  6079. MatchOperand(taicpu(hp1).oper[0]^,NR_EBP))) then
  6080. begin
  6081. hp1 := tai(p.next);
  6082. while Assigned(hp1) and
  6083. (tai(hp1).typ in [ait_instruction]+SkipInstr) and
  6084. not RegReadByInstruction(NR_ESP,hp1) and
  6085. not RegModifiedByInstruction(NR_ESP,hp1) do
  6086. hp1 := tai(hp1.next);
  6087. if Assigned(hp1) and
  6088. MatchInstruction(hp1,A_PUSH,[S_W]) then
  6089. begin
  6090. taicpu(hp1).changeopsize(S_L);
  6091. if taicpu(hp1).oper[0]^.typ=top_reg then
  6092. setsubreg(taicpu(hp1).oper[0]^.reg,R_SUBWHOLE);
  6093. hp1 := tai(p.next);
  6094. RemoveCurrentp(p, hp1);
  6095. Result:=true;
  6096. exit;
  6097. end;
  6098. end;
  6099. {$endif i386}
  6100. if DoArithCombineOpt(p) then
  6101. Result:=true;
  6102. end;
  6103. end;
  6104. function TX86AsmOptimizer.OptPass1SHLSAL(var p : tai) : boolean;
  6105. var
  6106. TmpBool1,TmpBool2 : Boolean;
  6107. tmpref : treference;
  6108. hp1,hp2: tai;
  6109. mask, shiftval: tcgint;
  6110. begin
  6111. Result:=false;
  6112. { All these optimisations work on "shl/sal const,%reg" }
  6113. if not MatchOpType(taicpu(p),top_const,top_reg) then
  6114. Exit;
  6115. if (taicpu(p).opsize in [S_L{$ifdef x86_64},S_Q{$endif x86_64}]) and
  6116. (taicpu(p).oper[0]^.val <= 3) then
  6117. { Changes "shl const, %reg32; add const/reg, %reg32" to one lea statement }
  6118. begin
  6119. { should we check the next instruction? }
  6120. TmpBool1 := True;
  6121. { have we found an add/sub which could be
  6122. integrated in the lea? }
  6123. TmpBool2 := False;
  6124. reference_reset(tmpref,2,[]);
  6125. TmpRef.index := taicpu(p).oper[1]^.reg;
  6126. TmpRef.scalefactor := 1 shl taicpu(p).oper[0]^.val;
  6127. while TmpBool1 and
  6128. GetNextInstruction(p, hp1) and
  6129. (tai(hp1).typ = ait_instruction) and
  6130. ((((taicpu(hp1).opcode = A_ADD) or
  6131. (taicpu(hp1).opcode = A_SUB)) and
  6132. (taicpu(hp1).oper[1]^.typ = Top_Reg) and
  6133. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg)) or
  6134. (((taicpu(hp1).opcode = A_INC) or
  6135. (taicpu(hp1).opcode = A_DEC)) and
  6136. (taicpu(hp1).oper[0]^.typ = Top_Reg) and
  6137. (taicpu(hp1).oper[0]^.reg = taicpu(p).oper[1]^.reg)) or
  6138. ((taicpu(hp1).opcode = A_LEA) and
  6139. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  6140. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg))) and
  6141. (not GetNextInstruction(hp1,hp2) or
  6142. not instrReadsFlags(hp2)) Do
  6143. begin
  6144. TmpBool1 := False;
  6145. if taicpu(hp1).opcode=A_LEA then
  6146. begin
  6147. if (TmpRef.base = NR_NO) and
  6148. (taicpu(hp1).oper[0]^.ref^.symbol=nil) and
  6149. (taicpu(hp1).oper[0]^.ref^.relsymbol=nil) and
  6150. { Segment register isn't a concern here }
  6151. ((taicpu(hp1).oper[0]^.ref^.scalefactor=0) or
  6152. (taicpu(hp1).oper[0]^.ref^.scalefactor*tmpref.scalefactor<=8)) then
  6153. begin
  6154. TmpBool1 := True;
  6155. TmpBool2 := True;
  6156. inc(TmpRef.offset, taicpu(hp1).oper[0]^.ref^.offset);
  6157. if taicpu(hp1).oper[0]^.ref^.scalefactor<>0 then
  6158. tmpref.scalefactor:=tmpref.scalefactor*taicpu(hp1).oper[0]^.ref^.scalefactor;
  6159. TmpRef.base := taicpu(hp1).oper[0]^.ref^.base;
  6160. RemoveInstruction(hp1);
  6161. end
  6162. end
  6163. else if (taicpu(hp1).oper[0]^.typ = Top_Const) then
  6164. begin
  6165. TmpBool1 := True;
  6166. TmpBool2 := True;
  6167. case taicpu(hp1).opcode of
  6168. A_ADD:
  6169. inc(TmpRef.offset, longint(taicpu(hp1).oper[0]^.val));
  6170. A_SUB:
  6171. dec(TmpRef.offset, longint(taicpu(hp1).oper[0]^.val));
  6172. else
  6173. internalerror(2019050536);
  6174. end;
  6175. RemoveInstruction(hp1);
  6176. end
  6177. else
  6178. if (taicpu(hp1).oper[0]^.typ = Top_Reg) and
  6179. (((taicpu(hp1).opcode = A_ADD) and
  6180. (TmpRef.base = NR_NO)) or
  6181. (taicpu(hp1).opcode = A_INC) or
  6182. (taicpu(hp1).opcode = A_DEC)) then
  6183. begin
  6184. TmpBool1 := True;
  6185. TmpBool2 := True;
  6186. case taicpu(hp1).opcode of
  6187. A_ADD:
  6188. TmpRef.base := taicpu(hp1).oper[0]^.reg;
  6189. A_INC:
  6190. inc(TmpRef.offset);
  6191. A_DEC:
  6192. dec(TmpRef.offset);
  6193. else
  6194. internalerror(2019050535);
  6195. end;
  6196. RemoveInstruction(hp1);
  6197. end;
  6198. end;
  6199. if TmpBool2
  6200. {$ifndef x86_64}
  6201. or
  6202. ((current_settings.optimizecputype < cpu_Pentium2) and
  6203. (taicpu(p).oper[0]^.val <= 3) and
  6204. not(cs_opt_size in current_settings.optimizerswitches))
  6205. {$endif x86_64}
  6206. then
  6207. begin
  6208. if not(TmpBool2) and
  6209. (taicpu(p).oper[0]^.val=1) then
  6210. begin
  6211. taicpu(p).opcode := A_ADD;
  6212. taicpu(p).loadreg(0, taicpu(p).oper[1]^.reg);
  6213. end
  6214. else
  6215. begin
  6216. taicpu(p).opcode := A_LEA;
  6217. taicpu(p).loadref(0, TmpRef);
  6218. end;
  6219. DebugMsg(SPeepholeOptimization + 'ShlAddLeaSubIncDec2Lea',p);
  6220. Result := True;
  6221. end;
  6222. end
  6223. {$ifndef x86_64}
  6224. else if (current_settings.optimizecputype < cpu_Pentium2) then
  6225. begin
  6226. { changes "shl $1, %reg" to "add %reg, %reg", which is the same on a 386,
  6227. but faster on a 486, and Tairable in both U and V pipes on the Pentium
  6228. (unlike shl, which is only Tairable in the U pipe) }
  6229. if taicpu(p).oper[0]^.val=1 then
  6230. begin
  6231. taicpu(p).opcode := A_ADD;
  6232. taicpu(p).loadreg(0, taicpu(p).oper[1]^.reg);
  6233. Result := True;
  6234. end
  6235. { changes "shl $2, %reg" to "lea (,%reg,4), %reg"
  6236. "shl $3, %reg" to "lea (,%reg,8), %reg }
  6237. else if (taicpu(p).opsize = S_L) and
  6238. (taicpu(p).oper[0]^.val<= 3) then
  6239. begin
  6240. reference_reset(tmpref,2,[]);
  6241. TmpRef.index := taicpu(p).oper[1]^.reg;
  6242. TmpRef.scalefactor := 1 shl taicpu(p).oper[0]^.val;
  6243. taicpu(p).opcode := A_LEA;
  6244. taicpu(p).loadref(0, TmpRef);
  6245. Result := True;
  6246. end;
  6247. end
  6248. {$endif x86_64}
  6249. else if
  6250. GetNextInstruction(p, hp1) and (hp1.typ = ait_instruction) and MatchOpType(taicpu(hp1), top_const, top_reg) and
  6251. (
  6252. (
  6253. MatchInstruction(hp1, A_AND, [taicpu(p).opsize]) and
  6254. SetAndTest(hp1, hp2)
  6255. {$ifdef x86_64}
  6256. ) or
  6257. (
  6258. MatchInstruction(hp1, A_MOV, [taicpu(p).opsize]) and
  6259. GetNextInstruction(hp1, hp2) and
  6260. MatchInstruction(hp2, A_AND, [taicpu(p).opsize]) and
  6261. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  6262. (taicpu(hp1).oper[1]^.reg = taicpu(hp2).oper[0]^.reg)
  6263. {$endif x86_64}
  6264. )
  6265. ) and
  6266. (taicpu(p).oper[1]^.reg = taicpu(hp2).oper[1]^.reg) then
  6267. begin
  6268. { Change:
  6269. shl x, %reg1
  6270. mov -(1<<x), %reg2
  6271. and %reg2, %reg1
  6272. Or:
  6273. shl x, %reg1
  6274. and -(1<<x), %reg1
  6275. To just:
  6276. shl x, %reg1
  6277. Since the and operation only zeroes bits that are already zero from the shl operation
  6278. }
  6279. case taicpu(p).oper[0]^.val of
  6280. 8:
  6281. mask:=$FFFFFFFFFFFFFF00;
  6282. 16:
  6283. mask:=$FFFFFFFFFFFF0000;
  6284. 32:
  6285. mask:=$FFFFFFFF00000000;
  6286. 63:
  6287. { Constant pre-calculated to prevent overflow errors with Int64 }
  6288. mask:=$8000000000000000;
  6289. else
  6290. begin
  6291. if taicpu(p).oper[0]^.val >= 64 then
  6292. { Shouldn't happen realistically, since the register
  6293. is guaranteed to be set to zero at this point }
  6294. mask := 0
  6295. else
  6296. mask := -(Int64(1 shl taicpu(p).oper[0]^.val));
  6297. end;
  6298. end;
  6299. if taicpu(hp1).oper[0]^.val = mask then
  6300. begin
  6301. { Everything checks out, perform the optimisation, as long as
  6302. the FLAGS register isn't being used}
  6303. TransferUsedRegs(TmpUsedRegs);
  6304. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  6305. {$ifdef x86_64}
  6306. if (hp1 <> hp2) then
  6307. begin
  6308. { "shl/mov/and" version }
  6309. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  6310. { Don't do the optimisation if the FLAGS register is in use }
  6311. if not(RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp2, TmpUsedRegs)) then
  6312. begin
  6313. DebugMsg(SPeepholeOptimization + 'ShlMovAnd2Shl', p);
  6314. { Don't remove the 'mov' instruction if its register is used elsewhere }
  6315. if not(RegUsedAfterInstruction(taicpu(hp1).oper[1]^.reg, hp2, TmpUsedRegs)) then
  6316. begin
  6317. RemoveInstruction(hp1);
  6318. Result := True;
  6319. end;
  6320. { Only set Result to True if the 'mov' instruction was removed }
  6321. RemoveInstruction(hp2);
  6322. end;
  6323. end
  6324. else
  6325. {$endif x86_64}
  6326. begin
  6327. { "shl/and" version }
  6328. { Don't do the optimisation if the FLAGS register is in use }
  6329. if not(RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)) then
  6330. begin
  6331. DebugMsg(SPeepholeOptimization + 'ShlAnd2Shl', p);
  6332. RemoveInstruction(hp1);
  6333. Result := True;
  6334. end;
  6335. end;
  6336. Exit;
  6337. end
  6338. else {$ifdef x86_64}if (hp1 = hp2) then{$endif x86_64}
  6339. begin
  6340. { Even if the mask doesn't allow for its removal, we might be
  6341. able to optimise the mask for the "shl/and" version, which
  6342. may permit other peephole optimisations }
  6343. {$ifdef DEBUG_AOPTCPU}
  6344. mask := taicpu(hp1).oper[0]^.val and mask;
  6345. if taicpu(hp1).oper[0]^.val <> mask then
  6346. begin
  6347. DebugMsg(
  6348. SPeepholeOptimization +
  6349. 'Changed mask from $' + debug_tostr(taicpu(hp1).oper[0]^.val) +
  6350. ' to $' + debug_tostr(mask) +
  6351. 'based on previous instruction (ShlAnd2ShlAnd)', hp1);
  6352. taicpu(hp1).oper[0]^.val := mask;
  6353. end;
  6354. {$else DEBUG_AOPTCPU}
  6355. { If debugging is off, just set the operand even if it's the same }
  6356. taicpu(hp1).oper[0]^.val := taicpu(hp1).oper[0]^.val and mask;
  6357. {$endif DEBUG_AOPTCPU}
  6358. end;
  6359. end;
  6360. {
  6361. change
  6362. shl/sal const,reg
  6363. <op> ...(...,reg,1),...
  6364. into
  6365. <op> ...(...,reg,1 shl const),...
  6366. if const in 1..3
  6367. }
  6368. if MatchOpType(taicpu(p), top_const, top_reg) and
  6369. (taicpu(p).oper[0]^.val in [1..3]) and
  6370. GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg) and
  6371. ((MatchInstruction(hp1,A_MOV,A_LEA,[]) and
  6372. MatchOpType(taicpu(hp1),top_ref,top_reg)) or
  6373. (MatchInstruction(hp1,A_FST,A_FSTP,A_FLD,[]) and
  6374. MatchOpType(taicpu(hp1),top_ref))
  6375. ) and
  6376. (taicpu(p).oper[1]^.reg=taicpu(hp1).oper[0]^.ref^.index) and
  6377. (taicpu(p).oper[1]^.reg<>taicpu(hp1).oper[0]^.ref^.base) and
  6378. (taicpu(hp1).oper[0]^.ref^.scalefactor in [0,1]) then
  6379. begin
  6380. TransferUsedRegs(TmpUsedRegs);
  6381. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  6382. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs)) then
  6383. begin
  6384. taicpu(hp1).oper[0]^.ref^.scalefactor:=1 shl taicpu(p).oper[0]^.val;
  6385. DebugMsg(SPeepholeOptimization + 'ShlOp2Op', p);
  6386. RemoveCurrentP(p);
  6387. Result:=true;
  6388. exit;
  6389. end;
  6390. end;
  6391. if MatchOpType(taicpu(p), top_const, top_reg) and
  6392. GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg) and
  6393. MatchInstruction(hp1,A_SHL,[taicpu(p).opsize]) and
  6394. MatchOpType(taicpu(hp1),top_const,top_reg) and
  6395. (taicpu(p).oper[1]^.reg=taicpu(hp1).oper[1]^.reg) then
  6396. begin
  6397. shiftval:=taicpu(p).oper[0]^.val+taicpu(hp1).oper[0]^.val;
  6398. if ((taicpu(p).opsize=S_B) and (shiftval>7)) or
  6399. ((taicpu(p).opsize=S_W) and (shiftval>15)) or
  6400. {$ifdef x86_64}
  6401. ((taicpu(p).opsize=S_Q) and (shiftval>63)) or
  6402. {$endif x86_64}
  6403. ((taicpu(p).opsize=S_L) and (shiftval>31)) then
  6404. begin
  6405. DebugMsg(SPeepholeOptimization + 'ShlShl2Mov', p);
  6406. taicpu(hp1).opcode:=A_MOV;
  6407. taicpu(hp1).oper[0]^.val:=0;
  6408. end
  6409. else
  6410. begin
  6411. DebugMsg(SPeepholeOptimization + 'ShlShl2Shl', p);
  6412. taicpu(hp1).oper[0]^.val:=shiftval;
  6413. end;
  6414. RemoveCurrentP(p);
  6415. Result:=true;
  6416. exit;
  6417. end;
  6418. end;
  6419. class function TX86AsmOptimizer.IsShrMovZFoldable(shr_size, movz_size: topsize; Shift: TCGInt): Boolean;
  6420. begin
  6421. case shr_size of
  6422. S_B:
  6423. { No valid combinations }
  6424. Result := False;
  6425. S_W:
  6426. Result := (Shift >= 8) and (movz_size = S_BW);
  6427. S_L:
  6428. Result :=
  6429. (Shift >= 24) { Any opsize is valid for this shift } or
  6430. ((Shift >= 16) and (movz_size = S_WL));
  6431. {$ifdef x86_64}
  6432. S_Q:
  6433. Result :=
  6434. (Shift >= 56) { Any opsize is valid for this shift } or
  6435. ((Shift >= 48) and (movz_size = S_WL));
  6436. {$endif x86_64}
  6437. else
  6438. InternalError(2022081510);
  6439. end;
  6440. end;
  6441. function TX86AsmOptimizer.OptPass1SHR(var p : tai) : boolean;
  6442. var
  6443. hp1, hp2: tai;
  6444. Shift: TCGInt;
  6445. LimitSize: Topsize;
  6446. DoNotMerge: Boolean;
  6447. begin
  6448. Result := False;
  6449. { All these optimisations work on "shr const,%reg" }
  6450. if not MatchOpType(taicpu(p), top_const, top_reg) then
  6451. Exit;
  6452. DoNotMerge := False;
  6453. Shift := taicpu(p).oper[0]^.val;
  6454. LimitSize := taicpu(p).opsize;
  6455. hp1 := p;
  6456. repeat
  6457. if not GetNextInstructionUsingReg(hp1, hp1, taicpu(p).oper[1]^.reg) or (hp1.typ <> ait_instruction) then
  6458. Exit;
  6459. case taicpu(hp1).opcode of
  6460. A_TEST, A_CMP, A_Jcc:
  6461. { Skip over conditional jumps and relevant comparisons }
  6462. Continue;
  6463. A_MOVZX:
  6464. if MatchOpType(taicpu(hp1), top_reg, top_reg) and
  6465. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(p).oper[1]^.reg) then
  6466. begin
  6467. { Since the original register is being read as is, subsequent
  6468. SHRs must not be merged at this point }
  6469. DoNotMerge := True;
  6470. if IsShrMovZFoldable(taicpu(p).opsize, taicpu(hp1).opsize, Shift) then
  6471. begin
  6472. if not SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then { Different register target }
  6473. begin
  6474. DebugMsg(SPeepholeOptimization + 'Converted MOVZX instruction to MOV since previous SHR makes zero-extension unnecessary (ShrMovz2ShrMov 1)', hp1);
  6475. taicpu(hp1).opcode := A_MOV;
  6476. setsubreg(taicpu(hp1).oper[0]^.reg, getsubreg(taicpu(hp1).oper[1]^.reg));
  6477. case taicpu(hp1).opsize of
  6478. S_BW:
  6479. taicpu(hp1).opsize := S_W;
  6480. S_BL, S_WL:
  6481. taicpu(hp1).opsize := S_L;
  6482. else
  6483. InternalError(2022081503);
  6484. end;
  6485. { p itself hasn't changed, so no need to set Result to True }
  6486. Include(OptsToCheck, aoc_ForceNewIteration);
  6487. { See if there's anything afterwards that can be
  6488. optimised, since the input register hasn't changed }
  6489. Continue;
  6490. end;
  6491. { NOTE: If the MOVZX instruction reads and writes the same
  6492. register, defer this to the post-peephole optimisation stage }
  6493. Exit;
  6494. end;
  6495. end;
  6496. A_SHL, A_SAL, A_SHR:
  6497. if (taicpu(hp1).opsize <= LimitSize) and
  6498. MatchOpType(taicpu(hp1), top_const, top_reg) and
  6499. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[1]^.reg) then
  6500. begin
  6501. { Make sure the sizes don't exceed the register size limit
  6502. (measured by the shift value falling below the limit) }
  6503. if taicpu(hp1).opsize < LimitSize then
  6504. LimitSize := taicpu(hp1).opsize;
  6505. if taicpu(hp1).opcode = A_SHR then
  6506. Inc(Shift, taicpu(hp1).oper[0]^.val)
  6507. else
  6508. begin
  6509. Dec(Shift, taicpu(hp1).oper[0]^.val);
  6510. DoNotMerge := True;
  6511. end;
  6512. if Shift < topsize2memsize[taicpu(p).opsize] - topsize2memsize[LimitSize] then
  6513. Exit;
  6514. { Since we've established that the combined shift is within
  6515. limits, we can actually combine the adjacent SHR
  6516. instructions even if they're different sizes }
  6517. if not DoNotMerge and (taicpu(hp1).opcode = A_SHR) then
  6518. begin
  6519. hp2 := tai(hp1.Previous);
  6520. DebugMsg(SPeepholeOptimization + 'ShrShr2Shr 1', p);
  6521. Inc(taicpu(p).oper[0]^.val, taicpu(hp1).oper[0]^.val);
  6522. RemoveInstruction(hp1);
  6523. hp1 := hp2;
  6524. { Though p has changed, only the constant has, and its
  6525. effects can still be detected on the next iteration of
  6526. the repeat..until loop }
  6527. Include(OptsToCheck, aoc_ForceNewIteration);
  6528. end;
  6529. { Move onto the next instruction }
  6530. Continue;
  6531. end;
  6532. else
  6533. ;
  6534. end;
  6535. Break;
  6536. until False;
  6537. end;
  6538. function TX86AsmOptimizer.CheckMemoryWrite(var first_mov, second_mov: taicpu): Boolean;
  6539. var
  6540. CurrentRef: TReference;
  6541. FullReg: TRegister;
  6542. hp1, hp2: tai;
  6543. begin
  6544. Result := False;
  6545. if (first_mov.opsize <> S_B) or (second_mov.opsize <> S_B) then
  6546. Exit;
  6547. { We assume you've checked if the operand is actually a reference by
  6548. this point. If it isn't, you'll most likely get an access violation }
  6549. CurrentRef := first_mov.oper[1]^.ref^;
  6550. { Memory must be aligned }
  6551. if (CurrentRef.offset mod 4) <> 0 then
  6552. Exit;
  6553. Inc(CurrentRef.offset);
  6554. CurrentRef.alignment := 1; { Otherwise references_equal will return False }
  6555. if MatchOperand(second_mov.oper[0]^, 0) and
  6556. references_equal(second_mov.oper[1]^.ref^, CurrentRef) and
  6557. GetNextInstruction(second_mov, hp1) and
  6558. (hp1.typ = ait_instruction) and
  6559. (taicpu(hp1).opcode = A_MOV) and
  6560. MatchOpType(taicpu(hp1), top_const, top_ref) and
  6561. (taicpu(hp1).oper[0]^.val = 0) then
  6562. begin
  6563. Inc(CurrentRef.offset);
  6564. CurrentRef.alignment := taicpu(hp1).oper[1]^.ref^.alignment; { Otherwise references_equal might return False }
  6565. FullReg := newreg(R_INTREGISTER,getsupreg(first_mov.oper[0]^.reg), R_SUBD);
  6566. if references_equal(taicpu(hp1).oper[1]^.ref^, CurrentRef) then
  6567. begin
  6568. case taicpu(hp1).opsize of
  6569. S_B:
  6570. if GetNextInstruction(hp1, hp2) and
  6571. MatchInstruction(taicpu(hp2), A_MOV, [S_B]) and
  6572. MatchOpType(taicpu(hp2), top_const, top_ref) and
  6573. (taicpu(hp2).oper[0]^.val = 0) then
  6574. begin
  6575. Inc(CurrentRef.offset);
  6576. CurrentRef.alignment := 1; { Otherwise references_equal will return False }
  6577. if references_equal(taicpu(hp2).oper[1]^.ref^, CurrentRef) and
  6578. (taicpu(hp2).opsize = S_B) then
  6579. begin
  6580. RemoveInstruction(hp1);
  6581. RemoveInstruction(hp2);
  6582. first_mov.opsize := S_L;
  6583. if first_mov.oper[0]^.typ = top_reg then
  6584. begin
  6585. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVb/MOVb -> MOVZX/MOVl', first_mov);
  6586. { Reuse second_mov as a MOVZX instruction }
  6587. second_mov.opcode := A_MOVZX;
  6588. second_mov.opsize := S_BL;
  6589. second_mov.loadreg(0, first_mov.oper[0]^.reg);
  6590. second_mov.loadreg(1, FullReg);
  6591. first_mov.oper[0]^.reg := FullReg;
  6592. asml.Remove(second_mov);
  6593. asml.InsertBefore(second_mov, first_mov);
  6594. end
  6595. else
  6596. { It's a value }
  6597. begin
  6598. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVb/MOVb -> MOVl', first_mov);
  6599. RemoveInstruction(second_mov);
  6600. end;
  6601. Result := True;
  6602. Exit;
  6603. end;
  6604. end;
  6605. S_W:
  6606. begin
  6607. RemoveInstruction(hp1);
  6608. first_mov.opsize := S_L;
  6609. if first_mov.oper[0]^.typ = top_reg then
  6610. begin
  6611. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVw -> MOVZX/MOVl', first_mov);
  6612. { Reuse second_mov as a MOVZX instruction }
  6613. second_mov.opcode := A_MOVZX;
  6614. second_mov.opsize := S_BL;
  6615. second_mov.loadreg(0, first_mov.oper[0]^.reg);
  6616. second_mov.loadreg(1, FullReg);
  6617. first_mov.oper[0]^.reg := FullReg;
  6618. asml.Remove(second_mov);
  6619. asml.InsertBefore(second_mov, first_mov);
  6620. end
  6621. else
  6622. { It's a value }
  6623. begin
  6624. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVw -> MOVl', first_mov);
  6625. RemoveInstruction(second_mov);
  6626. end;
  6627. Result := True;
  6628. Exit;
  6629. end;
  6630. else
  6631. ;
  6632. end;
  6633. end;
  6634. end;
  6635. end;
  6636. function TX86AsmOptimizer.OptPass1FSTP(var p: tai): boolean;
  6637. { returns true if a "continue" should be done after this optimization }
  6638. var
  6639. hp1, hp2, hp3: tai;
  6640. begin
  6641. Result := false;
  6642. hp3 := nil;
  6643. if MatchOpType(taicpu(p),top_ref) and
  6644. GetNextInstruction(p, hp1) and
  6645. (hp1.typ = ait_instruction) and
  6646. (((taicpu(hp1).opcode = A_FLD) and
  6647. (taicpu(p).opcode = A_FSTP)) or
  6648. ((taicpu(p).opcode = A_FISTP) and
  6649. (taicpu(hp1).opcode = A_FILD))) and
  6650. MatchOpType(taicpu(hp1),top_ref) and
  6651. (taicpu(hp1).opsize = taicpu(p).opsize) and
  6652. RefsEqual(taicpu(p).oper[0]^.ref^, taicpu(hp1).oper[0]^.ref^) then
  6653. begin
  6654. { replacing fstp f;fld f by fst f is only valid for extended because of rounding or if fastmath is on }
  6655. if ((taicpu(p).opsize=S_FX) or (cs_opt_fastmath in current_settings.optimizerswitches)) and
  6656. GetNextInstruction(hp1, hp2) and
  6657. (((hp2.typ = ait_instruction) and
  6658. IsExitCode(hp2) and
  6659. (taicpu(p).oper[0]^.ref^.base = current_procinfo.FramePointer) and
  6660. not(assigned(current_procinfo.procdef.funcretsym) and
  6661. (taicpu(p).oper[0]^.ref^.offset < tabstractnormalvarsym(current_procinfo.procdef.funcretsym).localloc.reference.offset)) and
  6662. (taicpu(p).oper[0]^.ref^.index = NR_NO)) or
  6663. { fstp <temp>
  6664. fld <temp>
  6665. <dealloc> <temp>
  6666. }
  6667. ((taicpu(p).oper[0]^.ref^.base = current_procinfo.FramePointer) and
  6668. (taicpu(p).oper[0]^.ref^.index = NR_NO) and
  6669. SetAndTest(FindTempDeAlloc(taicpu(p).oper[0]^.ref^.offset,tai(hp1.next)),hp2) and
  6670. (tai_tempalloc(hp2).temppos=taicpu(p).oper[0]^.ref^.offset) and
  6671. (((taicpu(p).opsize=S_FX) and (tai_tempalloc(hp2).tempsize=16)) or
  6672. ((taicpu(p).opsize in [S_IQ,S_FL]) and (tai_tempalloc(hp2).tempsize=8)) or
  6673. ((taicpu(p).opsize=S_FS) and (tai_tempalloc(hp2).tempsize=4))
  6674. )
  6675. )
  6676. ) then
  6677. begin
  6678. DebugMsg(SPeepholeOptimization + 'FstpFld2<Nop>',p);
  6679. RemoveInstruction(hp1);
  6680. RemoveCurrentP(p, hp2);
  6681. { first case: exit code }
  6682. if hp2.typ = ait_instruction then
  6683. RemoveLastDeallocForFuncRes(p);
  6684. Result := true;
  6685. end
  6686. else
  6687. { we can do this only in fast math mode as fstp is rounding ...
  6688. ... still disabled as it breaks the compiler and/or rtl }
  6689. if { (cs_opt_fastmath in current_settings.optimizerswitches) or }
  6690. { ... or if another fstp equal to the first one follows }
  6691. GetNextInstruction(hp1,hp2) and
  6692. (hp2.typ = ait_instruction) and
  6693. (taicpu(p).opcode=taicpu(hp2).opcode) and
  6694. (taicpu(p).opsize=taicpu(hp2).opsize) then
  6695. begin
  6696. if (taicpu(p).oper[0]^.ref^.base = current_procinfo.FramePointer) and
  6697. (taicpu(p).oper[0]^.ref^.index = NR_NO) and
  6698. SetAndTest(FindTempDeAlloc(taicpu(p).oper[0]^.ref^.offset,tai(hp2.next)),hp3) and
  6699. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[0]^) and
  6700. (tai_tempalloc(hp3).temppos=taicpu(p).oper[0]^.ref^.offset) and
  6701. (((taicpu(p).opsize=S_FX) and (tai_tempalloc(hp3).tempsize=16)) or
  6702. ((taicpu(p).opsize in [S_IQ,S_FL]) and (tai_tempalloc(hp3).tempsize=8)) or
  6703. ((taicpu(p).opsize=S_FS) and (tai_tempalloc(hp3).tempsize=4))
  6704. ) then
  6705. begin
  6706. DebugMsg(SPeepholeOptimization + 'FstpFldFstp2Fstp',p);
  6707. RemoveCurrentP(p,hp2);
  6708. RemoveInstruction(hp1);
  6709. Result := true;
  6710. end
  6711. else if { fst can't store an extended/comp value }
  6712. (taicpu(p).opsize <> S_FX) and
  6713. (taicpu(p).opsize <> S_IQ) then
  6714. begin
  6715. if (taicpu(p).opcode = A_FSTP) then
  6716. taicpu(p).opcode := A_FST
  6717. else
  6718. taicpu(p).opcode := A_FIST;
  6719. DebugMsg(SPeepholeOptimization + 'FstpFld2Fst',p);
  6720. RemoveInstruction(hp1);
  6721. Result := true;
  6722. end;
  6723. end;
  6724. end;
  6725. end;
  6726. function TX86AsmOptimizer.OptPass1FLD(var p : tai) : boolean;
  6727. var
  6728. hp1, hp2, hp3: tai;
  6729. begin
  6730. result:=false;
  6731. if MatchOpType(taicpu(p),top_reg) and
  6732. GetNextInstruction(p, hp1) and
  6733. (hp1.typ = Ait_Instruction) and
  6734. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  6735. (taicpu(hp1).oper[0]^.reg = NR_ST) and
  6736. (taicpu(hp1).oper[1]^.reg = NR_ST1) then
  6737. { change to
  6738. fld reg fxxx reg,st
  6739. fxxxp st, st1 (hp1)
  6740. Remark: non commutative operations must be reversed!
  6741. }
  6742. begin
  6743. case taicpu(hp1).opcode Of
  6744. A_FMULP,A_FADDP,
  6745. A_FSUBP,A_FDIVP,A_FSUBRP,A_FDIVRP:
  6746. begin
  6747. case taicpu(hp1).opcode Of
  6748. A_FADDP: taicpu(hp1).opcode := A_FADD;
  6749. A_FMULP: taicpu(hp1).opcode := A_FMUL;
  6750. A_FSUBP: taicpu(hp1).opcode := A_FSUBR;
  6751. A_FSUBRP: taicpu(hp1).opcode := A_FSUB;
  6752. A_FDIVP: taicpu(hp1).opcode := A_FDIVR;
  6753. A_FDIVRP: taicpu(hp1).opcode := A_FDIV;
  6754. else
  6755. internalerror(2019050534);
  6756. end;
  6757. taicpu(hp1).oper[0]^.reg := taicpu(p).oper[0]^.reg;
  6758. taicpu(hp1).oper[1]^.reg := NR_ST;
  6759. DebugMsg(SPeepholeOptimization + 'FldF*p2F*',hp1);
  6760. RemoveCurrentP(p, hp1);
  6761. Result:=true;
  6762. exit;
  6763. end;
  6764. else
  6765. ;
  6766. end;
  6767. end
  6768. else
  6769. if MatchOpType(taicpu(p),top_ref) and
  6770. GetNextInstruction(p, hp2) and
  6771. (hp2.typ = Ait_Instruction) and
  6772. MatchOpType(taicpu(hp2),top_reg,top_reg) and
  6773. (taicpu(p).opsize in [S_FS, S_FL]) and
  6774. (taicpu(hp2).oper[0]^.reg = NR_ST) and
  6775. (taicpu(hp2).oper[1]^.reg = NR_ST1) then
  6776. if GetLastInstruction(p, hp1) and
  6777. MatchInstruction(hp1,A_FLD,A_FST,[taicpu(p).opsize]) and
  6778. MatchOpType(taicpu(hp1),top_ref) and
  6779. RefsEqual(taicpu(p).oper[0]^.ref^, taicpu(hp1).oper[0]^.ref^) then
  6780. if ((taicpu(hp2).opcode = A_FMULP) or
  6781. (taicpu(hp2).opcode = A_FADDP)) then
  6782. { change to
  6783. fld/fst mem1 (hp1) fld/fst mem1
  6784. fld mem1 (p) fadd/
  6785. faddp/ fmul st, st
  6786. fmulp st, st1 (hp2) }
  6787. begin
  6788. DebugMsg(SPeepholeOptimization + 'Fld/FstFldFaddp/Fmulp2Fld/FstFadd/Fmul',hp1);
  6789. RemoveCurrentP(p, hp1);
  6790. if (taicpu(hp2).opcode = A_FADDP) then
  6791. taicpu(hp2).opcode := A_FADD
  6792. else
  6793. taicpu(hp2).opcode := A_FMUL;
  6794. taicpu(hp2).oper[1]^.reg := NR_ST;
  6795. end
  6796. else
  6797. { change to
  6798. fld/fst mem1 (hp1) fld/fst mem1
  6799. fld mem1 (p) fld st
  6800. }
  6801. begin
  6802. DebugMsg(SPeepholeOptimization + 'Fld/Fst<mem>Fld<mem>2Fld/Fst<mem>Fld<reg>',hp1);
  6803. taicpu(p).changeopsize(S_FL);
  6804. taicpu(p).loadreg(0,NR_ST);
  6805. end
  6806. else
  6807. begin
  6808. case taicpu(hp2).opcode Of
  6809. A_FMULP,A_FADDP,A_FSUBP,A_FDIVP,A_FSUBRP,A_FDIVRP:
  6810. { change to
  6811. fld/fst mem1 (hp1) fld/fst mem1
  6812. fld mem2 (p) fxxx mem2
  6813. fxxxp st, st1 (hp2) }
  6814. begin
  6815. case taicpu(hp2).opcode Of
  6816. A_FADDP: taicpu(p).opcode := A_FADD;
  6817. A_FMULP: taicpu(p).opcode := A_FMUL;
  6818. A_FSUBP: taicpu(p).opcode := A_FSUBR;
  6819. A_FSUBRP: taicpu(p).opcode := A_FSUB;
  6820. A_FDIVP: taicpu(p).opcode := A_FDIVR;
  6821. A_FDIVRP: taicpu(p).opcode := A_FDIV;
  6822. else
  6823. internalerror(2019050533);
  6824. end;
  6825. DebugMsg(SPeepholeOptimization + 'Fld/FstFldF*2Fld/FstF*',p);
  6826. RemoveInstruction(hp2);
  6827. end
  6828. else
  6829. ;
  6830. end
  6831. end
  6832. end;
  6833. function IsCmpSubset(cond1, cond2: TAsmCond): Boolean; inline;
  6834. begin
  6835. Result := condition_in(cond1, cond2) or
  6836. { Not strictly subsets due to the actual flags checked, but because we're
  6837. comparing integers, E is a subset of AE and GE and their aliases }
  6838. ((cond1 in [C_E, C_Z]) and (cond2 in [C_AE, C_NB, C_NC, C_GE, C_NL]));
  6839. end;
  6840. function TX86AsmOptimizer.OptPass1Cmp(var p: tai): boolean;
  6841. var
  6842. v: TCGInt;
  6843. hp1, hp2, p_dist, p_jump, hp1_dist, p_label, hp1_label: tai;
  6844. FirstMatch, TempBool: Boolean;
  6845. NewReg: TRegister;
  6846. JumpLabel, JumpLabel_dist, JumpLabel_far: TAsmLabel;
  6847. begin
  6848. Result:=false;
  6849. { All these optimisations need a next instruction }
  6850. if not GetNextInstruction(p, hp1) then
  6851. Exit;
  6852. { Search for:
  6853. cmp ###,###
  6854. j(c1) @lbl1
  6855. ...
  6856. @lbl:
  6857. cmp ###,### (same comparison as above)
  6858. j(c2) @lbl2
  6859. If c1 is a subset of c2, change to:
  6860. cmp ###,###
  6861. j(c1) @lbl2
  6862. (@lbl1 may become a dead label as a result)
  6863. }
  6864. { Also handle cases where there are multiple jumps in a row }
  6865. p_jump := hp1;
  6866. while Assigned(p_jump) and MatchInstruction(p_jump, A_JCC, []) do
  6867. begin
  6868. if IsJumpToLabel(taicpu(p_jump)) then
  6869. begin
  6870. { Do jump optimisations first in case the condition becomes
  6871. unnecessary }
  6872. TempBool := True;
  6873. if DoJumpOptimizations(p_jump, TempBool) or
  6874. not TempBool then
  6875. begin
  6876. if Assigned(p_jump) then
  6877. begin
  6878. hp1 := p_jump;
  6879. if (p_jump.typ in [ait_align]) then
  6880. SkipAligns(p_jump, p_jump);
  6881. { CollapseZeroDistJump will be set to the label after the
  6882. jump if it optimises, whether or not it's live or dead }
  6883. if (p_jump.typ in [ait_label]) and
  6884. not (tai_label(p_jump).labsym.is_used) then
  6885. GetNextInstruction(p_jump, p_jump);
  6886. end;
  6887. TransferUsedRegs(TmpUsedRegs);
  6888. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  6889. if not Assigned(p_jump) or
  6890. (
  6891. not MatchInstruction(p_jump, A_Jcc, A_SETcc, A_CMOVcc, []) and
  6892. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, p_jump, TmpUsedRegs)
  6893. ) then
  6894. begin
  6895. { No more conditional jumps; conditional statement is no longer required }
  6896. DebugMsg(SPeepholeOptimization + 'Removed unnecessary condition (Cmp2Nop)', p);
  6897. RemoveCurrentP(p);
  6898. Result := True;
  6899. Exit;
  6900. end;
  6901. hp1 := p_jump;
  6902. Include(OptsToCheck, aoc_ForceNewIteration);
  6903. Continue;
  6904. end;
  6905. JumpLabel := TAsmLabel(taicpu(p_jump).oper[0]^.ref^.symbol);
  6906. if GetNextInstruction(p_jump, hp2) and
  6907. (
  6908. OptimizeConditionalJump(JumpLabel, p_jump, hp2, TempBool) or
  6909. not TempBool
  6910. ) then
  6911. begin
  6912. hp1 := p_jump;
  6913. Include(OptsToCheck, aoc_ForceNewIteration);
  6914. Continue;
  6915. end;
  6916. p_label := nil;
  6917. if Assigned(JumpLabel) then
  6918. p_label := getlabelwithsym(JumpLabel);
  6919. if Assigned(p_label) and
  6920. GetNextInstruction(p_label, p_dist) and
  6921. MatchInstruction(p_dist, A_CMP, []) and
  6922. MatchOperand(taicpu(p_dist).oper[0]^, taicpu(p).oper[0]^) and
  6923. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p).oper[1]^) and
  6924. GetNextInstruction(p_dist, hp1_dist) and
  6925. MatchInstruction(hp1_dist, A_JCC, []) then { This doesn't have to be an explicit label }
  6926. begin
  6927. JumpLabel_dist := TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol);
  6928. if JumpLabel = JumpLabel_dist then
  6929. { This is an infinite loop }
  6930. Exit;
  6931. { Best optimisation when the first condition is a subset (or equal) of the second }
  6932. if IsCmpSubset(taicpu(p_jump).condition, taicpu(hp1_dist).condition) then
  6933. begin
  6934. { Any registers used here will already be allocated }
  6935. if Assigned(JumpLabel) then
  6936. JumpLabel.DecRefs;
  6937. DebugMsg(SPeepholeOptimization + 'CMP/Jcc/@Lbl/CMP/Jcc -> CMP/Jcc, redirecting first jump', p_jump);
  6938. taicpu(p_jump).loadref(0, taicpu(hp1_dist).oper[0]^.ref^); { This also increases the reference count }
  6939. Result := True;
  6940. { Don't exit yet. Since p and p_jump haven't actually been
  6941. removed, we can check for more on this iteration }
  6942. end
  6943. else if IsCmpSubset(taicpu(hp1_dist).condition, inverse_cond(taicpu(p_jump).condition)) and
  6944. GetNextInstruction(hp1_dist, hp1_label) and
  6945. SkipAligns(hp1_label, hp1_label) and
  6946. (hp1_label.typ = ait_label) then
  6947. begin
  6948. JumpLabel_far := tai_label(hp1_label).labsym;
  6949. if (JumpLabel_far = JumpLabel_dist) or (JumpLabel_far = JumpLabel) then
  6950. { This is an infinite loop }
  6951. Exit;
  6952. if Assigned(JumpLabel_far) then
  6953. begin
  6954. { In this situation, if the first jump branches, the second one will never,
  6955. branch so change the destination label to after the second jump }
  6956. DebugMsg(SPeepholeOptimization + 'CMP/Jcc/@Lbl/CMP/Jcc/@Lbl -> CMP/Jcc, redirecting first jump to 2nd label', p_jump);
  6957. if Assigned(JumpLabel) then
  6958. JumpLabel.DecRefs;
  6959. JumpLabel_far.IncRefs;
  6960. taicpu(p_jump).oper[0]^.ref^.symbol := JumpLabel_far;
  6961. Result := True;
  6962. { Don't exit yet. Since p and p_jump haven't actually been
  6963. removed, we can check for more on this iteration }
  6964. Continue;
  6965. end;
  6966. end;
  6967. end;
  6968. end;
  6969. { Search for:
  6970. cmp ###,###
  6971. j(c1) @lbl1
  6972. cmp ###,### (same as first)
  6973. Remove second cmp
  6974. }
  6975. if GetNextInstruction(p_jump, hp2) and
  6976. (
  6977. (
  6978. MatchInstruction(hp2, A_CMP, [taicpu(p).opsize]) and
  6979. (
  6980. (
  6981. MatchOpType(taicpu(p), top_const, top_reg) and
  6982. MatchOpType(taicpu(hp2), top_const, top_reg) and
  6983. (taicpu(hp2).oper[0]^.val = taicpu(p).oper[0]^.val) and
  6984. Reg1WriteOverwritesReg2Entirely(taicpu(hp2).oper[1]^.reg, taicpu(p).oper[1]^.reg)
  6985. ) or (
  6986. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[0]^) and
  6987. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^)
  6988. )
  6989. )
  6990. ) or (
  6991. { Also match cmp $0,%reg; jcc @lbl; test %reg,%reg }
  6992. MatchOperand(taicpu(p).oper[0]^, 0) and
  6993. (taicpu(p).oper[1]^.typ = top_reg) and
  6994. MatchInstruction(hp2, A_TEST, []) and
  6995. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  6996. (taicpu(hp2).oper[0]^.reg = taicpu(hp2).oper[1]^.reg) and
  6997. Reg1WriteOverwritesReg2Entirely(taicpu(hp2).oper[1]^.reg, taicpu(p).oper[1]^.reg)
  6998. )
  6999. ) then
  7000. begin
  7001. DebugMsg(SPeepholeOptimization + 'CMP/Jcc/CMP; removed superfluous CMP', hp2);
  7002. RemoveInstruction(hp2);
  7003. Result := True;
  7004. { Continue the while loop in case "Jcc/CMP" follows the second CMP that was just removed }
  7005. end;
  7006. GetNextInstruction(p_jump, p_jump);
  7007. end;
  7008. if (
  7009. { Don't call GetNextInstruction again if we already have it }
  7010. (hp1 = p_jump) or
  7011. GetNextInstruction(p, hp1)
  7012. ) and
  7013. MatchInstruction(hp1, A_Jcc, []) and
  7014. IsJumpToLabel(taicpu(hp1)) and
  7015. (taicpu(hp1).condition in [C_E, C_Z, C_NE, C_NZ]) and
  7016. GetNextInstruction(hp1, hp2) then
  7017. begin
  7018. {
  7019. cmp x, y (or "cmp y, x")
  7020. je @lbl
  7021. mov x, y
  7022. @lbl:
  7023. (x and y can be constants, registers or references)
  7024. Change to:
  7025. mov x, y (x and y will always be equal in the end)
  7026. @lbl: (may beceome a dead label)
  7027. Also:
  7028. cmp x, y (or "cmp y, x")
  7029. jne @lbl
  7030. mov x, y
  7031. @lbl:
  7032. (x and y can be constants, registers or references)
  7033. Change to:
  7034. Absolutely nothing! (Except @lbl if it's still live)
  7035. }
  7036. if MatchInstruction(hp2, A_MOV, [taicpu(p).opsize]) and
  7037. (
  7038. (
  7039. MatchOperand(taicpu(p).oper[0]^, taicpu(hp2).oper[0]^) and
  7040. MatchOperand(taicpu(p).oper[1]^, taicpu(hp2).oper[1]^)
  7041. ) or (
  7042. MatchOperand(taicpu(p).oper[0]^, taicpu(hp2).oper[1]^) and
  7043. MatchOperand(taicpu(p).oper[1]^, taicpu(hp2).oper[0]^)
  7044. )
  7045. ) and
  7046. GetNextInstruction(hp2, hp1_label) and
  7047. SkipAligns(hp1_label, hp1_label) and
  7048. (hp1_label.typ = ait_label) and
  7049. (tai_label(hp1_label).labsym = taicpu(hp1).oper[0]^.ref^.symbol) then
  7050. begin
  7051. tai_label(hp1_label).labsym.DecRefs;
  7052. if (taicpu(hp1).condition in [C_NE, C_NZ]) then
  7053. begin
  7054. DebugMsg(SPeepholeOptimization + 'CMP/JNE/MOV/@Lbl -> NOP, since the MOV is only executed if the operands are equal (CmpJneMov2Nop)', p);
  7055. RemoveInstruction(hp2);
  7056. hp2 := hp1_label; { So RemoveCurrentp below can be set to something valid }
  7057. end
  7058. else
  7059. DebugMsg(SPeepholeOptimization + 'CMP/JE/MOV/@Lbl -> MOV, since the MOV is only executed if the operands aren''t equal (CmpJeMov2Mov)', p);
  7060. RemoveInstruction(hp1);
  7061. RemoveCurrentp(p, hp2);
  7062. Result := True;
  7063. Exit;
  7064. end;
  7065. {
  7066. Try to optimise the following:
  7067. cmp $x,### ($x and $y can be registers or constants)
  7068. je @lbl1 (only reference)
  7069. cmp $y,### (### are identical)
  7070. @Lbl:
  7071. sete %reg1
  7072. Change to:
  7073. cmp $x,###
  7074. sete %reg2 (allocate new %reg2)
  7075. cmp $y,###
  7076. sete %reg1
  7077. orb %reg2,%reg1
  7078. (dealloc %reg2)
  7079. This adds an instruction (so don't perform under -Os), but it removes
  7080. a conditional branch.
  7081. }
  7082. if not (cs_opt_size in current_settings.optimizerswitches) and
  7083. MatchInstruction(hp2, A_CMP, A_TEST, [taicpu(p).opsize]) and
  7084. MatchOperand(taicpu(p).oper[1]^, taicpu(hp2).oper[1]^) and
  7085. { The first operand of CMP instructions can only be a register or
  7086. immediate anyway, so no need to check }
  7087. GetNextInstruction(hp2, p_label) and
  7088. (p_label.typ = ait_label) and
  7089. (tai_label(p_label).labsym.getrefs = 1) and
  7090. (JumpTargetOp(taicpu(hp1))^.ref^.symbol = tai_label(p_label).labsym) and
  7091. GetNextInstruction(p_label, p_dist) and
  7092. MatchInstruction(p_dist, A_SETcc, []) and
  7093. (taicpu(p_dist).condition in [C_E, C_Z]) and
  7094. (taicpu(p_dist).oper[0]^.typ = top_reg) then
  7095. begin
  7096. TransferUsedRegs(TmpUsedRegs);
  7097. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  7098. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  7099. UpdateUsedRegs(TmpUsedRegs, tai(p_label.Next));
  7100. UpdateUsedRegs(TmpUsedRegs, tai(p_dist.Next));
  7101. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) and
  7102. { Get the instruction after the SETcc instruction so we can
  7103. allocate a new register over the entire range }
  7104. GetNextInstruction(p_dist, hp1_dist) then
  7105. begin
  7106. { Register can appear in p if it's not used afterwards, so only
  7107. allocate between hp1 and hp1_dist }
  7108. NewReg := GetIntRegisterBetween(R_SUBL, TmpUsedRegs, hp1, hp1_dist);
  7109. if NewReg <> NR_NO then
  7110. begin
  7111. DebugMsg(SPeepholeOptimization + 'CMP/JE/CMP/@Lbl/SETE -> CMP/SETE/CMP/SETE/OR, removing conditional branch', p);
  7112. { Change the jump instruction into a SETcc instruction }
  7113. taicpu(hp1).opcode := A_SETcc;
  7114. taicpu(hp1).opsize := S_B;
  7115. taicpu(hp1).loadreg(0, NewReg);
  7116. { This is now a dead label }
  7117. tai_label(p_label).labsym.decrefs;
  7118. { Prefer adding before the next instruction so the FLAGS
  7119. register is deallicated first }
  7120. AsmL.InsertBefore(
  7121. taicpu.op_reg_reg(A_OR, S_B, NewReg, taicpu(p_dist).oper[0]^.reg),
  7122. hp1_dist
  7123. );
  7124. Result := True;
  7125. { Don't exit yet, as p wasn't changed and hp1, while
  7126. modified, is still intact and might be optimised by the
  7127. SETcc optimisation below }
  7128. end;
  7129. end;
  7130. end;
  7131. end;
  7132. if taicpu(p).oper[0]^.typ = top_const then
  7133. begin
  7134. if (taicpu(p).oper[0]^.val = 0) and
  7135. (taicpu(p).oper[1]^.typ = top_reg) and
  7136. MatchInstruction(hp1,A_Jcc,A_SETcc,[]) then
  7137. begin
  7138. hp2 := p;
  7139. FirstMatch := True;
  7140. { When dealing with "cmp $0,%reg", only ZF and SF contain
  7141. anything meaningful once it's converted to "test %reg,%reg";
  7142. additionally, some jumps will always (or never) branch, so
  7143. evaluate every jump immediately following the
  7144. comparison, optimising the conditions if possible.
  7145. Similarly with SETcc... those that are always set to 0 or 1
  7146. are changed to MOV instructions }
  7147. while FirstMatch or { Saves calling GetNextInstruction unnecessarily }
  7148. (
  7149. GetNextInstruction(hp2, hp1) and
  7150. MatchInstruction(hp1,A_Jcc,A_SETcc,[])
  7151. ) do
  7152. begin
  7153. FirstMatch := False;
  7154. case taicpu(hp1).condition of
  7155. C_B, C_C, C_NAE, C_O:
  7156. { For B/NAE:
  7157. Will never branch since an unsigned integer can never be below zero
  7158. For C/O:
  7159. Result cannot overflow because 0 is being subtracted
  7160. }
  7161. begin
  7162. if taicpu(hp1).opcode = A_Jcc then
  7163. begin
  7164. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition B/C/NAE/O --> Never (jump removed)', hp1);
  7165. TAsmLabel(taicpu(hp1).oper[0]^.ref^.symbol).decrefs;
  7166. RemoveInstruction(hp1);
  7167. { Since hp1 was deleted, hp2 must not be updated }
  7168. Continue;
  7169. end
  7170. else
  7171. begin
  7172. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition B/C/NAE/O --> Never (set -> mov 0)', hp1);
  7173. { Convert "set(c) %reg" instruction to "movb 0,%reg" }
  7174. taicpu(hp1).opcode := A_MOV;
  7175. taicpu(hp1).ops := 2;
  7176. taicpu(hp1).condition := C_None;
  7177. taicpu(hp1).opsize := S_B;
  7178. taicpu(hp1).loadreg(1,taicpu(hp1).oper[0]^.reg);
  7179. taicpu(hp1).loadconst(0, 0);
  7180. end;
  7181. end;
  7182. C_BE, C_NA:
  7183. begin
  7184. { Will only branch if equal to zero }
  7185. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition BE/NA --> E', hp1);
  7186. taicpu(hp1).condition := C_E;
  7187. end;
  7188. C_A, C_NBE:
  7189. begin
  7190. { Will only branch if not equal to zero }
  7191. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition A/NBE --> NE', hp1);
  7192. taicpu(hp1).condition := C_NE;
  7193. end;
  7194. C_AE, C_NB, C_NC, C_NO:
  7195. begin
  7196. { Will always branch }
  7197. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition AE/NB/NC/NO --> Always', hp1);
  7198. if taicpu(hp1).opcode = A_Jcc then
  7199. begin
  7200. MakeUnconditional(taicpu(hp1));
  7201. { Any jumps/set that follow will now be dead code }
  7202. RemoveDeadCodeAfterJump(taicpu(hp1));
  7203. Break;
  7204. end
  7205. else
  7206. begin
  7207. { Convert "set(c) %reg" instruction to "movb 1,%reg" }
  7208. taicpu(hp1).opcode := A_MOV;
  7209. taicpu(hp1).ops := 2;
  7210. taicpu(hp1).condition := C_None;
  7211. taicpu(hp1).opsize := S_B;
  7212. taicpu(hp1).loadreg(1,taicpu(hp1).oper[0]^.reg);
  7213. taicpu(hp1).loadconst(0, 1);
  7214. end;
  7215. end;
  7216. C_None:
  7217. InternalError(2020012201);
  7218. C_P, C_PE, C_NP, C_PO:
  7219. { We can't handle parity checks and they should never be generated
  7220. after a general-purpose CMP (it's used in some floating-point
  7221. comparisons that don't use CMP) }
  7222. InternalError(2020012202);
  7223. else
  7224. { Zero/Equality, Sign, their complements and all of the
  7225. signed comparisons do not need to be converted };
  7226. end;
  7227. hp2 := hp1;
  7228. end;
  7229. { Convert the instruction to a TEST }
  7230. taicpu(p).opcode := A_TEST;
  7231. taicpu(p).loadreg(0,taicpu(p).oper[1]^.reg);
  7232. Result := True;
  7233. Exit;
  7234. end
  7235. else if (taicpu(p).oper[0]^.val = 1) and
  7236. MatchInstruction(hp1,A_Jcc,A_SETcc,[]) and
  7237. (taicpu(hp1).condition in [C_L, C_NL, C_NGE, C_GE]) then
  7238. begin
  7239. { Convert; To:
  7240. cmp $1,r/m cmp $0,r/m
  7241. jl @lbl jle @lbl
  7242. (Also do inverted conditions)
  7243. }
  7244. DebugMsg(SPeepholeOptimization + 'Cmp1Jl2Cmp0Jle', p);
  7245. taicpu(p).oper[0]^.val := 0;
  7246. if taicpu(hp1).condition in [C_L, C_NGE] then
  7247. taicpu(hp1).condition := C_LE
  7248. else
  7249. taicpu(hp1).condition := C_NLE;
  7250. { If the instruction is now "cmp $0,%reg", convert it to a
  7251. TEST (and effectively do the work of the "cmp $0,%reg" in
  7252. the block above)
  7253. }
  7254. if (taicpu(p).oper[1]^.typ = top_reg) then
  7255. begin
  7256. taicpu(p).opcode := A_TEST;
  7257. taicpu(p).loadreg(0,taicpu(p).oper[1]^.reg);
  7258. end;
  7259. Result := True;
  7260. Exit;
  7261. end
  7262. else if (taicpu(p).oper[1]^.typ = top_reg)
  7263. {$ifdef x86_64}
  7264. and (taicpu(p).opsize <> S_Q) { S_Q will never happen: cmp with 64 bit constants is not possible }
  7265. {$endif x86_64}
  7266. then
  7267. begin
  7268. { cmp register,$8000 neg register
  7269. je target --> jo target
  7270. .... only if register is deallocated before jump.}
  7271. case Taicpu(p).opsize of
  7272. S_B: v:=$80;
  7273. S_W: v:=$8000;
  7274. S_L: v:=qword($80000000);
  7275. else
  7276. internalerror(2013112905);
  7277. end;
  7278. if (taicpu(p).oper[0]^.val=v) and
  7279. MatchInstruction(hp1,A_Jcc,A_SETcc,[]) and
  7280. (Taicpu(hp1).condition in [C_E,C_NE]) then
  7281. begin
  7282. TransferUsedRegs(TmpUsedRegs);
  7283. UpdateUsedRegs(TmpUsedRegs,tai(p.next));
  7284. if not(RegInUsedRegs(Taicpu(p).oper[1]^.reg, TmpUsedRegs)) then
  7285. begin
  7286. DebugMsg(SPeepholeOptimization + 'CmpJe2NegJo done',p);
  7287. Taicpu(p).opcode:=A_NEG;
  7288. Taicpu(p).loadoper(0,Taicpu(p).oper[1]^);
  7289. Taicpu(p).clearop(1);
  7290. Taicpu(p).ops:=1;
  7291. if Taicpu(hp1).condition=C_E then
  7292. Taicpu(hp1).condition:=C_O
  7293. else
  7294. Taicpu(hp1).condition:=C_NO;
  7295. Result:=true;
  7296. exit;
  7297. end;
  7298. end;
  7299. end;
  7300. end;
  7301. if TrySwapMovCmp(p, hp1) then
  7302. begin
  7303. Result := True;
  7304. Exit;
  7305. end;
  7306. end;
  7307. function TX86AsmOptimizer.OptPass1PXor(var p: tai): boolean;
  7308. var
  7309. hp1: tai;
  7310. begin
  7311. {
  7312. remove the second (v)pxor from
  7313. pxor reg,reg
  7314. ...
  7315. pxor reg,reg
  7316. }
  7317. Result:=false;
  7318. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) and
  7319. MatchOpType(taicpu(p),top_reg,top_reg) and
  7320. GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[0]^.reg) and
  7321. MatchInstruction(hp1,taicpu(p).opcode,[taicpu(p).opsize]) and
  7322. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[0]^) and
  7323. MatchOperand(taicpu(hp1).oper[0]^,taicpu(hp1).oper[1]^) then
  7324. begin
  7325. DebugMsg(SPeepholeOptimization + 'PXorPXor2PXor done',hp1);
  7326. RemoveInstruction(hp1);
  7327. Result:=true;
  7328. Exit;
  7329. end
  7330. {
  7331. replace
  7332. pxor reg1,reg1
  7333. movapd/s reg1,reg2
  7334. dealloc reg1
  7335. by
  7336. pxor reg2,reg2
  7337. }
  7338. else if GetNextInstruction(p,hp1) and
  7339. { we mix single and double opperations here because we assume that the compiler
  7340. generates vmovapd only after double operations and vmovaps only after single operations }
  7341. MatchInstruction(hp1,A_MOVAPD,A_MOVAPS,[S_NO]) and
  7342. MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) and
  7343. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  7344. (taicpu(p).oper[0]^.typ=top_reg) then
  7345. begin
  7346. TransferUsedRegs(TmpUsedRegs);
  7347. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7348. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  7349. begin
  7350. taicpu(p).loadoper(0,taicpu(hp1).oper[1]^);
  7351. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  7352. DebugMsg(SPeepholeOptimization + 'PXorMovapd2PXor done',p);
  7353. RemoveInstruction(hp1);
  7354. result:=true;
  7355. end;
  7356. end;
  7357. end;
  7358. function TX86AsmOptimizer.OptPass1VPXor(var p: tai): boolean;
  7359. var
  7360. hp1: tai;
  7361. begin
  7362. {
  7363. remove the second (v)pxor from
  7364. (v)pxor reg,reg
  7365. ...
  7366. (v)pxor reg,reg
  7367. }
  7368. Result:=false;
  7369. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^,taicpu(p).oper[2]^) and
  7370. MatchOpType(taicpu(p),top_reg,top_reg,top_reg) then
  7371. begin
  7372. if GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[0]^.reg) and
  7373. MatchInstruction(hp1,taicpu(p).opcode,[taicpu(p).opsize]) and
  7374. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[0]^) and
  7375. MatchOperand(taicpu(hp1).oper[0]^,taicpu(hp1).oper[1]^,taicpu(hp1).oper[2]^) then
  7376. begin
  7377. DebugMsg(SPeepholeOptimization + 'VPXorVPXor2VPXor done',hp1);
  7378. RemoveInstruction(hp1);
  7379. Result:=true;
  7380. Exit;
  7381. end;
  7382. {$ifdef x86_64}
  7383. {
  7384. replace
  7385. vpxor reg1,reg1,reg1
  7386. vmov reg,mem
  7387. by
  7388. movq $0,mem
  7389. }
  7390. if GetNextInstruction(p,hp1) and
  7391. MatchInstruction(hp1,A_VMOVSD,[]) and
  7392. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  7393. MatchOpType(taicpu(hp1),top_reg,top_ref) then
  7394. begin
  7395. TransferUsedRegs(TmpUsedRegs);
  7396. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7397. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  7398. begin
  7399. taicpu(hp1).loadconst(0,0);
  7400. taicpu(hp1).opcode:=A_MOV;
  7401. taicpu(hp1).opsize:=S_Q;
  7402. DebugMsg(SPeepholeOptimization + 'VPXorVMov2Mov done',p);
  7403. RemoveCurrentP(p);
  7404. result:=true;
  7405. Exit;
  7406. end;
  7407. end;
  7408. {$endif x86_64}
  7409. end
  7410. {
  7411. replace
  7412. vpxor reg1,reg1,reg2
  7413. by
  7414. vpxor reg2,reg2,reg2
  7415. to avoid unncessary data dependencies
  7416. }
  7417. else if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) and
  7418. MatchOpType(taicpu(p),top_reg,top_reg,top_reg) then
  7419. begin
  7420. DebugMsg(SPeepholeOptimization + 'VPXor2VPXor done',p);
  7421. { avoid unncessary data dependency }
  7422. taicpu(p).loadreg(0,taicpu(p).oper[2]^.reg);
  7423. taicpu(p).loadreg(1,taicpu(p).oper[2]^.reg);
  7424. result:=true;
  7425. exit;
  7426. end;
  7427. Result:=OptPass1VOP(p);
  7428. end;
  7429. function TX86AsmOptimizer.OptPass1Imul(var p: tai): boolean;
  7430. var
  7431. hp1 : tai;
  7432. begin
  7433. result:=false;
  7434. { replace
  7435. IMul const,%mreg1,%mreg2
  7436. Mov %reg2,%mreg3
  7437. dealloc %mreg3
  7438. by
  7439. Imul const,%mreg1,%mreg23
  7440. }
  7441. if (taicpu(p).ops=3) and
  7442. GetNextInstruction(p,hp1) and
  7443. MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) and
  7444. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  7445. (taicpu(hp1).oper[1]^.typ=top_reg) then
  7446. begin
  7447. TransferUsedRegs(TmpUsedRegs);
  7448. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7449. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  7450. begin
  7451. taicpu(p).loadoper(2,taicpu(hp1).oper[1]^);
  7452. DebugMsg(SPeepholeOptimization + 'ImulMov2Imul done',p);
  7453. RemoveInstruction(hp1);
  7454. result:=true;
  7455. end;
  7456. end;
  7457. end;
  7458. function TX86AsmOptimizer.OptPass1SHXX(var p: tai): boolean;
  7459. var
  7460. hp1 : tai;
  7461. begin
  7462. result:=false;
  7463. { replace
  7464. IMul %reg0,%reg1,%reg2
  7465. Mov %reg2,%reg3
  7466. dealloc %reg2
  7467. by
  7468. Imul %reg0,%reg1,%reg3
  7469. }
  7470. if GetNextInstruction(p,hp1) and
  7471. MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) and
  7472. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  7473. (taicpu(hp1).oper[1]^.typ=top_reg) then
  7474. begin
  7475. TransferUsedRegs(TmpUsedRegs);
  7476. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7477. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  7478. begin
  7479. taicpu(p).loadoper(2,taicpu(hp1).oper[1]^);
  7480. DebugMsg(SPeepholeOptimization + 'SHXXMov2SHXX done',p);
  7481. RemoveInstruction(hp1);
  7482. result:=true;
  7483. end;
  7484. end;
  7485. end;
  7486. function TX86AsmOptimizer.OptPass1_V_Cvtss2sd(var p: tai): boolean;
  7487. var
  7488. hp1: tai;
  7489. begin
  7490. Result:=false;
  7491. { get rid of
  7492. (v)cvtss2sd reg0,<reg1,>reg2
  7493. (v)cvtss2sd reg2,<reg2,>reg0
  7494. }
  7495. if GetNextInstruction(p,hp1) and
  7496. (((taicpu(p).opcode=A_CVTSS2SD) and MatchInstruction(hp1,A_CVTSD2SS,[taicpu(p).opsize]) and
  7497. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[1]^) and MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^)) or
  7498. ((taicpu(p).opcode=A_VCVTSS2SD) and MatchInstruction(hp1,A_VCVTSD2SS,[taicpu(p).opsize]) and
  7499. MatchOpType(taicpu(p),top_reg,top_reg,top_reg) and
  7500. MatchOpType(taicpu(hp1),top_reg,top_reg,top_reg) and
  7501. (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) and
  7502. (getsupreg(taicpu(hp1).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg)) and
  7503. (getsupreg(taicpu(p).oper[2]^.reg)=getsupreg(taicpu(hp1).oper[0]^.reg))
  7504. )
  7505. ) then
  7506. begin
  7507. if ((taicpu(p).opcode=A_CVTSS2SD) and (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg))) or
  7508. ((taicpu(p).opcode=A_VCVTSS2SD) and (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[2]^.reg))) then
  7509. begin
  7510. DebugMsg(SPeepholeOptimization + '(V)Cvtss2CvtSd(V)Cvtsd2ss2Nop done',p);
  7511. RemoveCurrentP(p);
  7512. RemoveInstruction(hp1);
  7513. end
  7514. else
  7515. begin
  7516. DebugMsg(SPeepholeOptimization + '(V)Cvtss2CvtSd(V)Cvtsd2ss2Vmovaps done',p);
  7517. if taicpu(hp1).opcode=A_CVTSD2SS then
  7518. begin
  7519. taicpu(p).loadreg(1,taicpu(hp1).oper[1]^.reg);
  7520. taicpu(p).opcode:=A_MOVAPS;
  7521. end
  7522. else
  7523. begin
  7524. taicpu(p).loadreg(1,taicpu(hp1).oper[2]^.reg);
  7525. taicpu(p).opcode:=A_VMOVAPS;
  7526. end;
  7527. taicpu(p).ops:=2;
  7528. RemoveInstruction(hp1);
  7529. end;
  7530. Result:=true;
  7531. Exit;
  7532. end;
  7533. end;
  7534. function TX86AsmOptimizer.OptPass1Jcc(var p : tai) : boolean;
  7535. var
  7536. hp1, hp2, hp3, hp4, hp5, hp6: tai;
  7537. ThisReg: TRegister;
  7538. begin
  7539. Result := False;
  7540. if not GetNextInstruction(p,hp1) then
  7541. Exit;
  7542. {
  7543. convert
  7544. j<c> .L1
  7545. mov 1,reg
  7546. jmp .L2
  7547. .L1
  7548. mov 0,reg
  7549. .L2
  7550. into
  7551. mov 0,reg
  7552. set<not(c)> reg
  7553. take care of alignment and that the mov 0,reg is not converted into a xor as this
  7554. would destroy the flag contents
  7555. Use MOVZX if size is preferred, since while mov 0,reg is bigger, it can be
  7556. executed at the same time as a previous comparison.
  7557. set<not(c)> reg
  7558. movzx reg, reg
  7559. }
  7560. if MatchInstruction(hp1,A_MOV,[]) and
  7561. (taicpu(hp1).oper[0]^.typ = top_const) and
  7562. (
  7563. (
  7564. (taicpu(hp1).oper[1]^.typ = top_reg)
  7565. {$ifdef i386}
  7566. { Under i386, ESI, EDI, EBP and ESP
  7567. don't have an 8-bit representation }
  7568. and not (getsupreg(taicpu(hp1).oper[1]^.reg) in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  7569. {$endif i386}
  7570. ) or (
  7571. {$ifdef i386}
  7572. (taicpu(hp1).oper[1]^.typ <> top_reg) and
  7573. {$endif i386}
  7574. (taicpu(hp1).opsize = S_B)
  7575. )
  7576. ) and
  7577. GetNextInstruction(hp1,hp2) and
  7578. MatchInstruction(hp2,A_JMP,[]) and (taicpu(hp2).oper[0]^.ref^.refaddr=addr_full) and
  7579. GetNextInstruction(hp2,hp3) and
  7580. SkipAligns(hp3, hp3) and
  7581. (hp3.typ=ait_label) and
  7582. (tasmlabel(taicpu(p).oper[0]^.ref^.symbol)=tai_label(hp3).labsym) and
  7583. GetNextInstruction(hp3,hp4) and
  7584. MatchInstruction(hp4,A_MOV,[taicpu(hp1).opsize]) and
  7585. (taicpu(hp4).oper[0]^.typ = top_const) and
  7586. (
  7587. ((taicpu(hp1).oper[0]^.val = 0) and (taicpu(hp4).oper[0]^.val = 1)) or
  7588. ((taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0))
  7589. ) and
  7590. MatchOperand(taicpu(hp1).oper[1]^,taicpu(hp4).oper[1]^) and
  7591. GetNextInstruction(hp4,hp5) and
  7592. SkipAligns(hp5, hp5) and
  7593. (hp5.typ=ait_label) and
  7594. (tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol)=tai_label(hp5).labsym) then
  7595. begin
  7596. if (taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0) then
  7597. taicpu(p).condition := inverse_cond(taicpu(p).condition);
  7598. tai_label(hp3).labsym.DecRefs;
  7599. { If this isn't the only reference to the middle label, we can
  7600. still make a saving - only that the first jump and everything
  7601. that follows will remain. }
  7602. if (tai_label(hp3).labsym.getrefs = 0) then
  7603. begin
  7604. if (taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0) then
  7605. DebugMsg(SPeepholeOptimization + 'J(c)Mov1JmpMov0 -> Set(~c)',p)
  7606. else
  7607. DebugMsg(SPeepholeOptimization + 'J(c)Mov0JmpMov1 -> Set(c)',p);
  7608. { remove jump, first label and second MOV (also catching any aligns) }
  7609. repeat
  7610. if not GetNextInstruction(hp2, hp3) then
  7611. InternalError(2021040810);
  7612. RemoveInstruction(hp2);
  7613. hp2 := hp3;
  7614. until hp2 = hp5;
  7615. { Don't decrement reference count before the removal loop
  7616. above, otherwise GetNextInstruction won't stop on the
  7617. the label }
  7618. tai_label(hp5).labsym.DecRefs;
  7619. end
  7620. else
  7621. begin
  7622. if (taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0) then
  7623. DebugMsg(SPeepholeOptimization + 'J(c)Mov1JmpMov0 -> Set(~c) (partial)',p)
  7624. else
  7625. DebugMsg(SPeepholeOptimization + 'J(c)Mov0JmpMov1 -> Set(c) (partial)',p);
  7626. end;
  7627. taicpu(p).opcode:=A_SETcc;
  7628. taicpu(p).opsize:=S_B;
  7629. taicpu(p).is_jmp:=False;
  7630. if taicpu(hp1).opsize=S_B then
  7631. begin
  7632. taicpu(p).loadoper(0, taicpu(hp1).oper[1]^);
  7633. if taicpu(hp1).oper[1]^.typ = top_reg then
  7634. AllocRegBetween(taicpu(hp1).oper[1]^.reg, p, hp2, UsedRegs);
  7635. RemoveInstruction(hp1);
  7636. end
  7637. else
  7638. begin
  7639. { Will be a register because the size can't be S_B otherwise }
  7640. ThisReg := newreg(R_INTREGISTER,getsupreg(taicpu(hp1).oper[1]^.reg), R_SUBL);
  7641. taicpu(p).loadreg(0, ThisReg);
  7642. AllocRegBetween(ThisReg, p, hp2, UsedRegs);
  7643. if (cs_opt_size in current_settings.optimizerswitches) and IsMOVZXAcceptable then
  7644. begin
  7645. case taicpu(hp1).opsize of
  7646. S_W:
  7647. taicpu(hp1).opsize := S_BW;
  7648. S_L:
  7649. taicpu(hp1).opsize := S_BL;
  7650. {$ifdef x86_64}
  7651. S_Q:
  7652. begin
  7653. taicpu(hp1).opsize := S_BL;
  7654. { Change the destination register to 32-bit }
  7655. taicpu(hp1).loadreg(1, newreg(R_INTREGISTER,getsupreg(ThisReg), R_SUBD));
  7656. end;
  7657. {$endif x86_64}
  7658. else
  7659. InternalError(2021040820);
  7660. end;
  7661. taicpu(hp1).opcode := A_MOVZX;
  7662. taicpu(hp1).loadreg(0, ThisReg);
  7663. end
  7664. else
  7665. begin
  7666. AllocRegBetween(NR_FLAGS,p,hp1,UsedRegs);
  7667. { hp1 is already a MOV instruction with the correct register }
  7668. taicpu(hp1).loadconst(0, 0);
  7669. { Inserting it right before p will guarantee that the flags are also tracked }
  7670. asml.Remove(hp1);
  7671. asml.InsertBefore(hp1, p);
  7672. end;
  7673. end;
  7674. Result:=true;
  7675. exit;
  7676. end
  7677. else if (hp1.typ = ait_label) then
  7678. Result := DoSETccLblRETOpt(p, tai_label(hp1));
  7679. end;
  7680. function TX86AsmOptimizer.OptPass1VMOVDQ(var p: tai): Boolean;
  7681. var
  7682. hp1, hp2, hp3: tai;
  7683. SourceRef, TargetRef: TReference;
  7684. CurrentReg: TRegister;
  7685. begin
  7686. { VMOVDQU/CMOVDQA shouldn't have even been generated }
  7687. if not UseAVX then
  7688. InternalError(2021100501);
  7689. Result := False;
  7690. { Look for the following to simplify:
  7691. vmovdqa/u x(mem1), %xmmreg
  7692. vmovdqa/u %xmmreg, y(mem2)
  7693. vmovdqa/u x+16(mem1), %xmmreg
  7694. vmovdqa/u %xmmreg, y+16(mem2)
  7695. Change to:
  7696. vmovdqa/u x(mem1), %ymmreg
  7697. vmovdqa/u %ymmreg, y(mem2)
  7698. vpxor %ymmreg, %ymmreg, %ymmreg
  7699. ( The VPXOR instruction is to zero the upper half, thus removing the
  7700. need to call the potentially expensive VZEROUPPER instruction. Other
  7701. peephole optimisations can remove VPXOR if it's unnecessary )
  7702. }
  7703. TransferUsedRegs(TmpUsedRegs);
  7704. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  7705. { NOTE: In the optimisations below, if the references dictate that an
  7706. aligned move is possible (i.e. VMOVDQA), the existing instructions
  7707. should already be VMOVDQA because if (x mod 32) = 0, then (x mod 16) = 0 }
  7708. if (taicpu(p).opsize = S_XMM) and
  7709. MatchOpType(taicpu(p), top_ref, top_reg) and
  7710. GetNextInstruction(p, hp1) and
  7711. MatchInstruction(hp1, A_VMOVDQA, A_VMOVDQU, [S_XMM]) and
  7712. MatchOpType(taicpu(hp1), top_reg, top_ref) and
  7713. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) then
  7714. begin
  7715. SourceRef := taicpu(p).oper[0]^.ref^;
  7716. TargetRef := taicpu(hp1).oper[1]^.ref^;
  7717. if GetNextInstruction(hp1, hp2) and
  7718. MatchInstruction(hp2, A_VMOVDQA, A_VMOVDQU, [S_XMM]) and
  7719. MatchOpType(taicpu(hp2), top_ref, top_reg) then
  7720. begin
  7721. { Delay calling GetNextInstruction(hp2, hp3) for as long as possible }
  7722. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  7723. Inc(SourceRef.offset, 16);
  7724. { Reuse the register in the first block move }
  7725. CurrentReg := newreg(R_MMREGISTER, getsupreg(taicpu(p).oper[1]^.reg), R_SUBMMY);
  7726. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) and
  7727. not RefsMightOverlap(taicpu(p).oper[0]^.ref^, TargetRef, 32) then
  7728. begin
  7729. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  7730. Inc(TargetRef.offset, 16);
  7731. if GetNextInstruction(hp2, hp3) and
  7732. MatchInstruction(hp3, A_VMOVDQA, A_VMOVDQU, [S_XMM]) and
  7733. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  7734. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  7735. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  7736. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  7737. begin
  7738. { Update the register tracking to the new size }
  7739. AllocRegBetween(CurrentReg, p, hp2, UsedRegs);
  7740. { Remember that the offsets are 16 ahead }
  7741. { Switch to unaligned if the memory isn't on a 32-byte boundary }
  7742. if not (
  7743. ((SourceRef.offset mod 32) = 16) and
  7744. (SourceRef.alignment >= 32) and ((SourceRef.alignment mod 32) = 0)
  7745. ) then
  7746. taicpu(p).opcode := A_VMOVDQU;
  7747. taicpu(p).opsize := S_YMM;
  7748. taicpu(p).oper[1]^.reg := CurrentReg;
  7749. if not (
  7750. ((TargetRef.offset mod 32) = 16) and
  7751. (TargetRef.alignment >= 32) and ((TargetRef.alignment mod 32) = 0)
  7752. ) then
  7753. taicpu(hp1).opcode := A_VMOVDQU;
  7754. taicpu(hp1).opsize := S_YMM;
  7755. taicpu(hp1).oper[0]^.reg := CurrentReg;
  7756. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(CurrentReg) + ' to merge a pair of memory moves (VmovdqxVmovdqxVmovdqxVmovdqx2VmovdqyVmovdqy 1)', p);
  7757. { If pi_uses_ymm is set, VZEROUPPER is present to do this for us }
  7758. if (pi_uses_ymm in current_procinfo.flags) then
  7759. RemoveInstruction(hp2)
  7760. else
  7761. begin
  7762. taicpu(hp2).opcode := A_VPXOR;
  7763. taicpu(hp2).opsize := S_YMM;
  7764. taicpu(hp2).loadreg(0, CurrentReg);
  7765. taicpu(hp2).loadreg(1, CurrentReg);
  7766. taicpu(hp2).loadreg(2, CurrentReg);
  7767. taicpu(hp2).ops := 3;
  7768. end;
  7769. RemoveInstruction(hp3);
  7770. Result := True;
  7771. Exit;
  7772. end;
  7773. end
  7774. else
  7775. begin
  7776. { See if the next references are 16 less rather than 16 greater }
  7777. Dec(SourceRef.offset, 32); { -16 the other way }
  7778. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) then
  7779. begin
  7780. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  7781. Dec(TargetRef.offset, 16); { Only 16, not 32, as it wasn't incremented unlike SourceRef }
  7782. if not RefsMightOverlap(SourceRef, TargetRef, 32) and
  7783. GetNextInstruction(hp2, hp3) and
  7784. MatchInstruction(hp3, A_MOV, [taicpu(p).opsize]) and
  7785. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  7786. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  7787. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  7788. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  7789. begin
  7790. { Update the register tracking to the new size }
  7791. AllocRegBetween(CurrentReg, hp2, hp3, UsedRegs);
  7792. { hp2 and hp3 are the starting offsets, so mod = 0 this time }
  7793. { Switch to unaligned if the memory isn't on a 32-byte boundary }
  7794. if not(
  7795. ((SourceRef.offset mod 32) = 0) and
  7796. (SourceRef.alignment >= 32) and ((SourceRef.alignment mod 32) = 0)
  7797. ) then
  7798. taicpu(hp2).opcode := A_VMOVDQU;
  7799. taicpu(hp2).opsize := S_YMM;
  7800. taicpu(hp2).oper[1]^.reg := CurrentReg;
  7801. if not (
  7802. ((TargetRef.offset mod 32) = 0) and
  7803. (TargetRef.alignment >= 32) and ((TargetRef.alignment mod 32) = 0)
  7804. ) then
  7805. taicpu(hp3).opcode := A_VMOVDQU;
  7806. taicpu(hp3).opsize := S_YMM;
  7807. taicpu(hp3).oper[0]^.reg := CurrentReg;
  7808. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(CurrentReg) + ' to merge a pair of memory moves (VmovdqxVmovdqxVmovdqxVmovdqx2VmovdqyVmovdqy 2)', p);
  7809. { If pi_uses_ymm is set, VZEROUPPER is present to do this for us }
  7810. if (pi_uses_ymm in current_procinfo.flags) then
  7811. RemoveInstruction(hp1)
  7812. else
  7813. begin
  7814. taicpu(hp1).opcode := A_VPXOR;
  7815. taicpu(hp1).opsize := S_YMM;
  7816. taicpu(hp1).loadreg(0, CurrentReg);
  7817. taicpu(hp1).loadreg(1, CurrentReg);
  7818. taicpu(hp1).loadreg(2, CurrentReg);
  7819. taicpu(hp1).ops := 3;
  7820. Asml.Remove(hp1);
  7821. Asml.InsertAfter(hp1, hp3); { Register deallocations will be after hp3 }
  7822. end;
  7823. RemoveCurrentP(p, hp2);
  7824. Result := True;
  7825. Exit;
  7826. end;
  7827. end;
  7828. end;
  7829. end;
  7830. end;
  7831. end;
  7832. function TX86AsmOptimizer.CheckJumpMovTransferOpt(var p: tai; hp1: tai; LoopCount: Integer; out Count: Integer): Boolean;
  7833. var
  7834. hp2, hp3, first_assignment: tai;
  7835. IncCount, OperIdx: Integer;
  7836. OrigLabel: TAsmLabel;
  7837. begin
  7838. Count := 0;
  7839. Result := False;
  7840. first_assignment := nil;
  7841. if (LoopCount >= 20) then
  7842. begin
  7843. { Guard against infinite loops }
  7844. Exit;
  7845. end;
  7846. if (taicpu(p).oper[0]^.typ <> top_ref) or
  7847. (taicpu(p).oper[0]^.ref^.refaddr <> addr_full) or
  7848. (taicpu(p).oper[0]^.ref^.base <> NR_NO) or
  7849. (taicpu(p).oper[0]^.ref^.index <> NR_NO) or
  7850. not (taicpu(p).oper[0]^.ref^.symbol is TAsmLabel) then
  7851. Exit;
  7852. OrigLabel := TAsmLabel(taicpu(p).oper[0]^.ref^.symbol);
  7853. {
  7854. change
  7855. jmp .L1
  7856. ...
  7857. .L1:
  7858. mov ##, ## ( multiple movs possible )
  7859. jmp/ret
  7860. into
  7861. mov ##, ##
  7862. jmp/ret
  7863. }
  7864. if not Assigned(hp1) then
  7865. begin
  7866. hp1 := GetLabelWithSym(OrigLabel);
  7867. if not Assigned(hp1) or not SkipLabels(hp1, hp1) then
  7868. Exit;
  7869. end;
  7870. hp2 := hp1;
  7871. while Assigned(hp2) do
  7872. begin
  7873. if Assigned(hp2) and (hp2.typ in [ait_label, ait_align]) then
  7874. SkipLabels(hp2,hp2);
  7875. if not Assigned(hp2) or (hp2.typ <> ait_instruction) then
  7876. Break;
  7877. case taicpu(hp2).opcode of
  7878. A_MOVSD:
  7879. begin
  7880. if taicpu(hp2).ops = 0 then
  7881. { Wrong MOVSD }
  7882. Break;
  7883. Inc(Count);
  7884. if Count >= 5 then
  7885. { Too many to be worthwhile }
  7886. Break;
  7887. GetNextInstruction(hp2, hp2);
  7888. Continue;
  7889. end;
  7890. A_MOV,
  7891. A_MOVD,
  7892. A_MOVQ,
  7893. A_MOVSX,
  7894. {$ifdef x86_64}
  7895. A_MOVSXD,
  7896. {$endif x86_64}
  7897. A_MOVZX,
  7898. A_MOVAPS,
  7899. A_MOVUPS,
  7900. A_MOVSS,
  7901. A_MOVAPD,
  7902. A_MOVUPD,
  7903. A_MOVDQA,
  7904. A_MOVDQU,
  7905. A_VMOVSS,
  7906. A_VMOVAPS,
  7907. A_VMOVUPS,
  7908. A_VMOVSD,
  7909. A_VMOVAPD,
  7910. A_VMOVUPD,
  7911. A_VMOVDQA,
  7912. A_VMOVDQU:
  7913. begin
  7914. Inc(Count);
  7915. if Count >= 5 then
  7916. { Too many to be worthwhile }
  7917. Break;
  7918. GetNextInstruction(hp2, hp2);
  7919. Continue;
  7920. end;
  7921. A_JMP:
  7922. begin
  7923. { Guard against infinite loops }
  7924. if taicpu(hp2).oper[0]^.ref^.symbol = OrigLabel then
  7925. Exit;
  7926. { Analyse this jump first in case it also duplicates assignments }
  7927. if CheckJumpMovTransferOpt(hp2, nil, LoopCount + 1, IncCount) then
  7928. begin
  7929. { Something did change! }
  7930. Result := True;
  7931. Inc(Count, IncCount);
  7932. if Count >= 5 then
  7933. begin
  7934. { Too many to be worthwhile }
  7935. Exit;
  7936. end;
  7937. if MatchInstruction(hp2, [A_JMP, A_RET], []) then
  7938. Break;
  7939. end;
  7940. Result := True;
  7941. Break;
  7942. end;
  7943. A_RET:
  7944. begin
  7945. Result := True;
  7946. Break;
  7947. end;
  7948. else
  7949. Break;
  7950. end;
  7951. end;
  7952. if Result then
  7953. begin
  7954. { A count of zero can happen when CheckJumpMovTransferOpt is called recursively }
  7955. if Count = 0 then
  7956. begin
  7957. Result := False;
  7958. Exit;
  7959. end;
  7960. hp3 := p;
  7961. DebugMsg(SPeepholeOptimization + 'Duplicated ' + debug_tostr(Count) + ' assignment(s) and redirected jump', p);
  7962. while True do
  7963. begin
  7964. if Assigned(hp1) and (hp1.typ in [ait_label, ait_align]) then
  7965. SkipLabels(hp1,hp1);
  7966. if (hp1.typ <> ait_instruction) then
  7967. InternalError(2021040720);
  7968. case taicpu(hp1).opcode of
  7969. A_JMP:
  7970. begin
  7971. { Change the original jump to the new destination }
  7972. OrigLabel.decrefs;
  7973. taicpu(hp1).oper[0]^.ref^.symbol.increfs;
  7974. taicpu(p).loadref(0, taicpu(hp1).oper[0]^.ref^);
  7975. { Set p to the first duplicated assignment so it can get optimised if needs be }
  7976. if not Assigned(first_assignment) then
  7977. InternalError(2021040810)
  7978. else
  7979. p := first_assignment;
  7980. Exit;
  7981. end;
  7982. A_RET:
  7983. begin
  7984. { Now change the jump into a RET instruction }
  7985. ConvertJumpToRET(p, hp1);
  7986. { Set p to the first duplicated assignment so it can get optimised if needs be }
  7987. if not Assigned(first_assignment) then
  7988. InternalError(2021040811)
  7989. else
  7990. p := first_assignment;
  7991. Exit;
  7992. end;
  7993. else
  7994. begin
  7995. { Duplicate the MOV instruction }
  7996. hp3:=tai(hp1.getcopy);
  7997. if first_assignment = nil then
  7998. first_assignment := hp3;
  7999. asml.InsertBefore(hp3, p);
  8000. { Make sure the compiler knows about any final registers written here }
  8001. for OperIdx := 0 to taicpu(hp3).ops - 1 do
  8002. with taicpu(hp3).oper[OperIdx]^ do
  8003. begin
  8004. case typ of
  8005. top_ref:
  8006. begin
  8007. if (ref^.base <> NR_NO) and
  8008. (getsupreg(ref^.base) <> RS_ESP) and
  8009. (getsupreg(ref^.base) <> RS_EBP)
  8010. {$ifdef x86_64} and (ref^.base <> NR_RIP) {$endif x86_64}
  8011. then
  8012. AllocRegBetween(ref^.base, hp3, tai(p.Next), UsedRegs);
  8013. if (ref^.index <> NR_NO) and
  8014. (getsupreg(ref^.index) <> RS_ESP) and
  8015. (getsupreg(ref^.index) <> RS_EBP)
  8016. {$ifdef x86_64} and (ref^.index <> NR_RIP) {$endif x86_64} and
  8017. (ref^.index <> ref^.base) then
  8018. AllocRegBetween(ref^.index, hp3, tai(p.Next), UsedRegs);
  8019. end;
  8020. top_reg:
  8021. AllocRegBetween(reg, hp3, tai(p.Next), UsedRegs);
  8022. else
  8023. ;
  8024. end;
  8025. end;
  8026. end;
  8027. end;
  8028. if not GetNextInstruction(hp1, hp1) then
  8029. { Should have dropped out earlier }
  8030. InternalError(2021040710);
  8031. end;
  8032. end;
  8033. end;
  8034. const
  8035. WriteOp: array[0..3] of set of TInsChange = (
  8036. [Ch_Wop1, Ch_RWop1, Ch_Mop1],
  8037. [Ch_Wop2, Ch_RWop2, Ch_Mop2],
  8038. [Ch_Wop3, Ch_RWop3, Ch_Mop3],
  8039. [Ch_Wop4, Ch_RWop4, Ch_Mop4]);
  8040. RegWriteFlags: array[0..7] of set of TInsChange = (
  8041. { The order is important: EAX, ECX, EDX, EBX, ESI, EDI, EBP, ESP }
  8042. [Ch_WEAX, Ch_RWEAX, Ch_MEAX{$ifdef x86_64}, Ch_WRAX, Ch_RWRAX, Ch_MRAX{$endif x86_64}],
  8043. [Ch_WECX, Ch_RWECX, Ch_MECX{$ifdef x86_64}, Ch_WRCX, Ch_RWRCX, Ch_MRCX{$endif x86_64}],
  8044. [Ch_WEDX, Ch_RWEDX, Ch_MEDX{$ifdef x86_64}, Ch_WRDX, Ch_RWRDX, Ch_MRDX{$endif x86_64}],
  8045. [Ch_WEBX, Ch_RWEBX, Ch_MEBX{$ifdef x86_64}, Ch_WRBX, Ch_RWRBX, Ch_MRBX{$endif x86_64}],
  8046. [Ch_WESI, Ch_RWESI, Ch_MESI{$ifdef x86_64}, Ch_WRSI, Ch_RWRSI, Ch_MRSI{$endif x86_64}],
  8047. [Ch_WEDI, Ch_RWEDI, Ch_MEDI{$ifdef x86_64}, Ch_WRDI, Ch_RWRDI, Ch_MRDI{$endif x86_64}],
  8048. [Ch_WEBP, Ch_RWEBP, Ch_MEBP{$ifdef x86_64}, Ch_WRBP, Ch_RWRBP, Ch_MRBP{$endif x86_64}],
  8049. [Ch_WESP, Ch_RWESP, Ch_MESP{$ifdef x86_64}, Ch_WRSP, Ch_RWRSP, Ch_MRSP{$endif x86_64}]);
  8050. function TX86AsmOptimizer.TrySwapMovOp(var p, hp1: tai): Boolean;
  8051. var
  8052. hp2: tai;
  8053. X: Integer;
  8054. begin
  8055. { If we have something like:
  8056. op ###,###
  8057. mov ###,###
  8058. Try to move the MOV instruction to before OP as long as OP and MOV don't
  8059. interfere in regards to what they write to.
  8060. NOTE: p must be a 2-operand instruction
  8061. }
  8062. Result := False;
  8063. if (hp1.typ <> ait_instruction) or
  8064. taicpu(hp1).is_jmp or
  8065. RegInInstruction(NR_DEFAULTFLAGS, hp1) then
  8066. Exit;
  8067. { NOP is a pipeline fence, likely marking the beginning of the function
  8068. epilogue, so drop out. Similarly, drop out if POP or RET are
  8069. encountered }
  8070. if MatchInstruction(hp1, A_NOP, A_POP, A_RET, []) then
  8071. Exit;
  8072. if (taicpu(hp1).opcode = A_MOVSD) and
  8073. (taicpu(hp1).ops = 0) then
  8074. { Wrong MOVSD }
  8075. Exit;
  8076. { Check for writes to specific registers first }
  8077. { EAX, ECX, EDX, EBX, ESI, EDI, EBP, ESP in that order }
  8078. for X := 0 to 7 do
  8079. if (RegWriteFlags[X] * InsProp[taicpu(hp1).opcode].Ch <> [])
  8080. and RegInInstruction(newreg(R_INTREGISTER, TSuperRegister(X), R_SUBWHOLE), p) then
  8081. Exit;
  8082. for X := 0 to taicpu(hp1).ops - 1 do
  8083. begin
  8084. { Check to see if this operand writes to something }
  8085. if ((WriteOp[X] * InsProp[taicpu(hp1).opcode].Ch) <> []) and
  8086. { And matches something in the CMP/TEST instruction }
  8087. (
  8088. MatchOperand(taicpu(hp1).oper[X]^, taicpu(p).oper[0]^) or
  8089. MatchOperand(taicpu(hp1).oper[X]^, taicpu(p).oper[1]^) or
  8090. (
  8091. { If it's a register, make sure the register written to doesn't
  8092. appear in the cmp instruction as part of a reference }
  8093. (taicpu(hp1).oper[X]^.typ = top_reg) and
  8094. RegInInstruction(taicpu(hp1).oper[X]^.reg, p)
  8095. )
  8096. ) then
  8097. Exit;
  8098. end;
  8099. { Check p to make sure it doesn't write to something that affects hp1 }
  8100. { Check for writes to specific registers first }
  8101. { EAX, ECX, EDX, EBX, ESI, EDI, EBP, ESP in that order }
  8102. for X := 0 to 7 do
  8103. if (RegWriteFlags[X] * InsProp[taicpu(p).opcode].Ch <> [])
  8104. and RegInInstruction(newreg(R_INTREGISTER, TSuperRegister(X), R_SUBWHOLE), hp1) then
  8105. Exit;
  8106. for X := 0 to taicpu(p).ops - 1 do
  8107. begin
  8108. { Check to see if this operand writes to something }
  8109. if ((WriteOp[X] * InsProp[taicpu(p).opcode].Ch) <> []) and
  8110. { And matches something in hp1 }
  8111. (taicpu(p).oper[X]^.typ = top_reg) and
  8112. RegInInstruction(taicpu(p).oper[X]^.reg, hp1) then
  8113. Exit;
  8114. end;
  8115. { The instruction can be safely moved }
  8116. asml.Remove(hp1);
  8117. { Try to insert after the last instructions where the FLAGS register is not
  8118. yet in use, so "mov $0,%reg" can be optimised into "xor %reg,%reg" later }
  8119. if SetAndTest(FindRegAllocBackward(NR_DEFAULTFLAGS, tai(p.Previous)), hp2) then
  8120. asml.InsertBefore(hp1, hp2)
  8121. { Failing that, try to insert after the last instructions where the
  8122. FLAGS register is not yet in use }
  8123. else if GetLastInstruction(p, hp2) and
  8124. (
  8125. (hp2.typ <> ait_instruction) or
  8126. { Don't insert after an instruction that uses the flags when p doesn't use them }
  8127. RegInInstruction(NR_DEFAULTFLAGS, p) or
  8128. not RegInInstruction(NR_DEFAULTFLAGS, hp2)
  8129. ) then
  8130. asml.InsertAfter(hp1, hp2)
  8131. else
  8132. { Note, if p.Previous is nil (even if it should logically never be the
  8133. case), FindRegAllocBackward immediately exits with False and so we
  8134. safely land here (we can't just pass p because FindRegAllocBackward
  8135. immediately exits on an instruction). [Kit] }
  8136. asml.InsertBefore(hp1, p);
  8137. DebugMsg(SPeepholeOptimization + 'Swapped ' + debug_op2str(taicpu(p).opcode) + ' and ' + debug_op2str(taicpu(hp1).opcode) + ' instructions to improve optimisation potential', hp1);
  8138. { We can't trust UsedRegs because we're looking backwards, although we
  8139. know the registers are allocated after p at the very least, so manually
  8140. create tai_regalloc objects if needed }
  8141. for X := 0 to taicpu(hp1).ops - 1 do
  8142. case taicpu(hp1).oper[X]^.typ of
  8143. top_reg:
  8144. begin
  8145. asml.InsertBefore(tai_regalloc.alloc(taicpu(hp1).oper[X]^.reg, nil), hp1);
  8146. IncludeRegInUsedRegs(taicpu(hp1).oper[X]^.reg, UsedRegs);
  8147. AllocRegBetween(taicpu(hp1).oper[X]^.reg, hp1, p, UsedRegs);
  8148. end;
  8149. top_ref:
  8150. begin
  8151. if taicpu(hp1).oper[X]^.ref^.base <> NR_NO then
  8152. begin
  8153. asml.InsertBefore(tai_regalloc.alloc(taicpu(hp1).oper[X]^.ref^.base, nil), hp1);
  8154. IncludeRegInUsedRegs(taicpu(hp1).oper[X]^.ref^.base, UsedRegs);
  8155. AllocRegBetween(taicpu(hp1).oper[X]^.ref^.base, hp1, p, UsedRegs);
  8156. end;
  8157. if taicpu(hp1).oper[X]^.ref^.index <> NR_NO then
  8158. begin
  8159. asml.InsertBefore(tai_regalloc.alloc(taicpu(hp1).oper[X]^.ref^.index, nil), hp1);
  8160. IncludeRegInUsedRegs(taicpu(hp1).oper[X]^.ref^.index, UsedRegs);
  8161. AllocRegBetween(taicpu(hp1).oper[X]^.ref^.index, hp1, p, UsedRegs);
  8162. end;
  8163. end;
  8164. else
  8165. ;
  8166. end;
  8167. Result := True;
  8168. end;
  8169. function TX86AsmOptimizer.TrySwapMovCmp(var p, hp1: tai): Boolean;
  8170. var
  8171. hp2: tai;
  8172. X: Integer;
  8173. begin
  8174. { If we have something like:
  8175. cmp ###,%reg1
  8176. mov 0,%reg2
  8177. And no modified registers are shared, move the instruction to before
  8178. the comparison as this means it can be optimised without worrying
  8179. about the FLAGS register. (CMP/MOV is generated by
  8180. "J(c)Mov1JmpMov0 -> Set(~c)", among other things).
  8181. As long as the second instruction doesn't use the flags or one of the
  8182. registers used by CMP or TEST (also check any references that use the
  8183. registers), then it can be moved prior to the comparison.
  8184. }
  8185. Result := False;
  8186. if not TrySwapMovOp(p, hp1) then
  8187. Exit;
  8188. if taicpu(hp1).opcode = A_LEA then
  8189. { The flags will be overwritten by the CMP/TEST instruction }
  8190. ConvertLEA(taicpu(hp1));
  8191. Result := True;
  8192. { Can we move it one further back? }
  8193. if GetLastInstruction(hp1, hp2) and (hp2.typ = ait_instruction) and
  8194. { Check to see if CMP/TEST is a comparison against zero }
  8195. (
  8196. (
  8197. (taicpu(p).opcode = A_CMP) and
  8198. MatchOperand(taicpu(p).oper[0]^, 0)
  8199. ) or
  8200. (
  8201. (taicpu(p).opcode = A_TEST) and
  8202. (
  8203. OpsEqual(taicpu(p).oper[0]^, taicpu(p).oper[1]^) or
  8204. MatchOperand(taicpu(p).oper[0]^, -1)
  8205. )
  8206. )
  8207. ) and
  8208. { These instructions set the zero flag if the result is zero }
  8209. MatchInstruction(hp2, [A_ADD, A_SUB, A_OR, A_XOR, A_AND, A_POPCNT, A_LZCNT], []) and
  8210. OpsEqual(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^) then
  8211. { Looks like we can - if successful, this benefits PostPeepholeOptTestOr }
  8212. TrySwapMovOp(hp2, hp1);
  8213. end;
  8214. function TX86AsmOptimizer.OptPass2MOV(var p : tai) : boolean;
  8215. function IsXCHGAcceptable: Boolean; inline;
  8216. begin
  8217. { Always accept if optimising for size }
  8218. Result := (cs_opt_size in current_settings.optimizerswitches) or
  8219. { From the Pentium M onwards, XCHG only has a latency of 2 rather
  8220. than 3, so it becomes a saving compared to three MOVs with two of
  8221. them able to execute simultaneously. [Kit] }
  8222. (CPUX86_HINT_FAST_XCHG in cpu_optimization_hints[current_settings.optimizecputype]);
  8223. end;
  8224. var
  8225. NewRef: TReference;
  8226. hp1, hp2, hp3, hp4: Tai;
  8227. {$ifndef x86_64}
  8228. OperIdx: Integer;
  8229. {$endif x86_64}
  8230. NewInstr : Taicpu;
  8231. NewAligh : Tai_align;
  8232. DestLabel: TAsmLabel;
  8233. TempTracking: TAllUsedRegs;
  8234. function TryMovArith2Lea(InputInstr: tai): Boolean;
  8235. var
  8236. NextInstr: tai;
  8237. begin
  8238. Result := False;
  8239. UpdateUsedRegs(TmpUsedRegs, tai(InputInstr.Next));
  8240. if not GetNextInstruction(InputInstr, NextInstr) or
  8241. (
  8242. { The FLAGS register isn't always tracked properly, so do not
  8243. perform this optimisation if a conditional statement follows }
  8244. not RegReadByInstruction(NR_DEFAULTFLAGS, NextInstr) and
  8245. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, NextInstr, TmpUsedRegs)
  8246. ) then
  8247. begin
  8248. reference_reset(NewRef, 1, []);
  8249. NewRef.base := taicpu(p).oper[0]^.reg;
  8250. NewRef.scalefactor := 1;
  8251. if taicpu(InputInstr).opcode = A_ADD then
  8252. begin
  8253. DebugMsg(SPeepholeOptimization + 'MovAdd2Lea', p);
  8254. NewRef.offset := taicpu(InputInstr).oper[0]^.val;
  8255. end
  8256. else
  8257. begin
  8258. DebugMsg(SPeepholeOptimization + 'MovSub2Lea', p);
  8259. NewRef.offset := -taicpu(InputInstr).oper[0]^.val;
  8260. end;
  8261. taicpu(p).opcode := A_LEA;
  8262. taicpu(p).loadref(0, NewRef);
  8263. RemoveInstruction(InputInstr);
  8264. Result := True;
  8265. end;
  8266. end;
  8267. begin
  8268. Result:=false;
  8269. { This optimisation adds an instruction, so only do it for speed }
  8270. if not (cs_opt_size in current_settings.optimizerswitches) and
  8271. MatchOpType(taicpu(p), top_const, top_reg) and
  8272. (taicpu(p).oper[0]^.val = 0) then
  8273. begin
  8274. { To avoid compiler warning }
  8275. DestLabel := nil;
  8276. if (p.typ <> ait_instruction) or (taicpu(p).oper[1]^.typ <> top_reg) then
  8277. InternalError(2021040750);
  8278. if not GetNextInstructionUsingReg(p, hp1, taicpu(p).oper[1]^.reg) then
  8279. Exit;
  8280. case hp1.typ of
  8281. ait_align,
  8282. ait_label:
  8283. begin
  8284. { Change:
  8285. mov $0,%reg mov $0,%reg
  8286. @Lbl1: @Lbl1:
  8287. test %reg,%reg / cmp $0,%reg test %reg,%reg / mov $0,%reg
  8288. je @Lbl2 jne @Lbl2
  8289. To: To:
  8290. mov $0,%reg mov $0,%reg
  8291. jmp @Lbl2 jmp @Lbl3
  8292. (align) (align)
  8293. @Lbl1: @Lbl1:
  8294. test %reg,%reg / cmp $0,%reg test %reg,%reg / cmp $0,%reg
  8295. je @Lbl2 je @Lbl2
  8296. @Lbl3: <-- Only if label exists
  8297. (Not if it's optimised for size)
  8298. }
  8299. if not SkipAligns(hp1, hp1) or not GetNextInstruction(hp1, hp2) then
  8300. Exit;
  8301. if (hp2.typ = ait_instruction) and
  8302. (
  8303. { Register sizes must exactly match }
  8304. (
  8305. (taicpu(hp2).opcode = A_CMP) and
  8306. MatchOperand(taicpu(hp2).oper[0]^, 0) and
  8307. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^.reg)
  8308. ) or (
  8309. (taicpu(hp2).opcode = A_TEST) and
  8310. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[1]^.reg) and
  8311. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^.reg)
  8312. )
  8313. ) and GetNextInstruction(hp2, hp3) and
  8314. (hp3.typ = ait_instruction) and
  8315. (taicpu(hp3).opcode = A_JCC) and
  8316. (taicpu(hp3).oper[0]^.typ=top_ref) and (taicpu(hp3).oper[0]^.ref^.refaddr=addr_full) and (taicpu(hp3).oper[0]^.ref^.base=NR_NO) and
  8317. (taicpu(hp3).oper[0]^.ref^.index=NR_NO) and (taicpu(hp3).oper[0]^.ref^.symbol is tasmlabel) then
  8318. begin
  8319. { Check condition of jump }
  8320. { Always true? }
  8321. if condition_in(C_E, taicpu(hp3).condition) then
  8322. begin
  8323. { Copy label symbol and obtain matching label entry for the
  8324. conditional jump, as this will be our destination}
  8325. DestLabel := tasmlabel(taicpu(hp3).oper[0]^.ref^.symbol);
  8326. DebugMsg(SPeepholeOptimization + 'Mov0LblCmp0Je -> Mov0JmpLblCmp0Je', p);
  8327. Result := True;
  8328. end
  8329. { Always false? }
  8330. else if condition_in(C_NE, taicpu(hp3).condition) and GetNextInstruction(hp3, hp2) then
  8331. begin
  8332. { This is only worth it if there's a jump to take }
  8333. case hp2.typ of
  8334. ait_instruction:
  8335. begin
  8336. if taicpu(hp2).opcode = A_JMP then
  8337. begin
  8338. DestLabel := tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol);
  8339. { An unconditional jump follows the conditional jump which will always be false,
  8340. so use this jump's destination for the new jump }
  8341. DebugMsg(SPeepholeOptimization + 'Mov0LblCmp0Jne -> Mov0JmpLblCmp0Jne (with JMP)', p);
  8342. Result := True;
  8343. end
  8344. else if taicpu(hp2).opcode = A_JCC then
  8345. begin
  8346. DestLabel := tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol);
  8347. if condition_in(C_E, taicpu(hp2).condition) then
  8348. begin
  8349. { A second conditional jump follows the conditional jump which will always be false,
  8350. while the second jump is always True, so use this jump's destination for the new jump }
  8351. DebugMsg(SPeepholeOptimization + 'Mov0LblCmp0Jne -> Mov0JmpLblCmp0Jne (with second Jcc)', p);
  8352. Result := True;
  8353. end;
  8354. { Don't risk it if the jump isn't always true (Result remains False) }
  8355. end;
  8356. end;
  8357. else
  8358. { If anything else don't optimise };
  8359. end;
  8360. end;
  8361. if Result then
  8362. begin
  8363. { Just so we have something to insert as a paremeter}
  8364. reference_reset(NewRef, 1, []);
  8365. NewInstr := taicpu.op_ref(A_JMP, S_NO, NewRef);
  8366. { Now actually load the correct parameter (this also
  8367. increases the reference count) }
  8368. NewInstr.loadsymbol(0, DestLabel, 0);
  8369. if (cs_opt_level3 in current_settings.optimizerswitches) then
  8370. begin
  8371. { Get instruction before original label (may not be p under -O3) }
  8372. if not GetLastInstruction(hp1, hp2) then
  8373. { Shouldn't fail here }
  8374. InternalError(2021040701);
  8375. { Before the aligns too }
  8376. while (hp2.typ = ait_align) do
  8377. if not GetLastInstruction(hp2, hp2) then
  8378. { Shouldn't fail here }
  8379. InternalError(2021040702);
  8380. end
  8381. else
  8382. hp2 := p;
  8383. taicpu(NewInstr).fileinfo := taicpu(hp2).fileinfo;
  8384. AsmL.InsertAfter(NewInstr, hp2);
  8385. { Add new alignment field }
  8386. (* AsmL.InsertAfter(
  8387. cai_align.create_max(
  8388. current_settings.alignment.jumpalign,
  8389. current_settings.alignment.jumpalignskipmax
  8390. ),
  8391. NewInstr
  8392. ); *)
  8393. end;
  8394. Exit;
  8395. end;
  8396. end;
  8397. else
  8398. ;
  8399. end;
  8400. end;
  8401. if not GetNextInstruction(p, hp1) then
  8402. Exit;
  8403. if MatchInstruction(hp1, A_CMP, A_TEST, [taicpu(p).opsize])
  8404. and DoMovCmpMemOpt(p, hp1, True) then
  8405. begin
  8406. Result := True;
  8407. Exit;
  8408. end
  8409. else if MatchInstruction(hp1, A_JMP, [S_NO]) then
  8410. begin
  8411. { Sometimes the MOVs that OptPass2JMP produces can be improved
  8412. further, but we can't just put this jump optimisation in pass 1
  8413. because it tends to perform worse when conditional jumps are
  8414. nearby (e.g. when converting CMOV instructions). [Kit] }
  8415. CopyUsedRegs(TempTracking);
  8416. UpdateUsedRegs(tai(p.Next));
  8417. if OptPass2JMP(hp1) then
  8418. { call OptPass1MOV once to potentially merge any MOVs that were created }
  8419. Result := OptPass1MOV(p);
  8420. { OptPass2MOV will now exit but will be called again if OptPass1MOV
  8421. returned True and the instruction is still a MOV, thus checking
  8422. the optimisations below }
  8423. { If OptPass2JMP returned False, no optimisations were done to
  8424. the jump and there are no further optimisations that can be done
  8425. to the MOV instruction on this pass }
  8426. { Restore register state }
  8427. RestoreUsedRegs(TempTracking);
  8428. ReleaseUsedRegs(TempTracking);
  8429. end
  8430. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8431. (taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) and
  8432. MatchInstruction(hp1,A_ADD,A_SUB,[taicpu(p).opsize]) and
  8433. (taicpu(hp1).oper[1]^.typ = top_reg) and
  8434. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  8435. begin
  8436. { Change:
  8437. movl/q %reg1,%reg2 movl/q %reg1,%reg2
  8438. addl/q $x,%reg2 subl/q $x,%reg2
  8439. To:
  8440. leal/q x(%reg1),%reg2 leal/q -x(%reg1),%reg2
  8441. }
  8442. if (taicpu(hp1).oper[0]^.typ = top_const) and
  8443. { be lazy, checking separately for sub would be slightly better }
  8444. (abs(taicpu(hp1).oper[0]^.val)<=$7fffffff) then
  8445. begin
  8446. TransferUsedRegs(TmpUsedRegs);
  8447. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8448. if TryMovArith2Lea(hp1) then
  8449. begin
  8450. Result := True;
  8451. Exit;
  8452. end
  8453. end
  8454. else if not RegInOp(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^) and
  8455. GetNextInstructionUsingReg(hp1, hp2, taicpu(p).oper[1]^.reg) and
  8456. { Same as above, but also adds or subtracts to %reg2 in between.
  8457. It's still valid as long as the flags aren't in use }
  8458. MatchInstruction(hp2,A_ADD,A_SUB,[taicpu(p).opsize]) and
  8459. MatchOpType(taicpu(hp2), top_const, top_reg) and
  8460. (taicpu(hp2).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  8461. { be lazy, checking separately for sub would be slightly better }
  8462. (abs(taicpu(hp2).oper[0]^.val)<=$7fffffff) then
  8463. begin
  8464. TransferUsedRegs(TmpUsedRegs);
  8465. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8466. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  8467. if TryMovArith2Lea(hp2) then
  8468. begin
  8469. Result := True;
  8470. Exit;
  8471. end;
  8472. end;
  8473. end
  8474. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8475. {$ifdef x86_64}
  8476. MatchInstruction(hp1,A_MOVZX,A_MOVSX,A_MOVSXD,[]) and
  8477. {$else x86_64}
  8478. MatchInstruction(hp1,A_MOVZX,A_MOVSX,[]) and
  8479. {$endif x86_64}
  8480. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  8481. (taicpu(hp1).oper[0]^.reg = taicpu(p).oper[1]^.reg) then
  8482. { mov reg1, reg2 mov reg1, reg2
  8483. movzx/sx reg2, reg3 to movzx/sx reg1, reg3}
  8484. begin
  8485. taicpu(hp1).oper[0]^.reg := taicpu(p).oper[0]^.reg;
  8486. DebugMsg(SPeepholeOptimization + 'mov %reg1,%reg2; movzx/sx %reg2,%reg3 -> mov %reg1,%reg2;movzx/sx %reg1,%reg3',p);
  8487. { Don't remove the MOV command without first checking that reg2 isn't used afterwards,
  8488. or unless supreg(reg3) = supreg(reg2)). [Kit] }
  8489. TransferUsedRegs(TmpUsedRegs);
  8490. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  8491. if (getsupreg(taicpu(p).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) or
  8492. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs)
  8493. then
  8494. begin
  8495. RemoveCurrentP(p, hp1);
  8496. Result:=true;
  8497. end;
  8498. exit;
  8499. end
  8500. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8501. IsXCHGAcceptable and
  8502. { XCHG doesn't support 8-byte registers }
  8503. (taicpu(p).opsize <> S_B) and
  8504. MatchInstruction(hp1, A_MOV, []) and
  8505. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  8506. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[0]^.reg) and
  8507. GetNextInstruction(hp1, hp2) and
  8508. MatchInstruction(hp2, A_MOV, []) and
  8509. { Don't need to call MatchOpType for hp2 because the operand matches below cover for it }
  8510. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[1]^.reg) and
  8511. MatchOperand(taicpu(hp2).oper[1]^, taicpu(hp1).oper[0]^.reg) then
  8512. begin
  8513. { mov %reg1,%reg2
  8514. mov %reg3,%reg1 -> xchg %reg3,%reg1
  8515. mov %reg2,%reg3
  8516. (%reg2 not used afterwards)
  8517. Note that xchg takes 3 cycles to execute, and generally mov's take
  8518. only one cycle apiece, but the first two mov's can be executed in
  8519. parallel, only taking 2 cycles overall. Older processors should
  8520. therefore only optimise for size. [Kit]
  8521. }
  8522. TransferUsedRegs(TmpUsedRegs);
  8523. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8524. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  8525. if not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp2, TmpUsedRegs) then
  8526. begin
  8527. DebugMsg(SPeepholeOptimization + 'MovMovMov2XChg', p);
  8528. AllocRegBetween(taicpu(hp2).oper[1]^.reg, p, hp1, UsedRegs);
  8529. taicpu(hp1).opcode := A_XCHG;
  8530. RemoveCurrentP(p, hp1);
  8531. RemoveInstruction(hp2);
  8532. Result := True;
  8533. Exit;
  8534. end;
  8535. end
  8536. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8537. MatchInstruction(hp1, A_SAR, []) then
  8538. begin
  8539. if MatchOperand(taicpu(hp1).oper[0]^, 31) then
  8540. begin
  8541. { the use of %edx also covers the opsize being S_L }
  8542. if MatchOperand(taicpu(hp1).oper[1]^, NR_EDX) then
  8543. begin
  8544. { Note it has to be specifically "movl %eax,%edx", and those specific sub-registers }
  8545. if (taicpu(p).oper[0]^.reg = NR_EAX) and
  8546. (taicpu(p).oper[1]^.reg = NR_EDX) then
  8547. begin
  8548. { Change:
  8549. movl %eax,%edx
  8550. sarl $31,%edx
  8551. To:
  8552. cltd
  8553. }
  8554. DebugMsg(SPeepholeOptimization + 'MovSar2Cltd', p);
  8555. RemoveInstruction(hp1);
  8556. taicpu(p).opcode := A_CDQ;
  8557. taicpu(p).opsize := S_NO;
  8558. taicpu(p).clearop(1);
  8559. taicpu(p).clearop(0);
  8560. taicpu(p).ops:=0;
  8561. Result := True;
  8562. end
  8563. else if (cs_opt_size in current_settings.optimizerswitches) and
  8564. (taicpu(p).oper[0]^.reg = NR_EDX) and
  8565. (taicpu(p).oper[1]^.reg = NR_EAX) then
  8566. begin
  8567. { Change:
  8568. movl %edx,%eax
  8569. sarl $31,%edx
  8570. To:
  8571. movl %edx,%eax
  8572. cltd
  8573. Note that this creates a dependency between the two instructions,
  8574. so only perform if optimising for size.
  8575. }
  8576. DebugMsg(SPeepholeOptimization + 'MovSar2MovCltd', p);
  8577. taicpu(hp1).opcode := A_CDQ;
  8578. taicpu(hp1).opsize := S_NO;
  8579. taicpu(hp1).clearop(1);
  8580. taicpu(hp1).clearop(0);
  8581. taicpu(hp1).ops:=0;
  8582. end;
  8583. {$ifndef x86_64}
  8584. end
  8585. { Don't bother if CMOV is supported, because a more optimal
  8586. sequence would have been generated for the Abs() intrinsic }
  8587. else if not(CPUX86_HAS_CMOV in cpu_capabilities[current_settings.cputype]) and
  8588. { the use of %eax also covers the opsize being S_L }
  8589. MatchOperand(taicpu(hp1).oper[1]^, NR_EAX) and
  8590. (taicpu(p).oper[0]^.reg = NR_EAX) and
  8591. (taicpu(p).oper[1]^.reg = NR_EDX) and
  8592. GetNextInstruction(hp1, hp2) and
  8593. MatchInstruction(hp2, A_XOR, [S_L]) and
  8594. MatchOperand(taicpu(hp2).oper[0]^, NR_EAX) and
  8595. MatchOperand(taicpu(hp2).oper[1]^, NR_EDX) and
  8596. GetNextInstruction(hp2, hp3) and
  8597. MatchInstruction(hp3, A_SUB, [S_L]) and
  8598. MatchOperand(taicpu(hp3).oper[0]^, NR_EAX) and
  8599. MatchOperand(taicpu(hp3).oper[1]^, NR_EDX) then
  8600. begin
  8601. { Change:
  8602. movl %eax,%edx
  8603. sarl $31,%eax
  8604. xorl %eax,%edx
  8605. subl %eax,%edx
  8606. (Instruction that uses %edx)
  8607. (%eax deallocated)
  8608. (%edx deallocated)
  8609. To:
  8610. cltd
  8611. xorl %edx,%eax <-- Note the registers have swapped
  8612. subl %edx,%eax
  8613. (Instruction that uses %eax) <-- %eax rather than %edx
  8614. }
  8615. TransferUsedRegs(TmpUsedRegs);
  8616. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8617. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  8618. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  8619. if not RegUsedAfterInstruction(NR_EAX, hp3, TmpUsedRegs) then
  8620. begin
  8621. if GetNextInstruction(hp3, hp4) and
  8622. not RegModifiedByInstruction(NR_EDX, hp4) and
  8623. not RegUsedAfterInstruction(NR_EDX, hp4, TmpUsedRegs) then
  8624. begin
  8625. DebugMsg(SPeepholeOptimization + 'abs() intrinsic optimisation', p);
  8626. taicpu(p).opcode := A_CDQ;
  8627. taicpu(p).clearop(1);
  8628. taicpu(p).clearop(0);
  8629. taicpu(p).ops:=0;
  8630. RemoveInstruction(hp1);
  8631. taicpu(hp2).loadreg(0, NR_EDX);
  8632. taicpu(hp2).loadreg(1, NR_EAX);
  8633. taicpu(hp3).loadreg(0, NR_EDX);
  8634. taicpu(hp3).loadreg(1, NR_EAX);
  8635. AllocRegBetween(NR_EAX, hp3, hp4, TmpUsedRegs);
  8636. { Convert references in the following instruction (hp4) from %edx to %eax }
  8637. for OperIdx := 0 to taicpu(hp4).ops - 1 do
  8638. with taicpu(hp4).oper[OperIdx]^ do
  8639. case typ of
  8640. top_reg:
  8641. if getsupreg(reg) = RS_EDX then
  8642. reg := newreg(R_INTREGISTER,RS_EAX,getsubreg(reg));
  8643. top_ref:
  8644. begin
  8645. if getsupreg(reg) = RS_EDX then
  8646. ref^.base := newreg(R_INTREGISTER,RS_EAX,getsubreg(reg));
  8647. if getsupreg(reg) = RS_EDX then
  8648. ref^.index := newreg(R_INTREGISTER,RS_EAX,getsubreg(reg));
  8649. end;
  8650. else
  8651. ;
  8652. end;
  8653. end;
  8654. end;
  8655. {$else x86_64}
  8656. end;
  8657. end
  8658. else if MatchOperand(taicpu(hp1).oper[0]^, 63) and
  8659. { the use of %rdx also covers the opsize being S_Q }
  8660. MatchOperand(taicpu(hp1).oper[1]^, NR_RDX) then
  8661. begin
  8662. { Note it has to be specifically "movq %rax,%rdx", and those specific sub-registers }
  8663. if (taicpu(p).oper[0]^.reg = NR_RAX) and
  8664. (taicpu(p).oper[1]^.reg = NR_RDX) then
  8665. begin
  8666. { Change:
  8667. movq %rax,%rdx
  8668. sarq $63,%rdx
  8669. To:
  8670. cqto
  8671. }
  8672. DebugMsg(SPeepholeOptimization + 'MovSar2Cqto', p);
  8673. RemoveInstruction(hp1);
  8674. taicpu(p).opcode := A_CQO;
  8675. taicpu(p).opsize := S_NO;
  8676. taicpu(p).clearop(1);
  8677. taicpu(p).clearop(0);
  8678. taicpu(p).ops:=0;
  8679. Result := True;
  8680. end
  8681. else if (cs_opt_size in current_settings.optimizerswitches) and
  8682. (taicpu(p).oper[0]^.reg = NR_RDX) and
  8683. (taicpu(p).oper[1]^.reg = NR_RAX) then
  8684. begin
  8685. { Change:
  8686. movq %rdx,%rax
  8687. sarq $63,%rdx
  8688. To:
  8689. movq %rdx,%rax
  8690. cqto
  8691. Note that this creates a dependency between the two instructions,
  8692. so only perform if optimising for size.
  8693. }
  8694. DebugMsg(SPeepholeOptimization + 'MovSar2MovCqto', p);
  8695. taicpu(hp1).opcode := A_CQO;
  8696. taicpu(hp1).opsize := S_NO;
  8697. taicpu(hp1).clearop(1);
  8698. taicpu(hp1).clearop(0);
  8699. taicpu(hp1).ops:=0;
  8700. {$endif x86_64}
  8701. end;
  8702. end;
  8703. end
  8704. else if MatchInstruction(hp1, A_MOV, []) and
  8705. (taicpu(hp1).oper[1]^.typ = top_reg) then
  8706. { Though "GetNextInstruction" could be factored out, along with
  8707. the instructions that depend on hp2, it is an expensive call that
  8708. should be delayed for as long as possible, hence we do cheaper
  8709. checks first that are likely to be False. [Kit] }
  8710. begin
  8711. if (
  8712. (
  8713. MatchOperand(taicpu(p).oper[1]^, NR_EDX) and
  8714. (taicpu(hp1).oper[1]^.reg = NR_EAX) and
  8715. (
  8716. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8717. MatchOperand(taicpu(hp1).oper[0]^, NR_EDX)
  8718. )
  8719. ) or
  8720. (
  8721. MatchOperand(taicpu(p).oper[1]^, NR_EAX) and
  8722. (taicpu(hp1).oper[1]^.reg = NR_EDX) and
  8723. (
  8724. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8725. MatchOperand(taicpu(hp1).oper[0]^, NR_EAX)
  8726. )
  8727. )
  8728. ) and
  8729. GetNextInstruction(hp1, hp2) and
  8730. MatchInstruction(hp2, A_SAR, []) and
  8731. MatchOperand(taicpu(hp2).oper[0]^, 31) then
  8732. begin
  8733. if MatchOperand(taicpu(hp2).oper[1]^, NR_EDX) then
  8734. begin
  8735. { Change:
  8736. movl r/m,%edx movl r/m,%eax movl r/m,%edx movl r/m,%eax
  8737. movl %edx,%eax or movl %eax,%edx or movl r/m,%eax or movl r/m,%edx
  8738. sarl $31,%edx sarl $31,%edx sarl $31,%edx sarl $31,%edx
  8739. To:
  8740. movl r/m,%eax <- Note the change in register
  8741. cltd
  8742. }
  8743. DebugMsg(SPeepholeOptimization + 'MovMovSar2MovCltd', p);
  8744. AllocRegBetween(NR_EAX, p, hp1, UsedRegs);
  8745. taicpu(p).loadreg(1, NR_EAX);
  8746. taicpu(hp1).opcode := A_CDQ;
  8747. taicpu(hp1).clearop(1);
  8748. taicpu(hp1).clearop(0);
  8749. taicpu(hp1).ops:=0;
  8750. RemoveInstruction(hp2);
  8751. (*
  8752. {$ifdef x86_64}
  8753. end
  8754. else if MatchOperand(taicpu(hp2).oper[1]^, NR_RDX) and
  8755. { This code sequence does not get generated - however it might become useful
  8756. if and when 128-bit signed integer types make an appearance, so the code
  8757. is kept here for when it is eventually needed. [Kit] }
  8758. (
  8759. (
  8760. (taicpu(hp1).oper[1]^.reg = NR_RAX) and
  8761. (
  8762. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8763. MatchOperand(taicpu(hp1).oper[0]^, NR_RDX)
  8764. )
  8765. ) or
  8766. (
  8767. (taicpu(hp1).oper[1]^.reg = NR_RDX) and
  8768. (
  8769. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8770. MatchOperand(taicpu(hp1).oper[0]^, NR_RAX)
  8771. )
  8772. )
  8773. ) and
  8774. GetNextInstruction(hp1, hp2) and
  8775. MatchInstruction(hp2, A_SAR, [S_Q]) and
  8776. MatchOperand(taicpu(hp2).oper[0]^, 63) and
  8777. MatchOperand(taicpu(hp2).oper[1]^, NR_RDX) then
  8778. begin
  8779. { Change:
  8780. movq r/m,%rdx movq r/m,%rax movq r/m,%rdx movq r/m,%rax
  8781. movq %rdx,%rax or movq %rax,%rdx or movq r/m,%rax or movq r/m,%rdx
  8782. sarq $63,%rdx sarq $63,%rdx sarq $63,%rdx sarq $63,%rdx
  8783. To:
  8784. movq r/m,%rax <- Note the change in register
  8785. cqto
  8786. }
  8787. DebugMsg(SPeepholeOptimization + 'MovMovSar2MovCqto', p);
  8788. AllocRegBetween(NR_RAX, p, hp1, UsedRegs);
  8789. taicpu(p).loadreg(1, NR_RAX);
  8790. taicpu(hp1).opcode := A_CQO;
  8791. taicpu(hp1).clearop(1);
  8792. taicpu(hp1).clearop(0);
  8793. taicpu(hp1).ops:=0;
  8794. RemoveInstruction(hp2);
  8795. {$endif x86_64}
  8796. *)
  8797. end;
  8798. end;
  8799. {$ifdef x86_64}
  8800. end
  8801. else if (taicpu(p).opsize = S_L) and
  8802. (taicpu(p).oper[1]^.typ = top_reg) and
  8803. (
  8804. MatchInstruction(hp1, A_MOV,[]) and
  8805. (taicpu(hp1).opsize = S_L) and
  8806. (taicpu(hp1).oper[1]^.typ = top_reg)
  8807. ) and (
  8808. GetNextInstruction(hp1, hp2) and
  8809. (tai(hp2).typ=ait_instruction) and
  8810. (taicpu(hp2).opsize = S_Q) and
  8811. (
  8812. (
  8813. MatchInstruction(hp2, A_ADD,[]) and
  8814. (taicpu(hp2).opsize = S_Q) and
  8815. (taicpu(hp2).oper[0]^.typ = top_reg) and (taicpu(hp2).oper[1]^.typ = top_reg) and
  8816. (
  8817. (
  8818. (getsupreg(taicpu(hp2).oper[0]^.reg) = getsupreg(taicpu(p).oper[1]^.reg)) and
  8819. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg))
  8820. ) or (
  8821. (getsupreg(taicpu(hp2).oper[0]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) and
  8822. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(p).oper[1]^.reg))
  8823. )
  8824. )
  8825. ) or (
  8826. MatchInstruction(hp2, A_LEA,[]) and
  8827. (taicpu(hp2).oper[0]^.ref^.offset = 0) and
  8828. (taicpu(hp2).oper[0]^.ref^.scalefactor <= 1) and
  8829. (
  8830. (
  8831. (getsupreg(taicpu(hp2).oper[0]^.ref^.base) = getsupreg(taicpu(p).oper[1]^.reg)) and
  8832. (getsupreg(taicpu(hp2).oper[0]^.ref^.index) = getsupreg(taicpu(hp1).oper[1]^.reg))
  8833. ) or (
  8834. (getsupreg(taicpu(hp2).oper[0]^.ref^.base) = getsupreg(taicpu(hp1).oper[1]^.reg)) and
  8835. (getsupreg(taicpu(hp2).oper[0]^.ref^.index) = getsupreg(taicpu(p).oper[1]^.reg))
  8836. )
  8837. ) and (
  8838. (
  8839. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg))
  8840. ) or (
  8841. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(p).oper[1]^.reg))
  8842. )
  8843. )
  8844. )
  8845. )
  8846. ) and (
  8847. GetNextInstruction(hp2, hp3) and
  8848. MatchInstruction(hp3, A_SHR,[]) and
  8849. (taicpu(hp3).opsize = S_Q) and
  8850. (taicpu(hp3).oper[0]^.typ = top_const) and (taicpu(hp2).oper[1]^.typ = top_reg) and
  8851. (taicpu(hp3).oper[0]^.val = 1) and
  8852. (taicpu(hp3).oper[1]^.reg = taicpu(hp2).oper[1]^.reg)
  8853. ) then
  8854. begin
  8855. { Change movl x, reg1d movl x, reg1d
  8856. movl y, reg2d movl y, reg2d
  8857. addq reg2q,reg1q or leaq (reg1q,reg2q),reg1q
  8858. shrq $1, reg1q shrq $1, reg1q
  8859. ( reg1d and reg2d can be switched around in the first two instructions )
  8860. To movl x, reg1d
  8861. addl y, reg1d
  8862. rcrl $1, reg1d
  8863. This corresponds to the common expression (x + y) shr 1, where
  8864. x and y are Cardinals (replacing "shr 1" with "div 2" produces
  8865. smaller code, but won't account for x + y causing an overflow). [Kit]
  8866. }
  8867. DebugMsg(SPeepholeOptimization + 'MovMov*Shr2MovMov*Rcr', p);
  8868. if (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) then
  8869. { Change first MOV command to have the same register as the final output }
  8870. taicpu(p).oper[1]^.reg := taicpu(hp1).oper[1]^.reg
  8871. else
  8872. taicpu(hp1).oper[1]^.reg := taicpu(p).oper[1]^.reg;
  8873. { Change second MOV command to an ADD command. This is easier than
  8874. converting the existing command because it means we don't have to
  8875. touch 'y', which might be a complicated reference, and also the
  8876. fact that the third command might either be ADD or LEA. [Kit] }
  8877. taicpu(hp1).opcode := A_ADD;
  8878. { Delete old ADD/LEA instruction }
  8879. RemoveInstruction(hp2);
  8880. { Convert "shrq $1, reg1q" to "rcr $1, reg1d" }
  8881. taicpu(hp3).opcode := A_RCR;
  8882. taicpu(hp3).changeopsize(S_L);
  8883. setsubreg(taicpu(hp3).oper[1]^.reg, R_SUBD);
  8884. {$endif x86_64}
  8885. end;
  8886. if FuncMov2Func(p, hp1) then
  8887. begin
  8888. Result := True;
  8889. Exit;
  8890. end;
  8891. end;
  8892. {$push}
  8893. {$q-}{$r-}
  8894. function TX86AsmOptimizer.OptPass2Movx(var p : tai) : boolean;
  8895. var
  8896. ThisReg: TRegister;
  8897. MinSize, MaxSize, TryShiftDown, TargetSize: TOpSize;
  8898. TargetSubReg: TSubRegister;
  8899. hp1, hp2: tai;
  8900. RegInUse, RegChanged, p_removed, hp1_removed: Boolean;
  8901. { Store list of found instructions so we don't have to call
  8902. GetNextInstructionUsingReg multiple times }
  8903. InstrList: array of taicpu;
  8904. InstrMax, Index: Integer;
  8905. UpperLimit, SignedUpperLimit, SignedUpperLimitBottom,
  8906. LowerLimit, SignedLowerLimit, SignedLowerLimitBottom,
  8907. TryShiftDownLimit, TryShiftDownSignedLimit, TryShiftDownSignedLimitLower,
  8908. WorkingValue: TCgInt;
  8909. PreMessage: string;
  8910. { Data flow analysis }
  8911. TestValMin, TestValMax, TestValSignedMax: TCgInt;
  8912. BitwiseOnly, OrXorUsed,
  8913. ShiftDownOverflow, UpperSignedOverflow, UpperUnsignedOverflow, LowerSignedOverflow, LowerUnsignedOverflow: Boolean;
  8914. function CheckOverflowConditions: Boolean;
  8915. begin
  8916. Result := True;
  8917. if (TestValSignedMax > SignedUpperLimit) then
  8918. UpperSignedOverflow := True;
  8919. if (TestValSignedMax > SignedLowerLimit) or (TestValSignedMax < SignedLowerLimitBottom) then
  8920. LowerSignedOverflow := True;
  8921. if (TestValMin > LowerLimit) or (TestValMax > LowerLimit) then
  8922. LowerUnsignedOverflow := True;
  8923. if (TestValMin > UpperLimit) or (TestValMax > UpperLimit) or (TestValSignedMax > UpperLimit) or
  8924. (TestValMin < SignedUpperLimitBottom) or (TestValMax < SignedUpperLimitBottom) or (TestValSignedMax < SignedUpperLimitBottom) then
  8925. begin
  8926. { Absolute overflow }
  8927. Result := False;
  8928. Exit;
  8929. end;
  8930. if not ShiftDownOverflow and (TryShiftDown <> S_NO) and
  8931. ((TestValMin > TryShiftDownLimit) or (TestValMax > TryShiftDownLimit)) then
  8932. ShiftDownOverflow := True;
  8933. if (TestValMin < 0) or (TestValMax < 0) then
  8934. begin
  8935. LowerUnsignedOverflow := True;
  8936. UpperUnsignedOverflow := True;
  8937. end;
  8938. end;
  8939. function AdjustInitialLoadAndSize: Boolean;
  8940. begin
  8941. Result := False;
  8942. if not p_removed then
  8943. begin
  8944. if TargetSize = MinSize then
  8945. begin
  8946. { Convert the input MOVZX to a MOV }
  8947. if (taicpu(p).oper[0]^.typ = top_reg) and
  8948. SuperRegistersEqual(taicpu(p).oper[0]^.reg, ThisReg) then
  8949. begin
  8950. { Or remove it completely! }
  8951. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 1', p);
  8952. RemoveCurrentP(p);
  8953. p_removed := True;
  8954. end
  8955. else
  8956. begin
  8957. DebugMsg(SPeepholeOptimization + 'Movzx2Mov 1', p);
  8958. taicpu(p).opcode := A_MOV;
  8959. taicpu(p).oper[1]^.reg := ThisReg;
  8960. taicpu(p).opsize := TargetSize;
  8961. end;
  8962. Result := True;
  8963. end
  8964. else if TargetSize <> MaxSize then
  8965. begin
  8966. case MaxSize of
  8967. S_L:
  8968. if TargetSize = S_W then
  8969. begin
  8970. DebugMsg(SPeepholeOptimization + 'movzbl2movzbw', p);
  8971. taicpu(p).opsize := S_BW;
  8972. taicpu(p).oper[1]^.reg := ThisReg;
  8973. Result := True;
  8974. end
  8975. else
  8976. InternalError(2020112341);
  8977. S_W:
  8978. if TargetSize = S_L then
  8979. begin
  8980. DebugMsg(SPeepholeOptimization + 'movzbw2movzbl', p);
  8981. taicpu(p).opsize := S_BL;
  8982. taicpu(p).oper[1]^.reg := ThisReg;
  8983. Result := True;
  8984. end
  8985. else
  8986. InternalError(2020112342);
  8987. else
  8988. ;
  8989. end;
  8990. end
  8991. else if not hp1_removed and not RegInUse then
  8992. begin
  8993. { If we have something like:
  8994. movzbl (oper),%regd
  8995. add x, %regd
  8996. movzbl %regb, %regd
  8997. We can reduce the register size to the input of the final
  8998. movzbl instruction. Overflows won't have any effect.
  8999. }
  9000. if (taicpu(p).opsize in [S_BW, S_BL]) and
  9001. (taicpu(hp1).opsize in [S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}]) then
  9002. begin
  9003. TargetSize := S_B;
  9004. setsubreg(ThisReg, R_SUBL);
  9005. Result := True;
  9006. end
  9007. else if (taicpu(p).opsize = S_WL) and
  9008. (taicpu(hp1).opsize in [S_WL{$ifdef x86_64}, S_BQ{$endif x86_64}]) then
  9009. begin
  9010. TargetSize := S_W;
  9011. setsubreg(ThisReg, R_SUBW);
  9012. Result := True;
  9013. end;
  9014. if Result then
  9015. begin
  9016. { Convert the input MOVZX to a MOV }
  9017. if (taicpu(p).oper[0]^.typ = top_reg) and
  9018. SuperRegistersEqual(taicpu(p).oper[0]^.reg, ThisReg) then
  9019. begin
  9020. { Or remove it completely! }
  9021. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 1a', p);
  9022. RemoveCurrentP(p);
  9023. p_removed := True;
  9024. end
  9025. else
  9026. begin
  9027. DebugMsg(SPeepholeOptimization + 'Movzx2Mov 1a', p);
  9028. taicpu(p).opcode := A_MOV;
  9029. taicpu(p).oper[1]^.reg := ThisReg;
  9030. taicpu(p).opsize := TargetSize;
  9031. end;
  9032. end;
  9033. end;
  9034. end;
  9035. end;
  9036. procedure AdjustFinalLoad;
  9037. begin
  9038. if not LowerUnsignedOverflow then
  9039. begin
  9040. if ((TargetSize = S_L) and (taicpu(hp1).opsize in [S_L, S_BL, S_WL])) or
  9041. ((TargetSize = S_W) and (taicpu(hp1).opsize in [S_W, S_BW])) then
  9042. begin
  9043. { Convert the output MOVZX to a MOV }
  9044. if SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9045. begin
  9046. { Make sure the zero-expansion covers at least the minimum size (fixes i40003) }
  9047. if (MinSize = S_B) or
  9048. (not ShiftDownOverflow and (TryShiftDown = S_B)) or
  9049. ((MinSize = S_W) and (taicpu(hp1).opsize = S_WL)) then
  9050. begin
  9051. { Remove it completely! }
  9052. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 2', hp1);
  9053. { Be careful; if p = hp1 and p was also removed, p
  9054. will become a dangling pointer }
  9055. if p = hp1 then
  9056. begin
  9057. RemoveCurrentp(p); { p = hp1 and will then become the next instruction }
  9058. p_removed := True;
  9059. end
  9060. else
  9061. RemoveInstruction(hp1);
  9062. hp1_removed := True;
  9063. end;
  9064. end
  9065. else
  9066. begin
  9067. DebugMsg(SPeepholeOptimization + 'Movzx2Mov 2', hp1);
  9068. taicpu(hp1).opcode := A_MOV;
  9069. taicpu(hp1).oper[0]^.reg := ThisReg;
  9070. taicpu(hp1).opsize := TargetSize;
  9071. end;
  9072. end
  9073. else if (TargetSize = S_B) and (MaxSize = S_W) and (taicpu(hp1).opsize = S_WL) then
  9074. begin
  9075. { Need to change the size of the output }
  9076. DebugMsg(SPeepholeOptimization + 'movzwl2movzbl 2', hp1);
  9077. taicpu(hp1).oper[0]^.reg := ThisReg;
  9078. taicpu(hp1).opsize := S_BL;
  9079. end;
  9080. end;
  9081. end;
  9082. function CompressInstructions: Boolean;
  9083. var
  9084. LocalIndex: Integer;
  9085. begin
  9086. Result := False;
  9087. { The objective here is to try to find a combination that
  9088. removes one of the MOV/Z instructions. }
  9089. if (
  9090. (taicpu(p).oper[0]^.typ <> top_reg) or
  9091. not SuperRegistersEqual(taicpu(p).oper[0]^.reg, ThisReg)
  9092. ) and
  9093. (taicpu(hp1).oper[1]^.typ = top_reg) and
  9094. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9095. begin
  9096. { Make a preference to remove the second MOVZX instruction }
  9097. case taicpu(hp1).opsize of
  9098. S_BL, S_WL:
  9099. begin
  9100. TargetSize := S_L;
  9101. TargetSubReg := R_SUBD;
  9102. end;
  9103. S_BW:
  9104. begin
  9105. TargetSize := S_W;
  9106. TargetSubReg := R_SUBW;
  9107. end;
  9108. else
  9109. InternalError(2020112302);
  9110. end;
  9111. end
  9112. else
  9113. begin
  9114. if LowerUnsignedOverflow and not UpperUnsignedOverflow then
  9115. begin
  9116. { Exceeded lower bound but not upper bound }
  9117. TargetSize := MaxSize;
  9118. end
  9119. else if not LowerUnsignedOverflow then
  9120. begin
  9121. { Size didn't exceed lower bound }
  9122. TargetSize := MinSize;
  9123. end
  9124. else
  9125. Exit;
  9126. end;
  9127. case TargetSize of
  9128. S_B:
  9129. TargetSubReg := R_SUBL;
  9130. S_W:
  9131. TargetSubReg := R_SUBW;
  9132. S_L:
  9133. TargetSubReg := R_SUBD;
  9134. else
  9135. InternalError(2020112350);
  9136. end;
  9137. { Update the register to its new size }
  9138. setsubreg(ThisReg, TargetSubReg);
  9139. RegInUse := False;
  9140. if not SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9141. begin
  9142. { Check to see if the active register is used afterwards;
  9143. if not, we can change it and make a saving. }
  9144. TransferUsedRegs(TmpUsedRegs);
  9145. { The target register may be marked as in use to cross
  9146. a jump to a distant label, so exclude it }
  9147. ExcludeRegFromUsedRegs(taicpu(hp1).oper[1]^.reg, TmpUsedRegs);
  9148. hp2 := p;
  9149. repeat
  9150. { Explicitly check for the excluded register (don't include the first
  9151. instruction as it may be reading from here }
  9152. if ((p <> hp2) and (RegInInstruction(taicpu(hp1).oper[1]^.reg, hp2))) or
  9153. RegInUsedRegs(taicpu(hp1).oper[1]^.reg, TmpUsedRegs) then
  9154. begin
  9155. RegInUse := True;
  9156. Break;
  9157. end;
  9158. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  9159. if not GetNextInstruction(hp2, hp2) then
  9160. InternalError(2020112340);
  9161. until (hp2 = hp1);
  9162. if not RegInUse and RegUsedAfterInstruction(ThisReg, hp1, TmpUsedRegs) then
  9163. { We might still be able to get away with this }
  9164. RegInUse := not
  9165. (
  9166. GetNextInstructionUsingReg(hp1, hp2, ThisReg) and
  9167. (hp2.typ = ait_instruction) and
  9168. (
  9169. { Under -O1 and -O2, GetNextInstructionUsingReg may return an
  9170. instruction that doesn't actually contain ThisReg }
  9171. (cs_opt_level3 in current_settings.optimizerswitches) or
  9172. RegInInstruction(ThisReg, hp2)
  9173. ) and
  9174. RegLoadedWithNewValue(ThisReg, hp2)
  9175. );
  9176. if not RegInUse then
  9177. begin
  9178. { Force the register size to the same as this instruction so it can be removed}
  9179. if (taicpu(hp1).opsize in [S_L, S_BL, S_WL]) then
  9180. begin
  9181. TargetSize := S_L;
  9182. TargetSubReg := R_SUBD;
  9183. end
  9184. else if (taicpu(hp1).opsize in [S_W, S_BW]) then
  9185. begin
  9186. TargetSize := S_W;
  9187. TargetSubReg := R_SUBW;
  9188. end;
  9189. ThisReg := taicpu(hp1).oper[1]^.reg;
  9190. setsubreg(ThisReg, TargetSubReg);
  9191. RegChanged := True;
  9192. DebugMsg(SPeepholeOptimization + 'Simplified register usage so ' + debug_regname(ThisReg) + ' = ' + debug_regname(taicpu(p).oper[1]^.reg), p);
  9193. TransferUsedRegs(TmpUsedRegs);
  9194. AllocRegBetween(ThisReg, p, hp1, TmpUsedRegs);
  9195. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 3', hp1);
  9196. if p = hp1 then
  9197. begin
  9198. RemoveCurrentp(p); { p = hp1 and will then become the next instruction }
  9199. p_removed := True;
  9200. end
  9201. else
  9202. RemoveInstruction(hp1);
  9203. hp1_removed := True;
  9204. { Instruction will become "mov %reg,%reg" }
  9205. if not p_removed and (taicpu(p).opcode = A_MOV) and
  9206. MatchOperand(taicpu(p).oper[0]^, ThisReg) then
  9207. begin
  9208. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 6', p);
  9209. RemoveCurrentP(p);
  9210. p_removed := True;
  9211. end
  9212. else
  9213. taicpu(p).oper[1]^.reg := ThisReg;
  9214. Result := True;
  9215. end
  9216. else
  9217. begin
  9218. if TargetSize <> MaxSize then
  9219. begin
  9220. { Since the register is in use, we have to force it to
  9221. MaxSize otherwise part of it may become undefined later on }
  9222. TargetSize := MaxSize;
  9223. case TargetSize of
  9224. S_B:
  9225. TargetSubReg := R_SUBL;
  9226. S_W:
  9227. TargetSubReg := R_SUBW;
  9228. S_L:
  9229. TargetSubReg := R_SUBD;
  9230. else
  9231. InternalError(2020112351);
  9232. end;
  9233. setsubreg(ThisReg, TargetSubReg);
  9234. end;
  9235. AdjustFinalLoad;
  9236. end;
  9237. end
  9238. else
  9239. AdjustFinalLoad;
  9240. Result := AdjustInitialLoadAndSize or Result;
  9241. { Now go through every instruction we found and change the
  9242. size. If TargetSize = MaxSize, then almost no changes are
  9243. needed and Result can remain False if it hasn't been set
  9244. yet.
  9245. If RegChanged is True, then the register requires changing
  9246. and so the point about TargetSize = MaxSize doesn't apply. }
  9247. if ((TargetSize <> MaxSize) or RegChanged) and (InstrMax >= 0) then
  9248. begin
  9249. for LocalIndex := 0 to InstrMax do
  9250. begin
  9251. { If p_removed is true, then the original MOV/Z was removed
  9252. and removing the AND instruction may not be safe if it
  9253. appears first }
  9254. if (InstrList[LocalIndex].oper[InstrList[LocalIndex].ops - 1]^.typ <> top_reg) then
  9255. InternalError(2020112310);
  9256. if InstrList[LocalIndex].oper[0]^.typ = top_reg then
  9257. InstrList[LocalIndex].oper[0]^.reg := ThisReg;
  9258. InstrList[LocalIndex].oper[InstrList[LocalIndex].ops - 1]^.reg := ThisReg;
  9259. InstrList[LocalIndex].opsize := TargetSize;
  9260. end;
  9261. Result := True;
  9262. end;
  9263. end;
  9264. begin
  9265. Result := False;
  9266. p_removed := False;
  9267. hp1_removed := False;
  9268. ThisReg := taicpu(p).oper[1]^.reg;
  9269. { Check for:
  9270. movs/z ###,%ecx (or %cx or %rcx)
  9271. ...
  9272. shl/shr/sar/rcl/rcr/ror/rol %cl,###
  9273. (dealloc %ecx)
  9274. Change to:
  9275. mov ###,%cl (if ### = %cl, then remove completely)
  9276. ...
  9277. shl/shr/sar/rcl/rcr/ror/rol %cl,###
  9278. }
  9279. if (getsupreg(ThisReg) = RS_ECX) and
  9280. GetNextInstructionUsingReg(p, hp1, NR_ECX) and
  9281. (hp1.typ = ait_instruction) and
  9282. (
  9283. { Under -O1 and -O2, GetNextInstructionUsingReg may return an
  9284. instruction that doesn't actually contain ECX }
  9285. (cs_opt_level3 in current_settings.optimizerswitches) or
  9286. RegInInstruction(NR_ECX, hp1) or
  9287. (
  9288. { It's common for the shift/rotate's read/write register to be
  9289. initialised in between, so under -O2 and under, search ahead
  9290. one more instruction
  9291. }
  9292. GetNextInstruction(hp1, hp1) and
  9293. (hp1.typ = ait_instruction) and
  9294. RegInInstruction(NR_ECX, hp1)
  9295. )
  9296. ) and
  9297. MatchInstruction(hp1, [A_SHL, A_SHR, A_SAR, A_ROR, A_ROL, A_RCR, A_RCL], []) and
  9298. (taicpu(hp1).oper[0]^.typ = top_reg) { This is enough to determine that it's %cl } then
  9299. begin
  9300. TransferUsedRegs(TmpUsedRegs);
  9301. hp2 := p;
  9302. repeat
  9303. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  9304. until not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  9305. if not RegUsedAfterInstruction(NR_CL, hp1, TmpUsedRegs) then
  9306. begin
  9307. case taicpu(p).opsize of
  9308. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  9309. if MatchOperand(taicpu(p).oper[0]^, NR_CL) then
  9310. begin
  9311. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 3a', p);
  9312. RemoveCurrentP(p);
  9313. end
  9314. else
  9315. begin
  9316. taicpu(p).opcode := A_MOV;
  9317. taicpu(p).opsize := S_B;
  9318. taicpu(p).oper[1]^.reg := NR_CL;
  9319. DebugMsg(SPeepholeOptimization + 'MovxOp2MovOp 1', p);
  9320. end;
  9321. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  9322. if MatchOperand(taicpu(p).oper[0]^, NR_CX) then
  9323. begin
  9324. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 3b', p);
  9325. RemoveCurrentP(p);
  9326. end
  9327. else
  9328. begin
  9329. taicpu(p).opcode := A_MOV;
  9330. taicpu(p).opsize := S_W;
  9331. taicpu(p).oper[1]^.reg := NR_CX;
  9332. DebugMsg(SPeepholeOptimization + 'MovxOp2MovOp 2', p);
  9333. end;
  9334. {$ifdef x86_64}
  9335. S_LQ:
  9336. if MatchOperand(taicpu(p).oper[0]^, NR_ECX) then
  9337. begin
  9338. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 3c', p);
  9339. RemoveCurrentP(p);
  9340. end
  9341. else
  9342. begin
  9343. taicpu(p).opcode := A_MOV;
  9344. taicpu(p).opsize := S_L;
  9345. taicpu(p).oper[1]^.reg := NR_ECX;
  9346. DebugMsg(SPeepholeOptimization + 'MovxOp2MovOp 3', p);
  9347. end;
  9348. {$endif x86_64}
  9349. else
  9350. InternalError(2021120401);
  9351. end;
  9352. Result := True;
  9353. Exit;
  9354. end;
  9355. end;
  9356. { This is anything but quick! }
  9357. if not(cs_opt_level2 in current_settings.optimizerswitches) then
  9358. Exit;
  9359. SetLength(InstrList, 0);
  9360. InstrMax := -1;
  9361. case taicpu(p).opsize of
  9362. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  9363. begin
  9364. {$if defined(i386) or defined(i8086)}
  9365. { If the target size is 8-bit, make sure we can actually encode it }
  9366. if not (GetSupReg(ThisReg) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX]) then
  9367. Exit;
  9368. {$endif i386 or i8086}
  9369. LowerLimit := $FF;
  9370. SignedLowerLimit := $7F;
  9371. SignedLowerLimitBottom := -128;
  9372. MinSize := S_B;
  9373. if taicpu(p).opsize = S_BW then
  9374. begin
  9375. MaxSize := S_W;
  9376. UpperLimit := $FFFF;
  9377. SignedUpperLimit := $7FFF;
  9378. SignedUpperLimitBottom := -32768;
  9379. end
  9380. else
  9381. begin
  9382. { Keep at a 32-bit limit for BQ as well since one can't really optimise otherwise }
  9383. MaxSize := S_L;
  9384. UpperLimit := $FFFFFFFF;
  9385. SignedUpperLimit := $7FFFFFFF;
  9386. SignedUpperLimitBottom := -2147483648;
  9387. end;
  9388. end;
  9389. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  9390. begin
  9391. { Keep at a 32-bit limit for WQ as well since one can't really optimise otherwise }
  9392. LowerLimit := $FFFF;
  9393. SignedLowerLimit := $7FFF;
  9394. SignedLowerLimitBottom := -32768;
  9395. UpperLimit := $FFFFFFFF;
  9396. SignedUpperLimit := $7FFFFFFF;
  9397. SignedUpperLimitBottom := -2147483648;
  9398. MinSize := S_W;
  9399. MaxSize := S_L;
  9400. end;
  9401. {$ifdef x86_64}
  9402. S_LQ:
  9403. begin
  9404. { Both the lower and upper limits are set to 32-bit. If a limit
  9405. is breached, then optimisation is impossible }
  9406. LowerLimit := $FFFFFFFF;
  9407. SignedLowerLimit := $7FFFFFFF;
  9408. SignedLowerLimitBottom := -2147483648;
  9409. UpperLimit := $FFFFFFFF;
  9410. SignedUpperLimit := $7FFFFFFF;
  9411. SignedUpperLimitBottom := -2147483648;
  9412. MinSize := S_L;
  9413. MaxSize := S_L;
  9414. end;
  9415. {$endif x86_64}
  9416. else
  9417. InternalError(2020112301);
  9418. end;
  9419. TestValMin := 0;
  9420. TestValMax := LowerLimit;
  9421. TestValSignedMax := SignedLowerLimit;
  9422. TryShiftDownLimit := LowerLimit;
  9423. TryShiftDown := S_NO;
  9424. ShiftDownOverflow := False;
  9425. RegChanged := False;
  9426. BitwiseOnly := True;
  9427. OrXorUsed := False;
  9428. UpperSignedOverflow := False;
  9429. LowerSignedOverflow := False;
  9430. UpperUnsignedOverflow := False;
  9431. LowerUnsignedOverflow := False;
  9432. hp1 := p;
  9433. while GetNextInstructionUsingReg(hp1, hp1, ThisReg) and
  9434. (hp1.typ = ait_instruction) and
  9435. (
  9436. { Under -O1 and -O2, GetNextInstructionUsingReg may return an
  9437. instruction that doesn't actually contain ThisReg }
  9438. (cs_opt_level3 in current_settings.optimizerswitches) or
  9439. { This allows this Movx optimisation to work through the SETcc instructions
  9440. inserted by the 'CMP/JE/CMP/@Lbl/SETE -> CMP/SETE/CMP/SETE/OR'
  9441. optimisation on -O1 and -O2 (on -O3, GetNextInstructionUsingReg will
  9442. skip over these SETcc instructions). }
  9443. (taicpu(hp1).opcode = A_SETcc) or
  9444. RegInInstruction(ThisReg, hp1)
  9445. ) do
  9446. begin
  9447. case taicpu(hp1).opcode of
  9448. A_INC,A_DEC:
  9449. begin
  9450. { Has to be an exact match on the register }
  9451. if not MatchOperand(taicpu(hp1).oper[0]^, ThisReg) then
  9452. Break;
  9453. if taicpu(hp1).opcode = A_INC then
  9454. begin
  9455. Inc(TestValMin);
  9456. Inc(TestValMax);
  9457. Inc(TestValSignedMax);
  9458. end
  9459. else
  9460. begin
  9461. Dec(TestValMin);
  9462. Dec(TestValMax);
  9463. Dec(TestValSignedMax);
  9464. end;
  9465. end;
  9466. A_TEST, A_CMP:
  9467. begin
  9468. if (
  9469. { Too high a risk of non-linear behaviour that breaks DFA
  9470. here, unless it's cmp $0,%reg, which is equivalent to
  9471. test %reg,%reg }
  9472. OrXorUsed and
  9473. (taicpu(hp1).opcode = A_CMP) and
  9474. not Matchoperand(taicpu(hp1).oper[0]^, 0)
  9475. ) or
  9476. (taicpu(hp1).oper[1]^.typ <> top_reg) or
  9477. { Has to be an exact match on the register }
  9478. (taicpu(hp1).oper[1]^.reg <> ThisReg) or
  9479. (
  9480. { Permit "test %reg,%reg" }
  9481. (taicpu(hp1).opcode = A_TEST) and
  9482. (taicpu(hp1).oper[0]^.typ = top_reg) and
  9483. (taicpu(hp1).oper[0]^.reg <> ThisReg)
  9484. ) or
  9485. (taicpu(hp1).oper[0]^.typ <> top_const) or
  9486. { Make sure the comparison value is not smaller than the
  9487. smallest allowed signed value for the minimum size (e.g.
  9488. -128 for 8-bit) }
  9489. not (
  9490. ((taicpu(hp1).oper[0]^.val and LowerLimit) = taicpu(hp1).oper[0]^.val) or
  9491. { Is it in the negative range? }
  9492. (
  9493. (taicpu(hp1).oper[0]^.val < 0) and
  9494. (taicpu(hp1).oper[0]^.val >= SignedLowerLimitBottom)
  9495. )
  9496. ) then
  9497. Break;
  9498. { Check to see if the active register is used afterwards }
  9499. TransferUsedRegs(TmpUsedRegs);
  9500. IncludeRegInUsedRegs(ThisReg, TmpUsedRegs);
  9501. if not RegUsedAfterInstruction(ThisReg, hp1, TmpUsedRegs) then
  9502. begin
  9503. { Make sure the comparison or any previous instructions
  9504. hasn't pushed the test values outside of the range of
  9505. MinSize }
  9506. if LowerUnsignedOverflow and not UpperUnsignedOverflow then
  9507. begin
  9508. { Exceeded lower bound but not upper bound }
  9509. Exit;
  9510. end
  9511. else if not LowerSignedOverflow or not LowerUnsignedOverflow then
  9512. begin
  9513. { Size didn't exceed lower bound }
  9514. TargetSize := MinSize;
  9515. end
  9516. else
  9517. Break;
  9518. case TargetSize of
  9519. S_B:
  9520. TargetSubReg := R_SUBL;
  9521. S_W:
  9522. TargetSubReg := R_SUBW;
  9523. S_L:
  9524. TargetSubReg := R_SUBD;
  9525. else
  9526. InternalError(2021051002);
  9527. end;
  9528. if TargetSize <> MaxSize then
  9529. begin
  9530. { Update the register to its new size }
  9531. setsubreg(ThisReg, TargetSubReg);
  9532. DebugMsg(SPeepholeOptimization + 'CMP instruction resized thanks to register size optimisation (see MOV/Z assignment above)', hp1);
  9533. taicpu(hp1).oper[1]^.reg := ThisReg;
  9534. taicpu(hp1).opsize := TargetSize;
  9535. { Convert the input MOVZX to a MOV if necessary }
  9536. AdjustInitialLoadAndSize;
  9537. if (InstrMax >= 0) then
  9538. begin
  9539. for Index := 0 to InstrMax do
  9540. begin
  9541. { If p_removed is true, then the original MOV/Z was removed
  9542. and removing the AND instruction may not be safe if it
  9543. appears first }
  9544. if (InstrList[Index].oper[InstrList[Index].ops - 1]^.typ <> top_reg) then
  9545. InternalError(2020112311);
  9546. if InstrList[Index].oper[0]^.typ = top_reg then
  9547. InstrList[Index].oper[0]^.reg := ThisReg;
  9548. InstrList[Index].oper[InstrList[Index].ops - 1]^.reg := ThisReg;
  9549. InstrList[Index].opsize := MinSize;
  9550. end;
  9551. end;
  9552. Result := True;
  9553. end;
  9554. Exit;
  9555. end;
  9556. end;
  9557. A_SETcc:
  9558. begin
  9559. { This allows this Movx optimisation to work through the SETcc instructions
  9560. inserted by the 'CMP/JE/CMP/@Lbl/SETE -> CMP/SETE/CMP/SETE/OR'
  9561. optimisation on -O1 and -O2 (on -O3, GetNextInstructionUsingReg will
  9562. skip over these SETcc instructions). }
  9563. if (cs_opt_level3 in current_settings.optimizerswitches) or
  9564. { Of course, break out if the current register is used }
  9565. RegInOp(ThisReg, taicpu(hp1).oper[0]^) then
  9566. Break
  9567. else
  9568. { We must use Continue so the instruction doesn't get added
  9569. to InstrList }
  9570. Continue;
  9571. end;
  9572. A_ADD,A_SUB,A_AND,A_OR,A_XOR,A_SHL,A_SHR,A_SAR:
  9573. begin
  9574. if
  9575. (taicpu(hp1).oper[1]^.typ <> top_reg) or
  9576. { Has to be an exact match on the register }
  9577. (taicpu(hp1).oper[1]^.reg <> ThisReg) or not
  9578. (
  9579. (
  9580. (taicpu(hp1).oper[0]^.typ = top_const) and
  9581. (
  9582. (
  9583. (taicpu(hp1).opcode = A_SHL) and
  9584. (
  9585. ((MinSize = S_B) and (taicpu(hp1).oper[0]^.val < 8)) or
  9586. ((MinSize = S_W) and (taicpu(hp1).oper[0]^.val < 16)) or
  9587. ((MinSize = S_L) and (taicpu(hp1).oper[0]^.val < 32))
  9588. )
  9589. ) or (
  9590. (taicpu(hp1).opcode <> A_SHL) and
  9591. (
  9592. ((taicpu(hp1).oper[0]^.val and UpperLimit) = taicpu(hp1).oper[0]^.val) or
  9593. { Is it in the negative range? }
  9594. (((not taicpu(hp1).oper[0]^.val) and (UpperLimit shr 1)) = (not taicpu(hp1).oper[0]^.val))
  9595. )
  9596. )
  9597. )
  9598. ) or (
  9599. MatchOperand(taicpu(hp1).oper[0]^, taicpu(hp1).oper[1]^.reg) and
  9600. ((taicpu(hp1).opcode = A_ADD) or (taicpu(hp1).opcode = A_AND) or (taicpu(hp1).opcode = A_SUB))
  9601. )
  9602. ) then
  9603. Break;
  9604. { Only process OR and XOR if there are only bitwise operations,
  9605. since otherwise they can too easily fool the data flow
  9606. analysis (they can cause non-linear behaviour) }
  9607. case taicpu(hp1).opcode of
  9608. A_ADD:
  9609. begin
  9610. if OrXorUsed then
  9611. { Too high a risk of non-linear behaviour that breaks DFA here }
  9612. Break
  9613. else
  9614. BitwiseOnly := False;
  9615. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  9616. begin
  9617. TestValMin := TestValMin * 2;
  9618. TestValMax := TestValMax * 2;
  9619. TestValSignedMax := TestValSignedMax * 2;
  9620. end
  9621. else
  9622. begin
  9623. WorkingValue := taicpu(hp1).oper[0]^.val;
  9624. TestValMin := TestValMin + WorkingValue;
  9625. TestValMax := TestValMax + WorkingValue;
  9626. TestValSignedMax := TestValSignedMax + WorkingValue;
  9627. end;
  9628. end;
  9629. A_SUB:
  9630. begin
  9631. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  9632. begin
  9633. TestValMin := 0;
  9634. TestValMax := 0;
  9635. TestValSignedMax := 0;
  9636. end
  9637. else
  9638. begin
  9639. if OrXorUsed then
  9640. { Too high a risk of non-linear behaviour that breaks DFA here }
  9641. Break
  9642. else
  9643. BitwiseOnly := False;
  9644. WorkingValue := taicpu(hp1).oper[0]^.val;
  9645. TestValMin := TestValMin - WorkingValue;
  9646. TestValMax := TestValMax - WorkingValue;
  9647. TestValSignedMax := TestValSignedMax - WorkingValue;
  9648. end;
  9649. end;
  9650. A_AND:
  9651. if (taicpu(hp1).oper[0]^.typ = top_const) then
  9652. begin
  9653. { we might be able to go smaller if AND appears first }
  9654. if InstrMax = -1 then
  9655. case MinSize of
  9656. S_B:
  9657. ;
  9658. S_W:
  9659. if ((taicpu(hp1).oper[0]^.val and $FF) = taicpu(hp1).oper[0]^.val) or
  9660. ((not(taicpu(hp1).oper[0]^.val) and $7F) = (not taicpu(hp1).oper[0]^.val)) then
  9661. begin
  9662. TryShiftDown := S_B;
  9663. TryShiftDownLimit := $FF;
  9664. end;
  9665. S_L:
  9666. if ((taicpu(hp1).oper[0]^.val and $FF) = taicpu(hp1).oper[0]^.val) or
  9667. ((not(taicpu(hp1).oper[0]^.val) and $7F) = (not taicpu(hp1).oper[0]^.val)) then
  9668. begin
  9669. TryShiftDown := S_B;
  9670. TryShiftDownLimit := $FF;
  9671. end
  9672. else if ((taicpu(hp1).oper[0]^.val and $FFFF) = taicpu(hp1).oper[0]^.val) or
  9673. ((not(taicpu(hp1).oper[0]^.val) and $7FFF) = (not taicpu(hp1).oper[0]^.val)) then
  9674. begin
  9675. TryShiftDown := S_W;
  9676. TryShiftDownLimit := $FFFF;
  9677. end;
  9678. else
  9679. InternalError(2020112320);
  9680. end;
  9681. WorkingValue := taicpu(hp1).oper[0]^.val;
  9682. TestValMin := TestValMin and WorkingValue;
  9683. TestValMax := TestValMax and WorkingValue;
  9684. TestValSignedMax := TestValSignedMax and WorkingValue;
  9685. end;
  9686. A_OR:
  9687. begin
  9688. if not BitwiseOnly then
  9689. Break;
  9690. OrXorUsed := True;
  9691. WorkingValue := taicpu(hp1).oper[0]^.val;
  9692. TestValMin := TestValMin or WorkingValue;
  9693. TestValMax := TestValMax or WorkingValue;
  9694. TestValSignedMax := TestValSignedMax or WorkingValue;
  9695. end;
  9696. A_XOR:
  9697. begin
  9698. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  9699. begin
  9700. TestValMin := 0;
  9701. TestValMax := 0;
  9702. TestValSignedMax := 0;
  9703. end
  9704. else
  9705. begin
  9706. if not BitwiseOnly then
  9707. Break;
  9708. OrXorUsed := True;
  9709. WorkingValue := taicpu(hp1).oper[0]^.val;
  9710. TestValMin := TestValMin xor WorkingValue;
  9711. TestValMax := TestValMax xor WorkingValue;
  9712. TestValSignedMax := TestValSignedMax xor WorkingValue;
  9713. end;
  9714. end;
  9715. A_SHL:
  9716. begin
  9717. BitwiseOnly := False;
  9718. WorkingValue := taicpu(hp1).oper[0]^.val;
  9719. TestValMin := TestValMin shl WorkingValue;
  9720. TestValMax := TestValMax shl WorkingValue;
  9721. TestValSignedMax := TestValSignedMax shl WorkingValue;
  9722. end;
  9723. A_SHR,
  9724. { The first instruction was MOVZX, so the value won't be negative }
  9725. A_SAR:
  9726. begin
  9727. if InstrMax <> -1 then
  9728. BitwiseOnly := False
  9729. else
  9730. { we might be able to go smaller if SHR appears first }
  9731. case MinSize of
  9732. S_B:
  9733. ;
  9734. S_W:
  9735. if (taicpu(hp1).oper[0]^.val >= 8) then
  9736. begin
  9737. TryShiftDown := S_B;
  9738. TryShiftDownLimit := $FF;
  9739. TryShiftDownSignedLimit := $7F;
  9740. TryShiftDownSignedLimitLower := -128;
  9741. end;
  9742. S_L:
  9743. if (taicpu(hp1).oper[0]^.val >= 24) then
  9744. begin
  9745. TryShiftDown := S_B;
  9746. TryShiftDownLimit := $FF;
  9747. TryShiftDownSignedLimit := $7F;
  9748. TryShiftDownSignedLimitLower := -128;
  9749. end
  9750. else if (taicpu(hp1).oper[0]^.val >= 16) then
  9751. begin
  9752. TryShiftDown := S_W;
  9753. TryShiftDownLimit := $FFFF;
  9754. TryShiftDownSignedLimit := $7FFF;
  9755. TryShiftDownSignedLimitLower := -32768;
  9756. end;
  9757. else
  9758. InternalError(2020112321);
  9759. end;
  9760. WorkingValue := taicpu(hp1).oper[0]^.val;
  9761. if taicpu(hp1).opcode = A_SAR then
  9762. begin
  9763. TestValMin := SarInt64(TestValMin, WorkingValue);
  9764. TestValMax := SarInt64(TestValMax, WorkingValue);
  9765. TestValSignedMax := SarInt64(TestValSignedMax, WorkingValue);
  9766. end
  9767. else
  9768. begin
  9769. TestValMin := TestValMin shr WorkingValue;
  9770. TestValMax := TestValMax shr WorkingValue;
  9771. TestValSignedMax := TestValSignedMax shr WorkingValue;
  9772. end;
  9773. end;
  9774. else
  9775. InternalError(2020112303);
  9776. end;
  9777. end;
  9778. (*
  9779. A_IMUL:
  9780. case taicpu(hp1).ops of
  9781. 2:
  9782. begin
  9783. if not MatchOpType(hp1, top_reg, top_reg) or
  9784. { Has to be an exact match on the register }
  9785. (taicpu(hp1).oper[0]^.reg <> ThisReg) or
  9786. (taicpu(hp1).oper[1]^.reg <> ThisReg) then
  9787. Break;
  9788. TestValMin := TestValMin * TestValMin;
  9789. TestValMax := TestValMax * TestValMax;
  9790. TestValSignedMax := TestValSignedMax * TestValMax;
  9791. end;
  9792. 3:
  9793. begin
  9794. if not MatchOpType(hp1, top_const, top_reg, top_reg) or
  9795. { Has to be an exact match on the register }
  9796. (taicpu(hp1).oper[1]^.reg <> ThisReg) or
  9797. (taicpu(hp1).oper[2]^.reg <> ThisReg) or
  9798. ((taicpu(hp1).oper[0]^.val and UpperLimit) = taicpu(hp1).oper[0]^.val) or
  9799. { Is it in the negative range? }
  9800. (((not taicpu(hp1).oper[0]^.val) and (UpperLimit shr 1)) = (not taicpu(hp1).oper[0]^.val)) then
  9801. Break;
  9802. TestValMin := TestValMin * taicpu(hp1).oper[0]^.val;
  9803. TestValMax := TestValMax * taicpu(hp1).oper[0]^.val;
  9804. TestValSignedMax := TestValSignedMax * taicpu(hp1).oper[0]^.val;
  9805. end;
  9806. else
  9807. Break;
  9808. end;
  9809. A_IDIV:
  9810. case taicpu(hp1).ops of
  9811. 3:
  9812. begin
  9813. if not MatchOpType(hp1, top_const, top_reg, top_reg) or
  9814. { Has to be an exact match on the register }
  9815. (taicpu(hp1).oper[1]^.reg <> ThisReg) or
  9816. (taicpu(hp1).oper[2]^.reg <> ThisReg) or
  9817. ((taicpu(hp1).oper[0]^.val and UpperLimit) = taicpu(hp1).oper[0]^.val) or
  9818. { Is it in the negative range? }
  9819. (((not taicpu(hp1).oper[0]^.val) and (UpperLimit shr 1)) = (not taicpu(hp1).oper[0]^.val)) then
  9820. Break;
  9821. TestValMin := TestValMin div taicpu(hp1).oper[0]^.val;
  9822. TestValMax := TestValMax div taicpu(hp1).oper[0]^.val;
  9823. TestValSignedMax := TestValSignedMax div taicpu(hp1).oper[0]^.val;
  9824. end;
  9825. else
  9826. Break;
  9827. end;
  9828. *)
  9829. A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  9830. begin
  9831. { If there are no instructions in between, then we might be able to make a saving }
  9832. if UpperSignedOverflow or (taicpu(hp1).oper[0]^.typ <> top_reg) or (taicpu(hp1).oper[0]^.reg <> ThisReg) then
  9833. Break;
  9834. { We have something like:
  9835. movzbw %dl,%dx
  9836. ...
  9837. movswl %dx,%edx
  9838. Change the latter to a zero-extension then enter the
  9839. A_MOVZX case branch.
  9840. }
  9841. {$ifdef x86_64}
  9842. if (taicpu(hp1).opsize = S_LQ) and SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9843. begin
  9844. { this becomes a zero extension from 32-bit to 64-bit, but
  9845. the upper 32 bits are already zero, so just delete the
  9846. instruction }
  9847. DebugMsg(SPeepholeOptimization + 'MovzMovsxd2MovzNop', hp1);
  9848. RemoveInstruction(hp1);
  9849. Result := True;
  9850. Exit;
  9851. end
  9852. else
  9853. {$endif x86_64}
  9854. begin
  9855. DebugMsg(SPeepholeOptimization + 'MovzMovs2MovzMovz', hp1);
  9856. taicpu(hp1).opcode := A_MOVZX;
  9857. {$ifdef x86_64}
  9858. case taicpu(hp1).opsize of
  9859. S_BQ:
  9860. begin
  9861. taicpu(hp1).opsize := S_BL;
  9862. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  9863. end;
  9864. S_WQ:
  9865. begin
  9866. taicpu(hp1).opsize := S_WL;
  9867. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  9868. end;
  9869. S_LQ:
  9870. begin
  9871. taicpu(hp1).opcode := A_MOV;
  9872. taicpu(hp1).opsize := S_L;
  9873. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  9874. { In this instance, we need to break out because the
  9875. instruction is no longer MOVZX or MOVSXD }
  9876. Result := True;
  9877. Exit;
  9878. end;
  9879. else
  9880. ;
  9881. end;
  9882. {$endif x86_64}
  9883. Result := CompressInstructions;
  9884. Exit;
  9885. end;
  9886. end;
  9887. A_MOVZX:
  9888. begin
  9889. if UpperUnsignedOverflow or (taicpu(hp1).oper[0]^.typ <> top_reg) then
  9890. Break;
  9891. if (InstrMax = -1) then
  9892. begin
  9893. if SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, ThisReg) then
  9894. begin
  9895. { Optimise around i40003 }
  9896. if SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) and
  9897. (taicpu(p).opsize = S_WL) and (taicpu(hp1).opsize = S_BL)
  9898. {$ifndef x86_64}
  9899. and (
  9900. (taicpu(p).oper[0]^.typ <> top_reg) or
  9901. { Cannot encode byte-sized ESI, EDI, EBP or ESP under i386 }
  9902. (GetSupReg(taicpu(p).oper[0]^.reg) in [RS_EAX, RS_EBX, RS_ECX, RS_EDX])
  9903. )
  9904. {$endif not x86_64}
  9905. then
  9906. begin
  9907. if (taicpu(p).oper[0]^.typ = top_reg) then
  9908. setsubreg(taicpu(p).oper[0]^.reg, R_SUBL);
  9909. DebugMsg(SPeepholeOptimization + 'movzwl2movzbl 1', p);
  9910. taicpu(p).opsize := S_BL;
  9911. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 2a', hp1);
  9912. RemoveInstruction(hp1);
  9913. Result := True;
  9914. Exit;
  9915. end;
  9916. end
  9917. else
  9918. begin
  9919. { Will return false if the second parameter isn't ThisReg
  9920. (can happen on -O2 and under) }
  9921. if Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9922. begin
  9923. { The two MOVZX instructions are adjacent, so remove the first one }
  9924. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 5', p);
  9925. RemoveCurrentP(p);
  9926. Result := True;
  9927. Exit;
  9928. end;
  9929. Break;
  9930. end;
  9931. end;
  9932. Result := CompressInstructions;
  9933. Exit;
  9934. end;
  9935. else
  9936. { This includes ADC, SBB and IDIV }
  9937. Break;
  9938. end;
  9939. if not CheckOverflowConditions then
  9940. Break;
  9941. { Contains highest index (so instruction count - 1) }
  9942. Inc(InstrMax);
  9943. if InstrMax > High(InstrList) then
  9944. SetLength(InstrList, InstrMax + LIST_STEP_SIZE);
  9945. InstrList[InstrMax] := taicpu(hp1);
  9946. end;
  9947. end;
  9948. {$pop}
  9949. function TX86AsmOptimizer.OptPass2Imul(var p : tai) : boolean;
  9950. var
  9951. hp1 : tai;
  9952. begin
  9953. Result:=false;
  9954. if (taicpu(p).ops >= 2) and
  9955. ((taicpu(p).oper[0]^.typ = top_const) or
  9956. ((taicpu(p).oper[0]^.typ = top_ref) and (taicpu(p).oper[0]^.ref^.refaddr=addr_full))) and
  9957. (taicpu(p).oper[1]^.typ = top_reg) and
  9958. ((taicpu(p).ops = 2) or
  9959. ((taicpu(p).oper[2]^.typ = top_reg) and
  9960. (taicpu(p).oper[2]^.reg = taicpu(p).oper[1]^.reg))) and
  9961. GetLastInstruction(p,hp1) and
  9962. MatchInstruction(hp1,A_MOV,[]) and
  9963. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  9964. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  9965. begin
  9966. TransferUsedRegs(TmpUsedRegs);
  9967. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,p,TmpUsedRegs)) or
  9968. ((taicpu(p).ops = 3) and (taicpu(p).oper[1]^.reg=taicpu(p).oper[2]^.reg)) then
  9969. { change
  9970. mov reg1,reg2
  9971. imul y,reg2 to imul y,reg1,reg2 }
  9972. begin
  9973. taicpu(p).ops := 3;
  9974. taicpu(p).loadreg(2,taicpu(p).oper[1]^.reg);
  9975. taicpu(p).loadreg(1,taicpu(hp1).oper[0]^.reg);
  9976. DebugMsg(SPeepholeOptimization + 'MovImul2Imul done',p);
  9977. RemoveInstruction(hp1);
  9978. result:=true;
  9979. end;
  9980. end;
  9981. end;
  9982. procedure TX86AsmOptimizer.ConvertJumpToRET(const p: tai; const ret_p: tai);
  9983. var
  9984. ThisLabel: TAsmLabel;
  9985. begin
  9986. ThisLabel := tasmlabel(taicpu(p).oper[0]^.ref^.symbol);
  9987. ThisLabel.decrefs;
  9988. taicpu(p).condition := C_None;
  9989. taicpu(p).opcode := A_RET;
  9990. taicpu(p).is_jmp := false;
  9991. taicpu(p).ops := taicpu(ret_p).ops;
  9992. case taicpu(ret_p).ops of
  9993. 0:
  9994. taicpu(p).clearop(0);
  9995. 1:
  9996. taicpu(p).loadconst(0,taicpu(ret_p).oper[0]^.val);
  9997. else
  9998. internalerror(2016041301);
  9999. end;
  10000. { If the original label is now dead, it might turn out that the label
  10001. immediately follows p. As a result, everything beyond it, which will
  10002. be just some final register configuration and a RET instruction, is
  10003. now dead code. [Kit] }
  10004. { NOTE: This is much faster than introducing a OptPass2RET routine and
  10005. running RemoveDeadCodeAfterJump for each RET instruction, because
  10006. this optimisation rarely happens and most RETs appear at the end of
  10007. routines where there is nothing that can be stripped. [Kit] }
  10008. if not ThisLabel.is_used then
  10009. RemoveDeadCodeAfterJump(p);
  10010. end;
  10011. function TX86AsmOptimizer.OptPass2SETcc(var p: tai): boolean;
  10012. var
  10013. hp1,hp2,next: tai; SetC, JumpC: TAsmCond;
  10014. Unconditional, PotentialModified: Boolean;
  10015. OperPtr: POper;
  10016. NewRef: TReference;
  10017. InstrList: array of taicpu;
  10018. InstrMax, Index: Integer;
  10019. const
  10020. {$ifdef DEBUG_AOPTCPU}
  10021. SNoFlags: shortstring = ' so the flags aren''t modified';
  10022. {$else DEBUG_AOPTCPU}
  10023. SNoFlags = '';
  10024. {$endif DEBUG_AOPTCPU}
  10025. begin
  10026. Result:=false;
  10027. if MatchOpType(taicpu(p),top_reg) and GetNextInstructionUsingReg(p, hp1, taicpu(p).oper[0]^.reg) then
  10028. begin
  10029. if MatchInstruction(hp1, A_TEST, [S_B]) and
  10030. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  10031. (taicpu(hp1).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) and
  10032. (taicpu(p).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) and
  10033. GetNextInstruction(hp1, hp2) and
  10034. MatchInstruction(hp2, A_Jcc, A_SETcc, []) then
  10035. { Change from: To:
  10036. set(C) %reg j(~C) label
  10037. test %reg,%reg/cmp $0,%reg
  10038. je label
  10039. set(C) %reg j(C) label
  10040. test %reg,%reg/cmp $0,%reg
  10041. jne label
  10042. (Also do something similar with sete/setne instead of je/jne)
  10043. }
  10044. begin
  10045. { Before we do anything else, we need to check the instructions
  10046. in between SETcc and TEST to make sure they don't modify the
  10047. FLAGS register - if -O2 or under, there won't be any
  10048. instructions between SET and TEST }
  10049. TransferUsedRegs(TmpUsedRegs);
  10050. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  10051. if (cs_opt_level3 in current_settings.optimizerswitches) then
  10052. begin
  10053. next := p;
  10054. SetLength(InstrList, 0);
  10055. InstrMax := -1;
  10056. PotentialModified := False;
  10057. { Make a note of every instruction that modifies the FLAGS
  10058. register }
  10059. while GetNextInstruction(next, next) and (next <> hp1) do
  10060. begin
  10061. if next.typ <> ait_instruction then
  10062. { GetNextInstructionUsingReg should have returned False }
  10063. InternalError(2021051701);
  10064. if RegModifiedByInstruction(NR_DEFAULTFLAGS, next) then
  10065. begin
  10066. case taicpu(next).opcode of
  10067. A_SETcc,
  10068. A_CMOVcc,
  10069. A_Jcc:
  10070. begin
  10071. if PotentialModified then
  10072. { Not safe because the flags were modified earlier }
  10073. Exit
  10074. else
  10075. { Condition is the same as the initial SETcc, so this is safe
  10076. (don't add to instruction list though) }
  10077. Continue;
  10078. end;
  10079. A_ADD:
  10080. begin
  10081. if (taicpu(next).opsize = S_B) or
  10082. { LEA doesn't support 8-bit operands }
  10083. (taicpu(next).oper[1]^.typ <> top_reg) or
  10084. { Must write to a register }
  10085. (taicpu(next).oper[0]^.typ = top_ref) then
  10086. { Require a constant or a register }
  10087. Exit;
  10088. PotentialModified := True;
  10089. end;
  10090. A_SUB:
  10091. begin
  10092. if (taicpu(next).opsize = S_B) or
  10093. { LEA doesn't support 8-bit operands }
  10094. (taicpu(next).oper[1]^.typ <> top_reg) or
  10095. { Must write to a register }
  10096. (taicpu(next).oper[0]^.typ <> top_const) or
  10097. (taicpu(next).oper[0]^.val = $80000000) then
  10098. { Can't subtract a register with LEA - also
  10099. check that the value isn't -2^31, as this
  10100. can't be negated }
  10101. Exit;
  10102. PotentialModified := True;
  10103. end;
  10104. A_SAL,
  10105. A_SHL:
  10106. begin
  10107. if (taicpu(next).opsize = S_B) or
  10108. { LEA doesn't support 8-bit operands }
  10109. (taicpu(next).oper[1]^.typ <> top_reg) or
  10110. { Must write to a register }
  10111. (taicpu(next).oper[0]^.typ <> top_const) or
  10112. (taicpu(next).oper[0]^.val < 0) or
  10113. (taicpu(next).oper[0]^.val > 3) then
  10114. Exit;
  10115. PotentialModified := True;
  10116. end;
  10117. A_IMUL:
  10118. begin
  10119. if (taicpu(next).ops <> 3) or
  10120. (taicpu(next).oper[1]^.typ <> top_reg) or
  10121. { Must write to a register }
  10122. (taicpu(next).oper[2]^.val in [2,3,4,5,8,9]) then
  10123. { We can convert "imul x,%reg1,%reg2" (where x = 2, 4 or 8)
  10124. to "lea (%reg1,x),%reg2". If x = 3, 5 or 9, we can
  10125. change this to "lea (%reg1,%reg1,(x-1)),%reg2" }
  10126. Exit
  10127. else
  10128. PotentialModified := True;
  10129. end;
  10130. else
  10131. { Don't know how to change this, so abort }
  10132. Exit;
  10133. end;
  10134. { Contains highest index (so instruction count - 1) }
  10135. Inc(InstrMax);
  10136. if InstrMax > High(InstrList) then
  10137. SetLength(InstrList, InstrMax + LIST_STEP_SIZE);
  10138. InstrList[InstrMax] := taicpu(next);
  10139. end;
  10140. UpdateUsedRegs(TmpUsedRegs, tai(next.next));
  10141. end;
  10142. if not Assigned(next) or (next <> hp1) then
  10143. { It should be equal to hp1 }
  10144. InternalError(2021051702);
  10145. { Cycle through each instruction and check to see if we can
  10146. change them to versions that don't modify the flags }
  10147. if (InstrMax >= 0) then
  10148. begin
  10149. for Index := 0 to InstrMax do
  10150. case InstrList[Index].opcode of
  10151. A_ADD:
  10152. begin
  10153. DebugMsg(SPeepholeOptimization + 'ADD -> LEA' + SNoFlags, InstrList[Index]);
  10154. InstrList[Index].opcode := A_LEA;
  10155. reference_reset(NewRef, 1, []);
  10156. NewRef.base := InstrList[Index].oper[1]^.reg;
  10157. if InstrList[Index].oper[0]^.typ = top_reg then
  10158. begin
  10159. NewRef.index := InstrList[Index].oper[0]^.reg;
  10160. NewRef.scalefactor := 1;
  10161. end
  10162. else
  10163. NewRef.offset := InstrList[Index].oper[0]^.val;
  10164. InstrList[Index].loadref(0, NewRef);
  10165. end;
  10166. A_SUB:
  10167. begin
  10168. DebugMsg(SPeepholeOptimization + 'SUB -> LEA' + SNoFlags, InstrList[Index]);
  10169. InstrList[Index].opcode := A_LEA;
  10170. reference_reset(NewRef, 1, []);
  10171. NewRef.base := InstrList[Index].oper[1]^.reg;
  10172. NewRef.offset := -InstrList[Index].oper[0]^.val;
  10173. InstrList[Index].loadref(0, NewRef);
  10174. end;
  10175. A_SHL,
  10176. A_SAL:
  10177. begin
  10178. DebugMsg(SPeepholeOptimization + 'SHL -> LEA' + SNoFlags, InstrList[Index]);
  10179. InstrList[Index].opcode := A_LEA;
  10180. reference_reset(NewRef, 1, []);
  10181. NewRef.index := InstrList[Index].oper[1]^.reg;
  10182. NewRef.scalefactor := 1 shl (InstrList[Index].oper[0]^.val);
  10183. InstrList[Index].loadref(0, NewRef);
  10184. end;
  10185. A_IMUL:
  10186. begin
  10187. DebugMsg(SPeepholeOptimization + 'IMUL -> LEA' + SNoFlags, InstrList[Index]);
  10188. InstrList[Index].opcode := A_LEA;
  10189. reference_reset(NewRef, 1, []);
  10190. NewRef.index := InstrList[Index].oper[1]^.reg;
  10191. case InstrList[Index].oper[0]^.val of
  10192. 2, 4, 8:
  10193. NewRef.scalefactor := InstrList[Index].oper[0]^.val;
  10194. else {3, 5 and 9}
  10195. begin
  10196. NewRef.scalefactor := InstrList[Index].oper[0]^.val - 1;
  10197. NewRef.base := InstrList[Index].oper[1]^.reg;
  10198. end;
  10199. end;
  10200. InstrList[Index].loadref(0, NewRef);
  10201. end;
  10202. else
  10203. InternalError(2021051710);
  10204. end;
  10205. end;
  10206. { Mark the FLAGS register as used across this whole block }
  10207. AllocRegBetween(NR_DEFAULTFLAGS, p, hp1, UsedRegs);
  10208. end;
  10209. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  10210. JumpC := taicpu(hp2).condition;
  10211. Unconditional := False;
  10212. if conditions_equal(JumpC, C_E) then
  10213. SetC := inverse_cond(taicpu(p).condition)
  10214. else if conditions_equal(JumpC, C_NE) then
  10215. SetC := taicpu(p).condition
  10216. else
  10217. { We've got something weird here (and inefficent) }
  10218. begin
  10219. DebugMsg('DEBUG: Inefficient jump - check code generation', p);
  10220. SetC := C_NONE;
  10221. { JAE/JNB will always branch (use 'condition_in', since C_AE <> C_NB normally) }
  10222. if condition_in(C_AE, JumpC) then
  10223. Unconditional := True
  10224. else
  10225. { Not sure what to do with this jump - drop out }
  10226. Exit;
  10227. end;
  10228. RemoveInstruction(hp1);
  10229. if Unconditional then
  10230. MakeUnconditional(taicpu(hp2))
  10231. else
  10232. begin
  10233. if SetC = C_NONE then
  10234. InternalError(2018061402);
  10235. taicpu(hp2).SetCondition(SetC);
  10236. end;
  10237. { as hp2 is a jump, we cannot use RegUsedAfterInstruction but we have to check if it is included in
  10238. TmpUsedRegs }
  10239. if not TmpUsedRegs[getregtype(taicpu(p).oper[0]^.reg)].IsUsed(taicpu(p).oper[0]^.reg) then
  10240. begin
  10241. RemoveCurrentp(p, hp2);
  10242. if taicpu(hp2).opcode = A_SETcc then
  10243. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/SETcc -> SETcc',p)
  10244. else
  10245. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/Jcc -> Jcc',p);
  10246. end
  10247. else
  10248. if taicpu(hp2).opcode = A_SETcc then
  10249. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/SETcc -> SETcc/SETcc',p)
  10250. else
  10251. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/Jcc -> SETcc/Jcc',p);
  10252. Result := True;
  10253. end
  10254. else if
  10255. { Make sure the instructions are adjacent }
  10256. (
  10257. not (cs_opt_level3 in current_settings.optimizerswitches) or
  10258. GetNextInstruction(p, hp1)
  10259. ) and
  10260. MatchInstruction(hp1, A_MOV, [S_B]) and
  10261. { Writing to memory is allowed }
  10262. MatchOperand(taicpu(p).oper[0]^, taicpu(hp1).oper[0]^.reg) then
  10263. begin
  10264. {
  10265. Watch out for sequences such as:
  10266. set(c)b %regb
  10267. movb %regb,(ref)
  10268. movb $0,1(ref)
  10269. movb $0,2(ref)
  10270. movb $0,3(ref)
  10271. Much more efficient to turn it into:
  10272. movl $0,%regl
  10273. set(c)b %regb
  10274. movl %regl,(ref)
  10275. Or:
  10276. set(c)b %regb
  10277. movzbl %regb,%regl
  10278. movl %regl,(ref)
  10279. }
  10280. if (taicpu(hp1).oper[1]^.typ = top_ref) and
  10281. GetNextInstruction(hp1, hp2) and
  10282. MatchInstruction(hp2, A_MOV, [S_B]) and
  10283. (taicpu(hp2).oper[1]^.typ = top_ref) and
  10284. CheckMemoryWrite(taicpu(hp1), taicpu(hp2)) then
  10285. begin
  10286. { Don't do anything else except set Result to True }
  10287. end
  10288. else
  10289. begin
  10290. if taicpu(p).oper[0]^.typ = top_reg then
  10291. begin
  10292. TransferUsedRegs(TmpUsedRegs);
  10293. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  10294. end;
  10295. { If it's not a register, it's a memory address }
  10296. if (taicpu(p).oper[0]^.typ <> top_reg) or RegUsedAfterInstruction(taicpu(p).oper[0]^.reg, hp1, TmpUsedRegs) then
  10297. begin
  10298. { Even if the register is still in use, we can minimise the
  10299. pipeline stall by changing the MOV into another SETcc. }
  10300. taicpu(hp1).opcode := A_SETcc;
  10301. taicpu(hp1).condition := taicpu(p).condition;
  10302. if taicpu(hp1).oper[1]^.typ = top_ref then
  10303. begin
  10304. { Swapping the operand pointers like this is probably a
  10305. bit naughty, but it is far faster than using loadoper
  10306. to transfer the reference from oper[1] to oper[0] if
  10307. you take into account the extra procedure calls and
  10308. the memory allocation and deallocation required }
  10309. OperPtr := taicpu(hp1).oper[1];
  10310. taicpu(hp1).oper[1] := taicpu(hp1).oper[0];
  10311. taicpu(hp1).oper[0] := OperPtr;
  10312. end
  10313. else
  10314. taicpu(hp1).oper[0]^.reg := taicpu(hp1).oper[1]^.reg;
  10315. taicpu(hp1).clearop(1);
  10316. taicpu(hp1).ops := 1;
  10317. DebugMsg(SPeepholeOptimization + 'SETcc/Mov -> SETcc/SETcc',p);
  10318. end
  10319. else
  10320. begin
  10321. if taicpu(hp1).oper[1]^.typ = top_reg then
  10322. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,UsedRegs);
  10323. taicpu(p).loadoper(0, taicpu(hp1).oper[1]^);
  10324. RemoveInstruction(hp1);
  10325. DebugMsg(SPeepholeOptimization + 'SETcc/Mov -> SETcc',p);
  10326. end
  10327. end;
  10328. Result := True;
  10329. end;
  10330. end;
  10331. end;
  10332. function TX86AsmOptimizer.OptPass2Jmp(var p : tai) : boolean;
  10333. var
  10334. hp1: tai;
  10335. Count: Integer;
  10336. OrigLabel: TAsmLabel;
  10337. begin
  10338. result := False;
  10339. { Sometimes, the optimisations below can permit this }
  10340. RemoveDeadCodeAfterJump(p);
  10341. if (taicpu(p).oper[0]^.typ=top_ref) and (taicpu(p).oper[0]^.ref^.refaddr=addr_full) and (taicpu(p).oper[0]^.ref^.base=NR_NO) and
  10342. (taicpu(p).oper[0]^.ref^.index=NR_NO) and (taicpu(p).oper[0]^.ref^.symbol is tasmlabel) then
  10343. begin
  10344. OrigLabel := TAsmLabel(taicpu(p).oper[0]^.ref^.symbol);
  10345. { Also a side-effect of optimisations }
  10346. if CollapseZeroDistJump(p, OrigLabel) then
  10347. begin
  10348. Result := True;
  10349. Exit;
  10350. end;
  10351. hp1 := GetLabelWithSym(OrigLabel);
  10352. if (taicpu(p).condition=C_None) and assigned(hp1) and SkipLabels(hp1,hp1) and (hp1.typ = ait_instruction) then
  10353. begin
  10354. if taicpu(hp1).opcode = A_RET then
  10355. begin
  10356. {
  10357. change
  10358. jmp .L1
  10359. ...
  10360. .L1:
  10361. ret
  10362. into
  10363. ret
  10364. }
  10365. begin
  10366. ConvertJumpToRET(p, hp1);
  10367. result:=true;
  10368. end;
  10369. end
  10370. else if (cs_opt_level3 in current_settings.optimizerswitches) and
  10371. not (cs_opt_size in current_settings.optimizerswitches) and
  10372. CheckJumpMovTransferOpt(p, hp1, 0, Count) then
  10373. begin
  10374. Result := True;
  10375. Exit;
  10376. end;
  10377. end;
  10378. end;
  10379. end;
  10380. class function TX86AsmOptimizer.CanBeCMOV(p, cond_p: tai) : boolean;
  10381. begin
  10382. Result := assigned(p) and
  10383. MatchInstruction(p,A_MOV,[S_W,S_L,S_Q]) and
  10384. (taicpu(p).oper[1]^.typ = top_reg) and
  10385. (
  10386. (taicpu(p).oper[0]^.typ = top_reg) or
  10387. { allow references, but only pure symbols or got rel. addressing with RIP as based,
  10388. it is not expected that this can cause a seg. violation }
  10389. (
  10390. (taicpu(p).oper[0]^.typ = top_ref) and
  10391. { TODO: Can we detect which references become constants at this
  10392. stage so we don't have to do a blanket ban? }
  10393. (taicpu(p).oper[0]^.ref^.refaddr <> addr_full) and
  10394. (
  10395. IsRefSafe(taicpu(p).oper[0]^.ref) or
  10396. (
  10397. { If the reference also appears in the condition, then we know it's safe, otherwise
  10398. any kind of access violation would have occurred already }
  10399. Assigned(cond_p) and
  10400. { Make sure the sizes match too so we're reading and writing the same number of bytes }
  10401. (cond_p.typ = ait_instruction) and
  10402. (taicpu(cond_p).opsize = taicpu(p).opsize) and
  10403. { Just consider 2-operand comparison instructions for now to be safe }
  10404. (taicpu(cond_p).ops = 2) and
  10405. (
  10406. ((taicpu(cond_p).oper[1]^.typ = top_ref) and RefsEqual(taicpu(cond_p).oper[1]^.ref^, taicpu(p).oper[0]^.ref^)) or
  10407. (
  10408. (taicpu(cond_p).oper[0]^.typ = top_ref) and
  10409. { Don't risk identical registers but different offsets, as we may have constructs
  10410. such as buffer streams with things like length fields that indicate whether
  10411. any more data follows. And there are probably some contrived examples where
  10412. writing to offsets behind the one being read also lead to access violations }
  10413. RefsEqual(taicpu(cond_p).oper[0]^.ref^, taicpu(p).oper[0]^.ref^) and
  10414. (
  10415. { Check that we're not modifying a register that appears in the reference }
  10416. (InsProp[taicpu(cond_p).opcode].Ch * [Ch_Mop2, Ch_RWop2, Ch_Wop2] = []) or
  10417. (taicpu(cond_p).oper[1]^.typ <> top_reg) or
  10418. not RegInRef(taicpu(cond_p).oper[1]^.reg, taicpu(cond_p).oper[0]^.ref^)
  10419. )
  10420. )
  10421. )
  10422. )
  10423. )
  10424. )
  10425. );
  10426. end;
  10427. class procedure TX86AsmOptimizer.UpdateIntRegsNoDealloc(var AUsedRegs: TAllUsedRegs; p: Tai);
  10428. begin
  10429. { Update integer registers, ignoring deallocations }
  10430. repeat
  10431. while assigned(p) and
  10432. ((p.typ in (SkipInstr - [ait_RegAlloc])) or
  10433. (p.typ = ait_label) or
  10434. ((p.typ = ait_marker) and
  10435. (tai_Marker(p).Kind in [mark_AsmBlockEnd,mark_NoLineInfoStart,mark_NoLineInfoEnd]))) do
  10436. p := tai(p.next);
  10437. while assigned(p) and
  10438. (p.typ=ait_RegAlloc) Do
  10439. begin
  10440. if (getregtype(tai_regalloc(p).reg) = R_INTREGISTER) then
  10441. begin
  10442. case tai_regalloc(p).ratype of
  10443. ra_alloc :
  10444. IncludeRegInUsedRegs(tai_regalloc(p).reg, AUsedRegs);
  10445. else
  10446. ;
  10447. end;
  10448. end;
  10449. p := tai(p.next);
  10450. end;
  10451. until not(assigned(p)) or
  10452. (not(p.typ in SkipInstr) and
  10453. not((p.typ = ait_label) and
  10454. labelCanBeSkipped(tai_label(p))));
  10455. end;
  10456. function TX86AsmOptimizer.OptPass2Jcc(var p : tai) : boolean;
  10457. var
  10458. hp1,hp2: tai;
  10459. carryadd_opcode : TAsmOp;
  10460. symbol: TAsmSymbol;
  10461. increg, tmpreg: TRegister;
  10462. {$ifndef i8086}
  10463. { Code and variables specific to CMOV optimisations }
  10464. hp3,hp4,hp5,
  10465. hp_stop, hp_lblxxx, hp_lblyyy, hpmov1,hpmov2, hp_prev, hp_flagalloc, hp_prev2, hp_new, hp_jump: tai;
  10466. l, c, w, x : Longint;
  10467. condition, second_condition : TAsmCond;
  10468. FoundMatchingJump, RegMatch: Boolean;
  10469. RegWrites: array[0..MAX_CMOV_INSTRUCTIONS*2 - 1] of TRegister;
  10470. ConstRegs: array[0..MAX_CMOV_REGISTERS - 1] of TRegister;
  10471. ConstVals: array[0..MAX_CMOV_REGISTERS - 1] of TCGInt;
  10472. { Tries to convert a mov const,%reg instruction into a CMOV by reserving a
  10473. new register to store the constant }
  10474. function TryCMOVConst(p, search_start_p, stop_search_p: tai; var StoredCount: LongInt; var CMOVCount: LongInt): Boolean;
  10475. var
  10476. RegSize: TSubRegister;
  10477. CurrentVal: TCGInt;
  10478. NewReg: TRegister;
  10479. X: ShortInt;
  10480. begin
  10481. Result := False;
  10482. if not MatchOpType(taicpu(p), top_const, top_reg) then
  10483. Exit;
  10484. if StoredCount >= MAX_CMOV_REGISTERS then
  10485. { Arrays are full }
  10486. Exit;
  10487. { Remember that CMOV can't encode 8-bit registers }
  10488. case taicpu(p).opsize of
  10489. S_W:
  10490. RegSize := R_SUBW;
  10491. S_L:
  10492. RegSize := R_SUBD;
  10493. S_Q:
  10494. RegSize := R_SUBQ;
  10495. else
  10496. InternalError(2021100401);
  10497. end;
  10498. { See if the value has already been reserved for another CMOV instruction }
  10499. CurrentVal := taicpu(p).oper[0]^.val;
  10500. for X := 0 to StoredCount - 1 do
  10501. if ConstVals[X] = CurrentVal then
  10502. begin
  10503. ConstRegs[StoredCount] := ConstRegs[X];
  10504. ConstVals[StoredCount] := CurrentVal;
  10505. Result := True;
  10506. Inc(StoredCount);
  10507. { Don't increase CMOVCount this time, since we're re-using a register }
  10508. Exit;
  10509. end;
  10510. NewReg := GetIntRegisterBetween(RegSize, TmpUsedRegs, search_start_p, stop_search_p, True);
  10511. if NewReg = NR_NO then
  10512. { No free registers }
  10513. Exit;
  10514. { Reserve the register so subsequent TryCMOVConst calls don't all end
  10515. up vying for the same register }
  10516. IncludeRegInUsedRegs(NewReg, TmpUsedRegs);
  10517. ConstRegs[StoredCount] := NewReg;
  10518. ConstVals[StoredCount] := CurrentVal;
  10519. Inc(StoredCount);
  10520. { Increment the CMOV count variable from OptPass2JCC, since the extra
  10521. MOV required adds complexity and will cause diminishing returns
  10522. sooner than normal. This is more of an approximate weighting than
  10523. anything else. }
  10524. Inc(CMOVCount);
  10525. Result := True;
  10526. end;
  10527. {$endif i8086}
  10528. begin
  10529. result:=false;
  10530. if GetNextInstruction(p,hp1) then
  10531. begin
  10532. if (hp1.typ=ait_label) then
  10533. begin
  10534. Result := DoSETccLblRETOpt(p, tai_label(hp1));
  10535. Exit;
  10536. end
  10537. else if (hp1.typ<>ait_instruction) then
  10538. Exit;
  10539. symbol := TAsmLabel(taicpu(p).oper[0]^.ref^.symbol);
  10540. if (
  10541. (
  10542. ((Taicpu(hp1).opcode=A_ADD) or (Taicpu(hp1).opcode=A_SUB)) and
  10543. MatchOptype(Taicpu(hp1),top_const,top_reg) and
  10544. (Taicpu(hp1).oper[0]^.val=1)
  10545. ) or
  10546. ((Taicpu(hp1).opcode=A_INC) or (Taicpu(hp1).opcode=A_DEC))
  10547. ) and
  10548. GetNextInstruction(hp1,hp2) and
  10549. SkipAligns(hp2, hp2) and
  10550. (hp2.typ = ait_label) and
  10551. (Tasmlabel(symbol) = Tai_label(hp2).labsym) then
  10552. { jb @@1 cmc
  10553. inc/dec operand --> adc/sbb operand,0
  10554. @@1:
  10555. ... and ...
  10556. jnb @@1
  10557. inc/dec operand --> adc/sbb operand,0
  10558. @@1: }
  10559. begin
  10560. if Taicpu(p).condition in [C_NAE,C_B,C_C] then
  10561. begin
  10562. case taicpu(hp1).opcode of
  10563. A_INC,
  10564. A_ADD:
  10565. carryadd_opcode:=A_ADC;
  10566. A_DEC,
  10567. A_SUB:
  10568. carryadd_opcode:=A_SBB;
  10569. else
  10570. InternalError(2021011001);
  10571. end;
  10572. Taicpu(p).clearop(0);
  10573. Taicpu(p).ops:=0;
  10574. Taicpu(p).is_jmp:=false;
  10575. Taicpu(p).opcode:=A_CMC;
  10576. Taicpu(p).condition:=C_NONE;
  10577. DebugMsg(SPeepholeOptimization+'JccAdd/Inc/Dec2CmcAdc/Sbb',p);
  10578. Taicpu(hp1).ops:=2;
  10579. if (Taicpu(hp1).opcode=A_ADD) or (Taicpu(hp1).opcode=A_SUB) then
  10580. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[1]^)
  10581. else
  10582. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[0]^);
  10583. Taicpu(hp1).loadconst(0,0);
  10584. Taicpu(hp1).opcode:=carryadd_opcode;
  10585. result:=true;
  10586. exit;
  10587. end
  10588. else if Taicpu(p).condition in [C_AE,C_NB,C_NC] then
  10589. begin
  10590. case taicpu(hp1).opcode of
  10591. A_INC,
  10592. A_ADD:
  10593. carryadd_opcode:=A_ADC;
  10594. A_DEC,
  10595. A_SUB:
  10596. carryadd_opcode:=A_SBB;
  10597. else
  10598. InternalError(2021011002);
  10599. end;
  10600. Taicpu(hp1).ops:=2;
  10601. DebugMsg(SPeepholeOptimization+'JccAdd/Inc/Dec2Adc/Sbb',p);
  10602. if (Taicpu(hp1).opcode=A_ADD) or (Taicpu(hp1).opcode=A_SUB) then
  10603. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[1]^)
  10604. else
  10605. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[0]^);
  10606. Taicpu(hp1).loadconst(0,0);
  10607. Taicpu(hp1).opcode:=carryadd_opcode;
  10608. RemoveCurrentP(p, hp1);
  10609. result:=true;
  10610. exit;
  10611. end
  10612. {
  10613. jcc @@1 setcc tmpreg
  10614. inc/dec/add/sub operand -> (movzx tmpreg)
  10615. @@1: add/sub tmpreg,operand
  10616. While this increases code size slightly, it makes the code much faster if the
  10617. jump is unpredictable
  10618. }
  10619. else if not(cs_opt_size in current_settings.optimizerswitches) then
  10620. begin
  10621. { search for an available register which is volatile }
  10622. increg := GetIntRegisterBetween(R_SUBL, UsedRegs, p, hp1);
  10623. if increg <> NR_NO then
  10624. begin
  10625. { We don't need to check if tmpreg is in hp1 or not, because
  10626. it will be marked as in use at p (if not, this is
  10627. indictive of a compiler bug). }
  10628. TAsmLabel(symbol).decrefs;
  10629. Taicpu(p).clearop(0);
  10630. Taicpu(p).ops:=1;
  10631. Taicpu(p).is_jmp:=false;
  10632. Taicpu(p).opcode:=A_SETcc;
  10633. DebugMsg(SPeepholeOptimization+'JccAdd2SetccAdd',p);
  10634. Taicpu(p).condition:=inverse_cond(Taicpu(p).condition);
  10635. Taicpu(p).loadreg(0,increg);
  10636. if getsubreg(Taicpu(hp1).oper[1]^.reg)<>R_SUBL then
  10637. begin
  10638. case getsubreg(Taicpu(hp1).oper[1]^.reg) of
  10639. R_SUBW:
  10640. begin
  10641. tmpreg := newreg(R_INTREGISTER,getsupreg(increg),R_SUBW);
  10642. hp2:=Taicpu.op_reg_reg(A_MOVZX,S_BW,increg,tmpreg);
  10643. end;
  10644. R_SUBD:
  10645. begin
  10646. tmpreg := newreg(R_INTREGISTER,getsupreg(increg),R_SUBD);
  10647. hp2:=Taicpu.op_reg_reg(A_MOVZX,S_BL,increg,tmpreg);
  10648. end;
  10649. {$ifdef x86_64}
  10650. R_SUBQ:
  10651. begin
  10652. { MOVZX doesn't have a 64-bit variant, because
  10653. the 32-bit version implicitly zeroes the
  10654. upper 32-bits of the destination register }
  10655. tmpreg := newreg(R_INTREGISTER,getsupreg(increg),R_SUBD);
  10656. hp2:=Taicpu.op_reg_reg(A_MOVZX,S_BL,increg,tmpreg);
  10657. setsubreg(tmpreg, R_SUBQ);
  10658. end;
  10659. {$endif x86_64}
  10660. else
  10661. Internalerror(2020030601);
  10662. end;
  10663. taicpu(hp2).fileinfo:=taicpu(hp1).fileinfo;
  10664. asml.InsertAfter(hp2,p);
  10665. end
  10666. else
  10667. tmpreg := increg;
  10668. if (Taicpu(hp1).opcode=A_INC) or (Taicpu(hp1).opcode=A_DEC) then
  10669. begin
  10670. Taicpu(hp1).ops:=2;
  10671. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[0]^)
  10672. end;
  10673. Taicpu(hp1).loadreg(0,tmpreg);
  10674. AllocRegBetween(tmpreg,p,hp1,UsedRegs);
  10675. Result := True;
  10676. { p is no longer a Jcc instruction, so exit }
  10677. Exit;
  10678. end;
  10679. end;
  10680. end;
  10681. { Detect the following:
  10682. jmp<cond> @Lbl1
  10683. jmp @Lbl2
  10684. ...
  10685. @Lbl1:
  10686. ret
  10687. Change to:
  10688. jmp<inv_cond> @Lbl2
  10689. ret
  10690. }
  10691. if MatchInstruction(hp1,A_JMP,[]) and (taicpu(hp1).oper[0]^.ref^.refaddr=addr_full) then
  10692. begin
  10693. hp2:=getlabelwithsym(TAsmLabel(symbol));
  10694. if Assigned(hp2) and SkipLabels(hp2,hp2) and
  10695. MatchInstruction(hp2,A_RET,[S_NO]) then
  10696. begin
  10697. taicpu(p).condition := inverse_cond(taicpu(p).condition);
  10698. { Change label address to that of the unconditional jump }
  10699. taicpu(p).loadoper(0, taicpu(hp1).oper[0]^);
  10700. TAsmLabel(symbol).DecRefs;
  10701. taicpu(hp1).opcode := A_RET;
  10702. taicpu(hp1).is_jmp := false;
  10703. taicpu(hp1).ops := taicpu(hp2).ops;
  10704. DebugMsg(SPeepholeOptimization+'JccJmpRet2J!ccRet',p);
  10705. case taicpu(hp2).ops of
  10706. 0:
  10707. taicpu(hp1).clearop(0);
  10708. 1:
  10709. taicpu(hp1).loadconst(0,taicpu(hp2).oper[0]^.val);
  10710. else
  10711. internalerror(2016041302);
  10712. end;
  10713. end;
  10714. {$ifndef i8086}
  10715. end
  10716. {
  10717. convert
  10718. j<c> .L1
  10719. mov 1,reg
  10720. jmp .L2
  10721. .L1
  10722. mov 0,reg
  10723. .L2
  10724. into
  10725. mov 0,reg
  10726. set<not(c)> reg
  10727. take care of alignment and that the mov 0,reg is not converted into a xor as this
  10728. would destroy the flag contents
  10729. }
  10730. else if MatchInstruction(hp1,A_MOV,[]) and
  10731. MatchOpType(taicpu(hp1),top_const,top_reg) and
  10732. {$ifdef i386}
  10733. (
  10734. { Under i386, ESI, EDI, EBP and ESP
  10735. don't have an 8-bit representation }
  10736. not (getsupreg(taicpu(hp1).oper[1]^.reg) in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  10737. ) and
  10738. {$endif i386}
  10739. (taicpu(hp1).oper[0]^.val=1) and
  10740. GetNextInstruction(hp1,hp2) and
  10741. MatchInstruction(hp2,A_JMP,[]) and (taicpu(hp2).oper[0]^.ref^.refaddr=addr_full) and
  10742. GetNextInstruction(hp2,hp3) and
  10743. { skip align }
  10744. ((hp3.typ<>ait_align) or GetNextInstruction(hp3,hp3)) and
  10745. (hp3.typ=ait_label) and
  10746. (tasmlabel(taicpu(p).oper[0]^.ref^.symbol)=tai_label(hp3).labsym) and
  10747. (tai_label(hp3).labsym.getrefs=1) and
  10748. GetNextInstruction(hp3,hp4) and
  10749. MatchInstruction(hp4,A_MOV,[]) and
  10750. MatchOpType(taicpu(hp4),top_const,top_reg) and
  10751. (taicpu(hp4).oper[0]^.val=0) and
  10752. MatchOperand(taicpu(hp1).oper[1]^,taicpu(hp4).oper[1]^) and
  10753. GetNextInstruction(hp4,hp5) and
  10754. (hp5.typ=ait_label) and
  10755. (tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol)=tai_label(hp5).labsym) and
  10756. (tai_label(hp5).labsym.getrefs=1) then
  10757. begin
  10758. AllocRegBetween(NR_FLAGS,p,hp4,UsedRegs);
  10759. DebugMsg(SPeepholeOptimization+'JccMovJmpMov2MovSetcc',p);
  10760. { remove last label }
  10761. RemoveInstruction(hp5);
  10762. { remove second label }
  10763. RemoveInstruction(hp3);
  10764. { if align is present remove it }
  10765. if GetNextInstruction(hp2,hp3) and (hp3.typ=ait_align) then
  10766. RemoveInstruction(hp3);
  10767. { remove jmp }
  10768. RemoveInstruction(hp2);
  10769. if taicpu(hp1).opsize=S_B then
  10770. RemoveInstruction(hp1)
  10771. else
  10772. taicpu(hp1).loadconst(0,0);
  10773. taicpu(hp4).opcode:=A_SETcc;
  10774. taicpu(hp4).opsize:=S_B;
  10775. taicpu(hp4).condition:=inverse_cond(taicpu(p).condition);
  10776. taicpu(hp4).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(hp4).oper[1]^.reg),R_SUBL));
  10777. taicpu(hp4).opercnt:=1;
  10778. taicpu(hp4).ops:=1;
  10779. taicpu(hp4).freeop(1);
  10780. RemoveCurrentP(p);
  10781. Result:=true;
  10782. exit;
  10783. end
  10784. else if (CPUX86_HAS_CMOV in cpu_capabilities[current_settings.optimizecputype]) and
  10785. MatchInstruction(hp1,A_MOV,[S_W,S_L{$ifdef x86_64},S_Q{$endif x86_64}]) then
  10786. begin
  10787. { check for
  10788. jCC xxx
  10789. <several movs>
  10790. xxx:
  10791. Also spot:
  10792. Jcc xxx
  10793. <several movs>
  10794. jmp xxx
  10795. Change to:
  10796. <several cmovs with inverted condition>
  10797. jmp xxx (only for the 2nd case)
  10798. }
  10799. hp2 := p;
  10800. hp_lblxxx := hp1;
  10801. hp_flagalloc := nil;
  10802. hp_stop := nil;
  10803. FoundMatchingJump := False;
  10804. { Remember the first instruction in the first block of MOVs }
  10805. hpmov1 := hp1;
  10806. TransferUsedRegs(TmpUsedRegs);
  10807. while assigned(hp_lblxxx) and
  10808. { stop on labels }
  10809. (hp_lblxxx.typ <> ait_label) do
  10810. begin
  10811. { Keep track of all integer registers that are used }
  10812. UpdateIntRegsNoDealloc(TmpUsedRegs, tai(hp2.Next));
  10813. if hp_lblxxx.typ = ait_instruction then
  10814. begin
  10815. if (taicpu(hp_lblxxx).opcode = A_JMP) and
  10816. IsJumpToLabel(taicpu(hp_lblxxx)) then
  10817. begin
  10818. hp_stop := hp_lblxxx;
  10819. if (TAsmLabel(taicpu(hp_lblxxx).oper[0]^.ref^.symbol) = symbol) then
  10820. begin
  10821. { We found Jcc xxx; <several movs>; Jmp xxx }
  10822. FoundMatchingJump := True;
  10823. Break;
  10824. end;
  10825. { If it's not the jump we're looking for, it's
  10826. possibly the "if..else" variant }
  10827. end
  10828. { Check to see if we have a valid MOV instruction instead }
  10829. else if (taicpu(hp_lblxxx).opcode <> A_MOV) or
  10830. not (taicpu(hp_lblxxx).opsize in [S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  10831. Break
  10832. else
  10833. { This will be a valid MOV }
  10834. hp_stop := hp_lblxxx;
  10835. end;
  10836. hp2 := hp_lblxxx;
  10837. GetNextInstruction(hp_lblxxx, hp_lblxxx);
  10838. end;
  10839. { Just make sure the last MOV is included if there's no jump }
  10840. if (hp_lblxxx.typ = ait_label) and MatchInstruction(hp_stop, A_MOV, []) then
  10841. hp_stop := hp_lblxxx;
  10842. { Note, the logic behind using hp_stop over hp_lblxxx in the
  10843. range for TryCMOVConst is so GetIntRegisterBetween doesn't
  10844. fail when it reaches a JMP instruction in the "jcc xxx; movs;
  10845. jmp yyy; xxx:; movs; yyy:" variation }
  10846. if assigned(hp_lblxxx) and
  10847. (
  10848. { If we found JMP xxx, we don't actually need a label
  10849. (hp_lblxxx is the JMP instruction instead) }
  10850. FoundMatchingJump or
  10851. { Make sure we actually have the right label }
  10852. FindLabel(TAsmLabel(symbol), hp_lblxxx)
  10853. ) then
  10854. begin
  10855. { Use TmpUsedRegs to track registers that we reserve }
  10856. { When allocating temporary registers, try to look one
  10857. instruction back, as defining them before a CMP or TEST
  10858. instruction will be faster, and also avoid picking a
  10859. register that was only just deallocated }
  10860. if GetLastInstruction(p, hp_prev) and
  10861. MatchInstruction(hp_prev, [A_CMP, A_TEST, A_BSR, A_BSF, A_COMISS, A_COMISD, A_UCOMISS, A_UCOMISD, A_VCOMISS, A_VCOMISD, A_VUCOMISS, A_VUCOMISD], []) then
  10862. begin
  10863. { Mark all the registers in the comparison as 'in use', even if they've just been deallocated }
  10864. for l := 0 to 1 do
  10865. with taicpu(hp_prev).oper[l]^ do
  10866. case typ of
  10867. top_reg:
  10868. if getregtype(reg) = R_INTREGISTER then
  10869. IncludeRegInUsedRegs(reg, TmpUsedRegs);
  10870. top_ref:
  10871. begin
  10872. if
  10873. {$ifdef x86_64}
  10874. (ref^.base <> NR_RIP) and
  10875. {$endif x86_64}
  10876. (ref^.base <> NR_NO) then
  10877. IncludeRegInUsedRegs(ref^.base, TmpUsedRegs);
  10878. if (ref^.index <> NR_NO) then
  10879. IncludeRegInUsedRegs(ref^.index, TmpUsedRegs);
  10880. end
  10881. else
  10882. ;
  10883. end;
  10884. { When inserting instructions before hp_prev, try to insert
  10885. them before the allocation of the FLAGS register }
  10886. if not SetAndTest(FindRegAllocBackward(NR_DEFAULTFLAGS, tai(hp_prev.Previous)), hp_flagalloc) then
  10887. { If not found, set it equal to hp_prev so it's something sensible }
  10888. hp_flagalloc := hp_prev;
  10889. hp_prev2 := nil;
  10890. { When dealing with a comparison against zero, take
  10891. note of the instruction before it to see if we can
  10892. move instructions further back in order to benefit
  10893. PostPeepholeOptTestOr.
  10894. }
  10895. if (
  10896. (
  10897. (taicpu(hp_prev).opcode = A_CMP) and
  10898. MatchOperand(taicpu(hp_prev).oper[0]^, 0)
  10899. ) or
  10900. (
  10901. (taicpu(hp_prev).opcode = A_TEST) and
  10902. (
  10903. OpsEqual(taicpu(hp_prev).oper[0]^, taicpu(hp_prev).oper[1]^) or
  10904. MatchOperand(taicpu(hp_prev).oper[0]^, -1)
  10905. )
  10906. )
  10907. ) and
  10908. GetLastInstruction(hp_prev, hp_prev2) then
  10909. begin
  10910. if (hp_prev2.typ = ait_instruction) and
  10911. { These instructions set the zero flag if the result is zero }
  10912. MatchInstruction(hp_prev2, [A_ADD, A_SUB, A_OR, A_XOR, A_AND, A_POPCNT, A_LZCNT], []) then
  10913. begin
  10914. { Also mark all the registers in this previous instruction
  10915. as 'in use', even if they've just been deallocated }
  10916. for l := 0 to 1 do
  10917. with taicpu(hp_prev2).oper[l]^ do
  10918. case typ of
  10919. top_reg:
  10920. if getregtype(reg) = R_INTREGISTER then
  10921. IncludeRegInUsedRegs(reg, TmpUsedRegs);
  10922. top_ref:
  10923. begin
  10924. if
  10925. {$ifdef x86_64}
  10926. (ref^.base <> NR_RIP) and
  10927. {$endif x86_64}
  10928. (ref^.base <> NR_NO) then
  10929. IncludeRegInUsedRegs(ref^.base, TmpUsedRegs);
  10930. if (ref^.index <> NR_NO) then
  10931. IncludeRegInUsedRegs(ref^.index, TmpUsedRegs);
  10932. end
  10933. else
  10934. ;
  10935. end;
  10936. end
  10937. else
  10938. { Unsuitable instruction }
  10939. hp_prev2 := nil;
  10940. end;
  10941. end
  10942. else
  10943. begin
  10944. hp_prev := p;
  10945. { When inserting instructions before hp_prev, try to insert
  10946. them before the allocation of the FLAGS register }
  10947. if not SetAndTest(FindRegAllocBackward(NR_DEFAULTFLAGS, tai(p.Previous)), hp_flagalloc) then
  10948. { If not found, set it equal to p so it's something sensible }
  10949. hp_flagalloc := p;
  10950. hp_prev2 := nil;
  10951. end;
  10952. l := 0;
  10953. c := 0;
  10954. { Initialise RegWrites, ConstRegs and ConstVals }
  10955. FillChar(RegWrites[0], MAX_CMOV_INSTRUCTIONS * 2 * SizeOf(TRegister), 0);
  10956. FillChar(ConstRegs[0], MAX_CMOV_REGISTERS * SizeOf(TRegister), 0);
  10957. FillChar(ConstVals[0], MAX_CMOV_REGISTERS * SizeOf(TCGInt), 0);
  10958. while assigned(hp1) and
  10959. { Stop on the label we found }
  10960. (hp1 <> hp_lblxxx) do
  10961. begin
  10962. case hp1.typ of
  10963. ait_instruction:
  10964. if MatchInstruction(hp1, A_MOV, [S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  10965. begin
  10966. if CanBeCMOV(hp1, hp_prev) then
  10967. Inc(l)
  10968. else if not (cs_opt_size in current_settings.optimizerswitches) and
  10969. { CMOV with constants grows the code size }
  10970. TryCMOVConst(hp1, hp_prev, hp_stop, c, l) then
  10971. begin
  10972. { Register was reserved by TryCMOVConst and
  10973. stored on ConstRegs[c] }
  10974. end
  10975. else
  10976. Break;
  10977. end
  10978. else
  10979. Break;
  10980. else
  10981. ;
  10982. end;
  10983. GetNextInstruction(hp1,hp1);
  10984. end;
  10985. if (hp1 = hp_lblxxx) then
  10986. begin
  10987. if (l <= MAX_CMOV_INSTRUCTIONS) and (l > 0) then
  10988. begin
  10989. { Repurpose TmpUsedRegs to mark registers that we've defined }
  10990. TmpUsedRegs[R_INTREGISTER].Clear;
  10991. x := 0;
  10992. AllocRegBetween(NR_DEFAULTFLAGS, p, hp_lblxxx, UsedRegs);
  10993. condition := inverse_cond(taicpu(p).condition);
  10994. UpdateUsedRegs(tai(p.next));
  10995. hp1 := hpmov1;
  10996. repeat
  10997. if not Assigned(hp1) then
  10998. InternalError(2018062900);
  10999. if (hp1.typ = ait_instruction) then
  11000. begin
  11001. { Extra safeguard }
  11002. if (taicpu(hp1).opcode <> A_MOV) then
  11003. InternalError(2018062901);
  11004. if taicpu(hp1).oper[0]^.typ = top_const then
  11005. begin
  11006. if x >= MAX_CMOV_REGISTERS then
  11007. InternalError(2021100410);
  11008. { If it's in TmpUsedRegs, then this register
  11009. is being used more than once and hence has
  11010. already had its value defined (it gets
  11011. added to UsedRegs through AllocRegBetween
  11012. below) }
  11013. if not TmpUsedRegs[R_INTREGISTER].IsUsed(ConstRegs[x]) then
  11014. begin
  11015. hp_new := taicpu.op_const_reg(A_MOV, taicpu(hp1).opsize, taicpu(hp1).oper[0]^.val, ConstRegs[x]);
  11016. taicpu(hp_new).fileinfo := taicpu(hp_prev).fileinfo;
  11017. asml.InsertBefore(hp_new, hp_flagalloc);
  11018. if Assigned(hp_prev2) then
  11019. TrySwapMovOp(hp_prev2, hp_new);
  11020. IncludeRegInUsedRegs(ConstRegs[x], TmpUsedRegs);
  11021. end
  11022. else
  11023. { We just need an instruction between hp_prev and hp1
  11024. where we know the register is marked as in use }
  11025. hp_new := hpmov1;
  11026. AllocRegBetween(ConstRegs[x], hp_new, hp1, UsedRegs);
  11027. taicpu(hp1).loadreg(0, ConstRegs[x]);
  11028. Inc(x);
  11029. end;
  11030. taicpu(hp1).opcode := A_CMOVcc;
  11031. taicpu(hp1).condition := condition;
  11032. end;
  11033. UpdateUsedRegs(tai(hp1.next));
  11034. GetNextInstruction(hp1, hp1);
  11035. until (hp1 = hp_lblxxx);
  11036. hp2 := hp_lblxxx;
  11037. repeat
  11038. if not Assigned(hp2) then
  11039. InternalError(2018062910);
  11040. case hp2.typ of
  11041. ait_label:
  11042. { What we expected - break out of the loop (it won't be a dead label at the top of
  11043. a cluster because that was optimised at an earlier stage) }
  11044. Break;
  11045. ait_align:
  11046. { Go to the next entry until a label is found (may be multiple aligns before it) }
  11047. begin
  11048. hp2 := tai(hp2.Next);
  11049. Continue;
  11050. end;
  11051. ait_instruction:
  11052. begin
  11053. if taicpu(hp2).opcode<>A_JMP then
  11054. InternalError(2018062912);
  11055. { This is the Jcc @Lbl; <several movs>; JMP @Lbl variant }
  11056. Break;
  11057. end
  11058. else
  11059. begin
  11060. { Might be a comment or temporary allocation entry }
  11061. if not (hp2.typ in SkipInstr) then
  11062. InternalError(2018062911);
  11063. hp2 := tai(hp2.Next);
  11064. Continue;
  11065. end;
  11066. end;
  11067. until False;
  11068. { Now we can safely decrement the reference count }
  11069. tasmlabel(symbol).decrefs;
  11070. DebugMsg(SPeepholeOptimization+'JccMov2CMov',p);
  11071. { Remove the original jump }
  11072. RemoveInstruction(p); { Note, the choice to not use RemoveCurrentp is deliberate }
  11073. if hp2.typ=ait_instruction then
  11074. begin
  11075. p := hp2;
  11076. Result := True;
  11077. end
  11078. else
  11079. begin
  11080. UpdateUsedRegs(tai(hp2.next));
  11081. Result := GetNextInstruction(hp2, p); { Instruction after the label }
  11082. { Remove the label if this is its final reference }
  11083. if (tasmlabel(symbol).getrefs=0) then
  11084. begin
  11085. { Make sure the aligns get stripped too }
  11086. hp1 := tai(hp_lblxxx.Previous);
  11087. while Assigned(hp1) and (hp1.typ = ait_align) do
  11088. begin
  11089. hp_lblxxx := hp1;
  11090. hp1 := tai(hp_lblxxx.Previous);
  11091. end;
  11092. StripLabelFast(hp_lblxxx);
  11093. end;
  11094. end;
  11095. Exit;
  11096. end;
  11097. end
  11098. else if assigned(hp_lblxxx) and
  11099. { check further for
  11100. jCC xxx
  11101. <several movs 1>
  11102. jmp yyy
  11103. xxx:
  11104. <several movs 2>
  11105. yyy:
  11106. }
  11107. (l <= MAX_CMOV_INSTRUCTIONS - 1) and
  11108. { hp1 should be pointing to jmp yyy }
  11109. MatchInstruction(hp1, A_JMP, []) and
  11110. { real label and jump, no further references to the
  11111. label are allowed }
  11112. (TAsmLabel(symbol).getrefs=1) and
  11113. FindLabel(TAsmLabel(symbol), hp_lblxxx) then
  11114. begin
  11115. hp_jump := hp1;
  11116. { Don't set c to zero }
  11117. l := 0;
  11118. w := 0;
  11119. GetNextInstruction(hp_lblxxx, hpmov2);
  11120. hp2 := hp_lblxxx;
  11121. hp_lblyyy := hpmov2;
  11122. while assigned(hp_lblyyy) and
  11123. { stop on labels }
  11124. (hp_lblyyy.typ <> ait_label) do
  11125. begin
  11126. { Keep track of all integer registers that are used }
  11127. UpdateIntRegsNoDealloc(TmpUsedRegs, tai(hp2.Next));
  11128. if not MatchInstruction(hp_lblyyy, A_MOV, [S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  11129. Break;
  11130. hp2 := hp_lblyyy;
  11131. GetNextInstruction(hp_lblyyy, hp_lblyyy);
  11132. end;
  11133. { Analyse the second batch of MOVs to see if the setup is valid }
  11134. hp1 := hpmov2;
  11135. while assigned(hp1) and
  11136. (hp1 <> hp_lblyyy) do
  11137. begin
  11138. case hp1.typ of
  11139. ait_instruction:
  11140. if MatchInstruction(hp1, A_MOV, [S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  11141. begin
  11142. if CanBeCMOV(hp1, hp_prev) then
  11143. Inc(l)
  11144. else if not (cs_opt_size in current_settings.optimizerswitches)
  11145. { CMOV with constants grows the code size }
  11146. and TryCMOVConst(hp1, hpmov2, hp_lblyyy, c, l) then
  11147. begin
  11148. { Register was reserved by TryCMOVConst and
  11149. stored on ConstRegs[c] }
  11150. end
  11151. else
  11152. Break;
  11153. end
  11154. else
  11155. Break;
  11156. else
  11157. ;
  11158. end;
  11159. GetNextInstruction(hp1,hp1);
  11160. end;
  11161. { Repurpose TmpUsedRegs to mark registers that we've defined }
  11162. TmpUsedRegs[R_INTREGISTER].Clear;
  11163. if (l <= MAX_CMOV_INSTRUCTIONS - 1) and
  11164. (hp1 = hp_lblyyy) and
  11165. FindLabel(TAsmLabel(taicpu(hp_jump).oper[0]^.ref^.symbol), hp_lblyyy) then
  11166. begin
  11167. AllocRegBetween(NR_DEFAULTFLAGS, p, hp_lblyyy, UsedRegs);
  11168. second_condition := taicpu(p).condition;
  11169. condition := inverse_cond(taicpu(p).condition);
  11170. UpdateUsedRegs(tai(p.next));
  11171. { Scan through the first set of MOVs to update UsedRegs,
  11172. but don't process them yet }
  11173. hp1 := hpmov1;
  11174. repeat
  11175. if not Assigned(hp1) then
  11176. InternalError(2018062901);
  11177. UpdateUsedRegs(tai(hp1.next));
  11178. GetNextInstruction(hp1, hp1);
  11179. until (hp1 = hp_lblxxx);
  11180. UpdateUsedRegs(tai(hp_lblxxx.next));
  11181. { Process the second set of MOVs first,
  11182. because if a destination register is
  11183. shared between the first and second MOV
  11184. sets, it is more efficient to turn the
  11185. first one into a MOV instruction and place
  11186. it before the CMP if possible, but we
  11187. won't know which registers are shared
  11188. until we've processed at least one list,
  11189. so we might as well make it the second
  11190. one since that won't be modified again. }
  11191. hp1 := hpmov2;
  11192. repeat
  11193. if not Assigned(hp1) then
  11194. InternalError(2018062902);
  11195. if (hp1.typ = ait_instruction) then
  11196. begin
  11197. { Extra safeguard }
  11198. if (taicpu(hp1).opcode <> A_MOV) then
  11199. InternalError(2018062903);
  11200. if taicpu(hp1).oper[0]^.typ = top_const then
  11201. begin
  11202. RegMatch := False;
  11203. for x := 0 to c - 1 do
  11204. if (ConstVals[x] = taicpu(hp1).oper[0]^.val) then
  11205. begin
  11206. RegMatch := True;
  11207. { If it's in TmpUsedRegs, then this register
  11208. is being used more than once and hence has
  11209. already had its value defined (it gets
  11210. added to UsedRegs through AllocRegBetween
  11211. below) }
  11212. if not TmpUsedRegs[R_INTREGISTER].IsUsed(ConstRegs[x]) then
  11213. begin
  11214. hp_new := taicpu.op_const_reg(A_MOV, taicpu(hp1).opsize, taicpu(hp1).oper[0]^.val, ConstRegs[x]);
  11215. asml.InsertBefore(hp_new, hp_flagalloc);
  11216. if Assigned(hp_prev2) then
  11217. TrySwapMovOp(hp_prev2, hp_new);
  11218. IncludeRegInUsedRegs(ConstRegs[x], TmpUsedRegs);
  11219. end
  11220. else
  11221. { We just need an instruction between hp_prev and hp1
  11222. where we know the register is marked as in use }
  11223. hp_new := hpmov2;
  11224. AllocRegBetween(ConstRegs[x], hp_new, hp1, UsedRegs);
  11225. taicpu(hp1).loadreg(0, ConstRegs[x]);
  11226. Break;
  11227. end;
  11228. if not RegMatch then
  11229. InternalError(2021100411);
  11230. end;
  11231. taicpu(hp1).opcode := A_CMOVcc;
  11232. taicpu(hp1).condition := second_condition;
  11233. { Store these writes to search for
  11234. duplicates later on }
  11235. RegWrites[w] := taicpu(hp1).oper[1]^.reg;
  11236. Inc(w);
  11237. end;
  11238. UpdateUsedRegs(tai(hp1.next));
  11239. GetNextInstruction(hp1, hp1);
  11240. until (hp1 = hp_lblyyy);
  11241. { Now do the first set of MOVs }
  11242. hp1 := hpmov1;
  11243. repeat
  11244. if not Assigned(hp1) then
  11245. InternalError(2018062904);
  11246. if (hp1.typ = ait_instruction) then
  11247. begin
  11248. RegMatch := False;
  11249. { Extra safeguard }
  11250. if (taicpu(hp1).opcode <> A_MOV) then
  11251. InternalError(2018062905);
  11252. { Search through the RegWrites list to see
  11253. if there are any opposing CMOV pairs that
  11254. write to the same register }
  11255. for x := 0 to w - 1 do
  11256. if (RegWrites[x] = taicpu(hp1).oper[1]^.reg) then
  11257. begin
  11258. { We have a match. Keep this as a MOV }
  11259. { Move ahead in preparation }
  11260. GetNextInstruction(hp1, hp1);
  11261. RegMatch := True;
  11262. Break;
  11263. end;
  11264. if RegMatch then
  11265. Continue;
  11266. if taicpu(hp1).oper[0]^.typ = top_const then
  11267. begin
  11268. RegMatch := False;
  11269. for x := 0 to c - 1 do
  11270. if (ConstVals[x] = taicpu(hp1).oper[0]^.val) then
  11271. begin
  11272. RegMatch := True;
  11273. { If it's in TmpUsedRegs, then this register
  11274. is being used more than once and hence has
  11275. already had its value defined (it gets
  11276. added to UsedRegs through AllocRegBetween
  11277. below) }
  11278. if not TmpUsedRegs[R_INTREGISTER].IsUsed(ConstRegs[x]) then
  11279. begin
  11280. hp_new := taicpu.op_const_reg(A_MOV, taicpu(hp1).opsize, taicpu(hp1).oper[0]^.val, ConstRegs[x]);
  11281. asml.InsertBefore(hp_new, hp_flagalloc);
  11282. if Assigned(hp_prev2) then
  11283. TrySwapMovOp(hp_prev2, hp_new);
  11284. IncludeRegInUsedRegs(ConstRegs[x], TmpUsedRegs);
  11285. end
  11286. else
  11287. { We just need an instruction between hp_prev and hp1
  11288. where we know the register is marked as in use }
  11289. hp_new := hpmov1;
  11290. AllocRegBetween(ConstRegs[x], hp_new, hp1, UsedRegs);
  11291. taicpu(hp1).loadreg(0, ConstRegs[x]);
  11292. Break;
  11293. end;
  11294. if not RegMatch then
  11295. InternalError(2021100412);
  11296. end;
  11297. taicpu(hp1).opcode := A_CMOVcc;
  11298. taicpu(hp1).condition := condition;
  11299. end;
  11300. GetNextInstruction(hp1, hp1);
  11301. until (hp1 = hp_jump); { Stop at the jump, not lbl xxx }
  11302. UpdateUsedRegs(tai(hp_jump.next));
  11303. UpdateUsedRegs(tai(hp_lblyyy.next));
  11304. { Get first instruction after label }
  11305. hp1 := p;
  11306. GetNextInstruction(hp_lblyyy, p);
  11307. { Don't dereference yet, as doing so will cause
  11308. GetNextInstruction to skip the label and
  11309. optional align marker. [Kit] }
  11310. DebugMsg(SPeepholeOptimization+'JccMovJmpMov2CMovCMov',hp1);
  11311. { remove Jcc }
  11312. RemoveInstruction(hp1);
  11313. { Now we can safely decrement it }
  11314. tasmlabel(symbol).decrefs;
  11315. { Remove label xxx (it will have a ref of zero due to the initial check) }
  11316. { Make sure the aligns get stripped too }
  11317. hp1 := tai(hp_lblxxx.Previous);
  11318. while Assigned(hp1) and (hp1.typ = ait_align) do
  11319. begin
  11320. hp_lblxxx := hp1;
  11321. hp1 := tai(hp_lblxxx.Previous);
  11322. end;
  11323. StripLabelFast(hp_lblxxx);
  11324. { remove jmp }
  11325. symbol := taicpu(hp_jump).oper[0]^.ref^.symbol;
  11326. RemoveInstruction(hp_jump);
  11327. { As before, now we can safely decrement it }
  11328. TAsmLabel(symbol).decrefs;
  11329. { Remove label yyy (and the optional alignment) if its reference falls to zero }
  11330. if TAsmLabel(symbol).getrefs = 0 then
  11331. begin
  11332. { Make sure the aligns get stripped too }
  11333. hp1 := tai(hp_lblyyy.Previous);
  11334. while Assigned(hp1) and (hp1.typ = ait_align) do
  11335. begin
  11336. hp_lblyyy := hp1;
  11337. hp1 := tai(hp_lblyyy.Previous);
  11338. end;
  11339. StripLabelFast(hp_lblyyy);
  11340. end;
  11341. if Assigned(p) then
  11342. result := True;
  11343. exit;
  11344. end;
  11345. end;
  11346. end;
  11347. {$endif i8086}
  11348. end;
  11349. end;
  11350. end;
  11351. function TX86AsmOptimizer.OptPass1Movx(var p : tai) : boolean;
  11352. var
  11353. hp1,hp2,hp3: tai;
  11354. reg_and_hp1_is_instr, RegUsed, AndTest: Boolean;
  11355. NewSize: TOpSize;
  11356. NewRegSize: TSubRegister;
  11357. Limit: TCgInt;
  11358. SwapOper: POper;
  11359. begin
  11360. result:=false;
  11361. reg_and_hp1_is_instr:=(taicpu(p).oper[1]^.typ = top_reg) and
  11362. GetNextInstruction(p,hp1) and
  11363. (hp1.typ = ait_instruction);
  11364. if reg_and_hp1_is_instr and
  11365. (
  11366. (taicpu(hp1).opcode <> A_LEA) or
  11367. { If the LEA instruction can be converted into an arithmetic instruction,
  11368. it may be possible to then fold it. }
  11369. (
  11370. { If the flags register is in use, don't change the instruction
  11371. to an ADD otherwise this will scramble the flags. [Kit] }
  11372. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  11373. ConvertLEA(taicpu(hp1))
  11374. )
  11375. ) and
  11376. IsFoldableArithOp(taicpu(hp1),taicpu(p).oper[1]^.reg) and
  11377. GetNextInstruction(hp1,hp2) and
  11378. MatchInstruction(hp2,A_MOV,[]) and
  11379. (taicpu(hp2).oper[0]^.typ = top_reg) and
  11380. OpsEqual(taicpu(hp2).oper[1]^,taicpu(p).oper[0]^) and
  11381. ((taicpu(p).opsize in [S_BW,S_BL]) and (taicpu(hp2).opsize=S_B) or
  11382. (taicpu(p).opsize in [S_WL]) and (taicpu(hp2).opsize=S_W)) and
  11383. {$ifdef i386}
  11384. { not all registers have byte size sub registers on i386 }
  11385. ((taicpu(hp2).opsize<>S_B) or (getsupreg(taicpu(hp1).oper[0]^.reg) in [RS_EAX, RS_EBX, RS_ECX, RS_EDX])) and
  11386. {$endif i386}
  11387. (((taicpu(hp1).ops=2) and
  11388. (getsupreg(taicpu(hp2).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg))) or
  11389. ((taicpu(hp1).ops=1) and
  11390. (getsupreg(taicpu(hp2).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[0]^.reg)))) and
  11391. not(RegUsedAfterInstruction(taicpu(hp2).oper[0]^.reg,hp2,UsedRegs)) then
  11392. begin
  11393. { change movsX/movzX reg/ref, reg2
  11394. add/sub/or/... reg3/$const, reg2
  11395. mov reg2 reg/ref
  11396. to add/sub/or/... reg3/$const, reg/ref }
  11397. { by example:
  11398. movswl %si,%eax movswl %si,%eax p
  11399. decl %eax addl %edx,%eax hp1
  11400. movw %ax,%si movw %ax,%si hp2
  11401. ->
  11402. movswl %si,%eax movswl %si,%eax p
  11403. decw %eax addw %edx,%eax hp1
  11404. movw %ax,%si movw %ax,%si hp2
  11405. }
  11406. taicpu(hp1).changeopsize(taicpu(hp2).opsize);
  11407. {
  11408. ->
  11409. movswl %si,%eax movswl %si,%eax p
  11410. decw %si addw %dx,%si hp1
  11411. movw %ax,%si movw %ax,%si hp2
  11412. }
  11413. case taicpu(hp1).ops of
  11414. 1:
  11415. taicpu(hp1).loadoper(0,taicpu(hp2).oper[1]^);
  11416. 2:
  11417. begin
  11418. taicpu(hp1).loadoper(1,taicpu(hp2).oper[1]^);
  11419. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  11420. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  11421. end;
  11422. else
  11423. internalerror(2008042702);
  11424. end;
  11425. {
  11426. ->
  11427. decw %si addw %dx,%si p
  11428. }
  11429. DebugMsg(SPeepholeOptimization + 'var3',p);
  11430. RemoveCurrentP(p, hp1);
  11431. RemoveInstruction(hp2);
  11432. Result := True;
  11433. Exit;
  11434. end;
  11435. if reg_and_hp1_is_instr and
  11436. (taicpu(hp1).opcode = A_MOV) and
  11437. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  11438. (MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^)
  11439. {$ifdef x86_64}
  11440. { check for implicit extension to 64 bit }
  11441. or
  11442. ((taicpu(p).opsize in [S_BL,S_WL]) and
  11443. (taicpu(hp1).opsize=S_Q) and
  11444. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.reg)
  11445. )
  11446. {$endif x86_64}
  11447. )
  11448. then
  11449. begin
  11450. { change
  11451. movx %reg1,%reg2
  11452. mov %reg2,%reg3
  11453. dealloc %reg2
  11454. into
  11455. movx %reg,%reg3
  11456. }
  11457. TransferUsedRegs(TmpUsedRegs);
  11458. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  11459. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  11460. begin
  11461. DebugMsg(SPeepholeOptimization + 'MovxMov2Movx',p);
  11462. {$ifdef x86_64}
  11463. if (taicpu(p).opsize in [S_BL,S_WL]) and
  11464. (taicpu(hp1).opsize=S_Q) then
  11465. taicpu(p).loadreg(1,newreg(R_INTREGISTER,getsupreg(taicpu(hp1).oper[1]^.reg),R_SUBD))
  11466. else
  11467. {$endif x86_64}
  11468. taicpu(p).loadreg(1,taicpu(hp1).oper[1]^.reg);
  11469. RemoveInstruction(hp1);
  11470. Result := True;
  11471. Exit;
  11472. end;
  11473. end;
  11474. if reg_and_hp1_is_instr and
  11475. ((taicpu(hp1).opcode=A_MOV) or
  11476. (taicpu(hp1).opcode=A_ADD) or
  11477. (taicpu(hp1).opcode=A_SUB) or
  11478. (taicpu(hp1).opcode=A_CMP) or
  11479. (taicpu(hp1).opcode=A_OR) or
  11480. (taicpu(hp1).opcode=A_XOR) or
  11481. (taicpu(hp1).opcode=A_AND)
  11482. ) and
  11483. (taicpu(hp1).oper[1]^.typ = top_reg) then
  11484. begin
  11485. AndTest := (taicpu(hp1).opcode=A_AND) and
  11486. GetNextInstruction(hp1, hp2) and
  11487. (hp2.typ = ait_instruction) and
  11488. (
  11489. (
  11490. (taicpu(hp2).opcode=A_TEST) and
  11491. (
  11492. MatchOperand(taicpu(hp2).oper[0]^, taicpu(hp1).oper[1]^.reg) or
  11493. MatchOperand(taicpu(hp2).oper[0]^, -1) or
  11494. (
  11495. { If the AND and TEST instructions share a constant, this is also valid }
  11496. (taicpu(hp1).oper[0]^.typ = top_const) and
  11497. MatchOperand(taicpu(hp2).oper[0]^, taicpu(hp1).oper[0]^.val)
  11498. )
  11499. ) and
  11500. MatchOperand(taicpu(hp2).oper[1]^, taicpu(hp1).oper[1]^.reg)
  11501. ) or
  11502. (
  11503. (taicpu(hp2).opcode=A_CMP) and
  11504. MatchOperand(taicpu(hp2).oper[0]^, 0) and
  11505. MatchOperand(taicpu(hp2).oper[1]^, taicpu(hp1).oper[1]^.reg)
  11506. )
  11507. );
  11508. { change
  11509. movx (oper),%reg2
  11510. and $x,%reg2
  11511. test %reg2,%reg2
  11512. dealloc %reg2
  11513. into
  11514. op %reg1,%reg3
  11515. if the second op accesses only the bits stored in reg1
  11516. }
  11517. if ((taicpu(p).oper[0]^.typ=top_reg) or
  11518. ((taicpu(p).oper[0]^.typ=top_ref) and (taicpu(p).oper[0]^.ref^.refaddr<>addr_full))) and
  11519. (taicpu(hp1).oper[0]^.typ = top_const) and
  11520. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  11521. AndTest then
  11522. begin
  11523. { Check if the AND constant is in range }
  11524. case taicpu(p).opsize of
  11525. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  11526. begin
  11527. NewSize := S_B;
  11528. Limit := $FF;
  11529. end;
  11530. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  11531. begin
  11532. NewSize := S_W;
  11533. Limit := $FFFF;
  11534. end;
  11535. {$ifdef x86_64}
  11536. S_LQ:
  11537. begin
  11538. NewSize := S_L;
  11539. Limit := $FFFFFFFF;
  11540. end;
  11541. {$endif x86_64}
  11542. else
  11543. InternalError(2021120303);
  11544. end;
  11545. if (
  11546. ((taicpu(hp1).oper[0]^.val and Limit) = taicpu(hp1).oper[0]^.val) or
  11547. { Check for negative operands }
  11548. (((not taicpu(hp1).oper[0]^.val) and Limit) = (not taicpu(hp1).oper[0]^.val))
  11549. ) and
  11550. GetNextInstruction(hp2,hp3) and
  11551. MatchInstruction(hp3,A_Jcc,A_Setcc,A_CMOVcc,[]) and
  11552. (taicpu(hp3).condition in [C_E,C_NE]) then
  11553. begin
  11554. TransferUsedRegs(TmpUsedRegs);
  11555. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  11556. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  11557. if not(RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp2, TmpUsedRegs)) then
  11558. begin
  11559. DebugMsg(SPeepholeOptimization + 'MovxAndTest2Test done',p);
  11560. taicpu(hp1).loadoper(1, taicpu(p).oper[0]^);
  11561. taicpu(hp1).opcode := A_TEST;
  11562. taicpu(hp1).opsize := NewSize;
  11563. RemoveInstruction(hp2);
  11564. RemoveCurrentP(p, hp1);
  11565. Result:=true;
  11566. exit;
  11567. end;
  11568. end;
  11569. end;
  11570. if (taicpu(hp1).oper[0]^.typ = top_reg) and
  11571. (((taicpu(p).opsize in [S_BW,S_BL,S_WL{$ifdef x86_64},S_BQ,S_WQ,S_LQ{$endif x86_64}]) and
  11572. (taicpu(hp1).opsize=S_B)) or
  11573. ((taicpu(p).opsize in [S_WL{$ifdef x86_64},S_WQ,S_LQ{$endif x86_64}]) and
  11574. (taicpu(hp1).opsize=S_W))
  11575. {$ifdef x86_64}
  11576. or ((taicpu(p).opsize=S_LQ) and
  11577. (taicpu(hp1).opsize=S_L))
  11578. {$endif x86_64}
  11579. ) and
  11580. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.reg) then
  11581. begin
  11582. { change
  11583. movx %reg1,%reg2
  11584. op %reg2,%reg3
  11585. dealloc %reg2
  11586. into
  11587. op %reg1,%reg3
  11588. if the second op accesses only the bits stored in reg1
  11589. }
  11590. TransferUsedRegs(TmpUsedRegs);
  11591. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  11592. if AndTest then
  11593. begin
  11594. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  11595. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs);
  11596. end
  11597. else
  11598. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs);
  11599. if not RegUsed then
  11600. begin
  11601. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 1',p);
  11602. if taicpu(p).oper[0]^.typ=top_reg then
  11603. begin
  11604. case taicpu(hp1).opsize of
  11605. S_B:
  11606. taicpu(hp1).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[0]^.reg),R_SUBL));
  11607. S_W:
  11608. taicpu(hp1).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[0]^.reg),R_SUBW));
  11609. S_L:
  11610. taicpu(hp1).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[0]^.reg),R_SUBD));
  11611. else
  11612. Internalerror(2020102301);
  11613. end;
  11614. AllocRegBetween(taicpu(hp1).oper[0]^.reg,p,hp1,UsedRegs);
  11615. end
  11616. else
  11617. taicpu(hp1).loadref(0,taicpu(p).oper[0]^.ref^);
  11618. RemoveCurrentP(p);
  11619. if AndTest then
  11620. RemoveInstruction(hp2);
  11621. result:=true;
  11622. exit;
  11623. end;
  11624. end
  11625. else if (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg) and
  11626. (
  11627. { Bitwise operations only }
  11628. (taicpu(hp1).opcode=A_AND) or
  11629. (taicpu(hp1).opcode=A_TEST) or
  11630. (
  11631. (taicpu(hp1).oper[0]^.typ = top_const) and
  11632. (
  11633. (taicpu(hp1).opcode=A_OR) or
  11634. (taicpu(hp1).opcode=A_XOR)
  11635. )
  11636. )
  11637. ) and
  11638. (
  11639. (taicpu(hp1).oper[0]^.typ = top_const) or
  11640. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) or
  11641. not RegInOp(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^)
  11642. ) then
  11643. begin
  11644. { change
  11645. movx %reg2,%reg2
  11646. op const,%reg2
  11647. into
  11648. op const,%reg2 (smaller version)
  11649. movx %reg2,%reg2
  11650. also change
  11651. movx %reg1,%reg2
  11652. and/test (oper),%reg2
  11653. dealloc %reg2
  11654. into
  11655. and/test (oper),%reg1
  11656. }
  11657. case taicpu(p).opsize of
  11658. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  11659. begin
  11660. NewSize := S_B;
  11661. NewRegSize := R_SUBL;
  11662. Limit := $FF;
  11663. end;
  11664. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  11665. begin
  11666. NewSize := S_W;
  11667. NewRegSize := R_SUBW;
  11668. Limit := $FFFF;
  11669. end;
  11670. {$ifdef x86_64}
  11671. S_LQ:
  11672. begin
  11673. NewSize := S_L;
  11674. NewRegSize := R_SUBD;
  11675. Limit := $FFFFFFFF;
  11676. end;
  11677. {$endif x86_64}
  11678. else
  11679. Internalerror(2021120302);
  11680. end;
  11681. TransferUsedRegs(TmpUsedRegs);
  11682. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  11683. if AndTest then
  11684. begin
  11685. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  11686. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs);
  11687. end
  11688. else
  11689. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs);
  11690. if
  11691. (
  11692. (taicpu(p).opcode = A_MOVZX) and
  11693. (
  11694. (taicpu(hp1).opcode=A_AND) or
  11695. (taicpu(hp1).opcode=A_TEST)
  11696. ) and
  11697. not (
  11698. { If both are references, then the final instruction will have
  11699. both operands as references, which is not allowed }
  11700. (taicpu(p).oper[0]^.typ = top_ref) and
  11701. (taicpu(hp1).oper[0]^.typ = top_ref)
  11702. ) and
  11703. not RegUsed
  11704. ) or
  11705. (
  11706. (
  11707. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) or
  11708. not RegUsed
  11709. ) and
  11710. (taicpu(p).oper[0]^.typ = top_reg) and
  11711. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11712. (taicpu(hp1).oper[0]^.typ = top_const) and
  11713. ((taicpu(hp1).oper[0]^.val and Limit) = taicpu(hp1).oper[0]^.val)
  11714. ) then
  11715. begin
  11716. {$if defined(i386) or defined(i8086)}
  11717. { If the target size is 8-bit, make sure we can actually encode it }
  11718. if (NewRegSize = R_SUBL) and (taicpu(hp1).oper[0]^.typ = top_reg) and not (GetSupReg(taicpu(hp1).oper[0]^.reg) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX]) then
  11719. Exit;
  11720. {$endif i386 or i8086}
  11721. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 2',p);
  11722. taicpu(hp1).opsize := NewSize;
  11723. taicpu(hp1).loadoper(1, taicpu(p).oper[0]^);
  11724. if AndTest then
  11725. begin
  11726. RemoveInstruction(hp2);
  11727. if not RegUsed then
  11728. begin
  11729. taicpu(hp1).opcode := A_TEST;
  11730. if (taicpu(hp1).oper[0]^.typ = top_ref) then
  11731. begin
  11732. { Make sure the reference is the second operand }
  11733. SwapOper := taicpu(hp1).oper[0];
  11734. taicpu(hp1).oper[0] := taicpu(hp1).oper[1];
  11735. taicpu(hp1).oper[1] := SwapOper;
  11736. end;
  11737. end;
  11738. end;
  11739. case taicpu(hp1).oper[0]^.typ of
  11740. top_reg:
  11741. setsubreg(taicpu(hp1).oper[0]^.reg, NewRegSize);
  11742. top_const:
  11743. { For the AND/TEST case }
  11744. taicpu(hp1).oper[0]^.val := taicpu(hp1).oper[0]^.val and Limit;
  11745. else
  11746. ;
  11747. end;
  11748. if RegUsed then
  11749. begin
  11750. AsmL.Remove(p);
  11751. AsmL.InsertAfter(p, hp1);
  11752. p := hp1;
  11753. end
  11754. else
  11755. RemoveCurrentP(p, hp1);
  11756. result:=true;
  11757. exit;
  11758. end;
  11759. end;
  11760. end;
  11761. if reg_and_hp1_is_instr and
  11762. (taicpu(p).oper[0]^.typ = top_reg) and
  11763. (
  11764. (taicpu(hp1).opcode = A_SHL) or (taicpu(hp1).opcode = A_SAL)
  11765. ) and
  11766. (taicpu(hp1).oper[0]^.typ = top_const) and
  11767. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11768. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  11769. { Minimum shift value allowed is the bit difference between the sizes }
  11770. (taicpu(hp1).oper[0]^.val >=
  11771. { Multiply by 8 because tcgsize2size returns bytes, not bits }
  11772. 8 * (
  11773. tcgsize2size[reg_cgsize(taicpu(p).oper[1]^.reg)] -
  11774. tcgsize2size[reg_cgsize(taicpu(p).oper[0]^.reg)]
  11775. )
  11776. ) then
  11777. begin
  11778. { For:
  11779. movsx/movzx %reg1,%reg1 (same register, just different sizes)
  11780. shl/sal ##, %reg1
  11781. Remove the movsx/movzx instruction if the shift overwrites the
  11782. extended bits of the register (e.g. movslq %eax,%rax; shlq $32,%rax
  11783. }
  11784. DebugMsg(SPeepholeOptimization + 'MovxShl2Shl',p);
  11785. RemoveCurrentP(p, hp1);
  11786. Result := True;
  11787. Exit;
  11788. end
  11789. else if reg_and_hp1_is_instr and
  11790. (taicpu(p).oper[0]^.typ = top_reg) and
  11791. (
  11792. ((taicpu(hp1).opcode = A_SHR) and (taicpu(p).opcode = A_MOVZX)) or
  11793. ((taicpu(hp1).opcode = A_SAR) and (taicpu(p).opcode <> A_MOVZX))
  11794. ) and
  11795. (taicpu(hp1).oper[0]^.typ = top_const) and
  11796. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11797. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  11798. { Minimum shift value allowed is the bit size of the smallest register - 1 }
  11799. (taicpu(hp1).oper[0]^.val <
  11800. { Multiply by 8 because tcgsize2size returns bytes, not bits }
  11801. 8 * (
  11802. tcgsize2size[reg_cgsize(taicpu(p).oper[0]^.reg)]
  11803. )
  11804. ) then
  11805. begin
  11806. { For:
  11807. movsx %reg1,%reg1 movzx %reg1,%reg1 (same register, just different sizes)
  11808. sar ##, %reg1 shr ##, %reg1
  11809. Move the shift to before the movx instruction if the shift value
  11810. is not too large.
  11811. }
  11812. asml.Remove(hp1);
  11813. asml.InsertBefore(hp1, p);
  11814. taicpu(hp1).oper[1]^.reg := taicpu(p).oper[0]^.reg;
  11815. case taicpu(p).opsize of
  11816. s_BW, S_BL{$ifdef x86_64}, S_BQ{$endif}:
  11817. taicpu(hp1).opsize := S_B;
  11818. S_WL{$ifdef x86_64}, S_WQ{$endif}:
  11819. taicpu(hp1).opsize := S_W;
  11820. {$ifdef x86_64}
  11821. S_LQ:
  11822. taicpu(hp1).opsize := S_L;
  11823. {$endif}
  11824. else
  11825. InternalError(2020112401);
  11826. end;
  11827. if (taicpu(hp1).opcode = A_SHR) then
  11828. DebugMsg(SPeepholeOptimization + 'MovzShr2ShrMovz', hp1)
  11829. else
  11830. DebugMsg(SPeepholeOptimization + 'MovsSar2SarMovs', hp1);
  11831. Result := True;
  11832. end;
  11833. if reg_and_hp1_is_instr and
  11834. (taicpu(p).oper[0]^.typ = top_reg) and
  11835. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11836. (
  11837. (taicpu(hp1).opcode = taicpu(p).opcode)
  11838. or ((taicpu(p).opcode = A_MOVZX) and ((taicpu(hp1).opcode = A_MOVSX){$ifdef x86_64} or (taicpu(hp1).opcode = A_MOVSXD){$endif x86_64}))
  11839. {$ifdef x86_64}
  11840. or ((taicpu(p).opcode = A_MOVSX) and (taicpu(hp1).opcode = A_MOVSXD))
  11841. {$endif x86_64}
  11842. ) then
  11843. begin
  11844. if MatchOpType(taicpu(hp1), top_reg, top_reg) and
  11845. (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[0]^.reg) and
  11846. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then
  11847. begin
  11848. {
  11849. For example:
  11850. movzbw %al,%ax
  11851. movzwl %ax,%eax
  11852. Compress into:
  11853. movzbl %al,%eax
  11854. }
  11855. RegUsed := False;
  11856. case taicpu(p).opsize of
  11857. S_BW:
  11858. case taicpu(hp1).opsize of
  11859. S_WL:
  11860. begin
  11861. taicpu(p).opsize := S_BL;
  11862. RegUsed := True;
  11863. end;
  11864. {$ifdef x86_64}
  11865. S_WQ:
  11866. begin
  11867. if taicpu(p).opcode = A_MOVZX then
  11868. begin
  11869. taicpu(p).opsize := S_BL;
  11870. { 64-bit zero extension is implicit, so change to the 32-bit register }
  11871. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  11872. end
  11873. else
  11874. taicpu(p).opsize := S_BQ;
  11875. RegUsed := True;
  11876. end;
  11877. {$endif x86_64}
  11878. else
  11879. ;
  11880. end;
  11881. {$ifdef x86_64}
  11882. S_BL:
  11883. case taicpu(hp1).opsize of
  11884. S_LQ:
  11885. begin
  11886. if taicpu(p).opcode = A_MOVZX then
  11887. begin
  11888. taicpu(p).opsize := S_BL;
  11889. { 64-bit zero extension is implicit, so change to the 32-bit register }
  11890. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  11891. end
  11892. else
  11893. taicpu(p).opsize := S_BQ;
  11894. RegUsed := True;
  11895. end;
  11896. else
  11897. ;
  11898. end;
  11899. S_WL:
  11900. case taicpu(hp1).opsize of
  11901. S_LQ:
  11902. begin
  11903. if taicpu(p).opcode = A_MOVZX then
  11904. begin
  11905. taicpu(p).opsize := S_WL;
  11906. { 64-bit zero extension is implicit, so change to the 32-bit register }
  11907. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  11908. end
  11909. else
  11910. taicpu(p).opsize := S_WQ;
  11911. RegUsed := True;
  11912. end;
  11913. else
  11914. ;
  11915. end;
  11916. {$endif x86_64}
  11917. else
  11918. ;
  11919. end;
  11920. if RegUsed then
  11921. begin
  11922. DebugMsg(SPeepholeOptimization + 'MovxMovx2Movx', p);
  11923. taicpu(p).oper[1]^.reg := taicpu(hp1).oper[1]^.reg;
  11924. RemoveInstruction(hp1);
  11925. Result := True;
  11926. Exit;
  11927. end;
  11928. end;
  11929. if (taicpu(hp1).opsize = taicpu(p).opsize) and
  11930. not RegInInstruction(taicpu(p).oper[1]^.reg, hp1) and
  11931. GetNextInstruction(hp1, hp2) and
  11932. MatchInstruction(hp2, [A_AND, A_OR, A_XOR, A_TEST], []) and
  11933. (
  11934. ((taicpu(hp2).opsize = S_W) and (taicpu(p).opsize = S_BW)) or
  11935. ((taicpu(hp2).opsize = S_L) and (taicpu(p).opsize in [S_BL, S_WL]))
  11936. {$ifdef x86_64}
  11937. or ((taicpu(hp2).opsize = S_Q) and (taicpu(p).opsize in [S_BL, S_BQ, S_WL, S_WQ, S_LQ]))
  11938. {$endif x86_64}
  11939. ) and
  11940. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  11941. (
  11942. (
  11943. (taicpu(hp2).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) and
  11944. (taicpu(hp2).oper[1]^.reg = taicpu(p).oper[1]^.reg)
  11945. ) or
  11946. (
  11947. { Only allow the operands in reverse order for TEST instructions }
  11948. (taicpu(hp2).opcode = A_TEST) and
  11949. (taicpu(hp2).oper[0]^.reg = taicpu(p).oper[1]^.reg) and
  11950. (taicpu(hp2).oper[1]^.reg = taicpu(hp1).oper[1]^.reg)
  11951. )
  11952. ) then
  11953. begin
  11954. {
  11955. For example:
  11956. movzbl %al,%eax
  11957. movzbl (ref),%edx
  11958. andl %edx,%eax
  11959. (%edx deallocated)
  11960. Change to:
  11961. andb (ref),%al
  11962. movzbl %al,%eax
  11963. Rules are:
  11964. - First two instructions have the same opcode and opsize
  11965. - First instruction's operands are the same super-register
  11966. - Second instruction operates on a different register
  11967. - Third instruction is AND, OR, XOR or TEST
  11968. - Third instruction's operands are the destination registers of the first two instructions
  11969. - Third instruction writes to the destination register of the first instruction (except with TEST)
  11970. - Second instruction's destination register is deallocated afterwards
  11971. }
  11972. TransferUsedRegs(TmpUsedRegs);
  11973. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  11974. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  11975. if not RegUsedAfterInstruction(taicpu(hp1).oper[1]^.reg, hp2, TmpUsedRegs) then
  11976. begin
  11977. case taicpu(p).opsize of
  11978. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  11979. NewSize := S_B;
  11980. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  11981. NewSize := S_W;
  11982. {$ifdef x86_64}
  11983. S_LQ:
  11984. NewSize := S_L;
  11985. {$endif x86_64}
  11986. else
  11987. InternalError(2021120301);
  11988. end;
  11989. taicpu(hp2).loadoper(0, taicpu(hp1).oper[0]^);
  11990. taicpu(hp2).loadreg(1, taicpu(p).oper[0]^.reg);
  11991. taicpu(hp2).opsize := NewSize;
  11992. RemoveInstruction(hp1);
  11993. { With TEST, it's best to keep the MOVX instruction at the top }
  11994. if (taicpu(hp2).opcode <> A_TEST) then
  11995. begin
  11996. DebugMsg(SPeepholeOptimization + 'MovxMovxTest2MovxTest', p);
  11997. asml.Remove(p);
  11998. { If the third instruction uses the flags, the MOVX instruction won't modify then }
  11999. asml.InsertAfter(p, hp2);
  12000. p := hp2;
  12001. end
  12002. else
  12003. DebugMsg(SPeepholeOptimization + 'MovxMovxOp2OpMovx', p);
  12004. Result := True;
  12005. Exit;
  12006. end;
  12007. end;
  12008. end;
  12009. if taicpu(p).opcode=A_MOVZX then
  12010. begin
  12011. { removes superfluous And's after movzx's }
  12012. if reg_and_hp1_is_instr and
  12013. (taicpu(hp1).opcode = A_AND) and
  12014. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12015. ((taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg)
  12016. {$ifdef x86_64}
  12017. { check for implicit extension to 64 bit }
  12018. or
  12019. ((taicpu(p).opsize in [S_BL,S_WL]) and
  12020. (taicpu(hp1).opsize=S_Q) and
  12021. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[1]^.reg)
  12022. )
  12023. {$endif x86_64}
  12024. )
  12025. then
  12026. begin
  12027. case taicpu(p).opsize Of
  12028. S_BL, S_BW{$ifdef x86_64}, S_BQ{$endif x86_64}:
  12029. if (taicpu(hp1).oper[0]^.val = $ff) then
  12030. begin
  12031. DebugMsg(SPeepholeOptimization + 'MovzAnd2Movz1',p);
  12032. RemoveInstruction(hp1);
  12033. Result:=true;
  12034. exit;
  12035. end;
  12036. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  12037. if (taicpu(hp1).oper[0]^.val = $ffff) then
  12038. begin
  12039. DebugMsg(SPeepholeOptimization + 'MovzAnd2Movz2',p);
  12040. RemoveInstruction(hp1);
  12041. Result:=true;
  12042. exit;
  12043. end;
  12044. {$ifdef x86_64}
  12045. S_LQ:
  12046. if (taicpu(hp1).oper[0]^.val = $ffffffff) then
  12047. begin
  12048. DebugMsg(SPeepholeOptimization + 'MovzAnd2Movz3',p);
  12049. RemoveInstruction(hp1);
  12050. Result:=true;
  12051. exit;
  12052. end;
  12053. {$endif x86_64}
  12054. else
  12055. ;
  12056. end;
  12057. { we cannot get rid of the and, but can we get rid of the movz ?}
  12058. if SuperRegistersEqual(taicpu(p).oper[0]^.reg,taicpu(p).oper[1]^.reg) then
  12059. begin
  12060. case taicpu(p).opsize Of
  12061. S_BL, S_BW{$ifdef x86_64}, S_BQ{$endif x86_64}:
  12062. if (taicpu(hp1).oper[0]^.val and $ff)=taicpu(hp1).oper[0]^.val then
  12063. begin
  12064. DebugMsg(SPeepholeOptimization + 'MovzAnd2And1',p);
  12065. RemoveCurrentP(p,hp1);
  12066. Result:=true;
  12067. exit;
  12068. end;
  12069. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  12070. if (taicpu(hp1).oper[0]^.val and $ffff)=taicpu(hp1).oper[0]^.val then
  12071. begin
  12072. DebugMsg(SPeepholeOptimization + 'MovzAnd2And2',p);
  12073. RemoveCurrentP(p,hp1);
  12074. Result:=true;
  12075. exit;
  12076. end;
  12077. {$ifdef x86_64}
  12078. S_LQ:
  12079. if (taicpu(hp1).oper[0]^.val and $ffffffff)=taicpu(hp1).oper[0]^.val then
  12080. begin
  12081. DebugMsg(SPeepholeOptimization + 'MovzAnd2And3',p);
  12082. RemoveCurrentP(p,hp1);
  12083. Result:=true;
  12084. exit;
  12085. end;
  12086. {$endif x86_64}
  12087. else
  12088. ;
  12089. end;
  12090. end;
  12091. end;
  12092. { changes some movzx constructs to faster synonyms (all examples
  12093. are given with eax/ax, but are also valid for other registers)}
  12094. if MatchOpType(taicpu(p),top_reg,top_reg) then
  12095. begin
  12096. case taicpu(p).opsize of
  12097. { Technically, movzbw %al,%ax cannot be encoded in 32/64-bit mode
  12098. (the machine code is equivalent to movzbl %al,%eax), but the
  12099. code generator still generates that assembler instruction and
  12100. it is silently converted. This should probably be checked.
  12101. [Kit] }
  12102. S_BW:
  12103. begin
  12104. if (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) and
  12105. (
  12106. not IsMOVZXAcceptable
  12107. { and $0xff,%ax has a smaller encoding but risks a partial write penalty }
  12108. or (
  12109. (cs_opt_size in current_settings.optimizerswitches) and
  12110. (taicpu(p).oper[1]^.reg = NR_AX)
  12111. )
  12112. ) then
  12113. {Change "movzbw %al, %ax" to "andw $0x0ffh, %ax"}
  12114. begin
  12115. DebugMsg(SPeepholeOptimization + 'var7',p);
  12116. taicpu(p).opcode := A_AND;
  12117. taicpu(p).changeopsize(S_W);
  12118. taicpu(p).loadConst(0,$ff);
  12119. Result := True;
  12120. end
  12121. else if not IsMOVZXAcceptable and
  12122. GetNextInstruction(p, hp1) and
  12123. (tai(hp1).typ = ait_instruction) and
  12124. (taicpu(hp1).opcode = A_AND) and
  12125. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12126. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12127. { Change "movzbw %reg1, %reg2; andw $const, %reg2"
  12128. to "movw %reg1, reg2; andw $(const1 and $ff), %reg2"}
  12129. begin
  12130. DebugMsg(SPeepholeOptimization + 'var8',p);
  12131. taicpu(p).opcode := A_MOV;
  12132. taicpu(p).changeopsize(S_W);
  12133. setsubreg(taicpu(p).oper[0]^.reg,R_SUBW);
  12134. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  12135. Result := True;
  12136. end;
  12137. end;
  12138. {$ifndef i8086} { movzbl %al,%eax cannot be encoded in 16-bit mode (the machine code is equivalent to movzbw %al,%ax }
  12139. S_BL:
  12140. if not IsMOVZXAcceptable then
  12141. begin
  12142. if (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) then
  12143. { Change "movzbl %al, %eax" to "andl $0x0ffh, %eax" }
  12144. begin
  12145. DebugMsg(SPeepholeOptimization + 'var9',p);
  12146. taicpu(p).opcode := A_AND;
  12147. taicpu(p).changeopsize(S_L);
  12148. taicpu(p).loadConst(0,$ff);
  12149. Result := True;
  12150. end
  12151. else if GetNextInstruction(p, hp1) and
  12152. (tai(hp1).typ = ait_instruction) and
  12153. (taicpu(hp1).opcode = A_AND) and
  12154. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12155. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12156. { Change "movzbl %reg1, %reg2; andl $const, %reg2"
  12157. to "movl %reg1, reg2; andl $(const1 and $ff), %reg2"}
  12158. begin
  12159. DebugMsg(SPeepholeOptimization + 'var10',p);
  12160. taicpu(p).opcode := A_MOV;
  12161. taicpu(p).changeopsize(S_L);
  12162. { do not use R_SUBWHOLE
  12163. as movl %rdx,%eax
  12164. is invalid in assembler PM }
  12165. setsubreg(taicpu(p).oper[0]^.reg, R_SUBD);
  12166. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  12167. Result := True;
  12168. end;
  12169. end;
  12170. {$endif i8086}
  12171. S_WL:
  12172. if not IsMOVZXAcceptable then
  12173. begin
  12174. if (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) then
  12175. { Change "movzwl %ax, %eax" to "andl $0x0ffffh, %eax" }
  12176. begin
  12177. DebugMsg(SPeepholeOptimization + 'var11',p);
  12178. taicpu(p).opcode := A_AND;
  12179. taicpu(p).changeopsize(S_L);
  12180. taicpu(p).loadConst(0,$ffff);
  12181. Result := True;
  12182. end
  12183. else if GetNextInstruction(p, hp1) and
  12184. (tai(hp1).typ = ait_instruction) and
  12185. (taicpu(hp1).opcode = A_AND) and
  12186. (taicpu(hp1).oper[0]^.typ = top_const) and
  12187. (taicpu(hp1).oper[1]^.typ = top_reg) and
  12188. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12189. { Change "movzwl %reg1, %reg2; andl $const, %reg2"
  12190. to "movl %reg1, reg2; andl $(const1 and $ffff), %reg2"}
  12191. begin
  12192. DebugMsg(SPeepholeOptimization + 'var12',p);
  12193. taicpu(p).opcode := A_MOV;
  12194. taicpu(p).changeopsize(S_L);
  12195. { do not use R_SUBWHOLE
  12196. as movl %rdx,%eax
  12197. is invalid in assembler PM }
  12198. setsubreg(taicpu(p).oper[0]^.reg, R_SUBD);
  12199. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ffff);
  12200. Result := True;
  12201. end;
  12202. end;
  12203. else
  12204. InternalError(2017050705);
  12205. end;
  12206. end
  12207. else if not IsMOVZXAcceptable and (taicpu(p).oper[0]^.typ = top_ref) then
  12208. begin
  12209. if GetNextInstruction(p, hp1) and
  12210. (tai(hp1).typ = ait_instruction) and
  12211. (taicpu(hp1).opcode = A_AND) and
  12212. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12213. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12214. begin
  12215. //taicpu(p).opcode := A_MOV;
  12216. case taicpu(p).opsize Of
  12217. S_BL:
  12218. begin
  12219. DebugMsg(SPeepholeOptimization + 'var13',p);
  12220. taicpu(hp1).changeopsize(S_L);
  12221. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  12222. end;
  12223. S_WL:
  12224. begin
  12225. DebugMsg(SPeepholeOptimization + 'var14',p);
  12226. taicpu(hp1).changeopsize(S_L);
  12227. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ffff);
  12228. end;
  12229. S_BW:
  12230. begin
  12231. DebugMsg(SPeepholeOptimization + 'var15',p);
  12232. taicpu(hp1).changeopsize(S_W);
  12233. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  12234. end;
  12235. else
  12236. Internalerror(2017050704)
  12237. end;
  12238. Result := True;
  12239. end;
  12240. end;
  12241. end;
  12242. end;
  12243. function TX86AsmOptimizer.OptPass1AND(var p : tai) : boolean;
  12244. var
  12245. hp1, hp2 : tai;
  12246. MaskLength : Cardinal;
  12247. MaskedBits : TCgInt;
  12248. ActiveReg : TRegister;
  12249. begin
  12250. Result:=false;
  12251. { There are no optimisations for reference targets }
  12252. if (taicpu(p).oper[1]^.typ <> top_reg) then
  12253. Exit;
  12254. while GetNextInstruction(p, hp1) and
  12255. (hp1.typ = ait_instruction) do
  12256. begin
  12257. if (taicpu(p).oper[0]^.typ = top_const) then
  12258. begin
  12259. case taicpu(hp1).opcode of
  12260. A_AND:
  12261. if MatchOpType(taicpu(hp1),top_const,top_reg) and
  12262. (getsupreg(taicpu(p).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) and
  12263. { the second register must contain the first one, so compare their subreg types }
  12264. (getsubreg(taicpu(p).oper[1]^.reg)<=getsubreg(taicpu(hp1).oper[1]^.reg)) and
  12265. (abs(taicpu(p).oper[0]^.val and taicpu(hp1).oper[0]^.val)<$80000000) then
  12266. { change
  12267. and const1, reg
  12268. and const2, reg
  12269. to
  12270. and (const1 and const2), reg
  12271. }
  12272. begin
  12273. taicpu(hp1).loadConst(0, taicpu(p).oper[0]^.val and taicpu(hp1).oper[0]^.val);
  12274. DebugMsg(SPeepholeOptimization + 'AndAnd2And done',hp1);
  12275. RemoveCurrentP(p, hp1);
  12276. Result:=true;
  12277. exit;
  12278. end;
  12279. A_CMP:
  12280. if (PopCnt(DWord(taicpu(p).oper[0]^.val)) = 1) and { Only 1 bit set }
  12281. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^.val) and
  12282. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  12283. { Just check that the condition on the next instruction is compatible }
  12284. GetNextInstruction(hp1, hp2) and
  12285. (hp2.typ = ait_instruction) and
  12286. (taicpu(hp2).condition in [C_Z, C_E, C_NZ, C_NE])
  12287. then
  12288. { change
  12289. and 2^n, reg
  12290. cmp 2^n, reg
  12291. j(c) / set(c) / cmov(c) (c is equal or not equal)
  12292. to
  12293. and 2^n, reg
  12294. test reg, reg
  12295. j(~c) / set(~c) / cmov(~c)
  12296. }
  12297. begin
  12298. { Keep TEST instruction in, rather than remove it, because
  12299. it may trigger other optimisations such as MovAndTest2Test }
  12300. taicpu(hp1).loadreg(0, taicpu(hp1).oper[1]^.reg);
  12301. taicpu(hp1).opcode := A_TEST;
  12302. DebugMsg(SPeepholeOptimization + 'AND/CMP/J(c) -> AND/J(~c) with power of 2 constant', p);
  12303. taicpu(hp2).condition := inverse_cond(taicpu(hp2).condition);
  12304. Result := True;
  12305. Exit;
  12306. end
  12307. else if ((taicpu(p).oper[0]^.val=$ff) or (taicpu(p).oper[0]^.val=$ffff) or (taicpu(p).oper[0]^.val=$ffffffff)) and
  12308. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12309. (taicpu(p).oper[0]^.val>=taicpu(hp1).oper[0]^.val) and
  12310. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[1]^.reg) then
  12311. { change
  12312. and $ff/$ff/$ffff, reg
  12313. cmp val<=$ff/val<=$ffff/val<=$ffffffff, reg
  12314. dealloc reg
  12315. to
  12316. cmp val<=$ff/val<=$ffff/val<=$ffffffff, resized reg
  12317. }
  12318. begin
  12319. TransferUsedRegs(TmpUsedRegs);
  12320. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  12321. if not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) then
  12322. begin
  12323. DebugMsg(SPeepholeOptimization + 'AND/CMP -> CMP', p);
  12324. case taicpu(p).oper[0]^.val of
  12325. $ff:
  12326. begin
  12327. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBL);
  12328. taicpu(hp1).opsize:=S_B;
  12329. end;
  12330. $ffff:
  12331. begin
  12332. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBW);
  12333. taicpu(hp1).opsize:=S_W;
  12334. end;
  12335. $ffffffff:
  12336. begin
  12337. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  12338. taicpu(hp1).opsize:=S_L;
  12339. end;
  12340. else
  12341. Internalerror(2023030401);
  12342. end;
  12343. RemoveCurrentP(p);
  12344. Result := True;
  12345. Exit;
  12346. end;
  12347. end;
  12348. A_MOVZX:
  12349. if MatchOpType(taicpu(hp1),top_reg,top_reg) and
  12350. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[1]^.reg) and
  12351. (getsupreg(taicpu(hp1).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg)) and
  12352. (
  12353. (
  12354. (taicpu(p).opsize=S_W) and
  12355. (taicpu(hp1).opsize=S_BW)
  12356. ) or
  12357. (
  12358. (taicpu(p).opsize=S_L) and
  12359. (taicpu(hp1).opsize in [S_WL,S_BL{$ifdef x86_64},S_BQ,S_WQ{$endif x86_64}])
  12360. )
  12361. {$ifdef x86_64}
  12362. or
  12363. (
  12364. (taicpu(p).opsize=S_Q) and
  12365. (taicpu(hp1).opsize in [S_BQ,S_WQ,S_BL,S_WL])
  12366. )
  12367. {$endif x86_64}
  12368. ) then
  12369. begin
  12370. if (((taicpu(hp1).opsize) in [S_BW,S_BL{$ifdef x86_64},S_BQ{$endif x86_64}]) and
  12371. ((taicpu(p).oper[0]^.val and $ff)=taicpu(p).oper[0]^.val)
  12372. ) or
  12373. (((taicpu(hp1).opsize) in [S_WL{$ifdef x86_64},S_WQ{$endif x86_64}]) and
  12374. ((taicpu(p).oper[0]^.val and $ffff)=taicpu(p).oper[0]^.val))
  12375. then
  12376. begin
  12377. { Unlike MOVSX, MOVZX doesn't actually have a version that zero-extends a
  12378. 32-bit register to a 64-bit register, or even a version called MOVZXD, so
  12379. code that tests for the presence of AND 0xffffffff followed by MOVZX is
  12380. wasted, and is indictive of a compiler bug if it were triggered. [Kit]
  12381. NOTE: To zero-extend from 32 bits to 64 bits, simply use the standard MOV.
  12382. }
  12383. DebugMsg(SPeepholeOptimization + 'AndMovzToAnd done',p);
  12384. RemoveInstruction(hp1);
  12385. { See if there are other optimisations possible }
  12386. Continue;
  12387. end;
  12388. end;
  12389. A_SHL:
  12390. if MatchOpType(taicpu(hp1),top_const,top_reg) and
  12391. (getsupreg(taicpu(p).oper[1]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg)) then
  12392. begin
  12393. {$ifopt R+}
  12394. {$define RANGE_WAS_ON}
  12395. {$R-}
  12396. {$endif}
  12397. { get length of potential and mask }
  12398. MaskLength:=SizeOf(taicpu(p).oper[0]^.val)*8-BsrQWord(taicpu(p).oper[0]^.val)-1;
  12399. { really a mask? }
  12400. {$ifdef RANGE_WAS_ON}
  12401. {$R+}
  12402. {$endif}
  12403. if (((QWord(1) shl MaskLength)-1)=taicpu(p).oper[0]^.val) and
  12404. { unmasked part shifted out? }
  12405. ((MaskLength+taicpu(hp1).oper[0]^.val)>=topsize2memsize[taicpu(hp1).opsize]) then
  12406. begin
  12407. DebugMsg(SPeepholeOptimization + 'AndShlToShl done',p);
  12408. RemoveCurrentP(p, hp1);
  12409. Result:=true;
  12410. exit;
  12411. end;
  12412. end;
  12413. A_SHR:
  12414. if MatchOpType(taicpu(hp1),top_const,top_reg) and
  12415. (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg) and
  12416. (taicpu(hp1).oper[0]^.val <= 63) then
  12417. begin
  12418. { Does SHR combined with the AND cover all the bits?
  12419. e.g. for "andb $252,%reg; shrb $2,%reg" - the "and" can be removed }
  12420. MaskedBits := taicpu(p).oper[0]^.val or ((TCgInt(1) shl taicpu(hp1).oper[0]^.val) - 1);
  12421. if ((taicpu(p).opsize = S_B) and ((MaskedBits and $FF) = $FF)) or
  12422. ((taicpu(p).opsize = S_W) and ((MaskedBits and $FFFF) = $FFFF)) or
  12423. ((taicpu(p).opsize = S_L) and ((MaskedBits and $FFFFFFFF) = $FFFFFFFF)) then
  12424. begin
  12425. DebugMsg(SPeepholeOptimization + 'AndShrToShr done', p);
  12426. RemoveCurrentP(p, hp1);
  12427. Result := True;
  12428. Exit;
  12429. end;
  12430. end;
  12431. A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  12432. if (taicpu(hp1).oper[0]^.typ = top_reg) and
  12433. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then
  12434. begin
  12435. if SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) and
  12436. (
  12437. (
  12438. (taicpu(hp1).opsize in [S_BW,S_BL{$ifdef x86_64},S_BQ{$endif x86_64}]) and
  12439. ((taicpu(p).oper[0]^.val and $7F) = taicpu(p).oper[0]^.val)
  12440. ) or (
  12441. (taicpu(hp1).opsize in [S_WL{$ifdef x86_64},S_WQ{$endif x86_64}]) and
  12442. ((taicpu(p).oper[0]^.val and $7FFF) = taicpu(p).oper[0]^.val)
  12443. {$ifdef x86_64}
  12444. ) or (
  12445. (taicpu(hp1).opsize = S_LQ) and
  12446. ((taicpu(p).oper[0]^.val and $7fffffff) = taicpu(p).oper[0]^.val)
  12447. {$endif x86_64}
  12448. )
  12449. ) then
  12450. begin
  12451. if (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg){$ifdef x86_64} or (taicpu(hp1).opsize = S_LQ){$endif x86_64} then
  12452. begin
  12453. DebugMsg(SPeepholeOptimization + 'AndMovsxToAnd',p);
  12454. RemoveInstruction(hp1);
  12455. { See if there are other optimisations possible }
  12456. Continue;
  12457. end;
  12458. { The super-registers are the same though.
  12459. Note that this change by itself doesn't improve
  12460. code speed, but it opens up other optimisations. }
  12461. {$ifdef x86_64}
  12462. { Convert 64-bit register to 32-bit }
  12463. case taicpu(hp1).opsize of
  12464. S_BQ:
  12465. begin
  12466. taicpu(hp1).opsize := S_BL;
  12467. taicpu(hp1).oper[1]^.reg := newreg(R_INTREGISTER, getsupreg(taicpu(hp1).oper[1]^.reg), R_SUBD);
  12468. end;
  12469. S_WQ:
  12470. begin
  12471. taicpu(hp1).opsize := S_WL;
  12472. taicpu(hp1).oper[1]^.reg := newreg(R_INTREGISTER, getsupreg(taicpu(hp1).oper[1]^.reg), R_SUBD);
  12473. end
  12474. else
  12475. ;
  12476. end;
  12477. {$endif x86_64}
  12478. DebugMsg(SPeepholeOptimization + 'AndMovsxToAndMovzx', hp1);
  12479. taicpu(hp1).opcode := A_MOVZX;
  12480. { See if there are other optimisations possible }
  12481. Continue;
  12482. end;
  12483. end;
  12484. else
  12485. ;
  12486. end;
  12487. end
  12488. else if MatchOperand(taicpu(p).oper[0]^, taicpu(p).oper[1]^.reg) and
  12489. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  12490. begin
  12491. {$ifdef x86_64}
  12492. if (taicpu(p).opsize = S_Q) then
  12493. begin
  12494. { Never necessary }
  12495. DebugMsg(SPeepholeOptimization + 'Andq2Nop', p);
  12496. RemoveCurrentP(p, hp1);
  12497. Result := True;
  12498. Exit;
  12499. end;
  12500. {$endif x86_64}
  12501. { Forward check to determine necessity of and %reg,%reg }
  12502. TransferUsedRegs(TmpUsedRegs);
  12503. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  12504. { Saves on a bunch of dereferences }
  12505. ActiveReg := taicpu(p).oper[1]^.reg;
  12506. case taicpu(hp1).opcode of
  12507. A_MOV, A_MOVZX, A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  12508. if (
  12509. (taicpu(hp1).oper[0]^.typ <> top_ref) or
  12510. not RegInRef(ActiveReg, taicpu(hp1).oper[0]^.ref^)
  12511. ) and
  12512. (
  12513. (taicpu(hp1).opcode <> A_MOV) or
  12514. (taicpu(hp1).oper[1]^.typ <> top_ref) or
  12515. not RegInRef(ActiveReg, taicpu(hp1).oper[1]^.ref^)
  12516. ) and
  12517. not (
  12518. { If mov %reg,%reg is present, remove that instruction instead in OptPass1MOV }
  12519. (taicpu(hp1).opcode = A_MOV) and
  12520. MatchOperand(taicpu(hp1).oper[0]^, ActiveReg) and
  12521. MatchOperand(taicpu(hp1).oper[1]^, ActiveReg)
  12522. ) and
  12523. (
  12524. (
  12525. (taicpu(hp1).oper[0]^.typ = top_reg) and
  12526. (taicpu(hp1).oper[0]^.reg = ActiveReg) and
  12527. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg)
  12528. ) or
  12529. (
  12530. {$ifdef x86_64}
  12531. (
  12532. { If we read from the register, make sure it's not dependent on the upper 32 bits }
  12533. (taicpu(hp1).oper[0]^.typ <> top_reg) or
  12534. not SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, ActiveReg) or
  12535. (GetSubReg(taicpu(hp1).oper[0]^.reg) <> R_SUBQ)
  12536. ) and
  12537. {$endif x86_64}
  12538. not RegUsedAfterInstruction(ActiveReg, hp1, TmpUsedRegs)
  12539. )
  12540. ) then
  12541. begin
  12542. DebugMsg(SPeepholeOptimization + 'AndMovx2Movx', p);
  12543. RemoveCurrentP(p, hp1);
  12544. Result := True;
  12545. Exit;
  12546. end;
  12547. A_ADD,
  12548. A_AND,
  12549. A_BSF,
  12550. A_BSR,
  12551. A_BTC,
  12552. A_BTR,
  12553. A_BTS,
  12554. A_OR,
  12555. A_SUB,
  12556. A_XOR:
  12557. { Register is written to, so this will clear the upper 32 bits (2-operand instructions) }
  12558. if (
  12559. (taicpu(hp1).oper[0]^.typ <> top_ref) or
  12560. not RegInRef(ActiveReg, taicpu(hp1).oper[0]^.ref^)
  12561. ) and
  12562. MatchOperand(taicpu(hp1).oper[1]^, ActiveReg) then
  12563. begin
  12564. DebugMsg(SPeepholeOptimization + 'AndOp2Op 2', p);
  12565. RemoveCurrentP(p, hp1);
  12566. Result := True;
  12567. Exit;
  12568. end;
  12569. A_CMP,
  12570. A_TEST:
  12571. if (
  12572. (taicpu(hp1).oper[0]^.typ <> top_ref) or
  12573. not RegInRef(ActiveReg, taicpu(hp1).oper[0]^.ref^)
  12574. ) and
  12575. MatchOperand(taicpu(hp1).oper[1]^, ActiveReg) and
  12576. not RegUsedAfterInstruction(ActiveReg, hp1, TmpUsedRegs) then
  12577. begin
  12578. DebugMsg(SPeepholeOptimization + 'AND; CMP/TEST -> CMP/TEST', p);
  12579. RemoveCurrentP(p, hp1);
  12580. Result := True;
  12581. Exit;
  12582. end;
  12583. A_BSWAP,
  12584. A_NEG,
  12585. A_NOT:
  12586. { Register is written to, so this will clear the upper 32 bits (1-operand instructions) }
  12587. if MatchOperand(taicpu(hp1).oper[0]^, ActiveReg) then
  12588. begin
  12589. DebugMsg(SPeepholeOptimization + 'AndOp2Op 1', p);
  12590. RemoveCurrentP(p, hp1);
  12591. Result := True;
  12592. Exit;
  12593. end;
  12594. else
  12595. ;
  12596. end;
  12597. end;
  12598. if (taicpu(hp1).is_jmp) and
  12599. (taicpu(hp1).opcode<>A_JMP) and
  12600. not(RegInUsedRegs(taicpu(p).oper[1]^.reg,UsedRegs)) then
  12601. begin
  12602. { change
  12603. and x, reg
  12604. jxx
  12605. to
  12606. test x, reg
  12607. jxx
  12608. if reg is deallocated before the
  12609. jump, but only if it's a conditional jump (PFV)
  12610. }
  12611. DebugMsg(SPeepholeOptimization + 'AndJcc2TestJcc', p);
  12612. taicpu(p).opcode := A_TEST;
  12613. Exit;
  12614. end;
  12615. Break;
  12616. end;
  12617. { Lone AND tests }
  12618. if (taicpu(p).oper[0]^.typ = top_const) then
  12619. begin
  12620. {
  12621. - Convert and $0xFF,reg to and reg,reg if reg is 8-bit
  12622. - Convert and $0xFFFF,reg to and reg,reg if reg is 16-bit
  12623. - Convert and $0xFFFFFFFF,reg to and reg,reg if reg is 32-bit
  12624. }
  12625. if ((taicpu(p).oper[0]^.val = $FF) and (taicpu(p).opsize = S_B)) or
  12626. ((taicpu(p).oper[0]^.val = $FFFF) and (taicpu(p).opsize = S_W)) or
  12627. ((taicpu(p).oper[0]^.val = $FFFFFFFF) and (taicpu(p).opsize = S_L)) then
  12628. begin
  12629. taicpu(p).loadreg(0, taicpu(p).oper[1]^.reg);
  12630. if taicpu(p).opsize = S_L then
  12631. begin
  12632. Include(OptsToCheck,aoc_MovAnd2Mov_3);
  12633. Result := True;
  12634. end;
  12635. end;
  12636. end;
  12637. { Backward check to determine necessity of and %reg,%reg }
  12638. if (taicpu(p).oper[0]^.typ = top_reg) and
  12639. (taicpu(p).oper[0]^.reg = taicpu(p).oper[1]^.reg) and
  12640. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  12641. GetLastInstruction(p, hp2) and
  12642. RegModifiedByInstruction(taicpu(p).oper[1]^.reg, hp2) and
  12643. { Check size of adjacent instruction to determine if the AND is
  12644. effectively a null operation }
  12645. (
  12646. (taicpu(p).opsize = taicpu(hp2).opsize) or
  12647. { Note: Don't include S_Q }
  12648. ((taicpu(p).opsize = S_L) and (taicpu(hp2).opsize in [S_BL, S_WL])) or
  12649. ((taicpu(p).opsize = S_W) and (taicpu(hp2).opsize in [S_BW, S_BL, S_WL, S_L])) or
  12650. ((taicpu(p).opsize = S_B) and (taicpu(hp2).opsize in [S_BW, S_BL, S_WL, S_W, S_L]))
  12651. ) then
  12652. begin
  12653. DebugMsg(SPeepholeOptimization + 'And2Nop', p);
  12654. { If GetNextInstruction returned False, hp1 will be nil }
  12655. RemoveCurrentP(p, hp1);
  12656. Result := True;
  12657. Exit;
  12658. end;
  12659. end;
  12660. function TX86AsmOptimizer.OptPass2ADD(var p : tai) : boolean;
  12661. var
  12662. hp1, hp2: tai;
  12663. NewRef: TReference;
  12664. Distance: Cardinal;
  12665. TempTracking: TAllUsedRegs;
  12666. { This entire nested function is used in an if-statement below, but we
  12667. want to avoid all the used reg transfers and GetNextInstruction calls
  12668. until we really have to check }
  12669. function MemRegisterNotUsedLater: Boolean; inline;
  12670. var
  12671. hp2: tai;
  12672. begin
  12673. TransferUsedRegs(TmpUsedRegs);
  12674. hp2 := p;
  12675. repeat
  12676. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  12677. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12678. Result := not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs);
  12679. end;
  12680. begin
  12681. Result := False;
  12682. if (taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif}]) and
  12683. (taicpu(p).oper[1]^.typ = top_reg) then
  12684. begin
  12685. Distance := GetNextInstructionUsingRegCount(p, hp1, taicpu(p).oper[1]^.reg);
  12686. if (Distance = 0) or (Distance > 3) { Likely too far to make a meaningful difference } or
  12687. (hp1.typ <> ait_instruction) or
  12688. not
  12689. (
  12690. (cs_opt_level3 in current_settings.optimizerswitches) or
  12691. { GetNextInstructionUsingRegCount just returns the next valid instruction under -O2 and under }
  12692. RegInInstruction(taicpu(p).oper[1]^.reg, hp1)
  12693. ) then
  12694. Exit;
  12695. { Some of the MOV optimisations are much more in-depth. For example, if we have:
  12696. addq $x, %rax
  12697. movq %rax, %rdx
  12698. sarq $63, %rdx
  12699. (%rax still in use)
  12700. ...letting OptPass2ADD run its course (and without -Os) will produce:
  12701. leaq $x(%rax),%rdx
  12702. addq $x, %rax
  12703. sarq $63, %rdx
  12704. ...which is okay since it breaks the dependency chain between
  12705. addq and movq, but if OptPass2MOV is called first:
  12706. addq $x, %rax
  12707. cqto
  12708. ...which is better in all ways, taking only 2 cycles to execute
  12709. and much smaller in code size.
  12710. }
  12711. { The extra register tracking is quite strenuous }
  12712. if (cs_opt_level2 in current_settings.optimizerswitches) and
  12713. MatchInstruction(hp1, A_MOV, []) then
  12714. begin
  12715. { Update the register tracking to the MOV instruction }
  12716. CopyUsedRegs(TempTracking);
  12717. hp2 := p;
  12718. repeat
  12719. UpdateUsedRegs(tai(hp2.Next));
  12720. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12721. { if hp1 <> hp2 after the call, then hp1 got removed, so let
  12722. OptPass2ADD get called again }
  12723. if OptPass2MOV(hp1) and (hp1 <> hp2) then
  12724. begin
  12725. { Reset the tracking to the current instruction }
  12726. RestoreUsedRegs(TempTracking);
  12727. ReleaseUsedRegs(TempTracking);
  12728. Result := True;
  12729. Exit;
  12730. end;
  12731. { Reset the tracking to the current instruction }
  12732. RestoreUsedRegs(TempTracking);
  12733. ReleaseUsedRegs(TempTracking);
  12734. { If OptPass2MOV returned True, we don't need to set Result to
  12735. True if hp1 didn't change because the ADD instruction didn't
  12736. get modified and we'll be evaluating hp1 again when the
  12737. peephole optimizer reaches it }
  12738. end;
  12739. { Change:
  12740. add %reg2,%reg1
  12741. (%reg2 not modified in between)
  12742. mov/s/z #(%reg1),%reg1 (%reg1 superregisters must be the same)
  12743. To:
  12744. mov/s/z #(%reg1,%reg2),%reg1
  12745. }
  12746. if (taicpu(p).oper[0]^.typ = top_reg) and
  12747. MatchInstruction(hp1, [A_MOV, A_MOVZX, A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif}], []) and
  12748. MatchOpType(taicpu(hp1), top_ref, top_reg) and
  12749. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 1) and
  12750. (
  12751. (
  12752. (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  12753. (taicpu(hp1).oper[0]^.ref^.index = NR_NO) and
  12754. { r/esp cannot be an index }
  12755. (taicpu(p).oper[0]^.reg<>NR_STACK_POINTER_REG)
  12756. ) or (
  12757. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  12758. (taicpu(hp1).oper[0]^.ref^.base = NR_NO)
  12759. )
  12760. ) and (
  12761. Reg1WriteOverwritesReg2Entirely(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) or
  12762. (
  12763. { If the super registers ARE equal, then this MOV/S/Z does a partial write }
  12764. not SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) and
  12765. MemRegisterNotUsedLater
  12766. )
  12767. ) then
  12768. begin
  12769. if (
  12770. { Instructions are guaranteed to be adjacent on -O2 and under }
  12771. (cs_opt_level3 in current_settings.optimizerswitches) and
  12772. RegModifiedBetween(taicpu(p).oper[0]^.reg, p, hp1)
  12773. ) then
  12774. begin
  12775. { If the other register is used in between, move the MOV
  12776. instruction to right after the ADD instruction so a
  12777. saving can still be made }
  12778. Asml.Remove(hp1);
  12779. Asml.InsertAfter(hp1, p);
  12780. taicpu(hp1).oper[0]^.ref^.base := taicpu(p).oper[1]^.reg;
  12781. taicpu(hp1).oper[0]^.ref^.index := taicpu(p).oper[0]^.reg;
  12782. DebugMsg(SPeepholeOptimization + 'AddMov2Mov done (instruction moved)', p);
  12783. RemoveCurrentp(p, hp1);
  12784. end
  12785. else
  12786. begin
  12787. AllocRegBetween(taicpu(p).oper[0]^.reg, p, hp1, UsedRegs);
  12788. taicpu(hp1).oper[0]^.ref^.base := taicpu(p).oper[1]^.reg;
  12789. taicpu(hp1).oper[0]^.ref^.index := taicpu(p).oper[0]^.reg;
  12790. DebugMsg(SPeepholeOptimization + 'AddMov2Mov done', p);
  12791. if (cs_opt_level3 in current_settings.optimizerswitches) then
  12792. { hp1 may not be the immediate next instruction under -O3 }
  12793. RemoveCurrentp(p)
  12794. else
  12795. RemoveCurrentp(p, hp1);
  12796. end;
  12797. Result := True;
  12798. Exit;
  12799. end;
  12800. { Change:
  12801. addl/q $x,%reg1
  12802. movl/q %reg1,%reg2
  12803. To:
  12804. leal/q $x(%reg1),%reg2
  12805. addl/q $x,%reg1 (can be removed if %reg1 or the flags are not used afterwards)
  12806. Breaks the dependency chain.
  12807. }
  12808. if (taicpu(p).oper[0]^.typ = top_const) and
  12809. MatchInstruction(hp1, A_MOV, [taicpu(p).opsize]) and
  12810. (taicpu(hp1).oper[1]^.typ = top_reg) and
  12811. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) and
  12812. (
  12813. { Instructions are guaranteed to be adjacent on -O2 and under }
  12814. not (cs_opt_level3 in current_settings.optimizerswitches) or
  12815. not RegUsedBetween(taicpu(hp1).oper[1]^.reg, p, hp1)
  12816. ) then
  12817. begin
  12818. TransferUsedRegs(TmpUsedRegs);
  12819. hp2 := p;
  12820. repeat
  12821. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  12822. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12823. if (
  12824. { Don't do AddMov2LeaAdd under -Os, but do allow AddMov2Lea }
  12825. not (cs_opt_size in current_settings.optimizerswitches) or
  12826. (
  12827. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) and
  12828. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)
  12829. )
  12830. ) then
  12831. begin
  12832. { Change the MOV instruction to a LEA instruction, and update the
  12833. first operand }
  12834. reference_reset(NewRef, 1, []);
  12835. NewRef.base := taicpu(p).oper[1]^.reg;
  12836. NewRef.scalefactor := 1;
  12837. NewRef.offset := asizeint(taicpu(p).oper[0]^.val);
  12838. taicpu(hp1).opcode := A_LEA;
  12839. taicpu(hp1).loadref(0, NewRef);
  12840. if RegUsedAfterInstruction(NewRef.base, hp1, TmpUsedRegs) or
  12841. RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs) then
  12842. begin
  12843. hp2 := tai(hp1.Next); { for the benefit of AllocRegBetween }
  12844. { Move what is now the LEA instruction to before the ADD instruction }
  12845. Asml.Remove(hp1);
  12846. Asml.InsertBefore(hp1, p);
  12847. AllocRegBetween(taicpu(hp1).oper[1]^.reg, hp1, hp2, UsedRegs);
  12848. DebugMsg(SPeepholeOptimization + 'AddMov2LeaAdd', p);
  12849. p := hp1;
  12850. end
  12851. else
  12852. begin
  12853. { Since %reg1 or the flags aren't used afterwards, we can delete p completely }
  12854. DebugMsg(SPeepholeOptimization + 'AddMov2Lea', hp1);
  12855. if (cs_opt_level3 in current_settings.optimizerswitches) then
  12856. { hp1 may not be the immediate next instruction under -O3 }
  12857. RemoveCurrentp(p)
  12858. else
  12859. RemoveCurrentp(p, hp1);
  12860. end;
  12861. Result := True;
  12862. end;
  12863. end;
  12864. end;
  12865. end;
  12866. function TX86AsmOptimizer.OptPass2Lea(var p : tai) : Boolean;
  12867. var
  12868. SubReg: TSubRegister;
  12869. begin
  12870. Result:=false;
  12871. SubReg := getsubreg(taicpu(p).oper[1]^.reg);
  12872. if not (RegInUsedRegs(NR_DEFAULTFLAGS,UsedRegs)) then
  12873. with taicpu(p).oper[0]^.ref^ do
  12874. if (offset = 0) and not Assigned(symbol) and not Assigned(relsymbol) and (index <> NR_NO) then
  12875. begin
  12876. if (scalefactor <= 1) and SuperRegistersEqual(base, taicpu(p).oper[1]^.reg) then
  12877. begin
  12878. taicpu(p).loadreg(0, newreg(R_INTREGISTER, getsupreg(index), SubReg));
  12879. taicpu(p).opcode := A_ADD;
  12880. DebugMsg(SPeepholeOptimization + 'Lea2AddBase done',p);
  12881. Result := True;
  12882. end
  12883. else if SuperRegistersEqual(index, taicpu(p).oper[1]^.reg) then
  12884. begin
  12885. if (base <> NR_NO) then
  12886. begin
  12887. if (scalefactor <= 1) then
  12888. begin
  12889. taicpu(p).loadreg(0, newreg(R_INTREGISTER, getsupreg(base), SubReg));
  12890. taicpu(p).opcode := A_ADD;
  12891. DebugMsg(SPeepholeOptimization + 'Lea2AddIndex done',p);
  12892. Result := True;
  12893. end;
  12894. end
  12895. else
  12896. { Convert lea (%reg,2^x),%reg to shl x,%reg }
  12897. if (scalefactor in [2, 4, 8]) then
  12898. begin
  12899. { BsrByte is, in essence, the base-2 logarithm of the scale factor }
  12900. taicpu(p).loadconst(0, BsrByte(scalefactor));
  12901. taicpu(p).opcode := A_SHL;
  12902. DebugMsg(SPeepholeOptimization + 'Lea2Shl done',p);
  12903. Result := True;
  12904. end;
  12905. end;
  12906. end;
  12907. end;
  12908. function TX86AsmOptimizer.OptPass2SUB(var p: tai): Boolean;
  12909. var
  12910. hp1, hp2: tai;
  12911. NewRef: TReference;
  12912. Distance: Cardinal;
  12913. TempTracking: TAllUsedRegs;
  12914. begin
  12915. Result := False;
  12916. if (taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif}]) and
  12917. MatchOpType(taicpu(p),top_const,top_reg) then
  12918. begin
  12919. Distance := GetNextInstructionUsingRegCount(p, hp1, taicpu(p).oper[1]^.reg);
  12920. if (Distance = 0) or (Distance > 3) { Likely too far to make a meaningful difference } or
  12921. (hp1.typ <> ait_instruction) or
  12922. not
  12923. (
  12924. (cs_opt_level3 in current_settings.optimizerswitches) or
  12925. { GetNextInstructionUsingRegCount just returns the next valid instruction under -O2 and under }
  12926. RegInInstruction(taicpu(p).oper[1]^.reg, hp1)
  12927. ) then
  12928. Exit;
  12929. { Some of the MOV optimisations are much more in-depth. For example, if we have:
  12930. subq $x, %rax
  12931. movq %rax, %rdx
  12932. sarq $63, %rdx
  12933. (%rax still in use)
  12934. ...letting OptPass2SUB run its course (and without -Os) will produce:
  12935. leaq $-x(%rax),%rdx
  12936. movq $x, %rax
  12937. sarq $63, %rdx
  12938. ...which is okay since it breaks the dependency chain between
  12939. subq and movq, but if OptPass2MOV is called first:
  12940. subq $x, %rax
  12941. cqto
  12942. ...which is better in all ways, taking only 2 cycles to execute
  12943. and much smaller in code size.
  12944. }
  12945. { The extra register tracking is quite strenuous }
  12946. if (cs_opt_level2 in current_settings.optimizerswitches) and
  12947. MatchInstruction(hp1, A_MOV, []) then
  12948. begin
  12949. { Update the register tracking to the MOV instruction }
  12950. CopyUsedRegs(TempTracking);
  12951. hp2 := p;
  12952. repeat
  12953. UpdateUsedRegs(tai(hp2.Next));
  12954. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12955. { if hp1 <> hp2 after the call, then hp1 got removed, so let
  12956. OptPass2SUB get called again }
  12957. if OptPass2MOV(hp1) and (hp1 <> hp2) then
  12958. begin
  12959. { Reset the tracking to the current instruction }
  12960. RestoreUsedRegs(TempTracking);
  12961. ReleaseUsedRegs(TempTracking);
  12962. Result := True;
  12963. Exit;
  12964. end;
  12965. { Reset the tracking to the current instruction }
  12966. RestoreUsedRegs(TempTracking);
  12967. ReleaseUsedRegs(TempTracking);
  12968. { If OptPass2MOV returned True, we don't need to set Result to
  12969. True if hp1 didn't change because the SUB instruction didn't
  12970. get modified and we'll be evaluating hp1 again when the
  12971. peephole optimizer reaches it }
  12972. end;
  12973. { Change:
  12974. subl/q $x,%reg1
  12975. movl/q %reg1,%reg2
  12976. To:
  12977. leal/q $-x(%reg1),%reg2
  12978. subl/q $x,%reg1 (can be removed if %reg1 or the flags are not used afterwards)
  12979. Breaks the dependency chain and potentially permits the removal of
  12980. a CMP instruction if one follows.
  12981. }
  12982. if MatchInstruction(hp1, A_MOV, [taicpu(p).opsize]) and
  12983. (taicpu(hp1).oper[1]^.typ = top_reg) and
  12984. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) and
  12985. (
  12986. { Instructions are guaranteed to be adjacent on -O2 and under }
  12987. not (cs_opt_level3 in current_settings.optimizerswitches) or
  12988. not RegUsedBetween(taicpu(hp1).oper[1]^.reg, p, hp1)
  12989. ) then
  12990. begin
  12991. TransferUsedRegs(TmpUsedRegs);
  12992. hp2 := p;
  12993. repeat
  12994. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  12995. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12996. if (
  12997. { Don't do SubMov2LeaSub under -Os, but do allow SubMov2Lea }
  12998. not (cs_opt_size in current_settings.optimizerswitches) or
  12999. (
  13000. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) and
  13001. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)
  13002. )
  13003. ) then
  13004. begin
  13005. { Change the MOV instruction to a LEA instruction, and update the
  13006. first operand }
  13007. reference_reset(NewRef, 1, []);
  13008. NewRef.base := taicpu(p).oper[1]^.reg;
  13009. NewRef.scalefactor := 1;
  13010. NewRef.offset := -taicpu(p).oper[0]^.val;
  13011. taicpu(hp1).opcode := A_LEA;
  13012. taicpu(hp1).loadref(0, NewRef);
  13013. TransferUsedRegs(TmpUsedRegs);
  13014. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  13015. if RegUsedAfterInstruction(NewRef.base, hp1, TmpUsedRegs) or
  13016. RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs) then
  13017. begin
  13018. hp2 := tai(hp1.Next); { for the benefit of AllocRegBetween }
  13019. { Move what is now the LEA instruction to before the SUB instruction }
  13020. Asml.Remove(hp1);
  13021. Asml.InsertBefore(hp1, p);
  13022. AllocRegBetween(taicpu(hp1).oper[1]^.reg, hp1, hp2, UsedRegs);
  13023. DebugMsg(SPeepholeOptimization + 'SubMov2LeaSub', p);
  13024. p := hp1;
  13025. end
  13026. else
  13027. begin
  13028. { Since %reg1 or the flags aren't used afterwards, we can delete p completely }
  13029. DebugMsg(SPeepholeOptimization + 'SubMov2Lea', hp1);
  13030. if (cs_opt_level3 in current_settings.optimizerswitches) then
  13031. { hp1 may not be the immediate next instruction under -O3 }
  13032. RemoveCurrentp(p)
  13033. else
  13034. RemoveCurrentp(p, hp1);
  13035. end;
  13036. Result := True;
  13037. end;
  13038. end;
  13039. end;
  13040. end;
  13041. function TX86AsmOptimizer.SkipSimpleInstructions(var hp1 : tai) : Boolean;
  13042. begin
  13043. { we can skip all instructions not messing with the stack pointer }
  13044. while assigned(hp1) and {MatchInstruction(hp1,[A_LEA,A_MOV,A_MOVQ,A_MOVSQ,A_MOVSX,A_MOVSXD,A_MOVZX,
  13045. A_AND,A_OR,A_XOR,A_ADD,A_SHR,A_SHL,A_IMUL,A_SETcc,A_SAR,A_SUB,A_TEST,A_CMOVcc,
  13046. A_MOVSS,A_MOVSD,A_MOVAPS,A_MOVUPD,A_MOVAPD,A_MOVUPS,
  13047. A_VMOVSS,A_VMOVSD,A_VMOVAPS,A_VMOVUPD,A_VMOVAPD,A_VMOVUPS],[]) and}
  13048. ({(taicpu(hp1).ops=0) or }
  13049. ({(MatchOpType(taicpu(hp1),top_reg,top_reg) or MatchOpType(taicpu(hp1),top_const,top_reg) or
  13050. (MatchOpType(taicpu(hp1),top_ref,top_reg))
  13051. ) and }
  13052. not(RegInInstruction(NR_STACK_POINTER_REG,hp1)) { and not(RegInInstruction(NR_FRAME_POINTER_REG,hp1))}
  13053. )
  13054. ) do
  13055. GetNextInstruction(hp1,hp1);
  13056. Result:=assigned(hp1);
  13057. end;
  13058. function TX86AsmOptimizer.PostPeepholeOptLea(var p : tai) : Boolean;
  13059. var
  13060. hp1, hp2, hp3, hp4, hp5: tai;
  13061. begin
  13062. Result:=false;
  13063. hp5:=nil;
  13064. { replace
  13065. leal(q) x(<stackpointer>),<stackpointer>
  13066. call procname
  13067. leal(q) -x(<stackpointer>),<stackpointer>
  13068. ret
  13069. by
  13070. jmp procname
  13071. but do it only on level 4 because it destroys stack back traces
  13072. }
  13073. if (cs_opt_level4 in current_settings.optimizerswitches) and
  13074. MatchOpType(taicpu(p),top_ref,top_reg) and
  13075. (taicpu(p).oper[0]^.ref^.base=NR_STACK_POINTER_REG) and
  13076. (taicpu(p).oper[0]^.ref^.index=NR_NO) and
  13077. { the -8 or -24 are not required, but bail out early if possible,
  13078. higher values are unlikely }
  13079. ((taicpu(p).oper[0]^.ref^.offset=-8) or
  13080. (taicpu(p).oper[0]^.ref^.offset=-24)) and
  13081. (taicpu(p).oper[0]^.ref^.symbol=nil) and
  13082. (taicpu(p).oper[0]^.ref^.relsymbol=nil) and
  13083. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG) and
  13084. GetNextInstruction(p, hp1) and
  13085. { Take a copy of hp1 }
  13086. SetAndTest(hp1, hp4) and
  13087. { trick to skip label }
  13088. ((hp1.typ=ait_instruction) or GetNextInstruction(hp1, hp1)) and
  13089. SkipSimpleInstructions(hp1) and
  13090. MatchInstruction(hp1,A_CALL,[S_NO]) and
  13091. GetNextInstruction(hp1, hp2) and
  13092. MatchInstruction(hp2,A_LEA,[taicpu(p).opsize]) and
  13093. MatchOpType(taicpu(hp2),top_ref,top_reg) and
  13094. (taicpu(hp2).oper[0]^.ref^.offset=-taicpu(p).oper[0]^.ref^.offset) and
  13095. (taicpu(hp2).oper[0]^.ref^.base=NR_STACK_POINTER_REG) and
  13096. (taicpu(hp2).oper[0]^.ref^.index=NR_NO) and
  13097. (taicpu(hp2).oper[0]^.ref^.symbol=nil) and
  13098. (taicpu(hp2).oper[0]^.ref^.relsymbol=nil) and
  13099. { Segment register will be NR_NO }
  13100. (taicpu(hp2).oper[1]^.reg=NR_STACK_POINTER_REG) and
  13101. GetNextInstruction(hp2, hp3) and
  13102. { trick to skip label }
  13103. ((hp3.typ=ait_instruction) or GetNextInstruction(hp3, hp3)) and
  13104. (MatchInstruction(hp3,A_RET,[S_NO]) or
  13105. (MatchInstruction(hp3,A_VZEROUPPER,[S_NO]) and
  13106. SetAndTest(hp3,hp5) and
  13107. GetNextInstruction(hp3,hp3) and
  13108. MatchInstruction(hp3,A_RET,[S_NO])
  13109. )
  13110. ) and
  13111. (taicpu(hp3).ops=0) then
  13112. begin
  13113. taicpu(hp1).opcode := A_JMP;
  13114. taicpu(hp1).is_jmp := true;
  13115. DebugMsg(SPeepholeOptimization + 'LeaCallLeaRet2Jmp done',p);
  13116. RemoveCurrentP(p, hp4);
  13117. RemoveInstruction(hp2);
  13118. RemoveInstruction(hp3);
  13119. if Assigned(hp5) then
  13120. begin
  13121. AsmL.Remove(hp5);
  13122. ASmL.InsertBefore(hp5,hp1)
  13123. end;
  13124. Result:=true;
  13125. end;
  13126. end;
  13127. function TX86AsmOptimizer.PostPeepholeOptPush(var p : tai) : Boolean;
  13128. {$ifdef x86_64}
  13129. var
  13130. hp1, hp2, hp3, hp4, hp5: tai;
  13131. {$endif x86_64}
  13132. begin
  13133. Result:=false;
  13134. {$ifdef x86_64}
  13135. hp5:=nil;
  13136. { replace
  13137. push %rax
  13138. call procname
  13139. pop %rcx
  13140. ret
  13141. by
  13142. jmp procname
  13143. but do it only on level 4 because it destroys stack back traces
  13144. It depends on the fact, that the sequence push rax/pop rcx is used for stack alignment as rcx is volatile
  13145. for all supported calling conventions
  13146. }
  13147. if (cs_opt_level4 in current_settings.optimizerswitches) and
  13148. MatchOpType(taicpu(p),top_reg) and
  13149. (taicpu(p).oper[0]^.reg=NR_RAX) and
  13150. GetNextInstruction(p, hp1) and
  13151. { Take a copy of hp1 }
  13152. SetAndTest(hp1, hp4) and
  13153. { trick to skip label }
  13154. ((hp1.typ=ait_instruction) or GetNextInstruction(hp1, hp1)) and
  13155. SkipSimpleInstructions(hp1) and
  13156. MatchInstruction(hp1,A_CALL,[S_NO]) and
  13157. GetNextInstruction(hp1, hp2) and
  13158. MatchInstruction(hp2,A_POP,[taicpu(p).opsize]) and
  13159. MatchOpType(taicpu(hp2),top_reg) and
  13160. (taicpu(hp2).oper[0]^.reg=NR_RCX) and
  13161. GetNextInstruction(hp2, hp3) and
  13162. { trick to skip label }
  13163. ((hp3.typ=ait_instruction) or GetNextInstruction(hp3, hp3)) and
  13164. (MatchInstruction(hp3,A_RET,[S_NO]) or
  13165. (MatchInstruction(hp3,A_VZEROUPPER,[S_NO]) and
  13166. SetAndTest(hp3,hp5) and
  13167. GetNextInstruction(hp3,hp3) and
  13168. MatchInstruction(hp3,A_RET,[S_NO])
  13169. )
  13170. ) and
  13171. (taicpu(hp3).ops=0) then
  13172. begin
  13173. taicpu(hp1).opcode := A_JMP;
  13174. taicpu(hp1).is_jmp := true;
  13175. DebugMsg(SPeepholeOptimization + 'PushCallPushRet2Jmp done',p);
  13176. RemoveCurrentP(p, hp4);
  13177. RemoveInstruction(hp2);
  13178. RemoveInstruction(hp3);
  13179. if Assigned(hp5) then
  13180. begin
  13181. AsmL.Remove(hp5);
  13182. ASmL.InsertBefore(hp5,hp1)
  13183. end;
  13184. Result:=true;
  13185. end;
  13186. {$endif x86_64}
  13187. end;
  13188. function TX86AsmOptimizer.PostPeepholeOptMov(var p : tai) : Boolean;
  13189. var
  13190. Value, RegName: string;
  13191. begin
  13192. Result:=false;
  13193. if (taicpu(p).oper[1]^.typ = top_reg) and (taicpu(p).oper[0]^.typ = top_const) then
  13194. begin
  13195. case taicpu(p).oper[0]^.val of
  13196. 0:
  13197. { Don't make this optimisation if the CPU flags are required, since XOR scrambles them }
  13198. if not (RegInUsedRegs(NR_DEFAULTFLAGS,UsedRegs)) then
  13199. begin
  13200. { change "mov $0,%reg" into "xor %reg,%reg" }
  13201. taicpu(p).opcode := A_XOR;
  13202. taicpu(p).loadReg(0,taicpu(p).oper[1]^.reg);
  13203. Result := True;
  13204. {$ifdef x86_64}
  13205. end
  13206. else if (taicpu(p).opsize = S_Q) then
  13207. begin
  13208. RegName := debug_regname(taicpu(p).oper[1]^.reg); { 64-bit register name }
  13209. { The actual optimization }
  13210. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  13211. taicpu(p).changeopsize(S_L);
  13212. DebugMsg(SPeepholeOptimization + 'movq $0,' + RegName + ' -> movl $0,' + debug_regname(taicpu(p).oper[1]^.reg) + ' (immediate can be represented with just 32 bits)', p);
  13213. Result := True;
  13214. end;
  13215. $1..$FFFFFFFF:
  13216. begin
  13217. { Code size reduction by J. Gareth "Kit" Moreton }
  13218. { change 64-bit register to 32-bit register to reduce code size (upper 32 bits will be set to zero) }
  13219. case taicpu(p).opsize of
  13220. S_Q:
  13221. begin
  13222. RegName := debug_regname(taicpu(p).oper[1]^.reg); { 64-bit register name }
  13223. Value := debug_tostr(taicpu(p).oper[0]^.val);
  13224. { The actual optimization }
  13225. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  13226. taicpu(p).changeopsize(S_L);
  13227. DebugMsg(SPeepholeOptimization + 'movq $' + Value + ',' + RegName + ' -> movl $' + Value + ',' + debug_regname(taicpu(p).oper[1]^.reg) + ' (immediate can be represented with just 32 bits)', p);
  13228. Result := True;
  13229. end;
  13230. else
  13231. { Do nothing };
  13232. end;
  13233. {$endif x86_64}
  13234. end;
  13235. -1:
  13236. { Don't make this optimisation if the CPU flags are required, since OR scrambles them }
  13237. if (cs_opt_size in current_settings.optimizerswitches) and
  13238. (taicpu(p).opsize <> S_B) and
  13239. not (RegInUsedRegs(NR_DEFAULTFLAGS,UsedRegs)) then
  13240. begin
  13241. { change "mov $-1,%reg" into "or $-1,%reg" }
  13242. { NOTES:
  13243. - No size saving is made when changing a Word-sized assignment unless the register is AX (smaller encoding)
  13244. - This operation creates a false dependency on the register, so only do it when optimising for size
  13245. - It is possible to set memory operands using this method, but this creates an even greater false dependency, so don't do this at all
  13246. }
  13247. taicpu(p).opcode := A_OR;
  13248. DebugMsg(SPeepholeOptimization + 'Mov-12Or-1',p);
  13249. Result := True;
  13250. end;
  13251. else
  13252. { Do nothing };
  13253. end;
  13254. end;
  13255. end;
  13256. { Returns true if the given logic instruction can be converted into a BTx instruction (BT not included) }
  13257. class function TX86AsmOptimizer.IsBTXAcceptable(p : tai) : boolean;
  13258. begin
  13259. Result := False;
  13260. if not (CPUX86_HAS_BTX in cpu_capabilities[current_settings.optimizecputype]) then
  13261. Exit;
  13262. { For sizes less than S_L, the byte size is equal or larger with BTx,
  13263. so don't bother optimising }
  13264. if not MatchInstruction(p, A_AND, A_OR, A_XOR, [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  13265. Exit;
  13266. if (taicpu(p).oper[0]^.typ <> top_const) or
  13267. { If the value can fit into an 8-bit signed integer, a smaller
  13268. instruction can be encoded with AND/OR/XOR, so don't optimise if it
  13269. falls within this range }
  13270. (
  13271. (taicpu(p).oper[0]^.val > -128) and
  13272. (taicpu(p).oper[0]^.val <= 127)
  13273. ) then
  13274. Exit;
  13275. { If we're optimising for size, this is acceptable }
  13276. if (cs_opt_size in current_settings.optimizerswitches) then
  13277. Exit(True);
  13278. if (taicpu(p).oper[1]^.typ = top_reg) and
  13279. (CPUX86_HINT_FAST_BTX_REG_IMM in cpu_optimization_hints[current_settings.optimizecputype]) then
  13280. Exit(True);
  13281. if (taicpu(p).oper[1]^.typ <> top_reg) and
  13282. (CPUX86_HINT_FAST_BTX_MEM_IMM in cpu_optimization_hints[current_settings.optimizecputype]) then
  13283. Exit(True);
  13284. end;
  13285. function TX86AsmOptimizer.PostPeepholeOptAnd(var p : tai) : boolean;
  13286. var
  13287. hp1: tai;
  13288. Value: TCGInt;
  13289. begin
  13290. Result := False;
  13291. if MatchOpType(taicpu(p), top_const, top_reg) then
  13292. begin
  13293. { Detect:
  13294. andw x, %ax (0 <= x < $8000)
  13295. ...
  13296. movzwl %ax,%eax
  13297. Change movzwl %ax,%eax to cwtl (shorter encoding for movswl %ax,%eax)
  13298. }
  13299. if (taicpu(p).oper[1]^.reg = NR_AX) and { This is also enough to determine that opsize = S_W }
  13300. ((taicpu(p).oper[0]^.val and $7FFF) = taicpu(p).oper[0]^.val) and
  13301. GetNextInstructionUsingReg(p, hp1, NR_EAX) and
  13302. MatchInstruction(hp1, A_MOVZX, [S_WL]) and
  13303. MatchOperand(taicpu(hp1).oper[0]^, NR_AX) and
  13304. MatchOperand(taicpu(hp1).oper[1]^, NR_EAX) then
  13305. begin
  13306. DebugMsg(SPeepholeOptimization + 'Converted movzwl %ax,%eax to cwtl (via AndMovz2AndCwtl)', hp1);
  13307. taicpu(hp1).opcode := A_CWDE;
  13308. taicpu(hp1).clearop(0);
  13309. taicpu(hp1).clearop(1);
  13310. taicpu(hp1).ops := 0;
  13311. { A change was made, but not with p, so don't set Result, but
  13312. notify the compiler that a change was made }
  13313. Include(OptsToCheck, aoc_ForceNewIteration);
  13314. Exit; { and -> btr won't happen because an opsize of S_W won't be optimised anyway }
  13315. end;
  13316. end;
  13317. { If "not x" is a power of 2 (popcnt = 1), change:
  13318. and $x, %reg/ref
  13319. To:
  13320. btr lb(x), %reg/ref
  13321. }
  13322. if IsBTXAcceptable(p) and
  13323. (
  13324. { Make sure a TEST doesn't follow that plays with the register }
  13325. not GetNextInstruction(p, hp1) or
  13326. not MatchInstruction(hp1, A_TEST, A_CMP, [taicpu(p).opsize]) or
  13327. not MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg)
  13328. ) then
  13329. begin
  13330. {$push}{$R-}{$Q-}
  13331. { Value is a sign-extended 32-bit integer - just correct it
  13332. if it's represented as an unsigned value. Also, IsBTXAcceptable
  13333. checks to see if this operand is an immediate. }
  13334. Value := not taicpu(p).oper[0]^.val;
  13335. {$pop}
  13336. {$ifdef x86_64}
  13337. if taicpu(p).opsize = S_L then
  13338. {$endif x86_64}
  13339. Value := Value and $FFFFFFFF;
  13340. if (PopCnt(QWord(Value)) = 1) then
  13341. begin
  13342. DebugMsg(SPeepholeOptimization + 'Changed AND (not $' + debug_hexstr(taicpu(p).oper[0]^.val) + ') to BTR $' + debug_tostr(BsrQWord(Value)) + ' to shrink instruction size (And2Btr)', p);
  13343. taicpu(p).opcode := A_BTR;
  13344. taicpu(p).oper[0]^.val := BsrQWord(Value); { Essentially the base 2 logarithm }
  13345. Result := True;
  13346. Exit;
  13347. end;
  13348. end;
  13349. end;
  13350. function TX86AsmOptimizer.PostPeepholeOptMOVSX(var p : tai) : boolean;
  13351. begin
  13352. Result := False;
  13353. if not MatchOpType(taicpu(p), top_reg, top_reg) then
  13354. Exit;
  13355. { Convert:
  13356. movswl %ax,%eax -> cwtl
  13357. movslq %eax,%rax -> cdqe
  13358. NOTE: Don't convert movswl %al,%ax to cbw, because cbw and cwde
  13359. refer to the same opcode and depends only on the assembler's
  13360. current operand-size attribute. [Kit]
  13361. }
  13362. with taicpu(p) do
  13363. case opsize of
  13364. S_WL:
  13365. if (oper[0]^.reg = NR_AX) and (oper[1]^.reg = NR_EAX) then
  13366. begin
  13367. DebugMsg(SPeepholeOptimization + 'Converted movswl %ax,%eax to cwtl', p);
  13368. opcode := A_CWDE;
  13369. clearop(0);
  13370. clearop(1);
  13371. ops := 0;
  13372. Result := True;
  13373. end;
  13374. {$ifdef x86_64}
  13375. S_LQ:
  13376. if (oper[0]^.reg = NR_EAX) and (oper[1]^.reg = NR_RAX) then
  13377. begin
  13378. DebugMsg(SPeepholeOptimization + 'Converted movslq %eax,%rax to cltq', p);
  13379. opcode := A_CDQE;
  13380. clearop(0);
  13381. clearop(1);
  13382. ops := 0;
  13383. Result := True;
  13384. end;
  13385. {$endif x86_64}
  13386. else
  13387. ;
  13388. end;
  13389. end;
  13390. function TX86AsmOptimizer.PostPeepholeOptShr(var p : tai) : boolean;
  13391. var
  13392. hp1, hp2: tai;
  13393. IdentityMask, Shift: TCGInt;
  13394. LimitSize: Topsize;
  13395. DoNotMerge: Boolean;
  13396. begin
  13397. Result := False;
  13398. { All these optimisations work on "shr const,%reg" }
  13399. if not MatchOpType(taicpu(p), top_const, top_reg) then
  13400. Exit;
  13401. DoNotMerge := False;
  13402. Shift := taicpu(p).oper[0]^.val;
  13403. LimitSize := taicpu(p).opsize;
  13404. hp1 := p;
  13405. repeat
  13406. if not GetNextInstructionUsingReg(hp1, hp1, taicpu(p).oper[1]^.reg) or (hp1.typ <> ait_instruction) then
  13407. Break;
  13408. { Detect:
  13409. shr x, %reg
  13410. and y, %reg
  13411. If and y, %reg doesn't actually change the value of %reg (e.g. with
  13412. "shrl $24,%reg; andl $255,%reg", remove the AND instruction.
  13413. }
  13414. case taicpu(hp1).opcode of
  13415. A_AND:
  13416. if (taicpu(hp1).opsize = taicpu(p).opsize) and
  13417. MatchOpType(taicpu(hp1), top_const, top_reg) and
  13418. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  13419. begin
  13420. { Make sure the FLAGS register isn't in use }
  13421. TransferUsedRegs(TmpUsedRegs);
  13422. hp2 := p;
  13423. repeat
  13424. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  13425. until not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  13426. if not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs) then
  13427. begin
  13428. { Generate the identity mask }
  13429. case taicpu(p).opsize of
  13430. S_B:
  13431. IdentityMask := $FF shr Shift;
  13432. S_W:
  13433. IdentityMask := $FFFF shr Shift;
  13434. S_L:
  13435. IdentityMask := $FFFFFFFF shr Shift;
  13436. {$ifdef x86_64}
  13437. S_Q:
  13438. { We need to force the operands to be unsigned 64-bit
  13439. integers otherwise the wrong value is generated }
  13440. IdentityMask := TCGInt(QWord($FFFFFFFFFFFFFFFF) shr QWord(Shift));
  13441. {$endif x86_64}
  13442. else
  13443. InternalError(2022081501);
  13444. end;
  13445. if (taicpu(hp1).oper[0]^.val and IdentityMask) = IdentityMask then
  13446. begin
  13447. DebugMsg(SPeepholeOptimization + 'Removed AND instruction since previous SHR makes this an identity operation (ShrAnd2Shr)', hp1);
  13448. { All the possible 1 bits are covered, so we can remove the AND }
  13449. hp2 := tai(hp1.Previous);
  13450. RemoveInstruction(hp1);
  13451. { p wasn't actually changed, so don't set Result to True,
  13452. but a change was nonetheless made elsewhere }
  13453. Include(OptsToCheck, aoc_ForceNewIteration);
  13454. { Do another pass in case other AND or MOVZX instructions
  13455. follow }
  13456. hp1 := hp2;
  13457. Continue;
  13458. end;
  13459. end;
  13460. end;
  13461. A_TEST, A_CMP, A_Jcc:
  13462. { Skip over conditional jumps and relevant comparisons }
  13463. Continue;
  13464. A_MOVZX:
  13465. if MatchOpType(taicpu(hp1), top_reg, top_reg) and
  13466. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(p).oper[1]^.reg) then
  13467. begin
  13468. { Since the original register is being read as is, subsequent
  13469. SHRs must not be merged at this point }
  13470. DoNotMerge := True;
  13471. if IsShrMovZFoldable(taicpu(p).opsize, taicpu(hp1).opsize, Shift) then
  13472. begin
  13473. if SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then
  13474. begin
  13475. DebugMsg(SPeepholeOptimization + 'Removed MOVZX instruction since previous SHR makes it unnecessary (ShrMovz2Shr)', hp1);
  13476. { All the possible 1 bits are covered, so we can remove the AND }
  13477. hp2 := tai(hp1.Previous);
  13478. RemoveInstruction(hp1);
  13479. hp1 := hp2;
  13480. end
  13481. else { Different register target }
  13482. begin
  13483. DebugMsg(SPeepholeOptimization + 'Converted MOVZX instruction to MOV since previous SHR makes zero-extension unnecessary (ShrMovz2ShrMov 2)', hp1);
  13484. taicpu(hp1).opcode := A_MOV;
  13485. setsubreg(taicpu(hp1).oper[0]^.reg, getsubreg(taicpu(hp1).oper[1]^.reg));
  13486. case taicpu(hp1).opsize of
  13487. S_BW:
  13488. taicpu(hp1).opsize := S_W;
  13489. S_BL, S_WL:
  13490. taicpu(hp1).opsize := S_L;
  13491. else
  13492. InternalError(2022081503);
  13493. end;
  13494. end;
  13495. end
  13496. else if (Shift > 0) and
  13497. (taicpu(p).opsize = S_W) and
  13498. (taicpu(hp1).opsize = S_WL) and
  13499. (taicpu(hp1).oper[0]^.reg = NR_AX) and
  13500. (taicpu(hp1).oper[1]^.reg = NR_EAX) then
  13501. begin
  13502. { Detect:
  13503. shr x, %ax (x > 0)
  13504. ...
  13505. movzwl %ax,%eax
  13506. Change movzwl %ax,%eax to cwtl (shorter encoding for movswl %ax,%eax)
  13507. }
  13508. DebugMsg(SPeepholeOptimization + 'Converted movzwl %ax,%eax to cwtl (via ShrMovz2ShrCwtl)', hp1);
  13509. taicpu(hp1).opcode := A_CWDE;
  13510. taicpu(hp1).clearop(0);
  13511. taicpu(hp1).clearop(1);
  13512. taicpu(hp1).ops := 0;
  13513. end;
  13514. { Move onto the next instruction }
  13515. Continue;
  13516. end;
  13517. A_SHL, A_SAL, A_SHR:
  13518. if (taicpu(hp1).opsize <= LimitSize) and
  13519. MatchOpType(taicpu(hp1), top_const, top_reg) and
  13520. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[1]^.reg) then
  13521. begin
  13522. { Make sure the sizes don't exceed the register size limit
  13523. (measured by the shift value falling below the limit) }
  13524. if taicpu(hp1).opsize < LimitSize then
  13525. LimitSize := taicpu(hp1).opsize;
  13526. if taicpu(hp1).opcode = A_SHR then
  13527. Inc(Shift, taicpu(hp1).oper[0]^.val)
  13528. else
  13529. begin
  13530. Dec(Shift, taicpu(hp1).oper[0]^.val);
  13531. DoNotMerge := True;
  13532. end;
  13533. if Shift < topsize2memsize[taicpu(p).opsize] - topsize2memsize[LimitSize] then
  13534. Break;
  13535. { Since we've established that the combined shift is within
  13536. limits, we can actually combine the adjacent SHR
  13537. instructions even if they're different sizes }
  13538. if not DoNotMerge and (taicpu(hp1).opcode = A_SHR) then
  13539. begin
  13540. hp2 := tai(hp1.Previous);
  13541. DebugMsg(SPeepholeOptimization + 'ShrShr2Shr 2', p);
  13542. Inc(taicpu(p).oper[0]^.val, taicpu(hp1).oper[0]^.val);
  13543. RemoveInstruction(hp1);
  13544. hp1 := hp2;
  13545. end;
  13546. { Move onto the next instruction }
  13547. Continue;
  13548. end;
  13549. else
  13550. ;
  13551. end;
  13552. Break;
  13553. until False;
  13554. { Detect the following (looking backwards):
  13555. shr %cl,%reg
  13556. shr x, %reg
  13557. Swap the two SHR instructions to minimise a pipeline stall.
  13558. }
  13559. if GetLastInstruction(p, hp1) and
  13560. MatchInstruction(hp1, A_SHR, [taicpu(p).opsize]) and
  13561. MatchOpType(taicpu(hp1), top_reg, top_reg) and
  13562. { First operand will be %cl }
  13563. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  13564. { Just to be sure }
  13565. (getsupreg(taicpu(hp1).oper[1]^.reg) <> RS_ECX) then
  13566. begin
  13567. DebugMsg(SPeepholeOptimization + 'Swapped variable and constant SHR instructions to minimise pipeline stall (ShrShr2ShrShr)', hp1);
  13568. { Moving the entries this way ensures the register tracking remains correct }
  13569. Asml.Remove(p);
  13570. Asml.InsertBefore(p, hp1);
  13571. p := hp1;
  13572. { Don't set Result to True because the current instruction is now
  13573. "shr %cl,%reg" and there's nothing more we can do with it }
  13574. end;
  13575. end;
  13576. function TX86AsmOptimizer.PostPeepholeOptADDSUB(var p : tai) : boolean;
  13577. var
  13578. hp1, hp2: tai;
  13579. Opposite, SecondOpposite: TAsmOp;
  13580. NewCond: TAsmCond;
  13581. begin
  13582. Result := False;
  13583. { Change:
  13584. add/sub 128,(dest)
  13585. To:
  13586. sub/add -128,(dest)
  13587. This generaally takes fewer bytes to encode because -128 can be stored
  13588. in a signed byte, whereas +128 cannot.
  13589. }
  13590. if (taicpu(p).opsize <> S_B) and MatchOperand(taicpu(p).oper[0]^, 128) then
  13591. begin
  13592. if taicpu(p).opcode = A_ADD then
  13593. Opposite := A_SUB
  13594. else
  13595. Opposite := A_ADD;
  13596. { Be careful if the flags are in use, because the CF flag inverts
  13597. when changing from ADD to SUB and vice versa }
  13598. if RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  13599. GetNextInstruction(p, hp1) then
  13600. begin
  13601. TransferUsedRegs(TmpUsedRegs);
  13602. TmpUsedRegs[R_SPECIALREGISTER].Update(tai(p.Next), True);
  13603. hp2 := hp1;
  13604. { Scan ahead to check if everything's safe }
  13605. while Assigned(hp1) and RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) do
  13606. begin
  13607. if (hp1.typ <> ait_instruction) then
  13608. { Probably unsafe since the flags are still in use }
  13609. Exit;
  13610. if MatchInstruction(hp1, A_CALL, A_JMP, A_RET, []) then
  13611. { Stop searching at an unconditional jump }
  13612. Break;
  13613. if not
  13614. (
  13615. MatchInstruction(hp1, A_ADC, A_SBB, []) and
  13616. (taicpu(hp1).oper[0]^.typ = top_const) { We need to be able to invert a constant }
  13617. ) and
  13618. (taicpu(hp1).condition = C_None) and RegInInstruction(NR_DEFAULTFLAGS, hp1) then
  13619. { Instruction depends on FLAGS (and is not ADC or SBB); break out }
  13620. Exit;
  13621. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  13622. TmpUsedRegs[R_SPECIALREGISTER].Update(tai(hp1.Next), True);
  13623. { Move to the next instruction }
  13624. GetNextInstruction(hp1, hp1);
  13625. end;
  13626. while Assigned(hp2) and (hp2 <> hp1) do
  13627. begin
  13628. NewCond := C_None;
  13629. case taicpu(hp2).condition of
  13630. C_A, C_NBE:
  13631. NewCond := C_BE;
  13632. C_B, C_C, C_NAE:
  13633. NewCond := C_AE;
  13634. C_AE, C_NB, C_NC:
  13635. NewCond := C_B;
  13636. C_BE, C_NA:
  13637. NewCond := C_A;
  13638. else
  13639. { No change needed };
  13640. end;
  13641. if NewCond <> C_None then
  13642. begin
  13643. DebugMsg(SPeepholeOptimization + 'Condition changed from ' + cond2str[taicpu(hp2).condition] + ' to ' + cond2str[NewCond] +
  13644. ' to accommodate ' + debug_op2str(taicpu(p).opcode) + ' -> ' + debug_op2str(opposite) + ' above', hp2);
  13645. taicpu(hp2).condition := NewCond;
  13646. end
  13647. else
  13648. if MatchInstruction(hp2, A_ADC, A_SBB, []) then
  13649. begin
  13650. { Because of the flipping of the carry bit, to ensure
  13651. the operation remains equivalent, ADC becomes SBB
  13652. and vice versa, and the constant is not-inverted.
  13653. If multiple ADCs or SBBs appear in a row, each one
  13654. changed causes the carry bit to invert, so they all
  13655. need to be flipped }
  13656. if taicpu(hp2).opcode = A_ADC then
  13657. SecondOpposite := A_SBB
  13658. else
  13659. SecondOpposite := A_ADC;
  13660. if taicpu(hp2).oper[0]^.typ <> top_const then
  13661. { Should have broken out of this optimisation already }
  13662. InternalError(2021112901);
  13663. DebugMsg(SPeepholeOptimization + debug_op2str(taicpu(hp2).opcode) + debug_opsize2str(taicpu(hp2).opsize) + ' $' + debug_tostr(taicpu(hp2).oper[0]^.val) + ',' + debug_operstr(taicpu(hp2).oper[1]^) + ' -> ' +
  13664. debug_op2str(SecondOpposite) + debug_opsize2str(taicpu(hp2).opsize) + ' $' + debug_tostr(not taicpu(hp2).oper[0]^.val) + ',' + debug_operstr(taicpu(hp2).oper[1]^) + ' to accommodate inverted carry bit', hp2);
  13665. { Bit-invert the constant (effectively equivalent to "-1 - val") }
  13666. taicpu(hp2).opcode := SecondOpposite;
  13667. taicpu(hp2).oper[0]^.val := not taicpu(hp2).oper[0]^.val;
  13668. end;
  13669. { Move to the next instruction }
  13670. GetNextInstruction(hp2, hp2);
  13671. end;
  13672. if (hp2 <> hp1) then
  13673. InternalError(2021111501);
  13674. end;
  13675. DebugMsg(SPeepholeOptimization + debug_op2str(taicpu(p).opcode) + debug_opsize2str(taicpu(p).opsize) + ' $128,' + debug_operstr(taicpu(p).oper[1]^) + ' changed to ' +
  13676. debug_op2str(opposite) + debug_opsize2str(taicpu(p).opsize) + ' $-128,' + debug_operstr(taicpu(p).oper[1]^) + ' to reduce instruction size', p);
  13677. taicpu(p).opcode := Opposite;
  13678. taicpu(p).oper[0]^.val := -128;
  13679. { No further optimisations can be made on this instruction, so move
  13680. onto the next one to save time }
  13681. p := tai(p.Next);
  13682. UpdateUsedRegs(p);
  13683. Result := True;
  13684. Exit;
  13685. end;
  13686. { Detect:
  13687. add/sub %reg2,(dest)
  13688. add/sub x, (dest)
  13689. (dest can be a register or a reference)
  13690. Swap the instructions to minimise a pipeline stall. This reverses the
  13691. "Add swap" and "Sub swap" optimisations done in pass 1 if no new
  13692. optimisations could be made.
  13693. }
  13694. if (taicpu(p).oper[0]^.typ = top_reg) and
  13695. not RegInOp(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^) and
  13696. (
  13697. (
  13698. (taicpu(p).oper[1]^.typ = top_reg) and
  13699. { We can try searching further ahead if we're writing to a register }
  13700. GetNextInstructionUsingReg(p, hp1, taicpu(p).oper[1]^.reg)
  13701. ) or
  13702. (
  13703. (taicpu(p).oper[1]^.typ = top_ref) and
  13704. GetNextInstruction(p, hp1)
  13705. )
  13706. ) and
  13707. MatchInstruction(hp1, A_ADD, A_SUB, [taicpu(p).opsize]) and
  13708. (taicpu(hp1).oper[0]^.typ = top_const) and
  13709. MatchOperand(taicpu(p).oper[1]^, taicpu(hp1).oper[1]^) then
  13710. begin
  13711. { Make doubly sure the flags aren't in use because the order of additions may affect them }
  13712. TransferUsedRegs(TmpUsedRegs);
  13713. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  13714. hp2 := p;
  13715. while not (cs_opt_level3 in current_settings.optimizerswitches) and
  13716. GetNextInstruction(hp2, hp2) and (hp2 <> hp1) do
  13717. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  13718. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  13719. begin
  13720. asml.remove(hp1);
  13721. asml.InsertBefore(hp1, p);
  13722. DebugMsg(SPeepholeOptimization + 'Add/Sub swap 2 done', hp1);
  13723. Result := True;
  13724. end;
  13725. end;
  13726. end;
  13727. function TX86AsmOptimizer.PostPeepholeOptCmp(var p : tai) : Boolean;
  13728. var
  13729. hp1: tai;
  13730. begin
  13731. Result:=false;
  13732. { Final check to see if CMP/MOV pairs can be changed to MOV/CMP }
  13733. while GetNextInstruction(p, hp1) and
  13734. TrySwapMovCmp(p, hp1) do
  13735. begin
  13736. if MatchInstruction(hp1, A_MOV, []) then
  13737. begin
  13738. if RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  13739. begin
  13740. { A little hacky, but since CMP doesn't read the flags, only
  13741. modify them, it's safe if they get scrambled by MOV -> XOR }
  13742. ExcludeRegFromUsedRegs(NR_DEFAULTFLAGS, UsedRegs);
  13743. Result := PostPeepholeOptMov(hp1);
  13744. {$ifdef x86_64}
  13745. if Result and MatchInstruction(hp1, A_XOR, [S_Q]) then
  13746. { Used to shrink instruction size }
  13747. PostPeepholeOptXor(hp1);
  13748. {$endif x86_64}
  13749. IncludeRegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs);
  13750. end
  13751. else
  13752. begin
  13753. Result := PostPeepholeOptMov(hp1);
  13754. {$ifdef x86_64}
  13755. if Result and MatchInstruction(hp1, A_XOR, [S_Q]) then
  13756. { Used to shrink instruction size }
  13757. PostPeepholeOptXor(hp1);
  13758. {$endif x86_64}
  13759. end;
  13760. end;
  13761. { Enabling this flag is actually a null operation, but it marks
  13762. the code as 'modified' during this pass }
  13763. Include(OptsToCheck, aoc_ForceNewIteration);
  13764. end;
  13765. { change "cmp $0, %reg" to "test %reg, %reg" }
  13766. if MatchOpType(taicpu(p),top_const,top_reg) and
  13767. (taicpu(p).oper[0]^.val = 0) then
  13768. begin
  13769. taicpu(p).opcode := A_TEST;
  13770. taicpu(p).loadreg(0,taicpu(p).oper[1]^.reg);
  13771. DebugMsg(SPeepholeOptimization + 'Cmp2Test', p);
  13772. Result:=true;
  13773. end;
  13774. end;
  13775. function TX86AsmOptimizer.PostPeepholeOptTestOr(var p : tai) : Boolean;
  13776. var
  13777. IsTestConstX, IsValid : Boolean;
  13778. hp1,hp2 : tai;
  13779. begin
  13780. Result:=false;
  13781. { Final check to see if TEST/MOV pairs can be changed to MOV/TEST }
  13782. if (taicpu(p).opcode = A_TEST) then
  13783. while GetNextInstruction(p, hp1) and
  13784. TrySwapMovCmp(p, hp1) do
  13785. begin
  13786. if MatchInstruction(hp1, A_MOV, []) then
  13787. begin
  13788. if RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  13789. begin
  13790. { A little hacky, but since TEST doesn't read the flags, only
  13791. modify them, it's safe if they get scrambled by MOV -> XOR }
  13792. ExcludeRegFromUsedRegs(NR_DEFAULTFLAGS, UsedRegs);
  13793. Result := PostPeepholeOptMov(hp1);
  13794. {$ifdef x86_64}
  13795. if Result and MatchInstruction(hp1, A_XOR, [S_Q]) then
  13796. { Used to shrink instruction size }
  13797. PostPeepholeOptXor(hp1);
  13798. {$endif x86_64}
  13799. IncludeRegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs);
  13800. end
  13801. else
  13802. begin
  13803. Result := PostPeepholeOptMov(hp1);
  13804. {$ifdef x86_64}
  13805. if Result and MatchInstruction(hp1, A_XOR, [S_Q]) then
  13806. { Used to shrink instruction size }
  13807. PostPeepholeOptXor(hp1);
  13808. {$endif x86_64}
  13809. end;
  13810. end;
  13811. { Enabling this flag is actually a null operation, but it marks
  13812. the code as 'modified' during this pass }
  13813. Include(OptsToCheck, aoc_ForceNewIteration);
  13814. end;
  13815. { If x is a power of 2 (popcnt = 1), change:
  13816. or $x, %reg/ref
  13817. To:
  13818. bts lb(x), %reg/ref
  13819. }
  13820. if (taicpu(p).opcode = A_OR) and
  13821. IsBTXAcceptable(p) and
  13822. { IsBTXAcceptable checks to see if oper[0] is an immediate }
  13823. (PopCnt(QWord(taicpu(p).oper[0]^.val)) = 1) and
  13824. (
  13825. { Don't optimise if a test instruction follows }
  13826. not GetNextInstruction(p, hp1) or
  13827. not MatchInstruction(hp1, A_TEST, [taicpu(p).opsize])
  13828. ) then
  13829. begin
  13830. DebugMsg(SPeepholeOptimization + 'Changed OR $' + debug_hexstr(taicpu(p).oper[0]^.val) + ' to BTS $' + debug_tostr(BsrQWord(taicpu(p).oper[0]^.val)) + ' to shrink instruction size (Or2Bts)', p);
  13831. taicpu(p).opcode := A_BTS;
  13832. taicpu(p).oper[0]^.val := BsrQWord(taicpu(p).oper[0]^.val); { Essentially the base 2 logarithm }
  13833. Result := True;
  13834. Exit;
  13835. end;
  13836. { If x is a power of 2 (popcnt = 1), change:
  13837. test $x, %reg/ref
  13838. je / sete / cmove (or jne / setne)
  13839. To:
  13840. bt lb(x), %reg/ref
  13841. jnc / setnc / cmovnc (or jc / setc / cmovnc)
  13842. }
  13843. if (taicpu(p).opcode = A_TEST) and
  13844. (CPUX86_HAS_BTX in cpu_capabilities[current_settings.optimizecputype]) and
  13845. (taicpu(p).oper[0]^.typ = top_const) and
  13846. (
  13847. (cs_opt_size in current_settings.optimizerswitches) or
  13848. (
  13849. (taicpu(p).oper[1]^.typ = top_reg) and
  13850. (CPUX86_HINT_FAST_BT_REG_IMM in cpu_optimization_hints[current_settings.optimizecputype])
  13851. ) or
  13852. (
  13853. (taicpu(p).oper[1]^.typ <> top_reg) and
  13854. (CPUX86_HINT_FAST_BT_MEM_IMM in cpu_optimization_hints[current_settings.optimizecputype])
  13855. )
  13856. ) and
  13857. (PopCnt(QWord(taicpu(p).oper[0]^.val)) = 1) and
  13858. { For sizes less than S_L, the byte size is equal or larger with BT,
  13859. so don't bother optimising }
  13860. (taicpu(p).opsize >= S_L) then
  13861. begin
  13862. IsValid := True;
  13863. { Check the next set of instructions, watching the FLAGS register
  13864. and the conditions used }
  13865. TransferUsedRegs(TmpUsedRegs);
  13866. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  13867. hp1 := p;
  13868. hp2 := nil;
  13869. while GetNextInstruction(hp1, hp1) do
  13870. begin
  13871. if not Assigned(hp2) then
  13872. { The first instruction after TEST }
  13873. hp2 := hp1;
  13874. if (hp1.typ <> ait_instruction) then
  13875. begin
  13876. { If the flags are no longer in use, everything is fine }
  13877. if RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  13878. IsValid := False;
  13879. Break;
  13880. end;
  13881. case taicpu(hp1).condition of
  13882. C_None:
  13883. begin
  13884. if RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  13885. { Something is not quite normal, so play safe and don't change }
  13886. IsValid := False;
  13887. Break;
  13888. end;
  13889. C_E, C_Z, C_NE, C_NZ:
  13890. { This is fine };
  13891. else
  13892. begin
  13893. { Unsupported condition }
  13894. IsValid := False;
  13895. Break;
  13896. end;
  13897. end;
  13898. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  13899. end;
  13900. if IsValid then
  13901. begin
  13902. while hp2 <> hp1 do
  13903. begin
  13904. case taicpu(hp2).condition of
  13905. C_Z, C_E:
  13906. taicpu(hp2).condition := C_NC;
  13907. C_NZ, C_NE:
  13908. taicpu(hp2).condition := C_C;
  13909. else
  13910. { Should not get this by this point }
  13911. InternalError(2022110701);
  13912. end;
  13913. GetNextInstruction(hp2, hp2);
  13914. end;
  13915. DebugMsg(SPeepholeOptimization + 'Changed TEST $' + debug_hexstr(taicpu(p).oper[0]^.val) + ' to BT $' + debug_tostr(BsrQWord(taicpu(p).oper[0]^.val)) + ' to shrink instruction size (Test2Bt)', p);
  13916. taicpu(p).opcode := A_BT;
  13917. taicpu(p).oper[0]^.val := BsrQWord(taicpu(p).oper[0]^.val); { Essentially the base 2 logarithm }
  13918. Result := True;
  13919. Exit;
  13920. end;
  13921. end;
  13922. { removes the line marked with (x) from the sequence
  13923. and/or/xor/add/sub/... $x, %y
  13924. test/or %y, %y | test $-1, %y (x)
  13925. j(n)z _Label
  13926. as the first instruction already adjusts the ZF
  13927. %y operand may also be a reference }
  13928. IsTestConstX:=(taicpu(p).opcode=A_TEST) and
  13929. MatchOperand(taicpu(p).oper[0]^,-1);
  13930. if (OpsEqual(taicpu(p).oper[0]^,taicpu(p).oper[1]^) or IsTestConstX) and
  13931. GetLastInstruction(p, hp1) and
  13932. (tai(hp1).typ = ait_instruction) and
  13933. GetNextInstruction(p,hp2) and
  13934. MatchInstruction(hp2,A_SETcc,A_Jcc,A_CMOVcc,[]) then
  13935. case taicpu(hp1).opcode Of
  13936. A_ADD, A_SUB, A_OR, A_XOR, A_AND,
  13937. { These two instructions set the zero flag if the result is zero }
  13938. A_POPCNT, A_LZCNT:
  13939. begin
  13940. if (
  13941. { With POPCNT, an input of zero will set the zero flag
  13942. because the population count of zero is zero }
  13943. (taicpu(hp1).opcode = A_POPCNT) and
  13944. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) and
  13945. (
  13946. OpsEqual(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^) or
  13947. { Faster than going through the second half of the 'or'
  13948. condition below }
  13949. OpsEqual(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^)
  13950. )
  13951. ) or (
  13952. OpsEqual(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^) and
  13953. { does not work in case of overflow for G(E)/L(E)/C_O/C_NO }
  13954. { and in case of carry for A(E)/B(E)/C/NC }
  13955. (
  13956. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) or
  13957. (
  13958. (taicpu(hp1).opcode <> A_ADD) and
  13959. (taicpu(hp1).opcode <> A_SUB) and
  13960. (taicpu(hp1).opcode <> A_LZCNT)
  13961. )
  13962. )
  13963. ) then
  13964. begin
  13965. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (2-op) done', hp1);
  13966. RemoveCurrentP(p, hp2);
  13967. Result:=true;
  13968. Exit;
  13969. end;
  13970. end;
  13971. A_SHL, A_SAL, A_SHR, A_SAR:
  13972. begin
  13973. if OpsEqual(taicpu(hp1).oper[1]^,taicpu(p).oper[1]^) and
  13974. { SHL/SAL/SHR/SAR with a value of 0 do not change the flags }
  13975. { therefore, it's only safe to do this optimization for }
  13976. { shifts by a (nonzero) constant }
  13977. (taicpu(hp1).oper[0]^.typ = top_const) and
  13978. (taicpu(hp1).oper[0]^.val <> 0) and
  13979. { does not work in case of overflow for G(E)/L(E)/C_O/C_NO }
  13980. { and in case of carry for A(E)/B(E)/C/NC }
  13981. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) then
  13982. begin
  13983. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (shift) done', hp1);
  13984. RemoveCurrentP(p, hp2);
  13985. Result:=true;
  13986. Exit;
  13987. end;
  13988. end;
  13989. A_DEC, A_INC, A_NEG:
  13990. begin
  13991. if OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) and
  13992. { does not work in case of overflow for G(E)/L(E)/C_O/C_NO }
  13993. { and in case of carry for A(E)/B(E)/C/NC }
  13994. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) then
  13995. begin
  13996. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (1-op) done', hp1);
  13997. RemoveCurrentP(p, hp2);
  13998. Result:=true;
  13999. Exit;
  14000. end;
  14001. end;
  14002. A_ANDN, A_BZHI:
  14003. begin
  14004. if OpsEqual(taicpu(hp1).oper[2]^,taicpu(p).oper[1]^) and
  14005. { Only the zero and sign flags are consistent with what the result is }
  14006. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE,C_S,C_NS]) then
  14007. begin
  14008. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (ANDN/BZHI) done', hp1);
  14009. RemoveCurrentP(p, hp2);
  14010. Result:=true;
  14011. Exit;
  14012. end;
  14013. end;
  14014. A_BEXTR:
  14015. begin
  14016. if OpsEqual(taicpu(hp1).oper[2]^,taicpu(p).oper[1]^) and
  14017. { Only the zero flag is set }
  14018. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) then
  14019. begin
  14020. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (BEXTR) done', hp1);
  14021. RemoveCurrentP(p, hp2);
  14022. Result:=true;
  14023. Exit;
  14024. end;
  14025. end;
  14026. else
  14027. ;
  14028. end; { case }
  14029. { change "test $-1,%reg" into "test %reg,%reg" }
  14030. if IsTestConstX and (taicpu(p).oper[1]^.typ=top_reg) then
  14031. taicpu(p).loadoper(0,taicpu(p).oper[1]^);
  14032. { Change "or %reg,%reg" to "test %reg,%reg" as OR generates a false dependency }
  14033. if MatchInstruction(p, A_OR, []) and
  14034. { Can only match if they're both registers }
  14035. MatchOperand(taicpu(p).oper[0]^, taicpu(p).oper[1]^) then
  14036. begin
  14037. DebugMsg(SPeepholeOptimization + 'or %reg,%reg -> test %reg,%reg to remove false dependency (Or2Test)', p);
  14038. taicpu(p).opcode := A_TEST;
  14039. { No need to set Result to True, as we've done all the optimisations we can }
  14040. end;
  14041. end;
  14042. function TX86AsmOptimizer.PostPeepholeOptCall(var p : tai) : Boolean;
  14043. var
  14044. hp1,hp3 : tai;
  14045. {$ifndef x86_64}
  14046. hp2 : taicpu;
  14047. {$endif x86_64}
  14048. begin
  14049. Result:=false;
  14050. hp3:=nil;
  14051. {$ifndef x86_64}
  14052. { don't do this on modern CPUs, this really hurts them due to
  14053. broken call/ret pairing }
  14054. if (current_settings.optimizecputype < cpu_Pentium2) and
  14055. not(cs_create_pic in current_settings.moduleswitches) and
  14056. GetNextInstruction(p, hp1) and
  14057. MatchInstruction(hp1,A_JMP,[S_NO]) and
  14058. MatchOpType(taicpu(hp1),top_ref) and
  14059. (taicpu(hp1).oper[0]^.ref^.refaddr=addr_full) then
  14060. begin
  14061. hp2 := taicpu.Op_sym(A_PUSH,S_L,taicpu(hp1).oper[0]^.ref^.symbol);
  14062. taicpu(hp2).fileinfo := taicpu(p).fileinfo;
  14063. InsertLLItem(p.previous, p, hp2);
  14064. taicpu(p).opcode := A_JMP;
  14065. taicpu(p).is_jmp := true;
  14066. RemoveInstruction(hp1);
  14067. Result:=true;
  14068. end
  14069. else
  14070. {$endif x86_64}
  14071. { replace
  14072. call procname
  14073. ret
  14074. by
  14075. jmp procname
  14076. but do it only on level 4 because it destroys stack back traces
  14077. else if the subroutine is marked as no return, remove the ret
  14078. }
  14079. if ((cs_opt_level4 in current_settings.optimizerswitches) or
  14080. (po_noreturn in current_procinfo.procdef.procoptions)) and
  14081. GetNextInstruction(p, hp1) and
  14082. (MatchInstruction(hp1,A_RET,[S_NO]) or
  14083. (MatchInstruction(hp1,A_VZEROUPPER,[S_NO]) and
  14084. SetAndTest(hp1,hp3) and
  14085. GetNextInstruction(hp1,hp1) and
  14086. MatchInstruction(hp1,A_RET,[S_NO])
  14087. )
  14088. ) and
  14089. (taicpu(hp1).ops=0) then
  14090. begin
  14091. if (cs_opt_level4 in current_settings.optimizerswitches) and
  14092. { we might destroy stack alignment here if we do not do a call }
  14093. (target_info.stackalign<=sizeof(SizeUInt)) then
  14094. begin
  14095. taicpu(p).opcode := A_JMP;
  14096. taicpu(p).is_jmp := true;
  14097. DebugMsg(SPeepholeOptimization + 'CallRet2Jmp done',p);
  14098. end
  14099. else
  14100. DebugMsg(SPeepholeOptimization + 'CallRet2Call done',p);
  14101. RemoveInstruction(hp1);
  14102. if Assigned(hp3) then
  14103. begin
  14104. AsmL.Remove(hp3);
  14105. AsmL.InsertBefore(hp3,p)
  14106. end;
  14107. Result:=true;
  14108. end;
  14109. end;
  14110. function TX86AsmOptimizer.PostPeepholeOptMovzx(var p : tai) : Boolean;
  14111. function ConstInRange(const Val: TCGInt; const OpSize: TOpSize): Boolean;
  14112. begin
  14113. case OpSize of
  14114. S_B, S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  14115. Result := (Val <= $FF) and (Val >= -128);
  14116. S_W, S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  14117. Result := (Val <= $FFFF) and (Val >= -32768);
  14118. S_L{$ifdef x86_64}, S_LQ{$endif x86_64}:
  14119. Result := (Val <= $FFFFFFFF) and (Val >= -2147483648);
  14120. else
  14121. Result := True;
  14122. end;
  14123. end;
  14124. var
  14125. hp1, hp2 : tai;
  14126. SizeChange: Boolean;
  14127. PreMessage: string;
  14128. begin
  14129. Result := False;
  14130. if (taicpu(p).oper[0]^.typ = top_reg) and
  14131. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  14132. GetNextInstruction(p, hp1) and (hp1.typ = ait_instruction) then
  14133. begin
  14134. { Change (using movzbl %al,%eax as an example):
  14135. movzbl %al, %eax movzbl %al, %eax
  14136. cmpl x, %eax testl %eax,%eax
  14137. To:
  14138. cmpb x, %al testb %al, %al (Move one back to avoid a false dependency)
  14139. movzbl %al, %eax movzbl %al, %eax
  14140. Smaller instruction and minimises pipeline stall as the CPU
  14141. doesn't have to wait for the register to get zero-extended. [Kit]
  14142. Also allow if the smaller of the two registers is being checked,
  14143. as this still removes the false dependency.
  14144. }
  14145. if
  14146. (
  14147. (
  14148. (taicpu(hp1).opcode = A_CMP) and MatchOpType(taicpu(hp1), top_const, top_reg) and
  14149. ConstInRange(taicpu(hp1).oper[0]^.val, taicpu(p).opsize)
  14150. ) or (
  14151. { If MatchOperand returns True, they must both be registers }
  14152. (taicpu(hp1).opcode = A_TEST) and MatchOperand(taicpu(hp1).oper[0]^, taicpu(hp1).oper[1]^)
  14153. )
  14154. ) and
  14155. (reg2opsize(taicpu(hp1).oper[1]^.reg) <= reg2opsize(taicpu(p).oper[1]^.reg)) and
  14156. SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) then
  14157. begin
  14158. PreMessage := debug_op2str(taicpu(hp1).opcode) + debug_opsize2str(taicpu(hp1).opsize) + ' ' + debug_operstr(taicpu(hp1).oper[0]^) + ',' + debug_regname(taicpu(hp1).oper[1]^.reg) + ' -> ' + debug_op2str(taicpu(hp1).opcode);
  14159. asml.Remove(hp1);
  14160. asml.InsertBefore(hp1, p);
  14161. { Swap instructions in the case of cmp 0,%reg or test %reg,%reg }
  14162. if (taicpu(hp1).opcode = A_TEST) or (taicpu(hp1).oper[0]^.val = 0) then
  14163. begin
  14164. taicpu(hp1).opcode := A_TEST;
  14165. taicpu(hp1).loadreg(0, taicpu(p).oper[0]^.reg);
  14166. end;
  14167. taicpu(hp1).oper[1]^.reg := taicpu(p).oper[0]^.reg;
  14168. case taicpu(p).opsize of
  14169. S_BW, S_BL:
  14170. begin
  14171. SizeChange := taicpu(hp1).opsize <> S_B;
  14172. taicpu(hp1).changeopsize(S_B);
  14173. end;
  14174. S_WL:
  14175. begin
  14176. SizeChange := taicpu(hp1).opsize <> S_W;
  14177. taicpu(hp1).changeopsize(S_W);
  14178. end
  14179. else
  14180. InternalError(2020112701);
  14181. end;
  14182. UpdateUsedRegs(tai(p.Next));
  14183. { Check if the register is used aferwards - if not, we can
  14184. remove the movzx instruction completely }
  14185. if not RegUsedAfterInstruction(taicpu(hp1).oper[1]^.reg, p, UsedRegs) then
  14186. begin
  14187. { Hp1 is a better position than p for debugging purposes }
  14188. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 4a', hp1);
  14189. RemoveCurrentp(p, hp1);
  14190. Result := True;
  14191. end;
  14192. if SizeChange then
  14193. DebugMsg(SPeepholeOptimization + PreMessage +
  14194. debug_opsize2str(taicpu(hp1).opsize) + ' ' + debug_operstr(taicpu(hp1).oper[0]^) + ',' + debug_regname(taicpu(hp1).oper[1]^.reg) + ' (smaller and minimises pipeline stall - MovzxCmp2CmpMovzx)', hp1)
  14195. else
  14196. DebugMsg(SPeepholeOptimization + 'MovzxCmp2CmpMovzx', hp1);
  14197. Exit;
  14198. end;
  14199. { Change (using movzwl %ax,%eax as an example):
  14200. movzwl %ax, %eax
  14201. movb %al, (dest) (Register is smaller than read register in movz)
  14202. To:
  14203. movb %al, (dest) (Move one back to avoid a false dependency)
  14204. movzwl %ax, %eax
  14205. }
  14206. if (taicpu(hp1).opcode = A_MOV) and
  14207. (taicpu(hp1).oper[0]^.typ = top_reg) and
  14208. not RegInOp(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^) and
  14209. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(p).oper[0]^.reg) and
  14210. (reg2opsize(taicpu(hp1).oper[0]^.reg) <= reg2opsize(taicpu(p).oper[0]^.reg)) then
  14211. begin
  14212. DebugMsg(SPeepholeOptimization + 'MovzxMov2MovMovzx', hp1);
  14213. hp2 := tai(hp1.Previous); { Effectively the old position of hp1 }
  14214. asml.Remove(hp1);
  14215. asml.InsertBefore(hp1, p);
  14216. if taicpu(hp1).oper[1]^.typ = top_reg then
  14217. AllocRegBetween(taicpu(hp1).oper[1]^.reg, hp1, hp2, UsedRegs);
  14218. { Check if the register is used aferwards - if not, we can
  14219. remove the movzx instruction completely }
  14220. if not RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg, p, UsedRegs) then
  14221. begin
  14222. { Hp1 is a better position than p for debugging purposes }
  14223. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 4b', hp1);
  14224. RemoveCurrentp(p, hp1);
  14225. Result := True;
  14226. end;
  14227. Exit;
  14228. end;
  14229. end;
  14230. end;
  14231. function TX86AsmOptimizer.PostPeepholeOptXor(var p : tai) : Boolean;
  14232. var
  14233. hp1: tai;
  14234. {$ifdef x86_64}
  14235. PreMessage, RegName: string;
  14236. {$endif x86_64}
  14237. begin
  14238. Result := False;
  14239. { If x is a power of 2 (popcnt = 1), change:
  14240. xor $x, %reg/ref
  14241. To:
  14242. btc lb(x), %reg/ref
  14243. }
  14244. if IsBTXAcceptable(p) and
  14245. { IsBTXAcceptable checks to see if oper[0] is an immediate }
  14246. (PopCnt(QWord(taicpu(p).oper[0]^.val)) = 1) and
  14247. (
  14248. { Don't optimise if a test instruction follows }
  14249. not GetNextInstruction(p, hp1) or
  14250. not MatchInstruction(hp1, A_TEST, [taicpu(p).opsize])
  14251. ) then
  14252. begin
  14253. DebugMsg(SPeepholeOptimization + 'Changed XOR $' + debug_hexstr(taicpu(p).oper[0]^.val) + ' to BTC $' + debug_tostr(BsrQWord(taicpu(p).oper[0]^.val)) + ' to shrink instruction size (Xor2Btc)', p);
  14254. taicpu(p).opcode := A_BTC;
  14255. taicpu(p).oper[0]^.val := BsrQWord(taicpu(p).oper[0]^.val); { Essentially the base 2 logarithm }
  14256. Result := True;
  14257. Exit;
  14258. end;
  14259. {$ifdef x86_64}
  14260. { Code size reduction by J. Gareth "Kit" Moreton }
  14261. { change "xorq %reg,%reg" to "xorl %reg,%reg" for %rax, %rcx, %rdx, %rbx, %rsi, %rdi, %rbp and %rsp,
  14262. as this removes the REX prefix }
  14263. if not OpsEqual(taicpu(p).oper[0]^,taicpu(p).oper[1]^) then
  14264. Exit;
  14265. if taicpu(p).oper[0]^.typ <> top_reg then
  14266. { Should be impossible if both operands were equal, since one of XOR's operands must be a register }
  14267. InternalError(2018011500);
  14268. case taicpu(p).opsize of
  14269. S_Q:
  14270. begin
  14271. RegName := debug_regname(taicpu(p).oper[0]^.reg); { 64-bit register name }
  14272. PreMessage := 'xorq ' + RegName + ',' + RegName + ' -> xorl ';
  14273. { The actual optimization }
  14274. setsubreg(taicpu(p).oper[0]^.reg, R_SUBD);
  14275. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  14276. taicpu(p).changeopsize(S_L);
  14277. RegName := debug_regname(taicpu(p).oper[0]^.reg); { 32-bit register name }
  14278. DebugMsg(SPeepholeOptimization + PreMessage + RegName + ',' + RegName + ' (32-bit register recommended when zeroing 64-bit counterpart)', p);
  14279. end;
  14280. else
  14281. ;
  14282. end;
  14283. {$endif x86_64}
  14284. end;
  14285. function TX86AsmOptimizer.PostPeepholeOptVPXOR(var p : tai) : Boolean;
  14286. var
  14287. XReg: TRegister;
  14288. begin
  14289. Result := False;
  14290. { Turn "vpxor %ymmreg2,%ymmreg2,%ymmreg1" to "vpxor %xmmreg2,%xmmreg2,%xmmreg1"
  14291. Smaller encoding and slightly faster on some platforms (also works for
  14292. ZMM-sized registers) }
  14293. if (taicpu(p).opsize in [S_YMM, S_ZMM]) and
  14294. MatchOpType(taicpu(p), top_reg, top_reg, top_reg) then
  14295. begin
  14296. XReg := taicpu(p).oper[0]^.reg;
  14297. if (taicpu(p).oper[1]^.reg = XReg) then
  14298. begin
  14299. taicpu(p).changeopsize(S_XMM);
  14300. setsubreg(taicpu(p).oper[2]^.reg, R_SUBMMX);
  14301. if (cs_opt_size in current_settings.optimizerswitches) then
  14302. begin
  14303. { Change input registers to %xmm0 to reduce size. Note that
  14304. there's a risk of a false dependency doing this, so only
  14305. optimise for size here }
  14306. XReg := NR_XMM0;
  14307. DebugMsg(SPeepholeOptimization + 'Changed zero-setting vpxor from Y/ZMM to XMM and changed input registers to %xmm0 to reduce size', p);
  14308. end
  14309. else
  14310. begin
  14311. setsubreg(XReg, R_SUBMMX);
  14312. DebugMsg(SPeepholeOptimization + 'Changed zero-setting vpxor from Y/ZMM to XMM to reduce size and increase efficiency', p);
  14313. end;
  14314. taicpu(p).oper[0]^.reg := XReg;
  14315. taicpu(p).oper[1]^.reg := XReg;
  14316. Result := True;
  14317. end;
  14318. end;
  14319. end;
  14320. class procedure TX86AsmOptimizer.OptimizeRefs(var p: taicpu);
  14321. var
  14322. OperIdx: Integer;
  14323. begin
  14324. for OperIdx := 0 to p.ops - 1 do
  14325. if p.oper[OperIdx]^.typ = top_ref then
  14326. optimize_ref(p.oper[OperIdx]^.ref^, False);
  14327. end;
  14328. end.