batched.cpp 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246
  1. #include "arg.h"
  2. #include "common.h"
  3. #include "log.h"
  4. #include "llama.h"
  5. #include <algorithm>
  6. #include <cstdio>
  7. #include <string>
  8. #include <vector>
  9. static void print_usage(int, char ** argv) {
  10. LOG("\nexample usage:\n");
  11. LOG("\n %s -m model.gguf -p \"Hello my name is\" -n 32 -np 4\n", argv[0]);
  12. LOG("\n");
  13. }
  14. int main(int argc, char ** argv) {
  15. common_params params;
  16. params.prompt = "Hello my name is";
  17. params.n_predict = 32;
  18. if (!common_params_parse(argc, argv, params, LLAMA_EXAMPLE_COMMON, print_usage)) {
  19. return 1;
  20. }
  21. common_init();
  22. // number of parallel batches
  23. int n_parallel = params.n_parallel;
  24. // total length of the sequences including the prompt
  25. int n_predict = params.n_predict;
  26. // init LLM
  27. llama_backend_init();
  28. llama_numa_init(params.numa);
  29. // initialize the model
  30. llama_model_params model_params = common_model_params_to_llama(params);
  31. llama_model * model = llama_model_load_from_file(params.model.path.c_str(), model_params);
  32. if (model == NULL) {
  33. LOG_ERR("%s: error: unable to load model\n" , __func__);
  34. return 1;
  35. }
  36. const llama_vocab * vocab = llama_model_get_vocab(model);
  37. // tokenize the prompt
  38. std::vector<llama_token> tokens_list;
  39. tokens_list = common_tokenize(vocab, params.prompt, true);
  40. const int n_kv_req = tokens_list.size() + (n_predict - tokens_list.size())*n_parallel;
  41. // initialize the context
  42. llama_context_params ctx_params = common_context_params_to_llama(params);
  43. ctx_params.n_ctx = n_kv_req;
  44. ctx_params.n_batch = std::max(n_predict, n_parallel);
  45. llama_context * ctx = llama_init_from_model(model, ctx_params);
  46. auto sparams = llama_sampler_chain_default_params();
  47. sparams.no_perf = false;
  48. llama_sampler * smpl = llama_sampler_chain_init(sparams);
  49. llama_sampler_chain_add(smpl, llama_sampler_init_top_k(params.sampling.top_k));
  50. llama_sampler_chain_add(smpl, llama_sampler_init_top_p(params.sampling.top_p, params.sampling.min_keep));
  51. llama_sampler_chain_add(smpl, llama_sampler_init_temp (params.sampling.temp));
  52. llama_sampler_chain_add(smpl, llama_sampler_init_dist (params.sampling.seed));
  53. if (ctx == NULL) {
  54. LOG_ERR("%s: error: failed to create the llama_context\n" , __func__);
  55. return 1;
  56. }
  57. const int n_ctx = llama_n_ctx(ctx);
  58. LOG_INF("\n%s: n_predict = %d, n_ctx = %d, n_batch = %u, n_parallel = %d, n_kv_req = %d\n", __func__, n_predict, n_ctx, ctx_params.n_batch, n_parallel, n_kv_req);
  59. // make sure the KV cache is big enough to hold all the prompt and generated tokens
  60. if (n_kv_req > n_ctx) {
  61. LOG_ERR("%s: error: n_kv_req (%d) > n_ctx, the required KV cache size is not big enough\n", __func__, n_kv_req);
  62. LOG_ERR("%s: either reduce n_parallel or increase n_ctx\n", __func__);
  63. return 1;
  64. }
  65. // print the prompt token-by-token
  66. LOG("\n");
  67. for (auto id : tokens_list) {
  68. LOG("%s", common_token_to_piece(ctx, id).c_str());
  69. }
  70. // create a llama_batch
  71. // we use this object to submit token data for decoding
  72. llama_batch batch = llama_batch_init(std::max(tokens_list.size(), (size_t) n_parallel), 0, n_parallel);
  73. std::vector<llama_seq_id> seq_ids(n_parallel, 0);
  74. for (int32_t i = 0; i < n_parallel; ++i) {
  75. seq_ids[i] = i;
  76. }
  77. // evaluate the initial prompt
  78. for (size_t i = 0; i < tokens_list.size(); ++i) {
  79. common_batch_add(batch, tokens_list[i], i, seq_ids, false);
  80. }
  81. GGML_ASSERT(batch.n_tokens == (int) tokens_list.size());
  82. if (llama_model_has_encoder(model)) {
  83. if (llama_encode(ctx, batch)) {
  84. LOG_ERR("%s : failed to eval\n", __func__);
  85. return 1;
  86. }
  87. llama_token decoder_start_token_id = llama_model_decoder_start_token(model);
  88. if (decoder_start_token_id == LLAMA_TOKEN_NULL) {
  89. decoder_start_token_id = llama_vocab_bos(vocab);
  90. }
  91. common_batch_clear(batch);
  92. common_batch_add(batch, decoder_start_token_id, 0, seq_ids, false);
  93. }
  94. // llama_decode will output logits only for the last token of the prompt
  95. batch.logits[batch.n_tokens - 1] = true;
  96. if (llama_decode(ctx, batch) != 0) {
  97. LOG_ERR("%s: llama_decode() failed\n", __func__);
  98. return 1;
  99. }
  100. //// assign the system KV cache to all parallel sequences
  101. //// this way, the parallel sequences will "reuse" the prompt tokens without having to copy them
  102. //for (int32_t i = 1; i < n_parallel; ++i) {
  103. // llama_kv_cache_seq_cp(ctx, 0, i, -1, -1);
  104. //}
  105. if (n_parallel > 1) {
  106. LOG("\n\n%s: generating %d sequences ...\n", __func__, n_parallel);
  107. }
  108. // main loop
  109. // we will store the parallel decoded sequences in this vector
  110. std::vector<std::string> streams(n_parallel);
  111. // remember the batch index of the last token for each parallel sequence
  112. // we need this to determine which logits to sample from
  113. std::vector<int32_t> i_batch(n_parallel, batch.n_tokens - 1);
  114. int n_cur = batch.n_tokens;
  115. int n_decode = 0;
  116. const auto t_main_start = ggml_time_us();
  117. while (n_cur <= n_predict) {
  118. // prepare the next batch
  119. common_batch_clear(batch);
  120. // sample the next token for each parallel sequence / stream
  121. for (int32_t i = 0; i < n_parallel; ++i) {
  122. if (i_batch[i] < 0) {
  123. // the stream has already finished
  124. continue;
  125. }
  126. const llama_token new_token_id = llama_sampler_sample(smpl, ctx, i_batch[i]);
  127. // is it an end of generation? -> mark the stream as finished
  128. if (llama_vocab_is_eog(vocab, new_token_id) || n_cur == n_predict) {
  129. i_batch[i] = -1;
  130. LOG("\n");
  131. if (n_parallel > 1) {
  132. LOG_INF("%s: stream %d finished at n_cur = %d", __func__, i, n_cur);
  133. }
  134. continue;
  135. }
  136. // if there is only one stream, we print immediately to stdout
  137. if (n_parallel == 1) {
  138. LOG("%s", common_token_to_piece(ctx, new_token_id).c_str());
  139. }
  140. streams[i] += common_token_to_piece(ctx, new_token_id);
  141. i_batch[i] = batch.n_tokens;
  142. // push this new token for next evaluation
  143. common_batch_add(batch, new_token_id, n_cur, { i }, true);
  144. n_decode += 1;
  145. }
  146. // all streams are finished
  147. if (batch.n_tokens == 0) {
  148. break;
  149. }
  150. n_cur += 1;
  151. // evaluate the current batch with the transformer model
  152. if (llama_decode(ctx, batch)) {
  153. LOG_ERR("%s : failed to eval, return code %d\n", __func__, 1);
  154. return 1;
  155. }
  156. }
  157. if (n_parallel > 1) {
  158. LOG("\n");
  159. for (int32_t i = 0; i < n_parallel; ++i) {
  160. LOG("sequence %d:\n\n%s%s\n\n", i, params.prompt.c_str(), streams[i].c_str());
  161. }
  162. }
  163. const auto t_main_end = ggml_time_us();
  164. LOG_INF("%s: decoded %d tokens in %.2f s, speed: %.2f t/s\n",
  165. __func__, n_decode, (t_main_end - t_main_start) / 1000000.0f, n_decode / ((t_main_end - t_main_start) / 1000000.0f));
  166. LOG("\n");
  167. llama_perf_sampler_print(smpl);
  168. llama_perf_context_print(ctx);
  169. fprintf(stderr, "\n");
  170. llama_batch_free(batch);
  171. llama_sampler_free(smpl);
  172. llama_free(ctx);
  173. llama_model_free(model);
  174. llama_backend_free();
  175. return 0;
  176. }