| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Sd/SdDxe/ |
| SdDxe.h | 104 LIST_ENTRY Queue;
|
| /device/linaro/bootloader/edk2/StdLib/Include/Containers/ |
| Fifo.h | 26 AsElements, ///< Count the number of readable elements in the queue.
27 AsBytes ///< Count the number of readable bytes in the queue.
30 /** Construct a new instance of a FIFO Queue.
200 void *Queue; ///< The FIFO's data storage.
|
| /device/linaro/bootloader/edk2/StdLib/LibC/Containers/Queues/ |
| Fifo.c | 233 QPtr = (uintptr_t)Self->Queue + (SizeOfElement * Windex); // Addr. in FIFO to write, as an integer
239 QPtr = (uintptr_t)Self->Queue; // Go to the beginning
295 QPtr = (UINTN)Self->Queue + (RDex * SizeOfElement); // Point to Read location in FIFO
300 QPtr = (UINTN)Self->Queue; // Point back to beginning of data
409 if(Self->Queue != NULL) {
410 FreePool(Self->Queue);
411 Self->Queue = NULL; // Zombie catcher
475 /** Construct a new instance of a FIFO Queue.
491 UINT8 *Queue;
497 Queue = (UINT8 *)AllocateZeroPool(NumElements * ElementSize);
[all...] |
| /device/linaro/bootloader/OpenPlatformPkg/Drivers/SdMmc/DwMmcHcDxe/ |
| DwMmcHcDxe.h | 103 LIST_ENTRY Queue;
[all...] |
| /device/linaro/bootloader/edk2/EmulatorPkg/EmuGopDxe/ |
| Gop.h | 102 GOP_QUEUE_FIXED Queue;
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Sd/EmmcDxe/ |
| EmmcDxe.h | 106 LIST_ENTRY Queue;
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Ufs/UfsPassThruDxe/ |
| UfsPassThru.h | 86 LIST_ENTRY Queue;
[all...] |
| /external/clang/lib/Serialization/ |
| ModuleManager.cpp | 317 // encounter a module with no incoming edges, push it into the queue
318 // to seed the queue.
319 SmallVector<ModuleFile *, 4> Queue;
320 Queue.reserve(N);
327 Queue.push_back(M);
332 while (!Queue.empty()) {
333 ModuleFile *CurrentModule = Queue.pop_back_val();
344 // queue to be visited.
347 Queue.push_back(*M);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 73 std::deque<WorkListUnit> Queue;
76 return !Queue.empty();
80 Queue.push_back(U);
84 WorkListUnit U = Queue.front();
85 Queue.pop_front();
91 I = Queue.begin(), E = Queue.end(); I != E; ++I) {
110 std::deque<WorkListUnit> Queue;
114 return !Queue.empty() || !Stack.empty();
119 Queue.push_front(U)
[all...] |
| /external/eigen/unsupported/Eigen/CXX11/src/ThreadPool/ |
| NonBlockingThreadPool.h | 20 typedef RunQueue<Task, 1024> Queue;
55 queues_.push_back(new Queue());
78 // Worker thread of this pool, push onto the thread's queue.
79 Queue* q = queues_[pt->thread_id];
83 // queue.
84 Queue* q = queues_[Rand(&pt->rand) % queues_.size()];
126 MaxSizeVector<Queue*> queues_;
140 Queue* q = queues_[thread_id];
|
| /external/python/cpython3/Lib/multiprocessing/ |
| context.py | 51 The managers methods such as `Lock()`, `Condition()` and `Queue()`
99 def Queue(self, maxsize=0):
100 '''Returns a queue object'''
101 from .queues import Queue
102 return Queue(maxsize, ctx=self.get_context())
105 '''Returns a queue object'''
110 '''Returns a queue object'''
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| RegAllocBasic.cpp | 49 #include <queue>
95 CompSpillWeight> Queue;
114 Queue.push(LI);
118 if (Queue.empty())
120 LiveInterval *LI = Queue.top();
121 Queue.pop();
263 // them on the priority queue for later assignment.
295 // Top-level driver to manage the queue of unassigned VirtRegs and call the
|
| RegAllocGreedy.cpp | 46 #include <queue>
85 std::priority_queue<std::pair<unsigned, unsigned> > Queue;
363 // Unassigned virtreg is probably in the priority queue.
373 // Register is assigned, put it back on the queue for reassignment.
402 // The queue holds (size, reg) pairs.
427 Queue.push(std::make_pair(Prio, Reg));
431 if (Queue.empty())
433 LiveInterval *LI = &LIS->getInterval(Queue.top().second);
434 Queue.pop();
[all...] |
| /frameworks/base/tests/touchlag/ |
| touchlag.cpp | 189 struct Queue {
195 Queue() : index(0) { }
251 Queue queue; local
277 queue.push(x, y);
278 queue.get(lag, &lag_x, &lag_y);
|
| /device/linaro/bootloader/OpenPlatformPkg/Drivers/Net/Pp2Dxe/ |
| Pp2Dxe.c | 265 INTN Queue;
269 for (Queue = 0; Queue < RxqNumber; Queue++) {
270 Rxq = &Pp2Context->Port.Rxqs[Queue];
293 INTN Queue;
297 for (Queue = 0; Queue < TxqNumber; Queue++) {
298 Txq = &Pp2Context->Port.Txqs[Queue];
[all...] |
| /device/linaro/bootloader/OpenPlatformPkg/Drivers/SdMmc/XenonDxe/ |
| SdMmcPciHcDxe.h | 111 LIST_ENTRY Queue;
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Pci/SdMmcPciHcDxe/ |
| SdMmcPciHcDxe.h | 111 LIST_ENTRY Queue;
[all...] |
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 35 /// A priority queue, implemented as a heap.
134 /// A type which sorts a priority queue by the number of unprocessed
148 /// A queue of unified blocks to process.
149 PriorityQueue<BlockPair, QueueSorter, 20> Queue;
168 Queue.insert(BlockPair(L, R));
185 while (!Queue.empty()) {
186 BlockPair Pair = Queue.remove_min();
457 Engine(Engine), Queue(QueueSorter(*this_())) {}
656 SmallVector<std::pair<Function*,Function*>, 20> Queue;
663 Queue.push_back(std::make_pair(LFn, RFn))
[all...] |
| /external/sonivox/jet_tools/JetCreator/ |
| JetUtils.py | 99 def Queue (jet, queueSeg):
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGFast.cpp | 39 /// FastPriorityQueue - A degenerate priority queue that considers
43 SmallVector<SUnit *, 16> Queue;
45 bool empty() const { return Queue.empty(); }
48 Queue.push_back(U);
53 SUnit *V = Queue.back();
54 Queue.pop_back();
64 /// AvailableQueue - The priority queue to use for the available SUnits.
176 /// the Available queue.
527 // Add root to Available queue.
535 // While Available queue is not empty, grab the node with the highes
[all...] |
| /external/swiftshader/third_party/LLVM/tools/llvm-diff/ |
| DifferenceEngine.cpp | 38 /// A priority queue, implemented as a heap.
137 /// A type which sorts a priority queue by the number of unprocessed
151 /// A queue of unified blocks to process.
152 PriorityQueue<BlockPair, QueueSorter, 20> Queue;
171 Queue.insert(BlockPair(L, R));
188 while (!Queue.empty()) {
189 BlockPair Pair = Queue.remove_min();
457 Engine(Engine), Queue(QueueSorter(*this_())) {}
651 SmallVector<std::pair<Function*,Function*>, 20> Queue;
658 Queue.push_back(std::make_pair(LFn, RFn))
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_codecs.py | 6 class Queue(object):
8 queue: write bytes at one end, read bytes from the other end
32 q = Queue()
191 q = Queue()
[all...] |
| /device/linaro/bootloader/edk2/IntelFrameworkModulePkg/Csm/BiosThunk/KeyboardDxe/ |
| BiosKeyboard.h | 225 SIMPLE_QUEUE Queue;
|
| /external/clang/lib/Format/ |
| UnwrappedLineFormatter.cpp | 668 /// \brief An item in the prioritized BFS search queue. The \c StateNode's
672 /// \brief The BFS queue type.
690 QueueType Queue;
692 // Insert start element into queue.
695 Queue.push(QueueItem(OrderedPenalty(0, Count), Node));
701 while (!Queue.empty()) {
702 Penalty = Queue.top().first.first;
703 StateNode *Node = Queue.top().second;
708 Queue.pop();
721 addNextStateToQueue(Penalty, Node, /*NewLine=*/false, &Count, &Queue);
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGFast.cpp | 45 /// FastPriorityQueue - A degenerate priority queue that considers
49 SmallVector<SUnit *, 16> Queue;
51 bool empty() const { return Queue.empty(); }
54 Queue.push_back(U);
59 SUnit *V = Queue.back();
60 Queue.pop_back();
70 /// AvailableQueue - The priority queue to use for the available SUnits.
182 /// the Available queue.
538 // Add root to Available queue.
546 // While Available queue is not empty, grab the node with the highes
[all...] |
