/freebsd-11-stable/contrib/llvm-project/clang/lib/ASTMatchers/ |
H A D | ASTMatchFinder.cpp | 160 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr) { 163 Queue = nullptr; 171 return VisitorBase::TraverseStmt(StmtToTraverse, Queue); 435 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr); 773 std::deque<ast_type_traits::DynTypedNode> Queue(Parents.begin(), 775 while (!Queue.empty()) { 777 if (Matcher.matches(Queue.front(), this, &BuilderCopy)) { 783 ActiveASTContext->getParents(Queue.front())) { 788 Queue.push_back(Parent); 791 Queue 978 TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | GCNILPSched.cpp | 31 typedef simple_ilist<Candidate> Queue; typedef in class:__anon2094::GCNILPScheduler 32 Queue PendingQueue; 33 Queue AvailQueue;
|
H A D | GCNMinRegStrategy.cpp | 39 using Queue = simple_ilist<Candidate>; 40 Queue RQ; // Ready queue
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Format/ |
H A D | UnwrappedLineFormatter.cpp | 960 QueueType Queue; 965 Queue.push(QueueItem(OrderedPenalty(0, Count), Node)); 971 while (!Queue.empty()) { 972 Penalty = Queue.top().first.first; 973 StateNode *Node = Queue.top().second; 979 Queue.pop(); 992 addNextStateToQueue(Penalty, Node, /*NewLine=*/false, &Count, &Queue); 994 addNextStateToQueue(Penalty, Node, /*NewLine=*/true, &Count, &Queue); 997 if (Queue.empty()) { 1006 reconstructPath(InitialState, Queue [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 148 PriorityQueue<BlockPair, QueueSorter, 20> Queue; member in class:__anon2844::FunctionDifferenceEngine 167 Queue.insert(BlockPair(L, R)); 184 while (!Queue.empty()) { 185 BlockPair Pair = Queue.remove_min(); 487 Engine(Engine), Queue(QueueSorter(*this_())) {} 686 SmallVector<std::pair<Function*,Function*>, 20> Queue; local 702 Queue.push_back(std::make_pair(LFn, RFn)); 729 I = Queue.begin(), E = Queue.end(); I != E; ++I)
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/ |
H A D | CXXInheritance.cpp | 152 SmallVector<const CXXRecordDecl*, 8> Queue; 175 Queue.push_back(Base); 183 if (Queue.empty()) 185 Record = Queue.pop_back_val(); // not actually a queue.
|
/freebsd-11-stable/usr.sbin/ppp/ |
H A D | ipv6cp.c | 299 memset(ipv6cp->Queue, '\0', sizeof ipv6cp->Queue); 416 for (q = ipv6cp->Queue; q < ipv6cp->Queue + IPV6CP_QUEUES(ipv6cp); q++) 443 queue = ipv6cp->Queue + IPV6CP_QUEUES(ipv6cp) - 1; 460 } while (queue-- != ipv6cp->Queue);
|
H A D | ipcp.c | 497 memset(ipcp->Queue, '\0', sizeof ipcp->Queue); 1437 for (q = ipcp->Queue; q < ipcp->Queue + IPCP_QUEUES(ipcp); q++) 1464 queue = ipcp->Queue + IPCP_QUEUES(ipcp) - 1; 1481 } while (queue-- != ipcp->Queue);
|
H A D | physical.c | 183 memset(p->link.Queue, '\0', sizeof p->link.Queue); 593 memset(p->link.Queue, '\0', sizeof p->link.Queue);
|
H A D | mp.c | 267 memset(mp->link.Queue, '\0', sizeof mp->link.Queue); 336 memset(mp->link.Queue, '\0', sizeof mp->link.Queue);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Object/ |
H A D | WindowsResource.cpp | 872 std::queue<const WindowsResourceParser::TreeNode *> Queue; local 873 Queue.push(&Resources); 881 while (!Queue.empty()) { 882 auto CurrentNode = Queue.front(); 883 Queue.pop(); 913 Queue.push(Child.second.get()); 932 Queue.push(Child.second.get());
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/ |
H A D | UninitializedValues.cpp | 604 SmallVector<const CFGBlock*, 32> Queue; 606 Queue.push_back(block); 611 while (!Queue.empty()) { 612 const CFGBlock *B = Queue.pop_back_val(); 653 Queue.push_back(Pred);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGFast.cpp | 49 SmallVector<SUnit *, 16> Queue; member in struct:__anon1815::FastPriorityQueue 51 bool empty() const { return Queue.empty(); } 54 Queue.push_back(U); 59 SUnit *V = Queue.back(); 60 Queue.pop_back();
|
H A D | ScheduleDAGRRList.cpp | 1727 std::vector<SUnit *> Queue; 1800 bool empty() const override { return Queue.empty(); } 1805 Queue.push_back(U); 1809 assert(!Queue.empty() && "Queue is empty!"); 1811 std::vector<SUnit *>::iterator I = llvm::find(Queue, SU); 1812 if (I != std::prev(Queue.end())) 1813 std::swap(*I, Queue.back()); 1814 Queue.pop_back(); 1893 if (Queue [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | RecursiveASTVisitor.h | 194 bool TraverseStmt(Stmt *S, DataRecursionQueue *Queue = nullptr); 306 DataRecursionQueue *Queue = nullptr); 356 if (!TRAVERSE_STMT_BASE(Stmt, Stmt, S, Queue)) \ 364 bool Traverse##CLASS(CLASS *S, DataRecursionQueue *Queue = nullptr); 385 DataRecursionQueue *Queue = nullptr) { \ 405 bool TraverseBin##NAME(BINOP_TYPE *S, DataRecursionQueue *Queue = nullptr) { \ 545 bool dataTraverseNode(Stmt *S, DataRecursionQueue *Queue); 551 DataRecursionQueue *Queue) { 553 return TRAVERSE_STMT_BASE(NAME, CLASS, VAR, Queue); 633 DataRecursionQueue *Queue) { 550 dataTraverseNode(Stmt *S, DataRecursionQueue *Queue) argument 632 TraverseStmt(Stmt *S, DataRecursionQueue *Queue) argument 2338 TraverseSynOrSemInitListExpr( InitListExpr *S, DataRecursionQueue *Queue) argument 2375 TraverseInitListExpr( InitListExpr *S, DataRecursionQueue *Queue) argument [all...] |
/freebsd-11-stable/contrib/sendmail/contrib/ |
H A D | qtool.pl | 148 $destination = new Queue($dst_name); 254 ## creates a QueuedMessage or Queue for that source and adds it to the 328 $queue = new Queue($source_name); 997 package Queue; package 1073 ## ADD_QUEUED_MESSAGE - Adds a QueuedMessage to this Queue. 1076 ## associated with the QueuedMessage to this Queue's directory. 1097 ## ADD_QUEUE - Adds another Queue's QueuedMessages to this Queue. 1124 ## Adds either a Queue or a QueuedMessage to this Queue [all...] |
/freebsd-11-stable/contrib/sendmail/src/ |
H A D | control.c | 369 free = freediskspace(Queue[qgrp]->qg_qdir, &bsize);
|
H A D | main.c | 1959 usrerr("Queue group %s unknown", queuegroup); 1995 for (j = 0; j < Queue[qgrp]->qg_numqueues; j++) 2244 for (i = 0; i < NumQueue && Queue[i] != NULL; 2246 Queue[i]->qg_nextrun = (time_t) -1; 2247 Queue[qgrp]->qg_nextrun = 0; 2253 (void) run_work_group(Queue[qgrp]->qg_wgrp, 2261 sm_setproctitle(true, CurEnv, "Queue control"); 2421 for (i = 0; i < NumQueue && Queue[i] != NULL; 2423 Queue[i]->qg_nextrun = (time_t) -1; 2424 Queue[qgr [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopRerollPass.cpp | 688 SmallInstructionVector Queue(1, Root); 689 while (!Queue.empty()) { 690 Instruction *I = Queue.pop_back_val(); 704 Queue.push_back(User); 714 Queue.push_back(Op);
|
/freebsd-11-stable/sys/dev/msk/ |
H A D | if_mskreg.h | 507 #define B3_RI_WTO_R1 0x0190 /* 8 bit WR Timeout Queue R1 (TO0) */ 508 #define B3_RI_WTO_XA1 0x0191 /* 8 bit WR Timeout Queue XA1 (TO1) */ 509 #define B3_RI_WTO_XS1 0x0192 /* 8 bit WR Timeout Queue XS1 (TO2) */ 510 #define B3_RI_RTO_R1 0x0193 /* 8 bit RD Timeout Queue R1 (TO3) */ 511 #define B3_RI_RTO_XA1 0x0194 /* 8 bit RD Timeout Queue XA1 (TO4) */ 512 #define B3_RI_RTO_XS1 0x0195 /* 8 bit RD Timeout Queue XS1 (TO5) */ 513 #define B3_RI_WTO_R2 0x0196 /* 8 bit WR Timeout Queue R2 (TO6) */ 514 #define B3_RI_WTO_XA2 0x0197 /* 8 bit WR Timeout Queue XA2 (TO7) */ 515 #define B3_RI_WTO_XS2 0x0198 /* 8 bit WR Timeout Queue XS2 (TO8) */ 516 #define B3_RI_RTO_R2 0x0199 /* 8 bit RD Timeout Queue R [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | CodeGenSchedule.cpp | 482 for (Record *Queue : Queues) { 483 CodeGenProcModel &PM = getProcModel(Queue->getValueAsDef("SchedModel")); 484 if (Queue->isSubClassOf("LoadQueue")) { 486 PrintError(Queue->getLoc(), 492 PM.LoadQueue = Queue; 495 if (Queue->isSubClassOf("StoreQueue")) { 497 PrintError(Queue->getLoc(), 503 PM.StoreQueue = Queue;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | AMDGPUMetadata.h | 69 Queue = 6, member in class:llvm::AMDGPU::HSAMD::AccessQualifier::AddressSpaceQualifier::ValueKind
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/ |
H A D | lldb-forward.h | 230 class Queue; 396 typedef std::shared_ptr<lldb_private::Queue> QueueSP; 397 typedef std::weak_ptr<lldb_private::Queue> QueueWP;
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaAccess.cpp | 290 SmallVector<const CXXRecordDecl*, 8> Queue; // actually a stack local 317 Queue.push_back(RD); 320 if (Queue.empty()) break; 322 Derived = Queue.pop_back_val();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/ |
H A D | AMDGPUMetadata.cpp | 59 YIO.enumCase(EN, "Queue", ValueKind::Queue);
|