test-backend-ops.cpp 337 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724
  1. // This file defines tests for various GGML ops and backends.
  2. // For the forward pass it asserts that the results of multiple backends computing the same GGML ops are consistent.
  3. // For the backward pass it asserts that the gradients from backpropagation are consistent
  4. // with the gradients obtained via the method of finite differences ("grad" mode, this is optional).
  5. // It is also possible to check the performance ("perf" mode).
  6. //
  7. // this file has three sections: Section 1 does general setup, section 2 defines the GGML ops to be tested,
  8. // and section 3 defines which tests to run.
  9. // Quick start for adding a new GGML op: Go to section 2 and create a struct that inherits from test_case,
  10. // then go to section 3 and add an instantiation of your struct.
  11. // ##############################
  12. // ## Section 1: General Setup ##
  13. // ##############################
  14. #include <ggml.h>
  15. #include <ggml-alloc.h>
  16. #include <ggml-backend.h>
  17. #include <ggml-cpp.h>
  18. #include <algorithm>
  19. #include <array>
  20. #include <cfloat>
  21. #include <cinttypes>
  22. #include <cstdarg>
  23. #include <cstdint>
  24. #include <cstdio>
  25. #include <cstdlib>
  26. #include <cstring>
  27. #include <ctime>
  28. #include <future>
  29. #include <memory>
  30. #include <random>
  31. #include <regex>
  32. #include <set>
  33. #include <string>
  34. #include <string_view>
  35. #include <thread>
  36. #include <vector>
  37. #include <unordered_map>
  38. #ifdef __EMSCRIPTEN__
  39. # define N_THREADS 1
  40. #else
  41. # define N_THREADS std::thread::hardware_concurrency()
  42. #endif
  43. static void init_tensor_uniform(ggml_tensor * tensor, float min = -1.0f, float max = 1.0f) {
  44. size_t nels = ggml_nelements(tensor);
  45. std::vector<float> data(nels);
  46. {
  47. // parallel initialization
  48. static const size_t n_threads = N_THREADS;
  49. // static RNG initialization (revisit if n_threads stops being constant)
  50. static std::vector<std::default_random_engine> generators = []() {
  51. std::random_device rd;
  52. std::vector<std::default_random_engine> vec;
  53. vec.reserve(n_threads);
  54. //for (size_t i = 0; i < n_threads; i++) { vec.emplace_back(1234 + i); } // fixed seed
  55. for (size_t i = 0; i < n_threads; i++) { vec.emplace_back(rd()); }
  56. return vec;
  57. }();
  58. auto init_thread = [&](size_t ith, size_t start, size_t end) {
  59. std::uniform_real_distribution<float> distribution(min, max);
  60. auto & gen = generators[ith];
  61. for (size_t i = start; i < end; i++) {
  62. data[i] = distribution(gen);
  63. }
  64. };
  65. if (n_threads == 1) {
  66. init_thread(0, 0, nels);
  67. } else {
  68. std::vector<std::future<void>> tasks;
  69. tasks.reserve(n_threads);
  70. for (size_t i = 0; i < n_threads; i++) {
  71. size_t start = i*nels/n_threads;
  72. size_t end = (i+1)*nels/n_threads;
  73. tasks.push_back(std::async(std::launch::async, init_thread, i, start, end));
  74. }
  75. for (auto & t : tasks) {
  76. t.get();
  77. }
  78. }
  79. }
  80. if (tensor->type == GGML_TYPE_F32 || tensor->type == GGML_TYPE_I32) {
  81. ggml_backend_tensor_set(tensor, data.data(), 0, nels * sizeof(float));
  82. } else if (ggml_is_quantized(tensor->type) || tensor->type == GGML_TYPE_F16 || tensor->type == GGML_TYPE_BF16) {
  83. GGML_ASSERT(nels % ggml_blck_size(tensor->type) == 0);
  84. // dummy importance matrix
  85. std::vector<float> imatrix(tensor->ne[0], 1.0f);
  86. const float * im = imatrix.data();
  87. if (!ggml_quantize_requires_imatrix(tensor->type)) {
  88. // when the imatrix is optional, we want to test both quantization with and without imatrix
  89. // use one of the random numbers to decide
  90. if (data[0] > 0.5f*(min + max)) {
  91. im = nullptr;
  92. }
  93. }
  94. std::vector<uint8_t> dataq(ggml_row_size(tensor->type, nels));
  95. {
  96. // parallel quantization by block
  97. size_t blck_size = ggml_blck_size(tensor->type);
  98. size_t n_blocks = nels / blck_size;
  99. auto quantize_thread = [&](size_t start, size_t end) {
  100. ggml_quantize_chunk(tensor->type, data.data(), dataq.data(),
  101. start * blck_size, end - start, blck_size, im);
  102. };
  103. const size_t min_blocks_per_thread = 1;
  104. const size_t n_quant_threads = std::min<size_t>(std::max<size_t>(N_THREADS/2, 1),
  105. std::max<size_t>(1, n_blocks / min_blocks_per_thread));
  106. if (n_quant_threads == 1) {
  107. // single-threaded quantization: do all blocks in the current thread
  108. quantize_thread(0, n_blocks);
  109. } else {
  110. std::vector<std::future<void>> tasks;
  111. tasks.reserve(n_quant_threads);
  112. for (size_t i = 0; i < n_quant_threads; i++) {
  113. size_t start = i*n_blocks/n_quant_threads;
  114. size_t end = (i+1)*n_blocks/n_quant_threads;
  115. tasks.push_back(std::async(std::launch::async, quantize_thread, start, end));
  116. }
  117. for (auto & t : tasks) {
  118. t.get();
  119. }
  120. }
  121. }
  122. ggml_backend_tensor_set(tensor, dataq.data(), 0, dataq.size());
  123. } else if (tensor->type == GGML_TYPE_I8 || tensor->type == GGML_TYPE_I16 || tensor->type == GGML_TYPE_I32) {
  124. // This is going to create some weird integers though.
  125. ggml_backend_tensor_set(tensor, data.data(), 0, ggml_nbytes(tensor));
  126. } else if (tensor->type == GGML_TYPE_I64) {
  127. // Integers with a size of 8 bytes can be set by mirroring the float data, the specific values are again not really meaningful.
  128. const size_t nbytes_half = ggml_nbytes(tensor)/2;
  129. ggml_backend_tensor_set(tensor, data.data(), 0*nbytes_half, nbytes_half);
  130. ggml_backend_tensor_set(tensor, data.data(), 1*nbytes_half, nbytes_half);
  131. } else {
  132. GGML_ABORT("fatal error");
  133. }
  134. }
  135. // generate an F16 mask where certain blocks are randomly masked with -INF value
  136. static void init_tensor_kq_mask(ggml_tensor * tensor, float min = -1.0f, float max = 1.0f) {
  137. GGML_ASSERT(tensor->type == GGML_TYPE_F16);
  138. GGML_TENSOR_LOCALS( int32_t, ne, tensor, ne);
  139. std::vector<float> data_f32(ne0*ne1*ne2*ne3);
  140. std::vector<ggml_fp16_t> data_f16(ne0*ne1*ne2*ne3);
  141. std::random_device rd;
  142. std::mt19937 gen(rd());
  143. std::uniform_real_distribution<float> dis(min, max);
  144. for (size_t i = 0; i < data_f32.size(); i++) {
  145. data_f32[i] = dis(gen);
  146. }
  147. // block size
  148. const int blck0 = 128;
  149. const int blck1 = 64;
  150. // number of INF blocks
  151. const int n_inf_blocks = 0.1*(ne0*ne1*ne2*ne3)/(blck0*blck1);
  152. for (int b = 0; b < n_inf_blocks; b++) {
  153. const int p3 = (rd() % ne3);
  154. const int p2 = (rd() % ne2);
  155. const int p1 = (rd() % ne1);
  156. const int p0 = (rd() % ne0);
  157. for (int i1 = 0; i1 < blck1 && p1 + i1 < ne1; i1++) {
  158. const int idx = p3*ne2*ne1*ne0 + p2*ne1*ne0 + (p1 + i1)*ne0 + p0;
  159. for (int i0 = 0; i0 < blck0 && p0 + i0 < ne0; i0++) {
  160. data_f32[idx + i0] = -INFINITY;
  161. }
  162. }
  163. }
  164. ggml_fp32_to_fp16_row(data_f32.data(), data_f16.data(), ne0*ne1*ne2*ne3);
  165. ggml_backend_tensor_set(tensor, data_f16.data(), 0, data_f16.size()*sizeof(ggml_fp16_t));
  166. }
  167. // generate a lower triangular matrix
  168. static void init_tensor_tril(ggml_tensor * tensor, float min = -1.0f, float max = 1.0f) {
  169. GGML_ASSERT(tensor->type == GGML_TYPE_F32);
  170. GGML_ASSERT(tensor->ne[0] == tensor->ne[1]);
  171. GGML_TENSOR_LOCALS(int32_t, ne, tensor, ne);
  172. GGML_TENSOR_LOCALS(size_t, nb, tensor, nb);
  173. std::vector<float> data_f32(ne0*ne1*ne2*ne3);
  174. std::random_device rd;
  175. std::mt19937 gen(rd());
  176. std::uniform_real_distribution<float> dis(min, max);
  177. for (int64_t i3 = 0; i3 < ne3; i3++) {
  178. for (int64_t i2 = 0; i2 < ne2; i2++) {
  179. for (int64_t i1 = 0; i1 < ne1; i1++) {
  180. for (int64_t i0 = 0; i0 < ne0; i0++) {
  181. int64_t idx = (i0 * nb0 + i1 * nb1 + i2 * nb2 + i3 * nb3) / sizeof(float);
  182. if (i0 <= i1) {
  183. data_f32[idx] = dis(gen);
  184. } else {
  185. data_f32[idx] = 0.0f;
  186. }
  187. }
  188. }
  189. }
  190. }
  191. ggml_backend_tensor_set(tensor, data_f32.data(), 0, ggml_nbytes(tensor));
  192. }
  193. static std::vector<float> tensor_to_float(const ggml_tensor * t) {
  194. std::vector<float> tv;
  195. tv.reserve(ggml_nelements(t));
  196. std::vector<uint8_t> buf(ggml_nbytes(t));
  197. ggml_backend_tensor_get(t, buf.data(), 0, ggml_nbytes(t));
  198. const auto * tt = ggml_get_type_traits(t->type);
  199. size_t bs = ggml_blck_size(t->type);
  200. std::vector<float> vq(ggml_blck_size(t->type));
  201. bool quantized = ggml_is_quantized(t->type);
  202. // access elements by index to avoid gaps in views
  203. for (int64_t i3 = 0; i3 < t->ne[3]; i3++) {
  204. for (int64_t i2 = 0; i2 < t->ne[2]; i2++) {
  205. for (int64_t i1 = 0; i1 < t->ne[1]; i1++) {
  206. for (int64_t i0 = 0; i0 < t->ne[0]; i0 += bs) {
  207. size_t i = i3*t->nb[3] + i2*t->nb[2] + i1*t->nb[1] + i0/bs*t->nb[0];
  208. if (t->type == GGML_TYPE_F16) {
  209. tv.push_back(ggml_fp16_to_fp32(*(ggml_fp16_t*)&buf[i]));
  210. } else if (t->type == GGML_TYPE_BF16) {
  211. tv.push_back(ggml_bf16_to_fp32(*(ggml_bf16_t*)&buf[i]));
  212. } else if (t->type == GGML_TYPE_F32) {
  213. tv.push_back(*(float *) &buf[i]);
  214. } else if (t->type == GGML_TYPE_I64) {
  215. tv.push_back((float)*(int64_t *) &buf[i]);
  216. } else if (t->type == GGML_TYPE_I32) {
  217. tv.push_back((float)*(int32_t *) &buf[i]);
  218. } else if (t->type == GGML_TYPE_I16) {
  219. tv.push_back((float)*(int16_t *) &buf[i]);
  220. } else if (t->type == GGML_TYPE_I8) {
  221. tv.push_back((float)*(int8_t *) &buf[i]);
  222. } else if (quantized) {
  223. tt->to_float(&buf[i], vq.data(), bs);
  224. tv.insert(tv.end(), vq.begin(), vq.end());
  225. } else {
  226. GGML_ABORT("fatal error");
  227. }
  228. }
  229. }
  230. }
  231. }
  232. return tv;
  233. }
  234. // normalized mean squared error = mse(a, b) / mse(a, 0)
  235. static double nmse(const float * a, const float * b, size_t n) {
  236. double mse_a_b = 0.0;
  237. double mse_a_0 = 0.0;
  238. for (size_t i = 0; i < n; i++) {
  239. float a_i = a[i];
  240. float b_i = b[i];
  241. mse_a_b += (a_i - b_i) * (a_i - b_i);
  242. mse_a_0 += a_i * a_i;
  243. }
  244. return mse_a_b / mse_a_0;
  245. }
  246. // difference between 2 sets (Jaccard distance, 0 - no difference, 1 - no overlap)
  247. template <typename T>
  248. static double jdst(const T * a, const T * b, size_t n) {
  249. std::unordered_map<T, size_t> set_a;
  250. std::unordered_map<T, size_t> set_b;
  251. for (size_t i = 0; i < n; ++i) {
  252. set_a[a[i]]++;
  253. set_b[b[i]]++;
  254. }
  255. size_t diff = 0;
  256. for (const auto & p : set_a) {
  257. const int64_t na = p.second;
  258. const int64_t nb = set_b.find(p.first) != set_b.end() ? set_b.at(p.first) : 0;
  259. diff += std::abs(na - nb);
  260. }
  261. for (const auto & p : set_b) {
  262. if (set_a.find(p.first) == set_a.end()) {
  263. diff += p.second;
  264. }
  265. }
  266. return (double) diff / (2*n);
  267. }
  268. // maximum absolute asymmetry between a and b
  269. // asymmetry: (a - b) / (a + b)
  270. // This is more stable than relative error if one of the values fluctuates towards zero.
  271. // n: number of values to compare.
  272. // expected_vals: optional vector of expected values for a. If expected_vals is not empty, filter out all comparisons where
  273. // a does not match any of the expected values. Needed for noncontinuous gradients where the numerical calculation can fail.
  274. static double mean_abs_asymm(const float * a, const float * b, const size_t n, const std::vector<float> & expected_vals) {
  275. double sum = 0.0f;
  276. size_t nvalid = 0;
  277. for (size_t i = 0; i < n; i++) {
  278. if (!expected_vals.empty()) {
  279. bool matches_any = false;
  280. for (const float & ev : expected_vals) {
  281. if (fabsf(a[i] - ev) < 1e-3f) {
  282. matches_any = true;
  283. break;
  284. }
  285. }
  286. if (!matches_any) {
  287. continue;
  288. }
  289. }
  290. const float asymm = (a[i] - b[i]) / (a[i] + b[i]);
  291. sum += fabsf(asymm);
  292. nvalid++;
  293. }
  294. return sum/nvalid;
  295. }
  296. // utils for printing the variables of the test cases
  297. static std::string var_to_str(const std::string & x) {
  298. return x;
  299. }
  300. template<typename T>
  301. static std::string var_to_str(const T & x) {
  302. return std::to_string(x);
  303. }
  304. template<typename T, size_t N>
  305. static std::string var_to_str(const T (&x)[N]) {
  306. std::string s = "[";
  307. for (size_t i = 0; i < N; i++) {
  308. if (i > 0) {
  309. s += ",";
  310. }
  311. s += var_to_str(x[i]);
  312. }
  313. s += "]";
  314. return s;
  315. }
  316. template<typename T, size_t N>
  317. static std::string var_to_str(const std::array<T, N> & x) {
  318. std::string s = "[";
  319. for (size_t i = 0; i < N; i++) {
  320. if (i > 0) {
  321. s += ",";
  322. }
  323. s += var_to_str(x[i]);
  324. }
  325. s += "]";
  326. return s;
  327. }
  328. static std::string var_to_str(ggml_type type) {
  329. return ggml_type_name(type);
  330. }
  331. static std::string var_to_str(ggml_prec prec) {
  332. return prec == GGML_PREC_F32 ? "f32" : "def";
  333. }
  334. static std::string var_to_str(ggml_op_pool pool) {
  335. switch (pool) {
  336. case GGML_OP_POOL_AVG: return "avg";
  337. case GGML_OP_POOL_MAX: return "max";
  338. default: return std::to_string(pool);
  339. }
  340. }
  341. static std::string var_to_str(ggml_scale_mode mode) {
  342. std::string str;
  343. switch (mode & 0xFF) {
  344. case GGML_SCALE_MODE_NEAREST: str = "nearest"; break;
  345. case GGML_SCALE_MODE_BILINEAR: str = "bilinear"; break;
  346. case GGML_SCALE_MODE_BICUBIC: str = "bicubic"; break;
  347. default: str = std::to_string(mode); break;
  348. }
  349. if (mode & GGML_SCALE_FLAG_ALIGN_CORNERS) {
  350. str += "|align_corners";
  351. }
  352. if (mode & GGML_SCALE_FLAG_ANTIALIAS) {
  353. str += "|antialias";
  354. }
  355. return str;
  356. }
  357. #define VAR_TO_STR(x) (#x "=" + var_to_str(x))
  358. #define VARS_TO_STR1(a) VAR_TO_STR(a)
  359. #define VARS_TO_STR2(a, b) VAR_TO_STR(a) + "," + VAR_TO_STR(b)
  360. #define VARS_TO_STR3(a, b, c) VAR_TO_STR(a) + "," + VARS_TO_STR2(b, c)
  361. #define VARS_TO_STR4(a, b, c, d) VAR_TO_STR(a) + "," + VARS_TO_STR3(b, c, d)
  362. #define VARS_TO_STR5(a, b, c, d, e) VAR_TO_STR(a) + "," + VARS_TO_STR4(b, c, d, e)
  363. #define VARS_TO_STR6(a, b, c, d, e, f) VAR_TO_STR(a) + "," + VARS_TO_STR5(b, c, d, e, f)
  364. #define VARS_TO_STR7(a, b, c, d, e, f, g) VAR_TO_STR(a) + "," + VARS_TO_STR6(b, c, d, e, f, g)
  365. #define VARS_TO_STR8(a, b, c, d, e, f, g, h) VAR_TO_STR(a) + "," + VARS_TO_STR7(b, c, d, e, f, g, h)
  366. #define VARS_TO_STR9(a, b, c, d, e, f, g, h, i) VAR_TO_STR(a) + "," + VARS_TO_STR8(b, c, d, e, f, g, h, i)
  367. #define VARS_TO_STR10(a, b, c, d, e, f, g, h, i, j) VAR_TO_STR(a) + "," + VARS_TO_STR9(b, c, d, e, f, g, h, i, j)
  368. #define VARS_TO_STR11(a, b, c, d, e, f, g, h, i, j, k) VAR_TO_STR(a) + "," + VARS_TO_STR10(b, c, d, e, f, g, h, i, j, k)
  369. #define VARS_TO_STR12(a, b, c, d, e, f, g, h, i, j, k, l) VAR_TO_STR(a) + "," + VARS_TO_STR11(b, c, d, e, f, g, h, i, j, k, l)
  370. #define VARS_TO_STR13(a, b, c, d, e, f, g, h, i, j, k, l, m) VAR_TO_STR(a) + "," + VARS_TO_STR12(b, c, d, e, f, g, h, i, j, k, l, m)
  371. #define VARS_TO_STR14(a, b, c, d, e, f, g, h, i, j, k, l, m, n) VAR_TO_STR(a) + "," + VARS_TO_STR13(b, c, d, e, f, g, h, i, j, k, l, m, n)
  372. #define VARS_TO_STR15(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) VAR_TO_STR(a) + "," + VARS_TO_STR14(b, c, d, e, f, g, h, i, j, k, l, m, n, o)
  373. #define VARS_TO_STR16(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) VAR_TO_STR(a) + "," + VARS_TO_STR15(b, c, d, e, f, g, h, i, j, k, l, m, n, o, p)
  374. #ifdef GGML_USE_SYCL
  375. static bool inline _isinf(float f) {
  376. return (*(uint32_t *)&f & 0x7fffffff) == 0x7f800000;
  377. }
  378. #else
  379. static bool inline _isinf(float f) { return std::isinf(f); }
  380. #endif
  381. // accept FLT_MAX as infinity
  382. static bool isinf_or_max(float f) {
  383. return _isinf(f) || f == FLT_MAX || f == -FLT_MAX;
  384. }
  385. static bool ggml_is_view_op(enum ggml_op op) {
  386. return op == GGML_OP_VIEW || op == GGML_OP_RESHAPE || op == GGML_OP_PERMUTE || op == GGML_OP_TRANSPOSE;
  387. }
  388. enum test_mode {
  389. MODE_TEST,
  390. MODE_PERF,
  391. MODE_GRAD,
  392. MODE_SUPPORT,
  393. };
  394. // Output format support similar to llama-bench
  395. enum output_formats { CONSOLE, SQL, CSV };
  396. static const char * output_format_str(output_formats format) {
  397. switch (format) {
  398. case CONSOLE:
  399. return "console";
  400. case SQL:
  401. return "sql";
  402. case CSV:
  403. return "csv";
  404. default:
  405. GGML_ABORT("invalid output format");
  406. }
  407. }
  408. static bool output_format_from_str(const std::string & s, output_formats & format) {
  409. if (s == "console") {
  410. format = CONSOLE;
  411. } else if (s == "sql") {
  412. format = SQL;
  413. } else if (s == "csv") {
  414. format = CSV;
  415. } else {
  416. return false;
  417. }
  418. return true;
  419. }
  420. // Test result structure for SQL output
  421. struct test_result {
  422. std::string test_time;
  423. std::string build_commit;
  424. std::string backend_name;
  425. std::string op_name;
  426. std::string op_params;
  427. std::string test_mode;
  428. bool supported;
  429. bool passed;
  430. std::string error_message;
  431. double time_us;
  432. double flops;
  433. double bandwidth_gb_s;
  434. size_t memory_kb;
  435. int n_runs;
  436. std::string device_description;
  437. std::string backend_reg_name;
  438. test_result() {
  439. // Initialize with default values
  440. time_us = 0.0;
  441. flops = 0.0;
  442. bandwidth_gb_s = 0.0;
  443. memory_kb = 0;
  444. n_runs = 0;
  445. supported = false;
  446. passed = false;
  447. // Set test time
  448. time_t t = time(NULL);
  449. char buf[32];
  450. std::strftime(buf, sizeof(buf), "%FT%TZ", gmtime(&t));
  451. test_time = buf;
  452. // Set build info
  453. build_commit = ggml_commit();
  454. }
  455. test_result(const std::string & backend_name, const std::string & op_name, const std::string & op_params,
  456. const std::string & test_mode, bool supported, bool passed, const std::string & error_message = "",
  457. double time_us = 0.0, double flops = 0.0, double bandwidth_gb_s = 0.0, size_t memory_kb = 0,
  458. int n_runs = 0, const std::string & device_description = "", const std::string & backend_reg_name = "") :
  459. backend_name(backend_name),
  460. op_name(op_name),
  461. op_params(op_params),
  462. test_mode(test_mode),
  463. supported(supported),
  464. passed(passed),
  465. error_message(error_message),
  466. time_us(time_us),
  467. flops(flops),
  468. bandwidth_gb_s(bandwidth_gb_s),
  469. memory_kb(memory_kb),
  470. n_runs(n_runs),
  471. device_description(device_description),
  472. backend_reg_name(backend_reg_name) {
  473. // Set test time
  474. time_t t = time(NULL);
  475. char buf[32];
  476. std::strftime(buf, sizeof(buf), "%FT%TZ", gmtime(&t));
  477. test_time = buf;
  478. // Set build info
  479. build_commit = ggml_commit();
  480. }
  481. static const std::vector<std::string> & get_fields() {
  482. static const std::vector<std::string> fields = {
  483. "test_time", "build_commit", "backend_name", "op_name", "op_params", "test_mode", "supported",
  484. "passed", "error_message", "time_us", "flops", "bandwidth_gb_s", "memory_kb", "n_runs",
  485. "device_description", "backend_reg_name"
  486. };
  487. return fields;
  488. }
  489. enum field_type { STRING, BOOL, INT, FLOAT };
  490. static field_type get_field_type(const std::string & field) {
  491. if (field == "supported" || field == "passed") {
  492. return BOOL;
  493. }
  494. if (field == "memory_kb" || field == "n_runs") {
  495. return INT;
  496. }
  497. if (field == "time_us" || field == "flops" || field == "bandwidth_gb_s") {
  498. return FLOAT;
  499. }
  500. return STRING;
  501. }
  502. std::vector<std::string> get_values() const {
  503. return { test_time,
  504. build_commit,
  505. backend_name,
  506. op_name,
  507. op_params,
  508. test_mode,
  509. std::to_string(supported),
  510. std::to_string(passed),
  511. error_message,
  512. std::to_string(time_us),
  513. std::to_string(flops),
  514. std::to_string(bandwidth_gb_s),
  515. std::to_string(memory_kb),
  516. std::to_string(n_runs),
  517. device_description,
  518. backend_reg_name };
  519. }
  520. };
  521. // Printer classes for different output formats
  522. enum class test_status_t { NOT_SUPPORTED, OK, FAIL, SKIPPED };
  523. struct test_operation_info {
  524. std::string op_name;
  525. std::string op_params;
  526. std::string backend_name;
  527. test_status_t status = test_status_t::OK;
  528. std::string failure_reason;
  529. // Additional information fields that were previously in separate structs
  530. std::string error_component;
  531. std::string error_details;
  532. // Gradient info
  533. int64_t gradient_index = -1;
  534. std::string gradient_param_name;
  535. float gradient_value = 0.0f;
  536. // MAA error info
  537. double maa_error = 0.0;
  538. double maa_threshold = 0.0;
  539. // Flags for different types of information
  540. bool has_error = false;
  541. bool has_gradient_info = false;
  542. bool has_maa_error = false;
  543. bool is_compare_failure = false;
  544. bool is_large_tensor_skip = false;
  545. test_operation_info() = default;
  546. test_operation_info(const std::string & op_name, const std::string & op_params, const std::string & backend_name,
  547. test_status_t status = test_status_t::OK, const std::string & failure_reason = "") :
  548. op_name(op_name),
  549. op_params(op_params),
  550. backend_name(backend_name),
  551. status(status),
  552. failure_reason(failure_reason) {}
  553. // Set error information
  554. void set_error(const std::string & component, const std::string & details) {
  555. has_error = true;
  556. error_component = component;
  557. error_details = details;
  558. if (status == test_status_t::OK) {
  559. status = test_status_t::FAIL;
  560. }
  561. }
  562. // Set gradient information
  563. void set_gradient_info(int64_t index, const std::string & param_name, float value) {
  564. has_gradient_info = true;
  565. gradient_index = index;
  566. gradient_param_name = param_name;
  567. gradient_value = value;
  568. if (status == test_status_t::OK) {
  569. status = test_status_t::FAIL;
  570. }
  571. }
  572. // Set MAA error information
  573. void set_maa_error(double error, double threshold) {
  574. has_maa_error = true;
  575. maa_error = error;
  576. maa_threshold = threshold;
  577. if (status == test_status_t::OK) {
  578. status = test_status_t::FAIL;
  579. }
  580. }
  581. // Set compare failure
  582. void set_compare_failure() {
  583. is_compare_failure = true;
  584. if (status == test_status_t::OK) {
  585. status = test_status_t::FAIL;
  586. }
  587. }
  588. // Set large tensor skip
  589. void set_large_tensor_skip() { is_large_tensor_skip = true; }
  590. };
  591. struct test_summary_info {
  592. size_t tests_passed;
  593. size_t tests_total;
  594. bool is_backend_summary = false; // true for backend summary, false for test summary
  595. test_summary_info() = default;
  596. test_summary_info(size_t tests_passed, size_t tests_total, bool is_backend_summary = false) :
  597. tests_passed(tests_passed),
  598. tests_total(tests_total),
  599. is_backend_summary(is_backend_summary) {}
  600. };
  601. struct testing_start_info {
  602. size_t device_count;
  603. testing_start_info() = default;
  604. testing_start_info(size_t device_count) : device_count(device_count) {}
  605. };
  606. struct backend_init_info {
  607. size_t device_index;
  608. size_t total_devices;
  609. std::string device_name;
  610. bool skipped = false;
  611. std::string skip_reason;
  612. std::string description;
  613. size_t memory_total_mb = 0;
  614. size_t memory_free_mb = 0;
  615. bool has_memory_info = false;
  616. backend_init_info() = default;
  617. backend_init_info(size_t device_index, size_t total_devices, const std::string & device_name, bool skipped = false,
  618. const std::string & skip_reason = "", const std::string & description = "",
  619. size_t memory_total_mb = 0, size_t memory_free_mb = 0, bool has_memory_info = false) :
  620. device_index(device_index),
  621. total_devices(total_devices),
  622. device_name(device_name),
  623. skipped(skipped),
  624. skip_reason(skip_reason),
  625. description(description),
  626. memory_total_mb(memory_total_mb),
  627. memory_free_mb(memory_free_mb),
  628. has_memory_info(has_memory_info) {}
  629. };
  630. struct backend_status_info {
  631. std::string backend_name;
  632. test_status_t status;
  633. backend_status_info() = default;
  634. backend_status_info(const std::string & backend_name, test_status_t status) :
  635. backend_name(backend_name),
  636. status(status) {}
  637. };
  638. struct overall_summary_info {
  639. size_t backends_passed;
  640. size_t backends_total;
  641. bool all_passed;
  642. overall_summary_info() = default;
  643. overall_summary_info(size_t backends_passed, size_t backends_total, bool all_passed) :
  644. backends_passed(backends_passed),
  645. backends_total(backends_total),
  646. all_passed(all_passed) {}
  647. };
  648. struct printer {
  649. virtual ~printer() {}
  650. FILE * fout = stdout;
  651. virtual void print_header() {}
  652. virtual void print_test_result(const test_result & result) = 0;
  653. virtual void print_footer() {}
  654. virtual void print_operation(const test_operation_info & info) { (void) info; }
  655. virtual void print_summary(const test_summary_info & info) { (void) info; }
  656. virtual void print_testing_start(const testing_start_info & info) { (void) info; }
  657. virtual void print_backend_init(const backend_init_info & info) { (void) info; }
  658. virtual void print_backend_status(const backend_status_info & info) { (void) info; }
  659. virtual void print_overall_summary(const overall_summary_info & info) { (void) info; }
  660. virtual void print_failed_tests(const std::vector<std::string> & failed_tests) { (void) failed_tests; }
  661. };
  662. struct console_printer : public printer {
  663. void print_test_result(const test_result & result) override {
  664. if (result.test_mode == "test") {
  665. print_test_console(result);
  666. } else if (result.test_mode == "perf") {
  667. print_perf_console(result);
  668. } else if (result.test_mode == "support") {
  669. print_support_console(result);
  670. }
  671. }
  672. void print_operation(const test_operation_info & info) override {
  673. printf(" %s(%s): ", info.op_name.c_str(), info.op_params.c_str());
  674. fflush(stdout);
  675. // Handle large tensor skip first
  676. if (info.is_large_tensor_skip) {
  677. printf("skipping large tensors for speed \n");
  678. return;
  679. }
  680. // Handle not supported status
  681. if (info.status == test_status_t::NOT_SUPPORTED) {
  682. if (!info.failure_reason.empty()) {
  683. printf("not supported [%s]\n", info.failure_reason.c_str());
  684. } else {
  685. printf("not supported [%s]\n", info.backend_name.c_str());
  686. }
  687. return;
  688. }
  689. // Handle errors and additional information
  690. if (info.has_error) {
  691. if (info.error_component == "allocation") {
  692. fprintf(stderr, "failed to allocate tensors [%s] ", info.backend_name.c_str());
  693. } else if (info.error_component == "backend") {
  694. fprintf(stderr, " Failed to initialize %s backend\n", info.backend_name.c_str());
  695. } else {
  696. fprintf(stderr, "Error in %s: %s\n", info.error_component.c_str(), info.error_details.c_str());
  697. }
  698. }
  699. // Handle gradient info
  700. if (info.has_gradient_info) {
  701. printf("[%s] nonfinite gradient at index %" PRId64 " (%s=%f) ", info.op_name.c_str(), info.gradient_index,
  702. info.gradient_param_name.c_str(), info.gradient_value);
  703. }
  704. // Handle MAA error
  705. if (info.has_maa_error) {
  706. printf("[%s] MAA = %.9f > %.9f ", info.op_name.c_str(), info.maa_error, info.maa_threshold);
  707. }
  708. // Handle compare failure
  709. if (info.is_compare_failure) {
  710. printf("compare failed ");
  711. }
  712. // Print final status
  713. if (info.status == test_status_t::OK) {
  714. printf("\033[1;32mOK\033[0m\n");
  715. } else {
  716. printf("\033[1;31mFAIL\033[0m\n");
  717. }
  718. }
  719. void print_summary(const test_summary_info & info) override {
  720. if (info.is_backend_summary) {
  721. printf("%zu/%zu backends passed\n", info.tests_passed, info.tests_total);
  722. } else {
  723. printf(" %zu/%zu tests passed\n", info.tests_passed, info.tests_total);
  724. }
  725. }
  726. void print_backend_status(const backend_status_info & info) override {
  727. printf(" Backend %s: ", info.backend_name.c_str());
  728. if (info.status == test_status_t::OK) {
  729. printf("\033[1;32mOK\033[0m\n");
  730. } else {
  731. printf("\033[1;31mFAIL\033[0m\n");
  732. }
  733. }
  734. void print_testing_start(const testing_start_info & info) override {
  735. printf("Testing %zu devices\n\n", info.device_count);
  736. }
  737. void print_backend_init(const backend_init_info & info) override {
  738. printf("Backend %zu/%zu: %s\n", info.device_index + 1, info.total_devices, info.device_name.c_str());
  739. if (info.skipped) {
  740. printf(" %s\n", info.skip_reason.c_str());
  741. return;
  742. }
  743. if (!info.description.empty()) {
  744. printf(" Device description: %s\n", info.description.c_str());
  745. }
  746. if (info.has_memory_info) {
  747. printf(" Device memory: %zu MB (%zu MB free)\n", info.memory_total_mb, info.memory_free_mb);
  748. }
  749. printf("\n");
  750. }
  751. void print_overall_summary(const overall_summary_info & info) override {
  752. printf("%zu/%zu backends passed\n", info.backends_passed, info.backends_total);
  753. if (info.all_passed) {
  754. printf("\033[1;32mOK\033[0m\n");
  755. } else {
  756. printf("\033[1;31mFAIL\033[0m\n");
  757. }
  758. }
  759. void print_failed_tests(const std::vector<std::string> & failed_tests) override {
  760. if (failed_tests.empty()) {
  761. return;
  762. }
  763. printf("\nFailing tests:\n");
  764. for (const auto & test_name : failed_tests) {
  765. printf(" %s\n", test_name.c_str());
  766. }
  767. }
  768. private:
  769. void print_test_console(const test_result & result) {
  770. printf(" %s(%s): ", result.op_name.c_str(), result.op_params.c_str());
  771. fflush(stdout);
  772. if (!result.supported) {
  773. printf("not supported [%s] ", result.backend_name.c_str());
  774. printf("\n");
  775. return;
  776. }
  777. if (result.passed) {
  778. printf("\033[1;32mOK\033[0m\n");
  779. } else {
  780. printf("\033[1;31mFAIL\033[0m\n");
  781. }
  782. }
  783. void print_perf_console(const test_result & result) {
  784. int len = printf(" %s(%s): ", result.op_name.c_str(), result.op_params.c_str());
  785. fflush(stdout);
  786. if (!result.supported) {
  787. printf("not supported\n");
  788. return;
  789. }
  790. // align while also leaving some margin for variations in parameters
  791. int align = 8;
  792. int last = (len + align - 1) / align * align;
  793. if (last - len < 5) {
  794. last += align;
  795. }
  796. printf("%*s", last - len, "");
  797. printf(" %8d runs - %8.2f us/run - ", result.n_runs, result.time_us);
  798. if (result.flops > 0) {
  799. auto format_flops = [](double flops) -> std::string {
  800. char buf[256];
  801. if (flops >= 1e12) {
  802. snprintf(buf, sizeof(buf), "%6.2f TFLOP", flops / 1e12);
  803. } else if (flops >= 1e9) {
  804. snprintf(buf, sizeof(buf), "%6.2f GFLOP", flops / 1e9);
  805. } else if (flops >= 1e6) {
  806. snprintf(buf, sizeof(buf), "%6.2f MFLOP", flops / 1e6);
  807. } else {
  808. snprintf(buf, sizeof(buf), "%6.2f kFLOP", flops / 1e3);
  809. }
  810. return buf;
  811. };
  812. uint64_t op_flops_per_run = result.flops * result.time_us / 1e6;
  813. printf("%s/run - \033[1;34m%sS\033[0m", format_flops(op_flops_per_run).c_str(),
  814. format_flops(result.flops).c_str());
  815. } else {
  816. printf("%8zu kB/run - \033[1;34m%7.2f GB/s\033[0m", result.memory_kb, result.bandwidth_gb_s);
  817. }
  818. printf("\n");
  819. }
  820. void print_support_console(const test_result & result) {
  821. printf(" %s(%s): ", result.op_name.c_str(), result.op_params.c_str());
  822. fflush(stdout);
  823. if (result.supported) {
  824. printf("\033[1;32mSUPPORTED\033[0m\n");
  825. } else {
  826. printf("\033[1;31mNOT SUPPORTED\033[0m\n");
  827. }
  828. }
  829. };
  830. struct sql_printer : public printer {
  831. static std::string get_sql_field_type(const std::string & field) {
  832. switch (test_result::get_field_type(field)) {
  833. case test_result::STRING:
  834. return "TEXT";
  835. case test_result::BOOL:
  836. case test_result::INT:
  837. return "INTEGER";
  838. case test_result::FLOAT:
  839. return "REAL";
  840. default:
  841. GGML_ABORT("invalid field type");
  842. }
  843. }
  844. void print_header() override {
  845. std::vector<std::string> fields = test_result::get_fields();
  846. fprintf(fout, "CREATE TABLE IF NOT EXISTS test_backend_ops (\n");
  847. for (size_t i = 0; i < fields.size(); i++) {
  848. fprintf(fout, " %s %s%s\n", fields[i].c_str(), get_sql_field_type(fields[i]).c_str(),
  849. i < fields.size() - 1 ? "," : "");
  850. }
  851. fprintf(fout, ");\n\n");
  852. }
  853. void print_test_result(const test_result & result) override {
  854. fprintf(fout, "INSERT INTO test_backend_ops (");
  855. std::vector<std::string> fields = test_result::get_fields();
  856. for (size_t i = 0; i < fields.size(); i++) {
  857. fprintf(fout, "%s%s", fields[i].c_str(), i < fields.size() - 1 ? ", " : "");
  858. }
  859. fprintf(fout, ") VALUES (");
  860. std::vector<std::string> values = result.get_values();
  861. for (size_t i = 0; i < values.size(); i++) {
  862. fprintf(fout, "'%s'%s", values[i].c_str(), i < values.size() - 1 ? ", " : "");
  863. }
  864. fprintf(fout, ");\n");
  865. }
  866. };
  867. struct csv_printer : public printer {
  868. void print_header() override {
  869. std::vector<std::string> fields = test_result::get_fields();
  870. std::vector<std::string> fields_csv = get_fields_csv();
  871. for (size_t i = 0; i < fields.size(); i++) {
  872. if (std::find(std::begin(fields_csv), std::end(fields_csv), fields[i]) == std::end(fields_csv)) {
  873. continue;
  874. }
  875. printf("\"%s\"%s", fields[i].c_str(), i < fields.size() - 1 ? "," : "");
  876. }
  877. printf("\n");
  878. }
  879. void print_test_result(const test_result & result) override {
  880. std::vector<std::string> values = result.get_values();
  881. std::vector<std::string> fields = test_result::get_fields();
  882. std::vector<std::string> fields_csv = get_fields_csv();
  883. for (size_t i = 0; i < values.size(); i++) {
  884. if (std::find(std::begin(fields_csv), std::end(fields_csv), fields[i]) == std::end(fields_csv)) {
  885. continue;
  886. }
  887. // Escape quotes and wrap in quotes for CSV
  888. std::string escaped_value = values[i];
  889. size_t pos = 0;
  890. while ((pos = escaped_value.find("\"", pos)) != std::string::npos) {
  891. escaped_value.replace(pos, 1, "\"\"");
  892. pos += 2;
  893. }
  894. printf("\"%s\"%s", escaped_value.c_str(), i < values.size() - 1 ? "," : "");
  895. }
  896. printf("\n");
  897. }
  898. static std::vector<std::string> get_fields_csv() {
  899. return {
  900. "op_name",
  901. "op_params",
  902. "supported",
  903. "error_message",
  904. "test_mode",
  905. "backend_reg_name",
  906. "backend_name",
  907. };
  908. }
  909. };
  910. static std::unique_ptr<printer> create_printer(output_formats format) {
  911. switch (format) {
  912. case CONSOLE:
  913. return std::make_unique<console_printer>();
  914. case SQL:
  915. return std::make_unique<sql_printer>();
  916. case CSV:
  917. return std::make_unique<csv_printer>();
  918. }
  919. GGML_ABORT("invalid output format");
  920. }
  921. struct test_case {
  922. virtual ~test_case() {}
  923. virtual std::string op_desc(ggml_tensor * t) {
  924. return ggml_op_desc(t);
  925. }
  926. virtual std::string vars() {
  927. return "";
  928. }
  929. virtual ggml_tensor * build_graph(ggml_context * ctx) = 0;
  930. virtual double max_nmse_err() {
  931. return 1e-7;
  932. }
  933. virtual double max_maa_err() {
  934. return 1e-4;
  935. }
  936. virtual double max_err() {
  937. return max_nmse_err();
  938. }
  939. virtual double err(const float * a, const float * b, size_t n) {
  940. return nmse(a, b, n);
  941. }
  942. virtual float grad_eps() {
  943. return 1e-1f;
  944. }
  945. // If false, estimate gradient with 2 points, neglects 3rd order derivative and higher.
  946. // If true, estimate gradient with 4 points, neglects 5th order derivative and higher.
  947. virtual bool grad_precise() {
  948. return false;
  949. }
  950. // Skip gradient checks if total number of gradients to be checked is larger than this (to speed up the tests).
  951. virtual int64_t grad_nmax() {
  952. return 10000;
  953. }
  954. // No effect if empty.
  955. // If not empty, skip all gradient checks where the numerical result does not match any of the values.
  956. // Needed for dealing with noncontinuous gradients (e.g. ReLU) where estimation using finite differences is unreliable.
  957. virtual std::vector<float> grad_expect() {
  958. return {};
  959. }
  960. virtual void initialize_tensors(ggml_context * ctx) {
  961. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != nullptr; t = ggml_get_next_tensor(ctx, t)) {
  962. init_tensor_uniform(t);
  963. }
  964. }
  965. virtual size_t op_size(ggml_tensor * t) {
  966. size_t size = ggml_nbytes(t);
  967. // add source tensors
  968. for (int i = 0; i < GGML_MAX_SRC; i++) {
  969. if (t->src[i] != NULL) {
  970. size += ggml_nbytes(t->src[i]);
  971. }
  972. }
  973. return size;
  974. }
  975. virtual uint64_t op_flops(ggml_tensor * t) {
  976. GGML_UNUSED(t);
  977. return 0;
  978. }
  979. virtual bool run_whole_graph() { return false; }
  980. virtual std::vector<ggml_tensor *> fusion_test_nodes() { return {}; }
  981. ggml_cgraph * gf = nullptr;
  982. ggml_cgraph * gb = nullptr;
  983. static const int sentinel_size = 1024;
  984. test_mode mode;
  985. std::vector<ggml_tensor *> sentinels;
  986. std::string current_op_name;
  987. void add_sentinel(ggml_context * ctx) {
  988. if (mode == MODE_PERF || mode == MODE_GRAD || mode == MODE_SUPPORT) {
  989. return;
  990. }
  991. ggml_tensor * sentinel = ::ggml_new_tensor_1d(ctx, GGML_TYPE_F32, sentinel_size);
  992. ggml_format_name(sentinel, "sent_%zu", sentinels.size());
  993. sentinels.push_back(sentinel);
  994. }
  995. // hijack ggml_new_tensor to add sentinels after each tensor to check for overflows in the backend
  996. ggml_tensor * ggml_new_tensor(ggml_context * ctx, ggml_type type, int n_dims, const int64_t * ne) {
  997. ggml_tensor * t = ::ggml_new_tensor(ctx, type, n_dims, ne);
  998. add_sentinel(ctx);
  999. return t;
  1000. }
  1001. ggml_tensor * ggml_new_tensor_1d(ggml_context * ctx, ggml_type type, int64_t ne0) {
  1002. ggml_tensor * t = ::ggml_new_tensor_1d(ctx, type, ne0);
  1003. add_sentinel(ctx);
  1004. return t;
  1005. }
  1006. ggml_tensor * ggml_new_tensor_2d(ggml_context * ctx, ggml_type type, int64_t ne0, int64_t ne1) {
  1007. ggml_tensor * t = ::ggml_new_tensor_2d(ctx, type, ne0, ne1);
  1008. add_sentinel(ctx);
  1009. return t;
  1010. }
  1011. ggml_tensor * ggml_new_tensor_3d(ggml_context * ctx, ggml_type type, int64_t ne0, int64_t ne1, int64_t ne2) {
  1012. ggml_tensor * t = ::ggml_new_tensor_3d(ctx, type, ne0, ne1, ne2);
  1013. add_sentinel(ctx);
  1014. return t;
  1015. }
  1016. ggml_tensor * ggml_new_tensor_4d(ggml_context * ctx, ggml_type type, int64_t ne0, int64_t ne1, int64_t ne2, int64_t ne3) {
  1017. ggml_tensor * t = ::ggml_new_tensor_4d(ctx, type, ne0, ne1, ne2, ne3);
  1018. add_sentinel(ctx);
  1019. return t;
  1020. }
  1021. // Checks an op against the test filter, which is a comma separated list of OP names or specific variations
  1022. bool matches_filter(ggml_tensor * op, const char * op_names_filter) {
  1023. if (op_names_filter) {
  1024. const auto op_name = op_desc(op);
  1025. const auto op_full_name = op_name + "(" + vars() + ")";
  1026. std::string_view filter(op_names_filter);
  1027. while (!filter.empty()) {
  1028. auto comma_pos = filter.find_first_of(',');
  1029. const auto lparen_pos = filter.find_first_of('(');
  1030. if (lparen_pos < comma_pos) {
  1031. auto rparen_pos = filter.find_first_of(')');
  1032. comma_pos = filter.find_first_of(',', rparen_pos);
  1033. const auto op_filter = filter.substr(0, comma_pos);
  1034. if (op_filter == op_full_name) {
  1035. return true;
  1036. }
  1037. } else {
  1038. const auto op_filter = filter.substr(0, comma_pos);
  1039. if (op_filter == op_name) {
  1040. return true;
  1041. }
  1042. }
  1043. filter = comma_pos != std::string_view::npos ? filter.substr(comma_pos + 1) : "";
  1044. }
  1045. return false;
  1046. } else {
  1047. return true;
  1048. }
  1049. }
  1050. test_status_t eval(ggml_backend_t backend1,
  1051. ggml_backend_t backend2,
  1052. const char * op_names_filter,
  1053. printer * output_printer) {
  1054. mode = MODE_TEST;
  1055. ggml_init_params params = {
  1056. /* .mem_size = */ ggml_tensor_overhead()*128 + ggml_graph_overhead(),
  1057. /* .mem_base = */ NULL,
  1058. /* .no_alloc = */ true,
  1059. };
  1060. ggml_context * ctx = ggml_init(params);
  1061. GGML_ASSERT(ctx);
  1062. gf = ggml_new_graph(ctx);
  1063. // pre-graph sentinel
  1064. add_sentinel(ctx);
  1065. ggml_tensor * out = build_graph(ctx);
  1066. current_op_name = op_desc(out);
  1067. if (!matches_filter(out, op_names_filter)) {
  1068. //printf(" %s: skipping\n", op_desc(out).c_str());
  1069. ggml_free(ctx);
  1070. return test_status_t::SKIPPED;
  1071. }
  1072. // check if the backends support the ops
  1073. bool supported = true;
  1074. for (ggml_backend_t backend : {backend1, backend2}) {
  1075. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1076. if (!ggml_backend_supports_op(backend, t)) {
  1077. supported = false;
  1078. break;
  1079. }
  1080. }
  1081. }
  1082. if (!supported) {
  1083. // Create test result for unsupported operation
  1084. test_result result(ggml_backend_name(backend1), current_op_name, vars(), "test",
  1085. false, false, "not supported");
  1086. if (output_printer) {
  1087. output_printer->print_test_result(result);
  1088. }
  1089. ggml_free(ctx);
  1090. return test_status_t::NOT_SUPPORTED;
  1091. }
  1092. // post-graph sentinel
  1093. add_sentinel(ctx);
  1094. // allocate
  1095. ggml_backend_buffer_t buf = ggml_backend_alloc_ctx_tensors(ctx, backend1);
  1096. if (buf == NULL) {
  1097. printf("failed to allocate tensors [%s] ", ggml_backend_name(backend1));
  1098. ggml_free(ctx);
  1099. return test_status_t::FAIL;
  1100. }
  1101. // build graph
  1102. ggml_build_forward_expand(gf, out);
  1103. // add sentinels as graph nodes so that they are checked in the callback
  1104. for (ggml_tensor * sentinel : sentinels) {
  1105. ggml_graph_add_node(gf, sentinel);
  1106. }
  1107. // randomize tensors
  1108. initialize_tensors(ctx);
  1109. // compare
  1110. struct callback_userdata {
  1111. bool ok;
  1112. test_case * tc;
  1113. ggml_backend_t backend1;
  1114. ggml_backend_t backend2;
  1115. };
  1116. callback_userdata ud {
  1117. true,
  1118. this,
  1119. backend1,
  1120. backend2,
  1121. };
  1122. auto callback = [](int index, ggml_tensor * t1, ggml_tensor * t2, void * user_data) -> bool {
  1123. callback_userdata * ud = (callback_userdata *) user_data;
  1124. const char * bn1 = ggml_backend_name(ud->backend1);
  1125. const char * bn2 = ggml_backend_name(ud->backend2);
  1126. if (t1->op == GGML_OP_NONE) {
  1127. // sentinels must be unchanged
  1128. std::vector<uint8_t> t1_data(ggml_nbytes(t1));
  1129. std::vector<uint8_t> t2_data(ggml_nbytes(t2));
  1130. ggml_backend_tensor_get(t1, t1_data.data(), 0, ggml_nbytes(t1));
  1131. ggml_backend_tensor_get(t2, t2_data.data(), 0, ggml_nbytes(t2));
  1132. if (memcmp(t1_data.data(), t2_data.data(), ggml_nbytes(t1)) != 0) {
  1133. printf("sentinel mismatch: %s ", t1->name);
  1134. ud->ok = false;
  1135. return true;
  1136. }
  1137. }
  1138. std::vector<float> f1 = tensor_to_float(t1);
  1139. std::vector<float> f2 = tensor_to_float(t2);
  1140. for (size_t i = 0; i < f1.size(); i++) {
  1141. // check for nans
  1142. if (std::isnan(f1[i]) || std::isnan(f2[i])) {
  1143. printf("[%s] NaN at index %zu (%s=%f %s=%f) ", ggml_op_desc(t1), i, bn1, f1[i], bn2, f2[i]);
  1144. ud->ok = false;
  1145. return true;
  1146. }
  1147. // check for infs: both must be inf of the same sign, or both must be finite
  1148. if (isinf_or_max(f1[i]) || isinf_or_max(f2[i])) {
  1149. if (isinf_or_max(f1[i]) && isinf_or_max(f2[i])) {
  1150. if (std::signbit(f1[i]) != std::signbit(f2[i])) {
  1151. printf("[%s] inf sign mismatch: %s=%f %s=%f ", ggml_op_desc(t1), bn1, f1[i], bn2, f2[i]);
  1152. ud->ok = false;
  1153. return true;
  1154. }
  1155. } else {
  1156. printf("[%s] inf mismatch: %s=%f %s=%f ", ggml_op_desc(t1), bn1, f1[i], bn2, f2[i]);
  1157. ud->ok = false;
  1158. return true;
  1159. }
  1160. }
  1161. }
  1162. double err = ud->tc->err(f1.data(), f2.data(), f1.size());
  1163. if (err > ud->tc->max_err()) {
  1164. printf("[%s] ERR = %.9f > %.9f ", ggml_op_desc(t1), err, ud->tc->max_err());
  1165. //for (int i = 0; i < (int) f1.size(); i++) {
  1166. // printf("%5d %9.6f %9.6f, diff = %9.6f\n", i, f1[i], f2[i], f1[i] - f2[i]);
  1167. //}
  1168. //printf("\n");
  1169. //exit(1);
  1170. ud->ok = false;
  1171. }
  1172. return true;
  1173. GGML_UNUSED(index);
  1174. };
  1175. std::vector<ggml_tensor *> fused_nodes_to_verify = fusion_test_nodes();
  1176. if (fused_nodes_to_verify.size() == 0 && run_whole_graph()) {
  1177. fused_nodes_to_verify.push_back(out);
  1178. }
  1179. const bool cmp_ok = ggml_backend_compare_graph_backend(backend1, backend2, gf, callback, &ud,
  1180. run_whole_graph() ? fused_nodes_to_verify.data() : nullptr,
  1181. fused_nodes_to_verify.size());
  1182. ggml_backend_buffer_free(buf);
  1183. ggml_free(ctx);
  1184. // Create test result
  1185. bool test_passed = ud.ok && cmp_ok;
  1186. std::string error_msg = test_passed ? "" : (!cmp_ok ? "compare failed" : "test failed");
  1187. test_result result(ggml_backend_name(backend1), current_op_name, vars(), "test", supported, test_passed,
  1188. error_msg);
  1189. if (output_printer) {
  1190. output_printer->print_test_result(result);
  1191. }
  1192. return test_passed ? test_status_t::OK : test_status_t::FAIL;
  1193. }
  1194. bool eval_perf(ggml_backend_t backend, const char * op_names_filter, printer * output_printer) {
  1195. mode = MODE_PERF;
  1196. static const size_t graph_nodes = 8192;
  1197. ggml_init_params params = {
  1198. /* .mem_size = */ ggml_tensor_overhead()*128 + ggml_graph_overhead_custom(graph_nodes, false),
  1199. /* .mem_base = */ NULL,
  1200. /* .no_alloc = */ true,
  1201. };
  1202. ggml_context_ptr ctx(ggml_init(params)); // smart ptr
  1203. GGML_ASSERT(ctx);
  1204. ggml_tensor * out = build_graph(ctx.get());
  1205. current_op_name = op_desc(out);
  1206. if (!matches_filter(out, op_names_filter)) {
  1207. //printf(" %s: skipping\n", op_desc(out).c_str());
  1208. return true;
  1209. }
  1210. if (!ggml_backend_supports_op(backend, out)) {
  1211. // Create test result for unsupported performance test
  1212. test_result result(ggml_backend_name(backend), current_op_name, vars(), "perf", false, false,
  1213. "not supported");
  1214. output_printer->print_test_result(result);
  1215. return true;
  1216. }
  1217. // allocate
  1218. ggml_backend_buffer_ptr buf(ggml_backend_alloc_ctx_tensors(ctx.get(), backend)); // smart ptr
  1219. if (buf == NULL) {
  1220. printf("failed to allocate tensors\n");
  1221. return false;
  1222. }
  1223. // randomize tensors
  1224. initialize_tensors(ctx.get());
  1225. // build graph
  1226. ggml_cgraph * gf = ggml_new_graph_custom(ctx.get(), graph_nodes, false);
  1227. ggml_build_forward_expand(gf, out);
  1228. // warmup run
  1229. ggml_status status = ggml_backend_graph_compute(backend, gf);
  1230. if (status != GGML_STATUS_SUCCESS) {
  1231. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  1232. return false;
  1233. }
  1234. // determine number of runs
  1235. int n_runs;
  1236. bool is_cpu = ggml_backend_dev_type(ggml_backend_get_device(backend)) == GGML_BACKEND_DEVICE_TYPE_CPU;
  1237. if (op_flops(out) > 0) {
  1238. // based on flops
  1239. const uint64_t GFLOP = 1000 * 1000 * 1000;
  1240. const uint64_t target_flops_cpu = 8ULL * GFLOP;
  1241. const uint64_t target_flops_gpu = 100ULL * GFLOP;
  1242. uint64_t target_flops = is_cpu ? target_flops_cpu : target_flops_gpu;
  1243. n_runs = (int)std::min<int64_t>(ggml_graph_size(gf) - ggml_graph_n_nodes(gf), target_flops / op_flops(out)) + 1;
  1244. } else {
  1245. // based on memory size
  1246. const size_t GB = 1ULL << 30;
  1247. const size_t target_size_cpu = 8 * GB;
  1248. const size_t target_size_gpu = 32 * GB;
  1249. size_t target_size = is_cpu ? target_size_cpu : target_size_gpu;
  1250. n_runs = (int)std::min<int64_t>(ggml_graph_size(gf) - ggml_graph_n_nodes(gf), target_size / op_size(out)) + 1;
  1251. }
  1252. // duplicate the op
  1253. for (int i = 1; i < n_runs; i++) {
  1254. ggml_graph_add_node(gf, out);
  1255. }
  1256. // calculate memory
  1257. size_t mem = n_runs * op_size(out);
  1258. auto tensor_op_size = [](ggml_tensor * t) {
  1259. size_t size = ggml_nbytes(t);
  1260. // add source tensors
  1261. for (int i = 0; i < GGML_MAX_SRC; i++) {
  1262. if (t->src[i] != NULL) {
  1263. size += ggml_nbytes(t->src[i]);
  1264. }
  1265. }
  1266. return size;
  1267. };
  1268. for (int i = 0; i < ggml_graph_n_nodes(gf); ++i) {
  1269. if (ggml_is_view_op(ggml_graph_node(gf, i)->op) || ggml_graph_node(gf, i) == out) {
  1270. continue;
  1271. }
  1272. mem += tensor_op_size(ggml_graph_node(gf, i));
  1273. }
  1274. // run
  1275. int64_t total_time_us = 0;
  1276. int64_t total_mem = 0;
  1277. int total_runs = 0;
  1278. do {
  1279. int64_t start_time = ggml_time_us();
  1280. ggml_status status = ggml_backend_graph_compute(backend, gf);
  1281. if (status != GGML_STATUS_SUCCESS) {
  1282. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  1283. return false;
  1284. }
  1285. int64_t end_time = ggml_time_us();
  1286. total_time_us += end_time - start_time;
  1287. total_mem += mem;
  1288. total_runs += n_runs;
  1289. } while (total_time_us < 1000*1000); // run for at least 1 second
  1290. // Create test result
  1291. double avg_time_us = (double) total_time_us / total_runs;
  1292. double calculated_flops = (op_flops(out) > 0) ? (op_flops(out) * total_runs) / (total_time_us / 1e6) : 0.0;
  1293. double calculated_bandwidth =
  1294. (op_flops(out) == 0) ? total_mem / (total_time_us / 1e6) / 1024.0 / 1024.0 / 1024.0 : 0.0;
  1295. size_t calculated_memory_kb = op_size(out) / 1024;
  1296. test_result result(ggml_backend_name(backend), current_op_name, vars(), "perf", true, true, "", avg_time_us,
  1297. calculated_flops, calculated_bandwidth, calculated_memory_kb, total_runs);
  1298. if (output_printer) {
  1299. output_printer->print_test_result(result);
  1300. }
  1301. return true;
  1302. }
  1303. bool eval_support(ggml_backend_t backend, const char * op_names_filter, printer * output_printer) {
  1304. mode = MODE_SUPPORT;
  1305. static const size_t graph_nodes = 8192;
  1306. ggml_init_params params = {
  1307. /* .mem_size = */ ggml_tensor_overhead()*128 + ggml_graph_overhead_custom(graph_nodes, false),
  1308. /* .mem_base = */ NULL,
  1309. /* .no_alloc = */ true,
  1310. };
  1311. ggml_context_ptr ctx(ggml_init(params)); // smart ptr
  1312. GGML_ASSERT(ctx);
  1313. gf = ggml_new_graph_custom(ctx.get(), graph_nodes, false);
  1314. ggml_tensor * out = build_graph(ctx.get());
  1315. current_op_name = op_desc(out);
  1316. if (!matches_filter(out, op_names_filter)) {
  1317. return true;
  1318. }
  1319. bool supported = ggml_backend_supports_op(backend, out);
  1320. std::string device_desc = ggml_backend_dev_description(ggml_backend_get_device(backend));
  1321. std::string backend_reg_name = ggml_backend_reg_name(ggml_backend_dev_backend_reg(ggml_backend_get_device(backend)));
  1322. test_result result(ggml_backend_name(backend), current_op_name, vars(), "support", supported, supported,
  1323. supported ? "yes" : "no", 0.0, 0.0, 0.0, 0, 0, device_desc, backend_reg_name);
  1324. output_printer->print_test_result(result);
  1325. return true;
  1326. }
  1327. bool eval_grad(ggml_backend_t backend, const char * op_names_filter, printer * output_printer) {
  1328. mode = MODE_GRAD;
  1329. const std::vector<float> expect = grad_expect();
  1330. ggml_init_params params = {
  1331. /* .mem_size = */ ggml_tensor_overhead()*128 + 2*ggml_graph_overhead_custom(GGML_DEFAULT_GRAPH_SIZE, true),
  1332. /* .mem_base = */ NULL,
  1333. /* .no_alloc = */ true,
  1334. };
  1335. ggml_context_ptr ctx(ggml_init(params)); // smart ptr
  1336. GGML_ASSERT(ctx);
  1337. gf = ggml_new_graph_custom(ctx.get(), GGML_DEFAULT_GRAPH_SIZE, true);
  1338. gb = ggml_new_graph_custom(ctx.get(), GGML_DEFAULT_GRAPH_SIZE, true);
  1339. ggml_tensor * out = build_graph(ctx.get());
  1340. if (!matches_filter(out, op_names_filter) || out->op == GGML_OP_OPT_STEP_ADAMW) {
  1341. return true;
  1342. }
  1343. if (out->type != GGML_TYPE_F32) {
  1344. output_printer->print_operation(test_operation_info(op_desc(out), vars(), ggml_backend_name(backend),
  1345. test_status_t::NOT_SUPPORTED,
  1346. out->name + std::string("->type != FP32")));
  1347. return true;
  1348. }
  1349. // Print operation info first
  1350. output_printer->print_operation(test_operation_info(op_desc(out), vars(), ggml_backend_name(backend)));
  1351. // check if the backend supports the ops
  1352. bool supported = true;
  1353. bool any_params = false;
  1354. std::string failure_reason;
  1355. for (ggml_tensor * t = ggml_get_first_tensor(ctx.get()); t != NULL; t = ggml_get_next_tensor(ctx.get(), t)) {
  1356. if (!ggml_backend_supports_op(backend, t)) {
  1357. supported = false;
  1358. failure_reason = ggml_backend_name(backend);
  1359. break;
  1360. }
  1361. if ((t->flags & GGML_TENSOR_FLAG_PARAM)) {
  1362. any_params = true;
  1363. if (t->type != GGML_TYPE_F32) {
  1364. supported = false;
  1365. failure_reason = std::string(t->name) + "->type != FP32";
  1366. break;
  1367. }
  1368. }
  1369. }
  1370. if (!any_params) {
  1371. supported = false;
  1372. failure_reason = op_desc(out);
  1373. }
  1374. if (!supported) {
  1375. output_printer->print_operation(test_operation_info(op_desc(out), vars(), ggml_backend_name(backend),
  1376. test_status_t::NOT_SUPPORTED, failure_reason));
  1377. return true;
  1378. }
  1379. int64_t ngrads = 0;
  1380. for (ggml_tensor * t = ggml_get_first_tensor(ctx.get()); t != NULL; t = ggml_get_next_tensor(ctx.get(), t)) {
  1381. if (t->flags & GGML_TENSOR_FLAG_PARAM) {
  1382. ngrads += ggml_nelements(t);
  1383. }
  1384. }
  1385. if (ngrads > grad_nmax()) {
  1386. test_operation_info info(op_desc(out), vars(), ggml_backend_name(backend));
  1387. info.set_large_tensor_skip();
  1388. output_printer->print_operation(info);
  1389. return true;
  1390. }
  1391. if (!ggml_is_scalar(out)) {
  1392. out = ggml_sum(ctx.get(), out);
  1393. ggml_set_name(out, "sum_of_out");
  1394. }
  1395. ggml_set_loss(out);
  1396. ggml_build_forward_expand(gf, out);
  1397. ggml_graph_cpy(gf, gb);
  1398. ggml_build_backward_expand(ctx.get(), gb, nullptr);
  1399. if (expect.size() != 1 || expect[0] != 0.0f) {
  1400. GGML_ASSERT(ggml_graph_n_nodes(gb) > ggml_graph_n_nodes(gf));
  1401. for (ggml_tensor * t = ggml_get_first_tensor(ctx.get()); t != NULL; t = ggml_get_next_tensor(ctx.get(), t)) {
  1402. GGML_ASSERT(!(t->flags & GGML_TENSOR_FLAG_PARAM) || ggml_graph_get_grad(gb, t)->op != GGML_OP_NONE);
  1403. }
  1404. }
  1405. for (ggml_tensor * t = ggml_get_first_tensor(ctx.get()); t != NULL; t = ggml_get_next_tensor(ctx.get(), t)) {
  1406. if (!ggml_backend_supports_op(backend, t)) {
  1407. output_printer->print_operation(test_operation_info(op_desc(out), vars(), ggml_backend_name(backend),
  1408. test_status_t::NOT_SUPPORTED,
  1409. ggml_backend_name(backend)));
  1410. supported = false;
  1411. break;
  1412. }
  1413. if ((t->flags & GGML_TENSOR_FLAG_PARAM) && t->type != GGML_TYPE_F32) {
  1414. output_printer->print_operation(test_operation_info(op_desc(out), vars(), ggml_backend_name(backend),
  1415. test_status_t::NOT_SUPPORTED,
  1416. std::string(t->name) + "->type != FP32"));
  1417. supported = false;
  1418. break;
  1419. }
  1420. }
  1421. if (!supported) {
  1422. return true;
  1423. }
  1424. // allocate
  1425. ggml_backend_buffer_ptr buf(ggml_backend_alloc_ctx_tensors(ctx.get(), backend)); // smart ptr
  1426. if (buf == NULL) {
  1427. test_operation_info info(op_desc(out), vars(), ggml_backend_name(backend));
  1428. info.set_error("allocation", "");
  1429. output_printer->print_operation(info);
  1430. return false;
  1431. }
  1432. initialize_tensors(ctx.get()); // Randomizes all tensors (including gradients).
  1433. ggml_graph_reset(gb); // Sets gradients to 1 if loss, 0 otherwise.
  1434. ggml_status status = ggml_backend_graph_compute(backend, gf);
  1435. if (status != GGML_STATUS_SUCCESS) {
  1436. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  1437. return false;
  1438. }
  1439. status = ggml_backend_graph_compute(backend, gb);
  1440. if (status != GGML_STATUS_SUCCESS) {
  1441. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  1442. return false;
  1443. }
  1444. bool ok = true;
  1445. for (struct ggml_tensor * t = ggml_get_first_tensor(ctx.get()); t != nullptr; t = ggml_get_next_tensor(ctx.get(), t)) {
  1446. if (!(t->flags & GGML_TENSOR_FLAG_PARAM)) {
  1447. continue;
  1448. }
  1449. const char * bn = ggml_backend_name(backend);
  1450. const int64_t ne = ggml_nelements(t);
  1451. std::vector<float> ga;
  1452. struct ggml_tensor * grad = ggml_graph_get_grad(gb, t);
  1453. if (grad) {
  1454. ga = tensor_to_float(grad);
  1455. } else {
  1456. ga.resize(ne); // default value is 0.0f
  1457. }
  1458. for (int64_t i = 0; i < ne; ++i) { // gradient algebraic
  1459. // check for nans
  1460. if (!std::isfinite(ga[i])) {
  1461. test_operation_info info(op_desc(out), vars(), ggml_backend_name(backend));
  1462. info.set_gradient_info(i, bn, ga[i]);
  1463. output_printer->print_operation(info);
  1464. ok = false;
  1465. break;
  1466. }
  1467. }
  1468. if (!ok) {
  1469. break;
  1470. }
  1471. std::vector<float> gn(ne); // gradient numeric
  1472. GGML_ASSERT(ga.size() == gn.size());
  1473. std::vector<float> x0 = tensor_to_float(t); // original t data
  1474. GGML_ASSERT(ggml_is_scalar(out));
  1475. GGML_ASSERT(out->type == GGML_TYPE_F32);
  1476. const float eps = grad_eps();
  1477. for (int64_t i = 0; i < ne; ++i) {
  1478. const float xiu = x0[i] + 1.0f*eps; // x, index i, up
  1479. const float xiuh = x0[i] + 0.5f*eps; // x, index i, up half
  1480. const float xidh = x0[i] - 0.5f*eps; // x, index i, down half
  1481. const float xid = x0[i] - 1.0f*eps; // x, index i, down
  1482. float fu, fuh, fdh, fd; // output values for xiu, xiuh, xid, xidh
  1483. ggml_backend_tensor_set(t, &xiu, i*sizeof(float), sizeof(float));
  1484. status = ggml_backend_graph_compute(backend, gf);
  1485. if (status != GGML_STATUS_SUCCESS) {
  1486. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  1487. return false;
  1488. }
  1489. ggml_backend_tensor_get(out, &fu, 0, ggml_nbytes(out));
  1490. ggml_backend_tensor_set(t, &xid, i*sizeof(float), sizeof(float));
  1491. status = ggml_backend_graph_compute(backend, gf);
  1492. if (status != GGML_STATUS_SUCCESS) {
  1493. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  1494. return false;
  1495. }
  1496. ggml_backend_tensor_get(out, &fd, 0, ggml_nbytes(out));
  1497. if (grad_precise()) {
  1498. ggml_backend_tensor_set(t, &xiuh, i*sizeof(float), sizeof(float));
  1499. status = ggml_backend_graph_compute(backend, gf);
  1500. if (status != GGML_STATUS_SUCCESS) {
  1501. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  1502. return false;
  1503. }
  1504. ggml_backend_tensor_get(out, &fuh, 0, ggml_nbytes(out));
  1505. ggml_backend_tensor_set(t, &xidh, i*sizeof(float), sizeof(float));
  1506. status = ggml_backend_graph_compute(backend, gf);
  1507. if (status != GGML_STATUS_SUCCESS) {
  1508. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  1509. return false;
  1510. }
  1511. ggml_backend_tensor_get(out, &fdh, 0, ggml_nbytes(out));
  1512. gn[i] = (8.0*(double)fuh + (double)fd - (8.0*(double)fdh + (double)fu)) / (6.0*(double)eps);
  1513. } else {
  1514. gn[i] = (fu - fd) / (2.0f*eps);
  1515. }
  1516. ggml_backend_tensor_set(t, x0.data(), 0, ggml_nbytes(t));
  1517. }
  1518. const double err = mean_abs_asymm(gn.data(), ga.data(), gn.size(), expect);
  1519. if (err > max_maa_err()) {
  1520. test_operation_info info(op_desc(out), vars(), ggml_backend_name(backend));
  1521. info.set_maa_error(err, max_maa_err());
  1522. output_printer->print_operation(info);
  1523. ok = false;
  1524. break;
  1525. }
  1526. if (!ok) {
  1527. break;
  1528. }
  1529. }
  1530. // Create final test result
  1531. test_operation_info final_info(op_desc(out), vars(), ggml_backend_name(backend));
  1532. if (!ok) {
  1533. final_info.set_compare_failure();
  1534. }
  1535. final_info.status = ok ? test_status_t::OK : test_status_t::FAIL;
  1536. output_printer->print_operation(final_info);
  1537. if (ok) {
  1538. return true;
  1539. }
  1540. return false;
  1541. }
  1542. };
  1543. // ###################################
  1544. // ## Section 2: GGML Op Defintions ##
  1545. // ###################################
  1546. // The following is an example showing the bare minimum for creating a test for a GGML op.
  1547. // GGML_OP_EXAMPLE
  1548. struct test_example : public test_case {
  1549. // Always define these 2 or variants thereof:
  1550. const ggml_type type; // The type of the input tensors.
  1551. const std::array<int64_t, 4> ne; // The shape of the input tensors.
  1552. // For some ops it's necessary to define multiple types or shapes for the inputs.
  1553. // Or they may need additional parameters.
  1554. // Put all parameters needed to fully define the test into one of the VARS_TO_STR macros.
  1555. // In most cases these are just the properties of the struct that you defined above.
  1556. // This is needed for info prints.
  1557. std::string vars() override {
  1558. return VARS_TO_STR2(type, ne);
  1559. }
  1560. // Define a constructor for the struct.
  1561. // In most cases it will be sufficient to have the same arguments as the struct has properties
  1562. // and just use initializer lists.
  1563. test_example(ggml_type type = GGML_TYPE_F32,
  1564. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  1565. : type(type), ne(ne) {}
  1566. // Define how a simple GGML compute graph can be constructed for the new GGML op.
  1567. ggml_tensor * build_graph(ggml_context * ctx) override {
  1568. // Step 1: create input tensors that don't depend on any other tensors:
  1569. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1570. ggml_set_name(a, "a"); // Setting names is optional but it's useful for debugging.
  1571. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  1572. ggml_set_name(b, "b");
  1573. // Step 2: use the op that you want to test in the GGML compute graph.
  1574. ggml_tensor * out = ggml_add(ctx, a, b); // For this example we're just doing a simple addition.
  1575. ggml_set_name(out, "out");
  1576. // Step 3: return the output tensor.
  1577. return out;
  1578. }
  1579. // In order to also check the gradients for your op, add calls like ggml_set_param(a)
  1580. // immediately after you create the tensors.
  1581. // This is optional and only makes sense if a backward pass has actually been implemented for the new op.
  1582. };
  1583. // GGML_OP_UNARY
  1584. struct test_unary : public test_case {
  1585. const ggml_unary_op op;
  1586. const ggml_type type;
  1587. const std::array<int64_t, 4> ne_a;
  1588. int v; // view (1 : non-contiguous a)
  1589. std::string vars() override {
  1590. return VARS_TO_STR3(type, ne_a, v);
  1591. }
  1592. test_unary(ggml_unary_op op,
  1593. ggml_type type = GGML_TYPE_F32,
  1594. std::array<int64_t, 4> ne_a = {128, 2, 2, 2},
  1595. int v = 0)
  1596. : op(op), type(type), ne_a(ne_a), v(v) {}
  1597. ggml_tensor * build_graph(ggml_context * ctx) override {
  1598. const bool grad_supported = op == GGML_UNARY_OP_ABS || op == GGML_UNARY_OP_SGN || op == GGML_UNARY_OP_NEG ||
  1599. op == GGML_UNARY_OP_STEP || op == GGML_UNARY_OP_RELU || op == GGML_UNARY_OP_SILU ||
  1600. op == GGML_UNARY_OP_EXPM1 || op == GGML_UNARY_OP_SOFTPLUS;
  1601. ggml_tensor * a;
  1602. if (v & 1) {
  1603. auto ne = ne_a; ne[0] *= 3;
  1604. a = ggml_new_tensor(ctx, type, 4, ne.data());
  1605. if (grad_supported) {
  1606. ggml_set_param(a);
  1607. }
  1608. ggml_set_name(a, "a");
  1609. a = ggml_view_4d(ctx, a, ne_a[0], ne_a[1], ne_a[2], ne_a[3], a->nb[1], a->nb[2], a->nb[3], 0);
  1610. ggml_set_name(a, "view_of_a");
  1611. } else {
  1612. a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1613. if (grad_supported) {
  1614. ggml_set_param(a);
  1615. }
  1616. ggml_set_name(a, "a");
  1617. }
  1618. ggml_tensor * out = ggml_unary(ctx, a, op);
  1619. ggml_set_name(out, "out");
  1620. return out;
  1621. }
  1622. void initialize_tensors(ggml_context * ctx) override {
  1623. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1624. // test extended range of values to check for NaNs in GELU
  1625. init_tensor_uniform(t, -150.f, 150.f);
  1626. }
  1627. }
  1628. float grad_eps() override {
  1629. return 15.0f;
  1630. }
  1631. std::vector<float> grad_expect() override {
  1632. if (op == GGML_UNARY_OP_ABS) {
  1633. return {-1.0f, 1.0f};
  1634. }
  1635. if (op == GGML_UNARY_OP_SGN || op == GGML_UNARY_OP_STEP) {
  1636. return {0.0f};
  1637. }
  1638. if (op == GGML_UNARY_OP_RELU) {
  1639. return {0.0f, 1.0f};
  1640. }
  1641. return {};
  1642. }
  1643. };
  1644. // GGML_OP_GLU
  1645. struct test_glu : public test_case {
  1646. const ggml_glu_op op;
  1647. const ggml_type type;
  1648. const std::array<int64_t, 4> ne_a;
  1649. int v; // view (1 : non-contiguous a)
  1650. bool swapped;
  1651. std::string vars() override {
  1652. return VARS_TO_STR4(type, ne_a, v, swapped);
  1653. }
  1654. test_glu(ggml_glu_op op,
  1655. ggml_type type = GGML_TYPE_F32,
  1656. std::array<int64_t, 4> ne_a = {128, 2, 2, 2},
  1657. int v = 0,
  1658. bool swapped = false)
  1659. : op(op), type(type), ne_a(ne_a), v(v), swapped(swapped) {}
  1660. ggml_tensor * build_graph(ggml_context * ctx) override {
  1661. ggml_tensor * a;
  1662. if (v & 1) {
  1663. auto ne = ne_a; ne[0] *= 3;
  1664. a = ggml_new_tensor(ctx, type, 4, ne.data());
  1665. ggml_set_name(a, "a");
  1666. a = ggml_view_4d(ctx, a, ne_a[0], ne_a[1], ne_a[2], ne_a[3], a->nb[1], a->nb[2], a->nb[3], 0);
  1667. ggml_set_name(a, "view_of_a");
  1668. } else {
  1669. a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1670. ggml_set_name(a, "a");
  1671. }
  1672. ggml_tensor * out = ggml_glu(ctx, a, op, swapped);
  1673. ggml_set_name(out, "out");
  1674. return out;
  1675. }
  1676. void initialize_tensors(ggml_context * ctx) override {
  1677. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1678. // test extended range of values to check for NaNs in GELU
  1679. init_tensor_uniform(t, -150.f, 150.f);
  1680. }
  1681. }
  1682. };
  1683. struct test_glu_split : public test_case {
  1684. const ggml_glu_op op;
  1685. const ggml_type type;
  1686. const std::array<int64_t, 4> ne_a;
  1687. int v; // view (1 : non-contiguous a)
  1688. std::string vars() override {
  1689. return VARS_TO_STR3(type, ne_a, v) + ",split";
  1690. }
  1691. test_glu_split(ggml_glu_op op,
  1692. ggml_type type = GGML_TYPE_F32,
  1693. std::array<int64_t, 4> ne_a = {128, 2, 2, 2},
  1694. int v = 0)
  1695. : op(op), type(type), ne_a(ne_a), v(v) {}
  1696. ggml_tensor * build_graph(ggml_context * ctx) override {
  1697. ggml_tensor * a;
  1698. ggml_tensor * b;
  1699. if (v & 1) {
  1700. auto ne = ne_a; ne[0] *= 3;
  1701. a = ggml_new_tensor(ctx, type, 4, ne.data());
  1702. ggml_set_param(a);
  1703. ggml_set_name(a, "a");
  1704. a = ggml_view_4d(ctx, a, ne_a[0], ne_a[1], ne_a[2], ne_a[3], a->nb[1], a->nb[2], a->nb[3], 0);
  1705. ggml_set_name(a, "view_of_a");
  1706. b = ggml_new_tensor(ctx, type, 4, ne.data());
  1707. ggml_set_param(b);
  1708. ggml_set_name(b, "b");
  1709. b = ggml_view_4d(ctx, b, ne_a[0], ne_a[1], ne_a[2], ne_a[3], b->nb[1], b->nb[2], b->nb[3], 0);
  1710. ggml_set_name(a, "view_of_b");
  1711. } else {
  1712. a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1713. ggml_set_param(a);
  1714. ggml_set_name(a, "a");
  1715. b = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1716. ggml_set_param(b);
  1717. ggml_set_name(b, "b");
  1718. }
  1719. ggml_tensor * out = ggml_glu_split(ctx, a, b, op);
  1720. ggml_set_name(out, "out");
  1721. return out;
  1722. }
  1723. void initialize_tensors(ggml_context * ctx) override {
  1724. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1725. // test extended range of values to check for NaNs in GELU
  1726. init_tensor_uniform(t, -150.f, 150.f);
  1727. }
  1728. }
  1729. };
  1730. struct test_swiglu_oai : public test_case {
  1731. const ggml_type type;
  1732. const std::array<int64_t, 4> ne_a;
  1733. int v; // view (1 : non-contiguous a)
  1734. float alpha;
  1735. float limit;
  1736. std::string vars() override {
  1737. return VARS_TO_STR5(type, ne_a, v, alpha, limit);
  1738. }
  1739. test_swiglu_oai(ggml_type type = GGML_TYPE_F32,
  1740. std::array<int64_t, 4> ne_a = {128, 2, 2, 2},
  1741. int v = 0,
  1742. float alpha = 1.702f,
  1743. float limit = 7.0f)
  1744. : type(type), ne_a(ne_a), v(v), alpha(alpha), limit(limit) {}
  1745. ggml_tensor * build_graph(ggml_context * ctx) override {
  1746. ggml_tensor * a;
  1747. ggml_tensor * b;
  1748. if (v & 1) {
  1749. auto ne = ne_a; ne[0] *= 3;
  1750. a = ggml_new_tensor(ctx, type, 4, ne.data());
  1751. ggml_set_param(a);
  1752. ggml_set_name(a, "a");
  1753. a = ggml_view_4d(ctx, a, ne_a[0], ne_a[1], ne_a[2], ne_a[3], a->nb[1], a->nb[2], a->nb[3], 0);
  1754. ggml_set_name(a, "view_of_a");
  1755. b = ggml_new_tensor(ctx, type, 4, ne.data());
  1756. ggml_set_param(b);
  1757. ggml_set_name(b, "b");
  1758. b = ggml_view_4d(ctx, b, ne_a[0], ne_a[1], ne_a[2], ne_a[3], b->nb[1], b->nb[2], b->nb[3], 0);
  1759. ggml_set_name(a, "view_of_b");
  1760. } else {
  1761. a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1762. ggml_set_param(a);
  1763. ggml_set_name(a, "a");
  1764. b = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1765. ggml_set_param(b);
  1766. ggml_set_name(b, "b");
  1767. }
  1768. ggml_tensor * out = ggml_swiglu_oai(ctx, a, b, alpha, limit);
  1769. ggml_set_name(out, "out");
  1770. return out;
  1771. }
  1772. void initialize_tensors(ggml_context * ctx) override {
  1773. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1774. // test extended range of values to check for NaNs in GELU
  1775. init_tensor_uniform(t, -150.f, 150.f);
  1776. }
  1777. }
  1778. };
  1779. // GGML_OP_GET_ROWS
  1780. struct test_get_rows : public test_case {
  1781. const ggml_type type;
  1782. const int n; // cols
  1783. const int m; // rows
  1784. const int r; // rows to get
  1785. const int be1; // batch size
  1786. const int be2; // batch size
  1787. const bool v; // view (non-contiguous src1)
  1788. std::string vars() override {
  1789. return VARS_TO_STR7(type, n, m, r, be1, be2, v);
  1790. }
  1791. test_get_rows(ggml_type type = GGML_TYPE_F32, int n = 10, int m = 5, int r = 3, int be1 = 1, int be2 = 1, bool v = false)
  1792. : type(type), n(n), m(m), r(r), be1(be1), be2(be2), v(v) {}
  1793. ggml_tensor * build_graph(ggml_context * ctx) override {
  1794. ggml_tensor * in = ggml_new_tensor_4d(ctx, type, n, m, be1, be2);
  1795. ggml_set_name(in, "in");
  1796. ggml_tensor * rows = ggml_new_tensor_3d(ctx, GGML_TYPE_I32, r, be1, be2);
  1797. ggml_set_name(rows, "rows");
  1798. if (v) {
  1799. rows = ggml_view_3d(ctx, rows, r/2, be1, be2, rows->nb[1], rows->nb[2], 0);
  1800. ggml_set_name(rows, "view_of_rows");
  1801. }
  1802. const bool grad_supported = ggml_is_matrix(in) && ggml_is_vector(rows);
  1803. if (grad_supported) {
  1804. ggml_set_param(in);
  1805. // rows is a constant input -> no gradients
  1806. }
  1807. ggml_tensor * out = ggml_get_rows(ctx, in, rows);
  1808. ggml_set_name(out, "out");
  1809. return out;
  1810. }
  1811. void initialize_tensors(ggml_context * ctx) override {
  1812. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1813. if (t->type == GGML_TYPE_I32) {
  1814. if (ggml_is_view_op(t->op)) { continue; }
  1815. // rows
  1816. std::vector<int> data(r*be1*be2);
  1817. for (int i = 0; i < r*be1*be2; i++) {
  1818. data[i] = rand() % m;
  1819. }
  1820. ggml_backend_tensor_set(t, data.data(), 0, r * be1 * be2 * sizeof(int));
  1821. } else {
  1822. init_tensor_uniform(t);
  1823. }
  1824. }
  1825. }
  1826. };
  1827. // GGML_OP_GET_ROWS_BACK
  1828. struct test_get_rows_back : public test_case {
  1829. const ggml_type type;
  1830. const int n; // cols
  1831. const int m; // rows
  1832. const int r; // rows to get
  1833. const int b; // batch size
  1834. const bool v; // view (non-contiguous src1)
  1835. std::string vars() override {
  1836. return VARS_TO_STR6(type, n, m, r, b, v);
  1837. }
  1838. test_get_rows_back(ggml_type type = GGML_TYPE_F32, int n = 10, int m = 5, int r = 3, int b = 1, bool v = false)
  1839. : type(type), n(n), m(m), r(r), b(b), v(v) {}
  1840. ggml_tensor * build_graph(ggml_context * ctx) override {
  1841. ggml_tensor * in_forward = ggml_new_tensor_3d(ctx, type, n, m, b);
  1842. ggml_set_name(in_forward, "in_forward");
  1843. ggml_tensor * rows = ggml_new_tensor_2d(ctx, GGML_TYPE_I32, r, b);
  1844. ggml_set_name(rows, "rows");
  1845. if (v) {
  1846. rows = ggml_view_2d(ctx, rows, r/2, b, rows->nb[1], 0);
  1847. ggml_set_name(rows, "view_of_rows");
  1848. }
  1849. ggml_tensor * grad = ggml_new_tensor_3d(ctx, type, n, r, b);
  1850. ggml_set_name(grad, "grad");
  1851. ggml_tensor * out = ggml_get_rows_back(ctx, grad, rows, in_forward);
  1852. ggml_set_name(out, "out");
  1853. return out;
  1854. }
  1855. void initialize_tensors(ggml_context * ctx) override {
  1856. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1857. if (t->type == GGML_TYPE_I32) {
  1858. if (ggml_is_view_op(t->op)) { continue; }
  1859. // rows
  1860. std::vector<int> data(r*b);
  1861. for (int i = 0; i < r*b; i++) {
  1862. data[i] = rand() % m;
  1863. }
  1864. ggml_backend_tensor_set(t, data.data(), 0, r * b * sizeof(int));
  1865. } else {
  1866. init_tensor_uniform(t);
  1867. }
  1868. }
  1869. }
  1870. };
  1871. static void init_set_rows_row_ids(ggml_tensor * t, int num_rows) {
  1872. std::random_device rd;
  1873. std::default_random_engine rng(rd());
  1874. for (int i2 = 0; i2 < t->ne[2]; i2++) {
  1875. for (int i1 = 0; i1 < t->ne[1]; i1++) {
  1876. // generate a shuffled subset of row indices
  1877. std::vector<int64_t> data(num_rows);
  1878. for (int i = 0; i < num_rows; i++) {
  1879. data[i] = i;
  1880. }
  1881. std::shuffle(data.begin(), data.end(), rng);
  1882. data.resize(t->ne[0]);
  1883. const size_t offs = i1*t->nb[1] + i2*t->nb[2];
  1884. if (t->type == GGML_TYPE_I32) {
  1885. // TODO: Make a template or something
  1886. std::vector<int32_t> data_i32(t->ne[0]);
  1887. for (int i = 0; i < t->ne[0]; i++) {
  1888. data_i32[i] = static_cast<int32_t>(data[i]);
  1889. }
  1890. ggml_backend_tensor_set(t, data_i32.data(), offs, t->ne[0]*sizeof(int32_t));
  1891. } else {
  1892. ggml_backend_tensor_set(t, data.data(), offs, t->ne[0]*sizeof(int64_t));
  1893. }
  1894. }
  1895. }
  1896. }
  1897. // GGML_OP_SET_ROWS
  1898. struct test_set_rows : public test_case {
  1899. const ggml_type type;
  1900. const ggml_type type_idx;
  1901. const std::array<int64_t, 4> ne;
  1902. const std::array<int, 2> nr23; // broadcast only dims 2 and 3
  1903. const int r; // rows to set
  1904. const bool v; // view (non-contiguous src1)
  1905. std::string vars() override {
  1906. return VARS_TO_STR6(type, type_idx, ne, nr23, r, v);
  1907. }
  1908. test_set_rows(ggml_type type,
  1909. ggml_type type_idx,
  1910. std::array<int64_t, 4> ne,
  1911. std::array<int, 2> nr23,
  1912. int r, bool v = false)
  1913. : type(type), type_idx(type_idx), ne(ne), nr23(nr23), r(r), v(v) {}
  1914. ggml_tensor * build_graph(ggml_context * ctx) override {
  1915. ggml_tensor * dst = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2]*nr23[0], ne[3]*nr23[1]);
  1916. ggml_set_name(dst, "dst");
  1917. ggml_tensor * src = ggml_new_tensor_4d(ctx, GGML_TYPE_F32, ne[0], r, ne[2]*nr23[0], ne[3]*nr23[1]);
  1918. ggml_set_name(src, "src");
  1919. ggml_tensor * row_idxs = ggml_new_tensor_3d(ctx, type_idx, r, ne[2], ne[3]);
  1920. ggml_set_name(row_idxs, "row_idxs");
  1921. if (v) {
  1922. src = ggml_view_4d(ctx, src, ne[0], r/2, ne[2]*nr23[0], ne[3]*nr23[1], src->nb[1], src->nb[2], src->nb[3], 0);
  1923. row_idxs = ggml_view_3d(ctx, row_idxs, r/2, ne[2], ne[3], row_idxs->nb[1], row_idxs->nb[2], 0);
  1924. ggml_set_name(row_idxs, "view_of_rows");
  1925. }
  1926. ggml_tensor * out = ggml_set_rows(ctx, dst, src, row_idxs);
  1927. ggml_set_name(out, "out");
  1928. return out;
  1929. }
  1930. void initialize_tensors(ggml_context * ctx) override {
  1931. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1932. if (t->type == GGML_TYPE_I64 || t->type == GGML_TYPE_I32) {
  1933. if (ggml_is_view_op(t->op)) {
  1934. continue;
  1935. }
  1936. init_set_rows_row_ids(t, ne[1]);
  1937. } else {
  1938. init_tensor_uniform(t);
  1939. }
  1940. }
  1941. }
  1942. double max_nmse_err() override {
  1943. if (type == GGML_TYPE_Q4_0 || type == GGML_TYPE_Q4_1 || type == GGML_TYPE_IQ4_NL ||
  1944. type == GGML_TYPE_Q5_0 || type == GGML_TYPE_Q5_1 || type == GGML_TYPE_Q8_0) {
  1945. // estimate what the max nmse error would be if one quantized value is
  1946. // off by one. The test values are distributed in [-1,1], so it'll be
  1947. // roughly (2.0 / 2^bits)^2, divided by the mean square value of the reference,
  1948. // which is roughly 0.25 times the number of elements.
  1949. double err_estimate = 1.0f/8.0f;
  1950. if (type == GGML_TYPE_Q5_0 || type == GGML_TYPE_Q5_1) {
  1951. err_estimate /= 2.0f;
  1952. }
  1953. if (type == GGML_TYPE_Q8_0) {
  1954. err_estimate /= 8.0f;
  1955. }
  1956. err_estimate *= err_estimate;
  1957. err_estimate /= 0.25f*float(ne[0] * r * ne[2]*nr23[0] * ne[3]*nr23[1]);
  1958. return err_estimate;
  1959. }
  1960. return 1e-7;
  1961. }
  1962. };
  1963. // GGML_OP_ROPE + GGML_OP_VIEW + GGML_OP_SET_ROWS
  1964. struct test_rope_set_rows : public test_case {
  1965. const ggml_type type;
  1966. const ggml_type type_idx;
  1967. const std::array<int64_t, 4> ne_a;
  1968. int mode;
  1969. const int n_ctx{512};
  1970. const int n_dims{128};
  1971. std::string vars() override {
  1972. return VARS_TO_STR4(type, type_idx, ne_a, mode);
  1973. }
  1974. std::string op_desc(ggml_tensor * t) override {
  1975. GGML_UNUSED(t);
  1976. return "ROPE_SET_ROWS";
  1977. }
  1978. bool run_whole_graph() override { return true; }
  1979. test_rope_set_rows(ggml_type type,
  1980. ggml_type type_idx,
  1981. std::array<int64_t, 4> ne_a,
  1982. int mode)
  1983. : type(type), type_idx(type_idx), ne_a(ne_a), mode(mode) {}
  1984. ggml_tensor * build_graph(ggml_context * ctx) override {
  1985. ggml_tensor * a = ggml_new_tensor_4d(ctx, GGML_TYPE_F32, ne_a[0], ne_a[1], ne_a[2], 1);
  1986. ggml_set_name(a, "a");
  1987. const bool is_mrope = mode & GGML_ROPE_TYPE_MROPE;
  1988. const bool is_vision = mode == GGML_ROPE_TYPE_VISION;
  1989. ggml_tensor * pos;
  1990. if (is_mrope || is_vision) {
  1991. pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, ne_a[2] * 4);
  1992. } else {
  1993. pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, ne_a[2]);
  1994. }
  1995. ggml_set_name(pos, "pos");
  1996. float fs = 1.4245f;
  1997. float ef = 0.7465f;
  1998. float af = 1.4245f;
  1999. ggml_tensor * freq = nullptr;
  2000. ggml_tensor * rope = nullptr;
  2001. if (is_mrope) {
  2002. if (is_vision) {
  2003. GGML_ASSERT(n_dims/4 > 0);
  2004. int rope_sections[4] = {n_dims/4, n_dims/4, 0, 0}; // Vision-RoPE only use first two dimension for image (x, y) coordinate
  2005. rope = ggml_rope_multi(ctx, a, pos, freq, n_dims/2, rope_sections, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  2006. } else {
  2007. GGML_ASSERT(n_dims/3 > 0);
  2008. int rope_sections[4] = {n_dims/3, n_dims/3, n_dims/3, 0};
  2009. rope = ggml_rope_multi(ctx, a, pos, freq, n_dims, rope_sections, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  2010. }
  2011. } else {
  2012. rope = ggml_rope(ctx, a, pos, ne_a[0], mode);
  2013. }
  2014. ggml_tensor * view = ggml_view_2d(ctx, rope, ne_a[0] * ne_a[1], ne_a[2], rope->nb[2], 0);
  2015. ggml_tensor * dst = ggml_new_tensor_4d(ctx, type, ne_a[0] * ne_a[1], ne_a[2] * ne_a[3], 1, 1);
  2016. ggml_set_name(dst, "dst");
  2017. ggml_tensor * row_idxs = ggml_new_tensor_3d(ctx, type_idx, ne_a[2], 1, 1);
  2018. ggml_set_name(row_idxs, "row_idxs");
  2019. ggml_tensor * out = ggml_set_rows(ctx, dst, view, row_idxs);
  2020. ggml_set_name(out, "out");
  2021. return out;
  2022. }
  2023. void initialize_tensors(ggml_context * ctx) override {
  2024. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2025. if (strcmp(t->name, "row_idxs") == 0) {
  2026. if (ggml_is_view_op(t->op)) {
  2027. continue;
  2028. }
  2029. init_set_rows_row_ids(t, ne_a[2]);
  2030. } else if (t->type == GGML_TYPE_I32) {
  2031. // pos
  2032. const int num_pos_ids = (mode & GGML_ROPE_TYPE_MROPE) ? ne_a[2] * 4 : ne_a[2];
  2033. std::vector<int> data(num_pos_ids);
  2034. for (int i = 0; i < num_pos_ids; i++) {
  2035. data[i] = rand() % n_ctx;
  2036. }
  2037. ggml_backend_tensor_set(t, data.data(), 0, num_pos_ids * sizeof(int));
  2038. } else {
  2039. if (t->ne[0] == n_dims/2) {
  2040. // frequency factors in the range [0.9f, 1.1f]
  2041. init_tensor_uniform(t, 0.9f, 1.1f);
  2042. } else {
  2043. init_tensor_uniform(t);
  2044. }
  2045. }
  2046. }
  2047. }
  2048. };
  2049. // GGML_OP_RMS_NORM + GGML_OP_MUL + GGML_OP_ROPE (+ GGML_OP_VIEW + GGML_OP_SET_ROWS)
  2050. struct test_rms_norm_mul_rope : public test_case {
  2051. const std::array<int64_t, 4> ne;
  2052. const float eps;
  2053. const bool multi_add; // test a sequence of adds feeding into rms_norm
  2054. const bool set_rows;
  2055. int mode;
  2056. std::string op_desc(ggml_tensor * t) override {
  2057. GGML_UNUSED(t);
  2058. return "RMS_NORM_MUL_ROPE";
  2059. }
  2060. bool run_whole_graph() override { return true; }
  2061. std::string vars() override {
  2062. return VARS_TO_STR5(ne, eps, multi_add, set_rows, mode);
  2063. }
  2064. test_rms_norm_mul_rope(std::array<int64_t, 4> ne, float eps = 1e-6f, bool multi_add = false,
  2065. bool set_rows = false, int mode = GGML_ROPE_TYPE_NORMAL)
  2066. : ne(ne), eps(eps), multi_add(multi_add), set_rows(set_rows), mode(mode) {}
  2067. ggml_tensor * build_graph(ggml_context * ctx) override {
  2068. ggml_tensor * a = ggml_new_tensor_4d(ctx, GGML_TYPE_F32, ne[0], ne[1], ne[2], 1);
  2069. ggml_tensor * b = ggml_new_tensor_4d(ctx, GGML_TYPE_F32, ne[0], ne[1], ne[2], 1);
  2070. ggml_tensor * c = ggml_new_tensor_4d(ctx, GGML_TYPE_F32, ne[0], ne[1], ne[2], 1);
  2071. if (multi_add) {
  2072. a = ggml_add(ctx, ggml_add(ctx, a, b), c);
  2073. }
  2074. a = ggml_mul(ctx, ggml_rms_norm(ctx, a, eps), b);
  2075. ggml_tensor * pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, ne[2]);
  2076. ggml_tensor * rope = ggml_rope(ctx, a, pos, ne[0], mode);
  2077. ggml_tensor * out;
  2078. if (set_rows) {
  2079. ggml_tensor * view = ggml_view_2d(ctx, rope, ne[0] * ne[1], ne[2], rope->nb[2], 0);
  2080. ggml_tensor * dst = ggml_new_tensor_4d(ctx, GGML_TYPE_F16, ne[0] * ne[1], ne[2] * ne[3], 1, 1);
  2081. ggml_set_name(dst, "dst");
  2082. ggml_tensor * row_idxs = ggml_new_tensor_3d(ctx, GGML_TYPE_I64, ne[2], 1, 1);
  2083. ggml_set_name(row_idxs, "row_idxs");
  2084. out = ggml_set_rows(ctx, dst, view, row_idxs);
  2085. ggml_set_name(out, "out");
  2086. } else {
  2087. out = rope;
  2088. }
  2089. return out;
  2090. }
  2091. void initialize_tensors(ggml_context * ctx) override {
  2092. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2093. if (t->type == GGML_TYPE_I64 || t->type == GGML_TYPE_I32) {
  2094. if (ggml_is_view_op(t->op)) {
  2095. continue;
  2096. }
  2097. init_set_rows_row_ids(t, ne[2]);
  2098. } else {
  2099. init_tensor_uniform(t);
  2100. }
  2101. }
  2102. }
  2103. };
  2104. // GGML_OP_ARGMAX
  2105. struct test_argmax : public test_case {
  2106. const ggml_type type;
  2107. const std::array<int64_t, 4> ne;
  2108. std::string vars() override {
  2109. return VARS_TO_STR2(type, ne);
  2110. }
  2111. test_argmax(ggml_type type = GGML_TYPE_F32,
  2112. std::array<int64_t, 4> ne = {10, 100, 1, 1})
  2113. : type(type), ne(ne) {}
  2114. ggml_tensor * build_graph(ggml_context * ctx) override {
  2115. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2116. ggml_set_name(a, "a");
  2117. ggml_tensor * out = ggml_argmax(ctx, a);
  2118. ggml_set_name(out, "out");
  2119. return out;
  2120. }
  2121. void initialize_tensors(ggml_context * ctx) override {
  2122. std::random_device rd;
  2123. std::default_random_engine rng(rd());
  2124. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2125. if (t->type == GGML_TYPE_F32) {
  2126. // initialize with unique values to avoid ties
  2127. for (int64_t r = 0; r < ggml_nrows(t); r++) {
  2128. std::vector<float> data(t->ne[0]);
  2129. for (int i = 0; i < t->ne[0]; i++) {
  2130. data[i] = i;
  2131. }
  2132. std::shuffle(data.begin(), data.end(), rng);
  2133. ggml_backend_tensor_set(t, data.data(), r * t->nb[1], t->ne[0] * sizeof(float));
  2134. }
  2135. } else {
  2136. init_tensor_uniform(t);
  2137. }
  2138. }
  2139. }
  2140. double max_nmse_err() override {
  2141. return 0.0;
  2142. }
  2143. };
  2144. // GGML_OP_COUNT_EQUAL
  2145. struct test_count_equal : public test_case {
  2146. const ggml_type type;
  2147. const std::array<int64_t, 4> ne;
  2148. std::string vars() override {
  2149. return VARS_TO_STR2(type, ne);
  2150. }
  2151. test_count_equal(ggml_type type = GGML_TYPE_F32,
  2152. std::array<int64_t, 4> ne = {4, 500, 1, 1})
  2153. : type(type), ne(ne) {}
  2154. ggml_tensor * build_graph(ggml_context * ctx) override {
  2155. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2156. ggml_set_name(a, "a");
  2157. ggml_tensor * a_argmax = ggml_argmax(ctx, a);
  2158. ggml_set_name(a_argmax, "a_argmax");
  2159. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  2160. ggml_set_name(b, "b");
  2161. ggml_tensor * b_argmax = ggml_argmax(ctx, b);
  2162. ggml_set_name(b_argmax, "b_argmax");
  2163. ggml_tensor * out = ggml_count_equal(ctx, a_argmax, b_argmax);
  2164. ggml_set_name(out, "out");
  2165. return out;
  2166. }
  2167. double max_nmse_err() override {
  2168. return 0.0;
  2169. }
  2170. void initialize_tensors(ggml_context * ctx) override {
  2171. std::random_device rd;
  2172. std::default_random_engine rng(rd());
  2173. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2174. if (t->type == GGML_TYPE_F32) {
  2175. // initialize with unique values to avoid ties
  2176. for (int64_t r = 0; r < ggml_nrows(t); r++) {
  2177. std::vector<float> data(t->ne[0]);
  2178. for (int i = 0; i < t->ne[0]; i++) {
  2179. data[i] = i;
  2180. }
  2181. std::shuffle(data.begin(), data.end(), rng);
  2182. ggml_backend_tensor_set(t, data.data(), r * t->nb[1], t->ne[0] * sizeof(float));
  2183. }
  2184. } else {
  2185. init_tensor_uniform(t);
  2186. }
  2187. }
  2188. }
  2189. };
  2190. // GGML_OP_REPEAT
  2191. struct test_repeat : public test_case {
  2192. const ggml_type type;
  2193. const std::array<int64_t, 4> ne;
  2194. const std::array<int, 4> nr;
  2195. std::string vars() override {
  2196. return VARS_TO_STR3(type, ne, nr);
  2197. }
  2198. size_t op_size(ggml_tensor * t) override {
  2199. return ggml_nbytes(t) * 2;
  2200. }
  2201. test_repeat(ggml_type type = GGML_TYPE_F32,
  2202. std::array<int64_t, 4> ne = {10, 5, 4, 3},
  2203. std::array<int, 4> nr = {2, 2, 2, 2})
  2204. : type(type), ne(ne), nr(nr) {}
  2205. ggml_tensor * build_graph(ggml_context * ctx) override {
  2206. ggml_tensor * target = ggml_new_tensor_4d(ctx, type, ne[0]*nr[0], ne[1]*nr[1], ne[2]*nr[2], ne[3]*nr[3]);
  2207. ggml_set_name(target, "target");
  2208. ggml_tensor * src = ggml_new_tensor(ctx, type, 4, ne.data());
  2209. ggml_set_param(src);
  2210. ggml_set_name(src, "src");
  2211. ggml_tensor * out = ggml_repeat(ctx, src, target);
  2212. ggml_set_name(out, "out");
  2213. return out;
  2214. }
  2215. };
  2216. // GGML_OP_REPEAT_BACK
  2217. struct test_repeat_back : public test_case {
  2218. const ggml_type type;
  2219. const std::array<int64_t, 4> ne;
  2220. const std::array<int, 4> nr;
  2221. const bool v; // whether src is a noncontiguous view
  2222. std::string vars() override {
  2223. return VARS_TO_STR4(type, ne, nr, v);
  2224. }
  2225. size_t op_size(ggml_tensor * t) override {
  2226. return ggml_nbytes(t) * 2;
  2227. }
  2228. test_repeat_back(ggml_type type = GGML_TYPE_F32,
  2229. std::array<int64_t, 4> ne = {8, 6, 4, 2},
  2230. std::array<int, 4> nr = {2, 2, 2, 2},
  2231. bool v = false)
  2232. : type(type), ne(ne), nr(nr), v(v) {}
  2233. ggml_tensor * build_graph(ggml_context * ctx) override {
  2234. ggml_tensor * src = ggml_new_tensor_4d(ctx, type, ne[0]*nr[0], ne[1]*nr[1], ne[2]*nr[2], ne[3]*nr[3]);
  2235. ggml_set_name(src, "src");
  2236. if (v) {
  2237. GGML_ASSERT(ne[0] % 2 == 0);
  2238. GGML_ASSERT(ne[1] % 2 == 0);
  2239. GGML_ASSERT(ne[2] % 2 == 0);
  2240. GGML_ASSERT(ne[3] % 2 == 0);
  2241. GGML_ASSERT(nr[0] % 2 == 0 || nr[0] == 1);
  2242. GGML_ASSERT(nr[1] % 2 == 0 || nr[1] == 1);
  2243. GGML_ASSERT(nr[2] % 2 == 0 || nr[2] == 1);
  2244. GGML_ASSERT(nr[3] % 2 == 0 || nr[3] == 1);
  2245. const int64_t ne00 = nr[0] == 1 ? src->ne[0] : src->ne[0] / 2;
  2246. const int64_t ne01 = nr[1] == 1 ? src->ne[1] : src->ne[1] / 2;
  2247. const int64_t ne02 = nr[2] == 1 ? src->ne[2] : src->ne[2] / 2;
  2248. const int64_t ne03 = nr[3] == 1 ? src->ne[3] : src->ne[3] / 2;
  2249. src = ggml_view_4d(ctx, src, ne00, ne01, ne02, ne03, src->nb[1], src->nb[2], src->nb[3], 0);
  2250. }
  2251. ggml_tensor * target = ggml_new_tensor(ctx, type, 4, ne.data());
  2252. ggml_set_name(target, "target");
  2253. ggml_tensor * out = ggml_repeat_back(ctx, src, target);
  2254. ggml_set_name(out, "out");
  2255. return out;
  2256. }
  2257. };
  2258. // GGML_OP_DUP
  2259. struct test_dup : public test_case {
  2260. const ggml_type type;
  2261. const std::array<int64_t, 4> ne;
  2262. const std::array<int64_t, 4> permute;
  2263. bool _use_permute;
  2264. std::string vars() override {
  2265. std::string v = VARS_TO_STR2(type, ne);
  2266. if (_use_permute) v += "," + VAR_TO_STR(permute);
  2267. return v;
  2268. }
  2269. test_dup(ggml_type type = GGML_TYPE_F32,
  2270. std::array<int64_t, 4> ne = {10, 10, 20, 1},
  2271. std::array<int64_t, 4> permute = {0, 0, 0, 0})
  2272. : type(type), ne(ne), permute(permute),
  2273. _use_permute(permute[0] + permute[1] + permute[2] + permute[3] > 0) {}
  2274. ggml_tensor * build_graph(ggml_context * ctx) override {
  2275. ggml_tensor * src = ggml_new_tensor(ctx, type, 4, ne.data());
  2276. ggml_set_param(src);
  2277. ggml_set_name(src, "src");
  2278. if (_use_permute) {
  2279. src = ggml_permute(ctx, src, permute[0], permute[1], permute[2], permute[3]);
  2280. ggml_set_name(src, "src_permuted");
  2281. }
  2282. ggml_tensor * out = ggml_dup(ctx, src);
  2283. ggml_set_name(out, "out");
  2284. return out;
  2285. }
  2286. };
  2287. // GGML_OP_SET
  2288. struct test_set : public test_case {
  2289. const ggml_type type_src;
  2290. const ggml_type type_dst;
  2291. const std::array<int64_t, 4> ne;
  2292. const int dim;
  2293. std::string vars() override {
  2294. return VARS_TO_STR4(type_src, type_dst, ne, dim);
  2295. }
  2296. size_t op_size(ggml_tensor * t) override {
  2297. return ggml_nbytes(t) + ggml_nbytes(t->src[0]);
  2298. }
  2299. test_set(ggml_type type_src = GGML_TYPE_F32, ggml_type type_dst = GGML_TYPE_F32,
  2300. std::array<int64_t, 4> ne = {6, 5, 4, 3}, int dim = 1)
  2301. : type_src(type_src), type_dst(type_dst), ne(ne), dim(dim) {}
  2302. ggml_tensor * build_graph(ggml_context * ctx) override {
  2303. ggml_tensor * src = ggml_new_tensor(ctx, type_src, 4, ne.data());
  2304. ggml_set_param(src);
  2305. ggml_set_name(src, "src");
  2306. auto ne_dst = ne;
  2307. for (int i = 0; i < dim; ++i) {
  2308. ne_dst[i] *= 2;
  2309. }
  2310. ggml_tensor* dst = ggml_new_tensor(ctx, type_dst, 4, ne_dst.data());
  2311. ggml_set_param(dst);
  2312. ggml_set_name(dst, "dst");
  2313. size_t offset = 0;
  2314. for (int i = 0; i < dim; ++i) {
  2315. offset += ((ne_dst[i] - ne[i])/2)*dst->nb[i];
  2316. }
  2317. ggml_tensor * out = ggml_set(ctx, dst, src,
  2318. // The backward pass requires setting a contiguous region:
  2319. src->nb[1], src->nb[2], src->nb[3], offset);
  2320. ggml_set_name(out, "out");
  2321. return out;
  2322. }
  2323. };
  2324. // GGML_OP_CPY
  2325. struct test_cpy : public test_case {
  2326. const ggml_type type_src;
  2327. const ggml_type type_dst;
  2328. const std::array<int64_t, 4> ne;
  2329. const std::array<int64_t, 4> permute_src;
  2330. const std::array<int64_t, 4> permute_dst;
  2331. bool _src_use_permute;
  2332. bool _dst_use_permute;
  2333. bool _src_transpose;
  2334. std::string vars() override {
  2335. return VARS_TO_STR6(type_src, type_dst, ne, permute_src, permute_dst, _src_transpose);
  2336. }
  2337. double max_nmse_err() override {
  2338. if (type_src == type_dst) {
  2339. return 0.0;
  2340. }
  2341. if (type_dst == GGML_TYPE_Q4_0 || type_dst == GGML_TYPE_Q4_1 || type_dst == GGML_TYPE_IQ4_NL ||
  2342. type_dst == GGML_TYPE_Q5_0 || type_dst == GGML_TYPE_Q5_1 || type_dst == GGML_TYPE_Q8_0) {
  2343. // estimate what the max nmse error would be if one quantized value is
  2344. // off by one. The test values are distributed in [-150,150], so it'll be
  2345. // roughly (150*2.0 / 2^bits)^2, divided by the mean square value of the reference,
  2346. // which is roughly 0.25*150^2 times the number of elements.
  2347. double err_estimate = 1.0f/8.0f * 150.0f;
  2348. if (type_dst == GGML_TYPE_IQ4_NL) {
  2349. // iq4_nl values are a bit more spread out
  2350. err_estimate *= 2.0f;
  2351. }
  2352. if (type_dst == GGML_TYPE_Q5_0 || type_dst == GGML_TYPE_Q5_1) {
  2353. err_estimate /= 2.0f;
  2354. }
  2355. if (type_dst == GGML_TYPE_Q8_0) {
  2356. err_estimate /= 8.0f;
  2357. }
  2358. err_estimate *= err_estimate;
  2359. err_estimate /= (150.0f*150.0f*0.25f)*float(ne[0] * ne[1] * ne[2] * ne[3]);
  2360. return err_estimate;
  2361. }
  2362. return 1e-6;
  2363. }
  2364. size_t op_size(ggml_tensor * t) override {
  2365. return ggml_nbytes(t) + ggml_nbytes(t->src[0]);
  2366. }
  2367. test_cpy(ggml_type type_src = GGML_TYPE_F32, ggml_type type_dst = GGML_TYPE_F32,
  2368. std::array<int64_t, 4> ne = {10, 10, 10, 1},
  2369. std::array<int64_t, 4> permute_src = {0, 0, 0, 0},
  2370. std::array<int64_t, 4> permute_dst = {0, 0, 0, 0},
  2371. bool transpose_src = false)
  2372. : type_src(type_src), type_dst(type_dst), ne(ne), permute_src(permute_src), permute_dst(permute_dst),
  2373. _src_use_permute(permute_src[0] + permute_src[1] + permute_src[2] + permute_src[3] > 0),
  2374. _dst_use_permute(permute_dst[0] + permute_dst[1] + permute_dst[2] + permute_dst[3] > 0),
  2375. _src_transpose(transpose_src){}
  2376. ggml_tensor * build_graph(ggml_context * ctx) override {
  2377. ggml_tensor * src = ggml_new_tensor(ctx, type_src, 4, ne.data());
  2378. ggml_set_param(src);
  2379. ggml_set_name(src, "src");
  2380. if (_src_use_permute) {
  2381. src = ggml_permute(ctx, src, permute_src[0], permute_src[1], permute_src[2], permute_src[3]);
  2382. ggml_set_name(src, "src_permuted");
  2383. }
  2384. if (_src_transpose) {
  2385. src = ggml_transpose(ctx, src);
  2386. ggml_set_name(src, "src_transposed");
  2387. }
  2388. ggml_tensor * dst = ggml_new_tensor(ctx, type_dst, 4, src->ne);
  2389. ggml_set_name(dst, "dst");
  2390. if (_dst_use_permute) {
  2391. dst = ggml_permute(ctx, dst, permute_dst[0], permute_dst[1], permute_dst[2], permute_dst[3]);
  2392. ggml_set_name(dst, "dst_permuted");
  2393. }
  2394. ggml_tensor * out = ggml_cpy(ctx, src, dst);
  2395. ggml_set_name(out, "out");
  2396. return out;
  2397. }
  2398. void initialize_tensors(ggml_context * ctx) override {
  2399. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2400. // test extended range of values to check if casting between f32 and i32 is consistent
  2401. init_tensor_uniform(t, -150.f, 150.f);
  2402. }
  2403. }
  2404. };
  2405. // GGML_OP_CONT
  2406. struct test_cont : public test_case {
  2407. const ggml_type type;
  2408. const std::array<int64_t, 4> ne;
  2409. bool use_view_slice;
  2410. std::string vars() override {
  2411. return VARS_TO_STR3(type, ne, use_view_slice);
  2412. }
  2413. test_cont(ggml_type type = GGML_TYPE_F32,
  2414. std::array<int64_t, 4> ne = {10, 10, 10, 1},
  2415. bool use_view_slice = false)
  2416. : type(type), ne(ne), use_view_slice(use_view_slice) {}
  2417. ggml_tensor * build_graph(ggml_context * ctx) override {
  2418. ggml_tensor * src = ggml_new_tensor(ctx, type, 4, ne.data());
  2419. ggml_set_param(src);
  2420. ggml_set_name(src, "src");
  2421. ggml_tensor * dst;
  2422. if (use_view_slice) {
  2423. dst = ggml_view_4d(ctx, src, src->ne[0], 1, src->ne[2], src->ne[3],
  2424. src->nb[1], src->nb[2], src->nb[3], src->nb[0] * (src->ne[1] - 1));
  2425. ggml_set_name(dst, "src_view_slice");
  2426. } else {
  2427. dst = ggml_transpose(ctx, src);
  2428. ggml_set_name(dst, "src_transposed");
  2429. }
  2430. ggml_tensor * out = ggml_cont(ctx, dst);
  2431. ggml_set_name(out, "out");
  2432. return out;
  2433. }
  2434. };
  2435. // GGML_OP_ADD
  2436. // GGML_OP_SUB
  2437. // GGML_OP_MUL
  2438. // GGML_OP_DIV
  2439. struct test_bin_bcast : public test_case {
  2440. using op_t = ggml_tensor * (*) (ggml_context *, ggml_tensor *, ggml_tensor *);
  2441. op_t op;
  2442. const ggml_type type;
  2443. const std::array<int64_t, 4> ne;
  2444. const std::array<int, 4> nr;
  2445. int nf; // number of fused ops, nf == 1 -> single op (no fusion)
  2446. bool run_whole_graph() override { return nf > 1; }
  2447. std::string vars() override {
  2448. return VARS_TO_STR4(type, ne, nr, nf);
  2449. }
  2450. size_t op_size(ggml_tensor * t) override {
  2451. return ggml_nbytes(t) * 3;
  2452. }
  2453. test_bin_bcast(op_t op, ggml_type type = GGML_TYPE_F32,
  2454. std::array<int64_t, 4> ne = {10, 10, 1, 1},
  2455. std::array<int, 4> nr = {1, 2, 1, 1},
  2456. int nf = 1)
  2457. : op(op), type(type), ne(ne), nr(nr), nf(nf) {}
  2458. ggml_tensor * build_graph(ggml_context * ctx) override {
  2459. GGML_ASSERT(nf <= 16);
  2460. ggml_tensor * a = ggml_new_tensor_4d(ctx, type, ne[0]*nr[0], ne[1]*nr[1], ne[2]*nr[2], ne[3]*nr[3]);
  2461. ggml_set_name(a, "a");
  2462. ggml_tensor * b[16];
  2463. for (int i = 0; i < nf; ++i) {
  2464. b[i] = ggml_new_tensor(ctx, type, 4, ne.data());
  2465. ggml_set_name(b[i], (std::string("b") + std::to_string(i)).c_str());
  2466. }
  2467. // The backward pass supports broadcasting only for GGML_ADD:
  2468. const bool grad_supported = op == ggml_add && ggml_are_same_shape(a, b[0]) && nf == 1;
  2469. if (grad_supported) {
  2470. ggml_set_param(a);
  2471. ggml_set_param(b[0]);
  2472. }
  2473. ggml_tensor * out = a;
  2474. for (int i = 0; i < nf; ++i) {
  2475. out = op(ctx, out, b[i]);
  2476. }
  2477. ggml_set_name(out, "out");
  2478. return out;
  2479. }
  2480. void initialize_tensors(ggml_context * ctx) override {
  2481. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2482. if (op == ggml_mul || op == ggml_div) {
  2483. // MUL and DIV have numerical issues around zero:
  2484. init_tensor_uniform(t, 0.9f, 1.1f);
  2485. } else {
  2486. init_tensor_uniform(t);
  2487. }
  2488. }
  2489. }
  2490. float grad_eps() override {
  2491. return 0.1f * (op == ggml_mul ? ne[0]*ne[1]*ne[2]*ne[3] : 1);
  2492. }
  2493. bool grad_precise() override {
  2494. return op == ggml_div;
  2495. }
  2496. double max_maa_err() override {
  2497. return op == ggml_add ? 1e-4 : 1e-3;
  2498. }
  2499. };
  2500. // GGML_OP_ADD_ID
  2501. struct test_add_id : public test_case {
  2502. const ggml_type type_a;
  2503. const ggml_type type_b;
  2504. const int64_t n_embd;
  2505. const int64_t n_experts;
  2506. const int64_t n_experts_used;
  2507. const int64_t n_token;
  2508. std::string vars() override {
  2509. return VARS_TO_STR6(type_a, type_b, n_embd, n_experts, n_experts_used, n_token);
  2510. }
  2511. size_t op_size(ggml_tensor * t) override {
  2512. return ggml_nbytes(t) + ggml_nbytes(t->src[0]) + ggml_nbytes(t->src[2]);
  2513. }
  2514. test_add_id(ggml_type type_a = GGML_TYPE_F32,
  2515. ggml_type type_b = GGML_TYPE_F32,
  2516. int64_t n_embd = 128,
  2517. int64_t n_experts = 16,
  2518. int64_t n_experts_used = 8,
  2519. int64_t n_token = 10)
  2520. : type_a(type_a), type_b(type_b), n_embd(n_embd),
  2521. n_experts(n_experts), n_experts_used(n_experts_used), n_token(n_token) {}
  2522. ggml_tensor * build_graph(ggml_context * ctx) override {
  2523. ggml_tensor * a = ggml_new_tensor_3d(ctx, type_a, n_embd, n_experts_used, n_token);
  2524. ggml_tensor * b = ggml_new_tensor_2d(ctx, type_b, n_embd, n_experts);
  2525. ggml_tensor * ids = ggml_new_tensor_2d(ctx, GGML_TYPE_I32, n_experts, n_token);
  2526. if (n_experts_used != n_experts) {
  2527. ids = ggml_view_2d(ctx, ids, n_experts_used, n_token, ids->nb[1], 0);
  2528. ggml_set_name(ids, "view_of_ids");
  2529. }
  2530. ggml_tensor * out = ggml_add_id(ctx, a, b, ids);
  2531. ggml_set_name(out, "out");
  2532. return out;
  2533. }
  2534. void initialize_tensors(ggml_context * ctx) override {
  2535. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2536. if (t->type == GGML_TYPE_I32) {
  2537. if (ggml_is_view_op(t->op)) { continue; }
  2538. std::random_device rd;
  2539. std::default_random_engine rng(rd());
  2540. // ids
  2541. for (int64_t r = 0; r < ggml_nrows(t); r++) {
  2542. std::vector<int32_t> data(t->ne[0]);
  2543. for (int i = 0; i < t->ne[0]; i++) {
  2544. data[i] = i % n_experts;
  2545. }
  2546. std::shuffle(data.begin(), data.end(), rng);
  2547. ggml_backend_tensor_set(t, data.data(), r * t->nb[1], t->ne[0] * sizeof(int32_t));
  2548. }
  2549. } else {
  2550. init_tensor_uniform(t);
  2551. }
  2552. }
  2553. }
  2554. };
  2555. // GGML_OP_ADD1
  2556. struct test_add1 : public test_case {
  2557. const ggml_type type;
  2558. const std::array<int64_t, 4> ne;
  2559. std::string vars() override {
  2560. return VARS_TO_STR2(type, ne);
  2561. }
  2562. test_add1(ggml_type type = GGML_TYPE_F32,
  2563. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  2564. : type(type), ne(ne) {}
  2565. ggml_tensor * build_graph(ggml_context * ctx) override {
  2566. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2567. ggml_set_param(a);
  2568. ggml_set_name(a, "a");
  2569. ggml_tensor * b = ggml_new_tensor_1d(ctx, type, 1);
  2570. // ggml_set_param(b); // TODO: implement
  2571. ggml_set_name(b, "b");
  2572. ggml_tensor * out = ggml_add1(ctx, a, b);
  2573. ggml_set_name(out, "out");
  2574. return out;
  2575. }
  2576. float grad_eps() override {
  2577. return 0.1f * ne[0]*ne[1]*ne[2]*ne[3];
  2578. }
  2579. };
  2580. // GGML_OP_SCALE
  2581. struct test_scale : public test_case {
  2582. const ggml_type type;
  2583. const std::array<int64_t, 4> ne;
  2584. float scale;
  2585. float bias;
  2586. bool inplace;
  2587. std::string vars() override {
  2588. return VARS_TO_STR5(type, ne, scale, bias, inplace);
  2589. }
  2590. test_scale(ggml_type type = GGML_TYPE_F32,
  2591. std::array<int64_t, 4> ne = {10, 10, 10, 10},
  2592. float scale = 2.0f,
  2593. float bias = 0.0f,
  2594. bool inplace = false)
  2595. : type(type), ne(ne), scale(scale), bias(bias), inplace(inplace) {}
  2596. ggml_tensor * build_graph(ggml_context * ctx) override {
  2597. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2598. ggml_set_param(a);
  2599. ggml_set_name(a, "a");
  2600. ggml_tensor * out;
  2601. if (inplace) {
  2602. out = ggml_scale_bias_inplace(ctx, a, scale, bias);
  2603. } else {
  2604. out = ggml_scale_bias(ctx, a, scale, bias);
  2605. }
  2606. ggml_set_name(out, "out");
  2607. return out;
  2608. }
  2609. };
  2610. // GGML_OP_SCALE + GGML_UNARY_OP_TANH + GGML_OP_SCALE
  2611. struct test_softcap : public test_case {
  2612. const ggml_type type;
  2613. const std::array<int64_t, 4> ne;
  2614. float softcap;
  2615. std::string op_desc(ggml_tensor * t) override {
  2616. GGML_UNUSED(t);
  2617. return "SOFTCAP";
  2618. }
  2619. bool run_whole_graph() override { return true; }
  2620. std::string vars() override {
  2621. return VARS_TO_STR3(type, ne, softcap);
  2622. }
  2623. test_softcap(ggml_type type = GGML_TYPE_F32,
  2624. std::array<int64_t, 4> ne = {10, 10, 10, 10},
  2625. float softcap = 30.0f)
  2626. : type(type), ne(ne), softcap(softcap) {}
  2627. ggml_tensor * build_graph(ggml_context * ctx) override {
  2628. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2629. ggml_set_param(a);
  2630. ggml_set_name(a, "a");
  2631. ggml_tensor * out = ggml_scale(ctx, ggml_tanh(ctx, ggml_scale(ctx, a, 1.0f / softcap)), softcap);
  2632. ggml_set_name(out, "out");
  2633. return out;
  2634. }
  2635. };
  2636. // GGML_OP_SILU_BACK
  2637. struct test_silu_back : public test_case {
  2638. const ggml_type type;
  2639. const std::array<int64_t, 4> ne;
  2640. float eps;
  2641. std::string vars() override {
  2642. return VARS_TO_STR3(type, ne, eps);
  2643. }
  2644. test_silu_back(ggml_type type = GGML_TYPE_F32,
  2645. std::array<int64_t, 4> ne = {64, 5, 4, 3},
  2646. float eps = 1e-6f)
  2647. : type(type), ne(ne), eps(eps) {}
  2648. ggml_tensor * build_graph(ggml_context * ctx) override {
  2649. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2650. ggml_set_name(a, "a");
  2651. ggml_tensor * grad = ggml_new_tensor(ctx, type, 4, ne.data());
  2652. ggml_set_name(grad, "grad");
  2653. ggml_tensor * out = ggml_silu_back(ctx, a, grad);
  2654. ggml_set_name(out, "out");
  2655. return out;
  2656. }
  2657. bool grad_precise() override {
  2658. return true;
  2659. }
  2660. };
  2661. // GGML_OP_NORM
  2662. struct test_norm : public test_case {
  2663. const ggml_type type;
  2664. const std::array<int64_t, 4> ne;
  2665. const bool v; // whether a is a non-contiguous view
  2666. const float eps;
  2667. std::string vars() override {
  2668. return VARS_TO_STR4(type, ne, v, eps);
  2669. }
  2670. test_norm(ggml_type type = GGML_TYPE_F32,
  2671. std::array<int64_t, 4> ne = {64, 5, 4, 3},
  2672. bool v = false,
  2673. float eps = 1e-6f)
  2674. : type(type), ne(ne), v(v), eps(eps) {}
  2675. ggml_tensor * build_graph(ggml_context * ctx) override {
  2676. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2677. ggml_set_name(a, "a");
  2678. if (v) {
  2679. a = ggml_view_4d(ctx, a, a->ne[0]/2, a->ne[1]/2, a->ne[2]/2, a->ne[3]/2, a->nb[1], a->nb[2], a->nb[3], 0);
  2680. ggml_set_name(a, "view of a");
  2681. }
  2682. ggml_tensor * out = ggml_norm(ctx, a, eps);
  2683. ggml_set_name(out, "out");
  2684. return out;
  2685. }
  2686. };
  2687. // GGML_OP_NORM + GGML_OP_MUL + GGML_OP_ADD
  2688. struct test_norm_mul_add : public test_case {
  2689. const ggml_type type;
  2690. const std::array<int64_t, 4> ne;
  2691. float eps;
  2692. const bool broadcast;
  2693. std::string op_desc(ggml_tensor * t) override {
  2694. GGML_UNUSED(t);
  2695. return "NORM_MUL_ADD";
  2696. }
  2697. bool run_whole_graph() override { return true; }
  2698. std::string vars() override {
  2699. return VARS_TO_STR4(type, ne, eps, broadcast);
  2700. }
  2701. test_norm_mul_add(ggml_type type = GGML_TYPE_F32,
  2702. std::array<int64_t, 4> ne = {128, 2, 1, 1},
  2703. float eps = 1e-5f,
  2704. bool broadcast = false)
  2705. : type(type), ne(ne), eps(eps), broadcast(broadcast) {}
  2706. ggml_tensor * build_graph(ggml_context * ctx) override {
  2707. std::array<int64_t, 4> broadcast_dims = {ne[0], ne[1] * 2, ne[2] * 2, ne[3] * 2};
  2708. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, broadcast ? broadcast_dims.data() : ne.data());
  2709. ggml_tensor * w = ggml_new_tensor(ctx, type, 4, ne.data());
  2710. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  2711. ggml_set_param(a); ggml_set_param(w); ggml_set_param(b);
  2712. ggml_set_name(a, "a"); ggml_set_name(w, "w"); ggml_set_name(b, "b");
  2713. // Use a, w and b early to avoid OP_NONE in graph
  2714. a = ggml_add(ctx, ggml_add(ctx, a, w), b);
  2715. ggml_tensor * n = ggml_norm(ctx, a, eps);
  2716. ggml_tensor * m = ggml_mul(ctx, n, w);
  2717. ggml_tensor * out = ggml_add(ctx, m, b);
  2718. ggml_set_name(out, "out");
  2719. return out;
  2720. }
  2721. };
  2722. // GGML_OP_RMS_NORM
  2723. struct test_rms_norm : public test_case {
  2724. const ggml_type type;
  2725. const std::array<int64_t, 4> ne;
  2726. const bool v; // whether a is a non-contiguous view
  2727. const float eps;
  2728. const bool inplace; // whether to do the operation inplace
  2729. std::string vars() override {
  2730. return VARS_TO_STR5(type, ne, v, eps, inplace);
  2731. }
  2732. test_rms_norm(ggml_type type = GGML_TYPE_F32,
  2733. std::array<int64_t, 4> ne = {64, 5, 4, 3},
  2734. bool v = false,
  2735. float eps = 1e-6f,
  2736. bool inplace = false)
  2737. : type(type), ne(ne), v(v), eps(eps), inplace(inplace) {}
  2738. ggml_tensor * build_graph(ggml_context * ctx) override {
  2739. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2740. ggml_set_param(a);
  2741. ggml_set_name(a, "a");
  2742. if (v) {
  2743. a = ggml_view_4d(ctx, a, a->ne[0]/2, a->ne[1]/2, a->ne[2]/2, a->ne[3]/2, a->nb[1], a->nb[2], a->nb[3], 0);
  2744. ggml_set_name(a, "view of a");
  2745. }
  2746. ggml_tensor * out;
  2747. if (inplace) {
  2748. out = ggml_rms_norm_inplace(ctx, a, eps);
  2749. } else {
  2750. out = ggml_rms_norm(ctx, a, eps);
  2751. }
  2752. ggml_set_name(out, "out");
  2753. return out;
  2754. }
  2755. void initialize_tensors(ggml_context * ctx) override {
  2756. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2757. init_tensor_uniform(t, -10.f, 10.f);
  2758. }
  2759. }
  2760. float grad_eps() override {
  2761. return 1.0f;
  2762. }
  2763. bool grad_precise() override {
  2764. return true;
  2765. }
  2766. };
  2767. // GGML_OP_RMS_NORM_BACK
  2768. struct test_rms_norm_back : public test_case {
  2769. const ggml_type type;
  2770. const std::array<int64_t, 4> ne;
  2771. const float eps;
  2772. std::string vars() override {
  2773. return VARS_TO_STR3(type, ne, eps);
  2774. }
  2775. test_rms_norm_back(ggml_type type = GGML_TYPE_F32,
  2776. std::array<int64_t, 4> ne = {64, 5, 4, 3},
  2777. float eps = 1e-6f)
  2778. : type(type), ne(ne), eps(eps) {}
  2779. ggml_tensor * build_graph(ggml_context * ctx) override {
  2780. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2781. ggml_set_name(a, "a");
  2782. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  2783. ggml_set_name(b, "b");
  2784. ggml_tensor * out = ggml_rms_norm_back(ctx, a, b, eps);
  2785. ggml_set_name(out, "out");
  2786. return out;
  2787. }
  2788. void initialize_tensors(ggml_context * ctx) override {
  2789. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2790. init_tensor_uniform(t, -10.f, 10.f);
  2791. }
  2792. }
  2793. };
  2794. // GGML_OP_RMS_NORM + GGML_OP_MUL + GGML_OP_ADD
  2795. struct test_rms_norm_mul_add : public test_case {
  2796. const ggml_type type;
  2797. const std::array<int64_t, 4> ne;
  2798. const float eps;
  2799. const bool broadcast;
  2800. const bool multi_add; // test a sequence of adds feeding into rms_norm
  2801. std::string op_desc(ggml_tensor * t) override {
  2802. GGML_UNUSED(t);
  2803. return "RMS_NORM_MUL_ADD";
  2804. }
  2805. bool run_whole_graph() override { return true; }
  2806. std::string vars() override {
  2807. return VARS_TO_STR5(type, ne, eps, broadcast, multi_add);
  2808. }
  2809. test_rms_norm_mul_add(ggml_type type = GGML_TYPE_F32,
  2810. std::array<int64_t, 4> ne = {64, 5, 4, 3},
  2811. float eps = 1e-6f, bool broadcast = false, bool multi_add = false)
  2812. : type(type), ne(ne), eps(eps), broadcast(broadcast), multi_add(multi_add) {}
  2813. ggml_tensor * build_graph(ggml_context * ctx) override {
  2814. std::array<int64_t, 4> broadcast_dims = {ne[0]*2, ne[1]*3, ne[2]*3, ne[3]*4};
  2815. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, broadcast ? broadcast_dims.data() : ne.data());
  2816. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  2817. ggml_tensor * c = ggml_new_tensor(ctx, type, 4, ne.data());
  2818. ggml_set_param(a);
  2819. ggml_set_name(a, "a");
  2820. ggml_set_param(b);
  2821. ggml_set_name(b, "b");
  2822. ggml_set_param(c);
  2823. ggml_set_name(c, "c");
  2824. // Use a, b and c early, so we don't end up with an OP_NONE between rms_norm and mul
  2825. a = ggml_add(ctx, ggml_add(ctx, a, b), c);
  2826. if (multi_add) {
  2827. a = ggml_add(ctx, ggml_add(ctx, a, b), c);
  2828. }
  2829. ggml_tensor * out = ggml_add(ctx, ggml_mul(ctx, ggml_rms_norm(ctx, a, eps), b), c);
  2830. ggml_set_name(out, "out");
  2831. return out;
  2832. }
  2833. void initialize_tensors(ggml_context * ctx) override {
  2834. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2835. init_tensor_uniform(t, -10.f, 10.f);
  2836. }
  2837. }
  2838. float grad_eps() override {
  2839. return 1.0f;
  2840. }
  2841. bool grad_precise() override {
  2842. return true;
  2843. }
  2844. };
  2845. // GGML_OP_SSM_CONV
  2846. struct test_ssm_conv : public test_case {
  2847. const ggml_type type;
  2848. const std::array<int64_t, 4> ne_a;
  2849. const std::array<int64_t, 4> ne_b;
  2850. std::string vars() override {
  2851. return VARS_TO_STR3(type, ne_a, ne_b);
  2852. }
  2853. test_ssm_conv(ggml_type type = GGML_TYPE_F32,
  2854. std::array<int64_t, 4> ne_a = {10, 10, 10, 1},
  2855. std::array<int64_t, 4> ne_b = {3, 3, 1, 1})
  2856. : type(type), ne_a(ne_a), ne_b(ne_b) {}
  2857. ggml_tensor * build_graph(ggml_context * ctx) override {
  2858. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  2859. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne_b.data());
  2860. ggml_tensor * out = ggml_ssm_conv(ctx, a, b);
  2861. return out;
  2862. }
  2863. };
  2864. // GGML_OP_SSM_SCAN
  2865. struct test_ssm_scan : public test_case {
  2866. const ggml_type type;
  2867. const int64_t d_state;
  2868. const int64_t head_dim;
  2869. const int64_t n_head;
  2870. const int64_t n_group;
  2871. const int64_t n_seq_tokens;
  2872. const int64_t n_seqs;
  2873. std::string vars() override {
  2874. return VARS_TO_STR7(type, d_state, head_dim, n_head, n_group, n_seq_tokens, n_seqs);
  2875. }
  2876. test_ssm_scan(ggml_type type = GGML_TYPE_F32,
  2877. int64_t d_state = 32,
  2878. int64_t head_dim = 1, // non-zero for Mamba-2
  2879. int64_t n_head = 32,
  2880. int64_t n_group = 1,
  2881. int64_t n_seq_tokens = 32,
  2882. int64_t n_seqs = 32)
  2883. : type(type), d_state(d_state), head_dim(head_dim), n_head(n_head), n_group(n_group), n_seq_tokens(n_seq_tokens), n_seqs(n_seqs) {}
  2884. ggml_tensor * build_graph(ggml_context * ctx) override {
  2885. ggml_tensor * s = ggml_new_tensor_4d(ctx, type, d_state, head_dim, n_head, n_seqs);
  2886. ggml_tensor * x = ggml_new_tensor_4d(ctx, type, head_dim, n_head, n_seq_tokens, n_seqs);
  2887. ggml_tensor * dt = ggml_new_tensor_3d(ctx, type, n_head, n_seq_tokens, n_seqs);
  2888. ggml_tensor * A = ggml_new_tensor_2d(ctx, type, (head_dim > 1) ? 1 : d_state, n_head);
  2889. ggml_tensor * B = ggml_new_tensor_4d(ctx, type, d_state, n_group, n_seq_tokens, n_seqs);
  2890. ggml_tensor * C = ggml_new_tensor_4d(ctx, type, d_state, n_group, n_seq_tokens, n_seqs);
  2891. ggml_tensor * ids = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, n_seqs);
  2892. ggml_tensor * out = ggml_ssm_scan(ctx, s, x, dt, A, B, C, ids);
  2893. return out;
  2894. }
  2895. // similar to test_mul_mat_id
  2896. void initialize_tensors(ggml_context * ctx) override {
  2897. std::random_device rd;
  2898. std::default_random_engine rng(rd());
  2899. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2900. if (t->type == GGML_TYPE_I32) {
  2901. if (ggml_is_view_op(t->op)) { continue; }
  2902. // ids
  2903. for (int64_t r = 0; r < ggml_nrows(t); r++) {
  2904. std::vector<int32_t> data(t->ne[0]);
  2905. for (int i = 0; i < t->ne[0]; i++) {
  2906. data[i] = i;
  2907. }
  2908. std::shuffle(data.begin(), data.end(), rng);
  2909. ggml_backend_tensor_set(t, data.data(), r * t->nb[1], t->ne[0] * sizeof(int32_t));
  2910. }
  2911. } else {
  2912. init_tensor_uniform(t);
  2913. }
  2914. }
  2915. }
  2916. };
  2917. // GGML_OP_RWKV_WKV6
  2918. struct test_rwkv_wkv6 : public test_case {
  2919. const ggml_type type;
  2920. const int64_t head_count;
  2921. const int64_t head_size;
  2922. const int64_t n_seq_tokens;
  2923. const int64_t n_seqs;
  2924. std::string vars() override {
  2925. return VARS_TO_STR5(type, head_count, head_size, n_seq_tokens, n_seqs);
  2926. }
  2927. test_rwkv_wkv6(ggml_type type = GGML_TYPE_F32,
  2928. int64_t head_count = 32, int64_t head_size = 64, int64_t n_seq_tokens = 32, int64_t n_seqs = 32)
  2929. : type(type), head_count(head_count), head_size(head_size), n_seq_tokens(n_seq_tokens), n_seqs(n_seqs) {}
  2930. ggml_tensor * build_graph(ggml_context * ctx) override {
  2931. const int64_t n_tokens = n_seq_tokens * n_seqs;
  2932. ggml_tensor * r = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2933. ggml_tensor * k = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2934. ggml_tensor * v = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2935. ggml_tensor * tf = ggml_new_tensor(ctx, type, 2, std::vector<int64_t>{ head_size, head_count }.data());
  2936. ggml_tensor * td = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2937. ggml_tensor * s = ggml_new_tensor(ctx, type, 2, std::vector<int64_t>{ head_size * head_size * head_count, n_seqs }.data());
  2938. ggml_tensor * out = ggml_rwkv_wkv6(ctx, k, v, r, tf, td, s);
  2939. return out;
  2940. }
  2941. };
  2942. // GGML_OP_GATED_LINEAR_ATTN
  2943. struct test_gla : public test_case {
  2944. const ggml_type type;
  2945. const int64_t head_count;
  2946. const int64_t head_size;
  2947. const int64_t n_seq_tokens;
  2948. const int64_t n_seqs;
  2949. std::string vars() override {
  2950. return VARS_TO_STR5(type, head_count, head_size, n_seq_tokens, n_seqs);
  2951. }
  2952. test_gla(ggml_type type = GGML_TYPE_F32,
  2953. int64_t head_count = 32, int64_t head_size = 64, int64_t n_seq_tokens = 32, int64_t n_seqs = 32)
  2954. : type(type), head_count(head_count), head_size(head_size), n_seq_tokens(n_seq_tokens), n_seqs(n_seqs) {}
  2955. ggml_tensor * build_graph(ggml_context * ctx) override {
  2956. const int64_t n_tokens = n_seq_tokens * n_seqs;
  2957. ggml_tensor * q = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2958. ggml_tensor * k = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2959. ggml_tensor * v = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2960. ggml_tensor * g = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2961. ggml_tensor * s = ggml_new_tensor(ctx, type, 2, std::vector<int64_t>{ head_size * head_size * head_count, n_seqs }.data());
  2962. ggml_tensor * out = ggml_gated_linear_attn(ctx, k, v, q, g, s, pow(head_size, -0.5));
  2963. return out;
  2964. }
  2965. };
  2966. // GGML_OP_RWKV_WKV7
  2967. struct test_rwkv_wkv7 : public test_case {
  2968. const ggml_type type;
  2969. const int64_t head_count;
  2970. const int64_t head_size;
  2971. const int64_t n_seq_tokens;
  2972. const int64_t n_seqs;
  2973. std::string vars() override {
  2974. return VARS_TO_STR5(type, head_count, head_size, n_seq_tokens, n_seqs);
  2975. }
  2976. test_rwkv_wkv7(ggml_type type = GGML_TYPE_F32,
  2977. int64_t head_count = 32, int64_t head_size = 64, int64_t n_seq_tokens = 32, int64_t n_seqs = 32)
  2978. : type(type), head_count(head_count), head_size(head_size), n_seq_tokens(n_seq_tokens), n_seqs(n_seqs) {}
  2979. ggml_tensor * build_graph(ggml_context * ctx) override {
  2980. const int64_t n_tokens = n_seq_tokens * n_seqs;
  2981. ggml_tensor * r = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2982. ggml_tensor * w = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2983. ggml_tensor * k = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2984. ggml_tensor * v = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2985. ggml_tensor * a = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2986. ggml_tensor * b = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  2987. // Outputs may become NaN with long seqlen without these normalization
  2988. a = ggml_l2_norm(ctx, a, 1e-7F);
  2989. b = ggml_l2_norm(ctx, b, 1e-7F);
  2990. ggml_tensor * s = ggml_new_tensor(ctx, type, 2, std::vector<int64_t>{ head_size * head_size * head_count, n_seqs }.data());
  2991. ggml_tensor * out = ggml_rwkv_wkv7(ctx, r, w, k, v, a, b, s);
  2992. return out;
  2993. }
  2994. };
  2995. // GGML_OP_MUL_MAT
  2996. struct test_mul_mat : public test_case {
  2997. const ggml_type type_a;
  2998. const ggml_type type_b;
  2999. const int64_t m;
  3000. const int64_t n;
  3001. const int64_t k;
  3002. const std::array<int64_t, 2> bs; // dims 3 and 4
  3003. const std::array<int64_t, 2> nr; // repeat in dims 3 and 4
  3004. const std::array<int64_t, 4> per; // permutation of dimensions
  3005. const int64_t k_v; // size of k in memory, resulting in a non-contiguous view for k_v > k, no view for k_v == 0
  3006. const uint32_t o; // number of outputs
  3007. std::string vars() override {
  3008. return VARS_TO_STR10(type_a, type_b, m, n, k, bs, nr, per, k_v, o);
  3009. }
  3010. double max_nmse_err() override {
  3011. return 5e-4;
  3012. }
  3013. int64_t grad_nmax() override {
  3014. return 20000;
  3015. }
  3016. uint64_t op_flops(ggml_tensor * t) override {
  3017. GGML_UNUSED(t);
  3018. return 2 * m * n * k * bs[0] * nr[0] * bs[1] * nr[1];
  3019. }
  3020. test_mul_mat(ggml_type type_a = GGML_TYPE_F32, ggml_type type_b = GGML_TYPE_F32,
  3021. int64_t m = 32, int64_t n = 32, int64_t k = 32,
  3022. std::array<int64_t, 2> bs = {10, 10},
  3023. std::array<int64_t, 2> nr = {2, 2},
  3024. std::array<int64_t, 4> per = {0, 1, 2, 3},
  3025. int64_t k_v = 0, uint32_t o = 1)
  3026. : type_a(type_a), type_b(type_b), m(m), n(n), k(k), bs(bs), nr(nr), per(per), k_v(k_v), o(o) {}
  3027. ggml_tensor * build_graph(ggml_context * ctx) override {
  3028. // C^T = A * B^T: (k, m) * (k, n) => (m, n)
  3029. ggml_tensor * a;
  3030. ggml_tensor * b;
  3031. const int npermuted = (per[0] != 0) + (per[1] != 1) + (per[2] != 2) + (per[3] != 3);
  3032. if (npermuted > 0) {
  3033. GGML_ASSERT(npermuted == 2);
  3034. GGML_ASSERT(k_v == 0); // not handled
  3035. GGML_ASSERT(!ggml_is_quantized(type_a) || per[0] == 0);
  3036. GGML_ASSERT(!ggml_is_quantized(type_b) || per[0] == 0);
  3037. // Create tensors with the permuted dimensions, then permute them back to the dimensions given by m,n,k.
  3038. const int64_t ne_a[4] = {k, m, bs[0], bs[1]};
  3039. const int64_t ne_b[4] = {k, n, bs[0]*nr[0], bs[1]*nr[1]};
  3040. a = ggml_new_tensor_4d(ctx, type_a, ne_a[per[0]], ne_a[per[1]], ne_a[per[2]], ne_a[per[3]]);
  3041. b = ggml_new_tensor_4d(ctx, type_b, ne_b[per[0]], ne_b[per[1]], ne_b[per[2]], ne_b[per[3]]);
  3042. if (!ggml_is_quantized(type_a)) {
  3043. if (bs[1] == 1 && nr[1] == 1) {
  3044. ggml_set_param(a);
  3045. }
  3046. ggml_set_param(b);
  3047. }
  3048. ggml_set_name(a, "a");
  3049. ggml_set_name(b, "b");
  3050. a = ggml_permute(ctx, a, per[0], per[1], per[2], per[3]);
  3051. b = ggml_permute(ctx, b, per[0], per[1], per[2], per[3]);
  3052. ggml_set_name(a, "a_permuted");
  3053. ggml_set_name(b, "b_permuted");
  3054. } else {
  3055. const int64_t k_physical = k_v == 0 ? k : k_v;
  3056. a = ggml_new_tensor_4d(ctx, type_a, k_physical, m, bs[0], bs[1]);
  3057. b = ggml_new_tensor_4d(ctx, type_b, k_physical, n, bs[0]*nr[0], bs[1]*nr[1]);
  3058. if (!ggml_is_quantized(type_a)) {
  3059. if (bs[1] == 1 && nr[1] == 1) {
  3060. ggml_set_param(a);
  3061. }
  3062. ggml_set_param(b);
  3063. }
  3064. if (k_v != 0) {
  3065. GGML_ASSERT(k_v > k);
  3066. a = ggml_view_4d(ctx, a, k, m, bs[0], bs[1], a->nb[1], a->nb[2], a->nb[3], 0);
  3067. b = ggml_view_4d(ctx, b, k, n, bs[0]*nr[0], bs[1]*nr[1], b->nb[1], b->nb[2], b->nb[3], 0);
  3068. }
  3069. ggml_set_name(a, "a");
  3070. ggml_set_name(b, "b");
  3071. }
  3072. ggml_tensor * out = ggml_mul_mat(ctx, a, b);
  3073. ggml_set_name(out, "out");
  3074. for (uint32_t i = 1; i < o; ++i) {
  3075. ggml_tensor * out2 = ggml_mul_mat(ctx, a, b);
  3076. ggml_set_name(out2, "out2");
  3077. out = ggml_add(ctx, out, out2);
  3078. }
  3079. return out;
  3080. }
  3081. bool run_whole_graph() override { return o > 1; }
  3082. std::string op_desc(ggml_tensor * t) override {
  3083. GGML_UNUSED(t);
  3084. return ggml_op_name(GGML_OP_MUL_MAT);
  3085. }
  3086. };
  3087. static void init_mul_mat_id_tensors(ggml_context * ctx, int n_mats) {
  3088. std::random_device rd;
  3089. std::default_random_engine rng(rd());
  3090. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  3091. if (t->type == GGML_TYPE_I32) {
  3092. if (ggml_is_view_op(t->op)) { continue; }
  3093. // ids
  3094. for (int64_t r = 0; r < ggml_nrows(t); r++) {
  3095. std::vector<int32_t> data(t->ne[0]);
  3096. for (int i = 0; i < t->ne[0]; i++) {
  3097. data[i] = i % n_mats;
  3098. }
  3099. std::shuffle(data.begin(), data.end(), rng);
  3100. ggml_backend_tensor_set(t, data.data(), r * t->nb[1], t->ne[0] * sizeof(int32_t));
  3101. }
  3102. } else {
  3103. init_tensor_uniform(t);
  3104. }
  3105. }
  3106. }
  3107. // GGML_OP_MUL_MAT_ID
  3108. struct test_mul_mat_id : public test_case {
  3109. const ggml_type type_a;
  3110. const ggml_type type_b;
  3111. const int n_mats;
  3112. const int n_used;
  3113. const bool b; // broadcast b matrix
  3114. const int64_t m;
  3115. const int64_t n;
  3116. const int64_t k;
  3117. std::string vars() override {
  3118. return VARS_TO_STR8(type_a, type_b, n_mats, n_used, b, m, n, k);
  3119. }
  3120. double max_nmse_err() override {
  3121. return 5e-4;
  3122. }
  3123. uint64_t op_flops(ggml_tensor * t) override {
  3124. GGML_UNUSED(t);
  3125. return 2 * m * k * n * n_used;
  3126. }
  3127. test_mul_mat_id(ggml_type type_a = GGML_TYPE_F32, ggml_type type_b = GGML_TYPE_F32,
  3128. int n_mats = 8, int n_used = 2, bool b = false,
  3129. int64_t m = 32, int64_t n = 32, int64_t k = 32)
  3130. : type_a(type_a), type_b(type_b), n_mats(n_mats), n_used(n_used), b(b),
  3131. m(m), n(n), k(k) {
  3132. GGML_ASSERT(n_used <= n_mats);
  3133. }
  3134. ggml_tensor * build_graph(ggml_context * ctx) override {
  3135. // C^T = A * B^T: (k, m) * (k, n) => (m, n)
  3136. ggml_tensor * as = ggml_new_tensor_3d(ctx, type_a, k, m, n_mats);
  3137. ggml_set_name(as, "as");
  3138. ggml_tensor * ids = ggml_new_tensor_2d(ctx, GGML_TYPE_I32, n_mats, n);
  3139. ggml_set_name(ids, "ids");
  3140. if (n_used != n_mats) {
  3141. ids = ggml_view_2d(ctx, ids, n_used, n, ids->nb[1], 0);
  3142. ggml_set_name(ids, "view_of_ids");
  3143. }
  3144. ggml_tensor * b = ggml_new_tensor_3d(ctx, type_b, k, this->b ? 1 : n_used, n);
  3145. ggml_set_name(b, "b");
  3146. ggml_tensor * out = ggml_mul_mat_id(ctx, as, b, ids);
  3147. ggml_set_name(out, "out");
  3148. return out;
  3149. }
  3150. void initialize_tensors(ggml_context * ctx) override {
  3151. init_mul_mat_id_tensors(ctx, n_mats);
  3152. }
  3153. };
  3154. // GGML_OP_MUL_MAT_ID + GGML_OP_ADD or GGML_OP_MUL
  3155. struct test_mul_mat_id_fusion : public test_case {
  3156. const ggml_type type_a;
  3157. const ggml_type type_b;
  3158. const int n_mats;
  3159. const int n_used;
  3160. const bool b; // broadcast b matrix
  3161. const int64_t m;
  3162. const int64_t n;
  3163. const int64_t k;
  3164. const uint32_t o; // number of outputs
  3165. const bool mul;
  3166. std::string vars() override {
  3167. return VARS_TO_STR10(type_a, type_b, n_mats, n_used, b, m, n, k, o, mul);
  3168. }
  3169. double max_nmse_err() override {
  3170. return 5e-4;
  3171. }
  3172. uint64_t op_flops(ggml_tensor * t) override {
  3173. GGML_UNUSED(t);
  3174. return 2 * m * k * n * n_used;
  3175. }
  3176. test_mul_mat_id_fusion(ggml_type type_a = GGML_TYPE_F32, ggml_type type_b = GGML_TYPE_F32,
  3177. int n_mats = 8, int n_used = 2, bool b = false,
  3178. int64_t m = 32, int64_t n = 32, int64_t k = 32, uint32_t o = 1, bool mul = false)
  3179. : type_a(type_a), type_b(type_b), n_mats(n_mats), n_used(n_used), b(b),
  3180. m(m), n(n), k(k), o(o), mul(mul) {
  3181. GGML_ASSERT(n_used <= n_mats);
  3182. }
  3183. ggml_tensor * build_graph(ggml_context * ctx) override {
  3184. // C^T = A * B^T: (k, m) * (k, n) => (m, n)
  3185. ggml_tensor * as = ggml_new_tensor_3d(ctx, type_a, k, m, n_mats);
  3186. ggml_set_name(as, "as");
  3187. ggml_tensor * ids = ggml_new_tensor_2d(ctx, GGML_TYPE_I32, n_mats, n);
  3188. ggml_set_name(ids, "ids");
  3189. if (n_used != n_mats) {
  3190. ids = ggml_view_2d(ctx, ids, n_used, n, ids->nb[1], 0);
  3191. ggml_set_name(ids, "view_of_ids");
  3192. }
  3193. ggml_tensor * b = ggml_new_tensor_3d(ctx, type_b, k, this->b ? 1 : n_used, n);
  3194. ggml_set_name(b, "b");
  3195. ggml_tensor * out = ggml_mul_mat_id(ctx, as, b, ids);
  3196. ggml_set_name(out, "out");
  3197. for (uint32_t i = 1; i < o; ++i) {
  3198. ggml_tensor * a2 = ggml_new_tensor_3d(ctx, type_a, k, m, n_mats);
  3199. ggml_tensor * out2 = ggml_mul_mat_id(ctx, a2, b, ids);
  3200. ggml_set_name(out2, "out2");
  3201. out = ggml_add(ctx, out, out2);
  3202. }
  3203. if (mul) {
  3204. std::array<int64_t, 4> ne { 1, out->ne[1], out->ne[2], out->ne[3] };
  3205. ne[0] = 1;
  3206. ggml_tensor * m = ggml_new_tensor(ctx, out->type, 4, ne.data());
  3207. out = ggml_mul(ctx, out, m);
  3208. }
  3209. return out;
  3210. }
  3211. void initialize_tensors(ggml_context * ctx) override {
  3212. init_mul_mat_id_tensors(ctx, n_mats);
  3213. }
  3214. bool run_whole_graph() override { return true; }
  3215. std::string op_desc(ggml_tensor * t) override {
  3216. GGML_UNUSED(t);
  3217. return "MUL_MAT_ID_FUSION";
  3218. }
  3219. };
  3220. // GGML_OP_OUT_PROD
  3221. struct test_out_prod : public test_case {
  3222. const ggml_type type_a;
  3223. const ggml_type type_b;
  3224. const int64_t m;
  3225. const int64_t n;
  3226. const int64_t k;
  3227. const std::array<int64_t, 2> bs; // dims 3 and 4
  3228. const std::array<int64_t, 2> nr; // repeat in dims 3 and 4
  3229. const bool trans_b;
  3230. std::string vars() override {
  3231. return VARS_TO_STR8(type_a, type_b, m, n, k, bs, nr, trans_b);
  3232. }
  3233. double max_nmse_err() override {
  3234. return 5e-4;
  3235. }
  3236. test_out_prod(ggml_type type_a = GGML_TYPE_F32, ggml_type type_b = GGML_TYPE_F32,
  3237. int64_t m = 32, int64_t n = 32, int64_t k = 32,
  3238. std::array<int64_t, 2> bs = {10, 10},
  3239. std::array<int64_t, 2> nr = {2, 2},
  3240. bool trans_b = false)
  3241. : type_a(type_a), type_b(type_b), m(m), n(n), k(k), bs(bs), nr(nr), trans_b(trans_b) {}
  3242. ggml_tensor * build_graph(ggml_context * ctx) override {
  3243. ggml_tensor * a = ggml_new_tensor_4d(ctx, type_a, m, k, bs[0], bs[1]);
  3244. ggml_set_name(a, "a");
  3245. ggml_tensor * b;
  3246. if (trans_b) {
  3247. b = ggml_new_tensor_4d(ctx, type_b, k, n, bs[0]*nr[0], bs[1]*nr[1]);
  3248. b = ggml_transpose(ctx, b);
  3249. } else {
  3250. b = ggml_new_tensor_4d(ctx, type_b, n, k, bs[0]*nr[0], bs[1]*nr[1]);
  3251. }
  3252. ggml_set_name(b, "b");
  3253. ggml_tensor * out = ggml_out_prod(ctx, a, b);
  3254. ggml_set_name(out, "out");
  3255. return out;
  3256. }
  3257. };
  3258. // GGML_OP_SQR
  3259. struct test_sqr : public test_case {
  3260. const ggml_type type;
  3261. const std::array<int64_t, 4> ne;
  3262. std::string vars() override {
  3263. return VARS_TO_STR2(type, ne);
  3264. }
  3265. test_sqr(ggml_type type = GGML_TYPE_F32,
  3266. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  3267. : type(type), ne(ne) {}
  3268. ggml_tensor * build_graph(ggml_context * ctx) override {
  3269. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  3270. ggml_set_param(a);
  3271. ggml_set_name(a, "a");
  3272. ggml_tensor * out = ggml_sqr(ctx, a);
  3273. ggml_set_name(out, "out");
  3274. return out;
  3275. }
  3276. float grad_eps() override {
  3277. return 0.1f * 0.25f*ne[0]*ne[1]*ne[2]*ne[3]; // 10% of expected value of sum.
  3278. }
  3279. };
  3280. // GGML_OP_SQRT
  3281. struct test_sqrt : public test_case {
  3282. const ggml_type type;
  3283. const std::array<int64_t, 4> ne;
  3284. std::string vars() override {
  3285. return VARS_TO_STR2(type, ne);
  3286. }
  3287. test_sqrt(ggml_type type = GGML_TYPE_F32,
  3288. std::array<int64_t, 4> ne = {10, 3, 3, 2})
  3289. : type(type), ne(ne) {}
  3290. ggml_tensor * build_graph(ggml_context * ctx) override {
  3291. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  3292. ggml_set_param(a);
  3293. ggml_set_name(a, "a");
  3294. ggml_tensor * out = ggml_sqrt(ctx, a);
  3295. ggml_set_name(out, "out");
  3296. return out;
  3297. }
  3298. void initialize_tensors(ggml_context * ctx) override {
  3299. // fill with positive values
  3300. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  3301. init_tensor_uniform(t, 50.0f, 100.0f);
  3302. }
  3303. }
  3304. float grad_eps() override {
  3305. return 20.0f;
  3306. }
  3307. bool grad_precise() override {
  3308. return true;
  3309. }
  3310. };
  3311. // GGML_OP_LOG
  3312. struct test_log : public test_case {
  3313. const ggml_type type;
  3314. const std::array<int64_t, 4> ne;
  3315. std::string vars() override {
  3316. return VARS_TO_STR2(type, ne);
  3317. }
  3318. test_log(ggml_type type = GGML_TYPE_F32,
  3319. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  3320. : type(type), ne(ne) {}
  3321. ggml_tensor * build_graph(ggml_context * ctx) override {
  3322. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  3323. ggml_set_param(a);
  3324. ggml_set_name(a, "a");
  3325. ggml_tensor * out = ggml_log(ctx, a);
  3326. ggml_set_name(out, "out");
  3327. return out;
  3328. }
  3329. void initialize_tensors(ggml_context * ctx) override {
  3330. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  3331. // log(1) == 0, cluster values there to keep the sum low for better precision in the backward pass:
  3332. init_tensor_uniform(t, 0.9f, 1.1f);
  3333. }
  3334. }
  3335. bool grad_precise() override {
  3336. return true;
  3337. }
  3338. };
  3339. // GGML_OP_SIN
  3340. struct test_sin : public test_case {
  3341. const ggml_type type;
  3342. const std::array<int64_t, 4> ne;
  3343. std::string vars() override {
  3344. return VARS_TO_STR2(type, ne);
  3345. }
  3346. test_sin(ggml_type type = GGML_TYPE_F32,
  3347. std::array<int64_t, 4> ne = {10, 2, 2, 2})
  3348. : type(type), ne(ne) {}
  3349. ggml_tensor * build_graph(ggml_context * ctx) override {
  3350. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  3351. ggml_set_param(a);
  3352. ggml_set_name(a, "a");
  3353. ggml_tensor * out = ggml_sin(ctx, a);
  3354. ggml_set_name(out, "out");
  3355. return out;
  3356. }
  3357. void initialize_tensors(ggml_context * ctx) override {
  3358. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  3359. init_tensor_uniform(t, -6.5f, 6.5f); // Covers interval [-2*pi, 2*pi].
  3360. }
  3361. }
  3362. double max_maa_err() override {
  3363. return 1e-3;
  3364. }
  3365. float grad_eps() override {
  3366. return 0.2f;
  3367. }
  3368. bool grad_precise() override {
  3369. return true;
  3370. }
  3371. };
  3372. // GGML_OP_COS
  3373. struct test_cos : public test_case {
  3374. const ggml_type type;
  3375. const std::array<int64_t, 4> ne;
  3376. std::string vars() override {
  3377. return VARS_TO_STR2(type, ne);
  3378. }
  3379. test_cos(ggml_type type = GGML_TYPE_F32,
  3380. std::array<int64_t, 4> ne = {10, 2, 2, 2})
  3381. : type(type), ne(ne) {}
  3382. ggml_tensor * build_graph(ggml_context * ctx) override {
  3383. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  3384. ggml_set_param(a);
  3385. ggml_set_name(a, "a");
  3386. ggml_tensor * out = ggml_cos(ctx, a);
  3387. ggml_set_name(out, "out");
  3388. return out;
  3389. }
  3390. void initialize_tensors(ggml_context * ctx) override {
  3391. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  3392. init_tensor_uniform(t, -6.5f, 6.5f); // Covers interval [-2*pi, 2*pi].
  3393. }
  3394. }
  3395. double max_maa_err() override {
  3396. return 1e-3;
  3397. }
  3398. float grad_eps() override {
  3399. return 0.2f;
  3400. }
  3401. bool grad_precise() override {
  3402. return true;
  3403. }
  3404. };
  3405. // GGML_OP_CLAMP
  3406. struct test_clamp : public test_case {
  3407. const ggml_type type;
  3408. const std::array<int64_t, 4> ne;
  3409. float min;
  3410. float max;
  3411. std::string vars() override {
  3412. return VARS_TO_STR4(type, ne, min, max);
  3413. }
  3414. test_clamp(ggml_type type = GGML_TYPE_F32,
  3415. std::array<int64_t, 4> ne = {10, 5, 4, 3},
  3416. float min = -0.5f, float max = 0.5f)
  3417. : type(type), ne(ne), min(min), max(max) {}
  3418. ggml_tensor * build_graph(ggml_context * ctx) override {
  3419. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  3420. ggml_set_name(a, "a");
  3421. ggml_tensor * out = ggml_clamp(ctx, a, min, max);
  3422. ggml_set_name(out, "out");
  3423. return out;
  3424. }
  3425. float grad_eps() override {
  3426. return 1e-2f;
  3427. }
  3428. std::vector<float> grad_expect() override {
  3429. return {0.0f, 1.0f};
  3430. }
  3431. };
  3432. // GGML_OP_FLOOR
  3433. struct test_floor : public test_case {
  3434. const ggml_type type;
  3435. const std::array<int64_t, 4> ne;
  3436. std::string vars() override {
  3437. return VARS_TO_STR2(type, ne);
  3438. }
  3439. test_floor(ggml_type type = GGML_TYPE_F32,
  3440. std::array<int64_t, 4> ne = {10, 2, 2, 2})
  3441. : type(type), ne(ne) {}
  3442. ggml_tensor * build_graph(ggml_context * ctx) override {
  3443. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  3444. ggml_set_param(a);
  3445. ggml_set_name(a, "a");
  3446. ggml_tensor * out = ggml_floor(ctx, a);
  3447. ggml_set_name(out, "out");
  3448. return out;
  3449. }
  3450. void initialize_tensors(ggml_context * ctx) override {
  3451. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  3452. init_tensor_uniform(t, -10.0f, 10.0f);
  3453. }
  3454. }
  3455. };
  3456. // GGML_OP_CEIL
  3457. struct test_ceil : public test_case {
  3458. const ggml_type type;
  3459. const std::array<int64_t, 4> ne;
  3460. std::string vars() override {
  3461. return VARS_TO_STR2(type, ne);
  3462. }
  3463. test_ceil(ggml_type type = GGML_TYPE_F32,
  3464. std::array<int64_t, 4> ne = {10, 2, 2, 2})
  3465. : type(type), ne(ne) {}
  3466. ggml_tensor * build_graph(ggml_context * ctx) override {
  3467. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  3468. ggml_set_param(a);
  3469. ggml_set_name(a, "a");
  3470. ggml_tensor * out = ggml_ceil(ctx, a);
  3471. ggml_set_name(out, "out");
  3472. return out;
  3473. }
  3474. void initialize_tensors(ggml_context * ctx) override {
  3475. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  3476. init_tensor_uniform(t, -10.0f, 10.0f);
  3477. }
  3478. }
  3479. };
  3480. // GGML_OP_ROUND
  3481. struct test_round : public test_case {
  3482. const ggml_type type;
  3483. const std::array<int64_t, 4> ne;
  3484. std::string vars() override {
  3485. return VARS_TO_STR2(type, ne);
  3486. }
  3487. test_round(ggml_type type = GGML_TYPE_F32,
  3488. std::array<int64_t, 4> ne = {10, 2, 2, 2})
  3489. : type(type), ne(ne) {}
  3490. ggml_tensor * build_graph(ggml_context * ctx) override {
  3491. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  3492. ggml_set_param(a);
  3493. ggml_set_name(a, "a");
  3494. ggml_tensor * out = ggml_round(ctx, a);
  3495. ggml_set_name(out, "out");
  3496. return out;
  3497. }
  3498. void initialize_tensors(ggml_context * ctx) override {
  3499. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  3500. init_tensor_uniform(t, -10.0f, 10.0f);
  3501. }
  3502. }
  3503. };
  3504. // GGML_OP_TRUNC
  3505. struct test_trunc : public test_case {
  3506. const ggml_type type;
  3507. const std::array<int64_t, 4> ne;
  3508. std::string vars() override {
  3509. return VARS_TO_STR2(type, ne);
  3510. }
  3511. test_trunc(ggml_type type = GGML_TYPE_F32,
  3512. std::array<int64_t, 4> ne = {10, 2, 2, 2})
  3513. : type(type), ne(ne) {}
  3514. ggml_tensor * build_graph(ggml_context * ctx) override {
  3515. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  3516. ggml_set_param(a);
  3517. ggml_set_name(a, "a");
  3518. ggml_tensor * out = ggml_trunc(ctx, a);
  3519. ggml_set_name(out, "out");
  3520. return out;
  3521. }
  3522. void initialize_tensors(ggml_context * ctx) override {
  3523. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  3524. init_tensor_uniform(t, -10.0f, 10.0f);
  3525. }
  3526. }
  3527. };
  3528. // GGML_OP_DIAG_MASK_INF
  3529. struct test_diag_mask_inf : public test_case {
  3530. const ggml_type type;
  3531. const std::array<int64_t, 4> ne;
  3532. const int n_past;
  3533. std::string vars() override {
  3534. return VARS_TO_STR3(type, ne, n_past);
  3535. }
  3536. test_diag_mask_inf(ggml_type type = GGML_TYPE_F32,
  3537. std::array<int64_t, 4> ne = {10, 10, 3, 2},
  3538. int n_past = 5)
  3539. : type(type), ne(ne), n_past(n_past) {}
  3540. ggml_tensor * build_graph(ggml_context * ctx) override {
  3541. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  3542. ggml_set_param(a);
  3543. ggml_set_name(a, "a");
  3544. ggml_tensor * out = ggml_diag_mask_inf(ctx, a, n_past);
  3545. ggml_set_name(out, "out");
  3546. return out;
  3547. }
  3548. };
  3549. // GGML_OP_SOFT_MAX
  3550. struct test_soft_max : public test_case {
  3551. const ggml_type type;
  3552. const std::array<int64_t, 4> ne;
  3553. const bool mask;
  3554. const bool sinks;
  3555. const ggml_type m_prec;
  3556. const std::array<int64_t, 2> nr23; // broadcast only dims 2 and 3
  3557. const float scale;
  3558. const float max_bias;
  3559. const bool inplace;
  3560. std::string vars() override {
  3561. return VARS_TO_STR9(type, ne, mask, sinks, m_prec, nr23, scale, max_bias, inplace);
  3562. }
  3563. // the 1024 test with bias occasionally fails:
  3564. // SOFT_MAX(type=f32,ne=[1024,16,1,1],mask=1,scale=1.000000,max_bias=8.000000): [SOFT_MAX] NMSE = 0.000000103 > 0.000000100 FAIL
  3565. virtual double max_nmse_err() override {
  3566. return 1e-6;
  3567. }
  3568. test_soft_max(ggml_type type = GGML_TYPE_F32,
  3569. std::array<int64_t, 4> ne = {10, 5, 4, 3},
  3570. bool mask = false,
  3571. bool sinks = false,
  3572. ggml_type m_prec = GGML_TYPE_F32,
  3573. std::array<int64_t, 2> nr23 = {1, 1},
  3574. float scale = 1.0f,
  3575. float max_bias = 0.0f,
  3576. bool inplace = false)
  3577. : type(type), ne(ne), mask(mask), sinks(sinks), m_prec(m_prec), nr23(nr23), scale(scale), max_bias(max_bias), inplace(inplace) {}
  3578. ggml_tensor * build_graph(ggml_context * ctx) override {
  3579. ggml_tensor * a = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2]*nr23[0], ne[3]*nr23[1]);
  3580. ggml_set_param(a);
  3581. ggml_set_name(a, "a");
  3582. ggml_tensor * mask = nullptr;
  3583. if (this->mask) {
  3584. mask = ggml_new_tensor_4d(ctx, m_prec, ne[0], ne[1], ne[2], ne[3]);
  3585. ggml_set_name(mask, "mask");
  3586. }
  3587. ggml_tensor * sinks = nullptr;
  3588. if (this->sinks) {
  3589. sinks = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, ne[2]*nr23[0]);
  3590. ggml_set_name(sinks, "sinks");
  3591. }
  3592. ggml_tensor * out;
  3593. if (inplace) {
  3594. out = ggml_soft_max_ext_inplace(ctx, a, mask, scale, max_bias);
  3595. } else {
  3596. out = ggml_soft_max_ext(ctx, a, mask, scale, max_bias);
  3597. }
  3598. ggml_soft_max_add_sinks(out, sinks);
  3599. ggml_set_name(out, "out");
  3600. return out;
  3601. }
  3602. bool grad_precise() override {
  3603. return true;
  3604. }
  3605. };
  3606. // GGML_OP_SOFT_MAX_BACK
  3607. struct test_soft_max_back : public test_case {
  3608. const ggml_type type;
  3609. const std::array<int64_t, 4> ne;
  3610. const float scale;
  3611. const float max_bias;
  3612. std::string vars() override {
  3613. return VARS_TO_STR4(type, ne, scale, max_bias);
  3614. }
  3615. test_soft_max_back(ggml_type type = GGML_TYPE_F32,
  3616. std::array<int64_t, 4> ne = {10, 5, 4, 3},
  3617. float scale = 1.0f,
  3618. float max_bias = 0.0f)
  3619. : type(type), ne(ne), scale(scale), max_bias(max_bias) {}
  3620. ggml_tensor * build_graph(ggml_context * ctx) override {
  3621. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  3622. ggml_set_name(a, "a");
  3623. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  3624. ggml_set_name(a, "a");
  3625. ggml_tensor * out = ggml_soft_max_ext_back(ctx, a, b, scale, max_bias);
  3626. ggml_set_name(out, "out");
  3627. return out;
  3628. }
  3629. };
  3630. // GGML_OP_ROPE + GGML_OP_ROPE_BACK
  3631. struct test_rope : public test_case {
  3632. const ggml_type type;
  3633. const std::array<int64_t, 4> ne_a;
  3634. int n_dims;
  3635. int mode;
  3636. int n_ctx; // used to generate positions
  3637. float fs; // freq_scale
  3638. float ef; // ext_factor
  3639. float af; // attn_factor
  3640. bool ff;
  3641. int v; // view (1 : non-contiguous a)
  3642. bool forward;
  3643. bool inplace;
  3644. std::string vars() override {
  3645. // forward can be inferred from the op, does not need to be printed
  3646. return VARS_TO_STR11(type, ne_a, n_dims, mode, n_ctx, fs, ef, af, ff, v, inplace);
  3647. }
  3648. test_rope(ggml_type type = GGML_TYPE_F32,
  3649. std::array<int64_t, 4> ne_a = {10, 5, 3, 1},
  3650. int n_dims = 10, int mode = GGML_ROPE_TYPE_NORMAL, int n_ctx = 512, float fs = 1.0f,
  3651. float ef = 0.0f, float af = 0.0f, bool ff = false, int v = 0, bool forward = true, bool inplace = false)
  3652. : type(type), ne_a(ne_a), n_dims(n_dims), mode(mode), n_ctx(n_ctx), fs(fs), ef(ef), af(af), ff(ff), v(v), forward(forward), inplace(inplace) {}
  3653. ggml_tensor * build_graph(ggml_context * ctx) override {
  3654. ggml_tensor * a;
  3655. if (v & 1) {
  3656. auto ne = ne_a; ne[0] *= 2; ne[1] *= 4; ne[2] *= 3;
  3657. a = ggml_new_tensor(ctx, type, 4, ne.data());
  3658. if (forward) {
  3659. ggml_set_param(a);
  3660. }
  3661. ggml_set_name(a, "a");
  3662. a = ggml_view_4d(ctx, a, ne_a[0], ne_a[1], ne_a[2], ne_a[3], a->nb[1], a->nb[2], a->nb[3], 0);
  3663. ggml_set_name(a, "view_of_a");
  3664. } else {
  3665. a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  3666. if (forward) {
  3667. ggml_set_param(a);
  3668. }
  3669. ggml_set_name(a, "a");
  3670. }
  3671. const bool is_mrope = mode & GGML_ROPE_TYPE_MROPE;
  3672. const bool is_vision = mode == GGML_ROPE_TYPE_VISION;
  3673. ggml_tensor * pos;
  3674. if (is_mrope || is_vision) {
  3675. pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, ne_a[2] * 4);
  3676. } else {
  3677. pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, ne_a[2]);
  3678. }
  3679. ggml_set_name(pos, "pos");
  3680. ggml_tensor * freq = nullptr;
  3681. if (ff) {
  3682. freq = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, n_dims/2);
  3683. ggml_set_name(freq, "freq");
  3684. }
  3685. ggml_tensor * out;
  3686. if (is_mrope) {
  3687. if (is_vision) {
  3688. GGML_ASSERT(n_dims/4 > 0);
  3689. int rope_sections[4] = {n_dims/4, n_dims/4, 0, 0}; // Vision-RoPE only use first two dimension for image (x, y) coordinate
  3690. if (forward) {
  3691. if (inplace) {
  3692. out = ggml_rope_multi_inplace(ctx, a, pos, freq, n_dims/2, rope_sections, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  3693. } else {
  3694. out = ggml_rope_multi(ctx, a, pos, freq, n_dims/2, rope_sections, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  3695. }
  3696. } else {
  3697. out = ggml_rope_multi_back(ctx, a, pos, freq, n_dims/2, rope_sections, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  3698. }
  3699. } else {
  3700. GGML_ASSERT(n_dims/3 > 0);
  3701. int rope_sections[4] = {n_dims/3, n_dims/3, n_dims/3, 0};
  3702. if (forward) {
  3703. if (inplace) {
  3704. out = ggml_rope_multi_inplace(ctx, a, pos, freq, n_dims, rope_sections, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  3705. } else {
  3706. out = ggml_rope_multi(ctx, a, pos, freq, n_dims, rope_sections, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  3707. }
  3708. } else {
  3709. out = ggml_rope_multi_back(ctx, a, pos, freq, n_dims, rope_sections, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  3710. }
  3711. }
  3712. } else {
  3713. if (forward) {
  3714. if (inplace) {
  3715. out = ggml_rope_ext_inplace(ctx, a, pos, freq, n_dims, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  3716. } else {
  3717. out = ggml_rope_ext(ctx, a, pos, freq, n_dims, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  3718. }
  3719. } else {
  3720. out = ggml_rope_ext_back(ctx, a, pos, freq, n_dims, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  3721. }
  3722. // TODO: add test with a non-contiguous view as input ; this case is needed for build_rope_2d in clip.cpp
  3723. }
  3724. ggml_set_name(out, "out");
  3725. return out;
  3726. }
  3727. void initialize_tensors(ggml_context * ctx) override {
  3728. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  3729. if (t->type == GGML_TYPE_I32) {
  3730. // pos
  3731. const int num_pos_ids = (mode & GGML_ROPE_TYPE_MROPE) ? ne_a[2] * 4 : ne_a[2];
  3732. std::vector<int> data(num_pos_ids);
  3733. for (int i = 0; i < num_pos_ids; i++) {
  3734. data[i] = rand() % n_ctx;
  3735. }
  3736. ggml_backend_tensor_set(t, data.data(), 0, num_pos_ids * sizeof(int));
  3737. } else {
  3738. if (t->ne[0] == n_dims/2) {
  3739. // frequency factors in the range [0.9f, 1.1f]
  3740. init_tensor_uniform(t, 0.9f, 1.1f);
  3741. } else {
  3742. init_tensor_uniform(t);
  3743. }
  3744. }
  3745. }
  3746. }
  3747. double max_maa_err() override {
  3748. return 1e-3;
  3749. }
  3750. bool grad_precise() override {
  3751. return true;
  3752. }
  3753. };
  3754. // GGML_OP_POOL2D
  3755. struct test_pool2d : public test_case {
  3756. enum ggml_op_pool pool_type;
  3757. const ggml_type type_input;
  3758. const std::array<int64_t, 4> ne_input;
  3759. // kernel size
  3760. const int k0;
  3761. const int k1;
  3762. // stride
  3763. const int s0;
  3764. const int s1;
  3765. // padding
  3766. const int p0;
  3767. const int p1;
  3768. std::string vars() override {
  3769. return VARS_TO_STR9(pool_type, type_input, ne_input, k0, k1, s0, s1, p0, p1);
  3770. }
  3771. test_pool2d(ggml_op_pool pool_type = GGML_OP_POOL_AVG,
  3772. ggml_type type_input = GGML_TYPE_F32,
  3773. std::array<int64_t, 4> ne_input = {10, 10, 3, 1}, // [input_width, input_height, input_channels, 1]
  3774. int k0 = 3, int k1 = 3,
  3775. int s0 = 1, int s1 = 1,
  3776. int p0 = 1, int p1 = 1)
  3777. : pool_type(pool_type), type_input(type_input), ne_input(ne_input), k0(k0), k1(k1), s0(s0), s1(s1), p0(p0), p1(p1) {}
  3778. ggml_tensor * build_graph(ggml_context * ctx) override {
  3779. ggml_tensor * input = ggml_new_tensor(ctx, type_input, 4, ne_input.data());
  3780. ggml_set_param(input);
  3781. ggml_set_name(input, "input");
  3782. ggml_tensor * out = ggml_pool_2d(ctx, input, pool_type, k0, k1, s0, s1, p0, p1);
  3783. ggml_set_name(out, "out");
  3784. return out;
  3785. }
  3786. };
  3787. // GGML_OP_CONV_TRANSPOSE_1D
  3788. struct test_conv_transpose_1d : public test_case {
  3789. const std::array<int64_t, 4> ne_input;
  3790. const std::array<int64_t, 4> ne_kernel;
  3791. const int s0; // stride
  3792. const int p0; // padding
  3793. const int d0; // dilation
  3794. std::string vars() override {
  3795. return VARS_TO_STR5(ne_input, ne_kernel, s0, p0, d0);
  3796. }
  3797. test_conv_transpose_1d(std::array<int64_t, 4> ne_input = {197, 32, 1, 1}, // [input_width, input_channels, 1 /* assert in cpu kernel*/, 1 (should be batch)]
  3798. std::array<int64_t, 4> ne_kernel = {16, 32, 32, 1}, // [kernel_width, output_channels, input_channels, 1 (should be batch)]
  3799. int s0 = 1, int p0 = 0, int d0 = 1)
  3800. : ne_input(ne_input), ne_kernel(ne_kernel), s0(s0), p0(p0), d0(d0) {}
  3801. ggml_tensor * build_graph(ggml_context * ctx) override {
  3802. ggml_tensor * input = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne_input.data());
  3803. ggml_set_name(input, "input");
  3804. ggml_tensor * kernel = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne_kernel.data());
  3805. ggml_set_name(kernel, "kernel");
  3806. ggml_tensor * out = ggml_conv_transpose_1d(ctx, kernel, input, s0, p0, d0);
  3807. ggml_set_name(out, "out");
  3808. return out;
  3809. }
  3810. };
  3811. // GGML_OP_CONV_TRANSPOSE_2D
  3812. struct test_conv_transpose_2d : public test_case {
  3813. const std::array<int64_t, 4> ne_input;
  3814. const std::array<int64_t, 4> ne_kernel;
  3815. const int stride;
  3816. std::string vars() override {
  3817. return VARS_TO_STR3(ne_input, ne_kernel, stride);
  3818. }
  3819. double max_nmse_err() override {
  3820. return 5e-4; // The default 1e-7 is too small for Vulkan.
  3821. }
  3822. test_conv_transpose_2d(std::array<int64_t, 4> ne_input = {10, 10, 3, 1}, // [input_width, input_height, input_channels, 1]
  3823. std::array<int64_t, 4> ne_kernel = {3, 3, 3, 1}, // [kernel_width, kernel_height, input_channels, 1]
  3824. int stride = 1)
  3825. : ne_input(ne_input), ne_kernel(ne_kernel), stride(stride){}
  3826. ggml_tensor * build_graph(ggml_context * ctx) override {
  3827. ggml_tensor * input = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne_input.data());
  3828. ggml_set_name(input, "input");
  3829. ggml_tensor * kernel = ggml_new_tensor(ctx, GGML_TYPE_F16, 4, ne_kernel.data());
  3830. ggml_set_name(kernel, "kernel");
  3831. ggml_tensor * out = ggml_conv_transpose_2d_p0(ctx, kernel, input, stride);
  3832. ggml_set_name(out, "out");
  3833. return out;
  3834. }
  3835. };
  3836. // GGML_OP_IM2COL
  3837. struct test_im2col : public test_case {
  3838. const ggml_type type_input;
  3839. const ggml_type type_kernel;
  3840. const ggml_type dst_type;
  3841. const std::array<int64_t, 4> ne_input;
  3842. const std::array<int64_t, 4> ne_kernel;
  3843. // stride
  3844. const int s0;
  3845. const int s1;
  3846. // padding
  3847. const int p0;
  3848. const int p1;
  3849. // dilation
  3850. const int d0;
  3851. const int d1;
  3852. // mode
  3853. const bool is_2D;
  3854. std::string vars() override {
  3855. return VARS_TO_STR12(type_input, type_kernel, dst_type, ne_input, ne_kernel, s0, s1, p0, p1, d0, d1, is_2D);
  3856. }
  3857. test_im2col(ggml_type type_input = GGML_TYPE_F32, ggml_type type_kernel = GGML_TYPE_F16, ggml_type dst_type = GGML_TYPE_F32,
  3858. std::array<int64_t, 4> ne_input = {10, 10, 3, 1}, // [input_width, input_height, input_channels, 1]
  3859. std::array<int64_t, 4> ne_kernel = {3, 3, 3, 1}, // [kernel_width, kernel_height, input_channels, 1]
  3860. int s0 = 1, int s1 = 1,
  3861. int p0 = 1, int p1 = 1,
  3862. int d0 = 1, int d1 = 1,
  3863. bool is_2D = true)
  3864. : type_input(type_input), type_kernel(type_kernel), dst_type(dst_type), ne_input(ne_input), ne_kernel(ne_kernel), s0(s0), s1(s1), p0(p0), p1(p1), d0(d0), d1(d1), is_2D(is_2D) {}
  3865. ggml_tensor * build_graph(ggml_context * ctx) override {
  3866. ggml_tensor * input = ggml_new_tensor(ctx, type_input, 4, ne_input.data());
  3867. ggml_set_param(input);
  3868. ggml_set_name(input, "input");
  3869. ggml_tensor * kernel = ggml_new_tensor(ctx, type_kernel, 4, ne_kernel.data());
  3870. ggml_set_name(kernel, "kernel");
  3871. ggml_tensor * out = ggml_im2col(ctx, kernel, input, s0, s1, p0, p1, d0, d1, is_2D, dst_type);
  3872. ggml_set_name(out, "out");
  3873. return out;
  3874. }
  3875. };
  3876. // GGML_OP_IM2COL_3D
  3877. struct test_im2col_3d : public test_case {
  3878. const ggml_type type_input;
  3879. const ggml_type type_kernel;
  3880. const ggml_type dst_type;
  3881. const std::array<int64_t, 4> ne_input;
  3882. const std::array<int64_t, 4> ne_kernel;
  3883. // stride
  3884. const int s0;
  3885. const int s1;
  3886. const int s2;
  3887. // padding
  3888. const int p0;
  3889. const int p1;
  3890. const int p2;
  3891. // dilation
  3892. const int d0;
  3893. const int d1;
  3894. const int d2;
  3895. const int64_t IC;
  3896. const bool v;
  3897. std::string vars() override {
  3898. return VARS_TO_STR16(type_input, type_kernel, dst_type, ne_input, ne_kernel, IC, s0, s1, s2, p0, p1, p2, d0, d1, d2, v);
  3899. }
  3900. test_im2col_3d(ggml_type type_input = GGML_TYPE_F32, ggml_type type_kernel = GGML_TYPE_F16, ggml_type dst_type = GGML_TYPE_F32,
  3901. std::array<int64_t, 4> ne_input = {10, 10, 10, 9}, // [OC*IC, KD, KH, KW]
  3902. std::array<int64_t, 4> ne_kernel = {3, 3, 3, 1}, // [N*IC, ID, IH, IW]
  3903. int64_t IC = 3,
  3904. int s0 = 1, int s1 = 1, int s2 = 1,
  3905. int p0 = 1, int p1 = 1, int p2 = 1,
  3906. int d0 = 1, int d1 = 1, int d2 = 1,
  3907. bool v = false)
  3908. : type_input(type_input), type_kernel(type_kernel), dst_type(dst_type), ne_input(ne_input), ne_kernel(ne_kernel), s0(s0), s1(s1), s2(s2), p0(p0), p1(p1), p2(p2), d0(d0), d1(d1), d2(d2), IC(IC), v(v) {}
  3909. ggml_tensor * build_graph(ggml_context * ctx) override {
  3910. ggml_tensor * input = ggml_new_tensor(ctx, type_input, 4, ne_input.data());
  3911. ggml_set_param(input);
  3912. ggml_set_name(input, "input");
  3913. if (v) {
  3914. input = ggml_view_4d(ctx, input, ne_input[0] - 2, ne_input[1] - 2, ne_input[2] - 2, ne_input[3] - 2, input->nb[1], input->nb[2], input->nb[3], 0);
  3915. ggml_set_name(input, "view_of_input");
  3916. }
  3917. ggml_tensor * kernel = ggml_new_tensor(ctx, type_kernel, 4, ne_kernel.data());
  3918. ggml_set_name(kernel, "kernel");
  3919. ggml_tensor * out = ggml_im2col_3d(ctx, kernel, input, IC, s0, s1, s2, p0, p1, p2, d0, d1, d2, dst_type);
  3920. ggml_set_name(out, "out");
  3921. return out;
  3922. }
  3923. };
  3924. // CONV_2D
  3925. struct test_conv_2d : public test_case {
  3926. const std::array<int64_t, 4> ne_input;
  3927. const std::array<int64_t, 4> ne_kernel;
  3928. const ggml_type type_kernel;
  3929. const int stride0;
  3930. const int stride1;
  3931. const int padding0;
  3932. const int padding1;
  3933. const int dilation0;
  3934. const int dilation1;
  3935. // Whether the inputs are contiguous in the channel dim or the width dim
  3936. const bool cwhn;
  3937. // If true, the direct CONV_2D will be used in the graph, otherwise it
  3938. // uses ggml_conv_2d:
  3939. // * if the program is called with -o CONV_2D_DIRECT_IMPL, the
  3940. // CONV_2D graph will be built, while
  3941. // * if the program is called with -o CONV_2D_INDIRECT_IMPL, the
  3942. // IM2COL -> MUL_MM graph will be built.
  3943. std::string vars() override {
  3944. return VARS_TO_STR10(ne_input, ne_kernel, type_kernel, stride0, stride1, padding0, padding1, dilation0, dilation1, cwhn);
  3945. }
  3946. double max_nmse_err() override {
  3947. return 5e-4;
  3948. }
  3949. uint64_t op_flops(ggml_tensor * t) override {
  3950. GGML_UNUSED(t);
  3951. // Just counting matmul costs:
  3952. // KxCRS @ CRSxNPQ = KxNPQ --> KxNPQx(CRS+CRS-1) flops
  3953. // Copied from ggml.c: int64_t ggml_calc_conv_output_size(int64_t ins, int64_t ks, int s, int p, int d)
  3954. auto calc_conv_output_size = [](int64_t ins, int64_t ks, int s, int p, int d) -> int64_t {
  3955. return (ins + 2 * p - d * (ks - 1) - 1) / s + 1;
  3956. };
  3957. int64_t W = ne_input[0];
  3958. int64_t H = ne_input[1];
  3959. int64_t KW = ne_kernel[0];
  3960. int64_t KH = ne_kernel[1];
  3961. int64_t Cin = ne_kernel[2];
  3962. int64_t Cout = ne_kernel[3];
  3963. int64_t N = ne_input[3];
  3964. int64_t OH = calc_conv_output_size(H, KH, stride0, padding0, dilation0);
  3965. int64_t OW = calc_conv_output_size(W, KW, stride0, padding0, dilation0);
  3966. int64_t K = Cout;
  3967. int64_t CRS = Cin * KH * KW;
  3968. int64_t NPQ = N * OH * OW;
  3969. return K * NPQ * (2 * CRS - 1);
  3970. }
  3971. test_conv_2d(std::array<int64_t, 4> ne_input = { 64, 64, 16, 1 },
  3972. std::array<int64_t, 4> ne_kernel = { 3, 3, 1, 16 }, ggml_type type_kernel = GGML_TYPE_F32, int stride0 = 1,
  3973. int stride1 = 1, int padding0 = 0, int padding1 = 0, int dilation0 = 1, int dilation1 = 1, bool cwhn = false) :
  3974. ne_input(ne_input),
  3975. ne_kernel(ne_kernel),
  3976. type_kernel(type_kernel),
  3977. stride0(stride0),
  3978. stride1(stride1),
  3979. padding0(padding0),
  3980. padding1(padding1),
  3981. dilation0(dilation0),
  3982. dilation1(dilation1),
  3983. cwhn(cwhn) {}
  3984. ggml_tensor * build_graph(ggml_context * ctx) override {
  3985. ggml_tensor * input = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne_input.data());
  3986. ggml_set_name(input, "input");
  3987. ggml_tensor * kernel = ggml_new_tensor(ctx, type_kernel, 4, ne_kernel.data());
  3988. ggml_set_name(kernel, "kernel");
  3989. if (cwhn) {
  3990. // change memory layout to channel-most-contiguous (CWHN),
  3991. // then permute it back so NE matches the original input
  3992. input = ggml_cont(ctx, ggml_permute(ctx, input, 1, 2, 0, 3));
  3993. input = ggml_permute(ctx, input, 2, 0, 1, 3);
  3994. kernel = ggml_cont(ctx, ggml_permute(ctx, kernel, 2, 3, 1, 0));
  3995. kernel = ggml_permute(ctx, kernel, 3, 2, 0, 1);
  3996. }
  3997. ggml_tensor * out =
  3998. ggml_conv_2d_direct(ctx, kernel, input, stride0, stride1, padding0, padding1, dilation0, dilation1);
  3999. ggml_set_name(out, "out");
  4000. return out;
  4001. }
  4002. };
  4003. // GGML_OP_CONV_2D_DW
  4004. struct test_conv_2d_dw : public test_case {
  4005. const std::array<int64_t, 4> ne_input;
  4006. const std::array<int64_t, 4> ne_kernel;
  4007. const int stride;
  4008. const int padding;
  4009. const int dilation;
  4010. const bool cwhn;
  4011. std::string vars() override {
  4012. return VARS_TO_STR6(ne_input, ne_kernel, stride, padding, dilation, cwhn);
  4013. }
  4014. test_conv_2d_dw(std::array<int64_t, 4> ne_input = {64, 64, 16, 1},
  4015. std::array<int64_t, 4> ne_kernel = {3, 3, 1, 16},
  4016. int stride = 1, int padding = 0, int dilation = 1, bool cwhn = false)
  4017. : ne_input(ne_input), ne_kernel(ne_kernel), stride(stride), padding(padding), dilation(dilation), cwhn(cwhn) {}
  4018. ggml_tensor * build_graph(ggml_context * ctx) override {
  4019. ggml_tensor * input = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne_input.data());
  4020. ggml_set_name(input, "input");
  4021. ggml_tensor * kernel = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne_kernel.data());
  4022. ggml_set_name(kernel, "kernel");
  4023. if (cwhn) {
  4024. // change memory layout to channel-most-contiguous (CWHN),
  4025. // then permute it back so NE matches the original input
  4026. input = ggml_cont(ctx, ggml_permute(ctx, input, 1, 2, 0, 3));
  4027. input = ggml_permute(ctx, input, 2, 0, 1, 3);
  4028. kernel = ggml_cont(ctx, ggml_permute(ctx, kernel, 2, 3, 1, 0));
  4029. kernel = ggml_permute(ctx, kernel, 3, 2, 0, 1);
  4030. }
  4031. ggml_tensor * out = ggml_conv_2d_dw_direct(
  4032. ctx, kernel, input,
  4033. stride, stride, padding, padding, dilation, dilation);
  4034. ggml_set_name(out, "out");
  4035. return out;
  4036. }
  4037. };
  4038. // GGML_OP_CONV_3D
  4039. struct test_conv_3d : public test_case {
  4040. // Logical 5D dimensions
  4041. const int64_t N, IC, ID, IH, IW;
  4042. const int64_t OC, KD, KH, KW;
  4043. // Conv params
  4044. const int s0, s1, s2;
  4045. const int p0, p1, p2;
  4046. const int d0, d1, d2;
  4047. // Types
  4048. const ggml_type type_kernel;
  4049. std::string op_desc(ggml_tensor * t) override {
  4050. GGML_UNUSED(t);
  4051. return "CONV_3D";
  4052. }
  4053. std::string vars() override {
  4054. return VARS_TO_STR11(N, IC, ID, IH, IW, OC, KD, KH, KW, s0, s1) + "," +
  4055. VARS_TO_STR8(s2, p0, p1, p2, d0, d1, d2, type_kernel);
  4056. }
  4057. double max_nmse_err() override {
  4058. return 5e-4;
  4059. }
  4060. uint64_t op_flops(ggml_tensor * t) override {
  4061. GGML_UNUSED(t);
  4062. auto calc_conv_output_size = [](int64_t ins, int64_t ks, int s, int p, int d) -> int64_t {
  4063. return (ins + 2 * p - d * (ks - 1) - 1) / s + 1;
  4064. };
  4065. const int64_t OD = calc_conv_output_size(ID, KD, s2, p2, d2);
  4066. const int64_t OH = calc_conv_output_size(IH, KH, s1, p1, d1);
  4067. const int64_t OW = calc_conv_output_size(IW, KW, s0, p0, d0);
  4068. return (uint64_t)N * OC * OD * OH * OW * (2 * IC * KD * KH * KW - 1);
  4069. }
  4070. test_conv_3d(
  4071. int64_t N, int64_t IC, int64_t ID, int64_t IH, int64_t IW,
  4072. int64_t OC, int64_t KD, int64_t KH, int64_t KW,
  4073. int s0, int s1, int s2,
  4074. int p0, int p1, int p2,
  4075. int d0, int d1, int d2,
  4076. ggml_type type_kernel
  4077. ) : N(N), IC(IC), ID(ID), IH(IH), IW(IW),
  4078. OC(OC), KD(KD), KH(KH), KW(KW),
  4079. s0(s0), s1(s1), s2(s2),
  4080. p0(p0), p1(p1), p2(p2),
  4081. d0(d0), d1(d1), d2(d2),
  4082. type_kernel(type_kernel) {}
  4083. ggml_tensor * build_graph(ggml_context * ctx) override {
  4084. // GGML input tensor is packed as [W, H, D, C*N]
  4085. const int64_t ne_input[] = {IW, IH, ID, IC * N};
  4086. ggml_tensor * input = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne_input);
  4087. ggml_set_name(input, "input");
  4088. // GGML kernel tensor is packed as [KW, KH, KD, IC*OC]
  4089. const int64_t ne_kernel[] = {KW, KH, KD, IC * OC};
  4090. ggml_tensor * kernel = ggml_new_tensor(ctx, type_kernel, 4, ne_kernel);
  4091. ggml_set_name(kernel, "kernel");
  4092. ggml_tensor * out = ggml_conv_3d_direct(ctx, kernel, input, s0, s1, s2, p0, p1, p2, d0, d1, d2, (int)IC, (int)N, (int)OC);
  4093. ggml_set_name(out, "out");
  4094. return out;
  4095. }
  4096. };
  4097. // GGML_OP_CONCAT
  4098. struct test_concat : public test_case {
  4099. const ggml_type type;
  4100. const std::array<int64_t, 4> ne_a;
  4101. const int64_t ne_b_d;
  4102. const int dim;
  4103. const int v; // view (1 << 0: non-cont a, 1 << 1: non-cont b)
  4104. std::string vars() override {
  4105. return VARS_TO_STR5(type, ne_a, ne_b_d, dim, v);
  4106. }
  4107. test_concat(ggml_type type = GGML_TYPE_F32,
  4108. std::array<int64_t, 4> ne_a = {10, 5, 5, 5},
  4109. int64_t ne_b_d = 5,
  4110. int dim = 2, int v = 0)
  4111. : type(type), ne_a(ne_a), ne_b_d(ne_b_d), dim(dim), v(v) {}
  4112. ggml_tensor * build_graph(ggml_context * ctx) override {
  4113. auto ne_b = ne_a;
  4114. ne_b[dim] = ne_b_d;
  4115. ggml_tensor * a;
  4116. if (v & 1) {
  4117. auto ne = ne_a; ne[0] *= 2; ne[1] *= 4; ne[2] *= 3;
  4118. a = ggml_new_tensor(ctx, type, 4, ne.data());
  4119. ggml_set_name(a, "a");
  4120. a = ggml_view_4d(ctx, a, ne_a[0], ne_a[1], ne_a[2], ne_a[3], a->nb[1], a->nb[2], a->nb[3], 0);
  4121. ggml_set_name(a, "view_of_a");
  4122. } else {
  4123. a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  4124. ggml_set_name(a, "a");
  4125. }
  4126. ggml_tensor * b;
  4127. if (v & 2) {
  4128. auto ne = ne_b; ne[0] *= 3; ne[1] *= 2; ne[2] *= 4;
  4129. b = ggml_new_tensor(ctx, type, 4, ne.data());
  4130. ggml_set_name(b, "b");
  4131. b = ggml_view_4d(ctx, b, ne_b[0], ne_b[1], ne_b[2], ne_b[3], b->nb[1], b->nb[2], b->nb[3], 0);
  4132. ggml_set_name(b, "view_of_b");
  4133. } else {
  4134. b = ggml_new_tensor(ctx, type, 4, ne_b.data());
  4135. ggml_set_name(b, "b");
  4136. }
  4137. ggml_tensor * out = ggml_concat(ctx, a, b, dim);
  4138. ggml_set_name(out, "out");
  4139. return out;
  4140. }
  4141. };
  4142. // GGML_OP_ARGSORT
  4143. struct test_argsort : public test_case {
  4144. const ggml_type type;
  4145. const std::array<int64_t, 4> ne;
  4146. ggml_sort_order order;
  4147. std::string vars() override {
  4148. return VARS_TO_STR3(type, ne, order);
  4149. }
  4150. test_argsort(ggml_type type = GGML_TYPE_F32,
  4151. std::array<int64_t, 4> ne = {16, 10, 10, 10},
  4152. ggml_sort_order order = GGML_SORT_ORDER_ASC)
  4153. : type(type), ne(ne), order(order) {}
  4154. ggml_tensor * build_graph(ggml_context * ctx) override {
  4155. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  4156. ggml_set_name(a, "a");
  4157. ggml_tensor * out = ggml_argsort(ctx, a, order);
  4158. ggml_set_name(out, "out");
  4159. return out;
  4160. }
  4161. void initialize_tensors(ggml_context * ctx) override {
  4162. std::random_device rd;
  4163. std::default_random_engine rng(rd());
  4164. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  4165. if (t->type == GGML_TYPE_I32) {
  4166. // indices
  4167. std::vector<int> data(ggml_nelements(t));
  4168. for (int i = 0; i < ggml_nelements(t); i++) {
  4169. data[i] = rand();
  4170. }
  4171. std::shuffle(data.begin(), data.end(), rng);
  4172. ggml_backend_tensor_set(t, data.data(), 0, ne[0]*ne[1]*ne[2]*ne[3] * sizeof(int));
  4173. } else if (t->type == GGML_TYPE_F32) {
  4174. // initialize with unique values to avoid ties
  4175. for (int64_t r = 0; r < ggml_nrows(t); r++) {
  4176. std::vector<float> data(t->ne[0]);
  4177. for (int i = 0; i < t->ne[0]; i++) {
  4178. data[i] = i;
  4179. }
  4180. std::shuffle(data.begin(), data.end(), rng);
  4181. ggml_backend_tensor_set(t, data.data(), r * t->nb[1], t->ne[0] * sizeof(float));
  4182. }
  4183. } else {
  4184. GGML_ABORT("fatal error");
  4185. }
  4186. }
  4187. }
  4188. };
  4189. // GGML_OP_TOP_K
  4190. struct test_top_k : public test_case {
  4191. const ggml_type type;
  4192. const std::array<int64_t, 4> ne;
  4193. const int k;
  4194. const bool ties;
  4195. ggml_tensor * input {};
  4196. std::string vars() override {
  4197. return VARS_TO_STR4(type, ne, k, ties);
  4198. }
  4199. test_top_k(ggml_type type = GGML_TYPE_F32,
  4200. std::array<int64_t, 4> ne = {16, 10, 10, 10},
  4201. int k = 4, bool ties = false)
  4202. : type(type), ne(ne), k(k), ties(ties) {}
  4203. double max_err() override {
  4204. return 0.0;
  4205. }
  4206. // When there are ties, only validate the final result.
  4207. // The logic in err can't handle the sentinel tensors.
  4208. bool run_whole_graph() override { return ties; }
  4209. double err(const float * a, const float * b, size_t n) override {
  4210. // When there are no ties, we expect the exact same set of indices,
  4211. // but possibly in a different order. When there are ties, the indices
  4212. // can be different but the input values they correspond to should be
  4213. // the same. The logic for ties could work for non-ties, but only for
  4214. // the output tensor, not for the sentinel tensors.
  4215. if (ties) {
  4216. std::vector<float> src(ggml_nelements(input));
  4217. ggml_backend_tensor_get(input, src.data(), 0, ggml_nelements(input) * ggml_type_size(type));
  4218. double diff = 0.0f;
  4219. GGML_ASSERT(n == (size_t)(ggml_nrows(input) * k));
  4220. int64_t cols = input->ne[0];
  4221. std::vector<int32_t> ia(k);
  4222. std::vector<int32_t> ib(k);
  4223. std::vector<float> asrc(k);
  4224. std::vector<float> bsrc(k);
  4225. for (int64_t r = 0; r < ggml_nrows(input); r++) {
  4226. // Convert indices for the row back to integer
  4227. for (int64_t c = 0; c < k; c++) {
  4228. ia[c] = (int32_t)a[r * k + c];
  4229. ib[c] = (int32_t)b[r * k + c];
  4230. }
  4231. // The src values for each row should match.
  4232. for (int64_t c = 0; c < k; c++) {
  4233. asrc[c] = src[r * cols + ia[c]];
  4234. bsrc[c] = src[r * cols + ib[c]];
  4235. }
  4236. diff += jdst(asrc.data(), bsrc.data(), k);
  4237. // There should be no duplicate indices
  4238. std::sort(ia.begin(), ia.end());
  4239. std::sort(ib.begin(), ib.end());
  4240. if (std::adjacent_find(ia.begin(), ia.end()) != ia.end()) {
  4241. diff += 1;
  4242. }
  4243. if (std::adjacent_find(ib.begin(), ib.end()) != ib.end()) {
  4244. diff += 1;
  4245. }
  4246. }
  4247. return diff;
  4248. } else {
  4249. std::vector<int32_t> ia(n);
  4250. std::vector<int32_t> ib(n);
  4251. double diff = 0.0f;
  4252. for (size_t i = 0; i < n; i++) {
  4253. ia[i] = (int32_t) a[i];
  4254. ib[i] = (int32_t) b[i];
  4255. // penalize the result if the data is not integer valued
  4256. diff += std::fabs(a[i] - ia[i]);
  4257. diff += std::fabs(b[i] - ib[i]);
  4258. }
  4259. return diff + jdst(ia.data(), ib.data(), n);
  4260. }
  4261. }
  4262. ggml_tensor * build_graph(ggml_context * ctx) override {
  4263. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  4264. ggml_set_name(a, "a");
  4265. // Save 'a' for err()
  4266. input = a;
  4267. ggml_tensor * out = ggml_top_k(ctx, a, k);
  4268. ggml_set_name(out, "out");
  4269. return out;
  4270. }
  4271. void initialize_tensors(ggml_context * ctx) override {
  4272. std::random_device rd;
  4273. std::default_random_engine rng(rd());
  4274. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  4275. int tie_denom = std::max(1, std::min(10, k / 2));
  4276. for (int64_t r = 0; r < ggml_nrows(t); r++) {
  4277. std::vector<float> data(t->ne[0]);
  4278. for (int i = 0; i < t->ne[0]; i++) {
  4279. if (ties) {
  4280. // integer division to introduce duplicates
  4281. data[i] = i / tie_denom;
  4282. } else {
  4283. data[i] = i;
  4284. }
  4285. }
  4286. std::shuffle(data.begin(), data.end(), rng);
  4287. ggml_backend_tensor_set(t, data.data(), r * t->nb[1], t->ne[0] * sizeof(float));
  4288. }
  4289. }
  4290. }
  4291. };
  4292. enum MoeGatingFunc {
  4293. GATING_FUNC_SOFTMAX,
  4294. GATING_FUNC_SIGMOID,
  4295. GATING_FUNC_SOFTMAX_WEIGHT,
  4296. };
  4297. struct test_topk_moe : public test_case {
  4298. const std::array<int64_t, 4> ne;
  4299. const int n_expert_used;
  4300. const bool with_norm;
  4301. const bool bias_probs;
  4302. const MoeGatingFunc gating_func;
  4303. const float scale_w;
  4304. ggml_tensor * weights {};
  4305. ggml_tensor * selected_experts {};
  4306. test_topk_moe(std::array<int64_t, 4> ne = { 10, 5, 1, 1 },
  4307. int n_expert_used = 1,
  4308. bool with_norm = false,
  4309. bool bias_probs = false,
  4310. MoeGatingFunc gating_func = GATING_FUNC_SOFTMAX,
  4311. float scale_w = 0.0f) :
  4312. ne(ne),
  4313. n_expert_used(n_expert_used),
  4314. with_norm(with_norm),
  4315. bias_probs(bias_probs),
  4316. gating_func(gating_func),
  4317. scale_w(scale_w) {
  4318. GGML_ASSERT(n_expert_used <= ne[0]);
  4319. }
  4320. std::string vars() override { return VARS_TO_STR6(ne, n_expert_used, with_norm, bias_probs, gating_func, scale_w); }
  4321. std::string op_desc(ggml_tensor * t) override {
  4322. GGML_UNUSED(t);
  4323. return "TOPK_MOE";
  4324. }
  4325. bool run_whole_graph() override { return true; }
  4326. ggml_tensor * build_graph(ggml_context * ctx) override {
  4327. const int n_expert = ne[0];
  4328. const int n_tokens = ne[1];
  4329. ggml_tensor * logits = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne.data());
  4330. ggml_tensor * probs =
  4331. (gating_func == GATING_FUNC_SOFTMAX) ? ggml_soft_max(ctx, logits) :
  4332. (gating_func == GATING_FUNC_SIGMOID) ? ggml_sigmoid(ctx, logits) : logits;
  4333. ggml_set_name(probs, "probs");
  4334. ggml_tensor * selection_probs = probs;
  4335. if (bias_probs) {
  4336. ggml_tensor * exp_probs_b = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, ne[0]);
  4337. ggml_set_name(exp_probs_b, "exp_probs_b");
  4338. selection_probs = ggml_add(ctx, probs, exp_probs_b);
  4339. ggml_set_name(selection_probs, "selection_probs");
  4340. }
  4341. selected_experts = ggml_argsort_top_k(ctx, selection_probs, n_expert_used); // [n_expert_used, n_tokens]
  4342. ggml_set_name(selected_experts, "selected_experts");
  4343. weights = ggml_get_rows(ctx, ggml_reshape_3d(ctx, probs, 1, n_expert, n_tokens), selected_experts); // [1, n_expert_used, n_tokens]
  4344. ggml_set_name(weights, "weights");
  4345. if (gating_func == GATING_FUNC_SOFTMAX_WEIGHT) {
  4346. weights = ggml_reshape_2d(ctx, weights, n_expert_used, n_tokens);
  4347. weights = ggml_soft_max(ctx, weights); // [n_expert_used, n_tokens]
  4348. weights = ggml_reshape_3d(ctx, weights, 1, n_expert_used, n_tokens);
  4349. }
  4350. if (with_norm) {
  4351. weights = ggml_reshape_2d(ctx, weights, n_expert_used, n_tokens);
  4352. ggml_tensor * weights_sum = ggml_sum_rows(ctx, weights); // [1, n_tokens]
  4353. ggml_set_name(weights_sum, "weights_sum");
  4354. weights_sum = ggml_clamp(ctx, weights_sum, 6.103515625e-5, INFINITY);
  4355. weights = ggml_div(ctx, weights, weights_sum); // [n_expert_used, n_tokens]
  4356. weights = ggml_reshape_3d(ctx, weights, 1, n_expert_used, n_tokens);
  4357. }
  4358. if (scale_w) {
  4359. weights = ggml_scale(ctx, weights, scale_w);
  4360. }
  4361. ggml_set_name(weights, "weights");
  4362. return weights;
  4363. }
  4364. // Verify two outputs
  4365. std::vector<ggml_tensor *> fusion_test_nodes() override { return { selected_experts, weights }; }
  4366. // allow output in arbitrary order
  4367. double err(const float * a, const float * b, size_t n) override {
  4368. std::vector<float> a2(n);
  4369. std::vector<float> b2(n);
  4370. for (size_t i = 0; i < n; ++i) {
  4371. a2[i] = a[i];
  4372. b2[i] = b[i];
  4373. }
  4374. std::sort(a2.begin(), a2.end());
  4375. std::sort(b2.begin(), b2.end());
  4376. return nmse(a2.data(), b2.data(), n);
  4377. }
  4378. };
  4379. struct test_mul_mat_vec_fusion : public test_case {
  4380. const ggml_type type;
  4381. const ggml_glu_op glu_op;
  4382. const int64_t m;
  4383. const int64_t n;
  4384. const int64_t k;
  4385. const bool use_id;
  4386. const int n_mats;
  4387. const int n_used;
  4388. const bool b; // broadcast b matrix (only for use_id)
  4389. const bool with_bias;
  4390. const bool with_gate;
  4391. std::array<int64_t, 2> batch_dims;
  4392. test_mul_mat_vec_fusion(ggml_type type, ggml_glu_op op, int64_t m, int64_t n, int64_t k,
  4393. bool use_id = false, int n_mats = 1, int n_used = 1, bool b = false, bool with_bias = false, bool with_gate = true,
  4394. std::array<int64_t, 2> batch_dims = {4, 2})
  4395. : type(type), glu_op(op), m(m), n(n), k(k), use_id(use_id), n_mats(n_mats), n_used(n_used), b(b), with_bias(with_bias), with_gate(with_gate), batch_dims(batch_dims) {
  4396. if (use_id) {
  4397. GGML_ASSERT(n_used <= n_mats);
  4398. }
  4399. }
  4400. std::string vars() override {
  4401. return VARS_TO_STR12(type, glu_op, m, n, k, use_id, n_mats, n_used, b, with_bias, with_gate, batch_dims);
  4402. }
  4403. std::string op_desc(ggml_tensor * t) override {
  4404. GGML_UNUSED(t);
  4405. return "MUL_MAT_VEC_FUSION";
  4406. }
  4407. bool run_whole_graph() override { return true; }
  4408. ggml_tensor * build_gate(ggml_context * ctx, ggml_tensor * ffn_gate, ggml_tensor * ffn_up) {
  4409. ggml_tensor * out = nullptr;
  4410. if (with_gate) {
  4411. if (glu_op == GGML_GLU_OP_SWIGLU_OAI) {
  4412. constexpr float alpha = 1.702f;
  4413. constexpr float limit = 7.0f;
  4414. out = ggml_swiglu_oai(ctx, ffn_gate, ffn_up, alpha, limit);
  4415. } else {
  4416. out = ggml_glu_split(ctx, ffn_gate, ffn_up, glu_op);
  4417. }
  4418. }
  4419. return out;
  4420. }
  4421. ggml_tensor * build_graph(ggml_context * ctx) override {
  4422. if (!use_id) {
  4423. const int channels = batch_dims[0];
  4424. const int samples = batch_dims[1];
  4425. std::array<int64_t, 4> ne = { k, m, channels, samples };
  4426. std::array<int64_t, 4> ne0 = { k, n, channels, samples };
  4427. ggml_tensor * cur = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne.data());
  4428. ggml_tensor * gate = with_gate ? ggml_new_tensor(ctx, type, 4, ne0.data()) : nullptr;
  4429. ggml_tensor * up = ggml_new_tensor(ctx, type, 4, ne0.data());
  4430. ggml_tensor * ffn_up = ggml_mul_mat(ctx, up, cur);
  4431. if (with_bias) {
  4432. std::array<int64_t, 4> bias_ne = { ffn_up->ne[0], 1, channels, samples };
  4433. ggml_tensor * up_bias = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, bias_ne.data());
  4434. ffn_up = ggml_add(ctx, ffn_up, up_bias);
  4435. }
  4436. ggml_tensor * ffn_gate = with_gate ? ggml_mul_mat(ctx, gate, cur) : nullptr;
  4437. if (with_bias && with_gate) {
  4438. std::array<int64_t, 4> bias_ne = { ffn_gate->ne[0], 1, channels, samples };
  4439. ggml_tensor * gate_bias = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, bias_ne.data());
  4440. ffn_gate = ggml_add(ctx, ffn_gate, gate_bias);
  4441. }
  4442. ggml_tensor * out = with_gate ? build_gate(ctx, ffn_gate, ffn_up) : ffn_up;
  4443. std::array<int64_t, 4> bias2_ne = { out->ne[0], 1, channels, samples };
  4444. ggml_tensor * bias2 = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, bias2_ne.data());
  4445. out = ggml_add(ctx, out, bias2);
  4446. ggml_set_name(out, "out");
  4447. return out;
  4448. } else {
  4449. ggml_tensor * gates = ggml_new_tensor_3d(ctx, type, k, n, n_mats);
  4450. ggml_tensor * ups = ggml_new_tensor_3d(ctx, type, k, n, n_mats);
  4451. ggml_tensor * ids = ggml_new_tensor_2d(ctx, GGML_TYPE_I32, n_mats, m);
  4452. if (n_used != n_mats) {
  4453. ids = ggml_view_2d(ctx, ids, n_used, m, ids->nb[1], 0);
  4454. }
  4455. ggml_tensor * cur = ggml_new_tensor_3d(ctx, GGML_TYPE_F32, k, this->b ? 1 : n_used, m);
  4456. ggml_set_name(cur, "cur");
  4457. ggml_tensor * ffn_up = ggml_mul_mat_id(ctx, ups, cur, ids);
  4458. if (with_bias) {
  4459. ggml_tensor * up_bias_param = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, ffn_up->ne[0], n_mats);
  4460. ffn_up = ggml_add_id(ctx, ffn_up, up_bias_param, ids);
  4461. }
  4462. ggml_tensor * ffn_gate = with_gate? ggml_mul_mat_id(ctx, gates, cur, ids) : nullptr;
  4463. if (with_bias && with_gate) {
  4464. ggml_tensor * gate_bias_param = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, ffn_gate->ne[0], n_mats);
  4465. ffn_gate = ggml_add_id(ctx, ffn_gate, gate_bias_param, ids);
  4466. }
  4467. ggml_tensor * out = with_gate ? build_gate(ctx, ffn_gate, ffn_up) : ffn_up;
  4468. std::array<int64_t, 4> scale_ne { 1, out->ne[1], out->ne[2], out->ne[3] };
  4469. ggml_tensor * scale = ggml_new_tensor(ctx, out->type, 4, scale_ne.data());
  4470. out = ggml_mul(ctx, out, scale);
  4471. ggml_set_name(out, "out");
  4472. return out;
  4473. }
  4474. }
  4475. void initialize_tensors(ggml_context * ctx) override {
  4476. if (!use_id) {
  4477. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  4478. init_tensor_uniform(t);
  4479. }
  4480. } else {
  4481. init_mul_mat_id_tensors(ctx, n_mats);
  4482. }
  4483. }
  4484. double max_nmse_err() override {
  4485. return 5e-3;
  4486. }
  4487. };
  4488. // GGML_OP_SUM
  4489. struct test_sum : public test_case {
  4490. const ggml_type type;
  4491. const std::array<int64_t, 4> ne;
  4492. const std::array<int64_t, 4> permute;
  4493. bool _use_permute;
  4494. std::string vars() override {
  4495. std::string v = VARS_TO_STR2(type, ne);
  4496. if (_use_permute) v += "," + VAR_TO_STR(permute);
  4497. return v;
  4498. }
  4499. test_sum(ggml_type type = GGML_TYPE_F32,
  4500. std::array<int64_t, 4> ne = {10, 5, 4, 3},
  4501. std::array<int64_t, 4> permute = {0, 0, 0, 0})
  4502. : type(type), ne(ne), permute(permute),
  4503. _use_permute(permute[0] + permute[1] + permute[2] + permute[3] > 0) {}
  4504. ggml_tensor * build_graph(ggml_context * ctx) override {
  4505. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  4506. ggml_set_param(a);
  4507. ggml_set_name(a, "a");
  4508. if (_use_permute) {
  4509. a = ggml_permute(ctx, a, permute[0], permute[1], permute[2], permute[3]);
  4510. ggml_set_name(a, "a_permuted");
  4511. }
  4512. ggml_tensor * out = ggml_sum(ctx, a);
  4513. ggml_set_name(out, "out");
  4514. return out;
  4515. }
  4516. float grad_eps() override {
  4517. return 0.1f * sqrtf(ne[0]*ne[1]*ne[2]*ne[3]);
  4518. }
  4519. // Don't center the distribution around zero. Helps to avoid catastrophic cancellation.
  4520. void initialize_tensors(ggml_context * ctx) override {
  4521. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != nullptr; t = ggml_get_next_tensor(ctx, t)) {
  4522. init_tensor_uniform(t, -0.9f, 1.1f);
  4523. }
  4524. }
  4525. };
  4526. // GGML_OP_SUM_ROWS
  4527. struct test_sum_rows : public test_case {
  4528. const ggml_type type;
  4529. const std::array<int64_t, 4> ne;
  4530. const bool permute;
  4531. const bool slice;
  4532. std::string vars() override {
  4533. return VARS_TO_STR4(type, ne, permute, slice);
  4534. }
  4535. test_sum_rows(ggml_type type = GGML_TYPE_F32,
  4536. std::array<int64_t, 4> ne = {10, 5, 4, 3},
  4537. bool permute = false, bool slice = false)
  4538. : type(type), ne(ne), permute(permute), slice(slice) {}
  4539. ggml_tensor * build_graph(ggml_context * ctx) override {
  4540. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  4541. ggml_set_param(a);
  4542. ggml_set_name(a, "a");
  4543. if (slice) {
  4544. a = ggml_view_4d(ctx, a,
  4545. ne[0], ne[1], ne[2] / 2, ne[3] - 1,
  4546. a->nb[1], a->nb[2] * 2, a->nb[3], /*offset=*/a->nb[3]);
  4547. }
  4548. if (permute) {
  4549. a = ggml_permute(ctx, a, 0, 2, 3, 1);
  4550. }
  4551. ggml_tensor * out = ggml_sum_rows(ctx, a);
  4552. ggml_set_name(out, "out");
  4553. return out;
  4554. }
  4555. };
  4556. // GGML_OP_MEAN
  4557. struct test_mean : public test_case {
  4558. const ggml_type type;
  4559. const std::array<int64_t, 4> ne;
  4560. std::string vars() override {
  4561. return VARS_TO_STR2(type, ne);
  4562. }
  4563. test_mean(ggml_type type = GGML_TYPE_F32,
  4564. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  4565. : type(type), ne(ne) {}
  4566. ggml_tensor * build_graph(ggml_context * ctx) override {
  4567. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  4568. ggml_set_param(a);
  4569. ggml_set_name(a, "a");
  4570. ggml_tensor * out = ggml_mean(ctx, a);
  4571. ggml_set_name(out, "out");
  4572. return out;
  4573. }
  4574. float grad_eps() override {
  4575. return 0.1f * ne[0]*ne[1]*ne[2]*ne[3];
  4576. }
  4577. // Don't center the distribution around zero. Helps to avoid catastrophic cancellation.
  4578. void initialize_tensors(ggml_context * ctx) override {
  4579. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != nullptr; t = ggml_get_next_tensor(ctx, t)) {
  4580. init_tensor_uniform(t, -0.9f, 1.1f);
  4581. }
  4582. }
  4583. };
  4584. // GGML_OP_UPSCALE
  4585. struct test_upscale : public test_case {
  4586. const ggml_type type;
  4587. const std::array<int64_t, 4> ne;
  4588. const int32_t scale_factor;
  4589. const bool transpose;
  4590. const ggml_scale_mode mode;
  4591. std::string vars() override {
  4592. return VARS_TO_STR5(type, ne, scale_factor, mode, transpose);
  4593. }
  4594. test_upscale(ggml_type type = GGML_TYPE_F32,
  4595. std::array<int64_t, 4> ne = {512, 512, 3, 1},
  4596. int32_t scale_factor = 2, ggml_scale_mode mode = GGML_SCALE_MODE_NEAREST, bool transpose = false)
  4597. : type(type), ne(ne), scale_factor(scale_factor), transpose(transpose), mode(mode) {}
  4598. ggml_tensor * build_graph(ggml_context * ctx) override {
  4599. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  4600. ggml_set_name(a, "a");
  4601. if (transpose) {
  4602. a = ggml_transpose(ctx, a);
  4603. ggml_set_name(a, "a_transposed");
  4604. }
  4605. ggml_tensor * out = ggml_upscale(ctx, a, scale_factor, mode);
  4606. ggml_set_name(out, "out");
  4607. return out;
  4608. }
  4609. };
  4610. // GGML_OP_UPSCALE (via ggml_interpolate)
  4611. struct test_interpolate : public test_case {
  4612. const ggml_type type;
  4613. const std::array<int64_t, 4> ne;
  4614. const std::array<int64_t, 4> ne_tgt;
  4615. const ggml_scale_mode mode = GGML_SCALE_MODE_NEAREST;
  4616. std::string vars() override {
  4617. return VARS_TO_STR4(type, ne, ne_tgt, mode);
  4618. }
  4619. test_interpolate(ggml_type type = GGML_TYPE_F32,
  4620. std::array<int64_t, 4> ne = {2, 5, 7, 11},
  4621. std::array<int64_t, 4> ne_tgt = {5, 7, 11, 13},
  4622. ggml_scale_mode mode = GGML_SCALE_MODE_NEAREST)
  4623. : type(type), ne(ne), ne_tgt(ne_tgt), mode(mode) {}
  4624. ggml_tensor * build_graph(ggml_context * ctx) override {
  4625. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  4626. ggml_set_name(a, "a");
  4627. ggml_tensor * out = ggml_interpolate(ctx, a, ne_tgt[0], ne_tgt[1],ne_tgt[2], ne_tgt[3], mode);
  4628. ggml_set_name(out, "out");
  4629. return out;
  4630. }
  4631. };
  4632. // GGML_OP_GROUP_NORM
  4633. struct test_group_norm : public test_case {
  4634. const ggml_type type;
  4635. const std::array<int64_t, 4> ne;
  4636. const int32_t num_groups;
  4637. const float eps;
  4638. std::string vars() override {
  4639. return VARS_TO_STR4(type, ne, num_groups, eps);
  4640. }
  4641. test_group_norm(ggml_type type = GGML_TYPE_F32,
  4642. std::array<int64_t, 4> ne = {64, 64, 320, 1},
  4643. int32_t num_groups = 32,
  4644. float eps = 1e-6f)
  4645. : type(type), ne(ne), num_groups(num_groups), eps(eps) {}
  4646. ggml_tensor * build_graph(ggml_context * ctx) override {
  4647. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  4648. ggml_set_name(a, "a");
  4649. ggml_tensor * out = ggml_group_norm(ctx, a, num_groups, eps);
  4650. ggml_set_name(out, "out");
  4651. return out;
  4652. }
  4653. };
  4654. // GGML_OP_GROUP_NORM + GGML_OP_MUL + GGML_OP_ADD
  4655. struct test_group_norm_mul_add : public test_case {
  4656. const ggml_type type;
  4657. const std::array<int64_t, 4> ne;
  4658. int num_groups;
  4659. float eps;
  4660. std::string op_desc(ggml_tensor * t) override {
  4661. GGML_UNUSED(t);
  4662. return "GROUP_NORM_MUL_ADD";
  4663. }
  4664. bool run_whole_graph() override { return true; }
  4665. std::string vars() override {
  4666. return VARS_TO_STR4(type, ne, num_groups, eps);
  4667. }
  4668. test_group_norm_mul_add(ggml_type type = GGML_TYPE_F32,
  4669. std::array<int64_t, 4> ne = {128, 1, 1, 1},
  4670. int num_groups = 4,
  4671. float eps = 1e-5f)
  4672. : type(type), ne(ne), num_groups(num_groups), eps(eps) {}
  4673. ggml_tensor * build_graph(ggml_context * ctx) override {
  4674. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  4675. ggml_tensor * w = ggml_new_tensor(ctx, type, 4, ne.data());
  4676. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  4677. ggml_set_param(a); ggml_set_param(w); ggml_set_param(b);
  4678. ggml_set_name(a, "a"); ggml_set_name(w, "w"); ggml_set_name(b, "b");
  4679. ggml_tensor * n = ggml_group_norm(ctx, a, num_groups, eps);
  4680. ggml_tensor * m = ggml_mul(ctx, n, w);
  4681. ggml_tensor * out = ggml_add(ctx, m, b);
  4682. ggml_set_name(out, "out");
  4683. return out;
  4684. }
  4685. };
  4686. // GGML_OP_L2_NORM
  4687. struct test_l2_norm : public test_case {
  4688. const ggml_type type;
  4689. const std::array<int64_t, 4> ne;
  4690. const float eps;
  4691. std::string vars() override {
  4692. return VARS_TO_STR2(type, ne);
  4693. }
  4694. test_l2_norm(ggml_type type = GGML_TYPE_F32,
  4695. std::array<int64_t, 4> ne = {64, 64, 320, 1},
  4696. float eps = 1e-12f)
  4697. : type(type), ne(ne), eps(eps) {}
  4698. ggml_tensor * build_graph(ggml_context * ctx) override {
  4699. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  4700. ggml_set_name(a, "a");
  4701. ggml_tensor * out = ggml_l2_norm(ctx, a, eps);
  4702. ggml_set_name(out, "out");
  4703. return out;
  4704. }
  4705. };
  4706. // GGML_OP_ACC
  4707. struct test_acc : public test_case {
  4708. const ggml_type type;
  4709. const std::array<int64_t, 4> ne_a;
  4710. const std::array<int64_t, 4> ne_b;
  4711. std::string vars() override {
  4712. return VARS_TO_STR3(type, ne_a, ne_b);
  4713. }
  4714. test_acc(ggml_type type = GGML_TYPE_F32,
  4715. std::array<int64_t, 4> ne_a = {256, 17, 1, 1},
  4716. std::array<int64_t, 4> ne_b = {256, 16, 1, 1})
  4717. : type(type), ne_a(ne_a), ne_b(ne_b) {}
  4718. ggml_tensor * build_graph(ggml_context * ctx) override {
  4719. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  4720. ggml_set_param(a);
  4721. ggml_set_name(a, "a");
  4722. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne_b.data());
  4723. ggml_set_param(b);
  4724. ggml_set_name(b, "b");
  4725. ggml_tensor * out = ggml_acc(ctx, a, b, a->nb[1], a->nb[2], a->nb[3], b->nb[1]);
  4726. ggml_set_name(out, "out");
  4727. return out;
  4728. }
  4729. };
  4730. // GGML_OP_PAD
  4731. struct test_pad : public test_case {
  4732. const ggml_type type;
  4733. const std::array<int64_t, 4> ne_a;
  4734. const int pad_0;
  4735. const int pad_1;
  4736. const bool circular;
  4737. std::string vars() override {
  4738. return VARS_TO_STR5(type, ne_a, pad_0, pad_1, circular);
  4739. }
  4740. test_pad(ggml_type type = GGML_TYPE_F32,
  4741. std::array<int64_t, 4> ne_a = {512, 512, 1, 1},
  4742. int pad_0 = 1, int pad_1 = 1, bool circular = false)
  4743. : type(type), ne_a(ne_a), pad_0(pad_0), pad_1(pad_1), circular(circular) {}
  4744. ggml_tensor * build_graph(ggml_context * ctx) override {
  4745. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  4746. ggml_set_name(a, "a");
  4747. ggml_tensor * out = circular
  4748. ? ggml_pad_circular(ctx, a, pad_0, pad_1, 0, 0)
  4749. : ggml_pad(ctx, a, pad_0, pad_1, 0, 0);
  4750. ggml_set_name(out, "out");
  4751. return out;
  4752. }
  4753. };
  4754. // GGML_OP_PAD (with extension)
  4755. struct test_pad_ext : public test_case {
  4756. const ggml_type type;
  4757. const std::array<int64_t, 4> ne_a;
  4758. const int lp0;
  4759. const int rp0;
  4760. const int lp1;
  4761. const int rp1;
  4762. const int lp2;
  4763. const int rp2;
  4764. const int lp3;
  4765. const int rp3;
  4766. const bool v;
  4767. const bool circular;
  4768. std::string vars() override {
  4769. return VARS_TO_STR12(type, ne_a, lp0, rp0, lp1, rp1, lp2, rp2, lp3, rp3, v, circular);
  4770. }
  4771. test_pad_ext(ggml_type type = GGML_TYPE_F32,
  4772. std::array<int64_t, 4> ne_a = {512, 512, 3, 1},
  4773. int lp0 = 1, int rp0 = 1, int lp1 = 1, int rp1 = 1,
  4774. int lp2 = 1, int rp2 = 1, int lp3 = 1, int rp3 = 1,
  4775. bool v = false, bool circular = false)
  4776. : type(type), ne_a(ne_a), lp0(lp0), rp0(rp0), lp1(lp1), rp1(rp1), lp2(lp2), rp2(rp2), lp3(lp3), rp3(rp3),
  4777. v(v), circular(circular) {}
  4778. ggml_tensor * build_graph(ggml_context * ctx) override {
  4779. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  4780. ggml_set_name(a, "a");
  4781. if (v) {
  4782. a = ggml_view_4d(ctx, a, (a->ne[0] + 1) / 2, (a->ne[1] + 1) / 2, (a->ne[2] + 1) / 2, (a->ne[3] + 1) / 2, a->nb[1], a->nb[2], a->nb[3], 0);
  4783. ggml_set_name(a, "view of a");
  4784. }
  4785. ggml_tensor * out = circular
  4786. ? ggml_pad_ext_circular(ctx, a, lp0, rp0, lp1, rp1, lp2, rp2, lp3, rp3)
  4787. : ggml_pad_ext(ctx, a, lp0, rp0, lp1, rp1, lp2, rp2, lp3, rp3);
  4788. ggml_set_name(out, "out");
  4789. return out;
  4790. }
  4791. };
  4792. // GGML_OP_PAD_REFLECT_1D
  4793. struct test_pad_reflect_1d : public test_case {
  4794. const ggml_type type;
  4795. const std::array<int64_t, 4> ne_a;
  4796. const int pad_0;
  4797. const int pad_1;
  4798. std::string vars() override {
  4799. return VARS_TO_STR4(type, ne_a, pad_0, pad_1);
  4800. }
  4801. test_pad_reflect_1d(ggml_type type = GGML_TYPE_F32,
  4802. std::array<int64_t, 4> ne_a = {512, 34, 2, 1},
  4803. int pad_0 = 10, int pad_1 = 9)
  4804. : type(type), ne_a(ne_a), pad_0(pad_0), pad_1(pad_1) {}
  4805. ggml_tensor * build_graph(ggml_context * ctx) override {
  4806. ggml_tensor * a = ggml_new_tensor(ctx, type, 2, ne_a.data());
  4807. ggml_set_name(a, "a");
  4808. ggml_tensor * out = ggml_pad_reflect_1d(ctx, a, pad_0, pad_1);
  4809. ggml_set_name(out, "out");
  4810. return out;
  4811. }
  4812. };
  4813. // GGML_OP_ROLL
  4814. struct test_roll : public test_case {
  4815. const int shift0;
  4816. const int shift1;
  4817. const int shift3;
  4818. const int shift4;
  4819. std::string vars() override {
  4820. return VARS_TO_STR4(shift0, shift1, shift3, shift4);
  4821. }
  4822. test_roll(int shift0 = 3, int shift1 = -2, int shift3 = 1, int shift4 = -1)
  4823. : shift0(shift0), shift1(shift1), shift3(shift3), shift4(shift4) {}
  4824. ggml_tensor * build_graph(ggml_context * ctx) override {
  4825. int64_t ne[4] = {10, 5, 4, 3};
  4826. ggml_tensor * a = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne);
  4827. ggml_set_name(a, "a");
  4828. ggml_tensor * out = ggml_roll(ctx, a, shift0, shift1, shift3, shift4);
  4829. ggml_set_name(out, "out");
  4830. return out;
  4831. }
  4832. };
  4833. // GGML_OP_ARANGE
  4834. struct test_arange : public test_case {
  4835. const ggml_type type;
  4836. const float start;
  4837. const float stop;
  4838. const float step;
  4839. std::string vars() override {
  4840. return VARS_TO_STR4(type, start, stop, step);
  4841. }
  4842. test_arange(ggml_type type = GGML_TYPE_F32,
  4843. float start = 0.f, float stop = 10.f, float step = 1.f)
  4844. : type(type), start(start), stop(stop), step(step) {}
  4845. ggml_tensor * build_graph(ggml_context * ctx) override {
  4846. ggml_tensor * out = ggml_arange(ctx, start, stop, step);
  4847. ggml_set_name(out, "out");
  4848. return out;
  4849. }
  4850. };
  4851. // GGML_OP_TIMESTEP_EMBEDDING
  4852. struct test_timestep_embedding : public test_case {
  4853. const ggml_type type;
  4854. const std::array<int64_t, 4> ne_a;
  4855. const int dim;
  4856. const int max_period;
  4857. std::string vars() override {
  4858. return VARS_TO_STR4(type, ne_a, dim, max_period);
  4859. }
  4860. test_timestep_embedding(ggml_type type = GGML_TYPE_F32,
  4861. std::array<int64_t, 4> ne_a = {2, 1, 1, 1},
  4862. int dim = 320, int max_period=10000)
  4863. : type(type), ne_a(ne_a), dim(dim), max_period(max_period) {}
  4864. ggml_tensor * build_graph(ggml_context * ctx) override {
  4865. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  4866. ggml_set_name(a, "a");
  4867. ggml_tensor * out = ggml_timestep_embedding(ctx, a, dim, max_period);
  4868. ggml_set_name(out, "out");
  4869. return out;
  4870. }
  4871. };
  4872. // GGML_OP_LEAKY_RELU
  4873. struct test_leaky_relu : public test_case {
  4874. const ggml_type type;
  4875. const std::array<int64_t, 4> ne_a;
  4876. const float negative_slope;
  4877. std::string vars() override {
  4878. return VARS_TO_STR3(type, ne_a, negative_slope);
  4879. }
  4880. test_leaky_relu(ggml_type type = GGML_TYPE_F32,
  4881. std::array<int64_t, 4> ne_a = {10, 5, 4, 3},
  4882. float negative_slope = 0.1f)
  4883. : type(type), ne_a(ne_a), negative_slope(negative_slope) {}
  4884. ggml_tensor * build_graph(ggml_context * ctx) override {
  4885. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  4886. ggml_set_name(a, "a");
  4887. ggml_tensor * out = ggml_leaky_relu(ctx, a, negative_slope, true);
  4888. ggml_set_name(out, "out");
  4889. return out;
  4890. }
  4891. };
  4892. // GGML_OP_FLASH_ATTN_EXT
  4893. struct test_flash_attn_ext : public test_case {
  4894. const int64_t hsk; // K head size
  4895. const int64_t hsv; // V head size
  4896. const int64_t nh; // num heads
  4897. const std::array<int64_t, 2> nr23; // repeat in dim 2 and 3, tests for grouped-query attention
  4898. const int64_t kv; // kv size
  4899. const int64_t nb; // batch size
  4900. const bool mask; // use mask
  4901. const bool sinks; // use sinks
  4902. const float max_bias; // ALiBi
  4903. const float logit_softcap; // Gemma 2
  4904. const ggml_prec prec;
  4905. const ggml_type type_KV;
  4906. std::array<int32_t, 4> permute;
  4907. std::string vars() override {
  4908. return VARS_TO_STR13(hsk, hsv, nh, nr23, kv, nb, mask, sinks, max_bias, logit_softcap, prec, type_KV, permute);
  4909. }
  4910. double max_nmse_err() override {
  4911. return 5e-4;
  4912. }
  4913. uint64_t op_flops(ggml_tensor * t) override {
  4914. GGML_UNUSED(t);
  4915. // Just counting matmul costs:
  4916. // Q*K^T is nb x hsk x kv, P*V is nb x kv x hsv, per head
  4917. return (2 * nh*nr23[0] * nb * (hsk + hsv) * kv)*nr23[1];
  4918. }
  4919. test_flash_attn_ext(int64_t hsk = 128, int64_t hsv = 128, int64_t nh = 32, std::array<int64_t, 2> nr23 = {1, 1}, int64_t kv = 96, int64_t nb = 8,
  4920. bool mask = true, bool sinks = false, float max_bias = 0.0f, float logit_softcap = 0.0f, ggml_prec prec = GGML_PREC_F32,
  4921. ggml_type type_KV = GGML_TYPE_F16, std::array<int32_t, 4> permute = {0, 1, 2, 3})
  4922. : hsk(hsk), hsv(hsv), nh(nh), nr23(nr23), kv(kv), nb(nb), mask(mask), sinks(sinks), max_bias(max_bias), logit_softcap(logit_softcap), prec(prec), type_KV(type_KV), permute(permute) {}
  4923. ggml_tensor * build_graph(ggml_context * ctx) override {
  4924. const int64_t hsk_padded = GGML_PAD(hsk, ggml_blck_size(type_KV));
  4925. const int64_t hsv_padded = GGML_PAD(hsv, ggml_blck_size(type_KV));
  4926. auto const &create_permuted = [&](ggml_type type, int64_t ne0, int64_t ne1, int64_t ne2, int64_t ne3, bool is_view) -> ggml_tensor * {
  4927. int64_t ne[4] = {ne0, ne1, ne2, ne3};
  4928. int64_t ne_perm[4];
  4929. for (int i = 0; i < 4; ++i) {
  4930. ne_perm[permute[i]] = ne[i];
  4931. }
  4932. ggml_tensor * t;
  4933. if (is_view) {
  4934. ggml_tensor * t0 = ggml_new_tensor_4d(ctx, type, ne_perm[0], 2*ne_perm[1], ne_perm[2], ne_perm[3]);
  4935. t = ggml_view_4d(ctx, t0, ne_perm[0], ne_perm[1], ne_perm[2], ne_perm[3], t0->nb[1], t0->nb[2], t0->nb[3], 0);
  4936. } else {
  4937. t = ggml_new_tensor_4d(ctx, type, ne_perm[0], ne_perm[1], ne_perm[2], ne_perm[3]);
  4938. }
  4939. if (permute != std::array<int32_t, 4>{0, 1, 2, 3}) {
  4940. t = ggml_permute(ctx, t, permute[0], permute[1], permute[2], permute[3]);
  4941. }
  4942. return t;
  4943. };
  4944. ggml_tensor * q = create_permuted(GGML_TYPE_F32, hsk_padded, nb, nh*nr23[0], nr23[1], false);
  4945. ggml_set_name(q, "q");
  4946. ggml_tensor * k = create_permuted(type_KV, hsk_padded, kv, nh, nr23[1], true); // the K tensor is usually a view of the K cache
  4947. ggml_set_name(k, "k");
  4948. ggml_tensor * v = create_permuted(type_KV, hsv_padded, kv, nh, nr23[1], true); // the V tensor is usually a view of the V cache
  4949. ggml_set_name(v, "v");
  4950. ggml_tensor * m = nullptr;
  4951. if (mask) {
  4952. m = ggml_new_tensor_4d(ctx, GGML_TYPE_F16, kv, nb, 1, nr23[1]);
  4953. ggml_set_name(m, "m");
  4954. }
  4955. ggml_tensor * s = nullptr;
  4956. if (sinks) {
  4957. s = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, q->ne[2]);
  4958. ggml_set_name(s, "s");
  4959. }
  4960. ggml_tensor * out = ggml_flash_attn_ext(ctx, q, k, v, m, 1.0f/sqrtf(hsk), max_bias, logit_softcap);
  4961. ggml_flash_attn_ext_add_sinks(out, s);
  4962. ggml_flash_attn_ext_set_prec (out, prec);
  4963. ggml_set_name(out, "out");
  4964. return out;
  4965. }
  4966. void initialize_tensors(ggml_context * ctx) override {
  4967. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  4968. if (strcmp(t->name, "s") == 0) {
  4969. // make the sink values more noticable in order to trigger a test failure when the implementation is wrong
  4970. init_tensor_uniform(t, -10.0f, 10.0f);
  4971. } else if (strcmp(t->name, "m") == 0) {
  4972. init_tensor_kq_mask(t);
  4973. } else {
  4974. init_tensor_uniform(t);
  4975. }
  4976. }
  4977. }
  4978. bool grad_precise() override {
  4979. return true;
  4980. }
  4981. };
  4982. // GGML_OP_CROSS_ENTROPY_LOSS
  4983. struct test_cross_entropy_loss : public test_case {
  4984. const ggml_type type;
  4985. const std::array<int64_t, 4> ne;
  4986. std::string vars() override {
  4987. return VARS_TO_STR2(type, ne);
  4988. }
  4989. test_cross_entropy_loss(ggml_type type = GGML_TYPE_F32,
  4990. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  4991. : type(type), ne(ne) {}
  4992. ggml_tensor * build_graph(ggml_context * ctx) override {
  4993. ggml_tensor * logits = ggml_new_tensor(ctx, type, 4, ne.data());
  4994. ggml_set_param(logits);
  4995. ggml_set_name(logits, "logits");
  4996. ggml_tensor * labels = ggml_new_tensor(ctx, type, 4, ne.data());
  4997. // The labels are assumed to be constant -> no gradients.
  4998. ggml_set_name(labels, "labels");
  4999. // Ensure labels add up to 1:
  5000. labels = ggml_soft_max(ctx, labels);
  5001. ggml_set_name(labels, "labels_normalized");
  5002. ggml_tensor * out = ggml_cross_entropy_loss(ctx, logits, labels);
  5003. ggml_set_name(out, "out");
  5004. return out;
  5005. }
  5006. void initialize_tensors(ggml_context * ctx) override {
  5007. // For larger abs. diffs between logits softmax is more linear, therefore more precise num. gradients.
  5008. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  5009. init_tensor_uniform(t, -100.0f, 100.0f);
  5010. }
  5011. }
  5012. float grad_eps() override {
  5013. return 1.0f;
  5014. }
  5015. bool grad_precise() override {
  5016. return true;
  5017. }
  5018. };
  5019. // GGML_OP_CROSS_ENTROPY_LOSS_BACK
  5020. struct test_cross_entropy_loss_back : public test_case {
  5021. const ggml_type type;
  5022. const std::array<int64_t, 4> ne;
  5023. std::string vars() override {
  5024. return VARS_TO_STR2(type, ne);
  5025. }
  5026. test_cross_entropy_loss_back(ggml_type type = GGML_TYPE_F32,
  5027. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  5028. : type(type), ne(ne) {}
  5029. ggml_tensor * build_graph(ggml_context * ctx) override {
  5030. ggml_tensor * grad = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, 1);
  5031. ggml_set_name(grad, "grad");
  5032. ggml_tensor * logits = ggml_new_tensor(ctx, type, 4, ne.data());
  5033. ggml_set_name(logits, "logits");
  5034. ggml_tensor * labels = ggml_new_tensor(ctx, type, 4, ne.data());
  5035. ggml_set_name(labels, "labels");
  5036. // Ensure labels add up to 1:
  5037. labels = ggml_soft_max(ctx, labels);
  5038. ggml_set_name(labels, "labels_normalized");
  5039. ggml_tensor * out = ggml_cross_entropy_loss_back(ctx, grad, logits, labels);
  5040. ggml_set_name(out, "out");
  5041. return out;
  5042. }
  5043. };
  5044. // GGML_OP_OPT_STEP_ADAMW
  5045. struct test_opt_step_adamw : public test_case {
  5046. const ggml_type type;
  5047. const std::array<int64_t, 4> ne;
  5048. std::string vars() override {
  5049. return VARS_TO_STR2(type, ne);
  5050. }
  5051. test_opt_step_adamw(ggml_type type = GGML_TYPE_F32,
  5052. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  5053. : type(type), ne(ne) {}
  5054. ggml_tensor * build_graph(ggml_context * ctx) override {
  5055. ggml_tensor * a = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  5056. ggml_set_param(a); // Despite tensor a having gradients the output tensor will not.
  5057. ggml_set_name(a, "a");
  5058. ggml_tensor * grad = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  5059. ggml_set_name(grad, "grad");
  5060. ggml_tensor * grad_m = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  5061. ggml_set_name(grad_m, "grad_m");
  5062. ggml_tensor * grad_v = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  5063. ggml_set_name(grad_v, "grad_v");
  5064. ggml_tensor * adamw_params = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, 7);
  5065. ggml_set_name(adamw_params, "adamw_params");
  5066. ggml_tensor * out = ggml_opt_step_adamw(ctx, a, grad, grad_m, grad_v, adamw_params);
  5067. ggml_set_name(out, "out");
  5068. return out;
  5069. }
  5070. void initialize_tensors(ggml_context * ctx) override {
  5071. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  5072. init_tensor_uniform(t, 0.0f, 1.0f); // grad_v and adamw_params need non-negative values.
  5073. }
  5074. }
  5075. bool grad_precise() override {
  5076. return true;
  5077. }
  5078. };
  5079. // GGML_OP_OPT_STEP_SGD
  5080. struct test_opt_step_sgd : public test_case {
  5081. const ggml_type type;
  5082. const std::array<int64_t, 4> ne;
  5083. std::string vars() override { return VARS_TO_STR2(type, ne); }
  5084. test_opt_step_sgd(ggml_type type = GGML_TYPE_F32,
  5085. std::array<int64_t, 4> ne = { 10, 5, 4, 3 })
  5086. : type(type), ne(ne) {}
  5087. ggml_tensor * build_graph(ggml_context * ctx) override {
  5088. ggml_tensor * a = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  5089. ggml_set_param(a); // Despite tensor a having gradients the output tensor will not.
  5090. ggml_set_name(a, "a");
  5091. ggml_tensor * grad = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  5092. ggml_set_name(grad, "grad");
  5093. ggml_tensor * sgd_params = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, 2);
  5094. ggml_set_name(sgd_params, "sgd_params");
  5095. ggml_tensor * out = ggml_opt_step_sgd(ctx, a, grad, sgd_params);
  5096. ggml_set_name(out, "out");
  5097. return out;
  5098. }
  5099. void initialize_tensors(ggml_context * ctx) override {
  5100. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  5101. init_tensor_uniform(t, 0.0f, 1.0f); // sgd_params need non-negative values.
  5102. }
  5103. }
  5104. bool grad_precise() override {
  5105. return true;
  5106. }
  5107. };
  5108. // GGML_OP_CUMSUM
  5109. struct test_cumsum : public test_case {
  5110. const ggml_type type;
  5111. const std::array<int64_t, 4> ne;
  5112. std::string vars() override { return VARS_TO_STR2(type, ne); }
  5113. test_cumsum(ggml_type type = GGML_TYPE_F32,
  5114. std::array<int64_t, 4> ne = { 10, 5, 4, 3 })
  5115. : type(type), ne(ne) {}
  5116. ggml_tensor * build_graph(ggml_context * ctx) override {
  5117. ggml_tensor * a = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  5118. ggml_set_param(a);
  5119. ggml_set_name(a, "a");
  5120. ggml_tensor * out = ggml_cumsum(ctx, a);
  5121. ggml_set_name(out, "out");
  5122. return out;
  5123. }
  5124. void initialize_tensors(ggml_context * ctx) override {
  5125. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  5126. init_tensor_uniform(t, -1.0f, 1.0f);
  5127. }
  5128. }
  5129. };
  5130. // GGML_OP_XIELU
  5131. struct test_xielu : public test_case {
  5132. const ggml_type type;
  5133. const std::array<int64_t, 4> ne;
  5134. std::string vars() override { return VARS_TO_STR2(type, ne); }
  5135. test_xielu(ggml_type type = GGML_TYPE_F32,
  5136. std::array<int64_t, 4> ne = { 10, 5, 4, 3 })
  5137. : type(type), ne(ne) {}
  5138. ggml_tensor * build_graph(ggml_context * ctx) override {
  5139. ggml_tensor * a = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  5140. ggml_set_param(a);
  5141. ggml_set_name(a, "a");
  5142. float alpha_n = 4.0f;
  5143. float alpha_p = 20.0f;
  5144. float beta = 0.5f;
  5145. float eps = 0.0000001f;
  5146. ggml_tensor * out = ggml_xielu(ctx, a, alpha_n, alpha_p, beta, eps);
  5147. ggml_set_name(out, "out");
  5148. return out;
  5149. }
  5150. void initialize_tensors(ggml_context * ctx) override {
  5151. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  5152. init_tensor_uniform(t, -1.0f, 1.0f);
  5153. }
  5154. }
  5155. };
  5156. // GGML_OP_TRI
  5157. struct test_tri : public test_case {
  5158. const ggml_type type;
  5159. const std::array<int64_t, 4> ne;
  5160. const ggml_tri_type tri_type;
  5161. std::string vars() override { return VARS_TO_STR3(type, ne, tri_type); }
  5162. test_tri(ggml_tri_type tri_type, ggml_type type = GGML_TYPE_F32,
  5163. std::array<int64_t, 4> ne = { 10, 10, 4, 3 })
  5164. : type(type), ne(ne), tri_type(tri_type) {
  5165. GGML_ASSERT(ne[0] == ne[1]);
  5166. }
  5167. ggml_tensor * build_graph(ggml_context * ctx) override {
  5168. ggml_tensor * a = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  5169. ggml_set_param(a);
  5170. ggml_set_name(a, "a");
  5171. ggml_tensor * out = ggml_tri(ctx, a, tri_type);
  5172. ggml_set_name(out, "out");
  5173. return out;
  5174. }
  5175. void initialize_tensors(ggml_context * ctx) override {
  5176. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  5177. init_tensor_uniform(t, -1.0f, 1.0f);
  5178. }
  5179. }
  5180. };
  5181. // GGML_OP_FILL
  5182. struct test_fill : public test_case {
  5183. const ggml_type type;
  5184. const std::array<int64_t, 4> ne;
  5185. float c;
  5186. std::string vars() override { return VARS_TO_STR3(type, ne, c); }
  5187. test_fill(float c, ggml_type type = GGML_TYPE_F32,
  5188. std::array<int64_t, 4> ne = { 10, 10, 4, 3 })
  5189. : type(type), ne(ne), c(c) {}
  5190. ggml_tensor * build_graph(ggml_context * ctx) override {
  5191. ggml_tensor * a = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  5192. ggml_set_param(a);
  5193. ggml_set_name(a, "a");
  5194. ggml_tensor * out = ggml_fill(ctx, a, c);
  5195. ggml_set_name(out, "out");
  5196. return out;
  5197. }
  5198. };
  5199. // GGML_OP_SOLVE_TRI
  5200. struct test_solve_tri : public test_case {
  5201. const ggml_type type;
  5202. const std::array<int64_t, 4> ne_lhs;
  5203. const std::array<int64_t, 4> ne_rhs;
  5204. std::string vars() override { return VARS_TO_STR3(type, ne_lhs, ne_rhs); }
  5205. uint64_t op_flops(ggml_tensor * t) override {
  5206. GGML_UNUSED(t);
  5207. int64_t n = ne_lhs[0];
  5208. int64_t k = ne_rhs[0];
  5209. int64_t batch = ne_lhs[2] * ne_lhs[3];
  5210. // n * (n + 1) / 2 non-zero elements of lhs, 2 flops each, for each col of rhs
  5211. return n * (n + 1) * k * batch;
  5212. }
  5213. test_solve_tri(ggml_type type = GGML_TYPE_F32,
  5214. std::array<int64_t, 4> ne_lhs = { 10, 10, 4, 3 },
  5215. std::array<int64_t, 4> ne_rhs = { 3, 10, 4, 3 }
  5216. )
  5217. : type(type), ne_lhs(ne_lhs), ne_rhs(ne_rhs) {}
  5218. ggml_tensor * build_graph(ggml_context * ctx) override {
  5219. ggml_tensor * a = ggml_new_tensor_4d(ctx, type, ne_lhs[0], ne_lhs[1], ne_lhs[2], ne_lhs[3]);
  5220. ggml_set_param(a);
  5221. ggml_set_name(a, "a");
  5222. ggml_tensor * b = ggml_new_tensor_4d(ctx, type, ne_rhs[0], ne_rhs[1], ne_rhs[2], ne_rhs[3]);
  5223. ggml_set_param(b);
  5224. ggml_set_name(b, "b");
  5225. ggml_tensor * out = ggml_solve_tri(ctx, a, b, true, true, false);
  5226. ggml_set_name(out, "out");
  5227. return out;
  5228. }
  5229. void initialize_tensors(ggml_context * ctx) override {
  5230. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  5231. if (strcmp(t->name, "a") == 0) {
  5232. // note: avoid zeros in the diagonal
  5233. init_tensor_tril(t, 0.1, 1.0f);
  5234. } else {
  5235. init_tensor_uniform(t, -1.0f, 1.0f);
  5236. }
  5237. }
  5238. }
  5239. };
  5240. // GGML_OP_DIAG
  5241. struct test_diag : public test_case {
  5242. const ggml_type type;
  5243. const std::array<int64_t, 4> ne;
  5244. std::string vars() override { return VARS_TO_STR2(type, ne); }
  5245. test_diag(ggml_type type = GGML_TYPE_F32,
  5246. std::array<int64_t, 4> ne = { 10, 1, 4, 3 })
  5247. : type(type), ne(ne) {}
  5248. ggml_tensor * build_graph(ggml_context * ctx) override {
  5249. GGML_ASSERT(ne[1] == 1);
  5250. ggml_tensor * a = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  5251. ggml_set_param(a);
  5252. ggml_set_name(a, "a");
  5253. ggml_tensor * out = ggml_diag(ctx, a);
  5254. ggml_set_name(out, "out");
  5255. return out;
  5256. }
  5257. };
  5258. enum llm_norm_type {
  5259. LLM_NORM,
  5260. LLM_NORM_RMS,
  5261. };
  5262. struct llama_hparams {
  5263. uint32_t n_vocab;
  5264. uint32_t n_embd;
  5265. uint32_t n_head;
  5266. uint32_t n_head_kv;
  5267. static constexpr uint32_t n_layer = 1;
  5268. uint32_t n_rot;
  5269. uint32_t n_embd_head; // dimension of values (d_v)
  5270. uint32_t n_ff;
  5271. float f_norm_eps;
  5272. float f_norm_rms_eps;
  5273. // cparams
  5274. static constexpr uint32_t n_ctx = 512; // user-specified context size
  5275. static constexpr uint32_t n_ctx_orig = n_ctx;
  5276. // batch
  5277. int32_t n_tokens;
  5278. // llm_build_context
  5279. static constexpr int32_t n_kv = 32; // size of KV cache to consider (n_kv <= n_ctx
  5280. static constexpr int32_t kv_head = 1; // index of where we store new KV data in the cache
  5281. uint32_t n_embd_gqa() const { // dimension of key embeddings across all k-v heads
  5282. return n_embd_head * n_head_kv;
  5283. }
  5284. };
  5285. // LLM base class
  5286. struct test_llm : public test_case {
  5287. llama_hparams hp;
  5288. protected:
  5289. test_llm(llama_hparams hp)
  5290. : hp(std::move(hp)) {
  5291. }
  5292. public:
  5293. struct ggml_tensor * llm_build_norm(
  5294. struct ggml_context * ctx,
  5295. struct ggml_tensor * cur,
  5296. struct ggml_tensor * mw,
  5297. struct ggml_tensor * mb,
  5298. llm_norm_type type) {
  5299. switch (type) {
  5300. case LLM_NORM: cur = ggml_norm (ctx, cur, hp.f_norm_eps); break;
  5301. case LLM_NORM_RMS: cur = ggml_rms_norm(ctx, cur, hp.f_norm_rms_eps); break;
  5302. }
  5303. cur = ggml_mul(ctx, cur, mw);
  5304. if (mb) {
  5305. cur = ggml_add(ctx, cur, mb);
  5306. }
  5307. return cur;
  5308. }
  5309. void llm_build_kv_store(
  5310. struct ggml_context * ctx,
  5311. struct ggml_tensor * k_l,
  5312. struct ggml_tensor * v_l,
  5313. struct ggml_tensor * k_cur,
  5314. struct ggml_tensor * v_cur) {
  5315. // compute the transposed [n_tokens, n_embd] V matrix
  5316. struct ggml_tensor * v_cur_t = ggml_transpose(ctx, ggml_reshape_2d(ctx, v_cur, hp.n_embd_gqa(), hp.n_tokens));
  5317. struct ggml_tensor * k_cache_view = ggml_view_1d(ctx, k_l, hp.n_tokens*hp.n_embd_gqa(),
  5318. (ggml_row_size(k_l->type, hp.n_embd_gqa()))*hp.kv_head);
  5319. struct ggml_tensor * v_cache_view = ggml_view_2d(ctx, v_l, hp.n_tokens, hp.n_embd_gqa(),
  5320. ( hp.n_ctx)*ggml_element_size(v_l),
  5321. (hp.kv_head)*ggml_element_size(v_l));
  5322. // important: storing RoPE-ed version of K in the KV cache!
  5323. ggml_cpy(ctx, k_cur, k_cache_view);
  5324. ggml_cpy(ctx, v_cur_t, v_cache_view);
  5325. }
  5326. struct ggml_tensor * llm_build_kqv(
  5327. struct ggml_context * ctx,
  5328. struct ggml_tensor * k_l,
  5329. struct ggml_tensor * v_l,
  5330. struct ggml_tensor * q_cur,
  5331. struct ggml_tensor * kq_mask,
  5332. float kq_scale) {
  5333. struct ggml_tensor * q = ggml_permute(ctx, q_cur, 0, 2, 1, 3);
  5334. struct ggml_tensor * k =
  5335. ggml_view_3d(ctx, k_l,
  5336. hp.n_embd_head, hp.n_kv, hp.n_head_kv,
  5337. ggml_row_size(k_l->type, hp.n_embd_gqa()),
  5338. ggml_row_size(k_l->type, hp.n_embd_head),
  5339. 0);
  5340. struct ggml_tensor * kq = ggml_mul_mat(ctx, k, q);
  5341. kq = ggml_soft_max_ext(ctx, kq, kq_mask, kq_scale, 0.0f);
  5342. // split cached v into n_head heads
  5343. struct ggml_tensor * v =
  5344. ggml_view_3d(ctx, v_l,
  5345. hp.n_kv, hp.n_embd_head, hp.n_head_kv,
  5346. ggml_element_size(v_l)*hp.n_ctx,
  5347. ggml_element_size(v_l)*hp.n_ctx*hp.n_embd_head,
  5348. 0);
  5349. struct ggml_tensor * kqv = ggml_mul_mat(ctx, v, kq);
  5350. struct ggml_tensor * kqv_merged = ggml_permute(ctx, kqv, 0, 2, 1, 3);
  5351. struct ggml_tensor * cur = ggml_cont_2d(ctx, kqv_merged, hp.n_embd_head*hp.n_head, hp.n_tokens);
  5352. struct ggml_tensor * wo = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd);
  5353. cur = ggml_mul_mat(ctx, wo, cur);
  5354. return cur;
  5355. }
  5356. void initialize_tensors(ggml_context * ctx) override {
  5357. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  5358. if (t->type == GGML_TYPE_I32) {
  5359. // pos
  5360. std::vector<int> data(hp.n_tokens);
  5361. for (int i = 0; i < hp.n_tokens; i++) {
  5362. data[i] = rand() % hp.n_ctx;
  5363. }
  5364. ggml_backend_tensor_set(t, data.data(), 0, hp.n_tokens * sizeof(int));
  5365. } else {
  5366. init_tensor_uniform(t);
  5367. }
  5368. }
  5369. }
  5370. };
  5371. // Llama
  5372. struct test_llama : public test_llm {
  5373. static constexpr float freq_base = 10000.0f;
  5374. static constexpr float freq_scale = 1.0f;
  5375. static constexpr float ext_factor = 0.0f;
  5376. static constexpr float attn_factor = 1.0f;
  5377. static constexpr float beta_fast = 32.0f;
  5378. static constexpr float beta_slow = 1.0f;
  5379. bool fused;
  5380. std::string op_desc(ggml_tensor * t) override {
  5381. GGML_UNUSED(t);
  5382. return "LLAMA";
  5383. }
  5384. std::string vars() override {
  5385. auto n_tokens = hp.n_tokens;
  5386. return VARS_TO_STR1(n_tokens);
  5387. }
  5388. double max_nmse_err() override {
  5389. return 2e-3;
  5390. }
  5391. bool run_whole_graph() override { return fused; }
  5392. test_llama(int n_tokens = 1, bool fused = false)
  5393. : test_llm({
  5394. /*n_vocab =*/ 32000,
  5395. /*n_embd =*/ 3200,
  5396. /*n_head =*/ 32,
  5397. /*n_head_kv =*/ 32,
  5398. /*n_rot =*/ 100,
  5399. /*n_embd_head =*/ 100,
  5400. /*n_ff =*/ 8640,
  5401. /*f_norm_eps =*/ 0.f,
  5402. /*f_norm_rms_eps =*/ 1e-5f,
  5403. /*n_tokens =*/ n_tokens,
  5404. })
  5405. , fused(fused)
  5406. {
  5407. }
  5408. ggml_tensor * build_graph(ggml_context * ctx) override {
  5409. struct ggml_tensor * cur;
  5410. struct ggml_tensor * inpL;
  5411. inpL = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, hp.n_embd, hp.n_tokens);
  5412. // inp_pos - contains the positions
  5413. struct ggml_tensor * inp_pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, hp.n_tokens);
  5414. // KQ_mask (mask for 1 head, it will be broadcasted to all heads)
  5415. struct ggml_tensor * KQ_mask = ggml_new_tensor_3d(ctx, GGML_TYPE_F16, hp.n_kv, hp.n_tokens, 1);
  5416. ggml_tensor * k_l = ggml_new_tensor_1d(ctx, GGML_TYPE_F16, 1638400);
  5417. ggml_tensor * v_l = ggml_new_tensor_1d(ctx, GGML_TYPE_F16, 1638400);
  5418. for (uint32_t il = 0; il < hp.n_layer; ++il) {
  5419. struct ggml_tensor * inpSA = inpL;
  5420. // norm
  5421. ggml_tensor * attn_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  5422. cur = llm_build_norm(ctx, inpL, attn_norm, nullptr, LLM_NORM_RMS);
  5423. // self-attention
  5424. {
  5425. ggml_tensor * wq = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd);
  5426. ggml_tensor * wk = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd_gqa());
  5427. ggml_tensor * wv = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd_gqa());
  5428. // compute Q and K and RoPE them
  5429. struct ggml_tensor * Qcur = ggml_mul_mat(ctx, wq, cur);
  5430. struct ggml_tensor * Kcur = ggml_mul_mat(ctx, wk, cur);
  5431. struct ggml_tensor * Vcur = ggml_mul_mat(ctx, wv, cur);
  5432. Qcur = ggml_rope_ext(
  5433. ctx, ggml_reshape_3d(ctx, Qcur, hp.n_embd_head, hp.n_head, hp.n_tokens), inp_pos, nullptr,
  5434. hp.n_rot, 0, hp.n_ctx_orig, freq_base, freq_scale,
  5435. ext_factor, attn_factor, beta_fast, beta_slow
  5436. );
  5437. Kcur = ggml_rope_ext(
  5438. ctx, ggml_reshape_3d(ctx, Kcur, hp.n_embd_head, hp.n_head_kv, hp.n_tokens), inp_pos, nullptr,
  5439. hp.n_rot, 0, hp.n_ctx_orig, freq_base, freq_scale,
  5440. ext_factor, attn_factor, beta_fast, beta_slow
  5441. );
  5442. llm_build_kv_store(ctx, k_l, v_l, Kcur, Vcur);
  5443. cur = llm_build_kqv(ctx, k_l, v_l, Qcur, KQ_mask, 1.0f/sqrtf(float(hp.n_embd_head)));
  5444. }
  5445. struct ggml_tensor * ffn_inp = ggml_add(ctx, cur, inpSA);
  5446. // feed-forward network
  5447. ggml_tensor * ffn_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  5448. cur = llm_build_norm(ctx, ffn_inp, ffn_norm, nullptr, LLM_NORM_RMS);
  5449. ggml_tensor * ffn_gate = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_ff);
  5450. ggml_tensor * ffn_down = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_ff, hp.n_embd);
  5451. ggml_tensor * ffn_up = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_ff);
  5452. struct ggml_tensor * tmp = ggml_mul_mat(ctx, ffn_up, cur);
  5453. cur = ggml_mul_mat(ctx, ffn_gate, cur);
  5454. cur = ggml_silu(ctx, cur);
  5455. cur = ggml_mul(ctx, cur, tmp);
  5456. cur = ggml_mul_mat(ctx, ffn_down, cur);
  5457. cur = ggml_add(ctx, cur, ffn_inp);
  5458. // input for next layer
  5459. inpL = cur;
  5460. }
  5461. cur = inpL;
  5462. ggml_tensor * output_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  5463. cur = llm_build_norm(ctx, cur, output_norm, nullptr, LLM_NORM_RMS);
  5464. // lm_head
  5465. ggml_tensor * output = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_vocab);
  5466. cur = ggml_mul_mat(ctx, output, cur);
  5467. return cur;
  5468. }
  5469. };
  5470. // Falcon
  5471. struct test_falcon : public test_llm {
  5472. static constexpr float freq_base = 10000.0f;
  5473. static constexpr float freq_scale = 1.0f;
  5474. static constexpr float ext_factor = 0.0f;
  5475. static constexpr float attn_factor = 1.0f;
  5476. static constexpr float beta_fast = 32.0f;
  5477. static constexpr float beta_slow = 1.0f;
  5478. std::string op_desc(ggml_tensor * t) override {
  5479. GGML_UNUSED(t);
  5480. return "FALCON";
  5481. }
  5482. std::string vars() override {
  5483. auto n_tokens = hp.n_tokens;
  5484. return VARS_TO_STR1(n_tokens);
  5485. }
  5486. double max_nmse_err() override {
  5487. return 2e-3;
  5488. }
  5489. test_falcon(int n_tokens = 1)
  5490. : test_llm({
  5491. /*n_vocab =*/ 32000,
  5492. /*n_embd =*/ 3200,
  5493. /*n_head =*/ 50,
  5494. /*n_head_kv =*/ 1,
  5495. /*n_rot =*/ 64,
  5496. /*n_embd_head =*/ 64,
  5497. /*n_ff =*/ 8640,
  5498. /*f_norm_eps =*/ 1e-5f,
  5499. /*f_norm_rms_eps =*/ 0.f,
  5500. /*n_tokens =*/ n_tokens,
  5501. }) {
  5502. }
  5503. ggml_tensor * build_graph(ggml_context * ctx) override {
  5504. struct ggml_tensor * cur;
  5505. struct ggml_tensor * inpL;
  5506. inpL = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, hp.n_embd, hp.n_tokens);
  5507. // inp_pos - contains the positions
  5508. struct ggml_tensor * inp_pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, hp.n_tokens);
  5509. // KQ_mask (mask for 1 head, it will be broadcasted to all heads)
  5510. struct ggml_tensor * KQ_mask = ggml_new_tensor_3d(ctx, GGML_TYPE_F16, hp.n_kv, hp.n_tokens, 1);
  5511. ggml_tensor * k_l = ggml_new_tensor_1d(ctx, GGML_TYPE_F16, 1638400);
  5512. ggml_tensor * v_l = ggml_new_tensor_1d(ctx, GGML_TYPE_F16, 1638400);
  5513. for (uint32_t il = 0; il < hp.n_layer; ++il) {
  5514. // norm
  5515. ggml_tensor * attn_norm_w = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  5516. ggml_tensor * attn_norm_b = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  5517. ggml_tensor * attn_norm = llm_build_norm(ctx, inpL, attn_norm_w, attn_norm_b, LLM_NORM);
  5518. // self-attention
  5519. {
  5520. cur = attn_norm;
  5521. ggml_tensor * wqkv = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd + 2*hp.n_embd_gqa());
  5522. cur = ggml_mul_mat(ctx, wqkv, cur);
  5523. struct ggml_tensor * Qcur = ggml_cont(ctx, ggml_view_2d(ctx, cur, hp.n_embd, hp.n_tokens, cur->nb[1], 0*sizeof(float)*(hp.n_embd)));
  5524. struct ggml_tensor * Kcur = ggml_cont(ctx, ggml_view_2d(ctx, cur, hp.n_embd_gqa(), hp.n_tokens, cur->nb[1], 1*sizeof(float)*(hp.n_embd)));
  5525. struct ggml_tensor * Vcur = ggml_cont(ctx, ggml_view_2d(ctx, cur, hp.n_embd_gqa(), hp.n_tokens, cur->nb[1], 1*sizeof(float)*(hp.n_embd + hp.n_embd_gqa())));
  5526. Qcur = ggml_reshape_3d(ctx, Qcur, hp.n_embd_head, hp.n_head, hp.n_tokens);
  5527. Kcur = ggml_reshape_3d(ctx, Kcur, hp.n_embd_head, hp.n_head_kv, hp.n_tokens);
  5528. // using mode = 2 for neox mode
  5529. Qcur = ggml_rope_ext(
  5530. ctx, Qcur, inp_pos, nullptr, hp.n_rot, 2, hp.n_ctx_orig,
  5531. freq_base, freq_scale, ext_factor, attn_factor, beta_fast, beta_slow
  5532. );
  5533. Kcur = ggml_rope_ext(
  5534. ctx, Kcur, inp_pos, nullptr, hp.n_rot, 2, hp.n_ctx_orig,
  5535. freq_base, freq_scale, ext_factor, attn_factor, beta_fast, beta_slow
  5536. );
  5537. llm_build_kv_store(ctx, k_l, v_l, Kcur, Vcur);
  5538. cur = llm_build_kqv(ctx, k_l, v_l, Qcur, KQ_mask, 1.0f/sqrtf(float(hp.n_embd_head)));
  5539. }
  5540. struct ggml_tensor * ffn_inp = cur;
  5541. // feed forward
  5542. {
  5543. ggml_tensor * ffn_up = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_ff);
  5544. ggml_tensor * ffn_down = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_ff, hp.n_embd);
  5545. cur = attn_norm;
  5546. cur = ggml_mul_mat(ctx, ffn_up, cur);
  5547. cur = ggml_gelu(ctx, cur);
  5548. cur = ggml_mul_mat(ctx, ffn_down, cur);
  5549. }
  5550. cur = ggml_add(ctx, cur, ffn_inp);
  5551. cur = ggml_add(ctx, cur, inpL);
  5552. // input for next layer
  5553. inpL = cur;
  5554. }
  5555. cur = inpL;
  5556. ggml_tensor * output_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  5557. ggml_tensor * output_norm_b = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  5558. cur = llm_build_norm(ctx, cur, output_norm, output_norm_b, LLM_NORM);
  5559. // lm_head
  5560. ggml_tensor * output = ggml_new_tensor_2d(ctx, GGML_TYPE_Q8_0, hp.n_embd, hp.n_vocab);
  5561. cur = ggml_mul_mat(ctx, output, cur);
  5562. return cur;
  5563. }
  5564. };
  5565. // ###########################################
  5566. // ## Section 3: GGML Op Test Instantiation ##
  5567. // ###########################################
  5568. static const ggml_type all_types[] = {
  5569. GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_BF16,
  5570. GGML_TYPE_Q4_0, GGML_TYPE_Q4_1,
  5571. GGML_TYPE_Q5_0, GGML_TYPE_Q5_1,
  5572. GGML_TYPE_Q8_0,
  5573. GGML_TYPE_MXFP4,
  5574. GGML_TYPE_Q2_K, GGML_TYPE_Q3_K,
  5575. GGML_TYPE_Q4_K, GGML_TYPE_Q5_K,
  5576. GGML_TYPE_Q6_K,
  5577. // GGML_TYPE_TQ1_0, GGML_TYPE_TQ2_0, // TODO: implement for all backends
  5578. GGML_TYPE_IQ2_XXS, GGML_TYPE_IQ2_XS, GGML_TYPE_IQ2_S,
  5579. GGML_TYPE_IQ3_XXS, GGML_TYPE_IQ1_S, GGML_TYPE_IQ1_M,
  5580. GGML_TYPE_IQ4_NL, GGML_TYPE_IQ3_S, GGML_TYPE_IQ4_XS,
  5581. };
  5582. static const ggml_type base_types[] = {
  5583. GGML_TYPE_F32, GGML_TYPE_F16,
  5584. GGML_TYPE_Q8_0, // for I8MM tests
  5585. GGML_TYPE_Q4_0,
  5586. GGML_TYPE_Q4_1, // for I8MM tests
  5587. GGML_TYPE_Q4_K,
  5588. GGML_TYPE_MXFP4, // TODO: or "other"
  5589. GGML_TYPE_IQ2_XXS
  5590. };
  5591. static const ggml_type other_types[] = {
  5592. GGML_TYPE_Q4_1,
  5593. GGML_TYPE_Q5_0, GGML_TYPE_Q5_1,
  5594. GGML_TYPE_Q8_0,
  5595. GGML_TYPE_Q2_K, GGML_TYPE_Q3_K,
  5596. GGML_TYPE_Q5_K,
  5597. GGML_TYPE_Q6_K,
  5598. // GGML_TYPE_TQ1_0, GGML_TYPE_TQ2_0, // TODO: implement for all backends
  5599. GGML_TYPE_IQ2_XS, GGML_TYPE_IQ2_S,
  5600. GGML_TYPE_IQ3_XXS, GGML_TYPE_IQ1_S, GGML_TYPE_IQ1_M,
  5601. GGML_TYPE_IQ4_NL, GGML_TYPE_IQ3_S, GGML_TYPE_IQ4_XS,
  5602. GGML_TYPE_BF16,
  5603. };
  5604. #ifdef _MSC_VER
  5605. // Workaround long compile time with msvc
  5606. #pragma optimize("", off)
  5607. #endif
  5608. // Test cases for evaluation: should try to cover edge cases while using small input sizes to keep the runtime low
  5609. static std::vector<std::unique_ptr<test_case>> make_test_cases_eval() {
  5610. std::vector<std::unique_ptr<test_case>> test_cases;
  5611. std::default_random_engine rng(0);
  5612. // unary ops
  5613. for (ggml_type type : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  5614. for (int v : {0, 1}) {
  5615. for (int op = 0; op < GGML_UNARY_OP_COUNT; op++) {
  5616. if (op == GGML_UNARY_OP_XIELU) {
  5617. continue; // need extra params, separate test
  5618. }
  5619. test_cases.emplace_back(new test_unary((ggml_unary_op) op, type, { 128, 2, 2, 2 }, v));
  5620. test_cases.emplace_back(new test_unary((ggml_unary_op) op, type, { 5, 7, 11, 13 }, v));
  5621. }
  5622. }
  5623. }
  5624. // glu ops
  5625. for (ggml_type type : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  5626. for (int v : {0, 1}) {
  5627. for (int op = 0; op < GGML_GLU_OP_COUNT; op++) {
  5628. if (op == GGML_GLU_OP_SWIGLU_OAI) {
  5629. // SWIGLU_OAI is handled separately
  5630. continue;
  5631. }
  5632. for (bool swapped : {false, true}) {
  5633. test_cases.emplace_back(new test_glu((ggml_glu_op) op, type, { 128, 2, 2, 2 }, v, swapped));
  5634. test_cases.emplace_back(new test_glu((ggml_glu_op) op, type, { 5, 7, 11, 13 }, v, swapped));
  5635. }
  5636. test_cases.emplace_back(new test_glu_split((ggml_glu_op) op, type, { 128, 2, 2, 2 }, v));
  5637. test_cases.emplace_back(new test_glu_split((ggml_glu_op) op, type, { 5, 7, 11, 13 }, v));
  5638. }
  5639. }
  5640. }
  5641. for (int v : {0, 1}) {
  5642. for (float alpha : {.5f, 1.702f}) {
  5643. for (float limit : {2.0f, 7.0f}) {
  5644. test_cases.emplace_back(new test_swiglu_oai(GGML_TYPE_F32, { 128, 2, 2, 2 }, v, alpha, limit));
  5645. }
  5646. }
  5647. }
  5648. for (ggml_type type : {GGML_TYPE_F32, GGML_TYPE_Q4_0}) {
  5649. test_cases.emplace_back(new test_get_rows(type, 300*256, 5, 4, 1, 2, false));
  5650. test_cases.emplace_back(new test_get_rows(type, 256, 80000, 70000, 2, 1, false));
  5651. test_cases.emplace_back(new test_get_rows(type, 256, 5, 4, 700, 100, false));
  5652. }
  5653. test_cases.emplace_back(new test_get_rows(GGML_TYPE_F32, 1, 8, 2, 1, 1, false));
  5654. for (ggml_type type : all_types) {
  5655. for (int b : {1, 7}) {
  5656. for (bool v : {false, true}) {
  5657. test_cases.emplace_back(new test_get_rows(type, 256, 5, 4, b, 1, v));
  5658. }
  5659. }
  5660. }
  5661. for (int b : {1, 7}) {
  5662. for (bool v : {false, true}) {
  5663. test_cases.emplace_back(new test_get_rows(GGML_TYPE_I32, 256, 5, 4, b, 1, v));
  5664. }
  5665. }
  5666. test_cases.emplace_back(new test_get_rows_back(GGML_TYPE_F32, 1, 8, 2, 1, false));
  5667. for (ggml_type type : all_types) {
  5668. for (bool v : {false, true}) {
  5669. test_cases.emplace_back(new test_get_rows_back(type, 256, 5, 4, 1, v));
  5670. }
  5671. }
  5672. for (bool v : {false, true}) {
  5673. test_cases.emplace_back(new test_get_rows_back(GGML_TYPE_I32, 256, 5, 4, 1, v));
  5674. }
  5675. test_cases.emplace_back(new test_set_rows(GGML_TYPE_F32, GGML_TYPE_I64, { 1, 8, 1, 3 }, { 1, 1 }, 2, false));
  5676. test_cases.emplace_back(new test_set_rows(GGML_TYPE_F32, GGML_TYPE_I32, { 1, 8, 1, 3 }, { 1, 1 }, 2, false));
  5677. test_cases.emplace_back(new test_set_rows(GGML_TYPE_Q8_0, GGML_TYPE_I32, { 256, 5, 1, 3 }, { 1, 1, }, 1, false));
  5678. for (ggml_type type : all_types) {
  5679. for (int b : {1, 7}) {
  5680. for (bool v : {false, true}) {
  5681. test_cases.emplace_back(new test_set_rows(type, GGML_TYPE_I64, { 256, 5, b, 3 }, { 1, 1, }, 1, v));
  5682. test_cases.emplace_back(new test_set_rows(type, GGML_TYPE_I64, { 256, 11, 1, b }, { 2, 3, }, 7, v));
  5683. test_cases.emplace_back(new test_set_rows(type, GGML_TYPE_I64, { 3*ggml_blck_size(type), 3, b, 1 }, { 2, 3, }, 2, v));
  5684. if (ggml_blck_size(type) == 1) {
  5685. test_cases.emplace_back(new test_set_rows(type, GGML_TYPE_I64, { 31, 3, b, 1 }, { 2, 3, }, 2, v));
  5686. test_cases.emplace_back(new test_set_rows(type, GGML_TYPE_I64, { 33, 5, 1, b }, { 2, 3, }, 1, v));
  5687. }
  5688. }
  5689. }
  5690. }
  5691. for (int mode : { GGML_ROPE_TYPE_NORMAL, GGML_ROPE_TYPE_NEOX, GGML_ROPE_TYPE_MROPE, GGML_ROPE_TYPE_VISION }) {
  5692. for (ggml_type type : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  5693. for (int ne2 : {1, 8, 512}) {
  5694. test_cases.emplace_back(new test_rope_set_rows(type, GGML_TYPE_I64, { 128, 32, ne2, 1 }, mode));
  5695. test_cases.emplace_back(new test_rope_set_rows(type, GGML_TYPE_I64, { 128, 32, ne2, 3 }, mode));
  5696. }
  5697. }
  5698. }
  5699. for (ggml_type type_input : {GGML_TYPE_F32}) {
  5700. for (ggml_op_pool pool_type : {GGML_OP_POOL_AVG, GGML_OP_POOL_MAX}) {
  5701. for (int k0 : {1, 3}) {
  5702. for (int k1 : {1, 3}) {
  5703. for (int s0 : {1, 2}) {
  5704. for (int s1 : {1, 2}) {
  5705. for (int p0 : {0, 1}) {
  5706. for (int p1 : {0, 1}) {
  5707. test_cases.emplace_back(new test_pool2d(pool_type, type_input, {10, 10, 3, 1}, k0, k1, s0, s1, p0, p1));
  5708. }
  5709. }
  5710. }
  5711. }
  5712. }
  5713. }
  5714. }
  5715. }
  5716. #if 0
  5717. // >4GB im2col destination. Too slow to run by default.
  5718. // Test cases taken from Wan2.1 T2V 1.3B.
  5719. test_cases.emplace_back(new test_im2col (GGML_TYPE_F32, GGML_TYPE_F32, GGML_TYPE_F32, {832, 480, 192, 4}, {3, 3, 192, 96}, 1, 1, 1, 1, 1, 1, true));
  5720. test_cases.emplace_back(new test_im2col_3d(GGML_TYPE_F32, GGML_TYPE_F32, GGML_TYPE_F32, {834, 482, 6, 96}, {3, 3,3, 9216}, 96, 1, 1, 1, 0, 0, 0, 1, 1, 1, false));
  5721. #endif
  5722. // im2col 1D
  5723. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F32, GGML_TYPE_F32, {3000, 128, 1, 1}, {3, 128, 1280, 1}, 1, 0, 1, 0, 1, 0, false));
  5724. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F32, {3000, 128, 1, 1}, {3, 128, 1280, 1}, 1, 0, 1, 0, 1, 0, false));
  5725. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16, {3000, 128, 1, 1}, {3, 128, 1280, 1}, 1, 0, 1, 0, 1, 0, false));
  5726. for (int s0 : {1, 3}) {
  5727. for (int p0 : {0, 3}) {
  5728. for (int d0 : {1, 3}) {
  5729. test_cases.emplace_back(new test_im2col(
  5730. GGML_TYPE_F32, GGML_TYPE_F32, GGML_TYPE_F32, {20, 2, 2, 1}, {3, 2, 2, 1},
  5731. s0, 0, p0, 0, d0, 0, false));
  5732. }
  5733. }
  5734. }
  5735. // im2col 2D
  5736. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F32, GGML_TYPE_F32));
  5737. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F32));
  5738. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16));
  5739. for (int s0 : {1, 3}) {
  5740. for (int s1 : {1, 3}) {
  5741. for (int p0 : {0, 3}) {
  5742. for (int p1 : {0, 3}) {
  5743. for (int d0 : {1, 3}) {
  5744. for (int d1 : {1, 3}) {
  5745. test_cases.emplace_back(new test_im2col(
  5746. GGML_TYPE_F32, GGML_TYPE_F32, GGML_TYPE_F32, {20, 20, 2, 2}, {3, 3, 2, 2},
  5747. s0, s1, p0, p1, d0, d1, true));
  5748. }
  5749. }
  5750. }
  5751. }
  5752. }
  5753. }
  5754. // extra tests for im2col 2D
  5755. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16, {12, 12, 1, 32}, {3, 3, 1, 32}, 1, 1, 1, 1, 1, 1, true));
  5756. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16, {12, 12, 2, 32}, {3, 3, 2, 32}, 1, 1, 1, 1, 1, 1, true));
  5757. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16, {12, 12, 1, 1024}, {3, 3, 1, 1024}, 1, 1, 1, 1, 1, 1, true));
  5758. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16, {12, 12, 2, 1024}, {3, 3, 2, 1024}, 1, 1, 1, 1, 1, 1, true));
  5759. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16, {12, 12, 1, 2048}, {3, 3, 1, 2048}, 1, 1, 1, 1, 1, 1, true));
  5760. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16, {12, 12, 2, 2048}, {3, 3, 2, 2048}, 1, 1, 1, 1, 1, 1, true));
  5761. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16, {12, 12, 1, 2560}, {3, 3, 1, 2560}, 1, 1, 1, 1, 1, 1, true));
  5762. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16, {12, 12, 2, 2560}, {3, 3, 2, 2560}, 1, 1, 1, 1, 1, 1, true));
  5763. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16, {5, 5, 1, 32}, {3, 4, 1, 32}, 1, 1, 0, 0, 1, 1, true));
  5764. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F32, GGML_TYPE_F32, {2, 2, 1536, 729}, {2, 2, 1536, 4096}, 1, 1, 0, 0, 1, 1, true));
  5765. // im2col 3D
  5766. test_cases.emplace_back(new test_im2col_3d(GGML_TYPE_F32, GGML_TYPE_F32, GGML_TYPE_F32));
  5767. test_cases.emplace_back(new test_im2col_3d(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F32));
  5768. test_cases.emplace_back(new test_im2col_3d(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16));
  5769. for (int s0 : {1, 3}) {
  5770. for (int s1 : {1, 3}) {
  5771. for (int s2 : {1, 3}) {
  5772. for (int p0 : {0, 3}) {
  5773. for (int p1 : {0, 3}) {
  5774. for (int p2 : {0, 3}) {
  5775. for (int d0 : {1, 3}) {
  5776. for (int d1 : {1, 3}) {
  5777. for (int d2 : {1, 3}) {
  5778. for (int IC : {1, 3}) {
  5779. for (bool v : {false, true}) {
  5780. test_cases.emplace_back(new test_im2col_3d(
  5781. GGML_TYPE_F32, GGML_TYPE_F32, GGML_TYPE_F32, {20, 20, 10, 3}, {3, 3, 3, 3},
  5782. IC, s0, s1, s2, p0, p1, p2, d0, d1, d2, v));
  5783. }
  5784. }
  5785. }
  5786. }
  5787. }
  5788. }
  5789. }
  5790. }
  5791. }
  5792. }
  5793. }
  5794. // Conv_2D test cases
  5795. #ifdef DETAILED_TESTS
  5796. // Probably we do not have enough time to execute these in the pipeline.
  5797. uint32_t iwh_idx = 0;
  5798. uint32_t kwh_idx = 1;
  5799. uint32_t Cout_idx = 2;
  5800. uint32_t Cin_idx = 3;
  5801. uint32_t B_idx = 4;
  5802. std::vector<std::array<int, 5>> cases = {
  5803. //{IWH, KWH, Cout, Cin, B}
  5804. // K=CRS=NPQ=4096 conv_2d matmul performance
  5805. {19, 4, 4096, 256, 16},
  5806. // K=128, CRS=128, NPQ=4096
  5807. { 19, 4, 128, 8, 16},
  5808. // K=130, CRS=128, NPQ=4096
  5809. { 19, 4, 130, 8, 16},
  5810. // Edge case: K x CRS is small
  5811. { 19, 2, 4, 4, 16},
  5812. // A ConvNet's first layer
  5813. { 224, 3, 8, 3, 1 },
  5814. // A ConvNet's first layer with 2x2 convolution, and 1 channel
  5815. { 224, 2, 8, 1, 1 },
  5816. // A ConvNet's first layer with 2x2 convolution, and 1 channel, several images in the batch
  5817. { 224, 2, 8, 1, 8 },
  5818. // A middle layer of a ConvNet
  5819. { 58, 3, 64, 32, 1 },
  5820. // A middle layer of a ConvNet, several images in the batch
  5821. { 58, 3, 64, 32, 8 },
  5822. // A deep layer of a ConvNet, several images in the batch
  5823. { 16, 3, 256, 128, 8 }
  5824. };
  5825. for (auto kernel_type : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  5826. for (auto act_case : cases) {
  5827. test_cases.emplace_back(new test_conv_2d(
  5828. { act_case[iwh_idx], act_case[iwh_idx], act_case[Cin_idx], act_case[B_idx] },
  5829. { act_case[kwh_idx], act_case[kwh_idx], act_case[Cin_idx], act_case[Cout_idx] },
  5830. kernel_type, 1, 1, 0, 0, 1, 1, false));
  5831. }
  5832. }
  5833. #endif
  5834. // CONV_2D:
  5835. auto calc_conv_output_size = [](int64_t ins, int64_t ks, int s, int p, int d) -> int64_t {
  5836. return (ins + 2 * p - d * (ks - 1) - 1) / s + 1;
  5837. };
  5838. //uint32_t s0 = 3;
  5839. uint32_t s1 = 5;
  5840. uint32_t p0 = 5;
  5841. //uint32_t p1 = 2;
  5842. uint32_t d0 = 2;
  5843. uint32_t d1 = 4;
  5844. for (uint32_t s0 : { 1, 3 }) {
  5845. for (uint32_t p1 : { 2, 5 }) {
  5846. for (uint32_t Cin : { 1, 25 }) {
  5847. for (uint32_t Cout : { 1, 12 }) {
  5848. for (uint32_t KH : { 1, 2, 3, 11 }) {
  5849. for (uint32_t KW : { 1, 2, 3, 11 }) {
  5850. for (uint32_t H : { 1, 133 }) {
  5851. for (uint32_t W : { 1, 141 }) {
  5852. if (calc_conv_output_size(W, KW, s0, p0, d0) > 0 &&
  5853. calc_conv_output_size(H, KH, s1, p1, d1) > 0) {
  5854. for (auto kernel_type : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  5855. test_cases.emplace_back(new test_conv_2d(
  5856. { W, H, Cin, 2 }, { KW, KH, Cin, Cout }, kernel_type, s0, s1, p0, p1, d0, d1, false));
  5857. }
  5858. }
  5859. }
  5860. }
  5861. }
  5862. }
  5863. }
  5864. }
  5865. }
  5866. }
  5867. // sycl backend will limit task global_range < MAX_INT
  5868. // test cases for 2D im2col with large input W and H (occurs in stable-diffusion)
  5869. // however these cases need to alloc more memory which may fail in some devices (Intel Arc770, etc.)
  5870. // these cases are verified (pass) in Intel(R) Data Center GPU Max 1100 (sycl backend) and NV A30 (cuda backend)
  5871. // test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16, {1024, 1024, 256, 1}, {3, 3, 256, 1}, 1, 1, 1, 1, 1, 1, true));
  5872. // test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F32, {1024, 1024, 256, 1}, {3, 3, 256, 1}, 1, 1, 1, 1, 1, 1, true));
  5873. test_cases.emplace_back(new test_conv_2d_dw({17, 34, 9, 1}, {3, 3, 1, 9}, 1, 0, 1, false));
  5874. test_cases.emplace_back(new test_conv_2d_dw({17, 34, 9, 1}, {3, 3, 1, 9}, 1, 0, 1, true));
  5875. test_cases.emplace_back(new test_conv_2d_dw({32, 8, 64, 1}, {3, 3, 1, 64}, 2, 1, 1, false));
  5876. test_cases.emplace_back(new test_conv_2d_dw({32, 8, 64, 1}, {3, 3, 1, 64}, 2, 1, 1, true));
  5877. // CONV_3D
  5878. auto calc_conv_output_size_3d = [](int64_t ins, int64_t ks, int s, int p, int d) -> int64_t {
  5879. return (ins + 2 * p - d * (ks - 1) - 1) / s + 1;
  5880. };
  5881. for (ggml_type kernel_type : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  5882. for (int N : {1, 2}) {
  5883. for (int IC : {1, 3}) {
  5884. for (int OC : {1, 4}) {
  5885. for (int s0 : {1, 2}) {
  5886. for (int p1 : {0, 1}) {
  5887. for (int d2 : {1, 2}) {
  5888. int64_t IW = 20, IH = 22, ID = 18;
  5889. int64_t KW = 3, KH = 3, KD = 3;
  5890. int s1 = s0, s2 = s0;
  5891. int p0 = p1, p2 = p1;
  5892. int d0 = d2, d1 = d2;
  5893. if (calc_conv_output_size_3d(IW, KW, s0, p0, d0) <= 0 ||
  5894. calc_conv_output_size_3d(IH, KH, s1, p1, d1) <= 0 ||
  5895. calc_conv_output_size_3d(ID, KD, s2, p2, d2) <= 0) {
  5896. continue;
  5897. }
  5898. test_cases.emplace_back(new test_conv_3d(
  5899. N, IC, ID, IH, IW,
  5900. OC, KD, KH, KW,
  5901. s0, s1, s2, p0, p1, p2, d0, d1, d2,
  5902. kernel_type));
  5903. // Asymmetric kernel and params
  5904. int64_t asym_KW = 5, asym_KH = 1, asym_KD = 3;
  5905. int asym_s0 = 2, asym_s1 = 1, asym_s2 = 1;
  5906. int asym_p0 = 2, asym_p1 = 0, asym_p2 = 1;
  5907. int asym_d0 = 1, asym_d1 = 1, asym_d2 = 2;
  5908. if (calc_conv_output_size_3d(IW, asym_KW, asym_s0, asym_p0, asym_d0) <= 0 ||
  5909. calc_conv_output_size_3d(IH, asym_KH, asym_s1, asym_p1, asym_d1) <= 0 ||
  5910. calc_conv_output_size_3d(ID, asym_KD, asym_s2, asym_p2, asym_d2) <= 0) {
  5911. continue;
  5912. }
  5913. test_cases.emplace_back(new test_conv_3d(
  5914. N, IC, ID, IH, IW,
  5915. OC, asym_KD, asym_KH, asym_KW,
  5916. asym_s0, asym_s1, asym_s2, asym_p0, asym_p1, asym_p2, asym_d0, asym_d1, asym_d2,
  5917. kernel_type));
  5918. }
  5919. }
  5920. }
  5921. }
  5922. }
  5923. }
  5924. // Case with kernel size 1
  5925. test_cases.emplace_back(new test_conv_3d(1, 4, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, kernel_type));
  5926. }
  5927. for(uint32_t Cout : {1, 9}){
  5928. for(uint32_t Cin : {1, 7}){
  5929. for(uint32_t K : {1, 3, 1337}){
  5930. for(uint32_t L : {1, 2, 13}){
  5931. for(uint32_t s0: {1, 2, 3}){
  5932. test_cases.emplace_back(new test_conv_transpose_1d({L,Cin,1,1}, {K,Cout,Cin,1}, s0, 0, 1));
  5933. }
  5934. }
  5935. }
  5936. }
  5937. }
  5938. test_cases.emplace_back(new test_conv_transpose_1d());
  5939. test_cases.emplace_back(new test_conv_transpose_1d({3,2,1,1}, {2,3,2,1}, 3, 0, 1));
  5940. test_cases.emplace_back(new test_conv_transpose_1d({3,2,1,1}, {2,3,2,1}, 2, 0, 1));
  5941. test_cases.emplace_back(new test_conv_transpose_1d({3,2,1,1}, {2,3,2,1}, 1, 0, 1));
  5942. test_cases.emplace_back(new test_conv_transpose_1d({3,2,1,1}, {3,2,2,1}, 2, 0, 1));
  5943. test_cases.emplace_back(new test_conv_transpose_1d({3,2,1,1}, {3,2,2,1}, 1, 0, 1));
  5944. test_cases.emplace_back(new test_conv_transpose_1d({3,2,1,1}, {3,1,2,1}, 1, 0, 1));
  5945. test_cases.emplace_back(new test_conv_transpose_1d({2,1,1,1}, {3,1,1,1}, 1, 0, 1));
  5946. test_cases.emplace_back(new test_conv_transpose_2d({3, 2, 3, 1}, {2, 2, 1, 3}, 1));
  5947. test_cases.emplace_back(new test_conv_transpose_2d({10, 10, 9, 1}, {3, 3, 1, 9}, 2));
  5948. test_cases.emplace_back(new test_conv_transpose_2d({129, 63, 35, 1}, {3, 3, 48, 35}, 1));
  5949. test_cases.emplace_back(new test_count_equal(GGML_TYPE_F32, {4, 500, 1, 1}));
  5950. test_cases.emplace_back(new test_count_equal(GGML_TYPE_F32, {4, 5000, 1, 1}));
  5951. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {32, 1, 1, 1}));
  5952. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {32, 513, 1, 1}));
  5953. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {100, 10, 1, 1}));
  5954. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {1024, 10, 1, 1}));
  5955. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {1024, 12, 1, 1}));
  5956. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {2000, 10, 1, 1}));
  5957. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {5438, 3, 1, 1}));
  5958. for (int ne3 : {1, 3}) { // CUDA backward pass only supports ne3 == 1
  5959. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 5, 4, ne3}, {1, 1, 1, 1}));
  5960. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 5, 4, ne3}, {2, 1, 1, 1}));
  5961. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 5, 4, ne3}, {1, 2, 1, 1}));
  5962. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 5, 4, ne3}, {1, 1, 2, 1}));
  5963. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 5, 4, ne3}, {1, 1, 1, 2}));
  5964. test_cases.emplace_back(new test_repeat(GGML_TYPE_I32, {10, 5, 4, ne3}, {2, 1, 1, 1}));
  5965. test_cases.emplace_back(new test_repeat(GGML_TYPE_I16, {10, 5, 4, ne3}, {1, 1, 1, 2}));
  5966. }
  5967. for (bool view : {false, true}) {
  5968. test_cases.emplace_back(new test_repeat_back(GGML_TYPE_F32, {8, 6, 4, 2}, {1, 1, 1, 1}, view));
  5969. test_cases.emplace_back(new test_repeat_back(GGML_TYPE_F32, {8, 6, 4, 2}, {2, 1, 1, 1}, view));
  5970. test_cases.emplace_back(new test_repeat_back(GGML_TYPE_F32, {8, 6, 4, 2}, {1, 2, 1, 1}, view));
  5971. test_cases.emplace_back(new test_repeat_back(GGML_TYPE_F32, {8, 6, 4, 2}, {1, 1, 2, 1}, view));
  5972. test_cases.emplace_back(new test_repeat_back(GGML_TYPE_F32, {8, 6, 4, 2}, {1, 1, 1, 2}, view));
  5973. }
  5974. test_cases.emplace_back(new test_dup(GGML_TYPE_F32));
  5975. test_cases.emplace_back(new test_dup(GGML_TYPE_F16));
  5976. test_cases.emplace_back(new test_dup(GGML_TYPE_I32));
  5977. test_cases.emplace_back(new test_dup(GGML_TYPE_I16));
  5978. test_cases.emplace_back(new test_dup(GGML_TYPE_F32, {10, 10, 5, 1}, {0, 2, 1, 3}));
  5979. test_cases.emplace_back(new test_dup(GGML_TYPE_F16, {10, 10, 5, 1}, {0, 2, 1, 3})); // dup by rows
  5980. test_cases.emplace_back(new test_dup(GGML_TYPE_F32, {10, 10, 5, 1}, {1, 0, 2, 3}));
  5981. test_cases.emplace_back(new test_dup(GGML_TYPE_F16, {10, 10, 5, 1}, {1, 0, 2, 3})); // dup dst not-contiguous
  5982. test_cases.emplace_back(new test_dup(GGML_TYPE_I16, {10, 8, 3, 1}, {0, 2, 1, 3}));
  5983. test_cases.emplace_back(new test_dup(GGML_TYPE_I16, {10, 8, 3, 1}, {1, 2, 0, 3}));
  5984. for (int dim = 1; dim < GGML_MAX_DIMS; ++dim) {
  5985. test_cases.emplace_back(new test_set(GGML_TYPE_F32, GGML_TYPE_F32, {6, 5, 4, 3}, dim));
  5986. }
  5987. for (int dim = 1; dim < GGML_MAX_DIMS; ++dim) {
  5988. test_cases.emplace_back(new test_set(GGML_TYPE_I32, GGML_TYPE_I32, {6, 5, 4, 3}, dim));
  5989. }
  5990. // same-type copy
  5991. for (ggml_type type : all_types) {
  5992. const auto nk = ggml_blck_size(type);
  5993. for (int k = 1; k < 4; ++k) {
  5994. test_cases.emplace_back(new test_cpy(type, type, {k*nk, 2, 3, 4}));
  5995. test_cases.emplace_back(new test_cpy(type, type, {k*nk, 2, 3, 4}, {0, 2, 1, 3}));
  5996. test_cases.emplace_back(new test_cpy(type, type, {k*nk, 2, 3, 4}, {0, 3, 1, 2}, {0, 2, 1, 3}));
  5997. }
  5998. }
  5999. for (ggml_type type_src : {GGML_TYPE_F16, GGML_TYPE_BF16, GGML_TYPE_F32}) {
  6000. for (ggml_type type_dst : all_types) {
  6001. test_cases.emplace_back(new test_cpy(type_src, type_dst, {256, 4, 4, 4}));
  6002. test_cases.emplace_back(new test_cpy(type_src, type_dst, {256, 2, 3, 4}, {0, 2, 1, 3})); // cpy by rows
  6003. }
  6004. }
  6005. for (ggml_type type_src : all_types) {
  6006. for (ggml_type type_dst : {GGML_TYPE_F32}) {
  6007. test_cases.emplace_back(new test_cpy(type_src, type_dst, {256, 4, 4, 4}));
  6008. test_cases.emplace_back(new test_cpy(type_src, type_dst, {256, 2, 3, 4}, {0, 2, 1, 3})); // cpy by rows
  6009. }
  6010. }
  6011. for (ggml_type type_src : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  6012. for (ggml_type type_dst : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  6013. test_cases.emplace_back(new test_cpy(type_src, type_dst, {256, 2, 3, 4}, {1, 0, 2, 3})); // cpy not-contiguous
  6014. }
  6015. }
  6016. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_I32, {256, 2, 3, 4}));
  6017. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_I32, {256, 2, 3, 4}, {1, 0, 2, 3}));
  6018. test_cases.emplace_back(new test_cpy(GGML_TYPE_I32, GGML_TYPE_F32, {256, 2, 3, 4}));
  6019. test_cases.emplace_back(new test_cpy(GGML_TYPE_I32, GGML_TYPE_F32, {256, 2, 3, 4}, {1, 0, 2, 3}));
  6020. test_cases.emplace_back(new test_cpy(GGML_TYPE_F16, GGML_TYPE_F16, {256, 4, 3, 1}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6021. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F32, {256, 4, 3, 1}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6022. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F32, {256, 4, 3, 3}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6023. test_cases.emplace_back(new test_cpy(GGML_TYPE_BF16, GGML_TYPE_BF16, {256, 4, 3, 1}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6024. test_cases.emplace_back(new test_cpy(GGML_TYPE_F16, GGML_TYPE_F16, {256, 4, 1, 1}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6025. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F32, {256, 4, 1, 1}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6026. test_cases.emplace_back(new test_cpy(GGML_TYPE_BF16, GGML_TYPE_BF16, {256, 4, 1, 1}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6027. test_cases.emplace_back(new test_cpy(GGML_TYPE_I32, GGML_TYPE_I32, {256, 4, 1, 1}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6028. test_cases.emplace_back(new test_cpy(GGML_TYPE_I32, GGML_TYPE_I32, {256, 1, 4, 1}, {1, 2, 0, 3}, {0, 0, 0, 0}));
  6029. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F32, {256, 1, 4, 1}, {1, 2, 0, 3}, {0, 0, 0, 0}));
  6030. for (ggml_type type_dst : { GGML_TYPE_F32, GGML_TYPE_I32, GGML_TYPE_F16, GGML_TYPE_BF16 }) {
  6031. for (bool use_view_slice : { true, false }) {
  6032. for (std::array<int64_t, 4> ne : std::initializer_list<std::array<int64_t, 4>>{ {2, 1, 1, 1}, {2, 1, 3, 5},
  6033. {2, 3, 5, 7}, {1, 4, 4, 1}, {1, 8, 17, 1}, {10, 10, 10, 1} }) {
  6034. if (use_view_slice && (type_dst == GGML_TYPE_F16 || type_dst == GGML_TYPE_BF16)) {
  6035. continue; // TODO: add after WebGPU is fixed
  6036. }
  6037. test_cases.emplace_back(new test_cont(type_dst, ne, use_view_slice));
  6038. }
  6039. }
  6040. }
  6041. auto add_test_bin_bcast = [&](ggml_type type, std::array<int64_t, 4> ne, std::array<int, 4> nr) {
  6042. for (auto op : {ggml_add, ggml_sub, ggml_mul, ggml_div}) {
  6043. test_cases.emplace_back(new test_bin_bcast(op, type, ne, nr));
  6044. }
  6045. };
  6046. for (ggml_type type : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  6047. add_test_bin_bcast(type, {1, 1, 8, 1}, {1, 1, 1, 1});
  6048. add_test_bin_bcast(type, {1, 1, 1, 1}, {32, 1, 1, 1});
  6049. add_test_bin_bcast(type, {1, 1, 320, 320}, {1, 1, 1, 1});
  6050. add_test_bin_bcast(type, {10, 5, 1, 1}, {1, 1, 1, 1});
  6051. add_test_bin_bcast(type, {10, 5, 4, 1}, {1, 1, 1, 1});
  6052. add_test_bin_bcast(type, {10, 5, 4, 3}, {1, 1, 1, 1});
  6053. add_test_bin_bcast(type, {10, 5, 4, 3}, {2, 1, 1, 1});
  6054. add_test_bin_bcast(type, {10, 5, 4, 3}, {1, 2, 1, 1});
  6055. add_test_bin_bcast(type, {10, 5, 4, 3}, {1, 1, 2, 1});
  6056. add_test_bin_bcast(type, {10, 5, 4, 3}, {1, 1, 1, 2});
  6057. add_test_bin_bcast(type, {10, 5, 4, 3}, {1, 1, 2, 2});
  6058. add_test_bin_bcast(type, {10, 5, 4, 3}, {1, 2, 2, 2});
  6059. add_test_bin_bcast(type, {10, 5, 4, 3}, {2, 2, 2, 2});
  6060. // test case for k_bin_bcast_unravel in CUDA backend
  6061. add_test_bin_bcast(type, {1, 1, 65536, 1}, {256, 1, 1, 1});
  6062. // stable diffusion
  6063. add_test_bin_bcast(type, {1280, 1, 1, 1}, {1, 1, 1, 1});
  6064. add_test_bin_bcast(type, {1280, 1, 1, 1}, {1, 16, 16, 1});
  6065. add_test_bin_bcast(type, {1280, 16, 16, 1}, {1, 1, 1, 1});
  6066. add_test_bin_bcast(type, {1280, 1, 1, 1}, {1, 256, 1, 1});
  6067. add_test_bin_bcast(type, {1, 1, 1280, 1}, {16, 16, 1, 1});
  6068. add_test_bin_bcast(type, {16, 16, 1280, 1}, {1, 1, 1, 1});
  6069. add_test_bin_bcast(type, {1, 1, 1920, 1}, {16, 16, 1, 1});
  6070. add_test_bin_bcast(type, {1, 1, 2560, 1}, {16, 16, 1, 1});
  6071. add_test_bin_bcast(type, {1, 1, 1280, 1}, {32, 32, 1, 1});
  6072. add_test_bin_bcast(type, {1, 1, 1920, 1}, {32, 32, 1, 1});
  6073. add_test_bin_bcast(type, {1, 1, 640, 1}, {32, 32, 1, 1});
  6074. add_test_bin_bcast(type, {5120, 1, 1, 1}, {1, 256, 1, 1});
  6075. add_test_bin_bcast(type, {640, 1, 1, 1}, {1, 1, 1, 1});
  6076. add_test_bin_bcast(type, {64, 262144, 1, 1}, {1, 1, 1, 1});
  6077. //add_test_bin_bcast(type, {3, 3, 2560, 1280}, {1, 1, 1, 1});
  6078. //add_test_bin_bcast(type, {3, 3, 2560, 1280}, {2, 1, 1, 1});
  6079. }
  6080. // single inplace tests, especially important for WebGPU backend since kernels for inplace vs. not are different
  6081. test_cases.emplace_back(new test_bin_bcast(ggml_add_inplace, GGML_TYPE_F32, {16, 5, 4, 3}, {1, 1, 1, 1}, 16));
  6082. test_cases.emplace_back(new test_bin_bcast(ggml_mul_inplace, GGML_TYPE_F32, {16, 5, 4, 3}, {1, 1, 1, 1}, 16));
  6083. test_cases.emplace_back(new test_bin_bcast(ggml_sub_inplace, GGML_TYPE_F32, {16, 5, 4, 3}, {1, 1, 1, 1}, 16));
  6084. test_cases.emplace_back(new test_bin_bcast(ggml_div_inplace, GGML_TYPE_F32, {16, 5, 4, 3}, {1, 1, 1, 1}, 16));
  6085. // fusion
  6086. test_cases.emplace_back(new test_bin_bcast(ggml_add, GGML_TYPE_F32, {10, 5, 4, 3}, {2, 1, 1, 1}, 2));
  6087. test_cases.emplace_back(new test_bin_bcast(ggml_add, GGML_TYPE_F32, {16, 5, 4, 3}, {1, 2, 1, 1}, 3));
  6088. test_cases.emplace_back(new test_bin_bcast(ggml_add, GGML_TYPE_F32, {10, 5, 4, 3}, {1, 1, 2, 1}, 4));
  6089. test_cases.emplace_back(new test_bin_bcast(ggml_add, GGML_TYPE_F32, {16, 5, 4, 3}, {1, 1, 1, 2}, 5));
  6090. test_cases.emplace_back(new test_bin_bcast(ggml_add, GGML_TYPE_F32, {10, 5, 4, 3}, {1, 1, 2, 2}, 6));
  6091. test_cases.emplace_back(new test_bin_bcast(ggml_add, GGML_TYPE_F32, {10, 5, 4, 3}, {1, 2, 2, 2}, 7));
  6092. test_cases.emplace_back(new test_bin_bcast(ggml_add, GGML_TYPE_F32, {16, 5, 4, 3}, {2, 2, 2, 2}, 8));
  6093. test_cases.emplace_back(new test_bin_bcast(ggml_add, GGML_TYPE_F32, {16, 5, 4, 3}, {1, 1, 1, 1}, 16));
  6094. test_cases.emplace_back(new test_add1());
  6095. test_cases.emplace_back(new test_add1(GGML_TYPE_F32, {1024, 1024, 1, 1}));
  6096. test_cases.emplace_back(new test_scale());
  6097. test_cases.emplace_back(new test_scale(GGML_TYPE_F32, {10, 10, 10, 10}, 2.0f, 1.0f));
  6098. test_cases.emplace_back(new test_scale(GGML_TYPE_F32, {10, 10, 10, 10}, 2.0f, 1.0f, true)); // inplace test
  6099. test_cases.emplace_back(new test_scale(GGML_TYPE_F32, {100, 10, 10, 10}, 2.0f, 1.0f));
  6100. test_cases.emplace_back(new test_softcap(GGML_TYPE_F32, {10, 10, 10, 10}, 50.0f));
  6101. test_cases.emplace_back(new test_silu_back());
  6102. for (float eps : {0.0f, 1e-6f, 1e-4f, 1e-1f}) {
  6103. for (bool v : {false, true}) {
  6104. test_cases.emplace_back(new test_norm (GGML_TYPE_F32, {64, 5, 4, 3}, v, eps));
  6105. test_cases.emplace_back(new test_rms_norm(GGML_TYPE_F32, {64, 5, 4, 3}, v, eps));
  6106. }
  6107. test_cases.emplace_back(new test_rms_norm_back(GGML_TYPE_F32, {64, 5, 4, 3}, eps));
  6108. test_cases.emplace_back(new test_l2_norm (GGML_TYPE_F32, {64, 5, 4, 3}, eps));
  6109. }
  6110. // in-place tests
  6111. test_cases.emplace_back(new test_rms_norm(GGML_TYPE_F32, {64, 5, 4, 3}, false, 1e-6f, true));
  6112. for (float eps : {0.0f, 1e-6f, 1e-4f, 1e-1f, 1.0f}) {
  6113. test_cases.emplace_back(new test_rms_norm_mul_add(GGML_TYPE_F32, {64, 5, 4, 3}, eps, false));
  6114. test_cases.emplace_back(new test_rms_norm_mul_add(GGML_TYPE_F32, {64, 5, 4, 3}, eps, true));
  6115. test_cases.emplace_back(new test_norm_mul_add(GGML_TYPE_F32, {64, 5, 4, 3}, eps, false));
  6116. test_cases.emplace_back(new test_norm_mul_add(GGML_TYPE_F32, {64, 5, 4, 3}, eps, true));
  6117. }
  6118. for (uint32_t n : {1, 511, 1025, 8192, 33*512}) {
  6119. for (bool multi_add : {false, true}) {
  6120. test_cases.emplace_back(new test_rms_norm_mul_add(GGML_TYPE_F32, {n, 1, 1, 1}, 1e-6f, false, multi_add));
  6121. }
  6122. }
  6123. for (auto multi_add : {false, true}) {
  6124. for (auto set_rows : {false, true}) {
  6125. for (auto rope : {GGML_ROPE_TYPE_NORMAL, GGML_ROPE_TYPE_NEOX}) {
  6126. test_cases.emplace_back(new test_rms_norm_mul_rope({768, 1, 1, 1}, 1e-6f, multi_add, set_rows, rope));
  6127. test_cases.emplace_back(new test_rms_norm_mul_rope({768, 3, 1, 1}, 1e-6f, multi_add, set_rows, rope));
  6128. test_cases.emplace_back(new test_rms_norm_mul_rope({768, 3, 5, 1}, 1e-6f, multi_add, set_rows, rope));
  6129. test_cases.emplace_back(new test_rms_norm_mul_rope({128, 32, 2, 1}, 1e-6f, multi_add, set_rows, rope));
  6130. test_cases.emplace_back(new test_rms_norm_mul_rope({128, 4, 2, 1}, 1e-6f, multi_add, set_rows, rope));
  6131. test_cases.emplace_back(new test_rms_norm_mul_rope({128, 32, 50, 1}, 1e-6f, multi_add, set_rows, rope));
  6132. test_cases.emplace_back(new test_rms_norm_mul_rope({128, 4, 50, 1}, 1e-6f, multi_add, set_rows, rope));
  6133. test_cases.emplace_back(new test_rms_norm_mul_rope({8192, 2, 2, 1}, 1e-6f, multi_add, set_rows, rope));
  6134. test_cases.emplace_back(new test_rms_norm_mul_rope({8192, 2, 2, 1}, 1e-6f, multi_add, set_rows, rope));
  6135. }
  6136. }
  6137. }
  6138. test_cases.emplace_back(new test_l2_norm(GGML_TYPE_F32, {64, 5, 4, 3}, 1e-12f));
  6139. for (int64_t d_conv : {3, 4, 9}) {
  6140. for (int64_t d_inner: {1024, 1536, 2048}) {
  6141. test_cases.emplace_back(new test_ssm_conv(GGML_TYPE_F32, {d_conv, d_inner, 1, 1}, {d_conv, d_inner, 1, 1}));
  6142. test_cases.emplace_back(new test_ssm_conv(GGML_TYPE_F32, {2 * d_conv, d_inner, 1, 1}, {d_conv, d_inner, 1, 1}));
  6143. test_cases.emplace_back(new test_ssm_conv(GGML_TYPE_F32, {d_conv, d_inner, 4, 1}, {d_conv, d_inner, 1, 1}));
  6144. }
  6145. }
  6146. test_cases.emplace_back(new test_ssm_scan(GGML_TYPE_F32, 16, 1, 1024, 1, 32, 4)); // Mamba-1
  6147. test_cases.emplace_back(new test_ssm_scan(GGML_TYPE_F32, 128, 64, 16, 2, 32, 4)); // Mamba-2
  6148. test_cases.emplace_back(new test_ssm_scan(GGML_TYPE_F32, 256, 64, 8, 2, 32, 4)); // Falcon-H1
  6149. test_cases.emplace_back(new test_rwkv_wkv6(GGML_TYPE_F32, 32, 64, 1, 1));
  6150. test_cases.emplace_back(new test_rwkv_wkv6(GGML_TYPE_F32, 32, 64, 32, 1));
  6151. test_cases.emplace_back(new test_rwkv_wkv6(GGML_TYPE_F32, 32, 64, 32, 4));
  6152. test_cases.emplace_back(new test_rwkv_wkv6(GGML_TYPE_F32, 32, 64, 128, 4));
  6153. test_cases.emplace_back(new test_rwkv_wkv7(GGML_TYPE_F32, 32, 64, 1, 1));
  6154. test_cases.emplace_back(new test_rwkv_wkv7(GGML_TYPE_F32, 32, 64, 32, 1));
  6155. test_cases.emplace_back(new test_rwkv_wkv7(GGML_TYPE_F32, 32, 64, 32, 4));
  6156. test_cases.emplace_back(new test_rwkv_wkv7(GGML_TYPE_F32, 32, 64, 128, 4));
  6157. test_cases.emplace_back(new test_gla(GGML_TYPE_F32, 32, 64, 1, 1));
  6158. test_cases.emplace_back(new test_gla(GGML_TYPE_F32, 32, 64, 32, 1));
  6159. test_cases.emplace_back(new test_gla(GGML_TYPE_F32, 32, 64, 32, 4));
  6160. test_cases.emplace_back(new test_gla(GGML_TYPE_F32, 32, 64, 128, 4));
  6161. #if 0
  6162. // > 4GB A matrix. Too slow to be enabled by default.
  6163. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F16, 900000, 3, 2592, {1, 1}, {1, 1}));
  6164. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F16, 1700000, 96, 2592, {1, 1}, {1, 1}));
  6165. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F16, 1700000, 3, 2592, {1, 1}, {1, 1}));
  6166. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F16, 1700000, 1, 2592, {1, 1}, {1, 1}));
  6167. #endif
  6168. for (ggml_type type_a : all_types) {
  6169. for (int i = 1; i < 10; ++i) {
  6170. test_cases.emplace_back(new test_mul_mat(type_a, GGML_TYPE_F32, 16, i, 256, { 1, 1}, {1, 1}));
  6171. }
  6172. }
  6173. #if 0
  6174. {
  6175. // Test paths in OpenCL
  6176. std::vector<int> ns = {32, 64, 128, 256, 512, 1024, 4096};
  6177. std::vector<int> ks = {896, 1536, 4096};
  6178. for (auto n : ns) {
  6179. for (auto k : ks) {
  6180. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_Q8_0, GGML_TYPE_F32, 1024, n, k, {1, 1}, {1, 1}));
  6181. }
  6182. }
  6183. }
  6184. #endif
  6185. #if 1
  6186. for (ggml_type type_a : base_types) {
  6187. for (ggml_type type_b : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  6188. std::vector<int> ks = { 256 };
  6189. if (ggml_blck_size(type_a) == 1) {
  6190. ks.push_back(4);
  6191. }
  6192. for (auto k : ks) {
  6193. // test cases without permutation
  6194. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {1, 1}, {1, 1}));
  6195. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {1, 1}, {2, 1}));
  6196. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {1, 1}, {1, 2}));
  6197. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {3, 1}, {1, 1}));
  6198. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {3, 1}, {2, 1}));
  6199. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {3, 2}, {1, 1}));
  6200. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {3, 2}, {2, 1}));
  6201. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {3, 2}, {1, 2}));
  6202. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {3, 2}, {2, 2}));
  6203. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {1, 1}, {1, 1}));
  6204. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {1, 1}, {2, 1}));
  6205. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {1, 1}, {1, 2}));
  6206. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {3, 1}, {1, 1}));
  6207. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {3, 1}, {2, 1}));
  6208. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {3, 2}, {1, 1}));
  6209. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {3, 2}, {2, 1}));
  6210. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {3, 2}, {1, 2}));
  6211. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {3, 2}, {2, 2}));
  6212. // test cases with permutation
  6213. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {2, 3}, {1, 1}, {0, 2, 1, 3}));
  6214. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {2, 3}, {1, 1}, {0, 1, 3, 2}));
  6215. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {2, 3}, {1, 1}, {0, 3, 2, 1}));
  6216. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 8, k, {2, 3}, {1, 1}, {0, 2, 1, 3}));
  6217. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 8, k, {2, 3}, {1, 1}, {0, 1, 3, 2}));
  6218. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 8, k, {2, 3}, {1, 1}, {0, 3, 2, 1}));
  6219. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {2, 3}, {1, 1}, {0, 2, 1, 3}));
  6220. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {2, 3}, {1, 1}, {0, 1, 3, 2}));
  6221. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {2, 3}, {1, 1}, {0, 3, 2, 1}));
  6222. }
  6223. // test cases with large ne00/ne10 to cover stream-k fixup
  6224. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, 1024, {3, 2}, {1, 1}));
  6225. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 8, 1024, {3, 2}, {1, 1}));
  6226. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, 1024, {3, 2}, {1, 1}));
  6227. // test cases with large batch size
  6228. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 8, 256, {1536, 1}, {1, 1}));
  6229. }
  6230. }
  6231. for (ggml_type type_a : other_types) {
  6232. for (ggml_type type_b : {GGML_TYPE_F32}) {
  6233. if (ggml_blck_size(type_a) != 256) {
  6234. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, ggml_blck_size(type_a), {1, 1}, {1, 1}));
  6235. }
  6236. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, 256, {1, 1}, {1, 1}));
  6237. }
  6238. }
  6239. #else
  6240. // m = a rows
  6241. // n = b rows
  6242. // k = cols
  6243. std::uniform_int_distribution<> dist_m(1, 128);
  6244. std::uniform_int_distribution<> dist_n(16, 128);
  6245. std::uniform_int_distribution<> dist_k(1, 16);
  6246. for (int i = 0; i < 1000; i++) {
  6247. for (ggml_type type_a : all_types) {
  6248. for (ggml_type type_b : {GGML_TYPE_F32}) {
  6249. int m = dist_m(rng);
  6250. int n = dist_n(rng);
  6251. int k = dist_k(rng) * ggml_blck_size(type_a);
  6252. test_cases.emplace_back(new test_mul_mat(type_a, type_b, m, n, k, { 1, 1}, {1, 1}));
  6253. }
  6254. }
  6255. }
  6256. #endif
  6257. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 64, 2, 128, { 8, 1}, {1, 1}));
  6258. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 83, 2, 128, { 8, 1}, {4, 1}));
  6259. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 64, 2, 64, { 8, 1}, {4, 1}));
  6260. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 83, 2, 64, { 8, 1}, {4, 1}));
  6261. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 64, 45, 128, { 8, 1}, {4, 1}));
  6262. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 128, 45, 64, { 8, 1}, {4, 1}));
  6263. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 1056, 1, 193, {1, 1}, {4, 1}, {0, 2, 1, 3}));
  6264. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 1056, 1, 67, {1, 1}, {4, 1}, {0, 2, 1, 3}));
  6265. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F32, GGML_TYPE_F32, 16, 32, 32, { 1, 1}, {1, 1}, {0, 1, 2, 3}, 64, 3));
  6266. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F32, GGML_TYPE_F32, 64, 77, 77, {12,1}, {1,1}));
  6267. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_Q4_0, GGML_TYPE_F32, 576, 512, 576, {1,1}, {1,1}));
  6268. #if 0
  6269. // test the mat-mat path for Metal
  6270. for (int k = 1; k < 512; ++k) {
  6271. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 64, 127, k, {12,1}, {1,1}));
  6272. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F32, GGML_TYPE_F32, 64, 127, k, {12,1}, {1,1}));
  6273. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 64, 77, k, {12,1}, {1,1}));
  6274. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F32, GGML_TYPE_F32, 64, 77, k, {12,1}, {1,1}));
  6275. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 64, 128, k, {12,1}, {1,1}));
  6276. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F32, GGML_TYPE_F32, 64, 128, k, {12,1}, {1,1}));
  6277. test_cases.emplace_back(new test_mul_mat_id(GGML_TYPE_F16, GGML_TYPE_F32, 16, 16, false, 50, 200, k));
  6278. test_cases.emplace_back(new test_mul_mat_id(GGML_TYPE_F16, GGML_TYPE_F32, 16, 16, true, 50, 200, k));
  6279. test_cases.emplace_back(new test_mul_mat_id(GGML_TYPE_F32, GGML_TYPE_F32, 16, 16, false, 50, 200, k));
  6280. test_cases.emplace_back(new test_mul_mat_id(GGML_TYPE_F32, GGML_TYPE_F32, 16, 16, true, 50, 200, k));
  6281. }
  6282. #endif
  6283. for (auto bs2 : {1,3}) {
  6284. for (auto bs : {1,2,4,8}) {
  6285. for (auto nr : {1,4}) {
  6286. for (uint32_t m = 0; m < 2; ++m) {
  6287. for (uint32_t k = 0; k < 2; ++k) {
  6288. for (ggml_type type: {GGML_TYPE_F16, GGML_TYPE_BF16, GGML_TYPE_F32}) {
  6289. test_cases.emplace_back(new test_mul_mat(type, GGML_TYPE_F32, 1056 + m, 1, 128 + k, {bs, bs2}, {nr, 1}, {0, 2, 1, 3}));
  6290. test_cases.emplace_back(new test_mul_mat(type, GGML_TYPE_F32, 128 + m, 1, 1056 + k, {bs, bs2}, {nr, 1}, {0, 1, 2, 3}, 2*1056 + k));
  6291. }
  6292. }
  6293. }
  6294. }
  6295. }
  6296. }
  6297. // sycl backend will limit task global_range < MAX_INT
  6298. // test case for f16-type-convert-to-fp32 kernel with large k under fp32 compute dtype (occurs in stable-diffusion)
  6299. // however this case needs to alloc more memory which may fail in some devices (Intel Arc770, etc.)
  6300. // this case is verified (pass) in Intel(R) Data Center GPU Max 1100 (sycl backend) and NV A30 (cuda backend)
  6301. // test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F16, 512, 262144, 9216, {1, 1}, {1, 1}));
  6302. // test large experts*tokens
  6303. for (bool b : {false, true}) {
  6304. test_cases.emplace_back(new test_mul_mat_id(GGML_TYPE_F16, GGML_TYPE_F32, 16, 16, b, 32, 1024, 16));
  6305. test_cases.emplace_back(new test_mul_mat_id(GGML_TYPE_F16, GGML_TYPE_F32, 2, 2, b, 32, 8192, 64));
  6306. test_cases.emplace_back(new test_mul_mat_id(GGML_TYPE_F16, GGML_TYPE_F32, 16, 16, b, 50, 200, 64));
  6307. }
  6308. test_cases.emplace_back(new test_mul_mat_id(GGML_TYPE_F16, GGML_TYPE_F32, 1, 1, false, 8, 16, 1));
  6309. test_cases.emplace_back(new test_mul_mat_id_fusion(GGML_TYPE_F16, GGML_TYPE_F32, 16, 16, false, 32, 32, 32, 3));
  6310. // gpt-oss issue with Vulkan mmq_id
  6311. test_cases.emplace_back(new test_mul_mat_id(GGML_TYPE_MXFP4, GGML_TYPE_F32, 32, 2, false, 2880, 32, 2880));
  6312. for (ggml_type type_a : base_types) {
  6313. for (ggml_type type_b : {GGML_TYPE_F32 /*, GGML_TYPE_F16 */}) {
  6314. for (int n_mats : {4, 8}) {
  6315. for (int n_used : {1, 2, 4}) {
  6316. for (bool b : {false, true}) {
  6317. for (int n : {1, 4, 5, 17, 32, 129}) {
  6318. int m = 512;
  6319. int k = 256;
  6320. test_cases.emplace_back(new test_mul_mat_id(type_a, type_b, n_mats, n_used, b, m, n, k));
  6321. }
  6322. }
  6323. }
  6324. }
  6325. }
  6326. }
  6327. for (ggml_type type_a : other_types) {
  6328. for (ggml_type type_b : {GGML_TYPE_F32 /*, GGML_TYPE_F16 */}) {
  6329. for (int n_mats : {4}) {
  6330. for (int n_used : {2}) {
  6331. for (bool b : {false}) {
  6332. for (int n : {1, 32}) {
  6333. int m = 512;
  6334. int k = 256;
  6335. test_cases.emplace_back(new test_mul_mat_id(type_a, type_b, n_mats, n_used, b, m, n, k));
  6336. }
  6337. }
  6338. }
  6339. }
  6340. }
  6341. }
  6342. for (int bs : {1, 4, 512}) {
  6343. for (ggml_type type_a : {GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_Q4_0, GGML_TYPE_Q4_K}) {
  6344. for (ggml_type type_b : {GGML_TYPE_F32}) {
  6345. // test with mul after (ffn_moe_weighted)
  6346. test_cases.emplace_back(new test_mul_mat_id_fusion(type_a, type_b, 128, 8, false, 768, bs, 2048, 1, true));
  6347. }
  6348. }
  6349. }
  6350. for (ggml_type type_a : base_types) {
  6351. for (ggml_type type_b : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  6352. for (int n : {1, 16}) {
  6353. for (int k : {1, 16}) {
  6354. for (int bs2 : {1, 3}) {
  6355. for (int bs3 : {1, 3}) {
  6356. for (int nr2 : {1, 2}) {
  6357. for (int nr3 : {1, 2}) {
  6358. test_cases.emplace_back(new test_out_prod(type_a, type_b, 256, n, k, {bs2, bs3}, {nr2, nr3}));
  6359. }
  6360. }
  6361. }
  6362. }
  6363. }
  6364. }
  6365. }
  6366. }
  6367. // add_id
  6368. for (ggml_type type_a : {GGML_TYPE_F32}) {
  6369. for (ggml_type type_b : {GGML_TYPE_F32}) {
  6370. for (int n_mats : {4, 8}) {
  6371. for (int n_used : {1, 2, 4}) {
  6372. for (int n_embd : {32, 129}) {
  6373. for (int n_token : {1, 32, 129}) {
  6374. test_cases.emplace_back(new test_add_id(type_a, type_b, n_embd, n_mats, n_used, n_token));
  6375. }
  6376. }
  6377. }
  6378. }
  6379. }
  6380. }
  6381. for (ggml_type type : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  6382. test_cases.emplace_back(new test_sqr (type));
  6383. test_cases.emplace_back(new test_sqrt (type));
  6384. test_cases.emplace_back(new test_log (type));
  6385. test_cases.emplace_back(new test_sin (type));
  6386. test_cases.emplace_back(new test_cos (type));
  6387. test_cases.emplace_back(new test_clamp (type));
  6388. test_cases.emplace_back(new test_leaky_relu(type));
  6389. test_cases.emplace_back(new test_floor (type));
  6390. test_cases.emplace_back(new test_ceil (type));
  6391. test_cases.emplace_back(new test_round (type));
  6392. test_cases.emplace_back(new test_trunc (type));
  6393. test_cases.emplace_back(new test_sqr (type, {7, 1, 5, 3}));
  6394. test_cases.emplace_back(new test_sqrt (type, {7, 1, 5, 3}));
  6395. test_cases.emplace_back(new test_log (type, {7, 1, 5, 3}));
  6396. test_cases.emplace_back(new test_sin (type, {7, 1, 5, 3}));
  6397. test_cases.emplace_back(new test_cos (type, {7, 1, 5, 3}));
  6398. test_cases.emplace_back(new test_clamp (type, {7, 1, 5, 3}));
  6399. test_cases.emplace_back(new test_leaky_relu(type, {7, 1, 5, 3}));
  6400. test_cases.emplace_back(new test_floor (type, {7, 1, 5, 3}));
  6401. test_cases.emplace_back(new test_floor (type, { 1024, 1024, 1, 1 }));
  6402. test_cases.emplace_back(new test_ceil (type, {7, 1, 5, 3}));
  6403. test_cases.emplace_back(new test_ceil (type, { 1024, 1024, 1, 1 }));
  6404. test_cases.emplace_back(new test_round (type, {7, 1, 5, 3}));
  6405. test_cases.emplace_back(new test_round (type, { 1024, 1024, 1, 1 }));
  6406. test_cases.emplace_back(new test_trunc (type, {7, 1, 5, 3}));
  6407. test_cases.emplace_back(new test_trunc (type, { 1024, 1024, 1, 1 }));
  6408. }
  6409. test_cases.emplace_back(new test_diag_mask_inf(GGML_TYPE_F32, {10, 10, 1, 1}, 5));
  6410. test_cases.emplace_back(new test_diag_mask_inf(GGML_TYPE_F32, {10, 10, 3, 1}, 5));
  6411. test_cases.emplace_back(new test_diag_mask_inf(GGML_TYPE_F32, {10, 10, 3, 2}, 5));
  6412. #if 0
  6413. std::uniform_int_distribution<> dist_ne1(1, 50);
  6414. int exponent = 1;
  6415. while (exponent < (1 << 17)) {
  6416. std::uniform_int_distribution<> dist_ne0(exponent, 2*exponent);
  6417. for (int n = 0; n < 10; ++n) {
  6418. int64_t ne0 = dist_ne0(rng);
  6419. int64_t ne1 = dist_ne1(rng);
  6420. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, GGML_TYPE_F32, {ne0, ne1, 1, 1}, n/2 == 0, 0.1f, ne0 < 1000 ? 4.0f : 0.0f));
  6421. }
  6422. exponent <<= 1;
  6423. }
  6424. #endif
  6425. for (bool mask : {false, true}) {
  6426. for (bool sinks : {false, true}) {
  6427. for (float max_bias : {0.0f, 8.0f}) {
  6428. if (!mask && max_bias > 0.0f) continue;
  6429. for (float scale : {1.0f, 0.1f}) {
  6430. for (int64_t ne0 : {16, 1024}) {
  6431. for (int64_t ne1 : {16, 1024}) {
  6432. if (mask) {
  6433. for (ggml_type m_prec : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  6434. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0, ne1, 1, 1}, mask, sinks, m_prec, {1, 1}, scale, max_bias));
  6435. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0-1, ne1-1, 1, 1}, mask, sinks, m_prec, {1, 1}, scale, max_bias));
  6436. if (ne0 <= 32 && ne1 <= 32) {
  6437. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0, ne1, 1, 3}, mask, sinks, m_prec, {3, 1}, scale, max_bias));
  6438. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0-1, ne1-1, 1, 1}, mask, sinks, m_prec, {2, 3}, scale, max_bias));
  6439. }
  6440. }
  6441. } else {
  6442. /* The precision of mask here doesn't matter as boolean mask is false */
  6443. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0, ne1, 1, 1}, mask, sinks, GGML_TYPE_F32, {1, 1}, scale, max_bias));
  6444. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0-1, ne1-1, 1, 1}, mask, sinks, GGML_TYPE_F32, {1, 1}, scale, max_bias));
  6445. }
  6446. }
  6447. }
  6448. }
  6449. }
  6450. // inplace tests
  6451. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {16, 2, 32, 1}, mask, sinks, GGML_TYPE_F32, {1, 1}, 0.1f, 0.0f, true));
  6452. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {16, 2, 32, 1}, mask, sinks, GGML_TYPE_F16, {1, 1}, 0.1f, 0.0f, true));
  6453. }
  6454. }
  6455. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {16, 2, 32, 1}, true, true, GGML_TYPE_F32, {1, 1}, 0.1f, 0.0f));
  6456. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {16, 2, 32, 1}, true, false, GGML_TYPE_F16, {1, 1}, 0.1f, 0.0f));
  6457. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {16, 2, 32, 1}, false, true, GGML_TYPE_F32, {1, 1}, 0.1f, 0.0f));
  6458. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {32, 2, 32, 1}, true, true, GGML_TYPE_F32, {1, 1}, 0.1f, 0.0f));
  6459. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {32, 2, 32, 1}, true, false, GGML_TYPE_F16, {1, 1}, 0.1f, 0.0f));
  6460. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {32, 2, 32, 1}, true, true, GGML_TYPE_F32, {1, 1}, 0.1f, 8.0f));
  6461. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {32, 2, 32, 1}, true, true, GGML_TYPE_F16, {1, 1}, 0.1f, 8.0f));
  6462. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {200001, 2, 3, 1}, true, true, GGML_TYPE_F32, {1, 1}, 0.1f, 8.0f));
  6463. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {200001, 2, 3, 1}, true, true, GGML_TYPE_F16, {1, 1}, 0.1f, 8.0f));
  6464. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {200000, 1, 1, 1}, false, false, GGML_TYPE_F32, {1, 1}, 1.0f, 0.0f));
  6465. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {200000, 4, 1, 1}, false, false, GGML_TYPE_F32, {1, 1}, 1.0f, 0.0f));
  6466. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {643251, 3, 1, 1}, false, false, GGML_TYPE_F32, {1, 1}, 1.0f, 0.0f));
  6467. for (float max_bias : {0.0f, 8.0f}) {
  6468. for (float scale : {1.0f, 0.1f}) {
  6469. for (int64_t ne0 : {16, 1024}) {
  6470. for (int64_t ne1 : {16, 1024}) {
  6471. test_cases.emplace_back(new test_soft_max_back(GGML_TYPE_F32, {ne0, ne1, 1, 1}, scale, max_bias));
  6472. test_cases.emplace_back(new test_soft_max_back(GGML_TYPE_F32, {ne0-1, ne1-1, 1, 1}, scale, max_bias));
  6473. test_cases.emplace_back(new test_soft_max_back(GGML_TYPE_F32, {ne0, ne1, 2, 3}, scale, max_bias));
  6474. }
  6475. }
  6476. }
  6477. }
  6478. for (bool fw : {true, false}) { // fw == forward
  6479. bool all = true;
  6480. for (float fs : { 1.0f, 1.4245f }) {
  6481. for (float ef : { 0.0f, 0.7465f }) {
  6482. for (float af : { 1.0f, 1.4245f }) {
  6483. for (ggml_type type : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  6484. for (bool ff : {false, true}) { // freq_factors
  6485. for (float v : { 0, 1 }) {
  6486. test_cases.emplace_back(new test_rope(type, {128, 32, 2, 1}, 128, GGML_ROPE_TYPE_NORMAL, 512, fs, ef, af, ff, v, fw)); // llama 7B
  6487. if (all) {
  6488. test_cases.emplace_back(new test_rope(type, {128, 40, 2, 1}, 128, GGML_ROPE_TYPE_NORMAL, 512, fs, ef, af, ff, v, fw)); // llama 13B
  6489. test_cases.emplace_back(new test_rope(type, {128, 52, 2, 1}, 128, GGML_ROPE_TYPE_NORMAL, 512, fs, ef, af, ff, v, fw)); // llama 30B
  6490. test_cases.emplace_back(new test_rope(type, {128, 64, 2, 1}, 128, GGML_ROPE_TYPE_NORMAL, 512, fs, ef, af, ff, v, fw)); // llama 65B
  6491. test_cases.emplace_back(new test_rope(type, {16, 16, 8192, 1}, 16, GGML_ROPE_TYPE_NORMAL, 512, fs, ef, af, ff, v, fw));
  6492. }
  6493. if (all) {
  6494. test_cases.emplace_back(new test_rope(type, { 64, 1, 2, 1}, 64, GGML_ROPE_TYPE_NEOX, 512, fs, ef, af, ff, v, fw)); // neox (falcon 7B)
  6495. test_cases.emplace_back(new test_rope(type, { 64, 71, 2, 1}, 64, GGML_ROPE_TYPE_NEOX, 512, fs, ef, af, ff, v, fw)); // neox (falcon 7B)
  6496. test_cases.emplace_back(new test_rope(type, { 64, 8, 2, 1}, 64, GGML_ROPE_TYPE_NEOX, 512, fs, ef, af, ff, v, fw)); // neox (falcon 40B)
  6497. test_cases.emplace_back(new test_rope(type, { 80, 32, 2, 1}, 20, GGML_ROPE_TYPE_NORMAL, 512, fs, ef, af, ff, v, fw));
  6498. test_cases.emplace_back(new test_rope(type, { 80, 32, 2, 1}, 32, GGML_ROPE_TYPE_NORMAL, 512, fs, ef, af, ff, v, fw));
  6499. test_cases.emplace_back(new test_rope(type, { 80, 32, 4, 1}, 32, GGML_ROPE_TYPE_NORMAL, 512, fs, ef, af, ff, v, fw));
  6500. test_cases.emplace_back(new test_rope(type, { 80, 32, 2, 1}, 20, GGML_ROPE_TYPE_NEOX, 512, fs, ef, af, ff, v, fw)); // neox (stablelm)
  6501. test_cases.emplace_back(new test_rope(type, { 80, 32, 2, 1}, 32, GGML_ROPE_TYPE_NEOX, 512, fs, ef, af, ff, v, fw)); // neox (phi-2)
  6502. test_cases.emplace_back(new test_rope(type, { 80, 32, 4, 1}, 32, GGML_ROPE_TYPE_NEOX, 512, fs, ef, af, ff, v, fw)); // neox (phi-2)
  6503. test_cases.emplace_back(new test_rope(type, { 16, 16, 8192, 1}, 16, GGML_ROPE_TYPE_NEOX, 512, fs, ef, af, ff, v, fw));
  6504. }
  6505. if (all) {
  6506. test_cases.emplace_back(new test_rope(type, {128, 12, 2, 1}, 128, GGML_ROPE_TYPE_MROPE, 512, fs, ef, af, ff, v, fw)); // rope_multi,m-rope (qwen2vl 2B)
  6507. test_cases.emplace_back(new test_rope(type, {128, 28, 2, 1}, 128, GGML_ROPE_TYPE_MROPE, 512, fs, ef, af, ff, v, fw)); // rope_multi,m-rope (qwen2vl 7B)
  6508. test_cases.emplace_back(new test_rope(type, {128, 12, 2, 1}, 20, GGML_ROPE_TYPE_MROPE, 512, fs, ef, af, ff, v, fw));
  6509. test_cases.emplace_back(new test_rope(type, {128, 28, 2, 1}, 32, GGML_ROPE_TYPE_MROPE, 512, fs, ef, af, ff, v, fw));
  6510. test_cases.emplace_back(new test_rope(type, {128, 12, 2, 1}, 128, GGML_ROPE_TYPE_IMROPE, 512, fs, ef, af, ff, v, fw)); // rope_multi,imrope (qwen3vl 2B)
  6511. test_cases.emplace_back(new test_rope(type, {128, 28, 2, 1}, 128, GGML_ROPE_TYPE_IMROPE, 512, fs, ef, af, ff, v, fw)); // rope_multi,imrope (qwen3vl 7B)
  6512. test_cases.emplace_back(new test_rope(type, {128, 12, 2, 1}, 20, GGML_ROPE_TYPE_IMROPE, 512, fs, ef, af, ff, v, fw));
  6513. test_cases.emplace_back(new test_rope(type, {128, 28, 2, 1}, 32, GGML_ROPE_TYPE_IMROPE, 512, fs, ef, af, ff, v, fw));
  6514. test_cases.emplace_back(new test_rope(type, { 80, 16, 2, 1}, 80, GGML_ROPE_TYPE_VISION, 512, fs, ef, af, ff, v, fw)); // rope_multi,m-rope (qwen2vl ViT)
  6515. test_cases.emplace_back(new test_rope(type, {128, 16, 2, 1}, 128, GGML_ROPE_TYPE_IMROPE, 512, fs, ef, af, ff, v, fw)); // rope_multi,m-rope (qwen3vl)
  6516. test_cases.emplace_back(new test_rope(type, {16, 16, 8192, 1}, 16, GGML_ROPE_TYPE_IMROPE, 512, fs, ef, af, ff, v, fw));
  6517. }
  6518. test_cases.emplace_back(new test_rope(type, { 64, 128, 2, 1}, 64, GGML_ROPE_TYPE_NEOX, 512, fs, ef, af, ff, v, fw)); // neox (falcon 40B)
  6519. }
  6520. }
  6521. all = false;
  6522. }
  6523. }
  6524. }
  6525. }
  6526. }
  6527. // single inplace test per type/mode/ff
  6528. for (ggml_type type : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  6529. for (int mode : {GGML_ROPE_TYPE_NORMAL, GGML_ROPE_TYPE_NEOX, GGML_ROPE_TYPE_MROPE, GGML_ROPE_TYPE_IMROPE, GGML_ROPE_TYPE_VISION}) {
  6530. for (bool ff : {false, true}) {
  6531. test_cases.emplace_back(new test_rope(type, {128, 32, 2, 1}, 128, mode, 512, 1.4245f, 0.7465f, 1.4245f, ff, 0, true, true));
  6532. }
  6533. }
  6534. }
  6535. for (int v : { 0, 1, 2, 3 }) {
  6536. for (int dim : { 0, 1, 2, 3, }) {
  6537. test_cases.emplace_back(new test_concat(GGML_TYPE_F32, {11, 12, 13, 14}, 7, dim, v));
  6538. test_cases.emplace_back(new test_concat(GGML_TYPE_I32, {11, 12, 13, 14}, 7, dim, v));
  6539. }
  6540. }
  6541. for (ggml_sort_order order : {GGML_SORT_ORDER_ASC, GGML_SORT_ORDER_DESC}) {
  6542. for (uint32_t i = 4; i <= 1024*1024; i *= 2) {
  6543. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {i-1, 1, 1, 1}));
  6544. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {i, 1, 1, 1}));
  6545. }
  6546. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {16, 10, 10, 10}, order));
  6547. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {60, 10, 10, 10}, order)); // qwen
  6548. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {1023, 2, 1, 3}, order));
  6549. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {1024, 2, 1, 3}, order));
  6550. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {1025, 2, 1, 3}, order));
  6551. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {2047, 2, 1, 3}, order));
  6552. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {2048, 2, 1, 3}, order));
  6553. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {2049, 2, 1, 3}, order));
  6554. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {2, 8, 8192, 1}, order)); // bailingmoe2 (group selection)
  6555. }
  6556. for (int n = 1; n < 5; ++n) {
  6557. for (int k = 1; k <= n; ++k) {
  6558. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {n, 2, 1, 3}, k, true));
  6559. }
  6560. }
  6561. for (int i = 0; i < 20; ++i) {
  6562. for (int k : {1, 2, 3, 7, 15, 100, 500, 1023, 9999}) {
  6563. if (k <= 1<<i) {
  6564. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {(1<<i), 1, 1, 1}, k));
  6565. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {(1<<i) + 11, 1, 2, 1}, k));
  6566. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {(1<<i) + 11, 1, 2, 1}, k, true));
  6567. }
  6568. }
  6569. }
  6570. for (int k : {1, 2, 3, 7, 15}) {
  6571. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {16, 10, 10, 10}, k));
  6572. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {60, 10, 10, 10}, k));
  6573. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {1023, 2, 1, 3}, k));
  6574. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {1024, 2, 1, 3}, k));
  6575. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {1025, 2, 1, 3}, k));
  6576. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {16384, 1, 1, 1}, k));
  6577. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {2047, 2, 1, 3}, k));
  6578. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {2048, 2, 1, 3}, k));
  6579. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {2049, 2, 1, 3}, k));
  6580. }
  6581. // exhaustive top_k tests
  6582. //for (int i = 1; i < 9999; ++i) {
  6583. // test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {i, 2, 1, 3}, rand() % i + 1));
  6584. //}
  6585. for (ggml_scale_mode mode : {GGML_SCALE_MODE_NEAREST, GGML_SCALE_MODE_BILINEAR, GGML_SCALE_MODE_BICUBIC, ggml_scale_mode(GGML_SCALE_MODE_BILINEAR | GGML_SCALE_FLAG_ANTIALIAS)}) {
  6586. test_cases.emplace_back(new test_upscale(GGML_TYPE_F32, {512, 512, 3, 2}, 2, mode));
  6587. test_cases.emplace_back(new test_upscale(GGML_TYPE_F32, {512, 512, 3, 2}, 2, mode, true));
  6588. test_cases.emplace_back(new test_interpolate(GGML_TYPE_F32, {2, 5, 7, 11}, {5, 7, 11, 13}, mode));
  6589. test_cases.emplace_back(new test_interpolate(GGML_TYPE_F32, {5, 7, 11, 13}, {2, 5, 7, 11}, mode));
  6590. }
  6591. for (ggml_scale_mode mode : {GGML_SCALE_MODE_BILINEAR, GGML_SCALE_MODE_BICUBIC}) {
  6592. test_cases.emplace_back(new test_interpolate(GGML_TYPE_F32, {2, 5, 7, 11}, {5, 7, 11, 13}, (ggml_scale_mode)(mode | GGML_SCALE_FLAG_ALIGN_CORNERS)));
  6593. test_cases.emplace_back(new test_interpolate(GGML_TYPE_F32, {1, 4, 3, 2}, {2, 8, 3, 2}, (ggml_scale_mode)(mode | GGML_SCALE_FLAG_ALIGN_CORNERS)));
  6594. test_cases.emplace_back(new test_interpolate(GGML_TYPE_F32, {4, 1, 3, 2}, {1, 1, 3, 2}, (ggml_scale_mode)(mode | GGML_SCALE_FLAG_ALIGN_CORNERS)));
  6595. }
  6596. test_cases.emplace_back(new test_sum());
  6597. test_cases.emplace_back(new test_sum_rows());
  6598. test_cases.emplace_back(new test_sum(GGML_TYPE_F32, {11, 5, 6, 3}, {0, 2, 1, 3})); // row-contiguous but non-contiguous
  6599. test_cases.emplace_back(new test_sum(GGML_TYPE_F32, {11, 5, 6, 3}, {0, 3, 2, 1}));
  6600. test_cases.emplace_back(new test_sum(GGML_TYPE_F32, {11, 5, 6, 3}, {0, 1, 3, 2}));
  6601. test_cases.emplace_back(new test_sum_rows(GGML_TYPE_F32, { 11, 5, 6, 3 }, true, false));
  6602. test_cases.emplace_back(new test_sum_rows(GGML_TYPE_F32, { 11, 5, 6, 3 }, false, true));
  6603. test_cases.emplace_back(new test_sum_rows(GGML_TYPE_F32, { 11, 5, 6, 3 }, true, true));
  6604. test_cases.emplace_back(new test_mean());
  6605. test_cases.emplace_back(new test_sum(GGML_TYPE_F32, { 33, 1, 1, 1 }));
  6606. test_cases.emplace_back(new test_sum_rows(GGML_TYPE_F32, { 33, 1, 1, 1 }));
  6607. test_cases.emplace_back(new test_mean(GGML_TYPE_F32, { 33, 1, 1, 1 }));
  6608. test_cases.emplace_back(new test_sum(GGML_TYPE_F32, { 33, 1024, 1, 1 }));
  6609. test_cases.emplace_back(new test_sum_rows(GGML_TYPE_F32, { 33, 1024, 1, 1 }));
  6610. test_cases.emplace_back(new test_sum(GGML_TYPE_F32, { 33, 256, 1, 1 }));
  6611. test_cases.emplace_back(new test_sum(GGML_TYPE_F32, { 33, 256, 1, 1 }, { 1, 0, 2, 3 })); // sum dst not-contiguous
  6612. test_cases.emplace_back(new test_sum_rows(GGML_TYPE_F32, { 33, 256, 1, 1 }));
  6613. test_cases.emplace_back(new test_mean(GGML_TYPE_F32, { 33, 256, 1, 1 }));
  6614. test_cases.emplace_back(new test_mean(GGML_TYPE_F32, { 32769, 1, 1, 1 }));
  6615. test_cases.emplace_back(new test_group_norm(GGML_TYPE_F32, {64, 64, 320, 1}));
  6616. test_cases.emplace_back(new test_group_norm(GGML_TYPE_F32, {9, 9, 1280, 1}));
  6617. test_cases.emplace_back(new test_group_norm_mul_add(GGML_TYPE_F32, {64, 64, 320, 1}));
  6618. test_cases.emplace_back(new test_group_norm_mul_add(GGML_TYPE_F32, {9, 9, 1280, 1}));
  6619. test_cases.emplace_back(new test_acc());
  6620. test_cases.emplace_back(new test_pad());
  6621. test_cases.emplace_back(new test_pad(GGML_TYPE_F32, {33, 17, 2, 1}, 4, 3, true)); // circular
  6622. test_cases.emplace_back(new test_pad_ext());
  6623. test_cases.emplace_back(new test_pad_reflect_1d());
  6624. test_cases.emplace_back(new test_pad_reflect_1d(GGML_TYPE_F32, {3000, 384, 4, 1}));
  6625. test_cases.emplace_back(new test_roll());
  6626. test_cases.emplace_back(new test_arange());
  6627. test_cases.emplace_back(new test_arange(GGML_TYPE_F32, 0.0f, 1048576.0f, 1.0f));
  6628. test_cases.emplace_back(new test_timestep_embedding());
  6629. test_cases.emplace_back(new test_leaky_relu());
  6630. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 10, 5, 4, 3 }));
  6631. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 127, 5, 4, 3 }));
  6632. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 128, 5, 4, 3 }));
  6633. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 128, 128, 4, 4 }));
  6634. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 255, 5, 4, 3 }));
  6635. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 256, 5, 4, 3 }));
  6636. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 511, 5, 4, 3 }));
  6637. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 512, 5, 4, 3 }));
  6638. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 1023, 5, 4, 3 }));
  6639. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 1024, 5, 4, 3 }));
  6640. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 2047, 5, 4, 3 }));
  6641. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 2048, 5, 4, 3 }));
  6642. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 201*1204, 1, 1, 1 }));
  6643. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 312*1205, 1, 1, 1 }));
  6644. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 20481, 4, 1, 1 }));
  6645. test_cases.emplace_back(new test_xielu());
  6646. test_cases.emplace_back(new test_tri(GGML_TRI_TYPE_LOWER));
  6647. test_cases.emplace_back(new test_tri(GGML_TRI_TYPE_LOWER_DIAG));
  6648. test_cases.emplace_back(new test_tri(GGML_TRI_TYPE_UPPER));
  6649. test_cases.emplace_back(new test_tri(GGML_TRI_TYPE_UPPER_DIAG));
  6650. test_cases.emplace_back(new test_fill(0.0f));
  6651. test_cases.emplace_back(new test_fill(2.0f, GGML_TYPE_F32, { 303, 207, 11, 3 }));
  6652. test_cases.emplace_back(new test_fill(-152.0f, GGML_TYPE_F32, { 800, 600, 4, 4 }));
  6653. test_cases.emplace_back(new test_fill(3.5f, GGML_TYPE_F32, { 2048, 512, 2, 2 }));
  6654. test_cases.emplace_back(new test_diag());
  6655. test_cases.emplace_back(new test_diag(GGML_TYPE_F32, { 79, 1, 19, 13 }));
  6656. test_cases.emplace_back(new test_diag(GGML_TYPE_F32, { 256, 1, 8, 16 }));
  6657. test_cases.emplace_back(new test_solve_tri());
  6658. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 11, 11, 1, 1 }, { 5, 11, 1, 1 }));
  6659. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 17, 17, 2, 4 }, { 9, 17, 2, 4 }));
  6660. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 30, 30, 7, 1 }, { 8, 30, 7, 1 }));
  6661. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 42, 42, 5, 2 }, { 10, 42, 5, 2 }));
  6662. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 64, 64, 2, 2 }, { 10, 64, 2, 2 }));
  6663. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 64, 64, 2, 2 }, { 64, 64, 2, 2 }));
  6664. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 79, 79, 5, 3 }, { 417, 79, 5, 3 }));
  6665. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 128, 128, 4, 2 }, { 32, 128, 4, 2 }));
  6666. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 80, 80, 2, 8 }, { 80, 80, 2, 8 }));
  6667. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 80, 80, 2, 8 }, { 79, 80, 2, 8 }));
  6668. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 80, 80, 2, 8 }, { 81, 80, 2, 8 }));
  6669. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 80, 80, 8, 8 }, { 80, 80, 8, 8 }));
  6670. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 80, 80, 8, 8 }, { 79, 80, 8, 8 }));
  6671. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 80, 80, 8, 8 }, { 81, 80, 8, 8 }));
  6672. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 84, 84, 4, 4 }, { 32, 84, 4, 4 }));
  6673. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 95, 95, 8, 8 }, { 40, 95, 8, 8 }));
  6674. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 100, 100, 4, 4 }, { 41, 100, 4, 4 }));
  6675. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 128, 128, 4, 4 }, { 31, 128, 4, 4 }));
  6676. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 128, 128, 4, 4 }, { 32, 128, 4, 4 }));
  6677. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 128, 128, 3, 4 }, { 32, 128, 3, 4 }));
  6678. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 128, 128, 4, 1 }, { 32, 128, 4, 1 }));
  6679. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 64, 64, 4, 4 }, { 200, 64, 4, 4 }));
  6680. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 64, 64, 4, 4 }, { 384, 64, 4, 4 }));
  6681. for (bool v : {false, true}) {
  6682. for (bool circular : {false, true}) {
  6683. test_cases.emplace_back(new test_pad_ext(GGML_TYPE_F32, {512, 512, 1, 1}, 0, 1, 0, 1, 0, 0, 0, 0, v, circular));
  6684. test_cases.emplace_back(new test_pad_ext(GGML_TYPE_F32, {11, 22, 33, 44}, 1, 2, 3, 4, 5, 6, 7, 8, v, circular));
  6685. }
  6686. }
  6687. for (int hsk : { 40, 64, 72, 80, 96, 128, 192, 256, 576 }) {
  6688. for (int hsv : { 40, 64, 72, 80, 96, 128, 192, 256, 512 }) {
  6689. if (hsk != 192 && hsk != 576 && hsk != hsv) continue;
  6690. if (hsk == 192 && (hsv != 128 && hsv != 192)) continue;
  6691. if (hsk == 576 && hsv != 512) continue; // DeepSeek MLA
  6692. for (bool mask : { true, false } ) {
  6693. for (bool sinks : { true, false } ) {
  6694. for (float max_bias : { 0.0f, 8.0f }) {
  6695. if (!mask && max_bias > 0.0f) continue;
  6696. for (float logit_softcap : {0.0f, 10.0f}) {
  6697. if (hsk != 128 && logit_softcap != 0.0f) continue;
  6698. for (int nh : { 4, }) {
  6699. for (int nr3 : { 1, 3, }) {
  6700. if (hsk > 64 && nr3 > 1) continue; // skip broadcast for large head sizes
  6701. for (int nr2 : { 1, 4, 16 }) {
  6702. if (nr2 == 16 && hsk != 128) continue;
  6703. //for (int kv : { 1, 17, 31, 33, 61, 113, 65, 127, 129, 130, 255, 260, 371, 380, 407, 512, 1024, }) {
  6704. for (int kv : { 113, 512, 1024, }) {
  6705. if (nr2 != 1 && kv != 512) continue;
  6706. for (int nb : { 1, 3, 32, 35, }) {
  6707. for (ggml_prec prec : {GGML_PREC_F32, GGML_PREC_DEFAULT}) {
  6708. if (hsk != 128 && prec == GGML_PREC_DEFAULT) continue;
  6709. for (ggml_type type_KV : {GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_BF16, GGML_TYPE_Q8_0, GGML_TYPE_Q4_0}) {
  6710. test_cases.emplace_back(new test_flash_attn_ext(
  6711. hsk, hsv, nh, {nr2, nr3}, kv, nb, mask, sinks, max_bias, logit_softcap, prec, type_KV));
  6712. // run fewer test cases permuted
  6713. if (mask == true && max_bias == 0.0f && logit_softcap == 0 && kv == 512) {
  6714. test_cases.emplace_back(new test_flash_attn_ext(
  6715. hsk, hsv, nh, {nr2, nr3}, kv, nb, mask, sinks, max_bias, logit_softcap, prec, type_KV, {0, 2, 1, 3}));
  6716. }
  6717. }
  6718. }
  6719. }
  6720. }
  6721. }
  6722. }
  6723. }
  6724. }
  6725. }
  6726. }
  6727. }
  6728. }
  6729. }
  6730. test_cases.emplace_back(new test_cross_entropy_loss (GGML_TYPE_F32, { 10, 5, 4, 3}));
  6731. test_cases.emplace_back(new test_cross_entropy_loss (GGML_TYPE_F32, {30000, 1, 1, 1}));
  6732. test_cases.emplace_back(new test_cross_entropy_loss_back(GGML_TYPE_F32, { 10, 5, 4, 3}));
  6733. test_cases.emplace_back(new test_cross_entropy_loss_back(GGML_TYPE_F32, {30000, 1, 1, 1}));
  6734. test_cases.emplace_back(new test_opt_step_adamw(GGML_TYPE_F32, {10, 5, 4, 3}));
  6735. test_cases.emplace_back(new test_opt_step_sgd(GGML_TYPE_F32, {10, 5, 4, 3}));
  6736. for (ggml_type type : base_types) {
  6737. for (bool with_gate : {false, true}) {
  6738. for (bool use_id : {false, true}) {
  6739. for (bool b : {false, true}) {
  6740. if (!use_id && b) {
  6741. continue;
  6742. }
  6743. for (bool with_bias : {false, true}) {
  6744. if (!with_gate && !with_bias) {
  6745. continue;
  6746. }
  6747. for (ggml_glu_op glu_op : {GGML_GLU_OP_SWIGLU, GGML_GLU_OP_GEGLU}) {
  6748. if (!with_bias && glu_op == GGML_GLU_OP_SWIGLU_OAI) {
  6749. continue;
  6750. }
  6751. if (!with_gate && glu_op != GGML_GLU_OP_SWIGLU) {
  6752. continue;
  6753. }
  6754. test_cases.emplace_back(new test_mul_mat_vec_fusion(type, glu_op, 1, 32, 256,
  6755. use_id, 16, 8, b, with_bias, with_gate));
  6756. test_cases.emplace_back(new test_mul_mat_vec_fusion(type, glu_op, 1, 32, 256,
  6757. use_id, 16, 8, b, with_bias, with_gate, {1, 1}));
  6758. }
  6759. }
  6760. }
  6761. }
  6762. }
  6763. }
  6764. for (auto gate : {GATING_FUNC_SOFTMAX, GATING_FUNC_SIGMOID, GATING_FUNC_SOFTMAX_WEIGHT}) {
  6765. for (bool with_norm : {false, true}) {
  6766. for (bool bias_probs : {false, true}) {
  6767. for (float scale_w : {0.0f, 2.0f}) {
  6768. test_cases.emplace_back(new test_topk_moe({8, 22, 1, 1}, 4, with_norm, bias_probs, gate, scale_w));
  6769. test_cases.emplace_back(new test_topk_moe({31, 22, 1, 1}, 8, with_norm, bias_probs, gate, scale_w));
  6770. test_cases.emplace_back(new test_topk_moe({32, 22, 1, 1}, 8, with_norm, bias_probs, gate, scale_w));
  6771. test_cases.emplace_back(new test_topk_moe({40, 22, 1, 1}, 8, with_norm, bias_probs, gate, scale_w));
  6772. test_cases.emplace_back(new test_topk_moe({71, 22, 1, 1}, 8, with_norm, bias_probs, gate, scale_w));
  6773. test_cases.emplace_back(new test_topk_moe({128, 1, 1, 1}, 128, with_norm, bias_probs, gate, scale_w));
  6774. test_cases.emplace_back(new test_topk_moe({129, 1, 1, 1}, 128, with_norm, bias_probs, gate, scale_w));
  6775. }
  6776. }
  6777. }
  6778. }
  6779. #if 0
  6780. // these tests are disabled to save execution time, sbut they can be handy for debugging
  6781. test_cases.emplace_back(new test_llama(2, true));
  6782. test_cases.emplace_back(new test_llama(1));
  6783. test_cases.emplace_back(new test_llama(2));
  6784. test_cases.emplace_back(new test_falcon(1));
  6785. test_cases.emplace_back(new test_falcon(2));
  6786. #endif
  6787. return test_cases;
  6788. }
  6789. #ifdef _MSC_VER
  6790. #pragma optimize("", on)
  6791. #endif
  6792. // Test cases for performance evaluation: should be representative of real-world use cases
  6793. static std::vector<std::unique_ptr<test_case>> make_test_cases_perf() {
  6794. std::vector<std::unique_ptr<test_case>> test_cases;
  6795. // Conv2d: K=CRS=NPQ=4096 matmul performance
  6796. uint32_t iwh_idx = 0;
  6797. uint32_t kwh_idx = 1;
  6798. uint32_t Cout_idx = 2;
  6799. uint32_t Cin_idx = 3;
  6800. uint32_t B_idx = 4;
  6801. std::vector<std::array<int, 5>> cases = {
  6802. //{IWH, KWH, Cout, Cin, B}
  6803. // K=CRS=NPQ=4096 conv2d matmul performance
  6804. {19, 4, 4096, 256, 16},
  6805. // K=128, CRS=128, NPQ=4096
  6806. { 19, 4, 128, 8, 16},
  6807. // K=130, CRS=128, NPQ=4096
  6808. { 19, 4, 130, 8, 16},
  6809. // Edge case: K x CRS is small
  6810. { 19, 2, 4, 4, 16},
  6811. // A ConvNet's first layer
  6812. { 224, 3, 8, 3, 1 },
  6813. // A ConvNet's first layer with 2x2 convolution, and 1 channel
  6814. { 224, 2, 8, 1, 1 },
  6815. // A ConvNet's first layer with 2x2 convolution, and 1 channel, several images in the batch
  6816. { 224, 2, 8, 1, 8 },
  6817. // A middle layer of a ConvNet
  6818. { 58, 3, 64, 32, 1 },
  6819. // A middle layer of a ConvNet, several images in the batch
  6820. { 58, 3, 64, 32, 8 },
  6821. // A deep layer of a ConvNet, several images in the batch
  6822. { 16, 3, 512, 128, 8 },
  6823. // High resolution output (large NPQ)
  6824. {1536, 3, 64, 32, 1 },
  6825. };
  6826. for (auto kernel_type : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  6827. for (auto act_case : cases) {
  6828. // Direct CONV_2D
  6829. test_cases.emplace_back(new test_conv_2d(
  6830. { act_case[iwh_idx], act_case[iwh_idx], act_case[Cin_idx], act_case[B_idx] },
  6831. { act_case[kwh_idx], act_case[kwh_idx], act_case[Cin_idx], act_case[Cout_idx] },
  6832. kernel_type, 1, 1, 0, 0, 1, 1, false));
  6833. }
  6834. }
  6835. test_cases.emplace_back(new test_bin_bcast(ggml_add, GGML_TYPE_F32, {4096, 1, 1, 1}, {1, 1, 1, 1}));
  6836. test_cases.emplace_back(new test_bin_bcast(ggml_add, GGML_TYPE_F32, {4096, 1, 1, 1}, {1, 512, 1, 1}));
  6837. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F16, {512, 3072, 1, 1}));
  6838. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F32, {8192, 512, 2, 1}, {0, 2, 1, 3}));
  6839. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F32, {3072, 512, 2, 1}, {0, 2, 1, 3}));
  6840. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_Q4_0, {8192, 512, 2, 1}));
  6841. test_cases.emplace_back(new test_cpy(GGML_TYPE_Q4_0, GGML_TYPE_F32, {8192, 512, 2, 1}));
  6842. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F32, {768*1024, 256, 1, 1}, {1, 0, 2, 3}, {0, 0, 0, 0}));
  6843. test_cases.emplace_back(new test_cpy(GGML_TYPE_F16, GGML_TYPE_F16, {768*1024, 256, 1, 1}, {1, 0, 2, 3}, {0, 0, 0, 0}));
  6844. test_cases.emplace_back(new test_cpy(GGML_TYPE_F16, GGML_TYPE_F16, {768, 1024, 256, 1}, {1, 0, 2, 3}, {0, 0, 0, 0}));
  6845. test_cases.emplace_back(new test_cpy(GGML_TYPE_BF16, GGML_TYPE_BF16, {768, 1024, 256, 1}, {1, 0, 2, 3}, {0, 0, 0, 0}));
  6846. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F32, {768*1024, 256, 1, 1}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6847. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F32, {768, 1024, 256, 1}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6848. test_cases.emplace_back(new test_cpy(GGML_TYPE_F16, GGML_TYPE_F16, {768*1024, 256, 1, 1}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6849. test_cases.emplace_back(new test_cpy(GGML_TYPE_F16, GGML_TYPE_F16, {768, 1024, 256, 1}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6850. test_cases.emplace_back(new test_cpy(GGML_TYPE_BF16, GGML_TYPE_BF16, {768, 1024, 256, 1}, {0, 0, 0, 0}, {0, 0, 0, 0}, true));
  6851. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {4096, 4096, 5, 1}, false, false, GGML_TYPE_F32, {1, 1}, 1.0f, 0.0f));
  6852. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {12888, 256, 5, 1}, false, false, GGML_TYPE_F32, {1, 1}, 1.0f, 0.0f));
  6853. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {77, 4096, 5, 1}, false, false, GGML_TYPE_F32, {1, 1}, 1.0f, 0.0f));
  6854. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {1024, 1024, 10, 1}, false, false, GGML_TYPE_F32, {1, 1}, 1.0f, 0.0f));
  6855. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {77, 1024, 10, 1}, false, false, GGML_TYPE_F32, {1, 1}, 1.0f, 0.0f));
  6856. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {256, 256, 20, 1}, false, false, GGML_TYPE_F32, {1, 1}, 1.0f, 0.0f));
  6857. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {64, 64, 20, 1}, false, false, GGML_TYPE_F32, {1, 1}, 1.0f, 0.0f));
  6858. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {77, 64, 20, 1}, false, false, GGML_TYPE_F32, {1, 1}, 1.0f, 0.0f));
  6859. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {32, 10, 1, 1}));
  6860. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {1024, 10, 1, 1}));
  6861. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {32000, 512, 1, 1}));
  6862. test_cases.emplace_back(new test_pad_reflect_1d(GGML_TYPE_F32, {512, 34, 2, 1}));
  6863. test_cases.emplace_back(new test_pad_reflect_1d(GGML_TYPE_F32, {3000, 80, 1, 1}));
  6864. test_cases.emplace_back(new test_pad_reflect_1d(GGML_TYPE_F32, {3000, 80, 4, 1}));
  6865. test_cases.emplace_back(new test_pad_reflect_1d(GGML_TYPE_F32, {3000, 384, 1, 1}));
  6866. test_cases.emplace_back(new test_pad_reflect_1d(GGML_TYPE_F32, {3000, 384, 4, 1}));
  6867. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 16416, 1, 128, {8, 1}, {4, 1}, {0, 2, 1, 3}));
  6868. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 128, 1, 16416, {8, 1}, {4, 1}, {0, 1, 2, 3}, 2*16416));
  6869. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 64, 64, 4, 4 }, { 32, 64, 4, 4 }));
  6870. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 128, 128, 4, 2 }, { 32, 128, 4, 2 }));
  6871. // qwen3next with CHUNK_SIZE 64
  6872. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 64, 64, 8, 32 }, { 64, 64, 8, 32 }));
  6873. // qwen3next with CHUNK_SIZE 128
  6874. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 128, 128, 4, 32 }, { 128, 128, 4, 32 }));
  6875. test_cases.emplace_back(new test_solve_tri(GGML_TYPE_F32, { 256, 256, 4, 2 }, { 128, 256, 4, 2 }));
  6876. test_cases.emplace_back(new test_tri(GGML_TRI_TYPE_LOWER, GGML_TYPE_F32, { 256, 256, 4, 4 }));
  6877. test_cases.emplace_back(new test_tri(GGML_TRI_TYPE_UPPER_DIAG, GGML_TYPE_F32, { 1024, 1024, 8, 4 }));
  6878. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 128, 128, 4, 4 }));
  6879. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 2048, 16, 5, 4 }));
  6880. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, { 20000, 10, 4, 1 }));
  6881. for (int bs : {1, 2, 3, 4, 5, 8, 512}) {
  6882. for (ggml_type type_a : all_types) {
  6883. for (ggml_type type_b : {GGML_TYPE_F32}) {
  6884. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 4096, bs, 14336, {1, 1}, {1, 1}));
  6885. }
  6886. }
  6887. }
  6888. // qwen3-30b-a3b
  6889. for (int bs : {1, 4, 8, 32, 64, 128, 256, 512}) {
  6890. for (ggml_type type_a : {GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_Q4_0, GGML_TYPE_Q8_0, GGML_TYPE_Q4_K, GGML_TYPE_Q6_K, GGML_TYPE_IQ2_XS}) {
  6891. for (ggml_type type_b : {GGML_TYPE_F32}) {
  6892. test_cases.emplace_back(new test_mul_mat_id(type_a, type_b, 128, 8, false, 768, bs, 2048));
  6893. test_cases.emplace_back(new test_mul_mat_id_fusion(type_a, type_b, 128, 8, false, 768, bs, 2048, 1));
  6894. }
  6895. }
  6896. }
  6897. for (int bs : {1, 4, 8, 32, 64, 128, 256, 512}) {
  6898. for (ggml_type type_a : {GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_Q4_0, GGML_TYPE_Q8_0, GGML_TYPE_Q4_K, GGML_TYPE_Q6_K, GGML_TYPE_IQ2_XS}) {
  6899. for (ggml_type type_b : {GGML_TYPE_F32}) {
  6900. test_cases.emplace_back(new test_mul_mat_id(type_a, type_b, 32, 4, false, 1792, bs, 2048));
  6901. test_cases.emplace_back(new test_mul_mat_id_fusion(type_a, type_b, 32, 4, false, 1792, bs, 2048, 1));
  6902. }
  6903. }
  6904. }
  6905. // gpt-oss-20b
  6906. for (int bs : {1, 4, 8, 512}) {
  6907. for (ggml_type type_a : {GGML_TYPE_MXFP4}) {
  6908. for (ggml_type type_b : {GGML_TYPE_F32}) {
  6909. test_cases.emplace_back(new test_mul_mat_id(type_a, type_b, 32, 4, false, 2880, bs, 2880));
  6910. test_cases.emplace_back(new test_mul_mat_id_fusion(type_a, type_b, 32, 4, false, 2880, bs, 2880, 1));
  6911. }
  6912. }
  6913. }
  6914. for (int K : {3, 5}) {
  6915. for (int IC : {256, 2560}) {
  6916. for (int IW_IH : {32, 64, 256}) {
  6917. if (IC == 2560 && IW_IH == 256) {
  6918. // too big
  6919. continue;
  6920. }
  6921. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F32, {IW_IH, IW_IH, IC, 1}, {K, K, IC, 1}, 1, 1, 1, 1, 1, 1, true));
  6922. }
  6923. }
  6924. }
  6925. // Qwen3-VL-8B https://github.com/ggml-org/llama.cpp/issues/17012
  6926. test_cases.emplace_back(new test_flash_attn_ext(72, 72, 16, {1, 1}, 5776, 5776, false, false, 0, 0, GGML_PREC_F32, GGML_TYPE_F16));
  6927. for (int kv : { 4096, 8192, 16384, }) {
  6928. for (int hs : { 64, 128, }) {
  6929. for (int nr : { 1, 4, }) {
  6930. test_cases.emplace_back(new test_flash_attn_ext(hs, hs, 8, {nr, 1}, kv, 1, true, false, 0, 0, GGML_PREC_F32, GGML_TYPE_F16));
  6931. }
  6932. }
  6933. }
  6934. for (int col : {8192, 16384, 32768, 65536, 131072, 262144, 524288}) {
  6935. for (int rows : {1, 4, 16}){
  6936. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {col, rows, 1, 1}, false, false, GGML_TYPE_F32, {1, 1}, 1.0f, 0.0f));
  6937. }
  6938. }
  6939. test_cases.emplace_back(new test_conv_2d_dw({512, 512, 256, 1}, {3, 3, 1, 256}, 1, 1, 1, false));
  6940. test_cases.emplace_back(new test_conv_2d_dw({512, 512, 256, 1}, {3, 3, 1, 256}, 1, 1, 1, true));
  6941. test_cases.emplace_back(new test_conv_transpose_2d({256, 256, 256, 1}, {3, 3, 16, 256}, 1));
  6942. test_cases.emplace_back(new test_conv_transpose_2d({16, 16, 16, 1}, {3, 3, 8, 16}, 1));
  6943. test_cases.emplace_back(new test_conv_transpose_2d({10, 10, 9, 1}, {3, 3, 1, 9}, 2));
  6944. test_cases.emplace_back(new test_mean(GGML_TYPE_F32, {256, 256, 3, 1}));
  6945. for (int n_token : {1, 512}) {
  6946. test_cases.emplace_back(new test_add_id(GGML_TYPE_F32, GGML_TYPE_F32, 2880, 128, 4, n_token));
  6947. test_cases.emplace_back(new test_add_id(GGML_TYPE_F32, GGML_TYPE_F32, 2880, 32, 4, n_token));
  6948. }
  6949. for (bool fw : {true, false}) { // fw == forward
  6950. for (ggml_type type : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  6951. for (bool ff : {false, true}) { // freq_factors
  6952. for (float v : { 0, 1 }) {
  6953. test_cases.emplace_back(new test_rope(type, {128, 32, 512, 1}, 128, GGML_ROPE_TYPE_NORMAL, 512, 1.0f, 0.0f, 1.0f, ff, v, fw)); // llama 7B
  6954. test_cases.emplace_back(new test_rope(type, {128, 64, 512, 1}, 128, GGML_ROPE_TYPE_NORMAL, 512, 1.0f, 0.0f, 1.0f, ff, v, fw)); // llama 65B
  6955. test_cases.emplace_back(new test_rope(type, { 80, 32, 512, 1}, 20, GGML_ROPE_TYPE_NEOX, 512, 1.0f, 0.0f, 1.0f, ff, v, fw)); // neox (stablelm)
  6956. test_cases.emplace_back(new test_rope(type, { 64, 8, 512, 1}, 64, GGML_ROPE_TYPE_NEOX, 512, 1.0f, 0.0f, 1.0f, ff, v, fw)); // neox (falcon 40B)
  6957. test_cases.emplace_back(new test_rope(type, {128, 12, 512, 1}, 128, GGML_ROPE_TYPE_MROPE, 512, 1.0f, 0.0f, 1.0f, ff, v, fw)); // rope_multi,m-rope (qwen2vl 2B)
  6958. test_cases.emplace_back(new test_rope(type, {128, 12, 2, 1}, 128, GGML_ROPE_TYPE_IMROPE, 512, 1.0f, 0.0f, 1.0f, ff, v, fw)); // rope_multi,imrope (qwen3vl 2B)
  6959. test_cases.emplace_back(new test_rope(type, { 80, 16, 2, 1}, 80, GGML_ROPE_TYPE_VISION, 512, 1.0f, 0.0f, 1.0f, ff, v, fw)); // rope_multi,m-rope (qwen2vl ViT)
  6960. }
  6961. }
  6962. }
  6963. }
  6964. std::vector<std::array<int64_t, 4>> reduce_rows_cases = {
  6965. { 8192, 1, 1, 1 },
  6966. { 8192, 8192, 1, 1 },
  6967. { 128, 8192, 1, 1 },
  6968. };
  6969. for (auto it: reduce_rows_cases){
  6970. test_cases.emplace_back(new test_mean(GGML_TYPE_F32, it));
  6971. test_cases.emplace_back(new test_sum_rows(GGML_TYPE_F32, it));
  6972. test_cases.emplace_back(new test_sum(GGML_TYPE_F32, it));
  6973. }
  6974. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {65000, 16, 1, 1}));
  6975. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {200000, 1, 1, 1}));
  6976. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {200000, 16, 1, 1}));
  6977. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {2, 1, 1, 1}, 1));
  6978. for (auto k : {1, 10, 40, 400}) {
  6979. for (auto nrows : {1, 16}) {
  6980. for (auto cols : {k, 1000, 65000, 200000}) {
  6981. test_cases.emplace_back(new test_top_k(GGML_TYPE_F32, {cols, nrows, 1, 1}, k));
  6982. }
  6983. }
  6984. }
  6985. for (auto nrows : {1, 4, 8, 16}) {
  6986. for (auto cols : {128, 1024, 4096, 8192, 16384, 32768, 65536, 131072, 200000, 2000000}) {
  6987. test_cases.emplace_back(new test_cumsum(GGML_TYPE_F32, {cols, nrows, 1, 1}));
  6988. }
  6989. }
  6990. // Examples from granite-4.0-h-1b/ggml-model-Q8_0.gguf
  6991. test_cases.emplace_back(new test_ssm_conv(GGML_TYPE_F32, {515, 3328, 1, 1}, {4, 3328, 1, 1})); // prefill
  6992. test_cases.emplace_back(new test_ssm_conv(GGML_TYPE_F32, {4, 3328, 1, 1}, {4, 3328, 1, 1})); // generate
  6993. test_cases.emplace_back(new test_ssm_scan(GGML_TYPE_F32, 128, 64, 48, 1, 512, 1)); // prefill
  6994. test_cases.emplace_back(new test_ssm_scan(GGML_TYPE_F32, 128, 64, 48, 1, 1, 1)); // generate
  6995. return test_cases;
  6996. }
  6997. static bool test_backend(ggml_backend_t backend, test_mode mode, const char * op_names_filter, const char * params_filter,
  6998. printer * output_printer) {
  6999. auto filter_test_cases = [](std::vector<std::unique_ptr<test_case>> & test_cases, const char * params_filter) {
  7000. if (params_filter == nullptr) {
  7001. return;
  7002. }
  7003. std::regex params_filter_regex(params_filter);
  7004. for (auto it = test_cases.begin(); it != test_cases.end();) {
  7005. if (!std::regex_search((*it)->vars(), params_filter_regex)) {
  7006. it = test_cases.erase(it);
  7007. continue;
  7008. }
  7009. it++;
  7010. }
  7011. };
  7012. if (mode == MODE_TEST) {
  7013. auto test_cases = make_test_cases_eval();
  7014. filter_test_cases(test_cases, params_filter);
  7015. ggml_backend_t backend_cpu = ggml_backend_init_by_type(GGML_BACKEND_DEVICE_TYPE_CPU, NULL);
  7016. if (backend_cpu == NULL) {
  7017. test_operation_info info("", "", "CPU");
  7018. info.set_error("backend", "Failed to initialize CPU backend");
  7019. output_printer->print_operation(info);
  7020. return false;
  7021. }
  7022. size_t n_ok = 0;
  7023. size_t tests_run = 0;
  7024. std::vector<std::string> failed_tests;
  7025. for (auto & test : test_cases) {
  7026. test_status_t status = test->eval(backend, backend_cpu, op_names_filter, output_printer);
  7027. if (status == test_status_t::SKIPPED || status == test_status_t::NOT_SUPPORTED) {
  7028. continue;
  7029. }
  7030. tests_run++;
  7031. if (status == test_status_t::OK) {
  7032. n_ok++;
  7033. } else if (status == test_status_t::FAIL) {
  7034. failed_tests.push_back(test->current_op_name + "(" + test->vars() + ")");
  7035. }
  7036. }
  7037. output_printer->print_summary(test_summary_info(n_ok, tests_run, false));
  7038. output_printer->print_failed_tests(failed_tests);
  7039. ggml_backend_free(backend_cpu);
  7040. return n_ok == tests_run;
  7041. }
  7042. if (mode == MODE_GRAD) {
  7043. auto test_cases = make_test_cases_eval();
  7044. filter_test_cases(test_cases, params_filter);
  7045. size_t n_ok = 0;
  7046. for (auto & test : test_cases) {
  7047. if (test->eval_grad(backend, op_names_filter, output_printer)) {
  7048. n_ok++;
  7049. }
  7050. }
  7051. output_printer->print_summary(test_summary_info(n_ok, test_cases.size(), false));
  7052. return n_ok == test_cases.size();
  7053. }
  7054. if (mode == MODE_PERF) {
  7055. auto test_cases = make_test_cases_perf();
  7056. filter_test_cases(test_cases, params_filter);
  7057. for (auto & test : test_cases) {
  7058. test->eval_perf(backend, op_names_filter, output_printer);
  7059. }
  7060. return true;
  7061. }
  7062. if (mode == MODE_SUPPORT) {
  7063. auto test_cases = make_test_cases_eval();
  7064. filter_test_cases(test_cases, params_filter);
  7065. // Filter out fusion cases
  7066. test_cases.erase(
  7067. std::remove_if(test_cases.begin(), test_cases.end(), [](const std::unique_ptr<test_case> & tc) {
  7068. return tc->run_whole_graph();
  7069. }),
  7070. test_cases.end()
  7071. );
  7072. for (auto & test : test_cases) {
  7073. test->eval_support(backend, op_names_filter, output_printer);
  7074. }
  7075. return true;
  7076. }
  7077. GGML_ABORT("fatal error");
  7078. }
  7079. static void list_all_ops() {
  7080. printf("GGML operations:\n");
  7081. std::set<std::string> all_ops;
  7082. for (int i = 1; i < GGML_OP_COUNT; i++) {
  7083. all_ops.insert(ggml_op_name((enum ggml_op)i));
  7084. }
  7085. for (int i = 0; i < GGML_UNARY_OP_COUNT; i++) {
  7086. all_ops.insert(ggml_unary_op_name((enum ggml_unary_op)i));
  7087. }
  7088. for (int i = 0; i < GGML_GLU_OP_COUNT; i++) {
  7089. all_ops.insert(ggml_glu_op_name((enum ggml_glu_op)i));
  7090. }
  7091. for (const auto & op : all_ops) {
  7092. printf(" %s\n", op.c_str());
  7093. }
  7094. printf("\nTotal: %zu operations\n", all_ops.size());
  7095. }
  7096. static void show_test_coverage() {
  7097. std::set<std::string> all_ops;
  7098. for (int i = 1; i < GGML_OP_COUNT; i++) {
  7099. auto op = (enum ggml_op)i;
  7100. if (op == GGML_OP_VIEW ||
  7101. op == GGML_OP_RESHAPE ||
  7102. op == GGML_OP_PERMUTE ||
  7103. op == GGML_OP_TRANSPOSE ||
  7104. op == GGML_OP_CONT ||
  7105. op == GGML_OP_GLU ||
  7106. op == GGML_OP_UNARY) {
  7107. continue;
  7108. }
  7109. all_ops.insert(ggml_op_name(op));
  7110. }
  7111. for (int i = 0; i < GGML_UNARY_OP_COUNT; i++) {
  7112. all_ops.insert(ggml_unary_op_name((enum ggml_unary_op)i));
  7113. }
  7114. for (int i = 0; i < GGML_GLU_OP_COUNT; i++) {
  7115. all_ops.insert(ggml_glu_op_name((enum ggml_glu_op)i));
  7116. }
  7117. auto test_cases = make_test_cases_eval();
  7118. // Filter out fusion cases
  7119. test_cases.erase(
  7120. std::remove_if(test_cases.begin(), test_cases.end(), [](const std::unique_ptr<test_case> & tc) {
  7121. return tc->run_whole_graph();
  7122. }),
  7123. test_cases.end()
  7124. );
  7125. std::set<std::string> tested_ops;
  7126. ggml_init_params params = {
  7127. /* .mem_size = */ ggml_tensor_overhead()*128 + ggml_graph_overhead(),
  7128. /* .mem_base = */ NULL,
  7129. /* .no_alloc = */ true,
  7130. };
  7131. for (auto & test_case : test_cases) {
  7132. ggml_context * ctx = ggml_init(params);
  7133. if (ctx) {
  7134. test_case->mode = MODE_TEST;
  7135. ggml_tensor * out = test_case->build_graph(ctx);
  7136. if (out && out->op != GGML_OP_NONE) {
  7137. if (out->op == GGML_OP_UNARY) {
  7138. tested_ops.insert(ggml_unary_op_name(ggml_get_unary_op(out)));
  7139. } else if (out->op == GGML_OP_GLU) {
  7140. tested_ops.insert(ggml_glu_op_name(ggml_get_glu_op(out)));
  7141. } else {
  7142. tested_ops.insert(ggml_op_name(out->op));
  7143. }
  7144. }
  7145. ggml_free(ctx);
  7146. }
  7147. }
  7148. std::set<std::string> covered_ops;
  7149. std::set<std::string> uncovered_ops;
  7150. for (const auto & op : all_ops) {
  7151. if (tested_ops.count(op) > 0) {
  7152. covered_ops.insert(op);
  7153. } else {
  7154. uncovered_ops.insert(op);
  7155. }
  7156. }
  7157. printf("Operations covered by tests (%zu):\n", covered_ops.size());
  7158. for (const auto & op : covered_ops) {
  7159. printf(" ✓ %s\n", op.c_str());
  7160. }
  7161. printf("\nOperations without tests (%zu):\n", uncovered_ops.size());
  7162. for (const auto & op : uncovered_ops) {
  7163. printf(" ✗ %s\n", op.c_str());
  7164. }
  7165. printf("\nCoverage Summary:\n");
  7166. printf(" Total operations: %zu\n", all_ops.size());
  7167. printf(" Tested operations: %zu\n", covered_ops.size());
  7168. printf(" Untested operations: %zu\n", uncovered_ops.size());
  7169. printf(" Coverage: %.1f%%\n", (double)covered_ops.size() / all_ops.size() * 100.0);
  7170. }
  7171. static void usage(char ** argv) {
  7172. printf("Usage: %s [mode] [-o <op,..>] [-b <backend>] [-p <params regex>] [--output <console|sql|csv>] [--list-ops] [--show-coverage]\n", argv[0]);
  7173. printf(" valid modes:\n");
  7174. printf(" - test (default, compare with CPU backend for correctness)\n");
  7175. printf(" - grad (compare gradients from backpropagation with method of finite differences)\n");
  7176. printf(" - perf (performance evaluation)\n");
  7177. printf(" - support (probe backend operation support)\n");
  7178. printf(" op names for -o are as given by ggml_op_desc() (e.g. ADD, MUL_MAT, etc),\n");
  7179. printf(" optionally including the full test case string (e.g. \"ADD(type=f16,ne=[1,1,8,1],nr=[1,1,1,1],nf=1)\")\n");
  7180. printf(" --output specifies output format (default: console, options: console, sql, csv)\n");
  7181. printf(" --list-ops lists all available GGML operations\n");
  7182. printf(" --show-coverage shows test coverage\n");
  7183. }
  7184. int main(int argc, char ** argv) {
  7185. test_mode mode = MODE_TEST;
  7186. output_formats output_format = CONSOLE;
  7187. const char * op_names_filter = nullptr;
  7188. const char * backend_filter = nullptr;
  7189. const char * params_filter = nullptr;
  7190. for (int i = 1; i < argc; i++) {
  7191. if (strcmp(argv[i], "test") == 0) {
  7192. mode = MODE_TEST;
  7193. } else if (strcmp(argv[i], "perf") == 0) {
  7194. mode = MODE_PERF;
  7195. } else if (strcmp(argv[i], "grad") == 0) {
  7196. mode = MODE_GRAD;
  7197. } else if (strcmp(argv[i], "support") == 0) {
  7198. mode = MODE_SUPPORT;
  7199. } else if (strcmp(argv[i], "-o") == 0) {
  7200. if (i + 1 < argc) {
  7201. op_names_filter = argv[++i];
  7202. } else {
  7203. usage(argv);
  7204. return 1;
  7205. }
  7206. } else if (strcmp(argv[i], "-b") == 0) {
  7207. if (i + 1 < argc) {
  7208. backend_filter = argv[++i];
  7209. } else {
  7210. usage(argv);
  7211. return 1;
  7212. }
  7213. } else if (strcmp(argv[i], "-p") == 0) {
  7214. if (i + 1 < argc) {
  7215. params_filter = argv[++i];
  7216. } else {
  7217. usage(argv);
  7218. return 1;
  7219. }
  7220. } else if (strcmp(argv[i], "--output") == 0) {
  7221. if (i + 1 < argc) {
  7222. if (!output_format_from_str(argv[++i], output_format)) {
  7223. usage(argv);
  7224. return 1;
  7225. }
  7226. } else {
  7227. usage(argv);
  7228. return 1;
  7229. }
  7230. } else if (strcmp(argv[i], "--list-ops") == 0) {
  7231. list_all_ops();
  7232. return 0;
  7233. } else if (strcmp(argv[i], "--show-coverage") == 0) {
  7234. show_test_coverage();
  7235. return 0;
  7236. } else {
  7237. usage(argv);
  7238. return 1;
  7239. }
  7240. }
  7241. // load and enumerate backends
  7242. ggml_backend_load_all();
  7243. // Create printer for output format
  7244. std::unique_ptr<printer> output_printer = create_printer(output_format);
  7245. if (output_printer) {
  7246. output_printer->print_header();
  7247. }
  7248. output_printer->print_testing_start(testing_start_info(ggml_backend_dev_count()));
  7249. size_t n_ok = 0;
  7250. for (size_t i = 0; i < ggml_backend_dev_count(); i++) {
  7251. ggml_backend_dev_t dev = ggml_backend_dev_get(i);
  7252. if (backend_filter != NULL && strcmp(backend_filter, ggml_backend_dev_name(dev)) != 0) {
  7253. output_printer->print_backend_init(
  7254. backend_init_info(i, ggml_backend_dev_count(), ggml_backend_dev_name(dev), true, "Skipping"));
  7255. n_ok++;
  7256. continue;
  7257. }
  7258. if (backend_filter == NULL && ggml_backend_dev_type(dev) == GGML_BACKEND_DEVICE_TYPE_CPU && mode != MODE_GRAD) {
  7259. output_printer->print_backend_init(backend_init_info(
  7260. i, ggml_backend_dev_count(), ggml_backend_dev_name(dev), true, "Skipping CPU backend"));
  7261. n_ok++;
  7262. continue;
  7263. }
  7264. ggml_backend_t backend = ggml_backend_dev_init(dev, NULL);
  7265. GGML_ASSERT(backend != NULL);
  7266. ggml_backend_reg_t reg = ggml_backend_dev_backend_reg(dev);
  7267. auto ggml_backend_set_n_threads_fn = (ggml_backend_set_n_threads_t) ggml_backend_reg_get_proc_address(reg, "ggml_backend_set_n_threads");
  7268. if (ggml_backend_set_n_threads_fn) {
  7269. // TODO: better value for n_threads
  7270. ggml_backend_set_n_threads_fn(backend, N_THREADS);
  7271. }
  7272. size_t free, total; // NOLINT
  7273. ggml_backend_dev_memory(dev, &free, &total);
  7274. output_printer->print_backend_init(backend_init_info(i, ggml_backend_dev_count(), ggml_backend_dev_name(dev),
  7275. false, "", ggml_backend_dev_description(dev),
  7276. total / 1024 / 1024, free / 1024 / 1024, true));
  7277. bool ok = test_backend(backend, mode, op_names_filter, params_filter, output_printer.get());
  7278. if (ok) {
  7279. n_ok++;
  7280. }
  7281. output_printer->print_backend_status(
  7282. backend_status_info(ggml_backend_name(backend), ok ? test_status_t::OK : test_status_t::FAIL));
  7283. ggml_backend_free(backend);
  7284. }
  7285. ggml_quantize_free();
  7286. if (output_printer) {
  7287. output_printer->print_footer();
  7288. }
  7289. output_printer->print_overall_summary(
  7290. overall_summary_info(n_ok, ggml_backend_dev_count(), n_ok == ggml_backend_dev_count()));
  7291. if (n_ok != ggml_backend_dev_count()) {
  7292. return 1;
  7293. }
  7294. return 0;
  7295. }