common.cpp 66 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933
  1. #if defined(_MSC_VER)
  2. #define _SILENCE_CXX17_CODECVT_HEADER_DEPRECATION_WARNING
  3. #endif
  4. #include "common.h"
  5. #include "log.h"
  6. // Change JSON_ASSERT from assert() to GGML_ASSERT:
  7. #define JSON_ASSERT GGML_ASSERT
  8. #include "json.hpp"
  9. #include "json-schema-to-grammar.h"
  10. #include "llama.h"
  11. #include <algorithm>
  12. #include <cinttypes>
  13. #include <climits>
  14. #include <cmath>
  15. #include <codecvt>
  16. #include <cstdarg>
  17. #include <cstring>
  18. #include <ctime>
  19. #include <fstream>
  20. #include <iostream>
  21. #include <iterator>
  22. #include <regex>
  23. #include <sstream>
  24. #include <string>
  25. #include <thread>
  26. #include <unordered_map>
  27. #include <unordered_set>
  28. #include <vector>
  29. #if defined(__APPLE__) && defined(__MACH__)
  30. #include <sys/types.h>
  31. #include <sys/sysctl.h>
  32. #endif
  33. #if defined(_WIN32)
  34. #define WIN32_LEAN_AND_MEAN
  35. #ifndef NOMINMAX
  36. # define NOMINMAX
  37. #endif
  38. #include <locale>
  39. #include <windows.h>
  40. #include <fcntl.h>
  41. #include <io.h>
  42. #else
  43. #include <sys/ioctl.h>
  44. #include <sys/stat.h>
  45. #include <unistd.h>
  46. #endif
  47. #if defined(LLAMA_USE_CURL)
  48. #include <curl/curl.h>
  49. #include <curl/easy.h>
  50. #include <future>
  51. #endif
  52. #if defined(_MSC_VER)
  53. #pragma warning(disable: 4244 4267) // possible loss of data
  54. #endif
  55. #if defined(LLAMA_USE_CURL)
  56. #ifdef __linux__
  57. #include <linux/limits.h>
  58. #elif defined(_WIN32)
  59. #define PATH_MAX MAX_PATH
  60. #else
  61. #include <sys/syslimits.h>
  62. #endif
  63. #define LLAMA_CURL_MAX_URL_LENGTH 2084 // Maximum URL Length in Chrome: 2083
  64. #endif // LLAMA_USE_CURL
  65. using json = nlohmann::ordered_json;
  66. //
  67. // CPU utils
  68. //
  69. int32_t cpu_get_num_physical_cores() {
  70. #ifdef __linux__
  71. // enumerate the set of thread siblings, num entries is num cores
  72. std::unordered_set<std::string> siblings;
  73. for (uint32_t cpu=0; cpu < UINT32_MAX; ++cpu) {
  74. std::ifstream thread_siblings("/sys/devices/system/cpu/cpu"
  75. + std::to_string(cpu) + "/topology/thread_siblings");
  76. if (!thread_siblings.is_open()) {
  77. break; // no more cpus
  78. }
  79. std::string line;
  80. if (std::getline(thread_siblings, line)) {
  81. siblings.insert(line);
  82. }
  83. }
  84. if (!siblings.empty()) {
  85. return static_cast<int32_t>(siblings.size());
  86. }
  87. #elif defined(__APPLE__) && defined(__MACH__)
  88. int32_t num_physical_cores;
  89. size_t len = sizeof(num_physical_cores);
  90. int result = sysctlbyname("hw.perflevel0.physicalcpu", &num_physical_cores, &len, NULL, 0);
  91. if (result == 0) {
  92. return num_physical_cores;
  93. }
  94. result = sysctlbyname("hw.physicalcpu", &num_physical_cores, &len, NULL, 0);
  95. if (result == 0) {
  96. return num_physical_cores;
  97. }
  98. #elif defined(_WIN32) && (_WIN32_WINNT >= 0x0601) && !defined(__MINGW64__) // windows 7 and later
  99. // TODO: windows + arm64 + mingw64
  100. unsigned int n_threads_win = std::thread::hardware_concurrency();
  101. unsigned int default_threads = n_threads_win > 0 ? (n_threads_win <= 4 ? n_threads_win : n_threads_win / 2) : 4;
  102. DWORD buffer_size = 0;
  103. if (!GetLogicalProcessorInformationEx(RelationProcessorCore, nullptr, &buffer_size)) {
  104. if (GetLastError() != ERROR_INSUFFICIENT_BUFFER) {
  105. return default_threads;
  106. }
  107. }
  108. std::vector<char> buffer(buffer_size);
  109. if (!GetLogicalProcessorInformationEx(RelationProcessorCore, reinterpret_cast<PSYSTEM_LOGICAL_PROCESSOR_INFORMATION_EX>(buffer.data()), &buffer_size)) {
  110. return default_threads;
  111. }
  112. int32_t num_physical_cores = 0;
  113. PSYSTEM_LOGICAL_PROCESSOR_INFORMATION_EX info = reinterpret_cast<PSYSTEM_LOGICAL_PROCESSOR_INFORMATION_EX>(buffer.data());
  114. while (buffer_size > 0) {
  115. if (info->Relationship == RelationProcessorCore) {
  116. num_physical_cores += info->Processor.GroupCount;
  117. }
  118. buffer_size -= info->Size;
  119. info = reinterpret_cast<PSYSTEM_LOGICAL_PROCESSOR_INFORMATION_EX>(reinterpret_cast<char*>(info) + info->Size);
  120. }
  121. return num_physical_cores > 0 ? num_physical_cores : default_threads;
  122. #endif
  123. unsigned int n_threads = std::thread::hardware_concurrency();
  124. return n_threads > 0 ? (n_threads <= 4 ? n_threads : n_threads / 2) : 4;
  125. }
  126. #if defined(__x86_64__) && defined(__linux__) && !defined(__ANDROID__)
  127. #include <pthread.h>
  128. static void cpuid(unsigned leaf, unsigned subleaf,
  129. unsigned *eax, unsigned *ebx, unsigned *ecx, unsigned *edx) {
  130. __asm__("movq\t%%rbx,%%rsi\n\t"
  131. "cpuid\n\t"
  132. "xchgq\t%%rbx,%%rsi"
  133. : "=a"(*eax), "=S"(*ebx), "=c"(*ecx), "=d"(*edx)
  134. : "0"(leaf), "2"(subleaf));
  135. }
  136. static int pin_cpu(int cpu) {
  137. cpu_set_t mask;
  138. CPU_ZERO(&mask);
  139. CPU_SET(cpu, &mask);
  140. return pthread_setaffinity_np(pthread_self(), sizeof(mask), &mask);
  141. }
  142. static bool is_hybrid_cpu(void) {
  143. unsigned eax, ebx, ecx, edx;
  144. cpuid(7, 0, &eax, &ebx, &ecx, &edx);
  145. return !!(edx & (1u << 15));
  146. }
  147. static bool is_running_on_efficiency_core(void) {
  148. unsigned eax, ebx, ecx, edx;
  149. cpuid(0x1a, 0, &eax, &ebx, &ecx, &edx);
  150. int intel_atom = 0x20;
  151. int core_type = (eax & 0xff000000u) >> 24;
  152. return core_type == intel_atom;
  153. }
  154. static int cpu_count_math_cpus(int n_cpu) {
  155. int result = 0;
  156. for (int cpu = 0; cpu < n_cpu; ++cpu) {
  157. if (pin_cpu(cpu)) {
  158. return -1;
  159. }
  160. if (is_running_on_efficiency_core()) {
  161. continue; // efficiency cores harm lockstep threading
  162. }
  163. ++cpu; // hyperthreading isn't useful for linear algebra
  164. ++result;
  165. }
  166. return result;
  167. }
  168. #endif // __x86_64__ && __linux__
  169. /**
  170. * Returns number of CPUs on system that are useful for math.
  171. */
  172. int32_t cpu_get_num_math() {
  173. #if defined(__x86_64__) && defined(__linux__) && !defined(__ANDROID__)
  174. int n_cpu = sysconf(_SC_NPROCESSORS_ONLN);
  175. if (n_cpu < 1) {
  176. return cpu_get_num_physical_cores();
  177. }
  178. if (is_hybrid_cpu()) {
  179. cpu_set_t affinity;
  180. if (!pthread_getaffinity_np(pthread_self(), sizeof(affinity), &affinity)) {
  181. int result = cpu_count_math_cpus(n_cpu);
  182. pthread_setaffinity_np(pthread_self(), sizeof(affinity), &affinity);
  183. if (result > 0) {
  184. return result;
  185. }
  186. }
  187. }
  188. #endif
  189. return cpu_get_num_physical_cores();
  190. }
  191. // Helper for setting process priority
  192. #if defined(_WIN32)
  193. bool set_process_priority(enum ggml_sched_priority prio) {
  194. if (prio == GGML_SCHED_PRIO_NORMAL) {
  195. return true;
  196. }
  197. DWORD p = NORMAL_PRIORITY_CLASS;
  198. switch (prio) {
  199. case GGML_SCHED_PRIO_NORMAL: p = NORMAL_PRIORITY_CLASS; break;
  200. case GGML_SCHED_PRIO_MEDIUM: p = ABOVE_NORMAL_PRIORITY_CLASS; break;
  201. case GGML_SCHED_PRIO_HIGH: p = HIGH_PRIORITY_CLASS; break;
  202. case GGML_SCHED_PRIO_REALTIME: p = REALTIME_PRIORITY_CLASS; break;
  203. }
  204. if (!SetPriorityClass(GetCurrentProcess(), p)) {
  205. LOG_WRN("failed to set process priority class %d : (%d)\n", prio, (int) GetLastError());
  206. return false;
  207. }
  208. return true;
  209. }
  210. #else // MacOS and POSIX
  211. #include <sys/types.h>
  212. #include <sys/resource.h>
  213. bool set_process_priority(enum ggml_sched_priority prio) {
  214. if (prio == GGML_SCHED_PRIO_NORMAL) {
  215. return true;
  216. }
  217. int p = 0;
  218. switch (prio) {
  219. case GGML_SCHED_PRIO_NORMAL: p = 0; break;
  220. case GGML_SCHED_PRIO_MEDIUM: p = -5; break;
  221. case GGML_SCHED_PRIO_HIGH: p = -10; break;
  222. case GGML_SCHED_PRIO_REALTIME: p = -20; break;
  223. }
  224. if (!setpriority(PRIO_PROCESS, 0, p)) {
  225. LOG_WRN("failed to set process priority %d : %s (%d)\n", prio, strerror(errno), errno);
  226. return false;
  227. }
  228. return true;
  229. }
  230. #endif
  231. //
  232. // CLI argument parsing
  233. //
  234. void postprocess_cpu_params(cpu_params& cpuparams, const cpu_params* role_model) {
  235. int32_t n_set = 0;
  236. if (cpuparams.n_threads < 0) {
  237. // Assuming everything about cpuparams is invalid
  238. if (role_model != nullptr) {
  239. cpuparams = *role_model;
  240. } else {
  241. cpuparams.n_threads = cpu_get_num_math();
  242. }
  243. }
  244. for (int32_t i = 0; i < GGML_MAX_N_THREADS; i++) {
  245. if (cpuparams.cpumask[i]) {
  246. n_set++;
  247. }
  248. }
  249. if (n_set && n_set < cpuparams.n_threads) {
  250. // Not enough set bits, may experience performance issues.
  251. LOG_WRN("Not enough set bits in CPU mask (%d) to satisfy requested thread count: %d\n", n_set, cpuparams.n_threads);
  252. }
  253. }
  254. bool parse_cpu_range(const std::string & range, bool (&boolmask)[GGML_MAX_N_THREADS]) {
  255. size_t dash_loc = range.find('-');
  256. if (dash_loc == std::string::npos) {
  257. LOG_ERR("Format of CPU range is invalid! Expected [<start>]-[<end>].\n");
  258. return false;
  259. }
  260. size_t start_i;
  261. size_t end_i;
  262. if (dash_loc == 0) {
  263. start_i = 0;
  264. } else {
  265. start_i = std::stoull(range.substr(0, dash_loc));
  266. if (start_i >= GGML_MAX_N_THREADS) {
  267. LOG_ERR("Start index out of bounds!\n");
  268. return false;
  269. }
  270. }
  271. if (dash_loc == range.length() - 1) {
  272. end_i = GGML_MAX_N_THREADS - 1;
  273. } else {
  274. end_i = std::stoull(range.substr(dash_loc + 1));
  275. if (end_i >= GGML_MAX_N_THREADS) {
  276. LOG_ERR("End index out of bounds!\n");
  277. return false;
  278. }
  279. }
  280. for (size_t i = start_i; i <= end_i; i++) {
  281. boolmask[i] = true;
  282. }
  283. return true;
  284. }
  285. bool parse_cpu_mask(const std::string & mask, bool (&boolmask)[GGML_MAX_N_THREADS]) {
  286. // Discard potential 0x prefix
  287. size_t start_i = 0;
  288. if (mask.length() >= 2 && mask.substr(0, 2) == "0x") {
  289. start_i = 2;
  290. }
  291. size_t num_digits = mask.length() - start_i;
  292. if (num_digits > 128) num_digits = 128;
  293. size_t end_i = num_digits + start_i;
  294. for (size_t i = start_i, n = (num_digits*4 - 1); i < end_i; i++, n-=4) {
  295. char c = mask.at(i);
  296. int8_t id = c;
  297. if ((c >= '0' && c <= '9')) {
  298. id -= '0';
  299. } else if (c >= 'a' && c <= 'f') {
  300. id -= 'a' - 10;
  301. } else if (c >= 'A' && c <= 'F') {
  302. id -= 'A' - 10;
  303. } else {
  304. LOG_ERR("Invalid hex character '%c' at position %d\n", c, int32_t(i));
  305. return false;
  306. }
  307. boolmask[ n ] = boolmask[ n ] || ((id & 8) != 0);
  308. boolmask[n - 1] = boolmask[n - 1] || ((id & 4) != 0);
  309. boolmask[n - 2] = boolmask[n - 2] || ((id & 2) != 0);
  310. boolmask[n - 3] = boolmask[n - 3] || ((id & 1) != 0);
  311. }
  312. return true;
  313. }
  314. void common_init() {
  315. llama_log_set([](ggml_log_level level, const char * text, void * /*user_data*/) {
  316. if (LOG_DEFAULT_LLAMA <= common_log_verbosity_thold) {
  317. common_log_add(common_log_main(), level, "%s", text);
  318. }
  319. }, NULL);
  320. #ifdef NDEBUG
  321. const char * build_type = "";
  322. #else
  323. const char * build_type = " (debug)";
  324. #endif
  325. LOG_INF("build: %d (%s) with %s for %s%s\n", LLAMA_BUILD_NUMBER, LLAMA_COMMIT, LLAMA_COMPILER, LLAMA_BUILD_TARGET, build_type);
  326. }
  327. std::string common_params_get_system_info(const common_params & params) {
  328. std::ostringstream os;
  329. os << "system_info: n_threads = " << params.cpuparams.n_threads;
  330. if (params.cpuparams_batch.n_threads != -1) {
  331. os << " (n_threads_batch = " << params.cpuparams_batch.n_threads << ")";
  332. }
  333. #if defined(_WIN32) && (_WIN32_WINNT >= 0x0601) && !defined(__MINGW64__) // windows 7 and later
  334. // TODO: windows + arm64 + mingw64
  335. DWORD logicalProcessorCount = GetActiveProcessorCount(ALL_PROCESSOR_GROUPS);
  336. os << " / " << logicalProcessorCount << " | " << llama_print_system_info();
  337. #else
  338. os << " / " << std::thread::hardware_concurrency() << " | " << llama_print_system_info();
  339. #endif
  340. return os.str();
  341. }
  342. //
  343. // String utils
  344. //
  345. std::string string_format(const char * fmt, ...) {
  346. va_list ap;
  347. va_list ap2;
  348. va_start(ap, fmt);
  349. va_copy(ap2, ap);
  350. int size = vsnprintf(NULL, 0, fmt, ap);
  351. GGML_ASSERT(size >= 0 && size < INT_MAX); // NOLINT
  352. std::vector<char> buf(size + 1);
  353. int size2 = vsnprintf(buf.data(), size + 1, fmt, ap2);
  354. GGML_ASSERT(size2 == size);
  355. va_end(ap2);
  356. va_end(ap);
  357. return std::string(buf.data(), size);
  358. }
  359. std::string string_strip(const std::string & str) {
  360. size_t start = 0;
  361. size_t end = str.size();
  362. while (start < end && std::isspace(str[start])) {
  363. start++;
  364. }
  365. while (end > start && std::isspace(str[end - 1])) {
  366. end--;
  367. }
  368. return str.substr(start, end - start);
  369. }
  370. std::string string_get_sortable_timestamp() {
  371. using clock = std::chrono::system_clock;
  372. const clock::time_point current_time = clock::now();
  373. const time_t as_time_t = clock::to_time_t(current_time);
  374. char timestamp_no_ns[100];
  375. std::strftime(timestamp_no_ns, 100, "%Y_%m_%d-%H_%M_%S", std::localtime(&as_time_t));
  376. const int64_t ns = std::chrono::duration_cast<std::chrono::nanoseconds>(
  377. current_time.time_since_epoch() % 1000000000).count();
  378. char timestamp_ns[11];
  379. snprintf(timestamp_ns, 11, "%09" PRId64, ns);
  380. return std::string(timestamp_no_ns) + "." + std::string(timestamp_ns);
  381. }
  382. void string_replace_all(std::string & s, const std::string & search, const std::string & replace) {
  383. if (search.empty()) {
  384. return;
  385. }
  386. std::string builder;
  387. builder.reserve(s.length());
  388. size_t pos = 0;
  389. size_t last_pos = 0;
  390. while ((pos = s.find(search, last_pos)) != std::string::npos) {
  391. builder.append(s, last_pos, pos - last_pos);
  392. builder.append(replace);
  393. last_pos = pos + search.length();
  394. }
  395. builder.append(s, last_pos, std::string::npos);
  396. s = std::move(builder);
  397. }
  398. std::string string_from(bool value) {
  399. return value ? "true" : "false";
  400. }
  401. std::string string_from(const std::vector<int> & values) {
  402. std::stringstream buf;
  403. buf << "[ ";
  404. bool first = true;
  405. for (auto e : values) {
  406. if (first) {
  407. first = false;
  408. } else {
  409. buf << ", ";
  410. }
  411. buf << std::to_string(e);
  412. }
  413. buf << " ]";
  414. return buf.str();
  415. }
  416. std::string string_from(const struct llama_context * ctx, const std::vector<llama_token> & tokens) {
  417. std::stringstream buf;
  418. buf << "[ ";
  419. bool first = true;
  420. for (const auto & token : tokens) {
  421. if (!first) {
  422. buf << ", ";
  423. } else {
  424. first = false;
  425. }
  426. auto detokenized = common_token_to_piece(ctx, token);
  427. detokenized.erase(
  428. std::remove_if(
  429. detokenized.begin(),
  430. detokenized.end(),
  431. [](const unsigned char c) { return !std::isprint(c); }),
  432. detokenized.end());
  433. buf << "'" << detokenized << "'"
  434. << ":" << std::to_string(token);
  435. }
  436. buf << " ]";
  437. return buf.str();
  438. }
  439. std::string string_from(const struct llama_context * ctx, const struct llama_batch & batch) {
  440. std::stringstream buf;
  441. buf << "[ ";
  442. bool first = true;
  443. for (int i = 0; i < batch.n_tokens; ++i) {
  444. if (!first) {
  445. buf << ", ";
  446. } else {
  447. first = false;
  448. }
  449. auto detokenized = common_token_to_piece(ctx, batch.token[i]);
  450. detokenized.erase(
  451. std::remove_if(
  452. detokenized.begin(),
  453. detokenized.end(),
  454. [](const unsigned char c) { return !std::isprint(c); }),
  455. detokenized.end());
  456. buf << "\n" << std::to_string(i)
  457. << ", token '" << detokenized << "'"
  458. << ", pos " << std::to_string(batch.pos[i])
  459. << ", n_seq_id " << std::to_string(batch.n_seq_id[i])
  460. << ", seq_id " << std::to_string(batch.seq_id[i][0])
  461. << ", logits " << std::to_string(batch.logits[i]);
  462. }
  463. buf << " ]";
  464. return buf.str();
  465. }
  466. void string_process_escapes(std::string & input) {
  467. std::size_t input_len = input.length();
  468. std::size_t output_idx = 0;
  469. for (std::size_t input_idx = 0; input_idx < input_len; ++input_idx) {
  470. if (input[input_idx] == '\\' && input_idx + 1 < input_len) {
  471. switch (input[++input_idx]) {
  472. case 'n': input[output_idx++] = '\n'; break;
  473. case 'r': input[output_idx++] = '\r'; break;
  474. case 't': input[output_idx++] = '\t'; break;
  475. case '\'': input[output_idx++] = '\''; break;
  476. case '\"': input[output_idx++] = '\"'; break;
  477. case '\\': input[output_idx++] = '\\'; break;
  478. case 'x':
  479. // Handle \x12, etc
  480. if (input_idx + 2 < input_len) {
  481. const char x[3] = { input[input_idx + 1], input[input_idx + 2], 0 };
  482. char *err_p = nullptr;
  483. const long val = std::strtol(x, &err_p, 16);
  484. if (err_p == x + 2) {
  485. input_idx += 2;
  486. input[output_idx++] = char(val);
  487. break;
  488. }
  489. }
  490. // fall through
  491. default: input[output_idx++] = '\\';
  492. input[output_idx++] = input[input_idx]; break;
  493. }
  494. } else {
  495. input[output_idx++] = input[input_idx];
  496. }
  497. }
  498. input.resize(output_idx);
  499. }
  500. bool string_parse_kv_override(const char * data, std::vector<llama_model_kv_override> & overrides) {
  501. const char * sep = strchr(data, '=');
  502. if (sep == nullptr || sep - data >= 128) {
  503. LOG_ERR("%s: malformed KV override '%s'\n", __func__, data);
  504. return false;
  505. }
  506. llama_model_kv_override kvo;
  507. std::strncpy(kvo.key, data, sep - data);
  508. kvo.key[sep - data] = 0;
  509. sep++;
  510. if (strncmp(sep, "int:", 4) == 0) {
  511. sep += 4;
  512. kvo.tag = LLAMA_KV_OVERRIDE_TYPE_INT;
  513. kvo.val_i64 = std::atol(sep);
  514. } else if (strncmp(sep, "float:", 6) == 0) {
  515. sep += 6;
  516. kvo.tag = LLAMA_KV_OVERRIDE_TYPE_FLOAT;
  517. kvo.val_f64 = std::atof(sep);
  518. } else if (strncmp(sep, "bool:", 5) == 0) {
  519. sep += 5;
  520. kvo.tag = LLAMA_KV_OVERRIDE_TYPE_BOOL;
  521. if (std::strcmp(sep, "true") == 0) {
  522. kvo.val_bool = true;
  523. } else if (std::strcmp(sep, "false") == 0) {
  524. kvo.val_bool = false;
  525. } else {
  526. LOG_ERR("%s: invalid boolean value for KV override '%s'\n", __func__, data);
  527. return false;
  528. }
  529. } else if (strncmp(sep, "str:", 4) == 0) {
  530. sep += 4;
  531. kvo.tag = LLAMA_KV_OVERRIDE_TYPE_STR;
  532. if (strlen(sep) > 127) {
  533. LOG_ERR("%s: malformed KV override '%s', value cannot exceed 127 chars\n", __func__, data);
  534. return false;
  535. }
  536. strncpy(kvo.val_str, sep, 127);
  537. kvo.val_str[127] = '\0';
  538. } else {
  539. LOG_ERR("%s: invalid type for KV override '%s'\n", __func__, data);
  540. return false;
  541. }
  542. overrides.emplace_back(std::move(kvo));
  543. return true;
  544. }
  545. //
  546. // Filesystem utils
  547. //
  548. // Validate if a filename is safe to use
  549. // To validate a full path, split the path by the OS-specific path separator, and validate each part with this function
  550. bool fs_validate_filename(const std::string & filename) {
  551. if (!filename.length()) {
  552. // Empty filename invalid
  553. return false;
  554. }
  555. if (filename.length() > 255) {
  556. // Limit at common largest possible filename on Linux filesystems
  557. // to avoid unnecessary further validation
  558. // (On systems with smaller limits it will be caught by the OS)
  559. return false;
  560. }
  561. std::u32string filename_utf32;
  562. try {
  563. #if defined(__clang__)
  564. // disable C++17 deprecation warning for std::codecvt_utf8
  565. # pragma clang diagnostic push
  566. # pragma clang diagnostic ignored "-Wdeprecated-declarations"
  567. #endif
  568. std::wstring_convert<std::codecvt_utf8<char32_t>, char32_t> converter;
  569. #if defined(__clang__)
  570. # pragma clang diagnostic pop
  571. #endif
  572. filename_utf32 = converter.from_bytes(filename);
  573. // If the reverse conversion mismatches, it means overlong UTF-8 sequences were used,
  574. // or invalid encodings were encountered. Reject such attempts
  575. std::string filename_reencoded = converter.to_bytes(filename_utf32);
  576. if (filename_reencoded != filename) {
  577. return false;
  578. }
  579. } catch (const std::exception &) {
  580. return false;
  581. }
  582. // Check for forbidden codepoints:
  583. // - Control characters
  584. // - Unicode equivalents of illegal characters
  585. // - UTF-16 surrogate pairs
  586. // - UTF-8 replacement character
  587. // - Byte order mark (BOM)
  588. // - Illegal characters: / \ : * ? " < > |
  589. for (char32_t c : filename_utf32) {
  590. if (c <= 0x1F // Control characters (C0)
  591. || c == 0x7F // Control characters (DEL)
  592. || (c >= 0x80 && c <= 0x9F) // Control characters (C1)
  593. || c == 0xFF0E // Fullwidth Full Stop (period equivalent)
  594. || c == 0x2215 // Division Slash (forward slash equivalent)
  595. || c == 0x2216 // Set Minus (backslash equivalent)
  596. || (c >= 0xD800 && c <= 0xDFFF) // UTF-16 surrogate pairs
  597. || c == 0xFFFD // Replacement Character (UTF-8)
  598. || c == 0xFEFF // Byte Order Mark (BOM)
  599. || c == '/' || c == '\\' || c == ':' || c == '*' // Illegal characters
  600. || c == '?' || c == '"' || c == '<' || c == '>' || c == '|') {
  601. return false;
  602. }
  603. }
  604. // Reject any leading or trailing ' ', or any trailing '.', these are stripped on Windows and will cause a different filename
  605. // Unicode and other whitespace is not affected, only 0x20 space
  606. if (filename.front() == ' ' || filename.back() == ' ' || filename.back() == '.') {
  607. return false;
  608. }
  609. // Reject any ".." (currently stricter than necessary, it should be fine to just check for == ".." instead)
  610. if (filename.find("..") != std::string::npos) {
  611. return false;
  612. }
  613. // Reject "."
  614. if (filename == ".") {
  615. return false;
  616. }
  617. return true;
  618. }
  619. // returns true if successful, false otherwise
  620. bool fs_create_directory_with_parents(const std::string & path) {
  621. #ifdef _WIN32
  622. std::wstring_convert<std::codecvt_utf8<wchar_t>> converter;
  623. std::wstring wpath = converter.from_bytes(path);
  624. // if the path already exists, check whether it's a directory
  625. const DWORD attributes = GetFileAttributesW(wpath.c_str());
  626. if ((attributes != INVALID_FILE_ATTRIBUTES) && (attributes & FILE_ATTRIBUTE_DIRECTORY)) {
  627. return true;
  628. }
  629. size_t pos_slash = 0;
  630. // process path from front to back, procedurally creating directories
  631. while ((pos_slash = path.find('\\', pos_slash)) != std::string::npos) {
  632. const std::wstring subpath = wpath.substr(0, pos_slash);
  633. const wchar_t * test = subpath.c_str();
  634. const bool success = CreateDirectoryW(test, NULL);
  635. if (!success) {
  636. const DWORD error = GetLastError();
  637. // if the path already exists, ensure that it's a directory
  638. if (error == ERROR_ALREADY_EXISTS) {
  639. const DWORD attributes = GetFileAttributesW(subpath.c_str());
  640. if (attributes == INVALID_FILE_ATTRIBUTES || !(attributes & FILE_ATTRIBUTE_DIRECTORY)) {
  641. return false;
  642. }
  643. } else {
  644. return false;
  645. }
  646. }
  647. pos_slash += 1;
  648. }
  649. return true;
  650. #else
  651. // if the path already exists, check whether it's a directory
  652. struct stat info;
  653. if (stat(path.c_str(), &info) == 0) {
  654. return S_ISDIR(info.st_mode);
  655. }
  656. size_t pos_slash = 1; // skip leading slashes for directory creation
  657. // process path from front to back, procedurally creating directories
  658. while ((pos_slash = path.find('/', pos_slash)) != std::string::npos) {
  659. const std::string subpath = path.substr(0, pos_slash);
  660. struct stat info;
  661. // if the path already exists, ensure that it's a directory
  662. if (stat(subpath.c_str(), &info) == 0) {
  663. if (!S_ISDIR(info.st_mode)) {
  664. return false;
  665. }
  666. } else {
  667. // create parent directories
  668. const int ret = mkdir(subpath.c_str(), 0755);
  669. if (ret != 0) {
  670. return false;
  671. }
  672. }
  673. pos_slash += 1;
  674. }
  675. return true;
  676. #endif // _WIN32
  677. }
  678. std::string fs_get_cache_directory() {
  679. std::string cache_directory = "";
  680. auto ensure_trailing_slash = [](std::string p) {
  681. // Make sure to add trailing slash
  682. if (p.back() != DIRECTORY_SEPARATOR) {
  683. p += DIRECTORY_SEPARATOR;
  684. }
  685. return p;
  686. };
  687. if (getenv("LLAMA_CACHE")) {
  688. cache_directory = std::getenv("LLAMA_CACHE");
  689. } else {
  690. #ifdef __linux__
  691. if (std::getenv("XDG_CACHE_HOME")) {
  692. cache_directory = std::getenv("XDG_CACHE_HOME");
  693. } else {
  694. cache_directory = std::getenv("HOME") + std::string("/.cache/");
  695. }
  696. #elif defined(__APPLE__)
  697. cache_directory = std::getenv("HOME") + std::string("/Library/Caches/");
  698. #elif defined(_WIN32)
  699. cache_directory = std::getenv("LOCALAPPDATA");
  700. #endif // __linux__
  701. cache_directory = ensure_trailing_slash(cache_directory);
  702. cache_directory += "llama.cpp";
  703. }
  704. return ensure_trailing_slash(cache_directory);
  705. }
  706. std::string fs_get_cache_file(const std::string & filename) {
  707. GGML_ASSERT(filename.find(DIRECTORY_SEPARATOR) == std::string::npos);
  708. std::string cache_directory = fs_get_cache_directory();
  709. const bool success = fs_create_directory_with_parents(cache_directory);
  710. if (!success) {
  711. throw std::runtime_error("failed to create cache directory: " + cache_directory);
  712. }
  713. return cache_directory + filename;
  714. }
  715. //
  716. // Model utils
  717. //
  718. struct common_init_result common_init_from_params(common_params & params) {
  719. common_init_result iparams;
  720. auto mparams = common_model_params_to_llama(params);
  721. llama_model * model = nullptr;
  722. if (!params.hf_repo.empty() && !params.hf_file.empty()) {
  723. model = common_load_model_from_hf(params.hf_repo, params.hf_file, params.model, params.hf_token, mparams);
  724. } else if (!params.model_url.empty()) {
  725. model = common_load_model_from_url(params.model_url, params.model, params.hf_token, mparams);
  726. } else {
  727. model = llama_load_model_from_file(params.model.c_str(), mparams);
  728. }
  729. if (model == NULL) {
  730. LOG_ERR("%s: failed to load model '%s'\n", __func__, params.model.c_str());
  731. return iparams;
  732. }
  733. if (params.reranking) {
  734. bool ok = true;
  735. if (llama_token_bos(model) == LLAMA_TOKEN_NULL) {
  736. LOG_WRN("%s: warning: model does not have a BOS token, reranking will not work\n", __func__);
  737. ok = false;
  738. }
  739. if (llama_token_eos(model) == LLAMA_TOKEN_NULL) {
  740. LOG_WRN("%s: warning: model does not have an EOS token, reranking will not work\n", __func__);
  741. ok = false;
  742. }
  743. if (llama_token_sep(model) == LLAMA_TOKEN_NULL) {
  744. LOG_WRN("%s: warning: model does not have a SEP token, reranking will not work\n", __func__);
  745. ok = false;
  746. }
  747. if (!ok) {
  748. llama_free_model(model);
  749. return iparams;
  750. }
  751. }
  752. auto cparams = common_context_params_to_llama(params);
  753. llama_context * lctx = llama_new_context_with_model(model, cparams);
  754. if (lctx == NULL) {
  755. LOG_ERR("%s: failed to create context with model '%s'\n", __func__, params.model.c_str());
  756. llama_free_model(model);
  757. return iparams;
  758. }
  759. if (params.ctx_shift && !llama_kv_cache_can_shift(lctx)) {
  760. LOG_ERR("%s: KV cache shifting is not supported for this model (--no-context-shift to disable)'\n", __func__);
  761. llama_free_model(model);
  762. return iparams;
  763. }
  764. if (!params.control_vectors.empty()) {
  765. if (params.control_vector_layer_start <= 0) params.control_vector_layer_start = 1;
  766. if (params.control_vector_layer_end <= 0) params.control_vector_layer_end = llama_n_layer(model);
  767. const auto cvec = common_control_vector_load(params.control_vectors);
  768. if (cvec.n_embd == -1) {
  769. llama_free(lctx);
  770. llama_free_model(model);
  771. return iparams;
  772. }
  773. int err = llama_control_vector_apply(lctx,
  774. cvec.data.data(),
  775. cvec.data.size(),
  776. cvec.n_embd,
  777. params.control_vector_layer_start,
  778. params.control_vector_layer_end);
  779. if (err) {
  780. llama_free(lctx);
  781. llama_free_model(model);
  782. return iparams;
  783. }
  784. }
  785. // load and optionally apply lora adapters
  786. for (auto & la : params.lora_adapters) {
  787. common_lora_adapter_container loaded_la;
  788. loaded_la.path = la.path;
  789. loaded_la.scale = la.scale;
  790. loaded_la.adapter = llama_lora_adapter_init(model, la.path.c_str());
  791. if (loaded_la.adapter == nullptr) {
  792. LOG_ERR("%s: failed to apply lora adapter '%s'\n", __func__, la.path.c_str());
  793. llama_free(lctx);
  794. llama_free_model(model);
  795. return iparams;
  796. }
  797. iparams.lora_adapters.push_back(loaded_la); // copy to list of loaded adapters
  798. }
  799. if (!params.lora_init_without_apply) {
  800. common_lora_adapters_apply(lctx, iparams.lora_adapters);
  801. }
  802. if (params.sampling.ignore_eos && llama_token_eos(model) == LLAMA_TOKEN_NULL) {
  803. LOG_WRN("%s: warning: model does not have an EOS token, ignoring --ignore-eos\n", __func__);
  804. params.sampling.ignore_eos = false;
  805. }
  806. if (params.warmup) {
  807. LOG_WRN("%s: warming up the model with an empty run - please wait ... (--no-warmup to disable)\n", __func__);
  808. std::vector<llama_token> tmp;
  809. llama_token bos = llama_token_bos(model);
  810. llama_token eos = llama_token_eos(model);
  811. // some models (e.g. T5) don't have a BOS token
  812. if (bos != LLAMA_TOKEN_NULL) {
  813. tmp.push_back(bos);
  814. }
  815. if (eos != LLAMA_TOKEN_NULL) {
  816. tmp.push_back(eos);
  817. }
  818. if (tmp.empty()) {
  819. tmp.push_back(0);
  820. }
  821. if (llama_model_has_encoder(model)) {
  822. llama_encode(lctx, llama_batch_get_one(tmp.data(), tmp.size()));
  823. llama_token decoder_start_token_id = llama_model_decoder_start_token(model);
  824. if (decoder_start_token_id == -1) {
  825. decoder_start_token_id = bos;
  826. }
  827. tmp.clear();
  828. tmp.push_back(decoder_start_token_id);
  829. }
  830. if (llama_model_has_decoder(model)) {
  831. llama_decode(lctx, llama_batch_get_one(tmp.data(), std::min(tmp.size(), (size_t) params.n_batch)));
  832. }
  833. llama_kv_cache_clear(lctx);
  834. llama_synchronize(lctx);
  835. llama_perf_context_reset(lctx);
  836. }
  837. iparams.model = model;
  838. iparams.context = lctx;
  839. return iparams;
  840. }
  841. void common_lora_adapters_apply(struct llama_context * ctx, std::vector<common_lora_adapter_container> & lora_adapters) {
  842. llama_lora_adapter_clear(ctx);
  843. for (auto & la : lora_adapters) {
  844. if (la.scale != 0.0f) {
  845. llama_lora_adapter_set(ctx, la.adapter, la.scale);
  846. }
  847. }
  848. }
  849. struct llama_model_params common_model_params_to_llama(common_params & params) {
  850. auto mparams = llama_model_default_params();
  851. if (!params.devices.empty()) {
  852. mparams.devices = params.devices.data();
  853. }
  854. if (params.n_gpu_layers != -1) {
  855. mparams.n_gpu_layers = params.n_gpu_layers;
  856. }
  857. mparams.rpc_servers = params.rpc_servers.c_str();
  858. mparams.main_gpu = params.main_gpu;
  859. mparams.split_mode = params.split_mode;
  860. mparams.tensor_split = params.tensor_split;
  861. mparams.use_mmap = params.use_mmap;
  862. mparams.use_mlock = params.use_mlock;
  863. mparams.check_tensors = params.check_tensors;
  864. if (params.kv_overrides.empty()) {
  865. mparams.kv_overrides = NULL;
  866. } else {
  867. GGML_ASSERT(params.kv_overrides.back().key[0] == 0 && "KV overrides not terminated with empty key");
  868. mparams.kv_overrides = params.kv_overrides.data();
  869. }
  870. return mparams;
  871. }
  872. struct llama_context_params common_context_params_to_llama(const common_params & params) {
  873. auto cparams = llama_context_default_params();
  874. cparams.n_ctx = params.n_ctx;
  875. cparams.n_seq_max = params.n_parallel;
  876. cparams.n_batch = params.n_batch;
  877. cparams.n_ubatch = params.n_ubatch;
  878. cparams.n_threads = params.cpuparams.n_threads;
  879. cparams.n_threads_batch = params.cpuparams_batch.n_threads == -1 ?
  880. params.cpuparams.n_threads : params.cpuparams_batch.n_threads;
  881. cparams.logits_all = params.logits_all;
  882. cparams.embeddings = params.embedding;
  883. cparams.rope_scaling_type = params.rope_scaling_type;
  884. cparams.rope_freq_base = params.rope_freq_base;
  885. cparams.rope_freq_scale = params.rope_freq_scale;
  886. cparams.yarn_ext_factor = params.yarn_ext_factor;
  887. cparams.yarn_attn_factor = params.yarn_attn_factor;
  888. cparams.yarn_beta_fast = params.yarn_beta_fast;
  889. cparams.yarn_beta_slow = params.yarn_beta_slow;
  890. cparams.yarn_orig_ctx = params.yarn_orig_ctx;
  891. cparams.pooling_type = params.pooling_type;
  892. cparams.attention_type = params.attention_type;
  893. cparams.defrag_thold = params.defrag_thold;
  894. cparams.cb_eval = params.cb_eval;
  895. cparams.cb_eval_user_data = params.cb_eval_user_data;
  896. cparams.offload_kqv = !params.no_kv_offload;
  897. cparams.flash_attn = params.flash_attn;
  898. cparams.no_perf = params.no_perf;
  899. if (params.reranking) {
  900. cparams.embeddings = true;
  901. cparams.pooling_type = LLAMA_POOLING_TYPE_RANK;
  902. }
  903. cparams.type_k = params.cache_type_k;
  904. cparams.type_v = params.cache_type_v;
  905. return cparams;
  906. }
  907. struct ggml_threadpool_params ggml_threadpool_params_from_cpu_params(const cpu_params & params) {
  908. struct ggml_threadpool_params tpp;
  909. ggml_threadpool_params_init(&tpp, params.n_threads); // setup the defaults
  910. if (params.mask_valid) {
  911. std::memcpy(&tpp.cpumask, &params.cpumask, GGML_MAX_N_THREADS);
  912. }
  913. tpp.prio = params.priority;
  914. tpp.poll = params.poll;
  915. tpp.strict_cpu = params.strict_cpu;
  916. return tpp;
  917. }
  918. #ifdef LLAMA_USE_CURL
  919. #define CURL_MAX_RETRY 3
  920. #define CURL_RETRY_DELAY_SECONDS 2
  921. static bool curl_perform_with_retry(const std::string& url, CURL* curl, int max_attempts, int retry_delay_seconds) {
  922. int remaining_attempts = max_attempts;
  923. while (remaining_attempts > 0) {
  924. LOG_INF("%s: Trying to download from %s (attempt %d of %d)...\n", __func__ , url.c_str(), max_attempts - remaining_attempts + 1, max_attempts);
  925. CURLcode res = curl_easy_perform(curl);
  926. if (res == CURLE_OK) {
  927. return true;
  928. }
  929. int exponential_backoff_delay = std::pow(retry_delay_seconds, max_attempts - remaining_attempts) * 1000;
  930. LOG_WRN("%s: curl_easy_perform() failed: %s, retrying after %d milliseconds...\n", __func__, curl_easy_strerror(res), exponential_backoff_delay);
  931. remaining_attempts--;
  932. std::this_thread::sleep_for(std::chrono::milliseconds(exponential_backoff_delay));
  933. }
  934. LOG_ERR("%s: curl_easy_perform() failed after %d attempts\n", __func__, max_attempts);
  935. return false;
  936. }
  937. static bool common_download_file(const std::string & url, const std::string & path, const std::string & hf_token) {
  938. // Initialize libcurl
  939. std::unique_ptr<CURL, decltype(&curl_easy_cleanup)> curl(curl_easy_init(), &curl_easy_cleanup);
  940. if (!curl) {
  941. LOG_ERR("%s: error initializing libcurl\n", __func__);
  942. return false;
  943. }
  944. bool force_download = false;
  945. // Set the URL, allow to follow http redirection
  946. curl_easy_setopt(curl.get(), CURLOPT_URL, url.c_str());
  947. curl_easy_setopt(curl.get(), CURLOPT_FOLLOWLOCATION, 1L);
  948. // Check if hf-token or bearer-token was specified
  949. if (!hf_token.empty()) {
  950. std::string auth_header = "Authorization: Bearer ";
  951. auth_header += hf_token.c_str();
  952. struct curl_slist *http_headers = NULL;
  953. http_headers = curl_slist_append(http_headers, auth_header.c_str());
  954. curl_easy_setopt(curl.get(), CURLOPT_HTTPHEADER, http_headers);
  955. }
  956. #if defined(_WIN32)
  957. // CURLSSLOPT_NATIVE_CA tells libcurl to use standard certificate store of
  958. // operating system. Currently implemented under MS-Windows.
  959. curl_easy_setopt(curl.get(), CURLOPT_SSL_OPTIONS, CURLSSLOPT_NATIVE_CA);
  960. #endif
  961. // Check if the file already exists locally
  962. struct stat model_file_info;
  963. auto file_exists = (stat(path.c_str(), &model_file_info) == 0);
  964. // If the file exists, check its JSON metadata companion file.
  965. std::string metadata_path = path + ".json";
  966. nlohmann::json metadata;
  967. std::string etag;
  968. std::string last_modified;
  969. if (file_exists) {
  970. // Try and read the JSON metadata file (note: stream autoclosed upon exiting this block).
  971. std::ifstream metadata_in(metadata_path);
  972. if (metadata_in.good()) {
  973. try {
  974. metadata_in >> metadata;
  975. LOG_INF("%s: previous metadata file found %s: %s\n", __func__, metadata_path.c_str(), metadata.dump().c_str());
  976. if (metadata.contains("url") && metadata.at("url").is_string()) {
  977. auto previous_url = metadata.at("url").get<std::string>();
  978. if (previous_url != url) {
  979. LOG_ERR("%s: Model URL mismatch: %s != %s\n", __func__, url.c_str(), previous_url.c_str());
  980. return false;
  981. }
  982. }
  983. if (metadata.contains("etag") && metadata.at("etag").is_string()) {
  984. etag = metadata.at("etag");
  985. }
  986. if (metadata.contains("lastModified") && metadata.at("lastModified").is_string()) {
  987. last_modified = metadata.at("lastModified");
  988. }
  989. } catch (const nlohmann::json::exception & e) {
  990. LOG_ERR("%s: error reading metadata file %s: %s\n", __func__, metadata_path.c_str(), e.what());
  991. return false;
  992. }
  993. }
  994. } else {
  995. LOG_INF("%s: no previous model file found %s\n", __func__, path.c_str());
  996. }
  997. // Send a HEAD request to retrieve the etag and last-modified headers
  998. struct common_load_model_from_url_headers {
  999. std::string etag;
  1000. std::string last_modified;
  1001. };
  1002. common_load_model_from_url_headers headers;
  1003. {
  1004. typedef size_t(*CURLOPT_HEADERFUNCTION_PTR)(char *, size_t, size_t, void *);
  1005. auto header_callback = [](char * buffer, size_t /*size*/, size_t n_items, void * userdata) -> size_t {
  1006. common_load_model_from_url_headers *headers = (common_load_model_from_url_headers *) userdata;
  1007. static std::regex header_regex("([^:]+): (.*)\r\n");
  1008. static std::regex etag_regex("ETag", std::regex_constants::icase);
  1009. static std::regex last_modified_regex("Last-Modified", std::regex_constants::icase);
  1010. std::string header(buffer, n_items);
  1011. std::smatch match;
  1012. if (std::regex_match(header, match, header_regex)) {
  1013. const std::string & key = match[1];
  1014. const std::string & value = match[2];
  1015. if (std::regex_match(key, match, etag_regex)) {
  1016. headers->etag = value;
  1017. } else if (std::regex_match(key, match, last_modified_regex)) {
  1018. headers->last_modified = value;
  1019. }
  1020. }
  1021. return n_items;
  1022. };
  1023. curl_easy_setopt(curl.get(), CURLOPT_NOBODY, 1L); // will trigger the HEAD verb
  1024. curl_easy_setopt(curl.get(), CURLOPT_NOPROGRESS, 1L); // hide head request progress
  1025. curl_easy_setopt(curl.get(), CURLOPT_HEADERFUNCTION, static_cast<CURLOPT_HEADERFUNCTION_PTR>(header_callback));
  1026. curl_easy_setopt(curl.get(), CURLOPT_HEADERDATA, &headers);
  1027. bool was_perform_successful = curl_perform_with_retry(url, curl.get(), CURL_MAX_RETRY, CURL_RETRY_DELAY_SECONDS);
  1028. if (!was_perform_successful) {
  1029. return false;
  1030. }
  1031. long http_code = 0;
  1032. curl_easy_getinfo(curl.get(), CURLINFO_RESPONSE_CODE, &http_code);
  1033. if (http_code != 200) {
  1034. // HEAD not supported, we don't know if the file has changed
  1035. // force trigger downloading
  1036. force_download = true;
  1037. LOG_ERR("%s: HEAD invalid http status code received: %ld\n", __func__, http_code);
  1038. }
  1039. }
  1040. bool should_download = !file_exists || force_download;
  1041. if (!should_download) {
  1042. if (!etag.empty() && etag != headers.etag) {
  1043. LOG_WRN("%s: ETag header is different (%s != %s): triggering a new download\n", __func__, etag.c_str(), headers.etag.c_str());
  1044. should_download = true;
  1045. } else if (!last_modified.empty() && last_modified != headers.last_modified) {
  1046. LOG_WRN("%s: Last-Modified header is different (%s != %s): triggering a new download\n", __func__, last_modified.c_str(), headers.last_modified.c_str());
  1047. should_download = true;
  1048. }
  1049. }
  1050. if (should_download) {
  1051. std::string path_temporary = path + ".downloadInProgress";
  1052. if (file_exists) {
  1053. LOG_WRN("%s: deleting previous downloaded file: %s\n", __func__, path.c_str());
  1054. if (remove(path.c_str()) != 0) {
  1055. LOG_ERR("%s: unable to delete file: %s\n", __func__, path.c_str());
  1056. return false;
  1057. }
  1058. }
  1059. // Set the output file
  1060. struct FILE_deleter {
  1061. void operator()(FILE * f) const {
  1062. fclose(f);
  1063. }
  1064. };
  1065. std::unique_ptr<FILE, FILE_deleter> outfile(fopen(path_temporary.c_str(), "wb"));
  1066. if (!outfile) {
  1067. LOG_ERR("%s: error opening local file for writing: %s\n", __func__, path.c_str());
  1068. return false;
  1069. }
  1070. typedef size_t(*CURLOPT_WRITEFUNCTION_PTR)(void * data, size_t size, size_t nmemb, void * fd);
  1071. auto write_callback = [](void * data, size_t size, size_t nmemb, void * fd) -> size_t {
  1072. return fwrite(data, size, nmemb, (FILE *)fd);
  1073. };
  1074. curl_easy_setopt(curl.get(), CURLOPT_NOBODY, 0L);
  1075. curl_easy_setopt(curl.get(), CURLOPT_WRITEFUNCTION, static_cast<CURLOPT_WRITEFUNCTION_PTR>(write_callback));
  1076. curl_easy_setopt(curl.get(), CURLOPT_WRITEDATA, outfile.get());
  1077. // display download progress
  1078. curl_easy_setopt(curl.get(), CURLOPT_NOPROGRESS, 0L);
  1079. // helper function to hide password in URL
  1080. auto llama_download_hide_password_in_url = [](const std::string & url) -> std::string {
  1081. std::size_t protocol_pos = url.find("://");
  1082. if (protocol_pos == std::string::npos) {
  1083. return url; // Malformed URL
  1084. }
  1085. std::size_t at_pos = url.find('@', protocol_pos + 3);
  1086. if (at_pos == std::string::npos) {
  1087. return url; // No password in URL
  1088. }
  1089. return url.substr(0, protocol_pos + 3) + "********" + url.substr(at_pos);
  1090. };
  1091. // start the download
  1092. LOG_INF("%s: trying to download model from %s to %s (server_etag:%s, server_last_modified:%s)...\n", __func__,
  1093. llama_download_hide_password_in_url(url).c_str(), path.c_str(), headers.etag.c_str(), headers.last_modified.c_str());
  1094. bool was_perform_successful = curl_perform_with_retry(url, curl.get(), CURL_MAX_RETRY, CURL_RETRY_DELAY_SECONDS);
  1095. if (!was_perform_successful) {
  1096. return false;
  1097. }
  1098. long http_code = 0;
  1099. curl_easy_getinfo (curl.get(), CURLINFO_RESPONSE_CODE, &http_code);
  1100. if (http_code < 200 || http_code >= 400) {
  1101. LOG_ERR("%s: invalid http status code received: %ld\n", __func__, http_code);
  1102. return false;
  1103. }
  1104. // Causes file to be closed explicitly here before we rename it.
  1105. outfile.reset();
  1106. // Write the updated JSON metadata file.
  1107. metadata.update({
  1108. {"url", url},
  1109. {"etag", headers.etag},
  1110. {"lastModified", headers.last_modified}
  1111. });
  1112. std::ofstream(metadata_path) << metadata.dump(4);
  1113. LOG_INF("%s: file metadata saved: %s\n", __func__, metadata_path.c_str());
  1114. if (rename(path_temporary.c_str(), path.c_str()) != 0) {
  1115. LOG_ERR("%s: unable to rename file: %s to %s\n", __func__, path_temporary.c_str(), path.c_str());
  1116. return false;
  1117. }
  1118. }
  1119. return true;
  1120. }
  1121. struct llama_model * common_load_model_from_url(
  1122. const std::string & model_url,
  1123. const std::string & local_path,
  1124. const std::string & hf_token,
  1125. const struct llama_model_params & params) {
  1126. // Basic validation of the model_url
  1127. if (model_url.empty()) {
  1128. LOG_ERR("%s: invalid model_url\n", __func__);
  1129. return NULL;
  1130. }
  1131. if (!common_download_file(model_url, local_path, hf_token)) {
  1132. return NULL;
  1133. }
  1134. // check for additional GGUFs split to download
  1135. int n_split = 0;
  1136. {
  1137. struct gguf_init_params gguf_params = {
  1138. /*.no_alloc = */ true,
  1139. /*.ctx = */ NULL,
  1140. };
  1141. auto * ctx_gguf = gguf_init_from_file(local_path.c_str(), gguf_params);
  1142. if (!ctx_gguf) {
  1143. LOG_ERR("\n%s: failed to load input GGUF from %s\n", __func__, local_path.c_str());
  1144. return NULL;
  1145. }
  1146. auto key_n_split = gguf_find_key(ctx_gguf, LLM_KV_SPLIT_COUNT);
  1147. if (key_n_split >= 0) {
  1148. n_split = gguf_get_val_u16(ctx_gguf, key_n_split);
  1149. }
  1150. gguf_free(ctx_gguf);
  1151. }
  1152. if (n_split > 1) {
  1153. char split_prefix[PATH_MAX] = {0};
  1154. char split_url_prefix[LLAMA_CURL_MAX_URL_LENGTH] = {0};
  1155. // Verify the first split file format
  1156. // and extract split URL and PATH prefixes
  1157. {
  1158. if (!llama_split_prefix(split_prefix, sizeof(split_prefix), local_path.c_str(), 0, n_split)) {
  1159. LOG_ERR("\n%s: unexpected model file name: %s n_split=%d\n", __func__, local_path.c_str(), n_split);
  1160. return NULL;
  1161. }
  1162. if (!llama_split_prefix(split_url_prefix, sizeof(split_url_prefix), model_url.c_str(), 0, n_split)) {
  1163. LOG_ERR("\n%s: unexpected model url: %s n_split=%d\n", __func__, model_url.c_str(), n_split);
  1164. return NULL;
  1165. }
  1166. }
  1167. // Prepare download in parallel
  1168. std::vector<std::future<bool>> futures_download;
  1169. for (int idx = 1; idx < n_split; idx++) {
  1170. futures_download.push_back(std::async(std::launch::async, [&split_prefix, &split_url_prefix, &n_split, hf_token](int download_idx) -> bool {
  1171. char split_path[PATH_MAX] = {0};
  1172. llama_split_path(split_path, sizeof(split_path), split_prefix, download_idx, n_split);
  1173. char split_url[LLAMA_CURL_MAX_URL_LENGTH] = {0};
  1174. llama_split_path(split_url, sizeof(split_url), split_url_prefix, download_idx, n_split);
  1175. return common_download_file(split_url, split_path, hf_token);
  1176. }, idx));
  1177. }
  1178. // Wait for all downloads to complete
  1179. for (auto & f : futures_download) {
  1180. if (!f.get()) {
  1181. return NULL;
  1182. }
  1183. }
  1184. }
  1185. return llama_load_model_from_file(local_path.c_str(), params);
  1186. }
  1187. struct llama_model * common_load_model_from_hf(
  1188. const std::string & repo,
  1189. const std::string & remote_path,
  1190. const std::string & local_path,
  1191. const std::string & hf_token,
  1192. const struct llama_model_params & params) {
  1193. // construct hugging face model url:
  1194. //
  1195. // --repo ggml-org/models --file tinyllama-1.1b/ggml-model-f16.gguf
  1196. // https://huggingface.co/ggml-org/models/resolve/main/tinyllama-1.1b/ggml-model-f16.gguf
  1197. //
  1198. // --repo TheBloke/Mixtral-8x7B-v0.1-GGUF --file mixtral-8x7b-v0.1.Q4_K_M.gguf
  1199. // https://huggingface.co/TheBloke/Mixtral-8x7B-v0.1-GGUF/resolve/main/mixtral-8x7b-v0.1.Q4_K_M.gguf
  1200. //
  1201. std::string model_url = "https://huggingface.co/";
  1202. model_url += repo;
  1203. model_url += "/resolve/main/";
  1204. model_url += remote_path;
  1205. return common_load_model_from_url(model_url, local_path, hf_token, params);
  1206. }
  1207. #else
  1208. struct llama_model * common_load_model_from_url(
  1209. const std::string & /*model_url*/,
  1210. const std::string & /*local_path*/,
  1211. const std::string & /*hf_token*/,
  1212. const struct llama_model_params & /*params*/) {
  1213. LOG_WRN("%s: llama.cpp built without libcurl, downloading from an url not supported.\n", __func__);
  1214. return nullptr;
  1215. }
  1216. struct llama_model * common_load_model_from_hf(
  1217. const std::string & /*repo*/,
  1218. const std::string & /*remote_path*/,
  1219. const std::string & /*local_path*/,
  1220. const std::string & /*hf_token*/,
  1221. const struct llama_model_params & /*params*/) {
  1222. LOG_WRN("%s: llama.cpp built without libcurl, downloading from Hugging Face not supported.\n", __func__);
  1223. return nullptr;
  1224. }
  1225. #endif // LLAMA_USE_CURL
  1226. //
  1227. // Batch utils
  1228. //
  1229. void common_batch_clear(struct llama_batch & batch) {
  1230. batch.n_tokens = 0;
  1231. }
  1232. void common_batch_add(
  1233. struct llama_batch & batch,
  1234. llama_token id,
  1235. llama_pos pos,
  1236. const std::vector<llama_seq_id> & seq_ids,
  1237. bool logits) {
  1238. GGML_ASSERT(batch.seq_id[batch.n_tokens] && "llama_batch size exceeded");
  1239. batch.token [batch.n_tokens] = id;
  1240. batch.pos [batch.n_tokens] = pos;
  1241. batch.n_seq_id[batch.n_tokens] = seq_ids.size();
  1242. for (size_t i = 0; i < seq_ids.size(); ++i) {
  1243. batch.seq_id[batch.n_tokens][i] = seq_ids[i];
  1244. }
  1245. batch.logits [batch.n_tokens] = logits;
  1246. batch.n_tokens++;
  1247. }
  1248. //
  1249. // Token utils
  1250. //
  1251. size_t common_lcp(const llama_tokens & a, const llama_tokens & b) {
  1252. size_t i;
  1253. for (i = 0; i < a.size() && i < b.size() && a[i] == b[i]; i++) {}
  1254. return i;
  1255. }
  1256. size_t common_lcs(const llama_tokens & a, const llama_tokens & b) {
  1257. // check for empty sequences
  1258. if (a.empty() || b.empty()) {
  1259. return 0;
  1260. }
  1261. // get the lengths of the input sequences
  1262. size_t a_len = a.size();
  1263. size_t b_len = b.size();
  1264. // initialize the maximum length of the longest common subsequence (LCS)
  1265. size_t max_length = 0;
  1266. // use two rows instead of a 2D matrix to optimize space
  1267. std::vector<size_t> prev_row(b_len + 1, 0);
  1268. std::vector<size_t> curr_row(b_len + 1, 0);
  1269. // iterate through the elements of a
  1270. for (size_t i = 1; i <= a_len; i++) {
  1271. // iterate through the elements of b
  1272. for (size_t j = 1; j <= b_len; j++) {
  1273. // if elements at the current positions match
  1274. if (a[i - 1] == b[j - 1]) {
  1275. // if it's the first element of either sequences, set LCS length to 1
  1276. if (i == 1 || j == 1) {
  1277. curr_row[j] = 1;
  1278. } else {
  1279. // increment LCS length by 1 compared to the previous element
  1280. curr_row[j] = prev_row[j - 1] + 1;
  1281. }
  1282. // update max_length if necessary
  1283. if (curr_row[j] > max_length) {
  1284. max_length = curr_row[j];
  1285. }
  1286. } else {
  1287. // reset LCS length if elements don't match
  1288. curr_row[j] = 0;
  1289. }
  1290. }
  1291. // update the previous row for the next iteration
  1292. prev_row = curr_row;
  1293. }
  1294. // return the maximum length of the LCS
  1295. return max_length;
  1296. }
  1297. //
  1298. // Vocab utils
  1299. //
  1300. std::vector<llama_token> common_tokenize(
  1301. const struct llama_context * ctx,
  1302. const std::string & text,
  1303. bool add_special,
  1304. bool parse_special) {
  1305. return common_tokenize(llama_get_model(ctx), text, add_special, parse_special);
  1306. }
  1307. std::vector<llama_token> common_tokenize(
  1308. const struct llama_model * model,
  1309. const std::string & text,
  1310. bool add_special,
  1311. bool parse_special) {
  1312. // upper limit for the number of tokens
  1313. int n_tokens = text.length() + 2 * add_special;
  1314. std::vector<llama_token> result(n_tokens);
  1315. n_tokens = llama_tokenize(model, text.data(), text.length(), result.data(), result.size(), add_special, parse_special);
  1316. if (n_tokens < 0) {
  1317. result.resize(-n_tokens);
  1318. int check = llama_tokenize(model, text.data(), text.length(), result.data(), result.size(), add_special, parse_special);
  1319. GGML_ASSERT(check == -n_tokens);
  1320. } else {
  1321. result.resize(n_tokens);
  1322. }
  1323. return result;
  1324. }
  1325. std::string common_token_to_piece(const struct llama_context * ctx, llama_token token, bool special) {
  1326. std::string piece;
  1327. piece.resize(piece.capacity()); // using string internal cache, 15 bytes + '\n'
  1328. const int n_chars = llama_token_to_piece(llama_get_model(ctx), token, &piece[0], piece.size(), 0, special);
  1329. if (n_chars < 0) {
  1330. piece.resize(-n_chars);
  1331. int check = llama_token_to_piece(llama_get_model(ctx), token, &piece[0], piece.size(), 0, special);
  1332. GGML_ASSERT(check == -n_chars);
  1333. }
  1334. else {
  1335. piece.resize(n_chars);
  1336. }
  1337. return piece;
  1338. }
  1339. std::string common_detokenize(llama_context * ctx, const std::vector<llama_token> & tokens, bool special) {
  1340. std::string text;
  1341. text.resize(std::max(text.capacity(), tokens.size()));
  1342. int32_t n_chars = llama_detokenize(llama_get_model(ctx), tokens.data(), (int32_t)tokens.size(), &text[0], (int32_t)text.size(), false, special);
  1343. if (n_chars < 0) {
  1344. text.resize(-n_chars);
  1345. n_chars = llama_detokenize(llama_get_model(ctx), tokens.data(), (int32_t)tokens.size(), &text[0], (int32_t)text.size(), false, special);
  1346. GGML_ASSERT(n_chars <= (int32_t)text.size()); // whitespace trimming is performed after per-token detokenization
  1347. }
  1348. text.resize(n_chars);
  1349. // NOTE: the original tokenizer decodes bytes after collecting the pieces.
  1350. return text;
  1351. }
  1352. //
  1353. // Chat template utils
  1354. //
  1355. bool common_chat_verify_template(const std::string & tmpl) {
  1356. llama_chat_message chat[] = {{"user", "test"}};
  1357. int res = llama_chat_apply_template(nullptr, tmpl.c_str(), chat, 1, true, nullptr, 0);
  1358. return res >= 0;
  1359. }
  1360. std::string common_chat_apply_template(const struct llama_model * model,
  1361. const std::string & tmpl,
  1362. const std::vector<common_chat_msg> & msgs,
  1363. bool add_ass) {
  1364. int alloc_size = 0;
  1365. bool fallback = false; // indicate if we must fallback to default chatml
  1366. std::vector<llama_chat_message> chat;
  1367. for (auto & msg : msgs) {
  1368. chat.push_back({msg.role.c_str(), msg.content.c_str()});
  1369. alloc_size += (msg.role.size() + msg.content.size()) * 1.25;
  1370. }
  1371. const char * ptr_tmpl = tmpl.empty() ? nullptr : tmpl.c_str();
  1372. std::vector<char> buf(alloc_size);
  1373. // run the first time to get the total output length
  1374. int32_t res = llama_chat_apply_template(model, ptr_tmpl, chat.data(), chat.size(), add_ass, buf.data(), buf.size());
  1375. // error: chat template is not supported
  1376. if (res < 0) {
  1377. if (ptr_tmpl != nullptr) {
  1378. // if the custom "tmpl" is not supported, we throw an error
  1379. // this is a bit redundant (for good), since we're not sure if user validated the custom template with llama_chat_verify_template()
  1380. throw std::runtime_error("this custom template is not supported");
  1381. } else {
  1382. // If the built-in template is not supported, we default to chatml
  1383. res = llama_chat_apply_template(nullptr, "chatml", chat.data(), chat.size(), add_ass, buf.data(), buf.size());
  1384. fallback = true;
  1385. }
  1386. }
  1387. // if it turns out that our buffer is too small, we resize it
  1388. if ((size_t) res > buf.size()) {
  1389. buf.resize(res);
  1390. res = llama_chat_apply_template(
  1391. fallback ? nullptr : model,
  1392. fallback ? "chatml" : ptr_tmpl,
  1393. chat.data(), chat.size(), add_ass, buf.data(), buf.size());
  1394. }
  1395. std::string formatted_chat(buf.data(), res);
  1396. return formatted_chat;
  1397. }
  1398. std::string common_chat_format_single(const struct llama_model * model,
  1399. const std::string & tmpl,
  1400. const std::vector<common_chat_msg> & past_msg,
  1401. const common_chat_msg & new_msg,
  1402. bool add_ass) {
  1403. std::ostringstream ss;
  1404. auto fmt_past_msg = past_msg.empty() ? "" : common_chat_apply_template(model, tmpl, past_msg, false);
  1405. std::vector<common_chat_msg> chat_new(past_msg);
  1406. // if the past_msg ends with a newline, we must preserve it in the formatted version
  1407. if (add_ass && !fmt_past_msg.empty() && fmt_past_msg.back() == '\n') {
  1408. ss << "\n";
  1409. };
  1410. // format chat with new_msg
  1411. chat_new.push_back(new_msg);
  1412. auto fmt_new_msg = common_chat_apply_template(model, tmpl, chat_new, add_ass);
  1413. // get the diff part
  1414. ss << fmt_new_msg.substr(fmt_past_msg.size(), fmt_new_msg.size() - fmt_past_msg.size());
  1415. return ss.str();
  1416. }
  1417. std::string common_chat_format_example(const struct llama_model * model,
  1418. const std::string & tmpl) {
  1419. std::vector<common_chat_msg> msgs = {
  1420. {"system", "You are a helpful assistant"},
  1421. {"user", "Hello"},
  1422. {"assistant", "Hi there"},
  1423. {"user", "How are you?"},
  1424. };
  1425. return common_chat_apply_template(model, tmpl, msgs, true);
  1426. }
  1427. //
  1428. // KV cache utils
  1429. //
  1430. void common_kv_cache_dump_view(const llama_kv_cache_view & view, int row_size) {
  1431. static const char slot_chars[] = ".123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz+";
  1432. printf("=== Dumping KV cache. total cells %d, max sequences per cell %d, populated cells %d, total tokens in cache %d, largest empty slot=%d @ %d",
  1433. view.n_cells, view.n_seq_max, view.used_cells, view.token_count, view.max_contiguous, view.max_contiguous_idx);
  1434. llama_kv_cache_view_cell * c_curr = view.cells;
  1435. llama_seq_id * cs_curr = view.cells_sequences;
  1436. for (int i = 0; i < view.n_cells; i++, c_curr++, cs_curr += view.n_seq_max) {
  1437. if (i % row_size == 0) {
  1438. printf("\n%5d: ", i);
  1439. }
  1440. int seq_count = 0;
  1441. for (int j = 0; j < view.n_seq_max; j++) {
  1442. if (cs_curr[j] >= 0) { seq_count++; }
  1443. }
  1444. putchar(slot_chars[std::min(sizeof(slot_chars) - 2, size_t(seq_count))]);
  1445. }
  1446. printf("\n=== Done dumping\n");
  1447. }
  1448. void common_kv_cache_dump_view_seqs(const llama_kv_cache_view & view, int row_size) {
  1449. static const char slot_chars[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
  1450. printf("=== Dumping KV cache. total cells %d, max sequences per cell %d, populated cells %d, total tokens in cache %d, largest empty slot=%d @ %d\n",
  1451. view.n_cells, view.n_seq_max, view.used_cells, view.token_count, view.max_contiguous, view.max_contiguous_idx);
  1452. std::unordered_map<llama_seq_id, size_t> seqs;
  1453. llama_kv_cache_view_cell * c_curr = view.cells;
  1454. llama_seq_id * cs_curr = view.cells_sequences;
  1455. for (int i = 0; i < view.n_cells; i++, c_curr++, cs_curr += view.n_seq_max) {
  1456. for (int j = 0; j < view.n_seq_max; j++) {
  1457. if (cs_curr[j] < 0) { continue; }
  1458. if (seqs.find(cs_curr[j]) == seqs.end()) {
  1459. if (seqs.size() + 1 >= sizeof(slot_chars)) { break; }
  1460. const size_t sz = seqs.size();
  1461. seqs[cs_curr[j]] = sz;
  1462. }
  1463. }
  1464. if (seqs.size() + 1 >= sizeof(slot_chars)) { break; }
  1465. }
  1466. printf("=== Sequence legend: ");
  1467. for (const auto & it : seqs) {
  1468. printf("%zu=%d, ", it.second, it.first);
  1469. }
  1470. printf("'+'=other sequence ids");
  1471. c_curr = view.cells;
  1472. cs_curr = view.cells_sequences;
  1473. for (int i = 0; i < view.n_cells; i++, c_curr++, cs_curr += view.n_seq_max) {
  1474. if (i % row_size == 0) {
  1475. printf("\n%5d: ", i);
  1476. }
  1477. for (int j = 0; j < view.n_seq_max; j++) {
  1478. if (cs_curr[j] >= 0) {
  1479. const auto & it = seqs.find(cs_curr[j]);
  1480. putchar(it != seqs.end() ? int(slot_chars[it->second]) : '+');
  1481. } else {
  1482. putchar('.');
  1483. }
  1484. }
  1485. putchar(' ');
  1486. }
  1487. printf("\n=== Done dumping\n");
  1488. }
  1489. //
  1490. // Embedding utils
  1491. //
  1492. void common_embd_normalize(const float * inp, float * out, int n, int embd_norm) {
  1493. double sum = 0.0;
  1494. switch (embd_norm) {
  1495. case -1: // no normalisation
  1496. sum = 1.0;
  1497. break;
  1498. case 0: // max absolute
  1499. for (int i = 0; i < n; i++) {
  1500. if (sum < std::abs(inp[i])) sum = std::abs(inp[i]);
  1501. }
  1502. sum /= 32760.0; // make an int16 range
  1503. break;
  1504. case 2: // euclidean
  1505. for (int i = 0; i < n; i++) {
  1506. sum += inp[i] * inp[i];
  1507. }
  1508. sum = std::sqrt(sum);
  1509. break;
  1510. default: // p-norm (euclidean is p-norm p=2)
  1511. for (int i = 0; i < n; i++) {
  1512. sum += std::pow(std::abs(inp[i]), embd_norm);
  1513. }
  1514. sum = std::pow(sum, 1.0 / embd_norm);
  1515. break;
  1516. }
  1517. const float norm = sum > 0.0 ? 1.0 / sum : 0.0f;
  1518. for (int i = 0; i < n; i++) {
  1519. out[i] = inp[i] * norm;
  1520. }
  1521. }
  1522. float common_embd_similarity_cos(const float * embd1, const float * embd2, int n){
  1523. double sum = 0.0;
  1524. double sum1 = 0.0;
  1525. double sum2 = 0.0;
  1526. for (int i = 0; i < n; i++) {
  1527. sum += embd1[i] * embd2[i];
  1528. sum1 += embd1[i] * embd1[i];
  1529. sum2 += embd2[i] * embd2[i];
  1530. }
  1531. // Handle the case where one or both vectors are zero vectors
  1532. if (sum1 == 0.0 || sum2 == 0.0) {
  1533. if (sum1 == 0.0 && sum2 == 0.0) {
  1534. return 1.0f; // two zero vectors are similar
  1535. }
  1536. return 0.0f;
  1537. }
  1538. return sum / (sqrt(sum1) * sqrt(sum2));
  1539. }
  1540. //
  1541. // Control vector utils
  1542. //
  1543. static common_control_vector_data common_control_vector_load_one(const common_control_vector_load_info & load_info) {
  1544. common_control_vector_data result = { -1, {} };
  1545. ggml_context * ctx = nullptr;
  1546. struct gguf_init_params meta_gguf_params = {
  1547. /* .no_alloc = */ false,
  1548. /* .ctx = */ &ctx,
  1549. };
  1550. struct gguf_context * ctx_gguf = gguf_init_from_file(load_info.fname.c_str(), meta_gguf_params);
  1551. if (!ctx_gguf) {
  1552. LOG_ERR("%s: failed to load control vector file from %s\n", __func__, load_info.fname.c_str());
  1553. return result;
  1554. }
  1555. int32_t n_tensors = gguf_get_n_tensors(ctx_gguf);
  1556. if (n_tensors == 0) {
  1557. LOG_WRN("%s: no direction tensors found in %s\n", __func__, load_info.fname.c_str());
  1558. }
  1559. for (int i = 0; i < n_tensors; i++) {
  1560. std::string name = gguf_get_tensor_name(ctx_gguf, i);
  1561. int layer_idx = -1;
  1562. // split on '.'
  1563. size_t dotpos = name.find('.');
  1564. if (dotpos != std::string::npos && name.substr(0, dotpos) == "direction") {
  1565. try {
  1566. layer_idx = std::stoi(name.substr(dotpos + 1));
  1567. } catch (...) {
  1568. layer_idx = -1;
  1569. }
  1570. }
  1571. if (layer_idx < 0) {
  1572. LOG_ERR("%s: invalid/unparsable direction tensor layer index in %s\n", __func__, load_info.fname.c_str());
  1573. result.n_embd = -1;
  1574. break;
  1575. } else if (layer_idx == 0) {
  1576. LOG_ERR("%s: invalid (zero) direction tensor layer index in %s\n", __func__, load_info.fname.c_str());
  1577. result.n_embd = -1;
  1578. break;
  1579. }
  1580. struct ggml_tensor * tensor = ggml_get_tensor(ctx, name.c_str());
  1581. if (tensor->type != GGML_TYPE_F32) {
  1582. LOG_ERR("%s: invalid (non-F32) direction tensor type in %s\n", __func__, load_info.fname.c_str());
  1583. result.n_embd = -1;
  1584. break;
  1585. }
  1586. if (ggml_n_dims(tensor) != 1) {
  1587. LOG_ERR("%s: invalid (non-1D) direction tensor shape in %s\n", __func__, load_info.fname.c_str());
  1588. result.n_embd = -1;
  1589. break;
  1590. }
  1591. if (result.n_embd == -1) {
  1592. result.n_embd = ggml_nelements(tensor);
  1593. } else if (ggml_nelements(tensor) != result.n_embd) {
  1594. LOG_ERR("%s: direction tensor in %s does not match previous dimensions\n", __func__, load_info.fname.c_str());
  1595. result.n_embd = -1;
  1596. break;
  1597. }
  1598. // extend if necessary - do not store data for layer 0 (it's not used)
  1599. result.data.resize(std::max(result.data.size(), static_cast<size_t>(result.n_embd * layer_idx)), 0.0f);
  1600. const float * src = (const float *) tensor->data;
  1601. float * dst = result.data.data() + result.n_embd * (layer_idx - 1); // layer 1 at [0]
  1602. for (int j = 0; j < result.n_embd; j++) {
  1603. dst[j] += src[j] * load_info.strength; // allows multiple directions for same layer in same file
  1604. }
  1605. }
  1606. if (result.n_embd == -1) {
  1607. LOG_WRN("%s: skipping %s due to invalid direction tensors\n", __func__, load_info.fname.c_str());
  1608. result.data.clear();
  1609. }
  1610. gguf_free(ctx_gguf);
  1611. ggml_free(ctx);
  1612. return result;
  1613. }
  1614. common_control_vector_data common_control_vector_load(const std::vector<common_control_vector_load_info> & load_infos) {
  1615. common_control_vector_data result = { -1, {} };
  1616. for (const auto & info : load_infos) {
  1617. auto cur = common_control_vector_load_one(info);
  1618. if (cur.n_embd == -1) {
  1619. result.n_embd = -1;
  1620. break;
  1621. }
  1622. if (result.n_embd != -1 && result.n_embd != cur.n_embd) {
  1623. LOG_ERR("%s: control vectors in %s does not match previous dimensions\n", __func__, info.fname.c_str());
  1624. result.n_embd = -1;
  1625. break;
  1626. }
  1627. if (result.n_embd == -1) {
  1628. result = std::move(cur);
  1629. } else {
  1630. result.data.resize(std::max(result.data.size(), cur.data.size()), 0.0f); // extend if necessary
  1631. for (size_t i = 0; i < cur.data.size(); i++) {
  1632. result.data[i] += cur.data[i];
  1633. }
  1634. }
  1635. }
  1636. if (result.n_embd == -1) {
  1637. LOG_ERR("%s: no valid control vector files passed\n", __func__);
  1638. result.data.clear();
  1639. }
  1640. return result;
  1641. }