/external/chromium_org/third_party/libxslt/libexslt/ |
H A D | saxon.c | 14 #include <libxml/hash.h> 81 xmlHashTablePtr hash; local 95 hash = (xmlHashTablePtr) xsltGetExtData(tctxt, 98 ret = xmlHashLookup(hash, arg); 109 xmlHashAddEntry(hash, arg, (void *) ret);
|
/external/chromium_org/third_party/libyuv/unit_test/ |
H A D | compare_test.cc | 23 // hash seed of 5381 recommended. 25 uint32 hash = seed; local 28 hash = hash * 33 + *src++; 31 return hash; 50 // Compare different buffers. Expect hash is different. 55 // Make last half same. Expect hash is different. 61 // Make first half same. Expect hash is different. 69 // Make same. Expect hash is same. 75 // Mask seed different. Expect hash i [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
H A D | u_hash_table.c | 30 * 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/chromium_org/third_party/mesa/src/src/mesa/program/ |
H A D | prog_cache.c | 39 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/chromium_org/third_party/skia/include/core/ |
H A D | SkChecksum.h | 41 * 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/chromium_org/v8/test/cctest/ |
H A D | test-hashing.cc | 205 HASH_FUNCTION hash = FUNCTION_CAST<HASH_FUNCTION>(code->entry()); local 211 reinterpret_cast<uintptr_t>(CALL_GENERATED_CODE(hash, 0, 0, 0, 0, 0))); 213 uint32_t codegen_hash = hash(); 243 HASH_FUNCTION hash = FUNCTION_CAST<HASH_FUNCTION>(code->entry()); local 246 reinterpret_cast<uintptr_t>(CALL_GENERATED_CODE(hash, 0, 0, 0, 0, 0))); 248 uint32_t codegen_hash = hash();
|
H A D | test-hashmap.cc | 46 explicit IntSet(IntKeyHash hash) : hash_(hash), map_(DefaultMatchFun) {} argument 93 void TestSet(IntKeyHash hash, int size) { argument 94 IntSet set(hash);
|
/external/clang/test/PCH/ |
H A D | cxx-templates.cpp | 70 static unsigned hash(const char* data, unsigned length) { function in struct:Test1::CaseFoldingHash
|
/external/conscrypt/src/main/java/org/conscrypt/ |
H A D | KeyManagerImpl.java | 53 private final Hashtable<String, PrivateKeyEntry> hash; field in class:KeyManagerImpl 62 this.hash = new Hashtable<String, PrivateKeyEntry>(); 75 hash.put(alias, entry); 104 if (hash.containsKey(alias)) { 105 Certificate[] certs = hash.get(alias).getCertificateChain(); 133 if (hash.containsKey(alias)) { 134 return hash.get(alias).getPrivateKey(); 157 for (Enumeration<String> aliases = hash.keys(); aliases.hasMoreElements();) { 159 final KeyStore.PrivateKeyEntry entry = hash.get(alias);
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | ext_attr.c | 32 * Compute the hash of an extended attribute. 36 __u32 hash = 0; local 41 hash = (hash << NAME_HASH_SHIFT) ^ 42 (hash >> (8*sizeof(hash) - NAME_HASH_SHIFT)) ^ 46 /* The hash needs to be calculated on the data in little-endian. */ 51 hash = (hash << VALUE_HASH_SHIFT) ^ 52 (hash >> ( [all...] |
/external/elfutils/0.153/lib/ |
H A D | dynamicsizehash.c | 56 NAME name of the hash table structure. 57 TYPE data type of the hash table entries 73 /* First hash function: simply take the modul but prevent zero. */ 78 HASHTYPE hash; local 84 /* Second hash function as suggested in [Knuth]. */ 85 hash = 1 + hval % (htab->size - 2); 89 if (idx <= hash) 90 idx = htab->size + idx - hash; 92 idx -= hash; 243 /* Make the hash valu [all...] |
/external/fio/ |
H A D | filehash.c | 6 #include "hash.h" 17 static unsigned short hash(const char *name) function 49 struct flist_head *bucket = &file_hash[hash(name)]; 91 flist_add_tail(&f->hash_list, &file_hash[hash(f->file_name)]); 108 log_err("fio: file hash not empty on exit\n");
|
H A D | hash.h | 35 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 D | Murmur3_128HashFunction.java | 15 package com.google.common.hash;
|
H A D | Sink.java | 15 package com.google.common.hash;
|
/external/icu/icu4c/source/i18n/unicode/ |
H A D | smpdtfmt.h | 1524 int32_t hash; member in struct:SimpleDateFormat::NSOverride
|
/external/ipsec-tools/src/racoon/ |
H A D | vendorid.c | 132 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 D | SoftValueHashMap.java | 52 * 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 D | ckh.h | 17 * 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 D | pktloc.c | 50 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 D | compare_test.cc | 22 // 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 D | u_hash_table.c | 30 * 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 D | prog_cache.c | 39 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/oprofile/daemon/liblegacy/ |
H A D | opd_image.c | 96 * 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 D | opd_mapping.c | 27 /* 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...] |