Lines Matching defs:node
28 if (node_key1->node == nullptr) {
29 if (node_key2->node == nullptr) {
34 node_key2->node);
37 if (node_key2->node == nullptr) {
40 node_key1->node);
42 return node_key1->node == node_key2->node;
50 bool StateValuesCache::IsKeysEqualToNode(StateValuesKey* key, Node* node) {
51 if (key->count != static_cast<size_t>(node->InputCount())) {
55 DCHECK_EQ(IrOpcode::kStateValues, node->opcode());
56 SparseInputMask node_mask = SparseInputMaskOf(node->op());
65 if (key->values[i] != node->InputAt(static_cast<int>(i))) {
125 Node* node;
128 node = graph()->NewNode(common()->StateValues(node_count, mask), node_count,
130 NodeKey* new_key = zone()->New<NodeKey>(node);
132 lookup->value = node;
134 node = reinterpret_cast<Node*>(lookup->value);
136 return node;
188 // remaining values into this node.
219 // Elide the StateValue node if there is only one, dense input. This will
243 DCHECK_EQ(it.node(), values[i]);
245 DCHECK_NULL(it.node());
295 // The 'tree' must be rooted with a state value node.
305 StateValuesAccess::iterator::iterator(Node* node) : current_depth_(0) {
307 SparseInputMaskOf(node->op()).IterateOverInputs(node);
317 void StateValuesAccess::iterator::Push(Node* node) {
321 SparseInputMaskOf(node->op()).IterateOverInputs(node);
349 // We are on a valid (albeit optimized out) node.
375 // We are on a valid node, we can stop the iteration.
380 Node* StateValuesAccess::iterator::node() {
412 return TypedNode(node(), type());