Home
last modified time | relevance | path

Searched defs:Queue (Results 1 – 25 of 52) sorted by relevance

123

/freebsd/contrib/ntp/include/
H A Dntp_prio_q.h31 typedef struct Queue { struct
32 q_order_func get_order;
33 node * front;
34 int no_of_elements;
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DOptimizedStructLayout.cpp276 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
H A DParallel.cpp137 auto &Queue = Sequential ? WorkQueueSequential : WorkQueue; in work() local
/freebsd/contrib/llvm-project/clang/lib/DirectoryWatcher/mac/
H A DDirectoryWatcher-mac.cpp49 dispatch_queue_t Queue, FSEventStreamRef EventStream, in DirectoryWatcherMac()
74 dispatch_queue_t Queue; member in __anon3ec11e150111::DirectoryWatcherMac
163 dispatch_queue_t Queue) { in createFSEventStream()
220 dispatch_queue_t Queue = in create() local
/freebsd/contrib/googletest/googletest/samples/
H A Dsample3-inl.h41 class Queue; variable
75 Queue() : head_(nullptr), last_(nullptr), size_(0) {} in Queue() function
/freebsd/contrib/llvm-project/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DLatencyPriorityQueue.h43 std::vector<SUnit*> Queue; variable
H A DResourcePriorityQueue.h48 std::vector<SUnit*> Queue; variable
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp57 std::deque<WorkListUnit> Queue; member in __anon5f5042760111::BFS
92 std::deque<WorkListUnit> Queue; member in __anon5f5042760211::BFSBlockDFSContents
/freebsd/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/
H A DRetireControlUnit.h63 std::vector<RUToken> Queue; member
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp242 std::queue<uint64_t> Queue; in findAugmentingPath() local
649 std::queue<uint64_t> Queue; in findReachable() local
694 std::set<std::pair<uint64_t, uint64_t>> Queue; in findShortestPath() local
829 std::queue<uint64_t> Queue; in findUnknownSubgraph() local
943 std::queue<uint64_t> Queue; in isAcyclicSubgraph() local
1295 std::queue<uint64_t> Queue; in verifyOutput() local
/freebsd/usr.sbin/ppp/
H A Dipv6cp.h56 struct mqueue Queue[2]; /* Output packet queues */ member
H A Dlink.h49 struct mqueue Queue[2]; /* Our output queue of mbufs */ member
H A Dipcp.h100 struct mqueue Queue[3]; /* Output packet queues */ member
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegAllocBasic.cpp67 Queue; member in __anon1f7cefe70211::RABasic
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DRDFDeadCode.cpp49 std::queue<T> Queue; member
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h84 std::queue<ContextTrieNode *> Queue; variable
/freebsd/contrib/sendmail/contrib/
H A Dqtool.pl997 package Queue; package
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h350 std::queue<NodeType *> Queue; in scc_member_iterator() local
/freebsd/contrib/llvm-project/clang/lib/DirectoryWatcher/linux/
H A DDirectoryWatcher-linux.cpp140 EventQueue Queue; member in __anonbab939f30111::DirectoryWatcherLinux
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNMinRegStrategy.cpp33 using Queue = simple_ilist<Candidate>; typedef in __anonb03821a80111::GCNMinRegScheduler
H A DGCNILPSched.cpp30 typedef simple_ilist<Candidate> Queue; typedef in __anon6a708eff0111::GCNILPScheduler
/freebsd/contrib/llvm-project/llvm/tools/llvm-diff/lib/
H A DDifferenceEngine.cpp239 PriorityQueue<BlockPair, QueueSorter, 20> Queue; member in __anon5f29e0e90111::FunctionDifferenceEngine
973 SmallVector<std::pair<const Function *, const Function *>, 20> Queue; in diff() local
/freebsd/contrib/llvm-project/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp178 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr) { in TraverseStmt()
511 bool dataTraverseNode(Stmt *S, DataRecursionQueue *Queue) { in dataTraverseNode()
1227 std::deque<DynTypedNode> Queue(Parents.begin(), Parents.end()); in matchesAnyAncestorOf() local
1474 bool MatchASTVisitor::TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue) { in TraverseStmt()
/freebsd/contrib/llvm-project/llvm/lib/ObjCopy/MachO/
H A DMachOWriter.cpp587 SmallVector<WriteOperation, 7> Queue; in writeTail() local

123