aoptx86.pas 679 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736147371473814739147401474114742147431474414745147461474714748147491475014751147521475314754147551475614757147581475914760147611476214763147641476514766147671476814769147701477114772147731477414775147761477714778147791478014781147821478314784147851478614787147881478914790147911479214793147941479514796147971479814799148001480114802148031480414805148061480714808148091481014811148121481314814148151481614817148181481914820148211482214823148241482514826148271482814829148301483114832148331483414835148361483714838148391484014841148421484314844148451484614847148481484914850148511485214853148541485514856148571485814859148601486114862148631486414865148661486714868148691487014871148721487314874148751487614877148781487914880148811488214883148841488514886148871488814889148901489114892148931489414895148961489714898148991490014901149021490314904149051490614907149081490914910149111491214913149141491514916149171491814919149201492114922149231492414925149261492714928149291493014931149321493314934149351493614937149381493914940149411494214943149441494514946149471494814949149501495114952149531495414955149561495714958149591496014961149621496314964149651496614967149681496914970149711497214973149741497514976149771497814979149801498114982149831498414985149861498714988149891499014991149921499314994149951499614997149981499915000150011500215003150041500515006150071500815009150101501115012150131501415015150161501715018150191502015021150221502315024150251502615027150281502915030150311503215033150341503515036150371503815039150401504115042150431504415045150461504715048150491505015051150521505315054150551505615057150581505915060150611506215063150641506515066150671506815069150701507115072150731507415075150761507715078150791508015081150821508315084150851508615087150881508915090150911509215093150941509515096150971509815099151001510115102151031510415105151061510715108151091511015111151121511315114151151511615117151181511915120151211512215123151241512515126151271512815129151301513115132151331513415135151361513715138151391514015141151421514315144151451514615147151481514915150151511515215153151541515515156151571515815159151601516115162151631516415165151661516715168151691517015171151721517315174151751517615177151781517915180151811518215183151841518515186151871518815189151901519115192151931519415195151961519715198151991520015201152021520315204152051520615207152081520915210152111521215213152141521515216152171521815219152201522115222152231522415225152261522715228152291523015231152321523315234152351523615237152381523915240152411524215243152441524515246152471524815249152501525115252152531525415255152561525715258152591526015261152621526315264152651526615267152681526915270152711527215273152741527515276152771527815279152801528115282152831528415285152861528715288152891529015291152921529315294152951529615297152981529915300153011530215303153041530515306153071530815309153101531115312153131531415315153161531715318153191532015321153221532315324153251532615327153281532915330153311533215333153341533515336153371533815339153401534115342153431534415345153461534715348153491535015351153521535315354153551535615357153581535915360153611536215363153641536515366153671536815369153701537115372153731537415375153761537715378153791538015381153821538315384153851538615387153881538915390153911539215393153941539515396153971539815399154001540115402154031540415405154061540715408154091541015411154121541315414154151541615417154181541915420154211542215423154241542515426154271542815429154301543115432154331543415435154361543715438154391544015441154421544315444154451544615447154481544915450154511545215453154541545515456154571545815459154601546115462154631546415465154661546715468154691547015471154721547315474154751547615477154781547915480154811548215483154841548515486154871548815489154901549115492154931549415495154961549715498154991550015501155021550315504155051550615507155081550915510155111551215513155141551515516155171551815519155201552115522155231552415525155261552715528155291553015531155321553315534155351553615537155381553915540155411554215543155441554515546155471554815549155501555115552155531555415555155561555715558155591556015561155621556315564155651556615567155681556915570155711557215573155741557515576155771557815579155801558115582155831558415585155861558715588155891559015591155921559315594155951559615597155981559915600156011560215603156041560515606156071560815609156101561115612156131561415615156161561715618156191562015621156221562315624156251562615627156281562915630156311563215633156341563515636156371563815639156401564115642156431564415645156461564715648156491565015651156521565315654156551565615657156581565915660156611566215663156641566515666156671566815669156701567115672156731567415675156761567715678156791568015681156821568315684156851568615687156881568915690156911569215693156941569515696156971569815699157001570115702157031570415705157061570715708157091571015711157121571315714157151571615717157181571915720157211572215723157241572515726157271572815729157301573115732157331573415735157361573715738157391574015741157421574315744157451574615747157481574915750157511575215753157541575515756157571575815759157601576115762157631576415765157661576715768157691577015771157721577315774157751577615777157781577915780157811578215783157841578515786157871578815789157901579115792157931579415795157961579715798157991580015801158021580315804158051580615807158081580915810158111581215813158141581515816
  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. Multiple: TCGInt;
  5141. Adjacent: Boolean;
  5142. begin
  5143. Result:=false;
  5144. { play save and throw an error if LEA uses a seg register prefix,
  5145. this is most likely an error somewhere else }
  5146. if taicpu(p).oper[0]^.ref^.Segment<>NR_NO then
  5147. internalerror(2022022001);
  5148. { changes "lea (%reg1), %reg2" into "mov %reg1, %reg2" }
  5149. if (taicpu(p).oper[0]^.ref^.base <> NR_NO) and
  5150. (taicpu(p).oper[0]^.ref^.index = NR_NO) and
  5151. (
  5152. { do not mess with leas accessing the stack pointer
  5153. unless it's a null operation }
  5154. (taicpu(p).oper[1]^.reg <> NR_STACK_POINTER_REG) or
  5155. (
  5156. (taicpu(p).oper[0]^.ref^.base = NR_STACK_POINTER_REG) and
  5157. (taicpu(p).oper[0]^.ref^.offset = 0)
  5158. )
  5159. ) and
  5160. (not(Assigned(taicpu(p).oper[0]^.ref^.Symbol))) then
  5161. begin
  5162. if (taicpu(p).oper[0]^.ref^.offset = 0) then
  5163. begin
  5164. if (taicpu(p).oper[0]^.ref^.base <> taicpu(p).oper[1]^.reg) then
  5165. begin
  5166. taicpu(p).opcode := A_MOV;
  5167. taicpu(p).loadreg(0, taicpu(p).oper[0]^.ref^.base);
  5168. DebugMsg(SPeepholeOptimization + 'Lea2Mov done',p);
  5169. end
  5170. else
  5171. begin
  5172. DebugMsg(SPeepholeOptimization + 'Lea2Nop done',p);
  5173. RemoveCurrentP(p);
  5174. end;
  5175. Result:=true;
  5176. exit;
  5177. end
  5178. else if (
  5179. { continue to use lea to adjust the stack pointer,
  5180. it is the recommended way, but only if not optimizing for size }
  5181. (taicpu(p).oper[1]^.reg<>NR_STACK_POINTER_REG) or
  5182. (cs_opt_size in current_settings.optimizerswitches)
  5183. ) and
  5184. { If the flags register is in use, don't change the instruction
  5185. to an ADD otherwise this will scramble the flags. [Kit] }
  5186. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  5187. ConvertLEA(taicpu(p)) then
  5188. begin
  5189. Result:=true;
  5190. exit;
  5191. end;
  5192. end;
  5193. { Don't optimise if the stack or frame pointer is the destination register }
  5194. if (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG) or (taicpu(p).oper[1]^.reg=current_procinfo.framepointer) then
  5195. Exit;
  5196. if GetNextInstruction(p,hp1) and
  5197. (hp1.typ=ait_instruction) then
  5198. begin
  5199. if MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) and
  5200. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  5201. MatchOpType(Taicpu(hp1),top_reg,top_reg) then
  5202. begin
  5203. TransferUsedRegs(TmpUsedRegs);
  5204. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5205. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  5206. begin
  5207. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  5208. DebugMsg(SPeepholeOptimization + 'LeaMov2Lea done',p);
  5209. RemoveInstruction(hp1);
  5210. result:=true;
  5211. exit;
  5212. end;
  5213. end;
  5214. { changes
  5215. lea <ref1>, reg1
  5216. <op> ...,<ref. with reg1>,...
  5217. to
  5218. <op> ...,<ref1>,... }
  5219. { find a reference which uses reg1 }
  5220. 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
  5221. ref:=0
  5222. 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
  5223. ref:=1
  5224. else
  5225. ref:=-1;
  5226. if (ref<>-1) and
  5227. { reg1 must be either the base or the index }
  5228. ((taicpu(hp1).oper[ref]^.ref^.base=taicpu(p).oper[1]^.reg) xor (taicpu(hp1).oper[ref]^.ref^.index=taicpu(p).oper[1]^.reg)) then
  5229. begin
  5230. { reg1 can be removed from the reference }
  5231. saveref:=taicpu(hp1).oper[ref]^.ref^;
  5232. if taicpu(hp1).oper[ref]^.ref^.base=taicpu(p).oper[1]^.reg then
  5233. taicpu(hp1).oper[ref]^.ref^.base:=NR_NO
  5234. else if taicpu(hp1).oper[ref]^.ref^.index=taicpu(p).oper[1]^.reg then
  5235. taicpu(hp1).oper[ref]^.ref^.index:=NR_NO
  5236. else
  5237. Internalerror(2019111201);
  5238. { check if the can insert all data of the lea into the second instruction }
  5239. if ((taicpu(hp1).oper[ref]^.ref^.base=taicpu(p).oper[1]^.reg) or (taicpu(hp1).oper[ref]^.ref^.scalefactor <= 1)) and
  5240. ((taicpu(p).oper[0]^.ref^.base=NR_NO) or (taicpu(hp1).oper[ref]^.ref^.base=NR_NO)) and
  5241. ((taicpu(p).oper[0]^.ref^.index=NR_NO) or (taicpu(hp1).oper[ref]^.ref^.index=NR_NO)) and
  5242. ((taicpu(p).oper[0]^.ref^.symbol=nil) or (taicpu(hp1).oper[ref]^.ref^.symbol=nil)) and
  5243. ((taicpu(p).oper[0]^.ref^.relsymbol=nil) or (taicpu(hp1).oper[ref]^.ref^.relsymbol=nil)) and
  5244. ((taicpu(p).oper[0]^.ref^.scalefactor <= 1) or (taicpu(hp1).oper[ref]^.ref^.scalefactor <= 1)) and
  5245. (taicpu(p).oper[0]^.ref^.segment=NR_NO) and (taicpu(hp1).oper[ref]^.ref^.segment=NR_NO)
  5246. {$ifdef x86_64}
  5247. and (abs(taicpu(hp1).oper[ref]^.ref^.offset+taicpu(p).oper[0]^.ref^.offset)<=$7fffffff)
  5248. and (((taicpu(p).oper[0]^.ref^.base<>NR_RIP) and (taicpu(p).oper[0]^.ref^.index<>NR_RIP)) or
  5249. ((taicpu(hp1).oper[ref]^.ref^.base=NR_NO) and (taicpu(hp1).oper[ref]^.ref^.index=NR_NO))
  5250. )
  5251. {$endif x86_64}
  5252. then
  5253. begin
  5254. { reg1 might not used by the second instruction after it is remove from the reference }
  5255. if not(RegInInstruction(taicpu(p).oper[1]^.reg,taicpu(hp1))) then
  5256. begin
  5257. TransferUsedRegs(TmpUsedRegs);
  5258. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5259. { reg1 is not updated so it might not be used afterwards }
  5260. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  5261. begin
  5262. DebugMsg(SPeepholeOptimization + 'LeaOp2Op done',p);
  5263. if taicpu(p).oper[0]^.ref^.base<>NR_NO then
  5264. taicpu(hp1).oper[ref]^.ref^.base:=taicpu(p).oper[0]^.ref^.base;
  5265. if taicpu(p).oper[0]^.ref^.index<>NR_NO then
  5266. taicpu(hp1).oper[ref]^.ref^.index:=taicpu(p).oper[0]^.ref^.index;
  5267. if taicpu(p).oper[0]^.ref^.symbol<>nil then
  5268. taicpu(hp1).oper[ref]^.ref^.symbol:=taicpu(p).oper[0]^.ref^.symbol;
  5269. if taicpu(p).oper[0]^.ref^.relsymbol<>nil then
  5270. taicpu(hp1).oper[ref]^.ref^.relsymbol:=taicpu(p).oper[0]^.ref^.relsymbol;
  5271. if taicpu(p).oper[0]^.ref^.scalefactor > 1 then
  5272. taicpu(hp1).oper[ref]^.ref^.scalefactor:=taicpu(p).oper[0]^.ref^.scalefactor;
  5273. inc(taicpu(hp1).oper[ref]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset);
  5274. RemoveCurrentP(p, hp1);
  5275. result:=true;
  5276. exit;
  5277. end
  5278. end;
  5279. end;
  5280. { recover }
  5281. taicpu(hp1).oper[ref]^.ref^:=saveref;
  5282. end;
  5283. Adjacent := RegInInstruction(taicpu(p).oper[1]^.reg, hp1);
  5284. if Adjacent or
  5285. { Check further ahead (up to 2 instructions ahead for -O2) }
  5286. GetNextInstructionUsingReg(hp1,hp1,taicpu(p).oper[1]^.reg) then
  5287. begin
  5288. { Check common LEA/LEA conditions }
  5289. if MatchInstruction(hp1,A_LEA,[taicpu(p).opsize]) and
  5290. (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg) and
  5291. (taicpu(p).oper[0]^.ref^.relsymbol = nil) and
  5292. (taicpu(p).oper[0]^.ref^.segment = NR_NO) and
  5293. (taicpu(p).oper[0]^.ref^.symbol = nil) and
  5294. (taicpu(hp1).oper[0]^.ref^.relsymbol = nil) and
  5295. (taicpu(hp1).oper[0]^.ref^.segment = NR_NO) and
  5296. (taicpu(hp1).oper[0]^.ref^.symbol = nil) and
  5297. (
  5298. { If p and hp1 are adjacent, RegModifiedBetween always returns False, so avoid
  5299. calling it (since it calls GetNextInstruction) }
  5300. Adjacent or
  5301. (
  5302. (
  5303. (taicpu(p).oper[0]^.ref^.base = NR_NO) or { Don't call RegModifiedBetween unnecessarily }
  5304. not(RegModifiedBetween(taicpu(p).oper[0]^.ref^.base,p,hp1))
  5305. ) and (
  5306. (taicpu(p).oper[0]^.ref^.index = taicpu(p).oper[0]^.ref^.base) or { Don't call RegModifiedBetween unnecessarily }
  5307. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5308. not(RegModifiedBetween(taicpu(p).oper[0]^.ref^.index,p,hp1))
  5309. )
  5310. )
  5311. ) then
  5312. begin
  5313. { changes
  5314. lea (regX,scale), reg1
  5315. lea offset(reg1,reg1), reg1
  5316. to
  5317. lea offset(regX,scale*2), reg1
  5318. and
  5319. lea (regX,scale1), reg1
  5320. lea offset(reg1,scale2), reg1
  5321. to
  5322. lea offset(regX,scale1*scale2), reg1
  5323. ... so long as the final scale does not exceed 8
  5324. (Similarly, allow the first instruction to be "lea (regX,regX),reg1")
  5325. }
  5326. if (taicpu(p).oper[0]^.ref^.base<>NR_STACK_POINTER_REG) and { lea (%rsp,scale),reg is not a valid encoding }
  5327. (taicpu(p).oper[0]^.ref^.offset = 0) and
  5328. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  5329. (
  5330. (
  5331. (taicpu(p).oper[0]^.ref^.base = NR_NO)
  5332. ) or (
  5333. (taicpu(p).oper[0]^.ref^.scalefactor <= 1) and
  5334. (
  5335. (taicpu(p).oper[0]^.ref^.base = taicpu(p).oper[0]^.ref^.index) and
  5336. (
  5337. { RegUsedBetween always returns False if p and hp1 are adjacent }
  5338. Adjacent or
  5339. not(RegUsedBetween(taicpu(p).oper[0]^.ref^.index, p, hp1))
  5340. )
  5341. )
  5342. )
  5343. ) and (
  5344. (
  5345. { lea (reg1,scale2), reg1 variant }
  5346. (taicpu(hp1).oper[0]^.ref^.base = NR_NO) and
  5347. (
  5348. (
  5349. (taicpu(p).oper[0]^.ref^.base = NR_NO) and
  5350. (taicpu(hp1).oper[0]^.ref^.scalefactor * taicpu(p).oper[0]^.ref^.scalefactor <= 8)
  5351. ) or (
  5352. { lea (regX,regX), reg1 variant }
  5353. (taicpu(p).oper[0]^.ref^.base <> NR_NO) and
  5354. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 4)
  5355. )
  5356. )
  5357. ) or (
  5358. { lea (reg1,reg1), reg1 variant }
  5359. (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  5360. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 1)
  5361. )
  5362. ) then
  5363. begin
  5364. DebugMsg(SPeepholeOptimization + 'LeaLea2Lea 2 done',p);
  5365. { Make everything homogeneous to make calculations easier }
  5366. if (taicpu(p).oper[0]^.ref^.base <> NR_NO) then
  5367. begin
  5368. if taicpu(p).oper[0]^.ref^.index <> NR_NO then
  5369. { Convert lea (regX,regX),reg1 to lea (regX,2),reg1 }
  5370. taicpu(p).oper[0]^.ref^.scalefactor := 2
  5371. else
  5372. taicpu(p).oper[0]^.ref^.index := taicpu(p).oper[0]^.ref^.base;
  5373. taicpu(p).oper[0]^.ref^.base := NR_NO;
  5374. end;
  5375. if (taicpu(hp1).oper[0]^.ref^.base = NR_NO) then
  5376. begin
  5377. { Just to prevent miscalculations }
  5378. if (taicpu(hp1).oper[0]^.ref^.scalefactor = 0) then
  5379. taicpu(hp1).oper[0]^.ref^.scalefactor := taicpu(p).oper[0]^.ref^.scalefactor
  5380. else
  5381. taicpu(hp1).oper[0]^.ref^.scalefactor := taicpu(hp1).oper[0]^.ref^.scalefactor * taicpu(p).oper[0]^.ref^.scalefactor;
  5382. end
  5383. else
  5384. begin
  5385. taicpu(hp1).oper[0]^.ref^.base := NR_NO;
  5386. taicpu(hp1).oper[0]^.ref^.scalefactor := taicpu(p).oper[0]^.ref^.scalefactor * 2;
  5387. end;
  5388. taicpu(hp1).oper[0]^.ref^.index := taicpu(p).oper[0]^.ref^.index;
  5389. RemoveCurrentP(p);
  5390. result:=true;
  5391. exit;
  5392. end
  5393. { changes
  5394. lea offset1(regX), reg1
  5395. lea offset2(reg1), reg1
  5396. to
  5397. lea offset1+offset2(regX), reg1 }
  5398. else if
  5399. (
  5400. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  5401. (taicpu(p).oper[0]^.ref^.index = NR_NO)
  5402. ) or (
  5403. (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  5404. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 1) and
  5405. (
  5406. (
  5407. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5408. (taicpu(p).oper[0]^.ref^.base = NR_NO)
  5409. ) or (
  5410. (taicpu(p).oper[0]^.ref^.scalefactor <= 1) and
  5411. (
  5412. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5413. (
  5414. (taicpu(p).oper[0]^.ref^.index = taicpu(p).oper[0]^.ref^.base) and
  5415. (
  5416. (taicpu(hp1).oper[0]^.ref^.index = NR_NO) or
  5417. (taicpu(hp1).oper[0]^.ref^.base = NR_NO)
  5418. )
  5419. )
  5420. )
  5421. )
  5422. )
  5423. ) then
  5424. begin
  5425. DebugMsg(SPeepholeOptimization + 'LeaLea2Lea 1 done',p);
  5426. if taicpu(hp1).oper[0]^.ref^.index=taicpu(p).oper[1]^.reg then
  5427. begin
  5428. taicpu(hp1).oper[0]^.ref^.index:=taicpu(p).oper[0]^.ref^.base;
  5429. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset*max(taicpu(hp1).oper[0]^.ref^.scalefactor,1));
  5430. { if the register is used as index and base, we have to increase for base as well
  5431. and adapt base }
  5432. if taicpu(hp1).oper[0]^.ref^.base=taicpu(p).oper[1]^.reg then
  5433. begin
  5434. taicpu(hp1).oper[0]^.ref^.base:=taicpu(p).oper[0]^.ref^.base;
  5435. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset);
  5436. end;
  5437. end
  5438. else
  5439. begin
  5440. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset);
  5441. taicpu(hp1).oper[0]^.ref^.base:=taicpu(p).oper[0]^.ref^.base;
  5442. end;
  5443. if taicpu(p).oper[0]^.ref^.index<>NR_NO then
  5444. begin
  5445. taicpu(hp1).oper[0]^.ref^.base:=taicpu(hp1).oper[0]^.ref^.index;
  5446. taicpu(hp1).oper[0]^.ref^.index:=taicpu(p).oper[0]^.ref^.index;
  5447. taicpu(hp1).oper[0]^.ref^.scalefactor:=taicpu(p).oper[0]^.ref^.scalefactor;
  5448. end;
  5449. RemoveCurrentP(p);
  5450. result:=true;
  5451. exit;
  5452. end;
  5453. end;
  5454. { Change:
  5455. leal/q $x(%reg1),%reg2
  5456. ...
  5457. shll/q $y,%reg2
  5458. To:
  5459. leal/q $(x+2^y)(%reg1,2^y),%reg2 (if y <= 3)
  5460. }
  5461. if (taicpu(p).oper[0]^.ref^.base<>NR_STACK_POINTER_REG) and { lea (%rsp,scale),reg is not a valid encoding }
  5462. MatchInstruction(hp1, A_SHL, [taicpu(p).opsize]) and
  5463. MatchOpType(taicpu(hp1), top_const, top_reg) and
  5464. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  5465. (taicpu(hp1).oper[0]^.val <= 3) then
  5466. begin
  5467. Multiple := 1 shl taicpu(hp1).oper[0]^.val;
  5468. TransferUsedRegs(TmpUsedRegs);
  5469. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  5470. if
  5471. { This allows the optimisation in some circumstances even if the lea instruction already has a scale factor
  5472. (this works even if scalefactor is zero) }
  5473. ((Multiple * taicpu(p).oper[0]^.ref^.scalefactor) <= 8) and
  5474. { Ensure offset doesn't go out of bounds }
  5475. (abs(taicpu(p).oper[0]^.ref^.offset * Multiple) <= $7FFFFFFF) and
  5476. not (RegInUsedRegs(NR_DEFAULTFLAGS,TmpUsedRegs)) and
  5477. (
  5478. (
  5479. not SuperRegistersEqual(taicpu(p).oper[0]^.ref^.base, taicpu(p).oper[1]^.reg) and
  5480. (
  5481. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5482. (taicpu(p).oper[0]^.ref^.index = NR_INVALID) or
  5483. (
  5484. { Check for lea $x(%reg1,%reg1),%reg2 and treat as it it were lea $x(%reg1,2),%reg2 }
  5485. (taicpu(p).oper[0]^.ref^.index = taicpu(p).oper[0]^.ref^.base) and
  5486. (taicpu(p).oper[0]^.ref^.scalefactor <= 1)
  5487. )
  5488. )
  5489. ) or (
  5490. (
  5491. (taicpu(p).oper[0]^.ref^.base = NR_NO) or
  5492. (taicpu(p).oper[0]^.ref^.base = NR_INVALID)
  5493. ) and
  5494. not SuperRegistersEqual(taicpu(p).oper[0]^.ref^.index, taicpu(p).oper[1]^.reg)
  5495. )
  5496. ) then
  5497. begin
  5498. repeat
  5499. with taicpu(p).oper[0]^.ref^ do
  5500. begin
  5501. { Convert lea $x(%reg1,%reg1),%reg2 to lea $x(%reg1,2),%reg2 }
  5502. if index = base then
  5503. begin
  5504. if Multiple > 4 then
  5505. { Optimisation will no longer work because resultant
  5506. scale factor will exceed 8 }
  5507. Break;
  5508. base := NR_NO;
  5509. scalefactor := 2;
  5510. DebugMsg(SPeepholeOptimization + 'lea $x(%reg1,%reg1),%reg2 -> lea $x(%reg1,2),%reg2 for following optimisation', p);
  5511. end
  5512. else if (base <> NR_NO) and (base <> NR_INVALID) then
  5513. begin
  5514. { Scale factor only works on the index register }
  5515. index := base;
  5516. base := NR_NO;
  5517. end;
  5518. { For safety }
  5519. if scalefactor <= 1 then
  5520. begin
  5521. DebugMsg(SPeepholeOptimization + 'LeaShl2Lea 1', p);
  5522. scalefactor := Multiple;
  5523. end
  5524. else
  5525. begin
  5526. DebugMsg(SPeepholeOptimization + 'LeaShl2Lea 2', p);
  5527. scalefactor := scalefactor * Multiple;
  5528. end;
  5529. offset := offset * Multiple;
  5530. end;
  5531. RemoveInstruction(hp1);
  5532. Result := True;
  5533. Exit;
  5534. { This repeat..until loop exists for the benefit of Break }
  5535. until True;
  5536. end;
  5537. end;
  5538. end;
  5539. end;
  5540. end;
  5541. function TX86AsmOptimizer.DoArithCombineOpt(var p: tai): Boolean;
  5542. var
  5543. hp1 : tai;
  5544. SubInstr: Boolean;
  5545. ThisConst: TCGInt;
  5546. const
  5547. OverflowMin: array[S_B..S_Q] of TCGInt = (-128, -32768, -2147483648, -2147483648);
  5548. { Note: 64-bit-sized arithmetic instructions can only take signed 32-bit immediates }
  5549. OverflowMax: array[S_B..S_Q] of TCGInt = ( 255, 65535, $FFFFFFFF, 2147483647);
  5550. begin
  5551. Result := False;
  5552. if taicpu(p).oper[0]^.typ <> top_const then
  5553. { Should have been confirmed before calling }
  5554. InternalError(2021102601);
  5555. SubInstr := (taicpu(p).opcode = A_SUB);
  5556. if GetLastInstruction(p, hp1) and
  5557. (hp1.typ = ait_instruction) and
  5558. (taicpu(hp1).opsize = taicpu(p).opsize) then
  5559. begin
  5560. if not (taicpu(p).opsize in [S_B, S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  5561. { Bad size }
  5562. InternalError(2022042001);
  5563. case taicpu(hp1).opcode Of
  5564. A_INC:
  5565. if MatchOperand(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  5566. begin
  5567. if SubInstr then
  5568. ThisConst := taicpu(p).oper[0]^.val - 1
  5569. else
  5570. ThisConst := taicpu(p).oper[0]^.val + 1;
  5571. end
  5572. else
  5573. Exit;
  5574. A_DEC:
  5575. if MatchOperand(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  5576. begin
  5577. if SubInstr then
  5578. ThisConst := taicpu(p).oper[0]^.val + 1
  5579. else
  5580. ThisConst := taicpu(p).oper[0]^.val - 1;
  5581. end
  5582. else
  5583. Exit;
  5584. A_SUB:
  5585. if (taicpu(hp1).oper[0]^.typ = top_const) and
  5586. MatchOperand(taicpu(hp1).oper[1]^,taicpu(p).oper[1]^) then
  5587. begin
  5588. if SubInstr then
  5589. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val
  5590. else
  5591. ThisConst := taicpu(p).oper[0]^.val - taicpu(hp1).oper[0]^.val;
  5592. end
  5593. else
  5594. Exit;
  5595. A_ADD:
  5596. if (taicpu(hp1).oper[0]^.typ = top_const) and
  5597. MatchOperand(taicpu(hp1).oper[1]^,taicpu(p).oper[1]^) then
  5598. begin
  5599. if SubInstr then
  5600. ThisConst := taicpu(p).oper[0]^.val - taicpu(hp1).oper[0]^.val
  5601. else
  5602. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val;
  5603. end
  5604. else
  5605. Exit;
  5606. else
  5607. Exit;
  5608. end;
  5609. { Check that the values are in range }
  5610. if (ThisConst < OverflowMin[taicpu(p).opsize]) or (ThisConst > OverflowMax[taicpu(p).opsize]) then
  5611. { Overflow; abort }
  5612. Exit;
  5613. if (ThisConst = 0) then
  5614. begin
  5615. DebugMsg(SPeepholeOptimization + 'Arithmetic combine: ' +
  5616. debug_op2str(taicpu(hp1).opcode) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + debug_operstr(taicpu(hp1).oper[1]^) + '; ' +
  5617. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(taicpu(p).oper[0]^.val) + ',' + debug_operstr(taicpu(p).oper[1]^) + ' cancel out (NOP)', p);
  5618. RemoveInstruction(hp1);
  5619. hp1 := tai(p.next);
  5620. RemoveInstruction(p); { Note, the choice to not use RemoveCurrentp is deliberate }
  5621. if not GetLastInstruction(hp1, p) then
  5622. p := hp1;
  5623. end
  5624. else
  5625. begin
  5626. if taicpu(hp1).opercnt=1 then
  5627. DebugMsg(SPeepholeOptimization + 'Arithmetic combine: ' +
  5628. debug_op2str(taicpu(hp1).opcode) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + '; ' +
  5629. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(taicpu(p).oper[0]^.val) + ',' + debug_operstr(taicpu(p).oper[1]^) + ' -> ' +
  5630. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(ThisConst) + ' ' + debug_operstr(taicpu(p).oper[1]^), p)
  5631. else
  5632. DebugMsg(SPeepholeOptimization + 'Arithmetic combine: ' +
  5633. debug_op2str(taicpu(hp1).opcode) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + debug_operstr(taicpu(hp1).oper[1]^) + '; ' +
  5634. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(taicpu(p).oper[0]^.val) + ',' + debug_operstr(taicpu(p).oper[1]^) + ' -> ' +
  5635. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(ThisConst) + ' ' + debug_operstr(taicpu(p).oper[1]^), p);
  5636. RemoveInstruction(hp1);
  5637. taicpu(p).loadconst(0, ThisConst);
  5638. end;
  5639. Result := True;
  5640. end;
  5641. end;
  5642. function TX86AsmOptimizer.DoMovCmpMemOpt(var p : tai; const hp1: tai; UpdateTmpUsedRegs: Boolean) : Boolean;
  5643. begin
  5644. Result := False;
  5645. if UpdateTmpUsedRegs then
  5646. TransferUsedRegs(TmpUsedRegs);
  5647. if MatchOpType(taicpu(p),top_ref,top_reg) and
  5648. { The x86 assemblers have difficulty comparing values against absolute addresses }
  5649. (taicpu(p).oper[0]^.ref^.refaddr <> addr_full) and
  5650. (taicpu(hp1).oper[0]^.typ <> top_ref) and
  5651. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  5652. (
  5653. (
  5654. (taicpu(hp1).opcode = A_TEST)
  5655. ) or (
  5656. (taicpu(hp1).opcode = A_CMP) and
  5657. { A sanity check more than anything }
  5658. not MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg)
  5659. )
  5660. ) then
  5661. begin
  5662. { change
  5663. mov mem, %reg
  5664. cmp/test x, %reg / test %reg,%reg
  5665. (reg deallocated)
  5666. to
  5667. cmp/test x, mem / cmp 0, mem
  5668. }
  5669. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  5670. if not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) then
  5671. begin
  5672. { Convert test %reg,%reg or test $-1,%reg to cmp $0,mem }
  5673. if (taicpu(hp1).opcode = A_TEST) and
  5674. (
  5675. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) or
  5676. MatchOperand(taicpu(hp1).oper[0]^, -1)
  5677. ) then
  5678. begin
  5679. taicpu(hp1).opcode := A_CMP;
  5680. taicpu(hp1).loadconst(0, 0);
  5681. end;
  5682. taicpu(hp1).loadref(1, taicpu(p).oper[0]^.ref^);
  5683. DebugMsg(SPeepholeOptimization + 'MOV/CMP -> CMP (memory check)', p);
  5684. RemoveCurrentP(p, hp1);
  5685. Result := True;
  5686. Exit;
  5687. end;
  5688. end;
  5689. end;
  5690. function TX86AsmOptimizer.DoSETccLblRETOpt(var p: tai; const hp_label: tai_label) : Boolean;
  5691. var
  5692. hp_allocstart, hp_pos, hp2, hp3, hp4, hp5, hp6: tai;
  5693. ThisReg, SecondReg: TRegister;
  5694. JumpLoc: TAsmLabel;
  5695. NewSize: TOpSize;
  5696. begin
  5697. Result := False;
  5698. {
  5699. Convert:
  5700. j<c> .L1
  5701. .L2:
  5702. mov 1,reg
  5703. jmp .L3 (or ret, although it might not be a RET yet)
  5704. .L1:
  5705. mov 0,reg
  5706. jmp .L3 (or ret)
  5707. ( As long as .L3 <> .L1 or .L2)
  5708. To:
  5709. mov 0,reg
  5710. set<not(c)> reg
  5711. jmp .L3 (or ret)
  5712. .L2:
  5713. mov 1,reg
  5714. jmp .L3 (or ret)
  5715. .L1:
  5716. mov 0,reg
  5717. jmp .L3 (or ret)
  5718. }
  5719. if JumpTargetOp(taicpu(p))^.ref^.refaddr<>addr_full then
  5720. Exit;
  5721. JumpLoc := TAsmLabel(JumpTargetOp(taicpu(p))^.ref^.symbol);
  5722. if GetNextInstruction(hp_label, hp2) and
  5723. MatchInstruction(hp2,A_MOV,[]) and
  5724. (taicpu(hp2).oper[0]^.typ = top_const) and
  5725. (
  5726. (
  5727. (taicpu(hp2).oper[1]^.typ = top_reg)
  5728. {$ifdef i386}
  5729. { Under i386, ESI, EDI, EBP and ESP
  5730. don't have an 8-bit representation }
  5731. and not (getsupreg(taicpu(hp2).oper[1]^.reg) in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  5732. {$endif i386}
  5733. ) or (
  5734. {$ifdef i386}
  5735. (taicpu(hp2).oper[1]^.typ <> top_reg) and
  5736. {$endif i386}
  5737. (taicpu(hp2).opsize = S_B)
  5738. )
  5739. ) and
  5740. GetNextInstruction(hp2, hp3) and
  5741. MatchInstruction(hp3, A_JMP, A_RET, []) and
  5742. (
  5743. (taicpu(hp3).opcode=A_RET) or
  5744. (
  5745. (taicpu(hp3).oper[0]^.ref^.refaddr=addr_full) and
  5746. (tasmlabel(taicpu(hp3).oper[0]^.ref^.symbol)<>tai_label(hp_label).labsym)
  5747. )
  5748. ) and
  5749. GetNextInstruction(hp3, hp4) and
  5750. SkipAligns(hp4, hp4) and
  5751. (hp4.typ=ait_label) and
  5752. (tai_label(hp4).labsym=JumpLoc) and
  5753. (
  5754. not (cs_opt_size in current_settings.optimizerswitches) or
  5755. { If the initial jump is the label's only reference, then it will
  5756. become a dead label if the other conditions are met and hence
  5757. remove at least 2 instructions, including a jump }
  5758. (JumpLoc.getrefs = 1)
  5759. ) and
  5760. { Don't check if hp3 jumps to hp4 because this is a zero-distance jump
  5761. that will be optimised out }
  5762. GetNextInstruction(hp4, hp5) and
  5763. MatchInstruction(hp5,A_MOV,[taicpu(hp2).opsize]) and
  5764. (taicpu(hp5).oper[0]^.typ = top_const) and
  5765. (
  5766. ((taicpu(hp2).oper[0]^.val = 0) and (taicpu(hp5).oper[0]^.val = 1)) or
  5767. ((taicpu(hp2).oper[0]^.val = 1) and (taicpu(hp5).oper[0]^.val = 0))
  5768. ) and
  5769. MatchOperand(taicpu(hp2).oper[1]^,taicpu(hp5).oper[1]^) and
  5770. GetNextInstruction(hp5,hp6) and
  5771. (
  5772. (hp6.typ<>ait_label) or
  5773. SkipLabels(hp6, hp6)
  5774. ) and
  5775. (hp6.typ=ait_instruction) then
  5776. begin
  5777. { First, let's look at the two jumps that are hp3 and hp6 }
  5778. if not
  5779. (
  5780. (taicpu(hp6).opcode=taicpu(hp3).opcode) and { Both RET or both JMP to the same label }
  5781. (
  5782. (taicpu(hp6).opcode=A_RET) or
  5783. MatchOperand(taicpu(hp6).oper[0]^, taicpu(hp3).oper[0]^)
  5784. )
  5785. ) then
  5786. { If condition is False, then the JMP/RET instructions matched conventionally }
  5787. begin
  5788. { See if one of the jumps can be instantly converted into a RET }
  5789. if (taicpu(hp3).opcode=A_JMP) then
  5790. begin
  5791. { Reuse hp5 }
  5792. hp5 := getlabelwithsym(TAsmLabel(JumpTargetOp(taicpu(hp3))^.ref^.symbol));
  5793. { Make sure hp5 doesn't jump back to .L2 (infinite loop) }
  5794. if not Assigned(hp5) or (hp5=hp4) or not GetNextInstruction(hp5, hp5) then
  5795. Exit;
  5796. if MatchInstruction(hp5, A_RET, []) then
  5797. begin
  5798. DebugMsg(SPeepholeOptimization + 'Converted JMP to RET as part of SETcc optimisation (1st jump)', hp3);
  5799. ConvertJumpToRET(hp3, hp5);
  5800. Result := True;
  5801. end
  5802. else
  5803. Exit;
  5804. end;
  5805. if (taicpu(hp6).opcode=A_JMP) then
  5806. begin
  5807. { Reuse hp5 }
  5808. hp5 := getlabelwithsym(TAsmLabel(JumpTargetOp(taicpu(hp6))^.ref^.symbol));
  5809. if not Assigned(hp5) 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 (2nd jump)', hp6);
  5814. ConvertJumpToRET(hp6, hp5);
  5815. Result := True;
  5816. end
  5817. else
  5818. Exit;
  5819. end;
  5820. if not
  5821. (
  5822. (taicpu(hp6).opcode=taicpu(hp3).opcode) and { Both RET or both JMP to the same label }
  5823. (
  5824. (taicpu(hp6).opcode=A_RET) or
  5825. MatchOperand(taicpu(hp6).oper[0]^, taicpu(hp3).oper[0]^)
  5826. )
  5827. ) then
  5828. { Still doesn't match }
  5829. Exit;
  5830. end;
  5831. if (taicpu(hp2).oper[0]^.val = 1) then
  5832. begin
  5833. taicpu(p).condition := inverse_cond(taicpu(p).condition);
  5834. DebugMsg(SPeepholeOptimization + 'J(c)Mov1Jmp/RetMov0Jmp/Ret -> Set(~c)Jmp/Ret',p)
  5835. end
  5836. else
  5837. DebugMsg(SPeepholeOptimization + 'J(c)Mov0Jmp/RetMov1Jmp/Ret -> Set(c)Jmp/Ret',p);
  5838. if taicpu(hp2).opsize=S_B then
  5839. begin
  5840. if taicpu(hp2).oper[1]^.typ = top_reg then
  5841. begin
  5842. SecondReg := taicpu(hp2).oper[1]^.reg;
  5843. hp4:=taicpu.op_reg(A_SETcc, S_B, SecondReg);
  5844. end
  5845. else
  5846. begin
  5847. hp4:=taicpu.op_ref(A_SETcc, S_B, taicpu(hp2).oper[1]^.ref^);
  5848. SecondReg := NR_NO;
  5849. end;
  5850. hp_pos := p;
  5851. hp_allocstart := hp4;
  5852. end
  5853. else
  5854. begin
  5855. { Will be a register because the size can't be S_B otherwise }
  5856. SecondReg:=taicpu(hp2).oper[1]^.reg;
  5857. ThisReg:=newreg(R_INTREGISTER,getsupreg(SecondReg), R_SUBL);
  5858. hp4:=taicpu.op_reg(A_SETcc, S_B, ThisReg);
  5859. if (cs_opt_size in current_settings.optimizerswitches) then
  5860. begin
  5861. { Favour using MOVZX when optimising for size }
  5862. case taicpu(hp2).opsize of
  5863. S_W:
  5864. NewSize := S_BW;
  5865. S_L:
  5866. NewSize := S_BL;
  5867. {$ifdef x86_64}
  5868. S_Q:
  5869. begin
  5870. NewSize := S_BL;
  5871. { Will implicitly zero-extend to 64-bit }
  5872. setsubreg(SecondReg, R_SUBD);
  5873. end;
  5874. {$endif x86_64}
  5875. else
  5876. InternalError(2022101301);
  5877. end;
  5878. hp5:=taicpu.op_reg_reg(A_MOVZX, NewSize, ThisReg, SecondReg);
  5879. { Inserting it right before p will guarantee that the flags are also tracked }
  5880. Asml.InsertBefore(hp5, p);
  5881. { Make sure the SET instruction gets inserted before the MOVZX instruction }
  5882. hp_pos := hp5;
  5883. hp_allocstart := hp4;
  5884. end
  5885. else
  5886. begin
  5887. hp5:=taicpu.op_const_reg(A_MOV, taicpu(hp2).opsize, 0, SecondReg);
  5888. { Inserting it right before p will guarantee that the flags are also tracked }
  5889. Asml.InsertBefore(hp5, p);
  5890. hp_pos := p;
  5891. hp_allocstart := hp5;
  5892. end;
  5893. taicpu(hp5).fileinfo:=taicpu(p).fileinfo;
  5894. end;
  5895. taicpu(hp4).fileinfo := taicpu(p).fileinfo;
  5896. taicpu(hp4).condition := taicpu(p).condition;
  5897. asml.InsertBefore(hp4, hp_pos);
  5898. if taicpu(hp3).is_jmp then
  5899. begin
  5900. JumpLoc.decrefs;
  5901. MakeUnconditional(taicpu(p));
  5902. taicpu(p).loadref(0, JumpTargetOp(taicpu(hp3))^.ref^);
  5903. TAsmLabel(JumpTargetOp(taicpu(hp3))^.ref^.symbol).increfs;
  5904. end
  5905. else
  5906. ConvertJumpToRET(p, hp3);
  5907. if SecondReg <> NR_NO then
  5908. { Ensure the destination register is allocated over this region }
  5909. AllocRegBetween(SecondReg, hp_allocstart, p, UsedRegs);
  5910. if (JumpLoc.getrefs = 0) then
  5911. RemoveDeadCodeAfterJump(hp3);
  5912. Result:=true;
  5913. exit;
  5914. end;
  5915. end;
  5916. function TX86AsmOptimizer.OptPass1Sub(var p : tai) : boolean;
  5917. var
  5918. hp1, hp2: tai;
  5919. ActiveReg: TRegister;
  5920. OldOffset: asizeint;
  5921. ThisConst: TCGInt;
  5922. function RegDeallocated: Boolean;
  5923. begin
  5924. TransferUsedRegs(TmpUsedRegs);
  5925. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5926. Result := not(RegUsedAfterInstruction(ActiveReg,hp1,TmpUsedRegs))
  5927. end;
  5928. begin
  5929. Result:=false;
  5930. hp1 := nil;
  5931. { replace
  5932. subX const,%reg1
  5933. leaX (%reg1,%reg1,Y),%reg2 // Base or index might not be equal to reg1
  5934. dealloc %reg1
  5935. by
  5936. leaX -const-const*Y(%reg1,%reg1,Y),%reg2
  5937. }
  5938. if MatchOpType(taicpu(p),top_const,top_reg) then
  5939. begin
  5940. ActiveReg := taicpu(p).oper[1]^.reg;
  5941. { Ensures the entire register was updated }
  5942. if (taicpu(p).opsize >= S_L) and
  5943. GetNextInstructionUsingReg(p,hp1, ActiveReg) and
  5944. MatchInstruction(hp1,A_LEA,[]) and
  5945. (SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.base) or
  5946. SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.index)) and
  5947. (
  5948. { Cover the case where the register in the reference is also the destination register }
  5949. Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, ActiveReg) or
  5950. (
  5951. { Try to avoid the expensive check of RegUsedAfterInstruction if we know it will return False }
  5952. not SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ActiveReg) and
  5953. RegDeallocated
  5954. )
  5955. ) then
  5956. begin
  5957. OldOffset := taicpu(hp1).oper[0]^.ref^.offset;
  5958. if ActiveReg=taicpu(hp1).oper[0]^.ref^.base then
  5959. Dec(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val);
  5960. if ActiveReg=taicpu(hp1).oper[0]^.ref^.index then
  5961. Dec(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val*max(taicpu(hp1).oper[0]^.ref^.scalefactor,1));
  5962. {$ifdef x86_64}
  5963. if (taicpu(hp1).oper[0]^.ref^.offset > $7FFFFFFF) or (taicpu(hp1).oper[0]^.ref^.offset < -2147483648) then
  5964. begin
  5965. { Overflow; abort }
  5966. taicpu(hp1).oper[0]^.ref^.offset := OldOffset;
  5967. end
  5968. else
  5969. {$endif x86_64}
  5970. begin
  5971. DebugMsg(SPeepholeOptimization + 'SubLea2Lea done',p);
  5972. if not (cs_opt_level3 in current_settings.optimizerswitches) then
  5973. { hp1 is the immediate next instruction for sure - good for a quick speed boost }
  5974. RemoveCurrentP(p, hp1)
  5975. else
  5976. RemoveCurrentP(p);
  5977. result:=true;
  5978. Exit;
  5979. end;
  5980. end;
  5981. if (
  5982. { Save calling GetNextInstructionUsingReg again }
  5983. Assigned(hp1) or
  5984. GetNextInstructionUsingReg(p,hp1, ActiveReg)
  5985. ) and
  5986. MatchInstruction(hp1,A_SUB,[taicpu(p).opsize]) and
  5987. (taicpu(hp1).oper[1]^.reg = ActiveReg) then
  5988. begin
  5989. if taicpu(hp1).oper[0]^.typ = top_const then
  5990. begin
  5991. { Merge add const1,%reg; add const2,%reg to add const1+const2,%reg }
  5992. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val;
  5993. Result := True;
  5994. { Handle any overflows }
  5995. case taicpu(p).opsize of
  5996. S_B:
  5997. taicpu(p).oper[0]^.val := ThisConst and $FF;
  5998. S_W:
  5999. taicpu(p).oper[0]^.val := ThisConst and $FFFF;
  6000. S_L:
  6001. taicpu(p).oper[0]^.val := ThisConst and $FFFFFFFF;
  6002. {$ifdef x86_64}
  6003. S_Q:
  6004. if (ThisConst > $7FFFFFFF) or (ThisConst < -2147483648) then
  6005. { Overflow; abort }
  6006. Result := False
  6007. else
  6008. taicpu(p).oper[0]^.val := ThisConst;
  6009. {$endif x86_64}
  6010. else
  6011. InternalError(2021102611);
  6012. end;
  6013. { Result may get set to False again if the combined immediate overflows for S_Q sizes }
  6014. if Result then
  6015. begin
  6016. if (taicpu(p).oper[0]^.val < 0) and
  6017. (
  6018. ((taicpu(p).opsize = S_B) and (taicpu(p).oper[0]^.val <> -128)) or
  6019. ((taicpu(p).opsize = S_W) and (taicpu(p).oper[0]^.val <> -32768)) or
  6020. ((taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) and (taicpu(p).oper[0]^.val <> -2147483648))
  6021. ) then
  6022. begin
  6023. DebugMsg(SPeepholeOptimization + 'SUB; ADD/SUB -> ADD',p);
  6024. taicpu(p).opcode := A_SUB;
  6025. taicpu(p).oper[0]^.val := -taicpu(p).oper[0]^.val;
  6026. end
  6027. else
  6028. DebugMsg(SPeepholeOptimization + 'SUB; ADD/SUB -> SUB',p);
  6029. RemoveInstruction(hp1);
  6030. end;
  6031. end
  6032. else
  6033. begin
  6034. { Make doubly sure the flags aren't in use because the order of subtractions may affect them }
  6035. TransferUsedRegs(TmpUsedRegs);
  6036. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  6037. hp2 := p;
  6038. while not (cs_opt_level3 in current_settings.optimizerswitches) and
  6039. GetNextInstruction(hp2, hp2) and (hp2 <> hp1) do
  6040. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  6041. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  6042. begin
  6043. { Move the constant subtraction to after the reg/ref addition to improve optimisation }
  6044. DebugMsg(SPeepholeOptimization + 'Add/sub swap 1b done',p);
  6045. Asml.Remove(p);
  6046. Asml.InsertAfter(p, hp1);
  6047. p := hp1;
  6048. Result := True;
  6049. Exit;
  6050. end;
  6051. end;
  6052. end;
  6053. { * change "subl $2, %esp; pushw x" to "pushl x"}
  6054. { * change "sub/add const1, reg" or "dec reg" followed by
  6055. "sub const2, reg" to one "sub ..., reg" }
  6056. {$ifdef i386}
  6057. if (taicpu(p).oper[0]^.val = 2) and
  6058. (ActiveReg = NR_ESP) and
  6059. { Don't do the sub/push optimization if the sub }
  6060. { comes from setting up the stack frame (JM) }
  6061. (not(GetLastInstruction(p,hp1)) or
  6062. not(MatchInstruction(hp1,A_MOV,[S_L]) and
  6063. MatchOperand(taicpu(hp1).oper[0]^,NR_ESP) and
  6064. MatchOperand(taicpu(hp1).oper[0]^,NR_EBP))) then
  6065. begin
  6066. hp1 := tai(p.next);
  6067. while Assigned(hp1) and
  6068. (tai(hp1).typ in [ait_instruction]+SkipInstr) and
  6069. not RegReadByInstruction(NR_ESP,hp1) and
  6070. not RegModifiedByInstruction(NR_ESP,hp1) do
  6071. hp1 := tai(hp1.next);
  6072. if Assigned(hp1) and
  6073. MatchInstruction(hp1,A_PUSH,[S_W]) then
  6074. begin
  6075. taicpu(hp1).changeopsize(S_L);
  6076. if taicpu(hp1).oper[0]^.typ=top_reg then
  6077. setsubreg(taicpu(hp1).oper[0]^.reg,R_SUBWHOLE);
  6078. hp1 := tai(p.next);
  6079. RemoveCurrentp(p, hp1);
  6080. Result:=true;
  6081. exit;
  6082. end;
  6083. end;
  6084. {$endif i386}
  6085. if DoArithCombineOpt(p) then
  6086. Result:=true;
  6087. end;
  6088. end;
  6089. function TX86AsmOptimizer.OptPass1SHLSAL(var p : tai) : boolean;
  6090. var
  6091. TmpBool1,TmpBool2 : Boolean;
  6092. tmpref : treference;
  6093. hp1,hp2: tai;
  6094. mask, shiftval: tcgint;
  6095. begin
  6096. Result:=false;
  6097. { All these optimisations work on "shl/sal const,%reg" }
  6098. if not MatchOpType(taicpu(p),top_const,top_reg) then
  6099. Exit;
  6100. if (taicpu(p).opsize in [S_L{$ifdef x86_64},S_Q{$endif x86_64}]) and
  6101. (taicpu(p).oper[0]^.val <= 3) then
  6102. { Changes "shl const, %reg32; add const/reg, %reg32" to one lea statement }
  6103. begin
  6104. { should we check the next instruction? }
  6105. TmpBool1 := True;
  6106. { have we found an add/sub which could be
  6107. integrated in the lea? }
  6108. TmpBool2 := False;
  6109. reference_reset(tmpref,2,[]);
  6110. TmpRef.index := taicpu(p).oper[1]^.reg;
  6111. TmpRef.scalefactor := 1 shl taicpu(p).oper[0]^.val;
  6112. while TmpBool1 and
  6113. GetNextInstruction(p, hp1) and
  6114. (tai(hp1).typ = ait_instruction) and
  6115. ((((taicpu(hp1).opcode = A_ADD) or
  6116. (taicpu(hp1).opcode = A_SUB)) and
  6117. (taicpu(hp1).oper[1]^.typ = Top_Reg) and
  6118. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg)) or
  6119. (((taicpu(hp1).opcode = A_INC) or
  6120. (taicpu(hp1).opcode = A_DEC)) and
  6121. (taicpu(hp1).oper[0]^.typ = Top_Reg) and
  6122. (taicpu(hp1).oper[0]^.reg = taicpu(p).oper[1]^.reg)) or
  6123. ((taicpu(hp1).opcode = A_LEA) and
  6124. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  6125. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg))) and
  6126. (not GetNextInstruction(hp1,hp2) or
  6127. not instrReadsFlags(hp2)) Do
  6128. begin
  6129. TmpBool1 := False;
  6130. if taicpu(hp1).opcode=A_LEA then
  6131. begin
  6132. if (TmpRef.base = NR_NO) and
  6133. (taicpu(hp1).oper[0]^.ref^.symbol=nil) and
  6134. (taicpu(hp1).oper[0]^.ref^.relsymbol=nil) and
  6135. { Segment register isn't a concern here }
  6136. ((taicpu(hp1).oper[0]^.ref^.scalefactor=0) or
  6137. (taicpu(hp1).oper[0]^.ref^.scalefactor*tmpref.scalefactor<=8)) then
  6138. begin
  6139. TmpBool1 := True;
  6140. TmpBool2 := True;
  6141. inc(TmpRef.offset, taicpu(hp1).oper[0]^.ref^.offset);
  6142. if taicpu(hp1).oper[0]^.ref^.scalefactor<>0 then
  6143. tmpref.scalefactor:=tmpref.scalefactor*taicpu(hp1).oper[0]^.ref^.scalefactor;
  6144. TmpRef.base := taicpu(hp1).oper[0]^.ref^.base;
  6145. RemoveInstruction(hp1);
  6146. end
  6147. end
  6148. else if (taicpu(hp1).oper[0]^.typ = Top_Const) then
  6149. begin
  6150. TmpBool1 := True;
  6151. TmpBool2 := True;
  6152. case taicpu(hp1).opcode of
  6153. A_ADD:
  6154. inc(TmpRef.offset, longint(taicpu(hp1).oper[0]^.val));
  6155. A_SUB:
  6156. dec(TmpRef.offset, longint(taicpu(hp1).oper[0]^.val));
  6157. else
  6158. internalerror(2019050536);
  6159. end;
  6160. RemoveInstruction(hp1);
  6161. end
  6162. else
  6163. if (taicpu(hp1).oper[0]^.typ = Top_Reg) and
  6164. (((taicpu(hp1).opcode = A_ADD) and
  6165. (TmpRef.base = NR_NO)) or
  6166. (taicpu(hp1).opcode = A_INC) or
  6167. (taicpu(hp1).opcode = A_DEC)) then
  6168. begin
  6169. TmpBool1 := True;
  6170. TmpBool2 := True;
  6171. case taicpu(hp1).opcode of
  6172. A_ADD:
  6173. TmpRef.base := taicpu(hp1).oper[0]^.reg;
  6174. A_INC:
  6175. inc(TmpRef.offset);
  6176. A_DEC:
  6177. dec(TmpRef.offset);
  6178. else
  6179. internalerror(2019050535);
  6180. end;
  6181. RemoveInstruction(hp1);
  6182. end;
  6183. end;
  6184. if TmpBool2
  6185. {$ifndef x86_64}
  6186. or
  6187. ((current_settings.optimizecputype < cpu_Pentium2) and
  6188. (taicpu(p).oper[0]^.val <= 3) and
  6189. not(cs_opt_size in current_settings.optimizerswitches))
  6190. {$endif x86_64}
  6191. then
  6192. begin
  6193. if not(TmpBool2) and
  6194. (taicpu(p).oper[0]^.val=1) then
  6195. begin
  6196. taicpu(p).opcode := A_ADD;
  6197. taicpu(p).loadreg(0, taicpu(p).oper[1]^.reg);
  6198. end
  6199. else
  6200. begin
  6201. taicpu(p).opcode := A_LEA;
  6202. taicpu(p).loadref(0, TmpRef);
  6203. end;
  6204. DebugMsg(SPeepholeOptimization + 'ShlAddLeaSubIncDec2Lea',p);
  6205. Result := True;
  6206. end;
  6207. end
  6208. {$ifndef x86_64}
  6209. else if (current_settings.optimizecputype < cpu_Pentium2) then
  6210. begin
  6211. { changes "shl $1, %reg" to "add %reg, %reg", which is the same on a 386,
  6212. but faster on a 486, and Tairable in both U and V pipes on the Pentium
  6213. (unlike shl, which is only Tairable in the U pipe) }
  6214. if taicpu(p).oper[0]^.val=1 then
  6215. begin
  6216. taicpu(p).opcode := A_ADD;
  6217. taicpu(p).loadreg(0, taicpu(p).oper[1]^.reg);
  6218. Result := True;
  6219. end
  6220. { changes "shl $2, %reg" to "lea (,%reg,4), %reg"
  6221. "shl $3, %reg" to "lea (,%reg,8), %reg }
  6222. else if (taicpu(p).opsize = S_L) and
  6223. (taicpu(p).oper[0]^.val<= 3) then
  6224. begin
  6225. reference_reset(tmpref,2,[]);
  6226. TmpRef.index := taicpu(p).oper[1]^.reg;
  6227. TmpRef.scalefactor := 1 shl taicpu(p).oper[0]^.val;
  6228. taicpu(p).opcode := A_LEA;
  6229. taicpu(p).loadref(0, TmpRef);
  6230. Result := True;
  6231. end;
  6232. end
  6233. {$endif x86_64}
  6234. else if
  6235. GetNextInstruction(p, hp1) and (hp1.typ = ait_instruction) and MatchOpType(taicpu(hp1), top_const, top_reg) and
  6236. (
  6237. (
  6238. MatchInstruction(hp1, A_AND, [taicpu(p).opsize]) and
  6239. SetAndTest(hp1, hp2)
  6240. {$ifdef x86_64}
  6241. ) or
  6242. (
  6243. MatchInstruction(hp1, A_MOV, [taicpu(p).opsize]) and
  6244. GetNextInstruction(hp1, hp2) and
  6245. MatchInstruction(hp2, A_AND, [taicpu(p).opsize]) and
  6246. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  6247. (taicpu(hp1).oper[1]^.reg = taicpu(hp2).oper[0]^.reg)
  6248. {$endif x86_64}
  6249. )
  6250. ) and
  6251. (taicpu(p).oper[1]^.reg = taicpu(hp2).oper[1]^.reg) then
  6252. begin
  6253. { Change:
  6254. shl x, %reg1
  6255. mov -(1<<x), %reg2
  6256. and %reg2, %reg1
  6257. Or:
  6258. shl x, %reg1
  6259. and -(1<<x), %reg1
  6260. To just:
  6261. shl x, %reg1
  6262. Since the and operation only zeroes bits that are already zero from the shl operation
  6263. }
  6264. case taicpu(p).oper[0]^.val of
  6265. 8:
  6266. mask:=$FFFFFFFFFFFFFF00;
  6267. 16:
  6268. mask:=$FFFFFFFFFFFF0000;
  6269. 32:
  6270. mask:=$FFFFFFFF00000000;
  6271. 63:
  6272. { Constant pre-calculated to prevent overflow errors with Int64 }
  6273. mask:=$8000000000000000;
  6274. else
  6275. begin
  6276. if taicpu(p).oper[0]^.val >= 64 then
  6277. { Shouldn't happen realistically, since the register
  6278. is guaranteed to be set to zero at this point }
  6279. mask := 0
  6280. else
  6281. mask := -(Int64(1 shl taicpu(p).oper[0]^.val));
  6282. end;
  6283. end;
  6284. if taicpu(hp1).oper[0]^.val = mask then
  6285. begin
  6286. { Everything checks out, perform the optimisation, as long as
  6287. the FLAGS register isn't being used}
  6288. TransferUsedRegs(TmpUsedRegs);
  6289. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  6290. {$ifdef x86_64}
  6291. if (hp1 <> hp2) then
  6292. begin
  6293. { "shl/mov/and" version }
  6294. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  6295. { Don't do the optimisation if the FLAGS register is in use }
  6296. if not(RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp2, TmpUsedRegs)) then
  6297. begin
  6298. DebugMsg(SPeepholeOptimization + 'ShlMovAnd2Shl', p);
  6299. { Don't remove the 'mov' instruction if its register is used elsewhere }
  6300. if not(RegUsedAfterInstruction(taicpu(hp1).oper[1]^.reg, hp2, TmpUsedRegs)) then
  6301. begin
  6302. RemoveInstruction(hp1);
  6303. Result := True;
  6304. end;
  6305. { Only set Result to True if the 'mov' instruction was removed }
  6306. RemoveInstruction(hp2);
  6307. end;
  6308. end
  6309. else
  6310. {$endif x86_64}
  6311. begin
  6312. { "shl/and" version }
  6313. { Don't do the optimisation if the FLAGS register is in use }
  6314. if not(RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)) then
  6315. begin
  6316. DebugMsg(SPeepholeOptimization + 'ShlAnd2Shl', p);
  6317. RemoveInstruction(hp1);
  6318. Result := True;
  6319. end;
  6320. end;
  6321. Exit;
  6322. end
  6323. else {$ifdef x86_64}if (hp1 = hp2) then{$endif x86_64}
  6324. begin
  6325. { Even if the mask doesn't allow for its removal, we might be
  6326. able to optimise the mask for the "shl/and" version, which
  6327. may permit other peephole optimisations }
  6328. {$ifdef DEBUG_AOPTCPU}
  6329. mask := taicpu(hp1).oper[0]^.val and mask;
  6330. if taicpu(hp1).oper[0]^.val <> mask then
  6331. begin
  6332. DebugMsg(
  6333. SPeepholeOptimization +
  6334. 'Changed mask from $' + debug_tostr(taicpu(hp1).oper[0]^.val) +
  6335. ' to $' + debug_tostr(mask) +
  6336. 'based on previous instruction (ShlAnd2ShlAnd)', hp1);
  6337. taicpu(hp1).oper[0]^.val := mask;
  6338. end;
  6339. {$else DEBUG_AOPTCPU}
  6340. { If debugging is off, just set the operand even if it's the same }
  6341. taicpu(hp1).oper[0]^.val := taicpu(hp1).oper[0]^.val and mask;
  6342. {$endif DEBUG_AOPTCPU}
  6343. end;
  6344. end;
  6345. {
  6346. change
  6347. shl/sal const,reg
  6348. <op> ...(...,reg,1),...
  6349. into
  6350. <op> ...(...,reg,1 shl const),...
  6351. if const in 1..3
  6352. }
  6353. if MatchOpType(taicpu(p), top_const, top_reg) and
  6354. (taicpu(p).oper[0]^.val in [1..3]) and
  6355. GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg) and
  6356. ((MatchInstruction(hp1,A_MOV,A_LEA,[]) and
  6357. MatchOpType(taicpu(hp1),top_ref,top_reg)) or
  6358. (MatchInstruction(hp1,A_FST,A_FSTP,A_FLD,[]) and
  6359. MatchOpType(taicpu(hp1),top_ref))
  6360. ) and
  6361. (taicpu(p).oper[1]^.reg=taicpu(hp1).oper[0]^.ref^.index) and
  6362. (taicpu(p).oper[1]^.reg<>taicpu(hp1).oper[0]^.ref^.base) and
  6363. (taicpu(hp1).oper[0]^.ref^.scalefactor in [0,1]) then
  6364. begin
  6365. TransferUsedRegs(TmpUsedRegs);
  6366. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  6367. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs)) then
  6368. begin
  6369. taicpu(hp1).oper[0]^.ref^.scalefactor:=1 shl taicpu(p).oper[0]^.val;
  6370. DebugMsg(SPeepholeOptimization + 'ShlOp2Op', p);
  6371. RemoveCurrentP(p);
  6372. Result:=true;
  6373. exit;
  6374. end;
  6375. end;
  6376. if MatchOpType(taicpu(p), top_const, top_reg) and
  6377. GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg) and
  6378. MatchInstruction(hp1,A_SHL,[taicpu(p).opsize]) and
  6379. MatchOpType(taicpu(hp1),top_const,top_reg) and
  6380. (taicpu(p).oper[1]^.reg=taicpu(hp1).oper[1]^.reg) then
  6381. begin
  6382. shiftval:=taicpu(p).oper[0]^.val+taicpu(hp1).oper[0]^.val;
  6383. if ((taicpu(p).opsize=S_B) and (shiftval>7)) or
  6384. ((taicpu(p).opsize=S_W) and (shiftval>15)) or
  6385. {$ifdef x86_64}
  6386. ((taicpu(p).opsize=S_Q) and (shiftval>63)) or
  6387. {$endif x86_64}
  6388. ((taicpu(p).opsize=S_L) and (shiftval>31)) then
  6389. begin
  6390. DebugMsg(SPeepholeOptimization + 'ShlShl2Mov', p);
  6391. taicpu(hp1).opcode:=A_MOV;
  6392. taicpu(hp1).oper[0]^.val:=0;
  6393. end
  6394. else
  6395. begin
  6396. DebugMsg(SPeepholeOptimization + 'ShlShl2Shl', p);
  6397. taicpu(hp1).oper[0]^.val:=shiftval;
  6398. end;
  6399. RemoveCurrentP(p);
  6400. Result:=true;
  6401. exit;
  6402. end;
  6403. end;
  6404. class function TX86AsmOptimizer.IsShrMovZFoldable(shr_size, movz_size: topsize; Shift: TCGInt): Boolean;
  6405. begin
  6406. case shr_size of
  6407. S_B:
  6408. { No valid combinations }
  6409. Result := False;
  6410. S_W:
  6411. Result := (Shift >= 8) and (movz_size = S_BW);
  6412. S_L:
  6413. Result :=
  6414. (Shift >= 24) { Any opsize is valid for this shift } or
  6415. ((Shift >= 16) and (movz_size = S_WL));
  6416. {$ifdef x86_64}
  6417. S_Q:
  6418. Result :=
  6419. (Shift >= 56) { Any opsize is valid for this shift } or
  6420. ((Shift >= 48) and (movz_size = S_WL));
  6421. {$endif x86_64}
  6422. else
  6423. InternalError(2022081510);
  6424. end;
  6425. end;
  6426. function TX86AsmOptimizer.OptPass1SHR(var p : tai) : boolean;
  6427. var
  6428. hp1, hp2: tai;
  6429. Shift: TCGInt;
  6430. LimitSize: Topsize;
  6431. DoNotMerge: Boolean;
  6432. begin
  6433. Result := False;
  6434. { All these optimisations work on "shr const,%reg" }
  6435. if not MatchOpType(taicpu(p), top_const, top_reg) then
  6436. Exit;
  6437. DoNotMerge := False;
  6438. Shift := taicpu(p).oper[0]^.val;
  6439. LimitSize := taicpu(p).opsize;
  6440. hp1 := p;
  6441. repeat
  6442. if not GetNextInstructionUsingReg(hp1, hp1, taicpu(p).oper[1]^.reg) or (hp1.typ <> ait_instruction) then
  6443. Exit;
  6444. case taicpu(hp1).opcode of
  6445. A_TEST, A_CMP, A_Jcc:
  6446. { Skip over conditional jumps and relevant comparisons }
  6447. Continue;
  6448. A_MOVZX:
  6449. if MatchOpType(taicpu(hp1), top_reg, top_reg) and
  6450. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(p).oper[1]^.reg) then
  6451. begin
  6452. { Since the original register is being read as is, subsequent
  6453. SHRs must not be merged at this point }
  6454. DoNotMerge := True;
  6455. if IsShrMovZFoldable(taicpu(p).opsize, taicpu(hp1).opsize, Shift) then
  6456. begin
  6457. if not SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then { Different register target }
  6458. begin
  6459. DebugMsg(SPeepholeOptimization + 'Converted MOVZX instruction to MOV since previous SHR makes zero-extension unnecessary (ShrMovz2ShrMov 1)', hp1);
  6460. taicpu(hp1).opcode := A_MOV;
  6461. setsubreg(taicpu(hp1).oper[0]^.reg, getsubreg(taicpu(hp1).oper[1]^.reg));
  6462. case taicpu(hp1).opsize of
  6463. S_BW:
  6464. taicpu(hp1).opsize := S_W;
  6465. S_BL, S_WL:
  6466. taicpu(hp1).opsize := S_L;
  6467. else
  6468. InternalError(2022081503);
  6469. end;
  6470. { p itself hasn't changed, so no need to set Result to True }
  6471. Include(OptsToCheck, aoc_ForceNewIteration);
  6472. { See if there's anything afterwards that can be
  6473. optimised, since the input register hasn't changed }
  6474. Continue;
  6475. end;
  6476. { NOTE: If the MOVZX instruction reads and writes the same
  6477. register, defer this to the post-peephole optimisation stage }
  6478. Exit;
  6479. end;
  6480. end;
  6481. A_SHL, A_SAL, A_SHR:
  6482. if (taicpu(hp1).opsize <= LimitSize) and
  6483. MatchOpType(taicpu(hp1), top_const, top_reg) and
  6484. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[1]^.reg) then
  6485. begin
  6486. { Make sure the sizes don't exceed the register size limit
  6487. (measured by the shift value falling below the limit) }
  6488. if taicpu(hp1).opsize < LimitSize then
  6489. LimitSize := taicpu(hp1).opsize;
  6490. if taicpu(hp1).opcode = A_SHR then
  6491. Inc(Shift, taicpu(hp1).oper[0]^.val)
  6492. else
  6493. begin
  6494. Dec(Shift, taicpu(hp1).oper[0]^.val);
  6495. DoNotMerge := True;
  6496. end;
  6497. if Shift < topsize2memsize[taicpu(p).opsize] - topsize2memsize[LimitSize] then
  6498. Exit;
  6499. { Since we've established that the combined shift is within
  6500. limits, we can actually combine the adjacent SHR
  6501. instructions even if they're different sizes }
  6502. if not DoNotMerge and (taicpu(hp1).opcode = A_SHR) then
  6503. begin
  6504. hp2 := tai(hp1.Previous);
  6505. DebugMsg(SPeepholeOptimization + 'ShrShr2Shr 1', p);
  6506. Inc(taicpu(p).oper[0]^.val, taicpu(hp1).oper[0]^.val);
  6507. RemoveInstruction(hp1);
  6508. hp1 := hp2;
  6509. { Though p has changed, only the constant has, and its
  6510. effects can still be detected on the next iteration of
  6511. the repeat..until loop }
  6512. Include(OptsToCheck, aoc_ForceNewIteration);
  6513. end;
  6514. { Move onto the next instruction }
  6515. Continue;
  6516. end;
  6517. else
  6518. ;
  6519. end;
  6520. Break;
  6521. until False;
  6522. end;
  6523. function TX86AsmOptimizer.CheckMemoryWrite(var first_mov, second_mov: taicpu): Boolean;
  6524. var
  6525. CurrentRef: TReference;
  6526. FullReg: TRegister;
  6527. hp1, hp2: tai;
  6528. begin
  6529. Result := False;
  6530. if (first_mov.opsize <> S_B) or (second_mov.opsize <> S_B) then
  6531. Exit;
  6532. { We assume you've checked if the operand is actually a reference by
  6533. this point. If it isn't, you'll most likely get an access violation }
  6534. CurrentRef := first_mov.oper[1]^.ref^;
  6535. { Memory must be aligned }
  6536. if (CurrentRef.offset mod 4) <> 0 then
  6537. Exit;
  6538. Inc(CurrentRef.offset);
  6539. CurrentRef.alignment := 1; { Otherwise references_equal will return False }
  6540. if MatchOperand(second_mov.oper[0]^, 0) and
  6541. references_equal(second_mov.oper[1]^.ref^, CurrentRef) and
  6542. GetNextInstruction(second_mov, hp1) and
  6543. (hp1.typ = ait_instruction) and
  6544. (taicpu(hp1).opcode = A_MOV) and
  6545. MatchOpType(taicpu(hp1), top_const, top_ref) and
  6546. (taicpu(hp1).oper[0]^.val = 0) then
  6547. begin
  6548. Inc(CurrentRef.offset);
  6549. CurrentRef.alignment := taicpu(hp1).oper[1]^.ref^.alignment; { Otherwise references_equal might return False }
  6550. FullReg := newreg(R_INTREGISTER,getsupreg(first_mov.oper[0]^.reg), R_SUBD);
  6551. if references_equal(taicpu(hp1).oper[1]^.ref^, CurrentRef) then
  6552. begin
  6553. case taicpu(hp1).opsize of
  6554. S_B:
  6555. if GetNextInstruction(hp1, hp2) and
  6556. MatchInstruction(taicpu(hp2), A_MOV, [S_B]) and
  6557. MatchOpType(taicpu(hp2), top_const, top_ref) and
  6558. (taicpu(hp2).oper[0]^.val = 0) then
  6559. begin
  6560. Inc(CurrentRef.offset);
  6561. CurrentRef.alignment := 1; { Otherwise references_equal will return False }
  6562. if references_equal(taicpu(hp2).oper[1]^.ref^, CurrentRef) and
  6563. (taicpu(hp2).opsize = S_B) then
  6564. begin
  6565. RemoveInstruction(hp1);
  6566. RemoveInstruction(hp2);
  6567. first_mov.opsize := S_L;
  6568. if first_mov.oper[0]^.typ = top_reg then
  6569. begin
  6570. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVb/MOVb -> MOVZX/MOVl', first_mov);
  6571. { Reuse second_mov as a MOVZX instruction }
  6572. second_mov.opcode := A_MOVZX;
  6573. second_mov.opsize := S_BL;
  6574. second_mov.loadreg(0, first_mov.oper[0]^.reg);
  6575. second_mov.loadreg(1, FullReg);
  6576. first_mov.oper[0]^.reg := FullReg;
  6577. asml.Remove(second_mov);
  6578. asml.InsertBefore(second_mov, first_mov);
  6579. end
  6580. else
  6581. { It's a value }
  6582. begin
  6583. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVb/MOVb -> MOVl', first_mov);
  6584. RemoveInstruction(second_mov);
  6585. end;
  6586. Result := True;
  6587. Exit;
  6588. end;
  6589. end;
  6590. S_W:
  6591. begin
  6592. RemoveInstruction(hp1);
  6593. first_mov.opsize := S_L;
  6594. if first_mov.oper[0]^.typ = top_reg then
  6595. begin
  6596. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVw -> MOVZX/MOVl', first_mov);
  6597. { Reuse second_mov as a MOVZX instruction }
  6598. second_mov.opcode := A_MOVZX;
  6599. second_mov.opsize := S_BL;
  6600. second_mov.loadreg(0, first_mov.oper[0]^.reg);
  6601. second_mov.loadreg(1, FullReg);
  6602. first_mov.oper[0]^.reg := FullReg;
  6603. asml.Remove(second_mov);
  6604. asml.InsertBefore(second_mov, first_mov);
  6605. end
  6606. else
  6607. { It's a value }
  6608. begin
  6609. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVw -> MOVl', first_mov);
  6610. RemoveInstruction(second_mov);
  6611. end;
  6612. Result := True;
  6613. Exit;
  6614. end;
  6615. else
  6616. ;
  6617. end;
  6618. end;
  6619. end;
  6620. end;
  6621. function TX86AsmOptimizer.OptPass1FSTP(var p: tai): boolean;
  6622. { returns true if a "continue" should be done after this optimization }
  6623. var
  6624. hp1, hp2, hp3: tai;
  6625. begin
  6626. Result := false;
  6627. hp3 := nil;
  6628. if MatchOpType(taicpu(p),top_ref) and
  6629. GetNextInstruction(p, hp1) and
  6630. (hp1.typ = ait_instruction) and
  6631. (((taicpu(hp1).opcode = A_FLD) and
  6632. (taicpu(p).opcode = A_FSTP)) or
  6633. ((taicpu(p).opcode = A_FISTP) and
  6634. (taicpu(hp1).opcode = A_FILD))) and
  6635. MatchOpType(taicpu(hp1),top_ref) and
  6636. (taicpu(hp1).opsize = taicpu(p).opsize) and
  6637. RefsEqual(taicpu(p).oper[0]^.ref^, taicpu(hp1).oper[0]^.ref^) then
  6638. begin
  6639. { replacing fstp f;fld f by fst f is only valid for extended because of rounding or if fastmath is on }
  6640. if ((taicpu(p).opsize=S_FX) or (cs_opt_fastmath in current_settings.optimizerswitches)) and
  6641. GetNextInstruction(hp1, hp2) and
  6642. (((hp2.typ = ait_instruction) and
  6643. IsExitCode(hp2) and
  6644. (taicpu(p).oper[0]^.ref^.base = current_procinfo.FramePointer) and
  6645. not(assigned(current_procinfo.procdef.funcretsym) and
  6646. (taicpu(p).oper[0]^.ref^.offset < tabstractnormalvarsym(current_procinfo.procdef.funcretsym).localloc.reference.offset)) and
  6647. (taicpu(p).oper[0]^.ref^.index = NR_NO)) or
  6648. { fstp <temp>
  6649. fld <temp>
  6650. <dealloc> <temp>
  6651. }
  6652. ((taicpu(p).oper[0]^.ref^.base = current_procinfo.FramePointer) and
  6653. (taicpu(p).oper[0]^.ref^.index = NR_NO) and
  6654. SetAndTest(FindTempDeAlloc(taicpu(p).oper[0]^.ref^.offset,tai(hp1.next)),hp2) and
  6655. (tai_tempalloc(hp2).temppos=taicpu(p).oper[0]^.ref^.offset) and
  6656. (((taicpu(p).opsize=S_FX) and (tai_tempalloc(hp2).tempsize=16)) or
  6657. ((taicpu(p).opsize in [S_IQ,S_FL]) and (tai_tempalloc(hp2).tempsize=8)) or
  6658. ((taicpu(p).opsize=S_FS) and (tai_tempalloc(hp2).tempsize=4))
  6659. )
  6660. )
  6661. ) then
  6662. begin
  6663. DebugMsg(SPeepholeOptimization + 'FstpFld2<Nop>',p);
  6664. RemoveInstruction(hp1);
  6665. RemoveCurrentP(p, hp2);
  6666. { first case: exit code }
  6667. if hp2.typ = ait_instruction then
  6668. RemoveLastDeallocForFuncRes(p);
  6669. Result := true;
  6670. end
  6671. else
  6672. { we can do this only in fast math mode as fstp is rounding ...
  6673. ... still disabled as it breaks the compiler and/or rtl }
  6674. if { (cs_opt_fastmath in current_settings.optimizerswitches) or }
  6675. { ... or if another fstp equal to the first one follows }
  6676. GetNextInstruction(hp1,hp2) and
  6677. (hp2.typ = ait_instruction) and
  6678. (taicpu(p).opcode=taicpu(hp2).opcode) and
  6679. (taicpu(p).opsize=taicpu(hp2).opsize) then
  6680. begin
  6681. if (taicpu(p).oper[0]^.ref^.base = current_procinfo.FramePointer) and
  6682. (taicpu(p).oper[0]^.ref^.index = NR_NO) and
  6683. SetAndTest(FindTempDeAlloc(taicpu(p).oper[0]^.ref^.offset,tai(hp2.next)),hp3) and
  6684. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[0]^) and
  6685. (tai_tempalloc(hp3).temppos=taicpu(p).oper[0]^.ref^.offset) and
  6686. (((taicpu(p).opsize=S_FX) and (tai_tempalloc(hp3).tempsize=16)) or
  6687. ((taicpu(p).opsize in [S_IQ,S_FL]) and (tai_tempalloc(hp3).tempsize=8)) or
  6688. ((taicpu(p).opsize=S_FS) and (tai_tempalloc(hp3).tempsize=4))
  6689. ) then
  6690. begin
  6691. DebugMsg(SPeepholeOptimization + 'FstpFldFstp2Fstp',p);
  6692. RemoveCurrentP(p,hp2);
  6693. RemoveInstruction(hp1);
  6694. Result := true;
  6695. end
  6696. else if { fst can't store an extended/comp value }
  6697. (taicpu(p).opsize <> S_FX) and
  6698. (taicpu(p).opsize <> S_IQ) then
  6699. begin
  6700. if (taicpu(p).opcode = A_FSTP) then
  6701. taicpu(p).opcode := A_FST
  6702. else
  6703. taicpu(p).opcode := A_FIST;
  6704. DebugMsg(SPeepholeOptimization + 'FstpFld2Fst',p);
  6705. RemoveInstruction(hp1);
  6706. Result := true;
  6707. end;
  6708. end;
  6709. end;
  6710. end;
  6711. function TX86AsmOptimizer.OptPass1FLD(var p : tai) : boolean;
  6712. var
  6713. hp1, hp2, hp3: tai;
  6714. begin
  6715. result:=false;
  6716. if MatchOpType(taicpu(p),top_reg) and
  6717. GetNextInstruction(p, hp1) and
  6718. (hp1.typ = Ait_Instruction) and
  6719. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  6720. (taicpu(hp1).oper[0]^.reg = NR_ST) and
  6721. (taicpu(hp1).oper[1]^.reg = NR_ST1) then
  6722. { change to
  6723. fld reg fxxx reg,st
  6724. fxxxp st, st1 (hp1)
  6725. Remark: non commutative operations must be reversed!
  6726. }
  6727. begin
  6728. case taicpu(hp1).opcode Of
  6729. A_FMULP,A_FADDP,
  6730. A_FSUBP,A_FDIVP,A_FSUBRP,A_FDIVRP:
  6731. begin
  6732. case taicpu(hp1).opcode Of
  6733. A_FADDP: taicpu(hp1).opcode := A_FADD;
  6734. A_FMULP: taicpu(hp1).opcode := A_FMUL;
  6735. A_FSUBP: taicpu(hp1).opcode := A_FSUBR;
  6736. A_FSUBRP: taicpu(hp1).opcode := A_FSUB;
  6737. A_FDIVP: taicpu(hp1).opcode := A_FDIVR;
  6738. A_FDIVRP: taicpu(hp1).opcode := A_FDIV;
  6739. else
  6740. internalerror(2019050534);
  6741. end;
  6742. taicpu(hp1).oper[0]^.reg := taicpu(p).oper[0]^.reg;
  6743. taicpu(hp1).oper[1]^.reg := NR_ST;
  6744. DebugMsg(SPeepholeOptimization + 'FldF*p2F*',hp1);
  6745. RemoveCurrentP(p, hp1);
  6746. Result:=true;
  6747. exit;
  6748. end;
  6749. else
  6750. ;
  6751. end;
  6752. end
  6753. else
  6754. if MatchOpType(taicpu(p),top_ref) and
  6755. GetNextInstruction(p, hp2) and
  6756. (hp2.typ = Ait_Instruction) and
  6757. MatchOpType(taicpu(hp2),top_reg,top_reg) and
  6758. (taicpu(p).opsize in [S_FS, S_FL]) and
  6759. (taicpu(hp2).oper[0]^.reg = NR_ST) and
  6760. (taicpu(hp2).oper[1]^.reg = NR_ST1) then
  6761. if GetLastInstruction(p, hp1) and
  6762. MatchInstruction(hp1,A_FLD,A_FST,[taicpu(p).opsize]) and
  6763. MatchOpType(taicpu(hp1),top_ref) and
  6764. RefsEqual(taicpu(p).oper[0]^.ref^, taicpu(hp1).oper[0]^.ref^) then
  6765. if ((taicpu(hp2).opcode = A_FMULP) or
  6766. (taicpu(hp2).opcode = A_FADDP)) then
  6767. { change to
  6768. fld/fst mem1 (hp1) fld/fst mem1
  6769. fld mem1 (p) fadd/
  6770. faddp/ fmul st, st
  6771. fmulp st, st1 (hp2) }
  6772. begin
  6773. DebugMsg(SPeepholeOptimization + 'Fld/FstFldFaddp/Fmulp2Fld/FstFadd/Fmul',hp1);
  6774. RemoveCurrentP(p, hp1);
  6775. if (taicpu(hp2).opcode = A_FADDP) then
  6776. taicpu(hp2).opcode := A_FADD
  6777. else
  6778. taicpu(hp2).opcode := A_FMUL;
  6779. taicpu(hp2).oper[1]^.reg := NR_ST;
  6780. end
  6781. else
  6782. { change to
  6783. fld/fst mem1 (hp1) fld/fst mem1
  6784. fld mem1 (p) fld st
  6785. }
  6786. begin
  6787. DebugMsg(SPeepholeOptimization + 'Fld/Fst<mem>Fld<mem>2Fld/Fst<mem>Fld<reg>',hp1);
  6788. taicpu(p).changeopsize(S_FL);
  6789. taicpu(p).loadreg(0,NR_ST);
  6790. end
  6791. else
  6792. begin
  6793. case taicpu(hp2).opcode Of
  6794. A_FMULP,A_FADDP,A_FSUBP,A_FDIVP,A_FSUBRP,A_FDIVRP:
  6795. { change to
  6796. fld/fst mem1 (hp1) fld/fst mem1
  6797. fld mem2 (p) fxxx mem2
  6798. fxxxp st, st1 (hp2) }
  6799. begin
  6800. case taicpu(hp2).opcode Of
  6801. A_FADDP: taicpu(p).opcode := A_FADD;
  6802. A_FMULP: taicpu(p).opcode := A_FMUL;
  6803. A_FSUBP: taicpu(p).opcode := A_FSUBR;
  6804. A_FSUBRP: taicpu(p).opcode := A_FSUB;
  6805. A_FDIVP: taicpu(p).opcode := A_FDIVR;
  6806. A_FDIVRP: taicpu(p).opcode := A_FDIV;
  6807. else
  6808. internalerror(2019050533);
  6809. end;
  6810. DebugMsg(SPeepholeOptimization + 'Fld/FstFldF*2Fld/FstF*',p);
  6811. RemoveInstruction(hp2);
  6812. end
  6813. else
  6814. ;
  6815. end
  6816. end
  6817. end;
  6818. function IsCmpSubset(cond1, cond2: TAsmCond): Boolean; inline;
  6819. begin
  6820. Result := condition_in(cond1, cond2) or
  6821. { Not strictly subsets due to the actual flags checked, but because we're
  6822. comparing integers, E is a subset of AE and GE and their aliases }
  6823. ((cond1 in [C_E, C_Z]) and (cond2 in [C_AE, C_NB, C_NC, C_GE, C_NL]));
  6824. end;
  6825. function TX86AsmOptimizer.OptPass1Cmp(var p: tai): boolean;
  6826. var
  6827. v: TCGInt;
  6828. hp1, hp2, p_dist, p_jump, hp1_dist, p_label, hp1_label: tai;
  6829. FirstMatch, TempBool: Boolean;
  6830. NewReg: TRegister;
  6831. JumpLabel, JumpLabel_dist, JumpLabel_far: TAsmLabel;
  6832. begin
  6833. Result:=false;
  6834. { All these optimisations need a next instruction }
  6835. if not GetNextInstruction(p, hp1) then
  6836. Exit;
  6837. { Search for:
  6838. cmp ###,###
  6839. j(c1) @lbl1
  6840. ...
  6841. @lbl:
  6842. cmp ###,### (same comparison as above)
  6843. j(c2) @lbl2
  6844. If c1 is a subset of c2, change to:
  6845. cmp ###,###
  6846. j(c1) @lbl2
  6847. (@lbl1 may become a dead label as a result)
  6848. }
  6849. { Also handle cases where there are multiple jumps in a row }
  6850. p_jump := hp1;
  6851. while Assigned(p_jump) and MatchInstruction(p_jump, A_JCC, []) do
  6852. begin
  6853. if IsJumpToLabel(taicpu(p_jump)) then
  6854. begin
  6855. { Do jump optimisations first in case the condition becomes
  6856. unnecessary }
  6857. TempBool := True;
  6858. if DoJumpOptimizations(p_jump, TempBool) or
  6859. not TempBool then
  6860. begin
  6861. if Assigned(p_jump) then
  6862. begin
  6863. hp1 := p_jump;
  6864. if (p_jump.typ in [ait_align]) then
  6865. SkipAligns(p_jump, p_jump);
  6866. { CollapseZeroDistJump will be set to the label after the
  6867. jump if it optimises, whether or not it's live or dead }
  6868. if (p_jump.typ in [ait_label]) and
  6869. not (tai_label(p_jump).labsym.is_used) then
  6870. GetNextInstruction(p_jump, p_jump);
  6871. end;
  6872. TransferUsedRegs(TmpUsedRegs);
  6873. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  6874. if not Assigned(p_jump) or
  6875. (
  6876. not MatchInstruction(p_jump, A_Jcc, A_SETcc, A_CMOVcc, []) and
  6877. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, p_jump, TmpUsedRegs)
  6878. ) then
  6879. begin
  6880. { No more conditional jumps; conditional statement is no longer required }
  6881. DebugMsg(SPeepholeOptimization + 'Removed unnecessary condition (Cmp2Nop)', p);
  6882. RemoveCurrentP(p);
  6883. Result := True;
  6884. Exit;
  6885. end;
  6886. hp1 := p_jump;
  6887. Include(OptsToCheck, aoc_ForceNewIteration);
  6888. Continue;
  6889. end;
  6890. JumpLabel := TAsmLabel(taicpu(p_jump).oper[0]^.ref^.symbol);
  6891. if GetNextInstruction(p_jump, hp2) and
  6892. (
  6893. OptimizeConditionalJump(JumpLabel, p_jump, hp2, TempBool) or
  6894. not TempBool
  6895. ) then
  6896. begin
  6897. hp1 := p_jump;
  6898. Include(OptsToCheck, aoc_ForceNewIteration);
  6899. Continue;
  6900. end;
  6901. p_label := nil;
  6902. if Assigned(JumpLabel) then
  6903. p_label := getlabelwithsym(JumpLabel);
  6904. if Assigned(p_label) and
  6905. GetNextInstruction(p_label, p_dist) and
  6906. MatchInstruction(p_dist, A_CMP, []) and
  6907. MatchOperand(taicpu(p_dist).oper[0]^, taicpu(p).oper[0]^) and
  6908. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p).oper[1]^) and
  6909. GetNextInstruction(p_dist, hp1_dist) and
  6910. MatchInstruction(hp1_dist, A_JCC, []) then { This doesn't have to be an explicit label }
  6911. begin
  6912. JumpLabel_dist := TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol);
  6913. if JumpLabel = JumpLabel_dist then
  6914. { This is an infinite loop }
  6915. Exit;
  6916. { Best optimisation when the first condition is a subset (or equal) of the second }
  6917. if IsCmpSubset(taicpu(p_jump).condition, taicpu(hp1_dist).condition) then
  6918. begin
  6919. { Any registers used here will already be allocated }
  6920. if Assigned(JumpLabel) then
  6921. JumpLabel.DecRefs;
  6922. DebugMsg(SPeepholeOptimization + 'CMP/Jcc/@Lbl/CMP/Jcc -> CMP/Jcc, redirecting first jump', p_jump);
  6923. taicpu(p_jump).loadref(0, taicpu(hp1_dist).oper[0]^.ref^); { This also increases the reference count }
  6924. Result := True;
  6925. { Don't exit yet. Since p and p_jump haven't actually been
  6926. removed, we can check for more on this iteration }
  6927. end
  6928. else if IsCmpSubset(taicpu(hp1_dist).condition, inverse_cond(taicpu(p_jump).condition)) and
  6929. GetNextInstruction(hp1_dist, hp1_label) and
  6930. SkipAligns(hp1_label, hp1_label) and
  6931. (hp1_label.typ = ait_label) then
  6932. begin
  6933. JumpLabel_far := tai_label(hp1_label).labsym;
  6934. if (JumpLabel_far = JumpLabel_dist) or (JumpLabel_far = JumpLabel) then
  6935. { This is an infinite loop }
  6936. Exit;
  6937. if Assigned(JumpLabel_far) then
  6938. begin
  6939. { In this situation, if the first jump branches, the second one will never,
  6940. branch so change the destination label to after the second jump }
  6941. DebugMsg(SPeepholeOptimization + 'CMP/Jcc/@Lbl/CMP/Jcc/@Lbl -> CMP/Jcc, redirecting first jump to 2nd label', p_jump);
  6942. if Assigned(JumpLabel) then
  6943. JumpLabel.DecRefs;
  6944. JumpLabel_far.IncRefs;
  6945. taicpu(p_jump).oper[0]^.ref^.symbol := JumpLabel_far;
  6946. Result := True;
  6947. { Don't exit yet. Since p and p_jump haven't actually been
  6948. removed, we can check for more on this iteration }
  6949. Continue;
  6950. end;
  6951. end;
  6952. end;
  6953. end;
  6954. { Search for:
  6955. cmp ###,###
  6956. j(c1) @lbl1
  6957. cmp ###,### (same as first)
  6958. Remove second cmp
  6959. }
  6960. if GetNextInstruction(p_jump, hp2) and
  6961. (
  6962. (
  6963. MatchInstruction(hp2, A_CMP, [taicpu(p).opsize]) and
  6964. (
  6965. (
  6966. MatchOpType(taicpu(p), top_const, top_reg) and
  6967. MatchOpType(taicpu(hp2), top_const, top_reg) and
  6968. (taicpu(hp2).oper[0]^.val = taicpu(p).oper[0]^.val) and
  6969. Reg1WriteOverwritesReg2Entirely(taicpu(hp2).oper[1]^.reg, taicpu(p).oper[1]^.reg)
  6970. ) or (
  6971. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[0]^) and
  6972. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^)
  6973. )
  6974. )
  6975. ) or (
  6976. { Also match cmp $0,%reg; jcc @lbl; test %reg,%reg }
  6977. MatchOperand(taicpu(p).oper[0]^, 0) and
  6978. (taicpu(p).oper[1]^.typ = top_reg) and
  6979. MatchInstruction(hp2, A_TEST, []) and
  6980. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  6981. (taicpu(hp2).oper[0]^.reg = taicpu(hp2).oper[1]^.reg) and
  6982. Reg1WriteOverwritesReg2Entirely(taicpu(hp2).oper[1]^.reg, taicpu(p).oper[1]^.reg)
  6983. )
  6984. ) then
  6985. begin
  6986. DebugMsg(SPeepholeOptimization + 'CMP/Jcc/CMP; removed superfluous CMP', hp2);
  6987. RemoveInstruction(hp2);
  6988. Result := True;
  6989. { Continue the while loop in case "Jcc/CMP" follows the second CMP that was just removed }
  6990. end;
  6991. GetNextInstruction(p_jump, p_jump);
  6992. end;
  6993. if (
  6994. { Don't call GetNextInstruction again if we already have it }
  6995. (hp1 = p_jump) or
  6996. GetNextInstruction(p, hp1)
  6997. ) and
  6998. MatchInstruction(hp1, A_Jcc, []) and
  6999. IsJumpToLabel(taicpu(hp1)) and
  7000. (taicpu(hp1).condition in [C_E, C_Z, C_NE, C_NZ]) and
  7001. GetNextInstruction(hp1, hp2) then
  7002. begin
  7003. {
  7004. cmp x, y (or "cmp y, x")
  7005. je @lbl
  7006. mov x, y
  7007. @lbl:
  7008. (x and y can be constants, registers or references)
  7009. Change to:
  7010. mov x, y (x and y will always be equal in the end)
  7011. @lbl: (may beceome a dead label)
  7012. Also:
  7013. cmp x, y (or "cmp y, x")
  7014. jne @lbl
  7015. mov x, y
  7016. @lbl:
  7017. (x and y can be constants, registers or references)
  7018. Change to:
  7019. Absolutely nothing! (Except @lbl if it's still live)
  7020. }
  7021. if MatchInstruction(hp2, A_MOV, [taicpu(p).opsize]) and
  7022. (
  7023. (
  7024. MatchOperand(taicpu(p).oper[0]^, taicpu(hp2).oper[0]^) and
  7025. MatchOperand(taicpu(p).oper[1]^, taicpu(hp2).oper[1]^)
  7026. ) or (
  7027. MatchOperand(taicpu(p).oper[0]^, taicpu(hp2).oper[1]^) and
  7028. MatchOperand(taicpu(p).oper[1]^, taicpu(hp2).oper[0]^)
  7029. )
  7030. ) and
  7031. GetNextInstruction(hp2, hp1_label) and
  7032. SkipAligns(hp1_label, hp1_label) and
  7033. (hp1_label.typ = ait_label) and
  7034. (tai_label(hp1_label).labsym = taicpu(hp1).oper[0]^.ref^.symbol) then
  7035. begin
  7036. tai_label(hp1_label).labsym.DecRefs;
  7037. if (taicpu(hp1).condition in [C_NE, C_NZ]) then
  7038. begin
  7039. DebugMsg(SPeepholeOptimization + 'CMP/JNE/MOV/@Lbl -> NOP, since the MOV is only executed if the operands are equal (CmpJneMov2Nop)', p);
  7040. RemoveInstruction(hp2);
  7041. hp2 := hp1_label; { So RemoveCurrentp below can be set to something valid }
  7042. end
  7043. else
  7044. DebugMsg(SPeepholeOptimization + 'CMP/JE/MOV/@Lbl -> MOV, since the MOV is only executed if the operands aren''t equal (CmpJeMov2Mov)', p);
  7045. RemoveInstruction(hp1);
  7046. RemoveCurrentp(p, hp2);
  7047. Result := True;
  7048. Exit;
  7049. end;
  7050. {
  7051. Try to optimise the following:
  7052. cmp $x,### ($x and $y can be registers or constants)
  7053. je @lbl1 (only reference)
  7054. cmp $y,### (### are identical)
  7055. @Lbl:
  7056. sete %reg1
  7057. Change to:
  7058. cmp $x,###
  7059. sete %reg2 (allocate new %reg2)
  7060. cmp $y,###
  7061. sete %reg1
  7062. orb %reg2,%reg1
  7063. (dealloc %reg2)
  7064. This adds an instruction (so don't perform under -Os), but it removes
  7065. a conditional branch.
  7066. }
  7067. if not (cs_opt_size in current_settings.optimizerswitches) and
  7068. MatchInstruction(hp2, A_CMP, A_TEST, [taicpu(p).opsize]) and
  7069. MatchOperand(taicpu(p).oper[1]^, taicpu(hp2).oper[1]^) and
  7070. { The first operand of CMP instructions can only be a register or
  7071. immediate anyway, so no need to check }
  7072. GetNextInstruction(hp2, p_label) and
  7073. (p_label.typ = ait_label) and
  7074. (tai_label(p_label).labsym.getrefs = 1) and
  7075. (JumpTargetOp(taicpu(hp1))^.ref^.symbol = tai_label(p_label).labsym) and
  7076. GetNextInstruction(p_label, p_dist) and
  7077. MatchInstruction(p_dist, A_SETcc, []) and
  7078. (taicpu(p_dist).condition in [C_E, C_Z]) and
  7079. (taicpu(p_dist).oper[0]^.typ = top_reg) then
  7080. begin
  7081. TransferUsedRegs(TmpUsedRegs);
  7082. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  7083. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  7084. UpdateUsedRegs(TmpUsedRegs, tai(p_label.Next));
  7085. UpdateUsedRegs(TmpUsedRegs, tai(p_dist.Next));
  7086. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) and
  7087. { Get the instruction after the SETcc instruction so we can
  7088. allocate a new register over the entire range }
  7089. GetNextInstruction(p_dist, hp1_dist) then
  7090. begin
  7091. { Register can appear in p if it's not used afterwards, so only
  7092. allocate between hp1 and hp1_dist }
  7093. NewReg := GetIntRegisterBetween(R_SUBL, TmpUsedRegs, hp1, hp1_dist);
  7094. if NewReg <> NR_NO then
  7095. begin
  7096. DebugMsg(SPeepholeOptimization + 'CMP/JE/CMP/@Lbl/SETE -> CMP/SETE/CMP/SETE/OR, removing conditional branch', p);
  7097. { Change the jump instruction into a SETcc instruction }
  7098. taicpu(hp1).opcode := A_SETcc;
  7099. taicpu(hp1).opsize := S_B;
  7100. taicpu(hp1).loadreg(0, NewReg);
  7101. { This is now a dead label }
  7102. tai_label(p_label).labsym.decrefs;
  7103. { Prefer adding before the next instruction so the FLAGS
  7104. register is deallicated first }
  7105. AsmL.InsertBefore(
  7106. taicpu.op_reg_reg(A_OR, S_B, NewReg, taicpu(p_dist).oper[0]^.reg),
  7107. hp1_dist
  7108. );
  7109. Result := True;
  7110. { Don't exit yet, as p wasn't changed and hp1, while
  7111. modified, is still intact and might be optimised by the
  7112. SETcc optimisation below }
  7113. end;
  7114. end;
  7115. end;
  7116. end;
  7117. if taicpu(p).oper[0]^.typ = top_const then
  7118. begin
  7119. if (taicpu(p).oper[0]^.val = 0) and
  7120. (taicpu(p).oper[1]^.typ = top_reg) and
  7121. MatchInstruction(hp1,A_Jcc,A_SETcc,[]) then
  7122. begin
  7123. hp2 := p;
  7124. FirstMatch := True;
  7125. { When dealing with "cmp $0,%reg", only ZF and SF contain
  7126. anything meaningful once it's converted to "test %reg,%reg";
  7127. additionally, some jumps will always (or never) branch, so
  7128. evaluate every jump immediately following the
  7129. comparison, optimising the conditions if possible.
  7130. Similarly with SETcc... those that are always set to 0 or 1
  7131. are changed to MOV instructions }
  7132. while FirstMatch or { Saves calling GetNextInstruction unnecessarily }
  7133. (
  7134. GetNextInstruction(hp2, hp1) and
  7135. MatchInstruction(hp1,A_Jcc,A_SETcc,[])
  7136. ) do
  7137. begin
  7138. FirstMatch := False;
  7139. case taicpu(hp1).condition of
  7140. C_B, C_C, C_NAE, C_O:
  7141. { For B/NAE:
  7142. Will never branch since an unsigned integer can never be below zero
  7143. For C/O:
  7144. Result cannot overflow because 0 is being subtracted
  7145. }
  7146. begin
  7147. if taicpu(hp1).opcode = A_Jcc then
  7148. begin
  7149. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition B/C/NAE/O --> Never (jump removed)', hp1);
  7150. TAsmLabel(taicpu(hp1).oper[0]^.ref^.symbol).decrefs;
  7151. RemoveInstruction(hp1);
  7152. { Since hp1 was deleted, hp2 must not be updated }
  7153. Continue;
  7154. end
  7155. else
  7156. begin
  7157. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition B/C/NAE/O --> Never (set -> mov 0)', hp1);
  7158. { Convert "set(c) %reg" instruction to "movb 0,%reg" }
  7159. taicpu(hp1).opcode := A_MOV;
  7160. taicpu(hp1).ops := 2;
  7161. taicpu(hp1).condition := C_None;
  7162. taicpu(hp1).opsize := S_B;
  7163. taicpu(hp1).loadreg(1,taicpu(hp1).oper[0]^.reg);
  7164. taicpu(hp1).loadconst(0, 0);
  7165. end;
  7166. end;
  7167. C_BE, C_NA:
  7168. begin
  7169. { Will only branch if equal to zero }
  7170. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition BE/NA --> E', hp1);
  7171. taicpu(hp1).condition := C_E;
  7172. end;
  7173. C_A, C_NBE:
  7174. begin
  7175. { Will only branch if not equal to zero }
  7176. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition A/NBE --> NE', hp1);
  7177. taicpu(hp1).condition := C_NE;
  7178. end;
  7179. C_AE, C_NB, C_NC, C_NO:
  7180. begin
  7181. { Will always branch }
  7182. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition AE/NB/NC/NO --> Always', hp1);
  7183. if taicpu(hp1).opcode = A_Jcc then
  7184. begin
  7185. MakeUnconditional(taicpu(hp1));
  7186. { Any jumps/set that follow will now be dead code }
  7187. RemoveDeadCodeAfterJump(taicpu(hp1));
  7188. Break;
  7189. end
  7190. else
  7191. begin
  7192. { Convert "set(c) %reg" instruction to "movb 1,%reg" }
  7193. taicpu(hp1).opcode := A_MOV;
  7194. taicpu(hp1).ops := 2;
  7195. taicpu(hp1).condition := C_None;
  7196. taicpu(hp1).opsize := S_B;
  7197. taicpu(hp1).loadreg(1,taicpu(hp1).oper[0]^.reg);
  7198. taicpu(hp1).loadconst(0, 1);
  7199. end;
  7200. end;
  7201. C_None:
  7202. InternalError(2020012201);
  7203. C_P, C_PE, C_NP, C_PO:
  7204. { We can't handle parity checks and they should never be generated
  7205. after a general-purpose CMP (it's used in some floating-point
  7206. comparisons that don't use CMP) }
  7207. InternalError(2020012202);
  7208. else
  7209. { Zero/Equality, Sign, their complements and all of the
  7210. signed comparisons do not need to be converted };
  7211. end;
  7212. hp2 := hp1;
  7213. end;
  7214. { Convert the instruction to a TEST }
  7215. taicpu(p).opcode := A_TEST;
  7216. taicpu(p).loadreg(0,taicpu(p).oper[1]^.reg);
  7217. Result := True;
  7218. Exit;
  7219. end
  7220. else if (taicpu(p).oper[0]^.val = 1) and
  7221. MatchInstruction(hp1,A_Jcc,A_SETcc,[]) and
  7222. (taicpu(hp1).condition in [C_L, C_NL, C_NGE, C_GE]) then
  7223. begin
  7224. { Convert; To:
  7225. cmp $1,r/m cmp $0,r/m
  7226. jl @lbl jle @lbl
  7227. (Also do inverted conditions)
  7228. }
  7229. DebugMsg(SPeepholeOptimization + 'Cmp1Jl2Cmp0Jle', p);
  7230. taicpu(p).oper[0]^.val := 0;
  7231. if taicpu(hp1).condition in [C_L, C_NGE] then
  7232. taicpu(hp1).condition := C_LE
  7233. else
  7234. taicpu(hp1).condition := C_NLE;
  7235. { If the instruction is now "cmp $0,%reg", convert it to a
  7236. TEST (and effectively do the work of the "cmp $0,%reg" in
  7237. the block above)
  7238. }
  7239. if (taicpu(p).oper[1]^.typ = top_reg) then
  7240. begin
  7241. taicpu(p).opcode := A_TEST;
  7242. taicpu(p).loadreg(0,taicpu(p).oper[1]^.reg);
  7243. end;
  7244. Result := True;
  7245. Exit;
  7246. end
  7247. else if (taicpu(p).oper[1]^.typ = top_reg)
  7248. {$ifdef x86_64}
  7249. and (taicpu(p).opsize <> S_Q) { S_Q will never happen: cmp with 64 bit constants is not possible }
  7250. {$endif x86_64}
  7251. then
  7252. begin
  7253. { cmp register,$8000 neg register
  7254. je target --> jo target
  7255. .... only if register is deallocated before jump.}
  7256. case Taicpu(p).opsize of
  7257. S_B: v:=$80;
  7258. S_W: v:=$8000;
  7259. S_L: v:=qword($80000000);
  7260. else
  7261. internalerror(2013112905);
  7262. end;
  7263. if (taicpu(p).oper[0]^.val=v) and
  7264. MatchInstruction(hp1,A_Jcc,A_SETcc,[]) and
  7265. (Taicpu(hp1).condition in [C_E,C_NE]) then
  7266. begin
  7267. TransferUsedRegs(TmpUsedRegs);
  7268. UpdateUsedRegs(TmpUsedRegs,tai(p.next));
  7269. if not(RegInUsedRegs(Taicpu(p).oper[1]^.reg, TmpUsedRegs)) then
  7270. begin
  7271. DebugMsg(SPeepholeOptimization + 'CmpJe2NegJo done',p);
  7272. Taicpu(p).opcode:=A_NEG;
  7273. Taicpu(p).loadoper(0,Taicpu(p).oper[1]^);
  7274. Taicpu(p).clearop(1);
  7275. Taicpu(p).ops:=1;
  7276. if Taicpu(hp1).condition=C_E then
  7277. Taicpu(hp1).condition:=C_O
  7278. else
  7279. Taicpu(hp1).condition:=C_NO;
  7280. Result:=true;
  7281. exit;
  7282. end;
  7283. end;
  7284. end;
  7285. end;
  7286. if TrySwapMovCmp(p, hp1) then
  7287. begin
  7288. Result := True;
  7289. Exit;
  7290. end;
  7291. end;
  7292. function TX86AsmOptimizer.OptPass1PXor(var p: tai): boolean;
  7293. var
  7294. hp1: tai;
  7295. begin
  7296. {
  7297. remove the second (v)pxor from
  7298. pxor reg,reg
  7299. ...
  7300. pxor reg,reg
  7301. }
  7302. Result:=false;
  7303. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) and
  7304. MatchOpType(taicpu(p),top_reg,top_reg) and
  7305. GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[0]^.reg) and
  7306. MatchInstruction(hp1,taicpu(p).opcode,[taicpu(p).opsize]) and
  7307. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[0]^) and
  7308. MatchOperand(taicpu(hp1).oper[0]^,taicpu(hp1).oper[1]^) then
  7309. begin
  7310. DebugMsg(SPeepholeOptimization + 'PXorPXor2PXor done',hp1);
  7311. RemoveInstruction(hp1);
  7312. Result:=true;
  7313. Exit;
  7314. end
  7315. {
  7316. replace
  7317. pxor reg1,reg1
  7318. movapd/s reg1,reg2
  7319. dealloc reg1
  7320. by
  7321. pxor reg2,reg2
  7322. }
  7323. else if GetNextInstruction(p,hp1) and
  7324. { we mix single and double opperations here because we assume that the compiler
  7325. generates vmovapd only after double operations and vmovaps only after single operations }
  7326. MatchInstruction(hp1,A_MOVAPD,A_MOVAPS,[S_NO]) and
  7327. MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) and
  7328. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  7329. (taicpu(p).oper[0]^.typ=top_reg) then
  7330. begin
  7331. TransferUsedRegs(TmpUsedRegs);
  7332. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7333. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  7334. begin
  7335. taicpu(p).loadoper(0,taicpu(hp1).oper[1]^);
  7336. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  7337. DebugMsg(SPeepholeOptimization + 'PXorMovapd2PXor done',p);
  7338. RemoveInstruction(hp1);
  7339. result:=true;
  7340. end;
  7341. end;
  7342. end;
  7343. function TX86AsmOptimizer.OptPass1VPXor(var p: tai): boolean;
  7344. var
  7345. hp1: tai;
  7346. begin
  7347. {
  7348. remove the second (v)pxor from
  7349. (v)pxor reg,reg
  7350. ...
  7351. (v)pxor reg,reg
  7352. }
  7353. Result:=false;
  7354. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^,taicpu(p).oper[2]^) and
  7355. MatchOpType(taicpu(p),top_reg,top_reg,top_reg) then
  7356. begin
  7357. if GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[0]^.reg) and
  7358. MatchInstruction(hp1,taicpu(p).opcode,[taicpu(p).opsize]) and
  7359. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[0]^) and
  7360. MatchOperand(taicpu(hp1).oper[0]^,taicpu(hp1).oper[1]^,taicpu(hp1).oper[2]^) then
  7361. begin
  7362. DebugMsg(SPeepholeOptimization + 'VPXorVPXor2VPXor done',hp1);
  7363. RemoveInstruction(hp1);
  7364. Result:=true;
  7365. Exit;
  7366. end;
  7367. {$ifdef x86_64}
  7368. {
  7369. replace
  7370. vpxor reg1,reg1,reg1
  7371. vmov reg,mem
  7372. by
  7373. movq $0,mem
  7374. }
  7375. if GetNextInstruction(p,hp1) and
  7376. MatchInstruction(hp1,A_VMOVSD,[]) and
  7377. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  7378. MatchOpType(taicpu(hp1),top_reg,top_ref) then
  7379. begin
  7380. TransferUsedRegs(TmpUsedRegs);
  7381. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7382. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  7383. begin
  7384. taicpu(hp1).loadconst(0,0);
  7385. taicpu(hp1).opcode:=A_MOV;
  7386. taicpu(hp1).opsize:=S_Q;
  7387. DebugMsg(SPeepholeOptimization + 'VPXorVMov2Mov done',p);
  7388. RemoveCurrentP(p);
  7389. result:=true;
  7390. Exit;
  7391. end;
  7392. end;
  7393. {$endif x86_64}
  7394. end
  7395. {
  7396. replace
  7397. vpxor reg1,reg1,reg2
  7398. by
  7399. vpxor reg2,reg2,reg2
  7400. to avoid unncessary data dependencies
  7401. }
  7402. else if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) and
  7403. MatchOpType(taicpu(p),top_reg,top_reg,top_reg) then
  7404. begin
  7405. DebugMsg(SPeepholeOptimization + 'VPXor2VPXor done',p);
  7406. { avoid unncessary data dependency }
  7407. taicpu(p).loadreg(0,taicpu(p).oper[2]^.reg);
  7408. taicpu(p).loadreg(1,taicpu(p).oper[2]^.reg);
  7409. result:=true;
  7410. exit;
  7411. end;
  7412. Result:=OptPass1VOP(p);
  7413. end;
  7414. function TX86AsmOptimizer.OptPass1Imul(var p: tai): boolean;
  7415. var
  7416. hp1 : tai;
  7417. begin
  7418. result:=false;
  7419. { replace
  7420. IMul const,%mreg1,%mreg2
  7421. Mov %reg2,%mreg3
  7422. dealloc %mreg3
  7423. by
  7424. Imul const,%mreg1,%mreg23
  7425. }
  7426. if (taicpu(p).ops=3) and
  7427. GetNextInstruction(p,hp1) and
  7428. MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) and
  7429. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  7430. (taicpu(hp1).oper[1]^.typ=top_reg) then
  7431. begin
  7432. TransferUsedRegs(TmpUsedRegs);
  7433. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7434. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  7435. begin
  7436. taicpu(p).loadoper(2,taicpu(hp1).oper[1]^);
  7437. DebugMsg(SPeepholeOptimization + 'ImulMov2Imul done',p);
  7438. RemoveInstruction(hp1);
  7439. result:=true;
  7440. end;
  7441. end;
  7442. end;
  7443. function TX86AsmOptimizer.OptPass1SHXX(var p: tai): boolean;
  7444. var
  7445. hp1 : tai;
  7446. begin
  7447. result:=false;
  7448. { replace
  7449. IMul %reg0,%reg1,%reg2
  7450. Mov %reg2,%reg3
  7451. dealloc %reg2
  7452. by
  7453. Imul %reg0,%reg1,%reg3
  7454. }
  7455. if GetNextInstruction(p,hp1) and
  7456. MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) and
  7457. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  7458. (taicpu(hp1).oper[1]^.typ=top_reg) then
  7459. begin
  7460. TransferUsedRegs(TmpUsedRegs);
  7461. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7462. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  7463. begin
  7464. taicpu(p).loadoper(2,taicpu(hp1).oper[1]^);
  7465. DebugMsg(SPeepholeOptimization + 'SHXXMov2SHXX done',p);
  7466. RemoveInstruction(hp1);
  7467. result:=true;
  7468. end;
  7469. end;
  7470. end;
  7471. function TX86AsmOptimizer.OptPass1_V_Cvtss2sd(var p: tai): boolean;
  7472. var
  7473. hp1: tai;
  7474. begin
  7475. Result:=false;
  7476. { get rid of
  7477. (v)cvtss2sd reg0,<reg1,>reg2
  7478. (v)cvtss2sd reg2,<reg2,>reg0
  7479. }
  7480. if GetNextInstruction(p,hp1) and
  7481. (((taicpu(p).opcode=A_CVTSS2SD) and MatchInstruction(hp1,A_CVTSD2SS,[taicpu(p).opsize]) and
  7482. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[1]^) and MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^)) or
  7483. ((taicpu(p).opcode=A_VCVTSS2SD) and MatchInstruction(hp1,A_VCVTSD2SS,[taicpu(p).opsize]) and
  7484. MatchOpType(taicpu(p),top_reg,top_reg,top_reg) and
  7485. MatchOpType(taicpu(hp1),top_reg,top_reg,top_reg) and
  7486. (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) and
  7487. (getsupreg(taicpu(hp1).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg)) and
  7488. (getsupreg(taicpu(p).oper[2]^.reg)=getsupreg(taicpu(hp1).oper[0]^.reg))
  7489. )
  7490. ) then
  7491. begin
  7492. if ((taicpu(p).opcode=A_CVTSS2SD) and (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg))) or
  7493. ((taicpu(p).opcode=A_VCVTSS2SD) and (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[2]^.reg))) then
  7494. begin
  7495. DebugMsg(SPeepholeOptimization + '(V)Cvtss2CvtSd(V)Cvtsd2ss2Nop done',p);
  7496. RemoveCurrentP(p);
  7497. RemoveInstruction(hp1);
  7498. end
  7499. else
  7500. begin
  7501. DebugMsg(SPeepholeOptimization + '(V)Cvtss2CvtSd(V)Cvtsd2ss2Vmovaps done',p);
  7502. if taicpu(hp1).opcode=A_CVTSD2SS then
  7503. begin
  7504. taicpu(p).loadreg(1,taicpu(hp1).oper[1]^.reg);
  7505. taicpu(p).opcode:=A_MOVAPS;
  7506. end
  7507. else
  7508. begin
  7509. taicpu(p).loadreg(1,taicpu(hp1).oper[2]^.reg);
  7510. taicpu(p).opcode:=A_VMOVAPS;
  7511. end;
  7512. taicpu(p).ops:=2;
  7513. RemoveInstruction(hp1);
  7514. end;
  7515. Result:=true;
  7516. Exit;
  7517. end;
  7518. end;
  7519. function TX86AsmOptimizer.OptPass1Jcc(var p : tai) : boolean;
  7520. var
  7521. hp1, hp2, hp3, hp4, hp5, hp6: tai;
  7522. ThisReg: TRegister;
  7523. begin
  7524. Result := False;
  7525. if not GetNextInstruction(p,hp1) then
  7526. Exit;
  7527. {
  7528. convert
  7529. j<c> .L1
  7530. mov 1,reg
  7531. jmp .L2
  7532. .L1
  7533. mov 0,reg
  7534. .L2
  7535. into
  7536. mov 0,reg
  7537. set<not(c)> reg
  7538. take care of alignment and that the mov 0,reg is not converted into a xor as this
  7539. would destroy the flag contents
  7540. Use MOVZX if size is preferred, since while mov 0,reg is bigger, it can be
  7541. executed at the same time as a previous comparison.
  7542. set<not(c)> reg
  7543. movzx reg, reg
  7544. }
  7545. if MatchInstruction(hp1,A_MOV,[]) and
  7546. (taicpu(hp1).oper[0]^.typ = top_const) and
  7547. (
  7548. (
  7549. (taicpu(hp1).oper[1]^.typ = top_reg)
  7550. {$ifdef i386}
  7551. { Under i386, ESI, EDI, EBP and ESP
  7552. don't have an 8-bit representation }
  7553. and not (getsupreg(taicpu(hp1).oper[1]^.reg) in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  7554. {$endif i386}
  7555. ) or (
  7556. {$ifdef i386}
  7557. (taicpu(hp1).oper[1]^.typ <> top_reg) and
  7558. {$endif i386}
  7559. (taicpu(hp1).opsize = S_B)
  7560. )
  7561. ) and
  7562. GetNextInstruction(hp1,hp2) and
  7563. MatchInstruction(hp2,A_JMP,[]) and (taicpu(hp2).oper[0]^.ref^.refaddr=addr_full) and
  7564. GetNextInstruction(hp2,hp3) and
  7565. SkipAligns(hp3, hp3) and
  7566. (hp3.typ=ait_label) and
  7567. (tasmlabel(taicpu(p).oper[0]^.ref^.symbol)=tai_label(hp3).labsym) and
  7568. GetNextInstruction(hp3,hp4) and
  7569. MatchInstruction(hp4,A_MOV,[taicpu(hp1).opsize]) and
  7570. (taicpu(hp4).oper[0]^.typ = top_const) and
  7571. (
  7572. ((taicpu(hp1).oper[0]^.val = 0) and (taicpu(hp4).oper[0]^.val = 1)) or
  7573. ((taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0))
  7574. ) and
  7575. MatchOperand(taicpu(hp1).oper[1]^,taicpu(hp4).oper[1]^) and
  7576. GetNextInstruction(hp4,hp5) and
  7577. SkipAligns(hp5, hp5) and
  7578. (hp5.typ=ait_label) and
  7579. (tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol)=tai_label(hp5).labsym) then
  7580. begin
  7581. if (taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0) then
  7582. taicpu(p).condition := inverse_cond(taicpu(p).condition);
  7583. tai_label(hp3).labsym.DecRefs;
  7584. { If this isn't the only reference to the middle label, we can
  7585. still make a saving - only that the first jump and everything
  7586. that follows will remain. }
  7587. if (tai_label(hp3).labsym.getrefs = 0) then
  7588. begin
  7589. if (taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0) then
  7590. DebugMsg(SPeepholeOptimization + 'J(c)Mov1JmpMov0 -> Set(~c)',p)
  7591. else
  7592. DebugMsg(SPeepholeOptimization + 'J(c)Mov0JmpMov1 -> Set(c)',p);
  7593. { remove jump, first label and second MOV (also catching any aligns) }
  7594. repeat
  7595. if not GetNextInstruction(hp2, hp3) then
  7596. InternalError(2021040810);
  7597. RemoveInstruction(hp2);
  7598. hp2 := hp3;
  7599. until hp2 = hp5;
  7600. { Don't decrement reference count before the removal loop
  7601. above, otherwise GetNextInstruction won't stop on the
  7602. the label }
  7603. tai_label(hp5).labsym.DecRefs;
  7604. end
  7605. else
  7606. begin
  7607. if (taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0) then
  7608. DebugMsg(SPeepholeOptimization + 'J(c)Mov1JmpMov0 -> Set(~c) (partial)',p)
  7609. else
  7610. DebugMsg(SPeepholeOptimization + 'J(c)Mov0JmpMov1 -> Set(c) (partial)',p);
  7611. end;
  7612. taicpu(p).opcode:=A_SETcc;
  7613. taicpu(p).opsize:=S_B;
  7614. taicpu(p).is_jmp:=False;
  7615. if taicpu(hp1).opsize=S_B then
  7616. begin
  7617. taicpu(p).loadoper(0, taicpu(hp1).oper[1]^);
  7618. if taicpu(hp1).oper[1]^.typ = top_reg then
  7619. AllocRegBetween(taicpu(hp1).oper[1]^.reg, p, hp2, UsedRegs);
  7620. RemoveInstruction(hp1);
  7621. end
  7622. else
  7623. begin
  7624. { Will be a register because the size can't be S_B otherwise }
  7625. ThisReg := newreg(R_INTREGISTER,getsupreg(taicpu(hp1).oper[1]^.reg), R_SUBL);
  7626. taicpu(p).loadreg(0, ThisReg);
  7627. AllocRegBetween(ThisReg, p, hp2, UsedRegs);
  7628. if (cs_opt_size in current_settings.optimizerswitches) and IsMOVZXAcceptable then
  7629. begin
  7630. case taicpu(hp1).opsize of
  7631. S_W:
  7632. taicpu(hp1).opsize := S_BW;
  7633. S_L:
  7634. taicpu(hp1).opsize := S_BL;
  7635. {$ifdef x86_64}
  7636. S_Q:
  7637. begin
  7638. taicpu(hp1).opsize := S_BL;
  7639. { Change the destination register to 32-bit }
  7640. taicpu(hp1).loadreg(1, newreg(R_INTREGISTER,getsupreg(ThisReg), R_SUBD));
  7641. end;
  7642. {$endif x86_64}
  7643. else
  7644. InternalError(2021040820);
  7645. end;
  7646. taicpu(hp1).opcode := A_MOVZX;
  7647. taicpu(hp1).loadreg(0, ThisReg);
  7648. end
  7649. else
  7650. begin
  7651. AllocRegBetween(NR_FLAGS,p,hp1,UsedRegs);
  7652. { hp1 is already a MOV instruction with the correct register }
  7653. taicpu(hp1).loadconst(0, 0);
  7654. { Inserting it right before p will guarantee that the flags are also tracked }
  7655. asml.Remove(hp1);
  7656. asml.InsertBefore(hp1, p);
  7657. end;
  7658. end;
  7659. Result:=true;
  7660. exit;
  7661. end
  7662. else if (hp1.typ = ait_label) then
  7663. Result := DoSETccLblRETOpt(p, tai_label(hp1));
  7664. end;
  7665. function TX86AsmOptimizer.OptPass1VMOVDQ(var p: tai): Boolean;
  7666. var
  7667. hp1, hp2, hp3: tai;
  7668. SourceRef, TargetRef: TReference;
  7669. CurrentReg: TRegister;
  7670. begin
  7671. { VMOVDQU/CMOVDQA shouldn't have even been generated }
  7672. if not UseAVX then
  7673. InternalError(2021100501);
  7674. Result := False;
  7675. { Look for the following to simplify:
  7676. vmovdqa/u x(mem1), %xmmreg
  7677. vmovdqa/u %xmmreg, y(mem2)
  7678. vmovdqa/u x+16(mem1), %xmmreg
  7679. vmovdqa/u %xmmreg, y+16(mem2)
  7680. Change to:
  7681. vmovdqa/u x(mem1), %ymmreg
  7682. vmovdqa/u %ymmreg, y(mem2)
  7683. vpxor %ymmreg, %ymmreg, %ymmreg
  7684. ( The VPXOR instruction is to zero the upper half, thus removing the
  7685. need to call the potentially expensive VZEROUPPER instruction. Other
  7686. peephole optimisations can remove VPXOR if it's unnecessary )
  7687. }
  7688. TransferUsedRegs(TmpUsedRegs);
  7689. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  7690. { NOTE: In the optimisations below, if the references dictate that an
  7691. aligned move is possible (i.e. VMOVDQA), the existing instructions
  7692. should already be VMOVDQA because if (x mod 32) = 0, then (x mod 16) = 0 }
  7693. if (taicpu(p).opsize = S_XMM) and
  7694. MatchOpType(taicpu(p), top_ref, top_reg) and
  7695. GetNextInstruction(p, hp1) and
  7696. MatchInstruction(hp1, A_VMOVDQA, A_VMOVDQU, [S_XMM]) and
  7697. MatchOpType(taicpu(hp1), top_reg, top_ref) and
  7698. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) then
  7699. begin
  7700. SourceRef := taicpu(p).oper[0]^.ref^;
  7701. TargetRef := taicpu(hp1).oper[1]^.ref^;
  7702. if GetNextInstruction(hp1, hp2) and
  7703. MatchInstruction(hp2, A_VMOVDQA, A_VMOVDQU, [S_XMM]) and
  7704. MatchOpType(taicpu(hp2), top_ref, top_reg) then
  7705. begin
  7706. { Delay calling GetNextInstruction(hp2, hp3) for as long as possible }
  7707. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  7708. Inc(SourceRef.offset, 16);
  7709. { Reuse the register in the first block move }
  7710. CurrentReg := newreg(R_MMREGISTER, getsupreg(taicpu(p).oper[1]^.reg), R_SUBMMY);
  7711. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) and
  7712. not RefsMightOverlap(taicpu(p).oper[0]^.ref^, TargetRef, 32) then
  7713. begin
  7714. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  7715. Inc(TargetRef.offset, 16);
  7716. if GetNextInstruction(hp2, hp3) and
  7717. MatchInstruction(hp3, A_VMOVDQA, A_VMOVDQU, [S_XMM]) and
  7718. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  7719. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  7720. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  7721. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  7722. begin
  7723. { Update the register tracking to the new size }
  7724. AllocRegBetween(CurrentReg, p, hp2, UsedRegs);
  7725. { Remember that the offsets are 16 ahead }
  7726. { Switch to unaligned if the memory isn't on a 32-byte boundary }
  7727. if not (
  7728. ((SourceRef.offset mod 32) = 16) and
  7729. (SourceRef.alignment >= 32) and ((SourceRef.alignment mod 32) = 0)
  7730. ) then
  7731. taicpu(p).opcode := A_VMOVDQU;
  7732. taicpu(p).opsize := S_YMM;
  7733. taicpu(p).oper[1]^.reg := CurrentReg;
  7734. if not (
  7735. ((TargetRef.offset mod 32) = 16) and
  7736. (TargetRef.alignment >= 32) and ((TargetRef.alignment mod 32) = 0)
  7737. ) then
  7738. taicpu(hp1).opcode := A_VMOVDQU;
  7739. taicpu(hp1).opsize := S_YMM;
  7740. taicpu(hp1).oper[0]^.reg := CurrentReg;
  7741. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(CurrentReg) + ' to merge a pair of memory moves (VmovdqxVmovdqxVmovdqxVmovdqx2VmovdqyVmovdqy 1)', p);
  7742. { If pi_uses_ymm is set, VZEROUPPER is present to do this for us }
  7743. if (pi_uses_ymm in current_procinfo.flags) then
  7744. RemoveInstruction(hp2)
  7745. else
  7746. begin
  7747. taicpu(hp2).opcode := A_VPXOR;
  7748. taicpu(hp2).opsize := S_YMM;
  7749. taicpu(hp2).loadreg(0, CurrentReg);
  7750. taicpu(hp2).loadreg(1, CurrentReg);
  7751. taicpu(hp2).loadreg(2, CurrentReg);
  7752. taicpu(hp2).ops := 3;
  7753. end;
  7754. RemoveInstruction(hp3);
  7755. Result := True;
  7756. Exit;
  7757. end;
  7758. end
  7759. else
  7760. begin
  7761. { See if the next references are 16 less rather than 16 greater }
  7762. Dec(SourceRef.offset, 32); { -16 the other way }
  7763. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) then
  7764. begin
  7765. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  7766. Dec(TargetRef.offset, 16); { Only 16, not 32, as it wasn't incremented unlike SourceRef }
  7767. if not RefsMightOverlap(SourceRef, TargetRef, 32) and
  7768. GetNextInstruction(hp2, hp3) and
  7769. MatchInstruction(hp3, A_MOV, [taicpu(p).opsize]) and
  7770. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  7771. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  7772. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  7773. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  7774. begin
  7775. { Update the register tracking to the new size }
  7776. AllocRegBetween(CurrentReg, hp2, hp3, UsedRegs);
  7777. { hp2 and hp3 are the starting offsets, so mod = 0 this time }
  7778. { Switch to unaligned if the memory isn't on a 32-byte boundary }
  7779. if not(
  7780. ((SourceRef.offset mod 32) = 0) and
  7781. (SourceRef.alignment >= 32) and ((SourceRef.alignment mod 32) = 0)
  7782. ) then
  7783. taicpu(hp2).opcode := A_VMOVDQU;
  7784. taicpu(hp2).opsize := S_YMM;
  7785. taicpu(hp2).oper[1]^.reg := CurrentReg;
  7786. if not (
  7787. ((TargetRef.offset mod 32) = 0) and
  7788. (TargetRef.alignment >= 32) and ((TargetRef.alignment mod 32) = 0)
  7789. ) then
  7790. taicpu(hp3).opcode := A_VMOVDQU;
  7791. taicpu(hp3).opsize := S_YMM;
  7792. taicpu(hp3).oper[0]^.reg := CurrentReg;
  7793. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(CurrentReg) + ' to merge a pair of memory moves (VmovdqxVmovdqxVmovdqxVmovdqx2VmovdqyVmovdqy 2)', p);
  7794. { If pi_uses_ymm is set, VZEROUPPER is present to do this for us }
  7795. if (pi_uses_ymm in current_procinfo.flags) then
  7796. RemoveInstruction(hp1)
  7797. else
  7798. begin
  7799. taicpu(hp1).opcode := A_VPXOR;
  7800. taicpu(hp1).opsize := S_YMM;
  7801. taicpu(hp1).loadreg(0, CurrentReg);
  7802. taicpu(hp1).loadreg(1, CurrentReg);
  7803. taicpu(hp1).loadreg(2, CurrentReg);
  7804. taicpu(hp1).ops := 3;
  7805. Asml.Remove(hp1);
  7806. Asml.InsertAfter(hp1, hp3); { Register deallocations will be after hp3 }
  7807. end;
  7808. RemoveCurrentP(p, hp2);
  7809. Result := True;
  7810. Exit;
  7811. end;
  7812. end;
  7813. end;
  7814. end;
  7815. end;
  7816. end;
  7817. function TX86AsmOptimizer.CheckJumpMovTransferOpt(var p: tai; hp1: tai; LoopCount: Integer; out Count: Integer): Boolean;
  7818. var
  7819. hp2, hp3, first_assignment: tai;
  7820. IncCount, OperIdx: Integer;
  7821. OrigLabel: TAsmLabel;
  7822. begin
  7823. Count := 0;
  7824. Result := False;
  7825. first_assignment := nil;
  7826. if (LoopCount >= 20) then
  7827. begin
  7828. { Guard against infinite loops }
  7829. Exit;
  7830. end;
  7831. if (taicpu(p).oper[0]^.typ <> top_ref) or
  7832. (taicpu(p).oper[0]^.ref^.refaddr <> addr_full) or
  7833. (taicpu(p).oper[0]^.ref^.base <> NR_NO) or
  7834. (taicpu(p).oper[0]^.ref^.index <> NR_NO) or
  7835. not (taicpu(p).oper[0]^.ref^.symbol is TAsmLabel) then
  7836. Exit;
  7837. OrigLabel := TAsmLabel(taicpu(p).oper[0]^.ref^.symbol);
  7838. {
  7839. change
  7840. jmp .L1
  7841. ...
  7842. .L1:
  7843. mov ##, ## ( multiple movs possible )
  7844. jmp/ret
  7845. into
  7846. mov ##, ##
  7847. jmp/ret
  7848. }
  7849. if not Assigned(hp1) then
  7850. begin
  7851. hp1 := GetLabelWithSym(OrigLabel);
  7852. if not Assigned(hp1) or not SkipLabels(hp1, hp1) then
  7853. Exit;
  7854. end;
  7855. hp2 := hp1;
  7856. while Assigned(hp2) do
  7857. begin
  7858. if Assigned(hp2) and (hp2.typ in [ait_label, ait_align]) then
  7859. SkipLabels(hp2,hp2);
  7860. if not Assigned(hp2) or (hp2.typ <> ait_instruction) then
  7861. Break;
  7862. case taicpu(hp2).opcode of
  7863. A_MOVSD:
  7864. begin
  7865. if taicpu(hp2).ops = 0 then
  7866. { Wrong MOVSD }
  7867. Break;
  7868. Inc(Count);
  7869. if Count >= 5 then
  7870. { Too many to be worthwhile }
  7871. Break;
  7872. GetNextInstruction(hp2, hp2);
  7873. Continue;
  7874. end;
  7875. A_MOV,
  7876. A_MOVD,
  7877. A_MOVQ,
  7878. A_MOVSX,
  7879. {$ifdef x86_64}
  7880. A_MOVSXD,
  7881. {$endif x86_64}
  7882. A_MOVZX,
  7883. A_MOVAPS,
  7884. A_MOVUPS,
  7885. A_MOVSS,
  7886. A_MOVAPD,
  7887. A_MOVUPD,
  7888. A_MOVDQA,
  7889. A_MOVDQU,
  7890. A_VMOVSS,
  7891. A_VMOVAPS,
  7892. A_VMOVUPS,
  7893. A_VMOVSD,
  7894. A_VMOVAPD,
  7895. A_VMOVUPD,
  7896. A_VMOVDQA,
  7897. A_VMOVDQU:
  7898. begin
  7899. Inc(Count);
  7900. if Count >= 5 then
  7901. { Too many to be worthwhile }
  7902. Break;
  7903. GetNextInstruction(hp2, hp2);
  7904. Continue;
  7905. end;
  7906. A_JMP:
  7907. begin
  7908. { Guard against infinite loops }
  7909. if taicpu(hp2).oper[0]^.ref^.symbol = OrigLabel then
  7910. Exit;
  7911. { Analyse this jump first in case it also duplicates assignments }
  7912. if CheckJumpMovTransferOpt(hp2, nil, LoopCount + 1, IncCount) then
  7913. begin
  7914. { Something did change! }
  7915. Result := True;
  7916. Inc(Count, IncCount);
  7917. if Count >= 5 then
  7918. begin
  7919. { Too many to be worthwhile }
  7920. Exit;
  7921. end;
  7922. if MatchInstruction(hp2, [A_JMP, A_RET], []) then
  7923. Break;
  7924. end;
  7925. Result := True;
  7926. Break;
  7927. end;
  7928. A_RET:
  7929. begin
  7930. Result := True;
  7931. Break;
  7932. end;
  7933. else
  7934. Break;
  7935. end;
  7936. end;
  7937. if Result then
  7938. begin
  7939. { A count of zero can happen when CheckJumpMovTransferOpt is called recursively }
  7940. if Count = 0 then
  7941. begin
  7942. Result := False;
  7943. Exit;
  7944. end;
  7945. hp3 := p;
  7946. DebugMsg(SPeepholeOptimization + 'Duplicated ' + debug_tostr(Count) + ' assignment(s) and redirected jump', p);
  7947. while True do
  7948. begin
  7949. if Assigned(hp1) and (hp1.typ in [ait_label, ait_align]) then
  7950. SkipLabels(hp1,hp1);
  7951. if (hp1.typ <> ait_instruction) then
  7952. InternalError(2021040720);
  7953. case taicpu(hp1).opcode of
  7954. A_JMP:
  7955. begin
  7956. { Change the original jump to the new destination }
  7957. OrigLabel.decrefs;
  7958. taicpu(hp1).oper[0]^.ref^.symbol.increfs;
  7959. taicpu(p).loadref(0, taicpu(hp1).oper[0]^.ref^);
  7960. { Set p to the first duplicated assignment so it can get optimised if needs be }
  7961. if not Assigned(first_assignment) then
  7962. InternalError(2021040810)
  7963. else
  7964. p := first_assignment;
  7965. Exit;
  7966. end;
  7967. A_RET:
  7968. begin
  7969. { Now change the jump into a RET instruction }
  7970. ConvertJumpToRET(p, hp1);
  7971. { Set p to the first duplicated assignment so it can get optimised if needs be }
  7972. if not Assigned(first_assignment) then
  7973. InternalError(2021040811)
  7974. else
  7975. p := first_assignment;
  7976. Exit;
  7977. end;
  7978. else
  7979. begin
  7980. { Duplicate the MOV instruction }
  7981. hp3:=tai(hp1.getcopy);
  7982. if first_assignment = nil then
  7983. first_assignment := hp3;
  7984. asml.InsertBefore(hp3, p);
  7985. { Make sure the compiler knows about any final registers written here }
  7986. for OperIdx := 0 to taicpu(hp3).ops - 1 do
  7987. with taicpu(hp3).oper[OperIdx]^ do
  7988. begin
  7989. case typ of
  7990. top_ref:
  7991. begin
  7992. if (ref^.base <> NR_NO) and
  7993. (getsupreg(ref^.base) <> RS_ESP) and
  7994. (getsupreg(ref^.base) <> RS_EBP)
  7995. {$ifdef x86_64} and (ref^.base <> NR_RIP) {$endif x86_64}
  7996. then
  7997. AllocRegBetween(ref^.base, hp3, tai(p.Next), UsedRegs);
  7998. if (ref^.index <> NR_NO) and
  7999. (getsupreg(ref^.index) <> RS_ESP) and
  8000. (getsupreg(ref^.index) <> RS_EBP)
  8001. {$ifdef x86_64} and (ref^.index <> NR_RIP) {$endif x86_64} and
  8002. (ref^.index <> ref^.base) then
  8003. AllocRegBetween(ref^.index, hp3, tai(p.Next), UsedRegs);
  8004. end;
  8005. top_reg:
  8006. AllocRegBetween(reg, hp3, tai(p.Next), UsedRegs);
  8007. else
  8008. ;
  8009. end;
  8010. end;
  8011. end;
  8012. end;
  8013. if not GetNextInstruction(hp1, hp1) then
  8014. { Should have dropped out earlier }
  8015. InternalError(2021040710);
  8016. end;
  8017. end;
  8018. end;
  8019. const
  8020. WriteOp: array[0..3] of set of TInsChange = (
  8021. [Ch_Wop1, Ch_RWop1, Ch_Mop1],
  8022. [Ch_Wop2, Ch_RWop2, Ch_Mop2],
  8023. [Ch_Wop3, Ch_RWop3, Ch_Mop3],
  8024. [Ch_Wop4, Ch_RWop4, Ch_Mop4]);
  8025. RegWriteFlags: array[0..7] of set of TInsChange = (
  8026. { The order is important: EAX, ECX, EDX, EBX, ESI, EDI, EBP, ESP }
  8027. [Ch_WEAX, Ch_RWEAX, Ch_MEAX{$ifdef x86_64}, Ch_WRAX, Ch_RWRAX, Ch_MRAX{$endif x86_64}],
  8028. [Ch_WECX, Ch_RWECX, Ch_MECX{$ifdef x86_64}, Ch_WRCX, Ch_RWRCX, Ch_MRCX{$endif x86_64}],
  8029. [Ch_WEDX, Ch_RWEDX, Ch_MEDX{$ifdef x86_64}, Ch_WRDX, Ch_RWRDX, Ch_MRDX{$endif x86_64}],
  8030. [Ch_WEBX, Ch_RWEBX, Ch_MEBX{$ifdef x86_64}, Ch_WRBX, Ch_RWRBX, Ch_MRBX{$endif x86_64}],
  8031. [Ch_WESI, Ch_RWESI, Ch_MESI{$ifdef x86_64}, Ch_WRSI, Ch_RWRSI, Ch_MRSI{$endif x86_64}],
  8032. [Ch_WEDI, Ch_RWEDI, Ch_MEDI{$ifdef x86_64}, Ch_WRDI, Ch_RWRDI, Ch_MRDI{$endif x86_64}],
  8033. [Ch_WEBP, Ch_RWEBP, Ch_MEBP{$ifdef x86_64}, Ch_WRBP, Ch_RWRBP, Ch_MRBP{$endif x86_64}],
  8034. [Ch_WESP, Ch_RWESP, Ch_MESP{$ifdef x86_64}, Ch_WRSP, Ch_RWRSP, Ch_MRSP{$endif x86_64}]);
  8035. function TX86AsmOptimizer.TrySwapMovOp(var p, hp1: tai): Boolean;
  8036. var
  8037. hp2: tai;
  8038. X: Integer;
  8039. begin
  8040. { If we have something like:
  8041. op ###,###
  8042. mov ###,###
  8043. Try to move the MOV instruction to before OP as long as OP and MOV don't
  8044. interfere in regards to what they write to.
  8045. NOTE: p must be a 2-operand instruction
  8046. }
  8047. Result := False;
  8048. if (hp1.typ <> ait_instruction) or
  8049. taicpu(hp1).is_jmp or
  8050. RegInInstruction(NR_DEFAULTFLAGS, hp1) then
  8051. Exit;
  8052. { NOP is a pipeline fence, likely marking the beginning of the function
  8053. epilogue, so drop out. Similarly, drop out if POP or RET are
  8054. encountered }
  8055. if MatchInstruction(hp1, A_NOP, A_POP, A_RET, []) then
  8056. Exit;
  8057. if (taicpu(hp1).opcode = A_MOVSD) and
  8058. (taicpu(hp1).ops = 0) then
  8059. { Wrong MOVSD }
  8060. Exit;
  8061. { Check for writes to specific registers first }
  8062. { EAX, ECX, EDX, EBX, ESI, EDI, EBP, ESP in that order }
  8063. for X := 0 to 7 do
  8064. if (RegWriteFlags[X] * InsProp[taicpu(hp1).opcode].Ch <> [])
  8065. and RegInInstruction(newreg(R_INTREGISTER, TSuperRegister(X), R_SUBWHOLE), p) then
  8066. Exit;
  8067. for X := 0 to taicpu(hp1).ops - 1 do
  8068. begin
  8069. { Check to see if this operand writes to something }
  8070. if ((WriteOp[X] * InsProp[taicpu(hp1).opcode].Ch) <> []) and
  8071. { And matches something in the CMP/TEST instruction }
  8072. (
  8073. MatchOperand(taicpu(hp1).oper[X]^, taicpu(p).oper[0]^) or
  8074. MatchOperand(taicpu(hp1).oper[X]^, taicpu(p).oper[1]^) or
  8075. (
  8076. { If it's a register, make sure the register written to doesn't
  8077. appear in the cmp instruction as part of a reference }
  8078. (taicpu(hp1).oper[X]^.typ = top_reg) and
  8079. RegInInstruction(taicpu(hp1).oper[X]^.reg, p)
  8080. )
  8081. ) then
  8082. Exit;
  8083. end;
  8084. { Check p to make sure it doesn't write to something that affects hp1 }
  8085. { Check for writes to specific registers first }
  8086. { EAX, ECX, EDX, EBX, ESI, EDI, EBP, ESP in that order }
  8087. for X := 0 to 7 do
  8088. if (RegWriteFlags[X] * InsProp[taicpu(p).opcode].Ch <> [])
  8089. and RegInInstruction(newreg(R_INTREGISTER, TSuperRegister(X), R_SUBWHOLE), hp1) then
  8090. Exit;
  8091. for X := 0 to taicpu(p).ops - 1 do
  8092. begin
  8093. { Check to see if this operand writes to something }
  8094. if ((WriteOp[X] * InsProp[taicpu(p).opcode].Ch) <> []) and
  8095. { And matches something in hp1 }
  8096. (taicpu(p).oper[X]^.typ = top_reg) and
  8097. RegInInstruction(taicpu(p).oper[X]^.reg, hp1) then
  8098. Exit;
  8099. end;
  8100. { The instruction can be safely moved }
  8101. asml.Remove(hp1);
  8102. { Try to insert after the last instructions where the FLAGS register is not
  8103. yet in use, so "mov $0,%reg" can be optimised into "xor %reg,%reg" later }
  8104. if SetAndTest(FindRegAllocBackward(NR_DEFAULTFLAGS, tai(p.Previous)), hp2) then
  8105. asml.InsertBefore(hp1, hp2)
  8106. { Failing that, try to insert after the last instructions where the
  8107. FLAGS register is not yet in use }
  8108. else if GetLastInstruction(p, hp2) and
  8109. (
  8110. (hp2.typ <> ait_instruction) or
  8111. { Don't insert after an instruction that uses the flags when p doesn't use them }
  8112. RegInInstruction(NR_DEFAULTFLAGS, p) or
  8113. not RegInInstruction(NR_DEFAULTFLAGS, hp2)
  8114. ) then
  8115. asml.InsertAfter(hp1, hp2)
  8116. else
  8117. { Note, if p.Previous is nil (even if it should logically never be the
  8118. case), FindRegAllocBackward immediately exits with False and so we
  8119. safely land here (we can't just pass p because FindRegAllocBackward
  8120. immediately exits on an instruction). [Kit] }
  8121. asml.InsertBefore(hp1, p);
  8122. DebugMsg(SPeepholeOptimization + 'Swapped ' + debug_op2str(taicpu(p).opcode) + ' and ' + debug_op2str(taicpu(hp1).opcode) + ' instructions to improve optimisation potential', hp1);
  8123. { We can't trust UsedRegs because we're looking backwards, although we
  8124. know the registers are allocated after p at the very least, so manually
  8125. create tai_regalloc objects if needed }
  8126. for X := 0 to taicpu(hp1).ops - 1 do
  8127. case taicpu(hp1).oper[X]^.typ of
  8128. top_reg:
  8129. begin
  8130. asml.InsertBefore(tai_regalloc.alloc(taicpu(hp1).oper[X]^.reg, nil), hp1);
  8131. IncludeRegInUsedRegs(taicpu(hp1).oper[X]^.reg, UsedRegs);
  8132. AllocRegBetween(taicpu(hp1).oper[X]^.reg, hp1, p, UsedRegs);
  8133. end;
  8134. top_ref:
  8135. begin
  8136. if taicpu(hp1).oper[X]^.ref^.base <> NR_NO then
  8137. begin
  8138. asml.InsertBefore(tai_regalloc.alloc(taicpu(hp1).oper[X]^.ref^.base, nil), hp1);
  8139. IncludeRegInUsedRegs(taicpu(hp1).oper[X]^.ref^.base, UsedRegs);
  8140. AllocRegBetween(taicpu(hp1).oper[X]^.ref^.base, hp1, p, UsedRegs);
  8141. end;
  8142. if taicpu(hp1).oper[X]^.ref^.index <> NR_NO then
  8143. begin
  8144. asml.InsertBefore(tai_regalloc.alloc(taicpu(hp1).oper[X]^.ref^.index, nil), hp1);
  8145. IncludeRegInUsedRegs(taicpu(hp1).oper[X]^.ref^.index, UsedRegs);
  8146. AllocRegBetween(taicpu(hp1).oper[X]^.ref^.index, hp1, p, UsedRegs);
  8147. end;
  8148. end;
  8149. else
  8150. ;
  8151. end;
  8152. Result := True;
  8153. end;
  8154. function TX86AsmOptimizer.TrySwapMovCmp(var p, hp1: tai): Boolean;
  8155. var
  8156. hp2: tai;
  8157. X: Integer;
  8158. begin
  8159. { If we have something like:
  8160. cmp ###,%reg1
  8161. mov 0,%reg2
  8162. And no modified registers are shared, move the instruction to before
  8163. the comparison as this means it can be optimised without worrying
  8164. about the FLAGS register. (CMP/MOV is generated by
  8165. "J(c)Mov1JmpMov0 -> Set(~c)", among other things).
  8166. As long as the second instruction doesn't use the flags or one of the
  8167. registers used by CMP or TEST (also check any references that use the
  8168. registers), then it can be moved prior to the comparison.
  8169. }
  8170. Result := False;
  8171. if not TrySwapMovOp(p, hp1) then
  8172. Exit;
  8173. if taicpu(hp1).opcode = A_LEA then
  8174. { The flags will be overwritten by the CMP/TEST instruction }
  8175. ConvertLEA(taicpu(hp1));
  8176. Result := True;
  8177. { Can we move it one further back? }
  8178. if GetLastInstruction(hp1, hp2) and (hp2.typ = ait_instruction) and
  8179. { Check to see if CMP/TEST is a comparison against zero }
  8180. (
  8181. (
  8182. (taicpu(p).opcode = A_CMP) and
  8183. MatchOperand(taicpu(p).oper[0]^, 0)
  8184. ) or
  8185. (
  8186. (taicpu(p).opcode = A_TEST) and
  8187. (
  8188. OpsEqual(taicpu(p).oper[0]^, taicpu(p).oper[1]^) or
  8189. MatchOperand(taicpu(p).oper[0]^, -1)
  8190. )
  8191. )
  8192. ) and
  8193. { These instructions set the zero flag if the result is zero }
  8194. MatchInstruction(hp2, [A_ADD, A_SUB, A_OR, A_XOR, A_AND, A_POPCNT, A_LZCNT], []) and
  8195. OpsEqual(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^) then
  8196. { Looks like we can - if successful, this benefits PostPeepholeOptTestOr }
  8197. TrySwapMovOp(hp2, hp1);
  8198. end;
  8199. function TX86AsmOptimizer.OptPass2MOV(var p : tai) : boolean;
  8200. function IsXCHGAcceptable: Boolean; inline;
  8201. begin
  8202. { Always accept if optimising for size }
  8203. Result := (cs_opt_size in current_settings.optimizerswitches) or
  8204. { From the Pentium M onwards, XCHG only has a latency of 2 rather
  8205. than 3, so it becomes a saving compared to three MOVs with two of
  8206. them able to execute simultaneously. [Kit] }
  8207. (CPUX86_HINT_FAST_XCHG in cpu_optimization_hints[current_settings.optimizecputype]);
  8208. end;
  8209. var
  8210. NewRef: TReference;
  8211. hp1, hp2, hp3, hp4: Tai;
  8212. {$ifndef x86_64}
  8213. OperIdx: Integer;
  8214. {$endif x86_64}
  8215. NewInstr : Taicpu;
  8216. NewAligh : Tai_align;
  8217. DestLabel: TAsmLabel;
  8218. TempTracking: TAllUsedRegs;
  8219. function TryMovArith2Lea(InputInstr: tai): Boolean;
  8220. var
  8221. NextInstr: tai;
  8222. begin
  8223. Result := False;
  8224. UpdateUsedRegs(TmpUsedRegs, tai(InputInstr.Next));
  8225. if not GetNextInstruction(InputInstr, NextInstr) or
  8226. (
  8227. { The FLAGS register isn't always tracked properly, so do not
  8228. perform this optimisation if a conditional statement follows }
  8229. not RegReadByInstruction(NR_DEFAULTFLAGS, NextInstr) and
  8230. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, NextInstr, TmpUsedRegs)
  8231. ) then
  8232. begin
  8233. reference_reset(NewRef, 1, []);
  8234. NewRef.base := taicpu(p).oper[0]^.reg;
  8235. NewRef.scalefactor := 1;
  8236. if taicpu(InputInstr).opcode = A_ADD then
  8237. begin
  8238. DebugMsg(SPeepholeOptimization + 'MovAdd2Lea', p);
  8239. NewRef.offset := taicpu(InputInstr).oper[0]^.val;
  8240. end
  8241. else
  8242. begin
  8243. DebugMsg(SPeepholeOptimization + 'MovSub2Lea', p);
  8244. NewRef.offset := -taicpu(InputInstr).oper[0]^.val;
  8245. end;
  8246. taicpu(p).opcode := A_LEA;
  8247. taicpu(p).loadref(0, NewRef);
  8248. RemoveInstruction(InputInstr);
  8249. Result := True;
  8250. end;
  8251. end;
  8252. begin
  8253. Result:=false;
  8254. { This optimisation adds an instruction, so only do it for speed }
  8255. if not (cs_opt_size in current_settings.optimizerswitches) and
  8256. MatchOpType(taicpu(p), top_const, top_reg) and
  8257. (taicpu(p).oper[0]^.val = 0) then
  8258. begin
  8259. { To avoid compiler warning }
  8260. DestLabel := nil;
  8261. if (p.typ <> ait_instruction) or (taicpu(p).oper[1]^.typ <> top_reg) then
  8262. InternalError(2021040750);
  8263. if not GetNextInstructionUsingReg(p, hp1, taicpu(p).oper[1]^.reg) then
  8264. Exit;
  8265. case hp1.typ of
  8266. ait_align,
  8267. ait_label:
  8268. begin
  8269. { Change:
  8270. mov $0,%reg mov $0,%reg
  8271. @Lbl1: @Lbl1:
  8272. test %reg,%reg / cmp $0,%reg test %reg,%reg / mov $0,%reg
  8273. je @Lbl2 jne @Lbl2
  8274. To: To:
  8275. mov $0,%reg mov $0,%reg
  8276. jmp @Lbl2 jmp @Lbl3
  8277. (align) (align)
  8278. @Lbl1: @Lbl1:
  8279. test %reg,%reg / cmp $0,%reg test %reg,%reg / cmp $0,%reg
  8280. je @Lbl2 je @Lbl2
  8281. @Lbl3: <-- Only if label exists
  8282. (Not if it's optimised for size)
  8283. }
  8284. if not SkipAligns(hp1, hp1) or not GetNextInstruction(hp1, hp2) then
  8285. Exit;
  8286. if (hp2.typ = ait_instruction) and
  8287. (
  8288. { Register sizes must exactly match }
  8289. (
  8290. (taicpu(hp2).opcode = A_CMP) and
  8291. MatchOperand(taicpu(hp2).oper[0]^, 0) and
  8292. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^.reg)
  8293. ) or (
  8294. (taicpu(hp2).opcode = A_TEST) and
  8295. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[1]^.reg) and
  8296. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^.reg)
  8297. )
  8298. ) and GetNextInstruction(hp2, hp3) and
  8299. (hp3.typ = ait_instruction) and
  8300. (taicpu(hp3).opcode = A_JCC) and
  8301. (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
  8302. (taicpu(hp3).oper[0]^.ref^.index=NR_NO) and (taicpu(hp3).oper[0]^.ref^.symbol is tasmlabel) then
  8303. begin
  8304. { Check condition of jump }
  8305. { Always true? }
  8306. if condition_in(C_E, taicpu(hp3).condition) then
  8307. begin
  8308. { Copy label symbol and obtain matching label entry for the
  8309. conditional jump, as this will be our destination}
  8310. DestLabel := tasmlabel(taicpu(hp3).oper[0]^.ref^.symbol);
  8311. DebugMsg(SPeepholeOptimization + 'Mov0LblCmp0Je -> Mov0JmpLblCmp0Je', p);
  8312. Result := True;
  8313. end
  8314. { Always false? }
  8315. else if condition_in(C_NE, taicpu(hp3).condition) and GetNextInstruction(hp3, hp2) then
  8316. begin
  8317. { This is only worth it if there's a jump to take }
  8318. case hp2.typ of
  8319. ait_instruction:
  8320. begin
  8321. if taicpu(hp2).opcode = A_JMP then
  8322. begin
  8323. DestLabel := tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol);
  8324. { An unconditional jump follows the conditional jump which will always be false,
  8325. so use this jump's destination for the new jump }
  8326. DebugMsg(SPeepholeOptimization + 'Mov0LblCmp0Jne -> Mov0JmpLblCmp0Jne (with JMP)', p);
  8327. Result := True;
  8328. end
  8329. else if taicpu(hp2).opcode = A_JCC then
  8330. begin
  8331. DestLabel := tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol);
  8332. if condition_in(C_E, taicpu(hp2).condition) then
  8333. begin
  8334. { A second conditional jump follows the conditional jump which will always be false,
  8335. while the second jump is always True, so use this jump's destination for the new jump }
  8336. DebugMsg(SPeepholeOptimization + 'Mov0LblCmp0Jne -> Mov0JmpLblCmp0Jne (with second Jcc)', p);
  8337. Result := True;
  8338. end;
  8339. { Don't risk it if the jump isn't always true (Result remains False) }
  8340. end;
  8341. end;
  8342. else
  8343. { If anything else don't optimise };
  8344. end;
  8345. end;
  8346. if Result then
  8347. begin
  8348. { Just so we have something to insert as a paremeter}
  8349. reference_reset(NewRef, 1, []);
  8350. NewInstr := taicpu.op_ref(A_JMP, S_NO, NewRef);
  8351. { Now actually load the correct parameter (this also
  8352. increases the reference count) }
  8353. NewInstr.loadsymbol(0, DestLabel, 0);
  8354. if (cs_opt_level3 in current_settings.optimizerswitches) then
  8355. begin
  8356. { Get instruction before original label (may not be p under -O3) }
  8357. if not GetLastInstruction(hp1, hp2) then
  8358. { Shouldn't fail here }
  8359. InternalError(2021040701);
  8360. { Before the aligns too }
  8361. while (hp2.typ = ait_align) do
  8362. if not GetLastInstruction(hp2, hp2) then
  8363. { Shouldn't fail here }
  8364. InternalError(2021040702);
  8365. end
  8366. else
  8367. hp2 := p;
  8368. taicpu(NewInstr).fileinfo := taicpu(hp2).fileinfo;
  8369. AsmL.InsertAfter(NewInstr, hp2);
  8370. { Add new alignment field }
  8371. (* AsmL.InsertAfter(
  8372. cai_align.create_max(
  8373. current_settings.alignment.jumpalign,
  8374. current_settings.alignment.jumpalignskipmax
  8375. ),
  8376. NewInstr
  8377. ); *)
  8378. end;
  8379. Exit;
  8380. end;
  8381. end;
  8382. else
  8383. ;
  8384. end;
  8385. end;
  8386. if not GetNextInstruction(p, hp1) then
  8387. Exit;
  8388. if MatchInstruction(hp1, A_CMP, A_TEST, [taicpu(p).opsize])
  8389. and DoMovCmpMemOpt(p, hp1, True) then
  8390. begin
  8391. Result := True;
  8392. Exit;
  8393. end
  8394. else if MatchInstruction(hp1, A_JMP, [S_NO]) then
  8395. begin
  8396. { Sometimes the MOVs that OptPass2JMP produces can be improved
  8397. further, but we can't just put this jump optimisation in pass 1
  8398. because it tends to perform worse when conditional jumps are
  8399. nearby (e.g. when converting CMOV instructions). [Kit] }
  8400. CopyUsedRegs(TempTracking);
  8401. UpdateUsedRegs(tai(p.Next));
  8402. if OptPass2JMP(hp1) then
  8403. { call OptPass1MOV once to potentially merge any MOVs that were created }
  8404. Result := OptPass1MOV(p);
  8405. { OptPass2MOV will now exit but will be called again if OptPass1MOV
  8406. returned True and the instruction is still a MOV, thus checking
  8407. the optimisations below }
  8408. { If OptPass2JMP returned False, no optimisations were done to
  8409. the jump and there are no further optimisations that can be done
  8410. to the MOV instruction on this pass }
  8411. { Restore register state }
  8412. RestoreUsedRegs(TempTracking);
  8413. ReleaseUsedRegs(TempTracking);
  8414. end
  8415. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8416. (taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) and
  8417. MatchInstruction(hp1,A_ADD,A_SUB,[taicpu(p).opsize]) and
  8418. (taicpu(hp1).oper[1]^.typ = top_reg) and
  8419. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  8420. begin
  8421. { Change:
  8422. movl/q %reg1,%reg2 movl/q %reg1,%reg2
  8423. addl/q $x,%reg2 subl/q $x,%reg2
  8424. To:
  8425. leal/q x(%reg1),%reg2 leal/q -x(%reg1),%reg2
  8426. }
  8427. if (taicpu(hp1).oper[0]^.typ = top_const) and
  8428. { be lazy, checking separately for sub would be slightly better }
  8429. (abs(taicpu(hp1).oper[0]^.val)<=$7fffffff) then
  8430. begin
  8431. TransferUsedRegs(TmpUsedRegs);
  8432. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8433. if TryMovArith2Lea(hp1) then
  8434. begin
  8435. Result := True;
  8436. Exit;
  8437. end
  8438. end
  8439. else if not RegInOp(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^) and
  8440. GetNextInstructionUsingReg(hp1, hp2, taicpu(p).oper[1]^.reg) and
  8441. { Same as above, but also adds or subtracts to %reg2 in between.
  8442. It's still valid as long as the flags aren't in use }
  8443. MatchInstruction(hp2,A_ADD,A_SUB,[taicpu(p).opsize]) and
  8444. MatchOpType(taicpu(hp2), top_const, top_reg) and
  8445. (taicpu(hp2).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  8446. { be lazy, checking separately for sub would be slightly better }
  8447. (abs(taicpu(hp2).oper[0]^.val)<=$7fffffff) then
  8448. begin
  8449. TransferUsedRegs(TmpUsedRegs);
  8450. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8451. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  8452. if TryMovArith2Lea(hp2) then
  8453. begin
  8454. Result := True;
  8455. Exit;
  8456. end;
  8457. end;
  8458. end
  8459. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8460. {$ifdef x86_64}
  8461. MatchInstruction(hp1,A_MOVZX,A_MOVSX,A_MOVSXD,[]) and
  8462. {$else x86_64}
  8463. MatchInstruction(hp1,A_MOVZX,A_MOVSX,[]) and
  8464. {$endif x86_64}
  8465. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  8466. (taicpu(hp1).oper[0]^.reg = taicpu(p).oper[1]^.reg) then
  8467. { mov reg1, reg2 mov reg1, reg2
  8468. movzx/sx reg2, reg3 to movzx/sx reg1, reg3}
  8469. begin
  8470. taicpu(hp1).oper[0]^.reg := taicpu(p).oper[0]^.reg;
  8471. DebugMsg(SPeepholeOptimization + 'mov %reg1,%reg2; movzx/sx %reg2,%reg3 -> mov %reg1,%reg2;movzx/sx %reg1,%reg3',p);
  8472. { Don't remove the MOV command without first checking that reg2 isn't used afterwards,
  8473. or unless supreg(reg3) = supreg(reg2)). [Kit] }
  8474. TransferUsedRegs(TmpUsedRegs);
  8475. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  8476. if (getsupreg(taicpu(p).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) or
  8477. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs)
  8478. then
  8479. begin
  8480. RemoveCurrentP(p, hp1);
  8481. Result:=true;
  8482. end;
  8483. exit;
  8484. end
  8485. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8486. IsXCHGAcceptable and
  8487. { XCHG doesn't support 8-byte registers }
  8488. (taicpu(p).opsize <> S_B) and
  8489. MatchInstruction(hp1, A_MOV, []) and
  8490. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  8491. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[0]^.reg) and
  8492. GetNextInstruction(hp1, hp2) and
  8493. MatchInstruction(hp2, A_MOV, []) and
  8494. { Don't need to call MatchOpType for hp2 because the operand matches below cover for it }
  8495. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[1]^.reg) and
  8496. MatchOperand(taicpu(hp2).oper[1]^, taicpu(hp1).oper[0]^.reg) then
  8497. begin
  8498. { mov %reg1,%reg2
  8499. mov %reg3,%reg1 -> xchg %reg3,%reg1
  8500. mov %reg2,%reg3
  8501. (%reg2 not used afterwards)
  8502. Note that xchg takes 3 cycles to execute, and generally mov's take
  8503. only one cycle apiece, but the first two mov's can be executed in
  8504. parallel, only taking 2 cycles overall. Older processors should
  8505. therefore only optimise for size. [Kit]
  8506. }
  8507. TransferUsedRegs(TmpUsedRegs);
  8508. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8509. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  8510. if not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp2, TmpUsedRegs) then
  8511. begin
  8512. DebugMsg(SPeepholeOptimization + 'MovMovMov2XChg', p);
  8513. AllocRegBetween(taicpu(hp2).oper[1]^.reg, p, hp1, UsedRegs);
  8514. taicpu(hp1).opcode := A_XCHG;
  8515. RemoveCurrentP(p, hp1);
  8516. RemoveInstruction(hp2);
  8517. Result := True;
  8518. Exit;
  8519. end;
  8520. end
  8521. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8522. MatchInstruction(hp1, A_SAR, []) then
  8523. begin
  8524. if MatchOperand(taicpu(hp1).oper[0]^, 31) then
  8525. begin
  8526. { the use of %edx also covers the opsize being S_L }
  8527. if MatchOperand(taicpu(hp1).oper[1]^, NR_EDX) then
  8528. begin
  8529. { Note it has to be specifically "movl %eax,%edx", and those specific sub-registers }
  8530. if (taicpu(p).oper[0]^.reg = NR_EAX) and
  8531. (taicpu(p).oper[1]^.reg = NR_EDX) then
  8532. begin
  8533. { Change:
  8534. movl %eax,%edx
  8535. sarl $31,%edx
  8536. To:
  8537. cltd
  8538. }
  8539. DebugMsg(SPeepholeOptimization + 'MovSar2Cltd', p);
  8540. RemoveInstruction(hp1);
  8541. taicpu(p).opcode := A_CDQ;
  8542. taicpu(p).opsize := S_NO;
  8543. taicpu(p).clearop(1);
  8544. taicpu(p).clearop(0);
  8545. taicpu(p).ops:=0;
  8546. Result := True;
  8547. end
  8548. else if (cs_opt_size in current_settings.optimizerswitches) and
  8549. (taicpu(p).oper[0]^.reg = NR_EDX) and
  8550. (taicpu(p).oper[1]^.reg = NR_EAX) then
  8551. begin
  8552. { Change:
  8553. movl %edx,%eax
  8554. sarl $31,%edx
  8555. To:
  8556. movl %edx,%eax
  8557. cltd
  8558. Note that this creates a dependency between the two instructions,
  8559. so only perform if optimising for size.
  8560. }
  8561. DebugMsg(SPeepholeOptimization + 'MovSar2MovCltd', p);
  8562. taicpu(hp1).opcode := A_CDQ;
  8563. taicpu(hp1).opsize := S_NO;
  8564. taicpu(hp1).clearop(1);
  8565. taicpu(hp1).clearop(0);
  8566. taicpu(hp1).ops:=0;
  8567. end;
  8568. {$ifndef x86_64}
  8569. end
  8570. { Don't bother if CMOV is supported, because a more optimal
  8571. sequence would have been generated for the Abs() intrinsic }
  8572. else if not(CPUX86_HAS_CMOV in cpu_capabilities[current_settings.cputype]) and
  8573. { the use of %eax also covers the opsize being S_L }
  8574. MatchOperand(taicpu(hp1).oper[1]^, NR_EAX) and
  8575. (taicpu(p).oper[0]^.reg = NR_EAX) and
  8576. (taicpu(p).oper[1]^.reg = NR_EDX) and
  8577. GetNextInstruction(hp1, hp2) and
  8578. MatchInstruction(hp2, A_XOR, [S_L]) and
  8579. MatchOperand(taicpu(hp2).oper[0]^, NR_EAX) and
  8580. MatchOperand(taicpu(hp2).oper[1]^, NR_EDX) and
  8581. GetNextInstruction(hp2, hp3) and
  8582. MatchInstruction(hp3, A_SUB, [S_L]) and
  8583. MatchOperand(taicpu(hp3).oper[0]^, NR_EAX) and
  8584. MatchOperand(taicpu(hp3).oper[1]^, NR_EDX) then
  8585. begin
  8586. { Change:
  8587. movl %eax,%edx
  8588. sarl $31,%eax
  8589. xorl %eax,%edx
  8590. subl %eax,%edx
  8591. (Instruction that uses %edx)
  8592. (%eax deallocated)
  8593. (%edx deallocated)
  8594. To:
  8595. cltd
  8596. xorl %edx,%eax <-- Note the registers have swapped
  8597. subl %edx,%eax
  8598. (Instruction that uses %eax) <-- %eax rather than %edx
  8599. }
  8600. TransferUsedRegs(TmpUsedRegs);
  8601. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8602. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  8603. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  8604. if not RegUsedAfterInstruction(NR_EAX, hp3, TmpUsedRegs) then
  8605. begin
  8606. if GetNextInstruction(hp3, hp4) and
  8607. not RegModifiedByInstruction(NR_EDX, hp4) and
  8608. not RegUsedAfterInstruction(NR_EDX, hp4, TmpUsedRegs) then
  8609. begin
  8610. DebugMsg(SPeepholeOptimization + 'abs() intrinsic optimisation', p);
  8611. taicpu(p).opcode := A_CDQ;
  8612. taicpu(p).clearop(1);
  8613. taicpu(p).clearop(0);
  8614. taicpu(p).ops:=0;
  8615. RemoveInstruction(hp1);
  8616. taicpu(hp2).loadreg(0, NR_EDX);
  8617. taicpu(hp2).loadreg(1, NR_EAX);
  8618. taicpu(hp3).loadreg(0, NR_EDX);
  8619. taicpu(hp3).loadreg(1, NR_EAX);
  8620. AllocRegBetween(NR_EAX, hp3, hp4, TmpUsedRegs);
  8621. { Convert references in the following instruction (hp4) from %edx to %eax }
  8622. for OperIdx := 0 to taicpu(hp4).ops - 1 do
  8623. with taicpu(hp4).oper[OperIdx]^ do
  8624. case typ of
  8625. top_reg:
  8626. if getsupreg(reg) = RS_EDX then
  8627. reg := newreg(R_INTREGISTER,RS_EAX,getsubreg(reg));
  8628. top_ref:
  8629. begin
  8630. if getsupreg(reg) = RS_EDX then
  8631. ref^.base := newreg(R_INTREGISTER,RS_EAX,getsubreg(reg));
  8632. if getsupreg(reg) = RS_EDX then
  8633. ref^.index := newreg(R_INTREGISTER,RS_EAX,getsubreg(reg));
  8634. end;
  8635. else
  8636. ;
  8637. end;
  8638. end;
  8639. end;
  8640. {$else x86_64}
  8641. end;
  8642. end
  8643. else if MatchOperand(taicpu(hp1).oper[0]^, 63) and
  8644. { the use of %rdx also covers the opsize being S_Q }
  8645. MatchOperand(taicpu(hp1).oper[1]^, NR_RDX) then
  8646. begin
  8647. { Note it has to be specifically "movq %rax,%rdx", and those specific sub-registers }
  8648. if (taicpu(p).oper[0]^.reg = NR_RAX) and
  8649. (taicpu(p).oper[1]^.reg = NR_RDX) then
  8650. begin
  8651. { Change:
  8652. movq %rax,%rdx
  8653. sarq $63,%rdx
  8654. To:
  8655. cqto
  8656. }
  8657. DebugMsg(SPeepholeOptimization + 'MovSar2Cqto', p);
  8658. RemoveInstruction(hp1);
  8659. taicpu(p).opcode := A_CQO;
  8660. taicpu(p).opsize := S_NO;
  8661. taicpu(p).clearop(1);
  8662. taicpu(p).clearop(0);
  8663. taicpu(p).ops:=0;
  8664. Result := True;
  8665. end
  8666. else if (cs_opt_size in current_settings.optimizerswitches) and
  8667. (taicpu(p).oper[0]^.reg = NR_RDX) and
  8668. (taicpu(p).oper[1]^.reg = NR_RAX) then
  8669. begin
  8670. { Change:
  8671. movq %rdx,%rax
  8672. sarq $63,%rdx
  8673. To:
  8674. movq %rdx,%rax
  8675. cqto
  8676. Note that this creates a dependency between the two instructions,
  8677. so only perform if optimising for size.
  8678. }
  8679. DebugMsg(SPeepholeOptimization + 'MovSar2MovCqto', p);
  8680. taicpu(hp1).opcode := A_CQO;
  8681. taicpu(hp1).opsize := S_NO;
  8682. taicpu(hp1).clearop(1);
  8683. taicpu(hp1).clearop(0);
  8684. taicpu(hp1).ops:=0;
  8685. {$endif x86_64}
  8686. end;
  8687. end;
  8688. end
  8689. else if MatchInstruction(hp1, A_MOV, []) and
  8690. (taicpu(hp1).oper[1]^.typ = top_reg) then
  8691. { Though "GetNextInstruction" could be factored out, along with
  8692. the instructions that depend on hp2, it is an expensive call that
  8693. should be delayed for as long as possible, hence we do cheaper
  8694. checks first that are likely to be False. [Kit] }
  8695. begin
  8696. if (
  8697. (
  8698. MatchOperand(taicpu(p).oper[1]^, NR_EDX) and
  8699. (taicpu(hp1).oper[1]^.reg = NR_EAX) and
  8700. (
  8701. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8702. MatchOperand(taicpu(hp1).oper[0]^, NR_EDX)
  8703. )
  8704. ) or
  8705. (
  8706. MatchOperand(taicpu(p).oper[1]^, NR_EAX) and
  8707. (taicpu(hp1).oper[1]^.reg = NR_EDX) and
  8708. (
  8709. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8710. MatchOperand(taicpu(hp1).oper[0]^, NR_EAX)
  8711. )
  8712. )
  8713. ) and
  8714. GetNextInstruction(hp1, hp2) and
  8715. MatchInstruction(hp2, A_SAR, []) and
  8716. MatchOperand(taicpu(hp2).oper[0]^, 31) then
  8717. begin
  8718. if MatchOperand(taicpu(hp2).oper[1]^, NR_EDX) then
  8719. begin
  8720. { Change:
  8721. movl r/m,%edx movl r/m,%eax movl r/m,%edx movl r/m,%eax
  8722. movl %edx,%eax or movl %eax,%edx or movl r/m,%eax or movl r/m,%edx
  8723. sarl $31,%edx sarl $31,%edx sarl $31,%edx sarl $31,%edx
  8724. To:
  8725. movl r/m,%eax <- Note the change in register
  8726. cltd
  8727. }
  8728. DebugMsg(SPeepholeOptimization + 'MovMovSar2MovCltd', p);
  8729. AllocRegBetween(NR_EAX, p, hp1, UsedRegs);
  8730. taicpu(p).loadreg(1, NR_EAX);
  8731. taicpu(hp1).opcode := A_CDQ;
  8732. taicpu(hp1).clearop(1);
  8733. taicpu(hp1).clearop(0);
  8734. taicpu(hp1).ops:=0;
  8735. RemoveInstruction(hp2);
  8736. (*
  8737. {$ifdef x86_64}
  8738. end
  8739. else if MatchOperand(taicpu(hp2).oper[1]^, NR_RDX) and
  8740. { This code sequence does not get generated - however it might become useful
  8741. if and when 128-bit signed integer types make an appearance, so the code
  8742. is kept here for when it is eventually needed. [Kit] }
  8743. (
  8744. (
  8745. (taicpu(hp1).oper[1]^.reg = NR_RAX) and
  8746. (
  8747. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8748. MatchOperand(taicpu(hp1).oper[0]^, NR_RDX)
  8749. )
  8750. ) or
  8751. (
  8752. (taicpu(hp1).oper[1]^.reg = NR_RDX) and
  8753. (
  8754. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8755. MatchOperand(taicpu(hp1).oper[0]^, NR_RAX)
  8756. )
  8757. )
  8758. ) and
  8759. GetNextInstruction(hp1, hp2) and
  8760. MatchInstruction(hp2, A_SAR, [S_Q]) and
  8761. MatchOperand(taicpu(hp2).oper[0]^, 63) and
  8762. MatchOperand(taicpu(hp2).oper[1]^, NR_RDX) then
  8763. begin
  8764. { Change:
  8765. movq r/m,%rdx movq r/m,%rax movq r/m,%rdx movq r/m,%rax
  8766. movq %rdx,%rax or movq %rax,%rdx or movq r/m,%rax or movq r/m,%rdx
  8767. sarq $63,%rdx sarq $63,%rdx sarq $63,%rdx sarq $63,%rdx
  8768. To:
  8769. movq r/m,%rax <- Note the change in register
  8770. cqto
  8771. }
  8772. DebugMsg(SPeepholeOptimization + 'MovMovSar2MovCqto', p);
  8773. AllocRegBetween(NR_RAX, p, hp1, UsedRegs);
  8774. taicpu(p).loadreg(1, NR_RAX);
  8775. taicpu(hp1).opcode := A_CQO;
  8776. taicpu(hp1).clearop(1);
  8777. taicpu(hp1).clearop(0);
  8778. taicpu(hp1).ops:=0;
  8779. RemoveInstruction(hp2);
  8780. {$endif x86_64}
  8781. *)
  8782. end;
  8783. end;
  8784. {$ifdef x86_64}
  8785. end
  8786. else if (taicpu(p).opsize = S_L) and
  8787. (taicpu(p).oper[1]^.typ = top_reg) and
  8788. (
  8789. MatchInstruction(hp1, A_MOV,[]) and
  8790. (taicpu(hp1).opsize = S_L) and
  8791. (taicpu(hp1).oper[1]^.typ = top_reg)
  8792. ) and (
  8793. GetNextInstruction(hp1, hp2) and
  8794. (tai(hp2).typ=ait_instruction) and
  8795. (taicpu(hp2).opsize = S_Q) and
  8796. (
  8797. (
  8798. MatchInstruction(hp2, A_ADD,[]) and
  8799. (taicpu(hp2).opsize = S_Q) and
  8800. (taicpu(hp2).oper[0]^.typ = top_reg) and (taicpu(hp2).oper[1]^.typ = top_reg) and
  8801. (
  8802. (
  8803. (getsupreg(taicpu(hp2).oper[0]^.reg) = getsupreg(taicpu(p).oper[1]^.reg)) and
  8804. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg))
  8805. ) or (
  8806. (getsupreg(taicpu(hp2).oper[0]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) and
  8807. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(p).oper[1]^.reg))
  8808. )
  8809. )
  8810. ) or (
  8811. MatchInstruction(hp2, A_LEA,[]) and
  8812. (taicpu(hp2).oper[0]^.ref^.offset = 0) and
  8813. (taicpu(hp2).oper[0]^.ref^.scalefactor <= 1) and
  8814. (
  8815. (
  8816. (getsupreg(taicpu(hp2).oper[0]^.ref^.base) = getsupreg(taicpu(p).oper[1]^.reg)) and
  8817. (getsupreg(taicpu(hp2).oper[0]^.ref^.index) = getsupreg(taicpu(hp1).oper[1]^.reg))
  8818. ) or (
  8819. (getsupreg(taicpu(hp2).oper[0]^.ref^.base) = getsupreg(taicpu(hp1).oper[1]^.reg)) and
  8820. (getsupreg(taicpu(hp2).oper[0]^.ref^.index) = getsupreg(taicpu(p).oper[1]^.reg))
  8821. )
  8822. ) and (
  8823. (
  8824. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg))
  8825. ) or (
  8826. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(p).oper[1]^.reg))
  8827. )
  8828. )
  8829. )
  8830. )
  8831. ) and (
  8832. GetNextInstruction(hp2, hp3) and
  8833. MatchInstruction(hp3, A_SHR,[]) and
  8834. (taicpu(hp3).opsize = S_Q) and
  8835. (taicpu(hp3).oper[0]^.typ = top_const) and (taicpu(hp2).oper[1]^.typ = top_reg) and
  8836. (taicpu(hp3).oper[0]^.val = 1) and
  8837. (taicpu(hp3).oper[1]^.reg = taicpu(hp2).oper[1]^.reg)
  8838. ) then
  8839. begin
  8840. { Change movl x, reg1d movl x, reg1d
  8841. movl y, reg2d movl y, reg2d
  8842. addq reg2q,reg1q or leaq (reg1q,reg2q),reg1q
  8843. shrq $1, reg1q shrq $1, reg1q
  8844. ( reg1d and reg2d can be switched around in the first two instructions )
  8845. To movl x, reg1d
  8846. addl y, reg1d
  8847. rcrl $1, reg1d
  8848. This corresponds to the common expression (x + y) shr 1, where
  8849. x and y are Cardinals (replacing "shr 1" with "div 2" produces
  8850. smaller code, but won't account for x + y causing an overflow). [Kit]
  8851. }
  8852. DebugMsg(SPeepholeOptimization + 'MovMov*Shr2MovMov*Rcr', p);
  8853. if (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) then
  8854. { Change first MOV command to have the same register as the final output }
  8855. taicpu(p).oper[1]^.reg := taicpu(hp1).oper[1]^.reg
  8856. else
  8857. taicpu(hp1).oper[1]^.reg := taicpu(p).oper[1]^.reg;
  8858. { Change second MOV command to an ADD command. This is easier than
  8859. converting the existing command because it means we don't have to
  8860. touch 'y', which might be a complicated reference, and also the
  8861. fact that the third command might either be ADD or LEA. [Kit] }
  8862. taicpu(hp1).opcode := A_ADD;
  8863. { Delete old ADD/LEA instruction }
  8864. RemoveInstruction(hp2);
  8865. { Convert "shrq $1, reg1q" to "rcr $1, reg1d" }
  8866. taicpu(hp3).opcode := A_RCR;
  8867. taicpu(hp3).changeopsize(S_L);
  8868. setsubreg(taicpu(hp3).oper[1]^.reg, R_SUBD);
  8869. {$endif x86_64}
  8870. end;
  8871. if FuncMov2Func(p, hp1) then
  8872. begin
  8873. Result := True;
  8874. Exit;
  8875. end;
  8876. end;
  8877. {$push}
  8878. {$q-}{$r-}
  8879. function TX86AsmOptimizer.OptPass2Movx(var p : tai) : boolean;
  8880. var
  8881. ThisReg: TRegister;
  8882. MinSize, MaxSize, TryShiftDown, TargetSize: TOpSize;
  8883. TargetSubReg: TSubRegister;
  8884. hp1, hp2: tai;
  8885. RegInUse, RegChanged, p_removed, hp1_removed: Boolean;
  8886. { Store list of found instructions so we don't have to call
  8887. GetNextInstructionUsingReg multiple times }
  8888. InstrList: array of taicpu;
  8889. InstrMax, Index: Integer;
  8890. UpperLimit, SignedUpperLimit, SignedUpperLimitBottom,
  8891. LowerLimit, SignedLowerLimit, SignedLowerLimitBottom,
  8892. TryShiftDownLimit, TryShiftDownSignedLimit, TryShiftDownSignedLimitLower,
  8893. WorkingValue: TCgInt;
  8894. PreMessage: string;
  8895. { Data flow analysis }
  8896. TestValMin, TestValMax, TestValSignedMax: TCgInt;
  8897. BitwiseOnly, OrXorUsed,
  8898. ShiftDownOverflow, UpperSignedOverflow, UpperUnsignedOverflow, LowerSignedOverflow, LowerUnsignedOverflow: Boolean;
  8899. function CheckOverflowConditions: Boolean;
  8900. begin
  8901. Result := True;
  8902. if (TestValSignedMax > SignedUpperLimit) then
  8903. UpperSignedOverflow := True;
  8904. if (TestValSignedMax > SignedLowerLimit) or (TestValSignedMax < SignedLowerLimitBottom) then
  8905. LowerSignedOverflow := True;
  8906. if (TestValMin > LowerLimit) or (TestValMax > LowerLimit) then
  8907. LowerUnsignedOverflow := True;
  8908. if (TestValMin > UpperLimit) or (TestValMax > UpperLimit) or (TestValSignedMax > UpperLimit) or
  8909. (TestValMin < SignedUpperLimitBottom) or (TestValMax < SignedUpperLimitBottom) or (TestValSignedMax < SignedUpperLimitBottom) then
  8910. begin
  8911. { Absolute overflow }
  8912. Result := False;
  8913. Exit;
  8914. end;
  8915. if not ShiftDownOverflow and (TryShiftDown <> S_NO) and
  8916. ((TestValMin > TryShiftDownLimit) or (TestValMax > TryShiftDownLimit)) then
  8917. ShiftDownOverflow := True;
  8918. if (TestValMin < 0) or (TestValMax < 0) then
  8919. begin
  8920. LowerUnsignedOverflow := True;
  8921. UpperUnsignedOverflow := True;
  8922. end;
  8923. end;
  8924. function AdjustInitialLoadAndSize: Boolean;
  8925. begin
  8926. Result := False;
  8927. if not p_removed then
  8928. begin
  8929. if TargetSize = MinSize then
  8930. begin
  8931. { Convert the input MOVZX to a MOV }
  8932. if (taicpu(p).oper[0]^.typ = top_reg) and
  8933. SuperRegistersEqual(taicpu(p).oper[0]^.reg, ThisReg) then
  8934. begin
  8935. { Or remove it completely! }
  8936. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 1', p);
  8937. RemoveCurrentP(p);
  8938. p_removed := True;
  8939. end
  8940. else
  8941. begin
  8942. DebugMsg(SPeepholeOptimization + 'Movzx2Mov 1', p);
  8943. taicpu(p).opcode := A_MOV;
  8944. taicpu(p).oper[1]^.reg := ThisReg;
  8945. taicpu(p).opsize := TargetSize;
  8946. end;
  8947. Result := True;
  8948. end
  8949. else if TargetSize <> MaxSize then
  8950. begin
  8951. case MaxSize of
  8952. S_L:
  8953. if TargetSize = S_W then
  8954. begin
  8955. DebugMsg(SPeepholeOptimization + 'movzbl2movzbw', p);
  8956. taicpu(p).opsize := S_BW;
  8957. taicpu(p).oper[1]^.reg := ThisReg;
  8958. Result := True;
  8959. end
  8960. else
  8961. InternalError(2020112341);
  8962. S_W:
  8963. if TargetSize = S_L then
  8964. begin
  8965. DebugMsg(SPeepholeOptimization + 'movzbw2movzbl', p);
  8966. taicpu(p).opsize := S_BL;
  8967. taicpu(p).oper[1]^.reg := ThisReg;
  8968. Result := True;
  8969. end
  8970. else
  8971. InternalError(2020112342);
  8972. else
  8973. ;
  8974. end;
  8975. end
  8976. else if not hp1_removed and not RegInUse then
  8977. begin
  8978. { If we have something like:
  8979. movzbl (oper),%regd
  8980. add x, %regd
  8981. movzbl %regb, %regd
  8982. We can reduce the register size to the input of the final
  8983. movzbl instruction. Overflows won't have any effect.
  8984. }
  8985. if (taicpu(p).opsize in [S_BW, S_BL]) and
  8986. (taicpu(hp1).opsize in [S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}]) then
  8987. begin
  8988. TargetSize := S_B;
  8989. setsubreg(ThisReg, R_SUBL);
  8990. Result := True;
  8991. end
  8992. else if (taicpu(p).opsize = S_WL) and
  8993. (taicpu(hp1).opsize in [S_WL{$ifdef x86_64}, S_BQ{$endif x86_64}]) then
  8994. begin
  8995. TargetSize := S_W;
  8996. setsubreg(ThisReg, R_SUBW);
  8997. Result := True;
  8998. end;
  8999. if Result then
  9000. begin
  9001. { Convert the input MOVZX to a MOV }
  9002. if (taicpu(p).oper[0]^.typ = top_reg) and
  9003. SuperRegistersEqual(taicpu(p).oper[0]^.reg, ThisReg) then
  9004. begin
  9005. { Or remove it completely! }
  9006. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 1a', p);
  9007. RemoveCurrentP(p);
  9008. p_removed := True;
  9009. end
  9010. else
  9011. begin
  9012. DebugMsg(SPeepholeOptimization + 'Movzx2Mov 1a', p);
  9013. taicpu(p).opcode := A_MOV;
  9014. taicpu(p).oper[1]^.reg := ThisReg;
  9015. taicpu(p).opsize := TargetSize;
  9016. end;
  9017. end;
  9018. end;
  9019. end;
  9020. end;
  9021. procedure AdjustFinalLoad;
  9022. begin
  9023. if not LowerUnsignedOverflow then
  9024. begin
  9025. if ((TargetSize = S_L) and (taicpu(hp1).opsize in [S_L, S_BL, S_WL])) or
  9026. ((TargetSize = S_W) and (taicpu(hp1).opsize in [S_W, S_BW])) then
  9027. begin
  9028. { Convert the output MOVZX to a MOV }
  9029. if SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9030. begin
  9031. { Make sure the zero-expansion covers at least the minimum size (fixes i40003) }
  9032. if (MinSize = S_B) or
  9033. (not ShiftDownOverflow and (TryShiftDown = S_B)) or
  9034. ((MinSize = S_W) and (taicpu(hp1).opsize = S_WL)) then
  9035. begin
  9036. { Remove it completely! }
  9037. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 2', hp1);
  9038. { Be careful; if p = hp1 and p was also removed, p
  9039. will become a dangling pointer }
  9040. if p = hp1 then
  9041. begin
  9042. RemoveCurrentp(p); { p = hp1 and will then become the next instruction }
  9043. p_removed := True;
  9044. end
  9045. else
  9046. RemoveInstruction(hp1);
  9047. hp1_removed := True;
  9048. end;
  9049. end
  9050. else
  9051. begin
  9052. DebugMsg(SPeepholeOptimization + 'Movzx2Mov 2', hp1);
  9053. taicpu(hp1).opcode := A_MOV;
  9054. taicpu(hp1).oper[0]^.reg := ThisReg;
  9055. taicpu(hp1).opsize := TargetSize;
  9056. end;
  9057. end
  9058. else if (TargetSize = S_B) and (MaxSize = S_W) and (taicpu(hp1).opsize = S_WL) then
  9059. begin
  9060. { Need to change the size of the output }
  9061. DebugMsg(SPeepholeOptimization + 'movzwl2movzbl 2', hp1);
  9062. taicpu(hp1).oper[0]^.reg := ThisReg;
  9063. taicpu(hp1).opsize := S_BL;
  9064. end;
  9065. end;
  9066. end;
  9067. function CompressInstructions: Boolean;
  9068. var
  9069. LocalIndex: Integer;
  9070. begin
  9071. Result := False;
  9072. { The objective here is to try to find a combination that
  9073. removes one of the MOV/Z instructions. }
  9074. if (
  9075. (taicpu(p).oper[0]^.typ <> top_reg) or
  9076. not SuperRegistersEqual(taicpu(p).oper[0]^.reg, ThisReg)
  9077. ) and
  9078. (taicpu(hp1).oper[1]^.typ = top_reg) and
  9079. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9080. begin
  9081. { Make a preference to remove the second MOVZX instruction }
  9082. case taicpu(hp1).opsize of
  9083. S_BL, S_WL:
  9084. begin
  9085. TargetSize := S_L;
  9086. TargetSubReg := R_SUBD;
  9087. end;
  9088. S_BW:
  9089. begin
  9090. TargetSize := S_W;
  9091. TargetSubReg := R_SUBW;
  9092. end;
  9093. else
  9094. InternalError(2020112302);
  9095. end;
  9096. end
  9097. else
  9098. begin
  9099. if LowerUnsignedOverflow and not UpperUnsignedOverflow then
  9100. begin
  9101. { Exceeded lower bound but not upper bound }
  9102. TargetSize := MaxSize;
  9103. end
  9104. else if not LowerUnsignedOverflow then
  9105. begin
  9106. { Size didn't exceed lower bound }
  9107. TargetSize := MinSize;
  9108. end
  9109. else
  9110. Exit;
  9111. end;
  9112. case TargetSize of
  9113. S_B:
  9114. TargetSubReg := R_SUBL;
  9115. S_W:
  9116. TargetSubReg := R_SUBW;
  9117. S_L:
  9118. TargetSubReg := R_SUBD;
  9119. else
  9120. InternalError(2020112350);
  9121. end;
  9122. { Update the register to its new size }
  9123. setsubreg(ThisReg, TargetSubReg);
  9124. RegInUse := False;
  9125. if not SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9126. begin
  9127. { Check to see if the active register is used afterwards;
  9128. if not, we can change it and make a saving. }
  9129. TransferUsedRegs(TmpUsedRegs);
  9130. { The target register may be marked as in use to cross
  9131. a jump to a distant label, so exclude it }
  9132. ExcludeRegFromUsedRegs(taicpu(hp1).oper[1]^.reg, TmpUsedRegs);
  9133. hp2 := p;
  9134. repeat
  9135. { Explicitly check for the excluded register (don't include the first
  9136. instruction as it may be reading from here }
  9137. if ((p <> hp2) and (RegInInstruction(taicpu(hp1).oper[1]^.reg, hp2))) or
  9138. RegInUsedRegs(taicpu(hp1).oper[1]^.reg, TmpUsedRegs) then
  9139. begin
  9140. RegInUse := True;
  9141. Break;
  9142. end;
  9143. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  9144. if not GetNextInstruction(hp2, hp2) then
  9145. InternalError(2020112340);
  9146. until (hp2 = hp1);
  9147. if not RegInUse and RegUsedAfterInstruction(ThisReg, hp1, TmpUsedRegs) then
  9148. { We might still be able to get away with this }
  9149. RegInUse := not
  9150. (
  9151. GetNextInstructionUsingReg(hp1, hp2, ThisReg) and
  9152. (hp2.typ = ait_instruction) and
  9153. (
  9154. { Under -O1 and -O2, GetNextInstructionUsingReg may return an
  9155. instruction that doesn't actually contain ThisReg }
  9156. (cs_opt_level3 in current_settings.optimizerswitches) or
  9157. RegInInstruction(ThisReg, hp2)
  9158. ) and
  9159. RegLoadedWithNewValue(ThisReg, hp2)
  9160. );
  9161. if not RegInUse then
  9162. begin
  9163. { Force the register size to the same as this instruction so it can be removed}
  9164. if (taicpu(hp1).opsize in [S_L, S_BL, S_WL]) then
  9165. begin
  9166. TargetSize := S_L;
  9167. TargetSubReg := R_SUBD;
  9168. end
  9169. else if (taicpu(hp1).opsize in [S_W, S_BW]) then
  9170. begin
  9171. TargetSize := S_W;
  9172. TargetSubReg := R_SUBW;
  9173. end;
  9174. ThisReg := taicpu(hp1).oper[1]^.reg;
  9175. setsubreg(ThisReg, TargetSubReg);
  9176. RegChanged := True;
  9177. DebugMsg(SPeepholeOptimization + 'Simplified register usage so ' + debug_regname(ThisReg) + ' = ' + debug_regname(taicpu(p).oper[1]^.reg), p);
  9178. TransferUsedRegs(TmpUsedRegs);
  9179. AllocRegBetween(ThisReg, p, hp1, TmpUsedRegs);
  9180. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 3', hp1);
  9181. if p = hp1 then
  9182. begin
  9183. RemoveCurrentp(p); { p = hp1 and will then become the next instruction }
  9184. p_removed := True;
  9185. end
  9186. else
  9187. RemoveInstruction(hp1);
  9188. hp1_removed := True;
  9189. { Instruction will become "mov %reg,%reg" }
  9190. if not p_removed and (taicpu(p).opcode = A_MOV) and
  9191. MatchOperand(taicpu(p).oper[0]^, ThisReg) then
  9192. begin
  9193. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 6', p);
  9194. RemoveCurrentP(p);
  9195. p_removed := True;
  9196. end
  9197. else
  9198. taicpu(p).oper[1]^.reg := ThisReg;
  9199. Result := True;
  9200. end
  9201. else
  9202. begin
  9203. if TargetSize <> MaxSize then
  9204. begin
  9205. { Since the register is in use, we have to force it to
  9206. MaxSize otherwise part of it may become undefined later on }
  9207. TargetSize := MaxSize;
  9208. case TargetSize of
  9209. S_B:
  9210. TargetSubReg := R_SUBL;
  9211. S_W:
  9212. TargetSubReg := R_SUBW;
  9213. S_L:
  9214. TargetSubReg := R_SUBD;
  9215. else
  9216. InternalError(2020112351);
  9217. end;
  9218. setsubreg(ThisReg, TargetSubReg);
  9219. end;
  9220. AdjustFinalLoad;
  9221. end;
  9222. end
  9223. else
  9224. AdjustFinalLoad;
  9225. Result := AdjustInitialLoadAndSize or Result;
  9226. { Now go through every instruction we found and change the
  9227. size. If TargetSize = MaxSize, then almost no changes are
  9228. needed and Result can remain False if it hasn't been set
  9229. yet.
  9230. If RegChanged is True, then the register requires changing
  9231. and so the point about TargetSize = MaxSize doesn't apply. }
  9232. if ((TargetSize <> MaxSize) or RegChanged) and (InstrMax >= 0) then
  9233. begin
  9234. for LocalIndex := 0 to InstrMax do
  9235. begin
  9236. { If p_removed is true, then the original MOV/Z was removed
  9237. and removing the AND instruction may not be safe if it
  9238. appears first }
  9239. if (InstrList[LocalIndex].oper[InstrList[LocalIndex].ops - 1]^.typ <> top_reg) then
  9240. InternalError(2020112310);
  9241. if InstrList[LocalIndex].oper[0]^.typ = top_reg then
  9242. InstrList[LocalIndex].oper[0]^.reg := ThisReg;
  9243. InstrList[LocalIndex].oper[InstrList[LocalIndex].ops - 1]^.reg := ThisReg;
  9244. InstrList[LocalIndex].opsize := TargetSize;
  9245. end;
  9246. Result := True;
  9247. end;
  9248. end;
  9249. begin
  9250. Result := False;
  9251. p_removed := False;
  9252. hp1_removed := False;
  9253. ThisReg := taicpu(p).oper[1]^.reg;
  9254. { Check for:
  9255. movs/z ###,%ecx (or %cx or %rcx)
  9256. ...
  9257. shl/shr/sar/rcl/rcr/ror/rol %cl,###
  9258. (dealloc %ecx)
  9259. Change to:
  9260. mov ###,%cl (if ### = %cl, then remove completely)
  9261. ...
  9262. shl/shr/sar/rcl/rcr/ror/rol %cl,###
  9263. }
  9264. if (getsupreg(ThisReg) = RS_ECX) and
  9265. GetNextInstructionUsingReg(p, hp1, NR_ECX) and
  9266. (hp1.typ = ait_instruction) and
  9267. (
  9268. { Under -O1 and -O2, GetNextInstructionUsingReg may return an
  9269. instruction that doesn't actually contain ECX }
  9270. (cs_opt_level3 in current_settings.optimizerswitches) or
  9271. RegInInstruction(NR_ECX, hp1) or
  9272. (
  9273. { It's common for the shift/rotate's read/write register to be
  9274. initialised in between, so under -O2 and under, search ahead
  9275. one more instruction
  9276. }
  9277. GetNextInstruction(hp1, hp1) and
  9278. (hp1.typ = ait_instruction) and
  9279. RegInInstruction(NR_ECX, hp1)
  9280. )
  9281. ) and
  9282. MatchInstruction(hp1, [A_SHL, A_SHR, A_SAR, A_ROR, A_ROL, A_RCR, A_RCL], []) and
  9283. (taicpu(hp1).oper[0]^.typ = top_reg) { This is enough to determine that it's %cl } then
  9284. begin
  9285. TransferUsedRegs(TmpUsedRegs);
  9286. hp2 := p;
  9287. repeat
  9288. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  9289. until not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  9290. if not RegUsedAfterInstruction(NR_CL, hp1, TmpUsedRegs) then
  9291. begin
  9292. case taicpu(p).opsize of
  9293. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  9294. if MatchOperand(taicpu(p).oper[0]^, NR_CL) then
  9295. begin
  9296. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 3a', p);
  9297. RemoveCurrentP(p);
  9298. end
  9299. else
  9300. begin
  9301. taicpu(p).opcode := A_MOV;
  9302. taicpu(p).opsize := S_B;
  9303. taicpu(p).oper[1]^.reg := NR_CL;
  9304. DebugMsg(SPeepholeOptimization + 'MovxOp2MovOp 1', p);
  9305. end;
  9306. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  9307. if MatchOperand(taicpu(p).oper[0]^, NR_CX) then
  9308. begin
  9309. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 3b', p);
  9310. RemoveCurrentP(p);
  9311. end
  9312. else
  9313. begin
  9314. taicpu(p).opcode := A_MOV;
  9315. taicpu(p).opsize := S_W;
  9316. taicpu(p).oper[1]^.reg := NR_CX;
  9317. DebugMsg(SPeepholeOptimization + 'MovxOp2MovOp 2', p);
  9318. end;
  9319. {$ifdef x86_64}
  9320. S_LQ:
  9321. if MatchOperand(taicpu(p).oper[0]^, NR_ECX) then
  9322. begin
  9323. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 3c', p);
  9324. RemoveCurrentP(p);
  9325. end
  9326. else
  9327. begin
  9328. taicpu(p).opcode := A_MOV;
  9329. taicpu(p).opsize := S_L;
  9330. taicpu(p).oper[1]^.reg := NR_ECX;
  9331. DebugMsg(SPeepholeOptimization + 'MovxOp2MovOp 3', p);
  9332. end;
  9333. {$endif x86_64}
  9334. else
  9335. InternalError(2021120401);
  9336. end;
  9337. Result := True;
  9338. Exit;
  9339. end;
  9340. end;
  9341. { This is anything but quick! }
  9342. if not(cs_opt_level2 in current_settings.optimizerswitches) then
  9343. Exit;
  9344. SetLength(InstrList, 0);
  9345. InstrMax := -1;
  9346. case taicpu(p).opsize of
  9347. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  9348. begin
  9349. {$if defined(i386) or defined(i8086)}
  9350. { If the target size is 8-bit, make sure we can actually encode it }
  9351. if not (GetSupReg(ThisReg) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX]) then
  9352. Exit;
  9353. {$endif i386 or i8086}
  9354. LowerLimit := $FF;
  9355. SignedLowerLimit := $7F;
  9356. SignedLowerLimitBottom := -128;
  9357. MinSize := S_B;
  9358. if taicpu(p).opsize = S_BW then
  9359. begin
  9360. MaxSize := S_W;
  9361. UpperLimit := $FFFF;
  9362. SignedUpperLimit := $7FFF;
  9363. SignedUpperLimitBottom := -32768;
  9364. end
  9365. else
  9366. begin
  9367. { Keep at a 32-bit limit for BQ as well since one can't really optimise otherwise }
  9368. MaxSize := S_L;
  9369. UpperLimit := $FFFFFFFF;
  9370. SignedUpperLimit := $7FFFFFFF;
  9371. SignedUpperLimitBottom := -2147483648;
  9372. end;
  9373. end;
  9374. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  9375. begin
  9376. { Keep at a 32-bit limit for WQ as well since one can't really optimise otherwise }
  9377. LowerLimit := $FFFF;
  9378. SignedLowerLimit := $7FFF;
  9379. SignedLowerLimitBottom := -32768;
  9380. UpperLimit := $FFFFFFFF;
  9381. SignedUpperLimit := $7FFFFFFF;
  9382. SignedUpperLimitBottom := -2147483648;
  9383. MinSize := S_W;
  9384. MaxSize := S_L;
  9385. end;
  9386. {$ifdef x86_64}
  9387. S_LQ:
  9388. begin
  9389. { Both the lower and upper limits are set to 32-bit. If a limit
  9390. is breached, then optimisation is impossible }
  9391. LowerLimit := $FFFFFFFF;
  9392. SignedLowerLimit := $7FFFFFFF;
  9393. SignedLowerLimitBottom := -2147483648;
  9394. UpperLimit := $FFFFFFFF;
  9395. SignedUpperLimit := $7FFFFFFF;
  9396. SignedUpperLimitBottom := -2147483648;
  9397. MinSize := S_L;
  9398. MaxSize := S_L;
  9399. end;
  9400. {$endif x86_64}
  9401. else
  9402. InternalError(2020112301);
  9403. end;
  9404. TestValMin := 0;
  9405. TestValMax := LowerLimit;
  9406. TestValSignedMax := SignedLowerLimit;
  9407. TryShiftDownLimit := LowerLimit;
  9408. TryShiftDown := S_NO;
  9409. ShiftDownOverflow := False;
  9410. RegChanged := False;
  9411. BitwiseOnly := True;
  9412. OrXorUsed := False;
  9413. UpperSignedOverflow := False;
  9414. LowerSignedOverflow := False;
  9415. UpperUnsignedOverflow := False;
  9416. LowerUnsignedOverflow := False;
  9417. hp1 := p;
  9418. while GetNextInstructionUsingReg(hp1, hp1, ThisReg) and
  9419. (hp1.typ = ait_instruction) and
  9420. (
  9421. { Under -O1 and -O2, GetNextInstructionUsingReg may return an
  9422. instruction that doesn't actually contain ThisReg }
  9423. (cs_opt_level3 in current_settings.optimizerswitches) or
  9424. { This allows this Movx optimisation to work through the SETcc instructions
  9425. inserted by the 'CMP/JE/CMP/@Lbl/SETE -> CMP/SETE/CMP/SETE/OR'
  9426. optimisation on -O1 and -O2 (on -O3, GetNextInstructionUsingReg will
  9427. skip over these SETcc instructions). }
  9428. (taicpu(hp1).opcode = A_SETcc) or
  9429. RegInInstruction(ThisReg, hp1)
  9430. ) do
  9431. begin
  9432. case taicpu(hp1).opcode of
  9433. A_INC,A_DEC:
  9434. begin
  9435. { Has to be an exact match on the register }
  9436. if not MatchOperand(taicpu(hp1).oper[0]^, ThisReg) then
  9437. Break;
  9438. if taicpu(hp1).opcode = A_INC then
  9439. begin
  9440. Inc(TestValMin);
  9441. Inc(TestValMax);
  9442. Inc(TestValSignedMax);
  9443. end
  9444. else
  9445. begin
  9446. Dec(TestValMin);
  9447. Dec(TestValMax);
  9448. Dec(TestValSignedMax);
  9449. end;
  9450. end;
  9451. A_TEST, A_CMP:
  9452. begin
  9453. if (
  9454. { Too high a risk of non-linear behaviour that breaks DFA
  9455. here, unless it's cmp $0,%reg, which is equivalent to
  9456. test %reg,%reg }
  9457. OrXorUsed and
  9458. (taicpu(hp1).opcode = A_CMP) and
  9459. not Matchoperand(taicpu(hp1).oper[0]^, 0)
  9460. ) or
  9461. (taicpu(hp1).oper[1]^.typ <> top_reg) or
  9462. { Has to be an exact match on the register }
  9463. (taicpu(hp1).oper[1]^.reg <> ThisReg) or
  9464. (
  9465. { Permit "test %reg,%reg" }
  9466. (taicpu(hp1).opcode = A_TEST) and
  9467. (taicpu(hp1).oper[0]^.typ = top_reg) and
  9468. (taicpu(hp1).oper[0]^.reg <> ThisReg)
  9469. ) or
  9470. (taicpu(hp1).oper[0]^.typ <> top_const) or
  9471. { Make sure the comparison value is not smaller than the
  9472. smallest allowed signed value for the minimum size (e.g.
  9473. -128 for 8-bit) }
  9474. not (
  9475. ((taicpu(hp1).oper[0]^.val and LowerLimit) = taicpu(hp1).oper[0]^.val) or
  9476. { Is it in the negative range? }
  9477. (
  9478. (taicpu(hp1).oper[0]^.val < 0) and
  9479. (taicpu(hp1).oper[0]^.val >= SignedLowerLimitBottom)
  9480. )
  9481. ) then
  9482. Break;
  9483. { Check to see if the active register is used afterwards }
  9484. TransferUsedRegs(TmpUsedRegs);
  9485. IncludeRegInUsedRegs(ThisReg, TmpUsedRegs);
  9486. if not RegUsedAfterInstruction(ThisReg, hp1, TmpUsedRegs) then
  9487. begin
  9488. { Make sure the comparison or any previous instructions
  9489. hasn't pushed the test values outside of the range of
  9490. MinSize }
  9491. if LowerUnsignedOverflow and not UpperUnsignedOverflow then
  9492. begin
  9493. { Exceeded lower bound but not upper bound }
  9494. Exit;
  9495. end
  9496. else if not LowerSignedOverflow or not LowerUnsignedOverflow then
  9497. begin
  9498. { Size didn't exceed lower bound }
  9499. TargetSize := MinSize;
  9500. end
  9501. else
  9502. Break;
  9503. case TargetSize of
  9504. S_B:
  9505. TargetSubReg := R_SUBL;
  9506. S_W:
  9507. TargetSubReg := R_SUBW;
  9508. S_L:
  9509. TargetSubReg := R_SUBD;
  9510. else
  9511. InternalError(2021051002);
  9512. end;
  9513. if TargetSize <> MaxSize then
  9514. begin
  9515. { Update the register to its new size }
  9516. setsubreg(ThisReg, TargetSubReg);
  9517. DebugMsg(SPeepholeOptimization + 'CMP instruction resized thanks to register size optimisation (see MOV/Z assignment above)', hp1);
  9518. taicpu(hp1).oper[1]^.reg := ThisReg;
  9519. taicpu(hp1).opsize := TargetSize;
  9520. { Convert the input MOVZX to a MOV if necessary }
  9521. AdjustInitialLoadAndSize;
  9522. if (InstrMax >= 0) then
  9523. begin
  9524. for Index := 0 to InstrMax do
  9525. begin
  9526. { If p_removed is true, then the original MOV/Z was removed
  9527. and removing the AND instruction may not be safe if it
  9528. appears first }
  9529. if (InstrList[Index].oper[InstrList[Index].ops - 1]^.typ <> top_reg) then
  9530. InternalError(2020112311);
  9531. if InstrList[Index].oper[0]^.typ = top_reg then
  9532. InstrList[Index].oper[0]^.reg := ThisReg;
  9533. InstrList[Index].oper[InstrList[Index].ops - 1]^.reg := ThisReg;
  9534. InstrList[Index].opsize := MinSize;
  9535. end;
  9536. end;
  9537. Result := True;
  9538. end;
  9539. Exit;
  9540. end;
  9541. end;
  9542. A_SETcc:
  9543. begin
  9544. { This allows this Movx optimisation to work through the SETcc instructions
  9545. inserted by the 'CMP/JE/CMP/@Lbl/SETE -> CMP/SETE/CMP/SETE/OR'
  9546. optimisation on -O1 and -O2 (on -O3, GetNextInstructionUsingReg will
  9547. skip over these SETcc instructions). }
  9548. if (cs_opt_level3 in current_settings.optimizerswitches) or
  9549. { Of course, break out if the current register is used }
  9550. RegInOp(ThisReg, taicpu(hp1).oper[0]^) then
  9551. Break
  9552. else
  9553. { We must use Continue so the instruction doesn't get added
  9554. to InstrList }
  9555. Continue;
  9556. end;
  9557. A_ADD,A_SUB,A_AND,A_OR,A_XOR,A_SHL,A_SHR,A_SAR:
  9558. begin
  9559. if
  9560. (taicpu(hp1).oper[1]^.typ <> top_reg) or
  9561. { Has to be an exact match on the register }
  9562. (taicpu(hp1).oper[1]^.reg <> ThisReg) or not
  9563. (
  9564. (
  9565. (taicpu(hp1).oper[0]^.typ = top_const) and
  9566. (
  9567. (
  9568. (taicpu(hp1).opcode = A_SHL) and
  9569. (
  9570. ((MinSize = S_B) and (taicpu(hp1).oper[0]^.val < 8)) or
  9571. ((MinSize = S_W) and (taicpu(hp1).oper[0]^.val < 16)) or
  9572. ((MinSize = S_L) and (taicpu(hp1).oper[0]^.val < 32))
  9573. )
  9574. ) or (
  9575. (taicpu(hp1).opcode <> A_SHL) and
  9576. (
  9577. ((taicpu(hp1).oper[0]^.val and UpperLimit) = taicpu(hp1).oper[0]^.val) or
  9578. { Is it in the negative range? }
  9579. (((not taicpu(hp1).oper[0]^.val) and (UpperLimit shr 1)) = (not taicpu(hp1).oper[0]^.val))
  9580. )
  9581. )
  9582. )
  9583. ) or (
  9584. MatchOperand(taicpu(hp1).oper[0]^, taicpu(hp1).oper[1]^.reg) and
  9585. ((taicpu(hp1).opcode = A_ADD) or (taicpu(hp1).opcode = A_AND) or (taicpu(hp1).opcode = A_SUB))
  9586. )
  9587. ) then
  9588. Break;
  9589. { Only process OR and XOR if there are only bitwise operations,
  9590. since otherwise they can too easily fool the data flow
  9591. analysis (they can cause non-linear behaviour) }
  9592. case taicpu(hp1).opcode of
  9593. A_ADD:
  9594. begin
  9595. if OrXorUsed then
  9596. { Too high a risk of non-linear behaviour that breaks DFA here }
  9597. Break
  9598. else
  9599. BitwiseOnly := False;
  9600. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  9601. begin
  9602. TestValMin := TestValMin * 2;
  9603. TestValMax := TestValMax * 2;
  9604. TestValSignedMax := TestValSignedMax * 2;
  9605. end
  9606. else
  9607. begin
  9608. WorkingValue := taicpu(hp1).oper[0]^.val;
  9609. TestValMin := TestValMin + WorkingValue;
  9610. TestValMax := TestValMax + WorkingValue;
  9611. TestValSignedMax := TestValSignedMax + WorkingValue;
  9612. end;
  9613. end;
  9614. A_SUB:
  9615. begin
  9616. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  9617. begin
  9618. TestValMin := 0;
  9619. TestValMax := 0;
  9620. TestValSignedMax := 0;
  9621. end
  9622. else
  9623. begin
  9624. if OrXorUsed then
  9625. { Too high a risk of non-linear behaviour that breaks DFA here }
  9626. Break
  9627. else
  9628. BitwiseOnly := False;
  9629. WorkingValue := taicpu(hp1).oper[0]^.val;
  9630. TestValMin := TestValMin - WorkingValue;
  9631. TestValMax := TestValMax - WorkingValue;
  9632. TestValSignedMax := TestValSignedMax - WorkingValue;
  9633. end;
  9634. end;
  9635. A_AND:
  9636. if (taicpu(hp1).oper[0]^.typ = top_const) then
  9637. begin
  9638. { we might be able to go smaller if AND appears first }
  9639. if InstrMax = -1 then
  9640. case MinSize of
  9641. S_B:
  9642. ;
  9643. S_W:
  9644. if ((taicpu(hp1).oper[0]^.val and $FF) = taicpu(hp1).oper[0]^.val) or
  9645. ((not(taicpu(hp1).oper[0]^.val) and $7F) = (not taicpu(hp1).oper[0]^.val)) then
  9646. begin
  9647. TryShiftDown := S_B;
  9648. TryShiftDownLimit := $FF;
  9649. end;
  9650. S_L:
  9651. if ((taicpu(hp1).oper[0]^.val and $FF) = taicpu(hp1).oper[0]^.val) or
  9652. ((not(taicpu(hp1).oper[0]^.val) and $7F) = (not taicpu(hp1).oper[0]^.val)) then
  9653. begin
  9654. TryShiftDown := S_B;
  9655. TryShiftDownLimit := $FF;
  9656. end
  9657. else if ((taicpu(hp1).oper[0]^.val and $FFFF) = taicpu(hp1).oper[0]^.val) or
  9658. ((not(taicpu(hp1).oper[0]^.val) and $7FFF) = (not taicpu(hp1).oper[0]^.val)) then
  9659. begin
  9660. TryShiftDown := S_W;
  9661. TryShiftDownLimit := $FFFF;
  9662. end;
  9663. else
  9664. InternalError(2020112320);
  9665. end;
  9666. WorkingValue := taicpu(hp1).oper[0]^.val;
  9667. TestValMin := TestValMin and WorkingValue;
  9668. TestValMax := TestValMax and WorkingValue;
  9669. TestValSignedMax := TestValSignedMax and WorkingValue;
  9670. end;
  9671. A_OR:
  9672. begin
  9673. if not BitwiseOnly then
  9674. Break;
  9675. OrXorUsed := True;
  9676. WorkingValue := taicpu(hp1).oper[0]^.val;
  9677. TestValMin := TestValMin or WorkingValue;
  9678. TestValMax := TestValMax or WorkingValue;
  9679. TestValSignedMax := TestValSignedMax or WorkingValue;
  9680. end;
  9681. A_XOR:
  9682. begin
  9683. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  9684. begin
  9685. TestValMin := 0;
  9686. TestValMax := 0;
  9687. TestValSignedMax := 0;
  9688. end
  9689. else
  9690. begin
  9691. if not BitwiseOnly then
  9692. Break;
  9693. OrXorUsed := True;
  9694. WorkingValue := taicpu(hp1).oper[0]^.val;
  9695. TestValMin := TestValMin xor WorkingValue;
  9696. TestValMax := TestValMax xor WorkingValue;
  9697. TestValSignedMax := TestValSignedMax xor WorkingValue;
  9698. end;
  9699. end;
  9700. A_SHL:
  9701. begin
  9702. BitwiseOnly := False;
  9703. WorkingValue := taicpu(hp1).oper[0]^.val;
  9704. TestValMin := TestValMin shl WorkingValue;
  9705. TestValMax := TestValMax shl WorkingValue;
  9706. TestValSignedMax := TestValSignedMax shl WorkingValue;
  9707. end;
  9708. A_SHR,
  9709. { The first instruction was MOVZX, so the value won't be negative }
  9710. A_SAR:
  9711. begin
  9712. if InstrMax <> -1 then
  9713. BitwiseOnly := False
  9714. else
  9715. { we might be able to go smaller if SHR appears first }
  9716. case MinSize of
  9717. S_B:
  9718. ;
  9719. S_W:
  9720. if (taicpu(hp1).oper[0]^.val >= 8) then
  9721. begin
  9722. TryShiftDown := S_B;
  9723. TryShiftDownLimit := $FF;
  9724. TryShiftDownSignedLimit := $7F;
  9725. TryShiftDownSignedLimitLower := -128;
  9726. end;
  9727. S_L:
  9728. if (taicpu(hp1).oper[0]^.val >= 24) then
  9729. begin
  9730. TryShiftDown := S_B;
  9731. TryShiftDownLimit := $FF;
  9732. TryShiftDownSignedLimit := $7F;
  9733. TryShiftDownSignedLimitLower := -128;
  9734. end
  9735. else if (taicpu(hp1).oper[0]^.val >= 16) then
  9736. begin
  9737. TryShiftDown := S_W;
  9738. TryShiftDownLimit := $FFFF;
  9739. TryShiftDownSignedLimit := $7FFF;
  9740. TryShiftDownSignedLimitLower := -32768;
  9741. end;
  9742. else
  9743. InternalError(2020112321);
  9744. end;
  9745. WorkingValue := taicpu(hp1).oper[0]^.val;
  9746. if taicpu(hp1).opcode = A_SAR then
  9747. begin
  9748. TestValMin := SarInt64(TestValMin, WorkingValue);
  9749. TestValMax := SarInt64(TestValMax, WorkingValue);
  9750. TestValSignedMax := SarInt64(TestValSignedMax, WorkingValue);
  9751. end
  9752. else
  9753. begin
  9754. TestValMin := TestValMin shr WorkingValue;
  9755. TestValMax := TestValMax shr WorkingValue;
  9756. TestValSignedMax := TestValSignedMax shr WorkingValue;
  9757. end;
  9758. end;
  9759. else
  9760. InternalError(2020112303);
  9761. end;
  9762. end;
  9763. (*
  9764. A_IMUL:
  9765. case taicpu(hp1).ops of
  9766. 2:
  9767. begin
  9768. if not MatchOpType(hp1, top_reg, top_reg) or
  9769. { Has to be an exact match on the register }
  9770. (taicpu(hp1).oper[0]^.reg <> ThisReg) or
  9771. (taicpu(hp1).oper[1]^.reg <> ThisReg) then
  9772. Break;
  9773. TestValMin := TestValMin * TestValMin;
  9774. TestValMax := TestValMax * TestValMax;
  9775. TestValSignedMax := TestValSignedMax * TestValMax;
  9776. end;
  9777. 3:
  9778. begin
  9779. if not MatchOpType(hp1, top_const, top_reg, top_reg) or
  9780. { Has to be an exact match on the register }
  9781. (taicpu(hp1).oper[1]^.reg <> ThisReg) or
  9782. (taicpu(hp1).oper[2]^.reg <> ThisReg) or
  9783. ((taicpu(hp1).oper[0]^.val and UpperLimit) = taicpu(hp1).oper[0]^.val) or
  9784. { Is it in the negative range? }
  9785. (((not taicpu(hp1).oper[0]^.val) and (UpperLimit shr 1)) = (not taicpu(hp1).oper[0]^.val)) then
  9786. Break;
  9787. TestValMin := TestValMin * taicpu(hp1).oper[0]^.val;
  9788. TestValMax := TestValMax * taicpu(hp1).oper[0]^.val;
  9789. TestValSignedMax := TestValSignedMax * taicpu(hp1).oper[0]^.val;
  9790. end;
  9791. else
  9792. Break;
  9793. end;
  9794. A_IDIV:
  9795. case taicpu(hp1).ops of
  9796. 3:
  9797. begin
  9798. if not MatchOpType(hp1, top_const, top_reg, top_reg) or
  9799. { Has to be an exact match on the register }
  9800. (taicpu(hp1).oper[1]^.reg <> ThisReg) or
  9801. (taicpu(hp1).oper[2]^.reg <> ThisReg) or
  9802. ((taicpu(hp1).oper[0]^.val and UpperLimit) = taicpu(hp1).oper[0]^.val) or
  9803. { Is it in the negative range? }
  9804. (((not taicpu(hp1).oper[0]^.val) and (UpperLimit shr 1)) = (not taicpu(hp1).oper[0]^.val)) then
  9805. Break;
  9806. TestValMin := TestValMin div taicpu(hp1).oper[0]^.val;
  9807. TestValMax := TestValMax div taicpu(hp1).oper[0]^.val;
  9808. TestValSignedMax := TestValSignedMax div taicpu(hp1).oper[0]^.val;
  9809. end;
  9810. else
  9811. Break;
  9812. end;
  9813. *)
  9814. A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  9815. begin
  9816. { If there are no instructions in between, then we might be able to make a saving }
  9817. if UpperSignedOverflow or (taicpu(hp1).oper[0]^.typ <> top_reg) or (taicpu(hp1).oper[0]^.reg <> ThisReg) then
  9818. Break;
  9819. { We have something like:
  9820. movzbw %dl,%dx
  9821. ...
  9822. movswl %dx,%edx
  9823. Change the latter to a zero-extension then enter the
  9824. A_MOVZX case branch.
  9825. }
  9826. {$ifdef x86_64}
  9827. if (taicpu(hp1).opsize = S_LQ) and SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9828. begin
  9829. { this becomes a zero extension from 32-bit to 64-bit, but
  9830. the upper 32 bits are already zero, so just delete the
  9831. instruction }
  9832. DebugMsg(SPeepholeOptimization + 'MovzMovsxd2MovzNop', hp1);
  9833. RemoveInstruction(hp1);
  9834. Result := True;
  9835. Exit;
  9836. end
  9837. else
  9838. {$endif x86_64}
  9839. begin
  9840. DebugMsg(SPeepholeOptimization + 'MovzMovs2MovzMovz', hp1);
  9841. taicpu(hp1).opcode := A_MOVZX;
  9842. {$ifdef x86_64}
  9843. case taicpu(hp1).opsize of
  9844. S_BQ:
  9845. begin
  9846. taicpu(hp1).opsize := S_BL;
  9847. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  9848. end;
  9849. S_WQ:
  9850. begin
  9851. taicpu(hp1).opsize := S_WL;
  9852. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  9853. end;
  9854. S_LQ:
  9855. begin
  9856. taicpu(hp1).opcode := A_MOV;
  9857. taicpu(hp1).opsize := S_L;
  9858. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  9859. { In this instance, we need to break out because the
  9860. instruction is no longer MOVZX or MOVSXD }
  9861. Result := True;
  9862. Exit;
  9863. end;
  9864. else
  9865. ;
  9866. end;
  9867. {$endif x86_64}
  9868. Result := CompressInstructions;
  9869. Exit;
  9870. end;
  9871. end;
  9872. A_MOVZX:
  9873. begin
  9874. if UpperUnsignedOverflow or (taicpu(hp1).oper[0]^.typ <> top_reg) then
  9875. Break;
  9876. if (InstrMax = -1) then
  9877. begin
  9878. if SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, ThisReg) then
  9879. begin
  9880. { Optimise around i40003 }
  9881. if SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) and
  9882. (taicpu(p).opsize = S_WL) and (taicpu(hp1).opsize = S_BL)
  9883. {$ifndef x86_64}
  9884. and (
  9885. (taicpu(p).oper[0]^.typ <> top_reg) or
  9886. { Cannot encode byte-sized ESI, EDI, EBP or ESP under i386 }
  9887. (GetSupReg(taicpu(p).oper[0]^.reg) in [RS_EAX, RS_EBX, RS_ECX, RS_EDX])
  9888. )
  9889. {$endif not x86_64}
  9890. then
  9891. begin
  9892. if (taicpu(p).oper[0]^.typ = top_reg) then
  9893. setsubreg(taicpu(p).oper[0]^.reg, R_SUBL);
  9894. DebugMsg(SPeepholeOptimization + 'movzwl2movzbl 1', p);
  9895. taicpu(p).opsize := S_BL;
  9896. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 2a', hp1);
  9897. RemoveInstruction(hp1);
  9898. Result := True;
  9899. Exit;
  9900. end;
  9901. end
  9902. else
  9903. begin
  9904. { Will return false if the second parameter isn't ThisReg
  9905. (can happen on -O2 and under) }
  9906. if Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9907. begin
  9908. { The two MOVZX instructions are adjacent, so remove the first one }
  9909. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 5', p);
  9910. RemoveCurrentP(p);
  9911. Result := True;
  9912. Exit;
  9913. end;
  9914. Break;
  9915. end;
  9916. end;
  9917. Result := CompressInstructions;
  9918. Exit;
  9919. end;
  9920. else
  9921. { This includes ADC, SBB and IDIV }
  9922. Break;
  9923. end;
  9924. if not CheckOverflowConditions then
  9925. Break;
  9926. { Contains highest index (so instruction count - 1) }
  9927. Inc(InstrMax);
  9928. if InstrMax > High(InstrList) then
  9929. SetLength(InstrList, InstrMax + LIST_STEP_SIZE);
  9930. InstrList[InstrMax] := taicpu(hp1);
  9931. end;
  9932. end;
  9933. {$pop}
  9934. function TX86AsmOptimizer.OptPass2Imul(var p : tai) : boolean;
  9935. var
  9936. hp1 : tai;
  9937. begin
  9938. Result:=false;
  9939. if (taicpu(p).ops >= 2) and
  9940. ((taicpu(p).oper[0]^.typ = top_const) or
  9941. ((taicpu(p).oper[0]^.typ = top_ref) and (taicpu(p).oper[0]^.ref^.refaddr=addr_full))) and
  9942. (taicpu(p).oper[1]^.typ = top_reg) and
  9943. ((taicpu(p).ops = 2) or
  9944. ((taicpu(p).oper[2]^.typ = top_reg) and
  9945. (taicpu(p).oper[2]^.reg = taicpu(p).oper[1]^.reg))) and
  9946. GetLastInstruction(p,hp1) and
  9947. MatchInstruction(hp1,A_MOV,[]) and
  9948. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  9949. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  9950. begin
  9951. TransferUsedRegs(TmpUsedRegs);
  9952. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,p,TmpUsedRegs)) or
  9953. ((taicpu(p).ops = 3) and (taicpu(p).oper[1]^.reg=taicpu(p).oper[2]^.reg)) then
  9954. { change
  9955. mov reg1,reg2
  9956. imul y,reg2 to imul y,reg1,reg2 }
  9957. begin
  9958. taicpu(p).ops := 3;
  9959. taicpu(p).loadreg(2,taicpu(p).oper[1]^.reg);
  9960. taicpu(p).loadreg(1,taicpu(hp1).oper[0]^.reg);
  9961. DebugMsg(SPeepholeOptimization + 'MovImul2Imul done',p);
  9962. RemoveInstruction(hp1);
  9963. result:=true;
  9964. end;
  9965. end;
  9966. end;
  9967. procedure TX86AsmOptimizer.ConvertJumpToRET(const p: tai; const ret_p: tai);
  9968. var
  9969. ThisLabel: TAsmLabel;
  9970. begin
  9971. ThisLabel := tasmlabel(taicpu(p).oper[0]^.ref^.symbol);
  9972. ThisLabel.decrefs;
  9973. taicpu(p).condition := C_None;
  9974. taicpu(p).opcode := A_RET;
  9975. taicpu(p).is_jmp := false;
  9976. taicpu(p).ops := taicpu(ret_p).ops;
  9977. case taicpu(ret_p).ops of
  9978. 0:
  9979. taicpu(p).clearop(0);
  9980. 1:
  9981. taicpu(p).loadconst(0,taicpu(ret_p).oper[0]^.val);
  9982. else
  9983. internalerror(2016041301);
  9984. end;
  9985. { If the original label is now dead, it might turn out that the label
  9986. immediately follows p. As a result, everything beyond it, which will
  9987. be just some final register configuration and a RET instruction, is
  9988. now dead code. [Kit] }
  9989. { NOTE: This is much faster than introducing a OptPass2RET routine and
  9990. running RemoveDeadCodeAfterJump for each RET instruction, because
  9991. this optimisation rarely happens and most RETs appear at the end of
  9992. routines where there is nothing that can be stripped. [Kit] }
  9993. if not ThisLabel.is_used then
  9994. RemoveDeadCodeAfterJump(p);
  9995. end;
  9996. function TX86AsmOptimizer.OptPass2SETcc(var p: tai): boolean;
  9997. var
  9998. hp1,hp2,next: tai; SetC, JumpC: TAsmCond;
  9999. Unconditional, PotentialModified: Boolean;
  10000. OperPtr: POper;
  10001. NewRef: TReference;
  10002. InstrList: array of taicpu;
  10003. InstrMax, Index: Integer;
  10004. const
  10005. {$ifdef DEBUG_AOPTCPU}
  10006. SNoFlags: shortstring = ' so the flags aren''t modified';
  10007. {$else DEBUG_AOPTCPU}
  10008. SNoFlags = '';
  10009. {$endif DEBUG_AOPTCPU}
  10010. begin
  10011. Result:=false;
  10012. if MatchOpType(taicpu(p),top_reg) and GetNextInstructionUsingReg(p, hp1, taicpu(p).oper[0]^.reg) then
  10013. begin
  10014. if MatchInstruction(hp1, A_TEST, [S_B]) and
  10015. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  10016. (taicpu(hp1).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) and
  10017. (taicpu(p).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) and
  10018. GetNextInstruction(hp1, hp2) and
  10019. MatchInstruction(hp2, A_Jcc, A_SETcc, []) then
  10020. { Change from: To:
  10021. set(C) %reg j(~C) label
  10022. test %reg,%reg/cmp $0,%reg
  10023. je label
  10024. set(C) %reg j(C) label
  10025. test %reg,%reg/cmp $0,%reg
  10026. jne label
  10027. (Also do something similar with sete/setne instead of je/jne)
  10028. }
  10029. begin
  10030. { Before we do anything else, we need to check the instructions
  10031. in between SETcc and TEST to make sure they don't modify the
  10032. FLAGS register - if -O2 or under, there won't be any
  10033. instructions between SET and TEST }
  10034. TransferUsedRegs(TmpUsedRegs);
  10035. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  10036. if (cs_opt_level3 in current_settings.optimizerswitches) then
  10037. begin
  10038. next := p;
  10039. SetLength(InstrList, 0);
  10040. InstrMax := -1;
  10041. PotentialModified := False;
  10042. { Make a note of every instruction that modifies the FLAGS
  10043. register }
  10044. while GetNextInstruction(next, next) and (next <> hp1) do
  10045. begin
  10046. if next.typ <> ait_instruction then
  10047. { GetNextInstructionUsingReg should have returned False }
  10048. InternalError(2021051701);
  10049. if RegModifiedByInstruction(NR_DEFAULTFLAGS, next) then
  10050. begin
  10051. case taicpu(next).opcode of
  10052. A_SETcc,
  10053. A_CMOVcc,
  10054. A_Jcc:
  10055. begin
  10056. if PotentialModified then
  10057. { Not safe because the flags were modified earlier }
  10058. Exit
  10059. else
  10060. { Condition is the same as the initial SETcc, so this is safe
  10061. (don't add to instruction list though) }
  10062. Continue;
  10063. end;
  10064. A_ADD:
  10065. begin
  10066. if (taicpu(next).opsize = S_B) or
  10067. { LEA doesn't support 8-bit operands }
  10068. (taicpu(next).oper[1]^.typ <> top_reg) or
  10069. { Must write to a register }
  10070. (taicpu(next).oper[0]^.typ = top_ref) then
  10071. { Require a constant or a register }
  10072. Exit;
  10073. PotentialModified := True;
  10074. end;
  10075. A_SUB:
  10076. begin
  10077. if (taicpu(next).opsize = S_B) or
  10078. { LEA doesn't support 8-bit operands }
  10079. (taicpu(next).oper[1]^.typ <> top_reg) or
  10080. { Must write to a register }
  10081. (taicpu(next).oper[0]^.typ <> top_const) or
  10082. (taicpu(next).oper[0]^.val = $80000000) then
  10083. { Can't subtract a register with LEA - also
  10084. check that the value isn't -2^31, as this
  10085. can't be negated }
  10086. Exit;
  10087. PotentialModified := True;
  10088. end;
  10089. A_SAL,
  10090. A_SHL:
  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 < 0) or
  10098. (taicpu(next).oper[0]^.val > 3) then
  10099. Exit;
  10100. PotentialModified := True;
  10101. end;
  10102. A_IMUL:
  10103. begin
  10104. if (taicpu(next).ops <> 3) or
  10105. (taicpu(next).oper[1]^.typ <> top_reg) or
  10106. { Must write to a register }
  10107. (taicpu(next).oper[2]^.val in [2,3,4,5,8,9]) then
  10108. { We can convert "imul x,%reg1,%reg2" (where x = 2, 4 or 8)
  10109. to "lea (%reg1,x),%reg2". If x = 3, 5 or 9, we can
  10110. change this to "lea (%reg1,%reg1,(x-1)),%reg2" }
  10111. Exit
  10112. else
  10113. PotentialModified := True;
  10114. end;
  10115. else
  10116. { Don't know how to change this, so abort }
  10117. Exit;
  10118. end;
  10119. { Contains highest index (so instruction count - 1) }
  10120. Inc(InstrMax);
  10121. if InstrMax > High(InstrList) then
  10122. SetLength(InstrList, InstrMax + LIST_STEP_SIZE);
  10123. InstrList[InstrMax] := taicpu(next);
  10124. end;
  10125. UpdateUsedRegs(TmpUsedRegs, tai(next.next));
  10126. end;
  10127. if not Assigned(next) or (next <> hp1) then
  10128. { It should be equal to hp1 }
  10129. InternalError(2021051702);
  10130. { Cycle through each instruction and check to see if we can
  10131. change them to versions that don't modify the flags }
  10132. if (InstrMax >= 0) then
  10133. begin
  10134. for Index := 0 to InstrMax do
  10135. case InstrList[Index].opcode of
  10136. A_ADD:
  10137. begin
  10138. DebugMsg(SPeepholeOptimization + 'ADD -> LEA' + SNoFlags, InstrList[Index]);
  10139. InstrList[Index].opcode := A_LEA;
  10140. reference_reset(NewRef, 1, []);
  10141. NewRef.base := InstrList[Index].oper[1]^.reg;
  10142. if InstrList[Index].oper[0]^.typ = top_reg then
  10143. begin
  10144. NewRef.index := InstrList[Index].oper[0]^.reg;
  10145. NewRef.scalefactor := 1;
  10146. end
  10147. else
  10148. NewRef.offset := InstrList[Index].oper[0]^.val;
  10149. InstrList[Index].loadref(0, NewRef);
  10150. end;
  10151. A_SUB:
  10152. begin
  10153. DebugMsg(SPeepholeOptimization + 'SUB -> LEA' + SNoFlags, InstrList[Index]);
  10154. InstrList[Index].opcode := A_LEA;
  10155. reference_reset(NewRef, 1, []);
  10156. NewRef.base := InstrList[Index].oper[1]^.reg;
  10157. NewRef.offset := -InstrList[Index].oper[0]^.val;
  10158. InstrList[Index].loadref(0, NewRef);
  10159. end;
  10160. A_SHL,
  10161. A_SAL:
  10162. begin
  10163. DebugMsg(SPeepholeOptimization + 'SHL -> LEA' + SNoFlags, InstrList[Index]);
  10164. InstrList[Index].opcode := A_LEA;
  10165. reference_reset(NewRef, 1, []);
  10166. NewRef.index := InstrList[Index].oper[1]^.reg;
  10167. NewRef.scalefactor := 1 shl (InstrList[Index].oper[0]^.val);
  10168. InstrList[Index].loadref(0, NewRef);
  10169. end;
  10170. A_IMUL:
  10171. begin
  10172. DebugMsg(SPeepholeOptimization + 'IMUL -> LEA' + SNoFlags, InstrList[Index]);
  10173. InstrList[Index].opcode := A_LEA;
  10174. reference_reset(NewRef, 1, []);
  10175. NewRef.index := InstrList[Index].oper[1]^.reg;
  10176. case InstrList[Index].oper[0]^.val of
  10177. 2, 4, 8:
  10178. NewRef.scalefactor := InstrList[Index].oper[0]^.val;
  10179. else {3, 5 and 9}
  10180. begin
  10181. NewRef.scalefactor := InstrList[Index].oper[0]^.val - 1;
  10182. NewRef.base := InstrList[Index].oper[1]^.reg;
  10183. end;
  10184. end;
  10185. InstrList[Index].loadref(0, NewRef);
  10186. end;
  10187. else
  10188. InternalError(2021051710);
  10189. end;
  10190. end;
  10191. { Mark the FLAGS register as used across this whole block }
  10192. AllocRegBetween(NR_DEFAULTFLAGS, p, hp1, UsedRegs);
  10193. end;
  10194. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  10195. JumpC := taicpu(hp2).condition;
  10196. Unconditional := False;
  10197. if conditions_equal(JumpC, C_E) then
  10198. SetC := inverse_cond(taicpu(p).condition)
  10199. else if conditions_equal(JumpC, C_NE) then
  10200. SetC := taicpu(p).condition
  10201. else
  10202. { We've got something weird here (and inefficent) }
  10203. begin
  10204. DebugMsg('DEBUG: Inefficient jump - check code generation', p);
  10205. SetC := C_NONE;
  10206. { JAE/JNB will always branch (use 'condition_in', since C_AE <> C_NB normally) }
  10207. if condition_in(C_AE, JumpC) then
  10208. Unconditional := True
  10209. else
  10210. { Not sure what to do with this jump - drop out }
  10211. Exit;
  10212. end;
  10213. RemoveInstruction(hp1);
  10214. if Unconditional then
  10215. MakeUnconditional(taicpu(hp2))
  10216. else
  10217. begin
  10218. if SetC = C_NONE then
  10219. InternalError(2018061402);
  10220. taicpu(hp2).SetCondition(SetC);
  10221. end;
  10222. { as hp2 is a jump, we cannot use RegUsedAfterInstruction but we have to check if it is included in
  10223. TmpUsedRegs }
  10224. if not TmpUsedRegs[getregtype(taicpu(p).oper[0]^.reg)].IsUsed(taicpu(p).oper[0]^.reg) then
  10225. begin
  10226. RemoveCurrentp(p, hp2);
  10227. if taicpu(hp2).opcode = A_SETcc then
  10228. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/SETcc -> SETcc',p)
  10229. else
  10230. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/Jcc -> Jcc',p);
  10231. end
  10232. else
  10233. if taicpu(hp2).opcode = A_SETcc then
  10234. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/SETcc -> SETcc/SETcc',p)
  10235. else
  10236. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/Jcc -> SETcc/Jcc',p);
  10237. Result := True;
  10238. end
  10239. else if
  10240. { Make sure the instructions are adjacent }
  10241. (
  10242. not (cs_opt_level3 in current_settings.optimizerswitches) or
  10243. GetNextInstruction(p, hp1)
  10244. ) and
  10245. MatchInstruction(hp1, A_MOV, [S_B]) and
  10246. { Writing to memory is allowed }
  10247. MatchOperand(taicpu(p).oper[0]^, taicpu(hp1).oper[0]^.reg) then
  10248. begin
  10249. {
  10250. Watch out for sequences such as:
  10251. set(c)b %regb
  10252. movb %regb,(ref)
  10253. movb $0,1(ref)
  10254. movb $0,2(ref)
  10255. movb $0,3(ref)
  10256. Much more efficient to turn it into:
  10257. movl $0,%regl
  10258. set(c)b %regb
  10259. movl %regl,(ref)
  10260. Or:
  10261. set(c)b %regb
  10262. movzbl %regb,%regl
  10263. movl %regl,(ref)
  10264. }
  10265. if (taicpu(hp1).oper[1]^.typ = top_ref) and
  10266. GetNextInstruction(hp1, hp2) and
  10267. MatchInstruction(hp2, A_MOV, [S_B]) and
  10268. (taicpu(hp2).oper[1]^.typ = top_ref) and
  10269. CheckMemoryWrite(taicpu(hp1), taicpu(hp2)) then
  10270. begin
  10271. { Don't do anything else except set Result to True }
  10272. end
  10273. else
  10274. begin
  10275. if taicpu(p).oper[0]^.typ = top_reg then
  10276. begin
  10277. TransferUsedRegs(TmpUsedRegs);
  10278. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  10279. end;
  10280. { If it's not a register, it's a memory address }
  10281. if (taicpu(p).oper[0]^.typ <> top_reg) or RegUsedAfterInstruction(taicpu(p).oper[0]^.reg, hp1, TmpUsedRegs) then
  10282. begin
  10283. { Even if the register is still in use, we can minimise the
  10284. pipeline stall by changing the MOV into another SETcc. }
  10285. taicpu(hp1).opcode := A_SETcc;
  10286. taicpu(hp1).condition := taicpu(p).condition;
  10287. if taicpu(hp1).oper[1]^.typ = top_ref then
  10288. begin
  10289. { Swapping the operand pointers like this is probably a
  10290. bit naughty, but it is far faster than using loadoper
  10291. to transfer the reference from oper[1] to oper[0] if
  10292. you take into account the extra procedure calls and
  10293. the memory allocation and deallocation required }
  10294. OperPtr := taicpu(hp1).oper[1];
  10295. taicpu(hp1).oper[1] := taicpu(hp1).oper[0];
  10296. taicpu(hp1).oper[0] := OperPtr;
  10297. end
  10298. else
  10299. taicpu(hp1).oper[0]^.reg := taicpu(hp1).oper[1]^.reg;
  10300. taicpu(hp1).clearop(1);
  10301. taicpu(hp1).ops := 1;
  10302. DebugMsg(SPeepholeOptimization + 'SETcc/Mov -> SETcc/SETcc',p);
  10303. end
  10304. else
  10305. begin
  10306. if taicpu(hp1).oper[1]^.typ = top_reg then
  10307. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,UsedRegs);
  10308. taicpu(p).loadoper(0, taicpu(hp1).oper[1]^);
  10309. RemoveInstruction(hp1);
  10310. DebugMsg(SPeepholeOptimization + 'SETcc/Mov -> SETcc',p);
  10311. end
  10312. end;
  10313. Result := True;
  10314. end;
  10315. end;
  10316. end;
  10317. function TX86AsmOptimizer.OptPass2Jmp(var p : tai) : boolean;
  10318. var
  10319. hp1: tai;
  10320. Count: Integer;
  10321. OrigLabel: TAsmLabel;
  10322. begin
  10323. result := False;
  10324. { Sometimes, the optimisations below can permit this }
  10325. RemoveDeadCodeAfterJump(p);
  10326. 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
  10327. (taicpu(p).oper[0]^.ref^.index=NR_NO) and (taicpu(p).oper[0]^.ref^.symbol is tasmlabel) then
  10328. begin
  10329. OrigLabel := TAsmLabel(taicpu(p).oper[0]^.ref^.symbol);
  10330. { Also a side-effect of optimisations }
  10331. if CollapseZeroDistJump(p, OrigLabel) then
  10332. begin
  10333. Result := True;
  10334. Exit;
  10335. end;
  10336. hp1 := GetLabelWithSym(OrigLabel);
  10337. if (taicpu(p).condition=C_None) and assigned(hp1) and SkipLabels(hp1,hp1) and (hp1.typ = ait_instruction) then
  10338. begin
  10339. if taicpu(hp1).opcode = A_RET then
  10340. begin
  10341. {
  10342. change
  10343. jmp .L1
  10344. ...
  10345. .L1:
  10346. ret
  10347. into
  10348. ret
  10349. }
  10350. begin
  10351. ConvertJumpToRET(p, hp1);
  10352. result:=true;
  10353. end;
  10354. end
  10355. else if (cs_opt_level3 in current_settings.optimizerswitches) and
  10356. not (cs_opt_size in current_settings.optimizerswitches) and
  10357. CheckJumpMovTransferOpt(p, hp1, 0, Count) then
  10358. begin
  10359. Result := True;
  10360. Exit;
  10361. end;
  10362. end;
  10363. end;
  10364. end;
  10365. class function TX86AsmOptimizer.CanBeCMOV(p, cond_p: tai) : boolean;
  10366. begin
  10367. Result := assigned(p) and
  10368. MatchInstruction(p,A_MOV,[S_W,S_L,S_Q]) and
  10369. (taicpu(p).oper[1]^.typ = top_reg) and
  10370. (
  10371. (taicpu(p).oper[0]^.typ = top_reg) or
  10372. { allow references, but only pure symbols or got rel. addressing with RIP as based,
  10373. it is not expected that this can cause a seg. violation }
  10374. (
  10375. (taicpu(p).oper[0]^.typ = top_ref) and
  10376. { TODO: Can we detect which references become constants at this
  10377. stage so we don't have to do a blanket ban? }
  10378. (taicpu(p).oper[0]^.ref^.refaddr <> addr_full) and
  10379. (
  10380. IsRefSafe(taicpu(p).oper[0]^.ref) or
  10381. (
  10382. { If the reference also appears in the condition, then we know it's safe, otherwise
  10383. any kind of access violation would have occurred already }
  10384. Assigned(cond_p) and
  10385. { Make sure the sizes match too so we're reading and writing the same number of bytes }
  10386. (cond_p.typ = ait_instruction) and
  10387. (taicpu(cond_p).opsize = taicpu(p).opsize) and
  10388. { Just consider 2-operand comparison instructions for now to be safe }
  10389. (taicpu(cond_p).ops = 2) and
  10390. (
  10391. ((taicpu(cond_p).oper[1]^.typ = top_ref) and RefsEqual(taicpu(cond_p).oper[1]^.ref^, taicpu(p).oper[0]^.ref^)) or
  10392. (
  10393. (taicpu(cond_p).oper[0]^.typ = top_ref) and
  10394. { Don't risk identical registers but different offsets, as we may have constructs
  10395. such as buffer streams with things like length fields that indicate whether
  10396. any more data follows. And there are probably some contrived examples where
  10397. writing to offsets behind the one being read also lead to access violations }
  10398. RefsEqual(taicpu(cond_p).oper[0]^.ref^, taicpu(p).oper[0]^.ref^) and
  10399. (
  10400. { Check that we're not modifying a register that appears in the reference }
  10401. (InsProp[taicpu(cond_p).opcode].Ch * [Ch_Mop2, Ch_RWop2, Ch_Wop2] = []) or
  10402. (taicpu(cond_p).oper[1]^.typ <> top_reg) or
  10403. not RegInRef(taicpu(cond_p).oper[1]^.reg, taicpu(cond_p).oper[0]^.ref^)
  10404. )
  10405. )
  10406. )
  10407. )
  10408. )
  10409. )
  10410. );
  10411. end;
  10412. class procedure TX86AsmOptimizer.UpdateIntRegsNoDealloc(var AUsedRegs: TAllUsedRegs; p: Tai);
  10413. begin
  10414. { Update integer registers, ignoring deallocations }
  10415. repeat
  10416. while assigned(p) and
  10417. ((p.typ in (SkipInstr - [ait_RegAlloc])) or
  10418. (p.typ = ait_label) or
  10419. ((p.typ = ait_marker) and
  10420. (tai_Marker(p).Kind in [mark_AsmBlockEnd,mark_NoLineInfoStart,mark_NoLineInfoEnd]))) do
  10421. p := tai(p.next);
  10422. while assigned(p) and
  10423. (p.typ=ait_RegAlloc) Do
  10424. begin
  10425. if (getregtype(tai_regalloc(p).reg) = R_INTREGISTER) then
  10426. begin
  10427. case tai_regalloc(p).ratype of
  10428. ra_alloc :
  10429. IncludeRegInUsedRegs(tai_regalloc(p).reg, AUsedRegs);
  10430. else
  10431. ;
  10432. end;
  10433. end;
  10434. p := tai(p.next);
  10435. end;
  10436. until not(assigned(p)) or
  10437. (not(p.typ in SkipInstr) and
  10438. not((p.typ = ait_label) and
  10439. labelCanBeSkipped(tai_label(p))));
  10440. end;
  10441. function TX86AsmOptimizer.OptPass2Jcc(var p : tai) : boolean;
  10442. var
  10443. hp1,hp2: tai;
  10444. carryadd_opcode : TAsmOp;
  10445. symbol: TAsmSymbol;
  10446. increg, tmpreg: TRegister;
  10447. {$ifndef i8086}
  10448. { Code and variables specific to CMOV optimisations }
  10449. hp3,hp4,hp5,
  10450. hp_stop, hp_lblxxx, hp_lblyyy, hpmov1,hpmov2, hp_prev, hp_flagalloc, hp_prev2, hp_new, hp_jump: tai;
  10451. l, c, w, x : Longint;
  10452. condition, second_condition : TAsmCond;
  10453. FoundMatchingJump, RegMatch: Boolean;
  10454. RegWrites: array[0..MAX_CMOV_INSTRUCTIONS*2 - 1] of TRegister;
  10455. ConstRegs: array[0..MAX_CMOV_REGISTERS - 1] of TRegister;
  10456. ConstVals: array[0..MAX_CMOV_REGISTERS - 1] of TCGInt;
  10457. { Tries to convert a mov const,%reg instruction into a CMOV by reserving a
  10458. new register to store the constant }
  10459. function TryCMOVConst(p, search_start_p, stop_search_p: tai; var StoredCount: LongInt; var CMOVCount: LongInt): Boolean;
  10460. var
  10461. RegSize: TSubRegister;
  10462. CurrentVal: TCGInt;
  10463. NewReg: TRegister;
  10464. X: ShortInt;
  10465. begin
  10466. Result := False;
  10467. if not MatchOpType(taicpu(p), top_const, top_reg) then
  10468. Exit;
  10469. if StoredCount >= MAX_CMOV_REGISTERS then
  10470. { Arrays are full }
  10471. Exit;
  10472. { Remember that CMOV can't encode 8-bit registers }
  10473. case taicpu(p).opsize of
  10474. S_W:
  10475. RegSize := R_SUBW;
  10476. S_L:
  10477. RegSize := R_SUBD;
  10478. S_Q:
  10479. RegSize := R_SUBQ;
  10480. else
  10481. InternalError(2021100401);
  10482. end;
  10483. { See if the value has already been reserved for another CMOV instruction }
  10484. CurrentVal := taicpu(p).oper[0]^.val;
  10485. for X := 0 to StoredCount - 1 do
  10486. if ConstVals[X] = CurrentVal then
  10487. begin
  10488. ConstRegs[StoredCount] := ConstRegs[X];
  10489. ConstVals[StoredCount] := CurrentVal;
  10490. Result := True;
  10491. Inc(StoredCount);
  10492. { Don't increase CMOVCount this time, since we're re-using a register }
  10493. Exit;
  10494. end;
  10495. NewReg := GetIntRegisterBetween(RegSize, TmpUsedRegs, search_start_p, stop_search_p, True);
  10496. if NewReg = NR_NO then
  10497. { No free registers }
  10498. Exit;
  10499. { Reserve the register so subsequent TryCMOVConst calls don't all end
  10500. up vying for the same register }
  10501. IncludeRegInUsedRegs(NewReg, TmpUsedRegs);
  10502. ConstRegs[StoredCount] := NewReg;
  10503. ConstVals[StoredCount] := CurrentVal;
  10504. Inc(StoredCount);
  10505. { Increment the CMOV count variable from OptPass2JCC, since the extra
  10506. MOV required adds complexity and will cause diminishing returns
  10507. sooner than normal. This is more of an approximate weighting than
  10508. anything else. }
  10509. Inc(CMOVCount);
  10510. Result := True;
  10511. end;
  10512. {$endif i8086}
  10513. begin
  10514. result:=false;
  10515. if GetNextInstruction(p,hp1) then
  10516. begin
  10517. if (hp1.typ=ait_label) then
  10518. begin
  10519. Result := DoSETccLblRETOpt(p, tai_label(hp1));
  10520. Exit;
  10521. end
  10522. else if (hp1.typ<>ait_instruction) then
  10523. Exit;
  10524. symbol := TAsmLabel(taicpu(p).oper[0]^.ref^.symbol);
  10525. if (
  10526. (
  10527. ((Taicpu(hp1).opcode=A_ADD) or (Taicpu(hp1).opcode=A_SUB)) and
  10528. MatchOptype(Taicpu(hp1),top_const,top_reg) and
  10529. (Taicpu(hp1).oper[0]^.val=1)
  10530. ) or
  10531. ((Taicpu(hp1).opcode=A_INC) or (Taicpu(hp1).opcode=A_DEC))
  10532. ) and
  10533. GetNextInstruction(hp1,hp2) and
  10534. SkipAligns(hp2, hp2) and
  10535. (hp2.typ = ait_label) and
  10536. (Tasmlabel(symbol) = Tai_label(hp2).labsym) then
  10537. { jb @@1 cmc
  10538. inc/dec operand --> adc/sbb operand,0
  10539. @@1:
  10540. ... and ...
  10541. jnb @@1
  10542. inc/dec operand --> adc/sbb operand,0
  10543. @@1: }
  10544. begin
  10545. if Taicpu(p).condition in [C_NAE,C_B,C_C] then
  10546. begin
  10547. case taicpu(hp1).opcode of
  10548. A_INC,
  10549. A_ADD:
  10550. carryadd_opcode:=A_ADC;
  10551. A_DEC,
  10552. A_SUB:
  10553. carryadd_opcode:=A_SBB;
  10554. else
  10555. InternalError(2021011001);
  10556. end;
  10557. Taicpu(p).clearop(0);
  10558. Taicpu(p).ops:=0;
  10559. Taicpu(p).is_jmp:=false;
  10560. Taicpu(p).opcode:=A_CMC;
  10561. Taicpu(p).condition:=C_NONE;
  10562. DebugMsg(SPeepholeOptimization+'JccAdd/Inc/Dec2CmcAdc/Sbb',p);
  10563. Taicpu(hp1).ops:=2;
  10564. if (Taicpu(hp1).opcode=A_ADD) or (Taicpu(hp1).opcode=A_SUB) then
  10565. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[1]^)
  10566. else
  10567. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[0]^);
  10568. Taicpu(hp1).loadconst(0,0);
  10569. Taicpu(hp1).opcode:=carryadd_opcode;
  10570. result:=true;
  10571. exit;
  10572. end
  10573. else if Taicpu(p).condition in [C_AE,C_NB,C_NC] then
  10574. begin
  10575. case taicpu(hp1).opcode of
  10576. A_INC,
  10577. A_ADD:
  10578. carryadd_opcode:=A_ADC;
  10579. A_DEC,
  10580. A_SUB:
  10581. carryadd_opcode:=A_SBB;
  10582. else
  10583. InternalError(2021011002);
  10584. end;
  10585. Taicpu(hp1).ops:=2;
  10586. DebugMsg(SPeepholeOptimization+'JccAdd/Inc/Dec2Adc/Sbb',p);
  10587. if (Taicpu(hp1).opcode=A_ADD) or (Taicpu(hp1).opcode=A_SUB) then
  10588. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[1]^)
  10589. else
  10590. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[0]^);
  10591. Taicpu(hp1).loadconst(0,0);
  10592. Taicpu(hp1).opcode:=carryadd_opcode;
  10593. RemoveCurrentP(p, hp1);
  10594. result:=true;
  10595. exit;
  10596. end
  10597. {
  10598. jcc @@1 setcc tmpreg
  10599. inc/dec/add/sub operand -> (movzx tmpreg)
  10600. @@1: add/sub tmpreg,operand
  10601. While this increases code size slightly, it makes the code much faster if the
  10602. jump is unpredictable
  10603. }
  10604. else if not(cs_opt_size in current_settings.optimizerswitches) then
  10605. begin
  10606. { search for an available register which is volatile }
  10607. increg := GetIntRegisterBetween(R_SUBL, UsedRegs, p, hp1);
  10608. if increg <> NR_NO then
  10609. begin
  10610. { We don't need to check if tmpreg is in hp1 or not, because
  10611. it will be marked as in use at p (if not, this is
  10612. indictive of a compiler bug). }
  10613. TAsmLabel(symbol).decrefs;
  10614. Taicpu(p).clearop(0);
  10615. Taicpu(p).ops:=1;
  10616. Taicpu(p).is_jmp:=false;
  10617. Taicpu(p).opcode:=A_SETcc;
  10618. DebugMsg(SPeepholeOptimization+'JccAdd2SetccAdd',p);
  10619. Taicpu(p).condition:=inverse_cond(Taicpu(p).condition);
  10620. Taicpu(p).loadreg(0,increg);
  10621. if getsubreg(Taicpu(hp1).oper[1]^.reg)<>R_SUBL then
  10622. begin
  10623. case getsubreg(Taicpu(hp1).oper[1]^.reg) of
  10624. R_SUBW:
  10625. begin
  10626. tmpreg := newreg(R_INTREGISTER,getsupreg(increg),R_SUBW);
  10627. hp2:=Taicpu.op_reg_reg(A_MOVZX,S_BW,increg,tmpreg);
  10628. end;
  10629. R_SUBD:
  10630. begin
  10631. tmpreg := newreg(R_INTREGISTER,getsupreg(increg),R_SUBD);
  10632. hp2:=Taicpu.op_reg_reg(A_MOVZX,S_BL,increg,tmpreg);
  10633. end;
  10634. {$ifdef x86_64}
  10635. R_SUBQ:
  10636. begin
  10637. { MOVZX doesn't have a 64-bit variant, because
  10638. the 32-bit version implicitly zeroes the
  10639. upper 32-bits of the destination register }
  10640. tmpreg := newreg(R_INTREGISTER,getsupreg(increg),R_SUBD);
  10641. hp2:=Taicpu.op_reg_reg(A_MOVZX,S_BL,increg,tmpreg);
  10642. setsubreg(tmpreg, R_SUBQ);
  10643. end;
  10644. {$endif x86_64}
  10645. else
  10646. Internalerror(2020030601);
  10647. end;
  10648. taicpu(hp2).fileinfo:=taicpu(hp1).fileinfo;
  10649. asml.InsertAfter(hp2,p);
  10650. end
  10651. else
  10652. tmpreg := increg;
  10653. if (Taicpu(hp1).opcode=A_INC) or (Taicpu(hp1).opcode=A_DEC) then
  10654. begin
  10655. Taicpu(hp1).ops:=2;
  10656. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[0]^)
  10657. end;
  10658. Taicpu(hp1).loadreg(0,tmpreg);
  10659. AllocRegBetween(tmpreg,p,hp1,UsedRegs);
  10660. Result := True;
  10661. { p is no longer a Jcc instruction, so exit }
  10662. Exit;
  10663. end;
  10664. end;
  10665. end;
  10666. { Detect the following:
  10667. jmp<cond> @Lbl1
  10668. jmp @Lbl2
  10669. ...
  10670. @Lbl1:
  10671. ret
  10672. Change to:
  10673. jmp<inv_cond> @Lbl2
  10674. ret
  10675. }
  10676. if MatchInstruction(hp1,A_JMP,[]) and (taicpu(hp1).oper[0]^.ref^.refaddr=addr_full) then
  10677. begin
  10678. hp2:=getlabelwithsym(TAsmLabel(symbol));
  10679. if Assigned(hp2) and SkipLabels(hp2,hp2) and
  10680. MatchInstruction(hp2,A_RET,[S_NO]) then
  10681. begin
  10682. taicpu(p).condition := inverse_cond(taicpu(p).condition);
  10683. { Change label address to that of the unconditional jump }
  10684. taicpu(p).loadoper(0, taicpu(hp1).oper[0]^);
  10685. TAsmLabel(symbol).DecRefs;
  10686. taicpu(hp1).opcode := A_RET;
  10687. taicpu(hp1).is_jmp := false;
  10688. taicpu(hp1).ops := taicpu(hp2).ops;
  10689. DebugMsg(SPeepholeOptimization+'JccJmpRet2J!ccRet',p);
  10690. case taicpu(hp2).ops of
  10691. 0:
  10692. taicpu(hp1).clearop(0);
  10693. 1:
  10694. taicpu(hp1).loadconst(0,taicpu(hp2).oper[0]^.val);
  10695. else
  10696. internalerror(2016041302);
  10697. end;
  10698. end;
  10699. {$ifndef i8086}
  10700. end
  10701. {
  10702. convert
  10703. j<c> .L1
  10704. mov 1,reg
  10705. jmp .L2
  10706. .L1
  10707. mov 0,reg
  10708. .L2
  10709. into
  10710. mov 0,reg
  10711. set<not(c)> reg
  10712. take care of alignment and that the mov 0,reg is not converted into a xor as this
  10713. would destroy the flag contents
  10714. }
  10715. else if MatchInstruction(hp1,A_MOV,[]) and
  10716. MatchOpType(taicpu(hp1),top_const,top_reg) and
  10717. {$ifdef i386}
  10718. (
  10719. { Under i386, ESI, EDI, EBP and ESP
  10720. don't have an 8-bit representation }
  10721. not (getsupreg(taicpu(hp1).oper[1]^.reg) in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  10722. ) and
  10723. {$endif i386}
  10724. (taicpu(hp1).oper[0]^.val=1) and
  10725. GetNextInstruction(hp1,hp2) and
  10726. MatchInstruction(hp2,A_JMP,[]) and (taicpu(hp2).oper[0]^.ref^.refaddr=addr_full) and
  10727. GetNextInstruction(hp2,hp3) and
  10728. { skip align }
  10729. ((hp3.typ<>ait_align) or GetNextInstruction(hp3,hp3)) and
  10730. (hp3.typ=ait_label) and
  10731. (tasmlabel(taicpu(p).oper[0]^.ref^.symbol)=tai_label(hp3).labsym) and
  10732. (tai_label(hp3).labsym.getrefs=1) and
  10733. GetNextInstruction(hp3,hp4) and
  10734. MatchInstruction(hp4,A_MOV,[]) and
  10735. MatchOpType(taicpu(hp4),top_const,top_reg) and
  10736. (taicpu(hp4).oper[0]^.val=0) and
  10737. MatchOperand(taicpu(hp1).oper[1]^,taicpu(hp4).oper[1]^) and
  10738. GetNextInstruction(hp4,hp5) and
  10739. (hp5.typ=ait_label) and
  10740. (tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol)=tai_label(hp5).labsym) and
  10741. (tai_label(hp5).labsym.getrefs=1) then
  10742. begin
  10743. AllocRegBetween(NR_FLAGS,p,hp4,UsedRegs);
  10744. DebugMsg(SPeepholeOptimization+'JccMovJmpMov2MovSetcc',p);
  10745. { remove last label }
  10746. RemoveInstruction(hp5);
  10747. { remove second label }
  10748. RemoveInstruction(hp3);
  10749. { if align is present remove it }
  10750. if GetNextInstruction(hp2,hp3) and (hp3.typ=ait_align) then
  10751. RemoveInstruction(hp3);
  10752. { remove jmp }
  10753. RemoveInstruction(hp2);
  10754. if taicpu(hp1).opsize=S_B then
  10755. RemoveInstruction(hp1)
  10756. else
  10757. taicpu(hp1).loadconst(0,0);
  10758. taicpu(hp4).opcode:=A_SETcc;
  10759. taicpu(hp4).opsize:=S_B;
  10760. taicpu(hp4).condition:=inverse_cond(taicpu(p).condition);
  10761. taicpu(hp4).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(hp4).oper[1]^.reg),R_SUBL));
  10762. taicpu(hp4).opercnt:=1;
  10763. taicpu(hp4).ops:=1;
  10764. taicpu(hp4).freeop(1);
  10765. RemoveCurrentP(p);
  10766. Result:=true;
  10767. exit;
  10768. end
  10769. else if (CPUX86_HAS_CMOV in cpu_capabilities[current_settings.optimizecputype]) and
  10770. MatchInstruction(hp1,A_MOV,[S_W,S_L{$ifdef x86_64},S_Q{$endif x86_64}]) then
  10771. begin
  10772. { check for
  10773. jCC xxx
  10774. <several movs>
  10775. xxx:
  10776. Also spot:
  10777. Jcc xxx
  10778. <several movs>
  10779. jmp xxx
  10780. Change to:
  10781. <several cmovs with inverted condition>
  10782. jmp xxx (only for the 2nd case)
  10783. }
  10784. hp2 := p;
  10785. hp_lblxxx := hp1;
  10786. hp_flagalloc := nil;
  10787. hp_stop := nil;
  10788. FoundMatchingJump := False;
  10789. { Remember the first instruction in the first block of MOVs }
  10790. hpmov1 := hp1;
  10791. TransferUsedRegs(TmpUsedRegs);
  10792. while assigned(hp_lblxxx) and
  10793. { stop on labels }
  10794. (hp_lblxxx.typ <> ait_label) do
  10795. begin
  10796. { Keep track of all integer registers that are used }
  10797. UpdateIntRegsNoDealloc(TmpUsedRegs, tai(hp2.Next));
  10798. if hp_lblxxx.typ = ait_instruction then
  10799. begin
  10800. if (taicpu(hp_lblxxx).opcode = A_JMP) and
  10801. IsJumpToLabel(taicpu(hp_lblxxx)) then
  10802. begin
  10803. hp_stop := hp_lblxxx;
  10804. if (TAsmLabel(taicpu(hp_lblxxx).oper[0]^.ref^.symbol) = symbol) then
  10805. begin
  10806. { We found Jcc xxx; <several movs>; Jmp xxx }
  10807. FoundMatchingJump := True;
  10808. Break;
  10809. end;
  10810. { If it's not the jump we're looking for, it's
  10811. possibly the "if..else" variant }
  10812. end
  10813. { Check to see if we have a valid MOV instruction instead }
  10814. else if (taicpu(hp_lblxxx).opcode <> A_MOV) or
  10815. not (taicpu(hp_lblxxx).opsize in [S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  10816. Break
  10817. else
  10818. { This will be a valid MOV }
  10819. hp_stop := hp_lblxxx;
  10820. end;
  10821. hp2 := hp_lblxxx;
  10822. GetNextInstruction(hp_lblxxx, hp_lblxxx);
  10823. end;
  10824. { Just make sure the last MOV is included if there's no jump }
  10825. if (hp_lblxxx.typ = ait_label) and MatchInstruction(hp_stop, A_MOV, []) then
  10826. hp_stop := hp_lblxxx;
  10827. { Note, the logic behind using hp_stop over hp_lblxxx in the
  10828. range for TryCMOVConst is so GetIntRegisterBetween doesn't
  10829. fail when it reaches a JMP instruction in the "jcc xxx; movs;
  10830. jmp yyy; xxx:; movs; yyy:" variation }
  10831. if assigned(hp_lblxxx) and
  10832. (
  10833. { If we found JMP xxx, we don't actually need a label
  10834. (hp_lblxxx is the JMP instruction instead) }
  10835. FoundMatchingJump or
  10836. { Make sure we actually have the right label }
  10837. FindLabel(TAsmLabel(symbol), hp_lblxxx)
  10838. ) then
  10839. begin
  10840. { Use TmpUsedRegs to track registers that we reserve }
  10841. { When allocating temporary registers, try to look one
  10842. instruction back, as defining them before a CMP or TEST
  10843. instruction will be faster, and also avoid picking a
  10844. register that was only just deallocated }
  10845. if GetLastInstruction(p, hp_prev) and
  10846. 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
  10847. begin
  10848. { Mark all the registers in the comparison as 'in use', even if they've just been deallocated }
  10849. for l := 0 to 1 do
  10850. with taicpu(hp_prev).oper[l]^ do
  10851. case typ of
  10852. top_reg:
  10853. if getregtype(reg) = R_INTREGISTER then
  10854. IncludeRegInUsedRegs(reg, TmpUsedRegs);
  10855. top_ref:
  10856. begin
  10857. if
  10858. {$ifdef x86_64}
  10859. (ref^.base <> NR_RIP) and
  10860. {$endif x86_64}
  10861. (ref^.base <> NR_NO) then
  10862. IncludeRegInUsedRegs(ref^.base, TmpUsedRegs);
  10863. if (ref^.index <> NR_NO) then
  10864. IncludeRegInUsedRegs(ref^.index, TmpUsedRegs);
  10865. end
  10866. else
  10867. ;
  10868. end;
  10869. { When inserting instructions before hp_prev, try to insert
  10870. them before the allocation of the FLAGS register }
  10871. if not SetAndTest(FindRegAllocBackward(NR_DEFAULTFLAGS, tai(hp_prev.Previous)), hp_flagalloc) then
  10872. { If not found, set it equal to hp_prev so it's something sensible }
  10873. hp_flagalloc := hp_prev;
  10874. hp_prev2 := nil;
  10875. { When dealing with a comparison against zero, take
  10876. note of the instruction before it to see if we can
  10877. move instructions further back in order to benefit
  10878. PostPeepholeOptTestOr.
  10879. }
  10880. if (
  10881. (
  10882. (taicpu(hp_prev).opcode = A_CMP) and
  10883. MatchOperand(taicpu(hp_prev).oper[0]^, 0)
  10884. ) or
  10885. (
  10886. (taicpu(hp_prev).opcode = A_TEST) and
  10887. (
  10888. OpsEqual(taicpu(hp_prev).oper[0]^, taicpu(hp_prev).oper[1]^) or
  10889. MatchOperand(taicpu(hp_prev).oper[0]^, -1)
  10890. )
  10891. )
  10892. ) and
  10893. GetLastInstruction(hp_prev, hp_prev2) then
  10894. begin
  10895. if (hp_prev2.typ = ait_instruction) and
  10896. { These instructions set the zero flag if the result is zero }
  10897. MatchInstruction(hp_prev2, [A_ADD, A_SUB, A_OR, A_XOR, A_AND, A_POPCNT, A_LZCNT], []) then
  10898. begin
  10899. { Also mark all the registers in this previous instruction
  10900. as 'in use', even if they've just been deallocated }
  10901. for l := 0 to 1 do
  10902. with taicpu(hp_prev2).oper[l]^ do
  10903. case typ of
  10904. top_reg:
  10905. if getregtype(reg) = R_INTREGISTER then
  10906. IncludeRegInUsedRegs(reg, TmpUsedRegs);
  10907. top_ref:
  10908. begin
  10909. if
  10910. {$ifdef x86_64}
  10911. (ref^.base <> NR_RIP) and
  10912. {$endif x86_64}
  10913. (ref^.base <> NR_NO) then
  10914. IncludeRegInUsedRegs(ref^.base, TmpUsedRegs);
  10915. if (ref^.index <> NR_NO) then
  10916. IncludeRegInUsedRegs(ref^.index, TmpUsedRegs);
  10917. end
  10918. else
  10919. ;
  10920. end;
  10921. end
  10922. else
  10923. { Unsuitable instruction }
  10924. hp_prev2 := nil;
  10925. end;
  10926. end
  10927. else
  10928. begin
  10929. hp_prev := p;
  10930. { When inserting instructions before hp_prev, try to insert
  10931. them before the allocation of the FLAGS register }
  10932. if not SetAndTest(FindRegAllocBackward(NR_DEFAULTFLAGS, tai(p.Previous)), hp_flagalloc) then
  10933. { If not found, set it equal to p so it's something sensible }
  10934. hp_flagalloc := p;
  10935. hp_prev2 := nil;
  10936. end;
  10937. l := 0;
  10938. c := 0;
  10939. { Initialise RegWrites, ConstRegs and ConstVals }
  10940. FillChar(RegWrites[0], MAX_CMOV_INSTRUCTIONS * 2 * SizeOf(TRegister), 0);
  10941. FillChar(ConstRegs[0], MAX_CMOV_REGISTERS * SizeOf(TRegister), 0);
  10942. FillChar(ConstVals[0], MAX_CMOV_REGISTERS * SizeOf(TCGInt), 0);
  10943. while assigned(hp1) and
  10944. { Stop on the label we found }
  10945. (hp1 <> hp_lblxxx) do
  10946. begin
  10947. case hp1.typ of
  10948. ait_instruction:
  10949. if MatchInstruction(hp1, A_MOV, [S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  10950. begin
  10951. if CanBeCMOV(hp1, hp_prev) then
  10952. Inc(l)
  10953. else if not (cs_opt_size in current_settings.optimizerswitches) and
  10954. { CMOV with constants grows the code size }
  10955. TryCMOVConst(hp1, hp_prev, hp_stop, c, l) then
  10956. begin
  10957. { Register was reserved by TryCMOVConst and
  10958. stored on ConstRegs[c] }
  10959. end
  10960. else
  10961. Break;
  10962. end
  10963. else
  10964. Break;
  10965. else
  10966. ;
  10967. end;
  10968. GetNextInstruction(hp1,hp1);
  10969. end;
  10970. if (hp1 = hp_lblxxx) then
  10971. begin
  10972. if (l <= MAX_CMOV_INSTRUCTIONS) and (l > 0) then
  10973. begin
  10974. { Repurpose TmpUsedRegs to mark registers that we've defined }
  10975. TmpUsedRegs[R_INTREGISTER].Clear;
  10976. x := 0;
  10977. AllocRegBetween(NR_DEFAULTFLAGS, p, hp_lblxxx, UsedRegs);
  10978. condition := inverse_cond(taicpu(p).condition);
  10979. UpdateUsedRegs(tai(p.next));
  10980. hp1 := hpmov1;
  10981. repeat
  10982. if not Assigned(hp1) then
  10983. InternalError(2018062900);
  10984. if (hp1.typ = ait_instruction) then
  10985. begin
  10986. { Extra safeguard }
  10987. if (taicpu(hp1).opcode <> A_MOV) then
  10988. InternalError(2018062901);
  10989. if taicpu(hp1).oper[0]^.typ = top_const then
  10990. begin
  10991. if x >= MAX_CMOV_REGISTERS then
  10992. InternalError(2021100410);
  10993. { If it's in TmpUsedRegs, then this register
  10994. is being used more than once and hence has
  10995. already had its value defined (it gets
  10996. added to UsedRegs through AllocRegBetween
  10997. below) }
  10998. if not TmpUsedRegs[R_INTREGISTER].IsUsed(ConstRegs[x]) then
  10999. begin
  11000. hp_new := taicpu.op_const_reg(A_MOV, taicpu(hp1).opsize, taicpu(hp1).oper[0]^.val, ConstRegs[x]);
  11001. taicpu(hp_new).fileinfo := taicpu(hp_prev).fileinfo;
  11002. asml.InsertBefore(hp_new, hp_flagalloc);
  11003. if Assigned(hp_prev2) then
  11004. TrySwapMovOp(hp_prev2, hp_new);
  11005. IncludeRegInUsedRegs(ConstRegs[x], TmpUsedRegs);
  11006. end
  11007. else
  11008. { We just need an instruction between hp_prev and hp1
  11009. where we know the register is marked as in use }
  11010. hp_new := hpmov1;
  11011. AllocRegBetween(ConstRegs[x], hp_new, hp1, UsedRegs);
  11012. taicpu(hp1).loadreg(0, ConstRegs[x]);
  11013. Inc(x);
  11014. end;
  11015. taicpu(hp1).opcode := A_CMOVcc;
  11016. taicpu(hp1).condition := condition;
  11017. end;
  11018. UpdateUsedRegs(tai(hp1.next));
  11019. GetNextInstruction(hp1, hp1);
  11020. until (hp1 = hp_lblxxx);
  11021. hp2 := hp_lblxxx;
  11022. repeat
  11023. if not Assigned(hp2) then
  11024. InternalError(2018062910);
  11025. case hp2.typ of
  11026. ait_label:
  11027. { What we expected - break out of the loop (it won't be a dead label at the top of
  11028. a cluster because that was optimised at an earlier stage) }
  11029. Break;
  11030. ait_align:
  11031. { Go to the next entry until a label is found (may be multiple aligns before it) }
  11032. begin
  11033. hp2 := tai(hp2.Next);
  11034. Continue;
  11035. end;
  11036. ait_instruction:
  11037. begin
  11038. if taicpu(hp2).opcode<>A_JMP then
  11039. InternalError(2018062912);
  11040. { This is the Jcc @Lbl; <several movs>; JMP @Lbl variant }
  11041. Break;
  11042. end
  11043. else
  11044. begin
  11045. { Might be a comment or temporary allocation entry }
  11046. if not (hp2.typ in SkipInstr) then
  11047. InternalError(2018062911);
  11048. hp2 := tai(hp2.Next);
  11049. Continue;
  11050. end;
  11051. end;
  11052. until False;
  11053. { Now we can safely decrement the reference count }
  11054. tasmlabel(symbol).decrefs;
  11055. DebugMsg(SPeepholeOptimization+'JccMov2CMov',p);
  11056. { Remove the original jump }
  11057. RemoveInstruction(p); { Note, the choice to not use RemoveCurrentp is deliberate }
  11058. if hp2.typ=ait_instruction then
  11059. begin
  11060. p := hp2;
  11061. Result := True;
  11062. end
  11063. else
  11064. begin
  11065. UpdateUsedRegs(tai(hp2.next));
  11066. Result := GetNextInstruction(hp2, p); { Instruction after the label }
  11067. { Remove the label if this is its final reference }
  11068. if (tasmlabel(symbol).getrefs=0) then
  11069. begin
  11070. { Make sure the aligns get stripped too }
  11071. hp1 := tai(hp_lblxxx.Previous);
  11072. while Assigned(hp1) and (hp1.typ = ait_align) do
  11073. begin
  11074. hp_lblxxx := hp1;
  11075. hp1 := tai(hp_lblxxx.Previous);
  11076. end;
  11077. StripLabelFast(hp_lblxxx);
  11078. end;
  11079. end;
  11080. Exit;
  11081. end;
  11082. end
  11083. else if assigned(hp_lblxxx) and
  11084. { check further for
  11085. jCC xxx
  11086. <several movs 1>
  11087. jmp yyy
  11088. xxx:
  11089. <several movs 2>
  11090. yyy:
  11091. }
  11092. (l <= MAX_CMOV_INSTRUCTIONS - 1) and
  11093. { hp1 should be pointing to jmp yyy }
  11094. MatchInstruction(hp1, A_JMP, []) and
  11095. { real label and jump, no further references to the
  11096. label are allowed }
  11097. (TAsmLabel(symbol).getrefs=1) and
  11098. FindLabel(TAsmLabel(symbol), hp_lblxxx) then
  11099. begin
  11100. hp_jump := hp1;
  11101. { Don't set c to zero }
  11102. l := 0;
  11103. w := 0;
  11104. GetNextInstruction(hp_lblxxx, hpmov2);
  11105. hp2 := hp_lblxxx;
  11106. hp_lblyyy := hpmov2;
  11107. while assigned(hp_lblyyy) and
  11108. { stop on labels }
  11109. (hp_lblyyy.typ <> ait_label) do
  11110. begin
  11111. { Keep track of all integer registers that are used }
  11112. UpdateIntRegsNoDealloc(TmpUsedRegs, tai(hp2.Next));
  11113. if not MatchInstruction(hp_lblyyy, A_MOV, [S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  11114. Break;
  11115. hp2 := hp_lblyyy;
  11116. GetNextInstruction(hp_lblyyy, hp_lblyyy);
  11117. end;
  11118. { Analyse the second batch of MOVs to see if the setup is valid }
  11119. hp1 := hpmov2;
  11120. while assigned(hp1) and
  11121. (hp1 <> hp_lblyyy) do
  11122. begin
  11123. case hp1.typ of
  11124. ait_instruction:
  11125. if MatchInstruction(hp1, A_MOV, [S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  11126. begin
  11127. if CanBeCMOV(hp1, hp_prev) then
  11128. Inc(l)
  11129. else if not (cs_opt_size in current_settings.optimizerswitches)
  11130. { CMOV with constants grows the code size }
  11131. and TryCMOVConst(hp1, hpmov2, hp_lblyyy, c, l) then
  11132. begin
  11133. { Register was reserved by TryCMOVConst and
  11134. stored on ConstRegs[c] }
  11135. end
  11136. else
  11137. Break;
  11138. end
  11139. else
  11140. Break;
  11141. else
  11142. ;
  11143. end;
  11144. GetNextInstruction(hp1,hp1);
  11145. end;
  11146. { Repurpose TmpUsedRegs to mark registers that we've defined }
  11147. TmpUsedRegs[R_INTREGISTER].Clear;
  11148. if (l <= MAX_CMOV_INSTRUCTIONS - 1) and
  11149. (hp1 = hp_lblyyy) and
  11150. FindLabel(TAsmLabel(taicpu(hp_jump).oper[0]^.ref^.symbol), hp_lblyyy) then
  11151. begin
  11152. AllocRegBetween(NR_DEFAULTFLAGS, p, hp_lblyyy, UsedRegs);
  11153. second_condition := taicpu(p).condition;
  11154. condition := inverse_cond(taicpu(p).condition);
  11155. UpdateUsedRegs(tai(p.next));
  11156. { Scan through the first set of MOVs to update UsedRegs,
  11157. but don't process them yet }
  11158. hp1 := hpmov1;
  11159. repeat
  11160. if not Assigned(hp1) then
  11161. InternalError(2018062901);
  11162. UpdateUsedRegs(tai(hp1.next));
  11163. GetNextInstruction(hp1, hp1);
  11164. until (hp1 = hp_lblxxx);
  11165. UpdateUsedRegs(tai(hp_lblxxx.next));
  11166. { Process the second set of MOVs first,
  11167. because if a destination register is
  11168. shared between the first and second MOV
  11169. sets, it is more efficient to turn the
  11170. first one into a MOV instruction and place
  11171. it before the CMP if possible, but we
  11172. won't know which registers are shared
  11173. until we've processed at least one list,
  11174. so we might as well make it the second
  11175. one since that won't be modified again. }
  11176. hp1 := hpmov2;
  11177. repeat
  11178. if not Assigned(hp1) then
  11179. InternalError(2018062902);
  11180. if (hp1.typ = ait_instruction) then
  11181. begin
  11182. { Extra safeguard }
  11183. if (taicpu(hp1).opcode <> A_MOV) then
  11184. InternalError(2018062903);
  11185. if taicpu(hp1).oper[0]^.typ = top_const then
  11186. begin
  11187. RegMatch := False;
  11188. for x := 0 to c - 1 do
  11189. if (ConstVals[x] = taicpu(hp1).oper[0]^.val) then
  11190. begin
  11191. RegMatch := True;
  11192. { If it's in TmpUsedRegs, then this register
  11193. is being used more than once and hence has
  11194. already had its value defined (it gets
  11195. added to UsedRegs through AllocRegBetween
  11196. below) }
  11197. if not TmpUsedRegs[R_INTREGISTER].IsUsed(ConstRegs[x]) then
  11198. begin
  11199. hp_new := taicpu.op_const_reg(A_MOV, taicpu(hp1).opsize, taicpu(hp1).oper[0]^.val, ConstRegs[x]);
  11200. asml.InsertBefore(hp_new, hp_flagalloc);
  11201. if Assigned(hp_prev2) then
  11202. TrySwapMovOp(hp_prev2, hp_new);
  11203. IncludeRegInUsedRegs(ConstRegs[x], TmpUsedRegs);
  11204. end
  11205. else
  11206. { We just need an instruction between hp_prev and hp1
  11207. where we know the register is marked as in use }
  11208. hp_new := hpmov2;
  11209. AllocRegBetween(ConstRegs[x], hp_new, hp1, UsedRegs);
  11210. taicpu(hp1).loadreg(0, ConstRegs[x]);
  11211. Break;
  11212. end;
  11213. if not RegMatch then
  11214. InternalError(2021100411);
  11215. end;
  11216. taicpu(hp1).opcode := A_CMOVcc;
  11217. taicpu(hp1).condition := second_condition;
  11218. { Store these writes to search for
  11219. duplicates later on }
  11220. RegWrites[w] := taicpu(hp1).oper[1]^.reg;
  11221. Inc(w);
  11222. end;
  11223. UpdateUsedRegs(tai(hp1.next));
  11224. GetNextInstruction(hp1, hp1);
  11225. until (hp1 = hp_lblyyy);
  11226. { Now do the first set of MOVs }
  11227. hp1 := hpmov1;
  11228. repeat
  11229. if not Assigned(hp1) then
  11230. InternalError(2018062904);
  11231. if (hp1.typ = ait_instruction) then
  11232. begin
  11233. RegMatch := False;
  11234. { Extra safeguard }
  11235. if (taicpu(hp1).opcode <> A_MOV) then
  11236. InternalError(2018062905);
  11237. { Search through the RegWrites list to see
  11238. if there are any opposing CMOV pairs that
  11239. write to the same register }
  11240. for x := 0 to w - 1 do
  11241. if (RegWrites[x] = taicpu(hp1).oper[1]^.reg) then
  11242. begin
  11243. { We have a match. Keep this as a MOV }
  11244. { Move ahead in preparation }
  11245. GetNextInstruction(hp1, hp1);
  11246. RegMatch := True;
  11247. Break;
  11248. end;
  11249. if RegMatch then
  11250. Continue;
  11251. if taicpu(hp1).oper[0]^.typ = top_const then
  11252. begin
  11253. RegMatch := False;
  11254. for x := 0 to c - 1 do
  11255. if (ConstVals[x] = taicpu(hp1).oper[0]^.val) then
  11256. begin
  11257. RegMatch := True;
  11258. { If it's in TmpUsedRegs, then this register
  11259. is being used more than once and hence has
  11260. already had its value defined (it gets
  11261. added to UsedRegs through AllocRegBetween
  11262. below) }
  11263. if not TmpUsedRegs[R_INTREGISTER].IsUsed(ConstRegs[x]) then
  11264. begin
  11265. hp_new := taicpu.op_const_reg(A_MOV, taicpu(hp1).opsize, taicpu(hp1).oper[0]^.val, ConstRegs[x]);
  11266. asml.InsertBefore(hp_new, hp_flagalloc);
  11267. if Assigned(hp_prev2) then
  11268. TrySwapMovOp(hp_prev2, hp_new);
  11269. IncludeRegInUsedRegs(ConstRegs[x], TmpUsedRegs);
  11270. end
  11271. else
  11272. { We just need an instruction between hp_prev and hp1
  11273. where we know the register is marked as in use }
  11274. hp_new := hpmov1;
  11275. AllocRegBetween(ConstRegs[x], hp_new, hp1, UsedRegs);
  11276. taicpu(hp1).loadreg(0, ConstRegs[x]);
  11277. Break;
  11278. end;
  11279. if not RegMatch then
  11280. InternalError(2021100412);
  11281. end;
  11282. taicpu(hp1).opcode := A_CMOVcc;
  11283. taicpu(hp1).condition := condition;
  11284. end;
  11285. GetNextInstruction(hp1, hp1);
  11286. until (hp1 = hp_jump); { Stop at the jump, not lbl xxx }
  11287. UpdateUsedRegs(tai(hp_jump.next));
  11288. UpdateUsedRegs(tai(hp_lblyyy.next));
  11289. { Get first instruction after label }
  11290. hp1 := p;
  11291. GetNextInstruction(hp_lblyyy, p);
  11292. { Don't dereference yet, as doing so will cause
  11293. GetNextInstruction to skip the label and
  11294. optional align marker. [Kit] }
  11295. DebugMsg(SPeepholeOptimization+'JccMovJmpMov2CMovCMov',hp1);
  11296. { remove Jcc }
  11297. RemoveInstruction(hp1);
  11298. { Now we can safely decrement it }
  11299. tasmlabel(symbol).decrefs;
  11300. { Remove label xxx (it will have a ref of zero due to the initial check) }
  11301. { Make sure the aligns get stripped too }
  11302. hp1 := tai(hp_lblxxx.Previous);
  11303. while Assigned(hp1) and (hp1.typ = ait_align) do
  11304. begin
  11305. hp_lblxxx := hp1;
  11306. hp1 := tai(hp_lblxxx.Previous);
  11307. end;
  11308. StripLabelFast(hp_lblxxx);
  11309. { remove jmp }
  11310. symbol := taicpu(hp_jump).oper[0]^.ref^.symbol;
  11311. RemoveInstruction(hp_jump);
  11312. { As before, now we can safely decrement it }
  11313. TAsmLabel(symbol).decrefs;
  11314. { Remove label yyy (and the optional alignment) if its reference falls to zero }
  11315. if TAsmLabel(symbol).getrefs = 0 then
  11316. begin
  11317. { Make sure the aligns get stripped too }
  11318. hp1 := tai(hp_lblyyy.Previous);
  11319. while Assigned(hp1) and (hp1.typ = ait_align) do
  11320. begin
  11321. hp_lblyyy := hp1;
  11322. hp1 := tai(hp_lblyyy.Previous);
  11323. end;
  11324. StripLabelFast(hp_lblyyy);
  11325. end;
  11326. if Assigned(p) then
  11327. result := True;
  11328. exit;
  11329. end;
  11330. end;
  11331. end;
  11332. {$endif i8086}
  11333. end;
  11334. end;
  11335. end;
  11336. function TX86AsmOptimizer.OptPass1Movx(var p : tai) : boolean;
  11337. var
  11338. hp1,hp2,hp3: tai;
  11339. reg_and_hp1_is_instr, RegUsed, AndTest: Boolean;
  11340. NewSize: TOpSize;
  11341. NewRegSize: TSubRegister;
  11342. Limit: TCgInt;
  11343. SwapOper: POper;
  11344. begin
  11345. result:=false;
  11346. reg_and_hp1_is_instr:=(taicpu(p).oper[1]^.typ = top_reg) and
  11347. GetNextInstruction(p,hp1) and
  11348. (hp1.typ = ait_instruction);
  11349. if reg_and_hp1_is_instr and
  11350. (
  11351. (taicpu(hp1).opcode <> A_LEA) or
  11352. { If the LEA instruction can be converted into an arithmetic instruction,
  11353. it may be possible to then fold it. }
  11354. (
  11355. { If the flags register is in use, don't change the instruction
  11356. to an ADD otherwise this will scramble the flags. [Kit] }
  11357. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  11358. ConvertLEA(taicpu(hp1))
  11359. )
  11360. ) and
  11361. IsFoldableArithOp(taicpu(hp1),taicpu(p).oper[1]^.reg) and
  11362. GetNextInstruction(hp1,hp2) and
  11363. MatchInstruction(hp2,A_MOV,[]) and
  11364. (taicpu(hp2).oper[0]^.typ = top_reg) and
  11365. OpsEqual(taicpu(hp2).oper[1]^,taicpu(p).oper[0]^) and
  11366. ((taicpu(p).opsize in [S_BW,S_BL]) and (taicpu(hp2).opsize=S_B) or
  11367. (taicpu(p).opsize in [S_WL]) and (taicpu(hp2).opsize=S_W)) and
  11368. {$ifdef i386}
  11369. { not all registers have byte size sub registers on i386 }
  11370. ((taicpu(hp2).opsize<>S_B) or (getsupreg(taicpu(hp1).oper[0]^.reg) in [RS_EAX, RS_EBX, RS_ECX, RS_EDX])) and
  11371. {$endif i386}
  11372. (((taicpu(hp1).ops=2) and
  11373. (getsupreg(taicpu(hp2).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg))) or
  11374. ((taicpu(hp1).ops=1) and
  11375. (getsupreg(taicpu(hp2).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[0]^.reg)))) and
  11376. not(RegUsedAfterInstruction(taicpu(hp2).oper[0]^.reg,hp2,UsedRegs)) then
  11377. begin
  11378. { change movsX/movzX reg/ref, reg2
  11379. add/sub/or/... reg3/$const, reg2
  11380. mov reg2 reg/ref
  11381. to add/sub/or/... reg3/$const, reg/ref }
  11382. { by example:
  11383. movswl %si,%eax movswl %si,%eax p
  11384. decl %eax addl %edx,%eax hp1
  11385. movw %ax,%si movw %ax,%si hp2
  11386. ->
  11387. movswl %si,%eax movswl %si,%eax p
  11388. decw %eax addw %edx,%eax hp1
  11389. movw %ax,%si movw %ax,%si hp2
  11390. }
  11391. taicpu(hp1).changeopsize(taicpu(hp2).opsize);
  11392. {
  11393. ->
  11394. movswl %si,%eax movswl %si,%eax p
  11395. decw %si addw %dx,%si hp1
  11396. movw %ax,%si movw %ax,%si hp2
  11397. }
  11398. case taicpu(hp1).ops of
  11399. 1:
  11400. taicpu(hp1).loadoper(0,taicpu(hp2).oper[1]^);
  11401. 2:
  11402. begin
  11403. taicpu(hp1).loadoper(1,taicpu(hp2).oper[1]^);
  11404. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  11405. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  11406. end;
  11407. else
  11408. internalerror(2008042702);
  11409. end;
  11410. {
  11411. ->
  11412. decw %si addw %dx,%si p
  11413. }
  11414. DebugMsg(SPeepholeOptimization + 'var3',p);
  11415. RemoveCurrentP(p, hp1);
  11416. RemoveInstruction(hp2);
  11417. Result := True;
  11418. Exit;
  11419. end;
  11420. if reg_and_hp1_is_instr and
  11421. (taicpu(hp1).opcode = A_MOV) and
  11422. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  11423. (MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^)
  11424. {$ifdef x86_64}
  11425. { check for implicit extension to 64 bit }
  11426. or
  11427. ((taicpu(p).opsize in [S_BL,S_WL]) and
  11428. (taicpu(hp1).opsize=S_Q) and
  11429. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.reg)
  11430. )
  11431. {$endif x86_64}
  11432. )
  11433. then
  11434. begin
  11435. { change
  11436. movx %reg1,%reg2
  11437. mov %reg2,%reg3
  11438. dealloc %reg2
  11439. into
  11440. movx %reg,%reg3
  11441. }
  11442. TransferUsedRegs(TmpUsedRegs);
  11443. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  11444. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  11445. begin
  11446. DebugMsg(SPeepholeOptimization + 'MovxMov2Movx',p);
  11447. {$ifdef x86_64}
  11448. if (taicpu(p).opsize in [S_BL,S_WL]) and
  11449. (taicpu(hp1).opsize=S_Q) then
  11450. taicpu(p).loadreg(1,newreg(R_INTREGISTER,getsupreg(taicpu(hp1).oper[1]^.reg),R_SUBD))
  11451. else
  11452. {$endif x86_64}
  11453. taicpu(p).loadreg(1,taicpu(hp1).oper[1]^.reg);
  11454. RemoveInstruction(hp1);
  11455. Result := True;
  11456. Exit;
  11457. end;
  11458. end;
  11459. if reg_and_hp1_is_instr and
  11460. ((taicpu(hp1).opcode=A_MOV) or
  11461. (taicpu(hp1).opcode=A_ADD) or
  11462. (taicpu(hp1).opcode=A_SUB) or
  11463. (taicpu(hp1).opcode=A_CMP) or
  11464. (taicpu(hp1).opcode=A_OR) or
  11465. (taicpu(hp1).opcode=A_XOR) or
  11466. (taicpu(hp1).opcode=A_AND)
  11467. ) and
  11468. (taicpu(hp1).oper[1]^.typ = top_reg) then
  11469. begin
  11470. AndTest := (taicpu(hp1).opcode=A_AND) and
  11471. GetNextInstruction(hp1, hp2) and
  11472. (hp2.typ = ait_instruction) and
  11473. (
  11474. (
  11475. (taicpu(hp2).opcode=A_TEST) and
  11476. (
  11477. MatchOperand(taicpu(hp2).oper[0]^, taicpu(hp1).oper[1]^.reg) or
  11478. MatchOperand(taicpu(hp2).oper[0]^, -1) or
  11479. (
  11480. { If the AND and TEST instructions share a constant, this is also valid }
  11481. (taicpu(hp1).oper[0]^.typ = top_const) and
  11482. MatchOperand(taicpu(hp2).oper[0]^, taicpu(hp1).oper[0]^.val)
  11483. )
  11484. ) and
  11485. MatchOperand(taicpu(hp2).oper[1]^, taicpu(hp1).oper[1]^.reg)
  11486. ) or
  11487. (
  11488. (taicpu(hp2).opcode=A_CMP) and
  11489. MatchOperand(taicpu(hp2).oper[0]^, 0) and
  11490. MatchOperand(taicpu(hp2).oper[1]^, taicpu(hp1).oper[1]^.reg)
  11491. )
  11492. );
  11493. { change
  11494. movx (oper),%reg2
  11495. and $x,%reg2
  11496. test %reg2,%reg2
  11497. dealloc %reg2
  11498. into
  11499. op %reg1,%reg3
  11500. if the second op accesses only the bits stored in reg1
  11501. }
  11502. if ((taicpu(p).oper[0]^.typ=top_reg) or
  11503. ((taicpu(p).oper[0]^.typ=top_ref) and (taicpu(p).oper[0]^.ref^.refaddr<>addr_full))) and
  11504. (taicpu(hp1).oper[0]^.typ = top_const) and
  11505. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  11506. AndTest then
  11507. begin
  11508. { Check if the AND constant is in range }
  11509. case taicpu(p).opsize of
  11510. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  11511. begin
  11512. NewSize := S_B;
  11513. Limit := $FF;
  11514. end;
  11515. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  11516. begin
  11517. NewSize := S_W;
  11518. Limit := $FFFF;
  11519. end;
  11520. {$ifdef x86_64}
  11521. S_LQ:
  11522. begin
  11523. NewSize := S_L;
  11524. Limit := $FFFFFFFF;
  11525. end;
  11526. {$endif x86_64}
  11527. else
  11528. InternalError(2021120303);
  11529. end;
  11530. if (
  11531. ((taicpu(hp1).oper[0]^.val and Limit) = taicpu(hp1).oper[0]^.val) or
  11532. { Check for negative operands }
  11533. (((not taicpu(hp1).oper[0]^.val) and Limit) = (not taicpu(hp1).oper[0]^.val))
  11534. ) and
  11535. GetNextInstruction(hp2,hp3) and
  11536. MatchInstruction(hp3,A_Jcc,A_Setcc,A_CMOVcc,[]) and
  11537. (taicpu(hp3).condition in [C_E,C_NE]) then
  11538. begin
  11539. TransferUsedRegs(TmpUsedRegs);
  11540. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  11541. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  11542. if not(RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp2, TmpUsedRegs)) then
  11543. begin
  11544. DebugMsg(SPeepholeOptimization + 'MovxAndTest2Test done',p);
  11545. taicpu(hp1).loadoper(1, taicpu(p).oper[0]^);
  11546. taicpu(hp1).opcode := A_TEST;
  11547. taicpu(hp1).opsize := NewSize;
  11548. RemoveInstruction(hp2);
  11549. RemoveCurrentP(p, hp1);
  11550. Result:=true;
  11551. exit;
  11552. end;
  11553. end;
  11554. end;
  11555. if (taicpu(hp1).oper[0]^.typ = top_reg) and
  11556. (((taicpu(p).opsize in [S_BW,S_BL,S_WL{$ifdef x86_64},S_BQ,S_WQ,S_LQ{$endif x86_64}]) and
  11557. (taicpu(hp1).opsize=S_B)) or
  11558. ((taicpu(p).opsize in [S_WL{$ifdef x86_64},S_WQ,S_LQ{$endif x86_64}]) and
  11559. (taicpu(hp1).opsize=S_W))
  11560. {$ifdef x86_64}
  11561. or ((taicpu(p).opsize=S_LQ) and
  11562. (taicpu(hp1).opsize=S_L))
  11563. {$endif x86_64}
  11564. ) and
  11565. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.reg) then
  11566. begin
  11567. { change
  11568. movx %reg1,%reg2
  11569. op %reg2,%reg3
  11570. dealloc %reg2
  11571. into
  11572. op %reg1,%reg3
  11573. if the second op accesses only the bits stored in reg1
  11574. }
  11575. TransferUsedRegs(TmpUsedRegs);
  11576. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  11577. if AndTest then
  11578. begin
  11579. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  11580. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs);
  11581. end
  11582. else
  11583. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs);
  11584. if not RegUsed then
  11585. begin
  11586. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 1',p);
  11587. if taicpu(p).oper[0]^.typ=top_reg then
  11588. begin
  11589. case taicpu(hp1).opsize of
  11590. S_B:
  11591. taicpu(hp1).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[0]^.reg),R_SUBL));
  11592. S_W:
  11593. taicpu(hp1).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[0]^.reg),R_SUBW));
  11594. S_L:
  11595. taicpu(hp1).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[0]^.reg),R_SUBD));
  11596. else
  11597. Internalerror(2020102301);
  11598. end;
  11599. AllocRegBetween(taicpu(hp1).oper[0]^.reg,p,hp1,UsedRegs);
  11600. end
  11601. else
  11602. taicpu(hp1).loadref(0,taicpu(p).oper[0]^.ref^);
  11603. RemoveCurrentP(p);
  11604. if AndTest then
  11605. RemoveInstruction(hp2);
  11606. result:=true;
  11607. exit;
  11608. end;
  11609. end
  11610. else if (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg) and
  11611. (
  11612. { Bitwise operations only }
  11613. (taicpu(hp1).opcode=A_AND) or
  11614. (taicpu(hp1).opcode=A_TEST) or
  11615. (
  11616. (taicpu(hp1).oper[0]^.typ = top_const) and
  11617. (
  11618. (taicpu(hp1).opcode=A_OR) or
  11619. (taicpu(hp1).opcode=A_XOR)
  11620. )
  11621. )
  11622. ) and
  11623. (
  11624. (taicpu(hp1).oper[0]^.typ = top_const) or
  11625. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) or
  11626. not RegInOp(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^)
  11627. ) then
  11628. begin
  11629. { change
  11630. movx %reg2,%reg2
  11631. op const,%reg2
  11632. into
  11633. op const,%reg2 (smaller version)
  11634. movx %reg2,%reg2
  11635. also change
  11636. movx %reg1,%reg2
  11637. and/test (oper),%reg2
  11638. dealloc %reg2
  11639. into
  11640. and/test (oper),%reg1
  11641. }
  11642. case taicpu(p).opsize of
  11643. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  11644. begin
  11645. NewSize := S_B;
  11646. NewRegSize := R_SUBL;
  11647. Limit := $FF;
  11648. end;
  11649. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  11650. begin
  11651. NewSize := S_W;
  11652. NewRegSize := R_SUBW;
  11653. Limit := $FFFF;
  11654. end;
  11655. {$ifdef x86_64}
  11656. S_LQ:
  11657. begin
  11658. NewSize := S_L;
  11659. NewRegSize := R_SUBD;
  11660. Limit := $FFFFFFFF;
  11661. end;
  11662. {$endif x86_64}
  11663. else
  11664. Internalerror(2021120302);
  11665. end;
  11666. TransferUsedRegs(TmpUsedRegs);
  11667. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  11668. if AndTest then
  11669. begin
  11670. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  11671. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs);
  11672. end
  11673. else
  11674. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs);
  11675. if
  11676. (
  11677. (taicpu(p).opcode = A_MOVZX) and
  11678. (
  11679. (taicpu(hp1).opcode=A_AND) or
  11680. (taicpu(hp1).opcode=A_TEST)
  11681. ) and
  11682. not (
  11683. { If both are references, then the final instruction will have
  11684. both operands as references, which is not allowed }
  11685. (taicpu(p).oper[0]^.typ = top_ref) and
  11686. (taicpu(hp1).oper[0]^.typ = top_ref)
  11687. ) and
  11688. not RegUsed
  11689. ) or
  11690. (
  11691. (
  11692. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) or
  11693. not RegUsed
  11694. ) and
  11695. (taicpu(p).oper[0]^.typ = top_reg) and
  11696. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11697. (taicpu(hp1).oper[0]^.typ = top_const) and
  11698. ((taicpu(hp1).oper[0]^.val and Limit) = taicpu(hp1).oper[0]^.val)
  11699. ) then
  11700. begin
  11701. {$if defined(i386) or defined(i8086)}
  11702. { If the target size is 8-bit, make sure we can actually encode it }
  11703. 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
  11704. Exit;
  11705. {$endif i386 or i8086}
  11706. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 2',p);
  11707. taicpu(hp1).opsize := NewSize;
  11708. taicpu(hp1).loadoper(1, taicpu(p).oper[0]^);
  11709. if AndTest then
  11710. begin
  11711. RemoveInstruction(hp2);
  11712. if not RegUsed then
  11713. begin
  11714. taicpu(hp1).opcode := A_TEST;
  11715. if (taicpu(hp1).oper[0]^.typ = top_ref) then
  11716. begin
  11717. { Make sure the reference is the second operand }
  11718. SwapOper := taicpu(hp1).oper[0];
  11719. taicpu(hp1).oper[0] := taicpu(hp1).oper[1];
  11720. taicpu(hp1).oper[1] := SwapOper;
  11721. end;
  11722. end;
  11723. end;
  11724. case taicpu(hp1).oper[0]^.typ of
  11725. top_reg:
  11726. setsubreg(taicpu(hp1).oper[0]^.reg, NewRegSize);
  11727. top_const:
  11728. { For the AND/TEST case }
  11729. taicpu(hp1).oper[0]^.val := taicpu(hp1).oper[0]^.val and Limit;
  11730. else
  11731. ;
  11732. end;
  11733. if RegUsed then
  11734. begin
  11735. AsmL.Remove(p);
  11736. AsmL.InsertAfter(p, hp1);
  11737. p := hp1;
  11738. end
  11739. else
  11740. RemoveCurrentP(p, hp1);
  11741. result:=true;
  11742. exit;
  11743. end;
  11744. end;
  11745. end;
  11746. if reg_and_hp1_is_instr and
  11747. (taicpu(p).oper[0]^.typ = top_reg) and
  11748. (
  11749. (taicpu(hp1).opcode = A_SHL) or (taicpu(hp1).opcode = A_SAL)
  11750. ) and
  11751. (taicpu(hp1).oper[0]^.typ = top_const) and
  11752. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11753. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  11754. { Minimum shift value allowed is the bit difference between the sizes }
  11755. (taicpu(hp1).oper[0]^.val >=
  11756. { Multiply by 8 because tcgsize2size returns bytes, not bits }
  11757. 8 * (
  11758. tcgsize2size[reg_cgsize(taicpu(p).oper[1]^.reg)] -
  11759. tcgsize2size[reg_cgsize(taicpu(p).oper[0]^.reg)]
  11760. )
  11761. ) then
  11762. begin
  11763. { For:
  11764. movsx/movzx %reg1,%reg1 (same register, just different sizes)
  11765. shl/sal ##, %reg1
  11766. Remove the movsx/movzx instruction if the shift overwrites the
  11767. extended bits of the register (e.g. movslq %eax,%rax; shlq $32,%rax
  11768. }
  11769. DebugMsg(SPeepholeOptimization + 'MovxShl2Shl',p);
  11770. RemoveCurrentP(p, hp1);
  11771. Result := True;
  11772. Exit;
  11773. end
  11774. else if reg_and_hp1_is_instr and
  11775. (taicpu(p).oper[0]^.typ = top_reg) and
  11776. (
  11777. ((taicpu(hp1).opcode = A_SHR) and (taicpu(p).opcode = A_MOVZX)) or
  11778. ((taicpu(hp1).opcode = A_SAR) and (taicpu(p).opcode <> A_MOVZX))
  11779. ) and
  11780. (taicpu(hp1).oper[0]^.typ = top_const) and
  11781. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11782. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  11783. { Minimum shift value allowed is the bit size of the smallest register - 1 }
  11784. (taicpu(hp1).oper[0]^.val <
  11785. { Multiply by 8 because tcgsize2size returns bytes, not bits }
  11786. 8 * (
  11787. tcgsize2size[reg_cgsize(taicpu(p).oper[0]^.reg)]
  11788. )
  11789. ) then
  11790. begin
  11791. { For:
  11792. movsx %reg1,%reg1 movzx %reg1,%reg1 (same register, just different sizes)
  11793. sar ##, %reg1 shr ##, %reg1
  11794. Move the shift to before the movx instruction if the shift value
  11795. is not too large.
  11796. }
  11797. asml.Remove(hp1);
  11798. asml.InsertBefore(hp1, p);
  11799. taicpu(hp1).oper[1]^.reg := taicpu(p).oper[0]^.reg;
  11800. case taicpu(p).opsize of
  11801. s_BW, S_BL{$ifdef x86_64}, S_BQ{$endif}:
  11802. taicpu(hp1).opsize := S_B;
  11803. S_WL{$ifdef x86_64}, S_WQ{$endif}:
  11804. taicpu(hp1).opsize := S_W;
  11805. {$ifdef x86_64}
  11806. S_LQ:
  11807. taicpu(hp1).opsize := S_L;
  11808. {$endif}
  11809. else
  11810. InternalError(2020112401);
  11811. end;
  11812. if (taicpu(hp1).opcode = A_SHR) then
  11813. DebugMsg(SPeepholeOptimization + 'MovzShr2ShrMovz', hp1)
  11814. else
  11815. DebugMsg(SPeepholeOptimization + 'MovsSar2SarMovs', hp1);
  11816. Result := True;
  11817. end;
  11818. if reg_and_hp1_is_instr and
  11819. (taicpu(p).oper[0]^.typ = top_reg) and
  11820. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11821. (
  11822. (taicpu(hp1).opcode = taicpu(p).opcode)
  11823. or ((taicpu(p).opcode = A_MOVZX) and ((taicpu(hp1).opcode = A_MOVSX){$ifdef x86_64} or (taicpu(hp1).opcode = A_MOVSXD){$endif x86_64}))
  11824. {$ifdef x86_64}
  11825. or ((taicpu(p).opcode = A_MOVSX) and (taicpu(hp1).opcode = A_MOVSXD))
  11826. {$endif x86_64}
  11827. ) then
  11828. begin
  11829. if MatchOpType(taicpu(hp1), top_reg, top_reg) and
  11830. (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[0]^.reg) and
  11831. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then
  11832. begin
  11833. {
  11834. For example:
  11835. movzbw %al,%ax
  11836. movzwl %ax,%eax
  11837. Compress into:
  11838. movzbl %al,%eax
  11839. }
  11840. RegUsed := False;
  11841. case taicpu(p).opsize of
  11842. S_BW:
  11843. case taicpu(hp1).opsize of
  11844. S_WL:
  11845. begin
  11846. taicpu(p).opsize := S_BL;
  11847. RegUsed := True;
  11848. end;
  11849. {$ifdef x86_64}
  11850. S_WQ:
  11851. begin
  11852. if taicpu(p).opcode = A_MOVZX then
  11853. begin
  11854. taicpu(p).opsize := S_BL;
  11855. { 64-bit zero extension is implicit, so change to the 32-bit register }
  11856. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  11857. end
  11858. else
  11859. taicpu(p).opsize := S_BQ;
  11860. RegUsed := True;
  11861. end;
  11862. {$endif x86_64}
  11863. else
  11864. ;
  11865. end;
  11866. {$ifdef x86_64}
  11867. S_BL:
  11868. case taicpu(hp1).opsize of
  11869. S_LQ:
  11870. begin
  11871. if taicpu(p).opcode = A_MOVZX then
  11872. begin
  11873. taicpu(p).opsize := S_BL;
  11874. { 64-bit zero extension is implicit, so change to the 32-bit register }
  11875. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  11876. end
  11877. else
  11878. taicpu(p).opsize := S_BQ;
  11879. RegUsed := True;
  11880. end;
  11881. else
  11882. ;
  11883. end;
  11884. S_WL:
  11885. case taicpu(hp1).opsize of
  11886. S_LQ:
  11887. begin
  11888. if taicpu(p).opcode = A_MOVZX then
  11889. begin
  11890. taicpu(p).opsize := S_WL;
  11891. { 64-bit zero extension is implicit, so change to the 32-bit register }
  11892. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  11893. end
  11894. else
  11895. taicpu(p).opsize := S_WQ;
  11896. RegUsed := True;
  11897. end;
  11898. else
  11899. ;
  11900. end;
  11901. {$endif x86_64}
  11902. else
  11903. ;
  11904. end;
  11905. if RegUsed then
  11906. begin
  11907. DebugMsg(SPeepholeOptimization + 'MovxMovx2Movx', p);
  11908. taicpu(p).oper[1]^.reg := taicpu(hp1).oper[1]^.reg;
  11909. RemoveInstruction(hp1);
  11910. Result := True;
  11911. Exit;
  11912. end;
  11913. end;
  11914. if (taicpu(hp1).opsize = taicpu(p).opsize) and
  11915. not RegInInstruction(taicpu(p).oper[1]^.reg, hp1) and
  11916. GetNextInstruction(hp1, hp2) and
  11917. MatchInstruction(hp2, [A_AND, A_OR, A_XOR, A_TEST], []) and
  11918. (
  11919. ((taicpu(hp2).opsize = S_W) and (taicpu(p).opsize = S_BW)) or
  11920. ((taicpu(hp2).opsize = S_L) and (taicpu(p).opsize in [S_BL, S_WL]))
  11921. {$ifdef x86_64}
  11922. or ((taicpu(hp2).opsize = S_Q) and (taicpu(p).opsize in [S_BL, S_BQ, S_WL, S_WQ, S_LQ]))
  11923. {$endif x86_64}
  11924. ) and
  11925. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  11926. (
  11927. (
  11928. (taicpu(hp2).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) and
  11929. (taicpu(hp2).oper[1]^.reg = taicpu(p).oper[1]^.reg)
  11930. ) or
  11931. (
  11932. { Only allow the operands in reverse order for TEST instructions }
  11933. (taicpu(hp2).opcode = A_TEST) and
  11934. (taicpu(hp2).oper[0]^.reg = taicpu(p).oper[1]^.reg) and
  11935. (taicpu(hp2).oper[1]^.reg = taicpu(hp1).oper[1]^.reg)
  11936. )
  11937. ) then
  11938. begin
  11939. {
  11940. For example:
  11941. movzbl %al,%eax
  11942. movzbl (ref),%edx
  11943. andl %edx,%eax
  11944. (%edx deallocated)
  11945. Change to:
  11946. andb (ref),%al
  11947. movzbl %al,%eax
  11948. Rules are:
  11949. - First two instructions have the same opcode and opsize
  11950. - First instruction's operands are the same super-register
  11951. - Second instruction operates on a different register
  11952. - Third instruction is AND, OR, XOR or TEST
  11953. - Third instruction's operands are the destination registers of the first two instructions
  11954. - Third instruction writes to the destination register of the first instruction (except with TEST)
  11955. - Second instruction's destination register is deallocated afterwards
  11956. }
  11957. TransferUsedRegs(TmpUsedRegs);
  11958. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  11959. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  11960. if not RegUsedAfterInstruction(taicpu(hp1).oper[1]^.reg, hp2, TmpUsedRegs) then
  11961. begin
  11962. case taicpu(p).opsize of
  11963. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  11964. NewSize := S_B;
  11965. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  11966. NewSize := S_W;
  11967. {$ifdef x86_64}
  11968. S_LQ:
  11969. NewSize := S_L;
  11970. {$endif x86_64}
  11971. else
  11972. InternalError(2021120301);
  11973. end;
  11974. taicpu(hp2).loadoper(0, taicpu(hp1).oper[0]^);
  11975. taicpu(hp2).loadreg(1, taicpu(p).oper[0]^.reg);
  11976. taicpu(hp2).opsize := NewSize;
  11977. RemoveInstruction(hp1);
  11978. { With TEST, it's best to keep the MOVX instruction at the top }
  11979. if (taicpu(hp2).opcode <> A_TEST) then
  11980. begin
  11981. DebugMsg(SPeepholeOptimization + 'MovxMovxTest2MovxTest', p);
  11982. asml.Remove(p);
  11983. { If the third instruction uses the flags, the MOVX instruction won't modify then }
  11984. asml.InsertAfter(p, hp2);
  11985. p := hp2;
  11986. end
  11987. else
  11988. DebugMsg(SPeepholeOptimization + 'MovxMovxOp2OpMovx', p);
  11989. Result := True;
  11990. Exit;
  11991. end;
  11992. end;
  11993. end;
  11994. if taicpu(p).opcode=A_MOVZX then
  11995. begin
  11996. { removes superfluous And's after movzx's }
  11997. if reg_and_hp1_is_instr and
  11998. (taicpu(hp1).opcode = A_AND) and
  11999. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12000. ((taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg)
  12001. {$ifdef x86_64}
  12002. { check for implicit extension to 64 bit }
  12003. or
  12004. ((taicpu(p).opsize in [S_BL,S_WL]) and
  12005. (taicpu(hp1).opsize=S_Q) and
  12006. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[1]^.reg)
  12007. )
  12008. {$endif x86_64}
  12009. )
  12010. then
  12011. begin
  12012. case taicpu(p).opsize Of
  12013. S_BL, S_BW{$ifdef x86_64}, S_BQ{$endif x86_64}:
  12014. if (taicpu(hp1).oper[0]^.val = $ff) then
  12015. begin
  12016. DebugMsg(SPeepholeOptimization + 'MovzAnd2Movz1',p);
  12017. RemoveInstruction(hp1);
  12018. Result:=true;
  12019. exit;
  12020. end;
  12021. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  12022. if (taicpu(hp1).oper[0]^.val = $ffff) then
  12023. begin
  12024. DebugMsg(SPeepholeOptimization + 'MovzAnd2Movz2',p);
  12025. RemoveInstruction(hp1);
  12026. Result:=true;
  12027. exit;
  12028. end;
  12029. {$ifdef x86_64}
  12030. S_LQ:
  12031. if (taicpu(hp1).oper[0]^.val = $ffffffff) then
  12032. begin
  12033. DebugMsg(SPeepholeOptimization + 'MovzAnd2Movz3',p);
  12034. RemoveInstruction(hp1);
  12035. Result:=true;
  12036. exit;
  12037. end;
  12038. {$endif x86_64}
  12039. else
  12040. ;
  12041. end;
  12042. { we cannot get rid of the and, but can we get rid of the movz ?}
  12043. if SuperRegistersEqual(taicpu(p).oper[0]^.reg,taicpu(p).oper[1]^.reg) then
  12044. begin
  12045. case taicpu(p).opsize Of
  12046. S_BL, S_BW{$ifdef x86_64}, S_BQ{$endif x86_64}:
  12047. if (taicpu(hp1).oper[0]^.val and $ff)=taicpu(hp1).oper[0]^.val then
  12048. begin
  12049. DebugMsg(SPeepholeOptimization + 'MovzAnd2And1',p);
  12050. RemoveCurrentP(p,hp1);
  12051. Result:=true;
  12052. exit;
  12053. end;
  12054. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  12055. if (taicpu(hp1).oper[0]^.val and $ffff)=taicpu(hp1).oper[0]^.val then
  12056. begin
  12057. DebugMsg(SPeepholeOptimization + 'MovzAnd2And2',p);
  12058. RemoveCurrentP(p,hp1);
  12059. Result:=true;
  12060. exit;
  12061. end;
  12062. {$ifdef x86_64}
  12063. S_LQ:
  12064. if (taicpu(hp1).oper[0]^.val and $ffffffff)=taicpu(hp1).oper[0]^.val then
  12065. begin
  12066. DebugMsg(SPeepholeOptimization + 'MovzAnd2And3',p);
  12067. RemoveCurrentP(p,hp1);
  12068. Result:=true;
  12069. exit;
  12070. end;
  12071. {$endif x86_64}
  12072. else
  12073. ;
  12074. end;
  12075. end;
  12076. end;
  12077. { changes some movzx constructs to faster synonyms (all examples
  12078. are given with eax/ax, but are also valid for other registers)}
  12079. if MatchOpType(taicpu(p),top_reg,top_reg) then
  12080. begin
  12081. case taicpu(p).opsize of
  12082. { Technically, movzbw %al,%ax cannot be encoded in 32/64-bit mode
  12083. (the machine code is equivalent to movzbl %al,%eax), but the
  12084. code generator still generates that assembler instruction and
  12085. it is silently converted. This should probably be checked.
  12086. [Kit] }
  12087. S_BW:
  12088. begin
  12089. if (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) and
  12090. (
  12091. not IsMOVZXAcceptable
  12092. { and $0xff,%ax has a smaller encoding but risks a partial write penalty }
  12093. or (
  12094. (cs_opt_size in current_settings.optimizerswitches) and
  12095. (taicpu(p).oper[1]^.reg = NR_AX)
  12096. )
  12097. ) then
  12098. {Change "movzbw %al, %ax" to "andw $0x0ffh, %ax"}
  12099. begin
  12100. DebugMsg(SPeepholeOptimization + 'var7',p);
  12101. taicpu(p).opcode := A_AND;
  12102. taicpu(p).changeopsize(S_W);
  12103. taicpu(p).loadConst(0,$ff);
  12104. Result := True;
  12105. end
  12106. else if not IsMOVZXAcceptable and
  12107. GetNextInstruction(p, hp1) and
  12108. (tai(hp1).typ = ait_instruction) and
  12109. (taicpu(hp1).opcode = A_AND) and
  12110. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12111. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12112. { Change "movzbw %reg1, %reg2; andw $const, %reg2"
  12113. to "movw %reg1, reg2; andw $(const1 and $ff), %reg2"}
  12114. begin
  12115. DebugMsg(SPeepholeOptimization + 'var8',p);
  12116. taicpu(p).opcode := A_MOV;
  12117. taicpu(p).changeopsize(S_W);
  12118. setsubreg(taicpu(p).oper[0]^.reg,R_SUBW);
  12119. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  12120. Result := True;
  12121. end;
  12122. end;
  12123. {$ifndef i8086} { movzbl %al,%eax cannot be encoded in 16-bit mode (the machine code is equivalent to movzbw %al,%ax }
  12124. S_BL:
  12125. if not IsMOVZXAcceptable then
  12126. begin
  12127. if (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) then
  12128. { Change "movzbl %al, %eax" to "andl $0x0ffh, %eax" }
  12129. begin
  12130. DebugMsg(SPeepholeOptimization + 'var9',p);
  12131. taicpu(p).opcode := A_AND;
  12132. taicpu(p).changeopsize(S_L);
  12133. taicpu(p).loadConst(0,$ff);
  12134. Result := True;
  12135. end
  12136. else if GetNextInstruction(p, hp1) and
  12137. (tai(hp1).typ = ait_instruction) and
  12138. (taicpu(hp1).opcode = A_AND) and
  12139. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12140. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12141. { Change "movzbl %reg1, %reg2; andl $const, %reg2"
  12142. to "movl %reg1, reg2; andl $(const1 and $ff), %reg2"}
  12143. begin
  12144. DebugMsg(SPeepholeOptimization + 'var10',p);
  12145. taicpu(p).opcode := A_MOV;
  12146. taicpu(p).changeopsize(S_L);
  12147. { do not use R_SUBWHOLE
  12148. as movl %rdx,%eax
  12149. is invalid in assembler PM }
  12150. setsubreg(taicpu(p).oper[0]^.reg, R_SUBD);
  12151. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  12152. Result := True;
  12153. end;
  12154. end;
  12155. {$endif i8086}
  12156. S_WL:
  12157. if not IsMOVZXAcceptable then
  12158. begin
  12159. if (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) then
  12160. { Change "movzwl %ax, %eax" to "andl $0x0ffffh, %eax" }
  12161. begin
  12162. DebugMsg(SPeepholeOptimization + 'var11',p);
  12163. taicpu(p).opcode := A_AND;
  12164. taicpu(p).changeopsize(S_L);
  12165. taicpu(p).loadConst(0,$ffff);
  12166. Result := True;
  12167. end
  12168. else if GetNextInstruction(p, hp1) and
  12169. (tai(hp1).typ = ait_instruction) and
  12170. (taicpu(hp1).opcode = A_AND) and
  12171. (taicpu(hp1).oper[0]^.typ = top_const) and
  12172. (taicpu(hp1).oper[1]^.typ = top_reg) and
  12173. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12174. { Change "movzwl %reg1, %reg2; andl $const, %reg2"
  12175. to "movl %reg1, reg2; andl $(const1 and $ffff), %reg2"}
  12176. begin
  12177. DebugMsg(SPeepholeOptimization + 'var12',p);
  12178. taicpu(p).opcode := A_MOV;
  12179. taicpu(p).changeopsize(S_L);
  12180. { do not use R_SUBWHOLE
  12181. as movl %rdx,%eax
  12182. is invalid in assembler PM }
  12183. setsubreg(taicpu(p).oper[0]^.reg, R_SUBD);
  12184. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ffff);
  12185. Result := True;
  12186. end;
  12187. end;
  12188. else
  12189. InternalError(2017050705);
  12190. end;
  12191. end
  12192. else if not IsMOVZXAcceptable and (taicpu(p).oper[0]^.typ = top_ref) then
  12193. begin
  12194. if GetNextInstruction(p, hp1) and
  12195. (tai(hp1).typ = ait_instruction) and
  12196. (taicpu(hp1).opcode = A_AND) and
  12197. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12198. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12199. begin
  12200. //taicpu(p).opcode := A_MOV;
  12201. case taicpu(p).opsize Of
  12202. S_BL:
  12203. begin
  12204. DebugMsg(SPeepholeOptimization + 'var13',p);
  12205. taicpu(hp1).changeopsize(S_L);
  12206. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  12207. end;
  12208. S_WL:
  12209. begin
  12210. DebugMsg(SPeepholeOptimization + 'var14',p);
  12211. taicpu(hp1).changeopsize(S_L);
  12212. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ffff);
  12213. end;
  12214. S_BW:
  12215. begin
  12216. DebugMsg(SPeepholeOptimization + 'var15',p);
  12217. taicpu(hp1).changeopsize(S_W);
  12218. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  12219. end;
  12220. else
  12221. Internalerror(2017050704)
  12222. end;
  12223. Result := True;
  12224. end;
  12225. end;
  12226. end;
  12227. end;
  12228. function TX86AsmOptimizer.OptPass1AND(var p : tai) : boolean;
  12229. var
  12230. hp1, hp2 : tai;
  12231. MaskLength : Cardinal;
  12232. MaskedBits : TCgInt;
  12233. ActiveReg : TRegister;
  12234. begin
  12235. Result:=false;
  12236. { There are no optimisations for reference targets }
  12237. if (taicpu(p).oper[1]^.typ <> top_reg) then
  12238. Exit;
  12239. while GetNextInstruction(p, hp1) and
  12240. (hp1.typ = ait_instruction) do
  12241. begin
  12242. if (taicpu(p).oper[0]^.typ = top_const) then
  12243. begin
  12244. case taicpu(hp1).opcode of
  12245. A_AND:
  12246. if MatchOpType(taicpu(hp1),top_const,top_reg) and
  12247. (getsupreg(taicpu(p).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) and
  12248. { the second register must contain the first one, so compare their subreg types }
  12249. (getsubreg(taicpu(p).oper[1]^.reg)<=getsubreg(taicpu(hp1).oper[1]^.reg)) and
  12250. (abs(taicpu(p).oper[0]^.val and taicpu(hp1).oper[0]^.val)<$80000000) then
  12251. { change
  12252. and const1, reg
  12253. and const2, reg
  12254. to
  12255. and (const1 and const2), reg
  12256. }
  12257. begin
  12258. taicpu(hp1).loadConst(0, taicpu(p).oper[0]^.val and taicpu(hp1).oper[0]^.val);
  12259. DebugMsg(SPeepholeOptimization + 'AndAnd2And done',hp1);
  12260. RemoveCurrentP(p, hp1);
  12261. Result:=true;
  12262. exit;
  12263. end;
  12264. A_CMP:
  12265. if (PopCnt(DWord(taicpu(p).oper[0]^.val)) = 1) and { Only 1 bit set }
  12266. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^.val) and
  12267. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  12268. { Just check that the condition on the next instruction is compatible }
  12269. GetNextInstruction(hp1, hp2) and
  12270. (hp2.typ = ait_instruction) and
  12271. (taicpu(hp2).condition in [C_Z, C_E, C_NZ, C_NE])
  12272. then
  12273. { change
  12274. and 2^n, reg
  12275. cmp 2^n, reg
  12276. j(c) / set(c) / cmov(c) (c is equal or not equal)
  12277. to
  12278. and 2^n, reg
  12279. test reg, reg
  12280. j(~c) / set(~c) / cmov(~c)
  12281. }
  12282. begin
  12283. { Keep TEST instruction in, rather than remove it, because
  12284. it may trigger other optimisations such as MovAndTest2Test }
  12285. taicpu(hp1).loadreg(0, taicpu(hp1).oper[1]^.reg);
  12286. taicpu(hp1).opcode := A_TEST;
  12287. DebugMsg(SPeepholeOptimization + 'AND/CMP/J(c) -> AND/J(~c) with power of 2 constant', p);
  12288. taicpu(hp2).condition := inverse_cond(taicpu(hp2).condition);
  12289. Result := True;
  12290. Exit;
  12291. end
  12292. else if ((taicpu(p).oper[0]^.val=$ff) or (taicpu(p).oper[0]^.val=$ffff) or (taicpu(p).oper[0]^.val=$ffffffff)) and
  12293. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12294. (taicpu(p).oper[0]^.val>=taicpu(hp1).oper[0]^.val) and
  12295. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[1]^.reg) then
  12296. { change
  12297. and $ff/$ff/$ffff, reg
  12298. cmp val<=$ff/val<=$ffff/val<=$ffffffff, reg
  12299. dealloc reg
  12300. to
  12301. cmp val<=$ff/val<=$ffff/val<=$ffffffff, resized reg
  12302. }
  12303. begin
  12304. TransferUsedRegs(TmpUsedRegs);
  12305. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  12306. if not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) then
  12307. begin
  12308. DebugMsg(SPeepholeOptimization + 'AND/CMP -> CMP', p);
  12309. case taicpu(p).oper[0]^.val of
  12310. $ff:
  12311. begin
  12312. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBL);
  12313. taicpu(hp1).opsize:=S_B;
  12314. end;
  12315. $ffff:
  12316. begin
  12317. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBW);
  12318. taicpu(hp1).opsize:=S_W;
  12319. end;
  12320. $ffffffff:
  12321. begin
  12322. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  12323. taicpu(hp1).opsize:=S_L;
  12324. end;
  12325. else
  12326. Internalerror(2023030401);
  12327. end;
  12328. RemoveCurrentP(p);
  12329. Result := True;
  12330. Exit;
  12331. end;
  12332. end;
  12333. A_MOVZX:
  12334. if MatchOpType(taicpu(hp1),top_reg,top_reg) and
  12335. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[1]^.reg) and
  12336. (getsupreg(taicpu(hp1).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg)) and
  12337. (
  12338. (
  12339. (taicpu(p).opsize=S_W) and
  12340. (taicpu(hp1).opsize=S_BW)
  12341. ) or
  12342. (
  12343. (taicpu(p).opsize=S_L) and
  12344. (taicpu(hp1).opsize in [S_WL,S_BL{$ifdef x86_64},S_BQ,S_WQ{$endif x86_64}])
  12345. )
  12346. {$ifdef x86_64}
  12347. or
  12348. (
  12349. (taicpu(p).opsize=S_Q) and
  12350. (taicpu(hp1).opsize in [S_BQ,S_WQ,S_BL,S_WL])
  12351. )
  12352. {$endif x86_64}
  12353. ) then
  12354. begin
  12355. if (((taicpu(hp1).opsize) in [S_BW,S_BL{$ifdef x86_64},S_BQ{$endif x86_64}]) and
  12356. ((taicpu(p).oper[0]^.val and $ff)=taicpu(p).oper[0]^.val)
  12357. ) or
  12358. (((taicpu(hp1).opsize) in [S_WL{$ifdef x86_64},S_WQ{$endif x86_64}]) and
  12359. ((taicpu(p).oper[0]^.val and $ffff)=taicpu(p).oper[0]^.val))
  12360. then
  12361. begin
  12362. { Unlike MOVSX, MOVZX doesn't actually have a version that zero-extends a
  12363. 32-bit register to a 64-bit register, or even a version called MOVZXD, so
  12364. code that tests for the presence of AND 0xffffffff followed by MOVZX is
  12365. wasted, and is indictive of a compiler bug if it were triggered. [Kit]
  12366. NOTE: To zero-extend from 32 bits to 64 bits, simply use the standard MOV.
  12367. }
  12368. DebugMsg(SPeepholeOptimization + 'AndMovzToAnd done',p);
  12369. RemoveInstruction(hp1);
  12370. { See if there are other optimisations possible }
  12371. Continue;
  12372. end;
  12373. end;
  12374. A_SHL:
  12375. if MatchOpType(taicpu(hp1),top_const,top_reg) and
  12376. (getsupreg(taicpu(p).oper[1]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg)) then
  12377. begin
  12378. {$ifopt R+}
  12379. {$define RANGE_WAS_ON}
  12380. {$R-}
  12381. {$endif}
  12382. { get length of potential and mask }
  12383. MaskLength:=SizeOf(taicpu(p).oper[0]^.val)*8-BsrQWord(taicpu(p).oper[0]^.val)-1;
  12384. { really a mask? }
  12385. {$ifdef RANGE_WAS_ON}
  12386. {$R+}
  12387. {$endif}
  12388. if (((QWord(1) shl MaskLength)-1)=taicpu(p).oper[0]^.val) and
  12389. { unmasked part shifted out? }
  12390. ((MaskLength+taicpu(hp1).oper[0]^.val)>=topsize2memsize[taicpu(hp1).opsize]) then
  12391. begin
  12392. DebugMsg(SPeepholeOptimization + 'AndShlToShl done',p);
  12393. RemoveCurrentP(p, hp1);
  12394. Result:=true;
  12395. exit;
  12396. end;
  12397. end;
  12398. A_SHR:
  12399. if MatchOpType(taicpu(hp1),top_const,top_reg) and
  12400. (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg) and
  12401. (taicpu(hp1).oper[0]^.val <= 63) then
  12402. begin
  12403. { Does SHR combined with the AND cover all the bits?
  12404. e.g. for "andb $252,%reg; shrb $2,%reg" - the "and" can be removed }
  12405. MaskedBits := taicpu(p).oper[0]^.val or ((TCgInt(1) shl taicpu(hp1).oper[0]^.val) - 1);
  12406. if ((taicpu(p).opsize = S_B) and ((MaskedBits and $FF) = $FF)) or
  12407. ((taicpu(p).opsize = S_W) and ((MaskedBits and $FFFF) = $FFFF)) or
  12408. ((taicpu(p).opsize = S_L) and ((MaskedBits and $FFFFFFFF) = $FFFFFFFF)) then
  12409. begin
  12410. DebugMsg(SPeepholeOptimization + 'AndShrToShr done', p);
  12411. RemoveCurrentP(p, hp1);
  12412. Result := True;
  12413. Exit;
  12414. end;
  12415. end;
  12416. A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  12417. if (taicpu(hp1).oper[0]^.typ = top_reg) and
  12418. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then
  12419. begin
  12420. if SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) and
  12421. (
  12422. (
  12423. (taicpu(hp1).opsize in [S_BW,S_BL{$ifdef x86_64},S_BQ{$endif x86_64}]) and
  12424. ((taicpu(p).oper[0]^.val and $7F) = taicpu(p).oper[0]^.val)
  12425. ) or (
  12426. (taicpu(hp1).opsize in [S_WL{$ifdef x86_64},S_WQ{$endif x86_64}]) and
  12427. ((taicpu(p).oper[0]^.val and $7FFF) = taicpu(p).oper[0]^.val)
  12428. {$ifdef x86_64}
  12429. ) or (
  12430. (taicpu(hp1).opsize = S_LQ) and
  12431. ((taicpu(p).oper[0]^.val and $7fffffff) = taicpu(p).oper[0]^.val)
  12432. {$endif x86_64}
  12433. )
  12434. ) then
  12435. begin
  12436. if (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg){$ifdef x86_64} or (taicpu(hp1).opsize = S_LQ){$endif x86_64} then
  12437. begin
  12438. DebugMsg(SPeepholeOptimization + 'AndMovsxToAnd',p);
  12439. RemoveInstruction(hp1);
  12440. { See if there are other optimisations possible }
  12441. Continue;
  12442. end;
  12443. { The super-registers are the same though.
  12444. Note that this change by itself doesn't improve
  12445. code speed, but it opens up other optimisations. }
  12446. {$ifdef x86_64}
  12447. { Convert 64-bit register to 32-bit }
  12448. case taicpu(hp1).opsize of
  12449. S_BQ:
  12450. begin
  12451. taicpu(hp1).opsize := S_BL;
  12452. taicpu(hp1).oper[1]^.reg := newreg(R_INTREGISTER, getsupreg(taicpu(hp1).oper[1]^.reg), R_SUBD);
  12453. end;
  12454. S_WQ:
  12455. begin
  12456. taicpu(hp1).opsize := S_WL;
  12457. taicpu(hp1).oper[1]^.reg := newreg(R_INTREGISTER, getsupreg(taicpu(hp1).oper[1]^.reg), R_SUBD);
  12458. end
  12459. else
  12460. ;
  12461. end;
  12462. {$endif x86_64}
  12463. DebugMsg(SPeepholeOptimization + 'AndMovsxToAndMovzx', hp1);
  12464. taicpu(hp1).opcode := A_MOVZX;
  12465. { See if there are other optimisations possible }
  12466. Continue;
  12467. end;
  12468. end;
  12469. else
  12470. ;
  12471. end;
  12472. end
  12473. else if MatchOperand(taicpu(p).oper[0]^, taicpu(p).oper[1]^.reg) and
  12474. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  12475. begin
  12476. {$ifdef x86_64}
  12477. if (taicpu(p).opsize = S_Q) then
  12478. begin
  12479. { Never necessary }
  12480. DebugMsg(SPeepholeOptimization + 'Andq2Nop', p);
  12481. RemoveCurrentP(p, hp1);
  12482. Result := True;
  12483. Exit;
  12484. end;
  12485. {$endif x86_64}
  12486. { Forward check to determine necessity of and %reg,%reg }
  12487. TransferUsedRegs(TmpUsedRegs);
  12488. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  12489. { Saves on a bunch of dereferences }
  12490. ActiveReg := taicpu(p).oper[1]^.reg;
  12491. case taicpu(hp1).opcode of
  12492. A_MOV, A_MOVZX, A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  12493. if (
  12494. (taicpu(hp1).oper[0]^.typ <> top_ref) or
  12495. not RegInRef(ActiveReg, taicpu(hp1).oper[0]^.ref^)
  12496. ) and
  12497. (
  12498. (taicpu(hp1).opcode <> A_MOV) or
  12499. (taicpu(hp1).oper[1]^.typ <> top_ref) or
  12500. not RegInRef(ActiveReg, taicpu(hp1).oper[1]^.ref^)
  12501. ) and
  12502. not (
  12503. { If mov %reg,%reg is present, remove that instruction instead in OptPass1MOV }
  12504. (taicpu(hp1).opcode = A_MOV) and
  12505. MatchOperand(taicpu(hp1).oper[0]^, ActiveReg) and
  12506. MatchOperand(taicpu(hp1).oper[1]^, ActiveReg)
  12507. ) and
  12508. (
  12509. (
  12510. (taicpu(hp1).oper[0]^.typ = top_reg) and
  12511. (taicpu(hp1).oper[0]^.reg = ActiveReg) and
  12512. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg)
  12513. ) or
  12514. (
  12515. {$ifdef x86_64}
  12516. (
  12517. { If we read from the register, make sure it's not dependent on the upper 32 bits }
  12518. (taicpu(hp1).oper[0]^.typ <> top_reg) or
  12519. not SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, ActiveReg) or
  12520. (GetSubReg(taicpu(hp1).oper[0]^.reg) <> R_SUBQ)
  12521. ) and
  12522. {$endif x86_64}
  12523. not RegUsedAfterInstruction(ActiveReg, hp1, TmpUsedRegs)
  12524. )
  12525. ) then
  12526. begin
  12527. DebugMsg(SPeepholeOptimization + 'AndMovx2Movx', p);
  12528. RemoveCurrentP(p, hp1);
  12529. Result := True;
  12530. Exit;
  12531. end;
  12532. A_ADD,
  12533. A_AND,
  12534. A_BSF,
  12535. A_BSR,
  12536. A_BTC,
  12537. A_BTR,
  12538. A_BTS,
  12539. A_OR,
  12540. A_SUB,
  12541. A_XOR:
  12542. { Register is written to, so this will clear the upper 32 bits (2-operand instructions) }
  12543. if (
  12544. (taicpu(hp1).oper[0]^.typ <> top_ref) or
  12545. not RegInRef(ActiveReg, taicpu(hp1).oper[0]^.ref^)
  12546. ) and
  12547. MatchOperand(taicpu(hp1).oper[1]^, ActiveReg) then
  12548. begin
  12549. DebugMsg(SPeepholeOptimization + 'AndOp2Op 2', p);
  12550. RemoveCurrentP(p, hp1);
  12551. Result := True;
  12552. Exit;
  12553. end;
  12554. A_CMP,
  12555. A_TEST:
  12556. if (
  12557. (taicpu(hp1).oper[0]^.typ <> top_ref) or
  12558. not RegInRef(ActiveReg, taicpu(hp1).oper[0]^.ref^)
  12559. ) and
  12560. MatchOperand(taicpu(hp1).oper[1]^, ActiveReg) and
  12561. not RegUsedAfterInstruction(ActiveReg, hp1, TmpUsedRegs) then
  12562. begin
  12563. DebugMsg(SPeepholeOptimization + 'AND; CMP/TEST -> CMP/TEST', p);
  12564. RemoveCurrentP(p, hp1);
  12565. Result := True;
  12566. Exit;
  12567. end;
  12568. A_BSWAP,
  12569. A_NEG,
  12570. A_NOT:
  12571. { Register is written to, so this will clear the upper 32 bits (1-operand instructions) }
  12572. if MatchOperand(taicpu(hp1).oper[0]^, ActiveReg) then
  12573. begin
  12574. DebugMsg(SPeepholeOptimization + 'AndOp2Op 1', p);
  12575. RemoveCurrentP(p, hp1);
  12576. Result := True;
  12577. Exit;
  12578. end;
  12579. else
  12580. ;
  12581. end;
  12582. end;
  12583. if (taicpu(hp1).is_jmp) and
  12584. (taicpu(hp1).opcode<>A_JMP) and
  12585. not(RegInUsedRegs(taicpu(p).oper[1]^.reg,UsedRegs)) then
  12586. begin
  12587. { change
  12588. and x, reg
  12589. jxx
  12590. to
  12591. test x, reg
  12592. jxx
  12593. if reg is deallocated before the
  12594. jump, but only if it's a conditional jump (PFV)
  12595. }
  12596. DebugMsg(SPeepholeOptimization + 'AndJcc2TestJcc', p);
  12597. taicpu(p).opcode := A_TEST;
  12598. Exit;
  12599. end;
  12600. Break;
  12601. end;
  12602. { Lone AND tests }
  12603. if (taicpu(p).oper[0]^.typ = top_const) then
  12604. begin
  12605. {
  12606. - Convert and $0xFF,reg to and reg,reg if reg is 8-bit
  12607. - Convert and $0xFFFF,reg to and reg,reg if reg is 16-bit
  12608. - Convert and $0xFFFFFFFF,reg to and reg,reg if reg is 32-bit
  12609. }
  12610. if ((taicpu(p).oper[0]^.val = $FF) and (taicpu(p).opsize = S_B)) or
  12611. ((taicpu(p).oper[0]^.val = $FFFF) and (taicpu(p).opsize = S_W)) or
  12612. ((taicpu(p).oper[0]^.val = $FFFFFFFF) and (taicpu(p).opsize = S_L)) then
  12613. begin
  12614. taicpu(p).loadreg(0, taicpu(p).oper[1]^.reg);
  12615. if taicpu(p).opsize = S_L then
  12616. begin
  12617. Include(OptsToCheck,aoc_MovAnd2Mov_3);
  12618. Result := True;
  12619. end;
  12620. end;
  12621. end;
  12622. { Backward check to determine necessity of and %reg,%reg }
  12623. if (taicpu(p).oper[0]^.typ = top_reg) and
  12624. (taicpu(p).oper[0]^.reg = taicpu(p).oper[1]^.reg) and
  12625. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  12626. GetLastInstruction(p, hp2) and
  12627. RegModifiedByInstruction(taicpu(p).oper[1]^.reg, hp2) and
  12628. { Check size of adjacent instruction to determine if the AND is
  12629. effectively a null operation }
  12630. (
  12631. (taicpu(p).opsize = taicpu(hp2).opsize) or
  12632. { Note: Don't include S_Q }
  12633. ((taicpu(p).opsize = S_L) and (taicpu(hp2).opsize in [S_BL, S_WL])) or
  12634. ((taicpu(p).opsize = S_W) and (taicpu(hp2).opsize in [S_BW, S_BL, S_WL, S_L])) or
  12635. ((taicpu(p).opsize = S_B) and (taicpu(hp2).opsize in [S_BW, S_BL, S_WL, S_W, S_L]))
  12636. ) then
  12637. begin
  12638. DebugMsg(SPeepholeOptimization + 'And2Nop', p);
  12639. { If GetNextInstruction returned False, hp1 will be nil }
  12640. RemoveCurrentP(p, hp1);
  12641. Result := True;
  12642. Exit;
  12643. end;
  12644. end;
  12645. function TX86AsmOptimizer.OptPass2ADD(var p : tai) : boolean;
  12646. var
  12647. hp1, hp2: tai;
  12648. NewRef: TReference;
  12649. Distance: Cardinal;
  12650. TempTracking: TAllUsedRegs;
  12651. { This entire nested function is used in an if-statement below, but we
  12652. want to avoid all the used reg transfers and GetNextInstruction calls
  12653. until we really have to check }
  12654. function MemRegisterNotUsedLater: Boolean; inline;
  12655. var
  12656. hp2: tai;
  12657. begin
  12658. TransferUsedRegs(TmpUsedRegs);
  12659. hp2 := p;
  12660. repeat
  12661. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  12662. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12663. Result := not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs);
  12664. end;
  12665. begin
  12666. Result := False;
  12667. if (taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif}]) and
  12668. (taicpu(p).oper[1]^.typ = top_reg) then
  12669. begin
  12670. Distance := GetNextInstructionUsingRegCount(p, hp1, taicpu(p).oper[1]^.reg);
  12671. if (Distance = 0) or (Distance > 3) { Likely too far to make a meaningful difference } or
  12672. (hp1.typ <> ait_instruction) or
  12673. not
  12674. (
  12675. (cs_opt_level3 in current_settings.optimizerswitches) or
  12676. { GetNextInstructionUsingRegCount just returns the next valid instruction under -O2 and under }
  12677. RegInInstruction(taicpu(p).oper[1]^.reg, hp1)
  12678. ) then
  12679. Exit;
  12680. { Some of the MOV optimisations are much more in-depth. For example, if we have:
  12681. addq $x, %rax
  12682. movq %rax, %rdx
  12683. sarq $63, %rdx
  12684. (%rax still in use)
  12685. ...letting OptPass2ADD run its course (and without -Os) will produce:
  12686. leaq $x(%rax),%rdx
  12687. addq $x, %rax
  12688. sarq $63, %rdx
  12689. ...which is okay since it breaks the dependency chain between
  12690. addq and movq, but if OptPass2MOV is called first:
  12691. addq $x, %rax
  12692. cqto
  12693. ...which is better in all ways, taking only 2 cycles to execute
  12694. and much smaller in code size.
  12695. }
  12696. { The extra register tracking is quite strenuous }
  12697. if (cs_opt_level2 in current_settings.optimizerswitches) and
  12698. MatchInstruction(hp1, A_MOV, []) then
  12699. begin
  12700. { Update the register tracking to the MOV instruction }
  12701. CopyUsedRegs(TempTracking);
  12702. hp2 := p;
  12703. repeat
  12704. UpdateUsedRegs(tai(hp2.Next));
  12705. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12706. { if hp1 <> hp2 after the call, then hp1 got removed, so let
  12707. OptPass2ADD get called again }
  12708. if OptPass2MOV(hp1) and (hp1 <> hp2) then
  12709. begin
  12710. { Reset the tracking to the current instruction }
  12711. RestoreUsedRegs(TempTracking);
  12712. ReleaseUsedRegs(TempTracking);
  12713. Result := True;
  12714. Exit;
  12715. end;
  12716. { Reset the tracking to the current instruction }
  12717. RestoreUsedRegs(TempTracking);
  12718. ReleaseUsedRegs(TempTracking);
  12719. { If OptPass2MOV returned True, we don't need to set Result to
  12720. True if hp1 didn't change because the ADD instruction didn't
  12721. get modified and we'll be evaluating hp1 again when the
  12722. peephole optimizer reaches it }
  12723. end;
  12724. { Change:
  12725. add %reg2,%reg1
  12726. (%reg2 not modified in between)
  12727. mov/s/z #(%reg1),%reg1 (%reg1 superregisters must be the same)
  12728. To:
  12729. mov/s/z #(%reg1,%reg2),%reg1
  12730. }
  12731. if (taicpu(p).oper[0]^.typ = top_reg) and
  12732. MatchInstruction(hp1, [A_MOV, A_MOVZX, A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif}], []) and
  12733. MatchOpType(taicpu(hp1), top_ref, top_reg) and
  12734. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 1) and
  12735. (
  12736. (
  12737. (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  12738. (taicpu(hp1).oper[0]^.ref^.index = NR_NO) and
  12739. { r/esp cannot be an index }
  12740. (taicpu(p).oper[0]^.reg<>NR_STACK_POINTER_REG)
  12741. ) or (
  12742. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  12743. (taicpu(hp1).oper[0]^.ref^.base = NR_NO)
  12744. )
  12745. ) and (
  12746. Reg1WriteOverwritesReg2Entirely(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) or
  12747. (
  12748. { If the super registers ARE equal, then this MOV/S/Z does a partial write }
  12749. not SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) and
  12750. MemRegisterNotUsedLater
  12751. )
  12752. ) then
  12753. begin
  12754. if (
  12755. { Instructions are guaranteed to be adjacent on -O2 and under }
  12756. (cs_opt_level3 in current_settings.optimizerswitches) and
  12757. RegModifiedBetween(taicpu(p).oper[0]^.reg, p, hp1)
  12758. ) then
  12759. begin
  12760. { If the other register is used in between, move the MOV
  12761. instruction to right after the ADD instruction so a
  12762. saving can still be made }
  12763. Asml.Remove(hp1);
  12764. Asml.InsertAfter(hp1, p);
  12765. taicpu(hp1).oper[0]^.ref^.base := taicpu(p).oper[1]^.reg;
  12766. taicpu(hp1).oper[0]^.ref^.index := taicpu(p).oper[0]^.reg;
  12767. DebugMsg(SPeepholeOptimization + 'AddMov2Mov done (instruction moved)', p);
  12768. RemoveCurrentp(p, hp1);
  12769. end
  12770. else
  12771. begin
  12772. AllocRegBetween(taicpu(p).oper[0]^.reg, p, hp1, UsedRegs);
  12773. taicpu(hp1).oper[0]^.ref^.base := taicpu(p).oper[1]^.reg;
  12774. taicpu(hp1).oper[0]^.ref^.index := taicpu(p).oper[0]^.reg;
  12775. DebugMsg(SPeepholeOptimization + 'AddMov2Mov done', p);
  12776. if (cs_opt_level3 in current_settings.optimizerswitches) then
  12777. { hp1 may not be the immediate next instruction under -O3 }
  12778. RemoveCurrentp(p)
  12779. else
  12780. RemoveCurrentp(p, hp1);
  12781. end;
  12782. Result := True;
  12783. Exit;
  12784. end;
  12785. { Change:
  12786. addl/q $x,%reg1
  12787. movl/q %reg1,%reg2
  12788. To:
  12789. leal/q $x(%reg1),%reg2
  12790. addl/q $x,%reg1 (can be removed if %reg1 or the flags are not used afterwards)
  12791. Breaks the dependency chain.
  12792. }
  12793. if (taicpu(p).oper[0]^.typ = top_const) and
  12794. MatchInstruction(hp1, A_MOV, [taicpu(p).opsize]) and
  12795. (taicpu(hp1).oper[1]^.typ = top_reg) and
  12796. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) and
  12797. (
  12798. { Instructions are guaranteed to be adjacent on -O2 and under }
  12799. not (cs_opt_level3 in current_settings.optimizerswitches) or
  12800. not RegUsedBetween(taicpu(hp1).oper[1]^.reg, p, hp1)
  12801. ) then
  12802. begin
  12803. TransferUsedRegs(TmpUsedRegs);
  12804. hp2 := p;
  12805. repeat
  12806. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  12807. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12808. if (
  12809. { Don't do AddMov2LeaAdd under -Os, but do allow AddMov2Lea }
  12810. not (cs_opt_size in current_settings.optimizerswitches) or
  12811. (
  12812. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) and
  12813. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)
  12814. )
  12815. ) then
  12816. begin
  12817. { Change the MOV instruction to a LEA instruction, and update the
  12818. first operand }
  12819. reference_reset(NewRef, 1, []);
  12820. NewRef.base := taicpu(p).oper[1]^.reg;
  12821. NewRef.scalefactor := 1;
  12822. NewRef.offset := asizeint(taicpu(p).oper[0]^.val);
  12823. taicpu(hp1).opcode := A_LEA;
  12824. taicpu(hp1).loadref(0, NewRef);
  12825. if RegUsedAfterInstruction(NewRef.base, hp1, TmpUsedRegs) or
  12826. RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs) then
  12827. begin
  12828. hp2 := tai(hp1.Next); { for the benefit of AllocRegBetween }
  12829. { Move what is now the LEA instruction to before the ADD instruction }
  12830. Asml.Remove(hp1);
  12831. Asml.InsertBefore(hp1, p);
  12832. AllocRegBetween(taicpu(hp1).oper[1]^.reg, hp1, hp2, UsedRegs);
  12833. DebugMsg(SPeepholeOptimization + 'AddMov2LeaAdd', p);
  12834. p := hp1;
  12835. end
  12836. else
  12837. begin
  12838. { Since %reg1 or the flags aren't used afterwards, we can delete p completely }
  12839. DebugMsg(SPeepholeOptimization + 'AddMov2Lea', hp1);
  12840. if (cs_opt_level3 in current_settings.optimizerswitches) then
  12841. { hp1 may not be the immediate next instruction under -O3 }
  12842. RemoveCurrentp(p)
  12843. else
  12844. RemoveCurrentp(p, hp1);
  12845. end;
  12846. Result := True;
  12847. end;
  12848. end;
  12849. end;
  12850. end;
  12851. function TX86AsmOptimizer.OptPass2Lea(var p : tai) : Boolean;
  12852. var
  12853. SubReg: TSubRegister;
  12854. begin
  12855. Result:=false;
  12856. SubReg := getsubreg(taicpu(p).oper[1]^.reg);
  12857. if not (RegInUsedRegs(NR_DEFAULTFLAGS,UsedRegs)) then
  12858. with taicpu(p).oper[0]^.ref^ do
  12859. if (offset = 0) and not Assigned(symbol) and not Assigned(relsymbol) and (index <> NR_NO) then
  12860. begin
  12861. if (scalefactor <= 1) and SuperRegistersEqual(base, taicpu(p).oper[1]^.reg) then
  12862. begin
  12863. taicpu(p).loadreg(0, newreg(R_INTREGISTER, getsupreg(index), SubReg));
  12864. taicpu(p).opcode := A_ADD;
  12865. DebugMsg(SPeepholeOptimization + 'Lea2AddBase done',p);
  12866. Result := True;
  12867. end
  12868. else if SuperRegistersEqual(index, taicpu(p).oper[1]^.reg) then
  12869. begin
  12870. if (base <> NR_NO) then
  12871. begin
  12872. if (scalefactor <= 1) then
  12873. begin
  12874. taicpu(p).loadreg(0, newreg(R_INTREGISTER, getsupreg(base), SubReg));
  12875. taicpu(p).opcode := A_ADD;
  12876. DebugMsg(SPeepholeOptimization + 'Lea2AddIndex done',p);
  12877. Result := True;
  12878. end;
  12879. end
  12880. else
  12881. { Convert lea (%reg,2^x),%reg to shl x,%reg }
  12882. if (scalefactor in [2, 4, 8]) then
  12883. begin
  12884. { BsrByte is, in essence, the base-2 logarithm of the scale factor }
  12885. taicpu(p).loadconst(0, BsrByte(scalefactor));
  12886. taicpu(p).opcode := A_SHL;
  12887. DebugMsg(SPeepholeOptimization + 'Lea2Shl done',p);
  12888. Result := True;
  12889. end;
  12890. end;
  12891. end;
  12892. end;
  12893. function TX86AsmOptimizer.OptPass2SUB(var p: tai): Boolean;
  12894. var
  12895. hp1, hp2: tai;
  12896. NewRef: TReference;
  12897. Distance: Cardinal;
  12898. TempTracking: TAllUsedRegs;
  12899. begin
  12900. Result := False;
  12901. if (taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif}]) and
  12902. MatchOpType(taicpu(p),top_const,top_reg) then
  12903. begin
  12904. Distance := GetNextInstructionUsingRegCount(p, hp1, taicpu(p).oper[1]^.reg);
  12905. if (Distance = 0) or (Distance > 3) { Likely too far to make a meaningful difference } or
  12906. (hp1.typ <> ait_instruction) or
  12907. not
  12908. (
  12909. (cs_opt_level3 in current_settings.optimizerswitches) or
  12910. { GetNextInstructionUsingRegCount just returns the next valid instruction under -O2 and under }
  12911. RegInInstruction(taicpu(p).oper[1]^.reg, hp1)
  12912. ) then
  12913. Exit;
  12914. { Some of the MOV optimisations are much more in-depth. For example, if we have:
  12915. subq $x, %rax
  12916. movq %rax, %rdx
  12917. sarq $63, %rdx
  12918. (%rax still in use)
  12919. ...letting OptPass2SUB run its course (and without -Os) will produce:
  12920. leaq $-x(%rax),%rdx
  12921. movq $x, %rax
  12922. sarq $63, %rdx
  12923. ...which is okay since it breaks the dependency chain between
  12924. subq and movq, but if OptPass2MOV is called first:
  12925. subq $x, %rax
  12926. cqto
  12927. ...which is better in all ways, taking only 2 cycles to execute
  12928. and much smaller in code size.
  12929. }
  12930. { The extra register tracking is quite strenuous }
  12931. if (cs_opt_level2 in current_settings.optimizerswitches) and
  12932. MatchInstruction(hp1, A_MOV, []) then
  12933. begin
  12934. { Update the register tracking to the MOV instruction }
  12935. CopyUsedRegs(TempTracking);
  12936. hp2 := p;
  12937. repeat
  12938. UpdateUsedRegs(tai(hp2.Next));
  12939. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12940. { if hp1 <> hp2 after the call, then hp1 got removed, so let
  12941. OptPass2SUB get called again }
  12942. if OptPass2MOV(hp1) and (hp1 <> hp2) then
  12943. begin
  12944. { Reset the tracking to the current instruction }
  12945. RestoreUsedRegs(TempTracking);
  12946. ReleaseUsedRegs(TempTracking);
  12947. Result := True;
  12948. Exit;
  12949. end;
  12950. { Reset the tracking to the current instruction }
  12951. RestoreUsedRegs(TempTracking);
  12952. ReleaseUsedRegs(TempTracking);
  12953. { If OptPass2MOV returned True, we don't need to set Result to
  12954. True if hp1 didn't change because the SUB instruction didn't
  12955. get modified and we'll be evaluating hp1 again when the
  12956. peephole optimizer reaches it }
  12957. end;
  12958. { Change:
  12959. subl/q $x,%reg1
  12960. movl/q %reg1,%reg2
  12961. To:
  12962. leal/q $-x(%reg1),%reg2
  12963. subl/q $x,%reg1 (can be removed if %reg1 or the flags are not used afterwards)
  12964. Breaks the dependency chain and potentially permits the removal of
  12965. a CMP instruction if one follows.
  12966. }
  12967. if MatchInstruction(hp1, A_MOV, [taicpu(p).opsize]) and
  12968. (taicpu(hp1).oper[1]^.typ = top_reg) and
  12969. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) and
  12970. (
  12971. { Instructions are guaranteed to be adjacent on -O2 and under }
  12972. not (cs_opt_level3 in current_settings.optimizerswitches) or
  12973. not RegUsedBetween(taicpu(hp1).oper[1]^.reg, p, hp1)
  12974. ) then
  12975. begin
  12976. TransferUsedRegs(TmpUsedRegs);
  12977. hp2 := p;
  12978. repeat
  12979. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  12980. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12981. if (
  12982. { Don't do SubMov2LeaSub under -Os, but do allow SubMov2Lea }
  12983. not (cs_opt_size in current_settings.optimizerswitches) or
  12984. (
  12985. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) and
  12986. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)
  12987. )
  12988. ) then
  12989. begin
  12990. { Change the MOV instruction to a LEA instruction, and update the
  12991. first operand }
  12992. reference_reset(NewRef, 1, []);
  12993. NewRef.base := taicpu(p).oper[1]^.reg;
  12994. NewRef.scalefactor := 1;
  12995. NewRef.offset := -taicpu(p).oper[0]^.val;
  12996. taicpu(hp1).opcode := A_LEA;
  12997. taicpu(hp1).loadref(0, NewRef);
  12998. TransferUsedRegs(TmpUsedRegs);
  12999. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  13000. if RegUsedAfterInstruction(NewRef.base, hp1, TmpUsedRegs) or
  13001. RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs) then
  13002. begin
  13003. hp2 := tai(hp1.Next); { for the benefit of AllocRegBetween }
  13004. { Move what is now the LEA instruction to before the SUB instruction }
  13005. Asml.Remove(hp1);
  13006. Asml.InsertBefore(hp1, p);
  13007. AllocRegBetween(taicpu(hp1).oper[1]^.reg, hp1, hp2, UsedRegs);
  13008. DebugMsg(SPeepholeOptimization + 'SubMov2LeaSub', p);
  13009. p := hp1;
  13010. end
  13011. else
  13012. begin
  13013. { Since %reg1 or the flags aren't used afterwards, we can delete p completely }
  13014. DebugMsg(SPeepholeOptimization + 'SubMov2Lea', hp1);
  13015. if (cs_opt_level3 in current_settings.optimizerswitches) then
  13016. { hp1 may not be the immediate next instruction under -O3 }
  13017. RemoveCurrentp(p)
  13018. else
  13019. RemoveCurrentp(p, hp1);
  13020. end;
  13021. Result := True;
  13022. end;
  13023. end;
  13024. end;
  13025. end;
  13026. function TX86AsmOptimizer.SkipSimpleInstructions(var hp1 : tai) : Boolean;
  13027. begin
  13028. { we can skip all instructions not messing with the stack pointer }
  13029. while assigned(hp1) and {MatchInstruction(hp1,[A_LEA,A_MOV,A_MOVQ,A_MOVSQ,A_MOVSX,A_MOVSXD,A_MOVZX,
  13030. A_AND,A_OR,A_XOR,A_ADD,A_SHR,A_SHL,A_IMUL,A_SETcc,A_SAR,A_SUB,A_TEST,A_CMOVcc,
  13031. A_MOVSS,A_MOVSD,A_MOVAPS,A_MOVUPD,A_MOVAPD,A_MOVUPS,
  13032. A_VMOVSS,A_VMOVSD,A_VMOVAPS,A_VMOVUPD,A_VMOVAPD,A_VMOVUPS],[]) and}
  13033. ({(taicpu(hp1).ops=0) or }
  13034. ({(MatchOpType(taicpu(hp1),top_reg,top_reg) or MatchOpType(taicpu(hp1),top_const,top_reg) or
  13035. (MatchOpType(taicpu(hp1),top_ref,top_reg))
  13036. ) and }
  13037. not(RegInInstruction(NR_STACK_POINTER_REG,hp1)) { and not(RegInInstruction(NR_FRAME_POINTER_REG,hp1))}
  13038. )
  13039. ) do
  13040. GetNextInstruction(hp1,hp1);
  13041. Result:=assigned(hp1);
  13042. end;
  13043. function TX86AsmOptimizer.PostPeepholeOptLea(var p : tai) : Boolean;
  13044. var
  13045. hp1, hp2, hp3, hp4, hp5: tai;
  13046. begin
  13047. Result:=false;
  13048. hp5:=nil;
  13049. { replace
  13050. leal(q) x(<stackpointer>),<stackpointer>
  13051. call procname
  13052. leal(q) -x(<stackpointer>),<stackpointer>
  13053. ret
  13054. by
  13055. jmp procname
  13056. but do it only on level 4 because it destroys stack back traces
  13057. }
  13058. if (cs_opt_level4 in current_settings.optimizerswitches) and
  13059. MatchOpType(taicpu(p),top_ref,top_reg) and
  13060. (taicpu(p).oper[0]^.ref^.base=NR_STACK_POINTER_REG) and
  13061. (taicpu(p).oper[0]^.ref^.index=NR_NO) and
  13062. { the -8 or -24 are not required, but bail out early if possible,
  13063. higher values are unlikely }
  13064. ((taicpu(p).oper[0]^.ref^.offset=-8) or
  13065. (taicpu(p).oper[0]^.ref^.offset=-24)) and
  13066. (taicpu(p).oper[0]^.ref^.symbol=nil) and
  13067. (taicpu(p).oper[0]^.ref^.relsymbol=nil) and
  13068. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG) and
  13069. GetNextInstruction(p, hp1) and
  13070. { Take a copy of hp1 }
  13071. SetAndTest(hp1, hp4) and
  13072. { trick to skip label }
  13073. ((hp1.typ=ait_instruction) or GetNextInstruction(hp1, hp1)) and
  13074. SkipSimpleInstructions(hp1) and
  13075. MatchInstruction(hp1,A_CALL,[S_NO]) and
  13076. GetNextInstruction(hp1, hp2) and
  13077. MatchInstruction(hp2,A_LEA,[taicpu(p).opsize]) and
  13078. MatchOpType(taicpu(hp2),top_ref,top_reg) and
  13079. (taicpu(hp2).oper[0]^.ref^.offset=-taicpu(p).oper[0]^.ref^.offset) and
  13080. (taicpu(hp2).oper[0]^.ref^.base=NR_STACK_POINTER_REG) and
  13081. (taicpu(hp2).oper[0]^.ref^.index=NR_NO) and
  13082. (taicpu(hp2).oper[0]^.ref^.symbol=nil) and
  13083. (taicpu(hp2).oper[0]^.ref^.relsymbol=nil) and
  13084. { Segment register will be NR_NO }
  13085. (taicpu(hp2).oper[1]^.reg=NR_STACK_POINTER_REG) and
  13086. GetNextInstruction(hp2, hp3) and
  13087. { trick to skip label }
  13088. ((hp3.typ=ait_instruction) or GetNextInstruction(hp3, hp3)) and
  13089. (MatchInstruction(hp3,A_RET,[S_NO]) or
  13090. (MatchInstruction(hp3,A_VZEROUPPER,[S_NO]) and
  13091. SetAndTest(hp3,hp5) and
  13092. GetNextInstruction(hp3,hp3) and
  13093. MatchInstruction(hp3,A_RET,[S_NO])
  13094. )
  13095. ) and
  13096. (taicpu(hp3).ops=0) then
  13097. begin
  13098. taicpu(hp1).opcode := A_JMP;
  13099. taicpu(hp1).is_jmp := true;
  13100. DebugMsg(SPeepholeOptimization + 'LeaCallLeaRet2Jmp done',p);
  13101. RemoveCurrentP(p, hp4);
  13102. RemoveInstruction(hp2);
  13103. RemoveInstruction(hp3);
  13104. if Assigned(hp5) then
  13105. begin
  13106. AsmL.Remove(hp5);
  13107. ASmL.InsertBefore(hp5,hp1)
  13108. end;
  13109. Result:=true;
  13110. end;
  13111. end;
  13112. function TX86AsmOptimizer.PostPeepholeOptPush(var p : tai) : Boolean;
  13113. {$ifdef x86_64}
  13114. var
  13115. hp1, hp2, hp3, hp4, hp5: tai;
  13116. {$endif x86_64}
  13117. begin
  13118. Result:=false;
  13119. {$ifdef x86_64}
  13120. hp5:=nil;
  13121. { replace
  13122. push %rax
  13123. call procname
  13124. pop %rcx
  13125. ret
  13126. by
  13127. jmp procname
  13128. but do it only on level 4 because it destroys stack back traces
  13129. It depends on the fact, that the sequence push rax/pop rcx is used for stack alignment as rcx is volatile
  13130. for all supported calling conventions
  13131. }
  13132. if (cs_opt_level4 in current_settings.optimizerswitches) and
  13133. MatchOpType(taicpu(p),top_reg) and
  13134. (taicpu(p).oper[0]^.reg=NR_RAX) and
  13135. GetNextInstruction(p, hp1) and
  13136. { Take a copy of hp1 }
  13137. SetAndTest(hp1, hp4) and
  13138. { trick to skip label }
  13139. ((hp1.typ=ait_instruction) or GetNextInstruction(hp1, hp1)) and
  13140. SkipSimpleInstructions(hp1) and
  13141. MatchInstruction(hp1,A_CALL,[S_NO]) and
  13142. GetNextInstruction(hp1, hp2) and
  13143. MatchInstruction(hp2,A_POP,[taicpu(p).opsize]) and
  13144. MatchOpType(taicpu(hp2),top_reg) and
  13145. (taicpu(hp2).oper[0]^.reg=NR_RCX) and
  13146. GetNextInstruction(hp2, hp3) and
  13147. { trick to skip label }
  13148. ((hp3.typ=ait_instruction) or GetNextInstruction(hp3, hp3)) and
  13149. (MatchInstruction(hp3,A_RET,[S_NO]) or
  13150. (MatchInstruction(hp3,A_VZEROUPPER,[S_NO]) and
  13151. SetAndTest(hp3,hp5) and
  13152. GetNextInstruction(hp3,hp3) and
  13153. MatchInstruction(hp3,A_RET,[S_NO])
  13154. )
  13155. ) and
  13156. (taicpu(hp3).ops=0) then
  13157. begin
  13158. taicpu(hp1).opcode := A_JMP;
  13159. taicpu(hp1).is_jmp := true;
  13160. DebugMsg(SPeepholeOptimization + 'PushCallPushRet2Jmp done',p);
  13161. RemoveCurrentP(p, hp4);
  13162. RemoveInstruction(hp2);
  13163. RemoveInstruction(hp3);
  13164. if Assigned(hp5) then
  13165. begin
  13166. AsmL.Remove(hp5);
  13167. ASmL.InsertBefore(hp5,hp1)
  13168. end;
  13169. Result:=true;
  13170. end;
  13171. {$endif x86_64}
  13172. end;
  13173. function TX86AsmOptimizer.PostPeepholeOptMov(var p : tai) : Boolean;
  13174. var
  13175. Value, RegName: string;
  13176. begin
  13177. Result:=false;
  13178. if (taicpu(p).oper[1]^.typ = top_reg) and (taicpu(p).oper[0]^.typ = top_const) then
  13179. begin
  13180. case taicpu(p).oper[0]^.val of
  13181. 0:
  13182. { Don't make this optimisation if the CPU flags are required, since XOR scrambles them }
  13183. if not (RegInUsedRegs(NR_DEFAULTFLAGS,UsedRegs)) then
  13184. begin
  13185. { change "mov $0,%reg" into "xor %reg,%reg" }
  13186. taicpu(p).opcode := A_XOR;
  13187. taicpu(p).loadReg(0,taicpu(p).oper[1]^.reg);
  13188. Result := True;
  13189. {$ifdef x86_64}
  13190. end
  13191. else if (taicpu(p).opsize = S_Q) then
  13192. begin
  13193. RegName := debug_regname(taicpu(p).oper[1]^.reg); { 64-bit register name }
  13194. { The actual optimization }
  13195. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  13196. taicpu(p).changeopsize(S_L);
  13197. DebugMsg(SPeepholeOptimization + 'movq $0,' + RegName + ' -> movl $0,' + debug_regname(taicpu(p).oper[1]^.reg) + ' (immediate can be represented with just 32 bits)', p);
  13198. Result := True;
  13199. end;
  13200. $1..$FFFFFFFF:
  13201. begin
  13202. { Code size reduction by J. Gareth "Kit" Moreton }
  13203. { change 64-bit register to 32-bit register to reduce code size (upper 32 bits will be set to zero) }
  13204. case taicpu(p).opsize of
  13205. S_Q:
  13206. begin
  13207. RegName := debug_regname(taicpu(p).oper[1]^.reg); { 64-bit register name }
  13208. Value := debug_tostr(taicpu(p).oper[0]^.val);
  13209. { The actual optimization }
  13210. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  13211. taicpu(p).changeopsize(S_L);
  13212. DebugMsg(SPeepholeOptimization + 'movq $' + Value + ',' + RegName + ' -> movl $' + Value + ',' + debug_regname(taicpu(p).oper[1]^.reg) + ' (immediate can be represented with just 32 bits)', p);
  13213. Result := True;
  13214. end;
  13215. else
  13216. { Do nothing };
  13217. end;
  13218. {$endif x86_64}
  13219. end;
  13220. -1:
  13221. { Don't make this optimisation if the CPU flags are required, since OR scrambles them }
  13222. if (cs_opt_size in current_settings.optimizerswitches) and
  13223. (taicpu(p).opsize <> S_B) and
  13224. not (RegInUsedRegs(NR_DEFAULTFLAGS,UsedRegs)) then
  13225. begin
  13226. { change "mov $-1,%reg" into "or $-1,%reg" }
  13227. { NOTES:
  13228. - No size saving is made when changing a Word-sized assignment unless the register is AX (smaller encoding)
  13229. - This operation creates a false dependency on the register, so only do it when optimising for size
  13230. - 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
  13231. }
  13232. taicpu(p).opcode := A_OR;
  13233. DebugMsg(SPeepholeOptimization + 'Mov-12Or-1',p);
  13234. Result := True;
  13235. end;
  13236. else
  13237. { Do nothing };
  13238. end;
  13239. end;
  13240. end;
  13241. { Returns true if the given logic instruction can be converted into a BTx instruction (BT not included) }
  13242. class function TX86AsmOptimizer.IsBTXAcceptable(p : tai) : boolean;
  13243. begin
  13244. Result := False;
  13245. if not (CPUX86_HAS_BTX in cpu_capabilities[current_settings.optimizecputype]) then
  13246. Exit;
  13247. { For sizes less than S_L, the byte size is equal or larger with BTx,
  13248. so don't bother optimising }
  13249. if not MatchInstruction(p, A_AND, A_OR, A_XOR, [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  13250. Exit;
  13251. if (taicpu(p).oper[0]^.typ <> top_const) or
  13252. { If the value can fit into an 8-bit signed integer, a smaller
  13253. instruction can be encoded with AND/OR/XOR, so don't optimise if it
  13254. falls within this range }
  13255. (
  13256. (taicpu(p).oper[0]^.val > -128) and
  13257. (taicpu(p).oper[0]^.val <= 127)
  13258. ) then
  13259. Exit;
  13260. { If we're optimising for size, this is acceptable }
  13261. if (cs_opt_size in current_settings.optimizerswitches) then
  13262. Exit(True);
  13263. if (taicpu(p).oper[1]^.typ = top_reg) and
  13264. (CPUX86_HINT_FAST_BTX_REG_IMM in cpu_optimization_hints[current_settings.optimizecputype]) then
  13265. Exit(True);
  13266. if (taicpu(p).oper[1]^.typ <> top_reg) and
  13267. (CPUX86_HINT_FAST_BTX_MEM_IMM in cpu_optimization_hints[current_settings.optimizecputype]) then
  13268. Exit(True);
  13269. end;
  13270. function TX86AsmOptimizer.PostPeepholeOptAnd(var p : tai) : boolean;
  13271. var
  13272. hp1: tai;
  13273. Value: TCGInt;
  13274. begin
  13275. Result := False;
  13276. if MatchOpType(taicpu(p), top_const, top_reg) then
  13277. begin
  13278. { Detect:
  13279. andw x, %ax (0 <= x < $8000)
  13280. ...
  13281. movzwl %ax,%eax
  13282. Change movzwl %ax,%eax to cwtl (shorter encoding for movswl %ax,%eax)
  13283. }
  13284. if (taicpu(p).oper[1]^.reg = NR_AX) and { This is also enough to determine that opsize = S_W }
  13285. ((taicpu(p).oper[0]^.val and $7FFF) = taicpu(p).oper[0]^.val) and
  13286. GetNextInstructionUsingReg(p, hp1, NR_EAX) and
  13287. MatchInstruction(hp1, A_MOVZX, [S_WL]) and
  13288. MatchOperand(taicpu(hp1).oper[0]^, NR_AX) and
  13289. MatchOperand(taicpu(hp1).oper[1]^, NR_EAX) then
  13290. begin
  13291. DebugMsg(SPeepholeOptimization + 'Converted movzwl %ax,%eax to cwtl (via AndMovz2AndCwtl)', hp1);
  13292. taicpu(hp1).opcode := A_CWDE;
  13293. taicpu(hp1).clearop(0);
  13294. taicpu(hp1).clearop(1);
  13295. taicpu(hp1).ops := 0;
  13296. { A change was made, but not with p, so don't set Result, but
  13297. notify the compiler that a change was made }
  13298. Include(OptsToCheck, aoc_ForceNewIteration);
  13299. Exit; { and -> btr won't happen because an opsize of S_W won't be optimised anyway }
  13300. end;
  13301. end;
  13302. { If "not x" is a power of 2 (popcnt = 1), change:
  13303. and $x, %reg/ref
  13304. To:
  13305. btr lb(x), %reg/ref
  13306. }
  13307. if IsBTXAcceptable(p) and
  13308. (
  13309. { Make sure a TEST doesn't follow that plays with the register }
  13310. not GetNextInstruction(p, hp1) or
  13311. not MatchInstruction(hp1, A_TEST, A_CMP, [taicpu(p).opsize]) or
  13312. not MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg)
  13313. ) then
  13314. begin
  13315. {$push}{$R-}{$Q-}
  13316. { Value is a sign-extended 32-bit integer - just correct it
  13317. if it's represented as an unsigned value. Also, IsBTXAcceptable
  13318. checks to see if this operand is an immediate. }
  13319. Value := not taicpu(p).oper[0]^.val;
  13320. {$pop}
  13321. {$ifdef x86_64}
  13322. if taicpu(p).opsize = S_L then
  13323. {$endif x86_64}
  13324. Value := Value and $FFFFFFFF;
  13325. if (PopCnt(QWord(Value)) = 1) then
  13326. begin
  13327. DebugMsg(SPeepholeOptimization + 'Changed AND (not $' + debug_hexstr(taicpu(p).oper[0]^.val) + ') to BTR $' + debug_tostr(BsrQWord(Value)) + ' to shrink instruction size (And2Btr)', p);
  13328. taicpu(p).opcode := A_BTR;
  13329. taicpu(p).oper[0]^.val := BsrQWord(Value); { Essentially the base 2 logarithm }
  13330. Result := True;
  13331. Exit;
  13332. end;
  13333. end;
  13334. end;
  13335. function TX86AsmOptimizer.PostPeepholeOptMOVSX(var p : tai) : boolean;
  13336. begin
  13337. Result := False;
  13338. if not MatchOpType(taicpu(p), top_reg, top_reg) then
  13339. Exit;
  13340. { Convert:
  13341. movswl %ax,%eax -> cwtl
  13342. movslq %eax,%rax -> cdqe
  13343. NOTE: Don't convert movswl %al,%ax to cbw, because cbw and cwde
  13344. refer to the same opcode and depends only on the assembler's
  13345. current operand-size attribute. [Kit]
  13346. }
  13347. with taicpu(p) do
  13348. case opsize of
  13349. S_WL:
  13350. if (oper[0]^.reg = NR_AX) and (oper[1]^.reg = NR_EAX) then
  13351. begin
  13352. DebugMsg(SPeepholeOptimization + 'Converted movswl %ax,%eax to cwtl', p);
  13353. opcode := A_CWDE;
  13354. clearop(0);
  13355. clearop(1);
  13356. ops := 0;
  13357. Result := True;
  13358. end;
  13359. {$ifdef x86_64}
  13360. S_LQ:
  13361. if (oper[0]^.reg = NR_EAX) and (oper[1]^.reg = NR_RAX) then
  13362. begin
  13363. DebugMsg(SPeepholeOptimization + 'Converted movslq %eax,%rax to cltq', p);
  13364. opcode := A_CDQE;
  13365. clearop(0);
  13366. clearop(1);
  13367. ops := 0;
  13368. Result := True;
  13369. end;
  13370. {$endif x86_64}
  13371. else
  13372. ;
  13373. end;
  13374. end;
  13375. function TX86AsmOptimizer.PostPeepholeOptShr(var p : tai) : boolean;
  13376. var
  13377. hp1, hp2: tai;
  13378. IdentityMask, Shift: TCGInt;
  13379. LimitSize: Topsize;
  13380. DoNotMerge: Boolean;
  13381. begin
  13382. Result := False;
  13383. { All these optimisations work on "shr const,%reg" }
  13384. if not MatchOpType(taicpu(p), top_const, top_reg) then
  13385. Exit;
  13386. DoNotMerge := False;
  13387. Shift := taicpu(p).oper[0]^.val;
  13388. LimitSize := taicpu(p).opsize;
  13389. hp1 := p;
  13390. repeat
  13391. if not GetNextInstructionUsingReg(hp1, hp1, taicpu(p).oper[1]^.reg) or (hp1.typ <> ait_instruction) then
  13392. Break;
  13393. { Detect:
  13394. shr x, %reg
  13395. and y, %reg
  13396. If and y, %reg doesn't actually change the value of %reg (e.g. with
  13397. "shrl $24,%reg; andl $255,%reg", remove the AND instruction.
  13398. }
  13399. case taicpu(hp1).opcode of
  13400. A_AND:
  13401. if (taicpu(hp1).opsize = taicpu(p).opsize) and
  13402. MatchOpType(taicpu(hp1), top_const, top_reg) and
  13403. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  13404. begin
  13405. { Make sure the FLAGS register isn't in use }
  13406. TransferUsedRegs(TmpUsedRegs);
  13407. hp2 := p;
  13408. repeat
  13409. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  13410. until not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  13411. if not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs) then
  13412. begin
  13413. { Generate the identity mask }
  13414. case taicpu(p).opsize of
  13415. S_B:
  13416. IdentityMask := $FF shr Shift;
  13417. S_W:
  13418. IdentityMask := $FFFF shr Shift;
  13419. S_L:
  13420. IdentityMask := $FFFFFFFF shr Shift;
  13421. {$ifdef x86_64}
  13422. S_Q:
  13423. { We need to force the operands to be unsigned 64-bit
  13424. integers otherwise the wrong value is generated }
  13425. IdentityMask := TCGInt(QWord($FFFFFFFFFFFFFFFF) shr QWord(Shift));
  13426. {$endif x86_64}
  13427. else
  13428. InternalError(2022081501);
  13429. end;
  13430. if (taicpu(hp1).oper[0]^.val and IdentityMask) = IdentityMask then
  13431. begin
  13432. DebugMsg(SPeepholeOptimization + 'Removed AND instruction since previous SHR makes this an identity operation (ShrAnd2Shr)', hp1);
  13433. { All the possible 1 bits are covered, so we can remove the AND }
  13434. hp2 := tai(hp1.Previous);
  13435. RemoveInstruction(hp1);
  13436. { p wasn't actually changed, so don't set Result to True,
  13437. but a change was nonetheless made elsewhere }
  13438. Include(OptsToCheck, aoc_ForceNewIteration);
  13439. { Do another pass in case other AND or MOVZX instructions
  13440. follow }
  13441. hp1 := hp2;
  13442. Continue;
  13443. end;
  13444. end;
  13445. end;
  13446. A_TEST, A_CMP, A_Jcc:
  13447. { Skip over conditional jumps and relevant comparisons }
  13448. Continue;
  13449. A_MOVZX:
  13450. if MatchOpType(taicpu(hp1), top_reg, top_reg) and
  13451. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(p).oper[1]^.reg) then
  13452. begin
  13453. { Since the original register is being read as is, subsequent
  13454. SHRs must not be merged at this point }
  13455. DoNotMerge := True;
  13456. if IsShrMovZFoldable(taicpu(p).opsize, taicpu(hp1).opsize, Shift) then
  13457. begin
  13458. if SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then
  13459. begin
  13460. DebugMsg(SPeepholeOptimization + 'Removed MOVZX instruction since previous SHR makes it unnecessary (ShrMovz2Shr)', hp1);
  13461. { All the possible 1 bits are covered, so we can remove the AND }
  13462. hp2 := tai(hp1.Previous);
  13463. RemoveInstruction(hp1);
  13464. hp1 := hp2;
  13465. end
  13466. else { Different register target }
  13467. begin
  13468. DebugMsg(SPeepholeOptimization + 'Converted MOVZX instruction to MOV since previous SHR makes zero-extension unnecessary (ShrMovz2ShrMov 2)', hp1);
  13469. taicpu(hp1).opcode := A_MOV;
  13470. setsubreg(taicpu(hp1).oper[0]^.reg, getsubreg(taicpu(hp1).oper[1]^.reg));
  13471. case taicpu(hp1).opsize of
  13472. S_BW:
  13473. taicpu(hp1).opsize := S_W;
  13474. S_BL, S_WL:
  13475. taicpu(hp1).opsize := S_L;
  13476. else
  13477. InternalError(2022081503);
  13478. end;
  13479. end;
  13480. end
  13481. else if (Shift > 0) and
  13482. (taicpu(p).opsize = S_W) and
  13483. (taicpu(hp1).opsize = S_WL) and
  13484. (taicpu(hp1).oper[0]^.reg = NR_AX) and
  13485. (taicpu(hp1).oper[1]^.reg = NR_EAX) then
  13486. begin
  13487. { Detect:
  13488. shr x, %ax (x > 0)
  13489. ...
  13490. movzwl %ax,%eax
  13491. Change movzwl %ax,%eax to cwtl (shorter encoding for movswl %ax,%eax)
  13492. }
  13493. DebugMsg(SPeepholeOptimization + 'Converted movzwl %ax,%eax to cwtl (via ShrMovz2ShrCwtl)', hp1);
  13494. taicpu(hp1).opcode := A_CWDE;
  13495. taicpu(hp1).clearop(0);
  13496. taicpu(hp1).clearop(1);
  13497. taicpu(hp1).ops := 0;
  13498. end;
  13499. { Move onto the next instruction }
  13500. Continue;
  13501. end;
  13502. A_SHL, A_SAL, A_SHR:
  13503. if (taicpu(hp1).opsize <= LimitSize) and
  13504. MatchOpType(taicpu(hp1), top_const, top_reg) and
  13505. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[1]^.reg) then
  13506. begin
  13507. { Make sure the sizes don't exceed the register size limit
  13508. (measured by the shift value falling below the limit) }
  13509. if taicpu(hp1).opsize < LimitSize then
  13510. LimitSize := taicpu(hp1).opsize;
  13511. if taicpu(hp1).opcode = A_SHR then
  13512. Inc(Shift, taicpu(hp1).oper[0]^.val)
  13513. else
  13514. begin
  13515. Dec(Shift, taicpu(hp1).oper[0]^.val);
  13516. DoNotMerge := True;
  13517. end;
  13518. if Shift < topsize2memsize[taicpu(p).opsize] - topsize2memsize[LimitSize] then
  13519. Break;
  13520. { Since we've established that the combined shift is within
  13521. limits, we can actually combine the adjacent SHR
  13522. instructions even if they're different sizes }
  13523. if not DoNotMerge and (taicpu(hp1).opcode = A_SHR) then
  13524. begin
  13525. hp2 := tai(hp1.Previous);
  13526. DebugMsg(SPeepholeOptimization + 'ShrShr2Shr 2', p);
  13527. Inc(taicpu(p).oper[0]^.val, taicpu(hp1).oper[0]^.val);
  13528. RemoveInstruction(hp1);
  13529. hp1 := hp2;
  13530. end;
  13531. { Move onto the next instruction }
  13532. Continue;
  13533. end;
  13534. else
  13535. ;
  13536. end;
  13537. Break;
  13538. until False;
  13539. { Detect the following (looking backwards):
  13540. shr %cl,%reg
  13541. shr x, %reg
  13542. Swap the two SHR instructions to minimise a pipeline stall.
  13543. }
  13544. if GetLastInstruction(p, hp1) and
  13545. MatchInstruction(hp1, A_SHR, [taicpu(p).opsize]) and
  13546. MatchOpType(taicpu(hp1), top_reg, top_reg) and
  13547. { First operand will be %cl }
  13548. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  13549. { Just to be sure }
  13550. (getsupreg(taicpu(hp1).oper[1]^.reg) <> RS_ECX) then
  13551. begin
  13552. DebugMsg(SPeepholeOptimization + 'Swapped variable and constant SHR instructions to minimise pipeline stall (ShrShr2ShrShr)', hp1);
  13553. { Moving the entries this way ensures the register tracking remains correct }
  13554. Asml.Remove(p);
  13555. Asml.InsertBefore(p, hp1);
  13556. p := hp1;
  13557. { Don't set Result to True because the current instruction is now
  13558. "shr %cl,%reg" and there's nothing more we can do with it }
  13559. end;
  13560. end;
  13561. function TX86AsmOptimizer.PostPeepholeOptADDSUB(var p : tai) : boolean;
  13562. var
  13563. hp1, hp2: tai;
  13564. Opposite, SecondOpposite: TAsmOp;
  13565. NewCond: TAsmCond;
  13566. begin
  13567. Result := False;
  13568. { Change:
  13569. add/sub 128,(dest)
  13570. To:
  13571. sub/add -128,(dest)
  13572. This generaally takes fewer bytes to encode because -128 can be stored
  13573. in a signed byte, whereas +128 cannot.
  13574. }
  13575. if (taicpu(p).opsize <> S_B) and MatchOperand(taicpu(p).oper[0]^, 128) then
  13576. begin
  13577. if taicpu(p).opcode = A_ADD then
  13578. Opposite := A_SUB
  13579. else
  13580. Opposite := A_ADD;
  13581. { Be careful if the flags are in use, because the CF flag inverts
  13582. when changing from ADD to SUB and vice versa }
  13583. if RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  13584. GetNextInstruction(p, hp1) then
  13585. begin
  13586. TransferUsedRegs(TmpUsedRegs);
  13587. TmpUsedRegs[R_SPECIALREGISTER].Update(tai(p.Next), True);
  13588. hp2 := hp1;
  13589. { Scan ahead to check if everything's safe }
  13590. while Assigned(hp1) and RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) do
  13591. begin
  13592. if (hp1.typ <> ait_instruction) then
  13593. { Probably unsafe since the flags are still in use }
  13594. Exit;
  13595. if MatchInstruction(hp1, A_CALL, A_JMP, A_RET, []) then
  13596. { Stop searching at an unconditional jump }
  13597. Break;
  13598. if not
  13599. (
  13600. MatchInstruction(hp1, A_ADC, A_SBB, []) and
  13601. (taicpu(hp1).oper[0]^.typ = top_const) { We need to be able to invert a constant }
  13602. ) and
  13603. (taicpu(hp1).condition = C_None) and RegInInstruction(NR_DEFAULTFLAGS, hp1) then
  13604. { Instruction depends on FLAGS (and is not ADC or SBB); break out }
  13605. Exit;
  13606. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  13607. TmpUsedRegs[R_SPECIALREGISTER].Update(tai(hp1.Next), True);
  13608. { Move to the next instruction }
  13609. GetNextInstruction(hp1, hp1);
  13610. end;
  13611. while Assigned(hp2) and (hp2 <> hp1) do
  13612. begin
  13613. NewCond := C_None;
  13614. case taicpu(hp2).condition of
  13615. C_A, C_NBE:
  13616. NewCond := C_BE;
  13617. C_B, C_C, C_NAE:
  13618. NewCond := C_AE;
  13619. C_AE, C_NB, C_NC:
  13620. NewCond := C_B;
  13621. C_BE, C_NA:
  13622. NewCond := C_A;
  13623. else
  13624. { No change needed };
  13625. end;
  13626. if NewCond <> C_None then
  13627. begin
  13628. DebugMsg(SPeepholeOptimization + 'Condition changed from ' + cond2str[taicpu(hp2).condition] + ' to ' + cond2str[NewCond] +
  13629. ' to accommodate ' + debug_op2str(taicpu(p).opcode) + ' -> ' + debug_op2str(opposite) + ' above', hp2);
  13630. taicpu(hp2).condition := NewCond;
  13631. end
  13632. else
  13633. if MatchInstruction(hp2, A_ADC, A_SBB, []) then
  13634. begin
  13635. { Because of the flipping of the carry bit, to ensure
  13636. the operation remains equivalent, ADC becomes SBB
  13637. and vice versa, and the constant is not-inverted.
  13638. If multiple ADCs or SBBs appear in a row, each one
  13639. changed causes the carry bit to invert, so they all
  13640. need to be flipped }
  13641. if taicpu(hp2).opcode = A_ADC then
  13642. SecondOpposite := A_SBB
  13643. else
  13644. SecondOpposite := A_ADC;
  13645. if taicpu(hp2).oper[0]^.typ <> top_const then
  13646. { Should have broken out of this optimisation already }
  13647. InternalError(2021112901);
  13648. 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]^) + ' -> ' +
  13649. 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);
  13650. { Bit-invert the constant (effectively equivalent to "-1 - val") }
  13651. taicpu(hp2).opcode := SecondOpposite;
  13652. taicpu(hp2).oper[0]^.val := not taicpu(hp2).oper[0]^.val;
  13653. end;
  13654. { Move to the next instruction }
  13655. GetNextInstruction(hp2, hp2);
  13656. end;
  13657. if (hp2 <> hp1) then
  13658. InternalError(2021111501);
  13659. end;
  13660. DebugMsg(SPeepholeOptimization + debug_op2str(taicpu(p).opcode) + debug_opsize2str(taicpu(p).opsize) + ' $128,' + debug_operstr(taicpu(p).oper[1]^) + ' changed to ' +
  13661. debug_op2str(opposite) + debug_opsize2str(taicpu(p).opsize) + ' $-128,' + debug_operstr(taicpu(p).oper[1]^) + ' to reduce instruction size', p);
  13662. taicpu(p).opcode := Opposite;
  13663. taicpu(p).oper[0]^.val := -128;
  13664. { No further optimisations can be made on this instruction, so move
  13665. onto the next one to save time }
  13666. p := tai(p.Next);
  13667. UpdateUsedRegs(p);
  13668. Result := True;
  13669. Exit;
  13670. end;
  13671. { Detect:
  13672. add/sub %reg2,(dest)
  13673. add/sub x, (dest)
  13674. (dest can be a register or a reference)
  13675. Swap the instructions to minimise a pipeline stall. This reverses the
  13676. "Add swap" and "Sub swap" optimisations done in pass 1 if no new
  13677. optimisations could be made.
  13678. }
  13679. if (taicpu(p).oper[0]^.typ = top_reg) and
  13680. not RegInOp(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^) and
  13681. (
  13682. (
  13683. (taicpu(p).oper[1]^.typ = top_reg) and
  13684. { We can try searching further ahead if we're writing to a register }
  13685. GetNextInstructionUsingReg(p, hp1, taicpu(p).oper[1]^.reg)
  13686. ) or
  13687. (
  13688. (taicpu(p).oper[1]^.typ = top_ref) and
  13689. GetNextInstruction(p, hp1)
  13690. )
  13691. ) and
  13692. MatchInstruction(hp1, A_ADD, A_SUB, [taicpu(p).opsize]) and
  13693. (taicpu(hp1).oper[0]^.typ = top_const) and
  13694. MatchOperand(taicpu(p).oper[1]^, taicpu(hp1).oper[1]^) then
  13695. begin
  13696. { Make doubly sure the flags aren't in use because the order of additions may affect them }
  13697. TransferUsedRegs(TmpUsedRegs);
  13698. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  13699. hp2 := p;
  13700. while not (cs_opt_level3 in current_settings.optimizerswitches) and
  13701. GetNextInstruction(hp2, hp2) and (hp2 <> hp1) do
  13702. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  13703. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  13704. begin
  13705. asml.remove(hp1);
  13706. asml.InsertBefore(hp1, p);
  13707. DebugMsg(SPeepholeOptimization + 'Add/Sub swap 2 done', hp1);
  13708. Result := True;
  13709. end;
  13710. end;
  13711. end;
  13712. function TX86AsmOptimizer.PostPeepholeOptCmp(var p : tai) : Boolean;
  13713. var
  13714. hp1: tai;
  13715. begin
  13716. Result:=false;
  13717. { Final check to see if CMP/MOV pairs can be changed to MOV/CMP }
  13718. while GetNextInstruction(p, hp1) and
  13719. TrySwapMovCmp(p, hp1) do
  13720. begin
  13721. if MatchInstruction(hp1, A_MOV, []) then
  13722. begin
  13723. if RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  13724. begin
  13725. { A little hacky, but since CMP doesn't read the flags, only
  13726. modify them, it's safe if they get scrambled by MOV -> XOR }
  13727. ExcludeRegFromUsedRegs(NR_DEFAULTFLAGS, UsedRegs);
  13728. Result := PostPeepholeOptMov(hp1);
  13729. {$ifdef x86_64}
  13730. if Result and MatchInstruction(hp1, A_XOR, [S_Q]) then
  13731. { Used to shrink instruction size }
  13732. PostPeepholeOptXor(hp1);
  13733. {$endif x86_64}
  13734. IncludeRegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs);
  13735. end
  13736. else
  13737. begin
  13738. Result := PostPeepholeOptMov(hp1);
  13739. {$ifdef x86_64}
  13740. if Result and MatchInstruction(hp1, A_XOR, [S_Q]) then
  13741. { Used to shrink instruction size }
  13742. PostPeepholeOptXor(hp1);
  13743. {$endif x86_64}
  13744. end;
  13745. end;
  13746. { Enabling this flag is actually a null operation, but it marks
  13747. the code as 'modified' during this pass }
  13748. Include(OptsToCheck, aoc_ForceNewIteration);
  13749. end;
  13750. { change "cmp $0, %reg" to "test %reg, %reg" }
  13751. if MatchOpType(taicpu(p),top_const,top_reg) and
  13752. (taicpu(p).oper[0]^.val = 0) then
  13753. begin
  13754. taicpu(p).opcode := A_TEST;
  13755. taicpu(p).loadreg(0,taicpu(p).oper[1]^.reg);
  13756. DebugMsg(SPeepholeOptimization + 'Cmp2Test', p);
  13757. Result:=true;
  13758. end;
  13759. end;
  13760. function TX86AsmOptimizer.PostPeepholeOptTestOr(var p : tai) : Boolean;
  13761. var
  13762. IsTestConstX, IsValid : Boolean;
  13763. hp1,hp2 : tai;
  13764. begin
  13765. Result:=false;
  13766. { Final check to see if TEST/MOV pairs can be changed to MOV/TEST }
  13767. if (taicpu(p).opcode = A_TEST) then
  13768. while GetNextInstruction(p, hp1) and
  13769. TrySwapMovCmp(p, hp1) do
  13770. begin
  13771. if MatchInstruction(hp1, A_MOV, []) then
  13772. begin
  13773. if RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  13774. begin
  13775. { A little hacky, but since TEST doesn't read the flags, only
  13776. modify them, it's safe if they get scrambled by MOV -> XOR }
  13777. ExcludeRegFromUsedRegs(NR_DEFAULTFLAGS, UsedRegs);
  13778. Result := PostPeepholeOptMov(hp1);
  13779. {$ifdef x86_64}
  13780. if Result and MatchInstruction(hp1, A_XOR, [S_Q]) then
  13781. { Used to shrink instruction size }
  13782. PostPeepholeOptXor(hp1);
  13783. {$endif x86_64}
  13784. IncludeRegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs);
  13785. end
  13786. else
  13787. begin
  13788. Result := PostPeepholeOptMov(hp1);
  13789. {$ifdef x86_64}
  13790. if Result and MatchInstruction(hp1, A_XOR, [S_Q]) then
  13791. { Used to shrink instruction size }
  13792. PostPeepholeOptXor(hp1);
  13793. {$endif x86_64}
  13794. end;
  13795. end;
  13796. { Enabling this flag is actually a null operation, but it marks
  13797. the code as 'modified' during this pass }
  13798. Include(OptsToCheck, aoc_ForceNewIteration);
  13799. end;
  13800. { If x is a power of 2 (popcnt = 1), change:
  13801. or $x, %reg/ref
  13802. To:
  13803. bts lb(x), %reg/ref
  13804. }
  13805. if (taicpu(p).opcode = A_OR) and
  13806. IsBTXAcceptable(p) and
  13807. { IsBTXAcceptable checks to see if oper[0] is an immediate }
  13808. (PopCnt(QWord(taicpu(p).oper[0]^.val)) = 1) and
  13809. (
  13810. { Don't optimise if a test instruction follows }
  13811. not GetNextInstruction(p, hp1) or
  13812. not MatchInstruction(hp1, A_TEST, [taicpu(p).opsize])
  13813. ) then
  13814. begin
  13815. 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);
  13816. taicpu(p).opcode := A_BTS;
  13817. taicpu(p).oper[0]^.val := BsrQWord(taicpu(p).oper[0]^.val); { Essentially the base 2 logarithm }
  13818. Result := True;
  13819. Exit;
  13820. end;
  13821. { If x is a power of 2 (popcnt = 1), change:
  13822. test $x, %reg/ref
  13823. je / sete / cmove (or jne / setne)
  13824. To:
  13825. bt lb(x), %reg/ref
  13826. jnc / setnc / cmovnc (or jc / setc / cmovnc)
  13827. }
  13828. if (taicpu(p).opcode = A_TEST) and
  13829. (CPUX86_HAS_BTX in cpu_capabilities[current_settings.optimizecputype]) and
  13830. (taicpu(p).oper[0]^.typ = top_const) and
  13831. (
  13832. (cs_opt_size in current_settings.optimizerswitches) or
  13833. (
  13834. (taicpu(p).oper[1]^.typ = top_reg) and
  13835. (CPUX86_HINT_FAST_BT_REG_IMM in cpu_optimization_hints[current_settings.optimizecputype])
  13836. ) or
  13837. (
  13838. (taicpu(p).oper[1]^.typ <> top_reg) and
  13839. (CPUX86_HINT_FAST_BT_MEM_IMM in cpu_optimization_hints[current_settings.optimizecputype])
  13840. )
  13841. ) and
  13842. (PopCnt(QWord(taicpu(p).oper[0]^.val)) = 1) and
  13843. { For sizes less than S_L, the byte size is equal or larger with BT,
  13844. so don't bother optimising }
  13845. (taicpu(p).opsize >= S_L) then
  13846. begin
  13847. IsValid := True;
  13848. { Check the next set of instructions, watching the FLAGS register
  13849. and the conditions used }
  13850. TransferUsedRegs(TmpUsedRegs);
  13851. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  13852. hp1 := p;
  13853. hp2 := nil;
  13854. while GetNextInstruction(hp1, hp1) do
  13855. begin
  13856. if not Assigned(hp2) then
  13857. { The first instruction after TEST }
  13858. hp2 := hp1;
  13859. if (hp1.typ <> ait_instruction) then
  13860. begin
  13861. { If the flags are no longer in use, everything is fine }
  13862. if RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  13863. IsValid := False;
  13864. Break;
  13865. end;
  13866. case taicpu(hp1).condition of
  13867. C_None:
  13868. begin
  13869. if RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  13870. { Something is not quite normal, so play safe and don't change }
  13871. IsValid := False;
  13872. Break;
  13873. end;
  13874. C_E, C_Z, C_NE, C_NZ:
  13875. { This is fine };
  13876. else
  13877. begin
  13878. { Unsupported condition }
  13879. IsValid := False;
  13880. Break;
  13881. end;
  13882. end;
  13883. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  13884. end;
  13885. if IsValid then
  13886. begin
  13887. while hp2 <> hp1 do
  13888. begin
  13889. case taicpu(hp2).condition of
  13890. C_Z, C_E:
  13891. taicpu(hp2).condition := C_NC;
  13892. C_NZ, C_NE:
  13893. taicpu(hp2).condition := C_C;
  13894. else
  13895. { Should not get this by this point }
  13896. InternalError(2022110701);
  13897. end;
  13898. GetNextInstruction(hp2, hp2);
  13899. end;
  13900. 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);
  13901. taicpu(p).opcode := A_BT;
  13902. taicpu(p).oper[0]^.val := BsrQWord(taicpu(p).oper[0]^.val); { Essentially the base 2 logarithm }
  13903. Result := True;
  13904. Exit;
  13905. end;
  13906. end;
  13907. { removes the line marked with (x) from the sequence
  13908. and/or/xor/add/sub/... $x, %y
  13909. test/or %y, %y | test $-1, %y (x)
  13910. j(n)z _Label
  13911. as the first instruction already adjusts the ZF
  13912. %y operand may also be a reference }
  13913. IsTestConstX:=(taicpu(p).opcode=A_TEST) and
  13914. MatchOperand(taicpu(p).oper[0]^,-1);
  13915. if (OpsEqual(taicpu(p).oper[0]^,taicpu(p).oper[1]^) or IsTestConstX) and
  13916. GetLastInstruction(p, hp1) and
  13917. (tai(hp1).typ = ait_instruction) and
  13918. GetNextInstruction(p,hp2) and
  13919. MatchInstruction(hp2,A_SETcc,A_Jcc,A_CMOVcc,[]) then
  13920. case taicpu(hp1).opcode Of
  13921. A_ADD, A_SUB, A_OR, A_XOR, A_AND,
  13922. { These two instructions set the zero flag if the result is zero }
  13923. A_POPCNT, A_LZCNT:
  13924. begin
  13925. if (
  13926. { With POPCNT, an input of zero will set the zero flag
  13927. because the population count of zero is zero }
  13928. (taicpu(hp1).opcode = A_POPCNT) and
  13929. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) and
  13930. (
  13931. OpsEqual(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^) or
  13932. { Faster than going through the second half of the 'or'
  13933. condition below }
  13934. OpsEqual(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^)
  13935. )
  13936. ) or (
  13937. OpsEqual(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^) and
  13938. { does not work in case of overflow for G(E)/L(E)/C_O/C_NO }
  13939. { and in case of carry for A(E)/B(E)/C/NC }
  13940. (
  13941. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) or
  13942. (
  13943. (taicpu(hp1).opcode <> A_ADD) and
  13944. (taicpu(hp1).opcode <> A_SUB) and
  13945. (taicpu(hp1).opcode <> A_LZCNT)
  13946. )
  13947. )
  13948. ) then
  13949. begin
  13950. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (2-op) done', hp1);
  13951. RemoveCurrentP(p, hp2);
  13952. Result:=true;
  13953. Exit;
  13954. end;
  13955. end;
  13956. A_SHL, A_SAL, A_SHR, A_SAR:
  13957. begin
  13958. if OpsEqual(taicpu(hp1).oper[1]^,taicpu(p).oper[1]^) and
  13959. { SHL/SAL/SHR/SAR with a value of 0 do not change the flags }
  13960. { therefore, it's only safe to do this optimization for }
  13961. { shifts by a (nonzero) constant }
  13962. (taicpu(hp1).oper[0]^.typ = top_const) and
  13963. (taicpu(hp1).oper[0]^.val <> 0) and
  13964. { does not work in case of overflow for G(E)/L(E)/C_O/C_NO }
  13965. { and in case of carry for A(E)/B(E)/C/NC }
  13966. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) then
  13967. begin
  13968. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (shift) done', hp1);
  13969. RemoveCurrentP(p, hp2);
  13970. Result:=true;
  13971. Exit;
  13972. end;
  13973. end;
  13974. A_DEC, A_INC, A_NEG:
  13975. begin
  13976. if OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) and
  13977. { does not work in case of overflow for G(E)/L(E)/C_O/C_NO }
  13978. { and in case of carry for A(E)/B(E)/C/NC }
  13979. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) then
  13980. begin
  13981. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (1-op) done', hp1);
  13982. RemoveCurrentP(p, hp2);
  13983. Result:=true;
  13984. Exit;
  13985. end;
  13986. end;
  13987. A_ANDN, A_BZHI:
  13988. begin
  13989. if OpsEqual(taicpu(hp1).oper[2]^,taicpu(p).oper[1]^) and
  13990. { Only the zero and sign flags are consistent with what the result is }
  13991. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE,C_S,C_NS]) then
  13992. begin
  13993. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (ANDN/BZHI) done', hp1);
  13994. RemoveCurrentP(p, hp2);
  13995. Result:=true;
  13996. Exit;
  13997. end;
  13998. end;
  13999. A_BEXTR:
  14000. begin
  14001. if OpsEqual(taicpu(hp1).oper[2]^,taicpu(p).oper[1]^) and
  14002. { Only the zero flag is set }
  14003. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) then
  14004. begin
  14005. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (BEXTR) done', hp1);
  14006. RemoveCurrentP(p, hp2);
  14007. Result:=true;
  14008. Exit;
  14009. end;
  14010. end;
  14011. else
  14012. ;
  14013. end; { case }
  14014. { change "test $-1,%reg" into "test %reg,%reg" }
  14015. if IsTestConstX and (taicpu(p).oper[1]^.typ=top_reg) then
  14016. taicpu(p).loadoper(0,taicpu(p).oper[1]^);
  14017. { Change "or %reg,%reg" to "test %reg,%reg" as OR generates a false dependency }
  14018. if MatchInstruction(p, A_OR, []) and
  14019. { Can only match if they're both registers }
  14020. MatchOperand(taicpu(p).oper[0]^, taicpu(p).oper[1]^) then
  14021. begin
  14022. DebugMsg(SPeepholeOptimization + 'or %reg,%reg -> test %reg,%reg to remove false dependency (Or2Test)', p);
  14023. taicpu(p).opcode := A_TEST;
  14024. { No need to set Result to True, as we've done all the optimisations we can }
  14025. end;
  14026. end;
  14027. function TX86AsmOptimizer.PostPeepholeOptCall(var p : tai) : Boolean;
  14028. var
  14029. hp1,hp3 : tai;
  14030. {$ifndef x86_64}
  14031. hp2 : taicpu;
  14032. {$endif x86_64}
  14033. begin
  14034. Result:=false;
  14035. hp3:=nil;
  14036. {$ifndef x86_64}
  14037. { don't do this on modern CPUs, this really hurts them due to
  14038. broken call/ret pairing }
  14039. if (current_settings.optimizecputype < cpu_Pentium2) and
  14040. not(cs_create_pic in current_settings.moduleswitches) and
  14041. GetNextInstruction(p, hp1) and
  14042. MatchInstruction(hp1,A_JMP,[S_NO]) and
  14043. MatchOpType(taicpu(hp1),top_ref) and
  14044. (taicpu(hp1).oper[0]^.ref^.refaddr=addr_full) then
  14045. begin
  14046. hp2 := taicpu.Op_sym(A_PUSH,S_L,taicpu(hp1).oper[0]^.ref^.symbol);
  14047. taicpu(hp2).fileinfo := taicpu(p).fileinfo;
  14048. InsertLLItem(p.previous, p, hp2);
  14049. taicpu(p).opcode := A_JMP;
  14050. taicpu(p).is_jmp := true;
  14051. RemoveInstruction(hp1);
  14052. Result:=true;
  14053. end
  14054. else
  14055. {$endif x86_64}
  14056. { replace
  14057. call procname
  14058. ret
  14059. by
  14060. jmp procname
  14061. but do it only on level 4 because it destroys stack back traces
  14062. else if the subroutine is marked as no return, remove the ret
  14063. }
  14064. if ((cs_opt_level4 in current_settings.optimizerswitches) or
  14065. (po_noreturn in current_procinfo.procdef.procoptions)) and
  14066. GetNextInstruction(p, hp1) and
  14067. (MatchInstruction(hp1,A_RET,[S_NO]) or
  14068. (MatchInstruction(hp1,A_VZEROUPPER,[S_NO]) and
  14069. SetAndTest(hp1,hp3) and
  14070. GetNextInstruction(hp1,hp1) and
  14071. MatchInstruction(hp1,A_RET,[S_NO])
  14072. )
  14073. ) and
  14074. (taicpu(hp1).ops=0) then
  14075. begin
  14076. if (cs_opt_level4 in current_settings.optimizerswitches) and
  14077. { we might destroy stack alignment here if we do not do a call }
  14078. (target_info.stackalign<=sizeof(SizeUInt)) then
  14079. begin
  14080. taicpu(p).opcode := A_JMP;
  14081. taicpu(p).is_jmp := true;
  14082. DebugMsg(SPeepholeOptimization + 'CallRet2Jmp done',p);
  14083. end
  14084. else
  14085. DebugMsg(SPeepholeOptimization + 'CallRet2Call done',p);
  14086. RemoveInstruction(hp1);
  14087. if Assigned(hp3) then
  14088. begin
  14089. AsmL.Remove(hp3);
  14090. AsmL.InsertBefore(hp3,p)
  14091. end;
  14092. Result:=true;
  14093. end;
  14094. end;
  14095. function TX86AsmOptimizer.PostPeepholeOptMovzx(var p : tai) : Boolean;
  14096. function ConstInRange(const Val: TCGInt; const OpSize: TOpSize): Boolean;
  14097. begin
  14098. case OpSize of
  14099. S_B, S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  14100. Result := (Val <= $FF) and (Val >= -128);
  14101. S_W, S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  14102. Result := (Val <= $FFFF) and (Val >= -32768);
  14103. S_L{$ifdef x86_64}, S_LQ{$endif x86_64}:
  14104. Result := (Val <= $FFFFFFFF) and (Val >= -2147483648);
  14105. else
  14106. Result := True;
  14107. end;
  14108. end;
  14109. var
  14110. hp1, hp2 : tai;
  14111. SizeChange: Boolean;
  14112. PreMessage: string;
  14113. begin
  14114. Result := False;
  14115. if (taicpu(p).oper[0]^.typ = top_reg) and
  14116. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  14117. GetNextInstruction(p, hp1) and (hp1.typ = ait_instruction) then
  14118. begin
  14119. { Change (using movzbl %al,%eax as an example):
  14120. movzbl %al, %eax movzbl %al, %eax
  14121. cmpl x, %eax testl %eax,%eax
  14122. To:
  14123. cmpb x, %al testb %al, %al (Move one back to avoid a false dependency)
  14124. movzbl %al, %eax movzbl %al, %eax
  14125. Smaller instruction and minimises pipeline stall as the CPU
  14126. doesn't have to wait for the register to get zero-extended. [Kit]
  14127. Also allow if the smaller of the two registers is being checked,
  14128. as this still removes the false dependency.
  14129. }
  14130. if
  14131. (
  14132. (
  14133. (taicpu(hp1).opcode = A_CMP) and MatchOpType(taicpu(hp1), top_const, top_reg) and
  14134. ConstInRange(taicpu(hp1).oper[0]^.val, taicpu(p).opsize)
  14135. ) or (
  14136. { If MatchOperand returns True, they must both be registers }
  14137. (taicpu(hp1).opcode = A_TEST) and MatchOperand(taicpu(hp1).oper[0]^, taicpu(hp1).oper[1]^)
  14138. )
  14139. ) and
  14140. (reg2opsize(taicpu(hp1).oper[1]^.reg) <= reg2opsize(taicpu(p).oper[1]^.reg)) and
  14141. SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) then
  14142. begin
  14143. 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);
  14144. asml.Remove(hp1);
  14145. asml.InsertBefore(hp1, p);
  14146. { Swap instructions in the case of cmp 0,%reg or test %reg,%reg }
  14147. if (taicpu(hp1).opcode = A_TEST) or (taicpu(hp1).oper[0]^.val = 0) then
  14148. begin
  14149. taicpu(hp1).opcode := A_TEST;
  14150. taicpu(hp1).loadreg(0, taicpu(p).oper[0]^.reg);
  14151. end;
  14152. taicpu(hp1).oper[1]^.reg := taicpu(p).oper[0]^.reg;
  14153. case taicpu(p).opsize of
  14154. S_BW, S_BL:
  14155. begin
  14156. SizeChange := taicpu(hp1).opsize <> S_B;
  14157. taicpu(hp1).changeopsize(S_B);
  14158. end;
  14159. S_WL:
  14160. begin
  14161. SizeChange := taicpu(hp1).opsize <> S_W;
  14162. taicpu(hp1).changeopsize(S_W);
  14163. end
  14164. else
  14165. InternalError(2020112701);
  14166. end;
  14167. UpdateUsedRegs(tai(p.Next));
  14168. { Check if the register is used aferwards - if not, we can
  14169. remove the movzx instruction completely }
  14170. if not RegUsedAfterInstruction(taicpu(hp1).oper[1]^.reg, p, UsedRegs) then
  14171. begin
  14172. { Hp1 is a better position than p for debugging purposes }
  14173. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 4a', hp1);
  14174. RemoveCurrentp(p, hp1);
  14175. Result := True;
  14176. end;
  14177. if SizeChange then
  14178. DebugMsg(SPeepholeOptimization + PreMessage +
  14179. 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)
  14180. else
  14181. DebugMsg(SPeepholeOptimization + 'MovzxCmp2CmpMovzx', hp1);
  14182. Exit;
  14183. end;
  14184. { Change (using movzwl %ax,%eax as an example):
  14185. movzwl %ax, %eax
  14186. movb %al, (dest) (Register is smaller than read register in movz)
  14187. To:
  14188. movb %al, (dest) (Move one back to avoid a false dependency)
  14189. movzwl %ax, %eax
  14190. }
  14191. if (taicpu(hp1).opcode = A_MOV) and
  14192. (taicpu(hp1).oper[0]^.typ = top_reg) and
  14193. not RegInOp(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^) and
  14194. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(p).oper[0]^.reg) and
  14195. (reg2opsize(taicpu(hp1).oper[0]^.reg) <= reg2opsize(taicpu(p).oper[0]^.reg)) then
  14196. begin
  14197. DebugMsg(SPeepholeOptimization + 'MovzxMov2MovMovzx', hp1);
  14198. hp2 := tai(hp1.Previous); { Effectively the old position of hp1 }
  14199. asml.Remove(hp1);
  14200. asml.InsertBefore(hp1, p);
  14201. if taicpu(hp1).oper[1]^.typ = top_reg then
  14202. AllocRegBetween(taicpu(hp1).oper[1]^.reg, hp1, hp2, UsedRegs);
  14203. { Check if the register is used aferwards - if not, we can
  14204. remove the movzx instruction completely }
  14205. if not RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg, p, UsedRegs) then
  14206. begin
  14207. { Hp1 is a better position than p for debugging purposes }
  14208. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 4b', hp1);
  14209. RemoveCurrentp(p, hp1);
  14210. Result := True;
  14211. end;
  14212. Exit;
  14213. end;
  14214. end;
  14215. end;
  14216. function TX86AsmOptimizer.PostPeepholeOptXor(var p : tai) : Boolean;
  14217. var
  14218. hp1: tai;
  14219. {$ifdef x86_64}
  14220. PreMessage, RegName: string;
  14221. {$endif x86_64}
  14222. begin
  14223. Result := False;
  14224. { If x is a power of 2 (popcnt = 1), change:
  14225. xor $x, %reg/ref
  14226. To:
  14227. btc lb(x), %reg/ref
  14228. }
  14229. if IsBTXAcceptable(p) and
  14230. { IsBTXAcceptable checks to see if oper[0] is an immediate }
  14231. (PopCnt(QWord(taicpu(p).oper[0]^.val)) = 1) and
  14232. (
  14233. { Don't optimise if a test instruction follows }
  14234. not GetNextInstruction(p, hp1) or
  14235. not MatchInstruction(hp1, A_TEST, [taicpu(p).opsize])
  14236. ) then
  14237. begin
  14238. 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);
  14239. taicpu(p).opcode := A_BTC;
  14240. taicpu(p).oper[0]^.val := BsrQWord(taicpu(p).oper[0]^.val); { Essentially the base 2 logarithm }
  14241. Result := True;
  14242. Exit;
  14243. end;
  14244. {$ifdef x86_64}
  14245. { Code size reduction by J. Gareth "Kit" Moreton }
  14246. { change "xorq %reg,%reg" to "xorl %reg,%reg" for %rax, %rcx, %rdx, %rbx, %rsi, %rdi, %rbp and %rsp,
  14247. as this removes the REX prefix }
  14248. if not OpsEqual(taicpu(p).oper[0]^,taicpu(p).oper[1]^) then
  14249. Exit;
  14250. if taicpu(p).oper[0]^.typ <> top_reg then
  14251. { Should be impossible if both operands were equal, since one of XOR's operands must be a register }
  14252. InternalError(2018011500);
  14253. case taicpu(p).opsize of
  14254. S_Q:
  14255. begin
  14256. RegName := debug_regname(taicpu(p).oper[0]^.reg); { 64-bit register name }
  14257. PreMessage := 'xorq ' + RegName + ',' + RegName + ' -> xorl ';
  14258. { The actual optimization }
  14259. setsubreg(taicpu(p).oper[0]^.reg, R_SUBD);
  14260. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  14261. taicpu(p).changeopsize(S_L);
  14262. RegName := debug_regname(taicpu(p).oper[0]^.reg); { 32-bit register name }
  14263. DebugMsg(SPeepholeOptimization + PreMessage + RegName + ',' + RegName + ' (32-bit register recommended when zeroing 64-bit counterpart)', p);
  14264. end;
  14265. else
  14266. ;
  14267. end;
  14268. {$endif x86_64}
  14269. end;
  14270. function TX86AsmOptimizer.PostPeepholeOptVPXOR(var p : tai) : Boolean;
  14271. var
  14272. XReg: TRegister;
  14273. begin
  14274. Result := False;
  14275. { Turn "vpxor %ymmreg2,%ymmreg2,%ymmreg1" to "vpxor %xmmreg2,%xmmreg2,%xmmreg1"
  14276. Smaller encoding and slightly faster on some platforms (also works for
  14277. ZMM-sized registers) }
  14278. if (taicpu(p).opsize in [S_YMM, S_ZMM]) and
  14279. MatchOpType(taicpu(p), top_reg, top_reg, top_reg) then
  14280. begin
  14281. XReg := taicpu(p).oper[0]^.reg;
  14282. if (taicpu(p).oper[1]^.reg = XReg) then
  14283. begin
  14284. taicpu(p).changeopsize(S_XMM);
  14285. setsubreg(taicpu(p).oper[2]^.reg, R_SUBMMX);
  14286. if (cs_opt_size in current_settings.optimizerswitches) then
  14287. begin
  14288. { Change input registers to %xmm0 to reduce size. Note that
  14289. there's a risk of a false dependency doing this, so only
  14290. optimise for size here }
  14291. XReg := NR_XMM0;
  14292. DebugMsg(SPeepholeOptimization + 'Changed zero-setting vpxor from Y/ZMM to XMM and changed input registers to %xmm0 to reduce size', p);
  14293. end
  14294. else
  14295. begin
  14296. setsubreg(XReg, R_SUBMMX);
  14297. DebugMsg(SPeepholeOptimization + 'Changed zero-setting vpxor from Y/ZMM to XMM to reduce size and increase efficiency', p);
  14298. end;
  14299. taicpu(p).oper[0]^.reg := XReg;
  14300. taicpu(p).oper[1]^.reg := XReg;
  14301. Result := True;
  14302. end;
  14303. end;
  14304. end;
  14305. class procedure TX86AsmOptimizer.OptimizeRefs(var p: taicpu);
  14306. var
  14307. OperIdx: Integer;
  14308. begin
  14309. for OperIdx := 0 to p.ops - 1 do
  14310. if p.oper[OperIdx]^.typ = top_ref then
  14311. optimize_ref(p.oper[OperIdx]^.ref^, False);
  14312. end;
  14313. end.