Home
last modified time | relevance | path

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

12345678

/netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/
H A DOptimizedStructLayout.cpp275 for (auto &Queue : FlexibleFieldsByAlignment) { in performOptimizedStructLayout() local
276 assert((FirstQueue || Queue.Alignment < LastQueueAlignment) && in performOptimizedStructLayout()
278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
284 assert(I->Alignment == Queue.Alignment && "bad field in queue"); in performOptimizedStructLayout()
294 auto spliceFromQueue = [&](AlignmentQueue *Queue, Field *Last, Field *Cur) { in performOptimizedStructLayout() argument
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp83 Queue.push_back(SU); in push()
119 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop()
120 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()), in pop()
121 E = Queue.end(); I != E; ++I) in pop()
125 if (Best != std::prev(Queue.end())) in pop()
126 std::swap(*Best, Queue.back()); in pop()
127 Queue.pop_back(); in pop()
132 assert(!Queue.empty() && "Queue is empty!"); in remove()
133 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
134 assert(I != Queue.end() && "Queue doesn't contain the SU being removed!"); in remove()
[all …]
H A DRegAllocBasic.cpp69 CompSpillWeight> Queue; member in __anon94a60d4a0211::RABasic
92 Queue.push(LI); in enqueue()
96 if (Queue.empty()) in dequeue()
98 LiveInterval *LI = Queue.top(); in dequeue()
99 Queue.pop(); in dequeue()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/MCA/HardwareUnits/
H A DRetireControlUnit.cpp39 Queue.resize(2 * NumROBEntries); in RetireControlUnit()
49 Queue[NextAvailableSlotIdx] = {IR, Entries, false}; in dispatch()
51 NextAvailableSlotIdx %= Queue.size(); in dispatch()
59 const RetireControlUnit::RUToken &Current = Queue[CurrentInstructionSlotIdx]; in getCurrentToken()
70 return NextSlotIdx % Queue.size(); in computeNextSlotIdx()
74 return Queue[computeNextSlotIdx()]; in peekNextToken()
78 RetireControlUnit::RUToken &Current = Queue[CurrentInstructionSlotIdx]; in consumeCurrentToken()
83 CurrentInstructionSlotIdx %= Queue.size(); in consumeCurrentToken()
89 assert(Queue.size() > TokenID); in onInstructionExecuted()
90 assert(Queue[TokenID].IR.getInstruction() && "Instruction was not dispatched!"); in onInstructionExecuted()
[all …]
/netbsd-src/external/apache2/llvm/dist/clang/lib/DirectoryWatcher/mac/
H A DDirectoryWatcher-mac.cpp49 dispatch_queue_t Queue, FSEventStreamRef EventStream, in DirectoryWatcherMac() argument
53 : Queue(Queue), EventStream(EventStream), Receiver(Receiver), in DirectoryWatcherMac()
60 dispatch_sync(Queue, ^{ in ~DirectoryWatcherMac()
70 dispatch_release(Queue); in ~DirectoryWatcherMac()
74 dispatch_queue_t Queue; member in __anona49f37580111::DirectoryWatcherMac
163 dispatch_queue_t Queue) { in createFSEventStream() argument
220 dispatch_queue_t Queue = in create() local
227 auto EventStream = createFSEventStream(Path, Receiver, Queue); in create()
231 std::make_unique<DirectoryWatcherMac>(Queue, EventStream, Receiver, Path); in create()
242 FSEventStreamSetDispatchQueue(EventStream, Queue); in create()
[all …]
/netbsd-src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp57 std::deque<WorkListUnit> Queue; member in __anon126612d90111::BFS
61 return !Queue.empty(); in hasWork()
65 Queue.push_back(U); in enqueue()
69 WorkListUnit U = Queue.front(); in dequeue()
70 Queue.pop_front(); in dequeue()
92 std::deque<WorkListUnit> Queue; member in __anon126612d90211::BFSBlockDFSContents
97 return !Queue.empty() || !Stack.empty(); in hasWork()
102 Queue.push_front(U); in enqueue()
115 assert(!Queue.empty()); in dequeue()
118 WorkListUnit U = Queue.front(); in dequeue()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp238 Queue.push_back(SU); in push()
594 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop()
597 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) { in pop()
607 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) in pop()
613 if (Best != std::prev(Queue.end())) in pop()
614 std::swap(*Best, Queue.back()); in pop()
616 Queue.pop_back(); in pop()
623 assert(!Queue.empty() && "Queue is empty!"); in remove()
624 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
625 if (I != std::prev(Queue.end())) 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()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h57 std::queue<ContextTrieNode *> Queue; in ProfiledCallGraph() local
61 Queue.push(Callee); in ProfiledCallGraph()
64 while (!Queue.empty()) { in ProfiledCallGraph()
65 ContextTrieNode *Caller = Queue.front(); in ProfiledCallGraph()
66 Queue.pop(); in ProfiledCallGraph()
77 Queue.push(Callee); in ProfiledCallGraph()
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-objcopy/MachO/
H A DMachOWriter.cpp432 SmallVector<WriteOperation, 7> Queue; in writeTail() local
439 Queue.push_back({SymTabCommand.symoff, &MachOWriter::writeSymbolTable}); in writeTail()
441 Queue.push_back({SymTabCommand.stroff, &MachOWriter::writeStringTable}); in writeTail()
449 Queue.push_back( in writeTail()
452 Queue.push_back({DyLdInfoCommand.bind_off, &MachOWriter::writeBindInfo}); in writeTail()
454 Queue.push_back( in writeTail()
457 Queue.push_back( in writeTail()
460 Queue.push_back( in writeTail()
470 Queue.emplace_back(DySymTabCommand.indirectsymoff, in writeTail()
480 Queue.emplace_back(LinkEditDataCommand.dataoff, in writeTail()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h534 std::vector<SUnit*> Queue; variable
546 bool empty() const { return Queue.empty(); } in empty()
548 void clear() { Queue.clear(); } in clear()
550 unsigned size() const { return Queue.size(); } in size()
554 iterator begin() { return Queue.begin(); } in begin()
556 iterator end() { return Queue.end(); } in end()
558 ArrayRef<SUnit*> elements() { return Queue; } in elements()
560 iterator find(SUnit *SU) { return llvm::find(Queue, SU); } in find()
563 Queue.push_back(SU); in push()
569 *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.h48 std::vector<SUnit*> Queue; variable
113 bool empty() const override { return Queue.empty(); } in empty()
/netbsd-src/external/apache2/llvm/dist/clang/lib/DirectoryWatcher/linux/
H A DDirectoryWatcher-linux.cpp138 EventQueue Queue; member in __anona8b83cb60111::DirectoryWatcherLinux
168 Queue.push_back(DirectoryWatcher::Event::EventKind::WatcherGotInvalidated, in StopWork()
256 Queue.push_back(DirectoryWatcher::Event::EventKind::Modified, in InotifyPollingLoop()
259 Queue.push_back(DirectoryWatcher::Event::EventKind::Removed, in InotifyPollingLoop()
262 Queue.push_back(DirectoryWatcher::Event::EventKind::WatchedDirRemoved, in InotifyPollingLoop()
285 DirectoryWatcher::Event Event = this->Queue.pop_front_blocking(); in EventReceivingLoop()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
H A DRDFDeadCode.cpp29 SetQueue() : Set(), Queue() {} in SetQueue()
32 return Queue.empty(); in empty()
35 T V = Queue.front(); in pop_front()
36 Queue.pop(); in pop_front()
43 Queue.push(V); in push_back()
49 std::queue<T> Queue; member
/netbsd-src/external/apache2/llvm/dist/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp173 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr) { in TraverseStmt() argument
176 Queue = nullptr; in TraverseStmt()
188 return VisitorBase::TraverseStmt(StmtToTraverse, Queue); in TraverseStmt()
485 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr);
493 bool dataTraverseNode(Stmt *S, DataRecursionQueue *Queue) { in dataTraverseNode() argument
564 TraverseStmt(NE, Queue); in dataTraverseNode()
574 return RecursiveASTVisitor<MatchASTVisitor>::dataTraverseNode(S, Queue); in dataTraverseNode()
1008 std::deque<DynTypedNode> Queue(Parents.begin(), Parents.end()); in matchesAnyAncestorOf() local
1010 while (!Queue.empty()) { in matchesAnyAncestorOf()
1012 if (Matcher.matches(Queue.front(), this, &BuilderCopy)) { in matchesAnyAncestorOf()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-diff/
H A DDifferenceEngine.cpp148 PriorityQueue<BlockPair, QueueSorter, 20> Queue; member in __anon0b0ced060111::FunctionDifferenceEngine
167 Queue.insert(BlockPair(L, R)); in tryUnify()
184 while (!Queue.empty()) { in processQueue()
185 BlockPair Pair = Queue.remove_min(); in processQueue()
487 Engine(Engine), Queue(QueueSorter(*this_())) {} in FunctionDifferenceEngine()
688 SmallVector<std::pair<Function*,Function*>, 20> Queue; in diff() local
704 Queue.push_back(std::make_pair(LFn, RFn)); in diff()
731 I = Queue.begin(), E = Queue.end(); I != E; ++I) in diff()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Serialization/
H A DModuleManager.cpp368 SmallVector<ModuleFile *, 4> Queue; in visit() local
369 Queue.reserve(N); in visit()
376 Queue.push_back(&M); in visit()
381 while (!Queue.empty()) { in visit()
382 ModuleFile *CurrentModule = Queue.pop_back_val(); in visit()
396 Queue.push_back(*M); in visit()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Format/
H A DUnwrappedLineFormatter.cpp999 QueueType Queue; in analyzeSolutionSpace() local
1004 Queue.push(QueueItem(OrderedPenalty(0, Count), Node)); in analyzeSolutionSpace()
1010 while (!Queue.empty()) { in analyzeSolutionSpace()
1011 Penalty = Queue.top().first.first; in analyzeSolutionSpace()
1012 StateNode *Node = Queue.top().second; in analyzeSolutionSpace()
1018 Queue.pop(); in analyzeSolutionSpace()
1031 addNextStateToQueue(Penalty, Node, /*NewLine=*/false, &Count, &Queue); in analyzeSolutionSpace()
1033 addNextStateToQueue(Penalty, Node, /*NewLine=*/true, &Count, &Queue); in analyzeSolutionSpace()
1036 if (Queue.empty()) { in analyzeSolutionSpace()
1045 reconstructPath(InitialState, Queue.top().second); in analyzeSolutionSpace()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
H A DGCNILPSched.cpp30 typedef simple_ilist<Candidate> Queue; typedef in __anon5fdfa5e20111::GCNILPScheduler
31 Queue PendingQueue;
32 Queue AvailQueue;
/netbsd-src/external/apache2/llvm/dist/clang/lib/AST/
H A DCXXInheritance.cpp128 SmallVector<const CXXRecordDecl*, 8> Queue; in forallBases() local
145 Queue.push_back(Base); in forallBases()
150 if (Queue.empty()) in forallBases()
152 Record = Queue.pop_back_val(); // not actually a queue. in forallBases()
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/AST/
H A DRecursiveASTVisitor.h210 bool TraverseStmt(Stmt *S, DataRecursionQueue *Queue = nullptr);
322 DataRecursionQueue *Queue = nullptr);
366 if (!TRAVERSE_STMT_BASE(Stmt, Stmt, S, Queue)) \
374 bool Traverse##CLASS(CLASS *S, DataRecursionQueue *Queue = nullptr);
474 bool dataTraverseNode(Stmt *S, DataRecursionQueue *Queue);
512 DataRecursionQueue *Queue) {
520 return TRAVERSE_STMT_BASE(CLASS, CLASS, S, Queue);
579 DataRecursionQueue *Queue) {
583 if (Queue) {
584 Queue->push_back({S, false});
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Object/
H A DWindowsResource.cpp874 std::queue<const WindowsResourceParser::TreeNode *> Queue; in writeDirectoryTree() local
875 Queue.push(&Resources); in writeDirectoryTree()
883 while (!Queue.empty()) { in writeDirectoryTree()
884 auto CurrentNode = Queue.front(); in writeDirectoryTree()
885 Queue.pop(); in writeDirectoryTree()
915 Queue.push(Child.second.get()); in writeDirectoryTree()
934 Queue.push(Child.second.get()); in writeDirectoryTree()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Analysis/
H A DUninitializedValues.cpp557 SmallVector<const CFGBlock*, 32> Queue; in getUninitUse() local
559 Queue.push_back(block); in getUninitUse()
564 while (!Queue.empty()) { in getUninitUse()
565 const CFGBlock *B = Queue.pop_back_val(); in getUninitUse()
628 Queue.push_back(Pred); in getUninitUse()
/netbsd-src/sys/gdbscripts/
H A Dbdump72 printf "Queue %d\n", $i
97 printf "Queue %d\n", $arg0

12345678