test-backend-ops.cpp 77 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221
  1. #include <ggml.h>
  2. #include <ggml-alloc.h>
  3. #include <ggml-backend.h>
  4. #include <ggml-backend-impl.h>
  5. #include <algorithm>
  6. #include <array>
  7. #include <cfloat>
  8. #include <cstring>
  9. #include <functional>
  10. #include <memory>
  11. #include <random>
  12. #include <stdio.h>
  13. #include <stdlib.h>
  14. #include <string>
  15. #include <thread>
  16. #include <vector>
  17. static void init_tensor_uniform(ggml_tensor * tensor, float min = -1.0f, float max = 1.0f) {
  18. // static RNG initialization (revisit if n_threads stops being constant)
  19. static const size_t n_threads = std::thread::hardware_concurrency();
  20. static std::vector<std::default_random_engine> generators = []() {
  21. std::random_device rd;
  22. std::vector<std::default_random_engine> vec;
  23. vec.reserve(n_threads);
  24. //for (size_t i = 0; i < n_threads; i++) { vec.emplace_back(1234 + i); } // fixed seed
  25. for (size_t i = 0; i < n_threads; i++) { vec.emplace_back(rd()); }
  26. return vec;
  27. }();
  28. size_t size = ggml_nelements(tensor);
  29. std::vector<float> data(size);
  30. auto init_thread = [&](size_t ith, size_t start, size_t end) {
  31. std::uniform_real_distribution<float> distribution(min, max);
  32. for (size_t i = start; i < end; i++) {
  33. data[i] = distribution(generators[ith]);
  34. }
  35. };
  36. std::vector<std::thread> threads;
  37. threads.reserve(n_threads);
  38. for (size_t i = 0; i < n_threads; i++) {
  39. size_t start = i*size/n_threads;
  40. size_t end = (i+1)*size/n_threads;
  41. threads.emplace_back(init_thread, i, start, end);
  42. }
  43. for (auto & t : threads) {
  44. t.join();
  45. }
  46. if (tensor->type == GGML_TYPE_F32 || tensor->type == GGML_TYPE_I32) {
  47. ggml_backend_tensor_set(tensor, data.data(), 0, size * sizeof(float));
  48. } else if (ggml_is_quantized(tensor->type) || tensor->type == GGML_TYPE_F16) {
  49. GGML_ASSERT(size % ggml_blck_size(tensor->type) == 0);
  50. std::vector<uint8_t> dataq(ggml_row_size(tensor->type, size));
  51. std::vector<float> imatrix(tensor->ne[0], 1.0f); // dummy importance matrix
  52. const float * im = imatrix.data();
  53. if (!ggml_quantize_requires_imatrix(tensor->type)) {
  54. // when the imatrix is optional, we want to test both quantization with and without imatrix
  55. // use one of the random numbers to decide
  56. if (data[0] > 0.5f*(min + max)) {
  57. im = nullptr;
  58. }
  59. }
  60. ggml_quantize_chunk(tensor->type, data.data(), dataq.data(), 0, size/tensor->ne[0], tensor->ne[0], im);
  61. ggml_backend_tensor_set(tensor, dataq.data(), 0, dataq.size());
  62. } else if (tensor->type == GGML_TYPE_I8 || tensor->type == GGML_TYPE_I16 || tensor->type == GGML_TYPE_I32) {
  63. // This is going to create some weird integers though.
  64. ggml_backend_tensor_set(tensor, data.data(), 0, ggml_nbytes(tensor));
  65. } else {
  66. GGML_ASSERT(false);
  67. }
  68. }
  69. static std::vector<float> tensor_to_float(const ggml_tensor * t) {
  70. std::vector<float> tv;
  71. tv.reserve(ggml_nelements(t));
  72. std::vector<uint8_t> buf(ggml_nbytes(t));
  73. ggml_backend_tensor_get(t, buf.data(), 0, ggml_nbytes(t));
  74. ggml_type_traits_t tt = ggml_internal_get_type_traits(t->type);
  75. size_t bs = ggml_blck_size(t->type);
  76. std::vector<float> vq(ggml_blck_size(t->type));
  77. bool quantized = ggml_is_quantized(t->type);
  78. // access elements by index to avoid gaps in views
  79. for (int64_t i3 = 0; i3 < t->ne[3]; i3++) {
  80. for (int64_t i2 = 0; i2 < t->ne[2]; i2++) {
  81. for (int64_t i1 = 0; i1 < t->ne[1]; i1++) {
  82. for (int64_t i0 = 0; i0 < t->ne[0]; i0 += bs) {
  83. size_t i = i3*t->nb[3] + i2*t->nb[2] + i1*t->nb[1] + i0/bs*t->nb[0];
  84. if (t->type == GGML_TYPE_F16) {
  85. tv.push_back(ggml_fp16_to_fp32(*(ggml_fp16_t*)&buf[i]));
  86. } else if (t->type == GGML_TYPE_F32) {
  87. tv.push_back(*(float *) &buf[i]);
  88. } else if (t->type == GGML_TYPE_I32) {
  89. tv.push_back((float)*(int32_t *) &buf[i]);
  90. } else if (t->type == GGML_TYPE_I16) {
  91. tv.push_back((float)*(int16_t *) &buf[i]);
  92. } else if (t->type == GGML_TYPE_I8) {
  93. tv.push_back((float)*(int8_t *) &buf[i]);
  94. } else if (quantized) {
  95. tt.to_float(&buf[i], vq.data(), ggml_blck_size(t->type));
  96. tv.insert(tv.end(), vq.begin(), vq.end());
  97. } else {
  98. GGML_ASSERT(false);
  99. }
  100. }
  101. }
  102. }
  103. }
  104. return tv;
  105. }
  106. /*
  107. static double cosine_similarity(const float * v1, const float * v2, size_t n) {
  108. double dot = 0.0;
  109. double mag1 = 0.0;
  110. double mag2 = 0.0;
  111. for (size_t i = 0; i < n; i++) {
  112. if (std::isnan(v1[i]) || std::isnan(v2[i])) {
  113. return -1.0f;
  114. }
  115. if (std::isinf(v1[i]) && std::isinf(v2[i])) {
  116. continue;
  117. }
  118. dot += v1[i]*v2[i];
  119. mag1 += v1[i]*v1[i];
  120. mag2 += v2[i]*v2[i];
  121. }
  122. return dot/sqrt(mag1*mag2);
  123. }
  124. static float distance(const float * v1, const float * v2, size_t n) {
  125. double d = 0.0;
  126. for (size_t i = 0; i < n; i++) {
  127. if (std::isnan(v1[i]) || std::isnan(v2[i])) {
  128. return INFINITY;
  129. }
  130. if (std::isinf(v1[i]) && std::isinf(v2[i])) {
  131. continue;
  132. }
  133. d += (v1[i] - v2[i])*(v1[i] - v2[i]);
  134. }
  135. return sqrt(d);
  136. }
  137. static float vec_len(const float * v, size_t n) {
  138. double d = 0.0;
  139. for (size_t i = 0; i < n; i++) {
  140. if (std::isnan(v[i])) {
  141. return INFINITY;
  142. }
  143. if (std::isinf(v[i])) {
  144. continue;
  145. }
  146. d += v[i]*v[i];
  147. }
  148. return sqrt(d);
  149. }
  150. */
  151. // normalized mean squared error = mse(a, b) / mse(a, 0)
  152. static double nmse(const float * a, const float * b, size_t n) {
  153. double mse_a_b = 0.0;
  154. double mse_a_0 = 0.0;
  155. for (size_t i = 0; i < n; i++) {
  156. float a_i = a[i];
  157. float b_i = b[i];
  158. mse_a_b += (a_i - b_i) * (a_i - b_i);
  159. mse_a_0 += a_i * a_i;
  160. }
  161. return mse_a_b / mse_a_0;
  162. }
  163. // utils for printing the variables of the test cases
  164. #define VAR_TO_STR(x) (#x "=" + var_to_str(x))
  165. template<typename T>
  166. static std::string var_to_str(const T & x) {
  167. return std::to_string(x);
  168. }
  169. template<typename T, size_t N>
  170. static std::string var_to_str(const T (&x)[N]) {
  171. std::string s = "[";
  172. for (size_t i = 0; i < N; i++) {
  173. if (i > 0) {
  174. s += ",";
  175. }
  176. s += var_to_str(x[i]);
  177. }
  178. s += "]";
  179. return s;
  180. }
  181. template<typename T, size_t N>
  182. static std::string var_to_str(const std::array<T, N> & x) {
  183. std::string s = "[";
  184. for (size_t i = 0; i < N; i++) {
  185. if (i > 0) {
  186. s += ",";
  187. }
  188. s += var_to_str(x[i]);
  189. }
  190. s += "]";
  191. return s;
  192. }
  193. //static std::string var_to_str(ggml_unary_op unary_op) {
  194. // return ggml_unary_op_name(unary_op);
  195. //}
  196. static std::string var_to_str(ggml_type type) {
  197. return ggml_type_name(type);
  198. }
  199. static std::string var_to_str(ggml_op_pool pool) {
  200. switch (pool) {
  201. case GGML_OP_POOL_AVG: return "avg";
  202. case GGML_OP_POOL_MAX: return "max";
  203. default: return std::to_string(pool);
  204. }
  205. }
  206. #define VARS_TO_STR1(a) VAR_TO_STR(a)
  207. #define VARS_TO_STR2(a, b) VAR_TO_STR(a) + "," + VAR_TO_STR(b)
  208. #define VARS_TO_STR3(a, b, c) VAR_TO_STR(a) + "," + VARS_TO_STR2(b, c)
  209. #define VARS_TO_STR4(a, b, c, d) VAR_TO_STR(a) + "," + VARS_TO_STR3(b, c, d)
  210. #define VARS_TO_STR5(a, b, c, d, e) VAR_TO_STR(a) + "," + VARS_TO_STR4(b, c, d, e)
  211. #define VARS_TO_STR6(a, b, c, d, e, f) VAR_TO_STR(a) + "," + VARS_TO_STR5(b, c, d, e, f)
  212. #define VARS_TO_STR7(a, b, c, d, e, f, g) VAR_TO_STR(a) + "," + VARS_TO_STR6(b, c, d, e, f, g)
  213. #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)
  214. #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)
  215. #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)
  216. #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)
  217. #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)
  218. #ifdef GGML_USE_SYCL
  219. static bool inline _isinf(float f) {
  220. return (*(uint32_t *)&f & 0x7fffffff) == 0x7f800000;
  221. }
  222. #else
  223. static bool inline _isinf(float f) { return std::isinf(f); }
  224. #endif
  225. // accept FLT_MAX as infinity
  226. static bool isinf_or_max(float f) {
  227. return _isinf(f) || f == FLT_MAX || f == -FLT_MAX;
  228. }
  229. static bool ggml_is_view_op(enum ggml_op op) {
  230. return op == GGML_OP_VIEW || op == GGML_OP_RESHAPE || op == GGML_OP_PERMUTE || op == GGML_OP_TRANSPOSE;
  231. }
  232. enum test_mode {
  233. MODE_TEST,
  234. MODE_PERF,
  235. };
  236. struct test_case {
  237. virtual ~test_case() {}
  238. virtual std::string op_desc(ggml_tensor * t) {
  239. return ggml_op_desc(t);
  240. }
  241. virtual std::string vars() {
  242. return "";
  243. }
  244. virtual ggml_tensor * build_graph(ggml_context * ctx) = 0;
  245. virtual double max_nmse_err() {
  246. return 1e-7;
  247. }
  248. virtual void initialize_tensors(ggml_context * ctx) {
  249. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != nullptr; t = ggml_get_next_tensor(ctx, t)) {
  250. init_tensor_uniform(t);
  251. }
  252. }
  253. virtual size_t op_size(ggml_tensor * t) {
  254. size_t size = ggml_nbytes(t);
  255. // add source tensors
  256. for (int i = 0; i < GGML_MAX_SRC; i++) {
  257. if (t->src[i] != NULL) {
  258. size += ggml_nbytes(t->src[i]);
  259. }
  260. }
  261. return size;
  262. }
  263. ggml_cgraph * gf = nullptr;
  264. static const int sentinel_size = 1024;
  265. test_mode mode;
  266. std::vector<ggml_tensor *> sentinels;
  267. void add_sentinel(ggml_context * ctx) {
  268. if (mode == MODE_PERF) {
  269. return;
  270. }
  271. ggml_tensor * sentinel = ::ggml_new_tensor_1d(ctx, GGML_TYPE_F32, sentinel_size);
  272. ggml_format_name(sentinel, "sent_%zu", sentinels.size());
  273. sentinels.push_back(sentinel);
  274. }
  275. // hijack ggml_new_tensor to add sentinels after each tensor to check for overflows in the backend
  276. ggml_tensor * ggml_new_tensor(ggml_context * ctx, ggml_type type, int n_dims, const int64_t * ne) {
  277. ggml_tensor * t = ::ggml_new_tensor(ctx, type, n_dims, ne);
  278. add_sentinel(ctx);
  279. return t;
  280. }
  281. ggml_tensor * ggml_new_tensor_1d(ggml_context * ctx, ggml_type type, int64_t ne0) {
  282. ggml_tensor * t = ::ggml_new_tensor_1d(ctx, type, ne0);
  283. add_sentinel(ctx);
  284. return t;
  285. }
  286. ggml_tensor * ggml_new_tensor_2d(ggml_context * ctx, ggml_type type, int64_t ne0, int64_t ne1) {
  287. ggml_tensor * t = ::ggml_new_tensor_2d(ctx, type, ne0, ne1);
  288. add_sentinel(ctx);
  289. return t;
  290. }
  291. ggml_tensor * ggml_new_tensor_3d(ggml_context * ctx, ggml_type type, int64_t ne0, int64_t ne1, int64_t ne2) {
  292. ggml_tensor * t = ::ggml_new_tensor_3d(ctx, type, ne0, ne1, ne2);
  293. add_sentinel(ctx);
  294. return t;
  295. }
  296. ggml_tensor * ggml_new_tensor_4d(ggml_context * ctx, ggml_type type, int64_t ne0, int64_t ne1, int64_t ne2, int64_t ne3) {
  297. ggml_tensor * t = ::ggml_new_tensor_4d(ctx, type, ne0, ne1, ne2, ne3);
  298. add_sentinel(ctx);
  299. return t;
  300. }
  301. bool eval(ggml_backend_t backend1, ggml_backend_t backend2, const char * op_name) {
  302. mode = MODE_TEST;
  303. ggml_init_params params = {
  304. /* .mem_size = */ ggml_tensor_overhead()*128 + ggml_graph_overhead(),
  305. /* .mem_base = */ NULL,
  306. /* .no_alloc = */ true,
  307. };
  308. ggml_context * ctx = ggml_init(params);
  309. gf = ggml_new_graph(ctx);
  310. // pre-graph sentinel
  311. add_sentinel(ctx);
  312. ggml_tensor * out = build_graph(ctx);
  313. if (op_name != nullptr && op_desc(out) != op_name) {
  314. //printf(" %s: skipping\n", op_desc(out).c_str());
  315. ggml_free(ctx);
  316. return true;
  317. }
  318. printf(" %s(%s): ", op_desc(out).c_str(), vars().c_str());
  319. fflush(stdout);
  320. // check if the backends support the ops
  321. bool supported = true;
  322. for (ggml_backend_t backend : {backend1, backend2}) {
  323. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  324. if (!ggml_backend_supports_op(backend, t)) {
  325. printf("not supported [%s] ", ggml_backend_name(backend));
  326. supported = false;
  327. break;
  328. }
  329. }
  330. }
  331. if (!supported) {
  332. printf("\n");
  333. ggml_free(ctx);
  334. return true;
  335. }
  336. // post-graph sentinel
  337. add_sentinel(ctx);
  338. // allocate
  339. ggml_backend_buffer_t buf = ggml_backend_alloc_ctx_tensors(ctx, backend1);
  340. if (buf == NULL) {
  341. printf("failed to allocate tensors [%s] ", ggml_backend_name(backend1));
  342. ggml_free(ctx);
  343. return false;
  344. }
  345. // build graph
  346. ggml_build_forward_expand(gf, out);
  347. // add sentinels as graph nodes so that they are checked in the callback
  348. for (ggml_tensor * sentinel : sentinels) {
  349. gf->nodes[gf->n_nodes++] = sentinel;
  350. }
  351. // randomize tensors
  352. initialize_tensors(ctx);
  353. // compare
  354. struct callback_userdata {
  355. bool ok;
  356. double max_err;
  357. ggml_backend_t backend1;
  358. ggml_backend_t backend2;
  359. };
  360. callback_userdata ud {
  361. true,
  362. max_nmse_err(),
  363. backend1,
  364. backend2
  365. };
  366. auto callback = [](int index, ggml_tensor * t1, ggml_tensor * t2, void * user_data) -> bool {
  367. callback_userdata * ud = (callback_userdata *) user_data;
  368. const char * bn1 = ggml_backend_name(ud->backend1);
  369. const char * bn2 = ggml_backend_name(ud->backend2);
  370. if (t1->op == GGML_OP_NONE) {
  371. // sentinels must be unchanged
  372. std::vector<uint8_t> t1_data(ggml_nbytes(t1));
  373. std::vector<uint8_t> t2_data(ggml_nbytes(t2));
  374. ggml_backend_tensor_get(t1, t1_data.data(), 0, ggml_nbytes(t1));
  375. ggml_backend_tensor_get(t2, t2_data.data(), 0, ggml_nbytes(t2));
  376. if (memcmp(t1_data.data(), t2_data.data(), ggml_nbytes(t1)) != 0) {
  377. printf("sentinel mismatch: %s ", t1->name);
  378. ud->ok = false;
  379. return true;
  380. }
  381. }
  382. std::vector<float> f1 = tensor_to_float(t1);
  383. std::vector<float> f2 = tensor_to_float(t2);
  384. for (size_t i = 0; i < f1.size(); i++) {
  385. // check for nans
  386. if (std::isnan(f1[i]) || std::isnan(f2[i])) {
  387. printf("[%s] NaN at index %zu (%s=%f %s=%f) ", ggml_op_desc(t1), i, bn1, f1[i], bn2, f2[i]);
  388. ud->ok = false;
  389. return true;
  390. }
  391. // check for infs: both must be inf of the same sign, or both must be finite
  392. if (isinf_or_max(f1[i]) || isinf_or_max(f2[i])) {
  393. if (isinf_or_max(f1[i]) && isinf_or_max(f2[i])) {
  394. if (std::signbit(f1[i]) != std::signbit(f2[i])) {
  395. printf("[%s] inf sign mismatch: %s=%f %s=%f ", ggml_op_desc(t1), bn1, f1[i], bn2, f2[i]);
  396. ud->ok = false;
  397. return true;
  398. }
  399. } else {
  400. printf("[%s] inf mismatch: %s=%f %s=%f ", ggml_op_desc(t1), bn1, f1[i], bn2, f2[i]);
  401. ud->ok = false;
  402. return true;
  403. }
  404. }
  405. }
  406. double err = nmse(f1.data(), f2.data(), f1.size());
  407. if (err > ud->max_err) {
  408. printf("[%s] NMSE = %.9f > %.9f ", ggml_op_desc(t1), err, ud->max_err);
  409. //for (int i = 0; i < (int) f1.size(); i++) {
  410. // printf("%5d %9.6f %9.6f, diff = %9.6f\n", i, f1[i], f2[i], f1[i] - f2[i]);
  411. //}
  412. //printf("\n");
  413. //exit(1);
  414. ud->ok = false;
  415. }
  416. return true;
  417. GGML_UNUSED(index);
  418. };
  419. const bool cmp_ok = ggml_backend_compare_graph_backend(backend1, backend2, gf, callback, &ud);
  420. if (!cmp_ok) {
  421. printf("compare failed ");
  422. }
  423. ggml_backend_buffer_free(buf);
  424. ggml_free(ctx);
  425. if (ud.ok && cmp_ok) {
  426. printf("\033[1;32mOK\033[0m\n");
  427. return true;
  428. }
  429. printf("\033[1;31mFAIL\033[0m\n");
  430. return false;
  431. }
  432. bool eval_perf(ggml_backend_t backend, const char * op_name) {
  433. mode = MODE_PERF;
  434. static const size_t graph_nodes = 8192;
  435. ggml_init_params params = {
  436. /* .mem_size = */ ggml_tensor_overhead()*128 + ggml_graph_overhead_custom(graph_nodes, false),
  437. /* .mem_base = */ NULL,
  438. /* .no_alloc = */ true,
  439. };
  440. ggml_context * ctx = ggml_init(params);
  441. ggml_tensor * out = build_graph(ctx);
  442. if (op_name != nullptr && op_desc(out) != op_name) {
  443. //printf(" %s: skipping\n", op_desc(out).c_str());
  444. ggml_free(ctx);
  445. return true;
  446. }
  447. int len = printf(" %s(%s): ", op_desc(out).c_str(), vars().c_str());
  448. fflush(stdout);
  449. // check if backends support op
  450. if (!ggml_backend_supports_op(backend, out)) {
  451. printf("not supported\n");
  452. ggml_free(ctx);
  453. return true;
  454. }
  455. // align while also leaving some margin for variations in parameters
  456. int align = 20;
  457. int last = (len + align - 1) / align * align;
  458. if (last - len < 5) {
  459. last += align;
  460. }
  461. last = std::max(last, 60);
  462. printf("%*s", last - len, "");
  463. // allocate
  464. ggml_backend_buffer_t buf = ggml_backend_alloc_ctx_tensors(ctx, backend);
  465. if (buf == NULL) {
  466. printf("failed to allocate tensors\n");
  467. ggml_free(ctx);
  468. return false;
  469. }
  470. // randomize tensors
  471. initialize_tensors(ctx);
  472. // build graph
  473. ggml_cgraph * gf = ggml_new_graph_custom(ctx, graph_nodes, false);
  474. ggml_build_forward_expand(gf, out);
  475. // warmup run
  476. ggml_backend_graph_compute(backend, gf);
  477. // duplicate the op
  478. size_t target_size = ggml_backend_is_cpu(backend) ? 1ULL << 33 : 1ULL << 35; // 8 GB CPU, 32 GB GPU
  479. int n_runs = std::min((size_t)gf->size - gf->n_nodes, target_size / op_size(out)) + 1;
  480. for (int i = 1; i < n_runs; i++) {
  481. gf->nodes[gf->n_nodes++] = out;
  482. }
  483. // calculate memory
  484. size_t mem = n_runs * op_size(out);
  485. auto tensor_op_size = [](ggml_tensor * t) {
  486. size_t size = ggml_nbytes(t);
  487. // add source tensors
  488. for (int i = 0; i < GGML_MAX_SRC; i++) {
  489. if (t->src[i] != NULL) {
  490. size += ggml_nbytes(t->src[i]);
  491. }
  492. }
  493. return size;
  494. };
  495. for (int i = 0; i < gf->n_nodes; i++) {
  496. if (ggml_is_view_op(gf->nodes[i]->op) || gf->nodes[i] == out) {
  497. continue;
  498. }
  499. mem += tensor_op_size(gf->nodes[i]);
  500. }
  501. // run
  502. ggml_backend_synchronize(backend);
  503. int64_t start_time = ggml_time_us();
  504. ggml_backend_graph_compute(backend, gf);
  505. ggml_backend_synchronize(backend);
  506. int64_t end_time = ggml_time_us();
  507. double time_us = end_time - start_time;
  508. printf(" %5d runs - %8.2f us/run - %8zu kB/run - \033[1;34m%7.2f GB/s\033[0m\n",
  509. n_runs,
  510. time_us / n_runs,
  511. op_size(out) / 1024,
  512. mem / (time_us/1e6) / 1024.0 / 1024.0 / 1024.0);
  513. ggml_backend_buffer_free(buf);
  514. ggml_free(ctx);
  515. return true;
  516. }
  517. };
  518. // GGML_OP_UNARY
  519. struct test_unary : public test_case {
  520. const ggml_unary_op op;
  521. const ggml_type type;
  522. const std::array<int64_t, 4> ne;
  523. std::string vars() override {
  524. return VARS_TO_STR2(type, ne);
  525. }
  526. test_unary(ggml_unary_op op,
  527. ggml_type type = GGML_TYPE_F32,
  528. std::array<int64_t, 4> ne = {128, 10, 10, 10})
  529. : op(op), type(type), ne(ne) {}
  530. ggml_tensor * build_graph(ggml_context * ctx) override {
  531. ggml_tensor * in = ggml_new_tensor(ctx, type, 4, ne.data());
  532. ggml_tensor * out = ggml_unary(ctx, in, op);
  533. return out;
  534. }
  535. void initialize_tensors(ggml_context * ctx) override {
  536. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  537. // test extended range of values to check for NaNs in GELU
  538. init_tensor_uniform(t, -150.f, 150.f);
  539. }
  540. }
  541. };
  542. // GGML_OP_GET_ROWS
  543. struct test_get_rows : public test_case {
  544. const ggml_type type;
  545. const int n; // cols
  546. const int m; // rows
  547. const int r; // rows to get
  548. const int b; // batch size
  549. const bool v; // view (non-contiguous src1)
  550. std::string vars() override {
  551. return VARS_TO_STR6(type, n, m, r, b, v);
  552. }
  553. test_get_rows(ggml_type type = GGML_TYPE_F32, int n = 10, int m = 5, int r = 3, int b = 1, bool v = false)
  554. : type(type), n(n), m(m), r(r), b(b), v(v) {}
  555. ggml_tensor * build_graph(ggml_context * ctx) override {
  556. ggml_tensor * in = ggml_new_tensor_3d(ctx, type, n, m, b);
  557. ggml_tensor * rows = ggml_new_tensor_2d(ctx, GGML_TYPE_I32, r, b);
  558. if (v) {
  559. rows = ggml_view_2d(ctx, rows, r/2, b, rows->nb[1], 0);
  560. }
  561. ggml_tensor * out = ggml_get_rows(ctx, in, rows);
  562. return out;
  563. }
  564. void initialize_tensors(ggml_context * ctx) override {
  565. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  566. if (t->type == GGML_TYPE_I32) {
  567. if (ggml_is_view_op(t->op)) { continue; }
  568. // rows
  569. std::vector<int> data(r*b);
  570. for (int i = 0; i < r*b; i++) {
  571. data[i] = rand() % m;
  572. }
  573. ggml_backend_tensor_set(t, data.data(), 0, r * b * sizeof(int));
  574. } else {
  575. init_tensor_uniform(t);
  576. }
  577. }
  578. }
  579. };
  580. // GGML_OP_REPEAT
  581. struct test_repeat : public test_case {
  582. const ggml_type type;
  583. const std::array<int64_t, 4> ne;
  584. const std::array<int, 4> nr;
  585. std::string vars() override {
  586. return VARS_TO_STR3(type, ne, nr);
  587. }
  588. size_t op_size(ggml_tensor * t) override {
  589. return ggml_nbytes(t) * 2;
  590. }
  591. test_repeat(ggml_type type = GGML_TYPE_F32,
  592. std::array<int64_t, 4> ne = {10, 10, 10, 10},
  593. std::array<int, 4> nr = {2, 2, 2, 2})
  594. : type(type), ne(ne), nr(nr) {}
  595. ggml_tensor * build_graph(ggml_context * ctx) override {
  596. 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]);
  597. ggml_tensor * src = ggml_new_tensor(ctx, type, 4, ne.data());
  598. ggml_tensor * out = ggml_repeat(ctx, src, target);
  599. return out;
  600. }
  601. };
  602. // GGML_OP_DUP
  603. struct test_dup : public test_case {
  604. const ggml_type type;
  605. const std::array<int64_t, 4> ne;
  606. const std::array<int64_t, 4> permute;
  607. bool _use_permute;
  608. std::string vars() override {
  609. std::string v = VARS_TO_STR2(type, ne);
  610. if (_use_permute) v += "," + VAR_TO_STR(permute);
  611. return v;
  612. }
  613. test_dup(ggml_type type = GGML_TYPE_F32,
  614. std::array<int64_t, 4> ne = {10, 10, 10, 1},
  615. std::array<int64_t, 4> permute = {0, 0, 0, 0})
  616. : type(type), ne(ne), permute(permute),
  617. _use_permute(permute[0] + permute[1] + permute[2] + permute[3] > 0) {}
  618. ggml_tensor * build_graph(ggml_context * ctx) override {
  619. ggml_tensor * src = ggml_new_tensor(ctx, type, 4, ne.data());
  620. if (_use_permute) {
  621. src = ggml_permute(ctx, src, permute[0], permute[1], permute[2], permute[3]);
  622. }
  623. ggml_tensor * out = ggml_dup(ctx, src);
  624. return out;
  625. }
  626. };
  627. // GGML_OP_CPY
  628. struct test_cpy : public test_case {
  629. const ggml_type type_src;
  630. const ggml_type type_dst;
  631. const std::array<int64_t, 4> ne;
  632. std::string vars() override {
  633. return VARS_TO_STR3(type_src, type_dst, ne);
  634. }
  635. size_t op_size(ggml_tensor * t) override {
  636. return ggml_nbytes(t) + ggml_nbytes(t->src[0]);
  637. }
  638. test_cpy(ggml_type type_src = GGML_TYPE_F32, ggml_type type_dst = GGML_TYPE_F32,
  639. std::array<int64_t, 4> ne = {10, 10, 10, 1})
  640. : type_src(type_src), type_dst(type_dst), ne(ne) {}
  641. ggml_tensor * build_graph(ggml_context * ctx) override {
  642. ggml_tensor * src = ggml_new_tensor(ctx, type_src, 4, ne.data());
  643. ggml_tensor * dst = ggml_new_tensor(ctx, type_dst, 4, ne.data());
  644. ggml_tensor * out = ggml_cpy(ctx, src, dst);
  645. return out;
  646. }
  647. };
  648. // GGML_OP_CONT
  649. struct test_cont : public test_case {
  650. const ggml_type type;
  651. const std::array<int64_t, 4> ne;
  652. std::string vars() override {
  653. return VARS_TO_STR2(type, ne);
  654. }
  655. test_cont(ggml_type type = GGML_TYPE_F32,
  656. std::array<int64_t, 4> ne = {10, 10, 10, 1})
  657. : type(type), ne(ne) {}
  658. ggml_tensor * build_graph(ggml_context * ctx) override {
  659. ggml_tensor * src = ggml_new_tensor(ctx, type, 4, ne.data());
  660. src = ggml_transpose(ctx, src);
  661. ggml_tensor * out = ggml_cont(ctx, src);
  662. return out;
  663. }
  664. };
  665. // GGML_OP_ADD
  666. // GGML_OP_MUL
  667. // GGML_OP_DIV
  668. struct test_bin_bcast : public test_case {
  669. using op_t = ggml_tensor * (*) (ggml_context *, ggml_tensor *, ggml_tensor *);
  670. op_t op;
  671. const ggml_type type;
  672. const std::array<int64_t, 4> ne;
  673. const std::array<int, 4> nr;
  674. std::string vars() override {
  675. return VARS_TO_STR3(type, ne, nr);
  676. }
  677. size_t op_size(ggml_tensor * t) override {
  678. return ggml_nbytes(t) * 3;
  679. }
  680. test_bin_bcast(op_t op, ggml_type type = GGML_TYPE_F32,
  681. std::array<int64_t, 4> ne = {10, 10, 1, 1},
  682. std::array<int, 4> nr = {1, 2, 1, 1})
  683. : op(op), type(type), ne(ne), nr(nr) {}
  684. ggml_tensor * build_graph(ggml_context * ctx) override {
  685. 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]);
  686. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne.data());
  687. ggml_tensor * out = op(ctx, a, b);
  688. return out;
  689. }
  690. void initialize_tensors(ggml_context * ctx) override {
  691. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  692. if (op == ggml_div) {
  693. // avoid division by zero
  694. init_tensor_uniform(t, 1.0f, 2.0f);
  695. } else {
  696. init_tensor_uniform(t);
  697. }
  698. }
  699. }
  700. };
  701. // GGML_OP_SCALE
  702. struct test_scale : public test_case {
  703. const ggml_type type;
  704. const std::array<int64_t, 4> ne;
  705. float scale;
  706. std::string vars() override {
  707. return VARS_TO_STR3(type, ne, scale);
  708. }
  709. test_scale(ggml_type type = GGML_TYPE_F32,
  710. std::array<int64_t, 4> ne = {10, 10, 10, 10},
  711. float scale = 2.0f)
  712. : type(type), ne(ne), scale(scale) {}
  713. ggml_tensor * build_graph(ggml_context * ctx) override {
  714. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  715. ggml_tensor * out = ggml_scale(ctx, a, scale);
  716. return out;
  717. }
  718. };
  719. // GGML_OP_NORM
  720. struct test_norm : public test_case {
  721. const ggml_type type;
  722. const std::array<int64_t, 4> ne;
  723. float eps;
  724. std::string vars() override {
  725. return VARS_TO_STR3(type, ne, eps);
  726. }
  727. test_norm(ggml_type type = GGML_TYPE_F32,
  728. std::array<int64_t, 4> ne = {64, 10, 10, 10},
  729. float eps = 1e-6f)
  730. : type(type), ne(ne), eps(eps) {}
  731. ggml_tensor * build_graph(ggml_context * ctx) override {
  732. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  733. ggml_tensor * out = ggml_norm(ctx, a, eps);
  734. return out;
  735. }
  736. };
  737. // GGML_OP_RMS_NORM
  738. struct test_rms_norm : public test_case {
  739. const ggml_type type;
  740. const std::array<int64_t, 4> ne;
  741. float eps;
  742. std::string vars() override {
  743. return VARS_TO_STR3(type, ne, eps);
  744. }
  745. test_rms_norm(ggml_type type = GGML_TYPE_F32,
  746. std::array<int64_t, 4> ne = {64, 10, 10, 10},
  747. float eps = 1e-6f)
  748. : type(type), ne(ne), eps(eps) {}
  749. ggml_tensor * build_graph(ggml_context * ctx) override {
  750. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  751. ggml_tensor * out = ggml_rms_norm(ctx, a, eps);
  752. return out;
  753. }
  754. };
  755. // GGML_OP_MUL_MAT
  756. struct test_mul_mat : public test_case {
  757. const ggml_type type_a;
  758. const ggml_type type_b;
  759. const int64_t m;
  760. const int64_t n;
  761. const int64_t k;
  762. const std::array<int64_t, 2> bs; // dims 3 and 4
  763. const std::array<int64_t, 2> nr; // repeat in dims 3 and 4
  764. std::string vars() override {
  765. return VARS_TO_STR7(type_a, type_b, m, n, k, bs, nr);
  766. }
  767. double max_nmse_err() override {
  768. return 5e-4;
  769. }
  770. size_t op_size(ggml_tensor * t) override {
  771. size_t a = ggml_nbytes(t->src[0]) * n * nr[0] * nr[1];
  772. size_t b = ggml_nbytes(t->src[1]) * m;
  773. size_t c = ggml_nbytes(t);
  774. return a + b + c;
  775. GGML_UNUSED(t);
  776. }
  777. test_mul_mat(ggml_type type_a = GGML_TYPE_F32, ggml_type type_b = GGML_TYPE_F32,
  778. int64_t m = 32, int64_t n = 32, int64_t k = 32,
  779. std::array<int64_t, 2> bs = {10, 10},
  780. std::array<int64_t, 2> nr = {2, 2})
  781. : type_a(type_a), type_b(type_b), m(m), n(n), k(k), bs(bs), nr(nr) {}
  782. ggml_tensor * build_graph(ggml_context * ctx) override {
  783. // C^T = A * B^T: (k, m) * (k, n) => (m, n)
  784. ggml_tensor * a = ggml_new_tensor_4d(ctx, type_a, k, m, bs[0] , bs[1]);
  785. ggml_tensor * b = ggml_new_tensor_4d(ctx, type_b, k, n, bs[0]*nr[0], bs[1]*nr[1]);
  786. ggml_tensor * out = ggml_mul_mat(ctx, a, b);
  787. return out;
  788. }
  789. };
  790. // GGML_OP_MUL_MAT_ID
  791. struct test_mul_mat_id : public test_case {
  792. const ggml_type type_a;
  793. const ggml_type type_b;
  794. const int n_mats;
  795. const int id;
  796. const int64_t m;
  797. const int64_t n;
  798. const int64_t k;
  799. const bool v; // view (non-contiguous ids)
  800. std::string vars() override {
  801. return VARS_TO_STR8(type_a, type_b, n_mats, id, m, n, k, v);
  802. }
  803. double max_nmse_err() override {
  804. return 5e-4;
  805. }
  806. size_t op_size(ggml_tensor * t) override {
  807. size_t a = ggml_nbytes(t->src[2]) * n;
  808. size_t b = ggml_nbytes(t->src[1]) * m;
  809. size_t c = ggml_nbytes(t);
  810. return a + b + c;
  811. GGML_UNUSED(t);
  812. }
  813. test_mul_mat_id(ggml_type type_a = GGML_TYPE_F32, ggml_type type_b = GGML_TYPE_F32,
  814. int n_mats = 2, int id = 0,
  815. int64_t m = 32, int64_t n = 32, int64_t k = 32, bool v = false)
  816. : type_a(type_a), type_b(type_b), n_mats(n_mats), id(id),
  817. m(m), n(n), k(k), v(v) {}
  818. ggml_tensor * build_graph(ggml_context * ctx) override {
  819. // C^T = A * B^T: (k, m) * (k, n) => (m, n)
  820. ggml_tensor * mats = ggml_new_tensor_3d(ctx, type_a, k, m, n_mats);
  821. ggml_tensor * ids = ggml_new_tensor_2d(ctx, GGML_TYPE_I32, n_mats, n);
  822. if (v) {
  823. ids = ggml_view_2d(ctx, ids, n_mats/2, ids->ne[1], ids->nb[1], 0);
  824. }
  825. ggml_tensor * b = ggml_new_tensor_2d(ctx, type_b, k, n);
  826. ggml_tensor * out = ggml_mul_mat_id(ctx, mats, ids, v ? id/2 : id, b);
  827. return out;
  828. }
  829. void initialize_tensors(ggml_context * ctx) override {
  830. std::random_device rd;
  831. std::default_random_engine rng(rd());
  832. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  833. if (t->type == GGML_TYPE_I32) {
  834. if (ggml_is_view_op(t->op)) { continue; }
  835. // ids
  836. for (int64_t r = 0; r < ggml_nrows(t); r++) {
  837. std::vector<int32_t> data(t->ne[0]);
  838. for (int i = 0; i < t->ne[0]; i++) {
  839. data[i] = i % n_mats;
  840. }
  841. std::shuffle(data.begin(), data.end(), rng);
  842. ggml_backend_tensor_set(t, data.data(), r * t->nb[1], t->ne[0] * sizeof(int32_t));
  843. }
  844. } else {
  845. init_tensor_uniform(t);
  846. }
  847. }
  848. }
  849. };
  850. // GGML_OP_SQR
  851. struct test_sqr : public test_case {
  852. const ggml_type type;
  853. const std::array<int64_t, 4> ne;
  854. std::string vars() override {
  855. return VARS_TO_STR2(type, ne);
  856. }
  857. test_sqr(ggml_type type = GGML_TYPE_F32,
  858. std::array<int64_t, 4> ne = {10, 10, 10, 10})
  859. : type(type), ne(ne) {}
  860. ggml_tensor * build_graph(ggml_context * ctx) override {
  861. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  862. ggml_tensor * out = ggml_sqr(ctx, a);
  863. return out;
  864. }
  865. };
  866. // GGML_OP_CLAMP
  867. struct test_clamp : public test_case {
  868. const ggml_type type;
  869. const std::array<int64_t, 4> ne;
  870. float min;
  871. float max;
  872. std::string vars() override {
  873. return VARS_TO_STR4(type, ne, min, max);
  874. }
  875. test_clamp(ggml_type type = GGML_TYPE_F32,
  876. std::array<int64_t, 4> ne = {10, 10, 10, 10},
  877. float min = -0.5f, float max = 0.5f)
  878. : type(type), ne(ne), min(min), max(max) {}
  879. ggml_tensor * build_graph(ggml_context * ctx) override {
  880. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  881. ggml_tensor * out = ggml_clamp(ctx, a, min, max);
  882. return out;
  883. }
  884. };
  885. // GGML_OP_DIAG_MASK_INF
  886. struct test_diag_mask_inf : public test_case {
  887. const ggml_type type;
  888. const std::array<int64_t, 4> ne;
  889. const int n_past;
  890. std::string vars() override {
  891. return VARS_TO_STR3(type, ne, n_past);
  892. }
  893. test_diag_mask_inf(ggml_type type = GGML_TYPE_F32,
  894. std::array<int64_t, 4> ne = {10, 10, 10, 10},
  895. int n_past = 5)
  896. : type(type), ne(ne), n_past(n_past) {}
  897. ggml_tensor * build_graph(ggml_context * ctx) override {
  898. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  899. ggml_tensor * out = ggml_diag_mask_inf(ctx, a, n_past);
  900. return out;
  901. }
  902. };
  903. // GGML_OP_SOFT_MAX
  904. struct test_soft_max : public test_case {
  905. const ggml_type type;
  906. const std::array<int64_t, 4> ne;
  907. const bool mask;
  908. const float scale;
  909. const float max_bias;
  910. std::string vars() override {
  911. return VARS_TO_STR5(type, ne, mask, scale, max_bias);
  912. }
  913. test_soft_max(ggml_type type = GGML_TYPE_F32,
  914. std::array<int64_t, 4> ne = {10, 10, 10, 10},
  915. bool mask = false,
  916. float scale = 1.0f,
  917. float max_bias = 0.0f)
  918. : type(type), ne(ne), mask(mask), scale(scale), max_bias(max_bias) {}
  919. ggml_tensor * build_graph(ggml_context * ctx) override {
  920. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  921. ggml_tensor * mask = nullptr;
  922. if (this->mask) {
  923. mask = ggml_new_tensor_2d(ctx, type, ne[0], ne[1]);
  924. }
  925. ggml_tensor * pos = nullptr;
  926. if (max_bias > 0.0f) {
  927. pos = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, ne[0]);
  928. }
  929. ggml_tensor * out = ggml_soft_max_ext(ctx, a, mask, pos, scale, max_bias);
  930. return out;
  931. }
  932. };
  933. // GGML_OP_ROPE
  934. struct test_rope : public test_case {
  935. const ggml_type type;
  936. const std::array<int64_t, 4> ne;
  937. int n_dims;
  938. int mode;
  939. int n_ctx;
  940. std::string vars() override {
  941. return VARS_TO_STR5(type, ne, n_dims, mode, n_ctx);
  942. }
  943. test_rope(ggml_type type = GGML_TYPE_F32,
  944. std::array<int64_t, 4> ne = {10, 10, 10, 1},
  945. int n_dims = 10, int mode = 0, int n_ctx = 512)
  946. : type(type), ne(ne), n_dims(n_dims), mode(mode), n_ctx(n_ctx) {}
  947. ggml_tensor * build_graph(ggml_context * ctx) override {
  948. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  949. ggml_tensor * pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, ne[2]);
  950. ggml_tensor * out = ggml_rope(ctx, a, pos, n_dims, mode, n_ctx);
  951. return out;
  952. }
  953. void initialize_tensors(ggml_context * ctx) override {
  954. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  955. if (t->type == GGML_TYPE_I32) {
  956. // pos
  957. std::vector<int> data(ne[2]);
  958. for (int i = 0; i < ne[2]; i++) {
  959. data[i] = rand() % n_ctx;
  960. }
  961. ggml_backend_tensor_set(t, data.data(), 0, ne[2] * sizeof(int));
  962. } else {
  963. init_tensor_uniform(t);
  964. }
  965. }
  966. }
  967. };
  968. // GGML_OP_POOL2D
  969. struct test_pool2d : public test_case {
  970. enum ggml_op_pool pool_type;
  971. const ggml_type type_input;
  972. const std::array<int64_t, 4> ne_input;
  973. // kernel size
  974. const int k0;
  975. const int k1;
  976. // stride
  977. const int s0;
  978. const int s1;
  979. // padding
  980. const int p0;
  981. const int p1;
  982. std::string vars() override {
  983. return VARS_TO_STR9(pool_type, type_input, ne_input, k0, k1, s0, s1, p0, p1);
  984. }
  985. test_pool2d(ggml_op_pool pool_type = GGML_OP_POOL_AVG,
  986. ggml_type type_input = GGML_TYPE_F32,
  987. std::array<int64_t, 4> ne_input = {10, 10, 3, 1}, // [input_width, input_height, input_channels, 1]
  988. int k0 = 3, int k1 = 3,
  989. int s0 = 1, int s1 = 1,
  990. int p0 = 1, int p1 = 1)
  991. : pool_type(pool_type), type_input(type_input), ne_input(ne_input), k0(k0), k1(k1), s0(s0), s1(s1), p0(p0), p1(p1) {}
  992. ggml_tensor * build_graph(ggml_context * ctx) override {
  993. ggml_tensor * input = ggml_new_tensor(ctx, type_input, 4, ne_input.data());
  994. ggml_tensor * out = ggml_pool_2d(ctx, input, pool_type, k0, k1, s0, s1, p0, p1);
  995. return out;
  996. }
  997. };
  998. // GGML_OP_IM2COL
  999. struct test_im2col : public test_case {
  1000. const ggml_type type_input;
  1001. const ggml_type type_kernel;
  1002. const ggml_type dst_type;
  1003. const std::array<int64_t, 4> ne_input;
  1004. const std::array<int64_t, 4> ne_kernel;
  1005. // stride
  1006. const int s0;
  1007. const int s1;
  1008. // padding
  1009. const int p0;
  1010. const int p1;
  1011. // dilatation
  1012. const int d0;
  1013. const int d1;
  1014. // mode
  1015. const bool is_2D;
  1016. std::string vars() override {
  1017. return VARS_TO_STR12(type_input, type_kernel, dst_type, ne_input, ne_kernel, s0, s1, p0, p1, d0, d1, is_2D);
  1018. }
  1019. test_im2col(ggml_type type_input = GGML_TYPE_F32, ggml_type type_kernel = GGML_TYPE_F16, ggml_type dst_type = GGML_TYPE_F32,
  1020. std::array<int64_t, 4> ne_input = {10, 10, 3, 1}, // [input_width, input_height, input_channels, 1]
  1021. std::array<int64_t, 4> ne_kernel = {3, 3, 3, 1}, // [kernel_width, kernel_height, input_channels, 1]
  1022. int s0 = 1, int s1 = 1,
  1023. int p0 = 1, int p1 = 1,
  1024. int d0 = 1, int d1 = 1,
  1025. bool is_2D = true)
  1026. : 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) {}
  1027. ggml_tensor * build_graph(ggml_context * ctx) override {
  1028. ggml_tensor * input = ggml_new_tensor(ctx, type_input, 4, ne_input.data());
  1029. ggml_tensor * kernel = ggml_new_tensor(ctx, type_kernel, 4, ne_kernel.data());
  1030. ggml_tensor * out = ggml_im2col(ctx, kernel, input, s0, s1, p0, p1, d0, d1, is_2D, dst_type);
  1031. return out;
  1032. }
  1033. };
  1034. // GGML_OP_CONCAT
  1035. struct test_concat : public test_case {
  1036. const ggml_type type;
  1037. const std::array<int64_t, 4> ne;
  1038. const int64_t b_ne2;
  1039. std::string vars() override {
  1040. return VARS_TO_STR3(type, ne, b_ne2);
  1041. }
  1042. test_concat(ggml_type type = GGML_TYPE_F32,
  1043. std::array<int64_t, 4> ne = {10, 10, 10, 10},
  1044. int64_t b_ne2 = 10)
  1045. : type(type), ne(ne), b_ne2(b_ne2) {}
  1046. ggml_tensor * build_graph(ggml_context * ctx) override {
  1047. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1048. ggml_tensor * b = ggml_new_tensor_4d(ctx, type, ne[0], ne[1], b_ne2, ne[3]);
  1049. ggml_tensor * out = ggml_concat(ctx, a, b);
  1050. return out;
  1051. }
  1052. };
  1053. // GGML_OP_ARGSORT
  1054. struct test_argsort : public test_case {
  1055. const ggml_type type;
  1056. const std::array<int64_t, 4> ne;
  1057. ggml_sort_order order;
  1058. std::string vars() override {
  1059. return VARS_TO_STR3(type, ne, order);
  1060. }
  1061. test_argsort(ggml_type type = GGML_TYPE_F32,
  1062. std::array<int64_t, 4> ne = {16, 10, 10, 10},
  1063. ggml_sort_order order = GGML_SORT_ORDER_ASC)
  1064. : type(type), ne(ne), order(order) {}
  1065. ggml_tensor * build_graph(ggml_context * ctx) override {
  1066. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1067. ggml_tensor * out = ggml_argsort(ctx, a, order);
  1068. return out;
  1069. }
  1070. void initialize_tensors(ggml_context * ctx) override {
  1071. std::random_device rd;
  1072. std::default_random_engine rng(rd());
  1073. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1074. if (t->type == GGML_TYPE_I32) {
  1075. // indices
  1076. std::vector<int> data(ggml_nelements(t));
  1077. for (int i = 0; i < ggml_nelements(t); i++) {
  1078. data[i] = rand();
  1079. }
  1080. std::shuffle(data.begin(), data.end(), rng);
  1081. ggml_backend_tensor_set(t, data.data(), 0, ne[0]*ne[1]*ne[2]*ne[3] * sizeof(int));
  1082. } else if (t->type == GGML_TYPE_F32) {
  1083. // initialize with unique values to avoid ties
  1084. for (int64_t r = 0; r < ggml_nrows(t); r++) {
  1085. std::vector<float> data(t->ne[0]);
  1086. for (int i = 0; i < t->ne[0]; i++) {
  1087. data[i] = i;
  1088. }
  1089. std::shuffle(data.begin(), data.end(), rng);
  1090. ggml_backend_tensor_set(t, data.data(), r * t->nb[1], t->ne[0] * sizeof(float));
  1091. }
  1092. } else {
  1093. GGML_ASSERT(false);
  1094. }
  1095. }
  1096. }
  1097. };
  1098. // GGML_OP_SUM_ROWS
  1099. struct test_sum_rows : public test_case {
  1100. const ggml_type type;
  1101. const std::array<int64_t, 4> ne;
  1102. std::string vars() override {
  1103. return VARS_TO_STR2(type, ne);
  1104. }
  1105. test_sum_rows(ggml_type type = GGML_TYPE_F32,
  1106. std::array<int64_t, 4> ne = {10, 10, 10, 10})
  1107. : type(type), ne(ne) {}
  1108. ggml_tensor * build_graph(ggml_context * ctx) override {
  1109. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1110. ggml_tensor * out = ggml_sum_rows(ctx, a);
  1111. return out;
  1112. }
  1113. };
  1114. // GGML_OP_UPSCALE
  1115. struct test_upscale : public test_case {
  1116. const ggml_type type;
  1117. const std::array<int64_t, 4> ne;
  1118. const int32_t scale_factor;
  1119. std::string vars() override {
  1120. return VARS_TO_STR3(type, ne, scale_factor);
  1121. }
  1122. test_upscale(ggml_type type = GGML_TYPE_F32,
  1123. std::array<int64_t, 4> ne = {512, 512, 3, 1},
  1124. int32_t scale_factor = 2)
  1125. : type(type), ne(ne), scale_factor(scale_factor) {}
  1126. ggml_tensor * build_graph(ggml_context * ctx) override {
  1127. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1128. ggml_tensor * out = ggml_upscale(ctx, a, scale_factor);
  1129. return out;
  1130. }
  1131. };
  1132. // GGML_OP_GROUP_NORM
  1133. struct test_group_norm : public test_case {
  1134. const ggml_type type;
  1135. const std::array<int64_t, 4> ne;
  1136. const int32_t num_groups;
  1137. std::string vars() override {
  1138. return VARS_TO_STR3(type, ne, num_groups);
  1139. }
  1140. test_group_norm(ggml_type type = GGML_TYPE_F32,
  1141. std::array<int64_t, 4> ne = {64, 64, 320, 1},
  1142. int32_t num_groups = 32)
  1143. : type(type), ne(ne), num_groups(num_groups) {}
  1144. ggml_tensor * build_graph(ggml_context * ctx) override {
  1145. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne.data());
  1146. ggml_tensor * out = ggml_group_norm(ctx, a, num_groups);
  1147. return out;
  1148. }
  1149. };
  1150. // GGML_OP_ACC
  1151. struct test_acc : public test_case {
  1152. const ggml_type type;
  1153. const std::array<int64_t, 4> ne_a;
  1154. const std::array<int64_t, 4> ne_b;
  1155. std::string vars() override {
  1156. return VARS_TO_STR3(type, ne_a, ne_b);
  1157. }
  1158. test_acc(ggml_type type = GGML_TYPE_F32,
  1159. std::array<int64_t, 4> ne_a = {1024, 577, 1, 1},
  1160. std::array<int64_t, 4> ne_b = {1024, 576, 1, 1})
  1161. : type(type), ne_a(ne_a), ne_b(ne_b) {}
  1162. ggml_tensor * build_graph(ggml_context * ctx) override {
  1163. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1164. ggml_tensor * b = ggml_new_tensor(ctx, type, 4, ne_b.data());
  1165. ggml_tensor * out = ggml_acc(ctx, a, b, a->nb[1], a->nb[2], a->nb[3], b->nb[1]);
  1166. return out;
  1167. }
  1168. };
  1169. // GGML_OP_PAD
  1170. struct test_pad : public test_case {
  1171. const ggml_type type;
  1172. const std::array<int64_t, 4> ne_a;
  1173. const int pad_0;
  1174. const int pad_1;
  1175. std::string vars() override {
  1176. return VARS_TO_STR4(type, ne_a, pad_0, pad_1);
  1177. }
  1178. test_pad(ggml_type type = GGML_TYPE_F32,
  1179. std::array<int64_t, 4> ne_a = {512, 512, 1, 1},
  1180. int pad_0 = 1, int pad_1 = 1)
  1181. : type(type), ne_a(ne_a), pad_0(pad_0), pad_1(pad_1) {}
  1182. ggml_tensor * build_graph(ggml_context * ctx) override {
  1183. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1184. ggml_tensor * out = ggml_pad(ctx, a, pad_0, pad_1, 0, 0);
  1185. return out;
  1186. }
  1187. };
  1188. // GGML_OP_ARANGE
  1189. struct test_arange : public test_case {
  1190. const ggml_type type;
  1191. const float start;
  1192. const float stop;
  1193. const float step;
  1194. std::string vars() override {
  1195. return VARS_TO_STR4(type, start, stop, step);
  1196. }
  1197. test_arange(ggml_type type = GGML_TYPE_F32,
  1198. float start = 0.f, float stop = 10.f, float step = 1.f)
  1199. : type(type), start(start), stop(stop), step(step) {}
  1200. ggml_tensor * build_graph(ggml_context * ctx) override {
  1201. ggml_tensor * out = ggml_arange(ctx, start, stop, step);
  1202. return out;
  1203. }
  1204. };
  1205. // GGML_OP_TIMESTEP_EMBEDDING
  1206. struct test_timestep_embedding : public test_case {
  1207. const ggml_type type;
  1208. const std::array<int64_t, 4> ne_a;
  1209. const int dim;
  1210. const int max_period;
  1211. std::string vars() override {
  1212. return VARS_TO_STR4(type, ne_a, dim, max_period);
  1213. }
  1214. test_timestep_embedding(ggml_type type = GGML_TYPE_F32,
  1215. std::array<int64_t, 4> ne_a = {2, 1, 1, 1},
  1216. int dim = 320, int max_period=10000)
  1217. : type(type), ne_a(ne_a), dim(dim), max_period(max_period) {}
  1218. ggml_tensor * build_graph(ggml_context * ctx) override {
  1219. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1220. ggml_tensor * out = ggml_timestep_embedding(ctx, a, dim, max_period);
  1221. return out;
  1222. }
  1223. };
  1224. // GGML_OP_LEAKY_RELU
  1225. struct test_leaky_relu : public test_case {
  1226. const ggml_type type;
  1227. const std::array<int64_t, 4> ne_a;
  1228. const float negative_slope;
  1229. std::string vars() override {
  1230. return VARS_TO_STR3(type, ne_a, negative_slope);
  1231. }
  1232. test_leaky_relu(ggml_type type = GGML_TYPE_F32,
  1233. std::array<int64_t, 4> ne_a = {10, 10, 10, 10},
  1234. float negative_slope = 0.1f)
  1235. : type(type), ne_a(ne_a), negative_slope(negative_slope) {}
  1236. ggml_tensor * build_graph(ggml_context * ctx) override {
  1237. ggml_tensor * a = ggml_new_tensor(ctx, type, 4, ne_a.data());
  1238. ggml_tensor * out = ggml_leaky_relu(ctx, a, negative_slope, true);
  1239. return out;
  1240. }
  1241. };
  1242. enum llm_norm_type {
  1243. LLM_NORM,
  1244. LLM_NORM_RMS,
  1245. };
  1246. struct llama_hparams {
  1247. uint32_t n_vocab;
  1248. uint32_t n_embd;
  1249. uint32_t n_head;
  1250. uint32_t n_head_kv;
  1251. static constexpr uint32_t n_layer = 1;
  1252. uint32_t n_rot;
  1253. uint32_t n_embd_head; // dimension of values (d_v)
  1254. uint32_t n_ff;
  1255. float f_norm_eps;
  1256. float f_norm_rms_eps;
  1257. // cparams
  1258. static constexpr uint32_t n_ctx = 512; // user-specified context size
  1259. static constexpr uint32_t n_orig_ctx = n_ctx;
  1260. // batch
  1261. int32_t n_tokens;
  1262. // llm_build_context
  1263. static constexpr int32_t n_kv = 32; // size of KV cache to consider (n_kv <= n_ctx
  1264. static constexpr int32_t kv_head = 1; // index of where we store new KV data in the cache
  1265. uint32_t n_embd_gqa() const { // dimension of key embeddings across all k-v heads
  1266. return n_embd_head * n_head_kv;
  1267. }
  1268. };
  1269. // LLM base class
  1270. struct test_llm : public test_case {
  1271. llama_hparams hp;
  1272. protected:
  1273. test_llm(llama_hparams hp)
  1274. : hp(std::move(hp)) {
  1275. }
  1276. public:
  1277. struct ggml_tensor * llm_build_norm(
  1278. struct ggml_context * ctx,
  1279. struct ggml_tensor * cur,
  1280. struct ggml_tensor * mw,
  1281. struct ggml_tensor * mb,
  1282. llm_norm_type type) {
  1283. switch (type) {
  1284. case LLM_NORM: cur = ggml_norm (ctx, cur, hp.f_norm_eps); break;
  1285. case LLM_NORM_RMS: cur = ggml_rms_norm(ctx, cur, hp.f_norm_rms_eps); break;
  1286. }
  1287. cur = ggml_mul(ctx, cur, mw);
  1288. if (mb) {
  1289. cur = ggml_add(ctx, cur, mb);
  1290. }
  1291. return cur;
  1292. }
  1293. void llm_build_kv_store(
  1294. struct ggml_context * ctx,
  1295. struct ggml_tensor * k_l,
  1296. struct ggml_tensor * v_l,
  1297. struct ggml_tensor * k_cur,
  1298. struct ggml_tensor * v_cur) {
  1299. // compute the transposed [n_tokens, n_embd] V matrix
  1300. struct ggml_tensor * v_cur_t = ggml_transpose(ctx, ggml_reshape_2d(ctx, v_cur, hp.n_embd_gqa(), hp.n_tokens));
  1301. struct ggml_tensor * k_cache_view = ggml_view_1d(ctx, k_l, hp.n_tokens*hp.n_embd_gqa(),
  1302. (ggml_row_size(k_l->type, hp.n_embd_gqa()))*hp.kv_head);
  1303. struct ggml_tensor * v_cache_view = ggml_view_2d(ctx, v_l, hp.n_tokens, hp.n_embd_gqa(),
  1304. ( hp.n_ctx)*ggml_element_size(v_l),
  1305. (hp.kv_head)*ggml_element_size(v_l));
  1306. // important: storing RoPE-ed version of K in the KV cache!
  1307. ggml_cpy(ctx, k_cur, k_cache_view);
  1308. ggml_cpy(ctx, v_cur_t, v_cache_view);
  1309. }
  1310. struct ggml_tensor * llm_build_kqv(
  1311. struct ggml_context * ctx,
  1312. struct ggml_tensor * k_l,
  1313. struct ggml_tensor * v_l,
  1314. struct ggml_tensor * q_cur,
  1315. struct ggml_tensor * kq_mask,
  1316. float kq_scale) {
  1317. struct ggml_tensor * q = ggml_permute(ctx, q_cur, 0, 2, 1, 3);
  1318. struct ggml_tensor * k =
  1319. ggml_view_3d(ctx, k_l,
  1320. hp.n_embd_head, hp.n_kv, hp.n_head_kv,
  1321. ggml_row_size(k_l->type, hp.n_embd_gqa()),
  1322. ggml_row_size(k_l->type, hp.n_embd_head),
  1323. 0);
  1324. struct ggml_tensor * kq = ggml_mul_mat(ctx, k, q);
  1325. kq = ggml_soft_max_ext(ctx, kq, kq_mask, nullptr, kq_scale, 0.0f);
  1326. // split cached v into n_head heads
  1327. struct ggml_tensor * v =
  1328. ggml_view_3d(ctx, v_l,
  1329. hp.n_kv, hp.n_embd_head, hp.n_head_kv,
  1330. ggml_element_size(v_l)*hp.n_ctx,
  1331. ggml_element_size(v_l)*hp.n_ctx*hp.n_embd_head,
  1332. 0);
  1333. struct ggml_tensor * kqv = ggml_mul_mat(ctx, v, kq);
  1334. struct ggml_tensor * kqv_merged = ggml_permute(ctx, kqv, 0, 2, 1, 3);
  1335. struct ggml_tensor * cur = ggml_cont_2d(ctx, kqv_merged, hp.n_embd_head*hp.n_head, hp.n_tokens);
  1336. struct ggml_tensor * wo = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd);
  1337. cur = ggml_mul_mat(ctx, wo, cur);
  1338. return cur;
  1339. }
  1340. void initialize_tensors(ggml_context * ctx) override {
  1341. for (ggml_tensor * t = ggml_get_first_tensor(ctx); t != NULL; t = ggml_get_next_tensor(ctx, t)) {
  1342. if (t->type == GGML_TYPE_I32) {
  1343. // pos
  1344. std::vector<int> data(hp.n_tokens);
  1345. for (int i = 0; i < hp.n_tokens; i++) {
  1346. data[i] = rand() % hp.n_ctx;
  1347. }
  1348. ggml_backend_tensor_set(t, data.data(), 0, hp.n_tokens * sizeof(int));
  1349. } else {
  1350. init_tensor_uniform(t);
  1351. }
  1352. }
  1353. }
  1354. };
  1355. // Llama
  1356. struct test_llama : public test_llm {
  1357. static constexpr float freq_base = 10000.0f;
  1358. static constexpr float freq_scale = 1.0f;
  1359. static constexpr float ext_factor = 0.0f;
  1360. static constexpr float attn_factor = 1.0f;
  1361. static constexpr float beta_fast = 32.0f;
  1362. static constexpr float beta_slow = 1.0f;
  1363. std::string op_desc(ggml_tensor * t) override {
  1364. GGML_UNUSED(t);
  1365. return "LLAMA";
  1366. }
  1367. std::string vars() override {
  1368. auto n_tokens = hp.n_tokens;
  1369. return VARS_TO_STR1(n_tokens);
  1370. }
  1371. double max_nmse_err() override {
  1372. return 2e-3;
  1373. }
  1374. test_llama(int n_tokens = 1)
  1375. : test_llm({
  1376. /*n_vocab =*/ 32000,
  1377. /*n_embd =*/ 3200,
  1378. /*n_head =*/ 32,
  1379. /*n_head_kv =*/ 32,
  1380. /*n_rot =*/ 100,
  1381. /*n_embd_head =*/ 100,
  1382. /*n_ff =*/ 8640,
  1383. /*f_norm_eps =*/ 0.f,
  1384. /*f_norm_rms_eps =*/ 1e-5f,
  1385. /*n_tokens =*/ n_tokens,
  1386. }) {
  1387. }
  1388. ggml_tensor * build_graph(ggml_context * ctx) override {
  1389. struct ggml_tensor * cur;
  1390. struct ggml_tensor * inpL;
  1391. inpL = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, hp.n_embd, hp.n_tokens);
  1392. // inp_pos - contains the positions
  1393. struct ggml_tensor * inp_pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, hp.n_tokens);
  1394. // KQ_mask (mask for 1 head, it will be broadcasted to all heads)
  1395. struct ggml_tensor * KQ_mask = ggml_new_tensor_3d(ctx, GGML_TYPE_F32, hp.n_kv, hp.n_tokens, 1);
  1396. ggml_tensor * k_l = ggml_new_tensor_1d(ctx, GGML_TYPE_F16, 1638400);
  1397. ggml_tensor * v_l = ggml_new_tensor_1d(ctx, GGML_TYPE_F16, 1638400);
  1398. for (uint32_t il = 0; il < hp.n_layer; ++il) {
  1399. struct ggml_tensor * inpSA = inpL;
  1400. // norm
  1401. ggml_tensor * attn_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  1402. cur = llm_build_norm(ctx, inpL, attn_norm, nullptr, LLM_NORM_RMS);
  1403. // self-attention
  1404. {
  1405. ggml_tensor * wq = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd);
  1406. ggml_tensor * wk = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd_gqa());
  1407. ggml_tensor * wv = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd_gqa());
  1408. // compute Q and K and RoPE them
  1409. struct ggml_tensor * Qcur = ggml_mul_mat(ctx, wq, cur);
  1410. struct ggml_tensor * Kcur = ggml_mul_mat(ctx, wk, cur);
  1411. struct ggml_tensor * Vcur = ggml_mul_mat(ctx, wv, cur);
  1412. Qcur = ggml_rope_custom(
  1413. ctx, ggml_reshape_3d(ctx, Qcur, hp.n_embd_head, hp.n_head, hp.n_tokens), inp_pos,
  1414. hp.n_rot, 0, 0, hp.n_orig_ctx, freq_base, freq_scale,
  1415. ext_factor, attn_factor, beta_fast, beta_slow
  1416. );
  1417. Kcur = ggml_rope_custom(
  1418. ctx, ggml_reshape_3d(ctx, Kcur, hp.n_embd_head, hp.n_head_kv, hp.n_tokens), inp_pos,
  1419. hp.n_rot, 0, 0, hp.n_orig_ctx, freq_base, freq_scale,
  1420. ext_factor, attn_factor, beta_fast, beta_slow
  1421. );
  1422. llm_build_kv_store(ctx, k_l, v_l, Kcur, Vcur);
  1423. cur = llm_build_kqv(ctx, k_l, v_l, Qcur, KQ_mask, 1.0f/sqrtf(float(hp.n_embd_head)));
  1424. }
  1425. struct ggml_tensor * ffn_inp = ggml_add(ctx, cur, inpSA);
  1426. // feed-forward network
  1427. ggml_tensor * ffn_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  1428. cur = llm_build_norm(ctx, ffn_inp, ffn_norm, nullptr, LLM_NORM_RMS);
  1429. ggml_tensor * ffn_gate = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_ff);
  1430. ggml_tensor * ffn_down = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_ff, hp.n_embd);
  1431. ggml_tensor * ffn_up = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_ff);
  1432. struct ggml_tensor * tmp = ggml_mul_mat(ctx, ffn_up, cur);
  1433. cur = ggml_mul_mat(ctx, ffn_gate, cur);
  1434. cur = ggml_silu(ctx, cur);
  1435. cur = ggml_mul(ctx, cur, tmp);
  1436. cur = ggml_mul_mat(ctx, ffn_down, cur);
  1437. cur = ggml_add(ctx, cur, ffn_inp);
  1438. // input for next layer
  1439. inpL = cur;
  1440. }
  1441. cur = inpL;
  1442. ggml_tensor * output_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  1443. cur = llm_build_norm(ctx, cur, output_norm, nullptr, LLM_NORM_RMS);
  1444. // lm_head
  1445. ggml_tensor * output = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_vocab);
  1446. cur = ggml_mul_mat(ctx, output, cur);
  1447. return cur;
  1448. }
  1449. };
  1450. // Falcon
  1451. struct test_falcon : public test_llm {
  1452. static constexpr float freq_base = 10000.0f;
  1453. static constexpr float freq_scale = 1.0f;
  1454. static constexpr float ext_factor = 0.0f;
  1455. static constexpr float attn_factor = 1.0f;
  1456. static constexpr float beta_fast = 32.0f;
  1457. static constexpr float beta_slow = 1.0f;
  1458. std::string op_desc(ggml_tensor * t) override {
  1459. GGML_UNUSED(t);
  1460. return "FALCON";
  1461. }
  1462. std::string vars() override {
  1463. auto n_tokens = hp.n_tokens;
  1464. return VARS_TO_STR1(n_tokens);
  1465. }
  1466. double max_nmse_err() override {
  1467. return 2e-3;
  1468. }
  1469. test_falcon(int n_tokens = 1)
  1470. : test_llm({
  1471. /*n_vocab =*/ 32000,
  1472. /*n_embd =*/ 3200,
  1473. /*n_head =*/ 50,
  1474. /*n_head_kv =*/ 1,
  1475. /*n_rot =*/ 64,
  1476. /*n_embd_head =*/ 64,
  1477. /*n_ff =*/ 8640,
  1478. /*f_norm_eps =*/ 1e-5f,
  1479. /*f_norm_rms_eps =*/ 0.f,
  1480. /*n_tokens =*/ n_tokens,
  1481. }) {
  1482. }
  1483. ggml_tensor * build_graph(ggml_context * ctx) override {
  1484. struct ggml_tensor * cur;
  1485. struct ggml_tensor * inpL;
  1486. inpL = ggml_new_tensor_2d(ctx, GGML_TYPE_F32, hp.n_embd, hp.n_tokens);
  1487. // inp_pos - contains the positions
  1488. struct ggml_tensor * inp_pos = ggml_new_tensor_1d(ctx, GGML_TYPE_I32, hp.n_tokens);
  1489. // KQ_mask (mask for 1 head, it will be broadcasted to all heads)
  1490. struct ggml_tensor * KQ_mask = ggml_new_tensor_3d(ctx, GGML_TYPE_F32, hp.n_kv, hp.n_tokens, 1);
  1491. ggml_tensor * k_l = ggml_new_tensor_1d(ctx, GGML_TYPE_F16, 1638400);
  1492. ggml_tensor * v_l = ggml_new_tensor_1d(ctx, GGML_TYPE_F16, 1638400);
  1493. for (uint32_t il = 0; il < hp.n_layer; ++il) {
  1494. // norm
  1495. ggml_tensor * attn_norm_w = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  1496. ggml_tensor * attn_norm_b = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  1497. ggml_tensor * attn_norm = llm_build_norm(ctx, inpL, attn_norm_w, attn_norm_b, LLM_NORM);
  1498. // self-attention
  1499. {
  1500. cur = attn_norm;
  1501. ggml_tensor * wqkv = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_embd + 2*hp.n_embd_gqa());
  1502. cur = ggml_mul_mat(ctx, wqkv, cur);
  1503. 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)));
  1504. 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)));
  1505. 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())));
  1506. Qcur = ggml_reshape_3d(ctx, Qcur, hp.n_embd_head, hp.n_head, hp.n_tokens);
  1507. Kcur = ggml_reshape_3d(ctx, Kcur, hp.n_embd_head, hp.n_head_kv, hp.n_tokens);
  1508. // using mode = 2 for neox mode
  1509. Qcur = ggml_rope_custom(
  1510. ctx, Qcur, inp_pos, hp.n_rot, 2, 0, hp.n_orig_ctx,
  1511. freq_base, freq_scale, ext_factor, attn_factor, beta_fast, beta_slow
  1512. );
  1513. Kcur = ggml_rope_custom(
  1514. ctx, Kcur, inp_pos, hp.n_rot, 2, 0, hp.n_orig_ctx,
  1515. freq_base, freq_scale, ext_factor, attn_factor, beta_fast, beta_slow
  1516. );
  1517. llm_build_kv_store(ctx, k_l, v_l, Kcur, Vcur);
  1518. cur = llm_build_kqv(ctx, k_l, v_l, Qcur, KQ_mask, 1.0f/sqrtf(float(hp.n_embd_head)));
  1519. }
  1520. struct ggml_tensor * ffn_inp = cur;
  1521. // feed forward
  1522. {
  1523. ggml_tensor * ffn_up = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_embd, hp.n_ff);
  1524. ggml_tensor * ffn_down = ggml_new_tensor_2d(ctx, GGML_TYPE_Q4_0, hp.n_ff, hp.n_embd);
  1525. cur = attn_norm;
  1526. cur = ggml_mul_mat(ctx, ffn_up, cur);
  1527. cur = ggml_gelu(ctx, cur);
  1528. cur = ggml_mul_mat(ctx, ffn_down, cur);
  1529. }
  1530. cur = ggml_add(ctx, cur, ffn_inp);
  1531. cur = ggml_add(ctx, cur, inpL);
  1532. // input for next layer
  1533. inpL = cur;
  1534. }
  1535. cur = inpL;
  1536. ggml_tensor * output_norm = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  1537. ggml_tensor * output_norm_b = ggml_new_tensor_1d(ctx, GGML_TYPE_F32, hp.n_embd);
  1538. cur = llm_build_norm(ctx, cur, output_norm, output_norm_b, LLM_NORM);
  1539. // lm_head
  1540. ggml_tensor * output = ggml_new_tensor_2d(ctx, GGML_TYPE_Q8_0, hp.n_embd, hp.n_vocab);
  1541. cur = ggml_mul_mat(ctx, output, cur);
  1542. return cur;
  1543. }
  1544. };
  1545. static bool test_backend(ggml_backend_t backend, test_mode mode, const char * op_name) {
  1546. std::vector<std::unique_ptr<test_case>> test_cases;
  1547. std::default_random_engine rng(0);
  1548. const ggml_type all_types[] = {
  1549. GGML_TYPE_F32, GGML_TYPE_F16,
  1550. GGML_TYPE_Q4_0, GGML_TYPE_Q4_1,
  1551. GGML_TYPE_Q5_0, GGML_TYPE_Q5_1,
  1552. GGML_TYPE_Q8_0,
  1553. GGML_TYPE_Q2_K, GGML_TYPE_Q3_K,
  1554. GGML_TYPE_Q4_K, GGML_TYPE_Q5_K,
  1555. GGML_TYPE_Q6_K,
  1556. GGML_TYPE_IQ2_XXS, GGML_TYPE_IQ2_XS, GGML_TYPE_IQ2_S,
  1557. GGML_TYPE_IQ3_XXS, GGML_TYPE_IQ1_S, GGML_TYPE_IQ1_M,
  1558. GGML_TYPE_IQ4_NL, GGML_TYPE_IQ3_S, GGML_TYPE_IQ4_XS,
  1559. };
  1560. // unary ops
  1561. for (int op = 0; op < GGML_UNARY_OP_COUNT; op++) {
  1562. test_cases.emplace_back(new test_unary((ggml_unary_op) op));
  1563. test_cases.emplace_back(new test_unary((ggml_unary_op) op, GGML_TYPE_F32, { 7, 13, 19, 23 }));
  1564. }
  1565. test_cases.emplace_back(new test_get_rows(GGML_TYPE_F32, 1, 8, 2, 1, false));
  1566. for (ggml_type type : all_types) {
  1567. for (int b : {1, 7}) {
  1568. for (bool v : {false, true}) {
  1569. test_cases.emplace_back(new test_get_rows(type, 256, 5, 4, b, v));
  1570. }
  1571. }
  1572. }
  1573. for (int b : {1, 7}) {
  1574. for (bool v : {false, true}) {
  1575. test_cases.emplace_back(new test_get_rows(GGML_TYPE_I32, 256, 5, 4, b, v));
  1576. }
  1577. }
  1578. for (ggml_type type_input : {GGML_TYPE_F32}) {
  1579. for (ggml_op_pool pool_type : {GGML_OP_POOL_AVG, GGML_OP_POOL_MAX}) {
  1580. for (int k0 : {1, 3}) {
  1581. for (int k1 : {1, 3}) {
  1582. for (int s0 : {1, 2}) {
  1583. for (int s1 : {1, 2}) {
  1584. for (int p0 : {0, 1}) {
  1585. for (int p1 : {0, 1}) {
  1586. test_cases.emplace_back(new test_pool2d(pool_type, type_input, {10, 10, 3, 1}, k0, k1, s0, s1, p0, p1));
  1587. }
  1588. }
  1589. }
  1590. }
  1591. }
  1592. }
  1593. }
  1594. }
  1595. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F32));
  1596. test_cases.emplace_back(new test_im2col(GGML_TYPE_F32, GGML_TYPE_F16, GGML_TYPE_F16));
  1597. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 10, 10, 10}, {1, 1, 1, 1}));
  1598. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 10, 10, 10}, {2, 1, 1, 1}));
  1599. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 10, 10, 10}, {1, 2, 1, 1}));
  1600. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 10, 10, 10}, {1, 1, 2, 1}));
  1601. test_cases.emplace_back(new test_repeat(GGML_TYPE_F32, {10, 10, 10, 10}, {1, 1, 1, 2}));
  1602. test_cases.emplace_back(new test_repeat(GGML_TYPE_I32, {10, 10, 10, 10}, {2, 1, 1, 1}));
  1603. test_cases.emplace_back(new test_repeat(GGML_TYPE_I16, {10, 10, 10, 10}, {1, 1, 1, 2}));
  1604. test_cases.emplace_back(new test_dup(GGML_TYPE_F32));
  1605. test_cases.emplace_back(new test_dup(GGML_TYPE_F16));
  1606. test_cases.emplace_back(new test_dup(GGML_TYPE_I32));
  1607. test_cases.emplace_back(new test_dup(GGML_TYPE_I16));
  1608. test_cases.emplace_back(new test_dup(GGML_TYPE_I16, {10, 8, 3, 1}, {0, 2, 1, 3}));
  1609. test_cases.emplace_back(new test_dup(GGML_TYPE_I16, {10, 8, 3, 1}, {1, 2, 0, 3}));
  1610. for (ggml_type type_src : {GGML_TYPE_F16, GGML_TYPE_F32}) {
  1611. for (ggml_type type_dst : all_types) {
  1612. test_cases.emplace_back(new test_cpy(type_src, type_dst, {256, 4, 4, 4}));
  1613. }
  1614. }
  1615. test_cases.emplace_back(new test_cont());
  1616. auto add_test_bin_bcast = [&](ggml_type type, std::array<int64_t, 4> ne, std::array<int, 4> nr) {
  1617. for (auto op : {ggml_add, ggml_mul, ggml_div}) {
  1618. test_cases.emplace_back(new test_bin_bcast(op, type, ne, nr));
  1619. }
  1620. };
  1621. add_test_bin_bcast(GGML_TYPE_F32, {1, 1, 8, 1}, {1, 1, 1, 1});
  1622. add_test_bin_bcast(GGML_TYPE_F32, {1, 1, 1, 1}, {32, 1, 1, 1});
  1623. add_test_bin_bcast(GGML_TYPE_F32, {1, 1, 320, 320}, {1, 1, 1, 1});
  1624. add_test_bin_bcast(GGML_TYPE_F32, {16, 10, 1, 1}, {1, 1, 1, 1});
  1625. add_test_bin_bcast(GGML_TYPE_F32, {16, 10, 10, 1}, {1, 1, 1, 1});
  1626. add_test_bin_bcast(GGML_TYPE_F32, {16, 10, 10, 10}, {1, 1, 1, 1});
  1627. add_test_bin_bcast(GGML_TYPE_F32, {16, 10, 10, 10}, {2, 1, 1, 1});
  1628. add_test_bin_bcast(GGML_TYPE_F32, {16, 10, 10, 10}, {1, 2, 1, 1});
  1629. add_test_bin_bcast(GGML_TYPE_F32, {16, 10, 10, 10}, {1, 1, 2, 1});
  1630. add_test_bin_bcast(GGML_TYPE_F32, {16, 10, 10, 10}, {1, 1, 1, 2});
  1631. add_test_bin_bcast(GGML_TYPE_F32, {16, 10, 10, 10}, {1, 1, 2, 2});
  1632. add_test_bin_bcast(GGML_TYPE_F32, {16, 10, 10, 10}, {1, 2, 2, 2});
  1633. add_test_bin_bcast(GGML_TYPE_F32, {16, 10, 10, 10}, {2, 2, 2, 2});
  1634. // stable diffusion
  1635. add_test_bin_bcast(GGML_TYPE_F32, {1280, 1, 1, 1}, {1, 1, 1, 1});
  1636. add_test_bin_bcast(GGML_TYPE_F32, {1280, 1, 1, 1}, {1, 16, 16, 1});
  1637. add_test_bin_bcast(GGML_TYPE_F32, {1280, 16, 16, 1}, {1, 1, 1, 1});
  1638. add_test_bin_bcast(GGML_TYPE_F32, {1280, 1, 1, 1}, {1, 256, 1, 1});
  1639. add_test_bin_bcast(GGML_TYPE_F32, {1, 1, 1280, 1}, {16, 16, 1, 1});
  1640. add_test_bin_bcast(GGML_TYPE_F32, {16, 16, 1280, 1}, {1, 1, 1, 1});
  1641. add_test_bin_bcast(GGML_TYPE_F32, {1, 1, 1920, 1}, {16, 16, 1, 1});
  1642. add_test_bin_bcast(GGML_TYPE_F32, {1, 1, 2560, 1}, {16, 16, 1, 1});
  1643. add_test_bin_bcast(GGML_TYPE_F32, {1, 1, 1280, 1}, {32, 32, 1, 1});
  1644. add_test_bin_bcast(GGML_TYPE_F32, {1, 1, 1920, 1}, {32, 32, 1, 1});
  1645. add_test_bin_bcast(GGML_TYPE_F32, {1, 1, 640, 1}, {32, 32, 1, 1});
  1646. add_test_bin_bcast(GGML_TYPE_F32, {5120, 1, 1, 1}, {1, 256, 1, 1});
  1647. add_test_bin_bcast(GGML_TYPE_F32, {640, 1, 1, 1}, {1, 1, 1, 1});
  1648. //add_test_bin_bcast(GGML_TYPE_F32, {3, 3, 2560, 1280}, {1, 1, 1, 1});
  1649. //add_test_bin_bcast(GGML_TYPE_F32, {3, 3, 2560, 1280}, {2, 1, 1, 1});
  1650. test_cases.emplace_back(new test_scale());
  1651. for (float eps : {1e-6f, 1e-5f, 1e-3f, 1e-1f}) {
  1652. test_cases.emplace_back(new test_norm(GGML_TYPE_F32, {64, 10, 10, 10}, eps));
  1653. test_cases.emplace_back(new test_rms_norm(GGML_TYPE_F32, {64, 10, 10, 10}, eps));
  1654. }
  1655. for (ggml_type type_a : all_types) {
  1656. for (ggml_type type_b : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  1657. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, 256, { 1, 1}, {1, 1}));
  1658. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, 256, {10, 1}, {1, 1}));
  1659. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, 256, {10, 1}, {2, 1}));
  1660. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, 256, {10, 10}, {1, 1}));
  1661. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, 256, {10, 10}, {2, 1}));
  1662. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, 256, {10, 10}, {1, 2}));
  1663. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 1, 256, {10, 10}, {2, 2}));
  1664. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, 256, { 1, 1}, {1, 1}));
  1665. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, 256, {10, 1}, {1, 1}));
  1666. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, 256, {10, 1}, {2, 1}));
  1667. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, 256, {10, 10}, {1, 1}));
  1668. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, 256, {10, 10}, {2, 1}));
  1669. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, 256, {10, 10}, {1, 2}));
  1670. test_cases.emplace_back(new test_mul_mat(type_a, type_b, 16, 16, 256, {10, 10}, {2, 2}));
  1671. }
  1672. }
  1673. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 64, 2, 128, { 8, 1}, {1, 1}));
  1674. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 83, 2, 128, { 8, 1}, {4, 1}));
  1675. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 64, 2, 64, { 8, 1}, {4, 1}));
  1676. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 83, 2, 64, { 8, 1}, {4, 1}));
  1677. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 64, 45, 128, { 8, 1}, {4, 1}));
  1678. test_cases.emplace_back(new test_mul_mat(GGML_TYPE_F16, GGML_TYPE_F32, 128, 45, 64, { 8, 1}, {4, 1}));
  1679. for (ggml_type type_a : all_types) {
  1680. for (ggml_type type_b : {GGML_TYPE_F32 /*, GGML_TYPE_F16 */}) {
  1681. for (int n_mats : {2, 4, 8}) {
  1682. for (int id = 0; id < n_mats; id++) {
  1683. for (bool v : {false, true}) {
  1684. test_cases.emplace_back(new test_mul_mat_id(type_a, type_b, n_mats, id, 16, 1, 256, v));
  1685. test_cases.emplace_back(new test_mul_mat_id(type_a, type_b, n_mats, id, 16, 16, 256, v));
  1686. }
  1687. }
  1688. }
  1689. }
  1690. }
  1691. test_cases.emplace_back(new test_sqr());
  1692. test_cases.emplace_back(new test_clamp());
  1693. test_cases.emplace_back(new test_diag_mask_inf(GGML_TYPE_F32, {10, 10, 1, 1}, 5));
  1694. test_cases.emplace_back(new test_diag_mask_inf(GGML_TYPE_F32, {10, 10, 10, 1}, 5));
  1695. test_cases.emplace_back(new test_diag_mask_inf(GGML_TYPE_F32, {10, 10, 10, 10}, 5));
  1696. #if 0
  1697. std::uniform_int_distribution<> dist_ne1(1, 50);
  1698. int exponent = 1;
  1699. while (exponent < (1 << 17)) {
  1700. std::uniform_int_distribution<> dist_ne0(exponent, 2*exponent);
  1701. for (int n = 0; n < 10; ++n) {
  1702. int64_t ne0 = dist_ne0(rng);
  1703. int64_t ne1 = dist_ne1(rng);
  1704. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0, ne1, 1, 1}, n/2 == 0, 0.1f, ne0 < 1000 ? 4.0f : 0.0f));
  1705. }
  1706. exponent <<= 1;
  1707. }
  1708. #endif
  1709. for (bool mask : {false, true}) {
  1710. for (float max_bias : {0.0f, 8.0f}) {
  1711. for (float scale : {1.0f, 0.1f}) {
  1712. for (int64_t ne0 : {16, 1024}) {
  1713. for (int64_t ne1 : {16, 1024}) {
  1714. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0, ne1, 1, 1}, mask, scale, max_bias));
  1715. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {ne0-1, ne1-1, 1, 1}, mask, scale, max_bias));
  1716. }
  1717. }
  1718. }
  1719. }
  1720. }
  1721. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {16, 2, 32, 1}, false, 0.1f, 0.0f));
  1722. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {32, 2, 32, 1}, true, 0.1f, 0.0f));
  1723. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {16, 2, 32, 1}, false, 0.1f, 8.0f));
  1724. test_cases.emplace_back(new test_soft_max(GGML_TYPE_F32, {32, 2, 32, 1}, true, 0.1f, 8.0f));
  1725. for (ggml_type type : {GGML_TYPE_F32, GGML_TYPE_F16}) {
  1726. test_cases.emplace_back(new test_rope(type, {128, 32, 10, 1}, 128, 0, 512)); // llama 7B
  1727. test_cases.emplace_back(new test_rope(type, {128, 40, 10, 1}, 128, 0, 512)); // llama 13B
  1728. test_cases.emplace_back(new test_rope(type, {128, 52, 10, 1}, 128, 0, 512)); // llama 30B
  1729. test_cases.emplace_back(new test_rope(type, {128, 64, 10, 1}, 128, 0, 512)); // llama 65B
  1730. test_cases.emplace_back(new test_rope(type, { 64, 1, 10, 1}, 64, 2, 512)); // neox (falcon 7B)
  1731. test_cases.emplace_back(new test_rope(type, { 64, 71, 10, 1}, 64, 2, 512)); // neox (falcon 7B)
  1732. test_cases.emplace_back(new test_rope(type, { 64, 8, 10, 1}, 64, 2, 512)); // neox (falcon 40B)
  1733. test_cases.emplace_back(new test_rope(type, { 64, 128, 10, 1}, 64, 2, 512)); // neox (falcon 40B)
  1734. test_cases.emplace_back(new test_rope(type, { 80, 32, 10, 1}, 20, 2, 512)); // neox (stablelm)
  1735. test_cases.emplace_back(new test_rope(type, { 80, 32, 10, 1}, 32, 2, 512)); // neox (phi-2)
  1736. }
  1737. test_cases.emplace_back(new test_concat(GGML_TYPE_F32));
  1738. test_cases.emplace_back(new test_concat(GGML_TYPE_I32));
  1739. for (ggml_sort_order order : {GGML_SORT_ORDER_ASC, GGML_SORT_ORDER_DESC}) {
  1740. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {8, 1, 1, 1}, order));
  1741. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {16, 10, 10, 10}, order));
  1742. test_cases.emplace_back(new test_argsort(GGML_TYPE_F32, {60, 10, 10, 10}, order)); // qwen
  1743. }
  1744. test_cases.emplace_back(new test_sum_rows());
  1745. test_cases.emplace_back(new test_upscale());
  1746. test_cases.emplace_back(new test_group_norm());
  1747. test_cases.emplace_back(new test_acc());
  1748. test_cases.emplace_back(new test_pad());
  1749. test_cases.emplace_back(new test_arange());
  1750. test_cases.emplace_back(new test_timestep_embedding());
  1751. test_cases.emplace_back(new test_leaky_relu());
  1752. // these tests are disabled to save execution time, but they can be handy for debugging
  1753. #if 0
  1754. test_cases.emplace_back(new test_llama(1));
  1755. test_cases.emplace_back(new test_llama(2));
  1756. test_cases.emplace_back(new test_falcon(1));
  1757. test_cases.emplace_back(new test_falcon(2));
  1758. #endif
  1759. // run tests
  1760. if (mode == MODE_TEST) {
  1761. ggml_backend_t backend_cpu = ggml_backend_cpu_init();
  1762. size_t n_ok = 0;
  1763. for (auto & test : test_cases) {
  1764. if (test->eval(backend, backend_cpu, op_name)) {
  1765. n_ok++;
  1766. }
  1767. }
  1768. printf(" %zu/%zu tests passed\n", n_ok, test_cases.size());
  1769. ggml_backend_free(backend_cpu);
  1770. return n_ok == test_cases.size();
  1771. }
  1772. if (mode == MODE_PERF) {
  1773. for (auto & test : test_cases) {
  1774. test->eval_perf(backend, op_name);
  1775. }
  1776. return true;
  1777. }
  1778. GGML_ASSERT(false);
  1779. return false;
  1780. }
  1781. static void usage(char ** argv) {
  1782. printf("Usage: %s [mode] [-o op] [-b backend]\n", argv[0]);
  1783. printf(" valid modes are: test (compare with CPU backend for correctness) or perf (performance evaluation)\n");
  1784. printf(" op names are as given by ggml_op_desc()\n");
  1785. }
  1786. int main(int argc, char ** argv) {
  1787. test_mode mode = MODE_TEST;
  1788. const char * op_name_filter = NULL;
  1789. const char * backend_filter = NULL;
  1790. for (int i = 1; i < argc; i++) {
  1791. if (strcmp(argv[i], "test") == 0) {
  1792. mode = MODE_TEST;
  1793. } else if (strcmp(argv[i], "perf") == 0) {
  1794. mode = MODE_PERF;
  1795. } else if (strcmp(argv[i], "-o") == 0) {
  1796. if (i + 1 < argc) {
  1797. op_name_filter = argv[++i];
  1798. } else {
  1799. usage(argv);
  1800. return 1;
  1801. }
  1802. } else if (strcmp(argv[i], "-b") == 0) {
  1803. if (i + 1 < argc) {
  1804. backend_filter = argv[++i];
  1805. } else {
  1806. usage(argv);
  1807. return 1;
  1808. }
  1809. } else {
  1810. usage(argv);
  1811. return 1;
  1812. }
  1813. }
  1814. // enumerate backends
  1815. printf("Testing %zu backends\n\n", ggml_backend_reg_get_count());
  1816. size_t n_ok = 0;
  1817. for (size_t i = 0; i < ggml_backend_reg_get_count(); i++) {
  1818. printf("Backend %zu/%zu (%s)\n", i + 1, ggml_backend_reg_get_count(), ggml_backend_reg_get_name(i));
  1819. if (backend_filter != NULL && strcmp(backend_filter, ggml_backend_reg_get_name(i)) != 0) {
  1820. printf(" Skipping\n");
  1821. n_ok++;
  1822. continue;
  1823. }
  1824. ggml_backend_t backend = ggml_backend_reg_init_backend(i, NULL);
  1825. GGML_ASSERT(backend != NULL);
  1826. if (backend_filter == NULL && ggml_backend_is_cpu(backend)) {
  1827. printf(" Skipping CPU backend\n");
  1828. ggml_backend_free(backend);
  1829. n_ok++;
  1830. continue;
  1831. }
  1832. printf(" Backend name: %s\n", ggml_backend_name(backend));
  1833. bool ok = test_backend(backend, mode, op_name_filter);
  1834. printf(" Backend %s: ", ggml_backend_name(backend));
  1835. if (ok) {
  1836. printf("\033[1;32mOK\033[0m\n");
  1837. n_ok++;
  1838. } else {
  1839. printf("\033[1;31mFAIL\033[0m\n");
  1840. }
  1841. printf("\n");
  1842. ggml_backend_free(backend);
  1843. }
  1844. printf("%zu/%zu backends passed\n", n_ok, ggml_backend_reg_get_count());
  1845. if (n_ok != ggml_backend_reg_get_count()) {
  1846. printf("\033[1;31mFAIL\033[0m\n");
  1847. return 1;
  1848. }
  1849. ggml_quantize_free();
  1850. printf("\033[1;32mOK\033[0m\n");
  1851. return 0;
  1852. }