| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | EvictingQueueTest.java | 44 EvictingQueue<String> queue = EvictingQueue.create(0); in testCreateWithZeroSize() local
45 assertEquals(0, queue.size()); in testCreateWithZeroSize()
47 assertTrue(queue.add("hi")); in testCreateWithZeroSize()
48 assertEquals(0, queue.size()); in testCreateWithZeroSize()
50 assertTrue(queue.offer("hi")); in testCreateWithZeroSize()
51 assertEquals(0, queue.size()); in testCreateWithZeroSize()
53 assertFalse(queue.remove("hi")); in testCreateWithZeroSize()
54 assertEquals(0, queue.size()); in testCreateWithZeroSize()
57 queue.element(); in testCreateWithZeroSize()
61 assertNull(queue.peek()); in testCreateWithZeroSize()
[all …]
|
| D | MinMaxPriorityQueueTest.java | 53 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue in testCreation_simple() local
55 assertEquals(11, queue.capacity()); in testCreation_simple()
56 checkUnbounded(queue); in testCreation_simple()
57 checkNatural(queue); in testCreation_simple()
61 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue in testCreation_comparator() local
64 assertEquals(11, queue.capacity()); in testCreation_comparator()
65 checkUnbounded(queue); in testCreation_comparator()
66 assertSame(SOME_COMPARATOR, queue.comparator()); in testCreation_comparator()
70 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue in testCreation_expectedSize() local
73 assertEquals(8, queue.capacity()); in testCreation_expectedSize()
[all …]
|
| /external/squashfs-tools/squashfs-tools/ |
| D | caches-queues-lists.c | 39 struct queue *queue_init(int size) in queue_init()
41 struct queue *queue = malloc(sizeof(struct queue)); in queue_init() local
43 if(queue == NULL) in queue_init()
50 queue->data = malloc(sizeof(void *) * (size + 1)); in queue_init()
51 if(queue->data == NULL) in queue_init()
54 queue->size = size + 1; in queue_init()
55 queue->readp = queue->writep = 0; in queue_init()
56 pthread_mutex_init(&queue->mutex, NULL); in queue_init()
57 pthread_cond_init(&queue->empty, NULL); in queue_init()
58 pthread_cond_init(&queue->full, NULL); in queue_init()
[all …]
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/misc/ |
| D | ANTLRFastQueueTest.m | 18 ANTLRFastQueue *queue = [[ANTLRFastQueue newANTLRFastQueue] retain];
19 STAssertNotNil(queue, @"Queue was not created and was nil");
20 [queue release];
25 ANTLRFastQueue *queue = [[ANTLRFastQueue newANTLRFastQueue] retain];
26 STAssertNotNil(queue, @"Queue was not created and was nil");
27 [queue addObject:@"My String"];
28 …STAssertTrue([[queue objectAtIndex:0] isKindOfClass:[NSString class]], @"First object is not a NSS…
29 STAssertEquals([queue objectAtIndex:0], @"My String", @"Object at index zero is invalid");
30 STAssertTrue([queue size] == 1, @"Queue is the wrong size: %d", [queue size]);
31 [queue release];
[all …]
|
| /external/libnl/lib/netfilter/ |
| D | queue_obj.c | 33 struct nfnl_queue *queue = (struct nfnl_queue *) a; in nfnl_queue_dump() local
38 if (queue->ce_mask & QUEUE_ATTR_GROUP) in nfnl_queue_dump()
39 nl_dump(p, "group=%u ", queue->queue_group); in nfnl_queue_dump()
41 if (queue->ce_mask & QUEUE_ATTR_MAXLEN) in nfnl_queue_dump()
42 nl_dump(p, "maxlen=%u ", queue->queue_maxlen); in nfnl_queue_dump()
44 if (queue->ce_mask & QUEUE_ATTR_COPY_MODE) in nfnl_queue_dump()
46 nfnl_queue_copy_mode2str(queue->queue_copy_mode, in nfnl_queue_dump()
49 if (queue->ce_mask & QUEUE_ATTR_COPY_RANGE) in nfnl_queue_dump()
50 nl_dump(p, "copy_range=%u ", queue->queue_copy_range); in nfnl_queue_dump()
83 void nfnl_queue_get(struct nfnl_queue *queue) in nfnl_queue_get() argument
[all …]
|
| D | queue.c | 111 static int nfnl_queue_build_request(const struct nfnl_queue *queue, in nfnl_queue_build_request() argument
116 if (!nfnl_queue_test_group(queue)) in nfnl_queue_build_request()
120 0, nfnl_queue_get_group(queue)); in nfnl_queue_build_request()
124 if (nfnl_queue_test_maxlen(queue) && in nfnl_queue_build_request()
126 htonl(nfnl_queue_get_maxlen(queue))) < 0) in nfnl_queue_build_request()
132 if (nfnl_queue_test_copy_mode(queue)) { in nfnl_queue_build_request()
135 switch (nfnl_queue_get_copy_mode(queue)) { in nfnl_queue_build_request()
146 params.copy_range = htonl(nfnl_queue_get_copy_range(queue)); in nfnl_queue_build_request()
160 int nfnl_queue_build_create_request(const struct nfnl_queue *queue, in nfnl_queue_build_create_request() argument
166 if ((err = nfnl_queue_build_request(queue, result)) < 0) in nfnl_queue_build_create_request()
[all …]
|
| /external/guava/guava-tests/test/com/google/common/util/concurrent/ |
| D | ListenerCallQueueTest.java | 41 ListenerCallQueue<Object> queue = in testAddAndExecute() local
45 queue.add(incrementingCallback(counter, 1)); in testAddAndExecute()
46 queue.add(incrementingCallback(counter, 2)); in testAddAndExecute()
47 queue.add(incrementingCallback(counter, 3)); in testAddAndExecute()
48 queue.add(incrementingCallback(counter, 4)); in testAddAndExecute()
50 queue.execute(); in testAddAndExecute()
56 ListenerCallQueue<Object> queue = in testAddAndExecute_withExceptions() local
60 queue.add(incrementingCallback(counter, 1)); in testAddAndExecute_withExceptions()
61 queue.add(THROWING_CALLBACK); in testAddAndExecute_withExceptions()
62 queue.add(incrementingCallback(counter, 2)); in testAddAndExecute_withExceptions()
[all …]
|
| /external/v8/benchmarks/ |
| D | richards.js | 51 var queue = new Packet(null, ID_WORKER, KIND_WORK);
52 queue = new Packet(queue, ID_WORKER, KIND_WORK);
53 scheduler.addWorkerTask(ID_WORKER, 1000, queue);
55 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
56 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
57 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
58 scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue);
60 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
61 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
62 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
[all …]
|
| /external/mesa3d/src/gallium/drivers/svga/ |
| D | svga_state_tss.c | 77 struct bind_queue queue; in update_tss_binding() local
79 queue.bind_count = 0; in update_tss_binding()
123 queue.bind[queue.bind_count].unit = i; in update_tss_binding()
124 queue.bind[queue.bind_count].view = view; in update_tss_binding()
125 queue.bind_count++; in update_tss_binding()
134 if (queue.bind_count) { in update_tss_binding()
139 queue.bind_count ) != PIPE_OK) in update_tss_binding()
142 for (i = 0; i < queue.bind_count; i++) { in update_tss_binding()
145 ts[i].stage = queue.bind[i].unit; in update_tss_binding()
148 if (queue.bind[i].view->v) { in update_tss_binding()
[all …]
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| D | lp_scene_queue.c | 62 struct lp_scene_queue *queue = CALLOC_STRUCT(lp_scene_queue); in lp_scene_queue_create() local
63 if (queue == NULL) in lp_scene_queue_create()
66 queue->ring = util_ringbuffer_create( MAX_SCENE_QUEUE * in lp_scene_queue_create()
68 if (queue->ring == NULL) in lp_scene_queue_create()
71 return queue; in lp_scene_queue_create()
74 FREE(queue); in lp_scene_queue_create()
81 lp_scene_queue_destroy(struct lp_scene_queue *queue) in lp_scene_queue_destroy() argument
83 util_ringbuffer_destroy(queue->ring); in lp_scene_queue_destroy()
84 FREE(queue); in lp_scene_queue_destroy()
90 lp_scene_dequeue(struct lp_scene_queue *queue, boolean wait) in lp_scene_dequeue() argument
[all …]
|
| /external/v8/src/libplatform/ |
| D | task-queue-unittest.cc | 26 explicit TaskQueueThread(TaskQueue* queue) in TaskQueueThread() argument
27 : Thread(Options("libplatform TaskQueueThread")), queue_(queue) {} in TaskQueueThread()
39 TaskQueue queue; in TEST() local
41 queue.Append(&task); in TEST()
42 EXPECT_EQ(&task, queue.GetNext()); in TEST()
43 queue.Terminate(); in TEST()
44 EXPECT_THAT(queue.GetNext(), IsNull()); in TEST()
49 TaskQueue queue; in TEST() local
50 TaskQueueThread thread1(&queue); in TEST()
51 TaskQueueThread thread2(&queue); in TEST()
[all …]
|
| /external/libcxx/include/ |
| D | queue | 2 //===--------------------------- queue ------------------------------------===//
15 queue synopsis
21 class queue
34 queue() = default;
35 ~queue() = default;
37 queue(const queue& q) = default;
38 queue(queue&& q) = default;
40 queue& operator=(const queue& q) = default;
41 queue& operator=(queue&& q) = default;
43 explicit queue(const container_type& c);
[all …]
|
| /external/strace/ |
| D | unwind.c | 88 static void queue_print(struct queue_t *queue);
110 tcp->queue = malloc(sizeof(*tcp->queue)); in unwind_tcb_init()
111 if (!tcp->queue) in unwind_tcb_init()
113 tcp->queue->head = NULL; in unwind_tcb_init()
114 tcp->queue->tail = NULL; in unwind_tcb_init()
120 queue_print(tcp->queue); in unwind_tcb_fin()
121 free(tcp->queue); in unwind_tcb_fin()
122 tcp->queue = NULL; in unwind_tcb_fin()
484 queue_put(struct queue_t *queue, in queue_put() argument
504 if (!queue->head) { in queue_put()
[all …]
|
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| D | Analyzer.java | 133 IntQueue queue = new IntQueue(); in analyze() local
141 queue.add(iter.next()); in analyze()
142 while (!queue.isEmpty()) { in analyze()
143 analyzeNextEntry(method, iter, queue, executor); in analyze()
168 IntQueue queue, Executor executor) throws BadBytecode { in analyzeNextEntry() argument
169 int pos = queue.take(); in analyzeNextEntry()
185 mergeTableSwitch(queue, pos, iter, frame); in analyzeNextEntry()
187 mergeLookupSwitch(queue, pos, iter, frame); in analyzeNextEntry()
189 mergeRet(queue, iter, pos, frame, subroutine); in analyzeNextEntry()
195 mergeJsr(queue, frames[pos], subroutines[target], pos, lookAhead(iter, pos)); in analyzeNextEntry()
[all …]
|
| /external/libcxx/test/std/containers/container.adaptors/queue/queue.defn/ |
| D | types.pass.cpp | 31 : private std::queue<int>
49 static_assert((std::is_same<std::queue<int>::container_type, std::deque<int> >::value), ""); in main()
50 …static_assert((std::is_same<std::queue<double, std::vector<int> >::container_type, std::vector<int… in main()
51 … static_assert((std::is_same<std::queue<double, std::vector<int> >::value_type, int>::value), ""); in main()
52 … static_assert((std::is_same<std::queue<int>::reference, std::deque<int>::reference>::value), ""); in main()
53 …static_assert((std::is_same<std::queue<int>::const_reference, std::deque<int>::const_reference>::v… in main()
54 … static_assert((std::is_same<std::queue<int>::size_type, std::deque<int>::size_type>::value), ""); in main()
55 static_assert((std::uses_allocator<std::queue<int>, std::allocator<int> >::value), ""); in main()
56 static_assert((!std::uses_allocator<std::queue<int, C>, std::allocator<int> >::value), ""); in main()
|
| D | swap.pass.cpp | 29 std::queue<int> q1 = make<std::queue<int> >(5); in main()
30 std::queue<int> q2 = make<std::queue<int> >(10); in main()
31 std::queue<int> q1_save = q1; in main()
32 std::queue<int> q2_save = q2; in main()
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | Queues.java | 69 ConcurrentLinkedQueue<E> queue = new ConcurrentLinkedQueue<E>(); in newConcurrentLinkedQueue() local
70 Iterables.addAll(queue, elements); in newConcurrentLinkedQueue()
71 return queue; in newConcurrentLinkedQueue()
104 LinkedBlockingQueue<E> queue = new LinkedBlockingQueue<E>(); in newLinkedBlockingQueue() local
105 Iterables.addAll(queue, elements); in newLinkedBlockingQueue()
106 return queue; in newLinkedBlockingQueue()
136 PriorityBlockingQueue<E> queue = new PriorityBlockingQueue<E>(); in newPriorityBlockingQueue() local
137 Iterables.addAll(queue, elements); in newPriorityBlockingQueue()
138 return queue; in newPriorityBlockingQueue()
166 PriorityQueue<E> queue = new PriorityQueue<E>(); in newPriorityQueue() local
[all …]
|
| D | MinMaxPriorityQueue.java | 206 MinMaxPriorityQueue<T> queue = new MinMaxPriorityQueue<T>( in create() local
209 queue.offer(element); in create()
211 return queue; in create()
223 private Object[] queue; field in MinMaxPriorityQueue
236 this.queue = new Object[queueSize]; in MinMaxPriorityQueue()
290 return (E) queue[index]; in elementData()
386 queue[size] = null; in removeAt()
393 queue[size] = null; in removeAt()
560 queue[index] = e; in bubbleUpAlternatingLevels()
563 queue[index] = x; in bubbleUpAlternatingLevels()
[all …]
|
| /external/compiler-rt/lib/asan/tests/ |
| D | asan_mac_test_helpers.mm | 93 dispatch_queue_t queue = dispatch_get_global_queue(0, 0);
98 dispatch_async(queue, block);
103 dispatch_queue_t queue = dispatch_get_global_queue(2, 0);
108 dispatch_sync(queue, block);
115 dispatch_queue_t queue = dispatch_get_global_queue(0, 0);
119 dispatch_async(queue, block_alloc);
121 dispatch_async(queue, block_crash);
127 dispatch_queue_t queue[4];
128 queue[0] = dispatch_get_global_queue(2, 0);
129 queue[1] = dispatch_get_global_queue(0, 0);
[all …]
|
| /external/openfst/src/include/fst/script/ |
| D | shortest-path.h | 72 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath() local
75 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
79 delete queue; in ShortestPath() local
84 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath() local
87 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
91 delete queue; in ShortestPath() local
96 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath() local
99 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
103 delete queue; in ShortestPath() local
108 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath() local
[all …]
|
| D | rmepsilon.h | 76 AutoQueue<StateId> queue(*fst, distance, EpsilonArcFilter<Arc>()); in RmEpsilonHelper()
78 &queue, opts.delta, opts.connect, weight_thresh, in RmEpsilonHelper()
84 FifoQueue<StateId> queue; in RmEpsilonHelper() local
86 &queue, opts.delta, opts.connect, weight_thresh, in RmEpsilonHelper()
92 LifoQueue<StateId> queue; in RmEpsilonHelper() local
94 &queue, opts.delta, opts.connect, weight_thresh, in RmEpsilonHelper()
100 NaturalShortestFirstQueue<StateId, Weight> queue(*distance); in RmEpsilonHelper()
103 &queue, opts.delta, opts.connect, weight_thresh, in RmEpsilonHelper()
109 StateOrderQueue<StateId> queue; in RmEpsilonHelper() local
111 &queue, opts.delta, opts.connect, weight_thresh, in RmEpsilonHelper()
[all …]
|
| /external/iptables/extensions/ |
| D | libxt_NFQUEUE.man | 2 you to put a packet into any specific queue, identified by its 16-bit queue
11 \fB\-\-queue\-num\fP \fIvalue\fP
12 This specifies the QUEUE number to use. Valid queue numbers are 0 to 65535. The default value is 0.
15 \fB\-\-queue\-balance\fP \fIvalue\fP\fB:\fP\fIvalue\fP
18 queues x, x+1, .. x+n and use "\-\-queue\-balance \fIx\fP\fB:\fP\fIx+n\fP".
22 \fB\-\-queue\-bypass\fP
28 \fB\-\-queue\-cpu-fanout\fP
30 \fB--queue-balance\fP this will use the CPU ID as an index to map packets to
31 the queues. The idea is that you can improve performance if there's a queue
32 per CPU. This requires \fB--queue-balance\fP to be specified.
|
| /external/libnl/src/ |
| D | nf-queue.c | 26 struct nfnl_queue *queue; in alloc_queue() local
28 queue = nfnl_queue_alloc(); in alloc_queue()
29 if (!queue) in alloc_queue()
32 return queue; in alloc_queue()
87 struct nfnl_queue *queue; in main() local
119 queue = alloc_queue(); in main()
120 nfnl_queue_set_group(queue, atoi(argv[2])); in main()
130 nfnl_queue_set_copy_mode(queue, copy_mode); in main()
135 nfnl_queue_set_copy_range(queue, copy_range); in main()
137 if ((err = nfnl_queue_create(nf_sock, queue)) < 0) in main()
|
| /external/libcxx/test/std/containers/container.adaptors/queue/queue.special/ |
| D | swap.pass.cpp | 30 std::queue<int> q1 = make<std::queue<int> >(5); in main()
31 std::queue<int> q2 = make<std::queue<int> >(10); in main()
32 std::queue<int> q1_save = q1; in main()
33 std::queue<int> q2_save = q2; in main()
|
| /external/libcxx/test/std/containers/container.adaptors/queue/queue.ops/ |
| D | eq.pass.cpp | 33 std::queue<int> q1 = make<std::queue<int> >(5); in main()
34 std::queue<int> q2 = make<std::queue<int> >(10); in main()
35 std::queue<int> q1_save = q1; in main()
36 std::queue<int> q2_save = q2; in main()
|