Searched refs:hash (Results 76 - 100 of 781) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/groff/src/include/
H A Drefid.h27 unsigned hash() const { return (filename_id << 4) + pos; } function in class:reference_id
/freebsd-11-stable/sys/opencrypto/
H A Dgmac.h44 struct gf128 hash; member in struct:aes_gmac_ctx
/freebsd-11-stable/usr.bin/mail/
H A Dvars.c56 h = hash(name);
127 for (vp = variables[hash(name)]; vp != NULL; vp = vp->v_link)
142 for (gh = groups[hash(name)]; gh != NULL; gh = gh->g_link)
169 * the variable or group hash table.
172 hash(const char *name) function
/freebsd-11-stable/contrib/apr/tables/
H A Dapr_tables.c451 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...]
H A Dapr_hash.c37 * The internal form of a hash table.
39 * The table is an array indexed by the hash of the key; collisions
40 * are resolved by hanging a linked list of hash entries off each
49 unsigned int hash; member in struct:apr_hash_entry_t
56 * Data structure for iterating through a hash table.
58 * We keep a pointer to the next hash entry here to allow the current
59 * hash entry to be freed or otherwise mangled between calls to
72 * The count of hash entries may be greater depending on the chosen
190 * Expanding a hash table
202 unsigned int i = hi->this->hash
210 hashfunc_default(const char *char_key, apr_ssize_t *klen, unsigned int hash) argument
291 unsigned int hash; local
436 unsigned int i, j, k, hash; local
[all...]
/freebsd-11-stable/contrib/apr/include/
H A Dapr_random.h40 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-11-stable/usr.bin/fortune/tools/
H A Ddo_uniq.py20 def hash(fortune): function
40 key = hash(fortune)
53 key = hash(fortune)
/freebsd-11-stable/crypto/openssh/
H A Dkexdh.c55 u_char *hash, size_t *hashlen)
83 if (ssh_digest_buffer(hash_alg, b, hash, *hashlen) != 0) {
90 dump_digest("hash", hash, *hashlen);
45 kex_dh_hash( int hash_alg, const char *client_version_string, const char *server_version_string, const u_char *ckexinit, size_t ckexinitlen, const u_char *skexinit, size_t skexinitlen, const u_char *serverhostkeyblob, size_t sbloblen, const BIGNUM *client_dh_pub, const BIGNUM *server_dh_pub, const BIGNUM *shared_secret, u_char *hash, size_t *hashlen) argument
H A Dkexecdh.c61 u_char *hash, size_t *hashlen)
89 if (ssh_digest_buffer(hash_alg, b, hash, *hashlen) != 0) {
96 dump_digest("hash", hash, *hashlen);
50 kex_ecdh_hash( int hash_alg, const EC_GROUP *ec_group, const char *client_version_string, const char *server_version_string, const u_char *ckexinit, size_t ckexinitlen, const u_char *skexinit, size_t skexinitlen, const u_char *serverhostkeyblob, size_t sbloblen, const EC_POINT *client_dh_pub, const EC_POINT *server_dh_pub, const BIGNUM *shared_secret, u_char *hash, size_t *hashlen) argument
/freebsd-11-stable/contrib/wpa/src/utils/
H A Duuid.c78 u8 hash[SHA256_MAC_LEN]; local
84 hmac_sha256(uuid, UUID_LEN, (const u8 *) &t, sizeof(t), hash) < 0)
87 os_memcpy(uuid, hash, UUID_LEN);
/freebsd-11-stable/contrib/binutils/gas/
H A Dhash.c0 /* 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-11-stable/contrib/netbsd-tests/crypto/opencrypto/
H A Dh_gcm.c46 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-11-stable/contrib/gcclibs/libmudflap/
H A Dmf-hooks3.c94 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-11-stable/contrib/gdb/gdb/
H A Dminsyms.c79 /* 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-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/hash_fn/
H A Dranged_probe_fn.hpp73 * 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-11-stable/contrib/binutils/opcodes/
H A Dcgen-asm.c54 /* Subroutine of build_asm_hash_table to add INSNS to the hash table.
59 HTABLE points to the hash table.
60 HENTBUF is a pointer to sufficiently large buffer of hash entries.
78 unsigned int hash; local
83 hash = (* cd->asm_hash) (CGEN_INSN_MNEMONIC (insn));
84 hentbuf->next = htable[hash];
86 htable[hash] = hentbuf;
92 /* Subroutine of build_asm_hash_table to add INSNS to the hash table.
106 unsigned int hash; local
110 hash
179 unsigned int hash; local
[all...]
/freebsd-11-stable/usr.sbin/certctl/
H A Dcertctl.sh47 local hash
49 if hash=$( openssl x509 -noout -subject_hash -in "$1" ); then
50 echo "$hash"
61 local checkdir hash decimal
64 hash=$2
67 while [ -e "$checkdir/$hash.$decimal" ]; do
77 local blisthash certhash hash
80 hash=$( do_hash "$1" ) || return
82 for blistfile in $(find $BLACKLISTDESTDIR -name "$hash.*"); do
89 suffix=$(get_decimal "$CERTDESTDIR" "$hash")
[all...]
/freebsd-11-stable/sys/dev/drm2/
H A Ddrm_auth.c49 * Searches in drm_device::magiclist within all files with the same hash key
57 struct drm_hash_item *hash; local
61 if (!drm_ht_find_item(&master->magiclist, (unsigned long)magic, &hash)) {
62 pt = drm_hash_entry(hash, struct drm_magic_entry, hash_item);
77 * associated the magic number hash key in drm_device::magiclist, while holding
107 * number hash key, while holding the drm_device::struct_mutex lock.
112 struct drm_hash_item *hash; local
118 if (drm_ht_find_item(&master->magiclist, (unsigned long)magic, &hash)) {
122 pt = drm_hash_entry(hash, struct drm_magic_entry, hash_item);
123 drm_ht_remove_item(&master->magiclist, hash);
[all...]
/freebsd-11-stable/contrib/gcclibs/libcpp/
H A Dsymtab.c27 hash tables (see libiberty/hashtab.c). The abstraction penalty was
29 intrinsically how to calculate a hash value, and how to compare an
37 /* Calculate the hash of the string STR of length LEN. */
74 /* Frees all memory associated with a hash table. */
85 /* Returns the hash entry for the a STR of length LEN. If that string
103 size_t len, unsigned int hash,
112 index = hash & sizemask;
119 if (node->hash_value == hash
132 hash2 = ((hash * 17) & sizemask) | 1;
142 if (node->hash_value == hash
102 ht_lookup_with_hash(hash_table *table, const unsigned char *str, size_t len, unsigned int hash, enum ht_lookup_option insert) argument
193 unsigned int index, hash, hash2; local
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/
H A Dconfig_auth.c74 svn_config_read_auth_data(apr_hash_t **hash,
83 *hash = NULL;
99 *hash = apr_hash_make(pool);
101 SVN_ERR_W(svn_hash_read2(*hash, stream, SVN_HASH_TERMINATOR, pool),
105 stored_realm = svn_hash_gets(*hash, SVN_CONFIG_REALMSTRING_KEY);
108 *hash = NULL; /* Hash collision, or somebody tampering with storage */
118 svn_config_write_auth_data(apr_hash_t *hash,
133 /* Add the realmstring to the hash, so programs (or users) can
135 ### What if realmstring key is already in the hash? */
136 svn_hash_sets(hash, SVN_CONFIG_REALMSTRING_KE
73 svn_config_read_auth_data(apr_hash_t **hash, const char *cred_kind, const char *realmstring, const char *config_dir, apr_pool_t *pool) argument
117 svn_config_write_auth_data(apr_hash_t *hash, const char *cred_kind, const char *realmstring, const char *config_dir, apr_pool_t *pool) argument
[all...]
H A Dfnv1a.c46 fnv1a_32(apr_uint32_t hash, const void *input, apr_size_t len) argument
53 hash ^= *data;
54 hash *= FNV1_PRIME_32;
57 return hash;
92 * 32 bit hash value and return that. LEN must be < 4.
149 /* Fold the remainder (if any) into the first hash. */
156 apr_uint32_t hash; member in struct:svn_fnv1a_32__context_t
163 context->hash = FNV1_BASE_32;
171 context->hash = FNV1_BASE_32;
179 context->hash
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_x/
H A Dreps.c34 /* Length of the text chunks we hash and match. The algorithm will find
53 /* value of unused hash buckets */
116 /* Yet another hash data structure. This one tries to be more cache
136 /* number of buckets in this hash, i.e. elements in each array above.
146 /* pool to use when growing the hash */
150 /* Hash key type. 32 bits for pseudo-Adler32 hash sums.
164 /* text block hash */
165 hash_t hash; member in struct:svn_fs_x__reps_builder_t
300 hash_to_index(hash_t *hash, hash_key_t adler32) argument
302 return (adler32 * 0xd1f3da69) >> hash
309 allocate_hash_members(hash_t *hash, apr_size_t size, apr_pool_t *result_pool) argument
331 init_hash(hash_t *hash, apr_size_t twoPower, apr_pool_t *result_pool) argument
345 grow_hash(hash_t *hash, svn_stringbuf_t *text, apr_size_t min_size) argument
[all...]
/freebsd-11-stable/sys/dev/mlx5/mlx5_core/
H A Deswitch.h43 /* L2 -mac address based- hash helpers */
49 #define for_each_l2hash_node(hn, tmp, hash, i) \
51 hlist_for_each_entry_safe(hn, tmp, &hash[i], hlist)
53 #define l2addr_hash_find(hash, mac, type) ({ \
58 hlist_for_each_entry(ptr, &hash[ix], node.hlist) \
68 #define l2addr_hash_add(hash, mac, type, gfp) ({ \
75 hlist_add_head(&ptr->node.hlist, &hash[ix]);\
/freebsd-11-stable/contrib/byacc/
H A Dsymtab.c15 hash(const char *name) function
67 bpp = symbol_table + hash(name);
103 symbol_table[hash("error")] = bp;
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_entry_link_resolver.c47 * This is mostly a pretty straightforward hash table implementation.
75 size_t hash; member in struct:links_entry
265 size_t hash, bucket; local
279 hash = (size_t)(dev ^ ino);
282 bucket = hash & (res->number_buckets - 1);
284 if (le->hash == hash
296 /* Remove it from this hash bucket. */
335 /* Remove it from this hash bucket. */
356 size_t hash, bucke local
[all...]

Completed in 241 milliseconds

1234567891011>>