test-backend-ops.cpp 275 KB

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