Home
last modified time | relevance | path

Searched refs:Queue (Results 1 – 25 of 104) sorted by relevance

12345

/freebsd-12.1/contrib/llvm/tools/lldb/source/Target/
H A DQueue.cpp19 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
31 Queue::~Queue() = default;
33 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
35 const char *Queue::GetName() { in GetName()
39 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
41 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
54 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
58 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
66 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
74 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]
/freebsd-12.1/contrib/llvm/lib/MCA/HardwareUnits/
H A DRetireControlUnit.cpp37 Queue.resize(AvailableSlots); in RetireControlUnit()
45 std::min(NumMicroOps, static_cast<unsigned>(Queue.size())); in reserveSlot()
51 Queue[NextAvailableSlotIdx] = {IR, NormalizedQuantity, false}; in reserveSlot()
53 NextAvailableSlotIdx %= Queue.size(); in reserveSlot()
59 return Queue[CurrentInstructionSlotIdx]; in peekCurrentToken()
63 RetireControlUnit::RUToken &Current = Queue[CurrentInstructionSlotIdx]; in consumeCurrentToken()
70 CurrentInstructionSlotIdx %= Queue.size(); in consumeCurrentToken()
75 assert(Queue.size() > TokenID); in onInstructionExecuted()
76 assert(Queue[TokenID].Executed == false && Queue[TokenID].IR); in onInstructionExecuted()
77 Queue[TokenID].Executed = true; in onInstructionExecuted()
[all …]
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp85 Queue.push_back(SU); in push()
125 E = Queue.end(); I != E; ++I) in pop()
129 if (Best != std::prev(Queue.end())) in pop()
130 std::swap(*Best, Queue.back()); in pop()
131 Queue.pop_back(); in pop()
136 assert(!Queue.empty() && "Queue is empty!"); in remove()
137 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
139 if (I != std::prev(Queue.end())) in remove()
140 std::swap(*I, Queue.back()); in remove()
141 Queue.pop_back(); in remove()
[all …]
H A DRegAllocBasic.cpp70 CompSpillWeight> Queue; member in __anona346d7640211::RABasic
93 Queue.push(LI); in enqueue()
97 if (Queue.empty()) in dequeue()
99 LiveInterval *LI = Queue.top(); in dequeue()
100 Queue.pop(); in dequeue()
/freebsd-12.1/contrib/googletest/googletest/samples/
H A Dsample3-inl.h42 class Queue; variable
48 friend class Queue<E>;
72 class Queue {
75 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
78 ~Queue() { Clear(); } in ~Queue()
151 Queue* Map(F function) const { in Map()
152 Queue* new_queue = new Queue(); in Map()
166 Queue(const Queue&);
167 const Queue& operator = (const Queue&);
H A Dsample3_unittest.cc93 void MapTester(const Queue<int> * q) { in MapTester()
96 const Queue<int> * const new_q = q->Map(Double); in MapTester()
111 Queue<int> q0_;
112 Queue<int> q1_;
113 Queue<int> q2_;
H A Dsample5_unittest.cc163 Queue<int> q0_;
164 Queue<int> q1_;
165 Queue<int> q2_;
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp58 std::deque<WorkListUnit> Queue; member in __anon24c7175d0111::BFS
62 return !Queue.empty(); in hasWork()
66 Queue.push_back(U); in enqueue()
70 WorkListUnit U = Queue.front(); in dequeue()
71 Queue.pop_front(); in dequeue()
93 std::deque<WorkListUnit> Queue; member in __anon24c7175d0211::BFSBlockDFSContents
98 return !Queue.empty() || !Stack.empty(); in hasWork()
103 Queue.push_front(U); in enqueue()
116 assert(!Queue.empty()); in dequeue()
119 WorkListUnit U = Queue.front(); in dequeue()
[all …]
/freebsd-12.1/contrib/llvm/tools/lldb/include/lldb/Target/
H A DQueue.h35 class Queue : public std::enable_shared_from_this<Queue> {
37 Queue(lldb::ProcessSP process_sp, lldb::queue_id_t queue_id,
40 ~Queue();
173 DISALLOW_COPY_AND_ASSIGN(Queue);
/freebsd-12.1/usr.sbin/ppp/
H A Dlink.c104 for (queue = l->Queue; queue < highest; queue++) in link_SequenceQueue()
115 for (queue = l->Queue; queue <= highest; queue++) in link_DeleteQueue()
127 len += l->Queue[i].len; in link_QueueLen()
141 len = l->Queue[i].len; in link_QueueBytes()
142 m = l->Queue[i].top; in link_QueueBytes()
172 for (queue = l->Queue; queue < highest; queue++) { in link_PendingLowPriorityData()
187 if (l->Queue[pri].len) { in link_Dequeue()
188 bp = m_dequeue(l->Queue + pri); in link_Dequeue()
191 (u_long)l->Queue[pri].len); in link_Dequeue()
273 m_enqueue(l->Queue + pri, m_pullup(bp)); in link_PushPacket()
H A Dlink.h51 struct mqueue Queue[2]; /* Our output queue of mbufs */ member
63 #define LINK_QUEUES(link) (sizeof (link)->Queue / sizeof (link)->Queue[0])
64 #define LINK_HIGHQ(link) ((link)->Queue + LINK_QUEUES(link) - 1)
H A Dipv6cp.h58 struct mqueue Queue[2]; /* Output packet queues */ member
62 #define IPV6CP_QUEUES(ipv6cp) (sizeof ipv6cp->Queue / sizeof ipv6cp->Queue[0])
H A Dipcp.h102 struct mqueue Queue[3]; /* Output packet queues */ member
106 #define IPCP_QUEUES(ipcp) (sizeof ipcp->Queue / sizeof ipcp->Queue[0])
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp233 Queue.push_back(SU); in push()
590 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) { in pop()
600 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) in pop()
606 if (Best != std::prev(Queue.end())) in pop()
607 std::swap(*Best, Queue.back()); in pop()
609 Queue.pop_back(); in pop()
616 assert(!Queue.empty() && "Queue is empty!"); in remove()
617 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
618 if (I != std::prev(Queue.end())) in remove()
619 std::swap(*I, Queue.back()); in remove()
[all …]
/freebsd-12.1/sys/dev/cxgbe/firmware/
H A Dt6fw_cfg_uwire.txt213 # would be created and the Queue ID of a Forwarded Interrupt Ingress Queue
352 niqflint = 8 # NCPUS "Queue Sets"
435 # "Queue Sets" each.
505 nethctrl = 4 # 2 "Queue Sets"
506 neq = 8 # 2 "Queue Sets" * 2
517 nethctrl = 4 # 2 "Queue Sets"
518 neq = 8 # 2 "Queue Sets" * 2
528 nethctrl = 4 # 2 "Queue Sets"
529 neq = 8 # 2 "Queue Sets" * 2
540 nethctrl = 4 # 2 "Queue Sets"
[all …]
H A Dt5fw_cfg_uwire.txt207 # would be created and the Queue ID of a Forwarded Interrupt Ingress Queue
348 niqflint = 8 # NCPUS "Queue Sets"
429 # "Queue Sets" each.
498 nethctrl = 4 # 2 "Queue Sets"
499 neq = 8 # 2 "Queue Sets" * 2
510 nethctrl = 4 # 2 "Queue Sets"
511 neq = 8 # 2 "Queue Sets" * 2
522 nethctrl = 4 # 2 "Queue Sets"
523 neq = 8 # 2 "Queue Sets" * 2
534 nethctrl = 4 # 2 "Queue Sets"
[all …]
H A Dt4fw_cfg_uwire.txt172 # would be created and the Queue ID of a Forwarded Interrupt Ingress Queue
312 niqflint = 8 # NCPUS "Queue Sets"
387 # "Queue Sets" each.
453 nethctrl = 2 # 2 "Queue Sets"
454 neq = 4 # 2 "Queue Sets" * 2
464 nethctrl = 2 # 2 "Queue Sets"
465 neq = 4 # 2 "Queue Sets" * 2
475 nethctrl = 2 # 2 "Queue Sets"
476 neq = 4 # 2 "Queue Sets" * 2
486 nethctrl = 2 # 2 "Queue Sets"
[all …]
H A Dt5fw_cfg_fpga.txt62 # 8 Ingress Queue/MSI-X Vectors per application function
189 # would be created and the Queue ID of a Forwarded Interrupt Ingress Queue
190 # will be specified as the "Ingress Queue Asynchronous Destination Index."
235 # Forwarded Interrupt Queue) and General Interrupts per function.
356 # "Queue Sets" each.
400 niqflint = 4 # 2 "Queue Sets" + NXIQ
401 nethctrl = 2 # 2 "Queue Sets"
402 neq = 4 # 2 "Queue Sets" * 2
411 niqflint = 4 # 2 "Queue Sets" + NXIQ
412 nethctrl = 2 # 2 "Queue Sets"
[all …]
H A Dt6fw_cfg_fpga.txt47 # 16 Ingress Queue/MSI-X Vectors per application function
201 # would be created and the Queue ID of a Forwarded Interrupt Ingress Queue
202 # will be specified as the "Ingress Queue Asynchronous Destination Index."
247 # Forwarded Interrupt Queue) and General Interrupts per function.
372 # "Queue Sets" each.
420 niqflint = 4 # 2 "Queue Sets" + NXIQ
421 nethctrl = 2 # 2 "Queue Sets"
422 neq = 4 # 2 "Queue Sets" * 2
432 niqflint = 4 # 2 "Queue Sets" + NXIQ
433 nethctrl = 2 # 2 "Queue Sets"
[all …]
/freebsd-12.1/contrib/sendmail/src/
H A Dqueue.c1312 if (Queue[qgrp]->qg_queueintvl > 0)
1345 Queue[qgrp]->qg_nextrun, sched);
2096 if (Queue[qgrp]->qg_nice > 0)
2097 (void) nice(Queue[qgrp]->qg_nice);
5733 return Queue[qgrp]->qg_qdir;
5741 Queue[qgrp]->qg_qdir,
7129 Queue[i]->qg_nextrun = now;
7533 Queue[i] = s->s_quegrp = qg;
7666 WorkGrp[0].wg_qgs[0] = Queue[0]; in makeworkgroups()
7673 Queue[0]->qg_wgrp = 0; in makeworkgroups()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/MCA/HardwareUnits/
H A DRetireControlUnit.h63 std::vector<RUToken> Queue; member
68 bool isEmpty() const { return AvailableSlots == Queue.size(); } in isEmpty()
73 Quantity = std::min(Quantity, static_cast<unsigned>(Queue.size()));
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h545 std::vector<SUnit*> Queue; variable
557 bool empty() const { return Queue.empty(); } in empty()
559 void clear() { Queue.clear(); } in clear()
565 iterator begin() { return Queue.begin(); } in begin()
567 iterator end() { return Queue.end(); } in end()
569 ArrayRef<SUnit*> elements() { return Queue; } in elements()
574 Queue.push_back(SU); in push()
580 *I = Queue.back(); in remove()
581 unsigned idx = I - Queue.begin(); in remove()
582 Queue.pop_back(); in remove()
[all …]
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DRDFDeadCode.cpp29 SetQueue() : Set(), Queue() {} in SetQueue()
32 return Queue.empty(); in empty()
35 T V = Queue.front(); in pop_front()
36 Queue.pop(); in pop_front()
43 Queue.push(V); in push_back()
49 std::queue<T> Queue; member
/freebsd-12.1/contrib/llvm/tools/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp148 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr) { in TraverseStmt() argument
151 Queue = nullptr; in TraverseStmt()
163 return VisitorBase::TraverseStmt(StmtToTraverse, Queue); in TraverseStmt()
386 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr);
709 std::deque<ast_type_traits::DynTypedNode> Queue(Parents.begin(), in matchesAncestorOfRecursively() local
711 while (!Queue.empty()) { in matchesAncestorOfRecursively()
713 if (Matcher.matches(Queue.front(), this, &BuilderCopy)) { in matchesAncestorOfRecursively()
719 ActiveASTContext->getParents(Queue.front())) { in matchesAncestorOfRecursively()
724 Queue.push_back(Parent); in matchesAncestorOfRecursively()
727 Queue.pop_front(); in matchesAncestorOfRecursively()
[all …]
/freebsd-12.1/tools/regression/sysvmsg/
H A DREADME3 SysV IPC Message Queue Regression Utility.
5 This regression utility will test the SysV Message Queue facility

12345