test-backend-ops.cpp 176 KB

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