| /external/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 …]
|
| /external/libchrome/base/task/sequence_manager/ |
| D | lazily_deallocated_deque.h | 64 for (const Ring* iter = head_.get(); iter; iter = iter->next_.get()) { in capacity()
71 while (head_) { in clear()
72 head_ = std::move(head_->next_); in clear()
81 if (!head_) { in push_front()
82 head_ = std::make_unique<Ring>(kMinimumRingSize); in push_front()
83 tail_ = head_.get(); in push_front()
87 if (!head_->CanPush()) { in push_front()
89 new_ring->next_ = std::move(head_); in push_front()
90 head_ = std::move(new_ring); in push_front()
93 head_->push_front(std::move(t)); in push_front()
[all …]
|
| /external/v8/src/heap/ |
| D | slot-set.cc | 11 Chunk* chunk = head_; in ~TypedSlots()
17 head_ = nullptr; in ~TypedSlots()
29 if (other->head_ == nullptr) { in Merge()
32 if (head_ == nullptr) { in Merge()
33 head_ = other->head_; in Merge()
36 tail_->next = other->head_; in Merge()
39 other->head_ = nullptr; in Merge()
44 if (!head_) { in EnsureChunk()
45 head_ = tail_ = NewChunk(nullptr, kInitialBufferSize); in EnsureChunk()
47 if (head_->buffer.size() == head_->buffer.capacity()) { in EnsureChunk()
[all …]
|
| D | array-buffer-sweeper.cc | 19 if (head_ == nullptr) { in Append()
21 head_ = tail_ = extension; in Append()
32 if (head_ == nullptr) { in Append()
34 head_ = list->head_; in Append()
36 } else if (list->head_) { in Append()
38 tail_->set_next(list->head_); in Append()
49 ArrayBufferExtension* current = head_; in Contains()
60 ArrayBufferExtension* current = head_; in BytesSlow()
206 ArrayBufferExtension* current = list->head_; in ReleaseAll()
269 ArrayBufferExtension* current = list->head_; in SweepListFull()
[all …]
|
| D | array-buffer-sweeper.h | 21 ArrayBufferList() : head_(nullptr), tail_(nullptr), bytes_(0) {} in ArrayBufferList()
23 ArrayBufferExtension* head_; member
28 DCHECK_IMPLIES(head_, tail_); in IsEmpty()
29 return head_ == nullptr; in IsEmpty()
36 head_ = tail_ = nullptr; in Reset()
|
| D | slot-set.h | 646 Chunk* head_ = nullptr; variable
671 Chunk* chunk = head_; in Iterate()
723 Chunk* LoadHead() { return base::AsAtomicPointer::Relaxed_Load(&head_); } in LoadHead()
725 base::AsAtomicPointer::Relaxed_Store(&head_, chunk); in StoreHead()
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| D | sample3-inl.h | 77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue()
86 QueueNode<E>* node = head_; in Clear()
96 head_ = last_ = NULL; in Clear()
105 QueueNode<E>* Head() { return head_; } in Head()
106 const QueueNode<E>* Head() const { return head_; } in Head()
120 head_ = last_ = new_node; in Enqueue()
136 const QueueNode<E>* const old_head = head_; in Dequeue()
137 head_ = head_->next_; in Dequeue()
155 for (const QueueNode<E>* node = head_; node != NULL; node = node->next_) { in Map()
163 QueueNode<E>* head_; // The first node of the queue.
|
| /external/googletest/googletest/samples/ |
| D | sample3-inl.h | 76 Queue() : head_(nullptr), last_(nullptr), size_(0) {} in Queue()
85 QueueNode<E>* node = head_; in Clear()
95 head_ = last_ = nullptr; in Clear()
104 QueueNode<E>* Head() { return head_; } in Head()
105 const QueueNode<E>* Head() const { return head_; } in Head()
119 head_ = last_ = new_node; in Enqueue()
135 const QueueNode<E>* const old_head = head_; in Dequeue()
136 head_ = head_->next_; in Dequeue()
154 for (const QueueNode<E>* node = head_; node != nullptr; in Map()
163 QueueNode<E>* head_; // The first node of the queue.
|
| /external/v8/src/utils/ |
| D | locked-queue-inl.h | 23 head_ = new Node();
24 CHECK_NOT_NULL(head_);
25 tail_ = head_;
32 Node* cur_node = head_;
57 old_head = head_;
58 Node* const next_node = head_->next.Value();
61 head_ = next_node;
70 return head_->next.Value() == nullptr;
76 Node* const next_node = head_->next.Value();
|
| D | locked-queue.h | 34 Node* head_; variable
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_lfstack.h | 29 atomic_store(&head_, 0, memory_order_relaxed); in Clear()
33 return (atomic_load(&head_, memory_order_relaxed) & kPtrMask) == 0; in Empty()
37 u64 cmp = atomic_load(&head_, memory_order_relaxed); in Push()
42 if (atomic_compare_exchange_weak(&head_, &cmp, xch, in Push()
49 u64 cmp = atomic_load(&head_, memory_order_acquire); in Pop()
57 if (atomic_compare_exchange_weak(&head_, &cmp, xch, in Pop()
69 atomic_uint64_t head_; member
|
| /external/tensorflow/tensorflow/core/util/ |
| D | util.cc | 48 head_(0), in MovingAverage()
57 head_ = 0; in Clear()
72 head_ = count_; in AddValue()
75 if (window_ == ++head_) { in AddValue()
76 head_ = 0; in AddValue()
79 sum_ -= data_[head_]; in AddValue()
81 data_[head_] = v; in AddValue()
|
| D | presized_cuckoo_map.h | 205 CuckooPathQueue() : head_(0), tail_(0) {} in CuckooPathQueue()
213 CuckooPathEntry& e = queue_[head_]; in pop_front()
214 head_ = (head_ + 1) % kMaxQueueSize; in pop_front()
218 bool empty() const { return head_ == tail_; } in empty()
220 bool full() const { return ((tail_ + 1) % kMaxQueueSize) == head_; } in full()
222 void reset() { head_ = tail_ = 0; } in reset()
226 int head_; variable
|
| D | util.h | 46 int head_; // Offset of the newest statistic in data_ variable
|
| /external/protobuf/src/google/protobuf/ |
| D | arena.cc | 226 head_->set_pos(head_->size() - (limit_ - ptr_)); in AllocateAlignedFallback()
228 head_ = arena_->NewBlock(head_, n); in AllocateAlignedFallback()
229 ptr_ = head_->Pointer(head_->pos()); in AllocateAlignedFallback()
230 limit_ = head_->Pointer(head_->size()); in AllocateAlignedFallback()
254 uint64 space_used = ptr_ - head_->Pointer(kBlockHeaderSize); in SpaceUsed()
256 for (Block* b = head_->next(); b; b = b->next()) { in SpaceUsed()
290 for (Block* b = serial->head_; b;) { in Free()
356 serial->head_ = b; in New()
|
| D | arena_impl.h | 200 Block* head_; // Head of linked list of blocks. variable
|
| /external/libtextclassifier/native/lang_id/common/ |
| D | registry.h | 151 explicit ComponentRegistry(const char *name) : name_(name), head_(nullptr) {} in ComponentRegistry()
166 Cell *new_cell = new Cell(key, value, head_); in Add()
167 head_ = new_cell; in Add()
190 for (const Cell *c = head_; c!= nullptr; c = c->next()) { in GetComponentNames()
221 const Cell *c = head_; in FindCell()
232 Cell *head_; variable
|
| /external/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
|
| /external/grpc-grpc/src/core/ext/filters/client_channel/resolver/dns/c_ares/ |
| D | grpc_ares_ev_driver_windows.cc | 401 GPR_ASSERT(head_ == nullptr); in ~SockToPolledFdMap()
407 new_node->next = head_; in AddNewSocket()
408 head_ = new_node; in AddNewSocket()
412 for (SockToPolledFdEntry* node = head_; node != nullptr; in LookupPolledFd()
423 GPR_ASSERT(head_ != nullptr); in RemoveEntry()
424 SockToPolledFdEntry** prev = &head_; in RemoveEntry()
425 for (SockToPolledFdEntry* node = head_; node != nullptr; in RemoveEntry()
494 SockToPolledFdEntry* head_ = nullptr; member in grpc_core::SockToPolledFdMap
|
| /external/webp/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()
|
| /external/minijail/ |
| D | syscall_filter_unittest.cc | 1188 head_ = new_filter_block(); in SetUp()
1193 free_block_list(head_); in TearDown()
1197 struct filter_block *head_; member in __anon26467d2b0211::FileTest
1209 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1226 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1242 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1261 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1269 struct filter_block *curr_block = head_; in TEST_F()
1296 int res = test_compile_file("policy", policy_file, head_, &arg_blocks_, in TEST_F()
1305 struct filter_block *curr_block = head_; in TEST_F()
[all …]
|
| /external/vulkan-validation-layers/tests/ |
| D | layer_validation_tests.h | 644 const void *head_ = nullptr; variable
660 obj.pNext = head_; in Add()
661 head_ = &obj; in Add()
|
| /external/v8/src/logging/ |
| D | log.cc | 839 if (Succ(head_) == static_cast<int>(base::Relaxed_Load(&tail_))) { in Insert()
842 buffer_[head_] = *sample; in Insert()
843 head_ = Succ(head_); in Insert()
870 int head_; // Index to the buffer head. member in v8::internal::Profiler
932 head_(0), in Profiler()
|
| /external/v8/src/execution/arm/ |
| D | simulator-arm.h | 575 Processor* head_ = nullptr; variable
|