Home
last modified time | relevance | path

Searched full:queue (Results 1 – 25 of 1093) sorted by relevance

12345678910>>...44

/llvm-project/libcxx/test/std/containers/container.adaptors/queue/queue.cons/
H A Ddeduct.pass.cpp9 // <queue>
13 // queue(Container) -> queue<typename Container::value_type, Container>;
16 // queue(Container, Allocator) -> queue<typename Container::value_type, Container>;
19 // queue(from_range_t, R&&) -> queue<ranges::range_value_t<R>>; // since C++23
22 // queue(from_range_t, R&&, Allocator)
23 // -> queue<ranges::range_value_t<R>, deque<ranges::range_value_t<R>, Allocator>>; // since C…
26 #include <queue>
45 std::queue que(l); in main()
47 static_assert(std::is_same_v<decltype(que), std::queue<int, std::list<int>>>, ""); in main()
54 std::queue que(l, test_allocator<long>(0,2)); // different allocator in main()
[all …]
H A Dctor_iterators.pass.cpp11 // <queue>
14 // queue(InputIterator, InputIterator);
17 #include <queue>
22 static_assert(!std::is_constructible_v<std::queue<int>, int, int, std::allocator<int>>);
23 static_assert(!std::is_constructible_v<std::queue<int>, int*, int*, int>);
24 static_assert( std::is_constructible_v<std::queue<int, std::deque<int, test_allocator<int>>>, int*,…
25 static_assert(!std::is_constructible_v<std::queue<int, std::deque<int, test_allocator<int>>>, int*,…
37 …std::is_constructible_v<std::queue<int, std::deque<int, alloc<int>>>, int*, int*, test_allocator_s…
41 std::queue<int> queue(a, a + 4); in main() local
42 assert(queue.front() == 4); in main()
[all …]
H A Ddeduct.verify.cpp9 // <queue>
12 #include <queue>
23 // queue(const Container&, const Alloc&); in main()
25 …queue que(std::list<int>{1,2,3}, 45); // expected-error-re {{no viable constructor or deduction g… in main()
29 // queue(const queue&, const Alloc&); in main()
31 std::queue<int> source; in main()
32 …td::queue que(source, 45); // expected-error-re {{no viable constructor or deduction guide for de… in main()
37 // queue (allocator &) in main()
38 …queue que((std::allocator<int>())); // expected-error-re {{no viable constructor or deduction gui… in main()
/llvm-project/lldb/test/API/macosx/queues/
H A DTestQueues.py37 def check_queue_for_valid_queue_id(self, queue): argument
39 queue.GetQueueID(),
41 "Check queue %s for valid QueueID (got 0x%x)"
42 % (queue.GetName(), queue.GetQueueID()),
46 self, queue, expected_running, expected_pending
49 queue.GetNumPendingItems(),
51 "queue %s should have %d pending items, instead has %d pending items"
52 % (queue.GetName(), expected_pending, (queue.GetNumPendingItems())),
55 queue.GetNumRunningItems(),
57 "queue %s should have %d running items, instead has %d running items"
[all …]
/llvm-project/lldb/include/lldb/Target/
H A DQueue.h1 //===-- Queue.h ------------------------------------------------*- C++ -*-===//
22 // Queue:
23 // This class represents a libdispatch aka Grand Central Dispatch queue in the
28 // pthreads to execute the work items for the queues. A serial queue will be
30 // any work). A concurrent queue may be associated with multiple threads.
32 class Queue : public std::enable_shared_from_this<Queue> {
34 Queue(lldb::ProcessSP process_sp, lldb::queue_id_t queue_id,
37 ~Queue();
39 /// Get the QueueID for this Queue
41 /// A 64-bit ID number that uniquely identifies a queue at this particular
[all …]
H A DQueueList.h22 // This is the container for libdispatch aka Grand Central Dispatch Queue
42 /// Get the Queue at a given index number
45 /// The index number (0-based) of the queue.
47 /// The Queue at that index number.
65 /// Add a Queue to the QueueList
67 /// \param [in] queue
69 void AddQueue(lldb::QueueSP queue);
71 /// Find a queue in the QueueList by QueueID
77 /// A QueueSP to the queue requested, if it is present in the QueueList.
78 /// An empty QueueSP will be returned if this queue was not found.
[all …]
/llvm-project/third-party/benchmark/test/
H A Dbenchmark_random_interleaving_gtest.cc1 #include <queue>
20 class EventQueue : public std::queue<std::string> {
37 EventQueue* queue = new EventQueue(); variable
47 static void SetupHook(int /* num_threads */) { queue->push("Setup"); } in SetupHook()
49 static void TeardownHook(int /* num_threads */) { queue->push("Teardown"); } in TeardownHook()
52 queue->Clear(); in Execute()
58 queue->Put("DONE"); // End marker in Execute()
67 queue->Put(StrFormat("BM_Match1/%d", static_cast<int>(arg))); in BM_Match1()
80 ASSERT_EQ("BM_Match1/1", queue->Get()); in TEST_F()
81 ASSERT_EQ("BM_Match1/2", queue->Get()); in TEST_F()
[all …]
/llvm-project/libcxx/include/
H A Dqueue14 queue synopsis
20 class queue
33 queue() = default;
34 ~queue() = default;
36 queue(const queue& q) = default;
37 queue(queue&& q) = default;
39 queue& operator=(const queue
[all...]
/llvm-project/lldb/source/Target/
H A DQueue.cpp1 //===-- Queue.cpp ---------------------------------------------------------===//
9 #include "lldb/Target/Queue.h"
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()
[all …]
/llvm-project/mlir/lib/ExecutionEngine/
H A DSyclRuntimeWrappers.cpp77 static void *allocDeviceMemory(sycl::queue *queue, size_t size, bool isShared) { in allocDeviceMemory() argument
92 static void deallocDeviceMemory(sycl::queue *queue, void *ptr) { in deallocDeviceMemory() argument
93 sycl::free(ptr, *queue); in deallocDeviceMemory()
132 static void launchKernel(sycl::queue *queue, sycl::kernel *kernel, size_t gridX, in launchKernel() argument
141 queue->submit([&](sycl::handler &cgh) { in launchKernel()
151 extern "C" SYCL_RUNTIME_EXPORT sycl::queue *mgpuStreamCreate() { in mgpuStreamCreate()
154 sycl::queue *queue = in mgpuStreamCreate() local
155 new sycl::queue(getDefaultContext(), getDefaultDevice()); in mgpuStreamCreate()
156 return queue; in mgpuStreamCreate()
160 extern "C" SYCL_RUNTIME_EXPORT void mgpuStreamDestroy(sycl::queue *queue) { in mgpuStreamDestroy() argument
[all …]
/llvm-project/lldb/unittests/Utility/
H A DSharedClusterTest.cpp18 DestructNotifier(std::vector<int> &Queue, int Key) : Queue(Queue), Key(Key) {} in DestructNotifier() argument
19 ~DestructNotifier() { Queue.push_back(Key); } in ~DestructNotifier()
21 std::vector<int> &Queue; member in __anon77b8fe3e0111::DestructNotifier
27 std::vector<int> Queue; in TEST() local
30 auto *One = new DestructNotifier(Queue, 1); in TEST()
31 auto *Two = new DestructNotifier(Queue, 2); in TEST()
35 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
39 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
44 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
50 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
[all …]
/llvm-project/clang-tools-extra/clangd/index/
H A DBackgroundQueue.cpp1 //===-- BackgroundQueue.cpp - Task queue for background index -------------===//
27 CV.wait(Lock, [&] { return ShouldStop || !Queue.empty(); }); in work()
29 Queue.clear(); in work()
34 std::pop_heap(Queue.begin(), Queue.end()); in work()
35 Task = std::move(Queue.back()); in work()
36 Queue.pop_back(); in work()
50 if (Stat.Active == 1 && Queue.empty()) { in work()
51 // We just finished the last item, the queue is going idle. in work()
94 Queue.push_back(std::move(T)); in push()
95 std::push_heap(Queue.begin(), Queue.end()); in push()
[all …]
/llvm-project/llvm/lib/Support/
H A DOptimizedStructLayout.cpp237 /// The minimum size of anything currently in this queue. in performOptimizedStructLayout()
240 /// The head of the queue. A singly-linked list. The order here should in performOptimizedStructLayout()
244 /// We remove the queue from the array as soon as this is empty. in performOptimizedStructLayout()
247 /// The alignment requirement of the queue. in performOptimizedStructLayout()
276 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()
[all …]
/llvm-project/compiler-rt/lib/asan/tests/
H A Dasan_mac_test_helpers.mm93 dispatch_queue_t queue = dispatch_get_global_queue(0, 0);
98 dispatch_async(queue, block);
103 dispatch_queue_t queue = dispatch_get_global_queue(2, 0);
108 dispatch_sync(queue, block);
115 dispatch_queue_t queue = dispatch_get_global_queue(0, 0);
119 dispatch_async(queue, block_alloc);
121 dispatch_async(queue, block_crash);
127 dispatch_queue_t queue[4];
128 queue[0] = dispatch_get_global_queue(2, 0);
129 queue[1] = dispatch_get_global_queue(0, 0);
[all …]
/llvm-project/libcxx/test/std/containers/container.adaptors/queue/queue.ops/
H A Dlt.pass.cpp9 // <queue>
12 // bool operator< (const queue<T, Container>& x,const queue<T, Container>& y);
15 // bool operator> (const queue<T, Container>& x,const queue<T, Container>& y);
18 // bool operator>=(const queue<T, Container>& x,const queue<T, Container>& y);
21 // bool operator<=(const queue<T, Container>& x,const queue<T, Container>& y);
23 #include <queue>
40 std::queue<int> q1 = make<std::queue<int> >(5); in main()
41 std::queue<int> q2 = make<std::queue<int> >(10); in main()
H A Deq.pass.cpp9 // <queue>
12 // bool operator==(const queue<T, Container>& x,const queue<T, Container>& y);
15 // bool operator!=(const queue<T, Container>& x,const queue<T, Container>& y);
17 #include <queue>
34 std::queue<int> q1 = make<std::queue<int> >(5); in main()
35 std::queue<int> q2 = make<std::queue<int> >(10); in main()
36 std::queue<int> q1_save = q1; in main()
37 std::queue<int> q2_save = q2; in main()
/llvm-project/libcxx/test/std/containers/container.adaptors/queue/queue.cons.alloc/
H A Dctor_iterators.pass.cpp11 // <queue>
14 // queue(InputIterator, InputIterator, const Allocator&);
17 #include <queue>
21 using base_type = std::queue<int, std::deque<int, test_allocator<int>>>;
38 GetAlloc queue(stats, a, a + 4); in main() local
39 assert(queue.front() == 4); in main()
40 queue.pop(); in main()
41 assert(queue.front() == 3); in main()
42 queue.pop(); in main()
43 assert(queue.front() == 2); in main()
[all …]
/llvm-project/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp1 //===---- LatencyPriorityQueue.cpp - A latency-oriented priority queue ----===//
81 Queue.push_back(SU); in push()
107 // Since it is available, it must be in the priority queue. First remove it. in AdjustPriorityOfUnscheduledPreds()
110 // Reinsert the node into the priority queue, which recomputes its in AdjustPriorityOfUnscheduledPreds()
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()
[all …]
/llvm-project/libcxx/utils/ci/
H A Dbuildkite-pipeline.yml41 queue: libcxx-builders-linaro-arm
48 queue: libcxx-builders-linaro-arm
55 queue: libcxx-builders-linaro-arm
62 queue: libcxx-builders-linaro-arm
69 queue: libcxx-builders-linaro-arm
76 queue: libcxx-builders-linaro-arm
83 queue: libcxx-builders-linaro-arm
90 queue: libcxx-builders-linaro-arm
103 queue: libcxx-builders
114 queue
[all...]
/llvm-project/compiler-rt/test/tsan/libdispatch/
H A Dio.c9 dispatch_queue_t queue; variable
17 …h_io_create_with_path(DISPATCH_IO_STREAM, path, O_CREAT | O_WRONLY, 0666, queue, ^(int error) { }); in test_dispatch_io_write()
22 …dispatch_io_write(channel, 0, data, queue, ^(bool done, dispatch_data_t remainingData, int error) { in test_dispatch_io_write()
25 dispatch_async(queue, ^{ in test_dispatch_io_write()
43 dispatch_write(fd, data, queue, ^(dispatch_data_t data, int error) { in test_dispatch_write()
46 dispatch_async(queue, ^{ in test_dispatch_write()
60 0, queue, ^(int error) { }); in test_dispatch_io_read()
64 …dispatch_io_read(channel, 0, SIZE_MAX, queue, ^(bool done, dispatch_data_t remainingData, int erro… in test_dispatch_io_read()
67 dispatch_async(queue, ^{ in test_dispatch_io_read()
85 dispatch_read(fd, SIZE_MAX, queue, ^(dispatch_data_t data, int error) { in test_dispatch_read()
[all …]
/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp57 std::deque<WorkListUnit> Queue; member in __anon0d17b1c10111::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 __anon0d17b1c10211::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 …]
/llvm-project/clang/test/Analysis/
H A Dstack-capture-leak-arc.mm5 void dispatch_async(dispatch_queue_t queue, dispatch_block_t block);
9 void dispatch_after(dispatch_time_t when, dispatch_queue_t queue, dispatch_block_t block);
10 void dispatch_barrier_sync(dispatch_queue_t queue, dispatch_block_t block);
13 extern dispatch_queue_t queue;
21 dispatch_async(queue, ^{
40 dispatch_after(when, queue, ^{
51 dispatch_async(queue, ^{
63 dispatch_async(queue, b);
74 dispatch_async(queue, b);
90 dispatch_async(queue, get_leaking_block());
[all …]
/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()
62 assert(Inst && "Invalid RUToken in the RCU queue."); in getCurrentToken()
70 return NextSlotIdx % Queue.size(); in computeNextSlotIdx()
74 return Queue[computeNextSlotIdx()]; in peekNextToken()
78 RetireControlUnit::RUToken &Current = Queue[CurrentInstructionSlotIdx]; in consumeCurrentToken()
81 // Update the slot index to be the next item in the circular queue. in consumeCurrentToken()
83 CurrentInstructionSlotIdx %= Queue.size(); in consumeCurrentToken()
[all …]
/llvm-project/llvm/test/Transforms/InstCombine/
H A Ddebuginfo-dce.ll11 ; void scan(struct entry *queue, struct entry *end)
14 ; for (entry = (struct entry *)((char *)(queue->next) - 8);
30 define void @salvage_load(ptr %queue) local_unnamed_addr #0 !dbg !14 {
33 %0 = load ptr, ptr %queue, align 8, !dbg !19
34 %1 = load ptr, ptr %queue, align 8, !dbg !19
43 define void @salvage_bitcast(ptr %queue) local_unnamed_addr #0 !dbg !22 {
46 call void @llvm.dbg.value(metadata ptr %queue, metadata !24, metadata !20), !dbg !23
49 ; CHECK-NEXT: #dbg_value(ptr %queue,
51 store ptr %queue, ptr %im_not_dead, align 8
55 define void @salvage_gep0(ptr %queue, ptr %end) local_unnamed_addr #0 !dbg !25 {
[all …]
/llvm-project/libcxx/test/std/containers/container.adaptors/queue/queue.defn/
H A Dtypes.pass.cpp9 // <queue>
12 // class queue
26 #include <queue>
32 : private std::queue<int>
50 static_assert(( std::is_same<std::queue<int>::container_type, std::deque<int> >::value), ""); in main()
51 …static_assert(( std::is_same<std::queue<int, std::vector<int> >::container_type, std::vector<int> … in main()
52 static_assert(( std::is_same<std::queue<int, std::vector<int> >::value_type, int>::value), ""); in main()
53 … static_assert(( std::is_same<std::queue<int>::reference, std::deque<int>::reference>::value), ""); in main()
54 …static_assert(( std::is_same<std::queue<int>::const_reference, std::deque<int>::const_reference>::… in main()
55 … static_assert(( std::is_same<std::queue<int>::size_type, std::deque<int>::size_type>::value), ""); in main()
[all …]

12345678910>>...44