Home
last modified time | relevance | path

Searched refs:stack_ (Results 1 – 6 of 6) sorted by relevance

/art/runtime/gc/
Dallocation_record.h81 stack_(std::move(r.stack_)) {} in AllocRecordStackTrace()
85 stack_(r.stack_) {} in AllocRecordStackTrace()
96 return stack_.size(); in GetDepth()
101 return stack_[index]; in GetStackElement()
105 stack_.push_back(element); in AddStackElement()
109 DCHECK_LT(index, stack_.size()); in SetStackElementAt()
110 stack_[index].SetMethod(m); in SetStackElementAt()
111 stack_[index].SetDexPc(dex_pc); in SetStackElementAt()
116 return tid_ == other.tid_ && stack_ == other.stack_;
121 std::vector<AllocRecordStackTraceElement> stack_; variable
/art/runtime/
Dthread_pool.cc43 stack_.reset(MemMap::MapAnonymous(name.c_str(), nullptr, stack_size, PROT_READ | PROT_WRITE, in ThreadPoolWorker()
45 CHECK(stack_.get() != nullptr) << error_msg; in ThreadPoolWorker()
46 CHECK_ALIGNED(stack_->Begin(), kPageSize); in ThreadPoolWorker()
47 int mprotect_result = mprotect(stack_->Begin(), kPageSize, PROT_NONE); in ThreadPoolWorker()
52 CHECK_PTHREAD_CALL(pthread_attr_setstack, (&attr, stack_->Begin(), stack_->Size()), reason); in ThreadPoolWorker()
Dthread_pool.h56 DCHECK(stack_.get() != nullptr); in GetStackSize()
57 return stack_->Size(); in GetStackSize()
72 std::unique_ptr<MemMap> stack_; variable
Dprofiler.cc64 stack_(stack), in BoundedStackVisitor()
74 stack_->push_back(std::make_pair(m, dex_pc_)); in VisitFrame()
84 std::vector<std::pair<ArtMethod*, uint32_t>>* const stack_; member in art::BoundedStackVisitor
/art/compiler/optimizing/
Dinduction_var_analysis.cc89 stack_(graph->GetArena()->Adapter(kArenaAllocInductionVarAnalysis)), in HInductionVarAnalysis()
117 DCHECK(stack_.empty()); in VisitLoop()
141 DCHECK(stack_.empty()); in VisitLoop()
151 stack_.push_back(instruction); in VisitNode()
167 while (!stack_.empty()) { in VisitNode()
168 HInstruction* x = stack_.back(); in VisitNode()
170 stack_.pop_back(); in VisitNode()
Dinduction_var_analysis.h221 ArenaVector<HInstruction*> stack_; variable