Searched defs:hash (Results 201 - 225 of 896) sorted by relevance

1234567891011>>

/external/fio/
H A Dhash.h35 unsigned long hash = val; local
39 unsigned long n = hash;
41 hash -= n;
43 hash -= n;
45 hash += n;
47 hash -= n;
49 hash += n;
51 hash += n;
54 hash *= GOLDEN_RATIO_PRIME;
57 return hash;
[all...]
/external/guava/guava/src/com/google/common/hash/
H A DMurmur3_128HashFunction.java15 package com.google.common.hash;
H A DSink.java15 package com.google.common.hash;
/external/icu/icu4c/source/i18n/unicode/
H A Dsmpdtfmt.h1524 int32_t hash; member in struct:SimpleDateFormat::NSOverride
/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...]
/external/javassist/src/main/javassist/scopedpool/
H A DSoftValueHashMap.java52 * Returns a set of the mappings contained in this hash table.
56 return hash.entrySet();
60 private Map hash; field in class:SoftValueHashMap
72 if (ref == (SoftValueRef)hash.get(ref.key)) {
75 hash.remove(ref.key);
97 hash = new HashMap(initialCapacity, loadFactor);
111 hash = new HashMap(initialCapacity);
119 hash = new HashMap();
146 return hash.size();
154 return hash
[all...]
/external/jemalloc/include/jemalloc/internal/
H A Dckh.h17 * There are 2^LG_CKH_BUCKET_CELLS cells in each hash table bucket. Try to fit
51 * Minimum and current number of hash table buckets. There are
58 ckh_hash_t *hash; member in struct:ckh_s
69 bool ckh_new(ckh_t *ckh, size_t minitems, ckh_hash_t *hash,
/external/libnl/lib/route/
H A Dpktloc.c50 unsigned long hash = 5381; local
54 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
56 return hash % PKTLOC_NAME_HT_SIZ;
144 int hash, err; local
149 hash = pktloc_hash(name);
150 nl_list_for_each_entry(loc, &pktloc_name_ht[hash], list) {
/external/libyuv/files/unit_test/
H A Dcompare_test.cc22 // hash seed of 5381 recommended.
24 uint32 hash = seed; local
27 hash = hash * 33 + *src++;
30 return hash;
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_hash_table.c30 * General purpose hash table implementation.
33 * probing hash table implementation at some point -- as it is said they have
35 * a lock-free implementation of such hash tables .
55 unsigned (*hash)(void *key); member in struct:util_hash_table
79 util_hash_table_create(unsigned (*hash)(void *key),
94 ht->hash = hash;
154 key_hash = ht->hash(key);
191 key_hash = ht->hash(key);
213 key_hash = ht->hash(ke
[all...]
/external/mesa3d/src/mesa/program/
H A Dprog_cache.c39 GLuint hash; member in struct:cache_item
55 * Compute hash index from state key.
61 GLuint hash = 0, i; local
65 /* Make a slightly better attempt at a hash function:
69 hash += ikey[i];
70 hash += (hash << 10);
71 hash ^= (hash >> 6);
74 return hash;
182 const GLuint hash = hash_key(key, keysize); local
203 const GLuint hash = hash_key(key, keysize); local
231 const GLuint hash = hash_key(key, keysize); local
[all...]
/external/openfst/src/include/fst/
H A Dcompat.h116 // Define missing hash functions if needed
121 template <class T> class hash;
123 template<> struct hash<uint64> { struct in namespace:std::tr1
/external/oprofile/daemon/liblegacy/
H A Dopd_image.c96 * opd_hash_image - hash an image
97 * @param hash hash of image name
101 * return the hash code for the passed parameters
105 size_t hash = op_hash_string(name); local
107 hash += tid + tgid;
108 return hash % OPD_IMAGE_HASH_SIZE;
214 * @param hash hash of image to find
H A Dopd_mapping.c27 /* hash map device mmap */
48 perror("oprofiled: couldn't mmap hash map");
96 * get_from_pool - retrieve string from hash map pool
106 * opg_get_hash_name - find a mapping name from a hash
107 * @param hash hash value for this name
109 static char const * opd_get_hash_name(int hash) argument
113 int orighash = hash;
115 if (hash_name[hash])
116 return hash_name[hash];
143 int hash; local
[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/oprofile/libdb/tests/
H A Ddb_test.c3 * Tests for DB hash
22 #define TEST_FILENAME "test-hash-db.dat"
50 odb_t hash; local
53 rc = odb_open(&hash, TEST_FILENAME, ODB_RDWR, sizeof(struct opd_header));
60 rc = odb_update_node(&hash, i);
68 odb_close(&hash);
91 odb_t hash; local
95 rc = odb_open(&hash, TEST_FILENAME, ODB_RDWR, sizeof(struct opd_header));
104 rc = odb_update_node(&hash, key);
111 ret = odb_check_hash(&hash);
141 odb_t hash; local
[all...]
/external/owasp/sanitizer/src/main/org/owasp/html/
H A DCssGrammar.java112 handler.hash(token);
209 void hash(String token); method in interface:CssGrammar.PropertyHandler
/external/ppp/pppd/
H A Dchap-md5.c64 unsigned char hash[MD5_HASH_SIZE]; local
70 /* Generate hash of ID, secret, challenge */
75 MD5_Final(hash, &ctx);
77 /* Test if our hash matches the peer's response */
78 if (memcmp(hash, response, MD5_HASH_SIZE) == 0) {
/external/protobuf/java/src/main/java/com/google/protobuf/micro/
H A DByteStringMicro.java204 private volatile int hash = 0; field in class:ByteStringMicro
208 int h = hash;
222 hash = h;
/external/skia/include/core/
H A DSkChecksum.h41 * Calculate 32-bit Murmur hash (murmur3).
42 * This should take 2-3x longer than SkChecksum::Compute, but is a considerably better hash.
47 * @param seed Initial hash seed. (optional)
48 * @return hash result
54 uint32_t hash = seed; local
61 hash ^= k;
62 hash = (hash << 13) | (hash >> 19);
63 hash *
[all...]
/external/stlport/stlport/stl/
H A D_collate.h59 long hash(const char* __low, const char* __high) const function in class:collate
95 long hash(const wchar_t* __low, const wchar_t* __high) const function in class:collate
/external/wpa_supplicant_8/hostapd/src/eap_server/
H A Deap_server_md5.c104 u8 hash[CHAP_MD5_LEN], id; local
123 data->challenge, CHALLENGE_LEN, hash)) {
129 if (os_memcmp_const(hash, pos, CHAP_MD5_LEN) == 0) {
/external/wpa_supplicant_8/src/eap_server/
H A Deap_server_md5.c104 u8 hash[CHAP_MD5_LEN], id; local
123 data->challenge, CHALLENGE_LEN, hash)) {
129 if (os_memcmp_const(hash, pos, CHAP_MD5_LEN) == 0) {
/external/wpa_supplicant_8/wpa_supplicant/src/eap_server/
H A Deap_server_md5.c104 u8 hash[CHAP_MD5_LEN], id; local
123 data->challenge, CHALLENGE_LEN, hash)) {
129 if (os_memcmp_const(hash, pos, CHAP_MD5_LEN) == 0) {

Completed in 4669 milliseconds

1234567891011>>