common.cpp 75 KB

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