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

1234567891011>>

/external/v8/test/unittests/
H A Dlocked-queue-unittest.cc5 #include "src/locked-queue-inl.h"
18 LockedQueue<Record> queue; local
19 EXPECT_TRUE(queue.IsEmpty());
24 LockedQueue<Record> queue; local
25 EXPECT_TRUE(queue.IsEmpty());
26 queue.Enqueue(1);
27 EXPECT_FALSE(queue.IsEmpty());
29 bool success = queue.Dequeue(&a);
32 EXPECT_TRUE(queue.IsEmpty());
37 LockedQueue<Record> queue; local
54 LockedQueue<Record> queue; local
63 LockedQueue<Record> queue; local
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DEvictingQueueTest.java44 EvictingQueue<String> queue = EvictingQueue.create(0);
45 assertEquals(0, queue.size());
47 assertTrue(queue.add("hi"));
48 assertEquals(0, queue.size());
50 assertTrue(queue.offer("hi"));
51 assertEquals(0, queue.size());
53 assertFalse(queue.remove("hi"));
54 assertEquals(0, queue.size());
57 queue.element();
61 assertNull(queue
[all...]
/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);
H A Dlp_scene_queue.c30 * Scene queue. We'll use two queues. One contains "full" scenes which
49 * A queue of scenes
58 /** Allocate a new scene queue */
62 struct lp_scene_queue *queue = CALLOC_STRUCT(lp_scene_queue); local
63 if (queue == NULL)
66 queue->ring = util_ringbuffer_create( MAX_SCENE_QUEUE *
68 if (queue->ring == NULL)
71 return queue;
74 FREE(queue);
79 /** Delete a scene queue */
81 lp_scene_queue_destroy(struct lp_scene_queue *queue) argument
90 lp_scene_dequeue(struct lp_scene_queue *queue, boolean wait) argument
110 lp_scene_enqueue(struct lp_scene_queue *queue, struct lp_scene *scene) argument
[all...]
/external/libcxx/test/std/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/std/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;
H A Dback.pass.cpp10 // <queue>
14 #include <queue>
19 std::queue<int> q;
H A Dempty.pass.cpp10 // <queue>
14 #include <queue>
19 std::queue<int> q;
H A Dfront.pass.cpp10 // <queue>
14 #include <queue>
19 std::queue<int> q;
/external/v8/test/unittests/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/std/containers/container.adaptors/queue/
H A Dversion.pass.cpp10 // <queue>
12 #include <queue>
/external/libcxx/test/std/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/std/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...]
H A Dswap_noexcept.pass.cpp10 // <queue>
12 // void swap(queue& c)
17 #include <queue>
26 typedef std::queue<MoveOnly> C;
/external/squashfs-tools/squashfs-tools/
H A Dcaches-queues-lists.c39 struct queue *queue_init(int size)
41 struct queue *queue = malloc(sizeof(struct queue)); local
43 if(queue == NULL)
50 queue->data = malloc(sizeof(void *) * (size + 1));
51 if(queue->data == NULL)
54 queue->size = size + 1;
55 queue->readp = queue
64 queue_put(struct queue *queue, void *data) argument
81 queue_get(struct queue *queue) argument
100 queue_empty(struct queue *queue) argument
115 queue_flush(struct queue *queue) argument
126 dump_queue(struct queue *queue) argument
156 struct seq_queue *queue = malloc(sizeof(struct seq_queue)); local
169 seq_queue_put(struct seq_queue *queue, struct file_buffer *entry) argument
188 seq_queue_get(struct seq_queue *queue) argument
233 seq_queue_flush(struct seq_queue *queue) argument
249 dump_seq_queue(struct seq_queue *queue, int fragment_queue) argument
[all...]
/external/guava/guava-tests/test/com/google/common/util/concurrent/
H A DListenerCallQueueTest.java43 ListenerCallQueue<Object> queue =
47 queue.add(incrementingCallback(counter, 1));
48 queue.add(incrementingCallback(counter, 2));
49 queue.add(incrementingCallback(counter, 3));
50 queue.add(incrementingCallback(counter, 4));
52 queue.execute();
58 ListenerCallQueue<Object> queue =
62 queue.add(incrementingCallback(counter, 1));
63 queue.add(THROWING_CALLBACK);
64 queue
[all...]

Completed in 522 milliseconds

1234567891011>>