Home
last modified time | relevance | path

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

12345

/freebsd/contrib/llvm-project/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
61 void Queue::SetNumPendingWorkItems(uint32_t count) { in SetNumPendingWorkItems()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DOptimizedStructLayout.cpp276 for (auto &Queue : FlexibleFieldsByAlignment) { in performOptimizedStructLayout() local
277 assert((FirstQueue || Queue.Alignment < LastQueueAlignment) && in performOptimizedStructLayout()
279 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
282 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
284 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
285 assert(I->Alignment == Queue.Alignment && "bad field in queue"); in performOptimizedStructLayout()
295 auto spliceFromQueue = [&](AlignmentQueue *Queue, Field *Last, Field *Cur) { in performOptimizedStructLayout() argument
296 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
307 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
311 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp81 Queue.push_back(SU); in push()
117 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop()
118 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()), in pop()
119 E = Queue.end(); I != E; ++I) in pop()
123 if (Best != std::prev(Queue.end())) in pop()
124 std::swap(*Best, Queue.back()); in pop()
125 Queue.pop_back(); in pop()
130 assert(!Queue.empty() && "Queue is empty!"); in remove()
131 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
132 assert(I != Queue.end() && "Queue doesn't contain the SU being removed!"); in remove()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/
H A DRetireControlUnit.cpp39 Queue.resize(2 * NumROBEntries); in RetireControlUnit()
49 Queue[NextAvailableSlotIdx] = {IR, Entries, false}; in dispatch()
51 NextAvailableSlotIdx %= Queue.size(); in dispatch()
59 const RetireControlUnit::RUToken &Current = Queue[CurrentInstructionSlotIdx]; in getCurrentToken()
70 return NextSlotIdx % Queue.size(); in computeNextSlotIdx()
74 return Queue[computeNextSlotIdx()]; in peekNextToken()
78 RetireControlUnit::RUToken &Current = Queue[CurrentInstructionSlotIdx]; in consumeCurrentToken()
83 CurrentInstructionSlotIdx %= Queue.size(); in consumeCurrentToken()
89 assert(Queue.size() > TokenID); in onInstructionExecuted()
90 assert(Queue[TokenID].IR.getInstruction() && "Instruction was not dispatched!"); in onInstructionExecuted()
[all …]
/freebsd/contrib/googletest/googletest/samples/
H A Dsample3-inl.h41 class Queue; variable
47 friend class Queue<E>;
72 class Queue {
75 Queue() : head_(nullptr), last_(nullptr), 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()
167 Queue(const Queue&);
168 const Queue& operator=(const Queue&);
H A Dsample3_unittest.cc90 void MapTester(const Queue<int>* q) { in MapTester()
93 const Queue<int>* const new_q = q->Map(Double); in MapTester()
108 Queue<int> q0_;
109 Queue<int> q1_;
110 Queue<int> q2_;
H A Dsample5_unittest.cc157 Queue<int> q0_;
158 Queue<int> q1_;
159 Queue<int> q2_;
/freebsd/contrib/llvm-project/lldb/include/lldb/Target/
H A DQueue.h32 class Queue : public std::enable_shared_from_this<Queue> {
34 Queue(lldb::ProcessSP process_sp, lldb::queue_id_t queue_id,
37 ~Queue();
147 Queue(const Queue &) = delete;
148 const Queue &operator=(const Queue &) = delete;
/freebsd/contrib/llvm-project/clang/lib/DirectoryWatcher/mac/
H A DDirectoryWatcher-mac.cpp49 dispatch_queue_t Queue, FSEventStreamRef EventStream, in DirectoryWatcherMac() argument
53 : Queue(Queue), EventStream(EventStream), Receiver(Receiver), in DirectoryWatcherMac()
60 dispatch_sync(Queue, ^{ in ~DirectoryWatcherMac()
70 dispatch_release(Queue); in ~DirectoryWatcherMac()
74 dispatch_queue_t Queue; member in __anon541c2f4d0111::DirectoryWatcherMac
163 dispatch_queue_t Queue) { in createFSEventStream() argument
220 dispatch_queue_t Queue = in create() local
227 auto EventStream = createFSEventStream(Path, Receiver, Queue); in create()
231 std::make_unique<DirectoryWatcherMac>(Queue, EventStream, Receiver, Path); in create()
242 FSEventStreamSetDispatchQueue(EventStream, Queue); in create()
[all …]
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp57 std::deque<WorkListUnit> Queue; member in __anond1e6f8ae0111::BFS
61 return !Queue.empty(); in hasWork()
65 Queue.push_back(U); in enqueue()
69 WorkListUnit U = Queue.front(); in dequeue()
70 Queue.pop_front(); in dequeue()
92 std::deque<WorkListUnit> Queue; member in __anond1e6f8ae0211::BFSBlockDFSContents
97 return !Queue.empty() || !Stack.empty(); in hasWork()
102 Queue.push_front(U); in enqueue()
115 assert(!Queue.empty()); in dequeue()
118 WorkListUnit U = Queue.front(); in dequeue()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp242 std::queue<uint64_t> Queue; in findAugmentingPath() local
243 Queue.push(Source); in findAugmentingPath()
246 while (!Queue.empty()) { in findAugmentingPath()
247 uint64_t Src = Queue.front(); in findAugmentingPath()
248 Queue.pop(); in findAugmentingPath()
282 Queue.push(Dst); in findAugmentingPath()
649 std::queue<uint64_t> Queue; in findReachable() local
650 Queue.push(Src); in findReachable()
652 while (!Queue.empty()) { in findReachable()
653 Src = Queue.front(); in findReachable()
[all …]
/freebsd/usr.sbin/ppp/
H A Dlink.c102 for (queue = l->Queue; queue < highest; queue++) in link_SequenceQueue()
113 for (queue = l->Queue; queue <= highest; queue++) in link_DeleteQueue()
125 len += l->Queue[i].len; in link_QueueLen()
139 len = l->Queue[i].len; in link_QueueBytes()
140 m = l->Queue[i].top; in link_QueueBytes()
170 for (queue = l->Queue; queue < highest; queue++) { in link_PendingLowPriorityData()
185 if (l->Queue[pri].len) { in link_Dequeue()
186 bp = m_dequeue(l->Queue + pri); in link_Dequeue()
189 (u_long)l->Queue[pri].len); in link_Dequeue()
271 m_enqueue(l->Queue + pri, m_pullup(bp)); in link_PushPacket()
H A Dlink.h49 struct mqueue Queue[2]; /* Our output queue of mbufs */ member
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
60 #define IPV6CP_QUEUES(ipv6cp) (sizeof ipv6cp->Queue / sizeof ipv6cp->Queue[0])
H A Dipcp.h100 struct mqueue Queue[3]; /* Output packet queues */ member
104 #define IPCP_QUEUES(ipcp) (sizeof ipcp->Queue / sizeof ipcp->Queue[0])
/freebsd/sys/contrib/device-tree/Bindings/soc/ti/
H A Dkeystone-navigator-qmss.txt1 * Texas Instruments Keystone Navigator Queue Management SubSystem driver
3 The QMSS (Queue Manager Sub System) found on Keystone SOCs is one of
8 The Queue Manager is a hardware module that is responsible for accelerating
37 - Queue Peek region.
38 - Queue status RAM.
39 - Queue configuration region.
41 - Queue Management/Queue Proxy region for queue Push.
42 - Queue Management/Queue Proxy region for queue Pop.
45 - Queue Peek region.
46 - Queue configuration region.
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp233 Queue.push_back(SU); in push()
589 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop()
592 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) { in pop()
602 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) in pop()
608 if (Best != std::prev(Queue.end())) in pop()
609 std::swap(*Best, Queue.back()); in pop()
611 Queue.pop_back(); in pop()
618 assert(!Queue.empty() && "Queue is empty!"); in remove()
619 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
620 if (I != std::prev(Queue.end())) in remove()
[all …]
/freebsd/sys/dev/cxgbe/firmware/
H A Dt4fw_cfg_uwire.txt62 # 8 Ingress Queue/MSI-X Vectors per application function
156 # 4 ports, 3 functions (NIC, FCoE and iSCSI), scaling up to 8 "CPU Queue Sets"
167 # Breakdown of Virtual Interface/Queue/Interrupt resources for the "Unified
170 # Each Ingress Queue can use one MSI-X interrupt but some Ingress Queues can
171 # use Forwarded Interrupt Ingress Queues. For these latter, an Ingress Queue
172 # would be created and the Queue ID of a Forwarded Interrupt Ingress Queue
173 # will be specified as the "Ingress Queue Asynchronous Destination Index."
218 # Forwarded Interrupt Queue) and General Interrupts per function.
303 # on PF0-3. The below assumes that we're only doing NIC with NCPUS "Queue
312 niqflint = 8 # NCPUS "Queue Sets"
[all …]
H A Dt5fw_cfg_uwire.txt47 # 8 Ingress Queue/MSI-X Vectors per application function
191 # 4 ports, 3 functions (NIC, FCoE and iSCSI), scaling up to 8 "CPU Queue Sets"
202 # Breakdown of Virtual Interface/Queue/Interrupt resources for the "Unified
205 # Each Ingress Queue can use one MSI-X interrupt but some Ingress Queues can
206 # use Forwarded Interrupt Ingress Queues. For these latter, an Ingress Queue
207 # would be created and the Queue ID of a Forwarded Interrupt Ingress Queue
208 # will be specified as the "Ingress Queue Asynchronous Destination Index."
253 # Forwarded Interrupt Queue) and General Interrupts per function.
339 # on PF0-3. The below assumes that we're only doing NIC with NCPUS "Queue
348 niqflint = 8 # NCPUS "Queue Sets"
[all …]
H A Dt6fw_cfg_uwire.txt47 # 16 Ingress Queue/MSI-X Vectors per application function
98 # Set the SGE Doorbell Queue Timer "tick" to 50us and initialize
208 # 4 ports, 3 functions (NIC, FCoE and iSCSI), scaling up to 8 "CPU Queue Sets"
219 # Breakdown of Virtual Interface/Queue/Interrupt resources for the "Unified
222 # Each Ingress Queue can use one MSI-X interrupt but some Ingress Queues can
223 # use Forwarded Interrupt Ingress Queues. For these latter, an Ingress Queue
224 # would be created and the Queue ID of a Forwarded Interrupt Ingress Queue
225 # will be specified as the "Ingress Queue Asynchronous Destination Index."
270 # Forwarded Interrupt Queue) and General Interrupts per function.
354 # on PF0-3. The below assumes that we're only doing NIC with NCPUS "Queue
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h84 std::queue<ContextTrieNode *> Queue;
88 Queue.push(Callee);
91 while (!Queue.empty()) {
92 ContextTrieNode *Caller = Queue.front();
93 Queue.pop();
105 Queue.push(Callee);
85 std::queue<ContextTrieNode *> Queue; global() variable
/freebsd/contrib/sendmail/src/
H A Dqueue.c638 Queue[e->e_dfqgrp]->qg_qpaths[e->e_dfqdir].qp_name);
1368 if (Queue[qgrp]->qg_queueintvl > 0)
1369 qintvl = Queue[qgrp]->qg_queueintvl;
1375 lastsched = Queue[qgrp]->qg_nextrun;
1377 if ((runall || Queue[qgrp]->qg_nextrun <= now) && qintvl > 0)
1393 Queue[qgrp]->qg_nextrun += qintvl;
1400 (long) Queue[qgrp]->qg_queueintvl,
1402 (long) Queue[qgrp]->qg_nextrun, sched);
1435 for (qgrp = 0; qgrp < NumQueue && Queue[qgrp] != NULL; qgrp++) in checkqueuerunner()
1439 if (Queue[qgrp]->qg_queueintvl > 0) in checkqueuerunner()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h543 std::vector<SUnit*> Queue; variable
555 bool empty() const { return Queue.empty(); } in empty()
557 void clear() { Queue.clear(); } in clear()
559 unsigned size() const { return Queue.size(); } in size()
563 iterator begin() { return Queue.begin(); } in begin()
565 iterator end() { return Queue.end(); } in end()
567 ArrayRef<SUnit*> elements() { return Queue; } in elements()
569 iterator find(SUnit *SU) { return llvm::find(Queue, SU); } in find()
572 Queue.push_back(SU); in push()
578 *I = Queue.back(); in remove()
[all …]
/freebsd/contrib/llvm-project/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/contrib/llvm-project/clang/lib/DirectoryWatcher/linux/
H A DDirectoryWatcher-linux.cpp140 EventQueue Queue; member in __anon3d2a272b0111::DirectoryWatcherLinux
170 Queue.push_back(DirectoryWatcher::Event::EventKind::WatcherGotInvalidated, in StopWork()
258 Queue.push_back(DirectoryWatcher::Event::EventKind::Modified, in InotifyPollingLoop()
261 Queue.push_back(DirectoryWatcher::Event::EventKind::Removed, in InotifyPollingLoop()
264 Queue.push_back(DirectoryWatcher::Event::EventKind::WatchedDirRemoved, in InotifyPollingLoop()
287 DirectoryWatcher::Event Event = this->Queue.pop_front_blocking(); in EventReceivingLoop()

12345