Searched refs:Queue (Results 1 - 25 of 46) sorted by relevance

12

/freebsd-9.3-release/contrib/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp83 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 DRegAllocBasic.cpp69 CompSpillWeight> Queue; member in class:__anon2166::RABasic
93 Queue.push(LI);
97 if (Queue.empty())
99 LiveInterval *LI = Queue.top();
100 Queue.pop();
/freebsd-9.3-release/usr.sbin/ppp/
H A Dlink.h49 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 Dipv6cp.h56 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 Dipcp.h100 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 Dlink.c102 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 Dncp.c238 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 Dipv6cp.c297 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-9.3-release/contrib/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h216 std::vector<SUnit*> Queue; member in class:llvm::ReadyQueue
228 bool empty() const { return Queue.empty(); }
230 void clear() { Queue.clear(); }
232 unsigned size() const { return Queue.size(); }
236 iterator begin() { return Queue.begin(); }
238 iterator end() { return Queue.end(); }
240 ArrayRef<SUnit*> elements() { return Queue; }
243 return std::find(Queue.begin(), Queue.end(), SU);
247 Queue
[all...]
H A DLatencyPriorityQueue.h37 /// 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 DResourcePriorityQueue.h43 /// 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-9.3-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp242 Queue.push_back(SU);
603 std::vector<SUnit *>::iterator Best = Queue.begin();
606 for (std::vector<SUnit *>::iterator I = llvm::next(Queue.begin()),
607 E = Queue.end(); I != E; ++I) {
617 for (std::vector<SUnit *>::iterator I = llvm::next(Queue.begin()),
618 E = Queue.end(); I != E; ++I)
624 if (Best != prior(Queue.end()))
625 std::swap(*Best, Queue.back());
627 Queue.pop_back();
634 assert(!Queue
[all...]
H A DScheduleDAGFast.cpp48 SmallVector<SUnit *, 16> Queue; member in struct:__anon2185::FastPriorityQueue
50 bool empty() const { return Queue.empty(); }
53 Queue.push_back(U);
58 SUnit *V = Queue.back();
59 Queue.pop_back();
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DCoreEngine.cpp72 std::deque<WorkListUnit> Queue; member in class:__anon3499::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:__anon3500::BFSBlockDFSContents
113 return !Queue.empty() || !Stack.empty();
118 Queue
[all...]
/freebsd-9.3-release/contrib/sendmail/src/
H A Dqueue.c212 ** 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-9.3-release/contrib/ntp/include/
H A Dntp_prio_q.h31 typedef struct Queue { struct
/freebsd-9.3-release/contrib/llvm/tools/llvm-diff/
H A DDifferenceEngine.cpp150 PriorityQueue<BlockPair, QueueSorter, 20> Queue; member in class:__anon3544::FunctionDifferenceEngine
169 Queue.insert(BlockPair(L, R));
186 while (!Queue.empty()) {
187 BlockPair Pair = Queue.remove_min();
457 Engine(Engine), Queue(QueueSorter(*this_())) {}
653 SmallVector<std::pair<Function*,Function*>, 20> Queue; local
660 Queue.push_back(std::make_pair(LFn, RFn));
672 I = Queue.begin(), E = Queue.end(); I != E; ++I)
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Serialization/
H A DModuleManager.cpp247 SmallVector<ModuleFile *, 4> Queue; local
248 Queue.reserve(N);
256 Queue.push_back(*M);
263 while (QueueStart < Queue.size()) {
264 ModuleFile *CurrentModule = Queue[QueueStart++];
279 Queue.push_back(*M);
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Format/
H A DFormat.cpp827 QueueType Queue; local
832 Queue.push(QueueItem(OrderedPenalty(0, Count), Node));
838 while (!Queue.empty()) {
839 Penalty = Queue.top().first.first;
840 StateNode *Node = Queue.top().second;
845 Queue.pop();
858 addNextStateToQueue(Penalty, Node, /*NewLine=*/false, &Count, &Queue);
860 addNextStateToQueue(Penalty, Node, /*NewLine=*/true, &Count, &Queue);
863 if (Queue.empty()) {
872 reconstructPath(InitialState, Queue
907 addNextStateToQueue(unsigned Penalty, StateNode *PreviousNode, bool NewLine, unsigned *Count, QueueType *Queue) argument
[all...]
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/AST/
H A DCXXInheritance.cpp139 SmallVector<const CXXRecordDecl*, 8> Queue; local
163 Queue.push_back(Base);
171 if (Queue.empty())
173 Record = Queue.pop_back_val(); // not actually a queue.
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp540 std::deque<ast_type_traits::DynTypedNode> Queue(Parents.begin(),
542 while (!Queue.empty()) {
544 if (Matcher.matches(Queue.front(), this, &Result.Nodes)) {
550 ActiveASTContext->getParents(Queue.front());
558 Queue.push_back(*I);
561 Queue.pop_front();
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/AST/
H A DRecursiveASTVisitor.h446 SmallVector<EnqueueJob, 16> Queue; local
447 Queue.push_back(S);
449 while (!Queue.empty()) {
450 EnqueueJob &job = Queue.back();
453 Queue.pop_back();
462 Queue.pop_back();
471 Queue.push_back(*job.StmtIt);
473 Queue.pop_back();
477 Queue.pop_back();
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopRerollPass.cpp479 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);
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Analysis/
H A DUninitializedValues.cpp521 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-9.3-release/contrib/sendmail/contrib/
H A Dqtool.pl148 $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...]

Completed in 305 milliseconds

12