aoptx86.pas 677 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736147371473814739147401474114742147431474414745147461474714748147491475014751147521475314754147551475614757147581475914760147611476214763147641476514766147671476814769147701477114772147731477414775147761477714778147791478014781147821478314784147851478614787147881478914790147911479214793147941479514796147971479814799148001480114802148031480414805148061480714808148091481014811148121481314814148151481614817148181481914820148211482214823148241482514826148271482814829148301483114832148331483414835148361483714838148391484014841148421484314844148451484614847148481484914850148511485214853148541485514856148571485814859148601486114862148631486414865148661486714868148691487014871148721487314874148751487614877148781487914880148811488214883148841488514886148871488814889148901489114892148931489414895148961489714898148991490014901149021490314904149051490614907149081490914910149111491214913149141491514916149171491814919149201492114922149231492414925149261492714928149291493014931149321493314934149351493614937149381493914940149411494214943149441494514946149471494814949149501495114952149531495414955149561495714958149591496014961149621496314964149651496614967149681496914970149711497214973149741497514976149771497814979149801498114982149831498414985149861498714988149891499014991149921499314994149951499614997149981499915000150011500215003150041500515006150071500815009150101501115012150131501415015150161501715018150191502015021150221502315024150251502615027150281502915030150311503215033150341503515036150371503815039150401504115042150431504415045150461504715048150491505015051150521505315054150551505615057150581505915060150611506215063150641506515066150671506815069150701507115072150731507415075150761507715078150791508015081150821508315084150851508615087150881508915090150911509215093150941509515096150971509815099151001510115102151031510415105151061510715108151091511015111151121511315114151151511615117151181511915120151211512215123151241512515126151271512815129151301513115132151331513415135151361513715138151391514015141151421514315144151451514615147151481514915150151511515215153151541515515156151571515815159151601516115162151631516415165151661516715168151691517015171151721517315174151751517615177151781517915180151811518215183151841518515186151871518815189151901519115192151931519415195151961519715198151991520015201152021520315204152051520615207152081520915210152111521215213152141521515216152171521815219152201522115222152231522415225152261522715228152291523015231152321523315234152351523615237152381523915240152411524215243152441524515246152471524815249152501525115252152531525415255152561525715258152591526015261152621526315264152651526615267152681526915270152711527215273152741527515276152771527815279152801528115282152831528415285152861528715288152891529015291152921529315294152951529615297152981529915300153011530215303153041530515306153071530815309153101531115312153131531415315153161531715318153191532015321153221532315324153251532615327153281532915330153311533215333153341533515336153371533815339153401534115342153431534415345153461534715348153491535015351153521535315354153551535615357153581535915360153611536215363153641536515366153671536815369153701537115372153731537415375153761537715378153791538015381153821538315384153851538615387153881538915390153911539215393153941539515396153971539815399154001540115402154031540415405154061540715408154091541015411154121541315414154151541615417154181541915420154211542215423154241542515426154271542815429154301543115432154331543415435154361543715438154391544015441154421544315444154451544615447154481544915450154511545215453154541545515456154571545815459154601546115462154631546415465154661546715468154691547015471154721547315474154751547615477154781547915480154811548215483154841548515486154871548815489154901549115492154931549415495154961549715498154991550015501155021550315504155051550615507155081550915510155111551215513155141551515516155171551815519155201552115522155231552415525155261552715528155291553015531155321553315534155351553615537155381553915540155411554215543155441554515546155471554815549155501555115552155531555415555155561555715558155591556015561155621556315564155651556615567155681556915570155711557215573155741557515576155771557815579155801558115582155831558415585155861558715588155891559015591155921559315594155951559615597155981559915600156011560215603156041560515606156071560815609156101561115612156131561415615156161561715618156191562015621156221562315624156251562615627156281562915630156311563215633156341563515636156371563815639156401564115642156431564415645156461564715648156491565015651156521565315654156551565615657156581565915660156611566215663156641566515666156671566815669156701567115672156731567415675156761567715678156791568015681156821568315684156851568615687156881568915690156911569215693156941569515696156971569815699157001570115702157031570415705157061570715708157091571015711157121571315714157151571615717157181571915720157211572215723157241572515726157271572815729157301573115732157331573415735157361573715738157391574015741157421574315744157451574615747157481574915750157511575215753157541575515756157571575815759157601576115762157631576415765
  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. { changes the code sequence
  1385. shr/sar const1, x
  1386. shl const2, x
  1387. to
  1388. either "sar/and", "shl/and" or just "and" depending on const1 and const2 }
  1389. if GetNextInstruction(p, hp1) and
  1390. MatchInstruction(hp1,A_SHL,[]) and
  1391. (taicpu(p).oper[0]^.typ = top_const) and
  1392. (taicpu(hp1).oper[0]^.typ = top_const) and
  1393. (taicpu(hp1).opsize = taicpu(p).opsize) and
  1394. (taicpu(hp1).oper[1]^.typ = taicpu(p).oper[1]^.typ) and
  1395. OpsEqual(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^) then
  1396. begin
  1397. if (taicpu(p).oper[0]^.val > taicpu(hp1).oper[0]^.val) and
  1398. not(cs_opt_size in current_settings.optimizerswitches) then
  1399. begin
  1400. { shr/sar const1, %reg
  1401. shl const2, %reg
  1402. with const1 > const2 }
  1403. taicpu(p).loadConst(0,taicpu(p).oper[0]^.val-taicpu(hp1).oper[0]^.val);
  1404. taicpu(hp1).opcode := A_AND;
  1405. l := (1 shl (taicpu(hp1).oper[0]^.val)) - 1;
  1406. case taicpu(p).opsize Of
  1407. S_B: taicpu(hp1).loadConst(0,l Xor $ff);
  1408. S_W: taicpu(hp1).loadConst(0,l Xor $ffff);
  1409. S_L: taicpu(hp1).loadConst(0,l Xor tcgint($ffffffff));
  1410. S_Q: taicpu(hp1).loadConst(0,l Xor tcgint($ffffffffffffffff));
  1411. else
  1412. Internalerror(2017050703)
  1413. end;
  1414. end
  1415. else if (taicpu(p).oper[0]^.val<taicpu(hp1).oper[0]^.val) and
  1416. not(cs_opt_size in current_settings.optimizerswitches) then
  1417. begin
  1418. { shr/sar const1, %reg
  1419. shl const2, %reg
  1420. with const1 < const2 }
  1421. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val-taicpu(p).oper[0]^.val);
  1422. taicpu(p).opcode := A_AND;
  1423. l := (1 shl (taicpu(p).oper[0]^.val))-1;
  1424. case taicpu(p).opsize Of
  1425. S_B: taicpu(p).loadConst(0,l Xor $ff);
  1426. S_W: taicpu(p).loadConst(0,l Xor $ffff);
  1427. S_L: taicpu(p).loadConst(0,l Xor tcgint($ffffffff));
  1428. S_Q: taicpu(p).loadConst(0,l Xor tcgint($ffffffffffffffff));
  1429. else
  1430. Internalerror(2017050702)
  1431. end;
  1432. end
  1433. else if (taicpu(p).oper[0]^.val = taicpu(hp1).oper[0]^.val) then
  1434. begin
  1435. { shr/sar const1, %reg
  1436. shl const2, %reg
  1437. with const1 = const2 }
  1438. taicpu(p).opcode := A_AND;
  1439. l := (1 shl (taicpu(p).oper[0]^.val))-1;
  1440. case taicpu(p).opsize Of
  1441. S_B: taicpu(p).loadConst(0,l Xor $ff);
  1442. S_W: taicpu(p).loadConst(0,l Xor $ffff);
  1443. S_L: taicpu(p).loadConst(0,l Xor tcgint($ffffffff));
  1444. S_Q: taicpu(p).loadConst(0,l Xor tcgint($ffffffffffffffff));
  1445. else
  1446. Internalerror(2017050701)
  1447. end;
  1448. RemoveInstruction(hp1);
  1449. end;
  1450. end;
  1451. end;
  1452. function TX86AsmOptimizer.PrePeepholeOptIMUL(var p : tai) : boolean;
  1453. var
  1454. opsize : topsize;
  1455. hp1, hp2 : tai;
  1456. tmpref : treference;
  1457. ShiftValue : Cardinal;
  1458. BaseValue : TCGInt;
  1459. begin
  1460. result:=false;
  1461. opsize:=taicpu(p).opsize;
  1462. { changes certain "imul const, %reg"'s to lea sequences }
  1463. if (MatchOpType(taicpu(p),top_const,top_reg) or
  1464. MatchOpType(taicpu(p),top_const,top_reg,top_reg)) and
  1465. (opsize in [S_L{$ifdef x86_64},S_Q{$endif x86_64}]) then
  1466. if (taicpu(p).oper[0]^.val = 1) then
  1467. if (taicpu(p).ops = 2) then
  1468. { remove "imul $1, reg" }
  1469. begin
  1470. DebugMsg(SPeepholeOptimization + 'Imul2Nop done',p);
  1471. Result := RemoveCurrentP(p);
  1472. end
  1473. else
  1474. { change "imul $1, reg1, reg2" to "mov reg1, reg2" }
  1475. begin
  1476. hp1 := taicpu.Op_Reg_Reg(A_MOV, opsize, taicpu(p).oper[1]^.reg,taicpu(p).oper[2]^.reg);
  1477. taicpu(hp1).fileinfo := taicpu(p).fileinfo;
  1478. asml.InsertAfter(hp1, p);
  1479. DebugMsg(SPeepholeOptimization + 'Imul2Mov done',p);
  1480. RemoveCurrentP(p, hp1);
  1481. Result := True;
  1482. end
  1483. else if ((taicpu(p).ops <= 2) or
  1484. (taicpu(p).oper[2]^.typ = Top_Reg)) and
  1485. not(cs_opt_size in current_settings.optimizerswitches) and
  1486. (not(GetNextInstruction(p, hp1)) or
  1487. not((tai(hp1).typ = ait_instruction) and
  1488. ((taicpu(hp1).opcode=A_Jcc) and
  1489. (taicpu(hp1).condition in [C_O,C_NO])))) then
  1490. begin
  1491. {
  1492. imul X, reg1, reg2 to
  1493. lea (reg1,reg1,Y), reg2
  1494. shl ZZ,reg2
  1495. imul XX, reg1 to
  1496. lea (reg1,reg1,YY), reg1
  1497. shl ZZ,reg2
  1498. This optimziation makes sense for pretty much every x86, except the VIA Nano3000: it has IMUL latency 2, lea/shl pair as well,
  1499. it does not exist as a separate optimization target in FPC though.
  1500. This optimziation can be applied as long as only two bits are set in the constant and those two bits are separated by
  1501. at most two zeros
  1502. }
  1503. reference_reset(tmpref,1,[]);
  1504. if (PopCnt(QWord(taicpu(p).oper[0]^.val))=2) and (BsrQWord(taicpu(p).oper[0]^.val)-BsfQWord(taicpu(p).oper[0]^.val)<=3) then
  1505. begin
  1506. ShiftValue:=BsfQWord(taicpu(p).oper[0]^.val);
  1507. BaseValue:=taicpu(p).oper[0]^.val shr ShiftValue;
  1508. TmpRef.base := taicpu(p).oper[1]^.reg;
  1509. TmpRef.index := taicpu(p).oper[1]^.reg;
  1510. if not(BaseValue in [3,5,9]) then
  1511. Internalerror(2018110101);
  1512. TmpRef.ScaleFactor := BaseValue-1;
  1513. if (taicpu(p).ops = 2) then
  1514. hp1 := taicpu.op_ref_reg(A_LEA, opsize, TmpRef, taicpu(p).oper[1]^.reg)
  1515. else
  1516. hp1 := taicpu.op_ref_reg(A_LEA, opsize, TmpRef, taicpu(p).oper[2]^.reg);
  1517. AsmL.InsertAfter(hp1,p);
  1518. DebugMsg(SPeepholeOptimization + 'Imul2LeaShl done',p);
  1519. taicpu(hp1).fileinfo:=taicpu(p).fileinfo;
  1520. RemoveCurrentP(p, hp1);
  1521. if ShiftValue>0 then
  1522. begin
  1523. hp2 := taicpu.op_const_reg(A_SHL, opsize, ShiftValue, taicpu(hp1).oper[1]^.reg);
  1524. AsmL.InsertAfter(hp2,hp1);
  1525. taicpu(hp2).fileinfo:=taicpu(hp1).fileinfo;
  1526. end;
  1527. Result := True;
  1528. end;
  1529. end;
  1530. end;
  1531. function TX86AsmOptimizer.PrePeepholeOptAND(var p : tai) : boolean;
  1532. begin
  1533. Result := False;
  1534. if MatchOperand(taicpu(p).oper[0]^, 0) and
  1535. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  1536. begin
  1537. DebugMsg(SPeepholeOptimization + 'AND 0 -> MOV 0', p);
  1538. taicpu(p).opcode := A_MOV;
  1539. Result := True;
  1540. end;
  1541. end;
  1542. function TX86AsmOptimizer.RegLoadedWithNewValue(reg: tregister; hp: tai): boolean;
  1543. var
  1544. p: taicpu absolute hp; { Implicit typecast }
  1545. i: Integer;
  1546. begin
  1547. Result := False;
  1548. if not assigned(hp) or
  1549. (hp.typ <> ait_instruction) then
  1550. Exit;
  1551. Prefetch(insprop[p.opcode]);
  1552. if SuperRegistersEqual(reg,NR_DEFAULTFLAGS) then
  1553. with insprop[p.opcode] do
  1554. begin
  1555. case getsubreg(reg) of
  1556. R_SUBW,R_SUBD,R_SUBQ:
  1557. Result:=
  1558. { ZF, CF, OF, SF, PF and AF must all be set in some way (ordered so the most
  1559. uncommon flags are checked first }
  1560. ([Ch_W0AuxiliaryFlag,Ch_W1AuxiliaryFlag,Ch_WAuxiliaryFlag,Ch_WUAuxiliaryFlag,Ch_WFlags] * Ch <> []) and
  1561. ([Ch_W0ParityFlag,Ch_W1ParityFlag,Ch_WParityFlag,Ch_WUParityFlag,Ch_WFlags]*Ch <> []) and
  1562. ([Ch_W0SignFlag,Ch_W1SignFlag,Ch_WSignFlag,Ch_WUSignFlag,Ch_WFlags]*Ch <> []) and
  1563. ([Ch_W0OverflowFlag,Ch_W1OverflowFlag,Ch_WOverflowFlag,Ch_WUOverflowFlag,Ch_WFlags]*Ch <> []) and
  1564. ([Ch_W0CarryFlag,Ch_W1CarryFlag,Ch_WCarryFlag,Ch_WUCarryFlag,Ch_WFlags]*Ch <> []) and
  1565. ([Ch_W0ZeroFlag,Ch_W1ZeroFlag,Ch_WZeroFlag,Ch_WUZeroFlag,Ch_WFlags]*Ch <> []);
  1566. R_SUBFLAGCARRY:
  1567. Result:=[Ch_W0CarryFlag,Ch_W1CarryFlag,Ch_WCarryFlag,Ch_WUCarryFlag,Ch_WFlags]*Ch<>[];
  1568. R_SUBFLAGPARITY:
  1569. Result:=[Ch_W0ParityFlag,Ch_W1ParityFlag,Ch_WParityFlag,Ch_WUParityFlag,Ch_WFlags]*Ch<>[];
  1570. R_SUBFLAGAUXILIARY:
  1571. Result:=[Ch_W0AuxiliaryFlag,Ch_W1AuxiliaryFlag,Ch_WAuxiliaryFlag,Ch_WUAuxiliaryFlag,Ch_WFlags]*Ch<>[];
  1572. R_SUBFLAGZERO:
  1573. Result:=[Ch_W0ZeroFlag,Ch_W1ZeroFlag,Ch_WZeroFlag,Ch_WUZeroFlag,Ch_WFlags]*Ch<>[];
  1574. R_SUBFLAGSIGN:
  1575. Result:=[Ch_W0SignFlag,Ch_W1SignFlag,Ch_WSignFlag,Ch_WUSignFlag,Ch_WFlags]*Ch<>[];
  1576. R_SUBFLAGOVERFLOW:
  1577. Result:=[Ch_W0OverflowFlag,Ch_W1OverflowFlag,Ch_WOverflowFlag,Ch_WUOverflowFlag,Ch_WFlags]*Ch<>[];
  1578. R_SUBFLAGINTERRUPT:
  1579. Result:=[Ch_W0IntFlag,Ch_W1IntFlag,Ch_WFlags]*Ch<>[];
  1580. R_SUBFLAGDIRECTION:
  1581. Result:=[Ch_W0DirFlag,Ch_W1DirFlag,Ch_WFlags]*Ch<>[];
  1582. else
  1583. internalerror(2017050501);
  1584. end;
  1585. exit;
  1586. end;
  1587. { Handle special cases first }
  1588. case p.opcode of
  1589. A_MOV, A_MOVZX, A_MOVSX, A_LEA, A_VMOVSS, A_VMOVSD, A_VMOVAPD,
  1590. A_VMOVAPS, A_VMOVQ, A_MOVSS, A_MOVSD, A_MOVQ, A_MOVAPD, A_MOVAPS:
  1591. begin
  1592. Result :=
  1593. (p.ops=2) and { A_MOVSD can have zero operands, so this check is needed }
  1594. (p.oper[1]^.typ = top_reg) and
  1595. (Reg1WriteOverwritesReg2Entirely(p.oper[1]^.reg,reg)) and
  1596. (
  1597. (p.oper[0]^.typ = top_const) or
  1598. (
  1599. (p.oper[0]^.typ = top_reg) and
  1600. not(Reg1ReadDependsOnReg2(p.oper[0]^.reg,reg))
  1601. ) or (
  1602. (p.oper[0]^.typ = top_ref) and
  1603. not RegInRef(reg,p.oper[0]^.ref^)
  1604. )
  1605. );
  1606. end;
  1607. A_MUL, A_IMUL:
  1608. Result :=
  1609. (
  1610. (p.ops=3) and { IMUL only }
  1611. (Reg1WriteOverwritesReg2Entirely(p.oper[2]^.reg,reg)) and
  1612. (
  1613. (
  1614. (p.oper[1]^.typ=top_reg) and
  1615. not Reg1ReadDependsOnReg2(p.oper[1]^.reg,reg)
  1616. ) or (
  1617. (p.oper[1]^.typ=top_ref) and
  1618. not RegInRef(reg,p.oper[1]^.ref^)
  1619. )
  1620. )
  1621. ) or (
  1622. (
  1623. (p.ops=1) and
  1624. (
  1625. (
  1626. (
  1627. (p.oper[0]^.typ=top_reg) and
  1628. not Reg1ReadDependsOnReg2(p.oper[0]^.reg,reg)
  1629. )
  1630. ) or (
  1631. (p.oper[0]^.typ=top_ref) and
  1632. not RegInRef(reg,p.oper[0]^.ref^)
  1633. )
  1634. ) and (
  1635. (
  1636. (p.opsize=S_B) and
  1637. Reg1WriteOverwritesReg2Entirely(NR_AX,reg) and
  1638. not Reg1ReadDependsOnReg2(NR_AL,reg)
  1639. ) or (
  1640. (p.opsize=S_W) and
  1641. Reg1WriteOverwritesReg2Entirely(NR_DX,reg)
  1642. ) or (
  1643. (p.opsize=S_L) and
  1644. Reg1WriteOverwritesReg2Entirely(NR_EDX,reg)
  1645. {$ifdef x86_64}
  1646. ) or (
  1647. (p.opsize=S_Q) and
  1648. Reg1WriteOverwritesReg2Entirely(NR_RDX,reg)
  1649. {$endif x86_64}
  1650. )
  1651. )
  1652. )
  1653. );
  1654. A_CBW:
  1655. Result := Reg1WriteOverwritesReg2Entirely(NR_AX,reg) and not(Reg1ReadDependsOnReg2(NR_AL,reg));
  1656. {$ifndef x86_64}
  1657. A_LDS:
  1658. Result := (reg=NR_DS) and not(RegInRef(reg,p.oper[0]^.ref^));
  1659. A_LES:
  1660. Result := (reg=NR_ES) and not(RegInRef(reg,p.oper[0]^.ref^));
  1661. {$endif not x86_64}
  1662. A_LFS:
  1663. Result := (reg=NR_FS) and not(RegInRef(reg,p.oper[0]^.ref^));
  1664. A_LGS:
  1665. Result := (reg=NR_GS) and not(RegInRef(reg,p.oper[0]^.ref^));
  1666. A_LSS:
  1667. Result := (reg=NR_SS) and not(RegInRef(reg,p.oper[0]^.ref^));
  1668. A_LAHF{$ifndef x86_64}, A_AAM{$endif not x86_64}:
  1669. Result := Reg1WriteOverwritesReg2Entirely(NR_AH,reg);
  1670. A_LODSB:
  1671. Result := Reg1WriteOverwritesReg2Entirely(NR_AL,reg);
  1672. A_LODSW:
  1673. Result := Reg1WriteOverwritesReg2Entirely(NR_AX,reg);
  1674. {$ifdef x86_64}
  1675. A_LODSQ:
  1676. Result := Reg1WriteOverwritesReg2Entirely(NR_RAX,reg);
  1677. {$endif x86_64}
  1678. A_LODSD:
  1679. Result := Reg1WriteOverwritesReg2Entirely(NR_EAX,reg);
  1680. A_FSTSW, A_FNSTSW:
  1681. Result := (p.oper[0]^.typ=top_reg) and Reg1WriteOverwritesReg2Entirely(p.oper[0]^.reg,reg);
  1682. else
  1683. begin
  1684. with insprop[p.opcode] do
  1685. begin
  1686. if (
  1687. { xor %reg,%reg etc. is classed as a new value }
  1688. (([Ch_NoReadIfEqualRegs]*Ch)<>[]) and
  1689. MatchOpType(p, top_reg, top_reg) and
  1690. (p.oper[0]^.reg = p.oper[1]^.reg) and
  1691. Reg1WriteOverwritesReg2Entirely(p.oper[1]^.reg,reg)
  1692. ) then
  1693. begin
  1694. Result := True;
  1695. Exit;
  1696. end;
  1697. { Make sure the entire register is overwritten }
  1698. if (getregtype(reg) = R_INTREGISTER) then
  1699. begin
  1700. if (p.ops > 0) then
  1701. begin
  1702. if RegInOp(reg, p.oper[0]^) then
  1703. begin
  1704. if (p.oper[0]^.typ = top_ref) then
  1705. begin
  1706. if RegInRef(reg, p.oper[0]^.ref^) then
  1707. begin
  1708. Result := False;
  1709. Exit;
  1710. end;
  1711. end
  1712. else if (p.oper[0]^.typ = top_reg) then
  1713. begin
  1714. if ([Ch_ROp1, Ch_RWOp1, Ch_MOp1]*Ch<>[]) then
  1715. begin
  1716. Result := False;
  1717. Exit;
  1718. end
  1719. else if ([Ch_WOp1]*Ch<>[]) then
  1720. begin
  1721. if Reg1WriteOverwritesReg2Entirely(p.oper[0]^.reg, reg) then
  1722. Result := True
  1723. else
  1724. begin
  1725. Result := False;
  1726. Exit;
  1727. end;
  1728. end;
  1729. end;
  1730. end;
  1731. if (p.ops > 1) then
  1732. begin
  1733. if RegInOp(reg, p.oper[1]^) then
  1734. begin
  1735. if (p.oper[1]^.typ = top_ref) then
  1736. begin
  1737. if RegInRef(reg, p.oper[1]^.ref^) then
  1738. begin
  1739. Result := False;
  1740. Exit;
  1741. end;
  1742. end
  1743. else if (p.oper[1]^.typ = top_reg) then
  1744. begin
  1745. if ([Ch_ROp2, Ch_RWOp2, Ch_MOp2]*Ch<>[]) then
  1746. begin
  1747. Result := False;
  1748. Exit;
  1749. end
  1750. else if ([Ch_WOp2]*Ch<>[]) then
  1751. begin
  1752. if Reg1WriteOverwritesReg2Entirely(p.oper[1]^.reg, reg) then
  1753. Result := True
  1754. else
  1755. begin
  1756. Result := False;
  1757. Exit;
  1758. end;
  1759. end;
  1760. end;
  1761. end;
  1762. if (p.ops > 2) then
  1763. begin
  1764. if RegInOp(reg, p.oper[2]^) then
  1765. begin
  1766. if (p.oper[2]^.typ = top_ref) then
  1767. begin
  1768. if RegInRef(reg, p.oper[2]^.ref^) then
  1769. begin
  1770. Result := False;
  1771. Exit;
  1772. end;
  1773. end
  1774. else if (p.oper[2]^.typ = top_reg) then
  1775. begin
  1776. if ([Ch_ROp3, Ch_RWOp3, Ch_MOp3]*Ch<>[]) then
  1777. begin
  1778. Result := False;
  1779. Exit;
  1780. end
  1781. else if ([Ch_WOp3]*Ch<>[]) then
  1782. begin
  1783. if Reg1WriteOverwritesReg2Entirely(p.oper[2]^.reg, reg) then
  1784. Result := True
  1785. else
  1786. begin
  1787. Result := False;
  1788. Exit;
  1789. end;
  1790. end;
  1791. end;
  1792. end;
  1793. if (p.ops > 3) and RegInOp(reg, p.oper[3]^) then
  1794. begin
  1795. if (p.oper[3]^.typ = top_ref) then
  1796. begin
  1797. if RegInRef(reg, p.oper[3]^.ref^) then
  1798. begin
  1799. Result := False;
  1800. Exit;
  1801. end;
  1802. end
  1803. else if (p.oper[3]^.typ = top_reg) then
  1804. begin
  1805. if ([Ch_ROp4, Ch_RWOp4, Ch_MOp4]*Ch<>[]) then
  1806. begin
  1807. Result := False;
  1808. Exit;
  1809. end
  1810. else if ([Ch_WOp4]*Ch<>[]) then
  1811. begin
  1812. if Reg1WriteOverwritesReg2Entirely(p.oper[3]^.reg, reg) then
  1813. Result := True
  1814. else
  1815. begin
  1816. Result := False;
  1817. Exit;
  1818. end;
  1819. end;
  1820. end;
  1821. end;
  1822. end;
  1823. end;
  1824. end;
  1825. { Don't do these ones first in case an input operand is equal to an explicit output register }
  1826. case getsupreg(reg) of
  1827. RS_EAX:
  1828. if ([Ch_WEAX{$ifdef x86_64},Ch_WRAX{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EAX, reg) then
  1829. begin
  1830. Result := True;
  1831. Exit;
  1832. end;
  1833. RS_ECX:
  1834. if ([Ch_WECX{$ifdef x86_64},Ch_WRCX{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_ECX, reg) then
  1835. begin
  1836. Result := True;
  1837. Exit;
  1838. end;
  1839. RS_EDX:
  1840. if ([Ch_REDX{$ifdef x86_64},Ch_WRDX{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EDX, reg) then
  1841. begin
  1842. Result := True;
  1843. Exit;
  1844. end;
  1845. RS_EBX:
  1846. if ([Ch_WEBX{$ifdef x86_64},Ch_WRBX{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EBX, reg) then
  1847. begin
  1848. Result := True;
  1849. Exit;
  1850. end;
  1851. RS_ESP:
  1852. if ([Ch_WESP{$ifdef x86_64},Ch_WRSP{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_ESP, reg) then
  1853. begin
  1854. Result := True;
  1855. Exit;
  1856. end;
  1857. RS_EBP:
  1858. if ([Ch_WEBP{$ifdef x86_64},Ch_WRBP{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EBP, reg) then
  1859. begin
  1860. Result := True;
  1861. Exit;
  1862. end;
  1863. RS_ESI:
  1864. if ([Ch_WESI{$ifdef x86_64},Ch_WRSI{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_ESI, reg) then
  1865. begin
  1866. Result := True;
  1867. Exit;
  1868. end;
  1869. RS_EDI:
  1870. if ([Ch_WEDI{$ifdef x86_64},Ch_WRDI{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EDI, reg) then
  1871. begin
  1872. Result := True;
  1873. Exit;
  1874. end;
  1875. else
  1876. ;
  1877. end;
  1878. end;
  1879. end;
  1880. end;
  1881. end;
  1882. end;
  1883. class function TX86AsmOptimizer.IsExitCode(p : tai) : boolean;
  1884. var
  1885. hp2,hp3 : tai;
  1886. begin
  1887. { some x86-64 issue a NOP before the real exit code }
  1888. if MatchInstruction(p,A_NOP,[]) then
  1889. GetNextInstruction(p,p);
  1890. result:=assigned(p) and (p.typ=ait_instruction) and
  1891. ((taicpu(p).opcode = A_RET) or
  1892. ((taicpu(p).opcode=A_LEAVE) and
  1893. GetNextInstruction(p,hp2) and
  1894. MatchInstruction(hp2,A_RET,[S_NO])
  1895. ) or
  1896. (((taicpu(p).opcode=A_LEA) and
  1897. MatchOpType(taicpu(p),top_ref,top_reg) and
  1898. (taicpu(p).oper[0]^.ref^.base=NR_STACK_POINTER_REG) and
  1899. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG)
  1900. ) and
  1901. GetNextInstruction(p,hp2) and
  1902. MatchInstruction(hp2,A_RET,[S_NO])
  1903. ) or
  1904. ((((taicpu(p).opcode=A_MOV) and
  1905. MatchOpType(taicpu(p),top_reg,top_reg) and
  1906. (taicpu(p).oper[0]^.reg=current_procinfo.framepointer) and
  1907. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG)) or
  1908. ((taicpu(p).opcode=A_LEA) and
  1909. MatchOpType(taicpu(p),top_ref,top_reg) and
  1910. (taicpu(p).oper[0]^.ref^.base=current_procinfo.framepointer) and
  1911. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG)
  1912. )
  1913. ) and
  1914. GetNextInstruction(p,hp2) and
  1915. MatchInstruction(hp2,A_POP,[reg2opsize(current_procinfo.framepointer)]) and
  1916. MatchOpType(taicpu(hp2),top_reg) and
  1917. (taicpu(hp2).oper[0]^.reg=current_procinfo.framepointer) and
  1918. GetNextInstruction(hp2,hp3) and
  1919. MatchInstruction(hp3,A_RET,[S_NO])
  1920. )
  1921. );
  1922. end;
  1923. class function TX86AsmOptimizer.isFoldableArithOp(hp1: taicpu; reg: tregister): boolean;
  1924. begin
  1925. isFoldableArithOp := False;
  1926. case hp1.opcode of
  1927. A_ADD,A_SUB,A_OR,A_XOR,A_AND,A_SHL,A_SHR,A_SAR:
  1928. isFoldableArithOp :=
  1929. ((taicpu(hp1).oper[0]^.typ = top_const) or
  1930. ((taicpu(hp1).oper[0]^.typ = top_reg) and
  1931. (taicpu(hp1).oper[0]^.reg <> reg))) and
  1932. (taicpu(hp1).oper[1]^.typ = top_reg) and
  1933. (taicpu(hp1).oper[1]^.reg = reg);
  1934. A_INC,A_DEC,A_NEG,A_NOT:
  1935. isFoldableArithOp :=
  1936. (taicpu(hp1).oper[0]^.typ = top_reg) and
  1937. (taicpu(hp1).oper[0]^.reg = reg);
  1938. else
  1939. ;
  1940. end;
  1941. end;
  1942. procedure TX86AsmOptimizer.RemoveLastDeallocForFuncRes(p: tai);
  1943. procedure DoRemoveLastDeallocForFuncRes( supreg: tsuperregister);
  1944. var
  1945. hp2: tai;
  1946. begin
  1947. hp2 := p;
  1948. repeat
  1949. hp2 := tai(hp2.previous);
  1950. if assigned(hp2) and
  1951. (hp2.typ = ait_regalloc) and
  1952. (tai_regalloc(hp2).ratype=ra_dealloc) and
  1953. (getregtype(tai_regalloc(hp2).reg) = R_INTREGISTER) and
  1954. (getsupreg(tai_regalloc(hp2).reg) = supreg) then
  1955. begin
  1956. RemoveInstruction(hp2);
  1957. break;
  1958. end;
  1959. until not(assigned(hp2)) or regInInstruction(newreg(R_INTREGISTER,supreg,R_SUBWHOLE),hp2);
  1960. end;
  1961. begin
  1962. case current_procinfo.procdef.returndef.typ of
  1963. arraydef,recorddef,pointerdef,
  1964. stringdef,enumdef,procdef,objectdef,errordef,
  1965. filedef,setdef,procvardef,
  1966. classrefdef,forwarddef:
  1967. DoRemoveLastDeallocForFuncRes(RS_EAX);
  1968. orddef:
  1969. if current_procinfo.procdef.returndef.size <> 0 then
  1970. begin
  1971. DoRemoveLastDeallocForFuncRes(RS_EAX);
  1972. { for int64/qword }
  1973. if current_procinfo.procdef.returndef.size = 8 then
  1974. DoRemoveLastDeallocForFuncRes(RS_EDX);
  1975. end;
  1976. else
  1977. ;
  1978. end;
  1979. end;
  1980. function TX86AsmOptimizer.OptPass1_V_MOVAP(var p : tai) : boolean;
  1981. var
  1982. hp1,hp2 : tai;
  1983. begin
  1984. result:=false;
  1985. if MatchOpType(taicpu(p),top_reg,top_reg) then
  1986. begin
  1987. { vmova* reg1,reg1
  1988. =>
  1989. <nop> }
  1990. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) then
  1991. begin
  1992. RemoveCurrentP(p);
  1993. result:=true;
  1994. exit;
  1995. end
  1996. else if GetNextInstruction(p,hp1) then
  1997. begin
  1998. if MatchInstruction(hp1,[taicpu(p).opcode],[S_NO]) and
  1999. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) then
  2000. begin
  2001. { vmova* reg1,reg2
  2002. vmova* reg2,reg3
  2003. dealloc reg2
  2004. =>
  2005. vmova* reg1,reg3 }
  2006. TransferUsedRegs(TmpUsedRegs);
  2007. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2008. if MatchOpType(taicpu(hp1),top_reg,top_reg) and
  2009. not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  2010. begin
  2011. DebugMsg(SPeepholeOptimization + '(V)MOVA*(V)MOVA*2(V)MOVA* 1',p);
  2012. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  2013. RemoveInstruction(hp1);
  2014. result:=true;
  2015. exit;
  2016. end
  2017. { special case:
  2018. vmova* reg1,<op>
  2019. vmova* <op>,reg1
  2020. =>
  2021. vmova* reg1,<op> }
  2022. else if MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[1]^) and
  2023. ((taicpu(p).oper[0]^.typ<>top_ref) or
  2024. (not(vol_read in taicpu(p).oper[0]^.ref^.volatility))
  2025. ) then
  2026. begin
  2027. DebugMsg(SPeepholeOptimization + '(V)MOVA*(V)MOVA*2(V)MOVA* 2',p);
  2028. RemoveInstruction(hp1);
  2029. result:=true;
  2030. exit;
  2031. end
  2032. end
  2033. else if ((MatchInstruction(p,[A_MOVAPS,A_VMOVAPS],[S_NO]) and
  2034. MatchInstruction(hp1,[A_MOVSS,A_VMOVSS],[S_NO])) or
  2035. ((MatchInstruction(p,[A_MOVAPD,A_VMOVAPD],[S_NO]) and
  2036. MatchInstruction(hp1,[A_MOVSD,A_VMOVSD],[S_NO])))
  2037. ) and
  2038. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) then
  2039. begin
  2040. { vmova* reg1,reg2
  2041. vmovs* reg2,<op>
  2042. dealloc reg2
  2043. =>
  2044. vmovs* reg1,reg3 }
  2045. TransferUsedRegs(TmpUsedRegs);
  2046. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2047. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  2048. begin
  2049. DebugMsg(SPeepholeOptimization + '(V)MOVA*(V)MOVS*2(V)MOVS* 1',p);
  2050. taicpu(p).opcode:=taicpu(hp1).opcode;
  2051. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  2052. RemoveInstruction(hp1);
  2053. result:=true;
  2054. exit;
  2055. end
  2056. end;
  2057. end;
  2058. if GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg) then
  2059. begin
  2060. if MatchInstruction(hp1,[A_VFMADDPD,
  2061. A_VFMADD132PD,
  2062. A_VFMADD132PS,
  2063. A_VFMADD132SD,
  2064. A_VFMADD132SS,
  2065. A_VFMADD213PD,
  2066. A_VFMADD213PS,
  2067. A_VFMADD213SD,
  2068. A_VFMADD213SS,
  2069. A_VFMADD231PD,
  2070. A_VFMADD231PS,
  2071. A_VFMADD231SD,
  2072. A_VFMADD231SS,
  2073. A_VFMADDSUB132PD,
  2074. A_VFMADDSUB132PS,
  2075. A_VFMADDSUB213PD,
  2076. A_VFMADDSUB213PS,
  2077. A_VFMADDSUB231PD,
  2078. A_VFMADDSUB231PS,
  2079. A_VFMSUB132PD,
  2080. A_VFMSUB132PS,
  2081. A_VFMSUB132SD,
  2082. A_VFMSUB132SS,
  2083. A_VFMSUB213PD,
  2084. A_VFMSUB213PS,
  2085. A_VFMSUB213SD,
  2086. A_VFMSUB213SS,
  2087. A_VFMSUB231PD,
  2088. A_VFMSUB231PS,
  2089. A_VFMSUB231SD,
  2090. A_VFMSUB231SS,
  2091. A_VFMSUBADD132PD,
  2092. A_VFMSUBADD132PS,
  2093. A_VFMSUBADD213PD,
  2094. A_VFMSUBADD213PS,
  2095. A_VFMSUBADD231PD,
  2096. A_VFMSUBADD231PS,
  2097. A_VFNMADD132PD,
  2098. A_VFNMADD132PS,
  2099. A_VFNMADD132SD,
  2100. A_VFNMADD132SS,
  2101. A_VFNMADD213PD,
  2102. A_VFNMADD213PS,
  2103. A_VFNMADD213SD,
  2104. A_VFNMADD213SS,
  2105. A_VFNMADD231PD,
  2106. A_VFNMADD231PS,
  2107. A_VFNMADD231SD,
  2108. A_VFNMADD231SS,
  2109. A_VFNMSUB132PD,
  2110. A_VFNMSUB132PS,
  2111. A_VFNMSUB132SD,
  2112. A_VFNMSUB132SS,
  2113. A_VFNMSUB213PD,
  2114. A_VFNMSUB213PS,
  2115. A_VFNMSUB213SD,
  2116. A_VFNMSUB213SS,
  2117. A_VFNMSUB231PD,
  2118. A_VFNMSUB231PS,
  2119. A_VFNMSUB231SD,
  2120. A_VFNMSUB231SS],[S_NO]) and
  2121. { we mix single and double opperations here because we assume that the compiler
  2122. generates vmovapd only after double operations and vmovaps only after single operations }
  2123. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[2]^) and
  2124. GetNextInstruction(hp1,hp2) and
  2125. MatchInstruction(hp2,[A_VMOVAPD,A_VMOVAPS,A_MOVAPD,A_MOVAPS],[S_NO]) and
  2126. MatchOperand(taicpu(p).oper[0]^,taicpu(hp2).oper[1]^) then
  2127. begin
  2128. TransferUsedRegs(TmpUsedRegs);
  2129. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2130. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  2131. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs)) then
  2132. begin
  2133. taicpu(hp1).loadoper(2,taicpu(p).oper[0]^);
  2134. RemoveCurrentP(p);
  2135. RemoveInstruction(hp2);
  2136. end;
  2137. end
  2138. else if (hp1.typ = ait_instruction) and
  2139. GetNextInstruction(hp1, hp2) and
  2140. MatchInstruction(hp2,taicpu(p).opcode,[]) and
  2141. OpsEqual(taicpu(hp2).oper[1]^, taicpu(p).oper[0]^) and
  2142. MatchOpType(taicpu(hp2),top_reg,top_reg) and
  2143. MatchOperand(taicpu(hp2).oper[0]^,taicpu(p).oper[1]^) and
  2144. (((taicpu(p).opcode=A_MOVAPS) and
  2145. ((taicpu(hp1).opcode=A_ADDSS) or (taicpu(hp1).opcode=A_SUBSS) or
  2146. (taicpu(hp1).opcode=A_MULSS) or (taicpu(hp1).opcode=A_DIVSS))) or
  2147. ((taicpu(p).opcode=A_MOVAPD) and
  2148. ((taicpu(hp1).opcode=A_ADDSD) or (taicpu(hp1).opcode=A_SUBSD) or
  2149. (taicpu(hp1).opcode=A_MULSD) or (taicpu(hp1).opcode=A_DIVSD)))
  2150. ) then
  2151. { change
  2152. movapX reg,reg2
  2153. addsX/subsX/... reg3, reg2
  2154. movapX reg2,reg
  2155. to
  2156. addsX/subsX/... reg3,reg
  2157. }
  2158. begin
  2159. TransferUsedRegs(TmpUsedRegs);
  2160. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2161. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  2162. If not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs)) then
  2163. begin
  2164. DebugMsg(SPeepholeOptimization + 'MovapXOpMovapX2Op ('+
  2165. debug_op2str(taicpu(p).opcode)+' '+
  2166. debug_op2str(taicpu(hp1).opcode)+' '+
  2167. debug_op2str(taicpu(hp2).opcode)+') done',p);
  2168. { we cannot eliminate the first move if
  2169. the operations uses the same register for source and dest }
  2170. if not(OpsEqual(taicpu(hp1).oper[1]^,taicpu(hp1).oper[0]^)) then
  2171. { Remember that hp1 is not necessarily the immediate
  2172. next instruction }
  2173. RemoveCurrentP(p);
  2174. taicpu(hp1).loadoper(1, taicpu(hp2).oper[1]^);
  2175. RemoveInstruction(hp2);
  2176. result:=true;
  2177. end;
  2178. end
  2179. else if (hp1.typ = ait_instruction) and
  2180. (((taicpu(p).opcode=A_VMOVAPD) and
  2181. (taicpu(hp1).opcode=A_VCOMISD)) or
  2182. ((taicpu(p).opcode=A_VMOVAPS) and
  2183. ((taicpu(hp1).opcode=A_VCOMISS))
  2184. )
  2185. ) and not(OpsEqual(taicpu(hp1).oper[1]^,taicpu(hp1).oper[0]^)) then
  2186. { change
  2187. movapX reg,reg1
  2188. vcomisX reg1,reg1
  2189. to
  2190. vcomisX reg,reg
  2191. }
  2192. begin
  2193. TransferUsedRegs(TmpUsedRegs);
  2194. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2195. If not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  2196. begin
  2197. DebugMsg(SPeepholeOptimization + 'MovapXComisX2ComisX2 ('+
  2198. debug_op2str(taicpu(p).opcode)+' '+
  2199. debug_op2str(taicpu(hp1).opcode)+') done',p);
  2200. if OpsEqual(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) then
  2201. taicpu(hp1).loadoper(0, taicpu(p).oper[0]^);
  2202. if OpsEqual(taicpu(p).oper[1]^,taicpu(hp1).oper[1]^) then
  2203. taicpu(hp1).loadoper(1, taicpu(p).oper[0]^);
  2204. RemoveCurrentP(p);
  2205. result:=true;
  2206. exit;
  2207. end;
  2208. end
  2209. end;
  2210. end;
  2211. end;
  2212. function TX86AsmOptimizer.OptPass1VOP(var p : tai) : boolean;
  2213. var
  2214. hp1 : tai;
  2215. begin
  2216. result:=false;
  2217. { replace
  2218. V<Op>X %mreg1,%mreg2,%mreg3
  2219. VMovX %mreg3,%mreg4
  2220. dealloc %mreg3
  2221. by
  2222. V<Op>X %mreg1,%mreg2,%mreg4
  2223. ?
  2224. }
  2225. if GetNextInstruction(p,hp1) and
  2226. { we mix single and double operations here because we assume that the compiler
  2227. generates vmovapd only after double operations and vmovaps only after single operations }
  2228. MatchInstruction(hp1,A_VMOVAPD,A_VMOVAPS,[S_NO]) and
  2229. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  2230. (taicpu(hp1).oper[1]^.typ=top_reg) then
  2231. begin
  2232. TransferUsedRegs(TmpUsedRegs);
  2233. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2234. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  2235. begin
  2236. taicpu(p).loadoper(2,taicpu(hp1).oper[1]^);
  2237. DebugMsg(SPeepholeOptimization + 'VOpVmov2VOp done',p);
  2238. RemoveInstruction(hp1);
  2239. result:=true;
  2240. end;
  2241. end;
  2242. end;
  2243. { Replaces all references to AOldReg in a memory reference to ANewReg }
  2244. class function TX86AsmOptimizer.ReplaceRegisterInRef(var ref: TReference; const AOldReg, ANewReg: TRegister): Boolean;
  2245. begin
  2246. Result := False;
  2247. { For safety reasons, only check for exact register matches }
  2248. { Check base register }
  2249. if (ref.base = AOldReg) then
  2250. begin
  2251. ref.base := ANewReg;
  2252. Result := True;
  2253. end;
  2254. { Check index register }
  2255. if (ref.index = AOldReg) then
  2256. begin
  2257. ref.index := ANewReg;
  2258. Result := True;
  2259. end;
  2260. end;
  2261. { Replaces all references to AOldReg in an operand to ANewReg }
  2262. class function TX86AsmOptimizer.ReplaceRegisterInOper(const p: taicpu; const OperIdx: Integer; const AOldReg, ANewReg: TRegister): Boolean;
  2263. var
  2264. OldSupReg, NewSupReg: TSuperRegister;
  2265. OldSubReg, NewSubReg: TSubRegister;
  2266. OldRegType: TRegisterType;
  2267. ThisOper: POper;
  2268. begin
  2269. ThisOper := p.oper[OperIdx]; { Faster to access overall }
  2270. Result := False;
  2271. if (AOldReg = NR_NO) or (ANewReg = NR_NO) then
  2272. InternalError(2020011801);
  2273. OldSupReg := getsupreg(AOldReg);
  2274. OldSubReg := getsubreg(AOldReg);
  2275. OldRegType := getregtype(AOldReg);
  2276. NewSupReg := getsupreg(ANewReg);
  2277. NewSubReg := getsubreg(ANewReg);
  2278. if OldRegType <> getregtype(ANewReg) then
  2279. InternalError(2020011802);
  2280. if OldSubReg <> NewSubReg then
  2281. InternalError(2020011803);
  2282. case ThisOper^.typ of
  2283. top_reg:
  2284. if (
  2285. (ThisOper^.reg = AOldReg) or
  2286. (
  2287. (OldRegType = R_INTREGISTER) and
  2288. (getsupreg(ThisOper^.reg) = OldSupReg) and
  2289. (getregtype(ThisOper^.reg) = R_INTREGISTER) and
  2290. (
  2291. (getsubreg(ThisOper^.reg) <= OldSubReg)
  2292. {$ifndef x86_64}
  2293. and (
  2294. { Under i386 and i8086, ESI, EDI, EBP and ESP
  2295. don't have an 8-bit representation }
  2296. (getsubreg(ThisOper^.reg) >= R_SUBW) or
  2297. not (NewSupReg in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  2298. )
  2299. {$endif x86_64}
  2300. )
  2301. )
  2302. ) then
  2303. begin
  2304. ThisOper^.reg := newreg(getregtype(ANewReg), NewSupReg, getsubreg(p.oper[OperIdx]^.reg));
  2305. Result := True;
  2306. end;
  2307. top_ref:
  2308. if ReplaceRegisterInRef(ThisOper^.ref^, AOldReg, ANewReg) then
  2309. Result := True;
  2310. else
  2311. ;
  2312. end;
  2313. end;
  2314. { Replaces all references to AOldReg in an instruction to ANewReg }
  2315. class function TX86AsmOptimizer.ReplaceRegisterInInstruction(const p: taicpu; const AOldReg, ANewReg: TRegister): Boolean;
  2316. const
  2317. ReadFlag: array[0..3] of TInsChange = (Ch_Rop1, Ch_Rop2, Ch_Rop3, Ch_Rop4);
  2318. var
  2319. OperIdx: Integer;
  2320. begin
  2321. Result := False;
  2322. for OperIdx := 0 to p.ops - 1 do
  2323. if (ReadFlag[OperIdx] in InsProp[p.Opcode].Ch) then
  2324. begin
  2325. { The shift and rotate instructions can only use CL }
  2326. if not (
  2327. (OperIdx = 0) and
  2328. { This second condition just helps to avoid unnecessarily
  2329. calling MatchInstruction for 10 different opcodes }
  2330. (p.oper[0]^.reg = NR_CL) and
  2331. MatchInstruction(p, [A_RCL, A_RCR, A_ROL, A_ROR, A_SAL, A_SAR, A_SHL, A_SHLD, A_SHR, A_SHRD], [])
  2332. ) then
  2333. Result := ReplaceRegisterInOper(p, OperIdx, AOldReg, ANewReg) or Result;
  2334. end
  2335. else if p.oper[OperIdx]^.typ = top_ref then
  2336. { It's okay to replace registers in references that get written to }
  2337. Result := ReplaceRegisterInOper(p, OperIdx, AOldReg, ANewReg) or Result;
  2338. end;
  2339. class function TX86AsmOptimizer.IsRefSafe(const ref: PReference): Boolean;
  2340. begin
  2341. Result :=
  2342. (ref^.index = NR_NO) and
  2343. (
  2344. {$ifdef x86_64}
  2345. (
  2346. (ref^.base = NR_RIP) and
  2347. (ref^.refaddr in [addr_pic, addr_pic_no_got])
  2348. ) or
  2349. {$endif x86_64}
  2350. (ref^.refaddr = addr_full) or
  2351. (ref^.base = NR_STACK_POINTER_REG) or
  2352. (ref^.base = current_procinfo.framepointer)
  2353. );
  2354. end;
  2355. function TX86AsmOptimizer.ConvertLEA(const p: taicpu): Boolean;
  2356. var
  2357. l: asizeint;
  2358. begin
  2359. Result := False;
  2360. { Should have been checked previously }
  2361. if p.opcode <> A_LEA then
  2362. InternalError(2020072501);
  2363. { do not mess with the stack point as adjusting it by lea is recommend, except if we optimize for size }
  2364. if (p.oper[1]^.reg=NR_STACK_POINTER_REG) and
  2365. not(cs_opt_size in current_settings.optimizerswitches) then
  2366. exit;
  2367. with p.oper[0]^.ref^ do
  2368. begin
  2369. if (base <> p.oper[1]^.reg) or
  2370. (index <> NR_NO) or
  2371. assigned(symbol) then
  2372. exit;
  2373. l:=offset;
  2374. if (l=1) and UseIncDec then
  2375. begin
  2376. p.opcode:=A_INC;
  2377. p.loadreg(0,p.oper[1]^.reg);
  2378. p.ops:=1;
  2379. DebugMsg(SPeepholeOptimization + 'Lea2Inc done',p);
  2380. end
  2381. else if (l=-1) and UseIncDec then
  2382. begin
  2383. p.opcode:=A_DEC;
  2384. p.loadreg(0,p.oper[1]^.reg);
  2385. p.ops:=1;
  2386. DebugMsg(SPeepholeOptimization + 'Lea2Dec done',p);
  2387. end
  2388. else
  2389. begin
  2390. if (l<0) and (l<>-2147483648) then
  2391. begin
  2392. p.opcode:=A_SUB;
  2393. p.loadConst(0,-l);
  2394. DebugMsg(SPeepholeOptimization + 'Lea2Sub done',p);
  2395. end
  2396. else
  2397. begin
  2398. p.opcode:=A_ADD;
  2399. p.loadConst(0,l);
  2400. DebugMsg(SPeepholeOptimization + 'Lea2Add done',p);
  2401. end;
  2402. end;
  2403. end;
  2404. Result := True;
  2405. end;
  2406. function TX86AsmOptimizer.DeepMOVOpt(const p_mov: taicpu; const hp: taicpu): Boolean;
  2407. var
  2408. CurrentReg, ReplaceReg: TRegister;
  2409. begin
  2410. Result := False;
  2411. ReplaceReg := taicpu(p_mov).oper[0]^.reg;
  2412. CurrentReg := taicpu(p_mov).oper[1]^.reg;
  2413. case hp.opcode of
  2414. A_FSTSW, A_FNSTSW,
  2415. A_IN, A_INS, A_OUT, A_OUTS,
  2416. A_CMPS, A_LODS, A_MOVS, A_SCAS, A_STOS:
  2417. { These routines have explicit operands, but they are restricted in
  2418. what they can be (e.g. IN and OUT can only read from AL, AX or
  2419. EAX. }
  2420. Exit;
  2421. A_IMUL:
  2422. begin
  2423. { The 1-operand version writes to implicit registers
  2424. The 2-operand version reads from the first operator, and reads
  2425. from and writes to the second (equivalent to Ch_ROp1, ChRWOp2).
  2426. the 3-operand version reads from a register that it doesn't write to
  2427. }
  2428. case hp.ops of
  2429. 1:
  2430. if (
  2431. (
  2432. (hp.opsize = S_B) and (getsupreg(CurrentReg) <> RS_EAX)
  2433. ) or
  2434. not (getsupreg(CurrentReg) in [RS_EAX, RS_EDX])
  2435. ) and ReplaceRegisterInOper(hp, 0, CurrentReg, ReplaceReg) then
  2436. begin
  2437. Result := True;
  2438. DebugMsg(SPeepholeOptimization + debug_regname(CurrentReg) + ' = ' + debug_regname(ReplaceReg) + '; changed to minimise pipeline stall (MovIMul2MovIMul 1)', hp);
  2439. AllocRegBetween(ReplaceReg, p_mov, hp, UsedRegs);
  2440. end;
  2441. 2:
  2442. { Only modify the first parameter }
  2443. if ReplaceRegisterInOper(hp, 0, CurrentReg, ReplaceReg) then
  2444. begin
  2445. Result := True;
  2446. DebugMsg(SPeepholeOptimization + debug_regname(CurrentReg) + ' = ' + debug_regname(ReplaceReg) + '; changed to minimise pipeline stall (MovIMul2MovIMul 2)', hp);
  2447. AllocRegBetween(ReplaceReg, p_mov, hp, UsedRegs);
  2448. end;
  2449. 3:
  2450. { Only modify the second parameter }
  2451. if ReplaceRegisterInOper(hp, 1, CurrentReg, ReplaceReg) then
  2452. begin
  2453. Result := True;
  2454. DebugMsg(SPeepholeOptimization + debug_regname(CurrentReg) + ' = ' + debug_regname(ReplaceReg) + '; changed to minimise pipeline stall (MovIMul2MovIMul 3)', hp);
  2455. AllocRegBetween(ReplaceReg, p_mov, hp, UsedRegs);
  2456. end;
  2457. else
  2458. InternalError(2020012901);
  2459. end;
  2460. end;
  2461. else
  2462. if (hp.ops > 0) and
  2463. ReplaceRegisterInInstruction(hp, CurrentReg, ReplaceReg) then
  2464. begin
  2465. Result := True;
  2466. DebugMsg(SPeepholeOptimization + debug_regname(CurrentReg) + ' = ' + debug_regname(ReplaceReg) + '; changed to minimise pipeline stall (MovXXX2MovXXX)', hp);
  2467. AllocRegBetween(ReplaceReg, p_mov, hp, UsedRegs);
  2468. end;
  2469. end;
  2470. end;
  2471. function TX86AsmOptimizer.FuncMov2Func(var p: tai; const hp1: tai): Boolean;
  2472. var
  2473. hp2: tai;
  2474. p_SourceReg, p_TargetReg: TRegister;
  2475. begin
  2476. Result := False;
  2477. { Backward optimisation. If we have:
  2478. func. %reg1,%reg2
  2479. mov %reg2,%reg3
  2480. (dealloc %reg2)
  2481. Change to:
  2482. func. %reg1,%reg3 (see comment below for what a valid func. is)
  2483. Perform similar optimisations with 1, 3 and 4-operand instructions
  2484. that only have one output.
  2485. }
  2486. if MatchOpType(taicpu(p), top_reg, top_reg) then
  2487. begin
  2488. p_SourceReg := taicpu(p).oper[0]^.reg;
  2489. p_TargetReg := taicpu(p).oper[1]^.reg;
  2490. TransferUsedRegs(TmpUsedRegs);
  2491. if not RegUsedAfterInstruction(p_SourceReg, p, TmpUsedRegs) and
  2492. GetLastInstruction(p, hp2) and
  2493. (hp2.typ = ait_instruction) and
  2494. { Have to make sure it's an instruction that only reads from
  2495. the first operands and only writes (not reads or modifies) to
  2496. the last one; in essence, a pure function such as BSR, POPCNT
  2497. or ANDN }
  2498. (
  2499. (
  2500. (taicpu(hp2).ops = 1) and
  2501. (insprop[taicpu(hp2).opcode].Ch * [Ch_Wop1] = [Ch_Wop1])
  2502. ) or
  2503. (
  2504. (taicpu(hp2).ops = 2) and
  2505. (insprop[taicpu(hp2).opcode].Ch * [Ch_Rop1, Ch_Wop2] = [Ch_Rop1, Ch_Wop2])
  2506. ) or
  2507. (
  2508. (taicpu(hp2).ops = 3) and
  2509. (insprop[taicpu(hp2).opcode].Ch * [Ch_Rop1, Ch_Rop2, Ch_Wop3] = [Ch_Rop1, Ch_Rop2, Ch_Wop3])
  2510. ) or
  2511. (
  2512. (taicpu(hp2).ops = 4) and
  2513. (insprop[taicpu(hp2).opcode].Ch * [Ch_Rop1, Ch_Rop2, Ch_Rop3, Ch_Wop4] = [Ch_Rop1, Ch_Rop2, Ch_Rop3, Ch_Wop4])
  2514. )
  2515. ) and
  2516. (taicpu(hp2).oper[taicpu(hp2).ops-1]^.typ = top_reg) and
  2517. (taicpu(hp2).oper[taicpu(hp2).ops-1]^.reg = p_SourceReg) then
  2518. begin
  2519. case taicpu(hp2).opcode of
  2520. A_FSTSW, A_FNSTSW,
  2521. A_IN, A_INS, A_OUT, A_OUTS,
  2522. A_CMPS, A_LODS, A_MOVS, A_SCAS, A_STOS:
  2523. { These routines have explicit operands, but they are restricted in
  2524. what they can be (e.g. IN and OUT can only read from AL, AX or
  2525. EAX. }
  2526. ;
  2527. else
  2528. begin
  2529. DebugMsg(SPeepholeOptimization + 'Removed MOV and changed destination on previous instruction to optimise register usage (FuncMov2Func)', p);
  2530. taicpu(hp2).oper[taicpu(hp2).ops-1]^.reg := p_TargetReg;
  2531. if not RegInInstruction(p_TargetReg, hp2) then
  2532. begin
  2533. { Since we're allocating from an earlier point, we
  2534. need to remove the register from the tracking }
  2535. ExcludeRegFromUsedRegs(p_TargetReg, TmpUsedRegs);
  2536. AllocRegBetween(p_TargetReg, hp2, p, TmpUsedRegs);
  2537. end;
  2538. RemoveCurrentp(p, hp1);
  2539. { If the Func was another MOV instruction, we might get
  2540. "mov %reg,%reg" that doesn't get removed in Pass 2
  2541. otherwise, so deal with it here (also do something
  2542. similar with lea (%reg),%reg}
  2543. if (taicpu(hp2).opcode = A_MOV) and MatchOperand(taicpu(hp2).oper[0]^, taicpu(hp2).oper[1]^.reg) then
  2544. begin
  2545. DebugMsg(SPeepholeOptimization + 'Mov2Nop 1a done', hp2);
  2546. if p = hp2 then
  2547. RemoveCurrentp(p)
  2548. else
  2549. RemoveInstruction(hp2);
  2550. end;
  2551. Result := True;
  2552. Exit;
  2553. end;
  2554. end;
  2555. end;
  2556. end;
  2557. end;
  2558. function TX86AsmOptimizer.OptPass1MOV(var p : tai) : boolean;
  2559. var
  2560. hp1, hp2, hp3: tai;
  2561. DoOptimisation, TempBool: Boolean;
  2562. {$ifdef x86_64}
  2563. NewConst: TCGInt;
  2564. {$endif x86_64}
  2565. procedure convert_mov_value(signed_movop: tasmop; max_value: tcgint); inline;
  2566. begin
  2567. if taicpu(hp1).opcode = signed_movop then
  2568. begin
  2569. if taicpu(p).oper[0]^.val > max_value shr 1 then
  2570. taicpu(p).oper[0]^.val:=taicpu(p).oper[0]^.val - max_value - 1 { Convert to signed }
  2571. end
  2572. else
  2573. taicpu(p).oper[0]^.val:=taicpu(p).oper[0]^.val and max_value; { Trim to unsigned }
  2574. end;
  2575. function TryConstMerge(var p1, p2: tai): Boolean;
  2576. var
  2577. ThisRef: TReference;
  2578. begin
  2579. Result := False;
  2580. ThisRef := taicpu(p2).oper[1]^.ref^;
  2581. { Only permit writes to the stack, since we can guarantee alignment with that }
  2582. if (ThisRef.index = NR_NO) and
  2583. (
  2584. (ThisRef.base = NR_STACK_POINTER_REG) or
  2585. (ThisRef.base = current_procinfo.framepointer)
  2586. ) then
  2587. begin
  2588. case taicpu(p).opsize of
  2589. S_B:
  2590. begin
  2591. { Word writes must be on a 2-byte boundary }
  2592. if (taicpu(p1).oper[1]^.ref^.offset mod 2) = 0 then
  2593. begin
  2594. { Reduce offset of second reference to see if it is sequential with the first }
  2595. Dec(ThisRef.offset, 1);
  2596. if RefsEqual(taicpu(p1).oper[1]^.ref^, ThisRef) then
  2597. begin
  2598. { Make sure the constants aren't represented as a
  2599. negative number, as these won't merge properly }
  2600. taicpu(p1).opsize := S_W;
  2601. taicpu(p1).oper[0]^.val := (taicpu(p1).oper[0]^.val and $FF) or ((taicpu(p2).oper[0]^.val and $FF) shl 8);
  2602. DebugMsg(SPeepholeOptimization + 'Merged two byte-sized constant writes to stack (MovMov2Mov 2a)', p1);
  2603. RemoveInstruction(p2);
  2604. Result := True;
  2605. end;
  2606. end;
  2607. end;
  2608. S_W:
  2609. begin
  2610. { Longword writes must be on a 4-byte boundary }
  2611. if (taicpu(p1).oper[1]^.ref^.offset mod 4) = 0 then
  2612. begin
  2613. { Reduce offset of second reference to see if it is sequential with the first }
  2614. Dec(ThisRef.offset, 2);
  2615. if RefsEqual(taicpu(p1).oper[1]^.ref^, ThisRef) then
  2616. begin
  2617. { Make sure the constants aren't represented as a
  2618. negative number, as these won't merge properly }
  2619. taicpu(p1).opsize := S_L;
  2620. taicpu(p1).oper[0]^.val := (taicpu(p1).oper[0]^.val and $FFFF) or ((taicpu(p2).oper[0]^.val and $FFFF) shl 16);
  2621. DebugMsg(SPeepholeOptimization + 'Merged two word-sized constant writes to stack (MovMov2Mov 2b)', p1);
  2622. RemoveInstruction(p2);
  2623. Result := True;
  2624. end;
  2625. end;
  2626. end;
  2627. {$ifdef x86_64}
  2628. S_L:
  2629. begin
  2630. { Only sign-extended 32-bit constants can be written to 64-bit memory directly, so check to
  2631. see if the constants can be encoded this way. }
  2632. NewConst := (taicpu(p1).oper[0]^.val and $FFFFFFFF) or (taicpu(p2).oper[0]^.val shl 32);
  2633. if (NewConst >= -2147483648) and (NewConst <= 2147483647) and
  2634. { Quadword writes must be on an 8-byte boundary }
  2635. ((taicpu(p1).oper[1]^.ref^.offset mod 8) = 0) then
  2636. begin
  2637. { Reduce offset of second reference to see if it is sequential with the first }
  2638. Dec(ThisRef.offset, 4);
  2639. if RefsEqual(taicpu(p1).oper[1]^.ref^, ThisRef) then
  2640. begin
  2641. { Make sure the constants aren't represented as a
  2642. negative number, as these won't merge properly }
  2643. taicpu(p1).opsize := S_Q;
  2644. { Force a typecast into a 32-bit signed integer (that will then be sign-extended to 64-bit) }
  2645. taicpu(p1).oper[0]^.val := NewConst;
  2646. DebugMsg(SPeepholeOptimization + 'Merged two longword-sized constant writes to stack (MovMov2Mov 2c)', p1);
  2647. RemoveInstruction(p2);
  2648. Result := True;
  2649. end;
  2650. end;
  2651. end;
  2652. {$endif x86_64}
  2653. else
  2654. ;
  2655. end;
  2656. end;
  2657. end;
  2658. var
  2659. GetNextInstruction_p, TempRegUsed, CrossJump: Boolean;
  2660. PreMessage, RegName1, RegName2, InputVal, MaskNum: string;
  2661. NewSize: topsize; NewOffset: asizeint;
  2662. p_SourceReg, p_TargetReg, NewMMReg: TRegister;
  2663. SourceRef, TargetRef: TReference;
  2664. MovAligned, MovUnaligned: TAsmOp;
  2665. ThisRef: TReference;
  2666. JumpTracking: TLinkedList;
  2667. begin
  2668. Result:=false;
  2669. GetNextInstruction_p:=GetNextInstruction(p, hp1);
  2670. { remove mov reg1,reg1? }
  2671. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^)
  2672. then
  2673. begin
  2674. DebugMsg(SPeepholeOptimization + 'Mov2Nop 1 done',p);
  2675. { take care of the register (de)allocs following p }
  2676. RemoveCurrentP(p, hp1);
  2677. Result:=true;
  2678. exit;
  2679. end;
  2680. { All the next optimisations require a next instruction }
  2681. if not GetNextInstruction_p or (hp1.typ <> ait_instruction) then
  2682. Exit;
  2683. { Prevent compiler warnings }
  2684. p_TargetReg := NR_NO;
  2685. if taicpu(p).oper[1]^.typ = top_reg then
  2686. begin
  2687. { Saves on a large number of dereferences }
  2688. p_TargetReg := taicpu(p).oper[1]^.reg;
  2689. { Look for:
  2690. mov %reg1,%reg2
  2691. ??? %reg2,r/m
  2692. Change to:
  2693. mov %reg1,%reg2
  2694. ??? %reg1,r/m
  2695. }
  2696. if taicpu(p).oper[0]^.typ = top_reg then
  2697. begin
  2698. if RegReadByInstruction(p_TargetReg, hp1) and
  2699. DeepMOVOpt(taicpu(p), taicpu(hp1)) then
  2700. begin
  2701. { A change has occurred, just not in p }
  2702. Result := True;
  2703. TransferUsedRegs(TmpUsedRegs);
  2704. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  2705. if not RegUsedAfterInstruction(p_TargetReg, hp1, TmpUsedRegs) and
  2706. { Just in case something didn't get modified (e.g. an
  2707. implicit register) }
  2708. not RegReadByInstruction(p_TargetReg, hp1) then
  2709. begin
  2710. { We can remove the original MOV }
  2711. DebugMsg(SPeepholeOptimization + 'Mov2Nop 3 done',p);
  2712. RemoveCurrentp(p, hp1);
  2713. { UsedRegs got updated by RemoveCurrentp }
  2714. Result := True;
  2715. Exit;
  2716. end;
  2717. { If we know a MOV instruction has become a null operation, we might as well
  2718. get rid of it now to save time. }
  2719. if (taicpu(hp1).opcode = A_MOV) and
  2720. (taicpu(hp1).oper[1]^.typ = top_reg) and
  2721. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[0]^.reg) and
  2722. { Just being a register is enough to confirm it's a null operation }
  2723. (taicpu(hp1).oper[0]^.typ = top_reg) then
  2724. begin
  2725. Result := True;
  2726. { Speed-up to reduce a pipeline stall... if we had something like...
  2727. movl %eax,%edx
  2728. movw %dx,%ax
  2729. ... the second instruction would change to movw %ax,%ax, but
  2730. given that it is now %ax that's active rather than %eax,
  2731. penalties might occur due to a partial register write, so instead,
  2732. change it to a MOVZX instruction when optimising for speed.
  2733. }
  2734. if not (cs_opt_size in current_settings.optimizerswitches) and
  2735. IsMOVZXAcceptable and
  2736. (taicpu(hp1).opsize < taicpu(p).opsize)
  2737. {$ifdef x86_64}
  2738. { operations already implicitly set the upper 64 bits to zero }
  2739. and not ((taicpu(hp1).opsize = S_L) and (taicpu(p).opsize = S_Q))
  2740. {$endif x86_64}
  2741. then
  2742. begin
  2743. DebugMsg(SPeepholeOptimization + 'Zero-extension to minimise pipeline stall (Mov2Movz)',hp1);
  2744. case taicpu(p).opsize of
  2745. S_W:
  2746. if taicpu(hp1).opsize = S_B then
  2747. taicpu(hp1).opsize := S_BL
  2748. else
  2749. InternalError(2020012911);
  2750. S_L{$ifdef x86_64}, S_Q{$endif x86_64}:
  2751. case taicpu(hp1).opsize of
  2752. S_B:
  2753. taicpu(hp1).opsize := S_BL;
  2754. S_W:
  2755. taicpu(hp1).opsize := S_WL;
  2756. else
  2757. InternalError(2020012912);
  2758. end;
  2759. else
  2760. InternalError(2020012910);
  2761. end;
  2762. taicpu(hp1).opcode := A_MOVZX;
  2763. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  2764. end
  2765. else
  2766. begin
  2767. GetNextInstruction_p := GetNextInstruction(hp1, hp2);
  2768. DebugMsg(SPeepholeOptimization + 'Mov2Nop 4 done',hp1);
  2769. RemoveInstruction(hp1);
  2770. { The instruction after what was hp1 is now the immediate next instruction,
  2771. so we can continue to make optimisations if it's present }
  2772. if not GetNextInstruction_p or (hp2.typ <> ait_instruction) then
  2773. Exit;
  2774. hp1 := hp2;
  2775. end;
  2776. end;
  2777. end;
  2778. end;
  2779. end;
  2780. { Depending on the DeepMOVOpt above, it may turn out that hp1 completely
  2781. overwrites the original destination register. e.g.
  2782. movl ###,%reg2d
  2783. movslq ###,%reg2q (### doesn't have to be the same as the first one)
  2784. In this case, we can remove the MOV (Go to "Mov2Nop 5" below)
  2785. }
  2786. if (taicpu(p).oper[1]^.typ = top_reg) and
  2787. MatchInstruction(hp1, [A_LEA, A_MOV, A_MOVSX, A_MOVZX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}], []) and
  2788. (taicpu(hp1).oper[1]^.typ = top_reg) and
  2789. Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[1]^.reg) then
  2790. begin
  2791. if RegInOp(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^) then
  2792. begin
  2793. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  2794. case taicpu(p).oper[0]^.typ of
  2795. top_const:
  2796. { We have something like:
  2797. movb $x, %regb
  2798. movzbl %regb,%regd
  2799. Change to:
  2800. movl $x, %regd
  2801. }
  2802. begin
  2803. case taicpu(hp1).opsize of
  2804. S_BW:
  2805. begin
  2806. convert_mov_value(A_MOVSX, $FF);
  2807. setsubreg(taicpu(p).oper[1]^.reg, R_SUBW);
  2808. taicpu(p).opsize := S_W;
  2809. end;
  2810. S_BL:
  2811. begin
  2812. convert_mov_value(A_MOVSX, $FF);
  2813. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  2814. taicpu(p).opsize := S_L;
  2815. end;
  2816. S_WL:
  2817. begin
  2818. convert_mov_value(A_MOVSX, $FFFF);
  2819. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  2820. taicpu(p).opsize := S_L;
  2821. end;
  2822. {$ifdef x86_64}
  2823. S_BQ:
  2824. begin
  2825. convert_mov_value(A_MOVSX, $FF);
  2826. setsubreg(taicpu(p).oper[1]^.reg, R_SUBQ);
  2827. taicpu(p).opsize := S_Q;
  2828. end;
  2829. S_WQ:
  2830. begin
  2831. convert_mov_value(A_MOVSX, $FFFF);
  2832. setsubreg(taicpu(p).oper[1]^.reg, R_SUBQ);
  2833. taicpu(p).opsize := S_Q;
  2834. end;
  2835. S_LQ:
  2836. begin
  2837. convert_mov_value(A_MOVSXD, $FFFFFFFF); { Note it's MOVSXD, not MOVSX }
  2838. setsubreg(taicpu(p).oper[1]^.reg, R_SUBQ);
  2839. taicpu(p).opsize := S_Q;
  2840. end;
  2841. {$endif x86_64}
  2842. else
  2843. { If hp1 was a MOV instruction, it should have been
  2844. optimised already }
  2845. InternalError(2020021001);
  2846. end;
  2847. DebugMsg(SPeepholeOptimization + 'MovMovXX2MovXX 2 done',p);
  2848. RemoveInstruction(hp1);
  2849. Result := True;
  2850. Exit;
  2851. end;
  2852. top_ref:
  2853. begin
  2854. { We have something like:
  2855. movb mem, %regb
  2856. movzbl %regb,%regd
  2857. Change to:
  2858. movzbl mem, %regd
  2859. }
  2860. ThisRef := taicpu(p).oper[0]^.ref^;
  2861. if (ThisRef.refaddr<>addr_full) and (IsMOVZXAcceptable or (taicpu(hp1).opcode<>A_MOVZX)) then
  2862. begin
  2863. DebugMsg(SPeepholeOptimization + 'MovMovXX2MovXX 1 done',p);
  2864. taicpu(hp1).loadref(0, ThisRef);
  2865. { Make sure any registers in the references are properly tracked }
  2866. if (ThisRef.base <> NR_NO){$ifdef x86_64} and (ThisRef.base <> NR_RIP){$endif x86_64} then
  2867. AllocRegBetween(ThisRef.base, p, hp1, UsedRegs);
  2868. if (ThisRef.index <> NR_NO) then
  2869. AllocRegBetween(ThisRef.index, p, hp1, UsedRegs);
  2870. RemoveCurrentP(p, hp1);
  2871. Result := True;
  2872. Exit;
  2873. end;
  2874. end;
  2875. else
  2876. if (taicpu(hp1).opcode <> A_MOV) and (taicpu(hp1).opcode <> A_LEA) then
  2877. { Just to make a saving, since there are no more optimisations with MOVZX and MOVSX/D }
  2878. Exit;
  2879. end;
  2880. end
  2881. { The RegInOp check makes sure that movl r/m,%reg1l; movzbl (%reg1l),%reg1l"
  2882. and "movl r/m,%reg1; leal $1(%reg1,%reg2),%reg1" etc. are not incorrectly
  2883. optimised }
  2884. else
  2885. begin
  2886. DebugMsg(SPeepholeOptimization + 'Mov2Nop 5 done',p);
  2887. RemoveCurrentP(p, hp1);
  2888. Result := True;
  2889. Exit;
  2890. end;
  2891. end;
  2892. if (taicpu(hp1).opcode = A_AND) and
  2893. (taicpu(p).oper[1]^.typ = top_reg) and
  2894. MatchOpType(taicpu(hp1),top_const,top_reg) then
  2895. begin
  2896. if MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[1]^) then
  2897. begin
  2898. case taicpu(p).opsize of
  2899. S_L:
  2900. if (taicpu(hp1).oper[0]^.val = $ffffffff) then
  2901. begin
  2902. { Optimize out:
  2903. mov x, %reg
  2904. and ffffffffh, %reg
  2905. }
  2906. DebugMsg(SPeepholeOptimization + 'MovAnd2Mov 1 done',p);
  2907. RemoveInstruction(hp1);
  2908. Result:=true;
  2909. exit;
  2910. end;
  2911. S_Q: { TODO: Confirm if this is even possible }
  2912. if (taicpu(hp1).oper[0]^.val = $ffffffffffffffff) then
  2913. begin
  2914. { Optimize out:
  2915. mov x, %reg
  2916. and ffffffffffffffffh, %reg
  2917. }
  2918. DebugMsg(SPeepholeOptimization + 'MovAnd2Mov 2 done',p);
  2919. RemoveInstruction(hp1);
  2920. Result:=true;
  2921. exit;
  2922. end;
  2923. else
  2924. ;
  2925. end;
  2926. if (
  2927. (taicpu(p).oper[0]^.typ=top_reg) or
  2928. (
  2929. (taicpu(p).oper[0]^.typ=top_ref) and
  2930. (taicpu(p).oper[0]^.ref^.refaddr<>addr_full)
  2931. )
  2932. ) and
  2933. GetNextInstruction(hp1,hp2) and
  2934. MatchInstruction(hp2,A_TEST,[]) and
  2935. (
  2936. MatchOperand(taicpu(hp1).oper[1]^,taicpu(hp2).oper[1]^) or
  2937. (
  2938. { If the register being tested is smaller than the one
  2939. that received a bitwise AND, permit it if the constant
  2940. fits into the smaller size }
  2941. (taicpu(hp1).oper[1]^.typ = top_reg) and (taicpu(hp2).oper[1]^.typ = top_reg) and
  2942. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg,taicpu(hp2).oper[1]^.reg) and
  2943. (taicpu(hp1).oper[0]^.typ = top_const) and (taicpu(hp1).oper[0]^.val >= 0) and
  2944. (GetSubReg(taicpu(hp2).oper[1]^.reg) < GetSubReg(taicpu(hp1).oper[1]^.reg)) and
  2945. (
  2946. (
  2947. (GetSubReg(taicpu(hp2).oper[1]^.reg) = R_SUBL) and
  2948. (taicpu(hp1).oper[0]^.val <= $FF)
  2949. ) or
  2950. (
  2951. (GetSubReg(taicpu(hp2).oper[1]^.reg) = R_SUBW) and
  2952. (taicpu(hp1).oper[0]^.val <= $FFFF)
  2953. {$ifdef x86_64}
  2954. ) or
  2955. (
  2956. (GetSubReg(taicpu(hp2).oper[1]^.reg) = R_SUBD) and
  2957. (taicpu(hp1).oper[0]^.val <= $FFFFFFFF)
  2958. {$endif x86_64}
  2959. )
  2960. )
  2961. )
  2962. ) and
  2963. (
  2964. MatchOperand(taicpu(hp2).oper[0]^,taicpu(hp2).oper[1]^) or
  2965. MatchOperand(taicpu(hp2).oper[0]^,-1)
  2966. ) and
  2967. GetNextInstruction(hp2,hp3) and
  2968. MatchInstruction(hp3,A_Jcc,A_Setcc,[]) and
  2969. (taicpu(hp3).condition in [C_E,C_NE]) then
  2970. begin
  2971. TransferUsedRegs(TmpUsedRegs);
  2972. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  2973. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  2974. if not(RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp2, TmpUsedRegs)) then
  2975. begin
  2976. DebugMsg(SPeepholeOptimization + 'MovAndTest2Test done',p);
  2977. taicpu(hp1).loadoper(1,taicpu(p).oper[0]^);
  2978. taicpu(hp1).opcode:=A_TEST;
  2979. { Shrink the TEST instruction down to the smallest possible size }
  2980. case taicpu(hp1).oper[0]^.val of
  2981. 0..255:
  2982. if (taicpu(hp1).opsize <> S_B)
  2983. {$ifndef x86_64}
  2984. and (
  2985. (taicpu(hp1).oper[1]^.typ <> top_reg) or
  2986. { Cannot encode byte-sized ESI, EDI, EBP or ESP under i386 }
  2987. (GetSupReg(taicpu(hp1).oper[1]^.reg) in [RS_EAX, RS_EBX, RS_ECX, RS_EDX])
  2988. )
  2989. {$endif x86_64}
  2990. then
  2991. begin
  2992. if taicpu(hp1).opsize <> taicpu(hp2).opsize then
  2993. { Only print debug message if the TEST instruction
  2994. is a different size before and after }
  2995. DebugMsg(SPeepholeOptimization + 'test' + debug_opsize2str(taicpu(hp1).opsize) + ' -> testb to reduce instruction size (Test2Test 1a)' , p);
  2996. taicpu(hp1).opsize := S_B;
  2997. if (taicpu(hp1).oper[1]^.typ = top_reg) then
  2998. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBL);
  2999. end;
  3000. 256..65535:
  3001. if (taicpu(hp1).opsize <> S_W) then
  3002. begin
  3003. if taicpu(hp1).opsize <> taicpu(hp2).opsize then
  3004. { Only print debug message if the TEST instruction
  3005. is a different size before and after }
  3006. DebugMsg(SPeepholeOptimization + 'test' + debug_opsize2str(taicpu(hp1).opsize) + ' -> testw to reduce instruction size (Test2Test 1b)' , p);
  3007. taicpu(hp1).opsize := S_W;
  3008. if (taicpu(hp1).oper[1]^.typ = top_reg) then
  3009. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBW);
  3010. end;
  3011. {$ifdef x86_64}
  3012. 65536..$7FFFFFFF:
  3013. if (taicpu(hp1).opsize <> S_L) then
  3014. begin
  3015. if taicpu(hp1).opsize <> taicpu(hp2).opsize then
  3016. { Only print debug message if the TEST instruction
  3017. is a different size before and after }
  3018. DebugMsg(SPeepholeOptimization + 'test' + debug_opsize2str(taicpu(hp1).opsize) + ' -> testl to reduce instruction size (Test2Test 1c)' , p);
  3019. taicpu(hp1).opsize := S_L;
  3020. if (taicpu(hp1).oper[1]^.typ = top_reg) then
  3021. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  3022. end;
  3023. {$endif x86_64}
  3024. else
  3025. ;
  3026. end;
  3027. RemoveInstruction(hp2);
  3028. RemoveCurrentP(p, hp1);
  3029. Result:=true;
  3030. exit;
  3031. end;
  3032. end;
  3033. end
  3034. else if IsMOVZXAcceptable and
  3035. (taicpu(p).oper[1]^.typ = top_reg) and (taicpu(hp1).oper[1]^.typ = top_reg) and
  3036. (taicpu(p).oper[0]^.typ <> top_const) and { MOVZX only supports registers and memory, not immediates (use MOV for that!) }
  3037. (getsupreg(taicpu(p).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg))
  3038. then
  3039. begin
  3040. InputVal := debug_operstr(taicpu(p).oper[0]^);
  3041. MaskNum := debug_tostr(taicpu(hp1).oper[0]^.val);
  3042. case taicpu(p).opsize of
  3043. S_B:
  3044. if (taicpu(hp1).oper[0]^.val = $ff) then
  3045. begin
  3046. { Convert:
  3047. movb x, %regl movb x, %regl
  3048. andw ffh, %regw andl ffh, %regd
  3049. To:
  3050. movzbw x, %regd movzbl x, %regd
  3051. (Identical registers, just different sizes)
  3052. }
  3053. RegName1 := debug_regname(taicpu(p).oper[1]^.reg); { 8-bit register name }
  3054. RegName2 := debug_regname(taicpu(hp1).oper[1]^.reg); { 16/32-bit register name }
  3055. case taicpu(hp1).opsize of
  3056. S_W: NewSize := S_BW;
  3057. S_L: NewSize := S_BL;
  3058. {$ifdef x86_64}
  3059. S_Q: NewSize := S_BQ;
  3060. {$endif x86_64}
  3061. else
  3062. InternalError(2018011510);
  3063. end;
  3064. end
  3065. else
  3066. NewSize := S_NO;
  3067. S_W:
  3068. if (taicpu(hp1).oper[0]^.val = $ffff) then
  3069. begin
  3070. { Convert:
  3071. movw x, %regw
  3072. andl ffffh, %regd
  3073. To:
  3074. movzwl x, %regd
  3075. (Identical registers, just different sizes)
  3076. }
  3077. RegName1 := debug_regname(taicpu(p).oper[1]^.reg); { 16-bit register name }
  3078. RegName2 := debug_regname(taicpu(hp1).oper[1]^.reg); { 32-bit register name }
  3079. case taicpu(hp1).opsize of
  3080. S_L: NewSize := S_WL;
  3081. {$ifdef x86_64}
  3082. S_Q: NewSize := S_WQ;
  3083. {$endif x86_64}
  3084. else
  3085. InternalError(2018011511);
  3086. end;
  3087. end
  3088. else
  3089. NewSize := S_NO;
  3090. else
  3091. NewSize := S_NO;
  3092. end;
  3093. if NewSize <> S_NO then
  3094. begin
  3095. PreMessage := 'mov' + debug_opsize2str(taicpu(p).opsize) + ' ' + InputVal + ',' + RegName1;
  3096. { The actual optimization }
  3097. taicpu(p).opcode := A_MOVZX;
  3098. taicpu(p).changeopsize(NewSize);
  3099. taicpu(p).oper[1]^ := taicpu(hp1).oper[1]^;
  3100. { Safeguard if "and" is followed by a conditional command }
  3101. TransferUsedRegs(TmpUsedRegs);
  3102. UpdateUsedRegs(TmpUsedRegs,tai(p.next));
  3103. if (RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)) then
  3104. begin
  3105. { At this point, the "and" command is effectively equivalent to
  3106. "test %reg,%reg". This will be handled separately by the
  3107. Peephole Optimizer. [Kit] }
  3108. DebugMsg(SPeepholeOptimization + PreMessage +
  3109. ' -> movz' + debug_opsize2str(NewSize) + ' ' + InputVal + ',' + RegName2, p);
  3110. end
  3111. else
  3112. begin
  3113. DebugMsg(SPeepholeOptimization + PreMessage + '; and' + debug_opsize2str(taicpu(hp1).opsize) + ' $' + MaskNum + ',' + RegName2 +
  3114. ' -> movz' + debug_opsize2str(NewSize) + ' ' + InputVal + ',' + RegName2, p);
  3115. RemoveInstruction(hp1);
  3116. end;
  3117. Result := True;
  3118. Exit;
  3119. end;
  3120. end;
  3121. end;
  3122. if (taicpu(hp1).opcode = A_OR) and
  3123. (taicpu(p).oper[1]^.typ = top_reg) and
  3124. MatchOperand(taicpu(p).oper[0]^, 0) and
  3125. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) then
  3126. begin
  3127. { mov 0, %reg
  3128. or ###,%reg
  3129. Change to (only if the flags are not used):
  3130. mov ###,%reg
  3131. }
  3132. TransferUsedRegs(TmpUsedRegs);
  3133. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3134. DoOptimisation := True;
  3135. { Even if the flags are used, we might be able to do the optimisation
  3136. if the conditions are predictable }
  3137. if RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  3138. begin
  3139. { Only perform if ### = %reg (the same register) or equal to 0,
  3140. so %reg is guaranteed to still have a value of zero }
  3141. if MatchOperand(taicpu(hp1).oper[0]^, 0) or
  3142. MatchOperand(taicpu(hp1).oper[0]^, taicpu(hp1).oper[1]^.reg) then
  3143. begin
  3144. hp2 := hp1;
  3145. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  3146. while RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) and
  3147. GetNextInstruction(hp2, hp3) do
  3148. begin
  3149. { Don't continue modifying if the flags state is getting changed }
  3150. if RegModifiedByInstruction(NR_DEFAULTFLAGS, hp3) then
  3151. Break;
  3152. UpdateUsedRegs(TmpUsedRegs, tai(hp3.Next));
  3153. if MatchInstruction(hp3, A_Jcc, A_SETcc, A_CMOVcc, []) then
  3154. begin
  3155. if condition_in(C_E, taicpu(hp3).condition) or (taicpu(hp3).condition in [C_NC, C_NS, C_NO]) then
  3156. begin
  3157. { Condition is always true }
  3158. case taicpu(hp3).opcode of
  3159. A_Jcc:
  3160. begin
  3161. DebugMsg(SPeepholeOptimization + 'Condition is always true (jump made unconditional)', hp3);
  3162. { Check for jump shortcuts before we destroy the condition }
  3163. DoJumpOptimizations(hp3, TempBool);
  3164. MakeUnconditional(taicpu(hp3));
  3165. Result := True;
  3166. end;
  3167. A_CMOVcc:
  3168. begin
  3169. DebugMsg(SPeepholeOptimization + 'Condition is always true (CMOVcc -> MOV)', hp3);
  3170. taicpu(hp3).opcode := A_MOV;
  3171. taicpu(hp3).condition := C_None;
  3172. Result := True;
  3173. end;
  3174. A_SETcc:
  3175. begin
  3176. DebugMsg(SPeepholeOptimization + 'Condition is always true (changed to MOV 1)', hp3);
  3177. { Convert "set(c) %reg" instruction to "movb 1,%reg" }
  3178. taicpu(hp3).opcode := A_MOV;
  3179. taicpu(hp3).ops := 2;
  3180. taicpu(hp3).condition := C_None;
  3181. taicpu(hp3).opsize := S_B;
  3182. taicpu(hp3).loadreg(1,taicpu(hp3).oper[0]^.reg);
  3183. taicpu(hp3).loadconst(0, 1);
  3184. Result := True;
  3185. end;
  3186. else
  3187. InternalError(2021090701);
  3188. end;
  3189. end
  3190. 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
  3191. begin
  3192. { Condition is always false }
  3193. case taicpu(hp3).opcode of
  3194. A_Jcc:
  3195. begin
  3196. DebugMsg(SPeepholeOptimization + 'Condition is always false (jump removed)', hp3);
  3197. TAsmLabel(taicpu(hp3).oper[0]^.ref^.symbol).decrefs;
  3198. RemoveInstruction(hp3);
  3199. Result := True;
  3200. { Since hp3 was deleted, hp2 must not be updated }
  3201. Continue;
  3202. end;
  3203. A_CMOVcc:
  3204. begin
  3205. DebugMsg(SPeepholeOptimization + 'Condition is always false (conditional load removed)', hp3);
  3206. RemoveInstruction(hp3);
  3207. Result := True;
  3208. { Since hp3 was deleted, hp2 must not be updated }
  3209. Continue;
  3210. end;
  3211. A_SETcc:
  3212. begin
  3213. DebugMsg(SPeepholeOptimization + 'Condition is always false (changed to MOV 0)', hp3);
  3214. { Convert "set(c) %reg" instruction to "movb 0,%reg" }
  3215. taicpu(hp3).opcode := A_MOV;
  3216. taicpu(hp3).ops := 2;
  3217. taicpu(hp3).condition := C_None;
  3218. taicpu(hp3).opsize := S_B;
  3219. taicpu(hp3).loadreg(1,taicpu(hp3).oper[0]^.reg);
  3220. taicpu(hp3).loadconst(0, 0);
  3221. Result := True;
  3222. end;
  3223. else
  3224. InternalError(2021090702);
  3225. end;
  3226. end
  3227. else
  3228. { Uncertain what to do - don't optimise (although optimise other conditional statements if present) }
  3229. DoOptimisation := False;
  3230. end;
  3231. hp2 := hp3;
  3232. end;
  3233. { Flags are still in use - don't optimise }
  3234. if DoOptimisation and RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  3235. DoOptimisation := False;
  3236. end
  3237. else
  3238. DoOptimisation := False;
  3239. end;
  3240. if DoOptimisation then
  3241. begin
  3242. {$ifdef x86_64}
  3243. { OR only supports 32-bit sign-extended constants for 64-bit
  3244. instructions, so compensate for this if the constant is
  3245. encoded as a value greater than or equal to 2^31 }
  3246. if (taicpu(hp1).opsize = S_Q) and
  3247. (taicpu(hp1).oper[0]^.typ = top_const) and
  3248. (taicpu(hp1).oper[0]^.val >= $80000000) then
  3249. taicpu(hp1).oper[0]^.val := taicpu(hp1).oper[0]^.val or $FFFFFFFF00000000;
  3250. {$endif x86_64}
  3251. DebugMsg(SPeepholeOptimization + 'MOV 0 / OR -> MOV', p);
  3252. taicpu(hp1).opcode := A_MOV;
  3253. RemoveCurrentP(p, hp1);
  3254. Result := True;
  3255. Exit;
  3256. end;
  3257. end;
  3258. { Next instruction is also a MOV ? }
  3259. if MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) then
  3260. begin
  3261. if MatchOpType(taicpu(p), top_const, top_ref) and
  3262. MatchOpType(taicpu(hp1), top_const, top_ref) and
  3263. TryConstMerge(p, hp1) then
  3264. begin
  3265. Result := True;
  3266. { In case we have four byte writes in a row, check for 2 more
  3267. right now so we don't have to wait for another iteration of
  3268. pass 1
  3269. }
  3270. { If two byte-writes were merged, the opsize is now S_W, not S_B }
  3271. case taicpu(p).opsize of
  3272. S_W:
  3273. begin
  3274. if GetNextInstruction(p, hp1) and
  3275. MatchInstruction(hp1, A_MOV, [S_B]) and
  3276. MatchOpType(taicpu(hp1), top_const, top_ref) and
  3277. GetNextInstruction(hp1, hp2) and
  3278. MatchInstruction(hp2, A_MOV, [S_B]) and
  3279. MatchOpType(taicpu(hp2), top_const, top_ref) and
  3280. { Try to merge the two bytes }
  3281. TryConstMerge(hp1, hp2) then
  3282. { Now try to merge the two words (hp2 will get deleted) }
  3283. TryConstMerge(p, hp1);
  3284. end;
  3285. S_L:
  3286. begin
  3287. { Though this only really benefits x86_64 and not i386, it
  3288. gets a potential optimisation done faster and hence
  3289. reduces the number of times OptPass1MOV is entered }
  3290. if GetNextInstruction(p, hp1) and
  3291. MatchInstruction(hp1, A_MOV, [S_W]) and
  3292. MatchOpType(taicpu(hp1), top_const, top_ref) and
  3293. GetNextInstruction(hp1, hp2) and
  3294. MatchInstruction(hp2, A_MOV, [S_W]) and
  3295. MatchOpType(taicpu(hp2), top_const, top_ref) and
  3296. { Try to merge the two words }
  3297. TryConstMerge(hp1, hp2) then
  3298. { This will always fail on i386, so don't bother
  3299. calling it unless we're doing x86_64 }
  3300. {$ifdef x86_64}
  3301. { Now try to merge the two longwords (hp2 will get deleted) }
  3302. TryConstMerge(p, hp1)
  3303. {$endif x86_64}
  3304. ;
  3305. end;
  3306. else
  3307. ;
  3308. end;
  3309. Exit;
  3310. end;
  3311. if (taicpu(p).oper[1]^.typ = top_reg) and
  3312. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) then
  3313. begin
  3314. { Remember that p_TargetReg contains taicpu(p).oper[1]^.reg }
  3315. TransferUsedRegs(TmpUsedRegs);
  3316. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3317. { we have
  3318. mov x, %treg
  3319. mov %treg, y
  3320. }
  3321. if not(RegInOp(p_TargetReg, taicpu(hp1).oper[1]^)) then
  3322. if not(RegUsedAfterInstruction(p_TargetReg, hp1, TmpUsedRegs)) then
  3323. { we've got
  3324. mov x, %treg
  3325. mov %treg, y
  3326. with %treg is not used after }
  3327. case taicpu(p).oper[0]^.typ Of
  3328. { top_reg is covered by DeepMOVOpt }
  3329. top_const:
  3330. begin
  3331. { change
  3332. mov const, %treg
  3333. mov %treg, y
  3334. to
  3335. mov const, y
  3336. }
  3337. if (taicpu(hp1).oper[1]^.typ=top_reg) or
  3338. ((taicpu(p).oper[0]^.val>=low(longint)) and (taicpu(p).oper[0]^.val<=high(longint))) then
  3339. begin
  3340. if taicpu(hp1).oper[1]^.typ=top_reg then
  3341. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,usedregs);
  3342. taicpu(p).loadOper(1,taicpu(hp1).oper[1]^);
  3343. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 5 done',p);
  3344. RemoveInstruction(hp1);
  3345. Result:=true;
  3346. Exit;
  3347. end;
  3348. end;
  3349. top_ref:
  3350. case taicpu(hp1).oper[1]^.typ of
  3351. top_reg:
  3352. begin
  3353. { change
  3354. mov mem, %treg
  3355. mov %treg, %reg
  3356. to
  3357. mov mem, %reg"
  3358. }
  3359. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,usedregs);
  3360. taicpu(p).loadreg(1, taicpu(hp1).oper[1]^.reg);
  3361. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 3 done',p);
  3362. RemoveInstruction(hp1);
  3363. Result:=true;
  3364. Exit;
  3365. end;
  3366. top_ref:
  3367. begin
  3368. {$ifdef x86_64}
  3369. { Look for the following to simplify:
  3370. mov x(mem1), %reg
  3371. mov %reg, y(mem2)
  3372. mov x+8(mem1), %reg
  3373. mov %reg, y+8(mem2)
  3374. Change to:
  3375. movdqu x(mem1), %xmmreg
  3376. movdqu %xmmreg, y(mem2)
  3377. ...but only as long as the memory blocks don't overlap
  3378. }
  3379. SourceRef := taicpu(p).oper[0]^.ref^;
  3380. TargetRef := taicpu(hp1).oper[1]^.ref^;
  3381. if (taicpu(p).opsize = S_Q) and
  3382. GetNextInstruction(hp1, hp2) and
  3383. MatchInstruction(hp2, A_MOV, [taicpu(p).opsize]) and
  3384. MatchOpType(taicpu(hp2), top_ref, top_reg) then
  3385. begin
  3386. { Delay calling GetNextInstruction(hp2, hp3) for as long as possible }
  3387. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  3388. Inc(SourceRef.offset, 8);
  3389. if UseAVX then
  3390. begin
  3391. MovAligned := A_VMOVDQA;
  3392. MovUnaligned := A_VMOVDQU;
  3393. end
  3394. else
  3395. begin
  3396. MovAligned := A_MOVDQA;
  3397. MovUnaligned := A_MOVDQU;
  3398. end;
  3399. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) and
  3400. not RefsMightOverlap(taicpu(p).oper[0]^.ref^, TargetRef, 16) then
  3401. begin
  3402. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  3403. Inc(TargetRef.offset, 8);
  3404. if GetNextInstruction(hp2, hp3) and
  3405. MatchInstruction(hp3, A_MOV, [taicpu(p).opsize]) and
  3406. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  3407. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  3408. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  3409. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  3410. begin
  3411. NewMMReg := GetMMRegisterBetween(R_SUBMMX, UsedRegs, p, hp3);
  3412. if NewMMReg <> NR_NO then
  3413. begin
  3414. { Remember that the offsets are 8 ahead }
  3415. if ((SourceRef.offset mod 16) = 8) and
  3416. (
  3417. { Base pointer is always aligned (stack pointer won't be if there's no stack frame) }
  3418. (SourceRef.base = current_procinfo.framepointer) or
  3419. ((SourceRef.alignment >= 16) and ((SourceRef.alignment mod 16) = 0))
  3420. ) then
  3421. taicpu(p).opcode := MovAligned
  3422. else
  3423. taicpu(p).opcode := MovUnaligned;
  3424. taicpu(p).opsize := S_XMM;
  3425. taicpu(p).oper[1]^.reg := NewMMReg;
  3426. if ((TargetRef.offset mod 16) = 8) and
  3427. (
  3428. { Base pointer is always aligned (stack pointer won't be if there's no stack frame) }
  3429. (TargetRef.base = current_procinfo.framepointer) or
  3430. ((TargetRef.alignment >= 16) and ((TargetRef.alignment mod 16) = 0))
  3431. ) then
  3432. taicpu(hp1).opcode := MovAligned
  3433. else
  3434. taicpu(hp1).opcode := MovUnaligned;
  3435. taicpu(hp1).opsize := S_XMM;
  3436. taicpu(hp1).oper[0]^.reg := NewMMReg;
  3437. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(NewMMReg) + ' to merge a pair of memory moves (MovMovMovMov2MovdqMovdq 1)', p);
  3438. RemoveInstruction(hp2);
  3439. RemoveInstruction(hp3);
  3440. Result := True;
  3441. Exit;
  3442. end;
  3443. end;
  3444. end
  3445. else
  3446. begin
  3447. { See if the next references are 8 less rather than 8 greater }
  3448. Dec(SourceRef.offset, 16); { -8 the other way }
  3449. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) then
  3450. begin
  3451. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  3452. Dec(TargetRef.offset, 8); { Only 8, not 16, as it wasn't incremented unlike SourceRef }
  3453. if not RefsMightOverlap(SourceRef, TargetRef, 16) and
  3454. GetNextInstruction(hp2, hp3) and
  3455. MatchInstruction(hp3, A_MOV, [taicpu(p).opsize]) and
  3456. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  3457. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  3458. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  3459. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  3460. begin
  3461. NewMMReg := GetMMRegisterBetween(R_SUBMMX, UsedRegs, p, hp3);
  3462. if NewMMReg <> NR_NO then
  3463. begin
  3464. { hp2 and hp3 are the starting offsets, so mod = 0 this time }
  3465. if ((SourceRef.offset mod 16) = 0) and
  3466. (
  3467. { Base pointer is always aligned (stack pointer won't be if there's no stack frame) }
  3468. (SourceRef.base = current_procinfo.framepointer) or
  3469. ((SourceRef.alignment >= 16) and ((SourceRef.alignment mod 16) = 0))
  3470. ) then
  3471. taicpu(hp2).opcode := MovAligned
  3472. else
  3473. taicpu(hp2).opcode := MovUnaligned;
  3474. taicpu(hp2).opsize := S_XMM;
  3475. taicpu(hp2).oper[1]^.reg := NewMMReg;
  3476. if ((TargetRef.offset mod 16) = 0) and
  3477. (
  3478. { Base pointer is always aligned (stack pointer won't be if there's no stack frame) }
  3479. (TargetRef.base = current_procinfo.framepointer) or
  3480. ((TargetRef.alignment >= 16) and ((TargetRef.alignment mod 16) = 0))
  3481. ) then
  3482. taicpu(hp3).opcode := MovAligned
  3483. else
  3484. taicpu(hp3).opcode := MovUnaligned;
  3485. taicpu(hp3).opsize := S_XMM;
  3486. taicpu(hp3).oper[0]^.reg := NewMMReg;
  3487. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(NewMMReg) + ' to merge a pair of memory moves (MovMovMovMov2MovdqMovdq 2)', p);
  3488. RemoveInstruction(hp1);
  3489. RemoveCurrentP(p, hp2);
  3490. Result := True;
  3491. Exit;
  3492. end;
  3493. end;
  3494. end;
  3495. end;
  3496. end;
  3497. {$endif x86_64}
  3498. end;
  3499. else
  3500. { The write target should be a reg or a ref }
  3501. InternalError(2021091601);
  3502. end;
  3503. else
  3504. ;
  3505. end
  3506. else
  3507. { %treg is used afterwards, but all eventualities
  3508. other than the first MOV instruction being a constant
  3509. are covered by DeepMOVOpt, so only check for that }
  3510. if (taicpu(p).oper[0]^.typ = top_const) and
  3511. (
  3512. { For MOV operations, a size saving is only made if the register/const is byte-sized }
  3513. not (cs_opt_size in current_settings.optimizerswitches) or
  3514. (taicpu(hp1).opsize = S_B)
  3515. ) and
  3516. (
  3517. (taicpu(hp1).oper[1]^.typ = top_reg) or
  3518. ((taicpu(p).oper[0]^.val >= low(longint)) and (taicpu(p).oper[0]^.val <= high(longint)))
  3519. ) then
  3520. begin
  3521. DebugMsg(SPeepholeOptimization + debug_operstr(taicpu(hp1).oper[0]^) + ' = $' + debug_tostr(taicpu(p).oper[0]^.val) + '; changed to minimise pipeline stall (MovMov2Mov 6b)',hp1);
  3522. taicpu(hp1).loadconst(0, taicpu(p).oper[0]^.val);
  3523. end;
  3524. end;
  3525. if (taicpu(hp1).oper[0]^.typ = taicpu(p).oper[1]^.typ) and
  3526. (taicpu(hp1).oper[1]^.typ = taicpu(p).oper[0]^.typ) then
  3527. { mov reg1, mem1 or mov mem1, reg1
  3528. mov mem2, reg2 mov reg2, mem2}
  3529. begin
  3530. if OpsEqual(taicpu(hp1).oper[1]^,taicpu(p).oper[0]^) then
  3531. { mov reg1, mem1 or mov mem1, reg1
  3532. mov mem2, reg1 mov reg2, mem1}
  3533. begin
  3534. if OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  3535. { Removes the second statement from
  3536. mov reg1, mem1/reg2
  3537. mov mem1/reg2, reg1 }
  3538. begin
  3539. if taicpu(p).oper[0]^.typ=top_reg then
  3540. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,usedregs);
  3541. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 1',p);
  3542. RemoveInstruction(hp1);
  3543. Result:=true;
  3544. exit;
  3545. end
  3546. else
  3547. begin
  3548. TransferUsedRegs(TmpUsedRegs);
  3549. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  3550. if (taicpu(p).oper[1]^.typ = top_ref) and
  3551. { mov reg1, mem1
  3552. mov mem2, reg1 }
  3553. (taicpu(hp1).oper[0]^.ref^.refaddr = addr_no) and
  3554. GetNextInstruction(hp1, hp2) and
  3555. MatchInstruction(hp2,A_CMP,[taicpu(p).opsize]) and
  3556. OpsEqual(taicpu(p).oper[1]^,taicpu(hp2).oper[0]^) and
  3557. OpsEqual(taicpu(p).oper[0]^,taicpu(hp2).oper[1]^) and
  3558. not(RegUsedAfterInstruction(taicpu(p).oper[0]^.reg, hp2, TmpUsedRegs)) then
  3559. { change to
  3560. mov reg1, mem1 mov reg1, mem1
  3561. mov mem2, reg1 cmp reg1, mem2
  3562. cmp mem1, reg1
  3563. }
  3564. begin
  3565. RemoveInstruction(hp2);
  3566. taicpu(hp1).opcode := A_CMP;
  3567. taicpu(hp1).loadref(1,taicpu(hp1).oper[0]^.ref^);
  3568. taicpu(hp1).loadreg(0,taicpu(p).oper[0]^.reg);
  3569. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,UsedRegs);
  3570. DebugMsg(SPeepholeOptimization + 'MovMovCmp2MovCmp done',hp1);
  3571. end;
  3572. end;
  3573. end
  3574. else if (taicpu(p).oper[1]^.typ=top_ref) and
  3575. OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  3576. begin
  3577. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,UsedRegs);
  3578. taicpu(hp1).loadreg(0,taicpu(p).oper[0]^.reg);
  3579. DebugMsg(SPeepholeOptimization + 'MovMov2MovMov1 done',p);
  3580. end
  3581. else
  3582. begin
  3583. TransferUsedRegs(TmpUsedRegs);
  3584. if GetNextInstruction(hp1, hp2) and
  3585. MatchOpType(taicpu(p),top_ref,top_reg) and
  3586. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  3587. (taicpu(hp1).oper[1]^.typ = top_ref) and
  3588. MatchInstruction(hp2,A_MOV,[taicpu(p).opsize]) and
  3589. MatchOpType(taicpu(hp2),top_ref,top_reg) and
  3590. RefsEqual(taicpu(hp2).oper[0]^.ref^, taicpu(hp1).oper[1]^.ref^) then
  3591. if not RegInRef(taicpu(hp2).oper[1]^.reg,taicpu(hp2).oper[0]^.ref^) and
  3592. not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,tmpUsedRegs)) then
  3593. { mov mem1, %reg1
  3594. mov %reg1, mem2
  3595. mov mem2, reg2
  3596. to:
  3597. mov mem1, reg2
  3598. mov reg2, mem2}
  3599. begin
  3600. AllocRegBetween(taicpu(hp2).oper[1]^.reg,p,hp2,usedregs);
  3601. DebugMsg(SPeepholeOptimization + 'MovMovMov2MovMov 1 done',p);
  3602. taicpu(p).loadoper(1,taicpu(hp2).oper[1]^);
  3603. taicpu(hp1).loadoper(0,taicpu(hp2).oper[1]^);
  3604. RemoveInstruction(hp2);
  3605. Result := True;
  3606. end
  3607. {$ifdef i386}
  3608. { this is enabled for i386 only, as the rules to create the reg sets below
  3609. are too complicated for x86-64, so this makes this code too error prone
  3610. on x86-64
  3611. }
  3612. else if (taicpu(p).oper[1]^.reg <> taicpu(hp2).oper[1]^.reg) and
  3613. not(RegInRef(taicpu(p).oper[1]^.reg,taicpu(p).oper[0]^.ref^)) and
  3614. not(RegInRef(taicpu(hp2).oper[1]^.reg,taicpu(hp2).oper[0]^.ref^)) then
  3615. { mov mem1, reg1 mov mem1, reg1
  3616. mov reg1, mem2 mov reg1, mem2
  3617. mov mem2, reg2 mov mem2, reg1
  3618. to: to:
  3619. mov mem1, reg1 mov mem1, reg1
  3620. mov mem1, reg2 mov reg1, mem2
  3621. mov reg1, mem2
  3622. or (if mem1 depends on reg1
  3623. and/or if mem2 depends on reg2)
  3624. to:
  3625. mov mem1, reg1
  3626. mov reg1, mem2
  3627. mov reg1, reg2
  3628. }
  3629. begin
  3630. taicpu(hp1).loadRef(0,taicpu(p).oper[0]^.ref^);
  3631. taicpu(hp1).loadReg(1,taicpu(hp2).oper[1]^.reg);
  3632. taicpu(hp2).loadRef(1,taicpu(hp2).oper[0]^.ref^);
  3633. taicpu(hp2).loadReg(0,taicpu(p).oper[1]^.reg);
  3634. AllocRegBetween(taicpu(p).oper[1]^.reg,p,hp2,usedregs);
  3635. if (taicpu(p).oper[0]^.ref^.base <> NR_NO) and
  3636. (getsupreg(taicpu(p).oper[0]^.ref^.base) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX,RS_ESI,RS_EDI]) then
  3637. AllocRegBetween(taicpu(p).oper[0]^.ref^.base,p,hp2,usedregs);
  3638. if (taicpu(p).oper[0]^.ref^.index <> NR_NO) and
  3639. (getsupreg(taicpu(p).oper[0]^.ref^.index) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX,RS_ESI,RS_EDI]) then
  3640. AllocRegBetween(taicpu(p).oper[0]^.ref^.index,p,hp2,usedregs);
  3641. end
  3642. else if (taicpu(hp1).Oper[0]^.reg <> taicpu(hp2).Oper[1]^.reg) then
  3643. begin
  3644. taicpu(hp2).loadReg(0,taicpu(hp1).Oper[0]^.reg);
  3645. AllocRegBetween(taicpu(p).oper[1]^.reg,p,hp2,usedregs);
  3646. end
  3647. else
  3648. begin
  3649. RemoveInstruction(hp2);
  3650. end
  3651. {$endif i386}
  3652. ;
  3653. end;
  3654. end
  3655. { movl [mem1],reg1
  3656. movl [mem1],reg2
  3657. to
  3658. movl [mem1],reg1
  3659. movl reg1,reg2
  3660. }
  3661. else if MatchOpType(taicpu(p),top_ref,top_reg) and
  3662. MatchOpType(taicpu(hp1),top_ref,top_reg) and
  3663. (taicpu(p).opsize = taicpu(hp1).opsize) and
  3664. RefsEqual(taicpu(p).oper[0]^.ref^,taicpu(hp1).oper[0]^.ref^) and
  3665. (taicpu(p).oper[0]^.ref^.volatility=[]) and
  3666. (taicpu(hp1).oper[0]^.ref^.volatility=[]) and
  3667. not(SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.ref^.base)) and
  3668. not(SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.ref^.index)) then
  3669. begin
  3670. DebugMsg(SPeepholeOptimization + 'MovMov2MovMov 2',p);
  3671. taicpu(hp1).loadReg(0,taicpu(p).oper[1]^.reg);
  3672. end;
  3673. { movl const1,[mem1]
  3674. movl [mem1],reg1
  3675. to
  3676. movl const1,reg1
  3677. movl reg1,[mem1]
  3678. }
  3679. if MatchOpType(Taicpu(p),top_const,top_ref) and
  3680. MatchOpType(Taicpu(hp1),top_ref,top_reg) and
  3681. (taicpu(p).opsize = taicpu(hp1).opsize) and
  3682. RefsEqual(taicpu(hp1).oper[0]^.ref^,taicpu(p).oper[1]^.ref^) and
  3683. not(RegInRef(taicpu(hp1).oper[1]^.reg,taicpu(hp1).oper[0]^.ref^)) then
  3684. begin
  3685. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,usedregs);
  3686. taicpu(hp1).loadReg(0,taicpu(hp1).oper[1]^.reg);
  3687. taicpu(hp1).loadRef(1,taicpu(p).oper[1]^.ref^);
  3688. taicpu(p).loadReg(1,taicpu(hp1).oper[0]^.reg);
  3689. taicpu(hp1).fileinfo := taicpu(p).fileinfo;
  3690. DebugMsg(SPeepholeOptimization + 'MovMov2MovMov 1',p);
  3691. Result:=true;
  3692. exit;
  3693. end;
  3694. { mov x,reg1; mov y,reg1 -> mov y,reg1 is handled by the Mov2Nop 5 optimisation }
  3695. { Change:
  3696. movl %reg1,%reg2
  3697. movl x(%reg1),%reg1 (If something other than %reg1 is written to, DeepMOVOpt would have caught it)
  3698. movl x(%reg2),%regX (%regX can be %reg2 or something else)
  3699. To:
  3700. movl %reg1,%reg2 (if %regX = %reg2, then remove this instruction)
  3701. movl x(%reg1),%reg1
  3702. movl %reg1,%regX
  3703. }
  3704. if MatchOpType(taicpu(p), top_reg, top_reg) then
  3705. begin
  3706. p_SourceReg := taicpu(p).oper[0]^.reg;
  3707. { Remember that p_TargetReg contains taicpu(p).oper[1]^.reg }
  3708. if (taicpu(hp1).oper[0]^.typ = top_ref) { The other operand will be a register } and
  3709. (taicpu(hp1).oper[1]^.reg = p_SourceReg) and
  3710. RegInRef(p_SourceReg, taicpu(hp1).oper[0]^.ref^) and
  3711. GetNextInstruction(hp1, hp2) and
  3712. MatchInstruction(hp2, A_MOV, [taicpu(p).opsize]) and
  3713. (taicpu(hp2).oper[0]^.typ = top_ref) { The other operand will be a register } then
  3714. begin
  3715. SourceRef := taicpu(hp2).oper[0]^.ref^;
  3716. if RegInRef(p_TargetReg, SourceRef) and
  3717. { If %reg1 also appears in the second reference, then it will
  3718. not refer to the same memory block as the first reference }
  3719. not RegInRef(p_SourceReg, SourceRef) then
  3720. begin
  3721. { Check to see if the references match if %reg2 is changed to %reg1 }
  3722. if SourceRef.base = p_TargetReg then
  3723. SourceRef.base := p_SourceReg;
  3724. if SourceRef.index = p_TargetReg then
  3725. SourceRef.index := p_SourceReg;
  3726. { RefsEqual also checks to ensure both references are non-volatile }
  3727. if RefsEqual(taicpu(hp1).oper[0]^.ref^, SourceRef) then
  3728. begin
  3729. taicpu(hp2).loadreg(0, p_SourceReg);
  3730. DebugMsg(SPeepholeOptimization + 'Optimised register duplication and memory read (MovMovMov2MovMovMov)', p);
  3731. Result := True;
  3732. if taicpu(hp2).oper[1]^.reg = p_TargetReg then
  3733. begin
  3734. DebugMsg(SPeepholeOptimization + 'Mov2Nop 5a done', p);
  3735. RemoveCurrentP(p, hp1);
  3736. Exit;
  3737. end
  3738. else
  3739. begin
  3740. { Check to see if %reg2 is no longer in use }
  3741. TransferUsedRegs(TmpUsedRegs);
  3742. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3743. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  3744. if not RegUsedAfterInstruction(p_TargetReg, hp2, TmpUsedRegs) then
  3745. begin
  3746. DebugMsg(SPeepholeOptimization + 'Mov2Nop 5b done', p);
  3747. RemoveCurrentP(p, hp1);
  3748. Exit;
  3749. end;
  3750. end;
  3751. { If we reach this point, p and hp1 weren't actually modified,
  3752. so we can do a bit more work on this pass }
  3753. end;
  3754. end;
  3755. end;
  3756. end;
  3757. end;
  3758. {$ifdef x86_64}
  3759. { Change:
  3760. movl %reg1l,%reg2l
  3761. movq %reg2q,%reg3q (%reg1 <> %reg3)
  3762. To:
  3763. movl %reg1l,%reg2l
  3764. movl %reg1l,%reg3l (Upper 32 bits of %reg3q will be zero)
  3765. If %reg1 = %reg3, convert to:
  3766. movl %reg1l,%reg2l
  3767. andl %reg1l,%reg1l
  3768. }
  3769. if (taicpu(p).opsize = S_L) and MatchInstruction(hp1,A_MOV,[S_Q]) and
  3770. MatchOpType(taicpu(p), top_reg, top_reg) and
  3771. MatchOpType(taicpu(hp1), top_reg, top_reg) and
  3772. SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^.reg) then
  3773. begin
  3774. TransferUsedRegs(TmpUsedRegs);
  3775. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3776. taicpu(hp1).opsize := S_L;
  3777. taicpu(hp1).loadreg(0, taicpu(p).oper[0]^.reg);
  3778. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  3779. AllocRegBetween(taicpu(p).oper[0]^.reg, p, hp1, UsedRegs);
  3780. if (taicpu(p).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) then
  3781. begin
  3782. { %reg1 = %reg3 }
  3783. DebugMsg(SPeepholeOptimization + 'Made 32-to-64-bit zero extension more efficient (MovlMovq2MovlAndl 1)', hp1);
  3784. taicpu(hp1).opcode := A_AND;
  3785. end
  3786. else
  3787. begin
  3788. { %reg1 <> %reg3 }
  3789. DebugMsg(SPeepholeOptimization + 'Made 32-to-64-bit zero extension more efficient (MovlMovq2MovlMovl 1)', hp1);
  3790. end;
  3791. if not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) then
  3792. begin
  3793. DebugMsg(SPeepholeOptimization + 'Mov2Nop 8 done', p);
  3794. RemoveCurrentP(p, hp1);
  3795. Result := True;
  3796. Exit;
  3797. end
  3798. else
  3799. begin
  3800. { Initial instruction wasn't actually changed }
  3801. Include(OptsToCheck, aoc_ForceNewIteration);
  3802. { if %reg1 = %reg3, don't do the long-distance lookahead that
  3803. appears below since %reg1 has technically changed }
  3804. if taicpu(hp1).opcode = A_AND then
  3805. Exit;
  3806. end;
  3807. end;
  3808. {$endif x86_64}
  3809. { search further than the next instruction for a mov (as long as it's not a jump) }
  3810. if not is_calljmpuncondret(taicpu(hp1).opcode) and
  3811. { check as much as possible before the expensive GetNextInstructionUsingRegCond call }
  3812. (taicpu(p).oper[1]^.typ = top_reg) and
  3813. (taicpu(p).oper[0]^.typ in [top_reg,top_const]) and
  3814. not RegModifiedByInstruction(taicpu(p).oper[1]^.reg, hp1) then
  3815. begin
  3816. { we work with hp2 here, so hp1 can be still used later on when
  3817. checking for GetNextInstruction_p }
  3818. hp3 := hp1;
  3819. { Initialise CrossJump (if it becomes True at any point, it will remain True) }
  3820. CrossJump := (taicpu(hp1).opcode = A_Jcc);
  3821. { Remember that p_TargetReg contains taicpu(p).oper[1]^.reg }
  3822. TransferUsedRegs(TmpUsedRegs);
  3823. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3824. if NotFirstIteration then
  3825. JumpTracking := TLinkedList.Create
  3826. else
  3827. JumpTracking := nil;
  3828. while GetNextInstructionUsingRegCond(hp3,hp2,p_TargetReg,JumpTracking,CrossJump) and
  3829. { GetNextInstructionUsingRegCond only searches one instruction ahead unless -O3 is specified }
  3830. (hp2.typ=ait_instruction) do
  3831. begin
  3832. case taicpu(hp2).opcode of
  3833. A_POP:
  3834. if MatchOperand(taicpu(hp2).oper[0]^,p_TargetReg) then
  3835. begin
  3836. if not CrossJump and
  3837. not RegUsedBetween(p_TargetReg, p, hp2) then
  3838. begin
  3839. { We can remove the original MOV since the register
  3840. wasn't used between it and its popping from the stack }
  3841. DebugMsg(SPeepholeOptimization + 'Mov2Nop 3c done',p);
  3842. RemoveCurrentp(p, hp1);
  3843. Result := True;
  3844. JumpTracking.Free;
  3845. Exit;
  3846. end;
  3847. { Can't go any further }
  3848. Break;
  3849. end;
  3850. A_MOV:
  3851. if MatchOperand(taicpu(hp2).oper[0]^,p_TargetReg) and
  3852. ((taicpu(p).oper[0]^.typ=top_const) or
  3853. ((taicpu(p).oper[0]^.typ=top_reg) and
  3854. not(RegModifiedBetween(taicpu(p).oper[0]^.reg, p, hp2))
  3855. )
  3856. ) then
  3857. begin
  3858. { we have
  3859. mov x, %treg
  3860. mov %treg, y
  3861. }
  3862. { We don't need to call UpdateUsedRegs for every instruction between
  3863. p and hp2 because the register we're concerned about will not
  3864. become deallocated (otherwise GetNextInstructionUsingReg would
  3865. have stopped at an earlier instruction). [Kit] }
  3866. TempRegUsed :=
  3867. CrossJump { Assume the register is in use if it crossed a conditional jump } or
  3868. RegReadByInstruction(p_TargetReg, hp3) or
  3869. RegUsedAfterInstruction(p_TargetReg, hp2, TmpUsedRegs);
  3870. case taicpu(p).oper[0]^.typ Of
  3871. top_reg:
  3872. begin
  3873. { change
  3874. mov %reg, %treg
  3875. mov %treg, y
  3876. to
  3877. mov %reg, y
  3878. }
  3879. p_SourceReg := taicpu(p).oper[0]^.reg; { Saves on a handful of pointer dereferences }
  3880. RegName1 := debug_regname(taicpu(hp2).oper[0]^.reg);
  3881. if MatchOperand(taicpu(hp2).oper[1]^, p_SourceReg) then
  3882. begin
  3883. { %reg = y - remove hp2 completely (doing it here instead of relying on
  3884. the "mov %reg,%reg" optimisation might cut down on a pass iteration) }
  3885. if TempRegUsed then
  3886. begin
  3887. DebugMsg(SPeepholeOptimization + debug_regname(p_SourceReg) + ' = ' + RegName1 + '; removed unnecessary instruction (MovMov2MovNop 6b}',hp2);
  3888. AllocRegBetween(p_SourceReg, p, hp2, UsedRegs);
  3889. { Set the start of the next GetNextInstructionUsingRegCond search
  3890. to start at the entry right before hp2 (which is about to be removed) }
  3891. hp3 := tai(hp2.Previous);
  3892. RemoveInstruction(hp2);
  3893. { See if there's more we can optimise }
  3894. Continue;
  3895. end
  3896. else
  3897. begin
  3898. RemoveInstruction(hp2);
  3899. { We can remove the original MOV too }
  3900. DebugMsg(SPeepholeOptimization + 'MovMov2NopNop 6b done',p);
  3901. RemoveCurrentP(p, hp1);
  3902. Result:=true;
  3903. JumpTracking.Free;
  3904. Exit;
  3905. end;
  3906. end
  3907. else
  3908. begin
  3909. AllocRegBetween(p_SourceReg, p, hp2, UsedRegs);
  3910. taicpu(hp2).loadReg(0, p_SourceReg);
  3911. DebugMsg(SPeepholeOptimization + RegName1 + ' = ' + debug_regname(p_SourceReg) + '; changed to minimise pipeline stall (MovMov2Mov 6a}',hp2);
  3912. { Check to see if the register also appears in the reference }
  3913. if (taicpu(hp2).oper[1]^.typ = top_ref) then
  3914. ReplaceRegisterInRef(taicpu(hp2).oper[1]^.ref^, p_TargetReg, p_SourceReg);
  3915. { Don't remove the first instruction if the temporary register is in use }
  3916. if not TempRegUsed and
  3917. { ReplaceRegisterInRef won't actually replace the register if it's a different size }
  3918. not RegInOp(p_TargetReg, taicpu(hp2).oper[1]^) then
  3919. begin
  3920. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 6 done',p);
  3921. RemoveCurrentP(p, hp1);
  3922. Result:=true;
  3923. JumpTracking.Free;
  3924. Exit;
  3925. end;
  3926. { No need to set Result to True here. If there's another instruction later
  3927. on that can be optimised, it will be detected when the main Pass 1 loop
  3928. reaches what is now hp2 and passes it through OptPass1MOV. [Kit] }
  3929. end;
  3930. end;
  3931. top_const:
  3932. if not (cs_opt_size in current_settings.optimizerswitches) or (taicpu(hp2).opsize = S_B) then
  3933. begin
  3934. { change
  3935. mov const, %treg
  3936. mov %treg, y
  3937. to
  3938. mov const, y
  3939. }
  3940. if (taicpu(hp2).oper[1]^.typ=top_reg) or
  3941. ((taicpu(p).oper[0]^.val>=low(longint)) and (taicpu(p).oper[0]^.val<=high(longint))) then
  3942. begin
  3943. RegName1 := debug_regname(taicpu(hp2).oper[0]^.reg);
  3944. taicpu(hp2).loadOper(0,taicpu(p).oper[0]^);
  3945. if TempRegUsed then
  3946. begin
  3947. { Don't remove the first instruction if the temporary register is in use }
  3948. DebugMsg(SPeepholeOptimization + RegName1 + ' = ' + debug_tostr(taicpu(p).oper[0]^.val) + '; changed to minimise pipeline stall (MovMov2Mov 7a)',hp2);
  3949. { No need to set Result to True. If there's another instruction later on
  3950. that can be optimised, it will be detected when the main Pass 1 loop
  3951. reaches what is now hp2 and passes it through OptPass1MOV. [Kit] };
  3952. end
  3953. else
  3954. begin
  3955. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 7 done',p);
  3956. RemoveCurrentP(p, hp1);
  3957. Result:=true;
  3958. Exit;
  3959. end;
  3960. end;
  3961. end;
  3962. else
  3963. Internalerror(2019103001);
  3964. end;
  3965. end
  3966. else if MatchOperand(taicpu(hp2).oper[1]^, p_TargetReg) then
  3967. begin
  3968. if not CrossJump and
  3969. not RegUsedBetween(p_TargetReg, p, hp2) and
  3970. not RegReadByInstruction(p_TargetReg, hp2) then
  3971. begin
  3972. { Register is not used before it is overwritten }
  3973. DebugMsg(SPeepholeOptimization + 'Mov2Nop 3a done',p);
  3974. RemoveCurrentp(p, hp1);
  3975. Result := True;
  3976. Exit;
  3977. end;
  3978. if (taicpu(p).oper[0]^.typ = top_const) and
  3979. (taicpu(hp2).oper[0]^.typ = top_const) then
  3980. begin
  3981. if taicpu(p).oper[0]^.val = taicpu(hp2).oper[0]^.val then
  3982. begin
  3983. { Same value - register hasn't changed }
  3984. DebugMsg(SPeepholeOptimization + 'Mov2Nop 2 done', hp2);
  3985. RemoveInstruction(hp2);
  3986. Result := True;
  3987. { See if there's more we can optimise }
  3988. Continue;
  3989. end;
  3990. end;
  3991. {$ifdef x86_64}
  3992. end
  3993. { Change:
  3994. movl %reg1l,%reg2l
  3995. ...
  3996. movq %reg2q,%reg3q (%reg1 <> %reg3)
  3997. To:
  3998. movl %reg1l,%reg2l
  3999. ...
  4000. movl %reg1l,%reg3l (Upper 32 bits of %reg3q will be zero)
  4001. If %reg1 = %reg3, convert to:
  4002. movl %reg1l,%reg2l
  4003. ...
  4004. andl %reg1l,%reg1l
  4005. }
  4006. else if (taicpu(p).opsize = S_L) and MatchInstruction(hp2,A_MOV,[S_Q]) and
  4007. (taicpu(p).oper[0]^.typ = top_reg) and
  4008. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  4009. SuperRegistersEqual(p_TargetReg, taicpu(hp2).oper[0]^.reg) and
  4010. not RegModifiedBetween(p_TargetReg, p, hp2) then
  4011. begin
  4012. TempRegUsed :=
  4013. CrossJump { Assume the register is in use if it crossed a conditional jump } or
  4014. RegReadByInstruction(p_TargetReg, hp3) or
  4015. RegUsedAfterInstruction(p_TargetReg, hp2, TmpUsedRegs);
  4016. taicpu(hp2).opsize := S_L;
  4017. taicpu(hp2).loadreg(0, taicpu(p).oper[0]^.reg);
  4018. setsubreg(taicpu(hp2).oper[1]^.reg, R_SUBD);
  4019. AllocRegBetween(taicpu(p).oper[0]^.reg, p, hp2, UsedRegs);
  4020. if (taicpu(p).oper[0]^.reg = taicpu(hp2).oper[1]^.reg) then
  4021. begin
  4022. { %reg1 = %reg3 }
  4023. DebugMsg(SPeepholeOptimization + 'Made 32-to-64-bit zero extension more efficient (MovlMovq2MovlAndl 2)', hp2);
  4024. taicpu(hp2).opcode := A_AND;
  4025. end
  4026. else
  4027. begin
  4028. { %reg1 <> %reg3 }
  4029. DebugMsg(SPeepholeOptimization + 'Made 32-to-64-bit zero extension more efficient (MovlMovq2MovlMovl 2)', hp2);
  4030. end;
  4031. if not TempRegUsed then
  4032. begin
  4033. DebugMsg(SPeepholeOptimization + 'Mov2Nop 8a done', p);
  4034. RemoveCurrentP(p, hp1);
  4035. Result := True;
  4036. Exit;
  4037. end
  4038. else
  4039. begin
  4040. { Initial instruction wasn't actually changed }
  4041. Include(OptsToCheck, aoc_ForceNewIteration);
  4042. { if %reg1 = %reg3, don't do the long-distance lookahead that
  4043. appears below since %reg1 has technically changed }
  4044. if taicpu(hp2).opcode = A_AND then
  4045. Break;
  4046. end;
  4047. {$endif x86_64}
  4048. end;
  4049. A_MOVZX, A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  4050. if MatchOpType(taicpu(hp2), top_reg, top_reg) and
  4051. MatchOperand(taicpu(hp2).oper[0]^, p_TargetReg) and
  4052. SuperRegistersEqual(taicpu(hp2).oper[1]^.reg, p_TargetReg) then
  4053. begin
  4054. {
  4055. Change from:
  4056. mov ###, %reg
  4057. ...
  4058. movs/z %reg,%reg (Same register, just different sizes)
  4059. To:
  4060. movs/z ###, %reg (Longer version)
  4061. ...
  4062. (remove)
  4063. }
  4064. DebugMsg(SPeepholeOptimization + 'MovMovs/z2Mov/s/z done', p);
  4065. taicpu(p).oper[1]^.reg := taicpu(hp2).oper[1]^.reg;
  4066. { Keep the first instruction as mov if ### is a constant }
  4067. if taicpu(p).oper[0]^.typ = top_const then
  4068. taicpu(p).opsize := reg2opsize(taicpu(hp2).oper[1]^.reg)
  4069. else
  4070. begin
  4071. taicpu(p).opcode := taicpu(hp2).opcode;
  4072. taicpu(p).opsize := taicpu(hp2).opsize;
  4073. end;
  4074. DebugMsg(SPeepholeOptimization + 'Removed movs/z instruction and extended earlier write (MovMovs/z2Mov/s/z)', hp2);
  4075. AllocRegBetween(taicpu(hp2).oper[1]^.reg, p, hp2, UsedRegs);
  4076. RemoveInstruction(hp2);
  4077. Result := True;
  4078. JumpTracking.Free;
  4079. Exit;
  4080. end;
  4081. else
  4082. { Move down to the if-block below };
  4083. end;
  4084. { Also catches MOV/S/Z instructions that aren't modified }
  4085. if taicpu(p).oper[0]^.typ = top_reg then
  4086. begin
  4087. p_SourceReg := taicpu(p).oper[0]^.reg;
  4088. if
  4089. not RegModifiedByInstruction(p_SourceReg, hp3) and
  4090. not RegModifiedBetween(p_SourceReg, hp3, hp2) and
  4091. DeepMOVOpt(taicpu(p), taicpu(hp2)) then
  4092. begin
  4093. Result := True;
  4094. { Just in case something didn't get modified (e.g. an
  4095. implicit register). Also, if it does read from this
  4096. register, then there's no longer an advantage to
  4097. changing the register on subsequent instructions.}
  4098. if not RegReadByInstruction(p_TargetReg, hp2) then
  4099. begin
  4100. { If a conditional jump was crossed, do not delete
  4101. the original MOV no matter what }
  4102. if not CrossJump and
  4103. { RegEndOfLife returns True if the register is
  4104. deallocated before the next instruction or has
  4105. been loaded with a new value }
  4106. RegEndOfLife(p_TargetReg, taicpu(hp2)) then
  4107. begin
  4108. { We can remove the original MOV }
  4109. DebugMsg(SPeepholeOptimization + 'Mov2Nop 3b done',p);
  4110. RemoveCurrentp(p, hp1);
  4111. JumpTracking.Free;
  4112. Result := True;
  4113. Exit;
  4114. end;
  4115. if not RegModifiedByInstruction(p_TargetReg, hp2) then
  4116. begin
  4117. { See if there's more we can optimise }
  4118. hp3 := hp2;
  4119. Continue;
  4120. end;
  4121. end;
  4122. end;
  4123. end;
  4124. { Break out of the while loop under normal circumstances }
  4125. Break;
  4126. end;
  4127. JumpTracking.Free;
  4128. end;
  4129. if (aoc_MovAnd2Mov_3 in OptsToCheck) and
  4130. (taicpu(p).oper[1]^.typ = top_reg) and
  4131. (taicpu(p).opsize = S_L) and
  4132. GetNextInstructionUsingRegTrackingUse(p,hp2,taicpu(p).oper[1]^.reg) and
  4133. (hp2.typ = ait_instruction) and
  4134. (taicpu(hp2).opcode = A_AND) and
  4135. (MatchOpType(taicpu(hp2),top_const,top_reg) or
  4136. (MatchOpType(taicpu(hp2),top_reg,top_reg) and
  4137. MatchOperand(taicpu(hp2).oper[0]^,taicpu(hp2).oper[1]^))
  4138. ) then
  4139. begin
  4140. if SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp2).oper[1]^.reg) then
  4141. begin
  4142. if ((taicpu(hp2).oper[0]^.typ=top_const) and (taicpu(hp2).oper[0]^.val = $ffffffff)) or
  4143. ((taicpu(hp2).oper[0]^.typ=top_reg) and (taicpu(hp2).opsize=S_L)) then
  4144. begin
  4145. { Optimize out:
  4146. mov x, %reg
  4147. and ffffffffh, %reg
  4148. }
  4149. DebugMsg(SPeepholeOptimization + 'MovAnd2Mov 3 done',p);
  4150. RemoveInstruction(hp2);
  4151. Result:=true;
  4152. exit;
  4153. end;
  4154. end;
  4155. end;
  4156. { leave out the mov from "mov reg, x(%frame_pointer); leave/ret" (with
  4157. x >= RetOffset) as it doesn't do anything (it writes either to a
  4158. parameter or to the temporary storage room for the function
  4159. result)
  4160. }
  4161. if IsExitCode(hp1) and
  4162. (taicpu(p).oper[1]^.typ = top_ref) and
  4163. (taicpu(p).oper[1]^.ref^.index = NR_NO) and
  4164. (
  4165. (
  4166. (taicpu(p).oper[1]^.ref^.base = current_procinfo.FramePointer) and
  4167. not (
  4168. assigned(current_procinfo.procdef.funcretsym) and
  4169. (taicpu(p).oper[1]^.ref^.offset <= tabstractnormalvarsym(current_procinfo.procdef.funcretsym).localloc.reference.offset)
  4170. )
  4171. ) or
  4172. { Also discard writes to the stack that are below the base pointer,
  4173. as this is temporary storage rather than a function result on the
  4174. stack, say. }
  4175. (
  4176. (taicpu(p).oper[1]^.ref^.base = NR_STACK_POINTER_REG) and
  4177. (taicpu(p).oper[1]^.ref^.offset < current_procinfo.final_localsize)
  4178. )
  4179. ) then
  4180. begin
  4181. RemoveCurrentp(p, hp1);
  4182. DebugMsg(SPeepholeOptimization + 'removed deadstore before leave/ret',p);
  4183. RemoveLastDeallocForFuncRes(p);
  4184. Result:=true;
  4185. exit;
  4186. end;
  4187. if MatchInstruction(hp1,A_CMP,A_TEST,[taicpu(p).opsize]) then
  4188. begin
  4189. if MatchOpType(taicpu(p),top_reg,top_ref) and
  4190. (taicpu(hp1).oper[1]^.typ = top_ref) and
  4191. RefsEqual(taicpu(p).oper[1]^.ref^, taicpu(hp1).oper[1]^.ref^) then
  4192. begin
  4193. { change
  4194. mov reg1, mem1
  4195. test/cmp x, mem1
  4196. to
  4197. mov reg1, mem1
  4198. test/cmp x, reg1
  4199. }
  4200. taicpu(hp1).loadreg(1,taicpu(p).oper[0]^.reg);
  4201. DebugMsg(SPeepholeOptimization + 'MovTestCmp2MovTestCmp 1',hp1);
  4202. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,usedregs);
  4203. Result := True;
  4204. Exit;
  4205. end;
  4206. if DoMovCmpMemOpt(p, hp1, True) then
  4207. begin
  4208. Result := True;
  4209. Exit;
  4210. end;
  4211. end;
  4212. if MatchInstruction(hp1,A_LEA,[S_L{$ifdef x86_64},S_Q{$endif x86_64}]) and
  4213. { If the flags register is in use, don't change the instruction to an
  4214. ADD otherwise this will scramble the flags. [Kit] }
  4215. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  4216. begin
  4217. if MatchOpType(Taicpu(p),top_ref,top_reg) and
  4218. ((MatchReference(Taicpu(hp1).oper[0]^.ref^,Taicpu(hp1).oper[1]^.reg,Taicpu(p).oper[1]^.reg) and
  4219. (Taicpu(hp1).oper[0]^.ref^.base<>Taicpu(p).oper[1]^.reg)
  4220. ) or
  4221. (MatchReference(Taicpu(hp1).oper[0]^.ref^,Taicpu(p).oper[1]^.reg,Taicpu(hp1).oper[1]^.reg) and
  4222. (Taicpu(hp1).oper[0]^.ref^.index<>Taicpu(p).oper[1]^.reg)
  4223. )
  4224. ) then
  4225. { mov reg1,ref
  4226. lea reg2,[reg1,reg2]
  4227. to
  4228. add reg2,ref}
  4229. begin
  4230. TransferUsedRegs(TmpUsedRegs);
  4231. { reg1 may not be used afterwards }
  4232. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs)) then
  4233. begin
  4234. Taicpu(hp1).opcode:=A_ADD;
  4235. Taicpu(hp1).oper[0]^.ref^:=Taicpu(p).oper[0]^.ref^;
  4236. DebugMsg(SPeepholeOptimization + 'MovLea2Add done',hp1);
  4237. RemoveCurrentp(p, hp1);
  4238. result:=true;
  4239. exit;
  4240. end;
  4241. end;
  4242. { If the LEA instruction can be converted into an arithmetic instruction,
  4243. it may be possible to then fold it in the next optimisation, otherwise
  4244. there's nothing more that can be optimised here. }
  4245. if not ConvertLEA(taicpu(hp1)) then
  4246. Exit;
  4247. end;
  4248. if (taicpu(p).oper[1]^.typ = top_reg) and
  4249. (hp1.typ = ait_instruction) and
  4250. GetNextInstruction(hp1, hp2) and
  4251. MatchInstruction(hp2,A_MOV,[]) and
  4252. (SuperRegistersEqual(taicpu(hp2).oper[0]^.reg,taicpu(p).oper[1]^.reg)) and
  4253. (topsize2memsize[taicpu(hp1).opsize]>=topsize2memsize[taicpu(hp2).opsize]) and
  4254. (
  4255. IsFoldableArithOp(taicpu(hp1), taicpu(p).oper[1]^.reg)
  4256. {$ifdef x86_64}
  4257. or
  4258. (
  4259. (taicpu(p).opsize=S_L) and (taicpu(hp1).opsize=S_Q) and (taicpu(hp2).opsize=S_L) and
  4260. IsFoldableArithOp(taicpu(hp1), newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[1]^.reg),R_SUBQ))
  4261. )
  4262. {$endif x86_64}
  4263. ) then
  4264. begin
  4265. if OpsEqual(taicpu(hp2).oper[1]^, taicpu(p).oper[0]^) and
  4266. (taicpu(hp2).oper[0]^.typ=top_reg) then
  4267. { change movsX/movzX reg/ref, reg2
  4268. add/sub/or/... reg3/$const, reg2
  4269. mov reg2 reg/ref
  4270. dealloc reg2
  4271. to
  4272. add/sub/or/... reg3/$const, reg/ref }
  4273. begin
  4274. TransferUsedRegs(TmpUsedRegs);
  4275. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4276. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  4277. If not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs)) then
  4278. begin
  4279. { by example:
  4280. movswl %si,%eax movswl %si,%eax p
  4281. decl %eax addl %edx,%eax hp1
  4282. movw %ax,%si movw %ax,%si hp2
  4283. ->
  4284. movswl %si,%eax movswl %si,%eax p
  4285. decw %eax addw %edx,%eax hp1
  4286. movw %ax,%si movw %ax,%si hp2
  4287. }
  4288. DebugMsg(SPeepholeOptimization + 'MovOpMov2Op ('+
  4289. debug_op2str(taicpu(p).opcode)+debug_opsize2str(taicpu(p).opsize)+' '+
  4290. debug_op2str(taicpu(hp1).opcode)+debug_opsize2str(taicpu(hp1).opsize)+' '+
  4291. debug_op2str(taicpu(hp2).opcode)+debug_opsize2str(taicpu(hp2).opsize)+')',p);
  4292. taicpu(hp1).changeopsize(taicpu(hp2).opsize);
  4293. {
  4294. ->
  4295. movswl %si,%eax movswl %si,%eax p
  4296. decw %si addw %dx,%si hp1
  4297. movw %ax,%si movw %ax,%si hp2
  4298. }
  4299. case taicpu(hp1).ops of
  4300. 1:
  4301. begin
  4302. taicpu(hp1).loadoper(0, taicpu(hp2).oper[1]^);
  4303. if taicpu(hp1).oper[0]^.typ=top_reg then
  4304. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4305. end;
  4306. 2:
  4307. begin
  4308. taicpu(hp1).loadoper(1, taicpu(hp2).oper[1]^);
  4309. if (taicpu(hp1).oper[0]^.typ=top_reg) and
  4310. (taicpu(hp1).opcode<>A_SHL) and
  4311. (taicpu(hp1).opcode<>A_SHR) and
  4312. (taicpu(hp1).opcode<>A_SAR) then
  4313. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4314. end;
  4315. else
  4316. internalerror(2008042701);
  4317. end;
  4318. {
  4319. ->
  4320. decw %si addw %dx,%si p
  4321. }
  4322. RemoveInstruction(hp2);
  4323. RemoveCurrentP(p, hp1);
  4324. Result:=True;
  4325. Exit;
  4326. end;
  4327. end;
  4328. if MatchOpType(taicpu(hp2),top_reg,top_reg) and
  4329. not(SuperRegistersEqual(taicpu(hp1).oper[0]^.reg,taicpu(hp2).oper[1]^.reg)) and
  4330. ((topsize2memsize[taicpu(hp1).opsize]<= topsize2memsize[taicpu(hp2).opsize]) or
  4331. { opsize matters for these opcodes, we could probably work around this, but it is not worth the effort }
  4332. ((taicpu(hp1).opcode<>A_SHL) and (taicpu(hp1).opcode<>A_SHR) and (taicpu(hp1).opcode<>A_SAR))
  4333. )
  4334. {$ifdef i386}
  4335. { byte registers of esi, edi, ebp, esp are not available on i386 }
  4336. and ((taicpu(hp2).opsize<>S_B) or not(getsupreg(taicpu(hp1).oper[0]^.reg) in [RS_ESI,RS_EDI,RS_EBP,RS_ESP]))
  4337. and ((taicpu(hp2).opsize<>S_B) or not(getsupreg(taicpu(p).oper[0]^.reg) in [RS_ESI,RS_EDI,RS_EBP,RS_ESP]))
  4338. {$endif i386}
  4339. then
  4340. { change movsX/movzX reg/ref, reg2
  4341. add/sub/or/... regX/$const, reg2
  4342. mov reg2, reg3
  4343. dealloc reg2
  4344. to
  4345. movsX/movzX reg/ref, reg3
  4346. add/sub/or/... reg3/$const, reg3
  4347. }
  4348. begin
  4349. TransferUsedRegs(TmpUsedRegs);
  4350. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4351. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  4352. If not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs)) then
  4353. begin
  4354. { by example:
  4355. movswl %si,%eax movswl %si,%eax p
  4356. decl %eax addl %edx,%eax hp1
  4357. movw %ax,%si movw %ax,%si hp2
  4358. ->
  4359. movswl %si,%eax movswl %si,%eax p
  4360. decw %eax addw %edx,%eax hp1
  4361. movw %ax,%si movw %ax,%si hp2
  4362. }
  4363. DebugMsg(SPeepholeOptimization + 'MovOpMov2MovOp ('+
  4364. debug_op2str(taicpu(p).opcode)+debug_opsize2str(taicpu(p).opsize)+' '+
  4365. debug_op2str(taicpu(hp1).opcode)+debug_opsize2str(taicpu(hp1).opsize)+' '+
  4366. debug_op2str(taicpu(hp2).opcode)+debug_opsize2str(taicpu(hp2).opsize)+')',p);
  4367. { limit size of constants as well to avoid assembler errors, but
  4368. check opsize to avoid overflow when left shifting the 1 }
  4369. if (taicpu(p).oper[0]^.typ=top_const) and (topsize2memsize[taicpu(hp2).opsize]<=63) then
  4370. taicpu(p).oper[0]^.val:=taicpu(p).oper[0]^.val and ((qword(1) shl topsize2memsize[taicpu(hp2).opsize])-1);
  4371. {$ifdef x86_64}
  4372. { Be careful of, for example:
  4373. movl %reg1,%reg2
  4374. addl %reg3,%reg2
  4375. movq %reg2,%reg4
  4376. This will cause problems if the upper 32-bits of %reg3 or %reg4 are non-zero
  4377. }
  4378. if (taicpu(hp1).opsize = S_L) and (taicpu(hp2).opsize = S_Q) then
  4379. begin
  4380. taicpu(hp2).changeopsize(S_L);
  4381. setsubreg(taicpu(hp2).oper[0]^.reg, R_SUBD);
  4382. setsubreg(taicpu(hp2).oper[1]^.reg, R_SUBD);
  4383. end;
  4384. {$endif x86_64}
  4385. taicpu(hp1).changeopsize(taicpu(hp2).opsize);
  4386. taicpu(p).changeopsize(taicpu(hp2).opsize);
  4387. if taicpu(p).oper[0]^.typ=top_reg then
  4388. setsubreg(taicpu(p).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4389. taicpu(p).loadoper(1, taicpu(hp2).oper[1]^);
  4390. AllocRegBetween(taicpu(p).oper[1]^.reg,p,hp1,usedregs);
  4391. {
  4392. ->
  4393. movswl %si,%eax movswl %si,%eax p
  4394. decw %si addw %dx,%si hp1
  4395. movw %ax,%si movw %ax,%si hp2
  4396. }
  4397. case taicpu(hp1).ops of
  4398. 1:
  4399. begin
  4400. taicpu(hp1).loadoper(0, taicpu(hp2).oper[1]^);
  4401. if taicpu(hp1).oper[0]^.typ=top_reg then
  4402. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4403. end;
  4404. 2:
  4405. begin
  4406. taicpu(hp1).loadoper(1, taicpu(hp2).oper[1]^);
  4407. if (taicpu(hp1).oper[0]^.typ=top_reg) and
  4408. (taicpu(hp1).opcode<>A_SHL) and
  4409. (taicpu(hp1).opcode<>A_SHR) and
  4410. (taicpu(hp1).opcode<>A_SAR) then
  4411. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4412. end;
  4413. else
  4414. internalerror(2018111801);
  4415. end;
  4416. {
  4417. ->
  4418. decw %si addw %dx,%si p
  4419. }
  4420. RemoveInstruction(hp2);
  4421. end;
  4422. end;
  4423. end;
  4424. if MatchInstruction(hp1,A_BTS,A_BTR,[Taicpu(p).opsize]) and
  4425. GetNextInstruction(hp1, hp2) and
  4426. MatchInstruction(hp2,A_OR,[Taicpu(p).opsize]) and
  4427. MatchOperand(Taicpu(p).oper[0]^,0) and
  4428. (Taicpu(p).oper[1]^.typ = top_reg) and
  4429. MatchOperand(Taicpu(p).oper[1]^,Taicpu(hp1).oper[1]^) and
  4430. MatchOperand(Taicpu(p).oper[1]^,Taicpu(hp2).oper[1]^) then
  4431. { mov reg1,0
  4432. bts reg1,operand1 --> mov reg1,operand2
  4433. or reg1,operand2 bts reg1,operand1}
  4434. begin
  4435. Taicpu(hp2).opcode:=A_MOV;
  4436. DebugMsg(SPeepholeOptimization + 'MovBtsOr2MovBts done',hp1);
  4437. asml.remove(hp1);
  4438. insertllitem(hp2,hp2.next,hp1);
  4439. RemoveCurrentp(p, hp1);
  4440. Result:=true;
  4441. exit;
  4442. end;
  4443. if MatchInstruction(hp1,A_SUB,[Taicpu(p).opsize]) and
  4444. MatchOperand(Taicpu(p).oper[1]^,Taicpu(hp1).oper[1]^) and
  4445. GetNextInstruction(hp1, hp2) and
  4446. MatchInstruction(hp2,A_CMP,[Taicpu(p).opsize]) and
  4447. MatchOperand(Taicpu(p).oper[0]^,Taicpu(hp2).oper[1]^) and
  4448. MatchOperand(Taicpu(hp1).oper[0]^,Taicpu(hp2).oper[0]^) then
  4449. { change
  4450. mov reg1,reg2
  4451. sub reg3,reg2
  4452. cmp reg3,reg1
  4453. into
  4454. mov reg1,reg2
  4455. sub reg3,reg2
  4456. }
  4457. begin
  4458. DebugMsg(SPeepholeOptimization + 'MovSubCmp2MovSub done',p);
  4459. RemoveInstruction(hp2);
  4460. Result:=true;
  4461. exit;
  4462. end;
  4463. {
  4464. mov ref,reg0
  4465. <op> reg0,reg1
  4466. dealloc reg0
  4467. to
  4468. <op> ref,reg1
  4469. }
  4470. if MatchOpType(taicpu(p),top_ref,top_reg) and
  4471. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  4472. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  4473. MatchInstruction(hp1,[A_AND,A_OR,A_XOR,A_ADD,A_SUB,A_CMP],[Taicpu(p).opsize]) and
  4474. not(MatchOperand(taicpu(hp1).oper[0]^,taicpu(hp1).oper[1]^)) and
  4475. RegEndOfLife(taicpu(p).oper[1]^.reg,taicpu(hp1)) then
  4476. begin
  4477. taicpu(hp1).loadoper(0,taicpu(p).oper[0]^);
  4478. DebugMsg(SPeepholeOptimization + 'MovOp2Op done',hp1);
  4479. RemoveCurrentp(p, hp1);
  4480. Result:=true;
  4481. exit;
  4482. end;
  4483. if (taicpu(p).oper[0]^.typ = top_ref) and { Second operand will be a register }
  4484. MatchInstruction(hp1, A_SHR, A_SAR, [taicpu(p).opsize]) and
  4485. MatchOpType(taicpu(hp1), top_const, top_reg) and
  4486. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  4487. begin
  4488. RegName1 := debug_regname(taicpu(hp1).oper[1]^.reg);
  4489. {$ifdef x86_64}
  4490. { Convert:
  4491. movq x(ref),%reg64
  4492. shrq y,%reg64
  4493. To:
  4494. movl x+4(ref),%reg32
  4495. shrl y-32,%reg32 (Remove if y = 32)
  4496. }
  4497. if (taicpu(p).opsize = S_Q) and
  4498. (taicpu(hp1).opcode = A_SHR) and
  4499. (taicpu(hp1).oper[0]^.val >= 32) then
  4500. begin
  4501. PreMessage := 'movq ' + debug_operstr(taicpu(p).oper[0]^) + ',' + RegName1 + '; ' +
  4502. 'shrq $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + RegName1 + ' -> movl ';
  4503. { Convert to 32-bit }
  4504. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  4505. taicpu(p).opsize := S_L;
  4506. Inc(taicpu(p).oper[0]^.ref^.offset, 4);
  4507. PreMessage := PreMessage + debug_operstr(taicpu(p).oper[0]^) + ',' + debug_regname(taicpu(p).oper[1]^.reg);
  4508. if (taicpu(hp1).oper[0]^.val = 32) then
  4509. begin
  4510. DebugMsg(SPeepholeOptimization + PreMessage + ' (MovShr2Mov)', p);
  4511. RemoveInstruction(hp1);
  4512. end
  4513. else
  4514. begin
  4515. { This will potentially open up more arithmetic operations since
  4516. the peephole optimizer now has a big hint that only the lower
  4517. 32 bits are currently in use (and opcodes are smaller in size) }
  4518. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  4519. taicpu(hp1).opsize := S_L;
  4520. Dec(taicpu(hp1).oper[0]^.val, 32);
  4521. DebugMsg(SPeepholeOptimization + PreMessage +
  4522. '; shrl $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + debug_regname(taicpu(hp1).oper[1]^.reg) + ' (MovShr2MovShr)', p);
  4523. end;
  4524. Result := True;
  4525. Exit;
  4526. end;
  4527. {$endif x86_64}
  4528. { Convert:
  4529. movl x(ref),%reg
  4530. shrl $24,%reg
  4531. To:
  4532. movzbl x+3(ref),%reg
  4533. Do similar things for movl; shrl $16 -> movzwl and movw; shrw $8 -> movzbw
  4534. Also accept sar instead of shr, but convert to movsx instead of movzx
  4535. }
  4536. if taicpu(hp1).opcode = A_SHR then
  4537. MovUnaligned := A_MOVZX
  4538. else
  4539. MovUnaligned := A_MOVSX;
  4540. NewSize := S_NO;
  4541. NewOffset := 0;
  4542. case taicpu(p).opsize of
  4543. S_B:
  4544. { No valid combinations };
  4545. S_W:
  4546. if (taicpu(hp1).oper[0]^.val = 8) then
  4547. begin
  4548. NewSize := S_BW;
  4549. NewOffset := 1;
  4550. end;
  4551. S_L:
  4552. case taicpu(hp1).oper[0]^.val of
  4553. 16:
  4554. begin
  4555. NewSize := S_WL;
  4556. NewOffset := 2;
  4557. end;
  4558. 24:
  4559. begin
  4560. NewSize := S_BL;
  4561. NewOffset := 3;
  4562. end;
  4563. else
  4564. ;
  4565. end;
  4566. {$ifdef x86_64}
  4567. S_Q:
  4568. case taicpu(hp1).oper[0]^.val of
  4569. 32:
  4570. begin
  4571. if taicpu(hp1).opcode = A_SAR then
  4572. begin
  4573. { 32-bit to 64-bit is a distinct instruction }
  4574. MovUnaligned := A_MOVSXD;
  4575. NewSize := S_LQ;
  4576. NewOffset := 4;
  4577. end
  4578. else
  4579. { Should have been handled by MovShr2Mov above }
  4580. InternalError(2022081811);
  4581. end;
  4582. 48:
  4583. begin
  4584. NewSize := S_WQ;
  4585. NewOffset := 6;
  4586. end;
  4587. 56:
  4588. begin
  4589. NewSize := S_BQ;
  4590. NewOffset := 7;
  4591. end;
  4592. else
  4593. ;
  4594. end;
  4595. {$endif x86_64}
  4596. else
  4597. InternalError(2022081810);
  4598. end;
  4599. if (NewSize <> S_NO) and
  4600. (taicpu(p).oper[0]^.ref^.offset <= $7FFFFFFF - NewOffset) then
  4601. begin
  4602. PreMessage := 'mov' + debug_opsize2str(taicpu(p).opsize) + ' ' + debug_operstr(taicpu(p).oper[0]^) + ',' + RegName1 + '; ' +
  4603. 'shr' + debug_opsize2str(taicpu(p).opsize) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + RegName1 + ' -> ' +
  4604. debug_op2str(MovUnaligned);
  4605. {$ifdef x86_64}
  4606. if MovUnaligned <> A_MOVSXD then
  4607. { Don't add size suffix for MOVSXD }
  4608. {$endif x86_64}
  4609. PreMessage := PreMessage + debug_opsize2str(NewSize);
  4610. Inc(taicpu(p).oper[0]^.ref^.offset, NewOffset);
  4611. taicpu(p).opcode := MovUnaligned;
  4612. taicpu(p).opsize := NewSize;
  4613. DebugMsg(SPeepholeOptimization + PreMessage + ' ' +
  4614. debug_operstr(taicpu(p).oper[0]^) + ',' + debug_regname(taicpu(hp1).oper[1]^.reg) + ' (MovShr/Sar2Movx)', p);
  4615. RemoveInstruction(hp1);
  4616. Result := True;
  4617. Exit;
  4618. end;
  4619. end;
  4620. { Backward optimisation shared with OptPass2MOV }
  4621. if FuncMov2Func(p, hp1) then
  4622. begin
  4623. Result := True;
  4624. Exit;
  4625. end;
  4626. end;
  4627. function TX86AsmOptimizer.OptPass1MOVXX(var p : tai) : boolean;
  4628. var
  4629. hp1 : tai;
  4630. begin
  4631. Result:=false;
  4632. if taicpu(p).ops <> 2 then
  4633. exit;
  4634. if (MatchOpType(taicpu(p),top_reg,top_reg) and GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg)) or
  4635. GetNextInstruction(p,hp1) then
  4636. begin
  4637. if MatchInstruction(hp1,taicpu(p).opcode,[taicpu(p).opsize]) and
  4638. (taicpu(hp1).ops = 2) then
  4639. begin
  4640. if (taicpu(hp1).oper[0]^.typ = taicpu(p).oper[1]^.typ) and
  4641. (taicpu(hp1).oper[1]^.typ = taicpu(p).oper[0]^.typ) then
  4642. { movXX reg1, mem1 or movXX mem1, reg1
  4643. movXX mem2, reg2 movXX reg2, mem2}
  4644. begin
  4645. if OpsEqual(taicpu(hp1).oper[1]^,taicpu(p).oper[0]^) then
  4646. { movXX reg1, mem1 or movXX mem1, reg1
  4647. movXX mem2, reg1 movXX reg2, mem1}
  4648. begin
  4649. if OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  4650. begin
  4651. { Removes the second statement from
  4652. movXX reg1, mem1/reg2
  4653. movXX mem1/reg2, reg1
  4654. }
  4655. if taicpu(p).oper[0]^.typ=top_reg then
  4656. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,usedregs);
  4657. { Removes the second statement from
  4658. movXX mem1/reg1, reg2
  4659. movXX reg2, mem1/reg1
  4660. }
  4661. if (taicpu(p).oper[1]^.typ=top_reg) and
  4662. not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,UsedRegs)) then
  4663. begin
  4664. DebugMsg(SPeepholeOptimization + 'MovXXMovXX2Nop 1 done',p);
  4665. RemoveInstruction(hp1);
  4666. RemoveCurrentp(p); { p will now be equal to the instruction that follows what was hp1 }
  4667. Result:=true;
  4668. exit;
  4669. end
  4670. else if (taicpu(hp1).oper[1]^.typ<>top_ref) or (not(vol_write in taicpu(hp1).oper[1]^.ref^.volatility)) and
  4671. (taicpu(hp1).oper[0]^.typ<>top_ref) or (not(vol_read in taicpu(hp1).oper[0]^.ref^.volatility)) then
  4672. begin
  4673. DebugMsg(SPeepholeOptimization + 'MovXXMovXX2MoVXX 1 done',p);
  4674. RemoveInstruction(hp1);
  4675. Result:=true;
  4676. exit;
  4677. end;
  4678. end
  4679. end;
  4680. end;
  4681. end;
  4682. end;
  4683. end;
  4684. function TX86AsmOptimizer.OptPass1OP(var p : tai) : boolean;
  4685. var
  4686. hp1 : tai;
  4687. begin
  4688. result:=false;
  4689. { replace
  4690. <Op>X %mreg1,%mreg2 // Op in [ADD,MUL]
  4691. MovX %mreg2,%mreg1
  4692. dealloc %mreg2
  4693. by
  4694. <Op>X %mreg2,%mreg1
  4695. ?
  4696. }
  4697. if GetNextInstruction(p,hp1) and
  4698. { we mix single and double opperations here because we assume that the compiler
  4699. generates vmovapd only after double operations and vmovaps only after single operations }
  4700. MatchInstruction(hp1,A_MOVAPD,A_MOVAPS,[S_NO]) and
  4701. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  4702. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[1]^) and
  4703. (taicpu(p).oper[0]^.typ=top_reg) then
  4704. begin
  4705. TransferUsedRegs(TmpUsedRegs);
  4706. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4707. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  4708. begin
  4709. taicpu(p).loadoper(0,taicpu(hp1).oper[0]^);
  4710. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  4711. DebugMsg(SPeepholeOptimization + 'OpMov2Op done',p);
  4712. RemoveInstruction(hp1);
  4713. result:=true;
  4714. end;
  4715. end;
  4716. end;
  4717. function TX86AsmOptimizer.OptPass1Test(var p: tai) : boolean;
  4718. var
  4719. hp1, p_label, p_dist, hp1_dist: tai;
  4720. JumpLabel, JumpLabel_dist: TAsmLabel;
  4721. FirstValue, SecondValue: TCGInt;
  4722. TempBool: Boolean;
  4723. begin
  4724. Result := False;
  4725. if (taicpu(p).oper[0]^.typ = top_const) and
  4726. (taicpu(p).oper[0]^.val <> -1) then
  4727. begin
  4728. { Convert unsigned maximum constants to -1 to aid optimisation }
  4729. case taicpu(p).opsize of
  4730. S_B:
  4731. if (taicpu(p).oper[0]^.val and $FF) = $FF then
  4732. begin
  4733. taicpu(p).oper[0]^.val := -1;
  4734. Result := True;
  4735. Exit;
  4736. end;
  4737. S_W:
  4738. if (taicpu(p).oper[0]^.val and $FFFF) = $FFFF then
  4739. begin
  4740. taicpu(p).oper[0]^.val := -1;
  4741. Result := True;
  4742. Exit;
  4743. end;
  4744. S_L:
  4745. if (taicpu(p).oper[0]^.val and $FFFFFFFF) = $FFFFFFFF then
  4746. begin
  4747. taicpu(p).oper[0]^.val := -1;
  4748. Result := True;
  4749. Exit;
  4750. end;
  4751. {$ifdef x86_64}
  4752. S_Q:
  4753. { Storing anything greater than $7FFFFFFF is not possible so do
  4754. nothing };
  4755. {$endif x86_64}
  4756. else
  4757. InternalError(2021121001);
  4758. end;
  4759. end;
  4760. if GetNextInstruction(p, hp1) and
  4761. TrySwapMovCmp(p, hp1) then
  4762. begin
  4763. Result := True;
  4764. Exit;
  4765. end;
  4766. if MatchInstruction(hp1, A_Jcc, []) then
  4767. begin
  4768. TempBool := True;
  4769. if DoJumpOptimizations(hp1, TempBool) or
  4770. not TempBool then
  4771. begin
  4772. Result := True;
  4773. if Assigned(hp1) then
  4774. begin
  4775. if (hp1.typ in [ait_align]) then
  4776. SkipAligns(hp1, hp1);
  4777. { CollapseZeroDistJump will be set to the label after the
  4778. jump if it optimises, whether or not it's live or dead }
  4779. if (hp1.typ in [ait_label]) and
  4780. not (tai_label(hp1).labsym.is_used) then
  4781. GetNextInstruction(hp1, hp1);
  4782. end;
  4783. TransferUsedRegs(TmpUsedRegs);
  4784. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  4785. if not Assigned(hp1) or
  4786. (
  4787. not MatchInstruction(hp1, A_Jcc, A_SETcc, A_CMOVcc, []) and
  4788. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)
  4789. ) then
  4790. begin
  4791. { No more conditional jumps; conditional statement is no longer required }
  4792. DebugMsg(SPeepholeOptimization + 'Removed unnecessary condition (Test2Nop)', p);
  4793. RemoveCurrentP(p);
  4794. end;
  4795. Exit;
  4796. end;
  4797. end;
  4798. { Search for:
  4799. test $x,(reg/ref)
  4800. jne @lbl1
  4801. test $y,(reg/ref) (same register or reference)
  4802. jne @lbl1
  4803. Change to:
  4804. test $(x or y),(reg/ref)
  4805. jne @lbl1
  4806. (Note, this doesn't work with je instead of jne)
  4807. Also catch cases where "cmp $0,(reg/ref)" and "test %reg,%reg" are used.
  4808. Also search for:
  4809. test $x,(reg/ref)
  4810. je @lbl1
  4811. test $y,(reg/ref)
  4812. je/jne @lbl2
  4813. If (x or y) = x, then the second jump is deterministic
  4814. }
  4815. if (
  4816. (
  4817. (taicpu(p).oper[0]^.typ = top_const) or
  4818. (
  4819. { test %reg,%reg can be considered equivalent to test, -1,%reg }
  4820. (taicpu(p).oper[0]^.typ = top_reg) and
  4821. MatchOperand(taicpu(p).oper[1]^, taicpu(p).oper[0]^.reg)
  4822. )
  4823. ) and
  4824. MatchInstruction(hp1, A_JCC, [])
  4825. ) then
  4826. begin
  4827. if (taicpu(p).oper[0]^.typ = top_reg) and
  4828. MatchOperand(taicpu(p).oper[1]^, taicpu(p).oper[0]^.reg) then
  4829. FirstValue := -1
  4830. else
  4831. FirstValue := taicpu(p).oper[0]^.val;
  4832. { If we have several test/jne's in a row, it might be the case that
  4833. the second label doesn't go to the same location, but the one
  4834. after it might (e.g. test; jne @lbl1; test; jne @lbl2; test @lbl1),
  4835. so accommodate for this with a while loop.
  4836. }
  4837. hp1_dist := hp1;
  4838. if GetNextInstruction(hp1, p_dist) and
  4839. (p_dist.typ = ait_instruction) and
  4840. (
  4841. (
  4842. (taicpu(p_dist).opcode = A_TEST) and
  4843. (
  4844. (taicpu(p_dist).oper[0]^.typ = top_const) or
  4845. { test %reg,%reg can be considered equivalent to test, -1,%reg }
  4846. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p_dist).oper[0]^)
  4847. )
  4848. ) or
  4849. (
  4850. { cmp 0,%reg = test %reg,%reg }
  4851. (taicpu(p_dist).opcode = A_CMP) and
  4852. MatchOperand(taicpu(p_dist).oper[0]^, 0)
  4853. )
  4854. ) and
  4855. { Make sure the destination operands are actually the same }
  4856. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p).oper[1]^) and
  4857. GetNextInstruction(p_dist, hp1_dist) and
  4858. MatchInstruction(hp1_dist, A_JCC, []) then
  4859. begin
  4860. if
  4861. (taicpu(p_dist).opcode = A_CMP) { constant will be zero } or
  4862. (
  4863. (taicpu(p_dist).oper[0]^.typ = top_reg) and
  4864. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p_dist).oper[0]^.reg)
  4865. ) then
  4866. SecondValue := -1
  4867. else
  4868. SecondValue := taicpu(p_dist).oper[0]^.val;
  4869. { If both of the TEST constants are identical, delete the second
  4870. TEST that is unnecessary. }
  4871. if (FirstValue = SecondValue) then
  4872. begin
  4873. DebugMsg(SPeepholeOptimization + 'TEST/Jcc/TEST; removed superfluous TEST', p_dist);
  4874. RemoveInstruction(p_dist);
  4875. { Don't let the flags register become deallocated and reallocated between the jumps }
  4876. AllocRegBetween(NR_DEFAULTFLAGS, hp1, hp1_dist, UsedRegs);
  4877. Result := True;
  4878. if condition_in(taicpu(hp1_dist).condition, taicpu(hp1).condition) then
  4879. begin
  4880. { Since the second jump's condition is a subset of the first, we
  4881. know it will never branch because the first jump dominates it.
  4882. Get it out of the way now rather than wait for the jump
  4883. optimisations for a speed boost. }
  4884. if IsJumpToLabel(taicpu(hp1_dist)) then
  4885. TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol).DecRefs;
  4886. DebugMsg(SPeepholeOptimization + 'Removed dominated jump (via TEST/Jcc/TEST)', hp1_dist);
  4887. RemoveInstruction(hp1_dist);
  4888. end
  4889. else if condition_in(inverse_cond(taicpu(hp1).condition), taicpu(hp1_dist).condition) then
  4890. begin
  4891. { If the inverse of the first condition is a subset of the second,
  4892. the second one will definitely branch if the first one doesn't }
  4893. DebugMsg(SPeepholeOptimization + 'Conditional jump will always branch (via TEST/Jcc/TEST)', hp1_dist);
  4894. MakeUnconditional(taicpu(hp1_dist));
  4895. RemoveDeadCodeAfterJump(hp1_dist);
  4896. end;
  4897. Exit;
  4898. end;
  4899. if (taicpu(hp1).condition in [C_NE, C_NZ]) and
  4900. (taicpu(hp1_dist).condition in [C_NE, C_NZ]) and
  4901. { If the first instruction is test %reg,%reg or test $-1,%reg,
  4902. then the second jump will never branch, so it can also be
  4903. removed regardless of where it goes }
  4904. (
  4905. (FirstValue = -1) or
  4906. (SecondValue = -1) or
  4907. MatchOperand(taicpu(hp1_dist).oper[0]^, taicpu(hp1).oper[0]^)
  4908. ) then
  4909. begin
  4910. { Same jump location... can be a register since nothing's changed }
  4911. { If any of the entries are equivalent to test %reg,%reg, then the
  4912. merged $(x or y) is also test %reg,%reg / test $-1,%reg }
  4913. taicpu(p).loadconst(0, FirstValue or SecondValue);
  4914. if IsJumpToLabel(taicpu(hp1_dist)) then
  4915. TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol).DecRefs;
  4916. DebugMsg(SPeepholeOptimization + 'TEST/JNE/TEST/JNE merged', p);
  4917. RemoveInstruction(hp1_dist);
  4918. { Only remove the second test if no jumps or other conditional instructions follow }
  4919. TransferUsedRegs(TmpUsedRegs);
  4920. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  4921. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  4922. if not RegUsedAfterInstruction(NR_DEFAULTFLAGS, p_dist, TmpUsedRegs) then
  4923. RemoveInstruction(p_dist);
  4924. Result := True;
  4925. Exit;
  4926. end;
  4927. end;
  4928. end;
  4929. { Search for:
  4930. test %reg,%reg
  4931. j(c1) @lbl1
  4932. ...
  4933. @lbl:
  4934. test %reg,%reg (same register)
  4935. j(c2) @lbl2
  4936. If c2 is a subset of c1, change to:
  4937. test %reg,%reg
  4938. j(c1) @lbl2
  4939. (@lbl1 may become a dead label as a result)
  4940. }
  4941. if (taicpu(p).oper[1]^.typ = top_reg) and
  4942. (taicpu(p).oper[0]^.typ = top_reg) and
  4943. (taicpu(p).oper[0]^.reg = taicpu(p).oper[1]^.reg) and
  4944. MatchInstruction(hp1, A_JCC, []) and
  4945. IsJumpToLabel(taicpu(hp1)) then
  4946. begin
  4947. JumpLabel := TAsmLabel(taicpu(hp1).oper[0]^.ref^.symbol);
  4948. p_label := nil;
  4949. if Assigned(JumpLabel) then
  4950. p_label := getlabelwithsym(JumpLabel);
  4951. if Assigned(p_label) and
  4952. GetNextInstruction(p_label, p_dist) and
  4953. MatchInstruction(p_dist, A_TEST, []) and
  4954. { It's fine if the second test uses smaller sub-registers }
  4955. (taicpu(p_dist).opsize <= taicpu(p).opsize) and
  4956. MatchOpType(taicpu(p_dist), top_reg, top_reg) and
  4957. SuperRegistersEqual(taicpu(p_dist).oper[0]^.reg, taicpu(p).oper[0]^.reg) and
  4958. SuperRegistersEqual(taicpu(p_dist).oper[1]^.reg, taicpu(p).oper[1]^.reg) and
  4959. GetNextInstruction(p_dist, hp1_dist) and
  4960. MatchInstruction(hp1_dist, A_JCC, []) then { This doesn't have to be an explicit label }
  4961. begin
  4962. JumpLabel_dist := TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol);
  4963. if JumpLabel = JumpLabel_dist then
  4964. { This is an infinite loop }
  4965. Exit;
  4966. { Best optimisation when the first condition is a subset (or equal) of the second }
  4967. if condition_in(taicpu(hp1).condition, taicpu(hp1_dist).condition) then
  4968. begin
  4969. { Any registers used here will already be allocated }
  4970. if Assigned(JumpLabel) then
  4971. JumpLabel.DecRefs;
  4972. DebugMsg(SPeepholeOptimization + 'TEST/Jcc/@Lbl/TEST/Jcc -> TEST/Jcc, redirecting first jump', hp1);
  4973. taicpu(hp1).loadref(0, taicpu(hp1_dist).oper[0]^.ref^); { This also increases the reference count }
  4974. Result := True;
  4975. Exit;
  4976. end;
  4977. end;
  4978. end;
  4979. end;
  4980. function TX86AsmOptimizer.OptPass1Add(var p : tai) : boolean;
  4981. var
  4982. hp1, hp2: tai;
  4983. ActiveReg: TRegister;
  4984. OldOffset: asizeint;
  4985. ThisConst: TCGInt;
  4986. function RegDeallocated: Boolean;
  4987. begin
  4988. TransferUsedRegs(TmpUsedRegs);
  4989. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4990. Result := not(RegUsedAfterInstruction(ActiveReg,hp1,TmpUsedRegs))
  4991. end;
  4992. begin
  4993. result:=false;
  4994. hp1 := nil;
  4995. { replace
  4996. addX const,%reg1
  4997. leaX (%reg1,%reg1,Y),%reg2 // Base or index might not be equal to reg1
  4998. dealloc %reg1
  4999. by
  5000. leaX const+const*Y(%reg1,%reg1,Y),%reg2
  5001. }
  5002. if MatchOpType(taicpu(p),top_const,top_reg) then
  5003. begin
  5004. ActiveReg := taicpu(p).oper[1]^.reg;
  5005. { Ensures the entire register was updated }
  5006. if (taicpu(p).opsize >= S_L) and
  5007. GetNextInstructionUsingReg(p,hp1, ActiveReg) and
  5008. MatchInstruction(hp1,A_LEA,[]) and
  5009. (SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.base) or
  5010. SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.index)) and
  5011. (
  5012. { Cover the case where the register in the reference is also the destination register }
  5013. Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, ActiveReg) or
  5014. (
  5015. { Try to avoid the expensive check of RegUsedAfterInstruction if we know it will return False }
  5016. not SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ActiveReg) and
  5017. RegDeallocated
  5018. )
  5019. ) then
  5020. begin
  5021. OldOffset := taicpu(hp1).oper[0]^.ref^.offset;
  5022. {$push}
  5023. {$R-}{$Q-}
  5024. { Explicitly disable overflow checking for these offset calculation
  5025. as those do not matter for the final result }
  5026. if ActiveReg=taicpu(hp1).oper[0]^.ref^.base then
  5027. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val);
  5028. if ActiveReg=taicpu(hp1).oper[0]^.ref^.index then
  5029. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val*max(taicpu(hp1).oper[0]^.ref^.scalefactor,1));
  5030. {$pop}
  5031. {$ifdef x86_64}
  5032. if (taicpu(hp1).oper[0]^.ref^.offset > $7FFFFFFF) or (taicpu(hp1).oper[0]^.ref^.offset < -2147483648) then
  5033. begin
  5034. { Overflow; abort }
  5035. taicpu(hp1).oper[0]^.ref^.offset := OldOffset;
  5036. end
  5037. else
  5038. {$endif x86_64}
  5039. begin
  5040. DebugMsg(SPeepholeOptimization + 'AddLea2Lea done',p);
  5041. if not (cs_opt_level3 in current_settings.optimizerswitches) then
  5042. { hp1 is the immediate next instruction for sure - good for a quick speed boost }
  5043. RemoveCurrentP(p, hp1)
  5044. else
  5045. RemoveCurrentP(p);
  5046. result:=true;
  5047. Exit;
  5048. end;
  5049. end;
  5050. if (
  5051. { Save calling GetNextInstructionUsingReg again }
  5052. Assigned(hp1) or
  5053. GetNextInstructionUsingReg(p,hp1, ActiveReg)
  5054. ) and
  5055. MatchInstruction(hp1,A_ADD,A_SUB,[taicpu(p).opsize]) and
  5056. (taicpu(hp1).oper[1]^.reg = ActiveReg) then
  5057. begin
  5058. if taicpu(hp1).oper[0]^.typ = top_const then
  5059. begin
  5060. { Merge add const1,%reg; add/sub const2,%reg to add const1+/-const2,%reg }
  5061. if taicpu(hp1).opcode = A_ADD then
  5062. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val
  5063. else
  5064. ThisConst := taicpu(p).oper[0]^.val - taicpu(hp1).oper[0]^.val;
  5065. Result := True;
  5066. { Handle any overflows }
  5067. case taicpu(p).opsize of
  5068. S_B:
  5069. taicpu(p).oper[0]^.val := ThisConst and $FF;
  5070. S_W:
  5071. taicpu(p).oper[0]^.val := ThisConst and $FFFF;
  5072. S_L:
  5073. taicpu(p).oper[0]^.val := ThisConst and $FFFFFFFF;
  5074. {$ifdef x86_64}
  5075. S_Q:
  5076. if (ThisConst > $7FFFFFFF) or (ThisConst < -2147483648) then
  5077. { Overflow; abort }
  5078. Result := False
  5079. else
  5080. taicpu(p).oper[0]^.val := ThisConst;
  5081. {$endif x86_64}
  5082. else
  5083. InternalError(2021102610);
  5084. end;
  5085. { Result may get set to False again if the combined immediate overflows for S_Q sizes }
  5086. if Result then
  5087. begin
  5088. if (taicpu(p).oper[0]^.val < 0) and
  5089. (
  5090. ((taicpu(p).opsize = S_B) and (taicpu(p).oper[0]^.val <> -128)) or
  5091. ((taicpu(p).opsize = S_W) and (taicpu(p).oper[0]^.val <> -32768)) or
  5092. ((taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) and (taicpu(p).oper[0]^.val <> -2147483648))
  5093. ) then
  5094. begin
  5095. DebugMsg(SPeepholeOptimization + 'ADD; ADD/SUB -> SUB',p);
  5096. taicpu(p).opcode := A_SUB;
  5097. taicpu(p).oper[0]^.val := -taicpu(p).oper[0]^.val;
  5098. end
  5099. else
  5100. DebugMsg(SPeepholeOptimization + 'ADD; ADD/SUB -> ADD',p);
  5101. RemoveInstruction(hp1);
  5102. end;
  5103. end
  5104. else
  5105. begin
  5106. { Make doubly sure the flags aren't in use because the order of additions may affect them }
  5107. TransferUsedRegs(TmpUsedRegs);
  5108. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5109. hp2 := p;
  5110. while not (cs_opt_level3 in current_settings.optimizerswitches) and
  5111. GetNextInstruction(hp2, hp2) and (hp2 <> hp1) do
  5112. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  5113. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  5114. begin
  5115. { Move the constant addition to after the reg/ref addition to improve optimisation }
  5116. DebugMsg(SPeepholeOptimization + 'Add/sub swap 1a done',p);
  5117. Asml.Remove(p);
  5118. Asml.InsertAfter(p, hp1);
  5119. p := hp1;
  5120. Result := True;
  5121. Exit;
  5122. end;
  5123. end;
  5124. end;
  5125. if DoArithCombineOpt(p) then
  5126. Result:=true;
  5127. end;
  5128. end;
  5129. function TX86AsmOptimizer.OptPass1LEA(var p : tai) : boolean;
  5130. var
  5131. hp1: tai;
  5132. ref: Integer;
  5133. saveref: treference;
  5134. Multiple: TCGInt;
  5135. Adjacent: Boolean;
  5136. begin
  5137. Result:=false;
  5138. { play save and throw an error if LEA uses a seg register prefix,
  5139. this is most likely an error somewhere else }
  5140. if taicpu(p).oper[0]^.ref^.Segment<>NR_NO then
  5141. internalerror(2022022001);
  5142. { changes "lea (%reg1), %reg2" into "mov %reg1, %reg2" }
  5143. if (taicpu(p).oper[0]^.ref^.base <> NR_NO) and
  5144. (taicpu(p).oper[0]^.ref^.index = NR_NO) and
  5145. (
  5146. { do not mess with leas accessing the stack pointer
  5147. unless it's a null operation }
  5148. (taicpu(p).oper[1]^.reg <> NR_STACK_POINTER_REG) or
  5149. (
  5150. (taicpu(p).oper[0]^.ref^.base = NR_STACK_POINTER_REG) and
  5151. (taicpu(p).oper[0]^.ref^.offset = 0)
  5152. )
  5153. ) and
  5154. (not(Assigned(taicpu(p).oper[0]^.ref^.Symbol))) then
  5155. begin
  5156. if (taicpu(p).oper[0]^.ref^.offset = 0) then
  5157. begin
  5158. if (taicpu(p).oper[0]^.ref^.base <> taicpu(p).oper[1]^.reg) then
  5159. begin
  5160. taicpu(p).opcode := A_MOV;
  5161. taicpu(p).loadreg(0, taicpu(p).oper[0]^.ref^.base);
  5162. DebugMsg(SPeepholeOptimization + 'Lea2Mov done',p);
  5163. end
  5164. else
  5165. begin
  5166. DebugMsg(SPeepholeOptimization + 'Lea2Nop done',p);
  5167. RemoveCurrentP(p);
  5168. end;
  5169. Result:=true;
  5170. exit;
  5171. end
  5172. else if (
  5173. { continue to use lea to adjust the stack pointer,
  5174. it is the recommended way, but only if not optimizing for size }
  5175. (taicpu(p).oper[1]^.reg<>NR_STACK_POINTER_REG) or
  5176. (cs_opt_size in current_settings.optimizerswitches)
  5177. ) and
  5178. { If the flags register is in use, don't change the instruction
  5179. to an ADD otherwise this will scramble the flags. [Kit] }
  5180. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  5181. ConvertLEA(taicpu(p)) then
  5182. begin
  5183. Result:=true;
  5184. exit;
  5185. end;
  5186. end;
  5187. { Don't optimise if the stack or frame pointer is the destination register }
  5188. if (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG) or (taicpu(p).oper[1]^.reg=current_procinfo.framepointer) then
  5189. Exit;
  5190. if GetNextInstruction(p,hp1) and
  5191. (hp1.typ=ait_instruction) then
  5192. begin
  5193. if MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) and
  5194. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  5195. MatchOpType(Taicpu(hp1),top_reg,top_reg) then
  5196. begin
  5197. TransferUsedRegs(TmpUsedRegs);
  5198. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5199. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  5200. begin
  5201. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  5202. DebugMsg(SPeepholeOptimization + 'LeaMov2Lea done',p);
  5203. RemoveInstruction(hp1);
  5204. result:=true;
  5205. exit;
  5206. end;
  5207. end;
  5208. { changes
  5209. lea <ref1>, reg1
  5210. <op> ...,<ref. with reg1>,...
  5211. to
  5212. <op> ...,<ref1>,... }
  5213. { find a reference which uses reg1 }
  5214. 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
  5215. ref:=0
  5216. 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
  5217. ref:=1
  5218. else
  5219. ref:=-1;
  5220. if (ref<>-1) and
  5221. { reg1 must be either the base or the index }
  5222. ((taicpu(hp1).oper[ref]^.ref^.base=taicpu(p).oper[1]^.reg) xor (taicpu(hp1).oper[ref]^.ref^.index=taicpu(p).oper[1]^.reg)) then
  5223. begin
  5224. { reg1 can be removed from the reference }
  5225. saveref:=taicpu(hp1).oper[ref]^.ref^;
  5226. if taicpu(hp1).oper[ref]^.ref^.base=taicpu(p).oper[1]^.reg then
  5227. taicpu(hp1).oper[ref]^.ref^.base:=NR_NO
  5228. else if taicpu(hp1).oper[ref]^.ref^.index=taicpu(p).oper[1]^.reg then
  5229. taicpu(hp1).oper[ref]^.ref^.index:=NR_NO
  5230. else
  5231. Internalerror(2019111201);
  5232. { check if the can insert all data of the lea into the second instruction }
  5233. if ((taicpu(hp1).oper[ref]^.ref^.base=taicpu(p).oper[1]^.reg) or (taicpu(hp1).oper[ref]^.ref^.scalefactor <= 1)) and
  5234. ((taicpu(p).oper[0]^.ref^.base=NR_NO) or (taicpu(hp1).oper[ref]^.ref^.base=NR_NO)) and
  5235. ((taicpu(p).oper[0]^.ref^.index=NR_NO) or (taicpu(hp1).oper[ref]^.ref^.index=NR_NO)) and
  5236. ((taicpu(p).oper[0]^.ref^.symbol=nil) or (taicpu(hp1).oper[ref]^.ref^.symbol=nil)) and
  5237. ((taicpu(p).oper[0]^.ref^.relsymbol=nil) or (taicpu(hp1).oper[ref]^.ref^.relsymbol=nil)) and
  5238. ((taicpu(p).oper[0]^.ref^.scalefactor <= 1) or (taicpu(hp1).oper[ref]^.ref^.scalefactor <= 1)) and
  5239. (taicpu(p).oper[0]^.ref^.segment=NR_NO) and (taicpu(hp1).oper[ref]^.ref^.segment=NR_NO)
  5240. {$ifdef x86_64}
  5241. and (abs(taicpu(hp1).oper[ref]^.ref^.offset+taicpu(p).oper[0]^.ref^.offset)<=$7fffffff)
  5242. and (((taicpu(p).oper[0]^.ref^.base<>NR_RIP) and (taicpu(p).oper[0]^.ref^.index<>NR_RIP)) or
  5243. ((taicpu(hp1).oper[ref]^.ref^.base=NR_NO) and (taicpu(hp1).oper[ref]^.ref^.index=NR_NO))
  5244. )
  5245. {$endif x86_64}
  5246. then
  5247. begin
  5248. { reg1 might not used by the second instruction after it is remove from the reference }
  5249. if not(RegInInstruction(taicpu(p).oper[1]^.reg,taicpu(hp1))) then
  5250. begin
  5251. TransferUsedRegs(TmpUsedRegs);
  5252. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5253. { reg1 is not updated so it might not be used afterwards }
  5254. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  5255. begin
  5256. DebugMsg(SPeepholeOptimization + 'LeaOp2Op done',p);
  5257. if taicpu(p).oper[0]^.ref^.base<>NR_NO then
  5258. taicpu(hp1).oper[ref]^.ref^.base:=taicpu(p).oper[0]^.ref^.base;
  5259. if taicpu(p).oper[0]^.ref^.index<>NR_NO then
  5260. taicpu(hp1).oper[ref]^.ref^.index:=taicpu(p).oper[0]^.ref^.index;
  5261. if taicpu(p).oper[0]^.ref^.symbol<>nil then
  5262. taicpu(hp1).oper[ref]^.ref^.symbol:=taicpu(p).oper[0]^.ref^.symbol;
  5263. if taicpu(p).oper[0]^.ref^.relsymbol<>nil then
  5264. taicpu(hp1).oper[ref]^.ref^.relsymbol:=taicpu(p).oper[0]^.ref^.relsymbol;
  5265. if taicpu(p).oper[0]^.ref^.scalefactor > 1 then
  5266. taicpu(hp1).oper[ref]^.ref^.scalefactor:=taicpu(p).oper[0]^.ref^.scalefactor;
  5267. inc(taicpu(hp1).oper[ref]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset);
  5268. RemoveCurrentP(p, hp1);
  5269. result:=true;
  5270. exit;
  5271. end
  5272. end;
  5273. end;
  5274. { recover }
  5275. taicpu(hp1).oper[ref]^.ref^:=saveref;
  5276. end;
  5277. Adjacent := RegInInstruction(taicpu(p).oper[1]^.reg, hp1);
  5278. if Adjacent or
  5279. { Check further ahead (up to 2 instructions ahead for -O2) }
  5280. GetNextInstructionUsingReg(hp1,hp1,taicpu(p).oper[1]^.reg) then
  5281. begin
  5282. { Check common LEA/LEA conditions }
  5283. if MatchInstruction(hp1,A_LEA,[taicpu(p).opsize]) and
  5284. (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg) and
  5285. (taicpu(p).oper[0]^.ref^.relsymbol = nil) and
  5286. (taicpu(p).oper[0]^.ref^.segment = NR_NO) and
  5287. (taicpu(p).oper[0]^.ref^.symbol = nil) and
  5288. (taicpu(hp1).oper[0]^.ref^.relsymbol = nil) and
  5289. (taicpu(hp1).oper[0]^.ref^.segment = NR_NO) and
  5290. (taicpu(hp1).oper[0]^.ref^.symbol = nil) and
  5291. (
  5292. { If p and hp1 are adjacent, RegModifiedBetween always returns False, so avoid
  5293. calling it (since it calls GetNextInstruction) }
  5294. Adjacent or
  5295. (
  5296. (
  5297. (taicpu(p).oper[0]^.ref^.base = NR_NO) or { Don't call RegModifiedBetween unnecessarily }
  5298. not(RegModifiedBetween(taicpu(p).oper[0]^.ref^.base,p,hp1))
  5299. ) and (
  5300. (taicpu(p).oper[0]^.ref^.index = taicpu(p).oper[0]^.ref^.base) or { Don't call RegModifiedBetween unnecessarily }
  5301. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5302. not(RegModifiedBetween(taicpu(p).oper[0]^.ref^.index,p,hp1))
  5303. )
  5304. )
  5305. ) then
  5306. begin
  5307. { changes
  5308. lea (regX,scale), reg1
  5309. lea offset(reg1,reg1), reg1
  5310. to
  5311. lea offset(regX,scale*2), reg1
  5312. and
  5313. lea (regX,scale1), reg1
  5314. lea offset(reg1,scale2), reg1
  5315. to
  5316. lea offset(regX,scale1*scale2), reg1
  5317. ... so long as the final scale does not exceed 8
  5318. (Similarly, allow the first instruction to be "lea (regX,regX),reg1")
  5319. }
  5320. if (taicpu(p).oper[0]^.ref^.base<>NR_STACK_POINTER_REG) and { lea (%rsp,scale),reg is not a valid encoding }
  5321. (taicpu(p).oper[0]^.ref^.offset = 0) and
  5322. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  5323. (
  5324. (
  5325. (taicpu(p).oper[0]^.ref^.base = NR_NO)
  5326. ) or (
  5327. (taicpu(p).oper[0]^.ref^.scalefactor <= 1) and
  5328. (
  5329. (taicpu(p).oper[0]^.ref^.base = taicpu(p).oper[0]^.ref^.index) and
  5330. (
  5331. { RegUsedBetween always returns False if p and hp1 are adjacent }
  5332. Adjacent or
  5333. not(RegUsedBetween(taicpu(p).oper[0]^.ref^.index, p, hp1))
  5334. )
  5335. )
  5336. )
  5337. ) and (
  5338. (
  5339. { lea (reg1,scale2), reg1 variant }
  5340. (taicpu(hp1).oper[0]^.ref^.base = NR_NO) and
  5341. (
  5342. (
  5343. (taicpu(p).oper[0]^.ref^.base = NR_NO) and
  5344. (taicpu(hp1).oper[0]^.ref^.scalefactor * taicpu(p).oper[0]^.ref^.scalefactor <= 8)
  5345. ) or (
  5346. { lea (regX,regX), reg1 variant }
  5347. (taicpu(p).oper[0]^.ref^.base <> NR_NO) and
  5348. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 4)
  5349. )
  5350. )
  5351. ) or (
  5352. { lea (reg1,reg1), reg1 variant }
  5353. (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  5354. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 1)
  5355. )
  5356. ) then
  5357. begin
  5358. DebugMsg(SPeepholeOptimization + 'LeaLea2Lea 2 done',p);
  5359. { Make everything homogeneous to make calculations easier }
  5360. if (taicpu(p).oper[0]^.ref^.base <> NR_NO) then
  5361. begin
  5362. if taicpu(p).oper[0]^.ref^.index <> NR_NO then
  5363. { Convert lea (regX,regX),reg1 to lea (regX,2),reg1 }
  5364. taicpu(p).oper[0]^.ref^.scalefactor := 2
  5365. else
  5366. taicpu(p).oper[0]^.ref^.index := taicpu(p).oper[0]^.ref^.base;
  5367. taicpu(p).oper[0]^.ref^.base := NR_NO;
  5368. end;
  5369. if (taicpu(hp1).oper[0]^.ref^.base = NR_NO) then
  5370. begin
  5371. { Just to prevent miscalculations }
  5372. if (taicpu(hp1).oper[0]^.ref^.scalefactor = 0) then
  5373. taicpu(hp1).oper[0]^.ref^.scalefactor := taicpu(p).oper[0]^.ref^.scalefactor
  5374. else
  5375. taicpu(hp1).oper[0]^.ref^.scalefactor := taicpu(hp1).oper[0]^.ref^.scalefactor * taicpu(p).oper[0]^.ref^.scalefactor;
  5376. end
  5377. else
  5378. begin
  5379. taicpu(hp1).oper[0]^.ref^.base := NR_NO;
  5380. taicpu(hp1).oper[0]^.ref^.scalefactor := taicpu(p).oper[0]^.ref^.scalefactor * 2;
  5381. end;
  5382. taicpu(hp1).oper[0]^.ref^.index := taicpu(p).oper[0]^.ref^.index;
  5383. RemoveCurrentP(p);
  5384. result:=true;
  5385. exit;
  5386. end
  5387. { changes
  5388. lea offset1(regX), reg1
  5389. lea offset2(reg1), reg1
  5390. to
  5391. lea offset1+offset2(regX), reg1 }
  5392. else if
  5393. (
  5394. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  5395. (taicpu(p).oper[0]^.ref^.index = NR_NO)
  5396. ) or (
  5397. (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  5398. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 1) and
  5399. (
  5400. (
  5401. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5402. (taicpu(p).oper[0]^.ref^.base = NR_NO)
  5403. ) or (
  5404. (taicpu(p).oper[0]^.ref^.scalefactor <= 1) and
  5405. (
  5406. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5407. (
  5408. (taicpu(p).oper[0]^.ref^.index = taicpu(p).oper[0]^.ref^.base) and
  5409. (
  5410. (taicpu(hp1).oper[0]^.ref^.index = NR_NO) or
  5411. (taicpu(hp1).oper[0]^.ref^.base = NR_NO)
  5412. )
  5413. )
  5414. )
  5415. )
  5416. )
  5417. ) then
  5418. begin
  5419. DebugMsg(SPeepholeOptimization + 'LeaLea2Lea 1 done',p);
  5420. if taicpu(hp1).oper[0]^.ref^.index=taicpu(p).oper[1]^.reg then
  5421. begin
  5422. taicpu(hp1).oper[0]^.ref^.index:=taicpu(p).oper[0]^.ref^.base;
  5423. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset*max(taicpu(hp1).oper[0]^.ref^.scalefactor,1));
  5424. { if the register is used as index and base, we have to increase for base as well
  5425. and adapt base }
  5426. if taicpu(hp1).oper[0]^.ref^.base=taicpu(p).oper[1]^.reg then
  5427. begin
  5428. taicpu(hp1).oper[0]^.ref^.base:=taicpu(p).oper[0]^.ref^.base;
  5429. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset);
  5430. end;
  5431. end
  5432. else
  5433. begin
  5434. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset);
  5435. taicpu(hp1).oper[0]^.ref^.base:=taicpu(p).oper[0]^.ref^.base;
  5436. end;
  5437. if taicpu(p).oper[0]^.ref^.index<>NR_NO then
  5438. begin
  5439. taicpu(hp1).oper[0]^.ref^.base:=taicpu(hp1).oper[0]^.ref^.index;
  5440. taicpu(hp1).oper[0]^.ref^.index:=taicpu(p).oper[0]^.ref^.index;
  5441. taicpu(hp1).oper[0]^.ref^.scalefactor:=taicpu(p).oper[0]^.ref^.scalefactor;
  5442. end;
  5443. RemoveCurrentP(p);
  5444. result:=true;
  5445. exit;
  5446. end;
  5447. end;
  5448. { Change:
  5449. leal/q $x(%reg1),%reg2
  5450. ...
  5451. shll/q $y,%reg2
  5452. To:
  5453. leal/q $(x+2^y)(%reg1,2^y),%reg2 (if y <= 3)
  5454. }
  5455. if (taicpu(p).oper[0]^.ref^.base<>NR_STACK_POINTER_REG) and { lea (%rsp,scale),reg is not a valid encoding }
  5456. MatchInstruction(hp1, A_SHL, [taicpu(p).opsize]) and
  5457. MatchOpType(taicpu(hp1), top_const, top_reg) and
  5458. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  5459. (taicpu(hp1).oper[0]^.val <= 3) then
  5460. begin
  5461. Multiple := 1 shl taicpu(hp1).oper[0]^.val;
  5462. TransferUsedRegs(TmpUsedRegs);
  5463. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  5464. if
  5465. { This allows the optimisation in some circumstances even if the lea instruction already has a scale factor
  5466. (this works even if scalefactor is zero) }
  5467. ((Multiple * taicpu(p).oper[0]^.ref^.scalefactor) <= 8) and
  5468. { Ensure offset doesn't go out of bounds }
  5469. (abs(taicpu(p).oper[0]^.ref^.offset * Multiple) <= $7FFFFFFF) and
  5470. not (RegInUsedRegs(NR_DEFAULTFLAGS,TmpUsedRegs)) and
  5471. (
  5472. (
  5473. not SuperRegistersEqual(taicpu(p).oper[0]^.ref^.base, taicpu(p).oper[1]^.reg) and
  5474. (
  5475. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5476. (taicpu(p).oper[0]^.ref^.index = NR_INVALID) or
  5477. (
  5478. { Check for lea $x(%reg1,%reg1),%reg2 and treat as it it were lea $x(%reg1,2),%reg2 }
  5479. (taicpu(p).oper[0]^.ref^.index = taicpu(p).oper[0]^.ref^.base) and
  5480. (taicpu(p).oper[0]^.ref^.scalefactor <= 1)
  5481. )
  5482. )
  5483. ) or (
  5484. (
  5485. (taicpu(p).oper[0]^.ref^.base = NR_NO) or
  5486. (taicpu(p).oper[0]^.ref^.base = NR_INVALID)
  5487. ) and
  5488. not SuperRegistersEqual(taicpu(p).oper[0]^.ref^.index, taicpu(p).oper[1]^.reg)
  5489. )
  5490. ) then
  5491. begin
  5492. repeat
  5493. with taicpu(p).oper[0]^.ref^ do
  5494. begin
  5495. { Convert lea $x(%reg1,%reg1),%reg2 to lea $x(%reg1,2),%reg2 }
  5496. if index = base then
  5497. begin
  5498. if Multiple > 4 then
  5499. { Optimisation will no longer work because resultant
  5500. scale factor will exceed 8 }
  5501. Break;
  5502. base := NR_NO;
  5503. scalefactor := 2;
  5504. DebugMsg(SPeepholeOptimization + 'lea $x(%reg1,%reg1),%reg2 -> lea $x(%reg1,2),%reg2 for following optimisation', p);
  5505. end
  5506. else if (base <> NR_NO) and (base <> NR_INVALID) then
  5507. begin
  5508. { Scale factor only works on the index register }
  5509. index := base;
  5510. base := NR_NO;
  5511. end;
  5512. { For safety }
  5513. if scalefactor <= 1 then
  5514. begin
  5515. DebugMsg(SPeepholeOptimization + 'LeaShl2Lea 1', p);
  5516. scalefactor := Multiple;
  5517. end
  5518. else
  5519. begin
  5520. DebugMsg(SPeepholeOptimization + 'LeaShl2Lea 2', p);
  5521. scalefactor := scalefactor * Multiple;
  5522. end;
  5523. offset := offset * Multiple;
  5524. end;
  5525. RemoveInstruction(hp1);
  5526. Result := True;
  5527. Exit;
  5528. { This repeat..until loop exists for the benefit of Break }
  5529. until True;
  5530. end;
  5531. end;
  5532. end;
  5533. end;
  5534. end;
  5535. function TX86AsmOptimizer.DoArithCombineOpt(var p: tai): Boolean;
  5536. var
  5537. hp1 : tai;
  5538. SubInstr: Boolean;
  5539. ThisConst: TCGInt;
  5540. const
  5541. OverflowMin: array[S_B..S_Q] of TCGInt = (-128, -32768, -2147483648, -2147483648);
  5542. { Note: 64-bit-sized arithmetic instructions can only take signed 32-bit immediates }
  5543. OverflowMax: array[S_B..S_Q] of TCGInt = ( 255, 65535, $FFFFFFFF, 2147483647);
  5544. begin
  5545. Result := False;
  5546. if taicpu(p).oper[0]^.typ <> top_const then
  5547. { Should have been confirmed before calling }
  5548. InternalError(2021102601);
  5549. SubInstr := (taicpu(p).opcode = A_SUB);
  5550. if GetLastInstruction(p, hp1) and
  5551. (hp1.typ = ait_instruction) and
  5552. (taicpu(hp1).opsize = taicpu(p).opsize) then
  5553. begin
  5554. if not (taicpu(p).opsize in [S_B, S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  5555. { Bad size }
  5556. InternalError(2022042001);
  5557. case taicpu(hp1).opcode Of
  5558. A_INC:
  5559. if MatchOperand(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  5560. begin
  5561. if SubInstr then
  5562. ThisConst := taicpu(p).oper[0]^.val - 1
  5563. else
  5564. ThisConst := taicpu(p).oper[0]^.val + 1;
  5565. end
  5566. else
  5567. Exit;
  5568. A_DEC:
  5569. if MatchOperand(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  5570. begin
  5571. if SubInstr then
  5572. ThisConst := taicpu(p).oper[0]^.val + 1
  5573. else
  5574. ThisConst := taicpu(p).oper[0]^.val - 1;
  5575. end
  5576. else
  5577. Exit;
  5578. A_SUB:
  5579. if (taicpu(hp1).oper[0]^.typ = top_const) and
  5580. MatchOperand(taicpu(hp1).oper[1]^,taicpu(p).oper[1]^) then
  5581. begin
  5582. if SubInstr then
  5583. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val
  5584. else
  5585. ThisConst := taicpu(p).oper[0]^.val - taicpu(hp1).oper[0]^.val;
  5586. end
  5587. else
  5588. Exit;
  5589. A_ADD:
  5590. if (taicpu(hp1).oper[0]^.typ = top_const) and
  5591. MatchOperand(taicpu(hp1).oper[1]^,taicpu(p).oper[1]^) then
  5592. begin
  5593. if SubInstr then
  5594. ThisConst := taicpu(p).oper[0]^.val - taicpu(hp1).oper[0]^.val
  5595. else
  5596. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val;
  5597. end
  5598. else
  5599. Exit;
  5600. else
  5601. Exit;
  5602. end;
  5603. { Check that the values are in range }
  5604. if (ThisConst < OverflowMin[taicpu(p).opsize]) or (ThisConst > OverflowMax[taicpu(p).opsize]) then
  5605. { Overflow; abort }
  5606. Exit;
  5607. if (ThisConst = 0) then
  5608. begin
  5609. DebugMsg(SPeepholeOptimization + 'Arithmetic combine: ' +
  5610. debug_op2str(taicpu(hp1).opcode) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + debug_operstr(taicpu(hp1).oper[1]^) + '; ' +
  5611. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(taicpu(p).oper[0]^.val) + ',' + debug_operstr(taicpu(p).oper[1]^) + ' cancel out (NOP)', p);
  5612. RemoveInstruction(hp1);
  5613. hp1 := tai(p.next);
  5614. RemoveInstruction(p); { Note, the choice to not use RemoveCurrentp is deliberate }
  5615. if not GetLastInstruction(hp1, p) then
  5616. p := hp1;
  5617. end
  5618. else
  5619. begin
  5620. if taicpu(hp1).opercnt=1 then
  5621. DebugMsg(SPeepholeOptimization + 'Arithmetic combine: ' +
  5622. debug_op2str(taicpu(hp1).opcode) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + '; ' +
  5623. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(taicpu(p).oper[0]^.val) + ',' + debug_operstr(taicpu(p).oper[1]^) + ' -> ' +
  5624. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(ThisConst) + ' ' + debug_operstr(taicpu(p).oper[1]^), p)
  5625. else
  5626. DebugMsg(SPeepholeOptimization + 'Arithmetic combine: ' +
  5627. debug_op2str(taicpu(hp1).opcode) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + debug_operstr(taicpu(hp1).oper[1]^) + '; ' +
  5628. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(taicpu(p).oper[0]^.val) + ',' + debug_operstr(taicpu(p).oper[1]^) + ' -> ' +
  5629. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(ThisConst) + ' ' + debug_operstr(taicpu(p).oper[1]^), p);
  5630. RemoveInstruction(hp1);
  5631. taicpu(p).loadconst(0, ThisConst);
  5632. end;
  5633. Result := True;
  5634. end;
  5635. end;
  5636. function TX86AsmOptimizer.DoMovCmpMemOpt(var p : tai; const hp1: tai; UpdateTmpUsedRegs: Boolean) : Boolean;
  5637. begin
  5638. Result := False;
  5639. if UpdateTmpUsedRegs then
  5640. TransferUsedRegs(TmpUsedRegs);
  5641. if MatchOpType(taicpu(p),top_ref,top_reg) and
  5642. { The x86 assemblers have difficulty comparing values against absolute addresses }
  5643. (taicpu(p).oper[0]^.ref^.refaddr <> addr_full) and
  5644. (taicpu(hp1).oper[0]^.typ <> top_ref) and
  5645. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  5646. (
  5647. (
  5648. (taicpu(hp1).opcode = A_TEST)
  5649. ) or (
  5650. (taicpu(hp1).opcode = A_CMP) and
  5651. { A sanity check more than anything }
  5652. not MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg)
  5653. )
  5654. ) then
  5655. begin
  5656. { change
  5657. mov mem, %reg
  5658. cmp/test x, %reg / test %reg,%reg
  5659. (reg deallocated)
  5660. to
  5661. cmp/test x, mem / cmp 0, mem
  5662. }
  5663. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  5664. if not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) then
  5665. begin
  5666. { Convert test %reg,%reg or test $-1,%reg to cmp $0,mem }
  5667. if (taicpu(hp1).opcode = A_TEST) and
  5668. (
  5669. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) or
  5670. MatchOperand(taicpu(hp1).oper[0]^, -1)
  5671. ) then
  5672. begin
  5673. taicpu(hp1).opcode := A_CMP;
  5674. taicpu(hp1).loadconst(0, 0);
  5675. end;
  5676. taicpu(hp1).loadref(1, taicpu(p).oper[0]^.ref^);
  5677. DebugMsg(SPeepholeOptimization + 'MOV/CMP -> CMP (memory check)', p);
  5678. RemoveCurrentP(p, hp1);
  5679. Result := True;
  5680. Exit;
  5681. end;
  5682. end;
  5683. end;
  5684. function TX86AsmOptimizer.DoSETccLblRETOpt(var p: tai; const hp_label: tai_label) : Boolean;
  5685. var
  5686. hp_allocstart, hp_pos, hp2, hp3, hp4, hp5, hp6: tai;
  5687. ThisReg, SecondReg: TRegister;
  5688. JumpLoc: TAsmLabel;
  5689. NewSize: TOpSize;
  5690. begin
  5691. Result := False;
  5692. {
  5693. Convert:
  5694. j<c> .L1
  5695. .L2:
  5696. mov 1,reg
  5697. jmp .L3 (or ret, although it might not be a RET yet)
  5698. .L1:
  5699. mov 0,reg
  5700. jmp .L3 (or ret)
  5701. ( As long as .L3 <> .L1 or .L2)
  5702. To:
  5703. mov 0,reg
  5704. set<not(c)> reg
  5705. jmp .L3 (or ret)
  5706. .L2:
  5707. mov 1,reg
  5708. jmp .L3 (or ret)
  5709. .L1:
  5710. mov 0,reg
  5711. jmp .L3 (or ret)
  5712. }
  5713. if JumpTargetOp(taicpu(p))^.ref^.refaddr<>addr_full then
  5714. Exit;
  5715. JumpLoc := TAsmLabel(JumpTargetOp(taicpu(p))^.ref^.symbol);
  5716. if GetNextInstruction(hp_label, hp2) and
  5717. MatchInstruction(hp2,A_MOV,[]) and
  5718. (taicpu(hp2).oper[0]^.typ = top_const) and
  5719. (
  5720. (
  5721. (taicpu(hp2).oper[1]^.typ = top_reg)
  5722. {$ifdef i386}
  5723. { Under i386, ESI, EDI, EBP and ESP
  5724. don't have an 8-bit representation }
  5725. and not (getsupreg(taicpu(hp2).oper[1]^.reg) in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  5726. {$endif i386}
  5727. ) or (
  5728. {$ifdef i386}
  5729. (taicpu(hp2).oper[1]^.typ <> top_reg) and
  5730. {$endif i386}
  5731. (taicpu(hp2).opsize = S_B)
  5732. )
  5733. ) and
  5734. GetNextInstruction(hp2, hp3) and
  5735. MatchInstruction(hp3, A_JMP, A_RET, []) and
  5736. (
  5737. (taicpu(hp3).opcode=A_RET) or
  5738. (
  5739. (taicpu(hp3).oper[0]^.ref^.refaddr=addr_full) and
  5740. (tasmlabel(taicpu(hp3).oper[0]^.ref^.symbol)<>tai_label(hp_label).labsym)
  5741. )
  5742. ) and
  5743. GetNextInstruction(hp3, hp4) and
  5744. SkipAligns(hp4, hp4) and
  5745. (hp4.typ=ait_label) and
  5746. (tai_label(hp4).labsym=JumpLoc) and
  5747. (
  5748. not (cs_opt_size in current_settings.optimizerswitches) or
  5749. { If the initial jump is the label's only reference, then it will
  5750. become a dead label if the other conditions are met and hence
  5751. remove at least 2 instructions, including a jump }
  5752. (JumpLoc.getrefs = 1)
  5753. ) and
  5754. { Don't check if hp3 jumps to hp4 because this is a zero-distance jump
  5755. that will be optimised out }
  5756. GetNextInstruction(hp4, hp5) and
  5757. MatchInstruction(hp5,A_MOV,[taicpu(hp2).opsize]) and
  5758. (taicpu(hp5).oper[0]^.typ = top_const) and
  5759. (
  5760. ((taicpu(hp2).oper[0]^.val = 0) and (taicpu(hp5).oper[0]^.val = 1)) or
  5761. ((taicpu(hp2).oper[0]^.val = 1) and (taicpu(hp5).oper[0]^.val = 0))
  5762. ) and
  5763. MatchOperand(taicpu(hp2).oper[1]^,taicpu(hp5).oper[1]^) and
  5764. GetNextInstruction(hp5,hp6) and
  5765. (
  5766. (hp6.typ<>ait_label) or
  5767. SkipLabels(hp6, hp6)
  5768. ) and
  5769. (hp6.typ=ait_instruction) then
  5770. begin
  5771. { First, let's look at the two jumps that are hp3 and hp6 }
  5772. if not
  5773. (
  5774. (taicpu(hp6).opcode=taicpu(hp3).opcode) and { Both RET or both JMP to the same label }
  5775. (
  5776. (taicpu(hp6).opcode=A_RET) or
  5777. MatchOperand(taicpu(hp6).oper[0]^, taicpu(hp3).oper[0]^)
  5778. )
  5779. ) then
  5780. { If condition is False, then the JMP/RET instructions matched conventionally }
  5781. begin
  5782. { See if one of the jumps can be instantly converted into a RET }
  5783. if (taicpu(hp3).opcode=A_JMP) then
  5784. begin
  5785. { Reuse hp5 }
  5786. hp5 := getlabelwithsym(TAsmLabel(JumpTargetOp(taicpu(hp3))^.ref^.symbol));
  5787. { Make sure hp5 doesn't jump back to .L2 (infinite loop) }
  5788. if not Assigned(hp5) or (hp5=hp4) or not GetNextInstruction(hp5, hp5) then
  5789. Exit;
  5790. if MatchInstruction(hp5, A_RET, []) then
  5791. begin
  5792. DebugMsg(SPeepholeOptimization + 'Converted JMP to RET as part of SETcc optimisation (1st jump)', hp3);
  5793. ConvertJumpToRET(hp3, hp5);
  5794. Result := True;
  5795. end
  5796. else
  5797. Exit;
  5798. end;
  5799. if (taicpu(hp6).opcode=A_JMP) then
  5800. begin
  5801. { Reuse hp5 }
  5802. hp5 := getlabelwithsym(TAsmLabel(JumpTargetOp(taicpu(hp6))^.ref^.symbol));
  5803. if not Assigned(hp5) or not GetNextInstruction(hp5, hp5) then
  5804. Exit;
  5805. if MatchInstruction(hp5, A_RET, []) then
  5806. begin
  5807. DebugMsg(SPeepholeOptimization + 'Converted JMP to RET as part of SETcc optimisation (2nd jump)', hp6);
  5808. ConvertJumpToRET(hp6, hp5);
  5809. Result := True;
  5810. end
  5811. else
  5812. Exit;
  5813. end;
  5814. if not
  5815. (
  5816. (taicpu(hp6).opcode=taicpu(hp3).opcode) and { Both RET or both JMP to the same label }
  5817. (
  5818. (taicpu(hp6).opcode=A_RET) or
  5819. MatchOperand(taicpu(hp6).oper[0]^, taicpu(hp3).oper[0]^)
  5820. )
  5821. ) then
  5822. { Still doesn't match }
  5823. Exit;
  5824. end;
  5825. if (taicpu(hp2).oper[0]^.val = 1) then
  5826. begin
  5827. taicpu(p).condition := inverse_cond(taicpu(p).condition);
  5828. DebugMsg(SPeepholeOptimization + 'J(c)Mov1Jmp/RetMov0Jmp/Ret -> Set(~c)Jmp/Ret',p)
  5829. end
  5830. else
  5831. DebugMsg(SPeepholeOptimization + 'J(c)Mov0Jmp/RetMov1Jmp/Ret -> Set(c)Jmp/Ret',p);
  5832. if taicpu(hp2).opsize=S_B then
  5833. begin
  5834. if taicpu(hp2).oper[1]^.typ = top_reg then
  5835. begin
  5836. SecondReg := taicpu(hp2).oper[1]^.reg;
  5837. hp4:=taicpu.op_reg(A_SETcc, S_B, SecondReg);
  5838. end
  5839. else
  5840. begin
  5841. hp4:=taicpu.op_ref(A_SETcc, S_B, taicpu(hp2).oper[1]^.ref^);
  5842. SecondReg := NR_NO;
  5843. end;
  5844. hp_pos := p;
  5845. hp_allocstart := hp4;
  5846. end
  5847. else
  5848. begin
  5849. { Will be a register because the size can't be S_B otherwise }
  5850. SecondReg:=taicpu(hp2).oper[1]^.reg;
  5851. ThisReg:=newreg(R_INTREGISTER,getsupreg(SecondReg), R_SUBL);
  5852. hp4:=taicpu.op_reg(A_SETcc, S_B, ThisReg);
  5853. if (cs_opt_size in current_settings.optimizerswitches) then
  5854. begin
  5855. { Favour using MOVZX when optimising for size }
  5856. case taicpu(hp2).opsize of
  5857. S_W:
  5858. NewSize := S_BW;
  5859. S_L:
  5860. NewSize := S_BL;
  5861. {$ifdef x86_64}
  5862. S_Q:
  5863. begin
  5864. NewSize := S_BL;
  5865. { Will implicitly zero-extend to 64-bit }
  5866. setsubreg(SecondReg, R_SUBD);
  5867. end;
  5868. {$endif x86_64}
  5869. else
  5870. InternalError(2022101301);
  5871. end;
  5872. hp5:=taicpu.op_reg_reg(A_MOVZX, NewSize, ThisReg, SecondReg);
  5873. { Inserting it right before p will guarantee that the flags are also tracked }
  5874. Asml.InsertBefore(hp5, p);
  5875. { Make sure the SET instruction gets inserted before the MOVZX instruction }
  5876. hp_pos := hp5;
  5877. hp_allocstart := hp4;
  5878. end
  5879. else
  5880. begin
  5881. hp5:=taicpu.op_const_reg(A_MOV, taicpu(hp2).opsize, 0, SecondReg);
  5882. { Inserting it right before p will guarantee that the flags are also tracked }
  5883. Asml.InsertBefore(hp5, p);
  5884. hp_pos := p;
  5885. hp_allocstart := hp5;
  5886. end;
  5887. taicpu(hp5).fileinfo:=taicpu(p).fileinfo;
  5888. end;
  5889. taicpu(hp4).fileinfo := taicpu(p).fileinfo;
  5890. taicpu(hp4).condition := taicpu(p).condition;
  5891. asml.InsertBefore(hp4, hp_pos);
  5892. if taicpu(hp3).is_jmp then
  5893. begin
  5894. JumpLoc.decrefs;
  5895. MakeUnconditional(taicpu(p));
  5896. taicpu(p).loadref(0, JumpTargetOp(taicpu(hp3))^.ref^);
  5897. TAsmLabel(JumpTargetOp(taicpu(hp3))^.ref^.symbol).increfs;
  5898. end
  5899. else
  5900. ConvertJumpToRET(p, hp3);
  5901. if SecondReg <> NR_NO then
  5902. { Ensure the destination register is allocated over this region }
  5903. AllocRegBetween(SecondReg, hp_allocstart, p, UsedRegs);
  5904. if (JumpLoc.getrefs = 0) then
  5905. RemoveDeadCodeAfterJump(hp3);
  5906. Result:=true;
  5907. exit;
  5908. end;
  5909. end;
  5910. function TX86AsmOptimizer.OptPass1Sub(var p : tai) : boolean;
  5911. var
  5912. hp1, hp2: tai;
  5913. ActiveReg: TRegister;
  5914. OldOffset: asizeint;
  5915. ThisConst: TCGInt;
  5916. function RegDeallocated: Boolean;
  5917. begin
  5918. TransferUsedRegs(TmpUsedRegs);
  5919. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5920. Result := not(RegUsedAfterInstruction(ActiveReg,hp1,TmpUsedRegs))
  5921. end;
  5922. begin
  5923. Result:=false;
  5924. hp1 := nil;
  5925. { replace
  5926. subX const,%reg1
  5927. leaX (%reg1,%reg1,Y),%reg2 // Base or index might not be equal to reg1
  5928. dealloc %reg1
  5929. by
  5930. leaX -const-const*Y(%reg1,%reg1,Y),%reg2
  5931. }
  5932. if MatchOpType(taicpu(p),top_const,top_reg) then
  5933. begin
  5934. ActiveReg := taicpu(p).oper[1]^.reg;
  5935. { Ensures the entire register was updated }
  5936. if (taicpu(p).opsize >= S_L) and
  5937. GetNextInstructionUsingReg(p,hp1, ActiveReg) and
  5938. MatchInstruction(hp1,A_LEA,[]) and
  5939. (SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.base) or
  5940. SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.index)) and
  5941. (
  5942. { Cover the case where the register in the reference is also the destination register }
  5943. Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, ActiveReg) or
  5944. (
  5945. { Try to avoid the expensive check of RegUsedAfterInstruction if we know it will return False }
  5946. not SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ActiveReg) and
  5947. RegDeallocated
  5948. )
  5949. ) then
  5950. begin
  5951. OldOffset := taicpu(hp1).oper[0]^.ref^.offset;
  5952. if ActiveReg=taicpu(hp1).oper[0]^.ref^.base then
  5953. Dec(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val);
  5954. if ActiveReg=taicpu(hp1).oper[0]^.ref^.index then
  5955. Dec(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val*max(taicpu(hp1).oper[0]^.ref^.scalefactor,1));
  5956. {$ifdef x86_64}
  5957. if (taicpu(hp1).oper[0]^.ref^.offset > $7FFFFFFF) or (taicpu(hp1).oper[0]^.ref^.offset < -2147483648) then
  5958. begin
  5959. { Overflow; abort }
  5960. taicpu(hp1).oper[0]^.ref^.offset := OldOffset;
  5961. end
  5962. else
  5963. {$endif x86_64}
  5964. begin
  5965. DebugMsg(SPeepholeOptimization + 'SubLea2Lea done',p);
  5966. if not (cs_opt_level3 in current_settings.optimizerswitches) then
  5967. { hp1 is the immediate next instruction for sure - good for a quick speed boost }
  5968. RemoveCurrentP(p, hp1)
  5969. else
  5970. RemoveCurrentP(p);
  5971. result:=true;
  5972. Exit;
  5973. end;
  5974. end;
  5975. if (
  5976. { Save calling GetNextInstructionUsingReg again }
  5977. Assigned(hp1) or
  5978. GetNextInstructionUsingReg(p,hp1, ActiveReg)
  5979. ) and
  5980. MatchInstruction(hp1,A_SUB,[taicpu(p).opsize]) and
  5981. (taicpu(hp1).oper[1]^.reg = ActiveReg) then
  5982. begin
  5983. if taicpu(hp1).oper[0]^.typ = top_const then
  5984. begin
  5985. { Merge add const1,%reg; add const2,%reg to add const1+const2,%reg }
  5986. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val;
  5987. Result := True;
  5988. { Handle any overflows }
  5989. case taicpu(p).opsize of
  5990. S_B:
  5991. taicpu(p).oper[0]^.val := ThisConst and $FF;
  5992. S_W:
  5993. taicpu(p).oper[0]^.val := ThisConst and $FFFF;
  5994. S_L:
  5995. taicpu(p).oper[0]^.val := ThisConst and $FFFFFFFF;
  5996. {$ifdef x86_64}
  5997. S_Q:
  5998. if (ThisConst > $7FFFFFFF) or (ThisConst < -2147483648) then
  5999. { Overflow; abort }
  6000. Result := False
  6001. else
  6002. taicpu(p).oper[0]^.val := ThisConst;
  6003. {$endif x86_64}
  6004. else
  6005. InternalError(2021102611);
  6006. end;
  6007. { Result may get set to False again if the combined immediate overflows for S_Q sizes }
  6008. if Result then
  6009. begin
  6010. if (taicpu(p).oper[0]^.val < 0) and
  6011. (
  6012. ((taicpu(p).opsize = S_B) and (taicpu(p).oper[0]^.val <> -128)) or
  6013. ((taicpu(p).opsize = S_W) and (taicpu(p).oper[0]^.val <> -32768)) or
  6014. ((taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) and (taicpu(p).oper[0]^.val <> -2147483648))
  6015. ) then
  6016. begin
  6017. DebugMsg(SPeepholeOptimization + 'SUB; ADD/SUB -> ADD',p);
  6018. taicpu(p).opcode := A_SUB;
  6019. taicpu(p).oper[0]^.val := -taicpu(p).oper[0]^.val;
  6020. end
  6021. else
  6022. DebugMsg(SPeepholeOptimization + 'SUB; ADD/SUB -> SUB',p);
  6023. RemoveInstruction(hp1);
  6024. end;
  6025. end
  6026. else
  6027. begin
  6028. { Make doubly sure the flags aren't in use because the order of subtractions may affect them }
  6029. TransferUsedRegs(TmpUsedRegs);
  6030. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  6031. hp2 := p;
  6032. while not (cs_opt_level3 in current_settings.optimizerswitches) and
  6033. GetNextInstruction(hp2, hp2) and (hp2 <> hp1) do
  6034. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  6035. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  6036. begin
  6037. { Move the constant subtraction to after the reg/ref addition to improve optimisation }
  6038. DebugMsg(SPeepholeOptimization + 'Add/sub swap 1b done',p);
  6039. Asml.Remove(p);
  6040. Asml.InsertAfter(p, hp1);
  6041. p := hp1;
  6042. Result := True;
  6043. Exit;
  6044. end;
  6045. end;
  6046. end;
  6047. { * change "subl $2, %esp; pushw x" to "pushl x"}
  6048. { * change "sub/add const1, reg" or "dec reg" followed by
  6049. "sub const2, reg" to one "sub ..., reg" }
  6050. {$ifdef i386}
  6051. if (taicpu(p).oper[0]^.val = 2) and
  6052. (ActiveReg = NR_ESP) and
  6053. { Don't do the sub/push optimization if the sub }
  6054. { comes from setting up the stack frame (JM) }
  6055. (not(GetLastInstruction(p,hp1)) or
  6056. not(MatchInstruction(hp1,A_MOV,[S_L]) and
  6057. MatchOperand(taicpu(hp1).oper[0]^,NR_ESP) and
  6058. MatchOperand(taicpu(hp1).oper[0]^,NR_EBP))) then
  6059. begin
  6060. hp1 := tai(p.next);
  6061. while Assigned(hp1) and
  6062. (tai(hp1).typ in [ait_instruction]+SkipInstr) and
  6063. not RegReadByInstruction(NR_ESP,hp1) and
  6064. not RegModifiedByInstruction(NR_ESP,hp1) do
  6065. hp1 := tai(hp1.next);
  6066. if Assigned(hp1) and
  6067. MatchInstruction(hp1,A_PUSH,[S_W]) then
  6068. begin
  6069. taicpu(hp1).changeopsize(S_L);
  6070. if taicpu(hp1).oper[0]^.typ=top_reg then
  6071. setsubreg(taicpu(hp1).oper[0]^.reg,R_SUBWHOLE);
  6072. hp1 := tai(p.next);
  6073. RemoveCurrentp(p, hp1);
  6074. Result:=true;
  6075. exit;
  6076. end;
  6077. end;
  6078. {$endif i386}
  6079. if DoArithCombineOpt(p) then
  6080. Result:=true;
  6081. end;
  6082. end;
  6083. function TX86AsmOptimizer.OptPass1SHLSAL(var p : tai) : boolean;
  6084. var
  6085. TmpBool1,TmpBool2 : Boolean;
  6086. tmpref : treference;
  6087. hp1,hp2: tai;
  6088. mask, shiftval: tcgint;
  6089. begin
  6090. Result:=false;
  6091. { All these optimisations work on "shl/sal const,%reg" }
  6092. if not MatchOpType(taicpu(p),top_const,top_reg) then
  6093. Exit;
  6094. if (taicpu(p).opsize in [S_L{$ifdef x86_64},S_Q{$endif x86_64}]) and
  6095. (taicpu(p).oper[0]^.val <= 3) then
  6096. { Changes "shl const, %reg32; add const/reg, %reg32" to one lea statement }
  6097. begin
  6098. { should we check the next instruction? }
  6099. TmpBool1 := True;
  6100. { have we found an add/sub which could be
  6101. integrated in the lea? }
  6102. TmpBool2 := False;
  6103. reference_reset(tmpref,2,[]);
  6104. TmpRef.index := taicpu(p).oper[1]^.reg;
  6105. TmpRef.scalefactor := 1 shl taicpu(p).oper[0]^.val;
  6106. while TmpBool1 and
  6107. GetNextInstruction(p, hp1) and
  6108. (tai(hp1).typ = ait_instruction) and
  6109. ((((taicpu(hp1).opcode = A_ADD) or
  6110. (taicpu(hp1).opcode = A_SUB)) and
  6111. (taicpu(hp1).oper[1]^.typ = Top_Reg) and
  6112. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg)) or
  6113. (((taicpu(hp1).opcode = A_INC) or
  6114. (taicpu(hp1).opcode = A_DEC)) and
  6115. (taicpu(hp1).oper[0]^.typ = Top_Reg) and
  6116. (taicpu(hp1).oper[0]^.reg = taicpu(p).oper[1]^.reg)) or
  6117. ((taicpu(hp1).opcode = A_LEA) and
  6118. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  6119. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg))) and
  6120. (not GetNextInstruction(hp1,hp2) or
  6121. not instrReadsFlags(hp2)) Do
  6122. begin
  6123. TmpBool1 := False;
  6124. if taicpu(hp1).opcode=A_LEA then
  6125. begin
  6126. if (TmpRef.base = NR_NO) and
  6127. (taicpu(hp1).oper[0]^.ref^.symbol=nil) and
  6128. (taicpu(hp1).oper[0]^.ref^.relsymbol=nil) and
  6129. { Segment register isn't a concern here }
  6130. ((taicpu(hp1).oper[0]^.ref^.scalefactor=0) or
  6131. (taicpu(hp1).oper[0]^.ref^.scalefactor*tmpref.scalefactor<=8)) then
  6132. begin
  6133. TmpBool1 := True;
  6134. TmpBool2 := True;
  6135. inc(TmpRef.offset, taicpu(hp1).oper[0]^.ref^.offset);
  6136. if taicpu(hp1).oper[0]^.ref^.scalefactor<>0 then
  6137. tmpref.scalefactor:=tmpref.scalefactor*taicpu(hp1).oper[0]^.ref^.scalefactor;
  6138. TmpRef.base := taicpu(hp1).oper[0]^.ref^.base;
  6139. RemoveInstruction(hp1);
  6140. end
  6141. end
  6142. else if (taicpu(hp1).oper[0]^.typ = Top_Const) then
  6143. begin
  6144. TmpBool1 := True;
  6145. TmpBool2 := True;
  6146. case taicpu(hp1).opcode of
  6147. A_ADD:
  6148. inc(TmpRef.offset, longint(taicpu(hp1).oper[0]^.val));
  6149. A_SUB:
  6150. dec(TmpRef.offset, longint(taicpu(hp1).oper[0]^.val));
  6151. else
  6152. internalerror(2019050536);
  6153. end;
  6154. RemoveInstruction(hp1);
  6155. end
  6156. else
  6157. if (taicpu(hp1).oper[0]^.typ = Top_Reg) and
  6158. (((taicpu(hp1).opcode = A_ADD) and
  6159. (TmpRef.base = NR_NO)) or
  6160. (taicpu(hp1).opcode = A_INC) or
  6161. (taicpu(hp1).opcode = A_DEC)) then
  6162. begin
  6163. TmpBool1 := True;
  6164. TmpBool2 := True;
  6165. case taicpu(hp1).opcode of
  6166. A_ADD:
  6167. TmpRef.base := taicpu(hp1).oper[0]^.reg;
  6168. A_INC:
  6169. inc(TmpRef.offset);
  6170. A_DEC:
  6171. dec(TmpRef.offset);
  6172. else
  6173. internalerror(2019050535);
  6174. end;
  6175. RemoveInstruction(hp1);
  6176. end;
  6177. end;
  6178. if TmpBool2
  6179. {$ifndef x86_64}
  6180. or
  6181. ((current_settings.optimizecputype < cpu_Pentium2) and
  6182. (taicpu(p).oper[0]^.val <= 3) and
  6183. not(cs_opt_size in current_settings.optimizerswitches))
  6184. {$endif x86_64}
  6185. then
  6186. begin
  6187. if not(TmpBool2) and
  6188. (taicpu(p).oper[0]^.val=1) then
  6189. begin
  6190. taicpu(p).opcode := A_ADD;
  6191. taicpu(p).loadreg(0, taicpu(p).oper[1]^.reg);
  6192. end
  6193. else
  6194. begin
  6195. taicpu(p).opcode := A_LEA;
  6196. taicpu(p).loadref(0, TmpRef);
  6197. end;
  6198. DebugMsg(SPeepholeOptimization + 'ShlAddLeaSubIncDec2Lea',p);
  6199. Result := True;
  6200. end;
  6201. end
  6202. {$ifndef x86_64}
  6203. else if (current_settings.optimizecputype < cpu_Pentium2) then
  6204. begin
  6205. { changes "shl $1, %reg" to "add %reg, %reg", which is the same on a 386,
  6206. but faster on a 486, and Tairable in both U and V pipes on the Pentium
  6207. (unlike shl, which is only Tairable in the U pipe) }
  6208. if taicpu(p).oper[0]^.val=1 then
  6209. begin
  6210. taicpu(p).opcode := A_ADD;
  6211. taicpu(p).loadreg(0, taicpu(p).oper[1]^.reg);
  6212. Result := True;
  6213. end
  6214. { changes "shl $2, %reg" to "lea (,%reg,4), %reg"
  6215. "shl $3, %reg" to "lea (,%reg,8), %reg }
  6216. else if (taicpu(p).opsize = S_L) and
  6217. (taicpu(p).oper[0]^.val<= 3) then
  6218. begin
  6219. reference_reset(tmpref,2,[]);
  6220. TmpRef.index := taicpu(p).oper[1]^.reg;
  6221. TmpRef.scalefactor := 1 shl taicpu(p).oper[0]^.val;
  6222. taicpu(p).opcode := A_LEA;
  6223. taicpu(p).loadref(0, TmpRef);
  6224. Result := True;
  6225. end;
  6226. end
  6227. {$endif x86_64}
  6228. else if
  6229. GetNextInstruction(p, hp1) and (hp1.typ = ait_instruction) and MatchOpType(taicpu(hp1), top_const, top_reg) and
  6230. (
  6231. (
  6232. MatchInstruction(hp1, A_AND, [taicpu(p).opsize]) and
  6233. SetAndTest(hp1, hp2)
  6234. {$ifdef x86_64}
  6235. ) or
  6236. (
  6237. MatchInstruction(hp1, A_MOV, [taicpu(p).opsize]) and
  6238. GetNextInstruction(hp1, hp2) and
  6239. MatchInstruction(hp2, A_AND, [taicpu(p).opsize]) and
  6240. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  6241. (taicpu(hp1).oper[1]^.reg = taicpu(hp2).oper[0]^.reg)
  6242. {$endif x86_64}
  6243. )
  6244. ) and
  6245. (taicpu(p).oper[1]^.reg = taicpu(hp2).oper[1]^.reg) then
  6246. begin
  6247. { Change:
  6248. shl x, %reg1
  6249. mov -(1<<x), %reg2
  6250. and %reg2, %reg1
  6251. Or:
  6252. shl x, %reg1
  6253. and -(1<<x), %reg1
  6254. To just:
  6255. shl x, %reg1
  6256. Since the and operation only zeroes bits that are already zero from the shl operation
  6257. }
  6258. case taicpu(p).oper[0]^.val of
  6259. 8:
  6260. mask:=$FFFFFFFFFFFFFF00;
  6261. 16:
  6262. mask:=$FFFFFFFFFFFF0000;
  6263. 32:
  6264. mask:=$FFFFFFFF00000000;
  6265. 63:
  6266. { Constant pre-calculated to prevent overflow errors with Int64 }
  6267. mask:=$8000000000000000;
  6268. else
  6269. begin
  6270. if taicpu(p).oper[0]^.val >= 64 then
  6271. { Shouldn't happen realistically, since the register
  6272. is guaranteed to be set to zero at this point }
  6273. mask := 0
  6274. else
  6275. mask := -(Int64(1 shl taicpu(p).oper[0]^.val));
  6276. end;
  6277. end;
  6278. if taicpu(hp1).oper[0]^.val = mask then
  6279. begin
  6280. { Everything checks out, perform the optimisation, as long as
  6281. the FLAGS register isn't being used}
  6282. TransferUsedRegs(TmpUsedRegs);
  6283. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  6284. {$ifdef x86_64}
  6285. if (hp1 <> hp2) then
  6286. begin
  6287. { "shl/mov/and" version }
  6288. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  6289. { Don't do the optimisation if the FLAGS register is in use }
  6290. if not(RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp2, TmpUsedRegs)) then
  6291. begin
  6292. DebugMsg(SPeepholeOptimization + 'ShlMovAnd2Shl', p);
  6293. { Don't remove the 'mov' instruction if its register is used elsewhere }
  6294. if not(RegUsedAfterInstruction(taicpu(hp1).oper[1]^.reg, hp2, TmpUsedRegs)) then
  6295. begin
  6296. RemoveInstruction(hp1);
  6297. Result := True;
  6298. end;
  6299. { Only set Result to True if the 'mov' instruction was removed }
  6300. RemoveInstruction(hp2);
  6301. end;
  6302. end
  6303. else
  6304. {$endif x86_64}
  6305. begin
  6306. { "shl/and" version }
  6307. { Don't do the optimisation if the FLAGS register is in use }
  6308. if not(RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)) then
  6309. begin
  6310. DebugMsg(SPeepholeOptimization + 'ShlAnd2Shl', p);
  6311. RemoveInstruction(hp1);
  6312. Result := True;
  6313. end;
  6314. end;
  6315. Exit;
  6316. end
  6317. else {$ifdef x86_64}if (hp1 = hp2) then{$endif x86_64}
  6318. begin
  6319. { Even if the mask doesn't allow for its removal, we might be
  6320. able to optimise the mask for the "shl/and" version, which
  6321. may permit other peephole optimisations }
  6322. {$ifdef DEBUG_AOPTCPU}
  6323. mask := taicpu(hp1).oper[0]^.val and mask;
  6324. if taicpu(hp1).oper[0]^.val <> mask then
  6325. begin
  6326. DebugMsg(
  6327. SPeepholeOptimization +
  6328. 'Changed mask from $' + debug_tostr(taicpu(hp1).oper[0]^.val) +
  6329. ' to $' + debug_tostr(mask) +
  6330. 'based on previous instruction (ShlAnd2ShlAnd)', hp1);
  6331. taicpu(hp1).oper[0]^.val := mask;
  6332. end;
  6333. {$else DEBUG_AOPTCPU}
  6334. { If debugging is off, just set the operand even if it's the same }
  6335. taicpu(hp1).oper[0]^.val := taicpu(hp1).oper[0]^.val and mask;
  6336. {$endif DEBUG_AOPTCPU}
  6337. end;
  6338. end;
  6339. {
  6340. change
  6341. shl/sal const,reg
  6342. <op> ...(...,reg,1),...
  6343. into
  6344. <op> ...(...,reg,1 shl const),...
  6345. if const in 1..3
  6346. }
  6347. if MatchOpType(taicpu(p), top_const, top_reg) and
  6348. (taicpu(p).oper[0]^.val in [1..3]) and
  6349. GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg) and
  6350. ((MatchInstruction(hp1,A_MOV,A_LEA,[]) and
  6351. MatchOpType(taicpu(hp1),top_ref,top_reg)) or
  6352. (MatchInstruction(hp1,A_FST,A_FSTP,A_FLD,[]) and
  6353. MatchOpType(taicpu(hp1),top_ref))
  6354. ) and
  6355. (taicpu(p).oper[1]^.reg=taicpu(hp1).oper[0]^.ref^.index) and
  6356. (taicpu(p).oper[1]^.reg<>taicpu(hp1).oper[0]^.ref^.base) and
  6357. (taicpu(hp1).oper[0]^.ref^.scalefactor in [0,1]) then
  6358. begin
  6359. TransferUsedRegs(TmpUsedRegs);
  6360. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  6361. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs)) then
  6362. begin
  6363. taicpu(hp1).oper[0]^.ref^.scalefactor:=1 shl taicpu(p).oper[0]^.val;
  6364. DebugMsg(SPeepholeOptimization + 'ShlOp2Op', p);
  6365. RemoveCurrentP(p);
  6366. Result:=true;
  6367. exit;
  6368. end;
  6369. end;
  6370. if MatchOpType(taicpu(p), top_const, top_reg) and
  6371. GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg) and
  6372. MatchInstruction(hp1,A_SHL,[taicpu(p).opsize]) and
  6373. MatchOpType(taicpu(hp1),top_const,top_reg) and
  6374. (taicpu(p).oper[1]^.reg=taicpu(hp1).oper[1]^.reg) then
  6375. begin
  6376. shiftval:=taicpu(p).oper[0]^.val+taicpu(hp1).oper[0]^.val;
  6377. if ((taicpu(p).opsize=S_B) and (shiftval>7)) or
  6378. ((taicpu(p).opsize=S_W) and (shiftval>15)) or
  6379. {$ifdef x86_64}
  6380. ((taicpu(p).opsize=S_Q) and (shiftval>63)) or
  6381. {$endif x86_64}
  6382. ((taicpu(p).opsize=S_L) and (shiftval>31)) then
  6383. begin
  6384. DebugMsg(SPeepholeOptimization + 'ShlShl2Mov', p);
  6385. taicpu(hp1).opcode:=A_MOV;
  6386. taicpu(hp1).oper[0]^.val:=0;
  6387. end
  6388. else
  6389. begin
  6390. DebugMsg(SPeepholeOptimization + 'ShlShl2Shl', p);
  6391. taicpu(hp1).oper[0]^.val:=shiftval;
  6392. end;
  6393. RemoveCurrentP(p);
  6394. Result:=true;
  6395. exit;
  6396. end;
  6397. end;
  6398. class function TX86AsmOptimizer.IsShrMovZFoldable(shr_size, movz_size: topsize; Shift: TCGInt): Boolean;
  6399. begin
  6400. case shr_size of
  6401. S_B:
  6402. { No valid combinations }
  6403. Result := False;
  6404. S_W:
  6405. Result := (Shift >= 8) and (movz_size = S_BW);
  6406. S_L:
  6407. Result :=
  6408. (Shift >= 24) { Any opsize is valid for this shift } or
  6409. ((Shift >= 16) and (movz_size = S_WL));
  6410. {$ifdef x86_64}
  6411. S_Q:
  6412. Result :=
  6413. (Shift >= 56) { Any opsize is valid for this shift } or
  6414. ((Shift >= 48) and (movz_size = S_WL));
  6415. {$endif x86_64}
  6416. else
  6417. InternalError(2022081510);
  6418. end;
  6419. end;
  6420. function TX86AsmOptimizer.OptPass1SHR(var p : tai) : boolean;
  6421. var
  6422. hp1, hp2: tai;
  6423. Shift: TCGInt;
  6424. LimitSize: Topsize;
  6425. DoNotMerge: Boolean;
  6426. begin
  6427. Result := False;
  6428. { All these optimisations work on "shr const,%reg" }
  6429. if not MatchOpType(taicpu(p), top_const, top_reg) then
  6430. Exit;
  6431. DoNotMerge := False;
  6432. Shift := taicpu(p).oper[0]^.val;
  6433. LimitSize := taicpu(p).opsize;
  6434. hp1 := p;
  6435. repeat
  6436. if not GetNextInstructionUsingReg(hp1, hp1, taicpu(p).oper[1]^.reg) or (hp1.typ <> ait_instruction) then
  6437. Exit;
  6438. case taicpu(hp1).opcode of
  6439. A_TEST, A_CMP, A_Jcc:
  6440. { Skip over conditional jumps and relevant comparisons }
  6441. Continue;
  6442. A_MOVZX:
  6443. if MatchOpType(taicpu(hp1), top_reg, top_reg) and
  6444. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(p).oper[1]^.reg) then
  6445. begin
  6446. { Since the original register is being read as is, subsequent
  6447. SHRs must not be merged at this point }
  6448. DoNotMerge := True;
  6449. if IsShrMovZFoldable(taicpu(p).opsize, taicpu(hp1).opsize, Shift) then
  6450. begin
  6451. if not SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then { Different register target }
  6452. begin
  6453. DebugMsg(SPeepholeOptimization + 'Converted MOVZX instruction to MOV since previous SHR makes zero-extension unnecessary (ShrMovz2ShrMov 1)', hp1);
  6454. taicpu(hp1).opcode := A_MOV;
  6455. setsubreg(taicpu(hp1).oper[0]^.reg, getsubreg(taicpu(hp1).oper[1]^.reg));
  6456. case taicpu(hp1).opsize of
  6457. S_BW:
  6458. taicpu(hp1).opsize := S_W;
  6459. S_BL, S_WL:
  6460. taicpu(hp1).opsize := S_L;
  6461. else
  6462. InternalError(2022081503);
  6463. end;
  6464. { p itself hasn't changed, so no need to set Result to True }
  6465. Include(OptsToCheck, aoc_ForceNewIteration);
  6466. { See if there's anything afterwards that can be
  6467. optimised, since the input register hasn't changed }
  6468. Continue;
  6469. end;
  6470. { NOTE: If the MOVZX instruction reads and writes the same
  6471. register, defer this to the post-peephole optimisation stage }
  6472. Exit;
  6473. end;
  6474. end;
  6475. A_SHL, A_SAL, A_SHR:
  6476. if (taicpu(hp1).opsize <= LimitSize) and
  6477. MatchOpType(taicpu(hp1), top_const, top_reg) and
  6478. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[1]^.reg) then
  6479. begin
  6480. { Make sure the sizes don't exceed the register size limit
  6481. (measured by the shift value falling below the limit) }
  6482. if taicpu(hp1).opsize < LimitSize then
  6483. LimitSize := taicpu(hp1).opsize;
  6484. if taicpu(hp1).opcode = A_SHR then
  6485. Inc(Shift, taicpu(hp1).oper[0]^.val)
  6486. else
  6487. begin
  6488. Dec(Shift, taicpu(hp1).oper[0]^.val);
  6489. DoNotMerge := True;
  6490. end;
  6491. if Shift < topsize2memsize[taicpu(p).opsize] - topsize2memsize[LimitSize] then
  6492. Exit;
  6493. { Since we've established that the combined shift is within
  6494. limits, we can actually combine the adjacent SHR
  6495. instructions even if they're different sizes }
  6496. if not DoNotMerge and (taicpu(hp1).opcode = A_SHR) then
  6497. begin
  6498. hp2 := tai(hp1.Previous);
  6499. DebugMsg(SPeepholeOptimization + 'ShrShr2Shr 1', p);
  6500. Inc(taicpu(p).oper[0]^.val, taicpu(hp1).oper[0]^.val);
  6501. RemoveInstruction(hp1);
  6502. hp1 := hp2;
  6503. { Though p has changed, only the constant has, and its
  6504. effects can still be detected on the next iteration of
  6505. the repeat..until loop }
  6506. Include(OptsToCheck, aoc_ForceNewIteration);
  6507. end;
  6508. { Move onto the next instruction }
  6509. Continue;
  6510. end;
  6511. else
  6512. ;
  6513. end;
  6514. Break;
  6515. until False;
  6516. end;
  6517. function TX86AsmOptimizer.CheckMemoryWrite(var first_mov, second_mov: taicpu): Boolean;
  6518. var
  6519. CurrentRef: TReference;
  6520. FullReg: TRegister;
  6521. hp1, hp2: tai;
  6522. begin
  6523. Result := False;
  6524. if (first_mov.opsize <> S_B) or (second_mov.opsize <> S_B) then
  6525. Exit;
  6526. { We assume you've checked if the operand is actually a reference by
  6527. this point. If it isn't, you'll most likely get an access violation }
  6528. CurrentRef := first_mov.oper[1]^.ref^;
  6529. { Memory must be aligned }
  6530. if (CurrentRef.offset mod 4) <> 0 then
  6531. Exit;
  6532. Inc(CurrentRef.offset);
  6533. CurrentRef.alignment := 1; { Otherwise references_equal will return False }
  6534. if MatchOperand(second_mov.oper[0]^, 0) and
  6535. references_equal(second_mov.oper[1]^.ref^, CurrentRef) and
  6536. GetNextInstruction(second_mov, hp1) and
  6537. (hp1.typ = ait_instruction) and
  6538. (taicpu(hp1).opcode = A_MOV) and
  6539. MatchOpType(taicpu(hp1), top_const, top_ref) and
  6540. (taicpu(hp1).oper[0]^.val = 0) then
  6541. begin
  6542. Inc(CurrentRef.offset);
  6543. CurrentRef.alignment := taicpu(hp1).oper[1]^.ref^.alignment; { Otherwise references_equal might return False }
  6544. FullReg := newreg(R_INTREGISTER,getsupreg(first_mov.oper[0]^.reg), R_SUBD);
  6545. if references_equal(taicpu(hp1).oper[1]^.ref^, CurrentRef) then
  6546. begin
  6547. case taicpu(hp1).opsize of
  6548. S_B:
  6549. if GetNextInstruction(hp1, hp2) and
  6550. MatchInstruction(taicpu(hp2), A_MOV, [S_B]) and
  6551. MatchOpType(taicpu(hp2), top_const, top_ref) and
  6552. (taicpu(hp2).oper[0]^.val = 0) then
  6553. begin
  6554. Inc(CurrentRef.offset);
  6555. CurrentRef.alignment := 1; { Otherwise references_equal will return False }
  6556. if references_equal(taicpu(hp2).oper[1]^.ref^, CurrentRef) and
  6557. (taicpu(hp2).opsize = S_B) then
  6558. begin
  6559. RemoveInstruction(hp1);
  6560. RemoveInstruction(hp2);
  6561. first_mov.opsize := S_L;
  6562. if first_mov.oper[0]^.typ = top_reg then
  6563. begin
  6564. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVb/MOVb -> MOVZX/MOVl', first_mov);
  6565. { Reuse second_mov as a MOVZX instruction }
  6566. second_mov.opcode := A_MOVZX;
  6567. second_mov.opsize := S_BL;
  6568. second_mov.loadreg(0, first_mov.oper[0]^.reg);
  6569. second_mov.loadreg(1, FullReg);
  6570. first_mov.oper[0]^.reg := FullReg;
  6571. asml.Remove(second_mov);
  6572. asml.InsertBefore(second_mov, first_mov);
  6573. end
  6574. else
  6575. { It's a value }
  6576. begin
  6577. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVb/MOVb -> MOVl', first_mov);
  6578. RemoveInstruction(second_mov);
  6579. end;
  6580. Result := True;
  6581. Exit;
  6582. end;
  6583. end;
  6584. S_W:
  6585. begin
  6586. RemoveInstruction(hp1);
  6587. first_mov.opsize := S_L;
  6588. if first_mov.oper[0]^.typ = top_reg then
  6589. begin
  6590. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVw -> MOVZX/MOVl', first_mov);
  6591. { Reuse second_mov as a MOVZX instruction }
  6592. second_mov.opcode := A_MOVZX;
  6593. second_mov.opsize := S_BL;
  6594. second_mov.loadreg(0, first_mov.oper[0]^.reg);
  6595. second_mov.loadreg(1, FullReg);
  6596. first_mov.oper[0]^.reg := FullReg;
  6597. asml.Remove(second_mov);
  6598. asml.InsertBefore(second_mov, first_mov);
  6599. end
  6600. else
  6601. { It's a value }
  6602. begin
  6603. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVw -> MOVl', first_mov);
  6604. RemoveInstruction(second_mov);
  6605. end;
  6606. Result := True;
  6607. Exit;
  6608. end;
  6609. else
  6610. ;
  6611. end;
  6612. end;
  6613. end;
  6614. end;
  6615. function TX86AsmOptimizer.OptPass1FSTP(var p: tai): boolean;
  6616. { returns true if a "continue" should be done after this optimization }
  6617. var
  6618. hp1, hp2, hp3: tai;
  6619. begin
  6620. Result := false;
  6621. hp3 := nil;
  6622. if MatchOpType(taicpu(p),top_ref) and
  6623. GetNextInstruction(p, hp1) and
  6624. (hp1.typ = ait_instruction) and
  6625. (((taicpu(hp1).opcode = A_FLD) and
  6626. (taicpu(p).opcode = A_FSTP)) or
  6627. ((taicpu(p).opcode = A_FISTP) and
  6628. (taicpu(hp1).opcode = A_FILD))) and
  6629. MatchOpType(taicpu(hp1),top_ref) and
  6630. (taicpu(hp1).opsize = taicpu(p).opsize) and
  6631. RefsEqual(taicpu(p).oper[0]^.ref^, taicpu(hp1).oper[0]^.ref^) then
  6632. begin
  6633. { replacing fstp f;fld f by fst f is only valid for extended because of rounding or if fastmath is on }
  6634. if ((taicpu(p).opsize=S_FX) or (cs_opt_fastmath in current_settings.optimizerswitches)) and
  6635. GetNextInstruction(hp1, hp2) and
  6636. (((hp2.typ = ait_instruction) and
  6637. IsExitCode(hp2) and
  6638. (taicpu(p).oper[0]^.ref^.base = current_procinfo.FramePointer) and
  6639. not(assigned(current_procinfo.procdef.funcretsym) and
  6640. (taicpu(p).oper[0]^.ref^.offset < tabstractnormalvarsym(current_procinfo.procdef.funcretsym).localloc.reference.offset)) and
  6641. (taicpu(p).oper[0]^.ref^.index = NR_NO)) or
  6642. { fstp <temp>
  6643. fld <temp>
  6644. <dealloc> <temp>
  6645. }
  6646. ((taicpu(p).oper[0]^.ref^.base = current_procinfo.FramePointer) and
  6647. (taicpu(p).oper[0]^.ref^.index = NR_NO) and
  6648. SetAndTest(FindTempDeAlloc(taicpu(p).oper[0]^.ref^.offset,tai(hp1.next)),hp2) and
  6649. (tai_tempalloc(hp2).temppos=taicpu(p).oper[0]^.ref^.offset) and
  6650. (((taicpu(p).opsize=S_FX) and (tai_tempalloc(hp2).tempsize=16)) or
  6651. ((taicpu(p).opsize in [S_IQ,S_FL]) and (tai_tempalloc(hp2).tempsize=8)) or
  6652. ((taicpu(p).opsize=S_FS) and (tai_tempalloc(hp2).tempsize=4))
  6653. )
  6654. )
  6655. ) then
  6656. begin
  6657. DebugMsg(SPeepholeOptimization + 'FstpFld2<Nop>',p);
  6658. RemoveInstruction(hp1);
  6659. RemoveCurrentP(p, hp2);
  6660. { first case: exit code }
  6661. if hp2.typ = ait_instruction then
  6662. RemoveLastDeallocForFuncRes(p);
  6663. Result := true;
  6664. end
  6665. else
  6666. { we can do this only in fast math mode as fstp is rounding ...
  6667. ... still disabled as it breaks the compiler and/or rtl }
  6668. if { (cs_opt_fastmath in current_settings.optimizerswitches) or }
  6669. { ... or if another fstp equal to the first one follows }
  6670. GetNextInstruction(hp1,hp2) and
  6671. (hp2.typ = ait_instruction) and
  6672. (taicpu(p).opcode=taicpu(hp2).opcode) and
  6673. (taicpu(p).opsize=taicpu(hp2).opsize) then
  6674. begin
  6675. if (taicpu(p).oper[0]^.ref^.base = current_procinfo.FramePointer) and
  6676. (taicpu(p).oper[0]^.ref^.index = NR_NO) and
  6677. SetAndTest(FindTempDeAlloc(taicpu(p).oper[0]^.ref^.offset,tai(hp2.next)),hp3) and
  6678. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[0]^) and
  6679. (tai_tempalloc(hp3).temppos=taicpu(p).oper[0]^.ref^.offset) and
  6680. (((taicpu(p).opsize=S_FX) and (tai_tempalloc(hp3).tempsize=16)) or
  6681. ((taicpu(p).opsize in [S_IQ,S_FL]) and (tai_tempalloc(hp3).tempsize=8)) or
  6682. ((taicpu(p).opsize=S_FS) and (tai_tempalloc(hp3).tempsize=4))
  6683. ) then
  6684. begin
  6685. DebugMsg(SPeepholeOptimization + 'FstpFldFstp2Fstp',p);
  6686. RemoveCurrentP(p,hp2);
  6687. RemoveInstruction(hp1);
  6688. Result := true;
  6689. end
  6690. else if { fst can't store an extended/comp value }
  6691. (taicpu(p).opsize <> S_FX) and
  6692. (taicpu(p).opsize <> S_IQ) then
  6693. begin
  6694. if (taicpu(p).opcode = A_FSTP) then
  6695. taicpu(p).opcode := A_FST
  6696. else
  6697. taicpu(p).opcode := A_FIST;
  6698. DebugMsg(SPeepholeOptimization + 'FstpFld2Fst',p);
  6699. RemoveInstruction(hp1);
  6700. Result := true;
  6701. end;
  6702. end;
  6703. end;
  6704. end;
  6705. function TX86AsmOptimizer.OptPass1FLD(var p : tai) : boolean;
  6706. var
  6707. hp1, hp2, hp3: tai;
  6708. begin
  6709. result:=false;
  6710. if MatchOpType(taicpu(p),top_reg) and
  6711. GetNextInstruction(p, hp1) and
  6712. (hp1.typ = Ait_Instruction) and
  6713. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  6714. (taicpu(hp1).oper[0]^.reg = NR_ST) and
  6715. (taicpu(hp1).oper[1]^.reg = NR_ST1) then
  6716. { change to
  6717. fld reg fxxx reg,st
  6718. fxxxp st, st1 (hp1)
  6719. Remark: non commutative operations must be reversed!
  6720. }
  6721. begin
  6722. case taicpu(hp1).opcode Of
  6723. A_FMULP,A_FADDP,
  6724. A_FSUBP,A_FDIVP,A_FSUBRP,A_FDIVRP:
  6725. begin
  6726. case taicpu(hp1).opcode Of
  6727. A_FADDP: taicpu(hp1).opcode := A_FADD;
  6728. A_FMULP: taicpu(hp1).opcode := A_FMUL;
  6729. A_FSUBP: taicpu(hp1).opcode := A_FSUBR;
  6730. A_FSUBRP: taicpu(hp1).opcode := A_FSUB;
  6731. A_FDIVP: taicpu(hp1).opcode := A_FDIVR;
  6732. A_FDIVRP: taicpu(hp1).opcode := A_FDIV;
  6733. else
  6734. internalerror(2019050534);
  6735. end;
  6736. taicpu(hp1).oper[0]^.reg := taicpu(p).oper[0]^.reg;
  6737. taicpu(hp1).oper[1]^.reg := NR_ST;
  6738. DebugMsg(SPeepholeOptimization + 'FldF*p2F*',hp1);
  6739. RemoveCurrentP(p, hp1);
  6740. Result:=true;
  6741. exit;
  6742. end;
  6743. else
  6744. ;
  6745. end;
  6746. end
  6747. else
  6748. if MatchOpType(taicpu(p),top_ref) and
  6749. GetNextInstruction(p, hp2) and
  6750. (hp2.typ = Ait_Instruction) and
  6751. MatchOpType(taicpu(hp2),top_reg,top_reg) and
  6752. (taicpu(p).opsize in [S_FS, S_FL]) and
  6753. (taicpu(hp2).oper[0]^.reg = NR_ST) and
  6754. (taicpu(hp2).oper[1]^.reg = NR_ST1) then
  6755. if GetLastInstruction(p, hp1) and
  6756. MatchInstruction(hp1,A_FLD,A_FST,[taicpu(p).opsize]) and
  6757. MatchOpType(taicpu(hp1),top_ref) and
  6758. RefsEqual(taicpu(p).oper[0]^.ref^, taicpu(hp1).oper[0]^.ref^) then
  6759. if ((taicpu(hp2).opcode = A_FMULP) or
  6760. (taicpu(hp2).opcode = A_FADDP)) then
  6761. { change to
  6762. fld/fst mem1 (hp1) fld/fst mem1
  6763. fld mem1 (p) fadd/
  6764. faddp/ fmul st, st
  6765. fmulp st, st1 (hp2) }
  6766. begin
  6767. DebugMsg(SPeepholeOptimization + 'Fld/FstFldFaddp/Fmulp2Fld/FstFadd/Fmul',hp1);
  6768. RemoveCurrentP(p, hp1);
  6769. if (taicpu(hp2).opcode = A_FADDP) then
  6770. taicpu(hp2).opcode := A_FADD
  6771. else
  6772. taicpu(hp2).opcode := A_FMUL;
  6773. taicpu(hp2).oper[1]^.reg := NR_ST;
  6774. end
  6775. else
  6776. { change to
  6777. fld/fst mem1 (hp1) fld/fst mem1
  6778. fld mem1 (p) fld st
  6779. }
  6780. begin
  6781. DebugMsg(SPeepholeOptimization + 'Fld/Fst<mem>Fld<mem>2Fld/Fst<mem>Fld<reg>',hp1);
  6782. taicpu(p).changeopsize(S_FL);
  6783. taicpu(p).loadreg(0,NR_ST);
  6784. end
  6785. else
  6786. begin
  6787. case taicpu(hp2).opcode Of
  6788. A_FMULP,A_FADDP,A_FSUBP,A_FDIVP,A_FSUBRP,A_FDIVRP:
  6789. { change to
  6790. fld/fst mem1 (hp1) fld/fst mem1
  6791. fld mem2 (p) fxxx mem2
  6792. fxxxp st, st1 (hp2) }
  6793. begin
  6794. case taicpu(hp2).opcode Of
  6795. A_FADDP: taicpu(p).opcode := A_FADD;
  6796. A_FMULP: taicpu(p).opcode := A_FMUL;
  6797. A_FSUBP: taicpu(p).opcode := A_FSUBR;
  6798. A_FSUBRP: taicpu(p).opcode := A_FSUB;
  6799. A_FDIVP: taicpu(p).opcode := A_FDIVR;
  6800. A_FDIVRP: taicpu(p).opcode := A_FDIV;
  6801. else
  6802. internalerror(2019050533);
  6803. end;
  6804. DebugMsg(SPeepholeOptimization + 'Fld/FstFldF*2Fld/FstF*',p);
  6805. RemoveInstruction(hp2);
  6806. end
  6807. else
  6808. ;
  6809. end
  6810. end
  6811. end;
  6812. function IsCmpSubset(cond1, cond2: TAsmCond): Boolean; inline;
  6813. begin
  6814. Result := condition_in(cond1, cond2) or
  6815. { Not strictly subsets due to the actual flags checked, but because we're
  6816. comparing integers, E is a subset of AE and GE and their aliases }
  6817. ((cond1 in [C_E, C_Z]) and (cond2 in [C_AE, C_NB, C_NC, C_GE, C_NL]));
  6818. end;
  6819. function TX86AsmOptimizer.OptPass1Cmp(var p: tai): boolean;
  6820. var
  6821. v: TCGInt;
  6822. hp1, hp2, p_dist, p_jump, hp1_dist, p_label, hp1_label: tai;
  6823. FirstMatch, TempBool: Boolean;
  6824. NewReg: TRegister;
  6825. JumpLabel, JumpLabel_dist, JumpLabel_far: TAsmLabel;
  6826. begin
  6827. Result:=false;
  6828. { All these optimisations need a next instruction }
  6829. if not GetNextInstruction(p, hp1) then
  6830. Exit;
  6831. { Search for:
  6832. cmp ###,###
  6833. j(c1) @lbl1
  6834. ...
  6835. @lbl:
  6836. cmp ###,### (same comparison as above)
  6837. j(c2) @lbl2
  6838. If c1 is a subset of c2, change to:
  6839. cmp ###,###
  6840. j(c1) @lbl2
  6841. (@lbl1 may become a dead label as a result)
  6842. }
  6843. { Also handle cases where there are multiple jumps in a row }
  6844. p_jump := hp1;
  6845. while Assigned(p_jump) and MatchInstruction(p_jump, A_JCC, []) do
  6846. begin
  6847. if IsJumpToLabel(taicpu(p_jump)) then
  6848. begin
  6849. { Do jump optimisations first in case the condition becomes
  6850. unnecessary }
  6851. TempBool := True;
  6852. if DoJumpOptimizations(p_jump, TempBool) or
  6853. not TempBool then
  6854. begin
  6855. if Assigned(p_jump) then
  6856. begin
  6857. hp1 := p_jump;
  6858. if (p_jump.typ in [ait_align]) then
  6859. SkipAligns(p_jump, p_jump);
  6860. { CollapseZeroDistJump will be set to the label after the
  6861. jump if it optimises, whether or not it's live or dead }
  6862. if (p_jump.typ in [ait_label]) and
  6863. not (tai_label(p_jump).labsym.is_used) then
  6864. GetNextInstruction(p_jump, p_jump);
  6865. end;
  6866. TransferUsedRegs(TmpUsedRegs);
  6867. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  6868. if not Assigned(p_jump) or
  6869. (
  6870. not MatchInstruction(p_jump, A_Jcc, A_SETcc, A_CMOVcc, []) and
  6871. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, p_jump, TmpUsedRegs)
  6872. ) then
  6873. begin
  6874. { No more conditional jumps; conditional statement is no longer required }
  6875. DebugMsg(SPeepholeOptimization + 'Removed unnecessary condition (Cmp2Nop)', p);
  6876. RemoveCurrentP(p);
  6877. Result := True;
  6878. Exit;
  6879. end;
  6880. hp1 := p_jump;
  6881. Include(OptsToCheck, aoc_ForceNewIteration);
  6882. Continue;
  6883. end;
  6884. JumpLabel := TAsmLabel(taicpu(p_jump).oper[0]^.ref^.symbol);
  6885. if GetNextInstruction(p_jump, hp2) and
  6886. (
  6887. OptimizeConditionalJump(JumpLabel, p_jump, hp2, TempBool) or
  6888. not TempBool
  6889. ) then
  6890. begin
  6891. hp1 := p_jump;
  6892. Include(OptsToCheck, aoc_ForceNewIteration);
  6893. Continue;
  6894. end;
  6895. p_label := nil;
  6896. if Assigned(JumpLabel) then
  6897. p_label := getlabelwithsym(JumpLabel);
  6898. if Assigned(p_label) and
  6899. GetNextInstruction(p_label, p_dist) and
  6900. MatchInstruction(p_dist, A_CMP, []) and
  6901. MatchOperand(taicpu(p_dist).oper[0]^, taicpu(p).oper[0]^) and
  6902. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p).oper[1]^) and
  6903. GetNextInstruction(p_dist, hp1_dist) and
  6904. MatchInstruction(hp1_dist, A_JCC, []) then { This doesn't have to be an explicit label }
  6905. begin
  6906. JumpLabel_dist := TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol);
  6907. if JumpLabel = JumpLabel_dist then
  6908. { This is an infinite loop }
  6909. Exit;
  6910. { Best optimisation when the first condition is a subset (or equal) of the second }
  6911. if IsCmpSubset(taicpu(p_jump).condition, taicpu(hp1_dist).condition) then
  6912. begin
  6913. { Any registers used here will already be allocated }
  6914. if Assigned(JumpLabel) then
  6915. JumpLabel.DecRefs;
  6916. DebugMsg(SPeepholeOptimization + 'CMP/Jcc/@Lbl/CMP/Jcc -> CMP/Jcc, redirecting first jump', p_jump);
  6917. taicpu(p_jump).loadref(0, taicpu(hp1_dist).oper[0]^.ref^); { This also increases the reference count }
  6918. Result := True;
  6919. { Don't exit yet. Since p and p_jump haven't actually been
  6920. removed, we can check for more on this iteration }
  6921. end
  6922. else if IsCmpSubset(taicpu(hp1_dist).condition, inverse_cond(taicpu(p_jump).condition)) and
  6923. GetNextInstruction(hp1_dist, hp1_label) and
  6924. SkipAligns(hp1_label, hp1_label) and
  6925. (hp1_label.typ = ait_label) then
  6926. begin
  6927. JumpLabel_far := tai_label(hp1_label).labsym;
  6928. if (JumpLabel_far = JumpLabel_dist) or (JumpLabel_far = JumpLabel) then
  6929. { This is an infinite loop }
  6930. Exit;
  6931. if Assigned(JumpLabel_far) then
  6932. begin
  6933. { In this situation, if the first jump branches, the second one will never,
  6934. branch so change the destination label to after the second jump }
  6935. DebugMsg(SPeepholeOptimization + 'CMP/Jcc/@Lbl/CMP/Jcc/@Lbl -> CMP/Jcc, redirecting first jump to 2nd label', p_jump);
  6936. if Assigned(JumpLabel) then
  6937. JumpLabel.DecRefs;
  6938. JumpLabel_far.IncRefs;
  6939. taicpu(p_jump).oper[0]^.ref^.symbol := JumpLabel_far;
  6940. Result := True;
  6941. { Don't exit yet. Since p and p_jump haven't actually been
  6942. removed, we can check for more on this iteration }
  6943. Continue;
  6944. end;
  6945. end;
  6946. end;
  6947. end;
  6948. { Search for:
  6949. cmp ###,###
  6950. j(c1) @lbl1
  6951. cmp ###,### (same as first)
  6952. Remove second cmp
  6953. }
  6954. if GetNextInstruction(p_jump, hp2) and
  6955. (
  6956. (
  6957. MatchInstruction(hp2, A_CMP, [taicpu(p).opsize]) and
  6958. (
  6959. (
  6960. MatchOpType(taicpu(p), top_const, top_reg) and
  6961. MatchOpType(taicpu(hp2), top_const, top_reg) and
  6962. (taicpu(hp2).oper[0]^.val = taicpu(p).oper[0]^.val) and
  6963. Reg1WriteOverwritesReg2Entirely(taicpu(hp2).oper[1]^.reg, taicpu(p).oper[1]^.reg)
  6964. ) or (
  6965. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[0]^) and
  6966. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^)
  6967. )
  6968. )
  6969. ) or (
  6970. { Also match cmp $0,%reg; jcc @lbl; test %reg,%reg }
  6971. MatchOperand(taicpu(p).oper[0]^, 0) and
  6972. (taicpu(p).oper[1]^.typ = top_reg) and
  6973. MatchInstruction(hp2, A_TEST, []) and
  6974. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  6975. (taicpu(hp2).oper[0]^.reg = taicpu(hp2).oper[1]^.reg) and
  6976. Reg1WriteOverwritesReg2Entirely(taicpu(hp2).oper[1]^.reg, taicpu(p).oper[1]^.reg)
  6977. )
  6978. ) then
  6979. begin
  6980. DebugMsg(SPeepholeOptimization + 'CMP/Jcc/CMP; removed superfluous CMP', hp2);
  6981. RemoveInstruction(hp2);
  6982. Result := True;
  6983. { Continue the while loop in case "Jcc/CMP" follows the second CMP that was just removed }
  6984. end;
  6985. GetNextInstruction(p_jump, p_jump);
  6986. end;
  6987. if (
  6988. { Don't call GetNextInstruction again if we already have it }
  6989. (hp1 = p_jump) or
  6990. GetNextInstruction(p, hp1)
  6991. ) and
  6992. MatchInstruction(hp1, A_Jcc, []) and
  6993. IsJumpToLabel(taicpu(hp1)) and
  6994. (taicpu(hp1).condition in [C_E, C_Z, C_NE, C_NZ]) and
  6995. GetNextInstruction(hp1, hp2) then
  6996. begin
  6997. {
  6998. cmp x, y (or "cmp y, x")
  6999. je @lbl
  7000. mov x, y
  7001. @lbl:
  7002. (x and y can be constants, registers or references)
  7003. Change to:
  7004. mov x, y (x and y will always be equal in the end)
  7005. @lbl: (may beceome a dead label)
  7006. Also:
  7007. cmp x, y (or "cmp y, x")
  7008. jne @lbl
  7009. mov x, y
  7010. @lbl:
  7011. (x and y can be constants, registers or references)
  7012. Change to:
  7013. Absolutely nothing! (Except @lbl if it's still live)
  7014. }
  7015. if MatchInstruction(hp2, A_MOV, [taicpu(p).opsize]) and
  7016. (
  7017. (
  7018. MatchOperand(taicpu(p).oper[0]^, taicpu(hp2).oper[0]^) and
  7019. MatchOperand(taicpu(p).oper[1]^, taicpu(hp2).oper[1]^)
  7020. ) or (
  7021. MatchOperand(taicpu(p).oper[0]^, taicpu(hp2).oper[1]^) and
  7022. MatchOperand(taicpu(p).oper[1]^, taicpu(hp2).oper[0]^)
  7023. )
  7024. ) and
  7025. GetNextInstruction(hp2, hp1_label) and
  7026. SkipAligns(hp1_label, hp1_label) and
  7027. (hp1_label.typ = ait_label) and
  7028. (tai_label(hp1_label).labsym = taicpu(hp1).oper[0]^.ref^.symbol) then
  7029. begin
  7030. tai_label(hp1_label).labsym.DecRefs;
  7031. if (taicpu(hp1).condition in [C_NE, C_NZ]) then
  7032. begin
  7033. DebugMsg(SPeepholeOptimization + 'CMP/JNE/MOV/@Lbl -> NOP, since the MOV is only executed if the operands are equal (CmpJneMov2Nop)', p);
  7034. RemoveInstruction(hp2);
  7035. hp2 := hp1_label; { So RemoveCurrentp below can be set to something valid }
  7036. end
  7037. else
  7038. DebugMsg(SPeepholeOptimization + 'CMP/JE/MOV/@Lbl -> MOV, since the MOV is only executed if the operands aren''t equal (CmpJeMov2Mov)', p);
  7039. RemoveInstruction(hp1);
  7040. RemoveCurrentp(p, hp2);
  7041. Result := True;
  7042. Exit;
  7043. end;
  7044. {
  7045. Try to optimise the following:
  7046. cmp $x,### ($x and $y can be registers or constants)
  7047. je @lbl1 (only reference)
  7048. cmp $y,### (### are identical)
  7049. @Lbl:
  7050. sete %reg1
  7051. Change to:
  7052. cmp $x,###
  7053. sete %reg2 (allocate new %reg2)
  7054. cmp $y,###
  7055. sete %reg1
  7056. orb %reg2,%reg1
  7057. (dealloc %reg2)
  7058. This adds an instruction (so don't perform under -Os), but it removes
  7059. a conditional branch.
  7060. }
  7061. if not (cs_opt_size in current_settings.optimizerswitches) and
  7062. MatchInstruction(hp2, A_CMP, A_TEST, [taicpu(p).opsize]) and
  7063. MatchOperand(taicpu(p).oper[1]^, taicpu(hp2).oper[1]^) and
  7064. { The first operand of CMP instructions can only be a register or
  7065. immediate anyway, so no need to check }
  7066. GetNextInstruction(hp2, p_label) and
  7067. (p_label.typ = ait_label) and
  7068. (tai_label(p_label).labsym.getrefs = 1) and
  7069. (JumpTargetOp(taicpu(hp1))^.ref^.symbol = tai_label(p_label).labsym) and
  7070. GetNextInstruction(p_label, p_dist) and
  7071. MatchInstruction(p_dist, A_SETcc, []) and
  7072. (taicpu(p_dist).condition in [C_E, C_Z]) and
  7073. (taicpu(p_dist).oper[0]^.typ = top_reg) then
  7074. begin
  7075. TransferUsedRegs(TmpUsedRegs);
  7076. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  7077. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  7078. UpdateUsedRegs(TmpUsedRegs, tai(p_label.Next));
  7079. UpdateUsedRegs(TmpUsedRegs, tai(p_dist.Next));
  7080. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) and
  7081. { Get the instruction after the SETcc instruction so we can
  7082. allocate a new register over the entire range }
  7083. GetNextInstruction(p_dist, hp1_dist) then
  7084. begin
  7085. { Register can appear in p if it's not used afterwards, so only
  7086. allocate between hp1 and hp1_dist }
  7087. NewReg := GetIntRegisterBetween(R_SUBL, TmpUsedRegs, hp1, hp1_dist);
  7088. if NewReg <> NR_NO then
  7089. begin
  7090. DebugMsg(SPeepholeOptimization + 'CMP/JE/CMP/@Lbl/SETE -> CMP/SETE/CMP/SETE/OR, removing conditional branch', p);
  7091. { Change the jump instruction into a SETcc instruction }
  7092. taicpu(hp1).opcode := A_SETcc;
  7093. taicpu(hp1).opsize := S_B;
  7094. taicpu(hp1).loadreg(0, NewReg);
  7095. { This is now a dead label }
  7096. tai_label(p_label).labsym.decrefs;
  7097. { Prefer adding before the next instruction so the FLAGS
  7098. register is deallicated first }
  7099. AsmL.InsertBefore(
  7100. taicpu.op_reg_reg(A_OR, S_B, NewReg, taicpu(p_dist).oper[0]^.reg),
  7101. hp1_dist
  7102. );
  7103. Result := True;
  7104. { Don't exit yet, as p wasn't changed and hp1, while
  7105. modified, is still intact and might be optimised by the
  7106. SETcc optimisation below }
  7107. end;
  7108. end;
  7109. end;
  7110. end;
  7111. if taicpu(p).oper[0]^.typ = top_const then
  7112. begin
  7113. if (taicpu(p).oper[0]^.val = 0) and
  7114. (taicpu(p).oper[1]^.typ = top_reg) and
  7115. MatchInstruction(hp1,A_Jcc,A_SETcc,[]) then
  7116. begin
  7117. hp2 := p;
  7118. FirstMatch := True;
  7119. { When dealing with "cmp $0,%reg", only ZF and SF contain
  7120. anything meaningful once it's converted to "test %reg,%reg";
  7121. additionally, some jumps will always (or never) branch, so
  7122. evaluate every jump immediately following the
  7123. comparison, optimising the conditions if possible.
  7124. Similarly with SETcc... those that are always set to 0 or 1
  7125. are changed to MOV instructions }
  7126. while FirstMatch or { Saves calling GetNextInstruction unnecessarily }
  7127. (
  7128. GetNextInstruction(hp2, hp1) and
  7129. MatchInstruction(hp1,A_Jcc,A_SETcc,[])
  7130. ) do
  7131. begin
  7132. FirstMatch := False;
  7133. case taicpu(hp1).condition of
  7134. C_B, C_C, C_NAE, C_O:
  7135. { For B/NAE:
  7136. Will never branch since an unsigned integer can never be below zero
  7137. For C/O:
  7138. Result cannot overflow because 0 is being subtracted
  7139. }
  7140. begin
  7141. if taicpu(hp1).opcode = A_Jcc then
  7142. begin
  7143. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition B/C/NAE/O --> Never (jump removed)', hp1);
  7144. TAsmLabel(taicpu(hp1).oper[0]^.ref^.symbol).decrefs;
  7145. RemoveInstruction(hp1);
  7146. { Since hp1 was deleted, hp2 must not be updated }
  7147. Continue;
  7148. end
  7149. else
  7150. begin
  7151. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition B/C/NAE/O --> Never (set -> mov 0)', hp1);
  7152. { Convert "set(c) %reg" instruction to "movb 0,%reg" }
  7153. taicpu(hp1).opcode := A_MOV;
  7154. taicpu(hp1).ops := 2;
  7155. taicpu(hp1).condition := C_None;
  7156. taicpu(hp1).opsize := S_B;
  7157. taicpu(hp1).loadreg(1,taicpu(hp1).oper[0]^.reg);
  7158. taicpu(hp1).loadconst(0, 0);
  7159. end;
  7160. end;
  7161. C_BE, C_NA:
  7162. begin
  7163. { Will only branch if equal to zero }
  7164. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition BE/NA --> E', hp1);
  7165. taicpu(hp1).condition := C_E;
  7166. end;
  7167. C_A, C_NBE:
  7168. begin
  7169. { Will only branch if not equal to zero }
  7170. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition A/NBE --> NE', hp1);
  7171. taicpu(hp1).condition := C_NE;
  7172. end;
  7173. C_AE, C_NB, C_NC, C_NO:
  7174. begin
  7175. { Will always branch }
  7176. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition AE/NB/NC/NO --> Always', hp1);
  7177. if taicpu(hp1).opcode = A_Jcc then
  7178. begin
  7179. MakeUnconditional(taicpu(hp1));
  7180. { Any jumps/set that follow will now be dead code }
  7181. RemoveDeadCodeAfterJump(taicpu(hp1));
  7182. Break;
  7183. end
  7184. else
  7185. begin
  7186. { Convert "set(c) %reg" instruction to "movb 1,%reg" }
  7187. taicpu(hp1).opcode := A_MOV;
  7188. taicpu(hp1).ops := 2;
  7189. taicpu(hp1).condition := C_None;
  7190. taicpu(hp1).opsize := S_B;
  7191. taicpu(hp1).loadreg(1,taicpu(hp1).oper[0]^.reg);
  7192. taicpu(hp1).loadconst(0, 1);
  7193. end;
  7194. end;
  7195. C_None:
  7196. InternalError(2020012201);
  7197. C_P, C_PE, C_NP, C_PO:
  7198. { We can't handle parity checks and they should never be generated
  7199. after a general-purpose CMP (it's used in some floating-point
  7200. comparisons that don't use CMP) }
  7201. InternalError(2020012202);
  7202. else
  7203. { Zero/Equality, Sign, their complements and all of the
  7204. signed comparisons do not need to be converted };
  7205. end;
  7206. hp2 := hp1;
  7207. end;
  7208. { Convert the instruction to a TEST }
  7209. taicpu(p).opcode := A_TEST;
  7210. taicpu(p).loadreg(0,taicpu(p).oper[1]^.reg);
  7211. Result := True;
  7212. Exit;
  7213. end
  7214. else if (taicpu(p).oper[0]^.val = 1) and
  7215. MatchInstruction(hp1,A_Jcc,A_SETcc,[]) and
  7216. (taicpu(hp1).condition in [C_L, C_NL, C_NGE, C_GE]) then
  7217. begin
  7218. { Convert; To:
  7219. cmp $1,r/m cmp $0,r/m
  7220. jl @lbl jle @lbl
  7221. (Also do inverted conditions)
  7222. }
  7223. DebugMsg(SPeepholeOptimization + 'Cmp1Jl2Cmp0Jle', p);
  7224. taicpu(p).oper[0]^.val := 0;
  7225. if taicpu(hp1).condition in [C_L, C_NGE] then
  7226. taicpu(hp1).condition := C_LE
  7227. else
  7228. taicpu(hp1).condition := C_NLE;
  7229. { If the instruction is now "cmp $0,%reg", convert it to a
  7230. TEST (and effectively do the work of the "cmp $0,%reg" in
  7231. the block above)
  7232. }
  7233. if (taicpu(p).oper[1]^.typ = top_reg) then
  7234. begin
  7235. taicpu(p).opcode := A_TEST;
  7236. taicpu(p).loadreg(0,taicpu(p).oper[1]^.reg);
  7237. end;
  7238. Result := True;
  7239. Exit;
  7240. end
  7241. else if (taicpu(p).oper[1]^.typ = top_reg)
  7242. {$ifdef x86_64}
  7243. and (taicpu(p).opsize <> S_Q) { S_Q will never happen: cmp with 64 bit constants is not possible }
  7244. {$endif x86_64}
  7245. then
  7246. begin
  7247. { cmp register,$8000 neg register
  7248. je target --> jo target
  7249. .... only if register is deallocated before jump.}
  7250. case Taicpu(p).opsize of
  7251. S_B: v:=$80;
  7252. S_W: v:=$8000;
  7253. S_L: v:=qword($80000000);
  7254. else
  7255. internalerror(2013112905);
  7256. end;
  7257. if (taicpu(p).oper[0]^.val=v) and
  7258. MatchInstruction(hp1,A_Jcc,A_SETcc,[]) and
  7259. (Taicpu(hp1).condition in [C_E,C_NE]) then
  7260. begin
  7261. TransferUsedRegs(TmpUsedRegs);
  7262. UpdateUsedRegs(TmpUsedRegs,tai(p.next));
  7263. if not(RegInUsedRegs(Taicpu(p).oper[1]^.reg, TmpUsedRegs)) then
  7264. begin
  7265. DebugMsg(SPeepholeOptimization + 'CmpJe2NegJo done',p);
  7266. Taicpu(p).opcode:=A_NEG;
  7267. Taicpu(p).loadoper(0,Taicpu(p).oper[1]^);
  7268. Taicpu(p).clearop(1);
  7269. Taicpu(p).ops:=1;
  7270. if Taicpu(hp1).condition=C_E then
  7271. Taicpu(hp1).condition:=C_O
  7272. else
  7273. Taicpu(hp1).condition:=C_NO;
  7274. Result:=true;
  7275. exit;
  7276. end;
  7277. end;
  7278. end;
  7279. end;
  7280. if TrySwapMovCmp(p, hp1) then
  7281. begin
  7282. Result := True;
  7283. Exit;
  7284. end;
  7285. end;
  7286. function TX86AsmOptimizer.OptPass1PXor(var p: tai): boolean;
  7287. var
  7288. hp1: tai;
  7289. begin
  7290. {
  7291. remove the second (v)pxor from
  7292. pxor reg,reg
  7293. ...
  7294. pxor reg,reg
  7295. }
  7296. Result:=false;
  7297. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) and
  7298. MatchOpType(taicpu(p),top_reg,top_reg) and
  7299. GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[0]^.reg) and
  7300. MatchInstruction(hp1,taicpu(p).opcode,[taicpu(p).opsize]) and
  7301. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[0]^) and
  7302. MatchOperand(taicpu(hp1).oper[0]^,taicpu(hp1).oper[1]^) then
  7303. begin
  7304. DebugMsg(SPeepholeOptimization + 'PXorPXor2PXor done',hp1);
  7305. RemoveInstruction(hp1);
  7306. Result:=true;
  7307. Exit;
  7308. end
  7309. {
  7310. replace
  7311. pxor reg1,reg1
  7312. movapd/s reg1,reg2
  7313. dealloc reg1
  7314. by
  7315. pxor reg2,reg2
  7316. }
  7317. else if GetNextInstruction(p,hp1) and
  7318. { we mix single and double opperations here because we assume that the compiler
  7319. generates vmovapd only after double operations and vmovaps only after single operations }
  7320. MatchInstruction(hp1,A_MOVAPD,A_MOVAPS,[S_NO]) and
  7321. MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) and
  7322. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  7323. (taicpu(p).oper[0]^.typ=top_reg) then
  7324. begin
  7325. TransferUsedRegs(TmpUsedRegs);
  7326. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7327. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  7328. begin
  7329. taicpu(p).loadoper(0,taicpu(hp1).oper[1]^);
  7330. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  7331. DebugMsg(SPeepholeOptimization + 'PXorMovapd2PXor done',p);
  7332. RemoveInstruction(hp1);
  7333. result:=true;
  7334. end;
  7335. end;
  7336. end;
  7337. function TX86AsmOptimizer.OptPass1VPXor(var p: tai): boolean;
  7338. var
  7339. hp1: tai;
  7340. begin
  7341. {
  7342. remove the second (v)pxor from
  7343. (v)pxor reg,reg
  7344. ...
  7345. (v)pxor reg,reg
  7346. }
  7347. Result:=false;
  7348. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^,taicpu(p).oper[2]^) and
  7349. MatchOpType(taicpu(p),top_reg,top_reg,top_reg) then
  7350. begin
  7351. if GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[0]^.reg) and
  7352. MatchInstruction(hp1,taicpu(p).opcode,[taicpu(p).opsize]) and
  7353. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[0]^) and
  7354. MatchOperand(taicpu(hp1).oper[0]^,taicpu(hp1).oper[1]^,taicpu(hp1).oper[2]^) then
  7355. begin
  7356. DebugMsg(SPeepholeOptimization + 'VPXorVPXor2VPXor done',hp1);
  7357. RemoveInstruction(hp1);
  7358. Result:=true;
  7359. Exit;
  7360. end;
  7361. {$ifdef x86_64}
  7362. {
  7363. replace
  7364. vpxor reg1,reg1,reg1
  7365. vmov reg,mem
  7366. by
  7367. movq $0,mem
  7368. }
  7369. if GetNextInstruction(p,hp1) and
  7370. MatchInstruction(hp1,A_VMOVSD,[]) and
  7371. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  7372. MatchOpType(taicpu(hp1),top_reg,top_ref) then
  7373. begin
  7374. TransferUsedRegs(TmpUsedRegs);
  7375. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7376. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  7377. begin
  7378. taicpu(hp1).loadconst(0,0);
  7379. taicpu(hp1).opcode:=A_MOV;
  7380. taicpu(hp1).opsize:=S_Q;
  7381. DebugMsg(SPeepholeOptimization + 'VPXorVMov2Mov done',p);
  7382. RemoveCurrentP(p);
  7383. result:=true;
  7384. Exit;
  7385. end;
  7386. end;
  7387. {$endif x86_64}
  7388. end
  7389. {
  7390. replace
  7391. vpxor reg1,reg1,reg2
  7392. by
  7393. vpxor reg2,reg2,reg2
  7394. to avoid unncessary data dependencies
  7395. }
  7396. else if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) and
  7397. MatchOpType(taicpu(p),top_reg,top_reg,top_reg) then
  7398. begin
  7399. DebugMsg(SPeepholeOptimization + 'VPXor2VPXor done',p);
  7400. { avoid unncessary data dependency }
  7401. taicpu(p).loadreg(0,taicpu(p).oper[2]^.reg);
  7402. taicpu(p).loadreg(1,taicpu(p).oper[2]^.reg);
  7403. result:=true;
  7404. exit;
  7405. end;
  7406. Result:=OptPass1VOP(p);
  7407. end;
  7408. function TX86AsmOptimizer.OptPass1Imul(var p: tai): boolean;
  7409. var
  7410. hp1 : tai;
  7411. begin
  7412. result:=false;
  7413. { replace
  7414. IMul const,%mreg1,%mreg2
  7415. Mov %reg2,%mreg3
  7416. dealloc %mreg3
  7417. by
  7418. Imul const,%mreg1,%mreg23
  7419. }
  7420. if (taicpu(p).ops=3) and
  7421. GetNextInstruction(p,hp1) and
  7422. MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) and
  7423. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  7424. (taicpu(hp1).oper[1]^.typ=top_reg) then
  7425. begin
  7426. TransferUsedRegs(TmpUsedRegs);
  7427. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7428. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  7429. begin
  7430. taicpu(p).loadoper(2,taicpu(hp1).oper[1]^);
  7431. DebugMsg(SPeepholeOptimization + 'ImulMov2Imul done',p);
  7432. RemoveInstruction(hp1);
  7433. result:=true;
  7434. end;
  7435. end;
  7436. end;
  7437. function TX86AsmOptimizer.OptPass1SHXX(var p: tai): boolean;
  7438. var
  7439. hp1 : tai;
  7440. begin
  7441. result:=false;
  7442. { replace
  7443. IMul %reg0,%reg1,%reg2
  7444. Mov %reg2,%reg3
  7445. dealloc %reg2
  7446. by
  7447. Imul %reg0,%reg1,%reg3
  7448. }
  7449. if GetNextInstruction(p,hp1) and
  7450. MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) and
  7451. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  7452. (taicpu(hp1).oper[1]^.typ=top_reg) then
  7453. begin
  7454. TransferUsedRegs(TmpUsedRegs);
  7455. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7456. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  7457. begin
  7458. taicpu(p).loadoper(2,taicpu(hp1).oper[1]^);
  7459. DebugMsg(SPeepholeOptimization + 'SHXXMov2SHXX done',p);
  7460. RemoveInstruction(hp1);
  7461. result:=true;
  7462. end;
  7463. end;
  7464. end;
  7465. function TX86AsmOptimizer.OptPass1_V_Cvtss2sd(var p: tai): boolean;
  7466. var
  7467. hp1: tai;
  7468. begin
  7469. Result:=false;
  7470. { get rid of
  7471. (v)cvtss2sd reg0,<reg1,>reg2
  7472. (v)cvtss2sd reg2,<reg2,>reg0
  7473. }
  7474. if GetNextInstruction(p,hp1) and
  7475. (((taicpu(p).opcode=A_CVTSS2SD) and MatchInstruction(hp1,A_CVTSD2SS,[taicpu(p).opsize]) and
  7476. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[1]^) and MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^)) or
  7477. ((taicpu(p).opcode=A_VCVTSS2SD) and MatchInstruction(hp1,A_VCVTSD2SS,[taicpu(p).opsize]) and
  7478. MatchOpType(taicpu(p),top_reg,top_reg,top_reg) and
  7479. MatchOpType(taicpu(hp1),top_reg,top_reg,top_reg) and
  7480. (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) and
  7481. (getsupreg(taicpu(hp1).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg)) and
  7482. (getsupreg(taicpu(p).oper[2]^.reg)=getsupreg(taicpu(hp1).oper[0]^.reg))
  7483. )
  7484. ) then
  7485. begin
  7486. if ((taicpu(p).opcode=A_CVTSS2SD) and (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg))) or
  7487. ((taicpu(p).opcode=A_VCVTSS2SD) and (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[2]^.reg))) then
  7488. begin
  7489. DebugMsg(SPeepholeOptimization + '(V)Cvtss2CvtSd(V)Cvtsd2ss2Nop done',p);
  7490. RemoveCurrentP(p);
  7491. RemoveInstruction(hp1);
  7492. end
  7493. else
  7494. begin
  7495. DebugMsg(SPeepholeOptimization + '(V)Cvtss2CvtSd(V)Cvtsd2ss2Vmovaps done',p);
  7496. if taicpu(hp1).opcode=A_CVTSD2SS then
  7497. begin
  7498. taicpu(p).loadreg(1,taicpu(hp1).oper[1]^.reg);
  7499. taicpu(p).opcode:=A_MOVAPS;
  7500. end
  7501. else
  7502. begin
  7503. taicpu(p).loadreg(1,taicpu(hp1).oper[2]^.reg);
  7504. taicpu(p).opcode:=A_VMOVAPS;
  7505. end;
  7506. taicpu(p).ops:=2;
  7507. RemoveInstruction(hp1);
  7508. end;
  7509. Result:=true;
  7510. Exit;
  7511. end;
  7512. end;
  7513. function TX86AsmOptimizer.OptPass1Jcc(var p : tai) : boolean;
  7514. var
  7515. hp1, hp2, hp3, hp4, hp5, hp6: tai;
  7516. ThisReg: TRegister;
  7517. begin
  7518. Result := False;
  7519. if not GetNextInstruction(p,hp1) then
  7520. Exit;
  7521. {
  7522. convert
  7523. j<c> .L1
  7524. mov 1,reg
  7525. jmp .L2
  7526. .L1
  7527. mov 0,reg
  7528. .L2
  7529. into
  7530. mov 0,reg
  7531. set<not(c)> reg
  7532. take care of alignment and that the mov 0,reg is not converted into a xor as this
  7533. would destroy the flag contents
  7534. Use MOVZX if size is preferred, since while mov 0,reg is bigger, it can be
  7535. executed at the same time as a previous comparison.
  7536. set<not(c)> reg
  7537. movzx reg, reg
  7538. }
  7539. if MatchInstruction(hp1,A_MOV,[]) and
  7540. (taicpu(hp1).oper[0]^.typ = top_const) and
  7541. (
  7542. (
  7543. (taicpu(hp1).oper[1]^.typ = top_reg)
  7544. {$ifdef i386}
  7545. { Under i386, ESI, EDI, EBP and ESP
  7546. don't have an 8-bit representation }
  7547. and not (getsupreg(taicpu(hp1).oper[1]^.reg) in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  7548. {$endif i386}
  7549. ) or (
  7550. {$ifdef i386}
  7551. (taicpu(hp1).oper[1]^.typ <> top_reg) and
  7552. {$endif i386}
  7553. (taicpu(hp1).opsize = S_B)
  7554. )
  7555. ) and
  7556. GetNextInstruction(hp1,hp2) and
  7557. MatchInstruction(hp2,A_JMP,[]) and (taicpu(hp2).oper[0]^.ref^.refaddr=addr_full) and
  7558. GetNextInstruction(hp2,hp3) and
  7559. SkipAligns(hp3, hp3) and
  7560. (hp3.typ=ait_label) and
  7561. (tasmlabel(taicpu(p).oper[0]^.ref^.symbol)=tai_label(hp3).labsym) and
  7562. GetNextInstruction(hp3,hp4) and
  7563. MatchInstruction(hp4,A_MOV,[taicpu(hp1).opsize]) and
  7564. (taicpu(hp4).oper[0]^.typ = top_const) and
  7565. (
  7566. ((taicpu(hp1).oper[0]^.val = 0) and (taicpu(hp4).oper[0]^.val = 1)) or
  7567. ((taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0))
  7568. ) and
  7569. MatchOperand(taicpu(hp1).oper[1]^,taicpu(hp4).oper[1]^) and
  7570. GetNextInstruction(hp4,hp5) and
  7571. SkipAligns(hp5, hp5) and
  7572. (hp5.typ=ait_label) and
  7573. (tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol)=tai_label(hp5).labsym) then
  7574. begin
  7575. if (taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0) then
  7576. taicpu(p).condition := inverse_cond(taicpu(p).condition);
  7577. tai_label(hp3).labsym.DecRefs;
  7578. { If this isn't the only reference to the middle label, we can
  7579. still make a saving - only that the first jump and everything
  7580. that follows will remain. }
  7581. if (tai_label(hp3).labsym.getrefs = 0) then
  7582. begin
  7583. if (taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0) then
  7584. DebugMsg(SPeepholeOptimization + 'J(c)Mov1JmpMov0 -> Set(~c)',p)
  7585. else
  7586. DebugMsg(SPeepholeOptimization + 'J(c)Mov0JmpMov1 -> Set(c)',p);
  7587. { remove jump, first label and second MOV (also catching any aligns) }
  7588. repeat
  7589. if not GetNextInstruction(hp2, hp3) then
  7590. InternalError(2021040810);
  7591. RemoveInstruction(hp2);
  7592. hp2 := hp3;
  7593. until hp2 = hp5;
  7594. { Don't decrement reference count before the removal loop
  7595. above, otherwise GetNextInstruction won't stop on the
  7596. the label }
  7597. tai_label(hp5).labsym.DecRefs;
  7598. end
  7599. else
  7600. begin
  7601. if (taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0) then
  7602. DebugMsg(SPeepholeOptimization + 'J(c)Mov1JmpMov0 -> Set(~c) (partial)',p)
  7603. else
  7604. DebugMsg(SPeepholeOptimization + 'J(c)Mov0JmpMov1 -> Set(c) (partial)',p);
  7605. end;
  7606. taicpu(p).opcode:=A_SETcc;
  7607. taicpu(p).opsize:=S_B;
  7608. taicpu(p).is_jmp:=False;
  7609. if taicpu(hp1).opsize=S_B then
  7610. begin
  7611. taicpu(p).loadoper(0, taicpu(hp1).oper[1]^);
  7612. if taicpu(hp1).oper[1]^.typ = top_reg then
  7613. AllocRegBetween(taicpu(hp1).oper[1]^.reg, p, hp2, UsedRegs);
  7614. RemoveInstruction(hp1);
  7615. end
  7616. else
  7617. begin
  7618. { Will be a register because the size can't be S_B otherwise }
  7619. ThisReg := newreg(R_INTREGISTER,getsupreg(taicpu(hp1).oper[1]^.reg), R_SUBL);
  7620. taicpu(p).loadreg(0, ThisReg);
  7621. AllocRegBetween(ThisReg, p, hp2, UsedRegs);
  7622. if (cs_opt_size in current_settings.optimizerswitches) and IsMOVZXAcceptable then
  7623. begin
  7624. case taicpu(hp1).opsize of
  7625. S_W:
  7626. taicpu(hp1).opsize := S_BW;
  7627. S_L:
  7628. taicpu(hp1).opsize := S_BL;
  7629. {$ifdef x86_64}
  7630. S_Q:
  7631. begin
  7632. taicpu(hp1).opsize := S_BL;
  7633. { Change the destination register to 32-bit }
  7634. taicpu(hp1).loadreg(1, newreg(R_INTREGISTER,getsupreg(ThisReg), R_SUBD));
  7635. end;
  7636. {$endif x86_64}
  7637. else
  7638. InternalError(2021040820);
  7639. end;
  7640. taicpu(hp1).opcode := A_MOVZX;
  7641. taicpu(hp1).loadreg(0, ThisReg);
  7642. end
  7643. else
  7644. begin
  7645. AllocRegBetween(NR_FLAGS,p,hp1,UsedRegs);
  7646. { hp1 is already a MOV instruction with the correct register }
  7647. taicpu(hp1).loadconst(0, 0);
  7648. { Inserting it right before p will guarantee that the flags are also tracked }
  7649. asml.Remove(hp1);
  7650. asml.InsertBefore(hp1, p);
  7651. end;
  7652. end;
  7653. Result:=true;
  7654. exit;
  7655. end
  7656. else if (hp1.typ = ait_label) then
  7657. Result := DoSETccLblRETOpt(p, tai_label(hp1));
  7658. end;
  7659. function TX86AsmOptimizer.OptPass1VMOVDQ(var p: tai): Boolean;
  7660. var
  7661. hp1, hp2, hp3: tai;
  7662. SourceRef, TargetRef: TReference;
  7663. CurrentReg: TRegister;
  7664. begin
  7665. { VMOVDQU/CMOVDQA shouldn't have even been generated }
  7666. if not UseAVX then
  7667. InternalError(2021100501);
  7668. Result := False;
  7669. { Look for the following to simplify:
  7670. vmovdqa/u x(mem1), %xmmreg
  7671. vmovdqa/u %xmmreg, y(mem2)
  7672. vmovdqa/u x+16(mem1), %xmmreg
  7673. vmovdqa/u %xmmreg, y+16(mem2)
  7674. Change to:
  7675. vmovdqa/u x(mem1), %ymmreg
  7676. vmovdqa/u %ymmreg, y(mem2)
  7677. vpxor %ymmreg, %ymmreg, %ymmreg
  7678. ( The VPXOR instruction is to zero the upper half, thus removing the
  7679. need to call the potentially expensive VZEROUPPER instruction. Other
  7680. peephole optimisations can remove VPXOR if it's unnecessary )
  7681. }
  7682. TransferUsedRegs(TmpUsedRegs);
  7683. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  7684. { NOTE: In the optimisations below, if the references dictate that an
  7685. aligned move is possible (i.e. VMOVDQA), the existing instructions
  7686. should already be VMOVDQA because if (x mod 32) = 0, then (x mod 16) = 0 }
  7687. if (taicpu(p).opsize = S_XMM) and
  7688. MatchOpType(taicpu(p), top_ref, top_reg) and
  7689. GetNextInstruction(p, hp1) and
  7690. MatchInstruction(hp1, A_VMOVDQA, A_VMOVDQU, [S_XMM]) and
  7691. MatchOpType(taicpu(hp1), top_reg, top_ref) and
  7692. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) then
  7693. begin
  7694. SourceRef := taicpu(p).oper[0]^.ref^;
  7695. TargetRef := taicpu(hp1).oper[1]^.ref^;
  7696. if GetNextInstruction(hp1, hp2) and
  7697. MatchInstruction(hp2, A_VMOVDQA, A_VMOVDQU, [S_XMM]) and
  7698. MatchOpType(taicpu(hp2), top_ref, top_reg) then
  7699. begin
  7700. { Delay calling GetNextInstruction(hp2, hp3) for as long as possible }
  7701. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  7702. Inc(SourceRef.offset, 16);
  7703. { Reuse the register in the first block move }
  7704. CurrentReg := newreg(R_MMREGISTER, getsupreg(taicpu(p).oper[1]^.reg), R_SUBMMY);
  7705. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) and
  7706. not RefsMightOverlap(taicpu(p).oper[0]^.ref^, TargetRef, 32) then
  7707. begin
  7708. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  7709. Inc(TargetRef.offset, 16);
  7710. if GetNextInstruction(hp2, hp3) and
  7711. MatchInstruction(hp3, A_VMOVDQA, A_VMOVDQU, [S_XMM]) and
  7712. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  7713. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  7714. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  7715. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  7716. begin
  7717. { Update the register tracking to the new size }
  7718. AllocRegBetween(CurrentReg, p, hp2, UsedRegs);
  7719. { Remember that the offsets are 16 ahead }
  7720. { Switch to unaligned if the memory isn't on a 32-byte boundary }
  7721. if not (
  7722. ((SourceRef.offset mod 32) = 16) and
  7723. (SourceRef.alignment >= 32) and ((SourceRef.alignment mod 32) = 0)
  7724. ) then
  7725. taicpu(p).opcode := A_VMOVDQU;
  7726. taicpu(p).opsize := S_YMM;
  7727. taicpu(p).oper[1]^.reg := CurrentReg;
  7728. if not (
  7729. ((TargetRef.offset mod 32) = 16) and
  7730. (TargetRef.alignment >= 32) and ((TargetRef.alignment mod 32) = 0)
  7731. ) then
  7732. taicpu(hp1).opcode := A_VMOVDQU;
  7733. taicpu(hp1).opsize := S_YMM;
  7734. taicpu(hp1).oper[0]^.reg := CurrentReg;
  7735. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(CurrentReg) + ' to merge a pair of memory moves (VmovdqxVmovdqxVmovdqxVmovdqx2VmovdqyVmovdqy 1)', p);
  7736. { If pi_uses_ymm is set, VZEROUPPER is present to do this for us }
  7737. if (pi_uses_ymm in current_procinfo.flags) then
  7738. RemoveInstruction(hp2)
  7739. else
  7740. begin
  7741. taicpu(hp2).opcode := A_VPXOR;
  7742. taicpu(hp2).opsize := S_YMM;
  7743. taicpu(hp2).loadreg(0, CurrentReg);
  7744. taicpu(hp2).loadreg(1, CurrentReg);
  7745. taicpu(hp2).loadreg(2, CurrentReg);
  7746. taicpu(hp2).ops := 3;
  7747. end;
  7748. RemoveInstruction(hp3);
  7749. Result := True;
  7750. Exit;
  7751. end;
  7752. end
  7753. else
  7754. begin
  7755. { See if the next references are 16 less rather than 16 greater }
  7756. Dec(SourceRef.offset, 32); { -16 the other way }
  7757. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) then
  7758. begin
  7759. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  7760. Dec(TargetRef.offset, 16); { Only 16, not 32, as it wasn't incremented unlike SourceRef }
  7761. if not RefsMightOverlap(SourceRef, TargetRef, 32) and
  7762. GetNextInstruction(hp2, hp3) and
  7763. MatchInstruction(hp3, A_MOV, [taicpu(p).opsize]) and
  7764. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  7765. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  7766. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  7767. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  7768. begin
  7769. { Update the register tracking to the new size }
  7770. AllocRegBetween(CurrentReg, hp2, hp3, UsedRegs);
  7771. { hp2 and hp3 are the starting offsets, so mod = 0 this time }
  7772. { Switch to unaligned if the memory isn't on a 32-byte boundary }
  7773. if not(
  7774. ((SourceRef.offset mod 32) = 0) and
  7775. (SourceRef.alignment >= 32) and ((SourceRef.alignment mod 32) = 0)
  7776. ) then
  7777. taicpu(hp2).opcode := A_VMOVDQU;
  7778. taicpu(hp2).opsize := S_YMM;
  7779. taicpu(hp2).oper[1]^.reg := CurrentReg;
  7780. if not (
  7781. ((TargetRef.offset mod 32) = 0) and
  7782. (TargetRef.alignment >= 32) and ((TargetRef.alignment mod 32) = 0)
  7783. ) then
  7784. taicpu(hp3).opcode := A_VMOVDQU;
  7785. taicpu(hp3).opsize := S_YMM;
  7786. taicpu(hp3).oper[0]^.reg := CurrentReg;
  7787. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(CurrentReg) + ' to merge a pair of memory moves (VmovdqxVmovdqxVmovdqxVmovdqx2VmovdqyVmovdqy 2)', p);
  7788. { If pi_uses_ymm is set, VZEROUPPER is present to do this for us }
  7789. if (pi_uses_ymm in current_procinfo.flags) then
  7790. RemoveInstruction(hp1)
  7791. else
  7792. begin
  7793. taicpu(hp1).opcode := A_VPXOR;
  7794. taicpu(hp1).opsize := S_YMM;
  7795. taicpu(hp1).loadreg(0, CurrentReg);
  7796. taicpu(hp1).loadreg(1, CurrentReg);
  7797. taicpu(hp1).loadreg(2, CurrentReg);
  7798. taicpu(hp1).ops := 3;
  7799. Asml.Remove(hp1);
  7800. Asml.InsertAfter(hp1, hp3); { Register deallocations will be after hp3 }
  7801. end;
  7802. RemoveCurrentP(p, hp2);
  7803. Result := True;
  7804. Exit;
  7805. end;
  7806. end;
  7807. end;
  7808. end;
  7809. end;
  7810. end;
  7811. function TX86AsmOptimizer.CheckJumpMovTransferOpt(var p: tai; hp1: tai; LoopCount: Integer; out Count: Integer): Boolean;
  7812. var
  7813. hp2, hp3, first_assignment: tai;
  7814. IncCount, OperIdx: Integer;
  7815. OrigLabel: TAsmLabel;
  7816. begin
  7817. Count := 0;
  7818. Result := False;
  7819. first_assignment := nil;
  7820. if (LoopCount >= 20) then
  7821. begin
  7822. { Guard against infinite loops }
  7823. Exit;
  7824. end;
  7825. if (taicpu(p).oper[0]^.typ <> top_ref) or
  7826. (taicpu(p).oper[0]^.ref^.refaddr <> addr_full) or
  7827. (taicpu(p).oper[0]^.ref^.base <> NR_NO) or
  7828. (taicpu(p).oper[0]^.ref^.index <> NR_NO) or
  7829. not (taicpu(p).oper[0]^.ref^.symbol is TAsmLabel) then
  7830. Exit;
  7831. OrigLabel := TAsmLabel(taicpu(p).oper[0]^.ref^.symbol);
  7832. {
  7833. change
  7834. jmp .L1
  7835. ...
  7836. .L1:
  7837. mov ##, ## ( multiple movs possible )
  7838. jmp/ret
  7839. into
  7840. mov ##, ##
  7841. jmp/ret
  7842. }
  7843. if not Assigned(hp1) then
  7844. begin
  7845. hp1 := GetLabelWithSym(OrigLabel);
  7846. if not Assigned(hp1) or not SkipLabels(hp1, hp1) then
  7847. Exit;
  7848. end;
  7849. hp2 := hp1;
  7850. while Assigned(hp2) do
  7851. begin
  7852. if Assigned(hp2) and (hp2.typ in [ait_label, ait_align]) then
  7853. SkipLabels(hp2,hp2);
  7854. if not Assigned(hp2) or (hp2.typ <> ait_instruction) then
  7855. Break;
  7856. case taicpu(hp2).opcode of
  7857. A_MOVSD:
  7858. begin
  7859. if taicpu(hp2).ops = 0 then
  7860. { Wrong MOVSD }
  7861. Break;
  7862. Inc(Count);
  7863. if Count >= 5 then
  7864. { Too many to be worthwhile }
  7865. Break;
  7866. GetNextInstruction(hp2, hp2);
  7867. Continue;
  7868. end;
  7869. A_MOV,
  7870. A_MOVD,
  7871. A_MOVQ,
  7872. A_MOVSX,
  7873. {$ifdef x86_64}
  7874. A_MOVSXD,
  7875. {$endif x86_64}
  7876. A_MOVZX,
  7877. A_MOVAPS,
  7878. A_MOVUPS,
  7879. A_MOVSS,
  7880. A_MOVAPD,
  7881. A_MOVUPD,
  7882. A_MOVDQA,
  7883. A_MOVDQU,
  7884. A_VMOVSS,
  7885. A_VMOVAPS,
  7886. A_VMOVUPS,
  7887. A_VMOVSD,
  7888. A_VMOVAPD,
  7889. A_VMOVUPD,
  7890. A_VMOVDQA,
  7891. A_VMOVDQU:
  7892. begin
  7893. Inc(Count);
  7894. if Count >= 5 then
  7895. { Too many to be worthwhile }
  7896. Break;
  7897. GetNextInstruction(hp2, hp2);
  7898. Continue;
  7899. end;
  7900. A_JMP:
  7901. begin
  7902. { Guard against infinite loops }
  7903. if taicpu(hp2).oper[0]^.ref^.symbol = OrigLabel then
  7904. Exit;
  7905. { Analyse this jump first in case it also duplicates assignments }
  7906. if CheckJumpMovTransferOpt(hp2, nil, LoopCount + 1, IncCount) then
  7907. begin
  7908. { Something did change! }
  7909. Result := True;
  7910. Inc(Count, IncCount);
  7911. if Count >= 5 then
  7912. begin
  7913. { Too many to be worthwhile }
  7914. Exit;
  7915. end;
  7916. if MatchInstruction(hp2, [A_JMP, A_RET], []) then
  7917. Break;
  7918. end;
  7919. Result := True;
  7920. Break;
  7921. end;
  7922. A_RET:
  7923. begin
  7924. Result := True;
  7925. Break;
  7926. end;
  7927. else
  7928. Break;
  7929. end;
  7930. end;
  7931. if Result then
  7932. begin
  7933. { A count of zero can happen when CheckJumpMovTransferOpt is called recursively }
  7934. if Count = 0 then
  7935. begin
  7936. Result := False;
  7937. Exit;
  7938. end;
  7939. hp3 := p;
  7940. DebugMsg(SPeepholeOptimization + 'Duplicated ' + debug_tostr(Count) + ' assignment(s) and redirected jump', p);
  7941. while True do
  7942. begin
  7943. if Assigned(hp1) and (hp1.typ in [ait_label, ait_align]) then
  7944. SkipLabels(hp1,hp1);
  7945. if (hp1.typ <> ait_instruction) then
  7946. InternalError(2021040720);
  7947. case taicpu(hp1).opcode of
  7948. A_JMP:
  7949. begin
  7950. { Change the original jump to the new destination }
  7951. OrigLabel.decrefs;
  7952. taicpu(hp1).oper[0]^.ref^.symbol.increfs;
  7953. taicpu(p).loadref(0, taicpu(hp1).oper[0]^.ref^);
  7954. { Set p to the first duplicated assignment so it can get optimised if needs be }
  7955. if not Assigned(first_assignment) then
  7956. InternalError(2021040810)
  7957. else
  7958. p := first_assignment;
  7959. Exit;
  7960. end;
  7961. A_RET:
  7962. begin
  7963. { Now change the jump into a RET instruction }
  7964. ConvertJumpToRET(p, hp1);
  7965. { Set p to the first duplicated assignment so it can get optimised if needs be }
  7966. if not Assigned(first_assignment) then
  7967. InternalError(2021040811)
  7968. else
  7969. p := first_assignment;
  7970. Exit;
  7971. end;
  7972. else
  7973. begin
  7974. { Duplicate the MOV instruction }
  7975. hp3:=tai(hp1.getcopy);
  7976. if first_assignment = nil then
  7977. first_assignment := hp3;
  7978. asml.InsertBefore(hp3, p);
  7979. { Make sure the compiler knows about any final registers written here }
  7980. for OperIdx := 0 to taicpu(hp3).ops - 1 do
  7981. with taicpu(hp3).oper[OperIdx]^ do
  7982. begin
  7983. case typ of
  7984. top_ref:
  7985. begin
  7986. if (ref^.base <> NR_NO) and
  7987. (getsupreg(ref^.base) <> RS_ESP) and
  7988. (getsupreg(ref^.base) <> RS_EBP)
  7989. {$ifdef x86_64} and (ref^.base <> NR_RIP) {$endif x86_64}
  7990. then
  7991. AllocRegBetween(ref^.base, hp3, tai(p.Next), UsedRegs);
  7992. if (ref^.index <> NR_NO) and
  7993. (getsupreg(ref^.index) <> RS_ESP) and
  7994. (getsupreg(ref^.index) <> RS_EBP)
  7995. {$ifdef x86_64} and (ref^.index <> NR_RIP) {$endif x86_64} and
  7996. (ref^.index <> ref^.base) then
  7997. AllocRegBetween(ref^.index, hp3, tai(p.Next), UsedRegs);
  7998. end;
  7999. top_reg:
  8000. AllocRegBetween(reg, hp3, tai(p.Next), UsedRegs);
  8001. else
  8002. ;
  8003. end;
  8004. end;
  8005. end;
  8006. end;
  8007. if not GetNextInstruction(hp1, hp1) then
  8008. { Should have dropped out earlier }
  8009. InternalError(2021040710);
  8010. end;
  8011. end;
  8012. end;
  8013. const
  8014. WriteOp: array[0..3] of set of TInsChange = (
  8015. [Ch_Wop1, Ch_RWop1, Ch_Mop1],
  8016. [Ch_Wop2, Ch_RWop2, Ch_Mop2],
  8017. [Ch_Wop3, Ch_RWop3, Ch_Mop3],
  8018. [Ch_Wop4, Ch_RWop4, Ch_Mop4]);
  8019. RegWriteFlags: array[0..7] of set of TInsChange = (
  8020. { The order is important: EAX, ECX, EDX, EBX, ESI, EDI, EBP, ESP }
  8021. [Ch_WEAX, Ch_RWEAX, Ch_MEAX{$ifdef x86_64}, Ch_WRAX, Ch_RWRAX, Ch_MRAX{$endif x86_64}],
  8022. [Ch_WECX, Ch_RWECX, Ch_MECX{$ifdef x86_64}, Ch_WRCX, Ch_RWRCX, Ch_MRCX{$endif x86_64}],
  8023. [Ch_WEDX, Ch_RWEDX, Ch_MEDX{$ifdef x86_64}, Ch_WRDX, Ch_RWRDX, Ch_MRDX{$endif x86_64}],
  8024. [Ch_WEBX, Ch_RWEBX, Ch_MEBX{$ifdef x86_64}, Ch_WRBX, Ch_RWRBX, Ch_MRBX{$endif x86_64}],
  8025. [Ch_WESI, Ch_RWESI, Ch_MESI{$ifdef x86_64}, Ch_WRSI, Ch_RWRSI, Ch_MRSI{$endif x86_64}],
  8026. [Ch_WEDI, Ch_RWEDI, Ch_MEDI{$ifdef x86_64}, Ch_WRDI, Ch_RWRDI, Ch_MRDI{$endif x86_64}],
  8027. [Ch_WEBP, Ch_RWEBP, Ch_MEBP{$ifdef x86_64}, Ch_WRBP, Ch_RWRBP, Ch_MRBP{$endif x86_64}],
  8028. [Ch_WESP, Ch_RWESP, Ch_MESP{$ifdef x86_64}, Ch_WRSP, Ch_RWRSP, Ch_MRSP{$endif x86_64}]);
  8029. function TX86AsmOptimizer.TrySwapMovOp(var p, hp1: tai): Boolean;
  8030. var
  8031. hp2: tai;
  8032. X: Integer;
  8033. begin
  8034. { If we have something like:
  8035. op ###,###
  8036. mov ###,###
  8037. Try to move the MOV instruction to before OP as long as OP and MOV don't
  8038. interfere in regards to what they write to.
  8039. NOTE: p must be a 2-operand instruction
  8040. }
  8041. Result := False;
  8042. if (hp1.typ <> ait_instruction) or
  8043. taicpu(hp1).is_jmp or
  8044. RegInInstruction(NR_DEFAULTFLAGS, hp1) then
  8045. Exit;
  8046. { NOP is a pipeline fence, likely marking the beginning of the function
  8047. epilogue, so drop out. Similarly, drop out if POP or RET are
  8048. encountered }
  8049. if MatchInstruction(hp1, A_NOP, A_POP, A_RET, []) then
  8050. Exit;
  8051. if (taicpu(hp1).opcode = A_MOVSD) and
  8052. (taicpu(hp1).ops = 0) then
  8053. { Wrong MOVSD }
  8054. Exit;
  8055. { Check for writes to specific registers first }
  8056. { EAX, ECX, EDX, EBX, ESI, EDI, EBP, ESP in that order }
  8057. for X := 0 to 7 do
  8058. if (RegWriteFlags[X] * InsProp[taicpu(hp1).opcode].Ch <> [])
  8059. and RegInInstruction(newreg(R_INTREGISTER, TSuperRegister(X), R_SUBWHOLE), p) then
  8060. Exit;
  8061. for X := 0 to taicpu(hp1).ops - 1 do
  8062. begin
  8063. { Check to see if this operand writes to something }
  8064. if ((WriteOp[X] * InsProp[taicpu(hp1).opcode].Ch) <> []) and
  8065. { And matches something in the CMP/TEST instruction }
  8066. (
  8067. MatchOperand(taicpu(hp1).oper[X]^, taicpu(p).oper[0]^) or
  8068. MatchOperand(taicpu(hp1).oper[X]^, taicpu(p).oper[1]^) or
  8069. (
  8070. { If it's a register, make sure the register written to doesn't
  8071. appear in the cmp instruction as part of a reference }
  8072. (taicpu(hp1).oper[X]^.typ = top_reg) and
  8073. RegInInstruction(taicpu(hp1).oper[X]^.reg, p)
  8074. )
  8075. ) then
  8076. Exit;
  8077. end;
  8078. { Check p to make sure it doesn't write to something that affects hp1 }
  8079. { Check for writes to specific registers first }
  8080. { EAX, ECX, EDX, EBX, ESI, EDI, EBP, ESP in that order }
  8081. for X := 0 to 7 do
  8082. if (RegWriteFlags[X] * InsProp[taicpu(p).opcode].Ch <> [])
  8083. and RegInInstruction(newreg(R_INTREGISTER, TSuperRegister(X), R_SUBWHOLE), hp1) then
  8084. Exit;
  8085. for X := 0 to taicpu(p).ops - 1 do
  8086. begin
  8087. { Check to see if this operand writes to something }
  8088. if ((WriteOp[X] * InsProp[taicpu(p).opcode].Ch) <> []) and
  8089. { And matches something in hp1 }
  8090. (taicpu(p).oper[X]^.typ = top_reg) and
  8091. RegInInstruction(taicpu(p).oper[X]^.reg, hp1) then
  8092. Exit;
  8093. end;
  8094. { The instruction can be safely moved }
  8095. asml.Remove(hp1);
  8096. { Try to insert after the last instructions where the FLAGS register is not
  8097. yet in use, so "mov $0,%reg" can be optimised into "xor %reg,%reg" later }
  8098. if SetAndTest(FindRegAllocBackward(NR_DEFAULTFLAGS, tai(p.Previous)), hp2) then
  8099. asml.InsertBefore(hp1, hp2)
  8100. { Failing that, try to insert after the last instructions where the
  8101. FLAGS register is not yet in use }
  8102. else if GetLastInstruction(p, hp2) and
  8103. (
  8104. (hp2.typ <> ait_instruction) or
  8105. { Don't insert after an instruction that uses the flags when p doesn't use them }
  8106. RegInInstruction(NR_DEFAULTFLAGS, p) or
  8107. not RegInInstruction(NR_DEFAULTFLAGS, hp2)
  8108. ) then
  8109. asml.InsertAfter(hp1, hp2)
  8110. else
  8111. { Note, if p.Previous is nil (even if it should logically never be the
  8112. case), FindRegAllocBackward immediately exits with False and so we
  8113. safely land here (we can't just pass p because FindRegAllocBackward
  8114. immediately exits on an instruction). [Kit] }
  8115. asml.InsertBefore(hp1, p);
  8116. DebugMsg(SPeepholeOptimization + 'Swapped ' + debug_op2str(taicpu(p).opcode) + ' and ' + debug_op2str(taicpu(hp1).opcode) + ' instructions to improve optimisation potential', hp1);
  8117. { We can't trust UsedRegs because we're looking backwards, although we
  8118. know the registers are allocated after p at the very least, so manually
  8119. create tai_regalloc objects if needed }
  8120. for X := 0 to taicpu(hp1).ops - 1 do
  8121. case taicpu(hp1).oper[X]^.typ of
  8122. top_reg:
  8123. begin
  8124. asml.InsertBefore(tai_regalloc.alloc(taicpu(hp1).oper[X]^.reg, nil), hp1);
  8125. IncludeRegInUsedRegs(taicpu(hp1).oper[X]^.reg, UsedRegs);
  8126. AllocRegBetween(taicpu(hp1).oper[X]^.reg, hp1, p, UsedRegs);
  8127. end;
  8128. top_ref:
  8129. begin
  8130. if taicpu(hp1).oper[X]^.ref^.base <> NR_NO then
  8131. begin
  8132. asml.InsertBefore(tai_regalloc.alloc(taicpu(hp1).oper[X]^.ref^.base, nil), hp1);
  8133. IncludeRegInUsedRegs(taicpu(hp1).oper[X]^.ref^.base, UsedRegs);
  8134. AllocRegBetween(taicpu(hp1).oper[X]^.ref^.base, hp1, p, UsedRegs);
  8135. end;
  8136. if taicpu(hp1).oper[X]^.ref^.index <> NR_NO then
  8137. begin
  8138. asml.InsertBefore(tai_regalloc.alloc(taicpu(hp1).oper[X]^.ref^.index, nil), hp1);
  8139. IncludeRegInUsedRegs(taicpu(hp1).oper[X]^.ref^.index, UsedRegs);
  8140. AllocRegBetween(taicpu(hp1).oper[X]^.ref^.index, hp1, p, UsedRegs);
  8141. end;
  8142. end;
  8143. else
  8144. ;
  8145. end;
  8146. Result := True;
  8147. end;
  8148. function TX86AsmOptimizer.TrySwapMovCmp(var p, hp1: tai): Boolean;
  8149. var
  8150. hp2: tai;
  8151. X: Integer;
  8152. begin
  8153. { If we have something like:
  8154. cmp ###,%reg1
  8155. mov 0,%reg2
  8156. And no modified registers are shared, move the instruction to before
  8157. the comparison as this means it can be optimised without worrying
  8158. about the FLAGS register. (CMP/MOV is generated by
  8159. "J(c)Mov1JmpMov0 -> Set(~c)", among other things).
  8160. As long as the second instruction doesn't use the flags or one of the
  8161. registers used by CMP or TEST (also check any references that use the
  8162. registers), then it can be moved prior to the comparison.
  8163. }
  8164. Result := False;
  8165. if not TrySwapMovOp(p, hp1) then
  8166. Exit;
  8167. if taicpu(hp1).opcode = A_LEA then
  8168. { The flags will be overwritten by the CMP/TEST instruction }
  8169. ConvertLEA(taicpu(hp1));
  8170. Result := True;
  8171. { Can we move it one further back? }
  8172. if GetLastInstruction(hp1, hp2) and (hp2.typ = ait_instruction) and
  8173. { Check to see if CMP/TEST is a comparison against zero }
  8174. (
  8175. (
  8176. (taicpu(p).opcode = A_CMP) and
  8177. MatchOperand(taicpu(p).oper[0]^, 0)
  8178. ) or
  8179. (
  8180. (taicpu(p).opcode = A_TEST) and
  8181. (
  8182. OpsEqual(taicpu(p).oper[0]^, taicpu(p).oper[1]^) or
  8183. MatchOperand(taicpu(p).oper[0]^, -1)
  8184. )
  8185. )
  8186. ) and
  8187. { These instructions set the zero flag if the result is zero }
  8188. MatchInstruction(hp2, [A_ADD, A_SUB, A_OR, A_XOR, A_AND, A_POPCNT, A_LZCNT], []) and
  8189. OpsEqual(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^) then
  8190. { Looks like we can - if successful, this benefits PostPeepholeOptTestOr }
  8191. TrySwapMovOp(hp2, hp1);
  8192. end;
  8193. function TX86AsmOptimizer.OptPass2MOV(var p : tai) : boolean;
  8194. function IsXCHGAcceptable: Boolean; inline;
  8195. begin
  8196. { Always accept if optimising for size }
  8197. Result := (cs_opt_size in current_settings.optimizerswitches) or
  8198. { From the Pentium M onwards, XCHG only has a latency of 2 rather
  8199. than 3, so it becomes a saving compared to three MOVs with two of
  8200. them able to execute simultaneously. [Kit] }
  8201. (CPUX86_HINT_FAST_XCHG in cpu_optimization_hints[current_settings.optimizecputype]);
  8202. end;
  8203. var
  8204. NewRef: TReference;
  8205. hp1, hp2, hp3, hp4: Tai;
  8206. {$ifndef x86_64}
  8207. OperIdx: Integer;
  8208. {$endif x86_64}
  8209. NewInstr : Taicpu;
  8210. NewAligh : Tai_align;
  8211. DestLabel: TAsmLabel;
  8212. TempTracking: TAllUsedRegs;
  8213. function TryMovArith2Lea(InputInstr: tai): Boolean;
  8214. var
  8215. NextInstr: tai;
  8216. begin
  8217. Result := False;
  8218. UpdateUsedRegs(TmpUsedRegs, tai(InputInstr.Next));
  8219. if not GetNextInstruction(InputInstr, NextInstr) or
  8220. (
  8221. { The FLAGS register isn't always tracked properly, so do not
  8222. perform this optimisation if a conditional statement follows }
  8223. not RegReadByInstruction(NR_DEFAULTFLAGS, NextInstr) and
  8224. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, NextInstr, TmpUsedRegs)
  8225. ) then
  8226. begin
  8227. reference_reset(NewRef, 1, []);
  8228. NewRef.base := taicpu(p).oper[0]^.reg;
  8229. NewRef.scalefactor := 1;
  8230. if taicpu(InputInstr).opcode = A_ADD then
  8231. begin
  8232. DebugMsg(SPeepholeOptimization + 'MovAdd2Lea', p);
  8233. NewRef.offset := taicpu(InputInstr).oper[0]^.val;
  8234. end
  8235. else
  8236. begin
  8237. DebugMsg(SPeepholeOptimization + 'MovSub2Lea', p);
  8238. NewRef.offset := -taicpu(InputInstr).oper[0]^.val;
  8239. end;
  8240. taicpu(p).opcode := A_LEA;
  8241. taicpu(p).loadref(0, NewRef);
  8242. RemoveInstruction(InputInstr);
  8243. Result := True;
  8244. end;
  8245. end;
  8246. begin
  8247. Result:=false;
  8248. { This optimisation adds an instruction, so only do it for speed }
  8249. if not (cs_opt_size in current_settings.optimizerswitches) and
  8250. MatchOpType(taicpu(p), top_const, top_reg) and
  8251. (taicpu(p).oper[0]^.val = 0) then
  8252. begin
  8253. { To avoid compiler warning }
  8254. DestLabel := nil;
  8255. if (p.typ <> ait_instruction) or (taicpu(p).oper[1]^.typ <> top_reg) then
  8256. InternalError(2021040750);
  8257. if not GetNextInstructionUsingReg(p, hp1, taicpu(p).oper[1]^.reg) then
  8258. Exit;
  8259. case hp1.typ of
  8260. ait_align,
  8261. ait_label:
  8262. begin
  8263. { Change:
  8264. mov $0,%reg mov $0,%reg
  8265. @Lbl1: @Lbl1:
  8266. test %reg,%reg / cmp $0,%reg test %reg,%reg / mov $0,%reg
  8267. je @Lbl2 jne @Lbl2
  8268. To: To:
  8269. mov $0,%reg mov $0,%reg
  8270. jmp @Lbl2 jmp @Lbl3
  8271. (align) (align)
  8272. @Lbl1: @Lbl1:
  8273. test %reg,%reg / cmp $0,%reg test %reg,%reg / cmp $0,%reg
  8274. je @Lbl2 je @Lbl2
  8275. @Lbl3: <-- Only if label exists
  8276. (Not if it's optimised for size)
  8277. }
  8278. if not SkipAligns(hp1, hp1) or not GetNextInstruction(hp1, hp2) then
  8279. Exit;
  8280. if (hp2.typ = ait_instruction) and
  8281. (
  8282. { Register sizes must exactly match }
  8283. (
  8284. (taicpu(hp2).opcode = A_CMP) and
  8285. MatchOperand(taicpu(hp2).oper[0]^, 0) and
  8286. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^.reg)
  8287. ) or (
  8288. (taicpu(hp2).opcode = A_TEST) and
  8289. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[1]^.reg) and
  8290. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^.reg)
  8291. )
  8292. ) and GetNextInstruction(hp2, hp3) and
  8293. (hp3.typ = ait_instruction) and
  8294. (taicpu(hp3).opcode = A_JCC) and
  8295. (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
  8296. (taicpu(hp3).oper[0]^.ref^.index=NR_NO) and (taicpu(hp3).oper[0]^.ref^.symbol is tasmlabel) then
  8297. begin
  8298. { Check condition of jump }
  8299. { Always true? }
  8300. if condition_in(C_E, taicpu(hp3).condition) then
  8301. begin
  8302. { Copy label symbol and obtain matching label entry for the
  8303. conditional jump, as this will be our destination}
  8304. DestLabel := tasmlabel(taicpu(hp3).oper[0]^.ref^.symbol);
  8305. DebugMsg(SPeepholeOptimization + 'Mov0LblCmp0Je -> Mov0JmpLblCmp0Je', p);
  8306. Result := True;
  8307. end
  8308. { Always false? }
  8309. else if condition_in(C_NE, taicpu(hp3).condition) and GetNextInstruction(hp3, hp2) then
  8310. begin
  8311. { This is only worth it if there's a jump to take }
  8312. case hp2.typ of
  8313. ait_instruction:
  8314. begin
  8315. if taicpu(hp2).opcode = A_JMP then
  8316. begin
  8317. DestLabel := tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol);
  8318. { An unconditional jump follows the conditional jump which will always be false,
  8319. so use this jump's destination for the new jump }
  8320. DebugMsg(SPeepholeOptimization + 'Mov0LblCmp0Jne -> Mov0JmpLblCmp0Jne (with JMP)', p);
  8321. Result := True;
  8322. end
  8323. else if taicpu(hp2).opcode = A_JCC then
  8324. begin
  8325. DestLabel := tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol);
  8326. if condition_in(C_E, taicpu(hp2).condition) then
  8327. begin
  8328. { A second conditional jump follows the conditional jump which will always be false,
  8329. while the second jump is always True, so use this jump's destination for the new jump }
  8330. DebugMsg(SPeepholeOptimization + 'Mov0LblCmp0Jne -> Mov0JmpLblCmp0Jne (with second Jcc)', p);
  8331. Result := True;
  8332. end;
  8333. { Don't risk it if the jump isn't always true (Result remains False) }
  8334. end;
  8335. end;
  8336. else
  8337. { If anything else don't optimise };
  8338. end;
  8339. end;
  8340. if Result then
  8341. begin
  8342. { Just so we have something to insert as a paremeter}
  8343. reference_reset(NewRef, 1, []);
  8344. NewInstr := taicpu.op_ref(A_JMP, S_NO, NewRef);
  8345. { Now actually load the correct parameter (this also
  8346. increases the reference count) }
  8347. NewInstr.loadsymbol(0, DestLabel, 0);
  8348. if (cs_opt_level3 in current_settings.optimizerswitches) then
  8349. begin
  8350. { Get instruction before original label (may not be p under -O3) }
  8351. if not GetLastInstruction(hp1, hp2) then
  8352. { Shouldn't fail here }
  8353. InternalError(2021040701);
  8354. { Before the aligns too }
  8355. while (hp2.typ = ait_align) do
  8356. if not GetLastInstruction(hp2, hp2) then
  8357. { Shouldn't fail here }
  8358. InternalError(2021040702);
  8359. end
  8360. else
  8361. hp2 := p;
  8362. taicpu(NewInstr).fileinfo := taicpu(hp2).fileinfo;
  8363. AsmL.InsertAfter(NewInstr, hp2);
  8364. { Add new alignment field }
  8365. (* AsmL.InsertAfter(
  8366. cai_align.create_max(
  8367. current_settings.alignment.jumpalign,
  8368. current_settings.alignment.jumpalignskipmax
  8369. ),
  8370. NewInstr
  8371. ); *)
  8372. end;
  8373. Exit;
  8374. end;
  8375. end;
  8376. else
  8377. ;
  8378. end;
  8379. end;
  8380. if not GetNextInstruction(p, hp1) then
  8381. Exit;
  8382. if MatchInstruction(hp1, A_CMP, A_TEST, [taicpu(p).opsize])
  8383. and DoMovCmpMemOpt(p, hp1, True) then
  8384. begin
  8385. Result := True;
  8386. Exit;
  8387. end
  8388. else if MatchInstruction(hp1, A_JMP, [S_NO]) then
  8389. begin
  8390. { Sometimes the MOVs that OptPass2JMP produces can be improved
  8391. further, but we can't just put this jump optimisation in pass 1
  8392. because it tends to perform worse when conditional jumps are
  8393. nearby (e.g. when converting CMOV instructions). [Kit] }
  8394. CopyUsedRegs(TempTracking);
  8395. UpdateUsedRegs(tai(p.Next));
  8396. if OptPass2JMP(hp1) then
  8397. { call OptPass1MOV once to potentially merge any MOVs that were created }
  8398. Result := OptPass1MOV(p);
  8399. { OptPass2MOV will now exit but will be called again if OptPass1MOV
  8400. returned True and the instruction is still a MOV, thus checking
  8401. the optimisations below }
  8402. { If OptPass2JMP returned False, no optimisations were done to
  8403. the jump and there are no further optimisations that can be done
  8404. to the MOV instruction on this pass }
  8405. { Restore register state }
  8406. RestoreUsedRegs(TempTracking);
  8407. ReleaseUsedRegs(TempTracking);
  8408. end
  8409. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8410. (taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) and
  8411. MatchInstruction(hp1,A_ADD,A_SUB,[taicpu(p).opsize]) and
  8412. (taicpu(hp1).oper[1]^.typ = top_reg) and
  8413. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  8414. begin
  8415. { Change:
  8416. movl/q %reg1,%reg2 movl/q %reg1,%reg2
  8417. addl/q $x,%reg2 subl/q $x,%reg2
  8418. To:
  8419. leal/q x(%reg1),%reg2 leal/q -x(%reg1),%reg2
  8420. }
  8421. if (taicpu(hp1).oper[0]^.typ = top_const) and
  8422. { be lazy, checking separately for sub would be slightly better }
  8423. (abs(taicpu(hp1).oper[0]^.val)<=$7fffffff) then
  8424. begin
  8425. TransferUsedRegs(TmpUsedRegs);
  8426. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8427. if TryMovArith2Lea(hp1) then
  8428. begin
  8429. Result := True;
  8430. Exit;
  8431. end
  8432. end
  8433. else if not RegInOp(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^) and
  8434. GetNextInstructionUsingReg(hp1, hp2, taicpu(p).oper[1]^.reg) and
  8435. { Same as above, but also adds or subtracts to %reg2 in between.
  8436. It's still valid as long as the flags aren't in use }
  8437. MatchInstruction(hp2,A_ADD,A_SUB,[taicpu(p).opsize]) and
  8438. MatchOpType(taicpu(hp2), top_const, top_reg) and
  8439. (taicpu(hp2).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  8440. { be lazy, checking separately for sub would be slightly better }
  8441. (abs(taicpu(hp2).oper[0]^.val)<=$7fffffff) then
  8442. begin
  8443. TransferUsedRegs(TmpUsedRegs);
  8444. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8445. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  8446. if TryMovArith2Lea(hp2) then
  8447. begin
  8448. Result := True;
  8449. Exit;
  8450. end;
  8451. end;
  8452. end
  8453. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8454. {$ifdef x86_64}
  8455. MatchInstruction(hp1,A_MOVZX,A_MOVSX,A_MOVSXD,[]) and
  8456. {$else x86_64}
  8457. MatchInstruction(hp1,A_MOVZX,A_MOVSX,[]) and
  8458. {$endif x86_64}
  8459. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  8460. (taicpu(hp1).oper[0]^.reg = taicpu(p).oper[1]^.reg) then
  8461. { mov reg1, reg2 mov reg1, reg2
  8462. movzx/sx reg2, reg3 to movzx/sx reg1, reg3}
  8463. begin
  8464. taicpu(hp1).oper[0]^.reg := taicpu(p).oper[0]^.reg;
  8465. DebugMsg(SPeepholeOptimization + 'mov %reg1,%reg2; movzx/sx %reg2,%reg3 -> mov %reg1,%reg2;movzx/sx %reg1,%reg3',p);
  8466. { Don't remove the MOV command without first checking that reg2 isn't used afterwards,
  8467. or unless supreg(reg3) = supreg(reg2)). [Kit] }
  8468. TransferUsedRegs(TmpUsedRegs);
  8469. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  8470. if (getsupreg(taicpu(p).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) or
  8471. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs)
  8472. then
  8473. begin
  8474. RemoveCurrentP(p, hp1);
  8475. Result:=true;
  8476. end;
  8477. exit;
  8478. end
  8479. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8480. IsXCHGAcceptable and
  8481. { XCHG doesn't support 8-byte registers }
  8482. (taicpu(p).opsize <> S_B) and
  8483. MatchInstruction(hp1, A_MOV, []) and
  8484. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  8485. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[0]^.reg) and
  8486. GetNextInstruction(hp1, hp2) and
  8487. MatchInstruction(hp2, A_MOV, []) and
  8488. { Don't need to call MatchOpType for hp2 because the operand matches below cover for it }
  8489. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[1]^.reg) and
  8490. MatchOperand(taicpu(hp2).oper[1]^, taicpu(hp1).oper[0]^.reg) then
  8491. begin
  8492. { mov %reg1,%reg2
  8493. mov %reg3,%reg1 -> xchg %reg3,%reg1
  8494. mov %reg2,%reg3
  8495. (%reg2 not used afterwards)
  8496. Note that xchg takes 3 cycles to execute, and generally mov's take
  8497. only one cycle apiece, but the first two mov's can be executed in
  8498. parallel, only taking 2 cycles overall. Older processors should
  8499. therefore only optimise for size. [Kit]
  8500. }
  8501. TransferUsedRegs(TmpUsedRegs);
  8502. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8503. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  8504. if not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp2, TmpUsedRegs) then
  8505. begin
  8506. DebugMsg(SPeepholeOptimization + 'MovMovMov2XChg', p);
  8507. AllocRegBetween(taicpu(hp2).oper[1]^.reg, p, hp1, UsedRegs);
  8508. taicpu(hp1).opcode := A_XCHG;
  8509. RemoveCurrentP(p, hp1);
  8510. RemoveInstruction(hp2);
  8511. Result := True;
  8512. Exit;
  8513. end;
  8514. end
  8515. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8516. MatchInstruction(hp1, A_SAR, []) then
  8517. begin
  8518. if MatchOperand(taicpu(hp1).oper[0]^, 31) then
  8519. begin
  8520. { the use of %edx also covers the opsize being S_L }
  8521. if MatchOperand(taicpu(hp1).oper[1]^, NR_EDX) then
  8522. begin
  8523. { Note it has to be specifically "movl %eax,%edx", and those specific sub-registers }
  8524. if (taicpu(p).oper[0]^.reg = NR_EAX) and
  8525. (taicpu(p).oper[1]^.reg = NR_EDX) then
  8526. begin
  8527. { Change:
  8528. movl %eax,%edx
  8529. sarl $31,%edx
  8530. To:
  8531. cltd
  8532. }
  8533. DebugMsg(SPeepholeOptimization + 'MovSar2Cltd', p);
  8534. RemoveInstruction(hp1);
  8535. taicpu(p).opcode := A_CDQ;
  8536. taicpu(p).opsize := S_NO;
  8537. taicpu(p).clearop(1);
  8538. taicpu(p).clearop(0);
  8539. taicpu(p).ops:=0;
  8540. Result := True;
  8541. end
  8542. else if (cs_opt_size in current_settings.optimizerswitches) and
  8543. (taicpu(p).oper[0]^.reg = NR_EDX) and
  8544. (taicpu(p).oper[1]^.reg = NR_EAX) then
  8545. begin
  8546. { Change:
  8547. movl %edx,%eax
  8548. sarl $31,%edx
  8549. To:
  8550. movl %edx,%eax
  8551. cltd
  8552. Note that this creates a dependency between the two instructions,
  8553. so only perform if optimising for size.
  8554. }
  8555. DebugMsg(SPeepholeOptimization + 'MovSar2MovCltd', p);
  8556. taicpu(hp1).opcode := A_CDQ;
  8557. taicpu(hp1).opsize := S_NO;
  8558. taicpu(hp1).clearop(1);
  8559. taicpu(hp1).clearop(0);
  8560. taicpu(hp1).ops:=0;
  8561. end;
  8562. {$ifndef x86_64}
  8563. end
  8564. { Don't bother if CMOV is supported, because a more optimal
  8565. sequence would have been generated for the Abs() intrinsic }
  8566. else if not(CPUX86_HAS_CMOV in cpu_capabilities[current_settings.cputype]) and
  8567. { the use of %eax also covers the opsize being S_L }
  8568. MatchOperand(taicpu(hp1).oper[1]^, NR_EAX) and
  8569. (taicpu(p).oper[0]^.reg = NR_EAX) and
  8570. (taicpu(p).oper[1]^.reg = NR_EDX) and
  8571. GetNextInstruction(hp1, hp2) and
  8572. MatchInstruction(hp2, A_XOR, [S_L]) and
  8573. MatchOperand(taicpu(hp2).oper[0]^, NR_EAX) and
  8574. MatchOperand(taicpu(hp2).oper[1]^, NR_EDX) and
  8575. GetNextInstruction(hp2, hp3) and
  8576. MatchInstruction(hp3, A_SUB, [S_L]) and
  8577. MatchOperand(taicpu(hp3).oper[0]^, NR_EAX) and
  8578. MatchOperand(taicpu(hp3).oper[1]^, NR_EDX) then
  8579. begin
  8580. { Change:
  8581. movl %eax,%edx
  8582. sarl $31,%eax
  8583. xorl %eax,%edx
  8584. subl %eax,%edx
  8585. (Instruction that uses %edx)
  8586. (%eax deallocated)
  8587. (%edx deallocated)
  8588. To:
  8589. cltd
  8590. xorl %edx,%eax <-- Note the registers have swapped
  8591. subl %edx,%eax
  8592. (Instruction that uses %eax) <-- %eax rather than %edx
  8593. }
  8594. TransferUsedRegs(TmpUsedRegs);
  8595. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8596. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  8597. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  8598. if not RegUsedAfterInstruction(NR_EAX, hp3, TmpUsedRegs) then
  8599. begin
  8600. if GetNextInstruction(hp3, hp4) and
  8601. not RegModifiedByInstruction(NR_EDX, hp4) and
  8602. not RegUsedAfterInstruction(NR_EDX, hp4, TmpUsedRegs) then
  8603. begin
  8604. DebugMsg(SPeepholeOptimization + 'abs() intrinsic optimisation', p);
  8605. taicpu(p).opcode := A_CDQ;
  8606. taicpu(p).clearop(1);
  8607. taicpu(p).clearop(0);
  8608. taicpu(p).ops:=0;
  8609. RemoveInstruction(hp1);
  8610. taicpu(hp2).loadreg(0, NR_EDX);
  8611. taicpu(hp2).loadreg(1, NR_EAX);
  8612. taicpu(hp3).loadreg(0, NR_EDX);
  8613. taicpu(hp3).loadreg(1, NR_EAX);
  8614. AllocRegBetween(NR_EAX, hp3, hp4, TmpUsedRegs);
  8615. { Convert references in the following instruction (hp4) from %edx to %eax }
  8616. for OperIdx := 0 to taicpu(hp4).ops - 1 do
  8617. with taicpu(hp4).oper[OperIdx]^ do
  8618. case typ of
  8619. top_reg:
  8620. if getsupreg(reg) = RS_EDX then
  8621. reg := newreg(R_INTREGISTER,RS_EAX,getsubreg(reg));
  8622. top_ref:
  8623. begin
  8624. if getsupreg(reg) = RS_EDX then
  8625. ref^.base := newreg(R_INTREGISTER,RS_EAX,getsubreg(reg));
  8626. if getsupreg(reg) = RS_EDX then
  8627. ref^.index := newreg(R_INTREGISTER,RS_EAX,getsubreg(reg));
  8628. end;
  8629. else
  8630. ;
  8631. end;
  8632. end;
  8633. end;
  8634. {$else x86_64}
  8635. end;
  8636. end
  8637. else if MatchOperand(taicpu(hp1).oper[0]^, 63) and
  8638. { the use of %rdx also covers the opsize being S_Q }
  8639. MatchOperand(taicpu(hp1).oper[1]^, NR_RDX) then
  8640. begin
  8641. { Note it has to be specifically "movq %rax,%rdx", and those specific sub-registers }
  8642. if (taicpu(p).oper[0]^.reg = NR_RAX) and
  8643. (taicpu(p).oper[1]^.reg = NR_RDX) then
  8644. begin
  8645. { Change:
  8646. movq %rax,%rdx
  8647. sarq $63,%rdx
  8648. To:
  8649. cqto
  8650. }
  8651. DebugMsg(SPeepholeOptimization + 'MovSar2Cqto', p);
  8652. RemoveInstruction(hp1);
  8653. taicpu(p).opcode := A_CQO;
  8654. taicpu(p).opsize := S_NO;
  8655. taicpu(p).clearop(1);
  8656. taicpu(p).clearop(0);
  8657. taicpu(p).ops:=0;
  8658. Result := True;
  8659. end
  8660. else if (cs_opt_size in current_settings.optimizerswitches) and
  8661. (taicpu(p).oper[0]^.reg = NR_RDX) and
  8662. (taicpu(p).oper[1]^.reg = NR_RAX) then
  8663. begin
  8664. { Change:
  8665. movq %rdx,%rax
  8666. sarq $63,%rdx
  8667. To:
  8668. movq %rdx,%rax
  8669. cqto
  8670. Note that this creates a dependency between the two instructions,
  8671. so only perform if optimising for size.
  8672. }
  8673. DebugMsg(SPeepholeOptimization + 'MovSar2MovCqto', p);
  8674. taicpu(hp1).opcode := A_CQO;
  8675. taicpu(hp1).opsize := S_NO;
  8676. taicpu(hp1).clearop(1);
  8677. taicpu(hp1).clearop(0);
  8678. taicpu(hp1).ops:=0;
  8679. {$endif x86_64}
  8680. end;
  8681. end;
  8682. end
  8683. else if MatchInstruction(hp1, A_MOV, []) and
  8684. (taicpu(hp1).oper[1]^.typ = top_reg) then
  8685. { Though "GetNextInstruction" could be factored out, along with
  8686. the instructions that depend on hp2, it is an expensive call that
  8687. should be delayed for as long as possible, hence we do cheaper
  8688. checks first that are likely to be False. [Kit] }
  8689. begin
  8690. if (
  8691. (
  8692. MatchOperand(taicpu(p).oper[1]^, NR_EDX) and
  8693. (taicpu(hp1).oper[1]^.reg = NR_EAX) and
  8694. (
  8695. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8696. MatchOperand(taicpu(hp1).oper[0]^, NR_EDX)
  8697. )
  8698. ) or
  8699. (
  8700. MatchOperand(taicpu(p).oper[1]^, NR_EAX) and
  8701. (taicpu(hp1).oper[1]^.reg = NR_EDX) and
  8702. (
  8703. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8704. MatchOperand(taicpu(hp1).oper[0]^, NR_EAX)
  8705. )
  8706. )
  8707. ) and
  8708. GetNextInstruction(hp1, hp2) and
  8709. MatchInstruction(hp2, A_SAR, []) and
  8710. MatchOperand(taicpu(hp2).oper[0]^, 31) then
  8711. begin
  8712. if MatchOperand(taicpu(hp2).oper[1]^, NR_EDX) then
  8713. begin
  8714. { Change:
  8715. movl r/m,%edx movl r/m,%eax movl r/m,%edx movl r/m,%eax
  8716. movl %edx,%eax or movl %eax,%edx or movl r/m,%eax or movl r/m,%edx
  8717. sarl $31,%edx sarl $31,%edx sarl $31,%edx sarl $31,%edx
  8718. To:
  8719. movl r/m,%eax <- Note the change in register
  8720. cltd
  8721. }
  8722. DebugMsg(SPeepholeOptimization + 'MovMovSar2MovCltd', p);
  8723. AllocRegBetween(NR_EAX, p, hp1, UsedRegs);
  8724. taicpu(p).loadreg(1, NR_EAX);
  8725. taicpu(hp1).opcode := A_CDQ;
  8726. taicpu(hp1).clearop(1);
  8727. taicpu(hp1).clearop(0);
  8728. taicpu(hp1).ops:=0;
  8729. RemoveInstruction(hp2);
  8730. (*
  8731. {$ifdef x86_64}
  8732. end
  8733. else if MatchOperand(taicpu(hp2).oper[1]^, NR_RDX) and
  8734. { This code sequence does not get generated - however it might become useful
  8735. if and when 128-bit signed integer types make an appearance, so the code
  8736. is kept here for when it is eventually needed. [Kit] }
  8737. (
  8738. (
  8739. (taicpu(hp1).oper[1]^.reg = NR_RAX) and
  8740. (
  8741. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8742. MatchOperand(taicpu(hp1).oper[0]^, NR_RDX)
  8743. )
  8744. ) or
  8745. (
  8746. (taicpu(hp1).oper[1]^.reg = NR_RDX) and
  8747. (
  8748. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8749. MatchOperand(taicpu(hp1).oper[0]^, NR_RAX)
  8750. )
  8751. )
  8752. ) and
  8753. GetNextInstruction(hp1, hp2) and
  8754. MatchInstruction(hp2, A_SAR, [S_Q]) and
  8755. MatchOperand(taicpu(hp2).oper[0]^, 63) and
  8756. MatchOperand(taicpu(hp2).oper[1]^, NR_RDX) then
  8757. begin
  8758. { Change:
  8759. movq r/m,%rdx movq r/m,%rax movq r/m,%rdx movq r/m,%rax
  8760. movq %rdx,%rax or movq %rax,%rdx or movq r/m,%rax or movq r/m,%rdx
  8761. sarq $63,%rdx sarq $63,%rdx sarq $63,%rdx sarq $63,%rdx
  8762. To:
  8763. movq r/m,%rax <- Note the change in register
  8764. cqto
  8765. }
  8766. DebugMsg(SPeepholeOptimization + 'MovMovSar2MovCqto', p);
  8767. AllocRegBetween(NR_RAX, p, hp1, UsedRegs);
  8768. taicpu(p).loadreg(1, NR_RAX);
  8769. taicpu(hp1).opcode := A_CQO;
  8770. taicpu(hp1).clearop(1);
  8771. taicpu(hp1).clearop(0);
  8772. taicpu(hp1).ops:=0;
  8773. RemoveInstruction(hp2);
  8774. {$endif x86_64}
  8775. *)
  8776. end;
  8777. end;
  8778. {$ifdef x86_64}
  8779. end
  8780. else if (taicpu(p).opsize = S_L) and
  8781. (taicpu(p).oper[1]^.typ = top_reg) and
  8782. (
  8783. MatchInstruction(hp1, A_MOV,[]) and
  8784. (taicpu(hp1).opsize = S_L) and
  8785. (taicpu(hp1).oper[1]^.typ = top_reg)
  8786. ) and (
  8787. GetNextInstruction(hp1, hp2) and
  8788. (tai(hp2).typ=ait_instruction) and
  8789. (taicpu(hp2).opsize = S_Q) and
  8790. (
  8791. (
  8792. MatchInstruction(hp2, A_ADD,[]) and
  8793. (taicpu(hp2).opsize = S_Q) and
  8794. (taicpu(hp2).oper[0]^.typ = top_reg) and (taicpu(hp2).oper[1]^.typ = top_reg) and
  8795. (
  8796. (
  8797. (getsupreg(taicpu(hp2).oper[0]^.reg) = getsupreg(taicpu(p).oper[1]^.reg)) and
  8798. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg))
  8799. ) or (
  8800. (getsupreg(taicpu(hp2).oper[0]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) and
  8801. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(p).oper[1]^.reg))
  8802. )
  8803. )
  8804. ) or (
  8805. MatchInstruction(hp2, A_LEA,[]) and
  8806. (taicpu(hp2).oper[0]^.ref^.offset = 0) and
  8807. (taicpu(hp2).oper[0]^.ref^.scalefactor <= 1) and
  8808. (
  8809. (
  8810. (getsupreg(taicpu(hp2).oper[0]^.ref^.base) = getsupreg(taicpu(p).oper[1]^.reg)) and
  8811. (getsupreg(taicpu(hp2).oper[0]^.ref^.index) = getsupreg(taicpu(hp1).oper[1]^.reg))
  8812. ) or (
  8813. (getsupreg(taicpu(hp2).oper[0]^.ref^.base) = getsupreg(taicpu(hp1).oper[1]^.reg)) and
  8814. (getsupreg(taicpu(hp2).oper[0]^.ref^.index) = getsupreg(taicpu(p).oper[1]^.reg))
  8815. )
  8816. ) and (
  8817. (
  8818. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg))
  8819. ) or (
  8820. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(p).oper[1]^.reg))
  8821. )
  8822. )
  8823. )
  8824. )
  8825. ) and (
  8826. GetNextInstruction(hp2, hp3) and
  8827. MatchInstruction(hp3, A_SHR,[]) and
  8828. (taicpu(hp3).opsize = S_Q) and
  8829. (taicpu(hp3).oper[0]^.typ = top_const) and (taicpu(hp2).oper[1]^.typ = top_reg) and
  8830. (taicpu(hp3).oper[0]^.val = 1) and
  8831. (taicpu(hp3).oper[1]^.reg = taicpu(hp2).oper[1]^.reg)
  8832. ) then
  8833. begin
  8834. { Change movl x, reg1d movl x, reg1d
  8835. movl y, reg2d movl y, reg2d
  8836. addq reg2q,reg1q or leaq (reg1q,reg2q),reg1q
  8837. shrq $1, reg1q shrq $1, reg1q
  8838. ( reg1d and reg2d can be switched around in the first two instructions )
  8839. To movl x, reg1d
  8840. addl y, reg1d
  8841. rcrl $1, reg1d
  8842. This corresponds to the common expression (x + y) shr 1, where
  8843. x and y are Cardinals (replacing "shr 1" with "div 2" produces
  8844. smaller code, but won't account for x + y causing an overflow). [Kit]
  8845. }
  8846. DebugMsg(SPeepholeOptimization + 'MovMov*Shr2MovMov*Rcr', p);
  8847. if (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) then
  8848. { Change first MOV command to have the same register as the final output }
  8849. taicpu(p).oper[1]^.reg := taicpu(hp1).oper[1]^.reg
  8850. else
  8851. taicpu(hp1).oper[1]^.reg := taicpu(p).oper[1]^.reg;
  8852. { Change second MOV command to an ADD command. This is easier than
  8853. converting the existing command because it means we don't have to
  8854. touch 'y', which might be a complicated reference, and also the
  8855. fact that the third command might either be ADD or LEA. [Kit] }
  8856. taicpu(hp1).opcode := A_ADD;
  8857. { Delete old ADD/LEA instruction }
  8858. RemoveInstruction(hp2);
  8859. { Convert "shrq $1, reg1q" to "rcr $1, reg1d" }
  8860. taicpu(hp3).opcode := A_RCR;
  8861. taicpu(hp3).changeopsize(S_L);
  8862. setsubreg(taicpu(hp3).oper[1]^.reg, R_SUBD);
  8863. {$endif x86_64}
  8864. end;
  8865. if FuncMov2Func(p, hp1) then
  8866. begin
  8867. Result := True;
  8868. Exit;
  8869. end;
  8870. end;
  8871. {$push}
  8872. {$q-}{$r-}
  8873. function TX86AsmOptimizer.OptPass2Movx(var p : tai) : boolean;
  8874. var
  8875. ThisReg: TRegister;
  8876. MinSize, MaxSize, TryShiftDown, TargetSize: TOpSize;
  8877. TargetSubReg: TSubRegister;
  8878. hp1, hp2: tai;
  8879. RegInUse, RegChanged, p_removed, hp1_removed: Boolean;
  8880. { Store list of found instructions so we don't have to call
  8881. GetNextInstructionUsingReg multiple times }
  8882. InstrList: array of taicpu;
  8883. InstrMax, Index: Integer;
  8884. UpperLimit, SignedUpperLimit, SignedUpperLimitBottom,
  8885. LowerLimit, SignedLowerLimit, SignedLowerLimitBottom,
  8886. TryShiftDownLimit, TryShiftDownSignedLimit, TryShiftDownSignedLimitLower,
  8887. WorkingValue: TCgInt;
  8888. PreMessage: string;
  8889. { Data flow analysis }
  8890. TestValMin, TestValMax, TestValSignedMax: TCgInt;
  8891. BitwiseOnly, OrXorUsed,
  8892. ShiftDownOverflow, UpperSignedOverflow, UpperUnsignedOverflow, LowerSignedOverflow, LowerUnsignedOverflow: Boolean;
  8893. function CheckOverflowConditions: Boolean;
  8894. begin
  8895. Result := True;
  8896. if (TestValSignedMax > SignedUpperLimit) then
  8897. UpperSignedOverflow := True;
  8898. if (TestValSignedMax > SignedLowerLimit) or (TestValSignedMax < SignedLowerLimitBottom) then
  8899. LowerSignedOverflow := True;
  8900. if (TestValMin > LowerLimit) or (TestValMax > LowerLimit) then
  8901. LowerUnsignedOverflow := True;
  8902. if (TestValMin > UpperLimit) or (TestValMax > UpperLimit) or (TestValSignedMax > UpperLimit) or
  8903. (TestValMin < SignedUpperLimitBottom) or (TestValMax < SignedUpperLimitBottom) or (TestValSignedMax < SignedUpperLimitBottom) then
  8904. begin
  8905. { Absolute overflow }
  8906. Result := False;
  8907. Exit;
  8908. end;
  8909. if not ShiftDownOverflow and (TryShiftDown <> S_NO) and
  8910. ((TestValMin > TryShiftDownLimit) or (TestValMax > TryShiftDownLimit)) then
  8911. ShiftDownOverflow := True;
  8912. if (TestValMin < 0) or (TestValMax < 0) then
  8913. begin
  8914. LowerUnsignedOverflow := True;
  8915. UpperUnsignedOverflow := True;
  8916. end;
  8917. end;
  8918. function AdjustInitialLoadAndSize: Boolean;
  8919. begin
  8920. Result := False;
  8921. if not p_removed then
  8922. begin
  8923. if TargetSize = MinSize then
  8924. begin
  8925. { Convert the input MOVZX to a MOV }
  8926. if (taicpu(p).oper[0]^.typ = top_reg) and
  8927. SuperRegistersEqual(taicpu(p).oper[0]^.reg, ThisReg) then
  8928. begin
  8929. { Or remove it completely! }
  8930. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 1', p);
  8931. RemoveCurrentP(p);
  8932. p_removed := True;
  8933. end
  8934. else
  8935. begin
  8936. DebugMsg(SPeepholeOptimization + 'Movzx2Mov 1', p);
  8937. taicpu(p).opcode := A_MOV;
  8938. taicpu(p).oper[1]^.reg := ThisReg;
  8939. taicpu(p).opsize := TargetSize;
  8940. end;
  8941. Result := True;
  8942. end
  8943. else if TargetSize <> MaxSize then
  8944. begin
  8945. case MaxSize of
  8946. S_L:
  8947. if TargetSize = S_W then
  8948. begin
  8949. DebugMsg(SPeepholeOptimization + 'movzbl2movzbw', p);
  8950. taicpu(p).opsize := S_BW;
  8951. taicpu(p).oper[1]^.reg := ThisReg;
  8952. Result := True;
  8953. end
  8954. else
  8955. InternalError(2020112341);
  8956. S_W:
  8957. if TargetSize = S_L then
  8958. begin
  8959. DebugMsg(SPeepholeOptimization + 'movzbw2movzbl', p);
  8960. taicpu(p).opsize := S_BL;
  8961. taicpu(p).oper[1]^.reg := ThisReg;
  8962. Result := True;
  8963. end
  8964. else
  8965. InternalError(2020112342);
  8966. else
  8967. ;
  8968. end;
  8969. end
  8970. else if not hp1_removed and not RegInUse then
  8971. begin
  8972. { If we have something like:
  8973. movzbl (oper),%regd
  8974. add x, %regd
  8975. movzbl %regb, %regd
  8976. We can reduce the register size to the input of the final
  8977. movzbl instruction. Overflows won't have any effect.
  8978. }
  8979. if (taicpu(p).opsize in [S_BW, S_BL]) and
  8980. (taicpu(hp1).opsize in [S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}]) then
  8981. begin
  8982. TargetSize := S_B;
  8983. setsubreg(ThisReg, R_SUBL);
  8984. Result := True;
  8985. end
  8986. else if (taicpu(p).opsize = S_WL) and
  8987. (taicpu(hp1).opsize in [S_WL{$ifdef x86_64}, S_BQ{$endif x86_64}]) then
  8988. begin
  8989. TargetSize := S_W;
  8990. setsubreg(ThisReg, R_SUBW);
  8991. Result := True;
  8992. end;
  8993. if Result then
  8994. begin
  8995. { Convert the input MOVZX to a MOV }
  8996. if (taicpu(p).oper[0]^.typ = top_reg) and
  8997. SuperRegistersEqual(taicpu(p).oper[0]^.reg, ThisReg) then
  8998. begin
  8999. { Or remove it completely! }
  9000. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 1a', p);
  9001. RemoveCurrentP(p);
  9002. p_removed := True;
  9003. end
  9004. else
  9005. begin
  9006. DebugMsg(SPeepholeOptimization + 'Movzx2Mov 1a', p);
  9007. taicpu(p).opcode := A_MOV;
  9008. taicpu(p).oper[1]^.reg := ThisReg;
  9009. taicpu(p).opsize := TargetSize;
  9010. end;
  9011. end;
  9012. end;
  9013. end;
  9014. end;
  9015. procedure AdjustFinalLoad;
  9016. begin
  9017. if not LowerUnsignedOverflow then
  9018. begin
  9019. if ((TargetSize = S_L) and (taicpu(hp1).opsize in [S_L, S_BL, S_WL])) or
  9020. ((TargetSize = S_W) and (taicpu(hp1).opsize in [S_W, S_BW])) then
  9021. begin
  9022. { Convert the output MOVZX to a MOV }
  9023. if SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9024. begin
  9025. { Make sure the zero-expansion covers at least the minimum size (fixes i40003) }
  9026. if (MinSize = S_B) or
  9027. (not ShiftDownOverflow and (TryShiftDown = S_B)) or
  9028. ((MinSize = S_W) and (taicpu(hp1).opsize = S_WL)) then
  9029. begin
  9030. { Remove it completely! }
  9031. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 2', hp1);
  9032. { Be careful; if p = hp1 and p was also removed, p
  9033. will become a dangling pointer }
  9034. if p = hp1 then
  9035. begin
  9036. RemoveCurrentp(p); { p = hp1 and will then become the next instruction }
  9037. p_removed := True;
  9038. end
  9039. else
  9040. RemoveInstruction(hp1);
  9041. hp1_removed := True;
  9042. end;
  9043. end
  9044. else
  9045. begin
  9046. DebugMsg(SPeepholeOptimization + 'Movzx2Mov 2', hp1);
  9047. taicpu(hp1).opcode := A_MOV;
  9048. taicpu(hp1).oper[0]^.reg := ThisReg;
  9049. taicpu(hp1).opsize := TargetSize;
  9050. end;
  9051. end
  9052. else if (TargetSize = S_B) and (MaxSize = S_W) and (taicpu(hp1).opsize = S_WL) then
  9053. begin
  9054. { Need to change the size of the output }
  9055. DebugMsg(SPeepholeOptimization + 'movzwl2movzbl 2', hp1);
  9056. taicpu(hp1).oper[0]^.reg := ThisReg;
  9057. taicpu(hp1).opsize := S_BL;
  9058. end;
  9059. end;
  9060. end;
  9061. function CompressInstructions: Boolean;
  9062. var
  9063. LocalIndex: Integer;
  9064. begin
  9065. Result := False;
  9066. { The objective here is to try to find a combination that
  9067. removes one of the MOV/Z instructions. }
  9068. if (
  9069. (taicpu(p).oper[0]^.typ <> top_reg) or
  9070. not SuperRegistersEqual(taicpu(p).oper[0]^.reg, ThisReg)
  9071. ) and
  9072. (taicpu(hp1).oper[1]^.typ = top_reg) and
  9073. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9074. begin
  9075. { Make a preference to remove the second MOVZX instruction }
  9076. case taicpu(hp1).opsize of
  9077. S_BL, S_WL:
  9078. begin
  9079. TargetSize := S_L;
  9080. TargetSubReg := R_SUBD;
  9081. end;
  9082. S_BW:
  9083. begin
  9084. TargetSize := S_W;
  9085. TargetSubReg := R_SUBW;
  9086. end;
  9087. else
  9088. InternalError(2020112302);
  9089. end;
  9090. end
  9091. else
  9092. begin
  9093. if LowerUnsignedOverflow and not UpperUnsignedOverflow then
  9094. begin
  9095. { Exceeded lower bound but not upper bound }
  9096. TargetSize := MaxSize;
  9097. end
  9098. else if not LowerUnsignedOverflow then
  9099. begin
  9100. { Size didn't exceed lower bound }
  9101. TargetSize := MinSize;
  9102. end
  9103. else
  9104. Exit;
  9105. end;
  9106. case TargetSize of
  9107. S_B:
  9108. TargetSubReg := R_SUBL;
  9109. S_W:
  9110. TargetSubReg := R_SUBW;
  9111. S_L:
  9112. TargetSubReg := R_SUBD;
  9113. else
  9114. InternalError(2020112350);
  9115. end;
  9116. { Update the register to its new size }
  9117. setsubreg(ThisReg, TargetSubReg);
  9118. RegInUse := False;
  9119. if not SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9120. begin
  9121. { Check to see if the active register is used afterwards;
  9122. if not, we can change it and make a saving. }
  9123. TransferUsedRegs(TmpUsedRegs);
  9124. { The target register may be marked as in use to cross
  9125. a jump to a distant label, so exclude it }
  9126. ExcludeRegFromUsedRegs(taicpu(hp1).oper[1]^.reg, TmpUsedRegs);
  9127. hp2 := p;
  9128. repeat
  9129. { Explicitly check for the excluded register (don't include the first
  9130. instruction as it may be reading from here }
  9131. if ((p <> hp2) and (RegInInstruction(taicpu(hp1).oper[1]^.reg, hp2))) or
  9132. RegInUsedRegs(taicpu(hp1).oper[1]^.reg, TmpUsedRegs) then
  9133. begin
  9134. RegInUse := True;
  9135. Break;
  9136. end;
  9137. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  9138. if not GetNextInstruction(hp2, hp2) then
  9139. InternalError(2020112340);
  9140. until (hp2 = hp1);
  9141. if not RegInUse and RegUsedAfterInstruction(ThisReg, hp1, TmpUsedRegs) then
  9142. { We might still be able to get away with this }
  9143. RegInUse := not
  9144. (
  9145. GetNextInstructionUsingReg(hp1, hp2, ThisReg) and
  9146. (hp2.typ = ait_instruction) and
  9147. (
  9148. { Under -O1 and -O2, GetNextInstructionUsingReg may return an
  9149. instruction that doesn't actually contain ThisReg }
  9150. (cs_opt_level3 in current_settings.optimizerswitches) or
  9151. RegInInstruction(ThisReg, hp2)
  9152. ) and
  9153. RegLoadedWithNewValue(ThisReg, hp2)
  9154. );
  9155. if not RegInUse then
  9156. begin
  9157. { Force the register size to the same as this instruction so it can be removed}
  9158. if (taicpu(hp1).opsize in [S_L, S_BL, S_WL]) then
  9159. begin
  9160. TargetSize := S_L;
  9161. TargetSubReg := R_SUBD;
  9162. end
  9163. else if (taicpu(hp1).opsize in [S_W, S_BW]) then
  9164. begin
  9165. TargetSize := S_W;
  9166. TargetSubReg := R_SUBW;
  9167. end;
  9168. ThisReg := taicpu(hp1).oper[1]^.reg;
  9169. setsubreg(ThisReg, TargetSubReg);
  9170. RegChanged := True;
  9171. DebugMsg(SPeepholeOptimization + 'Simplified register usage so ' + debug_regname(ThisReg) + ' = ' + debug_regname(taicpu(p).oper[1]^.reg), p);
  9172. TransferUsedRegs(TmpUsedRegs);
  9173. AllocRegBetween(ThisReg, p, hp1, TmpUsedRegs);
  9174. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 3', hp1);
  9175. if p = hp1 then
  9176. begin
  9177. RemoveCurrentp(p); { p = hp1 and will then become the next instruction }
  9178. p_removed := True;
  9179. end
  9180. else
  9181. RemoveInstruction(hp1);
  9182. hp1_removed := True;
  9183. { Instruction will become "mov %reg,%reg" }
  9184. if not p_removed and (taicpu(p).opcode = A_MOV) and
  9185. MatchOperand(taicpu(p).oper[0]^, ThisReg) then
  9186. begin
  9187. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 6', p);
  9188. RemoveCurrentP(p);
  9189. p_removed := True;
  9190. end
  9191. else
  9192. taicpu(p).oper[1]^.reg := ThisReg;
  9193. Result := True;
  9194. end
  9195. else
  9196. begin
  9197. if TargetSize <> MaxSize then
  9198. begin
  9199. { Since the register is in use, we have to force it to
  9200. MaxSize otherwise part of it may become undefined later on }
  9201. TargetSize := MaxSize;
  9202. case TargetSize of
  9203. S_B:
  9204. TargetSubReg := R_SUBL;
  9205. S_W:
  9206. TargetSubReg := R_SUBW;
  9207. S_L:
  9208. TargetSubReg := R_SUBD;
  9209. else
  9210. InternalError(2020112351);
  9211. end;
  9212. setsubreg(ThisReg, TargetSubReg);
  9213. end;
  9214. AdjustFinalLoad;
  9215. end;
  9216. end
  9217. else
  9218. AdjustFinalLoad;
  9219. Result := AdjustInitialLoadAndSize or Result;
  9220. { Now go through every instruction we found and change the
  9221. size. If TargetSize = MaxSize, then almost no changes are
  9222. needed and Result can remain False if it hasn't been set
  9223. yet.
  9224. If RegChanged is True, then the register requires changing
  9225. and so the point about TargetSize = MaxSize doesn't apply. }
  9226. if ((TargetSize <> MaxSize) or RegChanged) and (InstrMax >= 0) then
  9227. begin
  9228. for LocalIndex := 0 to InstrMax do
  9229. begin
  9230. { If p_removed is true, then the original MOV/Z was removed
  9231. and removing the AND instruction may not be safe if it
  9232. appears first }
  9233. if (InstrList[LocalIndex].oper[InstrList[LocalIndex].ops - 1]^.typ <> top_reg) then
  9234. InternalError(2020112310);
  9235. if InstrList[LocalIndex].oper[0]^.typ = top_reg then
  9236. InstrList[LocalIndex].oper[0]^.reg := ThisReg;
  9237. InstrList[LocalIndex].oper[InstrList[LocalIndex].ops - 1]^.reg := ThisReg;
  9238. InstrList[LocalIndex].opsize := TargetSize;
  9239. end;
  9240. Result := True;
  9241. end;
  9242. end;
  9243. begin
  9244. Result := False;
  9245. p_removed := False;
  9246. hp1_removed := False;
  9247. ThisReg := taicpu(p).oper[1]^.reg;
  9248. { Check for:
  9249. movs/z ###,%ecx (or %cx or %rcx)
  9250. ...
  9251. shl/shr/sar/rcl/rcr/ror/rol %cl,###
  9252. (dealloc %ecx)
  9253. Change to:
  9254. mov ###,%cl (if ### = %cl, then remove completely)
  9255. ...
  9256. shl/shr/sar/rcl/rcr/ror/rol %cl,###
  9257. }
  9258. if (getsupreg(ThisReg) = RS_ECX) and
  9259. GetNextInstructionUsingReg(p, hp1, NR_ECX) and
  9260. (hp1.typ = ait_instruction) and
  9261. (
  9262. { Under -O1 and -O2, GetNextInstructionUsingReg may return an
  9263. instruction that doesn't actually contain ECX }
  9264. (cs_opt_level3 in current_settings.optimizerswitches) or
  9265. RegInInstruction(NR_ECX, hp1) or
  9266. (
  9267. { It's common for the shift/rotate's read/write register to be
  9268. initialised in between, so under -O2 and under, search ahead
  9269. one more instruction
  9270. }
  9271. GetNextInstruction(hp1, hp1) and
  9272. (hp1.typ = ait_instruction) and
  9273. RegInInstruction(NR_ECX, hp1)
  9274. )
  9275. ) and
  9276. MatchInstruction(hp1, [A_SHL, A_SHR, A_SAR, A_ROR, A_ROL, A_RCR, A_RCL], []) and
  9277. (taicpu(hp1).oper[0]^.typ = top_reg) { This is enough to determine that it's %cl } then
  9278. begin
  9279. TransferUsedRegs(TmpUsedRegs);
  9280. hp2 := p;
  9281. repeat
  9282. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  9283. until not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  9284. if not RegUsedAfterInstruction(NR_CL, hp1, TmpUsedRegs) then
  9285. begin
  9286. case taicpu(p).opsize of
  9287. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  9288. if MatchOperand(taicpu(p).oper[0]^, NR_CL) then
  9289. begin
  9290. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 3a', p);
  9291. RemoveCurrentP(p);
  9292. end
  9293. else
  9294. begin
  9295. taicpu(p).opcode := A_MOV;
  9296. taicpu(p).opsize := S_B;
  9297. taicpu(p).oper[1]^.reg := NR_CL;
  9298. DebugMsg(SPeepholeOptimization + 'MovxOp2MovOp 1', p);
  9299. end;
  9300. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  9301. if MatchOperand(taicpu(p).oper[0]^, NR_CX) then
  9302. begin
  9303. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 3b', p);
  9304. RemoveCurrentP(p);
  9305. end
  9306. else
  9307. begin
  9308. taicpu(p).opcode := A_MOV;
  9309. taicpu(p).opsize := S_W;
  9310. taicpu(p).oper[1]^.reg := NR_CX;
  9311. DebugMsg(SPeepholeOptimization + 'MovxOp2MovOp 2', p);
  9312. end;
  9313. {$ifdef x86_64}
  9314. S_LQ:
  9315. if MatchOperand(taicpu(p).oper[0]^, NR_ECX) then
  9316. begin
  9317. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 3c', p);
  9318. RemoveCurrentP(p);
  9319. end
  9320. else
  9321. begin
  9322. taicpu(p).opcode := A_MOV;
  9323. taicpu(p).opsize := S_L;
  9324. taicpu(p).oper[1]^.reg := NR_ECX;
  9325. DebugMsg(SPeepholeOptimization + 'MovxOp2MovOp 3', p);
  9326. end;
  9327. {$endif x86_64}
  9328. else
  9329. InternalError(2021120401);
  9330. end;
  9331. Result := True;
  9332. Exit;
  9333. end;
  9334. end;
  9335. { This is anything but quick! }
  9336. if not(cs_opt_level2 in current_settings.optimizerswitches) then
  9337. Exit;
  9338. SetLength(InstrList, 0);
  9339. InstrMax := -1;
  9340. case taicpu(p).opsize of
  9341. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  9342. begin
  9343. {$if defined(i386) or defined(i8086)}
  9344. { If the target size is 8-bit, make sure we can actually encode it }
  9345. if not (GetSupReg(ThisReg) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX]) then
  9346. Exit;
  9347. {$endif i386 or i8086}
  9348. LowerLimit := $FF;
  9349. SignedLowerLimit := $7F;
  9350. SignedLowerLimitBottom := -128;
  9351. MinSize := S_B;
  9352. if taicpu(p).opsize = S_BW then
  9353. begin
  9354. MaxSize := S_W;
  9355. UpperLimit := $FFFF;
  9356. SignedUpperLimit := $7FFF;
  9357. SignedUpperLimitBottom := -32768;
  9358. end
  9359. else
  9360. begin
  9361. { Keep at a 32-bit limit for BQ as well since one can't really optimise otherwise }
  9362. MaxSize := S_L;
  9363. UpperLimit := $FFFFFFFF;
  9364. SignedUpperLimit := $7FFFFFFF;
  9365. SignedUpperLimitBottom := -2147483648;
  9366. end;
  9367. end;
  9368. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  9369. begin
  9370. { Keep at a 32-bit limit for WQ as well since one can't really optimise otherwise }
  9371. LowerLimit := $FFFF;
  9372. SignedLowerLimit := $7FFF;
  9373. SignedLowerLimitBottom := -32768;
  9374. UpperLimit := $FFFFFFFF;
  9375. SignedUpperLimit := $7FFFFFFF;
  9376. SignedUpperLimitBottom := -2147483648;
  9377. MinSize := S_W;
  9378. MaxSize := S_L;
  9379. end;
  9380. {$ifdef x86_64}
  9381. S_LQ:
  9382. begin
  9383. { Both the lower and upper limits are set to 32-bit. If a limit
  9384. is breached, then optimisation is impossible }
  9385. LowerLimit := $FFFFFFFF;
  9386. SignedLowerLimit := $7FFFFFFF;
  9387. SignedLowerLimitBottom := -2147483648;
  9388. UpperLimit := $FFFFFFFF;
  9389. SignedUpperLimit := $7FFFFFFF;
  9390. SignedUpperLimitBottom := -2147483648;
  9391. MinSize := S_L;
  9392. MaxSize := S_L;
  9393. end;
  9394. {$endif x86_64}
  9395. else
  9396. InternalError(2020112301);
  9397. end;
  9398. TestValMin := 0;
  9399. TestValMax := LowerLimit;
  9400. TestValSignedMax := SignedLowerLimit;
  9401. TryShiftDownLimit := LowerLimit;
  9402. TryShiftDown := S_NO;
  9403. ShiftDownOverflow := False;
  9404. RegChanged := False;
  9405. BitwiseOnly := True;
  9406. OrXorUsed := False;
  9407. UpperSignedOverflow := False;
  9408. LowerSignedOverflow := False;
  9409. UpperUnsignedOverflow := False;
  9410. LowerUnsignedOverflow := False;
  9411. hp1 := p;
  9412. while GetNextInstructionUsingReg(hp1, hp1, ThisReg) and
  9413. (hp1.typ = ait_instruction) and
  9414. (
  9415. { Under -O1 and -O2, GetNextInstructionUsingReg may return an
  9416. instruction that doesn't actually contain ThisReg }
  9417. (cs_opt_level3 in current_settings.optimizerswitches) or
  9418. { This allows this Movx optimisation to work through the SETcc instructions
  9419. inserted by the 'CMP/JE/CMP/@Lbl/SETE -> CMP/SETE/CMP/SETE/OR'
  9420. optimisation on -O1 and -O2 (on -O3, GetNextInstructionUsingReg will
  9421. skip over these SETcc instructions). }
  9422. (taicpu(hp1).opcode = A_SETcc) or
  9423. RegInInstruction(ThisReg, hp1)
  9424. ) do
  9425. begin
  9426. case taicpu(hp1).opcode of
  9427. A_INC,A_DEC:
  9428. begin
  9429. { Has to be an exact match on the register }
  9430. if not MatchOperand(taicpu(hp1).oper[0]^, ThisReg) then
  9431. Break;
  9432. if taicpu(hp1).opcode = A_INC then
  9433. begin
  9434. Inc(TestValMin);
  9435. Inc(TestValMax);
  9436. Inc(TestValSignedMax);
  9437. end
  9438. else
  9439. begin
  9440. Dec(TestValMin);
  9441. Dec(TestValMax);
  9442. Dec(TestValSignedMax);
  9443. end;
  9444. end;
  9445. A_TEST, A_CMP:
  9446. begin
  9447. if (
  9448. { Too high a risk of non-linear behaviour that breaks DFA
  9449. here, unless it's cmp $0,%reg, which is equivalent to
  9450. test %reg,%reg }
  9451. OrXorUsed and
  9452. (taicpu(hp1).opcode = A_CMP) and
  9453. not Matchoperand(taicpu(hp1).oper[0]^, 0)
  9454. ) or
  9455. (taicpu(hp1).oper[1]^.typ <> top_reg) or
  9456. { Has to be an exact match on the register }
  9457. (taicpu(hp1).oper[1]^.reg <> ThisReg) or
  9458. (
  9459. { Permit "test %reg,%reg" }
  9460. (taicpu(hp1).opcode = A_TEST) and
  9461. (taicpu(hp1).oper[0]^.typ = top_reg) and
  9462. (taicpu(hp1).oper[0]^.reg <> ThisReg)
  9463. ) or
  9464. (taicpu(hp1).oper[0]^.typ <> top_const) or
  9465. { Make sure the comparison value is not smaller than the
  9466. smallest allowed signed value for the minimum size (e.g.
  9467. -128 for 8-bit) }
  9468. not (
  9469. ((taicpu(hp1).oper[0]^.val and LowerLimit) = taicpu(hp1).oper[0]^.val) or
  9470. { Is it in the negative range? }
  9471. (
  9472. (taicpu(hp1).oper[0]^.val < 0) and
  9473. (taicpu(hp1).oper[0]^.val >= SignedLowerLimitBottom)
  9474. )
  9475. ) then
  9476. Break;
  9477. { Check to see if the active register is used afterwards }
  9478. TransferUsedRegs(TmpUsedRegs);
  9479. IncludeRegInUsedRegs(ThisReg, TmpUsedRegs);
  9480. if not RegUsedAfterInstruction(ThisReg, hp1, TmpUsedRegs) then
  9481. begin
  9482. { Make sure the comparison or any previous instructions
  9483. hasn't pushed the test values outside of the range of
  9484. MinSize }
  9485. if LowerUnsignedOverflow and not UpperUnsignedOverflow then
  9486. begin
  9487. { Exceeded lower bound but not upper bound }
  9488. Exit;
  9489. end
  9490. else if not LowerSignedOverflow or not LowerUnsignedOverflow then
  9491. begin
  9492. { Size didn't exceed lower bound }
  9493. TargetSize := MinSize;
  9494. end
  9495. else
  9496. Break;
  9497. case TargetSize of
  9498. S_B:
  9499. TargetSubReg := R_SUBL;
  9500. S_W:
  9501. TargetSubReg := R_SUBW;
  9502. S_L:
  9503. TargetSubReg := R_SUBD;
  9504. else
  9505. InternalError(2021051002);
  9506. end;
  9507. if TargetSize <> MaxSize then
  9508. begin
  9509. { Update the register to its new size }
  9510. setsubreg(ThisReg, TargetSubReg);
  9511. DebugMsg(SPeepholeOptimization + 'CMP instruction resized thanks to register size optimisation (see MOV/Z assignment above)', hp1);
  9512. taicpu(hp1).oper[1]^.reg := ThisReg;
  9513. taicpu(hp1).opsize := TargetSize;
  9514. { Convert the input MOVZX to a MOV if necessary }
  9515. AdjustInitialLoadAndSize;
  9516. if (InstrMax >= 0) then
  9517. begin
  9518. for Index := 0 to InstrMax do
  9519. begin
  9520. { If p_removed is true, then the original MOV/Z was removed
  9521. and removing the AND instruction may not be safe if it
  9522. appears first }
  9523. if (InstrList[Index].oper[InstrList[Index].ops - 1]^.typ <> top_reg) then
  9524. InternalError(2020112311);
  9525. if InstrList[Index].oper[0]^.typ = top_reg then
  9526. InstrList[Index].oper[0]^.reg := ThisReg;
  9527. InstrList[Index].oper[InstrList[Index].ops - 1]^.reg := ThisReg;
  9528. InstrList[Index].opsize := MinSize;
  9529. end;
  9530. end;
  9531. Result := True;
  9532. end;
  9533. Exit;
  9534. end;
  9535. end;
  9536. A_SETcc:
  9537. begin
  9538. { This allows this Movx optimisation to work through the SETcc instructions
  9539. inserted by the 'CMP/JE/CMP/@Lbl/SETE -> CMP/SETE/CMP/SETE/OR'
  9540. optimisation on -O1 and -O2 (on -O3, GetNextInstructionUsingReg will
  9541. skip over these SETcc instructions). }
  9542. if (cs_opt_level3 in current_settings.optimizerswitches) or
  9543. { Of course, break out if the current register is used }
  9544. RegInOp(ThisReg, taicpu(hp1).oper[0]^) then
  9545. Break
  9546. else
  9547. { We must use Continue so the instruction doesn't get added
  9548. to InstrList }
  9549. Continue;
  9550. end;
  9551. A_ADD,A_SUB,A_AND,A_OR,A_XOR,A_SHL,A_SHR,A_SAR:
  9552. begin
  9553. if
  9554. (taicpu(hp1).oper[1]^.typ <> top_reg) or
  9555. { Has to be an exact match on the register }
  9556. (taicpu(hp1).oper[1]^.reg <> ThisReg) or not
  9557. (
  9558. (
  9559. (taicpu(hp1).oper[0]^.typ = top_const) and
  9560. (
  9561. (
  9562. (taicpu(hp1).opcode = A_SHL) and
  9563. (
  9564. ((MinSize = S_B) and (taicpu(hp1).oper[0]^.val < 8)) or
  9565. ((MinSize = S_W) and (taicpu(hp1).oper[0]^.val < 16)) or
  9566. ((MinSize = S_L) and (taicpu(hp1).oper[0]^.val < 32))
  9567. )
  9568. ) or (
  9569. (taicpu(hp1).opcode <> A_SHL) and
  9570. (
  9571. ((taicpu(hp1).oper[0]^.val and UpperLimit) = taicpu(hp1).oper[0]^.val) or
  9572. { Is it in the negative range? }
  9573. (((not taicpu(hp1).oper[0]^.val) and (UpperLimit shr 1)) = (not taicpu(hp1).oper[0]^.val))
  9574. )
  9575. )
  9576. )
  9577. ) or (
  9578. MatchOperand(taicpu(hp1).oper[0]^, taicpu(hp1).oper[1]^.reg) and
  9579. ((taicpu(hp1).opcode = A_ADD) or (taicpu(hp1).opcode = A_AND) or (taicpu(hp1).opcode = A_SUB))
  9580. )
  9581. ) then
  9582. Break;
  9583. { Only process OR and XOR if there are only bitwise operations,
  9584. since otherwise they can too easily fool the data flow
  9585. analysis (they can cause non-linear behaviour) }
  9586. case taicpu(hp1).opcode of
  9587. A_ADD:
  9588. begin
  9589. if OrXorUsed then
  9590. { Too high a risk of non-linear behaviour that breaks DFA here }
  9591. Break
  9592. else
  9593. BitwiseOnly := False;
  9594. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  9595. begin
  9596. TestValMin := TestValMin * 2;
  9597. TestValMax := TestValMax * 2;
  9598. TestValSignedMax := TestValSignedMax * 2;
  9599. end
  9600. else
  9601. begin
  9602. WorkingValue := taicpu(hp1).oper[0]^.val;
  9603. TestValMin := TestValMin + WorkingValue;
  9604. TestValMax := TestValMax + WorkingValue;
  9605. TestValSignedMax := TestValSignedMax + WorkingValue;
  9606. end;
  9607. end;
  9608. A_SUB:
  9609. begin
  9610. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  9611. begin
  9612. TestValMin := 0;
  9613. TestValMax := 0;
  9614. TestValSignedMax := 0;
  9615. end
  9616. else
  9617. begin
  9618. if OrXorUsed then
  9619. { Too high a risk of non-linear behaviour that breaks DFA here }
  9620. Break
  9621. else
  9622. BitwiseOnly := False;
  9623. WorkingValue := taicpu(hp1).oper[0]^.val;
  9624. TestValMin := TestValMin - WorkingValue;
  9625. TestValMax := TestValMax - WorkingValue;
  9626. TestValSignedMax := TestValSignedMax - WorkingValue;
  9627. end;
  9628. end;
  9629. A_AND:
  9630. if (taicpu(hp1).oper[0]^.typ = top_const) then
  9631. begin
  9632. { we might be able to go smaller if AND appears first }
  9633. if InstrMax = -1 then
  9634. case MinSize of
  9635. S_B:
  9636. ;
  9637. S_W:
  9638. if ((taicpu(hp1).oper[0]^.val and $FF) = taicpu(hp1).oper[0]^.val) or
  9639. ((not(taicpu(hp1).oper[0]^.val) and $7F) = (not taicpu(hp1).oper[0]^.val)) then
  9640. begin
  9641. TryShiftDown := S_B;
  9642. TryShiftDownLimit := $FF;
  9643. end;
  9644. S_L:
  9645. if ((taicpu(hp1).oper[0]^.val and $FF) = taicpu(hp1).oper[0]^.val) or
  9646. ((not(taicpu(hp1).oper[0]^.val) and $7F) = (not taicpu(hp1).oper[0]^.val)) then
  9647. begin
  9648. TryShiftDown := S_B;
  9649. TryShiftDownLimit := $FF;
  9650. end
  9651. else if ((taicpu(hp1).oper[0]^.val and $FFFF) = taicpu(hp1).oper[0]^.val) or
  9652. ((not(taicpu(hp1).oper[0]^.val) and $7FFF) = (not taicpu(hp1).oper[0]^.val)) then
  9653. begin
  9654. TryShiftDown := S_W;
  9655. TryShiftDownLimit := $FFFF;
  9656. end;
  9657. else
  9658. InternalError(2020112320);
  9659. end;
  9660. WorkingValue := taicpu(hp1).oper[0]^.val;
  9661. TestValMin := TestValMin and WorkingValue;
  9662. TestValMax := TestValMax and WorkingValue;
  9663. TestValSignedMax := TestValSignedMax and WorkingValue;
  9664. end;
  9665. A_OR:
  9666. begin
  9667. if not BitwiseOnly then
  9668. Break;
  9669. OrXorUsed := True;
  9670. WorkingValue := taicpu(hp1).oper[0]^.val;
  9671. TestValMin := TestValMin or WorkingValue;
  9672. TestValMax := TestValMax or WorkingValue;
  9673. TestValSignedMax := TestValSignedMax or WorkingValue;
  9674. end;
  9675. A_XOR:
  9676. begin
  9677. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  9678. begin
  9679. TestValMin := 0;
  9680. TestValMax := 0;
  9681. TestValSignedMax := 0;
  9682. end
  9683. else
  9684. begin
  9685. if not BitwiseOnly then
  9686. Break;
  9687. OrXorUsed := True;
  9688. WorkingValue := taicpu(hp1).oper[0]^.val;
  9689. TestValMin := TestValMin xor WorkingValue;
  9690. TestValMax := TestValMax xor WorkingValue;
  9691. TestValSignedMax := TestValSignedMax xor WorkingValue;
  9692. end;
  9693. end;
  9694. A_SHL:
  9695. begin
  9696. BitwiseOnly := False;
  9697. WorkingValue := taicpu(hp1).oper[0]^.val;
  9698. TestValMin := TestValMin shl WorkingValue;
  9699. TestValMax := TestValMax shl WorkingValue;
  9700. TestValSignedMax := TestValSignedMax shl WorkingValue;
  9701. end;
  9702. A_SHR,
  9703. { The first instruction was MOVZX, so the value won't be negative }
  9704. A_SAR:
  9705. begin
  9706. if InstrMax <> -1 then
  9707. BitwiseOnly := False
  9708. else
  9709. { we might be able to go smaller if SHR appears first }
  9710. case MinSize of
  9711. S_B:
  9712. ;
  9713. S_W:
  9714. if (taicpu(hp1).oper[0]^.val >= 8) then
  9715. begin
  9716. TryShiftDown := S_B;
  9717. TryShiftDownLimit := $FF;
  9718. TryShiftDownSignedLimit := $7F;
  9719. TryShiftDownSignedLimitLower := -128;
  9720. end;
  9721. S_L:
  9722. if (taicpu(hp1).oper[0]^.val >= 24) then
  9723. begin
  9724. TryShiftDown := S_B;
  9725. TryShiftDownLimit := $FF;
  9726. TryShiftDownSignedLimit := $7F;
  9727. TryShiftDownSignedLimitLower := -128;
  9728. end
  9729. else if (taicpu(hp1).oper[0]^.val >= 16) then
  9730. begin
  9731. TryShiftDown := S_W;
  9732. TryShiftDownLimit := $FFFF;
  9733. TryShiftDownSignedLimit := $7FFF;
  9734. TryShiftDownSignedLimitLower := -32768;
  9735. end;
  9736. else
  9737. InternalError(2020112321);
  9738. end;
  9739. WorkingValue := taicpu(hp1).oper[0]^.val;
  9740. if taicpu(hp1).opcode = A_SAR then
  9741. begin
  9742. TestValMin := SarInt64(TestValMin, WorkingValue);
  9743. TestValMax := SarInt64(TestValMax, WorkingValue);
  9744. TestValSignedMax := SarInt64(TestValSignedMax, WorkingValue);
  9745. end
  9746. else
  9747. begin
  9748. TestValMin := TestValMin shr WorkingValue;
  9749. TestValMax := TestValMax shr WorkingValue;
  9750. TestValSignedMax := TestValSignedMax shr WorkingValue;
  9751. end;
  9752. end;
  9753. else
  9754. InternalError(2020112303);
  9755. end;
  9756. end;
  9757. (*
  9758. A_IMUL:
  9759. case taicpu(hp1).ops of
  9760. 2:
  9761. begin
  9762. if not MatchOpType(hp1, top_reg, top_reg) or
  9763. { Has to be an exact match on the register }
  9764. (taicpu(hp1).oper[0]^.reg <> ThisReg) or
  9765. (taicpu(hp1).oper[1]^.reg <> ThisReg) then
  9766. Break;
  9767. TestValMin := TestValMin * TestValMin;
  9768. TestValMax := TestValMax * TestValMax;
  9769. TestValSignedMax := TestValSignedMax * TestValMax;
  9770. end;
  9771. 3:
  9772. begin
  9773. if not MatchOpType(hp1, top_const, top_reg, top_reg) or
  9774. { Has to be an exact match on the register }
  9775. (taicpu(hp1).oper[1]^.reg <> ThisReg) or
  9776. (taicpu(hp1).oper[2]^.reg <> ThisReg) or
  9777. ((taicpu(hp1).oper[0]^.val and UpperLimit) = taicpu(hp1).oper[0]^.val) or
  9778. { Is it in the negative range? }
  9779. (((not taicpu(hp1).oper[0]^.val) and (UpperLimit shr 1)) = (not taicpu(hp1).oper[0]^.val)) then
  9780. Break;
  9781. TestValMin := TestValMin * taicpu(hp1).oper[0]^.val;
  9782. TestValMax := TestValMax * taicpu(hp1).oper[0]^.val;
  9783. TestValSignedMax := TestValSignedMax * taicpu(hp1).oper[0]^.val;
  9784. end;
  9785. else
  9786. Break;
  9787. end;
  9788. A_IDIV:
  9789. case taicpu(hp1).ops of
  9790. 3:
  9791. begin
  9792. if not MatchOpType(hp1, top_const, top_reg, top_reg) or
  9793. { Has to be an exact match on the register }
  9794. (taicpu(hp1).oper[1]^.reg <> ThisReg) or
  9795. (taicpu(hp1).oper[2]^.reg <> ThisReg) or
  9796. ((taicpu(hp1).oper[0]^.val and UpperLimit) = taicpu(hp1).oper[0]^.val) or
  9797. { Is it in the negative range? }
  9798. (((not taicpu(hp1).oper[0]^.val) and (UpperLimit shr 1)) = (not taicpu(hp1).oper[0]^.val)) then
  9799. Break;
  9800. TestValMin := TestValMin div taicpu(hp1).oper[0]^.val;
  9801. TestValMax := TestValMax div taicpu(hp1).oper[0]^.val;
  9802. TestValSignedMax := TestValSignedMax div taicpu(hp1).oper[0]^.val;
  9803. end;
  9804. else
  9805. Break;
  9806. end;
  9807. *)
  9808. A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  9809. begin
  9810. { If there are no instructions in between, then we might be able to make a saving }
  9811. if UpperSignedOverflow or (taicpu(hp1).oper[0]^.typ <> top_reg) or (taicpu(hp1).oper[0]^.reg <> ThisReg) then
  9812. Break;
  9813. { We have something like:
  9814. movzbw %dl,%dx
  9815. ...
  9816. movswl %dx,%edx
  9817. Change the latter to a zero-extension then enter the
  9818. A_MOVZX case branch.
  9819. }
  9820. {$ifdef x86_64}
  9821. if (taicpu(hp1).opsize = S_LQ) and SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9822. begin
  9823. { this becomes a zero extension from 32-bit to 64-bit, but
  9824. the upper 32 bits are already zero, so just delete the
  9825. instruction }
  9826. DebugMsg(SPeepholeOptimization + 'MovzMovsxd2MovzNop', hp1);
  9827. RemoveInstruction(hp1);
  9828. Result := True;
  9829. Exit;
  9830. end
  9831. else
  9832. {$endif x86_64}
  9833. begin
  9834. DebugMsg(SPeepholeOptimization + 'MovzMovs2MovzMovz', hp1);
  9835. taicpu(hp1).opcode := A_MOVZX;
  9836. {$ifdef x86_64}
  9837. case taicpu(hp1).opsize of
  9838. S_BQ:
  9839. begin
  9840. taicpu(hp1).opsize := S_BL;
  9841. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  9842. end;
  9843. S_WQ:
  9844. begin
  9845. taicpu(hp1).opsize := S_WL;
  9846. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  9847. end;
  9848. S_LQ:
  9849. begin
  9850. taicpu(hp1).opcode := A_MOV;
  9851. taicpu(hp1).opsize := S_L;
  9852. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  9853. { In this instance, we need to break out because the
  9854. instruction is no longer MOVZX or MOVSXD }
  9855. Result := True;
  9856. Exit;
  9857. end;
  9858. else
  9859. ;
  9860. end;
  9861. {$endif x86_64}
  9862. Result := CompressInstructions;
  9863. Exit;
  9864. end;
  9865. end;
  9866. A_MOVZX:
  9867. begin
  9868. if UpperUnsignedOverflow or (taicpu(hp1).oper[0]^.typ <> top_reg) then
  9869. Break;
  9870. if (InstrMax = -1) then
  9871. begin
  9872. if SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, ThisReg) then
  9873. begin
  9874. { Optimise around i40003 }
  9875. if SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) and
  9876. (taicpu(p).opsize = S_WL) and (taicpu(hp1).opsize = S_BL)
  9877. {$ifndef x86_64}
  9878. and (
  9879. (taicpu(p).oper[0]^.typ <> top_reg) or
  9880. { Cannot encode byte-sized ESI, EDI, EBP or ESP under i386 }
  9881. (GetSupReg(taicpu(p).oper[0]^.reg) in [RS_EAX, RS_EBX, RS_ECX, RS_EDX])
  9882. )
  9883. {$endif not x86_64}
  9884. then
  9885. begin
  9886. if (taicpu(p).oper[0]^.typ = top_reg) then
  9887. setsubreg(taicpu(p).oper[0]^.reg, R_SUBL);
  9888. DebugMsg(SPeepholeOptimization + 'movzwl2movzbl 1', p);
  9889. taicpu(p).opsize := S_BL;
  9890. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 2a', hp1);
  9891. RemoveInstruction(hp1);
  9892. Result := True;
  9893. Exit;
  9894. end;
  9895. end
  9896. else
  9897. begin
  9898. { Will return false if the second parameter isn't ThisReg
  9899. (can happen on -O2 and under) }
  9900. if Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9901. begin
  9902. { The two MOVZX instructions are adjacent, so remove the first one }
  9903. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 5', p);
  9904. RemoveCurrentP(p);
  9905. Result := True;
  9906. Exit;
  9907. end;
  9908. Break;
  9909. end;
  9910. end;
  9911. Result := CompressInstructions;
  9912. Exit;
  9913. end;
  9914. else
  9915. { This includes ADC, SBB and IDIV }
  9916. Break;
  9917. end;
  9918. if not CheckOverflowConditions then
  9919. Break;
  9920. { Contains highest index (so instruction count - 1) }
  9921. Inc(InstrMax);
  9922. if InstrMax > High(InstrList) then
  9923. SetLength(InstrList, InstrMax + LIST_STEP_SIZE);
  9924. InstrList[InstrMax] := taicpu(hp1);
  9925. end;
  9926. end;
  9927. {$pop}
  9928. function TX86AsmOptimizer.OptPass2Imul(var p : tai) : boolean;
  9929. var
  9930. hp1 : tai;
  9931. begin
  9932. Result:=false;
  9933. if (taicpu(p).ops >= 2) and
  9934. ((taicpu(p).oper[0]^.typ = top_const) or
  9935. ((taicpu(p).oper[0]^.typ = top_ref) and (taicpu(p).oper[0]^.ref^.refaddr=addr_full))) and
  9936. (taicpu(p).oper[1]^.typ = top_reg) and
  9937. ((taicpu(p).ops = 2) or
  9938. ((taicpu(p).oper[2]^.typ = top_reg) and
  9939. (taicpu(p).oper[2]^.reg = taicpu(p).oper[1]^.reg))) and
  9940. GetLastInstruction(p,hp1) and
  9941. MatchInstruction(hp1,A_MOV,[]) and
  9942. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  9943. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  9944. begin
  9945. TransferUsedRegs(TmpUsedRegs);
  9946. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,p,TmpUsedRegs)) or
  9947. ((taicpu(p).ops = 3) and (taicpu(p).oper[1]^.reg=taicpu(p).oper[2]^.reg)) then
  9948. { change
  9949. mov reg1,reg2
  9950. imul y,reg2 to imul y,reg1,reg2 }
  9951. begin
  9952. taicpu(p).ops := 3;
  9953. taicpu(p).loadreg(2,taicpu(p).oper[1]^.reg);
  9954. taicpu(p).loadreg(1,taicpu(hp1).oper[0]^.reg);
  9955. DebugMsg(SPeepholeOptimization + 'MovImul2Imul done',p);
  9956. RemoveInstruction(hp1);
  9957. result:=true;
  9958. end;
  9959. end;
  9960. end;
  9961. procedure TX86AsmOptimizer.ConvertJumpToRET(const p: tai; const ret_p: tai);
  9962. var
  9963. ThisLabel: TAsmLabel;
  9964. begin
  9965. ThisLabel := tasmlabel(taicpu(p).oper[0]^.ref^.symbol);
  9966. ThisLabel.decrefs;
  9967. taicpu(p).condition := C_None;
  9968. taicpu(p).opcode := A_RET;
  9969. taicpu(p).is_jmp := false;
  9970. taicpu(p).ops := taicpu(ret_p).ops;
  9971. case taicpu(ret_p).ops of
  9972. 0:
  9973. taicpu(p).clearop(0);
  9974. 1:
  9975. taicpu(p).loadconst(0,taicpu(ret_p).oper[0]^.val);
  9976. else
  9977. internalerror(2016041301);
  9978. end;
  9979. { If the original label is now dead, it might turn out that the label
  9980. immediately follows p. As a result, everything beyond it, which will
  9981. be just some final register configuration and a RET instruction, is
  9982. now dead code. [Kit] }
  9983. { NOTE: This is much faster than introducing a OptPass2RET routine and
  9984. running RemoveDeadCodeAfterJump for each RET instruction, because
  9985. this optimisation rarely happens and most RETs appear at the end of
  9986. routines where there is nothing that can be stripped. [Kit] }
  9987. if not ThisLabel.is_used then
  9988. RemoveDeadCodeAfterJump(p);
  9989. end;
  9990. function TX86AsmOptimizer.OptPass2SETcc(var p: tai): boolean;
  9991. var
  9992. hp1,hp2,next: tai; SetC, JumpC: TAsmCond;
  9993. Unconditional, PotentialModified: Boolean;
  9994. OperPtr: POper;
  9995. NewRef: TReference;
  9996. InstrList: array of taicpu;
  9997. InstrMax, Index: Integer;
  9998. const
  9999. {$ifdef DEBUG_AOPTCPU}
  10000. SNoFlags: shortstring = ' so the flags aren''t modified';
  10001. {$else DEBUG_AOPTCPU}
  10002. SNoFlags = '';
  10003. {$endif DEBUG_AOPTCPU}
  10004. begin
  10005. Result:=false;
  10006. if MatchOpType(taicpu(p),top_reg) and GetNextInstructionUsingReg(p, hp1, taicpu(p).oper[0]^.reg) then
  10007. begin
  10008. if MatchInstruction(hp1, A_TEST, [S_B]) and
  10009. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  10010. (taicpu(hp1).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) and
  10011. (taicpu(p).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) and
  10012. GetNextInstruction(hp1, hp2) and
  10013. MatchInstruction(hp2, A_Jcc, A_SETcc, []) then
  10014. { Change from: To:
  10015. set(C) %reg j(~C) label
  10016. test %reg,%reg/cmp $0,%reg
  10017. je label
  10018. set(C) %reg j(C) label
  10019. test %reg,%reg/cmp $0,%reg
  10020. jne label
  10021. (Also do something similar with sete/setne instead of je/jne)
  10022. }
  10023. begin
  10024. { Before we do anything else, we need to check the instructions
  10025. in between SETcc and TEST to make sure they don't modify the
  10026. FLAGS register - if -O2 or under, there won't be any
  10027. instructions between SET and TEST }
  10028. TransferUsedRegs(TmpUsedRegs);
  10029. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  10030. if (cs_opt_level3 in current_settings.optimizerswitches) then
  10031. begin
  10032. next := p;
  10033. SetLength(InstrList, 0);
  10034. InstrMax := -1;
  10035. PotentialModified := False;
  10036. { Make a note of every instruction that modifies the FLAGS
  10037. register }
  10038. while GetNextInstruction(next, next) and (next <> hp1) do
  10039. begin
  10040. if next.typ <> ait_instruction then
  10041. { GetNextInstructionUsingReg should have returned False }
  10042. InternalError(2021051701);
  10043. if RegModifiedByInstruction(NR_DEFAULTFLAGS, next) then
  10044. begin
  10045. case taicpu(next).opcode of
  10046. A_SETcc,
  10047. A_CMOVcc,
  10048. A_Jcc:
  10049. begin
  10050. if PotentialModified then
  10051. { Not safe because the flags were modified earlier }
  10052. Exit
  10053. else
  10054. { Condition is the same as the initial SETcc, so this is safe
  10055. (don't add to instruction list though) }
  10056. Continue;
  10057. end;
  10058. A_ADD:
  10059. begin
  10060. if (taicpu(next).opsize = S_B) or
  10061. { LEA doesn't support 8-bit operands }
  10062. (taicpu(next).oper[1]^.typ <> top_reg) or
  10063. { Must write to a register }
  10064. (taicpu(next).oper[0]^.typ = top_ref) then
  10065. { Require a constant or a register }
  10066. Exit;
  10067. PotentialModified := True;
  10068. end;
  10069. A_SUB:
  10070. begin
  10071. if (taicpu(next).opsize = S_B) or
  10072. { LEA doesn't support 8-bit operands }
  10073. (taicpu(next).oper[1]^.typ <> top_reg) or
  10074. { Must write to a register }
  10075. (taicpu(next).oper[0]^.typ <> top_const) or
  10076. (taicpu(next).oper[0]^.val = $80000000) then
  10077. { Can't subtract a register with LEA - also
  10078. check that the value isn't -2^31, as this
  10079. can't be negated }
  10080. Exit;
  10081. PotentialModified := True;
  10082. end;
  10083. A_SAL,
  10084. A_SHL:
  10085. begin
  10086. if (taicpu(next).opsize = S_B) or
  10087. { LEA doesn't support 8-bit operands }
  10088. (taicpu(next).oper[1]^.typ <> top_reg) or
  10089. { Must write to a register }
  10090. (taicpu(next).oper[0]^.typ <> top_const) or
  10091. (taicpu(next).oper[0]^.val < 0) or
  10092. (taicpu(next).oper[0]^.val > 3) then
  10093. Exit;
  10094. PotentialModified := True;
  10095. end;
  10096. A_IMUL:
  10097. begin
  10098. if (taicpu(next).ops <> 3) or
  10099. (taicpu(next).oper[1]^.typ <> top_reg) or
  10100. { Must write to a register }
  10101. (taicpu(next).oper[2]^.val in [2,3,4,5,8,9]) then
  10102. { We can convert "imul x,%reg1,%reg2" (where x = 2, 4 or 8)
  10103. to "lea (%reg1,x),%reg2". If x = 3, 5 or 9, we can
  10104. change this to "lea (%reg1,%reg1,(x-1)),%reg2" }
  10105. Exit
  10106. else
  10107. PotentialModified := True;
  10108. end;
  10109. else
  10110. { Don't know how to change this, so abort }
  10111. Exit;
  10112. end;
  10113. { Contains highest index (so instruction count - 1) }
  10114. Inc(InstrMax);
  10115. if InstrMax > High(InstrList) then
  10116. SetLength(InstrList, InstrMax + LIST_STEP_SIZE);
  10117. InstrList[InstrMax] := taicpu(next);
  10118. end;
  10119. UpdateUsedRegs(TmpUsedRegs, tai(next.next));
  10120. end;
  10121. if not Assigned(next) or (next <> hp1) then
  10122. { It should be equal to hp1 }
  10123. InternalError(2021051702);
  10124. { Cycle through each instruction and check to see if we can
  10125. change them to versions that don't modify the flags }
  10126. if (InstrMax >= 0) then
  10127. begin
  10128. for Index := 0 to InstrMax do
  10129. case InstrList[Index].opcode of
  10130. A_ADD:
  10131. begin
  10132. DebugMsg(SPeepholeOptimization + 'ADD -> LEA' + SNoFlags, InstrList[Index]);
  10133. InstrList[Index].opcode := A_LEA;
  10134. reference_reset(NewRef, 1, []);
  10135. NewRef.base := InstrList[Index].oper[1]^.reg;
  10136. if InstrList[Index].oper[0]^.typ = top_reg then
  10137. begin
  10138. NewRef.index := InstrList[Index].oper[0]^.reg;
  10139. NewRef.scalefactor := 1;
  10140. end
  10141. else
  10142. NewRef.offset := InstrList[Index].oper[0]^.val;
  10143. InstrList[Index].loadref(0, NewRef);
  10144. end;
  10145. A_SUB:
  10146. begin
  10147. DebugMsg(SPeepholeOptimization + 'SUB -> LEA' + SNoFlags, InstrList[Index]);
  10148. InstrList[Index].opcode := A_LEA;
  10149. reference_reset(NewRef, 1, []);
  10150. NewRef.base := InstrList[Index].oper[1]^.reg;
  10151. NewRef.offset := -InstrList[Index].oper[0]^.val;
  10152. InstrList[Index].loadref(0, NewRef);
  10153. end;
  10154. A_SHL,
  10155. A_SAL:
  10156. begin
  10157. DebugMsg(SPeepholeOptimization + 'SHL -> LEA' + SNoFlags, InstrList[Index]);
  10158. InstrList[Index].opcode := A_LEA;
  10159. reference_reset(NewRef, 1, []);
  10160. NewRef.index := InstrList[Index].oper[1]^.reg;
  10161. NewRef.scalefactor := 1 shl (InstrList[Index].oper[0]^.val);
  10162. InstrList[Index].loadref(0, NewRef);
  10163. end;
  10164. A_IMUL:
  10165. begin
  10166. DebugMsg(SPeepholeOptimization + 'IMUL -> LEA' + SNoFlags, InstrList[Index]);
  10167. InstrList[Index].opcode := A_LEA;
  10168. reference_reset(NewRef, 1, []);
  10169. NewRef.index := InstrList[Index].oper[1]^.reg;
  10170. case InstrList[Index].oper[0]^.val of
  10171. 2, 4, 8:
  10172. NewRef.scalefactor := InstrList[Index].oper[0]^.val;
  10173. else {3, 5 and 9}
  10174. begin
  10175. NewRef.scalefactor := InstrList[Index].oper[0]^.val - 1;
  10176. NewRef.base := InstrList[Index].oper[1]^.reg;
  10177. end;
  10178. end;
  10179. InstrList[Index].loadref(0, NewRef);
  10180. end;
  10181. else
  10182. InternalError(2021051710);
  10183. end;
  10184. end;
  10185. { Mark the FLAGS register as used across this whole block }
  10186. AllocRegBetween(NR_DEFAULTFLAGS, p, hp1, UsedRegs);
  10187. end;
  10188. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  10189. JumpC := taicpu(hp2).condition;
  10190. Unconditional := False;
  10191. if conditions_equal(JumpC, C_E) then
  10192. SetC := inverse_cond(taicpu(p).condition)
  10193. else if conditions_equal(JumpC, C_NE) then
  10194. SetC := taicpu(p).condition
  10195. else
  10196. { We've got something weird here (and inefficent) }
  10197. begin
  10198. DebugMsg('DEBUG: Inefficient jump - check code generation', p);
  10199. SetC := C_NONE;
  10200. { JAE/JNB will always branch (use 'condition_in', since C_AE <> C_NB normally) }
  10201. if condition_in(C_AE, JumpC) then
  10202. Unconditional := True
  10203. else
  10204. { Not sure what to do with this jump - drop out }
  10205. Exit;
  10206. end;
  10207. RemoveInstruction(hp1);
  10208. if Unconditional then
  10209. MakeUnconditional(taicpu(hp2))
  10210. else
  10211. begin
  10212. if SetC = C_NONE then
  10213. InternalError(2018061402);
  10214. taicpu(hp2).SetCondition(SetC);
  10215. end;
  10216. { as hp2 is a jump, we cannot use RegUsedAfterInstruction but we have to check if it is included in
  10217. TmpUsedRegs }
  10218. if not TmpUsedRegs[getregtype(taicpu(p).oper[0]^.reg)].IsUsed(taicpu(p).oper[0]^.reg) then
  10219. begin
  10220. RemoveCurrentp(p, hp2);
  10221. if taicpu(hp2).opcode = A_SETcc then
  10222. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/SETcc -> SETcc',p)
  10223. else
  10224. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/Jcc -> Jcc',p);
  10225. end
  10226. else
  10227. if taicpu(hp2).opcode = A_SETcc then
  10228. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/SETcc -> SETcc/SETcc',p)
  10229. else
  10230. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/Jcc -> SETcc/Jcc',p);
  10231. Result := True;
  10232. end
  10233. else if
  10234. { Make sure the instructions are adjacent }
  10235. (
  10236. not (cs_opt_level3 in current_settings.optimizerswitches) or
  10237. GetNextInstruction(p, hp1)
  10238. ) and
  10239. MatchInstruction(hp1, A_MOV, [S_B]) and
  10240. { Writing to memory is allowed }
  10241. MatchOperand(taicpu(p).oper[0]^, taicpu(hp1).oper[0]^.reg) then
  10242. begin
  10243. {
  10244. Watch out for sequences such as:
  10245. set(c)b %regb
  10246. movb %regb,(ref)
  10247. movb $0,1(ref)
  10248. movb $0,2(ref)
  10249. movb $0,3(ref)
  10250. Much more efficient to turn it into:
  10251. movl $0,%regl
  10252. set(c)b %regb
  10253. movl %regl,(ref)
  10254. Or:
  10255. set(c)b %regb
  10256. movzbl %regb,%regl
  10257. movl %regl,(ref)
  10258. }
  10259. if (taicpu(hp1).oper[1]^.typ = top_ref) and
  10260. GetNextInstruction(hp1, hp2) and
  10261. MatchInstruction(hp2, A_MOV, [S_B]) and
  10262. (taicpu(hp2).oper[1]^.typ = top_ref) and
  10263. CheckMemoryWrite(taicpu(hp1), taicpu(hp2)) then
  10264. begin
  10265. { Don't do anything else except set Result to True }
  10266. end
  10267. else
  10268. begin
  10269. if taicpu(p).oper[0]^.typ = top_reg then
  10270. begin
  10271. TransferUsedRegs(TmpUsedRegs);
  10272. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  10273. end;
  10274. { If it's not a register, it's a memory address }
  10275. if (taicpu(p).oper[0]^.typ <> top_reg) or RegUsedAfterInstruction(taicpu(p).oper[0]^.reg, hp1, TmpUsedRegs) then
  10276. begin
  10277. { Even if the register is still in use, we can minimise the
  10278. pipeline stall by changing the MOV into another SETcc. }
  10279. taicpu(hp1).opcode := A_SETcc;
  10280. taicpu(hp1).condition := taicpu(p).condition;
  10281. if taicpu(hp1).oper[1]^.typ = top_ref then
  10282. begin
  10283. { Swapping the operand pointers like this is probably a
  10284. bit naughty, but it is far faster than using loadoper
  10285. to transfer the reference from oper[1] to oper[0] if
  10286. you take into account the extra procedure calls and
  10287. the memory allocation and deallocation required }
  10288. OperPtr := taicpu(hp1).oper[1];
  10289. taicpu(hp1).oper[1] := taicpu(hp1).oper[0];
  10290. taicpu(hp1).oper[0] := OperPtr;
  10291. end
  10292. else
  10293. taicpu(hp1).oper[0]^.reg := taicpu(hp1).oper[1]^.reg;
  10294. taicpu(hp1).clearop(1);
  10295. taicpu(hp1).ops := 1;
  10296. DebugMsg(SPeepholeOptimization + 'SETcc/Mov -> SETcc/SETcc',p);
  10297. end
  10298. else
  10299. begin
  10300. if taicpu(hp1).oper[1]^.typ = top_reg then
  10301. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,UsedRegs);
  10302. taicpu(p).loadoper(0, taicpu(hp1).oper[1]^);
  10303. RemoveInstruction(hp1);
  10304. DebugMsg(SPeepholeOptimization + 'SETcc/Mov -> SETcc',p);
  10305. end
  10306. end;
  10307. Result := True;
  10308. end;
  10309. end;
  10310. end;
  10311. function TX86AsmOptimizer.OptPass2Jmp(var p : tai) : boolean;
  10312. var
  10313. hp1: tai;
  10314. Count: Integer;
  10315. OrigLabel: TAsmLabel;
  10316. begin
  10317. result := False;
  10318. { Sometimes, the optimisations below can permit this }
  10319. RemoveDeadCodeAfterJump(p);
  10320. 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
  10321. (taicpu(p).oper[0]^.ref^.index=NR_NO) and (taicpu(p).oper[0]^.ref^.symbol is tasmlabel) then
  10322. begin
  10323. OrigLabel := TAsmLabel(taicpu(p).oper[0]^.ref^.symbol);
  10324. { Also a side-effect of optimisations }
  10325. if CollapseZeroDistJump(p, OrigLabel) then
  10326. begin
  10327. Result := True;
  10328. Exit;
  10329. end;
  10330. hp1 := GetLabelWithSym(OrigLabel);
  10331. if (taicpu(p).condition=C_None) and assigned(hp1) and SkipLabels(hp1,hp1) and (hp1.typ = ait_instruction) then
  10332. begin
  10333. if taicpu(hp1).opcode = A_RET then
  10334. begin
  10335. {
  10336. change
  10337. jmp .L1
  10338. ...
  10339. .L1:
  10340. ret
  10341. into
  10342. ret
  10343. }
  10344. begin
  10345. ConvertJumpToRET(p, hp1);
  10346. result:=true;
  10347. end;
  10348. end
  10349. else if (cs_opt_level3 in current_settings.optimizerswitches) and
  10350. not (cs_opt_size in current_settings.optimizerswitches) and
  10351. CheckJumpMovTransferOpt(p, hp1, 0, Count) then
  10352. begin
  10353. Result := True;
  10354. Exit;
  10355. end;
  10356. end;
  10357. end;
  10358. end;
  10359. class function TX86AsmOptimizer.CanBeCMOV(p, cond_p: tai) : boolean;
  10360. begin
  10361. Result := assigned(p) and
  10362. MatchInstruction(p,A_MOV,[S_W,S_L,S_Q]) and
  10363. (taicpu(p).oper[1]^.typ = top_reg) and
  10364. (
  10365. (taicpu(p).oper[0]^.typ = top_reg) or
  10366. { allow references, but only pure symbols or got rel. addressing with RIP as based,
  10367. it is not expected that this can cause a seg. violation }
  10368. (
  10369. (taicpu(p).oper[0]^.typ = top_ref) and
  10370. { TODO: Can we detect which references become constants at this
  10371. stage so we don't have to do a blanket ban? }
  10372. (taicpu(p).oper[0]^.ref^.refaddr <> addr_full) and
  10373. (
  10374. IsRefSafe(taicpu(p).oper[0]^.ref) or
  10375. (
  10376. { If the reference also appears in the condition, then we know it's safe, otherwise
  10377. any kind of access violation would have occurred already }
  10378. Assigned(cond_p) and
  10379. { Make sure the sizes match too so we're reading and writing the same number of bytes }
  10380. (cond_p.typ = ait_instruction) and
  10381. (taicpu(cond_p).opsize = taicpu(p).opsize) and
  10382. { Just consider 2-operand comparison instructions for now to be safe }
  10383. (taicpu(cond_p).ops = 2) and
  10384. (
  10385. ((taicpu(cond_p).oper[1]^.typ = top_ref) and RefsEqual(taicpu(cond_p).oper[1]^.ref^, taicpu(p).oper[0]^.ref^)) or
  10386. (
  10387. (taicpu(cond_p).oper[0]^.typ = top_ref) and
  10388. { Don't risk identical registers but different offsets, as we may have constructs
  10389. such as buffer streams with things like length fields that indicate whether
  10390. any more data follows. And there are probably some contrived examples where
  10391. writing to offsets behind the one being read also lead to access violations }
  10392. RefsEqual(taicpu(cond_p).oper[0]^.ref^, taicpu(p).oper[0]^.ref^) and
  10393. (
  10394. { Check that we're not modifying a register that appears in the reference }
  10395. (InsProp[taicpu(cond_p).opcode].Ch * [Ch_Mop2, Ch_RWop2, Ch_Wop2] = []) or
  10396. (taicpu(cond_p).oper[1]^.typ <> top_reg) or
  10397. not RegInRef(taicpu(cond_p).oper[1]^.reg, taicpu(cond_p).oper[0]^.ref^)
  10398. )
  10399. )
  10400. )
  10401. )
  10402. )
  10403. )
  10404. );
  10405. end;
  10406. class procedure TX86AsmOptimizer.UpdateIntRegsNoDealloc(var AUsedRegs: TAllUsedRegs; p: Tai);
  10407. begin
  10408. { Update integer registers, ignoring deallocations }
  10409. repeat
  10410. while assigned(p) and
  10411. ((p.typ in (SkipInstr - [ait_RegAlloc])) or
  10412. (p.typ = ait_label) or
  10413. ((p.typ = ait_marker) and
  10414. (tai_Marker(p).Kind in [mark_AsmBlockEnd,mark_NoLineInfoStart,mark_NoLineInfoEnd]))) do
  10415. p := tai(p.next);
  10416. while assigned(p) and
  10417. (p.typ=ait_RegAlloc) Do
  10418. begin
  10419. if (getregtype(tai_regalloc(p).reg) = R_INTREGISTER) then
  10420. begin
  10421. case tai_regalloc(p).ratype of
  10422. ra_alloc :
  10423. IncludeRegInUsedRegs(tai_regalloc(p).reg, AUsedRegs);
  10424. else
  10425. ;
  10426. end;
  10427. end;
  10428. p := tai(p.next);
  10429. end;
  10430. until not(assigned(p)) or
  10431. (not(p.typ in SkipInstr) and
  10432. not((p.typ = ait_label) and
  10433. labelCanBeSkipped(tai_label(p))));
  10434. end;
  10435. function TX86AsmOptimizer.OptPass2Jcc(var p : tai) : boolean;
  10436. var
  10437. hp1,hp2: tai;
  10438. carryadd_opcode : TAsmOp;
  10439. symbol: TAsmSymbol;
  10440. increg, tmpreg: TRegister;
  10441. {$ifndef i8086}
  10442. { Code and variables specific to CMOV optimisations }
  10443. hp3,hp4,hp5,
  10444. hp_stop, hp_lblxxx, hp_lblyyy, hpmov1,hpmov2, hp_prev, hp_flagalloc, hp_prev2, hp_new, hp_jump: tai;
  10445. l, c, w, x : Longint;
  10446. condition, second_condition : TAsmCond;
  10447. FoundMatchingJump, RegMatch: Boolean;
  10448. RegWrites: array[0..MAX_CMOV_INSTRUCTIONS*2 - 1] of TRegister;
  10449. ConstRegs: array[0..MAX_CMOV_REGISTERS - 1] of TRegister;
  10450. ConstVals: array[0..MAX_CMOV_REGISTERS - 1] of TCGInt;
  10451. { Tries to convert a mov const,%reg instruction into a CMOV by reserving a
  10452. new register to store the constant }
  10453. function TryCMOVConst(p, search_start_p, stop_search_p: tai; var StoredCount: LongInt; var CMOVCount: LongInt): Boolean;
  10454. var
  10455. RegSize: TSubRegister;
  10456. CurrentVal: TCGInt;
  10457. NewReg: TRegister;
  10458. X: ShortInt;
  10459. begin
  10460. Result := False;
  10461. if not MatchOpType(taicpu(p), top_const, top_reg) then
  10462. Exit;
  10463. if StoredCount >= MAX_CMOV_REGISTERS then
  10464. { Arrays are full }
  10465. Exit;
  10466. { Remember that CMOV can't encode 8-bit registers }
  10467. case taicpu(p).opsize of
  10468. S_W:
  10469. RegSize := R_SUBW;
  10470. S_L:
  10471. RegSize := R_SUBD;
  10472. S_Q:
  10473. RegSize := R_SUBQ;
  10474. else
  10475. InternalError(2021100401);
  10476. end;
  10477. { See if the value has already been reserved for another CMOV instruction }
  10478. CurrentVal := taicpu(p).oper[0]^.val;
  10479. for X := 0 to StoredCount - 1 do
  10480. if ConstVals[X] = CurrentVal then
  10481. begin
  10482. ConstRegs[StoredCount] := ConstRegs[X];
  10483. ConstVals[StoredCount] := CurrentVal;
  10484. Result := True;
  10485. Inc(StoredCount);
  10486. { Don't increase CMOVCount this time, since we're re-using a register }
  10487. Exit;
  10488. end;
  10489. NewReg := GetIntRegisterBetween(RegSize, TmpUsedRegs, search_start_p, stop_search_p, True);
  10490. if NewReg = NR_NO then
  10491. { No free registers }
  10492. Exit;
  10493. { Reserve the register so subsequent TryCMOVConst calls don't all end
  10494. up vying for the same register }
  10495. IncludeRegInUsedRegs(NewReg, TmpUsedRegs);
  10496. ConstRegs[StoredCount] := NewReg;
  10497. ConstVals[StoredCount] := CurrentVal;
  10498. Inc(StoredCount);
  10499. { Increment the CMOV count variable from OptPass2JCC, since the extra
  10500. MOV required adds complexity and will cause diminishing returns
  10501. sooner than normal. This is more of an approximate weighting than
  10502. anything else. }
  10503. Inc(CMOVCount);
  10504. Result := True;
  10505. end;
  10506. {$endif i8086}
  10507. begin
  10508. result:=false;
  10509. if GetNextInstruction(p,hp1) then
  10510. begin
  10511. if (hp1.typ=ait_label) then
  10512. begin
  10513. Result := DoSETccLblRETOpt(p, tai_label(hp1));
  10514. Exit;
  10515. end
  10516. else if (hp1.typ<>ait_instruction) then
  10517. Exit;
  10518. symbol := TAsmLabel(taicpu(p).oper[0]^.ref^.symbol);
  10519. if (
  10520. (
  10521. ((Taicpu(hp1).opcode=A_ADD) or (Taicpu(hp1).opcode=A_SUB)) and
  10522. MatchOptype(Taicpu(hp1),top_const,top_reg) and
  10523. (Taicpu(hp1).oper[0]^.val=1)
  10524. ) or
  10525. ((Taicpu(hp1).opcode=A_INC) or (Taicpu(hp1).opcode=A_DEC))
  10526. ) and
  10527. GetNextInstruction(hp1,hp2) and
  10528. SkipAligns(hp2, hp2) and
  10529. (hp2.typ = ait_label) and
  10530. (Tasmlabel(symbol) = Tai_label(hp2).labsym) then
  10531. { jb @@1 cmc
  10532. inc/dec operand --> adc/sbb operand,0
  10533. @@1:
  10534. ... and ...
  10535. jnb @@1
  10536. inc/dec operand --> adc/sbb operand,0
  10537. @@1: }
  10538. begin
  10539. if Taicpu(p).condition in [C_NAE,C_B,C_C] then
  10540. begin
  10541. case taicpu(hp1).opcode of
  10542. A_INC,
  10543. A_ADD:
  10544. carryadd_opcode:=A_ADC;
  10545. A_DEC,
  10546. A_SUB:
  10547. carryadd_opcode:=A_SBB;
  10548. else
  10549. InternalError(2021011001);
  10550. end;
  10551. Taicpu(p).clearop(0);
  10552. Taicpu(p).ops:=0;
  10553. Taicpu(p).is_jmp:=false;
  10554. Taicpu(p).opcode:=A_CMC;
  10555. Taicpu(p).condition:=C_NONE;
  10556. DebugMsg(SPeepholeOptimization+'JccAdd/Inc/Dec2CmcAdc/Sbb',p);
  10557. Taicpu(hp1).ops:=2;
  10558. if (Taicpu(hp1).opcode=A_ADD) or (Taicpu(hp1).opcode=A_SUB) then
  10559. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[1]^)
  10560. else
  10561. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[0]^);
  10562. Taicpu(hp1).loadconst(0,0);
  10563. Taicpu(hp1).opcode:=carryadd_opcode;
  10564. result:=true;
  10565. exit;
  10566. end
  10567. else if Taicpu(p).condition in [C_AE,C_NB,C_NC] then
  10568. begin
  10569. case taicpu(hp1).opcode of
  10570. A_INC,
  10571. A_ADD:
  10572. carryadd_opcode:=A_ADC;
  10573. A_DEC,
  10574. A_SUB:
  10575. carryadd_opcode:=A_SBB;
  10576. else
  10577. InternalError(2021011002);
  10578. end;
  10579. Taicpu(hp1).ops:=2;
  10580. DebugMsg(SPeepholeOptimization+'JccAdd/Inc/Dec2Adc/Sbb',p);
  10581. if (Taicpu(hp1).opcode=A_ADD) or (Taicpu(hp1).opcode=A_SUB) then
  10582. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[1]^)
  10583. else
  10584. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[0]^);
  10585. Taicpu(hp1).loadconst(0,0);
  10586. Taicpu(hp1).opcode:=carryadd_opcode;
  10587. RemoveCurrentP(p, hp1);
  10588. result:=true;
  10589. exit;
  10590. end
  10591. {
  10592. jcc @@1 setcc tmpreg
  10593. inc/dec/add/sub operand -> (movzx tmpreg)
  10594. @@1: add/sub tmpreg,operand
  10595. While this increases code size slightly, it makes the code much faster if the
  10596. jump is unpredictable
  10597. }
  10598. else if not(cs_opt_size in current_settings.optimizerswitches) then
  10599. begin
  10600. { search for an available register which is volatile }
  10601. increg := GetIntRegisterBetween(R_SUBL, UsedRegs, p, hp1);
  10602. if increg <> NR_NO then
  10603. begin
  10604. { We don't need to check if tmpreg is in hp1 or not, because
  10605. it will be marked as in use at p (if not, this is
  10606. indictive of a compiler bug). }
  10607. TAsmLabel(symbol).decrefs;
  10608. Taicpu(p).clearop(0);
  10609. Taicpu(p).ops:=1;
  10610. Taicpu(p).is_jmp:=false;
  10611. Taicpu(p).opcode:=A_SETcc;
  10612. DebugMsg(SPeepholeOptimization+'JccAdd2SetccAdd',p);
  10613. Taicpu(p).condition:=inverse_cond(Taicpu(p).condition);
  10614. Taicpu(p).loadreg(0,increg);
  10615. if getsubreg(Taicpu(hp1).oper[1]^.reg)<>R_SUBL then
  10616. begin
  10617. case getsubreg(Taicpu(hp1).oper[1]^.reg) of
  10618. R_SUBW:
  10619. begin
  10620. tmpreg := newreg(R_INTREGISTER,getsupreg(increg),R_SUBW);
  10621. hp2:=Taicpu.op_reg_reg(A_MOVZX,S_BW,increg,tmpreg);
  10622. end;
  10623. R_SUBD:
  10624. begin
  10625. tmpreg := newreg(R_INTREGISTER,getsupreg(increg),R_SUBD);
  10626. hp2:=Taicpu.op_reg_reg(A_MOVZX,S_BL,increg,tmpreg);
  10627. end;
  10628. {$ifdef x86_64}
  10629. R_SUBQ:
  10630. begin
  10631. { MOVZX doesn't have a 64-bit variant, because
  10632. the 32-bit version implicitly zeroes the
  10633. upper 32-bits of the destination register }
  10634. tmpreg := newreg(R_INTREGISTER,getsupreg(increg),R_SUBD);
  10635. hp2:=Taicpu.op_reg_reg(A_MOVZX,S_BL,increg,tmpreg);
  10636. setsubreg(tmpreg, R_SUBQ);
  10637. end;
  10638. {$endif x86_64}
  10639. else
  10640. Internalerror(2020030601);
  10641. end;
  10642. taicpu(hp2).fileinfo:=taicpu(hp1).fileinfo;
  10643. asml.InsertAfter(hp2,p);
  10644. end
  10645. else
  10646. tmpreg := increg;
  10647. if (Taicpu(hp1).opcode=A_INC) or (Taicpu(hp1).opcode=A_DEC) then
  10648. begin
  10649. Taicpu(hp1).ops:=2;
  10650. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[0]^)
  10651. end;
  10652. Taicpu(hp1).loadreg(0,tmpreg);
  10653. AllocRegBetween(tmpreg,p,hp1,UsedRegs);
  10654. Result := True;
  10655. { p is no longer a Jcc instruction, so exit }
  10656. Exit;
  10657. end;
  10658. end;
  10659. end;
  10660. { Detect the following:
  10661. jmp<cond> @Lbl1
  10662. jmp @Lbl2
  10663. ...
  10664. @Lbl1:
  10665. ret
  10666. Change to:
  10667. jmp<inv_cond> @Lbl2
  10668. ret
  10669. }
  10670. if MatchInstruction(hp1,A_JMP,[]) and (taicpu(hp1).oper[0]^.ref^.refaddr=addr_full) then
  10671. begin
  10672. hp2:=getlabelwithsym(TAsmLabel(symbol));
  10673. if Assigned(hp2) and SkipLabels(hp2,hp2) and
  10674. MatchInstruction(hp2,A_RET,[S_NO]) then
  10675. begin
  10676. taicpu(p).condition := inverse_cond(taicpu(p).condition);
  10677. { Change label address to that of the unconditional jump }
  10678. taicpu(p).loadoper(0, taicpu(hp1).oper[0]^);
  10679. TAsmLabel(symbol).DecRefs;
  10680. taicpu(hp1).opcode := A_RET;
  10681. taicpu(hp1).is_jmp := false;
  10682. taicpu(hp1).ops := taicpu(hp2).ops;
  10683. DebugMsg(SPeepholeOptimization+'JccJmpRet2J!ccRet',p);
  10684. case taicpu(hp2).ops of
  10685. 0:
  10686. taicpu(hp1).clearop(0);
  10687. 1:
  10688. taicpu(hp1).loadconst(0,taicpu(hp2).oper[0]^.val);
  10689. else
  10690. internalerror(2016041302);
  10691. end;
  10692. end;
  10693. {$ifndef i8086}
  10694. end
  10695. {
  10696. convert
  10697. j<c> .L1
  10698. mov 1,reg
  10699. jmp .L2
  10700. .L1
  10701. mov 0,reg
  10702. .L2
  10703. into
  10704. mov 0,reg
  10705. set<not(c)> reg
  10706. take care of alignment and that the mov 0,reg is not converted into a xor as this
  10707. would destroy the flag contents
  10708. }
  10709. else if MatchInstruction(hp1,A_MOV,[]) and
  10710. MatchOpType(taicpu(hp1),top_const,top_reg) and
  10711. {$ifdef i386}
  10712. (
  10713. { Under i386, ESI, EDI, EBP and ESP
  10714. don't have an 8-bit representation }
  10715. not (getsupreg(taicpu(hp1).oper[1]^.reg) in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  10716. ) and
  10717. {$endif i386}
  10718. (taicpu(hp1).oper[0]^.val=1) and
  10719. GetNextInstruction(hp1,hp2) and
  10720. MatchInstruction(hp2,A_JMP,[]) and (taicpu(hp2).oper[0]^.ref^.refaddr=addr_full) and
  10721. GetNextInstruction(hp2,hp3) and
  10722. { skip align }
  10723. ((hp3.typ<>ait_align) or GetNextInstruction(hp3,hp3)) and
  10724. (hp3.typ=ait_label) and
  10725. (tasmlabel(taicpu(p).oper[0]^.ref^.symbol)=tai_label(hp3).labsym) and
  10726. (tai_label(hp3).labsym.getrefs=1) and
  10727. GetNextInstruction(hp3,hp4) and
  10728. MatchInstruction(hp4,A_MOV,[]) and
  10729. MatchOpType(taicpu(hp4),top_const,top_reg) and
  10730. (taicpu(hp4).oper[0]^.val=0) and
  10731. MatchOperand(taicpu(hp1).oper[1]^,taicpu(hp4).oper[1]^) and
  10732. GetNextInstruction(hp4,hp5) and
  10733. (hp5.typ=ait_label) and
  10734. (tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol)=tai_label(hp5).labsym) and
  10735. (tai_label(hp5).labsym.getrefs=1) then
  10736. begin
  10737. AllocRegBetween(NR_FLAGS,p,hp4,UsedRegs);
  10738. DebugMsg(SPeepholeOptimization+'JccMovJmpMov2MovSetcc',p);
  10739. { remove last label }
  10740. RemoveInstruction(hp5);
  10741. { remove second label }
  10742. RemoveInstruction(hp3);
  10743. { if align is present remove it }
  10744. if GetNextInstruction(hp2,hp3) and (hp3.typ=ait_align) then
  10745. RemoveInstruction(hp3);
  10746. { remove jmp }
  10747. RemoveInstruction(hp2);
  10748. if taicpu(hp1).opsize=S_B then
  10749. RemoveInstruction(hp1)
  10750. else
  10751. taicpu(hp1).loadconst(0,0);
  10752. taicpu(hp4).opcode:=A_SETcc;
  10753. taicpu(hp4).opsize:=S_B;
  10754. taicpu(hp4).condition:=inverse_cond(taicpu(p).condition);
  10755. taicpu(hp4).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(hp4).oper[1]^.reg),R_SUBL));
  10756. taicpu(hp4).opercnt:=1;
  10757. taicpu(hp4).ops:=1;
  10758. taicpu(hp4).freeop(1);
  10759. RemoveCurrentP(p);
  10760. Result:=true;
  10761. exit;
  10762. end
  10763. else if (CPUX86_HAS_CMOV in cpu_capabilities[current_settings.optimizecputype]) and
  10764. MatchInstruction(hp1,A_MOV,[S_W,S_L{$ifdef x86_64},S_Q{$endif x86_64}]) then
  10765. begin
  10766. { check for
  10767. jCC xxx
  10768. <several movs>
  10769. xxx:
  10770. Also spot:
  10771. Jcc xxx
  10772. <several movs>
  10773. jmp xxx
  10774. Change to:
  10775. <several cmovs with inverted condition>
  10776. jmp xxx (only for the 2nd case)
  10777. }
  10778. hp2 := p;
  10779. hp_lblxxx := hp1;
  10780. hp_flagalloc := nil;
  10781. hp_stop := nil;
  10782. FoundMatchingJump := False;
  10783. { Remember the first instruction in the first block of MOVs }
  10784. hpmov1 := hp1;
  10785. TransferUsedRegs(TmpUsedRegs);
  10786. while assigned(hp_lblxxx) and
  10787. { stop on labels }
  10788. (hp_lblxxx.typ <> ait_label) do
  10789. begin
  10790. { Keep track of all integer registers that are used }
  10791. UpdateIntRegsNoDealloc(TmpUsedRegs, tai(hp2.Next));
  10792. if hp_lblxxx.typ = ait_instruction then
  10793. begin
  10794. if (taicpu(hp_lblxxx).opcode = A_JMP) and
  10795. IsJumpToLabel(taicpu(hp_lblxxx)) then
  10796. begin
  10797. hp_stop := hp_lblxxx;
  10798. if (TAsmLabel(taicpu(hp_lblxxx).oper[0]^.ref^.symbol) = symbol) then
  10799. begin
  10800. { We found Jcc xxx; <several movs>; Jmp xxx }
  10801. FoundMatchingJump := True;
  10802. Break;
  10803. end;
  10804. { If it's not the jump we're looking for, it's
  10805. possibly the "if..else" variant }
  10806. end
  10807. { Check to see if we have a valid MOV instruction instead }
  10808. else if (taicpu(hp_lblxxx).opcode <> A_MOV) or
  10809. not (taicpu(hp_lblxxx).opsize in [S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  10810. Break
  10811. else
  10812. { This will be a valid MOV }
  10813. hp_stop := hp_lblxxx;
  10814. end;
  10815. hp2 := hp_lblxxx;
  10816. GetNextInstruction(hp_lblxxx, hp_lblxxx);
  10817. end;
  10818. { Just make sure the last MOV is included if there's no jump }
  10819. if (hp_lblxxx.typ = ait_label) and MatchInstruction(hp_stop, A_MOV, []) then
  10820. hp_stop := hp_lblxxx;
  10821. { Note, the logic behind using hp_stop over hp_lblxxx in the
  10822. range for TryCMOVConst is so GetIntRegisterBetween doesn't
  10823. fail when it reaches a JMP instruction in the "jcc xxx; movs;
  10824. jmp yyy; xxx:; movs; yyy:" variation }
  10825. if assigned(hp_lblxxx) and
  10826. (
  10827. { If we found JMP xxx, we don't actually need a label
  10828. (hp_lblxxx is the JMP instruction instead) }
  10829. FoundMatchingJump or
  10830. { Make sure we actually have the right label }
  10831. FindLabel(TAsmLabel(symbol), hp_lblxxx)
  10832. ) then
  10833. begin
  10834. { Use TmpUsedRegs to track registers that we reserve }
  10835. { When allocating temporary registers, try to look one
  10836. instruction back, as defining them before a CMP or TEST
  10837. instruction will be faster, and also avoid picking a
  10838. register that was only just deallocated }
  10839. if GetLastInstruction(p, hp_prev) and
  10840. 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
  10841. begin
  10842. { Mark all the registers in the comparison as 'in use', even if they've just been deallocated }
  10843. for l := 0 to 1 do
  10844. with taicpu(hp_prev).oper[l]^ do
  10845. case typ of
  10846. top_reg:
  10847. if getregtype(reg) = R_INTREGISTER then
  10848. IncludeRegInUsedRegs(reg, TmpUsedRegs);
  10849. top_ref:
  10850. begin
  10851. if
  10852. {$ifdef x86_64}
  10853. (ref^.base <> NR_RIP) and
  10854. {$endif x86_64}
  10855. (ref^.base <> NR_NO) then
  10856. IncludeRegInUsedRegs(ref^.base, TmpUsedRegs);
  10857. if (ref^.index <> NR_NO) then
  10858. IncludeRegInUsedRegs(ref^.index, TmpUsedRegs);
  10859. end
  10860. else
  10861. ;
  10862. end;
  10863. { When inserting instructions before hp_prev, try to insert
  10864. them before the allocation of the FLAGS register }
  10865. if not SetAndTest(FindRegAllocBackward(NR_DEFAULTFLAGS, tai(hp_prev.Previous)), hp_flagalloc) then
  10866. { If not found, set it equal to hp_prev so it's something sensible }
  10867. hp_flagalloc := hp_prev;
  10868. hp_prev2 := nil;
  10869. { When dealing with a comparison against zero, take
  10870. note of the instruction before it to see if we can
  10871. move instructions further back in order to benefit
  10872. PostPeepholeOptTestOr.
  10873. }
  10874. if (
  10875. (
  10876. (taicpu(hp_prev).opcode = A_CMP) and
  10877. MatchOperand(taicpu(hp_prev).oper[0]^, 0)
  10878. ) or
  10879. (
  10880. (taicpu(hp_prev).opcode = A_TEST) and
  10881. (
  10882. OpsEqual(taicpu(hp_prev).oper[0]^, taicpu(hp_prev).oper[1]^) or
  10883. MatchOperand(taicpu(hp_prev).oper[0]^, -1)
  10884. )
  10885. )
  10886. ) and
  10887. GetLastInstruction(hp_prev, hp_prev2) then
  10888. begin
  10889. if (hp_prev2.typ = ait_instruction) and
  10890. { These instructions set the zero flag if the result is zero }
  10891. MatchInstruction(hp_prev2, [A_ADD, A_SUB, A_OR, A_XOR, A_AND, A_POPCNT, A_LZCNT], []) then
  10892. begin
  10893. { Also mark all the registers in this previous instruction
  10894. as 'in use', even if they've just been deallocated }
  10895. for l := 0 to 1 do
  10896. with taicpu(hp_prev2).oper[l]^ do
  10897. case typ of
  10898. top_reg:
  10899. if getregtype(reg) = R_INTREGISTER then
  10900. IncludeRegInUsedRegs(reg, TmpUsedRegs);
  10901. top_ref:
  10902. begin
  10903. if
  10904. {$ifdef x86_64}
  10905. (ref^.base <> NR_RIP) and
  10906. {$endif x86_64}
  10907. (ref^.base <> NR_NO) then
  10908. IncludeRegInUsedRegs(ref^.base, TmpUsedRegs);
  10909. if (ref^.index <> NR_NO) then
  10910. IncludeRegInUsedRegs(ref^.index, TmpUsedRegs);
  10911. end
  10912. else
  10913. ;
  10914. end;
  10915. end
  10916. else
  10917. { Unsuitable instruction }
  10918. hp_prev2 := nil;
  10919. end;
  10920. end
  10921. else
  10922. begin
  10923. hp_prev := p;
  10924. { When inserting instructions before hp_prev, try to insert
  10925. them before the allocation of the FLAGS register }
  10926. if not SetAndTest(FindRegAllocBackward(NR_DEFAULTFLAGS, tai(p.Previous)), hp_flagalloc) then
  10927. { If not found, set it equal to p so it's something sensible }
  10928. hp_flagalloc := p;
  10929. hp_prev2 := nil;
  10930. end;
  10931. l := 0;
  10932. c := 0;
  10933. { Initialise RegWrites, ConstRegs and ConstVals }
  10934. FillChar(RegWrites[0], MAX_CMOV_INSTRUCTIONS * 2 * SizeOf(TRegister), 0);
  10935. FillChar(ConstRegs[0], MAX_CMOV_REGISTERS * SizeOf(TRegister), 0);
  10936. FillChar(ConstVals[0], MAX_CMOV_REGISTERS * SizeOf(TCGInt), 0);
  10937. while assigned(hp1) and
  10938. { Stop on the label we found }
  10939. (hp1 <> hp_lblxxx) do
  10940. begin
  10941. case hp1.typ of
  10942. ait_instruction:
  10943. if MatchInstruction(hp1, A_MOV, [S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  10944. begin
  10945. if CanBeCMOV(hp1, hp_prev) then
  10946. Inc(l)
  10947. else if not (cs_opt_size in current_settings.optimizerswitches) and
  10948. { CMOV with constants grows the code size }
  10949. TryCMOVConst(hp1, hp_prev, hp_stop, c, l) then
  10950. begin
  10951. { Register was reserved by TryCMOVConst and
  10952. stored on ConstRegs[c] }
  10953. end
  10954. else
  10955. Break;
  10956. end
  10957. else
  10958. Break;
  10959. else
  10960. ;
  10961. end;
  10962. GetNextInstruction(hp1,hp1);
  10963. end;
  10964. if (hp1 = hp_lblxxx) then
  10965. begin
  10966. if (l <= MAX_CMOV_INSTRUCTIONS) and (l > 0) then
  10967. begin
  10968. { Repurpose TmpUsedRegs to mark registers that we've defined }
  10969. TmpUsedRegs[R_INTREGISTER].Clear;
  10970. x := 0;
  10971. AllocRegBetween(NR_DEFAULTFLAGS, p, hp_lblxxx, UsedRegs);
  10972. condition := inverse_cond(taicpu(p).condition);
  10973. UpdateUsedRegs(tai(p.next));
  10974. hp1 := hpmov1;
  10975. repeat
  10976. if not Assigned(hp1) then
  10977. InternalError(2018062900);
  10978. if (hp1.typ = ait_instruction) then
  10979. begin
  10980. { Extra safeguard }
  10981. if (taicpu(hp1).opcode <> A_MOV) then
  10982. InternalError(2018062901);
  10983. if taicpu(hp1).oper[0]^.typ = top_const then
  10984. begin
  10985. if x >= MAX_CMOV_REGISTERS then
  10986. InternalError(2021100410);
  10987. { If it's in TmpUsedRegs, then this register
  10988. is being used more than once and hence has
  10989. already had its value defined (it gets
  10990. added to UsedRegs through AllocRegBetween
  10991. below) }
  10992. if not TmpUsedRegs[R_INTREGISTER].IsUsed(ConstRegs[x]) then
  10993. begin
  10994. hp_new := taicpu.op_const_reg(A_MOV, taicpu(hp1).opsize, taicpu(hp1).oper[0]^.val, ConstRegs[x]);
  10995. taicpu(hp_new).fileinfo := taicpu(hp_prev).fileinfo;
  10996. asml.InsertBefore(hp_new, hp_flagalloc);
  10997. if Assigned(hp_prev2) then
  10998. TrySwapMovOp(hp_prev2, hp_new);
  10999. IncludeRegInUsedRegs(ConstRegs[x], TmpUsedRegs);
  11000. end
  11001. else
  11002. { We just need an instruction between hp_prev and hp1
  11003. where we know the register is marked as in use }
  11004. hp_new := hpmov1;
  11005. AllocRegBetween(ConstRegs[x], hp_new, hp1, UsedRegs);
  11006. taicpu(hp1).loadreg(0, ConstRegs[x]);
  11007. Inc(x);
  11008. end;
  11009. taicpu(hp1).opcode := A_CMOVcc;
  11010. taicpu(hp1).condition := condition;
  11011. end;
  11012. UpdateUsedRegs(tai(hp1.next));
  11013. GetNextInstruction(hp1, hp1);
  11014. until (hp1 = hp_lblxxx);
  11015. hp2 := hp_lblxxx;
  11016. repeat
  11017. if not Assigned(hp2) then
  11018. InternalError(2018062910);
  11019. case hp2.typ of
  11020. ait_label:
  11021. { What we expected - break out of the loop (it won't be a dead label at the top of
  11022. a cluster because that was optimised at an earlier stage) }
  11023. Break;
  11024. ait_align:
  11025. { Go to the next entry until a label is found (may be multiple aligns before it) }
  11026. begin
  11027. hp2 := tai(hp2.Next);
  11028. Continue;
  11029. end;
  11030. ait_instruction:
  11031. begin
  11032. if taicpu(hp2).opcode<>A_JMP then
  11033. InternalError(2018062912);
  11034. { This is the Jcc @Lbl; <several movs>; JMP @Lbl variant }
  11035. Break;
  11036. end
  11037. else
  11038. begin
  11039. { Might be a comment or temporary allocation entry }
  11040. if not (hp2.typ in SkipInstr) then
  11041. InternalError(2018062911);
  11042. hp2 := tai(hp2.Next);
  11043. Continue;
  11044. end;
  11045. end;
  11046. until False;
  11047. { Now we can safely decrement the reference count }
  11048. tasmlabel(symbol).decrefs;
  11049. DebugMsg(SPeepholeOptimization+'JccMov2CMov',p);
  11050. { Remove the original jump }
  11051. RemoveInstruction(p); { Note, the choice to not use RemoveCurrentp is deliberate }
  11052. if hp2.typ=ait_instruction then
  11053. begin
  11054. p := hp2;
  11055. Result := True;
  11056. end
  11057. else
  11058. begin
  11059. UpdateUsedRegs(tai(hp2.next));
  11060. Result := GetNextInstruction(hp2, p); { Instruction after the label }
  11061. { Remove the label if this is its final reference }
  11062. if (tasmlabel(symbol).getrefs=0) then
  11063. begin
  11064. { Make sure the aligns get stripped too }
  11065. hp1 := tai(hp_lblxxx.Previous);
  11066. while Assigned(hp1) and (hp1.typ = ait_align) do
  11067. begin
  11068. hp_lblxxx := hp1;
  11069. hp1 := tai(hp_lblxxx.Previous);
  11070. end;
  11071. StripLabelFast(hp_lblxxx);
  11072. end;
  11073. end;
  11074. Exit;
  11075. end;
  11076. end
  11077. else if assigned(hp_lblxxx) and
  11078. { check further for
  11079. jCC xxx
  11080. <several movs 1>
  11081. jmp yyy
  11082. xxx:
  11083. <several movs 2>
  11084. yyy:
  11085. }
  11086. (l <= MAX_CMOV_INSTRUCTIONS - 1) and
  11087. { hp1 should be pointing to jmp yyy }
  11088. MatchInstruction(hp1, A_JMP, []) and
  11089. { real label and jump, no further references to the
  11090. label are allowed }
  11091. (TAsmLabel(symbol).getrefs=1) and
  11092. FindLabel(TAsmLabel(symbol), hp_lblxxx) then
  11093. begin
  11094. hp_jump := hp1;
  11095. { Don't set c to zero }
  11096. l := 0;
  11097. w := 0;
  11098. GetNextInstruction(hp_lblxxx, hpmov2);
  11099. hp2 := hp_lblxxx;
  11100. hp_lblyyy := hpmov2;
  11101. while assigned(hp_lblyyy) and
  11102. { stop on labels }
  11103. (hp_lblyyy.typ <> ait_label) do
  11104. begin
  11105. { Keep track of all integer registers that are used }
  11106. UpdateIntRegsNoDealloc(TmpUsedRegs, tai(hp2.Next));
  11107. if not MatchInstruction(hp_lblyyy, A_MOV, [S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  11108. Break;
  11109. hp2 := hp_lblyyy;
  11110. GetNextInstruction(hp_lblyyy, hp_lblyyy);
  11111. end;
  11112. { Analyse the second batch of MOVs to see if the setup is valid }
  11113. hp1 := hpmov2;
  11114. while assigned(hp1) and
  11115. (hp1 <> hp_lblyyy) do
  11116. begin
  11117. case hp1.typ of
  11118. ait_instruction:
  11119. if MatchInstruction(hp1, A_MOV, [S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  11120. begin
  11121. if CanBeCMOV(hp1, hp_prev) then
  11122. Inc(l)
  11123. else if not (cs_opt_size in current_settings.optimizerswitches)
  11124. { CMOV with constants grows the code size }
  11125. and TryCMOVConst(hp1, hpmov2, hp_lblyyy, c, l) then
  11126. begin
  11127. { Register was reserved by TryCMOVConst and
  11128. stored on ConstRegs[c] }
  11129. end
  11130. else
  11131. Break;
  11132. end
  11133. else
  11134. Break;
  11135. else
  11136. ;
  11137. end;
  11138. GetNextInstruction(hp1,hp1);
  11139. end;
  11140. { Repurpose TmpUsedRegs to mark registers that we've defined }
  11141. TmpUsedRegs[R_INTREGISTER].Clear;
  11142. if (l <= MAX_CMOV_INSTRUCTIONS - 1) and
  11143. (hp1 = hp_lblyyy) and
  11144. FindLabel(TAsmLabel(taicpu(hp_jump).oper[0]^.ref^.symbol), hp_lblyyy) then
  11145. begin
  11146. AllocRegBetween(NR_DEFAULTFLAGS, p, hp_lblyyy, UsedRegs);
  11147. second_condition := taicpu(p).condition;
  11148. condition := inverse_cond(taicpu(p).condition);
  11149. UpdateUsedRegs(tai(p.next));
  11150. { Scan through the first set of MOVs to update UsedRegs,
  11151. but don't process them yet }
  11152. hp1 := hpmov1;
  11153. repeat
  11154. if not Assigned(hp1) then
  11155. InternalError(2018062901);
  11156. UpdateUsedRegs(tai(hp1.next));
  11157. GetNextInstruction(hp1, hp1);
  11158. until (hp1 = hp_lblxxx);
  11159. UpdateUsedRegs(tai(hp_lblxxx.next));
  11160. { Process the second set of MOVs first,
  11161. because if a destination register is
  11162. shared between the first and second MOV
  11163. sets, it is more efficient to turn the
  11164. first one into a MOV instruction and place
  11165. it before the CMP if possible, but we
  11166. won't know which registers are shared
  11167. until we've processed at least one list,
  11168. so we might as well make it the second
  11169. one since that won't be modified again. }
  11170. hp1 := hpmov2;
  11171. repeat
  11172. if not Assigned(hp1) then
  11173. InternalError(2018062902);
  11174. if (hp1.typ = ait_instruction) then
  11175. begin
  11176. { Extra safeguard }
  11177. if (taicpu(hp1).opcode <> A_MOV) then
  11178. InternalError(2018062903);
  11179. if taicpu(hp1).oper[0]^.typ = top_const then
  11180. begin
  11181. RegMatch := False;
  11182. for x := 0 to c - 1 do
  11183. if (ConstVals[x] = taicpu(hp1).oper[0]^.val) then
  11184. begin
  11185. RegMatch := True;
  11186. { If it's in TmpUsedRegs, then this register
  11187. is being used more than once and hence has
  11188. already had its value defined (it gets
  11189. added to UsedRegs through AllocRegBetween
  11190. below) }
  11191. if not TmpUsedRegs[R_INTREGISTER].IsUsed(ConstRegs[x]) then
  11192. begin
  11193. hp_new := taicpu.op_const_reg(A_MOV, taicpu(hp1).opsize, taicpu(hp1).oper[0]^.val, ConstRegs[x]);
  11194. asml.InsertBefore(hp_new, hp_flagalloc);
  11195. if Assigned(hp_prev2) then
  11196. TrySwapMovOp(hp_prev2, hp_new);
  11197. IncludeRegInUsedRegs(ConstRegs[x], TmpUsedRegs);
  11198. end
  11199. else
  11200. { We just need an instruction between hp_prev and hp1
  11201. where we know the register is marked as in use }
  11202. hp_new := hpmov2;
  11203. AllocRegBetween(ConstRegs[x], hp_new, hp1, UsedRegs);
  11204. taicpu(hp1).loadreg(0, ConstRegs[x]);
  11205. Break;
  11206. end;
  11207. if not RegMatch then
  11208. InternalError(2021100411);
  11209. end;
  11210. taicpu(hp1).opcode := A_CMOVcc;
  11211. taicpu(hp1).condition := second_condition;
  11212. { Store these writes to search for
  11213. duplicates later on }
  11214. RegWrites[w] := taicpu(hp1).oper[1]^.reg;
  11215. Inc(w);
  11216. end;
  11217. UpdateUsedRegs(tai(hp1.next));
  11218. GetNextInstruction(hp1, hp1);
  11219. until (hp1 = hp_lblyyy);
  11220. { Now do the first set of MOVs }
  11221. hp1 := hpmov1;
  11222. repeat
  11223. if not Assigned(hp1) then
  11224. InternalError(2018062904);
  11225. if (hp1.typ = ait_instruction) then
  11226. begin
  11227. RegMatch := False;
  11228. { Extra safeguard }
  11229. if (taicpu(hp1).opcode <> A_MOV) then
  11230. InternalError(2018062905);
  11231. { Search through the RegWrites list to see
  11232. if there are any opposing CMOV pairs that
  11233. write to the same register }
  11234. for x := 0 to w - 1 do
  11235. if (RegWrites[x] = taicpu(hp1).oper[1]^.reg) then
  11236. begin
  11237. { We have a match. Keep this as a MOV }
  11238. { Move ahead in preparation }
  11239. GetNextInstruction(hp1, hp1);
  11240. RegMatch := True;
  11241. Break;
  11242. end;
  11243. if RegMatch then
  11244. Continue;
  11245. if taicpu(hp1).oper[0]^.typ = top_const then
  11246. begin
  11247. RegMatch := False;
  11248. for x := 0 to c - 1 do
  11249. if (ConstVals[x] = taicpu(hp1).oper[0]^.val) then
  11250. begin
  11251. RegMatch := True;
  11252. { If it's in TmpUsedRegs, then this register
  11253. is being used more than once and hence has
  11254. already had its value defined (it gets
  11255. added to UsedRegs through AllocRegBetween
  11256. below) }
  11257. if not TmpUsedRegs[R_INTREGISTER].IsUsed(ConstRegs[x]) then
  11258. begin
  11259. hp_new := taicpu.op_const_reg(A_MOV, taicpu(hp1).opsize, taicpu(hp1).oper[0]^.val, ConstRegs[x]);
  11260. asml.InsertBefore(hp_new, hp_flagalloc);
  11261. if Assigned(hp_prev2) then
  11262. TrySwapMovOp(hp_prev2, hp_new);
  11263. IncludeRegInUsedRegs(ConstRegs[x], TmpUsedRegs);
  11264. end
  11265. else
  11266. { We just need an instruction between hp_prev and hp1
  11267. where we know the register is marked as in use }
  11268. hp_new := hpmov1;
  11269. AllocRegBetween(ConstRegs[x], hp_new, hp1, UsedRegs);
  11270. taicpu(hp1).loadreg(0, ConstRegs[x]);
  11271. Break;
  11272. end;
  11273. if not RegMatch then
  11274. InternalError(2021100412);
  11275. end;
  11276. taicpu(hp1).opcode := A_CMOVcc;
  11277. taicpu(hp1).condition := condition;
  11278. end;
  11279. GetNextInstruction(hp1, hp1);
  11280. until (hp1 = hp_jump); { Stop at the jump, not lbl xxx }
  11281. UpdateUsedRegs(tai(hp_jump.next));
  11282. UpdateUsedRegs(tai(hp_lblyyy.next));
  11283. { Get first instruction after label }
  11284. hp1 := p;
  11285. GetNextInstruction(hp_lblyyy, p);
  11286. { Don't dereference yet, as doing so will cause
  11287. GetNextInstruction to skip the label and
  11288. optional align marker. [Kit] }
  11289. DebugMsg(SPeepholeOptimization+'JccMovJmpMov2CMovCMov',hp1);
  11290. { remove Jcc }
  11291. RemoveInstruction(hp1);
  11292. { Now we can safely decrement it }
  11293. tasmlabel(symbol).decrefs;
  11294. { Remove label xxx (it will have a ref of zero due to the initial check) }
  11295. { Make sure the aligns get stripped too }
  11296. hp1 := tai(hp_lblxxx.Previous);
  11297. while Assigned(hp1) and (hp1.typ = ait_align) do
  11298. begin
  11299. hp_lblxxx := hp1;
  11300. hp1 := tai(hp_lblxxx.Previous);
  11301. end;
  11302. StripLabelFast(hp_lblxxx);
  11303. { remove jmp }
  11304. symbol := taicpu(hp_jump).oper[0]^.ref^.symbol;
  11305. RemoveInstruction(hp_jump);
  11306. { As before, now we can safely decrement it }
  11307. TAsmLabel(symbol).decrefs;
  11308. { Remove label yyy (and the optional alignment) if its reference falls to zero }
  11309. if TAsmLabel(symbol).getrefs = 0 then
  11310. begin
  11311. { Make sure the aligns get stripped too }
  11312. hp1 := tai(hp_lblyyy.Previous);
  11313. while Assigned(hp1) and (hp1.typ = ait_align) do
  11314. begin
  11315. hp_lblyyy := hp1;
  11316. hp1 := tai(hp_lblyyy.Previous);
  11317. end;
  11318. StripLabelFast(hp_lblyyy);
  11319. end;
  11320. if Assigned(p) then
  11321. result := True;
  11322. exit;
  11323. end;
  11324. end;
  11325. end;
  11326. {$endif i8086}
  11327. end;
  11328. end;
  11329. end;
  11330. function TX86AsmOptimizer.OptPass1Movx(var p : tai) : boolean;
  11331. var
  11332. hp1,hp2,hp3: tai;
  11333. reg_and_hp1_is_instr, RegUsed, AndTest: Boolean;
  11334. NewSize: TOpSize;
  11335. NewRegSize: TSubRegister;
  11336. Limit: TCgInt;
  11337. SwapOper: POper;
  11338. begin
  11339. result:=false;
  11340. reg_and_hp1_is_instr:=(taicpu(p).oper[1]^.typ = top_reg) and
  11341. GetNextInstruction(p,hp1) and
  11342. (hp1.typ = ait_instruction);
  11343. if reg_and_hp1_is_instr and
  11344. (
  11345. (taicpu(hp1).opcode <> A_LEA) or
  11346. { If the LEA instruction can be converted into an arithmetic instruction,
  11347. it may be possible to then fold it. }
  11348. (
  11349. { If the flags register is in use, don't change the instruction
  11350. to an ADD otherwise this will scramble the flags. [Kit] }
  11351. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  11352. ConvertLEA(taicpu(hp1))
  11353. )
  11354. ) and
  11355. IsFoldableArithOp(taicpu(hp1),taicpu(p).oper[1]^.reg) and
  11356. GetNextInstruction(hp1,hp2) and
  11357. MatchInstruction(hp2,A_MOV,[]) and
  11358. (taicpu(hp2).oper[0]^.typ = top_reg) and
  11359. OpsEqual(taicpu(hp2).oper[1]^,taicpu(p).oper[0]^) and
  11360. ((taicpu(p).opsize in [S_BW,S_BL]) and (taicpu(hp2).opsize=S_B) or
  11361. (taicpu(p).opsize in [S_WL]) and (taicpu(hp2).opsize=S_W)) and
  11362. {$ifdef i386}
  11363. { not all registers have byte size sub registers on i386 }
  11364. ((taicpu(hp2).opsize<>S_B) or (getsupreg(taicpu(hp1).oper[0]^.reg) in [RS_EAX, RS_EBX, RS_ECX, RS_EDX])) and
  11365. {$endif i386}
  11366. (((taicpu(hp1).ops=2) and
  11367. (getsupreg(taicpu(hp2).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg))) or
  11368. ((taicpu(hp1).ops=1) and
  11369. (getsupreg(taicpu(hp2).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[0]^.reg)))) and
  11370. not(RegUsedAfterInstruction(taicpu(hp2).oper[0]^.reg,hp2,UsedRegs)) then
  11371. begin
  11372. { change movsX/movzX reg/ref, reg2
  11373. add/sub/or/... reg3/$const, reg2
  11374. mov reg2 reg/ref
  11375. to add/sub/or/... reg3/$const, reg/ref }
  11376. { by example:
  11377. movswl %si,%eax movswl %si,%eax p
  11378. decl %eax addl %edx,%eax hp1
  11379. movw %ax,%si movw %ax,%si hp2
  11380. ->
  11381. movswl %si,%eax movswl %si,%eax p
  11382. decw %eax addw %edx,%eax hp1
  11383. movw %ax,%si movw %ax,%si hp2
  11384. }
  11385. taicpu(hp1).changeopsize(taicpu(hp2).opsize);
  11386. {
  11387. ->
  11388. movswl %si,%eax movswl %si,%eax p
  11389. decw %si addw %dx,%si hp1
  11390. movw %ax,%si movw %ax,%si hp2
  11391. }
  11392. case taicpu(hp1).ops of
  11393. 1:
  11394. taicpu(hp1).loadoper(0,taicpu(hp2).oper[1]^);
  11395. 2:
  11396. begin
  11397. taicpu(hp1).loadoper(1,taicpu(hp2).oper[1]^);
  11398. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  11399. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  11400. end;
  11401. else
  11402. internalerror(2008042702);
  11403. end;
  11404. {
  11405. ->
  11406. decw %si addw %dx,%si p
  11407. }
  11408. DebugMsg(SPeepholeOptimization + 'var3',p);
  11409. RemoveCurrentP(p, hp1);
  11410. RemoveInstruction(hp2);
  11411. Result := True;
  11412. Exit;
  11413. end;
  11414. if reg_and_hp1_is_instr and
  11415. (taicpu(hp1).opcode = A_MOV) and
  11416. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  11417. (MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^)
  11418. {$ifdef x86_64}
  11419. { check for implicit extension to 64 bit }
  11420. or
  11421. ((taicpu(p).opsize in [S_BL,S_WL]) and
  11422. (taicpu(hp1).opsize=S_Q) and
  11423. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.reg)
  11424. )
  11425. {$endif x86_64}
  11426. )
  11427. then
  11428. begin
  11429. { change
  11430. movx %reg1,%reg2
  11431. mov %reg2,%reg3
  11432. dealloc %reg2
  11433. into
  11434. movx %reg,%reg3
  11435. }
  11436. TransferUsedRegs(TmpUsedRegs);
  11437. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  11438. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  11439. begin
  11440. DebugMsg(SPeepholeOptimization + 'MovxMov2Movx',p);
  11441. {$ifdef x86_64}
  11442. if (taicpu(p).opsize in [S_BL,S_WL]) and
  11443. (taicpu(hp1).opsize=S_Q) then
  11444. taicpu(p).loadreg(1,newreg(R_INTREGISTER,getsupreg(taicpu(hp1).oper[1]^.reg),R_SUBD))
  11445. else
  11446. {$endif x86_64}
  11447. taicpu(p).loadreg(1,taicpu(hp1).oper[1]^.reg);
  11448. RemoveInstruction(hp1);
  11449. Result := True;
  11450. Exit;
  11451. end;
  11452. end;
  11453. if reg_and_hp1_is_instr and
  11454. ((taicpu(hp1).opcode=A_MOV) or
  11455. (taicpu(hp1).opcode=A_ADD) or
  11456. (taicpu(hp1).opcode=A_SUB) or
  11457. (taicpu(hp1).opcode=A_CMP) or
  11458. (taicpu(hp1).opcode=A_OR) or
  11459. (taicpu(hp1).opcode=A_XOR) or
  11460. (taicpu(hp1).opcode=A_AND)
  11461. ) and
  11462. (taicpu(hp1).oper[1]^.typ = top_reg) then
  11463. begin
  11464. AndTest := (taicpu(hp1).opcode=A_AND) and
  11465. GetNextInstruction(hp1, hp2) and
  11466. (hp2.typ = ait_instruction) and
  11467. (
  11468. (
  11469. (taicpu(hp2).opcode=A_TEST) and
  11470. (
  11471. MatchOperand(taicpu(hp2).oper[0]^, taicpu(hp1).oper[1]^.reg) or
  11472. MatchOperand(taicpu(hp2).oper[0]^, -1) or
  11473. (
  11474. { If the AND and TEST instructions share a constant, this is also valid }
  11475. (taicpu(hp1).oper[0]^.typ = top_const) and
  11476. MatchOperand(taicpu(hp2).oper[0]^, taicpu(hp1).oper[0]^.val)
  11477. )
  11478. ) and
  11479. MatchOperand(taicpu(hp2).oper[1]^, taicpu(hp1).oper[1]^.reg)
  11480. ) or
  11481. (
  11482. (taicpu(hp2).opcode=A_CMP) and
  11483. MatchOperand(taicpu(hp2).oper[0]^, 0) and
  11484. MatchOperand(taicpu(hp2).oper[1]^, taicpu(hp1).oper[1]^.reg)
  11485. )
  11486. );
  11487. { change
  11488. movx (oper),%reg2
  11489. and $x,%reg2
  11490. test %reg2,%reg2
  11491. dealloc %reg2
  11492. into
  11493. op %reg1,%reg3
  11494. if the second op accesses only the bits stored in reg1
  11495. }
  11496. if ((taicpu(p).oper[0]^.typ=top_reg) or
  11497. ((taicpu(p).oper[0]^.typ=top_ref) and (taicpu(p).oper[0]^.ref^.refaddr<>addr_full))) and
  11498. (taicpu(hp1).oper[0]^.typ = top_const) and
  11499. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  11500. AndTest then
  11501. begin
  11502. { Check if the AND constant is in range }
  11503. case taicpu(p).opsize of
  11504. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  11505. begin
  11506. NewSize := S_B;
  11507. Limit := $FF;
  11508. end;
  11509. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  11510. begin
  11511. NewSize := S_W;
  11512. Limit := $FFFF;
  11513. end;
  11514. {$ifdef x86_64}
  11515. S_LQ:
  11516. begin
  11517. NewSize := S_L;
  11518. Limit := $FFFFFFFF;
  11519. end;
  11520. {$endif x86_64}
  11521. else
  11522. InternalError(2021120303);
  11523. end;
  11524. if (
  11525. ((taicpu(hp1).oper[0]^.val and Limit) = taicpu(hp1).oper[0]^.val) or
  11526. { Check for negative operands }
  11527. (((not taicpu(hp1).oper[0]^.val) and Limit) = (not taicpu(hp1).oper[0]^.val))
  11528. ) and
  11529. GetNextInstruction(hp2,hp3) and
  11530. MatchInstruction(hp3,A_Jcc,A_Setcc,A_CMOVcc,[]) and
  11531. (taicpu(hp3).condition in [C_E,C_NE]) then
  11532. begin
  11533. TransferUsedRegs(TmpUsedRegs);
  11534. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  11535. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  11536. if not(RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp2, TmpUsedRegs)) then
  11537. begin
  11538. DebugMsg(SPeepholeOptimization + 'MovxAndTest2Test done',p);
  11539. taicpu(hp1).loadoper(1, taicpu(p).oper[0]^);
  11540. taicpu(hp1).opcode := A_TEST;
  11541. taicpu(hp1).opsize := NewSize;
  11542. RemoveInstruction(hp2);
  11543. RemoveCurrentP(p, hp1);
  11544. Result:=true;
  11545. exit;
  11546. end;
  11547. end;
  11548. end;
  11549. if (taicpu(hp1).oper[0]^.typ = top_reg) and
  11550. (((taicpu(p).opsize in [S_BW,S_BL,S_WL{$ifdef x86_64},S_BQ,S_WQ,S_LQ{$endif x86_64}]) and
  11551. (taicpu(hp1).opsize=S_B)) or
  11552. ((taicpu(p).opsize in [S_WL{$ifdef x86_64},S_WQ,S_LQ{$endif x86_64}]) and
  11553. (taicpu(hp1).opsize=S_W))
  11554. {$ifdef x86_64}
  11555. or ((taicpu(p).opsize=S_LQ) and
  11556. (taicpu(hp1).opsize=S_L))
  11557. {$endif x86_64}
  11558. ) and
  11559. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.reg) then
  11560. begin
  11561. { change
  11562. movx %reg1,%reg2
  11563. op %reg2,%reg3
  11564. dealloc %reg2
  11565. into
  11566. op %reg1,%reg3
  11567. if the second op accesses only the bits stored in reg1
  11568. }
  11569. TransferUsedRegs(TmpUsedRegs);
  11570. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  11571. if AndTest then
  11572. begin
  11573. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  11574. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs);
  11575. end
  11576. else
  11577. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs);
  11578. if not RegUsed then
  11579. begin
  11580. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 1',p);
  11581. if taicpu(p).oper[0]^.typ=top_reg then
  11582. begin
  11583. case taicpu(hp1).opsize of
  11584. S_B:
  11585. taicpu(hp1).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[0]^.reg),R_SUBL));
  11586. S_W:
  11587. taicpu(hp1).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[0]^.reg),R_SUBW));
  11588. S_L:
  11589. taicpu(hp1).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[0]^.reg),R_SUBD));
  11590. else
  11591. Internalerror(2020102301);
  11592. end;
  11593. AllocRegBetween(taicpu(hp1).oper[0]^.reg,p,hp1,UsedRegs);
  11594. end
  11595. else
  11596. taicpu(hp1).loadref(0,taicpu(p).oper[0]^.ref^);
  11597. RemoveCurrentP(p);
  11598. if AndTest then
  11599. RemoveInstruction(hp2);
  11600. result:=true;
  11601. exit;
  11602. end;
  11603. end
  11604. else if (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg) and
  11605. (
  11606. { Bitwise operations only }
  11607. (taicpu(hp1).opcode=A_AND) or
  11608. (taicpu(hp1).opcode=A_TEST) or
  11609. (
  11610. (taicpu(hp1).oper[0]^.typ = top_const) and
  11611. (
  11612. (taicpu(hp1).opcode=A_OR) or
  11613. (taicpu(hp1).opcode=A_XOR)
  11614. )
  11615. )
  11616. ) and
  11617. (
  11618. (taicpu(hp1).oper[0]^.typ = top_const) or
  11619. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) or
  11620. not RegInOp(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^)
  11621. ) then
  11622. begin
  11623. { change
  11624. movx %reg2,%reg2
  11625. op const,%reg2
  11626. into
  11627. op const,%reg2 (smaller version)
  11628. movx %reg2,%reg2
  11629. also change
  11630. movx %reg1,%reg2
  11631. and/test (oper),%reg2
  11632. dealloc %reg2
  11633. into
  11634. and/test (oper),%reg1
  11635. }
  11636. case taicpu(p).opsize of
  11637. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  11638. begin
  11639. NewSize := S_B;
  11640. NewRegSize := R_SUBL;
  11641. Limit := $FF;
  11642. end;
  11643. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  11644. begin
  11645. NewSize := S_W;
  11646. NewRegSize := R_SUBW;
  11647. Limit := $FFFF;
  11648. end;
  11649. {$ifdef x86_64}
  11650. S_LQ:
  11651. begin
  11652. NewSize := S_L;
  11653. NewRegSize := R_SUBD;
  11654. Limit := $FFFFFFFF;
  11655. end;
  11656. {$endif x86_64}
  11657. else
  11658. Internalerror(2021120302);
  11659. end;
  11660. TransferUsedRegs(TmpUsedRegs);
  11661. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  11662. if AndTest then
  11663. begin
  11664. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  11665. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs);
  11666. end
  11667. else
  11668. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs);
  11669. if
  11670. (
  11671. (taicpu(p).opcode = A_MOVZX) and
  11672. (
  11673. (taicpu(hp1).opcode=A_AND) or
  11674. (taicpu(hp1).opcode=A_TEST)
  11675. ) and
  11676. not (
  11677. { If both are references, then the final instruction will have
  11678. both operands as references, which is not allowed }
  11679. (taicpu(p).oper[0]^.typ = top_ref) and
  11680. (taicpu(hp1).oper[0]^.typ = top_ref)
  11681. ) and
  11682. not RegUsed
  11683. ) or
  11684. (
  11685. (
  11686. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) or
  11687. not RegUsed
  11688. ) and
  11689. (taicpu(p).oper[0]^.typ = top_reg) and
  11690. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11691. (taicpu(hp1).oper[0]^.typ = top_const) and
  11692. ((taicpu(hp1).oper[0]^.val and Limit) = taicpu(hp1).oper[0]^.val)
  11693. ) then
  11694. begin
  11695. {$if defined(i386) or defined(i8086)}
  11696. { If the target size is 8-bit, make sure we can actually encode it }
  11697. 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
  11698. Exit;
  11699. {$endif i386 or i8086}
  11700. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 2',p);
  11701. taicpu(hp1).opsize := NewSize;
  11702. taicpu(hp1).loadoper(1, taicpu(p).oper[0]^);
  11703. if AndTest then
  11704. begin
  11705. RemoveInstruction(hp2);
  11706. if not RegUsed then
  11707. begin
  11708. taicpu(hp1).opcode := A_TEST;
  11709. if (taicpu(hp1).oper[0]^.typ = top_ref) then
  11710. begin
  11711. { Make sure the reference is the second operand }
  11712. SwapOper := taicpu(hp1).oper[0];
  11713. taicpu(hp1).oper[0] := taicpu(hp1).oper[1];
  11714. taicpu(hp1).oper[1] := SwapOper;
  11715. end;
  11716. end;
  11717. end;
  11718. case taicpu(hp1).oper[0]^.typ of
  11719. top_reg:
  11720. setsubreg(taicpu(hp1).oper[0]^.reg, NewRegSize);
  11721. top_const:
  11722. { For the AND/TEST case }
  11723. taicpu(hp1).oper[0]^.val := taicpu(hp1).oper[0]^.val and Limit;
  11724. else
  11725. ;
  11726. end;
  11727. if RegUsed then
  11728. begin
  11729. AsmL.Remove(p);
  11730. AsmL.InsertAfter(p, hp1);
  11731. p := hp1;
  11732. end
  11733. else
  11734. RemoveCurrentP(p, hp1);
  11735. result:=true;
  11736. exit;
  11737. end;
  11738. end;
  11739. end;
  11740. if reg_and_hp1_is_instr and
  11741. (taicpu(p).oper[0]^.typ = top_reg) and
  11742. (
  11743. (taicpu(hp1).opcode = A_SHL) or (taicpu(hp1).opcode = A_SAL)
  11744. ) and
  11745. (taicpu(hp1).oper[0]^.typ = top_const) and
  11746. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11747. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  11748. { Minimum shift value allowed is the bit difference between the sizes }
  11749. (taicpu(hp1).oper[0]^.val >=
  11750. { Multiply by 8 because tcgsize2size returns bytes, not bits }
  11751. 8 * (
  11752. tcgsize2size[reg_cgsize(taicpu(p).oper[1]^.reg)] -
  11753. tcgsize2size[reg_cgsize(taicpu(p).oper[0]^.reg)]
  11754. )
  11755. ) then
  11756. begin
  11757. { For:
  11758. movsx/movzx %reg1,%reg1 (same register, just different sizes)
  11759. shl/sal ##, %reg1
  11760. Remove the movsx/movzx instruction if the shift overwrites the
  11761. extended bits of the register (e.g. movslq %eax,%rax; shlq $32,%rax
  11762. }
  11763. DebugMsg(SPeepholeOptimization + 'MovxShl2Shl',p);
  11764. RemoveCurrentP(p, hp1);
  11765. Result := True;
  11766. Exit;
  11767. end
  11768. else if reg_and_hp1_is_instr and
  11769. (taicpu(p).oper[0]^.typ = top_reg) and
  11770. (
  11771. ((taicpu(hp1).opcode = A_SHR) and (taicpu(p).opcode = A_MOVZX)) or
  11772. ((taicpu(hp1).opcode = A_SAR) and (taicpu(p).opcode <> A_MOVZX))
  11773. ) and
  11774. (taicpu(hp1).oper[0]^.typ = top_const) and
  11775. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11776. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  11777. { Minimum shift value allowed is the bit size of the smallest register - 1 }
  11778. (taicpu(hp1).oper[0]^.val <
  11779. { Multiply by 8 because tcgsize2size returns bytes, not bits }
  11780. 8 * (
  11781. tcgsize2size[reg_cgsize(taicpu(p).oper[0]^.reg)]
  11782. )
  11783. ) then
  11784. begin
  11785. { For:
  11786. movsx %reg1,%reg1 movzx %reg1,%reg1 (same register, just different sizes)
  11787. sar ##, %reg1 shr ##, %reg1
  11788. Move the shift to before the movx instruction if the shift value
  11789. is not too large.
  11790. }
  11791. asml.Remove(hp1);
  11792. asml.InsertBefore(hp1, p);
  11793. taicpu(hp1).oper[1]^.reg := taicpu(p).oper[0]^.reg;
  11794. case taicpu(p).opsize of
  11795. s_BW, S_BL{$ifdef x86_64}, S_BQ{$endif}:
  11796. taicpu(hp1).opsize := S_B;
  11797. S_WL{$ifdef x86_64}, S_WQ{$endif}:
  11798. taicpu(hp1).opsize := S_W;
  11799. {$ifdef x86_64}
  11800. S_LQ:
  11801. taicpu(hp1).opsize := S_L;
  11802. {$endif}
  11803. else
  11804. InternalError(2020112401);
  11805. end;
  11806. if (taicpu(hp1).opcode = A_SHR) then
  11807. DebugMsg(SPeepholeOptimization + 'MovzShr2ShrMovz', hp1)
  11808. else
  11809. DebugMsg(SPeepholeOptimization + 'MovsSar2SarMovs', hp1);
  11810. Result := True;
  11811. end;
  11812. if reg_and_hp1_is_instr and
  11813. (taicpu(p).oper[0]^.typ = top_reg) and
  11814. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11815. (
  11816. (taicpu(hp1).opcode = taicpu(p).opcode)
  11817. or ((taicpu(p).opcode = A_MOVZX) and ((taicpu(hp1).opcode = A_MOVSX){$ifdef x86_64} or (taicpu(hp1).opcode = A_MOVSXD){$endif x86_64}))
  11818. {$ifdef x86_64}
  11819. or ((taicpu(p).opcode = A_MOVSX) and (taicpu(hp1).opcode = A_MOVSXD))
  11820. {$endif x86_64}
  11821. ) then
  11822. begin
  11823. if MatchOpType(taicpu(hp1), top_reg, top_reg) and
  11824. (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[0]^.reg) and
  11825. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then
  11826. begin
  11827. {
  11828. For example:
  11829. movzbw %al,%ax
  11830. movzwl %ax,%eax
  11831. Compress into:
  11832. movzbl %al,%eax
  11833. }
  11834. RegUsed := False;
  11835. case taicpu(p).opsize of
  11836. S_BW:
  11837. case taicpu(hp1).opsize of
  11838. S_WL:
  11839. begin
  11840. taicpu(p).opsize := S_BL;
  11841. RegUsed := True;
  11842. end;
  11843. {$ifdef x86_64}
  11844. S_WQ:
  11845. begin
  11846. if taicpu(p).opcode = A_MOVZX then
  11847. begin
  11848. taicpu(p).opsize := S_BL;
  11849. { 64-bit zero extension is implicit, so change to the 32-bit register }
  11850. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  11851. end
  11852. else
  11853. taicpu(p).opsize := S_BQ;
  11854. RegUsed := True;
  11855. end;
  11856. {$endif x86_64}
  11857. else
  11858. ;
  11859. end;
  11860. {$ifdef x86_64}
  11861. S_BL:
  11862. case taicpu(hp1).opsize of
  11863. S_LQ:
  11864. begin
  11865. if taicpu(p).opcode = A_MOVZX then
  11866. begin
  11867. taicpu(p).opsize := S_BL;
  11868. { 64-bit zero extension is implicit, so change to the 32-bit register }
  11869. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  11870. end
  11871. else
  11872. taicpu(p).opsize := S_BQ;
  11873. RegUsed := True;
  11874. end;
  11875. else
  11876. ;
  11877. end;
  11878. S_WL:
  11879. case taicpu(hp1).opsize of
  11880. S_LQ:
  11881. begin
  11882. if taicpu(p).opcode = A_MOVZX then
  11883. begin
  11884. taicpu(p).opsize := S_WL;
  11885. { 64-bit zero extension is implicit, so change to the 32-bit register }
  11886. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  11887. end
  11888. else
  11889. taicpu(p).opsize := S_WQ;
  11890. RegUsed := True;
  11891. end;
  11892. else
  11893. ;
  11894. end;
  11895. {$endif x86_64}
  11896. else
  11897. ;
  11898. end;
  11899. if RegUsed then
  11900. begin
  11901. DebugMsg(SPeepholeOptimization + 'MovxMovx2Movx', p);
  11902. taicpu(p).oper[1]^.reg := taicpu(hp1).oper[1]^.reg;
  11903. RemoveInstruction(hp1);
  11904. Result := True;
  11905. Exit;
  11906. end;
  11907. end;
  11908. if (taicpu(hp1).opsize = taicpu(p).opsize) and
  11909. not RegInInstruction(taicpu(p).oper[1]^.reg, hp1) and
  11910. GetNextInstruction(hp1, hp2) and
  11911. MatchInstruction(hp2, [A_AND, A_OR, A_XOR, A_TEST], []) and
  11912. (
  11913. ((taicpu(hp2).opsize = S_W) and (taicpu(p).opsize = S_BW)) or
  11914. ((taicpu(hp2).opsize = S_L) and (taicpu(p).opsize in [S_BL, S_WL]))
  11915. {$ifdef x86_64}
  11916. or ((taicpu(hp2).opsize = S_Q) and (taicpu(p).opsize in [S_BL, S_BQ, S_WL, S_WQ, S_LQ]))
  11917. {$endif x86_64}
  11918. ) and
  11919. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  11920. (
  11921. (
  11922. (taicpu(hp2).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) and
  11923. (taicpu(hp2).oper[1]^.reg = taicpu(p).oper[1]^.reg)
  11924. ) or
  11925. (
  11926. { Only allow the operands in reverse order for TEST instructions }
  11927. (taicpu(hp2).opcode = A_TEST) and
  11928. (taicpu(hp2).oper[0]^.reg = taicpu(p).oper[1]^.reg) and
  11929. (taicpu(hp2).oper[1]^.reg = taicpu(hp1).oper[1]^.reg)
  11930. )
  11931. ) then
  11932. begin
  11933. {
  11934. For example:
  11935. movzbl %al,%eax
  11936. movzbl (ref),%edx
  11937. andl %edx,%eax
  11938. (%edx deallocated)
  11939. Change to:
  11940. andb (ref),%al
  11941. movzbl %al,%eax
  11942. Rules are:
  11943. - First two instructions have the same opcode and opsize
  11944. - First instruction's operands are the same super-register
  11945. - Second instruction operates on a different register
  11946. - Third instruction is AND, OR, XOR or TEST
  11947. - Third instruction's operands are the destination registers of the first two instructions
  11948. - Third instruction writes to the destination register of the first instruction (except with TEST)
  11949. - Second instruction's destination register is deallocated afterwards
  11950. }
  11951. TransferUsedRegs(TmpUsedRegs);
  11952. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  11953. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  11954. if not RegUsedAfterInstruction(taicpu(hp1).oper[1]^.reg, hp2, TmpUsedRegs) then
  11955. begin
  11956. case taicpu(p).opsize of
  11957. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  11958. NewSize := S_B;
  11959. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  11960. NewSize := S_W;
  11961. {$ifdef x86_64}
  11962. S_LQ:
  11963. NewSize := S_L;
  11964. {$endif x86_64}
  11965. else
  11966. InternalError(2021120301);
  11967. end;
  11968. taicpu(hp2).loadoper(0, taicpu(hp1).oper[0]^);
  11969. taicpu(hp2).loadreg(1, taicpu(p).oper[0]^.reg);
  11970. taicpu(hp2).opsize := NewSize;
  11971. RemoveInstruction(hp1);
  11972. { With TEST, it's best to keep the MOVX instruction at the top }
  11973. if (taicpu(hp2).opcode <> A_TEST) then
  11974. begin
  11975. DebugMsg(SPeepholeOptimization + 'MovxMovxTest2MovxTest', p);
  11976. asml.Remove(p);
  11977. { If the third instruction uses the flags, the MOVX instruction won't modify then }
  11978. asml.InsertAfter(p, hp2);
  11979. p := hp2;
  11980. end
  11981. else
  11982. DebugMsg(SPeepholeOptimization + 'MovxMovxOp2OpMovx', p);
  11983. Result := True;
  11984. Exit;
  11985. end;
  11986. end;
  11987. end;
  11988. if taicpu(p).opcode=A_MOVZX then
  11989. begin
  11990. { removes superfluous And's after movzx's }
  11991. if reg_and_hp1_is_instr and
  11992. (taicpu(hp1).opcode = A_AND) and
  11993. MatchOpType(taicpu(hp1),top_const,top_reg) and
  11994. ((taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg)
  11995. {$ifdef x86_64}
  11996. { check for implicit extension to 64 bit }
  11997. or
  11998. ((taicpu(p).opsize in [S_BL,S_WL]) and
  11999. (taicpu(hp1).opsize=S_Q) and
  12000. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[1]^.reg)
  12001. )
  12002. {$endif x86_64}
  12003. )
  12004. then
  12005. begin
  12006. case taicpu(p).opsize Of
  12007. S_BL, S_BW{$ifdef x86_64}, S_BQ{$endif x86_64}:
  12008. if (taicpu(hp1).oper[0]^.val = $ff) then
  12009. begin
  12010. DebugMsg(SPeepholeOptimization + 'MovzAnd2Movz1',p);
  12011. RemoveInstruction(hp1);
  12012. Result:=true;
  12013. exit;
  12014. end;
  12015. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  12016. if (taicpu(hp1).oper[0]^.val = $ffff) then
  12017. begin
  12018. DebugMsg(SPeepholeOptimization + 'MovzAnd2Movz2',p);
  12019. RemoveInstruction(hp1);
  12020. Result:=true;
  12021. exit;
  12022. end;
  12023. {$ifdef x86_64}
  12024. S_LQ:
  12025. if (taicpu(hp1).oper[0]^.val = $ffffffff) then
  12026. begin
  12027. DebugMsg(SPeepholeOptimization + 'MovzAnd2Movz3',p);
  12028. RemoveInstruction(hp1);
  12029. Result:=true;
  12030. exit;
  12031. end;
  12032. {$endif x86_64}
  12033. else
  12034. ;
  12035. end;
  12036. { we cannot get rid of the and, but can we get rid of the movz ?}
  12037. if SuperRegistersEqual(taicpu(p).oper[0]^.reg,taicpu(p).oper[1]^.reg) then
  12038. begin
  12039. case taicpu(p).opsize Of
  12040. S_BL, S_BW{$ifdef x86_64}, S_BQ{$endif x86_64}:
  12041. if (taicpu(hp1).oper[0]^.val and $ff)=taicpu(hp1).oper[0]^.val then
  12042. begin
  12043. DebugMsg(SPeepholeOptimization + 'MovzAnd2And1',p);
  12044. RemoveCurrentP(p,hp1);
  12045. Result:=true;
  12046. exit;
  12047. end;
  12048. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  12049. if (taicpu(hp1).oper[0]^.val and $ffff)=taicpu(hp1).oper[0]^.val then
  12050. begin
  12051. DebugMsg(SPeepholeOptimization + 'MovzAnd2And2',p);
  12052. RemoveCurrentP(p,hp1);
  12053. Result:=true;
  12054. exit;
  12055. end;
  12056. {$ifdef x86_64}
  12057. S_LQ:
  12058. if (taicpu(hp1).oper[0]^.val and $ffffffff)=taicpu(hp1).oper[0]^.val then
  12059. begin
  12060. DebugMsg(SPeepholeOptimization + 'MovzAnd2And3',p);
  12061. RemoveCurrentP(p,hp1);
  12062. Result:=true;
  12063. exit;
  12064. end;
  12065. {$endif x86_64}
  12066. else
  12067. ;
  12068. end;
  12069. end;
  12070. end;
  12071. { changes some movzx constructs to faster synonyms (all examples
  12072. are given with eax/ax, but are also valid for other registers)}
  12073. if MatchOpType(taicpu(p),top_reg,top_reg) then
  12074. begin
  12075. case taicpu(p).opsize of
  12076. { Technically, movzbw %al,%ax cannot be encoded in 32/64-bit mode
  12077. (the machine code is equivalent to movzbl %al,%eax), but the
  12078. code generator still generates that assembler instruction and
  12079. it is silently converted. This should probably be checked.
  12080. [Kit] }
  12081. S_BW:
  12082. begin
  12083. if (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) and
  12084. (
  12085. not IsMOVZXAcceptable
  12086. { and $0xff,%ax has a smaller encoding but risks a partial write penalty }
  12087. or (
  12088. (cs_opt_size in current_settings.optimizerswitches) and
  12089. (taicpu(p).oper[1]^.reg = NR_AX)
  12090. )
  12091. ) then
  12092. {Change "movzbw %al, %ax" to "andw $0x0ffh, %ax"}
  12093. begin
  12094. DebugMsg(SPeepholeOptimization + 'var7',p);
  12095. taicpu(p).opcode := A_AND;
  12096. taicpu(p).changeopsize(S_W);
  12097. taicpu(p).loadConst(0,$ff);
  12098. Result := True;
  12099. end
  12100. else if not IsMOVZXAcceptable and
  12101. GetNextInstruction(p, hp1) and
  12102. (tai(hp1).typ = ait_instruction) and
  12103. (taicpu(hp1).opcode = A_AND) and
  12104. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12105. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12106. { Change "movzbw %reg1, %reg2; andw $const, %reg2"
  12107. to "movw %reg1, reg2; andw $(const1 and $ff), %reg2"}
  12108. begin
  12109. DebugMsg(SPeepholeOptimization + 'var8',p);
  12110. taicpu(p).opcode := A_MOV;
  12111. taicpu(p).changeopsize(S_W);
  12112. setsubreg(taicpu(p).oper[0]^.reg,R_SUBW);
  12113. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  12114. Result := True;
  12115. end;
  12116. end;
  12117. {$ifndef i8086} { movzbl %al,%eax cannot be encoded in 16-bit mode (the machine code is equivalent to movzbw %al,%ax }
  12118. S_BL:
  12119. if not IsMOVZXAcceptable then
  12120. begin
  12121. if (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) then
  12122. { Change "movzbl %al, %eax" to "andl $0x0ffh, %eax" }
  12123. begin
  12124. DebugMsg(SPeepholeOptimization + 'var9',p);
  12125. taicpu(p).opcode := A_AND;
  12126. taicpu(p).changeopsize(S_L);
  12127. taicpu(p).loadConst(0,$ff);
  12128. Result := True;
  12129. end
  12130. else if GetNextInstruction(p, hp1) and
  12131. (tai(hp1).typ = ait_instruction) and
  12132. (taicpu(hp1).opcode = A_AND) and
  12133. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12134. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12135. { Change "movzbl %reg1, %reg2; andl $const, %reg2"
  12136. to "movl %reg1, reg2; andl $(const1 and $ff), %reg2"}
  12137. begin
  12138. DebugMsg(SPeepholeOptimization + 'var10',p);
  12139. taicpu(p).opcode := A_MOV;
  12140. taicpu(p).changeopsize(S_L);
  12141. { do not use R_SUBWHOLE
  12142. as movl %rdx,%eax
  12143. is invalid in assembler PM }
  12144. setsubreg(taicpu(p).oper[0]^.reg, R_SUBD);
  12145. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  12146. Result := True;
  12147. end;
  12148. end;
  12149. {$endif i8086}
  12150. S_WL:
  12151. if not IsMOVZXAcceptable then
  12152. begin
  12153. if (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) then
  12154. { Change "movzwl %ax, %eax" to "andl $0x0ffffh, %eax" }
  12155. begin
  12156. DebugMsg(SPeepholeOptimization + 'var11',p);
  12157. taicpu(p).opcode := A_AND;
  12158. taicpu(p).changeopsize(S_L);
  12159. taicpu(p).loadConst(0,$ffff);
  12160. Result := True;
  12161. end
  12162. else if GetNextInstruction(p, hp1) and
  12163. (tai(hp1).typ = ait_instruction) and
  12164. (taicpu(hp1).opcode = A_AND) and
  12165. (taicpu(hp1).oper[0]^.typ = top_const) and
  12166. (taicpu(hp1).oper[1]^.typ = top_reg) and
  12167. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12168. { Change "movzwl %reg1, %reg2; andl $const, %reg2"
  12169. to "movl %reg1, reg2; andl $(const1 and $ffff), %reg2"}
  12170. begin
  12171. DebugMsg(SPeepholeOptimization + 'var12',p);
  12172. taicpu(p).opcode := A_MOV;
  12173. taicpu(p).changeopsize(S_L);
  12174. { do not use R_SUBWHOLE
  12175. as movl %rdx,%eax
  12176. is invalid in assembler PM }
  12177. setsubreg(taicpu(p).oper[0]^.reg, R_SUBD);
  12178. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ffff);
  12179. Result := True;
  12180. end;
  12181. end;
  12182. else
  12183. InternalError(2017050705);
  12184. end;
  12185. end
  12186. else if not IsMOVZXAcceptable and (taicpu(p).oper[0]^.typ = top_ref) then
  12187. begin
  12188. if GetNextInstruction(p, hp1) and
  12189. (tai(hp1).typ = ait_instruction) and
  12190. (taicpu(hp1).opcode = A_AND) and
  12191. MatchOpType(taicpu(hp1),top_const,top_reg) and
  12192. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12193. begin
  12194. //taicpu(p).opcode := A_MOV;
  12195. case taicpu(p).opsize Of
  12196. S_BL:
  12197. begin
  12198. DebugMsg(SPeepholeOptimization + 'var13',p);
  12199. taicpu(hp1).changeopsize(S_L);
  12200. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  12201. end;
  12202. S_WL:
  12203. begin
  12204. DebugMsg(SPeepholeOptimization + 'var14',p);
  12205. taicpu(hp1).changeopsize(S_L);
  12206. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ffff);
  12207. end;
  12208. S_BW:
  12209. begin
  12210. DebugMsg(SPeepholeOptimization + 'var15',p);
  12211. taicpu(hp1).changeopsize(S_W);
  12212. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  12213. end;
  12214. else
  12215. Internalerror(2017050704)
  12216. end;
  12217. Result := True;
  12218. end;
  12219. end;
  12220. end;
  12221. end;
  12222. function TX86AsmOptimizer.OptPass1AND(var p : tai) : boolean;
  12223. var
  12224. hp1, hp2 : tai;
  12225. MaskLength : Cardinal;
  12226. MaskedBits : TCgInt;
  12227. ActiveReg : TRegister;
  12228. begin
  12229. Result:=false;
  12230. { There are no optimisations for reference targets }
  12231. if (taicpu(p).oper[1]^.typ <> top_reg) then
  12232. Exit;
  12233. while GetNextInstruction(p, hp1) and
  12234. (hp1.typ = ait_instruction) do
  12235. begin
  12236. if (taicpu(p).oper[0]^.typ = top_const) then
  12237. begin
  12238. case taicpu(hp1).opcode of
  12239. A_AND:
  12240. if MatchOpType(taicpu(hp1),top_const,top_reg) and
  12241. (getsupreg(taicpu(p).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) and
  12242. { the second register must contain the first one, so compare their subreg types }
  12243. (getsubreg(taicpu(p).oper[1]^.reg)<=getsubreg(taicpu(hp1).oper[1]^.reg)) and
  12244. (abs(taicpu(p).oper[0]^.val and taicpu(hp1).oper[0]^.val)<$80000000) then
  12245. { change
  12246. and const1, reg
  12247. and const2, reg
  12248. to
  12249. and (const1 and const2), reg
  12250. }
  12251. begin
  12252. taicpu(hp1).loadConst(0, taicpu(p).oper[0]^.val and taicpu(hp1).oper[0]^.val);
  12253. DebugMsg(SPeepholeOptimization + 'AndAnd2And done',hp1);
  12254. RemoveCurrentP(p, hp1);
  12255. Result:=true;
  12256. exit;
  12257. end;
  12258. A_CMP:
  12259. if (PopCnt(DWord(taicpu(p).oper[0]^.val)) = 1) and { Only 1 bit set }
  12260. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^.val) and
  12261. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  12262. { Just check that the condition on the next instruction is compatible }
  12263. GetNextInstruction(hp1, hp2) and
  12264. (hp2.typ = ait_instruction) and
  12265. (taicpu(hp2).condition in [C_Z, C_E, C_NZ, C_NE])
  12266. then
  12267. { change
  12268. and 2^n, reg
  12269. cmp 2^n, reg
  12270. j(c) / set(c) / cmov(c) (c is equal or not equal)
  12271. to
  12272. and 2^n, reg
  12273. test reg, reg
  12274. j(~c) / set(~c) / cmov(~c)
  12275. }
  12276. begin
  12277. { Keep TEST instruction in, rather than remove it, because
  12278. it may trigger other optimisations such as MovAndTest2Test }
  12279. taicpu(hp1).loadreg(0, taicpu(hp1).oper[1]^.reg);
  12280. taicpu(hp1).opcode := A_TEST;
  12281. DebugMsg(SPeepholeOptimization + 'AND/CMP/J(c) -> AND/J(~c) with power of 2 constant', p);
  12282. taicpu(hp2).condition := inverse_cond(taicpu(hp2).condition);
  12283. Result := True;
  12284. Exit;
  12285. end;
  12286. A_MOVZX:
  12287. if MatchOpType(taicpu(hp1),top_reg,top_reg) and
  12288. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[1]^.reg) and
  12289. (getsupreg(taicpu(hp1).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg)) and
  12290. (
  12291. (
  12292. (taicpu(p).opsize=S_W) and
  12293. (taicpu(hp1).opsize=S_BW)
  12294. ) or
  12295. (
  12296. (taicpu(p).opsize=S_L) and
  12297. (taicpu(hp1).opsize in [S_WL,S_BL{$ifdef x86_64},S_BQ,S_WQ{$endif x86_64}])
  12298. )
  12299. {$ifdef x86_64}
  12300. or
  12301. (
  12302. (taicpu(p).opsize=S_Q) and
  12303. (taicpu(hp1).opsize in [S_BQ,S_WQ,S_BL,S_WL])
  12304. )
  12305. {$endif x86_64}
  12306. ) then
  12307. begin
  12308. if (((taicpu(hp1).opsize) in [S_BW,S_BL{$ifdef x86_64},S_BQ{$endif x86_64}]) and
  12309. ((taicpu(p).oper[0]^.val and $ff)=taicpu(p).oper[0]^.val)
  12310. ) or
  12311. (((taicpu(hp1).opsize) in [S_WL{$ifdef x86_64},S_WQ{$endif x86_64}]) and
  12312. ((taicpu(p).oper[0]^.val and $ffff)=taicpu(p).oper[0]^.val))
  12313. then
  12314. begin
  12315. { Unlike MOVSX, MOVZX doesn't actually have a version that zero-extends a
  12316. 32-bit register to a 64-bit register, or even a version called MOVZXD, so
  12317. code that tests for the presence of AND 0xffffffff followed by MOVZX is
  12318. wasted, and is indictive of a compiler bug if it were triggered. [Kit]
  12319. NOTE: To zero-extend from 32 bits to 64 bits, simply use the standard MOV.
  12320. }
  12321. DebugMsg(SPeepholeOptimization + 'AndMovzToAnd done',p);
  12322. RemoveInstruction(hp1);
  12323. { See if there are other optimisations possible }
  12324. Continue;
  12325. end;
  12326. end;
  12327. A_SHL:
  12328. if MatchOpType(taicpu(hp1),top_const,top_reg) and
  12329. (getsupreg(taicpu(p).oper[1]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg)) then
  12330. begin
  12331. {$ifopt R+}
  12332. {$define RANGE_WAS_ON}
  12333. {$R-}
  12334. {$endif}
  12335. { get length of potential and mask }
  12336. MaskLength:=SizeOf(taicpu(p).oper[0]^.val)*8-BsrQWord(taicpu(p).oper[0]^.val)-1;
  12337. { really a mask? }
  12338. {$ifdef RANGE_WAS_ON}
  12339. {$R+}
  12340. {$endif}
  12341. if (((QWord(1) shl MaskLength)-1)=taicpu(p).oper[0]^.val) and
  12342. { unmasked part shifted out? }
  12343. ((MaskLength+taicpu(hp1).oper[0]^.val)>=topsize2memsize[taicpu(hp1).opsize]) then
  12344. begin
  12345. DebugMsg(SPeepholeOptimization + 'AndShlToShl done',p);
  12346. RemoveCurrentP(p, hp1);
  12347. Result:=true;
  12348. exit;
  12349. end;
  12350. end;
  12351. A_SHR:
  12352. if MatchOpType(taicpu(hp1),top_const,top_reg) and
  12353. (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg) and
  12354. (taicpu(hp1).oper[0]^.val <= 63) then
  12355. begin
  12356. { Does SHR combined with the AND cover all the bits?
  12357. e.g. for "andb $252,%reg; shrb $2,%reg" - the "and" can be removed }
  12358. MaskedBits := taicpu(p).oper[0]^.val or ((TCgInt(1) shl taicpu(hp1).oper[0]^.val) - 1);
  12359. if ((taicpu(p).opsize = S_B) and ((MaskedBits and $FF) = $FF)) or
  12360. ((taicpu(p).opsize = S_W) and ((MaskedBits and $FFFF) = $FFFF)) or
  12361. ((taicpu(p).opsize = S_L) and ((MaskedBits and $FFFFFFFF) = $FFFFFFFF)) then
  12362. begin
  12363. DebugMsg(SPeepholeOptimization + 'AndShrToShr done', p);
  12364. RemoveCurrentP(p, hp1);
  12365. Result := True;
  12366. Exit;
  12367. end;
  12368. end;
  12369. A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  12370. if (taicpu(hp1).oper[0]^.typ = top_reg) and
  12371. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then
  12372. begin
  12373. if SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) and
  12374. (
  12375. (
  12376. (taicpu(hp1).opsize in [S_BW,S_BL{$ifdef x86_64},S_BQ{$endif x86_64}]) and
  12377. ((taicpu(p).oper[0]^.val and $7F) = taicpu(p).oper[0]^.val)
  12378. ) or (
  12379. (taicpu(hp1).opsize in [S_WL{$ifdef x86_64},S_WQ{$endif x86_64}]) and
  12380. ((taicpu(p).oper[0]^.val and $7FFF) = taicpu(p).oper[0]^.val)
  12381. {$ifdef x86_64}
  12382. ) or (
  12383. (taicpu(hp1).opsize = S_LQ) and
  12384. ((taicpu(p).oper[0]^.val and $7fffffff) = taicpu(p).oper[0]^.val)
  12385. {$endif x86_64}
  12386. )
  12387. ) then
  12388. begin
  12389. if (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg){$ifdef x86_64} or (taicpu(hp1).opsize = S_LQ){$endif x86_64} then
  12390. begin
  12391. DebugMsg(SPeepholeOptimization + 'AndMovsxToAnd',p);
  12392. RemoveInstruction(hp1);
  12393. { See if there are other optimisations possible }
  12394. Continue;
  12395. end;
  12396. { The super-registers are the same though.
  12397. Note that this change by itself doesn't improve
  12398. code speed, but it opens up other optimisations. }
  12399. {$ifdef x86_64}
  12400. { Convert 64-bit register to 32-bit }
  12401. case taicpu(hp1).opsize of
  12402. S_BQ:
  12403. begin
  12404. taicpu(hp1).opsize := S_BL;
  12405. taicpu(hp1).oper[1]^.reg := newreg(R_INTREGISTER, getsupreg(taicpu(hp1).oper[1]^.reg), R_SUBD);
  12406. end;
  12407. S_WQ:
  12408. begin
  12409. taicpu(hp1).opsize := S_WL;
  12410. taicpu(hp1).oper[1]^.reg := newreg(R_INTREGISTER, getsupreg(taicpu(hp1).oper[1]^.reg), R_SUBD);
  12411. end
  12412. else
  12413. ;
  12414. end;
  12415. {$endif x86_64}
  12416. DebugMsg(SPeepholeOptimization + 'AndMovsxToAndMovzx', hp1);
  12417. taicpu(hp1).opcode := A_MOVZX;
  12418. { See if there are other optimisations possible }
  12419. Continue;
  12420. end;
  12421. end;
  12422. else
  12423. ;
  12424. end;
  12425. end
  12426. else if MatchOperand(taicpu(p).oper[0]^, taicpu(p).oper[1]^.reg) and
  12427. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  12428. begin
  12429. {$ifdef x86_64}
  12430. if (taicpu(p).opsize = S_Q) then
  12431. begin
  12432. { Never necessary }
  12433. DebugMsg(SPeepholeOptimization + 'Andq2Nop', p);
  12434. RemoveCurrentP(p, hp1);
  12435. Result := True;
  12436. Exit;
  12437. end;
  12438. {$endif x86_64}
  12439. { Forward check to determine necessity of and %reg,%reg }
  12440. TransferUsedRegs(TmpUsedRegs);
  12441. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  12442. { Saves on a bunch of dereferences }
  12443. ActiveReg := taicpu(p).oper[1]^.reg;
  12444. case taicpu(hp1).opcode of
  12445. A_MOV, A_MOVZX, A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  12446. if (
  12447. (taicpu(hp1).oper[0]^.typ <> top_ref) or
  12448. not RegInRef(ActiveReg, taicpu(hp1).oper[0]^.ref^)
  12449. ) and
  12450. (
  12451. (taicpu(hp1).opcode <> A_MOV) or
  12452. (taicpu(hp1).oper[1]^.typ <> top_ref) or
  12453. not RegInRef(ActiveReg, taicpu(hp1).oper[1]^.ref^)
  12454. ) and
  12455. not (
  12456. { If mov %reg,%reg is present, remove that instruction instead in OptPass1MOV }
  12457. (taicpu(hp1).opcode = A_MOV) and
  12458. MatchOperand(taicpu(hp1).oper[0]^, ActiveReg) and
  12459. MatchOperand(taicpu(hp1).oper[1]^, ActiveReg)
  12460. ) and
  12461. (
  12462. (
  12463. (taicpu(hp1).oper[0]^.typ = top_reg) and
  12464. (taicpu(hp1).oper[0]^.reg = ActiveReg) and
  12465. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg)
  12466. ) or
  12467. (
  12468. {$ifdef x86_64}
  12469. (
  12470. { If we read from the register, make sure it's not dependent on the upper 32 bits }
  12471. (taicpu(hp1).oper[0]^.typ <> top_reg) or
  12472. not SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, ActiveReg) or
  12473. (GetSubReg(taicpu(hp1).oper[0]^.reg) <> R_SUBQ)
  12474. ) and
  12475. {$endif x86_64}
  12476. not RegUsedAfterInstruction(ActiveReg, hp1, TmpUsedRegs)
  12477. )
  12478. ) then
  12479. begin
  12480. DebugMsg(SPeepholeOptimization + 'AndMovx2Movx', p);
  12481. RemoveCurrentP(p, hp1);
  12482. Result := True;
  12483. Exit;
  12484. end;
  12485. A_ADD,
  12486. A_AND,
  12487. A_BSF,
  12488. A_BSR,
  12489. A_BTC,
  12490. A_BTR,
  12491. A_BTS,
  12492. A_OR,
  12493. A_SUB,
  12494. A_XOR:
  12495. { Register is written to, so this will clear the upper 32 bits (2-operand instructions) }
  12496. if (
  12497. (taicpu(hp1).oper[0]^.typ <> top_ref) or
  12498. not RegInRef(ActiveReg, taicpu(hp1).oper[0]^.ref^)
  12499. ) and
  12500. MatchOperand(taicpu(hp1).oper[1]^, ActiveReg) then
  12501. begin
  12502. DebugMsg(SPeepholeOptimization + 'AndOp2Op 2', p);
  12503. RemoveCurrentP(p, hp1);
  12504. Result := True;
  12505. Exit;
  12506. end;
  12507. A_CMP,
  12508. A_TEST:
  12509. if (
  12510. (taicpu(hp1).oper[0]^.typ <> top_ref) or
  12511. not RegInRef(ActiveReg, taicpu(hp1).oper[0]^.ref^)
  12512. ) and
  12513. MatchOperand(taicpu(hp1).oper[1]^, ActiveReg) and
  12514. not RegUsedAfterInstruction(ActiveReg, hp1, TmpUsedRegs) then
  12515. begin
  12516. DebugMsg(SPeepholeOptimization + 'AND; CMP/TEST -> CMP/TEST', p);
  12517. RemoveCurrentP(p, hp1);
  12518. Result := True;
  12519. Exit;
  12520. end;
  12521. A_BSWAP,
  12522. A_NEG,
  12523. A_NOT:
  12524. { Register is written to, so this will clear the upper 32 bits (1-operand instructions) }
  12525. if MatchOperand(taicpu(hp1).oper[0]^, ActiveReg) then
  12526. begin
  12527. DebugMsg(SPeepholeOptimization + 'AndOp2Op 1', p);
  12528. RemoveCurrentP(p, hp1);
  12529. Result := True;
  12530. Exit;
  12531. end;
  12532. else
  12533. ;
  12534. end;
  12535. end;
  12536. if (taicpu(hp1).is_jmp) and
  12537. (taicpu(hp1).opcode<>A_JMP) and
  12538. not(RegInUsedRegs(taicpu(p).oper[1]^.reg,UsedRegs)) then
  12539. begin
  12540. { change
  12541. and x, reg
  12542. jxx
  12543. to
  12544. test x, reg
  12545. jxx
  12546. if reg is deallocated before the
  12547. jump, but only if it's a conditional jump (PFV)
  12548. }
  12549. DebugMsg(SPeepholeOptimization + 'AndJcc2TestJcc', p);
  12550. taicpu(p).opcode := A_TEST;
  12551. Exit;
  12552. end;
  12553. Break;
  12554. end;
  12555. { Lone AND tests }
  12556. if (taicpu(p).oper[0]^.typ = top_const) then
  12557. begin
  12558. {
  12559. - Convert and $0xFF,reg to and reg,reg if reg is 8-bit
  12560. - Convert and $0xFFFF,reg to and reg,reg if reg is 16-bit
  12561. - Convert and $0xFFFFFFFF,reg to and reg,reg if reg is 32-bit
  12562. }
  12563. if ((taicpu(p).oper[0]^.val = $FF) and (taicpu(p).opsize = S_B)) or
  12564. ((taicpu(p).oper[0]^.val = $FFFF) and (taicpu(p).opsize = S_W)) or
  12565. ((taicpu(p).oper[0]^.val = $FFFFFFFF) and (taicpu(p).opsize = S_L)) then
  12566. begin
  12567. taicpu(p).loadreg(0, taicpu(p).oper[1]^.reg);
  12568. if taicpu(p).opsize = S_L then
  12569. begin
  12570. Include(OptsToCheck,aoc_MovAnd2Mov_3);
  12571. Result := True;
  12572. end;
  12573. end;
  12574. end;
  12575. { Backward check to determine necessity of and %reg,%reg }
  12576. if (taicpu(p).oper[0]^.typ = top_reg) and
  12577. (taicpu(p).oper[0]^.reg = taicpu(p).oper[1]^.reg) and
  12578. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  12579. GetLastInstruction(p, hp2) and
  12580. RegModifiedByInstruction(taicpu(p).oper[1]^.reg, hp2) and
  12581. { Check size of adjacent instruction to determine if the AND is
  12582. effectively a null operation }
  12583. (
  12584. (taicpu(p).opsize = taicpu(hp2).opsize) or
  12585. { Note: Don't include S_Q }
  12586. ((taicpu(p).opsize = S_L) and (taicpu(hp2).opsize in [S_BL, S_WL])) or
  12587. ((taicpu(p).opsize = S_W) and (taicpu(hp2).opsize in [S_BW, S_BL, S_WL, S_L])) or
  12588. ((taicpu(p).opsize = S_B) and (taicpu(hp2).opsize in [S_BW, S_BL, S_WL, S_W, S_L]))
  12589. ) then
  12590. begin
  12591. DebugMsg(SPeepholeOptimization + 'And2Nop', p);
  12592. { If GetNextInstruction returned False, hp1 will be nil }
  12593. RemoveCurrentP(p, hp1);
  12594. Result := True;
  12595. Exit;
  12596. end;
  12597. end;
  12598. function TX86AsmOptimizer.OptPass2ADD(var p : tai) : boolean;
  12599. var
  12600. hp1, hp2: tai;
  12601. NewRef: TReference;
  12602. Distance: Cardinal;
  12603. TempTracking: TAllUsedRegs;
  12604. { This entire nested function is used in an if-statement below, but we
  12605. want to avoid all the used reg transfers and GetNextInstruction calls
  12606. until we really have to check }
  12607. function MemRegisterNotUsedLater: Boolean; inline;
  12608. var
  12609. hp2: tai;
  12610. begin
  12611. TransferUsedRegs(TmpUsedRegs);
  12612. hp2 := p;
  12613. repeat
  12614. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  12615. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12616. Result := not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs);
  12617. end;
  12618. begin
  12619. Result := False;
  12620. if (taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif}]) and
  12621. (taicpu(p).oper[1]^.typ = top_reg) then
  12622. begin
  12623. Distance := GetNextInstructionUsingRegCount(p, hp1, taicpu(p).oper[1]^.reg);
  12624. if (Distance = 0) or (Distance > 3) { Likely too far to make a meaningful difference } or
  12625. (hp1.typ <> ait_instruction) or
  12626. not
  12627. (
  12628. (cs_opt_level3 in current_settings.optimizerswitches) or
  12629. { GetNextInstructionUsingRegCount just returns the next valid instruction under -O2 and under }
  12630. RegInInstruction(taicpu(p).oper[1]^.reg, hp1)
  12631. ) then
  12632. Exit;
  12633. { Some of the MOV optimisations are much more in-depth. For example, if we have:
  12634. addq $x, %rax
  12635. movq %rax, %rdx
  12636. sarq $63, %rdx
  12637. (%rax still in use)
  12638. ...letting OptPass2ADD run its course (and without -Os) will produce:
  12639. leaq $x(%rax),%rdx
  12640. addq $x, %rax
  12641. sarq $63, %rdx
  12642. ...which is okay since it breaks the dependency chain between
  12643. addq and movq, but if OptPass2MOV is called first:
  12644. addq $x, %rax
  12645. cqto
  12646. ...which is better in all ways, taking only 2 cycles to execute
  12647. and much smaller in code size.
  12648. }
  12649. { The extra register tracking is quite strenuous }
  12650. if (cs_opt_level2 in current_settings.optimizerswitches) and
  12651. MatchInstruction(hp1, A_MOV, []) then
  12652. begin
  12653. { Update the register tracking to the MOV instruction }
  12654. CopyUsedRegs(TempTracking);
  12655. hp2 := p;
  12656. repeat
  12657. UpdateUsedRegs(tai(hp2.Next));
  12658. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12659. { if hp1 <> hp2 after the call, then hp1 got removed, so let
  12660. OptPass2ADD get called again }
  12661. if OptPass2MOV(hp1) and (hp1 <> hp2) then
  12662. begin
  12663. { Reset the tracking to the current instruction }
  12664. RestoreUsedRegs(TempTracking);
  12665. ReleaseUsedRegs(TempTracking);
  12666. Result := True;
  12667. Exit;
  12668. end;
  12669. { Reset the tracking to the current instruction }
  12670. RestoreUsedRegs(TempTracking);
  12671. ReleaseUsedRegs(TempTracking);
  12672. { If OptPass2MOV returned True, we don't need to set Result to
  12673. True if hp1 didn't change because the ADD instruction didn't
  12674. get modified and we'll be evaluating hp1 again when the
  12675. peephole optimizer reaches it }
  12676. end;
  12677. { Change:
  12678. add %reg2,%reg1
  12679. (%reg2 not modified in between)
  12680. mov/s/z #(%reg1),%reg1 (%reg1 superregisters must be the same)
  12681. To:
  12682. mov/s/z #(%reg1,%reg2),%reg1
  12683. }
  12684. if (taicpu(p).oper[0]^.typ = top_reg) and
  12685. MatchInstruction(hp1, [A_MOV, A_MOVZX, A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif}], []) and
  12686. MatchOpType(taicpu(hp1), top_ref, top_reg) and
  12687. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 1) and
  12688. (
  12689. (
  12690. (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  12691. (taicpu(hp1).oper[0]^.ref^.index = NR_NO) and
  12692. { r/esp cannot be an index }
  12693. (taicpu(p).oper[0]^.reg<>NR_STACK_POINTER_REG)
  12694. ) or (
  12695. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  12696. (taicpu(hp1).oper[0]^.ref^.base = NR_NO)
  12697. )
  12698. ) and (
  12699. Reg1WriteOverwritesReg2Entirely(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) or
  12700. (
  12701. { If the super registers ARE equal, then this MOV/S/Z does a partial write }
  12702. not SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) and
  12703. MemRegisterNotUsedLater
  12704. )
  12705. ) then
  12706. begin
  12707. if (
  12708. { Instructions are guaranteed to be adjacent on -O2 and under }
  12709. (cs_opt_level3 in current_settings.optimizerswitches) and
  12710. RegModifiedBetween(taicpu(p).oper[0]^.reg, p, hp1)
  12711. ) then
  12712. begin
  12713. { If the other register is used in between, move the MOV
  12714. instruction to right after the ADD instruction so a
  12715. saving can still be made }
  12716. Asml.Remove(hp1);
  12717. Asml.InsertAfter(hp1, p);
  12718. taicpu(hp1).oper[0]^.ref^.base := taicpu(p).oper[1]^.reg;
  12719. taicpu(hp1).oper[0]^.ref^.index := taicpu(p).oper[0]^.reg;
  12720. DebugMsg(SPeepholeOptimization + 'AddMov2Mov done (instruction moved)', p);
  12721. RemoveCurrentp(p, hp1);
  12722. end
  12723. else
  12724. begin
  12725. AllocRegBetween(taicpu(p).oper[0]^.reg, p, hp1, UsedRegs);
  12726. taicpu(hp1).oper[0]^.ref^.base := taicpu(p).oper[1]^.reg;
  12727. taicpu(hp1).oper[0]^.ref^.index := taicpu(p).oper[0]^.reg;
  12728. DebugMsg(SPeepholeOptimization + 'AddMov2Mov done', p);
  12729. if (cs_opt_level3 in current_settings.optimizerswitches) then
  12730. { hp1 may not be the immediate next instruction under -O3 }
  12731. RemoveCurrentp(p)
  12732. else
  12733. RemoveCurrentp(p, hp1);
  12734. end;
  12735. Result := True;
  12736. Exit;
  12737. end;
  12738. { Change:
  12739. addl/q $x,%reg1
  12740. movl/q %reg1,%reg2
  12741. To:
  12742. leal/q $x(%reg1),%reg2
  12743. addl/q $x,%reg1 (can be removed if %reg1 or the flags are not used afterwards)
  12744. Breaks the dependency chain.
  12745. }
  12746. if (taicpu(p).oper[0]^.typ = top_const) and
  12747. MatchInstruction(hp1, A_MOV, [taicpu(p).opsize]) and
  12748. (taicpu(hp1).oper[1]^.typ = top_reg) and
  12749. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) and
  12750. (
  12751. { Instructions are guaranteed to be adjacent on -O2 and under }
  12752. not (cs_opt_level3 in current_settings.optimizerswitches) or
  12753. not RegUsedBetween(taicpu(hp1).oper[1]^.reg, p, hp1)
  12754. ) then
  12755. begin
  12756. TransferUsedRegs(TmpUsedRegs);
  12757. hp2 := p;
  12758. repeat
  12759. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  12760. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12761. if (
  12762. { Don't do AddMov2LeaAdd under -Os, but do allow AddMov2Lea }
  12763. not (cs_opt_size in current_settings.optimizerswitches) or
  12764. (
  12765. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) and
  12766. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)
  12767. )
  12768. ) then
  12769. begin
  12770. { Change the MOV instruction to a LEA instruction, and update the
  12771. first operand }
  12772. reference_reset(NewRef, 1, []);
  12773. NewRef.base := taicpu(p).oper[1]^.reg;
  12774. NewRef.scalefactor := 1;
  12775. NewRef.offset := asizeint(taicpu(p).oper[0]^.val);
  12776. taicpu(hp1).opcode := A_LEA;
  12777. taicpu(hp1).loadref(0, NewRef);
  12778. if RegUsedAfterInstruction(NewRef.base, hp1, TmpUsedRegs) or
  12779. RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs) then
  12780. begin
  12781. hp2 := tai(hp1.Next); { for the benefit of AllocRegBetween }
  12782. { Move what is now the LEA instruction to before the ADD instruction }
  12783. Asml.Remove(hp1);
  12784. Asml.InsertBefore(hp1, p);
  12785. AllocRegBetween(taicpu(hp1).oper[1]^.reg, hp1, hp2, UsedRegs);
  12786. DebugMsg(SPeepholeOptimization + 'AddMov2LeaAdd', p);
  12787. p := hp1;
  12788. end
  12789. else
  12790. begin
  12791. { Since %reg1 or the flags aren't used afterwards, we can delete p completely }
  12792. DebugMsg(SPeepholeOptimization + 'AddMov2Lea', hp1);
  12793. if (cs_opt_level3 in current_settings.optimizerswitches) then
  12794. { hp1 may not be the immediate next instruction under -O3 }
  12795. RemoveCurrentp(p)
  12796. else
  12797. RemoveCurrentp(p, hp1);
  12798. end;
  12799. Result := True;
  12800. end;
  12801. end;
  12802. end;
  12803. end;
  12804. function TX86AsmOptimizer.OptPass2Lea(var p : tai) : Boolean;
  12805. var
  12806. SubReg: TSubRegister;
  12807. begin
  12808. Result:=false;
  12809. SubReg := getsubreg(taicpu(p).oper[1]^.reg);
  12810. if not (RegInUsedRegs(NR_DEFAULTFLAGS,UsedRegs)) then
  12811. with taicpu(p).oper[0]^.ref^ do
  12812. if (offset = 0) and not Assigned(symbol) and not Assigned(relsymbol) and (index <> NR_NO) then
  12813. begin
  12814. if (scalefactor <= 1) and SuperRegistersEqual(base, taicpu(p).oper[1]^.reg) then
  12815. begin
  12816. taicpu(p).loadreg(0, newreg(R_INTREGISTER, getsupreg(index), SubReg));
  12817. taicpu(p).opcode := A_ADD;
  12818. DebugMsg(SPeepholeOptimization + 'Lea2AddBase done',p);
  12819. Result := True;
  12820. end
  12821. else if SuperRegistersEqual(index, taicpu(p).oper[1]^.reg) then
  12822. begin
  12823. if (base <> NR_NO) then
  12824. begin
  12825. if (scalefactor <= 1) then
  12826. begin
  12827. taicpu(p).loadreg(0, newreg(R_INTREGISTER, getsupreg(base), SubReg));
  12828. taicpu(p).opcode := A_ADD;
  12829. DebugMsg(SPeepholeOptimization + 'Lea2AddIndex done',p);
  12830. Result := True;
  12831. end;
  12832. end
  12833. else
  12834. { Convert lea (%reg,2^x),%reg to shl x,%reg }
  12835. if (scalefactor in [2, 4, 8]) then
  12836. begin
  12837. { BsrByte is, in essence, the base-2 logarithm of the scale factor }
  12838. taicpu(p).loadconst(0, BsrByte(scalefactor));
  12839. taicpu(p).opcode := A_SHL;
  12840. DebugMsg(SPeepholeOptimization + 'Lea2Shl done',p);
  12841. Result := True;
  12842. end;
  12843. end;
  12844. end;
  12845. end;
  12846. function TX86AsmOptimizer.OptPass2SUB(var p: tai): Boolean;
  12847. var
  12848. hp1, hp2: tai;
  12849. NewRef: TReference;
  12850. Distance: Cardinal;
  12851. TempTracking: TAllUsedRegs;
  12852. begin
  12853. Result := False;
  12854. if (taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif}]) and
  12855. MatchOpType(taicpu(p),top_const,top_reg) then
  12856. begin
  12857. Distance := GetNextInstructionUsingRegCount(p, hp1, taicpu(p).oper[1]^.reg);
  12858. if (Distance = 0) or (Distance > 3) { Likely too far to make a meaningful difference } or
  12859. (hp1.typ <> ait_instruction) or
  12860. not
  12861. (
  12862. (cs_opt_level3 in current_settings.optimizerswitches) or
  12863. { GetNextInstructionUsingRegCount just returns the next valid instruction under -O2 and under }
  12864. RegInInstruction(taicpu(p).oper[1]^.reg, hp1)
  12865. ) then
  12866. Exit;
  12867. { Some of the MOV optimisations are much more in-depth. For example, if we have:
  12868. subq $x, %rax
  12869. movq %rax, %rdx
  12870. sarq $63, %rdx
  12871. (%rax still in use)
  12872. ...letting OptPass2SUB run its course (and without -Os) will produce:
  12873. leaq $-x(%rax),%rdx
  12874. movq $x, %rax
  12875. sarq $63, %rdx
  12876. ...which is okay since it breaks the dependency chain between
  12877. subq and movq, but if OptPass2MOV is called first:
  12878. subq $x, %rax
  12879. cqto
  12880. ...which is better in all ways, taking only 2 cycles to execute
  12881. and much smaller in code size.
  12882. }
  12883. { The extra register tracking is quite strenuous }
  12884. if (cs_opt_level2 in current_settings.optimizerswitches) and
  12885. MatchInstruction(hp1, A_MOV, []) then
  12886. begin
  12887. { Update the register tracking to the MOV instruction }
  12888. CopyUsedRegs(TempTracking);
  12889. hp2 := p;
  12890. repeat
  12891. UpdateUsedRegs(tai(hp2.Next));
  12892. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12893. { if hp1 <> hp2 after the call, then hp1 got removed, so let
  12894. OptPass2SUB get called again }
  12895. if OptPass2MOV(hp1) and (hp1 <> hp2) then
  12896. begin
  12897. { Reset the tracking to the current instruction }
  12898. RestoreUsedRegs(TempTracking);
  12899. ReleaseUsedRegs(TempTracking);
  12900. Result := True;
  12901. Exit;
  12902. end;
  12903. { Reset the tracking to the current instruction }
  12904. RestoreUsedRegs(TempTracking);
  12905. ReleaseUsedRegs(TempTracking);
  12906. { If OptPass2MOV returned True, we don't need to set Result to
  12907. True if hp1 didn't change because the SUB instruction didn't
  12908. get modified and we'll be evaluating hp1 again when the
  12909. peephole optimizer reaches it }
  12910. end;
  12911. { Change:
  12912. subl/q $x,%reg1
  12913. movl/q %reg1,%reg2
  12914. To:
  12915. leal/q $-x(%reg1),%reg2
  12916. subl/q $x,%reg1 (can be removed if %reg1 or the flags are not used afterwards)
  12917. Breaks the dependency chain and potentially permits the removal of
  12918. a CMP instruction if one follows.
  12919. }
  12920. if MatchInstruction(hp1, A_MOV, [taicpu(p).opsize]) and
  12921. (taicpu(hp1).oper[1]^.typ = top_reg) and
  12922. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) and
  12923. (
  12924. { Instructions are guaranteed to be adjacent on -O2 and under }
  12925. not (cs_opt_level3 in current_settings.optimizerswitches) or
  12926. not RegUsedBetween(taicpu(hp1).oper[1]^.reg, p, hp1)
  12927. ) then
  12928. begin
  12929. TransferUsedRegs(TmpUsedRegs);
  12930. hp2 := p;
  12931. repeat
  12932. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  12933. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12934. if (
  12935. { Don't do SubMov2LeaSub under -Os, but do allow SubMov2Lea }
  12936. not (cs_opt_size in current_settings.optimizerswitches) or
  12937. (
  12938. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) and
  12939. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)
  12940. )
  12941. ) then
  12942. begin
  12943. { Change the MOV instruction to a LEA instruction, and update the
  12944. first operand }
  12945. reference_reset(NewRef, 1, []);
  12946. NewRef.base := taicpu(p).oper[1]^.reg;
  12947. NewRef.scalefactor := 1;
  12948. NewRef.offset := -taicpu(p).oper[0]^.val;
  12949. taicpu(hp1).opcode := A_LEA;
  12950. taicpu(hp1).loadref(0, NewRef);
  12951. TransferUsedRegs(TmpUsedRegs);
  12952. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  12953. if RegUsedAfterInstruction(NewRef.base, hp1, TmpUsedRegs) or
  12954. RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs) then
  12955. begin
  12956. hp2 := tai(hp1.Next); { for the benefit of AllocRegBetween }
  12957. { Move what is now the LEA instruction to before the SUB instruction }
  12958. Asml.Remove(hp1);
  12959. Asml.InsertBefore(hp1, p);
  12960. AllocRegBetween(taicpu(hp1).oper[1]^.reg, hp1, hp2, UsedRegs);
  12961. DebugMsg(SPeepholeOptimization + 'SubMov2LeaSub', p);
  12962. p := hp1;
  12963. end
  12964. else
  12965. begin
  12966. { Since %reg1 or the flags aren't used afterwards, we can delete p completely }
  12967. DebugMsg(SPeepholeOptimization + 'SubMov2Lea', hp1);
  12968. if (cs_opt_level3 in current_settings.optimizerswitches) then
  12969. { hp1 may not be the immediate next instruction under -O3 }
  12970. RemoveCurrentp(p)
  12971. else
  12972. RemoveCurrentp(p, hp1);
  12973. end;
  12974. Result := True;
  12975. end;
  12976. end;
  12977. end;
  12978. end;
  12979. function TX86AsmOptimizer.SkipSimpleInstructions(var hp1 : tai) : Boolean;
  12980. begin
  12981. { we can skip all instructions not messing with the stack pointer }
  12982. while assigned(hp1) and {MatchInstruction(hp1,[A_LEA,A_MOV,A_MOVQ,A_MOVSQ,A_MOVSX,A_MOVSXD,A_MOVZX,
  12983. A_AND,A_OR,A_XOR,A_ADD,A_SHR,A_SHL,A_IMUL,A_SETcc,A_SAR,A_SUB,A_TEST,A_CMOVcc,
  12984. A_MOVSS,A_MOVSD,A_MOVAPS,A_MOVUPD,A_MOVAPD,A_MOVUPS,
  12985. A_VMOVSS,A_VMOVSD,A_VMOVAPS,A_VMOVUPD,A_VMOVAPD,A_VMOVUPS],[]) and}
  12986. ({(taicpu(hp1).ops=0) or }
  12987. ({(MatchOpType(taicpu(hp1),top_reg,top_reg) or MatchOpType(taicpu(hp1),top_const,top_reg) or
  12988. (MatchOpType(taicpu(hp1),top_ref,top_reg))
  12989. ) and }
  12990. not(RegInInstruction(NR_STACK_POINTER_REG,hp1)) { and not(RegInInstruction(NR_FRAME_POINTER_REG,hp1))}
  12991. )
  12992. ) do
  12993. GetNextInstruction(hp1,hp1);
  12994. Result:=assigned(hp1);
  12995. end;
  12996. function TX86AsmOptimizer.PostPeepholeOptLea(var p : tai) : Boolean;
  12997. var
  12998. hp1, hp2, hp3, hp4, hp5: tai;
  12999. begin
  13000. Result:=false;
  13001. hp5:=nil;
  13002. { replace
  13003. leal(q) x(<stackpointer>),<stackpointer>
  13004. call procname
  13005. leal(q) -x(<stackpointer>),<stackpointer>
  13006. ret
  13007. by
  13008. jmp procname
  13009. but do it only on level 4 because it destroys stack back traces
  13010. }
  13011. if (cs_opt_level4 in current_settings.optimizerswitches) and
  13012. MatchOpType(taicpu(p),top_ref,top_reg) and
  13013. (taicpu(p).oper[0]^.ref^.base=NR_STACK_POINTER_REG) and
  13014. (taicpu(p).oper[0]^.ref^.index=NR_NO) and
  13015. { the -8 or -24 are not required, but bail out early if possible,
  13016. higher values are unlikely }
  13017. ((taicpu(p).oper[0]^.ref^.offset=-8) or
  13018. (taicpu(p).oper[0]^.ref^.offset=-24)) and
  13019. (taicpu(p).oper[0]^.ref^.symbol=nil) and
  13020. (taicpu(p).oper[0]^.ref^.relsymbol=nil) and
  13021. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG) and
  13022. GetNextInstruction(p, hp1) and
  13023. { Take a copy of hp1 }
  13024. SetAndTest(hp1, hp4) and
  13025. { trick to skip label }
  13026. ((hp1.typ=ait_instruction) or GetNextInstruction(hp1, hp1)) and
  13027. SkipSimpleInstructions(hp1) and
  13028. MatchInstruction(hp1,A_CALL,[S_NO]) and
  13029. GetNextInstruction(hp1, hp2) and
  13030. MatchInstruction(hp2,A_LEA,[taicpu(p).opsize]) and
  13031. MatchOpType(taicpu(hp2),top_ref,top_reg) and
  13032. (taicpu(hp2).oper[0]^.ref^.offset=-taicpu(p).oper[0]^.ref^.offset) and
  13033. (taicpu(hp2).oper[0]^.ref^.base=NR_STACK_POINTER_REG) and
  13034. (taicpu(hp2).oper[0]^.ref^.index=NR_NO) and
  13035. (taicpu(hp2).oper[0]^.ref^.symbol=nil) and
  13036. (taicpu(hp2).oper[0]^.ref^.relsymbol=nil) and
  13037. { Segment register will be NR_NO }
  13038. (taicpu(hp2).oper[1]^.reg=NR_STACK_POINTER_REG) and
  13039. GetNextInstruction(hp2, hp3) and
  13040. { trick to skip label }
  13041. ((hp3.typ=ait_instruction) or GetNextInstruction(hp3, hp3)) and
  13042. (MatchInstruction(hp3,A_RET,[S_NO]) or
  13043. (MatchInstruction(hp3,A_VZEROUPPER,[S_NO]) and
  13044. SetAndTest(hp3,hp5) and
  13045. GetNextInstruction(hp3,hp3) and
  13046. MatchInstruction(hp3,A_RET,[S_NO])
  13047. )
  13048. ) and
  13049. (taicpu(hp3).ops=0) then
  13050. begin
  13051. taicpu(hp1).opcode := A_JMP;
  13052. taicpu(hp1).is_jmp := true;
  13053. DebugMsg(SPeepholeOptimization + 'LeaCallLeaRet2Jmp done',p);
  13054. RemoveCurrentP(p, hp4);
  13055. RemoveInstruction(hp2);
  13056. RemoveInstruction(hp3);
  13057. if Assigned(hp5) then
  13058. begin
  13059. AsmL.Remove(hp5);
  13060. ASmL.InsertBefore(hp5,hp1)
  13061. end;
  13062. Result:=true;
  13063. end;
  13064. end;
  13065. function TX86AsmOptimizer.PostPeepholeOptPush(var p : tai) : Boolean;
  13066. {$ifdef x86_64}
  13067. var
  13068. hp1, hp2, hp3, hp4, hp5: tai;
  13069. {$endif x86_64}
  13070. begin
  13071. Result:=false;
  13072. {$ifdef x86_64}
  13073. hp5:=nil;
  13074. { replace
  13075. push %rax
  13076. call procname
  13077. pop %rcx
  13078. ret
  13079. by
  13080. jmp procname
  13081. but do it only on level 4 because it destroys stack back traces
  13082. It depends on the fact, that the sequence push rax/pop rcx is used for stack alignment as rcx is volatile
  13083. for all supported calling conventions
  13084. }
  13085. if (cs_opt_level4 in current_settings.optimizerswitches) and
  13086. MatchOpType(taicpu(p),top_reg) and
  13087. (taicpu(p).oper[0]^.reg=NR_RAX) and
  13088. GetNextInstruction(p, hp1) and
  13089. { Take a copy of hp1 }
  13090. SetAndTest(hp1, hp4) and
  13091. { trick to skip label }
  13092. ((hp1.typ=ait_instruction) or GetNextInstruction(hp1, hp1)) and
  13093. SkipSimpleInstructions(hp1) and
  13094. MatchInstruction(hp1,A_CALL,[S_NO]) and
  13095. GetNextInstruction(hp1, hp2) and
  13096. MatchInstruction(hp2,A_POP,[taicpu(p).opsize]) and
  13097. MatchOpType(taicpu(hp2),top_reg) and
  13098. (taicpu(hp2).oper[0]^.reg=NR_RCX) and
  13099. GetNextInstruction(hp2, hp3) and
  13100. { trick to skip label }
  13101. ((hp3.typ=ait_instruction) or GetNextInstruction(hp3, hp3)) and
  13102. (MatchInstruction(hp3,A_RET,[S_NO]) or
  13103. (MatchInstruction(hp3,A_VZEROUPPER,[S_NO]) and
  13104. SetAndTest(hp3,hp5) and
  13105. GetNextInstruction(hp3,hp3) and
  13106. MatchInstruction(hp3,A_RET,[S_NO])
  13107. )
  13108. ) and
  13109. (taicpu(hp3).ops=0) then
  13110. begin
  13111. taicpu(hp1).opcode := A_JMP;
  13112. taicpu(hp1).is_jmp := true;
  13113. DebugMsg(SPeepholeOptimization + 'PushCallPushRet2Jmp done',p);
  13114. RemoveCurrentP(p, hp4);
  13115. RemoveInstruction(hp2);
  13116. RemoveInstruction(hp3);
  13117. if Assigned(hp5) then
  13118. begin
  13119. AsmL.Remove(hp5);
  13120. ASmL.InsertBefore(hp5,hp1)
  13121. end;
  13122. Result:=true;
  13123. end;
  13124. {$endif x86_64}
  13125. end;
  13126. function TX86AsmOptimizer.PostPeepholeOptMov(var p : tai) : Boolean;
  13127. var
  13128. Value, RegName: string;
  13129. begin
  13130. Result:=false;
  13131. if (taicpu(p).oper[1]^.typ = top_reg) and (taicpu(p).oper[0]^.typ = top_const) then
  13132. begin
  13133. case taicpu(p).oper[0]^.val of
  13134. 0:
  13135. { Don't make this optimisation if the CPU flags are required, since XOR scrambles them }
  13136. if not (RegInUsedRegs(NR_DEFAULTFLAGS,UsedRegs)) then
  13137. begin
  13138. { change "mov $0,%reg" into "xor %reg,%reg" }
  13139. taicpu(p).opcode := A_XOR;
  13140. taicpu(p).loadReg(0,taicpu(p).oper[1]^.reg);
  13141. Result := True;
  13142. {$ifdef x86_64}
  13143. end
  13144. else if (taicpu(p).opsize = S_Q) then
  13145. begin
  13146. RegName := debug_regname(taicpu(p).oper[1]^.reg); { 64-bit register name }
  13147. { The actual optimization }
  13148. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  13149. taicpu(p).changeopsize(S_L);
  13150. DebugMsg(SPeepholeOptimization + 'movq $0,' + RegName + ' -> movl $0,' + debug_regname(taicpu(p).oper[1]^.reg) + ' (immediate can be represented with just 32 bits)', p);
  13151. Result := True;
  13152. end;
  13153. $1..$FFFFFFFF:
  13154. begin
  13155. { Code size reduction by J. Gareth "Kit" Moreton }
  13156. { change 64-bit register to 32-bit register to reduce code size (upper 32 bits will be set to zero) }
  13157. case taicpu(p).opsize of
  13158. S_Q:
  13159. begin
  13160. RegName := debug_regname(taicpu(p).oper[1]^.reg); { 64-bit register name }
  13161. Value := debug_tostr(taicpu(p).oper[0]^.val);
  13162. { The actual optimization }
  13163. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  13164. taicpu(p).changeopsize(S_L);
  13165. DebugMsg(SPeepholeOptimization + 'movq $' + Value + ',' + RegName + ' -> movl $' + Value + ',' + debug_regname(taicpu(p).oper[1]^.reg) + ' (immediate can be represented with just 32 bits)', p);
  13166. Result := True;
  13167. end;
  13168. else
  13169. { Do nothing };
  13170. end;
  13171. {$endif x86_64}
  13172. end;
  13173. -1:
  13174. { Don't make this optimisation if the CPU flags are required, since OR scrambles them }
  13175. if (cs_opt_size in current_settings.optimizerswitches) and
  13176. (taicpu(p).opsize <> S_B) and
  13177. not (RegInUsedRegs(NR_DEFAULTFLAGS,UsedRegs)) then
  13178. begin
  13179. { change "mov $-1,%reg" into "or $-1,%reg" }
  13180. { NOTES:
  13181. - No size saving is made when changing a Word-sized assignment unless the register is AX (smaller encoding)
  13182. - This operation creates a false dependency on the register, so only do it when optimising for size
  13183. - 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
  13184. }
  13185. taicpu(p).opcode := A_OR;
  13186. DebugMsg(SPeepholeOptimization + 'Mov-12Or-1',p);
  13187. Result := True;
  13188. end;
  13189. else
  13190. { Do nothing };
  13191. end;
  13192. end;
  13193. end;
  13194. { Returns true if the given logic instruction can be converted into a BTx instruction (BT not included) }
  13195. class function TX86AsmOptimizer.IsBTXAcceptable(p : tai) : boolean;
  13196. begin
  13197. Result := False;
  13198. if not (CPUX86_HAS_BTX in cpu_capabilities[current_settings.optimizecputype]) then
  13199. Exit;
  13200. { For sizes less than S_L, the byte size is equal or larger with BTx,
  13201. so don't bother optimising }
  13202. if not MatchInstruction(p, A_AND, A_OR, A_XOR, [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  13203. Exit;
  13204. if (taicpu(p).oper[0]^.typ <> top_const) or
  13205. { If the value can fit into an 8-bit signed integer, a smaller
  13206. instruction can be encoded with AND/OR/XOR, so don't optimise if it
  13207. falls within this range }
  13208. (
  13209. (taicpu(p).oper[0]^.val > -128) and
  13210. (taicpu(p).oper[0]^.val <= 127)
  13211. ) then
  13212. Exit;
  13213. { If we're optimising for size, this is acceptable }
  13214. if (cs_opt_size in current_settings.optimizerswitches) then
  13215. Exit(True);
  13216. if (taicpu(p).oper[1]^.typ = top_reg) and
  13217. (CPUX86_HINT_FAST_BTX_REG_IMM in cpu_optimization_hints[current_settings.optimizecputype]) then
  13218. Exit(True);
  13219. if (taicpu(p).oper[1]^.typ <> top_reg) and
  13220. (CPUX86_HINT_FAST_BTX_MEM_IMM in cpu_optimization_hints[current_settings.optimizecputype]) then
  13221. Exit(True);
  13222. end;
  13223. function TX86AsmOptimizer.PostPeepholeOptAnd(var p : tai) : boolean;
  13224. var
  13225. hp1: tai;
  13226. Value: TCGInt;
  13227. begin
  13228. Result := False;
  13229. if MatchOpType(taicpu(p), top_const, top_reg) then
  13230. begin
  13231. { Detect:
  13232. andw x, %ax (0 <= x < $8000)
  13233. ...
  13234. movzwl %ax,%eax
  13235. Change movzwl %ax,%eax to cwtl (shorter encoding for movswl %ax,%eax)
  13236. }
  13237. if (taicpu(p).oper[1]^.reg = NR_AX) and { This is also enough to determine that opsize = S_W }
  13238. ((taicpu(p).oper[0]^.val and $7FFF) = taicpu(p).oper[0]^.val) and
  13239. GetNextInstructionUsingReg(p, hp1, NR_EAX) and
  13240. MatchInstruction(hp1, A_MOVZX, [S_WL]) and
  13241. MatchOperand(taicpu(hp1).oper[0]^, NR_AX) and
  13242. MatchOperand(taicpu(hp1).oper[1]^, NR_EAX) then
  13243. begin
  13244. DebugMsg(SPeepholeOptimization + 'Converted movzwl %ax,%eax to cwtl (via AndMovz2AndCwtl)', hp1);
  13245. taicpu(hp1).opcode := A_CWDE;
  13246. taicpu(hp1).clearop(0);
  13247. taicpu(hp1).clearop(1);
  13248. taicpu(hp1).ops := 0;
  13249. { A change was made, but not with p, so move forward 1 }
  13250. p := tai(p.Next);
  13251. Result := True;
  13252. Exit; { and -> btr won't happen because an opsize of S_W won't be optimised anyway }
  13253. end;
  13254. end;
  13255. { If "not x" is a power of 2 (popcnt = 1), change:
  13256. and $x, %reg/ref
  13257. To:
  13258. btr lb(x), %reg/ref
  13259. }
  13260. if IsBTXAcceptable(p) and
  13261. (
  13262. { Make sure a TEST doesn't follow that plays with the register }
  13263. not GetNextInstruction(p, hp1) or
  13264. not MatchInstruction(hp1, A_TEST, A_CMP, [taicpu(p).opsize]) or
  13265. not MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg)
  13266. ) then
  13267. begin
  13268. {$push}{$R-}{$Q-}
  13269. { Value is a sign-extended 32-bit integer - just correct it
  13270. if it's represented as an unsigned value. Also, IsBTXAcceptable
  13271. checks to see if this operand is an immediate. }
  13272. Value := not taicpu(p).oper[0]^.val;
  13273. {$pop}
  13274. {$ifdef x86_64}
  13275. if taicpu(p).opsize = S_L then
  13276. {$endif x86_64}
  13277. Value := Value and $FFFFFFFF;
  13278. if (PopCnt(QWord(Value)) = 1) then
  13279. begin
  13280. DebugMsg(SPeepholeOptimization + 'Changed AND (not $' + debug_hexstr(taicpu(p).oper[0]^.val) + ') to BTR $' + debug_tostr(BsrQWord(Value)) + ' to shrink instruction size (And2Btr)', p);
  13281. taicpu(p).opcode := A_BTR;
  13282. taicpu(p).oper[0]^.val := BsrQWord(Value); { Essentially the base 2 logarithm }
  13283. Result := True;
  13284. Exit;
  13285. end;
  13286. end;
  13287. end;
  13288. function TX86AsmOptimizer.PostPeepholeOptMOVSX(var p : tai) : boolean;
  13289. begin
  13290. Result := False;
  13291. if not MatchOpType(taicpu(p), top_reg, top_reg) then
  13292. Exit;
  13293. { Convert:
  13294. movswl %ax,%eax -> cwtl
  13295. movslq %eax,%rax -> cdqe
  13296. NOTE: Don't convert movswl %al,%ax to cbw, because cbw and cwde
  13297. refer to the same opcode and depends only on the assembler's
  13298. current operand-size attribute. [Kit]
  13299. }
  13300. with taicpu(p) do
  13301. case opsize of
  13302. S_WL:
  13303. if (oper[0]^.reg = NR_AX) and (oper[1]^.reg = NR_EAX) then
  13304. begin
  13305. DebugMsg(SPeepholeOptimization + 'Converted movswl %ax,%eax to cwtl', p);
  13306. opcode := A_CWDE;
  13307. clearop(0);
  13308. clearop(1);
  13309. ops := 0;
  13310. Result := True;
  13311. end;
  13312. {$ifdef x86_64}
  13313. S_LQ:
  13314. if (oper[0]^.reg = NR_EAX) and (oper[1]^.reg = NR_RAX) then
  13315. begin
  13316. DebugMsg(SPeepholeOptimization + 'Converted movslq %eax,%rax to cltq', p);
  13317. opcode := A_CDQE;
  13318. clearop(0);
  13319. clearop(1);
  13320. ops := 0;
  13321. Result := True;
  13322. end;
  13323. {$endif x86_64}
  13324. else
  13325. ;
  13326. end;
  13327. end;
  13328. function TX86AsmOptimizer.PostPeepholeOptShr(var p : tai) : boolean;
  13329. var
  13330. hp1, hp2: tai;
  13331. IdentityMask, Shift: TCGInt;
  13332. LimitSize: Topsize;
  13333. DoNotMerge: Boolean;
  13334. begin
  13335. Result := False;
  13336. { All these optimisations work on "shr const,%reg" }
  13337. if not MatchOpType(taicpu(p), top_const, top_reg) then
  13338. Exit;
  13339. DoNotMerge := False;
  13340. Shift := taicpu(p).oper[0]^.val;
  13341. LimitSize := taicpu(p).opsize;
  13342. hp1 := p;
  13343. repeat
  13344. if not GetNextInstructionUsingReg(hp1, hp1, taicpu(p).oper[1]^.reg) or (hp1.typ <> ait_instruction) then
  13345. Break;
  13346. { Detect:
  13347. shr x, %reg
  13348. and y, %reg
  13349. If and y, %reg doesn't actually change the value of %reg (e.g. with
  13350. "shrl $24,%reg; andl $255,%reg", remove the AND instruction.
  13351. }
  13352. case taicpu(hp1).opcode of
  13353. A_AND:
  13354. if (taicpu(hp1).opsize = taicpu(p).opsize) and
  13355. MatchOpType(taicpu(hp1), top_const, top_reg) and
  13356. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  13357. begin
  13358. { Make sure the FLAGS register isn't in use }
  13359. TransferUsedRegs(TmpUsedRegs);
  13360. hp2 := p;
  13361. repeat
  13362. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  13363. until not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  13364. if not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs) then
  13365. begin
  13366. { Generate the identity mask }
  13367. case taicpu(p).opsize of
  13368. S_B:
  13369. IdentityMask := $FF shr Shift;
  13370. S_W:
  13371. IdentityMask := $FFFF shr Shift;
  13372. S_L:
  13373. IdentityMask := $FFFFFFFF shr Shift;
  13374. {$ifdef x86_64}
  13375. S_Q:
  13376. { We need to force the operands to be unsigned 64-bit
  13377. integers otherwise the wrong value is generated }
  13378. IdentityMask := TCGInt(QWord($FFFFFFFFFFFFFFFF) shr QWord(Shift));
  13379. {$endif x86_64}
  13380. else
  13381. InternalError(2022081501);
  13382. end;
  13383. if (taicpu(hp1).oper[0]^.val and IdentityMask) = IdentityMask then
  13384. begin
  13385. DebugMsg(SPeepholeOptimization + 'Removed AND instruction since previous SHR makes this an identity operation (ShrAnd2Shr)', hp1);
  13386. { All the possible 1 bits are covered, so we can remove the AND }
  13387. hp2 := tai(hp1.Previous);
  13388. RemoveInstruction(hp1);
  13389. { p wasn't actually changed, so don't set Result to True,
  13390. but a change was nonetheless made elsewhere }
  13391. Include(OptsToCheck, aoc_ForceNewIteration);
  13392. { Do another pass in case other AND or MOVZX instructions
  13393. follow }
  13394. hp1 := hp2;
  13395. Continue;
  13396. end;
  13397. end;
  13398. end;
  13399. A_TEST, A_CMP, A_Jcc:
  13400. { Skip over conditional jumps and relevant comparisons }
  13401. Continue;
  13402. A_MOVZX:
  13403. if MatchOpType(taicpu(hp1), top_reg, top_reg) and
  13404. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(p).oper[1]^.reg) then
  13405. begin
  13406. { Since the original register is being read as is, subsequent
  13407. SHRs must not be merged at this point }
  13408. DoNotMerge := True;
  13409. if IsShrMovZFoldable(taicpu(p).opsize, taicpu(hp1).opsize, Shift) then
  13410. begin
  13411. if SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then
  13412. begin
  13413. DebugMsg(SPeepholeOptimization + 'Removed MOVZX instruction since previous SHR makes it unnecessary (ShrMovz2Shr)', hp1);
  13414. { All the possible 1 bits are covered, so we can remove the AND }
  13415. hp2 := tai(hp1.Previous);
  13416. RemoveInstruction(hp1);
  13417. hp1 := hp2;
  13418. end
  13419. else { Different register target }
  13420. begin
  13421. DebugMsg(SPeepholeOptimization + 'Converted MOVZX instruction to MOV since previous SHR makes zero-extension unnecessary (ShrMovz2ShrMov 2)', hp1);
  13422. taicpu(hp1).opcode := A_MOV;
  13423. setsubreg(taicpu(hp1).oper[0]^.reg, getsubreg(taicpu(hp1).oper[1]^.reg));
  13424. case taicpu(hp1).opsize of
  13425. S_BW:
  13426. taicpu(hp1).opsize := S_W;
  13427. S_BL, S_WL:
  13428. taicpu(hp1).opsize := S_L;
  13429. else
  13430. InternalError(2022081503);
  13431. end;
  13432. end;
  13433. end
  13434. else if (Shift > 0) and
  13435. (taicpu(p).opsize = S_W) and
  13436. (taicpu(hp1).opsize = S_WL) and
  13437. (taicpu(hp1).oper[0]^.reg = NR_AX) and
  13438. (taicpu(hp1).oper[1]^.reg = NR_EAX) then
  13439. begin
  13440. { Detect:
  13441. shr x, %ax (x > 0)
  13442. ...
  13443. movzwl %ax,%eax
  13444. Change movzwl %ax,%eax to cwtl (shorter encoding for movswl %ax,%eax)
  13445. }
  13446. DebugMsg(SPeepholeOptimization + 'Converted movzwl %ax,%eax to cwtl (via ShrMovz2ShrCwtl)', hp1);
  13447. taicpu(hp1).opcode := A_CWDE;
  13448. taicpu(hp1).clearop(0);
  13449. taicpu(hp1).clearop(1);
  13450. taicpu(hp1).ops := 0;
  13451. end;
  13452. { Move onto the next instruction }
  13453. Continue;
  13454. end;
  13455. A_SHL, A_SAL, A_SHR:
  13456. if (taicpu(hp1).opsize <= LimitSize) and
  13457. MatchOpType(taicpu(hp1), top_const, top_reg) and
  13458. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[1]^.reg) then
  13459. begin
  13460. { Make sure the sizes don't exceed the register size limit
  13461. (measured by the shift value falling below the limit) }
  13462. if taicpu(hp1).opsize < LimitSize then
  13463. LimitSize := taicpu(hp1).opsize;
  13464. if taicpu(hp1).opcode = A_SHR then
  13465. Inc(Shift, taicpu(hp1).oper[0]^.val)
  13466. else
  13467. begin
  13468. Dec(Shift, taicpu(hp1).oper[0]^.val);
  13469. DoNotMerge := True;
  13470. end;
  13471. if Shift < topsize2memsize[taicpu(p).opsize] - topsize2memsize[LimitSize] then
  13472. Break;
  13473. { Since we've established that the combined shift is within
  13474. limits, we can actually combine the adjacent SHR
  13475. instructions even if they're different sizes }
  13476. if not DoNotMerge and (taicpu(hp1).opcode = A_SHR) then
  13477. begin
  13478. hp2 := tai(hp1.Previous);
  13479. DebugMsg(SPeepholeOptimization + 'ShrShr2Shr 2', p);
  13480. Inc(taicpu(p).oper[0]^.val, taicpu(hp1).oper[0]^.val);
  13481. RemoveInstruction(hp1);
  13482. hp1 := hp2;
  13483. end;
  13484. { Move onto the next instruction }
  13485. Continue;
  13486. end;
  13487. else
  13488. ;
  13489. end;
  13490. Break;
  13491. until False;
  13492. { Detect the following (looking backwards):
  13493. shr %cl,%reg
  13494. shr x, %reg
  13495. Swap the two SHR instructions to minimise a pipeline stall.
  13496. }
  13497. if GetLastInstruction(p, hp1) and
  13498. MatchInstruction(hp1, A_SHR, [taicpu(p).opsize]) and
  13499. MatchOpType(taicpu(hp1), top_reg, top_reg) and
  13500. { First operand will be %cl }
  13501. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  13502. { Just to be sure }
  13503. (getsupreg(taicpu(hp1).oper[1]^.reg) <> RS_ECX) then
  13504. begin
  13505. DebugMsg(SPeepholeOptimization + 'Swapped variable and constant SHR instructions to minimise pipeline stall (ShrShr2ShrShr)', hp1);
  13506. { Moving the entries this way ensures the register tracking remains correct }
  13507. Asml.Remove(p);
  13508. Asml.InsertBefore(p, hp1);
  13509. p := hp1;
  13510. { Don't set Result to True because the current instruction is now
  13511. "shr %cl,%reg" and there's nothing more we can do with it }
  13512. end;
  13513. end;
  13514. function TX86AsmOptimizer.PostPeepholeOptADDSUB(var p : tai) : boolean;
  13515. var
  13516. hp1, hp2: tai;
  13517. Opposite, SecondOpposite: TAsmOp;
  13518. NewCond: TAsmCond;
  13519. begin
  13520. Result := False;
  13521. { Change:
  13522. add/sub 128,(dest)
  13523. To:
  13524. sub/add -128,(dest)
  13525. This generaally takes fewer bytes to encode because -128 can be stored
  13526. in a signed byte, whereas +128 cannot.
  13527. }
  13528. if (taicpu(p).opsize <> S_B) and MatchOperand(taicpu(p).oper[0]^, 128) then
  13529. begin
  13530. if taicpu(p).opcode = A_ADD then
  13531. Opposite := A_SUB
  13532. else
  13533. Opposite := A_ADD;
  13534. { Be careful if the flags are in use, because the CF flag inverts
  13535. when changing from ADD to SUB and vice versa }
  13536. if RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  13537. GetNextInstruction(p, hp1) then
  13538. begin
  13539. TransferUsedRegs(TmpUsedRegs);
  13540. TmpUsedRegs[R_SPECIALREGISTER].Update(tai(p.Next), True);
  13541. hp2 := hp1;
  13542. { Scan ahead to check if everything's safe }
  13543. while Assigned(hp1) and RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) do
  13544. begin
  13545. if (hp1.typ <> ait_instruction) then
  13546. { Probably unsafe since the flags are still in use }
  13547. Exit;
  13548. if MatchInstruction(hp1, A_CALL, A_JMP, A_RET, []) then
  13549. { Stop searching at an unconditional jump }
  13550. Break;
  13551. if not
  13552. (
  13553. MatchInstruction(hp1, A_ADC, A_SBB, []) and
  13554. (taicpu(hp1).oper[0]^.typ = top_const) { We need to be able to invert a constant }
  13555. ) and
  13556. (taicpu(hp1).condition = C_None) and RegInInstruction(NR_DEFAULTFLAGS, hp1) then
  13557. { Instruction depends on FLAGS (and is not ADC or SBB); break out }
  13558. Exit;
  13559. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  13560. TmpUsedRegs[R_SPECIALREGISTER].Update(tai(hp1.Next), True);
  13561. { Move to the next instruction }
  13562. GetNextInstruction(hp1, hp1);
  13563. end;
  13564. while Assigned(hp2) and (hp2 <> hp1) do
  13565. begin
  13566. NewCond := C_None;
  13567. case taicpu(hp2).condition of
  13568. C_A, C_NBE:
  13569. NewCond := C_BE;
  13570. C_B, C_C, C_NAE:
  13571. NewCond := C_AE;
  13572. C_AE, C_NB, C_NC:
  13573. NewCond := C_B;
  13574. C_BE, C_NA:
  13575. NewCond := C_A;
  13576. else
  13577. { No change needed };
  13578. end;
  13579. if NewCond <> C_None then
  13580. begin
  13581. DebugMsg(SPeepholeOptimization + 'Condition changed from ' + cond2str[taicpu(hp2).condition] + ' to ' + cond2str[NewCond] +
  13582. ' to accommodate ' + debug_op2str(taicpu(p).opcode) + ' -> ' + debug_op2str(opposite) + ' above', hp2);
  13583. taicpu(hp2).condition := NewCond;
  13584. end
  13585. else
  13586. if MatchInstruction(hp2, A_ADC, A_SBB, []) then
  13587. begin
  13588. { Because of the flipping of the carry bit, to ensure
  13589. the operation remains equivalent, ADC becomes SBB
  13590. and vice versa, and the constant is not-inverted.
  13591. If multiple ADCs or SBBs appear in a row, each one
  13592. changed causes the carry bit to invert, so they all
  13593. need to be flipped }
  13594. if taicpu(hp2).opcode = A_ADC then
  13595. SecondOpposite := A_SBB
  13596. else
  13597. SecondOpposite := A_ADC;
  13598. if taicpu(hp2).oper[0]^.typ <> top_const then
  13599. { Should have broken out of this optimisation already }
  13600. InternalError(2021112901);
  13601. 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]^) + ' -> ' +
  13602. 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);
  13603. { Bit-invert the constant (effectively equivalent to "-1 - val") }
  13604. taicpu(hp2).opcode := SecondOpposite;
  13605. taicpu(hp2).oper[0]^.val := not taicpu(hp2).oper[0]^.val;
  13606. end;
  13607. { Move to the next instruction }
  13608. GetNextInstruction(hp2, hp2);
  13609. end;
  13610. if (hp2 <> hp1) then
  13611. InternalError(2021111501);
  13612. end;
  13613. DebugMsg(SPeepholeOptimization + debug_op2str(taicpu(p).opcode) + debug_opsize2str(taicpu(p).opsize) + ' $128,' + debug_operstr(taicpu(p).oper[1]^) + ' changed to ' +
  13614. debug_op2str(opposite) + debug_opsize2str(taicpu(p).opsize) + ' $-128,' + debug_operstr(taicpu(p).oper[1]^) + ' to reduce instruction size', p);
  13615. taicpu(p).opcode := Opposite;
  13616. taicpu(p).oper[0]^.val := -128;
  13617. { No further optimisations can be made on this instruction, so move
  13618. onto the next one to save time }
  13619. p := tai(p.Next);
  13620. UpdateUsedRegs(p);
  13621. Result := True;
  13622. Exit;
  13623. end;
  13624. { Detect:
  13625. add/sub %reg2,(dest)
  13626. add/sub x, (dest)
  13627. (dest can be a register or a reference)
  13628. Swap the instructions to minimise a pipeline stall. This reverses the
  13629. "Add swap" and "Sub swap" optimisations done in pass 1 if no new
  13630. optimisations could be made.
  13631. }
  13632. if (taicpu(p).oper[0]^.typ = top_reg) and
  13633. not RegInOp(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^) and
  13634. (
  13635. (
  13636. (taicpu(p).oper[1]^.typ = top_reg) and
  13637. { We can try searching further ahead if we're writing to a register }
  13638. GetNextInstructionUsingReg(p, hp1, taicpu(p).oper[1]^.reg)
  13639. ) or
  13640. (
  13641. (taicpu(p).oper[1]^.typ = top_ref) and
  13642. GetNextInstruction(p, hp1)
  13643. )
  13644. ) and
  13645. MatchInstruction(hp1, A_ADD, A_SUB, [taicpu(p).opsize]) and
  13646. (taicpu(hp1).oper[0]^.typ = top_const) and
  13647. MatchOperand(taicpu(p).oper[1]^, taicpu(hp1).oper[1]^) then
  13648. begin
  13649. { Make doubly sure the flags aren't in use because the order of additions may affect them }
  13650. TransferUsedRegs(TmpUsedRegs);
  13651. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  13652. hp2 := p;
  13653. while not (cs_opt_level3 in current_settings.optimizerswitches) and
  13654. GetNextInstruction(hp2, hp2) and (hp2 <> hp1) do
  13655. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  13656. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  13657. begin
  13658. asml.remove(hp1);
  13659. asml.InsertBefore(hp1, p);
  13660. DebugMsg(SPeepholeOptimization + 'Add/Sub swap 2 done', hp1);
  13661. Result := True;
  13662. end;
  13663. end;
  13664. end;
  13665. function TX86AsmOptimizer.PostPeepholeOptCmp(var p : tai) : Boolean;
  13666. var
  13667. hp1: tai;
  13668. begin
  13669. Result:=false;
  13670. { Final check to see if CMP/MOV pairs can be changed to MOV/CMP }
  13671. while GetNextInstruction(p, hp1) and
  13672. TrySwapMovCmp(p, hp1) do
  13673. begin
  13674. if MatchInstruction(hp1, A_MOV, []) then
  13675. begin
  13676. if RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  13677. begin
  13678. { A little hacky, but since CMP doesn't read the flags, only
  13679. modify them, it's safe if they get scrambled by MOV -> XOR }
  13680. ExcludeRegFromUsedRegs(NR_DEFAULTFLAGS, UsedRegs);
  13681. Result := PostPeepholeOptMov(hp1);
  13682. {$ifdef x86_64}
  13683. if Result and MatchInstruction(hp1, A_XOR, [S_Q]) then
  13684. { Used to shrink instruction size }
  13685. PostPeepholeOptXor(hp1);
  13686. {$endif x86_64}
  13687. IncludeRegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs);
  13688. end
  13689. else
  13690. begin
  13691. Result := PostPeepholeOptMov(hp1);
  13692. {$ifdef x86_64}
  13693. if Result and MatchInstruction(hp1, A_XOR, [S_Q]) then
  13694. { Used to shrink instruction size }
  13695. PostPeepholeOptXor(hp1);
  13696. {$endif x86_64}
  13697. end;
  13698. end;
  13699. { Enabling this flag is actually a null operation, but it marks
  13700. the code as 'modified' during this pass }
  13701. Include(OptsToCheck, aoc_ForceNewIteration);
  13702. end;
  13703. { change "cmp $0, %reg" to "test %reg, %reg" }
  13704. if MatchOpType(taicpu(p),top_const,top_reg) and
  13705. (taicpu(p).oper[0]^.val = 0) then
  13706. begin
  13707. taicpu(p).opcode := A_TEST;
  13708. taicpu(p).loadreg(0,taicpu(p).oper[1]^.reg);
  13709. DebugMsg(SPeepholeOptimization + 'Cmp2Test', p);
  13710. Result:=true;
  13711. end;
  13712. end;
  13713. function TX86AsmOptimizer.PostPeepholeOptTestOr(var p : tai) : Boolean;
  13714. var
  13715. IsTestConstX, IsValid : Boolean;
  13716. hp1,hp2 : tai;
  13717. begin
  13718. Result:=false;
  13719. { Final check to see if TEST/MOV pairs can be changed to MOV/TEST }
  13720. if (taicpu(p).opcode = A_TEST) then
  13721. while GetNextInstruction(p, hp1) and
  13722. TrySwapMovCmp(p, hp1) do
  13723. begin
  13724. if MatchInstruction(hp1, A_MOV, []) then
  13725. begin
  13726. if RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  13727. begin
  13728. { A little hacky, but since TEST doesn't read the flags, only
  13729. modify them, it's safe if they get scrambled by MOV -> XOR }
  13730. ExcludeRegFromUsedRegs(NR_DEFAULTFLAGS, UsedRegs);
  13731. Result := PostPeepholeOptMov(hp1);
  13732. {$ifdef x86_64}
  13733. if Result and MatchInstruction(hp1, A_XOR, [S_Q]) then
  13734. { Used to shrink instruction size }
  13735. PostPeepholeOptXor(hp1);
  13736. {$endif x86_64}
  13737. IncludeRegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs);
  13738. end
  13739. else
  13740. begin
  13741. Result := PostPeepholeOptMov(hp1);
  13742. {$ifdef x86_64}
  13743. if Result and MatchInstruction(hp1, A_XOR, [S_Q]) then
  13744. { Used to shrink instruction size }
  13745. PostPeepholeOptXor(hp1);
  13746. {$endif x86_64}
  13747. end;
  13748. end;
  13749. { Enabling this flag is actually a null operation, but it marks
  13750. the code as 'modified' during this pass }
  13751. Include(OptsToCheck, aoc_ForceNewIteration);
  13752. end;
  13753. { If x is a power of 2 (popcnt = 1), change:
  13754. or $x, %reg/ref
  13755. To:
  13756. bts lb(x), %reg/ref
  13757. }
  13758. if (taicpu(p).opcode = A_OR) and
  13759. IsBTXAcceptable(p) and
  13760. { IsBTXAcceptable checks to see if oper[0] is an immediate }
  13761. (PopCnt(QWord(taicpu(p).oper[0]^.val)) = 1) and
  13762. (
  13763. { Don't optimise if a test instruction follows }
  13764. not GetNextInstruction(p, hp1) or
  13765. not MatchInstruction(hp1, A_TEST, [taicpu(p).opsize])
  13766. ) then
  13767. begin
  13768. 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);
  13769. taicpu(p).opcode := A_BTS;
  13770. taicpu(p).oper[0]^.val := BsrQWord(taicpu(p).oper[0]^.val); { Essentially the base 2 logarithm }
  13771. Result := True;
  13772. Exit;
  13773. end;
  13774. { If x is a power of 2 (popcnt = 1), change:
  13775. test $x, %reg/ref
  13776. je / sete / cmove (or jne / setne)
  13777. To:
  13778. bt lb(x), %reg/ref
  13779. jnc / setnc / cmovnc (or jc / setc / cmovnc)
  13780. }
  13781. if (taicpu(p).opcode = A_TEST) and
  13782. (CPUX86_HAS_BTX in cpu_capabilities[current_settings.optimizecputype]) and
  13783. (taicpu(p).oper[0]^.typ = top_const) and
  13784. (
  13785. (cs_opt_size in current_settings.optimizerswitches) or
  13786. (
  13787. (taicpu(p).oper[1]^.typ = top_reg) and
  13788. (CPUX86_HINT_FAST_BT_REG_IMM in cpu_optimization_hints[current_settings.optimizecputype])
  13789. ) or
  13790. (
  13791. (taicpu(p).oper[1]^.typ <> top_reg) and
  13792. (CPUX86_HINT_FAST_BT_MEM_IMM in cpu_optimization_hints[current_settings.optimizecputype])
  13793. )
  13794. ) and
  13795. (PopCnt(QWord(taicpu(p).oper[0]^.val)) = 1) and
  13796. { For sizes less than S_L, the byte size is equal or larger with BT,
  13797. so don't bother optimising }
  13798. (taicpu(p).opsize >= S_L) then
  13799. begin
  13800. IsValid := True;
  13801. { Check the next set of instructions, watching the FLAGS register
  13802. and the conditions used }
  13803. TransferUsedRegs(TmpUsedRegs);
  13804. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  13805. hp1 := p;
  13806. hp2 := nil;
  13807. while GetNextInstruction(hp1, hp1) do
  13808. begin
  13809. if not Assigned(hp2) then
  13810. { The first instruction after TEST }
  13811. hp2 := hp1;
  13812. if (hp1.typ <> ait_instruction) then
  13813. begin
  13814. { If the flags are no longer in use, everything is fine }
  13815. if RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  13816. IsValid := False;
  13817. Break;
  13818. end;
  13819. case taicpu(hp1).condition of
  13820. C_None:
  13821. begin
  13822. if RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  13823. { Something is not quite normal, so play safe and don't change }
  13824. IsValid := False;
  13825. Break;
  13826. end;
  13827. C_E, C_Z, C_NE, C_NZ:
  13828. { This is fine };
  13829. else
  13830. begin
  13831. { Unsupported condition }
  13832. IsValid := False;
  13833. Break;
  13834. end;
  13835. end;
  13836. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  13837. end;
  13838. if IsValid then
  13839. begin
  13840. while hp2 <> hp1 do
  13841. begin
  13842. case taicpu(hp2).condition of
  13843. C_Z, C_E:
  13844. taicpu(hp2).condition := C_NC;
  13845. C_NZ, C_NE:
  13846. taicpu(hp2).condition := C_C;
  13847. else
  13848. { Should not get this by this point }
  13849. InternalError(2022110701);
  13850. end;
  13851. GetNextInstruction(hp2, hp2);
  13852. end;
  13853. 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);
  13854. taicpu(p).opcode := A_BT;
  13855. taicpu(p).oper[0]^.val := BsrQWord(taicpu(p).oper[0]^.val); { Essentially the base 2 logarithm }
  13856. Result := True;
  13857. Exit;
  13858. end;
  13859. end;
  13860. { removes the line marked with (x) from the sequence
  13861. and/or/xor/add/sub/... $x, %y
  13862. test/or %y, %y | test $-1, %y (x)
  13863. j(n)z _Label
  13864. as the first instruction already adjusts the ZF
  13865. %y operand may also be a reference }
  13866. IsTestConstX:=(taicpu(p).opcode=A_TEST) and
  13867. MatchOperand(taicpu(p).oper[0]^,-1);
  13868. if (OpsEqual(taicpu(p).oper[0]^,taicpu(p).oper[1]^) or IsTestConstX) and
  13869. GetLastInstruction(p, hp1) and
  13870. (tai(hp1).typ = ait_instruction) and
  13871. GetNextInstruction(p,hp2) and
  13872. MatchInstruction(hp2,A_SETcc,A_Jcc,A_CMOVcc,[]) then
  13873. case taicpu(hp1).opcode Of
  13874. A_ADD, A_SUB, A_OR, A_XOR, A_AND,
  13875. { These two instructions set the zero flag if the result is zero }
  13876. A_POPCNT, A_LZCNT:
  13877. begin
  13878. if (
  13879. { With POPCNT, an input of zero will set the zero flag
  13880. because the population count of zero is zero }
  13881. (taicpu(hp1).opcode = A_POPCNT) and
  13882. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) and
  13883. (
  13884. OpsEqual(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^) or
  13885. { Faster than going through the second half of the 'or'
  13886. condition below }
  13887. OpsEqual(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^)
  13888. )
  13889. ) or (
  13890. OpsEqual(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^) and
  13891. { does not work in case of overflow for G(E)/L(E)/C_O/C_NO }
  13892. { and in case of carry for A(E)/B(E)/C/NC }
  13893. (
  13894. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) or
  13895. (
  13896. (taicpu(hp1).opcode <> A_ADD) and
  13897. (taicpu(hp1).opcode <> A_SUB) and
  13898. (taicpu(hp1).opcode <> A_LZCNT)
  13899. )
  13900. )
  13901. ) then
  13902. begin
  13903. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (2-op) done', hp1);
  13904. RemoveCurrentP(p, hp2);
  13905. Result:=true;
  13906. Exit;
  13907. end;
  13908. end;
  13909. A_SHL, A_SAL, A_SHR, A_SAR:
  13910. begin
  13911. if OpsEqual(taicpu(hp1).oper[1]^,taicpu(p).oper[1]^) and
  13912. { SHL/SAL/SHR/SAR with a value of 0 do not change the flags }
  13913. { therefore, it's only safe to do this optimization for }
  13914. { shifts by a (nonzero) constant }
  13915. (taicpu(hp1).oper[0]^.typ = top_const) and
  13916. (taicpu(hp1).oper[0]^.val <> 0) and
  13917. { does not work in case of overflow for G(E)/L(E)/C_O/C_NO }
  13918. { and in case of carry for A(E)/B(E)/C/NC }
  13919. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) then
  13920. begin
  13921. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (shift) done', hp1);
  13922. RemoveCurrentP(p, hp2);
  13923. Result:=true;
  13924. Exit;
  13925. end;
  13926. end;
  13927. A_DEC, A_INC, A_NEG:
  13928. begin
  13929. if OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) and
  13930. { does not work in case of overflow for G(E)/L(E)/C_O/C_NO }
  13931. { and in case of carry for A(E)/B(E)/C/NC }
  13932. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) then
  13933. begin
  13934. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (1-op) done', hp1);
  13935. RemoveCurrentP(p, hp2);
  13936. Result:=true;
  13937. Exit;
  13938. end;
  13939. end;
  13940. A_ANDN, A_BZHI:
  13941. begin
  13942. if OpsEqual(taicpu(hp1).oper[2]^,taicpu(p).oper[1]^) and
  13943. { Only the zero and sign flags are consistent with what the result is }
  13944. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE,C_S,C_NS]) then
  13945. begin
  13946. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (ANDN/BZHI) done', hp1);
  13947. RemoveCurrentP(p, hp2);
  13948. Result:=true;
  13949. Exit;
  13950. end;
  13951. end;
  13952. A_BEXTR:
  13953. begin
  13954. if OpsEqual(taicpu(hp1).oper[2]^,taicpu(p).oper[1]^) and
  13955. { Only the zero flag is set }
  13956. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) then
  13957. begin
  13958. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (BEXTR) done', hp1);
  13959. RemoveCurrentP(p, hp2);
  13960. Result:=true;
  13961. Exit;
  13962. end;
  13963. end;
  13964. else
  13965. ;
  13966. end; { case }
  13967. { change "test $-1,%reg" into "test %reg,%reg" }
  13968. if IsTestConstX and (taicpu(p).oper[1]^.typ=top_reg) then
  13969. taicpu(p).loadoper(0,taicpu(p).oper[1]^);
  13970. { Change "or %reg,%reg" to "test %reg,%reg" as OR generates a false dependency }
  13971. if MatchInstruction(p, A_OR, []) and
  13972. { Can only match if they're both registers }
  13973. MatchOperand(taicpu(p).oper[0]^, taicpu(p).oper[1]^) then
  13974. begin
  13975. DebugMsg(SPeepholeOptimization + 'or %reg,%reg -> test %reg,%reg to remove false dependency (Or2Test)', p);
  13976. taicpu(p).opcode := A_TEST;
  13977. { No need to set Result to True, as we've done all the optimisations we can }
  13978. end;
  13979. end;
  13980. function TX86AsmOptimizer.PostPeepholeOptCall(var p : tai) : Boolean;
  13981. var
  13982. hp1,hp3 : tai;
  13983. {$ifndef x86_64}
  13984. hp2 : taicpu;
  13985. {$endif x86_64}
  13986. begin
  13987. Result:=false;
  13988. hp3:=nil;
  13989. {$ifndef x86_64}
  13990. { don't do this on modern CPUs, this really hurts them due to
  13991. broken call/ret pairing }
  13992. if (current_settings.optimizecputype < cpu_Pentium2) and
  13993. not(cs_create_pic in current_settings.moduleswitches) and
  13994. GetNextInstruction(p, hp1) and
  13995. MatchInstruction(hp1,A_JMP,[S_NO]) and
  13996. MatchOpType(taicpu(hp1),top_ref) and
  13997. (taicpu(hp1).oper[0]^.ref^.refaddr=addr_full) then
  13998. begin
  13999. hp2 := taicpu.Op_sym(A_PUSH,S_L,taicpu(hp1).oper[0]^.ref^.symbol);
  14000. taicpu(hp2).fileinfo := taicpu(p).fileinfo;
  14001. InsertLLItem(p.previous, p, hp2);
  14002. taicpu(p).opcode := A_JMP;
  14003. taicpu(p).is_jmp := true;
  14004. RemoveInstruction(hp1);
  14005. Result:=true;
  14006. end
  14007. else
  14008. {$endif x86_64}
  14009. { replace
  14010. call procname
  14011. ret
  14012. by
  14013. jmp procname
  14014. but do it only on level 4 because it destroys stack back traces
  14015. else if the subroutine is marked as no return, remove the ret
  14016. }
  14017. if ((cs_opt_level4 in current_settings.optimizerswitches) or
  14018. (po_noreturn in current_procinfo.procdef.procoptions)) and
  14019. GetNextInstruction(p, hp1) and
  14020. (MatchInstruction(hp1,A_RET,[S_NO]) or
  14021. (MatchInstruction(hp1,A_VZEROUPPER,[S_NO]) and
  14022. SetAndTest(hp1,hp3) and
  14023. GetNextInstruction(hp1,hp1) and
  14024. MatchInstruction(hp1,A_RET,[S_NO])
  14025. )
  14026. ) and
  14027. (taicpu(hp1).ops=0) then
  14028. begin
  14029. if (cs_opt_level4 in current_settings.optimizerswitches) and
  14030. { we might destroy stack alignment here if we do not do a call }
  14031. (target_info.stackalign<=sizeof(SizeUInt)) then
  14032. begin
  14033. taicpu(p).opcode := A_JMP;
  14034. taicpu(p).is_jmp := true;
  14035. DebugMsg(SPeepholeOptimization + 'CallRet2Jmp done',p);
  14036. end
  14037. else
  14038. DebugMsg(SPeepholeOptimization + 'CallRet2Call done',p);
  14039. RemoveInstruction(hp1);
  14040. if Assigned(hp3) then
  14041. begin
  14042. AsmL.Remove(hp3);
  14043. AsmL.InsertBefore(hp3,p)
  14044. end;
  14045. Result:=true;
  14046. end;
  14047. end;
  14048. function TX86AsmOptimizer.PostPeepholeOptMovzx(var p : tai) : Boolean;
  14049. function ConstInRange(const Val: TCGInt; const OpSize: TOpSize): Boolean;
  14050. begin
  14051. case OpSize of
  14052. S_B, S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  14053. Result := (Val <= $FF) and (Val >= -128);
  14054. S_W, S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  14055. Result := (Val <= $FFFF) and (Val >= -32768);
  14056. S_L{$ifdef x86_64}, S_LQ{$endif x86_64}:
  14057. Result := (Val <= $FFFFFFFF) and (Val >= -2147483648);
  14058. else
  14059. Result := True;
  14060. end;
  14061. end;
  14062. var
  14063. hp1, hp2 : tai;
  14064. SizeChange: Boolean;
  14065. PreMessage: string;
  14066. begin
  14067. Result := False;
  14068. if (taicpu(p).oper[0]^.typ = top_reg) and
  14069. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  14070. GetNextInstruction(p, hp1) and (hp1.typ = ait_instruction) then
  14071. begin
  14072. { Change (using movzbl %al,%eax as an example):
  14073. movzbl %al, %eax movzbl %al, %eax
  14074. cmpl x, %eax testl %eax,%eax
  14075. To:
  14076. cmpb x, %al testb %al, %al (Move one back to avoid a false dependency)
  14077. movzbl %al, %eax movzbl %al, %eax
  14078. Smaller instruction and minimises pipeline stall as the CPU
  14079. doesn't have to wait for the register to get zero-extended. [Kit]
  14080. Also allow if the smaller of the two registers is being checked,
  14081. as this still removes the false dependency.
  14082. }
  14083. if
  14084. (
  14085. (
  14086. (taicpu(hp1).opcode = A_CMP) and MatchOpType(taicpu(hp1), top_const, top_reg) and
  14087. ConstInRange(taicpu(hp1).oper[0]^.val, taicpu(p).opsize)
  14088. ) or (
  14089. { If MatchOperand returns True, they must both be registers }
  14090. (taicpu(hp1).opcode = A_TEST) and MatchOperand(taicpu(hp1).oper[0]^, taicpu(hp1).oper[1]^)
  14091. )
  14092. ) and
  14093. (reg2opsize(taicpu(hp1).oper[1]^.reg) <= reg2opsize(taicpu(p).oper[1]^.reg)) and
  14094. SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) then
  14095. begin
  14096. 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);
  14097. asml.Remove(hp1);
  14098. asml.InsertBefore(hp1, p);
  14099. { Swap instructions in the case of cmp 0,%reg or test %reg,%reg }
  14100. if (taicpu(hp1).opcode = A_TEST) or (taicpu(hp1).oper[0]^.val = 0) then
  14101. begin
  14102. taicpu(hp1).opcode := A_TEST;
  14103. taicpu(hp1).loadreg(0, taicpu(p).oper[0]^.reg);
  14104. end;
  14105. taicpu(hp1).oper[1]^.reg := taicpu(p).oper[0]^.reg;
  14106. case taicpu(p).opsize of
  14107. S_BW, S_BL:
  14108. begin
  14109. SizeChange := taicpu(hp1).opsize <> S_B;
  14110. taicpu(hp1).changeopsize(S_B);
  14111. end;
  14112. S_WL:
  14113. begin
  14114. SizeChange := taicpu(hp1).opsize <> S_W;
  14115. taicpu(hp1).changeopsize(S_W);
  14116. end
  14117. else
  14118. InternalError(2020112701);
  14119. end;
  14120. UpdateUsedRegs(tai(p.Next));
  14121. { Check if the register is used aferwards - if not, we can
  14122. remove the movzx instruction completely }
  14123. if not RegUsedAfterInstruction(taicpu(hp1).oper[1]^.reg, p, UsedRegs) then
  14124. begin
  14125. { Hp1 is a better position than p for debugging purposes }
  14126. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 4a', hp1);
  14127. RemoveCurrentp(p, hp1);
  14128. Result := True;
  14129. end;
  14130. if SizeChange then
  14131. DebugMsg(SPeepholeOptimization + PreMessage +
  14132. 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)
  14133. else
  14134. DebugMsg(SPeepholeOptimization + 'MovzxCmp2CmpMovzx', hp1);
  14135. Exit;
  14136. end;
  14137. { Change (using movzwl %ax,%eax as an example):
  14138. movzwl %ax, %eax
  14139. movb %al, (dest) (Register is smaller than read register in movz)
  14140. To:
  14141. movb %al, (dest) (Move one back to avoid a false dependency)
  14142. movzwl %ax, %eax
  14143. }
  14144. if (taicpu(hp1).opcode = A_MOV) and
  14145. (taicpu(hp1).oper[0]^.typ = top_reg) and
  14146. not RegInOp(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^) and
  14147. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(p).oper[0]^.reg) and
  14148. (reg2opsize(taicpu(hp1).oper[0]^.reg) <= reg2opsize(taicpu(p).oper[0]^.reg)) then
  14149. begin
  14150. DebugMsg(SPeepholeOptimization + 'MovzxMov2MovMovzx', hp1);
  14151. hp2 := tai(hp1.Previous); { Effectively the old position of hp1 }
  14152. asml.Remove(hp1);
  14153. asml.InsertBefore(hp1, p);
  14154. if taicpu(hp1).oper[1]^.typ = top_reg then
  14155. AllocRegBetween(taicpu(hp1).oper[1]^.reg, hp1, hp2, UsedRegs);
  14156. { Check if the register is used aferwards - if not, we can
  14157. remove the movzx instruction completely }
  14158. if not RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg, p, UsedRegs) then
  14159. begin
  14160. { Hp1 is a better position than p for debugging purposes }
  14161. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 4b', hp1);
  14162. RemoveCurrentp(p, hp1);
  14163. Result := True;
  14164. end;
  14165. Exit;
  14166. end;
  14167. end;
  14168. end;
  14169. function TX86AsmOptimizer.PostPeepholeOptXor(var p : tai) : Boolean;
  14170. var
  14171. hp1: tai;
  14172. {$ifdef x86_64}
  14173. PreMessage, RegName: string;
  14174. {$endif x86_64}
  14175. begin
  14176. Result := False;
  14177. { If x is a power of 2 (popcnt = 1), change:
  14178. xor $x, %reg/ref
  14179. To:
  14180. btc lb(x), %reg/ref
  14181. }
  14182. if IsBTXAcceptable(p) and
  14183. { IsBTXAcceptable checks to see if oper[0] is an immediate }
  14184. (PopCnt(QWord(taicpu(p).oper[0]^.val)) = 1) and
  14185. (
  14186. { Don't optimise if a test instruction follows }
  14187. not GetNextInstruction(p, hp1) or
  14188. not MatchInstruction(hp1, A_TEST, [taicpu(p).opsize])
  14189. ) then
  14190. begin
  14191. 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);
  14192. taicpu(p).opcode := A_BTC;
  14193. taicpu(p).oper[0]^.val := BsrQWord(taicpu(p).oper[0]^.val); { Essentially the base 2 logarithm }
  14194. Result := True;
  14195. Exit;
  14196. end;
  14197. {$ifdef x86_64}
  14198. { Code size reduction by J. Gareth "Kit" Moreton }
  14199. { change "xorq %reg,%reg" to "xorl %reg,%reg" for %rax, %rcx, %rdx, %rbx, %rsi, %rdi, %rbp and %rsp,
  14200. as this removes the REX prefix }
  14201. if not OpsEqual(taicpu(p).oper[0]^,taicpu(p).oper[1]^) then
  14202. Exit;
  14203. if taicpu(p).oper[0]^.typ <> top_reg then
  14204. { Should be impossible if both operands were equal, since one of XOR's operands must be a register }
  14205. InternalError(2018011500);
  14206. case taicpu(p).opsize of
  14207. S_Q:
  14208. begin
  14209. RegName := debug_regname(taicpu(p).oper[0]^.reg); { 64-bit register name }
  14210. PreMessage := 'xorq ' + RegName + ',' + RegName + ' -> xorl ';
  14211. { The actual optimization }
  14212. setsubreg(taicpu(p).oper[0]^.reg, R_SUBD);
  14213. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  14214. taicpu(p).changeopsize(S_L);
  14215. RegName := debug_regname(taicpu(p).oper[0]^.reg); { 32-bit register name }
  14216. DebugMsg(SPeepholeOptimization + PreMessage + RegName + ',' + RegName + ' (32-bit register recommended when zeroing 64-bit counterpart)', p);
  14217. end;
  14218. else
  14219. ;
  14220. end;
  14221. {$endif x86_64}
  14222. end;
  14223. function TX86AsmOptimizer.PostPeepholeOptVPXOR(var p : tai) : Boolean;
  14224. var
  14225. XReg: TRegister;
  14226. begin
  14227. Result := False;
  14228. { Turn "vpxor %ymmreg2,%ymmreg2,%ymmreg1" to "vpxor %xmmreg2,%xmmreg2,%xmmreg1"
  14229. Smaller encoding and slightly faster on some platforms (also works for
  14230. ZMM-sized registers) }
  14231. if (taicpu(p).opsize in [S_YMM, S_ZMM]) and
  14232. MatchOpType(taicpu(p), top_reg, top_reg, top_reg) then
  14233. begin
  14234. XReg := taicpu(p).oper[0]^.reg;
  14235. if (taicpu(p).oper[1]^.reg = XReg) then
  14236. begin
  14237. taicpu(p).changeopsize(S_XMM);
  14238. setsubreg(taicpu(p).oper[2]^.reg, R_SUBMMX);
  14239. if (cs_opt_size in current_settings.optimizerswitches) then
  14240. begin
  14241. { Change input registers to %xmm0 to reduce size. Note that
  14242. there's a risk of a false dependency doing this, so only
  14243. optimise for size here }
  14244. XReg := NR_XMM0;
  14245. DebugMsg(SPeepholeOptimization + 'Changed zero-setting vpxor from Y/ZMM to XMM and changed input registers to %xmm0 to reduce size', p);
  14246. end
  14247. else
  14248. begin
  14249. setsubreg(XReg, R_SUBMMX);
  14250. DebugMsg(SPeepholeOptimization + 'Changed zero-setting vpxor from Y/ZMM to XMM to reduce size and increase efficiency', p);
  14251. end;
  14252. taicpu(p).oper[0]^.reg := XReg;
  14253. taicpu(p).oper[1]^.reg := XReg;
  14254. Result := True;
  14255. end;
  14256. end;
  14257. end;
  14258. class procedure TX86AsmOptimizer.OptimizeRefs(var p: taicpu);
  14259. var
  14260. OperIdx: Integer;
  14261. begin
  14262. for OperIdx := 0 to p.ops - 1 do
  14263. if p.oper[OperIdx]^.typ = top_ref then
  14264. optimize_ref(p.oper[OperIdx]^.ref^, False);
  14265. end;
  14266. end.