| /openbsd-src/gnu/llvm/llvm/lib/Support/ |
| H A D | OptimizedStructLayout.cpp | 276 for (auto &Queue : FlexibleFieldsByAlignment) { in performOptimizedStructLayout() local
295 auto spliceFromQueue = [&](AlignmentQueue *Queue, Field *Last, Field *Cur) { in performOptimizedStructLayout()
349 auto tryAddFillerFromQueue = [&](AlignmentQueue *Queue, uint64_t StartOffset, in performOptimizedStructLayout()
350 std::optional<uint64_t> EndOffset) -> bool { in performOptimizedStructLayout()
396 for (auto Queue = FirstQueueToSearch; Queue != QueueE; ++Queue) { in performOptimizedStructLayout() local
|
| /openbsd-src/gnu/llvm/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 __anon0fd2c5240111::DirectoryWatcherMac
163 dispatch_queue_t Queue) { in createFSEventStream()
220 dispatch_queue_t Queue = in create() local
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/ |
| H A D | SampleProfileInference.cpp | 241 std::queue<uint64_t> Queue; in findAugmentingPath() local
648 std::queue<uint64_t> Queue; in findReachable() local
693 std::set<std::pair<uint64_t, uint64_t>> Queue; in findShortestPath() local
828 std::queue<uint64_t> Queue; in findUnknownSubgraph() local
942 std::queue<uint64_t> Queue; in isAcyclicSubgraph() local
1281 std::queue<uint64_t> Queue; in verifyOutput() local
|
| /openbsd-src/gnu/llvm/clang/lib/StaticAnalyzer/Core/ |
| H A D | WorkList.cpp | 57 std::deque<WorkListUnit> Queue; member in __anon59a745250111::BFS
92 std::deque<WorkListUnit> Queue; member in __anon59a745250211::BFSBlockDFSContents
|
| /openbsd-src/gnu/llvm/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
|
| /openbsd-src/gnu/llvm/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
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/MCA/HardwareUnits/ |
| H A D | RetireControlUnit.h | 63 std::vector<RUToken> Queue; member
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/ |
| H A D | RDFDeadCode.cpp | 49 std::queue<T> Queue; member
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | RegAllocBasic.cpp | 67 Queue; member in __anon9cafb3960211::RABasic
|
| H A D | RegAllocGreedy.h | 186 PQueue Queue; variable
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/IPO/ |
| H A D | ProfiledCallGraph.h | 79 std::queue<ContextTrieNode *> Queue; in ProfiledCallGraph() local
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 350 std::queue<NodeType *> Queue; in scc_member_iterator() local
|
| /openbsd-src/gnu/llvm/clang/lib/DirectoryWatcher/linux/ |
| H A D | DirectoryWatcher-linux.cpp | 140 EventQueue Queue; member in __anon7b55d0820111::DirectoryWatcherLinux
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/ |
| H A D | GCNMinRegStrategy.cpp | 33 using Queue = simple_ilist<Candidate>; typedef in __anon9c5a8c170111::GCNMinRegScheduler
|
| H A D | GCNILPSched.cpp | 30 typedef simple_ilist<Candidate> Queue; typedef in __anon05ab922e0111::GCNILPScheduler
|
| /openbsd-src/gnu/llvm/llvm/tools/llvm-diff/lib/ |
| H A D | DifferenceEngine.cpp | 241 PriorityQueue<BlockPair, QueueSorter, 20> Queue; member in __anoncf9999380111::FunctionDifferenceEngine
975 SmallVector<std::pair<const Function *, const Function *>, 20> Queue; in diff() local
|
| /openbsd-src/gnu/llvm/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()
|
| /openbsd-src/gnu/llvm/clang/lib/Format/ |
| H A D | UnwrappedLineFormatter.cpp | 1175 QueueType Queue; in analyzeSolutionSpace() local
1240 bool NewLine, unsigned *Count, QueueType *Queue) { in addNextStateToQueue()
|
| /openbsd-src/gnu/llvm/clang/lib/Serialization/ |
| H A D | ModuleManager.cpp | 355 SmallVector<ModuleFile *, 4> Queue; in visit() local
|
| /openbsd-src/gnu/llvm/llvm/lib/ObjCopy/MachO/ |
| H A D | MachOWriter.cpp | 587 SmallVector<WriteOperation, 7> Queue; in writeTail() local
|
| /openbsd-src/gnu/llvm/llvm/utils/TableGen/ |
| H A D | SubtargetEmitter.cpp | 766 const Record *Queue = ProcModel.LoadQueue->getValueAsDef("QueueDescriptor"); in EmitLoadStoreQueueInfo() local
774 const Record *Queue = in EmitLoadStoreQueueInfo() local
|
| /openbsd-src/gnu/llvm/clang/lib/AST/ |
| H A D | CXXInheritance.cpp | 127 SmallVector<const CXXRecordDecl*, 8> Queue; in forallBases() local
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGFast.cpp | 47 SmallVector<SUnit *, 16> Queue; member
|
| /openbsd-src/gnu/llvm/clang/lib/Analysis/ |
| H A D | UnsafeBufferUsage.cpp | 69 bool TraverseStmt(Stmt *Node, DataRecursionQueue *Queue = nullptr) { in TraverseStmt()
|