/external/guava/guava-tests/test/com/google/common/hash/ |
H A D | HashTestUtils.java | 17 package com.google.common.hash; 55 byte[] hash(byte[] input, int seed); method in interface:HashTestUtils.HashFn 68 byte[] hash = hashFunction.hash(Arrays.copyOf(key, i), seed); 69 System.arraycopy(hash, 0, hashes, i * hashBytes, hash.length); 72 // Then hash the result array 73 byte[] result = hashFunction.hash(hashes, 0); 232 * Test that the hash function contains no funnels. A funnel is a situation where a set of input 264 // test whether the hash value [all...] |
/external/avb/libavb/ |
H A D | avb_rsa.c | 32 * support multiple RSA key lengths and hash digest algorithms. 228 /* Verify a RSA PKCS1.5 signature against an expected hash. 235 const uint8_t* hash, 243 if (key == NULL || sig == NULL || hash == NULL || padding == NULL) { 260 avb_error("Padding length does not match hash and signature lengths.\n"); 283 /* Check hash. */ 284 if (avb_safe_memcmp(buf + padding_num_bytes, hash, hash_num_bytes)) { 231 avb_rsa_verify(const uint8_t* key, size_t key_num_bytes, const uint8_t* sig, size_t sig_num_bytes, const uint8_t* hash, size_t hash_num_bytes, const uint8_t* padding, size_t padding_num_bytes) argument
|
/external/avb/libavb_atx/ |
H A D | avb_atx_validate.c | 32 /* Computes the SHA256 |hash| of |length| bytes of |data|. */ 35 uint8_t hash[AVB_SHA256_DIGEST_SIZE]) { 40 avb_memcpy(hash, tmp, AVB_SHA256_DIGEST_SIZE); 43 /* Computes the SHA512 |hash| of |length| bytes of |data|. */ 46 uint8_t hash[AVB_SHA512_DIGEST_SIZE]) { 51 avb_memcpy(hash, tmp, AVB_SHA512_DIGEST_SIZE); 54 /* Computes the SHA256 |hash| of a NUL-terminated |str|. */ 55 static void sha256_str(const char* str, uint8_t hash[AVB_SHA256_DIGEST_SIZE]) { argument 56 sha256((const uint8_t*)str, avb_strlen(str), hash); 63 uint8_t hash[AVB_SHA256_DIGEST_SIZ local 33 sha256(const uint8_t* data, uint32_t length, uint8_t hash[AVB_SHA256_DIGEST_SIZE]) argument 44 sha512(const uint8_t* data, uint32_t length, uint8_t hash[AVB_SHA512_DIGEST_SIZE]) argument [all...] |
/external/boringssl/src/crypto/lhash/ |
H A D | lhash.c | 72 // average chain length exceeds this value, the hash table will be resized. 77 // num_items contains the total number of items in the hash table. 80 // a chain of LHASH_ITEM objects that have the same hash value, mod 92 lhash_hash_func hash; member in struct:lhash_st 95 _LHASH *lh_new(lhash_hash_func hash, lhash_cmp_func comp) { argument 111 ret->hash = hash; 140 // is not NULL, then it also puts the hash value of |data| in |*out_hash|. 143 const uint32_t hash = lh->hash(dat local 237 uint32_t hash; local [all...] |
/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/ |
H A D | SignerInfoGenerator.java | 258 private Map getBaseParameters(ASN1ObjectIdentifier contentType, AlgorithmIdentifier digAlgId, AlgorithmIdentifier sigAlgId, byte[] hash) argument 269 param.put(CMSAttributeTableGenerator.DIGEST, Arrays.clone(hash));
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/encodings/ |
H A D | OAEPEncoding.java | 39 Digest hash) 41 this(cipher, hash, null); 46 Digest hash, 49 this(cipher, hash, hash, encodingParams); 54 Digest hash, 60 this.defHash = new byte[hash.getDigestSize()]; 62 hash.reset(); 66 hash.update(encodingParams, 0, encodingParams.length); 69 hash 37 OAEPEncoding( AsymmetricBlockCipher cipher, Digest hash) argument 44 OAEPEncoding( AsymmetricBlockCipher cipher, Digest hash, byte[] encodingParams) argument 52 OAEPEncoding( AsymmetricBlockCipher cipher, Digest hash, Digest mgf1Hash, byte[] encodingParams) argument [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/rsa/ |
H A D | DigestSignatureSpi.java | 130 byte[] hash = new byte[digest.getDigestSize()]; 132 digest.doFinal(hash, 0); 136 byte[] bytes = derEncode(hash); 154 byte[] hash = new byte[digest.getDigestSize()]; 156 digest.doFinal(hash, 0); 165 expected = derEncode(hash); 178 int sigOffset = sig.length - hash.length - 2; 179 int expectedOffset = expected.length - hash.length - 2; 186 for (int i = 0; i < hash.length; i++) 237 byte[] hash) 236 derEncode( byte[] hash) argument [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/symmetric/util/ |
H A D | PBE.java | 67 int hash) 73 switch (hash) 95 switch (hash) 151 switch (hash) 390 int hash, 393 PBEParametersGenerator generator = makePBEGenerator(type, hash); 418 int hash, 422 PBEParametersGenerator generator = makePBEGenerator(type, hash); 455 int hash, 459 PBEParametersGenerator generator = makePBEGenerator(type, hash); 65 makePBEGenerator( int type, int hash) argument 387 makePBEMacParameters( PBEKeySpec keySpec, int type, int hash, int keySize) argument 415 makePBEParameters( PBEKeySpec keySpec, int type, int hash, int keySize, int ivSize) argument 452 makePBEMacParameters( SecretKey key, int type, int hash, int keySize, PBEParameterSpec pbeSpec) argument [all...] |
/external/caliper/caliper/src/main/java/com/google/caliper/model/ |
H A D | BenchmarkSpec.java | 26 import com.google.common.hash.Funnel; 27 import com.google.common.hash.PrimitiveSink; 47 @ExcludeFromJson private int hash; field in class:BenchmarkSpec 87 if (hash == 0) { 88 this.hash = getPersistentHashFunction() 95 return hash;
|
H A D | Host.java | 26 import com.google.common.hash.Funnel; 27 import com.google.common.hash.HashFunction; 28 import com.google.common.hash.PrimitiveSink; 45 @ExcludeFromJson private int hash; field in class:Host 53 // eagerly initialize hash to allow for the test-only hash function 73 if (hash == 0) { 74 this.hash = hashFunction.hashObject(this, HostFunnel.INSTANCE).asInt(); 84 return hash; 116 * This only exists for tests to induce hash collision [all...] |
H A D | VmSpec.java | 24 import com.google.common.hash.Funnel; 25 import com.google.common.hash.PrimitiveSink; 41 @ExcludeFromJson private int hash; field in class:VmSpec 74 if (hash == 0) { 75 this.hash = getPersistentHashFunction().hashObject(this, VmSpecFunnel.INSTANCE).asInt(); 81 return hash;
|
/external/compiler-rt/lib/builtins/ |
H A D | atomic.c | 110 intptr_t hash = (intptr_t)ptr; local 112 // same memory operation to hash to the same value and therefore use the same 114 hash >>= 4; 115 // Use the next bits as the basis for the hash 116 intptr_t low = hash & SPINLOCK_MASK; 117 // Now use the high(er) set of bits to perturb the hash, so that we don't 119 hash >>= 16; 120 hash ^= low; 122 return locks + (hash & SPINLOCK_MASK);
|
/external/compiler-rt/lib/msan/ |
H A D | msan_chained_origin_depot.cc | 32 bool eq(u32 hash, const args_type &args) const { argument 40 /* This is murmur2 hash for the 64->32 bit case. 46 * (8 bits) Part id = bits 13..20 of the hash value of here_id's key. 53 static u32 hash(const args_type &args) { function in struct:__msan::ChainedOriginDepotNode
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_stackdepotbase.h | 40 static Node *find(Node *s, args_type args, u32 hash); 63 u32 hash) { 66 if (s->eq(hash, args)) { 102 uptr h = Node::hash(args); 61 find(Node *s, args_type args, u32 hash) argument
|
/external/compiler-rt/lib/tsan/rtl/ |
H A D | tsan_defs.h | 146 u64 hash[2]; member in struct:__tsan::MD5Hash
|
/external/deqp/framework/delibs/debase/ |
H A D | deString.c | 35 * \brief Compute hash from string. 36 * \param str String to compute hash value for. 37 * \return Computed hash value. 41 /* \note [pyry] This hash is used in DT_GNU_HASH and is proven 44 deUint32 hash = 5381; local 49 hash = (hash << 5) + hash + c; 51 return hash; 56 deUint32 hash local 70 deUint32 hash = 5381; local [all...] |
/external/fio/ |
H A D | filelock.c | 3 * No hash indexing, just a list, so only works well for < 100 files or 15 #include "hash.h" 19 uint32_t hash; member in struct:fio_filelock 119 static struct fio_filelock *fio_hash_find(uint32_t hash) argument 126 if (ff->hash == hash) 133 static struct fio_filelock *fio_hash_get(uint32_t hash, int trylock) argument 137 ff = fio_hash_find(hash); 146 * If we dropped the main lock, re-lookup the hash in case 153 __ff = fio_hash_find(hash); 171 uint32_t hash; local 228 uint32_t hash; local [all...] |
/external/fio/lib/ |
H A D | bloom.c | 5 #include "../hash.h" 92 uint32_t hash[N_HASHES]; local 96 hash[i] = hashes[i].fn(data, len, hashes[i].seed); 97 hash[i] = hash[i] % b->nentries; 102 const unsigned int index = hash[i] / BITS_PER_INDEX; 103 const unsigned int bit = hash[i] & BITS_INDEX_MASK;
|
/external/freetype/src/base/ |
H A D | fthash.c | 57 /* Mocklisp hash function. */ 72 /* Mocklisp hash function. */ 107 FT_Hash hash ) 110 FT_Hashnode* bp = hash->table; 114 res = (hash->lookup)( &key ); 116 ndp = bp + ( res % hash->size ); 119 if ( (hash->compare)( &(*ndp)->key, &key ) ) 124 ndp = bp + ( hash->size - 1 ); 132 hash_rehash( FT_Hash hash, argument 135 FT_Hashnode* obp = hash 166 hash_init( FT_Hash hash, FT_Bool is_num, FT_Memory memory ) argument 196 ft_hash_str_init( FT_Hash hash, FT_Memory memory ) argument 204 ft_hash_num_init( FT_Hash hash, FT_Memory memory ) argument 212 ft_hash_str_free( FT_Hash hash, FT_Memory memory ) argument 234 hash_insert( FT_Hashkey key, size_t data, FT_Hash hash, FT_Memory memory ) argument 272 ft_hash_str_insert( const char* key, size_t data, FT_Hash hash, FT_Memory memory ) argument 287 ft_hash_num_insert( FT_Int num, size_t data, FT_Hash hash, FT_Memory memory ) argument [all...] |
/external/freetype/src/cache/ |
H A D | ftcbasic.c | 293 FT_Offset hash; local 329 hash = FTC_BASIC_ATTR_HASH( &query.attrs ) + gindex; 335 hash, gindex, 341 hash, gindex, 374 FT_Offset hash; local 404 hash = FTC_BASIC_ATTR_HASH( &query.attrs ) + gindex; 409 hash, gindex, 493 FT_Offset hash; local 527 /* beware, the hash must be the same for all glyph ranges! */ 528 hash 576 FT_Offset hash; local [all...] |
H A D | ftccmap.c | 51 /* compute a query/node hash */ 241 FT_Offset hash; local 266 hash = FTC_CMAP_HASH( face_id, (FT_UInt)cmap_index, char_code ); 269 FTC_CACHE_LOOKUP_CMP( cache, ftc_cmap_node_compare, hash, &query, 272 error = FTC_Cache_Lookup( cache, hash, &query, &node );
|
/external/guava/guava/src/com/google/common/base/ |
H A D | Equivalence.java | 85 * Returns a hash code for {@code t}. 87 * <p>The {@code hash} has the following properties: 90 * {@code hash(x}} consistently return the same value provided {@code x} remains unchanged 91 * according to the definition of the equivalence. The hash need not remain consistent from 94 * if {@code equivalent(x, y)}, then {@code hash(x) == hash(y)}. It is <i>not</i> necessary 95 * that the hash be distributable across <i>inequivalence</i>. If {@code equivalence(x, y)} 96 * is false, {@code hash(x) == hash(y)} may still be true. 97 * <li>{@code hash(nul 100 public final int hash(@Nullable T t) { method in class:Equivalence [all...] |
/external/guava/guava/src/com/google/common/hash/ |
H A D | Funnels.java | 15 package com.google.common.hash;
|
H A D | Murmur3_128HashFunction.java | 26 package com.google.common.hash;
|
H A D | Murmur3_32HashFunction.java | 26 package com.google.common.hash; 139 // Finalization mix - force all bits of a hash block to avalanche
|