/art/libartbase/base/ |
D | data_hash.h | 26 size_t hash = 0x811c9dc5; in HashBytes() local 28 hash = (hash * 16777619) ^ data[i]; in HashBytes() 30 hash += hash << 13; in HashBytes() 31 hash ^= hash >> 7; in HashBytes() 32 hash += hash << 3; in HashBytes() 33 hash ^= hash >> 17; in HashBytes() 34 hash += hash << 5; in HashBytes() 35 return hash; in HashBytes() 56 uint32_t hash = 0; in operator() local 68 hash ^= k; in operator() [all …]
|
D | hash_set.h | 145 std::hash<T>>::type; 433 iterator FindWithHash(const K& key, size_t hash) { in FindWithHash() argument 434 return iterator(this, FindIndex(key, hash)); in FindWithHash() 438 const_iterator FindWithHash(const K& key, size_t hash) const { in FindWithHash() argument 439 return const_iterator(this, FindIndex(key, hash)); in FindWithHash() 461 std::pair<iterator, bool> InsertWithHash(U&& element, size_t hash) { in InsertWithHash() argument 462 DCHECK_EQ(hash, hashfn_(element)); in InsertWithHash() 472 size_t index = FindIndexImpl(element, hash, find_fail_fn); in InsertWithHash() 607 size_t IndexForHash(size_t hash) const { in IndexForHash() argument 612 return hash % num_buckets_; in IndexForHash() [all …]
|
D | stl_util.h | 139 uint32_t hash = 2166136261u; in operator() local 141 hash = (hash ^ value) * 16777619u; in operator() 143 return hash; in operator()
|
/art/runtime/ |
D | backtrace_helper.h | 60 uint64_t hash = 9314237; in Hash() local 62 hash = hash * 2654435761 + frames_[i]; in Hash() 63 hash += (hash >> 13) ^ (hash << 6); in Hash() 65 return hash; in Hash()
|
D | class_table.cc | 54 size_t hash) { in UpdateClass() argument 57 DescriptorHashPair pair(descriptor, hash); in UpdateClass() 58 auto existing_it = classes_.back().FindWithHash(pair, hash); in UpdateClass() 61 if (class_set.FindWithHash(pair, hash) != class_set.end()) { in UpdateClass() 75 *existing_it = TableSlot(klass, hash); in UpdateClass() 118 ObjPtr<mirror::Class> ClassTable::Lookup(const char* descriptor, size_t hash) { in Lookup() argument 119 DescriptorHashPair pair(descriptor, hash); in Lookup() 122 auto it = class_set.FindWithHash(pair, hash); in Lookup() 144 const uint32_t hash = TableSlot::HashDescriptor(klass); in Insert() local 146 classes_.back().InsertWithHash(TableSlot(klass, hash), hash); in Insert() [all …]
|
D | class_table.h | 73 static uint32_t MaskHash(uint32_t hash) { in MaskHash() argument 74 return hash & kHashMask; in MaskHash() 175 size_t hash) 203 ObjPtr<mirror::Class> Lookup(const char* descriptor, size_t hash) 222 void InsertWithHash(ObjPtr<mirror::Class> klass, size_t hash)
|
/art/compiler/utils/ |
D | dedupe_set_test.cc | 33 size_t hash = 0; in operator ()() local 35 hash += c; in operator ()() 36 hash += hash << 10; in operator ()() 37 hash += hash >> 6; in operator ()() 39 return hash; in operator ()()
|
D | dedupe_set-inl.h | 71 const StoreKey* Add(Thread* self, size_t hash, const InKey& in_key) REQUIRES(!lock_) { 73 HashedKey<InKey> hashed_in_key(hash, &in_key); 80 keys_.insert(HashedKey<StoreKey> { hash, store_key }); 117 HashedKey(size_t hash, const T* key) : hash_(hash), key_(key) { }
|
/art/libdexfile/dex/ |
D | type_lookup_table.cc | 53 const uint32_t hash = ComputeModifiedUtf8Hash(dex_file.GetStringData(str_id)); in Create() local 54 const uint32_t pos = hash & mask; in Create() 56 entries[pos] = Entry(str_id.string_data_off_, hash, class_def_idx, mask_bits); in Create() 68 const uint32_t hash = ComputeModifiedUtf8Hash(dex_file.GetStringData(str_id)); in Create() local 70 uint32_t tail_pos = hash & mask; in Create() 82 entries[insert_pos] = Entry(str_id.string_data_off_, hash, class_def_idx, mask_bits); in Create() 100 uint32_t TypeLookupTable::Lookup(const char* str, uint32_t hash) const { in Lookup() 102 uint32_t pos = hash & mask; in Lookup() 110 uint32_t compared_hash_bits = (hash << mask_bits_) >> (2 * mask_bits_); in Lookup() 130 if (((ComputeModifiedUtf8Hash(first_checked_str) ^ hash) & mask) != 0u) { in Lookup()
|
D | utf.cc | 178 uint32_t hash = 0; in ComputeUtf16HashFromModifiedUtf8() local 182 hash = hash * 31 + first; in ComputeUtf16HashFromModifiedUtf8() 186 hash = hash * 31 + second; in ComputeUtf16HashFromModifiedUtf8() 191 return static_cast<int32_t>(hash); in ComputeUtf16HashFromModifiedUtf8() 195 uint32_t hash = 0; in ComputeModifiedUtf8Hash() local 197 hash = hash * 31 + static_cast<uint8_t>(*chars); in ComputeModifiedUtf8Hash() 200 return hash; in ComputeModifiedUtf8Hash()
|
D | utf.h | 81 uint32_t hash = 0; in ComputeUtf16Hash() local 83 hash = hash * 31 + *chars++; in ComputeUtf16Hash() 85 return static_cast<int32_t>(hash); in ComputeUtf16Hash()
|
D | dex_file_types.h | 98 template<> struct hash<art::dex::ProtoIndex> { 100 return hash<decltype(index.index_)>()(index.index_); 104 template<> struct hash<art::dex::StringIndex> { 106 return hash<decltype(index.index_)>()(index.index_); 110 template<> struct hash<art::dex::TypeIndex> { 112 return hash<decltype(index.index_)>()(index.index_);
|
D | type_lookup_table_test.cc | 45 size_t hash = ComputeModifiedUtf8Hash(descriptor); in TEST_P() local 46 uint32_t class_def_idx = table.Lookup(descriptor, hash); in TEST_P()
|
D | type_lookup_table.h | 73 uint32_t Lookup(const char* str, uint32_t hash) const; 113 Entry(uint32_t str_offset, uint32_t hash, uint32_t class_def_index, uint32_t mask_bits) in Entry() argument 115 data_(((hash & ~GetMask(mask_bits)) | class_def_index) << mask_bits) { in Entry()
|
/art/test/920-objects/ |
D | objects.cc | 48 jint hash; in Java_art_Test920_getObjectHashCode() local 50 jvmtiError result = jvmti_env->GetObjectHashCode(object, &hash); in Java_art_Test920_getObjectHashCode() 59 return hash; in Java_art_Test920_getObjectHashCode()
|
/art/tools/ahat/src/main/com/android/ahat/heapdump/ |
D | Value.java | 254 return Objects.hash(mBool); in hashCode() 289 return Objects.hash(mByte); in hashCode() 324 return Objects.hash(mChar); in hashCode() 354 return Objects.hash(mDouble); in hashCode() 384 return Objects.hash(mFloat); in hashCode() 430 return Objects.hash(mInstance); in hashCode() 470 return Objects.hash(mInt); in hashCode() 510 return Objects.hash(mLong); in hashCode() 540 return Objects.hash(mShort); in hashCode()
|
D | Size.java | 117 return Objects.hash(mJavaSize, mRegisteredNativeSize); in hashCode()
|
/art/openjdkjvmti/ |
D | ti_breakpoint.h | 57 size_t hash() const; 91 template<> struct hash<openjdkjvmti::Breakpoint> { 93 return b.hash();
|
D | ti_breakpoint.cc | 119 size_t Breakpoint::hash() const { in hash() function in openjdkjvmti::Breakpoint 120 return std::hash<uintptr_t> {}(reinterpret_cast<uintptr_t>(method_)) in hash() 121 ^ std::hash<jlocation> {}(location_); in hash()
|
/art/test/920-objects/src/art/ |
D | Test920.java | 88 private int hash; field in Test920.MyHash 91 hash = h; in MyHash() 95 return hash; in hashCode()
|
/art/test/004-SignalTest/src/ |
D | Main.java | 32 int hash = o.hashCode(); in main() local 35 System.out.println("hash: " + hash); in main()
|
/art/test/522-checker-regression-monitor-exit/src/ |
D | Main.java | 71 int hash = obj.hashCode(); in main() local 74 if (hash != result) { in main() 75 throw new Error("Query #" + i + " wrong. Expected " + hash + ", got " + result); in main()
|
/art/runtime/native/ |
D | java_lang_VMClassLoader.cc | 44 size_t hash, in LookupClass() argument 48 return cl->LookupClass(self, descriptor, hash, class_loader); in LookupClass() 55 size_t hash, in FindClassInPathClassLoader() argument 59 if (cl->FindClassInBaseDexClassLoader(soa, self, descriptor, hash, class_loader, &result)) { in FindClassInPathClassLoader()
|
/art/test/120-hashcode/ |
D | info.txt | 1 Check that object hashCode and System.identityHashCode never cause the hash to change.
|
/art/tools/class2greylist/src/com/android/class2greylist/ |
D | PackageAndClassName.java | 65 return Objects.hash(packageName, className); in hashCode()
|