| /freebsd-12.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-12.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-12.1/contrib/llvm/include/llvm/MCA/HardwareUnits/ |
| H A D | RetireControlUnit.h | 63 std::vector<RUToken> Queue; member
|
| /freebsd-12.1/contrib/llvm/tools/lldb/source/Target/ |
| H A D | Queue.cpp | 19 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/ |
| H A D | LatencyPriorityQueue.h | 44 std::vector<SUnit*> Queue; variable
|
| H A D | ResourcePriorityQueue.h | 49 std::vector<SUnit*> Queue; variable
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
| H A D | WorkList.cpp | 58 std::deque<WorkListUnit> Queue; member in __anon24c7175d0111::BFS
93 std::deque<WorkListUnit> Queue; member in __anon24c7175d0211::BFSBlockDFSContents
|
| /freebsd-12.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-12.1/contrib/llvm/lib/Target/Hexagon/ |
| H A D | RDFDeadCode.cpp | 49 std::queue<T> Queue; member
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | RegAllocBasic.cpp | 70 CompSpillWeight> Queue; member in __anona346d7640211::RABasic
|
| /freebsd-12.1/contrib/sendmail/contrib/ |
| H A D | qtool.pl | 997 package Queue; package
|
| /freebsd-12.1/contrib/llvm/tools/llvm-diff/ |
| H A D | DifferenceEngine.cpp | 149 PriorityQueue<BlockPair, QueueSorter, 20> Queue; member in __anon565615e00111::FunctionDifferenceEngine
687 SmallVector<std::pair<Function*,Function*>, 20> Queue; in diff() local
|
| /freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/ |
| H A D | GCNILPSched.cpp | 31 typedef simple_ilist<Candidate> Queue; typedef in __anon07abecfc0111::GCNILPScheduler
|
| H A D | GCNMinRegStrategy.cpp | 40 using Queue = simple_ilist<Candidate>; typedef in __anon091349650111::GCNMinRegScheduler
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/ASTMatchers/ |
| H A D | ASTMatchFinder.cpp | 148 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr) { in TraverseStmt()
709 std::deque<ast_type_traits::DynTypedNode> Queue(Parents.begin(), in matchesAncestorOfRecursively() local
864 bool MatchASTVisitor::TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue) { in TraverseStmt()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Format/ |
| H A D | UnwrappedLineFormatter.cpp | 905 QueueType Queue; in analyzeSolutionSpace() local
965 bool NewLine, unsigned *Count, QueueType *Queue) { in addNextStateToQueue()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Serialization/ |
| H A D | ModuleManager.cpp | 350 SmallVector<ModuleFile *, 4> Queue; in visit() local
|
| /freebsd-12.1/contrib/llvm/lib/Object/ |
| H A D | WindowsResource.cpp | 584 std::queue<const WindowsResourceParser::TreeNode *> Queue; in writeDirectoryTree() local
|
| /freebsd-12.1/contrib/llvm/utils/TableGen/ |
| H A D | SubtargetEmitter.cpp | 706 const Record *Queue = ProcModel.LoadQueue->getValueAsDef("QueueDescriptor"); in EmitLoadStoreQueueInfo() local
716 const Record *Queue = in EmitLoadStoreQueueInfo() local
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGFast.cpp | 50 SmallVector<SUnit *, 16> Queue; member
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/AST/ |
| H A D | CXXInheritance.cpp | 153 SmallVector<const CXXRecordDecl*, 8> Queue; in forallBases() local
|
| /freebsd-12.1/contrib/llvm/include/llvm/Support/ |
| H A D | AMDGPUMetadata.h | 70 Queue = 6, enumerator
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/ |
| H A D | UninitializedValues.cpp | 598 SmallVector<const CFGBlock*, 32> Queue; in getUninitUse() local
|