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

/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/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.
117 /// doRehash - re-new the hash tabl
[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/compile/mclinker/include/mcld/LD/
H A DStringUnorderedMap.h52 * \brief The most simple hash of linked list version.
96 // array of pointers to hash entries
165 HashFunction hash; local
166 size_t hashVal = hash(pStr);
/frameworks/av/media/libstagefright/foundation/
H A DAString.cpp116 size_t AString::hash() const { function in class:android::AString
/frameworks/base/core/java/com/android/internal/widget/
H A DLockSettingsService.java210 public void setLockPattern(byte[] hash, int userId) throws RemoteException { argument
213 writeFile(getLockPatternFilename(userId), hash);
217 public boolean checkPattern(byte[] hash, int userId) throws RemoteException { argument
228 // Compare the hash from the file with the entered pattern's hash
229 return Arrays.equals(stored, hash);
240 public void setLockPassword(byte[] hash, int userId) throws RemoteException { argument
243 writeFile(getLockPasswordFilename(userId), hash);
247 public boolean checkPassword(byte[] hash, int userId) throws RemoteException { argument
259 // Compare the hash fro
293 writeFile(String name, byte[] hash) argument
[all...]
/frameworks/native/include/utils/
H A DBasicHashtable.h32 // such that at least two entries both hash to this bucket. When true, we
39 // Mask for 30 bits worth of the hash code that are stored within the bucket to
41 // hash code of the entry's key.
45 // a 30 bit hash code.
68 ssize_t find(ssize_t index, hash_t hash, const void* __restrict__ key) const;
69 size_t add(hash_t hash, const void* __restrict__ entry);
118 // Trim a hash code to 30 bits to match what we store in the bucket's cookie.
119 inline static hash_t trimHash(hash_t hash) { argument
120 return (hash & Bucket::HASH_MASK) ^ (hash >> 3
126 chainStart(hash_t hash, size_t count) argument
133 chainIncrement(hash_t hash, size_t count) argument
279 find(ssize_t index, hash_t hash, const TKey& key) const argument
292 add(hash_t hash, const TEntry& entry) argument
[all...]
/frameworks/native/libs/utils/
H A DBasicHashtable.cpp109 ssize_t BasicHashtableImpl::find(ssize_t index, hash_t hash, argument
115 hash = trimHash(hash);
117 index = chainStart(hash, mBucketCount);
131 size_t inc = chainIncrement(hash, mBucketCount);
137 if ((bucket.cookie & Bucket::HASH_MASK) == hash
148 size_t BasicHashtableImpl::add(hash_t hash, const void* entry) { argument
155 hash = trimHash(hash);
157 size_t index = chainStart(hash, mBucketCoun
213 hash_t hash = fromBucket.cookie & Bucket::HASH_MASK; local
[all...]
H A DZipFileRO.cpp99 * want to adjust the hash table index by a fixed amount. Using a large
116 * Convert a ZipEntryRO to a hash table index, verifying that it's in a
350 * Create hash table. We have a minimum 75% load factor, possibly as
357 * Walk through the central directory, adding entries to the hash
377 unsigned int fileNameLen, extraLen, commentLen, hash; local
383 /* add the CDE filename to the hash table */
384 hash = computeHash((const char*)ptr + kCDELen, fileNameLen);
385 addToHash((const char*)ptr + kCDELen, fileNameLen, hash);
402 * Simple string hash function for non-null-terminated strings.
406 unsigned int hash local
417 addToHash(const char* str, int strLen, unsigned int hash) argument
447 unsigned int hash = computeHash(fileName, nameLen); local
[all...]
/frameworks/native/libs/utils/tests/
H A DBasicHashtable_test.cpp108 bool* collision, bool* present, hash_t* hash) {
112 *hash = cookie & BasicHashtable<TKey, TEntry>::Bucket::HASH_MASK;
163 hash_t hash; local
164 BasicHashtableTest::cookieAt(h, i, &collision, &present, &hash);
168 ALOGD(" [%3u] = collision=%d, present=%d, hash=0x%08x, key=%3d, value=%3d, "
170 i, collision, present, hash, key, value, hash_type(key));
107 cookieAt(const BasicHashtable<TKey, TEntry>& h, size_t index, bool* collision, bool* present, hash_t* hash) argument
/frameworks/av/media/libstagefright/httplive/
H A DLiveSession.cpp331 uint8_t hash[16]; local
337 MD5_Final(hash, &m);
339 if (mPlaylist != NULL && !memcmp(hash, mPlaylistHash, 16)) {
354 memcpy(mPlaylistHash, hash, sizeof(hash));
/frameworks/base/core/java/android/bluetooth/
H A DBluetoothDevice.java695 * @param hash - Simple Secure pairing hash
701 public boolean createBondOutOfBand(byte[] hash, byte[] randomizer) { argument
705 return sService.createBondOutOfBand(this, hash, randomizer);
717 * @param hash Simple Secure pairing hash
723 public boolean setDeviceOutOfBandData(byte[] hash, byte[] randomizer) { argument
727 return sService.setDeviceOutOfBandData(this, hash, randomizer);
/frameworks/compile/mclinker/lib/Target/
H A DGNULDBackend.cpp694 /// .dynsym, .dynstr, and .hash
708 size_t hash = 0; local
726 // compute size of .dynstr and .hash
753 // compute .hash
755 hash = (2 + getHashBucketCount(dynsym, false) + dynsym) *
765 file_format->getHashTab().setSize(hash);
782 // .dynstr, .symtab, .strtab and .hash, we can not reserve non-DT_NEEDED
896 /// emitNamePools - emit dynamic name pools - .dyntab, .dynstr, .hash
1041 // emit hash table
1042 // FIXME: this verion only emit SVR4 hash sectio
[all...]

Completed in 2912 milliseconds