Lines Matching refs:node
10 #include "src/compiler/node.h"
18 size_t HashCode(Node* node) {
19 size_t h = base::hash_combine(node->op()->HashCode(), node->InputCount());
20 for (int j = 0; j < node->InputCount(); ++j) {
21 h = base::hash_combine(h, node->InputAt(j)->id());
27 bool Equals(Node* a, Node* b) {
52 Reduction ValueNumberingReducer::Reduce(Node* node) {
53 if (!node->op()->HasProperty(Operator::kIdempotent)) return NoChange();
55 const size_t hash = HashCode(node);
61 entries_ = zone()->NewArray<Node*>(kInitialCapacity);
63 entries_[hash & (kInitialCapacity - 1)] = node;
75 Node* entry = entries_[i];
79 entries_[dead] = node;
82 entries_[i] = node;
92 if (entry == node) {
104 Node* entry = entries_[j];
106 // No collision, {node} is fine.
112 if (Equals(entry, node)) {
125 if (Equals(entry, node)) {
135 Node** const old_entries = entries_;
138 entries_ = zone()->NewArray<Node*>(capacity_);
145 Node* const old_entry = old_entries[i];
148 Node* const entry = entries_[j];
