Searched refs:next_ (Results 1 – 10 of 10) sorted by relevance
61 top_arena_->next_ = nullptr; in AllocateFromNextArena()62 } else if (top_arena_->next_ != nullptr && top_arena_->next_->Size() >= allocation_size) { in AllocateFromNextArena()63 top_arena_ = top_arena_->next_; in AllocateFromNextArena()65 Arena* tail = top_arena_->next_; in AllocateFromNextArena()66 top_arena_->next_ = stats_and_pool_.pool->AllocArena(allocation_size); in AllocateFromNextArena()67 top_arena_ = top_arena_->next_; in AllocateFromNextArena()68 top_arena_->next_ = tail; in AllocateFromNextArena()
88 for (const Arena* arena = first; arena != nullptr; arena = arena->next_) { in Dump()117 next_(nullptr) { in Arena()158 free_arenas_ = free_arenas_->next_; in ~ArenaPool()170 free_arenas_ = free_arenas_->next_; in AllocArena()183 for (Arena* arena = free_arenas_; arena != nullptr; arena = arena->next_) { in GetBytesAllocated()191 for (Arena* arena = first; arena != nullptr; arena = arena->next_) { in FreeArenaChain()197 while (last->next_ != nullptr) { in FreeArenaChain()198 last = last->next_; in FreeArenaChain()202 last->next_ = free_arenas_; in FreeArenaChain()257 new_arena->next_ = arena_head_; in ObtainNewArenaForAllocation()
153 SlowPath() : next_(NULL) {} in SlowPath()167 SlowPath *next_; variable217 for ( ; cur->next_ != NULL ; cur = cur->next_) {} in EnqueueSlowPath()218 cur->next_ = slowpath; in EnqueueSlowPath()228 next = cur->next_; in EmitSlowPaths()
136 Arena* next_; variable
55 LiveRange(size_t start, size_t end, LiveRange* next) : start_(start), end_(end), next_(next) { in LiveRange()57 DCHECK(next_ == nullptr || next_->GetStart() > GetEnd()); in LiveRange()62 LiveRange* GetNext() const { return next_; } in GetNext()80 LiveRange* next_; variable101 next_(next) { in UsePosition()103 DCHECK(next_ == nullptr || next->GetPosition() >= GetPosition()); in UsePosition()108 UsePosition* GetNext() const { return next_; } in GetNext()125 UsePosition* const next_; variable367 current = current->next_; in SplitAt()376 previous->next_ = nullptr; in SplitAt()[all …]
298 instruction->next_ = cursor; in InsertInstructionBefore()304 instruction->previous_->next_ = instruction; in InsertInstructionBefore()371 last_instruction_->next_ = instruction; in AddInstruction()382 instruction->previous_->next_ = instruction->next_; in RemoveInstruction()384 if (instruction->next_ != nullptr) { in RemoveInstruction()385 instruction->next_->previous_ = instruction->previous_; in RemoveInstruction()388 first_instruction_ = instruction->next_; in RemoveInstruction()
484 next_(nullptr), in HInstruction()497 HInstruction* GetNext() const { return next_; } in GetNext()580 HInstruction* next_; variable691 next_ = Done() ? nullptr : instruction_->GetNext(); in HInstructionIterator()697 instruction_ = next_; in Advance()698 next_ = Done() ? nullptr : instruction_->GetNext(); in Advance()703 HInstruction* next_; variable712 next_ = Done() ? nullptr : instruction_->GetPrevious(); in HBackwardInstructionIterator()718 instruction_ = next_; in Advance()719 next_ = Done() ? nullptr : instruction_->GetPrevious(); in Advance()[all …]
43 JITCodeEntry* next_; member78 entry->next_ = __jit_debug_descriptor.first_entry_; in CreateCodeEntry()79 if (entry->next_ != nullptr) { in CreateCodeEntry()80 entry->next_->prev_ = entry; in CreateCodeEntry()94 entry->prev_->next_ = entry->next_; in UnregisterCodeEntry()96 __jit_debug_descriptor.first_entry_ = entry->next_; in UnregisterCodeEntry()99 if (entry->next_ != nullptr) { in UnregisterCodeEntry()100 entry->next_->prev_ = entry->prev_; in UnregisterCodeEntry()
593 offsets.push_back(CheckOffset(OFFSETOF_MEMBER(mirror::FinalizerReference, next_), "next")); in FinalizerReferenceOffsets()
141 HeapReference<FinalizerReference> next_;