60 mirror::Class* ClassTable::UpdateClass(const char* descriptor, mirror::Class* klass, size_t hash) {  in UpdateClass()  argument
63   DescriptorHashPair pair(descriptor, hash);  in UpdateClass()
64   auto existing_it = classes_.back().FindWithHash(pair, hash);  in UpdateClass()
67       if (class_set.FindWithHash(pair, hash) != class_set.end()) {  in UpdateClass()
81   *existing_it = TableSlot(klass, hash);  in UpdateClass()
124 mirror::Class* ClassTable::Lookup(const char* descriptor, size_t hash) {  in Lookup()  argument
125   DescriptorHashPair pair(descriptor, hash);  in Lookup()
128     auto it = class_set.FindWithHash(pair, hash);  in Lookup()
150   const uint32_t hash = TableSlot::HashDescriptor(klass);  in Insert()  local
152   classes_.back().InsertWithHash(TableSlot(klass, hash), hash);  in Insert()
169   const uint32_t hash = TableSlot::HashDescriptor(klass);  in InsertWithoutLocks()  local
170   classes_.back().InsertWithHash(TableSlot(klass, hash), hash);  in InsertWithoutLocks()
173 void ClassTable::InsertWithHash(ObjPtr<mirror::Class> klass, size_t hash) {  in InsertWithHash()  argument
175   classes_.back().InsertWithHash(TableSlot(klass, hash), hash);  in InsertWithHash()