| /external/cronet/base/containers/ |
| D | linked_list.cc | 16 : previous_(previous), next_(next) {} in LinkNodeBase()
19 next_ = rhs.next_; in LinkNodeBase()
20 rhs.next_ = nullptr; in LinkNodeBase()
26 if (next_) { in LinkNodeBase()
27 next_->previous_ = this; in LinkNodeBase()
28 previous_->next_ = this; in LinkNodeBase()
33 previous_->next_ = next_; in RemoveFromList()
34 next_->previous_ = previous_; in RemoveFromList()
37 next_ = nullptr; in RemoveFromList()
43 CHECK_EQ(next_, nullptr); in InsertBeforeBase()
[all …]
|
| /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 | 26 prev->next_ = next_; in unlist()
29 next_ = this; in unlist()
34 Item* prev = next_; in previous()
35 while (prev->next_ != this) { in previous()
36 prev = prev->next_; in previous()
45 item.next_ = pos->next_; in insert_after()
46 pos->next_ = &item; in insert_after()
49 void List::erase_after(Item* pos) { pos->next_->unlist(pos); } in erase_after()
60 for (Item* pos = before_begin(); pos->next_ != end(); pos = pos->next_) { in remove()
61 if (pos->next_ == &item_to_remove) { in remove()
[all …]
|
| /external/perfetto/src/base/ |
| D | string_splitter.cc | 54 next_ = str; in Initialize()
59 next_[size - 1] = '\0'; in Initialize()
63 for (; next_ < end_; next_++) { in Next()
64 if (*next_ == delimiter_ && in Next()
69 cur_ = next_; in Next()
70 for (;; next_++) { in Next()
71 if (*next_ == delimiter_) { in Next()
72 cur_size_ = static_cast<size_t>(next_ - cur_); in Next()
73 *(next_++) = '\0'; in Next()
76 if (*next_ == '\0') { in Next()
[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/cronet/net/third_party/quiche/src/quiche/spdy/core/ |
| D | spdy_intrusive_list.h | 104 SpdyIntrusiveLink() : next_(nullptr), prev_(nullptr) {} in SpdyIntrusiveLink()
120 SpdyIntrusiveLink* next_; variable
158 sentinel_link_.next_ = src.sentinel_link_.next_; in SpdyIntrusiveList()
161 sentinel_link_.prev_->next_ = &sentinel_link_; in SpdyIntrusiveList()
162 sentinel_link_.next_->prev_ = &sentinel_link_; in SpdyIntrusiveList()
167 iterator begin() { return iterator(sentinel_link_.next_); } in begin()
168 const_iterator begin() const { return const_iterator(sentinel_link_.next_); } in begin()
180 bool empty() const { return (sentinel_link_.next_ == &sentinel_link_); } in empty()
199 obj_link->next_->prev_ = obj_link->prev_; in erase()
200 obj_link->prev_->next_ = obj_link->next_; in erase()
[all …]
|
| /external/leveldb/db/ |
| D | snapshot.h | 30 SnapshotImpl* next_; variable
43 head_.next_ = &head_; in SnapshotList()
46 bool empty() const { return head_.next_ == &head_; } in empty()
49 return head_.next_; in oldest()
65 snapshot->next_ = &head_; in New()
67 snapshot->prev_->next_ = snapshot; in New()
68 snapshot->next_->prev_ = snapshot; in New()
83 snapshot->prev_->next_ = snapshot->next_; in Delete()
84 snapshot->next_->prev_ = snapshot->prev_; in Delete()
|
| /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/angle/third_party/abseil-cpp/absl/random/internal/ |
| 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 | 73 : next_(other.next_), impl_(other.impl_) { in randen_engine()
77 next_ = other.next_;
87 if (next_ >= kStateSizeT) { in operator()
88 next_ = kCapacityT; in operator()
91 return little_endian::ToHost(begin[next_++]); in operator()
104 next_ = kStateSizeT;
165 next_ = kStateSizeT; in reseed()
169 uint64_t step = std::min<uint64_t>(kStateSizeT - next_, count); in discard()
175 next_ = kCapacityT; in discard()
180 next_ += step; in discard()
[all …]
|
| 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_
|
| /external/openscreen/third_party/abseil/src/absl/random/internal/ |
| 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.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/tensorflow/third_party/absl/abseil-cpp/absl/random/internal/ |
| 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 | 73 : next_(other.next_), impl_(other.impl_) { in randen_engine()
77 next_ = other.next_;
87 if (next_ >= kStateSizeT) { in operator()
88 next_ = kCapacityT; in operator()
91 return little_endian::ToHost(begin[next_++]); in operator()
104 next_ = kStateSizeT;
165 next_ = kStateSizeT; in reseed()
169 uint64_t step = std::min<uint64_t>(kStateSizeT - next_, count); in discard()
175 next_ = kCapacityT; in discard()
180 next_ += step; in discard()
[all …]
|
| /external/libtextclassifier/abseil-cpp/absl/random/internal/ |
| 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/webrtc/third_party/abseil-cpp/absl/random/internal/ |
| 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 | 73 : next_(other.next_), impl_(other.impl_) { in randen_engine()
77 next_ = other.next_;
87 if (next_ >= kStateSizeT) { in operator()
88 next_ = kCapacityT; in operator()
91 return little_endian::ToHost(begin[next_++]); in operator()
104 next_ = kStateSizeT;
165 next_ = kStateSizeT; in reseed()
169 uint64_t step = std::min<uint64_t>(kStateSizeT - next_, count); in discard()
175 next_ = kCapacityT; in discard()
180 next_ += step; in discard()
[all …]
|
| /external/abseil-cpp/absl/random/internal/ |
| 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 | 73 : next_(other.next_), impl_(other.impl_) { in randen_engine()
77 next_ = other.next_;
87 if (next_ >= kStateSizeT) { in operator()
88 next_ = kCapacityT; in operator()
91 return little_endian::ToHost(begin[next_++]); in operator()
104 next_ = kStateSizeT;
165 next_ = kStateSizeT; in reseed()
169 uint64_t step = std::min<uint64_t>(kStateSizeT - next_, count); in discard()
175 next_ = kCapacityT; in discard()
180 next_ += step; in discard()
[all …]
|
| 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_
|
| /external/cronet/third_party/abseil-cpp/absl/random/internal/ |
| 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 | 73 : next_(other.next_), impl_(other.impl_) { in randen_engine()
77 next_ = other.next_;
87 if (next_ >= kStateSizeT) { in operator()
88 next_ = kCapacityT; in operator()
91 return little_endian::ToHost(begin[next_++]); in operator()
104 next_ = kStateSizeT;
165 next_ = kStateSizeT; in reseed()
169 uint64_t step = std::min<uint64_t>(kStateSizeT - next_, count); in discard()
175 next_ = kCapacityT; in discard()
180 next_ += step; in discard()
[all …]
|
| 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_
|
| /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_;
|