| /external/chromium_org/base/containers/ |
| linked_list.h | 85 LinkNode() : previous_(0), next_(0) {}
87 : previous_(previous), next_(next) {}
91 this->next_ = e;
93 e->previous_->next_ = this;
99 this->next_ = e->next_;
101 e->next_->previous_ = this;
102 e->next_ = this;
107 this->previous_->next_ = this->next_;
130 LinkNode<T>* next_; member in class:base::LinkNode
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| snapshot.h | 25 SnapshotImpl* next_; member in class:leveldb::SnapshotImpl
34 list_.next_ = &list_;
37 bool empty() const { return list_.next_ == &list_; }
38 SnapshotImpl* oldest() const { assert(!empty()); return list_.next_; }
45 s->next_ = &list_;
47 s->prev_->next_ = s;
48 s->next_->prev_ = s;
54 s->prev_->next_ = s->next_;
55 s->next_->prev_ = s->prev_
[all...] |
| /external/chromium_org/gin/ |
| arguments.cc | 15 next_(0),
22 next_(0),
30 if (next_ >= info_->Length())
32 return (*info_)[next_];
40 "Error processing argument %d.", next_ - 1));
|
| arguments.h | 35 if (next_ >= info_->Length()) {
39 v8::Handle<v8::Value> val = (*info_)[next_++];
45 if (next_ >= info_->Length()) {
49 int remaining = info_->Length() - next_;
52 v8::Handle<v8::Value> val = (*info_)[next_++];
60 if (next_ >= info_->Length())
62 next_++;
85 int next_; member in class:gin::Arguments
|
| /external/chromium_org/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/chromium_org/third_party/mesa/src/src/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/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/libcxx/test/utilities/memory/unique.ptr/unique.ptr.runtime/unique.ptr.runtime.observers/ |
| index.pass.cpp | 22 static int next_; member in class:A
24 A() : state_(++next_) {}
33 int A::next_ = 0; member in class:A
|
| /external/libcxx/test/utilities/memory/unique.ptr/unique.ptr.single/unique.ptr.single.observers/ |
| index.fail.cpp | 22 static int next_; member in class:A
24 A() : state_(++next_) {}
33 int A::next_ = 0; member in class:A
|
| /external/llvm/utils/unittest/googletest/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/mesa3d/src/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/protobuf/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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/unique.ptr/unique.ptr.runtime/unique.ptr.runtime.observers/ |
| index.pass.cpp | 22 static int next_; member in class:A
24 A() : state_(++next_) {}
33 int A::next_ = 0; member in class:A
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/unique.ptr/unique.ptr.single/unique.ptr.single.observers/ |
| index.fail.cpp | 22 static int next_; member in class:A
24 A() : state_(++next_) {}
33 int A::next_ = 0; member in class:A
|
| /ndk/sources/third_party/googletest/googletest/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/chromium_org/base/memory/ |
| linked_ptr.h | 53 next_ = this;
58 next_ = ptr->next_;
59 ptr->next_ = this;
65 if (next_ == this) return true;
66 linked_ptr_internal const* p = next_;
67 while (p->next_ != this) p = p->next_;
68 p->next_ = next_;
73 mutable linked_ptr_internal const* next_; member in class:linked_ptr_internal
[all...] |
| /external/chromium_org/media/cdm/ppapi/ |
| linked_ptr.h | 56 next_ = this;
61 next_ = ptr->next_;
62 ptr->next_ = this;
68 if (next_ == this) return true;
69 linked_ptr_internal const* p = next_;
70 while (p->next_ != this) p = p->next_;
71 p->next_ = next_;
76 mutable linked_ptr_internal const* next_; member in class:linked_ptr_internal
[all...] |
| /external/webrtc/src/system_wrappers/source/ |
| map_no_stl.cc | 18 : next_(0),
87 while(item->next_)
95 new_item->next_ = item;
104 new_item->prev_->next_ = new_item;
108 item = item->next_;
111 item->next_ = new_item;
133 return item->next_;
182 item = item->next_;
195 MapNoStlItem* next_item = item->next_;
203 previous_item->next_ = next_item
[all...] |
| list_no_stl.cc | 18 : next_(0),
26 : next_(0),
137 return item->next_;
168 ListItem* next_item = existing_previous_item->next_;
169 new_item->next_ = existing_previous_item->next_;
171 existing_previous_item->next_ = new_item;
206 new_item->next_ = existing_next_item;
211 previous_item->next_ = new_item;
229 ListItem* next_item = item->next_;
[all...] |
| /external/protobuf/gtest/samples/ |
| sample3-inl.h | 57 QueueNode * next() { return next_; }
58 const QueueNode * next() const { return next_; }
63 QueueNode(const E & element) : element_(element), next_(NULL) {}
70 QueueNode * next_; member in class:QueueNode
124 last_->next_ = new_node;
138 head_ = head_->next_;
156 for (const QueueNode<E> * node = head_; node != NULL; node = node->next_) {
|
| /external/jsoncpp/src/lib_json/ |
| json_batchallocator.h | 48 BatchInfo *nextBatch = batch->next_;
66 currentBatch_ = currentBatch_->next_;
68 currentBatch_ = currentBatch_->next_;
73 currentBatch_->next_ = batches_; // insert at the head of the list
94 BatchInfo *next_; member in struct:Json::BatchAllocator::BatchInfo
109 batch->next_ = 0;
|
| /external/chromium_org/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_) {
|
| /ndk/sources/third_party/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_) {
|
| /art/compiler/utils/ |
| scoped_arena_allocator.cc | 61 top_arena_->next_ = nullptr;
62 } else if (top_arena_->next_ != nullptr && top_arena_->next_->Size() >= allocation_size) {
63 top_arena_ = top_arena_->next_;
65 Arena* tail = top_arena_->next_;
66 top_arena_->next_ = stats_and_pool_.pool->AllocArena(allocation_size);
67 top_arena_ = top_arena_->next_;
68 top_arena_->next_ = tail;
|
| /system/core/libbacktrace/ |
| BacktraceThread.cpp | 48 : pid_(pid), tid_(tid), futex_(0), ref_count_(1), mutex_(PTHREAD_MUTEX_INITIALIZER), next_(ThreadEntry::list_), prev_(NULL) {
63 entry = entry->next_;
92 list_ = next_;
94 if (next_) {
95 next_->prev_ = prev_;
97 prev_->next_ = next_;
100 next_ = NULL;
|
