Home
last modified time | relevance | path

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

123

/external/chromium/base/
Dlinked_list.h86 LinkNode() : previous_(0), next_(0) {} in LinkNode()
88 : previous_(previous), next_(next) {} in LinkNode()
92 this->next_ = e; in InsertBefore()
94 e->previous_->next_ = this; in InsertBefore()
100 this->next_ = e->next_; in InsertAfter()
102 e->next_->previous_ = this; in InsertAfter()
103 e->next_ = this; in InsertAfter()
108 this->previous_->next_ = this->next_; in RemoveFromList()
109 this->next_->previous_ = this->previous_; in RemoveFromList()
117 return next_; in next()
[all …]
/external/webrtc/src/system_wrappers/source/
Dlist_no_stl.cc18 : 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 …]
Dmap_no_stl.cc18 : 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/chromium/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/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/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/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/chromium/base/memory/
Dlinked_ptr.h54 next_ = this; in join_new()
59 next_ = ptr->next_; in join()
60 ptr->next_ = this; in join()
66 if (next_ == this) return true; in depart()
67 linked_ptr_internal const* p = next_; in depart()
68 while (p->next_ != this) p = p->next_; in depart()
69 p->next_ = next_; in depart()
74 mutable linked_ptr_internal const* next_;
/external/v8/src/
Dallocation.cc105 next_ = other->next_; in LinkTo()
106 other->next_->previous_ = this; in LinkTo()
108 other->next_ = this; in LinkTo()
113 next_->previous_ = previous_; in Unlink()
114 previous_->next_ = next_; in Unlink()
120 previous_ = next_ = this; in PreallocatedStorage()
Dscanner.h367 Token::Value peek() const { return next_.token; } in peek()
369 Location peek_location() const { return next_.location; } in peek_location()
374 ASSERT_NOT_NULL(next_.literal_chars); in next_literal_ascii_string()
375 return next_.literal_chars->ascii_literal(); in next_literal_ascii_string()
378 ASSERT_NOT_NULL(next_.literal_chars); in next_literal_utf16_string()
379 return next_.literal_chars->utf16_literal(); in next_literal_utf16_string()
382 ASSERT_NOT_NULL(next_.literal_chars); in is_next_literal_ascii()
383 return next_.literal_chars->is_ascii(); in is_next_literal_ascii()
386 ASSERT_NOT_NULL(next_.literal_chars); in next_literal_length()
387 return next_.literal_chars->length(); in next_literal_length()
[all …]
Dv8threads.cc241 next_(this), in ThreadState()
253 next_->previous_ = previous_; in Unlink()
254 previous_->next_ = next_; in Unlink()
262 next_ = flying_anchor->next_; in LinkInto()
264 flying_anchor->next_ = this; in LinkInto()
265 next_->previous_ = this; in LinkInto()
270 ThreadState* gotten = free_anchor_->next_; in GetFreeThreadState()
287 if (next_ == thread_manager_->in_use_anchor_) return NULL; in Next()
288 return next_; in Next()
Dd8-debug.h131 : type_(type), data_(data), next_(NULL) { in RemoteDebuggerEvent()
143 void set_next(RemoteDebuggerEvent* event) { next_ = event; } in set_next()
144 RemoteDebuggerEvent* next() { return next_; } in next()
148 RemoteDebuggerEvent* next_; variable
Dscanner.cc225 current_ = next_; in Next()
232 next_.token = token; in Next()
233 next_.location.beg_pos = pos; in Next()
234 next_.location.end_pos = pos + 1; in Next()
354 next_.literal_chars = NULL; in Scan()
358 next_.location.beg_pos = source_pos(); in Scan()
588 next_.location.end_pos = source_pos(); in Scan()
589 next_.token = token; in Scan()
596 if (pos == next_.location.beg_pos) return; in SeekForward()
598 ASSERT_EQ(next_.location.end_pos, current_pos); in SeekForward()
[all …]
Ddateparser.h261 : in_(in), next_(Scan()) { } in DateStringTokenizer()
263 DateToken result = next_; in Next()
264 next_ = Scan(); in Next()
269 return next_; in Peek()
272 if (next_.IsSymbol(symbol)) { in SkipSymbol()
273 next_ = Scan(); in SkipSymbol()
283 DateToken next_; variable
Dzone.cc46 next_ = next; in Initialize()
50 Segment* next() const { return next_; } in next()
51 void clear_next() { next_ = NULL; } in clear_next()
65 Segment* next_; member in v8::internal::Segment
Dlithium-allocator.h209 : start_(start), end_(end), next_(NULL) { in UseInterval()
215 UseInterval* next() const { return next_; } in next()
235 void set_next(UseInterval* next) { next_ = next; } in set_next()
239 UseInterval* next_; variable
259 UsePosition* next() const { return next_; } in next()
262 void set_next(UsePosition* next) { next_ = next; } in set_next()
267 UsePosition* next_; variable
286 LiveRange* next() const { return next_; } in next()
393 LiveRange* next_; variable
/external/chromium/base/synchronization/
Dcondition_variable_win.cc173 next_ = prev_ = this; // Self referencing circular. in Event()
211 other->next_ = this; in PushBack()
213 prev_->next_ = other; in PushBack()
221 return next_->Extract(); in PopFront()
242 next_->prev_ = prev_; in Extract()
243 prev_->next_ = next_; in Extract()
245 prev_ = next_ = this; in Extract()
254 return next_ == this; in IsSingleton()
274 return (next_->prev_ == this) && (prev_->next_ == this); in ValidateLinks()
/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 & element) : element_(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/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/chromium/testing/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/chromium/third_party/libjingle/source/talk/base/
Dautodetectproxy.cc42 : agent_(user_agent), socket_(NULL), next_(0) { in AutoDetectProxy()
83 if (TEST_ORDER[next_] >= PROXY_UNKNOWN) { in Next()
123 switch (TEST_ORDER[next_]) { in OnConnectEvent()
142 LOG(LS_VERBOSE) << "AutoDetectProxy probing type " << TEST_ORDER[next_] in OnConnectEvent()
155 switch (TEST_ORDER[next_]) { in OnReadEvent()
177 ++next_; in OnReadEvent()
183 ++next_; in OnCloseEvent()
/external/chromium/chrome/browser/policy/
Dconfiguration_policy_store_interface.h59 : next_(next), in ObservingPolicyStoreInterface()
70 ConfigurationPolicyStoreInterface* next_;
82 : next_(next), in FilteringPolicyStoreInterface()
89 ConfigurationPolicyStoreInterface* next_;
Dconfiguration_policy_store_interface.cc26 next_->Apply(policy, value); in Apply()
36 next_->Apply(policy, value); in Apply()
/external/valgrind/tsan/
Dsuppressions.cc65 : buffer_(str), next_(buffer_.c_str()), in Parser()
74 bool Eof() { return next_ >= end_; } in Eof()
86 const char* next_; member in Parser
119 const char* first = next_; in NextLine()
120 while (!Eof() && *next_ != '\n') { in NextLine()
121 ++next_; in NextLine()
123 string line(first, next_ - first); in NextLine()
124 if (*next_ == '\n') { in NextLine()
125 ++next_; in NextLine()
/external/chromium/sdch/open-vcdiff/src/gtest/src/
Dgtest-internal-inl.h163 ListNode * next_; variable
173 explicit ListNode(const E & element) : element_(element), next_(NULL) {} in ListNode()
185 ListNode * next() { return next_; } in next()
186 const ListNode * next() const { return next_; } in next()
245 last_->next_ = new_node; in PushBack()
259 new_node->next_ = head_; in PushFront()
281 head_ = head_->next_; in PopFront()
299 new_node->next_ = node->next_; in InsertAfter()
300 node->next_ = new_node; in InsertAfter()

123