Home
last modified time | relevance | path

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

123456

/external/cronet/net/third_party/quiche/src/quiche/quic/core/
Dpacket_number_indexed_queue_test.cc22 PacketNumberIndexedQueue<std::string> queue_; member in quic::test::__anon60b5f7020111::PacketNumberIndexedQueueTest
26 EXPECT_TRUE(queue_.IsEmpty()); in TEST_F()
27 EXPECT_FALSE(queue_.first_packet().IsInitialized()); in TEST_F()
28 EXPECT_FALSE(queue_.last_packet().IsInitialized()); in TEST_F()
29 EXPECT_EQ(0u, queue_.number_of_present_entries()); in TEST_F()
30 EXPECT_EQ(0u, queue_.entry_slots_used()); in TEST_F()
34 ASSERT_TRUE(queue_.Emplace(QuicPacketNumber(1001), "one")); in TEST_F()
35 EXPECT_EQ("one", *queue_.GetEntry(QuicPacketNumber(1001))); in TEST_F()
37 ASSERT_TRUE(queue_.Emplace(QuicPacketNumber(1002), "two")); in TEST_F()
38 EXPECT_EQ("two", *queue_.GetEntry(QuicPacketNumber(1002))); in TEST_F()
[all …]
Dquic_datagram_queue_test.cc86 QuicDatagramQueueTest() : queue_(&session_) {} in QuicDatagramQueueTest()
89 QuicDatagramQueue queue_; member in quic::test::__anon1237e7140111::QuicDatagramQueueTest
95 MessageStatus status = queue_.SendOrQueueDatagram(CreateMemSlice("test")); in TEST_F()
97 EXPECT_EQ(0u, queue_.queue_size()); in TEST_F()
104 queue_.SendOrQueueDatagram(CreateMemSlice("test")); in TEST_F()
106 EXPECT_EQ(1u, queue_.queue_size()); in TEST_F()
111 absl::optional<MessageStatus> status = queue_.TrySendingNextDatagram(); in TEST_F()
114 EXPECT_EQ(1u, queue_.queue_size()); in TEST_F()
118 status = queue_.TrySendingNextDatagram(); in TEST_F()
121 EXPECT_EQ(0u, queue_.queue_size()); in TEST_F()
[all …]
Dquic_datagram_queue.cc33 if (queue_.empty()) { in SendOrQueueDatagram()
44 queue_.emplace_back(Datagram{std::move(datagram), in SendOrQueueDatagram()
51 if (queue_.empty()) { in TrySendingNextDatagram()
56 session_->SendMessage(absl::MakeSpan(&queue_.front().datagram, 1)); in TrySendingNextDatagram()
58 queue_.pop_front(); in TrySendingNextDatagram()
94 while (!queue_.empty() && queue_.front().expiry <= now) { in RemoveExpiredDatagrams()
95 queue_.pop_front(); in RemoveExpiredDatagrams()
/external/cronet/net/base/
Dpriority_queue_unittest.cc55 PriorityQueueTest() : queue_(kNumPriorities) {} in PriorityQueueTest()
60 EXPECT_EQ(i, queue_.size()); in SetUp()
62 queue_.Insert(static_cast<int>(i), kPriorities[GetParam()][i]); in SetUp()
63 EXPECT_FALSE(queue_.empty()); in SetUp()
65 EXPECT_EQ(kNumElements, queue_.size()); in SetUp()
69 EXPECT_TRUE(queue_.empty()); in CheckEmpty()
70 EXPECT_EQ(0u, queue_.size()); in CheckEmpty()
71 EXPECT_TRUE(queue_.FirstMin().is_null()); in CheckEmpty()
72 EXPECT_TRUE(queue_.LastMin().is_null()); in CheckEmpty()
73 EXPECT_TRUE(queue_.FirstMax().is_null()); in CheckEmpty()
[all …]
Dprioritized_dispatcher.cc22 : queue_(limits.reserved_slots.size()), in PrioritizedDispatcher()
38 return queue_.Insert(job, priority); in Add()
50 return queue_.InsertAtFront(job, priority); in AddAtHead()
54 queue_.Erase(handle); in Cancel()
58 Handle handle = queue_.FirstMin(); in EvictOldestLowest()
79 queue_.Erase(handle); in ChangePriority()
80 return queue_.Insert(job, priority); in ChangePriority()
103 DCHECK_EQ(queue_.num_priorities(), limits.reserved_slots.size()); in SetLimits()
124 SetLimits(Limits(queue_.num_priorities(), 0)); in SetLimitsToZero()
133 queue_.Erase(handle); in MaybeDispatchJob()
[all …]
/external/libchrome/base/message_loop/
Dincoming_task_queue.cc100 DCHECK(!queue_.empty()); in Peek()
101 return queue_.front(); in Peek()
107 DCHECK(!queue_.empty()); in Pop()
108 PendingTask pending_task = std::move(queue_.front()); in Pop()
109 queue_.pop(); in Pop()
116 return !queue_.empty(); in HasTasks()
155 if (queue_.empty()) { in ReloadFromIncomingQueueIfEmpty()
156 outer_->ReloadWorkQueue(&queue_); in ReloadFromIncomingQueueIfEmpty()
172 queue_.push(std::move(pending_task)); in Push()
177 DCHECK(!queue_.empty()); in Peek()
[all …]
/external/webrtc/rtc_base/
Dswap_queue.h85 explicit SwapQueue(size_t size) : queue_(size) { in SwapQueue()
91 : queue_item_verifier_(queue_item_verifier), queue_(size) { in SwapQueue()
96 SwapQueue(size_t size, const T& prototype) : queue_(size, prototype) { in SwapQueue()
104 : queue_item_verifier_(queue_item_verifier), queue_(size, prototype) { in SwapQueue()
117 if (next_read_index_ >= queue_.size()) { in Clear()
118 next_read_index_ -= queue_.size(); in Clear()
121 RTC_DCHECK_LT(next_read_index_, queue_.size()); in Clear()
140 queue_.size()) { in Insert()
145 swap(*input, queue_[next_write_index_]); in Insert()
155 if (next_write_index_ == queue_.size()) { in Insert()
[all …]
Dbuffer_queue.cc25 for (Buffer* buffer : queue_) in ~BufferQueue()
33 return queue_.size(); in size()
38 while (!queue_.empty()) { in Clear()
39 free_list_.push_back(queue_.front()); in Clear()
40 queue_.pop_front(); in Clear()
46 if (queue_.empty()) in ReadFront()
49 Buffer* packet = queue_.front(); in ReadFront()
50 queue_.pop_front(); in ReadFront()
66 if (queue_.size() == capacity_) in WriteBack()
81 queue_.push_back(packet); in WriteBack()
/external/libchrome/base/task_scheduler/
Dsequence.cc26 queue_.push(std::move(task)); in PushTask()
29 return queue_.size() == 1; in PushTask()
34 DCHECK(!queue_.empty()); in TakeTask()
35 DCHECK(queue_.front().task); in TakeTask()
37 const int priority_index = static_cast<int>(queue_.front().traits.priority()); in TakeTask()
41 return std::move(queue_.front()); in TakeTask()
46 DCHECK(!queue_.empty()); in Pop()
47 DCHECK(!queue_.front().task); in Pop()
48 queue_.pop(); in Pop()
49 return queue_.empty(); in Pop()
[all …]
/external/zstd/contrib/pzstd/utils/
DWorkQueue.h33 std::queue<T> queue_; variable
42 return queue_.size() >= maxSize_; in full()
72 queue_.push(std::move(item)); in push()
90 while (queue_.empty() && !done_) { in pop()
93 if (queue_.empty()) { in pop()
97 item = std::move(queue_.front()); in pop()
98 queue_.pop(); in pop()
143 WorkQueue<Buffer> queue_; variable
147 BufferWorkQueue(std::size_t maxSize = 0) : queue_(maxSize), size_(0) {} in queue_() function
151 queue_.push(std::move(buffer)); in push()
[all …]
/external/webrtc/test/pc/e2e/analyzer/video/
Dmulti_reader_queue.h55 for (size_t i = pos; i < queue_.size(); ++i) { in AddReader()
68 for (size_t i = 0; i < queue_.size(); ++i) { in AddReader()
77 for (size_t i = pos; i < queue_.size(); ++i) { in RemoveReader()
88 queue_.push_back(value); in PushBack()
95 if (pos >= queue_.size()) { in PopFront()
99 T out = queue_[pos]; in PopFront()
114 if (pos >= queue_.size()) { in Front()
117 return queue_[pos]; in Front()
124 return pos >= queue_.size(); in IsEmpty()
129 size_t size() const { return queue_.size(); } in size()
[all …]
/external/cronet/net/third_party/quiche/src/quiche/quic/test_tools/simulator/
Dqueue.cc44 queue_.emplace_back(std::move(packet), current_bundle_); in AcceptPacket()
47 current_bundle_bytes_ += queue_.front().packet->size; in AcceptPacket()
60 QUICHE_DCHECK(!queue_.empty()); in Act()
62 QUICHE_DCHECK(bytes_queued_ >= queue_.front().packet->size); in Act()
63 bytes_queued_ -= queue_.front().packet->size; in Act()
65 tx_port_->AcceptPacket(std::move(queue_.front().packet)); in Act()
66 queue_.pop_front(); in Act()
87 : queue_(queue) {} in AggregationAlarmDelegate()
90 queue_->NextBundle(); in OnAlarm()
91 queue_->ScheduleNextPacketDequeue(); in OnAlarm()
[all …]
/external/libchrome-gestures/src/
Dlookahead_filter_interpreter.cc49 auto const queue_was_not_empty = !queue_.empty(); in SyncInterpretImpl()
50 QState* old_back_node = queue_was_not_empty ? &queue_.back() : nullptr; in SyncInterpretImpl()
52 auto& new_node = queue_.emplace_back(hwprops_->max_finger_cnt); in SyncInterpretImpl()
64 auto q_node_iter = queue_.begin(); in SyncInterpretImpl()
69 queue_.pop_front(); in SyncInterpretImpl()
70 } while (queue_.size() > 1); in SyncInterpretImpl()
82 QState& q_node = queue_.front(); in SyncInterpretImpl()
133 if (queue_.size() < 2) { in AssignTrackingIds()
136 if (queue_.size() == 1) { in AssignTrackingIds()
137 QState& tail = queue_.back(); in AssignTrackingIds()
[all …]
/external/libchrome/base/threading/
Dthread_collision_warner_unittest.cc152 explicit QueueUser(NonThreadSafeQueue* queue) : queue_(queue) {} in TEST()
155 queue_->push(0); in TEST()
156 queue_->pop(); in TEST()
160 NonThreadSafeQueue* queue_; in TEST() member in TEST::QueueUser
209 explicit QueueUser(NonThreadSafeQueue* queue) : queue_(queue) {} in TEST()
212 queue_->push(0); in TEST()
213 queue_->pop(); in TEST()
217 NonThreadSafeQueue* queue_; in TEST() member in TEST::QueueUser
269 : queue_(queue), lock_(lock) {} in TEST()
274 queue_->push(0); in TEST()
[all …]
/external/cronet/base/threading/
Dthread_collision_warner_unittest.cc149 explicit QueueUser(NonThreadSafeQueue* queue) : queue_(queue) {} in TEST()
152 queue_->push(0); in TEST()
153 queue_->pop(); in TEST()
157 raw_ptr<NonThreadSafeQueue> queue_; in TEST() member in TEST::QueueUser
207 explicit QueueUser(NonThreadSafeQueue* queue) : queue_(queue) {} in TEST()
210 queue_->push(0); in TEST()
211 queue_->pop(); in TEST()
215 raw_ptr<NonThreadSafeQueue> queue_; in TEST() member in TEST::QueueUser
268 : queue_(queue), lock_(lock) {} in TEST()
273 queue_->push(0); in TEST()
[all …]
/external/cronet/net/spdy/
Dspdy_write_queue.cc56 if (!queue_[i].empty()) in IsEmpty()
73 queue_[priority].push_back( in Enqueue()
89 if (!queue_[i].empty()) { in Dequeue()
90 PendingWrite pending_write = std::move(queue_[i].front()); in Dequeue()
91 queue_[i].pop_front(); in Dequeue()
121 for (auto it = queue_[i].begin(); it != queue_[i].end(); ++it) in RemovePendingWritesForStream()
129 base::circular_deque<PendingWrite>& queue = queue_[priority]; in RemovePendingWritesForStream()
157 base::circular_deque<PendingWrite>& queue = queue_[i]; in RemovePendingWritesForStreamsAfter()
191 for (auto it = queue_[i].begin(); it != queue_[i].end(); ++it) in ChangePriorityOfWritesForStream()
196 base::circular_deque<PendingWrite>& old_queue = queue_[old_priority]; in ChangePriorityOfWritesForStream()
[all …]
Dspdy_read_queue.cc22 DCHECK_EQ(queue_.empty(), total_size_ == 0); in IsEmpty()
23 return queue_.empty(); in IsEmpty()
33 queue_.push_back(std::move(buffer)); in Enqueue()
39 while (!queue_.empty() && bytes_copied < len) { in Dequeue()
40 SpdyBuffer* buffer = queue_.front().get(); in Dequeue()
46 queue_.pop_front(); in Dequeue()
55 queue_.clear(); in Clear()
/external/webrtc/video/
Dframe_cadence_adapter.cc193 TaskQueueBase* const queue_; member in webrtc::__anon725a42930111::ZeroHertzAdapterMode
251 const VideoFrame& frame) RTC_RUN_ON(queue_);
258 bool IsZeroHertzScreenshareEnabled() const RTC_RUN_ON(queue_);
261 void MaybeReconfigureAdapters(bool was_zero_hertz_enabled) RTC_RUN_ON(queue_);
264 void MaybeReportFrameRateConstraintUmas() RTC_RUN_ON(queue_);
267 TaskQueueBase* const queue_; member in webrtc::__anon725a42930111::FrameCadenceAdapterImpl
283 RTC_GUARDED_BY(queue_);
290 RTC_GUARDED_BY(queue_);
295 bool has_reported_screenshare_frame_rate_umas_ RTC_GUARDED_BY(queue_) = false;
309 : queue_(queue), clock_(clock), callback_(callback), max_fps_(max_fps) { in ZeroHertzAdapterMode()
[all …]
/external/cronet/third_party/abseil-cpp/absl/strings/internal/
Dcordz_handle.cc31 SpinLockHolder lock(&queue_->mutex); in CordzHandle()
32 CordzHandle* dq_tail = queue_->dq_tail.load(std::memory_order_acquire); in CordzHandle()
37 queue_->dq_tail.store(this, std::memory_order_release); in CordzHandle()
46 SpinLockHolder lock(&queue_->mutex); in ~CordzHandle()
62 queue_->dq_tail.store(dq_prev_, std::memory_order_release); in ~CordzHandle()
72 return is_snapshot_ || queue_->IsEmpty(); in SafeToDelete()
79 Queue* const queue = handle->queue_; in Delete()
111 SpinLockHolder lock(&queue_->mutex); in DiagnosticsHandleIsSafeToInspect()
112 for (const CordzHandle* p = queue_->dq_tail; p; p = p->dq_prev_) { in DiagnosticsHandleIsSafeToInspect()
128 SpinLockHolder lock(&queue_->mutex); in DiagnosticsGetSafeToInspectDeletedHandles()
/external/webrtc/third_party/abseil-cpp/absl/strings/internal/
Dcordz_handle.cc31 SpinLockHolder lock(&queue_->mutex); in CordzHandle()
32 CordzHandle* dq_tail = queue_->dq_tail.load(std::memory_order_acquire); in CordzHandle()
37 queue_->dq_tail.store(this, std::memory_order_release); in CordzHandle()
46 SpinLockHolder lock(&queue_->mutex); in ~CordzHandle()
62 queue_->dq_tail.store(dq_prev_, std::memory_order_release); in ~CordzHandle()
72 return is_snapshot_ || queue_->IsEmpty(); in SafeToDelete()
79 Queue* const queue = handle->queue_; in Delete()
111 SpinLockHolder lock(&queue_->mutex); in DiagnosticsHandleIsSafeToInspect()
112 for (const CordzHandle* p = queue_->dq_tail; p; p = p->dq_prev_) { in DiagnosticsHandleIsSafeToInspect()
128 SpinLockHolder lock(&queue_->mutex); in DiagnosticsGetSafeToInspectDeletedHandles()
/external/abseil-cpp/absl/strings/internal/
Dcordz_handle.cc31 SpinLockHolder lock(&queue_->mutex); in CordzHandle()
32 CordzHandle* dq_tail = queue_->dq_tail.load(std::memory_order_acquire); in CordzHandle()
37 queue_->dq_tail.store(this, std::memory_order_release); in CordzHandle()
46 SpinLockHolder lock(&queue_->mutex); in ~CordzHandle()
62 queue_->dq_tail.store(dq_prev_, std::memory_order_release); in ~CordzHandle()
72 return is_snapshot_ || queue_->IsEmpty(); in SafeToDelete()
79 Queue* const queue = handle->queue_; in Delete()
111 SpinLockHolder lock(&queue_->mutex); in DiagnosticsHandleIsSafeToInspect()
112 for (const CordzHandle* p = queue_->dq_tail; p; p = p->dq_prev_) { in DiagnosticsHandleIsSafeToInspect()
128 SpinLockHolder lock(&queue_->mutex); in DiagnosticsGetSafeToInspectDeletedHandles()
/external/tensorflow/third_party/absl/abseil-cpp/absl/strings/internal/
Dcordz_handle.cc31 SpinLockHolder lock(&queue_->mutex); in CordzHandle()
32 CordzHandle* dq_tail = queue_->dq_tail.load(std::memory_order_acquire); in CordzHandle()
37 queue_->dq_tail.store(this, std::memory_order_release); in CordzHandle()
46 SpinLockHolder lock(&queue_->mutex); in ~CordzHandle()
62 queue_->dq_tail.store(dq_prev_, std::memory_order_release); in ~CordzHandle()
72 return is_snapshot_ || queue_->IsEmpty(); in SafeToDelete()
79 Queue* const queue = handle->queue_; in Delete()
111 SpinLockHolder lock(&queue_->mutex); in DiagnosticsHandleIsSafeToInspect()
112 for (const CordzHandle* p = queue_->dq_tail; p; p = p->dq_prev_) { in DiagnosticsHandleIsSafeToInspect()
128 SpinLockHolder lock(&queue_->mutex); in DiagnosticsGetSafeToInspectDeletedHandles()
/external/OpenCL-CTS/test_conformance/vulkan/
Dmain.cpp55 cl_command_queue queue_, int numElements_);
57 cl_command_queue queue_, int numElements_);
60 cl_command_queue queue_, int numElements_) in test_buffer_single_queue() argument
64 return test_buffer_common(device_, context_, queue_, numElements_); in test_buffer_single_queue()
67 cl_command_queue queue_, int numElements_) in test_buffer_multiple_queue() argument
72 return test_buffer_common(device_, context_, queue_, numElements_); in test_buffer_multiple_queue()
75 cl_command_queue queue_, int numElements_) in test_buffer_multiImport_sameCtx() argument
81 return test_buffer_common(device_, context_, queue_, numElements_); in test_buffer_multiImport_sameCtx()
84 cl_command_queue queue_, int numElements_) in test_buffer_multiImport_diffCtx() argument
91 return test_buffer_common(device_, context_, queue_, numElements_); in test_buffer_multiImport_diffCtx()
[all …]
/external/libchrome/mojo/public/cpp/bindings/tests/
Dmessage_queue.cc20 return queue_.empty(); in IsEmpty()
24 queue_.emplace(std::move(*message)); in Push()
28 DCHECK(!queue_.empty()); in Pop()
29 *message = std::move(queue_.front()); in Pop()
34 DCHECK(!queue_.empty()); in Pop()
35 queue_.pop(); in Pop()
/external/webrtc/modules/rtp_rtcp/source/
Ddtmf_queue.cc28 if (queue_.size() >= kDtmfOutbandMax) { in AddDtmf()
31 queue_.push_back(event); in AddDtmf()
38 if (queue_.empty()) { in NextDtmf()
42 *event = queue_.front(); in NextDtmf()
43 queue_.pop_front(); in NextDtmf()
49 return !queue_.empty(); in PendingDtmf()

123456