| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/ |
| AMDGPUCodeObjectMetadata.h | 73 Queue = 6,
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/ |
| MachineScheduler.h | 450 /// queue comparisons.
517 std::vector<SUnit*> Queue;
526 // SU is in this queue if it's NodeQueueID is a superset of this ID.
529 bool empty() const { return Queue.empty(); }
531 void clear() { Queue.clear(); }
533 unsigned size() const { return Queue.size(); }
537 iterator begin() { return Queue.begin(); }
539 iterator end() { return Queue.end(); }
541 ArrayRef<SUnit*> elements() { return Queue; }
543 iterator find(SUnit *SU) { return llvm::find(Queue, SU);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Support/ |
| AMDGPUCodeObjectMetadata.h | 73 Queue = 6,
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/ |
| MachineScheduler.h | 471 /// queue comparisons.
538 std::vector<SUnit*> Queue;
547 // SU is in this queue if it's NodeQueueID is a superset of this ID.
550 bool empty() const { return Queue.empty(); }
552 void clear() { Queue.clear(); }
554 unsigned size() const { return Queue.size(); }
558 iterator begin() { return Queue.begin(); }
560 iterator end() { return Queue.end(); }
562 ArrayRef<SUnit*> elements() { return Queue; }
564 iterator find(SUnit *SU) { return llvm::find(Queue, SU);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/ |
| AMDGPUMetadata.h | 70 Queue = 6,
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/ |
| MachineScheduler.h | 471 /// queue comparisons.
538 std::vector<SUnit*> Queue;
547 // SU is in this queue if it's NodeQueueID is a superset of this ID.
550 bool empty() const { return Queue.empty(); }
552 void clear() { Queue.clear(); }
554 unsigned size() const { return Queue.size(); }
558 iterator begin() { return Queue.begin(); }
560 iterator end() { return Queue.end(); }
562 ArrayRef<SUnit*> elements() { return Queue; }
564 iterator find(SUnit *SU) { return llvm::find(Queue, SU);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/ |
| AMDGPUMetadata.h | 70 Queue = 6,
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/ |
| MachineScheduler.h | 471 /// queue comparisons.
538 std::vector<SUnit*> Queue;
547 // SU is in this queue if it's NodeQueueID is a superset of this ID.
550 bool empty() const { return Queue.empty(); }
552 void clear() { Queue.clear(); }
554 unsigned size() const { return Queue.size(); }
558 iterator begin() { return Queue.begin(); }
560 iterator end() { return Queue.end(); }
562 ArrayRef<SUnit*> elements() { return Queue; }
564 iterator find(SUnit *SU) { return llvm::find(Queue, SU);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/ |
| AMDGPUMetadata.h | 70 Queue = 6,
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/ |
| MachineScheduler.h | 471 /// queue comparisons.
538 std::vector<SUnit*> Queue;
547 // SU is in this queue if it's NodeQueueID is a superset of this ID.
550 bool empty() const { return Queue.empty(); }
552 void clear() { Queue.clear(); }
554 unsigned size() const { return Queue.size(); }
558 iterator begin() { return Queue.begin(); }
560 iterator end() { return Queue.end(); }
562 ArrayRef<SUnit*> elements() { return Queue; }
564 iterator find(SUnit *SU) { return llvm::find(Queue, SU);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/ |
| AMDGPUMetadata.h | 70 Queue = 6,
|
| /device/linaro/bootloader/OpenPlatformPkg/Drivers/Net/Pp2Dxe/ |
| Mvpp2Lib.c | [all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 430 /// queue comparisons.
495 std::vector<SUnit*> Queue;
504 // SU is in this queue if it's NodeQueueID is a superset of this ID.
507 bool empty() const { return Queue.empty(); }
509 void clear() { Queue.clear(); }
511 unsigned size() const { return Queue.size(); }
515 iterator begin() { return Queue.begin(); }
517 iterator end() { return Queue.end(); }
519 ArrayRef<SUnit*> elements() { return Queue; }
522 return std::find(Queue.begin(), Queue.end(), SU)
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocGreedy.cpp | 49 #include <queue>
136 PQueue Queue;
501 // Unassigned virtreg is probably in the priority queue.
510 // Register is assigned, put it back on the queue for reassignment.
536 void RAGreedy::enqueue(LiveInterval *LI) { enqueue(Queue, LI); }
540 // The queue holds (size, reg) pairs.
602 LiveInterval *RAGreedy::dequeue() { return dequeue(Queue); }
[all...] |
| /external/python/cpython3/Lib/test/ |
| test_codecs.py | 25 class Queue(object):
27 queue: write bytes at one end, read bytes from the other end
86 q = Queue(b"")
287 q = Queue(b"")
[all...] |
| _test_multiprocessing.py | 6 import queue as pyqueue
234 q = self.Queue(1)
521 def _test_put(cls, queue, child_can_start, parent_can_continue):
524 queue.get()
529 queue = self.Queue(maxsize=MAXSIZE)
535 args=(queue, child_can_start, parent_can_continue)
540 self.assertEqual(queue_empty(queue), True)
541 self.assertEqual(queue_full(queue, MAXSIZE), False)
543 queue.put(1
[all...] |
| /external/spirv-llvm/lib/SPIRV/ |
| SPIRVInternal.h | 293 const static char Queue[] = "Queue";
[all...] |
| /external/v8/src/arm64/ |
| macro-assembler-arm64.h | 700 void Queue(const CPURegister& rt) {
[all...] |
| /external/v8/src/compiler/ |
| scheduler.cc | 233 Queue(scheduler_->graph_->end());
240 Queue(node->InputAt(i));
254 Queue(exit);
275 Queue(node->InputAt(i));
294 void Queue(Node* node) {
569 ZoneQueue<Node*> queue_; // Queue used for breadth-first traversal.
1343 ZoneQueue<Node*>* queue = &(scheduler_->schedule_queue_); local
[all...] |
| /frameworks/native/services/inputflinger/ |
| InputDispatcher.h | 610 // Generic queue implementation.
612 struct Queue {
617 inline Queue() : head(NULL), tail(NULL), entryCount(0) {
824 // Queue of events that need to be published to the connection.
825 Queue<DispatchEntry> outboundQueue;
827 // Queue of events that have been published to the connection but that have not
829 Queue<DispatchEntry> waitQueue;
861 Queue<EventEntry> mInboundQueue;
862 Queue<EventEntry> mRecentQueue;
863 Queue<CommandEntry> mCommandQueue
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGRRList.cpp | 12 // queue of available nodes to schedule. One at a time, nodes are taken from
13 // the priority queue (thus in priority order), checked for legality to
132 /// AvailableQueue - The priority queue to use for the available SUnits.
397 // CapturePred and others may have left the node in the pending queue, avoid
446 /// so, add them to the available queue.
453 // If the available queue is empty, it is safe to reset MinAvailableCycle.
458 // so, add them to the available queue.
588 /// the Available queue.
[all...] |
| /external/clang/lib/CodeGen/ |
| CGBuiltin.cpp | [all...] |
| /external/clang/lib/AST/ |
| ExprConstant.cpp | [all...] |
| /external/clang/lib/Sema/ |
| SemaDeclCXX.cpp | [all...] |
| /external/icu/tools/srcgen/currysrc/libs/ |
| org.eclipse.core.jobs_3.7.0.v20150330-2103.jar | |
