Search

Home

Sort by

Searched defs:hash (Results 1 - 9 of 9) sorted by relevance

/art/compiler/utils/
H A D	dedupe_set_test.cc	`30 size_t hash = 0; local 32 hash += c; 33 hash += hash << 10; 34 hash += hash >> 6; 36 return hash;`
/art/runtime/
H A D	gc_map.h	`79 uint32_t hash = native_offset; local 80 hash ^= (hash >> 20) ^ (hash >> 12); 81 hash ^= (hash >> 7) ^ (hash >> 4); 82 return hash;`
H A D	utf.cc	`73 int32_t hash = 0; local 75 hash = hash * 31 + chars->Get(offset + i); 77 return hash; 81 int32_t hash = 0; local 83 hash = hash * 31 + *chars++; 85 return hash; 89 size_t hash = 0; local 91 hash [all...]`
H A D	dex_file.cc	`422 const DexFile::ClassDef* DexFile::FindClassDef(const char* descriptor, size_t hash) const { 423 DCHECK_EQ(ComputeModifiedUtf8Hash(descriptor), hash); local 427 auto it = index->FindWithHash(descriptor, hash);`
H A D	elf_file.cc	299 if (!CheckAndSet(section_header->sh_offset, "hash section", 420 // Need a hash section for dynamic symbol lookup. 422 *error_msg = StringPrintf("Failed to find hash section in ELF file: '%s'", 427 // And the hash section should be linking to the dynsym. 663 // WARNING: The following methods do not check for an error condition (non-existent hash section). 771 // Check that we have a hash section. 785 // WARNING: Only called from FindDynamicSymbolAddress. Elides check for hash section. 791 Elf32_Word hash = elfhash(symbol_name.c_str()); local 792 Elf32_Word bucket_index = hash % GetHashBucketNum(); 1195 // Now that we are done loading, .dynamic should be in memory to find .dynstr, .dynsym, .hash [all...]
H A D	class_linker.cc	2021 size_t hash, const std::vector<const DexFile>& class_path) { 2023 const DexFile::ClassDef dex_class_def = dex_file->FindClassDef(descriptor, hash); 2033 size_t hash, 2041 ClassPathEntry pair = FindInClassPath(descriptor, hash, boot_class_path_); 2044 mirror::Class* klass = LookupClass(descriptor, hash, nullptr); 2048 klass = DefineClass(self, descriptor, hash, NullHandle<mirror::ClassLoader>(), pair.first, 2096 const DexFile::ClassDef dex_class_def = dex_file->FindClassDef(descriptor, hash); 2099 mirror::Class* klass = DefineClass(self, descriptor, hash, class_loader, dex_file, 2127 const size_t hash = ComputeModifiedUtf8Hash(descriptor); local 2129 mirror::Class klass = LookupClass(descriptor, hash, class_loade 2020 FindInClassPath(const char* descriptor, size_t hash, const std::vector<const DexFile>& class_path) argument 2031 FindClassInPathClassLoader(ScopedObjectAccessAlreadyRunnable& soa, Thread self, const char* descriptor, size_t hash, Handle<mirror::ClassLoader> class_loader) argument 2218 DefineClass(Thread* self, const char* descriptor, size_t hash, Handle<mirror::ClassLoader> class_loader, const DexFile& dex_file, const DexFile::ClassDef& dex_class_def) argument 3093 CreateArrayClass(Thread* self, const char* descriptor, size_t hash, Handle<mirror::ClassLoader> class_loader) argument 3263 InsertClass(const char* descriptor, mirror::Class* klass, size_t hash) argument 3289 class_table_.InsertWithHash(GcRoot<mirror::Class>(klass), hash); local 3296 UpdateClass(const char* descriptor, mirror::Class* klass, size_t hash) argument 3348 LookupClass(const char* descriptor, size_t hash, mirror::ClassLoader* class_loader) argument 3377 LookupClassFromTableLocked(const char* descriptor, mirror::ClassLoader* class_loader, size_t hash) argument 3417 size_t hash = ComputeModifiedUtf8Hash(descriptor); local 4858 uint32_t hash = ComputeModifiedUtf8Hash(name); local 4871 uint32_t hash = ComputeModifiedUtf8Hash(name); local [all...]
/art/runtime/base/
H A D	hash_set.h	52 // Low memory version of a hash set, uses less memory than std::unordered_set since elements aren't 55 template <class T, class EmptyFn = DefaultEmptyFn<T>, class HashFn = std::hash<T>, 236 Iterator FindWithHash(const K& element, size_t hash) { argument 237 DCHECK_EQ(hashfn_(element), hash); local 238 size_t index = IndexForHash(hash); 254 void InsertWithHash(const T& element, size_t hash) { argument 255 DCHECK_EQ(hash, hashfn_(element)); 260 const size_t index = FirstAvailableSlot(IndexForHash(hash)); 270 // To distance that inserted elements were probed. Used for measuring how good hash functions 322 size_t IndexForHash(size_t hash) cons [all...]
/art/compiler/
H A D	elf_writer_quick.cc	`155 // \| Elf32_Phdr LOAD R \| .dynsym .dynstr .hash .rodata 173 // \| .hash \| 209 // \| .hash\0 \| 231 // \| Elf32_Shdr .hash \| 342 // Setup .hash 393 // Fill in the hash section. 394 std::vector<Elf32_Word> hash = dynsym_builder_.GenerateHashContents(); local 397 LOG(INFO) << ".hash size (bytes)=" << hash.size() * sizeof(Elf32_Word) 398 << std::hex << " " << hash 775 std::vector<Elf32_Word> hash; local [all...]`
/art/compiler/driver/
H A D	compiler_driver.h	`865 uint32_t hash = 0; local 878 hash ^= k; 879 hash = ((hash << r2) \| (hash >> (32 - r2))) * m + n; 896 hash ^= k1; 899 hash ^= len; 900 hash ^= (hash >> 16); 901 hash * 908 size_t hash = 0x811c9dc5; local [all...]`

Completed in 181 milliseconds