sampling.cpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505
  1. #include "sampling.h"
  2. #include "common.h"
  3. #include <cmath>
  4. #include <unordered_map>
  5. // the ring buffer works similarly to std::deque, but with a fixed capacity
  6. // TODO: deduplicate with llama-impl.h
  7. template<typename T>
  8. struct ring_buffer {
  9. ring_buffer(size_t cap) : capacity(cap), data(cap) {}
  10. T & front() {
  11. if (sz == 0) {
  12. throw std::runtime_error("ring buffer is empty");
  13. }
  14. return data[first];
  15. }
  16. const T & front() const {
  17. if (sz == 0) {
  18. throw std::runtime_error("ring buffer is empty");
  19. }
  20. return data[first];
  21. }
  22. T & back() {
  23. if (sz == 0) {
  24. throw std::runtime_error("ring buffer is empty");
  25. }
  26. return data[pos];
  27. }
  28. const T & back() const {
  29. if (sz == 0) {
  30. throw std::runtime_error("ring buffer is empty");
  31. }
  32. return data[pos];
  33. }
  34. void push_back(const T & value) {
  35. if (sz == capacity) {
  36. // advance the start when buffer is full
  37. first = (first + 1) % capacity;
  38. } else {
  39. sz++;
  40. }
  41. data[pos] = value;
  42. pos = (pos + 1) % capacity;
  43. }
  44. T pop_front() {
  45. if (sz == 0) {
  46. throw std::runtime_error("ring buffer is empty");
  47. }
  48. T value = data[first];
  49. first = (first + 1) % capacity;
  50. sz--;
  51. return value;
  52. }
  53. const T & rat(size_t i) const {
  54. if (i >= sz) {
  55. throw std::runtime_error("ring buffer: index out of bounds");
  56. }
  57. return data[(first + sz - i - 1) % capacity];
  58. }
  59. std::vector<T> to_vector() const {
  60. std::vector<T> result;
  61. result.reserve(sz);
  62. for (size_t i = 0; i < sz; i++) {
  63. result.push_back(data[(first + i) % capacity]);
  64. }
  65. return result;
  66. }
  67. void clear() {
  68. // here only reset the status of the buffer
  69. sz = 0;
  70. first = 0;
  71. pos = 0;
  72. }
  73. bool empty() const {
  74. return sz == 0;
  75. }
  76. size_t size() const {
  77. return sz;
  78. }
  79. size_t capacity = 0;
  80. size_t sz = 0;
  81. size_t first = 0;
  82. size_t pos = 0;
  83. std::vector<T> data;
  84. };
  85. struct common_sampler {
  86. common_params_sampling params;
  87. struct llama_sampler * grmr;
  88. struct llama_sampler * chain;
  89. ring_buffer<llama_token> prev;
  90. std::vector<llama_token_data> cur;
  91. llama_token_data_array cur_p;
  92. void set_logits(struct llama_context * ctx, int idx) {
  93. const auto * logits = llama_get_logits_ith(ctx, idx);
  94. const int n_vocab = llama_n_vocab(llama_get_model(ctx));
  95. cur.resize(n_vocab);
  96. for (llama_token token_id = 0; token_id < n_vocab; token_id++) {
  97. cur[token_id] = llama_token_data{token_id, logits[token_id], 0.0f};
  98. }
  99. cur_p = { cur.data(), cur.size(), -1, false };
  100. }
  101. };
  102. std::string common_params_sampling::print() const {
  103. char result[1024];
  104. snprintf(result, sizeof(result),
  105. "\trepeat_last_n = %d, repeat_penalty = %.3f, frequency_penalty = %.3f, presence_penalty = %.3f\n"
  106. "\tdry_multiplier = %.3f, dry_base = %.3f, dry_allowed_length = %d, dry_penalty_last_n = %d\n"
  107. "\ttop_k = %d, top_p = %.3f, min_p = %.3f, xtc_probability = %.3f, xtc_threshold = %.3f, typical_p = %.3f, temp = %.3f\n"
  108. "\tmirostat = %d, mirostat_lr = %.3f, mirostat_ent = %.3f",
  109. penalty_last_n, penalty_repeat, penalty_freq, penalty_present,
  110. dry_multiplier, dry_base, dry_allowed_length, dry_penalty_last_n,
  111. top_k, top_p, min_p, xtc_probability, xtc_threshold, typ_p, temp,
  112. mirostat, mirostat_eta, mirostat_tau);
  113. return std::string(result);
  114. }
  115. struct common_sampler * common_sampler_init(const struct llama_model * model, const struct common_params_sampling & params) {
  116. llama_sampler_chain_params lparams = llama_sampler_chain_default_params();
  117. lparams.no_perf = params.no_perf;
  118. auto * result = new common_sampler {
  119. /* .params = */ params,
  120. /* .grmr = */ llama_sampler_init_grammar(model, params.grammar.c_str(), "root"),
  121. /* .chain = */ llama_sampler_chain_init(lparams),
  122. /* .prev = */ ring_buffer<llama_token>(std::max(32, params.n_prev)),
  123. /* .cur = */ {},
  124. /* .cur_p = */ {},
  125. };
  126. llama_sampler_chain_add(result->chain,
  127. llama_sampler_init_logit_bias(
  128. llama_n_vocab(model),
  129. params.logit_bias.size(),
  130. params.logit_bias.data()));
  131. llama_sampler_chain_add(result->chain,
  132. llama_sampler_init_penalties(
  133. llama_n_vocab (model),
  134. llama_token_eos(model),
  135. llama_token_nl (model),
  136. params.penalty_last_n,
  137. params.penalty_repeat,
  138. params.penalty_freq,
  139. params.penalty_present,
  140. params.penalize_nl,
  141. params.ignore_eos));
  142. if (params.mirostat == 0) {
  143. for (const auto & cnstr : params.samplers) {
  144. switch (cnstr) {
  145. case COMMON_SAMPLER_TYPE_DRY:
  146. {
  147. std::vector<const char*> c_breakers;
  148. c_breakers.reserve(params.dry_sequence_breakers.size());
  149. for (const auto& str : params.dry_sequence_breakers) {
  150. c_breakers.push_back(str.c_str());
  151. }
  152. llama_sampler_chain_add(result->chain, llama_sampler_init_dry (model, params.dry_multiplier, params.dry_base, params.dry_allowed_length, params.dry_penalty_last_n, c_breakers.data(), c_breakers.size()));
  153. }
  154. break;
  155. case COMMON_SAMPLER_TYPE_TOP_K:
  156. llama_sampler_chain_add(result->chain, llama_sampler_init_top_k (params.top_k));
  157. break;
  158. case COMMON_SAMPLER_TYPE_TOP_P:
  159. llama_sampler_chain_add(result->chain, llama_sampler_init_top_p (params.top_p, params.min_keep));
  160. break;
  161. case COMMON_SAMPLER_TYPE_MIN_P:
  162. llama_sampler_chain_add(result->chain, llama_sampler_init_min_p (params.min_p, params.min_keep));
  163. break;
  164. case COMMON_SAMPLER_TYPE_XTC:
  165. llama_sampler_chain_add(result->chain, llama_sampler_init_xtc (params.xtc_probability, params.xtc_threshold, params.min_keep, params.seed));
  166. break;
  167. case COMMON_SAMPLER_TYPE_TYPICAL_P:
  168. llama_sampler_chain_add(result->chain, llama_sampler_init_typical (params.typ_p, params.min_keep));
  169. break;
  170. case COMMON_SAMPLER_TYPE_TEMPERATURE:
  171. llama_sampler_chain_add(result->chain, llama_sampler_init_temp_ext (params.temp, params.dynatemp_range, params.dynatemp_exponent));
  172. break;
  173. case COMMON_SAMPLER_TYPE_INFILL:
  174. llama_sampler_chain_add(result->chain, llama_sampler_init_infill (model));
  175. break;
  176. default:
  177. GGML_ASSERT(false && "unknown sampler type");
  178. }
  179. }
  180. llama_sampler_chain_add(result->chain, llama_sampler_init_dist(params.seed));
  181. } else if (params.mirostat == 1) {
  182. llama_sampler_chain_add(result->chain, llama_sampler_init_temp(params.temp));
  183. llama_sampler_chain_add(result->chain, llama_sampler_init_mirostat(llama_n_vocab(model), params.seed, params.mirostat_tau, params.mirostat_eta, 100));
  184. } else if (params.mirostat == 2) {
  185. llama_sampler_chain_add(result->chain, llama_sampler_init_temp(params.temp));
  186. llama_sampler_chain_add(result->chain, llama_sampler_init_mirostat_v2(params.seed, params.mirostat_tau, params.mirostat_eta));
  187. } else {
  188. GGML_ASSERT(false && "unknown mirostat version");
  189. }
  190. return result;
  191. }
  192. void common_sampler_free(struct common_sampler * gsmpl) {
  193. if (gsmpl) {
  194. llama_sampler_free(gsmpl->grmr);
  195. llama_sampler_free(gsmpl->chain);
  196. delete gsmpl;
  197. }
  198. }
  199. void common_sampler_accept(struct common_sampler * gsmpl, llama_token token, bool accept_grammar) {
  200. if (accept_grammar) {
  201. llama_sampler_accept(gsmpl->grmr, token);
  202. }
  203. llama_sampler_accept(gsmpl->chain, token);
  204. gsmpl->prev.push_back(token);
  205. }
  206. void common_sampler_reset(struct common_sampler * gsmpl) {
  207. llama_sampler_reset(gsmpl->grmr);
  208. llama_sampler_reset(gsmpl->chain);
  209. }
  210. struct common_sampler * common_sampler_clone(common_sampler * gsmpl) {
  211. return new common_sampler {
  212. /* .params = */ gsmpl->params,
  213. /* .grmr = */ llama_sampler_clone(gsmpl->grmr),
  214. /* .chain = */ llama_sampler_clone(gsmpl->chain),
  215. /* .prev = */ gsmpl->prev,
  216. /* .cur = */ gsmpl->cur,
  217. /* .cur_p = */ gsmpl->cur_p,
  218. };
  219. }
  220. void common_perf_print(const struct llama_context * ctx, const struct common_sampler * gsmpl) {
  221. // TODO: measure grammar performance
  222. if (gsmpl) {
  223. llama_perf_sampler_print(gsmpl->chain);
  224. }
  225. if (ctx) {
  226. llama_perf_context_print(ctx);
  227. }
  228. }
  229. llama_token common_sampler_sample(struct common_sampler * gsmpl, struct llama_context * ctx, int idx, bool grammar_first) {
  230. gsmpl->set_logits(ctx, idx);
  231. auto & grmr = gsmpl->grmr;
  232. auto & chain = gsmpl->chain;
  233. auto & cur_p = gsmpl->cur_p; // initialized by set_logits
  234. if (grammar_first) {
  235. llama_sampler_apply(grmr, &cur_p);
  236. }
  237. llama_sampler_apply(chain, &cur_p);
  238. GGML_ASSERT(cur_p.selected != -1 && "no selected token during sampling - check your sampling configuration");
  239. const llama_token id = cur_p.data[cur_p.selected].id;
  240. if (grammar_first) {
  241. return id;
  242. }
  243. // check if it the sampled token fits the grammar
  244. {
  245. llama_token_data single_token_data = { id, 1.0f, 0.0f };
  246. llama_token_data_array single_token_data_array = { &single_token_data, 1, -1, false };
  247. llama_sampler_apply(grmr, &single_token_data_array);
  248. const bool is_valid = single_token_data_array.data[0].logit != -INFINITY;
  249. if (is_valid) {
  250. return id;
  251. }
  252. }
  253. // resampling:
  254. // if the token is not valid, sample again, but first apply the grammar sampler and then the sampling chain
  255. gsmpl->set_logits(ctx, idx);
  256. llama_sampler_apply(grmr, &cur_p);
  257. llama_sampler_apply(chain, &cur_p);
  258. GGML_ASSERT(cur_p.selected != -1 && "no selected token during re-sampling - check your sampling configuration");
  259. return cur_p.data[cur_p.selected].id;
  260. }
  261. std::vector<llama_token> common_sampler_sample_and_accept_n(struct common_sampler * gsmpl, struct llama_context * ctx, const std::vector<int> & idxs, const llama_tokens & draft, bool grammar_first) {
  262. GGML_ASSERT(idxs.size() == draft.size() + 1 && "idxs.size() must be draft.size() + 1");
  263. std::vector<llama_token> result;
  264. result.reserve(idxs.size());
  265. size_t i = 0;
  266. for (; i < draft.size(); i++) {
  267. const llama_token id = common_sampler_sample(gsmpl, ctx, idxs[i], grammar_first);
  268. common_sampler_accept(gsmpl, id, true);
  269. result.push_back(id);
  270. if (draft[i] != id) {
  271. break;
  272. }
  273. }
  274. if (i == draft.size()) {
  275. const llama_token id = common_sampler_sample(gsmpl, ctx, idxs[i], grammar_first);
  276. common_sampler_accept(gsmpl, id, true);
  277. result.push_back(id);
  278. }
  279. return result;
  280. }
  281. std::vector<llama_token> common_sampler_sample_and_accept_n(struct common_sampler * gsmpl, struct llama_context * ctx, const llama_tokens & draft, bool grammar_first) {
  282. std::vector<int> idxs(draft.size() + 1);
  283. for (size_t i = 0; i < idxs.size(); ++i) {
  284. idxs[i] = i;
  285. }
  286. return common_sampler_sample_and_accept_n(gsmpl, ctx, idxs, draft, grammar_first);
  287. }
  288. uint32_t common_sampler_get_seed(const struct common_sampler * gsmpl) {
  289. return llama_sampler_get_seed(gsmpl->chain);
  290. }
  291. // helpers
  292. llama_token_data_array * common_sampler_get_candidates(struct common_sampler * gsmpl) {
  293. return &gsmpl->cur_p;
  294. }
  295. llama_token common_sampler_last(const struct common_sampler * gsmpl) {
  296. return gsmpl->prev.rat(0);
  297. }
  298. std::string common_sampler_print(const struct common_sampler * gsmpl) {
  299. std::string result = "logits ";
  300. for (int i = 0; i < llama_sampler_chain_n(gsmpl->chain); i++) {
  301. const auto * smpl = llama_sampler_chain_get(gsmpl->chain, i);
  302. result += std::string("-> ") + llama_sampler_name(smpl) + " ";
  303. }
  304. return result;
  305. }
  306. std::string common_sampler_prev_str(common_sampler * gsmpl, llama_context * ctx_main, int n) {
  307. n = std::min(n, (int) gsmpl->prev.size());
  308. if (n <= 0) {
  309. return "";
  310. }
  311. std::string result;
  312. result.reserve(8*n); // 8 is the average length of a token [citation needed], TODO: compute this from the vocab
  313. for (int i = n - 1; i >= 0; i--) {
  314. const llama_token id = gsmpl->prev.rat(i);
  315. GGML_ASSERT(id != LLAMA_TOKEN_NULL && "null token in the sampling history - should not happen");
  316. result += common_token_to_piece(ctx_main, id);
  317. }
  318. return result;
  319. }
  320. char common_sampler_type_to_chr(enum common_sampler_type cnstr) {
  321. switch (cnstr) {
  322. case COMMON_SAMPLER_TYPE_DRY: return 'd';
  323. case COMMON_SAMPLER_TYPE_TOP_K: return 'k';
  324. case COMMON_SAMPLER_TYPE_TYPICAL_P: return 'y';
  325. case COMMON_SAMPLER_TYPE_TOP_P: return 'p';
  326. case COMMON_SAMPLER_TYPE_MIN_P: return 'm';
  327. case COMMON_SAMPLER_TYPE_TEMPERATURE: return 't';
  328. case COMMON_SAMPLER_TYPE_XTC: return 'x';
  329. case COMMON_SAMPLER_TYPE_INFILL: return 'i';
  330. default : return '?';
  331. }
  332. }
  333. std::string common_sampler_type_to_str(enum common_sampler_type cnstr) {
  334. switch (cnstr) {
  335. case COMMON_SAMPLER_TYPE_DRY: return "dry";
  336. case COMMON_SAMPLER_TYPE_TOP_K: return "top_k";
  337. case COMMON_SAMPLER_TYPE_TYPICAL_P: return "typ_p";
  338. case COMMON_SAMPLER_TYPE_TOP_P: return "top_p";
  339. case COMMON_SAMPLER_TYPE_MIN_P: return "min_p";
  340. case COMMON_SAMPLER_TYPE_TEMPERATURE: return "temperature";
  341. case COMMON_SAMPLER_TYPE_XTC: return "xtc";
  342. case COMMON_SAMPLER_TYPE_INFILL: return "infill";
  343. default : return "";
  344. }
  345. }
  346. std::vector<common_sampler_type> common_sampler_types_from_names(const std::vector<std::string> & names, bool allow_alt_names) {
  347. std::unordered_map<std::string, common_sampler_type> sampler_canonical_name_map {
  348. { "dry", COMMON_SAMPLER_TYPE_DRY },
  349. { "top_k", COMMON_SAMPLER_TYPE_TOP_K },
  350. { "top_p", COMMON_SAMPLER_TYPE_TOP_P },
  351. { "typ_p", COMMON_SAMPLER_TYPE_TYPICAL_P },
  352. { "min_p", COMMON_SAMPLER_TYPE_MIN_P },
  353. { "temperature", COMMON_SAMPLER_TYPE_TEMPERATURE },
  354. { "xtc", COMMON_SAMPLER_TYPE_XTC },
  355. { "infill", COMMON_SAMPLER_TYPE_INFILL },
  356. };
  357. // since samplers names are written multiple ways
  358. // make it ready for both system names and input names
  359. std::unordered_map<std::string, common_sampler_type> sampler_alt_name_map {
  360. { "top-k", COMMON_SAMPLER_TYPE_TOP_K },
  361. { "top-p", COMMON_SAMPLER_TYPE_TOP_P },
  362. { "nucleus", COMMON_SAMPLER_TYPE_TOP_P },
  363. { "typical-p", COMMON_SAMPLER_TYPE_TYPICAL_P },
  364. { "typical", COMMON_SAMPLER_TYPE_TYPICAL_P },
  365. { "typ-p", COMMON_SAMPLER_TYPE_TYPICAL_P },
  366. { "typ", COMMON_SAMPLER_TYPE_TYPICAL_P },
  367. { "min-p", COMMON_SAMPLER_TYPE_MIN_P },
  368. { "temp", COMMON_SAMPLER_TYPE_TEMPERATURE },
  369. };
  370. std::vector<common_sampler_type> samplers;
  371. samplers.reserve(names.size());
  372. for (const auto & name : names) {
  373. auto sampler = sampler_canonical_name_map.find(name);
  374. if (sampler != sampler_canonical_name_map.end()) {
  375. samplers.push_back(sampler->second);
  376. } else {
  377. if (allow_alt_names) {
  378. sampler = sampler_alt_name_map.find(name);
  379. if (sampler != sampler_alt_name_map.end()) {
  380. samplers.push_back(sampler->second);
  381. }
  382. }
  383. }
  384. }
  385. return samplers;
  386. }
  387. std::vector<common_sampler_type> common_sampler_types_from_chars(const std::string & chars) {
  388. std::unordered_map<char, common_sampler_type> sampler_name_map = {
  389. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_DRY), COMMON_SAMPLER_TYPE_DRY },
  390. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_TOP_K), COMMON_SAMPLER_TYPE_TOP_K },
  391. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_TYPICAL_P), COMMON_SAMPLER_TYPE_TYPICAL_P },
  392. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_TOP_P), COMMON_SAMPLER_TYPE_TOP_P },
  393. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_MIN_P), COMMON_SAMPLER_TYPE_MIN_P },
  394. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_TEMPERATURE), COMMON_SAMPLER_TYPE_TEMPERATURE },
  395. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_XTC), COMMON_SAMPLER_TYPE_XTC },
  396. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_INFILL), COMMON_SAMPLER_TYPE_INFILL },
  397. };
  398. std::vector<common_sampler_type> samplers;
  399. samplers.reserve(chars.size());
  400. for (const auto & c : chars) {
  401. const auto sampler = sampler_name_map.find(c);
  402. if (sampler != sampler_name_map.end()) {
  403. samplers.push_back(sampler->second);
  404. }
  405. }
  406. return samplers;
  407. }