| /freebsd-13.1/contrib/ntp/include/ |
| H A D | ntp_prio_q.h | 31 typedef struct Queue { struct
32 q_order_func get_order;
33 node * front;
34 int no_of_elements;
|
| /freebsd-13.1/contrib/llvm-project/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
|
| /freebsd-13.1/contrib/llvm-project/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 __anonb66252010111::DirectoryWatcherMac
163 dispatch_queue_t Queue) { in createFSEventStream()
220 dispatch_queue_t Queue = in create() local
|
| /freebsd-13.1/contrib/googletest/googletest/samples/ |
| H A D | sample3-inl.h | 42 class Queue; variable
75 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
|
| /freebsd-13.1/contrib/llvm-project/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
|
| /freebsd-13.1/contrib/llvm-project/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
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/ |
| H A D | RetireControlUnit.h | 63 std::vector<RUToken> Queue; member
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | WorkList.cpp | 57 std::deque<WorkListUnit> Queue; member in __anonff96a6e20111::BFS
92 std::deque<WorkListUnit> Queue; member in __anonff96a6e20211::BFSBlockDFSContents
|
| /freebsd-13.1/usr.sbin/ppp/ |
| H A D | ipv6cp.h | 58 struct mqueue Queue[2]; /* Output packet queues */ member
|
| H A D | link.h | 51 struct mqueue Queue[2]; /* Our output queue of mbufs */ member
|
| H A D | ipcp.h | 102 struct mqueue Queue[3]; /* Output packet queues */ member
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
| H A D | ProfiledCallGraph.h | 56 std::queue<ContextTrieNode *> Queue; in ProfiledCallGraph() local
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | RDFDeadCode.cpp | 49 std::queue<T> Queue; member
|
| /freebsd-13.1/contrib/sendmail/contrib/ |
| H A D | qtool.pl | 997 package Queue; package
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegAllocBasic.cpp | 69 CompSpillWeight> Queue; member in __anon7c0ba8530211::RABasic
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/DirectoryWatcher/linux/ |
| H A D | DirectoryWatcher-linux.cpp | 139 EventQueue Queue; member in __anonc66a83df0111::DirectoryWatcherLinux
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | GCNMinRegStrategy.cpp | 33 using Queue = simple_ilist<Candidate>; typedef in __anon7ba951140111::GCNMinRegScheduler
|
| H A D | GCNILPSched.cpp | 30 typedef simple_ilist<Candidate> Queue; typedef in __anon673d9d6b0111::GCNILPScheduler
|
| /freebsd-13.1/contrib/llvm-project/llvm/tools/llvm-diff/ |
| H A D | DifferenceEngine.cpp | 155 PriorityQueue<BlockPair, QueueSorter, 20> Queue; member in __anon3906a3ef0111::FunctionDifferenceEngine
792 SmallVector<std::pair<const Function *, const Function *>, 20> Queue; in diff() local
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/ASTMatchers/ |
| H A D | ASTMatchFinder.cpp | 173 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr) { in TraverseStmt()
493 bool dataTraverseNode(Stmt *S, DataRecursionQueue *Queue) { in dataTraverseNode()
1008 std::deque<DynTypedNode> Queue(Parents.begin(), Parents.end()); in matchesAnyAncestorOf() local
1231 bool MatchASTVisitor::TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue) { in TraverseStmt()
|
| /freebsd-13.1/contrib/llvm-project/llvm/tools/llvm-objcopy/MachO/ |
| H A D | MachOWriter.cpp | 446 SmallVector<WriteOperation, 7> Queue; in writeTail() local
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/Format/ |
| H A D | UnwrappedLineFormatter.cpp | 1013 QueueType Queue; in analyzeSolutionSpace() local
1073 bool NewLine, unsigned *Count, QueueType *Queue) { in addNextStateToQueue()
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/Serialization/ |
| H A D | ModuleManager.cpp | 368 SmallVector<ModuleFile *, 4> Queue; in visit() local
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/AST/ |
| H A D | CXXInheritance.cpp | 128 SmallVector<const CXXRecordDecl*, 8> Queue; in forallBases() local
|