| /third_party/ffmpeg/libavfilter/dnn/ |
| D | queue.h | 25 typedef struct Queue Queue; typedef
27 Queue *ff_queue_create(void);
28 void ff_queue_destroy(Queue *q);
30 size_t ff_queue_size(Queue *q);
32 void *ff_queue_peek_front(Queue *q);
33 void *ff_queue_peek_back(Queue *q);
35 int ff_queue_push_front(Queue *q, void *v);
36 int ff_queue_push_back(Queue *q, void *v);
38 void *ff_queue_pop_front(Queue *q);
39 void *ff_queue_pop_back(Queue *q);
|
| D | queue.c | 34 struct Queue { struct
48 Queue* ff_queue_create(void) in ff_queue_create() argument
50 Queue *q = av_malloc(sizeof(*q)); in ff_queue_create()
73 void ff_queue_destroy(Queue *q) in ff_queue_destroy()
89 size_t ff_queue_size(Queue *q) in ff_queue_size()
94 void *ff_queue_peek_front(Queue *q) in ff_queue_peek_front()
102 void *ff_queue_peek_back(Queue *q) in ff_queue_peek_back()
110 int ff_queue_push_front(Queue *q, void *v) in ff_queue_push_front()
131 int ff_queue_push_back(Queue *q, void *v) in ff_queue_push_back()
152 void *ff_queue_pop_front(Queue *q) in ff_queue_pop_front()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | LatencyPriorityQueue.cpp | 84 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, SU); in remove()
137 assert(I != Queue.end() && "Queue doesn't contain the SU being removed!"); in remove()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MCA/HardwareUnits/ |
| D | RetireControlUnit.cpp | 37 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[TokenID].IR.getInstruction() && "Instruction was not dispatched!"); in onInstructionExecuted()
[all …]
|
| /third_party/googletest/googletest/samples/ |
| D | sample3-inl.h | 41 class Queue; variable
47 friend class Queue<E>; variable
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&);
|
| 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_;
|
| /third_party/skia/third_party/externals/dawn/src/dawn_native/vulkan/ |
| D | QueueVk.cpp | 31 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()
|
| D | QueueVk.h | 24 class Queue final : public QueueBase {
26 static Queue* Create(Device* device);
29 Queue(Device* device);
30 ~Queue() override;
|
| /third_party/python/Lib/test/test_asyncio/ |
| D | test_queues.py | 38 q = asyncio.Queue()
44 q = asyncio.Queue()
56 q = asyncio.Queue(maxsize=1)
67 q = asyncio.Queue()
78 q = asyncio.Queue()
86 q = asyncio.Queue()
89 q = asyncio.Queue(maxsize=1)
94 q = asyncio.Queue()
112 q = asyncio.Queue(maxsize=2)
146 q = asyncio.Queue()
[all …]
|
| /third_party/rust/crates/bindgen/bindgen/ir/ |
| D | traversal.rs | 374 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>
429 Queue: TraversalQueue,
445 impl<'ctx, Storage, Queue> Iterator for ItemTraversal<'ctx, Storage, Queue>
[all …]
|
| /third_party/skia/third_party/externals/dawn/src/dawn_wire/client/ |
| D | Queue.cpp | 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/ |
| D | VkQueue.cpp | 34 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::taskLoop(marl::Scheduler *scheduler) in taskLoop()
297 VkResult Queue::waitIdle() in waitIdle()
314 void Queue::garbageCollect() in garbageCollect()
325 VkResult Queue::present(const VkPresentInfoKHR *presentInfo) in present()
[all …]
|
| D | VkQueue.hpp | 40 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/ |
| D | pool.py | 7 from multiprocessing import Process, Queue
16 from Queue import Empty # Python 2
26 global Queue
28 del Queue
31 from queue import Queue # Python 3
33 from Queue import Queue # Python 2
37 Queue.cancel_join_thread = lambda self: None
144 self.work_queue = Queue()
145 self.done_queue = Queue()
|
| /third_party/python/Lib/multiprocessing/dummy/ |
| D | connection.py | 12 from queue import Queue
21 self._backlog_queue = Queue(backlog)
41 _in, _out = Queue(), Queue()
47 a, b = Queue(), Queue()
|
| /third_party/python/Doc/library/ |
| D | queue.rst | 13 exchanged safely between multiple threads. The :class:`Queue` class in this
35 .. class:: Queue(maxsize=0)
84 Exception raised when non-blocking :meth:`~Queue.get` (or
85 :meth:`~Queue.get_nowait`) is called
86 on a :class:`Queue` object which is empty.
91 Exception raised when non-blocking :meth:`~Queue.put` (or
92 :meth:`~Queue.put_nowait`) is called
93 on a :class:`Queue` object which is full.
98 Queue Objects
101 Queue objects (:class:`Queue`, :class:`LifoQueue`, or :class:`PriorityQueue`)
[all …]
|
| D | asyncio-queue.rst | 23 Queue chapter
26 .. class:: Queue(maxsize=0)
96 Used by queue consumers. For each :meth:`~Queue.get` used to
102 call was received for every item that had been :meth:`~Queue.put`
116 Priority Queue
121 A variant of :class:`Queue`; retrieves entries in priority order
128 LIFO Queue
133 A variant of :class:`Queue` that retrieves most recently added
142 This exception is raised when the :meth:`~Queue.get_nowait` method
148 Exception raised when the :meth:`~Queue.put_nowait` method is called
[all …]
|
| /third_party/skia/third_party/externals/dawn/src/dawn_native/opengl/ |
| D | QueueGL.cpp | 26 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/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | ResourcePriorityQueue.cpp | 234 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.empty() && "Queue is empty!"); in remove()
620 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
621 if (I != std::prev(Queue.end())) in remove()
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| D | cordz_handle.h | 84 struct Queue { struct
85 constexpr explicit Queue(absl::ConstInitType) in Queue() argument
111 ABSL_CONST_INIT static Queue global_queue_; argument
112 Queue* const queue_ = &global_queue_;
|
| /third_party/python/Lib/multiprocessing/ |
| D | queues.py | 35 class Queue(object): class
55 register_after_fork(self, Queue._after_fork)
170 target=Queue._feed,
184 self._thread, Queue._finalize_join,
191 self, Queue._finalize_close,
295 class JoinableQueue(Queue):
298 Queue.__init__(self, maxsize, ctx=ctx)
303 return Queue.__getstate__(self) + (self._cond, self._unfinished_tasks)
306 Queue.__setstate__(self, state[:-2])
|
| /third_party/node/doc/contributing/ |
| D | commit-queue.md | 7 Commit Queue is an experimental feature for the project which simplifies the
13 This document gives an overview of how the Commit Queue works, as well as
18 From a high-level, the Commit Queue works as follow:
40 To make the Commit Queue squash all the commits of a pull request into the
42 To make the Commit Queue land a pull request containing several commits, add the
48 The Commit Queue feature is still in early stages, and as such it might not
70 1. if two Commit Queue Actions execution overlap, there's a high-risk that
120 Queue to work because the Action lands PRs just like collaborators do today. If
121 once we start using the Commit Queue we notice that the number of required
122 reverts increases drastically, we can pause the queue until a Revert Queue is
[all …]
|
| /third_party/skia/third_party/externals/dawn/src/dawn_native/d3d12/ |
| D | QueueD3D12.cpp | 29 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/ |
| D | MachineScheduler.h | 530 std::vector<SUnit*> Queue; variable
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.back(); in remove()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/tests/VulkanWrapper/ |
| D | Util.hpp | 29 void endSingleTimeCommands(vk::Device device, vk::CommandPool commandPool, vk::Queue queue, vk::Com…
31 void transitionImageLayout(vk::Device device, vk::CommandPool commandPool, vk::Queue queue, vk::Ima…
33 void copyBufferToImage(vk::Device device, vk::CommandPool commandPool, vk::Queue queue, vk::Buffer …
|