src/util/u_queue.h

   1 /*
   2  * Copyright © 2016 Advanced Micro Devices, Inc.
   3  * All Rights Reserved.
   4  *
   5  * Permission is hereby granted, free of charge, to any person obtaining
   6  * a copy of this software and associated documentation files (the
   7  * "Software"), to deal in the Software without restriction, including
   8  * without limitation the rights to use, copy, modify, merge, publish,
   9  * distribute, sub license, and/or sell copies of the Software, and to
  10  * permit persons to whom the Software is furnished to do so, subject to
  11  * the following conditions:
  12  *
  13  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  14  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
  15  * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  16  * NON-INFRINGEMENT. IN NO EVENT SHALL THE COPYRIGHT HOLDERS, AUTHORS
  17  * AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
  19  * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  20  * USE OR OTHER DEALINGS IN THE SOFTWARE.
  21  *
  22  * The above copyright notice and this permission notice (including the
  23  * next paragraph) shall be included in all copies or substantial portions
  24  * of the Software.
  25  */
  26
  27 /* Job queue with execution in a separate thread.
  28  *
  29  * Jobs can be added from any thread. After that, the wait call can be used
  30  * to wait for completion of the job.
  31  */
  32
  33 #ifndef U_QUEUE_H
  34 #define U_QUEUE_H
  35
  36 #include <string.h>
  37
  38 #include "util/list.h"
  39 #include "util/u_thread.h"
  40
  41 /* Job completion fence.
  42  * Put this into your job structure.
  43  */
  44 struct util_queue_fence {
  45    mtx_t mutex;
  46    cnd_t cond;
  47    int signalled;
  48 };
  49
  50 typedef void (*util_queue_execute_func)(void *job, int thread_index);
  51
  52 struct util_queue_job {
  53    void *job;
  54    struct util_queue_fence *fence;
  55    util_queue_execute_func execute;
  56    util_queue_execute_func cleanup;
  57 };
  58
  59 /* Put this into your context. */
  60 struct util_queue {
  61    const char *name;
  62    mtx_t lock;
  63    cnd_t has_queued_cond;
  64    cnd_t has_space_cond;
  65    thrd_t *threads;
  66    int num_queued;
  67    unsigned num_threads;
  68    int kill_threads;
  69    int max_jobs;
  70    int write_idx, read_idx; /* ring buffer pointers */
  71    struct util_queue_job *jobs;
  72
  73    /* for cleanup at exit(), protected by exit_mutex */
  74    struct list_head head;
  75 };
  76
  77 bool util_queue_init(struct util_queue *queue,
  78                      const char *name,
  79                      unsigned max_jobs,
  80                      unsigned num_threads);
  81 void util_queue_destroy(struct util_queue *queue);
  82 void util_queue_fence_init(struct util_queue_fence *fence);
  83 void util_queue_fence_destroy(struct util_queue_fence *fence);
  84
  85 /* optional cleanup callback is called after fence is signaled: */
  86 void util_queue_add_job(struct util_queue *queue,
  87                         void *job,
  88                         struct util_queue_fence *fence,
  89                         util_queue_execute_func execute,
  90                         util_queue_execute_func cleanup);
  91
  92 void util_queue_fence_wait(struct util_queue_fence *fence);
  93 int64_t util_queue_get_thread_time_nano(struct util_queue *queue,
  94                                         unsigned thread_index);
  95
  96 /* util_queue needs to be cleared to zeroes for this to work */
  97 static inline bool
  98 util_queue_is_initialized(struct util_queue *queue)
  99 {
 100    return queue->threads != NULL;
 101 }
 102
 103 static inline bool
 104 util_queue_fence_is_signalled(struct util_queue_fence *fence)
 105 {
 106    return fence->signalled != 0;
 107 }
 108
 109 #endif