Searched refs:hash (Results 126 - 150 of 965) sorted by relevance

1234567891011>>

/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...]
H A Disakmp_newg.c75 struct isakmp_pl_hash *hash = NULL;
101 if (hash) {
109 hash = (struct isakmp_pl_hash *)pa->ptr;
137 if (!hash || !sa) {
163 plog(LLV_DEBUG, LOCATION, NULL, "hash source\n");
171 plog(LLV_DEBUG, LOCATION, NULL, "hash result\n");
174 r_hash = (char *)hash + sizeof(*hash);
176 plog(LLV_DEBUG, LOCATION, NULL, "original hash\n"));
177 plogdump(LLV_DEBUG, r_hash, ntohs(hash
[all...]
/external/apache-http/src/org/apache/http/auth/
H A DNTCredentials.java149 int hash = LangUtils.HASH_SEED;
150 hash = LangUtils.hashCode(hash, this.principal);
151 hash = LangUtils.hashCode(hash, this.workstation);
152 return hash;
/external/dropbear/libtomcrypt/src/pk/dsa/
H A Ddsa_encrypt_key.c28 @param hash The index of the hash you want to use
34 prng_state *prng, int wprng, int hash,
47 /* check that wprng/cipher/hash are not invalid */
52 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
56 if (inlen > hash_descriptor[hash].hashsize) {
102 if ((err = hash_memory(hash, expt, x, skey, &y)) != CRYPT_OK) {
112 LTC_ASN1_OBJECT_IDENTIFIER, hash_descriptor[hash].OIDlen, hash_descriptor[hash].OID,
32 dsa_encrypt_key(const unsigned char *in, unsigned long inlen, unsigned char *out, unsigned long *outlen, prng_state *prng, int wprng, int hash, dsa_key *key) argument
/external/dropbear/libtomcrypt/src/pk/ecc/
H A Decc_encrypt_key.c34 @param hash The index of the hash you want to use
40 prng_state *prng, int wprng, int hash,
53 /* check that wprng/cipher/hash are not invalid */
58 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
62 if (inlen > hash_descriptor[hash].hashsize) {
102 if ((err = hash_memory(hash, ecc_shared, x, skey, &y)) != CRYPT_OK) {
112 LTC_ASN1_OBJECT_IDENTIFIER, hash_descriptor[hash].OIDlen, hash_descriptor[hash].OID,
38 ecc_encrypt_key(const unsigned char *in, unsigned long inlen, unsigned char *out, unsigned long *outlen, prng_state *prng, int wprng, int hash, ecc_key *key) argument
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
H A DExpandedNameTable.java31 * a simple hash algorithm directly into this class, instead of using the
33 * are combined in getExpandedTypeID() method to share the same hash calculation
35 * expand the hash table.
80 * The initial capacity of the hash table. Use a bigger number
86 * The capacity of the hash table, i.e. the size of the
92 * The threshold of the hash table, which is equal to capacity * loadFactor.
93 * If the number of entries in the hash table is bigger than the threshold,
94 * the hash table needs to be expanded.
99 * The internal array to store the hash entries.
100 * Each array member is a slot for a hash bucke
379 int hash; field in class:ExpandedNameTable.HashEntry
382 HashEntry(ExtendedType key, int value, int hash, HashEntry next) argument
[all...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/encodings/
H A DOAEPEncoding.java21 private Digest hash; field in class:OAEPEncoding
38 Digest hash)
40 this(cipher, hash, null);
45 Digest hash,
48 this(cipher, hash, hash, encodingParams);
53 Digest hash,
58 this.hash = hash;
60 this.defHash = new byte[hash
36 OAEPEncoding( AsymmetricBlockCipher cipher, Digest hash) argument
43 OAEPEncoding( AsymmetricBlockCipher cipher, Digest hash, byte[] encodingParams) argument
51 OAEPEncoding( AsymmetricBlockCipher cipher, Digest hash, Digest mgf1Hash, byte[] encodingParams) argument
[all...]
/external/chromium/chrome/browser/sync/util/
H A Dnigori.cc150 std::vector<unsigned char> hash(kHashSize);
151 if (!hmac.Sign(ciphertext, &hash[0], hash.size()))
156 output.append(hash.begin(), hash.end());
191 std::vector<unsigned char> hash(kHashSize);
192 if (!hmac.Sign(ciphertext, &hash[0], hash.size()))
198 output.append(hash.begin(), hash
[all...]
/external/guava/guava-tests/test/com/google/common/cache/
H A DLocalCacheTest.java424 int hash = map.hash(key);
427 ReferenceEntry<Object, Object> entry = segment.getEntry(key, hash);
480 int hash = map.hash(key);
482 int index = hash & (table.length() - 1);
484 DummyEntry<Object, Object> entry = DummyEntry.create(key, hash, null);
509 int hash = map.hash(key);
511 int index = hash
1774 assertNotificationEnqueued( LocalCache<K, V> map, K key, V value, int hash) argument
2471 createDummyEntry( K key, int hash, V value, ReferenceEntry<K, V> next) argument
2481 private final int hash; field in class:LocalCacheTest.DummyEntry
2484 DummyEntry(K key, int hash, ReferenceEntry<K, V> next) argument
2490 create(K key, int hash, ReferenceEntry<K, V> next) argument
[all...]
/external/guava/guava/src/com/google/common/hash/
H A DHasher.java15 package com.google.common.hash;
22 * A {@link Sink} that can compute a hash code after reading the input. Each hasher should
65 * Computes a hash code based on the data that have been provided to this hasher. The result is
68 HashCode hash(); method in interface:Hasher
/external/jmonkeyengine/engine/src/core/com/jme3/texture/
H A DTextureCubeMap.java182 int hash = super.hashCode();
183 hash = 53 * hash + (this.wrapS != null ? this.wrapS.hashCode() : 0);
184 hash = 53 * hash + (this.wrapT != null ? this.wrapT.hashCode() : 0);
185 hash = 53 * hash + (this.wrapR != null ? this.wrapR.hashCode() : 0);
186 return hash;
H A DImage.java757 int hash = 7;
758 hash = 97 * hash + (this.format != null ? this.format.hashCode() : 0);
759 hash = 97 * hash + this.width;
760 hash = 97 * hash + this.height;
761 hash = 97 * hash + this.depth;
762 hash
[all...]
/external/oprofile/daemon/
H A Dopd_cookie.c135 unsigned long hash = hash_cookie(cookie); local
142 list_for_each(pos, &hashes[hash]) {
150 list_add(&entry->list, &hashes[hash]);
158 unsigned long hash = hash_cookie(cookie); local
165 list_for_each(pos, &hashes[hash]) {
172 list_add(&entry->list, &hashes[hash]);
180 unsigned long hash = hash_cookie(cookie); local
190 list_for_each(pos, &hashes[hash]) {
H A Dopd_sfile.h35 * cg files are stored in the hash.
38 /** hash value for this sfile */
57 /** hash table link */
58 struct list_head hash; member in struct:sfile
67 /** hash table of opened cg sample files */
75 /** next in the hash slot */
76 struct list_head hash; member in struct:cg_entry
/external/qemu/android/utils/
H A Drefset.c20 uint32_t hash; local
22 hash = (uint32_t)(ptrdiff_t)item >> 2;
24 hash ^= ((uint64_t)(ptrdiff_t)item >> 32);
26 return hash;
32 uint32_t hash = _arefSet_hashItem(item); local
33 unsigned index = hash & (s->max_buckets-1);
50 uint32_t hash = _arefSet_hashItem(item); local
51 unsigned index = hash & (s->max_buckets-1);
/external/srtp/
H A DAndroid.mk14 crypto/hash/null_auth.c \
15 crypto/hash/sha1.c \
16 crypto/hash/hmac.c \
17 crypto/hash/auth.c \
/external/webkit/Source/WebCore/platform/graphics/win/
H A DRefCountedGDIHandle.h54 unsigned hash() const function in class:WebCore::RefCountedGDIHandle
56 return WTF::PtrHash<T>::hash(m_handle);
/external/webkit/Tools/DumpRenderTree/win/
H A DMD5.cpp72 void MD5_Final(unsigned char hash[16], MD5_CTX* context) argument
77 hash[i] = context->digest[i];
/external/apache-harmony/x-net/src/test/impl/java.injected/org/apache/harmony/xnet/provider/jsse/
H A DDigitalSignatureTest.java64 byte[] hash = ds_sign.sign();
79 assertTrue(ds_verify.verifySignature(hash));
96 byte[] hash = ds_sign.sign();
102 assertTrue(ds_verify.verifySignature(hash));
/external/dexmaker/src/dx/java/com/android/dx/dex/code/
H A DCatchTable.java133 int hash = (start * 31) + end;
134 hash = (hash * 31) + handlers.hashCode();
135 return hash;
/external/jsilver/src/com/google/clearsilver/jsilver/adaptor/
H A DLoadPathToFileCache.java96 * hash as the key and throw away the loadpath list
99 * @return a long representing a hash of the loadpaths.
102 long hash = 17;
104 hash = 37 * hash + path.hashCode();
106 return hash;
/external/valgrind/main/coregrind/
H A Dm_execontext.c52 The contexts are stored in a traditional chained hash table, so as
54 exists. The hash table starts small and expands dynamically, so as
61 /* Primes for the hash table */
74 /* Each element is present in a hash chain, and also contains a
93 /* This is the dynamically expanding hash table. */
231 Also checks whether the hash table needs expanding, and expands it
244 UWord hash = 0; local
247 hash ^= ips[i];
248 hash = ROLW(hash, 1
279 UWord hash = calc_hash(cur->ips, cur->n_ips, new_size); local
334 UWord hash; local
[all...]
/external/webkit/Source/WebKit/win/WebCoreSupport/
H A DWebPlatformStrategies.cpp102 bool WebPlatformStrategies::isLinkVisited(Page* page, LinkHash hash) argument
104 return page->group().isLinkVisited(hash);
107 void WebPlatformStrategies::addVisitedLink(Page* page, LinkHash hash) argument
109 page->group().addVisitedLinkHash(hash);
/external/guava/guava/src/com/google/common/cache/
H A DLocalCache.java83 * The concurrent hash map implementation built by {@link CacheBuilder}.
96 * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
158 * Mask value for indexing into segments. The upper bits of a key's hash code are used to choose
169 /** The segments, each of which is a specialized hash table. */
427 * Returns the default equivalence strategy used to compare and hash keys or values referenced
441 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
442 return new StrongEntry<K, V>(key, hash, next);
448 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
449 return new StrongAccessEntry<K, V>(key, hash, next);
463 Segment<K, V> segment, K key, int hash,
577 newEntry( Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1059 StrongEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1136 final int hash; field in class:LocalCache.StrongEntry
1163 StrongAccessEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1210 StrongWriteEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1257 StrongAccessWriteEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1346 WeakEntry(ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1423 final int hash; field in class:LocalCache.WeakEntry
1450 WeakAccessEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1498 WeakWriteEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1546 WeakAccessWriteEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1863 newEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1887 int hash(Object key) { method in class:LocalCache
1918 segmentFor(int hash) argument
2177 newEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
2207 get(K key, int hash, CacheLoader<? super K, V> loader) argument
2242 lockedGetOrLoad(K key, int hash, CacheLoader<? super K, V> loader) argument
2348 loadSync(K key, int hash, LoadingValueReference<K, V> loadingValueReference, CacheLoader<? super K, V> loader) argument
2354 loadAsync(final K key, final int hash, final LoadingValueReference<K, V> loadingValueReference, CacheLoader<? super K, V> loader) argument
2377 getAndRecordStats(K key, int hash, LoadingValueReference<K, V> loadingValueReference, ListenableFuture<V> newValue) argument
2396 scheduleRefresh(ReferenceEntry<K, V> entry, K key, int hash, V oldValue, long now, CacheLoader<? super K, V> loader) argument
2414 refresh(K key, int hash, CacheLoader<? super K, V> loader) argument
2437 insertLoadingValueReference(final K key, final int hash) argument
2671 enqueueNotification(@ullable K key, int hash, ValueReference<K, V> valueReference, RemovalCause cause) argument
2717 getFirst(int hash) argument
2726 getEntry(Object key, int hash) argument
2747 getLiveEntry(Object key, int hash, long now) argument
2781 get(Object key, int hash) argument
2803 containsKey(Object key, int hash) argument
2851 put(K key, int hash, V value, boolean onlyIfAbsent) argument
2994 replace(K key, int hash, V oldValue, V newValue) argument
3047 replace(K key, int hash, V newValue) argument
3093 remove(Object key, int hash) argument
3138 storeLoadedValue(K key, int hash, LoadingValueReference<K, V> oldValueReference, V newValue) argument
3190 remove(Object key, int hash, Object value) argument
3267 removeValueFromChain(ReferenceEntry<K, V> first, ReferenceEntry<K, V> entry, @Nullable K key, int hash, ValueReference<K, V> valueReference, RemovalCause cause) argument
3310 reclaimKey(ReferenceEntry<K, V> entry, int hash) argument
3340 reclaimValue(K key, int hash, ValueReference<K, V> valueReference) argument
3375 removeLoadingValue(K key, int hash, LoadingValueReference<K, V> valueReference) argument
3408 removeEntry(ReferenceEntry<K, V> entry, int hash, RemovalCause cause) argument
[all...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/rsa/
H A DDigestSignatureSpi.java137 byte[] hash = new byte[digest.getDigestSize()];
139 digest.doFinal(hash, 0);
143 byte[] bytes = derEncode(hash);
161 byte[] hash = new byte[digest.getDigestSize()];
163 digest.doFinal(hash, 0);
172 expected = derEncode(hash);
191 int sigOffset = sig.length - hash.length - 2;
192 int expectedOffset = expected.length - hash.length - 2;
197 for (int i = 0; i < hash.length; i++)
199 if (sig[sigOffset + i] != expected[expectedOffset + i]) // check hash
251 derEncode( byte[] hash) argument
[all...]

Completed in 645 milliseconds

1234567891011>>