| /external/e2fsprogs/tests/f_h_badnode/ |
| name | 0 hash directory with bad HTREE nodes
|
| /external/e2fsprogs/tests/f_h_reindex/ |
| name | 1 reindex HTREE Directory with different hash seed
|
| expect.1 | 5 Problem in HTREE directory inode 16001: node (1) has bad max hash
6 Problem in HTREE directory inode 16001: node (2) has bad min hash
7 Problem in HTREE directory inode 16001: node (2) has bad max hash
8 Problem in HTREE directory inode 16001: node (3) has bad min hash
9 Problem in HTREE directory inode 16001: node (3) has bad max hash
10 Problem in HTREE directory inode 16001: node (4) has bad min hash
11 Problem in HTREE directory inode 16001: node (4) has bad max hash
12 Problem in HTREE directory inode 16001: node (5) has bad min hash
13 Problem in HTREE directory inode 16001: node (5) has bad max hash
14 Problem in HTREE directory inode 16001: node (6) has bad min hash
[all...] |
| /external/webkit/JavaScriptCore/wtf/ |
| StringHashFunctions.h | 31 // http://www.azillionmonkeys.com/qed/hash.html
36 unsigned hash = WTF::stringHashingStartValue; local
42 hash += data[0];
43 unsigned tmp = (data[1] << 11) ^ hash;
44 hash = (hash << 16) ^ tmp;
46 hash += hash >> 11;
51 hash += data[0];
52 hash ^= hash << 11
76 unsigned hash = WTF::stringHashingStartValue; local
116 unsigned hash = WTF::stringHashingStartValue; local
[all...] |
| HashFunctions.h | 35 // integer hash function
90 static unsigned hash(T key) { return intHash(static_cast<typename IntTypes<sizeof(T)>::UnsignedType>(key)); } function in struct:WTF::IntHash
96 static unsigned hash(T key) function in struct:WTF::FloatHash
109 // pointer identity hash function
112 static unsigned hash(T key) function in struct:WTF::PtrHash
118 return IntHash<uintptr_t>::hash(reinterpret_cast<uintptr_t>(key));
127 using PtrHash<P*>::hash;
128 static unsigned hash(const RefPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash
135 // default hash function for each typ
140 static unsigned hash(const std::pair<T, U>& p) function in struct:WTF::PairHash
[all...] |
| /external/e2fsprogs/ext2ed/ |
| ext2.descriptors | 416 __u32 hash[1];
418 __u32 hash[2];
420 __u32 hash[3];
422 __u32 hash[4];
424 __u32 hash[5];
426 __u32 hash[6];
428 __u32 hash[7];
430 __u32 hash[8];
432 __u32 hash[9];
434 __u32 hash[10]
[all...] |
| /external/webkit/WebCore/platform/text/ |
| StringHash.h | 33 // The hash() functions on StringHash and CaseFoldingHash do not support
39 // closer to having all the nearly-identical hash functions in one place.
42 static unsigned hash(StringImpl* key) { return key->hash(); } function in struct:WebCore::StringHash
82 static unsigned hash(const RefPtr<StringImpl>& key) { return key->hash(); } function in struct:WebCore::StringHash
88 static unsigned hash(const String& key) { return key.impl()->hash(); } function in struct:WebCore::StringHash
100 // http://www.azillionmonkeys.com/qed/hash.html
101 static unsigned hash(const UChar* data, unsigned length function in class:WebCore::CaseFoldingHash
105 uint32_t hash = WTF::stringHashingStartValue; local
142 static unsigned hash(StringImpl* str) function in class:WebCore::CaseFoldingHash
147 static unsigned hash(const char* str, unsigned length) function in class:WebCore::CaseFoldingHash
155 uint32_t hash = WTF::stringHashingStartValue; local
204 static unsigned hash(const RefPtr<StringImpl>& key) function in class:WebCore::CaseFoldingHash
214 static unsigned hash(const String& key) function in class:WebCore::CaseFoldingHash
218 static unsigned hash(const AtomicString& key) function in class:WebCore::CaseFoldingHash
238 static unsigned hash(unsigned key) { return key; } function in struct:WebCore::AlreadyHashed
[all...] |
| /external/webkit/LayoutTests/storage/ |
| hash-change-with-xhr-expected.txt | 1 Changing the hash to create history entries.
|
| /frameworks/base/core/java/android/security/ |
| package.html | 3 Utilities for encrypting messages from hash functions.
|
| /external/bison/m4/ |
| hash.m4 | 0 # hash.m4 serial 5
9 AC_LIBSOURCES([hash.c, hash.h])
10 AC_LIBOBJ([hash])
12 dnl Prerequisites of lib/hash.c.
|
| /external/icu4c/test/cintltst/ |
| chashtst.c | 30 static void _put(UHashtable* hash,
35 static void _get(UHashtable* hash,
39 static void _remove(UHashtable* hash,
104 UHashtable *hash; local
106 hash = uhash_open(hashChars, isEqualChars, NULL, &status);
109 u_errorName(status), hash);
112 if (hash == NULL) {
116 log_verbose("Ok: uhash_open returned 0x%08X\n", hash);
118 _put(hash, one, 1, 0);
119 _put(hash, omega, 24, 0)
154 UHashtable *hash; local
288 UHashtable *hash; local
[all...] |
| /external/clearsilver/util/ |
| neo_hash.c | 21 static NEOERR *_hash_resize(NE_HASH *hash);
22 static NE_HASHNODE **_hash_lookup_node (NE_HASH *hash, void *key, UINT32 *hashv);
24 NEOERR *ne_hash_init (NE_HASH **hash, NE_HASH_FUNC hash_func, NE_COMP_FUNC comp_func)
44 *hash = my_hash;
49 void ne_hash_destroy (NE_HASH **hash)
55 if (hash == NULL || *hash == NULL)
58 my_hash = *hash;
73 *hash = NULL;
76 NEOERR *ne_hash_insert(NE_HASH *hash, void *key, void *value
[all...] |
| neo_hash.h | 41 NEOERR *ne_hash_init (NE_HASH **hash, NE_HASH_FUNC hash_func, NE_COMP_FUNC comp_func);
42 void ne_hash_destroy (NE_HASH **hash);
43 NEOERR *ne_hash_insert(NE_HASH *hash, void *key, void *value);
44 void *ne_hash_lookup(NE_HASH *hash, void *key);
45 int ne_hash_has_key(NE_HASH *hash, void *key);
46 void *ne_hash_remove(NE_HASH *hash, void *key);
47 void *ne_hash_next(NE_HASH *hash, void **key);
|
| /build/tools/droiddoc/templates/assets/ |
| jquery-history.js | 15 return msie.getDoc().location.hash;
17 setHash: function(hash) {
21 d.location.hash = hash;
26 var hash = msie.iframe ? msie.getHash() : location.hash;
27 if (hash != currentHash) {
28 currentHash = hash;
30 location.hash = currentHash;
39 add: function(hash) {
[all...] |
| /external/dropbear/libtomcrypt/src/hashes/helper/ |
| hash_memory.c | 15 Hash memory helper, Tom St Denis
19 Hash a block of memory and store the digest.
20 @param hash The index of the hash you wish to use
21 @param in The data you wish to hash
22 @param inlen The length of the data to hash (octets)
27 int hash_memory(int hash, const unsigned char *in, unsigned long inlen, unsigned char *out, unsigned long *outlen)
36 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
40 if (*outlen < hash_descriptor[hash].hashsize) {
41 *outlen = hash_descriptor[hash].hashsize
[all...] |
| hash_filehandle.c | 15 Hash open files, Tom St Denis
19 Hash data from an open file handle.
20 @param hash The index of the hash you want to use
21 @param in The FILE* handle of the file you want to hash
26 int hash_filehandle(int hash, FILE *in, unsigned char *out, unsigned long *outlen)
40 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
44 if (*outlen < hash_descriptor[hash].hashsize) {
45 *outlen = hash_descriptor[hash].hashsize;
48 if ((err = hash_descriptor[hash].init(&md)) != CRYPT_OK)
[all...] |
| hash_memory_multi.c | 15 Hash (multiple buffers) memory helper, Tom St Denis
19 Hash multiple (non-adjacent) blocks of memory at once.
20 @param hash The index of the hash you wish to use
23 @param in The data you wish to hash
24 @param inlen The length of the data to hash (octets)
25 @param ... tuples of (data,len) pairs to hash, terminated with a (NULL,x) (x=don't care)
28 int hash_memory_multi(int hash, unsigned char *out, unsigned long *outlen,
41 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
45 if (*outlen < hash_descriptor[hash].hashsize)
[all...] |
| /external/elfutils/libelf/ |
| dl-hash.h | 1 /* Compute hash value for given string according to ELF standard.
30 unsigned int hash = (unsigned int) *iname++; local
33 hash = (hash << 4) + (unsigned int) *iname++;
36 hash = (hash << 4) + (unsigned int) *iname++;
39 hash = (hash << 4) + (unsigned int) *iname++;
42 hash = (hash << 4) + (unsigned int) *iname++
[all...] |
| /external/clearsilver/util/test/ |
| hash_test.c | 9 void dump_string_hash(NE_HASH *hash)
14 for (x = 0; x < hash->size; x++)
17 for (node = hash->nodes[x]; node; node = node->next)
19 ne_warn(" %s = %s [%8x | %d]", node->key, node->value, node->hashv, node->hashv & (hash->size - 1));
29 NE_HASH *hash = NULL; local
33 err = ne_hash_init(&hash, ne_hash_str_hash, ne_hash_str_comp);
44 ne_warn("Loading words into hash");
52 err = ne_hash_insert(hash, word, word);
54 word = ne_hash_lookup(hash, buf);
57 err = nerr_raise(NERR_ASSERT, "Unable to find word %s in hash", buf)
[all...] |
| /external/dropbear/libtomcrypt/src/mac/hmac/ |
| hmac_done.c | 20 #define HMAC_BLOCKSIZE hash_descriptor[hash].blocksize
33 int hash, err; local
38 /* test hash */
39 hash = hmac->hash;
40 if((err = hash_is_valid(hash)) != CRYPT_OK) {
44 /* get the hash message digest size */
45 hashsize = hash_descriptor[hash].hashsize;
60 /* Get the hash of the first HMAC vector plus the data */
61 if ((err = hash_descriptor[hash].done(&hmac->md, isha)) != CRYPT_OK)
[all...] |
| /external/wpa_supplicant/ |
| eap_psk_common.c | 40 u8 hash[aes_block_size]; local
44 aes_128_encrypt_block(kdk, rand_p, hash);
46 hash[aes_block_size - 1] ^= counter;
47 aes_128_encrypt_block(kdk, hash, tek);
48 hash[aes_block_size - 1] ^= counter;
52 hash[aes_block_size - 1] ^= counter;
53 aes_128_encrypt_block(kdk, hash, &msk[i * aes_block_size]);
54 hash[aes_block_size - 1] ^= counter;
59 hash[aes_block_size - 1] ^= counter;
60 aes_128_encrypt_block(kdk, hash, &emsk[i * aes_block_size])
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/src/eap_common/ |
| eap_psk_common.c | 43 u8 hash[aes_block_size]; local
47 if (aes_128_encrypt_block(kdk, rand_p, hash))
50 hash[aes_block_size - 1] ^= counter;
51 if (aes_128_encrypt_block(kdk, hash, tek))
53 hash[aes_block_size - 1] ^= counter;
57 hash[aes_block_size - 1] ^= counter;
58 if (aes_128_encrypt_block(kdk, hash, &msk[i * aes_block_size]))
60 hash[aes_block_size - 1] ^= counter;
65 hash[aes_block_size - 1] ^= counter;
66 if (aes_128_encrypt_block(kdk, hash,
[all...] |
| /external/icu4c/common/ |
| uhash.c | 19 /* This hashtable is implemented as a double hash. All elements are
21 * resolution (no linked list, etc.). When there is a hash collision
23 * using a secondary hash. The secondary hash is an increment
24 * computed as a hash function (a different one) of the primary
25 * hashcode. This increment is added to the initial hash value to
26 * obtain further slots assigned to the same hash code. For this to
119 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \
120 if (hash->keyDeleter != NULL && keypointer != NULL) { \
121 (*hash->keyDeleter)(keypointer);
[all...] |
| /external/dropbear/libtomcrypt/src/misc/crypt/ |
| crypt_register_hash.c | 15 Register a HASH, Tom St Denis
19 Register a hash with the descriptor table
20 @param hash The hash you wish to register
23 int register_hash(const struct ltc_hash_descriptor *hash)
27 LTC_ARGCHK(hash != NULL);
32 if (XMEMCMP(&hash_descriptor[x], hash, sizeof(struct ltc_hash_descriptor)) == 0) {
41 XMEMCPY(&hash_descriptor[x], hash, sizeof(struct ltc_hash_descriptor));
|
| /frameworks/base/sax/java/android/sax/ |
| Children.java | 31 int hash = uri.hashCode() * 31 + localName.hashCode(); local
32 int index = hash & 15;
37 current = new Child(parent, uri, localName, parent.depth + 1, hash);
44 if (current.hash == hash
56 current = new Child(parent, uri, localName, parent.depth + 1, hash);
66 int hash = uri.hashCode() * 31 + localName.hashCode(); local
67 int index = hash & 15;
74 if (current.hash == hash
88 final int hash; field in class:Children.Child
[all...] |
