/freebsd-10.2-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | LoopRerollPass.cpp | 479 SmallInstructionVector Queue(1, Root); 480 while (!Queue.empty()) { 481 Instruction *I = Queue.pop_back_val(); 496 Queue.push_back(User); 506 Queue.push_back(Op);
|
H A D | SROA.cpp | 2699 /// Queue of pointer uses to analyze and potentially rewrite. 2700 SmallVector<Use *, 8> Queue; member in class:__anon2820::AggLoadStoreRewriter 2718 while (!Queue.empty()) { 2719 U = Queue.pop_back_val(); 2732 Queue.push_back(&UI.getUse());
|
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | UninitializedValues.cpp | 521 SmallVector<const CFGBlock*, 32> Queue; 523 Queue.push_back(block); 528 while (!Queue.empty()) { 529 const CFGBlock *B = Queue.pop_back_val(); 567 Queue.push_back(Pred);
|
/freebsd-10.2-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGFast.cpp | 48 SmallVector<SUnit *, 16> Queue; member in struct:__anon2324::FastPriorityQueue 50 bool empty() const { return Queue.empty(); } 53 Queue.push_back(U); 58 SUnit *V = Queue.back(); 59 Queue.pop_back();
|
H A D | ScheduleDAGRRList.cpp | 1622 std::vector<SUnit*> Queue; 1698 bool empty() const { return Queue.empty(); } 1703 Queue.push_back(U); 1707 assert(!Queue.empty() && "Queue is empty!"); 1709 std::vector<SUnit *>::iterator I = std::find(Queue.begin(), Queue.end(), 1711 if (I != prior(Queue.end())) 1712 std::swap(*I, Queue.back()); 1713 Queue [all...] |
/freebsd-10.2-release/contrib/llvm/tools/lldb/include/lldb/ |
H A D | lldb-forward.h | 220 class Queue; 343 typedef std::shared_ptr<lldb_private::Queue> QueueSP; 344 typedef std::weak_ptr<lldb_private::Queue> QueueWP;
|
/freebsd-10.2-release/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-10.2-release/contrib/sendmail/src/ |
H A D | control.c | 370 free = freediskspace(Queue[qgrp]->qg_qdir, &bsize);
|
H A D | main.c | 1951 usrerr("Queue group %s unknown", queuegroup); 1989 for (j = 0; j < Queue[qgrp]->qg_numqueues; j++) 2236 for (i = 0; i < NumQueue && Queue[i] != NULL; 2238 Queue[i]->qg_nextrun = (time_t) -1; 2239 Queue[qgrp]->qg_nextrun = 0; 2245 (void) run_work_group(Queue[qgrp]->qg_wgrp, 2253 sm_setproctitle(true, CurEnv, "Queue control"); 2413 for (i = 0; i < NumQueue && Queue[i] != NULL; 2415 Queue[i]->qg_nextrun = (time_t) -1; 2416 Queue[qgr [all...] |
H A D | srvrsmtp.c | 3354 usrerr("459 4.5.4 Queue %s unknown", 3358 for (i = 0; i < NumQueue && Queue[i] != NULL; 3360 Queue[i]->qg_nextrun = (time_t) -1; 3361 Queue[qgrp]->qg_nextrun = 0; 3362 ok = run_work_group(Queue[qgrp]->qg_wgrp, 3499 "Send Queue=");
|
H A D | sendmail.h | 537 ** Queue group definition structure. 565 short qg_index; /* queue number internally, index in Queue[] */ 2029 ** Queue related items 2078 /* Queue Run Limitations */ 2113 EXTERN QUEUEGRP *Queue[MAXQUEUEGROUPS + 1]; /* queue groups */ variable
|
H A D | conf.c | 3412 if (pickqdir(Queue[i], msize, e) < 0)
|
/freebsd-10.2-release/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-10.2-release/usr.sbin/ppp/ |
H A D | ipcp.c | 495 memset(ipcp->Queue, '\0', sizeof ipcp->Queue); 1435 for (q = ipcp->Queue; q < ipcp->Queue + IPCP_QUEUES(ipcp); q++) 1462 queue = ipcp->Queue + IPCP_QUEUES(ipcp) - 1; 1479 } while (queue-- != ipcp->Queue);
|
H A D | mp.c | 265 memset(mp->link.Queue, '\0', sizeof mp->link.Queue); 334 memset(mp->link.Queue, '\0', sizeof mp->link.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);
|
/freebsd-10.2-release/contrib/llvm/lib/CodeGen/ |
H A D | RegAllocGreedy.cpp | 84 std::priority_queue<std::pair<unsigned, unsigned> > Queue; member in class:__anon2309::RAGreedy 439 Queue.push(std::make_pair(Prio, ~Reg)); 443 if (Queue.empty()) 445 LiveInterval *LI = &LIS->getInterval(~Queue.top().second); 446 Queue.pop();
|
H A D | MachineScheduler.cpp | 354 for (unsigned i = 0, e = Queue.size(); i < e; ++i) 355 dbgs() << Queue[i]->NodeNum << " "; 2277 // Note that the Queue contents are more useful before pickNodeFromQueue.
|
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/Sema/ |
H A D | SemaLookup.cpp | 1476 SmallVector<NamespaceDecl*, 8> Queue; local 1483 Queue.push_back(ND); 1496 while (!Queue.empty()) { 1497 NamespaceDecl *ND = Queue.pop_back_val(); 1531 Queue.push_back(Nom); 2126 SmallVector<const Type *, 16> Queue; local 2198 Queue.push_back(Arg->getTypePtr()); 2219 // Queue up the class type into which this points. 2220 Queue.push_back(MemberPtr->getClass()); 2265 if (Queue [all...] |
H A D | SemaAccess.cpp | 285 SmallVector<const CXXRecordDecl*, 8> Queue; // actually a stack local 313 Queue.push_back(RD); 316 if (Queue.empty()) break; 318 Derived = Queue.pop_back_val();
|
H A D | SemaDeclCXX.cpp | 1260 SmallVector<const CXXRecordDecl*, 8> Queue; local 1278 Queue.push_back(Base); 1281 if (Queue.empty()) 1284 Current = Queue.pop_back_val();
|
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/AST/ |
H A D | ExprConstant.cpp | 6276 SmallVector<Job, 16> Queue; 6300 while (!Queue.empty()) 6344 Queue.resize(Queue.size()+1); 6345 Queue.back().E = E; 6346 Queue.back().Kind = Job::AnyExprKind; 6498 Job &job = Queue.back(); 6511 Queue.pop_back(); 6519 Queue.pop_back(); 6535 Queue [all...] |
/freebsd-10.2-release/contrib/llvm/lib/Target/PowerPC/ |
H A D | PPCISelLowering.cpp | 6923 SmallVector<SDNode *, 8> Queue(1, Chain.getNode()); 6929 while (!Queue.empty()) { 6930 SDNode *ChainNext = Queue.pop_back_val(); 6939 Queue.push_back(ChainLD->getChain().getNode()); 6944 Queue.push_back(O->getNode()); 6955 Queue.clear(); 6959 Queue.push_back(*I); 6961 while (!Queue.empty()) { 6962 SDNode *LoadRoot = Queue.pop_back_val(); 6975 Queue [all...] |