Searched refs:queue_tail_ (Results 1 – 3 of 3) sorted by relevance
86 queue_head_ = queue_tail_ = new_chunk; in InfLenFIFOQueue()107 if (queue_tail_ == queue_head_ && curr_count != 0) { in Put()117 new_chunk[0].prev = queue_tail_->prev; in Put()119 queue_tail_->prev->next = new_chunk; in Put()121 queue_tail_ = new_chunk; in Put()123 queue_tail_->content = static_cast<void*>(elem); in Put()134 queue_tail_->insert_time = current_time; in Put()138 queue_tail_ = queue_tail_->next; in Put()
159 Node* queue_tail_ = nullptr; // End of queue, insert position variable
26 queue_tail_(max_chunks), in TraceBufferRingBuffer()67 recyclable_chunks_queue_[queue_tail_] = index; in ReturnChunk()68 queue_tail_ = NextQueueIndex(queue_tail_); in ReturnChunk()95 while (current_iteration_index_ != queue_tail_) { in NextChunk()109 for (size_t queue_index = queue_head_; queue_index != queue_tail_; in EstimateTraceMemoryOverhead()119 bool QueueIsEmpty() const { return queue_head_ == queue_tail_; } in QueueIsEmpty()122 return queue_tail_ > queue_head_ in QueueSize()123 ? queue_tail_ - queue_head_ in QueueSize()124 : queue_tail_ + queue_capacity() - queue_head_; in QueueSize()146 size_t queue_tail_; member in base::trace_event::__anonfbd835010111::TraceBufferRingBuffer