| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | LatencyPriorityQueue.cpp | 85 Queue.push_back(SU); in push()
123 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop()
124 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()), in pop()
125 E = Queue.end(); I != E; ++I) in pop()
129 if (Best != std::prev(Queue.end())) in pop()
130 std::swap(*Best, Queue.back()); in pop()
131 Queue.pop_back(); in pop()
136 assert(!Queue.empty() && "Queue is empty!"); in remove()
137 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
138 assert(I != Queue.end() && "Queue doesn't contain the SU being removed!"); in remove()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ExecutionEngine/Orc/ |
| D | QueueChannel.h | 39 class Queue : public std::queue<char> {
43 Queue() in Queue() function
47 Queue(const Queue&) = delete;
48 Queue& operator=(const Queue&) = delete;
49 Queue(Queue&&) = delete;
50 Queue& operator=(Queue&&) = delete;
75 QueueChannel(std::shared_ptr<Queue> InQueue, in QueueChannel()
76 std::shared_ptr<Queue> OutQueue) in QueueChannel()
131 std::shared_ptr<Queue> InQueue;
132 std::shared_ptr<Queue> OutQueue;
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-mca/ |
| D | RetireControlUnit.cpp | 38 Queue.resize(AvailableSlots); in RetireControlUnit()
46 std::min(NumMicroOps, static_cast<unsigned>(Queue.size())); in reserveSlot()
52 Queue[NextAvailableSlotIdx] = {IR, NormalizedQuantity, false}; in reserveSlot()
54 NextAvailableSlotIdx %= Queue.size(); in reserveSlot()
60 return Queue[CurrentInstructionSlotIdx]; in peekCurrentToken()
70 CurrentInstructionSlotIdx %= Queue.size(); in consumeCurrentToken()
75 assert(Queue.size() > TokenID); in onInstructionExecuted()
76 assert(Queue[TokenID].Executed == false && Queue[TokenID].IR.isValid()); in onInstructionExecuted()
77 Queue[TokenID].Executed = true; in onInstructionExecuted()
82 dbgs() << "Retire Unit: { Total Slots=" << Queue.size() in dump()
|
| /external/llvm/lib/CodeGen/ |
| D | LatencyPriorityQueue.cpp | 84 Queue.push_back(SU); in push()
122 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop()
123 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()), in pop()
124 E = Queue.end(); I != E; ++I) in pop()
128 if (Best != std::prev(Queue.end())) in pop()
129 std::swap(*Best, Queue.back()); in pop()
130 Queue.pop_back(); in pop()
135 assert(!Queue.empty() && "Queue is empty!"); in remove()
136 std::vector<SUnit *>::iterator I = std::find(Queue.begin(), Queue.end(), SU); in remove()
137 if (I != std::prev(Queue.end())) in remove()
[all …]
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| D | sample3-inl.h | 44 class Queue; variable
50 friend class Queue<E>; variable
74 class Queue {
77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
80 ~Queue() { Clear(); } in ~Queue()
153 Queue* Map(F function) const { in Map()
154 Queue* new_queue = new Queue(); in Map()
168 Queue(const Queue&);
169 const Queue& operator = (const Queue&);
|
| D | sample3_unittest.cc | 96 void MapTester(const Queue<int> * q) { in MapTester()
99 const Queue<int> * const new_q = q->Map(Double); in MapTester()
114 Queue<int> q0_;
115 Queue<int> q1_;
116 Queue<int> q2_;
|
| /external/googletest/googletest/samples/ |
| D | sample3-inl.h | 42 class Queue; variable
48 friend class Queue<E>; variable
73 class Queue {
76 Queue() : head_(nullptr), last_(nullptr), size_(0) {} in Queue() function
79 ~Queue() { Clear(); } in ~Queue()
152 Queue* Map(F function) const { in Map()
153 Queue* new_queue = new Queue(); in Map()
168 Queue(const Queue&);
169 const Queue& operator = (const Queue&);
|
| D | sample3_unittest.cc | 93 void MapTester(const Queue<int> * q) { in MapTester()
96 const Queue<int> * const new_q = q->Map(Double); in MapTester()
111 Queue<int> q0_;
112 Queue<int> q1_;
113 Queue<int> q2_;
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | LatencyPriorityQueue.cpp | 83 Queue.push_back(SU); in push()
121 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop()
122 for (std::vector<SUnit *>::iterator I = llvm::next(Queue.begin()), in pop()
123 E = Queue.end(); I != E; ++I) in pop()
127 if (Best != prior(Queue.end())) in pop()
128 std::swap(*Best, Queue.back()); in pop()
129 Queue.pop_back(); in pop()
134 assert(!Queue.empty() && "Queue is empty!"); in remove()
135 std::vector<SUnit *>::iterator I = std::find(Queue.begin(), Queue.end(), SU); in remove()
136 if (I != prior(Queue.end())) in remove()
[all …]
|
| /external/grpc-grpc/src/csharp/Grpc.Core/Internal/ |
| D | DefaultObjectPool.cs | 37 readonly Queue<T> sharedQueue;
60 this.sharedQueue = new Queue<T>(sharedCapacity); in DefaultObjectPool()
87 if (localData.Queue.Count > 0) in LeaseInternal()
89 return localData.Queue.Dequeue(); in LeaseInternal()
107 localData.Queue.Enqueue(sharedQueue.Dequeue()); in LeaseInternal()
136 if (localData.Queue.Count < threadLocalCapacity && !disposed) in Return()
138 localData.Queue.Enqueue(item); in Return()
159 sharedQueue.Enqueue(localData.Queue.Dequeue()); in Return()
197 this.Queue = new Queue<T>(capacity); in ThreadLocalData()
200 public Queue<T> Queue { get; } property in Grpc.Core.Internal.DefaultObjectPool.ThreadLocalData
|
| /external/python/cpython2/Doc/library/ |
| D | queue.rst | 1 :mod:`Queue` --- A synchronized queue class
4 .. module:: Queue
8 The :mod:`Queue` module has been renamed to :mod:`queue` in Python 3. The
12 **Source code:** :source:`Lib/Queue.py`
16 The :mod:`Queue` module implements multi-producer, multi-consumer queues.
18 exchanged safely between multiple threads. The :class:`~Queue.Queue` class in this
30 The :mod:`Queue` module defines the following classes and exceptions:
32 .. class:: Queue(maxsize=0)
63 Exception raised when non-blocking :meth:`~Queue.get` (or
64 :meth:`~Queue.get_nowait`) is called
[all …]
|
| /external/tensorflow/tensorflow/core/kernels/batching_util/ |
| D | shared_batch_scheduler.h | 43 class Queue; variable
183 using QueueList = std::list<std::unique_ptr<internal::Queue<TaskType>>>;
228 class Queue {
233 Queue(const typename SharedBatchScheduler<TaskType>::QueueOptions& options,
238 ~Queue();
329 TF_DISALLOW_COPY_AND_ASSIGN(Queue);
338 Queue<TaskType>* queue);
353 Queue<TaskType>* queue_;
417 std::unique_ptr<internal::Queue<TaskType>>(new internal::Queue<TaskType>( in AddQueue()
454 internal::Queue<TaskType>* queue_for_batch = nullptr; in ThreadLogic()
[all …]
|
| /external/python/cpython3/Lib/test/test_asyncio/ |
| D | test_queues.py | 34 q = asyncio.Queue(loop=loop)
40 q = asyncio.Queue(loop=loop)
52 q = asyncio.Queue(maxsize=1, loop=loop)
64 q = asyncio.Queue(loop=loop)
70 q = asyncio.Queue(loop=loop)
73 q = asyncio.Queue(loop=self.loop)
78 q = asyncio.Queue()
88 q = asyncio.Queue(loop=self.loop)
96 q = asyncio.Queue(loop=self.loop)
99 q = asyncio.Queue(maxsize=1, loop=self.loop)
[all …]
|
| /external/python/cpython2/Lib/test/ |
| D | test_queue.py | 3 import Queue
97 target_order = dict(Queue = [111, 333, 222],
114 except Queue.Full:
119 except Queue.Full:
131 except Queue.Empty:
136 except Queue.Empty:
198 type2test = Queue.Queue
201 type2test = Queue.LifoQueue
204 type2test = Queue.PriorityQueue
212 class FailingQueue(Queue.Queue):
[all …]
|
| /external/antlr/runtime/ObjC/Framework/test/runtime/misc/ |
| D | FastQueueTest.m | 19 STAssertNotNil(queue, @"Queue was not created and was nil");
26 STAssertNotNil(queue, @"Queue was not created and was nil");
30 STAssertTrue([queue size] == 1, @"Queue is the wrong size: %d", [queue size]);
39 STAssertNotNil(queue, @"Queue was not created and was nil");
56 STAssertNotNil(queue, @"Queue was not created and was nil");
69 STAssertNotNil(queue, @"Queue was not created and was nil");
73 STAssertTrue([queue size] == 3, @"Queue was too small, was: %d expected 3", [queue size]);
75 STAssertTrue([queue size] == 0, @"Queue is not empty, it's still %d", [queue size]);
82 STAssertNotNil(queue, @"Queue was not created and was nil");
85 …STAssertTrue([[queue description] isEqualToString:@"My String"], @"Queue description was not right…
[all …]
|
| /external/python/cpython2/Lib/multiprocessing/dummy/ |
| D | connection.py | 37 from Queue import Queue
46 self._backlog_queue = Queue(backlog)
58 _in, _out = Queue(), Queue()
64 a, b = Queue(), Queue()
|
| /external/libchrome/base/message_loop/ |
| D | incoming_task_queue.h | 71 class Queue : public ReadAndRemoveOnlyQueue {
73 Queue() = default;
74 ~Queue() override = default;
80 DISALLOW_COPY_AND_ASSIGN(Queue);
111 Queue& delayed_tasks() { return delayed_tasks_; } in delayed_tasks()
113 Queue& deferred_tasks() { return deferred_tasks_; } in deferred_tasks()
173 class DelayedQueue : public Queue {
202 class DeferredQueue : public Queue {
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | ForwardingQueueTest.java | 31 import java.util.Queue;
43 private final Queue<T> backingQueue;
45 StandardImplForwardingQueue(Queue<T> backingQueue) { in StandardImplForwardingQueue()
49 @Override protected Queue<T> delegate() { in delegate()
106 private Queue<String> forward;
107 private Queue<String> queue;
116 @Override protected Queue<String> create(String[] elements) { in suite()
137 queue = createProxyInstance(Queue.class); in setUp()
139 @Override protected Queue<String> delegate() { in setUp()
|
| /external/swiftshader/src/Vulkan/ |
| D | VkQueue.hpp | 30 class Queue class
35 Queue(uint32_t pFamilyIndex, float pPriority);
36 ~Queue() = delete;
54 static inline Queue* Cast(VkQueue object) in Cast()
56 return reinterpret_cast<Queue*>(object); in Cast()
|
| D | VkQueue.cpp | 24 Queue::Queue(uint32_t pFamilyIndex, float pPriority) : familyIndex(pFamilyIndex), priority(pPriorit… in Queue() function in vk::Queue
30 void Queue::destroy() in destroy()
36 void Queue::submit(uint32_t submitCount, const VkSubmitInfo* pSubmits, VkFence fence) in submit()
68 void Queue::waitIdle() in waitIdle()
|
| /external/v8/tools/testrunner/local/ |
| D | pool.py | 6 from Queue import Empty
8 from multiprocessing import Process, Queue
21 global Queue
23 del Queue
25 from Queue import Queue
28 Queue.cancel_join_thread = lambda self: None
123 self.work_queue = Queue()
124 self.done_queue = Queue()
|
| /external/python/cpython3/Lib/multiprocessing/dummy/ |
| D | connection.py | 12 from queue import Queue
21 self._backlog_queue = Queue(backlog)
41 _in, _out = Queue(), Queue()
47 a, b = Queue(), Queue()
|
| /external/llvm/unittests/ExecutionEngine/Orc/ |
| D | RPCUtilsTest.cpp | 20 class Queue : public std::queue<char> { class
30 QueueChannel(Queue &InQueue, Queue &OutQueue) in QueueChannel()
60 Queue &InQueue;
61 Queue &OutQueue;
81 Queue Q1, Q2; in TEST_F()
110 Queue Q1, Q2; in TEST_F()
140 Queue Q1, Q2; in TEST_F()
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| D | MinMaxPriorityQueueBenchmark.java | 30 import java.util.Queue;
47 private Queue<Integer> queue;
87 protected Queue<T> delegate() { in delegate()
100 @Override public Queue<Integer> create(Comparator<Integer> comparator) { in create()
105 @Override public Queue<Integer> create(Comparator<Integer> comparator) { in create()
110 @Override public Queue<Integer> create(Comparator<Integer> comparator) { in create()
115 public abstract Queue<Integer> create(Comparator<Integer> comparator); in create()
|
| /external/python/cpython3/Doc/library/ |
| D | queue.rst | 13 exchanged safely between multiple threads. The :class:`Queue` class in this
37 .. class:: Queue(maxsize=0)
86 Exception raised when non-blocking :meth:`~Queue.get` (or
87 :meth:`~Queue.get_nowait`) is called
88 on a :class:`Queue` object which is empty.
93 Exception raised when non-blocking :meth:`~Queue.put` (or
94 :meth:`~Queue.put_nowait`) is called
95 on a :class:`Queue` object which is full.
100 Queue Objects
103 Queue objects (:class:`Queue`, :class:`LifoQueue`, or :class:`PriorityQueue`)
[all …]
|