Lines Matching refs:stack_depth
106 size_t stack_depth; // stack height at the beginning of the construct.
122 static Control Block(const byte* pc, size_t stack_depth, SsaEnv* end_env,
124 return {pc, kControlBlock, stack_depth, end_env, nullptr,
128 static Control If(const byte* pc, size_t stack_depth, SsaEnv* end_env,
130 return {pc, kControlIf, stack_depth, end_env, false_env,
134 static Control Loop(const byte* pc, size_t stack_depth, SsaEnv* end_env,
136 return {pc, kControlLoop, stack_depth, end_env, nullptr,
140 static Control Try(const byte* pc, size_t stack_depth, SsaEnv* end_env,
144 return {pc, kControlTry, stack_depth, end_env, nullptr,
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);
1344 stack_.resize(control_.back().stack_depth);
1541 stack_.resize(c->stack_depth);
1549 DCHECK_EQ(c->stack_depth + c->merge.arity, stack_.size());
1575 size_t limit = control_.empty() ? 0 : control_.back().stack_depth;
1602 size_t expected = control_.back().stack_depth + c->merge.arity;
1608 static_cast<int>(stack_.size() - c->stack_depth));
1618 size_t expected = c->stack_depth + c->merge.arity;
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;
