| /llvm-project-15.0.7/lldb/unittests/Utility/ |
| H A D | SharedClusterTest.cpp | 18 DestructNotifier(std::vector<int> &Queue, int Key) : Queue(Queue), Key(Key) {} in DestructNotifier()
21 std::vector<int> &Queue; member in __anonfa81659b0111::DestructNotifier
27 std::vector<int> Queue; in TEST() local
|
| /llvm-project-15.0.7/llvm/lib/Support/ |
| H A D | OptimizedStructLayout.cpp | 275 for (auto &Queue : FlexibleFieldsByAlignment) { in performOptimizedStructLayout() local
294 auto spliceFromQueue = [&](AlignmentQueue *Queue, Field *Last, Field *Cur) { in performOptimizedStructLayout()
348 auto tryAddFillerFromQueue = [&](AlignmentQueue *Queue, in performOptimizedStructLayout()
350 Optional<uint64_t> EndOffset) -> bool { in performOptimizedStructLayout()
395 for (auto Queue = FirstQueueToSearch; Queue != QueueE; ++Queue) { in performOptimizedStructLayout() local
|
| /llvm-project-15.0.7/clang/lib/DirectoryWatcher/mac/ |
| H A D | DirectoryWatcher-mac.cpp | 49 dispatch_queue_t Queue, FSEventStreamRef EventStream, in DirectoryWatcherMac()
74 dispatch_queue_t Queue; member in __anonf578c27d0111::DirectoryWatcherMac
163 dispatch_queue_t Queue) { in createFSEventStream()
220 dispatch_queue_t Queue = in create() local
|
| /llvm-project-15.0.7/bolt/lib/Passes/ |
| H A D | CallGraphWalker.cpp | 30 std::queue<BinaryFunction *> Queue; in traverseCG() local
|
| H A D | ReorderAlgorithm.cpp | 135 std::vector<EdgeTy> Queue; in clusterBasicBlocks() local
230 void PHGreedyClusterAlgorithm::initQueue(std::vector<EdgeTy> &Queue, in initQueue()
250 void PHGreedyClusterAlgorithm::adjustQueue(std::vector<EdgeTy> &Queue, in adjustQueue()
309 void MinBranchGreedyClusterAlgorithm::initQueue(std::vector<EdgeTy> &Queue, in initQueue()
319 void MinBranchGreedyClusterAlgorithm::adjustQueue(std::vector<EdgeTy> &Queue, in adjustQueue()
|
| /llvm-project-15.0.7/clang-tools-extra/clangd/index/ |
| H A D | Background.h | 124 std::vector<Task> Queue; // max-heap variable
223 BackgroundQueue Queue; variable
|
| /llvm-project-15.0.7/lldb/source/Target/ |
| H A D | Queue.cpp | 18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | LatencyPriorityQueue.h | 43 std::vector<SUnit*> Queue; variable
|
| H A D | ResourcePriorityQueue.h | 48 std::vector<SUnit*> Queue; variable
|
| /llvm-project-15.0.7/llvm/include/llvm/MCA/HardwareUnits/ |
| H A D | RetireControlUnit.h | 63 std::vector<RUToken> Queue; member
|
| /llvm-project-15.0.7/clang/lib/StaticAnalyzer/Core/ |
| H A D | WorkList.cpp | 57 std::deque<WorkListUnit> Queue; member in __anon24f49dde0111::BFS
92 std::deque<WorkListUnit> Queue; member in __anon24f49dde0211::BFSBlockDFSContents
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | SampleProfileInference.cpp | 234 std::queue<uint64_t> Queue; in findAugmentingPath() local
637 std::queue<uint64_t> Queue; in findReachable() local
682 std::set<std::pair<uint64_t, uint64_t>> Queue; in findShortestPath() local
818 std::queue<uint64_t> Queue; in findUnknownSubgraph() local
932 std::queue<uint64_t> Queue; in isAcyclicSubgraph() local
1212 std::queue<uint64_t> Queue; in verifyWeights() local
|
| /llvm-project-15.0.7/libcxx/test/libcxx/containers/sequences/deque/ |
| H A D | spare_block_handling.pass.cpp | 203 using Queue = std::queue<LargeT, D>; in TEST_CASE() typedef
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | RDFDeadCode.cpp | 49 std::queue<T> Queue; member
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | RegAllocBasic.cpp | 67 Queue; member in __anon08d0634f0211::RABasic
|
| /llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/ |
| H A D | ProfiledCallGraph.h | 79 std::queue<ContextTrieNode *> Queue; in ProfiledCallGraph() local
|
| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 350 std::queue<NodeType *> Queue; in scc_member_iterator() local
|
| /llvm-project-15.0.7/clang/lib/DirectoryWatcher/linux/ |
| H A D | DirectoryWatcher-linux.cpp | 139 EventQueue Queue; member in __anon93fcd25b0111::DirectoryWatcherLinux
|
| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | GCNMinRegStrategy.cpp | 33 using Queue = simple_ilist<Candidate>; typedef in __anon7060f7100111::GCNMinRegScheduler
|
| H A D | GCNILPSched.cpp | 30 typedef simple_ilist<Candidate> Queue; typedef in __anoned9f76670111::GCNILPScheduler
|
| /llvm-project-15.0.7/llvm/tools/llvm-diff/lib/ |
| H A D | DifferenceEngine.cpp | 155 PriorityQueue<BlockPair, QueueSorter, 20> Queue; member in __anon246d63510111::FunctionDifferenceEngine
812 SmallVector<std::pair<const Function *, const Function *>, 20> Queue; in diff() local
|
| /llvm-project-15.0.7/clang-tools-extra/pseudo/lib/grammar/ |
| H A D | LRGraph.cpp | 63 State closure(ItemSet Queue, const Grammar &G) { in closure()
|
| /llvm-project-15.0.7/openmp/libomptarget/include/ |
| H A D | omptarget.h | 175 void *Queue = nullptr; member
|
| /llvm-project-15.0.7/clang/lib/ASTMatchers/ |
| H A D | ASTMatchFinder.cpp | 176 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr) { in TraverseStmt()
509 bool dataTraverseNode(Stmt *S, DataRecursionQueue *Queue) { in dataTraverseNode()
1216 std::deque<DynTypedNode> Queue(Parents.begin(), Parents.end()); in matchesAnyAncestorOf() local
1452 bool MatchASTVisitor::TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue) { in TraverseStmt()
|
| /llvm-project-15.0.7/llvm/lib/ObjCopy/MachO/ |
| H A D | MachOWriter.cpp | 574 SmallVector<WriteOperation, 7> Queue; in writeTail() local
|