Searched defs:hash (Results 151 - 175 of 881) sorted by relevance

1234567891011>>

/external/conscrypt/common/src/main/java/org/conscrypt/
H A DKeyManagerImpl.java53 private final HashMap<String, PrivateKeyEntry> hash; field in class:KeyManagerImpl
59 this.hash = new HashMap<String, PrivateKeyEntry>();
72 hash.put(alias, entry);
101 if (hash.containsKey(alias)) {
102 Certificate[] certs = hash.get(alias).getCertificateChain();
130 if (hash.containsKey(alias)) {
131 return hash.get(alias).getPrivateKey();
154 for (final Map.Entry<String, PrivateKeyEntry> entry : hash.entrySet()) {
/external/elfutils/lib/
H A Ddynamicsizehash.c35 NAME name of the hash table structure.
36 TYPE data type of the hash table entries
49 /* First hash function: simply take the modul but prevent zero. Small values
55 HASHTYPE hash; local
61 /* Second hash function as suggested in [Knuth]. */
62 hash = 1 + hval % (htab->size - 2);
66 if (idx <= hash)
67 idx = htab->size + idx - hash;
69 idx -= hash;
214 /* Make the hash valu
[all...]
/external/fio/
H A Dfilehash.c6 #include "hash.h"
22 static unsigned short hash(const char *name) function
54 struct flist_head *bucket = &file_hash[hash(name)];
96 flist_add_tail(&f->hash_list, &file_hash[hash(f->file_name)]);
118 log_err("fio: file hash not empty on exit\n");
H A Dhash.h35 * multiplicative hash.
49 uint64_t hash = val; local
52 hash *= GOLDEN_RATIO_64;
55 uint64_t n = hash;
57 hash -= n;
59 hash -= n;
61 hash += n;
63 hash -= n;
65 hash += n;
67 hash
[all...]
/external/guava/guava/src/com/google/common/hash/
H A DAbstractByteHasher.java17 package com.google.common.hash;
32 * ByteBuffer} and streams all bytes to a sink to compute the hash.
H A DBloomFilterStrategies.java15 package com.google.common.hash;
28 * be mapped to a BloomFilter of M bits and k hash functions. These
42 * performance of a Bloom filter (yet only needs two 32bit hash functions).
102 // Make the combined hash positive and indexable
119 // Make the combined hash positive and indexable
H A DPrimitiveSink.java15 package com.google.common.hash;
/external/guava/guava-tests/test/com/google/common/cache/
H A DCacheEvictionTest.java309 private Object objectWithHash(final int hash) { argument
312 return hash;
/external/guava/guava-tests/test/com/google/common/hash/
H A DAbstractNonStreamingHashFunctionTest.java17 package com.google.common.hash;
20 import com.google.common.hash.HashTestUtils.RandomHasherAction;
51 codes[i] = hashers.get(i).hash();
59 // we pad because the dummy hash function we use to test this, merely copies the input into
65 // we pad because the dummy hash function we use to test this, merely copies the input into
91 assertEquals(h1.hash(), h2.hash());
H A DFunnelsTest.java17 package com.google.common.hash;
24 import com.google.common.hash.AbstractStreamingHashFunction.AbstractStreamingHasher;
/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DCalendarCache.java60 int index = hash(key);
96 * Produce a uniformly-distributed hash value from an integer key.
100 private final int hash(long key) method in class:CalendarCache
/external/icu/icu4c/source/i18n/unicode/
H A Dsmpdtfmt.h1600 int32_t hash; member in struct:SimpleDateFormat::NSOverride
1603 NSOverride() : snf(NULL), hash(0), next(NULL) {
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DCalendarCache.java58 int index = hash(key);
94 * Produce a uniformly-distributed hash value from an integer key.
98 private final int hash(long key) method in class:CalendarCache
/external/ipsec-tools/src/racoon/
H A Dvendorid.c132 lookup_vendor_id_by_hash (const char *hash) argument
135 unsigned char *h = (unsigned char *)hash;
138 if (strncmp(all_vendor_ids[i].hash->v, hash,
139 all_vendor_ids[i].hash->l) == 0)
154 all_vendor_ids[i].hash = vmalloc(sizeof(vendorid_dpd_hash));
155 if (all_vendor_ids[i].hash == NULL) {
157 "unable to get memory for VID hash\n");
160 memcpy(all_vendor_ids[i].hash->v, vendorid_dpd_hash,
168 all_vendor_ids[i].hash
[all...]
/external/javassist/src/main/javassist/scopedpool/
H A DSoftValueHashMap.java52 * Returns a set of the mappings contained in this hash table.
56 return hash.entrySet();
60 private Map hash; field in class:SoftValueHashMap
72 if (ref == (SoftValueRef)hash.get(ref.key)) {
75 hash.remove(ref.key);
97 hash = new HashMap(initialCapacity, loadFactor);
111 hash = new HashMap(initialCapacity);
119 hash = new HashMap();
146 return hash.size();
154 return hash
[all...]
/external/jemalloc/include/jemalloc/internal/
H A Dckh.h17 * There are 2^LG_CKH_BUCKET_CELLS cells in each hash table bucket. Try to fit
49 * Minimum and current number of hash table buckets. There are
56 ckh_hash_t *hash; member in struct:ckh_s
67 bool ckh_new(tsd_t *tsd, ckh_t *ckh, size_t minitems, ckh_hash_t *hash,
/external/libchrome/base/trace_event/
H A Dheap_profiler_allocation_context.h115 struct BASE_EXPORT hash<base::trace_event::StackFrame> { struct in namespace:BASE_HASH_NAMESPACE
120 struct BASE_EXPORT hash<base::trace_event::Backtrace> { struct in namespace:BASE_HASH_NAMESPACE
125 struct BASE_EXPORT hash<base::trace_event::AllocationContext> { struct in namespace:BASE_HASH_NAMESPACE
/external/libconstrainedcrypto/
H A Drsa.c183 // 20 bytes of hash go here.
189 // At the location of the bytes of the hash all 00 are hashed.
227 // 32 bytes of hash go here.
234 // At the location of the bytes of the hash all 00 are hashed.
242 // Verify a 2048-bit RSA PKCS1.5 signature against an expected hash.
244 // SHA_DIGEST_SIZE (== 20) to indicate a SHA-1 hash, or
245 // SHA256_DIGEST_SIZE (== 32) to indicate a SHA-256 hash. No other
252 const uint8_t *hash,
268 return 0; // Unsupported hash.
283 buf[i] ^= *hash
249 RSA_verify(const RSAPublicKey *key, const uint8_t *signature, const int len, const uint8_t *hash, const int hash_len) argument
[all...]
/external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/
H A Dinsert_or_assign.pass.cpp53 size_t hash () const { return std::hash<int>()(int_) + std::hash<double>()(double_); } function in class:Moveable
60 template <> struct hash<Moveable> { struct in namespace:std
61 size_t operator () (const Moveable &m) const { return m.hash(); }
H A Dtry.emplace.pass.cpp52 size_t hash () const { return std::hash<int>()(int_) + std::hash<double>()(double_); } function in class:Moveable
59 template <> struct hash<Moveable> { struct in namespace:std
60 size_t operator () (const Moveable &m) const { return m.hash(); }
/external/libdrm/
H A Dxf86drmHash.c1 /* xf86drmHash.c -- Small hash table support for integer -> integer mapping
31 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
40 * 2) The hash computation uses a table of random integers [Hanson97,
48 * dynamic hash tables was postponed until the need arises. A common (and
49 * naive) approach to dynamic hash table implementation simply creates a
50 * new hash table when necessary, rehashes all the data into the new table,
81 unsigned long hash = 0; local
96 hash = (hash << 1) + scatter[tmp & 0xff];
100 hash
150 unsigned long hash = HashHash(key); local
192 unsigned long hash; local
213 unsigned long hash; local
[all...]
/external/libyuv/files/unit_test/
H A Dcompare_test.cc23 // hash seed of 5381 recommended.
25 uint32 hash = seed; local
28 hash = hash * 33 + *src++;
31 return hash;
51 // Compare different buffers. Expect hash is different.
56 // Make last half same. Expect hash is different.
62 // Make first half same. Expect hash is different.
70 // Make same. Expect hash is same.
76 // Mask seed different. Expect hash i
[all...]
/external/lzma/Java/Tukaani/src/org/tukaani/xz/lz/
H A DBT4.java14 private final Hash234 hash; field in class:BT4
34 hash = new Hash234(dictSize);
51 hash.normalize(normalizationOffset);
79 hash.calcHashes(buf, readPos);
80 int delta2 = lzPos - hash.getHash2Pos();
81 int delta3 = lzPos - hash.getHash3Pos();
82 int currentMatch = hash.getHash4Pos();
83 hash.updateTables(lzPos);
87 // See if the hash from the first two bytes found a match.
98 // See if the hash fro
[all...]
H A DHC4.java14 private final Hash234 hash; field in class:HC4
38 hash = new Hash234(dictSize);
58 * and possibly normalizes the hash tables and the hash chain.
68 hash.normalize(normalizationOffset);
95 hash.calcHashes(buf, readPos);
96 int delta2 = lzPos - hash.getHash2Pos();
97 int delta3 = lzPos - hash.getHash3Pos();
98 int currentMatch = hash.getHash4Pos();
99 hash
[all...]
/external/mesa3d/src/amd/vulkan/
H A Dradv_entrypoints_gen.py28 # We generate a static hash table for entry point lookup
29 # (vkGetProcAddress). We use a linear congruential generator for our hash
41 def hash(name): function
80 entrypoints.append((type, shortname, params, i, hash(fullname), guard))
159 uint32_t hash;
213 # Now generate the hash table used for entry point look up. This is a
215 # in the hash table is empty.
256 # Finally we generate the hash table lookup function. The hash function and
257 # linear probing algorithm matches the hash tabl
[all...]

Completed in 2334 milliseconds

1234567891011>>