Lines Matching defs:stack_
535 stack_.clear();
590 stack_(zone),
606 ZoneVector<Value> stack_; // stack of values.
675 if (stack_.size() < kMaxIndent / 2) {
676 bytes[stack_.size() * 2] = 0;
785 stack_.resize(c->stack_depth);
848 stack_.resize(c->stack_depth);
873 if (!c->unreachable && stack_.size() != c->stack_depth) {
875 stack_.resize(c->stack_depth);
1302 for (size_t i = 0; i < stack_.size(); ++i) {
1303 Value& val = stack_[i];
1344 stack_.resize(control_.back().stack_depth);
1385 Control::Block(pc_, stack_.size(), end_env, current_catch_));
1390 Control::Loop(pc_, stack_.size(), end_env, current_catch_));
1395 Control::If(pc_, stack_.size(), end_env, false_env, current_catch_));
1399 control_.emplace_back(Control::Try(pc_, stack_.size(), end_env, zone_,
1535 stack_.push_back({pc_, node, type});
1541 stack_.resize(c->stack_depth);
1543 stack_.push_back(c->merge.vals.first);
1546 stack_.push_back(c->merge.vals.array[i]);
1549 DCHECK_EQ(c->stack_depth + c->merge.arity, stack_.size());
1576 if (stack_.size() <= limit) {
1584 Value val = stack_.back();
1585 stack_.pop_back();
1603 if (stack_.size() < expected && !control_.back().unreachable) {
1608 static_cast<int>(stack_.size() - c->stack_depth));
1619 if (stack_.size() == expected ||
1620 (stack_.size() < expected && c->unreachable)) {
1630 return stack_[stack_.size() - c->merge.arity + i];
1637 if (c->stack_depth + arity < stack_.size() ||
1638 (c->stack_depth + arity != stack_.size() && !c->unreachable)) {
1644 size_t avail = stack_.size() - c->stack_depth;
1663 size_t avail = stack_.size() - control_.back().stack_depth;
