| /external/webrtc/src/system_wrappers/source/ |
| D | list_no_stl.cc | 18 : next_(0), in ListItem()
26 : next_(0), in ListItem()
137 return item->next_; in Next()
168 ListItem* next_item = existing_previous_item->next_; in Insert()
169 new_item->next_ = existing_previous_item->next_; in Insert()
171 existing_previous_item->next_ = new_item; in Insert()
206 new_item->next_ = existing_next_item; in InsertBefore()
211 previous_item->next_ = new_item; in InsertBefore()
229 ListItem* next_item = item->next_; in Erase()
240 previous_item->next_ = next_item; in Erase()
[all …]
|
| D | map_no_stl.cc | 18 : next_(0), in MapNoStlItem()
87 while(item->next_) in Insert()
95 new_item->next_ = item; in Insert()
104 new_item->prev_->next_ = new_item; in Insert()
108 item = item->next_; in Insert()
111 item->next_ = new_item; in Insert()
133 return item->next_; in Next()
182 item = item->next_; in Locate()
195 MapNoStlItem* next_item = item->next_; in Remove()
203 previous_item->next_ = next_item; in Remove()
[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/mesa3d/src/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/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/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/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/protobuf/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/v8/src/ |
| D | hydrogen-load-elimination.cc | 24 HFieldApproximation* next_; member in v8::internal::HFieldApproximation
31 copy->next_ = this->next_ == NULL ? NULL : this->next_->Copy(zone); in Copy()
176 prev->next_ = approx->next_; in Merge()
178 fields_[i] = approx->next_; in Merge()
180 approx = approx->next_; in Merge()
184 approx = approx->next_; in Merge()
312 approx = approx->next_; in Find()
327 approx = approx->next_; in FindOrCreate()
341 approx->next_ = fields_[field]; in FindOrCreate()
359 prev->next_ = approx->next_; in KillFieldInternal()
[all …]
|
| D | scanner.h | 361 Token::Value peek() const { return next_.token; } in peek()
363 Location peek_location() const { return next_.location; } in peek_location()
379 DCHECK_NOT_NULL(next_.literal_chars); in is_next_contextual_keyword()
380 return next_.literal_chars->is_contextual_keyword(keyword); in is_next_contextual_keyword()
496 next_.literal_chars = free_buffer; in StartLiteral()
500 DCHECK_NOT_NULL(next_.literal_chars); in INLINE()
501 next_.literal_chars->AddChar(c); in INLINE()
512 next_.literal_chars = NULL; in DropLiteral()
567 DCHECK_NOT_NULL(next_.literal_chars); in next_literal_one_byte_string()
568 return next_.literal_chars->one_byte_literal(); in next_literal_one_byte_string()
[all …]
|
| D | v8threads.cc | 186 next_(this), in ThreadState()
203 next_->previous_ = previous_; in Unlink()
204 previous_->next_ = next_; in Unlink()
212 next_ = flying_anchor->next_; in LinkInto()
214 flying_anchor->next_ = this; in LinkInto()
215 next_->previous_ = this; in LinkInto()
220 ThreadState* gotten = free_anchor_->next_; in GetFreeThreadState()
237 if (next_ == thread_manager_->in_use_anchor_) return NULL; in Next()
238 return next_; in Next()
264 for (ThreadState* current = anchor->next_; current != anchor;) { in DeleteThreadStateList()
[all …]
|
| D | dateparser.h | 238 : in_(in), next_(Scan()) { } in DateStringTokenizer()
240 DateToken result = next_; in Next()
241 next_ = Scan(); in Next()
246 return next_; in Peek()
249 if (next_.IsSymbol(symbol)) { in SkipSymbol()
250 next_ = Scan(); in SkipSymbol()
260 DateToken next_; variable
|
| D | lithium-allocator.h | 124 : start_(start), end_(end), next_(NULL) { in UseInterval()
130 UseInterval* next() const { return next_; } in next()
150 void set_next(UseInterval* next) { next_ = next; } in set_next()
154 UseInterval* next_; variable
173 UsePosition* next() const { return next_; } in next()
176 void set_next(UsePosition* next) { next_ = next; } in set_next()
181 UsePosition* next_; variable
200 LiveRange* next() const { return next_; } in next()
314 LiveRange* next_; variable
|
| D | scanner.cc | 220 current_ = next_; in Next()
227 next_.token = token; in Next()
228 next_.location.beg_pos = pos; in Next()
229 next_.location.end_pos = pos + 1; in Next()
412 next_.literal_chars = NULL; in Scan()
416 next_.location.beg_pos = source_pos(); in Scan()
655 next_.location.end_pos = source_pos(); in Scan()
656 next_.token = token; in Scan()
663 if (pos == next_.location.beg_pos) return; in SeekForward()
665 DCHECK_EQ(next_.location.end_pos, current_pos); in SeekForward()
[all …]
|
| /external/protobuf/gtest/samples/ |
| D | sample3-inl.h | 57 QueueNode* next() { return next_; } in next()
58 const QueueNode* next() const { return next_; } in next()
63 QueueNode(const E& an_element) : element_(an_element), next_(NULL) {} in QueueNode()
70 QueueNode* next_; variable
124 last_->next_ = new_node; in Enqueue()
138 head_ = head_->next_; in Dequeue()
156 for (const QueueNode<E>* node = head_; node != NULL; node = node->next_) { in Map()
|
| /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/v8/src/base/platform/ |
| D | condition-variable.cc | 135 Event* next_;
146 freelist_ = event->next_;
158 freelist_ = event->next_;
167 for (Event* we = waitlist_; we != NULL; we = we->next_) {
173 event->next_ = waitlist_;
184 for (Event** wep = &waitlist_;; wep = &(*wep)->next_) {
187 *wep = event->next_;
194 for (Event* fe = freelist_; fe != NULL; fe = fe->next_) {
205 event->next_ = freelist_;
232 event = event->next_) {
[all …]
|
| /external/jsoncpp/src/lib_json/ |
| D | json_batchallocator.h | 48 BatchInfo *nextBatch = batch->next_; in ~BatchAllocator()
66 currentBatch_ = currentBatch_->next_; in allocate()
68 currentBatch_ = currentBatch_->next_; in allocate()
73 currentBatch_->next_ = batches_; // insert at the head of the list in allocate()
94 BatchInfo *next_; member
109 batch->next_ = 0; in allocateBatch()
|
| /external/jsoncpp/src/test_lib_json/ |
| D | jsontest.cpp | 84 rootPredicateNode_.next_ = 0; in TestResult()
101 PredicateContext *lastNode = rootPredicateNode_.next_; in addFailure()
102 for ( ; lastNode != 0; lastNode = lastNode->next_ ) in addFailure()
143 while ( lastNode->next_ != 0 && lastNode->next_->next_ != 0 ) in popPredicateContext()
145 lastNode = lastNode->next_; in popPredicateContext()
148 PredicateContext *tail = lastNode->next_; in popPredicateContext()
155 lastNode->next_ = 0; in popPredicateContext()
172 while ( lastNode->next_ != 0 ) in getAssertionNestingLevel()
174 lastNode = lastNode->next_; in getAssertionNestingLevel()
|
| /external/webp/src/enc/ |
| D | token.c | 37 VP8Tokens* next_; // pointer to next page member
58 const VP8Tokens* const next = p->next_; in VP8TBufferClear()
76 page->next_ = NULL; in TBufferNewPage()
79 b->last_page_ = &page->next_; in TBufferNewPage()
206 const int N = (p->next_ == NULL) ? b->left_ : 0;
215 p = p->next_;
230 const VP8Tokens* const next = p->next_; in VP8EmitTokens()
256 const VP8Tokens* const next = p->next_; in VP8EstimateTokenSize()
|
| /external/libcxx/test/std/utilities/memory/unique.ptr/unique.ptr.runtime/unique.ptr.runtime.observers/ |
| D | index.pass.cpp | 22 static int next_; member in A
24 A() : state_(++next_) {} in A()
33 int A::next_ = 0; member in A
|
| /external/libcxx/test/std/utilities/memory/unique.ptr/unique.ptr.single/unique.ptr.single.observers/ |
| D | index.fail.cpp | 22 static int next_; member in A
24 A() : state_(++next_) {} in A()
33 int A::next_ = 0; member in A
|
| /external/webp/src/utils/ |
| D | utils.c | 61 MemBlock* next_; member
82 all_blocks = b->next_; in PrintMemInfo()
117 b->next_ = all_blocks; in AddMem()
139 while (*b != NULL && (*b)->ptr_ != ptr) b = &(*b)->next_; in SubMem()
146 *b = block->next_; in SubMem()
|
| /external/v8/src/compiler/ |
| D | register-allocator.h | 120 : start_(start), end_(end), next_(NULL) { in UseInterval()
126 UseInterval* next() const { return next_; } in next()
145 void set_next(UseInterval* next) { next_ = next; } in set_next()
149 UseInterval* next_; variable
167 UsePosition* next() const { return next_; } in next()
169 void set_next(UsePosition* next) { next_ = next; } in set_next()
174 UsePosition* next_; variable
191 LiveRange* next() const { return next_; } in next()
307 LiveRange* next_; variable
|
| D | value-numbering-reducer.cc | 38 Entry(Node* node, Entry* next) : node_(node), next_(next) {} in Entry()
41 Entry* next() const { return next_; } in next()
45 Entry* next_; member in v8::internal::compiler::FINAL
|