/external/chromium/sdch/open-vcdiff/src/gtest/src/ |
gtest-internal-inl.h | 163 ListNode * next_; member in class:testing::internal::ListNode 173 explicit ListNode(const E & element) : element_(element), next_(NULL) {} 185 ListNode * next() { return next_; } 186 const ListNode * next() const { return next_; } 245 last_->next_ = new_node; 259 new_node->next_ = head_; 281 head_ = head_->next_; 299 new_node->next_ = node->next_; 300 node->next_ = new_node [all...] |
/external/chromium_org/third_party/leveldatabase/src/db/ |
skiplist.h | 155 return reinterpret_cast<Node*>(next_[n].Acquire_Load()); 161 next_[n].Release_Store(x); 167 return reinterpret_cast<Node*>(next_[n].NoBarrier_Load()); 171 next_[n].NoBarrier_Store(x); 175 // Array of length equal to the node height. next_[0] is lowest level link. 176 port::AtomicPointer next_[1]; member in struct:leveldb::SkipList::Node
|
version_set.h | 118 Version* next_; // Next version in linked list member in class:leveldb::Version 136 : vset_(vset), next_(this), prev_(this), refs_(0),
|
/external/chromium_org/third_party/libwebp/demux/ |
demux.c | 56 struct Frame* next_; member in struct:Frame 61 struct Chunk* next_; member in struct:Chunk 181 while (*c != NULL) c = &(*c)->next_; 183 chunk->next_ = NULL; 193 frame->next_ = NULL; 194 dmux->frames_tail_ = &frame->next_; 630 for (f = dmux->frames_; f != NULL; f = f->next_) { 636 for (; f != NULL && f->frame_num_ == cur_frame_set; f = f->next_) { 660 if (f->next_ != NULL) return 0; 738 f = f->next_; [all...] |
/external/webp/src/demux/ |
demux.c | 58 struct Frame* next_; member in struct:Frame 63 struct Chunk* next_; member in struct:Chunk 183 while (*c != NULL) c = &(*c)->next_; 185 chunk->next_ = NULL; 195 frame->next_ = NULL; 196 dmux->frames_tail_ = &frame->next_; 630 for (f = dmux->frames_; f != NULL; f = f->next_) { 636 for (; f != NULL && f->frame_num_ == cur_frame_set; f = f->next_) { 660 if (f->next_ != NULL) return 0; 738 f = f->next_; [all...] |
/external/chromium/third_party/libjingle/source/talk/base/ |
flags.h | 146 Flag* next() const { return next_; } 161 Flag* next_; member in class:Flag 163 friend class FlagList; // accesses next_
|
/external/chromium_org/third_party/libjingle/source/talk/base/ |
flags.h | 149 Flag* next() const { return next_; } 164 Flag* next_; member in class:Flag 166 friend class FlagList; // accesses next_
|
/art/compiler/dex/ |
arena_allocator.h | 60 Arena* next_; member in class:art::Arena
|
/external/chromium_org/tools/memory_watcher/ |
call_stack.cc | 385 freelist_ = freelist_->next_; 386 stack->next_ = NULL; 396 DCHECK(stack->next_ == NULL); 397 stack->next_ = freelist_;
|
/external/v8/src/ |
property.cc | 38 current = current->next_;
|
isolate.cc | 246 ASSERT(free_list_.next_ == &free_list_); 250 free_list_.next_ = free_list_.previous_ = free_chunk; 251 free_chunk->next_ = free_chunk->previous_ = &free_list_; 261 ASSERT(free_list_.next_ != &free_list_); 266 for (PreallocatedStorage* storage = free_list_.next_; 268 storage = storage->next_) { 276 for (PreallocatedStorage* storage = free_list_.next_; 278 storage = storage->next_) { 309 ASSERT(storage->next_->previous_ == storage); 310 ASSERT(storage->previous_->next_ == storage) [all...] |
mark-compact.h | 283 : idx_(0), chain_length_(1), next_(next_buffer) { 284 if (next_ != NULL) { 285 chain_length_ = next_->chain_length_ + 1; 311 SlotsBuffer* next() { return next_; } 381 SlotsBuffer* next_; member in class:v8::internal::SlotsBuffer
|
property.h | 197 next_(isolate->top_lookup_result()), 207 isolate_->SetTopLookupResult(next_); 388 LookupResult* next_; member in class:v8::internal::BASE_EMBEDDED
|
liveobjectlist.h | 167 LiveObjectList* next() { return next_; } 201 LiveObjectList* next_; member in class:v8::internal::LiveObjectList
|
/external/chromium_org/v8/src/ |
isolate.cc | 270 ASSERT(free_list_.next_ == &free_list_); 274 free_list_.next_ = free_list_.previous_ = free_chunk; 275 free_chunk->next_ = free_chunk->previous_ = &free_list_; 285 ASSERT(free_list_.next_ != &free_list_); 290 for (PreallocatedStorage* storage = free_list_.next_; 292 storage = storage->next_) { 300 for (PreallocatedStorage* storage = free_list_.next_; 302 storage = storage->next_) { 333 ASSERT(storage->next_->previous_ == storage); 334 ASSERT(storage->previous_->next_ == storage) [all...] |
mark-compact.h | 283 : idx_(0), chain_length_(1), next_(next_buffer) { 284 if (next_ != NULL) { 285 chain_length_ = next_->chain_length_ + 1; 331 SlotsBuffer* next() { return next_; } 401 SlotsBuffer* next_; member in class:v8::internal::SlotsBuffer
|
/external/chromium_org/chrome/browser/sync_file_system/local/ |
local_file_sync_service.h | 159 Map::iterator next_; member in class:sync_file_system::LocalFileSyncService::OriginChangeMap
|
/external/chromium_org/third_party/tcmalloc/chromium/src/windows/ |
preamble_patcher.h | 335 PreamblePage* next_; member in struct:sidestep::PreamblePatcher::PreamblePage
|
/external/chromium_org/third_party/tcmalloc/vendor/src/windows/ |
preamble_patcher.h | 335 PreamblePage* next_; member in struct:sidestep::PreamblePatcher::PreamblePage
|
/external/chromium/base/ |
tracked_objects.h | 501 ThreadData* next() const { return next_; } 591 ThreadData* next_; member in class:tracked_objects::ThreadData
|
/external/chromium_org/ppapi/tests/ |
test_case.h | 260 : next_(head_), 269 TestCaseFactory* next_; member in class:TestCaseFactory
|
testing_instance.cc | 236 iter = iter->next_; 259 iter = iter->next_;
|
/external/chromium_org/base/ |
tracked_objects.cc | 238 : next_(NULL), 248 : next_(NULL), 267 DCHECK(!next_); 270 next_ = all_thread_data_list_head_; 280 ThreadData* ThreadData::next() const { return next_; }
|
/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_allocator.h | 229 AllocatorStats *next_; member in class:__sanitizer::AllocatorStats 239 next_ = this; 245 s->next_ = next_; 247 next_->prev_ = s; 248 next_ = s; 253 s->prev_->next_ = s->next_; 254 s->next_->prev_ = s->prev_; 266 stats = stats->next_; [all...] |
/external/chromium_org/third_party/re2/re2/ |
dfa.cc | 96 // States, linked by the next_ pointers. If in state s and reading 97 // byte c, the next state should be s->next_[c]. 107 State** next_; // Outgoing arrows from State, member in struct:re2::DFA::State 768 s->next_ = reinterpret_cast<State**>(s + 1); 769 s->inst_ = reinterpret_cast<int*>(s->next_ + nnext); 770 memset(s->next_, 0, nnext*sizeof s->next_[0]); [all...] |