| /external/ipsec-tools/src/racoon/ |
| oakley.c | 381 * it's before negotiating hash algorithm.
399 * hash
411 * it's before negotiating hash algorithm.
421 "invalid hash algoriym %d.\n", type);
700 "failed to get hash buffer\n");
713 plog(LLV_DEBUG, LOCATION, NULL, "HASH with: \n");
716 /* compute HASH */
722 plog(LLV_DEBUG, LOCATION, NULL, "HASH computed:\n");
730 * compute HASH(3) prf(SKEYID_a, 0 | M-ID | Ni_b | Nr_b)
748 "failed to get hash buffer\n")
971 vchar_t *hash = NULL; \/* for signature mode *\/ local
1112 vchar_t *hash = NULL; local
[all...] |
| /external/wpa_supplicant/ |
| eap_gpsk_common.c | 53 u8 ibuf[2], hash[16]; local
57 hashlen = sizeof(hash);
69 omac1_aes_128_vector(psk, 2, addr, vlen, hash);
71 os_memcpy(opos, hash, clen);
87 u8 ibuf[2], hash[SHA256_MAC_LEN]; local
103 hmac_sha256_vector(psk, 32, 2, addr, vlen, hash);
105 os_memcpy(opos, hash, clen);
|
| /external/wpa_supplicant_6/wpa_supplicant/src/eap_common/ |
| eap_gpsk_common.c | 53 u8 ibuf[2], hash[16]; local
57 hashlen = sizeof(hash);
69 if (omac1_aes_128_vector(psk, 2, addr, vlen, hash))
72 os_memcpy(opos, hash, clen);
88 u8 ibuf[2], hash[SHA256_MAC_LEN]; local
104 hmac_sha256_vector(psk, 32, 2, addr, vlen, hash);
106 os_memcpy(opos, hash, clen);
|
| /external/wpa_supplicant_6/wpa_supplicant/src/tls/ |
| tlsv1_record.c | 49 if (suite->hash == TLS_HASH_MD5) {
52 } else if (suite->hash == TLS_HASH_SHA) {
252 u8 len[2], hash[100]; local
361 "hash value");
383 hlen = sizeof(hash);
384 if (crypto_hash_finish(hmac, hash, &hlen) < 0) {
390 os_memcmp(hash, out_data + *out_len, hlen) != 0) {
|
| /dalvik/vm/native/ |
| dalvik_system_DexFile.c | 65 * Expects that the hash table will be *unlocked* here.
78 u4 hash = dvmComputeUtf8Hash(pDexOrJar->fileName);
80 void* result = dvmHashTableLookup(gDvm.userDexFiles, hash, pDexOrJar,
105 * To optimize this away we could search for existing entries in the hash
185 /* add to hash table */
186 u4 hash = dvmComputeUtf8Hash(sourceName); local
189 result = dvmHashTableLookup(gDvm.userDexFiles, hash, pDexOrJar,
232 u4 hash = dvmComputeUtf8Hash(pDexOrJar->fileName); local
234 if (!dvmHashTableRemove(gDvm.userDexFiles, hash, pDexOrJar)) {
235 LOGW("WARNING: could not remove '%s' from DEX hash table\n"
[all...] |
| /external/dropbear/libtomcrypt/src/hashes/ |
| rmd128.c | 15 RMD128 Hash function
268 Initialize the hash state
269 @param md The hash state you wish to initialize
285 Process a block of memory though the hash
286 @param md The hash state
287 @param in The data to hash
294 Terminate the hash to get the digest
295 @param md The hash state
296 @param out [out] The destination of the hash (16 bytes)
349 Self-test the hash
[all...] |
| rmd256.c | 15 RMD256 Hash function
277 Initialize the hash state
278 @param md The hash state you wish to initialize
298 Process a block of memory though the hash
299 @param md The hash state
300 @param in The data to hash
307 Terminate the hash to get the digest
308 @param md The hash state
309 @param out [out] The destination of the hash (16 bytes)
362 Self-test the hash
[all...] |
| tiger.c | 16 Tiger hash function, Tom St Denis
[all...] |
| /bionic/libc/regex/ |
| regex2.h | 97 * and a mask to pick out the relevant bit of each byte. A hash code
108 uch hash; /* hash code */ member in struct:__anon503
113 #define CHadd(cs, c) ((cs)->ptr[(uch)(c)] |= (cs)->mask, (cs)->hash += (c))
114 #define CHsub(cs, c) ((cs)->ptr[(uch)(c)] &= ~(cs)->mask, (cs)->hash -= (c))
|
| /dalvik/libcore/security/src/main/java/java/security/cert/ |
| CertPath.java | 100 * @return the hash code for this instance.
103 int hash = getType().hashCode(); local
104 hash = hash*31 + getCertificates().hashCode();
105 return hash;
|
| Certificate.java | 95 * Returns an integer hash code for the certificate. Any two objects which
99 * @return the certificate's hash
105 int hash = 0; local
107 hash += i*encoded[i];
109 return hash;
|
| /dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/cert/ |
| X509CertFactoryImpl.java | 60 // number of leading/trailing bytes used for cert hash computation
64 // number of leading/trailing bytes used for crl hash computation
639 long hash = CERT_CACHE.getHash(encoding); local
640 if (CERT_CACHE.contains(hash)) {
642 (Certificate) CERT_CACHE.get(hash, encoding);
648 CERT_CACHE.put(hash, encoding, res);
674 long hash = CERT_CACHE.getHash(buff); local
675 if (CERT_CACHE.contains(hash)) {
682 Certificate res = (Certificate) CERT_CACHE.get(hash, encoding);
687 CERT_CACHE.put(hash, encoding, res)
714 long hash = CRL_CACHE.getHash(encoding); local
748 long hash = CRL_CACHE.getHash(buff); local
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/serializer/ |
| AttributesImplSerializer.java | 42 * Hash table of qName/index values to quickly lookup the index
43 * of an attributes qName. qNames are in uppercase in the hash table
54 * This is the number of attributes before switching to the hash table,
140 * We are switching over to having a hash table for quick look
198 // we need to keep the hash table up to date ourselves for the
|
| /external/dropbear/ |
| session.h | 133 unsigned char *session_id; /* this is the hash from the first kex */
136 unsigned char hash[SHA1_HASH_SIZE]; /* the hash*/ member in struct:sshsession
137 buffer* kexhashbuf; /* session hash buffer calculated from various packets*/
139 can add it to the hash when generating keys */
|
| /external/webkit/WebCore/platform/text/ |
| TextEncodingRegistry.cpp | 64 // Hash for all-ASCII strings that does case folding and skips any characters
87 // This algorithm is the one-at-a-time hash from:
88 // http://burtleburtle.net/bob/hash/hashfaq.html
89 // http://burtleburtle.net/bob/hash/doobs.html
90 static unsigned hash(const char* s) function in struct:WebCore::TextEncodingNameHash
|
| /external/webkit/WebCore/platform/win/ |
| COMPtr.h | 59 // Hash table deleted values, which are only constructed and never copied or destroyed.
208 using PtrHash<P*>::hash;
209 static unsigned hash(const COMPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash
216 template<typename P> struct DefaultHash<COMPtr<P> > { typedef PtrHash<COMPtr<P> > Hash; };
|
| /dalvik/libcore/luni/src/main/java/java/lang/ |
| ThreadLocal.java | 63 int index = hash & values.mask;
134 /** Hash counter. */
138 * Internal hash. We deliberately don't bother with #hashCode().
140 * (hash & (table.length - 1)) points to a key and not a value.
145 private final int hash = hashCounter.getAndAdd(0x61c88647 << 1); field in class:ThreadLocal
372 for (int index = key.hash & mask;; index = next(index)) {
393 for (int index = key.hash & mask;; index = next(index)) {
432 int index = key.hash & mask;
513 for (int index = key.hash & mask;; index = next(index)) {
|
| /dalvik/libcore/x-net/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
| CipherSuite.java | 67 // Hash algorithm
73 // Hash size
274 // hash for quick access to cipher suite by name
397 * @param hash
401 String cipherName, String hash, byte[] code) {
470 if ("MD5".equals(hash)) {
474 } else if ("SHA".equals(hash)) {
586 * Returns hash algorithm name
594 * Returns hash size
|
| /external/v8/src/ |
| stub-cache.h | 192 // Update cache for entry hash(name, map).
224 // This works well because the heap object tag size and the hash
226 // hash code would effectively throw away two bits of the hash
229 // Compute the hash of the name (use entire hash field).
238 // so do it here too so the hash codes match.
251 // so do it here too so the hash codes match.
259 // we do in generated code. We generate an hash code that already
|
| /external/zlib/ |
| algorithm.txt | 21 Duplicated strings are found using a hash table. All input strings of
22 length 3 are inserted in the hash table. A hash index is computed for
23 the next 3 bytes. If the hash chain for this index is not empty, all
27 The hash chains are searched starting with the most recent strings, to
29 The hash chains are singly linked. There are no deletions from the
30 hash chains, the algorithm simply discards matches that are too old.
32 To avoid a worst-case situation, very long hash chains are arbitrarily
53 are inserted in the hash table only when no match was found, or
|
| /external/iproute2/tc/ |
| f_u32.c | 52 __u32 htid=0, hash=0, nodeid=0; local
67 hash = strtoul(str, &tmp, 16);
70 if (hash>=0x100)
81 *handle = (htid<<20)|(hash<<12)|nodeid;
89 __u32 hash = TC_U32_HASH(handle); local
102 if (nodeid|hash) {
103 if (hash) {
104 int l = snprintf(b, bsize, "%x", hash);
1026 fprintf(stderr, "\"link\" must be a hash table.\n");
1038 fprintf(stderr, "\"ht\" must be a hash table.\n")
1046 __u32 hash; local
[all...] |
| /dalvik/libcore/security-kernel/src/main/java/java/security/ |
| AccessControlContext.java | 266 * Returns the hash code value for this {@code AccessControlContext}.
267 * Returns the same hash code for {@code AccessControlContext}s that are
271 * @return the hash code value for this {@code AccessControlContext}
277 int hash = 0; local
279 hash ^= context[i].hashCode();
281 return hash;
|
| /external/e2fsprogs/e2fsck/ |
| pass2.c | 178 * update their parent's min and max hash values
321 * processed first, so we know what hash version to use.
538 ext2_dirhash_t hash = 0, prev_hash; local
546 printf("\t Hash Version: %d\n", root->hash_version);
581 prev_hash = hash;
582 hash = i ? (ext2fs_le32_to_cpu(ent[i].hash) & ~1) : 0;
584 printf("Entry #%d: Hash 0x%08x, block %u\n", i,
585 hash, ext2fs_le32_to_cpu(ent[i].block));
596 if (hash < prev_hash &
706 ext2_dirhash_t hash; local
[all...] |
| /external/kernel-headers/original/linux/ |
| lockdep.h | 77 * class-hash:
147 * One-way hash of the dependency chain up to this point. We
148 * hash the hashes step by step as the dependency chain grows.
154 * that can occur in the system, to make a unique hash value
157 * The task struct holds the current hash value (initialized
158 * with zero), here we store the previous hash value:
|
| /external/openssl/apps/ |
| crl.c | 83 " -hash - print hash value\n",
110 int hash=0,issuer=0,lastupdate=0,nextupdate=0,noout=0,text=0; local
193 else if (strcmp(*argv,"-hash") == 0)
194 hash= ++num;
302 if (hash == i)
|
