| /external/libxml2/include/libxml/ |
| hash.h | 2 * Summary: Chained hash tables
3 * Description: This module implements the hash table support used in
19 * The hash table.
64 * @payload: the data in the hash
67 * Callback to free data from a hash.
72 * @payload: the data in the hash
75 * Callback to copy data from a hash.
82 * @payload: the data in the hash
86 * Callback when scanning data in a hash with the simple scanner.
91 * @payload: the data in the hash
[all...] |
| /frameworks/base/awt/java/awt/image/ |
| SinglePixelPackedSampleModel.java | 458 * Returns a hash code of this MultiPixelPackedSampleModel class.
460 * @return the hash code of this MultiPixelPackedSampleModel class.
464 int hash = 0; local
467 hash = width;
468 tmp = hash >>> 24;
469 hash <<= 8;
470 hash |= tmp;
471 hash ^= height;
472 tmp = hash >>> 24;
473 hash <<= 8
[all...] |
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
| ConcurrentHashMap.java | 20 * A hash table supporting full concurrency of retrievals and
38 * Enumerations return elements reflecting the state of the hash table
48 * in hash tables is essentially random, the actual concurrency will
57 * hash table is a relatively slow operation, so, when possible, it is
79 * each of which itself is a concurrently readable hash table.
128 * key's hash code are used to choose the segment.
138 * The segments, each of which is a specialized hash table
149 * Applies a supplemental hash function to a given hashCode, which
150 * defends against poor quality hash functions. This is critical
151 * because ConcurrentHashMap uses power-of-two length hash tables
155 private static int hash(int h) { method in class:ConcurrentHashMap
191 final int hash; field in class:ConcurrentHashMap.HashEntry
749 int hash = hash(key.hashCode()); local
763 int hash = hash(key.hashCode()); local
863 int hash = hash(key.hashCode()); local
877 int hash = hash(key.hashCode()); local
903 int hash = hash(key.hashCode()); local
913 int hash = hash(key.hashCode()); local
927 int hash = hash(key.hashCode()); local
941 int hash = hash(key.hashCode()); local
[all...] |
| /dalvik/libcore/crypto/src/main/java/javax/crypto/ |
| package.html | 15 Authentication may be based on MAC (Message Authentication Code) such as HMAC (Hash MAC, i.e. with a SHA-1 hash function).
|
| /external/clearsilver/man/man3/ |
| hdf_set_value.3 | 36 If a list of nodes exceeds FORCE_HASH_AT, then a HASH
38 be added to the hash for faster lookup times.
|
| /external/dropbear/libtomcrypt/src/hashes/sha2/ |
| sha224.c | 36 Initialize the hash state
37 @param md The hash state you wish to initialize
58 Terminate the hash to get the digest
59 @param md The hash state
60 @param out [out] The destination of the hash (28 bytes)
80 Self-test the hash
90 unsigned char hash[28];
114 if (XMEMCMP(tmp, tests[i].hash, 28) != 0) {
|
| /external/oprofile/daemon/ |
| opd_cookie.c | 135 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]) {
|
| /packages/apps/Gallery3D/src/com/cooliris/media/ |
| ArrayUtils.java | 24 int maxSize, ArrayList<MediaItem> intersectionList, MediaItem[] hash) {
27 int mask = hash.length - 1;
28 int numItemsToHash = Math.min(secondList.size(), 2 * hash.length);
32 hash[item.hashCode() & mask] = item;
42 MediaItem hashItem = (hash != null) ? hash[firstListItem.hashCode() & mask] : null;
52 // Clear the hash table.
53 Arrays.fill(hash, null);
|
| /external/e2fsprogs/tests/ |
| filter_dumpe2fs | 8 /^Directory Hash Seed:/d
|
| /external/oprofile/libdb/ |
| db_manage.c | 53 * return the number of bytes used by hash table, node table and header.
93 /* rebuild the hash table, node zero is never used. This works
94 * because layout of file is node table then hash table,
96 * double size ==> old hash table and new hash table can't
97 * overlap so on the new hash table is entirely in the new
98 * memory area (the grown part) and we know the new hash
99 * hash table is zeroed. That's why we don't need to zero init
103 * all things are fine and we don't need to init the hash
104 * table because in this case the new hash table is completel
172 size_t hash; local
[all...] |
| /dalvik/libcore/security/src/main/java/org/bouncycastle/jce/provider/ |
| JDKDigestSignature.java | 123 byte[] hash = new byte[digest.getDigestSize()];
125 digest.doFinal(hash, 0);
129 byte[] bytes = derEncode(hash);
147 byte[] hash = new byte[digest.getDigestSize()];
149 digest.doFinal(hash, 0);
158 expected = derEncode(hash);
177 int sigOffset = sig.length - hash.length - 2;
178 int expectedOffset = expected.length - hash.length - 2;
183 for (int i = 0; i < hash.length; i++)
185 if (sig[sigOffset + i] != expected[expectedOffset + i]) // check hash
[all...] |
| /external/dropbear/libtomcrypt/src/misc/crypt/ |
| crypt_find_hash.c | 15 Find a hash, Tom St Denis
19 Find a registered hash by name
20 @param name The name of the hash to look for
|
| crypt_find_hash_any.c | 15 Find a hash, Tom St Denis
19 Find a hash flexibly. First by name then if not present by digest size
20 @param name The name of the hash desired
|
| crypt_find_hash_id.c | 15 Find hash by ID, Tom St Denis
19 Find a hash by ID number
20 @param ID The ID (not same as index) of the hash to find
|
| /external/dropbear/libtomcrypt/src/pk/rsa/ |
| rsa_verify_hash.c | 24 @param hash The hash of the message that was signed
25 @param hashlen The length of the hash of the message that was signed (octets)
27 @param hash_idx The index of the desired hash
34 const unsigned char *hash, unsigned long hashlen,
43 LTC_ARGCHK(hash != NULL);
59 /* valid hash ? */
95 err = pkcs_1_pss_decode(hash, hashlen, tmpbuf, x, saltlen, hash_idx, modulus_bitlen, stat);
109 /* allocate temp buffer for decoded hash */
122 /* now we must decode out[0...outlen-1] using ASN.1, test the OID and then test the hash */
[all...] |
| /external/iptables/extensions/ |
| libipt_hashlimit.man | 26 The number of buckets of the hash table
29 Maximum entries in the hash
32 After how many miliseconds do hash entries expire
|
| /external/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /external/libxml2/ |
| dict.c | 272 * Calculate a hash key using a good hash function that works well for
273 * larger hash table sizes.
275 * Hash function by "One-at-a-Time Hash" see
276 * http://burtleburtle.net/bob/hash/doobs.html
281 uint32_t hash; local
286 hash = 0;
289 hash += data[i];
290 hash += (hash << 10)
315 uint32_t hash; local
[all...] |
| /external/dropbear/libtomcrypt/demos/ |
| hashsum.c | 3 * hash.c: This app uses libtomcrypt to hash either stdin or a file
26 printf("usage: ./hash algorithm file [file ...]\n");
36 fprintf(stderr, "\nInvalid hash specified on command line.\n");
55 printf("File hash error: %s\n", error_to_string(errno));
|
| /external/dropbear/libtomcrypt/src/mac/hmac/ |
| hmac_file.c | 22 @param hash The index of the hash you wish to use
30 int hmac_file(int hash, const char *fname,
48 if((err = hash_is_valid(hash)) != CRYPT_OK) {
52 if ((err = hmac_init(&hmac, hash, key, keylen)) != CRYPT_OK) {
|
| /external/srec/srec/crec/ |
| astar_pphash.h | 32 * The FixedSizeHash is a hash that does not grow in size.
47 void hash_init(FixedSizeHash* hash, srec* rec);
48 int hash_del(FixedSizeHash* hash, partial_path* parp);
51 int hash_get(FixedSizeHash* hash, partial_path* parp, void** hval);
52 int hash_set(FixedSizeHash* hash, partial_path* parp);
|
| /external/webkit/WebCore/platform/ |
| Cookie.h | 63 static unsigned hash(Cookie key) function in struct:WebCore::CookieHash
65 return StringHash::hash(key.name) + StringHash::hash(key.domain) + StringHash::hash(key.path) + key.secure;
78 typedef WebCore::CookieHash Hash;
|
| /external/webkit/WebCore/platform/network/ |
| ProtectionSpaceHash.h | 35 static unsigned hash(const ProtectionSpace& protectionSpace) function in struct:WebCore::ProtectionSpaceHash
38 protectionSpace.host().impl() ? protectionSpace.host().impl()->hash() : 0,
42 protectionSpace.realm().impl() ? protectionSpace.realm().impl()->hash() : 0
60 // WebCore::ProtectionSpaceHash is the default hash for ProtectionSpace
69 typedef WebCore::ProtectionSpaceHash Hash;
|
| /external/wpa_supplicant_6/wpa_supplicant/src/eap_common/ |
| eap_peap_common.c | 27 u8 hash[SHA1_MAC_LEN]; local
33 addr[0] = hash;
78 hmac_sha1_vector(key, key_len, 5, addr, len, hash);
80 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN);
83 os_memcpy(&buf[pos], hash, plen);
|
| /dalvik/libcore/luni/src/main/java/java/util/ |
| Hashtable.java | 76 * The hash table.
81 * The number of mappings in this hash map.
267 int hash = key.hashCode(); local
268 hash ^= (hash >>> 20) ^ (hash >>> 12);
269 hash ^= (hash >>> 7) ^ (hash >>> 4);
272 for (HashtableEntry<K, V> e = tab[hash & (tab.length - 1)]
295 int hash = key.hashCode(); local
371 int hash = secondaryHash(key.hashCode()); local
405 int hash = secondaryHash(key.hashCode()); local
558 int hash = secondaryHash(key.hashCode()); local
667 final int hash; field in class:Hashtable.HashtableEntry
802 int hash = secondaryHash(key.hashCode()); local
818 int hash = secondaryHash(key.hashCode()); local
[all...] |
