/freebsd/contrib/llvm-project/lldb/source/Target/ |
H A D | Queue.cpp | 18 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/contrib/llvm-project/llvm/lib/Support/ |
H A D | OptimizedStructLayout.cpp | 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() 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() 312 Queue->Head = NewHead; in performOptimizedStructLayout() 335 spliceFromQueue(Queue, Last, Cur); in performOptimizedStructLayout() 351 assert(Queue->Head); in performOptimizedStructLayout() 359 if (Queue->MinSize > MaxViableSize) in performOptimizedStructLayout() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LatencyPriorityQueue.cpp | 81 Queue.push_back(SU); in push() 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() 133 if (I != std::prev(Queue.end())) in remove() 134 std::swap(*I, Queue.back()); in remove() 135 Queue.pop_back(); in remove() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/ |
H A D | RetireControlUnit.cpp | 39 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/contrib/googletest/googletest/samples/ |
H A D | sample3-inl.h | 41 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 D | sample3_unittest.cc | 90 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 D | sample5_unittest.cc | 157 Queue<int> q0_; 158 Queue<int> q1_; 159 Queue<int> q2_;
|
/freebsd/contrib/llvm-project/lldb/include/lldb/Target/ |
H A D | Queue.h | 32 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 D | DirectoryWatcher-mac.cpp | 49 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 __anon3ec11e150111::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/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | WorkList.cpp | 57 std::deque<WorkListUnit> Queue; member in __anon5f5042760111::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 __anon5f5042760211::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 D | SampleProfileInference.cpp | 243 Queue.push(Source); in findAugmentingPath() 248 Queue.pop(); in findAugmentingPath() 650 Queue.push(Src); in findReachable() 653 Src = Queue.front(); in findReachable() 654 Queue.pop(); in findReachable() 700 Queue.erase(Queue.begin()); in findShortestPath() 835 Queue.pop(); in findUnknownSubgraph() 947 Queue.pop(); in isAcyclicSubgraph() 1297 Queue.push(Func.Entry); in verifyOutput() 1301 Queue.pop(); in verifyOutput() [all …]
|
/freebsd/usr.sbin/ppp/ |
H A D | link.c | 102 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 D | link.h | 49 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 D | ipv6cp.h | 56 struct mqueue Queue[2]; /* Output packet queues */ member 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 104 #define IPCP_QUEUES(ipcp) (sizeof ipcp->Queue / sizeof ipcp->Queue[0])
|
/freebsd/sys/contrib/device-tree/Bindings/soc/ti/ |
H A D | keystone-navigator-qmss.txt | 1 * 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/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ResourcePriorityQueue.cpp | 233 Queue.push_back(SU); in push() 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() 621 std::swap(*I, Queue.back()); in remove() [all …]
|
/freebsd/sys/dev/cxgbe/firmware/ |
H A D | t4fw_cfg_uwire.txt | 172 # 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 D | t5fw_cfg_uwire.txt | 207 # 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 D | t6fw_cfg_uwire.txt | 224 # 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/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
H A D | ProfiledCallGraph.h | 84 std::queue<ContextTrieNode *> Queue; variable 88 Queue.push(Callee); 91 while (!Queue.empty()) { 92 ContextTrieNode *Caller = Queue.front(); 93 Queue.pop(); 105 Queue.push(Callee);
|
/freebsd/contrib/sendmail/src/ |
H A D | queue.c | 1368 if (Queue[qgrp]->qg_queueintvl > 0) 1439 if (Queue[qgrp]->qg_queueintvl > 0) in checkqueuerunner() 2166 if (Queue[qgrp]->qg_nice > 0) 2167 (void) nice(Queue[qgrp]->qg_nice); 5856 return Queue[qgrp]->qg_qdir; 5864 Queue[qgrp]->qg_qdir, 7370 Queue[i]->qg_nextrun = now; 7772 Queue[i] = s->s_quegrp = qg; 7905 WorkGrp[0].wg_qgs[0] = Queue[0]; in makeworkgroups() 7912 Queue[0]->qg_wgrp = 0; in makeworkgroups() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | RDFDeadCode.cpp | 29 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 D | DirectoryWatcher-linux.cpp | 140 EventQueue Queue; member in __anonbab939f30111::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()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineScheduler.h | 543 std::vector<SUnit*> Queue; variable 555 bool empty() const { return Queue.empty(); } in empty() 557 void clear() { Queue.clear(); } in clear() 563 iterator begin() { return Queue.begin(); } in begin() 565 iterator end() { return Queue.end(); } in end() 567 ArrayRef<SUnit*> elements() { return Queue; } in elements() 572 Queue.push_back(SU); in push() 578 *I = Queue.back(); in remove() 579 unsigned idx = I - Queue.begin(); in remove() 580 Queue.pop_back(); in remove() [all …]
|