utils.hpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508
  1. #pragma once
  2. #include <string>
  3. #include <vector>
  4. #include <set>
  5. #include <mutex>
  6. #include <condition_variable>
  7. #include <unordered_map>
  8. #include "json.hpp"
  9. #include "../llava/clip.h"
  10. using json = nlohmann::json;
  11. extern bool server_verbose;
  12. #ifndef SERVER_VERBOSE
  13. #define SERVER_VERBOSE 1
  14. #endif
  15. #if SERVER_VERBOSE != 1
  16. #define LOG_VERBOSE(MSG, ...)
  17. #else
  18. #define LOG_VERBOSE(MSG, ...) \
  19. do \
  20. { \
  21. if (server_verbose) \
  22. { \
  23. server_log("VERBOSE", __func__, __LINE__, MSG, __VA_ARGS__); \
  24. } \
  25. } while (0)
  26. #endif
  27. #define LOG_ERROR( MSG, ...) server_log("ERROR", __func__, __LINE__, MSG, __VA_ARGS__)
  28. #define LOG_WARNING(MSG, ...) server_log("WARNING", __func__, __LINE__, MSG, __VA_ARGS__)
  29. #define LOG_INFO( MSG, ...) server_log("INFO", __func__, __LINE__, MSG, __VA_ARGS__)
  30. //
  31. // parallel
  32. //
  33. enum server_state {
  34. SERVER_STATE_LOADING_MODEL, // Server is starting up, model not fully loaded yet
  35. SERVER_STATE_READY, // Server is ready and model is loaded
  36. SERVER_STATE_ERROR // An error occurred, load_model failed
  37. };
  38. enum task_type {
  39. TASK_TYPE_COMPLETION,
  40. TASK_TYPE_CANCEL,
  41. TASK_TYPE_NEXT_RESPONSE
  42. };
  43. struct task_server {
  44. int id = -1; // to be filled by llama_server_queue
  45. int target_id;
  46. task_type type;
  47. json data;
  48. bool infill_mode = false;
  49. bool embedding_mode = false;
  50. int multitask_id = -1;
  51. };
  52. struct task_result {
  53. int id;
  54. int multitask_id = -1;
  55. bool stop;
  56. bool error;
  57. json result_json;
  58. };
  59. struct task_multi {
  60. int id;
  61. std::set<int> subtasks_remaining{};
  62. std::vector<task_result> results{};
  63. };
  64. // TODO: can become bool if we can't find use of more states
  65. enum slot_state
  66. {
  67. IDLE,
  68. PROCESSING,
  69. };
  70. enum slot_command
  71. {
  72. NONE,
  73. LOAD_PROMPT,
  74. RELEASE,
  75. };
  76. struct slot_params
  77. {
  78. bool stream = true;
  79. bool cache_prompt = false; // remember the prompt to avoid reprocessing all prompt
  80. uint32_t seed = -1; // RNG seed
  81. int32_t n_keep = 0; // number of tokens to keep from initial prompt
  82. int32_t n_predict = -1; // new tokens to predict
  83. std::vector<std::string> antiprompt;
  84. json input_prefix;
  85. json input_suffix;
  86. };
  87. struct slot_image
  88. {
  89. int32_t id;
  90. bool request_encode_image = false;
  91. float * image_embedding = nullptr;
  92. int32_t image_tokens = 0;
  93. clip_image_u8 * img_data;
  94. std::string prefix_prompt; // before of this image
  95. };
  96. // completion token output with probabilities
  97. struct completion_token_output
  98. {
  99. struct token_prob
  100. {
  101. llama_token tok;
  102. float prob;
  103. };
  104. std::vector<token_prob> probs;
  105. llama_token tok;
  106. std::string text_to_send;
  107. };
  108. static inline void server_log(const char *level, const char *function, int line,
  109. const char *message, const nlohmann::ordered_json &extra)
  110. {
  111. nlohmann::ordered_json log
  112. {
  113. {"timestamp", time(nullptr)},
  114. {"level", level},
  115. {"function", function},
  116. {"line", line},
  117. {"message", message},
  118. };
  119. if (!extra.empty())
  120. {
  121. log.merge_patch(extra);
  122. }
  123. const std::string str = log.dump(-1, ' ', false, json::error_handler_t::replace);
  124. printf("%.*s\n", (int)str.size(), str.data());
  125. fflush(stdout);
  126. }
  127. //
  128. // server utils
  129. //
  130. template <typename T>
  131. static T json_value(const json &body, const std::string &key, const T &default_value)
  132. {
  133. // Fallback null to default value
  134. return body.contains(key) && !body.at(key).is_null()
  135. ? body.value(key, default_value)
  136. : default_value;
  137. }
  138. inline std::string format_chatml(std::vector<json> messages)
  139. {
  140. std::ostringstream chatml_msgs;
  141. for (auto it = messages.begin(); it != messages.end(); ++it) {
  142. chatml_msgs << "<|im_start|>"
  143. << json_value(*it, "role", std::string("user")) << '\n';
  144. chatml_msgs << json_value(*it, "content", std::string(""))
  145. << "<|im_end|>\n";
  146. }
  147. chatml_msgs << "<|im_start|>assistant" << '\n';
  148. return chatml_msgs.str();
  149. }
  150. //
  151. // work queue utils
  152. //
  153. struct llama_server_queue {
  154. int id = 0;
  155. std::mutex mutex_tasks;
  156. // queues
  157. std::vector<task_server> queue_tasks;
  158. std::vector<task_server> queue_tasks_deferred;
  159. std::vector<task_multi> queue_multitasks;
  160. std::condition_variable condition_tasks;
  161. // callback functions
  162. std::function<void(task_server&)> callback_new_task;
  163. std::function<void(task_multi&)> callback_finish_multitask;
  164. std::function<void(void)> callback_all_task_finished;
  165. // Add a new task to the end of the queue
  166. int post(task_server task) {
  167. std::unique_lock<std::mutex> lock(mutex_tasks);
  168. if (task.id == -1) {
  169. task.id = id++;
  170. }
  171. queue_tasks.push_back(std::move(task));
  172. condition_tasks.notify_one();
  173. return task.id;
  174. }
  175. // Add a new task, but defer until one slot is available
  176. void defer(task_server task) {
  177. std::unique_lock<std::mutex> lock(mutex_tasks);
  178. queue_tasks_deferred.push_back(std::move(task));
  179. }
  180. // Get the next id for creating anew task
  181. int get_new_id() {
  182. std::unique_lock<std::mutex> lock(mutex_tasks);
  183. return id++;
  184. }
  185. // Register function to process a new task
  186. void on_new_task(std::function<void(task_server&)> callback) {
  187. callback_new_task = callback;
  188. }
  189. // Register function to process a multitask
  190. void on_finish_multitask(std::function<void(task_multi&)> callback) {
  191. callback_finish_multitask = callback;
  192. }
  193. // Register the function to be called when the batch of tasks is finished
  194. void on_all_tasks_finished(std::function<void(void)> callback) {
  195. callback_all_task_finished = callback;
  196. }
  197. // Call when the state of one slot is changed
  198. void notify_slot_changed() {
  199. // move deferred tasks back to main loop
  200. std::unique_lock<std::mutex> lock(mutex_tasks);
  201. for (auto & task : queue_tasks_deferred) {
  202. queue_tasks.push_back(std::move(task));
  203. }
  204. queue_tasks_deferred.clear();
  205. }
  206. // Start the main loop. This call is blocking
  207. [[noreturn]]
  208. void start_loop() {
  209. while (true) {
  210. // new task arrived
  211. LOG_VERBOSE("have new task", {});
  212. {
  213. while (true)
  214. {
  215. std::unique_lock<std::mutex> lock(mutex_tasks);
  216. if (queue_tasks.empty()) {
  217. lock.unlock();
  218. break;
  219. }
  220. task_server task = queue_tasks.front();
  221. queue_tasks.erase(queue_tasks.begin());
  222. lock.unlock();
  223. LOG_VERBOSE("callback_new_task", {});
  224. callback_new_task(task);
  225. }
  226. LOG_VERBOSE("callback_all_task_finished", {});
  227. // process and update all the multitasks
  228. auto queue_iterator = queue_multitasks.begin();
  229. while (queue_iterator != queue_multitasks.end())
  230. {
  231. if (queue_iterator->subtasks_remaining.empty())
  232. {
  233. // all subtasks done == multitask is done
  234. task_multi current_multitask = *queue_iterator;
  235. callback_finish_multitask(current_multitask);
  236. // remove this multitask
  237. queue_iterator = queue_multitasks.erase(queue_iterator);
  238. }
  239. else
  240. {
  241. ++queue_iterator;
  242. }
  243. }
  244. // all tasks in the current loop is finished
  245. callback_all_task_finished();
  246. }
  247. LOG_VERBOSE("wait for new task", {});
  248. // wait for new task
  249. {
  250. std::unique_lock<std::mutex> lock(mutex_tasks);
  251. if (queue_tasks.empty()) {
  252. condition_tasks.wait(lock, [&]{
  253. return !queue_tasks.empty();
  254. });
  255. }
  256. }
  257. }
  258. }
  259. //
  260. // functions to manage multitasks
  261. //
  262. // add a multitask by specifying the id of all subtask (subtask is a task_server)
  263. void add_multitask(int multitask_id, std::vector<int>& sub_ids)
  264. {
  265. std::lock_guard<std::mutex> lock(mutex_tasks);
  266. task_multi multi;
  267. multi.id = multitask_id;
  268. std::copy(sub_ids.begin(), sub_ids.end(), std::inserter(multi.subtasks_remaining, multi.subtasks_remaining.end()));
  269. queue_multitasks.push_back(multi);
  270. }
  271. // updatethe remaining subtasks, while appending results to multitask
  272. void update_multitask(int multitask_id, int subtask_id, task_result& result)
  273. {
  274. std::lock_guard<std::mutex> lock(mutex_tasks);
  275. for (auto& multitask : queue_multitasks)
  276. {
  277. if (multitask.id == multitask_id)
  278. {
  279. multitask.subtasks_remaining.erase(subtask_id);
  280. multitask.results.push_back(result);
  281. }
  282. }
  283. }
  284. };
  285. struct llama_server_response {
  286. typedef std::function<void(int, int, task_result&)> callback_multitask_t;
  287. callback_multitask_t callback_update_multitask;
  288. // for keeping track of all tasks waiting for the result
  289. std::set<int> waiting_task_ids;
  290. // the main result queue
  291. std::vector<task_result> queue_results;
  292. std::mutex mutex_results;
  293. std::condition_variable condition_results;
  294. void add_waiting_task_id(int task_id) {
  295. std::unique_lock<std::mutex> lock(mutex_results);
  296. waiting_task_ids.insert(task_id);
  297. }
  298. void remove_waiting_task_id(int task_id) {
  299. std::unique_lock<std::mutex> lock(mutex_results);
  300. waiting_task_ids.erase(task_id);
  301. }
  302. // This function blocks the thread until there is a response for this task_id
  303. task_result recv(int task_id) {
  304. while (true)
  305. {
  306. std::unique_lock<std::mutex> lock(mutex_results);
  307. condition_results.wait(lock, [&]{
  308. return !queue_results.empty();
  309. });
  310. LOG_VERBOSE("condition_results unblock", {});
  311. for (int i = 0; i < (int) queue_results.size(); i++)
  312. {
  313. if (queue_results[i].id == task_id)
  314. {
  315. assert(queue_results[i].multitask_id == -1);
  316. task_result res = queue_results[i];
  317. queue_results.erase(queue_results.begin() + i);
  318. return res;
  319. }
  320. }
  321. }
  322. // should never reach here
  323. }
  324. // Register the function to update multitask
  325. void on_multitask_update(callback_multitask_t callback) {
  326. callback_update_multitask = callback;
  327. }
  328. // Send a new result to a waiting task_id
  329. void send(task_result result) {
  330. std::unique_lock<std::mutex> lock(mutex_results);
  331. LOG_VERBOSE("send new result", {});
  332. for (auto& task_id : waiting_task_ids) {
  333. // LOG_TEE("waiting task id %i \n", task_id);
  334. // for now, tasks that have associated parent multitasks just get erased once multitask picks up the result
  335. if (result.multitask_id == task_id)
  336. {
  337. LOG_VERBOSE("callback_update_multitask", {});
  338. callback_update_multitask(task_id, result.id, result);
  339. continue;
  340. }
  341. if (result.id == task_id)
  342. {
  343. LOG_VERBOSE("queue_results.push_back", {});
  344. queue_results.push_back(result);
  345. condition_results.notify_one();
  346. return;
  347. }
  348. }
  349. }
  350. };
  351. //
  352. // base64 utils (TODO: move to common in the future)
  353. //
  354. static const std::string base64_chars =
  355. "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
  356. "abcdefghijklmnopqrstuvwxyz"
  357. "0123456789+/";
  358. static inline bool is_base64(uint8_t c)
  359. {
  360. return (isalnum(c) || (c == '+') || (c == '/'));
  361. }
  362. static inline std::vector<uint8_t> base64_decode(const std::string & encoded_string)
  363. {
  364. int i = 0;
  365. int j = 0;
  366. int in_ = 0;
  367. int in_len = encoded_string.size();
  368. uint8_t char_array_4[4];
  369. uint8_t char_array_3[3];
  370. std::vector<uint8_t> ret;
  371. while (in_len-- && (encoded_string[in_] != '=') && is_base64(encoded_string[in_]))
  372. {
  373. char_array_4[i++] = encoded_string[in_]; in_++;
  374. if (i == 4)
  375. {
  376. for (i = 0; i <4; i++)
  377. {
  378. char_array_4[i] = base64_chars.find(char_array_4[i]);
  379. }
  380. char_array_3[0] = ((char_array_4[0] ) << 2) + ((char_array_4[1] & 0x30) >> 4);
  381. char_array_3[1] = ((char_array_4[1] & 0xf) << 4) + ((char_array_4[2] & 0x3c) >> 2);
  382. char_array_3[2] = ((char_array_4[2] & 0x3) << 6) + char_array_4[3];
  383. for (i = 0; (i < 3); i++)
  384. {
  385. ret.push_back(char_array_3[i]);
  386. }
  387. i = 0;
  388. }
  389. }
  390. if (i)
  391. {
  392. for (j = i; j <4; j++)
  393. {
  394. char_array_4[j] = 0;
  395. }
  396. for (j = 0; j <4; j++)
  397. {
  398. char_array_4[j] = base64_chars.find(char_array_4[j]);
  399. }
  400. char_array_3[0] = ((char_array_4[0] ) << 2) + ((char_array_4[1] & 0x30) >> 4);
  401. char_array_3[1] = ((char_array_4[1] & 0xf) << 4) + ((char_array_4[2] & 0x3c) >> 2);
  402. char_array_3[2] = ((char_array_4[2] & 0x3) << 6) + char_array_4[3];
  403. for (j = 0; (j < i - 1); j++)
  404. {
  405. ret.push_back(char_array_3[j]);
  406. }
  407. }
  408. return ret;
  409. }
  410. //
  411. // random string / id
  412. //
  413. static std::string random_string()
  414. {
  415. static const std::string str("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz");
  416. std::random_device rd;
  417. std::mt19937 generator(rd());
  418. std::string result(32, ' ');
  419. for (int i = 0; i < 32; ++i) {
  420. result[i] = str[generator() % str.size()];
  421. }
  422. return result;
  423. }
  424. static std::string gen_chatcmplid()
  425. {
  426. std::stringstream chatcmplid;
  427. chatcmplid << "chatcmpl-" << random_string();
  428. return chatcmplid.str();
  429. }