Home
last modified time | relevance | path

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

1234

/llvm-project-15.0.7/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
73 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]
/llvm-project-15.0.7/lldb/unittests/Utility/
H A DSharedClusterTest.cpp18 DestructNotifier(std::vector<int> &Queue, int Key) : Queue(Queue), Key(Key) {} in DestructNotifier() argument
19 ~DestructNotifier() { Queue.push_back(Key); } in ~DestructNotifier()
21 std::vector<int> &Queue; member in __anonfa81659b0111::DestructNotifier
27 std::vector<int> Queue; in TEST() local
30 auto *One = new DestructNotifier(Queue, 1); in TEST()
31 auto *Two = new DestructNotifier(Queue, 2); in TEST()
35 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
39 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
44 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
53 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
[all …]
/llvm-project-15.0.7/llvm/lib/Support/
H A DOptimizedStructLayout.cpp278 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()
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()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/llvm-project-15.0.7/clang-tools-extra/clangd/index/
H A DBackgroundQueue.cpp28 Queue.clear(); in work()
33 std::pop_heap(Queue.begin(), Queue.end()); in work()
34 Task = std::move(Queue.back()); in work()
35 Queue.pop_back(); in work()
49 if (Stat.Active == 1 && Queue.empty()) { in work()
93 Queue.push_back(std::move(T)); in push()
94 std::push_heap(Queue.begin(), Queue.end()); in push()
107 Queue.push_back(std::move(T)); in append()
110 std::make_heap(Queue.begin(), Queue.end()); in append()
125 for (Task &T : Queue) in boost()
[all …]
H A DBackground.h124 std::vector<Task> Queue; // max-heap variable
160 Queue.push(changedFilesTask(ChangedFiles)); in enqueue()
171 Queue.stop(); in stop()
177 return Queue.blockUntilIdleForTest(TimeoutSeconds);
223 BackgroundQueue Queue; variable
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp81 Queue.push_back(SU); in push()
119 E = Queue.end(); I != E; ++I) in pop()
123 if (Best != std::prev(Queue.end())) in pop()
124 std::swap(*Best, Queue.back()); in pop()
125 Queue.pop_back(); in pop()
130 assert(!Queue.empty() && "Queue is empty!"); in remove()
131 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
133 if (I != std::prev(Queue.end())) in remove()
134 std::swap(*I, Queue.back()); in remove()
135 Queue.pop_back(); in remove()
[all …]
H A DRegAllocBasic.cpp67 Queue; member in __anon08d0634f0211::RABasic
89 void enqueueImpl(const LiveInterval *LI) override { Queue.push(LI); } in enqueueImpl()
92 if (Queue.empty()) in dequeue()
94 const LiveInterval *LI = Queue.top(); in dequeue()
95 Queue.pop(); in dequeue()
/llvm-project-15.0.7/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()
91 assert(Queue[TokenID].Executed == false && "Instruction already executed!"); in onInstructionExecuted()
[all …]
/llvm-project-15.0.7/lldb/include/lldb/Target/
H A DQueue.h32 class Queue : public std::enable_shared_from_this<Queue> {
34 Queue(lldb::ProcessSP process_sp, lldb::queue_id_t queue_id,
37 ~Queue();
147 Queue(const Queue &) = delete;
148 const Queue &operator=(const Queue &) = delete;
/llvm-project-15.0.7/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 __anonf578c27d0111::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()
242 FSEventStreamSetDispatchQueue(EventStream, Queue); in create()
248 dispatch_sync(Queue, InitWork); in create()
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DCallGraphWalker.cpp30 std::queue<BinaryFunction *> Queue; in traverseCG() local
34 Queue.push(Func); in traverseCG()
38 while (!Queue.empty()) { in traverseCG()
39 BinaryFunction *Func = Queue.front(); in traverseCG()
40 Queue.pop(); in traverseCG()
54 Queue.push(CallerFunc); in traverseCG()
H A DReorderAlgorithm.cpp135 std::vector<EdgeTy> Queue; in clusterBasicBlocks() local
159 initQueue(Queue, BF); in clusterBasicBlocks()
162 while (!Queue.empty()) { in clusterBasicBlocks()
163 EdgeTy E = Queue.back(); in clusterBasicBlocks()
164 Queue.pop_back(); in clusterBasicBlocks()
210 adjustQueue(Queue, BF); in clusterBasicBlocks()
247 llvm::sort(Queue, Comp); in initQueue()
312 for (const EdgeTy &E : Queue) in initQueue()
316 adjustQueue(Queue, BF); in initQueue()
388 Queue.swap(NewQueue); in adjustQueue()
[all …]
/llvm-project-15.0.7/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp57 std::deque<WorkListUnit> Queue; member in __anon24f49dde0111::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 __anon24f49dde0211::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 …]
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp235 Queue.push(Source); in findAugmentingPath()
240 Queue.pop(); in findAugmentingPath()
638 Queue.push(Src); in findReachable()
641 Src = Queue.front(); in findReachable()
642 Queue.pop(); in findReachable()
688 Queue.erase(Queue.begin()); in findShortestPath()
824 Queue.pop(); in findUnknownSubgraph()
936 Queue.pop(); in isAcyclicSubgraph()
1214 Queue.push(Func.Entry); in verifyWeights()
1218 Queue.pop(); in verifyWeights()
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp233 Queue.push_back(SU); in push()
592 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) { in pop()
602 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) in pop()
608 if (Best != std::prev(Queue.end())) in pop()
609 std::swap(*Best, Queue.back()); in pop()
611 Queue.pop_back(); in pop()
618 assert(!Queue.empty() && "Queue is empty!"); in remove()
619 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
620 if (I != std::prev(Queue.end())) in remove()
621 std::swap(*I, Queue.back()); in remove()
[all …]
/llvm-project-15.0.7/clang-tools-extra/pseudo/lib/grammar/
H A DLRGraph.cpp63 State closure(ItemSet Queue, const Grammar &G) { in closure() argument
64 llvm::DenseSet<Item> InQueue = {Queue.begin(), Queue.end()}; in closure()
68 while (ItIndex < Queue.size()) { in closure()
69 const Item &ExpandingItem = Queue[ItIndex]; in closure()
81 Queue.push_back(std::move(NewItem)); in closure()
84 Queue.shrink_to_fit(); in closure()
85 llvm::sort(Queue, SortByNextSymbol(G)); in closure()
86 return {std::move(Queue)}; in closure()
/llvm-project-15.0.7/bolt/include/bolt/Passes/
H A DReorderAlgorithm.h87 virtual void initQueue(std::vector<EdgeTy> &Queue,
89 virtual void adjustQueue(std::vector<EdgeTy> &Queue,
110 void initQueue(std::vector<EdgeTy> &Queue, const BinaryFunction &BF) override;
111 void adjustQueue(std::vector<EdgeTy> &Queue,
137 void initQueue(std::vector<EdgeTy> &Queue, const BinaryFunction &BF) override;
138 void adjustQueue(std::vector<EdgeTy> &Queue,
/llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h79 std::queue<ContextTrieNode *> Queue; in ProfiledCallGraph() local
83 Queue.push(Callee); in ProfiledCallGraph()
86 while (!Queue.empty()) { in ProfiledCallGraph()
87 ContextTrieNode *Caller = Queue.front(); in ProfiledCallGraph()
88 Queue.pop(); in ProfiledCallGraph()
100 Queue.push(Callee); in ProfiledCallGraph()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h537 std::vector<SUnit*> Queue; variable
549 bool empty() const { return Queue.empty(); } in empty()
551 void clear() { Queue.clear(); } in clear()
557 iterator begin() { return Queue.begin(); } in begin()
559 iterator end() { return Queue.end(); } in end()
561 ArrayRef<SUnit*> elements() { return Queue; } in elements()
566 Queue.push_back(SU); in push()
572 *I = Queue.back(); in remove()
573 unsigned idx = I - Queue.begin(); in remove()
574 Queue.pop_back(); in remove()
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/container.adaptors/queue/queue.defn/
H A Demplace.pass.cpp26 template <typename Queue>
28 typedef typename Queue::container_type Container; in test_return_type()
30 typedef decltype(std::declval<Queue>().emplace(std::declval<value_type &>())) queue_return_type; in test_return_type()
/llvm-project-15.0.7/clang-tools-extra/clangd/unittests/
H A DClangdLSPServerTests.cpp278 std::deque<Callback<int>> Queue; // null = increment, non-null = read. in TEST_F() member in clang::clangd::__anon7e5ef16f0111::TEST_F::AsyncCounter
286 CV.wait(Lock, [&] { return ShouldStop || !Queue.empty(); }); in TEST_F()
288 Queue.clear(); in TEST_F()
292 Callback<int> &Task = Queue.front(); in TEST_F()
297 Queue.pop_front(); in TEST_F()
304 return clangd::wait(Lock, CV, D, [this] { return Queue.empty(); }); in TEST_F()
326 EXPECT_EQ(Queue.size(), 0u) << "ClangdServer should block until idle"; in TEST_F()
347 Queue.push_back(nullptr); in TEST_F()
/llvm-project-15.0.7/clang/lib/DirectoryWatcher/linux/
H A DDirectoryWatcher-linux.cpp139 EventQueue Queue; member in __anon93fcd25b0111::DirectoryWatcherLinux
169 Queue.push_back(DirectoryWatcher::Event::EventKind::WatcherGotInvalidated, in StopWork()
257 Queue.push_back(DirectoryWatcher::Event::EventKind::Modified, in InotifyPollingLoop()
260 Queue.push_back(DirectoryWatcher::Event::EventKind::Removed, in InotifyPollingLoop()
263 Queue.push_back(DirectoryWatcher::Event::EventKind::WatchedDirRemoved, in InotifyPollingLoop()
286 DirectoryWatcher::Event Event = this->Queue.pop_front_blocking(); in EventReceivingLoop()
/llvm-project-15.0.7/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
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSCCIterator.h350 std::queue<NodeType *> Queue; in scc_member_iterator() local
355 Queue.push(Edge->Source); in scc_member_iterator()
360 while (!Queue.empty()) { in scc_member_iterator()
361 auto *Node = Queue.front(); in scc_member_iterator()
362 Queue.pop(); in scc_member_iterator()
367 Queue.push(Edge.Target); in scc_member_iterator()
/llvm-project-15.0.7/clang-tools-extra/clang-include-fixer/find-all-symbols/tool/
H A Drun-find-all-symbols.py29 import Queue
101 queue = Queue.Queue(max_task)

1234