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

/frameworks/base/libs/hwui/utils/
H A DTinyHashMap.h26 * A very simple hash map that doesn't allow duplicate keys, overwriting the older entry.
36 * Puts an entry in the hash, removing any existing entry with the same key
39 hash_t hash = hash_t(key); local
41 ssize_t index = mTable.find(-1, hash, key);
47 mTable.add(hash, initEntry);
54 hash_t hash = hash_t(key); local
55 ssize_t index = mTable.find(-1, hash, key);
/frameworks/base/sax/java/android/sax/
H A DChildren.java31 int hash = uri.hashCode() * 31 + localName.hashCode();
32 int index = hash & 15;
37 current = new Child(parent, uri, localName, parent.depth + 1, hash);
44 if (current.hash == hash
56 current = new Child(parent, uri, localName, parent.depth + 1, hash);
66 int hash = uri.hashCode() * 31 + localName.hashCode();
67 int index = hash & 15;
74 if (current.hash == hash
88 final int hash; field in class:Children.Child
91 Child(Element parent, String uri, String localName, int depth, int hash) argument
[all...]
/frameworks/base/tools/layoutlib/create/src/com/android/tools/layoutlib/java/
H A DObjects.java84 * This can be used to compute a hash code for an object's fields as follows:
85 * {@code Objects.hash(a, b, c)}.
87 public static int hash(Object... values) { method in class:Objects
/frameworks/compile/mclinker/include/mcld/Object/
H A DSectionMap.h40 unsigned int hash; member in struct:mcld::SectionMap::NamePair
77 static unsigned int hash(const std::string& pString);
/frameworks/compile/mclinker/lib/Object/
H A DSectionMap.cpp23 : hash(-1) {
28 hash = SectionMap::hash(pFrom);
41 unsigned int hash = SectionMap::hash(pFrom); local
42 return find(pFrom, hash);
47 unsigned int hash = SectionMap::hash(pFrom); local
48 return find(pFrom, hash);
101 if (!hash
113 unsigned int SectionMap::hash(const std::string& pString) function in class:SectionMap
[all...]
/frameworks/base/tools/aapt/
H A DResourceIdCache.cpp36 static inline uint32_t hashround(uint32_t hash, int c) { argument
37 return ((hash << 5) + hash) + c; /* hash * 33 + c */
40 static uint32_t hash(const android::String16& hashableString) { function
41 uint32_t hash = 5381; local
43 while (int c = *str++) hash = hashround(hash, c);
44 return hash;
65 const uint32_t hashcode = hash(hashedNam
[all...]
/frameworks/compile/mclinker/include/mcld/ADT/
H A DHashBase.h27 * \brief HashBucket is an entry in the hash table.
48 * HashTableImpl uses open-addressing, linear probing hash table.
49 * linear probing hash table obviously has high performance when the
52 * than the size of the hash table.
62 * example, on-device linkers needs a more light-weight hash function
64 * change the hash functions.
96 hasher& hash() function in class:mcld::HashTableImpl
99 const hasher& hash() const function in class:mcld::HashTableImpl
103 /// initialize the hash table.
119 /// doRehash - re-new the hash tabl
[all...]
H A DStringHash.h21 namespace hash { namespace in namespace:mcld
71 * \brief JS hash funciton
88 * \brief P.J. Weinberger hash function
114 * \brief ELF hash function.
135 * \brief BKDR hash function
153 * \brief SDBM hash function
170 * \brief DJB hash function
188 * \brief DEK hash function
206 * \brief BP hash function
223 * \brief FNV hash functio
[all...]
/frameworks/base/libs/hwui/
H A DTextDropShadowCache.cpp33 hash_t ShadowText::hash() const { function in class:android::uirenderer::ShadowText
35 uint32_t hash = JenkinsHashMix(0, len); local
36 hash = JenkinsHashMix(hash, android::hash_type(radius));
37 hash = JenkinsHashMix(hash, android::hash_type(textSize));
38 hash = JenkinsHashMix(hash, android::hash_type(typeface));
39 hash = JenkinsHashMix(hash, flag
[all...]
H A DGradientCache.cpp42 hash_t GradientCacheEntry::hash() const { function in class:android::uirenderer::GradientCacheEntry
43 uint32_t hash = JenkinsHashMix(0, count); local
45 hash = JenkinsHashMix(hash, android::hash_type(colors[i]));
46 hash = JenkinsHashMix(hash, android::hash_type(positions[i]));
48 return JenkinsHashWhiten(hash);
H A DPatchCache.cpp69 hash_t PatchCache::PatchDescription::hash() const { function in class:android::uirenderer::PatchCache::PatchDescription
70 uint32_t hash = JenkinsHashMix(0, android::hash_type(mPatch)); local
71 hash = JenkinsHashMix(hash, mBitmapWidth);
72 hash = JenkinsHashMix(hash, mBitmapHeight);
73 hash = JenkinsHashMix(hash, mPixelWidth);
74 hash = JenkinsHashMix(hash, mPixelHeigh
[all...]
H A DPathCache.cpp65 hash_t PathDescription::hash() const { function in class:android::uirenderer::PathDescription
66 uint32_t hash = JenkinsHashMix(0, type); local
67 hash = JenkinsHashMix(hash, join);
68 hash = JenkinsHashMix(hash, cap);
69 hash = JenkinsHashMix(hash, style);
70 hash = JenkinsHashMix(hash, androi
[all...]
/frameworks/base/tests/SmokeTest/tests/src/com/android/smoketest/
H A DProcessErrorsTest.java353 private int hash(Object obj) { method in class:ProcessErrorsTest.ProcessError
365 code *= hash(info.longMsg);
367 code *= hash(info.processName);
368 code *= hash(info.shortMsg);
369 code *= hash(info.stackTrace);
370 code *= hash(info.tag);
/frameworks/testing/app-tests/AppLaunchTest/src/com/android/applaunchtest/
H A DAppLaunchTest.java297 private int hash(Object obj) { method in class:AppLaunchTest.ProcessError
309 code *= hash(info.longMsg);
311 code *= hash(info.processName);
312 code *= hash(info.shortMsg);
313 code *= hash(info.stackTrace);
314 code *= hash(info.tag);
/frameworks/av/media/libstagefright/foundation/
H A DAString.cpp116 size_t AString::hash() const { function in class:android::AString
/frameworks/base/core/java/android/util/
H A DArrayMap.java26 * It keeps its mappings in an array data structure -- an integer array of hash
31 * a hash map).
69 * list; the second entry is a pointer to the int[] hash code array for it.
77 * Special hash array value that indicates the container is immutable.
86 int indexOf(Object key, int hash) { argument
94 int index = ContainerHelpers.binarySearch(mHashes, N, hash);
96 // If the hash code wasn't found, then we have no entry for this key.
108 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
113 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
119 // hash chai
[all...]
H A DArraySet.java65 * list; the second entry is a pointer to the int[] hash code array for it.
77 private int indexOf(Object key, int hash) { argument
85 int index = ContainerHelpers.binarySearch(mHashes, N, hash);
87 // If the hash code wasn't found, then we have no entry for this key.
99 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
104 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
110 // hash chain to reduce the number of array entries that will
125 // If the hash code wasn't found, then we have no entry for this key.
148 // hash chain to reduce the number of array entries that will
323 final int hash;
[all...]
/frameworks/support/v4/java/android/support/v4/util/
H A DSimpleArrayMap.java50 * list; the second entry is a pointer to the int[] hash code array for it.
61 int indexOf(Object key, int hash) { argument
69 int index = ContainerHelpers.binarySearch(mHashes, N, hash);
71 // If the hash code wasn't found, then we have no entry for this key.
83 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
88 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
94 // hash chain to reduce the number of array entries that will
109 // If the hash code wasn't found, then we have no entry for this key.
132 // hash chain to reduce the number of array entries that will
364 final int hash;
[all...]
/frameworks/base/services/java/com/android/server/
H A DLockSettingsService.java282 final byte[] hash = LockPatternUtils.patternToHash(
284 writeFile(getLockPatternFilename(userId), hash);
308 // Compare the hash from the file with the entered pattern's hash
309 final byte[] hash = LockPatternUtils.patternToHash(
311 final boolean matched = Arrays.equals(stored, hash);
337 // Compare the hash from the file with the entered password's hash
338 final byte[] hash = mLockPatternUtils.passwordToHash(password);
339 final boolean matched = Arrays.equals(stored, hash);
375 writeFile(String name, byte[] hash) argument
[all...]
/frameworks/av/media/libstagefright/httplive/
H A DLiveSession.cpp623 uint8_t hash[16]; local
629 MD5_Final(hash, &m);
631 if (curPlaylistHash != NULL && !memcmp(hash, curPlaylistHash, 16)) {
642 memcpy(curPlaylistHash, hash, sizeof(hash));
/frameworks/base/libs/androidfw/
H A DZipFileRO.cpp87 * want to adjust the hash table index by a fixed amount. Using a large
104 * Convert a ZipEntryRO to a hash table index, verifying that it's in a
351 * Create hash table. We have a minimum 75% load factor, possibly as
358 * Walk through the central directory, adding entries to the hash
396 /* add the CDE filename to the hash table */
397 unsigned int hash = computeHash(name, nameLen); local
398 addToHash(name, nameLen, hash);
416 * Simple string hash function for non-null-terminated strings.
420 unsigned int hash = 0; local
423 hash
431 addToHash(const char* str, int strLen, unsigned int hash) argument
461 unsigned int hash = computeHash(fileName, nameLen); local
[all...]
/frameworks/base/libs/hwui/font/
H A DFont.cpp75 hash_t Font::FontDescription::hash() const { function in class:android::uirenderer::Font::FontDescription
76 uint32_t hash = JenkinsHashMix(0, mFontId); local
77 hash = JenkinsHashMix(hash, android::hash_type(mFontSize));
78 hash = JenkinsHashMix(hash, android::hash_type(mFlags));
79 hash = JenkinsHashMix(hash, android::hash_type(mItalicStyle));
80 hash = JenkinsHashMix(hash, androi
[all...]
/frameworks/base/core/java/android/bluetooth/
H A DBluetoothDevice.java756 * @param hash - Simple Secure pairing hash
762 public boolean createBondOutOfBand(byte[] hash, byte[] randomizer) { argument
766 return sService.createBondOutOfBand(this, hash, randomizer);
778 * @param hash Simple Secure pairing hash
784 public boolean setDeviceOutOfBandData(byte[] hash, byte[] randomizer) { argument
788 return sService.setDeviceOutOfBandData(this, hash, randomizer);
/frameworks/base/core/jni/android/graphics/
H A DTextLayoutCache.cpp295 hash_t TextLayoutCacheKey::hash() const { function in class:android::TextLayoutCacheKey
296 uint32_t hash = JenkinsHashMix(0, start); local
297 hash = JenkinsHashMix(hash, count);
299 hash = JenkinsHashMix(hash, hash_type(typeface));
300 hash = JenkinsHashMix(hash, hash_type(textSize));
301 hash = JenkinsHashMix(hash, hash_typ
[all...]
/frameworks/compile/mclinker/lib/Target/
H A DGNULDBackend.cpp723 /// .dynsym, .dynstr, .hash and .shstrtab.
738 size_t hash = 0; local
778 // compute .gnu.hash
781 // count the number of dynsym to hash
798 // compute .hash
802 hash = (2 + getHashBucketCount(dynsym, false) + dynsym) *
834 file_format->getHashTab().setSize(hash);
842 // .dynstr, .symtab, .strtab and .hash, we can not reserve non-DT_NEEDED
1013 /// emitDynNamePools - emit dynamic name pools - .dyntab, .dynstr, .hash
1063 // emit .gnu.hash
1249 uint32_t hash = djbhash % nbucket; local
[all...]

Completed in 3445 milliseconds