Lines Matching refs:Entry
24 struct NodeCache<Key, Hash, Pred>::Entry {
35 Entry* old_entries = entries_;
39 entries_ = zone->NewArray<Entry>(num_entries);
40 memset(entries_, 0, sizeof(Entry) * num_entries);
44 Entry* old = &old_entries[i];
50 Entry* entry = &entries_[j];
51 if (!entry->value_) {
52 entry->key_ = old->key_;
53 entry->value_ = old->value_;
67 // Allocate the initial entries and insert the first entry.
69 entries_ = zone->NewArray<Entry>(num_entries);
71 memset(entries_, 0, sizeof(Entry) * num_entries);
72 Entry* entry = &entries_[hash & (kInitialSize - 1)];
73 entry->key_ = key;
74 return &entry->value_;
82 Entry* entry = &entries_[i];
83 if (pred_(entry->key_, key)) return &entry->value_;
84 if (!entry->value_) {
85 entry->key_ = key;
86 return &entry->value_;
93 // If resized to maximum and still didn't find space, overwrite an entry.
94 Entry* entry = &entries_[hash & (size_ - 1)];
95 entry->key_ = key;
96 entry->value_ = nullptr;
97 return &entry->value_;
