Lines Matching defs:nodes
38 // If the nodes are already processed, they must be the same.
109 int StateValuesHashKey(Node** nodes, size_t count) {
112 hash = hash * 23 + (nodes[i] == nullptr ? 0 : nodes[i]->id());
119 Node* StateValuesCache::GetValuesNodeFromCache(Node** nodes, size_t count,
121 StateValuesKey key(count, mask, nodes);
122 int hash = StateValuesHashKey(nodes, count);
129 nodes);
144 // Virtual nodes are the live nodes plus the implicit optimized out nodes,
190 // remaining live nodes.
220 // only happen if we built a single subtree (as nodes with values are always
365 // At this point the value is known to be live and within our input nodes.