/freebsd-11-stable/contrib/llvm-project/lldb/source/Target/ |
H A D | Queue.cpp | 1 //===-- Queue.cpp -----------------------------------------------*- C++ -*-===// 9 #include "lldb/Target/Queue.h" 18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, function in class:Queue 30 Queue::~Queue() = default; 32 queue_id_t Queue::GetID() { return m_queue_id; } 34 const char *Queue::GetName() { 38 uint32_t Queue::GetIndexID() { return m_queue_id; } 40 std::vector<lldb::ThreadSP> Queue [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/ |
H A D | RetireControlUnit.cpp | 37 Queue.resize(2 * NumROBEntries); 47 Queue[NextAvailableSlotIdx] = {IR, Entries, false}; 49 NextAvailableSlotIdx %= Queue.size(); 56 const RetireControlUnit::RUToken &Current = Queue[CurrentInstructionSlotIdx]; 67 return NextSlotIdx % Queue.size(); 71 return Queue[computeNextSlotIdx()]; 75 RetireControlUnit::RUToken &Current = Queue[CurrentInstructionSlotIdx]; 80 CurrentInstructionSlotIdx %= Queue.size(); 86 assert(Queue.size() > TokenID); 87 assert(Queue[TokenI [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LatencyPriorityQueue.cpp | 84 Queue.push_back(SU); 122 std::vector<SUnit *>::iterator Best = Queue.begin(); 123 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()), 124 E = Queue.end(); I != E; ++I) 128 if (Best != std::prev(Queue.end())) 129 std::swap(*Best, Queue.back()); 130 Queue.pop_back(); 135 assert(!Queue.empty() && "Queue is empty!"); 136 std::vector<SUnit *>::iterator I = find(Queue, S [all...] |
H A D | RegAllocBasic.cpp | 69 CompSpillWeight> Queue; member in class:__anon2132::RABasic 92 Queue.push(LI); 96 if (Queue.empty()) 98 LiveInterval *LI = Queue.top(); 99 Queue.pop();
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Target/ |
H A D | Queue.h | 1 //===-- Queue.h ------------------------------------------------*- C++ -*-===// 22 // Queue: 32 class Queue : public std::enable_shared_from_this<Queue> { class in namespace:lldb_private 34 Queue(lldb::ProcessSP process_sp, lldb::queue_id_t queue_id, 37 ~Queue(); 39 /// Get the QueueID for this Queue 48 /// The QueueID for this Queue. 51 /// Get the name of this Queue 58 /// Get the IndexID for this Queue [all...] |
H A D | SystemRuntime.h | 231 /// Retrieve the Queue kind for the queue at a thread's dispatch_qaddr. 233 /// Retrieve the Queue kind - either eQueueKindSerial or 238 /// The Queue kind, if it could be read, else eQueueKindUnknown. 243 /// Get the pending work items for a libdispatch Queue 246 /// retrieve the list of pending work items for the specified Queue and add 247 /// it to the Queue. 251 virtual void PopulatePendingItemsForQueue(lldb_private::Queue *queue) {}
|
/freebsd-11-stable/usr.sbin/ppp/ |
H A D | link.h | 51 struct mqueue Queue[2]; /* Our output queue of mbufs */ member in struct:link 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 D | ipv6cp.h | 58 struct mqueue Queue[2]; /* Output packet queues */ member in struct:ipv6cp 62 #define IPV6CP_QUEUES(ipv6cp) (sizeof ipv6cp->Queue / sizeof ipv6cp->Queue[0])
|
H A D | ipcp.h | 102 struct mqueue Queue[3]; /* Output packet queues */ member in struct:ipcp 106 #define IPCP_QUEUES(ipcp) (sizeof ipcp->Queue / sizeof ipcp->Queue[0])
|
H A D | link.c | 104 for (queue = l->Queue; queue < highest; queue++) 115 for (queue = l->Queue; queue <= highest; queue++) 127 len += l->Queue[i].len; 141 len = l->Queue[i].len; 142 m = l->Queue[i].top; 172 for (queue = l->Queue; queue < highest; queue++) { 187 if (l->Queue[pri].len) { 188 bp = m_dequeue(l->Queue + pri); 191 (u_long)l->Queue[pri].len); 273 m_enqueue(l->Queue [all...] |
H A D | ncp.c | 240 m_enqueue(ipcp->Queue + pri, bp); 254 m_enqueue(ipv6cp->Queue + pri, bp); 295 for (q = ipcp->Queue; q < ipcp->Queue + IPCP_QUEUES(ipcp); q++) 300 for (q = ipv6cp->Queue; q < ipv6cp->Queue + IPV6CP_QUEUES(ipv6cp); q++)
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | WorkList.cpp | 57 std::deque<WorkListUnit> Queue; member in class:__anon903::BFS 61 return !Queue.empty(); 65 Queue.push_back(U); 69 WorkListUnit U = Queue.front(); 70 Queue.pop_front(); 92 std::deque<WorkListUnit> Queue; member in class:__anon904::BFSBlockDFSContents 97 return !Queue.empty() || !Stack.empty(); 102 Queue.push_front(U); 115 assert(!Queue.empty()); 118 WorkListUnit U = Queue [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | LatencyPriorityQueue.h | 37 /// 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 override { return Queue.empty(); }
|
H A D | ResourcePriorityQueue.h | 42 /// Queue, the number of nodes that the node is the sole unscheduled 47 /// Queue - The queue. 48 std::vector<SUnit*> Queue; member in class:llvm::ResourcePriorityQueue 114 bool empty() const override { return Queue.empty(); }
|
H A D | MachineScheduler.h | 530 std::vector<SUnit*> Queue; member in class:llvm::ReadyQueue 542 bool empty() const { return Queue.empty(); } 544 void clear() { Queue.clear(); } 546 unsigned size() const { return Queue.size(); } 550 iterator begin() { return Queue.begin(); } 552 iterator end() { return Queue.end(); } 554 ArrayRef<SUnit*> elements() { return Queue; } 556 iterator find(SUnit *SU) { return llvm::find(Queue, SU); } 559 Queue.push_back(SU); 565 *I = Queue [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/DirectoryWatcher/mac/ |
H A D | DirectoryWatcher-mac.cpp | 152 dispatch_queue_t Queue) { 209 dispatch_queue_t Queue = local 216 auto EventStream = createFSEventStream(Path, Receiver, Queue); 228 // to not miss any event. By dispatching this on the same serial Queue as 231 FSEventStreamSetDispatchQueue(EventStream, Queue); 233 // We need to decrement the ref count for Queue as initialize() will return 236 dispatch_release(Queue); 241 dispatch_sync(Queue, InitWork); 243 dispatch_async(Queue, InitWork); 149 createFSEventStream( StringRef Path, std::function<void(llvm::ArrayRef<DirectoryWatcher::Event>, bool)> Receiver, dispatch_queue_t Queue) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/ |
H A D | RetireControlUnit.h | 38 // schedulers. These "tokens" are managed by the RCU in its token Queue. 63 std::vector<RUToken> Queue; member in struct:llvm::mca::RetireControlUnit
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | RDFDeadCode.cpp | 29 SetQueue() : Set(), Queue() {} 32 return Queue.empty(); 35 T V = Queue.front(); 36 Queue.pop(); 43 Queue.push(V); 49 std::queue<T> Queue; member in struct:DeadCodeElimination::SetQueue
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ResourcePriorityQueue.cpp | 234 Queue.push_back(SU); 590 std::vector<SUnit *>::iterator Best = Queue.begin(); 593 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) { 603 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) 609 if (Best != std::prev(Queue.end())) 610 std::swap(*Best, Queue.back()); 612 Queue.pop_back(); 619 assert(!Queue [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-objcopy/MachO/ |
H A D | MachOWriter.cpp | 411 SmallVector<WriteOperation, 7> Queue; local 418 Queue.push_back({SymTabCommand.symoff, &MachOWriter::writeSymbolTable}); 420 Queue.push_back({SymTabCommand.stroff, &MachOWriter::writeStringTable}); 428 Queue.push_back( 431 Queue.push_back({DyLdInfoCommand.bind_off, &MachOWriter::writeBindInfo}); 433 Queue.push_back( 436 Queue.push_back( 439 Queue.push_back( 449 Queue.emplace_back(DySymTabCommand.indirectsymoff, 459 Queue [all...] |
/freebsd-11-stable/contrib/wpa/wpa_supplicant/ |
H A D | eapol_test.py | 12 import Queue namespace 128 res[i] = Queue.Queue()
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/DirectoryWatcher/linux/ |
H A D | DirectoryWatcher-linux.cpp | 138 EventQueue Queue; member in class:__anon465::DirectoryWatcherLinux 144 // Consumes inotify events and pushes directory watcher events to the Queue. 152 // bypassing the Queue. Both InitialScan and EventReceivingLoop use Receiver 156 // Processing events from the Queue. 161 // Push event of WatcherGotInvalidated kind to the Queue to stop the loop. 168 Queue.push_back(DirectoryWatcher::Event::EventKind::WatcherGotInvalidated, 256 Queue.push_back(DirectoryWatcher::Event::EventKind::Modified, 259 Queue.push_back(DirectoryWatcher::Event::EventKind::Removed, 262 Queue.push_back(DirectoryWatcher::Event::EventKind::WatchedDirRemoved, 285 DirectoryWatcher::Event Event = this->Queue [all...] |
/freebsd-11-stable/contrib/sendmail/src/ |
H A D | queue.c | 208 ** Queue data in shared memory 633 Queue[e->e_dfqgrp]->qg_qpaths[e->e_dfqdir].qp_name); 785 ** Expand macros completely here. Queue run will deal with 1333 if (Queue[qgrp]->qg_queueintvl > 0) 1334 qintvl = Queue[qgrp]->qg_queueintvl; 1340 lastsched = Queue[qgrp]->qg_nextrun; 1342 if ((runall || Queue[qgrp]->qg_nextrun <= now) && qintvl > 0) 1358 Queue[qgrp]->qg_nextrun += qintvl; 1365 (long) Queue[qgrp]->qg_queueintvl, 1367 (long) Queue[qgr [all...] |
/freebsd-11-stable/contrib/ntp/include/ |
H A D | ntp_prio_q.h | 31 typedef struct Queue { struct
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Serialization/ |
H A D | ModuleManager.cpp | 338 SmallVector<ModuleFile *, 4> Queue; local 339 Queue.reserve(N); 346 Queue.push_back(&M); 351 while (!Queue.empty()) { 352 ModuleFile *CurrentModule = Queue.pop_back_val(); 366 Queue.push_back(*M);
|