Searched refs:hash (Results 151 - 175 of 798) sorted by relevance

1234567891011>>

/freebsd-current/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_aggregate.c449 dt_ahash_t *hash = &agp->dtat_hash; local
488 if (hash->dtah_hash == NULL) {
491 hash->dtah_size = DTRACE_AHASHSIZE;
492 size = hash->dtah_size * sizeof (dt_ahashent_t *);
494 if ((hash->dtah_hash = malloc(size)) == NULL)
497 bzero(hash->dtah_hash, size);
558 ndx = hashval % hash->dtah_size;
560 for (h = hash->dtah_hash[ndx]; h != NULL; h = h->dtahe_next) {
697 if (hash->dtah_hash[ndx] != NULL)
698 hash
1210 dt_ahash_t *hash = &agp->dtat_hash; local
1226 dt_ahash_t *hash = &agp->dtat_hash; local
1292 dt_ahash_t *hash = &dtp->dt_aggregate.dtat_hash; local
1316 dt_ahash_t *hash = &agp->dtat_hash; local
1427 dt_ahash_t *hash = &agp->dtat_hash; local
1541 dt_ahash_t *hash = &agp->dtat_hash; local
1686 dt_ahash_t *hash = &agp->dtat_hash; local
2151 dt_ahash_t *hash = &agp->dtat_hash; local
2177 dt_ahash_t *hash = &agp->dtat_hash; local
[all...]
/freebsd-current/sys/dev/mthca/
H A Dmthca_mcg.c54 * If GID is found in MGM or MGM is empty, *index = *hash, *prev = -1
58 * previous entry in hash chain and *mgm holds AMGM entry.
61 * entry in hash chain and *mgm holds end of hash chain.
65 u16 *hash, int *prev, int *index)
79 err = mthca_MGID_HASH(dev, mailbox, hash);
86 mthca_dbg(dev, "Hash for %pI6 is %04x\n", gid, *hash);
88 *index = *hash;
99 if (*index != *hash) {
125 u16 hash; local
63 find_mgm(struct mthca_dev *dev, u8 *gid, struct mthca_mailbox *mgm_mailbox, u16 *hash, int *prev, int *index) argument
219 u16 hash; local
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/Support/
H A Dregex2.h103 * and a mask to pick out the relevant bit of each byte. A hash code
114 uch hash; /* hash code */ member in struct:__anon3847
119 #define CHadd(cs, c) ((cs)->ptr[(uch)(c)] |= (cs)->mask, (cs)->hash += (c))
120 #define CHsub(cs, c) ((cs)->ptr[(uch)(c)] &= ~(cs)->mask, (cs)->hash -= (c))
H A Dxxhash.cpp78 static uint64_t XXH64_avalanche(uint64_t hash) { argument
79 hash ^= hash >> 33;
80 hash *= PRIME64_2;
81 hash ^= hash >> 29;
82 hash *= PRIME64_3;
83 hash ^= hash >> 32;
84 return hash;
202 XXH3_avalanche(uint64_t hash) argument
[all...]
/freebsd-current/contrib/wpa/src/eap_common/
H A Deap_pax_common.c93 u8 hash[SHA1_MAC_LEN]; local
110 if (hmac_sha1_vector(key, key_len, count, addr, len, hash) < 0)
112 os_memcpy(mac, hash, EAP_PAX_MAC_LEN);
/freebsd-current/contrib/unbound/validator/
H A Dval_kcache.c90 slabhash_insert(kcache->slab, k->entry.hash, &k->entry,
116 e = slabhash_lookup(kcache->slab, lookfor.entry.hash, &lookfor, wr);
166 slabhash_remove(kcache->slab, lookfor.entry.hash, &lookfor);
H A Dval_nsec3.h98 /** The SHA1 hash algorithm for NSEC3 */
123 * @param calc: current hash calculations.
127 * UNCHECKED if no more hash calculations are allowed at this point.
161 * @param calc: current hash calculations.
165 * UNCHECKED if no more hash calculations are allowed at this point.
186 * @param calc: current hash calculations.
190 * UNCHECKED if no more hash calculations are allowed at this point.
218 * UNCHECKED if no more hash calculations are allowed at this point.
239 * @param calc: current hash calculations.
243 * UNCHECKED if no more hash calculation
269 uint8_t* hash; member in struct:nsec3_cached_hash
[all...]
/freebsd-current/sys/crypto/via/
H A Dpadlock_hash.c59 * the padding and calculate hash automatically.
76 static void padlock_sha1_final(uint8_t *hash, void *vctx);
77 static void padlock_sha256_final(uint8_t *hash, void *vctx);
204 padlock_sha1_final(uint8_t *hash, void *vctx) argument
209 padlock_do_sha1(ctx->psc_buf, hash, ctx->psc_offset);
214 padlock_sha256_final(uint8_t *hash, void *vctx) argument
219 padlock_do_sha256(ctx->psc_buf, hash, ctx->psc_offset);
273 * Compute keyed-hash authenticator.
278 u_char hash[HASH_MAX_LEN], hash2[HASH_MAX_LEN]; local
298 axf->Final(hash,
[all...]
/freebsd-current/contrib/llvm-project/libcxx/include/__functional/
H A Dhash.h15 #include <__fwd/hash.h>
101 // For strings over 64 bytes we hash the end first, and then as we
193 // Return a 16-byte hash for 48 bytes. Quick and dirty.
206 // Return a 16-byte hash for s[0] ... s[31], a, and b. Quick and dirty.
218 // Return an 8-byte hash for 33 to 64 bytes.
332 struct _LIBCPP_TEMPLATE_VIS hash<_Tp*> : public __unary_function<_Tp*, size_t> { struct in inherits:__unary_function
344 struct _LIBCPP_TEMPLATE_VIS hash<bool> : public __unary_function<bool, size_t> { struct in inherits:__unary_function
349 struct _LIBCPP_TEMPLATE_VIS hash<char> : public __unary_function<char, size_t> { struct in inherits:__unary_function
354 struct _LIBCPP_TEMPLATE_VIS hash<signed char> : public __unary_function<signed char, size_t> { struct in inherits:__unary_function
359 struct _LIBCPP_TEMPLATE_VIS hash<unsigne struct in inherits:__unary_function
365 struct _LIBCPP_TEMPLATE_VIS hash<char8_t> : public __unary_function<char8_t, size_t> { struct in inherits:__unary_function
371 struct _LIBCPP_TEMPLATE_VIS hash<char16_t> : public __unary_function<char16_t, size_t> { struct in inherits:__unary_function
376 struct _LIBCPP_TEMPLATE_VIS hash<char32_t> : public __unary_function<char32_t, size_t> { struct in inherits:__unary_function
382 struct _LIBCPP_TEMPLATE_VIS hash<wchar_t> : public __unary_function<wchar_t, size_t> { struct in inherits:__unary_function
388 struct _LIBCPP_TEMPLATE_VIS hash<short> : public __unary_function<short, size_t> { struct in inherits:__unary_function
393 struct _LIBCPP_TEMPLATE_VIS hash<unsigned short> : public __unary_function<unsigned short, size_t> { struct in inherits:__unary_function
398 struct _LIBCPP_TEMPLATE_VIS hash<int> : public __unary_function<int, size_t> { struct in inherits:__unary_function
403 struct _LIBCPP_TEMPLATE_VIS hash<unsigned int> : public __unary_function<unsigned int, size_t> { struct in inherits:__unary_function
408 struct _LIBCPP_TEMPLATE_VIS hash<long> : public __unary_function<long, size_t> { struct in inherits:__unary_function
413 struct _LIBCPP_TEMPLATE_VIS hash<unsigned long> : public __unary_function<unsigned long, size_t> { struct in inherits:__unary_function
418 struct _LIBCPP_TEMPLATE_VIS hash<long long> : public __scalar_hash<long long> {}; struct in inherits:__scalar_hash
421 struct _LIBCPP_TEMPLATE_VIS hash<unsigned long long> : public __scalar_hash<unsigned long long> {}; struct in inherits:__scalar_hash
426 struct _LIBCPP_TEMPLATE_VIS hash<__int128_t> : public __scalar_hash<__int128_t> {}; struct in inherits:__scalar_hash
429 struct _LIBCPP_TEMPLATE_VIS hash<__uint128_t> : public __scalar_hash<__uint128_t> {}; struct in inherits:__scalar_hash
434 struct _LIBCPP_TEMPLATE_VIS hash<float> : public __scalar_hash<float> { struct in inherits:__scalar_hash
444 struct _LIBCPP_TEMPLATE_VIS hash<double> : public __scalar_hash<double> { struct in inherits:__scalar_hash
454 struct _LIBCPP_TEMPLATE_VIS hash<long double> : public __scalar_hash<long double> { struct in inherits:__scalar_hash
510 struct _LIBCPP_TEMPLATE_VIS hash : public __enum_hash<_Tp> {}; struct in inherits:__enum_hash
515 struct _LIBCPP_TEMPLATE_VIS hash<nullptr_t> : public __unary_function<nullptr_t, size_t> { struct in inherits:__unary_function
[all...]
/freebsd-current/contrib/wpa/src/crypto/
H A Dtls_openssl_ocsp.c402 ASN1_OCTET_STRING *hash; local
408 "OpenSSL: Could not find matching hash algorithm for OCSP");
415 hash = ASN1_OCTET_STRING_new();
416 if (!hash)
418 if (!ASN1_OCTET_STRING_set(hash, md, len)) {
419 ASN1_OCTET_STRING_free(hash);
423 txt = octet_string_str(hash);
430 if (ASN1_OCTET_STRING_cmp(certid->issuerNameHash, hash)) {
431 ASN1_OCTET_STRING_free(hash);
438 !ASN1_OCTET_STRING_set(hash, m
463 unsigned char hash[SHA_DIGEST_LENGTH]; local
[all...]
/freebsd-current/contrib/netbsd-tests/lib/libc/hash/
H A Dt_sha2.c57 const char *hash; member in struct:testvector
186 ATF_CHECK_STREQ(test256[i].hash, output);
213 ATF_CHECK_STREQ(test384[i].hash, output);
240 ATF_CHECK_STREQ(test512[i].hash, output);
/freebsd-current/crypto/heimdal/appl/ftp/ftp/
H A Dglobals.c8 int hash; /* print # for each buffer transferred */ variable
H A Dftp_var.h49 extern int hash; /* print # for each buffer transferred */
/freebsd-current/sys/contrib/xen/io/
H A Dnetif.h230 * A hash calculated over an IP version 4 header as follows:
242 * A hash calculated over an IP version 4 header and TCP header as
257 * A hash calculated over an IP version 6 header as follows:
269 * A hash calculated over an IP version 6 header and TCP header as
291 * Toeplitz hash:
320 uint64_t hash = 0; local
334 hash ^= prefix;
347 /* The valid part of the hash is in the upper 32 bits. */
348 return hash >> 32;
467 * This is sent by the frontend to set the desired hash algorith
1032 } hash; member in union:netif_extra_info::__anon69
[all...]
/freebsd-current/sys/compat/linuxkpi/common/include/linux/
H A Dhash.h32 #include <sys/hash.h>
/freebsd-current/sys/contrib/zstd/lib/compress/
H A Dzstd_ldm.c30 * Initializes the rolling hash state such that it will honor the
43 * In the gear hash algorithm, bit n depends on the last n bytes;
55 /* In this degenerate case we simply honor the hash rate. */
61 * Feeds [data, data + minMatchLength) into the hash without registering any
62 * splits. This effectively resets the hash state. This is used when skipping
68 U64 hash = state->rolling; local
72 hash = (hash << 1) + ZSTD_ldm_gearTab[data[n] & 0xff]; \
101 U64 hash, mask; local
103 hash
172 ZSTD_ldm_getBucket( ldmState_t* ldmState, size_t hash, ldmParams_t const ldmParams) argument
180 ZSTD_ldm_insertEntry(ldmState_t* ldmState, size_t const hash, const ldmEntry_t entry, ldmParams_t const ldmParams) argument
293 U32 const hash = (U32)(xxhash & (((U32)1 << hBits) - 1)); local
371 U32 const hash = (U32)(xxhash & (((U32)1 << hBits) - 1)); local
386 U32 const hash = candidates[n].hash; local
[all...]
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Support/
H A DSHA1.h51 /// Returns a raw 160-bit SHA1 hash for the given data.
52 static std::array<uint8_t, 20> hash(ArrayRef<uint8_t> Data);
H A DSHA256.h58 /// Returns a raw 256-bit SHA256 hash for the given data.
59 static std::array<uint8_t, 32> hash(ArrayRef<uint8_t> Data);
/freebsd-current/sys/contrib/openzfs/tests/zfs-tests/cmd/checksum/
H A Dblake3_test.c49 /* hash value */
50 const char *hash; member in struct:__anon480
52 /* salted hash value */
510 for (i = 0; TestArray[i].hash; i++) {
522 if (memcmp(result, cur->hash, 131) != 0)
526 dprintf("HASH-ref: %s\n", cur->hash);
/freebsd-current/sys/crypto/openssl/
H A Dossl.h52 /* Needs to be big enough to hold any hash context. */
76 struct ossl_session_hash hash; member in struct:ossl_session
/freebsd-current/contrib/unbound/util/
H A Dedns.h119 * Compute the interoperable DNS cookie (RFC9018) hash.
120 * @param in: buffer input for the hash generation. It needs to be:
124 * @param hash: buffer to write the hash to.
125 * return a pointer to the hash.
128 int v4, uint8_t* hash);
133 * as it doubles as the output buffer and the hash input buffer.
140 * the hash input.
141 * The server hash (8 octets) will be written after the first 16 octets;
158 * @param hash_input: pointer to the hash inpu
[all...]
/freebsd-current/sys/geom/eli/
H A Dg_eli_hmac.c94 /* Complete inner hash */
97 /* Complete outer hash */
102 /* mdsize == 0 means "Give me the whole hash!" */
141 u_char hash[SHA256_DIGEST_LENGTH]; local
147 SHA256_Final(hash, &ctx);
148 bcopy(hash, iv, MIN(sizeof(hash), size));
/freebsd-current/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_chained_origin_depot.cpp32 bool eq(hash_type hash, const args_type &args) const;
36 static hash_type hash(const args_type &args);
63 bool ChainedOriginDepotNode::eq(hash_type hash, const args_type &args) const { argument
67 /* This is murmur2 hash for the 64->32 bit case.
73 * (8 bits) Part id = bits 13..20 of the hash value of here_id's key.
80 ChainedOriginDepotNode::hash_type ChainedOriginDepotNode::hash( function in class:__sanitizer::ChainedOriginDepotNode
/freebsd-current/contrib/llvm-project/compiler-rt/lib/asan/
H A Dasan_linux.cpp215 MurMur2Hash64Builder hash(kAsanContextStackFlagsMagic);
216 hash.add(reinterpret_cast<uptr>(ucp.uc_stack.ss_sp));
217 hash.add(ucp.uc_stack.ss_size);
218 return static_cast<int>(hash.get());
/freebsd-current/contrib/xz/src/liblzma/lz/
H A Dlz_encoder.c144 // Rewind read_pos so that the match finder can hash
293 // Calculate the sizes of mf->hash and mf->son.
310 // be used as a hash mask.
347 // Deallocate the old hash array if it exists and has different size
351 lzma_free(mf->hash, allocator);
352 mf->hash = NULL;
410 // Allocate and initialize the hash table. Since EMPTY_HASH_VALUE
411 // is zero, we can use lzma_alloc_zero() or memzero() for mf->hash.
420 if (mf->hash == NULL) {
421 mf->hash
[all...]

Completed in 294 milliseconds

1234567891011>>