test-backend-ops.cpp 188 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120
  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 <cstdint>
  23. #include <cstdio>
  24. #include <cstdlib>
  25. #include <cstring>
  26. #include <future>
  27. #include <memory>
  28. #include <random>
  29. #include <regex>
  30. #include <string>
  31. #include <thread>
  32. #include <vector>
  33. static void init_tensor_uniform(ggml_tensor * tensor, float min = -1.0f, float max = 1.0f) {
  34. size_t nels = ggml_nelements(tensor);
  35. std::vector<float> data(nels);
  36. {
  37. // parallel initialization
  38. static const size_t n_threads = std::thread::hardware_concurrency();
  39. // static RNG initialization (revisit if n_threads stops being constant)
  40. static std::vector<std::default_random_engine> generators = []() {
  41. std::random_device rd;
  42. std::vector<std::default_random_engine> vec;
  43. vec.reserve(n_threads);
  44. //for (size_t i = 0; i < n_threads; i++) { vec.emplace_back(1234 + i); } // fixed seed
  45. for (size_t i = 0; i < n_threads; i++) { vec.emplace_back(rd()); }
  46. return vec;
  47. }();
  48. auto init_thread = [&](size_t ith, size_t start, size_t end) {
  49. std::uniform_real_distribution<float> distribution(min, max);
  50. auto & gen = generators[ith];
  51. for (size_t i = start; i < end; i++) {
  52. data[i] = distribution(gen);
  53. }
  54. };
  55. std::vector<std::future<void>> tasks;
  56. tasks.reserve(n_threads);
  57. for (size_t i = 0; i < n_threads; i++) {
  58. size_t start = i*nels/n_threads;
  59. size_t end = (i+1)*nels/n_threads;
  60. tasks.push_back(std::async(std::launch::async, init_thread, i, start, end));
  61. }
  62. for (auto & t : tasks) {
  63. t.get();
  64. }
  65. }
  66. if (tensor->type == GGML_TYPE_F32 || tensor->type == GGML_TYPE_I32) {
  67. ggml_backend_tensor_set(tensor, data.data(), 0, nels * sizeof(float));
  68. } else if (ggml_is_quantized(tensor->type) || tensor->type == GGML_TYPE_F16 || tensor->type == GGML_TYPE_BF16) {
  69. GGML_ASSERT(nels % ggml_blck_size(tensor->type) == 0);
  70. // dummy importance matrix
  71. std::vector<float> imatrix(tensor->ne[0], 1.0f);
  72. const float * im = imatrix.data();
  73. if (!ggml_quantize_requires_imatrix(tensor->type)) {
  74. // when the imatrix is optional, we want to test both quantization with and without imatrix
  75. // use one of the random numbers to decide
  76. if (data[0] > 0.5f*(min + max)) {
  77. im = nullptr;
  78. }
  79. }
  80. std::vector<uint8_t> dataq(ggml_row_size(tensor->type, nels));
  81. {
  82. // parallel quantization by block
  83. size_t blck_size = ggml_blck_size(tensor->type);
  84. size_t n_blocks = nels / blck_size;
  85. auto quantize_thread = [&](size_t start, size_t end) {
  86. ggml_quantize_chunk(tensor->type, data.data(), dataq.data(),
  87. start * blck_size, end - start, blck_size, im);
  88. };
  89. const size_t min_blocks_per_thread = 1;
  90. const size_t n_threads = std::min<size_t>(std::thread::hardware_concurrency()/2,
  91. std::max<size_t>(1, n_blocks / min_blocks_per_thread));
  92. std::vector<std::future<void>> tasks;
  93. tasks.reserve(n_threads);
  94. for (size_t i = 0; i < n_threads; i++) {
  95. size_t start = i*n_blocks/n_threads;
  96. size_t end = (i+1)*n_blocks/n_threads;
  97. tasks.push_back(std::async(std::launch::async, quantize_thread, start, end));
  98. }
  99. for (auto & t : tasks) {
  100. t.get();
  101. }
  102. }
  103. ggml_backend_tensor_set(tensor, dataq.data(), 0, dataq.size());
  104. } else if (tensor->type == GGML_TYPE_I8 || tensor->type == GGML_TYPE_I16 || tensor->type == GGML_TYPE_I32) {
  105. // This is going to create some weird integers though.
  106. ggml_backend_tensor_set(tensor, data.data(), 0, ggml_nbytes(tensor));
  107. } else if (tensor->type == GGML_TYPE_I64) {
  108. // Integers with a size of 8 bytes can be set by mirroring the float data, the specific values are again not really meaningful.
  109. const size_t nbytes_half = ggml_nbytes(tensor)/2;
  110. ggml_backend_tensor_set(tensor, data.data(), 0*nbytes_half, nbytes_half);
  111. ggml_backend_tensor_set(tensor, data.data(), 1*nbytes_half, nbytes_half);
  112. } else {
  113. GGML_ABORT("fatal error");
  114. }
  115. }
  116. static std::vector<float> tensor_to_float(const ggml_tensor * t) {
  117. std::vector<float> tv;
  118. tv.reserve(ggml_nelements(t));
  119. std::vector<uint8_t> buf(ggml_nbytes(t));
  120. ggml_backend_tensor_get(t, buf.data(), 0, ggml_nbytes(t));
  121. const auto * tt = ggml_get_type_traits(t->type);
  122. size_t bs = ggml_blck_size(t->type);
  123. std::vector<float> vq(ggml_blck_size(t->type));
  124. bool quantized = ggml_is_quantized(t->type);
  125. // access elements by index to avoid gaps in views
  126. for (int64_t i3 = 0; i3 < t->ne[3]; i3++) {
  127. for (int64_t i2 = 0; i2 < t->ne[2]; i2++) {
  128. for (int64_t i1 = 0; i1 < t->ne[1]; i1++) {
  129. for (int64_t i0 = 0; i0 < t->ne[0]; i0 += bs) {
  130. size_t i = i3*t->nb[3] + i2*t->nb[2] + i1*t->nb[1] + i0/bs*t->nb[0];
  131. if (t->type == GGML_TYPE_F16) {
  132. tv.push_back(ggml_fp16_to_fp32(*(ggml_fp16_t*)&buf[i]));
  133. } else if (t->type == GGML_TYPE_BF16) {
  134. tv.push_back(ggml_bf16_to_fp32(*(ggml_bf16_t*)&buf[i]));
  135. } else if (t->type == GGML_TYPE_F32) {
  136. tv.push_back(*(float *) &buf[i]);
  137. } else if (t->type == GGML_TYPE_I64) {
  138. tv.push_back((float)*(int64_t *) &buf[i]);
  139. } else if (t->type == GGML_TYPE_I32) {
  140. tv.push_back((float)*(int32_t *) &buf[i]);
  141. } else if (t->type == GGML_TYPE_I16) {
  142. tv.push_back((float)*(int16_t *) &buf[i]);
  143. } else if (t->type == GGML_TYPE_I8) {
  144. tv.push_back((float)*(int8_t *) &buf[i]);
  145. } else if (quantized) {
  146. tt->to_float(&buf[i], vq.data(), bs);
  147. tv.insert(tv.end(), vq.begin(), vq.end());
  148. } else {
  149. GGML_ABORT("fatal error");
  150. }
  151. }
  152. }
  153. }
  154. }
  155. return tv;
  156. }
  157. // normalized mean squared error = mse(a, b) / mse(a, 0)
  158. static double nmse(const float * a, const float * b, size_t n) {
  159. double mse_a_b = 0.0;
  160. double mse_a_0 = 0.0;
  161. for (size_t i = 0; i < n; i++) {
  162. float a_i = a[i];
  163. float b_i = b[i];
  164. mse_a_b += (a_i - b_i) * (a_i - b_i);
  165. mse_a_0 += a_i * a_i;
  166. }
  167. return mse_a_b / mse_a_0;
  168. }
  169. // maximum absolute asymmetry between a and b
  170. // asymmetry: (a - b) / (a + b)
  171. // This is more stable than relative error if one of the values fluctuates towards zero.
  172. // n: number of values to compare.
  173. // expected_vals: optional vector of expected values for a. If expected_vals is not empty, filter out all comparisons where
  174. // a does not match any of the expected values. Needed for noncontinuous gradients where the numerical calculation can fail.
  175. static double mean_abs_asymm(const float * a, const float * b, const size_t n, const std::vector<float> & expected_vals) {
  176. double sum = 0.0f;
  177. size_t nvalid = 0;
  178. for (size_t i = 0; i < n; i++) {
  179. if (!expected_vals.empty()) {
  180. bool matches_any = false;
  181. for (const float & ev : expected_vals) {
  182. if (fabsf(a[i] - ev) < 1e-3f) {
  183. matches_any = true;
  184. break;
  185. }
  186. }
  187. if (!matches_any) {
  188. continue;
  189. }
  190. }
  191. const float asymm = (a[i] - b[i]) / (a[i] + b[i]);
  192. sum += fabsf(asymm);
  193. nvalid++;
  194. }
  195. return sum/nvalid;
  196. }
  197. // utils for printing the variables of the test cases
  198. template<typename T>
  199. static std::string var_to_str(const T & x) {
  200. return std::to_string(x);
  201. }
  202. template<typename T, size_t N>
  203. static std::string var_to_str(const T (&x)[N]) {
  204. std::string s = "[";
  205. for (size_t i = 0; i < N; i++) {
  206. if (i > 0) {
  207. s += ",";
  208. }
  209. s += var_to_str(x[i]);
  210. }
  211. s += "]";
  212. return s;
  213. }
  214. template<typename T, size_t N>
  215. static std::string var_to_str(const std::array<T, N> & x) {
  216. std::string s = "[";
  217. for (size_t i = 0; i < N; i++) {
  218. if (i > 0) {
  219. s += ",";
  220. }
  221. s += var_to_str(x[i]);
  222. }
  223. s += "]";
  224. return s;
  225. }
  226. static std::string var_to_str(ggml_type type) {
  227. return ggml_type_name(type);
  228. }
  229. static std::string var_to_str(ggml_prec prec) {
  230. return prec == GGML_PREC_F32 ? "f32" : "def";
  231. }
  232. static std::string var_to_str(ggml_op_pool pool) {
  233. switch (pool) {
  234. case GGML_OP_POOL_AVG: return "avg";
  235. case GGML_OP_POOL_MAX: return "max";
  236. default: return std::to_string(pool);
  237. }
  238. }
  239. static std::string var_to_str(ggml_scale_mode mode) {
  240. switch (mode) {
  241. case GGML_SCALE_MODE_NEAREST: return "nearest";
  242. case GGML_SCALE_MODE_BILINEAR: return "bilinear";
  243. default: return std::to_string(mode);
  244. }
  245. }
  246. #define VAR_TO_STR(x) (#x "=" + var_to_str(x))
  247. #define VARS_TO_STR1(a) VAR_TO_STR(a)
  248. #define VARS_TO_STR2(a, b) VAR_TO_STR(a) + "," + VAR_TO_STR(b)
  249. #define VARS_TO_STR3(a, b, c) VAR_TO_STR(a) + "," + VARS_TO_STR2(b, c)
  250. #define VARS_TO_STR4(a, b, c, d) VAR_TO_STR(a) + "," + VARS_TO_STR3(b, c, d)
  251. #define VARS_TO_STR5(a, b, c, d, e) VAR_TO_STR(a) + "," + VARS_TO_STR4(b, c, d, e)
  252. #define VARS_TO_STR6(a, b, c, d, e, f) VAR_TO_STR(a) + "," + VARS_TO_STR5(b, c, d, e, f)
  253. #define VARS_TO_STR7(a, b, c, d, e, f, g) VAR_TO_STR(a) + "," + VARS_TO_STR6(b, c, d, e, f, g)
  254. #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)
  255. #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)
  256. #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)
  257. #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)
  258. #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)
  259. #ifdef GGML_USE_SYCL
  260. static bool inline _isinf(float f) {
  261. return (*(uint32_t *)&f & 0x7fffffff) == 0x7f800000;
  262. }
  263. #else
  264. static bool inline _isinf(float f) { return std::isinf(f); }
  265. #endif
  266. // accept FLT_MAX as infinity
  267. static bool isinf_or_max(float f) {
  268. return _isinf(f) || f == FLT_MAX || f == -FLT_MAX;
  269. }
  270. static bool ggml_is_view_op(enum ggml_op op) {
  271. return op == GGML_OP_VIEW || op == GGML_OP_RESHAPE || op == GGML_OP_PERMUTE || op == GGML_OP_TRANSPOSE;
  272. }
  273. enum test_mode {
  274. MODE_TEST,
  275. MODE_PERF,
  276. MODE_GRAD,
  277. };
  278. struct test_case {
  279. virtual ~test_case() {}
  280. virtual std::string op_desc(ggml_tensor * t) {
  281. return ggml_op_desc(t);
  282. }
  283. virtual std::string vars() {
  284. return "";
  285. }
  286. virtual ggml_tensor * build_graph(ggml_context * ctx) = 0;
  287. virtual double max_nmse_err() {
  288. return 1e-7;
  289. }
  290. virtual double max_maa_err() {
  291. return 1e-4;
  292. }
  293. virtual float grad_eps() {
  294. return 1e-1f;
  295. }
  296. // If false, estimate gradient with 2 points, neglects 3rd order derivative and higher.
  297. // If true, estimate gradient with 4 points, neglects 5th order derivative and higher.
  298. virtual bool grad_precise() {
  299. return false;
  300. }
  301. // Skip gradient checks if total number of gradients to be checked is larger than this (to speed up the tests).
  302. virtual int64_t grad_nmax() {
  303. return 10000;
  304. }
  305. // No effect if empty.
  306. // If not empty, skip all gradient checks where the numerical result does not match any of the values.
  307. // Needed for dealing with noncontinuous gradients (e.g. ReLU) where estimation using finite differences is unreliable.
  308. virtual std::vector<float> grad_expect() {
  309. return {};
  310. }
  311. virtual void initialize_tensors(ggml_context * ctx) {
  312. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != nullptr; t = ggml_get_next_tensor(ctx, t)) {
  313. init_tensor_uniform(t);
  314. }
  315. }
  316. virtual size_t op_size(ggml_tensor * t) {
  317. size_t size = ggml_nbytes(t);
  318. // add source tensors
  319. for (int i = 0; i < GGML_MAX_SRC; i++) {
  320. if (t->src[i] != NULL) {
  321. size += ggml_nbytes(t->src[i]);
  322. }
  323. }
  324. return size;
  325. }
  326. virtual uint64_t op_flops(ggml_tensor * t) {
  327. GGML_UNUSED(t);
  328. return 0;
  329. }
  330. virtual bool run_whole_graph() { return false; }
  331. ggml_cgraph * gf = nullptr;
  332. ggml_cgraph * gb = nullptr;
  333. static const int sentinel_size = 1024;
  334. test_mode mode;
  335. std::vector<ggml_tensor *> sentinels;
  336. void add_sentinel(ggml_context * ctx) {
  337. if (mode == MODE_PERF || mode == MODE_GRAD) {
  338. return;
  339. }
  340. ggml_tensor * sentinel = ::ggml_new_tensor_1d(ctx, GGML_TYPE_F32, sentinel_size);
  341. ggml_format_name(sentinel, "sent_%zu", sentinels.size());
  342. sentinels.push_back(sentinel);
  343. }
  344. // hijack ggml_new_tensor to add sentinels after each tensor to check for overflows in the backend
  345. ggml_tensor * ggml_new_tensor(ggml_context * ctx, ggml_type type, int n_dims, const int64_t * ne) {
  346. ggml_tensor * t = ::ggml_new_tensor(ctx, type, n_dims, ne);
  347. add_sentinel(ctx);
  348. return t;
  349. }
  350. ggml_tensor * ggml_new_tensor_1d(ggml_context * ctx, ggml_type type, int64_t ne0) {
  351. ggml_tensor * t = ::ggml_new_tensor_1d(ctx, type, ne0);
  352. add_sentinel(ctx);
  353. return t;
  354. }
  355. ggml_tensor * ggml_new_tensor_2d(ggml_context * ctx, ggml_type type, int64_t ne0, int64_t ne1) {
  356. ggml_tensor * t = ::ggml_new_tensor_2d(ctx, type, ne0, ne1);
  357. add_sentinel(ctx);
  358. return t;
  359. }
  360. ggml_tensor * ggml_new_tensor_3d(ggml_context * ctx, ggml_type type, int64_t ne0, int64_t ne1, int64_t ne2) {
  361. ggml_tensor * t = ::ggml_new_tensor_3d(ctx, type, ne0, ne1, ne2);
  362. add_sentinel(ctx);
  363. return t;
  364. }
  365. ggml_tensor * ggml_new_tensor_4d(ggml_context * ctx, ggml_type type, int64_t ne0, int64_t ne1, int64_t ne2, int64_t ne3) {
  366. ggml_tensor * t = ::ggml_new_tensor_4d(ctx, type, ne0, ne1, ne2, ne3);
  367. add_sentinel(ctx);
  368. return t;
  369. }
  370. bool eval(ggml_backend_t backend1, ggml_backend_t backend2, const char * op_name) {
  371. mode = MODE_TEST;
  372. ggml_init_params params = {
  373. /* .mem_size = */ ggml_tensor_overhead()*128 + ggml_graph_overhead(),
  374. /* .mem_base = */ NULL,
  375. /* .no_alloc = */ true,
  376. };
  377. ggml_context * ctx = ggml_init(params);
  378. GGML_ASSERT(ctx);
  379. gf = ggml_new_graph(ctx);
  380. // pre-graph sentinel
  381. add_sentinel(ctx);
  382. ggml_tensor * out = build_graph(ctx);
  383. if (op_name != nullptr && op_desc(out) != op_name) {
  384. //printf(" %s: skipping\n", op_desc(out).c_str());
  385. ggml_free(ctx);
  386. return true;
  387. }
  388. printf(" %s(%s): ", op_desc(out).c_str(), vars().c_str());
  389. fflush(stdout);
  390. // check if the backends support the ops
  391. bool supported = true;
  392. for (ggml_backend_t backend : {backend1, backend2}) {
  393. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  394. if (!ggml_backend_supports_op(backend, t)) {
  395. printf("not supported [%s] ", ggml_backend_name(backend));
  396. supported = false;
  397. break;
  398. }
  399. }
  400. }
  401. if (!supported) {
  402. printf("\n");
  403. ggml_free(ctx);
  404. return true;
  405. }
  406. // post-graph sentinel
  407. add_sentinel(ctx);
  408. // allocate
  409. ggml_backend_buffer_t buf = ggml_backend_alloc_ctx_tensors(ctx, backend1);
  410. if (buf == NULL) {
  411. printf("failed to allocate tensors [%s] ", ggml_backend_name(backend1));
  412. ggml_free(ctx);
  413. return false;
  414. }
  415. // build graph
  416. ggml_build_forward_expand(gf, out);
  417. // add sentinels as graph nodes so that they are checked in the callback
  418. for (ggml_tensor * sentinel : sentinels) {
  419. ggml_graph_add_node(gf, sentinel);
  420. }
  421. // randomize tensors
  422. initialize_tensors(ctx);
  423. // compare
  424. struct callback_userdata {
  425. bool ok;
  426. double max_err;
  427. ggml_backend_t backend1;
  428. ggml_backend_t backend2;
  429. };
  430. callback_userdata ud {
  431. true,
  432. max_nmse_err(),
  433. backend1,
  434. backend2
  435. };
  436. auto callback = [](int index, ggml_tensor * t1, ggml_tensor * t2, void * user_data) -> bool {
  437. callback_userdata * ud = (callback_userdata *) user_data;
  438. const char * bn1 = ggml_backend_name(ud->backend1);
  439. const char * bn2 = ggml_backend_name(ud->backend2);
  440. if (t1->op == GGML_OP_NONE) {
  441. // sentinels must be unchanged
  442. std::vector<uint8_t> t1_data(ggml_nbytes(t1));
  443. std::vector<uint8_t> t2_data(ggml_nbytes(t2));
  444. ggml_backend_tensor_get(t1, t1_data.data(), 0, ggml_nbytes(t1));
  445. ggml_backend_tensor_get(t2, t2_data.data(), 0, ggml_nbytes(t2));
  446. if (memcmp(t1_data.data(), t2_data.data(), ggml_nbytes(t1)) != 0) {
  447. printf("sentinel mismatch: %s ", t1->name);
  448. ud->ok = false;
  449. return true;
  450. }
  451. }
  452. std::vector<float> f1 = tensor_to_float(t1);
  453. std::vector<float> f2 = tensor_to_float(t2);
  454. for (size_t i = 0; i < f1.size(); i++) {
  455. // check for nans
  456. if (std::isnan(f1[i]) || std::isnan(f2[i])) {
  457. printf("[%s] NaN at index %zu (%s=%f %s=%f) ", ggml_op_desc(t1), i, bn1, f1[i], bn2, f2[i]);
  458. ud->ok = false;
  459. return true;
  460. }
  461. // check for infs: both must be inf of the same sign, or both must be finite
  462. if (isinf_or_max(f1[i]) || isinf_or_max(f2[i])) {
  463. if (isinf_or_max(f1[i]) && isinf_or_max(f2[i])) {
  464. if (std::signbit(f1[i]) != std::signbit(f2[i])) {
  465. printf("[%s] inf sign mismatch: %s=%f %s=%f ", ggml_op_desc(t1), bn1, f1[i], bn2, f2[i]);
  466. ud->ok = false;
  467. return true;
  468. }
  469. } else {
  470. printf("[%s] inf mismatch: %s=%f %s=%f ", ggml_op_desc(t1), bn1, f1[i], bn2, f2[i]);
  471. ud->ok = false;
  472. return true;
  473. }
  474. }
  475. }
  476. double err = nmse(f1.data(), f2.data(), f1.size());
  477. if (err > ud->max_err) {
  478. printf("[%s] NMSE = %.9f > %.9f ", ggml_op_desc(t1), err, ud->max_err);
  479. //for (int i = 0; i < (int) f1.size(); i++) {
  480. // printf("%5d %9.6f %9.6f, diff = %9.6f\n", i, f1[i], f2[i], f1[i] - f2[i]);
  481. //}
  482. //printf("\n");
  483. //exit(1);
  484. ud->ok = false;
  485. }
  486. return true;
  487. GGML_UNUSED(index);
  488. };
  489. const bool cmp_ok = ggml_backend_compare_graph_backend(backend1, backend2, gf, callback, &ud, run_whole_graph() ? out : nullptr);
  490. if (!cmp_ok) {
  491. printf("compare failed ");
  492. }
  493. ggml_backend_buffer_free(buf);
  494. ggml_free(ctx);
  495. if (ud.ok && cmp_ok) {
  496. printf("\033[1;32mOK\033[0m\n");
  497. return true;
  498. }
  499. printf("\033[1;31mFAIL\033[0m\n");
  500. return false;
  501. }
  502. bool eval_perf(ggml_backend_t backend, const char * op_name) {
  503. mode = MODE_PERF;
  504. static const size_t graph_nodes = 8192;
  505. ggml_init_params params = {
  506. /* .mem_size = */ ggml_tensor_overhead()*128 + ggml_graph_overhead_custom(graph_nodes, false),
  507. /* .mem_base = */ NULL,
  508. /* .no_alloc = */ true,
  509. };
  510. ggml_context_ptr ctx(ggml_init(params)); // smart ptr
  511. GGML_ASSERT(ctx);
  512. ggml_tensor * out = build_graph(ctx.get());
  513. if (op_name != nullptr && op_desc(out) != op_name) {
  514. //printf(" %s: skipping\n", op_desc(out).c_str());
  515. return true;
  516. }
  517. int len = printf(" %s(%s): ", op_desc(out).c_str(), vars().c_str());
  518. fflush(stdout);
  519. // check if backends support op
  520. if (!ggml_backend_supports_op(backend, out)) {
  521. printf("not supported\n");
  522. return true;
  523. }
  524. // align while also leaving some margin for variations in parameters
  525. int align = 8;
  526. int last = (len + align - 1) / align * align;
  527. if (last - len < 5) {
  528. last += align;
  529. }
  530. printf("%*s", last - len, "");
  531. // allocate
  532. ggml_backend_buffer_ptr buf(ggml_backend_alloc_ctx_tensors(ctx.get(), backend)); // smart ptr
  533. if (buf == NULL) {
  534. printf("failed to allocate tensors\n");
  535. return false;
  536. }
  537. // randomize tensors
  538. initialize_tensors(ctx.get());
  539. // build graph
  540. ggml_cgraph * gf = ggml_new_graph_custom(ctx.get(), graph_nodes, false);
  541. ggml_build_forward_expand(gf, out);
  542. // warmup run
  543. ggml_status status = ggml_backend_graph_compute(backend, gf);
  544. if (status != GGML_STATUS_SUCCESS) {
  545. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  546. return false;
  547. }
  548. // determine number of runs
  549. int n_runs;
  550. bool is_cpu = ggml_backend_dev_type(ggml_backend_get_device(backend)) == GGML_BACKEND_DEVICE_TYPE_CPU;
  551. if (op_flops(out) > 0) {
  552. // based on flops
  553. const uint64_t GFLOP = 1000 * 1000 * 1000;
  554. const uint64_t target_flops_cpu = 8ULL * GFLOP;
  555. const uint64_t target_flops_gpu = 100ULL * GFLOP;
  556. uint64_t target_flops = is_cpu ? target_flops_cpu : target_flops_gpu;
  557. n_runs = std::min<int>(ggml_graph_size(gf) - ggml_graph_n_nodes(gf), target_flops / op_flops(out)) + 1;
  558. } else {
  559. // based on memory size
  560. const size_t GB = 1ULL << 30;
  561. const size_t target_size_cpu = 8 * GB;
  562. const size_t target_size_gpu = 32 * GB;
  563. size_t target_size = is_cpu ? target_size_cpu : target_size_gpu;
  564. n_runs = std::min<int>(ggml_graph_size(gf) - ggml_graph_n_nodes(gf), target_size / op_size(out)) + 1;
  565. }
  566. // duplicate the op
  567. for (int i = 1; i < n_runs; i++) {
  568. ggml_graph_add_node(gf, out);
  569. }
  570. // calculate memory
  571. size_t mem = n_runs * op_size(out);
  572. auto tensor_op_size = [](ggml_tensor * t) {
  573. size_t size = ggml_nbytes(t);
  574. // add source tensors
  575. for (int i = 0; i < GGML_MAX_SRC; i++) {
  576. if (t->src[i] != NULL) {
  577. size += ggml_nbytes(t->src[i]);
  578. }
  579. }
  580. return size;
  581. };
  582. for (int i = 0; i < ggml_graph_n_nodes(gf); ++i) {
  583. if (ggml_is_view_op(ggml_graph_node(gf, i)->op) || ggml_graph_node(gf, i) == out) {
  584. continue;
  585. }
  586. mem += tensor_op_size(ggml_graph_node(gf, i));
  587. }
  588. // run
  589. int64_t total_time_us = 0;
  590. int64_t total_mem = 0;
  591. int total_runs = 0;
  592. do {
  593. int64_t start_time = ggml_time_us();
  594. ggml_status status = ggml_backend_graph_compute(backend, gf);
  595. if (status != GGML_STATUS_SUCCESS) {
  596. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  597. return false;
  598. }
  599. int64_t end_time = ggml_time_us();
  600. total_time_us += end_time - start_time;
  601. total_mem += mem;
  602. total_runs += n_runs;
  603. } while (total_time_us < 1000*1000); // run for at least 1 second
  604. printf(" %8d runs - %8.2f us/run - ",
  605. total_runs,
  606. (double)total_time_us / total_runs);
  607. if (op_flops(out) > 0) {
  608. double flops_per_sec = (op_flops(out) * total_runs) / (total_time_us / 1e6);
  609. auto format_flops = [](double flops) -> std::string {
  610. char buf[256];
  611. if (flops >= 1e12) {
  612. snprintf(buf, sizeof(buf), "%6.2f TFLOP", flops / 1e12);
  613. } else if (flops >= 1e9) {
  614. snprintf(buf, sizeof(buf), "%6.2f GFLOP", flops / 1e9);
  615. } else if (flops >= 1e6) {
  616. snprintf(buf, sizeof(buf), "%6.2f MFLOP", flops / 1e6);
  617. } else {
  618. snprintf(buf, sizeof(buf), "%6.2f KFLOP", flops / 1e3);
  619. }
  620. return buf;
  621. };
  622. printf("%s/run - \033[1;34m%sS\033[0m",
  623. format_flops(op_flops(out)).c_str(),
  624. format_flops(flops_per_sec).c_str());
  625. } else {
  626. printf("%8zu kB/run - \033[1;34m%7.2f GB/s\033[0m",
  627. op_size(out) / 1024,
  628. total_mem / (total_time_us / 1e6) / 1024.0 / 1024.0 / 1024.0);
  629. }
  630. printf("\n");
  631. return true;
  632. }
  633. bool eval_grad(ggml_backend_t backend, const char * op_name) {
  634. mode = MODE_GRAD;
  635. const std::vector<float> expect = grad_expect();
  636. ggml_init_params params = {
  637. /* .mem_size = */ ggml_tensor_overhead()*128 + 2*ggml_graph_overhead_custom(GGML_DEFAULT_GRAPH_SIZE, true),
  638. /* .mem_base = */ NULL,
  639. /* .no_alloc = */ true,
  640. };
  641. ggml_context_ptr ctx(ggml_init(params)); // smart ptr
  642. GGML_ASSERT(ctx);
  643. gf = ggml_new_graph_custom(ctx.get(), GGML_DEFAULT_GRAPH_SIZE, true);
  644. gb = ggml_new_graph_custom(ctx.get(), GGML_DEFAULT_GRAPH_SIZE, true);
  645. ggml_tensor * out = build_graph(ctx.get());
  646. if ((op_name != nullptr && op_desc(out) != op_name) || out->op == GGML_OP_OPT_STEP_ADAMW) {
  647. //printf(" %s: skipping\n", op_desc(out).c_str());
  648. return true;
  649. }
  650. printf(" %s(%s): ", op_desc(out).c_str(), vars().c_str());
  651. fflush(stdout);
  652. if (out->type != GGML_TYPE_F32) {
  653. printf("not supported [%s->type != FP32]\n", out->name);
  654. return true;
  655. }
  656. // check if the backend supports the ops
  657. bool supported = true;
  658. bool any_params = false;
  659. for (ggml_tensor * t = ggml_get_first_tensor(ctx.get()); t != NULL; t = ggml_get_next_tensor(ctx.get(), t)) {
  660. if (!ggml_backend_supports_op(backend, t)) {
  661. printf("not supported [%s] ", ggml_backend_name(backend));
  662. supported = false;
  663. break;
  664. }
  665. if ((t->flags & GGML_TENSOR_FLAG_PARAM)) {
  666. any_params = true;
  667. if (t->type != GGML_TYPE_F32) {
  668. printf("not supported [%s->type != FP32] ", t->name);
  669. supported = false;
  670. break;
  671. }
  672. }
  673. }
  674. if (!any_params) {
  675. printf("not supported [%s] \n", op_desc(out).c_str());
  676. supported = false;
  677. }
  678. if (!supported) {
  679. printf("\n");
  680. return true;
  681. }
  682. int64_t ngrads = 0;
  683. for (ggml_tensor * t = ggml_get_first_tensor(ctx.get()); t != NULL; t = ggml_get_next_tensor(ctx.get(), t)) {
  684. if (t->flags & GGML_TENSOR_FLAG_PARAM) {
  685. ngrads += ggml_nelements(t);
  686. }
  687. }
  688. if (ngrads > grad_nmax()) {
  689. printf("skipping large tensors for speed \n");
  690. return true;
  691. }
  692. if (!ggml_is_scalar(out)) {
  693. out = ggml_sum(ctx.get(), out);
  694. ggml_set_name(out, "sum_of_out");
  695. }
  696. ggml_set_loss(out);
  697. ggml_build_forward_expand(gf, out);
  698. ggml_graph_cpy(gf, gb);
  699. ggml_build_backward_expand(ctx.get(), gb, nullptr);
  700. if (expect.size() != 1 || expect[0] != 0.0f) {
  701. GGML_ASSERT(ggml_graph_n_nodes(gb) > ggml_graph_n_nodes(gf));
  702. for (ggml_tensor * t = ggml_get_first_tensor(ctx.get()); t != NULL; t = ggml_get_next_tensor(ctx.get(), t)) {
  703. GGML_ASSERT(!(t->flags & GGML_TENSOR_FLAG_PARAM) || ggml_graph_get_grad(gb, t)->op != GGML_OP_NONE);
  704. }
  705. }
  706. for (ggml_tensor * t = ggml_get_first_tensor(ctx.get()); t != NULL; t = ggml_get_next_tensor(ctx.get(), t)) {
  707. if (!ggml_backend_supports_op(backend, t)) {
  708. printf("not supported [%s] ", ggml_backend_name(backend));
  709. supported = false;
  710. break;
  711. }
  712. if ((t->flags & GGML_TENSOR_FLAG_PARAM) && t->type != GGML_TYPE_F32) {
  713. printf("not supported [%s->type != FP32] ", t->name);
  714. supported = false;
  715. break;
  716. }
  717. }
  718. if (!supported) {
  719. printf("\n");
  720. return true;
  721. }
  722. // allocate
  723. ggml_backend_buffer_ptr buf(ggml_backend_alloc_ctx_tensors(ctx.get(), backend)); // smart ptr
  724. if (buf == NULL) {
  725. printf("failed to allocate tensors [%s] ", ggml_backend_name(backend));
  726. return false;
  727. }
  728. initialize_tensors(ctx.get()); // Randomizes all tensors (including gradients).
  729. ggml_graph_reset(gb); // Sets gradients to 1 if loss, 0 otherwise.
  730. ggml_status status = ggml_backend_graph_compute(backend, gf);
  731. if (status != GGML_STATUS_SUCCESS) {
  732. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  733. return false;
  734. }
  735. status = ggml_backend_graph_compute(backend, gb);
  736. if (status != GGML_STATUS_SUCCESS) {
  737. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  738. return false;
  739. }
  740. bool ok = true;
  741. for (struct ggml_tensor * t = ggml_get_first_tensor(ctx.get()); t != nullptr; t = ggml_get_next_tensor(ctx.get(), t)) {
  742. if (!(t->flags & GGML_TENSOR_FLAG_PARAM)) {
  743. continue;
  744. }
  745. const char * bn = ggml_backend_name(backend);
  746. const int64_t ne = ggml_nelements(t);
  747. std::vector<float> ga;
  748. struct ggml_tensor * grad = ggml_graph_get_grad(gb, t);
  749. if (grad) {
  750. ga = tensor_to_float(grad);
  751. } else {
  752. ga.resize(ne); // default value is 0.0f
  753. }
  754. for (int64_t i = 0; i < ne; ++i) { // gradient algebraic
  755. // check for nans
  756. if (!std::isfinite(ga[i])) {
  757. printf("[%s] nonfinite gradient at index %" PRId64 " (%s=%f) ", ggml_op_desc(t), i, bn, ga[i]);
  758. ok = false;
  759. break;
  760. }
  761. }
  762. if (!ok) {
  763. break;
  764. }
  765. std::vector<float> gn(ne); // gradient numeric
  766. GGML_ASSERT(ga.size() == gn.size());
  767. std::vector<float> x0 = tensor_to_float(t); // original t data
  768. GGML_ASSERT(ggml_is_scalar(out));
  769. GGML_ASSERT(out->type == GGML_TYPE_F32);
  770. const float eps = grad_eps();
  771. for (int64_t i = 0; i < ne; ++i) {
  772. const float xiu = x0[i] + 1.0f*eps; // x, index i, up
  773. const float xiuh = x0[i] + 0.5f*eps; // x, index i, up half
  774. const float xidh = x0[i] - 0.5f*eps; // x, index i, down half
  775. const float xid = x0[i] - 1.0f*eps; // x, index i, down
  776. float fu, fuh, fdh, fd; // output values for xiu, xiuh, xid, xidh
  777. ggml_backend_tensor_set(t, &xiu, i*sizeof(float), sizeof(float));
  778. status = ggml_backend_graph_compute(backend, gf);
  779. if (status != GGML_STATUS_SUCCESS) {
  780. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  781. return false;
  782. }
  783. ggml_backend_tensor_get(out, &fu, 0, ggml_nbytes(out));
  784. ggml_backend_tensor_set(t, &xid, i*sizeof(float), sizeof(float));
  785. status = ggml_backend_graph_compute(backend, gf);
  786. if (status != GGML_STATUS_SUCCESS) {
  787. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  788. return false;
  789. }
  790. ggml_backend_tensor_get(out, &fd, 0, ggml_nbytes(out));
  791. if (grad_precise()) {
  792. ggml_backend_tensor_set(t, &xiuh, i*sizeof(float), sizeof(float));
  793. status = ggml_backend_graph_compute(backend, gf);
  794. if (status != GGML_STATUS_SUCCESS) {
  795. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  796. return false;
  797. }
  798. ggml_backend_tensor_get(out, &fuh, 0, ggml_nbytes(out));
  799. ggml_backend_tensor_set(t, &xidh, i*sizeof(float), sizeof(float));
  800. status = ggml_backend_graph_compute(backend, gf);
  801. if (status != GGML_STATUS_SUCCESS) {
  802. fprintf(stderr, "%s: ggml_backend_graph_compute failed. status=%s \n", __func__, ggml_status_to_string(status));
  803. return false;
  804. }
  805. ggml_backend_tensor_get(out, &fdh, 0, ggml_nbytes(out));
  806. gn[i] = (8.0*(double)fuh + (double)fd - (8.0*(double)fdh + (double)fu)) / (6.0*(double)eps);
  807. } else {
  808. gn[i] = (fu - fd) / (2.0f*eps);
  809. }
  810. ggml_backend_tensor_set(t, x0.data(), 0, ggml_nbytes(t));
  811. }
  812. const double err = mean_abs_asymm(gn.data(), ga.data(), gn.size(), expect);
  813. if (err > max_maa_err()) {
  814. printf("[%s] MAA = %.9f > %.9f ", ggml_op_desc(t), err, max_maa_err());
  815. ok = false;
  816. break;
  817. }
  818. if (!ok) {
  819. break;
  820. }
  821. }
  822. if (!ok) {
  823. printf("compare failed ");
  824. }
  825. if (ok) {
  826. printf("\033[1;32mOK\033[0m\n");
  827. return true;
  828. }
  829. printf("\033[1;31mFAIL\033[0m\n");
  830. return false;
  831. }
  832. };
  833. // ###################################
  834. // ## Section 2: GGML Op Defintions ##
  835. // ###################################
  836. // The following is an example showing the bare minimum for creating a test for a GGML op.
  837. // GGML_OP_EXAMPLE
  838. struct test_example : public test_case {
  839. // Always define these 2 or variants thereof:
  840. const ggml_type type; // The type of the input tensors.
  841. const std::array<int64_t, 4> ne; // The shape of the input tensors.
  842. // For some ops it's necessary to define multiple types or shapes for the inputs.
  843. // Or they may need additional parameters.
  844. // Put all parameters needed to fully define the test into one of the VARS_TO_STR macros.
  845. // In most cases these are just the properties of the struct that you defined above.
  846. // This is needed for info prints.
  847. std::string vars() override {
  848. return VARS_TO_STR2(type, ne);
  849. }
  850. // Define a constructor for the struct.
  851. // In most cases it will be sufficient to have the same arguments as the struct has properties
  852. // and just use initializer lists.
  853. test_example(ggml_type type = GGML_TYPE_F32,
  854. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  855. : type(type), ne(ne) {}
  856. // Define how a simple GGML compute graph can be constructed for the new GGML op.
  857. ggml_tensor * build_graph(ggml_context * ctx) override {
  858. // Step 1: create input tensors that don't depend on any other tensors:
  859. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  860. ggml_set_name(a, "a"); // Setting names is optional but it's useful for debugging.
  861. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  862. ggml_set_name(b, "b");
  863. // Step 2: use the op that you want to test in the GGML compute graph.
  864. ggml_tensor * out = ggml_add(ctx, a, b); // For this example we're just doing a simple addition.
  865. ggml_set_name(out, "out");
  866. // Step 3: return the output tensor.
  867. return out;
  868. }
  869. // In order to also check the gradients for your op, add calls like ggml_set_param(a)
  870. // immediately after you create the tensors.
  871. // This is optional and only makes sense if a backward pass has actually been implemented for the new op.
  872. };
  873. // GGML_OP_UNARY
  874. struct test_unary : public test_case {
  875. const ggml_unary_op op;
  876. const ggml_type type;
  877. const std::array<int64_t, 4> ne_a;
  878. int v; // view (1 : non-contiguous a)
  879. std::string vars() override {
  880. return VARS_TO_STR3(type, ne_a, v);
  881. }
  882. test_unary(ggml_unary_op op,
  883. ggml_type type = GGML_TYPE_F32,
  884. std::array<int64_t, 4> ne_a = {128, 2, 2, 2},
  885. int v = 0)
  886. : op(op), type(type), ne_a(ne_a), v(v) {}
  887. ggml_tensor * build_graph(ggml_context * ctx) override {
  888. const bool grad_supported = op == GGML_UNARY_OP_ABS || op == GGML_UNARY_OP_SGN || op == GGML_UNARY_OP_NEG ||
  889. op == GGML_UNARY_OP_STEP || op == GGML_UNARY_OP_RELU || op == GGML_UNARY_OP_SILU;
  890. ggml_tensor * a;
  891. if (v & 1) {
  892. auto ne = ne_a; ne[0] *= 3;
  893. a = ggml_new_tensor(ctx, type, 4, ne.data());
  894. if (grad_supported) {
  895. ggml_set_param(a);
  896. }
  897. ggml_set_name(a, "a");
  898. 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);
  899. ggml_set_name(a, "view_of_a");
  900. } else {
  901. a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  902. if (grad_supported) {
  903. ggml_set_param(a);
  904. }
  905. ggml_set_name(a, "a");
  906. }
  907. ggml_tensor * out = ggml_unary(ctx, a, op);
  908. ggml_set_name(out, "out");
  909. return out;
  910. }
  911. void initialize_tensors(ggml_context * ctx) override {
  912. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  913. // test extended range of values to check for NaNs in GELU
  914. init_tensor_uniform(t, -150.f, 150.f);
  915. }
  916. }
  917. float grad_eps() override {
  918. return 15.0f;
  919. }
  920. std::vector<float> grad_expect() override {
  921. if (op == GGML_UNARY_OP_ABS) {
  922. return {-1.0f, 1.0f};
  923. }
  924. if (op == GGML_UNARY_OP_SGN || op == GGML_UNARY_OP_STEP) {
  925. return {0.0f};
  926. }
  927. if (op == GGML_UNARY_OP_RELU) {
  928. return {0.0f, 1.0f};
  929. }
  930. return {};
  931. }
  932. };
  933. // GGML_OP_GLU
  934. struct test_glu : public test_case {
  935. const ggml_glu_op op;
  936. const ggml_type type;
  937. const std::array<int64_t, 4> ne_a;
  938. int v; // view (1 : non-contiguous a)
  939. bool swapped;
  940. std::string vars() override {
  941. return VARS_TO_STR4(type, ne_a, v, swapped);
  942. }
  943. test_glu(ggml_glu_op op,
  944. ggml_type type = GGML_TYPE_F32,
  945. std::array<int64_t, 4> ne_a = {128, 2, 2, 2},
  946. int v = 0,
  947. bool swapped = false)
  948. : op(op), type(type), ne_a(ne_a), v(v), swapped(swapped) {}
  949. ggml_tensor * build_graph(ggml_context * ctx) override {
  950. ggml_tensor * a;
  951. if (v & 1) {
  952. auto ne = ne_a; ne[0] *= 3;
  953. a = ggml_new_tensor(ctx, type, 4, ne.data());
  954. ggml_set_name(a, "a");
  955. 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);
  956. ggml_set_name(a, "view_of_a");
  957. } else {
  958. a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  959. ggml_set_name(a, "a");
  960. }
  961. ggml_tensor * out = ggml_glu(ctx, a, op, swapped);
  962. ggml_set_name(out, "out");
  963. return out;
  964. }
  965. void initialize_tensors(ggml_context * ctx) override {
  966. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  967. // test extended range of values to check for NaNs in GELU
  968. init_tensor_uniform(t, -150.f, 150.f);
  969. }
  970. }
  971. };
  972. struct test_glu_split : public test_case {
  973. const ggml_glu_op op;
  974. const ggml_type type;
  975. const std::array<int64_t, 4> ne_a;
  976. int v; // view (1 : non-contiguous a)
  977. std::string vars() override {
  978. return VARS_TO_STR3(type, ne_a, v) + ",split";
  979. }
  980. test_glu_split(ggml_glu_op op,
  981. ggml_type type = GGML_TYPE_F32,
  982. std::array<int64_t, 4> ne_a = {128, 2, 2, 2},
  983. int v = 0)
  984. : op(op), type(type), ne_a(ne_a), v(v) {}
  985. ggml_tensor * build_graph(ggml_context * ctx) override {
  986. ggml_tensor * a;
  987. ggml_tensor * b;
  988. if (v & 1) {
  989. auto ne = ne_a; ne[0] *= 3;
  990. a = ggml_new_tensor(ctx, type, 4, ne.data());
  991. ggml_set_name(a, "a");
  992. 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);
  993. ggml_set_name(a, "view_of_a");
  994. b = ggml_new_tensor(ctx, type, 4, ne.data());
  995. ggml_set_name(b, "b");
  996. 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);
  997. ggml_set_name(a, "view_of_b");
  998. } else {
  999. a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1000. ggml_set_name(a, "a");
  1001. b = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1002. ggml_set_name(b, "b");
  1003. }
  1004. ggml_tensor * out = ggml_glu_split(ctx, a, b, op);
  1005. ggml_set_name(out, "out");
  1006. return out;
  1007. }
  1008. void initialize_tensors(ggml_context * ctx) override {
  1009. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1010. // test extended range of values to check for NaNs in GELU
  1011. init_tensor_uniform(t, -150.f, 150.f);
  1012. }
  1013. }
  1014. };
  1015. // GGML_OP_GET_ROWS
  1016. struct test_get_rows : public test_case {
  1017. const ggml_type type;
  1018. const int n; // cols
  1019. const int m; // rows
  1020. const int r; // rows to get
  1021. const int b; // batch size
  1022. const bool v; // view (non-contiguous src1)
  1023. std::string vars() override {
  1024. return VARS_TO_STR6(type, n, m, r, b, v);
  1025. }
  1026. test_get_rows(ggml_type type = GGML_TYPE_F32, int n = 10, int m = 5, int r = 3, int b = 1, bool v = false)
  1027. : type(type), n(n), m(m), r(r), b(b), v(v) {}
  1028. ggml_tensor * build_graph(ggml_context * ctx) override {
  1029. ggml_tensor * in = ggml_new_tensor_3d(ctx, type, n, m, b);
  1030. ggml_set_name(in, "in");
  1031. ggml_tensor * rows = ggml_new_tensor_2d(ctx, GGML_TYPE_I32, r, b);
  1032. ggml_set_name(rows, "rows");
  1033. if (v) {
  1034. rows = ggml_view_2d(ctx, rows, r/2, b, rows->nb[1], 0);
  1035. ggml_set_name(rows, "view_of_rows");
  1036. }
  1037. const bool grad_supported = ggml_is_matrix(in) && ggml_is_vector(rows);
  1038. if (grad_supported) {
  1039. ggml_set_param(in);
  1040. // rows is a constant input -> no gradients
  1041. }
  1042. ggml_tensor * out = ggml_get_rows(ctx, in, rows);
  1043. ggml_set_name(out, "out");
  1044. return out;
  1045. }
  1046. void initialize_tensors(ggml_context * ctx) override {
  1047. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1048. if (t->type == GGML_TYPE_I32) {
  1049. if (ggml_is_view_op(t->op)) { continue; }
  1050. // rows
  1051. std::vector<int> data(r*b);
  1052. for (int i = 0; i < r*b; i++) {
  1053. data[i] = rand() % m;
  1054. }
  1055. ggml_backend_tensor_set(t, data.data(), 0, r * b * sizeof(int));
  1056. } else {
  1057. init_tensor_uniform(t);
  1058. }
  1059. }
  1060. }
  1061. };
  1062. // GGML_OP_GET_ROWS_BACK
  1063. struct test_get_rows_back : public test_case {
  1064. const ggml_type type;
  1065. const int n; // cols
  1066. const int m; // rows
  1067. const int r; // rows to get
  1068. const int b; // batch size
  1069. const bool v; // view (non-contiguous src1)
  1070. std::string vars() override {
  1071. return VARS_TO_STR6(type, n, m, r, b, v);
  1072. }
  1073. 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)
  1074. : type(type), n(n), m(m), r(r), b(b), v(v) {}
  1075. ggml_tensor * build_graph(ggml_context * ctx) override {
  1076. ggml_tensor * in_forward = ggml_new_tensor_3d(ctx, type, n, m, b);
  1077. ggml_set_name(in_forward, "in_forward");
  1078. ggml_tensor * rows = ggml_new_tensor_2d(ctx, GGML_TYPE_I32, r, b);
  1079. ggml_set_name(rows, "rows");
  1080. if (v) {
  1081. rows = ggml_view_2d(ctx, rows, r/2, b, rows->nb[1], 0);
  1082. ggml_set_name(rows, "view_of_rows");
  1083. }
  1084. ggml_tensor * grad = ggml_new_tensor_3d(ctx, type, n, r, b);
  1085. ggml_set_name(grad, "grad");
  1086. ggml_tensor * out = ggml_get_rows_back(ctx, grad, rows, in_forward);
  1087. ggml_set_name(out, "out");
  1088. return out;
  1089. }
  1090. void initialize_tensors(ggml_context * ctx) override {
  1091. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1092. if (t->type == GGML_TYPE_I32) {
  1093. if (ggml_is_view_op(t->op)) { continue; }
  1094. // rows
  1095. std::vector<int> data(r*b);
  1096. for (int i = 0; i < r*b; i++) {
  1097. data[i] = rand() % m;
  1098. }
  1099. ggml_backend_tensor_set(t, data.data(), 0, r * b * sizeof(int));
  1100. } else {
  1101. init_tensor_uniform(t);
  1102. }
  1103. }
  1104. }
  1105. };
  1106. // GGML_OP_SET_ROWS
  1107. struct test_set_rows : public test_case {
  1108. const ggml_type type;
  1109. const std::array<int64_t, 4> ne;
  1110. const std::array<int, 2> nr23; // broadcast only dims 2 and 3
  1111. const int r; // rows to set
  1112. const bool v; // view (non-contiguous src1)
  1113. std::string vars() override {
  1114. return VARS_TO_STR5(type, ne, nr23, r, v);
  1115. }
  1116. test_set_rows(ggml_type type,
  1117. std::array<int64_t, 4> ne,
  1118. std::array<int, 2> nr23,
  1119. int r, bool v = false)
  1120. : type(type), ne(ne), nr23(nr23), r(r), v(v) {}
  1121. ggml_tensor * build_graph(ggml_context * ctx) override {
  1122. ggml_tensor * dst = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2]*nr23[0], ne[3]*nr23[1]);
  1123. ggml_set_name(dst, "dst");
  1124. ggml_tensor * src = ggml_new_tensor_4d(ctx, GGML_TYPE_F32, ne[0], r, ne[2]*nr23[0], ne[3]*nr23[1]);
  1125. ggml_set_name(src, "src");
  1126. ggml_tensor * row_idxs = ggml_new_tensor_3d(ctx, GGML_TYPE_I64, r, ne[2], ne[3]);
  1127. ggml_set_name(row_idxs, "row_idxs");
  1128. if (v) {
  1129. 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);
  1130. row_idxs = ggml_view_3d(ctx, row_idxs, r/2, ne[2], ne[3], row_idxs->nb[1], row_idxs->nb[2], 0);
  1131. ggml_set_name(row_idxs, "view_of_rows");
  1132. }
  1133. ggml_tensor * out = ggml_set_rows(ctx, dst, src, row_idxs);
  1134. ggml_set_name(out, "out");
  1135. return out;
  1136. }
  1137. void initialize_tensors(ggml_context * ctx) override {
  1138. std::random_device rd;
  1139. std::default_random_engine rng(rd());
  1140. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1141. if (t->type == GGML_TYPE_I64) {
  1142. if (ggml_is_view_op(t->op)) {
  1143. continue;
  1144. }
  1145. for (int i2 = 0; i2 < t->ne[2]; i2++) {
  1146. for (int i1 = 0; i1 < t->ne[1]; i1++) {
  1147. // generate a shuffled subset of row indices
  1148. std::vector<int64_t> data(ne[1]);
  1149. for (int i = 0; i < ne[1]; i++) {
  1150. data[i] = i;
  1151. }
  1152. std::shuffle(data.begin(), data.end(), rng);
  1153. data.resize(t->ne[0]);
  1154. const size_t offs = i1*t->nb[1] + i2*t->nb[2];
  1155. ggml_backend_tensor_set(t, data.data(), offs, t->ne[0]*sizeof(int64_t));
  1156. }
  1157. }
  1158. } else {
  1159. init_tensor_uniform(t);
  1160. }
  1161. }
  1162. }
  1163. };
  1164. // GGML_OP_ARGMAX
  1165. struct test_argmax : public test_case {
  1166. const ggml_type type;
  1167. const std::array<int64_t, 4> ne;
  1168. std::string vars() override {
  1169. return VARS_TO_STR2(type, ne);
  1170. }
  1171. test_argmax(ggml_type type = GGML_TYPE_F32,
  1172. std::array<int64_t, 4> ne = {10, 100, 1, 1})
  1173. : type(type), ne(ne) {}
  1174. ggml_tensor * build_graph(ggml_context * ctx) override {
  1175. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1176. ggml_set_name(a, "a");
  1177. ggml_tensor * out = ggml_argmax(ctx, a);
  1178. ggml_set_name(out, "out");
  1179. return out;
  1180. }
  1181. void initialize_tensors(ggml_context * ctx) override {
  1182. std::random_device rd;
  1183. std::default_random_engine rng(rd());
  1184. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1185. if (t->type == GGML_TYPE_F32) {
  1186. // initialize with unique values to avoid ties
  1187. for (int64_t r = 0; r < ggml_nrows(t); r++) {
  1188. std::vector<float> data(t->ne[0]);
  1189. for (int i = 0; i < t->ne[0]; i++) {
  1190. data[i] = i;
  1191. }
  1192. std::shuffle(data.begin(), data.end(), rng);
  1193. ggml_backend_tensor_set(t, data.data(), r * t->nb[1], t->ne[0] * sizeof(float));
  1194. }
  1195. } else {
  1196. init_tensor_uniform(t);
  1197. }
  1198. }
  1199. }
  1200. double max_nmse_err() override {
  1201. return 0.0;
  1202. }
  1203. };
  1204. // GGML_OP_COUNT_EQUAL
  1205. struct test_count_equal : public test_case {
  1206. const ggml_type type;
  1207. const std::array<int64_t, 4> ne;
  1208. std::string vars() override {
  1209. return VARS_TO_STR2(type, ne);
  1210. }
  1211. test_count_equal(ggml_type type = GGML_TYPE_F32,
  1212. std::array<int64_t, 4> ne = {4, 500, 1, 1})
  1213. : type(type), ne(ne) {}
  1214. ggml_tensor * build_graph(ggml_context * ctx) override {
  1215. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1216. ggml_set_name(a, "a");
  1217. ggml_tensor * a_argmax = ggml_argmax(ctx, a);
  1218. ggml_set_name(a_argmax, "a_argmax");
  1219. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  1220. ggml_set_name(b, "b");
  1221. ggml_tensor * b_argmax = ggml_argmax(ctx, b);
  1222. ggml_set_name(b_argmax, "b_argmax");
  1223. ggml_tensor * out = ggml_count_equal(ctx, a_argmax, b_argmax);
  1224. ggml_set_name(out, "out");
  1225. return out;
  1226. }
  1227. double max_nmse_err() override {
  1228. return 0.0;
  1229. }
  1230. };
  1231. // GGML_OP_REPEAT
  1232. struct test_repeat : public test_case {
  1233. const ggml_type type;
  1234. const std::array<int64_t, 4> ne;
  1235. const std::array<int, 4> nr;
  1236. std::string vars() override {
  1237. return VARS_TO_STR3(type, ne, nr);
  1238. }
  1239. size_t op_size(ggml_tensor * t) override {
  1240. return ggml_nbytes(t) * 2;
  1241. }
  1242. test_repeat(ggml_type type = GGML_TYPE_F32,
  1243. std::array<int64_t, 4> ne = {10, 5, 4, 3},
  1244. std::array<int, 4> nr = {2, 2, 2, 2})
  1245. : type(type), ne(ne), nr(nr) {}
  1246. ggml_tensor * build_graph(ggml_context * ctx) override {
  1247. 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]);
  1248. ggml_set_name(target, "target");
  1249. ggml_tensor * src = ggml_new_tensor(ctx, type, 4, ne.data());
  1250. ggml_set_param(src);
  1251. ggml_set_name(src, "src");
  1252. ggml_tensor * out = ggml_repeat(ctx, src, target);
  1253. ggml_set_name(out, "out");
  1254. return out;
  1255. }
  1256. };
  1257. // GGML_OP_REPEAT_BACK
  1258. struct test_repeat_back : public test_case {
  1259. const ggml_type type;
  1260. const std::array<int64_t, 4> ne;
  1261. const std::array<int, 4> nr;
  1262. const bool v; // whether src is a noncontiguous view
  1263. std::string vars() override {
  1264. return VARS_TO_STR4(type, ne, nr, v);
  1265. }
  1266. size_t op_size(ggml_tensor * t) override {
  1267. return ggml_nbytes(t) * 2;
  1268. }
  1269. test_repeat_back(ggml_type type = GGML_TYPE_F32,
  1270. std::array<int64_t, 4> ne = {8, 6, 4, 2},
  1271. std::array<int, 4> nr = {2, 2, 2, 2},
  1272. bool v = false)
  1273. : type(type), ne(ne), nr(nr), v(v) {}
  1274. ggml_tensor * build_graph(ggml_context * ctx) override {
  1275. 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]);
  1276. ggml_set_name(src, "src");
  1277. if (v) {
  1278. GGML_ASSERT(ne[0] % 2 == 0);
  1279. GGML_ASSERT(ne[1] % 2 == 0);
  1280. GGML_ASSERT(ne[2] % 2 == 0);
  1281. GGML_ASSERT(ne[3] % 2 == 0);
  1282. GGML_ASSERT(nr[0] % 2 == 0 || nr[0] == 1);
  1283. GGML_ASSERT(nr[1] % 2 == 0 || nr[1] == 1);
  1284. GGML_ASSERT(nr[2] % 2 == 0 || nr[2] == 1);
  1285. GGML_ASSERT(nr[3] % 2 == 0 || nr[3] == 1);
  1286. const int64_t ne00 = nr[0] == 1 ? src->ne[0] : src->ne[0] / 2;
  1287. const int64_t ne01 = nr[1] == 1 ? src->ne[1] : src->ne[1] / 2;
  1288. const int64_t ne02 = nr[2] == 1 ? src->ne[2] : src->ne[2] / 2;
  1289. const int64_t ne03 = nr[3] == 1 ? src->ne[3] : src->ne[3] / 2;
  1290. src = ggml_view_4d(ctx, src, ne00, ne01, ne02, ne03, src->nb[1], src->nb[2], src->nb[3], 0);
  1291. }
  1292. ggml_tensor * target = ggml_new_tensor(ctx, type, 4, ne.data());
  1293. ggml_set_name(target, "target");
  1294. ggml_tensor * out = ggml_repeat_back(ctx, src, target);
  1295. ggml_set_name(out, "out");
  1296. return out;
  1297. }
  1298. };
  1299. // GGML_OP_DUP
  1300. struct test_dup : public test_case {
  1301. const ggml_type type;
  1302. const std::array<int64_t, 4> ne;
  1303. const std::array<int64_t, 4> permute;
  1304. bool _use_permute;
  1305. std::string vars() override {
  1306. std::string v = VARS_TO_STR2(type, ne);
  1307. if (_use_permute) v += "," + VAR_TO_STR(permute);
  1308. return v;
  1309. }
  1310. test_dup(ggml_type type = GGML_TYPE_F32,
  1311. std::array<int64_t, 4> ne = {10, 10, 20, 1},
  1312. std::array<int64_t, 4> permute = {0, 0, 0, 0})
  1313. : type(type), ne(ne), permute(permute),
  1314. _use_permute(permute[0] + permute[1] + permute[2] + permute[3] > 0) {}
  1315. ggml_tensor * build_graph(ggml_context * ctx) override {
  1316. ggml_tensor * src = ggml_new_tensor(ctx, type, 4, ne.data());
  1317. ggml_set_param(src);
  1318. ggml_set_name(src, "src");
  1319. if (_use_permute) {
  1320. src = ggml_permute(ctx, src, permute[0], permute[1], permute[2], permute[3]);
  1321. ggml_set_name(src, "src_permuted");
  1322. }
  1323. ggml_tensor * out = ggml_dup(ctx, src);
  1324. ggml_set_name(out, "out");
  1325. return out;
  1326. }
  1327. };
  1328. // GGML_OP_SET
  1329. struct test_set : public test_case {
  1330. const ggml_type type_src;
  1331. const ggml_type type_dst;
  1332. const std::array<int64_t, 4> ne;
  1333. const int dim;
  1334. std::string vars() override {
  1335. return VARS_TO_STR4(type_src, type_dst, ne, dim);
  1336. }
  1337. size_t op_size(ggml_tensor * t) override {
  1338. return ggml_nbytes(t) + ggml_nbytes(t->src[0]);
  1339. }
  1340. test_set(ggml_type type_src = GGML_TYPE_F32, ggml_type type_dst = GGML_TYPE_F32,
  1341. std::array<int64_t, 4> ne = {6, 5, 4, 3}, int dim = 1)
  1342. : type_src(type_src), type_dst(type_dst), ne(ne), dim(dim) {}
  1343. ggml_tensor * build_graph(ggml_context * ctx) override {
  1344. ggml_tensor * src = ggml_new_tensor(ctx, type_src, 4, ne.data());
  1345. ggml_set_param(src);
  1346. ggml_set_name(src, "src");
  1347. auto ne_dst = ne;
  1348. for (int i = 0; i < dim; ++i) {
  1349. ne_dst[i] *= 2;
  1350. }
  1351. ggml_tensor* dst = ggml_new_tensor(ctx, type_dst, 4, ne_dst.data());
  1352. ggml_set_param(dst);
  1353. ggml_set_name(dst, "dst");
  1354. size_t offset = 0;
  1355. for (int i = 0; i < dim; ++i) {
  1356. offset += ((ne_dst[i] - ne[i])/2)*dst->nb[i];
  1357. }
  1358. ggml_tensor * out = ggml_set(ctx, dst, src,
  1359. // The backward pass requires setting a contiguous region:
  1360. src->nb[1], src->nb[2], src->nb[3], offset);
  1361. ggml_set_name(out, "out");
  1362. return out;
  1363. }
  1364. };
  1365. // GGML_OP_CPY
  1366. struct test_cpy : public test_case {
  1367. const ggml_type type_src;
  1368. const ggml_type type_dst;
  1369. const std::array<int64_t, 4> ne;
  1370. const std::array<int64_t, 4> permute_src;
  1371. const std::array<int64_t, 4> permute_dst;
  1372. bool _src_use_permute;
  1373. bool _dst_use_permute;
  1374. std::string vars() override {
  1375. return VARS_TO_STR5(type_src, type_dst, ne, permute_src, permute_dst);
  1376. }
  1377. double max_nmse_err() override {
  1378. return 1e-6;
  1379. }
  1380. size_t op_size(ggml_tensor * t) override {
  1381. return ggml_nbytes(t) + ggml_nbytes(t->src[0]);
  1382. }
  1383. test_cpy(ggml_type type_src = GGML_TYPE_F32, ggml_type type_dst = GGML_TYPE_F32,
  1384. std::array<int64_t, 4> ne = {10, 10, 10, 1},
  1385. std::array<int64_t, 4> permute_src = {0, 0, 0, 0},
  1386. std::array<int64_t, 4> permute_dst = {0, 0, 0, 0})
  1387. : type_src(type_src), type_dst(type_dst), ne(ne), permute_src(permute_src), permute_dst(permute_dst),
  1388. _src_use_permute(permute_src[0] + permute_src[1] + permute_src[2] + permute_src[3] > 0),
  1389. _dst_use_permute(permute_dst[0] + permute_dst[1] + permute_dst[2] + permute_dst[3] > 0) {}
  1390. ggml_tensor * build_graph(ggml_context * ctx) override {
  1391. ggml_tensor * src = ggml_new_tensor(ctx, type_src, 4, ne.data());
  1392. ggml_set_param(src);
  1393. ggml_set_name(src, "src");
  1394. if (_src_use_permute) {
  1395. src = ggml_permute(ctx, src, permute_src[0], permute_src[1], permute_src[2], permute_src[3]);
  1396. ggml_set_name(src, "src_permuted");
  1397. }
  1398. ggml_tensor * dst = ggml_new_tensor(ctx, type_dst, 4, src->ne);
  1399. ggml_set_name(dst, "dst");
  1400. if (_dst_use_permute) {
  1401. dst = ggml_permute(ctx, dst, permute_dst[0], permute_dst[1], permute_dst[2], permute_dst[3]);
  1402. ggml_set_name(dst, "dst_permuted");
  1403. }
  1404. ggml_tensor * out = ggml_cpy(ctx, src, dst);
  1405. ggml_set_name(out, "out");
  1406. return out;
  1407. }
  1408. };
  1409. // GGML_OP_CONT
  1410. struct test_cont : public test_case {
  1411. const ggml_type type;
  1412. const std::array<int64_t, 4> ne;
  1413. std::string vars() override {
  1414. return VARS_TO_STR2(type, ne);
  1415. }
  1416. test_cont(ggml_type type = GGML_TYPE_F32,
  1417. std::array<int64_t, 4> ne = {10, 10, 10, 1})
  1418. : type(type), ne(ne) {}
  1419. ggml_tensor * build_graph(ggml_context * ctx) override {
  1420. ggml_tensor * src = ggml_new_tensor(ctx, type, 4, ne.data());
  1421. ggml_set_param(src);
  1422. ggml_set_name(src, "src");
  1423. src = ggml_transpose(ctx, src);
  1424. ggml_set_name(src, "src_transposed");
  1425. ggml_tensor * out = ggml_cont(ctx, src);
  1426. ggml_set_name(out, "out");
  1427. return out;
  1428. }
  1429. };
  1430. // GGML_OP_ADD
  1431. // GGML_OP_SUB
  1432. // GGML_OP_MUL
  1433. // GGML_OP_DIV
  1434. struct test_bin_bcast : public test_case {
  1435. using op_t = ggml_tensor * (*) (ggml_context *, ggml_tensor *, ggml_tensor *);
  1436. op_t op;
  1437. const ggml_type type;
  1438. const std::array<int64_t, 4> ne;
  1439. const std::array<int, 4> nr;
  1440. std::string vars() override {
  1441. return VARS_TO_STR3(type, ne, nr);
  1442. }
  1443. size_t op_size(ggml_tensor * t) override {
  1444. return ggml_nbytes(t) * 3;
  1445. }
  1446. test_bin_bcast(op_t op, ggml_type type = GGML_TYPE_F32,
  1447. std::array<int64_t, 4> ne = {10, 10, 1, 1},
  1448. std::array<int, 4> nr = {1, 2, 1, 1})
  1449. : op(op), type(type), ne(ne), nr(nr) {}
  1450. ggml_tensor * build_graph(ggml_context * ctx) override {
  1451. 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]);
  1452. ggml_set_name(a, "a");
  1453. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  1454. ggml_set_name(b, "b");
  1455. // The backward pass supports broadcasting only for GGML_ADD:
  1456. const bool grad_supported = op == ggml_add || ggml_are_same_shape(a, b);
  1457. if (grad_supported) {
  1458. ggml_set_param(a);
  1459. ggml_set_param(b);
  1460. }
  1461. ggml_tensor * out = op(ctx, a, b);
  1462. ggml_set_name(out, "out");
  1463. return out;
  1464. }
  1465. void initialize_tensors(ggml_context * ctx) override {
  1466. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1467. if (op == ggml_mul || op == ggml_div) {
  1468. // MUL and DIV have numerical issues around zero:
  1469. init_tensor_uniform(t, 0.9f, 1.1f);
  1470. } else {
  1471. init_tensor_uniform(t);
  1472. }
  1473. }
  1474. }
  1475. float grad_eps() override {
  1476. return 0.1f * (op == ggml_mul ? ne[0]*ne[1]*ne[2]*ne[3] : 1);
  1477. }
  1478. bool grad_precise() override {
  1479. return op == ggml_div;
  1480. }
  1481. double max_maa_err() override {
  1482. return op == ggml_add ? 1e-4 : 1e-3;
  1483. }
  1484. };
  1485. // GGML_OP_ADD1
  1486. struct test_add1 : public test_case {
  1487. const ggml_type type;
  1488. const std::array<int64_t, 4> ne;
  1489. std::string vars() override {
  1490. return VARS_TO_STR2(type, ne);
  1491. }
  1492. test_add1(ggml_type type = GGML_TYPE_F32,
  1493. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  1494. : type(type), ne(ne) {}
  1495. ggml_tensor * build_graph(ggml_context * ctx) override {
  1496. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1497. ggml_set_param(a);
  1498. ggml_set_name(a, "a");
  1499. ggml_tensor * b = ggml_new_tensor_1d(ctx, type, 1);
  1500. // ggml_set_param(b); // TODO: implement
  1501. ggml_set_name(b, "b");
  1502. ggml_tensor * out = ggml_add1(ctx, a, b);
  1503. ggml_set_name(out, "out");
  1504. return out;
  1505. }
  1506. float grad_eps() override {
  1507. return 0.1f * ne[0]*ne[1]*ne[2]*ne[3];
  1508. }
  1509. };
  1510. // GGML_OP_SCALE
  1511. struct test_scale : public test_case {
  1512. const ggml_type type;
  1513. const std::array<int64_t, 4> ne;
  1514. float scale;
  1515. std::string vars() override {
  1516. return VARS_TO_STR3(type, ne, scale);
  1517. }
  1518. test_scale(ggml_type type = GGML_TYPE_F32,
  1519. std::array<int64_t, 4> ne = {10, 10, 10, 10},
  1520. float scale = 2.0f)
  1521. : type(type), ne(ne), scale(scale) {}
  1522. ggml_tensor * build_graph(ggml_context * ctx) override {
  1523. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1524. ggml_set_param(a);
  1525. ggml_set_name(a, "a");
  1526. ggml_tensor * out = ggml_scale(ctx, a, scale);
  1527. ggml_set_name(out, "out");
  1528. return out;
  1529. }
  1530. };
  1531. // GGML_OP_SILU_BACK
  1532. struct test_silu_back : public test_case {
  1533. const ggml_type type;
  1534. const std::array<int64_t, 4> ne;
  1535. float eps;
  1536. std::string vars() override {
  1537. return VARS_TO_STR3(type, ne, eps);
  1538. }
  1539. test_silu_back(ggml_type type = GGML_TYPE_F32,
  1540. std::array<int64_t, 4> ne = {64, 5, 4, 3},
  1541. float eps = 1e-6f)
  1542. : type(type), ne(ne), eps(eps) {}
  1543. ggml_tensor * build_graph(ggml_context * ctx) override {
  1544. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1545. ggml_set_name(a, "a");
  1546. ggml_tensor * grad = ggml_new_tensor(ctx, type, 4, ne.data());
  1547. ggml_set_name(grad, "grad");
  1548. ggml_tensor * out = ggml_silu_back(ctx, a, grad);
  1549. ggml_set_name(out, "out");
  1550. return out;
  1551. }
  1552. bool grad_precise() override {
  1553. return true;
  1554. }
  1555. };
  1556. // GGML_OP_NORM
  1557. struct test_norm : public test_case {
  1558. const ggml_type type;
  1559. const std::array<int64_t, 4> ne;
  1560. const bool v; // whether a is a non-contiguous view
  1561. const float eps;
  1562. std::string vars() override {
  1563. return VARS_TO_STR4(type, ne, v, eps);
  1564. }
  1565. test_norm(ggml_type type = GGML_TYPE_F32,
  1566. std::array<int64_t, 4> ne = {64, 5, 4, 3},
  1567. bool v = false,
  1568. float eps = 1e-6f)
  1569. : type(type), ne(ne), v(v), eps(eps) {}
  1570. ggml_tensor * build_graph(ggml_context * ctx) override {
  1571. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1572. ggml_set_name(a, "a");
  1573. if (v) {
  1574. 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);
  1575. ggml_set_name(a, "view of a");
  1576. }
  1577. ggml_tensor * out = ggml_norm(ctx, a, eps);
  1578. ggml_set_name(out, "out");
  1579. return out;
  1580. }
  1581. };
  1582. // GGML_OP_RMS_NORM
  1583. struct test_rms_norm : public test_case {
  1584. const ggml_type type;
  1585. const std::array<int64_t, 4> ne;
  1586. const bool v; // whether a is a non-contiguous view
  1587. const float eps;
  1588. std::string vars() override {
  1589. return VARS_TO_STR4(type, ne, v, eps);
  1590. }
  1591. test_rms_norm(ggml_type type = GGML_TYPE_F32,
  1592. std::array<int64_t, 4> ne = {64, 5, 4, 3},
  1593. bool v = false,
  1594. float eps = 1e-6f)
  1595. : type(type), ne(ne), v(v), eps(eps) {}
  1596. ggml_tensor * build_graph(ggml_context * ctx) override {
  1597. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1598. ggml_set_param(a);
  1599. ggml_set_name(a, "a");
  1600. if (v) {
  1601. 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);
  1602. ggml_set_name(a, "view of a");
  1603. }
  1604. ggml_tensor * out = ggml_rms_norm(ctx, a, eps);
  1605. ggml_set_name(out, "out");
  1606. return out;
  1607. }
  1608. void initialize_tensors(ggml_context * ctx) override {
  1609. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1610. init_tensor_uniform(t, -10.f, 10.f);
  1611. }
  1612. }
  1613. float grad_eps() override {
  1614. return 1.0f;
  1615. }
  1616. bool grad_precise() override {
  1617. return true;
  1618. }
  1619. };
  1620. // GGML_OP_RMS_NORM_BACK
  1621. struct test_rms_norm_back : public test_case {
  1622. const ggml_type type;
  1623. const std::array<int64_t, 4> ne;
  1624. const float eps;
  1625. std::string vars() override {
  1626. return VARS_TO_STR3(type, ne, eps);
  1627. }
  1628. test_rms_norm_back(ggml_type type = GGML_TYPE_F32,
  1629. std::array<int64_t, 4> ne = {64, 5, 4, 3},
  1630. float eps = 1e-6f)
  1631. : type(type), ne(ne), eps(eps) {}
  1632. ggml_tensor * build_graph(ggml_context * ctx) override {
  1633. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1634. ggml_set_name(a, "a");
  1635. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  1636. ggml_set_name(b, "b");
  1637. ggml_tensor * out = ggml_rms_norm_back(ctx, a, b, eps);
  1638. ggml_set_name(out, "out");
  1639. return out;
  1640. }
  1641. void initialize_tensors(ggml_context * ctx) override {
  1642. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1643. init_tensor_uniform(t, -10.f, 10.f);
  1644. }
  1645. }
  1646. };
  1647. // GGML_OP_RMS_NORM + GGML_OP_MUL
  1648. struct test_rms_norm_mul : public test_case {
  1649. const ggml_type type;
  1650. const std::array<int64_t, 4> ne;
  1651. const float eps;
  1652. std::string op_desc(ggml_tensor * t) override {
  1653. GGML_UNUSED(t);
  1654. return "RMS_NORM_MUL";
  1655. }
  1656. bool run_whole_graph() override { return true; }
  1657. std::string vars() override {
  1658. return VARS_TO_STR3(type, ne, eps);
  1659. }
  1660. test_rms_norm_mul(ggml_type type = GGML_TYPE_F32,
  1661. std::array<int64_t, 4> ne = {64, 5, 4, 3},
  1662. float eps = 1e-6f)
  1663. : type(type), ne(ne), eps(eps) {}
  1664. ggml_tensor * build_graph(ggml_context * ctx) override {
  1665. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1666. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  1667. ggml_set_param(a);
  1668. ggml_set_name(a, "a");
  1669. ggml_set_param(b);
  1670. ggml_set_name(b, "b");
  1671. // Use a and b early, so we don't end up with an OP_NONE between rms_norm and mul
  1672. a = ggml_add(ctx, a, b);
  1673. ggml_tensor * out = ggml_mul(ctx, ggml_rms_norm(ctx, a, eps), b);
  1674. ggml_set_name(out, "out");
  1675. return out;
  1676. }
  1677. void initialize_tensors(ggml_context * ctx) override {
  1678. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1679. init_tensor_uniform(t, -10.f, 10.f);
  1680. }
  1681. }
  1682. double max_nmse_err() override {
  1683. return 1e-6;
  1684. }
  1685. float grad_eps() override {
  1686. return 1.0f;
  1687. }
  1688. bool grad_precise() override {
  1689. return true;
  1690. }
  1691. };
  1692. // GGML_OP_SSM_CONV
  1693. struct test_ssm_conv : public test_case {
  1694. const ggml_type type;
  1695. const std::array<int64_t, 4> ne_a;
  1696. const std::array<int64_t, 4> ne_b;
  1697. std::string vars() override {
  1698. return VARS_TO_STR3(type, ne_a, ne_b);
  1699. }
  1700. test_ssm_conv(ggml_type type = GGML_TYPE_F32,
  1701. std::array<int64_t, 4> ne_a = {10, 10, 10, 1},
  1702. std::array<int64_t, 4> ne_b = {3, 3, 1, 1})
  1703. : type(type), ne_a(ne_a), ne_b(ne_b) {}
  1704. ggml_tensor * build_graph(ggml_context * ctx) override {
  1705. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1706. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne_b.data());
  1707. ggml_tensor * out = ggml_ssm_conv(ctx, a, b);
  1708. return out;
  1709. }
  1710. };
  1711. // GGML_OP_SSM_SCAN
  1712. struct test_ssm_scan : public test_case {
  1713. const ggml_type type;
  1714. const int64_t d_state;
  1715. const int64_t d_inner;
  1716. const int64_t n_seq_tokens;
  1717. const int64_t n_seqs;
  1718. std::string vars() override {
  1719. return VARS_TO_STR5(type, d_state, d_inner, n_seq_tokens, n_seqs);
  1720. }
  1721. test_ssm_scan(ggml_type type = GGML_TYPE_F32,
  1722. int64_t d_state = 32, int64_t d_inner = 32, int64_t n_seq_tokens = 32, int64_t n_seqs = 32)
  1723. : type(type), d_state(d_state), d_inner(d_inner), n_seq_tokens(n_seq_tokens), n_seqs(n_seqs) {}
  1724. ggml_tensor * build_graph(ggml_context * ctx) override {
  1725. ggml_tensor * s = ggml_new_tensor(ctx, type, 4, std::vector<int64_t>{ d_state, d_inner, n_seqs, 1 }.data());
  1726. ggml_tensor * x = ggml_new_tensor(ctx, type, 4, std::vector<int64_t>{ d_inner, n_seq_tokens, n_seqs, 1 }.data());
  1727. ggml_tensor * dt = ggml_new_tensor(ctx, type, 4, std::vector<int64_t>{ d_inner, n_seq_tokens, n_seqs, 1 }.data());
  1728. ggml_tensor * A = ggml_new_tensor(ctx, type, 4, std::vector<int64_t>{ d_state, d_inner, 1 , 1 }.data());
  1729. ggml_tensor * B = ggml_new_tensor(ctx, type, 4, std::vector<int64_t>{ d_state, n_seq_tokens, n_seqs, 1 }.data());
  1730. ggml_tensor * C = ggml_new_tensor(ctx, type, 4, std::vector<int64_t>{ d_state, n_seq_tokens, n_seqs, 1 }.data());
  1731. ggml_tensor * out = ggml_ssm_scan(ctx, s, x, dt, A, B, C);
  1732. return out;
  1733. }
  1734. };
  1735. // GGML_OP_RWKV_WKV6
  1736. struct test_rwkv_wkv6 : public test_case {
  1737. const ggml_type type;
  1738. const int64_t head_count;
  1739. const int64_t head_size;
  1740. const int64_t n_seq_tokens;
  1741. const int64_t n_seqs;
  1742. std::string vars() override {
  1743. return VARS_TO_STR5(type, head_count, head_size, n_seq_tokens, n_seqs);
  1744. }
  1745. test_rwkv_wkv6(ggml_type type = GGML_TYPE_F32,
  1746. int64_t head_count = 32, int64_t head_size = 64, int64_t n_seq_tokens = 32, int64_t n_seqs = 32)
  1747. : type(type), head_count(head_count), head_size(head_size), n_seq_tokens(n_seq_tokens), n_seqs(n_seqs) {}
  1748. ggml_tensor * build_graph(ggml_context * ctx) override {
  1749. const int64_t n_tokens = n_seq_tokens * n_seqs;
  1750. ggml_tensor * r = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1751. ggml_tensor * k = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1752. ggml_tensor * v = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1753. ggml_tensor * tf = ggml_new_tensor(ctx, type, 2, std::vector<int64_t>{ head_size, head_count }.data());
  1754. ggml_tensor * td = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1755. ggml_tensor * s = ggml_new_tensor(ctx, type, 2, std::vector<int64_t>{ head_size * head_size * head_count, n_seqs }.data());
  1756. ggml_tensor * out = ggml_rwkv_wkv6(ctx, k, v, r, tf, td, s);
  1757. return out;
  1758. }
  1759. };
  1760. // GGML_OP_GATED_LINEAR_ATTN
  1761. struct test_gla : public test_case {
  1762. const ggml_type type;
  1763. const int64_t head_count;
  1764. const int64_t head_size;
  1765. const int64_t n_seq_tokens;
  1766. const int64_t n_seqs;
  1767. std::string vars() override {
  1768. return VARS_TO_STR5(type, head_count, head_size, n_seq_tokens, n_seqs);
  1769. }
  1770. test_gla(ggml_type type = GGML_TYPE_F32,
  1771. int64_t head_count = 32, int64_t head_size = 64, int64_t n_seq_tokens = 32, int64_t n_seqs = 32)
  1772. : type(type), head_count(head_count), head_size(head_size), n_seq_tokens(n_seq_tokens), n_seqs(n_seqs) {}
  1773. ggml_tensor * build_graph(ggml_context * ctx) override {
  1774. const int64_t n_tokens = n_seq_tokens * n_seqs;
  1775. ggml_tensor * q = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1776. ggml_tensor * k = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1777. ggml_tensor * v = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1778. ggml_tensor * g = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1779. ggml_tensor * s = ggml_new_tensor(ctx, type, 2, std::vector<int64_t>{ head_size * head_size * head_count, n_seqs }.data());
  1780. ggml_tensor * out = ggml_gated_linear_attn(ctx, k, v, q, g, s, pow(head_size, -0.5));
  1781. return out;
  1782. }
  1783. };
  1784. // GGML_OP_RWKV_WKV7
  1785. struct test_rwkv_wkv7 : public test_case {
  1786. const ggml_type type;
  1787. const int64_t head_count;
  1788. const int64_t head_size;
  1789. const int64_t n_seq_tokens;
  1790. const int64_t n_seqs;
  1791. std::string vars() override {
  1792. return VARS_TO_STR5(type, head_count, head_size, n_seq_tokens, n_seqs);
  1793. }
  1794. test_rwkv_wkv7(ggml_type type = GGML_TYPE_F32,
  1795. int64_t head_count = 32, int64_t head_size = 64, int64_t n_seq_tokens = 32, int64_t n_seqs = 32)
  1796. : type(type), head_count(head_count), head_size(head_size), n_seq_tokens(n_seq_tokens), n_seqs(n_seqs) {}
  1797. ggml_tensor * build_graph(ggml_context * ctx) override {
  1798. const int64_t n_tokens = n_seq_tokens * n_seqs;
  1799. ggml_tensor * r = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1800. ggml_tensor * w = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1801. ggml_tensor * k = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1802. ggml_tensor * v = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1803. ggml_tensor * a = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1804. ggml_tensor * b = ggml_new_tensor(ctx, type, 3, std::vector<int64_t>{ head_size, head_count, n_tokens }.data());
  1805. // Outputs may become NaN with long seqlen without these normalization
  1806. a = ggml_l2_norm(ctx, a, 1e-7F);
  1807. b = ggml_l2_norm(ctx, b, 1e-7F);
  1808. ggml_tensor * s = ggml_new_tensor(ctx, type, 2, std::vector<int64_t>{ head_size * head_size * head_count, n_seqs }.data());
  1809. ggml_tensor * out = ggml_rwkv_wkv7(ctx, r, w, k, v, a, b, s);
  1810. return out;
  1811. }
  1812. };
  1813. // GGML_OP_MUL_MAT
  1814. struct test_mul_mat : public test_case {
  1815. const ggml_type type_a;
  1816. const ggml_type type_b;
  1817. const int64_t m;
  1818. const int64_t n;
  1819. const int64_t k;
  1820. const std::array<int64_t, 2> bs; // dims 3 and 4
  1821. const std::array<int64_t, 2> nr; // repeat in dims 3 and 4
  1822. const std::array<int64_t, 4> per; // permutation of dimensions
  1823. const bool v; // whether a and b are non-contiguous views
  1824. std::string vars() override {
  1825. return VARS_TO_STR9(type_a, type_b, m, n, k, bs, nr, per, v);
  1826. }
  1827. double max_nmse_err() override {
  1828. return 5e-4;
  1829. }
  1830. int64_t grad_nmax() override {
  1831. return 20000;
  1832. }
  1833. uint64_t op_flops(ggml_tensor * t) override {
  1834. GGML_UNUSED(t);
  1835. return 2 * m * n * k * bs[0] * nr[0] * bs[1] * nr[1];
  1836. }
  1837. test_mul_mat(ggml_type type_a = GGML_TYPE_F32, ggml_type type_b = GGML_TYPE_F32,
  1838. int64_t m = 32, int64_t n = 32, int64_t k = 32,
  1839. std::array<int64_t, 2> bs = {10, 10},
  1840. std::array<int64_t, 2> nr = {2, 2},
  1841. std::array<int64_t, 4> per = {0, 1, 2, 3},
  1842. bool v = false)
  1843. : type_a(type_a), type_b(type_b), m(m), n(n), k(k), bs(bs), nr(nr), per(per), v(v) {}
  1844. ggml_tensor * build_graph(ggml_context * ctx) override {
  1845. // C^T = A * B^T: (k, m) * (k, n) => (m, n)
  1846. ggml_tensor * a;
  1847. ggml_tensor * b;
  1848. const int npermuted = (per[0] != 0) + (per[1] != 1) + (per[2] != 2) + (per[3] != 3);
  1849. if (npermuted > 0) {
  1850. GGML_ASSERT(npermuted == 2);
  1851. GGML_ASSERT(!v); // not handled
  1852. GGML_ASSERT(!ggml_is_quantized(type_a) || per[0] == 0);
  1853. GGML_ASSERT(!ggml_is_quantized(type_b) || per[0] == 0);
  1854. // Create tensors with the permuted dimensions, then permute them back to the dimensions given by m,n,k.
  1855. const int64_t ne_a[4] = {k, m, bs[0], bs[1]};
  1856. const int64_t ne_b[4] = {k, n, bs[0]*nr[0], bs[1]*nr[1]};
  1857. a = ggml_new_tensor_4d(ctx, type_a, ne_a[per[0]], ne_a[per[1]], ne_a[per[2]], ne_a[per[3]]);
  1858. b = ggml_new_tensor_4d(ctx, type_b, ne_b[per[0]], ne_b[per[1]], ne_b[per[2]], ne_b[per[3]]);
  1859. if (!ggml_is_quantized(type_a)) {
  1860. if (bs[1] == 1 && nr[1] == 1) {
  1861. ggml_set_param(a);
  1862. }
  1863. ggml_set_param(b);
  1864. }
  1865. ggml_set_name(a, "a");
  1866. ggml_set_name(b, "b");
  1867. a = ggml_permute(ctx, a, per[0], per[1], per[2], per[3]);
  1868. b = ggml_permute(ctx, b, per[0], per[1], per[2], per[3]);
  1869. ggml_set_name(a, "a_permuted");
  1870. ggml_set_name(b, "b_permuted");
  1871. } else {
  1872. if (v) {
  1873. a = ggml_new_tensor_4d(ctx, type_a, k*2, m, bs[0], bs[1]);
  1874. b = ggml_new_tensor_4d(ctx, type_b, k*2, n, bs[0]*nr[0], bs[1]*nr[1]);
  1875. if (!ggml_is_quantized(type_a)) {
  1876. if (bs[1] == 1 && nr[1] == 1) {
  1877. ggml_set_param(a);
  1878. }
  1879. ggml_set_param(b);
  1880. }
  1881. a = ggml_view_4d(ctx, a, k, m, bs[0], bs[1], a->nb[1], a->nb[2], a->nb[3], 0);
  1882. 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);
  1883. } else {
  1884. a = ggml_new_tensor_4d(ctx, type_a, k, m, bs[0], bs[1]);
  1885. b = ggml_new_tensor_4d(ctx, type_b, k, n, bs[0]*nr[0], bs[1]*nr[1]);
  1886. if (!ggml_is_quantized(type_a)) {
  1887. if (bs[1] == 1 && nr[1] == 1) {
  1888. ggml_set_param(a);
  1889. }
  1890. ggml_set_param(b);
  1891. }
  1892. }
  1893. ggml_set_name(a, "a");
  1894. ggml_set_name(b, "b");
  1895. }
  1896. ggml_tensor * out = ggml_mul_mat(ctx, a, b);
  1897. ggml_set_name(out, "out");
  1898. return out;
  1899. }
  1900. };
  1901. // GGML_OP_MUL_MAT_ID
  1902. struct test_mul_mat_id : public test_case {
  1903. const ggml_type type_a;
  1904. const ggml_type type_b;
  1905. const int n_mats;
  1906. const int n_used;
  1907. const bool b; // broadcast b matrix
  1908. const int64_t m;
  1909. const int64_t n;
  1910. const int64_t k;
  1911. std::string vars() override {
  1912. return VARS_TO_STR8(type_a, type_b, n_mats, n_used, b, m, n, k);
  1913. }
  1914. double max_nmse_err() override {
  1915. return 5e-4;
  1916. }
  1917. uint64_t op_flops(ggml_tensor * t) override {
  1918. GGML_UNUSED(t);
  1919. return 2 * m * k * n * n_used;
  1920. }
  1921. test_mul_mat_id(ggml_type type_a = GGML_TYPE_F32, ggml_type type_b = GGML_TYPE_F32,
  1922. int n_mats = 8, int n_used = 2, bool b = false,
  1923. int64_t m = 32, int64_t n = 32, int64_t k = 32)
  1924. : type_a(type_a), type_b(type_b), n_mats(n_mats), n_used(n_used), b(b),
  1925. m(m), n(n), k(k) {
  1926. GGML_ASSERT(n_used <= n_mats);
  1927. }
  1928. ggml_tensor * build_graph(ggml_context * ctx) override {
  1929. // C^T = A * B^T: (k, m) * (k, n) => (m, n)
  1930. ggml_tensor * as = ggml_new_tensor_3d(ctx, type_a, k, m, n_mats);
  1931. ggml_set_name(as, "as");
  1932. ggml_tensor * ids = ggml_new_tensor_2d(ctx, GGML_TYPE_I32, n_mats, n);
  1933. ggml_set_name(ids, "ids");
  1934. if (n_used != n_mats) {
  1935. ids = ggml_view_2d(ctx, ids, n_used, n, ids->nb[1], 0);
  1936. ggml_set_name(ids, "view_of_ids");
  1937. }
  1938. ggml_tensor * b = ggml_new_tensor_3d(ctx, type_b, k, this->b ? 1 : n_used, n);
  1939. ggml_set_name(b, "b");
  1940. ggml_tensor * out = ggml_mul_mat_id(ctx, as, b, ids);
  1941. ggml_set_name(out, "out");
  1942. return out;
  1943. }
  1944. void initialize_tensors(ggml_context * ctx) override {
  1945. std::random_device rd;
  1946. std::default_random_engine rng(rd());
  1947. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1948. if (t->type == GGML_TYPE_I32) {
  1949. if (ggml_is_view_op(t->op)) { continue; }
  1950. // ids
  1951. for (int64_t r = 0; r < ggml_nrows(t); r++) {
  1952. std::vector<int32_t> data(t->ne[0]);
  1953. for (int i = 0; i < t->ne[0]; i++) {
  1954. data[i] = i % n_mats;
  1955. }
  1956. std::shuffle(data.begin(), data.end(), rng);
  1957. ggml_backend_tensor_set(t, data.data(), r * t->nb[1], t->ne[0] * sizeof(int32_t));
  1958. }
  1959. } else {
  1960. init_tensor_uniform(t);
  1961. }
  1962. }
  1963. }
  1964. };
  1965. // GGML_OP_OUT_PROD
  1966. struct test_out_prod : public test_case {
  1967. const ggml_type type_a;
  1968. const ggml_type type_b;
  1969. const int64_t m;
  1970. const int64_t n;
  1971. const int64_t k;
  1972. const std::array<int64_t, 2> bs; // dims 3 and 4
  1973. const std::array<int64_t, 2> nr; // repeat in dims 3 and 4
  1974. const bool trans_b;
  1975. std::string vars() override {
  1976. return VARS_TO_STR8(type_a, type_b, m, n, k, bs, nr, trans_b);
  1977. }
  1978. double max_nmse_err() override {
  1979. return 5e-4;
  1980. }
  1981. test_out_prod(ggml_type type_a = GGML_TYPE_F32, ggml_type type_b = GGML_TYPE_F32,
  1982. int64_t m = 32, int64_t n = 32, int64_t k = 32,
  1983. std::array<int64_t, 2> bs = {10, 10},
  1984. std::array<int64_t, 2> nr = {2, 2},
  1985. bool trans_b = false)
  1986. : type_a(type_a), type_b(type_b), m(m), n(n), k(k), bs(bs), nr(nr), trans_b(trans_b) {}
  1987. ggml_tensor * build_graph(ggml_context * ctx) override {
  1988. ggml_tensor * a = ggml_new_tensor_4d(ctx, type_a, m, k, bs[0], bs[1]);
  1989. ggml_set_name(a, "a");
  1990. ggml_tensor * b;
  1991. if (trans_b) {
  1992. b = ggml_new_tensor_4d(ctx, type_b, k, n, bs[0]*nr[0], bs[1]*nr[1]);
  1993. b = ggml_transpose(ctx, b);
  1994. } else {
  1995. b = ggml_new_tensor_4d(ctx, type_b, n, k, bs[0]*nr[0], bs[1]*nr[1]);
  1996. }
  1997. ggml_set_name(b, "b");
  1998. ggml_tensor * out = ggml_out_prod(ctx, a, b);
  1999. ggml_set_name(out, "out");
  2000. return out;
  2001. }
  2002. };
  2003. // GGML_OP_SQR
  2004. struct test_sqr : public test_case {
  2005. const ggml_type type;
  2006. const std::array<int64_t, 4> ne;
  2007. std::string vars() override {
  2008. return VARS_TO_STR2(type, ne);
  2009. }
  2010. test_sqr(ggml_type type = GGML_TYPE_F32,
  2011. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  2012. : type(type), ne(ne) {}
  2013. ggml_tensor * build_graph(ggml_context * ctx) override {
  2014. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2015. ggml_set_param(a);
  2016. ggml_set_name(a, "a");
  2017. ggml_tensor * out = ggml_sqr(ctx, a);
  2018. ggml_set_name(out, "out");
  2019. return out;
  2020. }
  2021. float grad_eps() override {
  2022. return 0.1f * 0.25f*ne[0]*ne[1]*ne[2]*ne[3]; // 10% of expected value of sum.
  2023. }
  2024. };
  2025. // GGML_OP_SQRT
  2026. struct test_sqrt : public test_case {
  2027. const ggml_type type;
  2028. const std::array<int64_t, 4> ne;
  2029. std::string vars() override {
  2030. return VARS_TO_STR2(type, ne);
  2031. }
  2032. test_sqrt(ggml_type type = GGML_TYPE_F32,
  2033. std::array<int64_t, 4> ne = {10, 3, 3, 2})
  2034. : type(type), ne(ne) {}
  2035. ggml_tensor * build_graph(ggml_context * ctx) override {
  2036. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2037. ggml_set_param(a);
  2038. ggml_set_name(a, "a");
  2039. ggml_tensor * out = ggml_sqrt(ctx, a);
  2040. ggml_set_name(out, "out");
  2041. return out;
  2042. }
  2043. void initialize_tensors(ggml_context * ctx) override {
  2044. // fill with positive values
  2045. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2046. init_tensor_uniform(t, 50.0f, 100.0f);
  2047. }
  2048. }
  2049. float grad_eps() override {
  2050. return 20.0f;
  2051. }
  2052. bool grad_precise() override {
  2053. return true;
  2054. }
  2055. };
  2056. // GGML_OP_LOG
  2057. struct test_log : public test_case {
  2058. const ggml_type type;
  2059. const std::array<int64_t, 4> ne;
  2060. std::string vars() override {
  2061. return VARS_TO_STR2(type, ne);
  2062. }
  2063. test_log(ggml_type type = GGML_TYPE_F32,
  2064. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  2065. : type(type), ne(ne) {}
  2066. ggml_tensor * build_graph(ggml_context * ctx) override {
  2067. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2068. ggml_set_param(a);
  2069. ggml_set_name(a, "a");
  2070. ggml_tensor * out = ggml_log(ctx, a);
  2071. ggml_set_name(out, "out");
  2072. return out;
  2073. }
  2074. void initialize_tensors(ggml_context * ctx) override {
  2075. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2076. // log(1) == 0, cluster values there to keep the sum low for better precision in the backward pass:
  2077. init_tensor_uniform(t, 0.9f, 1.1f);
  2078. }
  2079. }
  2080. bool grad_precise() override {
  2081. return true;
  2082. }
  2083. };
  2084. // GGML_OP_SIN
  2085. struct test_sin : public test_case {
  2086. const ggml_type type;
  2087. const std::array<int64_t, 4> ne;
  2088. std::string vars() override {
  2089. return VARS_TO_STR2(type, ne);
  2090. }
  2091. test_sin(ggml_type type = GGML_TYPE_F32,
  2092. std::array<int64_t, 4> ne = {10, 2, 2, 2})
  2093. : type(type), ne(ne) {}
  2094. ggml_tensor * build_graph(ggml_context * ctx) override {
  2095. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2096. ggml_set_param(a);
  2097. ggml_set_name(a, "a");
  2098. ggml_tensor * out = ggml_sin(ctx, a);
  2099. ggml_set_name(out, "out");
  2100. return out;
  2101. }
  2102. void initialize_tensors(ggml_context * ctx) override {
  2103. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2104. init_tensor_uniform(t, -6.5f, 6.5f); // Covers interval [-2*pi, 2*pi].
  2105. }
  2106. }
  2107. double max_maa_err() override {
  2108. return 1e-3;
  2109. }
  2110. float grad_eps() override {
  2111. return 0.2f;
  2112. }
  2113. bool grad_precise() override {
  2114. return true;
  2115. }
  2116. };
  2117. // GGML_OP_COS
  2118. struct test_cos : public test_case {
  2119. const ggml_type type;
  2120. const std::array<int64_t, 4> ne;
  2121. std::string vars() override {
  2122. return VARS_TO_STR2(type, ne);
  2123. }
  2124. test_cos(ggml_type type = GGML_TYPE_F32,
  2125. std::array<int64_t, 4> ne = {10, 2, 2, 2})
  2126. : type(type), ne(ne) {}
  2127. ggml_tensor * build_graph(ggml_context * ctx) override {
  2128. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2129. ggml_set_param(a);
  2130. ggml_set_name(a, "a");
  2131. ggml_tensor * out = ggml_cos(ctx, a);
  2132. ggml_set_name(out, "out");
  2133. return out;
  2134. }
  2135. void initialize_tensors(ggml_context * ctx) override {
  2136. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2137. init_tensor_uniform(t, -6.5f, 6.5f); // Covers interval [-2*pi, 2*pi].
  2138. }
  2139. }
  2140. double max_maa_err() override {
  2141. return 1e-3;
  2142. }
  2143. float grad_eps() override {
  2144. return 0.2f;
  2145. }
  2146. bool grad_precise() override {
  2147. return true;
  2148. }
  2149. };
  2150. // GGML_OP_CLAMP
  2151. struct test_clamp : public test_case {
  2152. const ggml_type type;
  2153. const std::array<int64_t, 4> ne;
  2154. float min;
  2155. float max;
  2156. std::string vars() override {
  2157. return VARS_TO_STR4(type, ne, min, max);
  2158. }
  2159. test_clamp(ggml_type type = GGML_TYPE_F32,
  2160. std::array<int64_t, 4> ne = {10, 5, 4, 3},
  2161. float min = -0.5f, float max = 0.5f)
  2162. : type(type), ne(ne), min(min), max(max) {}
  2163. ggml_tensor * build_graph(ggml_context * ctx) override {
  2164. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2165. ggml_set_name(a, "a");
  2166. ggml_tensor * out = ggml_clamp(ctx, a, min, max);
  2167. ggml_set_name(out, "out");
  2168. return out;
  2169. }
  2170. float grad_eps() override {
  2171. return 1e-2f;
  2172. }
  2173. std::vector<float> grad_expect() override {
  2174. return {0.0f, 1.0f};
  2175. }
  2176. };
  2177. // GGML_OP_DIAG_MASK_INF
  2178. struct test_diag_mask_inf : public test_case {
  2179. const ggml_type type;
  2180. const std::array<int64_t, 4> ne;
  2181. const int n_past;
  2182. std::string vars() override {
  2183. return VARS_TO_STR3(type, ne, n_past);
  2184. }
  2185. test_diag_mask_inf(ggml_type type = GGML_TYPE_F32,
  2186. std::array<int64_t, 4> ne = {10, 10, 3, 2},
  2187. int n_past = 5)
  2188. : type(type), ne(ne), n_past(n_past) {}
  2189. ggml_tensor * build_graph(ggml_context * ctx) override {
  2190. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2191. ggml_set_param(a);
  2192. ggml_set_name(a, "a");
  2193. ggml_tensor * out = ggml_diag_mask_inf(ctx, a, n_past);
  2194. ggml_set_name(out, "out");
  2195. return out;
  2196. }
  2197. };
  2198. // GGML_OP_SOFT_MAX
  2199. struct test_soft_max : public test_case {
  2200. const ggml_type type;
  2201. const std::array<int64_t, 4> ne;
  2202. const bool mask;
  2203. const ggml_type m_prec;
  2204. const float scale;
  2205. const float max_bias;
  2206. std::string vars() override {
  2207. return VARS_TO_STR6(type, ne, mask, m_prec, scale, max_bias);
  2208. }
  2209. // the 1024 test with bias occasionally fails:
  2210. // 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
  2211. virtual double max_nmse_err() override {
  2212. return 1e-6;
  2213. }
  2214. test_soft_max(ggml_type type = GGML_TYPE_F32,
  2215. std::array<int64_t, 4> ne = {10, 5, 4, 3},
  2216. bool mask = false,
  2217. ggml_type m_prec = GGML_TYPE_F32,
  2218. float scale = 1.0f,
  2219. float max_bias = 0.0f)
  2220. : type(type), ne(ne), mask(mask), m_prec(m_prec), scale(scale), max_bias(max_bias) {}
  2221. ggml_tensor * build_graph(ggml_context * ctx) override {
  2222. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2223. ggml_set_param(a);
  2224. ggml_set_name(a, "a");
  2225. ggml_tensor * mask = nullptr;
  2226. if (this->mask) {
  2227. mask = ggml_new_tensor_2d(ctx, m_prec, ne[0], ne[1]);
  2228. ggml_set_name(mask, "mask");
  2229. }
  2230. ggml_tensor * out = ggml_soft_max_ext(ctx, a, mask, scale, max_bias);
  2231. ggml_set_name(out, "out");
  2232. return out;
  2233. }
  2234. bool grad_precise() override {
  2235. return true;
  2236. }
  2237. };
  2238. // GGML_OP_SOFT_MAX_BACK
  2239. struct test_soft_max_back : public test_case {
  2240. const ggml_type type;
  2241. const std::array<int64_t, 4> ne;
  2242. const float scale;
  2243. const float max_bias;
  2244. std::string vars() override {
  2245. return VARS_TO_STR4(type, ne, scale, max_bias);
  2246. }
  2247. test_soft_max_back(ggml_type type = GGML_TYPE_F32,
  2248. std::array<int64_t, 4> ne = {10, 5, 4, 3},
  2249. float scale = 1.0f,
  2250. float max_bias = 0.0f)
  2251. : type(type), ne(ne), scale(scale), max_bias(max_bias) {}
  2252. ggml_tensor * build_graph(ggml_context * ctx) override {
  2253. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2254. ggml_set_name(a, "a");
  2255. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  2256. ggml_set_name(a, "a");
  2257. ggml_tensor * out = ggml_soft_max_ext_back(ctx, a, b, scale, max_bias);
  2258. ggml_set_name(out, "out");
  2259. return out;
  2260. }
  2261. };
  2262. // GGML_OP_ROPE + GGML_OP_ROPE_BACK
  2263. struct test_rope : public test_case {
  2264. const ggml_type type;
  2265. const std::array<int64_t, 4> ne_a;
  2266. int n_dims;
  2267. int mode;
  2268. int n_ctx; // used to generate positions
  2269. float fs; // freq_scale
  2270. float ef; // ext_factor
  2271. float af; // attn_factor
  2272. bool ff;
  2273. int v; // view (1 : non-contiguous a)
  2274. bool forward;
  2275. std::string vars() override {
  2276. // forward can be inferred from the op, does not need to be printed
  2277. return VARS_TO_STR10(type, ne_a, n_dims, mode, n_ctx, fs, ef, af, ff, v);
  2278. }
  2279. test_rope(ggml_type type = GGML_TYPE_F32,
  2280. std::array<int64_t, 4> ne_a = {10, 5, 3, 1},
  2281. int n_dims = 10, int mode = 0, int n_ctx = 512, float fs = 1.0f,
  2282. float ef = 0.0f, float af = 0.0f, bool ff = false, int v = 0, bool forward = true)
  2283. : 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) {}
  2284. ggml_tensor * build_graph(ggml_context * ctx) override {
  2285. ggml_tensor * a;
  2286. if (v & 1) {
  2287. auto ne = ne_a; ne[0] *= 2; ne[1] *= 4; ne[2] *= 3;
  2288. a = ggml_new_tensor(ctx, type, 4, ne.data());
  2289. if (forward) {
  2290. ggml_set_param(a);
  2291. }
  2292. ggml_set_name(a, "a");
  2293. 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);
  2294. ggml_set_name(a, "view_of_a");
  2295. } else {
  2296. a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  2297. if (forward) {
  2298. ggml_set_param(a);
  2299. }
  2300. ggml_set_name(a, "a");
  2301. }
  2302. const bool is_mrope = mode & GGML_ROPE_TYPE_MROPE;
  2303. const bool is_vision = mode == GGML_ROPE_TYPE_VISION;
  2304. ggml_tensor * pos;
  2305. if (is_mrope || is_vision) {
  2306. pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, ne_a[2] * 4);
  2307. } else {
  2308. pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, ne_a[2]);
  2309. }
  2310. ggml_set_name(pos, "pos");
  2311. ggml_tensor * freq = nullptr;
  2312. if (ff) {
  2313. freq = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, n_dims/2);
  2314. ggml_set_name(freq, "freq");
  2315. }
  2316. ggml_tensor * out;
  2317. if (is_mrope) {
  2318. if (is_vision) {
  2319. GGML_ASSERT(n_dims/4 > 0);
  2320. int rope_sections[4] = {n_dims/4, n_dims/4, 0, 0}; // Vision-RoPE only use first two dimension for image (x, y) coordinate
  2321. if (forward) {
  2322. out = ggml_rope_multi (ctx, a, pos, freq, n_dims/2, rope_sections, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  2323. } else {
  2324. 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);
  2325. }
  2326. } else {
  2327. GGML_ASSERT(n_dims/3 > 0);
  2328. int rope_sections[4] = {n_dims/3, n_dims/3, n_dims/3, 0};
  2329. if (forward) {
  2330. out = ggml_rope_multi (ctx, a, pos, freq, n_dims, rope_sections, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  2331. } else {
  2332. out = ggml_rope_multi_back(ctx, a, pos, freq, n_dims, rope_sections, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  2333. }
  2334. }
  2335. } else {
  2336. if (forward) {
  2337. out = ggml_rope_ext (ctx, a, pos, freq, n_dims, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  2338. } else {
  2339. out = ggml_rope_ext_back(ctx, a, pos, freq, n_dims, mode, 0, 10000.0f, fs, ef, af, 1.0f, 1.0f);
  2340. }
  2341. // TODO: add test with a non-contiguous view as input ; this case is needed for build_rope_2d in clip.cpp
  2342. }
  2343. ggml_set_name(out, "out");
  2344. return out;
  2345. }
  2346. void initialize_tensors(ggml_context * ctx) override {
  2347. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2348. if (t->type == GGML_TYPE_I32) {
  2349. // pos
  2350. const int num_pos_ids = (mode & GGML_ROPE_TYPE_MROPE) ? ne_a[2] * 4 : ne_a[2];
  2351. std::vector<int> data(num_pos_ids);
  2352. for (int i = 0; i < num_pos_ids; i++) {
  2353. data[i] = rand() % n_ctx;
  2354. }
  2355. ggml_backend_tensor_set(t, data.data(), 0, num_pos_ids * sizeof(int));
  2356. } else {
  2357. if (t->ne[0] == n_dims/2) {
  2358. // frequency factors in the range [0.9f, 1.1f]
  2359. init_tensor_uniform(t, 0.9f, 1.1f);
  2360. } else {
  2361. init_tensor_uniform(t);
  2362. }
  2363. }
  2364. }
  2365. }
  2366. double max_maa_err() override {
  2367. return 1e-3;
  2368. }
  2369. bool grad_precise() override {
  2370. return true;
  2371. }
  2372. };
  2373. // GGML_OP_POOL2D
  2374. struct test_pool2d : public test_case {
  2375. enum ggml_op_pool pool_type;
  2376. const ggml_type type_input;
  2377. const std::array<int64_t, 4> ne_input;
  2378. // kernel size
  2379. const int k0;
  2380. const int k1;
  2381. // stride
  2382. const int s0;
  2383. const int s1;
  2384. // padding
  2385. const int p0;
  2386. const int p1;
  2387. std::string vars() override {
  2388. return VARS_TO_STR9(pool_type, type_input, ne_input, k0, k1, s0, s1, p0, p1);
  2389. }
  2390. test_pool2d(ggml_op_pool pool_type = GGML_OP_POOL_AVG,
  2391. ggml_type type_input = GGML_TYPE_F32,
  2392. std::array<int64_t, 4> ne_input = {10, 10, 3, 1}, // [input_width, input_height, input_channels, 1]
  2393. int k0 = 3, int k1 = 3,
  2394. int s0 = 1, int s1 = 1,
  2395. int p0 = 1, int p1 = 1)
  2396. : pool_type(pool_type), type_input(type_input), ne_input(ne_input), k0(k0), k1(k1), s0(s0), s1(s1), p0(p0), p1(p1) {}
  2397. ggml_tensor * build_graph(ggml_context * ctx) override {
  2398. ggml_tensor * input = ggml_new_tensor(ctx, type_input, 4, ne_input.data());
  2399. ggml_set_param(input);
  2400. ggml_set_name(input, "input");
  2401. ggml_tensor * out = ggml_pool_2d(ctx, input, pool_type, k0, k1, s0, s1, p0, p1);
  2402. ggml_set_name(out, "out");
  2403. return out;
  2404. }
  2405. };
  2406. // GGML_OP_CONV_TRANSPOSE_1D
  2407. struct test_conv_transpose_1d : public test_case {
  2408. const std::array<int64_t, 4> ne_input;
  2409. const std::array<int64_t, 4> ne_kernel;
  2410. const int s0; // stride
  2411. const int p0; // padding
  2412. const int d0; // dilation
  2413. std::string vars() override {
  2414. return VARS_TO_STR5(ne_input, ne_kernel, s0, p0, d0);
  2415. }
  2416. 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)]
  2417. std::array<int64_t, 4> ne_kernel = {16, 32, 32, 1}, // [kernel_width, output_channels, input_channels, 1 (should be batch)]
  2418. int s0 = 1, int p0 = 0, int d0 = 1)
  2419. : ne_input(ne_input), ne_kernel(ne_kernel), s0(s0), p0(p0), d0(d0) {}
  2420. ggml_tensor * build_graph(ggml_context * ctx) override {
  2421. ggml_tensor * input = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne_input.data());
  2422. ggml_set_name(input, "input");
  2423. ggml_tensor * kernel = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne_kernel.data());
  2424. ggml_set_name(kernel, "kernel");
  2425. ggml_tensor * out = ggml_conv_transpose_1d(ctx, kernel, input, s0, p0, d0);
  2426. ggml_set_name(out, "out");
  2427. return out;
  2428. }
  2429. };
  2430. // GGML_OP_CONV_TRANSPOSE_2D
  2431. struct test_conv_transpose_2d : public test_case {
  2432. const std::array<int64_t, 4> ne_input;
  2433. const std::array<int64_t, 4> ne_kernel;
  2434. const int stride;
  2435. std::string vars() override {
  2436. return VARS_TO_STR3(ne_input, ne_kernel, stride);
  2437. }
  2438. test_conv_transpose_2d(std::array<int64_t, 4> ne_input = {10, 10, 3, 1}, // [input_width, input_height, input_channels, 1]
  2439. std::array<int64_t, 4> ne_kernel = {3, 3, 3, 1}, // [kernel_width, kernel_height, input_channels, 1]
  2440. int stride = 1)
  2441. : ne_input(ne_input), ne_kernel(ne_kernel), stride(stride){}
  2442. ggml_tensor * build_graph(ggml_context * ctx) override {
  2443. ggml_tensor * input = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne_input.data());
  2444. ggml_set_name(input, "input");
  2445. ggml_tensor * kernel = ggml_new_tensor(ctx, GGML_TYPE_F16, 4, ne_kernel.data());
  2446. ggml_set_name(kernel, "kernel");
  2447. ggml_tensor * out = ggml_conv_transpose_2d_p0(ctx, kernel, input, stride);
  2448. ggml_set_name(out, "out");
  2449. return out;
  2450. }
  2451. };
  2452. // GGML_OP_IM2COL
  2453. struct test_im2col : public test_case {
  2454. const ggml_type type_input;
  2455. const ggml_type type_kernel;
  2456. const ggml_type dst_type;
  2457. const std::array<int64_t, 4> ne_input;
  2458. const std::array<int64_t, 4> ne_kernel;
  2459. // stride
  2460. const int s0;
  2461. const int s1;
  2462. // padding
  2463. const int p0;
  2464. const int p1;
  2465. // dilation
  2466. const int d0;
  2467. const int d1;
  2468. // mode
  2469. const bool is_2D;
  2470. std::string vars() override {
  2471. return VARS_TO_STR12(type_input, type_kernel, dst_type, ne_input, ne_kernel, s0, s1, p0, p1, d0, d1, is_2D);
  2472. }
  2473. test_im2col(ggml_type type_input = GGML_TYPE_F32, ggml_type type_kernel = GGML_TYPE_F16, ggml_type dst_type = GGML_TYPE_F32,
  2474. std::array<int64_t, 4> ne_input = {10, 10, 3, 1}, // [input_width, input_height, input_channels, 1]
  2475. std::array<int64_t, 4> ne_kernel = {3, 3, 3, 1}, // [kernel_width, kernel_height, input_channels, 1]
  2476. int s0 = 1, int s1 = 1,
  2477. int p0 = 1, int p1 = 1,
  2478. int d0 = 1, int d1 = 1,
  2479. bool is_2D = true)
  2480. : 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) {}
  2481. ggml_tensor * build_graph(ggml_context * ctx) override {
  2482. ggml_tensor * input = ggml_new_tensor(ctx, type_input, 4, ne_input.data());
  2483. ggml_set_param(input);
  2484. ggml_set_name(input, "input");
  2485. ggml_tensor * kernel = ggml_new_tensor(ctx, type_kernel, 4, ne_kernel.data());
  2486. ggml_set_name(kernel, "kernel");
  2487. ggml_tensor * out = ggml_im2col(ctx, kernel, input, s0, s1, p0, p1, d0, d1, is_2D, dst_type);
  2488. ggml_set_name(out, "out");
  2489. return out;
  2490. }
  2491. };
  2492. // GGML_OP_CONV_2D_DW
  2493. struct test_conv_2d_dw : public test_case {
  2494. const std::array<int64_t, 4> ne_input;
  2495. const std::array<int64_t, 4> ne_kernel;
  2496. const int stride;
  2497. const int padding;
  2498. const int dilation;
  2499. const bool cwhn;
  2500. std::string vars() override {
  2501. return VARS_TO_STR6(ne_input, ne_kernel, stride, padding, dilation, cwhn);
  2502. }
  2503. test_conv_2d_dw(std::array<int64_t, 4> ne_input = {64, 64, 16, 1},
  2504. std::array<int64_t, 4> ne_kernel = {3, 3, 1, 16},
  2505. int stride = 1, int padding = 0, int dilation = 1, bool cwhn = false)
  2506. : ne_input(ne_input), ne_kernel(ne_kernel), stride(stride), padding(padding), dilation(dilation), cwhn(cwhn) {}
  2507. ggml_tensor * build_graph(ggml_context * ctx) override {
  2508. ggml_tensor * input = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne_input.data());
  2509. ggml_set_name(input, "input");
  2510. ggml_tensor * kernel = ggml_new_tensor(ctx, GGML_TYPE_F32, 4, ne_kernel.data());
  2511. ggml_set_name(kernel, "kernel");
  2512. if (cwhn) {
  2513. // change memory layout to channel-most-contiguous (CWHN),
  2514. // then permute it back so NE matches the original input
  2515. input = ggml_cont(ctx, ggml_permute(ctx, input, 1, 2, 0, 3));
  2516. input = ggml_permute(ctx, input, 2, 0, 1, 3);
  2517. kernel = ggml_cont(ctx, ggml_permute(ctx, kernel, 2, 3, 1, 0));
  2518. kernel = ggml_permute(ctx, kernel, 3, 2, 0, 1);
  2519. }
  2520. ggml_tensor * out = ggml_conv_2d_dw_direct(
  2521. ctx, kernel, input,
  2522. stride, stride, padding, padding, dilation, dilation);
  2523. ggml_set_name(out, "out");
  2524. return out;
  2525. }
  2526. };
  2527. // GGML_OP_CONCAT
  2528. struct test_concat : public test_case {
  2529. const ggml_type type;
  2530. const std::array<int64_t, 4> ne_a;
  2531. const int64_t ne_b_d;
  2532. const int dim;
  2533. const int v; // view (1 << 0: non-cont a, 1 << 1: non-cont b)
  2534. std::string vars() override {
  2535. return VARS_TO_STR5(type, ne_a, ne_b_d, dim, v);
  2536. }
  2537. test_concat(ggml_type type = GGML_TYPE_F32,
  2538. std::array<int64_t, 4> ne_a = {10, 5, 5, 5},
  2539. int64_t ne_b_d = 5,
  2540. int dim = 2, int v = 0)
  2541. : type(type), ne_a(ne_a), ne_b_d(ne_b_d), dim(dim), v(v) {}
  2542. ggml_tensor * build_graph(ggml_context * ctx) override {
  2543. auto ne_b = ne_a;
  2544. ne_b[dim] = ne_b_d;
  2545. ggml_tensor * a;
  2546. if (v & 1) {
  2547. auto ne = ne_a; ne[0] *= 2; ne[1] *= 4; ne[2] *= 3;
  2548. a = ggml_new_tensor(ctx, type, 4, ne.data());
  2549. ggml_set_name(a, "a");
  2550. 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);
  2551. ggml_set_name(a, "view_of_a");
  2552. } else {
  2553. a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  2554. ggml_set_name(a, "a");
  2555. }
  2556. ggml_tensor * b;
  2557. if (v & 2) {
  2558. auto ne = ne_b; ne[0] *= 3; ne[1] *= 2; ne[2] *= 4;
  2559. b = ggml_new_tensor(ctx, type, 4, ne.data());
  2560. ggml_set_name(b, "b");
  2561. 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);
  2562. ggml_set_name(b, "view_of_b");
  2563. } else {
  2564. b = ggml_new_tensor(ctx, type, 4, ne_b.data());
  2565. ggml_set_name(b, "b");
  2566. }
  2567. ggml_tensor * out = ggml_concat(ctx, a, b, dim);
  2568. ggml_set_name(out, "out");
  2569. return out;
  2570. }
  2571. };
  2572. // GGML_OP_ARGSORT
  2573. struct test_argsort : public test_case {
  2574. const ggml_type type;
  2575. const std::array<int64_t, 4> ne;
  2576. ggml_sort_order order;
  2577. std::string vars() override {
  2578. return VARS_TO_STR3(type, ne, order);
  2579. }
  2580. test_argsort(ggml_type type = GGML_TYPE_F32,
  2581. std::array<int64_t, 4> ne = {16, 10, 10, 10},
  2582. ggml_sort_order order = GGML_SORT_ORDER_ASC)
  2583. : type(type), ne(ne), order(order) {}
  2584. ggml_tensor * build_graph(ggml_context * ctx) override {
  2585. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2586. ggml_set_name(a, "a");
  2587. ggml_tensor * out = ggml_argsort(ctx, a, order);
  2588. ggml_set_name(out, "out");
  2589. return out;
  2590. }
  2591. void initialize_tensors(ggml_context * ctx) override {
  2592. std::random_device rd;
  2593. std::default_random_engine rng(rd());
  2594. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2595. if (t->type == GGML_TYPE_I32) {
  2596. // indices
  2597. std::vector<int> data(ggml_nelements(t));
  2598. for (int i = 0; i < ggml_nelements(t); i++) {
  2599. data[i] = rand();
  2600. }
  2601. std::shuffle(data.begin(), data.end(), rng);
  2602. ggml_backend_tensor_set(t, data.data(), 0, ne[0]*ne[1]*ne[2]*ne[3] * sizeof(int));
  2603. } else if (t->type == GGML_TYPE_F32) {
  2604. // initialize with unique values to avoid ties
  2605. for (int64_t r = 0; r < ggml_nrows(t); r++) {
  2606. std::vector<float> data(t->ne[0]);
  2607. for (int i = 0; i < t->ne[0]; i++) {
  2608. data[i] = i;
  2609. }
  2610. std::shuffle(data.begin(), data.end(), rng);
  2611. ggml_backend_tensor_set(t, data.data(), r * t->nb[1], t->ne[0] * sizeof(float));
  2612. }
  2613. } else {
  2614. GGML_ABORT("fatal error");
  2615. }
  2616. }
  2617. }
  2618. };
  2619. // GGML_OP_SUM
  2620. struct test_sum : public test_case {
  2621. const ggml_type type;
  2622. const std::array<int64_t, 4> ne;
  2623. std::string vars() override {
  2624. return VARS_TO_STR2(type, ne);
  2625. }
  2626. test_sum(ggml_type type = GGML_TYPE_F32,
  2627. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  2628. : type(type), ne(ne) {}
  2629. ggml_tensor * build_graph(ggml_context * ctx) override {
  2630. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2631. ggml_set_param(a);
  2632. ggml_set_name(a, "a");
  2633. ggml_tensor * out = ggml_sum(ctx, a);
  2634. ggml_set_name(out, "out");
  2635. return out;
  2636. }
  2637. float grad_eps() override {
  2638. return 0.1f * sqrtf(ne[0]*ne[1]*ne[2]*ne[3]);
  2639. }
  2640. };
  2641. // GGML_OP_SUM_ROWS
  2642. struct test_sum_rows : public test_case {
  2643. const ggml_type type;
  2644. const std::array<int64_t, 4> ne;
  2645. std::string vars() override {
  2646. return VARS_TO_STR2(type, ne);
  2647. }
  2648. test_sum_rows(ggml_type type = GGML_TYPE_F32,
  2649. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  2650. : type(type), ne(ne) {}
  2651. ggml_tensor * build_graph(ggml_context * ctx) override {
  2652. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2653. ggml_set_param(a);
  2654. ggml_set_name(a, "a");
  2655. ggml_tensor * out = ggml_sum_rows(ctx, a);
  2656. ggml_set_name(out, "out");
  2657. return out;
  2658. }
  2659. };
  2660. // GGML_OP_MEAN
  2661. struct test_mean : public test_case {
  2662. const ggml_type type;
  2663. const std::array<int64_t, 4> ne;
  2664. std::string vars() override {
  2665. return VARS_TO_STR2(type, ne);
  2666. }
  2667. test_mean(ggml_type type = GGML_TYPE_F32,
  2668. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  2669. : type(type), ne(ne) {}
  2670. ggml_tensor * build_graph(ggml_context * ctx) override {
  2671. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2672. ggml_set_param(a);
  2673. ggml_set_name(a, "a");
  2674. ggml_tensor * out = ggml_mean(ctx, a);
  2675. ggml_set_name(out, "out");
  2676. return out;
  2677. }
  2678. float grad_eps() override {
  2679. return 0.1f * ne[0]*ne[1]*ne[2]*ne[3];
  2680. }
  2681. };
  2682. // GGML_OP_UPSCALE
  2683. struct test_upscale : public test_case {
  2684. const ggml_type type;
  2685. const std::array<int64_t, 4> ne;
  2686. const int32_t scale_factor;
  2687. const bool transpose;
  2688. const ggml_scale_mode mode;
  2689. std::string vars() override {
  2690. return VARS_TO_STR5(type, ne, scale_factor, mode, transpose);
  2691. }
  2692. test_upscale(ggml_type type = GGML_TYPE_F32,
  2693. std::array<int64_t, 4> ne = {512, 512, 3, 1},
  2694. int32_t scale_factor = 2, ggml_scale_mode mode = GGML_SCALE_MODE_NEAREST, bool transpose = false)
  2695. : type(type), ne(ne), scale_factor(scale_factor), transpose(transpose), mode(mode) {}
  2696. ggml_tensor * build_graph(ggml_context * ctx) override {
  2697. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2698. ggml_set_name(a, "a");
  2699. if (transpose) {
  2700. a = ggml_transpose(ctx, a);
  2701. ggml_set_name(a, "a_transposed");
  2702. }
  2703. ggml_tensor * out = ggml_upscale(ctx, a, scale_factor, mode);
  2704. ggml_set_name(out, "out");
  2705. return out;
  2706. }
  2707. };
  2708. // GGML_OP_UPSCALE (ext)
  2709. struct test_upscale_ext : public test_case {
  2710. const ggml_type type;
  2711. const std::array<int64_t, 4> ne;
  2712. const std::array<int64_t, 4> ne_tgt;
  2713. const ggml_scale_mode mode = GGML_SCALE_MODE_NEAREST;
  2714. std::string vars() override {
  2715. return VARS_TO_STR4(type, ne, ne_tgt, mode);
  2716. }
  2717. test_upscale_ext(ggml_type type = GGML_TYPE_F32,
  2718. std::array<int64_t, 4> ne = {2, 5, 7, 11},
  2719. std::array<int64_t, 4> ne_tgt = {5, 7, 11, 13},
  2720. ggml_scale_mode mode = GGML_SCALE_MODE_NEAREST)
  2721. : type(type), ne(ne), ne_tgt(ne_tgt), mode(mode) {}
  2722. ggml_tensor * build_graph(ggml_context * ctx) override {
  2723. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2724. ggml_set_name(a, "a");
  2725. ggml_tensor * out = ggml_upscale_ext(ctx, a, ne_tgt[0], ne_tgt[1],ne_tgt[2], ne_tgt[3], mode);
  2726. ggml_set_name(out, "out");
  2727. return out;
  2728. }
  2729. };
  2730. // GGML_OP_GROUP_NORM
  2731. struct test_group_norm : public test_case {
  2732. const ggml_type type;
  2733. const std::array<int64_t, 4> ne;
  2734. const int32_t num_groups;
  2735. const float eps;
  2736. std::string vars() override {
  2737. return VARS_TO_STR4(type, ne, num_groups, eps);
  2738. }
  2739. test_group_norm(ggml_type type = GGML_TYPE_F32,
  2740. std::array<int64_t, 4> ne = {64, 64, 320, 1},
  2741. int32_t num_groups = 32,
  2742. float eps = 1e-6f)
  2743. : type(type), ne(ne), num_groups(num_groups), eps(eps) {}
  2744. ggml_tensor * build_graph(ggml_context * ctx) override {
  2745. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2746. ggml_set_name(a, "a");
  2747. ggml_tensor * out = ggml_group_norm(ctx, a, num_groups, eps);
  2748. ggml_set_name(out, "out");
  2749. return out;
  2750. }
  2751. };
  2752. // GGML_OP_L2_NORM
  2753. struct test_l2_norm : public test_case {
  2754. const ggml_type type;
  2755. const std::array<int64_t, 4> ne;
  2756. const float eps;
  2757. std::string vars() override {
  2758. return VARS_TO_STR2(type, ne);
  2759. }
  2760. test_l2_norm(ggml_type type = GGML_TYPE_F32,
  2761. std::array<int64_t, 4> ne = {64, 64, 320, 1},
  2762. float eps = 1e-12f)
  2763. : type(type), ne(ne), eps(eps) {}
  2764. ggml_tensor * build_graph(ggml_context * ctx) override {
  2765. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  2766. ggml_set_name(a, "a");
  2767. ggml_tensor * out = ggml_l2_norm(ctx, a, eps);
  2768. ggml_set_name(out, "out");
  2769. return out;
  2770. }
  2771. };
  2772. // GGML_OP_ACC
  2773. struct test_acc : public test_case {
  2774. const ggml_type type;
  2775. const std::array<int64_t, 4> ne_a;
  2776. const std::array<int64_t, 4> ne_b;
  2777. std::string vars() override {
  2778. return VARS_TO_STR3(type, ne_a, ne_b);
  2779. }
  2780. test_acc(ggml_type type = GGML_TYPE_F32,
  2781. std::array<int64_t, 4> ne_a = {256, 17, 1, 1},
  2782. std::array<int64_t, 4> ne_b = {256, 16, 1, 1})
  2783. : type(type), ne_a(ne_a), ne_b(ne_b) {}
  2784. ggml_tensor * build_graph(ggml_context * ctx) override {
  2785. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  2786. ggml_set_param(a);
  2787. ggml_set_name(a, "a");
  2788. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne_b.data());
  2789. ggml_set_param(b);
  2790. ggml_set_name(b, "b");
  2791. ggml_tensor * out = ggml_acc(ctx, a, b, a->nb[1], a->nb[2], a->nb[3], b->nb[1]);
  2792. ggml_set_name(out, "out");
  2793. return out;
  2794. }
  2795. };
  2796. // GGML_OP_PAD
  2797. struct test_pad : public test_case {
  2798. const ggml_type type;
  2799. const std::array<int64_t, 4> ne_a;
  2800. const int pad_0;
  2801. const int pad_1;
  2802. std::string vars() override {
  2803. return VARS_TO_STR4(type, ne_a, pad_0, pad_1);
  2804. }
  2805. test_pad(ggml_type type = GGML_TYPE_F32,
  2806. std::array<int64_t, 4> ne_a = {512, 512, 1, 1},
  2807. int pad_0 = 1, int pad_1 = 1)
  2808. : type(type), ne_a(ne_a), pad_0(pad_0), pad_1(pad_1) {}
  2809. ggml_tensor * build_graph(ggml_context * ctx) override {
  2810. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  2811. ggml_set_name(a, "a");
  2812. ggml_tensor * out = ggml_pad(ctx, a, pad_0, pad_1, 0, 0);
  2813. ggml_set_name(out, "out");
  2814. return out;
  2815. }
  2816. };
  2817. // GGML_OP_PAD_REFLECT_1D
  2818. struct test_pad_reflect_1d : public test_case {
  2819. const ggml_type type;
  2820. const std::array<int64_t, 4> ne_a;
  2821. const int pad_0;
  2822. const int pad_1;
  2823. std::string vars() override {
  2824. return VARS_TO_STR4(type, ne_a, pad_0, pad_1);
  2825. }
  2826. test_pad_reflect_1d(ggml_type type = GGML_TYPE_F32,
  2827. std::array<int64_t, 4> ne_a = {512, 34, 2, 1},
  2828. int pad_0 = 10, int pad_1 = 9)
  2829. : type(type), ne_a(ne_a), pad_0(pad_0), pad_1(pad_1) {}
  2830. ggml_tensor * build_graph(ggml_context * ctx) override {
  2831. ggml_tensor * a = ggml_new_tensor(ctx, type, 2, ne_a.data());
  2832. ggml_set_name(a, "a");
  2833. ggml_tensor * out = ggml_pad_reflect_1d(ctx, a, pad_0, pad_1);
  2834. ggml_set_name(out, "out");
  2835. return out;
  2836. }
  2837. };
  2838. // GGML_OP_ARANGE
  2839. struct test_arange : public test_case {
  2840. const ggml_type type;
  2841. const float start;
  2842. const float stop;
  2843. const float step;
  2844. std::string vars() override {
  2845. return VARS_TO_STR4(type, start, stop, step);
  2846. }
  2847. test_arange(ggml_type type = GGML_TYPE_F32,
  2848. float start = 0.f, float stop = 10.f, float step = 1.f)
  2849. : type(type), start(start), stop(stop), step(step) {}
  2850. ggml_tensor * build_graph(ggml_context * ctx) override {
  2851. ggml_tensor * out = ggml_arange(ctx, start, stop, step);
  2852. ggml_set_name(out, "out");
  2853. return out;
  2854. }
  2855. };
  2856. // GGML_OP_TIMESTEP_EMBEDDING
  2857. struct test_timestep_embedding : public test_case {
  2858. const ggml_type type;
  2859. const std::array<int64_t, 4> ne_a;
  2860. const int dim;
  2861. const int max_period;
  2862. std::string vars() override {
  2863. return VARS_TO_STR4(type, ne_a, dim, max_period);
  2864. }
  2865. test_timestep_embedding(ggml_type type = GGML_TYPE_F32,
  2866. std::array<int64_t, 4> ne_a = {2, 1, 1, 1},
  2867. int dim = 320, int max_period=10000)
  2868. : type(type), ne_a(ne_a), dim(dim), max_period(max_period) {}
  2869. ggml_tensor * build_graph(ggml_context * ctx) override {
  2870. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  2871. ggml_set_name(a, "a");
  2872. ggml_tensor * out = ggml_timestep_embedding(ctx, a, dim, max_period);
  2873. ggml_set_name(out, "out");
  2874. return out;
  2875. }
  2876. };
  2877. // GGML_OP_LEAKY_RELU
  2878. struct test_leaky_relu : public test_case {
  2879. const ggml_type type;
  2880. const std::array<int64_t, 4> ne_a;
  2881. const float negative_slope;
  2882. std::string vars() override {
  2883. return VARS_TO_STR3(type, ne_a, negative_slope);
  2884. }
  2885. test_leaky_relu(ggml_type type = GGML_TYPE_F32,
  2886. std::array<int64_t, 4> ne_a = {10, 5, 4, 3},
  2887. float negative_slope = 0.1f)
  2888. : type(type), ne_a(ne_a), negative_slope(negative_slope) {}
  2889. ggml_tensor * build_graph(ggml_context * ctx) override {
  2890. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  2891. ggml_set_name(a, "a");
  2892. ggml_tensor * out = ggml_leaky_relu(ctx, a, negative_slope, true);
  2893. ggml_set_name(out, "out");
  2894. return out;
  2895. }
  2896. };
  2897. // GGML_OP_FLASH_ATTN_EXT
  2898. struct test_flash_attn_ext : public test_case {
  2899. const int64_t hsk; // K head size
  2900. const int64_t hsv; // V head size
  2901. const int64_t nh; // num heads
  2902. const int64_t nr; // repeat in Q, tests for grouped-query attention
  2903. const int64_t kv; // kv size
  2904. const int64_t nb; // batch size
  2905. const bool mask; // use mask
  2906. const float max_bias; // ALiBi
  2907. const float logit_softcap; // Gemma 2
  2908. const ggml_prec prec;
  2909. const ggml_type type_KV;
  2910. std::array<int32_t, 4> permute;
  2911. std::string vars() override {
  2912. return VARS_TO_STR12(hsk, hsv, nh, nr, kv, nb, mask, max_bias, logit_softcap, prec, type_KV, permute);
  2913. }
  2914. double max_nmse_err() override {
  2915. return 5e-4;
  2916. }
  2917. uint64_t op_flops(ggml_tensor * t) override {
  2918. GGML_UNUSED(t);
  2919. // Just counting matmul costs:
  2920. // Q*K^T is nb x hsk x kv, P*V is nb x kv x hsv, per head
  2921. return 2 * nh*nr * nb * (hsk + hsv) * kv;
  2922. }
  2923. test_flash_attn_ext(int64_t hsk = 128, int64_t hsv = 128, int64_t nh = 32, int64_t nr = 1, int64_t kv = 96, int64_t nb = 8,
  2924. bool mask = true, float max_bias = 0.0f, float logit_softcap = 0.0f, ggml_prec prec = GGML_PREC_F32,
  2925. ggml_type type_KV = GGML_TYPE_F16, std::array<int32_t, 4> permute = {0, 1, 2, 3})
  2926. : hsk(hsk), hsv(hsv), nh(nh), nr(nr), kv(kv), nb(nb), mask(mask), max_bias(max_bias), logit_softcap(logit_softcap), prec(prec), type_KV(type_KV), permute(permute) {}
  2927. ggml_tensor * build_graph(ggml_context * ctx) override {
  2928. const int64_t hsk_padded = GGML_PAD(hsk, ggml_blck_size(type_KV));
  2929. const int64_t hsv_padded = GGML_PAD(hsv, ggml_blck_size(type_KV));
  2930. auto const &create_permuted = [&](ggml_type type, int64_t ne0, int64_t ne1, int64_t ne2, int64_t ne3) -> ggml_tensor * {
  2931. int64_t ne[4] = {ne0, ne1, ne2, ne3};
  2932. int64_t ne_perm[4];
  2933. for (int i = 0; i < 4; ++i) {
  2934. ne_perm[permute[i]] = ne[i];
  2935. }
  2936. ggml_tensor * t = ggml_new_tensor_4d(ctx, type, ne_perm[0], ne_perm[1], ne_perm[2], ne_perm[3]);
  2937. if (permute != std::array<int32_t, 4>{0, 1, 2, 3}) {
  2938. t = ggml_permute(ctx, t, permute[0], permute[1], permute[2], permute[3]);
  2939. }
  2940. return t;
  2941. };
  2942. ggml_tensor * q = create_permuted(GGML_TYPE_F32, hsk_padded, nb, nh*nr, 1);
  2943. ggml_set_name(q, "q");
  2944. ggml_tensor * k = create_permuted(type_KV, hsk_padded, kv, nh, 1);
  2945. ggml_set_name(k, "k");
  2946. ggml_tensor * v = create_permuted(type_KV, hsv_padded, kv, nh, 1);
  2947. ggml_set_name(v, "v");
  2948. ggml_tensor * m = nullptr;
  2949. if (mask) {
  2950. m = ggml_new_tensor_4d(ctx, GGML_TYPE_F16, kv, GGML_PAD(nb, GGML_KQ_MASK_PAD), 1, 1);
  2951. ggml_set_name(m, "m");
  2952. }
  2953. ggml_tensor * out = ggml_flash_attn_ext(ctx, q, k, v, m, 1.0f/sqrtf(hsk), max_bias, logit_softcap);
  2954. ggml_flash_attn_ext_set_prec(out, prec);
  2955. ggml_set_name(out, "out");
  2956. return out;
  2957. }
  2958. bool grad_precise() override {
  2959. return true;
  2960. }
  2961. };
  2962. // GGML_OP_CROSS_ENTROPY_LOSS
  2963. struct test_cross_entropy_loss : public test_case {
  2964. const ggml_type type;
  2965. const std::array<int64_t, 4> ne;
  2966. std::string vars() override {
  2967. return VARS_TO_STR2(type, ne);
  2968. }
  2969. test_cross_entropy_loss(ggml_type type = GGML_TYPE_F32,
  2970. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  2971. : type(type), ne(ne) {}
  2972. ggml_tensor * build_graph(ggml_context * ctx) override {
  2973. ggml_tensor * logits = ggml_new_tensor(ctx, type, 4, ne.data());
  2974. ggml_set_param(logits);
  2975. ggml_set_name(logits, "logits");
  2976. ggml_tensor * labels = ggml_new_tensor(ctx, type, 4, ne.data());
  2977. // The labels are assumed to be constant -> no gradients.
  2978. ggml_set_name(labels, "labels");
  2979. // Ensure labels add up to 1:
  2980. labels = ggml_soft_max(ctx, labels);
  2981. ggml_set_name(labels, "labels_normalized");
  2982. ggml_tensor * out = ggml_cross_entropy_loss(ctx, logits, labels);
  2983. ggml_set_name(out, "out");
  2984. return out;
  2985. }
  2986. void initialize_tensors(ggml_context * ctx) override {
  2987. // For larger abs. diffs between logits softmax is more linear, therefore more precise num. gradients.
  2988. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  2989. init_tensor_uniform(t, -100.0f, 100.0f);
  2990. }
  2991. }
  2992. float grad_eps() override {
  2993. return 1.0f;
  2994. }
  2995. bool grad_precise() override {
  2996. return true;
  2997. }
  2998. };
  2999. // GGML_OP_CROSS_ENTROPY_LOSS_BACK
  3000. struct test_cross_entropy_loss_back : public test_case {
  3001. const ggml_type type;
  3002. const std::array<int64_t, 4> ne;
  3003. std::string vars() override {
  3004. return VARS_TO_STR2(type, ne);
  3005. }
  3006. test_cross_entropy_loss_back(ggml_type type = GGML_TYPE_F32,
  3007. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  3008. : type(type), ne(ne) {}
  3009. ggml_tensor * build_graph(ggml_context * ctx) override {
  3010. ggml_tensor * grad = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, 1);
  3011. ggml_set_name(grad, "grad");
  3012. ggml_tensor * logits = ggml_new_tensor(ctx, type, 4, ne.data());
  3013. ggml_set_name(logits, "logits");
  3014. ggml_tensor * labels = ggml_new_tensor(ctx, type, 4, ne.data());
  3015. ggml_set_name(labels, "labels");
  3016. // Ensure labels add up to 1:
  3017. labels = ggml_soft_max(ctx, labels);
  3018. ggml_set_name(labels, "labels_normalized");
  3019. ggml_tensor * out = ggml_cross_entropy_loss_back(ctx, grad, logits, labels);
  3020. ggml_set_name(out, "out");
  3021. return out;
  3022. }
  3023. };
  3024. // GGML_OP_OPT_STEP_ADAMW
  3025. struct test_opt_step_adamw : public test_case {
  3026. const ggml_type type;
  3027. const std::array<int64_t, 4> ne;
  3028. std::string vars() override {
  3029. return VARS_TO_STR2(type, ne);
  3030. }
  3031. test_opt_step_adamw(ggml_type type = GGML_TYPE_F32,
  3032. std::array<int64_t, 4> ne = {10, 5, 4, 3})
  3033. : type(type), ne(ne) {}
  3034. ggml_tensor * build_graph(ggml_context * ctx) override {
  3035. ggml_tensor * a = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  3036. ggml_set_param(a); // Despite tensor a having gradients the output tensor will not.
  3037. ggml_set_name(a, "a");
  3038. ggml_tensor * grad = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  3039. ggml_set_name(grad, "grad");
  3040. ggml_tensor * grad_m = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  3041. ggml_set_name(grad_m, "grad_m");
  3042. ggml_tensor * grad_v = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], ne[2], ne[3]);
  3043. ggml_set_name(grad_v, "grad_v");
  3044. ggml_tensor * adamw_params = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, 7);
  3045. ggml_set_name(adamw_params, "adamw_params");
  3046. ggml_tensor * out = ggml_opt_step_adamw(ctx, a, grad, grad_m, grad_v, adamw_params);
  3047. ggml_set_name(out, "out");
  3048. return out;
  3049. }
  3050. void initialize_tensors(ggml_context * ctx) override {
  3051. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  3052. init_tensor_uniform(t, 0.0f, 1.0f); // grad_v and adamw_params need non-negative values.
  3053. }
  3054. }
  3055. bool grad_precise() override {
  3056. return true;
  3057. }
  3058. };
  3059. enum llm_norm_type {
  3060. LLM_NORM,
  3061. LLM_NORM_RMS,
  3062. };
  3063. struct llama_hparams {
  3064. uint32_t n_vocab;
  3065. uint32_t n_embd;
  3066. uint32_t n_head;
  3067. uint32_t n_head_kv;
  3068. static constexpr uint32_t n_layer = 1;
  3069. uint32_t n_rot;
  3070. uint32_t n_embd_head; // dimension of values (d_v)
  3071. uint32_t n_ff;
  3072. float f_norm_eps;
  3073. float f_norm_rms_eps;
  3074. // cparams
  3075. static constexpr uint32_t n_ctx = 512; // user-specified context size
  3076. static constexpr uint32_t n_ctx_orig = n_ctx;
  3077. // batch
  3078. int32_t n_tokens;
  3079. // llm_build_context
  3080. static constexpr int32_t n_kv = 32; // size of KV cache to consider (n_kv <= n_ctx
  3081. static constexpr int32_t kv_head = 1; // index of where we store new KV data in the cache
  3082. uint32_t n_embd_gqa() const { // dimension of key embeddings across all k-v heads
  3083. return n_embd_head * n_head_kv;
  3084. }
  3085. };
  3086. // LLM base class
  3087. struct test_llm : public test_case {
  3088. llama_hparams hp;
  3089. protected:
  3090. test_llm(llama_hparams hp)
  3091. : hp(std::move(hp)) {
  3092. }
  3093. public:
  3094. struct ggml_tensor * llm_build_norm(
  3095. struct ggml_context * ctx,
  3096. struct ggml_tensor * cur,
  3097. struct ggml_tensor * mw,
  3098. struct ggml_tensor * mb,
  3099. llm_norm_type type) {
  3100. switch (type) {
  3101. case LLM_NORM: cur = ggml_norm (ctx, cur, hp.f_norm_eps); break;
  3102. case LLM_NORM_RMS: cur = ggml_rms_norm(ctx, cur, hp.f_norm_rms_eps); break;
  3103. }
  3104. cur = ggml_mul(ctx, cur, mw);
  3105. if (mb) {
  3106. cur = ggml_add(ctx, cur, mb);
  3107. }
  3108. return cur;
  3109. }
  3110. void llm_build_kv_store(
  3111. struct ggml_context * ctx,
  3112. struct ggml_tensor * k_l,
  3113. struct ggml_tensor * v_l,
  3114. struct ggml_tensor * k_cur,
  3115. struct ggml_tensor * v_cur) {
  3116. // compute the transposed [n_tokens, n_embd] V matrix
  3117. struct ggml_tensor * v_cur_t = ggml_transpose(ctx, ggml_reshape_2d(ctx, v_cur, hp.n_embd_gqa(), hp.n_tokens));
  3118. struct ggml_tensor * k_cache_view = ggml_view_1d(ctx, k_l, hp.n_tokens*hp.n_embd_gqa(),
  3119. (ggml_row_size(k_l->type, hp.n_embd_gqa()))*hp.kv_head);
  3120. struct ggml_tensor * v_cache_view = ggml_view_2d(ctx, v_l, hp.n_tokens, hp.n_embd_gqa(),
  3121. ( hp.n_ctx)*ggml_element_size(v_l),
  3122. (hp.kv_head)*ggml_element_size(v_l));
  3123. // important: storing RoPE-ed version of K in the KV cache!
  3124. ggml_cpy(ctx, k_cur, k_cache_view);
  3125. ggml_cpy(ctx, v_cur_t, v_cache_view);
  3126. }
  3127. struct ggml_tensor * llm_build_kqv(
  3128. struct ggml_context * ctx,
  3129. struct ggml_tensor * k_l,
  3130. struct ggml_tensor * v_l,
  3131. struct ggml_tensor * q_cur,
  3132. struct ggml_tensor * kq_mask,
  3133. float kq_scale) {
  3134. struct ggml_tensor * q = ggml_permute(ctx, q_cur, 0, 2, 1, 3);
  3135. struct ggml_tensor * k =
  3136. ggml_view_3d(ctx, k_l,
  3137. hp.n_embd_head, hp.n_kv, hp.n_head_kv,
  3138. ggml_row_size(k_l->type, hp.n_embd_gqa()),
  3139. ggml_row_size(k_l->type, hp.n_embd_head),
  3140. 0);
  3141. struct ggml_tensor * kq = ggml_mul_mat(ctx, k, q);
  3142. kq = ggml_soft_max_ext(ctx, kq, kq_mask, kq_scale, 0.0f);
  3143. // split cached v into n_head heads
  3144. struct ggml_tensor * v =
  3145. ggml_view_3d(ctx, v_l,
  3146. hp.n_kv, hp.n_embd_head, hp.n_head_kv,
  3147. ggml_element_size(v_l)*hp.n_ctx,
  3148. ggml_element_size(v_l)*hp.n_ctx*hp.n_embd_head,
  3149. 0);
  3150. struct ggml_tensor * kqv = ggml_mul_mat(ctx, v, kq);
  3151. struct ggml_tensor * kqv_merged = ggml_permute(ctx, kqv, 0, 2, 1, 3);
  3152. struct ggml_tensor * cur = ggml_cont_2d(ctx, kqv_merged, hp.n_embd_head*hp.n_head, hp.n_tokens);
  3153. struct ggml_tensor * wo = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd);
  3154. cur = ggml_mul_mat(ctx, wo, cur);
  3155. return cur;
  3156. }
  3157. void initialize_tensors(ggml_context * ctx) override {
  3158. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  3159. if (t->type == GGML_TYPE_I32) {
  3160. // pos
  3161. std::vector<int> data(hp.n_tokens);
  3162. for (int i = 0; i < hp.n_tokens; i++) {
  3163. data[i] = rand() % hp.n_ctx;
  3164. }
  3165. ggml_backend_tensor_set(t, data.data(), 0, hp.n_tokens * sizeof(int));
  3166. } else {
  3167. init_tensor_uniform(t);
  3168. }
  3169. }
  3170. }
  3171. };
  3172. // Llama
  3173. struct test_llama : public test_llm {
  3174. static constexpr float freq_base = 10000.0f;
  3175. static constexpr float freq_scale = 1.0f;
  3176. static constexpr float ext_factor = 0.0f;
  3177. static constexpr float attn_factor = 1.0f;
  3178. static constexpr float beta_fast = 32.0f;
  3179. static constexpr float beta_slow = 1.0f;
  3180. bool fused;
  3181. std::string op_desc(ggml_tensor * t) override {
  3182. GGML_UNUSED(t);
  3183. return "LLAMA";
  3184. }
  3185. std::string vars() override {
  3186. auto n_tokens = hp.n_tokens;
  3187. return VARS_TO_STR1(n_tokens);
  3188. }
  3189. double max_nmse_err() override {
  3190. return 2e-3;
  3191. }
  3192. bool run_whole_graph() override { return fused; }
  3193. test_llama(int n_tokens = 1, bool fused = false)
  3194. : test_llm({
  3195. /*n_vocab =*/ 32000,
  3196. /*n_embd =*/ 3200,
  3197. /*n_head =*/ 32,
  3198. /*n_head_kv =*/ 32,
  3199. /*n_rot =*/ 100,
  3200. /*n_embd_head =*/ 100,
  3201. /*n_ff =*/ 8640,
  3202. /*f_norm_eps =*/ 0.f,
  3203. /*f_norm_rms_eps =*/ 1e-5f,
  3204. /*n_tokens =*/ n_tokens,
  3205. })
  3206. , fused(fused)
  3207. {
  3208. }
  3209. ggml_tensor * build_graph(ggml_context * ctx) override {
  3210. struct ggml_tensor * cur;
  3211. struct ggml_tensor * inpL;
  3212. inpL = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, hp.n_embd, hp.n_tokens);
  3213. // inp_pos - contains the positions
  3214. struct ggml_tensor * inp_pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, hp.n_tokens);
  3215. // KQ_mask (mask for 1 head, it will be broadcasted to all heads)
  3216. struct ggml_tensor * KQ_mask = ggml_new_tensor_3d(ctx, GGML_TYPE_F16, hp.n_kv, hp.n_tokens, 1);
  3217. ggml_tensor * k_l = ggml_new_tensor_1d(ctx, GGML_TYPE_F16, 1638400);
  3218. ggml_tensor * v_l = ggml_new_tensor_1d(ctx, GGML_TYPE_F16, 1638400);
  3219. for (uint32_t il = 0; il < hp.n_layer; ++il) {
  3220. struct ggml_tensor * inpSA = inpL;
  3221. // norm
  3222. ggml_tensor * attn_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  3223. cur = llm_build_norm(ctx, inpL, attn_norm, nullptr, LLM_NORM_RMS);
  3224. // self-attention
  3225. {
  3226. ggml_tensor * wq = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd);
  3227. ggml_tensor * wk = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd_gqa());
  3228. ggml_tensor * wv = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd_gqa());
  3229. // compute Q and K and RoPE them
  3230. struct ggml_tensor * Qcur = ggml_mul_mat(ctx, wq, cur);
  3231. struct ggml_tensor * Kcur = ggml_mul_mat(ctx, wk, cur);
  3232. struct ggml_tensor * Vcur = ggml_mul_mat(ctx, wv, cur);
  3233. Qcur = ggml_rope_ext(
  3234. ctx, ggml_reshape_3d(ctx, Qcur, hp.n_embd_head, hp.n_head, hp.n_tokens), inp_pos, nullptr,
  3235. hp.n_rot, 0, hp.n_ctx_orig, freq_base, freq_scale,
  3236. ext_factor, attn_factor, beta_fast, beta_slow
  3237. );
  3238. Kcur = ggml_rope_ext(
  3239. ctx, ggml_reshape_3d(ctx, Kcur, hp.n_embd_head, hp.n_head_kv, hp.n_tokens), inp_pos, nullptr,
  3240. hp.n_rot, 0, hp.n_ctx_orig, freq_base, freq_scale,
  3241. ext_factor, attn_factor, beta_fast, beta_slow
  3242. );
  3243. llm_build_kv_store(ctx, k_l, v_l, Kcur, Vcur);
  3244. cur = llm_build_kqv(ctx, k_l, v_l, Qcur, KQ_mask, 1.0f/sqrtf(float(hp.n_embd_head)));
  3245. }
  3246. struct ggml_tensor * ffn_inp = ggml_add(ctx, cur, inpSA);
  3247. // feed-forward network
  3248. ggml_tensor * ffn_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  3249. cur = llm_build_norm(ctx, ffn_inp, ffn_norm, nullptr, LLM_NORM_RMS);
  3250. ggml_tensor * ffn_gate = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_ff);
  3251. ggml_tensor * ffn_down = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_ff, hp.n_embd);
  3252. ggml_tensor * ffn_up = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_ff);
  3253. struct ggml_tensor * tmp = ggml_mul_mat(ctx, ffn_up, cur);
  3254. cur = ggml_mul_mat(ctx, ffn_gate, cur);
  3255. cur = ggml_silu(ctx, cur);
  3256. cur = ggml_mul(ctx, cur, tmp);
  3257. cur = ggml_mul_mat(ctx, ffn_down, cur);
  3258. cur = ggml_add(ctx, cur, ffn_inp);
  3259. // input for next layer
  3260. inpL = cur;
  3261. }
  3262. cur = inpL;
  3263. ggml_tensor * output_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  3264. cur = llm_build_norm(ctx, cur, output_norm, nullptr, LLM_NORM_RMS);
  3265. // lm_head
  3266. ggml_tensor * output = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_vocab);
  3267. cur = ggml_mul_mat(ctx, output, cur);
  3268. return cur;
  3269. }
  3270. };
  3271. // Falcon
  3272. struct test_falcon : public test_llm {
  3273. static constexpr float freq_base = 10000.0f;
  3274. static constexpr float freq_scale = 1.0f;
  3275. static constexpr float ext_factor = 0.0f;
  3276. static constexpr float attn_factor = 1.0f;
  3277. static constexpr float beta_fast = 32.0f;
  3278. static constexpr float beta_slow = 1.0f;
  3279. std::string op_desc(ggml_tensor * t) override {
  3280. GGML_UNUSED(t);
  3281. return "FALCON";
  3282. }
  3283. std::string vars() override {
  3284. auto n_tokens = hp.n_tokens;
  3285. return VARS_TO_STR1(n_tokens);
  3286. }
  3287. double max_nmse_err() override {
  3288. return 2e-3;
  3289. }
  3290. test_falcon(int n_tokens = 1)
  3291. : test_llm({
  3292. /*n_vocab =*/ 32000,
  3293. /*n_embd =*/ 3200,
  3294. /*n_head =*/ 50,
  3295. /*n_head_kv =*/ 1,
  3296. /*n_rot =*/ 64,
  3297. /*n_embd_head =*/ 64,
  3298. /*n_ff =*/ 8640,
  3299. /*f_norm_eps =*/ 1e-5f,
  3300. /*f_norm_rms_eps =*/ 0.f,
  3301. /*n_tokens =*/ n_tokens,
  3302. }) {
  3303. }
  3304. ggml_tensor * build_graph(ggml_context * ctx) override {
  3305. struct ggml_tensor * cur;
  3306. struct ggml_tensor * inpL;
  3307. inpL = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, hp.n_embd, hp.n_tokens);
  3308. // inp_pos - contains the positions
  3309. struct ggml_tensor * inp_pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, hp.n_tokens);
  3310. // KQ_mask (mask for 1 head, it will be broadcasted to all heads)
  3311. struct ggml_tensor * KQ_mask = ggml_new_tensor_3d(ctx, GGML_TYPE_F16, hp.n_kv, hp.n_tokens, 1);
  3312. ggml_tensor * k_l = ggml_new_tensor_1d(ctx, GGML_TYPE_F16, 1638400);
  3313. ggml_tensor * v_l = ggml_new_tensor_1d(ctx, GGML_TYPE_F16, 1638400);
  3314. for (uint32_t il = 0; il < hp.n_layer; ++il) {
  3315. // norm
  3316. ggml_tensor * attn_norm_w = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  3317. ggml_tensor * attn_norm_b = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  3318. ggml_tensor * attn_norm = llm_build_norm(ctx, inpL, attn_norm_w, attn_norm_b, LLM_NORM);
  3319. // self-attention
  3320. {
  3321. cur = attn_norm;
  3322. ggml_tensor * wqkv = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd + 2*hp.n_embd_gqa());
  3323. cur = ggml_mul_mat(ctx, wqkv, cur);
  3324. 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)));
  3325. 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)));
  3326. 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())));
  3327. Qcur = ggml_reshape_3d(ctx, Qcur, hp.n_embd_head, hp.n_head, hp.n_tokens);
  3328. Kcur = ggml_reshape_3d(ctx, Kcur, hp.n_embd_head, hp.n_head_kv, hp.n_tokens);
  3329. // using mode = 2 for neox mode
  3330. Qcur = ggml_rope_ext(
  3331. ctx, Qcur, inp_pos, nullptr, hp.n_rot, 2, hp.n_ctx_orig,
  3332. freq_base, freq_scale, ext_factor, attn_factor, beta_fast, beta_slow
  3333. );
  3334. Kcur = ggml_rope_ext(
  3335. ctx, Kcur, inp_pos, nullptr, hp.n_rot, 2, hp.n_ctx_orig,
  3336. freq_base, freq_scale, ext_factor, attn_factor, beta_fast, beta_slow
  3337. );
  3338. llm_build_kv_store(ctx, k_l, v_l, Kcur, Vcur);
  3339. cur = llm_build_kqv(ctx, k_l, v_l, Qcur, KQ_mask, 1.0f/sqrtf(float(hp.n_embd_head)));
  3340. }
  3341. struct ggml_tensor * ffn_inp = cur;
  3342. // feed forward
  3343. {
  3344. ggml_tensor * ffn_up = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_ff);
  3345. ggml_tensor * ffn_down = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_ff, hp.n_embd);
  3346. cur = attn_norm;
  3347. cur = ggml_mul_mat(ctx, ffn_up, cur);
  3348. cur = ggml_gelu(ctx, cur);
  3349. cur = ggml_mul_mat(ctx, ffn_down, cur);
  3350. }
  3351. cur = ggml_add(ctx, cur, ffn_inp);
  3352. cur = ggml_add(ctx, cur, inpL);
  3353. // input for next layer
  3354. inpL = cur;
  3355. }
  3356. cur = inpL;
  3357. ggml_tensor * output_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  3358. ggml_tensor * output_norm_b = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  3359. cur = llm_build_norm(ctx, cur, output_norm, output_norm_b, LLM_NORM);
  3360. // lm_head
  3361. ggml_tensor * output = ggml_new_tensor_2d(ctx, GGML_TYPE_Q8_0, hp.n_embd, hp.n_vocab);
  3362. cur = ggml_mul_mat(ctx, output, cur);
  3363. return cur;
  3364. }
  3365. };
  3366. // ###########################################
  3367. // ## Section 3: GGML Op Test Instantiation ##
  3368. // ###########################################
  3369. static const ggml_type all_types[] = {
  3370. GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_BF16,
  3371. GGML_TYPE_Q4_0, GGML_TYPE_Q4_1,
  3372. GGML_TYPE_Q5_0, GGML_TYPE_Q5_1,
  3373. GGML_TYPE_Q8_0,
  3374. GGML_TYPE_Q2_K, GGML_TYPE_Q3_K,
  3375. GGML_TYPE_Q4_K, GGML_TYPE_Q5_K,
  3376. GGML_TYPE_Q6_K,
  3377. // GGML_TYPE_TQ1_0, GGML_TYPE_TQ2_0, // TODO: implement for all backends
  3378. GGML_TYPE_IQ2_XXS, GGML_TYPE_IQ2_XS, GGML_TYPE_IQ2_S,
  3379. GGML_TYPE_IQ3_XXS, GGML_TYPE_IQ1_S, GGML_TYPE_IQ1_M,
  3380. GGML_TYPE_IQ4_NL, GGML_TYPE_IQ3_S, GGML_TYPE_IQ4_XS,
  3381. };
  3382. static const ggml_type base_types[] = {
  3383. GGML_TYPE_F32, GGML_TYPE_F16,
  3384. GGML_TYPE_Q8_0, // for I8MM tests
  3385. GGML_TYPE_Q4_0,
  3386. GGML_TYPE_Q4_1, // for I8MM tests
  3387. GGML_TYPE_Q4_K,
  3388. GGML_TYPE_IQ2_XXS
  3389. };
  3390. static const ggml_type other_types[] = {
  3391. GGML_TYPE_Q4_1,
  3392. GGML_TYPE_Q5_0, GGML_TYPE_Q5_1,
  3393. GGML_TYPE_Q8_0,
  3394. GGML_TYPE_Q2_K, GGML_TYPE_Q3_K,
  3395. GGML_TYPE_Q5_K,
  3396. GGML_TYPE_Q6_K,
  3397. // GGML_TYPE_TQ1_0, GGML_TYPE_TQ2_0, // TODO: implement for all backends
  3398. GGML_TYPE_IQ2_XS, GGML_TYPE_IQ2_S,
  3399. GGML_TYPE_IQ3_XXS, GGML_TYPE_IQ1_S, GGML_TYPE_IQ1_M,
  3400. GGML_TYPE_IQ4_NL, GGML_TYPE_IQ3_S, GGML_TYPE_IQ4_XS,
  3401. GGML_TYPE_BF16,
  3402. };
  3403. // Test cases for evaluation: should try to cover edge cases while using small input sizes to keep the runtime low
  3404. static std::vector<std::unique_ptr<test_case>> make_test_cases_eval() {
  3405. std::vector<std::unique_ptr<test_case>> test_cases;
  3406. std::default_random_engine rng(0);
  3407. // unary ops
  3408. for (ggml_type type : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  3409. for (int v : {0, 1}) {
  3410. for (int op = 0; op < GGML_UNARY_OP_COUNT; op++) {
  3411. test_cases.emplace_back(new test_unary((ggml_unary_op) op, type, { 128, 2, 2, 2 }, v));
  3412. test_cases.emplace_back(new test_unary((ggml_unary_op) op, type, { 5, 7, 11, 13 }, v));
  3413. }
  3414. }
  3415. }
  3416. // glu ops
  3417. for (ggml_type type : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  3418. for (int v : {0, 1}) {
  3419. for (int op = 0; op < GGML_GLU_OP_COUNT; op++) {
  3420. for (bool swapped : {false, true}) {
  3421. test_cases.emplace_back(new test_glu((ggml_glu_op) op, type, { 128, 2, 2, 2 }, v, swapped));
  3422. test_cases.emplace_back(new test_glu((ggml_glu_op) op, type, { 5, 7, 11, 13 }, v, swapped));
  3423. }
  3424. test_cases.emplace_back(new test_glu_split((ggml_glu_op) op, type, { 128, 2, 2, 2 }, v));
  3425. test_cases.emplace_back(new test_glu_split((ggml_glu_op) op, type, { 5, 7, 11, 13 }, v));
  3426. }
  3427. }
  3428. }
  3429. test_cases.emplace_back(new test_get_rows(GGML_TYPE_F32, 1, 8, 2, 1, false));
  3430. for (ggml_type type : all_types) {
  3431. for (int b : {1, 7}) {
  3432. for (bool v : {false, true}) {
  3433. test_cases.emplace_back(new test_get_rows(type, 256, 5, 4, b, v));
  3434. }
  3435. }
  3436. }
  3437. for (int b : {1, 7}) {
  3438. for (bool v : {false, true}) {
  3439. test_cases.emplace_back(new test_get_rows(GGML_TYPE_I32, 256, 5, 4, b, v));
  3440. }
  3441. }
  3442. test_cases.emplace_back(new test_get_rows_back(GGML_TYPE_F32, 1, 8, 2, 1, false));
  3443. for (ggml_type type : all_types) {
  3444. for (bool v : {false, true}) {
  3445. test_cases.emplace_back(new test_get_rows_back(type, 256, 5, 4, 1, v));
  3446. }
  3447. }
  3448. for (bool v : {false, true}) {
  3449. test_cases.emplace_back(new test_get_rows_back(GGML_TYPE_I32, 256, 5, 4, 1, v));
  3450. }
  3451. test_cases.emplace_back(new test_set_rows(GGML_TYPE_F32, { 1, 8, 1, 3 }, { 1, 1 }, 2, false));
  3452. for (ggml_type type : all_types) {
  3453. for (int b : {1, 7}) {
  3454. for (bool v : {false, true}) {
  3455. test_cases.emplace_back(new test_set_rows(type, { 256, 5, b, 3 }, { 1, 1, }, 1, v));
  3456. test_cases.emplace_back(new test_set_rows(type, { 256, 11, 1, b }, { 2, 3, }, 7, v));
  3457. test_cases.emplace_back(new test_set_rows(type, { 3*ggml_blck_size(type), 3, b, 1 }, { 2, 3, }, 2, v));
  3458. if (ggml_blck_size(type) == 1) {
  3459. test_cases.emplace_back(new test_set_rows(type, { 31, 3, b, 1 }, { 2, 3, }, 2, v));
  3460. test_cases.emplace_back(new test_set_rows(type, { 33, 5, 1, b }, { 2, 3, }, 1, v));
  3461. }
  3462. }
  3463. }
  3464. }
  3465. for (ggml_type type_input : {GGML_TYPE_F32}) {
  3466. for (ggml_op_pool pool_type : {GGML_OP_POOL_AVG, GGML_OP_POOL_MAX}) {
  3467. for (int k0 : {1, 3}) {
  3468. for (int k1 : {1, 3}) {
  3469. for (int s0 : {1, 2}) {
  3470. for (int s1 : {1, 2}) {
  3471. for (int p0 : {0, 1}) {
  3472. for (int p1 : {0, 1}) {
  3473. test_cases.emplace_back(new test_pool2d(pool_type, type_input, {10, 10, 3, 1}, k0, k1, s0, s1, p0, p1));
  3474. }
  3475. }
  3476. }
  3477. }
  3478. }
  3479. }
  3480. }
  3481. }
  3482. // im2col 1D
  3483. 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));
  3484. 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));
  3485. 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));
  3486. for (int s0 : {1, 3}) {
  3487. for (int p0 : {0, 3}) {
  3488. for (int d0 : {1, 3}) {
  3489. test_cases.emplace_back(new test_im2col(
  3490. GGML_TYPE_F32, GGML_TYPE_F32, GGML_TYPE_F32, {20, 2, 2, 1}, {3, 2, 2, 1},
  3491. s0, 0, p0, 0, d0, 0, false));
  3492. }
  3493. }
  3494. }
  3495. // im2col 2D
  3496. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F32, GGML_TYPE_F32));
  3497. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F32));
  3498. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16));
  3499. for (int s0 : {1, 3}) {
  3500. for (int s1 : {1, 3}) {
  3501. for (int p0 : {0, 3}) {
  3502. for (int p1 : {0, 3}) {
  3503. for (int d0 : {1, 3}) {
  3504. for (int d1 : {1, 3}) {
  3505. test_cases.emplace_back(new test_im2col(
  3506. GGML_TYPE_F32, GGML_TYPE_F32, GGML_TYPE_F32, {20, 20, 2, 2}, {3, 3, 2, 2},
  3507. s0, s1, p0, p1, d0, d1, true));
  3508. }
  3509. }
  3510. }
  3511. }
  3512. }
  3513. }
  3514. // extra tests for im2col 2D
  3515. 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));
  3516. 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));
  3517. 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));
  3518. 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));
  3519. 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));
  3520. 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));
  3521. 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));
  3522. 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));
  3523. // sycl backend will limit task global_range < MAX_INT
  3524. // test cases for 2D im2col with large input W and H (occurs in stable-diffusion)
  3525. // however these cases need to alloc more memory which may fail in some devices (Intel Arc770, etc.)
  3526. // these cases are verified (pass) in Intel(R) Data Center GPU Max 1100 (sycl backend) and NV A30 (cuda backend)
  3527. // 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));
  3528. // 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));
  3529. test_cases.emplace_back(new test_conv_2d_dw({17, 34, 9, 1}, {3, 3, 1, 9}, 1, 0, 1, false));
  3530. test_cases.emplace_back(new test_conv_2d_dw({17, 34, 9, 1}, {3, 3, 1, 9}, 1, 0, 1, true));
  3531. test_cases.emplace_back(new test_conv_2d_dw({32, 8, 64, 1}, {3, 3, 1, 64}, 2, 1, 1, false));
  3532. test_cases.emplace_back(new test_conv_2d_dw({32, 8, 64, 1}, {3, 3, 1, 64}, 2, 1, 1, true));
  3533. for(uint32_t Cout : {1, 9}){
  3534. for(uint32_t Cin : {1, 7}){
  3535. for(uint32_t K : {1, 3, 1337}){
  3536. for(uint32_t L : {1, 2, 13}){
  3537. for(uint32_t s0: {1, 2, 3}){
  3538. test_cases.emplace_back(new test_conv_transpose_1d({L,Cin,1,1}, {K,Cout,Cin,1}, s0, 0, 1));
  3539. }
  3540. }
  3541. }
  3542. }
  3543. }
  3544. test_cases.emplace_back(new test_conv_transpose_1d());
  3545. test_cases.emplace_back(new test_conv_transpose_1d({3,2,1,1}, {2,3,2,1}, 3, 0, 1));
  3546. test_cases.emplace_back(new test_conv_transpose_1d({3,2,1,1}, {2,3,2,1}, 2, 0, 1));
  3547. test_cases.emplace_back(new test_conv_transpose_1d({3,2,1,1}, {2,3,2,1}, 1, 0, 1));
  3548. test_cases.emplace_back(new test_conv_transpose_1d({3,2,1,1}, {3,2,2,1}, 2, 0, 1));
  3549. test_cases.emplace_back(new test_conv_transpose_1d({3,2,1,1}, {3,2,2,1}, 1, 0, 1));
  3550. test_cases.emplace_back(new test_conv_transpose_1d({3,2,1,1}, {3,1,2,1}, 1, 0, 1));
  3551. test_cases.emplace_back(new test_conv_transpose_1d({2,1,1,1}, {3,1,1,1}, 1, 0, 1));
  3552. test_cases.emplace_back(new test_conv_transpose_2d({3, 2, 3, 1}, {2, 2, 1, 3}, 1));
  3553. test_cases.emplace_back(new test_conv_transpose_2d({10, 10, 9, 1}, {3, 3, 1, 9}, 2));
  3554. test_cases.emplace_back(new test_count_equal(GGML_TYPE_F32, {4, 500, 1, 1}));
  3555. test_cases.emplace_back(new test_count_equal(GGML_TYPE_F32, {4, 5000, 1, 1}));
  3556. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {32, 1, 1, 1}));
  3557. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {100, 10, 1, 1}));
  3558. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {1024, 10, 1, 1}));
  3559. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {1024, 12, 1, 1}));
  3560. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {2000, 10, 1, 1}));
  3561. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {5438, 3, 1, 1}));
  3562. for (int ne3 : {1, 3}) { // CUDA backward pass only supports ne3 == 1
  3563. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 5, 4, ne3}, {1, 1, 1, 1}));
  3564. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 5, 4, ne3}, {2, 1, 1, 1}));
  3565. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 5, 4, ne3}, {1, 2, 1, 1}));
  3566. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 5, 4, ne3}, {1, 1, 2, 1}));
  3567. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 5, 4, ne3}, {1, 1, 1, 2}));
  3568. test_cases.emplace_back(new test_repeat(GGML_TYPE_I32, {10, 5, 4, ne3}, {2, 1, 1, 1}));
  3569. test_cases.emplace_back(new test_repeat(GGML_TYPE_I16, {10, 5, 4, ne3}, {1, 1, 1, 2}));
  3570. }
  3571. for (bool view : {false, true}) {
  3572. test_cases.emplace_back(new test_repeat_back(GGML_TYPE_F32, {8, 6, 4, 2}, {1, 1, 1, 1}, view));
  3573. test_cases.emplace_back(new test_repeat_back(GGML_TYPE_F32, {8, 6, 4, 2}, {2, 1, 1, 1}, view));
  3574. test_cases.emplace_back(new test_repeat_back(GGML_TYPE_F32, {8, 6, 4, 2}, {1, 2, 1, 1}, view));
  3575. test_cases.emplace_back(new test_repeat_back(GGML_TYPE_F32, {8, 6, 4, 2}, {1, 1, 2, 1}, view));
  3576. test_cases.emplace_back(new test_repeat_back(GGML_TYPE_F32, {8, 6, 4, 2}, {1, 1, 1, 2}, view));
  3577. }
  3578. test_cases.emplace_back(new test_dup(GGML_TYPE_F32));
  3579. test_cases.emplace_back(new test_dup(GGML_TYPE_F16));
  3580. test_cases.emplace_back(new test_dup(GGML_TYPE_I32));
  3581. test_cases.emplace_back(new test_dup(GGML_TYPE_I16));
  3582. test_cases.emplace_back(new test_dup(GGML_TYPE_F32, {10, 10, 5, 1}, {0, 2, 1, 3}));
  3583. test_cases.emplace_back(new test_dup(GGML_TYPE_F16, {10, 10, 5, 1}, {0, 2, 1, 3})); // dup by rows
  3584. test_cases.emplace_back(new test_dup(GGML_TYPE_F32, {10, 10, 5, 1}, {1, 0, 2, 3}));
  3585. test_cases.emplace_back(new test_dup(GGML_TYPE_F16, {10, 10, 5, 1}, {1, 0, 2, 3})); // dup dst not-contiguous
  3586. test_cases.emplace_back(new test_dup(GGML_TYPE_I16, {10, 8, 3, 1}, {0, 2, 1, 3}));
  3587. test_cases.emplace_back(new test_dup(GGML_TYPE_I16, {10, 8, 3, 1}, {1, 2, 0, 3}));
  3588. for (int dim = 1; dim < GGML_MAX_DIMS; ++dim) {
  3589. test_cases.emplace_back(new test_set(GGML_TYPE_F32, GGML_TYPE_F32, {6, 5, 4, 3}, dim));
  3590. }
  3591. for (int dim = 1; dim < GGML_MAX_DIMS; ++dim) {
  3592. test_cases.emplace_back(new test_set(GGML_TYPE_I32, GGML_TYPE_I32, {6, 5, 4, 3}, dim));
  3593. }
  3594. // same-type copy
  3595. for (ggml_type type : all_types) {
  3596. const auto nk = ggml_blck_size(type);
  3597. for (int k = 1; k < 4; ++k) {
  3598. test_cases.emplace_back(new test_cpy(type, type, {k*nk, 2, 3, 4}));
  3599. test_cases.emplace_back(new test_cpy(type, type, {k*nk, 2, 3, 4}, {0, 2, 1, 3}));
  3600. test_cases.emplace_back(new test_cpy(type, type, {k*nk, 2, 3, 4}, {0, 3, 1, 2}, {0, 2, 1, 3}));
  3601. }
  3602. }
  3603. for (ggml_type type_src : {GGML_TYPE_F16, GGML_TYPE_BF16, GGML_TYPE_F32}) {
  3604. for (ggml_type type_dst : all_types) {
  3605. test_cases.emplace_back(new test_cpy(type_src, type_dst, {256, 4, 4, 4}));
  3606. test_cases.emplace_back(new test_cpy(type_src, type_dst, {256, 2, 3, 4}, {0, 2, 1, 3})); // cpy by rows
  3607. }
  3608. }
  3609. for (ggml_type type_src : all_types) {
  3610. for (ggml_type type_dst : {GGML_TYPE_F32}) {
  3611. test_cases.emplace_back(new test_cpy(type_src, type_dst, {256, 4, 4, 4}));
  3612. test_cases.emplace_back(new test_cpy(type_src, type_dst, {256, 2, 3, 4}, {0, 2, 1, 3})); // cpy by rows
  3613. }
  3614. }
  3615. for (ggml_type type_src : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  3616. for (ggml_type type_dst : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  3617. test_cases.emplace_back(new test_cpy(type_src, type_dst, {256, 2, 3, 4}, {1, 0, 2, 3})); // cpy not-contiguous
  3618. }
  3619. }
  3620. test_cases.emplace_back(new test_cont());
  3621. test_cases.emplace_back(new test_cont(GGML_TYPE_F32, {2, 1, 1 ,1}));
  3622. test_cases.emplace_back(new test_cont(GGML_TYPE_F32, {2, 1, 3 ,5}));
  3623. test_cases.emplace_back(new test_cont(GGML_TYPE_F32, {2, 3, 5 ,7}));
  3624. test_cases.emplace_back(new test_cont(GGML_TYPE_F16, {2, 1, 1 ,1}));
  3625. test_cases.emplace_back(new test_cont(GGML_TYPE_F16, {2, 1, 3 ,5}));
  3626. test_cases.emplace_back(new test_cont(GGML_TYPE_F16, {2, 3, 5 ,7}));
  3627. test_cases.emplace_back(new test_cont(GGML_TYPE_BF16, {2, 1, 1 ,1}));
  3628. test_cases.emplace_back(new test_cont(GGML_TYPE_BF16, {2, 1, 3 ,5}));
  3629. test_cases.emplace_back(new test_cont(GGML_TYPE_BF16, {2, 3, 5 ,7}));
  3630. auto add_test_bin_bcast = [&](ggml_type type, std::array<int64_t, 4> ne, std::array<int, 4> nr) {
  3631. for (auto op : {ggml_add, ggml_sub, ggml_mul, ggml_div}) {
  3632. test_cases.emplace_back(new test_bin_bcast(op, type, ne, nr));
  3633. }
  3634. };
  3635. for (ggml_type type : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  3636. add_test_bin_bcast(type, {1, 1, 8, 1}, {1, 1, 1, 1});
  3637. add_test_bin_bcast(type, {1, 1, 1, 1}, {32, 1, 1, 1});
  3638. add_test_bin_bcast(type, {1, 1, 320, 320}, {1, 1, 1, 1});
  3639. add_test_bin_bcast(type, {10, 5, 1, 1}, {1, 1, 1, 1});
  3640. add_test_bin_bcast(type, {10, 5, 4, 1}, {1, 1, 1, 1});
  3641. add_test_bin_bcast(type, {10, 5, 4, 3}, {1, 1, 1, 1});
  3642. add_test_bin_bcast(type, {10, 5, 4, 3}, {2, 1, 1, 1});
  3643. add_test_bin_bcast(type, {10, 5, 4, 3}, {1, 2, 1, 1});
  3644. add_test_bin_bcast(type, {10, 5, 4, 3}, {1, 1, 2, 1});
  3645. add_test_bin_bcast(type, {10, 5, 4, 3}, {1, 1, 1, 2});
  3646. add_test_bin_bcast(type, {10, 5, 4, 3}, {1, 1, 2, 2});
  3647. add_test_bin_bcast(type, {10, 5, 4, 3}, {1, 2, 2, 2});
  3648. add_test_bin_bcast(type, {10, 5, 4, 3}, {2, 2, 2, 2});
  3649. // stable diffusion
  3650. add_test_bin_bcast(type, {1280, 1, 1, 1}, {1, 1, 1, 1});
  3651. add_test_bin_bcast(type, {1280, 1, 1, 1}, {1, 16, 16, 1});
  3652. add_test_bin_bcast(type, {1280, 16, 16, 1}, {1, 1, 1, 1});
  3653. add_test_bin_bcast(type, {1280, 1, 1, 1}, {1, 256, 1, 1});
  3654. add_test_bin_bcast(type, {1, 1, 1280, 1}, {16, 16, 1, 1});
  3655. add_test_bin_bcast(type, {16, 16, 1280, 1}, {1, 1, 1, 1});
  3656. add_test_bin_bcast(type, {1, 1, 1920, 1}, {16, 16, 1, 1});
  3657. add_test_bin_bcast(type, {1, 1, 2560, 1}, {16, 16, 1, 1});
  3658. add_test_bin_bcast(type, {1, 1, 1280, 1}, {32, 32, 1, 1});
  3659. add_test_bin_bcast(type, {1, 1, 1920, 1}, {32, 32, 1, 1});
  3660. add_test_bin_bcast(type, {1, 1, 640, 1}, {32, 32, 1, 1});
  3661. add_test_bin_bcast(type, {5120, 1, 1, 1}, {1, 256, 1, 1});
  3662. add_test_bin_bcast(type, {640, 1, 1, 1}, {1, 1, 1, 1});
  3663. //add_test_bin_bcast(type, {3, 3, 2560, 1280}, {1, 1, 1, 1});
  3664. //add_test_bin_bcast(type, {3, 3, 2560, 1280}, {2, 1, 1, 1});
  3665. }
  3666. test_cases.emplace_back(new test_add1());
  3667. test_cases.emplace_back(new test_scale());
  3668. test_cases.emplace_back(new test_silu_back());
  3669. for (float eps : {0.0f, 1e-6f, 1e-4f, 1e-1f}) {
  3670. for (bool v : {false, true}) {
  3671. test_cases.emplace_back(new test_norm (GGML_TYPE_F32, {64, 5, 4, 3}, v, eps));
  3672. test_cases.emplace_back(new test_rms_norm(GGML_TYPE_F32, {64, 5, 4, 3}, v, eps));
  3673. }
  3674. test_cases.emplace_back(new test_rms_norm_back(GGML_TYPE_F32, {64, 5, 4, 3}, eps));
  3675. test_cases.emplace_back(new test_l2_norm (GGML_TYPE_F32, {64, 5, 4, 3}, eps));
  3676. }
  3677. for (float eps : {0.0f, 1e-6f, 1e-4f, 1e-1f}) {
  3678. test_cases.emplace_back(new test_rms_norm_mul(GGML_TYPE_F32, {64, 5, 4, 3}, eps));
  3679. }
  3680. test_cases.emplace_back(new test_l2_norm(GGML_TYPE_F32, {64, 5, 4, 3}, 1e-12f));
  3681. test_cases.emplace_back(new test_ssm_conv(GGML_TYPE_F32, {4, 1536, 1, 1}, {4, 1536, 1, 1}));
  3682. test_cases.emplace_back(new test_ssm_conv(GGML_TYPE_F32, {8, 1536, 1, 1}, {4, 1536, 1, 1}));
  3683. test_cases.emplace_back(new test_ssm_conv(GGML_TYPE_F32, {4, 1536, 4, 1}, {4, 1536, 1, 1}));
  3684. test_cases.emplace_back(new test_ssm_scan(GGML_TYPE_F32, 16, 1024, 32, 4));
  3685. test_cases.emplace_back(new test_rwkv_wkv6(GGML_TYPE_F32, 32, 64, 1, 1));
  3686. test_cases.emplace_back(new test_rwkv_wkv6(GGML_TYPE_F32, 32, 64, 32, 1));
  3687. test_cases.emplace_back(new test_rwkv_wkv6(GGML_TYPE_F32, 32, 64, 32, 4));
  3688. test_cases.emplace_back(new test_rwkv_wkv6(GGML_TYPE_F32, 32, 64, 128, 4));
  3689. test_cases.emplace_back(new test_rwkv_wkv7(GGML_TYPE_F32, 32, 64, 1, 1));
  3690. test_cases.emplace_back(new test_rwkv_wkv7(GGML_TYPE_F32, 32, 64, 32, 1));
  3691. test_cases.emplace_back(new test_rwkv_wkv7(GGML_TYPE_F32, 32, 64, 32, 4));
  3692. test_cases.emplace_back(new test_rwkv_wkv7(GGML_TYPE_F32, 32, 64, 128, 4));
  3693. test_cases.emplace_back(new test_gla(GGML_TYPE_F32, 32, 64, 1, 1));
  3694. test_cases.emplace_back(new test_gla(GGML_TYPE_F32, 32, 64, 32, 1));
  3695. test_cases.emplace_back(new test_gla(GGML_TYPE_F32, 32, 64, 32, 4));
  3696. test_cases.emplace_back(new test_gla(GGML_TYPE_F32, 32, 64, 128, 4));
  3697. for (ggml_type type_a : all_types) {
  3698. for (int i = 1; i < 10; ++i) {
  3699. test_cases.emplace_back(new test_mul_mat(type_a, GGML_TYPE_F32, 16, i, 256, { 1, 1}, {1, 1}));
  3700. }
  3701. }
  3702. #if 1
  3703. for (ggml_type type_a : base_types) {
  3704. for (ggml_type type_b : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  3705. std::vector<int> ks = { 256 };
  3706. if (ggml_blck_size(type_a) == 1) {
  3707. ks.push_back(4);
  3708. }
  3709. for (auto k : ks) {
  3710. // test cases without permutation
  3711. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {1, 1}, {1, 1}));
  3712. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {1, 1}, {2, 1}));
  3713. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {1, 1}, {1, 2}));
  3714. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {3, 1}, {1, 1}));
  3715. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {3, 1}, {2, 1}));
  3716. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {3, 2}, {1, 1}));
  3717. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {3, 2}, {2, 1}));
  3718. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {3, 2}, {1, 2}));
  3719. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {3, 2}, {2, 2}));
  3720. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {1, 1}, {1, 1}));
  3721. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {1, 1}, {2, 1}));
  3722. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {1, 1}, {1, 2}));
  3723. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {3, 1}, {1, 1}));
  3724. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {3, 1}, {2, 1}));
  3725. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {3, 2}, {1, 1}));
  3726. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {3, 2}, {2, 1}));
  3727. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {3, 2}, {1, 2}));
  3728. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {3, 2}, {2, 2}));
  3729. // test cases with permutation
  3730. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {2, 3}, {1, 1}, {0, 2, 1, 3}));
  3731. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {2, 3}, {1, 1}, {0, 1, 3, 2}));
  3732. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, k, {2, 3}, {1, 1}, {0, 3, 2, 1}));
  3733. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 8, k, {2, 3}, {1, 1}, {0, 2, 1, 3}));
  3734. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 8, k, {2, 3}, {1, 1}, {0, 1, 3, 2}));
  3735. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 8, k, {2, 3}, {1, 1}, {0, 3, 2, 1}));
  3736. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {2, 3}, {1, 1}, {0, 2, 1, 3}));
  3737. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {2, 3}, {1, 1}, {0, 1, 3, 2}));
  3738. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, k, {2, 3}, {1, 1}, {0, 3, 2, 1}));
  3739. }
  3740. // test cases with large ne00/ne10 to cover stream-k fixup
  3741. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, 1024, {3, 2}, {1, 1}));
  3742. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 8, 1024, {3, 2}, {1, 1}));
  3743. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, 1024, {3, 2}, {1, 1}));
  3744. }
  3745. }
  3746. for (ggml_type type_a : other_types) {
  3747. for (ggml_type type_b : {GGML_TYPE_F32}) {
  3748. if (ggml_blck_size(type_a) != 256) {
  3749. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, ggml_blck_size(type_a), {1, 1}, {1, 1}));
  3750. }
  3751. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, 256, {1, 1}, {1, 1}));
  3752. }
  3753. }
  3754. #else
  3755. // m = a rows
  3756. // n = b rows
  3757. // k = cols
  3758. std::uniform_int_distribution<> dist_m(1, 128);
  3759. std::uniform_int_distribution<> dist_n(16, 128);
  3760. std::uniform_int_distribution<> dist_k(1, 16);
  3761. for (int i = 0; i < 1000; i++) {
  3762. for (ggml_type type_a : all_types) {
  3763. for (ggml_type type_b : {GGML_TYPE_F32}) {
  3764. int m = dist_m(rng);
  3765. int n = dist_n(rng);
  3766. int k = dist_k(rng) * ggml_blck_size(type_a);
  3767. test_cases.emplace_back(new test_mul_mat(type_a, type_b, m, n, k, { 1, 1}, {1, 1}));
  3768. }
  3769. }
  3770. }
  3771. #endif
  3772. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 64, 2, 128, { 8, 1}, {1, 1}));
  3773. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 83, 2, 128, { 8, 1}, {4, 1}));
  3774. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 64, 2, 64, { 8, 1}, {4, 1}));
  3775. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 83, 2, 64, { 8, 1}, {4, 1}));
  3776. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 64, 45, 128, { 8, 1}, {4, 1}));
  3777. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 128, 45, 64, { 8, 1}, {4, 1}));
  3778. 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}));
  3779. 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}));
  3780. for (auto bs : {1,2,4,8}) {
  3781. for (auto nr : {1,4}) {
  3782. for (uint32_t m = 0; m < 2; ++m) {
  3783. for (uint32_t k = 0; k < 2; ++k) {
  3784. for (ggml_type type: {GGML_TYPE_F16, GGML_TYPE_BF16, GGML_TYPE_F32}) {
  3785. test_cases.emplace_back(new test_mul_mat(type, GGML_TYPE_F32, 1056 + m, 1, 128 + k, {bs, 1}, {nr, 1}, {0, 2, 1, 3}));
  3786. test_cases.emplace_back(new test_mul_mat(type, GGML_TYPE_F32, 128 + m, 1, 1056 + k, {bs, 1}, {nr, 1}, {0, 1, 2, 3}, true));
  3787. }
  3788. }
  3789. }
  3790. }
  3791. }
  3792. // sycl backend will limit task global_range < MAX_INT
  3793. // test case for f16-type-convert-to-fp32 kernel with large k under fp32 compute dtype (occurs in stable-diffusion)
  3794. // however this case needs to alloc more memory which may fail in some devices (Intel Arc770, etc.)
  3795. // this case is verified (pass) in Intel(R) Data Center GPU Max 1100 (sycl backend) and NV A30 (cuda backend)
  3796. // test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F16, 512, 262144, 9216, {1, 1}, {1, 1}));
  3797. for (ggml_type type_a : base_types) {
  3798. for (ggml_type type_b : {GGML_TYPE_F32 /*, GGML_TYPE_F16 */}) {
  3799. for (int n_mats : {4, 8}) {
  3800. for (int n_used : {1, 2, 4}) {
  3801. for (bool b : {false, true}) {
  3802. for (int n : {1, 32, 129}) {
  3803. int m = 512;
  3804. int k = 256;
  3805. test_cases.emplace_back(new test_mul_mat_id(type_a, type_b, n_mats, n_used, b, m, n, k));
  3806. }
  3807. }
  3808. }
  3809. }
  3810. }
  3811. }
  3812. for (ggml_type type_a : other_types) {
  3813. for (ggml_type type_b : {GGML_TYPE_F32 /*, GGML_TYPE_F16 */}) {
  3814. for (int n_mats : {4}) {
  3815. for (int n_used : {2}) {
  3816. for (bool b : {false}) {
  3817. for (int n : {1, 32}) {
  3818. int m = 512;
  3819. int k = 256;
  3820. test_cases.emplace_back(new test_mul_mat_id(type_a, type_b, n_mats, n_used, b, m, n, k));
  3821. }
  3822. }
  3823. }
  3824. }
  3825. }
  3826. }
  3827. for (ggml_type type_a : base_types) {
  3828. for (ggml_type type_b : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  3829. for (int n : {1, 16}) {
  3830. for (int k : {1, 16}) {
  3831. for (int bs2 : {1, 3}) {
  3832. for (int bs3 : {1, 3}) {
  3833. for (int nr2 : {1, 2}) {
  3834. for (int nr3 : {1, 2}) {
  3835. test_cases.emplace_back(new test_out_prod(type_a, type_b, 256, n, k, {bs2, bs3}, {nr2, nr3}));
  3836. }
  3837. }
  3838. }
  3839. }
  3840. }
  3841. }
  3842. }
  3843. }
  3844. for (ggml_type type : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  3845. test_cases.emplace_back(new test_sqr(type));
  3846. test_cases.emplace_back(new test_sqrt(type));
  3847. test_cases.emplace_back(new test_log(type));
  3848. test_cases.emplace_back(new test_sin(type));
  3849. test_cases.emplace_back(new test_cos(type));
  3850. test_cases.emplace_back(new test_clamp(type));
  3851. }
  3852. test_cases.emplace_back(new test_diag_mask_inf(GGML_TYPE_F32, {10, 10, 1, 1}, 5));
  3853. test_cases.emplace_back(new test_diag_mask_inf(GGML_TYPE_F32, {10, 10, 3, 1}, 5));
  3854. test_cases.emplace_back(new test_diag_mask_inf(GGML_TYPE_F32, {10, 10, 3, 2}, 5));
  3855. #if 0
  3856. std::uniform_int_distribution<> dist_ne1(1, 50);
  3857. int exponent = 1;
  3858. while (exponent < (1 << 17)) {
  3859. std::uniform_int_distribution<> dist_ne0(exponent, 2*exponent);
  3860. for (int n = 0; n < 10; ++n) {
  3861. int64_t ne0 = dist_ne0(rng);
  3862. int64_t ne1 = dist_ne1(rng);
  3863. 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));
  3864. }
  3865. exponent <<= 1;
  3866. }
  3867. #endif
  3868. for (bool mask : {false, true}) {
  3869. for (float max_bias : {0.0f, 8.0f}) {
  3870. if (!mask && max_bias > 0.0f) continue;
  3871. for (float scale : {1.0f, 0.1f}) {
  3872. for (int64_t ne0 : {16, 1024}) {
  3873. for (int64_t ne1 : {16, 1024}) {
  3874. if (mask) {
  3875. for (ggml_type m_prec : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  3876. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0, ne1, 1, 1}, mask, m_prec, scale, max_bias));
  3877. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0-1, ne1-1, 1, 1}, mask, m_prec, scale, max_bias));
  3878. }
  3879. } else {
  3880. /* The precision of mask here doesn't matter as boolean mask is false */
  3881. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0, ne1, 1, 1}, mask, GGML_TYPE_F32, scale, max_bias));
  3882. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0-1, ne1-1, 1, 1}, mask, GGML_TYPE_F32, scale, max_bias));
  3883. }
  3884. }
  3885. }
  3886. }
  3887. }
  3888. }
  3889. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {16, 2, 32, 1}, true, GGML_TYPE_F32, 0.1f, 0.0f));
  3890. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {16, 2, 32, 1}, true, GGML_TYPE_F16, 0.1f, 0.0f));
  3891. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {16, 2, 32, 1}, false, GGML_TYPE_F32, 0.1f, 0.0f));
  3892. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {32, 2, 32, 1}, true, GGML_TYPE_F32, 0.1f, 0.0f));
  3893. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {32, 2, 32, 1}, true, GGML_TYPE_F16, 0.1f, 0.0f));
  3894. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {32, 2, 32, 1}, true, GGML_TYPE_F32, 0.1f, 8.0f));
  3895. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {32, 2, 32, 1}, true, GGML_TYPE_F16, 0.1f, 8.0f));
  3896. for (float max_bias : {0.0f, 8.0f}) {
  3897. for (float scale : {1.0f, 0.1f}) {
  3898. for (int64_t ne0 : {16, 1024}) {
  3899. for (int64_t ne1 : {16, 1024}) {
  3900. test_cases.emplace_back(new test_soft_max_back(GGML_TYPE_F32, {ne0, ne1, 1, 1}, scale, max_bias));
  3901. test_cases.emplace_back(new test_soft_max_back(GGML_TYPE_F32, {ne0-1, ne1-1, 1, 1}, scale, max_bias));
  3902. }
  3903. }
  3904. }
  3905. }
  3906. for (bool fw : {true, false}) { // fw == forward
  3907. bool all = true;
  3908. for (float v : { 0, 1 }) {
  3909. for (float fs : { 1.0f, 1.4245f }) {
  3910. for (float ef : { 0.0f, 0.7465f }) {
  3911. for (float af : { 1.0f, 1.4245f }) {
  3912. for (ggml_type type : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  3913. for (bool ff : {false, true}) { // freq_factors
  3914. test_cases.emplace_back(new test_rope(type, {128, 32, 2, 1}, 128, 0, 512, fs, ef, af, ff, v, fw)); // llama 7B
  3915. if (all) {
  3916. test_cases.emplace_back(new test_rope(type, {128, 40, 2, 1}, 128, 0, 512, fs, ef, af, ff, v, fw)); // llama 13B
  3917. test_cases.emplace_back(new test_rope(type, {128, 52, 2, 1}, 128, 0, 512, fs, ef, af, ff, v, fw)); // llama 30B
  3918. test_cases.emplace_back(new test_rope(type, {128, 64, 2, 1}, 128, 0, 512, fs, ef, af, ff, v, fw)); // llama 65B
  3919. }
  3920. if (all) {
  3921. test_cases.emplace_back(new test_rope(type, { 64, 1, 2, 1}, 64, 2, 512, fs, ef, af, ff, v, fw)); // neox (falcon 7B)
  3922. test_cases.emplace_back(new test_rope(type, { 64, 71, 2, 1}, 64, 2, 512, fs, ef, af, ff, v, fw)); // neox (falcon 7B)
  3923. test_cases.emplace_back(new test_rope(type, { 64, 8, 2, 1}, 64, 2, 512, fs, ef, af, ff, v, fw)); // neox (falcon 40B)
  3924. test_cases.emplace_back(new test_rope(type, { 80, 32, 2, 1}, 20, 2, 512, fs, ef, af, ff, v, fw)); // neox (stablelm)
  3925. test_cases.emplace_back(new test_rope(type, { 80, 32, 2, 1}, 32, 2, 512, fs, ef, af, ff, v, fw)); // neox (phi-2)
  3926. }
  3927. if (all) {
  3928. 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)
  3929. 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)
  3930. 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)
  3931. }
  3932. test_cases.emplace_back(new test_rope(type, { 64, 128, 2, 1}, 64, 2, 512, fs, ef, af, ff, v, fw)); // neox (falcon 40B)
  3933. }
  3934. }
  3935. all = false;
  3936. }
  3937. }
  3938. }
  3939. }
  3940. }
  3941. for (int v : { 0, 1, 2, 3 }) {
  3942. for (int dim : { 0, 1, 2, 3, }) {
  3943. test_cases.emplace_back(new test_concat(GGML_TYPE_F32, {11, 12, 13, 14}, 7, dim, v));
  3944. test_cases.emplace_back(new test_concat(GGML_TYPE_I32, {11, 12, 13, 14}, 7, dim, v));
  3945. }
  3946. }
  3947. for (ggml_sort_order order : {GGML_SORT_ORDER_ASC, GGML_SORT_ORDER_DESC}) {
  3948. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {8, 1, 1, 1}, order));
  3949. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {16, 10, 10, 10}, order));
  3950. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {60, 10, 10, 10}, order)); // qwen
  3951. }
  3952. for (ggml_scale_mode mode : {GGML_SCALE_MODE_NEAREST, GGML_SCALE_MODE_BILINEAR}) {
  3953. test_cases.emplace_back(new test_upscale(GGML_TYPE_F32, {512, 512, 3, 2}, 2, mode));
  3954. test_cases.emplace_back(new test_upscale(GGML_TYPE_F32, {512, 512, 3, 2}, 2, mode, true));
  3955. test_cases.emplace_back(new test_upscale_ext(GGML_TYPE_F32, {2, 5, 7, 11}, {5, 7, 11, 13}, mode));
  3956. }
  3957. test_cases.emplace_back(new test_sum());
  3958. test_cases.emplace_back(new test_sum_rows());
  3959. test_cases.emplace_back(new test_mean());
  3960. test_cases.emplace_back(new test_group_norm(GGML_TYPE_F32, {64, 64, 320, 1}));
  3961. test_cases.emplace_back(new test_group_norm(GGML_TYPE_F32, {9, 9, 1280, 1}));
  3962. test_cases.emplace_back(new test_acc());
  3963. test_cases.emplace_back(new test_pad());
  3964. test_cases.emplace_back(new test_pad_reflect_1d());
  3965. test_cases.emplace_back(new test_arange());
  3966. test_cases.emplace_back(new test_timestep_embedding());
  3967. test_cases.emplace_back(new test_leaky_relu());
  3968. for (int hsk : { 64, 80, 128, 192, 256, 576 }) {
  3969. for (int hsv : { 64, 80, 128, 192, 256, 512 }) {
  3970. if (hsk != 192 && hsk != 576 && hsk != hsv) continue;
  3971. if (hsk == 192 && (hsv != 128 && hsv != 192)) continue;
  3972. if (hsk == 576 && hsv != 512) continue; // DeepSeek MLA
  3973. for (bool mask : { true, false } ) {
  3974. for (float max_bias : { 0.0f, 8.0f }) {
  3975. if (!mask && max_bias > 0.0f) continue;
  3976. for (float logit_softcap : {0.0f, 10.0f}) {
  3977. if (hsk != 128 && logit_softcap != 0.0f) continue;
  3978. for (int nh : { 4, }) {
  3979. for (int nr : { 1, 4, 16 }) {
  3980. if (nr == 16 && hsk != 128) continue;
  3981. for (int kv : { 512, 1024, }) {
  3982. if (nr != 1 && kv != 512) continue;
  3983. for (int nb : { 1, 3, 32, 35, }) {
  3984. for (ggml_prec prec : {GGML_PREC_F32, GGML_PREC_DEFAULT}) {
  3985. if (hsk != 128 && prec == GGML_PREC_DEFAULT) continue;
  3986. for (ggml_type type_KV : {GGML_TYPE_F16, GGML_TYPE_BF16, GGML_TYPE_Q8_0, GGML_TYPE_Q4_0}) {
  3987. test_cases.emplace_back(new test_flash_attn_ext(
  3988. hsk, hsv, nh, nr, kv, nb, mask, max_bias, logit_softcap, prec, type_KV));
  3989. // run fewer test cases permuted
  3990. if (mask == true && max_bias == 0.0f && logit_softcap == 0 && kv == 512) {
  3991. test_cases.emplace_back(new test_flash_attn_ext(
  3992. hsk, hsv, nh, nr, kv, nb, mask, max_bias, logit_softcap, prec, type_KV, {0, 2, 1, 3}));
  3993. }
  3994. }
  3995. }
  3996. }
  3997. }
  3998. }
  3999. }
  4000. }
  4001. }
  4002. }
  4003. }
  4004. }
  4005. test_cases.emplace_back(new test_cross_entropy_loss (GGML_TYPE_F32, { 10, 5, 4, 3}));
  4006. test_cases.emplace_back(new test_cross_entropy_loss (GGML_TYPE_F32, {30000, 1, 1, 1}));
  4007. test_cases.emplace_back(new test_cross_entropy_loss_back(GGML_TYPE_F32, { 10, 5, 4, 3}));
  4008. test_cases.emplace_back(new test_cross_entropy_loss_back(GGML_TYPE_F32, {30000, 1, 1, 1}));
  4009. test_cases.emplace_back(new test_opt_step_adamw(GGML_TYPE_F32, {10, 5, 4, 3}));
  4010. test_cases.emplace_back(new test_llama(2, true));
  4011. // these tests are disabled to save execution time, but they can be handy for debugging
  4012. #if 0
  4013. test_cases.emplace_back(new test_llama(1));
  4014. test_cases.emplace_back(new test_llama(2));
  4015. test_cases.emplace_back(new test_falcon(1));
  4016. test_cases.emplace_back(new test_falcon(2));
  4017. #endif
  4018. return test_cases;
  4019. }
  4020. // Test cases for performance evaluation: should be representative of real-world use cases
  4021. static std::vector<std::unique_ptr<test_case>> make_test_cases_perf() {
  4022. std::vector<std::unique_ptr<test_case>> test_cases;
  4023. test_cases.emplace_back(new test_bin_bcast(ggml_add, GGML_TYPE_F32, {4096, 1, 1, 1}, {1, 1, 1, 1}));
  4024. test_cases.emplace_back(new test_bin_bcast(ggml_add, GGML_TYPE_F32, {4096, 1, 1, 1}, {1, 512, 1, 1}));
  4025. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F16, {512, 3072, 1, 1}));
  4026. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F32, {8192, 512, 2, 1}, {0, 2, 1, 3}));
  4027. test_cases.emplace_back(new test_cpy(GGML_TYPE_F32, GGML_TYPE_F32, {3072, 512, 2, 1}, {0, 2, 1, 3}));
  4028. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {4096, 4096, 5, 1}, false, GGML_TYPE_F32, 1.0f, 0.0f));
  4029. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {77, 4096, 5, 1}, false, GGML_TYPE_F32, 1.0f, 0.0f));
  4030. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {1024, 1024, 10, 1}, false, GGML_TYPE_F32, 1.0f, 0.0f));
  4031. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {77, 1024, 10, 1}, false, GGML_TYPE_F32, 1.0f, 0.0f));
  4032. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {256, 256, 20, 1}, false, GGML_TYPE_F32, 1.0f, 0.0f));
  4033. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {64, 64, 20, 1}, false, GGML_TYPE_F32, 1.0f, 0.0f));
  4034. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {77, 64, 20, 1}, false, GGML_TYPE_F32, 1.0f, 0.0f));
  4035. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {32, 10, 1, 1}));
  4036. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {1024, 10, 1, 1}));
  4037. test_cases.emplace_back(new test_argmax(GGML_TYPE_F32, {32000, 512, 1, 1}));
  4038. 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}));
  4039. 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));
  4040. for (int bs : {1, 2, 3, 4, 5, 8, 512}) {
  4041. for (ggml_type type_a : all_types) {
  4042. for (ggml_type type_b : {GGML_TYPE_F32}) {
  4043. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 4096, bs, 14336, {1, 1}, {1, 1}));
  4044. }
  4045. }
  4046. }
  4047. for (int K : {3, 5}) {
  4048. for (int IC : {256, 2560}) {
  4049. for (int IW_IH : {32, 64, 256}) {
  4050. if (IC == 2560 && IW_IH == 256) {
  4051. // too big
  4052. continue;
  4053. }
  4054. 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));
  4055. }
  4056. }
  4057. }
  4058. for (int kv : { 4096, 8192, 16384, }) {
  4059. for (int hs : { 64, 128, }) {
  4060. for (int nr : { 1, 4, }) {
  4061. test_cases.emplace_back(new test_flash_attn_ext(hs, hs, 8, nr, kv, 1, true, 0, 0, GGML_PREC_F32, GGML_TYPE_F16));
  4062. }
  4063. }
  4064. }
  4065. test_cases.emplace_back(new test_conv_2d_dw({512, 512, 256, 1}, {3, 3, 1, 256}, 1, 1, 1, false));
  4066. test_cases.emplace_back(new test_conv_2d_dw({512, 512, 256, 1}, {3, 3, 1, 256}, 1, 1, 1, true));
  4067. test_cases.emplace_back(new test_conv_transpose_2d({256, 256, 256, 1}, {3, 3, 16, 256}, 1));
  4068. test_cases.emplace_back(new test_mean(GGML_TYPE_F32, {256, 256, 3, 1}));
  4069. return test_cases;
  4070. }
  4071. static bool test_backend(ggml_backend_t backend, test_mode mode, const char * op_name, const char * params_filter) {
  4072. auto filter_test_cases = [](std::vector<std::unique_ptr<test_case>> & test_cases, const char * params_filter) {
  4073. if (params_filter == nullptr) {
  4074. return;
  4075. }
  4076. std::regex params_filter_regex(params_filter);
  4077. for (auto it = test_cases.begin(); it != test_cases.end();) {
  4078. if (!std::regex_search((*it)->vars(), params_filter_regex)) {
  4079. it = test_cases.erase(it);
  4080. continue;
  4081. }
  4082. it++;
  4083. }
  4084. };
  4085. if (mode == MODE_TEST) {
  4086. auto test_cases = make_test_cases_eval();
  4087. filter_test_cases(test_cases, params_filter);
  4088. ggml_backend_t backend_cpu = ggml_backend_init_by_type(GGML_BACKEND_DEVICE_TYPE_CPU, NULL);
  4089. if (backend_cpu == NULL) {
  4090. printf(" Failed to initialize CPU backend\n");
  4091. return false;
  4092. }
  4093. size_t n_ok = 0;
  4094. for (auto & test : test_cases) {
  4095. if (test->eval(backend, backend_cpu, op_name)) {
  4096. n_ok++;
  4097. }
  4098. }
  4099. printf(" %zu/%zu tests passed\n", n_ok, test_cases.size());
  4100. ggml_backend_free(backend_cpu);
  4101. return n_ok == test_cases.size();
  4102. }
  4103. if (mode == MODE_GRAD) {
  4104. auto test_cases = make_test_cases_eval();
  4105. filter_test_cases(test_cases, params_filter);
  4106. size_t n_ok = 0;
  4107. for (auto & test : test_cases) {
  4108. if (test->eval_grad(backend, op_name)) {
  4109. n_ok++;
  4110. }
  4111. }
  4112. printf(" %zu/%zu tests passed\n", n_ok, test_cases.size());
  4113. return n_ok == test_cases.size();
  4114. }
  4115. if (mode == MODE_PERF) {
  4116. auto test_cases = make_test_cases_perf();
  4117. filter_test_cases(test_cases, params_filter);
  4118. for (auto & test : test_cases) {
  4119. test->eval_perf(backend, op_name);
  4120. }
  4121. return true;
  4122. }
  4123. GGML_ABORT("fatal error");
  4124. }
  4125. static void usage(char ** argv) {
  4126. printf("Usage: %s [mode] [-o <op>] [-b <backend>] [-p <params regex>]\n", argv[0]);
  4127. printf(" valid modes:\n");
  4128. printf(" - test (default, compare with CPU backend for correctness)\n");
  4129. printf(" - grad (compare gradients from backpropagation with method of finite differences)\n");
  4130. printf(" - perf (performance evaluation)\n");
  4131. printf(" op names for -o are as given by ggml_op_desc() (e.g. ADD, MUL_MAT, etc)\n");
  4132. }
  4133. int main(int argc, char ** argv) {
  4134. test_mode mode = MODE_TEST;
  4135. const char * op_name_filter = nullptr;
  4136. const char * backend_filter = nullptr;
  4137. const char * params_filter = nullptr;
  4138. for (int i = 1; i < argc; i++) {
  4139. if (strcmp(argv[i], "test") == 0) {
  4140. mode = MODE_TEST;
  4141. } else if (strcmp(argv[i], "perf") == 0) {
  4142. mode = MODE_PERF;
  4143. } else if (strcmp(argv[i], "grad") == 0) {
  4144. mode = MODE_GRAD;
  4145. } else if (strcmp(argv[i], "-o") == 0) {
  4146. if (i + 1 < argc) {
  4147. op_name_filter = argv[++i];
  4148. } else {
  4149. usage(argv);
  4150. return 1;
  4151. }
  4152. } else if (strcmp(argv[i], "-b") == 0) {
  4153. if (i + 1 < argc) {
  4154. backend_filter = argv[++i];
  4155. } else {
  4156. usage(argv);
  4157. return 1;
  4158. }
  4159. } else if (strcmp(argv[i], "-p") == 0) {
  4160. if (i + 1 < argc) {
  4161. params_filter = argv[++i];
  4162. } else {
  4163. usage(argv);
  4164. return 1;
  4165. }
  4166. } else {
  4167. usage(argv);
  4168. return 1;
  4169. }
  4170. }
  4171. // load and enumerate backends
  4172. ggml_backend_load_all();
  4173. printf("Testing %zu devices\n\n", ggml_backend_dev_count());
  4174. size_t n_ok = 0;
  4175. for (size_t i = 0; i < ggml_backend_dev_count(); i++) {
  4176. ggml_backend_dev_t dev = ggml_backend_dev_get(i);
  4177. printf("Backend %zu/%zu: %s\n", i + 1, ggml_backend_dev_count(), ggml_backend_dev_name(dev));
  4178. if (backend_filter != NULL && strcmp(backend_filter, ggml_backend_dev_name(dev)) != 0) {
  4179. printf(" Skipping\n");
  4180. n_ok++;
  4181. continue;
  4182. }
  4183. if (backend_filter == NULL && ggml_backend_dev_type(dev) == GGML_BACKEND_DEVICE_TYPE_CPU && mode != MODE_GRAD) {
  4184. printf(" Skipping CPU backend\n");
  4185. n_ok++;
  4186. continue;
  4187. }
  4188. ggml_backend_t backend = ggml_backend_dev_init(dev, NULL);
  4189. GGML_ASSERT(backend != NULL);
  4190. ggml_backend_reg_t reg = ggml_backend_dev_backend_reg(dev);
  4191. 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");
  4192. if (ggml_backend_set_n_threads_fn) {
  4193. // TODO: better value for n_threads
  4194. ggml_backend_set_n_threads_fn(backend, std::thread::hardware_concurrency());
  4195. }
  4196. printf(" Device description: %s\n", ggml_backend_dev_description(dev));
  4197. size_t free, total; // NOLINT
  4198. ggml_backend_dev_memory(dev, &free, &total);
  4199. printf(" Device memory: %zu MB (%zu MB free)\n", total / 1024 / 1024, free / 1024 / 1024);
  4200. printf("\n");
  4201. bool ok = test_backend(backend, mode, op_name_filter, params_filter);
  4202. printf(" Backend %s: ", ggml_backend_name(backend));
  4203. if (ok) {
  4204. printf("\033[1;32mOK\033[0m\n");
  4205. n_ok++;
  4206. } else {
  4207. printf("\033[1;31mFAIL\033[0m\n");
  4208. }
  4209. printf("\n");
  4210. ggml_backend_free(backend);
  4211. }
  4212. ggml_quantize_free();
  4213. printf("%zu/%zu backends passed\n", n_ok, ggml_backend_dev_count());
  4214. if (n_ok != ggml_backend_dev_count()) {
  4215. printf("\033[1;31mFAIL\033[0m\n");
  4216. return 1;
  4217. }
  4218. printf("\033[1;32mOK\033[0m\n");
  4219. return 0;
  4220. }