/freebsd-10.2-release/contrib/mdocml/ |
H A D | chars.c | 71 int i, hash; local 74 * Constructs a very basic chaining hashtable. The hash routine 83 hash = (int)lines[i].code[0] - PRINT_LO; 85 if (NULL == (pp = htab[hash])) { 86 htab[hash] = &lines[i]; 152 int hash; local 159 hash = (int)p[0] - PRINT_LO; 161 for (pp = tab->htab[hash]; pp; pp = pp->next)
|
/freebsd-10.2-release/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/ |
H A D | lzjb.c | 58 int mlen, offset, hash; local 74 hash = (src[0] << 16) + (src[1] << 8) + src[2]; 75 hash += hash >> 9; 76 hash += hash >> 5; 77 hp = &lempel[hash & (LEMPEL_SIZE - 1)];
|
/freebsd-10.2-release/contrib/binutils/bfd/ |
H A D | hash.c | 0 /* hash.c -- hash table routines for BFD 33 BFD provides a simple set of hash table functions. Routines 34 are provided to initialize a hash table, to free a hash table, 35 to look up a string in a hash table and optionally create an 36 entry for it, and to traverse a hash table. There is 37 currently no routine to delete an string from a hash table. 39 The basic hash table does not permit any data to be stored 40 with a string. However, a hash tabl 422 unsigned long hash; local 738 _bfd_stringtab_add(struct bfd_strtab_hash *tab, const char *str, bfd_boolean hash, bfd_boolean copy) argument [all...] |
/freebsd-10.2-release/contrib/unbound/util/storage/ |
H A D | slabhash.c | 39 * Implementation of hash table that consists of smaller hash tables. 111 slab_idx(struct slabhash* sl, hashvalue_t hash) argument 113 return ((hash & sl->mask) >> sl->shift); 116 void slabhash_insert(struct slabhash* sl, hashvalue_t hash, argument 119 lruhash_insert(sl->array[slab_idx(sl, hash)], hash, entry, data, arg); 123 hashvalue_t hash, void* key, int wr) 125 return lruhash_lookup(sl->array[slab_idx(sl, hash)], hash, ke 122 slabhash_lookup(struct slabhash* sl, hashvalue_t hash, void* key, int wr) argument 128 slabhash_remove(struct slabhash* sl, hashvalue_t hash, void* key) argument 166 slabhash_gettable(struct slabhash* sl, hashvalue_t hash) argument [all...] |
H A D | lruhash.h | 2 * util/storage/lruhash.h - hashtable, hash function, LRU keeping. 41 * The hash table keeps a maximum memory size. Old entries are removed 47 * o the idea is to move every thread through the hash lock quickly, 49 * o User performs hash function. 53 * o lookup hash bin. 54 * o lock hash bin. 55 * o find entry (if failed, unlock hash, unl bin, exit). 59 * o unlock hash bin. 72 * o lookup hash bin. 73 * o lock hash bi 218 hashvalue_t hash; member in struct:lruhash_entry [all...] |
/freebsd-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | erase_no_store_hash_fn_imps.hpp | 45 * when the hash value is not stored. 54 size_type hash = ranged_probe_fn_base::operator()(r_key); local 60 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
|
/freebsd-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/hash_fn/ |
H A D | mask_based_range_hashing.hpp | 71 range_hash(size_type hash) const 72 { return size_type(hash & m_mask); }
|
H A D | ranged_probe_fn.hpp | 73 * function, and requests that hash values not be stored. 161 operator()(const_key_reference, size_type hash, size_type i) const argument 163 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i)); 178 * probe function, and requests that hash values not be stored. 267 const size_type hash = hash_fn_base::operator()(r_key); local 268 return std::make_pair(comb_probe_fn_base::operator()(hash), hash); 274 operator()(const_key_reference, size_type hash, size_type i) const argument 276 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i)); 284 (const_key_reference r_key, size_type hash) cons [all...] |
/freebsd-10.2-release/crypto/heimdal/lib/asn1/ |
H A D | hash.h | 35 * hash.h. Header file for hash table functions 50 unsigned (*hash)(void *); /* hash function */ member in struct:hashtab 61 unsigned (*hash)(void *)); /* Make new hash table */ 63 void *hashtabsearch(Hashtab *htab, /* The hash table */ 67 void *hashtabadd(Hashtab *htab, /* The hash table */ 78 unsigned hashadd(const char *s); /* Standard hash function */ 79 unsigned hashcaseadd(const char *s); /* Standard hash functio [all...] |
/freebsd-10.2-release/crypto/heimdal/base/ |
H A D | heimbasepriv.h | 68 heim_type_hash hash; member in struct:heim_type_data 79 heim_type_hash hash);
|
/freebsd-10.2-release/contrib/groff/src/include/ |
H A D | symbol.h | 35 unsigned long hash() const; 61 inline unsigned long symbol::hash() const function in class:symbol
|
H A D | refid.h | 27 unsigned hash() const { return (filename_id << 4) + pos; } function in class:reference_id
|
/freebsd-10.2-release/contrib/apr/tables/ |
H A D | apr_tables.c | 451 int hash; local 456 hash = TABLE_HASH(next_elt->key); 457 t->index_last[hash] = i; 458 if (!TABLE_INDEX_IS_INITIALIZED(t, hash)) { 459 t->index_first[hash] = i; 460 TABLE_SET_INDEX_INITIALIZED(t, hash); 476 int hash; local 482 hash = TABLE_HASH(key); 483 if (!TABLE_INDEX_IS_INITIALIZED(t, hash)) { 487 next_elt = ((apr_table_entry_t *) t->a.elts) + t->index_first[hash];; 507 int hash; local 579 int hash; local 650 int hash; local 704 int hash; local 741 int hash; local 795 int hash; local 815 int hash; local 973 int hash = TABLE_HASH(argp); local [all...] |
/freebsd-10.2-release/usr.bin/mail/ |
H A D | vars.c | 56 h = hash(name); 126 for (vp = variables[hash(name)]; vp != NULL; vp = vp->v_link) 141 for (gh = groups[hash(name)]; gh != NULL; gh = gh->g_link) 168 * the variable or group hash table. 171 hash(const char *name) function
|
/freebsd-10.2-release/contrib/apr/include/ |
H A D | apr_random.h | 40 typedef void apr_crypto_hash_init_t(apr_crypto_hash_t *hash); 41 typedef void apr_crypto_hash_add_t(apr_crypto_hash_t *hash, const void *data, 43 typedef void apr_crypto_hash_finish_t(apr_crypto_hash_t *hash, 69 * @param pool_hash Pool hash functions 70 * @param key_hash Key hash functions 71 * @param prng_hash PRNG hash functions
|
/freebsd-10.2-release/games/fortune/tools/ |
H A D | do_uniq.py | 18 def hash(fortune): function 36 key = hash(fortune) 49 key = hash(fortune)
|
/freebsd-10.2-release/contrib/binutils/gas/ |
H A D | hash.c | 0 /* hash.c -- gas hash table code 23 /* This version of the hash table code is a wholescale replacement of 24 the old hash table code, which was fairly bad. This is based on 25 the hash table code in BFD, but optimized slightly for the 27 are stored in the hash table. Instead, it always stores a pointer. 28 The assembler uses the hash table mostly to store symbols, and we 29 don't need to confuse the symbol structure with a hash table 36 /* An entry in a hash table. */ 39 /* Next entry for this hash cod 45 unsigned long hash; member in struct:hash_entry 157 unsigned long hash; local 230 unsigned long hash; local 260 unsigned long hash; local [all...] |
/freebsd-10.2-release/contrib/gcclibs/libmudflap/ |
H A D | mf-hooks3.c | 94 being the worst possible hash -- all threads hash to zero. */ 113 unsigned long hash = PTHREAD_HASH (self); local 124 rehash = hash; 133 if (rehash == hash) 141 rehash = hash; 157 if (rehash == hash)
|
/freebsd-10.2-release/contrib/netbsd-tests/crypto/opencrypto/ |
H A D | h_gcm.c | 46 const unsigned char hash[16] = { variable 91 if (memcmp(macbuf, hash, sizeof(hash))) 92 errx(1, "hash failed"); 122 if (memcmp(macbuf, hash, sizeof(hash))) 123 errx(1, "hash failed");
|
/freebsd-10.2-release/contrib/gdb/gdb/ |
H A D | minsyms.c | 79 /* Compute a hash code based using the same criteria as `strcmp_iw'. */ 84 unsigned int hash = 0; local 91 hash = hash * 67 + *string - 113; 95 return hash; 98 /* Compute a hash code for a string. */ 103 unsigned int hash = 0; local 105 hash = hash * 67 + *string - 113; 106 return hash; 116 unsigned int hash local 131 unsigned int hash = msymbol_hash_iw (SYMBOL_DEMANGLED_NAME (sym)) % MINIMAL_SYMBOL_HASH_SIZE; local 160 unsigned int hash = msymbol_hash (name) % MINIMAL_SYMBOL_HASH_SIZE; local 277 unsigned int hash = msymbol_hash (name) % MINIMAL_SYMBOL_HASH_SIZE; local 333 unsigned int hash = msymbol_hash (name) % MINIMAL_SYMBOL_HASH_SIZE; local [all...] |
/freebsd-10.2-release/crypto/openssh/ |
H A D | kexc25519c.c | 53 u_char *hash; local 110 &hash, &hashlen 114 if (key_verify(server_host_key, signature, slen, hash, hashlen) != 1) 123 memcpy(kex->session_id, hash, kex->session_id_len); 125 kex_derive_keys(kex, hash, hashlen,
|
H A D | kexc25519s.c | 50 u_char *hash; local 94 &hash, &hashlen 101 memcpy(kex->session_id, hash, kex->session_id_len); 106 hash, hashlen); 122 kex_derive_keys(kex, hash, hashlen,
|
H A D | kexdhc.c | 54 u_char *kbuf, *hash; local 140 &hash, &hashlen 146 if (key_verify(server_host_key, signature, slen, hash, hashlen) != 1) 155 memcpy(kex->session_id, hash, kex->session_id_len); 158 kex_derive_keys_bn(kex, hash, hashlen, shared_secret);
|
H A D | kexdhs.c | 52 u_char *kbuf, *hash, *signature = NULL, *server_host_key_blob = NULL; local 128 &hash, &hashlen 136 memcpy(kex->session_id, hash, kex->session_id_len); 141 hash, hashlen); 157 kex_derive_keys_bn(kex, hash, hashlen, shared_secret);
|
H A D | kexecdhc.c | 58 u_char *kbuf, *hash; local 137 &hash, &hashlen 143 if (key_verify(server_host_key, signature, slen, hash, hashlen) != 1) 152 memcpy(kex->session_id, hash, kex->session_id_len); 155 kex_derive_keys_bn(kex, hash, hashlen, shared_secret);
|