| /third_party/node/deps/v8/src/base/ |
| D | threaded-list.h | 31 ThreadedListBase() : head_(nullptr), tail_(&head_) {} in ThreadedListBase()
36 DCHECK_NULL(*tail_); in Add()
38 *tail_ = v; in Add()
39 tail_ = TLTraits::next(v); in Add()
41 DCHECK_NULL(*tail_); in Add()
50 if (head_ == nullptr) tail_ = next; in AddFront()
59 if (head_ == nullptr) tail_ = &head_; in DropHead()
73 *tail_ = list.head_; in Append()
74 tail_ = list.tail_; in Append()
82 *list.tail_ = head_; in Prepend()
[all …]
|
| /third_party/node/deps/v8/src/heap/ |
| D | slot-set.cc | 21 tail_ = nullptr; in ~TypedSlots()
37 tail_ = other->tail_; in Merge()
39 tail_->next = other->head_; in Merge()
40 tail_ = other->tail_; in Merge()
43 other->tail_ = nullptr; in Merge()
48 head_ = tail_ = NewChunk(nullptr, kInitialBufferSize); in EnsureChunk()
|
| D | array-buffer-sweeper.cc | 23 DCHECK_NULL(tail_); in Append()
24 head_ = tail_ = extension; in Append()
26 tail_->set_next(extension); in Append()
27 tail_ = extension; in Append()
38 DCHECK_NULL(tail_); in Append()
40 tail_ = list->tail_; in Append()
42 DCHECK_NOT_NULL(list->tail_); in Append()
43 tail_->set_next(list->head_); in Append()
44 tail_ = list->tail_; in Append()
46 DCHECK_NULL(list->tail_); in Append()
[all …]
|
| D | array-buffer-sweeper.h | 35 ArrayBufferExtension* tail_ = nullptr; member
|
| D | slot-set.h | 677 Chunk* tail_ = nullptr; variable
|
| /third_party/node/src/ |
| D | callback_queue-inl.h | 24 tail_ = nullptr; // The queue is now empty. in Shift()
32 Callback* prev_tail = tail_; in Push()
35 tail_ = cb.get(); in Push()
45 if (tail_ != nullptr) in ConcatMove()
46 tail_->set_next(std::move(other.head_)); in ConcatMove()
49 tail_ = other.tail_; in ConcatMove()
50 other.tail_ = nullptr; in ConcatMove()
|
| D | callback_queue.h | 71 Callback* tail_ = nullptr; variable
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_ring.cc | 86 << ", head = " << rep.head_ << ", tail = " << rep.tail_ in operator <<()
140 if (head_ >= capacity_ || tail_ >= capacity_) { in IsValid()
141 output << "head " << head_ << " and/or tail " << tail_ << "exceed capacity " in IsValid()
146 const index_type back = retreat(tail_); in IsValid()
187 } while (head != tail_); in IsValid()
253 tail_ = advance(0, src->entries(head, tail)); in Fill()
296 index_type back = retreat(tail_); in GetAppendBuffer()
333 rep->tail_ = rep->advance(0); in CreateFromLeaf()
386 Filler filler(rep, append ? rep->tail_ : rep->retreat(rep->head_, entries)); in AddRing()
398 if (tail.index != ring->tail_) UnrefEntries(ring, tail.index, ring->tail_); in AddRing()
[all …]
|
| D | cord_rep_ring.h | 119 index_type tail() const { return tail_; } in tail()
123 index_type entries() const { return entries(head_, tail_); } in entries()
344 ForEach(head_, tail_, std::forward<F>(f)); in ForEach()
479 index_type tail_; variable
536 return (tail_ > head_) ? (index >= head_ && index < tail_) in IsValidIndex()
537 : (index >= head_ || index < tail_); in IsValidIndex()
561 return (offset == length) ? Position{tail_, 0} : FindTailSlow(head_, offset); in FindTail()
568 return (offset == length) ? Position{tail_, 0} : FindTailSlow(head, offset); in FindTail()
|
| /third_party/node/deps/v8/tools/ |
| D | consarray.mjs | 41 this.tail_ = new ConsArrayCell(null, null);
42 this.currCell_ = this.tail_;
54 this.tail_.data = arr;
55 this.tail_ = this.tail_.next = new ConsArrayCell(null, null);
|
| /third_party/node/deps/v8/src/utils/ |
| D | locked-queue-inl.h | 25 tail_ = head_;
49 tail_->next.SetValue(n);
50 tail_ = n;
|
| D | locked-queue.h | 40 Node* tail_; variable
|
| /third_party/skia/third_party/externals/libwebp/src/enc/ |
| D | backward_references_enc.c | 88 if (refs->tail_ != NULL) { in VP8LClearBackwardRefs()
89 *refs->tail_ = refs->free_blocks_; // recycle all blocks at once in VP8LClearBackwardRefs()
92 refs->tail_ = &refs->refs_; in VP8LClearBackwardRefs()
111 (refs1->tail_ != NULL && refs1->tail_ == &refs1->refs_); in BackwardRefsSwap()
113 (refs2->tail_ != NULL && refs2->tail_ == &refs2->refs_); in BackwardRefsSwap()
117 if (point_to_refs2) refs1->tail_ = &refs1->refs_; in BackwardRefsSwap()
118 if (point_to_refs1) refs2->tail_ = &refs2->refs_; in BackwardRefsSwap()
124 refs->tail_ = &refs->refs_; in VP8LBackwardRefsInit()
164 *refs->tail_ = b; in BackwardRefsNewBlock()
165 refs->tail_ = &b->next_; in BackwardRefsNewBlock()
|
| D | backward_references_enc.h | 175 PixOrCopyBlock** tail_; // for list recycling member
|
| /third_party/node/deps/v8/src/logging/ |
| D | log.cc | 889 if (Succ(head_) == static_cast<int>(base::Relaxed_Load(&tail_))) { in Insert()
904 *sample = buffer_[base::Relaxed_Load(&tail_)]; in Remove()
907 &tail_, static_cast<base::Atomic32>(Succ(base::Relaxed_Load(&tail_)))); in Remove()
921 base::Atomic32 tail_; // Index to the buffer tail. member in v8::internal::Profiler
987 base::Relaxed_Store(&tail_, 0); in Profiler()
|