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

/art/compiler/utils/
H A Ddedupe_set_test.cc30 size_t hash = 0; local
32 hash += c;
33 hash += hash << 10;
34 hash += hash >> 6;
36 return hash;
/art/runtime/
H A Dgc_map.h79 uint32_t hash = native_offset; local
80 hash ^= (hash >> 20) ^ (hash >> 12);
81 hash ^= (hash >> 7) ^ (hash >> 4);
82 return hash;
H A Dutf.cc111 uint32_t hash = 0; local
113 hash = hash * 31 + *chars++;
115 return static_cast<int32_t>(hash);
119 size_t hash = 0; local
121 hash = hash * 31 + *chars++;
123 return static_cast<int32_t>(hash);
H A Ddex_file.cc473 const DexFile::ClassDef* DexFile::FindClassDef(const char* descriptor, size_t hash) const {
474 DCHECK_EQ(ComputeModifiedUtf8Hash(descriptor), hash); local
478 auto it = index->FindWithHash(descriptor, hash);
H A Delf_file.cc312 if (!CheckAndSet(section_header->sh_offset, "hash section",
438 // Need a hash section for dynamic symbol lookup.
440 *error_msg = StringPrintf("Failed to find hash section in ELF file: '%s'",
445 // And the hash section should be linking to the dynsym.
689 // WARNING: The following methods do not check for an error condition (non-existent hash section).
811 // Check that we have a hash section.
825 // WARNING: Only called from FindDynamicSymbolAddress. Elides check for hash section.
833 Elf_Word hash = elfhash(symbol_name.c_str()); local
834 Elf_Word bucket_index = hash % GetHashBucketNum();
1302 // Now that we are done loading, .dynamic should be in memory to find .dynstr, .dynsym, .hash
[all...]
H A Dclass_linker.cc1589 size_t hash, const std::vector<const DexFile*>& class_path) {
1591 const DexFile::ClassDef* dex_class_def = dex_file->FindClassDef(descriptor, hash);
1609 size_t hash,
1615 ClassPathEntry pair = FindInClassPath(descriptor, hash, boot_class_path_);
1617 mirror::Class* klass = LookupClass(self, descriptor, hash, nullptr);
1621 *result = DefineClass(self, descriptor, hash, NullHandle<mirror::ClassLoader>(),
1644 bool recursive_result = FindClassInPathClassLoader(soa, self, descriptor, hash, h_parent, result);
1694 const DexFile::ClassDef* dex_class_def = cp_dex_file->FindClassDef(descriptor, hash);
1697 mirror::Class* klass = DefineClass(self, descriptor, hash, class_loader,
1729 const size_t hash local
1588 FindInClassPath(const char* descriptor, size_t hash, const std::vector<const DexFile*>& class_path) argument
1607 FindClassInPathClassLoader(ScopedObjectAccessAlreadyRunnable& soa, Thread* self, const char* descriptor, size_t hash, Handle<mirror::ClassLoader> class_loader, mirror::Class** result) argument
1808 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
2585 CreateArrayClass(Thread* self, const char* descriptor, size_t hash, Handle<mirror::ClassLoader> class_loader) argument
2753 InsertClass(const char* descriptor, mirror::Class* klass, size_t hash) argument
2779 class_table_.InsertWithHash(GcRoot<mirror::Class>(klass), hash); local
2798 UpdateClass(const char* descriptor, mirror::Class* klass, size_t hash) argument
2846 LookupClass(Thread* self, const char* descriptor, size_t hash, mirror::ClassLoader* class_loader) argument
2875 LookupClassFromTableLocked(const char* descriptor, mirror::ClassLoader* class_loader, size_t hash) argument
2914 size_t hash = ComputeModifiedUtf8Hash(descriptor); local
3288 size_t hash = ComputeModifiedUtf8Hash(descriptor.c_str()); local
4465 uint32_t hash = ComputeModifiedUtf8Hash(name); local
4478 uint32_t hash = ComputeModifiedUtf8Hash(name); local
[all...]
/art/compiler/dwarf/
H A Ddebug_info_entry_writer.h30 // 32-bit FNV-1a hash function which we use to find duplicate abbreviations.
35 uint32_t hash = 2166136261u; local
37 hash = (hash ^ v[i]) * 16777619u;
39 return hash;
/art/compiler/driver/
H A Dcompiler_driver.h707 uint32_t hash = 0; local
719 hash ^= k;
720 hash = ((hash << r2) | (hash >> (32 - r2))) * m + n;
739 hash ^= k1;
742 hash ^= len;
743 hash ^= (hash >> 16);
744 hash *
751 size_t hash = 0x811c9dc5; local
[all...]
/art/runtime/base/
H A Dhash_set.h53 // Low memory version of a hash set, uses less memory than std::unordered_set since elements aren't
58 template <class T, class EmptyFn = DefaultEmptyFn<T>, class HashFn = std::hash<T>,
312 Iterator FindWithHash(const K& element, size_t hash) { argument
313 return Iterator(this, FindIndex(element, hash));
317 ConstIterator FindWithHash(const K& element, size_t hash) const {
318 return ConstIterator(this, FindIndex(element, hash));
326 void InsertWithHash(const T& element, size_t hash) { argument
327 DCHECK_EQ(hash, hashfn_(element));
332 const size_t index = FirstAvailableSlot(IndexForHash(hash));
345 // To distance that inserted elements were probed. Used for measuring how good hash function
417 DCHECK_EQ(hashfn_(element), hash); local
[all...]
/art/compiler/
H A Delf_builder.h388 // Here is how The ELF hash table works.
424 std::vector<Elf_Word> hash; variable
425 hash.push_back(nbuckets);
426 hash.push_back(chain_size);
427 uint32_t bucket_offset = hash.size();
429 hash.resize(hash.size() + nbuckets + chain_size, 0);
431 Elf_Word* buckets = hash.data() + bucket_offset;
432 Elf_Word* chain = hash.data() + chain_offset;
434 // Set up the actual hash tabl
[all...]
/art/runtime/gc/
H A Dheap.cc3741 uint64_t hash = 0; local
3743 hash = hash * 2654435761 + backtrace[i];
3744 hash += (hash >> 13) ^ (hash << 6);
3747 new_backtrace = seen_backtraces_.find(hash) == seen_backtraces_.end();
3749 seen_backtraces_.insert(hash);

Completed in 248 milliseconds