Searched refs:stack_ (Results 1 – 9 of 9) sorted by relevance
| /system/core/libunwindstack/ |
| D | DwarfOp.cpp | 1484 stack_.clear(); in Eval()
1551 if (stack_.size() < op->num_required_stack_values) { in Decode()
1621 stack_.push_front(value); in op_deref()
1640 stack_.push_front(value); in op_deref_size()
1648 stack_.push_front(operand); in op_push()
1655 stack_.push_front(StackAt(0)); in op_dup()
1667 stack_.push_front(StackAt(1)); in op_over()
1678 stack_.push_front(StackAt(index)); in op_pick()
1684 AddressType old_value = stack_[0]; in op_swap()
1685 stack_[0] = stack_[1]; in op_swap()
[all …]
|
| D | DwarfOp.h | 56 AddressType StackAt(size_t index) { return stack_[index]; } in StackAt()
57 size_t StackSize() { return stack_.size(); } in StackSize()
78 AddressType value = stack_.front(); in StackPop()
79 stack_.pop_front(); in StackPop()
93 std::deque<AddressType> stack_; variable
|
| /system/update_engine/payload_generator/ |
| D | cycle_breaker.cc | 104 DCHECK(stack_.empty()); in BreakCycles()
110 stack_.push_back(current_vertex_); in HandleCircuit()
111 CHECK_GE(stack_.size(), static_cast<vector<Vertex::Index>::size_type>(2)); in HandleCircuit()
112 Edge min_edge = make_pair(stack_[0], stack_[1]); in HandleCircuit()
115 for (vector<Vertex::Index>::const_iterator it = stack_.begin(); in HandleCircuit()
116 it != (stack_.end() - 1); in HandleCircuit()
120 stack_.pop_back(); in HandleCircuit()
133 stack_.pop_back(); in HandleCircuit()
149 for (vector<Vertex::Index>::const_iterator it = ++stack_.begin(), in StackContainsCutEdge()
150 e = stack_.end(); in StackContainsCutEdge()
[all …]
|
| D | tarjan.cc | 36 stack_.clear(); in Execute()
53 stack_.push_back(vertex); in Tarjan()
62 } else if (base::ContainsValue(stack_, vertex_next)) { in Tarjan()
71 other_vertex = stack_.back(); in Tarjan()
72 stack_.pop_back(); in Tarjan()
74 } while (other_vertex != vertex && !stack_.empty()); in Tarjan()
|
| D | tarjan.h | 47 std::vector<Vertex::Index> stack_; variable
|
| D | cycle_breaker.h | 58 std::vector<Vertex::Index> stack_; // the stack variable in the paper variable
|
| /system/core/libmemunreachable/ |
| D | Tarjan.h | 70 : index_(0), stack_(allocator), components_(allocator) {} in TarjanAlgorithm()
79 allocator::vector<Node<T>*> stack_; variable
85 stack_.clear(); in Execute()
107 stack_.push_back(vertex); in Tarjan()
113 } else if (std::find(stack_.begin(), stack_.end(), vertex_next) != stack_.end()) { in Tarjan()
121 other_vertex = stack_.back(); in Tarjan()
122 stack_.pop_back(); in Tarjan()
124 } while (other_vertex != vertex && !stack_.empty()); in Tarjan()
|
| D | PtracerThread.cpp | 71 stack_ = std::make_unique<Stack>(PTHREAD_STACK_MIN); in PtracerThread()
72 if (stack_->top() == nullptr) { in PtracerThread()
89 stack_ = nullptr; in ~PtracerThread()
102 child_pid_ = clone(proxy, stack_->top(), CLONE_VM | CLONE_FS | CLONE_FILES /*|CLONE_UNTRACED*/, in Start()
|
| D | PtracerThread.h | 47 std::unique_ptr<Stack> stack_; variable
|