test-backend-ops.cpp 297 KB

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