Lines Matching defs:tree
233 void CheckTreeContainsValues(Node* tree, Node** values, size_t count,
235 DCHECK_EQ(count, StateValuesAccess(tree).size());
238 auto access = StateValuesAccess(tree);
257 // Check that the values represent actual values, and not a tree of values.
279 // This is a worst-case tree height estimate, assuming that all values are
281 // vector, but there's no point -- any excess height in the tree will be
291 Node* tree = BuildTree(&values_idx, values, count, liveness, height);
295 // The 'tree' must be rooted with a state value node.
296 DCHECK_EQ(tree->opcode(), IrOpcode::kStateValues);
299 CheckTreeContainsValues(tree, values, count, liveness);
302 return tree;