aoptx86.pas 632 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487134881348913490134911349213493134941349513496134971349813499135001350113502135031350413505135061350713508135091351013511135121351313514135151351613517135181351913520135211352213523135241352513526135271352813529135301353113532135331353413535135361353713538135391354013541135421354313544135451354613547135481354913550135511355213553135541355513556135571355813559135601356113562135631356413565135661356713568135691357013571135721357313574135751357613577135781357913580135811358213583135841358513586135871358813589135901359113592135931359413595135961359713598135991360013601136021360313604136051360613607136081360913610136111361213613136141361513616136171361813619136201362113622136231362413625136261362713628136291363013631136321363313634136351363613637136381363913640136411364213643136441364513646136471364813649136501365113652136531365413655136561365713658136591366013661136621366313664136651366613667136681366913670136711367213673136741367513676136771367813679136801368113682136831368413685136861368713688136891369013691136921369313694136951369613697136981369913700137011370213703137041370513706137071370813709137101371113712137131371413715137161371713718137191372013721137221372313724137251372613727137281372913730137311373213733137341373513736137371373813739137401374113742137431374413745137461374713748137491375013751137521375313754137551375613757137581375913760137611376213763137641376513766137671376813769137701377113772137731377413775137761377713778137791378013781137821378313784137851378613787137881378913790137911379213793137941379513796137971379813799138001380113802138031380413805138061380713808138091381013811138121381313814138151381613817138181381913820138211382213823138241382513826138271382813829138301383113832138331383413835138361383713838138391384013841138421384313844138451384613847138481384913850138511385213853138541385513856138571385813859138601386113862138631386413865138661386713868138691387013871138721387313874138751387613877138781387913880138811388213883138841388513886138871388813889138901389113892138931389413895138961389713898138991390013901139021390313904139051390613907139081390913910139111391213913139141391513916139171391813919139201392113922139231392413925139261392713928139291393013931139321393313934139351393613937139381393913940139411394213943139441394513946139471394813949139501395113952139531395413955139561395713958139591396013961139621396313964139651396613967139681396913970139711397213973139741397513976139771397813979139801398113982139831398413985139861398713988139891399013991139921399313994139951399613997139981399914000140011400214003140041400514006140071400814009140101401114012140131401414015140161401714018140191402014021140221402314024140251402614027140281402914030140311403214033140341403514036140371403814039140401404114042140431404414045140461404714048140491405014051140521405314054140551405614057140581405914060140611406214063140641406514066140671406814069140701407114072140731407414075140761407714078140791408014081140821408314084140851408614087140881408914090140911409214093140941409514096140971409814099141001410114102141031410414105141061410714108141091411014111141121411314114141151411614117141181411914120141211412214123141241412514126141271412814129141301413114132141331413414135141361413714138141391414014141141421414314144141451414614147141481414914150141511415214153141541415514156141571415814159141601416114162141631416414165141661416714168141691417014171141721417314174141751417614177141781417914180141811418214183141841418514186141871418814189141901419114192141931419414195141961419714198141991420014201142021420314204142051420614207142081420914210142111421214213142141421514216142171421814219142201422114222142231422414225142261422714228142291423014231142321423314234142351423614237142381423914240142411424214243142441424514246142471424814249142501425114252142531425414255142561425714258142591426014261142621426314264142651426614267142681426914270142711427214273142741427514276142771427814279142801428114282142831428414285142861428714288142891429014291142921429314294142951429614297142981429914300143011430214303143041430514306143071430814309143101431114312143131431414315143161431714318143191432014321143221432314324143251432614327143281432914330143311433214333143341433514336143371433814339143401434114342143431434414345143461434714348143491435014351143521435314354143551435614357143581435914360143611436214363143641436514366143671436814369143701437114372143731437414375143761437714378143791438014381143821438314384143851438614387143881438914390143911439214393143941439514396143971439814399144001440114402144031440414405144061440714408144091441014411144121441314414144151441614417144181441914420144211442214423144241442514426144271442814429144301443114432144331443414435144361443714438144391444014441144421444314444144451444614447144481444914450144511445214453144541445514456144571445814459144601446114462144631446414465144661446714468144691447014471144721447314474144751447614477144781447914480144811448214483144841448514486144871448814489144901449114492144931449414495144961449714498144991450014501145021450314504145051450614507145081450914510145111451214513145141451514516145171451814519145201452114522145231452414525145261452714528145291453014531145321453314534145351453614537145381453914540145411454214543145441454514546145471454814549145501455114552145531455414555145561455714558145591456014561145621456314564145651456614567145681456914570145711457214573145741457514576145771457814579145801458114582145831458414585145861458714588145891459014591145921459314594145951459614597145981459914600146011460214603146041460514606146071460814609146101461114612146131461414615146161461714618146191462014621146221462314624146251462614627146281462914630146311463214633146341463514636146371463814639146401464114642146431464414645146461464714648146491465014651146521465314654146551465614657146581465914660146611466214663146641466514666146671466814669146701467114672146731467414675146761467714678146791468014681146821468314684146851468614687146881468914690146911469214693146941469514696146971469814699147001470114702147031470414705147061470714708147091471014711147121471314714147151471614717147181471914720147211472214723147241472514726147271472814729147301473114732147331473414735147361473714738147391474014741147421474314744147451474614747147481474914750147511475214753147541475514756147571475814759147601476114762147631476414765147661476714768147691477014771147721477314774147751477614777147781477914780147811478214783147841478514786147871478814789147901479114792147931479414795147961479714798147991480014801148021480314804148051480614807148081480914810148111481214813148141481514816
  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): 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): 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 : tai) : boolean; static;
  102. { Returns true if the given logic instruction can be converted into a BTx instruction (BT not included) }
  103. class function IsBTXAcceptable(p : tai) : boolean; static;
  104. { Converts the LEA instruction to ADD/INC/SUB/DEC. Returns True if the
  105. conversion was successful }
  106. function ConvertLEA(const p : taicpu): Boolean;
  107. function DeepMOVOpt(const p_mov: taicpu; const hp: taicpu): Boolean;
  108. function FuncMov2Func(var p: tai; const hp1: tai): Boolean;
  109. procedure DebugMsg(const s : string; p : tai);inline;
  110. class function IsExitCode(p : tai) : boolean; static;
  111. class function isFoldableArithOp(hp1 : taicpu; reg : tregister) : boolean; static;
  112. class function IsShrMovZFoldable(shr_size, movz_size: topsize; Shift: TCGInt): Boolean; static;
  113. procedure RemoveLastDeallocForFuncRes(p : tai);
  114. function DoArithCombineOpt(var p : tai) : Boolean;
  115. function DoMovCmpMemOpt(var p : tai; const hp1: tai; UpdateTmpUsedRegs: Boolean) : Boolean;
  116. function DoSETccLblRETOpt(var p: tai; const hp_label: tai_label) : Boolean;
  117. function PrePeepholeOptSxx(var p : tai) : boolean;
  118. function PrePeepholeOptIMUL(var p : tai) : boolean;
  119. function PrePeepholeOptAND(var p : tai) : boolean;
  120. function OptPass1Test(var p: tai): boolean;
  121. function OptPass1Add(var p: tai): boolean;
  122. function OptPass1AND(var p : tai) : boolean;
  123. function OptPass1_V_MOVAP(var p : tai) : boolean;
  124. function OptPass1VOP(var p : tai) : boolean;
  125. function OptPass1MOV(var p : tai) : boolean;
  126. function OptPass1Movx(var p : tai) : boolean;
  127. function OptPass1MOVXX(var p : tai) : boolean;
  128. function OptPass1OP(var p : tai) : boolean;
  129. function OptPass1LEA(var p : tai) : boolean;
  130. function OptPass1Sub(var p : tai) : boolean;
  131. function OptPass1SHLSAL(var p : tai) : boolean;
  132. function OptPass1SHR(var p : tai) : boolean;
  133. function OptPass1FSTP(var p : tai) : boolean;
  134. function OptPass1FLD(var p : tai) : boolean;
  135. function OptPass1Cmp(var p : tai) : boolean;
  136. function OptPass1PXor(var p : tai) : boolean;
  137. function OptPass1VPXor(var p: tai): boolean;
  138. function OptPass1Imul(var p : tai) : boolean;
  139. function OptPass1Jcc(var p : tai) : boolean;
  140. function OptPass1SHXX(var p: tai): boolean;
  141. function OptPass1VMOVDQ(var p: tai): Boolean;
  142. function OptPass1_V_Cvtss2sd(var p: tai): boolean;
  143. function OptPass2Movx(var p : tai): Boolean;
  144. function OptPass2MOV(var p : tai) : boolean;
  145. function OptPass2Imul(var p : tai) : boolean;
  146. function OptPass2Jmp(var p : tai) : boolean;
  147. function OptPass2Jcc(var p : tai) : boolean;
  148. function OptPass2Lea(var p: tai): Boolean;
  149. function OptPass2SUB(var p: tai): Boolean;
  150. function OptPass2ADD(var p : tai): Boolean;
  151. function OptPass2SETcc(var p : tai) : boolean;
  152. function CheckMemoryWrite(var first_mov, second_mov: taicpu): Boolean;
  153. function PostPeepholeOptMov(var p : tai) : Boolean;
  154. function PostPeepholeOptMovzx(var p : tai) : Boolean;
  155. function PostPeepholeOptXor(var p : tai) : Boolean;
  156. function PostPeepholeOptAnd(var p : tai) : boolean;
  157. function PostPeepholeOptMOVSX(var p : tai) : boolean;
  158. function PostPeepholeOptCmp(var p : tai) : Boolean;
  159. function PostPeepholeOptTestOr(var p : tai) : Boolean;
  160. function PostPeepholeOptCall(var p : tai) : Boolean;
  161. function PostPeepholeOptLea(var p : tai) : Boolean;
  162. function PostPeepholeOptPush(var p: tai): Boolean;
  163. function PostPeepholeOptShr(var p : tai) : boolean;
  164. function PostPeepholeOptADDSUB(var p : tai) : Boolean;
  165. function PostPeepholeOptVPXOR(var p: tai): Boolean;
  166. procedure ConvertJumpToRET(const p: tai; const ret_p: tai);
  167. function CheckJumpMovTransferOpt(var p: tai; hp1: tai; LoopCount: Integer; out Count: Integer): Boolean;
  168. function TrySwapMovCmp(var p, hp1: tai): Boolean;
  169. { Processor-dependent reference optimisation }
  170. class procedure OptimizeRefs(var p: taicpu); static;
  171. end;
  172. function MatchInstruction(const instr: tai; const op: TAsmOp; const opsize: topsizes): boolean;
  173. function MatchInstruction(const instr: tai; const op1,op2: TAsmOp; const opsize: topsizes): boolean;
  174. function MatchInstruction(const instr: tai; const op1,op2,op3: TAsmOp; const opsize: topsizes): boolean;
  175. function MatchInstruction(const instr: tai; const ops: array of TAsmOp; const opsize: topsizes): boolean;
  176. function MatchOperand(const oper: TOper; const reg: TRegister): boolean; inline;
  177. function MatchOperand(const oper: TOper; const a: tcgint): boolean; inline;
  178. function MatchOperand(const oper1: TOper; const oper2: TOper): boolean;
  179. {$if max_operands>2}
  180. function MatchOperand(const oper1: TOper; const oper2: TOper; const oper3: TOper): boolean;
  181. {$endif max_operands>2}
  182. function RefsEqual(const r1, r2: treference): boolean;
  183. { Note that Result is set to True if the references COULD overlap but the
  184. compiler cannot be sure (e.g. "(%reg1)" and "4(%reg2)" with a range of 4
  185. might still overlap because %reg2 could be equal to %reg1-4 }
  186. function RefsMightOverlap(const r1, r2: treference; const Range: asizeint): boolean;
  187. function MatchReference(const ref : treference;base,index : TRegister) : Boolean;
  188. { returns true, if ref is a reference using only the registers passed as base and index
  189. and having an offset }
  190. function MatchReferenceWithOffset(const ref : treference;base,index : TRegister) : Boolean;
  191. implementation
  192. uses
  193. cutils,verbose,
  194. systems,
  195. globals,
  196. cpuinfo,
  197. procinfo,
  198. paramgr,
  199. aasmbase,
  200. aoptbase,aoptutils,
  201. symconst,symsym,
  202. cgx86,
  203. itcpugas;
  204. {$ifdef DEBUG_AOPTCPU}
  205. const
  206. SPeepholeOptimization: shortstring = 'Peephole Optimization: ';
  207. {$else DEBUG_AOPTCPU}
  208. { Empty strings help the optimizer to remove string concatenations that won't
  209. ever appear to the user on release builds. [Kit] }
  210. const
  211. SPeepholeOptimization = '';
  212. {$endif DEBUG_AOPTCPU}
  213. LIST_STEP_SIZE = 4;
  214. type
  215. TJumpTrackingItem = class(TLinkedListItem)
  216. private
  217. FSymbol: TAsmSymbol;
  218. FRefs: LongInt;
  219. public
  220. constructor Create(ASymbol: TAsmSymbol);
  221. procedure IncRefs; {$ifdef USEINLINE}inline;{$endif USEINLINE}
  222. property Symbol: TAsmSymbol read FSymbol;
  223. property Refs: LongInt read FRefs;
  224. end;
  225. constructor TJumpTrackingItem.Create(ASymbol: TAsmSymbol);
  226. begin
  227. inherited Create;
  228. FSymbol := ASymbol;
  229. FRefs := 0;
  230. end;
  231. procedure TJumpTrackingItem.IncRefs; {$ifdef USEINLINE}inline;{$endif USEINLINE}
  232. begin
  233. Inc(FRefs);
  234. end;
  235. function MatchInstruction(const instr: tai; const op: TAsmOp; const opsize: topsizes): boolean;
  236. begin
  237. result :=
  238. (instr.typ = ait_instruction) and
  239. (taicpu(instr).opcode = op) and
  240. ((opsize = []) or (taicpu(instr).opsize in opsize));
  241. end;
  242. function MatchInstruction(const instr: tai; const op1,op2: TAsmOp; const opsize: topsizes): boolean;
  243. begin
  244. result :=
  245. (instr.typ = ait_instruction) and
  246. ((taicpu(instr).opcode = op1) or
  247. (taicpu(instr).opcode = op2)
  248. ) and
  249. ((opsize = []) or (taicpu(instr).opsize in opsize));
  250. end;
  251. function MatchInstruction(const instr: tai; const op1,op2,op3: TAsmOp; const opsize: topsizes): boolean;
  252. begin
  253. result :=
  254. (instr.typ = ait_instruction) and
  255. ((taicpu(instr).opcode = op1) or
  256. (taicpu(instr).opcode = op2) or
  257. (taicpu(instr).opcode = op3)
  258. ) and
  259. ((opsize = []) or (taicpu(instr).opsize in opsize));
  260. end;
  261. function MatchInstruction(const instr : tai;const ops : array of TAsmOp;
  262. const opsize : topsizes) : boolean;
  263. var
  264. op : TAsmOp;
  265. begin
  266. result:=false;
  267. if (instr.typ <> ait_instruction) or
  268. ((opsize <> []) and not(taicpu(instr).opsize in opsize)) then
  269. exit;
  270. for op in ops do
  271. begin
  272. if taicpu(instr).opcode = op then
  273. begin
  274. result:=true;
  275. exit;
  276. end;
  277. end;
  278. end;
  279. function MatchOperand(const oper: TOper; const reg: TRegister): boolean; inline;
  280. begin
  281. result := (oper.typ = top_reg) and (oper.reg = reg);
  282. end;
  283. function MatchOperand(const oper: TOper; const a: tcgint): boolean; inline;
  284. begin
  285. result := (oper.typ = top_const) and (oper.val = a);
  286. end;
  287. function MatchOperand(const oper1: TOper; const oper2: TOper): boolean;
  288. begin
  289. result := oper1.typ = oper2.typ;
  290. if result then
  291. case oper1.typ of
  292. top_const:
  293. Result:=oper1.val = oper2.val;
  294. top_reg:
  295. Result:=oper1.reg = oper2.reg;
  296. top_ref:
  297. Result:=RefsEqual(oper1.ref^, oper2.ref^);
  298. else
  299. internalerror(2013102801);
  300. end
  301. end;
  302. function MatchOperand(const oper1: TOper; const oper2: TOper; const oper3: TOper): boolean;
  303. begin
  304. result := (oper1.typ = oper2.typ) and (oper1.typ = oper3.typ);
  305. if result then
  306. case oper1.typ of
  307. top_const:
  308. Result:=(oper1.val = oper2.val) and (oper1.val = oper3.val);
  309. top_reg:
  310. Result:=(oper1.reg = oper2.reg) and (oper1.reg = oper3.reg);
  311. top_ref:
  312. Result:=RefsEqual(oper1.ref^, oper2.ref^) and RefsEqual(oper1.ref^, oper3.ref^);
  313. else
  314. internalerror(2020052401);
  315. end
  316. end;
  317. function RefsEqual(const r1, r2: treference): boolean;
  318. begin
  319. RefsEqual :=
  320. (r1.symbol=r2.symbol) and (r1.refaddr = r2.refaddr) and
  321. (r1.relsymbol = r2.relsymbol) and
  322. (r1.segment = r2.segment) and (r1.base = r2.base) and
  323. (r1.index = r2.index) and (r1.scalefactor = r2.scalefactor) and
  324. (r1.offset = r2.offset) and
  325. (r1.volatility + r2.volatility = []);
  326. end;
  327. function RefsMightOverlap(const r1, r2: treference; const Range: asizeint): boolean;
  328. begin
  329. if (r1.symbol<>r2.symbol) then
  330. { If the index registers are different, there's a chance one could
  331. be set so it equals the other symbol }
  332. Exit((r1.index<>r2.index) or (r1.scalefactor<>r2.scalefactor));
  333. if (r1.symbol=r2.symbol) and (r1.refaddr = r2.refaddr) and
  334. (r1.relsymbol = r2.relsymbol) and
  335. (r1.segment = r2.segment) and (r1.base = r2.base) and
  336. (r1.index = r2.index) and (r1.scalefactor = r2.scalefactor) and
  337. (r1.volatility + r2.volatility = []) then
  338. { In this case, it all depends on the offsets }
  339. Exit(abs(r1.offset - r2.offset) < Range);
  340. { There's a chance things MIGHT overlap, so take no chances }
  341. Result := True;
  342. end;
  343. function MatchReference(const ref : treference;base,index : TRegister) : Boolean;
  344. begin
  345. Result:=(ref.offset=0) and
  346. (ref.scalefactor in [0,1]) and
  347. (ref.segment=NR_NO) and
  348. (ref.symbol=nil) and
  349. (ref.relsymbol=nil) and
  350. ((base=NR_INVALID) or
  351. (ref.base=base)) and
  352. ((index=NR_INVALID) or
  353. (ref.index=index)) and
  354. (ref.volatility=[]);
  355. end;
  356. function MatchReferenceWithOffset(const ref : treference;base,index : TRegister) : Boolean;
  357. begin
  358. Result:=(ref.scalefactor in [0,1]) and
  359. (ref.segment=NR_NO) and
  360. (ref.symbol=nil) and
  361. (ref.relsymbol=nil) and
  362. ((base=NR_INVALID) or
  363. (ref.base=base)) and
  364. ((index=NR_INVALID) or
  365. (ref.index=index)) and
  366. (ref.volatility=[]);
  367. end;
  368. function InstrReadsFlags(p: tai): boolean;
  369. begin
  370. InstrReadsFlags := true;
  371. case p.typ of
  372. ait_instruction:
  373. if InsProp[taicpu(p).opcode].Ch*
  374. [Ch_RCarryFlag,Ch_RParityFlag,Ch_RAuxiliaryFlag,Ch_RZeroFlag,Ch_RSignFlag,Ch_ROverflowFlag,
  375. Ch_RWCarryFlag,Ch_RWParityFlag,Ch_RWAuxiliaryFlag,Ch_RWZeroFlag,Ch_RWSignFlag,Ch_RWOverflowFlag,
  376. Ch_RFlags,Ch_RWFlags,Ch_RFLAGScc,Ch_All]<>[] then
  377. exit;
  378. ait_label:
  379. exit;
  380. else
  381. ;
  382. end;
  383. InstrReadsFlags := false;
  384. end;
  385. function TX86AsmOptimizer.GetNextInstructionUsingReg(Current: tai; out Next: tai; reg: TRegister): Boolean;
  386. begin
  387. Next:=Current;
  388. repeat
  389. Result:=GetNextInstruction(Next,Next);
  390. until not (Result) or
  391. not(cs_opt_level3 in current_settings.optimizerswitches) or
  392. (Next.typ<>ait_instruction) or
  393. RegInInstruction(reg,Next) or
  394. is_calljmp(taicpu(Next).opcode);
  395. end;
  396. function TX86AsmOptimizer.GetNextInstructionUsingRegCount(Current: tai; out Next: tai; reg: TRegister): Cardinal;
  397. var
  398. GetNextResult: Boolean;
  399. begin
  400. Result:=0;
  401. Next:=Current;
  402. repeat
  403. GetNextResult := GetNextInstruction(Next,Next);
  404. if GetNextResult then
  405. Inc(Result)
  406. else
  407. { Must return zero upon hitting the end of the linked list without a match }
  408. Result := 0;
  409. until not (GetNextResult) or
  410. not(cs_opt_level3 in current_settings.optimizerswitches) or
  411. (Next.typ<>ait_instruction) or
  412. RegInInstruction(reg,Next) or
  413. is_calljmp(taicpu(Next).opcode);
  414. end;
  415. function TX86AsmOptimizer.GetNextInstructionUsingRegCond(Current: tai; out Next: tai; reg: TRegister; var JumpTracking: TLinkedList; var CrossJump: Boolean): Boolean;
  416. procedure TrackJump(Symbol: TAsmSymbol);
  417. var
  418. Search: TJumpTrackingItem;
  419. begin
  420. { See if an entry already exists in our jump tracking list
  421. (faster to search backwards due to the higher chance of
  422. matching destinations) }
  423. Search := TJumpTrackingItem(JumpTracking.Last);
  424. while Assigned(Search) do
  425. begin
  426. if Search.Symbol = Symbol then
  427. begin
  428. { Found it - remove it so it can be pushed to the front }
  429. JumpTracking.Remove(Search);
  430. Break;
  431. end;
  432. Search := TJumpTrackingItem(Search.Previous);
  433. end;
  434. if not Assigned(Search) then
  435. Search := TJumpTrackingItem.Create(JumpTargetOp(taicpu(Next))^.ref^.symbol);
  436. JumpTracking.Concat(Search);
  437. Search.IncRefs;
  438. end;
  439. function LabelAccountedFor(Symbol: TAsmSymbol): Boolean;
  440. var
  441. Search: TJumpTrackingItem;
  442. begin
  443. Result := False;
  444. { See if this label appears in the tracking list }
  445. Search := TJumpTrackingItem(JumpTracking.Last);
  446. while Assigned(Search) do
  447. begin
  448. if Search.Symbol = Symbol then
  449. begin
  450. { Found it - let's see what we can discover }
  451. if Search.Symbol.getrefs = Search.Refs then
  452. begin
  453. { Success - all the references are accounted for }
  454. JumpTracking.Remove(Search);
  455. Search.Free;
  456. { It is logically impossible for CrossJump to be false here
  457. because we must have run into a conditional jump for
  458. this label at some point }
  459. if not CrossJump then
  460. InternalError(2022041710);
  461. if JumpTracking.First = nil then
  462. { Tracking list is now empty - no more cross jumps }
  463. CrossJump := False;
  464. Result := True;
  465. Exit;
  466. end;
  467. { If the references don't match, it's possible to enter
  468. this label through other means, so drop out }
  469. Exit;
  470. end;
  471. Search := TJumpTrackingItem(Search.Previous);
  472. end;
  473. end;
  474. var
  475. Next_Label: tai;
  476. begin
  477. { Note, CrossJump keeps its input value if a conditional jump is not found - it doesn't get set to False }
  478. Next := Current;
  479. repeat
  480. Result := GetNextInstruction(Next,Next);
  481. if not Result then
  482. Break;
  483. if Next.typ = ait_align then
  484. Result := SkipAligns(Next, Next);
  485. if (Next.typ=ait_instruction) and is_calljmp(taicpu(Next).opcode) then
  486. if is_calljmpuncondret(taicpu(Next).opcode) then
  487. begin
  488. if (taicpu(Next).opcode = A_JMP) and
  489. { Remove dead code now to save time }
  490. RemoveDeadCodeAfterJump(taicpu(Next)) then
  491. { A jump was removed, but not the current instruction, and
  492. Result doesn't necessarily translate into an optimisation
  493. routine's Result, so use the "Force New Iteration" flag so
  494. mark a new pass }
  495. Include(OptsToCheck, aoc_ForceNewIteration);
  496. if not Assigned(JumpTracking) then
  497. begin
  498. { Cross-label optimisations often causes other optimisations
  499. to perform worse because they're not given the chance to
  500. optimise locally. In this case, don't do the cross-label
  501. optimisations yet, but flag them as a potential possibility
  502. for the next iteration of Pass 1 }
  503. if not NotFirstIteration then
  504. Include(OptsToCheck, aoc_ForceNewIteration);
  505. end
  506. else if IsJumpToLabel(taicpu(Next)) and
  507. GetNextInstruction(Next, Next_Label) and
  508. SkipAligns(Next_Label, Next_Label) then
  509. begin
  510. { If we have JMP .lbl, and the label after it has all of its
  511. references tracked, then this is probably an if-else style of
  512. block and we can keep tracking. If the label for this jump
  513. then appears later and is fully tracked, then it's the end
  514. of the if-else blocks and the code paths converge (thus
  515. marking the end of the cross-jump) }
  516. if (Next_Label.typ = ait_label) then
  517. begin
  518. if LabelAccountedFor(tai_label(Next_Label).labsym) then
  519. begin
  520. TrackJump(JumpTargetOp(taicpu(Next))^.ref^.symbol);
  521. Next := Next_Label;
  522. { CrossJump gets set to false by LabelAccountedFor if the
  523. list is completely emptied (as it indicates that all
  524. code paths have converged). We could avoid this nuance
  525. by moving the TrackJump call to before the
  526. LabelAccountedFor call, but this is slower in situations
  527. where LabelAccountedFor would return False due to the
  528. creation of a new object that is not used and destroyed
  529. soon after. }
  530. CrossJump := True;
  531. Continue;
  532. end;
  533. end
  534. else if (Next_Label.typ <> ait_marker) then
  535. { We just did a RemoveDeadCodeAfterJump, so either we find
  536. a label, the end of the procedure or some kind of marker}
  537. InternalError(2022041720);
  538. end;
  539. Result := False;
  540. Exit;
  541. end
  542. else
  543. begin
  544. if not Assigned(JumpTracking) then
  545. begin
  546. { Cross-label optimisations often causes other optimisations
  547. to perform worse because they're not given the chance to
  548. optimise locally. In this case, don't do the cross-label
  549. optimisations yet, but flag them as a potential possibility
  550. for the next iteration of Pass 1 }
  551. if not NotFirstIteration then
  552. Include(OptsToCheck, aoc_ForceNewIteration);
  553. end
  554. else if IsJumpToLabel(taicpu(Next)) then
  555. TrackJump(JumpTargetOp(taicpu(Next))^.ref^.symbol)
  556. else
  557. { Conditional jumps should always be a jump to label }
  558. InternalError(2022041701);
  559. CrossJump := True;
  560. Continue;
  561. end;
  562. if Next.typ = ait_label then
  563. begin
  564. if not Assigned(JumpTracking) then
  565. begin
  566. { Cross-label optimisations often causes other optimisations
  567. to perform worse because they're not given the chance to
  568. optimise locally. In this case, don't do the cross-label
  569. optimisations yet, but flag them as a potential possibility
  570. for the next iteration of Pass 1 }
  571. if not NotFirstIteration then
  572. Include(OptsToCheck, aoc_ForceNewIteration);
  573. end
  574. else if LabelAccountedFor(tai_label(Next).labsym) then
  575. Continue;
  576. { If we reach here, we're at a label that hasn't been seen before
  577. (or JumpTracking was nil) }
  578. Break;
  579. end;
  580. until not Result or
  581. not (cs_opt_level3 in current_settings.optimizerswitches) or
  582. not (Next.typ in [ait_label, ait_instruction]) or
  583. RegInInstruction(reg,Next);
  584. end;
  585. function TX86AsmOptimizer.GetNextInstructionUsingRegTrackingUse(Current: tai; out Next: tai; reg: TRegister): Boolean;
  586. begin
  587. if not(cs_opt_level3 in current_settings.optimizerswitches) then
  588. begin
  589. Result:=GetNextInstruction(Current,Next);
  590. exit;
  591. end;
  592. Next:=tai(Current.Next);
  593. Result:=false;
  594. while assigned(Next) do
  595. begin
  596. if ((Next.typ=ait_instruction) and is_calljmp(taicpu(Next).opcode) and not(taicpu(Next).opcode=A_CALL)) or
  597. ((Next.typ=ait_regalloc) and (getsupreg(tai_regalloc(Next).reg)=getsupreg(reg))) or
  598. ((Next.typ=ait_label) and not(labelCanBeSkipped(Tai_Label(Next)))) then
  599. exit
  600. else if (Next.typ=ait_instruction) and RegInInstruction(reg,Next) and not(taicpu(Next).opcode=A_CALL) then
  601. begin
  602. Result:=true;
  603. exit;
  604. end;
  605. Next:=tai(Next.Next);
  606. end;
  607. end;
  608. function TX86AsmOptimizer.InstructionLoadsFromReg(const reg: TRegister;const hp: tai): boolean;
  609. begin
  610. Result:=RegReadByInstruction(reg,hp);
  611. end;
  612. class function TX86AsmOptimizer.RegReadByInstruction(reg: TRegister; hp: tai): boolean;
  613. var
  614. p: taicpu;
  615. opcount: longint;
  616. begin
  617. RegReadByInstruction := false;
  618. if hp.typ <> ait_instruction then
  619. exit;
  620. p := taicpu(hp);
  621. case p.opcode of
  622. A_CALL:
  623. regreadbyinstruction := true;
  624. A_IMUL:
  625. case p.ops of
  626. 1:
  627. regReadByInstruction := RegInOp(reg,p.oper[0]^) or
  628. (
  629. ((getregtype(reg)=R_INTREGISTER) and (getsupreg(reg)=RS_EAX)) and
  630. ((getsubreg(reg)<>R_SUBH) or (p.opsize<>S_B))
  631. );
  632. 2,3:
  633. regReadByInstruction :=
  634. reginop(reg,p.oper[0]^) or
  635. reginop(reg,p.oper[1]^);
  636. else
  637. InternalError(2019112801);
  638. end;
  639. A_MUL:
  640. begin
  641. regReadByInstruction := RegInOp(reg,p.oper[0]^) or
  642. (
  643. ((getregtype(reg)=R_INTREGISTER) and (getsupreg(reg)=RS_EAX)) and
  644. ((getsubreg(reg)<>R_SUBH) or (p.opsize<>S_B))
  645. );
  646. end;
  647. A_IDIV,A_DIV:
  648. begin
  649. regReadByInstruction := RegInOp(reg,p.oper[0]^) or
  650. (
  651. (getregtype(reg)=R_INTREGISTER) and
  652. (
  653. (getsupreg(reg)=RS_EAX) or ((getsupreg(reg)=RS_EDX) and (p.opsize<>S_B))
  654. )
  655. );
  656. end;
  657. else
  658. begin
  659. if (p.opcode=A_LEA) and is_segment_reg(reg) then
  660. begin
  661. RegReadByInstruction := false;
  662. exit;
  663. end;
  664. for opcount := 0 to p.ops-1 do
  665. if (p.oper[opCount]^.typ = top_ref) and
  666. RegInRef(reg,p.oper[opcount]^.ref^) then
  667. begin
  668. RegReadByInstruction := true;
  669. exit
  670. end;
  671. { special handling for SSE MOVSD }
  672. if (p.opcode=A_MOVSD) and (p.ops>0) then
  673. begin
  674. if p.ops<>2 then
  675. internalerror(2017042702);
  676. regReadByInstruction := reginop(reg,p.oper[0]^) or
  677. (
  678. (p.oper[1]^.typ=top_reg) and (p.oper[0]^.typ=top_reg) and reginop(reg, p.oper[1]^)
  679. );
  680. exit;
  681. end;
  682. with insprop[p.opcode] do
  683. begin
  684. case getregtype(reg) of
  685. R_INTREGISTER:
  686. begin
  687. case getsupreg(reg) of
  688. RS_EAX:
  689. if [Ch_REAX,Ch_RWEAX,Ch_MEAX]*Ch<>[] then
  690. begin
  691. RegReadByInstruction := true;
  692. exit
  693. end;
  694. RS_ECX:
  695. if [Ch_RECX,Ch_RWECX,Ch_MECX]*Ch<>[] then
  696. begin
  697. RegReadByInstruction := true;
  698. exit
  699. end;
  700. RS_EDX:
  701. if [Ch_REDX,Ch_RWEDX,Ch_MEDX]*Ch<>[] then
  702. begin
  703. RegReadByInstruction := true;
  704. exit
  705. end;
  706. RS_EBX:
  707. if [Ch_REBX,Ch_RWEBX,Ch_MEBX]*Ch<>[] then
  708. begin
  709. RegReadByInstruction := true;
  710. exit
  711. end;
  712. RS_ESP:
  713. if [Ch_RESP,Ch_RWESP,Ch_MESP]*Ch<>[] then
  714. begin
  715. RegReadByInstruction := true;
  716. exit
  717. end;
  718. RS_EBP:
  719. if [Ch_REBP,Ch_RWEBP,Ch_MEBP]*Ch<>[] then
  720. begin
  721. RegReadByInstruction := true;
  722. exit
  723. end;
  724. RS_ESI:
  725. if [Ch_RESI,Ch_RWESI,Ch_MESI]*Ch<>[] then
  726. begin
  727. RegReadByInstruction := true;
  728. exit
  729. end;
  730. RS_EDI:
  731. if [Ch_REDI,Ch_RWEDI,Ch_MEDI]*Ch<>[] then
  732. begin
  733. RegReadByInstruction := true;
  734. exit
  735. end;
  736. end;
  737. end;
  738. R_MMREGISTER:
  739. begin
  740. case getsupreg(reg) of
  741. RS_XMM0:
  742. if [Ch_RXMM0,Ch_RWXMM0,Ch_MXMM0]*Ch<>[] then
  743. begin
  744. RegReadByInstruction := true;
  745. exit
  746. end;
  747. end;
  748. end;
  749. else
  750. ;
  751. end;
  752. if SuperRegistersEqual(reg,NR_DEFAULTFLAGS) then
  753. begin
  754. if (Ch_RFLAGScc in Ch) and not(getsubreg(reg) in [R_SUBW,R_SUBD,R_SUBQ]) then
  755. begin
  756. case p.condition of
  757. C_A,C_NBE, { CF=0 and ZF=0 }
  758. C_BE,C_NA: { CF=1 or ZF=1 }
  759. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGCARRY,R_SUBFLAGZERO];
  760. C_AE,C_NB,C_NC, { CF=0 }
  761. C_B,C_NAE,C_C: { CF=1 }
  762. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGCARRY];
  763. C_NE,C_NZ, { ZF=0 }
  764. C_E,C_Z: { ZF=1 }
  765. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGZERO];
  766. C_G,C_NLE, { ZF=0 and SF=OF }
  767. C_LE,C_NG: { ZF=1 or SF<>OF }
  768. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGZERO,R_SUBFLAGSIGN,R_SUBFLAGOVERFLOW];
  769. C_GE,C_NL, { SF=OF }
  770. C_L,C_NGE: { SF<>OF }
  771. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGSIGN,R_SUBFLAGOVERFLOW];
  772. C_NO, { OF=0 }
  773. C_O: { OF=1 }
  774. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGOVERFLOW];
  775. C_NP,C_PO, { PF=0 }
  776. C_P,C_PE: { PF=1 }
  777. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGPARITY];
  778. C_NS, { SF=0 }
  779. C_S: { SF=1 }
  780. RegReadByInstruction:=getsubreg(reg) in [R_SUBFLAGSIGN];
  781. else
  782. internalerror(2017042701);
  783. end;
  784. if RegReadByInstruction then
  785. exit;
  786. end;
  787. case getsubreg(reg) of
  788. R_SUBW,R_SUBD,R_SUBQ:
  789. RegReadByInstruction :=
  790. [Ch_RCarryFlag,Ch_RParityFlag,Ch_RAuxiliaryFlag,Ch_RZeroFlag,Ch_RSignFlag,Ch_ROverflowFlag,
  791. Ch_RWCarryFlag,Ch_RWParityFlag,Ch_RWAuxiliaryFlag,Ch_RWZeroFlag,Ch_RWSignFlag,Ch_RWOverflowFlag,
  792. Ch_RDirFlag,Ch_RFlags,Ch_RWFlags,Ch_RFLAGScc]*Ch<>[];
  793. R_SUBFLAGCARRY:
  794. RegReadByInstruction:=[Ch_RCarryFlag,Ch_RWCarryFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  795. R_SUBFLAGPARITY:
  796. RegReadByInstruction:=[Ch_RParityFlag,Ch_RWParityFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  797. R_SUBFLAGAUXILIARY:
  798. RegReadByInstruction:=[Ch_RAuxiliaryFlag,Ch_RWAuxiliaryFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  799. R_SUBFLAGZERO:
  800. RegReadByInstruction:=[Ch_RZeroFlag,Ch_RWZeroFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  801. R_SUBFLAGSIGN:
  802. RegReadByInstruction:=[Ch_RSignFlag,Ch_RWSignFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  803. R_SUBFLAGOVERFLOW:
  804. RegReadByInstruction:=[Ch_ROverflowFlag,Ch_RWOverflowFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  805. R_SUBFLAGINTERRUPT:
  806. RegReadByInstruction:=[Ch_RFlags,Ch_RWFlags]*Ch<>[];
  807. R_SUBFLAGDIRECTION:
  808. RegReadByInstruction:=[Ch_RDirFlag,Ch_RFlags,Ch_RWFlags]*Ch<>[];
  809. else
  810. internalerror(2017042601);
  811. end;
  812. exit;
  813. end;
  814. if (Ch_NoReadIfEqualRegs in Ch) and (p.ops=2) and
  815. (p.oper[0]^.typ=top_reg) and (p.oper[1]^.typ=top_reg) and
  816. (p.oper[0]^.reg=p.oper[1]^.reg) then
  817. exit;
  818. if ([CH_RWOP1,CH_ROP1,CH_MOP1]*Ch<>[]) and reginop(reg,p.oper[0]^) then
  819. begin
  820. RegReadByInstruction := true;
  821. exit
  822. end;
  823. if ([Ch_RWOP2,Ch_ROP2,Ch_MOP2]*Ch<>[]) and reginop(reg,p.oper[1]^) then
  824. begin
  825. RegReadByInstruction := true;
  826. exit
  827. end;
  828. if ([Ch_RWOP3,Ch_ROP3,Ch_MOP3]*Ch<>[]) and reginop(reg,p.oper[2]^) then
  829. begin
  830. RegReadByInstruction := true;
  831. exit
  832. end;
  833. if ([Ch_RWOP4,Ch_ROP4,Ch_MOP4]*Ch<>[]) and reginop(reg,p.oper[3]^) then
  834. begin
  835. RegReadByInstruction := true;
  836. exit
  837. end;
  838. end;
  839. end;
  840. end;
  841. end;
  842. function TX86AsmOptimizer.RegInInstruction(Reg: TRegister; p1: tai): Boolean;
  843. begin
  844. result:=false;
  845. if p1.typ<>ait_instruction then
  846. exit;
  847. if (Ch_All in insprop[taicpu(p1).opcode].Ch) then
  848. exit(true);
  849. if (getregtype(reg)=R_INTREGISTER) and
  850. { change information for xmm movsd are not correct }
  851. ((taicpu(p1).opcode<>A_MOVSD) or (taicpu(p1).ops=0)) then
  852. begin
  853. case getsupreg(reg) of
  854. { RS_EAX = RS_RAX on x86-64 }
  855. RS_EAX:
  856. result:=([Ch_REAX,Ch_RRAX,Ch_WEAX,Ch_WRAX,Ch_RWEAX,Ch_RWRAX,Ch_MEAX,Ch_MRAX]*insprop[taicpu(p1).opcode].Ch)<>[];
  857. RS_ECX:
  858. result:=([Ch_RECX,Ch_RRCX,Ch_WECX,Ch_WRCX,Ch_RWECX,Ch_RWRCX,Ch_MECX,Ch_MRCX]*insprop[taicpu(p1).opcode].Ch)<>[];
  859. RS_EDX:
  860. result:=([Ch_REDX,Ch_RRDX,Ch_WEDX,Ch_WRDX,Ch_RWEDX,Ch_RWRDX,Ch_MEDX,Ch_MRDX]*insprop[taicpu(p1).opcode].Ch)<>[];
  861. RS_EBX:
  862. result:=([Ch_REBX,Ch_RRBX,Ch_WEBX,Ch_WRBX,Ch_RWEBX,Ch_RWRBX,Ch_MEBX,Ch_MRBX]*insprop[taicpu(p1).opcode].Ch)<>[];
  863. RS_ESP:
  864. result:=([Ch_RESP,Ch_RRSP,Ch_WESP,Ch_WRSP,Ch_RWESP,Ch_RWRSP,Ch_MESP,Ch_MRSP]*insprop[taicpu(p1).opcode].Ch)<>[];
  865. RS_EBP:
  866. result:=([Ch_REBP,Ch_RRBP,Ch_WEBP,Ch_WRBP,Ch_RWEBP,Ch_RWRBP,Ch_MEBP,Ch_MRBP]*insprop[taicpu(p1).opcode].Ch)<>[];
  867. RS_ESI:
  868. result:=([Ch_RESI,Ch_RRSI,Ch_WESI,Ch_WRSI,Ch_RWESI,Ch_RWRSI,Ch_MESI,Ch_MRSI,Ch_RMemEDI]*insprop[taicpu(p1).opcode].Ch)<>[];
  869. RS_EDI:
  870. result:=([Ch_REDI,Ch_RRDI,Ch_WEDI,Ch_WRDI,Ch_RWEDI,Ch_RWRDI,Ch_MEDI,Ch_MRDI,Ch_WMemEDI]*insprop[taicpu(p1).opcode].Ch)<>[];
  871. else
  872. ;
  873. end;
  874. if result then
  875. exit;
  876. end
  877. else if getregtype(reg)=R_MMREGISTER then
  878. begin
  879. case getsupreg(reg) of
  880. RS_XMM0:
  881. result:=([Ch_RXMM0,Ch_WXMM0,Ch_RWXMM0,Ch_MXMM0]*insprop[taicpu(p1).opcode].Ch)<>[];
  882. else
  883. ;
  884. end;
  885. if result then
  886. exit;
  887. end
  888. else if SuperRegistersEqual(reg,NR_DEFAULTFLAGS) then
  889. begin
  890. if ([Ch_RFlags,Ch_WFlags,Ch_RWFlags,Ch_RFLAGScc]*insprop[taicpu(p1).opcode].Ch)<>[] then
  891. exit(true);
  892. case getsubreg(reg) of
  893. R_SUBFLAGCARRY:
  894. Result:=([Ch_RCarryFlag,Ch_RWCarryFlag,Ch_W0CarryFlag,Ch_W1CarryFlag,Ch_WCarryFlag,Ch_WUCarryFlag]*insprop[taicpu(p1).opcode].Ch)<>[];
  895. R_SUBFLAGPARITY:
  896. Result:=([Ch_RParityFlag,Ch_RWParityFlag,Ch_W0ParityFlag,Ch_W1ParityFlag,Ch_WParityFlag,Ch_WUParityFlag]*insprop[taicpu(p1).opcode].Ch)<>[];
  897. R_SUBFLAGAUXILIARY:
  898. Result:=([Ch_RAuxiliaryFlag,Ch_RWAuxiliaryFlag,Ch_W0AuxiliaryFlag,Ch_W1AuxiliaryFlag,Ch_WAuxiliaryFlag,Ch_WUAuxiliaryFlag]*insprop[taicpu(p1).opcode].Ch)<>[];
  899. R_SUBFLAGZERO:
  900. Result:=([Ch_RZeroFlag,Ch_RWZeroFlag,Ch_W0ZeroFlag,Ch_W1ZeroFlag,Ch_WZeroFlag,Ch_WUZeroFlag]*insprop[taicpu(p1).opcode].Ch)<>[];
  901. R_SUBFLAGSIGN:
  902. Result:=([Ch_RSignFlag,Ch_RWSignFlag,Ch_W0SignFlag,Ch_W1SignFlag,Ch_WSignFlag,Ch_WUSignFlag]*insprop[taicpu(p1).opcode].Ch)<>[];
  903. R_SUBFLAGOVERFLOW:
  904. Result:=([Ch_ROverflowFlag,Ch_RWOverflowFlag,Ch_W0OverflowFlag,Ch_W1OverflowFlag,Ch_WOverflowFlag,Ch_WUOverflowFlag]*insprop[taicpu(p1).opcode].Ch)<>[];
  905. R_SUBFLAGINTERRUPT:
  906. Result:=([Ch_W0IntFlag,Ch_W1IntFlag,Ch_WFlags]*insprop[taicpu(p1).opcode].Ch)<>[];
  907. R_SUBFLAGDIRECTION:
  908. Result:=([Ch_RDirFlag,Ch_W0DirFlag,Ch_W1DirFlag,Ch_WFlags]*insprop[taicpu(p1).opcode].Ch)<>[];
  909. R_SUBW,R_SUBD,R_SUBQ:
  910. { Everything except the direction bits }
  911. Result:=
  912. ([Ch_RCarryFlag,Ch_RParityFlag,Ch_RAuxiliaryFlag,Ch_RZeroFlag,Ch_RSignFlag,Ch_ROverflowFlag,
  913. Ch_WCarryFlag,Ch_WParityFlag,Ch_WAuxiliaryFlag,Ch_WZeroFlag,Ch_WSignFlag,Ch_WOverflowFlag,
  914. Ch_W0CarryFlag,Ch_W0ParityFlag,Ch_W0AuxiliaryFlag,Ch_W0ZeroFlag,Ch_W0SignFlag,Ch_W0OverflowFlag,
  915. Ch_W1CarryFlag,Ch_W1ParityFlag,Ch_W1AuxiliaryFlag,Ch_W1ZeroFlag,Ch_W1SignFlag,Ch_W1OverflowFlag,
  916. Ch_WUCarryFlag,Ch_WUParityFlag,Ch_WUAuxiliaryFlag,Ch_WUZeroFlag,Ch_WUSignFlag,Ch_WUOverflowFlag,
  917. Ch_RWCarryFlag,Ch_RWParityFlag,Ch_RWAuxiliaryFlag,Ch_RWZeroFlag,Ch_RWSignFlag,Ch_RWOverflowFlag
  918. ]*insprop[taicpu(p1).opcode].Ch)<>[];
  919. else
  920. ;
  921. end;
  922. if result then
  923. exit;
  924. end
  925. else if (getregtype(reg)=R_FPUREGISTER) and (Ch_FPU in insprop[taicpu(p1).opcode].Ch) then
  926. exit(true);
  927. Result:=inherited RegInInstruction(Reg, p1);
  928. end;
  929. function TX86AsmOptimizer.RegModifiedByInstruction(Reg: TRegister; p1: tai): boolean;
  930. const
  931. WriteOps: array[0..3] of set of TInsChange =
  932. ([CH_RWOP1,CH_WOP1,CH_MOP1],
  933. [Ch_RWOP2,Ch_WOP2,Ch_MOP2],
  934. [Ch_RWOP3,Ch_WOP3,Ch_MOP3],
  935. [Ch_RWOP4,Ch_WOP4,Ch_MOP4]);
  936. var
  937. OperIdx: Integer;
  938. begin
  939. Result := False;
  940. if p1.typ <> ait_instruction then
  941. exit;
  942. with insprop[taicpu(p1).opcode] do
  943. if SuperRegistersEqual(reg,NR_DEFAULTFLAGS) then
  944. begin
  945. case getsubreg(reg) of
  946. R_SUBW,R_SUBD,R_SUBQ:
  947. Result :=
  948. [Ch_WCarryFlag,Ch_WParityFlag,Ch_WAuxiliaryFlag,Ch_WZeroFlag,Ch_WSignFlag,Ch_WOverflowFlag,
  949. Ch_RWCarryFlag,Ch_RWParityFlag,Ch_RWAuxiliaryFlag,Ch_RWZeroFlag,Ch_RWSignFlag,Ch_RWOverflowFlag,
  950. Ch_W0DirFlag,Ch_W1DirFlag,Ch_W0IntFlag,Ch_W1IntFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  951. R_SUBFLAGCARRY:
  952. Result:=[Ch_WCarryFlag,Ch_RWCarryFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  953. R_SUBFLAGPARITY:
  954. Result:=[Ch_WParityFlag,Ch_RWParityFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  955. R_SUBFLAGAUXILIARY:
  956. Result:=[Ch_WAuxiliaryFlag,Ch_RWAuxiliaryFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  957. R_SUBFLAGZERO:
  958. Result:=[Ch_WZeroFlag,Ch_RWZeroFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  959. R_SUBFLAGSIGN:
  960. Result:=[Ch_WSignFlag,Ch_RWSignFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  961. R_SUBFLAGOVERFLOW:
  962. Result:=[Ch_WOverflowFlag,Ch_RWOverflowFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  963. R_SUBFLAGINTERRUPT:
  964. Result:=[Ch_W0IntFlag,Ch_W1IntFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  965. R_SUBFLAGDIRECTION:
  966. Result:=[Ch_W0DirFlag,Ch_W1DirFlag,Ch_WFlags,Ch_RWFlags]*Ch<>[];
  967. else
  968. internalerror(2017042602);
  969. end;
  970. exit;
  971. end;
  972. case taicpu(p1).opcode of
  973. A_CALL:
  974. { We could potentially set Result to False if the register in
  975. question is non-volatile for the subroutine's calling convention,
  976. but this would require detecting the calling convention in use and
  977. also assuming that the routine doesn't contain malformed assembly
  978. language, for example... so it could only be done under -O4 as it
  979. would be considered a side-effect. [Kit] }
  980. Result := True;
  981. A_MOVSD:
  982. { special handling for SSE MOVSD }
  983. if (taicpu(p1).ops>0) then
  984. begin
  985. if taicpu(p1).ops<>2 then
  986. internalerror(2017042703);
  987. Result := (taicpu(p1).oper[1]^.typ=top_reg) and RegInOp(reg,taicpu(p1).oper[1]^);
  988. end;
  989. { VMOVSS and VMOVSD has two and three operand flavours, this cannot modelled by x86ins.dat
  990. so fix it here (FK)
  991. }
  992. A_VMOVSS,
  993. A_VMOVSD:
  994. begin
  995. Result := (taicpu(p1).ops=3) and (taicpu(p1).oper[2]^.typ=top_reg) and RegInOp(reg,taicpu(p1).oper[2]^);
  996. exit;
  997. end;
  998. A_IMUL:
  999. Result := (taicpu(p1).oper[taicpu(p1).ops-1]^.typ=top_reg) and RegInOp(reg,taicpu(p1).oper[taicpu(p1).ops-1]^);
  1000. else
  1001. ;
  1002. end;
  1003. if Result then
  1004. exit;
  1005. with insprop[taicpu(p1).opcode] do
  1006. begin
  1007. if getregtype(reg)=R_INTREGISTER then
  1008. begin
  1009. case getsupreg(reg) of
  1010. RS_EAX:
  1011. if [Ch_WEAX,Ch_RWEAX,Ch_MEAX,Ch_WRAX,Ch_RWRAX,Ch_MRAX]*Ch<>[] then
  1012. begin
  1013. Result := True;
  1014. exit
  1015. end;
  1016. RS_ECX:
  1017. if [Ch_WECX,Ch_RWECX,Ch_MECX,Ch_WRCX,Ch_RWRCX,Ch_MRCX]*Ch<>[] then
  1018. begin
  1019. Result := True;
  1020. exit
  1021. end;
  1022. RS_EDX:
  1023. if [Ch_WEDX,Ch_RWEDX,Ch_MEDX,Ch_WRDX,Ch_RWRDX,Ch_MRDX]*Ch<>[] then
  1024. begin
  1025. Result := True;
  1026. exit
  1027. end;
  1028. RS_EBX:
  1029. if [Ch_WEBX,Ch_RWEBX,Ch_MEBX,Ch_WRBX,Ch_RWRBX,Ch_MRBX]*Ch<>[] then
  1030. begin
  1031. Result := True;
  1032. exit
  1033. end;
  1034. RS_ESP:
  1035. if [Ch_WESP,Ch_RWESP,Ch_MESP,Ch_WRSP,Ch_RWRSP,Ch_MRSP]*Ch<>[] then
  1036. begin
  1037. Result := True;
  1038. exit
  1039. end;
  1040. RS_EBP:
  1041. if [Ch_WEBP,Ch_RWEBP,Ch_MEBP,Ch_WRBP,Ch_RWRBP,Ch_MRBP]*Ch<>[] then
  1042. begin
  1043. Result := True;
  1044. exit
  1045. end;
  1046. RS_ESI:
  1047. if [Ch_WESI,Ch_RWESI,Ch_MESI,Ch_WRSI,Ch_RWRSI,Ch_MRSI]*Ch<>[] then
  1048. begin
  1049. Result := True;
  1050. exit
  1051. end;
  1052. RS_EDI:
  1053. if [Ch_WEDI,Ch_RWEDI,Ch_MEDI,Ch_WRDI,Ch_RWRDI,Ch_MRDI]*Ch<>[] then
  1054. begin
  1055. Result := True;
  1056. exit
  1057. end;
  1058. end;
  1059. end;
  1060. for OperIdx := 0 to taicpu(p1).ops - 1 do
  1061. if (WriteOps[OperIdx]*Ch<>[]) and
  1062. { The register doesn't get modified inside a reference }
  1063. (taicpu(p1).oper[OperIdx]^.typ = top_reg) and
  1064. SuperRegistersEqual(reg,taicpu(p1).oper[OperIdx]^.reg) then
  1065. begin
  1066. Result := true;
  1067. exit
  1068. end;
  1069. end;
  1070. end;
  1071. {$ifdef DEBUG_AOPTCPU}
  1072. procedure TX86AsmOptimizer.DebugMsg(const s: string;p : tai);
  1073. begin
  1074. asml.insertbefore(tai_comment.Create(strpnew(s)), p);
  1075. end;
  1076. function debug_tostr(i: tcgint): string; inline;
  1077. begin
  1078. Result := tostr(i);
  1079. end;
  1080. function debug_regname(r: TRegister): string; inline;
  1081. begin
  1082. Result := '%' + std_regname(r);
  1083. end;
  1084. { Debug output function - creates a string representation of an operator }
  1085. function debug_operstr(oper: TOper): string;
  1086. begin
  1087. case oper.typ of
  1088. top_const:
  1089. Result := '$' + debug_tostr(oper.val);
  1090. top_reg:
  1091. Result := debug_regname(oper.reg);
  1092. top_ref:
  1093. begin
  1094. if oper.ref^.offset <> 0 then
  1095. Result := debug_tostr(oper.ref^.offset) + '('
  1096. else
  1097. Result := '(';
  1098. if (oper.ref^.base <> NR_INVALID) and (oper.ref^.base <> NR_NO) then
  1099. begin
  1100. Result := Result + debug_regname(oper.ref^.base);
  1101. if (oper.ref^.index <> NR_INVALID) and (oper.ref^.index <> NR_NO) then
  1102. Result := Result + ',' + debug_regname(oper.ref^.index);
  1103. end
  1104. else
  1105. if (oper.ref^.index <> NR_INVALID) and (oper.ref^.index <> NR_NO) then
  1106. Result := Result + debug_regname(oper.ref^.index);
  1107. if (oper.ref^.scalefactor > 1) then
  1108. Result := Result + ',' + debug_tostr(oper.ref^.scalefactor) + ')'
  1109. else
  1110. Result := Result + ')';
  1111. end;
  1112. else
  1113. Result := '[UNKNOWN]';
  1114. end;
  1115. end;
  1116. function debug_op2str(opcode: tasmop): string; inline;
  1117. begin
  1118. Result := std_op2str[opcode];
  1119. end;
  1120. function debug_opsize2str(opsize: topsize): string; inline;
  1121. begin
  1122. Result := gas_opsize2str[opsize];
  1123. end;
  1124. {$else DEBUG_AOPTCPU}
  1125. procedure TX86AsmOptimizer.DebugMsg(const s: string;p : tai);inline;
  1126. begin
  1127. end;
  1128. function debug_tostr(i: tcgint): string; inline;
  1129. begin
  1130. Result := '';
  1131. end;
  1132. function debug_regname(r: TRegister): string; inline;
  1133. begin
  1134. Result := '';
  1135. end;
  1136. function debug_operstr(oper: TOper): string; inline;
  1137. begin
  1138. Result := '';
  1139. end;
  1140. function debug_op2str(opcode: tasmop): string; inline;
  1141. begin
  1142. Result := '';
  1143. end;
  1144. function debug_opsize2str(opsize: topsize): string; inline;
  1145. begin
  1146. Result := '';
  1147. end;
  1148. {$endif DEBUG_AOPTCPU}
  1149. class function TX86AsmOptimizer.IsMOVZXAcceptable: Boolean; inline;
  1150. begin
  1151. {$ifdef x86_64}
  1152. { Always fine on x86-64 }
  1153. Result := True;
  1154. {$else x86_64}
  1155. Result :=
  1156. {$ifdef i8086}
  1157. (current_settings.cputype >= cpu_386) and
  1158. {$endif i8086}
  1159. (
  1160. { Always accept if optimising for size }
  1161. (cs_opt_size in current_settings.optimizerswitches) or
  1162. { From the Pentium II onwards, MOVZX only takes 1 cycle. [Kit] }
  1163. (current_settings.optimizecputype >= cpu_Pentium2)
  1164. );
  1165. {$endif x86_64}
  1166. end;
  1167. { Attempts to allocate a volatile integer register for use between p and hp,
  1168. using AUsedRegs for the current register usage information. Returns NR_NO
  1169. if no free register could be found }
  1170. function TX86AsmOptimizer.GetIntRegisterBetween(RegSize: TSubRegister; var AUsedRegs: TAllUsedRegs; p, hp: tai): TRegister;
  1171. var
  1172. RegSet: TCPURegisterSet;
  1173. CurrentSuperReg: Integer;
  1174. CurrentReg: TRegister;
  1175. Currentp: tai;
  1176. Breakout: Boolean;
  1177. begin
  1178. Result := NR_NO;
  1179. RegSet :=
  1180. paramanager.get_volatile_registers_int(current_procinfo.procdef.proccalloption) +
  1181. current_procinfo.saved_regs_int;
  1182. for CurrentSuperReg in RegSet do
  1183. begin
  1184. CurrentReg := newreg(R_INTREGISTER, TSuperRegister(CurrentSuperReg), RegSize);
  1185. if not AUsedRegs[R_INTREGISTER].IsUsed(CurrentReg)
  1186. {$if defined(i386) or defined(i8086)}
  1187. { If the target size is 8-bit, make sure we can actually encode it }
  1188. and (
  1189. (RegSize >= R_SUBW) or { Not R_SUBL or R_SUBH }
  1190. (GetSupReg(CurrentReg) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX])
  1191. )
  1192. {$endif i386 or i8086}
  1193. then
  1194. begin
  1195. Currentp := p;
  1196. Breakout := False;
  1197. while not Breakout and GetNextInstruction(Currentp, Currentp) and (Currentp <> hp) do
  1198. begin
  1199. case Currentp.typ of
  1200. ait_instruction:
  1201. begin
  1202. if RegInInstruction(CurrentReg, Currentp) then
  1203. begin
  1204. Breakout := True;
  1205. Break;
  1206. end;
  1207. { Cannot allocate across an unconditional jump }
  1208. if is_calljmpuncondret(taicpu(Currentp).opcode) then
  1209. Exit;
  1210. end;
  1211. ait_marker:
  1212. { Don't try anything more if a marker is hit }
  1213. Exit;
  1214. ait_regalloc:
  1215. if (tai_regalloc(Currentp).ratype <> ra_dealloc) and SuperRegistersEqual(CurrentReg, tai_regalloc(Currentp).reg) then
  1216. begin
  1217. Breakout := True;
  1218. Break;
  1219. end;
  1220. else
  1221. ;
  1222. end;
  1223. end;
  1224. if Breakout then
  1225. { Try the next register }
  1226. Continue;
  1227. { We have a free register available }
  1228. Result := CurrentReg;
  1229. AllocRegBetween(CurrentReg, p, hp, AUsedRegs);
  1230. Exit;
  1231. end;
  1232. end;
  1233. end;
  1234. { Attempts to allocate a volatile MM register for use between p and hp,
  1235. using AUsedRegs for the current register usage information. Returns NR_NO
  1236. if no free register could be found }
  1237. function TX86AsmOptimizer.GetMMRegisterBetween(RegSize: TSubRegister; var AUsedRegs: TAllUsedRegs; p, hp: tai): TRegister;
  1238. var
  1239. RegSet: TCPURegisterSet;
  1240. CurrentSuperReg: Integer;
  1241. CurrentReg: TRegister;
  1242. Currentp: tai;
  1243. Breakout: Boolean;
  1244. begin
  1245. Result := NR_NO;
  1246. RegSet :=
  1247. paramanager.get_volatile_registers_mm(current_procinfo.procdef.proccalloption) +
  1248. current_procinfo.saved_regs_mm;
  1249. for CurrentSuperReg in RegSet do
  1250. begin
  1251. CurrentReg := newreg(R_MMREGISTER, TSuperRegister(CurrentSuperReg), RegSize);
  1252. if not AUsedRegs[R_MMREGISTER].IsUsed(CurrentReg) then
  1253. begin
  1254. Currentp := p;
  1255. Breakout := False;
  1256. while not Breakout and GetNextInstruction(Currentp, Currentp) and (Currentp <> hp) do
  1257. begin
  1258. case Currentp.typ of
  1259. ait_instruction:
  1260. begin
  1261. if RegInInstruction(CurrentReg, Currentp) then
  1262. begin
  1263. Breakout := True;
  1264. Break;
  1265. end;
  1266. { Cannot allocate across an unconditional jump }
  1267. if is_calljmpuncondret(taicpu(Currentp).opcode) then
  1268. Exit;
  1269. end;
  1270. ait_marker:
  1271. { Don't try anything more if a marker is hit }
  1272. Exit;
  1273. ait_regalloc:
  1274. if (tai_regalloc(Currentp).ratype <> ra_dealloc) and SuperRegistersEqual(CurrentReg, tai_regalloc(Currentp).reg) then
  1275. begin
  1276. Breakout := True;
  1277. Break;
  1278. end;
  1279. else
  1280. ;
  1281. end;
  1282. end;
  1283. if Breakout then
  1284. { Try the next register }
  1285. Continue;
  1286. { We have a free register available }
  1287. Result := CurrentReg;
  1288. AllocRegBetween(CurrentReg, p, hp, AUsedRegs);
  1289. Exit;
  1290. end;
  1291. end;
  1292. end;
  1293. class function TX86AsmOptimizer.Reg1WriteOverwritesReg2Entirely(reg1, reg2: tregister): boolean;
  1294. begin
  1295. if not SuperRegistersEqual(reg1,reg2) then
  1296. exit(false);
  1297. if getregtype(reg1)<>R_INTREGISTER then
  1298. exit(true); {because SuperRegisterEqual is true}
  1299. case getsubreg(reg1) of
  1300. { A write to R_SUBL doesn't change R_SUBH and if reg2 is R_SUBW or
  1301. higher, it preserves the high bits, so the new value depends on
  1302. reg2's previous value. In other words, it is equivalent to doing:
  1303. reg2 := (reg2 and $ffffff00) or byte(reg1); }
  1304. R_SUBL:
  1305. exit(getsubreg(reg2)=R_SUBL);
  1306. { A write to R_SUBH doesn't change R_SUBL and if reg2 is R_SUBW or
  1307. higher, it actually does a:
  1308. reg2 := (reg2 and $ffff00ff) or (reg1 and $ff00); }
  1309. R_SUBH:
  1310. exit(getsubreg(reg2)=R_SUBH);
  1311. { If reg2 is R_SUBD or larger, a write to R_SUBW preserves the high 16
  1312. bits of reg2:
  1313. reg2 := (reg2 and $ffff0000) or word(reg1); }
  1314. R_SUBW:
  1315. exit(getsubreg(reg2) in [R_SUBL,R_SUBH,R_SUBW]);
  1316. { a write to R_SUBD always overwrites every other subregister,
  1317. because it clears the high 32 bits of R_SUBQ on x86_64 }
  1318. R_SUBD,
  1319. R_SUBQ:
  1320. exit(true);
  1321. else
  1322. internalerror(2017042801);
  1323. end;
  1324. end;
  1325. class function TX86AsmOptimizer.Reg1ReadDependsOnReg2(reg1, reg2: tregister): boolean;
  1326. begin
  1327. if not SuperRegistersEqual(reg1,reg2) then
  1328. exit(false);
  1329. if getregtype(reg1)<>R_INTREGISTER then
  1330. exit(true); {because SuperRegisterEqual is true}
  1331. case getsubreg(reg1) of
  1332. R_SUBL:
  1333. exit(getsubreg(reg2)<>R_SUBH);
  1334. R_SUBH:
  1335. exit(getsubreg(reg2)<>R_SUBL);
  1336. R_SUBW,
  1337. R_SUBD,
  1338. R_SUBQ:
  1339. exit(true);
  1340. else
  1341. internalerror(2017042802);
  1342. end;
  1343. end;
  1344. function TX86AsmOptimizer.PrePeepholeOptSxx(var p : tai) : boolean;
  1345. var
  1346. hp1 : tai;
  1347. l : TCGInt;
  1348. begin
  1349. result:=false;
  1350. { changes the code sequence
  1351. shr/sar const1, x
  1352. shl const2, x
  1353. to
  1354. either "sar/and", "shl/and" or just "and" depending on const1 and const2 }
  1355. if GetNextInstruction(p, hp1) and
  1356. MatchInstruction(hp1,A_SHL,[]) and
  1357. (taicpu(p).oper[0]^.typ = top_const) and
  1358. (taicpu(hp1).oper[0]^.typ = top_const) and
  1359. (taicpu(hp1).opsize = taicpu(p).opsize) and
  1360. (taicpu(hp1).oper[1]^.typ = taicpu(p).oper[1]^.typ) and
  1361. OpsEqual(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^) then
  1362. begin
  1363. if (taicpu(p).oper[0]^.val > taicpu(hp1).oper[0]^.val) and
  1364. not(cs_opt_size in current_settings.optimizerswitches) then
  1365. begin
  1366. { shr/sar const1, %reg
  1367. shl const2, %reg
  1368. with const1 > const2 }
  1369. taicpu(p).loadConst(0,taicpu(p).oper[0]^.val-taicpu(hp1).oper[0]^.val);
  1370. taicpu(hp1).opcode := A_AND;
  1371. l := (1 shl (taicpu(hp1).oper[0]^.val)) - 1;
  1372. case taicpu(p).opsize Of
  1373. S_B: taicpu(hp1).loadConst(0,l Xor $ff);
  1374. S_W: taicpu(hp1).loadConst(0,l Xor $ffff);
  1375. S_L: taicpu(hp1).loadConst(0,l Xor tcgint($ffffffff));
  1376. S_Q: taicpu(hp1).loadConst(0,l Xor tcgint($ffffffffffffffff));
  1377. else
  1378. Internalerror(2017050703)
  1379. end;
  1380. end
  1381. else if (taicpu(p).oper[0]^.val<taicpu(hp1).oper[0]^.val) and
  1382. not(cs_opt_size in current_settings.optimizerswitches) then
  1383. begin
  1384. { shr/sar const1, %reg
  1385. shl const2, %reg
  1386. with const1 < const2 }
  1387. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val-taicpu(p).oper[0]^.val);
  1388. taicpu(p).opcode := A_AND;
  1389. l := (1 shl (taicpu(p).oper[0]^.val))-1;
  1390. case taicpu(p).opsize Of
  1391. S_B: taicpu(p).loadConst(0,l Xor $ff);
  1392. S_W: taicpu(p).loadConst(0,l Xor $ffff);
  1393. S_L: taicpu(p).loadConst(0,l Xor tcgint($ffffffff));
  1394. S_Q: taicpu(p).loadConst(0,l Xor tcgint($ffffffffffffffff));
  1395. else
  1396. Internalerror(2017050702)
  1397. end;
  1398. end
  1399. else if (taicpu(p).oper[0]^.val = taicpu(hp1).oper[0]^.val) then
  1400. begin
  1401. { shr/sar const1, %reg
  1402. shl const2, %reg
  1403. with const1 = const2 }
  1404. taicpu(p).opcode := A_AND;
  1405. l := (1 shl (taicpu(p).oper[0]^.val))-1;
  1406. case taicpu(p).opsize Of
  1407. S_B: taicpu(p).loadConst(0,l Xor $ff);
  1408. S_W: taicpu(p).loadConst(0,l Xor $ffff);
  1409. S_L: taicpu(p).loadConst(0,l Xor tcgint($ffffffff));
  1410. S_Q: taicpu(p).loadConst(0,l Xor tcgint($ffffffffffffffff));
  1411. else
  1412. Internalerror(2017050701)
  1413. end;
  1414. RemoveInstruction(hp1);
  1415. end;
  1416. end;
  1417. end;
  1418. function TX86AsmOptimizer.PrePeepholeOptIMUL(var p : tai) : boolean;
  1419. var
  1420. opsize : topsize;
  1421. hp1, hp2 : tai;
  1422. tmpref : treference;
  1423. ShiftValue : Cardinal;
  1424. BaseValue : TCGInt;
  1425. begin
  1426. result:=false;
  1427. opsize:=taicpu(p).opsize;
  1428. { changes certain "imul const, %reg"'s to lea sequences }
  1429. if (MatchOpType(taicpu(p),top_const,top_reg) or
  1430. MatchOpType(taicpu(p),top_const,top_reg,top_reg)) and
  1431. (opsize in [S_L{$ifdef x86_64},S_Q{$endif x86_64}]) then
  1432. if (taicpu(p).oper[0]^.val = 1) then
  1433. if (taicpu(p).ops = 2) then
  1434. { remove "imul $1, reg" }
  1435. begin
  1436. DebugMsg(SPeepholeOptimization + 'Imul2Nop done',p);
  1437. Result := RemoveCurrentP(p);
  1438. end
  1439. else
  1440. { change "imul $1, reg1, reg2" to "mov reg1, reg2" }
  1441. begin
  1442. hp1 := taicpu.Op_Reg_Reg(A_MOV, opsize, taicpu(p).oper[1]^.reg,taicpu(p).oper[2]^.reg);
  1443. taicpu(hp1).fileinfo := taicpu(p).fileinfo;
  1444. asml.InsertAfter(hp1, p);
  1445. DebugMsg(SPeepholeOptimization + 'Imul2Mov done',p);
  1446. RemoveCurrentP(p, hp1);
  1447. Result := True;
  1448. end
  1449. else if ((taicpu(p).ops <= 2) or
  1450. (taicpu(p).oper[2]^.typ = Top_Reg)) and
  1451. not(cs_opt_size in current_settings.optimizerswitches) and
  1452. (not(GetNextInstruction(p, hp1)) or
  1453. not((tai(hp1).typ = ait_instruction) and
  1454. ((taicpu(hp1).opcode=A_Jcc) and
  1455. (taicpu(hp1).condition in [C_O,C_NO])))) then
  1456. begin
  1457. {
  1458. imul X, reg1, reg2 to
  1459. lea (reg1,reg1,Y), reg2
  1460. shl ZZ,reg2
  1461. imul XX, reg1 to
  1462. lea (reg1,reg1,YY), reg1
  1463. shl ZZ,reg2
  1464. This optimziation makes sense for pretty much every x86, except the VIA Nano3000: it has IMUL latency 2, lea/shl pair as well,
  1465. it does not exist as a separate optimization target in FPC though.
  1466. This optimziation can be applied as long as only two bits are set in the constant and those two bits are separated by
  1467. at most two zeros
  1468. }
  1469. reference_reset(tmpref,1,[]);
  1470. if (PopCnt(QWord(taicpu(p).oper[0]^.val))=2) and (BsrQWord(taicpu(p).oper[0]^.val)-BsfQWord(taicpu(p).oper[0]^.val)<=3) then
  1471. begin
  1472. ShiftValue:=BsfQWord(taicpu(p).oper[0]^.val);
  1473. BaseValue:=taicpu(p).oper[0]^.val shr ShiftValue;
  1474. TmpRef.base := taicpu(p).oper[1]^.reg;
  1475. TmpRef.index := taicpu(p).oper[1]^.reg;
  1476. if not(BaseValue in [3,5,9]) then
  1477. Internalerror(2018110101);
  1478. TmpRef.ScaleFactor := BaseValue-1;
  1479. if (taicpu(p).ops = 2) then
  1480. hp1 := taicpu.op_ref_reg(A_LEA, opsize, TmpRef, taicpu(p).oper[1]^.reg)
  1481. else
  1482. hp1 := taicpu.op_ref_reg(A_LEA, opsize, TmpRef, taicpu(p).oper[2]^.reg);
  1483. AsmL.InsertAfter(hp1,p);
  1484. DebugMsg(SPeepholeOptimization + 'Imul2LeaShl done',p);
  1485. taicpu(hp1).fileinfo:=taicpu(p).fileinfo;
  1486. RemoveCurrentP(p, hp1);
  1487. if ShiftValue>0 then
  1488. begin
  1489. hp2 := taicpu.op_const_reg(A_SHL, opsize, ShiftValue, taicpu(hp1).oper[1]^.reg);
  1490. AsmL.InsertAfter(hp2,hp1);
  1491. taicpu(hp2).fileinfo:=taicpu(hp1).fileinfo;
  1492. end;
  1493. Result := True;
  1494. end;
  1495. end;
  1496. end;
  1497. function TX86AsmOptimizer.PrePeepholeOptAND(var p : tai) : boolean;
  1498. begin
  1499. Result := False;
  1500. if MatchOperand(taicpu(p).oper[0]^, 0) and
  1501. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  1502. begin
  1503. DebugMsg(SPeepholeOptimization + 'AND 0 -> MOV 0', p);
  1504. taicpu(p).opcode := A_MOV;
  1505. Result := True;
  1506. end;
  1507. end;
  1508. function TX86AsmOptimizer.RegLoadedWithNewValue(reg: tregister; hp: tai): boolean;
  1509. var
  1510. p: taicpu absolute hp; { Implicit typecast }
  1511. i: Integer;
  1512. begin
  1513. Result := False;
  1514. if not assigned(hp) or
  1515. (hp.typ <> ait_instruction) then
  1516. Exit;
  1517. Prefetch(insprop[p.opcode]);
  1518. if SuperRegistersEqual(reg,NR_DEFAULTFLAGS) then
  1519. with insprop[p.opcode] do
  1520. begin
  1521. case getsubreg(reg) of
  1522. R_SUBW,R_SUBD,R_SUBQ:
  1523. Result:=
  1524. { ZF, CF, OF, SF, PF and AF must all be set in some way (ordered so the most
  1525. uncommon flags are checked first }
  1526. ([Ch_W0AuxiliaryFlag,Ch_W1AuxiliaryFlag,Ch_WAuxiliaryFlag,Ch_WUAuxiliaryFlag,Ch_WFlags] * Ch <> []) and
  1527. ([Ch_W0ParityFlag,Ch_W1ParityFlag,Ch_WParityFlag,Ch_WUParityFlag,Ch_WFlags]*Ch <> []) and
  1528. ([Ch_W0SignFlag,Ch_W1SignFlag,Ch_WSignFlag,Ch_WUSignFlag,Ch_WFlags]*Ch <> []) and
  1529. ([Ch_W0OverflowFlag,Ch_W1OverflowFlag,Ch_WOverflowFlag,Ch_WUOverflowFlag,Ch_WFlags]*Ch <> []) and
  1530. ([Ch_W0CarryFlag,Ch_W1CarryFlag,Ch_WCarryFlag,Ch_WUCarryFlag,Ch_WFlags]*Ch <> []) and
  1531. ([Ch_W0ZeroFlag,Ch_W1ZeroFlag,Ch_WZeroFlag,Ch_WUZeroFlag,Ch_WFlags]*Ch <> []);
  1532. R_SUBFLAGCARRY:
  1533. Result:=[Ch_W0CarryFlag,Ch_W1CarryFlag,Ch_WCarryFlag,Ch_WUCarryFlag,Ch_WFlags]*Ch<>[];
  1534. R_SUBFLAGPARITY:
  1535. Result:=[Ch_W0ParityFlag,Ch_W1ParityFlag,Ch_WParityFlag,Ch_WUParityFlag,Ch_WFlags]*Ch<>[];
  1536. R_SUBFLAGAUXILIARY:
  1537. Result:=[Ch_W0AuxiliaryFlag,Ch_W1AuxiliaryFlag,Ch_WAuxiliaryFlag,Ch_WUAuxiliaryFlag,Ch_WFlags]*Ch<>[];
  1538. R_SUBFLAGZERO:
  1539. Result:=[Ch_W0ZeroFlag,Ch_W1ZeroFlag,Ch_WZeroFlag,Ch_WUZeroFlag,Ch_WFlags]*Ch<>[];
  1540. R_SUBFLAGSIGN:
  1541. Result:=[Ch_W0SignFlag,Ch_W1SignFlag,Ch_WSignFlag,Ch_WUSignFlag,Ch_WFlags]*Ch<>[];
  1542. R_SUBFLAGOVERFLOW:
  1543. Result:=[Ch_W0OverflowFlag,Ch_W1OverflowFlag,Ch_WOverflowFlag,Ch_WUOverflowFlag,Ch_WFlags]*Ch<>[];
  1544. R_SUBFLAGINTERRUPT:
  1545. Result:=[Ch_W0IntFlag,Ch_W1IntFlag,Ch_WFlags]*Ch<>[];
  1546. R_SUBFLAGDIRECTION:
  1547. Result:=[Ch_W0DirFlag,Ch_W1DirFlag,Ch_WFlags]*Ch<>[];
  1548. else
  1549. internalerror(2017050501);
  1550. end;
  1551. exit;
  1552. end;
  1553. { Handle special cases first }
  1554. case p.opcode of
  1555. A_MOV, A_MOVZX, A_MOVSX, A_LEA, A_VMOVSS, A_VMOVSD, A_VMOVAPD,
  1556. A_VMOVAPS, A_VMOVQ, A_MOVSS, A_MOVSD, A_MOVQ, A_MOVAPD, A_MOVAPS:
  1557. begin
  1558. Result :=
  1559. (p.ops=2) and { A_MOVSD can have zero operands, so this check is needed }
  1560. (p.oper[1]^.typ = top_reg) and
  1561. (Reg1WriteOverwritesReg2Entirely(p.oper[1]^.reg,reg)) and
  1562. (
  1563. (p.oper[0]^.typ = top_const) or
  1564. (
  1565. (p.oper[0]^.typ = top_reg) and
  1566. not(Reg1ReadDependsOnReg2(p.oper[0]^.reg,reg))
  1567. ) or (
  1568. (p.oper[0]^.typ = top_ref) and
  1569. not RegInRef(reg,p.oper[0]^.ref^)
  1570. )
  1571. );
  1572. end;
  1573. A_MUL, A_IMUL:
  1574. Result :=
  1575. (
  1576. (p.ops=3) and { IMUL only }
  1577. (Reg1WriteOverwritesReg2Entirely(p.oper[2]^.reg,reg)) and
  1578. (
  1579. (
  1580. (p.oper[1]^.typ=top_reg) and
  1581. not Reg1ReadDependsOnReg2(p.oper[1]^.reg,reg)
  1582. ) or (
  1583. (p.oper[1]^.typ=top_ref) and
  1584. not RegInRef(reg,p.oper[1]^.ref^)
  1585. )
  1586. )
  1587. ) or (
  1588. (
  1589. (p.ops=1) and
  1590. (
  1591. (
  1592. (
  1593. (p.oper[0]^.typ=top_reg) and
  1594. not Reg1ReadDependsOnReg2(p.oper[0]^.reg,reg)
  1595. )
  1596. ) or (
  1597. (p.oper[0]^.typ=top_ref) and
  1598. not RegInRef(reg,p.oper[0]^.ref^)
  1599. )
  1600. ) and (
  1601. (
  1602. (p.opsize=S_B) and
  1603. Reg1WriteOverwritesReg2Entirely(NR_AX,reg) and
  1604. not Reg1ReadDependsOnReg2(NR_AL,reg)
  1605. ) or (
  1606. (p.opsize=S_W) and
  1607. Reg1WriteOverwritesReg2Entirely(NR_DX,reg)
  1608. ) or (
  1609. (p.opsize=S_L) and
  1610. Reg1WriteOverwritesReg2Entirely(NR_EDX,reg)
  1611. {$ifdef x86_64}
  1612. ) or (
  1613. (p.opsize=S_Q) and
  1614. Reg1WriteOverwritesReg2Entirely(NR_RDX,reg)
  1615. {$endif x86_64}
  1616. )
  1617. )
  1618. )
  1619. );
  1620. A_CBW:
  1621. Result := Reg1WriteOverwritesReg2Entirely(NR_AX,reg) and not(Reg1ReadDependsOnReg2(NR_AL,reg));
  1622. {$ifndef x86_64}
  1623. A_LDS:
  1624. Result := (reg=NR_DS) and not(RegInRef(reg,p.oper[0]^.ref^));
  1625. A_LES:
  1626. Result := (reg=NR_ES) and not(RegInRef(reg,p.oper[0]^.ref^));
  1627. {$endif not x86_64}
  1628. A_LFS:
  1629. Result := (reg=NR_FS) and not(RegInRef(reg,p.oper[0]^.ref^));
  1630. A_LGS:
  1631. Result := (reg=NR_GS) and not(RegInRef(reg,p.oper[0]^.ref^));
  1632. A_LSS:
  1633. Result := (reg=NR_SS) and not(RegInRef(reg,p.oper[0]^.ref^));
  1634. A_LAHF{$ifndef x86_64}, A_AAM{$endif not x86_64}:
  1635. Result := Reg1WriteOverwritesReg2Entirely(NR_AH,reg);
  1636. A_LODSB:
  1637. Result := Reg1WriteOverwritesReg2Entirely(NR_AL,reg);
  1638. A_LODSW:
  1639. Result := Reg1WriteOverwritesReg2Entirely(NR_AX,reg);
  1640. {$ifdef x86_64}
  1641. A_LODSQ:
  1642. Result := Reg1WriteOverwritesReg2Entirely(NR_RAX,reg);
  1643. {$endif x86_64}
  1644. A_LODSD:
  1645. Result := Reg1WriteOverwritesReg2Entirely(NR_EAX,reg);
  1646. A_FSTSW, A_FNSTSW:
  1647. Result := (p.oper[0]^.typ=top_reg) and Reg1WriteOverwritesReg2Entirely(p.oper[0]^.reg,reg);
  1648. else
  1649. begin
  1650. with insprop[p.opcode] do
  1651. begin
  1652. if (
  1653. { xor %reg,%reg etc. is classed as a new value }
  1654. (([Ch_NoReadIfEqualRegs]*Ch)<>[]) and
  1655. MatchOpType(p, top_reg, top_reg) and
  1656. (p.oper[0]^.reg = p.oper[1]^.reg) and
  1657. Reg1WriteOverwritesReg2Entirely(p.oper[1]^.reg,reg)
  1658. ) then
  1659. begin
  1660. Result := True;
  1661. Exit;
  1662. end;
  1663. { Make sure the entire register is overwritten }
  1664. if (getregtype(reg) = R_INTREGISTER) then
  1665. begin
  1666. if (p.ops > 0) then
  1667. begin
  1668. if RegInOp(reg, p.oper[0]^) then
  1669. begin
  1670. if (p.oper[0]^.typ = top_ref) then
  1671. begin
  1672. if RegInRef(reg, p.oper[0]^.ref^) then
  1673. begin
  1674. Result := False;
  1675. Exit;
  1676. end;
  1677. end
  1678. else if (p.oper[0]^.typ = top_reg) then
  1679. begin
  1680. if ([Ch_ROp1, Ch_RWOp1, Ch_MOp1]*Ch<>[]) then
  1681. begin
  1682. Result := False;
  1683. Exit;
  1684. end
  1685. else if ([Ch_WOp1]*Ch<>[]) then
  1686. begin
  1687. if Reg1WriteOverwritesReg2Entirely(p.oper[0]^.reg, reg) then
  1688. Result := True
  1689. else
  1690. begin
  1691. Result := False;
  1692. Exit;
  1693. end;
  1694. end;
  1695. end;
  1696. end;
  1697. if (p.ops > 1) then
  1698. begin
  1699. if RegInOp(reg, p.oper[1]^) then
  1700. begin
  1701. if (p.oper[1]^.typ = top_ref) then
  1702. begin
  1703. if RegInRef(reg, p.oper[1]^.ref^) then
  1704. begin
  1705. Result := False;
  1706. Exit;
  1707. end;
  1708. end
  1709. else if (p.oper[1]^.typ = top_reg) then
  1710. begin
  1711. if ([Ch_ROp2, Ch_RWOp2, Ch_MOp2]*Ch<>[]) then
  1712. begin
  1713. Result := False;
  1714. Exit;
  1715. end
  1716. else if ([Ch_WOp2]*Ch<>[]) then
  1717. begin
  1718. if Reg1WriteOverwritesReg2Entirely(p.oper[1]^.reg, reg) then
  1719. Result := True
  1720. else
  1721. begin
  1722. Result := False;
  1723. Exit;
  1724. end;
  1725. end;
  1726. end;
  1727. end;
  1728. if (p.ops > 2) then
  1729. begin
  1730. if RegInOp(reg, p.oper[2]^) then
  1731. begin
  1732. if (p.oper[2]^.typ = top_ref) then
  1733. begin
  1734. if RegInRef(reg, p.oper[2]^.ref^) then
  1735. begin
  1736. Result := False;
  1737. Exit;
  1738. end;
  1739. end
  1740. else if (p.oper[2]^.typ = top_reg) then
  1741. begin
  1742. if ([Ch_ROp3, Ch_RWOp3, Ch_MOp3]*Ch<>[]) then
  1743. begin
  1744. Result := False;
  1745. Exit;
  1746. end
  1747. else if ([Ch_WOp3]*Ch<>[]) then
  1748. begin
  1749. if Reg1WriteOverwritesReg2Entirely(p.oper[2]^.reg, reg) then
  1750. Result := True
  1751. else
  1752. begin
  1753. Result := False;
  1754. Exit;
  1755. end;
  1756. end;
  1757. end;
  1758. end;
  1759. if (p.ops > 3) and RegInOp(reg, p.oper[3]^) then
  1760. begin
  1761. if (p.oper[3]^.typ = top_ref) then
  1762. begin
  1763. if RegInRef(reg, p.oper[3]^.ref^) then
  1764. begin
  1765. Result := False;
  1766. Exit;
  1767. end;
  1768. end
  1769. else if (p.oper[3]^.typ = top_reg) then
  1770. begin
  1771. if ([Ch_ROp4, Ch_RWOp4, Ch_MOp4]*Ch<>[]) then
  1772. begin
  1773. Result := False;
  1774. Exit;
  1775. end
  1776. else if ([Ch_WOp4]*Ch<>[]) then
  1777. begin
  1778. if Reg1WriteOverwritesReg2Entirely(p.oper[3]^.reg, reg) then
  1779. Result := True
  1780. else
  1781. begin
  1782. Result := False;
  1783. Exit;
  1784. end;
  1785. end;
  1786. end;
  1787. end;
  1788. end;
  1789. end;
  1790. end;
  1791. { Don't do these ones first in case an input operand is equal to an explicit output register }
  1792. case getsupreg(reg) of
  1793. RS_EAX:
  1794. if ([Ch_WEAX{$ifdef x86_64},Ch_WRAX{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EAX, reg) then
  1795. begin
  1796. Result := True;
  1797. Exit;
  1798. end;
  1799. RS_ECX:
  1800. if ([Ch_WECX{$ifdef x86_64},Ch_WRCX{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_ECX, reg) then
  1801. begin
  1802. Result := True;
  1803. Exit;
  1804. end;
  1805. RS_EDX:
  1806. if ([Ch_REDX{$ifdef x86_64},Ch_WRDX{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EDX, reg) then
  1807. begin
  1808. Result := True;
  1809. Exit;
  1810. end;
  1811. RS_EBX:
  1812. if ([Ch_WEBX{$ifdef x86_64},Ch_WRBX{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EBX, reg) then
  1813. begin
  1814. Result := True;
  1815. Exit;
  1816. end;
  1817. RS_ESP:
  1818. if ([Ch_WESP{$ifdef x86_64},Ch_WRSP{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_ESP, reg) then
  1819. begin
  1820. Result := True;
  1821. Exit;
  1822. end;
  1823. RS_EBP:
  1824. if ([Ch_WEBP{$ifdef x86_64},Ch_WRBP{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EBP, reg) then
  1825. begin
  1826. Result := True;
  1827. Exit;
  1828. end;
  1829. RS_ESI:
  1830. if ([Ch_WESI{$ifdef x86_64},Ch_WRSI{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_ESI, reg) then
  1831. begin
  1832. Result := True;
  1833. Exit;
  1834. end;
  1835. RS_EDI:
  1836. if ([Ch_WEDI{$ifdef x86_64},Ch_WRDI{$endif x86_64}]*Ch<>[]) and Reg1WriteOverwritesReg2Entirely(NR_EDI, reg) then
  1837. begin
  1838. Result := True;
  1839. Exit;
  1840. end;
  1841. else
  1842. ;
  1843. end;
  1844. end;
  1845. end;
  1846. end;
  1847. end;
  1848. end;
  1849. class function TX86AsmOptimizer.IsExitCode(p : tai) : boolean;
  1850. var
  1851. hp2,hp3 : tai;
  1852. begin
  1853. { some x86-64 issue a NOP before the real exit code }
  1854. if MatchInstruction(p,A_NOP,[]) then
  1855. GetNextInstruction(p,p);
  1856. result:=assigned(p) and (p.typ=ait_instruction) and
  1857. ((taicpu(p).opcode = A_RET) or
  1858. ((taicpu(p).opcode=A_LEAVE) and
  1859. GetNextInstruction(p,hp2) and
  1860. MatchInstruction(hp2,A_RET,[S_NO])
  1861. ) or
  1862. (((taicpu(p).opcode=A_LEA) and
  1863. MatchOpType(taicpu(p),top_ref,top_reg) and
  1864. (taicpu(p).oper[0]^.ref^.base=NR_STACK_POINTER_REG) and
  1865. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG)
  1866. ) and
  1867. GetNextInstruction(p,hp2) and
  1868. MatchInstruction(hp2,A_RET,[S_NO])
  1869. ) or
  1870. ((((taicpu(p).opcode=A_MOV) and
  1871. MatchOpType(taicpu(p),top_reg,top_reg) and
  1872. (taicpu(p).oper[0]^.reg=current_procinfo.framepointer) and
  1873. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG)) or
  1874. ((taicpu(p).opcode=A_LEA) and
  1875. MatchOpType(taicpu(p),top_ref,top_reg) and
  1876. (taicpu(p).oper[0]^.ref^.base=current_procinfo.framepointer) and
  1877. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG)
  1878. )
  1879. ) and
  1880. GetNextInstruction(p,hp2) and
  1881. MatchInstruction(hp2,A_POP,[reg2opsize(current_procinfo.framepointer)]) and
  1882. MatchOpType(taicpu(hp2),top_reg) and
  1883. (taicpu(hp2).oper[0]^.reg=current_procinfo.framepointer) and
  1884. GetNextInstruction(hp2,hp3) and
  1885. MatchInstruction(hp3,A_RET,[S_NO])
  1886. )
  1887. );
  1888. end;
  1889. class function TX86AsmOptimizer.isFoldableArithOp(hp1: taicpu; reg: tregister): boolean;
  1890. begin
  1891. isFoldableArithOp := False;
  1892. case hp1.opcode of
  1893. A_ADD,A_SUB,A_OR,A_XOR,A_AND,A_SHL,A_SHR,A_SAR:
  1894. isFoldableArithOp :=
  1895. ((taicpu(hp1).oper[0]^.typ = top_const) or
  1896. ((taicpu(hp1).oper[0]^.typ = top_reg) and
  1897. (taicpu(hp1).oper[0]^.reg <> reg))) and
  1898. (taicpu(hp1).oper[1]^.typ = top_reg) and
  1899. (taicpu(hp1).oper[1]^.reg = reg);
  1900. A_INC,A_DEC,A_NEG,A_NOT:
  1901. isFoldableArithOp :=
  1902. (taicpu(hp1).oper[0]^.typ = top_reg) and
  1903. (taicpu(hp1).oper[0]^.reg = reg);
  1904. else
  1905. ;
  1906. end;
  1907. end;
  1908. procedure TX86AsmOptimizer.RemoveLastDeallocForFuncRes(p: tai);
  1909. procedure DoRemoveLastDeallocForFuncRes( supreg: tsuperregister);
  1910. var
  1911. hp2: tai;
  1912. begin
  1913. hp2 := p;
  1914. repeat
  1915. hp2 := tai(hp2.previous);
  1916. if assigned(hp2) and
  1917. (hp2.typ = ait_regalloc) and
  1918. (tai_regalloc(hp2).ratype=ra_dealloc) and
  1919. (getregtype(tai_regalloc(hp2).reg) = R_INTREGISTER) and
  1920. (getsupreg(tai_regalloc(hp2).reg) = supreg) then
  1921. begin
  1922. RemoveInstruction(hp2);
  1923. break;
  1924. end;
  1925. until not(assigned(hp2)) or regInInstruction(newreg(R_INTREGISTER,supreg,R_SUBWHOLE),hp2);
  1926. end;
  1927. begin
  1928. case current_procinfo.procdef.returndef.typ of
  1929. arraydef,recorddef,pointerdef,
  1930. stringdef,enumdef,procdef,objectdef,errordef,
  1931. filedef,setdef,procvardef,
  1932. classrefdef,forwarddef:
  1933. DoRemoveLastDeallocForFuncRes(RS_EAX);
  1934. orddef:
  1935. if current_procinfo.procdef.returndef.size <> 0 then
  1936. begin
  1937. DoRemoveLastDeallocForFuncRes(RS_EAX);
  1938. { for int64/qword }
  1939. if current_procinfo.procdef.returndef.size = 8 then
  1940. DoRemoveLastDeallocForFuncRes(RS_EDX);
  1941. end;
  1942. else
  1943. ;
  1944. end;
  1945. end;
  1946. function TX86AsmOptimizer.OptPass1_V_MOVAP(var p : tai) : boolean;
  1947. var
  1948. hp1,hp2 : tai;
  1949. begin
  1950. result:=false;
  1951. if MatchOpType(taicpu(p),top_reg,top_reg) then
  1952. begin
  1953. { vmova* reg1,reg1
  1954. =>
  1955. <nop> }
  1956. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) then
  1957. begin
  1958. RemoveCurrentP(p);
  1959. result:=true;
  1960. exit;
  1961. end
  1962. else if GetNextInstruction(p,hp1) then
  1963. begin
  1964. if MatchInstruction(hp1,[taicpu(p).opcode],[S_NO]) and
  1965. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) then
  1966. begin
  1967. { vmova* reg1,reg2
  1968. vmova* reg2,reg3
  1969. dealloc reg2
  1970. =>
  1971. vmova* reg1,reg3 }
  1972. TransferUsedRegs(TmpUsedRegs);
  1973. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  1974. if MatchOpType(taicpu(hp1),top_reg,top_reg) and
  1975. not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  1976. begin
  1977. DebugMsg(SPeepholeOptimization + '(V)MOVA*(V)MOVA*2(V)MOVA* 1',p);
  1978. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  1979. RemoveInstruction(hp1);
  1980. result:=true;
  1981. exit;
  1982. end
  1983. { special case:
  1984. vmova* reg1,<op>
  1985. vmova* <op>,reg1
  1986. =>
  1987. vmova* reg1,<op> }
  1988. else if MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[1]^) and
  1989. ((taicpu(p).oper[0]^.typ<>top_ref) or
  1990. (not(vol_read in taicpu(p).oper[0]^.ref^.volatility))
  1991. ) then
  1992. begin
  1993. DebugMsg(SPeepholeOptimization + '(V)MOVA*(V)MOVA*2(V)MOVA* 2',p);
  1994. RemoveInstruction(hp1);
  1995. result:=true;
  1996. exit;
  1997. end
  1998. end
  1999. else if ((MatchInstruction(p,[A_MOVAPS,A_VMOVAPS],[S_NO]) and
  2000. MatchInstruction(hp1,[A_MOVSS,A_VMOVSS],[S_NO])) or
  2001. ((MatchInstruction(p,[A_MOVAPD,A_VMOVAPD],[S_NO]) and
  2002. MatchInstruction(hp1,[A_MOVSD,A_VMOVSD],[S_NO])))
  2003. ) and
  2004. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) then
  2005. begin
  2006. { vmova* reg1,reg2
  2007. vmovs* reg2,<op>
  2008. dealloc reg2
  2009. =>
  2010. vmovs* reg1,reg3 }
  2011. TransferUsedRegs(TmpUsedRegs);
  2012. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2013. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  2014. begin
  2015. DebugMsg(SPeepholeOptimization + '(V)MOVA*(V)MOVS*2(V)MOVS* 1',p);
  2016. taicpu(p).opcode:=taicpu(hp1).opcode;
  2017. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  2018. RemoveInstruction(hp1);
  2019. result:=true;
  2020. exit;
  2021. end
  2022. end;
  2023. end;
  2024. if GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg) then
  2025. begin
  2026. if MatchInstruction(hp1,[A_VFMADDPD,
  2027. A_VFMADD132PD,
  2028. A_VFMADD132PS,
  2029. A_VFMADD132SD,
  2030. A_VFMADD132SS,
  2031. A_VFMADD213PD,
  2032. A_VFMADD213PS,
  2033. A_VFMADD213SD,
  2034. A_VFMADD213SS,
  2035. A_VFMADD231PD,
  2036. A_VFMADD231PS,
  2037. A_VFMADD231SD,
  2038. A_VFMADD231SS,
  2039. A_VFMADDSUB132PD,
  2040. A_VFMADDSUB132PS,
  2041. A_VFMADDSUB213PD,
  2042. A_VFMADDSUB213PS,
  2043. A_VFMADDSUB231PD,
  2044. A_VFMADDSUB231PS,
  2045. A_VFMSUB132PD,
  2046. A_VFMSUB132PS,
  2047. A_VFMSUB132SD,
  2048. A_VFMSUB132SS,
  2049. A_VFMSUB213PD,
  2050. A_VFMSUB213PS,
  2051. A_VFMSUB213SD,
  2052. A_VFMSUB213SS,
  2053. A_VFMSUB231PD,
  2054. A_VFMSUB231PS,
  2055. A_VFMSUB231SD,
  2056. A_VFMSUB231SS,
  2057. A_VFMSUBADD132PD,
  2058. A_VFMSUBADD132PS,
  2059. A_VFMSUBADD213PD,
  2060. A_VFMSUBADD213PS,
  2061. A_VFMSUBADD231PD,
  2062. A_VFMSUBADD231PS,
  2063. A_VFNMADD132PD,
  2064. A_VFNMADD132PS,
  2065. A_VFNMADD132SD,
  2066. A_VFNMADD132SS,
  2067. A_VFNMADD213PD,
  2068. A_VFNMADD213PS,
  2069. A_VFNMADD213SD,
  2070. A_VFNMADD213SS,
  2071. A_VFNMADD231PD,
  2072. A_VFNMADD231PS,
  2073. A_VFNMADD231SD,
  2074. A_VFNMADD231SS,
  2075. A_VFNMSUB132PD,
  2076. A_VFNMSUB132PS,
  2077. A_VFNMSUB132SD,
  2078. A_VFNMSUB132SS,
  2079. A_VFNMSUB213PD,
  2080. A_VFNMSUB213PS,
  2081. A_VFNMSUB213SD,
  2082. A_VFNMSUB213SS,
  2083. A_VFNMSUB231PD,
  2084. A_VFNMSUB231PS,
  2085. A_VFNMSUB231SD,
  2086. A_VFNMSUB231SS],[S_NO]) and
  2087. { we mix single and double opperations here because we assume that the compiler
  2088. generates vmovapd only after double operations and vmovaps only after single operations }
  2089. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[2]^) and
  2090. GetNextInstruction(hp1,hp2) and
  2091. MatchInstruction(hp2,[A_VMOVAPD,A_VMOVAPS,A_MOVAPD,A_MOVAPS],[S_NO]) and
  2092. MatchOperand(taicpu(p).oper[0]^,taicpu(hp2).oper[1]^) then
  2093. begin
  2094. TransferUsedRegs(TmpUsedRegs);
  2095. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2096. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  2097. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs)) then
  2098. begin
  2099. taicpu(hp1).loadoper(2,taicpu(p).oper[0]^);
  2100. RemoveCurrentP(p);
  2101. RemoveInstruction(hp2);
  2102. end;
  2103. end
  2104. else if (hp1.typ = ait_instruction) and
  2105. GetNextInstruction(hp1, hp2) and
  2106. MatchInstruction(hp2,taicpu(p).opcode,[]) and
  2107. OpsEqual(taicpu(hp2).oper[1]^, taicpu(p).oper[0]^) and
  2108. MatchOpType(taicpu(hp2),top_reg,top_reg) and
  2109. MatchOperand(taicpu(hp2).oper[0]^,taicpu(p).oper[1]^) and
  2110. (((taicpu(p).opcode=A_MOVAPS) and
  2111. ((taicpu(hp1).opcode=A_ADDSS) or (taicpu(hp1).opcode=A_SUBSS) or
  2112. (taicpu(hp1).opcode=A_MULSS) or (taicpu(hp1).opcode=A_DIVSS))) or
  2113. ((taicpu(p).opcode=A_MOVAPD) and
  2114. ((taicpu(hp1).opcode=A_ADDSD) or (taicpu(hp1).opcode=A_SUBSD) or
  2115. (taicpu(hp1).opcode=A_MULSD) or (taicpu(hp1).opcode=A_DIVSD)))
  2116. ) then
  2117. { change
  2118. movapX reg,reg2
  2119. addsX/subsX/... reg3, reg2
  2120. movapX reg2,reg
  2121. to
  2122. addsX/subsX/... reg3,reg
  2123. }
  2124. begin
  2125. TransferUsedRegs(TmpUsedRegs);
  2126. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2127. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  2128. If not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs)) then
  2129. begin
  2130. DebugMsg(SPeepholeOptimization + 'MovapXOpMovapX2Op ('+
  2131. debug_op2str(taicpu(p).opcode)+' '+
  2132. debug_op2str(taicpu(hp1).opcode)+' '+
  2133. debug_op2str(taicpu(hp2).opcode)+') done',p);
  2134. { we cannot eliminate the first move if
  2135. the operations uses the same register for source and dest }
  2136. if not(OpsEqual(taicpu(hp1).oper[1]^,taicpu(hp1).oper[0]^)) then
  2137. { Remember that hp1 is not necessarily the immediate
  2138. next instruction }
  2139. RemoveCurrentP(p);
  2140. taicpu(hp1).loadoper(1, taicpu(hp2).oper[1]^);
  2141. RemoveInstruction(hp2);
  2142. result:=true;
  2143. end;
  2144. end
  2145. else if (hp1.typ = ait_instruction) and
  2146. (((taicpu(p).opcode=A_VMOVAPD) and
  2147. (taicpu(hp1).opcode=A_VCOMISD)) or
  2148. ((taicpu(p).opcode=A_VMOVAPS) and
  2149. ((taicpu(hp1).opcode=A_VCOMISS))
  2150. )
  2151. ) and not(OpsEqual(taicpu(hp1).oper[1]^,taicpu(hp1).oper[0]^)) then
  2152. { change
  2153. movapX reg,reg1
  2154. vcomisX reg1,reg1
  2155. to
  2156. vcomisX reg,reg
  2157. }
  2158. begin
  2159. TransferUsedRegs(TmpUsedRegs);
  2160. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2161. If not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  2162. begin
  2163. DebugMsg(SPeepholeOptimization + 'MovapXComisX2ComisX2 ('+
  2164. debug_op2str(taicpu(p).opcode)+' '+
  2165. debug_op2str(taicpu(hp1).opcode)+') done',p);
  2166. if OpsEqual(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) then
  2167. taicpu(hp1).loadoper(0, taicpu(p).oper[0]^);
  2168. if OpsEqual(taicpu(p).oper[1]^,taicpu(hp1).oper[1]^) then
  2169. taicpu(hp1).loadoper(1, taicpu(p).oper[0]^);
  2170. RemoveCurrentP(p);
  2171. result:=true;
  2172. exit;
  2173. end;
  2174. end
  2175. end;
  2176. end;
  2177. end;
  2178. function TX86AsmOptimizer.OptPass1VOP(var p : tai) : boolean;
  2179. var
  2180. hp1 : tai;
  2181. begin
  2182. result:=false;
  2183. { replace
  2184. V<Op>X %mreg1,%mreg2,%mreg3
  2185. VMovX %mreg3,%mreg4
  2186. dealloc %mreg3
  2187. by
  2188. V<Op>X %mreg1,%mreg2,%mreg4
  2189. ?
  2190. }
  2191. if GetNextInstruction(p,hp1) and
  2192. { we mix single and double operations here because we assume that the compiler
  2193. generates vmovapd only after double operations and vmovaps only after single operations }
  2194. MatchInstruction(hp1,A_VMOVAPD,A_VMOVAPS,[S_NO]) and
  2195. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  2196. (taicpu(hp1).oper[1]^.typ=top_reg) then
  2197. begin
  2198. TransferUsedRegs(TmpUsedRegs);
  2199. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  2200. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  2201. begin
  2202. taicpu(p).loadoper(2,taicpu(hp1).oper[1]^);
  2203. DebugMsg(SPeepholeOptimization + 'VOpVmov2VOp done',p);
  2204. RemoveInstruction(hp1);
  2205. result:=true;
  2206. end;
  2207. end;
  2208. end;
  2209. { Replaces all references to AOldReg in a memory reference to ANewReg }
  2210. class function TX86AsmOptimizer.ReplaceRegisterInRef(var ref: TReference; const AOldReg, ANewReg: TRegister): Boolean;
  2211. begin
  2212. Result := False;
  2213. { For safety reasons, only check for exact register matches }
  2214. { Check base register }
  2215. if (ref.base = AOldReg) then
  2216. begin
  2217. ref.base := ANewReg;
  2218. Result := True;
  2219. end;
  2220. { Check index register }
  2221. if (ref.index = AOldReg) then
  2222. begin
  2223. ref.index := ANewReg;
  2224. Result := True;
  2225. end;
  2226. end;
  2227. { Replaces all references to AOldReg in an operand to ANewReg }
  2228. class function TX86AsmOptimizer.ReplaceRegisterInOper(const p: taicpu; const OperIdx: Integer; const AOldReg, ANewReg: TRegister): Boolean;
  2229. var
  2230. OldSupReg, NewSupReg: TSuperRegister;
  2231. OldSubReg, NewSubReg: TSubRegister;
  2232. OldRegType: TRegisterType;
  2233. ThisOper: POper;
  2234. begin
  2235. ThisOper := p.oper[OperIdx]; { Faster to access overall }
  2236. Result := False;
  2237. if (AOldReg = NR_NO) or (ANewReg = NR_NO) then
  2238. InternalError(2020011801);
  2239. OldSupReg := getsupreg(AOldReg);
  2240. OldSubReg := getsubreg(AOldReg);
  2241. OldRegType := getregtype(AOldReg);
  2242. NewSupReg := getsupreg(ANewReg);
  2243. NewSubReg := getsubreg(ANewReg);
  2244. if OldRegType <> getregtype(ANewReg) then
  2245. InternalError(2020011802);
  2246. if OldSubReg <> NewSubReg then
  2247. InternalError(2020011803);
  2248. case ThisOper^.typ of
  2249. top_reg:
  2250. if (
  2251. (ThisOper^.reg = AOldReg) or
  2252. (
  2253. (OldRegType = R_INTREGISTER) and
  2254. (getsupreg(ThisOper^.reg) = OldSupReg) and
  2255. (getregtype(ThisOper^.reg) = R_INTREGISTER) and
  2256. (
  2257. (getsubreg(ThisOper^.reg) <= OldSubReg)
  2258. {$ifndef x86_64}
  2259. and (
  2260. { Under i386 and i8086, ESI, EDI, EBP and ESP
  2261. don't have an 8-bit representation }
  2262. (getsubreg(ThisOper^.reg) >= R_SUBW) or
  2263. not (NewSupReg in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  2264. )
  2265. {$endif x86_64}
  2266. )
  2267. )
  2268. ) then
  2269. begin
  2270. ThisOper^.reg := newreg(getregtype(ANewReg), NewSupReg, getsubreg(p.oper[OperIdx]^.reg));
  2271. Result := True;
  2272. end;
  2273. top_ref:
  2274. if ReplaceRegisterInRef(ThisOper^.ref^, AOldReg, ANewReg) then
  2275. Result := True;
  2276. else
  2277. ;
  2278. end;
  2279. end;
  2280. { Replaces all references to AOldReg in an instruction to ANewReg }
  2281. class function TX86AsmOptimizer.ReplaceRegisterInInstruction(const p: taicpu; const AOldReg, ANewReg: TRegister): Boolean;
  2282. const
  2283. ReadFlag: array[0..3] of TInsChange = (Ch_Rop1, Ch_Rop2, Ch_Rop3, Ch_Rop4);
  2284. var
  2285. OperIdx: Integer;
  2286. begin
  2287. Result := False;
  2288. for OperIdx := 0 to p.ops - 1 do
  2289. if (ReadFlag[OperIdx] in InsProp[p.Opcode].Ch) then
  2290. begin
  2291. { The shift and rotate instructions can only use CL }
  2292. if not (
  2293. (OperIdx = 0) and
  2294. { This second condition just helps to avoid unnecessarily
  2295. calling MatchInstruction for 10 different opcodes }
  2296. (p.oper[0]^.reg = NR_CL) and
  2297. MatchInstruction(p, [A_RCL, A_RCR, A_ROL, A_ROR, A_SAL, A_SAR, A_SHL, A_SHLD, A_SHR, A_SHRD], [])
  2298. ) then
  2299. Result := ReplaceRegisterInOper(p, OperIdx, AOldReg, ANewReg) or Result;
  2300. end
  2301. else if p.oper[OperIdx]^.typ = top_ref then
  2302. { It's okay to replace registers in references that get written to }
  2303. Result := ReplaceRegisterInOper(p, OperIdx, AOldReg, ANewReg) or Result;
  2304. end;
  2305. class function TX86AsmOptimizer.IsRefSafe(const ref: PReference): Boolean;
  2306. begin
  2307. with ref^ do
  2308. Result :=
  2309. (index = NR_NO) and
  2310. (
  2311. {$ifdef x86_64}
  2312. (
  2313. (base = NR_RIP) and
  2314. (refaddr in [addr_pic, addr_pic_no_got])
  2315. ) or
  2316. {$endif x86_64}
  2317. (base = NR_STACK_POINTER_REG) or
  2318. (base = current_procinfo.framepointer)
  2319. );
  2320. end;
  2321. function TX86AsmOptimizer.ConvertLEA(const p: taicpu): Boolean;
  2322. var
  2323. l: asizeint;
  2324. begin
  2325. Result := False;
  2326. { Should have been checked previously }
  2327. if p.opcode <> A_LEA then
  2328. InternalError(2020072501);
  2329. { do not mess with the stack point as adjusting it by lea is recommend, except if we optimize for size }
  2330. if (p.oper[1]^.reg=NR_STACK_POINTER_REG) and
  2331. not(cs_opt_size in current_settings.optimizerswitches) then
  2332. exit;
  2333. with p.oper[0]^.ref^ do
  2334. begin
  2335. if (base <> p.oper[1]^.reg) or
  2336. (index <> NR_NO) or
  2337. assigned(symbol) then
  2338. exit;
  2339. l:=offset;
  2340. if (l=1) and UseIncDec then
  2341. begin
  2342. p.opcode:=A_INC;
  2343. p.loadreg(0,p.oper[1]^.reg);
  2344. p.ops:=1;
  2345. DebugMsg(SPeepholeOptimization + 'Lea2Inc done',p);
  2346. end
  2347. else if (l=-1) and UseIncDec then
  2348. begin
  2349. p.opcode:=A_DEC;
  2350. p.loadreg(0,p.oper[1]^.reg);
  2351. p.ops:=1;
  2352. DebugMsg(SPeepholeOptimization + 'Lea2Dec done',p);
  2353. end
  2354. else
  2355. begin
  2356. if (l<0) and (l<>-2147483648) then
  2357. begin
  2358. p.opcode:=A_SUB;
  2359. p.loadConst(0,-l);
  2360. DebugMsg(SPeepholeOptimization + 'Lea2Sub done',p);
  2361. end
  2362. else
  2363. begin
  2364. p.opcode:=A_ADD;
  2365. p.loadConst(0,l);
  2366. DebugMsg(SPeepholeOptimization + 'Lea2Add done',p);
  2367. end;
  2368. end;
  2369. end;
  2370. Result := True;
  2371. end;
  2372. function TX86AsmOptimizer.DeepMOVOpt(const p_mov: taicpu; const hp: taicpu): Boolean;
  2373. var
  2374. CurrentReg, ReplaceReg: TRegister;
  2375. begin
  2376. Result := False;
  2377. ReplaceReg := taicpu(p_mov).oper[0]^.reg;
  2378. CurrentReg := taicpu(p_mov).oper[1]^.reg;
  2379. case hp.opcode of
  2380. A_FSTSW, A_FNSTSW,
  2381. A_IN, A_INS, A_OUT, A_OUTS,
  2382. A_CMPS, A_LODS, A_MOVS, A_SCAS, A_STOS:
  2383. { These routines have explicit operands, but they are restricted in
  2384. what they can be (e.g. IN and OUT can only read from AL, AX or
  2385. EAX. }
  2386. Exit;
  2387. A_IMUL:
  2388. begin
  2389. { The 1-operand version writes to implicit registers
  2390. The 2-operand version reads from the first operator, and reads
  2391. from and writes to the second (equivalent to Ch_ROp1, ChRWOp2).
  2392. the 3-operand version reads from a register that it doesn't write to
  2393. }
  2394. case hp.ops of
  2395. 1:
  2396. if (
  2397. (
  2398. (hp.opsize = S_B) and (getsupreg(CurrentReg) <> RS_EAX)
  2399. ) or
  2400. not (getsupreg(CurrentReg) in [RS_EAX, RS_EDX])
  2401. ) and ReplaceRegisterInOper(hp, 0, CurrentReg, ReplaceReg) then
  2402. begin
  2403. Result := True;
  2404. DebugMsg(SPeepholeOptimization + debug_regname(CurrentReg) + ' = ' + debug_regname(ReplaceReg) + '; changed to minimise pipeline stall (MovIMul2MovIMul 1)', hp);
  2405. AllocRegBetween(ReplaceReg, p_mov, hp, UsedRegs);
  2406. end;
  2407. 2:
  2408. { Only modify the first parameter }
  2409. if ReplaceRegisterInOper(hp, 0, CurrentReg, ReplaceReg) then
  2410. begin
  2411. Result := True;
  2412. DebugMsg(SPeepholeOptimization + debug_regname(CurrentReg) + ' = ' + debug_regname(ReplaceReg) + '; changed to minimise pipeline stall (MovIMul2MovIMul 2)', hp);
  2413. AllocRegBetween(ReplaceReg, p_mov, hp, UsedRegs);
  2414. end;
  2415. 3:
  2416. { Only modify the second parameter }
  2417. if ReplaceRegisterInOper(hp, 1, CurrentReg, ReplaceReg) then
  2418. begin
  2419. Result := True;
  2420. DebugMsg(SPeepholeOptimization + debug_regname(CurrentReg) + ' = ' + debug_regname(ReplaceReg) + '; changed to minimise pipeline stall (MovIMul2MovIMul 3)', hp);
  2421. AllocRegBetween(ReplaceReg, p_mov, hp, UsedRegs);
  2422. end;
  2423. else
  2424. InternalError(2020012901);
  2425. end;
  2426. end;
  2427. else
  2428. if (hp.ops > 0) and
  2429. ReplaceRegisterInInstruction(hp, CurrentReg, ReplaceReg) then
  2430. begin
  2431. Result := True;
  2432. DebugMsg(SPeepholeOptimization + debug_regname(CurrentReg) + ' = ' + debug_regname(ReplaceReg) + '; changed to minimise pipeline stall (MovXXX2MovXXX)', hp);
  2433. AllocRegBetween(ReplaceReg, p_mov, hp, UsedRegs);
  2434. end;
  2435. end;
  2436. end;
  2437. function TX86AsmOptimizer.FuncMov2Func(var p: tai; const hp1: tai): Boolean;
  2438. var
  2439. hp2: tai;
  2440. p_SourceReg, p_TargetReg: TRegister;
  2441. begin
  2442. Result := False;
  2443. { Backward optimisation. If we have:
  2444. func. %reg1,%reg2
  2445. mov %reg2,%reg3
  2446. (dealloc %reg2)
  2447. Change to:
  2448. func. %reg1,%reg3 (see comment below for what a valid func. is)
  2449. Perform similar optimisations with 1, 3 and 4-operand instructions
  2450. that only have one output.
  2451. }
  2452. if MatchOpType(taicpu(p), top_reg, top_reg) then
  2453. begin
  2454. p_SourceReg := taicpu(p).oper[0]^.reg;
  2455. p_TargetReg := taicpu(p).oper[1]^.reg;
  2456. TransferUsedRegs(TmpUsedRegs);
  2457. if not RegUsedAfterInstruction(p_SourceReg, p, TmpUsedRegs) and
  2458. GetLastInstruction(p, hp2) and
  2459. (hp2.typ = ait_instruction) and
  2460. { Have to make sure it's an instruction that only reads from
  2461. the first operands and only writes (not reads or modifies) to
  2462. the last one; in essence, a pure function such as BSR, POPCNT
  2463. or ANDN }
  2464. (
  2465. (
  2466. (taicpu(hp2).ops = 1) and
  2467. (insprop[taicpu(hp2).opcode].Ch * [Ch_Wop1] = [Ch_Wop1])
  2468. ) or
  2469. (
  2470. (taicpu(hp2).ops = 2) and
  2471. (insprop[taicpu(hp2).opcode].Ch * [Ch_Rop1, Ch_Wop2] = [Ch_Rop1, Ch_Wop2])
  2472. ) or
  2473. (
  2474. (taicpu(hp2).ops = 3) and
  2475. (insprop[taicpu(hp2).opcode].Ch * [Ch_Rop1, Ch_Rop2, Ch_Wop3] = [Ch_Rop1, Ch_Rop2, Ch_Wop3])
  2476. ) or
  2477. (
  2478. (taicpu(hp2).ops = 4) and
  2479. (insprop[taicpu(hp2).opcode].Ch * [Ch_Rop1, Ch_Rop2, Ch_Rop3, Ch_Wop4] = [Ch_Rop1, Ch_Rop2, Ch_Rop3, Ch_Wop4])
  2480. )
  2481. ) and
  2482. (taicpu(hp2).oper[taicpu(hp2).ops-1]^.typ = top_reg) and
  2483. (taicpu(hp2).oper[taicpu(hp2).ops-1]^.reg = p_SourceReg) then
  2484. begin
  2485. case taicpu(hp2).opcode of
  2486. A_FSTSW, A_FNSTSW,
  2487. A_IN, A_INS, A_OUT, A_OUTS,
  2488. A_CMPS, A_LODS, A_MOVS, A_SCAS, A_STOS:
  2489. { These routines have explicit operands, but they are restricted in
  2490. what they can be (e.g. IN and OUT can only read from AL, AX or
  2491. EAX. }
  2492. ;
  2493. else
  2494. begin
  2495. DebugMsg(SPeepholeOptimization + 'Removed MOV and changed destination on previous instruction to optimise register usage (FuncMov2Func)', p);
  2496. taicpu(hp2).oper[taicpu(hp2).ops-1]^.reg := p_TargetReg;
  2497. if not RegInInstruction(p_TargetReg, hp2) then
  2498. begin
  2499. { Since we're allocating from an earlier point, we
  2500. need to remove the register from the tracking }
  2501. ExcludeRegFromUsedRegs(p_TargetReg, TmpUsedRegs);
  2502. AllocRegBetween(p_TargetReg, hp2, p, TmpUsedRegs);
  2503. end;
  2504. RemoveCurrentp(p, hp1);
  2505. { If the Func was another MOV instruction, we might get
  2506. "mov %reg,%reg" that doesn't get removed in Pass 2
  2507. otherwise, so deal with it here (also do something
  2508. similar with lea (%reg),%reg}
  2509. if (taicpu(hp2).opcode = A_MOV) and MatchOperand(taicpu(hp2).oper[0]^, taicpu(hp2).oper[1]^.reg) then
  2510. begin
  2511. DebugMsg(SPeepholeOptimization + 'Mov2Nop 1a done', hp2);
  2512. if p = hp2 then
  2513. RemoveCurrentp(p)
  2514. else
  2515. RemoveInstruction(hp2);
  2516. end;
  2517. Result := True;
  2518. Exit;
  2519. end;
  2520. end;
  2521. end;
  2522. end;
  2523. end;
  2524. function TX86AsmOptimizer.OptPass1MOV(var p : tai) : boolean;
  2525. var
  2526. hp1, hp2, hp3: tai;
  2527. DoOptimisation, TempBool: Boolean;
  2528. {$ifdef x86_64}
  2529. NewConst: TCGInt;
  2530. {$endif x86_64}
  2531. procedure convert_mov_value(signed_movop: tasmop; max_value: tcgint); inline;
  2532. begin
  2533. if taicpu(hp1).opcode = signed_movop then
  2534. begin
  2535. if taicpu(p).oper[0]^.val > max_value shr 1 then
  2536. taicpu(p).oper[0]^.val:=taicpu(p).oper[0]^.val - max_value - 1 { Convert to signed }
  2537. end
  2538. else
  2539. taicpu(p).oper[0]^.val:=taicpu(p).oper[0]^.val and max_value; { Trim to unsigned }
  2540. end;
  2541. function TryConstMerge(var p1, p2: tai): Boolean;
  2542. var
  2543. ThisRef: TReference;
  2544. begin
  2545. Result := False;
  2546. ThisRef := taicpu(p2).oper[1]^.ref^;
  2547. { Only permit writes to the stack, since we can guarantee alignment with that }
  2548. if (ThisRef.index = NR_NO) and
  2549. (
  2550. (ThisRef.base = NR_STACK_POINTER_REG) or
  2551. (ThisRef.base = current_procinfo.framepointer)
  2552. ) then
  2553. begin
  2554. case taicpu(p).opsize of
  2555. S_B:
  2556. begin
  2557. { Word writes must be on a 2-byte boundary }
  2558. if (taicpu(p1).oper[1]^.ref^.offset mod 2) = 0 then
  2559. begin
  2560. { Reduce offset of second reference to see if it is sequential with the first }
  2561. Dec(ThisRef.offset, 1);
  2562. if RefsEqual(taicpu(p1).oper[1]^.ref^, ThisRef) then
  2563. begin
  2564. { Make sure the constants aren't represented as a
  2565. negative number, as these won't merge properly }
  2566. taicpu(p1).opsize := S_W;
  2567. taicpu(p1).oper[0]^.val := (taicpu(p1).oper[0]^.val and $FF) or ((taicpu(p2).oper[0]^.val and $FF) shl 8);
  2568. DebugMsg(SPeepholeOptimization + 'Merged two byte-sized constant writes to stack (MovMov2Mov 2a)', p1);
  2569. RemoveInstruction(p2);
  2570. Result := True;
  2571. end;
  2572. end;
  2573. end;
  2574. S_W:
  2575. begin
  2576. { Longword writes must be on a 4-byte boundary }
  2577. if (taicpu(p1).oper[1]^.ref^.offset mod 4) = 0 then
  2578. begin
  2579. { Reduce offset of second reference to see if it is sequential with the first }
  2580. Dec(ThisRef.offset, 2);
  2581. if RefsEqual(taicpu(p1).oper[1]^.ref^, ThisRef) then
  2582. begin
  2583. { Make sure the constants aren't represented as a
  2584. negative number, as these won't merge properly }
  2585. taicpu(p1).opsize := S_L;
  2586. taicpu(p1).oper[0]^.val := (taicpu(p1).oper[0]^.val and $FFFF) or ((taicpu(p2).oper[0]^.val and $FFFF) shl 16);
  2587. DebugMsg(SPeepholeOptimization + 'Merged two word-sized constant writes to stack (MovMov2Mov 2b)', p1);
  2588. RemoveInstruction(p2);
  2589. Result := True;
  2590. end;
  2591. end;
  2592. end;
  2593. {$ifdef x86_64}
  2594. S_L:
  2595. begin
  2596. { Only sign-extended 32-bit constants can be written to 64-bit memory directly, so check to
  2597. see if the constants can be encoded this way. }
  2598. NewConst := (taicpu(p1).oper[0]^.val and $FFFFFFFF) or (taicpu(p2).oper[0]^.val shl 32);
  2599. if (NewConst >= -2147483648) and (NewConst <= 2147483647) and
  2600. { Quadword writes must be on an 8-byte boundary }
  2601. ((taicpu(p1).oper[1]^.ref^.offset mod 8) = 0) then
  2602. begin
  2603. { Reduce offset of second reference to see if it is sequential with the first }
  2604. Dec(ThisRef.offset, 4);
  2605. if RefsEqual(taicpu(p1).oper[1]^.ref^, ThisRef) then
  2606. begin
  2607. { Make sure the constants aren't represented as a
  2608. negative number, as these won't merge properly }
  2609. taicpu(p1).opsize := S_Q;
  2610. { Force a typecast into a 32-bit signed integer (that will then be sign-extended to 64-bit) }
  2611. taicpu(p1).oper[0]^.val := NewConst;
  2612. DebugMsg(SPeepholeOptimization + 'Merged two longword-sized constant writes to stack (MovMov2Mov 2c)', p1);
  2613. RemoveInstruction(p2);
  2614. Result := True;
  2615. end;
  2616. end;
  2617. end;
  2618. {$endif x86_64}
  2619. else
  2620. ;
  2621. end;
  2622. end;
  2623. end;
  2624. var
  2625. GetNextInstruction_p, TempRegUsed, CrossJump: Boolean;
  2626. PreMessage, RegName1, RegName2, InputVal, MaskNum: string;
  2627. NewSize: topsize; NewOffset: asizeint;
  2628. p_SourceReg, p_TargetReg, NewMMReg: TRegister;
  2629. SourceRef, TargetRef: TReference;
  2630. MovAligned, MovUnaligned: TAsmOp;
  2631. ThisRef: TReference;
  2632. JumpTracking: TLinkedList;
  2633. begin
  2634. Result:=false;
  2635. GetNextInstruction_p:=GetNextInstruction(p, hp1);
  2636. { remove mov reg1,reg1? }
  2637. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^)
  2638. then
  2639. begin
  2640. DebugMsg(SPeepholeOptimization + 'Mov2Nop 1 done',p);
  2641. { take care of the register (de)allocs following p }
  2642. RemoveCurrentP(p, hp1);
  2643. Result:=true;
  2644. exit;
  2645. end;
  2646. { All the next optimisations require a next instruction }
  2647. if not GetNextInstruction_p or (hp1.typ <> ait_instruction) then
  2648. Exit;
  2649. { Prevent compiler warnings }
  2650. p_TargetReg := NR_NO;
  2651. if taicpu(p).oper[1]^.typ = top_reg then
  2652. begin
  2653. { Saves on a large number of dereferences }
  2654. p_TargetReg := taicpu(p).oper[1]^.reg;
  2655. { Look for:
  2656. mov %reg1,%reg2
  2657. ??? %reg2,r/m
  2658. Change to:
  2659. mov %reg1,%reg2
  2660. ??? %reg1,r/m
  2661. }
  2662. if taicpu(p).oper[0]^.typ = top_reg then
  2663. begin
  2664. if RegReadByInstruction(p_TargetReg, hp1) and
  2665. DeepMOVOpt(taicpu(p), taicpu(hp1)) then
  2666. begin
  2667. { A change has occurred, just not in p }
  2668. Result := True;
  2669. TransferUsedRegs(TmpUsedRegs);
  2670. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  2671. if not RegUsedAfterInstruction(p_TargetReg, hp1, TmpUsedRegs) and
  2672. { Just in case something didn't get modified (e.g. an
  2673. implicit register) }
  2674. not RegReadByInstruction(p_TargetReg, hp1) then
  2675. begin
  2676. { We can remove the original MOV }
  2677. DebugMsg(SPeepholeOptimization + 'Mov2Nop 3 done',p);
  2678. RemoveCurrentp(p, hp1);
  2679. { UsedRegs got updated by RemoveCurrentp }
  2680. Result := True;
  2681. Exit;
  2682. end;
  2683. { If we know a MOV instruction has become a null operation, we might as well
  2684. get rid of it now to save time. }
  2685. if (taicpu(hp1).opcode = A_MOV) and
  2686. (taicpu(hp1).oper[1]^.typ = top_reg) and
  2687. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[0]^.reg) and
  2688. { Just being a register is enough to confirm it's a null operation }
  2689. (taicpu(hp1).oper[0]^.typ = top_reg) then
  2690. begin
  2691. Result := True;
  2692. { Speed-up to reduce a pipeline stall... if we had something like...
  2693. movl %eax,%edx
  2694. movw %dx,%ax
  2695. ... the second instruction would change to movw %ax,%ax, but
  2696. given that it is now %ax that's active rather than %eax,
  2697. penalties might occur due to a partial register write, so instead,
  2698. change it to a MOVZX instruction when optimising for speed.
  2699. }
  2700. if not (cs_opt_size in current_settings.optimizerswitches) and
  2701. IsMOVZXAcceptable and
  2702. (taicpu(hp1).opsize < taicpu(p).opsize)
  2703. {$ifdef x86_64}
  2704. { operations already implicitly set the upper 64 bits to zero }
  2705. and not ((taicpu(hp1).opsize = S_L) and (taicpu(p).opsize = S_Q))
  2706. {$endif x86_64}
  2707. then
  2708. begin
  2709. DebugMsg(SPeepholeOptimization + 'Zero-extension to minimise pipeline stall (Mov2Movz)',hp1);
  2710. case taicpu(p).opsize of
  2711. S_W:
  2712. if taicpu(hp1).opsize = S_B then
  2713. taicpu(hp1).opsize := S_BL
  2714. else
  2715. InternalError(2020012911);
  2716. S_L{$ifdef x86_64}, S_Q{$endif x86_64}:
  2717. case taicpu(hp1).opsize of
  2718. S_B:
  2719. taicpu(hp1).opsize := S_BL;
  2720. S_W:
  2721. taicpu(hp1).opsize := S_WL;
  2722. else
  2723. InternalError(2020012912);
  2724. end;
  2725. else
  2726. InternalError(2020012910);
  2727. end;
  2728. taicpu(hp1).opcode := A_MOVZX;
  2729. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  2730. end
  2731. else
  2732. begin
  2733. GetNextInstruction_p := GetNextInstruction(hp1, hp2);
  2734. DebugMsg(SPeepholeOptimization + 'Mov2Nop 4 done',hp1);
  2735. RemoveInstruction(hp1);
  2736. { The instruction after what was hp1 is now the immediate next instruction,
  2737. so we can continue to make optimisations if it's present }
  2738. if not GetNextInstruction_p or (hp2.typ <> ait_instruction) then
  2739. Exit;
  2740. hp1 := hp2;
  2741. end;
  2742. end;
  2743. end;
  2744. end;
  2745. end;
  2746. { Depending on the DeepMOVOpt above, it may turn out that hp1 completely
  2747. overwrites the original destination register. e.g.
  2748. movl ###,%reg2d
  2749. movslq ###,%reg2q (### doesn't have to be the same as the first one)
  2750. In this case, we can remove the MOV (Go to "Mov2Nop 5" below)
  2751. }
  2752. if (taicpu(p).oper[1]^.typ = top_reg) and
  2753. MatchInstruction(hp1, [A_LEA, A_MOV, A_MOVSX, A_MOVZX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}], []) and
  2754. (taicpu(hp1).oper[1]^.typ = top_reg) and
  2755. Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[1]^.reg) then
  2756. begin
  2757. if RegInOp(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^) then
  2758. begin
  2759. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  2760. case taicpu(p).oper[0]^.typ of
  2761. top_const:
  2762. { We have something like:
  2763. movb $x, %regb
  2764. movzbl %regb,%regd
  2765. Change to:
  2766. movl $x, %regd
  2767. }
  2768. begin
  2769. case taicpu(hp1).opsize of
  2770. S_BW:
  2771. begin
  2772. convert_mov_value(A_MOVSX, $FF);
  2773. setsubreg(taicpu(p).oper[1]^.reg, R_SUBW);
  2774. taicpu(p).opsize := S_W;
  2775. end;
  2776. S_BL:
  2777. begin
  2778. convert_mov_value(A_MOVSX, $FF);
  2779. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  2780. taicpu(p).opsize := S_L;
  2781. end;
  2782. S_WL:
  2783. begin
  2784. convert_mov_value(A_MOVSX, $FFFF);
  2785. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  2786. taicpu(p).opsize := S_L;
  2787. end;
  2788. {$ifdef x86_64}
  2789. S_BQ:
  2790. begin
  2791. convert_mov_value(A_MOVSX, $FF);
  2792. setsubreg(taicpu(p).oper[1]^.reg, R_SUBQ);
  2793. taicpu(p).opsize := S_Q;
  2794. end;
  2795. S_WQ:
  2796. begin
  2797. convert_mov_value(A_MOVSX, $FFFF);
  2798. setsubreg(taicpu(p).oper[1]^.reg, R_SUBQ);
  2799. taicpu(p).opsize := S_Q;
  2800. end;
  2801. S_LQ:
  2802. begin
  2803. convert_mov_value(A_MOVSXD, $FFFFFFFF); { Note it's MOVSXD, not MOVSX }
  2804. setsubreg(taicpu(p).oper[1]^.reg, R_SUBQ);
  2805. taicpu(p).opsize := S_Q;
  2806. end;
  2807. {$endif x86_64}
  2808. else
  2809. { If hp1 was a MOV instruction, it should have been
  2810. optimised already }
  2811. InternalError(2020021001);
  2812. end;
  2813. DebugMsg(SPeepholeOptimization + 'MovMovXX2MovXX 2 done',p);
  2814. RemoveInstruction(hp1);
  2815. Result := True;
  2816. Exit;
  2817. end;
  2818. top_ref:
  2819. begin
  2820. { We have something like:
  2821. movb mem, %regb
  2822. movzbl %regb,%regd
  2823. Change to:
  2824. movzbl mem, %regd
  2825. }
  2826. ThisRef := taicpu(p).oper[0]^.ref^;
  2827. if (ThisRef.refaddr<>addr_full) and (IsMOVZXAcceptable or (taicpu(hp1).opcode<>A_MOVZX)) then
  2828. begin
  2829. DebugMsg(SPeepholeOptimization + 'MovMovXX2MovXX 1 done',p);
  2830. taicpu(hp1).loadref(0, ThisRef);
  2831. { Make sure any registers in the references are properly tracked }
  2832. if (ThisRef.base <> NR_NO){$ifdef x86_64} and (ThisRef.base <> NR_RIP){$endif x86_64} then
  2833. AllocRegBetween(ThisRef.base, p, hp1, UsedRegs);
  2834. if (ThisRef.index <> NR_NO) then
  2835. AllocRegBetween(ThisRef.index, p, hp1, UsedRegs);
  2836. RemoveCurrentP(p, hp1);
  2837. Result := True;
  2838. Exit;
  2839. end;
  2840. end;
  2841. else
  2842. if (taicpu(hp1).opcode <> A_MOV) and (taicpu(hp1).opcode <> A_LEA) then
  2843. { Just to make a saving, since there are no more optimisations with MOVZX and MOVSX/D }
  2844. Exit;
  2845. end;
  2846. end
  2847. { The RegInOp check makes sure that movl r/m,%reg1l; movzbl (%reg1l),%reg1l"
  2848. and "movl r/m,%reg1; leal $1(%reg1,%reg2),%reg1" etc. are not incorrectly
  2849. optimised }
  2850. else
  2851. begin
  2852. DebugMsg(SPeepholeOptimization + 'Mov2Nop 5 done',p);
  2853. RemoveCurrentP(p, hp1);
  2854. Result := True;
  2855. Exit;
  2856. end;
  2857. end;
  2858. if (taicpu(hp1).opcode = A_AND) and
  2859. (taicpu(p).oper[1]^.typ = top_reg) and
  2860. MatchOpType(taicpu(hp1),top_const,top_reg) then
  2861. begin
  2862. if MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[1]^) then
  2863. begin
  2864. case taicpu(p).opsize of
  2865. S_L:
  2866. if (taicpu(hp1).oper[0]^.val = $ffffffff) then
  2867. begin
  2868. { Optimize out:
  2869. mov x, %reg
  2870. and ffffffffh, %reg
  2871. }
  2872. DebugMsg(SPeepholeOptimization + 'MovAnd2Mov 1 done',p);
  2873. RemoveInstruction(hp1);
  2874. Result:=true;
  2875. exit;
  2876. end;
  2877. S_Q: { TODO: Confirm if this is even possible }
  2878. if (taicpu(hp1).oper[0]^.val = $ffffffffffffffff) then
  2879. begin
  2880. { Optimize out:
  2881. mov x, %reg
  2882. and ffffffffffffffffh, %reg
  2883. }
  2884. DebugMsg(SPeepholeOptimization + 'MovAnd2Mov 2 done',p);
  2885. RemoveInstruction(hp1);
  2886. Result:=true;
  2887. exit;
  2888. end;
  2889. else
  2890. ;
  2891. end;
  2892. if (
  2893. (taicpu(p).oper[0]^.typ=top_reg) or
  2894. (
  2895. (taicpu(p).oper[0]^.typ=top_ref) and
  2896. (taicpu(p).oper[0]^.ref^.refaddr<>addr_full)
  2897. )
  2898. ) and
  2899. GetNextInstruction(hp1,hp2) and
  2900. MatchInstruction(hp2,A_TEST,[]) and
  2901. (
  2902. MatchOperand(taicpu(hp1).oper[1]^,taicpu(hp2).oper[1]^) or
  2903. (
  2904. { If the register being tested is smaller than the one
  2905. that received a bitwise AND, permit it if the constant
  2906. fits into the smaller size }
  2907. (taicpu(hp1).oper[1]^.typ = top_reg) and (taicpu(hp2).oper[1]^.typ = top_reg) and
  2908. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg,taicpu(hp2).oper[1]^.reg) and
  2909. (taicpu(hp1).oper[0]^.typ = top_const) and (taicpu(hp1).oper[0]^.val >= 0) and
  2910. (GetSubReg(taicpu(hp2).oper[1]^.reg) < GetSubReg(taicpu(hp1).oper[1]^.reg)) and
  2911. (
  2912. (
  2913. (GetSubReg(taicpu(hp2).oper[1]^.reg) = R_SUBL) and
  2914. (taicpu(hp1).oper[0]^.val <= $FF)
  2915. ) or
  2916. (
  2917. (GetSubReg(taicpu(hp2).oper[1]^.reg) = R_SUBW) and
  2918. (taicpu(hp1).oper[0]^.val <= $FFFF)
  2919. {$ifdef x86_64}
  2920. ) or
  2921. (
  2922. (GetSubReg(taicpu(hp2).oper[1]^.reg) = R_SUBD) and
  2923. (taicpu(hp1).oper[0]^.val <= $FFFFFFFF)
  2924. {$endif x86_64}
  2925. )
  2926. )
  2927. )
  2928. ) and
  2929. (
  2930. MatchOperand(taicpu(hp2).oper[0]^,taicpu(hp2).oper[1]^) or
  2931. MatchOperand(taicpu(hp2).oper[0]^,-1)
  2932. ) and
  2933. GetNextInstruction(hp2,hp3) and
  2934. MatchInstruction(hp3,A_Jcc,A_Setcc,[]) and
  2935. (taicpu(hp3).condition in [C_E,C_NE]) then
  2936. begin
  2937. TransferUsedRegs(TmpUsedRegs);
  2938. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  2939. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  2940. if not(RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp2, TmpUsedRegs)) then
  2941. begin
  2942. DebugMsg(SPeepholeOptimization + 'MovAndTest2Test done',p);
  2943. taicpu(hp1).loadoper(1,taicpu(p).oper[0]^);
  2944. taicpu(hp1).opcode:=A_TEST;
  2945. { Shrink the TEST instruction down to the smallest possible size }
  2946. case taicpu(hp1).oper[0]^.val of
  2947. 0..255:
  2948. if (taicpu(hp1).opsize <> S_B)
  2949. {$ifndef x86_64}
  2950. and (
  2951. (taicpu(hp1).oper[1]^.typ <> top_reg) or
  2952. { Cannot encode byte-sized ESI, EDI, EBP or ESP under i386 }
  2953. (GetSupReg(taicpu(hp1).oper[1]^.reg) in [RS_EAX, RS_EBX, RS_ECX, RS_EDX])
  2954. )
  2955. {$endif x86_64}
  2956. then
  2957. begin
  2958. if taicpu(hp1).opsize <> taicpu(hp2).opsize then
  2959. { Only print debug message if the TEST instruction
  2960. is a different size before and after }
  2961. DebugMsg(SPeepholeOptimization + 'test' + debug_opsize2str(taicpu(hp1).opsize) + ' -> testb to reduce instruction size (Test2Test 1a)' , p);
  2962. taicpu(hp1).opsize := S_B;
  2963. if (taicpu(hp1).oper[1]^.typ = top_reg) then
  2964. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBL);
  2965. end;
  2966. 256..65535:
  2967. if (taicpu(hp1).opsize <> S_W) then
  2968. begin
  2969. if taicpu(hp1).opsize <> taicpu(hp2).opsize then
  2970. { Only print debug message if the TEST instruction
  2971. is a different size before and after }
  2972. DebugMsg(SPeepholeOptimization + 'test' + debug_opsize2str(taicpu(hp1).opsize) + ' -> testw to reduce instruction size (Test2Test 1b)' , p);
  2973. taicpu(hp1).opsize := S_W;
  2974. if (taicpu(hp1).oper[1]^.typ = top_reg) then
  2975. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBW);
  2976. end;
  2977. {$ifdef x86_64}
  2978. 65536..$7FFFFFFF:
  2979. if (taicpu(hp1).opsize <> S_L) then
  2980. begin
  2981. if taicpu(hp1).opsize <> taicpu(hp2).opsize then
  2982. { Only print debug message if the TEST instruction
  2983. is a different size before and after }
  2984. DebugMsg(SPeepholeOptimization + 'test' + debug_opsize2str(taicpu(hp1).opsize) + ' -> testl to reduce instruction size (Test2Test 1c)' , p);
  2985. taicpu(hp1).opsize := S_L;
  2986. if (taicpu(hp1).oper[1]^.typ = top_reg) then
  2987. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  2988. end;
  2989. {$endif x86_64}
  2990. else
  2991. ;
  2992. end;
  2993. RemoveInstruction(hp2);
  2994. RemoveCurrentP(p, hp1);
  2995. Result:=true;
  2996. exit;
  2997. end;
  2998. end;
  2999. end
  3000. else if IsMOVZXAcceptable and
  3001. (taicpu(p).oper[1]^.typ = top_reg) and (taicpu(hp1).oper[1]^.typ = top_reg) and
  3002. (taicpu(p).oper[0]^.typ <> top_const) and { MOVZX only supports registers and memory, not immediates (use MOV for that!) }
  3003. (getsupreg(taicpu(p).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg))
  3004. then
  3005. begin
  3006. InputVal := debug_operstr(taicpu(p).oper[0]^);
  3007. MaskNum := debug_tostr(taicpu(hp1).oper[0]^.val);
  3008. case taicpu(p).opsize of
  3009. S_B:
  3010. if (taicpu(hp1).oper[0]^.val = $ff) then
  3011. begin
  3012. { Convert:
  3013. movb x, %regl movb x, %regl
  3014. andw ffh, %regw andl ffh, %regd
  3015. To:
  3016. movzbw x, %regd movzbl x, %regd
  3017. (Identical registers, just different sizes)
  3018. }
  3019. RegName1 := debug_regname(taicpu(p).oper[1]^.reg); { 8-bit register name }
  3020. RegName2 := debug_regname(taicpu(hp1).oper[1]^.reg); { 16/32-bit register name }
  3021. case taicpu(hp1).opsize of
  3022. S_W: NewSize := S_BW;
  3023. S_L: NewSize := S_BL;
  3024. {$ifdef x86_64}
  3025. S_Q: NewSize := S_BQ;
  3026. {$endif x86_64}
  3027. else
  3028. InternalError(2018011510);
  3029. end;
  3030. end
  3031. else
  3032. NewSize := S_NO;
  3033. S_W:
  3034. if (taicpu(hp1).oper[0]^.val = $ffff) then
  3035. begin
  3036. { Convert:
  3037. movw x, %regw
  3038. andl ffffh, %regd
  3039. To:
  3040. movzwl x, %regd
  3041. (Identical registers, just different sizes)
  3042. }
  3043. RegName1 := debug_regname(taicpu(p).oper[1]^.reg); { 16-bit register name }
  3044. RegName2 := debug_regname(taicpu(hp1).oper[1]^.reg); { 32-bit register name }
  3045. case taicpu(hp1).opsize of
  3046. S_L: NewSize := S_WL;
  3047. {$ifdef x86_64}
  3048. S_Q: NewSize := S_WQ;
  3049. {$endif x86_64}
  3050. else
  3051. InternalError(2018011511);
  3052. end;
  3053. end
  3054. else
  3055. NewSize := S_NO;
  3056. else
  3057. NewSize := S_NO;
  3058. end;
  3059. if NewSize <> S_NO then
  3060. begin
  3061. PreMessage := 'mov' + debug_opsize2str(taicpu(p).opsize) + ' ' + InputVal + ',' + RegName1;
  3062. { The actual optimization }
  3063. taicpu(p).opcode := A_MOVZX;
  3064. taicpu(p).changeopsize(NewSize);
  3065. taicpu(p).oper[1]^ := taicpu(hp1).oper[1]^;
  3066. { Safeguard if "and" is followed by a conditional command }
  3067. TransferUsedRegs(TmpUsedRegs);
  3068. UpdateUsedRegs(TmpUsedRegs,tai(p.next));
  3069. if (RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)) then
  3070. begin
  3071. { At this point, the "and" command is effectively equivalent to
  3072. "test %reg,%reg". This will be handled separately by the
  3073. Peephole Optimizer. [Kit] }
  3074. DebugMsg(SPeepholeOptimization + PreMessage +
  3075. ' -> movz' + debug_opsize2str(NewSize) + ' ' + InputVal + ',' + RegName2, p);
  3076. end
  3077. else
  3078. begin
  3079. DebugMsg(SPeepholeOptimization + PreMessage + '; and' + debug_opsize2str(taicpu(hp1).opsize) + ' $' + MaskNum + ',' + RegName2 +
  3080. ' -> movz' + debug_opsize2str(NewSize) + ' ' + InputVal + ',' + RegName2, p);
  3081. RemoveInstruction(hp1);
  3082. end;
  3083. Result := True;
  3084. Exit;
  3085. end;
  3086. end;
  3087. end;
  3088. if (taicpu(hp1).opcode = A_OR) and
  3089. (taicpu(p).oper[1]^.typ = top_reg) and
  3090. MatchOperand(taicpu(p).oper[0]^, 0) and
  3091. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) then
  3092. begin
  3093. { mov 0, %reg
  3094. or ###,%reg
  3095. Change to (only if the flags are not used):
  3096. mov ###,%reg
  3097. }
  3098. TransferUsedRegs(TmpUsedRegs);
  3099. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3100. DoOptimisation := True;
  3101. { Even if the flags are used, we might be able to do the optimisation
  3102. if the conditions are predictable }
  3103. if RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  3104. begin
  3105. { Only perform if ### = %reg (the same register) or equal to 0,
  3106. so %reg is guaranteed to still have a value of zero }
  3107. if MatchOperand(taicpu(hp1).oper[0]^, 0) or
  3108. MatchOperand(taicpu(hp1).oper[0]^, taicpu(hp1).oper[1]^.reg) then
  3109. begin
  3110. hp2 := hp1;
  3111. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  3112. while RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) and
  3113. GetNextInstruction(hp2, hp3) do
  3114. begin
  3115. { Don't continue modifying if the flags state is getting changed }
  3116. if RegModifiedByInstruction(NR_DEFAULTFLAGS, hp3) then
  3117. Break;
  3118. UpdateUsedRegs(TmpUsedRegs, tai(hp3.Next));
  3119. if MatchInstruction(hp3, A_Jcc, A_SETcc, A_CMOVcc, []) then
  3120. begin
  3121. if condition_in(C_E, taicpu(hp3).condition) or (taicpu(hp3).condition in [C_NC, C_NS, C_NO]) then
  3122. begin
  3123. { Condition is always true }
  3124. case taicpu(hp3).opcode of
  3125. A_Jcc:
  3126. begin
  3127. DebugMsg(SPeepholeOptimization + 'Condition is always true (jump made unconditional)', hp3);
  3128. { Check for jump shortcuts before we destroy the condition }
  3129. DoJumpOptimizations(hp3, TempBool);
  3130. MakeUnconditional(taicpu(hp3));
  3131. Result := True;
  3132. end;
  3133. A_CMOVcc:
  3134. begin
  3135. DebugMsg(SPeepholeOptimization + 'Condition is always true (CMOVcc -> MOV)', hp3);
  3136. taicpu(hp3).opcode := A_MOV;
  3137. taicpu(hp3).condition := C_None;
  3138. Result := True;
  3139. end;
  3140. A_SETcc:
  3141. begin
  3142. DebugMsg(SPeepholeOptimization + 'Condition is always true (changed to MOV 1)', hp3);
  3143. { Convert "set(c) %reg" instruction to "movb 1,%reg" }
  3144. taicpu(hp3).opcode := A_MOV;
  3145. taicpu(hp3).ops := 2;
  3146. taicpu(hp3).condition := C_None;
  3147. taicpu(hp3).opsize := S_B;
  3148. taicpu(hp3).loadreg(1,taicpu(hp3).oper[0]^.reg);
  3149. taicpu(hp3).loadconst(0, 1);
  3150. Result := True;
  3151. end;
  3152. else
  3153. InternalError(2021090701);
  3154. end;
  3155. end
  3156. 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
  3157. begin
  3158. { Condition is always false }
  3159. case taicpu(hp3).opcode of
  3160. A_Jcc:
  3161. begin
  3162. DebugMsg(SPeepholeOptimization + 'Condition is always false (jump removed)', hp3);
  3163. TAsmLabel(taicpu(hp3).oper[0]^.ref^.symbol).decrefs;
  3164. RemoveInstruction(hp3);
  3165. Result := True;
  3166. { Since hp3 was deleted, hp2 must not be updated }
  3167. Continue;
  3168. end;
  3169. A_CMOVcc:
  3170. begin
  3171. DebugMsg(SPeepholeOptimization + 'Condition is always false (conditional load removed)', hp3);
  3172. RemoveInstruction(hp3);
  3173. Result := True;
  3174. { Since hp3 was deleted, hp2 must not be updated }
  3175. Continue;
  3176. end;
  3177. A_SETcc:
  3178. begin
  3179. DebugMsg(SPeepholeOptimization + 'Condition is always false (changed to MOV 0)', hp3);
  3180. { Convert "set(c) %reg" instruction to "movb 0,%reg" }
  3181. taicpu(hp3).opcode := A_MOV;
  3182. taicpu(hp3).ops := 2;
  3183. taicpu(hp3).condition := C_None;
  3184. taicpu(hp3).opsize := S_B;
  3185. taicpu(hp3).loadreg(1,taicpu(hp3).oper[0]^.reg);
  3186. taicpu(hp3).loadconst(0, 0);
  3187. Result := True;
  3188. end;
  3189. else
  3190. InternalError(2021090702);
  3191. end;
  3192. end
  3193. else
  3194. { Uncertain what to do - don't optimise (although optimise other conditional statements if present) }
  3195. DoOptimisation := False;
  3196. end;
  3197. hp2 := hp3;
  3198. end;
  3199. { Flags are still in use - don't optimise }
  3200. if DoOptimisation and RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  3201. DoOptimisation := False;
  3202. end
  3203. else
  3204. DoOptimisation := False;
  3205. end;
  3206. if DoOptimisation then
  3207. begin
  3208. {$ifdef x86_64}
  3209. { OR only supports 32-bit sign-extended constants for 64-bit
  3210. instructions, so compensate for this if the constant is
  3211. encoded as a value greater than or equal to 2^31 }
  3212. if (taicpu(hp1).opsize = S_Q) and
  3213. (taicpu(hp1).oper[0]^.typ = top_const) and
  3214. (taicpu(hp1).oper[0]^.val >= $80000000) then
  3215. taicpu(hp1).oper[0]^.val := taicpu(hp1).oper[0]^.val or $FFFFFFFF00000000;
  3216. {$endif x86_64}
  3217. DebugMsg(SPeepholeOptimization + 'MOV 0 / OR -> MOV', p);
  3218. taicpu(hp1).opcode := A_MOV;
  3219. RemoveCurrentP(p, hp1);
  3220. Result := True;
  3221. Exit;
  3222. end;
  3223. end;
  3224. { Next instruction is also a MOV ? }
  3225. if MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) then
  3226. begin
  3227. if MatchOpType(taicpu(p), top_const, top_ref) and
  3228. MatchOpType(taicpu(hp1), top_const, top_ref) and
  3229. TryConstMerge(p, hp1) then
  3230. begin
  3231. Result := True;
  3232. { In case we have four byte writes in a row, check for 2 more
  3233. right now so we don't have to wait for another iteration of
  3234. pass 1
  3235. }
  3236. { If two byte-writes were merged, the opsize is now S_W, not S_B }
  3237. case taicpu(p).opsize of
  3238. S_W:
  3239. begin
  3240. if GetNextInstruction(p, hp1) and
  3241. MatchInstruction(hp1, A_MOV, [S_B]) and
  3242. MatchOpType(taicpu(hp1), top_const, top_ref) and
  3243. GetNextInstruction(hp1, hp2) and
  3244. MatchInstruction(hp2, A_MOV, [S_B]) and
  3245. MatchOpType(taicpu(hp2), top_const, top_ref) and
  3246. { Try to merge the two bytes }
  3247. TryConstMerge(hp1, hp2) then
  3248. { Now try to merge the two words (hp2 will get deleted) }
  3249. TryConstMerge(p, hp1);
  3250. end;
  3251. S_L:
  3252. begin
  3253. { Though this only really benefits x86_64 and not i386, it
  3254. gets a potential optimisation done faster and hence
  3255. reduces the number of times OptPass1MOV is entered }
  3256. if GetNextInstruction(p, hp1) and
  3257. MatchInstruction(hp1, A_MOV, [S_W]) and
  3258. MatchOpType(taicpu(hp1), top_const, top_ref) and
  3259. GetNextInstruction(hp1, hp2) and
  3260. MatchInstruction(hp2, A_MOV, [S_W]) and
  3261. MatchOpType(taicpu(hp2), top_const, top_ref) and
  3262. { Try to merge the two words }
  3263. TryConstMerge(hp1, hp2) then
  3264. { This will always fail on i386, so don't bother
  3265. calling it unless we're doing x86_64 }
  3266. {$ifdef x86_64}
  3267. { Now try to merge the two longwords (hp2 will get deleted) }
  3268. TryConstMerge(p, hp1)
  3269. {$endif x86_64}
  3270. ;
  3271. end;
  3272. else
  3273. ;
  3274. end;
  3275. Exit;
  3276. end;
  3277. if (taicpu(p).oper[1]^.typ = top_reg) and
  3278. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) then
  3279. begin
  3280. { Remember that p_TargetReg contains taicpu(p).oper[1]^.reg }
  3281. TransferUsedRegs(TmpUsedRegs);
  3282. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3283. { we have
  3284. mov x, %treg
  3285. mov %treg, y
  3286. }
  3287. if not(RegInOp(p_TargetReg, taicpu(hp1).oper[1]^)) then
  3288. if not(RegUsedAfterInstruction(p_TargetReg, hp1, TmpUsedRegs)) then
  3289. { we've got
  3290. mov x, %treg
  3291. mov %treg, y
  3292. with %treg is not used after }
  3293. case taicpu(p).oper[0]^.typ Of
  3294. { top_reg is covered by DeepMOVOpt }
  3295. top_const:
  3296. begin
  3297. { change
  3298. mov const, %treg
  3299. mov %treg, y
  3300. to
  3301. mov const, y
  3302. }
  3303. if (taicpu(hp1).oper[1]^.typ=top_reg) or
  3304. ((taicpu(p).oper[0]^.val>=low(longint)) and (taicpu(p).oper[0]^.val<=high(longint))) then
  3305. begin
  3306. if taicpu(hp1).oper[1]^.typ=top_reg then
  3307. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,usedregs);
  3308. taicpu(p).loadOper(1,taicpu(hp1).oper[1]^);
  3309. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 5 done',p);
  3310. RemoveInstruction(hp1);
  3311. Result:=true;
  3312. Exit;
  3313. end;
  3314. end;
  3315. top_ref:
  3316. case taicpu(hp1).oper[1]^.typ of
  3317. top_reg:
  3318. begin
  3319. { change
  3320. mov mem, %treg
  3321. mov %treg, %reg
  3322. to
  3323. mov mem, %reg"
  3324. }
  3325. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,usedregs);
  3326. taicpu(p).loadreg(1, taicpu(hp1).oper[1]^.reg);
  3327. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 3 done',p);
  3328. RemoveInstruction(hp1);
  3329. Result:=true;
  3330. Exit;
  3331. end;
  3332. top_ref:
  3333. begin
  3334. {$ifdef x86_64}
  3335. { Look for the following to simplify:
  3336. mov x(mem1), %reg
  3337. mov %reg, y(mem2)
  3338. mov x+8(mem1), %reg
  3339. mov %reg, y+8(mem2)
  3340. Change to:
  3341. movdqu x(mem1), %xmmreg
  3342. movdqu %xmmreg, y(mem2)
  3343. ...but only as long as the memory blocks don't overlap
  3344. }
  3345. SourceRef := taicpu(p).oper[0]^.ref^;
  3346. TargetRef := taicpu(hp1).oper[1]^.ref^;
  3347. if (taicpu(p).opsize = S_Q) and
  3348. GetNextInstruction(hp1, hp2) and
  3349. MatchInstruction(hp2, A_MOV, [taicpu(p).opsize]) and
  3350. MatchOpType(taicpu(hp2), top_ref, top_reg) then
  3351. begin
  3352. { Delay calling GetNextInstruction(hp2, hp3) for as long as possible }
  3353. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  3354. Inc(SourceRef.offset, 8);
  3355. if UseAVX then
  3356. begin
  3357. MovAligned := A_VMOVDQA;
  3358. MovUnaligned := A_VMOVDQU;
  3359. end
  3360. else
  3361. begin
  3362. MovAligned := A_MOVDQA;
  3363. MovUnaligned := A_MOVDQU;
  3364. end;
  3365. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) and
  3366. not RefsMightOverlap(taicpu(p).oper[0]^.ref^, TargetRef, 16) then
  3367. begin
  3368. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  3369. Inc(TargetRef.offset, 8);
  3370. if GetNextInstruction(hp2, hp3) and
  3371. MatchInstruction(hp3, A_MOV, [taicpu(p).opsize]) and
  3372. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  3373. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  3374. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  3375. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  3376. begin
  3377. NewMMReg := GetMMRegisterBetween(R_SUBMMX, UsedRegs, p, hp3);
  3378. if NewMMReg <> NR_NO then
  3379. begin
  3380. { Remember that the offsets are 8 ahead }
  3381. if ((SourceRef.offset mod 16) = 8) and
  3382. (
  3383. { Base pointer is always aligned (stack pointer won't be if there's no stack frame) }
  3384. (SourceRef.base = current_procinfo.framepointer) or
  3385. ((SourceRef.alignment >= 16) and ((SourceRef.alignment mod 16) = 0))
  3386. ) then
  3387. taicpu(p).opcode := MovAligned
  3388. else
  3389. taicpu(p).opcode := MovUnaligned;
  3390. taicpu(p).opsize := S_XMM;
  3391. taicpu(p).oper[1]^.reg := NewMMReg;
  3392. if ((TargetRef.offset mod 16) = 8) and
  3393. (
  3394. { Base pointer is always aligned (stack pointer won't be if there's no stack frame) }
  3395. (TargetRef.base = current_procinfo.framepointer) or
  3396. ((TargetRef.alignment >= 16) and ((TargetRef.alignment mod 16) = 0))
  3397. ) then
  3398. taicpu(hp1).opcode := MovAligned
  3399. else
  3400. taicpu(hp1).opcode := MovUnaligned;
  3401. taicpu(hp1).opsize := S_XMM;
  3402. taicpu(hp1).oper[0]^.reg := NewMMReg;
  3403. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(NewMMReg) + ' to merge a pair of memory moves (MovMovMovMov2MovdqMovdq 1)', p);
  3404. RemoveInstruction(hp2);
  3405. RemoveInstruction(hp3);
  3406. Result := True;
  3407. Exit;
  3408. end;
  3409. end;
  3410. end
  3411. else
  3412. begin
  3413. { See if the next references are 8 less rather than 8 greater }
  3414. Dec(SourceRef.offset, 16); { -8 the other way }
  3415. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) then
  3416. begin
  3417. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  3418. Dec(TargetRef.offset, 8); { Only 8, not 16, as it wasn't incremented unlike SourceRef }
  3419. if not RefsMightOverlap(SourceRef, TargetRef, 16) and
  3420. GetNextInstruction(hp2, hp3) and
  3421. MatchInstruction(hp3, A_MOV, [taicpu(p).opsize]) and
  3422. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  3423. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  3424. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  3425. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  3426. begin
  3427. NewMMReg := GetMMRegisterBetween(R_SUBMMX, UsedRegs, p, hp3);
  3428. if NewMMReg <> NR_NO then
  3429. begin
  3430. { hp2 and hp3 are the starting offsets, so mod = 0 this time }
  3431. if ((SourceRef.offset mod 16) = 0) and
  3432. (
  3433. { Base pointer is always aligned (stack pointer won't be if there's no stack frame) }
  3434. (SourceRef.base = current_procinfo.framepointer) or
  3435. ((SourceRef.alignment >= 16) and ((SourceRef.alignment mod 16) = 0))
  3436. ) then
  3437. taicpu(hp2).opcode := MovAligned
  3438. else
  3439. taicpu(hp2).opcode := MovUnaligned;
  3440. taicpu(hp2).opsize := S_XMM;
  3441. taicpu(hp2).oper[1]^.reg := NewMMReg;
  3442. if ((TargetRef.offset mod 16) = 0) and
  3443. (
  3444. { Base pointer is always aligned (stack pointer won't be if there's no stack frame) }
  3445. (TargetRef.base = current_procinfo.framepointer) or
  3446. ((TargetRef.alignment >= 16) and ((TargetRef.alignment mod 16) = 0))
  3447. ) then
  3448. taicpu(hp3).opcode := MovAligned
  3449. else
  3450. taicpu(hp3).opcode := MovUnaligned;
  3451. taicpu(hp3).opsize := S_XMM;
  3452. taicpu(hp3).oper[0]^.reg := NewMMReg;
  3453. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(NewMMReg) + ' to merge a pair of memory moves (MovMovMovMov2MovdqMovdq 2)', p);
  3454. RemoveInstruction(hp1);
  3455. RemoveCurrentP(p, hp2);
  3456. Result := True;
  3457. Exit;
  3458. end;
  3459. end;
  3460. end;
  3461. end;
  3462. end;
  3463. {$endif x86_64}
  3464. end;
  3465. else
  3466. { The write target should be a reg or a ref }
  3467. InternalError(2021091601);
  3468. end;
  3469. else
  3470. ;
  3471. end
  3472. else
  3473. { %treg is used afterwards, but all eventualities
  3474. other than the first MOV instruction being a constant
  3475. are covered by DeepMOVOpt, so only check for that }
  3476. if (taicpu(p).oper[0]^.typ = top_const) and
  3477. (
  3478. { For MOV operations, a size saving is only made if the register/const is byte-sized }
  3479. not (cs_opt_size in current_settings.optimizerswitches) or
  3480. (taicpu(hp1).opsize = S_B)
  3481. ) and
  3482. (
  3483. (taicpu(hp1).oper[1]^.typ = top_reg) or
  3484. ((taicpu(p).oper[0]^.val >= low(longint)) and (taicpu(p).oper[0]^.val <= high(longint)))
  3485. ) then
  3486. begin
  3487. DebugMsg(SPeepholeOptimization + debug_operstr(taicpu(hp1).oper[0]^) + ' = $' + debug_tostr(taicpu(p).oper[0]^.val) + '; changed to minimise pipeline stall (MovMov2Mov 6b)',hp1);
  3488. taicpu(hp1).loadconst(0, taicpu(p).oper[0]^.val);
  3489. end;
  3490. end;
  3491. if (taicpu(hp1).oper[0]^.typ = taicpu(p).oper[1]^.typ) and
  3492. (taicpu(hp1).oper[1]^.typ = taicpu(p).oper[0]^.typ) then
  3493. { mov reg1, mem1 or mov mem1, reg1
  3494. mov mem2, reg2 mov reg2, mem2}
  3495. begin
  3496. if OpsEqual(taicpu(hp1).oper[1]^,taicpu(p).oper[0]^) then
  3497. { mov reg1, mem1 or mov mem1, reg1
  3498. mov mem2, reg1 mov reg2, mem1}
  3499. begin
  3500. if OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  3501. { Removes the second statement from
  3502. mov reg1, mem1/reg2
  3503. mov mem1/reg2, reg1 }
  3504. begin
  3505. if taicpu(p).oper[0]^.typ=top_reg then
  3506. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,usedregs);
  3507. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 1',p);
  3508. RemoveInstruction(hp1);
  3509. Result:=true;
  3510. exit;
  3511. end
  3512. else
  3513. begin
  3514. TransferUsedRegs(TmpUsedRegs);
  3515. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  3516. if (taicpu(p).oper[1]^.typ = top_ref) and
  3517. { mov reg1, mem1
  3518. mov mem2, reg1 }
  3519. (taicpu(hp1).oper[0]^.ref^.refaddr = addr_no) and
  3520. GetNextInstruction(hp1, hp2) and
  3521. MatchInstruction(hp2,A_CMP,[taicpu(p).opsize]) and
  3522. OpsEqual(taicpu(p).oper[1]^,taicpu(hp2).oper[0]^) and
  3523. OpsEqual(taicpu(p).oper[0]^,taicpu(hp2).oper[1]^) and
  3524. not(RegUsedAfterInstruction(taicpu(p).oper[0]^.reg, hp2, TmpUsedRegs)) then
  3525. { change to
  3526. mov reg1, mem1 mov reg1, mem1
  3527. mov mem2, reg1 cmp reg1, mem2
  3528. cmp mem1, reg1
  3529. }
  3530. begin
  3531. RemoveInstruction(hp2);
  3532. taicpu(hp1).opcode := A_CMP;
  3533. taicpu(hp1).loadref(1,taicpu(hp1).oper[0]^.ref^);
  3534. taicpu(hp1).loadreg(0,taicpu(p).oper[0]^.reg);
  3535. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,UsedRegs);
  3536. DebugMsg(SPeepholeOptimization + 'MovMovCmp2MovCmp done',hp1);
  3537. end;
  3538. end;
  3539. end
  3540. else if (taicpu(p).oper[1]^.typ=top_ref) and
  3541. OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  3542. begin
  3543. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,UsedRegs);
  3544. taicpu(hp1).loadreg(0,taicpu(p).oper[0]^.reg);
  3545. DebugMsg(SPeepholeOptimization + 'MovMov2MovMov1 done',p);
  3546. end
  3547. else
  3548. begin
  3549. TransferUsedRegs(TmpUsedRegs);
  3550. if GetNextInstruction(hp1, hp2) and
  3551. MatchOpType(taicpu(p),top_ref,top_reg) and
  3552. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  3553. (taicpu(hp1).oper[1]^.typ = top_ref) and
  3554. MatchInstruction(hp2,A_MOV,[taicpu(p).opsize]) and
  3555. MatchOpType(taicpu(hp2),top_ref,top_reg) and
  3556. RefsEqual(taicpu(hp2).oper[0]^.ref^, taicpu(hp1).oper[1]^.ref^) then
  3557. if not RegInRef(taicpu(hp2).oper[1]^.reg,taicpu(hp2).oper[0]^.ref^) and
  3558. not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,tmpUsedRegs)) then
  3559. { mov mem1, %reg1
  3560. mov %reg1, mem2
  3561. mov mem2, reg2
  3562. to:
  3563. mov mem1, reg2
  3564. mov reg2, mem2}
  3565. begin
  3566. AllocRegBetween(taicpu(hp2).oper[1]^.reg,p,hp2,usedregs);
  3567. DebugMsg(SPeepholeOptimization + 'MovMovMov2MovMov 1 done',p);
  3568. taicpu(p).loadoper(1,taicpu(hp2).oper[1]^);
  3569. taicpu(hp1).loadoper(0,taicpu(hp2).oper[1]^);
  3570. RemoveInstruction(hp2);
  3571. Result := True;
  3572. end
  3573. {$ifdef i386}
  3574. { this is enabled for i386 only, as the rules to create the reg sets below
  3575. are too complicated for x86-64, so this makes this code too error prone
  3576. on x86-64
  3577. }
  3578. else if (taicpu(p).oper[1]^.reg <> taicpu(hp2).oper[1]^.reg) and
  3579. not(RegInRef(taicpu(p).oper[1]^.reg,taicpu(p).oper[0]^.ref^)) and
  3580. not(RegInRef(taicpu(hp2).oper[1]^.reg,taicpu(hp2).oper[0]^.ref^)) then
  3581. { mov mem1, reg1 mov mem1, reg1
  3582. mov reg1, mem2 mov reg1, mem2
  3583. mov mem2, reg2 mov mem2, reg1
  3584. to: to:
  3585. mov mem1, reg1 mov mem1, reg1
  3586. mov mem1, reg2 mov reg1, mem2
  3587. mov reg1, mem2
  3588. or (if mem1 depends on reg1
  3589. and/or if mem2 depends on reg2)
  3590. to:
  3591. mov mem1, reg1
  3592. mov reg1, mem2
  3593. mov reg1, reg2
  3594. }
  3595. begin
  3596. taicpu(hp1).loadRef(0,taicpu(p).oper[0]^.ref^);
  3597. taicpu(hp1).loadReg(1,taicpu(hp2).oper[1]^.reg);
  3598. taicpu(hp2).loadRef(1,taicpu(hp2).oper[0]^.ref^);
  3599. taicpu(hp2).loadReg(0,taicpu(p).oper[1]^.reg);
  3600. AllocRegBetween(taicpu(p).oper[1]^.reg,p,hp2,usedregs);
  3601. if (taicpu(p).oper[0]^.ref^.base <> NR_NO) and
  3602. (getsupreg(taicpu(p).oper[0]^.ref^.base) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX,RS_ESI,RS_EDI]) then
  3603. AllocRegBetween(taicpu(p).oper[0]^.ref^.base,p,hp2,usedregs);
  3604. if (taicpu(p).oper[0]^.ref^.index <> NR_NO) and
  3605. (getsupreg(taicpu(p).oper[0]^.ref^.index) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX,RS_ESI,RS_EDI]) then
  3606. AllocRegBetween(taicpu(p).oper[0]^.ref^.index,p,hp2,usedregs);
  3607. end
  3608. else if (taicpu(hp1).Oper[0]^.reg <> taicpu(hp2).Oper[1]^.reg) then
  3609. begin
  3610. taicpu(hp2).loadReg(0,taicpu(hp1).Oper[0]^.reg);
  3611. AllocRegBetween(taicpu(p).oper[1]^.reg,p,hp2,usedregs);
  3612. end
  3613. else
  3614. begin
  3615. RemoveInstruction(hp2);
  3616. end
  3617. {$endif i386}
  3618. ;
  3619. end;
  3620. end
  3621. { movl [mem1],reg1
  3622. movl [mem1],reg2
  3623. to
  3624. movl [mem1],reg1
  3625. movl reg1,reg2
  3626. }
  3627. else if MatchOpType(taicpu(p),top_ref,top_reg) and
  3628. MatchOpType(taicpu(hp1),top_ref,top_reg) and
  3629. (taicpu(p).opsize = taicpu(hp1).opsize) and
  3630. RefsEqual(taicpu(p).oper[0]^.ref^,taicpu(hp1).oper[0]^.ref^) and
  3631. (taicpu(p).oper[0]^.ref^.volatility=[]) and
  3632. (taicpu(hp1).oper[0]^.ref^.volatility=[]) and
  3633. not(SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.ref^.base)) and
  3634. not(SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.ref^.index)) then
  3635. begin
  3636. DebugMsg(SPeepholeOptimization + 'MovMov2MovMov 2',p);
  3637. taicpu(hp1).loadReg(0,taicpu(p).oper[1]^.reg);
  3638. end;
  3639. { movl const1,[mem1]
  3640. movl [mem1],reg1
  3641. to
  3642. movl const1,reg1
  3643. movl reg1,[mem1]
  3644. }
  3645. if MatchOpType(Taicpu(p),top_const,top_ref) and
  3646. MatchOpType(Taicpu(hp1),top_ref,top_reg) and
  3647. (taicpu(p).opsize = taicpu(hp1).opsize) and
  3648. RefsEqual(taicpu(hp1).oper[0]^.ref^,taicpu(p).oper[1]^.ref^) and
  3649. not(RegInRef(taicpu(hp1).oper[1]^.reg,taicpu(hp1).oper[0]^.ref^)) then
  3650. begin
  3651. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,usedregs);
  3652. taicpu(hp1).loadReg(0,taicpu(hp1).oper[1]^.reg);
  3653. taicpu(hp1).loadRef(1,taicpu(p).oper[1]^.ref^);
  3654. taicpu(p).loadReg(1,taicpu(hp1).oper[0]^.reg);
  3655. taicpu(hp1).fileinfo := taicpu(p).fileinfo;
  3656. DebugMsg(SPeepholeOptimization + 'MovMov2MovMov 1',p);
  3657. Result:=true;
  3658. exit;
  3659. end;
  3660. { mov x,reg1; mov y,reg1 -> mov y,reg1 is handled by the Mov2Nop 5 optimisation }
  3661. { Change:
  3662. movl %reg1,%reg2
  3663. movl x(%reg1),%reg1 (If something other than %reg1 is written to, DeepMOVOpt would have caught it)
  3664. movl x(%reg2),%regX (%regX can be %reg2 or something else)
  3665. To:
  3666. movl %reg1,%reg2 (if %regX = %reg2, then remove this instruction)
  3667. movl x(%reg1),%reg1
  3668. movl %reg1,%regX
  3669. }
  3670. if MatchOpType(taicpu(p), top_reg, top_reg) then
  3671. begin
  3672. p_SourceReg := taicpu(p).oper[0]^.reg;
  3673. { Remember that p_TargetReg contains taicpu(p).oper[1]^.reg }
  3674. if (taicpu(hp1).oper[0]^.typ = top_ref) { The other operand will be a register } and
  3675. (taicpu(hp1).oper[1]^.reg = p_SourceReg) and
  3676. RegInRef(p_SourceReg, taicpu(hp1).oper[0]^.ref^) and
  3677. GetNextInstruction(hp1, hp2) and
  3678. MatchInstruction(hp2, A_MOV, [taicpu(p).opsize]) and
  3679. (taicpu(hp2).oper[0]^.typ = top_ref) { The other operand will be a register } then
  3680. begin
  3681. SourceRef := taicpu(hp2).oper[0]^.ref^;
  3682. if RegInRef(p_TargetReg, SourceRef) and
  3683. { If %reg1 also appears in the second reference, then it will
  3684. not refer to the same memory block as the first reference }
  3685. not RegInRef(p_SourceReg, SourceRef) then
  3686. begin
  3687. { Check to see if the references match if %reg2 is changed to %reg1 }
  3688. if SourceRef.base = p_TargetReg then
  3689. SourceRef.base := p_SourceReg;
  3690. if SourceRef.index = p_TargetReg then
  3691. SourceRef.index := p_SourceReg;
  3692. { RefsEqual also checks to ensure both references are non-volatile }
  3693. if RefsEqual(taicpu(hp1).oper[0]^.ref^, SourceRef) then
  3694. begin
  3695. taicpu(hp2).loadreg(0, p_SourceReg);
  3696. DebugMsg(SPeepholeOptimization + 'Optimised register duplication and memory read (MovMovMov2MovMovMov)', p);
  3697. Result := True;
  3698. if taicpu(hp2).oper[1]^.reg = p_TargetReg then
  3699. begin
  3700. DebugMsg(SPeepholeOptimization + 'Mov2Nop 5a done', p);
  3701. RemoveCurrentP(p, hp1);
  3702. Exit;
  3703. end
  3704. else
  3705. begin
  3706. { Check to see if %reg2 is no longer in use }
  3707. TransferUsedRegs(TmpUsedRegs);
  3708. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3709. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  3710. if not RegUsedAfterInstruction(p_TargetReg, hp2, TmpUsedRegs) then
  3711. begin
  3712. DebugMsg(SPeepholeOptimization + 'Mov2Nop 5b done', p);
  3713. RemoveCurrentP(p, hp1);
  3714. Exit;
  3715. end;
  3716. end;
  3717. { If we reach this point, p and hp1 weren't actually modified,
  3718. so we can do a bit more work on this pass }
  3719. end;
  3720. end;
  3721. end;
  3722. end;
  3723. end;
  3724. { search further than the next instruction for a mov (as long as it's not a jump) }
  3725. if not is_calljmpuncondret(taicpu(hp1).opcode) and
  3726. { check as much as possible before the expensive GetNextInstructionUsingRegCond call }
  3727. (taicpu(p).oper[1]^.typ = top_reg) and
  3728. (taicpu(p).oper[0]^.typ in [top_reg,top_const]) and
  3729. not RegModifiedByInstruction(taicpu(p).oper[1]^.reg, hp1) then
  3730. begin
  3731. { we work with hp2 here, so hp1 can be still used later on when
  3732. checking for GetNextInstruction_p }
  3733. hp3 := hp1;
  3734. { Initialise CrossJump (if it becomes True at any point, it will remain True) }
  3735. CrossJump := (taicpu(hp1).opcode = A_Jcc);
  3736. { Remember that p_TargetReg contains taicpu(p).oper[1]^.reg }
  3737. TransferUsedRegs(TmpUsedRegs);
  3738. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  3739. if NotFirstIteration then
  3740. JumpTracking := TLinkedList.Create
  3741. else
  3742. JumpTracking := nil;
  3743. while GetNextInstructionUsingRegCond(hp3,hp2,p_TargetReg,JumpTracking,CrossJump) and
  3744. { GetNextInstructionUsingRegCond only searches one instruction ahead unless -O3 is specified }
  3745. (hp2.typ=ait_instruction) do
  3746. begin
  3747. case taicpu(hp2).opcode of
  3748. A_POP:
  3749. if MatchOperand(taicpu(hp2).oper[0]^,p_TargetReg) then
  3750. begin
  3751. if not CrossJump and
  3752. not RegUsedBetween(p_TargetReg, p, hp2) then
  3753. begin
  3754. { We can remove the original MOV since the register
  3755. wasn't used between it and its popping from the stack }
  3756. DebugMsg(SPeepholeOptimization + 'Mov2Nop 3c done',p);
  3757. RemoveCurrentp(p, hp1);
  3758. Result := True;
  3759. JumpTracking.Free;
  3760. Exit;
  3761. end;
  3762. { Can't go any further }
  3763. Break;
  3764. end;
  3765. A_MOV:
  3766. if MatchOperand(taicpu(hp2).oper[0]^,p_TargetReg) and
  3767. ((taicpu(p).oper[0]^.typ=top_const) or
  3768. ((taicpu(p).oper[0]^.typ=top_reg) and
  3769. not(RegModifiedBetween(taicpu(p).oper[0]^.reg, p, hp2))
  3770. )
  3771. ) then
  3772. begin
  3773. { we have
  3774. mov x, %treg
  3775. mov %treg, y
  3776. }
  3777. { We don't need to call UpdateUsedRegs for every instruction between
  3778. p and hp2 because the register we're concerned about will not
  3779. become deallocated (otherwise GetNextInstructionUsingReg would
  3780. have stopped at an earlier instruction). [Kit] }
  3781. TempRegUsed :=
  3782. CrossJump { Assume the register is in use if it crossed a conditional jump } or
  3783. RegReadByInstruction(p_TargetReg, hp3) or
  3784. RegUsedAfterInstruction(p_TargetReg, hp2, TmpUsedRegs);
  3785. case taicpu(p).oper[0]^.typ Of
  3786. top_reg:
  3787. begin
  3788. { change
  3789. mov %reg, %treg
  3790. mov %treg, y
  3791. to
  3792. mov %reg, y
  3793. }
  3794. p_SourceReg := taicpu(p).oper[0]^.reg; { Saves on a handful of pointer dereferences }
  3795. RegName1 := debug_regname(taicpu(hp2).oper[0]^.reg);
  3796. if MatchOperand(taicpu(hp2).oper[1]^, p_SourceReg) then
  3797. begin
  3798. { %reg = y - remove hp2 completely (doing it here instead of relying on
  3799. the "mov %reg,%reg" optimisation might cut down on a pass iteration) }
  3800. if TempRegUsed then
  3801. begin
  3802. DebugMsg(SPeepholeOptimization + debug_regname(p_SourceReg) + ' = ' + RegName1 + '; removed unnecessary instruction (MovMov2MovNop 6b}',hp2);
  3803. AllocRegBetween(p_SourceReg, p, hp2, UsedRegs);
  3804. { Set the start of the next GetNextInstructionUsingRegCond search
  3805. to start at the entry right before hp2 (which is about to be removed) }
  3806. hp3 := tai(hp2.Previous);
  3807. RemoveInstruction(hp2);
  3808. { See if there's more we can optimise }
  3809. Continue;
  3810. end
  3811. else
  3812. begin
  3813. RemoveInstruction(hp2);
  3814. { We can remove the original MOV too }
  3815. DebugMsg(SPeepholeOptimization + 'MovMov2NopNop 6b done',p);
  3816. RemoveCurrentP(p, hp1);
  3817. Result:=true;
  3818. JumpTracking.Free;
  3819. Exit;
  3820. end;
  3821. end
  3822. else
  3823. begin
  3824. AllocRegBetween(p_SourceReg, p, hp2, UsedRegs);
  3825. taicpu(hp2).loadReg(0, p_SourceReg);
  3826. DebugMsg(SPeepholeOptimization + RegName1 + ' = ' + debug_regname(p_SourceReg) + '; changed to minimise pipeline stall (MovMov2Mov 6a}',hp2);
  3827. { Check to see if the register also appears in the reference }
  3828. if (taicpu(hp2).oper[1]^.typ = top_ref) then
  3829. ReplaceRegisterInRef(taicpu(hp2).oper[1]^.ref^, p_TargetReg, p_SourceReg);
  3830. { Don't remove the first instruction if the temporary register is in use }
  3831. if not TempRegUsed and
  3832. { ReplaceRegisterInRef won't actually replace the register if it's a different size }
  3833. not RegInOp(p_TargetReg, taicpu(hp2).oper[1]^) then
  3834. begin
  3835. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 6 done',p);
  3836. RemoveCurrentP(p, hp1);
  3837. Result:=true;
  3838. JumpTracking.Free;
  3839. Exit;
  3840. end;
  3841. { No need to set Result to True here. If there's another instruction later
  3842. on that can be optimised, it will be detected when the main Pass 1 loop
  3843. reaches what is now hp2 and passes it through OptPass1MOV. [Kit] }
  3844. end;
  3845. end;
  3846. top_const:
  3847. if not (cs_opt_size in current_settings.optimizerswitches) or (taicpu(hp2).opsize = S_B) then
  3848. begin
  3849. { change
  3850. mov const, %treg
  3851. mov %treg, y
  3852. to
  3853. mov const, y
  3854. }
  3855. if (taicpu(hp2).oper[1]^.typ=top_reg) or
  3856. ((taicpu(p).oper[0]^.val>=low(longint)) and (taicpu(p).oper[0]^.val<=high(longint))) then
  3857. begin
  3858. RegName1 := debug_regname(taicpu(hp2).oper[0]^.reg);
  3859. taicpu(hp2).loadOper(0,taicpu(p).oper[0]^);
  3860. if TempRegUsed then
  3861. begin
  3862. { Don't remove the first instruction if the temporary register is in use }
  3863. DebugMsg(SPeepholeOptimization + RegName1 + ' = ' + debug_tostr(taicpu(p).oper[0]^.val) + '; changed to minimise pipeline stall (MovMov2Mov 7a)',hp2);
  3864. { No need to set Result to True. If there's another instruction later on
  3865. that can be optimised, it will be detected when the main Pass 1 loop
  3866. reaches what is now hp2 and passes it through OptPass1MOV. [Kit] };
  3867. end
  3868. else
  3869. begin
  3870. DebugMsg(SPeepholeOptimization + 'MovMov2Mov 7 done',p);
  3871. RemoveCurrentP(p, hp1);
  3872. Result:=true;
  3873. Exit;
  3874. end;
  3875. end;
  3876. end;
  3877. else
  3878. Internalerror(2019103001);
  3879. end;
  3880. end
  3881. else
  3882. if MatchOperand(taicpu(hp2).oper[1]^, p_TargetReg) then
  3883. begin
  3884. if not CrossJump and
  3885. not RegUsedBetween(p_TargetReg, p, hp2) and
  3886. not RegReadByInstruction(p_TargetReg, hp2) then
  3887. begin
  3888. { Register is not used before it is overwritten }
  3889. DebugMsg(SPeepholeOptimization + 'Mov2Nop 3a done',p);
  3890. RemoveCurrentp(p, hp1);
  3891. Result := True;
  3892. Exit;
  3893. end;
  3894. if (taicpu(p).oper[0]^.typ = top_const) and
  3895. (taicpu(hp2).oper[0]^.typ = top_const) then
  3896. begin
  3897. if taicpu(p).oper[0]^.val = taicpu(hp2).oper[0]^.val then
  3898. begin
  3899. { Same value - register hasn't changed }
  3900. DebugMsg(SPeepholeOptimization + 'Mov2Nop 2 done', hp2);
  3901. RemoveInstruction(hp2);
  3902. Result := True;
  3903. { See if there's more we can optimise }
  3904. Continue;
  3905. end;
  3906. end;
  3907. end;
  3908. A_MOVZX, A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  3909. if MatchOpType(taicpu(hp2), top_reg, top_reg) and
  3910. MatchOperand(taicpu(hp2).oper[0]^, p_TargetReg) and
  3911. SuperRegistersEqual(taicpu(hp2).oper[1]^.reg, p_TargetReg) then
  3912. begin
  3913. {
  3914. Change from:
  3915. mov ###, %reg
  3916. ...
  3917. movs/z %reg,%reg (Same register, just different sizes)
  3918. To:
  3919. movs/z ###, %reg (Longer version)
  3920. ...
  3921. (remove)
  3922. }
  3923. DebugMsg(SPeepholeOptimization + 'MovMovs/z2Mov/s/z done', p);
  3924. taicpu(p).oper[1]^.reg := taicpu(hp2).oper[1]^.reg;
  3925. { Keep the first instruction as mov if ### is a constant }
  3926. if taicpu(p).oper[0]^.typ = top_const then
  3927. taicpu(p).opsize := reg2opsize(taicpu(hp2).oper[1]^.reg)
  3928. else
  3929. begin
  3930. taicpu(p).opcode := taicpu(hp2).opcode;
  3931. taicpu(p).opsize := taicpu(hp2).opsize;
  3932. end;
  3933. DebugMsg(SPeepholeOptimization + 'Removed movs/z instruction and extended earlier write (MovMovs/z2Mov/s/z)', hp2);
  3934. AllocRegBetween(taicpu(hp2).oper[1]^.reg, p, hp2, UsedRegs);
  3935. RemoveInstruction(hp2);
  3936. Result := True;
  3937. JumpTracking.Free;
  3938. Exit;
  3939. end;
  3940. else
  3941. { Move down to the MatchOpType if-block below };
  3942. end;
  3943. { Also catches MOV/S/Z instructions that aren't modified }
  3944. if taicpu(p).oper[0]^.typ = top_reg then
  3945. begin
  3946. p_SourceReg := taicpu(p).oper[0]^.reg;
  3947. if
  3948. not RegModifiedByInstruction(p_SourceReg, hp3) and
  3949. not RegModifiedBetween(p_SourceReg, hp3, hp2) and
  3950. DeepMOVOpt(taicpu(p), taicpu(hp2)) then
  3951. begin
  3952. Result := True;
  3953. { Just in case something didn't get modified (e.g. an
  3954. implicit register). Also, if it does read from this
  3955. register, then there's no longer an advantage to
  3956. changing the register on subsequent instructions.}
  3957. if not RegReadByInstruction(p_TargetReg, hp2) then
  3958. begin
  3959. { If a conditional jump was crossed, do not delete
  3960. the original MOV no matter what }
  3961. if not CrossJump and
  3962. { RegEndOfLife returns True if the register is
  3963. deallocated before the next instruction or has
  3964. been loaded with a new value }
  3965. RegEndOfLife(p_TargetReg, taicpu(hp2)) then
  3966. begin
  3967. { We can remove the original MOV }
  3968. DebugMsg(SPeepholeOptimization + 'Mov2Nop 3b done',p);
  3969. RemoveCurrentp(p, hp1);
  3970. JumpTracking.Free;
  3971. Result := True;
  3972. Exit;
  3973. end;
  3974. if not RegModifiedByInstruction(p_TargetReg, hp2) then
  3975. begin
  3976. { See if there's more we can optimise }
  3977. hp3 := hp2;
  3978. Continue;
  3979. end;
  3980. end;
  3981. end;
  3982. end;
  3983. { Break out of the while loop under normal circumstances }
  3984. Break;
  3985. end;
  3986. JumpTracking.Free;
  3987. end;
  3988. if (aoc_MovAnd2Mov_3 in OptsToCheck) and
  3989. (taicpu(p).oper[1]^.typ = top_reg) and
  3990. (taicpu(p).opsize = S_L) and
  3991. GetNextInstructionUsingRegTrackingUse(p,hp2,taicpu(p).oper[1]^.reg) and
  3992. (hp2.typ = ait_instruction) and
  3993. (taicpu(hp2).opcode = A_AND) and
  3994. (MatchOpType(taicpu(hp2),top_const,top_reg) or
  3995. (MatchOpType(taicpu(hp2),top_reg,top_reg) and
  3996. MatchOperand(taicpu(hp2).oper[0]^,taicpu(hp2).oper[1]^))
  3997. ) then
  3998. begin
  3999. if SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp2).oper[1]^.reg) then
  4000. begin
  4001. if ((taicpu(hp2).oper[0]^.typ=top_const) and (taicpu(hp2).oper[0]^.val = $ffffffff)) or
  4002. ((taicpu(hp2).oper[0]^.typ=top_reg) and (taicpu(hp2).opsize=S_L)) then
  4003. begin
  4004. { Optimize out:
  4005. mov x, %reg
  4006. and ffffffffh, %reg
  4007. }
  4008. DebugMsg(SPeepholeOptimization + 'MovAnd2Mov 3 done',p);
  4009. RemoveInstruction(hp2);
  4010. Result:=true;
  4011. exit;
  4012. end;
  4013. end;
  4014. end;
  4015. { leave out the mov from "mov reg, x(%frame_pointer); leave/ret" (with
  4016. x >= RetOffset) as it doesn't do anything (it writes either to a
  4017. parameter or to the temporary storage room for the function
  4018. result)
  4019. }
  4020. if IsExitCode(hp1) and
  4021. (taicpu(p).oper[1]^.typ = top_ref) and
  4022. (taicpu(p).oper[1]^.ref^.index = NR_NO) and
  4023. (
  4024. (
  4025. (taicpu(p).oper[1]^.ref^.base = current_procinfo.FramePointer) and
  4026. not (
  4027. assigned(current_procinfo.procdef.funcretsym) and
  4028. (taicpu(p).oper[1]^.ref^.offset <= tabstractnormalvarsym(current_procinfo.procdef.funcretsym).localloc.reference.offset)
  4029. )
  4030. ) or
  4031. { Also discard writes to the stack that are below the base pointer,
  4032. as this is temporary storage rather than a function result on the
  4033. stack, say. }
  4034. (
  4035. (taicpu(p).oper[1]^.ref^.base = NR_STACK_POINTER_REG) and
  4036. (taicpu(p).oper[1]^.ref^.offset < current_procinfo.final_localsize)
  4037. )
  4038. ) then
  4039. begin
  4040. RemoveCurrentp(p, hp1);
  4041. DebugMsg(SPeepholeOptimization + 'removed deadstore before leave/ret',p);
  4042. RemoveLastDeallocForFuncRes(p);
  4043. Result:=true;
  4044. exit;
  4045. end;
  4046. if MatchInstruction(hp1,A_CMP,A_TEST,[taicpu(p).opsize]) then
  4047. begin
  4048. if MatchOpType(taicpu(p),top_reg,top_ref) and
  4049. (taicpu(hp1).oper[1]^.typ = top_ref) and
  4050. RefsEqual(taicpu(p).oper[1]^.ref^, taicpu(hp1).oper[1]^.ref^) then
  4051. begin
  4052. { change
  4053. mov reg1, mem1
  4054. test/cmp x, mem1
  4055. to
  4056. mov reg1, mem1
  4057. test/cmp x, reg1
  4058. }
  4059. taicpu(hp1).loadreg(1,taicpu(p).oper[0]^.reg);
  4060. DebugMsg(SPeepholeOptimization + 'MovTestCmp2MovTestCmp 1',hp1);
  4061. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,usedregs);
  4062. Result := True;
  4063. Exit;
  4064. end;
  4065. if DoMovCmpMemOpt(p, hp1, True) then
  4066. begin
  4067. Result := True;
  4068. Exit;
  4069. end;
  4070. end;
  4071. if MatchInstruction(hp1,A_LEA,[S_L{$ifdef x86_64},S_Q{$endif x86_64}]) and
  4072. { If the flags register is in use, don't change the instruction to an
  4073. ADD otherwise this will scramble the flags. [Kit] }
  4074. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  4075. begin
  4076. if MatchOpType(Taicpu(p),top_ref,top_reg) and
  4077. ((MatchReference(Taicpu(hp1).oper[0]^.ref^,Taicpu(hp1).oper[1]^.reg,Taicpu(p).oper[1]^.reg) and
  4078. (Taicpu(hp1).oper[0]^.ref^.base<>Taicpu(p).oper[1]^.reg)
  4079. ) or
  4080. (MatchReference(Taicpu(hp1).oper[0]^.ref^,Taicpu(p).oper[1]^.reg,Taicpu(hp1).oper[1]^.reg) and
  4081. (Taicpu(hp1).oper[0]^.ref^.index<>Taicpu(p).oper[1]^.reg)
  4082. )
  4083. ) then
  4084. { mov reg1,ref
  4085. lea reg2,[reg1,reg2]
  4086. to
  4087. add reg2,ref}
  4088. begin
  4089. TransferUsedRegs(TmpUsedRegs);
  4090. { reg1 may not be used afterwards }
  4091. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs)) then
  4092. begin
  4093. Taicpu(hp1).opcode:=A_ADD;
  4094. Taicpu(hp1).oper[0]^.ref^:=Taicpu(p).oper[0]^.ref^;
  4095. DebugMsg(SPeepholeOptimization + 'MovLea2Add done',hp1);
  4096. RemoveCurrentp(p, hp1);
  4097. result:=true;
  4098. exit;
  4099. end;
  4100. end;
  4101. { If the LEA instruction can be converted into an arithmetic instruction,
  4102. it may be possible to then fold it in the next optimisation, otherwise
  4103. there's nothing more that can be optimised here. }
  4104. if not ConvertLEA(taicpu(hp1)) then
  4105. Exit;
  4106. end;
  4107. if (taicpu(p).oper[1]^.typ = top_reg) and
  4108. (hp1.typ = ait_instruction) and
  4109. GetNextInstruction(hp1, hp2) and
  4110. MatchInstruction(hp2,A_MOV,[]) and
  4111. (SuperRegistersEqual(taicpu(hp2).oper[0]^.reg,taicpu(p).oper[1]^.reg)) and
  4112. (topsize2memsize[taicpu(hp1).opsize]>=topsize2memsize[taicpu(hp2).opsize]) and
  4113. (
  4114. IsFoldableArithOp(taicpu(hp1), taicpu(p).oper[1]^.reg)
  4115. {$ifdef x86_64}
  4116. or
  4117. (
  4118. (taicpu(p).opsize=S_L) and (taicpu(hp1).opsize=S_Q) and (taicpu(hp2).opsize=S_L) and
  4119. IsFoldableArithOp(taicpu(hp1), newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[1]^.reg),R_SUBQ))
  4120. )
  4121. {$endif x86_64}
  4122. ) then
  4123. begin
  4124. if OpsEqual(taicpu(hp2).oper[1]^, taicpu(p).oper[0]^) and
  4125. (taicpu(hp2).oper[0]^.typ=top_reg) then
  4126. { change movsX/movzX reg/ref, reg2
  4127. add/sub/or/... reg3/$const, reg2
  4128. mov reg2 reg/ref
  4129. dealloc reg2
  4130. to
  4131. add/sub/or/... reg3/$const, reg/ref }
  4132. begin
  4133. TransferUsedRegs(TmpUsedRegs);
  4134. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4135. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  4136. If not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs)) then
  4137. begin
  4138. { by example:
  4139. movswl %si,%eax movswl %si,%eax p
  4140. decl %eax addl %edx,%eax hp1
  4141. movw %ax,%si movw %ax,%si hp2
  4142. ->
  4143. movswl %si,%eax movswl %si,%eax p
  4144. decw %eax addw %edx,%eax hp1
  4145. movw %ax,%si movw %ax,%si hp2
  4146. }
  4147. DebugMsg(SPeepholeOptimization + 'MovOpMov2Op ('+
  4148. debug_op2str(taicpu(p).opcode)+debug_opsize2str(taicpu(p).opsize)+' '+
  4149. debug_op2str(taicpu(hp1).opcode)+debug_opsize2str(taicpu(hp1).opsize)+' '+
  4150. debug_op2str(taicpu(hp2).opcode)+debug_opsize2str(taicpu(hp2).opsize)+')',p);
  4151. taicpu(hp1).changeopsize(taicpu(hp2).opsize);
  4152. {
  4153. ->
  4154. movswl %si,%eax movswl %si,%eax p
  4155. decw %si addw %dx,%si hp1
  4156. movw %ax,%si movw %ax,%si hp2
  4157. }
  4158. case taicpu(hp1).ops of
  4159. 1:
  4160. begin
  4161. taicpu(hp1).loadoper(0, taicpu(hp2).oper[1]^);
  4162. if taicpu(hp1).oper[0]^.typ=top_reg then
  4163. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4164. end;
  4165. 2:
  4166. begin
  4167. taicpu(hp1).loadoper(1, taicpu(hp2).oper[1]^);
  4168. if (taicpu(hp1).oper[0]^.typ=top_reg) and
  4169. (taicpu(hp1).opcode<>A_SHL) and
  4170. (taicpu(hp1).opcode<>A_SHR) and
  4171. (taicpu(hp1).opcode<>A_SAR) then
  4172. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4173. end;
  4174. else
  4175. internalerror(2008042701);
  4176. end;
  4177. {
  4178. ->
  4179. decw %si addw %dx,%si p
  4180. }
  4181. RemoveInstruction(hp2);
  4182. RemoveCurrentP(p, hp1);
  4183. Result:=True;
  4184. Exit;
  4185. end;
  4186. end;
  4187. if MatchOpType(taicpu(hp2),top_reg,top_reg) and
  4188. not(SuperRegistersEqual(taicpu(hp1).oper[0]^.reg,taicpu(hp2).oper[1]^.reg)) and
  4189. ((topsize2memsize[taicpu(hp1).opsize]<= topsize2memsize[taicpu(hp2).opsize]) or
  4190. { opsize matters for these opcodes, we could probably work around this, but it is not worth the effort }
  4191. ((taicpu(hp1).opcode<>A_SHL) and (taicpu(hp1).opcode<>A_SHR) and (taicpu(hp1).opcode<>A_SAR))
  4192. )
  4193. {$ifdef i386}
  4194. { byte registers of esi, edi, ebp, esp are not available on i386 }
  4195. and ((taicpu(hp2).opsize<>S_B) or not(getsupreg(taicpu(hp1).oper[0]^.reg) in [RS_ESI,RS_EDI,RS_EBP,RS_ESP]))
  4196. and ((taicpu(hp2).opsize<>S_B) or not(getsupreg(taicpu(p).oper[0]^.reg) in [RS_ESI,RS_EDI,RS_EBP,RS_ESP]))
  4197. {$endif i386}
  4198. then
  4199. { change movsX/movzX reg/ref, reg2
  4200. add/sub/or/... regX/$const, reg2
  4201. mov reg2, reg3
  4202. dealloc reg2
  4203. to
  4204. movsX/movzX reg/ref, reg3
  4205. add/sub/or/... reg3/$const, reg3
  4206. }
  4207. begin
  4208. TransferUsedRegs(TmpUsedRegs);
  4209. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4210. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  4211. If not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs)) then
  4212. begin
  4213. { by example:
  4214. movswl %si,%eax movswl %si,%eax p
  4215. decl %eax addl %edx,%eax hp1
  4216. movw %ax,%si movw %ax,%si hp2
  4217. ->
  4218. movswl %si,%eax movswl %si,%eax p
  4219. decw %eax addw %edx,%eax hp1
  4220. movw %ax,%si movw %ax,%si hp2
  4221. }
  4222. DebugMsg(SPeepholeOptimization + 'MovOpMov2MovOp ('+
  4223. debug_op2str(taicpu(p).opcode)+debug_opsize2str(taicpu(p).opsize)+' '+
  4224. debug_op2str(taicpu(hp1).opcode)+debug_opsize2str(taicpu(hp1).opsize)+' '+
  4225. debug_op2str(taicpu(hp2).opcode)+debug_opsize2str(taicpu(hp2).opsize)+')',p);
  4226. { limit size of constants as well to avoid assembler errors, but
  4227. check opsize to avoid overflow when left shifting the 1 }
  4228. if (taicpu(p).oper[0]^.typ=top_const) and (topsize2memsize[taicpu(hp2).opsize]<=63) then
  4229. taicpu(p).oper[0]^.val:=taicpu(p).oper[0]^.val and ((qword(1) shl topsize2memsize[taicpu(hp2).opsize])-1);
  4230. {$ifdef x86_64}
  4231. { Be careful of, for example:
  4232. movl %reg1,%reg2
  4233. addl %reg3,%reg2
  4234. movq %reg2,%reg4
  4235. This will cause problems if the upper 32-bits of %reg3 or %reg4 are non-zero
  4236. }
  4237. if (taicpu(hp1).opsize = S_L) and (taicpu(hp2).opsize = S_Q) then
  4238. begin
  4239. taicpu(hp2).changeopsize(S_L);
  4240. setsubreg(taicpu(hp2).oper[0]^.reg, R_SUBD);
  4241. setsubreg(taicpu(hp2).oper[1]^.reg, R_SUBD);
  4242. end;
  4243. {$endif x86_64}
  4244. taicpu(hp1).changeopsize(taicpu(hp2).opsize);
  4245. taicpu(p).changeopsize(taicpu(hp2).opsize);
  4246. if taicpu(p).oper[0]^.typ=top_reg then
  4247. setsubreg(taicpu(p).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4248. taicpu(p).loadoper(1, taicpu(hp2).oper[1]^);
  4249. AllocRegBetween(taicpu(p).oper[1]^.reg,p,hp1,usedregs);
  4250. {
  4251. ->
  4252. movswl %si,%eax movswl %si,%eax p
  4253. decw %si addw %dx,%si hp1
  4254. movw %ax,%si movw %ax,%si hp2
  4255. }
  4256. case taicpu(hp1).ops of
  4257. 1:
  4258. begin
  4259. taicpu(hp1).loadoper(0, taicpu(hp2).oper[1]^);
  4260. if taicpu(hp1).oper[0]^.typ=top_reg then
  4261. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4262. end;
  4263. 2:
  4264. begin
  4265. taicpu(hp1).loadoper(1, taicpu(hp2).oper[1]^);
  4266. if (taicpu(hp1).oper[0]^.typ=top_reg) and
  4267. (taicpu(hp1).opcode<>A_SHL) and
  4268. (taicpu(hp1).opcode<>A_SHR) and
  4269. (taicpu(hp1).opcode<>A_SAR) then
  4270. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  4271. end;
  4272. else
  4273. internalerror(2018111801);
  4274. end;
  4275. {
  4276. ->
  4277. decw %si addw %dx,%si p
  4278. }
  4279. RemoveInstruction(hp2);
  4280. end;
  4281. end;
  4282. end;
  4283. if MatchInstruction(hp1,A_BTS,A_BTR,[Taicpu(p).opsize]) and
  4284. GetNextInstruction(hp1, hp2) and
  4285. MatchInstruction(hp2,A_OR,[Taicpu(p).opsize]) and
  4286. MatchOperand(Taicpu(p).oper[0]^,0) and
  4287. (Taicpu(p).oper[1]^.typ = top_reg) and
  4288. MatchOperand(Taicpu(p).oper[1]^,Taicpu(hp1).oper[1]^) and
  4289. MatchOperand(Taicpu(p).oper[1]^,Taicpu(hp2).oper[1]^) then
  4290. { mov reg1,0
  4291. bts reg1,operand1 --> mov reg1,operand2
  4292. or reg1,operand2 bts reg1,operand1}
  4293. begin
  4294. Taicpu(hp2).opcode:=A_MOV;
  4295. DebugMsg(SPeepholeOptimization + 'MovBtsOr2MovBts done',hp1);
  4296. asml.remove(hp1);
  4297. insertllitem(hp2,hp2.next,hp1);
  4298. RemoveCurrentp(p, hp1);
  4299. Result:=true;
  4300. exit;
  4301. end;
  4302. if MatchInstruction(hp1,A_SUB,[Taicpu(p).opsize]) and
  4303. MatchOperand(Taicpu(p).oper[1]^,Taicpu(hp1).oper[1]^) and
  4304. GetNextInstruction(hp1, hp2) and
  4305. MatchInstruction(hp2,A_CMP,[Taicpu(p).opsize]) and
  4306. MatchOperand(Taicpu(p).oper[0]^,Taicpu(hp2).oper[1]^) and
  4307. MatchOperand(Taicpu(hp1).oper[0]^,Taicpu(hp2).oper[0]^) then
  4308. { change
  4309. mov reg1,reg2
  4310. sub reg3,reg2
  4311. cmp reg3,reg1
  4312. into
  4313. mov reg1,reg2
  4314. sub reg3,reg2
  4315. }
  4316. begin
  4317. DebugMsg(SPeepholeOptimization + 'MovSubCmp2MovSub done',p);
  4318. RemoveInstruction(hp2);
  4319. Result:=true;
  4320. exit;
  4321. end;
  4322. {
  4323. mov ref,reg0
  4324. <op> reg0,reg1
  4325. dealloc reg0
  4326. to
  4327. <op> ref,reg1
  4328. }
  4329. if MatchOpType(taicpu(p),top_ref,top_reg) and
  4330. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  4331. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  4332. MatchInstruction(hp1,[A_AND,A_OR,A_XOR,A_ADD,A_SUB,A_CMP],[Taicpu(p).opsize]) and
  4333. not(MatchOperand(taicpu(hp1).oper[0]^,taicpu(hp1).oper[1]^)) and
  4334. RegEndOfLife(taicpu(p).oper[1]^.reg,taicpu(hp1)) then
  4335. begin
  4336. taicpu(hp1).loadoper(0,taicpu(p).oper[0]^);
  4337. DebugMsg(SPeepholeOptimization + 'MovOp2Op done',hp1);
  4338. RemoveCurrentp(p, hp1);
  4339. Result:=true;
  4340. exit;
  4341. end;
  4342. if (taicpu(p).oper[0]^.typ = top_ref) and { Second operand will be a register }
  4343. MatchInstruction(hp1, A_SHR, A_SAR, [taicpu(p).opsize]) and
  4344. MatchOpType(taicpu(hp1), top_const, top_reg) and
  4345. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  4346. begin
  4347. RegName1 := debug_regname(taicpu(hp1).oper[1]^.reg);
  4348. {$ifdef x86_64}
  4349. { Convert:
  4350. movq x(ref),%reg64
  4351. shrq y,%reg64
  4352. To:
  4353. movl x+4(ref),%reg32
  4354. shrl y-32,%reg32 (Remove if y = 32)
  4355. }
  4356. if (taicpu(p).opsize = S_Q) and
  4357. (taicpu(hp1).opcode = A_SHR) and
  4358. (taicpu(hp1).oper[0]^.val >= 32) then
  4359. begin
  4360. PreMessage := 'movq ' + debug_operstr(taicpu(p).oper[0]^) + ',' + RegName1 + '; ' +
  4361. 'shrq $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + RegName1 + ' -> movl ';
  4362. { Convert to 32-bit }
  4363. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  4364. taicpu(p).opsize := S_L;
  4365. Inc(taicpu(p).oper[0]^.ref^.offset, 4);
  4366. PreMessage := PreMessage + debug_operstr(taicpu(p).oper[0]^) + ',' + debug_regname(taicpu(p).oper[1]^.reg);
  4367. if (taicpu(hp1).oper[0]^.val = 32) then
  4368. begin
  4369. DebugMsg(SPeepholeOptimization + PreMessage + ' (MovShr2Mov)', p);
  4370. RemoveInstruction(hp1);
  4371. end
  4372. else
  4373. begin
  4374. { This will potentially open up more arithmetic operations since
  4375. the peephole optimizer now has a big hint that only the lower
  4376. 32 bits are currently in use (and opcodes are smaller in size) }
  4377. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  4378. taicpu(hp1).opsize := S_L;
  4379. Dec(taicpu(hp1).oper[0]^.val, 32);
  4380. DebugMsg(SPeepholeOptimization + PreMessage +
  4381. '; shrl $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + debug_regname(taicpu(hp1).oper[1]^.reg) + ' (MovShr2MovShr)', p);
  4382. end;
  4383. Result := True;
  4384. Exit;
  4385. end;
  4386. {$endif x86_64}
  4387. { Convert:
  4388. movl x(ref),%reg
  4389. shrl $24,%reg
  4390. To:
  4391. movzbl x+3(ref),%reg
  4392. Do similar things for movl; shrl $16 -> movzwl and movw; shrw $8 -> movzbw
  4393. Also accept sar instead of shr, but convert to movsx instead of movzx
  4394. }
  4395. if taicpu(hp1).opcode = A_SHR then
  4396. MovUnaligned := A_MOVZX
  4397. else
  4398. MovUnaligned := A_MOVSX;
  4399. NewSize := S_NO;
  4400. NewOffset := 0;
  4401. case taicpu(p).opsize of
  4402. S_B:
  4403. { No valid combinations };
  4404. S_W:
  4405. if (taicpu(hp1).oper[0]^.val = 8) then
  4406. begin
  4407. NewSize := S_BW;
  4408. NewOffset := 1;
  4409. end;
  4410. S_L:
  4411. case taicpu(hp1).oper[0]^.val of
  4412. 16:
  4413. begin
  4414. NewSize := S_WL;
  4415. NewOffset := 2;
  4416. end;
  4417. 24:
  4418. begin
  4419. NewSize := S_BL;
  4420. NewOffset := 3;
  4421. end;
  4422. else
  4423. ;
  4424. end;
  4425. {$ifdef x86_64}
  4426. S_Q:
  4427. case taicpu(hp1).oper[0]^.val of
  4428. 32:
  4429. begin
  4430. if taicpu(hp1).opcode = A_SAR then
  4431. begin
  4432. { 32-bit to 64-bit is a distinct instruction }
  4433. MovUnaligned := A_MOVSXD;
  4434. NewSize := S_LQ;
  4435. NewOffset := 4;
  4436. end
  4437. else
  4438. { Should have been handled by MovShr2Mov above }
  4439. InternalError(2022081811);
  4440. end;
  4441. 48:
  4442. begin
  4443. NewSize := S_WQ;
  4444. NewOffset := 6;
  4445. end;
  4446. 56:
  4447. begin
  4448. NewSize := S_BQ;
  4449. NewOffset := 7;
  4450. end;
  4451. else
  4452. ;
  4453. end;
  4454. {$endif x86_64}
  4455. else
  4456. InternalError(2022081810);
  4457. end;
  4458. if (NewSize <> S_NO) and
  4459. (taicpu(p).oper[0]^.ref^.offset <= $7FFFFFFF - NewOffset) then
  4460. begin
  4461. PreMessage := 'mov' + debug_opsize2str(taicpu(p).opsize) + ' ' + debug_operstr(taicpu(p).oper[0]^) + ',' + RegName1 + '; ' +
  4462. 'shr' + debug_opsize2str(taicpu(p).opsize) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + RegName1 + ' -> ' +
  4463. debug_op2str(MovUnaligned);
  4464. {$ifdef x86_64}
  4465. if MovUnaligned <> A_MOVSXD then
  4466. { Don't add size suffix for MOVSXD }
  4467. {$endif x86_64}
  4468. PreMessage := PreMessage + debug_opsize2str(NewSize);
  4469. Inc(taicpu(p).oper[0]^.ref^.offset, NewOffset);
  4470. taicpu(p).opcode := MovUnaligned;
  4471. taicpu(p).opsize := NewSize;
  4472. DebugMsg(SPeepholeOptimization + PreMessage + ' ' +
  4473. debug_operstr(taicpu(p).oper[0]^) + ',' + debug_regname(taicpu(hp1).oper[1]^.reg) + ' (MovShr/Sar2Movx)', p);
  4474. RemoveInstruction(hp1);
  4475. Result := True;
  4476. Exit;
  4477. end;
  4478. end;
  4479. { Backward optimisation shared with OptPass2MOV }
  4480. if FuncMov2Func(p, hp1) then
  4481. begin
  4482. Result := True;
  4483. Exit;
  4484. end;
  4485. end;
  4486. function TX86AsmOptimizer.OptPass1MOVXX(var p : tai) : boolean;
  4487. var
  4488. hp1 : tai;
  4489. begin
  4490. Result:=false;
  4491. if taicpu(p).ops <> 2 then
  4492. exit;
  4493. if (MatchOpType(taicpu(p),top_reg,top_reg) and GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg)) or
  4494. GetNextInstruction(p,hp1) then
  4495. begin
  4496. if MatchInstruction(hp1,taicpu(p).opcode,[taicpu(p).opsize]) and
  4497. (taicpu(hp1).ops = 2) then
  4498. begin
  4499. if (taicpu(hp1).oper[0]^.typ = taicpu(p).oper[1]^.typ) and
  4500. (taicpu(hp1).oper[1]^.typ = taicpu(p).oper[0]^.typ) then
  4501. { movXX reg1, mem1 or movXX mem1, reg1
  4502. movXX mem2, reg2 movXX reg2, mem2}
  4503. begin
  4504. if OpsEqual(taicpu(hp1).oper[1]^,taicpu(p).oper[0]^) then
  4505. { movXX reg1, mem1 or movXX mem1, reg1
  4506. movXX mem2, reg1 movXX reg2, mem1}
  4507. begin
  4508. if OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  4509. begin
  4510. { Removes the second statement from
  4511. movXX reg1, mem1/reg2
  4512. movXX mem1/reg2, reg1
  4513. }
  4514. if taicpu(p).oper[0]^.typ=top_reg then
  4515. AllocRegBetween(taicpu(p).oper[0]^.reg,p,hp1,usedregs);
  4516. { Removes the second statement from
  4517. movXX mem1/reg1, reg2
  4518. movXX reg2, mem1/reg1
  4519. }
  4520. if (taicpu(p).oper[1]^.typ=top_reg) and
  4521. not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,UsedRegs)) then
  4522. begin
  4523. DebugMsg(SPeepholeOptimization + 'MovXXMovXX2Nop 1 done',p);
  4524. RemoveInstruction(hp1);
  4525. RemoveCurrentp(p); { p will now be equal to the instruction that follows what was hp1 }
  4526. Result:=true;
  4527. exit;
  4528. end
  4529. else if (taicpu(hp1).oper[1]^.typ<>top_ref) or (not(vol_write in taicpu(hp1).oper[1]^.ref^.volatility)) and
  4530. (taicpu(hp1).oper[0]^.typ<>top_ref) or (not(vol_read in taicpu(hp1).oper[0]^.ref^.volatility)) then
  4531. begin
  4532. DebugMsg(SPeepholeOptimization + 'MovXXMovXX2MoVXX 1 done',p);
  4533. RemoveInstruction(hp1);
  4534. Result:=true;
  4535. exit;
  4536. end;
  4537. end
  4538. end;
  4539. end;
  4540. end;
  4541. end;
  4542. end;
  4543. function TX86AsmOptimizer.OptPass1OP(var p : tai) : boolean;
  4544. var
  4545. hp1 : tai;
  4546. begin
  4547. result:=false;
  4548. { replace
  4549. <Op>X %mreg1,%mreg2 // Op in [ADD,MUL]
  4550. MovX %mreg2,%mreg1
  4551. dealloc %mreg2
  4552. by
  4553. <Op>X %mreg2,%mreg1
  4554. ?
  4555. }
  4556. if GetNextInstruction(p,hp1) and
  4557. { we mix single and double opperations here because we assume that the compiler
  4558. generates vmovapd only after double operations and vmovaps only after single operations }
  4559. MatchInstruction(hp1,A_MOVAPD,A_MOVAPS,[S_NO]) and
  4560. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  4561. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[1]^) and
  4562. (taicpu(p).oper[0]^.typ=top_reg) then
  4563. begin
  4564. TransferUsedRegs(TmpUsedRegs);
  4565. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4566. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  4567. begin
  4568. taicpu(p).loadoper(0,taicpu(hp1).oper[0]^);
  4569. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  4570. DebugMsg(SPeepholeOptimization + 'OpMov2Op done',p);
  4571. RemoveInstruction(hp1);
  4572. result:=true;
  4573. end;
  4574. end;
  4575. end;
  4576. function TX86AsmOptimizer.OptPass1Test(var p: tai) : boolean;
  4577. var
  4578. hp1, p_label, p_dist, hp1_dist: tai;
  4579. JumpLabel, JumpLabel_dist: TAsmLabel;
  4580. FirstValue, SecondValue: TCGInt;
  4581. TempBool: Boolean;
  4582. begin
  4583. Result := False;
  4584. if (taicpu(p).oper[0]^.typ = top_const) and
  4585. (taicpu(p).oper[0]^.val <> -1) then
  4586. begin
  4587. { Convert unsigned maximum constants to -1 to aid optimisation }
  4588. case taicpu(p).opsize of
  4589. S_B:
  4590. if (taicpu(p).oper[0]^.val and $FF) = $FF then
  4591. begin
  4592. taicpu(p).oper[0]^.val := -1;
  4593. Result := True;
  4594. Exit;
  4595. end;
  4596. S_W:
  4597. if (taicpu(p).oper[0]^.val and $FFFF) = $FFFF then
  4598. begin
  4599. taicpu(p).oper[0]^.val := -1;
  4600. Result := True;
  4601. Exit;
  4602. end;
  4603. S_L:
  4604. if (taicpu(p).oper[0]^.val and $FFFFFFFF) = $FFFFFFFF then
  4605. begin
  4606. taicpu(p).oper[0]^.val := -1;
  4607. Result := True;
  4608. Exit;
  4609. end;
  4610. {$ifdef x86_64}
  4611. S_Q:
  4612. { Storing anything greater than $7FFFFFFF is not possible so do
  4613. nothing };
  4614. {$endif x86_64}
  4615. else
  4616. InternalError(2021121001);
  4617. end;
  4618. end;
  4619. if GetNextInstruction(p, hp1) and
  4620. TrySwapMovCmp(p, hp1) then
  4621. begin
  4622. Result := True;
  4623. Exit;
  4624. end;
  4625. if MatchInstruction(hp1, A_Jcc, []) then
  4626. begin
  4627. TempBool := True;
  4628. if DoJumpOptimizations(hp1, TempBool) or
  4629. not TempBool then
  4630. begin
  4631. Result := True;
  4632. if Assigned(hp1) then
  4633. begin
  4634. if (hp1.typ in [ait_align]) then
  4635. SkipAligns(hp1, hp1);
  4636. { CollapseZeroDistJump will be set to the label after the
  4637. jump if it optimises, whether or not it's live or dead }
  4638. if (hp1.typ in [ait_label]) and
  4639. not (tai_label(hp1).labsym.is_used) then
  4640. GetNextInstruction(hp1, hp1);
  4641. end;
  4642. TransferUsedRegs(TmpUsedRegs);
  4643. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  4644. if not Assigned(hp1) or
  4645. (
  4646. not MatchInstruction(hp1, A_Jcc, A_SETcc, A_CMOVcc, []) and
  4647. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)
  4648. ) then
  4649. begin
  4650. { No more conditional jumps; conditional statement is no longer required }
  4651. DebugMsg(SPeepholeOptimization + 'Removed unnecessary condition (Test2Nop)', p);
  4652. RemoveCurrentP(p);
  4653. end;
  4654. Exit;
  4655. end;
  4656. end;
  4657. { Search for:
  4658. test $x,(reg/ref)
  4659. jne @lbl1
  4660. test $y,(reg/ref) (same register or reference)
  4661. jne @lbl1
  4662. Change to:
  4663. test $(x or y),(reg/ref)
  4664. jne @lbl1
  4665. (Note, this doesn't work with je instead of jne)
  4666. Also catch cases where "cmp $0,(reg/ref)" and "test %reg,%reg" are used.
  4667. Also search for:
  4668. test $x,(reg/ref)
  4669. je @lbl1
  4670. test $y,(reg/ref)
  4671. je/jne @lbl2
  4672. If (x or y) = x, then the second jump is deterministic
  4673. }
  4674. if (
  4675. (
  4676. (taicpu(p).oper[0]^.typ = top_const) or
  4677. (
  4678. { test %reg,%reg can be considered equivalent to test, -1,%reg }
  4679. (taicpu(p).oper[0]^.typ = top_reg) and
  4680. MatchOperand(taicpu(p).oper[1]^, taicpu(p).oper[0]^.reg)
  4681. )
  4682. ) and
  4683. MatchInstruction(hp1, A_JCC, [])
  4684. ) then
  4685. begin
  4686. if (taicpu(p).oper[0]^.typ = top_reg) and
  4687. MatchOperand(taicpu(p).oper[1]^, taicpu(p).oper[0]^.reg) then
  4688. FirstValue := -1
  4689. else
  4690. FirstValue := taicpu(p).oper[0]^.val;
  4691. { If we have several test/jne's in a row, it might be the case that
  4692. the second label doesn't go to the same location, but the one
  4693. after it might (e.g. test; jne @lbl1; test; jne @lbl2; test @lbl1),
  4694. so accommodate for this with a while loop.
  4695. }
  4696. hp1_dist := hp1;
  4697. if GetNextInstruction(hp1, p_dist) and
  4698. (p_dist.typ = ait_instruction) and
  4699. (
  4700. (
  4701. (taicpu(p_dist).opcode = A_TEST) and
  4702. (
  4703. (taicpu(p_dist).oper[0]^.typ = top_const) or
  4704. { test %reg,%reg can be considered equivalent to test, -1,%reg }
  4705. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p_dist).oper[0]^)
  4706. )
  4707. ) or
  4708. (
  4709. { cmp 0,%reg = test %reg,%reg }
  4710. (taicpu(p_dist).opcode = A_CMP) and
  4711. MatchOperand(taicpu(p_dist).oper[0]^, 0)
  4712. )
  4713. ) and
  4714. { Make sure the destination operands are actually the same }
  4715. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p).oper[1]^) and
  4716. GetNextInstruction(p_dist, hp1_dist) and
  4717. MatchInstruction(hp1_dist, A_JCC, []) then
  4718. begin
  4719. if
  4720. (taicpu(p_dist).opcode = A_CMP) { constant will be zero } or
  4721. (
  4722. (taicpu(p_dist).oper[0]^.typ = top_reg) and
  4723. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p_dist).oper[0]^.reg)
  4724. ) then
  4725. SecondValue := -1
  4726. else
  4727. SecondValue := taicpu(p_dist).oper[0]^.val;
  4728. { If both of the TEST constants are identical, delete the second
  4729. TEST that is unnecessary. }
  4730. if (FirstValue = SecondValue) then
  4731. begin
  4732. DebugMsg(SPeepholeOptimization + 'TEST/Jcc/TEST; removed superfluous TEST', p_dist);
  4733. RemoveInstruction(p_dist);
  4734. { Don't let the flags register become deallocated and reallocated between the jumps }
  4735. AllocRegBetween(NR_DEFAULTFLAGS, hp1, hp1_dist, UsedRegs);
  4736. Result := True;
  4737. if condition_in(taicpu(hp1_dist).condition, taicpu(hp1).condition) then
  4738. begin
  4739. { Since the second jump's condition is a subset of the first, we
  4740. know it will never branch because the first jump dominates it.
  4741. Get it out of the way now rather than wait for the jump
  4742. optimisations for a speed boost. }
  4743. if IsJumpToLabel(taicpu(hp1_dist)) then
  4744. TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol).DecRefs;
  4745. DebugMsg(SPeepholeOptimization + 'Removed dominated jump (via TEST/Jcc/TEST)', hp1_dist);
  4746. RemoveInstruction(hp1_dist);
  4747. end
  4748. else if condition_in(inverse_cond(taicpu(hp1).condition), taicpu(hp1_dist).condition) then
  4749. begin
  4750. { If the inverse of the first condition is a subset of the second,
  4751. the second one will definitely branch if the first one doesn't }
  4752. DebugMsg(SPeepholeOptimization + 'Conditional jump will always branch (via TEST/Jcc/TEST)', hp1_dist);
  4753. MakeUnconditional(taicpu(hp1_dist));
  4754. RemoveDeadCodeAfterJump(hp1_dist);
  4755. end;
  4756. Exit;
  4757. end;
  4758. if (taicpu(hp1).condition in [C_NE, C_NZ]) and
  4759. (taicpu(hp1_dist).condition in [C_NE, C_NZ]) and
  4760. { If the first instruction is test %reg,%reg or test $-1,%reg,
  4761. then the second jump will never branch, so it can also be
  4762. removed regardless of where it goes }
  4763. (
  4764. (FirstValue = -1) or
  4765. (SecondValue = -1) or
  4766. MatchOperand(taicpu(hp1_dist).oper[0]^, taicpu(hp1).oper[0]^)
  4767. ) then
  4768. begin
  4769. { Same jump location... can be a register since nothing's changed }
  4770. { If any of the entries are equivalent to test %reg,%reg, then the
  4771. merged $(x or y) is also test %reg,%reg / test $-1,%reg }
  4772. taicpu(p).loadconst(0, FirstValue or SecondValue);
  4773. if IsJumpToLabel(taicpu(hp1_dist)) then
  4774. TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol).DecRefs;
  4775. DebugMsg(SPeepholeOptimization + 'TEST/JNE/TEST/JNE merged', p);
  4776. RemoveInstruction(hp1_dist);
  4777. { Only remove the second test if no jumps or other conditional instructions follow }
  4778. TransferUsedRegs(TmpUsedRegs);
  4779. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  4780. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  4781. if not RegUsedAfterInstruction(NR_DEFAULTFLAGS, p_dist, TmpUsedRegs) then
  4782. RemoveInstruction(p_dist);
  4783. Result := True;
  4784. Exit;
  4785. end;
  4786. end;
  4787. end;
  4788. { Search for:
  4789. test %reg,%reg
  4790. j(c1) @lbl1
  4791. ...
  4792. @lbl:
  4793. test %reg,%reg (same register)
  4794. j(c2) @lbl2
  4795. If c2 is a subset of c1, change to:
  4796. test %reg,%reg
  4797. j(c1) @lbl2
  4798. (@lbl1 may become a dead label as a result)
  4799. }
  4800. if (taicpu(p).oper[1]^.typ = top_reg) and
  4801. (taicpu(p).oper[0]^.typ = top_reg) and
  4802. (taicpu(p).oper[0]^.reg = taicpu(p).oper[1]^.reg) and
  4803. MatchInstruction(hp1, A_JCC, []) and
  4804. IsJumpToLabel(taicpu(hp1)) then
  4805. begin
  4806. JumpLabel := TAsmLabel(taicpu(hp1).oper[0]^.ref^.symbol);
  4807. p_label := nil;
  4808. if Assigned(JumpLabel) then
  4809. p_label := getlabelwithsym(JumpLabel);
  4810. if Assigned(p_label) and
  4811. GetNextInstruction(p_label, p_dist) and
  4812. MatchInstruction(p_dist, A_TEST, []) and
  4813. { It's fine if the second test uses smaller sub-registers }
  4814. (taicpu(p_dist).opsize <= taicpu(p).opsize) and
  4815. MatchOpType(taicpu(p_dist), top_reg, top_reg) and
  4816. SuperRegistersEqual(taicpu(p_dist).oper[0]^.reg, taicpu(p).oper[0]^.reg) and
  4817. SuperRegistersEqual(taicpu(p_dist).oper[1]^.reg, taicpu(p).oper[1]^.reg) and
  4818. GetNextInstruction(p_dist, hp1_dist) and
  4819. MatchInstruction(hp1_dist, A_JCC, []) then { This doesn't have to be an explicit label }
  4820. begin
  4821. JumpLabel_dist := TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol);
  4822. if JumpLabel = JumpLabel_dist then
  4823. { This is an infinite loop }
  4824. Exit;
  4825. { Best optimisation when the first condition is a subset (or equal) of the second }
  4826. if condition_in(taicpu(hp1).condition, taicpu(hp1_dist).condition) then
  4827. begin
  4828. { Any registers used here will already be allocated }
  4829. if Assigned(JumpLabel) then
  4830. JumpLabel.DecRefs;
  4831. DebugMsg(SPeepholeOptimization + 'TEST/Jcc/@Lbl/TEST/Jcc -> TEST/Jcc, redirecting first jump', hp1);
  4832. taicpu(hp1).loadref(0, taicpu(hp1_dist).oper[0]^.ref^); { This also increases the reference count }
  4833. Result := True;
  4834. Exit;
  4835. end;
  4836. end;
  4837. end;
  4838. end;
  4839. function TX86AsmOptimizer.OptPass1Add(var p : tai) : boolean;
  4840. var
  4841. hp1, hp2: tai;
  4842. ActiveReg: TRegister;
  4843. OldOffset: asizeint;
  4844. ThisConst: TCGInt;
  4845. function RegDeallocated: Boolean;
  4846. begin
  4847. TransferUsedRegs(TmpUsedRegs);
  4848. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4849. Result := not(RegUsedAfterInstruction(ActiveReg,hp1,TmpUsedRegs))
  4850. end;
  4851. begin
  4852. result:=false;
  4853. hp1 := nil;
  4854. { replace
  4855. addX const,%reg1
  4856. leaX (%reg1,%reg1,Y),%reg2 // Base or index might not be equal to reg1
  4857. dealloc %reg1
  4858. by
  4859. leaX const+const*Y(%reg1,%reg1,Y),%reg2
  4860. }
  4861. if MatchOpType(taicpu(p),top_const,top_reg) then
  4862. begin
  4863. ActiveReg := taicpu(p).oper[1]^.reg;
  4864. { Ensures the entire register was updated }
  4865. if (taicpu(p).opsize >= S_L) and
  4866. GetNextInstructionUsingReg(p,hp1, ActiveReg) and
  4867. MatchInstruction(hp1,A_LEA,[]) and
  4868. (SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.base) or
  4869. SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.index)) and
  4870. (
  4871. { Cover the case where the register in the reference is also the destination register }
  4872. Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, ActiveReg) or
  4873. (
  4874. { Try to avoid the expensive check of RegUsedAfterInstruction if we know it will return False }
  4875. not SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ActiveReg) and
  4876. RegDeallocated
  4877. )
  4878. ) then
  4879. begin
  4880. OldOffset := taicpu(hp1).oper[0]^.ref^.offset;
  4881. {$push}
  4882. {$R-}{$Q-}
  4883. { Explicitly disable overflow checking for these offset calculation
  4884. as those do not matter for the final result }
  4885. if ActiveReg=taicpu(hp1).oper[0]^.ref^.base then
  4886. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val);
  4887. if ActiveReg=taicpu(hp1).oper[0]^.ref^.index then
  4888. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val*max(taicpu(hp1).oper[0]^.ref^.scalefactor,1));
  4889. {$pop}
  4890. {$ifdef x86_64}
  4891. if (taicpu(hp1).oper[0]^.ref^.offset > $7FFFFFFF) or (taicpu(hp1).oper[0]^.ref^.offset < -2147483648) then
  4892. begin
  4893. { Overflow; abort }
  4894. taicpu(hp1).oper[0]^.ref^.offset := OldOffset;
  4895. end
  4896. else
  4897. {$endif x86_64}
  4898. begin
  4899. DebugMsg(SPeepholeOptimization + 'AddLea2Lea done',p);
  4900. if not (cs_opt_level3 in current_settings.optimizerswitches) then
  4901. { hp1 is the immediate next instruction for sure - good for a quick speed boost }
  4902. RemoveCurrentP(p, hp1)
  4903. else
  4904. RemoveCurrentP(p);
  4905. result:=true;
  4906. Exit;
  4907. end;
  4908. end;
  4909. if (
  4910. { Save calling GetNextInstructionUsingReg again }
  4911. Assigned(hp1) or
  4912. GetNextInstructionUsingReg(p,hp1, ActiveReg)
  4913. ) and
  4914. MatchInstruction(hp1,A_ADD,A_SUB,[taicpu(p).opsize]) and
  4915. (taicpu(hp1).oper[1]^.reg = ActiveReg) then
  4916. begin
  4917. if taicpu(hp1).oper[0]^.typ = top_const then
  4918. begin
  4919. { Merge add const1,%reg; add/sub const2,%reg to add const1+/-const2,%reg }
  4920. if taicpu(hp1).opcode = A_ADD then
  4921. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val
  4922. else
  4923. ThisConst := taicpu(p).oper[0]^.val - taicpu(hp1).oper[0]^.val;
  4924. Result := True;
  4925. { Handle any overflows }
  4926. case taicpu(p).opsize of
  4927. S_B:
  4928. taicpu(p).oper[0]^.val := ThisConst and $FF;
  4929. S_W:
  4930. taicpu(p).oper[0]^.val := ThisConst and $FFFF;
  4931. S_L:
  4932. taicpu(p).oper[0]^.val := ThisConst and $FFFFFFFF;
  4933. {$ifdef x86_64}
  4934. S_Q:
  4935. if (ThisConst > $7FFFFFFF) or (ThisConst < -2147483648) then
  4936. { Overflow; abort }
  4937. Result := False
  4938. else
  4939. taicpu(p).oper[0]^.val := ThisConst;
  4940. {$endif x86_64}
  4941. else
  4942. InternalError(2021102610);
  4943. end;
  4944. { Result may get set to False again if the combined immediate overflows for S_Q sizes }
  4945. if Result then
  4946. begin
  4947. if (taicpu(p).oper[0]^.val < 0) and
  4948. (
  4949. ((taicpu(p).opsize = S_B) and (taicpu(p).oper[0]^.val <> -128)) or
  4950. ((taicpu(p).opsize = S_W) and (taicpu(p).oper[0]^.val <> -32768)) or
  4951. ((taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) and (taicpu(p).oper[0]^.val <> -2147483648))
  4952. ) then
  4953. begin
  4954. DebugMsg(SPeepholeOptimization + 'ADD; ADD/SUB -> SUB',p);
  4955. taicpu(p).opcode := A_SUB;
  4956. taicpu(p).oper[0]^.val := -taicpu(p).oper[0]^.val;
  4957. end
  4958. else
  4959. DebugMsg(SPeepholeOptimization + 'ADD; ADD/SUB -> ADD',p);
  4960. RemoveInstruction(hp1);
  4961. end;
  4962. end
  4963. else
  4964. begin
  4965. { Make doubly sure the flags aren't in use because the order of additions may affect them }
  4966. TransferUsedRegs(TmpUsedRegs);
  4967. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  4968. hp2 := p;
  4969. while not (cs_opt_level3 in current_settings.optimizerswitches) and
  4970. GetNextInstruction(hp2, hp2) and (hp2 <> hp1) do
  4971. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  4972. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  4973. begin
  4974. { Move the constant addition to after the reg/ref addition to improve optimisation }
  4975. DebugMsg(SPeepholeOptimization + 'Add/sub swap 1a done',p);
  4976. Asml.Remove(p);
  4977. Asml.InsertAfter(p, hp1);
  4978. p := hp1;
  4979. Result := True;
  4980. Exit;
  4981. end;
  4982. end;
  4983. end;
  4984. if DoArithCombineOpt(p) then
  4985. Result:=true;
  4986. end;
  4987. end;
  4988. function TX86AsmOptimizer.OptPass1LEA(var p : tai) : boolean;
  4989. var
  4990. hp1: tai;
  4991. ref: Integer;
  4992. saveref: treference;
  4993. Multiple: TCGInt;
  4994. Adjacent: Boolean;
  4995. begin
  4996. Result:=false;
  4997. { play save and throw an error if LEA uses a seg register prefix,
  4998. this is most likely an error somewhere else }
  4999. if taicpu(p).oper[0]^.ref^.Segment<>NR_NO then
  5000. internalerror(2022022001);
  5001. { changes "lea (%reg1), %reg2" into "mov %reg1, %reg2" }
  5002. if (taicpu(p).oper[0]^.ref^.base <> NR_NO) and
  5003. (taicpu(p).oper[0]^.ref^.index = NR_NO) and
  5004. (
  5005. { do not mess with leas accessing the stack pointer
  5006. unless it's a null operation }
  5007. (taicpu(p).oper[1]^.reg <> NR_STACK_POINTER_REG) or
  5008. (
  5009. (taicpu(p).oper[0]^.ref^.base = NR_STACK_POINTER_REG) and
  5010. (taicpu(p).oper[0]^.ref^.offset = 0)
  5011. )
  5012. ) and
  5013. (not(Assigned(taicpu(p).oper[0]^.ref^.Symbol))) then
  5014. begin
  5015. if (taicpu(p).oper[0]^.ref^.offset = 0) then
  5016. begin
  5017. if (taicpu(p).oper[0]^.ref^.base <> taicpu(p).oper[1]^.reg) then
  5018. begin
  5019. taicpu(p).opcode := A_MOV;
  5020. taicpu(p).loadreg(0, taicpu(p).oper[0]^.ref^.base);
  5021. DebugMsg(SPeepholeOptimization + 'Lea2Mov done',p);
  5022. end
  5023. else
  5024. begin
  5025. DebugMsg(SPeepholeOptimization + 'Lea2Nop done',p);
  5026. RemoveCurrentP(p);
  5027. end;
  5028. Result:=true;
  5029. exit;
  5030. end
  5031. else if (
  5032. { continue to use lea to adjust the stack pointer,
  5033. it is the recommended way, but only if not optimizing for size }
  5034. (taicpu(p).oper[1]^.reg<>NR_STACK_POINTER_REG) or
  5035. (cs_opt_size in current_settings.optimizerswitches)
  5036. ) and
  5037. { If the flags register is in use, don't change the instruction
  5038. to an ADD otherwise this will scramble the flags. [Kit] }
  5039. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  5040. ConvertLEA(taicpu(p)) then
  5041. begin
  5042. Result:=true;
  5043. exit;
  5044. end;
  5045. end;
  5046. { Don't optimise if the stack or frame pointer is the destination register }
  5047. if (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG) or (taicpu(p).oper[1]^.reg=current_procinfo.framepointer) then
  5048. Exit;
  5049. if GetNextInstruction(p,hp1) and
  5050. (hp1.typ=ait_instruction) then
  5051. begin
  5052. if MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) and
  5053. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  5054. MatchOpType(Taicpu(hp1),top_reg,top_reg) then
  5055. begin
  5056. TransferUsedRegs(TmpUsedRegs);
  5057. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5058. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  5059. begin
  5060. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  5061. DebugMsg(SPeepholeOptimization + 'LeaMov2Lea done',p);
  5062. RemoveInstruction(hp1);
  5063. result:=true;
  5064. exit;
  5065. end;
  5066. end;
  5067. { changes
  5068. lea <ref1>, reg1
  5069. <op> ...,<ref. with reg1>,...
  5070. to
  5071. <op> ...,<ref1>,... }
  5072. { find a reference which uses reg1 }
  5073. 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
  5074. ref:=0
  5075. 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
  5076. ref:=1
  5077. else
  5078. ref:=-1;
  5079. if (ref<>-1) and
  5080. { reg1 must be either the base or the index }
  5081. ((taicpu(hp1).oper[ref]^.ref^.base=taicpu(p).oper[1]^.reg) xor (taicpu(hp1).oper[ref]^.ref^.index=taicpu(p).oper[1]^.reg)) then
  5082. begin
  5083. { reg1 can be removed from the reference }
  5084. saveref:=taicpu(hp1).oper[ref]^.ref^;
  5085. if taicpu(hp1).oper[ref]^.ref^.base=taicpu(p).oper[1]^.reg then
  5086. taicpu(hp1).oper[ref]^.ref^.base:=NR_NO
  5087. else if taicpu(hp1).oper[ref]^.ref^.index=taicpu(p).oper[1]^.reg then
  5088. taicpu(hp1).oper[ref]^.ref^.index:=NR_NO
  5089. else
  5090. Internalerror(2019111201);
  5091. { check if the can insert all data of the lea into the second instruction }
  5092. if ((taicpu(hp1).oper[ref]^.ref^.base=taicpu(p).oper[1]^.reg) or (taicpu(hp1).oper[ref]^.ref^.scalefactor <= 1)) and
  5093. ((taicpu(p).oper[0]^.ref^.base=NR_NO) or (taicpu(hp1).oper[ref]^.ref^.base=NR_NO)) and
  5094. ((taicpu(p).oper[0]^.ref^.index=NR_NO) or (taicpu(hp1).oper[ref]^.ref^.index=NR_NO)) and
  5095. ((taicpu(p).oper[0]^.ref^.symbol=nil) or (taicpu(hp1).oper[ref]^.ref^.symbol=nil)) and
  5096. ((taicpu(p).oper[0]^.ref^.relsymbol=nil) or (taicpu(hp1).oper[ref]^.ref^.relsymbol=nil)) and
  5097. ((taicpu(p).oper[0]^.ref^.scalefactor <= 1) or (taicpu(hp1).oper[ref]^.ref^.scalefactor <= 1)) and
  5098. (taicpu(p).oper[0]^.ref^.segment=NR_NO) and (taicpu(hp1).oper[ref]^.ref^.segment=NR_NO)
  5099. {$ifdef x86_64}
  5100. and (abs(taicpu(hp1).oper[ref]^.ref^.offset+taicpu(p).oper[0]^.ref^.offset)<=$7fffffff)
  5101. and (((taicpu(p).oper[0]^.ref^.base<>NR_RIP) and (taicpu(p).oper[0]^.ref^.index<>NR_RIP)) or
  5102. ((taicpu(hp1).oper[ref]^.ref^.base=NR_NO) and (taicpu(hp1).oper[ref]^.ref^.index=NR_NO))
  5103. )
  5104. {$endif x86_64}
  5105. then
  5106. begin
  5107. { reg1 might not used by the second instruction after it is remove from the reference }
  5108. if not(RegInInstruction(taicpu(p).oper[1]^.reg,taicpu(hp1))) then
  5109. begin
  5110. TransferUsedRegs(TmpUsedRegs);
  5111. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5112. { reg1 is not updated so it might not be used afterwards }
  5113. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  5114. begin
  5115. DebugMsg(SPeepholeOptimization + 'LeaOp2Op done',p);
  5116. if taicpu(p).oper[0]^.ref^.base<>NR_NO then
  5117. taicpu(hp1).oper[ref]^.ref^.base:=taicpu(p).oper[0]^.ref^.base;
  5118. if taicpu(p).oper[0]^.ref^.index<>NR_NO then
  5119. taicpu(hp1).oper[ref]^.ref^.index:=taicpu(p).oper[0]^.ref^.index;
  5120. if taicpu(p).oper[0]^.ref^.symbol<>nil then
  5121. taicpu(hp1).oper[ref]^.ref^.symbol:=taicpu(p).oper[0]^.ref^.symbol;
  5122. if taicpu(p).oper[0]^.ref^.relsymbol<>nil then
  5123. taicpu(hp1).oper[ref]^.ref^.relsymbol:=taicpu(p).oper[0]^.ref^.relsymbol;
  5124. if taicpu(p).oper[0]^.ref^.scalefactor > 1 then
  5125. taicpu(hp1).oper[ref]^.ref^.scalefactor:=taicpu(p).oper[0]^.ref^.scalefactor;
  5126. inc(taicpu(hp1).oper[ref]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset);
  5127. RemoveCurrentP(p, hp1);
  5128. result:=true;
  5129. exit;
  5130. end
  5131. end;
  5132. end;
  5133. { recover }
  5134. taicpu(hp1).oper[ref]^.ref^:=saveref;
  5135. end;
  5136. Adjacent := RegInInstruction(taicpu(p).oper[1]^.reg, hp1);
  5137. if Adjacent or
  5138. { Check further ahead (up to 2 instructions ahead for -O2) }
  5139. GetNextInstructionUsingReg(hp1,hp1,taicpu(p).oper[1]^.reg) then
  5140. begin
  5141. { Check common LEA/LEA conditions }
  5142. if MatchInstruction(hp1,A_LEA,[taicpu(p).opsize]) and
  5143. (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg) and
  5144. (taicpu(p).oper[0]^.ref^.relsymbol = nil) and
  5145. (taicpu(p).oper[0]^.ref^.segment = NR_NO) and
  5146. (taicpu(p).oper[0]^.ref^.symbol = nil) and
  5147. (taicpu(hp1).oper[0]^.ref^.relsymbol = nil) and
  5148. (taicpu(hp1).oper[0]^.ref^.segment = NR_NO) and
  5149. (taicpu(hp1).oper[0]^.ref^.symbol = nil) and
  5150. (
  5151. { If p and hp1 are adjacent, RegModifiedBetween always returns False, so avoid
  5152. calling it (since it calls GetNextInstruction) }
  5153. Adjacent or
  5154. (
  5155. (
  5156. (taicpu(p).oper[0]^.ref^.base = NR_NO) or { Don't call RegModifiedBetween unnecessarily }
  5157. not(RegModifiedBetween(taicpu(p).oper[0]^.ref^.base,p,hp1))
  5158. ) and (
  5159. (taicpu(p).oper[0]^.ref^.index = taicpu(p).oper[0]^.ref^.base) or { Don't call RegModifiedBetween unnecessarily }
  5160. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5161. not(RegModifiedBetween(taicpu(p).oper[0]^.ref^.index,p,hp1))
  5162. )
  5163. )
  5164. ) then
  5165. begin
  5166. { changes
  5167. lea (regX,scale), reg1
  5168. lea offset(reg1,reg1), reg1
  5169. to
  5170. lea offset(regX,scale*2), reg1
  5171. and
  5172. lea (regX,scale1), reg1
  5173. lea offset(reg1,scale2), reg1
  5174. to
  5175. lea offset(regX,scale1*scale2), reg1
  5176. ... so long as the final scale does not exceed 8
  5177. (Similarly, allow the first instruction to be "lea (regX,regX),reg1")
  5178. }
  5179. if (taicpu(p).oper[0]^.ref^.base<>NR_STACK_POINTER_REG) and { lea (%rsp,scale),reg is not a valid encoding }
  5180. (taicpu(p).oper[0]^.ref^.offset = 0) and
  5181. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  5182. (
  5183. (
  5184. (taicpu(p).oper[0]^.ref^.base = NR_NO)
  5185. ) or (
  5186. (taicpu(p).oper[0]^.ref^.scalefactor <= 1) and
  5187. (
  5188. (taicpu(p).oper[0]^.ref^.base = taicpu(p).oper[0]^.ref^.index) and
  5189. (
  5190. { RegUsedBetween always returns False if p and hp1 are adjacent }
  5191. Adjacent or
  5192. not(RegUsedBetween(taicpu(p).oper[0]^.ref^.index, p, hp1))
  5193. )
  5194. )
  5195. )
  5196. ) and (
  5197. (
  5198. { lea (reg1,scale2), reg1 variant }
  5199. (taicpu(hp1).oper[0]^.ref^.base = NR_NO) and
  5200. (
  5201. (
  5202. (taicpu(p).oper[0]^.ref^.base = NR_NO) and
  5203. (taicpu(hp1).oper[0]^.ref^.scalefactor * taicpu(p).oper[0]^.ref^.scalefactor <= 8)
  5204. ) or (
  5205. { lea (regX,regX), reg1 variant }
  5206. (taicpu(p).oper[0]^.ref^.base <> NR_NO) and
  5207. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 4)
  5208. )
  5209. )
  5210. ) or (
  5211. { lea (reg1,reg1), reg1 variant }
  5212. (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  5213. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 1)
  5214. )
  5215. ) then
  5216. begin
  5217. DebugMsg(SPeepholeOptimization + 'LeaLea2Lea 2 done',p);
  5218. { Make everything homogeneous to make calculations easier }
  5219. if (taicpu(p).oper[0]^.ref^.base <> NR_NO) then
  5220. begin
  5221. if taicpu(p).oper[0]^.ref^.index <> NR_NO then
  5222. { Convert lea (regX,regX),reg1 to lea (regX,2),reg1 }
  5223. taicpu(p).oper[0]^.ref^.scalefactor := 2
  5224. else
  5225. taicpu(p).oper[0]^.ref^.index := taicpu(p).oper[0]^.ref^.base;
  5226. taicpu(p).oper[0]^.ref^.base := NR_NO;
  5227. end;
  5228. if (taicpu(hp1).oper[0]^.ref^.base = NR_NO) then
  5229. begin
  5230. { Just to prevent miscalculations }
  5231. if (taicpu(hp1).oper[0]^.ref^.scalefactor = 0) then
  5232. taicpu(hp1).oper[0]^.ref^.scalefactor := taicpu(p).oper[0]^.ref^.scalefactor
  5233. else
  5234. taicpu(hp1).oper[0]^.ref^.scalefactor := taicpu(hp1).oper[0]^.ref^.scalefactor * taicpu(p).oper[0]^.ref^.scalefactor;
  5235. end
  5236. else
  5237. begin
  5238. taicpu(hp1).oper[0]^.ref^.base := NR_NO;
  5239. taicpu(hp1).oper[0]^.ref^.scalefactor := taicpu(p).oper[0]^.ref^.scalefactor * 2;
  5240. end;
  5241. taicpu(hp1).oper[0]^.ref^.index := taicpu(p).oper[0]^.ref^.index;
  5242. RemoveCurrentP(p);
  5243. result:=true;
  5244. exit;
  5245. end
  5246. { changes
  5247. lea offset1(regX), reg1
  5248. lea offset2(reg1), reg1
  5249. to
  5250. lea offset1+offset2(regX), reg1 }
  5251. else if
  5252. (
  5253. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  5254. (taicpu(p).oper[0]^.ref^.index = NR_NO)
  5255. ) or (
  5256. (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  5257. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 1) and
  5258. (
  5259. (
  5260. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5261. (taicpu(p).oper[0]^.ref^.base = NR_NO)
  5262. ) or (
  5263. (taicpu(p).oper[0]^.ref^.scalefactor <= 1) and
  5264. (
  5265. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5266. (
  5267. (taicpu(p).oper[0]^.ref^.index = taicpu(p).oper[0]^.ref^.base) and
  5268. (
  5269. (taicpu(hp1).oper[0]^.ref^.index = NR_NO) or
  5270. (taicpu(hp1).oper[0]^.ref^.base = NR_NO)
  5271. )
  5272. )
  5273. )
  5274. )
  5275. )
  5276. ) then
  5277. begin
  5278. DebugMsg(SPeepholeOptimization + 'LeaLea2Lea 1 done',p);
  5279. if taicpu(hp1).oper[0]^.ref^.index=taicpu(p).oper[1]^.reg then
  5280. begin
  5281. taicpu(hp1).oper[0]^.ref^.index:=taicpu(p).oper[0]^.ref^.base;
  5282. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset*max(taicpu(hp1).oper[0]^.ref^.scalefactor,1));
  5283. { if the register is used as index and base, we have to increase for base as well
  5284. and adapt base }
  5285. if taicpu(hp1).oper[0]^.ref^.base=taicpu(p).oper[1]^.reg then
  5286. begin
  5287. taicpu(hp1).oper[0]^.ref^.base:=taicpu(p).oper[0]^.ref^.base;
  5288. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset);
  5289. end;
  5290. end
  5291. else
  5292. begin
  5293. inc(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.ref^.offset);
  5294. taicpu(hp1).oper[0]^.ref^.base:=taicpu(p).oper[0]^.ref^.base;
  5295. end;
  5296. if taicpu(p).oper[0]^.ref^.index<>NR_NO then
  5297. begin
  5298. taicpu(hp1).oper[0]^.ref^.base:=taicpu(hp1).oper[0]^.ref^.index;
  5299. taicpu(hp1).oper[0]^.ref^.index:=taicpu(p).oper[0]^.ref^.index;
  5300. taicpu(hp1).oper[0]^.ref^.scalefactor:=taicpu(p).oper[0]^.ref^.scalefactor;
  5301. end;
  5302. RemoveCurrentP(p);
  5303. result:=true;
  5304. exit;
  5305. end;
  5306. end;
  5307. { Change:
  5308. leal/q $x(%reg1),%reg2
  5309. ...
  5310. shll/q $y,%reg2
  5311. To:
  5312. leal/q $(x+2^y)(%reg1,2^y),%reg2 (if y <= 3)
  5313. }
  5314. if (taicpu(p).oper[0]^.ref^.base<>NR_STACK_POINTER_REG) and { lea (%rsp,scale),reg is not a valid encoding }
  5315. MatchInstruction(hp1, A_SHL, [taicpu(p).opsize]) and
  5316. MatchOpType(taicpu(hp1), top_const, top_reg) and
  5317. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  5318. (taicpu(hp1).oper[0]^.val <= 3) then
  5319. begin
  5320. Multiple := 1 shl taicpu(hp1).oper[0]^.val;
  5321. TransferUsedRegs(TmpUsedRegs);
  5322. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  5323. if
  5324. { This allows the optimisation in some circumstances even if the lea instruction already has a scale factor
  5325. (this works even if scalefactor is zero) }
  5326. ((Multiple * taicpu(p).oper[0]^.ref^.scalefactor) <= 8) and
  5327. { Ensure offset doesn't go out of bounds }
  5328. (abs(taicpu(p).oper[0]^.ref^.offset * Multiple) <= $7FFFFFFF) and
  5329. not (RegInUsedRegs(NR_DEFAULTFLAGS,TmpUsedRegs)) and
  5330. (
  5331. (
  5332. not SuperRegistersEqual(taicpu(p).oper[0]^.ref^.base, taicpu(p).oper[1]^.reg) and
  5333. (
  5334. (taicpu(p).oper[0]^.ref^.index = NR_NO) or
  5335. (taicpu(p).oper[0]^.ref^.index = NR_INVALID) or
  5336. (
  5337. { Check for lea $x(%reg1,%reg1),%reg2 and treat as it it were lea $x(%reg1,2),%reg2 }
  5338. (taicpu(p).oper[0]^.ref^.index = taicpu(p).oper[0]^.ref^.base) and
  5339. (taicpu(p).oper[0]^.ref^.scalefactor <= 1)
  5340. )
  5341. )
  5342. ) or (
  5343. (
  5344. (taicpu(p).oper[0]^.ref^.base = NR_NO) or
  5345. (taicpu(p).oper[0]^.ref^.base = NR_INVALID)
  5346. ) and
  5347. not SuperRegistersEqual(taicpu(p).oper[0]^.ref^.index, taicpu(p).oper[1]^.reg)
  5348. )
  5349. ) then
  5350. begin
  5351. repeat
  5352. with taicpu(p).oper[0]^.ref^ do
  5353. begin
  5354. { Convert lea $x(%reg1,%reg1),%reg2 to lea $x(%reg1,2),%reg2 }
  5355. if index = base then
  5356. begin
  5357. if Multiple > 4 then
  5358. { Optimisation will no longer work because resultant
  5359. scale factor will exceed 8 }
  5360. Break;
  5361. base := NR_NO;
  5362. scalefactor := 2;
  5363. DebugMsg(SPeepholeOptimization + 'lea $x(%reg1,%reg1),%reg2 -> lea $x(%reg1,2),%reg2 for following optimisation', p);
  5364. end
  5365. else if (base <> NR_NO) and (base <> NR_INVALID) then
  5366. begin
  5367. { Scale factor only works on the index register }
  5368. index := base;
  5369. base := NR_NO;
  5370. end;
  5371. { For safety }
  5372. if scalefactor <= 1 then
  5373. begin
  5374. DebugMsg(SPeepholeOptimization + 'LeaShl2Lea 1', p);
  5375. scalefactor := Multiple;
  5376. end
  5377. else
  5378. begin
  5379. DebugMsg(SPeepholeOptimization + 'LeaShl2Lea 2', p);
  5380. scalefactor := scalefactor * Multiple;
  5381. end;
  5382. offset := offset * Multiple;
  5383. end;
  5384. RemoveInstruction(hp1);
  5385. Result := True;
  5386. Exit;
  5387. { This repeat..until loop exists for the benefit of Break }
  5388. until True;
  5389. end;
  5390. end;
  5391. end;
  5392. end;
  5393. end;
  5394. function TX86AsmOptimizer.DoArithCombineOpt(var p: tai): Boolean;
  5395. var
  5396. hp1 : tai;
  5397. SubInstr: Boolean;
  5398. ThisConst: TCGInt;
  5399. const
  5400. OverflowMin: array[S_B..S_Q] of TCGInt = (-128, -32768, -2147483648, -2147483648);
  5401. { Note: 64-bit-sized arithmetic instructions can only take signed 32-bit immediates }
  5402. OverflowMax: array[S_B..S_Q] of TCGInt = ( 255, 65535, $FFFFFFFF, 2147483647);
  5403. begin
  5404. Result := False;
  5405. if taicpu(p).oper[0]^.typ <> top_const then
  5406. { Should have been confirmed before calling }
  5407. InternalError(2021102601);
  5408. SubInstr := (taicpu(p).opcode = A_SUB);
  5409. if GetLastInstruction(p, hp1) and
  5410. (hp1.typ = ait_instruction) and
  5411. (taicpu(hp1).opsize = taicpu(p).opsize) then
  5412. begin
  5413. if not (taicpu(p).opsize in [S_B, S_W, S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  5414. { Bad size }
  5415. InternalError(2022042001);
  5416. case taicpu(hp1).opcode Of
  5417. A_INC:
  5418. if MatchOperand(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  5419. begin
  5420. if SubInstr then
  5421. ThisConst := taicpu(p).oper[0]^.val - 1
  5422. else
  5423. ThisConst := taicpu(p).oper[0]^.val + 1;
  5424. end
  5425. else
  5426. Exit;
  5427. A_DEC:
  5428. if MatchOperand(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) then
  5429. begin
  5430. if SubInstr then
  5431. ThisConst := taicpu(p).oper[0]^.val + 1
  5432. else
  5433. ThisConst := taicpu(p).oper[0]^.val - 1;
  5434. end
  5435. else
  5436. Exit;
  5437. A_SUB:
  5438. if (taicpu(hp1).oper[0]^.typ = top_const) and
  5439. MatchOperand(taicpu(hp1).oper[1]^,taicpu(p).oper[1]^) then
  5440. begin
  5441. if SubInstr then
  5442. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val
  5443. else
  5444. ThisConst := taicpu(p).oper[0]^.val - taicpu(hp1).oper[0]^.val;
  5445. end
  5446. else
  5447. Exit;
  5448. A_ADD:
  5449. if (taicpu(hp1).oper[0]^.typ = top_const) and
  5450. MatchOperand(taicpu(hp1).oper[1]^,taicpu(p).oper[1]^) then
  5451. begin
  5452. if SubInstr then
  5453. ThisConst := taicpu(p).oper[0]^.val - taicpu(hp1).oper[0]^.val
  5454. else
  5455. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val;
  5456. end
  5457. else
  5458. Exit;
  5459. else
  5460. Exit;
  5461. end;
  5462. { Check that the values are in range }
  5463. if (ThisConst < OverflowMin[taicpu(p).opsize]) or (ThisConst > OverflowMax[taicpu(p).opsize]) then
  5464. { Overflow; abort }
  5465. Exit;
  5466. if (ThisConst = 0) then
  5467. begin
  5468. DebugMsg(SPeepholeOptimization + 'Arithmetic combine: ' +
  5469. debug_op2str(taicpu(hp1).opcode) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + debug_operstr(taicpu(hp1).oper[1]^) + '; ' +
  5470. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(taicpu(p).oper[0]^.val) + ',' + debug_operstr(taicpu(p).oper[1]^) + ' cancel out (NOP)', p);
  5471. RemoveInstruction(hp1);
  5472. hp1 := tai(p.next);
  5473. RemoveInstruction(p); { Note, the choice to not use RemoveCurrentp is deliberate }
  5474. if not GetLastInstruction(hp1, p) then
  5475. p := hp1;
  5476. end
  5477. else
  5478. begin
  5479. if taicpu(hp1).opercnt=1 then
  5480. DebugMsg(SPeepholeOptimization + 'Arithmetic combine: ' +
  5481. debug_op2str(taicpu(hp1).opcode) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + '; ' +
  5482. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(taicpu(p).oper[0]^.val) + ',' + debug_operstr(taicpu(p).oper[1]^) + ' -> ' +
  5483. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(ThisConst) + ' ' + debug_operstr(taicpu(p).oper[1]^), p)
  5484. else
  5485. DebugMsg(SPeepholeOptimization + 'Arithmetic combine: ' +
  5486. debug_op2str(taicpu(hp1).opcode) + ' $' + debug_tostr(taicpu(hp1).oper[0]^.val) + ',' + debug_operstr(taicpu(hp1).oper[1]^) + '; ' +
  5487. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(taicpu(p).oper[0]^.val) + ',' + debug_operstr(taicpu(p).oper[1]^) + ' -> ' +
  5488. debug_op2str(taicpu(p).opcode) + ' $' + debug_tostr(ThisConst) + ' ' + debug_operstr(taicpu(p).oper[1]^), p);
  5489. RemoveInstruction(hp1);
  5490. taicpu(p).loadconst(0, ThisConst);
  5491. end;
  5492. Result := True;
  5493. end;
  5494. end;
  5495. function TX86AsmOptimizer.DoMovCmpMemOpt(var p : tai; const hp1: tai; UpdateTmpUsedRegs: Boolean) : Boolean;
  5496. begin
  5497. Result := False;
  5498. if UpdateTmpUsedRegs then
  5499. TransferUsedRegs(TmpUsedRegs);
  5500. if MatchOpType(taicpu(p),top_ref,top_reg) and
  5501. { The x86 assemblers have difficulty comparing values against absolute addresses }
  5502. (taicpu(p).oper[0]^.ref^.refaddr <> addr_full) and
  5503. (taicpu(hp1).oper[0]^.typ <> top_ref) and
  5504. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  5505. (
  5506. (
  5507. (taicpu(hp1).opcode = A_TEST)
  5508. ) or (
  5509. (taicpu(hp1).opcode = A_CMP) and
  5510. { A sanity check more than anything }
  5511. not MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg)
  5512. )
  5513. ) then
  5514. begin
  5515. { change
  5516. mov mem, %reg
  5517. cmp/test x, %reg / test %reg,%reg
  5518. (reg deallocated)
  5519. to
  5520. cmp/test x, mem / cmp 0, mem
  5521. }
  5522. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  5523. if not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) then
  5524. begin
  5525. { Convert test %reg,%reg or test $-1,%reg to cmp $0,mem }
  5526. if (taicpu(hp1).opcode = A_TEST) and
  5527. (
  5528. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) or
  5529. MatchOperand(taicpu(hp1).oper[0]^, -1)
  5530. ) then
  5531. begin
  5532. taicpu(hp1).opcode := A_CMP;
  5533. taicpu(hp1).loadconst(0, 0);
  5534. end;
  5535. taicpu(hp1).loadref(1, taicpu(p).oper[0]^.ref^);
  5536. DebugMsg(SPeepholeOptimization + 'MOV/CMP -> CMP (memory check)', p);
  5537. RemoveCurrentP(p, hp1);
  5538. Result := True;
  5539. Exit;
  5540. end;
  5541. end;
  5542. end;
  5543. function TX86AsmOptimizer.DoSETccLblRETOpt(var p: tai; const hp_label: tai_label) : Boolean;
  5544. var
  5545. hp_allocstart, hp_pos, hp2, hp3, hp4, hp5, hp6: tai;
  5546. ThisReg, SecondReg: TRegister;
  5547. JumpLoc: TAsmLabel;
  5548. NewSize: TOpSize;
  5549. begin
  5550. Result := False;
  5551. {
  5552. Convert:
  5553. j<c> .L1
  5554. .L2:
  5555. mov 1,reg
  5556. jmp .L3 (or ret, although it might not be a RET yet)
  5557. .L1:
  5558. mov 0,reg
  5559. jmp .L3 (or ret)
  5560. ( As long as .L3 <> .L1 or .L2)
  5561. To:
  5562. mov 0,reg
  5563. set<not(c)> reg
  5564. jmp .L3 (or ret)
  5565. .L2:
  5566. mov 1,reg
  5567. jmp .L3 (or ret)
  5568. .L1:
  5569. mov 0,reg
  5570. jmp .L3 (or ret)
  5571. }
  5572. if JumpTargetOp(taicpu(p))^.ref^.refaddr<>addr_full then
  5573. Exit;
  5574. JumpLoc := TAsmLabel(JumpTargetOp(taicpu(p))^.ref^.symbol);
  5575. if GetNextInstruction(hp_label, hp2) and
  5576. MatchInstruction(hp2,A_MOV,[]) and
  5577. (taicpu(hp2).oper[0]^.typ = top_const) and
  5578. (
  5579. (
  5580. (taicpu(hp2).oper[1]^.typ = top_reg)
  5581. {$ifdef i386}
  5582. { Under i386, ESI, EDI, EBP and ESP
  5583. don't have an 8-bit representation }
  5584. and not (getsupreg(taicpu(hp2).oper[1]^.reg) in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  5585. {$endif i386}
  5586. ) or (
  5587. {$ifdef i386}
  5588. (taicpu(hp2).oper[1]^.typ <> top_reg) and
  5589. {$endif i386}
  5590. (taicpu(hp2).opsize = S_B)
  5591. )
  5592. ) and
  5593. GetNextInstruction(hp2, hp3) and
  5594. MatchInstruction(hp3, A_JMP, A_RET, []) and
  5595. (
  5596. (taicpu(hp3).opcode=A_RET) or
  5597. (
  5598. (taicpu(hp3).oper[0]^.ref^.refaddr=addr_full) and
  5599. (tasmlabel(taicpu(hp3).oper[0]^.ref^.symbol)<>tai_label(hp_label).labsym)
  5600. )
  5601. ) and
  5602. GetNextInstruction(hp3, hp4) and
  5603. SkipAligns(hp4, hp4) and
  5604. (hp4.typ=ait_label) and
  5605. (tai_label(hp4).labsym=JumpLoc) and
  5606. (
  5607. not (cs_opt_size in current_settings.optimizerswitches) or
  5608. { If the initial jump is the label's only reference, then it will
  5609. become a dead label if the other conditions are met and hence
  5610. remove at least 2 instructions, including a jump }
  5611. (JumpLoc.getrefs = 1)
  5612. ) and
  5613. { Don't check if hp3 jumps to hp4 because this is a zero-distance jump
  5614. that will be optimised out }
  5615. GetNextInstruction(hp4, hp5) and
  5616. MatchInstruction(hp5,A_MOV,[taicpu(hp2).opsize]) and
  5617. (taicpu(hp5).oper[0]^.typ = top_const) and
  5618. (
  5619. ((taicpu(hp2).oper[0]^.val = 0) and (taicpu(hp5).oper[0]^.val = 1)) or
  5620. ((taicpu(hp2).oper[0]^.val = 1) and (taicpu(hp5).oper[0]^.val = 0))
  5621. ) and
  5622. MatchOperand(taicpu(hp2).oper[1]^,taicpu(hp5).oper[1]^) and
  5623. GetNextInstruction(hp5,hp6) and
  5624. (
  5625. (hp6.typ<>ait_label) or
  5626. SkipLabels(hp6, hp6)
  5627. ) and
  5628. (hp6.typ=ait_instruction) then
  5629. begin
  5630. { First, let's look at the two jumps that are hp3 and hp6 }
  5631. if not
  5632. (
  5633. (taicpu(hp6).opcode=taicpu(hp3).opcode) and { Both RET or both JMP to the same label }
  5634. (
  5635. (taicpu(hp6).opcode=A_RET) or
  5636. MatchOperand(taicpu(hp6).oper[0]^, taicpu(hp3).oper[0]^)
  5637. )
  5638. ) then
  5639. { If condition is False, then the JMP/RET instructions matched conventionally }
  5640. begin
  5641. { See if one of the jumps can be instantly converted into a RET }
  5642. if (taicpu(hp3).opcode=A_JMP) then
  5643. begin
  5644. { Reuse hp5 }
  5645. hp5 := getlabelwithsym(TAsmLabel(JumpTargetOp(taicpu(hp3))^.ref^.symbol));
  5646. { Make sure hp5 doesn't jump back to .L2 (infinite loop) }
  5647. if not Assigned(hp5) or (hp5=hp4) or not GetNextInstruction(hp5, hp5) then
  5648. Exit;
  5649. if MatchInstruction(hp5, A_RET, []) then
  5650. begin
  5651. DebugMsg(SPeepholeOptimization + 'Converted JMP to RET as part of SETcc optimisation (1st jump)', hp3);
  5652. ConvertJumpToRET(hp3, hp5);
  5653. Result := True;
  5654. end
  5655. else
  5656. Exit;
  5657. end;
  5658. if (taicpu(hp6).opcode=A_JMP) then
  5659. begin
  5660. { Reuse hp5 }
  5661. hp5 := getlabelwithsym(TAsmLabel(JumpTargetOp(taicpu(hp6))^.ref^.symbol));
  5662. if not Assigned(hp5) or not GetNextInstruction(hp5, hp5) then
  5663. Exit;
  5664. if MatchInstruction(hp5, A_RET, []) then
  5665. begin
  5666. DebugMsg(SPeepholeOptimization + 'Converted JMP to RET as part of SETcc optimisation (2nd jump)', hp6);
  5667. ConvertJumpToRET(hp6, hp5);
  5668. Result := True;
  5669. end
  5670. else
  5671. Exit;
  5672. end;
  5673. if not
  5674. (
  5675. (taicpu(hp6).opcode=taicpu(hp3).opcode) and { Both RET or both JMP to the same label }
  5676. (
  5677. (taicpu(hp6).opcode=A_RET) or
  5678. MatchOperand(taicpu(hp6).oper[0]^, taicpu(hp3).oper[0]^)
  5679. )
  5680. ) then
  5681. { Still doesn't match }
  5682. Exit;
  5683. end;
  5684. if (taicpu(hp2).oper[0]^.val = 1) then
  5685. begin
  5686. taicpu(p).condition := inverse_cond(taicpu(p).condition);
  5687. DebugMsg(SPeepholeOptimization + 'J(c)Mov1Jmp/RetMov0Jmp/Ret -> Set(~c)Jmp/Ret',p)
  5688. end
  5689. else
  5690. DebugMsg(SPeepholeOptimization + 'J(c)Mov0Jmp/RetMov1Jmp/Ret -> Set(c)Jmp/Ret',p);
  5691. if taicpu(hp2).opsize=S_B then
  5692. begin
  5693. if taicpu(hp2).oper[1]^.typ = top_reg then
  5694. begin
  5695. SecondReg := taicpu(hp2).oper[1]^.reg;
  5696. hp4:=taicpu.op_reg(A_SETcc, S_B, SecondReg);
  5697. end
  5698. else
  5699. begin
  5700. hp4:=taicpu.op_ref(A_SETcc, S_B, taicpu(hp2).oper[1]^.ref^);
  5701. SecondReg := NR_NO;
  5702. end;
  5703. hp_pos := p;
  5704. hp_allocstart := hp4;
  5705. end
  5706. else
  5707. begin
  5708. { Will be a register because the size can't be S_B otherwise }
  5709. SecondReg:=taicpu(hp2).oper[1]^.reg;
  5710. ThisReg:=newreg(R_INTREGISTER,getsupreg(SecondReg), R_SUBL);
  5711. hp4:=taicpu.op_reg(A_SETcc, S_B, ThisReg);
  5712. if (cs_opt_size in current_settings.optimizerswitches) then
  5713. begin
  5714. { Favour using MOVZX when optimising for size }
  5715. case taicpu(hp2).opsize of
  5716. S_W:
  5717. NewSize := S_BW;
  5718. S_L:
  5719. NewSize := S_BL;
  5720. {$ifdef x86_64}
  5721. S_Q:
  5722. begin
  5723. NewSize := S_BL;
  5724. { Will implicitly zero-extend to 64-bit }
  5725. setsubreg(SecondReg, R_SUBD);
  5726. end;
  5727. {$endif x86_64}
  5728. else
  5729. InternalError(2022101301);
  5730. end;
  5731. hp5:=taicpu.op_reg_reg(A_MOVZX, NewSize, ThisReg, SecondReg);
  5732. { Inserting it right before p will guarantee that the flags are also tracked }
  5733. Asml.InsertBefore(hp5, p);
  5734. { Make sure the SET instruction gets inserted before the MOVZX instruction }
  5735. hp_pos := hp5;
  5736. hp_allocstart := hp4;
  5737. end
  5738. else
  5739. begin
  5740. hp5:=taicpu.op_const_reg(A_MOV, taicpu(hp2).opsize, 0, SecondReg);
  5741. { Inserting it right before p will guarantee that the flags are also tracked }
  5742. Asml.InsertBefore(hp5, p);
  5743. hp_pos := p;
  5744. hp_allocstart := hp5;
  5745. end;
  5746. taicpu(hp5).fileinfo:=taicpu(p).fileinfo;
  5747. end;
  5748. taicpu(hp4).fileinfo := taicpu(p).fileinfo;
  5749. taicpu(hp4).condition := taicpu(p).condition;
  5750. asml.InsertBefore(hp4, hp_pos);
  5751. if taicpu(hp3).is_jmp then
  5752. begin
  5753. JumpLoc.decrefs;
  5754. MakeUnconditional(taicpu(p));
  5755. taicpu(p).loadref(0, JumpTargetOp(taicpu(hp3))^.ref^);
  5756. TAsmLabel(JumpTargetOp(taicpu(hp3))^.ref^.symbol).increfs;
  5757. end
  5758. else
  5759. ConvertJumpToRET(p, hp3);
  5760. if SecondReg <> NR_NO then
  5761. { Ensure the destination register is allocated over this region }
  5762. AllocRegBetween(SecondReg, hp_allocstart, p, UsedRegs);
  5763. if (JumpLoc.getrefs = 0) then
  5764. RemoveDeadCodeAfterJump(hp3);
  5765. Result:=true;
  5766. exit;
  5767. end;
  5768. end;
  5769. function TX86AsmOptimizer.OptPass1Sub(var p : tai) : boolean;
  5770. var
  5771. hp1, hp2: tai;
  5772. ActiveReg: TRegister;
  5773. OldOffset: asizeint;
  5774. ThisConst: TCGInt;
  5775. function RegDeallocated: Boolean;
  5776. begin
  5777. TransferUsedRegs(TmpUsedRegs);
  5778. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5779. Result := not(RegUsedAfterInstruction(ActiveReg,hp1,TmpUsedRegs))
  5780. end;
  5781. begin
  5782. Result:=false;
  5783. hp1 := nil;
  5784. { replace
  5785. subX const,%reg1
  5786. leaX (%reg1,%reg1,Y),%reg2 // Base or index might not be equal to reg1
  5787. dealloc %reg1
  5788. by
  5789. leaX -const-const*Y(%reg1,%reg1,Y),%reg2
  5790. }
  5791. if MatchOpType(taicpu(p),top_const,top_reg) then
  5792. begin
  5793. ActiveReg := taicpu(p).oper[1]^.reg;
  5794. { Ensures the entire register was updated }
  5795. if (taicpu(p).opsize >= S_L) and
  5796. GetNextInstructionUsingReg(p,hp1, ActiveReg) and
  5797. MatchInstruction(hp1,A_LEA,[]) and
  5798. (SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.base) or
  5799. SuperRegistersEqual(ActiveReg, taicpu(hp1).oper[0]^.ref^.index)) and
  5800. (
  5801. { Cover the case where the register in the reference is also the destination register }
  5802. Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, ActiveReg) or
  5803. (
  5804. { Try to avoid the expensive check of RegUsedAfterInstruction if we know it will return False }
  5805. not SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ActiveReg) and
  5806. RegDeallocated
  5807. )
  5808. ) then
  5809. begin
  5810. OldOffset := taicpu(hp1).oper[0]^.ref^.offset;
  5811. if ActiveReg=taicpu(hp1).oper[0]^.ref^.base then
  5812. Dec(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val);
  5813. if ActiveReg=taicpu(hp1).oper[0]^.ref^.index then
  5814. Dec(taicpu(hp1).oper[0]^.ref^.offset,taicpu(p).oper[0]^.val*max(taicpu(hp1).oper[0]^.ref^.scalefactor,1));
  5815. {$ifdef x86_64}
  5816. if (taicpu(hp1).oper[0]^.ref^.offset > $7FFFFFFF) or (taicpu(hp1).oper[0]^.ref^.offset < -2147483648) then
  5817. begin
  5818. { Overflow; abort }
  5819. taicpu(hp1).oper[0]^.ref^.offset := OldOffset;
  5820. end
  5821. else
  5822. {$endif x86_64}
  5823. begin
  5824. DebugMsg(SPeepholeOptimization + 'SubLea2Lea done',p);
  5825. if not (cs_opt_level3 in current_settings.optimizerswitches) then
  5826. { hp1 is the immediate next instruction for sure - good for a quick speed boost }
  5827. RemoveCurrentP(p, hp1)
  5828. else
  5829. RemoveCurrentP(p);
  5830. result:=true;
  5831. Exit;
  5832. end;
  5833. end;
  5834. if (
  5835. { Save calling GetNextInstructionUsingReg again }
  5836. Assigned(hp1) or
  5837. GetNextInstructionUsingReg(p,hp1, ActiveReg)
  5838. ) and
  5839. MatchInstruction(hp1,A_SUB,[taicpu(p).opsize]) and
  5840. (taicpu(hp1).oper[1]^.reg = ActiveReg) then
  5841. begin
  5842. if taicpu(hp1).oper[0]^.typ = top_const then
  5843. begin
  5844. { Merge add const1,%reg; add const2,%reg to add const1+const2,%reg }
  5845. ThisConst := taicpu(p).oper[0]^.val + taicpu(hp1).oper[0]^.val;
  5846. Result := True;
  5847. { Handle any overflows }
  5848. case taicpu(p).opsize of
  5849. S_B:
  5850. taicpu(p).oper[0]^.val := ThisConst and $FF;
  5851. S_W:
  5852. taicpu(p).oper[0]^.val := ThisConst and $FFFF;
  5853. S_L:
  5854. taicpu(p).oper[0]^.val := ThisConst and $FFFFFFFF;
  5855. {$ifdef x86_64}
  5856. S_Q:
  5857. if (ThisConst > $7FFFFFFF) or (ThisConst < -2147483648) then
  5858. { Overflow; abort }
  5859. Result := False
  5860. else
  5861. taicpu(p).oper[0]^.val := ThisConst;
  5862. {$endif x86_64}
  5863. else
  5864. InternalError(2021102611);
  5865. end;
  5866. { Result may get set to False again if the combined immediate overflows for S_Q sizes }
  5867. if Result then
  5868. begin
  5869. if (taicpu(p).oper[0]^.val < 0) and
  5870. (
  5871. ((taicpu(p).opsize = S_B) and (taicpu(p).oper[0]^.val <> -128)) or
  5872. ((taicpu(p).opsize = S_W) and (taicpu(p).oper[0]^.val <> -32768)) or
  5873. ((taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) and (taicpu(p).oper[0]^.val <> -2147483648))
  5874. ) then
  5875. begin
  5876. DebugMsg(SPeepholeOptimization + 'SUB; ADD/SUB -> ADD',p);
  5877. taicpu(p).opcode := A_SUB;
  5878. taicpu(p).oper[0]^.val := -taicpu(p).oper[0]^.val;
  5879. end
  5880. else
  5881. DebugMsg(SPeepholeOptimization + 'SUB; ADD/SUB -> SUB',p);
  5882. RemoveInstruction(hp1);
  5883. end;
  5884. end
  5885. else
  5886. begin
  5887. { Make doubly sure the flags aren't in use because the order of subtractions may affect them }
  5888. TransferUsedRegs(TmpUsedRegs);
  5889. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  5890. hp2 := p;
  5891. while not (cs_opt_level3 in current_settings.optimizerswitches) and
  5892. GetNextInstruction(hp2, hp2) and (hp2 <> hp1) do
  5893. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  5894. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  5895. begin
  5896. { Move the constant subtraction to after the reg/ref addition to improve optimisation }
  5897. DebugMsg(SPeepholeOptimization + 'Add/sub swap 1b done',p);
  5898. Asml.Remove(p);
  5899. Asml.InsertAfter(p, hp1);
  5900. p := hp1;
  5901. Result := True;
  5902. Exit;
  5903. end;
  5904. end;
  5905. end;
  5906. { * change "subl $2, %esp; pushw x" to "pushl x"}
  5907. { * change "sub/add const1, reg" or "dec reg" followed by
  5908. "sub const2, reg" to one "sub ..., reg" }
  5909. {$ifdef i386}
  5910. if (taicpu(p).oper[0]^.val = 2) and
  5911. (ActiveReg = NR_ESP) and
  5912. { Don't do the sub/push optimization if the sub }
  5913. { comes from setting up the stack frame (JM) }
  5914. (not(GetLastInstruction(p,hp1)) or
  5915. not(MatchInstruction(hp1,A_MOV,[S_L]) and
  5916. MatchOperand(taicpu(hp1).oper[0]^,NR_ESP) and
  5917. MatchOperand(taicpu(hp1).oper[0]^,NR_EBP))) then
  5918. begin
  5919. hp1 := tai(p.next);
  5920. while Assigned(hp1) and
  5921. (tai(hp1).typ in [ait_instruction]+SkipInstr) and
  5922. not RegReadByInstruction(NR_ESP,hp1) and
  5923. not RegModifiedByInstruction(NR_ESP,hp1) do
  5924. hp1 := tai(hp1.next);
  5925. if Assigned(hp1) and
  5926. MatchInstruction(hp1,A_PUSH,[S_W]) then
  5927. begin
  5928. taicpu(hp1).changeopsize(S_L);
  5929. if taicpu(hp1).oper[0]^.typ=top_reg then
  5930. setsubreg(taicpu(hp1).oper[0]^.reg,R_SUBWHOLE);
  5931. hp1 := tai(p.next);
  5932. RemoveCurrentp(p, hp1);
  5933. Result:=true;
  5934. exit;
  5935. end;
  5936. end;
  5937. {$endif i386}
  5938. if DoArithCombineOpt(p) then
  5939. Result:=true;
  5940. end;
  5941. end;
  5942. function TX86AsmOptimizer.OptPass1SHLSAL(var p : tai) : boolean;
  5943. var
  5944. TmpBool1,TmpBool2 : Boolean;
  5945. tmpref : treference;
  5946. hp1,hp2: tai;
  5947. mask, shiftval: tcgint;
  5948. begin
  5949. Result:=false;
  5950. { All these optimisations work on "shl/sal const,%reg" }
  5951. if not MatchOpType(taicpu(p),top_const,top_reg) then
  5952. Exit;
  5953. if (taicpu(p).opsize in [S_L{$ifdef x86_64},S_Q{$endif x86_64}]) and
  5954. (taicpu(p).oper[0]^.val <= 3) then
  5955. { Changes "shl const, %reg32; add const/reg, %reg32" to one lea statement }
  5956. begin
  5957. { should we check the next instruction? }
  5958. TmpBool1 := True;
  5959. { have we found an add/sub which could be
  5960. integrated in the lea? }
  5961. TmpBool2 := False;
  5962. reference_reset(tmpref,2,[]);
  5963. TmpRef.index := taicpu(p).oper[1]^.reg;
  5964. TmpRef.scalefactor := 1 shl taicpu(p).oper[0]^.val;
  5965. while TmpBool1 and
  5966. GetNextInstruction(p, hp1) and
  5967. (tai(hp1).typ = ait_instruction) and
  5968. ((((taicpu(hp1).opcode = A_ADD) or
  5969. (taicpu(hp1).opcode = A_SUB)) and
  5970. (taicpu(hp1).oper[1]^.typ = Top_Reg) and
  5971. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg)) or
  5972. (((taicpu(hp1).opcode = A_INC) or
  5973. (taicpu(hp1).opcode = A_DEC)) and
  5974. (taicpu(hp1).oper[0]^.typ = Top_Reg) and
  5975. (taicpu(hp1).oper[0]^.reg = taicpu(p).oper[1]^.reg)) or
  5976. ((taicpu(hp1).opcode = A_LEA) and
  5977. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  5978. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg))) and
  5979. (not GetNextInstruction(hp1,hp2) or
  5980. not instrReadsFlags(hp2)) Do
  5981. begin
  5982. TmpBool1 := False;
  5983. if taicpu(hp1).opcode=A_LEA then
  5984. begin
  5985. if (TmpRef.base = NR_NO) and
  5986. (taicpu(hp1).oper[0]^.ref^.symbol=nil) and
  5987. (taicpu(hp1).oper[0]^.ref^.relsymbol=nil) and
  5988. { Segment register isn't a concern here }
  5989. ((taicpu(hp1).oper[0]^.ref^.scalefactor=0) or
  5990. (taicpu(hp1).oper[0]^.ref^.scalefactor*tmpref.scalefactor<=8)) then
  5991. begin
  5992. TmpBool1 := True;
  5993. TmpBool2 := True;
  5994. inc(TmpRef.offset, taicpu(hp1).oper[0]^.ref^.offset);
  5995. if taicpu(hp1).oper[0]^.ref^.scalefactor<>0 then
  5996. tmpref.scalefactor:=tmpref.scalefactor*taicpu(hp1).oper[0]^.ref^.scalefactor;
  5997. TmpRef.base := taicpu(hp1).oper[0]^.ref^.base;
  5998. RemoveInstruction(hp1);
  5999. end
  6000. end
  6001. else if (taicpu(hp1).oper[0]^.typ = Top_Const) then
  6002. begin
  6003. TmpBool1 := True;
  6004. TmpBool2 := True;
  6005. case taicpu(hp1).opcode of
  6006. A_ADD:
  6007. inc(TmpRef.offset, longint(taicpu(hp1).oper[0]^.val));
  6008. A_SUB:
  6009. dec(TmpRef.offset, longint(taicpu(hp1).oper[0]^.val));
  6010. else
  6011. internalerror(2019050536);
  6012. end;
  6013. RemoveInstruction(hp1);
  6014. end
  6015. else
  6016. if (taicpu(hp1).oper[0]^.typ = Top_Reg) and
  6017. (((taicpu(hp1).opcode = A_ADD) and
  6018. (TmpRef.base = NR_NO)) or
  6019. (taicpu(hp1).opcode = A_INC) or
  6020. (taicpu(hp1).opcode = A_DEC)) then
  6021. begin
  6022. TmpBool1 := True;
  6023. TmpBool2 := True;
  6024. case taicpu(hp1).opcode of
  6025. A_ADD:
  6026. TmpRef.base := taicpu(hp1).oper[0]^.reg;
  6027. A_INC:
  6028. inc(TmpRef.offset);
  6029. A_DEC:
  6030. dec(TmpRef.offset);
  6031. else
  6032. internalerror(2019050535);
  6033. end;
  6034. RemoveInstruction(hp1);
  6035. end;
  6036. end;
  6037. if TmpBool2
  6038. {$ifndef x86_64}
  6039. or
  6040. ((current_settings.optimizecputype < cpu_Pentium2) and
  6041. (taicpu(p).oper[0]^.val <= 3) and
  6042. not(cs_opt_size in current_settings.optimizerswitches))
  6043. {$endif x86_64}
  6044. then
  6045. begin
  6046. if not(TmpBool2) and
  6047. (taicpu(p).oper[0]^.val=1) then
  6048. begin
  6049. taicpu(p).opcode := A_ADD;
  6050. taicpu(p).loadreg(0, taicpu(p).oper[1]^.reg);
  6051. end
  6052. else
  6053. begin
  6054. taicpu(p).opcode := A_LEA;
  6055. taicpu(p).loadref(0, TmpRef);
  6056. end;
  6057. DebugMsg(SPeepholeOptimization + 'ShlAddLeaSubIncDec2Lea',p);
  6058. Result := True;
  6059. end;
  6060. end
  6061. {$ifndef x86_64}
  6062. else if (current_settings.optimizecputype < cpu_Pentium2) then
  6063. begin
  6064. { changes "shl $1, %reg" to "add %reg, %reg", which is the same on a 386,
  6065. but faster on a 486, and Tairable in both U and V pipes on the Pentium
  6066. (unlike shl, which is only Tairable in the U pipe) }
  6067. if taicpu(p).oper[0]^.val=1 then
  6068. begin
  6069. taicpu(p).opcode := A_ADD;
  6070. taicpu(p).loadreg(0, taicpu(p).oper[1]^.reg);
  6071. Result := True;
  6072. end
  6073. { changes "shl $2, %reg" to "lea (,%reg,4), %reg"
  6074. "shl $3, %reg" to "lea (,%reg,8), %reg }
  6075. else if (taicpu(p).opsize = S_L) and
  6076. (taicpu(p).oper[0]^.val<= 3) then
  6077. begin
  6078. reference_reset(tmpref,2,[]);
  6079. TmpRef.index := taicpu(p).oper[1]^.reg;
  6080. TmpRef.scalefactor := 1 shl taicpu(p).oper[0]^.val;
  6081. taicpu(p).opcode := A_LEA;
  6082. taicpu(p).loadref(0, TmpRef);
  6083. Result := True;
  6084. end;
  6085. end
  6086. {$endif x86_64}
  6087. else if
  6088. GetNextInstruction(p, hp1) and (hp1.typ = ait_instruction) and MatchOpType(taicpu(hp1), top_const, top_reg) and
  6089. (
  6090. (
  6091. MatchInstruction(hp1, A_AND, [taicpu(p).opsize]) and
  6092. SetAndTest(hp1, hp2)
  6093. {$ifdef x86_64}
  6094. ) or
  6095. (
  6096. MatchInstruction(hp1, A_MOV, [taicpu(p).opsize]) and
  6097. GetNextInstruction(hp1, hp2) and
  6098. MatchInstruction(hp2, A_AND, [taicpu(p).opsize]) and
  6099. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  6100. (taicpu(hp1).oper[1]^.reg = taicpu(hp2).oper[0]^.reg)
  6101. {$endif x86_64}
  6102. )
  6103. ) and
  6104. (taicpu(p).oper[1]^.reg = taicpu(hp2).oper[1]^.reg) then
  6105. begin
  6106. { Change:
  6107. shl x, %reg1
  6108. mov -(1<<x), %reg2
  6109. and %reg2, %reg1
  6110. Or:
  6111. shl x, %reg1
  6112. and -(1<<x), %reg1
  6113. To just:
  6114. shl x, %reg1
  6115. Since the and operation only zeroes bits that are already zero from the shl operation
  6116. }
  6117. case taicpu(p).oper[0]^.val of
  6118. 8:
  6119. mask:=$FFFFFFFFFFFFFF00;
  6120. 16:
  6121. mask:=$FFFFFFFFFFFF0000;
  6122. 32:
  6123. mask:=$FFFFFFFF00000000;
  6124. 63:
  6125. { Constant pre-calculated to prevent overflow errors with Int64 }
  6126. mask:=$8000000000000000;
  6127. else
  6128. begin
  6129. if taicpu(p).oper[0]^.val >= 64 then
  6130. { Shouldn't happen realistically, since the register
  6131. is guaranteed to be set to zero at this point }
  6132. mask := 0
  6133. else
  6134. mask := -(Int64(1 shl taicpu(p).oper[0]^.val));
  6135. end;
  6136. end;
  6137. if taicpu(hp1).oper[0]^.val = mask then
  6138. begin
  6139. { Everything checks out, perform the optimisation, as long as
  6140. the FLAGS register isn't being used}
  6141. TransferUsedRegs(TmpUsedRegs);
  6142. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  6143. {$ifdef x86_64}
  6144. if (hp1 <> hp2) then
  6145. begin
  6146. { "shl/mov/and" version }
  6147. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  6148. { Don't do the optimisation if the FLAGS register is in use }
  6149. if not(RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp2, TmpUsedRegs)) then
  6150. begin
  6151. DebugMsg(SPeepholeOptimization + 'ShlMovAnd2Shl', p);
  6152. { Don't remove the 'mov' instruction if its register is used elsewhere }
  6153. if not(RegUsedAfterInstruction(taicpu(hp1).oper[1]^.reg, hp2, TmpUsedRegs)) then
  6154. begin
  6155. RemoveInstruction(hp1);
  6156. Result := True;
  6157. end;
  6158. { Only set Result to True if the 'mov' instruction was removed }
  6159. RemoveInstruction(hp2);
  6160. end;
  6161. end
  6162. else
  6163. {$endif x86_64}
  6164. begin
  6165. { "shl/and" version }
  6166. { Don't do the optimisation if the FLAGS register is in use }
  6167. if not(RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)) then
  6168. begin
  6169. DebugMsg(SPeepholeOptimization + 'ShlAnd2Shl', p);
  6170. RemoveInstruction(hp1);
  6171. Result := True;
  6172. end;
  6173. end;
  6174. Exit;
  6175. end
  6176. else {$ifdef x86_64}if (hp1 = hp2) then{$endif x86_64}
  6177. begin
  6178. { Even if the mask doesn't allow for its removal, we might be
  6179. able to optimise the mask for the "shl/and" version, which
  6180. may permit other peephole optimisations }
  6181. {$ifdef DEBUG_AOPTCPU}
  6182. mask := taicpu(hp1).oper[0]^.val and mask;
  6183. if taicpu(hp1).oper[0]^.val <> mask then
  6184. begin
  6185. DebugMsg(
  6186. SPeepholeOptimization +
  6187. 'Changed mask from $' + debug_tostr(taicpu(hp1).oper[0]^.val) +
  6188. ' to $' + debug_tostr(mask) +
  6189. 'based on previous instruction (ShlAnd2ShlAnd)', hp1);
  6190. taicpu(hp1).oper[0]^.val := mask;
  6191. end;
  6192. {$else DEBUG_AOPTCPU}
  6193. { If debugging is off, just set the operand even if it's the same }
  6194. taicpu(hp1).oper[0]^.val := taicpu(hp1).oper[0]^.val and mask;
  6195. {$endif DEBUG_AOPTCPU}
  6196. end;
  6197. end;
  6198. {
  6199. change
  6200. shl/sal const,reg
  6201. <op> ...(...,reg,1),...
  6202. into
  6203. <op> ...(...,reg,1 shl const),...
  6204. if const in 1..3
  6205. }
  6206. if MatchOpType(taicpu(p), top_const, top_reg) and
  6207. (taicpu(p).oper[0]^.val in [1..3]) and
  6208. GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg) and
  6209. ((MatchInstruction(hp1,A_MOV,A_LEA,[]) and
  6210. MatchOpType(taicpu(hp1),top_ref,top_reg)) or
  6211. (MatchInstruction(hp1,A_FST,A_FSTP,A_FLD,[]) and
  6212. MatchOpType(taicpu(hp1),top_ref))
  6213. ) and
  6214. (taicpu(p).oper[1]^.reg=taicpu(hp1).oper[0]^.ref^.index) and
  6215. (taicpu(p).oper[1]^.reg<>taicpu(hp1).oper[0]^.ref^.base) and
  6216. (taicpu(hp1).oper[0]^.ref^.scalefactor in [0,1]) then
  6217. begin
  6218. TransferUsedRegs(TmpUsedRegs);
  6219. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  6220. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs)) then
  6221. begin
  6222. taicpu(hp1).oper[0]^.ref^.scalefactor:=1 shl taicpu(p).oper[0]^.val;
  6223. DebugMsg(SPeepholeOptimization + 'ShlOp2Op', p);
  6224. RemoveCurrentP(p);
  6225. Result:=true;
  6226. exit;
  6227. end;
  6228. end;
  6229. if MatchOpType(taicpu(p), top_const, top_reg) and
  6230. GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[1]^.reg) and
  6231. MatchInstruction(hp1,A_SHL,[taicpu(p).opsize]) and
  6232. MatchOpType(taicpu(hp1),top_const,top_reg) and
  6233. (taicpu(p).oper[1]^.reg=taicpu(hp1).oper[1]^.reg) then
  6234. begin
  6235. shiftval:=taicpu(p).oper[0]^.val+taicpu(hp1).oper[0]^.val;
  6236. if ((taicpu(p).opsize=S_B) and (shiftval>7)) or
  6237. ((taicpu(p).opsize=S_W) and (shiftval>15)) or
  6238. {$ifdef x86_64}
  6239. ((taicpu(p).opsize=S_Q) and (shiftval>63)) or
  6240. {$endif x86_64}
  6241. ((taicpu(p).opsize=S_L) and (shiftval>31)) then
  6242. begin
  6243. DebugMsg(SPeepholeOptimization + 'ShlShl2Mov', p);
  6244. taicpu(hp1).opcode:=A_MOV;
  6245. taicpu(hp1).oper[0]^.val:=0;
  6246. end
  6247. else
  6248. begin
  6249. DebugMsg(SPeepholeOptimization + 'ShlShl2Shl', p);
  6250. taicpu(hp1).oper[0]^.val:=shiftval;
  6251. end;
  6252. RemoveCurrentP(p);
  6253. Result:=true;
  6254. exit;
  6255. end;
  6256. end;
  6257. class function TX86AsmOptimizer.IsShrMovZFoldable(shr_size, movz_size: topsize; Shift: TCGInt): Boolean;
  6258. begin
  6259. case shr_size of
  6260. S_B:
  6261. { No valid combinations }
  6262. Result := False;
  6263. S_W:
  6264. Result := (Shift >= 8) and (movz_size = S_BW);
  6265. S_L:
  6266. Result :=
  6267. (Shift >= 24) { Any opsize is valid for this shift } or
  6268. ((Shift >= 16) and (movz_size = S_WL));
  6269. {$ifdef x86_64}
  6270. S_Q:
  6271. Result :=
  6272. (Shift >= 56) { Any opsize is valid for this shift } or
  6273. ((Shift >= 48) and (movz_size = S_WL));
  6274. {$endif x86_64}
  6275. else
  6276. InternalError(2022081510);
  6277. end;
  6278. end;
  6279. function TX86AsmOptimizer.OptPass1SHR(var p : tai) : boolean;
  6280. var
  6281. hp1, hp2: tai;
  6282. Shift: TCGInt;
  6283. LimitSize: Topsize;
  6284. DoNotMerge: Boolean;
  6285. begin
  6286. Result := False;
  6287. { All these optimisations work on "shr const,%reg" }
  6288. if not MatchOpType(taicpu(p), top_const, top_reg) then
  6289. Exit;
  6290. DoNotMerge := False;
  6291. Shift := taicpu(p).oper[0]^.val;
  6292. LimitSize := taicpu(p).opsize;
  6293. hp1 := p;
  6294. repeat
  6295. if not GetNextInstructionUsingReg(hp1, hp1, taicpu(p).oper[1]^.reg) or (hp1.typ <> ait_instruction) then
  6296. Exit;
  6297. case taicpu(hp1).opcode of
  6298. A_TEST, A_CMP, A_Jcc:
  6299. { Skip over conditional jumps and relevant comparisons }
  6300. Continue;
  6301. A_MOVZX:
  6302. if MatchOpType(taicpu(hp1), top_reg, top_reg) and
  6303. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(p).oper[1]^.reg) then
  6304. begin
  6305. { Since the original register is being read as is, subsequent
  6306. SHRs must not be merged at this point }
  6307. DoNotMerge := True;
  6308. if IsShrMovZFoldable(taicpu(p).opsize, taicpu(hp1).opsize, Shift) then
  6309. begin
  6310. if not SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then { Different register target }
  6311. begin
  6312. DebugMsg(SPeepholeOptimization + 'Converted MOVZX instruction to MOV since previous SHR makes zero-extension unnecessary (ShrMovz2ShrMov 1)', hp1);
  6313. taicpu(hp1).opcode := A_MOV;
  6314. setsubreg(taicpu(hp1).oper[0]^.reg, getsubreg(taicpu(hp1).oper[1]^.reg));
  6315. case taicpu(hp1).opsize of
  6316. S_BW:
  6317. taicpu(hp1).opsize := S_W;
  6318. S_BL, S_WL:
  6319. taicpu(hp1).opsize := S_L;
  6320. else
  6321. InternalError(2022081503);
  6322. end;
  6323. { p itself hasn't changed, so no need to set Result to True }
  6324. Include(OptsToCheck, aoc_ForceNewIteration);
  6325. { See if there's anything afterwards that can be
  6326. optimised, since the input register hasn't changed }
  6327. Continue;
  6328. end;
  6329. { NOTE: If the MOVZX instruction reads and writes the same
  6330. register, defer this to the post-peephole optimisation stage }
  6331. Exit;
  6332. end;
  6333. end;
  6334. A_SHL, A_SAL, A_SHR:
  6335. if (taicpu(hp1).opsize <= LimitSize) and
  6336. MatchOpType(taicpu(hp1), top_const, top_reg) and
  6337. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[1]^.reg) then
  6338. begin
  6339. { Make sure the sizes don't exceed the register size limit
  6340. (measured by the shift value falling below the limit) }
  6341. if taicpu(hp1).opsize < LimitSize then
  6342. LimitSize := taicpu(hp1).opsize;
  6343. if taicpu(hp1).opcode = A_SHR then
  6344. Inc(Shift, taicpu(hp1).oper[0]^.val)
  6345. else
  6346. begin
  6347. Dec(Shift, taicpu(hp1).oper[0]^.val);
  6348. DoNotMerge := True;
  6349. end;
  6350. if Shift < topsize2memsize[taicpu(p).opsize] - topsize2memsize[LimitSize] then
  6351. Exit;
  6352. { Since we've established that the combined shift is within
  6353. limits, we can actually combine the adjacent SHR
  6354. instructions even if they're different sizes }
  6355. if not DoNotMerge and (taicpu(hp1).opcode = A_SHR) then
  6356. begin
  6357. hp2 := tai(hp1.Previous);
  6358. DebugMsg(SPeepholeOptimization + 'ShrShr2Shr 1', p);
  6359. Inc(taicpu(p).oper[0]^.val, taicpu(hp1).oper[0]^.val);
  6360. RemoveInstruction(hp1);
  6361. hp1 := hp2;
  6362. { Though p has changed, only the constant has, and its
  6363. effects can still be detected on the next iteration of
  6364. the repeat..until loop }
  6365. Include(OptsToCheck, aoc_ForceNewIteration);
  6366. end;
  6367. { Move onto the next instruction }
  6368. Continue;
  6369. end;
  6370. else
  6371. ;
  6372. end;
  6373. Break;
  6374. until False;
  6375. end;
  6376. function TX86AsmOptimizer.CheckMemoryWrite(var first_mov, second_mov: taicpu): Boolean;
  6377. var
  6378. CurrentRef: TReference;
  6379. FullReg: TRegister;
  6380. hp1, hp2: tai;
  6381. begin
  6382. Result := False;
  6383. if (first_mov.opsize <> S_B) or (second_mov.opsize <> S_B) then
  6384. Exit;
  6385. { We assume you've checked if the operand is actually a reference by
  6386. this point. If it isn't, you'll most likely get an access violation }
  6387. CurrentRef := first_mov.oper[1]^.ref^;
  6388. { Memory must be aligned }
  6389. if (CurrentRef.offset mod 4) <> 0 then
  6390. Exit;
  6391. Inc(CurrentRef.offset);
  6392. CurrentRef.alignment := 1; { Otherwise references_equal will return False }
  6393. if MatchOperand(second_mov.oper[0]^, 0) and
  6394. references_equal(second_mov.oper[1]^.ref^, CurrentRef) and
  6395. GetNextInstruction(second_mov, hp1) and
  6396. (hp1.typ = ait_instruction) and
  6397. (taicpu(hp1).opcode = A_MOV) and
  6398. MatchOpType(taicpu(hp1), top_const, top_ref) and
  6399. (taicpu(hp1).oper[0]^.val = 0) then
  6400. begin
  6401. Inc(CurrentRef.offset);
  6402. CurrentRef.alignment := taicpu(hp1).oper[1]^.ref^.alignment; { Otherwise references_equal might return False }
  6403. FullReg := newreg(R_INTREGISTER,getsupreg(first_mov.oper[0]^.reg), R_SUBD);
  6404. if references_equal(taicpu(hp1).oper[1]^.ref^, CurrentRef) then
  6405. begin
  6406. case taicpu(hp1).opsize of
  6407. S_B:
  6408. if GetNextInstruction(hp1, hp2) and
  6409. MatchInstruction(taicpu(hp2), A_MOV, [S_B]) and
  6410. MatchOpType(taicpu(hp2), top_const, top_ref) and
  6411. (taicpu(hp2).oper[0]^.val = 0) then
  6412. begin
  6413. Inc(CurrentRef.offset);
  6414. CurrentRef.alignment := 1; { Otherwise references_equal will return False }
  6415. if references_equal(taicpu(hp2).oper[1]^.ref^, CurrentRef) and
  6416. (taicpu(hp2).opsize = S_B) then
  6417. begin
  6418. RemoveInstruction(hp1);
  6419. RemoveInstruction(hp2);
  6420. first_mov.opsize := S_L;
  6421. if first_mov.oper[0]^.typ = top_reg then
  6422. begin
  6423. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVb/MOVb -> MOVZX/MOVl', first_mov);
  6424. { Reuse second_mov as a MOVZX instruction }
  6425. second_mov.opcode := A_MOVZX;
  6426. second_mov.opsize := S_BL;
  6427. second_mov.loadreg(0, first_mov.oper[0]^.reg);
  6428. second_mov.loadreg(1, FullReg);
  6429. first_mov.oper[0]^.reg := FullReg;
  6430. asml.Remove(second_mov);
  6431. asml.InsertBefore(second_mov, first_mov);
  6432. end
  6433. else
  6434. { It's a value }
  6435. begin
  6436. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVb/MOVb -> MOVl', first_mov);
  6437. RemoveInstruction(second_mov);
  6438. end;
  6439. Result := True;
  6440. Exit;
  6441. end;
  6442. end;
  6443. S_W:
  6444. begin
  6445. RemoveInstruction(hp1);
  6446. first_mov.opsize := S_L;
  6447. if first_mov.oper[0]^.typ = top_reg then
  6448. begin
  6449. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVw -> MOVZX/MOVl', first_mov);
  6450. { Reuse second_mov as a MOVZX instruction }
  6451. second_mov.opcode := A_MOVZX;
  6452. second_mov.opsize := S_BL;
  6453. second_mov.loadreg(0, first_mov.oper[0]^.reg);
  6454. second_mov.loadreg(1, FullReg);
  6455. first_mov.oper[0]^.reg := FullReg;
  6456. asml.Remove(second_mov);
  6457. asml.InsertBefore(second_mov, first_mov);
  6458. end
  6459. else
  6460. { It's a value }
  6461. begin
  6462. DebugMsg(SPeepholeOptimization + 'MOVb/MOVb/MOVw -> MOVl', first_mov);
  6463. RemoveInstruction(second_mov);
  6464. end;
  6465. Result := True;
  6466. Exit;
  6467. end;
  6468. else
  6469. ;
  6470. end;
  6471. end;
  6472. end;
  6473. end;
  6474. function TX86AsmOptimizer.OptPass1FSTP(var p: tai): boolean;
  6475. { returns true if a "continue" should be done after this optimization }
  6476. var
  6477. hp1, hp2, hp3: tai;
  6478. begin
  6479. Result := false;
  6480. hp3 := nil;
  6481. if MatchOpType(taicpu(p),top_ref) and
  6482. GetNextInstruction(p, hp1) and
  6483. (hp1.typ = ait_instruction) and
  6484. (((taicpu(hp1).opcode = A_FLD) and
  6485. (taicpu(p).opcode = A_FSTP)) or
  6486. ((taicpu(p).opcode = A_FISTP) and
  6487. (taicpu(hp1).opcode = A_FILD))) and
  6488. MatchOpType(taicpu(hp1),top_ref) and
  6489. (taicpu(hp1).opsize = taicpu(p).opsize) and
  6490. RefsEqual(taicpu(p).oper[0]^.ref^, taicpu(hp1).oper[0]^.ref^) then
  6491. begin
  6492. { replacing fstp f;fld f by fst f is only valid for extended because of rounding or if fastmath is on }
  6493. if ((taicpu(p).opsize=S_FX) or (cs_opt_fastmath in current_settings.optimizerswitches)) and
  6494. GetNextInstruction(hp1, hp2) and
  6495. (((hp2.typ = ait_instruction) and
  6496. IsExitCode(hp2) and
  6497. (taicpu(p).oper[0]^.ref^.base = current_procinfo.FramePointer) and
  6498. not(assigned(current_procinfo.procdef.funcretsym) and
  6499. (taicpu(p).oper[0]^.ref^.offset < tabstractnormalvarsym(current_procinfo.procdef.funcretsym).localloc.reference.offset)) and
  6500. (taicpu(p).oper[0]^.ref^.index = NR_NO)) or
  6501. { fstp <temp>
  6502. fld <temp>
  6503. <dealloc> <temp>
  6504. }
  6505. ((taicpu(p).oper[0]^.ref^.base = current_procinfo.FramePointer) and
  6506. (taicpu(p).oper[0]^.ref^.index = NR_NO) and
  6507. SetAndTest(FindTempDeAlloc(taicpu(p).oper[0]^.ref^.offset,tai(hp1.next)),hp2) and
  6508. (tai_tempalloc(hp2).temppos=taicpu(p).oper[0]^.ref^.offset) and
  6509. (((taicpu(p).opsize=S_FX) and (tai_tempalloc(hp2).tempsize=16)) or
  6510. ((taicpu(p).opsize in [S_IQ,S_FL]) and (tai_tempalloc(hp2).tempsize=8)) or
  6511. ((taicpu(p).opsize=S_FS) and (tai_tempalloc(hp2).tempsize=4))
  6512. )
  6513. )
  6514. ) then
  6515. begin
  6516. DebugMsg(SPeepholeOptimization + 'FstpFld2<Nop>',p);
  6517. RemoveInstruction(hp1);
  6518. RemoveCurrentP(p, hp2);
  6519. { first case: exit code }
  6520. if hp2.typ = ait_instruction then
  6521. RemoveLastDeallocForFuncRes(p);
  6522. Result := true;
  6523. end
  6524. else
  6525. { we can do this only in fast math mode as fstp is rounding ...
  6526. ... still disabled as it breaks the compiler and/or rtl }
  6527. if { (cs_opt_fastmath in current_settings.optimizerswitches) or }
  6528. { ... or if another fstp equal to the first one follows }
  6529. GetNextInstruction(hp1,hp2) and
  6530. (hp2.typ = ait_instruction) and
  6531. (taicpu(p).opcode=taicpu(hp2).opcode) and
  6532. (taicpu(p).opsize=taicpu(hp2).opsize) then
  6533. begin
  6534. if (taicpu(p).oper[0]^.ref^.base = current_procinfo.FramePointer) and
  6535. (taicpu(p).oper[0]^.ref^.index = NR_NO) and
  6536. SetAndTest(FindTempDeAlloc(taicpu(p).oper[0]^.ref^.offset,tai(hp2.next)),hp3) and
  6537. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[0]^) and
  6538. (tai_tempalloc(hp3).temppos=taicpu(p).oper[0]^.ref^.offset) and
  6539. (((taicpu(p).opsize=S_FX) and (tai_tempalloc(hp3).tempsize=16)) or
  6540. ((taicpu(p).opsize in [S_IQ,S_FL]) and (tai_tempalloc(hp3).tempsize=8)) or
  6541. ((taicpu(p).opsize=S_FS) and (tai_tempalloc(hp3).tempsize=4))
  6542. ) then
  6543. begin
  6544. DebugMsg(SPeepholeOptimization + 'FstpFldFstp2Fstp',p);
  6545. RemoveCurrentP(p,hp2);
  6546. RemoveInstruction(hp1);
  6547. Result := true;
  6548. end
  6549. else if { fst can't store an extended/comp value }
  6550. (taicpu(p).opsize <> S_FX) and
  6551. (taicpu(p).opsize <> S_IQ) then
  6552. begin
  6553. if (taicpu(p).opcode = A_FSTP) then
  6554. taicpu(p).opcode := A_FST
  6555. else
  6556. taicpu(p).opcode := A_FIST;
  6557. DebugMsg(SPeepholeOptimization + 'FstpFld2Fst',p);
  6558. RemoveInstruction(hp1);
  6559. Result := true;
  6560. end;
  6561. end;
  6562. end;
  6563. end;
  6564. function TX86AsmOptimizer.OptPass1FLD(var p : tai) : boolean;
  6565. var
  6566. hp1, hp2, hp3: tai;
  6567. begin
  6568. result:=false;
  6569. if MatchOpType(taicpu(p),top_reg) and
  6570. GetNextInstruction(p, hp1) and
  6571. (hp1.typ = Ait_Instruction) and
  6572. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  6573. (taicpu(hp1).oper[0]^.reg = NR_ST) and
  6574. (taicpu(hp1).oper[1]^.reg = NR_ST1) then
  6575. { change to
  6576. fld reg fxxx reg,st
  6577. fxxxp st, st1 (hp1)
  6578. Remark: non commutative operations must be reversed!
  6579. }
  6580. begin
  6581. case taicpu(hp1).opcode Of
  6582. A_FMULP,A_FADDP,
  6583. A_FSUBP,A_FDIVP,A_FSUBRP,A_FDIVRP:
  6584. begin
  6585. case taicpu(hp1).opcode Of
  6586. A_FADDP: taicpu(hp1).opcode := A_FADD;
  6587. A_FMULP: taicpu(hp1).opcode := A_FMUL;
  6588. A_FSUBP: taicpu(hp1).opcode := A_FSUBR;
  6589. A_FSUBRP: taicpu(hp1).opcode := A_FSUB;
  6590. A_FDIVP: taicpu(hp1).opcode := A_FDIVR;
  6591. A_FDIVRP: taicpu(hp1).opcode := A_FDIV;
  6592. else
  6593. internalerror(2019050534);
  6594. end;
  6595. taicpu(hp1).oper[0]^.reg := taicpu(p).oper[0]^.reg;
  6596. taicpu(hp1).oper[1]^.reg := NR_ST;
  6597. DebugMsg(SPeepholeOptimization + 'FldF*p2F*',hp1);
  6598. RemoveCurrentP(p, hp1);
  6599. Result:=true;
  6600. exit;
  6601. end;
  6602. else
  6603. ;
  6604. end;
  6605. end
  6606. else
  6607. if MatchOpType(taicpu(p),top_ref) and
  6608. GetNextInstruction(p, hp2) and
  6609. (hp2.typ = Ait_Instruction) and
  6610. MatchOpType(taicpu(hp2),top_reg,top_reg) and
  6611. (taicpu(p).opsize in [S_FS, S_FL]) and
  6612. (taicpu(hp2).oper[0]^.reg = NR_ST) and
  6613. (taicpu(hp2).oper[1]^.reg = NR_ST1) then
  6614. if GetLastInstruction(p, hp1) and
  6615. MatchInstruction(hp1,A_FLD,A_FST,[taicpu(p).opsize]) and
  6616. MatchOpType(taicpu(hp1),top_ref) and
  6617. RefsEqual(taicpu(p).oper[0]^.ref^, taicpu(hp1).oper[0]^.ref^) then
  6618. if ((taicpu(hp2).opcode = A_FMULP) or
  6619. (taicpu(hp2).opcode = A_FADDP)) then
  6620. { change to
  6621. fld/fst mem1 (hp1) fld/fst mem1
  6622. fld mem1 (p) fadd/
  6623. faddp/ fmul st, st
  6624. fmulp st, st1 (hp2) }
  6625. begin
  6626. DebugMsg(SPeepholeOptimization + 'Fld/FstFldFaddp/Fmulp2Fld/FstFadd/Fmul',hp1);
  6627. RemoveCurrentP(p, hp1);
  6628. if (taicpu(hp2).opcode = A_FADDP) then
  6629. taicpu(hp2).opcode := A_FADD
  6630. else
  6631. taicpu(hp2).opcode := A_FMUL;
  6632. taicpu(hp2).oper[1]^.reg := NR_ST;
  6633. end
  6634. else
  6635. { change to
  6636. fld/fst mem1 (hp1) fld/fst mem1
  6637. fld mem1 (p) fld st
  6638. }
  6639. begin
  6640. DebugMsg(SPeepholeOptimization + 'Fld/Fst<mem>Fld<mem>2Fld/Fst<mem>Fld<reg>',hp1);
  6641. taicpu(p).changeopsize(S_FL);
  6642. taicpu(p).loadreg(0,NR_ST);
  6643. end
  6644. else
  6645. begin
  6646. case taicpu(hp2).opcode Of
  6647. A_FMULP,A_FADDP,A_FSUBP,A_FDIVP,A_FSUBRP,A_FDIVRP:
  6648. { change to
  6649. fld/fst mem1 (hp1) fld/fst mem1
  6650. fld mem2 (p) fxxx mem2
  6651. fxxxp st, st1 (hp2) }
  6652. begin
  6653. case taicpu(hp2).opcode Of
  6654. A_FADDP: taicpu(p).opcode := A_FADD;
  6655. A_FMULP: taicpu(p).opcode := A_FMUL;
  6656. A_FSUBP: taicpu(p).opcode := A_FSUBR;
  6657. A_FSUBRP: taicpu(p).opcode := A_FSUB;
  6658. A_FDIVP: taicpu(p).opcode := A_FDIVR;
  6659. A_FDIVRP: taicpu(p).opcode := A_FDIV;
  6660. else
  6661. internalerror(2019050533);
  6662. end;
  6663. DebugMsg(SPeepholeOptimization + 'Fld/FstFldF*2Fld/FstF*',p);
  6664. RemoveInstruction(hp2);
  6665. end
  6666. else
  6667. ;
  6668. end
  6669. end
  6670. end;
  6671. function IsCmpSubset(cond1, cond2: TAsmCond): Boolean; inline;
  6672. begin
  6673. Result := condition_in(cond1, cond2) or
  6674. { Not strictly subsets due to the actual flags checked, but because we're
  6675. comparing integers, E is a subset of AE and GE and their aliases }
  6676. ((cond1 in [C_E, C_Z]) and (cond2 in [C_AE, C_NB, C_NC, C_GE, C_NL]));
  6677. end;
  6678. function TX86AsmOptimizer.OptPass1Cmp(var p: tai): boolean;
  6679. var
  6680. v: TCGInt;
  6681. hp1, hp2, p_dist, p_jump, hp1_dist, p_label, hp1_label: tai;
  6682. FirstMatch, TempBool: Boolean;
  6683. NewReg: TRegister;
  6684. JumpLabel, JumpLabel_dist, JumpLabel_far: TAsmLabel;
  6685. begin
  6686. Result:=false;
  6687. { All these optimisations need a next instruction }
  6688. if not GetNextInstruction(p, hp1) then
  6689. Exit;
  6690. { Search for:
  6691. cmp ###,###
  6692. j(c1) @lbl1
  6693. ...
  6694. @lbl:
  6695. cmp ###,### (same comparison as above)
  6696. j(c2) @lbl2
  6697. If c1 is a subset of c2, change to:
  6698. cmp ###,###
  6699. j(c1) @lbl2
  6700. (@lbl1 may become a dead label as a result)
  6701. }
  6702. { Also handle cases where there are multiple jumps in a row }
  6703. p_jump := hp1;
  6704. while Assigned(p_jump) and MatchInstruction(p_jump, A_JCC, []) do
  6705. begin
  6706. if IsJumpToLabel(taicpu(p_jump)) then
  6707. begin
  6708. { Do jump optimisations first in case the condition becomes
  6709. unnecessary }
  6710. TempBool := True;
  6711. if DoJumpOptimizations(p_jump, TempBool) or
  6712. not TempBool then
  6713. begin
  6714. if Assigned(p_jump) then
  6715. begin
  6716. hp1 := p_jump;
  6717. if (p_jump.typ in [ait_align]) then
  6718. SkipAligns(p_jump, p_jump);
  6719. { CollapseZeroDistJump will be set to the label after the
  6720. jump if it optimises, whether or not it's live or dead }
  6721. if (p_jump.typ in [ait_label]) and
  6722. not (tai_label(p_jump).labsym.is_used) then
  6723. GetNextInstruction(p_jump, p_jump);
  6724. end;
  6725. TransferUsedRegs(TmpUsedRegs);
  6726. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  6727. if not Assigned(p_jump) or
  6728. (
  6729. not MatchInstruction(p_jump, A_Jcc, A_SETcc, A_CMOVcc, []) and
  6730. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, p_jump, TmpUsedRegs)
  6731. ) then
  6732. begin
  6733. { No more conditional jumps; conditional statement is no longer required }
  6734. DebugMsg(SPeepholeOptimization + 'Removed unnecessary condition (Cmp2Nop)', p);
  6735. RemoveCurrentP(p);
  6736. Result := True;
  6737. Exit;
  6738. end;
  6739. hp1 := p_jump;
  6740. Include(OptsToCheck, aoc_ForceNewIteration);
  6741. Continue;
  6742. end;
  6743. JumpLabel := TAsmLabel(taicpu(p_jump).oper[0]^.ref^.symbol);
  6744. if GetNextInstruction(p_jump, hp2) and
  6745. (
  6746. OptimizeConditionalJump(JumpLabel, p_jump, hp2, TempBool) or
  6747. not TempBool
  6748. ) then
  6749. begin
  6750. hp1 := p_jump;
  6751. Include(OptsToCheck, aoc_ForceNewIteration);
  6752. Continue;
  6753. end;
  6754. p_label := nil;
  6755. if Assigned(JumpLabel) then
  6756. p_label := getlabelwithsym(JumpLabel);
  6757. if Assigned(p_label) and
  6758. GetNextInstruction(p_label, p_dist) and
  6759. MatchInstruction(p_dist, A_CMP, []) and
  6760. MatchOperand(taicpu(p_dist).oper[0]^, taicpu(p).oper[0]^) and
  6761. MatchOperand(taicpu(p_dist).oper[1]^, taicpu(p).oper[1]^) and
  6762. GetNextInstruction(p_dist, hp1_dist) and
  6763. MatchInstruction(hp1_dist, A_JCC, []) then { This doesn't have to be an explicit label }
  6764. begin
  6765. JumpLabel_dist := TAsmLabel(taicpu(hp1_dist).oper[0]^.ref^.symbol);
  6766. if JumpLabel = JumpLabel_dist then
  6767. { This is an infinite loop }
  6768. Exit;
  6769. { Best optimisation when the first condition is a subset (or equal) of the second }
  6770. if IsCmpSubset(taicpu(p_jump).condition, taicpu(hp1_dist).condition) then
  6771. begin
  6772. { Any registers used here will already be allocated }
  6773. if Assigned(JumpLabel) then
  6774. JumpLabel.DecRefs;
  6775. DebugMsg(SPeepholeOptimization + 'CMP/Jcc/@Lbl/CMP/Jcc -> CMP/Jcc, redirecting first jump', p_jump);
  6776. taicpu(p_jump).loadref(0, taicpu(hp1_dist).oper[0]^.ref^); { This also increases the reference count }
  6777. Result := True;
  6778. { Don't exit yet. Since p and p_jump haven't actually been
  6779. removed, we can check for more on this iteration }
  6780. end
  6781. else if IsCmpSubset(taicpu(hp1_dist).condition, inverse_cond(taicpu(p_jump).condition)) and
  6782. GetNextInstruction(hp1_dist, hp1_label) and
  6783. SkipAligns(hp1_label, hp1_label) and
  6784. (hp1_label.typ = ait_label) then
  6785. begin
  6786. JumpLabel_far := tai_label(hp1_label).labsym;
  6787. if (JumpLabel_far = JumpLabel_dist) or (JumpLabel_far = JumpLabel) then
  6788. { This is an infinite loop }
  6789. Exit;
  6790. if Assigned(JumpLabel_far) then
  6791. begin
  6792. { In this situation, if the first jump branches, the second one will never,
  6793. branch so change the destination label to after the second jump }
  6794. DebugMsg(SPeepholeOptimization + 'CMP/Jcc/@Lbl/CMP/Jcc/@Lbl -> CMP/Jcc, redirecting first jump to 2nd label', p_jump);
  6795. if Assigned(JumpLabel) then
  6796. JumpLabel.DecRefs;
  6797. JumpLabel_far.IncRefs;
  6798. taicpu(p_jump).oper[0]^.ref^.symbol := JumpLabel_far;
  6799. Result := True;
  6800. { Don't exit yet. Since p and p_jump haven't actually been
  6801. removed, we can check for more on this iteration }
  6802. Continue;
  6803. end;
  6804. end;
  6805. end;
  6806. end;
  6807. { Search for:
  6808. cmp ###,###
  6809. j(c1) @lbl1
  6810. cmp ###,### (same as first)
  6811. Remove second cmp
  6812. }
  6813. if GetNextInstruction(p_jump, hp2) and
  6814. (
  6815. (
  6816. MatchInstruction(hp2, A_CMP, [taicpu(p).opsize]) and
  6817. (
  6818. (
  6819. MatchOpType(taicpu(p), top_const, top_reg) and
  6820. MatchOpType(taicpu(hp2), top_const, top_reg) and
  6821. (taicpu(hp2).oper[0]^.val = taicpu(p).oper[0]^.val) and
  6822. Reg1WriteOverwritesReg2Entirely(taicpu(hp2).oper[1]^.reg, taicpu(p).oper[1]^.reg)
  6823. ) or (
  6824. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[0]^) and
  6825. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^)
  6826. )
  6827. )
  6828. ) or (
  6829. { Also match cmp $0,%reg; jcc @lbl; test %reg,%reg }
  6830. MatchOperand(taicpu(p).oper[0]^, 0) and
  6831. (taicpu(p).oper[1]^.typ = top_reg) and
  6832. MatchInstruction(hp2, A_TEST, []) and
  6833. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  6834. (taicpu(hp2).oper[0]^.reg = taicpu(hp2).oper[1]^.reg) and
  6835. Reg1WriteOverwritesReg2Entirely(taicpu(hp2).oper[1]^.reg, taicpu(p).oper[1]^.reg)
  6836. )
  6837. ) then
  6838. begin
  6839. DebugMsg(SPeepholeOptimization + 'CMP/Jcc/CMP; removed superfluous CMP', hp2);
  6840. RemoveInstruction(hp2);
  6841. Result := True;
  6842. { Continue the while loop in case "Jcc/CMP" follows the second CMP that was just removed }
  6843. end;
  6844. GetNextInstruction(p_jump, p_jump);
  6845. end;
  6846. {
  6847. Try to optimise the following:
  6848. cmp $x,### ($x and $y can be registers or constants)
  6849. je @lbl1 (only reference)
  6850. cmp $y,### (### are identical)
  6851. @Lbl:
  6852. sete %reg1
  6853. Change to:
  6854. cmp $x,###
  6855. sete %reg2 (allocate new %reg2)
  6856. cmp $y,###
  6857. sete %reg1
  6858. orb %reg2,%reg1
  6859. (dealloc %reg2)
  6860. This adds an instruction (so don't perform under -Os), but it removes
  6861. a conditional branch.
  6862. }
  6863. if not (cs_opt_size in current_settings.optimizerswitches) and
  6864. (
  6865. (hp1 = p_jump) or
  6866. GetNextInstruction(p, hp1)
  6867. ) and
  6868. MatchInstruction(hp1, A_Jcc, []) and
  6869. IsJumpToLabel(taicpu(hp1)) and
  6870. (taicpu(hp1).condition in [C_E, C_Z]) and
  6871. GetNextInstruction(hp1, hp2) and
  6872. MatchInstruction(hp2, A_CMP, A_TEST, [taicpu(p).opsize]) and
  6873. MatchOperand(taicpu(p).oper[1]^, taicpu(hp2).oper[1]^) and
  6874. { The first operand of CMP instructions can only be a register or
  6875. immediate anyway, so no need to check }
  6876. GetNextInstruction(hp2, p_label) and
  6877. (
  6878. (p_label.typ = ait_label) or
  6879. (
  6880. { Sometimes there's a zero-distance jump before the label, so deal with it here
  6881. to potentially cut down on the iterations of Pass 1 }
  6882. MatchInstruction(p_label, A_Jcc, []) and
  6883. IsJumpToLabel(taicpu(p_label)) and
  6884. { Use p_dist to hold the jump briefly }
  6885. SetAndTest(p_label, p_dist) and
  6886. GetNextInstruction(p_dist, p_label) and
  6887. (p_label.typ = ait_label) and
  6888. (tai_label(p_label).labsym.getrefs >= 2) and
  6889. (JumpTargetOp(taicpu(p_dist))^.ref^.symbol = tai_label(p_label).labsym) and
  6890. { We might as well collapse the jump now }
  6891. CollapseZeroDistJump(p_dist, tai_label(p_label).labsym)
  6892. )
  6893. ) and
  6894. (tai_label(p_label).labsym.getrefs = 1) and
  6895. (JumpTargetOp(taicpu(hp1))^.ref^.symbol = tai_label(p_label).labsym) and
  6896. GetNextInstruction(p_label, p_dist) and
  6897. MatchInstruction(p_dist, A_SETcc, []) and
  6898. (taicpu(p_dist).condition in [C_E, C_Z]) and
  6899. (taicpu(p_dist).oper[0]^.typ = top_reg) and
  6900. { Get the instruction after the SETcc instruction so we can
  6901. allocate a new register over the entire range }
  6902. GetNextInstruction(p_dist, hp1_dist) then
  6903. begin
  6904. TransferUsedRegs(TmpUsedRegs);
  6905. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  6906. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  6907. UpdateUsedRegs(TmpUsedRegs, tai(p_label.Next));
  6908. // UpdateUsedRegs(TmpUsedRegs, tai(p_dist.Next));
  6909. { RegUsedAfterInstruction modifies TmpUsedRegs }
  6910. if not RegUsedAfterInstruction(NR_DEFAULTFLAGS, p_dist, TmpUsedRegs) then
  6911. begin
  6912. { Register can appear in p if it's not used afterwards, so only
  6913. allocate between hp1 and hp1_dist }
  6914. NewReg := GetIntRegisterBetween(R_SUBL, TmpUsedRegs, hp1, p_dist);
  6915. if NewReg <> NR_NO then
  6916. begin
  6917. DebugMsg(SPeepholeOptimization + 'CMP/JE/CMP/@Lbl/SETE -> CMP/SETE/CMP/SETE/OR, removing conditional branch', p);
  6918. { Change the jump instruction into a SETcc instruction }
  6919. taicpu(hp1).opcode := A_SETcc;
  6920. taicpu(hp1).opsize := S_B;
  6921. taicpu(hp1).loadreg(0, NewReg);
  6922. { This is now a dead label }
  6923. tai_label(p_label).labsym.decrefs;
  6924. { Prefer adding before the next instruction so the FLAGS
  6925. register is deallocated first }
  6926. hp2 := taicpu.op_reg_reg(A_OR, S_B, NewReg, taicpu(p_dist).oper[0]^.reg);
  6927. taicpu(hp2).fileinfo := taicpu(p_dist).fileinfo;
  6928. AsmL.InsertBefore(
  6929. hp2,
  6930. hp1_dist
  6931. );
  6932. { Make sure the new register is in use over the new instruction
  6933. (long-winded, but things work best when the FLAGS register
  6934. is not allocated here) }
  6935. AllocRegBetween(NewReg, p_dist, hp2, TmpUsedRegs);
  6936. Result := True;
  6937. { Don't exit yet, as p wasn't changed and hp1, while
  6938. modified, is still intact and might be optimised by the
  6939. SETcc optimisation below }
  6940. end;
  6941. end;
  6942. end;
  6943. if taicpu(p).oper[0]^.typ = top_const then
  6944. begin
  6945. if (taicpu(p).oper[0]^.val = 0) and
  6946. (taicpu(p).oper[1]^.typ = top_reg) and
  6947. MatchInstruction(hp1,A_Jcc,A_SETcc,[]) then
  6948. begin
  6949. hp2 := p;
  6950. FirstMatch := True;
  6951. { When dealing with "cmp $0,%reg", only ZF and SF contain
  6952. anything meaningful once it's converted to "test %reg,%reg";
  6953. additionally, some jumps will always (or never) branch, so
  6954. evaluate every jump immediately following the
  6955. comparison, optimising the conditions if possible.
  6956. Similarly with SETcc... those that are always set to 0 or 1
  6957. are changed to MOV instructions }
  6958. while FirstMatch or { Saves calling GetNextInstruction unnecessarily }
  6959. (
  6960. GetNextInstruction(hp2, hp1) and
  6961. MatchInstruction(hp1,A_Jcc,A_SETcc,[])
  6962. ) do
  6963. begin
  6964. FirstMatch := False;
  6965. case taicpu(hp1).condition of
  6966. C_B, C_C, C_NAE, C_O:
  6967. { For B/NAE:
  6968. Will never branch since an unsigned integer can never be below zero
  6969. For C/O:
  6970. Result cannot overflow because 0 is being subtracted
  6971. }
  6972. begin
  6973. if taicpu(hp1).opcode = A_Jcc then
  6974. begin
  6975. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition B/C/NAE/O --> Never (jump removed)', hp1);
  6976. TAsmLabel(taicpu(hp1).oper[0]^.ref^.symbol).decrefs;
  6977. RemoveInstruction(hp1);
  6978. { Since hp1 was deleted, hp2 must not be updated }
  6979. Continue;
  6980. end
  6981. else
  6982. begin
  6983. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition B/C/NAE/O --> Never (set -> mov 0)', hp1);
  6984. { Convert "set(c) %reg" instruction to "movb 0,%reg" }
  6985. taicpu(hp1).opcode := A_MOV;
  6986. taicpu(hp1).ops := 2;
  6987. taicpu(hp1).condition := C_None;
  6988. taicpu(hp1).opsize := S_B;
  6989. taicpu(hp1).loadreg(1,taicpu(hp1).oper[0]^.reg);
  6990. taicpu(hp1).loadconst(0, 0);
  6991. end;
  6992. end;
  6993. C_BE, C_NA:
  6994. begin
  6995. { Will only branch if equal to zero }
  6996. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition BE/NA --> E', hp1);
  6997. taicpu(hp1).condition := C_E;
  6998. end;
  6999. C_A, C_NBE:
  7000. begin
  7001. { Will only branch if not equal to zero }
  7002. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition A/NBE --> NE', hp1);
  7003. taicpu(hp1).condition := C_NE;
  7004. end;
  7005. C_AE, C_NB, C_NC, C_NO:
  7006. begin
  7007. { Will always branch }
  7008. DebugMsg(SPeepholeOptimization + 'Cmpcc2Testcc - condition AE/NB/NC/NO --> Always', hp1);
  7009. if taicpu(hp1).opcode = A_Jcc then
  7010. begin
  7011. MakeUnconditional(taicpu(hp1));
  7012. { Any jumps/set that follow will now be dead code }
  7013. RemoveDeadCodeAfterJump(taicpu(hp1));
  7014. Break;
  7015. end
  7016. else
  7017. begin
  7018. { Convert "set(c) %reg" instruction to "movb 1,%reg" }
  7019. taicpu(hp1).opcode := A_MOV;
  7020. taicpu(hp1).ops := 2;
  7021. taicpu(hp1).condition := C_None;
  7022. taicpu(hp1).opsize := S_B;
  7023. taicpu(hp1).loadreg(1,taicpu(hp1).oper[0]^.reg);
  7024. taicpu(hp1).loadconst(0, 1);
  7025. end;
  7026. end;
  7027. C_None:
  7028. InternalError(2020012201);
  7029. C_P, C_PE, C_NP, C_PO:
  7030. { We can't handle parity checks and they should never be generated
  7031. after a general-purpose CMP (it's used in some floating-point
  7032. comparisons that don't use CMP) }
  7033. InternalError(2020012202);
  7034. else
  7035. { Zero/Equality, Sign, their complements and all of the
  7036. signed comparisons do not need to be converted };
  7037. end;
  7038. hp2 := hp1;
  7039. end;
  7040. { Convert the instruction to a TEST }
  7041. taicpu(p).opcode := A_TEST;
  7042. taicpu(p).loadreg(0,taicpu(p).oper[1]^.reg);
  7043. Result := True;
  7044. Exit;
  7045. end
  7046. else if (taicpu(p).oper[0]^.val = 1) and
  7047. MatchInstruction(hp1,A_Jcc,A_SETcc,[]) and
  7048. (taicpu(hp1).condition in [C_L, C_NL, C_NGE, C_GE]) then
  7049. begin
  7050. { Convert; To:
  7051. cmp $1,r/m cmp $0,r/m
  7052. jl @lbl jle @lbl
  7053. (Also do inverted conditions)
  7054. }
  7055. DebugMsg(SPeepholeOptimization + 'Cmp1Jl2Cmp0Jle', p);
  7056. taicpu(p).oper[0]^.val := 0;
  7057. if taicpu(hp1).condition in [C_L, C_NGE] then
  7058. taicpu(hp1).condition := C_LE
  7059. else
  7060. taicpu(hp1).condition := C_NLE;
  7061. { If the instruction is now "cmp $0,%reg", convert it to a
  7062. TEST (and effectively do the work of the "cmp $0,%reg" in
  7063. the block above)
  7064. }
  7065. if (taicpu(p).oper[1]^.typ = top_reg) then
  7066. begin
  7067. taicpu(p).opcode := A_TEST;
  7068. taicpu(p).loadreg(0,taicpu(p).oper[1]^.reg);
  7069. end;
  7070. Result := True;
  7071. Exit;
  7072. end
  7073. else if (taicpu(p).oper[1]^.typ = top_reg)
  7074. {$ifdef x86_64}
  7075. and (taicpu(p).opsize <> S_Q) { S_Q will never happen: cmp with 64 bit constants is not possible }
  7076. {$endif x86_64}
  7077. then
  7078. begin
  7079. { cmp register,$8000 neg register
  7080. je target --> jo target
  7081. .... only if register is deallocated before jump.}
  7082. case Taicpu(p).opsize of
  7083. S_B: v:=$80;
  7084. S_W: v:=$8000;
  7085. S_L: v:=qword($80000000);
  7086. else
  7087. internalerror(2013112905);
  7088. end;
  7089. if (taicpu(p).oper[0]^.val=v) and
  7090. MatchInstruction(hp1,A_Jcc,A_SETcc,[]) and
  7091. (Taicpu(hp1).condition in [C_E,C_NE]) then
  7092. begin
  7093. TransferUsedRegs(TmpUsedRegs);
  7094. UpdateUsedRegs(TmpUsedRegs,tai(p.next));
  7095. if not(RegInUsedRegs(Taicpu(p).oper[1]^.reg, TmpUsedRegs)) then
  7096. begin
  7097. DebugMsg(SPeepholeOptimization + 'CmpJe2NegJo done',p);
  7098. Taicpu(p).opcode:=A_NEG;
  7099. Taicpu(p).loadoper(0,Taicpu(p).oper[1]^);
  7100. Taicpu(p).clearop(1);
  7101. Taicpu(p).ops:=1;
  7102. if Taicpu(hp1).condition=C_E then
  7103. Taicpu(hp1).condition:=C_O
  7104. else
  7105. Taicpu(hp1).condition:=C_NO;
  7106. Result:=true;
  7107. exit;
  7108. end;
  7109. end;
  7110. end;
  7111. end;
  7112. if TrySwapMovCmp(p, hp1) then
  7113. begin
  7114. Result := True;
  7115. Exit;
  7116. end;
  7117. end;
  7118. function TX86AsmOptimizer.OptPass1PXor(var p: tai): boolean;
  7119. var
  7120. hp1: tai;
  7121. begin
  7122. {
  7123. remove the second (v)pxor from
  7124. pxor reg,reg
  7125. ...
  7126. pxor reg,reg
  7127. }
  7128. Result:=false;
  7129. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) and
  7130. MatchOpType(taicpu(p),top_reg,top_reg) and
  7131. GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[0]^.reg) and
  7132. MatchInstruction(hp1,taicpu(p).opcode,[taicpu(p).opsize]) and
  7133. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[0]^) and
  7134. MatchOperand(taicpu(hp1).oper[0]^,taicpu(hp1).oper[1]^) then
  7135. begin
  7136. DebugMsg(SPeepholeOptimization + 'PXorPXor2PXor done',hp1);
  7137. RemoveInstruction(hp1);
  7138. Result:=true;
  7139. Exit;
  7140. end
  7141. {
  7142. replace
  7143. pxor reg1,reg1
  7144. movapd/s reg1,reg2
  7145. dealloc reg1
  7146. by
  7147. pxor reg2,reg2
  7148. }
  7149. else if GetNextInstruction(p,hp1) and
  7150. { we mix single and double opperations here because we assume that the compiler
  7151. generates vmovapd only after double operations and vmovaps only after single operations }
  7152. MatchInstruction(hp1,A_MOVAPD,A_MOVAPS,[S_NO]) and
  7153. MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) and
  7154. MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^) and
  7155. (taicpu(p).oper[0]^.typ=top_reg) then
  7156. begin
  7157. TransferUsedRegs(TmpUsedRegs);
  7158. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7159. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  7160. begin
  7161. taicpu(p).loadoper(0,taicpu(hp1).oper[1]^);
  7162. taicpu(p).loadoper(1,taicpu(hp1).oper[1]^);
  7163. DebugMsg(SPeepholeOptimization + 'PXorMovapd2PXor done',p);
  7164. RemoveInstruction(hp1);
  7165. result:=true;
  7166. end;
  7167. end;
  7168. end;
  7169. function TX86AsmOptimizer.OptPass1VPXor(var p: tai): boolean;
  7170. var
  7171. hp1: tai;
  7172. begin
  7173. {
  7174. remove the second (v)pxor from
  7175. (v)pxor reg,reg
  7176. ...
  7177. (v)pxor reg,reg
  7178. }
  7179. Result:=false;
  7180. if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^,taicpu(p).oper[2]^) and
  7181. MatchOpType(taicpu(p),top_reg,top_reg,top_reg) then
  7182. begin
  7183. if GetNextInstructionUsingReg(p,hp1,taicpu(p).oper[0]^.reg) and
  7184. MatchInstruction(hp1,taicpu(p).opcode,[taicpu(p).opsize]) and
  7185. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[0]^) and
  7186. MatchOperand(taicpu(hp1).oper[0]^,taicpu(hp1).oper[1]^,taicpu(hp1).oper[2]^) then
  7187. begin
  7188. DebugMsg(SPeepholeOptimization + 'VPXorVPXor2VPXor done',hp1);
  7189. RemoveInstruction(hp1);
  7190. Result:=true;
  7191. Exit;
  7192. end;
  7193. {$ifdef x86_64}
  7194. {
  7195. replace
  7196. vpxor reg1,reg1,reg1
  7197. vmov reg,mem
  7198. by
  7199. movq $0,mem
  7200. }
  7201. if GetNextInstruction(p,hp1) and
  7202. MatchInstruction(hp1,A_VMOVSD,[]) and
  7203. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  7204. MatchOpType(taicpu(hp1),top_reg,top_ref) then
  7205. begin
  7206. TransferUsedRegs(TmpUsedRegs);
  7207. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7208. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  7209. begin
  7210. taicpu(hp1).loadconst(0,0);
  7211. taicpu(hp1).opcode:=A_MOV;
  7212. taicpu(hp1).opsize:=S_Q;
  7213. DebugMsg(SPeepholeOptimization + 'VPXorVMov2Mov done',p);
  7214. RemoveCurrentP(p);
  7215. result:=true;
  7216. Exit;
  7217. end;
  7218. end;
  7219. {$endif x86_64}
  7220. end
  7221. {
  7222. replace
  7223. vpxor reg1,reg1,reg2
  7224. by
  7225. vpxor reg2,reg2,reg2
  7226. to avoid unncessary data dependencies
  7227. }
  7228. else if MatchOperand(taicpu(p).oper[0]^,taicpu(p).oper[1]^) and
  7229. MatchOpType(taicpu(p),top_reg,top_reg,top_reg) then
  7230. begin
  7231. DebugMsg(SPeepholeOptimization + 'VPXor2VPXor done',p);
  7232. { avoid unncessary data dependency }
  7233. taicpu(p).loadreg(0,taicpu(p).oper[2]^.reg);
  7234. taicpu(p).loadreg(1,taicpu(p).oper[2]^.reg);
  7235. result:=true;
  7236. exit;
  7237. end;
  7238. Result:=OptPass1VOP(p);
  7239. end;
  7240. function TX86AsmOptimizer.OptPass1Imul(var p: tai): boolean;
  7241. var
  7242. hp1 : tai;
  7243. begin
  7244. result:=false;
  7245. { replace
  7246. IMul const,%mreg1,%mreg2
  7247. Mov %reg2,%mreg3
  7248. dealloc %mreg3
  7249. by
  7250. Imul const,%mreg1,%mreg23
  7251. }
  7252. if (taicpu(p).ops=3) and
  7253. GetNextInstruction(p,hp1) and
  7254. MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) and
  7255. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  7256. (taicpu(hp1).oper[1]^.typ=top_reg) then
  7257. begin
  7258. TransferUsedRegs(TmpUsedRegs);
  7259. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7260. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  7261. begin
  7262. taicpu(p).loadoper(2,taicpu(hp1).oper[1]^);
  7263. DebugMsg(SPeepholeOptimization + 'ImulMov2Imul done',p);
  7264. RemoveInstruction(hp1);
  7265. result:=true;
  7266. end;
  7267. end;
  7268. end;
  7269. function TX86AsmOptimizer.OptPass1SHXX(var p: tai): boolean;
  7270. var
  7271. hp1 : tai;
  7272. begin
  7273. result:=false;
  7274. { replace
  7275. IMul %reg0,%reg1,%reg2
  7276. Mov %reg2,%reg3
  7277. dealloc %reg2
  7278. by
  7279. Imul %reg0,%reg1,%reg3
  7280. }
  7281. if GetNextInstruction(p,hp1) and
  7282. MatchInstruction(hp1,A_MOV,[taicpu(p).opsize]) and
  7283. MatchOperand(taicpu(p).oper[2]^,taicpu(hp1).oper[0]^) and
  7284. (taicpu(hp1).oper[1]^.typ=top_reg) then
  7285. begin
  7286. TransferUsedRegs(TmpUsedRegs);
  7287. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  7288. if not(RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg,hp1,TmpUsedRegs)) then
  7289. begin
  7290. taicpu(p).loadoper(2,taicpu(hp1).oper[1]^);
  7291. DebugMsg(SPeepholeOptimization + 'SHXXMov2SHXX done',p);
  7292. RemoveInstruction(hp1);
  7293. result:=true;
  7294. end;
  7295. end;
  7296. end;
  7297. function TX86AsmOptimizer.OptPass1_V_Cvtss2sd(var p: tai): boolean;
  7298. var
  7299. hp1: tai;
  7300. begin
  7301. Result:=false;
  7302. { get rid of
  7303. (v)cvtss2sd reg0,<reg1,>reg2
  7304. (v)cvtss2sd reg2,<reg2,>reg0
  7305. }
  7306. if GetNextInstruction(p,hp1) and
  7307. (((taicpu(p).opcode=A_CVTSS2SD) and MatchInstruction(hp1,A_CVTSD2SS,[taicpu(p).opsize]) and
  7308. MatchOperand(taicpu(p).oper[0]^,taicpu(hp1).oper[1]^) and MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^)) or
  7309. ((taicpu(p).opcode=A_VCVTSS2SD) and MatchInstruction(hp1,A_VCVTSD2SS,[taicpu(p).opsize]) and
  7310. MatchOpType(taicpu(p),top_reg,top_reg,top_reg) and
  7311. MatchOpType(taicpu(hp1),top_reg,top_reg,top_reg) and
  7312. (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) and
  7313. (getsupreg(taicpu(hp1).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg)) and
  7314. (getsupreg(taicpu(p).oper[2]^.reg)=getsupreg(taicpu(hp1).oper[0]^.reg))
  7315. )
  7316. ) then
  7317. begin
  7318. if ((taicpu(p).opcode=A_CVTSS2SD) and (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg))) or
  7319. ((taicpu(p).opcode=A_VCVTSS2SD) and (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[2]^.reg))) then
  7320. begin
  7321. DebugMsg(SPeepholeOptimization + '(V)Cvtss2CvtSd(V)Cvtsd2ss2Nop done',p);
  7322. RemoveCurrentP(p);
  7323. RemoveInstruction(hp1);
  7324. end
  7325. else
  7326. begin
  7327. DebugMsg(SPeepholeOptimization + '(V)Cvtss2CvtSd(V)Cvtsd2ss2Vmovaps done',p);
  7328. if taicpu(hp1).opcode=A_CVTSD2SS then
  7329. begin
  7330. taicpu(p).loadreg(1,taicpu(hp1).oper[1]^.reg);
  7331. taicpu(p).opcode:=A_MOVAPS;
  7332. end
  7333. else
  7334. begin
  7335. taicpu(p).loadreg(1,taicpu(hp1).oper[2]^.reg);
  7336. taicpu(p).opcode:=A_VMOVAPS;
  7337. end;
  7338. taicpu(p).ops:=2;
  7339. RemoveInstruction(hp1);
  7340. end;
  7341. Result:=true;
  7342. Exit;
  7343. end;
  7344. end;
  7345. function TX86AsmOptimizer.OptPass1Jcc(var p : tai) : boolean;
  7346. var
  7347. hp1, hp2, hp3, hp4, hp5, hp6: tai;
  7348. ThisReg: TRegister;
  7349. begin
  7350. Result := False;
  7351. if not GetNextInstruction(p,hp1) then
  7352. Exit;
  7353. {
  7354. convert
  7355. j<c> .L1
  7356. mov 1,reg
  7357. jmp .L2
  7358. .L1
  7359. mov 0,reg
  7360. .L2
  7361. into
  7362. mov 0,reg
  7363. set<not(c)> reg
  7364. take care of alignment and that the mov 0,reg is not converted into a xor as this
  7365. would destroy the flag contents
  7366. Use MOVZX if size is preferred, since while mov 0,reg is bigger, it can be
  7367. executed at the same time as a previous comparison.
  7368. set<not(c)> reg
  7369. movzx reg, reg
  7370. }
  7371. if MatchInstruction(hp1,A_MOV,[]) and
  7372. (taicpu(hp1).oper[0]^.typ = top_const) and
  7373. (
  7374. (
  7375. (taicpu(hp1).oper[1]^.typ = top_reg)
  7376. {$ifdef i386}
  7377. { Under i386, ESI, EDI, EBP and ESP
  7378. don't have an 8-bit representation }
  7379. and not (getsupreg(taicpu(hp1).oper[1]^.reg) in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  7380. {$endif i386}
  7381. ) or (
  7382. {$ifdef i386}
  7383. (taicpu(hp1).oper[1]^.typ <> top_reg) and
  7384. {$endif i386}
  7385. (taicpu(hp1).opsize = S_B)
  7386. )
  7387. ) and
  7388. GetNextInstruction(hp1,hp2) and
  7389. MatchInstruction(hp2,A_JMP,[]) and (taicpu(hp2).oper[0]^.ref^.refaddr=addr_full) and
  7390. GetNextInstruction(hp2,hp3) and
  7391. SkipAligns(hp3, hp3) and
  7392. (hp3.typ=ait_label) and
  7393. (tasmlabel(taicpu(p).oper[0]^.ref^.symbol)=tai_label(hp3).labsym) and
  7394. GetNextInstruction(hp3,hp4) and
  7395. MatchInstruction(hp4,A_MOV,[taicpu(hp1).opsize]) and
  7396. (taicpu(hp4).oper[0]^.typ = top_const) and
  7397. (
  7398. ((taicpu(hp1).oper[0]^.val = 0) and (taicpu(hp4).oper[0]^.val = 1)) or
  7399. ((taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0))
  7400. ) and
  7401. MatchOperand(taicpu(hp1).oper[1]^,taicpu(hp4).oper[1]^) and
  7402. GetNextInstruction(hp4,hp5) and
  7403. SkipAligns(hp5, hp5) and
  7404. (hp5.typ=ait_label) and
  7405. (tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol)=tai_label(hp5).labsym) then
  7406. begin
  7407. if (taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0) then
  7408. taicpu(p).condition := inverse_cond(taicpu(p).condition);
  7409. tai_label(hp3).labsym.DecRefs;
  7410. { If this isn't the only reference to the middle label, we can
  7411. still make a saving - only that the first jump and everything
  7412. that follows will remain. }
  7413. if (tai_label(hp3).labsym.getrefs = 0) then
  7414. begin
  7415. if (taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0) then
  7416. DebugMsg(SPeepholeOptimization + 'J(c)Mov1JmpMov0 -> Set(~c)',p)
  7417. else
  7418. DebugMsg(SPeepholeOptimization + 'J(c)Mov0JmpMov1 -> Set(c)',p);
  7419. { remove jump, first label and second MOV (also catching any aligns) }
  7420. repeat
  7421. if not GetNextInstruction(hp2, hp3) then
  7422. InternalError(2021040810);
  7423. RemoveInstruction(hp2);
  7424. hp2 := hp3;
  7425. until hp2 = hp5;
  7426. { Don't decrement reference count before the removal loop
  7427. above, otherwise GetNextInstruction won't stop on the
  7428. the label }
  7429. tai_label(hp5).labsym.DecRefs;
  7430. end
  7431. else
  7432. begin
  7433. if (taicpu(hp1).oper[0]^.val = 1) and (taicpu(hp4).oper[0]^.val = 0) then
  7434. DebugMsg(SPeepholeOptimization + 'J(c)Mov1JmpMov0 -> Set(~c) (partial)',p)
  7435. else
  7436. DebugMsg(SPeepholeOptimization + 'J(c)Mov0JmpMov1 -> Set(c) (partial)',p);
  7437. end;
  7438. taicpu(p).opcode:=A_SETcc;
  7439. taicpu(p).opsize:=S_B;
  7440. taicpu(p).is_jmp:=False;
  7441. if taicpu(hp1).opsize=S_B then
  7442. begin
  7443. taicpu(p).loadoper(0, taicpu(hp1).oper[1]^);
  7444. if taicpu(hp1).oper[1]^.typ = top_reg then
  7445. AllocRegBetween(taicpu(hp1).oper[1]^.reg, p, hp2, UsedRegs);
  7446. RemoveInstruction(hp1);
  7447. end
  7448. else
  7449. begin
  7450. { Will be a register because the size can't be S_B otherwise }
  7451. ThisReg := newreg(R_INTREGISTER,getsupreg(taicpu(hp1).oper[1]^.reg), R_SUBL);
  7452. taicpu(p).loadreg(0, ThisReg);
  7453. AllocRegBetween(ThisReg, p, hp2, UsedRegs);
  7454. if (cs_opt_size in current_settings.optimizerswitches) and IsMOVZXAcceptable then
  7455. begin
  7456. case taicpu(hp1).opsize of
  7457. S_W:
  7458. taicpu(hp1).opsize := S_BW;
  7459. S_L:
  7460. taicpu(hp1).opsize := S_BL;
  7461. {$ifdef x86_64}
  7462. S_Q:
  7463. begin
  7464. taicpu(hp1).opsize := S_BL;
  7465. { Change the destination register to 32-bit }
  7466. taicpu(hp1).loadreg(1, newreg(R_INTREGISTER,getsupreg(ThisReg), R_SUBD));
  7467. end;
  7468. {$endif x86_64}
  7469. else
  7470. InternalError(2021040820);
  7471. end;
  7472. taicpu(hp1).opcode := A_MOVZX;
  7473. taicpu(hp1).loadreg(0, ThisReg);
  7474. end
  7475. else
  7476. begin
  7477. AllocRegBetween(NR_FLAGS,p,hp1,UsedRegs);
  7478. { hp1 is already a MOV instruction with the correct register }
  7479. taicpu(hp1).loadconst(0, 0);
  7480. { Inserting it right before p will guarantee that the flags are also tracked }
  7481. asml.Remove(hp1);
  7482. asml.InsertBefore(hp1, p);
  7483. end;
  7484. end;
  7485. Result:=true;
  7486. exit;
  7487. end
  7488. else if (hp1.typ = ait_label) then
  7489. Result := DoSETccLblRETOpt(p, tai_label(hp1));
  7490. end;
  7491. function TX86AsmOptimizer.OptPass1VMOVDQ(var p: tai): Boolean;
  7492. var
  7493. hp1, hp2, hp3: tai;
  7494. SourceRef, TargetRef: TReference;
  7495. CurrentReg: TRegister;
  7496. begin
  7497. { VMOVDQU/CMOVDQA shouldn't have even been generated }
  7498. if not UseAVX then
  7499. InternalError(2021100501);
  7500. Result := False;
  7501. { Look for the following to simplify:
  7502. vmovdqa/u x(mem1), %xmmreg
  7503. vmovdqa/u %xmmreg, y(mem2)
  7504. vmovdqa/u x+16(mem1), %xmmreg
  7505. vmovdqa/u %xmmreg, y+16(mem2)
  7506. Change to:
  7507. vmovdqa/u x(mem1), %ymmreg
  7508. vmovdqa/u %ymmreg, y(mem2)
  7509. vpxor %ymmreg, %ymmreg, %ymmreg
  7510. ( The VPXOR instruction is to zero the upper half, thus removing the
  7511. need to call the potentially expensive VZEROUPPER instruction. Other
  7512. peephole optimisations can remove VPXOR if it's unnecessary )
  7513. }
  7514. TransferUsedRegs(TmpUsedRegs);
  7515. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  7516. { NOTE: In the optimisations below, if the references dictate that an
  7517. aligned move is possible (i.e. VMOVDQA), the existing instructions
  7518. should already be VMOVDQA because if (x mod 32) = 0, then (x mod 16) = 0 }
  7519. if (taicpu(p).opsize = S_XMM) and
  7520. MatchOpType(taicpu(p), top_ref, top_reg) and
  7521. GetNextInstruction(p, hp1) and
  7522. MatchInstruction(hp1, A_VMOVDQA, A_VMOVDQU, [S_XMM]) and
  7523. MatchOpType(taicpu(hp1), top_reg, top_ref) and
  7524. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) then
  7525. begin
  7526. SourceRef := taicpu(p).oper[0]^.ref^;
  7527. TargetRef := taicpu(hp1).oper[1]^.ref^;
  7528. if GetNextInstruction(hp1, hp2) and
  7529. MatchInstruction(hp2, A_VMOVDQA, A_VMOVDQU, [S_XMM]) and
  7530. MatchOpType(taicpu(hp2), top_ref, top_reg) then
  7531. begin
  7532. { Delay calling GetNextInstruction(hp2, hp3) for as long as possible }
  7533. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  7534. Inc(SourceRef.offset, 16);
  7535. { Reuse the register in the first block move }
  7536. CurrentReg := newreg(R_MMREGISTER, getsupreg(taicpu(p).oper[1]^.reg), R_SUBMMY);
  7537. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) and
  7538. not RefsMightOverlap(taicpu(p).oper[0]^.ref^, TargetRef, 32) then
  7539. begin
  7540. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  7541. Inc(TargetRef.offset, 16);
  7542. if GetNextInstruction(hp2, hp3) and
  7543. MatchInstruction(hp3, A_VMOVDQA, A_VMOVDQU, [S_XMM]) and
  7544. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  7545. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  7546. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  7547. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  7548. begin
  7549. { Update the register tracking to the new size }
  7550. AllocRegBetween(CurrentReg, p, hp2, UsedRegs);
  7551. { Remember that the offsets are 16 ahead }
  7552. { Switch to unaligned if the memory isn't on a 32-byte boundary }
  7553. if not (
  7554. ((SourceRef.offset mod 32) = 16) and
  7555. (SourceRef.alignment >= 32) and ((SourceRef.alignment mod 32) = 0)
  7556. ) then
  7557. taicpu(p).opcode := A_VMOVDQU;
  7558. taicpu(p).opsize := S_YMM;
  7559. taicpu(p).oper[1]^.reg := CurrentReg;
  7560. if not (
  7561. ((TargetRef.offset mod 32) = 16) and
  7562. (TargetRef.alignment >= 32) and ((TargetRef.alignment mod 32) = 0)
  7563. ) then
  7564. taicpu(hp1).opcode := A_VMOVDQU;
  7565. taicpu(hp1).opsize := S_YMM;
  7566. taicpu(hp1).oper[0]^.reg := CurrentReg;
  7567. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(CurrentReg) + ' to merge a pair of memory moves (VmovdqxVmovdqxVmovdqxVmovdqx2VmovdqyVmovdqy 1)', p);
  7568. { If pi_uses_ymm is set, VZEROUPPER is present to do this for us }
  7569. if (pi_uses_ymm in current_procinfo.flags) then
  7570. RemoveInstruction(hp2)
  7571. else
  7572. begin
  7573. taicpu(hp2).opcode := A_VPXOR;
  7574. taicpu(hp2).opsize := S_YMM;
  7575. taicpu(hp2).loadreg(0, CurrentReg);
  7576. taicpu(hp2).loadreg(1, CurrentReg);
  7577. taicpu(hp2).loadreg(2, CurrentReg);
  7578. taicpu(hp2).ops := 3;
  7579. end;
  7580. RemoveInstruction(hp3);
  7581. Result := True;
  7582. Exit;
  7583. end;
  7584. end
  7585. else
  7586. begin
  7587. { See if the next references are 16 less rather than 16 greater }
  7588. Dec(SourceRef.offset, 32); { -16 the other way }
  7589. if RefsEqual(SourceRef, taicpu(hp2).oper[0]^.ref^) then
  7590. begin
  7591. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  7592. Dec(TargetRef.offset, 16); { Only 16, not 32, as it wasn't incremented unlike SourceRef }
  7593. if not RefsMightOverlap(SourceRef, TargetRef, 32) and
  7594. GetNextInstruction(hp2, hp3) and
  7595. MatchInstruction(hp3, A_MOV, [taicpu(p).opsize]) and
  7596. MatchOpType(taicpu(hp3), top_reg, top_ref) and
  7597. (taicpu(hp2).oper[1]^.reg = taicpu(hp3).oper[0]^.reg) and
  7598. RefsEqual(TargetRef, taicpu(hp3).oper[1]^.ref^) and
  7599. not RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp3, TmpUsedRegs) then
  7600. begin
  7601. { Update the register tracking to the new size }
  7602. AllocRegBetween(CurrentReg, hp2, hp3, UsedRegs);
  7603. { hp2 and hp3 are the starting offsets, so mod = 0 this time }
  7604. { Switch to unaligned if the memory isn't on a 32-byte boundary }
  7605. if not(
  7606. ((SourceRef.offset mod 32) = 0) and
  7607. (SourceRef.alignment >= 32) and ((SourceRef.alignment mod 32) = 0)
  7608. ) then
  7609. taicpu(hp2).opcode := A_VMOVDQU;
  7610. taicpu(hp2).opsize := S_YMM;
  7611. taicpu(hp2).oper[1]^.reg := CurrentReg;
  7612. if not (
  7613. ((TargetRef.offset mod 32) = 0) and
  7614. (TargetRef.alignment >= 32) and ((TargetRef.alignment mod 32) = 0)
  7615. ) then
  7616. taicpu(hp3).opcode := A_VMOVDQU;
  7617. taicpu(hp3).opsize := S_YMM;
  7618. taicpu(hp3).oper[0]^.reg := CurrentReg;
  7619. DebugMsg(SPeepholeOptimization + 'Used ' + debug_regname(CurrentReg) + ' to merge a pair of memory moves (VmovdqxVmovdqxVmovdqxVmovdqx2VmovdqyVmovdqy 2)', p);
  7620. { If pi_uses_ymm is set, VZEROUPPER is present to do this for us }
  7621. if (pi_uses_ymm in current_procinfo.flags) then
  7622. RemoveInstruction(hp1)
  7623. else
  7624. begin
  7625. taicpu(hp1).opcode := A_VPXOR;
  7626. taicpu(hp1).opsize := S_YMM;
  7627. taicpu(hp1).loadreg(0, CurrentReg);
  7628. taicpu(hp1).loadreg(1, CurrentReg);
  7629. taicpu(hp1).loadreg(2, CurrentReg);
  7630. taicpu(hp1).ops := 3;
  7631. Asml.Remove(hp1);
  7632. Asml.InsertAfter(hp1, hp3); { Register deallocations will be after hp3 }
  7633. end;
  7634. RemoveCurrentP(p, hp2);
  7635. Result := True;
  7636. Exit;
  7637. end;
  7638. end;
  7639. end;
  7640. end;
  7641. end;
  7642. end;
  7643. function TX86AsmOptimizer.CheckJumpMovTransferOpt(var p: tai; hp1: tai; LoopCount: Integer; out Count: Integer): Boolean;
  7644. var
  7645. hp2, hp3, first_assignment: tai;
  7646. IncCount, OperIdx: Integer;
  7647. OrigLabel: TAsmLabel;
  7648. begin
  7649. Count := 0;
  7650. Result := False;
  7651. first_assignment := nil;
  7652. if (LoopCount >= 20) then
  7653. begin
  7654. { Guard against infinite loops }
  7655. Exit;
  7656. end;
  7657. if (taicpu(p).oper[0]^.typ <> top_ref) or
  7658. (taicpu(p).oper[0]^.ref^.refaddr <> addr_full) or
  7659. (taicpu(p).oper[0]^.ref^.base <> NR_NO) or
  7660. (taicpu(p).oper[0]^.ref^.index <> NR_NO) or
  7661. not (taicpu(p).oper[0]^.ref^.symbol is TAsmLabel) then
  7662. Exit;
  7663. OrigLabel := TAsmLabel(taicpu(p).oper[0]^.ref^.symbol);
  7664. {
  7665. change
  7666. jmp .L1
  7667. ...
  7668. .L1:
  7669. mov ##, ## ( multiple movs possible )
  7670. jmp/ret
  7671. into
  7672. mov ##, ##
  7673. jmp/ret
  7674. }
  7675. if not Assigned(hp1) then
  7676. begin
  7677. hp1 := GetLabelWithSym(OrigLabel);
  7678. if not Assigned(hp1) or not SkipLabels(hp1, hp1) then
  7679. Exit;
  7680. end;
  7681. hp2 := hp1;
  7682. while Assigned(hp2) do
  7683. begin
  7684. if Assigned(hp2) and (hp2.typ in [ait_label, ait_align]) then
  7685. SkipLabels(hp2,hp2);
  7686. if not Assigned(hp2) or (hp2.typ <> ait_instruction) then
  7687. Break;
  7688. case taicpu(hp2).opcode of
  7689. A_MOVSS:
  7690. begin
  7691. if taicpu(hp2).ops = 0 then
  7692. { Wrong MOVSS }
  7693. Break;
  7694. Inc(Count);
  7695. if Count >= 5 then
  7696. { Too many to be worthwhile }
  7697. Break;
  7698. GetNextInstruction(hp2, hp2);
  7699. Continue;
  7700. end;
  7701. A_MOV,
  7702. A_MOVD,
  7703. A_MOVQ,
  7704. A_MOVSX,
  7705. {$ifdef x86_64}
  7706. A_MOVSXD,
  7707. {$endif x86_64}
  7708. A_MOVZX,
  7709. A_MOVAPS,
  7710. A_MOVUPS,
  7711. A_MOVSD,
  7712. A_MOVAPD,
  7713. A_MOVUPD,
  7714. A_MOVDQA,
  7715. A_MOVDQU,
  7716. A_VMOVSS,
  7717. A_VMOVAPS,
  7718. A_VMOVUPS,
  7719. A_VMOVSD,
  7720. A_VMOVAPD,
  7721. A_VMOVUPD,
  7722. A_VMOVDQA,
  7723. A_VMOVDQU:
  7724. begin
  7725. Inc(Count);
  7726. if Count >= 5 then
  7727. { Too many to be worthwhile }
  7728. Break;
  7729. GetNextInstruction(hp2, hp2);
  7730. Continue;
  7731. end;
  7732. A_JMP:
  7733. begin
  7734. { Guard against infinite loops }
  7735. if taicpu(hp2).oper[0]^.ref^.symbol = OrigLabel then
  7736. Exit;
  7737. { Analyse this jump first in case it also duplicates assignments }
  7738. if CheckJumpMovTransferOpt(hp2, nil, LoopCount + 1, IncCount) then
  7739. begin
  7740. { Something did change! }
  7741. Result := True;
  7742. Inc(Count, IncCount);
  7743. if Count >= 5 then
  7744. begin
  7745. { Too many to be worthwhile }
  7746. Exit;
  7747. end;
  7748. if MatchInstruction(hp2, [A_JMP, A_RET], []) then
  7749. Break;
  7750. end;
  7751. Result := True;
  7752. Break;
  7753. end;
  7754. A_RET:
  7755. begin
  7756. Result := True;
  7757. Break;
  7758. end;
  7759. else
  7760. Break;
  7761. end;
  7762. end;
  7763. if Result then
  7764. begin
  7765. { A count of zero can happen when CheckJumpMovTransferOpt is called recursively }
  7766. if Count = 0 then
  7767. begin
  7768. Result := False;
  7769. Exit;
  7770. end;
  7771. hp3 := p;
  7772. DebugMsg(SPeepholeOptimization + 'Duplicated ' + debug_tostr(Count) + ' assignment(s) and redirected jump', p);
  7773. while True do
  7774. begin
  7775. if Assigned(hp1) and (hp1.typ in [ait_label, ait_align]) then
  7776. SkipLabels(hp1,hp1);
  7777. if (hp1.typ <> ait_instruction) then
  7778. InternalError(2021040720);
  7779. case taicpu(hp1).opcode of
  7780. A_JMP:
  7781. begin
  7782. { Change the original jump to the new destination }
  7783. OrigLabel.decrefs;
  7784. taicpu(hp1).oper[0]^.ref^.symbol.increfs;
  7785. taicpu(p).loadref(0, taicpu(hp1).oper[0]^.ref^);
  7786. { Set p to the first duplicated assignment so it can get optimised if needs be }
  7787. if not Assigned(first_assignment) then
  7788. InternalError(2021040810)
  7789. else
  7790. p := first_assignment;
  7791. Exit;
  7792. end;
  7793. A_RET:
  7794. begin
  7795. { Now change the jump into a RET instruction }
  7796. ConvertJumpToRET(p, hp1);
  7797. { Set p to the first duplicated assignment so it can get optimised if needs be }
  7798. if not Assigned(first_assignment) then
  7799. InternalError(2021040811)
  7800. else
  7801. p := first_assignment;
  7802. Exit;
  7803. end;
  7804. else
  7805. begin
  7806. { Duplicate the MOV instruction }
  7807. hp3:=tai(hp1.getcopy);
  7808. if first_assignment = nil then
  7809. first_assignment := hp3;
  7810. asml.InsertBefore(hp3, p);
  7811. { Make sure the compiler knows about any final registers written here }
  7812. for OperIdx := 0 to taicpu(hp3).ops - 1 do
  7813. with taicpu(hp3).oper[OperIdx]^ do
  7814. begin
  7815. case typ of
  7816. top_ref:
  7817. begin
  7818. if (ref^.base <> NR_NO) and
  7819. (getsupreg(ref^.base) <> RS_ESP) and
  7820. (getsupreg(ref^.base) <> RS_EBP)
  7821. {$ifdef x86_64} and (ref^.base <> NR_RIP) {$endif x86_64}
  7822. then
  7823. AllocRegBetween(ref^.base, hp3, tai(p.Next), UsedRegs);
  7824. if (ref^.index <> NR_NO) and
  7825. (getsupreg(ref^.index) <> RS_ESP) and
  7826. (getsupreg(ref^.index) <> RS_EBP)
  7827. {$ifdef x86_64} and (ref^.index <> NR_RIP) {$endif x86_64} and
  7828. (ref^.index <> ref^.base) then
  7829. AllocRegBetween(ref^.index, hp3, tai(p.Next), UsedRegs);
  7830. end;
  7831. top_reg:
  7832. AllocRegBetween(reg, hp3, tai(p.Next), UsedRegs);
  7833. else
  7834. ;
  7835. end;
  7836. end;
  7837. end;
  7838. end;
  7839. if not GetNextInstruction(hp1, hp1) then
  7840. { Should have dropped out earlier }
  7841. InternalError(2021040710);
  7842. end;
  7843. end;
  7844. end;
  7845. function TX86AsmOptimizer.TrySwapMovCmp(var p, hp1: tai): Boolean;
  7846. var
  7847. hp2: tai;
  7848. X: Integer;
  7849. const
  7850. WriteOp: array[0..3] of set of TInsChange = (
  7851. [Ch_Wop1, Ch_RWop1, Ch_Mop1],
  7852. [Ch_Wop2, Ch_RWop2, Ch_Mop2],
  7853. [Ch_Wop3, Ch_RWop3, Ch_Mop3],
  7854. [Ch_Wop4, Ch_RWop4, Ch_Mop4]);
  7855. RegWriteFlags: array[0..7] of set of TInsChange = (
  7856. { The order is important: EAX, ECX, EDX, EBX, ESI, EDI, EBP, ESP }
  7857. [Ch_WEAX, Ch_RWEAX, Ch_MEAX{$ifdef x86_64}, Ch_WRAX, Ch_RWRAX, Ch_MRAX{$endif x86_64}],
  7858. [Ch_WECX, Ch_RWECX, Ch_MECX{$ifdef x86_64}, Ch_WRCX, Ch_RWRCX, Ch_MRCX{$endif x86_64}],
  7859. [Ch_WEDX, Ch_RWEDX, Ch_MEDX{$ifdef x86_64}, Ch_WRDX, Ch_RWRDX, Ch_MRDX{$endif x86_64}],
  7860. [Ch_WEBX, Ch_RWEBX, Ch_MEBX{$ifdef x86_64}, Ch_WRBX, Ch_RWRBX, Ch_MRBX{$endif x86_64}],
  7861. [Ch_WESI, Ch_RWESI, Ch_MESI{$ifdef x86_64}, Ch_WRSI, Ch_RWRSI, Ch_MRSI{$endif x86_64}],
  7862. [Ch_WEDI, Ch_RWEDI, Ch_MEDI{$ifdef x86_64}, Ch_WRDI, Ch_RWRDI, Ch_MRDI{$endif x86_64}],
  7863. [Ch_WEBP, Ch_RWEBP, Ch_MEBP{$ifdef x86_64}, Ch_WRBP, Ch_RWRBP, Ch_MRBP{$endif x86_64}],
  7864. [Ch_WESP, Ch_RWESP, Ch_MESP{$ifdef x86_64}, Ch_WRSP, Ch_RWRSP, Ch_MRSP{$endif x86_64}]);
  7865. begin
  7866. { If we have something like:
  7867. cmp ###,%reg1
  7868. mov 0,%reg2
  7869. And no modified registers are shared, move the instruction to before
  7870. the comparison as this means it can be optimised without worrying
  7871. about the FLAGS register. (CMP/MOV is generated by
  7872. "J(c)Mov1JmpMov0 -> Set(~c)", among other things).
  7873. As long as the second instruction doesn't use the flags or one of the
  7874. registers used by CMP or TEST (also check any references that use the
  7875. registers), then it can be moved prior to the comparison.
  7876. }
  7877. Result := False;
  7878. if (hp1.typ <> ait_instruction) or
  7879. taicpu(hp1).is_jmp or
  7880. RegInInstruction(NR_DEFAULTFLAGS, hp1) then
  7881. Exit;
  7882. { NOP is a pipeline fence, likely marking the beginning of the function
  7883. epilogue, so drop out. Similarly, drop out if POP or RET are
  7884. encountered }
  7885. if MatchInstruction(hp1, A_NOP, A_POP, []) then
  7886. Exit;
  7887. if (taicpu(hp1).opcode = A_MOVSS) and
  7888. (taicpu(hp1).ops = 0) then
  7889. { Wrong MOVSS }
  7890. Exit;
  7891. { Check for writes to specific registers first }
  7892. { EAX, ECX, EDX, EBX, ESI, EDI, EBP, ESP in that order }
  7893. for X := 0 to 7 do
  7894. if (RegWriteFlags[X] * InsProp[taicpu(hp1).opcode].Ch <> [])
  7895. and RegInInstruction(newreg(R_INTREGISTER, TSuperRegister(X), R_SUBWHOLE), p) then
  7896. Exit;
  7897. for X := 0 to taicpu(hp1).ops - 1 do
  7898. begin
  7899. { Check to see if this operand writes to something }
  7900. if ((WriteOp[X] * InsProp[taicpu(hp1).opcode].Ch) <> []) and
  7901. { And matches something in the CMP/TEST instruction }
  7902. (
  7903. MatchOperand(taicpu(hp1).oper[X]^, taicpu(p).oper[0]^) or
  7904. MatchOperand(taicpu(hp1).oper[X]^, taicpu(p).oper[1]^) or
  7905. (
  7906. { If it's a register, make sure the register written to doesn't
  7907. appear in the cmp instruction as part of a reference }
  7908. (taicpu(hp1).oper[X]^.typ = top_reg) and
  7909. RegInInstruction(taicpu(hp1).oper[X]^.reg, p)
  7910. )
  7911. ) then
  7912. Exit;
  7913. end;
  7914. { The instruction can be safely moved }
  7915. asml.Remove(hp1);
  7916. { Try to insert before the FLAGS register is allocated, so "mov $0,%reg"
  7917. can be optimised into "xor %reg,%reg" later }
  7918. if SetAndTest(FindRegAllocBackward(NR_DEFAULTFLAGS, tai(p.Previous)), hp2) then
  7919. asml.InsertBefore(hp1, hp2)
  7920. else
  7921. { Note, if p.Previous is nil (even if it should logically never be the
  7922. case), FindRegAllocBackward immediately exits with False and so we
  7923. safely land here (we can't just pass p because FindRegAllocBackward
  7924. immediately exits on an instruction). [Kit] }
  7925. asml.InsertBefore(hp1, p);
  7926. DebugMsg(SPeepholeOptimization + 'Swapped ' + debug_op2str(taicpu(p).opcode) + ' and ' + debug_op2str(taicpu(hp1).opcode) + ' instructions to improve optimisation potential', hp1);
  7927. for X := 0 to taicpu(hp1).ops - 1 do
  7928. case taicpu(hp1).oper[X]^.typ of
  7929. top_reg:
  7930. AllocRegBetween(taicpu(hp1).oper[X]^.reg, hp1, p, UsedRegs);
  7931. top_ref:
  7932. begin
  7933. if taicpu(hp1).oper[X]^.ref^.base <> NR_NO then
  7934. AllocRegBetween(taicpu(hp1).oper[X]^.ref^.base, hp1, p, UsedRegs);
  7935. if taicpu(hp1).oper[X]^.ref^.index <> NR_NO then
  7936. AllocRegBetween(taicpu(hp1).oper[X]^.ref^.index, hp1, p, UsedRegs);
  7937. end;
  7938. else
  7939. ;
  7940. end;
  7941. if taicpu(hp1).opcode = A_LEA then
  7942. { The flags will be overwritten by the CMP/TEST instruction }
  7943. ConvertLEA(taicpu(hp1));
  7944. Result := True;
  7945. end;
  7946. function TX86AsmOptimizer.OptPass2MOV(var p : tai) : boolean;
  7947. function IsXCHGAcceptable: Boolean; inline;
  7948. begin
  7949. { Always accept if optimising for size }
  7950. Result := (cs_opt_size in current_settings.optimizerswitches) or
  7951. { From the Pentium M onwards, XCHG only has a latency of 2 rather
  7952. than 3, so it becomes a saving compared to three MOVs with two of
  7953. them able to execute simultaneously. [Kit] }
  7954. (CPUX86_HINT_FAST_XCHG in cpu_optimization_hints[current_settings.optimizecputype]);
  7955. end;
  7956. var
  7957. NewRef: TReference;
  7958. hp1, hp2, hp3, hp4: Tai;
  7959. {$ifndef x86_64}
  7960. OperIdx: Integer;
  7961. {$endif x86_64}
  7962. NewInstr : Taicpu;
  7963. NewAligh : Tai_align;
  7964. DestLabel: TAsmLabel;
  7965. function TryMovArith2Lea(InputInstr: tai): Boolean;
  7966. var
  7967. NextInstr: tai;
  7968. begin
  7969. Result := False;
  7970. UpdateUsedRegs(TmpUsedRegs, tai(InputInstr.Next));
  7971. if not GetNextInstruction(InputInstr, NextInstr) or
  7972. (
  7973. { The FLAGS register isn't always tracked properly, so do not
  7974. perform this optimisation if a conditional statement follows }
  7975. not RegReadByInstruction(NR_DEFAULTFLAGS, NextInstr) and
  7976. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, NextInstr, TmpUsedRegs)
  7977. ) then
  7978. begin
  7979. reference_reset(NewRef, 1, []);
  7980. NewRef.base := taicpu(p).oper[0]^.reg;
  7981. NewRef.scalefactor := 1;
  7982. if taicpu(InputInstr).opcode = A_ADD then
  7983. begin
  7984. DebugMsg(SPeepholeOptimization + 'MovAdd2Lea', p);
  7985. NewRef.offset := taicpu(InputInstr).oper[0]^.val;
  7986. end
  7987. else
  7988. begin
  7989. DebugMsg(SPeepholeOptimization + 'MovSub2Lea', p);
  7990. NewRef.offset := -taicpu(InputInstr).oper[0]^.val;
  7991. end;
  7992. taicpu(p).opcode := A_LEA;
  7993. taicpu(p).loadref(0, NewRef);
  7994. RemoveInstruction(InputInstr);
  7995. Result := True;
  7996. end;
  7997. end;
  7998. begin
  7999. Result:=false;
  8000. { This optimisation adds an instruction, so only do it for speed }
  8001. if not (cs_opt_size in current_settings.optimizerswitches) and
  8002. MatchOpType(taicpu(p), top_const, top_reg) and
  8003. (taicpu(p).oper[0]^.val = 0) then
  8004. begin
  8005. { To avoid compiler warning }
  8006. DestLabel := nil;
  8007. if (p.typ <> ait_instruction) or (taicpu(p).oper[1]^.typ <> top_reg) then
  8008. InternalError(2021040750);
  8009. if not GetNextInstructionUsingReg(p, hp1, taicpu(p).oper[1]^.reg) then
  8010. Exit;
  8011. case hp1.typ of
  8012. ait_align,
  8013. ait_label:
  8014. begin
  8015. { Change:
  8016. mov $0,%reg mov $0,%reg
  8017. @Lbl1: @Lbl1:
  8018. test %reg,%reg / cmp $0,%reg test %reg,%reg / mov $0,%reg
  8019. je @Lbl2 jne @Lbl2
  8020. To: To:
  8021. mov $0,%reg mov $0,%reg
  8022. jmp @Lbl2 jmp @Lbl3
  8023. (align) (align)
  8024. @Lbl1: @Lbl1:
  8025. test %reg,%reg / cmp $0,%reg test %reg,%reg / cmp $0,%reg
  8026. je @Lbl2 je @Lbl2
  8027. @Lbl3: <-- Only if label exists
  8028. (Not if it's optimised for size)
  8029. }
  8030. if not SkipAligns(hp1, hp1) or not GetNextInstruction(hp1, hp2) then
  8031. Exit;
  8032. if (hp2.typ = ait_instruction) and
  8033. (
  8034. { Register sizes must exactly match }
  8035. (
  8036. (taicpu(hp2).opcode = A_CMP) and
  8037. MatchOperand(taicpu(hp2).oper[0]^, 0) and
  8038. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^.reg)
  8039. ) or (
  8040. (taicpu(hp2).opcode = A_TEST) and
  8041. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[1]^.reg) and
  8042. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^.reg)
  8043. )
  8044. ) and GetNextInstruction(hp2, hp3) and
  8045. (hp3.typ = ait_instruction) and
  8046. (taicpu(hp3).opcode = A_JCC) and
  8047. (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
  8048. (taicpu(hp3).oper[0]^.ref^.index=NR_NO) and (taicpu(hp3).oper[0]^.ref^.symbol is tasmlabel) then
  8049. begin
  8050. { Check condition of jump }
  8051. { Always true? }
  8052. if condition_in(C_E, taicpu(hp3).condition) then
  8053. begin
  8054. { Copy label symbol and obtain matching label entry for the
  8055. conditional jump, as this will be our destination}
  8056. DestLabel := tasmlabel(taicpu(hp3).oper[0]^.ref^.symbol);
  8057. DebugMsg(SPeepholeOptimization + 'Mov0LblCmp0Je -> Mov0JmpLblCmp0Je', p);
  8058. Result := True;
  8059. end
  8060. { Always false? }
  8061. else if condition_in(C_NE, taicpu(hp3).condition) and GetNextInstruction(hp3, hp2) then
  8062. begin
  8063. { This is only worth it if there's a jump to take }
  8064. case hp2.typ of
  8065. ait_instruction:
  8066. begin
  8067. if taicpu(hp2).opcode = A_JMP then
  8068. begin
  8069. DestLabel := tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol);
  8070. { An unconditional jump follows the conditional jump which will always be false,
  8071. so use this jump's destination for the new jump }
  8072. DebugMsg(SPeepholeOptimization + 'Mov0LblCmp0Jne -> Mov0JmpLblCmp0Jne (with JMP)', p);
  8073. Result := True;
  8074. end
  8075. else if taicpu(hp2).opcode = A_JCC then
  8076. begin
  8077. DestLabel := tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol);
  8078. if condition_in(C_E, taicpu(hp2).condition) then
  8079. begin
  8080. { A second conditional jump follows the conditional jump which will always be false,
  8081. while the second jump is always True, so use this jump's destination for the new jump }
  8082. DebugMsg(SPeepholeOptimization + 'Mov0LblCmp0Jne -> Mov0JmpLblCmp0Jne (with second Jcc)', p);
  8083. Result := True;
  8084. end;
  8085. { Don't risk it if the jump isn't always true (Result remains False) }
  8086. end;
  8087. end;
  8088. else
  8089. { If anything else don't optimise };
  8090. end;
  8091. end;
  8092. if Result then
  8093. begin
  8094. { Just so we have something to insert as a paremeter}
  8095. reference_reset(NewRef, 1, []);
  8096. NewInstr := taicpu.op_ref(A_JMP, S_NO, NewRef);
  8097. { Now actually load the correct parameter (this also
  8098. increases the reference count) }
  8099. NewInstr.loadsymbol(0, DestLabel, 0);
  8100. if (cs_opt_level3 in current_settings.optimizerswitches) then
  8101. begin
  8102. { Get instruction before original label (may not be p under -O3) }
  8103. if not GetLastInstruction(hp1, hp2) then
  8104. { Shouldn't fail here }
  8105. InternalError(2021040701);
  8106. { Before the aligns too }
  8107. while (hp2.typ = ait_align) do
  8108. if not GetLastInstruction(hp2, hp2) then
  8109. { Shouldn't fail here }
  8110. InternalError(2021040702);
  8111. end
  8112. else
  8113. hp2 := p;
  8114. taicpu(NewInstr).fileinfo := taicpu(hp2).fileinfo;
  8115. AsmL.InsertAfter(NewInstr, hp2);
  8116. { Add new alignment field }
  8117. (* AsmL.InsertAfter(
  8118. cai_align.create_max(
  8119. current_settings.alignment.jumpalign,
  8120. current_settings.alignment.jumpalignskipmax
  8121. ),
  8122. NewInstr
  8123. ); *)
  8124. end;
  8125. Exit;
  8126. end;
  8127. end;
  8128. else
  8129. ;
  8130. end;
  8131. end;
  8132. if not GetNextInstruction(p, hp1) then
  8133. Exit;
  8134. if MatchInstruction(hp1, A_CMP, A_TEST, [taicpu(p).opsize])
  8135. and DoMovCmpMemOpt(p, hp1, True) then
  8136. begin
  8137. Result := True;
  8138. Exit;
  8139. end
  8140. else if MatchInstruction(hp1, A_JMP, [S_NO]) then
  8141. begin
  8142. { Sometimes the MOVs that OptPass2JMP produces can be improved
  8143. further, but we can't just put this jump optimisation in pass 1
  8144. because it tends to perform worse when conditional jumps are
  8145. nearby (e.g. when converting CMOV instructions). [Kit] }
  8146. if OptPass2JMP(hp1) then
  8147. { call OptPass1MOV once to potentially merge any MOVs that were created }
  8148. Result := OptPass1MOV(p)
  8149. { OptPass2MOV will now exit but will be called again if OptPass1MOV
  8150. returned True and the instruction is still a MOV, thus checking
  8151. the optimisations below }
  8152. { If OptPass2JMP returned False, no optimisations were done to
  8153. the jump and there are no further optimisations that can be done
  8154. to the MOV instruction on this pass }
  8155. end
  8156. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8157. (taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) and
  8158. MatchInstruction(hp1,A_ADD,A_SUB,[taicpu(p).opsize]) and
  8159. (taicpu(hp1).oper[1]^.typ = top_reg) and
  8160. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  8161. begin
  8162. { Change:
  8163. movl/q %reg1,%reg2 movl/q %reg1,%reg2
  8164. addl/q $x,%reg2 subl/q $x,%reg2
  8165. To:
  8166. leal/q x(%reg1),%reg2 leal/q -x(%reg1),%reg2
  8167. }
  8168. if (taicpu(hp1).oper[0]^.typ = top_const) and
  8169. { be lazy, checking separately for sub would be slightly better }
  8170. (abs(taicpu(hp1).oper[0]^.val)<=$7fffffff) then
  8171. begin
  8172. TransferUsedRegs(TmpUsedRegs);
  8173. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8174. if TryMovArith2Lea(hp1) then
  8175. begin
  8176. Result := True;
  8177. Exit;
  8178. end
  8179. end
  8180. else if not RegInOp(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^) and
  8181. GetNextInstructionUsingReg(hp1, hp2, taicpu(p).oper[1]^.reg) and
  8182. { Same as above, but also adds or subtracts to %reg2 in between.
  8183. It's still valid as long as the flags aren't in use }
  8184. MatchInstruction(hp2,A_ADD,A_SUB,[taicpu(p).opsize]) and
  8185. MatchOpType(taicpu(hp2), top_const, top_reg) and
  8186. (taicpu(hp2).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  8187. { be lazy, checking separately for sub would be slightly better }
  8188. (abs(taicpu(hp2).oper[0]^.val)<=$7fffffff) then
  8189. begin
  8190. TransferUsedRegs(TmpUsedRegs);
  8191. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8192. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  8193. if TryMovArith2Lea(hp2) then
  8194. begin
  8195. Result := True;
  8196. Exit;
  8197. end;
  8198. end;
  8199. end
  8200. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8201. {$ifdef x86_64}
  8202. MatchInstruction(hp1,A_MOVZX,A_MOVSX,A_MOVSXD,[]) and
  8203. {$else x86_64}
  8204. MatchInstruction(hp1,A_MOVZX,A_MOVSX,[]) and
  8205. {$endif x86_64}
  8206. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  8207. (taicpu(hp1).oper[0]^.reg = taicpu(p).oper[1]^.reg) then
  8208. { mov reg1, reg2 mov reg1, reg2
  8209. movzx/sx reg2, reg3 to movzx/sx reg1, reg3}
  8210. begin
  8211. taicpu(hp1).oper[0]^.reg := taicpu(p).oper[0]^.reg;
  8212. DebugMsg(SPeepholeOptimization + 'mov %reg1,%reg2; movzx/sx %reg2,%reg3 -> mov %reg1,%reg2;movzx/sx %reg1,%reg3',p);
  8213. { Don't remove the MOV command without first checking that reg2 isn't used afterwards,
  8214. or unless supreg(reg3) = supreg(reg2)). [Kit] }
  8215. TransferUsedRegs(TmpUsedRegs);
  8216. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  8217. if (getsupreg(taicpu(p).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) or
  8218. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs)
  8219. then
  8220. begin
  8221. RemoveCurrentP(p, hp1);
  8222. Result:=true;
  8223. end;
  8224. exit;
  8225. end
  8226. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8227. IsXCHGAcceptable and
  8228. { XCHG doesn't support 8-byte registers }
  8229. (taicpu(p).opsize <> S_B) and
  8230. MatchInstruction(hp1, A_MOV, []) and
  8231. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  8232. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[0]^.reg) and
  8233. GetNextInstruction(hp1, hp2) and
  8234. MatchInstruction(hp2, A_MOV, []) and
  8235. { Don't need to call MatchOpType for hp2 because the operand matches below cover for it }
  8236. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[1]^.reg) and
  8237. MatchOperand(taicpu(hp2).oper[1]^, taicpu(hp1).oper[0]^.reg) then
  8238. begin
  8239. { mov %reg1,%reg2
  8240. mov %reg3,%reg1 -> xchg %reg3,%reg1
  8241. mov %reg2,%reg3
  8242. (%reg2 not used afterwards)
  8243. Note that xchg takes 3 cycles to execute, and generally mov's take
  8244. only one cycle apiece, but the first two mov's can be executed in
  8245. parallel, only taking 2 cycles overall. Older processors should
  8246. therefore only optimise for size. [Kit]
  8247. }
  8248. TransferUsedRegs(TmpUsedRegs);
  8249. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8250. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  8251. if not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp2, TmpUsedRegs) then
  8252. begin
  8253. DebugMsg(SPeepholeOptimization + 'MovMovMov2XChg', p);
  8254. AllocRegBetween(taicpu(hp2).oper[1]^.reg, p, hp1, UsedRegs);
  8255. taicpu(hp1).opcode := A_XCHG;
  8256. RemoveCurrentP(p, hp1);
  8257. RemoveInstruction(hp2);
  8258. Result := True;
  8259. Exit;
  8260. end;
  8261. end
  8262. else if MatchOpType(taicpu(p),top_reg,top_reg) and
  8263. MatchInstruction(hp1, A_SAR, []) then
  8264. begin
  8265. if MatchOperand(taicpu(hp1).oper[0]^, 31) then
  8266. begin
  8267. { the use of %edx also covers the opsize being S_L }
  8268. if MatchOperand(taicpu(hp1).oper[1]^, NR_EDX) then
  8269. begin
  8270. { Note it has to be specifically "movl %eax,%edx", and those specific sub-registers }
  8271. if (taicpu(p).oper[0]^.reg = NR_EAX) and
  8272. (taicpu(p).oper[1]^.reg = NR_EDX) then
  8273. begin
  8274. { Change:
  8275. movl %eax,%edx
  8276. sarl $31,%edx
  8277. To:
  8278. cltd
  8279. }
  8280. DebugMsg(SPeepholeOptimization + 'MovSar2Cltd', p);
  8281. RemoveInstruction(hp1);
  8282. taicpu(p).opcode := A_CDQ;
  8283. taicpu(p).opsize := S_NO;
  8284. taicpu(p).clearop(1);
  8285. taicpu(p).clearop(0);
  8286. taicpu(p).ops:=0;
  8287. Result := True;
  8288. end
  8289. else if (cs_opt_size in current_settings.optimizerswitches) and
  8290. (taicpu(p).oper[0]^.reg = NR_EDX) and
  8291. (taicpu(p).oper[1]^.reg = NR_EAX) then
  8292. begin
  8293. { Change:
  8294. movl %edx,%eax
  8295. sarl $31,%edx
  8296. To:
  8297. movl %edx,%eax
  8298. cltd
  8299. Note that this creates a dependency between the two instructions,
  8300. so only perform if optimising for size.
  8301. }
  8302. DebugMsg(SPeepholeOptimization + 'MovSar2MovCltd', p);
  8303. taicpu(hp1).opcode := A_CDQ;
  8304. taicpu(hp1).opsize := S_NO;
  8305. taicpu(hp1).clearop(1);
  8306. taicpu(hp1).clearop(0);
  8307. taicpu(hp1).ops:=0;
  8308. end;
  8309. {$ifndef x86_64}
  8310. end
  8311. { Don't bother if CMOV is supported, because a more optimal
  8312. sequence would have been generated for the Abs() intrinsic }
  8313. else if not(CPUX86_HAS_CMOV in cpu_capabilities[current_settings.cputype]) and
  8314. { the use of %eax also covers the opsize being S_L }
  8315. MatchOperand(taicpu(hp1).oper[1]^, NR_EAX) and
  8316. (taicpu(p).oper[0]^.reg = NR_EAX) and
  8317. (taicpu(p).oper[1]^.reg = NR_EDX) and
  8318. GetNextInstruction(hp1, hp2) and
  8319. MatchInstruction(hp2, A_XOR, [S_L]) and
  8320. MatchOperand(taicpu(hp2).oper[0]^, NR_EAX) and
  8321. MatchOperand(taicpu(hp2).oper[1]^, NR_EDX) and
  8322. GetNextInstruction(hp2, hp3) and
  8323. MatchInstruction(hp3, A_SUB, [S_L]) and
  8324. MatchOperand(taicpu(hp3).oper[0]^, NR_EAX) and
  8325. MatchOperand(taicpu(hp3).oper[1]^, NR_EDX) then
  8326. begin
  8327. { Change:
  8328. movl %eax,%edx
  8329. sarl $31,%eax
  8330. xorl %eax,%edx
  8331. subl %eax,%edx
  8332. (Instruction that uses %edx)
  8333. (%eax deallocated)
  8334. (%edx deallocated)
  8335. To:
  8336. cltd
  8337. xorl %edx,%eax <-- Note the registers have swapped
  8338. subl %edx,%eax
  8339. (Instruction that uses %eax) <-- %eax rather than %edx
  8340. }
  8341. TransferUsedRegs(TmpUsedRegs);
  8342. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  8343. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  8344. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  8345. if not RegUsedAfterInstruction(NR_EAX, hp3, TmpUsedRegs) then
  8346. begin
  8347. if GetNextInstruction(hp3, hp4) and
  8348. not RegModifiedByInstruction(NR_EDX, hp4) and
  8349. not RegUsedAfterInstruction(NR_EDX, hp4, TmpUsedRegs) then
  8350. begin
  8351. DebugMsg(SPeepholeOptimization + 'abs() intrinsic optimisation', p);
  8352. taicpu(p).opcode := A_CDQ;
  8353. taicpu(p).clearop(1);
  8354. taicpu(p).clearop(0);
  8355. taicpu(p).ops:=0;
  8356. RemoveInstruction(hp1);
  8357. taicpu(hp2).loadreg(0, NR_EDX);
  8358. taicpu(hp2).loadreg(1, NR_EAX);
  8359. taicpu(hp3).loadreg(0, NR_EDX);
  8360. taicpu(hp3).loadreg(1, NR_EAX);
  8361. AllocRegBetween(NR_EAX, hp3, hp4, TmpUsedRegs);
  8362. { Convert references in the following instruction (hp4) from %edx to %eax }
  8363. for OperIdx := 0 to taicpu(hp4).ops - 1 do
  8364. with taicpu(hp4).oper[OperIdx]^ do
  8365. case typ of
  8366. top_reg:
  8367. if getsupreg(reg) = RS_EDX then
  8368. reg := newreg(R_INTREGISTER,RS_EAX,getsubreg(reg));
  8369. top_ref:
  8370. begin
  8371. if getsupreg(reg) = RS_EDX then
  8372. ref^.base := newreg(R_INTREGISTER,RS_EAX,getsubreg(reg));
  8373. if getsupreg(reg) = RS_EDX then
  8374. ref^.index := newreg(R_INTREGISTER,RS_EAX,getsubreg(reg));
  8375. end;
  8376. else
  8377. ;
  8378. end;
  8379. end;
  8380. end;
  8381. {$else x86_64}
  8382. end;
  8383. end
  8384. else if MatchOperand(taicpu(hp1).oper[0]^, 63) and
  8385. { the use of %rdx also covers the opsize being S_Q }
  8386. MatchOperand(taicpu(hp1).oper[1]^, NR_RDX) then
  8387. begin
  8388. { Note it has to be specifically "movq %rax,%rdx", and those specific sub-registers }
  8389. if (taicpu(p).oper[0]^.reg = NR_RAX) and
  8390. (taicpu(p).oper[1]^.reg = NR_RDX) then
  8391. begin
  8392. { Change:
  8393. movq %rax,%rdx
  8394. sarq $63,%rdx
  8395. To:
  8396. cqto
  8397. }
  8398. DebugMsg(SPeepholeOptimization + 'MovSar2Cqto', p);
  8399. RemoveInstruction(hp1);
  8400. taicpu(p).opcode := A_CQO;
  8401. taicpu(p).opsize := S_NO;
  8402. taicpu(p).clearop(1);
  8403. taicpu(p).clearop(0);
  8404. taicpu(p).ops:=0;
  8405. Result := True;
  8406. end
  8407. else if (cs_opt_size in current_settings.optimizerswitches) and
  8408. (taicpu(p).oper[0]^.reg = NR_RDX) and
  8409. (taicpu(p).oper[1]^.reg = NR_RAX) then
  8410. begin
  8411. { Change:
  8412. movq %rdx,%rax
  8413. sarq $63,%rdx
  8414. To:
  8415. movq %rdx,%rax
  8416. cqto
  8417. Note that this creates a dependency between the two instructions,
  8418. so only perform if optimising for size.
  8419. }
  8420. DebugMsg(SPeepholeOptimization + 'MovSar2MovCqto', p);
  8421. taicpu(hp1).opcode := A_CQO;
  8422. taicpu(hp1).opsize := S_NO;
  8423. taicpu(hp1).clearop(1);
  8424. taicpu(hp1).clearop(0);
  8425. taicpu(hp1).ops:=0;
  8426. {$endif x86_64}
  8427. end;
  8428. end;
  8429. end
  8430. else if MatchInstruction(hp1, A_MOV, []) and
  8431. (taicpu(hp1).oper[1]^.typ = top_reg) then
  8432. { Though "GetNextInstruction" could be factored out, along with
  8433. the instructions that depend on hp2, it is an expensive call that
  8434. should be delayed for as long as possible, hence we do cheaper
  8435. checks first that are likely to be False. [Kit] }
  8436. begin
  8437. if (
  8438. (
  8439. MatchOperand(taicpu(p).oper[1]^, NR_EDX) and
  8440. (taicpu(hp1).oper[1]^.reg = NR_EAX) and
  8441. (
  8442. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8443. MatchOperand(taicpu(hp1).oper[0]^, NR_EDX)
  8444. )
  8445. ) or
  8446. (
  8447. MatchOperand(taicpu(p).oper[1]^, NR_EAX) and
  8448. (taicpu(hp1).oper[1]^.reg = NR_EDX) and
  8449. (
  8450. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8451. MatchOperand(taicpu(hp1).oper[0]^, NR_EAX)
  8452. )
  8453. )
  8454. ) and
  8455. GetNextInstruction(hp1, hp2) and
  8456. MatchInstruction(hp2, A_SAR, []) and
  8457. MatchOperand(taicpu(hp2).oper[0]^, 31) then
  8458. begin
  8459. if MatchOperand(taicpu(hp2).oper[1]^, NR_EDX) then
  8460. begin
  8461. { Change:
  8462. movl r/m,%edx movl r/m,%eax movl r/m,%edx movl r/m,%eax
  8463. movl %edx,%eax or movl %eax,%edx or movl r/m,%eax or movl r/m,%edx
  8464. sarl $31,%edx sarl $31,%edx sarl $31,%edx sarl $31,%edx
  8465. To:
  8466. movl r/m,%eax <- Note the change in register
  8467. cltd
  8468. }
  8469. DebugMsg(SPeepholeOptimization + 'MovMovSar2MovCltd', p);
  8470. AllocRegBetween(NR_EAX, p, hp1, UsedRegs);
  8471. taicpu(p).loadreg(1, NR_EAX);
  8472. taicpu(hp1).opcode := A_CDQ;
  8473. taicpu(hp1).clearop(1);
  8474. taicpu(hp1).clearop(0);
  8475. taicpu(hp1).ops:=0;
  8476. RemoveInstruction(hp2);
  8477. (*
  8478. {$ifdef x86_64}
  8479. end
  8480. else if MatchOperand(taicpu(hp2).oper[1]^, NR_RDX) and
  8481. { This code sequence does not get generated - however it might become useful
  8482. if and when 128-bit signed integer types make an appearance, so the code
  8483. is kept here for when it is eventually needed. [Kit] }
  8484. (
  8485. (
  8486. (taicpu(hp1).oper[1]^.reg = NR_RAX) and
  8487. (
  8488. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8489. MatchOperand(taicpu(hp1).oper[0]^, NR_RDX)
  8490. )
  8491. ) or
  8492. (
  8493. (taicpu(hp1).oper[1]^.reg = NR_RDX) and
  8494. (
  8495. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) or
  8496. MatchOperand(taicpu(hp1).oper[0]^, NR_RAX)
  8497. )
  8498. )
  8499. ) and
  8500. GetNextInstruction(hp1, hp2) and
  8501. MatchInstruction(hp2, A_SAR, [S_Q]) and
  8502. MatchOperand(taicpu(hp2).oper[0]^, 63) and
  8503. MatchOperand(taicpu(hp2).oper[1]^, NR_RDX) then
  8504. begin
  8505. { Change:
  8506. movq r/m,%rdx movq r/m,%rax movq r/m,%rdx movq r/m,%rax
  8507. movq %rdx,%rax or movq %rax,%rdx or movq r/m,%rax or movq r/m,%rdx
  8508. sarq $63,%rdx sarq $63,%rdx sarq $63,%rdx sarq $63,%rdx
  8509. To:
  8510. movq r/m,%rax <- Note the change in register
  8511. cqto
  8512. }
  8513. DebugMsg(SPeepholeOptimization + 'MovMovSar2MovCqto', p);
  8514. AllocRegBetween(NR_RAX, p, hp1, UsedRegs);
  8515. taicpu(p).loadreg(1, NR_RAX);
  8516. taicpu(hp1).opcode := A_CQO;
  8517. taicpu(hp1).clearop(1);
  8518. taicpu(hp1).clearop(0);
  8519. taicpu(hp1).ops:=0;
  8520. RemoveInstruction(hp2);
  8521. {$endif x86_64}
  8522. *)
  8523. end;
  8524. end;
  8525. {$ifdef x86_64}
  8526. end
  8527. else if (taicpu(p).opsize = S_L) and
  8528. (taicpu(p).oper[1]^.typ = top_reg) and
  8529. (
  8530. MatchInstruction(hp1, A_MOV,[]) and
  8531. (taicpu(hp1).opsize = S_L) and
  8532. (taicpu(hp1).oper[1]^.typ = top_reg)
  8533. ) and (
  8534. GetNextInstruction(hp1, hp2) and
  8535. (tai(hp2).typ=ait_instruction) and
  8536. (taicpu(hp2).opsize = S_Q) and
  8537. (
  8538. (
  8539. MatchInstruction(hp2, A_ADD,[]) and
  8540. (taicpu(hp2).opsize = S_Q) and
  8541. (taicpu(hp2).oper[0]^.typ = top_reg) and (taicpu(hp2).oper[1]^.typ = top_reg) and
  8542. (
  8543. (
  8544. (getsupreg(taicpu(hp2).oper[0]^.reg) = getsupreg(taicpu(p).oper[1]^.reg)) and
  8545. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg))
  8546. ) or (
  8547. (getsupreg(taicpu(hp2).oper[0]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) and
  8548. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(p).oper[1]^.reg))
  8549. )
  8550. )
  8551. ) or (
  8552. MatchInstruction(hp2, A_LEA,[]) and
  8553. (taicpu(hp2).oper[0]^.ref^.offset = 0) and
  8554. (taicpu(hp2).oper[0]^.ref^.scalefactor <= 1) and
  8555. (
  8556. (
  8557. (getsupreg(taicpu(hp2).oper[0]^.ref^.base) = getsupreg(taicpu(p).oper[1]^.reg)) and
  8558. (getsupreg(taicpu(hp2).oper[0]^.ref^.index) = getsupreg(taicpu(hp1).oper[1]^.reg))
  8559. ) or (
  8560. (getsupreg(taicpu(hp2).oper[0]^.ref^.base) = getsupreg(taicpu(hp1).oper[1]^.reg)) and
  8561. (getsupreg(taicpu(hp2).oper[0]^.ref^.index) = getsupreg(taicpu(p).oper[1]^.reg))
  8562. )
  8563. ) and (
  8564. (
  8565. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg))
  8566. ) or (
  8567. (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(p).oper[1]^.reg))
  8568. )
  8569. )
  8570. )
  8571. )
  8572. ) and (
  8573. GetNextInstruction(hp2, hp3) and
  8574. MatchInstruction(hp3, A_SHR,[]) and
  8575. (taicpu(hp3).opsize = S_Q) and
  8576. (taicpu(hp3).oper[0]^.typ = top_const) and (taicpu(hp2).oper[1]^.typ = top_reg) and
  8577. (taicpu(hp3).oper[0]^.val = 1) and
  8578. (taicpu(hp3).oper[1]^.reg = taicpu(hp2).oper[1]^.reg)
  8579. ) then
  8580. begin
  8581. { Change movl x, reg1d movl x, reg1d
  8582. movl y, reg2d movl y, reg2d
  8583. addq reg2q,reg1q or leaq (reg1q,reg2q),reg1q
  8584. shrq $1, reg1q shrq $1, reg1q
  8585. ( reg1d and reg2d can be switched around in the first two instructions )
  8586. To movl x, reg1d
  8587. addl y, reg1d
  8588. rcrl $1, reg1d
  8589. This corresponds to the common expression (x + y) shr 1, where
  8590. x and y are Cardinals (replacing "shr 1" with "div 2" produces
  8591. smaller code, but won't account for x + y causing an overflow). [Kit]
  8592. }
  8593. if (getsupreg(taicpu(hp2).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) then
  8594. { Change first MOV command to have the same register as the final output }
  8595. taicpu(p).oper[1]^.reg := taicpu(hp1).oper[1]^.reg
  8596. else
  8597. taicpu(hp1).oper[1]^.reg := taicpu(p).oper[1]^.reg;
  8598. { Change second MOV command to an ADD command. This is easier than
  8599. converting the existing command because it means we don't have to
  8600. touch 'y', which might be a complicated reference, and also the
  8601. fact that the third command might either be ADD or LEA. [Kit] }
  8602. taicpu(hp1).opcode := A_ADD;
  8603. { Delete old ADD/LEA instruction }
  8604. RemoveInstruction(hp2);
  8605. { Convert "shrq $1, reg1q" to "rcr $1, reg1d" }
  8606. taicpu(hp3).opcode := A_RCR;
  8607. taicpu(hp3).changeopsize(S_L);
  8608. setsubreg(taicpu(hp3).oper[1]^.reg, R_SUBD);
  8609. {$endif x86_64}
  8610. end;
  8611. if FuncMov2Func(p, hp1) then
  8612. begin
  8613. Result := True;
  8614. Exit;
  8615. end;
  8616. end;
  8617. {$push}
  8618. {$q-}{$r-}
  8619. function TX86AsmOptimizer.OptPass2Movx(var p : tai) : boolean;
  8620. var
  8621. ThisReg: TRegister;
  8622. MinSize, MaxSize, TryShiftDown, TargetSize: TOpSize;
  8623. TargetSubReg: TSubRegister;
  8624. hp1, hp2: tai;
  8625. RegInUse, RegChanged, p_removed, hp1_removed: Boolean;
  8626. { Store list of found instructions so we don't have to call
  8627. GetNextInstructionUsingReg multiple times }
  8628. InstrList: array of taicpu;
  8629. InstrMax, Index: Integer;
  8630. UpperLimit, SignedUpperLimit, SignedUpperLimitBottom,
  8631. LowerLimit, SignedLowerLimit, SignedLowerLimitBottom,
  8632. TryShiftDownLimit, TryShiftDownSignedLimit, TryShiftDownSignedLimitLower,
  8633. WorkingValue: TCgInt;
  8634. PreMessage: string;
  8635. { Data flow analysis }
  8636. TestValMin, TestValMax, TestValSignedMax: TCgInt;
  8637. BitwiseOnly, OrXorUsed,
  8638. ShiftDownOverflow, UpperSignedOverflow, UpperUnsignedOverflow, LowerSignedOverflow, LowerUnsignedOverflow: Boolean;
  8639. function CheckOverflowConditions: Boolean;
  8640. begin
  8641. Result := True;
  8642. if (TestValSignedMax > SignedUpperLimit) then
  8643. UpperSignedOverflow := True;
  8644. if (TestValSignedMax > SignedLowerLimit) or (TestValSignedMax < SignedLowerLimitBottom) then
  8645. LowerSignedOverflow := True;
  8646. if (TestValMin > LowerLimit) or (TestValMax > LowerLimit) then
  8647. LowerUnsignedOverflow := True;
  8648. if (TestValMin > UpperLimit) or (TestValMax > UpperLimit) or (TestValSignedMax > UpperLimit) or
  8649. (TestValMin < SignedUpperLimitBottom) or (TestValMax < SignedUpperLimitBottom) or (TestValSignedMax < SignedUpperLimitBottom) then
  8650. begin
  8651. { Absolute overflow }
  8652. Result := False;
  8653. Exit;
  8654. end;
  8655. if not ShiftDownOverflow and (TryShiftDown <> S_NO) and
  8656. ((TestValMin > TryShiftDownLimit) or (TestValMax > TryShiftDownLimit)) then
  8657. ShiftDownOverflow := True;
  8658. if (TestValMin < 0) or (TestValMax < 0) then
  8659. begin
  8660. LowerUnsignedOverflow := True;
  8661. UpperUnsignedOverflow := True;
  8662. end;
  8663. end;
  8664. function AdjustInitialLoadAndSize: Boolean;
  8665. begin
  8666. Result := False;
  8667. if not p_removed then
  8668. begin
  8669. if TargetSize = MinSize then
  8670. begin
  8671. { Convert the input MOVZX to a MOV }
  8672. if (taicpu(p).oper[0]^.typ = top_reg) and
  8673. SuperRegistersEqual(taicpu(p).oper[0]^.reg, ThisReg) then
  8674. begin
  8675. { Or remove it completely! }
  8676. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 1', p);
  8677. RemoveCurrentP(p);
  8678. p_removed := True;
  8679. end
  8680. else
  8681. begin
  8682. DebugMsg(SPeepholeOptimization + 'Movzx2Mov 1', p);
  8683. taicpu(p).opcode := A_MOV;
  8684. taicpu(p).oper[1]^.reg := ThisReg;
  8685. taicpu(p).opsize := TargetSize;
  8686. end;
  8687. Result := True;
  8688. end
  8689. else if TargetSize <> MaxSize then
  8690. begin
  8691. case MaxSize of
  8692. S_L:
  8693. if TargetSize = S_W then
  8694. begin
  8695. DebugMsg(SPeepholeOptimization + 'movzbl2movzbw', p);
  8696. taicpu(p).opsize := S_BW;
  8697. taicpu(p).oper[1]^.reg := ThisReg;
  8698. Result := True;
  8699. end
  8700. else
  8701. InternalError(2020112341);
  8702. S_W:
  8703. if TargetSize = S_L then
  8704. begin
  8705. DebugMsg(SPeepholeOptimization + 'movzbw2movzbl', p);
  8706. taicpu(p).opsize := S_BL;
  8707. taicpu(p).oper[1]^.reg := ThisReg;
  8708. Result := True;
  8709. end
  8710. else
  8711. InternalError(2020112342);
  8712. else
  8713. ;
  8714. end;
  8715. end
  8716. else if not hp1_removed and not RegInUse then
  8717. begin
  8718. { If we have something like:
  8719. movzbl (oper),%regd
  8720. add x, %regd
  8721. movzbl %regb, %regd
  8722. We can reduce the register size to the input of the final
  8723. movzbl instruction. Overflows won't have any effect.
  8724. }
  8725. if (taicpu(p).opsize in [S_BW, S_BL]) and
  8726. (taicpu(hp1).opsize in [S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}]) then
  8727. begin
  8728. TargetSize := S_B;
  8729. setsubreg(ThisReg, R_SUBL);
  8730. Result := True;
  8731. end
  8732. else if (taicpu(p).opsize = S_WL) and
  8733. (taicpu(hp1).opsize in [S_WL{$ifdef x86_64}, S_BQ{$endif x86_64}]) then
  8734. begin
  8735. TargetSize := S_W;
  8736. setsubreg(ThisReg, R_SUBW);
  8737. Result := True;
  8738. end;
  8739. if Result then
  8740. begin
  8741. { Convert the input MOVZX to a MOV }
  8742. if (taicpu(p).oper[0]^.typ = top_reg) and
  8743. SuperRegistersEqual(taicpu(p).oper[0]^.reg, ThisReg) then
  8744. begin
  8745. { Or remove it completely! }
  8746. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 1a', p);
  8747. RemoveCurrentP(p);
  8748. p_removed := True;
  8749. end
  8750. else
  8751. begin
  8752. DebugMsg(SPeepholeOptimization + 'Movzx2Mov 1a', p);
  8753. taicpu(p).opcode := A_MOV;
  8754. taicpu(p).oper[1]^.reg := ThisReg;
  8755. taicpu(p).opsize := TargetSize;
  8756. end;
  8757. end;
  8758. end;
  8759. end;
  8760. end;
  8761. procedure AdjustFinalLoad;
  8762. begin
  8763. if not LowerUnsignedOverflow then
  8764. begin
  8765. if ((TargetSize = S_L) and (taicpu(hp1).opsize in [S_L, S_BL, S_WL])) or
  8766. ((TargetSize = S_W) and (taicpu(hp1).opsize in [S_W, S_BW])) then
  8767. begin
  8768. { Convert the output MOVZX to a MOV }
  8769. if SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  8770. begin
  8771. { Or remove it completely! }
  8772. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 2', hp1);
  8773. { Be careful; if p = hp1 and p was also removed, p
  8774. will become a dangling pointer }
  8775. if p = hp1 then
  8776. begin
  8777. RemoveCurrentp(p); { p = hp1 and will then become the next instruction }
  8778. p_removed := True;
  8779. end
  8780. else
  8781. RemoveInstruction(hp1);
  8782. hp1_removed := True;
  8783. end
  8784. else
  8785. begin
  8786. DebugMsg(SPeepholeOptimization + 'Movzx2Mov 2', hp1);
  8787. taicpu(hp1).opcode := A_MOV;
  8788. taicpu(hp1).oper[0]^.reg := ThisReg;
  8789. taicpu(hp1).opsize := TargetSize;
  8790. end;
  8791. end
  8792. else if (TargetSize = S_B) and (MaxSize = S_W) and (taicpu(hp1).opsize = S_WL) then
  8793. begin
  8794. { Need to change the size of the output }
  8795. DebugMsg(SPeepholeOptimization + 'movzwl2movzbl 2', hp1);
  8796. taicpu(hp1).oper[0]^.reg := ThisReg;
  8797. taicpu(hp1).opsize := S_BL;
  8798. end;
  8799. end;
  8800. end;
  8801. function CompressInstructions: Boolean;
  8802. var
  8803. LocalIndex: Integer;
  8804. begin
  8805. Result := False;
  8806. { The objective here is to try to find a combination that
  8807. removes one of the MOV/Z instructions. }
  8808. if (
  8809. (taicpu(p).oper[0]^.typ <> top_reg) or
  8810. not SuperRegistersEqual(taicpu(p).oper[0]^.reg, ThisReg)
  8811. ) and
  8812. (taicpu(hp1).oper[1]^.typ = top_reg) and
  8813. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  8814. begin
  8815. { Make a preference to remove the second MOVZX instruction }
  8816. case taicpu(hp1).opsize of
  8817. S_BL, S_WL:
  8818. begin
  8819. TargetSize := S_L;
  8820. TargetSubReg := R_SUBD;
  8821. end;
  8822. S_BW:
  8823. begin
  8824. TargetSize := S_W;
  8825. TargetSubReg := R_SUBW;
  8826. end;
  8827. else
  8828. InternalError(2020112302);
  8829. end;
  8830. end
  8831. else
  8832. begin
  8833. if LowerUnsignedOverflow and not UpperUnsignedOverflow then
  8834. begin
  8835. { Exceeded lower bound but not upper bound }
  8836. TargetSize := MaxSize;
  8837. end
  8838. else if not LowerUnsignedOverflow then
  8839. begin
  8840. { Size didn't exceed lower bound }
  8841. TargetSize := MinSize;
  8842. end
  8843. else
  8844. Exit;
  8845. end;
  8846. case TargetSize of
  8847. S_B:
  8848. TargetSubReg := R_SUBL;
  8849. S_W:
  8850. TargetSubReg := R_SUBW;
  8851. S_L:
  8852. TargetSubReg := R_SUBD;
  8853. else
  8854. InternalError(2020112350);
  8855. end;
  8856. { Update the register to its new size }
  8857. setsubreg(ThisReg, TargetSubReg);
  8858. RegInUse := False;
  8859. if not SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  8860. begin
  8861. { Check to see if the active register is used afterwards;
  8862. if not, we can change it and make a saving. }
  8863. TransferUsedRegs(TmpUsedRegs);
  8864. { The target register may be marked as in use to cross
  8865. a jump to a distant label, so exclude it }
  8866. ExcludeRegFromUsedRegs(taicpu(hp1).oper[1]^.reg, TmpUsedRegs);
  8867. hp2 := p;
  8868. repeat
  8869. { Explicitly check for the excluded register (don't include the first
  8870. instruction as it may be reading from here }
  8871. if ((p <> hp2) and (RegInInstruction(taicpu(hp1).oper[1]^.reg, hp2))) or
  8872. RegInUsedRegs(taicpu(hp1).oper[1]^.reg, TmpUsedRegs) then
  8873. begin
  8874. RegInUse := True;
  8875. Break;
  8876. end;
  8877. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  8878. if not GetNextInstruction(hp2, hp2) then
  8879. InternalError(2020112340);
  8880. until (hp2 = hp1);
  8881. if not RegInUse and RegUsedAfterInstruction(ThisReg, hp1, TmpUsedRegs) then
  8882. { We might still be able to get away with this }
  8883. RegInUse := not
  8884. (
  8885. GetNextInstructionUsingReg(hp1, hp2, ThisReg) and
  8886. (hp2.typ = ait_instruction) and
  8887. (
  8888. { Under -O1 and -O2, GetNextInstructionUsingReg may return an
  8889. instruction that doesn't actually contain ThisReg }
  8890. (cs_opt_level3 in current_settings.optimizerswitches) or
  8891. RegInInstruction(ThisReg, hp2)
  8892. ) and
  8893. RegLoadedWithNewValue(ThisReg, hp2)
  8894. );
  8895. if not RegInUse then
  8896. begin
  8897. { Force the register size to the same as this instruction so it can be removed}
  8898. if (taicpu(hp1).opsize in [S_L, S_BL, S_WL]) then
  8899. begin
  8900. TargetSize := S_L;
  8901. TargetSubReg := R_SUBD;
  8902. end
  8903. else if (taicpu(hp1).opsize in [S_W, S_BW]) then
  8904. begin
  8905. TargetSize := S_W;
  8906. TargetSubReg := R_SUBW;
  8907. end;
  8908. ThisReg := taicpu(hp1).oper[1]^.reg;
  8909. setsubreg(ThisReg, TargetSubReg);
  8910. RegChanged := True;
  8911. DebugMsg(SPeepholeOptimization + 'Simplified register usage so ' + debug_regname(ThisReg) + ' = ' + debug_regname(taicpu(p).oper[1]^.reg), p);
  8912. TransferUsedRegs(TmpUsedRegs);
  8913. AllocRegBetween(ThisReg, p, hp1, TmpUsedRegs);
  8914. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 3', hp1);
  8915. if p = hp1 then
  8916. begin
  8917. RemoveCurrentp(p); { p = hp1 and will then become the next instruction }
  8918. p_removed := True;
  8919. end
  8920. else
  8921. RemoveInstruction(hp1);
  8922. hp1_removed := True;
  8923. { Instruction will become "mov %reg,%reg" }
  8924. if not p_removed and (taicpu(p).opcode = A_MOV) and
  8925. MatchOperand(taicpu(p).oper[0]^, ThisReg) then
  8926. begin
  8927. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 6', p);
  8928. RemoveCurrentP(p);
  8929. p_removed := True;
  8930. end
  8931. else
  8932. taicpu(p).oper[1]^.reg := ThisReg;
  8933. Result := True;
  8934. end
  8935. else
  8936. begin
  8937. if TargetSize <> MaxSize then
  8938. begin
  8939. { Since the register is in use, we have to force it to
  8940. MaxSize otherwise part of it may become undefined later on }
  8941. TargetSize := MaxSize;
  8942. case TargetSize of
  8943. S_B:
  8944. TargetSubReg := R_SUBL;
  8945. S_W:
  8946. TargetSubReg := R_SUBW;
  8947. S_L:
  8948. TargetSubReg := R_SUBD;
  8949. else
  8950. InternalError(2020112351);
  8951. end;
  8952. setsubreg(ThisReg, TargetSubReg);
  8953. end;
  8954. AdjustFinalLoad;
  8955. end;
  8956. end
  8957. else
  8958. AdjustFinalLoad;
  8959. Result := AdjustInitialLoadAndSize or Result;
  8960. { Now go through every instruction we found and change the
  8961. size. If TargetSize = MaxSize, then almost no changes are
  8962. needed and Result can remain False if it hasn't been set
  8963. yet.
  8964. If RegChanged is True, then the register requires changing
  8965. and so the point about TargetSize = MaxSize doesn't apply. }
  8966. if ((TargetSize <> MaxSize) or RegChanged) and (InstrMax >= 0) then
  8967. begin
  8968. for LocalIndex := 0 to InstrMax do
  8969. begin
  8970. { If p_removed is true, then the original MOV/Z was removed
  8971. and removing the AND instruction may not be safe if it
  8972. appears first }
  8973. if (InstrList[LocalIndex].oper[InstrList[LocalIndex].ops - 1]^.typ <> top_reg) then
  8974. InternalError(2020112310);
  8975. if InstrList[LocalIndex].oper[0]^.typ = top_reg then
  8976. InstrList[LocalIndex].oper[0]^.reg := ThisReg;
  8977. InstrList[LocalIndex].oper[InstrList[LocalIndex].ops - 1]^.reg := ThisReg;
  8978. InstrList[LocalIndex].opsize := TargetSize;
  8979. end;
  8980. Result := True;
  8981. end;
  8982. end;
  8983. begin
  8984. Result := False;
  8985. p_removed := False;
  8986. hp1_removed := False;
  8987. ThisReg := taicpu(p).oper[1]^.reg;
  8988. { Check for:
  8989. movs/z ###,%ecx (or %cx or %rcx)
  8990. ...
  8991. shl/shr/sar/rcl/rcr/ror/rol %cl,###
  8992. (dealloc %ecx)
  8993. Change to:
  8994. mov ###,%cl (if ### = %cl, then remove completely)
  8995. ...
  8996. shl/shr/sar/rcl/rcr/ror/rol %cl,###
  8997. }
  8998. if (getsupreg(ThisReg) = RS_ECX) and
  8999. GetNextInstructionUsingReg(p, hp1, NR_ECX) and
  9000. (hp1.typ = ait_instruction) and
  9001. (
  9002. { Under -O1 and -O2, GetNextInstructionUsingReg may return an
  9003. instruction that doesn't actually contain ECX }
  9004. (cs_opt_level3 in current_settings.optimizerswitches) or
  9005. RegInInstruction(NR_ECX, hp1) or
  9006. (
  9007. { It's common for the shift/rotate's read/write register to be
  9008. initialised in between, so under -O2 and under, search ahead
  9009. one more instruction
  9010. }
  9011. GetNextInstruction(hp1, hp1) and
  9012. (hp1.typ = ait_instruction) and
  9013. RegInInstruction(NR_ECX, hp1)
  9014. )
  9015. ) and
  9016. MatchInstruction(hp1, [A_SHL, A_SHR, A_SAR, A_ROR, A_ROL, A_RCR, A_RCL], []) and
  9017. (taicpu(hp1).oper[0]^.typ = top_reg) { This is enough to determine that it's %cl } then
  9018. begin
  9019. TransferUsedRegs(TmpUsedRegs);
  9020. hp2 := p;
  9021. repeat
  9022. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  9023. until not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  9024. if not RegUsedAfterInstruction(NR_CL, hp1, TmpUsedRegs) then
  9025. begin
  9026. case taicpu(p).opsize of
  9027. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  9028. if MatchOperand(taicpu(p).oper[0]^, NR_CL) then
  9029. begin
  9030. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 3a', p);
  9031. RemoveCurrentP(p);
  9032. end
  9033. else
  9034. begin
  9035. taicpu(p).opcode := A_MOV;
  9036. taicpu(p).opsize := S_B;
  9037. taicpu(p).oper[1]^.reg := NR_CL;
  9038. DebugMsg(SPeepholeOptimization + 'MovxOp2MovOp 1', p);
  9039. end;
  9040. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  9041. if MatchOperand(taicpu(p).oper[0]^, NR_CX) then
  9042. begin
  9043. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 3b', p);
  9044. RemoveCurrentP(p);
  9045. end
  9046. else
  9047. begin
  9048. taicpu(p).opcode := A_MOV;
  9049. taicpu(p).opsize := S_W;
  9050. taicpu(p).oper[1]^.reg := NR_CX;
  9051. DebugMsg(SPeepholeOptimization + 'MovxOp2MovOp 2', p);
  9052. end;
  9053. {$ifdef x86_64}
  9054. S_LQ:
  9055. if MatchOperand(taicpu(p).oper[0]^, NR_ECX) then
  9056. begin
  9057. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 3c', p);
  9058. RemoveCurrentP(p);
  9059. end
  9060. else
  9061. begin
  9062. taicpu(p).opcode := A_MOV;
  9063. taicpu(p).opsize := S_L;
  9064. taicpu(p).oper[1]^.reg := NR_ECX;
  9065. DebugMsg(SPeepholeOptimization + 'MovxOp2MovOp 3', p);
  9066. end;
  9067. {$endif x86_64}
  9068. else
  9069. InternalError(2021120401);
  9070. end;
  9071. Result := True;
  9072. Exit;
  9073. end;
  9074. end;
  9075. { This is anything but quick! }
  9076. if not(cs_opt_level2 in current_settings.optimizerswitches) then
  9077. Exit;
  9078. SetLength(InstrList, 0);
  9079. InstrMax := -1;
  9080. case taicpu(p).opsize of
  9081. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  9082. begin
  9083. {$if defined(i386) or defined(i8086)}
  9084. { If the target size is 8-bit, make sure we can actually encode it }
  9085. if not (GetSupReg(ThisReg) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX]) then
  9086. Exit;
  9087. {$endif i386 or i8086}
  9088. LowerLimit := $FF;
  9089. SignedLowerLimit := $7F;
  9090. SignedLowerLimitBottom := -128;
  9091. MinSize := S_B;
  9092. if taicpu(p).opsize = S_BW then
  9093. begin
  9094. MaxSize := S_W;
  9095. UpperLimit := $FFFF;
  9096. SignedUpperLimit := $7FFF;
  9097. SignedUpperLimitBottom := -32768;
  9098. end
  9099. else
  9100. begin
  9101. { Keep at a 32-bit limit for BQ as well since one can't really optimise otherwise }
  9102. MaxSize := S_L;
  9103. UpperLimit := $FFFFFFFF;
  9104. SignedUpperLimit := $7FFFFFFF;
  9105. SignedUpperLimitBottom := -2147483648;
  9106. end;
  9107. end;
  9108. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  9109. begin
  9110. { Keep at a 32-bit limit for WQ as well since one can't really optimise otherwise }
  9111. LowerLimit := $FFFF;
  9112. SignedLowerLimit := $7FFF;
  9113. SignedLowerLimitBottom := -32768;
  9114. UpperLimit := $FFFFFFFF;
  9115. SignedUpperLimit := $7FFFFFFF;
  9116. SignedUpperLimitBottom := -2147483648;
  9117. MinSize := S_W;
  9118. MaxSize := S_L;
  9119. end;
  9120. {$ifdef x86_64}
  9121. S_LQ:
  9122. begin
  9123. { Both the lower and upper limits are set to 32-bit. If a limit
  9124. is breached, then optimisation is impossible }
  9125. LowerLimit := $FFFFFFFF;
  9126. SignedLowerLimit := $7FFFFFFF;
  9127. SignedLowerLimitBottom := -2147483648;
  9128. UpperLimit := $FFFFFFFF;
  9129. SignedUpperLimit := $7FFFFFFF;
  9130. SignedUpperLimitBottom := -2147483648;
  9131. MinSize := S_L;
  9132. MaxSize := S_L;
  9133. end;
  9134. {$endif x86_64}
  9135. else
  9136. InternalError(2020112301);
  9137. end;
  9138. TestValMin := 0;
  9139. TestValMax := LowerLimit;
  9140. TestValSignedMax := SignedLowerLimit;
  9141. TryShiftDownLimit := LowerLimit;
  9142. TryShiftDown := S_NO;
  9143. ShiftDownOverflow := False;
  9144. RegChanged := False;
  9145. BitwiseOnly := True;
  9146. OrXorUsed := False;
  9147. UpperSignedOverflow := False;
  9148. LowerSignedOverflow := False;
  9149. UpperUnsignedOverflow := False;
  9150. LowerUnsignedOverflow := False;
  9151. hp1 := p;
  9152. while GetNextInstructionUsingReg(hp1, hp1, ThisReg) and
  9153. (hp1.typ = ait_instruction) and
  9154. (
  9155. { Under -O1 and -O2, GetNextInstructionUsingReg may return an
  9156. instruction that doesn't actually contain ThisReg }
  9157. (cs_opt_level3 in current_settings.optimizerswitches) or
  9158. { This allows this Movx optimisation to work through the SETcc instructions
  9159. inserted by the 'CMP/JE/CMP/@Lbl/SETE -> CMP/SETE/CMP/SETE/OR'
  9160. optimisation on -O1 and -O2 (on -O3, GetNextInstructionUsingReg will
  9161. skip over these SETcc instructions). }
  9162. (taicpu(hp1).opcode = A_SETcc) or
  9163. RegInInstruction(ThisReg, hp1)
  9164. ) do
  9165. begin
  9166. case taicpu(hp1).opcode of
  9167. A_INC,A_DEC:
  9168. begin
  9169. { Has to be an exact match on the register }
  9170. if not MatchOperand(taicpu(hp1).oper[0]^, ThisReg) then
  9171. Break;
  9172. if taicpu(hp1).opcode = A_INC then
  9173. begin
  9174. Inc(TestValMin);
  9175. Inc(TestValMax);
  9176. Inc(TestValSignedMax);
  9177. end
  9178. else
  9179. begin
  9180. Dec(TestValMin);
  9181. Dec(TestValMax);
  9182. Dec(TestValSignedMax);
  9183. end;
  9184. end;
  9185. A_TEST, A_CMP:
  9186. begin
  9187. if (
  9188. { Too high a risk of non-linear behaviour that breaks DFA
  9189. here, unless it's cmp $0,%reg, which is equivalent to
  9190. test %reg,%reg }
  9191. OrXorUsed and
  9192. (taicpu(hp1).opcode = A_CMP) and
  9193. not Matchoperand(taicpu(hp1).oper[0]^, 0)
  9194. ) or
  9195. (taicpu(hp1).oper[1]^.typ <> top_reg) or
  9196. { Has to be an exact match on the register }
  9197. (taicpu(hp1).oper[1]^.reg <> ThisReg) or
  9198. (
  9199. { Permit "test %reg,%reg" }
  9200. (taicpu(hp1).opcode = A_TEST) and
  9201. (taicpu(hp1).oper[0]^.typ = top_reg) and
  9202. (taicpu(hp1).oper[0]^.reg <> ThisReg)
  9203. ) or
  9204. (taicpu(hp1).oper[0]^.typ <> top_const) or
  9205. { Make sure the comparison value is not smaller than the
  9206. smallest allowed signed value for the minimum size (e.g.
  9207. -128 for 8-bit) }
  9208. not (
  9209. ((taicpu(hp1).oper[0]^.val and LowerLimit) = taicpu(hp1).oper[0]^.val) or
  9210. { Is it in the negative range? }
  9211. (
  9212. (taicpu(hp1).oper[0]^.val < 0) and
  9213. (taicpu(hp1).oper[0]^.val >= SignedLowerLimitBottom)
  9214. )
  9215. ) then
  9216. Break;
  9217. { Check to see if the active register is used afterwards }
  9218. TransferUsedRegs(TmpUsedRegs);
  9219. IncludeRegInUsedRegs(ThisReg, TmpUsedRegs);
  9220. if not RegUsedAfterInstruction(ThisReg, hp1, TmpUsedRegs) then
  9221. begin
  9222. { Make sure the comparison or any previous instructions
  9223. hasn't pushed the test values outside of the range of
  9224. MinSize }
  9225. if LowerUnsignedOverflow and not UpperUnsignedOverflow then
  9226. begin
  9227. { Exceeded lower bound but not upper bound }
  9228. Exit;
  9229. end
  9230. else if not LowerSignedOverflow or not LowerUnsignedOverflow then
  9231. begin
  9232. { Size didn't exceed lower bound }
  9233. TargetSize := MinSize;
  9234. end
  9235. else
  9236. Break;
  9237. case TargetSize of
  9238. S_B:
  9239. TargetSubReg := R_SUBL;
  9240. S_W:
  9241. TargetSubReg := R_SUBW;
  9242. S_L:
  9243. TargetSubReg := R_SUBD;
  9244. else
  9245. InternalError(2021051002);
  9246. end;
  9247. if TargetSize <> MaxSize then
  9248. begin
  9249. { Update the register to its new size }
  9250. setsubreg(ThisReg, TargetSubReg);
  9251. DebugMsg(SPeepholeOptimization + 'CMP instruction resized thanks to register size optimisation (see MOV/Z assignment above)', hp1);
  9252. taicpu(hp1).oper[1]^.reg := ThisReg;
  9253. taicpu(hp1).opsize := TargetSize;
  9254. { Convert the input MOVZX to a MOV if necessary }
  9255. AdjustInitialLoadAndSize;
  9256. if (InstrMax >= 0) then
  9257. begin
  9258. for Index := 0 to InstrMax do
  9259. begin
  9260. { If p_removed is true, then the original MOV/Z was removed
  9261. and removing the AND instruction may not be safe if it
  9262. appears first }
  9263. if (InstrList[Index].oper[InstrList[Index].ops - 1]^.typ <> top_reg) then
  9264. InternalError(2020112311);
  9265. if InstrList[Index].oper[0]^.typ = top_reg then
  9266. InstrList[Index].oper[0]^.reg := ThisReg;
  9267. InstrList[Index].oper[InstrList[Index].ops - 1]^.reg := ThisReg;
  9268. InstrList[Index].opsize := MinSize;
  9269. end;
  9270. end;
  9271. Result := True;
  9272. end;
  9273. Exit;
  9274. end;
  9275. end;
  9276. A_SETcc:
  9277. begin
  9278. { This allows this Movx optimisation to work through the SETcc instructions
  9279. inserted by the 'CMP/JE/CMP/@Lbl/SETE -> CMP/SETE/CMP/SETE/OR'
  9280. optimisation on -O1 and -O2 (on -O3, GetNextInstructionUsingReg will
  9281. skip over these SETcc instructions). }
  9282. if (cs_opt_level3 in current_settings.optimizerswitches) or
  9283. { Of course, break out if the current register is used }
  9284. RegInOp(ThisReg, taicpu(hp1).oper[0]^) then
  9285. Break
  9286. else
  9287. { We must use Continue so the instruction doesn't get added
  9288. to InstrList }
  9289. Continue;
  9290. end;
  9291. A_ADD,A_SUB,A_AND,A_OR,A_XOR,A_SHL,A_SHR,A_SAR:
  9292. begin
  9293. if
  9294. (taicpu(hp1).oper[1]^.typ <> top_reg) or
  9295. { Has to be an exact match on the register }
  9296. (taicpu(hp1).oper[1]^.reg <> ThisReg) or not
  9297. (
  9298. (
  9299. (taicpu(hp1).oper[0]^.typ = top_const) and
  9300. (
  9301. (
  9302. (taicpu(hp1).opcode = A_SHL) and
  9303. (
  9304. ((MinSize = S_B) and (taicpu(hp1).oper[0]^.val < 8)) or
  9305. ((MinSize = S_W) and (taicpu(hp1).oper[0]^.val < 16)) or
  9306. ((MinSize = S_L) and (taicpu(hp1).oper[0]^.val < 32))
  9307. )
  9308. ) or (
  9309. (taicpu(hp1).opcode <> A_SHL) and
  9310. (
  9311. ((taicpu(hp1).oper[0]^.val and UpperLimit) = taicpu(hp1).oper[0]^.val) or
  9312. { Is it in the negative range? }
  9313. (((not taicpu(hp1).oper[0]^.val) and (UpperLimit shr 1)) = (not taicpu(hp1).oper[0]^.val))
  9314. )
  9315. )
  9316. )
  9317. ) or (
  9318. MatchOperand(taicpu(hp1).oper[0]^, taicpu(hp1).oper[1]^.reg) and
  9319. ((taicpu(hp1).opcode = A_ADD) or (taicpu(hp1).opcode = A_AND) or (taicpu(hp1).opcode = A_SUB))
  9320. )
  9321. ) then
  9322. Break;
  9323. { Only process OR and XOR if there are only bitwise operations,
  9324. since otherwise they can too easily fool the data flow
  9325. analysis (they can cause non-linear behaviour) }
  9326. case taicpu(hp1).opcode of
  9327. A_ADD:
  9328. begin
  9329. if OrXorUsed then
  9330. { Too high a risk of non-linear behaviour that breaks DFA here }
  9331. Break
  9332. else
  9333. BitwiseOnly := False;
  9334. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  9335. begin
  9336. TestValMin := TestValMin * 2;
  9337. TestValMax := TestValMax * 2;
  9338. TestValSignedMax := TestValSignedMax * 2;
  9339. end
  9340. else
  9341. begin
  9342. WorkingValue := taicpu(hp1).oper[0]^.val;
  9343. TestValMin := TestValMin + WorkingValue;
  9344. TestValMax := TestValMax + WorkingValue;
  9345. TestValSignedMax := TestValSignedMax + WorkingValue;
  9346. end;
  9347. end;
  9348. A_SUB:
  9349. begin
  9350. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  9351. begin
  9352. TestValMin := 0;
  9353. TestValMax := 0;
  9354. TestValSignedMax := 0;
  9355. end
  9356. else
  9357. begin
  9358. if OrXorUsed then
  9359. { Too high a risk of non-linear behaviour that breaks DFA here }
  9360. Break
  9361. else
  9362. BitwiseOnly := False;
  9363. WorkingValue := taicpu(hp1).oper[0]^.val;
  9364. TestValMin := TestValMin - WorkingValue;
  9365. TestValMax := TestValMax - WorkingValue;
  9366. TestValSignedMax := TestValSignedMax - WorkingValue;
  9367. end;
  9368. end;
  9369. A_AND:
  9370. if (taicpu(hp1).oper[0]^.typ = top_const) then
  9371. begin
  9372. { we might be able to go smaller if AND appears first }
  9373. if InstrMax = -1 then
  9374. case MinSize of
  9375. S_B:
  9376. ;
  9377. S_W:
  9378. if ((taicpu(hp1).oper[0]^.val and $FF) = taicpu(hp1).oper[0]^.val) or
  9379. ((not(taicpu(hp1).oper[0]^.val) and $7F) = (not taicpu(hp1).oper[0]^.val)) then
  9380. begin
  9381. TryShiftDown := S_B;
  9382. TryShiftDownLimit := $FF;
  9383. end;
  9384. S_L:
  9385. if ((taicpu(hp1).oper[0]^.val and $FF) = taicpu(hp1).oper[0]^.val) or
  9386. ((not(taicpu(hp1).oper[0]^.val) and $7F) = (not taicpu(hp1).oper[0]^.val)) then
  9387. begin
  9388. TryShiftDown := S_B;
  9389. TryShiftDownLimit := $FF;
  9390. end
  9391. else if ((taicpu(hp1).oper[0]^.val and $FFFF) = taicpu(hp1).oper[0]^.val) or
  9392. ((not(taicpu(hp1).oper[0]^.val) and $7FFF) = (not taicpu(hp1).oper[0]^.val)) then
  9393. begin
  9394. TryShiftDown := S_W;
  9395. TryShiftDownLimit := $FFFF;
  9396. end;
  9397. else
  9398. InternalError(2020112320);
  9399. end;
  9400. WorkingValue := taicpu(hp1).oper[0]^.val;
  9401. TestValMin := TestValMin and WorkingValue;
  9402. TestValMax := TestValMax and WorkingValue;
  9403. TestValSignedMax := TestValSignedMax and WorkingValue;
  9404. end;
  9405. A_OR:
  9406. begin
  9407. if not BitwiseOnly then
  9408. Break;
  9409. OrXorUsed := True;
  9410. WorkingValue := taicpu(hp1).oper[0]^.val;
  9411. TestValMin := TestValMin or WorkingValue;
  9412. TestValMax := TestValMax or WorkingValue;
  9413. TestValSignedMax := TestValSignedMax or WorkingValue;
  9414. end;
  9415. A_XOR:
  9416. begin
  9417. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  9418. begin
  9419. TestValMin := 0;
  9420. TestValMax := 0;
  9421. TestValSignedMax := 0;
  9422. end
  9423. else
  9424. begin
  9425. if not BitwiseOnly then
  9426. Break;
  9427. OrXorUsed := True;
  9428. WorkingValue := taicpu(hp1).oper[0]^.val;
  9429. TestValMin := TestValMin xor WorkingValue;
  9430. TestValMax := TestValMax xor WorkingValue;
  9431. TestValSignedMax := TestValSignedMax xor WorkingValue;
  9432. end;
  9433. end;
  9434. A_SHL:
  9435. begin
  9436. BitwiseOnly := False;
  9437. WorkingValue := taicpu(hp1).oper[0]^.val;
  9438. TestValMin := TestValMin shl WorkingValue;
  9439. TestValMax := TestValMax shl WorkingValue;
  9440. TestValSignedMax := TestValSignedMax shl WorkingValue;
  9441. end;
  9442. A_SHR,
  9443. { The first instruction was MOVZX, so the value won't be negative }
  9444. A_SAR:
  9445. begin
  9446. if InstrMax <> -1 then
  9447. BitwiseOnly := False
  9448. else
  9449. { we might be able to go smaller if SHR appears first }
  9450. case MinSize of
  9451. S_B:
  9452. ;
  9453. S_W:
  9454. if (taicpu(hp1).oper[0]^.val >= 8) then
  9455. begin
  9456. TryShiftDown := S_B;
  9457. TryShiftDownLimit := $FF;
  9458. TryShiftDownSignedLimit := $7F;
  9459. TryShiftDownSignedLimitLower := -128;
  9460. end;
  9461. S_L:
  9462. if (taicpu(hp1).oper[0]^.val >= 24) then
  9463. begin
  9464. TryShiftDown := S_B;
  9465. TryShiftDownLimit := $FF;
  9466. TryShiftDownSignedLimit := $7F;
  9467. TryShiftDownSignedLimitLower := -128;
  9468. end
  9469. else if (taicpu(hp1).oper[0]^.val >= 16) then
  9470. begin
  9471. TryShiftDown := S_W;
  9472. TryShiftDownLimit := $FFFF;
  9473. TryShiftDownSignedLimit := $7FFF;
  9474. TryShiftDownSignedLimitLower := -32768;
  9475. end;
  9476. else
  9477. InternalError(2020112321);
  9478. end;
  9479. WorkingValue := taicpu(hp1).oper[0]^.val;
  9480. if taicpu(hp1).opcode = A_SAR then
  9481. begin
  9482. TestValMin := SarInt64(TestValMin, WorkingValue);
  9483. TestValMax := SarInt64(TestValMax, WorkingValue);
  9484. TestValSignedMax := SarInt64(TestValSignedMax, WorkingValue);
  9485. end
  9486. else
  9487. begin
  9488. TestValMin := TestValMin shr WorkingValue;
  9489. TestValMax := TestValMax shr WorkingValue;
  9490. TestValSignedMax := TestValSignedMax shr WorkingValue;
  9491. end;
  9492. end;
  9493. else
  9494. InternalError(2020112303);
  9495. end;
  9496. end;
  9497. (*
  9498. A_IMUL:
  9499. case taicpu(hp1).ops of
  9500. 2:
  9501. begin
  9502. if not MatchOpType(hp1, top_reg, top_reg) or
  9503. { Has to be an exact match on the register }
  9504. (taicpu(hp1).oper[0]^.reg <> ThisReg) or
  9505. (taicpu(hp1).oper[1]^.reg <> ThisReg) then
  9506. Break;
  9507. TestValMin := TestValMin * TestValMin;
  9508. TestValMax := TestValMax * TestValMax;
  9509. TestValSignedMax := TestValSignedMax * TestValMax;
  9510. end;
  9511. 3:
  9512. begin
  9513. if not MatchOpType(hp1, top_const, top_reg, top_reg) or
  9514. { Has to be an exact match on the register }
  9515. (taicpu(hp1).oper[1]^.reg <> ThisReg) or
  9516. (taicpu(hp1).oper[2]^.reg <> ThisReg) or
  9517. ((taicpu(hp1).oper[0]^.val and UpperLimit) = taicpu(hp1).oper[0]^.val) or
  9518. { Is it in the negative range? }
  9519. (((not taicpu(hp1).oper[0]^.val) and (UpperLimit shr 1)) = (not taicpu(hp1).oper[0]^.val)) then
  9520. Break;
  9521. TestValMin := TestValMin * taicpu(hp1).oper[0]^.val;
  9522. TestValMax := TestValMax * taicpu(hp1).oper[0]^.val;
  9523. TestValSignedMax := TestValSignedMax * taicpu(hp1).oper[0]^.val;
  9524. end;
  9525. else
  9526. Break;
  9527. end;
  9528. A_IDIV:
  9529. case taicpu(hp1).ops of
  9530. 3:
  9531. begin
  9532. if not MatchOpType(hp1, top_const, top_reg, top_reg) or
  9533. { Has to be an exact match on the register }
  9534. (taicpu(hp1).oper[1]^.reg <> ThisReg) or
  9535. (taicpu(hp1).oper[2]^.reg <> ThisReg) or
  9536. ((taicpu(hp1).oper[0]^.val and UpperLimit) = taicpu(hp1).oper[0]^.val) or
  9537. { Is it in the negative range? }
  9538. (((not taicpu(hp1).oper[0]^.val) and (UpperLimit shr 1)) = (not taicpu(hp1).oper[0]^.val)) then
  9539. Break;
  9540. TestValMin := TestValMin div taicpu(hp1).oper[0]^.val;
  9541. TestValMax := TestValMax div taicpu(hp1).oper[0]^.val;
  9542. TestValSignedMax := TestValSignedMax div taicpu(hp1).oper[0]^.val;
  9543. end;
  9544. else
  9545. Break;
  9546. end;
  9547. *)
  9548. A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  9549. begin
  9550. { If there are no instructions in between, then we might be able to make a saving }
  9551. if UpperSignedOverflow or (taicpu(hp1).oper[0]^.typ <> top_reg) or (taicpu(hp1).oper[0]^.reg <> ThisReg) then
  9552. Break;
  9553. { We have something like:
  9554. movzbw %dl,%dx
  9555. ...
  9556. movswl %dx,%edx
  9557. Change the latter to a zero-extension then enter the
  9558. A_MOVZX case branch.
  9559. }
  9560. {$ifdef x86_64}
  9561. if (taicpu(hp1).opsize = S_LQ) and SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9562. begin
  9563. { this becomes a zero extension from 32-bit to 64-bit, but
  9564. the upper 32 bits are already zero, so just delete the
  9565. instruction }
  9566. DebugMsg(SPeepholeOptimization + 'MovzMovsxd2MovzNop', hp1);
  9567. RemoveInstruction(hp1);
  9568. Result := True;
  9569. Exit;
  9570. end
  9571. else
  9572. {$endif x86_64}
  9573. begin
  9574. DebugMsg(SPeepholeOptimization + 'MovzMovs2MovzMovz', hp1);
  9575. taicpu(hp1).opcode := A_MOVZX;
  9576. {$ifdef x86_64}
  9577. case taicpu(hp1).opsize of
  9578. S_BQ:
  9579. begin
  9580. taicpu(hp1).opsize := S_BL;
  9581. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  9582. end;
  9583. S_WQ:
  9584. begin
  9585. taicpu(hp1).opsize := S_WL;
  9586. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  9587. end;
  9588. S_LQ:
  9589. begin
  9590. taicpu(hp1).opcode := A_MOV;
  9591. taicpu(hp1).opsize := S_L;
  9592. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  9593. { In this instance, we need to break out because the
  9594. instruction is no longer MOVZX or MOVSXD }
  9595. Result := True;
  9596. Exit;
  9597. end;
  9598. else
  9599. ;
  9600. end;
  9601. {$endif x86_64}
  9602. Result := CompressInstructions;
  9603. Exit;
  9604. end;
  9605. end;
  9606. A_MOVZX:
  9607. begin
  9608. if UpperUnsignedOverflow or (taicpu(hp1).oper[0]^.typ <> top_reg) then
  9609. Break;
  9610. if not SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, ThisReg) then
  9611. begin
  9612. if (InstrMax = -1) and
  9613. { Will return false if the second parameter isn't ThisReg
  9614. (can happen on -O2 and under) }
  9615. Reg1WriteOverwritesReg2Entirely(taicpu(hp1).oper[1]^.reg, ThisReg) then
  9616. begin
  9617. { The two MOVZX instructions are adjacent, so remove the first one }
  9618. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 5', p);
  9619. RemoveCurrentP(p);
  9620. Result := True;
  9621. Exit;
  9622. end;
  9623. Break;
  9624. end;
  9625. Result := CompressInstructions;
  9626. Exit;
  9627. end;
  9628. else
  9629. { This includes ADC, SBB and IDIV }
  9630. Break;
  9631. end;
  9632. if not CheckOverflowConditions then
  9633. Break;
  9634. { Contains highest index (so instruction count - 1) }
  9635. Inc(InstrMax);
  9636. if InstrMax > High(InstrList) then
  9637. SetLength(InstrList, InstrMax + LIST_STEP_SIZE);
  9638. InstrList[InstrMax] := taicpu(hp1);
  9639. end;
  9640. end;
  9641. {$pop}
  9642. function TX86AsmOptimizer.OptPass2Imul(var p : tai) : boolean;
  9643. var
  9644. hp1 : tai;
  9645. begin
  9646. Result:=false;
  9647. if (taicpu(p).ops >= 2) and
  9648. ((taicpu(p).oper[0]^.typ = top_const) or
  9649. ((taicpu(p).oper[0]^.typ = top_ref) and (taicpu(p).oper[0]^.ref^.refaddr=addr_full))) and
  9650. (taicpu(p).oper[1]^.typ = top_reg) and
  9651. ((taicpu(p).ops = 2) or
  9652. ((taicpu(p).oper[2]^.typ = top_reg) and
  9653. (taicpu(p).oper[2]^.reg = taicpu(p).oper[1]^.reg))) and
  9654. GetLastInstruction(p,hp1) and
  9655. MatchInstruction(hp1,A_MOV,[]) and
  9656. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  9657. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  9658. begin
  9659. TransferUsedRegs(TmpUsedRegs);
  9660. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,p,TmpUsedRegs)) or
  9661. ((taicpu(p).ops = 3) and (taicpu(p).oper[1]^.reg=taicpu(p).oper[2]^.reg)) then
  9662. { change
  9663. mov reg1,reg2
  9664. imul y,reg2 to imul y,reg1,reg2 }
  9665. begin
  9666. taicpu(p).ops := 3;
  9667. taicpu(p).loadreg(2,taicpu(p).oper[1]^.reg);
  9668. taicpu(p).loadreg(1,taicpu(hp1).oper[0]^.reg);
  9669. DebugMsg(SPeepholeOptimization + 'MovImul2Imul done',p);
  9670. RemoveInstruction(hp1);
  9671. result:=true;
  9672. end;
  9673. end;
  9674. end;
  9675. procedure TX86AsmOptimizer.ConvertJumpToRET(const p: tai; const ret_p: tai);
  9676. var
  9677. ThisLabel: TAsmLabel;
  9678. begin
  9679. ThisLabel := tasmlabel(taicpu(p).oper[0]^.ref^.symbol);
  9680. ThisLabel.decrefs;
  9681. taicpu(p).condition := C_None;
  9682. taicpu(p).opcode := A_RET;
  9683. taicpu(p).is_jmp := false;
  9684. taicpu(p).ops := taicpu(ret_p).ops;
  9685. case taicpu(ret_p).ops of
  9686. 0:
  9687. taicpu(p).clearop(0);
  9688. 1:
  9689. taicpu(p).loadconst(0,taicpu(ret_p).oper[0]^.val);
  9690. else
  9691. internalerror(2016041301);
  9692. end;
  9693. { If the original label is now dead, it might turn out that the label
  9694. immediately follows p. As a result, everything beyond it, which will
  9695. be just some final register configuration and a RET instruction, is
  9696. now dead code. [Kit] }
  9697. { NOTE: This is much faster than introducing a OptPass2RET routine and
  9698. running RemoveDeadCodeAfterJump for each RET instruction, because
  9699. this optimisation rarely happens and most RETs appear at the end of
  9700. routines where there is nothing that can be stripped. [Kit] }
  9701. if not ThisLabel.is_used then
  9702. RemoveDeadCodeAfterJump(p);
  9703. end;
  9704. function TX86AsmOptimizer.OptPass2SETcc(var p: tai): boolean;
  9705. var
  9706. hp1,hp2,next: tai; SetC, JumpC: TAsmCond;
  9707. Unconditional, PotentialModified: Boolean;
  9708. OperPtr: POper;
  9709. NewRef: TReference;
  9710. InstrList: array of taicpu;
  9711. InstrMax, Index: Integer;
  9712. const
  9713. {$ifdef DEBUG_AOPTCPU}
  9714. SNoFlags: shortstring = ' so the flags aren''t modified';
  9715. {$else DEBUG_AOPTCPU}
  9716. SNoFlags = '';
  9717. {$endif DEBUG_AOPTCPU}
  9718. begin
  9719. Result:=false;
  9720. if MatchOpType(taicpu(p),top_reg) and GetNextInstructionUsingReg(p, hp1, taicpu(p).oper[0]^.reg) then
  9721. begin
  9722. if MatchInstruction(hp1, A_TEST, [S_B]) and
  9723. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  9724. (taicpu(hp1).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) and
  9725. (taicpu(p).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) and
  9726. GetNextInstruction(hp1, hp2) and
  9727. MatchInstruction(hp2, A_Jcc, A_SETcc, []) then
  9728. { Change from: To:
  9729. set(C) %reg j(~C) label
  9730. test %reg,%reg/cmp $0,%reg
  9731. je label
  9732. set(C) %reg j(C) label
  9733. test %reg,%reg/cmp $0,%reg
  9734. jne label
  9735. (Also do something similar with sete/setne instead of je/jne)
  9736. }
  9737. begin
  9738. { Before we do anything else, we need to check the instructions
  9739. in between SETcc and TEST to make sure they don't modify the
  9740. FLAGS register - if -O2 or under, there won't be any
  9741. instructions between SET and TEST }
  9742. TransferUsedRegs(TmpUsedRegs);
  9743. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  9744. if (cs_opt_level3 in current_settings.optimizerswitches) then
  9745. begin
  9746. next := p;
  9747. SetLength(InstrList, 0);
  9748. InstrMax := -1;
  9749. PotentialModified := False;
  9750. { Make a note of every instruction that modifies the FLAGS
  9751. register }
  9752. while GetNextInstruction(next, next) and (next <> hp1) do
  9753. begin
  9754. if next.typ <> ait_instruction then
  9755. { GetNextInstructionUsingReg should have returned False }
  9756. InternalError(2021051701);
  9757. if RegModifiedByInstruction(NR_DEFAULTFLAGS, next) then
  9758. begin
  9759. case taicpu(next).opcode of
  9760. A_SETcc,
  9761. A_CMOVcc,
  9762. A_Jcc:
  9763. begin
  9764. if PotentialModified then
  9765. { Not safe because the flags were modified earlier }
  9766. Exit
  9767. else
  9768. { Condition is the same as the initial SETcc, so this is safe
  9769. (don't add to instruction list though) }
  9770. Continue;
  9771. end;
  9772. A_ADD:
  9773. begin
  9774. if (taicpu(next).opsize = S_B) or
  9775. { LEA doesn't support 8-bit operands }
  9776. (taicpu(next).oper[1]^.typ <> top_reg) or
  9777. { Must write to a register }
  9778. (taicpu(next).oper[0]^.typ = top_ref) then
  9779. { Require a constant or a register }
  9780. Exit;
  9781. PotentialModified := True;
  9782. end;
  9783. A_SUB:
  9784. begin
  9785. if (taicpu(next).opsize = S_B) or
  9786. { LEA doesn't support 8-bit operands }
  9787. (taicpu(next).oper[1]^.typ <> top_reg) or
  9788. { Must write to a register }
  9789. (taicpu(next).oper[0]^.typ <> top_const) or
  9790. (taicpu(next).oper[0]^.val = $80000000) then
  9791. { Can't subtract a register with LEA - also
  9792. check that the value isn't -2^31, as this
  9793. can't be negated }
  9794. Exit;
  9795. PotentialModified := True;
  9796. end;
  9797. A_SAL,
  9798. A_SHL:
  9799. begin
  9800. if (taicpu(next).opsize = S_B) or
  9801. { LEA doesn't support 8-bit operands }
  9802. (taicpu(next).oper[1]^.typ <> top_reg) or
  9803. { Must write to a register }
  9804. (taicpu(next).oper[0]^.typ <> top_const) or
  9805. (taicpu(next).oper[0]^.val < 0) or
  9806. (taicpu(next).oper[0]^.val > 3) then
  9807. Exit;
  9808. PotentialModified := True;
  9809. end;
  9810. A_IMUL:
  9811. begin
  9812. if (taicpu(next).ops <> 3) or
  9813. (taicpu(next).oper[1]^.typ <> top_reg) or
  9814. { Must write to a register }
  9815. (taicpu(next).oper[2]^.val in [2,3,4,5,8,9]) then
  9816. { We can convert "imul x,%reg1,%reg2" (where x = 2, 4 or 8)
  9817. to "lea (%reg1,x),%reg2". If x = 3, 5 or 9, we can
  9818. change this to "lea (%reg1,%reg1,(x-1)),%reg2" }
  9819. Exit
  9820. else
  9821. PotentialModified := True;
  9822. end;
  9823. else
  9824. { Don't know how to change this, so abort }
  9825. Exit;
  9826. end;
  9827. { Contains highest index (so instruction count - 1) }
  9828. Inc(InstrMax);
  9829. if InstrMax > High(InstrList) then
  9830. SetLength(InstrList, InstrMax + LIST_STEP_SIZE);
  9831. InstrList[InstrMax] := taicpu(next);
  9832. end;
  9833. UpdateUsedRegs(TmpUsedRegs, tai(next.next));
  9834. end;
  9835. if not Assigned(next) or (next <> hp1) then
  9836. { It should be equal to hp1 }
  9837. InternalError(2021051702);
  9838. { Cycle through each instruction and check to see if we can
  9839. change them to versions that don't modify the flags }
  9840. if (InstrMax >= 0) then
  9841. begin
  9842. for Index := 0 to InstrMax do
  9843. case InstrList[Index].opcode of
  9844. A_ADD:
  9845. begin
  9846. DebugMsg(SPeepholeOptimization + 'ADD -> LEA' + SNoFlags, InstrList[Index]);
  9847. InstrList[Index].opcode := A_LEA;
  9848. reference_reset(NewRef, 1, []);
  9849. NewRef.base := InstrList[Index].oper[1]^.reg;
  9850. if InstrList[Index].oper[0]^.typ = top_reg then
  9851. begin
  9852. NewRef.index := InstrList[Index].oper[0]^.reg;
  9853. NewRef.scalefactor := 1;
  9854. end
  9855. else
  9856. NewRef.offset := InstrList[Index].oper[0]^.val;
  9857. InstrList[Index].loadref(0, NewRef);
  9858. end;
  9859. A_SUB:
  9860. begin
  9861. DebugMsg(SPeepholeOptimization + 'SUB -> LEA' + SNoFlags, InstrList[Index]);
  9862. InstrList[Index].opcode := A_LEA;
  9863. reference_reset(NewRef, 1, []);
  9864. NewRef.base := InstrList[Index].oper[1]^.reg;
  9865. NewRef.offset := -InstrList[Index].oper[0]^.val;
  9866. InstrList[Index].loadref(0, NewRef);
  9867. end;
  9868. A_SHL,
  9869. A_SAL:
  9870. begin
  9871. DebugMsg(SPeepholeOptimization + 'SHL -> LEA' + SNoFlags, InstrList[Index]);
  9872. InstrList[Index].opcode := A_LEA;
  9873. reference_reset(NewRef, 1, []);
  9874. NewRef.index := InstrList[Index].oper[1]^.reg;
  9875. NewRef.scalefactor := 1 shl (InstrList[Index].oper[0]^.val);
  9876. InstrList[Index].loadref(0, NewRef);
  9877. end;
  9878. A_IMUL:
  9879. begin
  9880. DebugMsg(SPeepholeOptimization + 'IMUL -> LEA' + SNoFlags, InstrList[Index]);
  9881. InstrList[Index].opcode := A_LEA;
  9882. reference_reset(NewRef, 1, []);
  9883. NewRef.index := InstrList[Index].oper[1]^.reg;
  9884. case InstrList[Index].oper[0]^.val of
  9885. 2, 4, 8:
  9886. NewRef.scalefactor := InstrList[Index].oper[0]^.val;
  9887. else {3, 5 and 9}
  9888. begin
  9889. NewRef.scalefactor := InstrList[Index].oper[0]^.val - 1;
  9890. NewRef.base := InstrList[Index].oper[1]^.reg;
  9891. end;
  9892. end;
  9893. InstrList[Index].loadref(0, NewRef);
  9894. end;
  9895. else
  9896. InternalError(2021051710);
  9897. end;
  9898. end;
  9899. { Mark the FLAGS register as used across this whole block }
  9900. AllocRegBetween(NR_DEFAULTFLAGS, p, hp1, UsedRegs);
  9901. end;
  9902. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  9903. JumpC := taicpu(hp2).condition;
  9904. Unconditional := False;
  9905. if conditions_equal(JumpC, C_E) then
  9906. SetC := inverse_cond(taicpu(p).condition)
  9907. else if conditions_equal(JumpC, C_NE) then
  9908. SetC := taicpu(p).condition
  9909. else
  9910. { We've got something weird here (and inefficent) }
  9911. begin
  9912. DebugMsg('DEBUG: Inefficient jump - check code generation', p);
  9913. SetC := C_NONE;
  9914. { JAE/JNB will always branch (use 'condition_in', since C_AE <> C_NB normally) }
  9915. if condition_in(C_AE, JumpC) then
  9916. Unconditional := True
  9917. else
  9918. { Not sure what to do with this jump - drop out }
  9919. Exit;
  9920. end;
  9921. RemoveInstruction(hp1);
  9922. if Unconditional then
  9923. MakeUnconditional(taicpu(hp2))
  9924. else
  9925. begin
  9926. if SetC = C_NONE then
  9927. InternalError(2018061402);
  9928. taicpu(hp2).SetCondition(SetC);
  9929. end;
  9930. { as hp2 is a jump, we cannot use RegUsedAfterInstruction but we have to check if it is included in
  9931. TmpUsedRegs }
  9932. if not TmpUsedRegs[getregtype(taicpu(p).oper[0]^.reg)].IsUsed(taicpu(p).oper[0]^.reg) then
  9933. begin
  9934. RemoveCurrentp(p, hp2);
  9935. if taicpu(hp2).opcode = A_SETcc then
  9936. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/SETcc -> SETcc',p)
  9937. else
  9938. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/Jcc -> Jcc',p);
  9939. end
  9940. else
  9941. if taicpu(hp2).opcode = A_SETcc then
  9942. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/SETcc -> SETcc/SETcc',p)
  9943. else
  9944. DebugMsg(SPeepholeOptimization + 'SETcc/TEST/Jcc -> SETcc/Jcc',p);
  9945. Result := True;
  9946. end
  9947. else if
  9948. { Make sure the instructions are adjacent }
  9949. (
  9950. not (cs_opt_level3 in current_settings.optimizerswitches) or
  9951. GetNextInstruction(p, hp1)
  9952. ) and
  9953. MatchInstruction(hp1, A_MOV, [S_B]) and
  9954. { Writing to memory is allowed }
  9955. MatchOperand(taicpu(p).oper[0]^, taicpu(hp1).oper[0]^.reg) then
  9956. begin
  9957. {
  9958. Watch out for sequences such as:
  9959. set(c)b %regb
  9960. movb %regb,(ref)
  9961. movb $0,1(ref)
  9962. movb $0,2(ref)
  9963. movb $0,3(ref)
  9964. Much more efficient to turn it into:
  9965. movl $0,%regl
  9966. set(c)b %regb
  9967. movl %regl,(ref)
  9968. Or:
  9969. set(c)b %regb
  9970. movzbl %regb,%regl
  9971. movl %regl,(ref)
  9972. }
  9973. if (taicpu(hp1).oper[1]^.typ = top_ref) and
  9974. GetNextInstruction(hp1, hp2) and
  9975. MatchInstruction(hp2, A_MOV, [S_B]) and
  9976. (taicpu(hp2).oper[1]^.typ = top_ref) and
  9977. CheckMemoryWrite(taicpu(hp1), taicpu(hp2)) then
  9978. begin
  9979. { Don't do anything else except set Result to True }
  9980. end
  9981. else
  9982. begin
  9983. if taicpu(p).oper[0]^.typ = top_reg then
  9984. begin
  9985. TransferUsedRegs(TmpUsedRegs);
  9986. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  9987. end;
  9988. { If it's not a register, it's a memory address }
  9989. if (taicpu(p).oper[0]^.typ <> top_reg) or RegUsedAfterInstruction(taicpu(p).oper[0]^.reg, hp1, TmpUsedRegs) then
  9990. begin
  9991. { Even if the register is still in use, we can minimise the
  9992. pipeline stall by changing the MOV into another SETcc. }
  9993. taicpu(hp1).opcode := A_SETcc;
  9994. taicpu(hp1).condition := taicpu(p).condition;
  9995. if taicpu(hp1).oper[1]^.typ = top_ref then
  9996. begin
  9997. { Swapping the operand pointers like this is probably a
  9998. bit naughty, but it is far faster than using loadoper
  9999. to transfer the reference from oper[1] to oper[0] if
  10000. you take into account the extra procedure calls and
  10001. the memory allocation and deallocation required }
  10002. OperPtr := taicpu(hp1).oper[1];
  10003. taicpu(hp1).oper[1] := taicpu(hp1).oper[0];
  10004. taicpu(hp1).oper[0] := OperPtr;
  10005. end
  10006. else
  10007. taicpu(hp1).oper[0]^.reg := taicpu(hp1).oper[1]^.reg;
  10008. taicpu(hp1).clearop(1);
  10009. taicpu(hp1).ops := 1;
  10010. DebugMsg(SPeepholeOptimization + 'SETcc/Mov -> SETcc/SETcc',p);
  10011. end
  10012. else
  10013. begin
  10014. if taicpu(hp1).oper[1]^.typ = top_reg then
  10015. AllocRegBetween(taicpu(hp1).oper[1]^.reg,p,hp1,UsedRegs);
  10016. taicpu(p).loadoper(0, taicpu(hp1).oper[1]^);
  10017. RemoveInstruction(hp1);
  10018. DebugMsg(SPeepholeOptimization + 'SETcc/Mov -> SETcc',p);
  10019. end
  10020. end;
  10021. Result := True;
  10022. end;
  10023. end;
  10024. end;
  10025. function TX86AsmOptimizer.OptPass2Jmp(var p : tai) : boolean;
  10026. var
  10027. hp1: tai;
  10028. Count: Integer;
  10029. OrigLabel: TAsmLabel;
  10030. begin
  10031. result := False;
  10032. { Sometimes, the optimisations below can permit this }
  10033. RemoveDeadCodeAfterJump(p);
  10034. 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
  10035. (taicpu(p).oper[0]^.ref^.index=NR_NO) and (taicpu(p).oper[0]^.ref^.symbol is tasmlabel) then
  10036. begin
  10037. OrigLabel := TAsmLabel(taicpu(p).oper[0]^.ref^.symbol);
  10038. { Also a side-effect of optimisations }
  10039. if CollapseZeroDistJump(p, OrigLabel) then
  10040. begin
  10041. Result := True;
  10042. Exit;
  10043. end;
  10044. hp1 := GetLabelWithSym(OrigLabel);
  10045. if (taicpu(p).condition=C_None) and assigned(hp1) and SkipLabels(hp1,hp1) and (hp1.typ = ait_instruction) then
  10046. begin
  10047. if taicpu(hp1).opcode = A_RET then
  10048. begin
  10049. {
  10050. change
  10051. jmp .L1
  10052. ...
  10053. .L1:
  10054. ret
  10055. into
  10056. ret
  10057. }
  10058. begin
  10059. ConvertJumpToRET(p, hp1);
  10060. result:=true;
  10061. end;
  10062. end
  10063. else if (cs_opt_level3 in current_settings.optimizerswitches) and
  10064. not (cs_opt_size in current_settings.optimizerswitches) and
  10065. CheckJumpMovTransferOpt(p, hp1, 0, Count) then
  10066. begin
  10067. Result := True;
  10068. Exit;
  10069. end;
  10070. end;
  10071. end;
  10072. end;
  10073. class function TX86AsmOptimizer.CanBeCMOV(p : tai) : boolean;
  10074. begin
  10075. CanBeCMOV:=assigned(p) and
  10076. MatchInstruction(p,A_MOV,[S_W,S_L,S_Q]) and
  10077. { we can't use cmov ref,reg because
  10078. ref could be nil and cmov still throws an exception
  10079. if ref=nil but the mov isn't done (FK)
  10080. or ((taicpu(p).oper[0]^.typ = top_ref) and
  10081. (taicpu(p).oper[0]^.ref^.refaddr = addr_no))
  10082. }
  10083. (taicpu(p).oper[1]^.typ = top_reg) and
  10084. (
  10085. (taicpu(p).oper[0]^.typ = top_reg) or
  10086. { allow references, but only pure symbols or got rel. addressing with RIP as based,
  10087. it is not expected that this can cause a seg. violation }
  10088. (
  10089. (taicpu(p).oper[0]^.typ = top_ref) and
  10090. IsRefSafe(taicpu(p).oper[0]^.ref)
  10091. )
  10092. );
  10093. end;
  10094. function TX86AsmOptimizer.OptPass2Jcc(var p : tai) : boolean;
  10095. var
  10096. hp1,hp2: tai;
  10097. {$ifndef i8086}
  10098. hp3,hp4,hpmov2, hp5: tai;
  10099. l : Longint;
  10100. condition : TAsmCond;
  10101. {$endif i8086}
  10102. carryadd_opcode : TAsmOp;
  10103. symbol: TAsmSymbol;
  10104. increg, tmpreg: TRegister;
  10105. begin
  10106. result:=false;
  10107. if GetNextInstruction(p,hp1) then
  10108. begin
  10109. if (hp1.typ=ait_label) then
  10110. begin
  10111. Result := DoSETccLblRETOpt(p, tai_label(hp1));
  10112. Exit;
  10113. end
  10114. else if (hp1.typ<>ait_instruction) then
  10115. Exit;
  10116. symbol := TAsmLabel(taicpu(p).oper[0]^.ref^.symbol);
  10117. if (
  10118. (
  10119. ((Taicpu(hp1).opcode=A_ADD) or (Taicpu(hp1).opcode=A_SUB)) and
  10120. MatchOptype(Taicpu(hp1),top_const,top_reg) and
  10121. (Taicpu(hp1).oper[0]^.val=1)
  10122. ) or
  10123. ((Taicpu(hp1).opcode=A_INC) or (Taicpu(hp1).opcode=A_DEC))
  10124. ) and
  10125. GetNextInstruction(hp1,hp2) and
  10126. SkipAligns(hp2, hp2) and
  10127. (hp2.typ = ait_label) and
  10128. (Tasmlabel(symbol) = Tai_label(hp2).labsym) then
  10129. { jb @@1 cmc
  10130. inc/dec operand --> adc/sbb operand,0
  10131. @@1:
  10132. ... and ...
  10133. jnb @@1
  10134. inc/dec operand --> adc/sbb operand,0
  10135. @@1: }
  10136. begin
  10137. if Taicpu(p).condition in [C_NAE,C_B,C_C] then
  10138. begin
  10139. case taicpu(hp1).opcode of
  10140. A_INC,
  10141. A_ADD:
  10142. carryadd_opcode:=A_ADC;
  10143. A_DEC,
  10144. A_SUB:
  10145. carryadd_opcode:=A_SBB;
  10146. else
  10147. InternalError(2021011001);
  10148. end;
  10149. Taicpu(p).clearop(0);
  10150. Taicpu(p).ops:=0;
  10151. Taicpu(p).is_jmp:=false;
  10152. Taicpu(p).opcode:=A_CMC;
  10153. Taicpu(p).condition:=C_NONE;
  10154. DebugMsg(SPeepholeOptimization+'JccAdd/Inc/Dec2CmcAdc/Sbb',p);
  10155. Taicpu(hp1).ops:=2;
  10156. if (Taicpu(hp1).opcode=A_ADD) or (Taicpu(hp1).opcode=A_SUB) then
  10157. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[1]^)
  10158. else
  10159. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[0]^);
  10160. Taicpu(hp1).loadconst(0,0);
  10161. Taicpu(hp1).opcode:=carryadd_opcode;
  10162. result:=true;
  10163. exit;
  10164. end
  10165. else if Taicpu(p).condition in [C_AE,C_NB,C_NC] then
  10166. begin
  10167. case taicpu(hp1).opcode of
  10168. A_INC,
  10169. A_ADD:
  10170. carryadd_opcode:=A_ADC;
  10171. A_DEC,
  10172. A_SUB:
  10173. carryadd_opcode:=A_SBB;
  10174. else
  10175. InternalError(2021011002);
  10176. end;
  10177. Taicpu(hp1).ops:=2;
  10178. DebugMsg(SPeepholeOptimization+'JccAdd/Inc/Dec2Adc/Sbb',p);
  10179. if (Taicpu(hp1).opcode=A_ADD) or (Taicpu(hp1).opcode=A_SUB) then
  10180. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[1]^)
  10181. else
  10182. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[0]^);
  10183. Taicpu(hp1).loadconst(0,0);
  10184. Taicpu(hp1).opcode:=carryadd_opcode;
  10185. RemoveCurrentP(p, hp1);
  10186. result:=true;
  10187. exit;
  10188. end
  10189. {
  10190. jcc @@1 setcc tmpreg
  10191. inc/dec/add/sub operand -> (movzx tmpreg)
  10192. @@1: add/sub tmpreg,operand
  10193. While this increases code size slightly, it makes the code much faster if the
  10194. jump is unpredictable
  10195. }
  10196. else if not(cs_opt_size in current_settings.optimizerswitches) then
  10197. begin
  10198. { search for an available register which is volatile }
  10199. increg := GetIntRegisterBetween(R_SUBL, UsedRegs, p, hp1);
  10200. if increg <> NR_NO then
  10201. begin
  10202. { We don't need to check if tmpreg is in hp1 or not, because
  10203. it will be marked as in use at p (if not, this is
  10204. indictive of a compiler bug). }
  10205. TAsmLabel(symbol).decrefs;
  10206. Taicpu(p).clearop(0);
  10207. Taicpu(p).ops:=1;
  10208. Taicpu(p).is_jmp:=false;
  10209. Taicpu(p).opcode:=A_SETcc;
  10210. DebugMsg(SPeepholeOptimization+'JccAdd2SetccAdd',p);
  10211. Taicpu(p).condition:=inverse_cond(Taicpu(p).condition);
  10212. Taicpu(p).loadreg(0,increg);
  10213. if getsubreg(Taicpu(hp1).oper[1]^.reg)<>R_SUBL then
  10214. begin
  10215. case getsubreg(Taicpu(hp1).oper[1]^.reg) of
  10216. R_SUBW:
  10217. begin
  10218. tmpreg := newreg(R_INTREGISTER,getsupreg(increg),R_SUBW);
  10219. hp2:=Taicpu.op_reg_reg(A_MOVZX,S_BW,increg,tmpreg);
  10220. end;
  10221. R_SUBD:
  10222. begin
  10223. tmpreg := newreg(R_INTREGISTER,getsupreg(increg),R_SUBD);
  10224. hp2:=Taicpu.op_reg_reg(A_MOVZX,S_BL,increg,tmpreg);
  10225. end;
  10226. {$ifdef x86_64}
  10227. R_SUBQ:
  10228. begin
  10229. { MOVZX doesn't have a 64-bit variant, because
  10230. the 32-bit version implicitly zeroes the
  10231. upper 32-bits of the destination register }
  10232. tmpreg := newreg(R_INTREGISTER,getsupreg(increg),R_SUBD);
  10233. hp2:=Taicpu.op_reg_reg(A_MOVZX,S_BL,increg,tmpreg);
  10234. setsubreg(tmpreg, R_SUBQ);
  10235. end;
  10236. {$endif x86_64}
  10237. else
  10238. Internalerror(2020030601);
  10239. end;
  10240. taicpu(hp2).fileinfo:=taicpu(hp1).fileinfo;
  10241. asml.InsertAfter(hp2,p);
  10242. end
  10243. else
  10244. tmpreg := increg;
  10245. if (Taicpu(hp1).opcode=A_INC) or (Taicpu(hp1).opcode=A_DEC) then
  10246. begin
  10247. Taicpu(hp1).ops:=2;
  10248. Taicpu(hp1).loadoper(1,Taicpu(hp1).oper[0]^)
  10249. end;
  10250. Taicpu(hp1).loadreg(0,tmpreg);
  10251. AllocRegBetween(tmpreg,p,hp1,UsedRegs);
  10252. Result := True;
  10253. { p is no longer a Jcc instruction, so exit }
  10254. Exit;
  10255. end;
  10256. end;
  10257. end;
  10258. { Detect the following:
  10259. jmp<cond> @Lbl1
  10260. jmp @Lbl2
  10261. ...
  10262. @Lbl1:
  10263. ret
  10264. Change to:
  10265. jmp<inv_cond> @Lbl2
  10266. ret
  10267. }
  10268. if MatchInstruction(hp1,A_JMP,[]) and (taicpu(hp1).oper[0]^.ref^.refaddr=addr_full) then
  10269. begin
  10270. hp2:=getlabelwithsym(TAsmLabel(symbol));
  10271. if Assigned(hp2) and SkipLabels(hp2,hp2) and
  10272. MatchInstruction(hp2,A_RET,[S_NO]) then
  10273. begin
  10274. taicpu(p).condition := inverse_cond(taicpu(p).condition);
  10275. { Change label address to that of the unconditional jump }
  10276. taicpu(p).loadoper(0, taicpu(hp1).oper[0]^);
  10277. TAsmLabel(symbol).DecRefs;
  10278. taicpu(hp1).opcode := A_RET;
  10279. taicpu(hp1).is_jmp := false;
  10280. taicpu(hp1).ops := taicpu(hp2).ops;
  10281. DebugMsg(SPeepholeOptimization+'JccJmpRet2J!ccRet',p);
  10282. case taicpu(hp2).ops of
  10283. 0:
  10284. taicpu(hp1).clearop(0);
  10285. 1:
  10286. taicpu(hp1).loadconst(0,taicpu(hp2).oper[0]^.val);
  10287. else
  10288. internalerror(2016041302);
  10289. end;
  10290. end;
  10291. {$ifndef i8086}
  10292. end
  10293. {
  10294. convert
  10295. j<c> .L1
  10296. mov 1,reg
  10297. jmp .L2
  10298. .L1
  10299. mov 0,reg
  10300. .L2
  10301. into
  10302. mov 0,reg
  10303. set<not(c)> reg
  10304. take care of alignment and that the mov 0,reg is not converted into a xor as this
  10305. would destroy the flag contents
  10306. }
  10307. else if MatchInstruction(hp1,A_MOV,[]) and
  10308. MatchOpType(taicpu(hp1),top_const,top_reg) and
  10309. {$ifdef i386}
  10310. (
  10311. { Under i386, ESI, EDI, EBP and ESP
  10312. don't have an 8-bit representation }
  10313. not (getsupreg(taicpu(hp1).oper[1]^.reg) in [RS_ESI, RS_EDI, RS_EBP, RS_ESP])
  10314. ) and
  10315. {$endif i386}
  10316. (taicpu(hp1).oper[0]^.val=1) and
  10317. GetNextInstruction(hp1,hp2) and
  10318. MatchInstruction(hp2,A_JMP,[]) and (taicpu(hp2).oper[0]^.ref^.refaddr=addr_full) and
  10319. GetNextInstruction(hp2,hp3) and
  10320. { skip align }
  10321. ((hp3.typ<>ait_align) or GetNextInstruction(hp3,hp3)) and
  10322. (hp3.typ=ait_label) and
  10323. (tasmlabel(taicpu(p).oper[0]^.ref^.symbol)=tai_label(hp3).labsym) and
  10324. (tai_label(hp3).labsym.getrefs=1) and
  10325. GetNextInstruction(hp3,hp4) and
  10326. MatchInstruction(hp4,A_MOV,[]) and
  10327. MatchOpType(taicpu(hp4),top_const,top_reg) and
  10328. (taicpu(hp4).oper[0]^.val=0) and
  10329. MatchOperand(taicpu(hp1).oper[1]^,taicpu(hp4).oper[1]^) and
  10330. GetNextInstruction(hp4,hp5) and
  10331. (hp5.typ=ait_label) and
  10332. (tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol)=tai_label(hp5).labsym) and
  10333. (tai_label(hp5).labsym.getrefs=1) then
  10334. begin
  10335. AllocRegBetween(NR_FLAGS,p,hp4,UsedRegs);
  10336. DebugMsg(SPeepholeOptimization+'JccMovJmpMov2MovSetcc',p);
  10337. { remove last label }
  10338. RemoveInstruction(hp5);
  10339. { remove second label }
  10340. RemoveInstruction(hp3);
  10341. { if align is present remove it }
  10342. if GetNextInstruction(hp2,hp3) and (hp3.typ=ait_align) then
  10343. RemoveInstruction(hp3);
  10344. { remove jmp }
  10345. RemoveInstruction(hp2);
  10346. if taicpu(hp1).opsize=S_B then
  10347. RemoveInstruction(hp1)
  10348. else
  10349. taicpu(hp1).loadconst(0,0);
  10350. taicpu(hp4).opcode:=A_SETcc;
  10351. taicpu(hp4).opsize:=S_B;
  10352. taicpu(hp4).condition:=inverse_cond(taicpu(p).condition);
  10353. taicpu(hp4).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(hp4).oper[1]^.reg),R_SUBL));
  10354. taicpu(hp4).opercnt:=1;
  10355. taicpu(hp4).ops:=1;
  10356. taicpu(hp4).freeop(1);
  10357. RemoveCurrentP(p);
  10358. Result:=true;
  10359. exit;
  10360. end
  10361. else if CPUX86_HAS_CMOV in cpu_capabilities[current_settings.cputype] then
  10362. begin
  10363. { check for
  10364. jCC xxx
  10365. <several movs>
  10366. xxx:
  10367. Also spot:
  10368. Jcc xxx
  10369. <several movs>
  10370. jmp xxx
  10371. Change to:
  10372. <several cmovs with inverted condition>
  10373. jmp xxx
  10374. }
  10375. l:=0;
  10376. while assigned(hp1) and
  10377. CanBeCMOV(hp1) and
  10378. { stop on labels }
  10379. not(hp1.typ=ait_label) do
  10380. begin
  10381. inc(l);
  10382. hp5 := hp1;
  10383. GetNextInstruction(hp1,hp1);
  10384. end;
  10385. if assigned(hp1) then
  10386. begin
  10387. TransferUsedRegs(TmpUsedRegs);
  10388. if (
  10389. MatchInstruction(hp1, A_JMP, []) and
  10390. (JumpTargetOp(taicpu(hp1))^.typ=top_ref) and
  10391. (JumpTargetOp(taicpu(hp1))^.ref^.symbol=symbol)
  10392. ) or
  10393. FindLabel(tasmlabel(symbol),hp1) then
  10394. begin
  10395. if (l<=4) and (l>0) then
  10396. begin
  10397. AllocRegBetween(NR_DEFAULTFLAGS, p, hp5, TmpUsedRegs);
  10398. condition:=inverse_cond(taicpu(p).condition);
  10399. UpdateUsedRegs(tai(p.next));
  10400. GetNextInstruction(p,hp1);
  10401. repeat
  10402. if not Assigned(hp1) then
  10403. InternalError(2018062900);
  10404. taicpu(hp1).opcode:=A_CMOVcc;
  10405. taicpu(hp1).condition:=condition;
  10406. UpdateUsedRegs(tai(hp1.next));
  10407. GetNextInstruction(hp1,hp1);
  10408. until not(CanBeCMOV(hp1));
  10409. { Remember what hp1 is in case there's multiple aligns to get rid of }
  10410. hp2 := hp1;
  10411. repeat
  10412. if not Assigned(hp2) then
  10413. InternalError(2018062910);
  10414. case hp2.typ of
  10415. ait_label:
  10416. { What we expected - break out of the loop (it won't be a dead label at the top of
  10417. a cluster because that was optimised at an earlier stage) }
  10418. Break;
  10419. ait_align:
  10420. { Go to the next entry until a label is found (may be multiple aligns before it) }
  10421. begin
  10422. hp2 := tai(hp2.Next);
  10423. Continue;
  10424. end;
  10425. ait_instruction:
  10426. begin
  10427. if taicpu(hp2).opcode<>A_JMP then
  10428. InternalError(2018062912);
  10429. { This is the Jcc @Lbl; <several movs>; JMP @Lbl variant }
  10430. Break;
  10431. end
  10432. else
  10433. begin
  10434. { Might be a comment or temporary allocation entry }
  10435. if not (hp2.typ in SkipInstr) then
  10436. InternalError(2018062911);
  10437. hp2 := tai(hp2.Next);
  10438. Continue;
  10439. end;
  10440. end;
  10441. until False;
  10442. { Now we can safely decrement the reference count }
  10443. tasmlabel(symbol).decrefs;
  10444. DebugMsg(SPeepholeOptimization+'JccMov2CMov',p);
  10445. { Remove the original jump }
  10446. RemoveInstruction(p); { Note, the choice to not use RemoveCurrentp is deliberate }
  10447. if hp2.typ=ait_instruction then
  10448. begin
  10449. p:=hp2;
  10450. Result:=True;
  10451. end
  10452. else
  10453. begin
  10454. UpdateUsedRegs(tai(hp2.next));
  10455. Result:=GetNextInstruction(hp2, p); { Instruction after the label }
  10456. { Remove the label if this is its final reference }
  10457. if (tasmlabel(symbol).getrefs=0) then
  10458. StripLabelFast(hp1);
  10459. end;
  10460. exit;
  10461. end;
  10462. end
  10463. else
  10464. begin
  10465. { check further for
  10466. jCC xxx
  10467. <several movs 1>
  10468. jmp yyy
  10469. xxx:
  10470. <several movs 2>
  10471. yyy:
  10472. }
  10473. { hp2 points to jmp yyy }
  10474. hp2:=hp1;
  10475. { skip hp1 to xxx (or an align right before it) }
  10476. GetNextInstruction(hp1, hp1);
  10477. if assigned(hp2) and
  10478. assigned(hp1) and
  10479. (l<=3) and
  10480. (hp2.typ=ait_instruction) and
  10481. (taicpu(hp2).is_jmp) and
  10482. (taicpu(hp2).condition=C_None) and
  10483. { real label and jump, no further references to the
  10484. label are allowed }
  10485. (tasmlabel(symbol).getrefs=1) and
  10486. FindLabel(tasmlabel(symbol),hp1) then
  10487. begin
  10488. l:=0;
  10489. { skip hp1 to <several moves 2> }
  10490. if (hp1.typ = ait_align) then
  10491. GetNextInstruction(hp1, hp1);
  10492. GetNextInstruction(hp1, hpmov2);
  10493. hp1 := hpmov2;
  10494. while assigned(hp1) and
  10495. CanBeCMOV(hp1) do
  10496. begin
  10497. inc(l);
  10498. hp5 := hp1;
  10499. GetNextInstruction(hp1, hp1);
  10500. end;
  10501. { hp1 points to yyy (or an align right before it) }
  10502. hp3 := hp1;
  10503. if assigned(hp1) and
  10504. FindLabel(tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol),hp1) then
  10505. begin
  10506. AllocRegBetween(NR_DEFAULTFLAGS, p, hp5, TmpUsedRegs);
  10507. condition:=inverse_cond(taicpu(p).condition);
  10508. UpdateUsedRegs(tai(p.next));
  10509. GetNextInstruction(p,hp1);
  10510. repeat
  10511. taicpu(hp1).opcode:=A_CMOVcc;
  10512. taicpu(hp1).condition:=condition;
  10513. UpdateUsedRegs(tai(hp1.next));
  10514. GetNextInstruction(hp1,hp1);
  10515. until not(assigned(hp1)) or
  10516. not(CanBeCMOV(hp1));
  10517. condition:=inverse_cond(condition);
  10518. if GetLastInstruction(hpmov2,hp1) then
  10519. UpdateUsedRegs(tai(hp1.next));
  10520. hp1 := hpmov2;
  10521. { hp1 is now at <several movs 2> }
  10522. while Assigned(hp1) and CanBeCMOV(hp1) do
  10523. begin
  10524. taicpu(hp1).opcode:=A_CMOVcc;
  10525. taicpu(hp1).condition:=condition;
  10526. UpdateUsedRegs(tai(hp1.next));
  10527. GetNextInstruction(hp1,hp1);
  10528. end;
  10529. hp1 := p;
  10530. { Get first instruction after label }
  10531. UpdateUsedRegs(tai(hp3.next));
  10532. GetNextInstruction(hp3, p);
  10533. if assigned(p) and (hp3.typ = ait_align) then
  10534. GetNextInstruction(p, p);
  10535. { Don't dereference yet, as doing so will cause
  10536. GetNextInstruction to skip the label and
  10537. optional align marker. [Kit] }
  10538. GetNextInstruction(hp2, hp4);
  10539. DebugMsg(SPeepholeOptimization+'JccMovJmpMov2CMovCMov',hp1);
  10540. { remove jCC }
  10541. RemoveInstruction(hp1);
  10542. { Now we can safely decrement it }
  10543. tasmlabel(symbol).decrefs;
  10544. { Remove label xxx (it will have a ref of zero due to the initial check }
  10545. StripLabelFast(hp4);
  10546. { remove jmp }
  10547. symbol := taicpu(hp2).oper[0]^.ref^.symbol;
  10548. RemoveInstruction(hp2);
  10549. { As before, now we can safely decrement it }
  10550. tasmlabel(symbol).decrefs;
  10551. { Remove label yyy (and the optional alignment) if its reference falls to zero }
  10552. if tasmlabel(symbol).getrefs = 0 then
  10553. StripLabelFast(hp3);
  10554. if Assigned(p) then
  10555. result:=true;
  10556. exit;
  10557. end;
  10558. end;
  10559. end;
  10560. end;
  10561. {$endif i8086}
  10562. end;
  10563. end;
  10564. end;
  10565. function TX86AsmOptimizer.OptPass1Movx(var p : tai) : boolean;
  10566. var
  10567. hp1,hp2,hp3: tai;
  10568. reg_and_hp1_is_instr, RegUsed, AndTest: Boolean;
  10569. NewSize: TOpSize;
  10570. NewRegSize: TSubRegister;
  10571. Limit: TCgInt;
  10572. SwapOper: POper;
  10573. begin
  10574. result:=false;
  10575. reg_and_hp1_is_instr:=(taicpu(p).oper[1]^.typ = top_reg) and
  10576. GetNextInstruction(p,hp1) and
  10577. (hp1.typ = ait_instruction);
  10578. if reg_and_hp1_is_instr and
  10579. (
  10580. (taicpu(hp1).opcode <> A_LEA) or
  10581. { If the LEA instruction can be converted into an arithmetic instruction,
  10582. it may be possible to then fold it. }
  10583. (
  10584. { If the flags register is in use, don't change the instruction
  10585. to an ADD otherwise this will scramble the flags. [Kit] }
  10586. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  10587. ConvertLEA(taicpu(hp1))
  10588. )
  10589. ) and
  10590. IsFoldableArithOp(taicpu(hp1),taicpu(p).oper[1]^.reg) and
  10591. GetNextInstruction(hp1,hp2) and
  10592. MatchInstruction(hp2,A_MOV,[]) and
  10593. (taicpu(hp2).oper[0]^.typ = top_reg) and
  10594. OpsEqual(taicpu(hp2).oper[1]^,taicpu(p).oper[0]^) and
  10595. ((taicpu(p).opsize in [S_BW,S_BL]) and (taicpu(hp2).opsize=S_B) or
  10596. (taicpu(p).opsize in [S_WL]) and (taicpu(hp2).opsize=S_W)) and
  10597. {$ifdef i386}
  10598. { not all registers have byte size sub registers on i386 }
  10599. ((taicpu(hp2).opsize<>S_B) or (getsupreg(taicpu(hp1).oper[0]^.reg) in [RS_EAX, RS_EBX, RS_ECX, RS_EDX])) and
  10600. {$endif i386}
  10601. (((taicpu(hp1).ops=2) and
  10602. (getsupreg(taicpu(hp2).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg))) or
  10603. ((taicpu(hp1).ops=1) and
  10604. (getsupreg(taicpu(hp2).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[0]^.reg)))) and
  10605. not(RegUsedAfterInstruction(taicpu(hp2).oper[0]^.reg,hp2,UsedRegs)) then
  10606. begin
  10607. { change movsX/movzX reg/ref, reg2
  10608. add/sub/or/... reg3/$const, reg2
  10609. mov reg2 reg/ref
  10610. to add/sub/or/... reg3/$const, reg/ref }
  10611. { by example:
  10612. movswl %si,%eax movswl %si,%eax p
  10613. decl %eax addl %edx,%eax hp1
  10614. movw %ax,%si movw %ax,%si hp2
  10615. ->
  10616. movswl %si,%eax movswl %si,%eax p
  10617. decw %eax addw %edx,%eax hp1
  10618. movw %ax,%si movw %ax,%si hp2
  10619. }
  10620. taicpu(hp1).changeopsize(taicpu(hp2).opsize);
  10621. {
  10622. ->
  10623. movswl %si,%eax movswl %si,%eax p
  10624. decw %si addw %dx,%si hp1
  10625. movw %ax,%si movw %ax,%si hp2
  10626. }
  10627. case taicpu(hp1).ops of
  10628. 1:
  10629. taicpu(hp1).loadoper(0,taicpu(hp2).oper[1]^);
  10630. 2:
  10631. begin
  10632. taicpu(hp1).loadoper(1,taicpu(hp2).oper[1]^);
  10633. if (taicpu(hp1).oper[0]^.typ = top_reg) then
  10634. setsubreg(taicpu(hp1).oper[0]^.reg,getsubreg(taicpu(hp2).oper[0]^.reg));
  10635. end;
  10636. else
  10637. internalerror(2008042702);
  10638. end;
  10639. {
  10640. ->
  10641. decw %si addw %dx,%si p
  10642. }
  10643. DebugMsg(SPeepholeOptimization + 'var3',p);
  10644. RemoveCurrentP(p, hp1);
  10645. RemoveInstruction(hp2);
  10646. Result := True;
  10647. Exit;
  10648. end;
  10649. if reg_and_hp1_is_instr and
  10650. (taicpu(hp1).opcode = A_MOV) and
  10651. MatchOpType(taicpu(hp1),top_reg,top_reg) and
  10652. (MatchOperand(taicpu(p).oper[1]^,taicpu(hp1).oper[0]^)
  10653. {$ifdef x86_64}
  10654. { check for implicit extension to 64 bit }
  10655. or
  10656. ((taicpu(p).opsize in [S_BL,S_WL]) and
  10657. (taicpu(hp1).opsize=S_Q) and
  10658. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.reg)
  10659. )
  10660. {$endif x86_64}
  10661. )
  10662. then
  10663. begin
  10664. { change
  10665. movx %reg1,%reg2
  10666. mov %reg2,%reg3
  10667. dealloc %reg2
  10668. into
  10669. movx %reg,%reg3
  10670. }
  10671. TransferUsedRegs(TmpUsedRegs);
  10672. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  10673. if not(RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs)) then
  10674. begin
  10675. DebugMsg(SPeepholeOptimization + 'MovxMov2Movx',p);
  10676. {$ifdef x86_64}
  10677. if (taicpu(p).opsize in [S_BL,S_WL]) and
  10678. (taicpu(hp1).opsize=S_Q) then
  10679. taicpu(p).loadreg(1,newreg(R_INTREGISTER,getsupreg(taicpu(hp1).oper[1]^.reg),R_SUBD))
  10680. else
  10681. {$endif x86_64}
  10682. taicpu(p).loadreg(1,taicpu(hp1).oper[1]^.reg);
  10683. RemoveInstruction(hp1);
  10684. Result := True;
  10685. Exit;
  10686. end;
  10687. end;
  10688. if reg_and_hp1_is_instr and
  10689. ((taicpu(hp1).opcode=A_MOV) or
  10690. (taicpu(hp1).opcode=A_ADD) or
  10691. (taicpu(hp1).opcode=A_SUB) or
  10692. (taicpu(hp1).opcode=A_CMP) or
  10693. (taicpu(hp1).opcode=A_OR) or
  10694. (taicpu(hp1).opcode=A_XOR) or
  10695. (taicpu(hp1).opcode=A_AND)
  10696. ) and
  10697. (taicpu(hp1).oper[1]^.typ = top_reg) then
  10698. begin
  10699. AndTest := (taicpu(hp1).opcode=A_AND) and
  10700. GetNextInstruction(hp1, hp2) and
  10701. (hp2.typ = ait_instruction) and
  10702. (
  10703. (
  10704. (taicpu(hp2).opcode=A_TEST) and
  10705. (
  10706. MatchOperand(taicpu(hp2).oper[0]^, taicpu(hp1).oper[1]^.reg) or
  10707. MatchOperand(taicpu(hp2).oper[0]^, -1) or
  10708. (
  10709. { If the AND and TEST instructions share a constant, this is also valid }
  10710. (taicpu(hp1).oper[0]^.typ = top_const) and
  10711. MatchOperand(taicpu(hp2).oper[0]^, taicpu(hp1).oper[0]^.val)
  10712. )
  10713. ) and
  10714. MatchOperand(taicpu(hp2).oper[1]^, taicpu(hp1).oper[1]^.reg)
  10715. ) or
  10716. (
  10717. (taicpu(hp2).opcode=A_CMP) and
  10718. MatchOperand(taicpu(hp2).oper[0]^, 0) and
  10719. MatchOperand(taicpu(hp2).oper[1]^, taicpu(hp1).oper[1]^.reg)
  10720. )
  10721. );
  10722. { change
  10723. movx (oper),%reg2
  10724. and $x,%reg2
  10725. test %reg2,%reg2
  10726. dealloc %reg2
  10727. into
  10728. op %reg1,%reg3
  10729. if the second op accesses only the bits stored in reg1
  10730. }
  10731. if ((taicpu(p).oper[0]^.typ=top_reg) or
  10732. ((taicpu(p).oper[0]^.typ=top_ref) and (taicpu(p).oper[0]^.ref^.refaddr<>addr_full))) and
  10733. (taicpu(hp1).oper[0]^.typ = top_const) and
  10734. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  10735. AndTest then
  10736. begin
  10737. { Check if the AND constant is in range }
  10738. case taicpu(p).opsize of
  10739. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  10740. begin
  10741. NewSize := S_B;
  10742. Limit := $FF;
  10743. end;
  10744. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  10745. begin
  10746. NewSize := S_W;
  10747. Limit := $FFFF;
  10748. end;
  10749. {$ifdef x86_64}
  10750. S_LQ:
  10751. begin
  10752. NewSize := S_L;
  10753. Limit := $FFFFFFFF;
  10754. end;
  10755. {$endif x86_64}
  10756. else
  10757. InternalError(2021120303);
  10758. end;
  10759. if (
  10760. ((taicpu(hp1).oper[0]^.val and Limit) = taicpu(hp1).oper[0]^.val) or
  10761. { Check for negative operands }
  10762. (((not taicpu(hp1).oper[0]^.val) and Limit) = (not taicpu(hp1).oper[0]^.val))
  10763. ) and
  10764. GetNextInstruction(hp2,hp3) and
  10765. MatchInstruction(hp3,A_Jcc,A_Setcc,A_CMOVcc,[]) and
  10766. (taicpu(hp3).condition in [C_E,C_NE]) then
  10767. begin
  10768. TransferUsedRegs(TmpUsedRegs);
  10769. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  10770. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  10771. if not(RegUsedAfterInstruction(taicpu(hp2).oper[1]^.reg, hp2, TmpUsedRegs)) then
  10772. begin
  10773. DebugMsg(SPeepholeOptimization + 'MovxAndTest2Test done',p);
  10774. taicpu(hp1).loadoper(1, taicpu(p).oper[0]^);
  10775. taicpu(hp1).opcode := A_TEST;
  10776. taicpu(hp1).opsize := NewSize;
  10777. RemoveInstruction(hp2);
  10778. RemoveCurrentP(p, hp1);
  10779. Result:=true;
  10780. exit;
  10781. end;
  10782. end;
  10783. end;
  10784. if (taicpu(hp1).oper[0]^.typ = top_reg) and
  10785. (((taicpu(p).opsize in [S_BW,S_BL,S_WL{$ifdef x86_64},S_BQ,S_WQ,S_LQ{$endif x86_64}]) and
  10786. (taicpu(hp1).opsize=S_B)) or
  10787. ((taicpu(p).opsize in [S_WL{$ifdef x86_64},S_WQ,S_LQ{$endif x86_64}]) and
  10788. (taicpu(hp1).opsize=S_W))
  10789. {$ifdef x86_64}
  10790. or ((taicpu(p).opsize=S_LQ) and
  10791. (taicpu(hp1).opsize=S_L))
  10792. {$endif x86_64}
  10793. ) and
  10794. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[0]^.reg) then
  10795. begin
  10796. { change
  10797. movx %reg1,%reg2
  10798. op %reg2,%reg3
  10799. dealloc %reg2
  10800. into
  10801. op %reg1,%reg3
  10802. if the second op accesses only the bits stored in reg1
  10803. }
  10804. TransferUsedRegs(TmpUsedRegs);
  10805. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  10806. if AndTest then
  10807. begin
  10808. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  10809. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs);
  10810. end
  10811. else
  10812. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs);
  10813. if not RegUsed then
  10814. begin
  10815. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 1',p);
  10816. if taicpu(p).oper[0]^.typ=top_reg then
  10817. begin
  10818. case taicpu(hp1).opsize of
  10819. S_B:
  10820. taicpu(hp1).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[0]^.reg),R_SUBL));
  10821. S_W:
  10822. taicpu(hp1).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[0]^.reg),R_SUBW));
  10823. S_L:
  10824. taicpu(hp1).loadreg(0,newreg(R_INTREGISTER,getsupreg(taicpu(p).oper[0]^.reg),R_SUBD));
  10825. else
  10826. Internalerror(2020102301);
  10827. end;
  10828. AllocRegBetween(taicpu(hp1).oper[0]^.reg,p,hp1,UsedRegs);
  10829. end
  10830. else
  10831. taicpu(hp1).loadref(0,taicpu(p).oper[0]^.ref^);
  10832. RemoveCurrentP(p);
  10833. if AndTest then
  10834. RemoveInstruction(hp2);
  10835. result:=true;
  10836. exit;
  10837. end;
  10838. end
  10839. else if (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg) and
  10840. (
  10841. { Bitwise operations only }
  10842. (taicpu(hp1).opcode=A_AND) or
  10843. (taicpu(hp1).opcode=A_TEST) or
  10844. (
  10845. (taicpu(hp1).oper[0]^.typ = top_const) and
  10846. (
  10847. (taicpu(hp1).opcode=A_OR) or
  10848. (taicpu(hp1).opcode=A_XOR)
  10849. )
  10850. )
  10851. ) and
  10852. (
  10853. (taicpu(hp1).oper[0]^.typ = top_const) or
  10854. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) or
  10855. not RegInOp(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[0]^)
  10856. ) then
  10857. begin
  10858. { change
  10859. movx %reg2,%reg2
  10860. op const,%reg2
  10861. into
  10862. op const,%reg2 (smaller version)
  10863. movx %reg2,%reg2
  10864. also change
  10865. movx %reg1,%reg2
  10866. and/test (oper),%reg2
  10867. dealloc %reg2
  10868. into
  10869. and/test (oper),%reg1
  10870. }
  10871. case taicpu(p).opsize of
  10872. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  10873. begin
  10874. NewSize := S_B;
  10875. NewRegSize := R_SUBL;
  10876. Limit := $FF;
  10877. end;
  10878. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  10879. begin
  10880. NewSize := S_W;
  10881. NewRegSize := R_SUBW;
  10882. Limit := $FFFF;
  10883. end;
  10884. {$ifdef x86_64}
  10885. S_LQ:
  10886. begin
  10887. NewSize := S_L;
  10888. NewRegSize := R_SUBD;
  10889. Limit := $FFFFFFFF;
  10890. end;
  10891. {$endif x86_64}
  10892. else
  10893. Internalerror(2021120302);
  10894. end;
  10895. TransferUsedRegs(TmpUsedRegs);
  10896. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  10897. if AndTest then
  10898. begin
  10899. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  10900. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp2,TmpUsedRegs);
  10901. end
  10902. else
  10903. RegUsed := RegUsedAfterInstruction(taicpu(p).oper[1]^.reg,hp1,TmpUsedRegs);
  10904. if
  10905. (
  10906. (taicpu(p).opcode = A_MOVZX) and
  10907. (
  10908. (taicpu(hp1).opcode=A_AND) or
  10909. (taicpu(hp1).opcode=A_TEST)
  10910. ) and
  10911. not (
  10912. { If both are references, then the final instruction will have
  10913. both operands as references, which is not allowed }
  10914. (taicpu(p).oper[0]^.typ = top_ref) and
  10915. (taicpu(hp1).oper[0]^.typ = top_ref)
  10916. ) and
  10917. not RegUsed
  10918. ) or
  10919. (
  10920. (
  10921. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) or
  10922. not RegUsed
  10923. ) and
  10924. (taicpu(p).oper[0]^.typ = top_reg) and
  10925. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  10926. (taicpu(hp1).oper[0]^.typ = top_const) and
  10927. ((taicpu(hp1).oper[0]^.val and Limit) = taicpu(hp1).oper[0]^.val)
  10928. ) then
  10929. begin
  10930. {$if defined(i386) or defined(i8086)}
  10931. { If the target size is 8-bit, make sure we can actually encode it }
  10932. 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
  10933. Exit;
  10934. {$endif i386 or i8086}
  10935. DebugMsg(SPeepholeOptimization + 'MovxOp2Op 2',p);
  10936. taicpu(hp1).opsize := NewSize;
  10937. taicpu(hp1).loadoper(1, taicpu(p).oper[0]^);
  10938. if AndTest then
  10939. begin
  10940. RemoveInstruction(hp2);
  10941. if not RegUsed then
  10942. begin
  10943. taicpu(hp1).opcode := A_TEST;
  10944. if (taicpu(hp1).oper[0]^.typ = top_ref) then
  10945. begin
  10946. { Make sure the reference is the second operand }
  10947. SwapOper := taicpu(hp1).oper[0];
  10948. taicpu(hp1).oper[0] := taicpu(hp1).oper[1];
  10949. taicpu(hp1).oper[1] := SwapOper;
  10950. end;
  10951. end;
  10952. end;
  10953. case taicpu(hp1).oper[0]^.typ of
  10954. top_reg:
  10955. setsubreg(taicpu(hp1).oper[0]^.reg, NewRegSize);
  10956. top_const:
  10957. { For the AND/TEST case }
  10958. taicpu(hp1).oper[0]^.val := taicpu(hp1).oper[0]^.val and Limit;
  10959. else
  10960. ;
  10961. end;
  10962. if RegUsed then
  10963. begin
  10964. AsmL.Remove(p);
  10965. AsmL.InsertAfter(p, hp1);
  10966. p := hp1;
  10967. end
  10968. else
  10969. RemoveCurrentP(p, hp1);
  10970. result:=true;
  10971. exit;
  10972. end;
  10973. end;
  10974. end;
  10975. if reg_and_hp1_is_instr and
  10976. (taicpu(p).oper[0]^.typ = top_reg) and
  10977. (
  10978. (taicpu(hp1).opcode = A_SHL) or (taicpu(hp1).opcode = A_SAL)
  10979. ) and
  10980. (taicpu(hp1).oper[0]^.typ = top_const) and
  10981. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  10982. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  10983. { Minimum shift value allowed is the bit difference between the sizes }
  10984. (taicpu(hp1).oper[0]^.val >=
  10985. { Multiply by 8 because tcgsize2size returns bytes, not bits }
  10986. 8 * (
  10987. tcgsize2size[reg_cgsize(taicpu(p).oper[1]^.reg)] -
  10988. tcgsize2size[reg_cgsize(taicpu(p).oper[0]^.reg)]
  10989. )
  10990. ) then
  10991. begin
  10992. { For:
  10993. movsx/movzx %reg1,%reg1 (same register, just different sizes)
  10994. shl/sal ##, %reg1
  10995. Remove the movsx/movzx instruction if the shift overwrites the
  10996. extended bits of the register (e.g. movslq %eax,%rax; shlq $32,%rax
  10997. }
  10998. DebugMsg(SPeepholeOptimization + 'MovxShl2Shl',p);
  10999. RemoveCurrentP(p, hp1);
  11000. Result := True;
  11001. Exit;
  11002. end
  11003. else if reg_and_hp1_is_instr and
  11004. (taicpu(p).oper[0]^.typ = top_reg) and
  11005. (
  11006. ((taicpu(hp1).opcode = A_SHR) and (taicpu(p).opcode = A_MOVZX)) or
  11007. ((taicpu(hp1).opcode = A_SAR) and (taicpu(p).opcode <> A_MOVZX))
  11008. ) and
  11009. (taicpu(hp1).oper[0]^.typ = top_const) and
  11010. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11011. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  11012. { Minimum shift value allowed is the bit size of the smallest register - 1 }
  11013. (taicpu(hp1).oper[0]^.val <
  11014. { Multiply by 8 because tcgsize2size returns bytes, not bits }
  11015. 8 * (
  11016. tcgsize2size[reg_cgsize(taicpu(p).oper[0]^.reg)]
  11017. )
  11018. ) then
  11019. begin
  11020. { For:
  11021. movsx %reg1,%reg1 movzx %reg1,%reg1 (same register, just different sizes)
  11022. sar ##, %reg1 shr ##, %reg1
  11023. Move the shift to before the movx instruction if the shift value
  11024. is not too large.
  11025. }
  11026. asml.Remove(hp1);
  11027. asml.InsertBefore(hp1, p);
  11028. taicpu(hp1).oper[1]^.reg := taicpu(p).oper[0]^.reg;
  11029. case taicpu(p).opsize of
  11030. s_BW, S_BL{$ifdef x86_64}, S_BQ{$endif}:
  11031. taicpu(hp1).opsize := S_B;
  11032. S_WL{$ifdef x86_64}, S_WQ{$endif}:
  11033. taicpu(hp1).opsize := S_W;
  11034. {$ifdef x86_64}
  11035. S_LQ:
  11036. taicpu(hp1).opsize := S_L;
  11037. {$endif}
  11038. else
  11039. InternalError(2020112401);
  11040. end;
  11041. if (taicpu(hp1).opcode = A_SHR) then
  11042. DebugMsg(SPeepholeOptimization + 'MovzShr2ShrMovz', hp1)
  11043. else
  11044. DebugMsg(SPeepholeOptimization + 'MovsSar2SarMovs', hp1);
  11045. Result := True;
  11046. end;
  11047. if reg_and_hp1_is_instr and
  11048. (taicpu(p).oper[0]^.typ = top_reg) and
  11049. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  11050. (
  11051. (taicpu(hp1).opcode = taicpu(p).opcode)
  11052. or ((taicpu(p).opcode = A_MOVZX) and ((taicpu(hp1).opcode = A_MOVSX){$ifdef x86_64} or (taicpu(hp1).opcode = A_MOVSXD){$endif x86_64}))
  11053. {$ifdef x86_64}
  11054. or ((taicpu(p).opcode = A_MOVSX) and (taicpu(hp1).opcode = A_MOVSXD))
  11055. {$endif x86_64}
  11056. ) then
  11057. begin
  11058. if MatchOpType(taicpu(hp1), top_reg, top_reg) and
  11059. (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[0]^.reg) and
  11060. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then
  11061. begin
  11062. {
  11063. For example:
  11064. movzbw %al,%ax
  11065. movzwl %ax,%eax
  11066. Compress into:
  11067. movzbl %al,%eax
  11068. }
  11069. RegUsed := False;
  11070. case taicpu(p).opsize of
  11071. S_BW:
  11072. case taicpu(hp1).opsize of
  11073. S_WL:
  11074. begin
  11075. taicpu(p).opsize := S_BL;
  11076. RegUsed := True;
  11077. end;
  11078. {$ifdef x86_64}
  11079. S_WQ:
  11080. begin
  11081. if taicpu(p).opcode = A_MOVZX then
  11082. begin
  11083. taicpu(p).opsize := S_BL;
  11084. { 64-bit zero extension is implicit, so change to the 32-bit register }
  11085. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  11086. end
  11087. else
  11088. taicpu(p).opsize := S_BQ;
  11089. RegUsed := True;
  11090. end;
  11091. {$endif x86_64}
  11092. else
  11093. ;
  11094. end;
  11095. {$ifdef x86_64}
  11096. S_BL:
  11097. case taicpu(hp1).opsize of
  11098. S_LQ:
  11099. begin
  11100. if taicpu(p).opcode = A_MOVZX then
  11101. begin
  11102. taicpu(p).opsize := S_BL;
  11103. { 64-bit zero extension is implicit, so change to the 32-bit register }
  11104. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  11105. end
  11106. else
  11107. taicpu(p).opsize := S_BQ;
  11108. RegUsed := True;
  11109. end;
  11110. else
  11111. ;
  11112. end;
  11113. S_WL:
  11114. case taicpu(hp1).opsize of
  11115. S_LQ:
  11116. begin
  11117. if taicpu(p).opcode = A_MOVZX then
  11118. begin
  11119. taicpu(p).opsize := S_WL;
  11120. { 64-bit zero extension is implicit, so change to the 32-bit register }
  11121. setsubreg(taicpu(hp1).oper[1]^.reg, R_SUBD);
  11122. end
  11123. else
  11124. taicpu(p).opsize := S_WQ;
  11125. RegUsed := True;
  11126. end;
  11127. else
  11128. ;
  11129. end;
  11130. {$endif x86_64}
  11131. else
  11132. ;
  11133. end;
  11134. if RegUsed then
  11135. begin
  11136. DebugMsg(SPeepholeOptimization + 'MovxMovx2Movx', p);
  11137. taicpu(p).oper[1]^.reg := taicpu(hp1).oper[1]^.reg;
  11138. RemoveInstruction(hp1);
  11139. Result := True;
  11140. Exit;
  11141. end;
  11142. end;
  11143. if (taicpu(hp1).opsize = taicpu(p).opsize) and
  11144. not RegInInstruction(taicpu(p).oper[1]^.reg, hp1) and
  11145. GetNextInstruction(hp1, hp2) and
  11146. MatchInstruction(hp2, [A_AND, A_OR, A_XOR, A_TEST], []) and
  11147. (
  11148. ((taicpu(hp2).opsize = S_W) and (taicpu(p).opsize = S_BW)) or
  11149. ((taicpu(hp2).opsize = S_L) and (taicpu(p).opsize in [S_BL, S_WL]))
  11150. {$ifdef x86_64}
  11151. or ((taicpu(hp2).opsize = S_Q) and (taicpu(p).opsize in [S_BL, S_BQ, S_WL, S_WQ, S_LQ]))
  11152. {$endif x86_64}
  11153. ) and
  11154. MatchOpType(taicpu(hp2), top_reg, top_reg) and
  11155. (
  11156. (
  11157. (taicpu(hp2).oper[0]^.reg = taicpu(hp1).oper[1]^.reg) and
  11158. (taicpu(hp2).oper[1]^.reg = taicpu(p).oper[1]^.reg)
  11159. ) or
  11160. (
  11161. { Only allow the operands in reverse order for TEST instructions }
  11162. (taicpu(hp2).opcode = A_TEST) and
  11163. (taicpu(hp2).oper[0]^.reg = taicpu(p).oper[1]^.reg) and
  11164. (taicpu(hp2).oper[1]^.reg = taicpu(hp1).oper[1]^.reg)
  11165. )
  11166. ) then
  11167. begin
  11168. {
  11169. For example:
  11170. movzbl %al,%eax
  11171. movzbl (ref),%edx
  11172. andl %edx,%eax
  11173. (%edx deallocated)
  11174. Change to:
  11175. andb (ref),%al
  11176. movzbl %al,%eax
  11177. Rules are:
  11178. - First two instructions have the same opcode and opsize
  11179. - First instruction's operands are the same super-register
  11180. - Second instruction operates on a different register
  11181. - Third instruction is AND, OR, XOR or TEST
  11182. - Third instruction's operands are the destination registers of the first two instructions
  11183. - Third instruction writes to the destination register of the first instruction (except with TEST)
  11184. - Second instruction's destination register is deallocated afterwards
  11185. }
  11186. TransferUsedRegs(TmpUsedRegs);
  11187. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  11188. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  11189. if not RegUsedAfterInstruction(taicpu(hp1).oper[1]^.reg, hp2, TmpUsedRegs) then
  11190. begin
  11191. case taicpu(p).opsize of
  11192. S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  11193. NewSize := S_B;
  11194. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  11195. NewSize := S_W;
  11196. {$ifdef x86_64}
  11197. S_LQ:
  11198. NewSize := S_L;
  11199. {$endif x86_64}
  11200. else
  11201. InternalError(2021120301);
  11202. end;
  11203. taicpu(hp2).loadoper(0, taicpu(hp1).oper[0]^);
  11204. taicpu(hp2).loadreg(1, taicpu(p).oper[0]^.reg);
  11205. taicpu(hp2).opsize := NewSize;
  11206. RemoveInstruction(hp1);
  11207. { With TEST, it's best to keep the MOVX instruction at the top }
  11208. if (taicpu(hp2).opcode <> A_TEST) then
  11209. begin
  11210. DebugMsg(SPeepholeOptimization + 'MovxMovxTest2MovxTest', p);
  11211. asml.Remove(p);
  11212. { If the third instruction uses the flags, the MOVX instruction won't modify then }
  11213. asml.InsertAfter(p, hp2);
  11214. p := hp2;
  11215. end
  11216. else
  11217. DebugMsg(SPeepholeOptimization + 'MovxMovxOp2OpMovx', p);
  11218. Result := True;
  11219. Exit;
  11220. end;
  11221. end;
  11222. end;
  11223. if taicpu(p).opcode=A_MOVZX then
  11224. begin
  11225. { removes superfluous And's after movzx's }
  11226. if reg_and_hp1_is_instr and
  11227. (taicpu(hp1).opcode = A_AND) and
  11228. MatchOpType(taicpu(hp1),top_const,top_reg) and
  11229. ((taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg)
  11230. {$ifdef x86_64}
  11231. { check for implicit extension to 64 bit }
  11232. or
  11233. ((taicpu(p).opsize in [S_BL,S_WL]) and
  11234. (taicpu(hp1).opsize=S_Q) and
  11235. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[1]^.reg)
  11236. )
  11237. {$endif x86_64}
  11238. )
  11239. then
  11240. begin
  11241. case taicpu(p).opsize Of
  11242. S_BL, S_BW{$ifdef x86_64}, S_BQ{$endif x86_64}:
  11243. if (taicpu(hp1).oper[0]^.val = $ff) then
  11244. begin
  11245. DebugMsg(SPeepholeOptimization + 'MovzAnd2Movz1',p);
  11246. RemoveInstruction(hp1);
  11247. Result:=true;
  11248. exit;
  11249. end;
  11250. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  11251. if (taicpu(hp1).oper[0]^.val = $ffff) then
  11252. begin
  11253. DebugMsg(SPeepholeOptimization + 'MovzAnd2Movz2',p);
  11254. RemoveInstruction(hp1);
  11255. Result:=true;
  11256. exit;
  11257. end;
  11258. {$ifdef x86_64}
  11259. S_LQ:
  11260. if (taicpu(hp1).oper[0]^.val = $ffffffff) then
  11261. begin
  11262. DebugMsg(SPeepholeOptimization + 'MovzAnd2Movz3',p);
  11263. RemoveInstruction(hp1);
  11264. Result:=true;
  11265. exit;
  11266. end;
  11267. {$endif x86_64}
  11268. else
  11269. ;
  11270. end;
  11271. { we cannot get rid of the and, but can we get rid of the movz ?}
  11272. if SuperRegistersEqual(taicpu(p).oper[0]^.reg,taicpu(p).oper[1]^.reg) then
  11273. begin
  11274. case taicpu(p).opsize Of
  11275. S_BL, S_BW{$ifdef x86_64}, S_BQ{$endif x86_64}:
  11276. if (taicpu(hp1).oper[0]^.val and $ff)=taicpu(hp1).oper[0]^.val then
  11277. begin
  11278. DebugMsg(SPeepholeOptimization + 'MovzAnd2And1',p);
  11279. RemoveCurrentP(p,hp1);
  11280. Result:=true;
  11281. exit;
  11282. end;
  11283. S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  11284. if (taicpu(hp1).oper[0]^.val and $ffff)=taicpu(hp1).oper[0]^.val then
  11285. begin
  11286. DebugMsg(SPeepholeOptimization + 'MovzAnd2And2',p);
  11287. RemoveCurrentP(p,hp1);
  11288. Result:=true;
  11289. exit;
  11290. end;
  11291. {$ifdef x86_64}
  11292. S_LQ:
  11293. if (taicpu(hp1).oper[0]^.val and $ffffffff)=taicpu(hp1).oper[0]^.val then
  11294. begin
  11295. DebugMsg(SPeepholeOptimization + 'MovzAnd2And3',p);
  11296. RemoveCurrentP(p,hp1);
  11297. Result:=true;
  11298. exit;
  11299. end;
  11300. {$endif x86_64}
  11301. else
  11302. ;
  11303. end;
  11304. end;
  11305. end;
  11306. { changes some movzx constructs to faster synonyms (all examples
  11307. are given with eax/ax, but are also valid for other registers)}
  11308. if MatchOpType(taicpu(p),top_reg,top_reg) then
  11309. begin
  11310. case taicpu(p).opsize of
  11311. { Technically, movzbw %al,%ax cannot be encoded in 32/64-bit mode
  11312. (the machine code is equivalent to movzbl %al,%eax), but the
  11313. code generator still generates that assembler instruction and
  11314. it is silently converted. This should probably be checked.
  11315. [Kit] }
  11316. S_BW:
  11317. begin
  11318. if (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) and
  11319. (
  11320. not IsMOVZXAcceptable
  11321. { and $0xff,%ax has a smaller encoding but risks a partial write penalty }
  11322. or (
  11323. (cs_opt_size in current_settings.optimizerswitches) and
  11324. (taicpu(p).oper[1]^.reg = NR_AX)
  11325. )
  11326. ) then
  11327. {Change "movzbw %al, %ax" to "andw $0x0ffh, %ax"}
  11328. begin
  11329. DebugMsg(SPeepholeOptimization + 'var7',p);
  11330. taicpu(p).opcode := A_AND;
  11331. taicpu(p).changeopsize(S_W);
  11332. taicpu(p).loadConst(0,$ff);
  11333. Result := True;
  11334. end
  11335. else if not IsMOVZXAcceptable and
  11336. GetNextInstruction(p, hp1) and
  11337. (tai(hp1).typ = ait_instruction) and
  11338. (taicpu(hp1).opcode = A_AND) and
  11339. MatchOpType(taicpu(hp1),top_const,top_reg) and
  11340. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  11341. { Change "movzbw %reg1, %reg2; andw $const, %reg2"
  11342. to "movw %reg1, reg2; andw $(const1 and $ff), %reg2"}
  11343. begin
  11344. DebugMsg(SPeepholeOptimization + 'var8',p);
  11345. taicpu(p).opcode := A_MOV;
  11346. taicpu(p).changeopsize(S_W);
  11347. setsubreg(taicpu(p).oper[0]^.reg,R_SUBW);
  11348. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  11349. Result := True;
  11350. end;
  11351. end;
  11352. {$ifndef i8086} { movzbl %al,%eax cannot be encoded in 16-bit mode (the machine code is equivalent to movzbw %al,%ax }
  11353. S_BL:
  11354. if not IsMOVZXAcceptable then
  11355. begin
  11356. if (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) then
  11357. { Change "movzbl %al, %eax" to "andl $0x0ffh, %eax" }
  11358. begin
  11359. DebugMsg(SPeepholeOptimization + 'var9',p);
  11360. taicpu(p).opcode := A_AND;
  11361. taicpu(p).changeopsize(S_L);
  11362. taicpu(p).loadConst(0,$ff);
  11363. Result := True;
  11364. end
  11365. else if GetNextInstruction(p, hp1) and
  11366. (tai(hp1).typ = ait_instruction) and
  11367. (taicpu(hp1).opcode = A_AND) and
  11368. MatchOpType(taicpu(hp1),top_const,top_reg) and
  11369. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  11370. { Change "movzbl %reg1, %reg2; andl $const, %reg2"
  11371. to "movl %reg1, reg2; andl $(const1 and $ff), %reg2"}
  11372. begin
  11373. DebugMsg(SPeepholeOptimization + 'var10',p);
  11374. taicpu(p).opcode := A_MOV;
  11375. taicpu(p).changeopsize(S_L);
  11376. { do not use R_SUBWHOLE
  11377. as movl %rdx,%eax
  11378. is invalid in assembler PM }
  11379. setsubreg(taicpu(p).oper[0]^.reg, R_SUBD);
  11380. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  11381. Result := True;
  11382. end;
  11383. end;
  11384. {$endif i8086}
  11385. S_WL:
  11386. if not IsMOVZXAcceptable then
  11387. begin
  11388. if (getsupreg(taicpu(p).oper[0]^.reg)=getsupreg(taicpu(p).oper[1]^.reg)) then
  11389. { Change "movzwl %ax, %eax" to "andl $0x0ffffh, %eax" }
  11390. begin
  11391. DebugMsg(SPeepholeOptimization + 'var11',p);
  11392. taicpu(p).opcode := A_AND;
  11393. taicpu(p).changeopsize(S_L);
  11394. taicpu(p).loadConst(0,$ffff);
  11395. Result := True;
  11396. end
  11397. else if GetNextInstruction(p, hp1) and
  11398. (tai(hp1).typ = ait_instruction) and
  11399. (taicpu(hp1).opcode = A_AND) and
  11400. (taicpu(hp1).oper[0]^.typ = top_const) and
  11401. (taicpu(hp1).oper[1]^.typ = top_reg) and
  11402. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  11403. { Change "movzwl %reg1, %reg2; andl $const, %reg2"
  11404. to "movl %reg1, reg2; andl $(const1 and $ffff), %reg2"}
  11405. begin
  11406. DebugMsg(SPeepholeOptimization + 'var12',p);
  11407. taicpu(p).opcode := A_MOV;
  11408. taicpu(p).changeopsize(S_L);
  11409. { do not use R_SUBWHOLE
  11410. as movl %rdx,%eax
  11411. is invalid in assembler PM }
  11412. setsubreg(taicpu(p).oper[0]^.reg, R_SUBD);
  11413. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ffff);
  11414. Result := True;
  11415. end;
  11416. end;
  11417. else
  11418. InternalError(2017050705);
  11419. end;
  11420. end
  11421. else if not IsMOVZXAcceptable and (taicpu(p).oper[0]^.typ = top_ref) then
  11422. begin
  11423. if GetNextInstruction(p, hp1) and
  11424. (tai(hp1).typ = ait_instruction) and
  11425. (taicpu(hp1).opcode = A_AND) and
  11426. MatchOpType(taicpu(hp1),top_const,top_reg) and
  11427. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  11428. begin
  11429. //taicpu(p).opcode := A_MOV;
  11430. case taicpu(p).opsize Of
  11431. S_BL:
  11432. begin
  11433. DebugMsg(SPeepholeOptimization + 'var13',p);
  11434. taicpu(hp1).changeopsize(S_L);
  11435. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  11436. end;
  11437. S_WL:
  11438. begin
  11439. DebugMsg(SPeepholeOptimization + 'var14',p);
  11440. taicpu(hp1).changeopsize(S_L);
  11441. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ffff);
  11442. end;
  11443. S_BW:
  11444. begin
  11445. DebugMsg(SPeepholeOptimization + 'var15',p);
  11446. taicpu(hp1).changeopsize(S_W);
  11447. taicpu(hp1).loadConst(0,taicpu(hp1).oper[0]^.val and $ff);
  11448. end;
  11449. else
  11450. Internalerror(2017050704)
  11451. end;
  11452. Result := True;
  11453. end;
  11454. end;
  11455. end;
  11456. end;
  11457. function TX86AsmOptimizer.OptPass1AND(var p : tai) : boolean;
  11458. var
  11459. hp1, hp2 : tai;
  11460. MaskLength : Cardinal;
  11461. MaskedBits : TCgInt;
  11462. ActiveReg : TRegister;
  11463. begin
  11464. Result:=false;
  11465. { There are no optimisations for reference targets }
  11466. if (taicpu(p).oper[1]^.typ <> top_reg) then
  11467. Exit;
  11468. while GetNextInstruction(p, hp1) and
  11469. (hp1.typ = ait_instruction) do
  11470. begin
  11471. if (taicpu(p).oper[0]^.typ = top_const) then
  11472. begin
  11473. case taicpu(hp1).opcode of
  11474. A_AND:
  11475. if MatchOpType(taicpu(hp1),top_const,top_reg) and
  11476. (getsupreg(taicpu(p).oper[1]^.reg) = getsupreg(taicpu(hp1).oper[1]^.reg)) and
  11477. { the second register must contain the first one, so compare their subreg types }
  11478. (getsubreg(taicpu(p).oper[1]^.reg)<=getsubreg(taicpu(hp1).oper[1]^.reg)) and
  11479. (abs(taicpu(p).oper[0]^.val and taicpu(hp1).oper[0]^.val)<$80000000) then
  11480. { change
  11481. and const1, reg
  11482. and const2, reg
  11483. to
  11484. and (const1 and const2), reg
  11485. }
  11486. begin
  11487. taicpu(hp1).loadConst(0, taicpu(p).oper[0]^.val and taicpu(hp1).oper[0]^.val);
  11488. DebugMsg(SPeepholeOptimization + 'AndAnd2And done',hp1);
  11489. RemoveCurrentP(p, hp1);
  11490. Result:=true;
  11491. exit;
  11492. end;
  11493. A_CMP:
  11494. if (PopCnt(DWord(taicpu(p).oper[0]^.val)) = 1) and { Only 1 bit set }
  11495. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^.val) and
  11496. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg) and
  11497. { Just check that the condition on the next instruction is compatible }
  11498. GetNextInstruction(hp1, hp2) and
  11499. (hp2.typ = ait_instruction) and
  11500. (taicpu(hp2).condition in [C_Z, C_E, C_NZ, C_NE])
  11501. then
  11502. { change
  11503. and 2^n, reg
  11504. cmp 2^n, reg
  11505. j(c) / set(c) / cmov(c) (c is equal or not equal)
  11506. to
  11507. and 2^n, reg
  11508. test reg, reg
  11509. j(~c) / set(~c) / cmov(~c)
  11510. }
  11511. begin
  11512. { Keep TEST instruction in, rather than remove it, because
  11513. it may trigger other optimisations such as MovAndTest2Test }
  11514. taicpu(hp1).loadreg(0, taicpu(hp1).oper[1]^.reg);
  11515. taicpu(hp1).opcode := A_TEST;
  11516. DebugMsg(SPeepholeOptimization + 'AND/CMP/J(c) -> AND/J(~c) with power of 2 constant', p);
  11517. taicpu(hp2).condition := inverse_cond(taicpu(hp2).condition);
  11518. Result := True;
  11519. Exit;
  11520. end;
  11521. A_MOVZX:
  11522. if MatchOpType(taicpu(hp1),top_reg,top_reg) and
  11523. SuperRegistersEqual(taicpu(p).oper[1]^.reg,taicpu(hp1).oper[1]^.reg) and
  11524. (getsupreg(taicpu(hp1).oper[0]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg)) and
  11525. (
  11526. (
  11527. (taicpu(p).opsize=S_W) and
  11528. (taicpu(hp1).opsize=S_BW)
  11529. ) or
  11530. (
  11531. (taicpu(p).opsize=S_L) and
  11532. (taicpu(hp1).opsize in [S_WL,S_BL{$ifdef x86_64},S_BQ,S_WQ{$endif x86_64}])
  11533. )
  11534. {$ifdef x86_64}
  11535. or
  11536. (
  11537. (taicpu(p).opsize=S_Q) and
  11538. (taicpu(hp1).opsize in [S_BQ,S_WQ,S_BL,S_WL])
  11539. )
  11540. {$endif x86_64}
  11541. ) then
  11542. begin
  11543. if (((taicpu(hp1).opsize) in [S_BW,S_BL{$ifdef x86_64},S_BQ{$endif x86_64}]) and
  11544. ((taicpu(p).oper[0]^.val and $ff)=taicpu(p).oper[0]^.val)
  11545. ) or
  11546. (((taicpu(hp1).opsize) in [S_WL{$ifdef x86_64},S_WQ{$endif x86_64}]) and
  11547. ((taicpu(p).oper[0]^.val and $ffff)=taicpu(p).oper[0]^.val))
  11548. then
  11549. begin
  11550. { Unlike MOVSX, MOVZX doesn't actually have a version that zero-extends a
  11551. 32-bit register to a 64-bit register, or even a version called MOVZXD, so
  11552. code that tests for the presence of AND 0xffffffff followed by MOVZX is
  11553. wasted, and is indictive of a compiler bug if it were triggered. [Kit]
  11554. NOTE: To zero-extend from 32 bits to 64 bits, simply use the standard MOV.
  11555. }
  11556. DebugMsg(SPeepholeOptimization + 'AndMovzToAnd done',p);
  11557. RemoveInstruction(hp1);
  11558. { See if there are other optimisations possible }
  11559. Continue;
  11560. end;
  11561. end;
  11562. A_SHL:
  11563. if MatchOpType(taicpu(hp1),top_const,top_reg) and
  11564. (getsupreg(taicpu(p).oper[1]^.reg)=getsupreg(taicpu(hp1).oper[1]^.reg)) then
  11565. begin
  11566. {$ifopt R+}
  11567. {$define RANGE_WAS_ON}
  11568. {$R-}
  11569. {$endif}
  11570. { get length of potential and mask }
  11571. MaskLength:=SizeOf(taicpu(p).oper[0]^.val)*8-BsrQWord(taicpu(p).oper[0]^.val)-1;
  11572. { really a mask? }
  11573. {$ifdef RANGE_WAS_ON}
  11574. {$R+}
  11575. {$endif}
  11576. if (((QWord(1) shl MaskLength)-1)=taicpu(p).oper[0]^.val) and
  11577. { unmasked part shifted out? }
  11578. ((MaskLength+taicpu(hp1).oper[0]^.val)>=topsize2memsize[taicpu(hp1).opsize]) then
  11579. begin
  11580. DebugMsg(SPeepholeOptimization + 'AndShlToShl done',p);
  11581. RemoveCurrentP(p, hp1);
  11582. Result:=true;
  11583. exit;
  11584. end;
  11585. end;
  11586. A_SHR:
  11587. if MatchOpType(taicpu(hp1),top_const,top_reg) and
  11588. (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg) and
  11589. (taicpu(hp1).oper[0]^.val <= 63) then
  11590. begin
  11591. { Does SHR combined with the AND cover all the bits?
  11592. e.g. for "andb $252,%reg; shrb $2,%reg" - the "and" can be removed }
  11593. MaskedBits := taicpu(p).oper[0]^.val or ((TCgInt(1) shl taicpu(hp1).oper[0]^.val) - 1);
  11594. if ((taicpu(p).opsize = S_B) and ((MaskedBits and $FF) = $FF)) or
  11595. ((taicpu(p).opsize = S_W) and ((MaskedBits and $FFFF) = $FFFF)) or
  11596. ((taicpu(p).opsize = S_L) and ((MaskedBits and $FFFFFFFF) = $FFFFFFFF)) then
  11597. begin
  11598. DebugMsg(SPeepholeOptimization + 'AndShrToShr done', p);
  11599. RemoveCurrentP(p, hp1);
  11600. Result := True;
  11601. Exit;
  11602. end;
  11603. end;
  11604. A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  11605. if (taicpu(hp1).oper[0]^.typ = top_reg) and
  11606. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then
  11607. begin
  11608. if SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) and
  11609. (
  11610. (
  11611. (taicpu(hp1).opsize in [S_BW,S_BL{$ifdef x86_64},S_BQ{$endif x86_64}]) and
  11612. ((taicpu(p).oper[0]^.val and $7F) = taicpu(p).oper[0]^.val)
  11613. ) or (
  11614. (taicpu(hp1).opsize in [S_WL{$ifdef x86_64},S_WQ{$endif x86_64}]) and
  11615. ((taicpu(p).oper[0]^.val and $7FFF) = taicpu(p).oper[0]^.val)
  11616. {$ifdef x86_64}
  11617. ) or (
  11618. (taicpu(hp1).opsize = S_LQ) and
  11619. ((taicpu(p).oper[0]^.val and $7fffffff) = taicpu(p).oper[0]^.val)
  11620. {$endif x86_64}
  11621. )
  11622. ) then
  11623. begin
  11624. if (taicpu(p).oper[1]^.reg = taicpu(hp1).oper[1]^.reg){$ifdef x86_64} or (taicpu(hp1).opsize = S_LQ){$endif x86_64} then
  11625. begin
  11626. DebugMsg(SPeepholeOptimization + 'AndMovsxToAnd',p);
  11627. RemoveInstruction(hp1);
  11628. { See if there are other optimisations possible }
  11629. Continue;
  11630. end;
  11631. { The super-registers are the same though.
  11632. Note that this change by itself doesn't improve
  11633. code speed, but it opens up other optimisations. }
  11634. {$ifdef x86_64}
  11635. { Convert 64-bit register to 32-bit }
  11636. case taicpu(hp1).opsize of
  11637. S_BQ:
  11638. begin
  11639. taicpu(hp1).opsize := S_BL;
  11640. taicpu(hp1).oper[1]^.reg := newreg(R_INTREGISTER, getsupreg(taicpu(hp1).oper[1]^.reg), R_SUBD);
  11641. end;
  11642. S_WQ:
  11643. begin
  11644. taicpu(hp1).opsize := S_WL;
  11645. taicpu(hp1).oper[1]^.reg := newreg(R_INTREGISTER, getsupreg(taicpu(hp1).oper[1]^.reg), R_SUBD);
  11646. end
  11647. else
  11648. ;
  11649. end;
  11650. {$endif x86_64}
  11651. DebugMsg(SPeepholeOptimization + 'AndMovsxToAndMovzx', hp1);
  11652. taicpu(hp1).opcode := A_MOVZX;
  11653. { See if there are other optimisations possible }
  11654. Continue;
  11655. end;
  11656. end;
  11657. else
  11658. ;
  11659. end;
  11660. end
  11661. else if MatchOperand(taicpu(p).oper[0]^, taicpu(p).oper[1]^.reg) and
  11662. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) then
  11663. begin
  11664. {$ifdef x86_64}
  11665. if (taicpu(p).opsize = S_Q) then
  11666. begin
  11667. { Never necessary }
  11668. DebugMsg(SPeepholeOptimization + 'Andq2Nop', p);
  11669. RemoveCurrentP(p, hp1);
  11670. Result := True;
  11671. Exit;
  11672. end;
  11673. {$endif x86_64}
  11674. { Forward check to determine necessity of and %reg,%reg }
  11675. TransferUsedRegs(TmpUsedRegs);
  11676. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  11677. { Saves on a bunch of dereferences }
  11678. ActiveReg := taicpu(p).oper[1]^.reg;
  11679. case taicpu(hp1).opcode of
  11680. A_MOV, A_MOVZX, A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif x86_64}:
  11681. if (
  11682. (taicpu(hp1).oper[0]^.typ <> top_ref) or
  11683. not RegInRef(ActiveReg, taicpu(hp1).oper[0]^.ref^)
  11684. ) and
  11685. (
  11686. (taicpu(hp1).opcode <> A_MOV) or
  11687. (taicpu(hp1).oper[1]^.typ <> top_ref) or
  11688. not RegInRef(ActiveReg, taicpu(hp1).oper[1]^.ref^)
  11689. ) and
  11690. not (
  11691. { If mov %reg,%reg is present, remove that instruction instead in OptPass1MOV }
  11692. (taicpu(hp1).opcode = A_MOV) and
  11693. MatchOperand(taicpu(hp1).oper[0]^, ActiveReg) and
  11694. MatchOperand(taicpu(hp1).oper[1]^, ActiveReg)
  11695. ) and
  11696. (
  11697. (
  11698. (taicpu(hp1).oper[0]^.typ = top_reg) and
  11699. (taicpu(hp1).oper[0]^.reg = ActiveReg) and
  11700. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg)
  11701. ) or
  11702. (
  11703. {$ifdef x86_64}
  11704. (
  11705. { If we read from the register, make sure it's not dependent on the upper 32 bits }
  11706. (taicpu(hp1).oper[0]^.typ <> top_reg) or
  11707. not SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, ActiveReg) or
  11708. (GetSubReg(taicpu(hp1).oper[0]^.reg) <> R_SUBQ)
  11709. ) and
  11710. {$endif x86_64}
  11711. not RegUsedAfterInstruction(ActiveReg, hp1, TmpUsedRegs)
  11712. )
  11713. ) then
  11714. begin
  11715. DebugMsg(SPeepholeOptimization + 'AndMovx2Movx', p);
  11716. RemoveCurrentP(p, hp1);
  11717. Result := True;
  11718. Exit;
  11719. end;
  11720. A_ADD,
  11721. A_AND,
  11722. A_BSF,
  11723. A_BSR,
  11724. A_BTC,
  11725. A_BTR,
  11726. A_BTS,
  11727. A_OR,
  11728. A_SUB,
  11729. A_XOR:
  11730. { Register is written to, so this will clear the upper 32 bits (2-operand instructions) }
  11731. if (
  11732. (taicpu(hp1).oper[0]^.typ <> top_ref) or
  11733. not RegInRef(ActiveReg, taicpu(hp1).oper[0]^.ref^)
  11734. ) and
  11735. MatchOperand(taicpu(hp1).oper[1]^, ActiveReg) then
  11736. begin
  11737. DebugMsg(SPeepholeOptimization + 'AndOp2Op 2', p);
  11738. RemoveCurrentP(p, hp1);
  11739. Result := True;
  11740. Exit;
  11741. end;
  11742. A_CMP,
  11743. A_TEST:
  11744. if (
  11745. (taicpu(hp1).oper[0]^.typ <> top_ref) or
  11746. not RegInRef(ActiveReg, taicpu(hp1).oper[0]^.ref^)
  11747. ) and
  11748. MatchOperand(taicpu(hp1).oper[1]^, ActiveReg) and
  11749. not RegUsedAfterInstruction(ActiveReg, hp1, TmpUsedRegs) then
  11750. begin
  11751. DebugMsg(SPeepholeOptimization + 'AND; CMP/TEST -> CMP/TEST', p);
  11752. RemoveCurrentP(p, hp1);
  11753. Result := True;
  11754. Exit;
  11755. end;
  11756. A_BSWAP,
  11757. A_NEG,
  11758. A_NOT:
  11759. { Register is written to, so this will clear the upper 32 bits (1-operand instructions) }
  11760. if MatchOperand(taicpu(hp1).oper[0]^, ActiveReg) then
  11761. begin
  11762. DebugMsg(SPeepholeOptimization + 'AndOp2Op 1', p);
  11763. RemoveCurrentP(p, hp1);
  11764. Result := True;
  11765. Exit;
  11766. end;
  11767. else
  11768. ;
  11769. end;
  11770. end;
  11771. if (taicpu(hp1).is_jmp) and
  11772. (taicpu(hp1).opcode<>A_JMP) and
  11773. not(RegInUsedRegs(taicpu(p).oper[1]^.reg,UsedRegs)) then
  11774. begin
  11775. { change
  11776. and x, reg
  11777. jxx
  11778. to
  11779. test x, reg
  11780. jxx
  11781. if reg is deallocated before the
  11782. jump, but only if it's a conditional jump (PFV)
  11783. }
  11784. DebugMsg(SPeepholeOptimization + 'AndJcc2TestJcc', p);
  11785. taicpu(p).opcode := A_TEST;
  11786. Exit;
  11787. end;
  11788. Break;
  11789. end;
  11790. { Lone AND tests }
  11791. if (taicpu(p).oper[0]^.typ = top_const) then
  11792. begin
  11793. {
  11794. - Convert and $0xFF,reg to and reg,reg if reg is 8-bit
  11795. - Convert and $0xFFFF,reg to and reg,reg if reg is 16-bit
  11796. - Convert and $0xFFFFFFFF,reg to and reg,reg if reg is 32-bit
  11797. }
  11798. if ((taicpu(p).oper[0]^.val = $FF) and (taicpu(p).opsize = S_B)) or
  11799. ((taicpu(p).oper[0]^.val = $FFFF) and (taicpu(p).opsize = S_W)) or
  11800. ((taicpu(p).oper[0]^.val = $FFFFFFFF) and (taicpu(p).opsize = S_L)) then
  11801. begin
  11802. taicpu(p).loadreg(0, taicpu(p).oper[1]^.reg);
  11803. if taicpu(p).opsize = S_L then
  11804. begin
  11805. Include(OptsToCheck,aoc_MovAnd2Mov_3);
  11806. Result := True;
  11807. end;
  11808. end;
  11809. end;
  11810. { Backward check to determine necessity of and %reg,%reg }
  11811. if (taicpu(p).oper[0]^.typ = top_reg) and
  11812. (taicpu(p).oper[0]^.reg = taicpu(p).oper[1]^.reg) and
  11813. not RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  11814. GetLastInstruction(p, hp2) and
  11815. RegModifiedByInstruction(taicpu(p).oper[1]^.reg, hp2) and
  11816. { Check size of adjacent instruction to determine if the AND is
  11817. effectively a null operation }
  11818. (
  11819. (taicpu(p).opsize = taicpu(hp2).opsize) or
  11820. { Note: Don't include S_Q }
  11821. ((taicpu(p).opsize = S_L) and (taicpu(hp2).opsize in [S_BL, S_WL])) or
  11822. ((taicpu(p).opsize = S_W) and (taicpu(hp2).opsize in [S_BW, S_BL, S_WL, S_L])) or
  11823. ((taicpu(p).opsize = S_B) and (taicpu(hp2).opsize in [S_BW, S_BL, S_WL, S_W, S_L]))
  11824. ) then
  11825. begin
  11826. DebugMsg(SPeepholeOptimization + 'And2Nop', p);
  11827. { If GetNextInstruction returned False, hp1 will be nil }
  11828. RemoveCurrentP(p, hp1);
  11829. Result := True;
  11830. Exit;
  11831. end;
  11832. end;
  11833. function TX86AsmOptimizer.OptPass2ADD(var p : tai) : boolean;
  11834. var
  11835. hp1, hp2: tai;
  11836. NewRef: TReference;
  11837. Distance: Cardinal;
  11838. TempTracking: TAllUsedRegs;
  11839. { This entire nested function is used in an if-statement below, but we
  11840. want to avoid all the used reg transfers and GetNextInstruction calls
  11841. until we really have to check }
  11842. function MemRegisterNotUsedLater: Boolean; inline;
  11843. var
  11844. hp2: tai;
  11845. begin
  11846. TransferUsedRegs(TmpUsedRegs);
  11847. hp2 := p;
  11848. repeat
  11849. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  11850. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  11851. Result := not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs);
  11852. end;
  11853. begin
  11854. Result := False;
  11855. if (taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif}]) and
  11856. (taicpu(p).oper[1]^.typ = top_reg) then
  11857. begin
  11858. Distance := GetNextInstructionUsingRegCount(p, hp1, taicpu(p).oper[1]^.reg);
  11859. if (Distance = 0) or (Distance > 3) { Likely too far to make a meaningful difference } or
  11860. (hp1.typ <> ait_instruction) or
  11861. not
  11862. (
  11863. (cs_opt_level3 in current_settings.optimizerswitches) or
  11864. { GetNextInstructionUsingRegCount just returns the next valid instruction under -O2 and under }
  11865. RegInInstruction(taicpu(p).oper[1]^.reg, hp1)
  11866. ) then
  11867. Exit;
  11868. { Some of the MOV optimisations are much more in-depth. For example, if we have:
  11869. addq $x, %rax
  11870. movq %rax, %rdx
  11871. sarq $63, %rdx
  11872. (%rax still in use)
  11873. ...letting OptPass2ADD run its course (and without -Os) will produce:
  11874. leaq $x(%rax),%rdx
  11875. addq $x, %rax
  11876. sarq $63, %rdx
  11877. ...which is okay since it breaks the dependency chain between
  11878. addq and movq, but if OptPass2MOV is called first:
  11879. addq $x, %rax
  11880. cqto
  11881. ...which is better in all ways, taking only 2 cycles to execute
  11882. and much smaller in code size.
  11883. }
  11884. { The extra register tracking is quite strenuous }
  11885. if (cs_opt_level2 in current_settings.optimizerswitches) and
  11886. MatchInstruction(hp1, A_MOV, []) then
  11887. begin
  11888. { Update the register tracking to the MOV instruction }
  11889. CopyUsedRegs(TempTracking);
  11890. hp2 := p;
  11891. repeat
  11892. UpdateUsedRegs(tai(hp2.Next));
  11893. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  11894. { if hp1 <> hp2 after the call, then hp1 got removed, so let
  11895. OptPass2ADD get called again }
  11896. if OptPass2MOV(hp1) and (hp1 <> hp2) then
  11897. begin
  11898. { Reset the tracking to the current instruction }
  11899. RestoreUsedRegs(TempTracking);
  11900. ReleaseUsedRegs(TempTracking);
  11901. Result := True;
  11902. Exit;
  11903. end;
  11904. { Reset the tracking to the current instruction }
  11905. RestoreUsedRegs(TempTracking);
  11906. ReleaseUsedRegs(TempTracking);
  11907. { If OptPass2MOV returned True, we don't need to set Result to
  11908. True if hp1 didn't change because the ADD instruction didn't
  11909. get modified and we'll be evaluating hp1 again when the
  11910. peephole optimizer reaches it }
  11911. end;
  11912. { Change:
  11913. add %reg2,%reg1
  11914. (%reg2 not modified in between)
  11915. mov/s/z #(%reg1),%reg1 (%reg1 superregisters must be the same)
  11916. To:
  11917. mov/s/z #(%reg1,%reg2),%reg1
  11918. }
  11919. if (taicpu(p).oper[0]^.typ = top_reg) and
  11920. MatchInstruction(hp1, [A_MOV, A_MOVZX, A_MOVSX{$ifdef x86_64}, A_MOVSXD{$endif}], []) and
  11921. MatchOpType(taicpu(hp1), top_ref, top_reg) and
  11922. (taicpu(hp1).oper[0]^.ref^.scalefactor <= 1) and
  11923. (
  11924. (
  11925. (taicpu(hp1).oper[0]^.ref^.base = taicpu(p).oper[1]^.reg) and
  11926. (taicpu(hp1).oper[0]^.ref^.index = NR_NO) and
  11927. { r/esp cannot be an index }
  11928. (taicpu(p).oper[0]^.reg<>NR_STACK_POINTER_REG)
  11929. ) or (
  11930. (taicpu(hp1).oper[0]^.ref^.index = taicpu(p).oper[1]^.reg) and
  11931. (taicpu(hp1).oper[0]^.ref^.base = NR_NO)
  11932. )
  11933. ) and (
  11934. Reg1WriteOverwritesReg2Entirely(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) or
  11935. (
  11936. { If the super registers ARE equal, then this MOV/S/Z does a partial write }
  11937. not SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) and
  11938. MemRegisterNotUsedLater
  11939. )
  11940. ) then
  11941. begin
  11942. if (
  11943. { Instructions are guaranteed to be adjacent on -O2 and under }
  11944. (cs_opt_level3 in current_settings.optimizerswitches) and
  11945. RegModifiedBetween(taicpu(p).oper[0]^.reg, p, hp1)
  11946. ) then
  11947. begin
  11948. { If the other register is used in between, move the MOV
  11949. instruction to right after the ADD instruction so a
  11950. saving can still be made }
  11951. Asml.Remove(hp1);
  11952. Asml.InsertAfter(hp1, p);
  11953. taicpu(hp1).oper[0]^.ref^.base := taicpu(p).oper[1]^.reg;
  11954. taicpu(hp1).oper[0]^.ref^.index := taicpu(p).oper[0]^.reg;
  11955. DebugMsg(SPeepholeOptimization + 'AddMov2Mov done (instruction moved)', p);
  11956. RemoveCurrentp(p, hp1);
  11957. end
  11958. else
  11959. begin
  11960. AllocRegBetween(taicpu(p).oper[0]^.reg, p, hp1, UsedRegs);
  11961. taicpu(hp1).oper[0]^.ref^.base := taicpu(p).oper[1]^.reg;
  11962. taicpu(hp1).oper[0]^.ref^.index := taicpu(p).oper[0]^.reg;
  11963. DebugMsg(SPeepholeOptimization + 'AddMov2Mov done', p);
  11964. if (cs_opt_level3 in current_settings.optimizerswitches) then
  11965. { hp1 may not be the immediate next instruction under -O3 }
  11966. RemoveCurrentp(p)
  11967. else
  11968. RemoveCurrentp(p, hp1);
  11969. end;
  11970. Result := True;
  11971. Exit;
  11972. end;
  11973. { Change:
  11974. addl/q $x,%reg1
  11975. movl/q %reg1,%reg2
  11976. To:
  11977. leal/q $x(%reg1),%reg2
  11978. addl/q $x,%reg1 (can be removed if %reg1 or the flags are not used afterwards)
  11979. Breaks the dependency chain.
  11980. }
  11981. if (taicpu(p).oper[0]^.typ = top_const) and
  11982. MatchInstruction(hp1, A_MOV, [taicpu(p).opsize]) and
  11983. (taicpu(hp1).oper[1]^.typ = top_reg) and
  11984. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) and
  11985. (
  11986. { Instructions are guaranteed to be adjacent on -O2 and under }
  11987. not (cs_opt_level3 in current_settings.optimizerswitches) or
  11988. not RegUsedBetween(taicpu(hp1).oper[1]^.reg, p, hp1)
  11989. ) then
  11990. begin
  11991. TransferUsedRegs(TmpUsedRegs);
  11992. hp2 := p;
  11993. repeat
  11994. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  11995. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  11996. if (
  11997. { Don't do AddMov2LeaAdd under -Os, but do allow AddMov2Lea }
  11998. not (cs_opt_size in current_settings.optimizerswitches) or
  11999. (
  12000. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) and
  12001. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)
  12002. )
  12003. ) then
  12004. begin
  12005. { Change the MOV instruction to a LEA instruction, and update the
  12006. first operand }
  12007. reference_reset(NewRef, 1, []);
  12008. NewRef.base := taicpu(p).oper[1]^.reg;
  12009. NewRef.scalefactor := 1;
  12010. NewRef.offset := asizeint(taicpu(p).oper[0]^.val);
  12011. taicpu(hp1).opcode := A_LEA;
  12012. taicpu(hp1).loadref(0, NewRef);
  12013. if RegUsedAfterInstruction(NewRef.base, hp1, TmpUsedRegs) or
  12014. RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs) then
  12015. begin
  12016. hp2 := tai(hp1.Next); { for the benefit of AllocRegBetween }
  12017. { Move what is now the LEA instruction to before the ADD instruction }
  12018. Asml.Remove(hp1);
  12019. Asml.InsertBefore(hp1, p);
  12020. AllocRegBetween(taicpu(hp1).oper[1]^.reg, hp1, hp2, UsedRegs);
  12021. DebugMsg(SPeepholeOptimization + 'AddMov2LeaAdd', p);
  12022. p := hp1;
  12023. end
  12024. else
  12025. begin
  12026. { Since %reg1 or the flags aren't used afterwards, we can delete p completely }
  12027. DebugMsg(SPeepholeOptimization + 'AddMov2Lea', hp1);
  12028. if (cs_opt_level3 in current_settings.optimizerswitches) then
  12029. { hp1 may not be the immediate next instruction under -O3 }
  12030. RemoveCurrentp(p)
  12031. else
  12032. RemoveCurrentp(p, hp1);
  12033. end;
  12034. Result := True;
  12035. end;
  12036. end;
  12037. end;
  12038. end;
  12039. function TX86AsmOptimizer.OptPass2Lea(var p : tai) : Boolean;
  12040. var
  12041. SubReg: TSubRegister;
  12042. begin
  12043. Result:=false;
  12044. SubReg := getsubreg(taicpu(p).oper[1]^.reg);
  12045. if not (RegInUsedRegs(NR_DEFAULTFLAGS,UsedRegs)) then
  12046. with taicpu(p).oper[0]^.ref^ do
  12047. if (offset = 0) and not Assigned(symbol) and not Assigned(relsymbol) and (index <> NR_NO) then
  12048. begin
  12049. if (scalefactor <= 1) and SuperRegistersEqual(base, taicpu(p).oper[1]^.reg) then
  12050. begin
  12051. taicpu(p).loadreg(0, newreg(R_INTREGISTER, getsupreg(index), SubReg));
  12052. taicpu(p).opcode := A_ADD;
  12053. DebugMsg(SPeepholeOptimization + 'Lea2AddBase done',p);
  12054. Result := True;
  12055. end
  12056. else if SuperRegistersEqual(index, taicpu(p).oper[1]^.reg) then
  12057. begin
  12058. if (base <> NR_NO) then
  12059. begin
  12060. if (scalefactor <= 1) then
  12061. begin
  12062. taicpu(p).loadreg(0, newreg(R_INTREGISTER, getsupreg(base), SubReg));
  12063. taicpu(p).opcode := A_ADD;
  12064. DebugMsg(SPeepholeOptimization + 'Lea2AddIndex done',p);
  12065. Result := True;
  12066. end;
  12067. end
  12068. else
  12069. { Convert lea (%reg,2^x),%reg to shl x,%reg }
  12070. if (scalefactor in [2, 4, 8]) then
  12071. begin
  12072. { BsrByte is, in essence, the base-2 logarithm of the scale factor }
  12073. taicpu(p).loadconst(0, BsrByte(scalefactor));
  12074. taicpu(p).opcode := A_SHL;
  12075. DebugMsg(SPeepholeOptimization + 'Lea2Shl done',p);
  12076. Result := True;
  12077. end;
  12078. end;
  12079. end;
  12080. end;
  12081. function TX86AsmOptimizer.OptPass2SUB(var p: tai): Boolean;
  12082. var
  12083. hp1, hp2: tai;
  12084. NewRef: TReference;
  12085. Distance: Cardinal;
  12086. TempTracking: TAllUsedRegs;
  12087. begin
  12088. Result := False;
  12089. if (taicpu(p).opsize in [S_L{$ifdef x86_64}, S_Q{$endif}]) and
  12090. MatchOpType(taicpu(p),top_const,top_reg) then
  12091. begin
  12092. Distance := GetNextInstructionUsingRegCount(p, hp1, taicpu(p).oper[1]^.reg);
  12093. if (Distance = 0) or (Distance > 3) { Likely too far to make a meaningful difference } or
  12094. (hp1.typ <> ait_instruction) or
  12095. not
  12096. (
  12097. (cs_opt_level3 in current_settings.optimizerswitches) or
  12098. { GetNextInstructionUsingRegCount just returns the next valid instruction under -O2 and under }
  12099. RegInInstruction(taicpu(p).oper[1]^.reg, hp1)
  12100. ) then
  12101. Exit;
  12102. { Some of the MOV optimisations are much more in-depth. For example, if we have:
  12103. subq $x, %rax
  12104. movq %rax, %rdx
  12105. sarq $63, %rdx
  12106. (%rax still in use)
  12107. ...letting OptPass2SUB run its course (and without -Os) will produce:
  12108. leaq $-x(%rax),%rdx
  12109. movq $x, %rax
  12110. sarq $63, %rdx
  12111. ...which is okay since it breaks the dependency chain between
  12112. subq and movq, but if OptPass2MOV is called first:
  12113. subq $x, %rax
  12114. cqto
  12115. ...which is better in all ways, taking only 2 cycles to execute
  12116. and much smaller in code size.
  12117. }
  12118. { The extra register tracking is quite strenuous }
  12119. if (cs_opt_level2 in current_settings.optimizerswitches) and
  12120. MatchInstruction(hp1, A_MOV, []) then
  12121. begin
  12122. { Update the register tracking to the MOV instruction }
  12123. CopyUsedRegs(TempTracking);
  12124. hp2 := p;
  12125. repeat
  12126. UpdateUsedRegs(tai(hp2.Next));
  12127. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12128. { if hp1 <> hp2 after the call, then hp1 got removed, so let
  12129. OptPass2SUB get called again }
  12130. if OptPass2MOV(hp1) and (hp1 <> hp2) then
  12131. begin
  12132. { Reset the tracking to the current instruction }
  12133. RestoreUsedRegs(TempTracking);
  12134. ReleaseUsedRegs(TempTracking);
  12135. Result := True;
  12136. Exit;
  12137. end;
  12138. { Reset the tracking to the current instruction }
  12139. RestoreUsedRegs(TempTracking);
  12140. ReleaseUsedRegs(TempTracking);
  12141. { If OptPass2MOV returned True, we don't need to set Result to
  12142. True if hp1 didn't change because the SUB instruction didn't
  12143. get modified and we'll be evaluating hp1 again when the
  12144. peephole optimizer reaches it }
  12145. end;
  12146. { Change:
  12147. subl/q $x,%reg1
  12148. movl/q %reg1,%reg2
  12149. To:
  12150. leal/q $-x(%reg1),%reg2
  12151. subl/q $x,%reg1 (can be removed if %reg1 or the flags are not used afterwards)
  12152. Breaks the dependency chain and potentially permits the removal of
  12153. a CMP instruction if one follows.
  12154. }
  12155. if MatchInstruction(hp1, A_MOV, [taicpu(p).opsize]) and
  12156. (taicpu(hp1).oper[1]^.typ = top_reg) and
  12157. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^.reg) and
  12158. (
  12159. { Instructions are guaranteed to be adjacent on -O2 and under }
  12160. not (cs_opt_level3 in current_settings.optimizerswitches) or
  12161. not RegUsedBetween(taicpu(hp1).oper[1]^.reg, p, hp1)
  12162. ) then
  12163. begin
  12164. TransferUsedRegs(TmpUsedRegs);
  12165. hp2 := p;
  12166. repeat
  12167. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  12168. until not (cs_opt_level3 in current_settings.optimizerswitches) or not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12169. if (
  12170. { Don't do SubMov2LeaSub under -Os, but do allow SubMov2Lea }
  12171. not (cs_opt_size in current_settings.optimizerswitches) or
  12172. (
  12173. not RegUsedAfterInstruction(taicpu(p).oper[1]^.reg, hp1, TmpUsedRegs) and
  12174. not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs)
  12175. )
  12176. ) then
  12177. begin
  12178. { Change the MOV instruction to a LEA instruction, and update the
  12179. first operand }
  12180. reference_reset(NewRef, 1, []);
  12181. NewRef.base := taicpu(p).oper[1]^.reg;
  12182. NewRef.scalefactor := 1;
  12183. NewRef.offset := -taicpu(p).oper[0]^.val;
  12184. taicpu(hp1).opcode := A_LEA;
  12185. taicpu(hp1).loadref(0, NewRef);
  12186. TransferUsedRegs(TmpUsedRegs);
  12187. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  12188. if RegUsedAfterInstruction(NewRef.base, hp1, TmpUsedRegs) or
  12189. RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs) then
  12190. begin
  12191. hp2 := tai(hp1.Next); { for the benefit of AllocRegBetween }
  12192. { Move what is now the LEA instruction to before the SUB instruction }
  12193. Asml.Remove(hp1);
  12194. Asml.InsertBefore(hp1, p);
  12195. AllocRegBetween(taicpu(hp1).oper[1]^.reg, hp1, hp2, UsedRegs);
  12196. DebugMsg(SPeepholeOptimization + 'SubMov2LeaSub', p);
  12197. p := hp1;
  12198. end
  12199. else
  12200. begin
  12201. { Since %reg1 or the flags aren't used afterwards, we can delete p completely }
  12202. DebugMsg(SPeepholeOptimization + 'SubMov2Lea', hp1);
  12203. if (cs_opt_level3 in current_settings.optimizerswitches) then
  12204. { hp1 may not be the immediate next instruction under -O3 }
  12205. RemoveCurrentp(p)
  12206. else
  12207. RemoveCurrentp(p, hp1);
  12208. end;
  12209. Result := True;
  12210. end;
  12211. end;
  12212. end;
  12213. end;
  12214. function TX86AsmOptimizer.SkipSimpleInstructions(var hp1 : tai) : Boolean;
  12215. begin
  12216. { we can skip all instructions not messing with the stack pointer }
  12217. while assigned(hp1) and {MatchInstruction(hp1,[A_LEA,A_MOV,A_MOVQ,A_MOVSQ,A_MOVSX,A_MOVSXD,A_MOVZX,
  12218. A_AND,A_OR,A_XOR,A_ADD,A_SHR,A_SHL,A_IMUL,A_SETcc,A_SAR,A_SUB,A_TEST,A_CMOVcc,
  12219. A_MOVSS,A_MOVSD,A_MOVAPS,A_MOVUPD,A_MOVAPD,A_MOVUPS,
  12220. A_VMOVSS,A_VMOVSD,A_VMOVAPS,A_VMOVUPD,A_VMOVAPD,A_VMOVUPS],[]) and}
  12221. ({(taicpu(hp1).ops=0) or }
  12222. ({(MatchOpType(taicpu(hp1),top_reg,top_reg) or MatchOpType(taicpu(hp1),top_const,top_reg) or
  12223. (MatchOpType(taicpu(hp1),top_ref,top_reg))
  12224. ) and }
  12225. not(RegInInstruction(NR_STACK_POINTER_REG,hp1)) { and not(RegInInstruction(NR_FRAME_POINTER_REG,hp1))}
  12226. )
  12227. ) do
  12228. GetNextInstruction(hp1,hp1);
  12229. Result:=assigned(hp1);
  12230. end;
  12231. function TX86AsmOptimizer.PostPeepholeOptLea(var p : tai) : Boolean;
  12232. var
  12233. hp1, hp2, hp3, hp4, hp5: tai;
  12234. begin
  12235. Result:=false;
  12236. hp5:=nil;
  12237. { replace
  12238. leal(q) x(<stackpointer>),<stackpointer>
  12239. call procname
  12240. leal(q) -x(<stackpointer>),<stackpointer>
  12241. ret
  12242. by
  12243. jmp procname
  12244. but do it only on level 4 because it destroys stack back traces
  12245. }
  12246. if (cs_opt_level4 in current_settings.optimizerswitches) and
  12247. MatchOpType(taicpu(p),top_ref,top_reg) and
  12248. (taicpu(p).oper[0]^.ref^.base=NR_STACK_POINTER_REG) and
  12249. (taicpu(p).oper[0]^.ref^.index=NR_NO) and
  12250. { the -8 or -24 are not required, but bail out early if possible,
  12251. higher values are unlikely }
  12252. ((taicpu(p).oper[0]^.ref^.offset=-8) or
  12253. (taicpu(p).oper[0]^.ref^.offset=-24)) and
  12254. (taicpu(p).oper[0]^.ref^.symbol=nil) and
  12255. (taicpu(p).oper[0]^.ref^.relsymbol=nil) and
  12256. (taicpu(p).oper[1]^.reg=NR_STACK_POINTER_REG) and
  12257. GetNextInstruction(p, hp1) and
  12258. { Take a copy of hp1 }
  12259. SetAndTest(hp1, hp4) and
  12260. { trick to skip label }
  12261. ((hp1.typ=ait_instruction) or GetNextInstruction(hp1, hp1)) and
  12262. SkipSimpleInstructions(hp1) and
  12263. MatchInstruction(hp1,A_CALL,[S_NO]) and
  12264. GetNextInstruction(hp1, hp2) and
  12265. MatchInstruction(hp2,A_LEA,[taicpu(p).opsize]) and
  12266. MatchOpType(taicpu(hp2),top_ref,top_reg) and
  12267. (taicpu(hp2).oper[0]^.ref^.offset=-taicpu(p).oper[0]^.ref^.offset) and
  12268. (taicpu(hp2).oper[0]^.ref^.base=NR_STACK_POINTER_REG) and
  12269. (taicpu(hp2).oper[0]^.ref^.index=NR_NO) and
  12270. (taicpu(hp2).oper[0]^.ref^.symbol=nil) and
  12271. (taicpu(hp2).oper[0]^.ref^.relsymbol=nil) and
  12272. { Segment register will be NR_NO }
  12273. (taicpu(hp2).oper[1]^.reg=NR_STACK_POINTER_REG) and
  12274. GetNextInstruction(hp2, hp3) and
  12275. { trick to skip label }
  12276. ((hp3.typ=ait_instruction) or GetNextInstruction(hp3, hp3)) and
  12277. (MatchInstruction(hp3,A_RET,[S_NO]) or
  12278. (MatchInstruction(hp3,A_VZEROUPPER,[S_NO]) and
  12279. SetAndTest(hp3,hp5) and
  12280. GetNextInstruction(hp3,hp3) and
  12281. MatchInstruction(hp3,A_RET,[S_NO])
  12282. )
  12283. ) and
  12284. (taicpu(hp3).ops=0) then
  12285. begin
  12286. taicpu(hp1).opcode := A_JMP;
  12287. taicpu(hp1).is_jmp := true;
  12288. DebugMsg(SPeepholeOptimization + 'LeaCallLeaRet2Jmp done',p);
  12289. RemoveCurrentP(p, hp4);
  12290. RemoveInstruction(hp2);
  12291. RemoveInstruction(hp3);
  12292. if Assigned(hp5) then
  12293. begin
  12294. AsmL.Remove(hp5);
  12295. ASmL.InsertBefore(hp5,hp1)
  12296. end;
  12297. Result:=true;
  12298. end;
  12299. end;
  12300. function TX86AsmOptimizer.PostPeepholeOptPush(var p : tai) : Boolean;
  12301. {$ifdef x86_64}
  12302. var
  12303. hp1, hp2, hp3, hp4, hp5: tai;
  12304. {$endif x86_64}
  12305. begin
  12306. Result:=false;
  12307. {$ifdef x86_64}
  12308. hp5:=nil;
  12309. { replace
  12310. push %rax
  12311. call procname
  12312. pop %rcx
  12313. ret
  12314. by
  12315. jmp procname
  12316. but do it only on level 4 because it destroys stack back traces
  12317. It depends on the fact, that the sequence push rax/pop rcx is used for stack alignment as rcx is volatile
  12318. for all supported calling conventions
  12319. }
  12320. if (cs_opt_level4 in current_settings.optimizerswitches) and
  12321. MatchOpType(taicpu(p),top_reg) and
  12322. (taicpu(p).oper[0]^.reg=NR_RAX) and
  12323. GetNextInstruction(p, hp1) and
  12324. { Take a copy of hp1 }
  12325. SetAndTest(hp1, hp4) and
  12326. { trick to skip label }
  12327. ((hp1.typ=ait_instruction) or GetNextInstruction(hp1, hp1)) and
  12328. SkipSimpleInstructions(hp1) and
  12329. MatchInstruction(hp1,A_CALL,[S_NO]) and
  12330. GetNextInstruction(hp1, hp2) and
  12331. MatchInstruction(hp2,A_POP,[taicpu(p).opsize]) and
  12332. MatchOpType(taicpu(hp2),top_reg) and
  12333. (taicpu(hp2).oper[0]^.reg=NR_RCX) and
  12334. GetNextInstruction(hp2, hp3) and
  12335. { trick to skip label }
  12336. ((hp3.typ=ait_instruction) or GetNextInstruction(hp3, hp3)) and
  12337. (MatchInstruction(hp3,A_RET,[S_NO]) or
  12338. (MatchInstruction(hp3,A_VZEROUPPER,[S_NO]) and
  12339. SetAndTest(hp3,hp5) and
  12340. GetNextInstruction(hp3,hp3) and
  12341. MatchInstruction(hp3,A_RET,[S_NO])
  12342. )
  12343. ) and
  12344. (taicpu(hp3).ops=0) then
  12345. begin
  12346. taicpu(hp1).opcode := A_JMP;
  12347. taicpu(hp1).is_jmp := true;
  12348. DebugMsg(SPeepholeOptimization + 'PushCallPushRet2Jmp done',p);
  12349. RemoveCurrentP(p, hp4);
  12350. RemoveInstruction(hp2);
  12351. RemoveInstruction(hp3);
  12352. if Assigned(hp5) then
  12353. begin
  12354. AsmL.Remove(hp5);
  12355. ASmL.InsertBefore(hp5,hp1)
  12356. end;
  12357. Result:=true;
  12358. end;
  12359. {$endif x86_64}
  12360. end;
  12361. function TX86AsmOptimizer.PostPeepholeOptMov(var p : tai) : Boolean;
  12362. var
  12363. Value, RegName: string;
  12364. begin
  12365. Result:=false;
  12366. if (taicpu(p).oper[1]^.typ = top_reg) and (taicpu(p).oper[0]^.typ = top_const) then
  12367. begin
  12368. case taicpu(p).oper[0]^.val of
  12369. 0:
  12370. { Don't make this optimisation if the CPU flags are required, since XOR scrambles them }
  12371. if not (RegInUsedRegs(NR_DEFAULTFLAGS,UsedRegs)) then
  12372. begin
  12373. { change "mov $0,%reg" into "xor %reg,%reg" }
  12374. taicpu(p).opcode := A_XOR;
  12375. taicpu(p).loadReg(0,taicpu(p).oper[1]^.reg);
  12376. Result := True;
  12377. {$ifdef x86_64}
  12378. end
  12379. else if (taicpu(p).opsize = S_Q) then
  12380. begin
  12381. RegName := debug_regname(taicpu(p).oper[1]^.reg); { 64-bit register name }
  12382. { The actual optimization }
  12383. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  12384. taicpu(p).changeopsize(S_L);
  12385. DebugMsg(SPeepholeOptimization + 'movq $0,' + RegName + ' -> movl $0,' + debug_regname(taicpu(p).oper[1]^.reg) + ' (immediate can be represented with just 32 bits)', p);
  12386. Result := True;
  12387. end;
  12388. $1..$FFFFFFFF:
  12389. begin
  12390. { Code size reduction by J. Gareth "Kit" Moreton }
  12391. { change 64-bit register to 32-bit register to reduce code size (upper 32 bits will be set to zero) }
  12392. case taicpu(p).opsize of
  12393. S_Q:
  12394. begin
  12395. RegName := debug_regname(taicpu(p).oper[1]^.reg); { 64-bit register name }
  12396. Value := debug_tostr(taicpu(p).oper[0]^.val);
  12397. { The actual optimization }
  12398. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  12399. taicpu(p).changeopsize(S_L);
  12400. DebugMsg(SPeepholeOptimization + 'movq $' + Value + ',' + RegName + ' -> movl $' + Value + ',' + debug_regname(taicpu(p).oper[1]^.reg) + ' (immediate can be represented with just 32 bits)', p);
  12401. Result := True;
  12402. end;
  12403. else
  12404. { Do nothing };
  12405. end;
  12406. {$endif x86_64}
  12407. end;
  12408. -1:
  12409. { Don't make this optimisation if the CPU flags are required, since OR scrambles them }
  12410. if (cs_opt_size in current_settings.optimizerswitches) and
  12411. (taicpu(p).opsize <> S_B) and
  12412. not (RegInUsedRegs(NR_DEFAULTFLAGS,UsedRegs)) then
  12413. begin
  12414. { change "mov $-1,%reg" into "or $-1,%reg" }
  12415. { NOTES:
  12416. - No size saving is made when changing a Word-sized assignment unless the register is AX (smaller encoding)
  12417. - This operation creates a false dependency on the register, so only do it when optimising for size
  12418. - 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
  12419. }
  12420. taicpu(p).opcode := A_OR;
  12421. Result := True;
  12422. end;
  12423. else
  12424. { Do nothing };
  12425. end;
  12426. end;
  12427. end;
  12428. { Returns true if the given logic instruction can be converted into a BTx instruction (BT not included) }
  12429. class function TX86AsmOptimizer.IsBTXAcceptable(p : tai) : boolean;
  12430. begin
  12431. Result := False;
  12432. if not (CPUX86_HAS_BTX in cpu_capabilities[current_settings.optimizecputype]) then
  12433. Exit;
  12434. { For sizes less than S_L, the byte size is equal or larger with BTx,
  12435. so don't bother optimising }
  12436. if not MatchInstruction(p, A_AND, A_OR, A_XOR, [S_L{$ifdef x86_64}, S_Q{$endif x86_64}]) then
  12437. Exit;
  12438. if (taicpu(p).oper[0]^.typ <> top_const) or
  12439. { If the value can fit into an 8-bit signed integer, a smaller
  12440. instruction can be encoded with AND/OR/XOR, so don't optimise if it
  12441. falls within this range }
  12442. (
  12443. (taicpu(p).oper[0]^.val > -128) and
  12444. (taicpu(p).oper[0]^.val <= 127)
  12445. ) then
  12446. Exit;
  12447. { If we're optimising for size, this is acceptable }
  12448. if (cs_opt_size in current_settings.optimizerswitches) then
  12449. Exit(True);
  12450. if (taicpu(p).oper[1]^.typ = top_reg) and
  12451. (CPUX86_HINT_FAST_BTX_REG_IMM in cpu_optimization_hints[current_settings.optimizecputype]) then
  12452. Exit(True);
  12453. if (taicpu(p).oper[1]^.typ <> top_reg) and
  12454. (CPUX86_HINT_FAST_BTX_MEM_IMM in cpu_optimization_hints[current_settings.optimizecputype]) then
  12455. Exit(True);
  12456. end;
  12457. function TX86AsmOptimizer.PostPeepholeOptAnd(var p : tai) : boolean;
  12458. var
  12459. hp1: tai;
  12460. Value: TCGInt;
  12461. begin
  12462. Result := False;
  12463. if MatchOpType(taicpu(p), top_const, top_reg) then
  12464. begin
  12465. { Detect:
  12466. andw x, %ax (0 <= x < $8000)
  12467. ...
  12468. movzwl %ax,%eax
  12469. Change movzwl %ax,%eax to cwtl (shorter encoding for movswl %ax,%eax)
  12470. }
  12471. if (taicpu(p).oper[1]^.reg = NR_AX) and { This is also enough to determine that opsize = S_W }
  12472. ((taicpu(p).oper[0]^.val and $7FFF) = taicpu(p).oper[0]^.val) and
  12473. GetNextInstructionUsingReg(p, hp1, NR_EAX) and
  12474. MatchInstruction(hp1, A_MOVZX, [S_WL]) and
  12475. MatchOperand(taicpu(hp1).oper[0]^, NR_AX) and
  12476. MatchOperand(taicpu(hp1).oper[1]^, NR_EAX) then
  12477. begin
  12478. DebugMsg(SPeepholeOptimization + 'Converted movzwl %ax,%eax to cwtl (via AndMovz2AndCwtl)', hp1);
  12479. taicpu(hp1).opcode := A_CWDE;
  12480. taicpu(hp1).clearop(0);
  12481. taicpu(hp1).clearop(1);
  12482. taicpu(hp1).ops := 0;
  12483. { A change was made, but not with p, so move forward 1 }
  12484. p := tai(p.Next);
  12485. Result := True;
  12486. Exit; { and -> btr won't happen because an opsize of S_W won't be optimised anyway }
  12487. end;
  12488. end;
  12489. { If "not x" is a power of 2 (popcnt = 1), change:
  12490. and $x, %reg/ref
  12491. To:
  12492. btr lb(x), %reg/ref
  12493. }
  12494. if IsBTXAcceptable(p) and
  12495. (
  12496. { Make sure a TEST doesn't follow that plays with the register }
  12497. not GetNextInstruction(p, hp1) or
  12498. not MatchInstruction(hp1, A_TEST, A_CMP, [taicpu(p).opsize]) or
  12499. not MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^.reg)
  12500. ) then
  12501. begin
  12502. {$push}{$R-}{$Q-}
  12503. { Value is a sign-extended 32-bit integer - just correct it
  12504. if it's represented as an unsigned value. Also, IsBTXAcceptable
  12505. checks to see if this operand is an immediate. }
  12506. Value := not taicpu(p).oper[0]^.val;
  12507. {$pop}
  12508. {$ifdef x86_64}
  12509. if taicpu(p).opsize = S_L then
  12510. {$endif x86_64}
  12511. Value := Value and $FFFFFFFF;
  12512. if (PopCnt(QWord(Value)) = 1) then
  12513. begin
  12514. DebugMsg(SPeepholeOptimization + 'Changed AND (not $0x' + hexstr(taicpu(p).oper[0]^.val, 2) + ') to BTR ' + debug_tostr(BsrQWord(Value)) + ' to shrink instruction size (And2Btr)', p);
  12515. taicpu(p).opcode := A_BTR;
  12516. taicpu(p).oper[0]^.val := BsrQWord(Value); { Essentially the base 2 logarithm }
  12517. Result := True;
  12518. Exit;
  12519. end;
  12520. end;
  12521. end;
  12522. function TX86AsmOptimizer.PostPeepholeOptMOVSX(var p : tai) : boolean;
  12523. begin
  12524. Result := False;
  12525. if not MatchOpType(taicpu(p), top_reg, top_reg) then
  12526. Exit;
  12527. { Convert:
  12528. movswl %ax,%eax -> cwtl
  12529. movslq %eax,%rax -> cdqe
  12530. NOTE: Don't convert movswl %al,%ax to cbw, because cbw and cwde
  12531. refer to the same opcode and depends only on the assembler's
  12532. current operand-size attribute. [Kit]
  12533. }
  12534. with taicpu(p) do
  12535. case opsize of
  12536. S_WL:
  12537. if (oper[0]^.reg = NR_AX) and (oper[1]^.reg = NR_EAX) then
  12538. begin
  12539. DebugMsg(SPeepholeOptimization + 'Converted movswl %ax,%eax to cwtl', p);
  12540. opcode := A_CWDE;
  12541. clearop(0);
  12542. clearop(1);
  12543. ops := 0;
  12544. Result := True;
  12545. end;
  12546. {$ifdef x86_64}
  12547. S_LQ:
  12548. if (oper[0]^.reg = NR_EAX) and (oper[1]^.reg = NR_RAX) then
  12549. begin
  12550. DebugMsg(SPeepholeOptimization + 'Converted movslq %eax,%rax to cltq', p);
  12551. opcode := A_CDQE;
  12552. clearop(0);
  12553. clearop(1);
  12554. ops := 0;
  12555. Result := True;
  12556. end;
  12557. {$endif x86_64}
  12558. else
  12559. ;
  12560. end;
  12561. end;
  12562. function TX86AsmOptimizer.PostPeepholeOptShr(var p : tai) : boolean;
  12563. var
  12564. hp1, hp2: tai;
  12565. IdentityMask, Shift: TCGInt;
  12566. LimitSize: Topsize;
  12567. DoNotMerge: Boolean;
  12568. begin
  12569. Result := False;
  12570. { All these optimisations work on "shr const,%reg" }
  12571. if not MatchOpType(taicpu(p), top_const, top_reg) then
  12572. Exit;
  12573. DoNotMerge := False;
  12574. Shift := taicpu(p).oper[0]^.val;
  12575. LimitSize := taicpu(p).opsize;
  12576. hp1 := p;
  12577. repeat
  12578. if not GetNextInstructionUsingReg(hp1, hp1, taicpu(p).oper[1]^.reg) or (hp1.typ <> ait_instruction) then
  12579. Break;
  12580. { Detect:
  12581. shr x, %reg
  12582. and y, %reg
  12583. If and y, %reg doesn't actually change the value of %reg (e.g. with
  12584. "shrl $24,%reg; andl $255,%reg", remove the AND instruction.
  12585. }
  12586. case taicpu(hp1).opcode of
  12587. A_AND:
  12588. if (taicpu(hp1).opsize = taicpu(p).opsize) and
  12589. MatchOpType(taicpu(hp1), top_const, top_reg) and
  12590. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) then
  12591. begin
  12592. { Make sure the FLAGS register isn't in use }
  12593. TransferUsedRegs(TmpUsedRegs);
  12594. hp2 := p;
  12595. repeat
  12596. UpdateUsedRegs(TmpUsedRegs, tai(hp2.Next));
  12597. until not GetNextInstruction(hp2, hp2) or (hp2 = hp1);
  12598. if not RegUsedAfterInstruction(NR_DEFAULTFLAGS, hp1, TmpUsedRegs) then
  12599. begin
  12600. { Generate the identity mask }
  12601. case taicpu(p).opsize of
  12602. S_B:
  12603. IdentityMask := $FF shr Shift;
  12604. S_W:
  12605. IdentityMask := $FFFF shr Shift;
  12606. S_L:
  12607. IdentityMask := $FFFFFFFF shr Shift;
  12608. {$ifdef x86_64}
  12609. S_Q:
  12610. { We need to force the operands to be unsigned 64-bit
  12611. integers otherwise the wrong value is generated }
  12612. IdentityMask := TCGInt(QWord($FFFFFFFFFFFFFFFF) shr QWord(Shift));
  12613. {$endif x86_64}
  12614. else
  12615. InternalError(2022081501);
  12616. end;
  12617. if (taicpu(hp1).oper[0]^.val and IdentityMask) = IdentityMask then
  12618. begin
  12619. DebugMsg(SPeepholeOptimization + 'Removed AND instruction since previous SHR makes this an identity operation (ShrAnd2Shr)', hp1);
  12620. { All the possible 1 bits are covered, so we can remove the AND }
  12621. hp2 := tai(hp1.Previous);
  12622. RemoveInstruction(hp1);
  12623. { p wasn't actually changed, so don't set Result to True,
  12624. but a change was nonetheless made elsewhere }
  12625. Include(OptsToCheck, aoc_ForceNewIteration);
  12626. { Do another pass in case other AND or MOVZX instructions
  12627. follow }
  12628. hp1 := hp2;
  12629. Continue;
  12630. end;
  12631. end;
  12632. end;
  12633. A_TEST, A_CMP, A_Jcc:
  12634. { Skip over conditional jumps and relevant comparisons }
  12635. Continue;
  12636. A_MOVZX:
  12637. if MatchOpType(taicpu(hp1), top_reg, top_reg) and
  12638. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(p).oper[1]^.reg) then
  12639. begin
  12640. { Since the original register is being read as is, subsequent
  12641. SHRs must not be merged at this point }
  12642. DoNotMerge := True;
  12643. if IsShrMovZFoldable(taicpu(p).opsize, taicpu(hp1).opsize, Shift) then
  12644. begin
  12645. if SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^.reg) then
  12646. begin
  12647. DebugMsg(SPeepholeOptimization + 'Removed MOVZX instruction since previous SHR makes it unnecessary (ShrMovz2Shr)', hp1);
  12648. { All the possible 1 bits are covered, so we can remove the AND }
  12649. hp2 := tai(hp1.Previous);
  12650. RemoveInstruction(hp1);
  12651. hp1 := hp2;
  12652. end
  12653. else { Different register target }
  12654. begin
  12655. DebugMsg(SPeepholeOptimization + 'Converted MOVZX instruction to MOV since previous SHR makes zero-extension unnecessary (ShrMovz2ShrMov 2)', hp1);
  12656. taicpu(hp1).opcode := A_MOV;
  12657. setsubreg(taicpu(hp1).oper[0]^.reg, getsubreg(taicpu(hp1).oper[1]^.reg));
  12658. case taicpu(hp1).opsize of
  12659. S_BW:
  12660. taicpu(hp1).opsize := S_W;
  12661. S_BL, S_WL:
  12662. taicpu(hp1).opsize := S_L;
  12663. else
  12664. InternalError(2022081503);
  12665. end;
  12666. end;
  12667. end
  12668. else if (Shift > 0) and
  12669. (taicpu(p).opsize = S_W) and
  12670. (taicpu(hp1).opsize = S_WL) and
  12671. (taicpu(hp1).oper[0]^.reg = NR_AX) and
  12672. (taicpu(hp1).oper[1]^.reg = NR_EAX) then
  12673. begin
  12674. { Detect:
  12675. shr x, %ax (x > 0)
  12676. ...
  12677. movzwl %ax,%eax
  12678. Change movzwl %ax,%eax to cwtl (shorter encoding for movswl %ax,%eax)
  12679. }
  12680. DebugMsg(SPeepholeOptimization + 'Converted movzwl %ax,%eax to cwtl (via ShrMovz2ShrCwtl)', hp1);
  12681. taicpu(hp1).opcode := A_CWDE;
  12682. taicpu(hp1).clearop(0);
  12683. taicpu(hp1).clearop(1);
  12684. taicpu(hp1).ops := 0;
  12685. end;
  12686. { Move onto the next instruction }
  12687. Continue;
  12688. end;
  12689. A_SHL, A_SAL, A_SHR:
  12690. if (taicpu(hp1).opsize <= LimitSize) and
  12691. MatchOpType(taicpu(hp1), top_const, top_reg) and
  12692. SuperRegistersEqual(taicpu(hp1).oper[1]^.reg, taicpu(p).oper[1]^.reg) then
  12693. begin
  12694. { Make sure the sizes don't exceed the register size limit
  12695. (measured by the shift value falling below the limit) }
  12696. if taicpu(hp1).opsize < LimitSize then
  12697. LimitSize := taicpu(hp1).opsize;
  12698. if taicpu(hp1).opcode = A_SHR then
  12699. Inc(Shift, taicpu(hp1).oper[0]^.val)
  12700. else
  12701. begin
  12702. Dec(Shift, taicpu(hp1).oper[0]^.val);
  12703. DoNotMerge := True;
  12704. end;
  12705. if Shift < topsize2memsize[taicpu(p).opsize] - topsize2memsize[LimitSize] then
  12706. Break;
  12707. { Since we've established that the combined shift is within
  12708. limits, we can actually combine the adjacent SHR
  12709. instructions even if they're different sizes }
  12710. if not DoNotMerge and (taicpu(hp1).opcode = A_SHR) then
  12711. begin
  12712. hp2 := tai(hp1.Previous);
  12713. DebugMsg(SPeepholeOptimization + 'ShrShr2Shr 2', p);
  12714. Inc(taicpu(p).oper[0]^.val, taicpu(hp1).oper[0]^.val);
  12715. RemoveInstruction(hp1);
  12716. hp1 := hp2;
  12717. end;
  12718. { Move onto the next instruction }
  12719. Continue;
  12720. end;
  12721. else
  12722. ;
  12723. end;
  12724. Break;
  12725. until False;
  12726. { Detect the following (looking backwards):
  12727. shr %cl,%reg
  12728. shr x, %reg
  12729. Swap the two SHR instructions to minimise a pipeline stall.
  12730. }
  12731. if GetLastInstruction(p, hp1) and
  12732. MatchInstruction(hp1, A_SHR, [taicpu(p).opsize]) and
  12733. MatchOpType(taicpu(hp1), top_reg, top_reg) and
  12734. { First operand will be %cl }
  12735. (taicpu(hp1).oper[1]^.reg = taicpu(p).oper[1]^.reg) and
  12736. { Just to be sure }
  12737. (getsupreg(taicpu(hp1).oper[1]^.reg) <> RS_ECX) then
  12738. begin
  12739. DebugMsg(SPeepholeOptimization + 'Swapped variable and constant SHR instructions to minimise pipeline stall (ShrShr2ShrShr)', hp1);
  12740. { Moving the entries this way ensures the register tracking remains correct }
  12741. Asml.Remove(p);
  12742. Asml.InsertBefore(p, hp1);
  12743. p := hp1;
  12744. { Don't set Result to True because the current instruction is now
  12745. "shr %cl,%reg" and there's nothing more we can do with it }
  12746. end;
  12747. end;
  12748. function TX86AsmOptimizer.PostPeepholeOptADDSUB(var p : tai) : boolean;
  12749. var
  12750. hp1, hp2: tai;
  12751. Opposite, SecondOpposite: TAsmOp;
  12752. NewCond: TAsmCond;
  12753. begin
  12754. Result := False;
  12755. { Change:
  12756. add/sub 128,(dest)
  12757. To:
  12758. sub/add -128,(dest)
  12759. This generaally takes fewer bytes to encode because -128 can be stored
  12760. in a signed byte, whereas +128 cannot.
  12761. }
  12762. if (taicpu(p).opsize <> S_B) and MatchOperand(taicpu(p).oper[0]^, 128) then
  12763. begin
  12764. if taicpu(p).opcode = A_ADD then
  12765. Opposite := A_SUB
  12766. else
  12767. Opposite := A_ADD;
  12768. { Be careful if the flags are in use, because the CF flag inverts
  12769. when changing from ADD to SUB and vice versa }
  12770. if RegInUsedRegs(NR_DEFAULTFLAGS, UsedRegs) and
  12771. GetNextInstruction(p, hp1) then
  12772. begin
  12773. TransferUsedRegs(TmpUsedRegs);
  12774. TmpUsedRegs[R_SPECIALREGISTER].Update(tai(p.Next), True);
  12775. hp2 := hp1;
  12776. { Scan ahead to check if everything's safe }
  12777. while Assigned(hp1) and RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) do
  12778. begin
  12779. if (hp1.typ <> ait_instruction) then
  12780. { Probably unsafe since the flags are still in use }
  12781. Exit;
  12782. if MatchInstruction(hp1, A_CALL, A_JMP, A_RET, []) then
  12783. { Stop searching at an unconditional jump }
  12784. Break;
  12785. if not
  12786. (
  12787. MatchInstruction(hp1, A_ADC, A_SBB, []) and
  12788. (taicpu(hp1).oper[0]^.typ = top_const) { We need to be able to invert a constant }
  12789. ) and
  12790. (taicpu(hp1).condition = C_None) and RegInInstruction(NR_DEFAULTFLAGS, hp1) then
  12791. { Instruction depends on FLAGS (and is not ADC or SBB); break out }
  12792. Exit;
  12793. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  12794. TmpUsedRegs[R_SPECIALREGISTER].Update(tai(hp1.Next), True);
  12795. { Move to the next instruction }
  12796. GetNextInstruction(hp1, hp1);
  12797. end;
  12798. while Assigned(hp2) and (hp2 <> hp1) do
  12799. begin
  12800. NewCond := C_None;
  12801. case taicpu(hp2).condition of
  12802. C_A, C_NBE:
  12803. NewCond := C_BE;
  12804. C_B, C_C, C_NAE:
  12805. NewCond := C_AE;
  12806. C_AE, C_NB, C_NC:
  12807. NewCond := C_B;
  12808. C_BE, C_NA:
  12809. NewCond := C_A;
  12810. else
  12811. { No change needed };
  12812. end;
  12813. if NewCond <> C_None then
  12814. begin
  12815. DebugMsg(SPeepholeOptimization + 'Condition changed from ' + cond2str[taicpu(hp2).condition] + ' to ' + cond2str[NewCond] +
  12816. ' to accommodate ' + debug_op2str(taicpu(p).opcode) + ' -> ' + debug_op2str(opposite) + ' above', hp2);
  12817. taicpu(hp2).condition := NewCond;
  12818. end
  12819. else
  12820. if MatchInstruction(hp2, A_ADC, A_SBB, []) then
  12821. begin
  12822. { Because of the flipping of the carry bit, to ensure
  12823. the operation remains equivalent, ADC becomes SBB
  12824. and vice versa, and the constant is not-inverted.
  12825. If multiple ADCs or SBBs appear in a row, each one
  12826. changed causes the carry bit to invert, so they all
  12827. need to be flipped }
  12828. if taicpu(hp2).opcode = A_ADC then
  12829. SecondOpposite := A_SBB
  12830. else
  12831. SecondOpposite := A_ADC;
  12832. if taicpu(hp2).oper[0]^.typ <> top_const then
  12833. { Should have broken out of this optimisation already }
  12834. InternalError(2021112901);
  12835. 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]^) + ' -> ' +
  12836. 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);
  12837. { Bit-invert the constant (effectively equivalent to "-1 - val") }
  12838. taicpu(hp2).opcode := SecondOpposite;
  12839. taicpu(hp2).oper[0]^.val := not taicpu(hp2).oper[0]^.val;
  12840. end;
  12841. { Move to the next instruction }
  12842. GetNextInstruction(hp2, hp2);
  12843. end;
  12844. if (hp2 <> hp1) then
  12845. InternalError(2021111501);
  12846. end;
  12847. DebugMsg(SPeepholeOptimization + debug_op2str(taicpu(p).opcode) + debug_opsize2str(taicpu(p).opsize) + ' $128,' + debug_operstr(taicpu(p).oper[1]^) + ' changed to ' +
  12848. debug_op2str(opposite) + debug_opsize2str(taicpu(p).opsize) + ' $-128,' + debug_operstr(taicpu(p).oper[1]^) + ' to reduce instruction size', p);
  12849. taicpu(p).opcode := Opposite;
  12850. taicpu(p).oper[0]^.val := -128;
  12851. { No further optimisations can be made on this instruction, so move
  12852. onto the next one to save time }
  12853. p := tai(p.Next);
  12854. UpdateUsedRegs(p);
  12855. Result := True;
  12856. Exit;
  12857. end;
  12858. { Detect:
  12859. add/sub %reg2,(dest)
  12860. add/sub x, (dest)
  12861. (dest can be a register or a reference)
  12862. Swap the instructions to minimise a pipeline stall. This reverses the
  12863. "Add swap" and "Sub swap" optimisations done in pass 1 if no new
  12864. optimisations could be made.
  12865. }
  12866. if (taicpu(p).oper[0]^.typ = top_reg) and
  12867. not RegInOp(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^) and
  12868. (
  12869. (
  12870. (taicpu(p).oper[1]^.typ = top_reg) and
  12871. { We can try searching further ahead if we're writing to a register }
  12872. GetNextInstructionUsingReg(p, hp1, taicpu(p).oper[1]^.reg)
  12873. ) or
  12874. (
  12875. (taicpu(p).oper[1]^.typ = top_ref) and
  12876. GetNextInstruction(p, hp1)
  12877. )
  12878. ) and
  12879. MatchInstruction(hp1, A_ADD, A_SUB, [taicpu(p).opsize]) and
  12880. (taicpu(hp1).oper[0]^.typ = top_const) and
  12881. MatchOperand(taicpu(p).oper[1]^, taicpu(hp1).oper[1]^) then
  12882. begin
  12883. { Make doubly sure the flags aren't in use because the order of additions may affect them }
  12884. TransferUsedRegs(TmpUsedRegs);
  12885. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  12886. hp2 := p;
  12887. while not (cs_opt_level3 in current_settings.optimizerswitches) and
  12888. GetNextInstruction(hp2, hp2) and (hp2 <> hp1) do
  12889. UpdateUsedRegs(TmpUsedRegs, tai(hp2.next));
  12890. if not RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  12891. begin
  12892. asml.remove(hp1);
  12893. asml.InsertBefore(hp1, p);
  12894. DebugMsg(SPeepholeOptimization + 'Add/Sub swap 2 done', hp1);
  12895. Result := True;
  12896. end;
  12897. end;
  12898. end;
  12899. function TX86AsmOptimizer.PostPeepholeOptCmp(var p : tai) : Boolean;
  12900. begin
  12901. Result:=false;
  12902. { change "cmp $0, %reg" to "test %reg, %reg" }
  12903. if MatchOpType(taicpu(p),top_const,top_reg) and
  12904. (taicpu(p).oper[0]^.val = 0) then
  12905. begin
  12906. taicpu(p).opcode := A_TEST;
  12907. taicpu(p).loadreg(0,taicpu(p).oper[1]^.reg);
  12908. DebugMsg(SPeepholeOptimization + 'Cmp2Test', p);
  12909. Result:=true;
  12910. end;
  12911. end;
  12912. function TX86AsmOptimizer.PostPeepholeOptTestOr(var p : tai) : Boolean;
  12913. var
  12914. IsTestConstX, IsValid : Boolean;
  12915. hp1,hp2 : tai;
  12916. begin
  12917. Result:=false;
  12918. { If x is a power of 2 (popcnt = 1), change:
  12919. or $x, %reg/ref
  12920. To:
  12921. bts lb(x), %reg/ref
  12922. }
  12923. if (taicpu(p).opcode = A_OR) and
  12924. IsBTXAcceptable(p) and
  12925. { IsBTXAcceptable checks to see if oper[0] is an immediate }
  12926. (PopCnt(QWord(taicpu(p).oper[0]^.val)) = 1) and
  12927. (
  12928. { Don't optimise if a test instruction follows }
  12929. not GetNextInstruction(p, hp1) or
  12930. not MatchInstruction(hp1, A_TEST, [taicpu(p).opsize])
  12931. ) then
  12932. begin
  12933. DebugMsg(SPeepholeOptimization + 'Changed OR $0x' + hexstr(taicpu(p).oper[0]^.val, 2) + ' to BTS ' + debug_tostr(BsrQWord(taicpu(p).oper[0]^.val)) + ' to shrink instruction size (Or2Bts)', p);
  12934. taicpu(p).opcode := A_BTS;
  12935. taicpu(p).oper[0]^.val := BsrQWord(taicpu(p).oper[0]^.val); { Essentially the base 2 logarithm }
  12936. Result := True;
  12937. Exit;
  12938. end;
  12939. { If x is a power of 2 (popcnt = 1), change:
  12940. test $x, %reg/ref
  12941. je / sete / cmove (or jne / setne)
  12942. To:
  12943. bt lb(x), %reg/ref
  12944. jnc / setnc / cmovnc (or jc / setc / cmovnc)
  12945. }
  12946. if (taicpu(p).opcode = A_TEST) and
  12947. (CPUX86_HAS_BTX in cpu_capabilities[current_settings.optimizecputype]) and
  12948. (taicpu(p).oper[0]^.typ = top_const) and
  12949. (
  12950. (cs_opt_size in current_settings.optimizerswitches) or
  12951. (
  12952. (taicpu(p).oper[1]^.typ = top_reg) and
  12953. (CPUX86_HINT_FAST_BT_REG_IMM in cpu_optimization_hints[current_settings.optimizecputype])
  12954. ) or
  12955. (
  12956. (taicpu(p).oper[1]^.typ <> top_reg) and
  12957. (CPUX86_HINT_FAST_BT_MEM_IMM in cpu_optimization_hints[current_settings.optimizecputype])
  12958. )
  12959. ) and
  12960. (PopCnt(QWord(taicpu(p).oper[0]^.val)) = 1) and
  12961. { For sizes less than S_L, the byte size is equal or larger with BT,
  12962. so don't bother optimising }
  12963. (taicpu(p).opsize >= S_L) then
  12964. begin
  12965. IsValid := True;
  12966. { Check the next set of instructions, watching the FLAGS register
  12967. and the conditions used }
  12968. TransferUsedRegs(TmpUsedRegs);
  12969. UpdateUsedRegs(TmpUsedRegs, tai(p.Next));
  12970. hp1 := p;
  12971. hp2 := nil;
  12972. while GetNextInstruction(hp1, hp1) do
  12973. begin
  12974. if not Assigned(hp2) then
  12975. { The first instruction after TEST }
  12976. hp2 := hp1;
  12977. if (hp1.typ <> ait_instruction) then
  12978. begin
  12979. { If the flags are no longer in use, everything is fine }
  12980. if RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  12981. IsValid := False;
  12982. Break;
  12983. end;
  12984. case taicpu(hp1).condition of
  12985. C_None:
  12986. begin
  12987. if RegInUsedRegs(NR_DEFAULTFLAGS, TmpUsedRegs) then
  12988. { Something is not quite normal, so play safe and don't change }
  12989. IsValid := False;
  12990. Break;
  12991. end;
  12992. C_E, C_Z, C_NE, C_NZ:
  12993. { This is fine };
  12994. else
  12995. begin
  12996. { Unsupported condition }
  12997. IsValid := False;
  12998. Break;
  12999. end;
  13000. end;
  13001. UpdateUsedRegs(TmpUsedRegs, tai(hp1.Next));
  13002. end;
  13003. if IsValid then
  13004. begin
  13005. while hp2 <> hp1 do
  13006. begin
  13007. case taicpu(hp2).condition of
  13008. C_Z, C_E:
  13009. taicpu(hp2).condition := C_NC;
  13010. C_NZ, C_NE:
  13011. taicpu(hp2).condition := C_C;
  13012. else
  13013. { Should not get this by this point }
  13014. InternalError(2022110701);
  13015. end;
  13016. GetNextInstruction(hp2, hp2);
  13017. end;
  13018. DebugMsg(SPeepholeOptimization + 'Changed TEST $0x' + hexstr(taicpu(p).oper[0]^.val, 2) + ' to BT ' + debug_tostr(BsrQWord(taicpu(p).oper[0]^.val)) + ' to shrink instruction size (Test2Bt)', p);
  13019. taicpu(p).opcode := A_BT;
  13020. taicpu(p).oper[0]^.val := BsrQWord(taicpu(p).oper[0]^.val); { Essentially the base 2 logarithm }
  13021. Result := True;
  13022. Exit;
  13023. end;
  13024. end;
  13025. { removes the line marked with (x) from the sequence
  13026. and/or/xor/add/sub/... $x, %y
  13027. test/or %y, %y | test $-1, %y (x)
  13028. j(n)z _Label
  13029. as the first instruction already adjusts the ZF
  13030. %y operand may also be a reference }
  13031. IsTestConstX:=(taicpu(p).opcode=A_TEST) and
  13032. MatchOperand(taicpu(p).oper[0]^,-1);
  13033. if (OpsEqual(taicpu(p).oper[0]^,taicpu(p).oper[1]^) or IsTestConstX) and
  13034. GetLastInstruction(p, hp1) and
  13035. (tai(hp1).typ = ait_instruction) and
  13036. GetNextInstruction(p,hp2) and
  13037. MatchInstruction(hp2,A_SETcc,A_Jcc,A_CMOVcc,[]) then
  13038. case taicpu(hp1).opcode Of
  13039. A_ADD, A_SUB, A_OR, A_XOR, A_AND,
  13040. { These two instructions set the zero flag if the result is zero }
  13041. A_POPCNT, A_LZCNT:
  13042. begin
  13043. if (
  13044. { With POPCNT, an input of zero will set the zero flag
  13045. because the population count of zero is zero }
  13046. (taicpu(hp1).opcode = A_POPCNT) and
  13047. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) and
  13048. (
  13049. OpsEqual(taicpu(hp1).oper[0]^, taicpu(p).oper[1]^) or
  13050. { Faster than going through the second half of the 'or'
  13051. condition below }
  13052. OpsEqual(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^)
  13053. )
  13054. ) or (
  13055. OpsEqual(taicpu(hp1).oper[1]^, taicpu(p).oper[1]^) and
  13056. { does not work in case of overflow for G(E)/L(E)/C_O/C_NO }
  13057. { and in case of carry for A(E)/B(E)/C/NC }
  13058. (
  13059. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) or
  13060. (
  13061. (taicpu(hp1).opcode <> A_ADD) and
  13062. (taicpu(hp1).opcode <> A_SUB) and
  13063. (taicpu(hp1).opcode <> A_LZCNT)
  13064. )
  13065. )
  13066. ) then
  13067. begin
  13068. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (2-op) done', hp1);
  13069. RemoveCurrentP(p, hp2);
  13070. Result:=true;
  13071. Exit;
  13072. end;
  13073. end;
  13074. A_SHL, A_SAL, A_SHR, A_SAR:
  13075. begin
  13076. if OpsEqual(taicpu(hp1).oper[1]^,taicpu(p).oper[1]^) and
  13077. { SHL/SAL/SHR/SAR with a value of 0 do not change the flags }
  13078. { therefore, it's only safe to do this optimization for }
  13079. { shifts by a (nonzero) constant }
  13080. (taicpu(hp1).oper[0]^.typ = top_const) and
  13081. (taicpu(hp1).oper[0]^.val <> 0) and
  13082. { does not work in case of overflow for G(E)/L(E)/C_O/C_NO }
  13083. { and in case of carry for A(E)/B(E)/C/NC }
  13084. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) then
  13085. begin
  13086. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (shift) done', hp1);
  13087. RemoveCurrentP(p, hp2);
  13088. Result:=true;
  13089. Exit;
  13090. end;
  13091. end;
  13092. A_DEC, A_INC, A_NEG:
  13093. begin
  13094. if OpsEqual(taicpu(hp1).oper[0]^,taicpu(p).oper[1]^) and
  13095. { does not work in case of overflow for G(E)/L(E)/C_O/C_NO }
  13096. { and in case of carry for A(E)/B(E)/C/NC }
  13097. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) then
  13098. begin
  13099. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (1-op) done', hp1);
  13100. RemoveCurrentP(p, hp2);
  13101. Result:=true;
  13102. Exit;
  13103. end;
  13104. end;
  13105. A_ANDN, A_BZHI:
  13106. begin
  13107. if OpsEqual(taicpu(hp1).oper[2]^,taicpu(p).oper[1]^) and
  13108. { Only the zero and sign flags are consistent with what the result is }
  13109. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE,C_S,C_NS]) then
  13110. begin
  13111. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (ANDN/BZHI) done', hp1);
  13112. RemoveCurrentP(p, hp2);
  13113. Result:=true;
  13114. Exit;
  13115. end;
  13116. end;
  13117. A_BEXTR:
  13118. begin
  13119. if OpsEqual(taicpu(hp1).oper[2]^,taicpu(p).oper[1]^) and
  13120. { Only the zero flag is set }
  13121. (taicpu(hp2).condition in [C_Z,C_NZ,C_E,C_NE]) then
  13122. begin
  13123. DebugMsg(SPeepholeOptimization + 'OpTest/Or2Op (BEXTR) done', hp1);
  13124. RemoveCurrentP(p, hp2);
  13125. Result:=true;
  13126. Exit;
  13127. end;
  13128. end;
  13129. else
  13130. ;
  13131. end; { case }
  13132. { change "test $-1,%reg" into "test %reg,%reg" }
  13133. if IsTestConstX and (taicpu(p).oper[1]^.typ=top_reg) then
  13134. taicpu(p).loadoper(0,taicpu(p).oper[1]^);
  13135. { Change "or %reg,%reg" to "test %reg,%reg" as OR generates a false dependency }
  13136. if MatchInstruction(p, A_OR, []) and
  13137. { Can only match if they're both registers }
  13138. MatchOperand(taicpu(p).oper[0]^, taicpu(p).oper[1]^) then
  13139. begin
  13140. DebugMsg(SPeepholeOptimization + 'or %reg,%reg -> test %reg,%reg to remove false dependency (Or2Test)', p);
  13141. taicpu(p).opcode := A_TEST;
  13142. { No need to set Result to True, as we've done all the optimisations we can }
  13143. end;
  13144. end;
  13145. function TX86AsmOptimizer.PostPeepholeOptCall(var p : tai) : Boolean;
  13146. var
  13147. hp1,hp3 : tai;
  13148. {$ifndef x86_64}
  13149. hp2 : taicpu;
  13150. {$endif x86_64}
  13151. begin
  13152. Result:=false;
  13153. hp3:=nil;
  13154. {$ifndef x86_64}
  13155. { don't do this on modern CPUs, this really hurts them due to
  13156. broken call/ret pairing }
  13157. if (current_settings.optimizecputype < cpu_Pentium2) and
  13158. not(cs_create_pic in current_settings.moduleswitches) and
  13159. GetNextInstruction(p, hp1) and
  13160. MatchInstruction(hp1,A_JMP,[S_NO]) and
  13161. MatchOpType(taicpu(hp1),top_ref) and
  13162. (taicpu(hp1).oper[0]^.ref^.refaddr=addr_full) then
  13163. begin
  13164. hp2 := taicpu.Op_sym(A_PUSH,S_L,taicpu(hp1).oper[0]^.ref^.symbol);
  13165. taicpu(hp2).fileinfo := taicpu(p).fileinfo;
  13166. InsertLLItem(p.previous, p, hp2);
  13167. taicpu(p).opcode := A_JMP;
  13168. taicpu(p).is_jmp := true;
  13169. RemoveInstruction(hp1);
  13170. Result:=true;
  13171. end
  13172. else
  13173. {$endif x86_64}
  13174. { replace
  13175. call procname
  13176. ret
  13177. by
  13178. jmp procname
  13179. but do it only on level 4 because it destroys stack back traces
  13180. else if the subroutine is marked as no return, remove the ret
  13181. }
  13182. if ((cs_opt_level4 in current_settings.optimizerswitches) or
  13183. (po_noreturn in current_procinfo.procdef.procoptions)) and
  13184. GetNextInstruction(p, hp1) and
  13185. (MatchInstruction(hp1,A_RET,[S_NO]) or
  13186. (MatchInstruction(hp1,A_VZEROUPPER,[S_NO]) and
  13187. SetAndTest(hp1,hp3) and
  13188. GetNextInstruction(hp1,hp1) and
  13189. MatchInstruction(hp1,A_RET,[S_NO])
  13190. )
  13191. ) and
  13192. (taicpu(hp1).ops=0) then
  13193. begin
  13194. if (cs_opt_level4 in current_settings.optimizerswitches) and
  13195. { we might destroy stack alignment here if we do not do a call }
  13196. (target_info.stackalign<=sizeof(SizeUInt)) then
  13197. begin
  13198. taicpu(p).opcode := A_JMP;
  13199. taicpu(p).is_jmp := true;
  13200. DebugMsg(SPeepholeOptimization + 'CallRet2Jmp done',p);
  13201. end
  13202. else
  13203. DebugMsg(SPeepholeOptimization + 'CallRet2Call done',p);
  13204. RemoveInstruction(hp1);
  13205. if Assigned(hp3) then
  13206. begin
  13207. AsmL.Remove(hp3);
  13208. AsmL.InsertBefore(hp3,p)
  13209. end;
  13210. Result:=true;
  13211. end;
  13212. end;
  13213. function TX86AsmOptimizer.PostPeepholeOptMovzx(var p : tai) : Boolean;
  13214. function ConstInRange(const Val: TCGInt; const OpSize: TOpSize): Boolean;
  13215. begin
  13216. case OpSize of
  13217. S_B, S_BW, S_BL{$ifdef x86_64}, S_BQ{$endif x86_64}:
  13218. Result := (Val <= $FF) and (Val >= -128);
  13219. S_W, S_WL{$ifdef x86_64}, S_WQ{$endif x86_64}:
  13220. Result := (Val <= $FFFF) and (Val >= -32768);
  13221. S_L{$ifdef x86_64}, S_LQ{$endif x86_64}:
  13222. Result := (Val <= $FFFFFFFF) and (Val >= -2147483648);
  13223. else
  13224. Result := True;
  13225. end;
  13226. end;
  13227. var
  13228. hp1, hp2 : tai;
  13229. SizeChange: Boolean;
  13230. PreMessage: string;
  13231. begin
  13232. Result := False;
  13233. if (taicpu(p).oper[0]^.typ = top_reg) and
  13234. SuperRegistersEqual(taicpu(p).oper[0]^.reg, taicpu(p).oper[1]^.reg) and
  13235. GetNextInstruction(p, hp1) and (hp1.typ = ait_instruction) then
  13236. begin
  13237. { Change (using movzbl %al,%eax as an example):
  13238. movzbl %al, %eax movzbl %al, %eax
  13239. cmpl x, %eax testl %eax,%eax
  13240. To:
  13241. cmpb x, %al testb %al, %al (Move one back to avoid a false dependency)
  13242. movzbl %al, %eax movzbl %al, %eax
  13243. Smaller instruction and minimises pipeline stall as the CPU
  13244. doesn't have to wait for the register to get zero-extended. [Kit]
  13245. Also allow if the smaller of the two registers is being checked,
  13246. as this still removes the false dependency.
  13247. }
  13248. if
  13249. (
  13250. (
  13251. (taicpu(hp1).opcode = A_CMP) and MatchOpType(taicpu(hp1), top_const, top_reg) and
  13252. ConstInRange(taicpu(hp1).oper[0]^.val, taicpu(p).opsize)
  13253. ) or (
  13254. { If MatchOperand returns True, they must both be registers }
  13255. (taicpu(hp1).opcode = A_TEST) and MatchOperand(taicpu(hp1).oper[0]^, taicpu(hp1).oper[1]^)
  13256. )
  13257. ) and
  13258. (reg2opsize(taicpu(hp1).oper[1]^.reg) <= reg2opsize(taicpu(p).oper[1]^.reg)) and
  13259. SuperRegistersEqual(taicpu(p).oper[1]^.reg, taicpu(hp1).oper[1]^.reg) then
  13260. begin
  13261. 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);
  13262. asml.Remove(hp1);
  13263. asml.InsertBefore(hp1, p);
  13264. { Swap instructions in the case of cmp 0,%reg or test %reg,%reg }
  13265. if (taicpu(hp1).opcode = A_TEST) or (taicpu(hp1).oper[0]^.val = 0) then
  13266. begin
  13267. taicpu(hp1).opcode := A_TEST;
  13268. taicpu(hp1).loadreg(0, taicpu(p).oper[0]^.reg);
  13269. end;
  13270. taicpu(hp1).oper[1]^.reg := taicpu(p).oper[0]^.reg;
  13271. case taicpu(p).opsize of
  13272. S_BW, S_BL:
  13273. begin
  13274. SizeChange := taicpu(hp1).opsize <> S_B;
  13275. taicpu(hp1).changeopsize(S_B);
  13276. end;
  13277. S_WL:
  13278. begin
  13279. SizeChange := taicpu(hp1).opsize <> S_W;
  13280. taicpu(hp1).changeopsize(S_W);
  13281. end
  13282. else
  13283. InternalError(2020112701);
  13284. end;
  13285. UpdateUsedRegs(tai(p.Next));
  13286. { Check if the register is used aferwards - if not, we can
  13287. remove the movzx instruction completely }
  13288. if not RegUsedAfterInstruction(taicpu(hp1).oper[1]^.reg, p, UsedRegs) then
  13289. begin
  13290. { Hp1 is a better position than p for debugging purposes }
  13291. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 4a', hp1);
  13292. RemoveCurrentp(p, hp1);
  13293. Result := True;
  13294. end;
  13295. if SizeChange then
  13296. DebugMsg(SPeepholeOptimization + PreMessage +
  13297. 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)
  13298. else
  13299. DebugMsg(SPeepholeOptimization + 'MovzxCmp2CmpMovzx', hp1);
  13300. Exit;
  13301. end;
  13302. { Change (using movzwl %ax,%eax as an example):
  13303. movzwl %ax, %eax
  13304. movb %al, (dest) (Register is smaller than read register in movz)
  13305. To:
  13306. movb %al, (dest) (Move one back to avoid a false dependency)
  13307. movzwl %ax, %eax
  13308. }
  13309. if (taicpu(hp1).opcode = A_MOV) and
  13310. (taicpu(hp1).oper[0]^.typ = top_reg) and
  13311. not RegInOp(taicpu(hp1).oper[0]^.reg, taicpu(hp1).oper[1]^) and
  13312. SuperRegistersEqual(taicpu(hp1).oper[0]^.reg, taicpu(p).oper[0]^.reg) and
  13313. (reg2opsize(taicpu(hp1).oper[0]^.reg) <= reg2opsize(taicpu(p).oper[0]^.reg)) then
  13314. begin
  13315. DebugMsg(SPeepholeOptimization + 'MovzxMov2MovMovzx', hp1);
  13316. hp2 := tai(hp1.Previous); { Effectively the old position of hp1 }
  13317. asml.Remove(hp1);
  13318. asml.InsertBefore(hp1, p);
  13319. if taicpu(hp1).oper[1]^.typ = top_reg then
  13320. AllocRegBetween(taicpu(hp1).oper[1]^.reg, hp1, hp2, UsedRegs);
  13321. { Check if the register is used aferwards - if not, we can
  13322. remove the movzx instruction completely }
  13323. if not RegUsedAfterInstruction(taicpu(hp1).oper[0]^.reg, p, UsedRegs) then
  13324. begin
  13325. { Hp1 is a better position than p for debugging purposes }
  13326. DebugMsg(SPeepholeOptimization + 'Movzx2Nop 4b', hp1);
  13327. RemoveCurrentp(p, hp1);
  13328. Result := True;
  13329. end;
  13330. Exit;
  13331. end;
  13332. end;
  13333. end;
  13334. function TX86AsmOptimizer.PostPeepholeOptXor(var p : tai) : Boolean;
  13335. var
  13336. hp1: tai;
  13337. {$ifdef x86_64}
  13338. PreMessage, RegName: string;
  13339. {$endif x86_64}
  13340. begin
  13341. Result := False;
  13342. { If x is a power of 2 (popcnt = 1), change:
  13343. xor $x, %reg/ref
  13344. To:
  13345. btc lb(x), %reg/ref
  13346. }
  13347. if IsBTXAcceptable(p) and
  13348. { IsBTXAcceptable checks to see if oper[0] is an immediate }
  13349. (PopCnt(QWord(taicpu(p).oper[0]^.val)) = 1) and
  13350. (
  13351. { Don't optimise if a test instruction follows }
  13352. not GetNextInstruction(p, hp1) or
  13353. not MatchInstruction(hp1, A_TEST, [taicpu(p).opsize])
  13354. ) then
  13355. begin
  13356. DebugMsg(SPeepholeOptimization + 'Changed XOR $0x' + hexstr(taicpu(p).oper[0]^.val, 2) + ' to BTC ' + debug_tostr(BsrQWord(taicpu(p).oper[0]^.val)) + ' to shrink instruction size (Xor2Btc)', p);
  13357. taicpu(p).opcode := A_BTC;
  13358. taicpu(p).oper[0]^.val := BsrQWord(taicpu(p).oper[0]^.val); { Essentially the base 2 logarithm }
  13359. Result := True;
  13360. Exit;
  13361. end;
  13362. {$ifdef x86_64}
  13363. { Code size reduction by J. Gareth "Kit" Moreton }
  13364. { change "xorq %reg,%reg" to "xorl %reg,%reg" for %rax, %rcx, %rdx, %rbx, %rsi, %rdi, %rbp and %rsp,
  13365. as this removes the REX prefix }
  13366. if not OpsEqual(taicpu(p).oper[0]^,taicpu(p).oper[1]^) then
  13367. Exit;
  13368. if taicpu(p).oper[0]^.typ <> top_reg then
  13369. { Should be impossible if both operands were equal, since one of XOR's operands must be a register }
  13370. InternalError(2018011500);
  13371. case taicpu(p).opsize of
  13372. S_Q:
  13373. begin
  13374. RegName := debug_regname(taicpu(p).oper[0]^.reg); { 64-bit register name }
  13375. PreMessage := 'xorq ' + RegName + ',' + RegName + ' -> xorl ';
  13376. { The actual optimization }
  13377. setsubreg(taicpu(p).oper[0]^.reg, R_SUBD);
  13378. setsubreg(taicpu(p).oper[1]^.reg, R_SUBD);
  13379. taicpu(p).changeopsize(S_L);
  13380. RegName := debug_regname(taicpu(p).oper[0]^.reg); { 32-bit register name }
  13381. DebugMsg(SPeepholeOptimization + PreMessage + RegName + ',' + RegName + ' (32-bit register recommended when zeroing 64-bit counterpart)', p);
  13382. end;
  13383. else
  13384. ;
  13385. end;
  13386. {$endif x86_64}
  13387. end;
  13388. function TX86AsmOptimizer.PostPeepholeOptVPXOR(var p : tai) : Boolean;
  13389. var
  13390. XReg: TRegister;
  13391. begin
  13392. Result := False;
  13393. { Turn "vpxor %ymmreg2,%ymmreg2,%ymmreg1" to "vpxor %xmmreg2,%xmmreg2,%xmmreg1"
  13394. Smaller encoding and slightly faster on some platforms (also works for
  13395. ZMM-sized registers) }
  13396. if (taicpu(p).opsize in [S_YMM, S_ZMM]) and
  13397. MatchOpType(taicpu(p), top_reg, top_reg, top_reg) then
  13398. begin
  13399. XReg := taicpu(p).oper[0]^.reg;
  13400. if (taicpu(p).oper[1]^.reg = XReg) then
  13401. begin
  13402. taicpu(p).changeopsize(S_XMM);
  13403. setsubreg(taicpu(p).oper[2]^.reg, R_SUBMMX);
  13404. if (cs_opt_size in current_settings.optimizerswitches) then
  13405. begin
  13406. { Change input registers to %xmm0 to reduce size. Note that
  13407. there's a risk of a false dependency doing this, so only
  13408. optimise for size here }
  13409. XReg := NR_XMM0;
  13410. DebugMsg(SPeepholeOptimization + 'Changed zero-setting vpxor from Y/ZMM to XMM and changed input registers to %xmm0 to reduce size', p);
  13411. end
  13412. else
  13413. begin
  13414. setsubreg(XReg, R_SUBMMX);
  13415. DebugMsg(SPeepholeOptimization + 'Changed zero-setting vpxor from Y/ZMM to XMM to reduce size and increase efficiency', p);
  13416. end;
  13417. taicpu(p).oper[0]^.reg := XReg;
  13418. taicpu(p).oper[1]^.reg := XReg;
  13419. Result := True;
  13420. end;
  13421. end;
  13422. end;
  13423. class procedure TX86AsmOptimizer.OptimizeRefs(var p: taicpu);
  13424. var
  13425. OperIdx: Integer;
  13426. begin
  13427. for OperIdx := 0 to p.ops - 1 do
  13428. if p.oper[OperIdx]^.typ = top_ref then
  13429. optimize_ref(p.oper[OperIdx]^.ref^, False);
  13430. end;
  13431. end.