/frameworks/base/libs/hwui/ |
TextDropShadowCache.cpp | 32 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, flags) [all...] |
/art/runtime/ |
type_lookup_table.cc | 29 static uint16_t MakeData(uint16_t class_def_idx, uint32_t hash, uint32_t mask) { 31 return (static_cast<uint16_t>(hash) & hash_mask) | class_def_idx; 87 const uint32_t hash = ComputeModifiedUtf8Hash(dex_file.GetStringData(str_id)); local 90 entry.data = MakeData(i, hash, GetSizeMask()); 91 if (!SetOnInitialPos(entry, hash)) { 101 const uint32_t hash = ComputeModifiedUtf8Hash(dex_file.GetStringData(str_id)); local 104 entry.data = MakeData(class_def_idx, hash, GetSizeMask()); 105 Insert(entry, hash); 115 bool TypeLookupTable::SetOnInitialPos(const Entry& entry, uint32_t hash) { 116 const uint32_t pos = hash & GetSizeMask() [all...] |
/external/guava/guava/src/com/google/common/hash/ |
HashingOutputStream.java | 15 package com.google.common.hash; 26 * An {@link OutputStream} that maintains a hash of the data written to it. 64 public HashCode hash() { method in class:HashingOutputStream 65 return hasher.hash();
|
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
btHashedSimplePairCache.cpp | 72 int hash = static_cast<int>(getHash(static_cast<unsigned int>(indexA), static_cast<unsigned int>(indexB)) & (m_overlappingPairArray.capacity()-1)); local 74 if (hash >= m_hashTable.size()) 79 int index = m_hashTable[hash]; 129 int hashValue = static_cast<int>(getHash(static_cast<unsigned int>(indexA),static_cast<unsigned int>(indexB)) & (m_overlappingPairArray.capacity()-1)); // New hash value with new mask 141 int hash = static_cast<int>(getHash(static_cast<unsigned int>(indexA),static_cast<unsigned int>(indexB)) & (m_overlappingPairArray.capacity()-1)); // New hash value with new mask 144 btSimplePair* pair = internalFindPair(indexA, indexB, hash); 159 //hash with new capacity 160 hash = static_cast<int>(getHash(static_cast<unsigned int>(indexA),static_cast<unsigned int>(indexB)) & (m_overlappingPairArray.capacity()-1)); 167 m_next[count] = m_hashTable[hash]; [all...] |
/external/libyuv/files/source/ |
compare_gcc.cc | 92 uint32 hash; local 134 "=g"(hash) // %3 143 return hash;
|
/external/protobuf/java/src/main/java/com/google/protobuf/ |
Internal.java | 253 * need to use the field number as the hash code to ensure compatibility 265 int hash = 1; local 267 hash = 31 * hash + hashEnum(e); 269 return hash; 289 int hash = 1; local 291 hash = 31 * hash + hashCode(bytes); 293 return hash; 300 // The hash code for a byte array should be the same as the hash code for 342 int hash = 1; local [all...] |
/external/robolectric/v1/src/test/java/com/xtremelabs/robolectric/shadows/ |
ShadowEditTextTest.java | 19 HashMap<String, String> hash = new HashMap<String, String>(); local 20 hash.put("android:maxLength", "5"); 21 TestAttributeSet attributeSet = new TestAttributeSet(hash);
|
/external/tpm2/ |
_TPM_Hash_End.c | 51 // Complete hash and extend PCR, or if this is an HCRTM, complete 52 // the hash, reset the H-CRTM register (PCR[0]) to 0...04, and then 56 TPMI_ALG_HASH hash = CryptGetHashAlgByIndex(i); local 61 // Complete hash 62 digest.t.size = CryptGetHashDigestSize(hash); 65 PcrDrtm(pcrHandle, hash, &digest);
|
/toolchain/binutils/binutils-2.25/opcodes/ |
cgen-dis.c | 52 /* Add an instruction to the hash chain. */ 57 unsigned int hash) 68 for (current_buf = htable[hash]; current_buf != NULL; 81 htable[hash] = hentbuf; 86 /* Subroutine of build_dis_hash_table to add INSNS to the hash table. 91 HTABLE points to the hash table. 92 HENTBUF is a pointer to sufficiently large buffer of hash entries. 111 unsigned int hash; local 120 to hash on, so set both up. */ 127 hash = (* cd->dis_hash) (buf, value) 149 unsigned int hash; local 231 unsigned int hash; local [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/util/ |
DSABase.java | 50 byte[] hash = new byte[digest.getDigestSize()]; 52 digest.doFinal(hash, 0); 56 BigInteger[] sig = signer.generateSignature(hash); 70 byte[] hash = new byte[digest.getDigestSize()]; 72 digest.doFinal(hash, 0); 85 return signer.verifySignature(hash, sig[0], sig[1]);
|
/external/guava/guava-tests/test/com/google/common/hash/ |
Murmur3Hash128Test.java | 17 package com.google.common.hash; 19 import static com.google.common.hash.Hashing.murmur3_128; 22 import com.google.common.hash.HashTestUtils.HashFn; 55 assertEquals(expected, murmur3_128(seed).newHasher().putBytes(input).hash()); 71 @Override public byte[] hash(byte[] input, int seed) { 74 return hasher.hash().asBytes();
|
/external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
size_hash.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 31 test_hash<std::hash<NotConstructible> >, 37 test_hash<std::hash<NotConstructible> >(8) 40 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 53 test_hash<std::hash<NotConstructible> >, 59 test_hash<std::hash<NotConstructible> >(8) 62 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
size_hash_equal.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 31 test_hash<std::hash<NotConstructible> >, 37 test_hash<std::hash<NotConstructible> >(8), 41 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 54 test_hash<std::hash<NotConstructible> >, 60 test_hash<std::hash<NotConstructible> >(8), 64 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
size_hash_equal_allocator.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 31 test_hash<std::hash<NotConstructible> >, 37 test_hash<std::hash<NotConstructible> >(8), 42 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 55 test_hash<std::hash<NotConstructible> >, 61 test_hash<std::hash<NotConstructible> >(8), 66 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
size_hash.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 31 test_hash<std::hash<NotConstructible> >, 37 test_hash<std::hash<NotConstructible> >(8) 40 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 53 test_hash<std::hash<NotConstructible> >, 59 test_hash<std::hash<NotConstructible> >(8) 62 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
size_hash_equal.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 31 test_hash<std::hash<NotConstructible> >, 37 test_hash<std::hash<NotConstructible> >(8), 41 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 54 test_hash<std::hash<NotConstructible> >, 60 test_hash<std::hash<NotConstructible> >(8), 64 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
size_hash_equal_allocator.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 31 test_hash<std::hash<NotConstructible> >, 37 test_hash<std::hash<NotConstructible> >(8), 42 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 55 test_hash<std::hash<NotConstructible> >, 61 test_hash<std::hash<NotConstructible> >(8), 66 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
/external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
size_hash_equal.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 31 test_hash<std::hash<NotConstructible> >, 36 test_hash<std::hash<NotConstructible> >(8), 40 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 52 test_hash<std::hash<NotConstructible> >, 57 test_hash<std::hash<NotConstructible> >(8), 61 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
size_hash_equal_allocator.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 31 test_hash<std::hash<NotConstructible> >, 36 test_hash<std::hash<NotConstructible> >(8), 41 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 53 test_hash<std::hash<NotConstructible> >, 58 test_hash<std::hash<NotConstructible> >(8), 63 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
/external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
size_hash_equal.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 31 test_hash<std::hash<NotConstructible> >, 36 test_hash<std::hash<NotConstructible> >(8), 40 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 52 test_hash<std::hash<NotConstructible> >, 57 test_hash<std::hash<NotConstructible> >(8), 61 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
size_hash_equal_allocator.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 31 test_hash<std::hash<NotConstructible> >, 36 test_hash<std::hash<NotConstructible> >(8), 41 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 53 test_hash<std::hash<NotConstructible> >, 58 test_hash<std::hash<NotConstructible> >(8), 63 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
/frameworks/opt/telephony/src/java/android/telephony/ |
SmsCbLocation.java | 103 int hash = mPlmn.hashCode(); local 104 hash = hash * 31 + mLac; 105 hash = hash * 31 + mCid; 106 return hash;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
size_hash.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 31 test_hash<std::hash<NotConstructible> >, 37 test_hash<std::hash<NotConstructible> >(8) 40 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 53 test_hash<std::hash<NotConstructible> >, 59 test_hash<std::hash<NotConstructible> >(8) 62 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
size_hash_equal.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 31 test_hash<std::hash<NotConstructible> >, 37 test_hash<std::hash<NotConstructible> >(8), 41 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 54 test_hash<std::hash<NotConstructible> >, 60 test_hash<std::hash<NotConstructible> >(8), 64 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
size_hash_equal_allocator.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 31 test_hash<std::hash<NotConstructible> >, 37 test_hash<std::hash<NotConstructible> >(8), 42 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 55 test_hash<std::hash<NotConstructible> >, 61 test_hash<std::hash<NotConstructible> >(8), 66 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|