| /external/oprofile/libutil/ |
| op_string.c | 24 size_t hash = 0; local
26 hash ^= (hash << 16) ^ (hash >> 8) ^ *str;
27 return hash;
|
| /external/dropbear/libtomcrypt/src/mac/hmac/ |
| hmac_init.c | 20 #define HMAC_BLOCKSIZE hash_descriptor[hash].blocksize
25 @param hash The index of the hash you want to use
30 int hmac_init(hmac_state *hmac, int hash, const unsigned char *key, unsigned long keylen)
40 /* valid hash? */
41 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
44 hmac->hash = hash;
45 hashsize = hash_descriptor[hash].hashsize;
68 if ((err = hash_memory(hash, key, keylen, hmac->key, &z)) != CRYPT_OK)
[all...] |
| /external/dropbear/libtomcrypt/src/headers/ |
| tomcrypt_hash.h | 1 /* ---- HASH FUNCTIONS ---- */
149 /** hash descriptor */
151 /** name of hash */
164 /** Init a hash state
165 @param hash The hash to initialize
168 int (*init)(hash_state *hash);
170 @param hash The hash state
171 @param in The data to hash
[all...] |
| /external/dropbear/libtomcrypt/src/hashes/helper/ |
| hash_file.c | 15 Hash a file, Tom St Denis
19 @param hash The index of the hash desired
20 @param fname The name of the file you wish to hash
25 int hash_file(int hash, const char *fname, unsigned char *out, unsigned long *outlen)
36 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
45 err = hash_filehandle(hash, in, out, outlen);
|
| /external/dropbear/libtomcrypt/src/misc/crypt/ |
| crypt_unregister_hash.c | 15 Unregister a hash, Tom St Denis
19 Unregister a hash from the descriptor table
20 @param hash The hash descriptor to remove
23 int unregister_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) {
|
| /build/tools/apriori/ |
| hash.c | 4 #include <hash.h>
8 Elf_Data *hash,
12 Elf32_Word *hash_data = (Elf32_Word *)hash->d_buf;
|
| hash.h | 9 Elf_Data *hash,
|
| /build/tools/lsd/ |
| hash.c | 4 #include <hash.h>
8 Elf_Data *hash,
13 Elf32_Word *hash_data = (Elf32_Word *)hash->d_buf;
|
| hash.h | 9 Elf_Data *hash,
|
| /external/webkit/WebCore/manual-tests/ |
| hash-ref.html | 3 <title>Manual Test for Bug 13067: Manually adding #hash to URL reloads entire page instead of jumping to #hash location in cached page</title>
9 <h3>Manual Test for <a href="https://bugs.webkit.org/show_bug.cgi?id=13067">Bug 13067: Manually adding #hash to URL reloads entire page instead of jumping to #hash location in cached page</a></h3>
13 <li>Click link to <a href="resources/hash-ref-test.html" target="_blank">open test page in new window</a>.</li>
14 <li>Set hash ref to "#div5" on the URL and hit <kbd>Enter</kbd>.<br> This should take you to the top of the div5 box <em>without</em> reloading the page.</li>
15 <li>Set hash ref to "#" on the URL and hit <kbd>Enter</kbd>.<br> This should take you to the top of the page <em>without</em> reloading.</li>
16 <li>Set hash ref to "#div3" on the URL and hit <kbd>Enter</kbd>.<br> This should take you to the top of the div3 box <em>without</em> reloading.</li>
17 <li>Hit <kbd>Enter</kbd> in the address bar without chainging the "#div3" hash.<br> This <em>should</em> reload the page.</li>
18 <li>Set hash ref to "#" on the URL and hit <kbd>Enter</kbd>.<br> This should take you to the top of the page < (…)
[all...] |
| /system/core/libcutils/ |
| hashmap.c | 29 int hash; member in struct:Entry
37 int (*hash)(void* key); member in struct:Hashmap
44 int (*hash)(void* key), bool (*equals)(void* keyA, void* keyB)) {
45 assert(hash != NULL);
69 map->hash = hash;
81 int h = map->hash(key);
97 static inline size_t calculateIndex(size_t bucketCount, int hash) {
98 return ((size_t) hash) & (bucketCount - 1);
118 size_t index = calculateIndex(newBucketCount, entry->hash);
190 int hash = hashKey(map, key); local
222 int hash = hashKey(map, key); local
237 int hash = hashKey(map, key); local
253 int hash = hashKey(map, key); local
285 int hash = hashKey(map, key); local
[all...] |
| /dalvik/vm/test/ |
| TestHash.c | 18 * Test the hash table functions.
76 * Some quick hash table tests.
83 u4 hash; local
97 hash = dvmComputeUtf8Hash(tmpStr);
98 dvmHashTableLookup(pTab, hash, strdup(tmpStr),
107 hash = dvmComputeUtf8Hash(tmpStr);
108 str = (const char*) dvmHashTableLookup(pTab, hash, tmpStr,
118 hash = dvmComputeUtf8Hash(tmpStr);
119 str = (const char*) dvmHashTableLookup(pTab, hash, tmpStr,
141 hash = 0
[all...] |
| /external/stlport/stlport/stl/ |
| _hash_fun.h | 40 template <class _Key> struct hash { }; struct
56 struct hash<char*> { struct
64 struct hash<const char*> { struct
71 _STLP_TEMPLATE_NULL struct hash<char> { struct
74 _STLP_TEMPLATE_NULL struct hash<unsigned char> { struct
78 _STLP_TEMPLATE_NULL struct hash<signed char> { struct
82 _STLP_TEMPLATE_NULL struct hash<short> { struct
85 _STLP_TEMPLATE_NULL struct hash<unsigned short> { struct
88 _STLP_TEMPLATE_NULL struct hash<int> { struct
93 _STLP_TEMPLATE_NULL struct hash<unsigned int> struct
103 _STLP_TEMPLATE_NULL struct hash<size_t> { struct
108 _STLP_TEMPLATE_NULL struct hash<long> { struct
111 _STLP_TEMPLATE_NULL struct hash<unsigned long> { struct
116 _STLP_TEMPLATE_NULL struct hash<_STLP_LONG_LONG> { struct
119 _STLP_TEMPLATE_NULL struct hash<unsigned _STLP_LONG_LONG> { struct
125 struct hash<void *> struct
[all...] |
| /external/webkit/WebCore/dom/ |
| QualifiedName.h | 115 uint32_t hash = WTF::stringHashingStartValue; local
119 hash += s[0];
120 uint32_t tmp = (s[1] << 11) ^ hash;
121 hash = (hash << 16) ^ tmp;
123 hash += hash >> 11;
127 hash ^= hash << 3;
128 hash += hash >> 5
143 static unsigned hash(const QualifiedName& name) { return hash(name.impl()); } function in struct:WebCore::QualifiedNameHash
145 static unsigned hash(const QualifiedName::QualifiedNameImpl* name) function in struct:WebCore::QualifiedNameHash
[all...] |
| /external/icu4c/common/ |
| hash.h | 28 UHashtable* hash; member in class:Hashtable
110 hash = &hashObj;
111 uhash_setKeyDeleter(hash, uhash_deleteUnicodeString);
116 UErrorCode& status) : hash(0) {
120 : hash(0)
131 : hash(0)
137 : hash(0)
144 if (hash != NULL) {
145 uhash_close(hash);
150 return uhash_setValueDeleter(hash, fn)
[all...] |
| uhash.h | 29 * functions. These functions hash keys, compare keys, delete keys,
54 * UHashElement pointer. A hash element contains a key, value, and
95 * This is a single hash element.
108 * @return A NON-NEGATIVE hash code for parm.
158 UHashFunction *keyHasher; /* Computes hash from key.
218 * @param size The initial capacity of this hash table.
241 uhash_init(UHashtable *hash,
249 * @param hash The UHashtable to close. If hash is NULL no operation is performed.
252 uhash_close(UHashtable *hash);
[all...] |
| /external/srec/srec/crec/ |
| astar_pphash.c | 32 /* initialize the hash with no elements defined */
34 void hash_init(FixedSizeHash* hash, srec* rec_debug)
37 hash->hashsize = FSH_HASHSIZE;
38 for (i = 0; i < hash->hashsize; i++)
39 hash->items[i] = FSH_NULL;
40 hash->rec = rec_debug;
94 int hash_get(FixedSizeHash* hash, partial_path* parp, void** hval)
99 hkey_index = hkey_index % hash->hashsize;
100 p_return = hash->items[hkey_index];
105 if (compare_parp(p_return, parp, hash->rec) == 0
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| hashtab.h | 1 /* An expandable hash tables datatype.
19 /* This package implements basic hash table functionality. It is possible
25 grows too high the hash table will be expanded.
28 from Knuth's book "The art of computer programming". Hash table is
29 expanded by creation of new hash table and transferring elements from
45 /* The type for a hash code. */
50 /* Calculate hash of a table entry. */
56 cannot be used; instead the variants that accept a hash value
61 the hash table. */
71 Iff it returns NULL, the hash table implementation will pass an erro
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/ |
| ExtendedType.java | 32 private int hash; field in class:ExtendedType
36 * The hash code is calculated from the node type, namespace and local name.
47 this.hash = nodetype + namespace.hashCode() + localName.hashCode();
52 * and a given hash code.
57 * @param hash The given hash code
59 public ExtendedType (int nodetype, String namespace, String localName, int hash)
64 this.hash = hash;
77 this.hash = nodetype + namespace.hashCode() + localName.hashCode()
[all...] |
| /external/v8/src/ |
| utils.cc | 54 // Thomas Wang, Integer Hash Functions.
57 uint32_t hash = key; local
58 hash = ~hash + (hash << 15); // hash = (hash << 15) - hash - 1;
59 hash = hash ^ (hash >> 12)
[all...] |
| /external/iproute2/tc/ |
| f_tcindex.c | 20 fprintf(stderr," Usage: ... tcindex [ hash SIZE ] [ mask MASK ]"
49 if (!strcmp(*argv,"hash")) {
50 int hash; local
53 hash = strtoul(*argv,&end,0);
54 if (*end || !hash || hash > 0x10000) {
58 addattr_l(n,4096,TCA_TCINDEX_HASH,&hash,sizeof(hash));
137 __u16 hash; local
139 if (RTA_PAYLOAD(tb[TCA_TCINDEX_HASH]) < sizeof(hash))
[all...] |
| /dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/ess/ |
| ESSCertID.java | 54 byte[] hash)
56 certHash = new DEROctetString(hash);
60 byte[] hash,
63 this.certHash = new DEROctetString(hash);
80 * certHash Hash,
|
| /external/e2fsprogs/lib/e2p/ |
| hashstr.c | 19 struct hash { struct
24 static struct hash hash_list[] = {
33 struct hash *p;
45 * Returns the hash algorithm, or -1 on error
49 struct hash *p;
|
| /external/webkit/JavaScriptCore/ |
| create_hash_table | 181 # http://www.azillionmonkeys.com/qed/hash.html
186 # This hash is designed to work on 16-bit chunks at a time. But since the normal case
187 # (above) is to hash UTF-16 characters, we just treat the 8-bit chars as if they
192 my $hash = 0x9e3779b9;
201 $hash += ord($chars[$s]);
202 my $tmp = leftShift(ord($chars[$s+1]), 11) ^ $hash;
203 $hash = (leftShift($hash, 16)% $EXP2_32) ^ $tmp;
205 $hash += $hash >> 11
[all...] |
| /dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/cert/ |
| Cache.java | 73 // Hash code consist of 6 bytes: AABB00
75 // AA - 2 bytes for prefix hash
77 // BB - 2 bytes for tail hash
82 // the similar hash codes.
84 // The masks to work with hash codes:
85 // the hash code without the reserved bytes
87 // the hash code of the prefix
94 // the number of bytes which will be used for array hash generation.
98 // This information includes: hash of the array, encoded form of the object,
100 // The hash-encoding-object correspondence is made by means of inde
190 long hash = 0; local
[all...] |
