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