server-queue.h 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193
  1. #pragma once
  2. #include "server-task.h"
  3. #include <condition_variable>
  4. #include <deque>
  5. #include <mutex>
  6. #include <unordered_set>
  7. // struct for managing server tasks
  8. // in most cases, use server_response_reader to post new tasks and retrieve results
  9. struct server_queue {
  10. private:
  11. int id = 0;
  12. bool running = false;
  13. bool sleeping = false;
  14. bool req_stop_sleeping = false;
  15. int64_t time_last_task = 0;
  16. // queues
  17. std::deque<server_task> queue_tasks;
  18. std::deque<server_task> queue_tasks_deferred;
  19. std::mutex mutex_tasks;
  20. std::condition_variable condition_tasks;
  21. // callback functions
  22. std::function<void(server_task &&)> callback_new_task;
  23. std::function<void(void)> callback_update_slots;
  24. std::function<void(bool)> callback_sleeping_state;
  25. public:
  26. // Add a new task to the end of the queue
  27. int post(server_task && task, bool front = false);
  28. // multi-task version of post()
  29. int post(std::vector<server_task> && tasks, bool front = false);
  30. // Add a new task, but defer until one slot is available
  31. void defer(server_task && task);
  32. // Get the next id for creating a new task
  33. int get_new_id();
  34. // Call when the state of one slot is changed, it will move one task from deferred to main queue
  35. void pop_deferred_task();
  36. // if sleeping, request exiting sleep state and wait until it is done
  37. // returns immediately if not sleeping
  38. void wait_until_no_sleep();
  39. bool is_sleeping() {
  40. std::unique_lock<std::mutex> lock(mutex_tasks);
  41. return sleeping;
  42. }
  43. // end the start_loop routine
  44. void terminate();
  45. /**
  46. * Main loop consists of these steps:
  47. * - Wait until a new task arrives
  48. * - Process the task (i.e. maybe copy data into slot)
  49. * - Check if multitask is finished
  50. * - Update all slots
  51. *
  52. * Sleeping procedure (disabled if idle_sleep_ms < 0):
  53. * - If there is no task after idle_sleep_ms, enter sleeping state
  54. * - Call callback_sleeping_state(true)
  55. * - Wait until req_stop_sleeping is set to true
  56. * - Call callback_sleeping_state(false)
  57. * - Exit sleeping state
  58. */
  59. void start_loop(int64_t idle_sleep_ms = -1);
  60. // for metrics
  61. size_t queue_tasks_deferred_size() {
  62. std::unique_lock<std::mutex> lock(mutex_tasks);
  63. return queue_tasks_deferred.size();
  64. }
  65. //
  66. // Functions below are not thread-safe, must only be used before start_loop() is called
  67. //
  68. // Register function to process a new task
  69. void on_new_task(std::function<void(server_task &&)> callback) {
  70. callback_new_task = std::move(callback);
  71. }
  72. // Register the function to be called when all slots data is ready to be processed
  73. void on_update_slots(std::function<void(void)> callback) {
  74. callback_update_slots = std::move(callback);
  75. }
  76. // Register callback for sleeping state change
  77. // note: when entering sleeping state, the callback is called AFTER sleeping is set to true
  78. // when leaving sleeping state, the callback is called BEFORE sleeping is set to false
  79. void on_sleeping_state(std::function<void(bool)> callback) {
  80. callback_sleeping_state = std::move(callback);
  81. }
  82. private:
  83. void cleanup_pending_task(int id_target);
  84. };
  85. // struct for managing server responses
  86. // in most cases, use server_response_reader to retrieve results
  87. struct server_response {
  88. private:
  89. bool running = true;
  90. // for keeping track of all tasks waiting for the result
  91. std::unordered_set<int> waiting_task_ids;
  92. // the main result queue (using ptr for polymorphism)
  93. std::vector<server_task_result_ptr> queue_results;
  94. std::mutex mutex_results;
  95. std::condition_variable condition_results;
  96. public:
  97. // add the id_task to the list of tasks waiting for response
  98. void add_waiting_task_id(int id_task);
  99. void add_waiting_tasks(const std::vector<server_task> & tasks);
  100. // when the request is finished, we can remove task associated with it
  101. void remove_waiting_task_id(int id_task);
  102. // remove multiple tasks from waiting list
  103. void remove_waiting_task_ids(const std::unordered_set<int> & id_tasks);
  104. // This function blocks the thread until there is a response for one of the id_tasks
  105. server_task_result_ptr recv(const std::unordered_set<int> & id_tasks);
  106. // same as recv(), but have timeout in seconds
  107. // if timeout is reached, nullptr is returned
  108. server_task_result_ptr recv_with_timeout(const std::unordered_set<int> & id_tasks, int timeout);
  109. // single-task version of recv()
  110. server_task_result_ptr recv(int id_task);
  111. // Send a new result to a waiting id_task
  112. void send(server_task_result_ptr && result);
  113. // terminate the waiting loop
  114. void terminate();
  115. };
  116. // utility class to make working with server_queue and server_response easier
  117. // it provides a generator-like API for server responses
  118. // support pooling connection state and aggregating multiple results
  119. struct server_response_reader {
  120. std::unordered_set<int> id_tasks;
  121. server_queue & queue_tasks;
  122. server_response & queue_results;
  123. size_t received_count = 0;
  124. bool cancelled = false;
  125. int polling_interval_seconds;
  126. // tracking generation state and partial tool calls
  127. // only used by streaming completions
  128. std::vector<task_result_state> states;
  129. // should_stop function will be called each polling_interval_seconds
  130. server_response_reader(server_queue & queue_tasks, server_response & queue_results, int polling_interval_seconds)
  131. : queue_tasks(queue_tasks), queue_results(queue_results), polling_interval_seconds(polling_interval_seconds) {}
  132. ~server_response_reader() {
  133. stop();
  134. }
  135. int get_new_id() {
  136. return queue_tasks.get_new_id();
  137. }
  138. void post_task(server_task && task);
  139. void post_tasks(std::vector<server_task> && tasks);
  140. bool has_next() const;
  141. // return nullptr if should_stop() is true before receiving a result
  142. // note: if one error is received, it will stop further processing and return error result
  143. server_task_result_ptr next(const std::function<bool()> & should_stop);
  144. struct batch_response {
  145. bool is_terminated = false; // if true, indicates that processing was stopped before all results were received
  146. std::vector<server_task_result_ptr> results;
  147. server_task_result_ptr error; // nullptr if no error
  148. };
  149. // aggregate multiple results
  150. batch_response wait_for_all(const std::function<bool()> & should_stop);
  151. void stop();
  152. };