Searched refs:tail_ (Results 1 – 11 of 11) sorted by relevance
40 this.tail_ = new ConsArray.Cell(null, null);41 this.currCell_ = this.tail_;55 this.tail_.data = arr;56 this.tail_ = this.tail_.next = new ConsArray.Cell(null, null);
41 FutexWaitList::FutexWaitList() : head_(nullptr), tail_(nullptr) {} in FutexWaitList()46 if (tail_) { in AddNode()47 tail_->next_ = node; in AddNode()52 node->prev_ = tail_; in AddNode()54 tail_ = node; in AddNode()68 tail_ = node->prev_; in RemoveNode()
26 tail_ = head_;50 tail_->next.SetValue(n);51 tail_ = n;
35 Node* tail_; variable
76 FutexWaitListNode* tail_; variable
621 if (Succ(head_) == static_cast<int>(base::NoBarrier_Load(&tail_))) { in Insert()640 *sample = buffer_[base::NoBarrier_Load(&tail_)]; in Remove()642 base::NoBarrier_Store(&tail_, static_cast<base::Atomic32>( in Remove()643 Succ(base::NoBarrier_Load(&tail_)))); in Remove()657 base::Atomic32 tail_; // Index to the buffer tail. member in v8::internal::Profiler718 base::NoBarrier_Store(&tail_, 0); in Profiler()
75 Cell(const T& head, const List<T>& tail) : head_(head), tail_(tail) {} in Cell()81 const List<T>& tail() const { return tail_; } in tail()87 List<T> tail_; variable
99 if (refs->tail_ != NULL) { in ClearBackwardRefs()100 *refs->tail_ = refs->free_blocks_; // recycle all blocks at once in ClearBackwardRefs()103 refs->tail_ = &refs->refs_; in ClearBackwardRefs()121 refs->tail_ = &refs->refs_; in VP8LBackwardRefsInit()161 *refs->tail_ = b; in BackwardRefsNewBlock()162 refs->tail_ = &b->next_; in BackwardRefsNewBlock()
146 PixOrCopyBlock** tail_; // for list recycling member
317 while (tail_ != NULL && tail_->value()->CheckFlag(HValue::kIsDead)) { in tail()318 tail_ = tail_->tail_; in tail()320 return tail_; in tail()
284 : tail_(tail), value_(value), index_(index) { in HUseListNode()291 void set_tail(HUseListNode* list) { tail_ = list; } in set_tail()295 tail_ = reinterpret_cast<HUseListNode*>(1); in Zap()302 HUseListNode* tail_;