/external/libchrome/base/containers/ |
D | linked_list.h | 87 LinkNode() : previous_(nullptr), next_(nullptr) {} in LinkNode() 89 : previous_(previous), next_(next) {} in LinkNode() 92 next_ = rhs.next_; in LinkNode() 93 rhs.next_ = nullptr; in LinkNode() 99 if (next_) { in LinkNode() 100 next_->previous_ = this; in LinkNode() 101 previous_->next_ = this; in LinkNode() 107 this->next_ = e; in InsertBefore() 109 e->previous_->next_ = this; in InsertBefore() 115 this->next_ = e->next_; in InsertAfter() [all …]
|
/external/perfetto/src/base/ |
D | string_splitter.cc | 45 next_ = str; in Initialize() 50 next_[size - 1] = '\0'; in Initialize() 54 for (; next_ < end_; next_++) { in Next() 55 if (*next_ == delimiter_) in Next() 57 cur_ = next_; in Next() 58 for (;; next_++) { in Next() 59 if (*next_ == delimiter_) { in Next() 60 cur_size_ = static_cast<size_t>(next_ - cur_); in Next() 61 *(next_++) = '\0'; in Next() 64 if (*next_ == '\0') { in Next() [all …]
|
/external/libaom/libaom/third_party/googletest/src/googletest/include/gtest/internal/ |
D | gtest-linked_ptr.h | 93 next_ = this; in join_new() 113 while (p->next_ != ptr) { in join() 114 assert(p->next_ != this && in join() 117 p = p->next_; in join() 119 p->next_ = this; in join() 120 next_ = ptr; in join() 129 if (next_ == this) return true; in depart() 130 linked_ptr_internal const* p = next_; in depart() 131 while (p->next_ != this) { in depart() 132 assert(p->next_ != next_ && in depart() [all …]
|
/external/mesa3d/src/gtest/include/gtest/internal/ |
D | gtest-linked_ptr.h | 93 next_ = this; in join_new() 113 while (p->next_ != ptr) { in join() 114 assert(p->next_ != this && in join() 117 p = p->next_; in join() 119 p->next_ = this; in join() 120 next_ = ptr; in join() 129 if (next_ == this) return true; in depart() 130 linked_ptr_internal const* p = next_; in depart() 131 while (p->next_ != this) { in depart() 132 assert(p->next_ != next_ && in depart() [all …]
|
/external/swiftshader/third_party/llvm-7.0/llvm/utils/unittest/googletest/include/gtest/internal/ |
D | gtest-linked_ptr.h | 93 next_ = this; in join_new() 113 while (p->next_ != ptr) { in join() 114 assert(p->next_ != this && in join() 117 p = p->next_; in join() 119 p->next_ = this; in join() 120 next_ = ptr; in join() 129 if (next_ == this) return true; in depart() 130 linked_ptr_internal const* p = next_; in depart() 131 while (p->next_ != this) { in depart() 132 assert(p->next_ != next_ && in depart() [all …]
|
/external/libvpx/libvpx/third_party/googletest/src/include/gtest/internal/ |
D | gtest-linked_ptr.h | 93 next_ = this; in join_new() 113 while (p->next_ != ptr) { in join() 114 assert(p->next_ != this && in join() 117 p = p->next_; in join() 119 p->next_ = this; in join() 120 next_ = ptr; in join() 129 if (next_ == this) return true; in depart() 130 linked_ptr_internal const* p = next_; in depart() 131 while (p->next_ != this) { in depart() 132 assert(p->next_ != next_ && in depart() [all …]
|
/external/parameter-framework/asio-1.10.6/include/asio/detail/impl/ |
D | timer_queue_set.ipp | 30 q->next_ = first_; 40 first_ = q->next_; 41 q->next_ = 0; 45 for (timer_queue_base* p = first_; p->next_; p = p->next_) 47 if (p->next_ == q) 49 p->next_ = q->next_; 50 q->next_ = 0; 59 for (timer_queue_base* p = first_; p; p = p->next_) 68 for (timer_queue_base* p = first_; p; p = p->next_) 76 for (timer_queue_base* p = first_; p; p = p->next_) [all …]
|
/external/google-breakpad/src/processor/ |
D | linked_ptr.h | 69 next_ = this; in join_new() 75 while (p->next_ != ptr) p = p->next_; in join() 76 p->next_ = this; in join() 77 next_ = ptr; in join() 83 if (next_ == this) return true; in depart() 84 linked_ptr_internal const* p = next_; in depart() 85 while (p->next_ != this) p = p->next_; in depart() 86 p->next_ = next_; in depart() 91 mutable linked_ptr_internal const* next_;
|
/external/v8/src/interpreter/ |
D | bytecode-register-optimizer.cc | 25 next_(this), in RegisterInfo() 86 RegisterInfo* next_; member in v8::internal::interpreter::BytecodeRegisterOptimizer::RegisterInfo 96 next_->prev_ = prev_; in AddToEquivalenceSetOf() 97 prev_->next_ = next_; in AddToEquivalenceSetOf() 99 next_ = info->next_; in AddToEquivalenceSetOf() 101 prev_->next_ = this; in AddToEquivalenceSetOf() 102 next_->prev_ = this; in AddToEquivalenceSetOf() 109 next_->prev_ = prev_; in MoveToNewEquivalenceSet() 110 prev_->next_ = next_; in MoveToNewEquivalenceSet() 111 next_ = prev_ = this; in MoveToNewEquivalenceSet() [all …]
|
/external/pdfium/core/fxcrt/ |
D | unowned_ptr_unittest.cpp | 17 UnownedPtr<Clink> next_ = nullptr; member in fxcrt::__anon039812210111::Clink 23 ptr2->next_ = ptr1; in DeleteDangling() 31 ptr2->next_ = ptr1; in AssignDangling() 33 ptr2->next_ = nullptr; in AssignDangling() 40 ptr2->next_ = ptr1; in ReleaseDangling() 42 ptr2->next_.Release(); in ReleaseDangling() 51 ptr2->next_ = ptr1; in TEST() 67 ptr2->next_ = ptr1; in TEST() 68 ptr2->next_ = nullptr; in TEST() 84 ptr2->next_ = ptr1; in TEST() [all …]
|
/external/google-breakpad/src/testing/gtest/include/gtest/internal/ |
D | gtest-linked_ptr.h | 93 next_ = this; in join_new() 113 while (p->next_ != ptr) p = p->next_; in join() 114 p->next_ = this; in join() 115 next_ = ptr; in join() 124 if (next_ == this) return true; in depart() 125 linked_ptr_internal const* p = next_; in depart() 126 while (p->next_ != this) p = p->next_; in depart() 127 p->next_ = next_; in depart() 132 mutable linked_ptr_internal const* next_;
|
/external/swiftshader/third_party/LLVM/utils/unittest/googletest/include/gtest/internal/ |
D | gtest-linked_ptr.h | 93 next_ = this; in join_new() 113 while (p->next_ != ptr) p = p->next_; in join() 114 p->next_ = this; in join() 115 next_ = ptr; in join() 124 if (next_ == this) return true; in depart() 125 linked_ptr_internal const* p = next_; in depart() 126 while (p->next_ != this) p = p->next_; in depart() 127 p->next_ = next_; in depart() 132 mutable linked_ptr_internal const* next_;
|
/external/llvm/utils/unittest/googletest/include/gtest/internal/ |
D | gtest-linked_ptr.h | 93 next_ = this; in join_new() 113 while (p->next_ != ptr) p = p->next_; in join() 114 p->next_ = this; in join() 115 next_ = ptr; in join() 124 if (next_ == this) return true; in depart() 125 linked_ptr_internal const* p = next_; in depart() 126 while (p->next_ != this) p = p->next_; in depart() 127 p->next_ = next_; in depart() 132 mutable linked_ptr_internal const* next_;
|
/external/v8/src/ |
D | eh-frame.h | 210 : start_(start), next_(start), end_(end) { in EhFrameIterator() 215 DCHECK_EQ(next_, start_); in SkipCie() 216 next_ += ReadUnalignedUInt32(reinterpret_cast<Address>(next_)) + kInt32Size; in SkipCie() 227 next_ += how_many; in Skip() 228 DCHECK_LE(next_, end_); in Skip() 242 DCHECK_LE(next_, end_); in Done() 243 return next_ == end_; in Done() 247 DCHECK_GE(next_, start_); in GetCurrentOffset() 248 return static_cast<int>(next_ - start_); in GetCurrentOffset() 254 return reinterpret_cast<const void*>(next_); in current_address() [all …]
|
D | futex-emulation.cc | 48 DCHECK(node->prev_ == nullptr && node->next_ == nullptr); in AddNode() 50 tail_->next_ = node; in AddNode() 56 node->next_ = nullptr; in AddNode() 63 node->prev_->next_ = node->next_; in RemoveNode() 65 head_ = node->next_; in RemoveNode() 68 if (node->next_) { in RemoveNode() 69 node->next_->prev_ = node->prev_; in RemoveNode() 74 node->prev_ = node->next_ = nullptr; in RemoveNode() 258 node = node->next_; in Wake() 279 node = node->next_; in NumWaitersForTesting()
|
D | v8threads.cc | 185 next_(this), in ThreadState() 200 next_->previous_ = previous_; in Unlink() 201 previous_->next_ = next_; in Unlink() 209 next_ = flying_anchor->next_; in LinkInto() 211 flying_anchor->next_ = this; in LinkInto() 212 next_->previous_ = this; in LinkInto() 217 ThreadState* gotten = free_anchor_->next_; in GetFreeThreadState() 234 if (next_ == thread_manager_->in_use_anchor_) return nullptr; in Next() 235 return next_; in Next() 260 for (ThreadState* current = anchor->next_; current != anchor;) { in DeleteThreadStateList() [all …]
|
/external/libchrome/base/memory/ |
D | linked_ptr.h | 49 next_ = this; in join_new() 54 next_ = ptr->next_; in join() 55 ptr->next_ = this; in join() 61 if (next_ == this) return true; in depart() 62 linked_ptr_internal const* p = next_; in depart() 63 while (p->next_ != this) p = p->next_; in depart() 64 p->next_ = next_; in depart() 69 mutable linked_ptr_internal const* next_;
|
/external/parameter-framework/asio-1.10.6/include/asio/detail/ |
D | call_stack.hpp | 38 next_(call_stack<Key, Value>::top_) in context() 48 next_(call_stack<Key, Value>::top_) in context() 56 call_stack<Key, Value>::top_ = next_; in ~context() 62 context* elem = next_; in next_by_key() 67 elem = elem->next_; in next_by_key() 82 context* next_; member in asio::detail::call_stack::context 96 elem = elem->next_; in contains()
|
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/utils/ |
D | sparse_column_iterable.h | 50 cur_ = next_; 76 range_.end = next_; 86 next_ = std::min(next_ + 1, end_); in UpdateNext() 87 while (next_ < end_ && iter_->ix()(cur_, 0) == iter_->ix()(next_, 0)) { in UpdateNext() 88 ++next_; in UpdateNext() 95 int64 next_; variable
|
/external/grpc-grpc/src/core/tsi/ssl/session_cache/ |
D | ssl_session_cache.cc | 79 Node* next_ = nullptr; member in tsi::SslSessionLRUCache::Node 92 Node* next = node->next_; in ~SslSessionLRUCache() 156 use_order_list_head_ = node->next_; in Remove() 158 node->prev_->next_ = node->next_; in Remove() 160 if (node->next_ == nullptr) { in Remove() 163 node->next_->prev_ = node->prev_; in Remove() 173 node->next_ = nullptr; in PushFront() 176 node->next_ = use_order_list_head_; in PushFront() 177 node->next_->prev_ = node; in PushFront() 202 current = current->next_; in AssertInvariants()
|
/external/webp/src/mux/ |
D | muxinternal.c | 57 next = chunk->next_; in ChunkRelease() 96 chunk = chunk->next_; in ChunkSearchNextInList() 107 WebPChunk* next_chunk = ChunkSearchNextInList(first->next_, tag); in ChunkSearchList() 151 new_chunk->next_ = NULL; in ChunkSetHead() 164 while (last_chunk->next_ != NULL) last_chunk = last_chunk->next_; in ChunkAppend() 165 ChunkSetHead(chunk, &last_chunk->next_); in ChunkAppend() 166 *chunk_list = &last_chunk->next_; in ChunkAppend() 205 chunk_list = chunk_list->next_; in ChunkListEmit() 214 chunk_list = chunk_list->next_; in ChunkListDiskSize() 237 next = wpi->next_; in MuxImageRelease() [all …]
|
/external/grpc-grpc/src/core/lib/iomgr/ |
D | buffer_list.cc | 44 while (ptr->next_ != nullptr) { in AddNewEntry() 45 ptr = ptr->next_; in AddNewEntry() 47 ptr->next_ = new_elem; in AddNewEntry() 77 elem = elem->next_; in ProcessTimestamp() 81 elem = elem->next_; in ProcessTimestamp() 89 next = elem->next_; in ProcessTimestamp() 109 auto* next = elem->next_; in Shutdown()
|
/external/google-breakpad/src/testing/gtest/samples/ |
D | sample3-inl.h | 57 QueueNode* next() { return next_; } in next() 58 const QueueNode* next() const { return next_; } in next() 63 explicit QueueNode(const E& an_element) : element_(an_element), next_(NULL) {} in QueueNode() 70 QueueNode* next_; variable 123 last_->next_ = new_node; in Enqueue() 137 head_ = head_->next_; in Dequeue() 155 for (const QueueNode<E>* node = head_; node != NULL; node = node->next_) { in Map()
|
/external/googletest/googletest/samples/ |
D | sample3-inl.h | 55 QueueNode* next() { return next_; } in next() 56 const QueueNode* next() const { return next_; } in next() 62 : element_(an_element), next_(nullptr) {} in QueueNode() 69 QueueNode* next_; variable 122 last_->next_ = new_node; in Enqueue() 136 head_ = head_->next_; in Dequeue() 155 node = node->next_) { in Map()
|
/external/jsoncpp/src/lib_json/ |
D | json_batchallocator.h | 45 BatchInfo* nextBatch = batch->next_; in ~BatchAllocator() 62 currentBatch_ = currentBatch_->next_; in allocate() 64 currentBatch_ = currentBatch_->next_; in allocate() 69 currentBatch_->next_ = batches_; // insert at the head of the list in allocate() 89 BatchInfo* next_; member 104 batch->next_ = 0; in allocateBatch()
|