Lines Matching refs:entry
34 // Allocate the initial entries and insert the first entry.
50 Node* entry = entries_[i];
51 if (!entry) {
53 // Reuse dead entry that we discovered on the way.
56 // Have to insert a new entry.
67 if (entry == node) {
89 // Opportunistically clean-up the duplicate entry if we're at the end
102 // Overwrite the colliding entry with the actual entry.
104 // Opportunistically clean-up the duplicate entry if we're at the
117 if (entry->IsDead()) {
121 if (NodeProperties::Equals(entry, node)) {
122 return ReplaceIfTypesMatch(node, entry);
167 Node* const entry = entries_[j];
168 if (entry == old_entry) {
169 // Skip duplicate of the old entry.
172 if (!entry) {