| /system/chre/util/include/chre/util/ |
| D | priority_queue.h | 29 * An implementation of a priority queue. This allows for efficient lookup of
50 * Returns the current number of elements in the queue.
52 * @return The number of elements in the queue.
57 * Returns the maximum number of elements that can be stored in this queue
60 * @return The capacity of the queue.
65 * Determines whether the queue is empty or not.
67 * @return true if the queue is empty.
72 * Pushes an element onto the queue. If the queue requires a resize and that
76 * @param element The element to push onto the queue.
82 * Constructs an element onto the the queue. All iterators and references are
[all …]
|
| D | array_queue.h | 29 * ArrayQueue is a templated fixed-size FIFO queue implemented around a
42 * underlying storage, which is attached to the array queue implementation in
59 * The core implementation of an array queue, from which the public interfaces
72 * Calls the destructor of all the elements in the array queue.
79 * @return true if the array queue is empty.
84 * @return true if the array queue is full.
89 * @return The number of elements currently stored in the array queue.
94 * Obtains the front element of the array queue. It is illegal to access the
95 * front element when the array queue is empty. The user of the API must check
105 * Obtains the last element in the queue. Illegal to call when empty() is
[all …]
|
| D | segmented_queue.h | 49 * Construct a new Segmented Queue object.
51 * @param maxBlockCount: The maximum number of block that this queue can hold.
61 * @return size_t: Number of elements that this segmented queue holds.
68 * @return size_t: How many blocks does this segmented queue contains.
75 * @return size_t: Number of items that this queue can store without pushing
83 * @return true: Return true if the segmented queue cannot accept new element.
90 * @return true: Return true if this segmented queue does not have any element
98 * Push a element to the end of the segmented queue.
100 * @param element: The element that will be push to the back of the queue.
101 * @return false: Return false if the queue is full.
[all …]
|
| /system/chre/util/include/chre/util/system/ |
| D | fixed_size_blocking_queue.h | 33 * The wrapper around queue storage (ArraryQueue or SegmentedQueue) that
36 * The queue storage must provide the following APIs:
56 * Pushes an element into the queue and notifies any waiting threads that an
66 * Pops one element from the queue. If the queue is empty, the thread will
74 * Removes an element from the array queue given an index. It returns false if
75 * the index is out of bounds of the underlying array queue.
83 * Obtains an element of the array queue given an index. It is illegal to
84 * index this array queue out of bounds and the user of the API must check
85 * the size() function prior to indexing this array queue to ensure that they
101 //! queue.
[all …]
|
| D | atomic_spsc_queue.h | 33 * AtomicSpscArrayQueue is a templated fixed-size FIFO queue implemented around
36 * queue while a different thread of execution can can pull from the queue,
49 * mechanism to ensure the queue is fully emptied before proceeding (though
64 // times before things are reset (when the queue is emptied).
70 * Destroying the queue must only be done when it is guaranteed that the
86 * Checks whether the queue has not been fully emptied in a long time, and
88 * loss if it occurs (consumer sees queue as empty when it actually isn't,
91 * stop adding new data to the queue until after the queue has been fully
101 * Gets a snapshot of the number of elements currently stored in the queue.
112 // tail < head, and we can safely assume the queue is empty. in size()
[all …]
|
| /system/cros-codecs/src/device/v4l2/stateless/ |
| D | queue.rs | 13 use v4l2r::device::queue::direction;
14 use v4l2r::device::queue::direction::Capture;
15 use v4l2r::device::queue::direction::Output;
16 use v4l2r::device::queue::dqbuf::DqBuffer;
17 use v4l2r::device::queue::qbuf::QBuffer;
18 use v4l2r::device::queue::BuffersAllocated;
19 use v4l2r::device::queue::CaptureQueueable;
20 use v4l2r::device::queue::CreateQueueError;
21 use v4l2r::device::queue::GetFreeBufferError;
22 use v4l2r::device::queue::GetFreeCaptureBuffer;
[all …]
|
| /system/cros-codecs/src/ |
| D | decoder.rs | 141 /// A queue where decoding jobs wait until they are completed, at which point they can be
144 /// Queue of all the frames waiting to be sent to the client.
145 queue: VecDeque<T>, field
147 /// EventFd signaling `EPOLLIN` whenever the queue is not empty.
159 Ok(Self { queue: Default::default(), poll_fd }) in new()
162 /// Push `handle` to the back of the queue.
164 self.queue.push_back(handle); in push()
166 log::error!("failed to write ready frames queue poll FD: {:#}", e); in push()
171 /// queue.
179 let len_before = self.queue.len(); in extend()
[all …]
|
| /system/libfmq/fuzzer/ |
| D | fmq_fuzzer.cpp | 119 template <typename Queue, typename Desc>
121 Queue readMq(desc); in reader()
129 typename Queue::MemTransaction tx; in reader()
152 template <typename Queue, typename Desc>
157 Queue readMq(desc); in readerBlocking()
183 template <typename Queue, typename Desc>
184 void writer(const Desc& desc, Queue& writeMq, FuzzedDataProvider& fdp, bool userFd) { in writer()
187 typename Queue::MemTransaction tx; in writer()
212 template <typename Queue>
213 void writerBlocking(Queue& writeMq, FuzzedDataProvider& fdp, in writerBlocking()
[all …]
|
| /system/libfmq/benchmarks/ |
| D | msgq_benchmark_client.cpp | 81 * Request service to configure the client inbox queue. in SetUp()
92 * Reqeust service to configure the client outbox queue. in SetUp()
111 * Client writes a 64 byte packet into the outbox queue, service reads the
113 * writes the packet into the client's inbox queue. Client reads the packet. The
150 * Measure the average time taken to read 64 bytes from the queue.
165 * were succesfully read from the queue. in TEST_F()
200 * were succesfully read from the queue. in TEST_F()
217 * Measure the average time taken to read 256 bytes from the queue.
232 * were succesfully read from the queue. in TEST_F()
250 * Measure the average time taken to read 512 bytes from the queue.
[all …]
|
| /system/chre/core/include/chre/core/ |
| D | event_ref_queue.h | 35 * @return true if there are no events in the queue
42 * Adds an event to the queue, and increments its reference counter
50 * Removes the oldest event from the queue, and decrements its reference
52 * reaches 0 as a result of this function call. The queue must be non-empty as
55 * @return Pointer to the next event in the queue
63 //! The queue of incoming events.
|
| /system/core/fs_mgr/libsnapshot/snapuserd/testing/ |
| D | host_harness.cpp | 36 TestBlockServer::TestBlockServer(std::shared_ptr<TestBlockServerQueue> queue, in TestBlockServer() argument
38 : queue_(queue), misc_name_(misc_name) {} in TestBlockServer()
59 TestBlockServerOpener::TestBlockServerOpener(std::shared_ptr<TestBlockServerQueue> queue, in TestBlockServerOpener() argument
61 : queue_(queue), misc_name_(misc_name) {} in TestBlockServerOpener()
73 auto queue = std::make_shared<TestBlockServerQueue>(); in CreateTestOpener() local
74 queues_.emplace(misc_name, queue); in CreateTestOpener()
75 return std::make_shared<TestBlockServerOpener>(queue, misc_name); in CreateTestOpener()
86 LOG(ERROR) << "Cannot delete queue " << misc_name << ", not found"; in DeleteQueue()
|
| /system/cros-codecs/src/encoder/ |
| D | stateful.rs | 91 /// Pending queue of frames to encoded by the backend
92 queue: VecDeque<BackendRequest<Handle>>, field
100 /// Processed encoded bitstream queue for client to poll
119 queue: Default::default(), in create()
128 /// Handles the [`BackendOutput`] from the backend, ie add to the queue for client to poll.
160 self.queue.len(), in process()
169 while let Some(request) = self.queue.pop_front() { in process()
179 self.queue.push_front(request); in process()
213 self.queue.push_back(request); in encode()
220 if !self.queue.is_empty() || !self.processing.is_empty() { in poll()
[all …]
|
| /system/chre/chpp/test/ |
| D | fake_link.h | 35 * Wrapper for a fake CHPP link layer which puts outgoing packets on a queue
51 * appends it to the TX packet queue.
60 * Wait up to the provided timeout for a packet to hit the TX queue, or return
68 * Similar to waitForTxPacket, but the inverse (waits until the queue is
73 //! Pop and return the oldest packet on the TX queue, or assert if queue is
77 //! Empties the TX packet queue
|
| /system/cros-codecs/src/backend/v4l2/ |
| D | encoder.rs | 25 use v4l2r::device::queue::direction::Capture;
26 use v4l2r::device::queue::direction::Output;
27 use v4l2r::device::queue::dqbuf::DqBuffer;
28 use v4l2r::device::queue::qbuf::QBuffer;
29 use v4l2r::device::queue::BuffersAllocated;
30 use v4l2r::device::queue::CreateQueueError;
31 use v4l2r::device::queue::GetFreeBufferError;
32 use v4l2r::device::queue::GetFreeCaptureBuffer;
33 use v4l2r::device::queue::GetFreeOutputBuffer;
34 use v4l2r::device::queue::OutputQueueable;
[all …]
|
| /system/core/storaged/ |
| D | storaged_diskstats.cpp | 44 << " q: " << perf->queue; in log_debug_disk_perf()
170 perf.queue = (stats->io_in_queue + (stats->io_ticks >> 1)) / in get_disk_perf()
218 mMean.queue = (uint32_t)mStats.queue.get_mean(); in update_mean()
228 mStd.queue = (uint32_t)mStats.queue.get_std(); in update_std()
237 mStats.queue.add(perf->queue); in add()
245 mStats.queue.evict(perf->queue); in evict()
250 return ((double)perf->queue >= (double)mMean.queue + mSigma * (double)mStd.queue) && in detect()
|
| /system/libhidl/base/ |
| D | SynchronizedQueue.h | 22 #include <queue>
28 /* Threadsafe queue.
34 /* Gets an item from the front of the queue.
40 /* Puts an item onto the end of the queue.
62 std::queue<T> mQueue;
|
| /system/extras/simpleperf/ |
| D | callchain.h | 25 #include <queue>
89 std::queue<std::vector<std::unique_ptr<NodeT>>*> queue; in SortByPeriod() local
90 queue.push(&children); in SortByPeriod()
91 while (!queue.empty()) { in SortByPeriod()
92 std::vector<std::unique_ptr<NodeT>>* v = queue.front(); in SortByPeriod()
93 queue.pop(); in SortByPeriod()
97 queue.push(&node->children); in SortByPeriod()
|
| /system/libfmq/tests/ |
| D | msgq_test_client.cpp | 237 AidlMessageQueueUnsync** queue) { in getFmqUnsyncWrite() argument
241 *queue = new (std::nothrow) AidlMessageQueueUnsync(desc, false); in getFmqUnsyncWrite()
290 cppAidlMessageQueueUnsync** queue) { in getFmqUnsyncWrite() argument
294 *queue = new (std::nothrow) cppAidlMessageQueueUnsync(desc, false); in getFmqUnsyncWrite()
345 MessageQueueUnsync** queue) { in getFmqUnsyncWrite() argument
350 [queue](bool ret, const MQDescriptorUnsync<int32_t>& in) { in getFmqUnsyncWrite()
352 *queue = new (std::nothrow) MessageQueueUnsync(in, false); in getFmqUnsyncWrite()
402 // create a queue on the client side in SetUp()
410 // tell server to set up the queue on its end in SetUp()
436 * Utility function to verify data read from the fast message queue.
[all …]
|
| D | fmq_unit_tests.cpp | 214 * Initialize the EventFlag word to indicate Queue is not full. in SetUp()
250 * Initialize the EventFlag word to indicate Queue is not full. in SetUp()
506 // Other process will create the other side of the queue using the AIDL MQDescriptor in TEST_F()
538 // Other process will create the other side of the queue using the AIDL MQDescriptor in TEST_F()
612 // 1/2 the queue size of HIDL. Once support is added to AIDL, this restriction can be
647 * Test creating a new queue from a modified MQDescriptor of another queue.
648 * If MQDescriptor.quantum doesn't match the size of the payload(T), the queue
659 // Simulate a difference in payload size between processes handling the queue in TEST_F()
668 * Test creating a new queue with an invalid fd. This should assert with message
673 auto queue = AidlMessageQueueSync(64, false, android::base::unique_fd(3000), 64); in TEST_F() local
[all …]
|
| /system/core/storaged/include/ |
| D | storaged_diskstats.h | 39 uint64_t read_merges; // number of read I/Os merged with in-queue I/Os
43 uint64_t write_merges; // number of write I/Os merged with in-queue I/Os
110 uint32_t queue; // I/Os in queue member
113 write_perf == 0 && write_ios == 0 && queue == 0; in is_zero()
152 std::queue<struct disk_perf> mBuffer;
158 stream_stats queue; // I/Os in queue member
|
| /system/chre/platform/linux/include/chre/platform/linux/ |
| D | platform_log.h | 22 #include <queue>
67 //! A mutex to guard the shared queue and exit condition of this class.
74 //! A queue of incoming log messages.
75 std::queue<char *> mLogQueue;
|
| /system/security/keystore2/src/async_task/ |
| D | tests.rs | 77 // First queue up a job that blocks until we release it, to avoid in test_async_task()
86 // Queue up some high-priority and low-priority jobs. in test_async_task()
100 // Finally queue up a low priority job that emits the trace. in test_async_task()
118 // Queue up a job that will queue up another job. This confirms in test_async_task_chain()
136 // Queue another job afterwards to ensure that the async thread gets joined. in test_async_task_panic()
153 // Queue up some high-priority and low-priority jobs that take time. in test_async_task_idle()
204 // Queue a high priority job to start things off in test_async_task_multiple_idle()
254 // Once we queue a normal job, things start. in test_async_task_idle_queues_job()
276 // Queue a job to trigger idleness and ensuing panic. in test_async_task_idle_panic()
280 // Queue another job afterwards to ensure that the async thread gets joined in test_async_task_idle_panic()
|
| /system/chre/platform/linux/include/chre/platform/linux/task_util/ |
| D | task_manager.h | 53 * Adds a task to the queue for execution. The manager calls the function func
81 * Empties the task queue without execution. This call is blocking.
98 * The queue of tasks.
128 * The mutex to protect access to the queue.
134 * tasks (the queue is not empty).
|
| /system/chre/platform/slpi/include/chre/target_platform/ |
| D | host_link_base.h | 39 * in the outbound queue, or a timeout occurs. For proper function, it should
40 * not be possible for new messages to be added to the queue at the point when
43 * @return true if the outbound queue was successfully emptied
79 * Attempts to flush the outbound queue and gracefully inform the host that we
|
| /system/cros-codecs/src/encoder/stateless/ |
| D | predictor.rs | 20 pub(super) queue: VecDeque<(Picture, FrameMetadata)>, field
101 log::trace!("Pending frames in the queue: {}", self.queue.len()); in next_request()
104 while let Some((input, meta)) = self.queue.pop_front() { in next_request()
121 self.queue.push_front((input, meta)); in next_request()
148 log::trace!("New frame added to queue timestamp={}", frame_metadata.timestamp); in new_frame()
149 // Add new frame in the request queue and request new encoding if possible in new_frame()
150 self.queue.push_back((input, frame_metadata)); in new_frame()
184 let when_counter = self.counter + self.queue.len(); in tune()
257 queue: Default::default(), in test_tuning_delay()
314 queue: Default::default(), in test_keyframes()
|