/art/test/1916-get-set-current-frame/src/art/ |
H A D | Locals.java | 70 return Objects.hash(this.signature, this.name, this.generic_signature, this.slot,
|
/art/test/1917-get-stack-frame/src/art/ |
H A D | Breakpoint.java | 53 return Objects.hash(method, location);
|
/art/test/1923-frame-pop/src/art/ |
H A D | Breakpoint.java | 53 return Objects.hash(method, location);
|
H A D | Locals.java | 70 return Objects.hash(this.signature, this.name, this.generic_signature, this.slot,
|
/art/test/1924-frame-pop-toggle/src/art/ |
H A D | Breakpoint.java | 53 return Objects.hash(method, location);
|
H A D | Locals.java | 70 return Objects.hash(this.signature, this.name, this.generic_signature, this.slot,
|
/art/test/1925-self-frame-pop/src/art/ |
H A D | Breakpoint.java | 53 return Objects.hash(method, location);
|
H A D | Locals.java | 70 return Objects.hash(this.signature, this.name, this.generic_signature, this.slot,
|
/art/test/1926-missed-frame-pop/src/art/ |
H A D | Breakpoint.java | 53 return Objects.hash(method, location);
|
H A D | Locals.java | 70 return Objects.hash(this.signature, this.name, this.generic_signature, this.slot,
|
/art/test/1927-exception-event/src/art/ |
H A D | Breakpoint.java | 53 return Objects.hash(method, location);
|
/art/test/1928-exception-event-exception/src/art/ |
H A D | Breakpoint.java | 53 return Objects.hash(method, location);
|
/art/test/1929-exception-catch-exception/src/art/ |
H A D | Breakpoint.java | 53 return Objects.hash(method, location);
|
/art/test/1935-get-set-current-frame-jit/src/art/ |
H A D | Breakpoint.java | 53 return Objects.hash(method, location);
|
H A D | Locals.java | 70 return Objects.hash(this.signature, this.name, this.generic_signature, this.slot,
|
/art/runtime/mirror/ |
H A D | class.cc | 80 // Perfect hash for the expected values: from the second letters of the primitive types, 82 char hash = name->CharAt(0) ^ ((name->CharAt(1) & 0x10) << 1); local 83 switch (hash) { 1452 // TODO: add an identifying hash value for the loader
|
/art/runtime/native/ |
H A D | dalvik_system_DexFile.cc | 381 const size_t hash(ComputeModifiedUtf8Hash(descriptor.c_str())); 384 OatDexFile::FindClassDef(*dex_file, descriptor.c_str(), hash); 400 hash,
|
H A D | java_lang_VMClassLoader.cc | 42 size_t hash, 46 return cl->LookupClass(self, descriptor, hash, class_loader); 53 size_t hash, 57 if (cl->FindClassInBaseDexClassLoader(soa, self, descriptor, hash, class_loader, &result)) { 74 // Compute hash once.
|
/art/runtime/ |
H A D | oat_file.cc | 1800 size_t hash) { 1802 DCHECK_EQ(ComputeModifiedUtf8Hash(descriptor), hash); local 1807 const uint32_t class_def_idx = oat_dex_file->GetTypeLookupTable()->Lookup(descriptor, hash); 1798 FindClassDef(const DexFile& dex_file, const char* descriptor, size_t hash) argument
|
H A D | oat_file.h | 498 size_t hash);
|
H A D | obj_ptr.h | 182 return std::hash<MirrorType*>()(ptr.Ptr());
|
H A D | type_lookup_table.cc | 29 static uint16_t MakeData(uint16_t class_def_idx, uint32_t hash, uint32_t mask) { argument 31 return (static_cast<uint16_t>(hash) & hash_mask) | class_def_idx; 84 const uint32_t hash = ComputeModifiedUtf8Hash(dex_file.GetStringData(str_id)); local 87 entry.data = MakeData(i, hash, GetSizeMask()); 88 if (!SetOnInitialPos(entry, hash)) { 98 const uint32_t hash = ComputeModifiedUtf8Hash(dex_file.GetStringData(str_id)); local 101 entry.data = MakeData(class_def_idx, hash, GetSizeMask()); 102 Insert(entry, hash); 115 bool TypeLookupTable::SetOnInitialPos(const Entry& entry, uint32_t hash) { argument 116 const uint32_t pos = hash 125 Insert(const Entry& entry, uint32_t hash) argument [all...] |
H A D | type_lookup_table.h | 30 * Implementation of TypeLookupTable is based on hash table. 44 // Method search class_def_idx by class descriptor and it's hash. 46 uint32_t Lookup(const char* str, uint32_t hash) const { 47 uint32_t pos = hash & GetSizeMask(); 52 if (CmpHashBits(entry->data, hash) && IsStringsEquals(str, entry->str_offset)) { 89 * But we have no full hash of element of table. But we can use 2 ideas. 90 * 1. All minor bits of hash inside one bucket are equals. 91 * 2. If dex file contains N classes and size of hash table is 2^n (where N <= 2^n) 92 * then 16-n bits are free. So we can encode part of element's hash into these bits. 93 * So hash o [all...] |
H A D | type_lookup_table_test.cc | 47 size_t hash = ComputeModifiedUtf8Hash(descriptor); local 48 uint32_t class_def_idx = table->Lookup(descriptor, hash);
|
/art/test/004-SignalTest/src/ |
H A D | Main.java | 32 int hash = o.hashCode(); 35 System.out.println("hash: " + hash);
|