/frameworks/base/libs/hwui/utils/ |
H A D | TinyHashMap.h | 26 * A very simple hash map that doesn't allow duplicate keys, overwriting the older entry. 34 * Puts an entry in the hash, removing any existing entry with the same key 37 hash_t hash = android::hash_type(key); local 39 ssize_t index = mTable.find(-1, hash, key); 45 mTable.add(hash, initEntry); 52 hash_t hash = android::hash_type(key); local 53 ssize_t index = mTable.find(-1, hash, key);
|
/frameworks/base/sax/java/android/sax/ |
H A D | Children.java | 31 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/core/java/android/hardware/camera2/marshal/ |
H A D | MarshalRegistry.java | 104 this.hash = typeReference.hashCode() ^ nativeType; 109 private final int hash; field in class:MarshalRegistry.MarshalToken 124 return hash;
|
/frameworks/base/tools/layoutlib/create/src/com/android/tools/layoutlib/java/ |
H A D | Objects.java | 84 * 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/base/tools/aapt/ |
H A D | ResourceIdCache.cpp | 34 static inline uint32_t hashround(uint32_t hash, int c) { argument 35 return ((hash << 5) + hash) + c; /* hash * 33 + c */ 38 static uint32_t hash(const android::String16& hashableString) { function 39 uint32_t hash = 5381; local 41 while (int c = *str++) hash = hashround(hash, c); 42 return hash; 63 const uint32_t hashcode = hash(hashedNam [all...] |
/frameworks/compile/mclinker/include/mcld/ADT/ |
H A D | HashBase.h | 24 * \brief HashBucket is an entry in the hash table. 45 * HashTableImpl uses open-addressing, linear probing hash table. 46 * linear probing hash table obviously has high performance when the 49 * than the size of the hash table. 59 * example, on-device linkers needs a more light-weight hash function 61 * change the hash functions. 93 hasher& hash() function in class:mcld::HashTableImpl 96 const hasher& hash() const function in class:mcld::HashTableImpl 100 /// initialize the hash table. 116 /// doRehash - re-new the hash tabl [all...] |
H A D | StringHash.h | 18 namespace hash { namespace in namespace:mcld 69 * \brief JS hash funciton 86 * \brief P.J. Weinberger hash function 112 * \brief ELF hash function. 133 * \brief BKDR hash function 151 * \brief SDBM hash function 168 * \brief DJB hash function 186 * \brief DEK hash function 204 * \brief BP hash function 221 * \brief FNV hash functio [all...] |
/frameworks/base/libs/hwui/ |
H A D | TextDropShadowCache.cpp | 33 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 D | GradientCache.cpp | 42 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 D | PatchCache.cpp | 69 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 D | PathCache.cpp | 66 hash_t PathDescription::hash() const { function in class:android::uirenderer::PathDescription 67 uint32_t hash = JenkinsHashMix(0, type); local 68 hash = JenkinsHashMix(hash, join); 69 hash = JenkinsHashMix(hash, cap); 70 hash = JenkinsHashMix(hash, style); 71 hash = JenkinsHashMix(hash, androi [all...] |
H A D | TessellationCache.cpp | 58 hash_t TessellationCache::Description::hash() const { function in class:android::uirenderer::TessellationCache::Description 59 uint32_t hash = JenkinsHashMix(0, type); local 60 hash = JenkinsHashMix(hash, aa); 61 hash = JenkinsHashMix(hash, cap); 62 hash = JenkinsHashMix(hash, style); 63 hash = JenkinsHashMix(hash, androi 88 hash_t TessellationCache::ShadowDescription::hash() const { function in class:android::uirenderer::TessellationCache::ShadowDescription 89 uint32_t hash = JenkinsHashMixBytes(0, (uint8_t*) &nodeKey, sizeof(const void*)); local [all...] |
/frameworks/base/tests/SmokeTest/tests/src/com/android/smoketest/ |
H A D | ProcessErrorsTest.java | 364 private int hash(Object obj) { method in class:ProcessErrorsTest.ProcessError 376 code *= hash(info.longMsg); 378 code *= hash(info.processName); 379 code *= hash(info.shortMsg); 380 code *= hash(info.stackTrace); 381 code *= hash(info.tag);
|
/frameworks/compile/libbcc/lib/Renderscript/ |
H A D | RSInfo.cpp | 43 static std::string stringFromSourceHash(const RSInfo::DependencyHashTy& hash) { argument 48 snprintf(buf, sizeof(buf), "%02x", hash[i]); 157 ALOGV("Source hash: NULL!"); 159 ALOGV("Source hash: %s", stringFromSourceHash(mSourceHash).c_str());
|
/frameworks/av/media/libstagefright/foundation/ |
H A D | AString.cpp | 125 size_t AString::hash() const { function in class:android::AString
|
/frameworks/base/core/java/android/util/ |
H A D | ArrayMap.java | 28 * It keeps its mappings in an array data structure -- an integer array of hash 33 * a hash map). 71 * list; the second entry is a pointer to the int[] hash code array for it. 79 * Special hash array value that indicates the container is immutable. 88 int indexOf(Object key, int hash) { argument 96 int index = ContainerHelpers.binarySearch(mHashes, N, hash); 98 // If the hash code wasn't found, then we have no entry for this key. 110 for (end = index + 1; end < N && mHashes[end] == hash; end++) { 115 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) { 121 // hash chai [all...] |
H A D | ArraySet.java | 67 * list; the second entry is a pointer to the int[] hash code array for it. 79 private int indexOf(Object key, int hash) { argument 87 int index = ContainerHelpers.binarySearch(mHashes, N, hash); 89 // If the hash code wasn't found, then we have no entry for this key. 101 for (end = index + 1; end < N && mHashes[end] == hash; end++) { 106 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) { 112 // hash chain to reduce the number of array entries that will 127 // If the hash code wasn't found, then we have no entry for this key. 150 // hash chain to reduce the number of array entries that will 342 final int hash; [all...] |
/frameworks/minikin/include/minikin/ |
H A D | FontFamily.h | 82 hash_t hash() const { return bits; } function in class:android::FontStyle 99 return style.hash();
|
/frameworks/support/v4/java/android/support/v4/util/ |
H A D | SimpleArrayMap.java | 50 * 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 374 final int hash; [all...] |
/frameworks/compile/mclinker/lib/Target/ARM/ |
H A D | ARMELFAttributeData.cpp | 667 int hash = calculate_fp_config_hash(pConfig); local 668 assert(static_cast<size_t>(hash) < num_hash_table_entries); 669 return fp_config_hash_table[hash];
|
/frameworks/base/libs/hwui/font/ |
H A D | Font.cpp | 75 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/services/core/java/com/android/server/ |
H A D | LockSettingsStorage.java | 211 private void writeFile(String name, byte[] hash) { argument 215 // Write the hash to file 218 if (hash == null || hash.length == 0) { 221 raf.write(hash, 0, hash.length); 235 mCache.putFile(name, hash); 239 public void writePatternHash(byte[] hash, int userId) { argument 240 writeFile(getLockPatternFilename(userId), hash); 243 public void writePasswordHash(byte[] hash, in argument [all...] |
/frameworks/base/core/java/android/bluetooth/ |
H A D | BluetoothDevice.java | 842 * @param hash - Simple Secure pairing hash 848 public boolean createBondOutOfBand(byte[] hash, byte[] randomizer) { argument 852 return sService.createBondOutOfBand(this, hash, randomizer); 864 * @param hash Simple Secure pairing hash 870 public boolean setDeviceOutOfBandData(byte[] hash, byte[] randomizer) { argument 874 return sService.setDeviceOutOfBandData(this, hash, randomizer);
|
/frameworks/av/media/libstagefright/httplive/ |
H A D | LiveSession.cpp | 961 uint8_t hash[16]; local 967 MD5_Final(hash, &m); 969 if (curPlaylistHash != NULL && !memcmp(hash, curPlaylistHash, 16)) { 977 memcpy(curPlaylistHash, hash, sizeof(hash));
|
/frameworks/minikin/libs/minikin/ |
H A D | Layout.cpp | 85 hash_t hash() const; 202 hash_t LayoutCacheKey::hash() const { function in class:android::LayoutCacheKey 203 uint32_t hash = JenkinsHashMix(0, mId); local 204 hash = JenkinsHashMix(hash, mStart); 205 hash = JenkinsHashMix(hash, mCount); 206 hash = JenkinsHashMix(hash, hash_type(mStyle)); 207 hash [all...] |