Searched refs:queue (Results 1 - 25 of 851) sorted by relevance

1234567891011>>

/external/stlport/test/unit/
H A Dqueue_header_test.cpp8 #include <queue>
/external/chromium_org/media/base/
H A Ddecoder_buffer_queue_unittest.cc36 DecoderBufferQueue queue; local
37 EXPECT_TRUE(queue.IsEmpty());
39 queue.Push(CreateBuffer(0));
40 EXPECT_FALSE(queue.IsEmpty());
44 DecoderBufferQueue queue; local
45 queue.Push(CreateBuffer(0));
46 queue.Push(CreateBuffer(1));
47 EXPECT_FALSE(queue.IsEmpty());
48 EXPECT_EQ(1, queue.Duration().InSeconds());
50 queue
56 DecoderBufferQueue queue; local
85 DecoderBufferQueue queue; local
121 DecoderBufferQueue queue; local
146 DecoderBufferQueue queue; local
[all...]
/external/chromium_org/chrome/browser/chromeos/drive/
H A Djob_queue_unittest.cc16 // Create a queue. Number of jobs are initially zero.
17 JobQueue queue(kNumMaxConcurrentJobs, kNumPriorityLevels);
18 EXPECT_EQ(0U, queue.GetNumberOfJobs());
21 queue.Push(101, LOW_PRIORITY);
22 queue.Push(102, HIGH_PRIORITY);
23 queue.Push(103, LOW_PRIORITY);
24 queue.Push(104, HIGH_PRIORITY);
28 EXPECT_TRUE(queue.PopForRun(LOW_PRIORITY, &id));
30 EXPECT_TRUE(queue.PopForRun(LOW_PRIORITY, &id));
34 EXPECT_TRUE(queue
[all...]
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DDoubleBufferedDequeTest.cpp16 DoubleBufferedDeque<int> queue; local
18 EXPECT_TRUE(queue.isEmpty());
19 queue.append(1);
20 EXPECT_FALSE(queue.isEmpty());
25 DoubleBufferedDeque<int> queue; local
26 queue.append(1);
28 queue.swapBuffers();
29 EXPECT_TRUE(queue.isEmpty());
34 DoubleBufferedDeque<int> queue; local
35 queue
[all...]
/external/chromium_org/third_party/webrtc/base/
H A Datomicops_unittest.cc30 rtc::FixedSizeLockFreeQueue<int> queue; local
31 EXPECT_EQ(0u, queue.capacity());
32 EXPECT_EQ(0u, queue.Size());
33 EXPECT_FALSE(queue.PushBack(1));
35 EXPECT_FALSE(queue.PopFront(&val));
39 rtc::FixedSizeLockFreeQueue<int> queue(5);
40 EXPECT_EQ(5u, queue.capacity());
41 EXPECT_EQ(0u, queue.Size());
43 EXPECT_FALSE(queue.PopFront(&val));
47 rtc::FixedSizeLockFreeQueue<int> queue(
[all...]
/external/bluetooth/bluedroid/osi/include/
H A Dfixed_queue.h28 // Creates a new fixed queue with the given |capacity|. If more elements than
29 // |capacity| are added to the queue, the caller is blocked until space is
30 // made available in the queue. Returns NULL on failure. The caller must free
31 // the returned queue with |fixed_queue_free|.
34 // Freeing a queue that is currently in use (i.e. has waiters
36 void fixed_queue_free(fixed_queue_t *queue, fixed_queue_free_cb free_cb);
38 // Enqueues the given |data| into the |queue|. The caller will be blocked
39 // if nore more space is available in the queue. Neither |queue| nor |data|
41 void fixed_queue_enqueue(fixed_queue_t *queue, voi
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
H A Dlp_scene_queue.h42 lp_scene_queue_destroy(struct lp_scene_queue *queue);
45 lp_scene_dequeue(struct lp_scene_queue *queue, boolean wait);
48 lp_scene_enqueue(struct lp_scene_queue *queue, struct lp_scene *scene);
/external/mesa3d/src/gallium/drivers/llvmpipe/
H A Dlp_scene_queue.h42 lp_scene_queue_destroy(struct lp_scene_queue *queue);
45 lp_scene_dequeue(struct lp_scene_queue *queue, boolean wait);
48 lp_scene_enqueue(struct lp_scene_queue *queue, struct lp_scene *scene);
/external/libcxx/test/containers/container.adaptors/queue/queue.cons/
H A Ddefault_noexcept.pass.cpp10 // <queue>
12 // queue()
17 #include <queue>
26 typedef std::queue<MoveOnly> C;
H A Ddtor_noexcept.pass.cpp10 // <queue>
12 // ~queue() // implied noexcept;
14 #include <queue>
23 typedef std::queue<MoveOnly> C;
H A Dmove_assign_noexcept.pass.cpp10 // <queue>
12 // queue& operator=(queue&& c)
17 #include <queue>
26 typedef std::queue<MoveOnly> C;
H A Dmove_noexcept.pass.cpp10 // <queue>
12 // queue(queue&&)
17 #include <queue>
26 typedef std::queue<MoveOnly> C;
/external/libcxx/test/containers/container.adaptors/queue/queue.defn/
H A Dsize.pass.cpp10 // <queue>
14 #include <queue>
19 std::queue<int> q;
H A Dswap.pass.cpp10 // <queue>
12 // void swap(queue& q);
14 #include <queue>
29 std::queue<int> q1 = make<std::queue<int> >(5);
30 std::queue<int> q2 = make<std::queue<int> >(10);
31 std::queue<int> q1_save = q1;
32 std::queue<int> q2_save = q2;
/external/bluetooth/bluedroid/osi/src/
H A Dfixed_queue.c69 void fixed_queue_free(fixed_queue_t *queue, fixed_queue_free_cb free_cb) { argument
70 if (!queue)
74 for (const list_node_t *node = list_begin(queue->list); node != list_end(queue->list); node = list_next(node))
77 list_free(queue->list);
78 semaphore_free(queue->enqueue_sem);
79 semaphore_free(queue->dequeue_sem);
80 pthread_mutex_destroy(&queue->lock);
81 free(queue);
84 void fixed_queue_enqueue(fixed_queue_t *queue, voi argument
97 fixed_queue_dequeue(fixed_queue_t *queue) argument
112 fixed_queue_try_enqueue(fixed_queue_t *queue, void *data) argument
127 fixed_queue_try_dequeue(fixed_queue_t *queue) argument
143 fixed_queue_get_dequeue_fd(const fixed_queue_t *queue) argument
148 fixed_queue_get_enqueue_fd(const fixed_queue_t *queue) argument
[all...]
/external/chromium_org/v8/src/libplatform/
H A Dtask-queue-unittest.cc7 #include "src/libplatform/task-queue.h"
26 explicit TaskQueueThread(TaskQueue* queue) argument
27 : Thread(Options("libplatform TaskQueueThread")), queue_(queue) {}
39 TaskQueue queue; local
41 queue.Append(&task);
42 EXPECT_EQ(&task, queue.GetNext());
43 queue.Terminate();
44 EXPECT_THAT(queue.GetNext(), IsNull());
49 TaskQueue queue; local
50 TaskQueueThread thread1(&queue);
[all...]
/external/libnl/lib/netfilter/
H A Dqueue_obj.c14 * @defgroup queue Queue
21 #include <netlink/netfilter/queue.h>
33 struct nfnl_queue *queue = (struct nfnl_queue *) a; local
38 if (queue->ce_mask & QUEUE_ATTR_GROUP)
39 nl_dump(p, "group=%u ", queue->queue_group);
41 if (queue->ce_mask & QUEUE_ATTR_MAXLEN)
42 nl_dump(p, "maxlen=%u ", queue->queue_maxlen);
44 if (queue->ce_mask & QUEUE_ATTR_COPY_MODE)
46 nfnl_queue_copy_mode2str(queue->queue_copy_mode,
49 if (queue
83 nfnl_queue_get(struct nfnl_queue *queue) argument
88 nfnl_queue_put(struct nfnl_queue *queue) argument
100 nfnl_queue_set_group(struct nfnl_queue *queue, uint16_t group) argument
106 nfnl_queue_test_group(const struct nfnl_queue *queue) argument
111 nfnl_queue_get_group(const struct nfnl_queue *queue) argument
116 nfnl_queue_set_maxlen(struct nfnl_queue *queue, uint32_t maxlen) argument
122 nfnl_queue_test_maxlen(const struct nfnl_queue *queue) argument
127 nfnl_queue_get_maxlen(const struct nfnl_queue *queue) argument
132 nfnl_queue_set_copy_mode(struct nfnl_queue *queue, enum nfnl_queue_copy_mode mode) argument
138 nfnl_queue_test_copy_mode(const struct nfnl_queue *queue) argument
143 nfnl_queue_get_copy_mode(const struct nfnl_queue *queue) argument
148 nfnl_queue_set_copy_range(struct nfnl_queue *queue, uint32_t copy_range) argument
154 nfnl_queue_test_copy_range(const struct nfnl_queue *queue) argument
159 nfnl_queue_get_copy_range(const struct nfnl_queue *queue) argument
[all...]
/external/guava/guava/src/com/google/common/base/
H A DFinalizablePhantomReference.java38 * @param queue that should finalize the referent
40 protected FinalizablePhantomReference(T referent, FinalizableReferenceQueue queue) { argument
41 super(referent, queue.queue);
42 queue.cleanUp();
H A DFinalizableSoftReference.java36 * @param queue that should finalize the referent
38 protected FinalizableSoftReference(T referent, FinalizableReferenceQueue queue) { argument
39 super(referent, queue.queue);
40 queue.cleanUp();
H A DFinalizableWeakReference.java36 * @param queue that should finalize the referent
38 protected FinalizableWeakReference(T referent, FinalizableReferenceQueue queue) { argument
39 super(referent, queue.queue);
40 queue.cleanUp();
/external/libcxx/test/containers/container.adaptors/queue/
H A Dversion.pass.cpp10 // <queue>
12 #include <queue>
/external/libcxx/test/containers/container.adaptors/queue/queue.ops/
H A Deq.pass.cpp10 // <queue>
13 // bool operator==(const queue<T, Container>& x,const queue<T, Container>& y);
16 // bool operator!=(const queue<T, Container>& x,const queue<T, Container>& y);
18 #include <queue>
33 std::queue<int> q1 = make<std::queue<int> >(5);
34 std::queue<int> q2 = make<std::queue<in
[all...]
H A Dlt.pass.cpp10 // <queue>
13 // bool operator< (const queue<T, Container>& x,const queue<T, Container>& y);
16 // bool operator> (const queue<T, Container>& x,const queue<T, Container>& y);
19 // bool operator>=(const queue<T, Container>& x,const queue<T, Container>& y);
22 // bool operator<=(const queue<T, Container>& x,const queue<T, Container>& y);
24 #include <queue>
[all...]
/external/libcxx/test/containers/container.adaptors/queue/queue.special/
H A Dswap.pass.cpp10 // <queue>
13 // void swap(queue<T, Container>& x, queue<T, Container>& y);
15 #include <queue>
30 std::queue<int> q1 = make<std::queue<int> >(5);
31 std::queue<int> q2 = make<std::queue<int> >(10);
32 std::queue<int> q1_save = q1;
33 std::queue<in
[all...]
/external/chromium_org/media/midi/
H A Dmidi_message_queue_unittest.cc31 void Add(MidiMessageQueue* queue, const T(&array)[N]) { argument
32 queue->Add(array, N);
58 MidiMessageQueue queue(false);
60 queue.Get(&message);
65 MidiMessageQueue queue(false);
66 Add(&queue, kGMOn);
67 Add(&queue, kBrokenData1);
68 Add(&queue, kNoteOnWithRunningStatus);
69 Add(&queue, kBrokenData2);
70 Add(&queue, kChannelPressureWithRunningStatu
[all...]

Completed in 501 milliseconds

1234567891011>>