Lines Matching refs:depth
55 DCHECK_LE(new_depth, access.depth());
57 if (new_depth == access.depth() &&
74 DCHECK_LE(new_depth, access.depth());
76 if (new_depth == access.depth() &&
140 size_t depth = access.depth();
143 Node* context = NodeProperties::GetOuterContext(node, &depth);
146 GetSpecializationContext(broker(), context, &depth, outer());
150 return SimplifyJSLoadContext(node, context, depth);
153 // Now walk up the concrete context chain for the remaining depth.
155 concrete = concrete.previous(&depth);
156 if (depth > 0) {
158 return SimplifyJSLoadContext(node, jsgraph()->Constant(concrete), depth);
164 return SimplifyJSLoadContext(node, jsgraph()->Constant(concrete), depth);
175 return SimplifyJSLoadContext(node, jsgraph()->Constant(concrete), depth);
187 return SimplifyJSLoadContext(node, jsgraph()->Constant(concrete), depth);
202 size_t depth = access.depth();
204 // First walk up the context chain in the graph until we reduce the depth to 0
206 Node* context = NodeProperties::GetOuterContext(node, &depth);
209 GetSpecializationContext(broker(), context, &depth, outer());
213 return SimplifyJSStoreContext(node, context, depth);
216 // Now walk up the concrete context chain for the remaining depth.
218 concrete = concrete.previous(&depth);
219 if (depth > 0) {
221 return SimplifyJSStoreContext(node, jsgraph()->Constant(concrete), depth);
224 return SimplifyJSStoreContext(node, jsgraph()->Constant(concrete), depth);
229 size_t depth = std::numeric_limits<size_t>::max();
230 Node* context = NodeProperties::GetOuterContext(node, &depth);
234 size_t depth = 1;
235 c = c.previous(&depth);
236 CHECK_EQ(depth, 0);