Home
last modified time | relevance | path

Searched refs:CircularQueue (Results 1 – 3 of 3) sorted by relevance

/external/perfetto/include/perfetto/base/
Dcircular_queue.h49 class CircularQueue {
59 Iterator(CircularQueue* queue, uint64_t pos, uint32_t generation) in Iterator()
162 CircularQueue* queue_;
170 CircularQueue(size_t initial_capacity = 1024) { Grow(initial_capacity); }
172 CircularQueue(CircularQueue&& other) noexcept { in CircularQueue() function
176 new (&other) CircularQueue(); // Reset the old queue so it's still usable. in CircularQueue()
179 CircularQueue& operator=(CircularQueue&& other) {
180 this->~CircularQueue(); // Destroy the current state.
181 new (this) CircularQueue(std::move(other)); // Use the move ctor above.
185 ~CircularQueue() { in ~CircularQueue()
[all …]
/external/perfetto/src/base/
Dcircular_queue_unittest.cc28 CircularQueue<int> queue(/*initial_capacity=*/1); in TEST()
92 CircularQueue<uint64_t> queue; in TEST()
105 CircularQueue<int> queue; in TEST()
110 CircularQueue<int> moved(std::move(queue)); in TEST()
126 CircularQueue<int> moved; in TEST()
140 CircularQueue<size_t> queue(capacity); in TEST()
222 CircularQueue<Checker> queue(/*initial_capacity=*/2); in TEST()
241 CircularQueue<Checker> queue(/*initial_capacity=*/1); in TEST()
261 CircularQueue<Checker> q1(1); in TEST()
262 CircularQueue<Checker> q2(64); in TEST()
/external/perfetto/src/trace_processor/
Dtrace_sorter.h261 base::CircularQueue<TimestampedTracePiece> events_;