Home
last modified time | relevance | path

Searched full:hash (Results 1 – 25 of 2981) sorted by relevance

12345678910>>...120

/freebsd/cddl/contrib/opensolaris/tools/ctf/cvt/
H A Dhash.c30 * Routines for manipulating hash tables
39 #include "hash.h"
43 struct hash { struct
95 hash_t *hash; in hash_new() local
97 hash = xmalloc(sizeof (hash_t)); in hash_new()
98 hash->h_buckets = xcalloc(sizeof (list_t *) * nbuckets); in hash_new()
99 hash->h_nbuckets = nbuckets; in hash_new()
100 hash->h_hashfn = hashfn ? hashfn : hash_def_hash; in hash_new()
101 hash->h_cmp = cmp ? cmp : hash_def_cmp; in hash_new()
103 return (hash); in hash_new()
[all …]
/freebsd/sys/libkern/
H A Dmurmur3_32.c27 #include <sys/hash.h>
35 * Simple implementation of the Murmur3-32 hash function.
46 uint32_t hash, k; in murmur3_32_hash() local
52 hash = seed; in murmur3_32_hash()
63 hash ^= k; in murmur3_32_hash()
64 hash = rol32(hash, 13); in murmur3_32_hash()
65 hash *= 5; in murmur3_32_hash()
66 hash += 0xe6546b64; in murmur3_32_hash()
83 hash ^= k; in murmur3_32_hash()
89 hash ^= (uint32_t)len; in murmur3_32_hash()
[all …]
/freebsd/crypto/openssl/providers/implementations/rands/
H A Ddrbg_hash.c59 * SP800-90Ar1 10.3.1 Derivation function using a Hash Function (Hash_df).
73 PROV_DRBG_HASH *hash = (PROV_DRBG_HASH *)drbg->data; in hash_df() local
74 EVP_MD_CTX *ctx = hash->ctx; in hash_df()
75 unsigned char *vtmp = hash->vtmp; in hash_df()
100 * (Step 4.1) out = out || Hash(tmp || in || [in2] || [in3]) in hash_df()
103 if (!(EVP_DigestInit_ex(ctx, ossl_prov_digest_md(&hash->digest), NULL) in hash_df()
110 if (outlen < hash->blocklen) { in hash_df()
114 OPENSSL_cleanse(vtmp, hash->blocklen); in hash_df()
120 outlen -= hash->blocklen; in hash_df()
125 out += hash in hash_df()
178 PROV_DRBG_HASH *hash = (PROV_DRBG_HASH *)drbg->data; add_hash_to_v() local
209 PROV_DRBG_HASH *hash = (PROV_DRBG_HASH *)drbg->data; hash_gen() local
253 PROV_DRBG_HASH *hash = (PROV_DRBG_HASH *)drbg->data; drbg_hash_instantiate() local
292 PROV_DRBG_HASH *hash = (PROV_DRBG_HASH *)drbg->data; drbg_hash_reseed() local
327 PROV_DRBG_HASH *hash = (PROV_DRBG_HASH *)drbg->data; drbg_hash_generate() local
364 PROV_DRBG_HASH *hash = (PROV_DRBG_HASH *)drbg->data; drbg_hash_uninstantiate() local
380 PROV_DRBG_HASH *hash = (PROV_DRBG_HASH *)drbg->data; drbg_hash_verify_zeroization() local
390 PROV_DRBG_HASH *hash; drbg_hash_new() local
421 PROV_DRBG_HASH *hash; drbg_hash_free() local
434 PROV_DRBG_HASH *hash = (PROV_DRBG_HASH *)drbg->data; drbg_hash_get_ctx_params() local
462 PROV_DRBG_HASH *hash = (PROV_DRBG_HASH *)ctx->data; drbg_hash_set_ctx_params() local
[all...]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DStableHashing.h
/freebsd/contrib/unbound/util/storage/
H A Dslabhash.h39 * Hash table that consists of smaller hash tables.
52 * Hash table formed from several smaller ones.
64 /** lookup array of hash tables */
69 * Create new slabbed hash table.
70 * @param numtables: number of hash tables to use, other parameters used to
80 * @return: new hash table or NULL on malloc failure.
88 * Delete hash table. Entries are all deleted.
94 * Clear hash table. Entries are all deleted.
103 * @param table: hash tabl
[all...]
H A Dlruhash.h2 * 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
220 hashvalue_type hash; global() member
[all...]
/freebsd/contrib/ntp/libntp/lib/isc/include/isc/
H A Dhash.h18 /* $Id: hash.h,v 1.12 2009/01/17 23:47:43 tbox Exp $ */
27 /*! \file isc/hash.h
29 * \brief The hash API
30 * provides an unpredictable hash value for variable length data.
31 * A hash object contains a random vector (which is hidden from clients
32 * of this API) to make the actual hash value unpredictable.
34 * The algorithm used in the API guarantees the probability of hash
36 * in the random vector are unpredictable, the probability of hash
39 * Although the API is generic about the hash keys, it mainly expects
42 * hash values for large inputs.
[all …]
/freebsd/crypto/libecc/include/libecc/
H A Dmeson.build82 'hash/bash.h',
83 'hash/bash512.h',
84 'hash/sha3-224.h',
85 'hash/ripemd160.h',
86 'hash/sha512-224.h',
87 'hash/sha3-256.h',
88 'hash/bash384.h',
89 'hash/hmac.h',
90 'hash/sm3.h',
91 'hash/streebog256.h',
[all …]
/freebsd/sys/sys/
H A Dhash.h27 * $OpenBSD: hash.h,v 1.4 2004/05/25 18:37:23 jmc Exp $
41 * Return a 32-bit hash of the given buffer. The init
42 * value should be 0, or the previous hash value to extend
43 * the previous hash.
46 hash32_buf(const void *buf, size_t len, uint32_t hash) in hash32_buf() argument
51 hash = HASHSTEP(hash, *p++); in hash32_buf()
53 return hash; in hash32_buf()
57 * Return a 32-bit hash of the given string.
60 hash32_str(const void *buf, uint32_t hash) in hash32_str() argument
65 hash = HASHSTEP(hash, *p++); in hash32_str()
[all …]
/freebsd/share/man/man9/
H A Dhash.926 .\" $OpenBSD: hash.9,v 1.5 2003/04/17 05:08:39 jmc Exp $
32 .Nm hash ,
47 .Fn hash32_buf "const void *buf" "size_t len" "uint32_t hash"
49 .Fn hash32_str "const void *buf" "uint32_t hash"
51 .Fn hash32_strn "const void *buf" "size_t len" "uint32_t hash"
53 .Fn hash32_stre "const void *buf" "int end" "const char **ep" "uint32_t hash"
55 .Fn hash32_strne "const void *buf" "size_t len" "int end" "const char **ep" "uint32_t hash"
57 .Fn jenkins_hash "const void *buf" "size_t len" "uint32_t hash"
59 .Fn jenkins_hash32 "const uint32_t *buf" "size_t count" "uint32_t hash"
61 .Fn murmur3_32_hash "const void *buf" "size_t len" "uint32_t hash"
[all …]
/freebsd/crypto/krb5/src/lib/crypto/builtin/
H A Dhmac.c34 * encryption or keyed hash functions, it is simplest to define it in terms of
45 * where H is a cryptographic hash
53 krb5int_hmac_keyblock(const struct krb5_hash_provider *hash, in krb5int_hmac_keyblock() argument
64 if (keyblock->length > hash->blocksize) in krb5int_hmac_keyblock()
66 if (output->length < hash->hashsize) in krb5int_hmac_keyblock()
69 /* Allocate space for the xor key, hash input vector, and inner hash */ in krb5int_hmac_keyblock()
70 xorkey = k5alloc(hash->blocksize, &ret); in krb5int_hmac_keyblock()
73 ihash = k5alloc(hash->hashsize, &ret); in krb5int_hmac_keyblock()
81 memset(xorkey, 0x36, hash->blocksize); in krb5int_hmac_keyblock()
85 /* Compute the inner hash over the inner key and input data. */ in krb5int_hmac_keyblock()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DCachedHashString.h11 /// owning and not-owning string types that store their hash in addition to
28 /// A container which contains a StringRef plus a precomputed hash.
32 uint32_t Hash; variable
39 CachedHashStringRef(StringRef S, uint32_t Hash) in CachedHashStringRef() argument
40 : P(S.data()), Size(S.size()), Hash(Hash) { in CachedHashStringRef()
47 uint32_t hash() const { return Hash; } in hash() function
58 assert(!isEqual(S, getEmptyKey()) && "Cannot hash the empty key!");
59 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!");
60 return S.hash();
64 return LHS.hash() == RHS.hash() &&
[all …]
/freebsd/sys/contrib/openzfs/module/os/linux/spl/
H A Dspl-tsd.c26 * Thread specific data has implemented using a hash table, this avoids
31 * The majority of the entries in the hash table are for specific tsd
35 * distributed over the hash bins providing neither the pid nor key is zero.
38 * By default the hash table is sized to 512 bins which is expected to
41 * The hash table contains two additional type of entries. They first
42 * type is entry is called a 'key' entry and it is added to the hash during
51 * hash the first time a process set a key. The 'pid' entry is also used
65 #include <linux/hash.h>
93 * tsd_hash_search - searches hash table for tsd_hash_entry
94 * @table: hash table
[all …]
/freebsd/contrib/libucl/klib/
H A Dkhash.h56 However, my implementation is probably not for large hash tables, because
57 the second hash function is closely tied to the first hash function,
78 * Added Wang's integer hash function (not used by default). This hash
123 Generic hash table library.
252 else { /* hash table size to be changed (shrink or expand); rehash */ \
286 __ac_set_isdel_true(h->flags, i); /* mark it as deleted in the old hash table */ \
295 if (h->n_buckets > new_n_buckets) { /* shrink the hash table */ \
310 if (h->n_occupied >= h->upper_bound) { /* update the hash table */ \
315 } else if (kh_resize_##name(h, h->n_buckets + 1) < 0) { /* expand the hash table */ \
368 /* --- BEGIN OF HASH FUNCTIONS --- */
[all …]
/freebsd/crypto/krb5/src/plugins/kdb/db2/libdb2/man/
H A Ddb_hash.337 db_hash \- hash database access method
43 The hash data structure is an extensible, dynamic hashing scheme.
51 The hash access method specific data structure provided to
60 defines the hash table bucket size, and is, by default, 256 bytes.
73 indicates a desired density within the hash table.
75 one bucket, determining when the hash table grows or shrinks.
78 u_int32_t (*hash)(const void *, size_t);
79 .I Hash
80 is a user defined hash function.
81 Since no hash function performs equally well on all possible data, the
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/
H A DHash.cpp1 //===- Hash.cpp - PDB Hash Functions --------------------------------------===//
9 #include "llvm/DebugInfo/PDB/Native/Hash.h"
19 // Used for name hash table and TPI/IPI hashes.
33 // Maximum of 3 bytes left. Hash a 2 byte word if possible, then hash the in hashStringV1()
42 // hash possible odd byte in hashStringV1()
55 // Used for name hash table.
57 uint32_t Hash = 0xb170a1bf; in hashStringV2() local
65 Hash += Item; in hashStringV2()
66 Hash += (Hash << 10); in hashStringV2()
67 Hash ^= (Hash >> 6); in hashStringV2()
[all …]
/freebsd/sys/netinet/
H A Din_rss.c52 /* for software rss hash support */
58 * Hash an IPv4 2-tuple.
75 * Hash an IPv4 4-tuple.
102 * The protocol code may wish to do a software hash of the given
103 * tuple. This depends upon the currently configured RSS hash types.
115 uint32_t hash; in rss_proto_software_hash_v4() local
118 * Next, choose the hash type depending upon the protocol in rss_proto_software_hash_v4()
123 hash = rss_hash_ip4_4tuple(s, sp, d, dp); in rss_proto_software_hash_v4()
124 *hashval = hash; in rss_proto_software_hash_v4()
129 hash = rss_hash_ip4_4tuple(s, sp, d, dp); in rss_proto_software_hash_v4()
[all …]
/freebsd/contrib/bearssl/inc/
H A Dbearssl_rsa.h124 * - When verifying PKCS#1 v1.5 signatures, both variants of the hash
241 * - The encoded OID for the hash function. The provided array must begin
244 * also be `NULL`, in which case the raw hash value should be used
246 * to TLS-1.1, with a 36-byte hash value).
248 * - The hash output length, in bytes.
252 * - An output buffer for the hash value. The caller must still compare
253 * it with the hash of the data over which the signature is computed.
257 * - Hash length MUST be no more than 64 bytes.
273 * \param hash_oid encoded hash algorithm OID (or `NULL`).
274 * \param hash_len expected hash value length (in bytes).
[all …]
/freebsd/lib/libc/stdlib/
H A Dhsearch_r.c36 * Look up an unused entry in the hash table for a given hash. For this
41 hsearch_lookup_free(struct __hsearch *hsearch, size_t hash) in hsearch_lookup_free() argument
45 for (index = hash, i = 0;; index += ++i) { in hsearch_lookup_free()
53 * Computes an FNV-1a hash of the key. Depending on the pointer size, this
59 size_t hash; in hsearch_hash() local
61 hash = offset_basis; in hsearch_hash()
63 hash ^= (uint8_t)*str++; in hsearch_hash()
65 hash *= UINT32_C(16777619); in hsearch_hash()
67 hash *= UINT64_C(1099511628211); in hsearch_hash()
69 return (hash); in hsearch_hash()
[all …]
/freebsd/contrib/unbound/validator/
H A Dval_secalgo.h48 /** Return size of nsec3 hash algorithm, 0 if not supported */
52 * Hash a single hash call of an NSEC3 hash algorithm.
54 * @param algo: nsec3 hash algorithm.
64 * Calculate the sha256 hash for the data buffer into the result.
72 * Start a hash of type sha384. Allocates structure, then inits it,
74 * @return hash structure. NULL on malloc failure or no support.
79 * Start a hash of type sha512. Allocates structure, then inits it,
81 * @return hash structure. NULL on malloc failure or no support.
86 * Update a hash with more information to add to it.
87 * @param hash: the hash that is updated.
[all …]
/freebsd/sys/dev/qat/qat_api/common/crypto/sym/include/
H A Dlac_sym_qat_hash.h8 * @defgroup LacSymQatHash Hash QAT
12 * interfaces for populating qat structures for a hash operation
42 * hash precomputes
45 * This structure contains information on the hash precomputes
62 * hash state prefix buffer info
65 * This structure contains information on the hash state prefix aad buffer
70 /**< Physical pointer to the hash state prefix buffer */
72 /**< Virtual pointer to the hash state prefix buffer */
74 /**< hash state storage size in quad words */
82 * Init the hash specific part of the content descriptor.
[all …]
/freebsd/sys/netinet6/
H A Din6_rss.c52 /* for software rss hash support */
59 * Hash an IPv6 2-tuple.
76 * Hash an IPv6 4-tuple.
103 * The protocol code may wish to do a software hash of the given
104 * tuple. This depends upon the currently configured RSS hash types.
116 uint32_t hash; in rss_proto_software_hash_v6() local
119 * Next, choose the hash type depending upon the protocol in rss_proto_software_hash_v6()
124 hash = rss_hash_ip6_4tuple(s, sp, d, dp); in rss_proto_software_hash_v6()
125 *hashval = hash; in rss_proto_software_hash_v6()
130 hash = rss_hash_ip6_4tuple(s, sp, d, dp); in rss_proto_software_hash_v6()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/
H A DTypeHashing.h28 /// A locally hashed type represents a straightforward hash code of a serialized
35 hash_code Hash; member
38 /// Given a type, compute its local hash.
63 SHA1 = 0, // standard 20-byte SHA1 hash
64 SHA1_8, // last 8-bytes of standard SHA1 hash
68 /// A globally hashed type represents a hash value that is sufficient to
71 /// TypeIndex that refers to B with a previously-computed global hash for B. As
72 /// this is a recursive algorithm (e.g. the global hash of B also depends on the
73 /// global hashes of the types that B refers to), a global hash can uniquely
75 /// different graph structure. Although the hash itsel
88 std::array<uint8_t, 8> Hash; global() member
[all...]
/freebsd/crypto/openssl/doc/man3/
H A DOPENSSL_LH_COMPFUNC.pod17 - dynamic hash table
27 LHASH_OF(TYPE) *lh_TYPE_new(OPENSSL_LH_HASHFUNC hash, OPENSSL_LH_COMPFUNC compare);
71 This library implements type-checked dynamic hash tables. The hash
77 arbitrary data entries, and specifies the 'hash' and 'compare'
78 callbacks to be used in organising the table's entries. The I<hash>
80 an unsigned long hash value for its key field. The hash value is
81 normally truncated to a power of 2, so make sure that your hash
83 takes two arguments (pointers to two hash table entries), and returns
86 If your hash table
87 will contain items of some particular type and the I<hash> and
[all …]
/freebsd/crypto/krb5/src/lib/crypto/krb/
H A Denc_rc4.c40 const struct krb5_hash_provider *hash, in usage_key() argument
64 return krb5int_hmac_keyblock(hash, session_keyblock, &iov, 1, &out_data); in usage_key()
70 const struct krb5_hash_provider *hash, in enc_key() argument
89 ret = krb5int_hmac_keyblock(hash, trunc_keyblock, &iov, 1, &out_data); in enc_key()
100 return ktp->hash->hashsize + CONFOUNDERLENGTH; in krb5int_arcfour_crypto_length()
105 return ktp->hash->hashsize; in krb5int_arcfour_crypto_length()
136 const struct krb5_hash_provider *hash = ktp->hash; in krb5int_arcfour_encrypt() local
152 header->data.length < hash->hashsize + CONFOUNDERLENGTH) in krb5int_arcfour_encrypt()
178 ret = usage_key(enc, hash, &key->keyblock, usage, usage_keyblock); in krb5int_arcfour_encrypt()
183 header->data.length = hash->hashsize + CONFOUNDERLENGTH; in krb5int_arcfour_encrypt()
[all …]

12345678910>>...120