Home
last modified time | relevance | path

Searched refs:queue_ (Results 1 – 4 of 4) sorted by relevance

/system/bt/osi/include/
Dleaky_bonded_queue.h83 std::queue<std::unique_ptr<T>> queue_;
103 if ((queue_.size() + 1) > capacity_) { in Enqueue()
104 queue_.pop(); in Enqueue()
107 queue_.push(std::move(item_ptr)); in Enqueue()
114 if ((queue_.size() + 1) > capacity_) { in EnqueueWithPop()
115 std::unique_ptr<T> item = std::move(queue_.front()); in EnqueueWithPop()
116 queue_.pop(); in EnqueueWithPop()
120 queue_.push(std::move(item_ptr)); in EnqueueWithPop()
127 std::unique_ptr<T> item = std::move(queue_.front()); in Dequeue()
128 queue_.pop(); in Dequeue()
[all …]
/system/core/adb/
Dfdevent_test.cpp52 handler->queue_.push(c); in FdEventCallback()
57 ASSERT_FALSE(handler->queue_.empty()); in FdEventCallback()
58 char c = handler->queue_.front(); in FdEventCallback()
59 handler->queue_.pop(); in FdEventCallback()
61 if (handler->queue_.empty()) { in FdEventCallback()
72 std::queue<char> queue_; member in FdHandler
/system/extras/simpleperf/
Drecord.cpp1264 queue_(RecordComparator()) {} in RecordCache()
1272 queue_.push(RecordWithSeq(cur_seq_++, record.release())); in Push()
1282 if (queue_.size() < min_cache_size_) { in Pop()
1285 Record* r = queue_.top().record; in Pop()
1291 queue_.pop(); in Pop()
1297 while (!queue_.empty()) { in PopAll()
1298 result.emplace_back(queue_.top().record); in PopAll()
1299 queue_.pop(); in PopAll()
1305 if (queue_.empty()) { in ForcedPop()
1308 Record* r = queue_.top().record; in ForcedPop()
[all …]
Drecord.h617 RecordComparator> queue_; variable