Home
last modified time | relevance | path

Searched refs:hash (Results 1 – 25 of 85) sorted by relevance

1234

/art/libartbase/base/
Ddata_hash.h26 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 …]
Dstl_util.h130 uint32_t hash = 2166136261u; in operator() local
132 hash = (hash ^ value) * 16777619u; in operator()
134 return hash; in operator()
Dhash_set.h139 std::hash<T>>::type;
427 iterator FindWithHash(const K& key, size_t hash) { in FindWithHash() argument
428 return iterator(this, FindIndex(key, hash)); in FindWithHash()
432 const_iterator FindWithHash(const K& key, size_t hash) const { in FindWithHash() argument
433 return const_iterator(this, FindIndex(key, hash)); in FindWithHash()
455 iterator InsertWithHash(U&& element, size_t hash) { in InsertWithHash() argument
456 DCHECK_EQ(hash, hashfn_(element)); in InsertWithHash()
461 const size_t index = FirstAvailableSlot(IndexForHash(hash)); in InsertWithHash()
594 size_t IndexForHash(size_t hash) const { in IndexForHash() argument
599 return hash % num_buckets_; in IndexForHash()
[all …]
Dbit_table.h309 uint32_t hash = hasher(MemoryRegion(values, sizeof(Entry) * count)); variable
312 auto range = dedup_.equal_range(hash);
329 dedup_.emplace(hash, index);
422 uint32_t hash = hasher(region); in Dedup() local
425 auto range = dedup_.equal_range(hash); in Dedup()
437 dedup_.emplace(hash, index); in Dedup()
/art/runtime/
Dbacktrace_helper.h56 uint64_t hash = 9314237; in Hash() local
58 hash = hash * 2654435761 + frames_[i]; in Hash()
59 hash += (hash >> 13) ^ (hash << 6); in Hash()
61 return hash; in Hash()
Dclass_table.cc60 mirror::Class* ClassTable::UpdateClass(const char* descriptor, mirror::Class* klass, size_t hash) { in UpdateClass() argument
63 DescriptorHashPair pair(descriptor, hash); in UpdateClass()
64 auto existing_it = classes_.back().FindWithHash(pair, hash); in UpdateClass()
67 if (class_set.FindWithHash(pair, hash) != class_set.end()) { in UpdateClass()
81 *existing_it = TableSlot(klass, hash); in UpdateClass()
124 mirror::Class* ClassTable::Lookup(const char* descriptor, size_t hash) { in Lookup() argument
125 DescriptorHashPair pair(descriptor, hash); in Lookup()
128 auto it = class_set.FindWithHash(pair, hash); in Lookup()
150 const uint32_t hash = TableSlot::HashDescriptor(klass); in Insert() local
152 classes_.back().InsertWithHash(TableSlot(klass, hash), hash); in Insert()
[all …]
Dclass_table.h75 static uint32_t MaskHash(uint32_t hash) { in MaskHash() argument
76 return hash & kHashMask; in MaskHash()
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)
Dclass_table-inl.h132 const uint32_t hash = ComputeModifiedUtf8Hash(klass->GetDescriptor(&temp)); in TableSlot() local
133 CHECK_EQ(descriptor_hash, hash); in TableSlot()
/art/compiler/utils/
Ddedupe_set_test.cc33 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 ()()
Ddedupe_set-inl.h71 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/
Dutf.h81 uint32_t hash = 0; in ComputeUtf16Hash() local
83 hash = hash * 31 + *chars++; in ComputeUtf16Hash()
85 return static_cast<int32_t>(hash); in ComputeUtf16Hash()
Dutf.cc178 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()
Dtype_lookup_table.cc53 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()
Ddex_file_types.h98 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_);
Dtype_lookup_table_test.cc45 size_t hash = ComputeModifiedUtf8Hash(descriptor); in TEST_P() local
46 uint32_t class_def_idx = table.Lookup(descriptor, hash); in TEST_P()
Dtype_lookup_table.h73 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/
Dobjects.cc48 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/openjdkjvmti/
Dti_breakpoint.h56 size_t hash() const;
87 template<> struct hash<openjdkjvmti::Breakpoint> {
89 return b.hash();
Dti_breakpoint.cc56 size_t Breakpoint::hash() const { in hash() function in openjdkjvmti::Breakpoint
57 return std::hash<uintptr_t> {}(reinterpret_cast<uintptr_t>(method_)) in hash()
58 ^ std::hash<jlocation> {}(location_); in hash()
/art/test/920-objects/src/art/
DTest920.java88 private int hash; field in Test920.MyHash
91 hash = h; in MyHash()
95 return hash; in hashCode()
/art/test/004-SignalTest/src/
DMain.java32 int hash = o.hashCode(); in main() local
35 System.out.println("hash: " + hash); in main()
/art/test/522-checker-regression-monitor-exit/src/
DMain.java71 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/
Djava_lang_VMClassLoader.cc44 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/
Dinfo.txt1 Check that object hashCode and System.identityHashCode never cause the hash to change.
/art/libelffile/elf/
Delf_builder.h730 std::vector<Elf_Word> hash; in PrepareDynamicSection() local
731 hash.push_back(1); // Number of buckets. in PrepareDynamicSection()
732 hash.push_back(count); // Number of chains. in PrepareDynamicSection()
734 hash.push_back(1); // Point to first non-NULL symbol. in PrepareDynamicSection()
736 hash.push_back(0); // Dummy entry for the NULL symbol. in PrepareDynamicSection()
738 hash.push_back(i + 1); // Each symbol points to the next one. in PrepareDynamicSection()
740 hash.push_back(0); // Last symbol terminates the chain. in PrepareDynamicSection()
741 hash_.Add(hash.data(), hash.size() * sizeof(hash[0])); in PrepareDynamicSection()

1234