Home
last modified time | relevance | path

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

12345

/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/llvm/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;
/openbsd-src/gnu/llvm/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 __anon0fd2c5240111::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 …]
/openbsd-src/gnu/usr.bin/perl/dist/Thread-Queue/t/
H A D06_insert.t13 use Thread::Queue;
25 my $q = Thread::Queue->new(1..10);
39 $q = Thread::Queue->new(1..10);
51 $q = Thread::Queue->new(1..10);
63 $q = Thread::Queue->new(1..10);
75 $q = Thread::Queue->new();
81 $q = Thread::Queue->new();
87 $q = Thread::Queue->new();
93 $q = Thread::Queue->new();
H A D09_ended.t18 use Thread::Queue;
30 my $q = Thread::Queue->new(@items);
31 my $r = Thread::Queue->new();
57 is($q->pending(), 0, 'Queue is empty');
62 is($q->pending(), undef, 'Queue is ended');
73 my $q = Thread::Queue->new(@items);
74 my $r = Thread::Queue->new();
100 is($q->pending(), 1, 'Queue has one left');
110 is($q->pending(), undef, 'Queue is ended');
116 my $q = Thread::Queue->new(@items);
H A D01_basic.t13 use Thread::Queue;
29 my $q = Thread::Queue->new(1..$nthreads);
60 $q = Thread::Queue->new();
68 is($q->pending(), scalar(@items), 'Queue count in thread');
76 is($q->pending(), 1, 'Queue count after thread');
110 is($q->pending(), scalar(@items), 'Queue count');
113 is($q->pending(), scalar(@items), 'Queue count in thread');
126 is($q->pending(), 1, 'Queue count after thread');
H A D10_timed.t13 use Thread::Queue;
27 my $q = Thread::Queue->new();
32 is($q->pending(), scalar(@items), 'Queue count');
35 is($q->pending(), scalar(@items), 'Queue count in thread');
48 is($q->pending(), 1, 'Queue count after thread');
62 is($q->pending(), 1, 'Queue count after thread');
H A D11_limit.t18 use Thread::Queue;
24 my $q = Thread::Queue->new();
25 my $rpt = Thread::Queue->new();
46 is_deeply(\@items, [4, 3, 4, 3, 'go'], 'Queue reports');
51 is($item, $q->limit, 'Queue limit set');
58 is($item, $q->pending(), 'Queue count');
108 is($q->pending, 3, 'Queue loaded');
H A D08_nothreads.t6 use Thread::Queue;
45 # Queue up items
46 my $q = Thread::Queue->new(\@ary1, \@ary2);
48 is($q->pending(), 2, 'Queue count');
50 is($q->pending(), 4, 'Queue count');
52 is($q->pending(), 7, 'Queue count');
56 is($q->pending(), 7, 'Queue count in thread');
H A D02_refs.t14 use Thread::Queue;
77 # Queue up items
78 my $q = Thread::Queue->new(\@ary1, \@ary2);
80 is($q->pending(), 2, 'Queue count');
82 is($q->pending(), 4, 'Queue count');
84 is($q->pending(), 8, 'Queue count');
86 is($q->pending(), 12, 'Queue count');
90 is($q->pending(), 12, 'Queue count in thread');
H A D05_extract.t13 use Thread::Queue;
25 my $q = Thread::Queue->new(1..10);
40 $q = Thread::Queue->new(1..10);
56 $q = Thread::Queue->new(1..10);
H A D03_peek.t13 use Thread::Queue;
25 my $q = Thread::Queue->new(1..10);
43 is($q->pending(), 11, 'Queue count in thread');
/openbsd-src/gnu/llvm/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp57 std::deque<WorkListUnit> Queue; member in __anon59a745250111::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 __anon59a745250211::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 …]
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp241 std::queue<uint64_t> Queue; in findAugmentingPath() local
242 Queue.push(Source); in findAugmentingPath()
245 while (!Queue.empty()) { in findAugmentingPath()
246 uint64_t Src = Queue.front(); in findAugmentingPath()
247 Queue.pop(); in findAugmentingPath()
281 Queue.push(Dst); in findAugmentingPath()
648 std::queue<uint64_t> Queue; in findReachable() local
649 Queue.push(Src); in findReachable()
651 while (!Queue.empty()) { in findReachable()
652 Src = Queue.front(); in findReachable()
[all …]
/openbsd-src/gnu/usr.bin/perl/dist/Thread-Queue/examples/
H A Dcallback.pl14 use Thread::Queue;
19 my $regis_q = Thread::Queue->new();
22 my $event_q = Thread::Queue->new();
111 my $q = Thread::Queue->new();
H A Dqueue.pl7 use Thread::Queue 3.01;
11 my $work_q = Thread::Queue->new(qw/foo bar baz/);
14 my $status_q = Thread::Queue->new();
/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h79 std::queue<ContextTrieNode *> Queue; in ProfiledCallGraph() local
83 Queue.push(Callee); in ProfiledCallGraph()
86 while (!Queue.empty()) { in ProfiledCallGraph()
87 ContextTrieNode *Caller = Queue.front(); in ProfiledCallGraph()
88 Queue.pop(); in ProfiledCallGraph()
100 Queue.push(Callee); in ProfiledCallGraph()
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h537 std::vector<SUnit*> Queue; variable
549 bool empty() const { return Queue.empty(); } in empty()
551 void clear() { Queue.clear(); } in clear()
553 unsigned size() const { return Queue.size(); } in size()
557 iterator begin() { return Queue.begin(); } in begin()
559 iterator end() { return Queue.end(); } in end()
561 ArrayRef<SUnit*> elements() { return Queue; } in elements()
563 iterator find(SUnit *SU) { return llvm::find(Queue, SU); } in find()
566 Queue.push_back(SU); in push()
572 *I = Queue.back(); in remove()
[all …]
/openbsd-src/gnu/llvm/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
/openbsd-src/gnu/llvm/clang/lib/DirectoryWatcher/linux/
H A DDirectoryWatcher-linux.cpp140 EventQueue Queue; member in __anon7b55d0820111::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()
/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DSCCIterator.h350 std::queue<NodeType *> Queue; in scc_member_iterator() local
355 Queue.push(Edge->Source); in scc_member_iterator()
360 while (!Queue.empty()) { in scc_member_iterator()
361 auto *Node = Queue.front(); in scc_member_iterator()
362 Queue.pop(); in scc_member_iterator()
367 Queue.push(Edge.Target); in scc_member_iterator()

12345