clip.cpp 118 KB

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