42   bool Insert(T* t) {  in Insert()  argument
43     const uint64_t h = Hash()(t);  in Insert()
49     if (hash_table::Insert(&bucket, t)) {  in Insert()
50       lru.Push(t);  in Insert()
62   bool Find(T* t, T** ret) {  in Find()  argument
63     const uint64_t h = Hash()(t);  in Find()
69     if (hash_table::Find(&bucket, t, ret)) {  in Find()
83     T* t = nullptr;  variable
86     for (size_t i = 0; !t && i < hash_table::nlocks_; ++i) {
91       if (!lru.IsEmpty() && (t = lru.Pop()) != nullptr) {
92         assert(!t->refs_);
94         const uint64_t h = Hash()(t);
97         bool status = hash_table::Erase(&bucket, t, &tmp);
98         assert(t == tmp);
102           fn(t);
106       assert(!t);
108     return t;
117       for (auto* t : bucket.list_) {  in Clear()
118         lru_list.Unlink(t);  in Clear()
119         (*fn)(t);  in Clear()
141   port::RWMutex* GetMutex(T* t) { return hash_table::GetMutex(t); }  in GetMutex()  argument