Home
last modified time | relevance | path

Searched refs:Queue (Results 1 - 25 of 200) sorted by relevance

12345678

/third_party/ffmpeg/libavfilter/dnn/
H A Dqueue.h29 typedef struct Queue Queue; typedef
32 * @brief Create a Queue instance.
33 * It initializes the length of the Queue as 0.
35 * @return Pointer to the Queue
38 Queue *ff_queue_create(void);
41 * @brief Destroy the Queue instance.
42 * It also frees all elements of the Queue.
44 void ff_queue_destroy(Queue *q);
47 * @brief Return the length of the Queue
[all...]
H A Dqueue.c33 struct Queue { struct
47 Queue* ff_queue_create(void) in ff_queue_create()
49 Queue *q = av_malloc(sizeof(*q)); in ff_queue_create()
72 void ff_queue_destroy(Queue *q) in ff_queue_destroy()
88 size_t ff_queue_size(Queue *q) in ff_queue_size()
93 void *ff_queue_peek_front(Queue *q) in ff_queue_peek_front()
101 void *ff_queue_peek_back(Queue *q) in ff_queue_peek_back()
109 int ff_queue_push_front(Queue *q, void *v) in ff_queue_push_front()
130 int ff_queue_push_back(Queue *q, void *v) in ff_queue_push_back()
151 void *ff_queue_pop_front(Queue *
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp84 Queue.push_back(SU); in push()
122 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop()
123 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()), in pop()
124 E = Queue.end(); I != E; ++I) in pop()
128 if (Best != std::prev(Queue.end())) in pop()
129 std::swap(*Best, Queue.back()); in pop()
130 Queue.pop_back(); in pop()
135 assert(!Queue.empty() && "Queue is empty!"); in remove()
136 std::vector<SUnit *>::iterator I = find(Queue, S in remove()
[all...]
H A DRegAllocBasic.cpp69 CompSpillWeight> Queue; member in __anon24086::RABasic
92 Queue.push(LI);
96 if (Queue.empty())
98 LiveInterval *LI = Queue.top();
99 Queue.pop();
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MCA/HardwareUnits/
H A DRetireControlUnit.cpp37 Queue.resize(2 * NumROBEntries); in RetireControlUnit()
47 Queue[NextAvailableSlotIdx] = {IR, Entries, false}; in dispatch()
49 NextAvailableSlotIdx %= Queue.size(); in dispatch()
56 const RetireControlUnit::RUToken &Current = Queue[CurrentInstructionSlotIdx]; in getCurrentToken()
67 return NextSlotIdx % Queue.size(); in computeNextSlotIdx()
71 return Queue[computeNextSlotIdx()]; in peekNextToken()
75 RetireControlUnit::RUToken &Current = Queue[CurrentInstructionSlotIdx]; in consumeCurrentToken()
80 CurrentInstructionSlotIdx %= Queue.size(); in consumeCurrentToken()
86 assert(Queue.size() > TokenID); in onInstructionExecuted()
87 assert(Queue[TokenI in onInstructionExecuted()
[all...]
/third_party/python/Lib/test/test_asyncio/
H A Dtest_queues.py15 """Test Queue's repr or str.
17 fn is repr or str. expect_id is True if we expect the Queue's id to
18 appear in fn(Queue()).
20 q = asyncio.Queue()
21 self.assertTrue(fn(q).startswith('<Queue'), fn(q))
26 q = asyncio.Queue()
39 q = asyncio.Queue(maxsize=1)
52 q = asyncio.Queue()
63 q = asyncio.Queue[int]
68 q = asyncio.Queue()
[all...]
/third_party/skia/third_party/externals/dawn/src/dawn_native/vulkan/
H A DQueueVk.cpp31 Queue* Queue::Create(Device* device) { in Create()
32 return new Queue(device); in Create()
35 Queue::Queue(Device* device) : QueueBase(device) { in Queue() function in dawn_native::vulkan::Queue
38 Queue::~Queue() { in ~Queue()
41 MaybeError Queue::SubmitImpl(uint32_t commandCount, CommandBufferBase* const* commands) { in SubmitImpl()
H A DQueueVk.h18 #include "dawn_native/Queue.h"
24 class Queue final : public QueueBase {
26 static Queue* Create(Device* device);
29 Queue(Device* device);
30 ~Queue() override;
/third_party/googletest/googletest/samples/
H A Dsample3-inl.h37 // Queue is a simple queue implemented as a singled-linked list.
41 class Queue;
43 // QueueNode is a node in a Queue, which consists of an element of
47 friend class Queue<E>;
72 class Queue { class
75 Queue() : head_(nullptr), last_(nullptr), size_(0) {} in Queue() function in Queue
78 ~Queue() { Clear(); } in ~Queue()
151 Queue* Map(F function) const { in Map()
152 Queue* new_queue = new Queue(); in Map()
[all...]
H A Dsample3_unittest.cc89 // A helper function for testing Queue::Map().
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_;
140 // Tests the Queue::Map() function.
H A Dsample5_unittest.cc157 Queue<int> q0_;
158 Queue<int> q1_;
159 Queue<int> q2_;
/third_party/skia/third_party/externals/dawn/src/dawn_wire/client/
H A DQueue.cpp15 #include "dawn_wire/client/Queue.h"
22 Queue::~Queue() { in ~Queue()
26 bool Queue::OnWorkDoneCallback(uint64_t requestSerial, WGPUQueueWorkDoneStatus status) { in OnWorkDoneCallback()
36 void Queue::OnSubmittedWorkDone(uint64_t signalValue, in OnSubmittedWorkDone()
54 void Queue::WriteBuffer(WGPUBuffer cBuffer, in WriteBuffer()
70 void Queue::WriteTexture(const WGPUImageCopyTexture* destination, in WriteTexture()
86 void Queue::CancelCallbacksForDisconnect() { in CancelCallbacksForDisconnect()
90 void Queue::ClearAllCallbacks(WGPUQueueWorkDoneStatus status) { in ClearAllCallbacks()
/third_party/skia/third_party/externals/swiftshader/src/Vulkan/
H A DVkQueue.cpp34 Queue::SubmitInfo *Queue::DeepCopySubmitInfo(uint32_t submitCount, const VkSubmitInfo *pSubmits) in DeepCopySubmitInfo()
167 Queue::Queue(Device *device, marl::Scheduler *scheduler) in Queue() function in vk::Queue
170 queueThread = std::thread(&Queue::taskLoop, this, scheduler); in Queue()
173 Queue::~Queue() in ~Queue()
185 VkResult Queue::submit(uint32_t submitCount, const VkSubmitInfo *pSubmits, Fence *fence) in submit()
203 void Queue::submitQueue(const Task &task) in submitQueue()
272 void Queue
[all...]
H A DVkQueue.hpp40 class Queue class
45 Queue(Device *device, marl::Scheduler *scheduler);
46 ~Queue();
105 static inline Queue *Cast(VkQueue object) in Cast()
107 return reinterpret_cast<Queue *>(object); in Cast()
/third_party/node/deps/v8/tools/testrunner/local/
H A Dpool.py7 from multiprocessing import Process, Queue namespace
16 from Queue import Empty # Python 2
26 global Queue
28 del Queue
31 from queue import Queue # Python 3 namespace
33 from Queue import Queue # Python 2 namespace
36 # Monkeypatch threading Queue to look like multiprocessing Queue.
37 Queue
[all...]
/third_party/python/Lib/multiprocessing/dummy/
H A Dconnection.py12 from queue import Queue namespace
21 self._backlog_queue = Queue(backlog)
41 _in, _out = Queue(), Queue()
47 a, b = Queue(), Queue()
/third_party/rust/crates/bindgen/bindgen/ir/
H A Dtraversal.rs374 pub struct ItemTraversal<'ctx, Storage, Queue>
377 Queue: TraversalQueue,
385 queue: Queue,
394 impl<'ctx, Storage, Queue> ItemTraversal<'ctx, Storage, Queue>
397 Queue: TraversalQueue,
404 ) -> ItemTraversal<'ctx, Storage, Queue> in new()
409 let mut queue = Queue::default(); in new()
426 impl<'ctx, Storage, Queue> Tracer for ItemTraversal<'ctx, Storage, Queue>
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp234 Queue.push_back(SU); in push()
590 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop()
593 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) { in pop()
603 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) in pop()
609 if (Best != std::prev(Queue.end())) in pop()
610 std::swap(*Best, Queue.back()); in pop()
612 Queue.pop_back(); in pop()
619 assert(!Queue in remove()
[all...]
/third_party/skia/third_party/externals/dawn/src/dawn_native/opengl/
H A DQueueGL.cpp26 Queue::Queue(Device* device) : QueueBase(device) { in Queue() function in dawn_native::opengl::Queue
29 MaybeError Queue::SubmitImpl(uint32_t commandCount, CommandBufferBase* const* commands) { in SubmitImpl()
42 MaybeError Queue::WriteBufferImpl(BufferBase* buffer, in WriteBufferImpl()
55 MaybeError Queue::WriteTextureImpl(const ImageCopyTexture& destination, in WriteTextureImpl()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcordz_handle.h84 struct Queue { struct in absl::cord_internal::CordzHandle
85 constexpr explicit Queue(absl::ConstInitType) in Queue() function
111 ABSL_CONST_INIT static Queue global_queue_;
112 Queue* const queue_ = &global_queue_;
/third_party/skia/third_party/externals/dawn/src/dawn_native/d3d12/
H A DQueueD3D12.cpp29 Queue::Queue(Device* device) : QueueBase(device) { in Queue() function in dawn_native::d3d12::Queue
32 MaybeError Queue::SubmitImpl(uint32_t commandCount, CommandBufferBase* const* commands) { in SubmitImpl()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h530 std::vector<SUnit*> Queue; member in llvm::ReadyQueue
542 bool empty() const { return Queue.empty(); } in empty()
544 void clear() { Queue.clear(); } in clear()
546 unsigned size() const { return Queue.size(); } in size()
550 iterator begin() { return Queue.begin(); } in begin()
552 iterator end() { return Queue.end(); } in end()
554 ArrayRef<SUnit*> elements() { return Queue; } in elements()
556 iterator find(SUnit *SU) { return llvm::find(Queue, SU); } in find()
559 Queue.push_back(SU); in push()
565 *I = Queue in remove()
[all...]
/third_party/python/Doc/includes/
H A Dmp_workers.py4 from multiprocessing import Process, Queue, current_process, freeze_support namespace
46 task_queue = Queue()
47 done_queue = Queue()
/third_party/skia/third_party/externals/swiftshader/tests/VulkanWrapper/
H A DUtil.hpp29 void endSingleTimeCommands(vk::Device device, vk::CommandPool commandPool, vk::Queue queue, vk::CommandBuffer commandBuffer);
31 void transitionImageLayout(vk::Device device, vk::CommandPool commandPool, vk::Queue queue, vk::Image image, vk::Format format, vk::ImageLayout oldLayout, vk::ImageLayout newLayout);
33 void copyBufferToImage(vk::Device device, vk::CommandPool commandPool, vk::Queue queue, vk::Buffer buffer, vk::Image image, uint32_t width, uint32_t height);
/third_party/python/Lib/multiprocessing/
H A Dqueues.py10 __all__ = ['Queue', 'SimpleQueue', 'JoinableQueue']
32 # Queue type using a pipe, buffer and thread
35 class Queue(object): class
55 register_after_fork(self, Queue._after_fork)
68 debug('Queue._after_fork()')
88 raise ValueError(f"Queue {self!r} is closed")
100 raise ValueError(f"Queue {self!r} is closed")
148 debug('Queue.join_thread()')
149 assert self._closed, "Queue {0!r} not closed".format(self)
154 debug('Queue
[all...]

Completed in 16 milliseconds

12345678