Lines Matching refs:keys_
21 DCHECK_NULL(keys_);
25 if (keys_) {
29 DeletePointerArray(reinterpret_cast<uintptr_t*>(keys_), capacity_);
31 keys_ = nullptr;
54 if (keys_[index] == address) return index; // Found.
55 if (keys_[index] == not_mapped) return -1; // Not found.
58 if (keys_[index] == address) return index; // Found.
59 if (keys_[index] == not_mapped) return -1; // Not found.
80 if (keys_[index] == address) return {index, true}; // Found.
81 if (keys_[index] == not_mapped) { // Free entry.
84 keys_[index] = address;
96 DCHECK_NE(keys_[index], not_mapped);
97 keys_[index] = not_mapped;
112 Address key = keys_[next_index];
123 DCHECK_EQ(not_mapped, keys_[index]);
125 std::swap(keys_[index], keys_[next_index]);
202 keys_ = reinterpret_cast<Address*>(NewPointerArray(capacity_));
204 for (int i = 0; i < capacity_; i++) keys_[i] = not_mapped;
209 heap_->RegisterStrongRoots("IdentityMapBase", FullObjectSlot(keys_),
210 FullObjectSlot(keys_ + capacity_));
237 DCHECK_NE(keys_[index], ReadOnlyRoots(heap_).not_mapped_symbol().ptr());
239 return keys_[index];
245 DCHECK_NE(keys_[index], ReadOnlyRoots(heap_).not_mapped_symbol().ptr());
256 if (keys_[index] != not_mapped) {
274 if (keys_[i] == not_mapped) {
277 int pos = Hash(keys_[i]) & mask_;
280 reinsert.push_back(std::pair<Address, uintptr_t>(keys_[i], values_[i]));
281 keys_[i] = not_mapped;
301 Address* old_keys = keys_;
309 keys_ = reinterpret_cast<Address*>(NewPointerArray(capacity_));
311 for (int i = 0; i < capacity_; i++) keys_[i] = not_mapped;
324 heap_->UpdateStrongRoots(strong_roots_entry_, FullObjectSlot(keys_),
325 FullObjectSlot(keys_ + capacity_));