Home
last modified time | relevance | path

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

12345

/freebsd-13.1/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()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
73 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Support/
H A DOptimizedStructLayout.cpp278 LastQueueAlignment = Queue.Alignment; in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
306 Queue->MinSize = Last->Size; in performOptimizedStructLayout()
310 if (auto NewHead = Queue->getNext(Cur)) in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
315 FlexibleFieldsByAlignment.erase(Queue); in performOptimizedStructLayout()
334 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp83 Queue.push_back(SU); in push()
121 E = Queue.end(); I != E; ++I) in pop()
125 if (Best != std::prev(Queue.end())) in pop()
126 std::swap(*Best, Queue.back()); in pop()
127 Queue.pop_back(); in pop()
132 assert(!Queue.empty() && "Queue is empty!"); in remove()
133 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
135 if (I != std::prev(Queue.end())) in remove()
136 std::swap(*I, Queue.back()); in remove()
137 Queue.pop_back(); in remove()
[all …]
/freebsd-13.1/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()
91 assert(Queue[TokenID].Executed == false && "Instruction already executed!"); in onInstructionExecuted()
[all …]
/freebsd-13.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-13.1/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-13.1/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 __anonb66252010111::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()
242 FSEventStreamSetDispatchQueue(EventStream, Queue); in create()
248 dispatch_sync(Queue, InitWork); in create()
[all …]
/freebsd-13.1/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp57 std::deque<WorkListUnit> Queue; member in __anonff96a6e20111::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 __anonff96a6e20211::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-13.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-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h56 std::queue<ContextTrieNode *> Queue; in ProfiledCallGraph() local
60 Queue.push(Callee); in ProfiledCallGraph()
63 while (!Queue.empty()) { in ProfiledCallGraph()
64 ContextTrieNode *Caller = Queue.front(); in ProfiledCallGraph()
65 Queue.pop(); in ProfiledCallGraph()
76 Queue.push(Callee); in ProfiledCallGraph()
/freebsd-13.1/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
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.
47 - Queue Management/Queue Proxy region for queue Push/Pop.
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp238 Queue.push_back(SU); in push()
597 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) { in pop()
607 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) in pop()
613 if (Best != std::prev(Queue.end())) in pop()
614 std::swap(*Best, Queue.back()); in pop()
616 Queue.pop_back(); in pop()
623 assert(!Queue.empty() && "Queue is empty!"); in remove()
624 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
625 if (I != std::prev(Queue.end())) in remove()
626 std::swap(*I, Queue.back()); in remove()
[all …]
/freebsd-13.1/sys/dev/cxgbe/firmware/
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_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 Dt6fw_cfg_uwire.txt224 # would be created and the Queue ID of a Forwarded Interrupt Ingress Queue
363 niqflint = 8 # NCPUS "Queue Sets"
446 # "Queue Sets" each.
516 nethctrl = 4 # 2 "Queue Sets"
517 neq = 8 # 2 "Queue Sets" * 2
528 nethctrl = 4 # 2 "Queue Sets"
529 neq = 8 # 2 "Queue Sets" * 2
539 nethctrl = 4 # 2 "Queue Sets"
540 neq = 8 # 2 "Queue Sets" * 2
551 nethctrl = 4 # 2 "Queue Sets"
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/tools/llvm-objcopy/MachO/
H A DMachOWriter.cpp446 SmallVector<WriteOperation, 7> Queue; in writeTail() local
463 Queue.push_back( in writeTail()
468 Queue.push_back( in writeTail()
471 Queue.push_back( in writeTail()
474 Queue.push_back( in writeTail()
484 Queue.emplace_back(DySymTabCommand.indirectsymoff, in writeTail()
494 Queue.emplace_back(LinkEditDataCommand.dataoff, in writeTail()
504 Queue.emplace_back(LinkEditDataCommand.dataoff, in writeTail()
514 Queue.emplace_back(LinkEditDataCommand.dataoff, in writeTail()
524 Queue.emplace_back(LinkEditDataCommand.dataoff, in writeTail()
[all …]
/freebsd-13.1/contrib/sendmail/src/
H A Dqueue.c1333 if (Queue[qgrp]->qg_queueintvl > 0)
1404 if (Queue[qgrp]->qg_queueintvl > 0) in checkqueuerunner()
2128 if (Queue[qgrp]->qg_nice > 0)
2129 (void) nice(Queue[qgrp]->qg_nice);
5790 return Queue[qgrp]->qg_qdir;
5798 Queue[qgrp]->qg_qdir,
7306 Queue[i]->qg_nextrun = now;
7709 Queue[i] = s->s_quegrp = qg;
7842 WorkGrp[0].wg_qgs[0] = Queue[0]; in makeworkgroups()
7849 Queue[0]->qg_wgrp = 0; in makeworkgroups()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h534 std::vector<SUnit*> Queue; variable
546 bool empty() const { return Queue.empty(); } in empty()
548 void clear() { Queue.clear(); } in clear()
554 iterator begin() { return Queue.begin(); } in begin()
556 iterator end() { return Queue.end(); } in end()
558 ArrayRef<SUnit*> elements() { return Queue; } in elements()
563 Queue.push_back(SU); in push()
569 *I = Queue.back(); in remove()
570 unsigned idx = I - Queue.begin(); in remove()
571 Queue.pop_back(); in remove()
[all …]
/freebsd-13.1/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-13.1/contrib/llvm-project/clang/lib/DirectoryWatcher/linux/
H A DDirectoryWatcher-linux.cpp139 EventQueue Queue; member in __anonc66a83df0111::DirectoryWatcherLinux
169 Queue.push_back(DirectoryWatcher::Event::EventKind::WatcherGotInvalidated, in StopWork()
257 Queue.push_back(DirectoryWatcher::Event::EventKind::Modified, in InotifyPollingLoop()
260 Queue.push_back(DirectoryWatcher::Event::EventKind::Removed, in InotifyPollingLoop()
263 Queue.push_back(DirectoryWatcher::Event::EventKind::WatchedDirRemoved, in InotifyPollingLoop()
286 DirectoryWatcher::Event Event = this->Queue.pop_front_blocking(); in EventReceivingLoop()

12345