| /third_party/glib/glib/ |
| D | gqueue.c | 4 * GQueue: Double ended queue implementation, piggy backed on GList.
26 * SECTION:queue
28 * @Short_description: double-ended queue data structure
31 * queue data structure. Internally, GQueue uses the same data structure
39 * For a thread-safe queue, use #GAsyncQueue.
51 * To free the entire queue, use g_queue_free().
75 * @queue: a #GQueue
78 * if @queue was created with g_queue_new(). If queue elements contain
81 * If queue elements contain dynamically-allocated memory, you should
85 g_queue_free (GQueue *queue) in g_queue_free() argument
[all …]
|
| D | gasyncqueue.c | 4 * GAsyncQueue: asynchronous queue implementation, based on GQueue.
54 * counting. This is because the nature of an asynchronous queue is that
57 * For using an asynchronous queue you first have to create one with
62 * A thread which wants to send a message to that queue simply calls
63 * g_async_queue_push() to push the message to the queue.
65 * A thread which is expecting messages from an asynchronous queue
66 * simply calls g_async_queue_pop() for that queue. If no message is
67 * available in the queue at that point, the thread is now put to sleep
68 * until a message arrives. The message will be removed from the queue
74 * the queue and one that doesn't. That way you can hold the queue lock
[all …]
|
| D | gqueue.h | 40 * @head: a pointer to the first element of the queue
41 * @tail: a pointer to the last element of the queue
42 * @length: the number of elements in the queue
45 * [Queue][glib-Double-ended-Queues].
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,
[all …]
|
| /third_party/gstreamer/gstreamer/plugins/elements/ |
| D | gstqueue2.c | 33 * more buffers into the queue will block the pushing thread until more space
36 * The queue will create a new thread on the source pad to decouple the
42 * The default queue size limits are 100 buffers, 2MB of data, or
48 * of the queue size limits, they will only be used for buffering statistics.
102 #define QUEUE_IS_USING_TEMP_FILE(queue) ((queue)->temp_template != NULL) argument
103 #define QUEUE_IS_USING_RING_BUFFER(queue) ((queue)->ring_buffer_max_size != 0) /* for consistency … argument
104 #define QUEUE_IS_USING_QUEUE(queue) (!QUEUE_IS_USING_TEMP_FILE(queue) && !QUEUE_IS_USING_RING_BUFFE… argument
106 #define QUEUE_MAX_BYTES(queue) MIN((queue)->max_level.bytes, (queue)->ring_buffer_max_size) argument
152 * that specifies the queue's current fill level. The range goes from 0 to
182 #define STATUS(queue, pad, msg) \ argument
[all …]
|
| D | gstqueue.c | 26 * SECTION:element-queue
27 * @title: queue
32 * more buffers into the queue will block the pushing thread until more space
35 * The queue will create a new thread on the source pad to decouple the
45 * The default queue size limits are 200 buffers, 10MB of data, or
48 * As said earlier, the queue blocks by default when one of the specified
53 * The #GstQueue::underrun signal is emitted when the queue has less data than
54 * the specified minimum thresholds require (by default: when the queue is
55 * empty). The #GstQueue::overrun signal is emitted when the queue is filled
81 #define STATUS(queue, pad, msg) \ argument
[all …]
|
| /third_party/gstreamer/gstreamer/libs/gst/base/ |
| D | gstdataqueue.c | 46 /* Queue signals and args */
66 GstQueueArray *queue; member
68 GstDataQueueSize cur_level; /* size of the queue */
69 GstDataQueueCheckFullFunction checkfull; /* Callback to check if the queue is full */
72 GMutex qlock; /* lock for queue (vs object lock) */
108 "queue:%p " msg ": %u visible items, %u " \
111 queue, \
115 gst_queue_array_get_length (q->priv->queue))
129 "data queue object"); \
131 "dataflow inside the data queue object"); \
[all …]
|
| /third_party/node/test/parallel/ |
| D | test-priority-queue.js | 10 // Checks that the queue is fundamentally correct.
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);
34 // Checks that the queue is capable of resizing and fitting more elements.
[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()
49 SDLTest_LogError("queue argument cannot be NULL"); 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()
[all …]
|
| /third_party/boost/boost/thread/concurrent_queues/ |
| D | queue_adaptor.hpp | 28 template <typename Queue>
30 public boost::queue_base<typename Queue::value_type, typename Queue::size_type>
32 Queue queue; member in boost::concurrent::detail::queue_adaptor_copyable_only
34 typedef typename Queue::value_type value_type;
35 typedef typename Queue::size_type size_type;
41 bool empty() const { return queue.empty(); } in empty()
42 bool full() const { return queue.full(); } in full()
43 size_type size() const { return queue.size(); } in size()
44 bool closed() const { return queue.closed(); } in closed()
47 void close() { queue.close(); } in close()
[all …]
|
| D | deque_adaptor.hpp | 28 template <typename Queue>
30 public boost::deque_base<typename Queue::value_type, typename Queue::size_type>
32 Queue queue; member in boost::concurrent::detail::deque_adaptor_copyable_only
34 typedef typename Queue::value_type value_type;
35 typedef typename Queue::size_type size_type;
41 bool empty() const { return queue.empty(); } in empty()
42 bool full() const { return queue.full(); } in full()
43 size_type size() const { return queue.size(); } in size()
44 bool closed() const { return queue.closed(); } in closed()
47 void close() { queue.close(); } in close()
[all …]
|
| D | deque_views.hpp | 26 template <typename Queue>
29 Queue* queue; member in boost::concurrent::deque_back_view
31 typedef typename Queue::value_type value_type;
32 typedef typename Queue::size_type size_type;
35 deque_back_view(Queue& q) BOOST_NOEXCEPT : queue(&q) {} in deque_back_view()
38 bool empty() const { return queue->empty(); } in empty()
39 bool full() const { return queue->full(); } in full()
40 size_type size() const { return queue->size(); } in size()
41 bool closed() const { return queue->closed(); } in closed()
44 void close() { queue->close(); } in close()
[all …]
|
| D | queue_views.hpp | 26 template <typename Queue>
29 Queue* queue; member in boost::concurrent::queue_back_view
31 typedef typename Queue::value_type value_type;
32 typedef typename Queue::size_type size_type;
35 queue_back_view(Queue& q) BOOST_NOEXCEPT : queue(&q) {} in queue_back_view()
38 bool empty() const { return queue->empty(); } in empty()
39 bool full() const { return queue->full(); } in full()
40 size_type size() const { return queue->size(); } in size()
41 bool closed() const { return queue->closed(); } in closed()
44 void close() { queue->close(); } in close()
[all …]
|
| /third_party/ffmpeg/libavfilter/ |
| 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 is full.
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()
[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 | 70 /// boost::compute::vector<int> vec(data, data + 4, queue);
84 /// boost::compute::copy(host_vec.begin(), host_vec.end(), vec.begin(), queue);
87 /// boost::compute::copy(vec.begin(), vec.end(), host_vec.begin(), queue);
90 /// boost::compute::sort(vec.begin(), vec.end(), queue);
93 /// float sum = boost::compute::accumulate(vec.begin(), vec.end(), 0, queue);
96 /// boost::compute::reverse(vec.begin(), vec.end(), queue);
99 /// boost::compute::fill(vec.begin(), vec.end(), 1, queue);
154 /// boost::compute::vector<int> vec(4, 9, queue);
158 command_queue &queue = system::default_queue()) in vector() argument
160 m_allocator(queue.get_context()) in vector()
[all …]
|
| D | flat_map.hpp | 156 void reserve(size_type size, command_queue &queue) in reserve() argument
158 m_vector.reserve(size, queue); in reserve()
163 command_queue queue = m_vector.default_queue(); in reserve() local
164 reserve(size, queue); in reserve()
165 queue.finish(); in reserve()
179 insert(const value_type &value, command_queue &queue) in insert() argument
181 iterator location = upper_bound(value.first, queue); in insert()
185 ::boost::compute::copy_n(location - 1, 1, ¤t_value, queue); in insert()
197 command_queue queue = m_vector.default_queue(); in insert() local
198 std::pair<iterator, bool> result = insert(value, queue); in insert()
[all …]
|
| /third_party/gstreamer/gstreamer/gst/ |
| D | gstatomicqueue.c | 34 * @short_description: An atomic queue implementation
36 * The #GstAtomicQueue object implements a queue that can be used from multiple
44 /* By default the queue uses 2 * sizeof(gpointer) * clp2 (max_items) of
47 * The queue can operate in low memory mode, in which it consumes almost
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()
[all …]
|
| /third_party/python/Doc/library/ |
| D | asyncio-queue.rst | 14 :mod:`queue` module. Although asyncio queues are not thread-safe,
18 use :func:`asyncio.wait_for` function to do queue operations with a
23 Queue chapter
26 .. class:: Queue(maxsize=0, \*, loop=None)
28 A first in, first out (FIFO) queue.
30 If *maxsize* is less than or equal to zero, the queue size is
32 ``await put()`` blocks when the queue reaches *maxsize*
35 Unlike the standard library threading :mod:`queue`, the size of
36 the queue is always known and can be returned by calling the
47 Number of items allowed in the queue.
[all …]
|
| D | queue.rst | 1 :mod:`queue` --- A synchronized queue class
4 .. module:: queue
5 :synopsis: A synchronized queue class.
7 **Source code:** :source:`Lib/queue.py`
11 The :mod:`queue` module implements multi-producer, multi-consumer queues.
13 exchanged safely between multiple threads. The :class:`Queue` class in this
16 The module implements three types of queue, which differ only in the order in
18 queue, the first tasks added are the first retrieved. In a
19 :abbr:`LIFO (last-in, first-out)` queue, the most recently added entry is
20 the first retrieved (operating like a stack). With a priority queue,
[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/flutter/skia/third_party/externals/dawn/src/tests/unittests/ |
| D | SerialQueueTests.cpp | 23 TestSerialQueue queue; in TEST() local
25 // Queue starts empty in TEST()
26 ASSERT_TRUE(queue.Empty()); in TEST()
28 // Iterating on empty queue 1) works 2) doesn't produce any values 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()
39 // Iterating over a non-empty queue produces the expected result in TEST()
41 for (int value : queue.IterateAll()) { in TEST()
[all …]
|
| /third_party/boost/boost/numeric/ublas/opencl/ |
| D | elementwise.hpp | 26 O op, compute::command_queue& queue) in element_wise() argument
30 a.device() == queue.get_device()); in element_wise()
38 queue); in element_wise()
39 queue.finish(); in element_wise()
47 compute::command_queue &queue) in element_wise() argument
49 ublas::matrix<T, L1, opencl::storage> adev(a, queue); in element_wise()
50 ublas::matrix<T, L2, opencl::storage> bdev(b, queue); in element_wise()
51 ublas::matrix<T, L3, opencl::storage> rdev(a.size1(), b.size2(), queue.get_context()); in element_wise()
52 element_wise(adev, bdev, rdev, op, queue); in element_wise()
53 rdev.to_host(result, queue); in element_wise()
[all …]
|
| /third_party/grpc/test/core/iomgr/ |
| D | mpmcqueue_test.cc | 28 // Testing items for queue
36 // Thread to "produce" items and put items into queue
41 ProducerThread(grpc_core::InfLenFIFOQueue* queue, int start_index, in ProducerThread() argument
43 : start_index_(start_index), num_items_(num_items), queue_(queue) { in ProducerThread()
77 // Thread to pull out items from queue
80 ConsumerThread(grpc_core::InfLenFIFOQueue* queue) : queue_(queue) { in ConsumerThread() argument
122 // Test if queue's behavior of expanding is correct. (Only does expansion when
126 grpc_core::InfLenFIFOQueue queue; in test_space_efficiency() local
127 for (int i = 0; i < queue.init_num_nodes(); ++i) { in test_space_efficiency()
128 queue.Put(static_cast<void*>(new WorkItem(i))); in test_space_efficiency()
[all …]
|
| /third_party/harfbuzz/src/ |
| 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.minimum () == hb_pair (5, 2)); in test_insert()
[all …]
|
| /third_party/gstreamer/gstplugins_bad/ext/vulkan/ |
| D | vkqueue.c | 33 "Vulkan Queue");
54 GstVulkanQueue *queue = GST_VULKAN_QUEUE (object); in gst_vulkan_queue_dispose() local
56 if (queue->device) in gst_vulkan_queue_dispose()
57 gst_object_unref (queue->device); in gst_vulkan_queue_dispose()
58 queue->device = NULL; in gst_vulkan_queue_dispose()
62 gst_vulkan_queue_get_device (GstVulkanQueue * queue) in gst_vulkan_queue_get_device() argument
64 g_return_val_if_fail (GST_IS_VULKAN_QUEUE (queue), NULL); in gst_vulkan_queue_get_device()
66 return queue->device ? gst_object_ref (queue->device) : NULL; in gst_vulkan_queue_get_device()
72 * @queue: a #GstVulkanQueue
74 * Sets @queue on @context
[all …]
|