Lines Matching defs:values
5 #include "src/compiler/state-values-utils.h"
65 if (key->values[i] != node->InputAt(static_cast<int>(i))) {
83 if (key1->values[i] != key2->values[i]) {
141 Node** values, size_t count, const BytecodeLivenessState* liveness) {
155 (*node_buffer)[(*node_count)++] = values[*values_idx];
171 Node* StateValuesCache::BuildTree(size_t* values_idx, Node** values,
181 values, count, liveness);
187 // If we have fewer values remaining than inputs remaining, dump the
188 // remaining values into this node.
194 values, count, liveness);
195 // Make sure we have exhausted our values.
209 // Otherwise, add the values to a subtree and add that as an input.
211 BuildTree(values_idx, values, count, liveness, level - 1);
220 // only happen if we built a single subtree (as nodes with values are always
233 void CheckTreeContainsValues(Node* tree, Node** values, size_t count,
243 DCHECK_EQ(it.node(), values[i]);
255 Node** values, size_t count, const BytecodeLivenessState* liveness) {
257 // Check that the values represent actual values, and not a tree of values.
259 if (values[i] != nullptr) {
260 DCHECK_NE(values[i]->opcode(), IrOpcode::kStateValues);
261 DCHECK_NE(values[i]->opcode(), IrOpcode::kTypedStateValues);
269 DCHECK_NOT_NULL(values[i]);
279 // This is a worst-case tree height estimate, assuming that all values are
291 Node* tree = BuildTree(&values_idx, values, count, liveness, height);
292 // The values should be exhausted by the end of BuildTree.
299 CheckTreeContainsValues(tree, values, count, liveness);