2 * Copyright © 2016 Advanced Micro Devices, Inc.
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:
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.
22 * The above copyright notice and this permission notice (including the
23 * next paragraph) shall be included in all copies or substantial portions
27 /* Job queue with execution in a separate thread.
29 * Jobs can be added from any thread. After that, the wait call can be used
30 * to wait for completion of the job.
38 #include "util/futex.h"
39 #include "util/list.h"
40 #include "util/macros.h"
41 #include "util/os_time.h"
42 #include "util/u_atomic.h"
43 #include "util/u_thread.h"
49 #define UTIL_QUEUE_INIT_USE_MINIMUM_PRIORITY (1 << 0)
50 #define UTIL_QUEUE_INIT_RESIZE_IF_FULL (1 << 1)
52 #if defined(__GNUC__) && defined(HAVE_LINUX_FUTEX_H)
53 #define UTIL_QUEUE_FENCE_FUTEX
55 #define UTIL_QUEUE_FENCE_STANDARD
58 #ifdef UTIL_QUEUE_FENCE_FUTEX
59 /* Job completion fence.
60 * Put this into your job structure.
62 struct util_queue_fence {
63 /* The fence can be in one of three states:
66 * 2 - unsignaled, may have waiters
72 util_queue_fence_init(struct util_queue_fence *fence)
78 util_queue_fence_destroy(struct util_queue_fence *fence)
80 assert(fence->val == 0);
85 util_queue_fence_signal(struct util_queue_fence *fence)
87 uint32_t val = p_atomic_xchg(&fence->val, 0);
92 futex_wake(&fence->val, INT_MAX);
96 * Move \p fence back into unsignalled state.
98 * \warning The caller must ensure that no other thread may currently be
99 * waiting (or about to wait) on the fence.
102 util_queue_fence_reset(struct util_queue_fence *fence)
107 uint32_t v = p_atomic_xchg(&fence->val, 1);
113 util_queue_fence_is_signalled(struct util_queue_fence *fence)
115 return fence->val == 0;
119 #ifdef UTIL_QUEUE_FENCE_STANDARD
120 /* Job completion fence.
121 * Put this into your job structure.
123 struct util_queue_fence {
129 void util_queue_fence_init(struct util_queue_fence *fence);
130 void util_queue_fence_destroy(struct util_queue_fence *fence);
131 void util_queue_fence_signal(struct util_queue_fence *fence);
134 * Move \p fence back into unsignalled state.
136 * \warning The caller must ensure that no other thread may currently be
137 * waiting (or about to wait) on the fence.
140 util_queue_fence_reset(struct util_queue_fence *fence)
142 assert(fence->signalled);
143 fence->signalled = 0;
147 util_queue_fence_is_signalled(struct util_queue_fence *fence)
149 return fence->signalled != 0;
154 _util_queue_fence_wait(struct util_queue_fence *fence);
157 util_queue_fence_wait(struct util_queue_fence *fence)
159 if (unlikely(!util_queue_fence_is_signalled(fence)))
160 _util_queue_fence_wait(fence);
164 _util_queue_fence_wait_timeout(struct util_queue_fence *fence,
165 int64_t abs_timeout);
168 * Wait for the fence to be signaled with a timeout.
170 * \param fence the fence
171 * \param abs_timeout the absolute timeout in nanoseconds, relative to the
172 * clock provided by os_time_get_nano.
174 * \return true if the fence was signaled, false if the timeout occurred.
177 util_queue_fence_wait_timeout(struct util_queue_fence *fence,
180 if (util_queue_fence_is_signalled(fence))
183 if (abs_timeout == (int64_t)OS_TIMEOUT_INFINITE) {
184 _util_queue_fence_wait(fence);
188 return _util_queue_fence_wait_timeout(fence, abs_timeout);
191 typedef void (*util_queue_execute_func)(void *job, int thread_index);
193 struct util_queue_job {
195 struct util_queue_fence *fence;
196 util_queue_execute_func execute;
197 util_queue_execute_func cleanup;
200 /* Put this into your context. */
202 char name[14]; /* 13 characters = the thread name without the index */
203 mtx_t finish_lock; /* only for util_queue_finish */
205 cnd_t has_queued_cond;
206 cnd_t has_space_cond;
210 unsigned num_threads;
213 int write_idx, read_idx; /* ring buffer pointers */
214 struct util_queue_job *jobs;
216 /* for cleanup at exit(), protected by exit_mutex */
217 struct list_head head;
220 bool util_queue_init(struct util_queue *queue,
223 unsigned num_threads,
225 void util_queue_destroy(struct util_queue *queue);
227 /* optional cleanup callback is called after fence is signaled: */
228 void util_queue_add_job(struct util_queue *queue,
230 struct util_queue_fence *fence,
231 util_queue_execute_func execute,
232 util_queue_execute_func cleanup);
233 void util_queue_drop_job(struct util_queue *queue,
234 struct util_queue_fence *fence);
236 void util_queue_finish(struct util_queue *queue);
238 int64_t util_queue_get_thread_time_nano(struct util_queue *queue,
239 unsigned thread_index);
241 /* util_queue needs to be cleared to zeroes for this to work */
243 util_queue_is_initialized(struct util_queue *queue)
245 return queue->threads != NULL;
248 /* Convenient structure for monitoring the queue externally and passing
249 * the structure between Mesa components. The queue doesn't use it directly.
251 struct util_queue_monitoring
253 /* For querying the thread busyness. */
254 struct util_queue *queue;
256 /* Counters updated by the user of the queue. */
257 unsigned num_offloaded_items;
258 unsigned num_direct_items;