| /third_party/node/deps/v8/src/base/ |
| D | threaded-list.h | 31 ThreadedListBase() : head_(nullptr), tail_(&head_) {} in ThreadedListBase()
49 *next = head_; in AddFront()
50 if (head_ == nullptr) tail_ = next; in AddFront()
51 head_ = v; in AddFront()
55 DCHECK_NOT_NULL(head_); in DropHead()
57 T* old_head = head_; in DropHead()
58 head_ = *TLTraits::next(head_); in DropHead()
59 if (head_ == nullptr) tail_ = &head_; in DropHead()
73 *tail_ = list.head_; in Append()
79 if (list.head_ == nullptr) return; in Prepend()
[all …]
|
| /third_party/node/deps/v8/src/heap/ |
| D | slot-set.cc | 14 Chunk* chunk = head_; in ~TypedSlots()
20 head_ = nullptr; in ~TypedSlots()
32 if (other->head_ == nullptr) { in Merge()
35 if (head_ == nullptr) { in Merge()
36 head_ = other->head_; in Merge()
39 tail_->next = other->head_; in Merge()
42 other->head_ = nullptr; in Merge()
47 if (!head_) { in EnsureChunk()
48 head_ = tail_ = NewChunk(nullptr, kInitialBufferSize); in EnsureChunk()
50 if (head_->buffer.size() == head_->buffer.capacity()) { in EnsureChunk()
[all …]
|
| D | array-buffer-sweeper.cc | 22 if (head_ == nullptr) { in Append()
24 head_ = tail_ = extension; in Append()
37 if (head_ == nullptr) { in Append()
39 head_ = list->head_; in Append()
41 } else if (list->head_) { in Append()
43 tail_->set_next(list->head_); in Append()
54 for (ArrayBufferExtension* current = head_; current; in ContainsSlow()
62 ArrayBufferExtension* current = head_; in BytesSlow()
73 DCHECK_IMPLIES(head_, tail_); in IsEmpty()
74 DCHECK_IMPLIES(!head_, bytes_ == 0); in IsEmpty()
[all …]
|
| D | slot-set.h | 676 Chunk* head_ = nullptr; variable
703 Chunk* chunk = head_; in Iterate()
762 Chunk* LoadHead() { return base::AsAtomicPointer::Relaxed_Load(&head_); } in LoadHead()
764 base::AsAtomicPointer::Relaxed_Store(&head_, chunk); in StoreHead()
|
| D | array-buffer-sweeper.h | 34 ArrayBufferExtension* head_ = nullptr;
|
| /third_party/googletest/googletest/samples/ |
| D | sample3-inl.h | 75 Queue() : head_(nullptr), last_(nullptr), size_(0) {} in Queue()
84 QueueNode<E>* node = head_; in Clear()
94 head_ = last_ = nullptr; in Clear()
103 QueueNode<E>* Head() { return head_; } in Head()
104 const QueueNode<E>* Head() const { return head_; } in Head()
118 head_ = last_ = new_node; in Enqueue()
134 const QueueNode<E>* const old_head = head_; in Dequeue()
135 head_ = head_->next_; in Dequeue()
153 for (const QueueNode<E>* node = head_; node != nullptr; in Map()
162 QueueNode<E>* head_; // The first node of the queue.
|
| /third_party/node/deps/v8/src/utils/ |
| D | locked-queue-inl.h | 23 head_ = new Node();
24 CHECK_NOT_NULL(head_);
25 tail_ = head_;
33 Node* cur_node = head_;
59 old_head = head_;
60 Node* const next_node = head_->next.Value();
63 head_ = next_node;
75 return head_->next.Value() == nullptr;
81 Node* const next_node = head_->next.Value();
|
| D | locked-queue.h | 39 Node* head_; 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 <<()
114 Filler(CordRepRing* rep, index_type pos) : rep_(rep), head_(pos), pos_(pos) {} in Filler()
116 index_type head() const { return head_; } in head()
128 index_type head_; member in absl::cord_internal::CordRepRing::Filler
140 if (head_ >= capacity_ || tail_ >= capacity_) { in IsValid()
141 output << "head " << head_ << " and/or tail " << tail_ << "exceed capacity " in IsValid()
155 index_type head = head_; in IsValid()
252 head_ = 0; in Fill()
316 CordRep* child = entry_child(head_); in GetPrependBuffer()
317 size_t data_offset = entry_data_offset(head_); in GetPrependBuffer()
[all …]
|
| D | cord_rep_ring.h | 118 index_type head() const { return head_; } in head()
123 index_type entries() const { return entries(head_, tail_); } in entries()
272 return (index == head_) ? begin_pos_ : entry_end_pos(retreat(index)); in entry_begin_pos()
344 ForEach(head_, tail_, std::forward<F>(f)); in ForEach()
478 index_type head_; variable
536 return (tail_ > head_) ? (index >= head_ && index < tail_) in IsValidIndex()
537 : (index >= head_ || index < tail_); in IsValidIndex()
549 return (offset == 0) ? Position{head_, 0} : FindSlow(head_, offset); in Find()
556 return (offset == 0) ? Position{head_, 0} : FindSlow(head, offset); in Find()
561 return (offset == length) ? Position{tail_, 0} : FindTailSlow(head_, offset); in FindTail()
|
| /third_party/protobuf/src/google/protobuf/ |
| D | arena.cc | 195 head_->set_pos(head_->size() - (limit_ - ptr_)); in AllocateAlignedFallback()
197 head_ = arena_->NewBlock(head_, n); in AllocateAlignedFallback()
198 ptr_ = head_->Pointer(head_->pos()); in AllocateAlignedFallback()
199 limit_ = head_->Pointer(head_->size()); in AllocateAlignedFallback()
223 uint64 space_used = ptr_ - head_->Pointer(kBlockHeaderSize); in SpaceUsed()
225 for (Block* b = head_->next(); b; b = b->next()) { in SpaceUsed()
259 for (Block* b = serial->head_; b;) { in Free()
325 serial->head_ = b; in New()
|
| D | arena_impl.h | 238 Block* head_; // Head of linked list of blocks. variable
|
| /third_party/node/src/ |
| D | callback_queue-inl.h | 20 std::unique_ptr<Callback> ret = std::move(head_); in Shift()
22 head_ = ret->get_next(); in Shift()
23 if (!head_) in Shift()
39 head_ = std::move(cb); in Push()
46 tail_->set_next(std::move(other.head_)); in ConcatMove()
48 head_ = std::move(other.head_); in ConcatMove()
|
| D | node_postmortem_metadata.cc | 28 V(Environment_HandleWrapQueue, head_, ListNode_HandleWrap, \
29 Environment::HandleWrapQueue::head_) \
32 V(Environment_ReqWrapQueue, head_, ListNode_ReqWrapQueue, \
33 Environment::ReqWrapQueue::head_) \
|
| D | util-inl.h | 121 head_.next_->Remove(); in ~ListHead()
127 head_.prev_->next_ = that; in PushBack()
128 that->prev_ = head_.prev_; in PushBack()
129 that->next_ = &head_; in PushBack()
130 head_.prev_ = that; in PushBack()
136 head_.next_->prev_ = that; in PushFront()
137 that->prev_ = &head_; in PushFront()
138 that->next_ = head_.next_; in PushFront()
139 head_.next_ = that; in PushFront()
144 return head_.IsEmpty(); in IsEmpty()
[all …]
|
| D | callback_queue.h | 70 std::unique_ptr<Callback> head_; variable
|
| /third_party/node/deps/v8/src/compiler/ |
| D | redundancy-elimination.cc | 80 Check* this_head = this->head_; in Equals()
81 Check* that_head = that->head_; in Equals()
97 Check* that_head = that->head_; in Merge()
104 head_ = head_->next; in Merge()
110 while (head_ != that_head) { in Merge()
112 DCHECK_NOT_NULL(head_); in Merge()
114 head_ = head_->next; in Merge()
122 Check* head = zone->New<Check>(node, head_); in AddCheck()
227 for (Check const* check = head_; check != nullptr; check = check->next) { in LookupCheck()
238 for (Check const* check = head_; check != nullptr; check = check->next) { in LookupBoundsCheckFor()
|
| D | redundancy-elimination.h | 46 EffectPathChecks(Check* head, size_t size) : head_(head), size_(size) {} in EffectPathChecks()
50 Check* head_; variable
|
| /third_party/skia/third_party/externals/libwebp/src/enc/ |
| D | backward_references_cost_enc.c | 186 CostInterval* head_; member
240 DeleteIntervalList(manager, manager->head_); in CostManagerClear()
241 manager->head_ = NULL; in CostManagerClear()
258 manager->head_ = NULL; in CostManagerInit()
348 manager->head_ = next; in ConnectIntervals()
376 CostInterval* current = manager->head_; in UpdateCostAtIndex()
400 if (previous == NULL) previous = manager->head_; in PositionOrphanInterval()
412 ConnectIntervals(manager, current, manager->head_); in PositionOrphanInterval()
463 CostInterval* interval = manager->head_; in PushInterval()
|
| /third_party/node/deps/v8/src/logging/ |
| D | log.cc | 889 if (Succ(head_) == static_cast<int>(base::Relaxed_Load(&tail_))) { in Insert()
892 buffer_[head_] = *sample; in Insert()
893 head_ = Succ(head_); in Insert()
920 int head_; // Index to the buffer head. member in v8::internal::Profiler
984 head_(0), in Profiler()
|
| /third_party/node/deps/v8/src/execution/arm/ |
| D | simulator-arm.h | 585 Processor* head_ = nullptr; variable
|
| D | simulator-arm.cc | 6471 for (Processor* iter = head_; iter; iter = iter->next_) { in NotifyStore_Locked()
6482 for (Processor* iter = head_; iter; iter = iter->next_) { in NotifyStoreExcl_Locked()
6495 return head_ == processor || processor->next_ || processor->prev_; in IsProcessorInLinkedList_Locked()
6503 if (head_) { in PrependProcessor_Locked()
6504 head_->prev_ = processor; in PrependProcessor_Locked()
6507 processor->next_ = head_; in PrependProcessor_Locked()
6508 head_ = processor; in PrependProcessor_Locked()
6520 head_ = processor->next_; in RemoveProcessor()
|
| /third_party/node/deps/v8/src/execution/loong64/ |
| D | simulator-loong64.cc | 5496 for (LinkedAddress* iter = head_; iter; iter = iter->next_) { in NotifyStore_Locked()
5506 for (LinkedAddress* iter = head_; iter; iter = iter->next_) { in NotifyStoreConditional_Locked()
5519 return head_ == linked_address || linked_address->next_ || in IsProcessorInLinkedList_Locked()
5529 if (head_) { in PrependProcessor_Locked()
5530 head_->prev_ = linked_address; in PrependProcessor_Locked()
5533 linked_address->next_ = head_; in PrependProcessor_Locked()
5534 head_ = linked_address; in PrependProcessor_Locked()
5547 head_ = linked_address->next_; in RemoveLinkedAddress()
|
| D | simulator-loong64.h | 636 LinkedAddress* head_ = nullptr; variable
|
| /third_party/node/deps/v8/src/execution/mips/ |
| D | simulator-mips.h | 708 LinkedAddress* head_ = nullptr; variable
|