| /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/pigweed/pw_containers/ |
| D | intrusive_list.cc | 28 prev->next_ = next_; in unlist()
31 next_ = this; in unlist()
36 Item* prev = next_; in previous()
37 while (prev->next_ != this) { in previous()
38 prev = prev->next_; in previous()
47 item.next_ = pos->next_; in insert_after()
48 pos->next_ = &item; in insert_after()
51 void List::erase_after(Item* pos) { pos->next_->unlist(pos); } in erase_after()
62 for (Item* pos = before_begin(); pos->next_ != end(); pos = pos->next_) { in remove()
63 if (pos->next_ == &item_to_remove) { in remove()
[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/llvm-project/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/pdfium/core/fxcrt/ |
| D | unowned_ptr_unittest.cpp | 18 UnownedPtr<Clink> next_ = nullptr; member in fxcrt::__anonc3c8a6ff0111::Clink
25 ptr2->next_ = ptr1.get(); in DeleteDangling()
33 ptr2->next_.Reset(ptr1.get()); in ResetDangling()
35 ptr2->next_.Reset(); in ResetDangling()
42 ptr2->next_ = ptr1.get(); in AssignDangling()
44 ptr2->next_ = nullptr; in AssignDangling()
51 ptr2->next_ = ptr1.get(); in ReleaseDangling()
53 ptr2->next_.Release(); in ReleaseDangling()
62 ptr2->next_ = ptr1.get(); in TEST()
78 ptr2->next_.Reset(ptr1.get()); in TEST()
[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/webrtc/third_party/abseil-cpp/absl/random/internal/ |
| D | pool_urbg.h | 99 PoolURBG() : next_(kInitialBuffer) {} in PoolURBG()
102 PoolURBG(const PoolURBG&) : next_(kInitialBuffer) {} in PoolURBG()
104 next_ = kInitialBuffer;
113 if (next_ >= kBufferSize) { in operator()
114 next_ = (kBufferSize > 2 && next_ > kBufferSize) ? kHalfBuffer : 0; in operator()
115 PoolType::Fill(SpanType(reinterpret_cast<unsigned_type*>(state_ + next_), in operator()
116 kBufferSize - next_)); in operator()
118 return state_[next_++]; in operator()
123 size_t next_; // index within state_
|
| D | pool_urbg.cc | 59 next_ = kState; in Init()
70 if (next_ >= kState) { in MaybeRefill()
71 next_ = kCapacity; in MaybeRefill()
81 size_t next_ ABSL_GUARDED_BY(mu_);
88 return static_cast<uint8_t>(state_[next_++]); in Generate()
95 return static_cast<uint16_t>(state_[next_++]); in Generate()
102 return state_[next_++]; in Generate()
108 if (next_ >= kState - 1) { in Generate()
109 next_ = kCapacity; in Generate()
112 auto p = state_ + next_; in Generate()
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/random/internal/ |
| D | pool_urbg.h | 99 PoolURBG() : next_(kInitialBuffer) {} in PoolURBG()
102 PoolURBG(const PoolURBG&) : next_(kInitialBuffer) {} in PoolURBG()
104 next_ = kInitialBuffer;
113 if (next_ >= kBufferSize) { in operator()
114 next_ = (kBufferSize > 2 && next_ > kBufferSize) ? kHalfBuffer : 0; in operator()
115 PoolType::Fill(SpanType(reinterpret_cast<unsigned_type*>(state_ + next_), in operator()
116 kBufferSize - next_)); in operator()
118 return state_[next_++]; in operator()
123 size_t next_; // index within state_
|
| D | pool_urbg.cc | 59 next_ = kState; in Init()
70 if (next_ >= kState) { in MaybeRefill()
71 next_ = kCapacity; in MaybeRefill()
81 size_t next_ ABSL_GUARDED_BY(mu_);
88 return static_cast<uint8_t>(state_[next_++]); in Generate()
95 return static_cast<uint16_t>(state_[next_++]); in Generate()
102 return state_[next_++]; in Generate()
108 if (next_ >= kState - 1) { in Generate()
109 next_ = kCapacity; in Generate()
112 auto p = state_ + next_; in Generate()
[all …]
|
| /external/openscreen/third_party/abseil/src/absl/random/internal/ |
| D | pool_urbg.h | 99 PoolURBG() : next_(kInitialBuffer) {} in PoolURBG()
102 PoolURBG(const PoolURBG&) : next_(kInitialBuffer) {} in PoolURBG()
104 next_ = kInitialBuffer;
113 if (next_ >= kBufferSize) { in operator()
114 next_ = (kBufferSize > 2 && next_ > kBufferSize) ? kHalfBuffer : 0; in operator()
115 PoolType::Fill(SpanType(reinterpret_cast<unsigned_type*>(state_ + next_), in operator()
116 kBufferSize - next_)); in operator()
118 return state_[next_++]; in operator()
123 size_t next_; // index within state_
|
| D | pool_urbg.cc | 59 next_ = kState; in Init()
70 if (next_ >= kState) { in MaybeRefill()
71 next_ = kCapacity; in MaybeRefill()
81 size_t next_ ABSL_GUARDED_BY(mu_);
88 return static_cast<uint8_t>(state_[next_++]); in Generate()
95 return static_cast<uint16_t>(state_[next_++]); in Generate()
102 return state_[next_++]; in Generate()
108 if (next_ >= kState - 1) { in Generate()
109 next_ = kCapacity; in Generate()
112 auto p = state_ + next_; in Generate()
[all …]
|
| /external/libtextclassifier/abseil-cpp/absl/random/internal/ |
| D | pool_urbg.h | 99 PoolURBG() : next_(kInitialBuffer) {} in PoolURBG()
102 PoolURBG(const PoolURBG&) : next_(kInitialBuffer) {} in PoolURBG()
104 next_ = kInitialBuffer;
113 if (next_ >= kBufferSize) { in operator()
114 next_ = (kBufferSize > 2 && next_ > kBufferSize) ? kHalfBuffer : 0; in operator()
115 PoolType::Fill(SpanType(reinterpret_cast<unsigned_type*>(state_ + next_), in operator()
116 kBufferSize - next_)); in operator()
118 return state_[next_++]; in operator()
123 size_t next_; // index within state_
|
| D | pool_urbg.cc | 59 next_ = kState; in Init()
70 if (next_ >= kState) { in MaybeRefill()
71 next_ = kCapacity; in MaybeRefill()
81 size_t next_ ABSL_GUARDED_BY(mu_);
88 return static_cast<uint8_t>(state_[next_++]); in Generate()
95 return static_cast<uint16_t>(state_[next_++]); in Generate()
102 return state_[next_++]; in Generate()
108 if (next_ >= kState - 1) { in Generate()
109 next_ = kCapacity; in Generate()
112 auto p = state_ + next_; in Generate()
[all …]
|
| D | randen_engine.h | 74 if (next_ >= kStateSizeT) { in operator()
75 next_ = kCapacityT; in operator()
79 return state_[next_++]; in operator()
92 next_ = kStateSizeT;
146 next_ = kStateSizeT; in reseed()
150 uint64_t step = std::min<uint64_t>(kStateSizeT - next_, count); in discard()
155 next_ = kCapacityT; in discard()
160 next_ += step; in discard()
164 return next_ == other.next_ &&
186 os << engine.next_;
[all …]
|
| /external/angle/third_party/abseil-cpp/absl/random/internal/ |
| D | pool_urbg.h | 99 PoolURBG() : next_(kInitialBuffer) {} in PoolURBG()
102 PoolURBG(const PoolURBG&) : next_(kInitialBuffer) {} in PoolURBG()
104 next_ = kInitialBuffer;
113 if (next_ >= kBufferSize) { in operator()
114 next_ = (kBufferSize > 2 && next_ > kBufferSize) ? kHalfBuffer : 0; in operator()
115 PoolType::Fill(SpanType(reinterpret_cast<unsigned_type*>(state_ + next_), in operator()
116 kBufferSize - next_)); in operator()
118 return state_[next_++]; in operator()
123 size_t next_; // index within state_
|
| D | pool_urbg.cc | 59 next_ = kState; in Init()
70 if (next_ >= kState) { in MaybeRefill()
71 next_ = kCapacity; in MaybeRefill()
81 size_t next_ ABSL_GUARDED_BY(mu_);
88 return static_cast<uint8_t>(state_[next_++]); in Generate()
95 return static_cast<uint16_t>(state_[next_++]); in Generate()
102 return state_[next_++]; in Generate()
108 if (next_ >= kState - 1) { in Generate()
109 next_ = kCapacity; in Generate()
112 auto p = state_ + next_; in Generate()
[all …]
|
| /external/abseil-cpp/absl/random/internal/ |
| D | pool_urbg.h | 99 PoolURBG() : next_(kInitialBuffer) {} in PoolURBG()
102 PoolURBG(const PoolURBG&) : next_(kInitialBuffer) {} in PoolURBG()
104 next_ = kInitialBuffer;
113 if (next_ >= kBufferSize) { in operator()
114 next_ = (kBufferSize > 2 && next_ > kBufferSize) ? kHalfBuffer : 0; in operator()
115 PoolType::Fill(SpanType(reinterpret_cast<unsigned_type*>(state_ + next_), in operator()
116 kBufferSize - next_)); in operator()
118 return state_[next_++]; in operator()
123 size_t next_; // index within state_
|
| D | pool_urbg.cc | 59 next_ = kState; in Init()
70 if (next_ >= kState) { in MaybeRefill()
71 next_ = kCapacity; in MaybeRefill()
81 size_t next_ ABSL_GUARDED_BY(mu_);
88 return static_cast<uint8_t>(state_[next_++]); in Generate()
95 return static_cast<uint16_t>(state_[next_++]); in Generate()
102 return state_[next_++]; in Generate()
108 if (next_ >= kState - 1) { in Generate()
109 next_ = kCapacity; in Generate()
112 auto p = state_ + next_; in Generate()
[all …]
|
| D | randen_engine.h | 74 if (next_ >= kStateSizeT) { in operator()
75 next_ = kCapacityT; in operator()
79 return state_[next_++]; in operator()
92 next_ = kStateSizeT;
146 next_ = kStateSizeT; in reseed()
150 uint64_t step = std::min<uint64_t>(kStateSizeT - next_, count); in discard()
155 next_ = kCapacityT; in discard()
160 next_ += step; in discard()
164 return next_ == other.next_ &&
186 os << engine.next_;
[all …]
|
| /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/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/llvm-project/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_allocator_stats.h | 53 AllocatorStats *next_; variable
62 next_ = this; in InitLinkerInitialized()
72 s->next_ = next_; in Register()
74 next_->prev_ = s; in Register()
75 next_ = s; in Register()
80 s->prev_->next_ = s->next_; in Unregister()
81 s->next_->prev_ = s->prev_; in Unregister()
93 stats = stats->next_; in Get()
|