test-backend-ops.cpp 148 KB

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