Home
last modified time | relevance | path

Searched refs:next_ (Results 1 – 25 of 90) sorted by relevance

1234

/external/libchrome/base/containers/
Dlinked_list.h87 LinkNode() : previous_(NULL), next_(NULL) {} in LinkNode()
89 : previous_(previous), next_(next) {} in LinkNode()
93 this->next_ = e; in InsertBefore()
95 e->previous_->next_ = this; in InsertBefore()
101 this->next_ = e->next_; in InsertAfter()
103 e->next_->previous_ = this; in InsertAfter()
104 e->next_ = this; in InsertAfter()
109 this->previous_->next_ = this->next_; in RemoveFromList()
110 this->next_->previous_ = this->previous_; in RemoveFromList()
113 this->next_ = NULL; in RemoveFromList()
[all …]
/external/parameter-framework/asio-1.10.6/include/asio/detail/impl/
Dtimer_queue_set.ipp30 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 …]
Dservice_registry.ipp34 service = service->next_;
40 asio::io_service::service* next_service = first_service_->next_;
58 service = service->next_;
112 service = service->next_;
130 service = service->next_;
134 new_service.ptr_->next_ = first_service_;
155 service = service->next_;
160 new_service->next_ = first_service_;
174 service = service->next_;
/external/google-breakpad/src/processor/
Dlinked_ptr.h69 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/google-breakpad/src/testing/gtest/include/gtest/internal/
Dgtest-linked_ptr.h93 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/mesa3d/src/gtest/include/gtest/internal/
Dgtest-linked_ptr.h93 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/
Dgtest-linked_ptr.h93 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/
Dgtest-linked_ptr.h93 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/vulkan-validation-layers/tests/gtest-1.7.0/include/gtest/internal/
Dgtest-linked_ptr.h93 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/
Dgtest-linked_ptr.h93 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/
Dlinked_ptr.h49 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/parameter-framework/asio-1.10.6/include/asio/detail/
Dcall_stack.hpp38 next_(call_stack<Key, Value>::top_) in context()
48 next_(call_stack<Key, Value>::top_) in context()
56 call_stack<Key, Value>::top_ = next_; in ~context()
62 context* elem = next_; in next_by_key()
67 elem = elem->next_; in next_by_key()
82 context* next_; member in asio::detail::call_stack::context
96 elem = elem->next_; in contains()
/external/v8/src/crankshaft/
Dhydrogen-load-elimination.cc25 HFieldApproximation* next_; member in v8::internal::HFieldApproximation
32 copy->next_ = this->next_ == NULL ? NULL : this->next_->Copy(zone); in Copy()
177 prev->next_ = approx->next_; in Merge()
179 fields_[i] = approx->next_; in Merge()
181 approx = approx->next_; in Merge()
185 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 …]
/external/v8/src/parsing/
Dscanner.h381 Token::Value peek() const { return next_.token; } in peek()
383 Location peek_location() const { return next_.location; } in peek_location()
389 return LiteralContainsEscapes(next_); in next_literal_contains_escapes()
396 DCHECK_NOT_NULL(next_.literal_chars); in is_next_contextual_keyword()
397 return next_.literal_chars->is_contextual_keyword(keyword); in is_next_contextual_keyword()
551 next_.literal_chars = free_buffer; in StartLiteral()
562 next_.raw_literal_chars = free_buffer; in StartRawLiteral()
566 DCHECK_NOT_NULL(next_.literal_chars); in INLINE()
567 next_.literal_chars->AddChar(c); in INLINE()
571 DCHECK_NOT_NULL(next_.literal_chars); in INLINE()
[all …]
Dscanner.cc245 if (next_.token == Token::EOS) { in Next()
246 next_.location.beg_pos = current_.location.beg_pos; in Next()
247 next_.location.end_pos = current_.location.end_pos; in Next()
249 current_ = next_; in Next()
251 next_ = next_next_; in Next()
262 next_.token = token; in Next()
263 next_.location.beg_pos = pos; in Next()
264 next_.location.end_pos = pos + 1; in Next()
285 Token::Value ret = next_.token; in PeekAhead()
286 next_next_ = next_; in PeekAhead()
[all …]
/external/v8/src/
Dfutex-emulation.cc45 DCHECK(node->prev_ == nullptr && node->next_ == nullptr); in AddNode()
47 tail_->next_ = node; in AddNode()
53 node->next_ = nullptr; in AddNode()
60 node->prev_->next_ = node->next_; in RemoveNode()
62 head_ = node->next_; in RemoveNode()
65 if (node->next_) { in RemoveNode()
66 node->next_->prev_ = node->prev_; in RemoveNode()
71 node->prev_ = node->next_ = nullptr; in RemoveNode()
209 node = node->next_; in Wake()
247 node = node->next_; in WakeOrRequeue()
[all …]
Dv8threads.cc181 next_(this), in ThreadState()
198 next_->previous_ = previous_; in Unlink()
199 previous_->next_ = next_; in Unlink()
207 next_ = flying_anchor->next_; in LinkInto()
209 flying_anchor->next_ = this; in LinkInto()
210 next_->previous_ = this; in LinkInto()
215 ThreadState* gotten = free_anchor_->next_; in GetFreeThreadState()
232 if (next_ == thread_manager_->in_use_anchor_) return NULL; in Next()
233 return next_; in Next()
259 for (ThreadState* current = anchor->next_; current != anchor;) { in DeleteThreadStateList()
[all …]
/external/v8/src/interpreter/
Dbytecode-register-optimizer.cc22 next_(this), in RegisterInfo()
68 RegisterInfo* next_; member in v8::internal::interpreter::BytecodeRegisterOptimizer::RegisterInfo
78 next_->prev_ = prev_; in AddToEquivalenceSetOf()
79 prev_->next_ = next_; in AddToEquivalenceSetOf()
81 next_ = info->next_; in AddToEquivalenceSetOf()
83 prev_->next_ = this; in AddToEquivalenceSetOf()
84 next_->prev_ = this; in AddToEquivalenceSetOf()
91 next_->prev_ = prev_; in MoveToNewEquivalenceSet()
92 prev_->next_ = next_; in MoveToNewEquivalenceSet()
93 next_ = prev_ = this; in MoveToNewEquivalenceSet()
[all …]
/external/google-breakpad/src/testing/gtest/samples/
Dsample3-inl.h57 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/vulkan-validation-layers/tests/gtest-1.7.0/samples/
Dsample3-inl.h57 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/protobuf/gtest/samples/
Dsample3-inl.h57 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/jsoncpp/src/lib_json/
Djson_batchallocator.h45 BatchInfo* nextBatch = batch->next_; in ~BatchAllocator()
62 currentBatch_ = currentBatch_->next_; in allocate()
64 currentBatch_ = currentBatch_->next_; in allocate()
69 currentBatch_->next_ = batches_; // insert at the head of the list in allocate()
89 BatchInfo* next_; member
104 batch->next_ = 0; in allocateBatch()
/external/v8/src/base/platform/
Dcondition-variable.cc142 Event* next_;
153 freelist_ = event->next_;
165 freelist_ = event->next_;
174 for (Event* we = waitlist_; we != NULL; we = we->next_) {
180 event->next_ = waitlist_;
191 for (Event** wep = &waitlist_;; wep = &(*wep)->next_) {
194 *wep = event->next_;
201 for (Event* fe = freelist_; fe != NULL; fe = fe->next_) {
212 event->next_ = freelist_;
239 event = event->next_) {
[all …]
/external/jsoncpp/src/test_lib_json/
Djsontest.cpp80 rootPredicateNode_.next_ = 0; in TestResult()
91 PredicateContext* lastNode = rootPredicateNode_.next_; in addFailure()
92 for (; lastNode != 0; lastNode = lastNode->next_) { in addFailure()
127 while (lastNode->next_ != 0 && lastNode->next_->next_ != 0) { in popPredicateContext()
128 lastNode = lastNode->next_; in popPredicateContext()
131 PredicateContext* tail = lastNode->next_; in popPredicateContext()
137 lastNode->next_ = 0; in popPredicateContext()
146 while (lastNode->next_ != 0) { in getAssertionNestingLevel()
147 lastNode = lastNode->next_; in getAssertionNestingLevel()
/external/webrtc/webrtc/base/
Dautodetectproxy.cc32 : agent_(user_agent), resolver_(NULL), socket_(NULL), next_(0) { in AutoDetectProxy()
92 int next = next_; in OnMessage()
153 if (TEST_ORDER[next_] >= PROXY_UNKNOWN) { in Next()
224 switch (TEST_ORDER[next_]) { in OnConnectEvent()
243 LOG(LS_VERBOSE) << "AutoDetectProxy probing type " << TEST_ORDER[next_] in OnConnectEvent()
256 switch (TEST_ORDER[next_]) { in OnReadEvent()
278 ++next_; in OnReadEvent()
284 ++next_; in OnCloseEvent()

1234