/freebsd-10.0-release/contrib/ntp/include/ |
H A D | ntpsim.h | 45 } *Queue; typedef in typeref:struct:List 63 Queue events; /* Node Event Queue */ 72 Queue queue P((Event, Queue )); 74 void push P((Event, Queue *)); 75 Event pop P((Queue *));
|
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/ |
H A D | LatencyPriorityQueue.cpp | 83 Queue.push_back(SU); 121 std::vector<SUnit *>::iterator Best = Queue.begin(); 122 for (std::vector<SUnit *>::iterator I = llvm::next(Queue.begin()), 123 E = Queue.end(); I != E; ++I) 127 if (Best != prior(Queue.end())) 128 std::swap(*Best, Queue.back()); 129 Queue.pop_back(); 134 assert(!Queue.empty() && "Queue is empty!"); 135 std::vector<SUnit *>::iterator I = std::find(Queue [all...] |
H A D | RegAllocBasic.cpp | 68 CompSpillWeight> Queue; member in class:__anon2196::RABasic 92 Queue.push(LI); 96 if (Queue.empty()) 98 LiveInterval *LI = Queue.top(); 99 Queue.pop();
|
/freebsd-10.0-release/usr.sbin/ppp/ |
H A D | link.h | 49 struct mqueue Queue[2]; /* Our output queue of mbufs */ member in struct:link 61 #define LINK_QUEUES(link) (sizeof (link)->Queue / sizeof (link)->Queue[0]) 62 #define LINK_HIGHQ(link) ((link)->Queue + LINK_QUEUES(link) - 1)
|
H A D | ipv6cp.h | 56 struct mqueue Queue[2]; /* Output packet queues */ member in struct:ipv6cp 60 #define IPV6CP_QUEUES(ipv6cp) (sizeof ipv6cp->Queue / sizeof ipv6cp->Queue[0])
|
H A D | ipcp.h | 100 struct mqueue Queue[3]; /* Output packet queues */ member in struct:ipcp 104 #define IPCP_QUEUES(ipcp) (sizeof ipcp->Queue / sizeof ipcp->Queue[0])
|
H A D | link.c | 102 for (queue = l->Queue; queue < highest; queue++) 113 for (queue = l->Queue; queue <= highest; queue++) 125 len += l->Queue[i].len; 139 len = l->Queue[i].len; 140 m = l->Queue[i].top; 170 for (queue = l->Queue; queue < highest; queue++) { 185 if (l->Queue[pri].len) { 186 bp = m_dequeue(l->Queue + pri); 189 (u_long)l->Queue[pri].len); 271 m_enqueue(l->Queue [all...] |
H A D | ncp.c | 238 m_enqueue(ipcp->Queue + pri, bp); 252 m_enqueue(ipv6cp->Queue + pri, bp); 293 for (q = ipcp->Queue; q < ipcp->Queue + IPCP_QUEUES(ipcp); q++) 298 for (q = ipv6cp->Queue; q < ipv6cp->Queue + IPV6CP_QUEUES(ipv6cp); q++)
|
H A D | ipv6cp.c | 297 memset(ipv6cp->Queue, '\0', sizeof ipv6cp->Queue); 414 for (q = ipv6cp->Queue; q < ipv6cp->Queue + IPV6CP_QUEUES(ipv6cp); q++) 441 queue = ipv6cp->Queue + IPV6CP_QUEUES(ipv6cp) - 1; 458 } while (queue-- != ipv6cp->Queue);
|
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | MachineScheduler.h | 147 std::vector<SUnit*> Queue; member in class:llvm::ReadyQueue 159 bool empty() const { return Queue.empty(); } 161 void clear() { Queue.clear(); } 163 unsigned size() const { return Queue.size(); } 167 iterator begin() { return Queue.begin(); } 169 iterator end() { return Queue.end(); } 171 ArrayRef<SUnit*> elements() { return Queue; } 174 return std::find(Queue.begin(), Queue.end(), SU); 178 Queue [all...] |
H A D | LatencyPriorityQueue.h | 37 /// Queue, the number of nodes that the node is the sole unscheduled 42 /// Queue - The queue. 43 std::vector<SUnit*> Queue; member in class:llvm::LatencyPriorityQueue 78 bool empty() const { return Queue.empty(); }
|
H A D | ResourcePriorityQueue.h | 43 /// Queue, the number of nodes that the node is the sole unscheduled 48 /// Queue - The queue. 49 std::vector<SUnit*> Queue; member in class:llvm::ResourcePriorityQueue 119 bool empty() const { return Queue.empty(); }
|
/freebsd-10.0-release/contrib/ntp/ntpd/ |
H A D | ntpsim.c | 132 Queue 135 Queue q 138 Queue ret; 140 if ((ret = (Queue)malloc(sizeof(struct List))) == NULL) 153 Queue *qp 156 Queue *tmp = qp; 169 Queue *qp 173 Queue tmp;
|
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ResourcePriorityQueue.cpp | 242 Queue.push_back(SU); 604 std::vector<SUnit *>::iterator Best = Queue.begin(); 607 for (std::vector<SUnit *>::iterator I = llvm::next(Queue.begin()), 608 E = Queue.end(); I != E; ++I) { 618 for (std::vector<SUnit *>::iterator I = llvm::next(Queue.begin()), 619 E = Queue.end(); I != E; ++I) 625 if (Best != prior(Queue.end())) 626 std::swap(*Best, Queue.back()); 628 Queue.pop_back(); 635 assert(!Queue [all...] |
H A D | ScheduleDAGFast.cpp | 48 SmallVector<SUnit *, 16> Queue; member in struct:__anon2216::FastPriorityQueue 50 bool empty() const { return Queue.empty(); } 53 Queue.push_back(U); 58 SUnit *V = Queue.back(); 59 Queue.pop_back();
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
H A D | CoreEngine.cpp | 72 std::deque<WorkListUnit> Queue; member in class:__anon3439::BFS 75 return !Queue.empty(); 79 Queue.push_back(U); 83 WorkListUnit U = Queue.front(); 84 Queue.pop_front(); 90 I = Queue.begin(), E = Queue.end(); I != E; ++I) { 109 std::deque<WorkListUnit> Queue; member in class:__anon3440::BFSBlockDFSContents 113 return !Queue.empty() || !Stack.empty(); 118 Queue [all...] |
/freebsd-10.0-release/contrib/sendmail/src/ |
H A D | queue.c | 212 ** Queue data in shared memory 632 Queue[e->e_dfqgrp]->qg_qpaths[e->e_dfqdir].qp_name); 765 ** Expand macros completely here. Queue run will deal with 1313 if (Queue[qgrp]->qg_queueintvl > 0) 1314 qintvl = Queue[qgrp]->qg_queueintvl; 1320 lastsched = Queue[qgrp]->qg_nextrun; 1322 if ((runall || Queue[qgrp]->qg_nextrun <= now) && qintvl > 0) 1338 Queue[qgrp]->qg_nextrun += qintvl; 1344 wgrp, cgrp, qgrp, Queue[qgrp]->qg_queueintvl, 1346 Queue[qgr [all...] |
/freebsd-10.0-release/contrib/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 150 PriorityQueue<BlockPair, QueueSorter, 20> Queue; member in class:__anon3615::FunctionDifferenceEngine 169 Queue.insert(BlockPair(L, R)); 186 while (!Queue.empty()) { 187 BlockPair Pair = Queue.remove_min(); 459 Engine(Engine), Queue(QueueSorter(*this_())) {} 655 SmallVector<std::pair<Function*,Function*>, 20> Queue; local 662 Queue.push_back(std::make_pair(LFn, RFn)); 674 I = Queue.begin(), E = Queue.end(); I != E; ++I)
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Serialization/ |
H A D | ModuleManager.cpp | 245 SmallVector<ModuleFile *, 4> Queue; local 246 Queue.reserve(N); 254 Queue.push_back(*M); 261 while (QueueStart < Queue.size()) { 262 ModuleFile *CurrentModule = Queue[QueueStart++]; 277 Queue.push_back(*M);
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/ASTMatchers/ |
H A D | ASTMatchFinder.cpp | 470 std::deque<ast_type_traits::DynTypedNode> Queue(Parents.begin(), 472 while (!Queue.empty()) { 473 if (Matcher.matches(Queue.front(), this, 480 ActiveASTContext->getParents(Queue.front()); 488 Queue.push_back(*I); 491 Queue.pop_front();
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/AST/ |
H A D | CXXInheritance.cpp | 139 SmallVector<const CXXRecordDecl*, 8> Queue; local 163 Queue.push_back(Base); 171 if (Queue.empty()) break; 172 Record = Queue.back(); // not actually a queue. 173 Queue.pop_back();
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | UninitializedValues.cpp | 522 SmallVector<const CFGBlock*, 32> Queue; 524 Queue.push_back(block); 529 while (!Queue.empty()) { 530 const CFGBlock *B = Queue.back(); 531 Queue.pop_back(); 553 Queue.push_back(Pred);
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Format/ |
H A D | Format.cpp | 748 Queue.push(QueueItem(OrderedPenalty(0, Count), Node)); 752 while (!Queue.empty()) { 753 unsigned Penalty = Queue.top().first.first; 754 StateNode *Node = Queue.top().second; 759 Queue.pop(); 769 if (Queue.empty()) 775 reconstructPath(InitialState, Queue.top().second); 779 return Queue.top().second->State.Column; 801 /// \brief Add the following state to the analysis queue \c Queue. 822 Queue 892 QueueType Queue; member in class:clang::format::UnwrappedLineFormatter [all...] |
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | RecursiveASTVisitor.h | 426 SmallVector<EnqueueJob, 16> Queue; local 427 Queue.push_back(S); 429 while (!Queue.empty()) { 430 EnqueueJob &job = Queue.back(); 433 Queue.pop_back(); 442 Queue.pop_back(); 451 Queue.push_back(*job.StmtIt); 453 Queue.pop_back(); 457 Queue.pop_back();
|
/freebsd-10.0-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...] |