/external/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.observers/ |
op_subscript.runtime.pass.cpp | 21 static int next_; member in class:A 24 A() : state_(++next_) {} 35 int A::next_ = 0; member in class:A
|
/external/parameter-framework/asio-1.10.6/include/asio/detail/ |
timer_queue_base.hpp | 30 timer_queue_base() : next_(0) {} 54 timer_queue_base* next_; member in class:asio::detail::timer_queue_base
|
call_stack.hpp | 38 next_(call_stack<Key, Value>::top_) 48 next_(call_stack<Key, Value>::top_) 56 call_stack<Key, Value>::top_ = next_; 62 context* elem = next_; 67 elem = elem->next_; 82 context* next_; member in class:asio::detail::call_stack::context 96 elem = elem->next_;
|
task_io_service_operation.hpp | 48 : next_(0), 61 task_io_service_operation* next_; member in class:asio::detail::ASIO_INHERIT_TRACKED_HANDLER
|
handler_tracking.hpp | 95 completion* next_; member in class:asio::detail::handler_tracking::completion
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.observers/ |
op_subscript.runtime.pass.cpp | 21 static int next_; member in class:A 24 A() : state_(++next_) {} 35 int A::next_ = 0; member in class:A
|
/system/update_engine/payload_consumer/ |
bzip_extent_writer.h | 38 : next_(std::move(next)) { 50 std::unique_ptr<ExtentWriter> next_; // The underlying ExtentWriter. member in class:chromeos_update_engine::BzipExtentWriter
|
/external/v8/src/wasm/ |
signature-map.h | 33 uint32_t next_ = 0; member in class:v8::internal::wasm::SignatureMap
|
/external/pdfium/core/fxcrt/ |
unowned_ptr_unittest.cpp | 17 UnownedPtr<Clink> next_ = nullptr; member in class:fxcrt::__anon31144::Clink 23 ptr2->next_ = ptr1; 31 ptr2->next_ = ptr1; 33 ptr2->next_ = nullptr; 40 ptr2->next_ = ptr1; 42 ptr2->next_.Release(); 51 ptr2->next_ = ptr1; 67 ptr2->next_ = ptr1; 68 ptr2->next_ = nullptr; 84 ptr2->next_ = ptr1 [all...] |
weak_ptr_unittest.cpp | 26 next_.Reset(); 28 void SetNext(const WeakTestPtr& next) { next_ = next; } 33 WeakTestPtr next_; member in class:fxcrt::__anon31145::PseudoDeletable
|
/external/perfetto/include/perfetto/base/ |
string_splitter.h | 66 char* next_; member in class:perfetto::base::StringSplitter
|
/external/libchrome/base/containers/ |
linked_list.h | 87 LinkNode() : previous_(NULL), next_(NULL) {} 89 : previous_(previous), next_(next) {} 93 this->next_ = e; 95 e->previous_->next_ = this; 101 this->next_ = e->next_; 103 e->next_->previous_ = this; 104 e->next_ = this; 109 this->previous_->next_ = this->next_; 136 LinkNode<T>* next_; member in class:base::LinkNode [all...] |
/external/v8/src/ |
futex-emulation.h | 42 next_(nullptr), 56 FutexWaitListNode* next_; member in class:v8::internal::FutexWaitListNode
|
/external/v8/src/zone/ |
zone-segment.h | 28 Segment* next() const { return next_; } 29 void set_next(Segment* const next) { next_ = next; } 52 Segment* next_; member in class:v8::internal::Segment
|
/external/webrtc/webrtc/base/ |
autodetectproxy.h | 82 int next_; member in class:rtc::AutoDetectProxy
|
/prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/opt/ |
unify_const_pass.cpp | 59 Node() : result_id_(0), next_() {} 69 auto iter = next_.find(key); 70 if (iter == next_.end()) { 72 return next_.insert(std::make_pair(key, MakeUnique<Node>())) 82 TrieNodeMap next_; member in class:spvtools::opt::__anon799::ResultIdTrie::Node
|
/system/core/libbacktrace/ |
ThreadEntry.h | 63 ThreadEntry* next_; member in class:ThreadEntry
|
/system/core/libmemunreachable/ |
LinkedList.h | 25 LinkedList() : next_(this), prev_(this), data_() {} 30 node.next_ = this->next_; 31 node.next_->prev_ = &node; 32 this->next_ = &node; 36 this->next_->prev_ = this->prev_; 37 this->prev_->next_ = this->next_; 38 this->next_ = this; 42 bool empty() { return next_ == this && prev_ == this; 46 LinkedList<T>* next_; member in class:android::LinkedList [all...] |
/art/runtime/mirror/ |
reference.h | 142 HeapReference<FinalizerReference> next_; member in class:art::mirror::FinalizerReference
|
/development/vndk/tools/header-checker/header-abi-dumper/src/ |
fixed_argv.h | 119 FixedArgvRegistry *next_; member in class:FixedArgvRegistry 122 FixedArgvRegistry(Function *func) : func_(func), next_(head_) { 127 for (FixedArgvRegistry *ptr = head_; ptr; ptr = ptr->next_) {
|
/external/google-breakpad/src/processor/ |
linked_ptr.h | 69 next_ = this; 75 while (p->next_ != ptr) p = p->next_; 76 p->next_ = this; 77 next_ = ptr; 83 if (next_ == this) return true; 84 linked_ptr_internal const* p = next_; 85 while (p->next_ != this) p = p->next_; 86 p->next_ = next_ 91 mutable linked_ptr_internal const* next_; member in class:google_breakpad::linked_ptr_internal [all...] |
/external/google-breakpad/src/testing/gtest/include/gtest/internal/ |
gtest-linked_ptr.h | 93 next_ = this; 113 while (p->next_ != ptr) p = p->next_; 114 p->next_ = this; 115 next_ = ptr; 124 if (next_ == this) return true; 125 linked_ptr_internal const* p = next_; 126 while (p->next_ != this) p = p->next_; 127 p->next_ = next_ 132 mutable linked_ptr_internal const* next_; member in class:testing::internal::linked_ptr_internal [all...] |
/external/google-breakpad/src/testing/gtest/samples/ |
sample3-inl.h | 57 QueueNode* next() { return next_; } 58 const QueueNode* next() const { return next_; } 63 explicit QueueNode(const E& an_element) : element_(an_element), next_(NULL) {} 70 QueueNode* next_; member in class:QueueNode 123 last_->next_ = new_node; 137 head_ = head_->next_; 155 for (const QueueNode<E>* node = head_; node != NULL; node = node->next_) {
|
/external/googletest/googletest/include/gtest/internal/ |
gtest-linked_ptr.h | 93 next_ = this; 113 while (p->next_ != ptr) { 114 assert(p->next_ != this && 117 p = p->next_; 119 p->next_ = this; 120 next_ = ptr; 129 if (next_ == this) return true; 130 linked_ptr_internal const* p = next_; 131 while (p->next_ != this) { 132 assert(p->next_ != next_ & 142 mutable linked_ptr_internal const* next_; member in class:testing::internal::linked_ptr_internal [all...] |
/external/googletest/googletest/samples/ |
sample3-inl.h | 57 QueueNode* next() { return next_; } 58 const QueueNode* next() const { return next_; } 63 explicit QueueNode(const E& an_element) : element_(an_element), next_(NULL) {} 70 QueueNode* next_; member in class:QueueNode 123 last_->next_ = new_node; 137 head_ = head_->next_; 155 for (const QueueNode<E>* node = head_; node != NULL; node = node->next_) {
|