| /third_party/gstreamer/gstreamer/plugins/elements/ |
| D | gstqueue2.c | 109 #define QUEUE_IS_USING_TEMP_FILE(queue) ((queue)->temp_template != NULL) argument
110 #define QUEUE_IS_USING_RING_BUFFER(queue) ((queue)->ring_buffer_max_size != 0) /* for consistency … argument
111 #define QUEUE_IS_USING_QUEUE(queue) (!QUEUE_IS_USING_TEMP_FILE(queue) && !QUEUE_IS_USING_RING_BUFFE… argument
113 #define QUEUE_MAX_BYTES(queue) MIN((queue)->max_level.bytes, (queue)->ring_buffer_max_size) argument
190 #define STATUS(queue, pad, msg) \ argument
191 GST_CAT_LOG_OBJECT (queue_dataflow, queue, \
196 queue->cur_level.buffers, \
197 queue->max_level.buffers, \
198 queue->cur_level.bytes, \
199 queue->max_level.bytes, \
[all …]
|
| D | gstqueue.c | 82 #define STATUS(queue, pad, msg) \ argument
83 GST_CAT_LOG_OBJECT (queue_dataflow, queue, \
88 queue->cur_level.buffers, \
89 queue->min_threshold.buffers, \
90 queue->max_size.buffers, \
91 queue->cur_level.bytes, \
92 queue->min_threshold.bytes, \
93 queue->max_size.bytes, \
94 queue->cur_level.time, \
95 queue->min_threshold.time, \
[all …]
|
| /third_party/glib/glib/ |
| D | gqueue.c | 86 g_queue_free (GQueue *queue) in g_queue_free() argument
88 g_return_if_fail (queue != NULL); in g_queue_free()
90 g_list_free (queue->head); in g_queue_free()
91 g_slice_free (GQueue, queue); in g_queue_free()
108 g_queue_free_full (GQueue *queue, in g_queue_free_full() argument
111 g_queue_foreach (queue, (GFunc) free_func, NULL); in g_queue_free_full()
112 g_queue_free (queue); in g_queue_free_full()
127 g_queue_init (GQueue *queue) in g_queue_init() argument
129 g_return_if_fail (queue != NULL); in g_queue_init()
131 queue->head = queue->tail = NULL; in g_queue_init()
[all …]
|
| D | gasyncqueue.c | 99 GQueue queue; member
139 GAsyncQueue *queue; in g_async_queue_new_full() local
141 queue = g_new (GAsyncQueue, 1); in g_async_queue_new_full()
142 g_mutex_init (&queue->mutex); in g_async_queue_new_full()
143 g_cond_init (&queue->cond); in g_async_queue_new_full()
144 g_queue_init (&queue->queue); in g_async_queue_new_full()
145 queue->waiting_threads = 0; in g_async_queue_new_full()
146 queue->ref_count = 1; in g_async_queue_new_full()
147 queue->item_free_func = item_free_func; in g_async_queue_new_full()
149 return queue; in g_async_queue_new_full()
[all …]
|
| D | gqueue.h | 75 void g_queue_free (GQueue *queue);
77 void g_queue_free_full (GQueue *queue,
80 void g_queue_init (GQueue *queue);
82 void g_queue_clear (GQueue *queue);
84 gboolean g_queue_is_empty (GQueue *queue);
86 void g_queue_clear_full (GQueue *queue,
89 guint g_queue_get_length (GQueue *queue);
91 void g_queue_reverse (GQueue *queue);
93 GQueue * g_queue_copy (GQueue *queue);
95 void g_queue_foreach (GQueue *queue,
[all …]
|
| /third_party/mesa3d/src/util/ |
| 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()
246 struct util_queue *queue; member
253 struct util_queue *queue = ((struct thread_input*)input)->queue; in util_queue_thread_func() local
258 if (queue->flags & UTIL_QUEUE_INIT_SET_FULL_THREAD_AFFINITY) { in util_queue_thread_func()
274 if (queue->flags & UTIL_QUEUE_INIT_USE_MINIMUM_PRIORITY) { in util_queue_thread_func()
280 if (strlen(queue->name) > 0) { in util_queue_thread_func()
[all …]
|
| /third_party/gstreamer/gstreamer/libs/gst/base/ |
| D | gstdataqueue.c | 66 GstQueueArray *queue; member
111 queue, \
115 gst_queue_array_get_length (q->priv->queue))
194 gst_data_queue_init (GstDataQueue * queue) in gst_data_queue_init() argument
196 queue->priv = gst_data_queue_get_instance_private (queue); in gst_data_queue_init()
198 queue->priv->cur_level.visible = 0; /* no content */ in gst_data_queue_init()
199 queue->priv->cur_level.bytes = 0; /* no content */ in gst_data_queue_init()
200 queue->priv->cur_level.time = 0; /* no content */ in gst_data_queue_init()
202 queue->priv->checkfull = NULL; in gst_data_queue_init()
204 g_mutex_init (&queue->priv->qlock); in gst_data_queue_init()
[all …]
|
| /third_party/boost/libs/compute/test/ |
| D | test_dynamic_bitset.cpp | 24 compute::dynamic_bitset<> bits(1024, queue); in BOOST_AUTO_TEST_CASE()
26 bits.set(1, queue); in BOOST_AUTO_TEST_CASE()
27 BOOST_CHECK(bits.test(1, queue) == true); in BOOST_AUTO_TEST_CASE()
28 BOOST_CHECK(bits.test(2, queue) == false); in BOOST_AUTO_TEST_CASE()
30 bits.set(1, false, queue); in BOOST_AUTO_TEST_CASE()
31 BOOST_CHECK(bits.test(1, queue) == false); in BOOST_AUTO_TEST_CASE()
32 BOOST_CHECK(bits.test(2, queue) == false); in BOOST_AUTO_TEST_CASE()
37 compute::dynamic_bitset<> bits(1024, queue); in BOOST_AUTO_TEST_CASE()
38 BOOST_CHECK_EQUAL(bits.count(queue), size_t(0)); in BOOST_AUTO_TEST_CASE()
40 bits.set(1, queue); in BOOST_AUTO_TEST_CASE()
[all …]
|
| /third_party/node/test/parallel/ |
| D | test-priority-queue.js | 11 const queue = new PriorityQueue(); constant
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);
35 const queue = new PriorityQueue(); constant
37 queue.insert(i);
[all …]
|
| /third_party/mesa3d/src/gallium/drivers/llvmpipe/ |
| D | lp_scene_queue.c | 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->change); in lp_scene_queue_create()
82 return queue; in lp_scene_queue_create()
88 lp_scene_queue_destroy(struct lp_scene_queue *queue) in lp_scene_queue_destroy() argument
90 cnd_destroy(&queue->change); in lp_scene_queue_destroy()
91 mtx_destroy(&queue->mutex); in lp_scene_queue_destroy()
92 FREE(queue); in lp_scene_queue_destroy()
98 lp_scene_dequeue(struct lp_scene_queue *queue, boolean wait) in lp_scene_dequeue() argument
[all …]
|
| /third_party/skia/third_party/externals/dawn/src/tests/unittests/ |
| D | SerialQueueTests.cpp | 24 TestSerialQueue queue; in TEST() local
27 ASSERT_TRUE(queue.Empty()); 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()
42 for (int value : queue.IterateAll()) { in TEST()
50 queue.Clear(); in TEST()
51 ASSERT_TRUE(queue.Empty()); in TEST()
53 for (int value : queue.IterateAll()) { in TEST()
[all …]
|
| /third_party/flutter/skia/third_party/externals/sdl/visualtest/src/ |
| D | action_configparser.c | 43 SDLVisualTest_EnqueueAction(SDLVisualTest_ActionQueue* queue, in SDLVisualTest_EnqueueAction() argument
47 if(!queue) in SDLVisualTest_EnqueueAction()
62 queue->size++; in SDLVisualTest_EnqueueAction()
63 if(!queue->rear) in SDLVisualTest_EnqueueAction()
64 queue->rear = queue->front = node; in SDLVisualTest_EnqueueAction()
67 queue->rear->next = node; in SDLVisualTest_EnqueueAction()
68 queue->rear = node; in SDLVisualTest_EnqueueAction()
74 SDLVisualTest_DequeueAction(SDLVisualTest_ActionQueue* queue) in SDLVisualTest_DequeueAction() argument
77 if(!queue) in SDLVisualTest_DequeueAction()
82 if(SDLVisualTest_IsActionQueueEmpty(queue)) in SDLVisualTest_DequeueAction()
[all …]
|
| /third_party/flutter/skia/third_party/externals/dawn/src/tests/unittests/ |
| D | SerialQueueTests.cpp | 23 TestSerialQueue queue; in TEST() local
26 ASSERT_TRUE(queue.Empty()); in TEST()
29 for (int value : queue.IterateAll()) { in TEST()
35 queue.Enqueue(1, 0); in TEST()
36 queue.Enqueue(2, 0); in TEST()
37 queue.Enqueue(std::move(3), 1); in TEST()
41 for (int value : queue.IterateAll()) { in TEST()
49 queue.Clear(); in TEST()
50 ASSERT_TRUE(queue.Empty()); in TEST()
52 for (int value : queue.IterateAll()) { in TEST()
[all …]
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| D | test-priority-queue.cc | 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.minimum () == hb_pair (5, 2)); in test_insert()
46 queue.insert (15, 3); in test_insert()
[all …]
|
| /third_party/harfbuzz/src/ |
| D | test-priority-queue.cc | 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.minimum () == hb_pair (5, 2)); in test_insert()
46 queue.insert (15, 3); in test_insert()
[all …]
|
| /third_party/boost/libs/compute/include/boost/compute/container/ |
| D | flat_set.hpp | 145 void reserve(size_type size, command_queue &queue) in reserve() argument
147 m_vector.reserve(size, queue); in reserve()
152 command_queue queue = m_vector.default_queue(); in reserve() local
153 reserve(size, queue); in reserve()
154 queue.finish(); in reserve()
168 insert(const value_type &value, command_queue &queue) in insert() argument
170 iterator location = upper_bound(value, queue); in insert()
174 ::boost::compute::copy_n(location - 1, 1, ¤t_value, queue); in insert()
180 m_vector.insert(location, value, queue); in insert()
186 command_queue queue = m_vector.default_queue(); in insert() local
[all …]
|
| D | vector.hpp | 158 command_queue &queue = system::default_queue()) in vector() argument
160 m_allocator(queue.get_context()) in vector()
164 ::boost::compute::fill_n(begin(), count, value, queue); in vector()
181 command_queue &queue = system::default_queue()) in vector() argument
183 m_allocator(queue.get_context()) in vector()
187 ::boost::compute::copy(first, last, begin(), queue); in vector()
192 command_queue &queue = system::default_queue()) in vector() argument
199 if(other.get_buffer().get_context() != queue.get_context()){ in vector()
205 ::boost::compute::copy(other.begin(), other.end(), begin(), queue); in vector()
206 queue.finish(); in vector()
[all …]
|
| /third_party/boost/boost/compute/container/ |
| D | flat_set.hpp | 145 void reserve(size_type size, command_queue &queue) in reserve() argument
147 m_vector.reserve(size, queue); in reserve()
152 command_queue queue = m_vector.default_queue(); in reserve() local
153 reserve(size, queue); in reserve()
154 queue.finish(); in reserve()
168 insert(const value_type &value, command_queue &queue) in insert() argument
170 iterator location = upper_bound(value, queue); in insert()
174 ::boost::compute::copy_n(location - 1, 1, ¤t_value, queue); in insert()
180 m_vector.insert(location, value, queue); in insert()
186 command_queue queue = m_vector.default_queue(); in insert() local
[all …]
|
| D | vector.hpp | 158 command_queue &queue = system::default_queue()) in vector() argument
160 m_allocator(queue.get_context()) in vector()
164 ::boost::compute::fill_n(begin(), count, value, queue); in vector()
181 command_queue &queue = system::default_queue()) in vector() argument
183 m_allocator(queue.get_context()) in vector()
187 ::boost::compute::copy(first, last, begin(), queue); in vector()
192 command_queue &queue = system::default_queue()) in vector() argument
199 if(other.get_buffer().get_context() != queue.get_context()){ in vector()
205 ::boost::compute::copy(other.begin(), other.end(), begin(), queue); in vector()
206 queue.finish(); in vector()
[all …]
|
| /third_party/libsoup/libsoup/ |
| D | soup-message-queue.c | 39 SoupMessageQueue *queue; in soup_message_queue_new() local
41 queue = g_slice_new0 (SoupMessageQueue); in soup_message_queue_new()
42 queue->session = session; in soup_message_queue_new()
43 g_mutex_init (&queue->mutex); in soup_message_queue_new()
44 return queue; in soup_message_queue_new()
48 soup_message_queue_destroy (SoupMessageQueue *queue) in soup_message_queue_destroy() argument
50 g_return_if_fail (queue->head == NULL); in soup_message_queue_destroy()
52 g_mutex_clear (&queue->mutex); in soup_message_queue_destroy()
53 g_slice_free (SoupMessageQueue, queue); in soup_message_queue_destroy()
77 soup_message_queue_append (SoupMessageQueue *queue, SoupMessage *msg, in soup_message_queue_append() argument
[all …]
|
| /third_party/gstreamer/gstreamer/gst/ |
| D | gstatomicqueue.c | 116 add_to_free_list (GstAtomicQueue * queue, GstAQueueMem * mem) in add_to_free_list() argument
119 mem->free = g_atomic_pointer_get (&queue->free_list); in add_to_free_list()
120 } while (!g_atomic_pointer_compare_and_exchange (&queue->free_list, in add_to_free_list()
125 clear_free_list (GstAtomicQueue * queue) in clear_free_list() argument
131 free_list = g_atomic_pointer_get (&queue->free_list); in clear_free_list()
134 } while (!g_atomic_pointer_compare_and_exchange (&queue->free_list, free_list, in clear_free_list()
158 GstAtomicQueue *queue; in gst_atomic_queue_new() local
160 queue = g_new (GstAtomicQueue, 1); in gst_atomic_queue_new()
162 queue->refcount = 1; in gst_atomic_queue_new()
164 queue->num_readers = 0; in gst_atomic_queue_new()
[all …]
|
| /third_party/ffmpeg/libavfilter/ |
| D | bufferqueue.h | 50 AVFrame *queue[FF_BUFQUEUE_SIZE]; member
55 #define BUCKET(i) queue->queue[(queue->head + (i)) % FF_BUFQUEUE_SIZE]
60 static inline int ff_bufqueue_is_full(struct FFBufQueue *queue) in ff_bufqueue_is_full() argument
62 return queue->available == FF_BUFQUEUE_SIZE; in ff_bufqueue_is_full()
71 static inline void ff_bufqueue_add(void *log, struct FFBufQueue *queue, in ff_bufqueue_add() argument
74 if (ff_bufqueue_is_full(queue)) { in ff_bufqueue_add()
76 av_frame_free(&BUCKET(--queue->available)); in ff_bufqueue_add()
78 BUCKET(queue->available++) = buf; in ff_bufqueue_add()
87 static inline AVFrame *ff_bufqueue_peek(struct FFBufQueue *queue, in ff_bufqueue_peek() argument
90 return index < queue->available ? BUCKET(index) : NULL; in ff_bufqueue_peek()
[all …]
|
| /third_party/libnl/lib/netfilter/ |
| D | queue_obj.c | 34 struct nfnl_queue *queue = (struct nfnl_queue *) a; in nfnl_queue_dump() local
39 if (queue->ce_mask & QUEUE_ATTR_GROUP) in nfnl_queue_dump()
40 nl_dump(p, "group=%u ", queue->queue_group); in nfnl_queue_dump()
42 if (queue->ce_mask & QUEUE_ATTR_MAXLEN) in nfnl_queue_dump()
43 nl_dump(p, "maxlen=%u ", queue->queue_maxlen); in nfnl_queue_dump()
45 if (queue->ce_mask & QUEUE_ATTR_COPY_MODE) in nfnl_queue_dump()
47 nfnl_queue_copy_mode2str(queue->queue_copy_mode, in nfnl_queue_dump()
50 if (queue->ce_mask & QUEUE_ATTR_COPY_RANGE) in nfnl_queue_dump()
51 nl_dump(p, "copy_range=%u ", queue->queue_copy_range); in nfnl_queue_dump()
84 void nfnl_queue_get(struct nfnl_queue *queue) in nfnl_queue_get() argument
[all …]
|
| /third_party/gstreamer/gstplugins_bad/gst-libs/gst/vulkan/ |
| D | gstvkqueue.c | 61 #define GET_PRIV(queue) gst_vulkan_queue_get_instance_private (queue) argument
66 gst_vulkan_queue_init (GstVulkanQueue * queue) in gst_vulkan_queue_init() argument
68 GstVulkanQueuePrivate *priv = GET_PRIV (queue); in gst_vulkan_queue_init()
84 GstVulkanQueue *queue = GST_VULKAN_QUEUE (object); in gst_vulkan_queue_dispose() local
85 GstVulkanQueuePrivate *priv = GET_PRIV (queue); in gst_vulkan_queue_dispose()
87 if (queue->device) in gst_vulkan_queue_dispose()
88 gst_object_unref (queue->device); in gst_vulkan_queue_dispose()
89 queue->device = NULL; in gst_vulkan_queue_dispose()
105 gst_vulkan_queue_get_device (GstVulkanQueue * queue) in gst_vulkan_queue_get_device() argument
107 g_return_val_if_fail (GST_IS_VULKAN_QUEUE (queue), NULL); in gst_vulkan_queue_get_device()
[all …]
|
| /third_party/iptables/extensions/ |
| D | libxt_NFQUEUE.t | 3 -j NFQUEUE --queue-num 0;=;OK
4 -j NFQUEUE --queue-num 65535;=;OK
5 -j NFQUEUE --queue-num 65536;;FAIL
6 -j NFQUEUE --queue-num -1;;FAIL
8 # ERROR: cannot load: iptables -A INPUT -j NFQUEUE --queue-balance 0:65535
9 # -j NFQUEUE --queue-balance 0:65535;=;OK
10 -j NFQUEUE --queue-balance 0:65536;;FAIL
11 -j NFQUEUE --queue-balance -1:65535;;FAIL
12 -j NFQUEUE --queue-num 10 --queue-bypass;=;OK
13 -j NFQUEUE --queue-balance 0:6 --queue-cpu-fanout --queue-bypass;-j NFQUEUE --queue-balance 0:6 --q…
[all …]
|