clip.cpp 111 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650
  1. /**
  2. * llama.cpp - commit 8962422b1c6f9b8b15f5aeaea42600bcc2d44177 - do not edit this file
  3. *
  4. * MIT License
  5. *
  6. * Copyright (c) 2023-2024 The ggml authors
  7. *
  8. * Permission is hereby granted, free of charge, to any person obtaining a copy
  9. * of this software and associated documentation files (the "Software"), to deal
  10. * in the Software without restriction, including without limitation the rights
  11. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  12. * copies of the Software, and to permit persons to whom the Software is
  13. * furnished to do so, subject to the following conditions:
  14. *
  15. * The above copyright notice and this permission notice shall be included in all
  16. * copies or substantial portions of the Software.
  17. *
  18. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  19. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  20. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  21. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  22. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  23. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  24. * SOFTWARE.
  25. */
  26. // NOTE: This is modified from clip.cpp only for LLaVA,
  27. // so there might be still unnecessary artifacts hanging around
  28. // I'll gradually clean and extend it
  29. // Note: Even when using identical normalized image inputs (see normalize_image_u8_to_f32()) we have a significant difference in resulting embeddings compared to pytorch
  30. #include "clip.h"
  31. #include "log.h"
  32. #include "ggml.h"
  33. #include "ggml-alloc.h"
  34. #include "ggml-backend.h"
  35. #ifdef GGML_USE_CUDA
  36. #include "ggml-cuda.h"
  37. #endif
  38. #ifdef GGML_USE_METAL
  39. #include "ggml-metal.h"
  40. #endif
  41. #ifdef GGML_USE_CANN
  42. #include "ggml-cann.h"
  43. #endif
  44. #ifdef GGML_USE_VULKAN
  45. #include "ggml-vulkan.h"
  46. #endif
  47. #define STB_IMAGE_IMPLEMENTATION
  48. #include "stb_image.h"
  49. #include <cassert>
  50. #include <cmath>
  51. #include <cstdlib>
  52. #include <cstring>
  53. #include <fstream>
  54. #include <map>
  55. #include <regex>
  56. #include <stdexcept>
  57. #include <vector>
  58. #include <sstream>
  59. #include <cinttypes>
  60. #include <limits>
  61. //#define CLIP_DEBUG_FUNCTIONS
  62. // RGB uint8 image
  63. struct clip_image_u8 {
  64. int nx;
  65. int ny;
  66. std::vector<uint8_t> buf;
  67. };
  68. // RGB float32 image (NHWC)
  69. // Memory layout: RGBRGBRGB...
  70. struct clip_image_f32 {
  71. int nx;
  72. int ny;
  73. std::vector<float> buf;
  74. };
  75. static std::string format(const char * fmt, ...) {
  76. va_list ap;
  77. va_list ap2;
  78. va_start(ap, fmt);
  79. va_copy(ap2, ap);
  80. int size = vsnprintf(NULL, 0, fmt, ap);
  81. GGML_ASSERT(size >= 0 && size < INT_MAX); // NOLINT
  82. std::vector<char> buf(size + 1);
  83. int size2 = vsnprintf(buf.data(), size + 1, fmt, ap2);
  84. GGML_ASSERT(size2 == size);
  85. va_end(ap2);
  86. va_end(ap);
  87. return std::string(buf.data(), buf.size());
  88. }
  89. //
  90. // key constants
  91. //
  92. #define KEY_FTYPE "general.file_type"
  93. #define KEY_NAME "general.name"
  94. #define KEY_DESCRIPTION "general.description"
  95. #define KEY_HAS_TEXT_ENC "clip.has_text_encoder"
  96. #define KEY_HAS_VIS_ENC "clip.has_vision_encoder"
  97. #define KEY_HAS_LLAVA_PROJ "clip.has_llava_projector"
  98. #define KEY_HAS_MINICPMV_PROJ "clip.has_minicpmv_projector"
  99. #define KEY_MINICPMV_VERSION "clip.minicpmv_version"
  100. #define KEY_USE_GELU "clip.use_gelu"
  101. #define KEY_N_EMBD "clip.%s.embedding_length"
  102. #define KEY_N_FF "clip.%s.feed_forward_length"
  103. #define KEY_N_BLOCK "clip.%s.block_count"
  104. #define KEY_N_HEAD "clip.%s.attention.head_count"
  105. #define KEY_LAYER_NORM_EPS "clip.%s.attention.layer_norm_epsilon"
  106. #define KEY_PROJ_DIM "clip.%s.projection_dim"
  107. #define KEY_TOKENS "tokenizer.ggml.tokens"
  108. #define KEY_N_POSITIONS "clip.text.context_length"
  109. #define KEY_IMAGE_SIZE "clip.vision.image_size"
  110. #define KEY_PATCH_SIZE "clip.vision.patch_size"
  111. #define KEY_IMAGE_MEAN "clip.vision.image_mean"
  112. #define KEY_IMAGE_STD "clip.vision.image_std"
  113. #define KEY_PROJ_TYPE "clip.projector_type"
  114. #define KEY_MM_PATCH_MERGE_TYPE "clip.vision.mm_patch_merge_type"
  115. #define KEY_IMAGE_GRID_PINPOINTS "clip.vision.image_grid_pinpoints"
  116. #define KEY_IMAGE_CROP_RESOLUTION "clip.vision.image_crop_resolution"
  117. //
  118. // tensor name constants
  119. //
  120. #define TN_TOKEN_EMBD "%s.token_embd.weight"
  121. #define TN_POS_EMBD "%s.position_embd.weight"
  122. #define TN_CLASS_EMBD "v.class_embd"
  123. #define TN_PATCH_EMBD "v.patch_embd.weight"
  124. #define TN_PATCH_BIAS "v.patch_embd.bias"
  125. #define TN_ATTN_K "%s.blk.%d.attn_k.%s"
  126. #define TN_ATTN_Q "%s.blk.%d.attn_q.%s"
  127. #define TN_ATTN_V "%s.blk.%d.attn_v.%s"
  128. #define TN_ATTN_OUTPUT "%s.blk.%d.attn_out.%s"
  129. #define TN_FFN_DOWN "%s.blk.%d.ffn_down.%s"
  130. #define TN_FFN_UP "%s.blk.%d.ffn_up.%s"
  131. #define TN_LN_1 "%s.blk.%d.ln1.%s"
  132. #define TN_LN_2 "%s.blk.%d.ln2.%s"
  133. #define TN_LN_PRE "%s.pre_ln.%s"
  134. #define TN_LN_POST "%s.post_ln.%s"
  135. #define TN_TEXT_PROJ "text_projection.weight"
  136. #define TN_VIS_PROJ "visual_projection.weight"
  137. #define TN_LLAVA_PROJ "mm.%d.%s"
  138. #define TN_MVLM_PROJ_MLP "mm.model.mlp.%d.%s"
  139. #define TN_MVLM_PROJ_BLOCK "mm.model.mb_block.%d.block.%d.%s"
  140. #define TN_MVLM_PROJ_PEG "mm.model.peg.%d.%s"
  141. #define TN_IMAGE_NEWLINE "model.image_newline"
  142. #define TN_MINICPMV_POS_EMBD_K "resampler.pos_embed_k"
  143. #define TN_MINICPMV_QUERY "resampler.query"
  144. #define TN_MINICPMV_PROJ "resampler.proj.weight"
  145. #define TN_MINICPMV_KV_PROJ "resampler.kv.weight"
  146. #define TN_MINICPMV_ATTN "resampler.attn.%s.%s"
  147. #define TN_MINICPMV_LN "resampler.ln_%s.%s"
  148. enum projector_type {
  149. PROJECTOR_TYPE_MLP,
  150. PROJECTOR_TYPE_MLP_NORM,
  151. PROJECTOR_TYPE_LDP,
  152. PROJECTOR_TYPE_LDPV2,
  153. PROJECTOR_TYPE_RESAMPLER,
  154. PROJECTOR_TYPE_UNKNOWN,
  155. };
  156. static std::map<projector_type, std::string> PROJECTOR_TYPE_NAMES = {
  157. { PROJECTOR_TYPE_MLP, "mlp" },
  158. { PROJECTOR_TYPE_LDP, "ldp" },
  159. { PROJECTOR_TYPE_LDPV2, "ldpv2"},
  160. { PROJECTOR_TYPE_RESAMPLER, "resampler"},
  161. };
  162. //
  163. // utilities to get data from a gguf file
  164. //
  165. static int get_key_idx(const gguf_context * ctx, const char * key) {
  166. int i = gguf_find_key(ctx, key);
  167. if (i == -1) {
  168. LOG_TEE("key %s not found in file\n", key);
  169. throw std::runtime_error(format("Missing required key: %s", key));
  170. }
  171. return i;
  172. }
  173. static uint32_t get_u32(const gguf_context * ctx, const std::string & key) {
  174. const int i = get_key_idx(ctx, key.c_str());
  175. return gguf_get_val_u32(ctx, i);
  176. }
  177. static float get_f32(const gguf_context * ctx, const std::string & key) {
  178. const int i = get_key_idx(ctx, key.c_str());
  179. return gguf_get_val_f32(ctx, i);
  180. }
  181. static struct ggml_tensor * get_tensor(struct ggml_context * ctx, const std::string & name) {
  182. struct ggml_tensor * cur = ggml_get_tensor(ctx, name.c_str());
  183. if (!cur) {
  184. throw std::runtime_error(format("%s: unable to find tensor %s\n", __func__, name.c_str()));
  185. }
  186. return cur;
  187. }
  188. static std::string get_ftype(int ftype) {
  189. return ggml_type_name(static_cast<ggml_type>(ftype));
  190. }
  191. static std::string gguf_data_to_str(enum gguf_type type, const void * data, int i) {
  192. switch (type) {
  193. case GGUF_TYPE_UINT8: return std::to_string(((const uint8_t *)data)[i]);
  194. case GGUF_TYPE_INT8: return std::to_string(((const int8_t *)data)[i]);
  195. case GGUF_TYPE_UINT16: return std::to_string(((const uint16_t *)data)[i]);
  196. case GGUF_TYPE_INT16: return std::to_string(((const int16_t *)data)[i]);
  197. case GGUF_TYPE_UINT32: return std::to_string(((const uint32_t *)data)[i]);
  198. case GGUF_TYPE_INT32: return std::to_string(((const int32_t *)data)[i]);
  199. case GGUF_TYPE_UINT64: return std::to_string(((const uint64_t *)data)[i]);
  200. case GGUF_TYPE_INT64: return std::to_string(((const int64_t *)data)[i]);
  201. case GGUF_TYPE_FLOAT32: return std::to_string(((const float *)data)[i]);
  202. case GGUF_TYPE_FLOAT64: return std::to_string(((const double *)data)[i]);
  203. case GGUF_TYPE_BOOL: return ((const bool *)data)[i] ? "true" : "false";
  204. default: return format("unknown type %d", type);
  205. }
  206. }
  207. static void replace_all(std::string & s, const std::string & search, const std::string & replace) {
  208. if (search.empty()) {
  209. return;
  210. }
  211. std::string builder;
  212. builder.reserve(s.length());
  213. size_t pos = 0;
  214. size_t last_pos = 0;
  215. while ((pos = s.find(search, last_pos)) != std::string::npos) {
  216. builder.append(s, last_pos, pos - last_pos);
  217. builder.append(replace);
  218. last_pos = pos + search.length();
  219. }
  220. builder.append(s, last_pos, std::string::npos);
  221. s = std::move(builder);
  222. }
  223. static std::string gguf_kv_to_str(const struct gguf_context * ctx_gguf, int i) {
  224. const enum gguf_type type = gguf_get_kv_type(ctx_gguf, i);
  225. switch (type) {
  226. case GGUF_TYPE_STRING:
  227. return gguf_get_val_str(ctx_gguf, i);
  228. case GGUF_TYPE_ARRAY:
  229. {
  230. const enum gguf_type arr_type = gguf_get_arr_type(ctx_gguf, i);
  231. int arr_n = gguf_get_arr_n(ctx_gguf, i);
  232. const void * data = gguf_get_arr_data(ctx_gguf, i);
  233. std::stringstream ss;
  234. ss << "[";
  235. for (int j = 0; j < arr_n; j++) {
  236. if (arr_type == GGUF_TYPE_STRING) {
  237. std::string val = gguf_get_arr_str(ctx_gguf, i, j);
  238. // escape quotes
  239. replace_all(val, "\\", "\\\\");
  240. replace_all(val, "\"", "\\\"");
  241. ss << '"' << val << '"';
  242. } else if (arr_type == GGUF_TYPE_ARRAY) {
  243. ss << "???";
  244. } else {
  245. ss << gguf_data_to_str(arr_type, data, j);
  246. }
  247. if (j < arr_n - 1) {
  248. ss << ", ";
  249. }
  250. }
  251. ss << "]";
  252. return ss.str();
  253. }
  254. default:
  255. return gguf_data_to_str(type, gguf_get_val_data(ctx_gguf, i), 0);
  256. }
  257. }
  258. static void print_tensor_info(const ggml_tensor * tensor, const char * prefix = "") {
  259. size_t tensor_size = ggml_nbytes(tensor);
  260. LOG_TEE("%s: n_dims = %d, name = %s, tensor_size=%zu, shape:[%" PRId64 ", %" PRId64 ", %" PRId64 ", %" PRId64 "], type = %s\n",
  261. prefix, ggml_n_dims(tensor), tensor->name, tensor_size,
  262. tensor->ne[0], tensor->ne[1], tensor->ne[2], tensor->ne[3], ggml_type_name(tensor->type));
  263. }
  264. static projector_type clip_projector_type_from_string(const std::string & name) {
  265. for (const auto & kv : PROJECTOR_TYPE_NAMES) { // NOLINT
  266. if (kv.second == name) {
  267. return kv.first;
  268. }
  269. }
  270. return PROJECTOR_TYPE_UNKNOWN;
  271. }
  272. #ifdef CLIP_DEBUG_FUNCTIONS
  273. static void clip_image_write_image_to_ppm(const clip_image_u8& img, const std::string& filename) {
  274. std::ofstream file(filename, std::ios::binary);
  275. if (!file.is_open()) {
  276. LOG_TEE("Failed to open file for writing: %s\n", filename.c_str());
  277. return;
  278. }
  279. // PPM header: P6 format, width, height, and max color value
  280. file << "P6\n" << img.nx << " " << img.ny << "\n255\n";
  281. // Write pixel data
  282. for (size_t i = 0; i < img.buf.size(); i += 3) {
  283. // PPM expects binary data in RGB format, which matches our image buffer
  284. file.write(reinterpret_cast<const char*>(&img.buf[i]), 3);
  285. }
  286. file.close();
  287. }
  288. static void clip_image_save_to_bmp(const clip_image_u8& img, const std::string& filename) {
  289. std::ofstream file(filename, std::ios::binary);
  290. if (!file.is_open()) {
  291. LOG_TEE("Failed to open file for writing: %s\n", filename.c_str());
  292. return;
  293. }
  294. int fileSize = 54 + 3 * img.nx * img.ny; // File header + info header + pixel data
  295. int bytesPerPixel = 3;
  296. int widthInBytes = img.nx * bytesPerPixel;
  297. int paddingAmount = (4 - (widthInBytes % 4)) % 4;
  298. int stride = widthInBytes + paddingAmount;
  299. // Bitmap file header
  300. unsigned char fileHeader[14] = {
  301. 'B','M', // Signature
  302. 0,0,0,0, // Image file size in bytes
  303. 0,0,0,0, // Reserved
  304. 54,0,0,0 // Start of pixel array
  305. };
  306. // Total file size
  307. fileSize = 54 + (stride * img.ny);
  308. fileHeader[2] = (unsigned char)(fileSize);
  309. fileHeader[3] = (unsigned char)(fileSize >> 8);
  310. fileHeader[4] = (unsigned char)(fileSize >> 16);
  311. fileHeader[5] = (unsigned char)(fileSize >> 24);
  312. // Bitmap information header (BITMAPINFOHEADER)
  313. unsigned char infoHeader[40] = {
  314. 40,0,0,0, // Size of this header (40 bytes)
  315. 0,0,0,0, // Image width
  316. 0,0,0,0, // Image height
  317. 1,0, // Number of color planes
  318. 24,0, // Bits per pixel
  319. 0,0,0,0, // No compression
  320. 0,0,0,0, // Image size (can be 0 for no compression)
  321. 0,0,0,0, // X pixels per meter (not specified)
  322. 0,0,0,0, // Y pixels per meter (not specified)
  323. 0,0,0,0, // Total colors (color table not used)
  324. 0,0,0,0 // Important colors (all are important)
  325. };
  326. // Width and height in the information header
  327. infoHeader[4] = (unsigned char)(img.nx);
  328. infoHeader[5] = (unsigned char)(img.nx >> 8);
  329. infoHeader[6] = (unsigned char)(img.nx >> 16);
  330. infoHeader[7] = (unsigned char)(img.nx >> 24);
  331. infoHeader[8] = (unsigned char)(img.ny);
  332. infoHeader[9] = (unsigned char)(img.ny >> 8);
  333. infoHeader[10] = (unsigned char)(img.ny >> 16);
  334. infoHeader[11] = (unsigned char)(img.ny >> 24);
  335. // Write file headers
  336. file.write(reinterpret_cast<char*>(fileHeader), sizeof(fileHeader));
  337. file.write(reinterpret_cast<char*>(infoHeader), sizeof(infoHeader));
  338. // Pixel data
  339. std::vector<unsigned char> padding(3, 0); // Max padding size to be added to each row
  340. for (int y = img.ny - 1; y >= 0; --y) { // BMP files are stored bottom-to-top
  341. for (int x = 0; x < img.nx; ++x) {
  342. // Each pixel
  343. size_t pixelIndex = (y * img.nx + x) * 3;
  344. unsigned char pixel[3] = {
  345. img.buf[pixelIndex + 2], // BMP stores pixels in BGR format
  346. img.buf[pixelIndex + 1],
  347. img.buf[pixelIndex]
  348. };
  349. file.write(reinterpret_cast<char*>(pixel), 3);
  350. }
  351. // Write padding for the row
  352. file.write(reinterpret_cast<char*>(padding.data()), paddingAmount);
  353. }
  354. file.close();
  355. }
  356. // debug function to convert f32 to u8
  357. static void clip_image_convert_f32_to_u8(const clip_image_f32& src, clip_image_u8& dst) {
  358. dst.nx = src.nx;
  359. dst.ny = src.ny;
  360. dst.buf.resize(3 * src.nx * src.ny);
  361. for (size_t i = 0; i < src.buf.size(); ++i) {
  362. dst.buf[i] = static_cast<uint8_t>(std::min(std::max(int(src.buf[i] * 255.0f), 0), 255));
  363. }
  364. }
  365. #endif
  366. //
  367. // clip layers
  368. //
  369. struct clip_hparams {
  370. int32_t image_size;
  371. int32_t patch_size;
  372. int32_t hidden_size;
  373. int32_t n_intermediate;
  374. int32_t projection_dim;
  375. int32_t n_head;
  376. int32_t n_layer;
  377. float eps;
  378. char mm_patch_merge_type[32] = "flat"; // spatial_unpad or flat (default)
  379. int32_t image_grid_pinpoints[32];
  380. int32_t image_crop_resolution;
  381. };
  382. struct clip_layer {
  383. // attention
  384. struct ggml_tensor * k_w;
  385. struct ggml_tensor * k_b;
  386. struct ggml_tensor * q_w;
  387. struct ggml_tensor * q_b;
  388. struct ggml_tensor * v_w;
  389. struct ggml_tensor * v_b;
  390. struct ggml_tensor * o_w;
  391. struct ggml_tensor * o_b;
  392. // layernorm 1
  393. struct ggml_tensor * ln_1_w;
  394. struct ggml_tensor * ln_1_b;
  395. // ff
  396. struct ggml_tensor * ff_i_w;
  397. struct ggml_tensor * ff_i_b;
  398. struct ggml_tensor * ff_o_w;
  399. struct ggml_tensor * ff_o_b;
  400. // layernorm 2
  401. struct ggml_tensor * ln_2_w;
  402. struct ggml_tensor * ln_2_b;
  403. };
  404. struct clip_vision_model {
  405. struct clip_hparams hparams;
  406. // embeddings
  407. struct ggml_tensor * class_embedding;
  408. struct ggml_tensor * patch_embeddings;
  409. struct ggml_tensor * patch_bias;
  410. struct ggml_tensor * position_embeddings;
  411. struct ggml_tensor * pre_ln_w;
  412. struct ggml_tensor * pre_ln_b;
  413. std::vector<clip_layer> layers;
  414. struct ggml_tensor * post_ln_w;
  415. struct ggml_tensor * post_ln_b;
  416. struct ggml_tensor * projection;
  417. // LLaVA projection
  418. struct ggml_tensor * mm_0_w = NULL;
  419. struct ggml_tensor * mm_0_b = NULL;
  420. struct ggml_tensor * mm_2_w = NULL;
  421. struct ggml_tensor * mm_2_b = NULL;
  422. struct ggml_tensor * image_newline = NULL;
  423. // Yi type models with mlp+normalization projection
  424. struct ggml_tensor * mm_1_w = NULL; // Yi type models have 0, 1, 3, 4
  425. struct ggml_tensor * mm_1_b = NULL;
  426. struct ggml_tensor * mm_3_w = NULL;
  427. struct ggml_tensor * mm_3_b = NULL;
  428. struct ggml_tensor * mm_4_w = NULL;
  429. struct ggml_tensor * mm_4_b = NULL;
  430. // MobileVLM projection
  431. struct ggml_tensor * mm_model_mlp_1_w;
  432. struct ggml_tensor * mm_model_mlp_1_b;
  433. struct ggml_tensor * mm_model_mlp_3_w;
  434. struct ggml_tensor * mm_model_mlp_3_b;
  435. struct ggml_tensor * mm_model_block_1_block_0_0_w;
  436. struct ggml_tensor * mm_model_block_1_block_0_1_w;
  437. struct ggml_tensor * mm_model_block_1_block_0_1_b;
  438. struct ggml_tensor * mm_model_block_1_block_1_fc1_w;
  439. struct ggml_tensor * mm_model_block_1_block_1_fc1_b;
  440. struct ggml_tensor * mm_model_block_1_block_1_fc2_w;
  441. struct ggml_tensor * mm_model_block_1_block_1_fc2_b;
  442. struct ggml_tensor * mm_model_block_1_block_2_0_w;
  443. struct ggml_tensor * mm_model_block_1_block_2_1_w;
  444. struct ggml_tensor * mm_model_block_1_block_2_1_b;
  445. struct ggml_tensor * mm_model_block_2_block_0_0_w;
  446. struct ggml_tensor * mm_model_block_2_block_0_1_w;
  447. struct ggml_tensor * mm_model_block_2_block_0_1_b;
  448. struct ggml_tensor * mm_model_block_2_block_1_fc1_w;
  449. struct ggml_tensor * mm_model_block_2_block_1_fc1_b;
  450. struct ggml_tensor * mm_model_block_2_block_1_fc2_w;
  451. struct ggml_tensor * mm_model_block_2_block_1_fc2_b;
  452. struct ggml_tensor * mm_model_block_2_block_2_0_w;
  453. struct ggml_tensor * mm_model_block_2_block_2_1_w;
  454. struct ggml_tensor * mm_model_block_2_block_2_1_b;
  455. // MobileVLM_V2 projection
  456. struct ggml_tensor * mm_model_mlp_0_w;
  457. struct ggml_tensor * mm_model_mlp_0_b;
  458. struct ggml_tensor * mm_model_mlp_2_w;
  459. struct ggml_tensor * mm_model_mlp_2_b;
  460. struct ggml_tensor * mm_model_peg_0_w;
  461. struct ggml_tensor * mm_model_peg_0_b;
  462. // MINICPMV projection
  463. struct ggml_tensor * mm_model_pos_embed_k;
  464. struct ggml_tensor * mm_model_query;
  465. struct ggml_tensor * mm_model_proj;
  466. struct ggml_tensor * mm_model_kv_proj;
  467. struct ggml_tensor * mm_model_attn_q_w;
  468. struct ggml_tensor * mm_model_attn_q_b;
  469. struct ggml_tensor * mm_model_attn_k_w;
  470. struct ggml_tensor * mm_model_attn_k_b;
  471. struct ggml_tensor * mm_model_attn_v_w;
  472. struct ggml_tensor * mm_model_attn_v_b;
  473. struct ggml_tensor * mm_model_attn_o_w;
  474. struct ggml_tensor * mm_model_attn_o_b;
  475. struct ggml_tensor * mm_model_ln_q_w;
  476. struct ggml_tensor * mm_model_ln_q_b;
  477. struct ggml_tensor * mm_model_ln_kv_w;
  478. struct ggml_tensor * mm_model_ln_kv_b;
  479. struct ggml_tensor * mm_model_ln_post_w;
  480. struct ggml_tensor * mm_model_ln_post_b;
  481. };
  482. struct clip_ctx {
  483. bool has_text_encoder = false;
  484. bool has_vision_encoder = false;
  485. bool has_llava_projector = false;
  486. bool has_minicpmv_projector = false;
  487. int minicpmv_version = 2;
  488. struct clip_vision_model vision_model;
  489. projector_type proj_type = PROJECTOR_TYPE_MLP;
  490. float image_mean[3];
  491. float image_std[3];
  492. bool use_gelu = false;
  493. int32_t ftype = 1;
  494. bool has_class_embedding = true;
  495. bool has_pre_norm = true;
  496. bool has_post_norm = false;
  497. bool has_patch_bias = false;
  498. struct gguf_context * ctx_gguf;
  499. struct ggml_context * ctx_data;
  500. std::vector<uint8_t> buf_compute_meta;
  501. // memory buffers to evaluate the model
  502. ggml_backend_buffer_t params_buffer = NULL;
  503. ggml_backend_t backend = NULL;
  504. ggml_gallocr_t compute_alloc = NULL;
  505. struct clip_image_size * load_image_size;
  506. };
  507. static ggml_cgraph * clip_image_build_graph(clip_ctx * ctx, const clip_image_f32_batch * imgs, struct clip_image_size * load_image_size, bool is_inf = false) {
  508. if (!ctx->has_vision_encoder) {
  509. LOG_TEE("This gguf file seems to have no vision encoder\n");
  510. return nullptr;
  511. }
  512. const auto & model = ctx->vision_model;
  513. const auto & hparams = model.hparams;
  514. const int image_size = hparams.image_size;
  515. int image_size_width = image_size;
  516. int image_size_height = image_size;
  517. if (ctx->has_minicpmv_projector) {
  518. if (load_image_size == nullptr) {
  519. load_image_size = clip_image_size_init();
  520. }
  521. LOG_TEE("%s: %d %d\n", __func__, load_image_size->width, load_image_size->height);
  522. image_size_width = load_image_size->width;
  523. image_size_height = load_image_size->height;
  524. if (is_inf) {
  525. image_size_width = imgs->data->nx;
  526. image_size_height = imgs->data->ny;
  527. }
  528. }
  529. const int patch_size = hparams.patch_size;
  530. const int num_patches = ((image_size_width / patch_size) * (image_size_height / patch_size));
  531. const int num_positions = num_patches + (ctx->has_class_embedding ? 1 : 0);
  532. const int hidden_size = hparams.hidden_size;
  533. const int n_head = hparams.n_head;
  534. const int d_head = hidden_size / n_head;
  535. int n_layer = hparams.n_layer;
  536. const float eps = hparams.eps;
  537. const int batch_size = imgs->size;
  538. if (ctx->has_llava_projector || ctx->has_minicpmv_projector) {
  539. GGML_ASSERT(batch_size == 1);
  540. }
  541. struct ggml_init_params params = {
  542. /*.mem_size =*/ ctx->buf_compute_meta.size(),
  543. /*.mem_buffer =*/ ctx->buf_compute_meta.data(),
  544. /*.no_alloc =*/ true,
  545. };
  546. struct ggml_context * ctx0 = ggml_init(params);
  547. struct ggml_cgraph * gf = ggml_new_graph(ctx0);
  548. struct ggml_tensor * inp_raw = ggml_new_tensor_4d(ctx0, GGML_TYPE_F32, image_size_width, image_size_height, 3, batch_size);
  549. ggml_set_name(inp_raw, "inp_raw");
  550. ggml_set_input(inp_raw);
  551. struct ggml_tensor * inp = ggml_conv_2d(ctx0, model.patch_embeddings, inp_raw, patch_size, patch_size, 0, 0, 1, 1);
  552. inp = ggml_reshape_3d(ctx0, inp, num_patches, hidden_size, batch_size);
  553. inp = ggml_cont(ctx0, ggml_permute(ctx0, inp, 1, 0, 2, 3));
  554. if (ctx->has_patch_bias) {
  555. // inp = ggml_add(ctx0, inp, ggml_repeat(ctx0, model.patch_bias, inp));
  556. inp = ggml_add(ctx0, inp, model.patch_bias);
  557. }
  558. struct ggml_tensor * embeddings = inp;
  559. struct ggml_tensor * pos_embed = nullptr;
  560. if (ctx->has_llava_projector) {
  561. // concat class_embeddings and patch_embeddings
  562. if (ctx->has_class_embedding) {
  563. embeddings = ggml_new_tensor_3d(ctx0, GGML_TYPE_F32, hidden_size, num_positions, batch_size);
  564. ggml_set_name(embeddings, "embeddings");
  565. ggml_set_input(embeddings);
  566. embeddings = ggml_acc(ctx0, embeddings, model.class_embedding,
  567. embeddings->nb[1], embeddings->nb[2], embeddings->nb[3], 0);
  568. embeddings = ggml_acc(ctx0, embeddings, inp,
  569. embeddings->nb[1], embeddings->nb[2], embeddings->nb[3], model.class_embedding->nb[1]);
  570. }
  571. }
  572. struct ggml_tensor * positions = ggml_new_tensor_1d(ctx0, GGML_TYPE_I32, num_positions);
  573. ggml_set_name(positions, "positions");
  574. ggml_set_input(positions);
  575. embeddings =
  576. ggml_add(ctx0, embeddings, ggml_get_rows(ctx0, model.position_embeddings, positions));
  577. if (ctx->has_minicpmv_projector) {
  578. int pos_w = image_size_width/patch_size;
  579. int pos_h = image_size_height/patch_size;
  580. if (ctx->minicpmv_version == 2) {
  581. pos_embed = ggml_new_tensor_3d(ctx0, GGML_TYPE_F32, 4096, pos_w * pos_h, 1);
  582. }
  583. else if (ctx->minicpmv_version == 3) {
  584. pos_embed = ggml_new_tensor_3d(ctx0, GGML_TYPE_F32, 3584, pos_w * pos_h, 1);
  585. }
  586. ggml_set_name(pos_embed, "pos_embed");
  587. ggml_set_input(pos_embed);
  588. }
  589. // pre-layernorm
  590. if (ctx->has_pre_norm) {
  591. embeddings = ggml_norm(ctx0, embeddings, eps);
  592. ggml_set_name(embeddings, "pre_ln");
  593. embeddings = ggml_add(ctx0, ggml_mul(ctx0, embeddings, model.pre_ln_w), model.pre_ln_b);
  594. }
  595. // loop over layers
  596. if (ctx->has_minicpmv_projector) {
  597. n_layer += 1;
  598. }
  599. for (int il = 0; il < n_layer - 1; il++) {
  600. struct ggml_tensor * cur = embeddings; // embeddings = residual, cur = hidden_states
  601. //const size_t nb_q_w = model.layers[il].q_w->nb[0];
  602. // layernorm1
  603. {
  604. cur = ggml_norm(ctx0, cur, eps);
  605. cur = ggml_add(ctx0, ggml_mul(ctx0, cur, model.layers[il].ln_1_w),
  606. model.layers[il].ln_1_b);
  607. }
  608. // self-attention
  609. {
  610. struct ggml_tensor * Q =
  611. ggml_add(ctx0, ggml_mul_mat(ctx0, model.layers[il].q_w, cur), model.layers[il].q_b);
  612. Q = ggml_scale_inplace(ctx0, Q, 1.0f / sqrt((float)d_head));
  613. Q = ggml_reshape_4d(ctx0, Q, d_head, n_head, num_positions, batch_size);
  614. Q = ggml_cont(ctx0, ggml_permute(ctx0, Q, 0, 2, 1, 3));
  615. Q = ggml_reshape_3d(ctx0, Q, d_head, num_positions, n_head * batch_size);
  616. struct ggml_tensor * K =
  617. ggml_add(ctx0, ggml_mul_mat(ctx0, model.layers[il].k_w, cur), model.layers[il].k_b);
  618. K = ggml_reshape_4d(ctx0, K, d_head, n_head, num_positions, batch_size);
  619. K = ggml_cont(ctx0, ggml_permute(ctx0, K, 0, 2, 1, 3));
  620. K = ggml_reshape_3d(ctx0, K, d_head, num_positions, n_head * batch_size);
  621. struct ggml_tensor * V =
  622. ggml_add(ctx0, ggml_mul_mat(ctx0, model.layers[il].v_w, cur), model.layers[il].v_b);
  623. V = ggml_reshape_4d(ctx0, V, d_head, n_head, num_positions, batch_size);
  624. V = ggml_cont(ctx0, ggml_permute(ctx0, V, 1, 2, 0, 3));
  625. V = ggml_reshape_3d(ctx0, V, num_positions, d_head, n_head * batch_size);
  626. struct ggml_tensor * KQ = ggml_mul_mat(ctx0, K, Q);
  627. KQ = ggml_soft_max_inplace(ctx0, KQ);
  628. struct ggml_tensor * KQV = ggml_mul_mat(ctx0, V, KQ);
  629. KQV = ggml_reshape_4d(ctx0, KQV, d_head, num_positions, n_head, batch_size);
  630. KQV = ggml_permute(ctx0, KQV, 0, 2, 1, 3);
  631. cur = ggml_cont_3d(ctx0, KQV, hidden_size, num_positions, batch_size);
  632. }
  633. // attention output
  634. cur = ggml_add(ctx0, ggml_mul_mat(ctx0, model.layers[il].o_w, cur), model.layers[il].o_b);
  635. // re-add the layer input, e.g., residual
  636. cur = ggml_add(ctx0, cur, embeddings);
  637. embeddings = cur; // embeddings = residual, cur = hidden_states
  638. // layernorm2
  639. {
  640. cur = ggml_norm(ctx0, cur, eps);
  641. cur = ggml_add(ctx0, ggml_mul(ctx0, cur, model.layers[il].ln_2_w), model.layers[il].ln_2_b);
  642. }
  643. cur = ggml_mul_mat(ctx0, model.layers[il].ff_i_w, cur);
  644. cur = ggml_add(ctx0, cur, model.layers[il].ff_i_b);
  645. if (ctx->use_gelu) {
  646. cur = ggml_gelu_inplace(ctx0, cur);
  647. } else {
  648. cur = ggml_gelu_quick_inplace(ctx0, cur);
  649. }
  650. cur = ggml_mul_mat(ctx0, model.layers[il].ff_o_w, cur);
  651. cur = ggml_add(ctx0, cur, model.layers[il].ff_o_b);
  652. // residual 2
  653. cur = ggml_add(ctx0, embeddings, cur);
  654. embeddings = cur;
  655. }
  656. // post-layernorm
  657. if (ctx->has_post_norm) {
  658. embeddings = ggml_norm(ctx0, embeddings, eps);
  659. ggml_set_name(embeddings, "post_ln");
  660. embeddings = ggml_add(ctx0, ggml_mul(ctx0, embeddings, model.post_ln_w), model.post_ln_b);
  661. }
  662. // llava projector
  663. if (ctx->has_llava_projector) {
  664. embeddings = ggml_reshape_2d(ctx0, embeddings, embeddings->ne[0], embeddings->ne[1]);
  665. struct ggml_tensor * patches = ggml_new_tensor_1d(ctx0, GGML_TYPE_I32, num_patches);
  666. ggml_set_name(patches, "patches");
  667. ggml_set_input(patches);
  668. // shape [1, 576, 1024]
  669. // ne is whcn, ne = [1024, 576, 1, 1]
  670. embeddings = ggml_get_rows(ctx0, embeddings, patches);
  671. // print_tensor_info(embeddings, "embeddings");
  672. // llava projector
  673. if (ctx->proj_type == PROJECTOR_TYPE_MLP) {
  674. embeddings = ggml_mul_mat(ctx0, model.mm_0_w, embeddings);
  675. embeddings = ggml_add(ctx0, embeddings, model.mm_0_b);
  676. embeddings = ggml_gelu(ctx0, embeddings);
  677. embeddings = ggml_mul_mat(ctx0, model.mm_2_w, embeddings);
  678. embeddings = ggml_add(ctx0, embeddings, model.mm_2_b);
  679. }
  680. else if (ctx->proj_type == PROJECTOR_TYPE_MLP_NORM) {
  681. embeddings = ggml_mul_mat(ctx0, model.mm_0_w, embeddings);
  682. embeddings = ggml_add(ctx0, embeddings, model.mm_0_b);
  683. // ggml_tensor_printf(embeddings, "mm_0_w",0,true,false);
  684. // First LayerNorm
  685. embeddings = ggml_norm(ctx0, embeddings, eps);
  686. embeddings = ggml_add(ctx0, ggml_mul(ctx0, embeddings, model.mm_1_w),
  687. model.mm_1_b);
  688. // GELU activation
  689. embeddings = ggml_gelu(ctx0, embeddings);
  690. // Second linear layer
  691. embeddings = ggml_mul_mat(ctx0, model.mm_3_w, embeddings);
  692. embeddings = ggml_add(ctx0, embeddings, model.mm_3_b);
  693. // Second LayerNorm
  694. embeddings = ggml_norm(ctx0, embeddings, eps);
  695. embeddings = ggml_add(ctx0, ggml_mul(ctx0, embeddings, model.mm_4_w),
  696. model.mm_4_b);
  697. }
  698. else if (ctx->proj_type == PROJECTOR_TYPE_LDP) {
  699. // MobileVLM projector
  700. int n_patch = 24;
  701. struct ggml_tensor * mlp_1 = ggml_mul_mat(ctx0, model.mm_model_mlp_1_w, embeddings);
  702. mlp_1 = ggml_add(ctx0, mlp_1, model.mm_model_mlp_1_b);
  703. mlp_1 = ggml_gelu(ctx0, mlp_1);
  704. struct ggml_tensor * mlp_3 = ggml_mul_mat(ctx0, model.mm_model_mlp_3_w, mlp_1);
  705. mlp_3 = ggml_add(ctx0, mlp_3, model.mm_model_mlp_3_b);
  706. // mlp_3 shape = [1, 576, 2048], ne = [2048, 576, 1, 1]
  707. // block 1
  708. struct ggml_tensor * block_1 = nullptr;
  709. {
  710. // transpose from [1, 576, 2048] --> [1, 2048, 576] --> [1, 2048, 24, 24]
  711. mlp_3 = ggml_cont(ctx0, ggml_permute(ctx0, mlp_3, 1, 0, 2, 3));
  712. mlp_3 = ggml_reshape_4d(ctx0, mlp_3, n_patch, n_patch, mlp_3->ne[1], mlp_3->ne[2]);
  713. // stride = 1, padding = 1, bias is nullptr
  714. block_1 = ggml_conv_depthwise_2d(ctx0, model.mm_model_block_1_block_0_0_w, mlp_3, 1, 1, 1, 1, 1, 1);
  715. // layer norm
  716. // // block_1 shape = [1, 2048, 24, 24], ne = [24, 24, 2048, 1]
  717. block_1 = ggml_cont(ctx0, ggml_permute(ctx0, block_1, 1, 2, 0, 3));
  718. // block_1 shape = [1, 24, 24, 2048], ne = [2048, 24, 24, 1]
  719. block_1 = ggml_norm(ctx0, block_1, eps);
  720. block_1 = ggml_add(ctx0, ggml_mul(ctx0, block_1, model.mm_model_block_1_block_0_1_w), model.mm_model_block_1_block_0_1_b);
  721. block_1 = ggml_cont(ctx0, ggml_permute(ctx0, block_1, 2, 0, 1, 3));
  722. // block_1 shape = [1, 2048, 24, 24], ne = [24, 24, 2048, 1]
  723. // hardswish
  724. struct ggml_tensor * block_1_hw = ggml_hardswish(ctx0, block_1);
  725. block_1 = ggml_pool_2d(ctx0, block_1_hw, GGML_OP_POOL_AVG, block_1_hw->ne[0], block_1_hw->ne[1], block_1_hw->ne[0], block_1_hw->ne[1], 0, 0);
  726. // block_1 shape = [1, 2048, 1, 1], ne = [1, 1, 2048, 1]
  727. // pointwise conv
  728. block_1 = ggml_reshape_2d(ctx0, block_1, block_1->ne[0]*block_1->ne[1]*block_1->ne[2], block_1->ne[3]);
  729. block_1 = ggml_mul_mat(ctx0, model.mm_model_block_1_block_1_fc1_w, block_1);
  730. block_1 = ggml_add(ctx0, block_1, model.mm_model_block_1_block_1_fc1_b);
  731. block_1 = ggml_relu(ctx0, block_1);
  732. block_1 = ggml_mul_mat(ctx0, model.mm_model_block_1_block_1_fc2_w, block_1);
  733. block_1 = ggml_add(ctx0, block_1, model.mm_model_block_1_block_1_fc2_b);
  734. block_1 = ggml_hardsigmoid(ctx0, block_1);
  735. // block_1_hw shape = [1, 2048, 24, 24], ne = [24, 24, 2048, 1], block_1 shape = [1, 2048], ne = [2048, 1, 1, 1]
  736. block_1 = ggml_reshape_4d(ctx0, block_1, 1, 1, block_1->ne[0], block_1->ne[1]);
  737. block_1 = ggml_mul(ctx0, block_1_hw, block_1);
  738. int w = block_1->ne[0], h = block_1->ne[1];
  739. block_1 = ggml_reshape_3d(ctx0, block_1, w*h, block_1->ne[2], block_1->ne[3]);
  740. block_1 = ggml_cont(ctx0, ggml_permute(ctx0, block_1, 1, 0, 2, 3));
  741. // block_1 shape = [1, 24*24, 2048], ne = [24*24, 2048, 1]
  742. block_1 = ggml_mul_mat(ctx0, model.mm_model_block_1_block_2_0_w, block_1);
  743. block_1 = ggml_reshape_4d(ctx0, block_1, block_1->ne[0], w, h, block_1->ne[3]);
  744. // block_1 shape = [1, 24, 24, 2048], ne = [2048, 24, 24, 1]
  745. block_1 = ggml_norm(ctx0, block_1, eps);
  746. block_1 = ggml_add(ctx0, ggml_mul(ctx0, block_1, model.mm_model_block_1_block_2_1_w), model.mm_model_block_1_block_2_1_b);
  747. block_1 = ggml_cont(ctx0, ggml_permute(ctx0, block_1, 2, 0, 1, 3));
  748. // block1 shape = [1, 2048, 24, 24], ne = [24, 24, 2048, 1]
  749. // residual
  750. block_1 = ggml_add(ctx0, mlp_3, block_1);
  751. }
  752. // block_2
  753. {
  754. // stride = 2
  755. block_1 = ggml_conv_depthwise_2d(ctx0, model.mm_model_block_2_block_0_0_w, block_1, 2, 2, 1, 1, 1, 1);
  756. // block_1 shape = [1, 2048, 12, 12], ne = [12, 12, 2048, 1]
  757. // layer norm
  758. block_1 = ggml_cont(ctx0, ggml_permute(ctx0, block_1, 1, 2, 0, 3));
  759. // block_1 shape = [1, 12, 12, 2048], ne = [2048, 12, 12, 1]
  760. block_1 = ggml_norm(ctx0, block_1, eps);
  761. block_1 = ggml_add(ctx0, ggml_mul(ctx0, block_1, model.mm_model_block_2_block_0_1_w), model.mm_model_block_2_block_0_1_b);
  762. block_1 = ggml_cont(ctx0, ggml_permute(ctx0, block_1, 2, 0, 1, 3));
  763. // block_1 shape = [1, 2048, 12, 12], ne = [12, 12, 2048, 1]
  764. // hardswish
  765. struct ggml_tensor * block_1_hw = ggml_hardswish(ctx0, block_1);
  766. // not sure the parameters is right for globalAvgPooling
  767. block_1 = ggml_pool_2d(ctx0, block_1_hw, GGML_OP_POOL_AVG, block_1_hw->ne[0], block_1_hw->ne[1], block_1_hw->ne[0], block_1_hw->ne[1], 0, 0);
  768. // block_1 shape = [1, 2048, 1, 1], ne = [1, 1, 2048, 1]
  769. // pointwise conv
  770. block_1 = ggml_reshape_2d(ctx0, block_1, block_1->ne[0]*block_1->ne[1]*block_1->ne[2], block_1->ne[3]);
  771. block_1 = ggml_mul_mat(ctx0, model.mm_model_block_2_block_1_fc1_w, block_1);
  772. block_1 = ggml_add(ctx0, block_1, model.mm_model_block_2_block_1_fc1_b);
  773. block_1 = ggml_relu(ctx0, block_1);
  774. block_1 = ggml_mul_mat(ctx0, model.mm_model_block_2_block_1_fc2_w, block_1);
  775. block_1 = ggml_add(ctx0, block_1, model.mm_model_block_2_block_1_fc2_b);
  776. block_1 = ggml_hardsigmoid(ctx0, block_1);
  777. // block_1_hw shape = [1, 2048, 12, 12], ne = [12, 12, 2048, 1], block_1 shape = [1, 2048, 1, 1], ne = [1, 1, 2048, 1]
  778. block_1 = ggml_reshape_4d(ctx0, block_1, 1, 1, block_1->ne[0], block_1->ne[1]);
  779. block_1 = ggml_mul(ctx0, block_1_hw, block_1);
  780. int w = block_1->ne[0], h = block_1->ne[1];
  781. block_1 = ggml_reshape_3d(ctx0, block_1, w*h, block_1->ne[2], block_1->ne[3]);
  782. block_1 = ggml_cont(ctx0, ggml_permute(ctx0, block_1, 1, 0, 2, 3));
  783. // block_1 shape = [1, 24*24, 2048], ne = [24*24, 2048, 1]
  784. block_1 = ggml_mul_mat(ctx0, model.mm_model_block_2_block_2_0_w, block_1);
  785. block_1 = ggml_reshape_4d(ctx0, block_1, block_1->ne[0], w, h, block_1->ne[3]);
  786. // block_1 shape = [1, 12, 12, 2048], ne = [2048, 12, 12, 1]
  787. block_1 = ggml_norm(ctx0, block_1, eps);
  788. block_1 = ggml_add(ctx0, ggml_mul(ctx0, block_1, model.mm_model_block_2_block_2_1_w), model.mm_model_block_2_block_2_1_b);
  789. block_1 = ggml_reshape_3d(ctx0, block_1, block_1->ne[0], block_1->ne[1] * block_1->ne[2], block_1->ne[3]);
  790. // block_1 shape = [1, 144, 2048], ne = [2048, 144, 1]
  791. }
  792. embeddings = block_1;
  793. }
  794. else if (ctx->proj_type == PROJECTOR_TYPE_LDPV2)
  795. {
  796. int n_patch = 24;
  797. struct ggml_tensor * mlp_0 = ggml_mul_mat(ctx0, model.mm_model_mlp_0_w, embeddings);
  798. mlp_0 = ggml_add(ctx0, mlp_0, model.mm_model_mlp_0_b);
  799. mlp_0 = ggml_gelu(ctx0, mlp_0);
  800. struct ggml_tensor * mlp_2 = ggml_mul_mat(ctx0, model.mm_model_mlp_2_w, mlp_0);
  801. mlp_2 = ggml_add(ctx0, mlp_2, model.mm_model_mlp_2_b);
  802. // mlp_2 ne = [2048, 576, 1, 1]
  803. // // AVG Pool Layer 2*2, strides = 2
  804. mlp_2 = ggml_cont(ctx0, ggml_permute(ctx0, mlp_2, 1, 0, 2, 3));
  805. // mlp_2 ne = [576, 2048, 1, 1]
  806. mlp_2 = ggml_reshape_4d(ctx0, mlp_2, n_patch, n_patch, mlp_2->ne[1], mlp_2->ne[2]);
  807. // mlp_2 ne [24, 24, 2048, 1]
  808. mlp_2 = ggml_pool_2d(ctx0, mlp_2, GGML_OP_POOL_AVG, 2, 2, 2, 2, 0, 0);
  809. // weight ne = [3, 3, 2048, 1]
  810. struct ggml_tensor * peg_0 = ggml_conv_depthwise_2d(ctx0, model.mm_model_peg_0_w, mlp_2, 1, 1, 1, 1, 1, 1);
  811. peg_0 = ggml_cont(ctx0, ggml_permute(ctx0, peg_0, 1, 2, 0, 3));
  812. peg_0 = ggml_add(ctx0, peg_0, model.mm_model_peg_0_b);
  813. mlp_2 = ggml_cont(ctx0, ggml_permute(ctx0, mlp_2, 1, 2, 0, 3));
  814. peg_0 = ggml_add(ctx0, peg_0, mlp_2);
  815. peg_0 = ggml_reshape_3d(ctx0, peg_0, peg_0->ne[0], peg_0->ne[1] * peg_0->ne[2], peg_0->ne[3]);
  816. embeddings = peg_0;
  817. }
  818. else {
  819. GGML_ABORT("fatal error");
  820. }
  821. }
  822. // minicpmv projector
  823. else if (ctx->has_minicpmv_projector)
  824. {
  825. if (ctx->proj_type == PROJECTOR_TYPE_RESAMPLER) {
  826. struct ggml_tensor * q = model.mm_model_query;
  827. { // layernorm
  828. q = ggml_norm(ctx0, q, eps);
  829. q = ggml_add(ctx0, ggml_mul(ctx0, q, model.mm_model_ln_q_w), model.mm_model_ln_q_b);
  830. }
  831. struct ggml_tensor * v = ggml_mul_mat(ctx0, model.mm_model_kv_proj, embeddings);
  832. { // layernorm
  833. v = ggml_norm(ctx0, v, eps);
  834. v = ggml_add(ctx0, ggml_mul(ctx0, v, model.mm_model_ln_kv_w), model.mm_model_ln_kv_b);
  835. }
  836. struct ggml_tensor * k;
  837. { // position
  838. // q = ggml_add(ctx0, q, model.mm_model_pos_embed);
  839. k = ggml_add(ctx0, v, pos_embed);
  840. }
  841. { // attention
  842. int hidden_size = 4096;
  843. const int d_head = 128;
  844. int n_head = hidden_size/d_head;
  845. int num_query = 96;
  846. if (ctx->minicpmv_version == 2) {
  847. hidden_size = 4096;
  848. n_head = hidden_size/d_head;
  849. num_query = 96;
  850. }
  851. else if (ctx->minicpmv_version == 3) {
  852. hidden_size = 3584;
  853. n_head = hidden_size/d_head;
  854. num_query = 64;
  855. }
  856. struct ggml_tensor * Q = ggml_add(ctx0, ggml_mul_mat(ctx0, model.mm_model_attn_q_w, q), model.mm_model_attn_q_b);
  857. Q = ggml_scale_inplace(ctx0, Q, 1.0f / sqrt((float)d_head));
  858. struct ggml_tensor * K = ggml_add(ctx0, ggml_mul_mat(ctx0, model.mm_model_attn_k_w, k), model.mm_model_attn_k_b);
  859. struct ggml_tensor * V = ggml_add(ctx0, ggml_mul_mat(ctx0, model.mm_model_attn_v_w, v), model.mm_model_attn_v_b);
  860. // permute
  861. Q = ggml_reshape_4d(ctx0, Q, d_head, n_head, num_query, batch_size);
  862. Q = ggml_cont(ctx0, ggml_permute(ctx0, Q, 0, 2, 1, 3));
  863. Q = ggml_reshape_3d(ctx0, Q, d_head, num_query, n_head * batch_size);
  864. K = ggml_reshape_4d(ctx0, K, d_head, n_head, num_positions, batch_size);
  865. K = ggml_cont(ctx0, ggml_permute(ctx0, K, 0, 2, 1, 3));
  866. K = ggml_reshape_3d(ctx0, K, d_head, num_positions, n_head * batch_size);
  867. V = ggml_reshape_4d(ctx0, V, d_head, n_head, num_positions, batch_size);
  868. V = ggml_cont(ctx0, ggml_permute(ctx0, V, 1, 2, 0, 3));
  869. V = ggml_reshape_3d(ctx0, V, num_positions, d_head, n_head * batch_size);
  870. struct ggml_tensor * KQ = ggml_mul_mat(ctx0, K, Q);
  871. KQ = ggml_soft_max_inplace(ctx0, KQ);
  872. struct ggml_tensor * KQV = ggml_mul_mat(ctx0, V, KQ);
  873. KQV = ggml_reshape_4d(ctx0, KQV, d_head, num_query, n_head, batch_size);
  874. KQV = ggml_permute(ctx0, KQV, 0, 2, 1, 3);
  875. KQV = ggml_cont_3d(ctx0, KQV, hidden_size, num_query, batch_size);
  876. embeddings = ggml_add(ctx0, ggml_mul_mat(ctx0, model.mm_model_attn_o_w, KQV), model.mm_model_attn_o_b);
  877. }
  878. { // layernorm
  879. embeddings = ggml_norm(ctx0, embeddings, eps);
  880. embeddings = ggml_add(ctx0, ggml_mul(ctx0, embeddings, model.mm_model_ln_post_w), model.mm_model_ln_post_b);
  881. }
  882. embeddings = ggml_mul_mat(ctx0, model.mm_model_proj, embeddings);
  883. }
  884. else {
  885. GGML_ASSERT(false);
  886. }
  887. }
  888. // build the graph
  889. ggml_build_forward_expand(gf, embeddings);
  890. ggml_free(ctx0);
  891. return gf;
  892. }
  893. // read and create ggml_context containing the tensors and their data
  894. struct clip_ctx * clip_model_load(const char * fname, const int verbosity = 1) {
  895. struct ggml_context * meta = NULL;
  896. struct gguf_init_params params = {
  897. /*.no_alloc = */ true,
  898. /*.ctx = */ &meta,
  899. };
  900. struct gguf_context * ctx = gguf_init_from_file(fname, params);
  901. if (!ctx) {
  902. throw std::runtime_error(format("%s: failed to load CLIP model from %s. Does this file exist?\n", __func__, fname));
  903. }
  904. if (verbosity >= 1) {
  905. const int n_tensors = gguf_get_n_tensors(ctx);
  906. const int n_kv = gguf_get_n_kv(ctx);
  907. const int ftype = get_u32(ctx, KEY_FTYPE);
  908. const std::string ftype_str = get_ftype(ftype);
  909. const int idx_desc = get_key_idx(ctx, KEY_DESCRIPTION);
  910. const std::string description = gguf_get_val_str(ctx, idx_desc);
  911. const int idx_name = gguf_find_key(ctx, KEY_NAME);
  912. if (idx_name != -1) { // make name optional temporarily as some of the uploaded models missing it due to a bug
  913. const std::string name = gguf_get_val_str(ctx, idx_name);
  914. LOG_TEE("%s: model name: %s\n", __func__, name.c_str());
  915. }
  916. LOG_TEE("%s: description: %s\n", __func__, description.c_str());
  917. LOG_TEE("%s: GGUF version: %d\n", __func__, gguf_get_version(ctx));
  918. LOG_TEE("%s: alignment: %zu\n", __func__, gguf_get_alignment(ctx));
  919. LOG_TEE("%s: n_tensors: %d\n", __func__, n_tensors);
  920. LOG_TEE("%s: n_kv: %d\n", __func__, n_kv);
  921. LOG_TEE("%s: ftype: %s\n", __func__, ftype_str.c_str());
  922. LOG_TEE("\n");
  923. }
  924. const int n_tensors = gguf_get_n_tensors(ctx);
  925. // kv
  926. const int n_kv = gguf_get_n_kv(ctx);
  927. LOG_TEE("%s: loaded meta data with %d key-value pairs and %d tensors from %s\n",
  928. __func__, n_kv, n_tensors, fname);
  929. {
  930. std::map<enum ggml_type, uint32_t> n_type;
  931. for (int i = 0; i < n_tensors; i++) {
  932. enum ggml_type type = gguf_get_tensor_type(ctx, i);
  933. n_type[type]++;
  934. }
  935. LOG_TEE("%s: Dumping metadata keys/values. Note: KV overrides do not apply in this output.\n", __func__);
  936. for (int i = 0; i < n_kv; i++) {
  937. const char * name = gguf_get_key(ctx, i);
  938. const enum gguf_type type = gguf_get_kv_type(ctx, i);
  939. const std::string type_name =
  940. type == GGUF_TYPE_ARRAY
  941. ? format("%s[%s,%d]", gguf_type_name(type), gguf_type_name(gguf_get_arr_type(ctx, i)), gguf_get_arr_n(ctx, i))
  942. : gguf_type_name(type);
  943. std::string value = gguf_kv_to_str(ctx, i);
  944. const size_t MAX_VALUE_LEN = 40;
  945. if (value.size() > MAX_VALUE_LEN) {
  946. value = format("%s...", value.substr(0, MAX_VALUE_LEN - 3).c_str());
  947. }
  948. replace_all(value, "\n", "\\n");
  949. LOG_TEE("%s: - kv %3d: %42s %-16s = %s\n", __func__, i, name, type_name.c_str(), value.c_str());
  950. }
  951. // print type counts
  952. for (auto & kv : n_type) {
  953. if (kv.second == 0) {
  954. continue;
  955. }
  956. LOG_TEE("%s: - type %4s: %4d tensors\n", __func__, ggml_type_name(kv.first), kv.second);
  957. }
  958. }
  959. // data
  960. size_t model_size = 0;
  961. {
  962. for (int i = 0; i < n_tensors; ++i) {
  963. const char * name = gguf_get_tensor_name(ctx, i);
  964. const size_t offset = gguf_get_tensor_offset(ctx, i);
  965. enum ggml_type type = gguf_get_tensor_type(ctx, i);
  966. struct ggml_tensor * cur = ggml_get_tensor(meta, name);
  967. size_t tensor_size = ggml_nbytes(cur);
  968. model_size += tensor_size;
  969. if (verbosity >= 3) {
  970. LOG_TEE("%s: tensor[%d]: n_dims = %d, name = %s, tensor_size=%zu, offset=%zu, shape:[%" PRIu64 ", %" PRIu64 ", %" PRIu64 ", %" PRIu64 "], type = %s\n",
  971. __func__, i, ggml_n_dims(cur), cur->name, tensor_size, offset, cur->ne[0], cur->ne[1], cur->ne[2], cur->ne[3], ggml_type_name(type));
  972. }
  973. }
  974. }
  975. clip_ctx * new_clip = new clip_ctx{};
  976. // update projector type
  977. {
  978. int idx = gguf_find_key(ctx, KEY_PROJ_TYPE);
  979. if (idx != -1) {
  980. const std::string proj_type = gguf_get_val_str(ctx, idx);
  981. new_clip->proj_type = clip_projector_type_from_string(proj_type);
  982. } else {
  983. new_clip->proj_type = PROJECTOR_TYPE_MLP;
  984. }
  985. if (new_clip->proj_type == PROJECTOR_TYPE_MLP) {
  986. if (gguf_find_tensor(ctx, format(TN_LLAVA_PROJ, 3, "weight").c_str()) != -1) {
  987. new_clip->proj_type = PROJECTOR_TYPE_MLP_NORM;
  988. }
  989. }
  990. }
  991. #ifdef GGML_USE_CUDA
  992. new_clip->backend = ggml_backend_cuda_init(0);
  993. LOG_TEE("%s: CLIP using CUDA backend\n", __func__);
  994. #endif
  995. #ifdef GGML_USE_METAL
  996. new_clip->backend = ggml_backend_metal_init();
  997. LOG_TEE("%s: CLIP using Metal backend\n", __func__);
  998. #endif
  999. #ifdef GGML_USE_CANN
  1000. new_clip->backend = ggml_backend_cann_init(0);
  1001. LOG_TEE("%s: CLIP using CANN backend\n", __func__);
  1002. #endif
  1003. #ifdef GGML_USE_VULKAN
  1004. new_clip->backend = ggml_backend_vk_init(0);
  1005. LOG_TEE("%s: CLIP using Vulkan backend\n", __func__);
  1006. #endif
  1007. if (!new_clip->backend) {
  1008. new_clip->backend = ggml_backend_cpu_init();
  1009. LOG_TEE("%s: CLIP using CPU backend\n", __func__);
  1010. }
  1011. // model size and capabilities
  1012. {
  1013. int idx = get_key_idx(ctx, KEY_HAS_TEXT_ENC);
  1014. new_clip->has_text_encoder = gguf_get_val_bool(ctx, idx);
  1015. idx = get_key_idx(ctx, KEY_HAS_VIS_ENC);
  1016. new_clip->has_vision_encoder = gguf_get_val_bool(ctx, idx);
  1017. idx = gguf_find_key(ctx, KEY_HAS_LLAVA_PROJ);
  1018. if (idx != -1) {
  1019. new_clip->has_llava_projector = gguf_get_val_bool(ctx, idx);
  1020. }
  1021. idx = gguf_find_key(ctx, KEY_HAS_MINICPMV_PROJ);
  1022. if (idx != -1) {
  1023. new_clip->has_minicpmv_projector = gguf_get_val_bool(ctx, idx);
  1024. }
  1025. idx = gguf_find_key(ctx, KEY_MINICPMV_VERSION);
  1026. if (idx != -1) {
  1027. new_clip->minicpmv_version = gguf_get_val_i32(ctx, idx);
  1028. }
  1029. // GGML_ASSERT(new_clip->has_llava_projector); // see monatis/clip.cpp for image and/or text encoding for semantic search
  1030. GGML_ASSERT(new_clip->has_vision_encoder);
  1031. GGML_ASSERT(!new_clip->has_text_encoder);
  1032. idx = get_key_idx(ctx, KEY_USE_GELU);
  1033. new_clip->use_gelu = gguf_get_val_bool(ctx, idx);
  1034. if (verbosity >= 1) {
  1035. LOG_TEE("%s: text_encoder: %d\n", __func__, new_clip->has_text_encoder);
  1036. LOG_TEE("%s: vision_encoder: %d\n", __func__, new_clip->has_vision_encoder);
  1037. LOG_TEE("%s: llava_projector: %d\n", __func__, new_clip->has_llava_projector);
  1038. LOG_TEE("%s: minicpmv_projector: %d\n", __func__, new_clip->has_minicpmv_projector);
  1039. LOG_TEE("%s: model size: %.2f MB\n", __func__, model_size / 1024.0 / 1024.0);
  1040. LOG_TEE("%s: metadata size: %.2f MB\n", __func__, ggml_get_mem_size(meta) / 1024.0 / 1024.0);
  1041. }
  1042. }
  1043. LOG_TEE("%s: params backend buffer size = % 6.2f MB (%i tensors)\n", __func__, model_size / (1024.0 * 1024.0), n_tensors);
  1044. // load tensors
  1045. {
  1046. std::vector<uint8_t> read_buf;
  1047. struct ggml_init_params params = {
  1048. /*.mem_size =*/ (n_tensors + 1) * ggml_tensor_overhead(),
  1049. /*.mem_buffer =*/ NULL,
  1050. /*.no_alloc =*/ true,
  1051. };
  1052. new_clip->ctx_data = ggml_init(params);
  1053. if (!new_clip->ctx_data) {
  1054. LOG_TEE("%s: ggml_init() failed\n", __func__);
  1055. clip_free(new_clip);
  1056. gguf_free(ctx);
  1057. return nullptr;
  1058. }
  1059. auto fin = std::ifstream(fname, std::ios::binary);
  1060. if (!fin) {
  1061. LOG_TEE("cannot open model file for loading tensors\n");
  1062. clip_free(new_clip);
  1063. gguf_free(ctx);
  1064. return nullptr;
  1065. }
  1066. // add tensors to context
  1067. for (int i = 0; i < n_tensors; ++i) {
  1068. const char * name = gguf_get_tensor_name(ctx, i);
  1069. struct ggml_tensor * t = ggml_get_tensor(meta, name);
  1070. struct ggml_tensor * cur = ggml_dup_tensor(new_clip->ctx_data, t);
  1071. ggml_set_name(cur, name);
  1072. }
  1073. // alloc memory and offload data
  1074. new_clip->params_buffer = ggml_backend_alloc_ctx_tensors(new_clip->ctx_data, new_clip->backend);
  1075. for (int i = 0; i < n_tensors; ++i) {
  1076. const char * name = gguf_get_tensor_name(ctx, i);
  1077. struct ggml_tensor * cur = ggml_get_tensor(new_clip->ctx_data, name);
  1078. const size_t offset = gguf_get_data_offset(ctx) + gguf_get_tensor_offset(ctx, i);
  1079. fin.seekg(offset, std::ios::beg);
  1080. if (!fin) {
  1081. LOG_TEE("%s: failed to seek for tensor %s\n", __func__, name);
  1082. clip_free(new_clip);
  1083. gguf_free(ctx);
  1084. return nullptr;
  1085. }
  1086. int num_bytes = ggml_nbytes(cur);
  1087. if (ggml_backend_buffer_is_host(new_clip->params_buffer)) {
  1088. // for the CPU and Metal backend, we can read directly into the tensor
  1089. fin.read(reinterpret_cast<char *>(cur->data), num_bytes);
  1090. } else {
  1091. // read into a temporary buffer first, then copy to device memory
  1092. read_buf.resize(num_bytes);
  1093. fin.read(reinterpret_cast<char *>(read_buf.data()), num_bytes);
  1094. ggml_backend_tensor_set(cur, read_buf.data(), 0, num_bytes);
  1095. }
  1096. }
  1097. fin.close();
  1098. }
  1099. // vision model
  1100. if (new_clip->has_vision_encoder) {
  1101. // load vision model
  1102. auto & vision_model = new_clip->vision_model;
  1103. auto & hparams = vision_model.hparams;
  1104. hparams.hidden_size = get_u32(ctx, format(KEY_N_EMBD, "vision"));
  1105. hparams.n_head = get_u32(ctx, format(KEY_N_HEAD, "vision"));
  1106. hparams.n_intermediate = get_u32(ctx, format(KEY_N_FF, "vision"));
  1107. hparams.n_layer = get_u32(ctx, format(KEY_N_BLOCK, "vision"));
  1108. hparams.image_size = get_u32(ctx, KEY_IMAGE_SIZE);
  1109. hparams.patch_size = get_u32(ctx, KEY_PATCH_SIZE);
  1110. hparams.projection_dim = get_u32(ctx, format(KEY_PROJ_DIM, "vision"));
  1111. hparams.eps = get_f32(ctx, format(KEY_LAYER_NORM_EPS, "vision"));
  1112. try {
  1113. int idx = get_key_idx(ctx, KEY_IMAGE_GRID_PINPOINTS);
  1114. int n = gguf_get_arr_n(ctx, idx);
  1115. const int32_t * pinpoints = (const int32_t *)gguf_get_arr_data(ctx, idx);
  1116. for (int i = 0; i < 32 && i < n && pinpoints[i] != 0; ++i) {
  1117. hparams.image_grid_pinpoints[i] = pinpoints[i];
  1118. }
  1119. if (n < 32)
  1120. hparams.image_grid_pinpoints[n] = 0;
  1121. } catch (std::runtime_error & /*e*/) {
  1122. hparams.image_grid_pinpoints[0]=0;
  1123. }
  1124. try {
  1125. int idx = get_key_idx(ctx, KEY_MM_PATCH_MERGE_TYPE);
  1126. strcpy(hparams.mm_patch_merge_type, gguf_get_val_str(ctx, idx));
  1127. } catch (std::runtime_error & /*e*/) {
  1128. strcpy(hparams.mm_patch_merge_type, "flat");
  1129. }
  1130. try {
  1131. hparams.image_crop_resolution = get_u32(ctx, KEY_IMAGE_CROP_RESOLUTION); // llava-1.6
  1132. } catch(const std::exception& /*e*/) {
  1133. hparams.image_crop_resolution = hparams.image_size;
  1134. }
  1135. int idx_mean = get_key_idx(ctx, KEY_IMAGE_MEAN);
  1136. int idx_std = get_key_idx(ctx, KEY_IMAGE_STD);
  1137. const float * mean_data = (const float *)gguf_get_arr_data(ctx, idx_mean);
  1138. const float * std_data = (const float *)gguf_get_arr_data(ctx, idx_std);
  1139. for (int i = 0; i < 3; ++i) {
  1140. new_clip->image_mean[i] = mean_data[i];
  1141. new_clip->image_std[i] = std_data[i];
  1142. }
  1143. if (verbosity >= 2) {
  1144. LOG_TEE("\n%s: vision model hparams\n", __func__);
  1145. LOG_TEE("image_size %d\n", hparams.image_size);
  1146. LOG_TEE("patch_size %d\n", hparams.patch_size);
  1147. LOG_TEE("v_hidden_size %d\n", hparams.hidden_size);
  1148. LOG_TEE("v_n_intermediate %d\n", hparams.n_intermediate);
  1149. LOG_TEE("v_projection_dim %d\n", hparams.projection_dim);
  1150. LOG_TEE("v_n_head %d\n", hparams.n_head);
  1151. LOG_TEE("v_n_layer %d\n", hparams.n_layer);
  1152. LOG_TEE("v_eps %f\n", hparams.eps);
  1153. LOG_TEE("v_image_mean %f %f %f\n", new_clip->image_mean[0], new_clip->image_mean[1], new_clip->image_mean[2]);
  1154. LOG_TEE("v_image_std %f %f %f\n", new_clip->image_std[0], new_clip->image_std[1], new_clip->image_std[2]);
  1155. LOG_TEE("v_image_grid_pinpoints: ");
  1156. for (int i = 0; i < 32 && (hparams.image_grid_pinpoints[i] != 0); ++i) {
  1157. LOG_TEE("%d ", hparams.image_grid_pinpoints[i]);
  1158. }
  1159. LOG_TEE("\n");
  1160. LOG_TEE("v_mm_patch_merge_type: %s\n", hparams.mm_patch_merge_type);
  1161. }
  1162. try {
  1163. vision_model.class_embedding = get_tensor(new_clip->ctx_data, TN_CLASS_EMBD);
  1164. new_clip->has_class_embedding = true;
  1165. } catch (const std::exception& /*e*/) {
  1166. new_clip->has_class_embedding = false;
  1167. }
  1168. try {
  1169. vision_model.pre_ln_w = get_tensor(new_clip->ctx_data, format(TN_LN_PRE, "v", "weight"));
  1170. vision_model.pre_ln_b = get_tensor(new_clip->ctx_data, format(TN_LN_PRE, "v", "bias"));
  1171. new_clip->has_pre_norm = true;
  1172. } catch (std::exception & /*e*/) {
  1173. new_clip->has_pre_norm = false;
  1174. }
  1175. try {
  1176. vision_model.post_ln_w = get_tensor(new_clip->ctx_data, format(TN_LN_POST, "v", "weight"));
  1177. vision_model.post_ln_b = get_tensor(new_clip->ctx_data, format(TN_LN_POST, "v", "bias"));
  1178. new_clip->has_post_norm = true;
  1179. } catch (std::exception & /*e*/) {
  1180. new_clip->has_post_norm = false;
  1181. }
  1182. try {
  1183. vision_model.patch_bias = get_tensor(new_clip->ctx_data, TN_PATCH_BIAS);
  1184. new_clip->has_patch_bias = true;
  1185. } catch (std::exception & /*e*/) {
  1186. new_clip->has_patch_bias = false;
  1187. }
  1188. try {
  1189. vision_model.patch_embeddings = get_tensor(new_clip->ctx_data, TN_PATCH_EMBD);
  1190. vision_model.position_embeddings = get_tensor(new_clip->ctx_data, format(TN_POS_EMBD, "v"));
  1191. } catch(const std::exception& /*e*/) {
  1192. LOG_TEE("%s: failed to load vision model tensors\n", __func__);
  1193. }
  1194. // LLaVA projection
  1195. if (new_clip->proj_type == PROJECTOR_TYPE_MLP || new_clip->proj_type == PROJECTOR_TYPE_MLP_NORM) {
  1196. vision_model.mm_0_w = get_tensor(new_clip->ctx_data, format(TN_LLAVA_PROJ, 0, "weight"));
  1197. vision_model.mm_0_b = get_tensor(new_clip->ctx_data, format(TN_LLAVA_PROJ, 0, "bias"));
  1198. try {
  1199. // Yi-type llava
  1200. vision_model.mm_1_w = get_tensor(new_clip->ctx_data, format(TN_LLAVA_PROJ, 1, "weight"));
  1201. vision_model.mm_1_b = get_tensor(new_clip->ctx_data, format(TN_LLAVA_PROJ, 1, "bias"));
  1202. } catch (std::runtime_error & /*e*/) { }
  1203. try {
  1204. // missing in Yi-type llava
  1205. vision_model.mm_2_w = get_tensor(new_clip->ctx_data, format(TN_LLAVA_PROJ, 2, "weight"));
  1206. vision_model.mm_2_b = get_tensor(new_clip->ctx_data, format(TN_LLAVA_PROJ, 2, "bias"));
  1207. } catch (std::runtime_error & /*e*/) { }
  1208. try {
  1209. // Yi-type llava
  1210. vision_model.mm_3_w = get_tensor(new_clip->ctx_data, format(TN_LLAVA_PROJ, 3, "weight"));
  1211. vision_model.mm_3_b = get_tensor(new_clip->ctx_data, format(TN_LLAVA_PROJ, 3, "bias"));
  1212. } catch (std::runtime_error & /*e*/) { }
  1213. try {
  1214. // Yi-type llava
  1215. vision_model.mm_4_w = get_tensor(new_clip->ctx_data, format(TN_LLAVA_PROJ, 4, "weight"));
  1216. vision_model.mm_4_b = get_tensor(new_clip->ctx_data, format(TN_LLAVA_PROJ, 4, "bias"));
  1217. } catch (std::runtime_error & /*e*/) { }
  1218. try {
  1219. vision_model.image_newline = get_tensor(new_clip->ctx_data, TN_IMAGE_NEWLINE);
  1220. // LOG_TEE("%s: image_newline tensor (llava-1.6) found\n", __func__);
  1221. } catch (std::runtime_error & /*e*/) { }
  1222. } else if (new_clip->proj_type == PROJECTOR_TYPE_LDP) {
  1223. // MobileVLM projection
  1224. vision_model.mm_model_mlp_1_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_MLP, 1, "weight"));
  1225. vision_model.mm_model_mlp_1_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_MLP, 1, "bias"));
  1226. vision_model.mm_model_mlp_3_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_MLP, 3, "weight"));
  1227. vision_model.mm_model_mlp_3_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_MLP, 3, "bias"));
  1228. vision_model.mm_model_block_1_block_0_0_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 1, 0, "0.weight"));
  1229. vision_model.mm_model_block_1_block_0_1_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 1, 0, "1.weight"));
  1230. vision_model.mm_model_block_1_block_0_1_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 1, 0, "1.bias"));
  1231. vision_model.mm_model_block_1_block_1_fc1_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 1, 1, "fc1.weight"));
  1232. vision_model.mm_model_block_1_block_1_fc1_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 1, 1, "fc1.bias"));
  1233. vision_model.mm_model_block_1_block_1_fc2_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 1, 1, "fc2.weight"));
  1234. vision_model.mm_model_block_1_block_1_fc2_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 1, 1, "fc2.bias"));
  1235. vision_model.mm_model_block_1_block_2_0_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 1, 2, "0.weight"));
  1236. vision_model.mm_model_block_1_block_2_1_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 1, 2, "1.weight"));
  1237. vision_model.mm_model_block_1_block_2_1_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 1, 2, "1.bias"));
  1238. vision_model.mm_model_block_2_block_0_0_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 2, 0, "0.weight"));
  1239. vision_model.mm_model_block_2_block_0_1_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 2, 0, "1.weight"));
  1240. vision_model.mm_model_block_2_block_0_1_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 2, 0, "1.bias"));
  1241. vision_model.mm_model_block_2_block_1_fc1_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 2, 1, "fc1.weight"));
  1242. vision_model.mm_model_block_2_block_1_fc1_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 2, 1, "fc1.bias"));
  1243. vision_model.mm_model_block_2_block_1_fc2_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 2, 1, "fc2.weight"));
  1244. vision_model.mm_model_block_2_block_1_fc2_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 2, 1, "fc2.bias"));
  1245. vision_model.mm_model_block_2_block_2_0_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 2, 2, "0.weight"));
  1246. vision_model.mm_model_block_2_block_2_1_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 2, 2, "1.weight"));
  1247. vision_model.mm_model_block_2_block_2_1_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_BLOCK, 2, 2, "1.bias"));
  1248. }
  1249. else if (new_clip->proj_type == PROJECTOR_TYPE_LDPV2)
  1250. {
  1251. // MobilVLM_V2 projection
  1252. vision_model.mm_model_mlp_0_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_MLP, 0, "weight"));
  1253. vision_model.mm_model_mlp_0_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_MLP, 0, "bias"));
  1254. vision_model.mm_model_mlp_2_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_MLP, 2, "weight"));
  1255. vision_model.mm_model_mlp_2_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_MLP, 2, "bias"));
  1256. vision_model.mm_model_peg_0_w = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_PEG, 0, "weight"));
  1257. vision_model.mm_model_peg_0_b = get_tensor(new_clip->ctx_data, format(TN_MVLM_PROJ_PEG, 0, "bias"));
  1258. }
  1259. else if (new_clip->proj_type == PROJECTOR_TYPE_RESAMPLER) {
  1260. // vision_model.mm_model_pos_embed = get_tensor(new_clip->ctx_data, TN_MINICPMV_POS_EMBD);
  1261. vision_model.mm_model_pos_embed_k = get_tensor(new_clip->ctx_data, TN_MINICPMV_POS_EMBD_K);
  1262. vision_model.mm_model_query = get_tensor(new_clip->ctx_data, TN_MINICPMV_QUERY);
  1263. vision_model.mm_model_proj = get_tensor(new_clip->ctx_data, TN_MINICPMV_PROJ);
  1264. vision_model.mm_model_kv_proj = get_tensor(new_clip->ctx_data, TN_MINICPMV_KV_PROJ);
  1265. vision_model.mm_model_attn_q_w = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_ATTN, "q", "weight"));
  1266. vision_model.mm_model_attn_k_w = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_ATTN, "k", "weight"));
  1267. vision_model.mm_model_attn_v_w = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_ATTN, "v", "weight"));
  1268. vision_model.mm_model_attn_q_b = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_ATTN, "q", "bias"));
  1269. vision_model.mm_model_attn_k_b = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_ATTN, "k", "bias"));
  1270. vision_model.mm_model_attn_v_b = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_ATTN, "v", "bias"));
  1271. vision_model.mm_model_attn_o_w = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_ATTN, "out", "weight"));
  1272. vision_model.mm_model_attn_o_b = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_ATTN, "out", "bias"));
  1273. vision_model.mm_model_ln_q_w = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_LN, "q", "weight"));
  1274. vision_model.mm_model_ln_q_b = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_LN, "q", "bias"));
  1275. vision_model.mm_model_ln_kv_w = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_LN, "kv", "weight"));
  1276. vision_model.mm_model_ln_kv_b = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_LN, "kv", "bias"));
  1277. vision_model.mm_model_ln_post_w = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_LN, "post", "weight"));
  1278. vision_model.mm_model_ln_post_b = get_tensor(new_clip->ctx_data, format(TN_MINICPMV_LN, "post", "bias"));
  1279. }
  1280. else {
  1281. std::string proj_type = PROJECTOR_TYPE_NAMES[new_clip->proj_type];
  1282. throw std::runtime_error(format("%s: don't support projector with: %s currently\n", __func__, proj_type.c_str()));
  1283. }
  1284. vision_model.layers.resize(hparams.n_layer);
  1285. for (int il = 0; il < hparams.n_layer; ++il) {
  1286. auto & layer = vision_model.layers[il];
  1287. layer.k_w = get_tensor(new_clip->ctx_data, format(TN_ATTN_K, "v", il, "weight"));
  1288. layer.q_w = get_tensor(new_clip->ctx_data, format(TN_ATTN_Q, "v", il, "weight"));
  1289. layer.v_w = get_tensor(new_clip->ctx_data, format(TN_ATTN_V, "v", il, "weight"));
  1290. layer.o_w = get_tensor(new_clip->ctx_data, format(TN_ATTN_OUTPUT, "v", il, "weight"));
  1291. layer.ln_1_w = get_tensor(new_clip->ctx_data, format(TN_LN_1, "v", il, "weight"));
  1292. layer.ln_2_w = get_tensor(new_clip->ctx_data, format(TN_LN_2, "v", il, "weight"));
  1293. layer.ff_i_w = get_tensor(new_clip->ctx_data, format(TN_FFN_DOWN, "v", il, "weight"));
  1294. layer.ff_o_w = get_tensor(new_clip->ctx_data, format(TN_FFN_UP, "v", il, "weight"));
  1295. layer.k_b = get_tensor(new_clip->ctx_data, format(TN_ATTN_K, "v", il, "bias"));
  1296. layer.q_b = get_tensor(new_clip->ctx_data, format(TN_ATTN_Q, "v", il, "bias"));
  1297. layer.v_b = get_tensor(new_clip->ctx_data, format(TN_ATTN_V, "v", il, "bias"));
  1298. layer.o_b = get_tensor(new_clip->ctx_data, format(TN_ATTN_OUTPUT, "v", il, "bias"));
  1299. layer.ln_1_b = get_tensor(new_clip->ctx_data, format(TN_LN_1, "v", il, "bias"));
  1300. layer.ln_2_b = get_tensor(new_clip->ctx_data, format(TN_LN_2, "v", il, "bias"));
  1301. layer.ff_i_b = get_tensor(new_clip->ctx_data, format(TN_FFN_DOWN, "v", il, "bias"));
  1302. layer.ff_o_b = get_tensor(new_clip->ctx_data, format(TN_FFN_UP, "v", il, "bias"));
  1303. }
  1304. }
  1305. ggml_free(meta);
  1306. new_clip->ctx_gguf = ctx;
  1307. // measure mem requirement and allocate
  1308. {
  1309. new_clip->buf_compute_meta.resize(GGML_DEFAULT_GRAPH_SIZE * ggml_tensor_overhead() + ggml_graph_overhead());
  1310. new_clip->compute_alloc = ggml_gallocr_new(ggml_backend_get_default_buffer_type(new_clip->backend));
  1311. clip_image_f32_batch batch;
  1312. batch.size = 1;
  1313. ggml_cgraph * gf = clip_image_build_graph(new_clip, &batch, nullptr, false);
  1314. ggml_gallocr_reserve(new_clip->compute_alloc, gf);
  1315. size_t compute_memory_buffer_size = ggml_gallocr_get_buffer_size(new_clip->compute_alloc, 0);
  1316. LOG_TEE("%s: compute allocated memory: %.2f MB\n", __func__, compute_memory_buffer_size /1024.0/1024.0);
  1317. }
  1318. return new_clip;
  1319. }
  1320. void clip_add_load_image_size(struct clip_ctx * ctx_clip, struct clip_image_size * load_image_size) {
  1321. ctx_clip->load_image_size = load_image_size;
  1322. }
  1323. struct clip_image_size * clip_image_size_init() {
  1324. struct clip_image_size * load_image_size = new struct clip_image_size();
  1325. load_image_size->width = 448;
  1326. load_image_size->height = 448;
  1327. return load_image_size;
  1328. }
  1329. struct clip_image_u8 * clip_image_u8_init() {
  1330. return new clip_image_u8();
  1331. }
  1332. struct clip_image_f32 * clip_image_f32_init() {
  1333. return new clip_image_f32();
  1334. }
  1335. void clip_image_u8_free(struct clip_image_u8 * img) { delete img; }
  1336. void clip_image_f32_free(struct clip_image_f32 * img) { delete img; }
  1337. void clip_image_u8_batch_free(struct clip_image_u8_batch * batch) {
  1338. if (batch->size > 0) {
  1339. delete[] batch->data;
  1340. batch->size = 0;
  1341. }
  1342. }
  1343. void clip_image_f32_batch_free(struct clip_image_f32_batch * batch) {
  1344. if (batch->size > 0) {
  1345. delete[] batch->data;
  1346. batch->size = 0;
  1347. }
  1348. }
  1349. static void build_clip_img_from_data(const stbi_uc * data, int nx, int ny, clip_image_u8 * img) {
  1350. img->nx = nx;
  1351. img->ny = ny;
  1352. img->buf.resize(3 * nx * ny);
  1353. memcpy(img->buf.data(), data, img->buf.size());
  1354. }
  1355. bool clip_image_load_from_file(const char * fname, clip_image_u8 * img) {
  1356. int nx, ny, nc;
  1357. auto * data = stbi_load(fname, &nx, &ny, &nc, 3);
  1358. if (!data) {
  1359. LOG_TEE("%s: failed to load image '%s'\n", __func__, fname);
  1360. return false;
  1361. }
  1362. build_clip_img_from_data(data, nx, ny, img);
  1363. stbi_image_free(data);
  1364. return true;
  1365. }
  1366. bool clip_image_load_from_bytes(const unsigned char * bytes, size_t bytes_length, struct clip_image_u8 * img) {
  1367. int nx, ny, nc;
  1368. auto * data = stbi_load_from_memory(bytes, bytes_length, &nx, &ny, &nc, 3);
  1369. if (!data) {
  1370. LOG_TEE("%s: failed to decode image bytes\n", __func__);
  1371. return false;
  1372. }
  1373. build_clip_img_from_data(data, nx, ny, img);
  1374. stbi_image_free(data);
  1375. return true;
  1376. }
  1377. // Linear interpolation between two points
  1378. inline float clip_lerp(float s, float e, float t) {
  1379. return s + (e - s) * t;
  1380. }
  1381. // Bilinear resize function
  1382. static void bilinear_resize(const clip_image_u8& src, clip_image_u8& dst, int target_width, int target_height) {
  1383. dst.nx = target_width;
  1384. dst.ny = target_height;
  1385. dst.buf.resize(3 * target_width * target_height);
  1386. float x_ratio = static_cast<float>(src.nx - 1) / target_width;
  1387. float y_ratio = static_cast<float>(src.ny - 1) / target_height;
  1388. for (int y = 0; y < target_height; y++) {
  1389. for (int x = 0; x < target_width; x++) {
  1390. float px = x_ratio * x;
  1391. float py = y_ratio * y;
  1392. int x_floor = static_cast<int>(px);
  1393. int y_floor = static_cast<int>(py);
  1394. float x_lerp = px - x_floor;
  1395. float y_lerp = py - y_floor;
  1396. for (int c = 0; c < 3; c++) {
  1397. float top = clip_lerp(
  1398. static_cast<float>(src.buf[3 * (y_floor * src.nx + x_floor) + c]),
  1399. static_cast<float>(src.buf[3 * (y_floor * src.nx + (x_floor + 1)) + c]),
  1400. x_lerp
  1401. );
  1402. float bottom = clip_lerp(
  1403. static_cast<float>(src.buf[3 * ((y_floor + 1) * src.nx + x_floor) + c]),
  1404. static_cast<float>(src.buf[3 * ((y_floor + 1) * src.nx + (x_floor + 1)) + c]),
  1405. x_lerp
  1406. );
  1407. dst.buf[3 * (y * target_width + x) + c] = static_cast<uint8_t>(clip_lerp(top, bottom, y_lerp));
  1408. }
  1409. }
  1410. }
  1411. }
  1412. // Normalize image to float32 - careful with pytorch .to(model.device, dtype=torch.float16) - this sometimes reduces precision (32>16>32), sometimes not
  1413. static void normalize_image_u8_to_f32(const clip_image_u8* src, clip_image_f32* dst, const float mean[3], const float std[3]) {
  1414. dst->nx = src->nx;
  1415. dst->ny = src->ny;
  1416. dst->buf.resize(src->buf.size());
  1417. for (size_t i = 0; i < src->buf.size(); ++i) {
  1418. int c = i % 3; // rgb
  1419. dst->buf[i] = (static_cast<float>(src->buf[i]) / 255.0f - mean[c]) / std[c];
  1420. }
  1421. }
  1422. inline int clip(int x, int lower, int upper) {
  1423. return std::max(lower, std::min(x, upper));
  1424. }
  1425. static bool bicubic_resize(const clip_image_u8 &img, clip_image_u8 &dst, int target_width, int target_height) {
  1426. const int nx = img.nx;
  1427. const int ny = img.ny;
  1428. dst.nx = target_width;
  1429. dst.ny = target_height;
  1430. dst.buf.resize(3 * target_width * target_height);
  1431. float Cc;
  1432. float C[5];
  1433. float d0, d2, d3, a0, a1, a2, a3;
  1434. int i, j, k, jj;
  1435. int x, y;
  1436. float dx, dy;
  1437. float tx, ty;
  1438. tx = (float)nx / (float)target_width;
  1439. ty = (float)ny / (float)target_height;
  1440. // Bicubic interpolation; adapted from ViT.cpp, inspired from :
  1441. // -> https://github.com/yglukhov/bicubic-interpolation-image-processing/blob/master/libimage.c#L36
  1442. // -> https://en.wikipedia.org/wiki/Bicubic_interpolation
  1443. for (i = 0; i < target_height; i++) {
  1444. for (j = 0; j < target_width; j++) {
  1445. x = (int)(tx * j);
  1446. y = (int)(ty * i);
  1447. dx = tx * j - x;
  1448. dy = ty * i - y;
  1449. for (k = 0; k < 3; k++) {
  1450. for (jj = 0; jj <= 3; jj++) {
  1451. d0 = img.buf[(clip(y - 1 + jj, 0, ny - 1) * nx + clip(x - 1, 0, nx - 1)) * 3 + k] - img.buf[(clip(y - 1 + jj, 0, ny - 1) * nx + clip(x, 0, nx - 1)) * 3 + k];
  1452. d2 = img.buf[(clip(y - 1 + jj, 0, ny - 1) * nx + clip(x + 1, 0, nx - 1)) * 3 + k] - img.buf[(clip(y - 1 + jj, 0, ny - 1) * nx + clip(x, 0, nx - 1)) * 3 + k];
  1453. d3 = img.buf[(clip(y - 1 + jj, 0, ny - 1) * nx + clip(x + 2, 0, nx - 1)) * 3 + k] - img.buf[(clip(y - 1 + jj, 0, ny - 1) * nx + clip(x, 0, nx - 1)) * 3 + k];
  1454. a0 = img.buf[(clip(y - 1 + jj, 0, ny - 1) * nx + clip(x, 0, nx - 1)) * 3 + k];
  1455. a1 = -1.0 / 3 * d0 + d2 - 1.0 / 6 * d3;
  1456. a2 = 1.0 / 2 * d0 + 1.0 / 2 * d2;
  1457. a3 = -1.0 / 6 * d0 - 1.0 / 2 * d2 + 1.0 / 6 * d3;
  1458. C[jj] = a0 + a1 * dx + a2 * dx * dx + a3 * dx * dx * dx;
  1459. d0 = C[0] - C[1];
  1460. d2 = C[2] - C[1];
  1461. d3 = C[3] - C[1];
  1462. a0 = C[1];
  1463. a1 = -1.0 / 3 * d0 + d2 - 1.0 / 6 * d3;
  1464. a2 = 1.0 / 2 * d0 + 1.0 / 2 * d2;
  1465. a3 = -1.0 / 6 * d0 - 1.0 / 2 * d2 + 1.0 / 6 * d3;
  1466. Cc = a0 + a1 * dy + a2 * dy * dy + a3 * dy * dy * dy;
  1467. const uint8_t Cc2 = std::min(std::max(std::round(Cc), 0.0f), 255.0f);
  1468. dst.buf[(i * target_width + j) * 3 + k] = float(Cc2);
  1469. }
  1470. }
  1471. }
  1472. }
  1473. return true;
  1474. }
  1475. // llava-1.6 type of resize_and_pad (black)
  1476. static void resize_and_pad_image(const clip_image_u8& image, clip_image_u8 &image_output, const std::pair<int, int>& target_resolution) {
  1477. int target_width = target_resolution.first;
  1478. int target_height = target_resolution.second;
  1479. float scale_w = static_cast<float>(target_width) / image.nx;
  1480. float scale_h = static_cast<float>(target_height) / image.ny;
  1481. int new_width, new_height;
  1482. if (scale_w < scale_h) {
  1483. new_width = target_width;
  1484. new_height = std::min(static_cast<int>(std::ceil(image.ny * scale_w)), target_height);
  1485. } else {
  1486. new_height = target_height;
  1487. new_width = std::min(static_cast<int>(std::ceil(image.nx * scale_h)), target_width);
  1488. }
  1489. clip_image_u8 resized_image;
  1490. // bilinear_resize(image, resized_image, new_width, new_height);
  1491. bicubic_resize(image, resized_image, new_width, new_height);
  1492. clip_image_u8 padded_image;
  1493. padded_image.nx = target_width;
  1494. padded_image.ny = target_height;
  1495. padded_image.buf.resize(3 * target_width * target_height, 0); // Initialize with black
  1496. // Calculate padding offsets
  1497. int pad_x = (target_width - new_width) / 2;
  1498. int pad_y = (target_height - new_height) / 2;
  1499. // Copy the resized image into the center of the padded buffer
  1500. for (int y = 0; y < new_height; ++y) {
  1501. for (int x = 0; x < new_width; ++x) {
  1502. for (int c = 0; c < 3; ++c) {
  1503. padded_image.buf[3 * ((y + pad_y) * target_width + (x + pad_x)) + c] = resized_image.buf[3 * (y * new_width + x) + c];
  1504. }
  1505. }
  1506. }
  1507. image_output = std::move(padded_image);
  1508. }
  1509. /**
  1510. * Selects the best resolution from a list of possible resolutions based on the original size.
  1511. *
  1512. * @param original_size The original size of the image in the format (width, height).
  1513. * @param possible_resolutions A list of possible resolutions in the format [(width1, height1), (width2, height2), ...].
  1514. * @return The best fit resolution in the format (width, height).
  1515. */
  1516. static std::pair<int, int> select_best_resolution(const std::pair<int, int> & original_size, const std::vector<std::pair<int, int>> & possible_resolutions) {
  1517. int original_width = original_size.first;
  1518. int original_height = original_size.second;
  1519. std::pair<int, int> best_fit;
  1520. int max_effective_resolution = 0;
  1521. int min_wasted_resolution = std::numeric_limits<int>::max();
  1522. for (const auto& resolution : possible_resolutions) {
  1523. int width = resolution.first;
  1524. int height = resolution.second;
  1525. float scale = std::min(static_cast<float>(width) / original_width, static_cast<float>(height) / original_height);
  1526. int downscaled_width = static_cast<int>(original_width * scale);
  1527. int downscaled_height = static_cast<int>(original_height * scale);
  1528. int effective_resolution = std::min(downscaled_width * downscaled_height, original_width * original_height);
  1529. int wasted_resolution = (width * height) - effective_resolution;
  1530. // LOG_TEE("resolution: %d %d, scale: %f, downscaled: %d %d, effective: %d, wasted: %d\n", width, height, scale, downscaled_width, downscaled_height, effective_resolution, wasted_resolution);
  1531. if (effective_resolution > max_effective_resolution || (effective_resolution == max_effective_resolution && wasted_resolution < min_wasted_resolution)) {
  1532. max_effective_resolution = effective_resolution;
  1533. min_wasted_resolution = wasted_resolution;
  1534. best_fit = resolution;
  1535. }
  1536. }
  1537. return best_fit;
  1538. }
  1539. static std::vector<clip_image_u8*> divide_to_patches_u8(const clip_image_u8 & image, int patch_size) {
  1540. std::vector<clip_image_u8*> patches;
  1541. int width = image.nx;
  1542. int height = image.ny;
  1543. for (int i = 0; i < height; i += patch_size) {
  1544. for (int j = 0; j < width; j += patch_size) {
  1545. clip_image_u8 *patch = clip_image_u8_init();
  1546. patch->nx = std::min(patch_size, width - j);
  1547. patch->ny = std::min(patch_size, height - i);
  1548. patch->buf.resize(3 * patch->nx * patch->ny);
  1549. for (int y = 0; y < patch->ny; ++y) {
  1550. for (int x = 0; x < patch->nx; ++x) {
  1551. for (int c = 0; c < 3; ++c) {
  1552. patch->buf[3 * (y * patch->nx + x) + c] = image.buf[3 * ((i + y) * width + (j + x)) + c];
  1553. }
  1554. }
  1555. }
  1556. patches.push_back(patch);
  1557. }
  1558. }
  1559. return patches;
  1560. }
  1561. static int ensure_divide(int length, int patch_size) {
  1562. return std::max(static_cast<int>(std::round(static_cast<float>(length) / patch_size) * patch_size), patch_size);
  1563. }
  1564. static std::pair<int, int> uhd_find_best_resize(std::pair<int, int> original_size, int scale_resolution, int patch_size, bool allow_upscale = false) {
  1565. int width = original_size.first;
  1566. int height = original_size.second;
  1567. if ((width * height > scale_resolution * scale_resolution) || allow_upscale) {
  1568. float r = static_cast<float>(width) / height;
  1569. height = static_cast<int>(scale_resolution / std::sqrt(r));
  1570. width = static_cast<int>(height * r);
  1571. }
  1572. int best_width = ensure_divide(width, patch_size);
  1573. int best_height = ensure_divide(height, patch_size);
  1574. return std::make_pair(best_width, best_height);
  1575. }
  1576. static std::pair<int, int> uhd_get_refine_size(std::pair<int, int> original_size, std::pair<int, int> grid, int scale_resolution, int patch_size, bool allow_upscale = false) {
  1577. int width, height;
  1578. std::tie(width, height) = original_size;
  1579. int grid_x, grid_y;
  1580. std::tie(grid_x, grid_y) = grid;
  1581. int refine_width = ensure_divide(width, grid_x);
  1582. int refine_height = ensure_divide(height, grid_y);
  1583. int grid_width = refine_width / grid_x;
  1584. int grid_height = refine_height / grid_y;
  1585. // auto best_grid_size = find_best_resize(std::make_tuple(grid_width, grid_height), scale_resolution, patch_size, allow_upscale); (old line)
  1586. auto best_grid_size = uhd_find_best_resize(std::make_pair(grid_width, grid_height), scale_resolution, patch_size, allow_upscale); // (new line) => fixes conversion for make_tuple to make_pair
  1587. int best_grid_width, best_grid_height;
  1588. std::tie(best_grid_width, best_grid_height) = best_grid_size;
  1589. // std::pair<int, int> refine_size = std::make_tuple(best_grid_width * grid_x, best_grid_height * grid_y); (old line)
  1590. std::pair<int, int> refine_size = std::make_pair(best_grid_width * grid_x, best_grid_height * grid_y); // (new line)
  1591. return refine_size;
  1592. }
  1593. static std::pair<int, int> uhd_best_grid(const int max_slice_nums, const int multiple, const float log_ratio) {
  1594. std::vector<int> candidate_split_grids_nums;
  1595. for (int i : {multiple - 1, multiple, multiple + 1}) {
  1596. if (i == 1 || i > max_slice_nums) {
  1597. continue;
  1598. }
  1599. candidate_split_grids_nums.push_back(i);
  1600. }
  1601. std::vector<std::pair<int, int>> candidate_grids;
  1602. for (int split_grids_nums : candidate_split_grids_nums) {
  1603. int m = 1;
  1604. while (m <= split_grids_nums) {
  1605. if (split_grids_nums % m == 0) {
  1606. candidate_grids.emplace_back(m, split_grids_nums / m);
  1607. }
  1608. ++m;
  1609. }
  1610. }
  1611. std::pair<int, int> best_grid{1, 1};
  1612. float min_error = std::numeric_limits<float>::infinity();
  1613. for (const auto& grid : candidate_grids) {
  1614. float error = std::abs(log_ratio - std::log(1.0 * grid.first / grid.second));
  1615. if (error < min_error) {
  1616. best_grid = grid;
  1617. min_error = error;
  1618. }
  1619. }
  1620. return best_grid;
  1621. }
  1622. // inspired from LLaVA-UHD:
  1623. // -> https://arxiv.org/pdf/2403.11703
  1624. // -> https://github.com/thunlp/LLaVA-UHD
  1625. // -> https://github.com/thunlp/LLaVA-UHD/blob/302301bc2175f7e717fb8548516188e89f649753/llava_uhd/train/llava-uhd/slice_logic.py#L118
  1626. static std::vector<std::vector<clip_image_u8 *>> uhd_slice_image(const clip_image_u8 * img, const int max_slice_nums=9, const int scale_resolution=448, const int patch_size=14) {
  1627. const std::pair<int, int> original_size={img->nx,img->ny};
  1628. const int original_width = img->nx;
  1629. const int original_height = img->ny;
  1630. const float log_ratio = log(1.0*original_width/original_height);
  1631. const float ratio = 1.0 * original_width * original_height/ (scale_resolution * scale_resolution);
  1632. const int multiple = fmin(ceil(ratio), max_slice_nums);
  1633. std::vector<std::vector<clip_image_u8 *>> images;
  1634. LOG_TEE("%s: multiple %d\n", __func__, multiple);
  1635. images.push_back(std::vector<clip_image_u8 *>());
  1636. if (multiple <= 1) {
  1637. auto best_size = uhd_find_best_resize(original_size, scale_resolution, patch_size, true);
  1638. clip_image_u8 * source_image = clip_image_u8_init();
  1639. bicubic_resize(*img, *source_image, best_size.first, best_size.second);
  1640. // source_image = image.resize(best_size, Image.Resampling.BICUBIC)
  1641. images[images.size()-1].push_back(source_image);
  1642. }
  1643. else if (multiple > 1) {
  1644. auto best_size = uhd_find_best_resize(original_size, scale_resolution, patch_size);
  1645. clip_image_u8 * source_image = clip_image_u8_init();
  1646. bicubic_resize(*img, *source_image, best_size.first, best_size.second);
  1647. // source_image = image.copy().resize(best_resize, Image.Resampling.BICUBIC)
  1648. LOG_TEE("%s: image_size: %d %d; source_image size: %d %d\n", __func__, img->nx, img->ny, best_size.first, best_size.second);
  1649. images[images.size()-1].push_back(source_image);
  1650. std::pair<int, int> best_grid = uhd_best_grid(max_slice_nums, multiple, log_ratio);
  1651. LOG_TEE("%s: image_size: %d %d; best_grid: %d %d\n", __func__, img->nx, img->ny, best_grid.first, best_grid.second);
  1652. auto refine_size = uhd_get_refine_size(original_size, best_grid, scale_resolution, patch_size, true);
  1653. clip_image_u8 * refine_image = clip_image_u8_init();
  1654. bicubic_resize(*img, *refine_image, refine_size.first, refine_size.second);
  1655. LOG_TEE("%s: refine_image_size: %d %d; refine_size: %d %d\n", __func__, refine_image->nx, refine_image->ny, refine_size.first, refine_size.second);
  1656. // split_to_patches
  1657. int width = refine_image->nx;
  1658. int height = refine_image->ny;
  1659. int grid_x = int(width / best_grid.first);
  1660. int grid_y = int(height / best_grid.second);
  1661. for (int patches_i = 0, ic = 0; patches_i < height && ic < best_grid.second; patches_i += grid_y, ic += 1){
  1662. images.push_back(std::vector<clip_image_u8 *>());
  1663. for(int patches_j = 0, jc = 0; patches_j < width && jc < best_grid.first; patches_j += grid_x, jc += 1){
  1664. clip_image_u8 * patch = clip_image_u8_init();
  1665. patch->nx = grid_x;
  1666. patch->ny = grid_y;
  1667. patch->buf.resize(3 * patch->nx * patch->ny);
  1668. for (int y = patches_i; y < patches_i + grid_y; ++y) {
  1669. for (int x = patches_j; x < patches_j + grid_x; ++x) {
  1670. const int i = 3 * (y * refine_image->nx + x);
  1671. const int j = 3 * ((y-patches_i) * patch->nx + (x-patches_j));
  1672. patch->buf[j] = refine_image->buf[i];
  1673. patch->buf[j+1] = refine_image->buf[i+1];
  1674. patch->buf[j+2] = refine_image->buf[i+2];
  1675. }
  1676. }
  1677. images[images.size()-1].push_back(patch);
  1678. }
  1679. }
  1680. }
  1681. return images;
  1682. }
  1683. int clip_uhd_num_image_embeds_col(struct clip_ctx * ctx_clip) {
  1684. const int max_slice_nums=9;
  1685. const int scale_resolution=448;
  1686. const int original_width = ctx_clip->load_image_size->width;
  1687. const int original_height = ctx_clip->load_image_size->height;
  1688. const float log_ratio = log(1.0*original_width/original_height);
  1689. const float ratio = 1.0 * original_width * original_height/ (scale_resolution * scale_resolution);
  1690. const int multiple = fmin(ceil(ratio), max_slice_nums);
  1691. std::pair<int, int> best_grid = uhd_best_grid(max_slice_nums, multiple, log_ratio);
  1692. return best_grid.first;
  1693. }
  1694. // returns the normalized float tensor for llava-1.5, for spatial_unpad with anyres processing for llava-1.6 it returns the normalized image patch tensors as a vector
  1695. // res_imgs memory is being allocated here, previous allocations will be freed if found
  1696. bool clip_image_preprocess(struct clip_ctx * ctx, const clip_image_u8 * img, clip_image_f32_batch * res_imgs) {
  1697. if(clip_is_minicpmv(ctx)){
  1698. int max_slice_nums = 9;
  1699. std::vector<std::vector<clip_image_u8 *>> imgs = uhd_slice_image(img, max_slice_nums);
  1700. res_imgs->size = 0;
  1701. for (size_t i = 0; i < imgs.size(); ++i){
  1702. res_imgs->size += imgs[i].size();
  1703. }
  1704. res_imgs->data = new clip_image_f32[res_imgs->size];
  1705. int idx = 0;
  1706. for (size_t i = 0; i < imgs.size(); ++i) {
  1707. for (size_t j = 0; j < imgs[i].size(); ++j) {
  1708. LOG_TEE("%s: %d %d\n", __func__,imgs[i][j]->nx,imgs[i][j]->ny);
  1709. clip_image_f32 * res = clip_image_f32_init();
  1710. normalize_image_u8_to_f32(imgs[i][j], res, ctx->image_mean, ctx->image_std);
  1711. res_imgs->data[idx++] = *res;
  1712. clip_image_f32_free(res);
  1713. }
  1714. }
  1715. return true;
  1716. }
  1717. bool pad_to_square = true;
  1718. if (!ctx->has_vision_encoder) {
  1719. LOG_TEE("This gguf file seems to have no vision encoder\n");
  1720. return false;
  1721. }
  1722. auto & params = ctx->vision_model.hparams;
  1723. // The model config actually contains all we need to decide on how to preprocess, here we automatically switch to the new llava-1.6 preprocessing
  1724. if (strcmp(params.mm_patch_merge_type, "spatial_unpad") == 0) {
  1725. pad_to_square = false;
  1726. }
  1727. // free the previous res_imgs if any set
  1728. if (res_imgs->size > 0) {
  1729. clip_image_f32_batch_free(res_imgs);
  1730. }
  1731. res_imgs->data = nullptr;
  1732. res_imgs->size = 0;
  1733. // the logic below is to pad the shorter side to the longer side with a background color: rgb(122, 116, 104)
  1734. // see https://github.com/haotian-liu/LLaVA/blob/e854a2bf85118c504f6f16bf5c3c7c92f8fa8c6b/llava/conversation.py#L113-L156
  1735. clip_image_u8 * temp = clip_image_u8_init(); // we will keep the input image data here temporarily
  1736. if (pad_to_square && img->nx != img->ny) {
  1737. int longer_side = std::max(img->nx, img->ny);
  1738. temp->nx = longer_side;
  1739. temp->ny = longer_side;
  1740. temp->buf.resize(3 * longer_side * longer_side);
  1741. const uint8_t bc[3] = {122, 116, 104}; // background color in RGB from LLaVA (this is the mean rgb color * 255)
  1742. // fill with background color
  1743. for (size_t i = 0; i < temp->buf.size(); i++) {
  1744. temp->buf[i] = bc[i % 3];
  1745. }
  1746. // copy from the input image
  1747. for (int y = 0; y < img->ny; y++) {
  1748. for (int x = 0; x < img->nx; x++) {
  1749. const int i = 3 * (y * img->nx + x);
  1750. const int j = 3 * (y * temp->nx + x);
  1751. temp->buf[j] = img->buf[i];
  1752. temp->buf[j+1] = img->buf[i+1];
  1753. temp->buf[j+2] = img->buf[i+2];
  1754. }
  1755. }
  1756. } else {
  1757. if (params.image_grid_pinpoints[0] != 0) {
  1758. // "spatial_unpad" with "anyres" processing for llava-1.6
  1759. std::vector<std::pair<int, int>> possible_resolutions;
  1760. for (int i = 0; i < 32 && params.image_grid_pinpoints[i] != 0; i+=2) {
  1761. possible_resolutions.push_back({params.image_grid_pinpoints[i], params.image_grid_pinpoints[i+1]});
  1762. }
  1763. std::pair<int, int> best_resolution = select_best_resolution({img->nx, img->ny}, possible_resolutions);
  1764. // clip_image_save_to_bmp(*img, "input.bmp");
  1765. resize_and_pad_image(*img, *temp, best_resolution); // we do not pad with mean-bg color anymore in llava-1.6
  1766. // clip_image_save_to_bmp(*temp, "resized.bmp");
  1767. // visually verify normalized image:
  1768. // normalize_image_u8_to_f32(*temp, *res, ctx->image_mean, ctx->image_std);
  1769. // {
  1770. // clip_image_u8 * temp2 = clip_image_u8_init();
  1771. // clip_image_convert_f32_to_u8(*res, *temp2);
  1772. // clip_image_save_to_bmp(*temp2, "resized_normalized_f32.bmp");
  1773. // clip_image_u8_free(temp2);
  1774. // }
  1775. std::vector<clip_image_u8 *> patches = divide_to_patches_u8(*temp, params.image_size); // prepare spatial sorted main patches of image_size each (336 in llava-1.6)
  1776. clip_image_u8 *image_original_resize = clip_image_u8_init();
  1777. // bilinear_resize(*img, *image_original_resize, params.image_size, params.image_size); // in python this is "shortest_edge", but all CLIP are square
  1778. bicubic_resize(*img, *image_original_resize, params.image_size, params.image_size); // in python this is "shortest_edge", but all CLIP are square
  1779. patches.insert(patches.begin(), image_original_resize);
  1780. // clip_image_f32_batch_init(patches.size());
  1781. res_imgs->size = patches.size();
  1782. res_imgs->data = new clip_image_f32[res_imgs->size];
  1783. int num=0;
  1784. for (auto& patch : patches) {
  1785. normalize_image_u8_to_f32(patch, &res_imgs->data[num], ctx->image_mean, ctx->image_std);
  1786. num++;
  1787. }
  1788. for (size_t i = 0; i < patches.size(); i++) {
  1789. // LOG_TEE("patch %d: %d %d\n", i, patches[i]->nx, patches[i]->ny);
  1790. clip_image_u8_free(patches[i]);
  1791. }
  1792. clip_image_u8_free(temp);
  1793. return true;
  1794. } else {
  1795. temp->nx = img->nx;
  1796. temp->ny = img->ny;
  1797. temp->buf.resize(img->buf.size());
  1798. memcpy(temp->buf.data(), img->buf.data(), temp->buf.size());
  1799. }
  1800. }
  1801. const int nx = temp->nx;
  1802. const int ny = temp->ny;
  1803. // clip_image_save_to_bmp(*temp, "resized_vanilla.bmp");
  1804. const int nx2 = ctx->vision_model.hparams.image_size;
  1805. const int ny2 = ctx->vision_model.hparams.image_size;
  1806. clip_image_f32 * res = clip_image_f32_init();
  1807. res->nx = nx2;
  1808. res->ny = ny2;
  1809. res->buf.resize(3 * nx2 * ny2);
  1810. const float scale = std::max(nx, ny) / (float)ctx->vision_model.hparams.image_size;
  1811. const int nx3 = int(nx / scale + 0.5f);
  1812. const int ny3 = int(ny / scale + 0.5f);
  1813. const auto & m3 = ctx->image_mean; // {0.48145466f, 0.4578275f, 0.40821073f};
  1814. const auto & s3 = ctx->image_std; // {0.26862954f, 0.26130258f, 0.27577711f};
  1815. for (int y = 0; y < ny3; y++) {
  1816. for (int x = 0; x < nx3; x++) {
  1817. for (int c = 0; c < 3; c++) {
  1818. // linear interpolation
  1819. const float sx = (x + 0.5f) * scale - 0.5f;
  1820. const float sy = (y + 0.5f) * scale - 0.5f;
  1821. const int x0 = std::max(0, (int)std::floor(sx));
  1822. const int y0 = std::max(0, (int)std::floor(sy));
  1823. const int x1 = std::min(x0 + 1, nx - 1);
  1824. const int y1 = std::min(y0 + 1, ny - 1);
  1825. const float dx = sx - x0;
  1826. const float dy = sy - y0;
  1827. const int j00 = 3 * (y0 * nx + x0) + c;
  1828. const int j01 = 3 * (y0 * nx + x1) + c;
  1829. const int j10 = 3 * (y1 * nx + x0) + c;
  1830. const int j11 = 3 * (y1 * nx + x1) + c;
  1831. const float v00 = temp->buf[j00];
  1832. const float v01 = temp->buf[j01];
  1833. const float v10 = temp->buf[j10];
  1834. const float v11 = temp->buf[j11];
  1835. const float v0 = v00 * (1.0f - dx) + v01 * dx;
  1836. const float v1 = v10 * (1.0f - dx) + v11 * dx;
  1837. const float v = v0 * (1.0f - dy) + v1 * dy;
  1838. const uint8_t v2 = std::min(std::max(std::round(v), 0.0f), 255.0f);
  1839. const int i = 3 * (y * nx3 + x) + c;
  1840. res->buf[i] = ((float(v2) / 255.0f) - m3[c]) / s3[c];
  1841. }
  1842. }
  1843. }
  1844. clip_image_u8_free(temp);
  1845. // {
  1846. // clip_image_u8 * temp2 = clip_image_u8_init();
  1847. // clip_image_convert_f32_to_u8(*res, *temp2);
  1848. // clip_image_save_to_bmp(*temp2, "resized_normalized_f32_vanilla.bmp");
  1849. // clip_image_u8_free(temp2);
  1850. // }
  1851. // res_imgs.push_back(res);
  1852. res_imgs->size = 1;
  1853. res_imgs->data = new clip_image_f32[res_imgs->size];
  1854. res_imgs->data[0] = *res;
  1855. clip_image_f32_free(res);
  1856. return true;
  1857. }
  1858. ggml_tensor * clip_get_newline_tensor(const struct clip_ctx * ctx) {
  1859. return ctx->vision_model.image_newline;
  1860. }
  1861. void clip_free(clip_ctx * ctx) {
  1862. ggml_free(ctx->ctx_data);
  1863. gguf_free(ctx->ctx_gguf);
  1864. ggml_backend_buffer_free(ctx->params_buffer);
  1865. ggml_backend_free(ctx->backend);
  1866. ggml_gallocr_free(ctx->compute_alloc);
  1867. delete ctx;
  1868. }
  1869. size_t clip_embd_nbytes(const struct clip_ctx * ctx) {
  1870. return clip_n_patches(ctx) * clip_n_mmproj_embd(ctx) * sizeof(float);
  1871. }
  1872. int32_t clip_image_size(const struct clip_ctx * ctx) {
  1873. return ctx->vision_model.hparams.image_size;
  1874. }
  1875. int32_t clip_patch_size(const struct clip_ctx * ctx) {
  1876. return ctx->vision_model.hparams.patch_size;
  1877. }
  1878. int32_t clip_hidden_size(const struct clip_ctx * ctx) {
  1879. return ctx->vision_model.hparams.hidden_size;
  1880. }
  1881. const char * clip_patch_merge_type(const struct clip_ctx * ctx) {
  1882. return ctx->vision_model.hparams.mm_patch_merge_type;
  1883. }
  1884. const int32_t * clip_image_grid(const struct clip_ctx * ctx) {
  1885. return ctx->vision_model.hparams.image_grid_pinpoints;
  1886. }
  1887. int clip_n_patches(const struct clip_ctx * ctx) {
  1888. const auto & params = ctx->vision_model.hparams;
  1889. int n_patches = (params.image_size / params.patch_size) * (params.image_size / params.patch_size);
  1890. if (ctx->proj_type == PROJECTOR_TYPE_LDP || ctx->proj_type == PROJECTOR_TYPE_LDPV2) {
  1891. n_patches /= 4;
  1892. } else if (ctx->proj_type == PROJECTOR_TYPE_RESAMPLER) {
  1893. if (ctx->minicpmv_version == 2) {
  1894. n_patches = 96;
  1895. }
  1896. else if (ctx->minicpmv_version == 3) {
  1897. n_patches = 64;
  1898. }
  1899. }
  1900. return n_patches;
  1901. }
  1902. static std::vector<std::vector<std::vector<float>>> get_1d_sincos_pos_embed_from_grid_new(int embed_dim, const std::vector<std::vector<float>> & pos) {
  1903. assert(embed_dim % 2 == 0);
  1904. int H = pos.size();
  1905. int W = pos[0].size();
  1906. std::vector<float> omega(embed_dim / 2);
  1907. for (int i = 0; i < embed_dim / 2; ++i) {
  1908. omega[i] = 1.0 / pow(10000.0, static_cast<float>(i) / (embed_dim / 2));
  1909. }
  1910. std::vector<std::vector<std::vector<float>>> emb(H, std::vector<std::vector<float>>(W, std::vector<float>(embed_dim)));
  1911. for (int h = 0; h < H; ++h) {
  1912. for (int w = 0; w < W; ++w) {
  1913. for (int d = 0; d < embed_dim / 2; ++d) {
  1914. float out_value = pos[h][w] * omega[d];
  1915. emb[h][w][d] = sin(out_value);
  1916. emb[h][w][d + embed_dim / 2] = cos(out_value);
  1917. }
  1918. }
  1919. }
  1920. return emb;
  1921. }
  1922. static std::vector<std::vector<std::vector<float>>> get_2d_sincos_pos_embed_from_grid(int embed_dim, const std::vector<std::vector<std::vector<float>>> & grid) {
  1923. assert(embed_dim % 2 == 0);
  1924. std::vector<std::vector<std::vector<float>>> emb_h = get_1d_sincos_pos_embed_from_grid_new(embed_dim / 2, grid[0]); // (H, W, D/2)
  1925. std::vector<std::vector<std::vector<float>>> emb_w = get_1d_sincos_pos_embed_from_grid_new(embed_dim / 2, grid[1]); // (H, W, D/2)
  1926. int H = emb_h.size();
  1927. int W = emb_h[0].size();
  1928. std::vector<std::vector<std::vector<float>>> emb(H, std::vector<std::vector<float>>(W, std::vector<float>(embed_dim)));
  1929. for (int h = 0; h < H; ++h) {
  1930. for (int w = 0; w < W; ++w) {
  1931. for (int d = 0; d < embed_dim / 2; ++d) {
  1932. emb[h][w][d] = emb_h[h][w][d];
  1933. emb[h][w][d + embed_dim / 2] = emb_w[h][w][d];
  1934. }
  1935. }
  1936. }
  1937. return emb;
  1938. }
  1939. static std::vector<std::vector<float>> get_2d_sincos_pos_embed(int embed_dim, const std::pair<int, int> image_size) {
  1940. int grid_h_size = image_size.first;
  1941. int grid_w_size = image_size.second;
  1942. std::vector<float> grid_h(grid_h_size);
  1943. std::vector<float> grid_w(grid_w_size);
  1944. for (int i = 0; i < grid_h_size; ++i) {
  1945. grid_h[i] = static_cast<float>(i);
  1946. }
  1947. for (int i = 0; i < grid_w_size; ++i) {
  1948. grid_w[i] = static_cast<float>(i);
  1949. }
  1950. std::vector<std::vector<float>> grid(grid_h_size, std::vector<float>(grid_w_size));
  1951. for (int h = 0; h < grid_h_size; ++h) {
  1952. for (int w = 0; w < grid_w_size; ++w) {
  1953. grid[h][w] = grid_w[w];
  1954. }
  1955. }
  1956. std::vector<std::vector<std::vector<float>>> grid_2d = {grid, grid};
  1957. for (int h = 0; h < grid_h_size; ++h) {
  1958. for (int w = 0; w < grid_w_size; ++w) {
  1959. grid_2d[0][h][w] = grid_h[h];
  1960. grid_2d[1][h][w] = grid_w[w];
  1961. }
  1962. }
  1963. std::vector<std::vector<std::vector<float>>> pos_embed_3d = get_2d_sincos_pos_embed_from_grid(embed_dim, grid_2d);
  1964. int H = image_size.first;
  1965. int W = image_size.second;
  1966. std::vector<std::vector<float>> pos_embed_2d(H * W, std::vector<float>(embed_dim));
  1967. for (int h = 0; h < H; ++h) {
  1968. for (int w = 0; w < W; ++w) {
  1969. pos_embed_2d[w * H + h] = pos_embed_3d[h][w];
  1970. }
  1971. }
  1972. return pos_embed_2d;
  1973. }
  1974. bool clip_image_encode(struct clip_ctx * ctx, const int n_threads, clip_image_f32 * img, float * vec) {
  1975. if (!ctx->has_vision_encoder) {
  1976. LOG_TEE("This gguf file seems to have no vision encoder\n");
  1977. return false;
  1978. }
  1979. clip_image_f32_batch imgs{};
  1980. imgs.size = 1;
  1981. imgs.data = img;
  1982. return clip_image_batch_encode(ctx, n_threads, &imgs, vec);
  1983. }
  1984. bool clip_image_batch_encode(clip_ctx * ctx, const int n_threads, const clip_image_f32_batch * imgs, float * vec) {
  1985. if (!ctx->has_vision_encoder) {
  1986. LOG_TEE("This gguf file seems to have no vision encoder\n");
  1987. return false;
  1988. }
  1989. int batch_size = imgs->size;
  1990. if (ctx->has_llava_projector) {
  1991. GGML_ASSERT(batch_size == 1); // TODO: support multiple images
  1992. }
  1993. if (ctx->has_minicpmv_projector) {
  1994. GGML_ASSERT(batch_size == 1);
  1995. }
  1996. // build the inference graph
  1997. ggml_cgraph * gf = clip_image_build_graph(ctx, imgs, ctx->load_image_size, true);
  1998. ggml_gallocr_alloc_graph(ctx->compute_alloc, gf);
  1999. // set inputs
  2000. const auto & model = ctx->vision_model;
  2001. const auto & hparams = model.hparams;
  2002. const int image_size = hparams.image_size;
  2003. int image_size_width = image_size;
  2004. int image_size_height = image_size;
  2005. if (ctx->has_minicpmv_projector) {
  2006. image_size_width = imgs->data[0].nx;
  2007. image_size_height = imgs->data[0].ny;
  2008. }
  2009. const int patch_size = hparams.patch_size;
  2010. const int num_patches = ((image_size_width / patch_size) * (image_size_height / patch_size));
  2011. const int num_positions = num_patches + (ctx->has_class_embedding ? 1 : 0);
  2012. if(ctx->load_image_size==nullptr){
  2013. ctx->load_image_size= clip_image_size_init();
  2014. }
  2015. const int pos_w = ctx->load_image_size->width/patch_size;
  2016. const int pos_h = ctx->load_image_size->height/patch_size;
  2017. {
  2018. struct ggml_tensor * inp_raw = ggml_graph_get_tensor(gf, "inp_raw");
  2019. float * data = (float *)malloc(ggml_nbytes(inp_raw));
  2020. for (size_t i = 0; i < imgs->size; i++) {
  2021. const int nx = imgs->data[i].nx;
  2022. const int ny = imgs->data[i].ny;
  2023. if (!ctx->has_minicpmv_projector) {
  2024. GGML_ASSERT(nx == image_size && ny == image_size);
  2025. }
  2026. const int n = nx * ny;
  2027. for (int b = 0; b < batch_size; b++) {
  2028. for (int k = 0; k < 3; k++) {
  2029. for (int y = 0; y < ny; y++) {
  2030. for (int x = 0; x < nx; x++) {
  2031. data[(b * 3 * n) + k * n + y * nx + x] = imgs->data[b].buf[3 * (y * nx + x) + k];
  2032. }
  2033. }
  2034. }
  2035. }
  2036. }
  2037. ggml_backend_tensor_set(inp_raw, data, 0, ggml_nbytes(inp_raw));
  2038. free(data);
  2039. }
  2040. if (ctx->has_minicpmv_projector) {
  2041. {
  2042. // inspired from siglip:
  2043. // -> https://huggingface.co/HuggingFaceM4/siglip-so400m-14-980-flash-attn2-navit
  2044. // -> https://huggingface.co/HuggingFaceM4/siglip-so400m-14-980-flash-attn2-navit/blob/d66538faeba44480d0bfaa42145eef26f9423199/modeling_siglip.py#L316
  2045. struct ggml_tensor * positions = ggml_graph_get_tensor(gf, "positions");
  2046. int* positions_data = (int*)malloc(ggml_nbytes(positions));
  2047. int bucket_coords_h[70];
  2048. int bucket_coords_w[70];
  2049. for (int i = 0; i < pos_h; i++){
  2050. bucket_coords_h[i] = std::floor(70.0*i/pos_h);
  2051. }
  2052. for (int i = 0; i < pos_w; i++){
  2053. bucket_coords_w[i] = std::floor(70.0*i/pos_w);
  2054. }
  2055. for (int i = 0, id = 0; i < pos_h; i++){
  2056. for (int j = 0; j < pos_w; j++){
  2057. positions_data[id++] = bucket_coords_h[i]*70 + bucket_coords_w[j];
  2058. }
  2059. }
  2060. ggml_backend_tensor_set(positions, positions_data, 0, ggml_nbytes(positions));
  2061. free(positions_data);
  2062. }
  2063. {
  2064. // inspired from resampler of Qwen-VL:
  2065. // -> https://huggingface.co/Qwen/Qwen-VL/tree/main
  2066. // -> https://huggingface.co/Qwen/Qwen-VL/blob/0547ed36a86561e2e42fecec8fd0c4f6953e33c4/visual.py#L23
  2067. struct ggml_tensor * pos_embed = ggml_graph_get_tensor(gf, "pos_embed");
  2068. int embed_dim = 4096;
  2069. if (ctx->minicpmv_version == 2) {
  2070. embed_dim = 4096;
  2071. }
  2072. else if (ctx->minicpmv_version == 3) {
  2073. embed_dim = 3584;
  2074. }
  2075. auto pos_embed_t = get_2d_sincos_pos_embed(embed_dim, std::make_pair(pos_w, pos_h));
  2076. float * pos_embed_data = (float *)malloc(ggml_nbytes(pos_embed));
  2077. for(int i=0;i<pos_w * pos_h;++i){
  2078. for(int j=0;j<embed_dim;++j){
  2079. pos_embed_data[i*embed_dim+j]=pos_embed_t[i][j];
  2080. }
  2081. }
  2082. ggml_backend_tensor_set(pos_embed, pos_embed_data, 0, ggml_nbytes(pos_embed));
  2083. free(pos_embed_data);
  2084. }
  2085. }
  2086. else{
  2087. {
  2088. if (ctx->has_class_embedding) {
  2089. struct ggml_tensor * embeddings = ggml_graph_get_tensor(gf, "embeddings");
  2090. void* zero_mem = malloc(ggml_nbytes(embeddings));
  2091. memset(zero_mem, 0, ggml_nbytes(embeddings));
  2092. ggml_backend_tensor_set(embeddings, zero_mem, 0, ggml_nbytes(embeddings));
  2093. free(zero_mem);
  2094. }
  2095. }
  2096. {
  2097. struct ggml_tensor * positions = ggml_graph_get_tensor(gf, "positions");
  2098. int* positions_data = (int*)malloc(ggml_nbytes(positions));
  2099. for (int i = 0; i < num_positions; i++) {
  2100. positions_data[i] = i;
  2101. }
  2102. ggml_backend_tensor_set(positions, positions_data, 0, ggml_nbytes(positions));
  2103. free(positions_data);
  2104. }
  2105. {
  2106. struct ggml_tensor * patches = ggml_graph_get_tensor(gf, "patches");
  2107. int* patches_data = (int*)malloc(ggml_nbytes(patches));
  2108. for (int i = 0; i < num_patches; i++) {
  2109. patches_data[i] = i + 1;
  2110. }
  2111. ggml_backend_tensor_set(patches, patches_data, 0, ggml_nbytes(patches));
  2112. free(patches_data);
  2113. }
  2114. }
  2115. if (ggml_backend_is_cpu(ctx->backend)) {
  2116. ggml_backend_cpu_set_n_threads(ctx->backend, n_threads);
  2117. }
  2118. #ifdef GGML_USE_METAL
  2119. if (ggml_backend_is_metal(ctx->backend)) {
  2120. ggml_backend_metal_set_n_cb(ctx->backend, n_threads);
  2121. }
  2122. #endif
  2123. ggml_backend_graph_compute(ctx->backend, gf);
  2124. // the last node is the embedding tensor
  2125. struct ggml_tensor * embeddings = gf->nodes[gf->n_nodes - 1];
  2126. // copy the embeddings to the location passed by the user
  2127. ggml_backend_tensor_get(embeddings, vec, 0, ggml_nbytes(embeddings));
  2128. return true;
  2129. }
  2130. bool clip_model_quantize(const char * fname_inp, const char * fname_out, const int itype) {
  2131. ggml_type type = GGML_TYPE_Q4_1;
  2132. assert(itype < GGML_TYPE_COUNT);
  2133. type = static_cast<ggml_type>(itype);
  2134. auto * ctx_clip = clip_model_load(fname_inp, 2);
  2135. const auto & ctx_src = ctx_clip->ctx_gguf;
  2136. const auto & ctx_data = ctx_clip->ctx_data;
  2137. auto * ctx_out = gguf_init_empty();
  2138. gguf_set_kv(ctx_out, ctx_src);
  2139. gguf_set_val_u32(ctx_out, "general.quantization_version", GGML_QNT_VERSION);
  2140. gguf_set_val_u32(ctx_out, "general.file_type", itype);
  2141. auto fout = std::ofstream(fname_out, std::ios::binary);
  2142. const int n_tensors = gguf_get_n_tensors(ctx_src);
  2143. for (int i = 0; i < n_tensors; ++i) {
  2144. const char * name = gguf_get_tensor_name(ctx_src, i);
  2145. struct ggml_tensor * cur = ggml_get_tensor(ctx_data, name);
  2146. gguf_add_tensor(ctx_out, cur);
  2147. }
  2148. const size_t meta_size = gguf_get_meta_size(ctx_out);
  2149. for (size_t i = 0; i < meta_size; ++i) {
  2150. fout.put(0);
  2151. }
  2152. // regexes of tensor names to be quantized
  2153. const std::vector<std::string> k_names = {
  2154. ".*weight",
  2155. };
  2156. std::vector<uint8_t> work(512);
  2157. std::vector<float> conv_buf(512);
  2158. size_t total_size_org = 0;
  2159. size_t total_size_new = 0;
  2160. for (int i = 0; i < n_tensors; ++i) {
  2161. const std::string name = gguf_get_tensor_name(ctx_src, i);
  2162. struct ggml_tensor * cur = ggml_get_tensor(ctx_data, name.c_str());
  2163. enum ggml_type new_type;
  2164. void * new_data;
  2165. size_t new_size;
  2166. bool quantize = false;
  2167. for (const auto & s : k_names) {
  2168. if (std::regex_match(name, std::regex(s))) {
  2169. quantize = true;
  2170. break;
  2171. }
  2172. }
  2173. // quantize only 2D tensors
  2174. quantize &= (ggml_n_dims(cur) == 2);
  2175. if (quantize) {
  2176. new_type = type;
  2177. if (new_type >= GGML_TYPE_Q2_K && name.find("embd") != std::string::npos) {
  2178. new_type = GGML_TYPE_Q8_0; // ggml_get_rows needs non K type
  2179. // LOG_TEE("%s: quantizing %s to %s\n", __func__, name.c_str(), ggml_type_name(new_type));
  2180. }
  2181. const size_t n_elms = ggml_nelements(cur);
  2182. float * f32_data;
  2183. switch (cur->type) {
  2184. case GGML_TYPE_F32:
  2185. f32_data = (float *)cur->data;
  2186. break;
  2187. case GGML_TYPE_F16:
  2188. if (conv_buf.size() < n_elms) {
  2189. conv_buf.resize(n_elms);
  2190. }
  2191. for (size_t j = 0; j < n_elms; ++j) {
  2192. conv_buf[j] = ggml_fp16_to_fp32(((ggml_fp16_t *)cur->data)[j]);
  2193. }
  2194. f32_data = (float *)conv_buf.data();
  2195. break;
  2196. default:
  2197. LOG_TEE("Please use an input file in f32 or f16\n");
  2198. gguf_free(ctx_out);
  2199. return false;
  2200. }
  2201. if (work.size() < n_elms * 4) {
  2202. work.resize(n_elms * 4);
  2203. }
  2204. new_data = work.data();
  2205. new_size = ggml_quantize_chunk(new_type, f32_data, new_data, 0, n_elms/cur->ne[0], cur->ne[0], nullptr);
  2206. } else {
  2207. new_type = cur->type;
  2208. new_data = cur->data;
  2209. new_size = ggml_nbytes(cur);
  2210. }
  2211. const size_t orig_size = ggml_nbytes(cur);
  2212. total_size_org += orig_size;
  2213. total_size_new += new_size;
  2214. gguf_set_tensor_type(ctx_out, name.c_str(), new_type);
  2215. gguf_set_tensor_data(ctx_out, name.c_str(), new_data, new_size);
  2216. fout.write((const char *)new_data, new_size);
  2217. size_t pad = GGML_PAD(new_size, gguf_get_alignment(ctx_out)) - new_size;
  2218. for (size_t j = 0; j < pad; ++j) {
  2219. fout.put(0);
  2220. }
  2221. LOG_TEE("%s: n_dims = %d | quantize=%d | size = %f MB -> %f MB\n", name.c_str(), ggml_n_dims(cur), quantize,
  2222. orig_size / 1024.0 / 1024.0, new_size / 1024.0 / 1024.0);
  2223. }
  2224. // go back to beginning of file and write the updated metadata
  2225. fout.seekp(0, std::ios::beg);
  2226. std::vector<uint8_t> meta(meta_size);
  2227. gguf_get_meta_data(ctx_out, meta.data());
  2228. fout.write((const char *)meta.data(), meta_size);
  2229. fout.close();
  2230. clip_free(ctx_clip);
  2231. gguf_free(ctx_out);
  2232. {
  2233. LOG_TEE("%s: original size = %8.2f MB\n", __func__, total_size_org / 1024.0 / 1024.0);
  2234. LOG_TEE("%s: quantized size = %8.2f MB\n", __func__, total_size_new / 1024.0 / 1024.0);
  2235. }
  2236. return true;
  2237. }
  2238. int clip_n_mmproj_embd(const struct clip_ctx * ctx) {
  2239. if (ctx->proj_type == PROJECTOR_TYPE_LDP) {
  2240. return ctx->vision_model.mm_model_block_1_block_2_1_b->ne[0];
  2241. }
  2242. if (ctx->proj_type == PROJECTOR_TYPE_LDPV2) {
  2243. return ctx->vision_model.mm_model_peg_0_b->ne[0];
  2244. }
  2245. if (ctx->proj_type == PROJECTOR_TYPE_MLP) {
  2246. return ctx->vision_model.mm_2_b->ne[0];
  2247. }
  2248. if (ctx->proj_type == PROJECTOR_TYPE_MLP_NORM) {
  2249. return ctx->vision_model.mm_3_b->ne[0];
  2250. }
  2251. if (ctx->proj_type == PROJECTOR_TYPE_RESAMPLER) {
  2252. if (ctx->minicpmv_version == 2) {
  2253. return 4096;
  2254. }
  2255. else if (ctx->minicpmv_version == 3) {
  2256. return 3584;
  2257. }
  2258. }
  2259. std::string proj_type = PROJECTOR_TYPE_NAMES[ctx->proj_type];
  2260. throw std::runtime_error(format("%s: don't support projector with: %s currently\n", __func__, proj_type.c_str()));
  2261. }
  2262. int clip_is_minicpmv(const struct clip_ctx * ctx) {
  2263. if (ctx->has_minicpmv_projector) {
  2264. return ctx->minicpmv_version;
  2265. }
  2266. return 0;
  2267. }