Home
last modified time | relevance | path

Searched refs:Queue (Results 1 – 25 of 38) sorted by relevance

12

/minix3/external/bsd/llvm/dist/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp84 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 …]
H A DRegAllocBasic.cpp69 CompSpillWeight> Queue; member in __anon8286a6b20211::RABasic
91 Queue.push(LI); in enqueue()
95 if (Queue.empty()) in dequeue()
97 LiveInterval *LI = Queue.top(); in dequeue()
98 Queue.pop(); in dequeue()
/minix3/external/bsd/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp241 Queue.push_back(SU); in push()
602 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop()
605 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()), in pop()
606 E = Queue.end(); I != E; ++I) { in pop()
616 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()), in pop()
617 E = Queue.end(); I != E; ++I) in pop()
623 if (Best != std::prev(Queue.end())) in pop()
624 std::swap(*Best, Queue.back()); in pop()
626 Queue.pop_back(); in pop()
633 assert(!Queue.empty() && "Queue is empty!"); in remove()
[all …]
H A DScheduleDAGFast.cpp49 SmallVector<SUnit *, 16> Queue; member
51 bool empty() const { return Queue.empty(); } in empty()
54 Queue.push_back(U); in push()
59 SUnit *V = Queue.back(); in pop()
60 Queue.pop_back(); in pop()
H A DScheduleDAGRRList.cpp1623 std::vector<SUnit*> Queue; member in __anon063571610211::RegReductionPQBase
1699 bool empty() const override { return Queue.empty(); } in empty()
1704 Queue.push_back(U); in push()
1708 assert(!Queue.empty() && "Queue is empty!"); in remove()
1710 std::vector<SUnit *>::iterator I = std::find(Queue.begin(), Queue.end(), in remove()
1712 if (I != std::prev(Queue.end())) in remove()
1713 std::swap(*I, Queue.back()); in remove()
1714 Queue.pop_back(); in remove()
1787 if (Queue.empty()) return nullptr; in pop()
1789 SUnit *V = popFromQueue(Queue, Picker, scheduleDAG); in pop()
[all …]
/minix3/external/bsd/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h477 std::vector<SUnit*> Queue; variable
489 bool empty() const { return Queue.empty(); } in empty()
491 void clear() { Queue.clear(); } in clear()
493 unsigned size() const { return Queue.size(); } in size()
497 iterator begin() { return Queue.begin(); } in begin()
499 iterator end() { return Queue.end(); } in end()
501 ArrayRef<SUnit*> elements() { return Queue; } in elements()
504 return std::find(Queue.begin(), Queue.end(), SU); in find()
508 Queue.push_back(SU); in push()
514 *I = Queue.back(); in remove()
[all …]
H A DLatencyPriorityQueue.h43 std::vector<SUnit*> Queue; variable
78 bool empty() const override { return Queue.empty(); } in empty()
H A DResourcePriorityQueue.h49 std::vector<SUnit*> Queue; variable
119 bool empty() const override { return Queue.empty(); } in empty()
/minix3/external/bsd/llvm/dist/clang/lib/StaticAnalyzer/Core/
H A DCoreEngine.cpp73 std::deque<WorkListUnit> Queue; member in __anon3c7a8e810111::BFS
76 return !Queue.empty(); in hasWork()
80 Queue.push_back(U); in enqueue()
84 WorkListUnit U = Queue.front(); in dequeue()
85 Queue.pop_front(); in dequeue()
91 I = Queue.begin(), E = Queue.end(); I != E; ++I) { in visitItemsInWorkList()
110 std::deque<WorkListUnit> Queue; member in __anon3c7a8e810211::BFSBlockDFSContents
114 return !Queue.empty() || !Stack.empty(); in hasWork()
119 Queue.push_front(U); in enqueue()
132 assert(!Queue.empty()); in dequeue()
[all …]
/minix3/external/bsd/llvm/dist/clang/lib/Format/
H A DUnwrappedLineFormatter.cpp543 QueueType Queue; in analyzeSolutionSpace() local
548 Queue.push(QueueItem(OrderedPenalty(0, Count), Node)); in analyzeSolutionSpace()
554 while (!Queue.empty()) { in analyzeSolutionSpace()
555 Penalty = Queue.top().first.first; in analyzeSolutionSpace()
556 StateNode *Node = Queue.top().second; in analyzeSolutionSpace()
561 Queue.pop(); in analyzeSolutionSpace()
574 addNextStateToQueue(Penalty, Node, /*NewLine=*/false, &Count, &Queue); in analyzeSolutionSpace()
576 addNextStateToQueue(Penalty, Node, /*NewLine=*/true, &Count, &Queue); in analyzeSolutionSpace()
579 if (Queue.empty()) { in analyzeSolutionSpace()
588 reconstructPath(InitialState, Queue.top().second); in analyzeSolutionSpace()
[all …]
H A DUnwrappedLineFormatter.h128 bool NewLine, unsigned *Count, QueueType *Queue);
/minix3/external/bsd/llvm/dist/clang/lib/Serialization/
H A DModuleManager.cpp294 SmallVector<ModuleFile *, 4> Queue; in visit() local
295 Queue.reserve(N); in visit()
303 Queue.push_back(*M); in visit()
310 while (QueueStart < Queue.size()) { in visit()
311 ModuleFile *CurrentModule = Queue[QueueStart++]; in visit()
326 Queue.push_back(*M); in visit()
/minix3/external/bsd/llvm/dist/llvm/tools/llvm-diff/
H A DDifferenceEngine.cpp150 PriorityQueue<BlockPair, QueueSorter, 20> Queue; member in __anonefe5e16e0111::FunctionDifferenceEngine
169 Queue.insert(BlockPair(L, R)); in tryUnify()
186 while (!Queue.empty()) { in processQueue()
187 BlockPair Pair = Queue.remove_min(); in processQueue()
457 Engine(Engine), Queue(QueueSorter(*this_())) {} in FunctionDifferenceEngine()
653 SmallVector<std::pair<Function*,Function*>, 20> Queue; in diff() local
660 Queue.push_back(std::make_pair(LFn, RFn)); in diff()
672 I = Queue.begin(), E = Queue.end(); I != E; ++I) in diff()
/minix3/external/bsd/llvm/dist/llvm/utils/lit/lit/
H A Drun.py6 import Queue as queue
116 self.queue = multiprocessing.Queue()
216 queue_impl = multiprocessing.Queue
227 queue_impl = queue.Queue
/minix3/external/bsd/llvm/lib/liblldbTarget/
H A DMakefile29 Queue.cpp \
/minix3/external/bsd/llvm/dist/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp664 std::deque<ast_type_traits::DynTypedNode> Queue(Parents.begin(), in memoizedMatchesAncestorOfRecursively() local
666 while (!Queue.empty()) { in memoizedMatchesAncestorOfRecursively()
668 if (Matcher.matches(Queue.front(), this, &Result.Nodes)) { in memoizedMatchesAncestorOfRecursively()
674 ActiveASTContext->getParents(Queue.front())) { in memoizedMatchesAncestorOfRecursively()
679 Queue.push_back(Parent); in memoizedMatchesAncestorOfRecursively()
682 Queue.pop_front(); in memoizedMatchesAncestorOfRecursively()
/minix3/external/bsd/llvm/dist/clang/lib/AST/
H A DCXXInheritance.cpp135 SmallVector<const CXXRecordDecl*, 8> Queue; in forallBases() local
158 Queue.push_back(Base); in forallBases()
166 if (Queue.empty()) in forallBases()
168 Record = Queue.pop_back_val(); // not actually a queue. in forallBases()
/minix3/external/bsd/llvm/dist/clang/lib/Analysis/
H A DUninitializedValues.cpp546 SmallVector<const CFGBlock*, 32> Queue; in getUninitUse() local
548 Queue.push_back(block); in getUninitUse()
553 while (!Queue.empty()) { in getUninitUse()
554 const CFGBlock *B = Queue.pop_back_val(); in getUninitUse()
595 Queue.push_back(Pred); in getUninitUse()
/minix3/external/bsd/llvm/dist/llvm/lib/Transforms/Scalar/
H A DLoopRerollPass.cpp474 SmallInstructionVector Queue(1, Root); in collectInLoopUserSet() local
475 while (!Queue.empty()) { in collectInLoopUserSet()
476 Instruction *I = Queue.pop_back_val(); in collectInLoopUserSet()
490 Queue.push_back(User); in collectInLoopUserSet()
500 Queue.push_back(Op); in collectInLoopUserSet()
/minix3/external/bsd/llvm/dist/clang/include/clang/AST/
H A DRecursiveASTVisitor.h452 SmallVector<EnqueueJob, 16> Queue; in dataTraverse() local
453 Queue.push_back(S); in dataTraverse()
455 while (!Queue.empty()) { in dataTraverse()
456 EnqueueJob &job = Queue.back(); in dataTraverse()
459 Queue.pop_back(); in dataTraverse()
469 Queue.pop_back(); in dataTraverse()
478 Queue.push_back(*job.StmtIt); in dataTraverse()
480 Queue.pop_back(); in dataTraverse()
484 Queue.pop_back(); in dataTraverse()
H A DDataRecursiveASTVisitor.h474 StmtsTy Queue, StmtsToEnqueue; in TraverseStmt() local
475 Queue.push_back(S); in TraverseStmt()
478 while (!Queue.empty()) { in TraverseStmt()
479 S = Queue.pop_back_val(); in TraverseStmt()
537 Queue.push_back(*RI); in TraverseStmt()
/minix3/external/bsd/llvm/dist/llvm/lib/Transforms/Utils/
H A DInlineFunction.cpp311 SmallVector<const Metadata *, 16> Queue(MD.begin(), MD.end()); in CloneAliasScopeMetadata() local
312 while (!Queue.empty()) { in CloneAliasScopeMetadata()
313 const MDNode *M = cast<MDNode>(Queue.pop_back_val()); in CloneAliasScopeMetadata()
317 Queue.push_back(M1); in CloneAliasScopeMetadata()
/minix3/external/bsd/llvm/dist/clang/lib/Sema/
H A DSemaLookup.cpp1449 SmallVector<NamespaceDecl*, 8> Queue; in LookupQualifiedNameInUsingDirectives() local
1456 Queue.push_back(ND); in LookupQualifiedNameInUsingDirectives()
1469 while (!Queue.empty()) { in LookupQualifiedNameInUsingDirectives()
1470 NamespaceDecl *ND = Queue.pop_back_val(); in LookupQualifiedNameInUsingDirectives()
1504 Queue.push_back(Nom); in LookupQualifiedNameInUsingDirectives()
2145 SmallVector<const Type *, 16> Queue; in addAssociatedClassesAndNamespaces() local
2217 Queue.push_back(Arg.getTypePtr()); in addAssociatedClassesAndNamespaces()
2239 Queue.push_back(MemberPtr->getClass()); in addAssociatedClassesAndNamespaces()
2284 if (Queue.empty()) in addAssociatedClassesAndNamespaces()
2286 T = Queue.pop_back_val(); in addAssociatedClassesAndNamespaces()
H A DSemaAccess.cpp286 SmallVector<const CXXRecordDecl*, 8> Queue; // actually a stack in IsDerivedFromInclusive() local
312 Queue.push_back(RD); in IsDerivedFromInclusive()
315 if (Queue.empty()) break; in IsDerivedFromInclusive()
317 Derived = Queue.pop_back_val(); in IsDerivedFromInclusive()
/minix3/external/bsd/file/dist/magic/magdir/
H A Ddatabase78 >16 long >0 (Queue, version %d, native byte-order)
80 >16 belong >0 (Queue, version %d, big-endian)
82 >16 lelong >0 (Queue, version %d, little-endian)

12