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

12

/frameworks/base/core/java/android/bluetooth/
H A DBluetoothHidDeviceAppConfiguration.java33 BluetoothHidDeviceAppConfiguration(long hash) { argument
34 mHash = hash;
56 long hash = in.readLong();
57 return new BluetoothHidDeviceAppConfiguration(hash);
/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/core/java/android/hardware/camera2/marshal/
H A DMarshalRegistry.java109 this.hash = typeReference.hashCode() ^ nativeType;
114 private final int hash; field in class:MarshalRegistry.MarshalToken
129 return hash;
/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/base/libs/hwui/
H A DTextDropShadowCache.cpp32 hash_t ShadowText::hash() const { function in class:android::uirenderer::ShadowText
33 uint32_t hash = JenkinsHashMix(0, glyphCount); local
34 hash = JenkinsHashMix(hash, android::hash_type(radius));
35 hash = JenkinsHashMix(hash, android::hash_type(textSize));
36 hash = JenkinsHashMix(hash, android::hash_type(typeface));
37 hash = JenkinsHashMix(hash, flag
[all...]
H A DPatchCache.cpp49 hash_t PatchCache::PatchDescription::hash() const { function in class:android::uirenderer::PatchCache::PatchDescription
50 uint32_t hash = JenkinsHashMix(0, android::hash_type(mPatch)); local
51 hash = JenkinsHashMix(hash, mBitmapWidth);
52 hash = JenkinsHashMix(hash, mBitmapHeight);
53 hash = JenkinsHashMix(hash, mPixelWidth);
54 hash = JenkinsHashMix(hash, mPixelHeigh
[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 DPathCache.cpp68 // Shape bits should be set to zeroes, because they are used for hash calculation.
80 // Shape bits should be set to zeroes, because they are used for hash calculation.
84 hash_t PathDescription::hash() const { function in class:android::uirenderer::PathDescription
85 uint32_t hash = JenkinsHashMix(0, static_cast<int>(type)); local
86 hash = JenkinsHashMix(hash, join);
87 hash = JenkinsHashMix(hash, cap);
88 hash = JenkinsHashMix(hash, styl
[all...]
/frameworks/base/tools/aapt/
H A DResourceIdCache.cpp34 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 DHashBase.h26 * \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.
88 hasher& hash() { return m_Hasher; } function in class:mcld::HashTableImpl
90 const hasher& hash() const { return m_Hasher; } function in class:mcld::HashTableImpl
93 /// initialize the hash table.
109 /// doRehash - re-new the hash tabl
[all...]
H A DStringHash.h20 namespace hash { namespace in namespace:mcld
56 * \brief JS hash funciton
72 * \brief P.J. Weinberger hash function
100 * \brief ELF hash function.
120 * \brief BKDR hash function
136 * \brief SDBM hash function
152 * \brief DJB hash function
169 * \brief DEK hash function
186 * \brief BP hash function
202 * \brief FNV hash functio
[all...]
/frameworks/av/media/libstagefright/httplive/
H A DHTTPDownloader.cpp245 uint8_t hash[16]; local
251 MD5_Final(hash, &m);
253 if (curPlaylistHash != NULL && !memcmp(hash, curPlaylistHash, 16)) {
273 memcpy(curPlaylistHash, hash, sizeof(hash));
/frameworks/base/tests/SmokeTest/tests/src/com/android/smoketest/
H A DProcessErrorsTest.java364 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/base/tools/aapt2/process/
H A DSymbolTable.h37 std::hash<std::string> str_hash;
38 android::hash_t hash = 0; local
39 hash = android::JenkinsHashMix(hash, (uint32_t)str_hash(name.package));
40 hash = android::JenkinsHashMix(hash, (uint32_t)name.type);
41 hash = android::JenkinsHashMix(hash, (uint32_t)str_hash(name.entry));
42 return hash;
/frameworks/av/media/libstagefright/foundation/
H A DAString.cpp138 size_t AString::hash() const { function in class:android::AString
/frameworks/base/core/java/android/util/
H A DArraySet.java65 * list; the second entry is a pointer to the int[] hash code array for it.
78 private int indexOf(Object key, int hash) { argument
86 int index = ContainerHelpers.binarySearch(mHashes, N, hash);
88 // If the hash code wasn't found, then we have no entry for this key.
100 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
105 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
111 // hash chain to reduce the number of array entries that will
126 // If the hash code wasn't found, then we have no entry for this key.
149 // hash chain to reduce the number of array entries that will
372 final int hash;
[all...]
H A DArrayMap.java29 * It keeps its mappings in an array data structure -- an integer array of hash
34 * a hash map).
76 * Special hash array value that indicates the container is immutable.
89 * list; the second entry is a pointer to the int[] hash code array for it.
102 private static int binarySearchHashes(int[] hashes, int N, int hash) { argument
104 return ContainerHelpers.binarySearch(hashes, N, hash);
114 int indexOf(Object key, int hash) { argument
122 int index = binarySearchHashes(mHashes, N, hash);
124 // If the hash code wasn't found, then we have no entry for this key.
136 for (end = index + 1; end < N && mHashes[end] == hash; en
[all...]
/frameworks/base/core/java/android/util/jar/
H A DStrictJarVerifier.java85 * Stores and a hash and a message digest and verifies that massage digest
86 * matches the hash.
94 private final byte[] hash; field in class:StrictJarVerifier.VerifierEntry
100 VerifierEntry(String name, MessageDigest digest, byte[] hash, argument
104 this.hash = hash;
138 if (!verifyMessageDigest(d, hash)) {
184 * which contains the certificates used to sign the entry and its hash value
230 final String hash = attributes.getValue(algorithm + "-Digest");
231 if (hash
[all...]
/frameworks/base/libs/androidfw/include/androidfw/
H A DStringPiece.h307 struct hash<android::BasicStringPiece<TChar>> { struct in namespace:std
/frameworks/base/packages/Osu/src/com/android/hotspot2/utils/
H A DHTTPRequest.java134 byte[] a1 = hash(userName, realm, passwordString);
135 byte[] a2 = hash("POST", url.getPath());
136 byte[] response = hash(a1, nonceText, nc, cNonceString, "auth", a2);
166 private static byte[] hash(Object... objects) throws GeneralSecurityException { method in class:HTTPRequest
167 MessageDigest hash = MessageDigest.getInstance("MD5");
183 hash.update((byte) ':');
185 hash.update(octets);
188 return hash.digest();
286 byte[] a1 = hash(user, realm, password);
288 byte[] a2 = hash(metho
[all...]
/frameworks/minikin/libs/minikin/
H A DFontFamily.cpp51 android::hash_t FontStyle::hash() const { function in class:minikin::FontStyle
52 uint32_t hash = android::JenkinsHashMix(0, bits); local
53 hash = android::JenkinsHashMix(hash, mLanguageListId);
54 return android::JenkinsHashWhiten(hash);
/frameworks/rs/
H A DrsMap.h56 const size_t index = hash(key) & MAP_NUM_BUCKET_MASK;
144 const size_t index = hash(key) & MAP_NUM_BUCKET_MASK;
158 size_t hash(const KeyType& key) const { return ((size_t)key) >> 4; } function in class:android::renderscript::Map
/frameworks/rs/script_api/
H A DUtilities.cpp126 long hash = 0; local
128 hash = hash * 43 + s[i];
131 stream << "0x" << std::hex << hash << "l"; local
/frameworks/support/compat/java/android/support/v4/util/
H A DArraySet.java70 * list; the second entry is a pointer to the int[] hash code array for it.
83 private int indexOf(Object key, int hash) { argument
91 int index = ContainerHelpers.binarySearch(mHashes, N, hash);
93 // If the hash code wasn't found, then we have no entry for this key.
105 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
110 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
116 // hash chain to reduce the number of array entries that will
131 // If the hash code wasn't found, then we have no entry for this key.
154 // hash chain to reduce the number of array entries that will
361 final int hash;
[all...]
H A DSimpleArrayMap.java63 * list; the second entry is a pointer to the int[] hash code array for it.
74 private static int binarySearchHashes(int[] hashes, int N, int hash) { argument
76 return ContainerHelpers.binarySearch(hashes, N, hash);
86 int indexOf(Object key, int hash) { argument
94 int index = binarySearchHashes(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 chain to reduce the number of array entries that will
134 // If the hash cod
[all...]

Completed in 569 milliseconds

12