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