{"id":466282,"date":"2025-07-07T15:27:15","date_gmt":"2025-07-07T15:27:15","guid":{"rendered":"http:\/\/savepearlharbor.com\/?p=466282"},"modified":"-0001-11-30T00:00:00","modified_gmt":"-0001-11-29T21:00:00","slug":"","status":"publish","type":"post","link":"https:\/\/savepearlharbor.com\/?p=466282","title":{"rendered":"\u041e\u043f\u0442\u0438\u043c\u0438\u0437\u0430\u0446\u0438\u044f \u0443\u043f\u0440\u0430\u0432\u043b\u0435\u043d\u0438\u044f \u0437\u0430\u0434\u0430\u0447\u0430\u043c\u0438 \u0432 Zephyr OS \u0441 \u043f\u043e\u043c\u043e\u0449\u044c\u044e Thread Pool<\/span>"},"content":{"rendered":"
<\/div>\n
\n
\n
\n
\n\n

\u0423\u043f\u0440\u0430\u0432\u043b\u044f\u0442\u044c \u043f\u043e\u0442\u043e\u043a\u0430\u043c\u0438 \u0432 C \u0434\u043b\u044f \u043a\u0430\u0436\u0434\u043e\u0439 \u043c\u0435\u043b\u043a\u043e\u0439 \u0437\u0430\u0434\u0430\u0447\u0438 \u2014 \u044d\u0442\u043e \u0431\u043e\u043b\u044c. \ud83d\ude24 \u0414\u0430\u0436\u0435 \u0441\u0430\u043c\u044b\u0435 \u043f\u0440\u043e\u0441\u0442\u044b\u0435 \u0437\u0430\u0434\u0430\u0447\u0438 \u0432\u044b\u043d\u0443\u0436\u0434\u0430\u044e\u0442 \u0432\u043e\u0437\u0438\u0442\u044c\u0441\u044f \u0441 k_thread_create<\/code>, \u0436\u0434\u0430\u0442\u044c \u0437\u0430\u0432\u0435\u0440\u0448\u0435\u043d\u0438\u044f, \u0447\u0438\u0441\u0442\u0438\u0442\u044c \u0440\u0435\u0441\u0443\u0440\u0441\u044b \u2014 \u0438 \u0432\u0441\u0451 \u044d\u0442\u043e \u043f\u0440\u0435\u0432\u0440\u0430\u0449\u0430\u0435\u0442 \u0442\u0432\u043e\u0439 \u043a\u043e\u0434 \u0432 \u0431\u0435\u0441\u043a\u043e\u043d\u0435\u0447\u043d\u0443\u044e \u0433\u043e\u043b\u043e\u0432\u043d\u0443\u044e \u0431\u043e\u043b\u044c. \ud83e\udd2c<\/p>\n

\u041a \u0441\u0447\u0430\u0441\u0442\u044c\u044e, \u0432 Zephyr OS \u0435\u0441\u0442\u044c \u0441\u043f\u0430\u0441\u0435\u043d\u0438\u0435 \u2014 Thread Pool<\/strong>: \u043d\u0430\u0431\u043e\u0440 \u0437\u0430\u0440\u0430\u043d\u0435\u0435 \u0432\u044b\u0434\u0435\u043b\u0435\u043d\u043d\u044b\u0445 \u043f\u043e\u0442\u043e\u043a\u043e\u0432, \u043a\u043e\u0442\u043e\u0440\u044b\u0435 \u0431\u0435\u0440\u0443\u0442 \u0437\u0430\u0434\u0430\u0447\u0438 \u0438\u0437 \u043e\u0447\u0435\u0440\u0435\u0434\u0438 \u0438 \u0432\u044b\u043f\u043e\u043b\u043d\u044f\u044e\u0442 \u0438\u0445 \u0431\u0435\u0437 \u043b\u0438\u0448\u043d\u0435\u0433\u043e \u043c\u0443\u0441\u043e\u0440\u0430. \u042d\u0442\u043e\u0442 \u043f\u043e\u0434\u0445\u043e\u0434 \u044d\u043a\u043e\u043d\u043e\u043c\u0438\u0442 \u0440\u0435\u0441\u0443\u0440\u0441\u044b, \u0432\u0440\u0435\u043c\u044f \u0438 \u0442\u0432\u043e\u044e \u043d\u0435\u0440\u0432\u043d\u0443\u044e \u0441\u0438\u0441\u0442\u0435\u043c\u0443.<\/p>\n\n

\ud83d\udee0\ufe0f \u041f\u0440\u0430\u043a\u0442\u0438\u0447\u0435\u0441\u043a\u0430\u044f \u0440\u0435\u0430\u043b\u0438\u0437\u0430\u0446\u0438\u044f Thread Pool \u0432 Zephyr OS<\/h3>\n

\u041d\u0438\u0436\u0435 \u2014 \u043f\u0440\u0438\u043c\u0435\u0440 \u043c\u0438\u043d\u0438\u043c\u0430\u043b\u0438\u0441\u0442\u0438\u0447\u043d\u043e\u0439 \u0440\u0435\u0430\u043b\u0438\u0437\u0430\u0446\u0438\u0438 \u043d\u0430 C, \u0433\u043e\u0442\u043e\u0432\u044b\u0439 \u0434\u043b\u044f \u0438\u0441\u043f\u043e\u043b\u044c\u0437\u043e\u0432\u0430\u043d\u0438\u044f \u0432 Zephyr:<\/p>\n

#include <zephyr\/kernel.h> #include <zephyr\/sys\/printk.h> #include <zephyr\/sys\/ring_buffer.h>  #define THREAD_POOL_SIZE 4 #define STACK_SIZE       1024 #define QUEUE_SIZE       32  struct task {     void(func)(void);     void *arg; };  struct thread_pool {     struct k_thread threads[THREAD_POOL_SIZE];     struct k_sem task_sem;     struct ring_buf task_queue;     uint8_t task_buffer[QUEUE_SIZE * sizeof(struct task)];     bool stop; };  K_THREAD_STACK_ARRAY_DEFINE(thread_stacks, THREAD_POOL_SIZE, STACK_SIZE);  void worker_thread(void *pool_ptr, void *unused1, void *unused2) {     struct thread_pool *pool = (struct thread_pool *)pool_ptr;     struct task task;      while (true) {         k_sem_take(&pool->task_sem, K_FOREVER);          if (pool->stop && ring_buf_is_empty(&pool->task_queue)) {             break;         }          uint32_t bytes = ring_buf_get(&pool->task_queue, &task, sizeof(task));         if (bytes == sizeof(task)) {             task.func(task.arg);         }     } }  void thread_pool_init(struct thread_pool *pool) {     ring_buf_init(&pool->task_queue, QUEUE_SIZE * sizeof(struct task), pool->task_buffer);     k_sem_init(&pool->task_sem, 0, QUEUE_SIZE);     pool->stop = false;      for (int i = 0; i < THREAD_POOL_SIZE; i++) {         k_thread_create(&pool->threads[i], thread_stacks[i], STACK_SIZE, worker_thread, pool, NULL, NULL,                         K_PRIO_PREEMPT(5), 0, K_NO_WAIT);     } }  void thread_pool_enqueue(struct thread_pool *pool, void(func)(void), void *arg) {     struct task task = {.func = func, .arg = arg};     if (ring_buf_put(&pool->task_queue, &task, sizeof(task)) == sizeof(task)) {         k_sem_give(&pool->task_sem);     } }  void thread_pool_destroy(struct thread_pool *pool) {     pool->stop = true;     for (int i = 0; i < THREAD_POOL_SIZE; i++) {         k_sem_give(&pool->task_sem);     }     for (int i = 0; i < THREAD_POOL_SIZE; i++) {         k_thread_join(&pool->threads[i], K_FOREVER);     } }  void sample_task(void *arg) {     int task_id = *(int *)arg;     printk(\"Task %d running on thread %p\\n\", task_id, k_current_get());     k_msleep(100); }  int main(void) {     struct thread_pool pool;     thread_pool_init(&pool);      int task_ids[5] = {0, 1, 2, 3, 4};     for (int i = 0; i < 5; i++) {         thread_pool_enqueue(&pool, sample_task, &task_ids[i]);     }      k_msleep(1000);     thread_pool_destroy(&pool);     return 0; } <\/code><\/pre>\n\n
\u2699\ufe0f \u041a\u0430\u043a \u044d\u0442\u043e \u0440\u0430\u0431\u043e\u0442\u0430\u0435\u0442<\/h3>\n