Home
last modified time | relevance | path

Searched full:queue (Results 1 – 25 of 4670) sorted by relevance

12345678910>>...187

/third_party/glib/glib/
Dgqueue.c4 * 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
40 * For a thread-safe queue, use #GAsyncQueue.
52 * To free the entire queue, use g_queue_free().
76 * @queue: a #GQueue
79 * if @queue was created with g_queue_new(). If queue elements contain
82 * If queue elements contain dynamically-allocated memory, you should
86 g_queue_free (GQueue *queue) in g_queue_free() argument
[all …]
Dgasyncqueue.c4 * 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 …]
Dgqueue.h40 * @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/
Dgstqueue2.c33 * 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.
56 * changed (for example, because the queue's capacity was changed and it already
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
160 * that specifies the queue's current fill level. The range goes from 0 to
[all …]
Dgstqueue.c26 * 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
82 #define STATUS(queue, pad, msg) \ argument
[all …]
/third_party/gstreamer/gstreamer/libs/gst/base/
Dgstdataqueue.c46 /* 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/mesa3d/src/util/
Du_queue.c47 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/flutter/skia/third_party/externals/sdl/visualtest/src/
Daction_configparser.c43 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/
Dqueue_adaptor.hpp28 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 …]
Ddeque_adaptor.hpp28 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 …]
Ddeque_views.hpp26 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 …]
/third_party/libsoup/libsoup/
Dsoup-message-queue.c3 * soup-message-queue.c: Message queue
13 #include "soup-message-queue.h"
26 * "removed" ones when walking the queue.
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()
[all …]
/third_party/ffmpeg/libavfilter/
Dbufferqueue.h2 * 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/gstreamer/gstplugins_bad/gst-libs/gst/vulkan/
Dgstvkqueue.c30 * @short_description: Vulkan command queue
33 * GstVulkanQueue encapsulates the vulkan command queue.
46 GST_DEBUG_CATEGORY_INIT (GST_CAT_DEFAULT, "vulkanqueue", 0, "Vulkan Queue"); in _init_debug()
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()
[all …]
/third_party/node/test/parallel/
Dtest-priority-queue.js10 // 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/boost/boost/compute/container/
Dflat_set.hpp145 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, &current_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 …]
/third_party/boost/libs/compute/include/boost/compute/container/
Dflat_set.hpp145 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, &current_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 …]
/third_party/gstreamer/gstreamer/gst/
Dgstatomicqueue.c34 * @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/libnl/lib/netfilter/
Dqueue_obj.c3 * lib/netfilter/queue_obj.c Netfilter Queue
15 * @defgroup queue Queue
22 #include <netlink/netfilter/queue.h>
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()
[all …]
/third_party/python/Doc/library/
Dasyncio-queue.rst14 :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)
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
44 Number of items allowed in the queue.
[all …]
Dqueue.rst1 :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/iptables/extensions/
Dlibxt_NFQUEUE.t3 -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 …]
/third_party/mesa3d/src/gallium/drivers/llvmpipe/
Dlp_scene_queue.c30 * 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->change); in lp_scene_queue_create()
[all …]
/third_party/skia/third_party/externals/dawn/src/tests/unittests/
DSerialQueueTests.cpp24 TestSerialQueue queue; in TEST() local
26 // Queue starts empty in TEST()
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()
[all …]
/third_party/boost/libs/compute/test/
Dtest_dynamic_bitset.cpp24 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 …]

12345678910>>...187