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

12

/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/com/android/internal/widget/
H A DILockSettings.aidl27 void setLockPattern(in byte[] hash, int userId);
28 boolean checkPattern(in byte[] hash, int userId);
29 void setLockPassword(in byte[] hash, int userId);
30 boolean checkPassword(in byte[] hash, int userId);
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...]
H A DLockPatternUtils.java495 // Compute the hash
496 final byte[] hash = LockPatternUtils.patternToHash(pattern);
498 getLockSettings().setLockPattern(hash, getCurrentOrCallingUserId());
611 // Compute the hash
612 final byte[] hash = passwordToHash(password);
614 getLockSettings().setLockPassword(hash, userHandle);
683 passwordHistory = new String(hash) + "," + passwordHistory;
686 passwordHistory = passwordHistory.substring(0, Math.min(hash.length
771 * Generate an SHA-1 hash for the pattern. Not the most secure, but it is
775 * @return the hash o
[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/base/location/java/android/location/
H A DCountry.java176 int hash = mHashCode;
177 if (hash == 0) {
178 hash = 17;
179 hash = hash * 13 + mCountryIso.hashCode();
180 hash = hash * 13 + mSource;
181 mHashCode = hash;
/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...]
H A DZipFileRO.h56 * 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/opt/telephony/src/java/android/telephony/
H A DSmsCbLocation.java105 int hash = mPlmn.hashCode();
106 hash = hash * 31 + mLac;
107 hash = hash * 31 + mCid;
108 return hash;
/frameworks/base/core/java/android/content/pm/
H A DVerificationParams.java173 int hash = 3;
175 hash += 5 * (mVerificationURI == null ? 1 : mVerificationURI.hashCode());
176 hash += 7 * (mOriginatingURI == null ? 1 : mOriginatingURI.hashCode());
177 hash += 11 * (mReferrer == null ? 1 : mReferrer.hashCode());
178 hash += 13 * mOriginatingUid;
179 hash += 17 * (mManifestDigest == null ? 1 : mManifestDigest.hashCode());
180 hash += 19 * mInstallerUid;
182 return hash;
H A DContainerEncryptionParams.java260 int hash = 3;
262 hash += 5 * mEncryptionAlgorithm.hashCode();
263 hash += 7 * Arrays.hashCode(mEncryptionSpec.getIV());
264 hash += 11 * mEncryptionKey.hashCode();
265 hash += 13 * mMacAlgorithm.hashCode();
266 hash += 17 * mMacKey.hashCode();
267 hash += 19 * Arrays.hashCode(mMacTag);
268 hash += 23 * mAuthenticatedDataStart;
269 hash += 29 * mEncryptedDataStart;
270 hash
[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/base/services/java/com/android/server/am/
H A DPendingIntentRecord.java76 int hash = 23;
77 hash = (ODD_PRIME_NUMBER*hash) + _f;
78 hash = (ODD_PRIME_NUMBER*hash) + _r;
79 hash = (ODD_PRIME_NUMBER*hash) + _userId;
81 hash = (ODD_PRIME_NUMBER*hash) + _w.hashCode();
84 hash
[all...]
/frameworks/base/tests/CoreTests/android/core/
H A DSha1Test.java50 byte[] hash = digest.digest();
51 String encodedHash = encodeHex(hash);
/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/opt/vcard/java/com/android/vcard/
H A DVCardEntry.java244 int hash = 0;
246 hash = hash * 31 + (hashTarget != null ? hashTarget.hashCode() : 0);
248 return hash;
360 int hash = mType;
361 hash = hash * 31 + (mNumber != null ? mNumber.hashCode() : 0);
362 hash = hash * 31 + (mLabel != null ? mLabel.hashCode() : 0);
363 hash
[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/base/cmds/am/
H A DAndroid.mk27 $(TARGET_OUT_NOTICE_FILES)/hash-timestamp: $(TARGET_OUT_NOTICE_FILES)/src/$(1).txt
/frameworks/base/cmds/content/
H A DAndroid.mk29 $(TARGET_OUT_NOTICE_FILES)/hash-timestamp: $(TARGET_OUT_NOTICE_FILES)/src/$(1).txt
/frameworks/base/core/java/com/android/internal/http/
H A DHttpDateTime.java148 int hash = Character.toLowerCase(monthString.charAt(0)) +
151 switch (hash) {
/frameworks/av/include/media/stagefright/foundation/
H A DAString.h67 size_t hash() const;
/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/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/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);

Completed in 686 milliseconds

12