aoptx86.pas 615 KB

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