Searched refs:next_ (Results 1 - 25 of 115) sorted by last modified time

12345

/external/webrtc/src/system_wrappers/interface/
H A Dlist_wrapper.h31 ListItem* next_; member in class:webrtc::ListItem
/external/webrtc/src/system_wrappers/source/
H A Dlist_no_stl.cc18 : 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...]
H A Dlist_no_stl.h29 ListNoStlItem* next_; member in class:webrtc::ListNoStlItem
H A Dmap_no_stl.cc18 : 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_
[all...]
H A Dmap_no_stl.h32 MapNoStlItem* next_; member in class:webrtc::MapNoStlItem
/external/vixl/test/
H A Dcctest.cc54 : name_(name), callback_(callback), next_(NULL) {
60 last_->next_ = this;
H A Dcctest.h46 Cctest* next() { return next_; }
69 Cctest* next_; member in class:vixl::Cctest
/external/webp/src/demux/
H A Ddemux.c54 struct Frame* next_; member in struct:Frame
59 struct Chunk* next_; member in struct:Chunk
180 chunk->next_ = NULL;
181 dmux->chunks_tail_ = &chunk->next_;
191 frame->next_ = NULL;
192 dmux->frames_tail_ = &frame->next_;
648 for (; f != NULL && f->frame_num_ == cur_frame_set; f = f->next_) {
674 if (f->next_ != NULL) return 0;
763 f = f->next_;
768 c = c->next_;
[all...]
/external/webp/src/enc/
H A Dbackward_references.c75 PixOrCopyBlock* next_; // next block (or NULL) member in struct:PixOrCopyBlock
95 PixOrCopyBlock* const next = refs->free_blocks_->next_;
123 PixOrCopyBlock* const b = c->cur_block_->next_;
142 refs->free_blocks_ = b->next_;
145 refs->tail_ = &b->next_;
147 b->next_ = NULL;
172 b = b->next_;
H A Dtoken.c37 VP8Tokens* next_; // pointer to next page member in struct:VP8Tokens
39 // Token data is located in memory just after the next_ field.
58 const VP8Tokens* const next = p->next_;
76 page->next_ = NULL;
79 b->last_page_ = &page->next_;
206 const int N = (p->next_ == NULL) ? b->left_ : 0;
215 p = p->next_;
230 const VP8Tokens* const next = p->next_;
256 const VP8Tokens* const next = p->next_;
/external/webp/src/utils/
H A Dutils.c61 MemBlock* next_; member in struct:MemBlock
82 all_blocks = b->next_;
117 b->next_ = all_blocks;
139 while (*b != NULL && (*b)->ptr_ != ptr) b = &(*b)->next_;
146 *b = block->next_;
/external/regex-re2/re2/
H A Ddfa.cc94 // States, linked by the next_ pointers. If in state s and reading
95 // byte c, the next state should be s->next_[c].
105 State** next_; // Outgoing arrows from State, member in struct:re2::DFA::State
766 s->next_ = reinterpret_cast<State**>(s + 1);
767 s->inst_ = reinterpret_cast<int*>(s->next_ + nnext);
768 memset(s->next_, 0, nnext*sizeof s->next_[0]);
992 State* ns = state->next_[ByteMap(c)];
1059 // Write barrier before updating state->next_ so that the
1063 // a) the access to next_ shoul
[all...]
/external/protobuf/gtest/include/gtest/internal/
H A Dgtest-linked_ptr.h93 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_
132 mutable linked_ptr_internal const* next_; member in class:testing::internal::linked_ptr_internal
[all...]
/external/protobuf/gtest/samples/
H A Dsample3-inl.h57 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/mesa3d/src/gtest/include/gtest/internal/
H A Dgtest-linked_ptr.h93 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_
132 mutable linked_ptr_internal const* next_; member in class:testing::internal::linked_ptr_internal
[all...]
/external/llvm/utils/unittest/googletest/include/gtest/internal/
H A Dgtest-linked_ptr.h93 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_
132 mutable linked_ptr_internal const* next_; member in class:testing::internal::linked_ptr_internal
[all...]
/external/libvpx/libvpx/third_party/googletest/src/include/gtest/
H A Dgtest.h9053 next_ = this;
9073 while (p->next_ != ptr) p = p->next_;
9074 p->next_ = this;
9075 next_ = ptr;
9084 if (next_ == this) return true;
9085 linked_ptr_internal const* p = next_;
9086 while (p->next_ != this) p = p->next_;
9087 p->next_
9092 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/
H A Dindex.pass.cpp22 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/
H A Dindex.fail.cpp22 static int next_; member in class:A
24 A() : state_(++next_) {}
33 int A::next_ = 0; member in class:A
/external/jsoncpp/chromium-overrides/include/json/
H A Dvalue.h636 * \internal previous_ & next_ allows for bidirectional traversal.
654 ValueInternalLink *next_; member in class:Json::ValueInternalLink
/external/jsoncpp/include/json/
H A Dvalue.h636 * \internal previous_ & next_ allows for bidirectional traversal.
654 ValueInternalLink *next_; member in class:Json::ValueInternalLink
/external/jsoncpp/src/lib_json/
H A Djson_batchallocator.h48 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/jsoncpp/src/test_lib_json/
H A Djsontest.cpp84 rootPredicateNode_.next_ = 0;
101 PredicateContext *lastNode = rootPredicateNode_.next_;
102 for ( ; lastNode != 0; lastNode = lastNode->next_ )
143 while ( lastNode->next_ != 0 && lastNode->next_->next_ != 0 )
145 lastNode = lastNode->next_;
148 PredicateContext *tail = lastNode->next_;
155 lastNode->next_ = 0;
172 while ( lastNode->next_ !
[all...]
H A Djsontest.h55 PredicateContext *next_; member in struct:JsonTest::PredicateContext
227 result_->predicateStackTail_->next_ = &_minitest_Context; \
/external/gtest/include/gtest/internal/
H A Dgtest-linked_ptr.h93 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_
132 mutable linked_ptr_internal const* next_; member in class:testing::internal::linked_ptr_internal
[all...]

Completed in 522 milliseconds

12345