Searched refs:stack_ (Results 1 - 7 of 7) sorted by relevance

/system/update_engine/payload_generator/
H A Dtarjan.cc37 stack_.clear();
54 stack_.push_back(vertex);
62 } else if (utils::VectorContainsValue(stack_, vertex_next)) {
71 other_vertex = stack_.back();
72 stack_.pop_back();
74 } while (other_vertex != vertex && !stack_.empty());
H A Dcycle_breaker.cc101 DCHECK(stack_.empty());
107 stack_.push_back(current_vertex_);
108 CHECK_GE(stack_.size(),
110 Edge min_edge = make_pair(stack_[0], stack_[1]);
113 for (vector<Vertex::Index>::const_iterator it = stack_.begin();
114 it != (stack_.end() - 1); ++it) {
117 stack_.pop_back();
130 stack_.pop_back();
146 for (vector<Vertex::Index>::const_iterator it = ++stack_
[all...]
H A Dcycle_breaker.h58 std::vector<Vertex::Index> stack_; // the stack variable in the paper member in class:chromeos_update_engine::CycleBreaker
H A Dtarjan.h46 std::vector<Vertex::Index> stack_; member in class:chromeos_update_engine::TarjanAlgorithm
/system/core/libmemunreachable/
H A DTarjan.h67 stack_(allocator), components_(allocator) {}
75 allocator::vector<Node<T>*> stack_; member in class:TarjanAlgorithm
81 stack_.clear();
103 stack_.push_back(vertex);
109 } else if (std::find(stack_.begin(), stack_.end(), vertex_next) != stack_.end()) {
117 other_vertex = stack_.back();
118 stack_.pop_back();
120 } while (other_vertex != vertex && !stack_
[all...]
H A DPtracerThread.h44 std::unique_ptr<Stack> stack_; member in class:PtracerThread
H A DPtracerThread.cpp71 stack_ = std::make_unique<Stack>(PTHREAD_STACK_MIN);
72 if (stack_->top() == nullptr) {
89 stack_ = nullptr;
101 child_pid_ = clone(proxy, stack_->top(),

Completed in 116 milliseconds