Searched refs:hash (Results 51 - 75 of 81) sorted by last modified time

1234

/art/libartbase/base/
H A Dhash_map.h52 class HashFn = std::hash<Key>, class Pred = std::equal_to<Key>,
H A Dhash_set.h58 // Low memory version of a hash set, uses less memory than std::unordered_set since elements aren't
63 template <class T, class EmptyFn = DefaultEmptyFn<T>, class HashFn = std::hash<T>,
307 // Return true if the hash set has ownership of the underlying data.
381 iterator FindWithHash(const K& key, size_t hash) { argument
382 return iterator(this, FindIndex(key, hash));
386 const_iterator FindWithHash(const K& key, size_t hash) const {
387 return const_iterator(this, FindIndex(key, hash));
397 void InsertWithHash(U&& element, size_t hash) { argument
398 DCHECK_EQ(hash, hashfn_(element));
403 const size_t index = FirstAvailableSlot(IndexForHash(hash));
563 DCHECK_EQ(hashfn_(element), hash); local
[all...]
H A Dhash_set_test.cc165 // Insert some strings into the beginning of our hash set to establish an initial size
292 size_t hash = 0; local
294 hash = hash * 2 + *iter;
296 return hash;
344 // Try inserting elements until we are at our reserve size and ensure the hash set did not
H A Dstl_util.h35 // because the hash_set may call the hash function on the iterator when it is
36 // advanced, which could result in the hash function trying to deference a
125 // 32-bit FNV-1a hash function suitable for std::unordered_map.
131 uint32_t hash = 2166136261u; local
133 hash = (hash ^ value) * 16777619u;
135 return hash;
H A Dutils.h247 // Hash bytes using a relatively fast hash.
249 size_t hash = 0x811c9dc5; local
251 hash = (hash * 16777619) ^ data[i];
253 hash += hash << 13;
254 hash ^= hash >> 7;
255 hash += hash <<
[all...]
/art/libdexfile/dex/
H A Ddex_file_types.h103 template<> struct hash<art::dex::StringIndex> { struct in namespace:std
105 return hash<uint32_t>()(index.index_);
109 template<> struct hash<art::dex::TypeIndex> { struct in namespace:std
111 return hash<uint16_t>()(index.index_);
H A Dutf.cc179 uint32_t hash = 0; local
183 hash = hash * 31 + first;
187 hash = hash * 31 + second;
192 return static_cast<int32_t>(hash);
196 uint32_t hash = 0; local
198 hash = hash * 31 + *chars++;
200 return static_cast<int32_t>(hash);
[all...]
H A Dutf.h81 uint32_t hash = 0; local
83 hash = hash * 31 + *chars++;
85 return static_cast<int32_t>(hash);
90 // Compute a hash code of a modified UTF-8 string. Not the standard java hash since it returns a
/art/openjdkjvmti/
H A Dti_breakpoint.cc56 size_t Breakpoint::hash() const { function in class:openjdkjvmti::Breakpoint
57 return std::hash<uintptr_t> {}(reinterpret_cast<uintptr_t>(method_))
58 ^ std::hash<jlocation> {}(location_);
H A Dti_breakpoint.h55 // Get the hash code of this breakpoint.
56 size_t hash() const;
87 template<> struct hash<openjdkjvmti::Breakpoint> { struct in namespace:std
89 return b.hash();
/art/runtime/
H A Dbacktrace_helper.h71 uint64_t hash = 9314237; local
73 hash = hash * 2654435761 + frames_[i];
74 hash += (hash >> 13) ^ (hash << 6);
76 return hash;
H A Dclass_linker.cc2370 size_t hash, const std::vector<const DexFile*>& class_path) {
2372 const DexFile::ClassDef* dex_class_def = OatDexFile::FindClassDef(*dex_file, descriptor, hash);
2383 size_t hash,
2388 *result = FindClassInBootClassLoaderClassPath(self, descriptor, hash);
2400 if (!FindClassInBaseDexClassLoader(soa, self, descriptor, hash, h_parent, result)) {
2408 *result = FindClassInBaseDexClassLoaderClassPath(soa, descriptor, hash, class_loader);
2417 *result = FindClassInBootClassLoaderClassPath(self, descriptor, hash);
2422 *result = FindClassInBaseDexClassLoaderClassPath(soa, descriptor, hash, class_loader);
2430 return FindClassInBaseDexClassLoader(soa, self, descriptor, hash, h_parent, result);
2442 size_t hash) {
2369 FindInClassPath(const char* descriptor, size_t hash, const std::vector<const DexFile*>& class_path) argument
2380 FindClassInBaseDexClassLoader(ScopedObjectAccessAlreadyRunnable& soa, Thread* self, const char* descriptor, size_t hash, Handle<mirror::ClassLoader> class_loader, ObjPtr<mirror::Class>* result) argument
2440 FindClassInBootClassLoaderClassPath(Thread* self, const char* descriptor, size_t hash) argument
2465 FindClassInBaseDexClassLoaderClassPath( ScopedObjectAccessAlreadyRunnable& soa, const char* descriptor, size_t hash, Handle<mirror::ClassLoader> class_loader) argument
2511 const size_t hash = ComputeModifiedUtf8Hash(descriptor); local
2670 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
3654 CreateArrayClass(Thread* self, const char* descriptor, size_t hash, Handle<mirror::ClassLoader> class_loader) argument
3832 InsertClass(const char* descriptor, ObjPtr<mirror::Class> klass, size_t hash) argument
3893 LookupClass(Thread* self, const char* descriptor, size_t hash, ObjPtr<mirror::ClassLoader> class_loader) argument
3932 LookupClassesVisitor(const char* descriptor, size_t hash, std::vector<ObjPtr<mirror::Class>>* result) argument
3960 const size_t hash = ComputeModifiedUtf8Hash(descriptor); local
4376 const size_t hash = ComputeModifiedUtf8Hash(descriptor.c_str()); local
5687 uint32_t hash = ComputeModifiedUtf8Hash(name); local
5701 uint32_t hash = ComputeModifiedUtf8Hash(name); local
7797 const size_t hash = ComputeModifiedUtf8Hash(descriptor); local
[all...]
H A Dclass_linker.h220 size_t hash,
582 mirror::Class* InsertClass(const char* descriptor, ObjPtr<mirror::Class> klass, size_t hash)
845 size_t hash,
896 size_t hash,
910 size_t hash,
919 size_t hash)
937 // by the given 'class_loader'. Uses the provided hash for the descriptor.
940 size_t hash,
H A Dclass_table-inl.h130 const uint32_t hash = ComputeModifiedUtf8Hash(klass->GetDescriptor(&temp)); local
131 CHECK_EQ(descriptor_hash, hash);
H A Dclass_table.cc66 mirror::Class* ClassTable::UpdateClass(const char* descriptor, mirror::Class* klass, size_t hash) { argument
69 DescriptorHashPair pair(descriptor, hash);
70 auto existing_it = classes_.back().FindWithHash(pair, hash);
73 if (class_set.FindWithHash(pair, hash) != class_set.end()) {
85 // Update the element in the hash set with the new class. This is safe to do since the descriptor
87 *existing_it = TableSlot(klass, hash);
132 mirror::Class* ClassTable::Lookup(const char* descriptor, size_t hash) { argument
133 DescriptorHashPair pair(descriptor, hash);
136 auto it = class_set.FindWithHash(pair, hash);
158 const uint32_t hash local
160 classes_.back().InsertWithHash(TableSlot(klass, hash), hash); local
177 const uint32_t hash = TableSlot::HashDescriptor(klass); local
178 classes_.back().InsertWithHash(TableSlot(klass, hash), hash); local
181 InsertWithHash(ObjPtr<mirror::Class> klass, size_t hash) argument
183 classes_.back().InsertWithHash(TableSlot(klass, hash), hash); local
[all...]
H A Dclass_table.h75 static uint32_t MaskHash(uint32_t hash) { argument
76 return hash & kHashMask;
101 // Data contains the class pointer GcRoot as well as the low bits of the descriptor hash.
175 mirror::Class* UpdateClass(const char* descriptor, mirror::Class* new_klass, size_t hash)
203 mirror::Class* Lookup(const char* descriptor, size_t hash)
222 void InsertWithHash(ObjPtr<mirror::Class> klass, size_t hash)
H A Ddebug_print.cc65 uint32_t hash = ComputeModifiedUtf8Hash(class_descriptor); local
87 (table != nullptr) ? table->Lookup(class_descriptor, hash) : nullptr;
H A Ddebugger.cc5033 : data(data_in), hash(ComputeModifiedUtf8Hash(data_in)), index(0) {
5041 // The hash of the data.
5042 const uint32_t hash; member in struct:art::StringTable::Entry
5054 return entry.hash;
H A Delf_file.cc266 if (!CheckAndSet(section_header->sh_offset, "hash section",
388 // Need a hash section for dynamic symbol lookup.
390 *error_msg = StringPrintf("Failed to find hash section in ELF file: '%s'",
395 // And the hash section should be linking to the dynsym.
639 // WARNING: The following methods do not check for an error condition (non-existent hash section).
761 // Check that we have a hash section.
775 // WARNING: Only called from FindDynamicSymbolAddress. Elides check for hash section.
783 Elf_Word hash = elfhash(symbol_name.c_str()); local
784 Elf_Word bucket_index = hash % GetHashBucketNum();
1261 // Now that we are done loading, .dynamic should be in memory to find .dynstr, .dynsym, .hash
[all...]
H A Dintern_table.h133 // Read the intern table from memory. The elements aren't copied, the intern hash set data will
151 Utf8String(uint32_t utf16_length, const char* utf8_data, int32_t hash) argument
152 : hash_(hash), utf16_length_(utf16_length), utf8_data_(utf8_data) { }
/art/runtime/base/
H A Darena_containers.h73 typename HashFn = std::hash<T>,
80 typename HashFn = std::hash<Key>,
91 typename Hash = std::hash<Key>,
H A Dscoped_arena_containers.h69 typename HashFn = std::hash<T>,
76 typename HashFn = std::hash<Key>,
85 template <typename K, typename V, class Hash = std::hash<K>, class KeyEqual = std::equal_to<K>>
/art/runtime/gc/
H A Dallocation_record.h127 return std::hash<void*>()(reinterpret_cast<void*>(r.GetMethod())) *
128 AllocRecordStackTrace::kHashMultiplier + std::hash<uint32_t>()(r.GetDexPc());
H A Dheap.cc3924 uint64_t hash = backtrace.Hash(); local
3926 new_backtrace = seen_backtraces_.find(hash) == seen_backtraces_.end();
3928 seen_backtraces_.insert(hash);
/art/compiler/driver/
H A Dcompiled_method_storage.cc96 uint32_t hash = 0; local
108 hash ^= k;
109 hash = ((hash << r2) | (hash >> (32 - r2))) * m + n;
128 hash ^= k1;
131 hash ^= len;
132 hash ^= (hash >> 16);
133 hash *
[all...]

Completed in 2599 milliseconds

1234