| /third_party/mesa3d/src/util/ |
| H A D | u_queue.c | 47 util_queue_kill_threads(struct util_queue *queue, unsigned keep_num_threads,
82 add_to_atexit_list(struct util_queue *queue) in add_to_atexit_list() argument
87 list_add(&queue->head, &queue_list); in add_to_atexit_list()
92 remove_from_atexit_list(struct util_queue *queue) in remove_from_atexit_list() argument
98 if (iter == queue) { in remove_from_atexit_list()
242 struct util_queue *queue; member
249 struct util_queue *queue = ((struct thread_input*)input)->queue; in util_queue_thread_func() local
254 if (queue->flags & UTIL_QUEUE_INIT_SET_FULL_THREAD_AFFINITY) { in util_queue_thread_func()
267 if (queue in util_queue_thread_func()
333 util_queue_create_thread(struct util_queue *queue, unsigned index) util_queue_create_thread() argument
363 util_queue_adjust_num_threads(struct util_queue *queue, unsigned num_threads) util_queue_adjust_num_threads() argument
398 util_queue_init(struct util_queue *queue, const char *name, unsigned max_jobs, unsigned num_threads, unsigned flags, void *global_data) util_queue_init() argument
489 util_queue_kill_threads(struct util_queue *queue, unsigned keep_num_threads, bool finish_locked) util_queue_kill_threads() argument
528 util_queue_destroy(struct util_queue *queue) util_queue_destroy() argument
545 util_queue_add_job(struct util_queue *queue, void *job, struct util_queue_fence *fence, util_queue_execute_func execute, util_queue_execute_func cleanup, const size_t job_size) util_queue_add_job() argument
639 util_queue_drop_job(struct util_queue *queue, struct util_queue_fence *fence) util_queue_drop_job() argument
671 util_queue_finish(struct util_queue *queue) util_queue_finish() argument
707 util_queue_get_thread_time_nano(struct util_queue *queue, unsigned thread_index) util_queue_get_thread_time_nano() argument
[all...] |
| H A D | u_vector.h | 25 * u_vector is a vector based queue for storing arbitrary
57 int u_vector_init_pow2(struct u_vector *queue,
61 void *u_vector_add(struct u_vector *queue);
62 void *u_vector_remove(struct u_vector *queue);
65 u_vector_init(struct u_vector *queue, in u_vector_init() argument
71 return u_vector_init_pow2(queue, initial_element_count, element_size); in u_vector_init()
75 u_vector_length(struct u_vector *queue) in u_vector_length() argument
77 return (queue->head - queue->tail) / queue in u_vector_length()
96 u_vector_finish(struct u_vector *queue) u_vector_finish() argument
[all...] |
| /third_party/node/test/parallel/ |
| H A D | test-priority-queue.js | 10 // Checks that the queue is fundamentally correct.
11 const queue = new PriorityQueue();
13 queue.insert(i);
16 assert.strictEqual(queue.peek(), i);
17 assert.strictEqual(queue.shift(), i);
20 assert.strictEqual(queue.shift(), undefined);
24 queue.insert(i);
27 assert.strictEqual(queue.shift(), i);
30 assert.strictEqual(queue.shift(), undefined);
34 // Checks that the queue i
[all...] |
| /third_party/skia/third_party/externals/dawn/src/tests/unittests/ |
| H A D | SerialQueueTests.cpp | 24 TestSerialQueue queue; in TEST() local
27 ASSERT_TRUE(queue.Empty()); in TEST()
29 // Iterating on empty queue 1) works 2) doesn't produce any values in TEST()
30 for (int value : queue.IterateAll()) { in TEST()
36 queue.Enqueue(1, 0); in TEST()
37 queue.Enqueue(2, 0); in TEST()
38 queue.Enqueue(std::move(3), 1); in TEST()
40 // Iterating over a non-empty queue produces the expected result in TEST()
42 for (int value : queue.IterateAll()) { in TEST()
49 // Clear works and makes the queue empt in TEST()
61 TestSerialQueue queue; TEST() local
82 TestSerialQueue queue; TEST() local
104 TestSerialQueue queue; TEST() local
128 TestSerialQueue queue; TEST() local
150 TestSerialQueue queue; TEST() local
[all...] |
| /third_party/mesa3d/src/gallium/drivers/llvmpipe/ |
| H A D | lp_scene_queue.c | 30 * Scene queue. We'll use two queues. One contains "full" scenes which
47 * A queue of scenes
57 * to index the array, we use them modulo the queue size. This scheme
58 * works because the queue size is a power of two.
66 /** Allocate a new scene queue */
70 /* Circular queue behavior depends on size being a power of two. */ in lp_scene_queue_create()
74 struct lp_scene_queue *queue = CALLOC_STRUCT(lp_scene_queue); in lp_scene_queue_create() local
76 if (!queue) in lp_scene_queue_create()
79 (void) mtx_init(&queue->mutex, mtx_plain); in lp_scene_queue_create()
80 cnd_init(&queue in lp_scene_queue_create()
88 lp_scene_queue_destroy(struct lp_scene_queue *queue) lp_scene_queue_destroy() argument
98 lp_scene_dequeue(struct lp_scene_queue *queue, boolean wait) lp_scene_dequeue() argument
124 lp_scene_enqueue(struct lp_scene_queue *queue, struct lp_scene *scene) lp_scene_enqueue() argument
[all...] |
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| H A D | test-priority-queue.cc | 28 #include "hb-priority-queue.hh"
33 hb_priority_queue_t queue; in test_insert() local
34 assert (queue.is_empty ()); in test_insert()
36 queue.insert (10, 0); in test_insert()
37 assert (!queue.is_empty ()); in test_insert()
38 assert (queue.minimum () == hb_pair (10, 0)); in test_insert()
40 queue.insert (20, 1); in test_insert()
41 assert (queue.minimum () == hb_pair (10, 0)); in test_insert()
43 queue.insert (5, 2); in test_insert()
44 assert (queue in test_insert()
56 hb_priority_queue_t queue; test_extract() local
79 hb_priority_queue_t queue; test_extract_empty() local
[all...] |
| /third_party/mesa3d/src/vulkan/runtime/ |
| H A D | vk_queue.c | 47 vk_queue_start_submit_thread(struct vk_queue *queue);
50 vk_queue_init(struct vk_queue *queue, struct vk_device *device, in vk_queue_init() argument
57 memset(queue, 0, sizeof(*queue)); in vk_queue_init()
58 vk_object_base_init(device, &queue->base, VK_OBJECT_TYPE_QUEUE); in vk_queue_init()
60 list_addtail(&queue->link, &device->queues); in vk_queue_init()
62 queue->flags = pCreateInfo->flags; in vk_queue_init()
63 queue->queue_family_index = pCreateInfo->queueFamilyIndex; in vk_queue_init()
66 queue->index_in_family = index_in_family; in vk_queue_init()
68 queue in vk_queue_init()
114 _vk_queue_set_lost(struct vk_queue *queue, const char *file, int line, const char *msg, ...) _vk_queue_set_lost() argument
141 vk_queue_submit_alloc(struct vk_queue *queue, uint32_t wait_count, uint32_t command_buffer_count, uint32_t buffer_bind_count, uint32_t image_opaque_bind_count, uint32_t image_bind_count, uint32_t bind_entry_count, uint32_t image_bind_entry_count, uint32_t signal_count, VkSparseMemoryBind **bind_entries, VkSparseImageMemoryBind **image_bind_entries) vk_queue_submit_alloc() argument
210 vk_queue_submit_cleanup(struct vk_queue *queue, struct vk_queue_submit *submit) vk_queue_submit_cleanup() argument
241 vk_queue_submit_free(struct vk_queue *queue, struct vk_queue_submit *submit) vk_queue_submit_free() argument
248 vk_queue_submit_destroy(struct vk_queue *queue, struct vk_queue_submit *submit) vk_queue_submit_destroy() argument
256 vk_queue_push_submit(struct vk_queue *queue, struct vk_queue_submit *submit) vk_queue_push_submit() argument
266 vk_queue_drain(struct vk_queue *queue) vk_queue_drain() argument
289 vk_queue_submit_final(struct vk_queue *queue, struct vk_queue_submit *submit) vk_queue_submit_final() argument
396 vk_queue_flush(struct vk_queue *queue, uint32_t *submit_count_out) vk_queue_flush() argument
459 struct vk_queue *queue = _data; vk_queue_submit_thread_func() local
519 vk_queue_start_submit_thread(struct vk_queue *queue) vk_queue_start_submit_thread() argument
537 vk_queue_stop_submit_thread(struct vk_queue *queue) vk_queue_stop_submit_thread() argument
554 vk_queue_enable_submit_thread(struct vk_queue *queue) vk_queue_enable_submit_thread() argument
595 vk_queue_submit(struct vk_queue *queue, const struct vulkan_submit_info *info) vk_queue_submit() argument
1002 vk_queue_wait_before_present(struct vk_queue *queue, const VkPresentInfoKHR *pPresentInfo) vk_queue_wait_before_present() argument
1063 vk_queue_signal_sync(struct vk_queue *queue, struct vk_sync *sync, uint32_t signal_value) vk_queue_signal_sync() argument
1100 vk_queue_finish(struct vk_queue *queue) vk_queue_finish() argument
[all...] |
| H A D | vk_queue.h | 57 /* Which queue this is within the queue family */
60 /** Driver queue submit hook
69 * called by the runtime concurrently on the same queue.
71 VkResult (*driver_submit)(struct vk_queue *queue,
77 * This represents the exact current submit mode for this specific queue
81 * `VK_QUEUE_SUBMIT_MODE_THREADED_ON_DEMAND`, the queue submit mode
84 * thread is currently running for this queue. If the device submit
85 * mode is `VK_QUEUE_SUBMIT_MODE_DEFERRED`, every queue in the device
102 /* Only set once atomically by the queue */
161 vk_queue_is_empty(struct vk_queue *queue) vk_queue_is_empty() argument
189 vk_queue_is_lost(struct vk_queue *queue) vk_queue_is_lost() argument
[all...] |
| /third_party/mesa3d/src/gallium/drivers/virgl/ |
| H A D | virgl_transfer_queue.c | 44 typedef void (*list_action_t)(struct virgl_transfer_queue *queue,
140 virgl_transfer_queue_find_overlap(const struct virgl_transfer_queue *queue, in virgl_transfer_queue_find_overlap() argument
147 LIST_FOR_EACH_ENTRY(xfer, &queue->transfer_list, queue_link) { in virgl_transfer_queue_find_overlap()
162 static void remove_transfer(struct virgl_transfer_queue *queue, in remove_transfer() argument
166 virgl_resource_destroy_transfer(queue->vctx, queued); in remove_transfer()
169 static void replace_unmapped_transfer(struct virgl_transfer_queue *queue, in replace_unmapped_transfer() argument
178 remove_transfer(queue, queued); in replace_unmapped_transfer()
179 queue->num_dwords -= (VIRGL_TRANSFER3D_SIZE + 1); in replace_unmapped_transfer()
182 static void transfer_put(struct virgl_transfer_queue *queue, in transfer_put() argument
187 queue in transfer_put()
195 transfer_write(struct virgl_transfer_queue *queue, struct list_action_args *args) transfer_write() argument
208 compare_and_perform_action(struct virgl_transfer_queue *queue, struct list_iteration_args *iter) compare_and_perform_action() argument
226 perform_action(struct virgl_transfer_queue *queue, struct list_iteration_args *iter) perform_action() argument
241 add_internal(struct virgl_transfer_queue *queue, struct virgl_transfer *transfer) add_internal() argument
264 virgl_transfer_queue_init(struct virgl_transfer_queue *queue, struct virgl_context *vctx) virgl_transfer_queue_init() argument
282 virgl_transfer_queue_fini(struct virgl_transfer_queue *queue) virgl_transfer_queue_fini() argument
301 virgl_transfer_queue_unmap(struct virgl_transfer_queue *queue, struct virgl_transfer *transfer) virgl_transfer_queue_unmap() argument
322 virgl_transfer_queue_clear(struct virgl_transfer_queue *queue, struct virgl_cmd_buf *cbuf) virgl_transfer_queue_clear() argument
348 virgl_transfer_queue_is_queued(struct virgl_transfer_queue *queue, struct virgl_transfer *transfer) virgl_transfer_queue_is_queued() argument
359 virgl_transfer_queue_extend_buffer(struct virgl_transfer_queue *queue, const struct virgl_hw_res *hw_res, unsigned offset, unsigned size, const void *data) virgl_transfer_queue_extend_buffer() argument
[all...] |
| /third_party/ffmpeg/libavfilter/ |
| H A D | bufferqueue.h | 2 * Generic buffer queue
26 * FFBufQueue: simple AVFrame queue API
28 * Note: this API is not thread-safe. Concurrent access to the same queue
33 * Maximum size of the queue.
47 * Structure holding the queue
50 AVFrame *queue[FF_BUFQUEUE_SIZE]; member
55 #define BUCKET(i) queue->queue[(queue->head + (i)) % FF_BUFQUEUE_SIZE]
58 * Test if a buffer queue i
60 ff_bufqueue_is_full(struct FFBufQueue *queue) ff_bufqueue_is_full() argument
71 ff_bufqueue_add(void *log, struct FFBufQueue *queue, AVFrame *buf) ff_bufqueue_add() argument
87 ff_bufqueue_peek(struct FFBufQueue *queue, unsigned index) ff_bufqueue_peek() argument
98 ff_bufqueue_get(struct FFBufQueue *queue) ff_bufqueue_get() argument
111 ff_bufqueue_discard_all(struct FFBufQueue *queue) ff_bufqueue_discard_all() argument
[all...] |
| /third_party/nghttp2/lib/ |
| H A D | nghttp2_queue.c | 30 void nghttp2_queue_init(nghttp2_queue *queue) { in nghttp2_queue_init() argument
31 queue->front = queue->back = NULL; in nghttp2_queue_init()
34 void nghttp2_queue_free(nghttp2_queue *queue) { in nghttp2_queue_free() argument
35 if (!queue) { in nghttp2_queue_free()
38 nghttp2_queue_cell *p = queue->front; in nghttp2_queue_free()
47 int nghttp2_queue_push(nghttp2_queue *queue, void *data) { in nghttp2_queue_push() argument
55 if (queue->back) { in nghttp2_queue_push()
56 queue->back->next = new_cell; in nghttp2_queue_push()
57 queue in nghttp2_queue_push()
65 nghttp2_queue_pop(nghttp2_queue *queue) nghttp2_queue_pop() argument
75 nghttp2_queue_front(nghttp2_queue *queue) nghttp2_queue_front() argument
80 nghttp2_queue_back(nghttp2_queue *queue) nghttp2_queue_back() argument
85 nghttp2_queue_empty(nghttp2_queue *queue) nghttp2_queue_empty() argument
[all...] |
| /third_party/node/deps/nghttp2/lib/ |
| H A D | nghttp2_queue.c | 30 void nghttp2_queue_init(nghttp2_queue *queue) { in nghttp2_queue_init() argument
31 queue->front = queue->back = NULL; in nghttp2_queue_init()
34 void nghttp2_queue_free(nghttp2_queue *queue) { in nghttp2_queue_free() argument
35 if (!queue) { in nghttp2_queue_free()
38 nghttp2_queue_cell *p = queue->front; in nghttp2_queue_free()
47 int nghttp2_queue_push(nghttp2_queue *queue, void *data) { in nghttp2_queue_push() argument
55 if (queue->back) { in nghttp2_queue_push()
56 queue->back->next = new_cell; in nghttp2_queue_push()
57 queue in nghttp2_queue_push()
65 nghttp2_queue_pop(nghttp2_queue *queue) nghttp2_queue_pop() argument
75 nghttp2_queue_front(nghttp2_queue *queue) nghttp2_queue_front() argument
80 nghttp2_queue_back(nghttp2_queue *queue) nghttp2_queue_back() argument
85 nghttp2_queue_empty(nghttp2_queue *queue) nghttp2_queue_empty() argument
[all...] |
| /third_party/benchmark/test/ |
| H A D | benchmark_random_interleaving_gtest.cc | 1 #include <queue>
20 class EventQueue : public std::queue<std::string> {
37 EventQueue* queue = new EventQueue(); member
47 static void SetupHook(int /* num_threads */) { queue->push("Setup"); } in SetupHook()
49 static void TeardownHook(int /* num_threads */) { queue->push("Teardown"); } in TeardownHook()
52 queue->Clear(); in Execute()
58 queue->Put("DONE"); // End marker in Execute()
67 queue->Put(StrFormat("BM_Match1/%d", static_cast<int>(arg))); in BM_Match1()
80 ASSERT_EQ("BM_Match1/1", queue->Get()); in TEST_F()
81 ASSERT_EQ("BM_Match1/2", queue in TEST_F()
[all...] |
| /third_party/mesa3d/src/intel/vulkan/ |
| H A D | anv_queue.c | 31 anv_queue_init(struct anv_device *device, struct anv_queue *queue, in anv_queue_init() argument
39 result = vk_queue_init(&queue->vk, &device->vk, pCreateInfo, in anv_queue_init()
47 0, 0, &queue->sync); in anv_queue_init()
49 vk_queue_finish(&queue->vk); in anv_queue_init()
54 queue->vk.driver_submit = anv_queue_submit; in anv_queue_init()
56 queue->device = device; in anv_queue_init()
58 assert(queue->vk.queue_family_index < pdevice->queue.family_count); in anv_queue_init()
59 queue->family = &pdevice->queue in anv_queue_init()
69 anv_queue_finish(struct anv_queue *queue) anv_queue_finish() argument
[all...] |
| /third_party/mesa3d/src/vulkan/wsi/ |
| H A D | wsi_common_queue.h | 38 wsi_queue_init(struct wsi_queue *queue, int length) in wsi_queue_init() argument
45 ret = u_vector_init(&queue->vector, length, sizeof(uint32_t)); in wsi_queue_init()
58 ret = pthread_cond_init(&queue->cond, &condattr); in wsi_queue_init()
62 ret = pthread_mutex_init(&queue->mutex, NULL); in wsi_queue_init()
70 pthread_cond_destroy(&queue->cond); in wsi_queue_init()
74 u_vector_finish(&queue->vector); in wsi_queue_init()
80 wsi_queue_destroy(struct wsi_queue *queue) in wsi_queue_destroy() argument
82 u_vector_finish(&queue->vector); in wsi_queue_destroy()
83 pthread_mutex_destroy(&queue->mutex); in wsi_queue_destroy()
84 pthread_cond_destroy(&queue in wsi_queue_destroy()
88 wsi_queue_push(struct wsi_queue *queue, uint32_t index) wsi_queue_push() argument
107 wsi_queue_pull(struct wsi_queue *queue, uint32_t *index, uint64_t timeout) wsi_queue_pull() argument
[all...] |
| /third_party/mesa3d/src/broadcom/vulkan/ |
| H A D | v3dv_queue.c | 74 queue_wait_idle(struct v3dv_queue *queue, in queue_wait_idle() argument
77 if (queue->device->pdevice->caps.multisync) { in queue_wait_idle()
78 int ret = drmSyncobjWait(queue->device->pdevice->render_fd, in queue_wait_idle()
79 queue->last_job_syncs.syncs, 3, in queue_wait_idle()
83 return vk_errorf(queue, VK_ERROR_DEVICE_LOST, in queue_wait_idle()
89 if (!queue->last_job_syncs.first[i]) in queue_wait_idle()
94 * per-queue-type syncobj which transitively waited on the semaphores in queue_wait_idle()
98 VkResult result = vk_sync_wait_many(&queue->device->vk, in queue_wait_idle()
110 int ret = drmSyncobjWait(queue->device->pdevice->render_fd, in queue_wait_idle()
111 &queue in queue_wait_idle()
127 handle_reset_query_cpu_job(struct v3dv_queue *queue, struct v3dv_job *job, struct v3dv_submit_sync_info *sync_info) handle_reset_query_cpu_job() argument
169 export_perfmon_last_job_sync(struct v3dv_queue *queue, struct v3dv_job *job, int *fd) export_perfmon_last_job_sync() argument
222 struct v3dv_queue *queue = &job->device->queue; handle_end_query_cpu_job() local
293 handle_set_event_cpu_job(struct v3dv_queue *queue, struct v3dv_job *job, struct v3dv_submit_sync_info *sync_info) handle_set_event_cpu_job() argument
347 handle_copy_buffer_to_image_cpu_job(struct v3dv_queue *queue, struct v3dv_job *job, struct v3dv_submit_sync_info *sync_info) handle_copy_buffer_to_image_cpu_job() argument
400 handle_timestamp_query_cpu_job(struct v3dv_queue *queue, struct v3dv_job *job, struct v3dv_submit_sync_info *sync_info) handle_timestamp_query_cpu_job() argument
432 handle_csd_indirect_cpu_job(struct v3dv_queue *queue, struct v3dv_job *job, struct v3dv_submit_sync_info *sync_info) handle_csd_indirect_cpu_job() argument
465 process_waits(struct v3dv_queue *queue, uint32_t count, struct vk_sync_wait *waits) process_waits() argument
527 process_signals(struct v3dv_queue *queue, uint32_t count, struct vk_sync_signal *signals) process_signals() argument
578 set_in_syncs(struct v3dv_queue *queue, struct v3dv_job *job, enum v3dv_queue_type queue_sync, uint32_t *count, struct v3dv_submit_sync_info *sync_info) set_in_syncs() argument
641 set_out_syncs(struct v3dv_queue *queue, struct v3dv_job *job, enum v3dv_queue_type queue_sync, uint32_t *count, struct v3dv_submit_sync_info *sync_info, bool signal_syncs) set_out_syncs() argument
701 struct v3dv_queue *queue = &device->queue; set_multisync() local
736 handle_cl_job(struct v3dv_queue *queue, struct v3dv_job *job, uint32_t counter_pass_idx, struct v3dv_submit_sync_info *sync_info, bool signal_syncs) handle_cl_job() argument
874 handle_tfu_job(struct v3dv_queue *queue, struct v3dv_job *job, struct v3dv_submit_sync_info *sync_info, bool signal_syncs) handle_tfu_job() argument
916 handle_csd_job(struct v3dv_queue *queue, struct v3dv_job *job, uint32_t counter_pass_idx, struct v3dv_submit_sync_info *sync_info, bool signal_syncs) handle_csd_job() argument
995 queue_handle_job(struct v3dv_queue *queue, struct v3dv_job *job, uint32_t counter_pass_idx, struct v3dv_submit_sync_info *sync_info, bool signal_syncs) queue_handle_job() argument
1030 queue_create_noop_job(struct v3dv_queue *queue) queue_create_noop_job() argument
1052 queue_submit_noop_job(struct v3dv_queue *queue, uint32_t counter_pass_idx, struct v3dv_submit_sync_info *sync_info, bool signal_syncs) queue_submit_noop_job() argument
1072 struct v3dv_queue *queue = container_of(vk_queue, struct v3dv_queue, vk); v3dv_queue_driver_submit() local
[all...] |
| /third_party/ffmpeg/libavformat/ |
| H A D | movenchint.c | 68 * Remove the first sample from the sample queue.
70 static void sample_queue_pop(HintSampleQueue *queue) in sample_queue_pop() argument
72 if (queue->len <= 0) in sample_queue_pop()
74 if (queue->samples[0].own_data) in sample_queue_pop()
75 av_freep(&queue->samples[0].data); in sample_queue_pop()
76 queue->len--; in sample_queue_pop()
77 memmove(queue->samples, queue->samples + 1, sizeof(HintSample)*queue->len); in sample_queue_pop()
81 * Empty the sample queue, releasin
83 sample_queue_free(HintSampleQueue *queue) sample_queue_free() argument
99 sample_queue_push(HintSampleQueue *queue, const uint8_t *data, int size, int sample) sample_queue_push() argument
125 sample_queue_retain(HintSampleQueue *queue) sample_queue_retain() argument
215 find_sample_match(const uint8_t *data, int len, HintSampleQueue *queue, int *pos, int *match_sample, int *match_offset, int *match_len) find_sample_match() argument
282 describe_payload(const uint8_t *data, int size, AVIOContext *out, int *entries, HintSampleQueue *queue) describe_payload() argument
[all...] |
| /third_party/libabigail/src/ |
| H A D | abg-workers.cc | 17 #include <queue>
42 /// The main interface of this pattern is a @ref queue of @ref tasks
43 /// to be performed. Associated to that queue are a set of worker
45 /// until at least one @ref task is added to the queue.
47 /// When a @ref task is added to the @ref queue, one thread is woken
48 /// up, picks the @ref task, removes it from the @ref queue, and
53 /// performed @ref task is added to another queue, named as the "done
54 /// queue". Then the thread looks at the @ref queue of tasks to be
55 /// performed again, and if there is at least one task in that queue,
267 queue::queue() queue() function in abigail::workers::queue
275 queue::queue(unsigned number_of_workers) queue() function in abigail::workers::queue
291 queue::queue(unsigned number_of_workers, queue() function in abigail::workers::queue
[all...] |
| /third_party/mesa3d/src/intel/ds/ |
| H A D | intel_driver_ds.cc | 194 struct intel_ds_queue *queue; in send_descriptors() local
199 u_vector_foreach(queue, &device->queues) { in send_descriptors()
200 for (uint32_t s = 0; s < ARRAY_SIZE(queue->stages); s++) { in send_descriptors()
201 queue->stages[s].start_ns = 0; in send_descriptors()
230 /* Emit all the IID picked at device/queue creation. */ in send_descriptors()
231 u_vector_foreach(queue, &device->queues) { in send_descriptors()
240 queue->name, s, intel_queue_stage_desc[s].name); in send_descriptors()
243 desc->set_iid(queue->stages[s].queue_iid); in send_descriptors()
248 desc->set_iid(queue->stages[s].stage_iid); in send_descriptors()
262 begin_event(struct intel_ds_queue *queue, uint64_ argument
278 end_event(struct intel_ds_queue *queue, uint64_t ts_ns, enum intel_ds_queue_stage stage_id, uint32_t submission_id, const void* payload = nullptr, trace_payload_as_extra_func payload_as_extra = nullptr) end_event() argument
447 intel_ds_begin_submit(struct intel_ds_queue *queue) intel_ds_begin_submit() argument
453 intel_ds_end_submit(struct intel_ds_queue *queue, uint64_t start_ts) intel_ds_end_submit() argument
[all...] |
| /third_party/mesa3d/src/gallium/drivers/svga/ |
| H A D | svga_state_tss.c | 82 struct bind_queue *queue) in emit_tex_binding_unit()
130 queue->bind[queue->bind_count].unit = unit; in emit_tex_binding_unit()
131 queue->bind[queue->bind_count].view = view; in emit_tex_binding_unit()
132 queue->bind_count++; in emit_tex_binding_unit()
150 struct bind_queue queue; in update_tss_binding() local
154 queue.bind_count = 0; in update_tss_binding()
162 &queue); in update_tss_binding()
176 &queue); in update_tss_binding()
76 emit_tex_binding_unit(struct svga_context *svga, unsigned unit, const struct svga_sampler_state *s, const struct pipe_sampler_view *sv, struct svga_hw_view_state *view, boolean reemit, struct bind_queue *queue) emit_tex_binding_unit() argument
241 struct bind_queue queue; svga_reemit_tss_bindings() local
357 emit_tss_unit(struct svga_context *svga, unsigned unit, const struct svga_sampler_state *state, struct ts_queue *queue) emit_tss_unit() argument
388 struct ts_queue queue; update_tss() local
[all...] |
| /third_party/skia/third_party/externals/spirv-tools/source/fuzz/ |
| H A D | call_graph.cpp | 17 #include <queue>
105 // Populate a queue with all those function ids with in-degree zero. in ComputeTopologicalOrderOfFunctions()
106 std::queue<uint32_t> queue; in ComputeTopologicalOrderOfFunctions() local
109 queue.push(entry.first); in ComputeTopologicalOrderOfFunctions()
113 // Pop ids from the queue, adding them to the sorted order and decreasing the in ComputeTopologicalOrderOfFunctions()
115 // gets added to the queue. in ComputeTopologicalOrderOfFunctions()
116 while (!queue.empty()) { in ComputeTopologicalOrderOfFunctions()
117 auto next = queue.front(); in ComputeTopologicalOrderOfFunctions()
118 queue in ComputeTopologicalOrderOfFunctions()
167 std::queue<uint32_t> queue; GetIndirectCallees() local
[all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| H A D | call_graph.cpp | 17 #include <queue>
105 // Populate a queue with all those function ids with in-degree zero. in ComputeTopologicalOrderOfFunctions()
106 std::queue<uint32_t> queue; in ComputeTopologicalOrderOfFunctions() local
109 queue.push(entry.first); in ComputeTopologicalOrderOfFunctions()
113 // Pop ids from the queue, adding them to the sorted order and decreasing the in ComputeTopologicalOrderOfFunctions()
115 // gets added to the queue. in ComputeTopologicalOrderOfFunctions()
116 while (!queue.empty()) { in ComputeTopologicalOrderOfFunctions()
117 auto next = queue.front(); in ComputeTopologicalOrderOfFunctions()
118 queue in ComputeTopologicalOrderOfFunctions()
167 std::queue<uint32_t> queue; GetIndirectCallees() local
[all...] |
| /third_party/spirv-tools/source/fuzz/ |
| H A D | call_graph.cpp | 17 #include <queue>
105 // Populate a queue with all those function ids with in-degree zero. in ComputeTopologicalOrderOfFunctions()
106 std::queue<uint32_t> queue; in ComputeTopologicalOrderOfFunctions() local
109 queue.push(entry.first); in ComputeTopologicalOrderOfFunctions()
113 // Pop ids from the queue, adding them to the sorted order and decreasing the in ComputeTopologicalOrderOfFunctions()
115 // gets added to the queue. in ComputeTopologicalOrderOfFunctions()
116 while (!queue.empty()) { in ComputeTopologicalOrderOfFunctions()
117 auto next = queue.front(); in ComputeTopologicalOrderOfFunctions()
118 queue in ComputeTopologicalOrderOfFunctions()
167 std::queue<uint32_t> queue; GetIndirectCallees() local
[all...] |
| /third_party/skia/third_party/externals/dawn/src/dawn_wire/server/ |
| H A D | ServerQueue.cpp | 22 cmd.queue = data->queue; in OnQueueWorkDone()
32 auto* queue = QueueObjects().Get(queueId); in DoQueueOnSubmittedWorkDone() local
33 if (queue == nullptr) { in DoQueueOnSubmittedWorkDone()
38 userdata->queue = ObjectHandle{queueId, queue->generation}; in DoQueueOnSubmittedWorkDone()
42 queue->handle, signalValue, in DoQueueOnSubmittedWorkDone()
55 auto* queue = QueueObjects().Get(queueId); in DoQueueWriteBuffer() local
57 if (queue == nullptr || buffer == nullptr) { in DoQueueWriteBuffer()
62 auto* device = DeviceObjects().Get(queue in DoQueueWriteBuffer()
84 auto* queue = QueueObjects().Get(queueId); DoQueueWriteTexture() local
[all...] |
| /third_party/mesa3d/src/freedreno/decode/ |
| H A D | crashdec-mempool.c | 84 * pushes data onto the appropriate queue, and each queue is pulled in dump_cp_mem_pool()
91 * dynamically in terms of blocks. Each queue is represented as a in dump_cp_mem_pool()
131 /* Unfortunately the per-queue state is a little more complicated than in dump_cp_mem_pool()
135 * two end blocks. Thus the queue either looks like this: in dump_cp_mem_pool()
235 /* This seems to be the size of each queue in chunks. */ in dump_cp_mem_pool()
249 for (int queue = 0; queue < num_queues; queue++) { in dump_cp_mem_pool()
252 printf("\tCLUSTER_%s:\n\n", cluster_names[queue]); in dump_cp_mem_pool()
[all...] |