/frameworks/base/libs/hwui/ |
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.h | 103 hash_t hash() const; 128 return entry.hash();
|
H A D | TextDropShadowCache.h | 62 hash_t hash() const; 112 return entry.hash();
|
H A D | GradientCache.h | 64 hash_t hash() const; 103 return entry.hash();
|
H A D | PathCache.h | 150 hash_t hash() const; 172 return entry.hash();
|
/frameworks/base/core/jni/android/graphics/ |
H A D | TextLayoutCache.cpp | 296 hash_t TextLayoutCacheKey::hash() const { function in class:android::TextLayoutCacheKey 297 uint32_t hash = JenkinsHashMix(0, start); local 298 hash = JenkinsHashMix(hash, count); 300 hash = JenkinsHashMix(hash, hash_type(typeface)); 301 hash = JenkinsHashMix(hash, hash_type(textSize)); 302 hash = JenkinsHashMix(hash, hash_typ [all...] |
H A D | TextLayoutCache.h | 93 hash_t hash() const; 119 return key.hash();
|
/frameworks/base/core/java/android/util/ |
H A D | ArrayMap.java | 26 * 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 D | ArraySet.java | 65 * 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 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 364 final int hash; [all...] |
/frameworks/compile/mclinker/include/mcld/LD/ |
H A D | Archive.h | 97 hash::StringCompare<llvm::StringRef> > ArchiveMemberEntryType; 101 hash::StringHash<hash::ELF>,
|
H A D | BranchIsland.h | 128 hash::StringHash<hash::ELF> str_hasher;
|
/frameworks/base/tests/SmokeTest/tests/src/com/android/smoketest/ |
H A D | ProcessErrorsTest.java | 353 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 D | AppLaunchTest.java | 297 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/base/services/java/com/android/server/ |
H A D | LockSettingsService.java | 282 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/base/libs/androidfw/ |
H A D | ZipFileRO.cpp | 87 * 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/core/java/com/android/internal/http/ |
H A D | HttpDateTime.java | 148 int hash = Character.toLowerCase(monthString.charAt(0)) + 151 switch (hash) {
|
/frameworks/base/libs/hwui/font/ |
H A D | Font.h | 55 hash_t hash() const; 160 return entry.hash();
|
/frameworks/av/include/media/stagefright/foundation/ |
H A D | AString.h | 67 size_t hash() const;
|
/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/core/java/android/text/ |
H A D | SpannableStringBuilder.java | 1326 int hash = toString().hashCode(); 1327 hash = hash * 31 + mSpanCount; 1331 hash = hash * 31 + span.hashCode(); 1333 hash = hash * 31 + getSpanStart(span); 1334 hash = hash * 31 + getSpanEnd(span); 1335 hash [all...] |
/frameworks/base/include/androidfw/ |
H A D | ZipFileRO.h | 56 * and load a hash table with pointers to the filenames (which aren't 65 * of the string length into the hash table entry. 106 * that further by returning the Nth non-empty entry in the hash table 213 /* add a new entry to the hash table */ 214 void addToHash(const char* str, int strLen, unsigned int hash); 216 /* compute string hash code */ 219 /* convert a ZipEntryRO back to a hash table index */ 223 * One entry in the hash table. 228 //unsigned int hash; 254 * fixed-size hash tabl [all...] |
/frameworks/base/core/java/android/bluetooth/ |
H A D | BluetoothDevice.java | 756 * @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/java/com/android/internal/widget/ |
H A D | LockPatternUtils.java | 689 byte[] hash = passwordToHash(password); 690 passwordHistory = new String(hash) + "," + passwordHistory; 693 passwordHistory = passwordHistory.substring(0, Math.min(hash.length 773 * Generate an SHA-1 hash for the pattern. Not the most secure, but it is 777 * @return the hash of the pattern in a byte array. 792 byte[] hash = md.digest(res); 793 return hash; 815 * Generate a hash for the given password. To avoid brute force attacks, we use a salted hash. 819 * @return the hash o [all...] |
/frameworks/av/media/libstagefright/foundation/ |
H A D | AString.cpp | 116 size_t AString::hash() const { function in class:android::AString
|