Searched refs:next_ (Results 1 - 11 of 11) sorted by relevance

/art/runtime/base/
H A Dscoped_arena_allocator.cc61 top_arena_->next_ = nullptr;
62 } else if (top_arena_->next_ != nullptr && top_arena_->next_->Size() >= allocation_size) {
63 top_arena_ = top_arena_->next_;
65 Arena* tail = top_arena_->next_;
66 top_arena_->next_ = stats_and_pool_.pool->AllocArena(allocation_size);
67 top_arena_ = top_arena_->next_;
68 top_arena_->next_ = tail;
H A Darena_allocator.cc98 for (const Arena* arena = first; arena != nullptr; arena = arena->next_) {
124 Arena::Arena() : bytes_allocated_(0), next_(nullptr) {
177 free_arenas_ = free_arenas_->next_;
189 free_arenas_ = free_arenas_->next_;
204 for (auto* arena = free_arenas_; arena != nullptr; arena = arena->next_) {
213 for (Arena* arena = free_arenas_; arena != nullptr; arena = arena->next_) {
221 for (Arena* arena = first; arena != nullptr; arena = arena->next_) {
227 while (last->next_ != nullptr) {
228 last = last->next_;
232 last->next_
[all...]
H A Darena_allocator.h154 Arena* next_; member in class:art::Arena
/art/compiler/optimizing/
H A Dssa_liveness_analysis.h60 LiveRange(size_t start, size_t end, LiveRange* next) : start_(start), end_(end), next_(next) {
62 DCHECK(next_ == nullptr || next_->GetStart() > GetEnd());
67 LiveRange* GetNext() const { return next_; }
84 start_, end_, next_ == nullptr ? nullptr : next_->Dup(allocator));
88 return next_ == nullptr ? this : next_->GetLastRange();
94 LiveRange* next_; member in class:art::FINAL
115 next_(nex
165 UsePosition* next_; member in class:art::UsePosition
198 SafepointPosition* next_; member in class:art::SafepointPosition
[all...]
H A Dnodes.cc627 last_instruction_->next_ = instruction;
637 instruction->next_ = cursor;
641 instruction->next_ = cursor;
643 instruction->previous_->next_ = instruction;
650 cursor->next_ = instruction;
654 instruction->next_ = cursor->next_;
656 cursor->next_ = instruction;
657 instruction->next_->previous_ = instruction;
663 instruction->previous_->next_
[all...]
H A Dgvn.cc149 : instruction_(instruction), hash_code_(hash_code), next_(next) {}
153 Node* GetNext() const { return next_; }
154 void SetNext(Node* node) { next_ = node; }
163 Node* next_; member in class:art::ValueSet::Node
H A Dnodes.h901 HUseListNode* GetNext() const { return next_; }
908 : user_(user), index_(index), prev_(nullptr), next_(nullptr) {}
913 HUseListNode<T>* next_; member in class:art::HUseListNode
937 new_node->next_ = first_;
952 node->prev_->next_ = node->next_;
954 if (node->next_ != nullptr) {
955 node->next_->prev_ = node->prev_;
958 first_ = node->next_;
979 return first_ != nullptr && first_->next_
1537 HInstruction* next_; member in class:art::HInstruction
1614 HInstruction* next_; member in class:art::HInstructionIterator
1635 HInstruction* next_; member in class:art::HBackwardInstructionIterator
[all...]
/art/compiler/utils/
H A Dassembler.h159 SlowPath() : next_(nullptr) {}
173 SlowPath *next_; member in class:art::SlowPath
223 for ( ; cur->next_ != nullptr ; cur = cur->next_) {}
224 cur->next_ = slowpath;
234 next = cur->next_;
/art/runtime/mirror/
H A Dreference.h141 HeapReference<FinalizerReference> next_; member in class:art::mirror::FinalizerReference
/art/runtime/
H A Delf_file.cc46 JITCodeEntry* next_; member in struct:art::JITCodeEntry
82 entry->next_ = __jit_debug_descriptor.first_entry_;
83 if (entry->next_ != nullptr) {
84 entry->next_->prev_ = entry;
98 entry->prev_->next_ = entry->next_;
100 __jit_debug_descriptor.first_entry_ = entry->next_;
103 if (entry->next_ != nullptr) {
104 entry->next_->prev_ = entry->prev_;
H A Dclass_linker_test.cc589 addOffset(OFFSETOF_MEMBER(mirror::FinalizerReference, next_), "next");

Completed in 245 milliseconds