Searched refs:hash (Results 276 - 300 of 798) sorted by relevance

<<11121314151617181920>>

/freebsd-current/contrib/libucl/src/
H A Ducl_hash.c39 void *hash; member in struct:ucl_hash_struct
254 new->hash = h;
268 /* Iterate over the hash first */
270 hashlin->hash;
287 hashlin->hash;
292 hashlin->hash;
314 hashlin->hash;
325 hashlin->hash;
354 hashlin->hash;
368 hashlin->hash;
[all...]
/freebsd-current/sys/netpfil/ipfw/
H A Dip_fw_table_algo.c280 * Dumps options like items size/hash size, etc.
899 * addr:hash cmds
1064 uint16_t hash, hsize; local
1075 hash = hash_ip(a, hsize);
1076 SLIST_FOREACH(ent, &head[hash], next) {
1090 hash = hash_ip6_slow(&addr6, key, imask, hsize);
1091 SLIST_FOREACH(ent, &head[hash], next) {
1109 uint16_t hash, hsize; local
1120 hash = hash_ip(a, hsize);
1121 SLIST_FOREACH(ent, &head[hash], nex
1158 uint16_t hash, hsize; local
1401 uint32_t hash; local
1468 uint32_t hash; local
1565 uint32_t hash, value; local
1650 uint32_t hash; local
3179 uint32_t hash; local
3199 uint16_t hash; local
3432 uint32_t hash; local
3521 uint32_t hash, value; local
3593 uint32_t hash; local
[all...]
/freebsd-current/contrib/wpa/src/tls/
H A Dtlsv1_client_read.c285 u8 hash[32]; local
304 if (sha256_vector(1, addr, len, hash) == 0) {
305 ev.peer_cert.hash = hash;
306 ev.peer_cert.hash_len = sizeof(hash);
510 u8 hash[SHA256_MAC_LEN]; local
514 "TLSv1: Validate server certificate hash");
518 hash) < 0 ||
519 os_memcmp(conn->cred->srv_cert_hash, hash,
522 "TLSv1: Server certificate hash mismatc
735 u8 hash[64]; local
1325 u8 hash[MD5_MAC_LEN + SHA1_MAC_LEN]; local
[all...]
/freebsd-current/crypto/openssh/
H A Dumac.c288 /* The NH-based hash functions used in UMAC are described in the UMAC paper
292 * in a single buffer and returns the hash result immediately. The second
296 * hash, the client calls nh_final() which calculates the hash output.
297 * Before beginning another hash calculation the nh_reset() routine
302 * responsibility to pass no more than L1_KEY_LEN bytes per hash result.
314 #define STREAMS (UMAC_OUTPUT_LEN / 4) /* Number of times hash is applied */
333 /* NH hashing primitive. Previous (partial) hash result is loaded and
369 * reading and writing 16 bytes of hash-state per call.
416 * reading and writing 24 bytes of hash
777 nh_ctx hash; /* Hash context for L1 NH hash */ member in struct:uhash_ctx
1185 uhash_ctx hash; /* Hash function for message compression */ member in struct:umac_ctx
[all...]
/freebsd-current/sys/fs/ext2fs/
H A Dext2_extattr.c766 uint32_t size, uint32_t hash)
783 entry->e_hash = htole32(hash);
1011 uint32_t hash = 0; local
1016 hash = (hash << EXT2_EXTATTR_NAME_HASH_SHIFT) ^
1017 (hash >> (8*sizeof(hash) - EXT2_EXTATTR_NAME_HASH_SHIFT)) ^
1026 hash = (hash << EXT2_EXTATTR_VALUE_HASH_SHIFT) ^
1027 (hash >> (
765 allocate_entry(const char *name, int attrnamespace, uint16_t offs, uint32_t size, uint32_t hash) argument
1040 uint32_t hash = 0; local
[all...]
/freebsd-current/sys/kern/
H A Dvfs_cache.c101 * Entries are described by "struct namecache" objects and stored in a hash
114 * protect hash buckets and vnode lists.
355 CK_SLIST_ENTRY(namecache) nc_hash;/* hash chain */
520 #define NCHHASH(hash) \
521 (&nchashtbl[(hash) & nchash])
523 static u_long __read_mostly nchash; /* size of hash table */
525 "Size of namecache hash table");
564 #define HASH2BUCKETLOCK(hash) \
565 ((struct mtx *)(&bucketlocks[((hash) & ncbuckethash)]))
878 * TODO: With the value stored we can do better than computing the hash base
903 cache_get_hash_iter(char c, uint32_t hash) argument
910 cache_get_hash_iter_finish(uint32_t hash) argument
919 uint32_t hash; local
928 uint32_t hash; local
1355 cache_neg_promote_cond(struct vnode *dvp, struct componentname *cnp, struct namecache *oncp, uint32_t hash) argument
1519 uint32_t hash; local
1730 cache_zap_unlocked_bucket(struct namecache *ncp, struct componentname *cnp, struct vnode *dvp, struct mtx *dvlp, struct mtx *vlp, uint32_t hash, struct mtx *blp) argument
1772 cache_zap_locked_bucket(struct namecache *ncp, struct componentname *cnp, uint32_t hash, struct mtx *blp) argument
1802 uint32_t hash; local
2042 uint32_t hash; local
2118 uint32_t hash; local
2348 cache_enter_lock(struct celockstate *cel, struct vnode *dvp, struct vnode *vp, uint32_t hash) argument
2391 cache_enter_lock_dd(struct celockstate *cel, struct vnode *dvp, struct vnode *vp, uint32_t hash) argument
2441 uint32_t hash; local
2474 uint32_t hash; local
2862 uint32_t hash; local
3079 uint32_t hash; local
4176 uint32_t hash; member in struct:cache_fpl
4527 cache_fplookup_negative_promote(struct cache_fpl *fpl, struct namecache *oncp, uint32_t hash) argument
5326 cache_fplookup_neg(struct cache_fpl *fpl, struct namecache *ncp, uint32_t hash) argument
5504 uint32_t hash; local
5781 uint32_t hash; local
[all...]
/freebsd-current/contrib/wpa/src/common/
H A Dwpa_common.c195 u8 hash[SHA512_MAC_LEN]; local
211 if (hmac_sha1(key, key_len, buf, len, hash))
213 os_memcpy(mic, hash, MD5_MAC_LEN);
237 if (hmac_sha256(key, key_len, buf, len, hash))
239 os_memcpy(mic, hash, MD5_MAC_LEN);
246 if (hmac_sha384(key, key_len, buf, len, hash))
248 os_memcpy(mic, hash, 24);
257 if (hmac_sha256(key, key_len, buf, len, hash))
260 if (hmac_sha384(key, key_len, buf, len, hash))
263 if (hmac_sha512(key, key_len, buf, len, hash))
571 u8 hash[SHA384_MAC_LEN]; local
906 u8 hash[SHA384_MAC_LEN]; local
1346 u8 hash[SHA384_MAC_LEN]; local
1416 pasn_auth_frame_hash(int akmp, int cipher, const u8 *data, size_t len, u8 *hash) argument
1862 u8 *pos, r0_key_data[64], hash[48]; local
1956 u8 hash[48]; local
2046 u8 *pos, hash[32]; local
2200 unsigned char hash[SHA384_MAC_LEN]; local
2243 unsigned char hash[SHA256_MAC_LEN]; local
2276 unsigned char hash[SHA384_MAC_LEN]; local
2953 fils_domain_name_hash(const char *domain, u8 *hash) argument
[all...]
/freebsd-current/contrib/wpa/src/radius/
H A Dradius.c526 u8 hash[MD5_MAC_LEN]; local
537 md5_vector(4, addr, len, hash);
538 return os_memcmp_const(msg->hdr->authenticator, hash, MD5_MAC_LEN) != 0;
549 u8 hash[MD5_MAC_LEN]; local
565 md5_vector(4, addr, len, hash);
566 if (os_memcmp_const(msg->hdr->authenticator, hash, MD5_MAC_LEN) != 0)
854 u8 hash[MD5_MAC_LEN]; local
876 if (md5_vector(4, addr, len, hash) < 0 ||
877 os_memcmp_const(hash, msg->hdr->authenticator, MD5_MAC_LEN) != 0) {
988 u8 hash[MD5_MAC_LE local
1065 u8 hash[MD5_MAC_LEN], saltbuf[2], *pos; local
1296 u8 hash[16]; local
1565 u8 hash[16]; local
[all...]
/freebsd-current/contrib/ncurses/ncurses/tty/
H A Dhashmap.c50 sped up by hashing. If a line hash is unique in both screens, those
54 We don't worry about false pairs produced by hash collisions, on the
123 hash(SCREEN *sp, NCURSES_CH_T *text) function
308 /* re-hash only changed lines */
311 newhash(SP_PARM)[i] = hash(SP_PARM, NEWTEXT(SP_PARM, i));
314 /* re-hash all */
324 newhash(SP_PARM)[i] = hash(SP_PARM, NEWTEXT(SP_PARM, i));
325 oldhash(SP_PARM)[i] = hash(SP_PARM, OLDTEXT(SP_PARM, i));
331 if (newhash(SP_PARM)[i] != hash(SP_PARM, NEWTEXT(SP_PARM, i)))
333 if (oldhash(SP_PARM)[i] != hash(SP_PAR
[all...]
/freebsd-current/crypto/openssl/ssl/
H A Dt1_enc.c472 const EVP_MD *hash; local
481 if (!ssl_cipher_get_evp(s->ctx, s->session, &c, &hash, &mac_type,
491 s->s3.tmp.new_hash = hash;
556 unsigned char hash[EVP_MAX_MD_SIZE]; local
567 if (!ssl_handshake_hash(s, hash, sizeof(hash), &hashlen)) {
572 if (!tls1_PRF(s, str, slen, hash, hashlen, NULL, 0, NULL, 0, NULL, 0,
578 OPENSSL_cleanse(hash, hashlen);
586 unsigned char hash[EVP_MAX_MD_SIZE * 2]; local
594 || !ssl_handshake_hash(s, hash, sizeo
[all...]
/freebsd-current/sys/dev/mlx5/mlx5_core/
H A Dmlx5_eswitch.c57 /* E-Switch UC L2 table hash node */
64 /* E-Switch MC FDB table hash node */
71 /* Vport UC/MC hash node */
347 struct hlist_head *hash = esw->l2_table.l2_hash; local
353 esw_uc = l2addr_hash_find(hash, mac, struct esw_uc_addr);
361 esw_uc = l2addr_hash_add(hash, mac, struct esw_uc_addr, GFP_KERNEL);
383 struct hlist_head *hash = esw->l2_table.l2_hash; local
388 esw_uc = l2addr_hash_find(hash, mac, struct esw_uc_addr);
408 struct hlist_head *hash = esw->mc_table; local
416 esw_mc = l2addr_hash_find(hash, ma
439 struct hlist_head *hash = esw->mc_table; local
480 struct hlist_head *hash; local
514 struct hlist_head *hash; local
[all...]
/freebsd-current/contrib/wpa/src/crypto/
H A Dms_funcs.c84 u8 hash[SHA1_MAC_LEN]; local
95 if (sha1_vector(3, addr, len, hash))
97 os_memcpy(challenge, hash, 8);
335 u8 hash[SHA1_MAC_LEN]; local
341 if (sha1_vector(3, addr, len, hash))
343 os_memcpy(master_key, hash, 16);
/freebsd-current/contrib/wpa/src/wps/
H A Dwps_attr_build.c161 u8 hash[SHA256_MAC_LEN]; local
179 hash) < 0)
185 wpabuf_put_data(msg, hash, WPS_AUTHENTICATOR_LEN);
379 u8 hash[SHA256_MAC_LEN]; local
383 wpabuf_len(msg), hash) < 0)
388 wpabuf_put_data(msg, hash, WPS_KWA_LEN);
441 wpa_printf(MSG_INFO, "WPS: Testing - corrupt public key hash");
H A Dwps_enrollee.c37 u8 *hash; local
56 hash = wpabuf_put(msg, SHA256_MAC_LEN);
66 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 4, addr, len, hash);
67 wpa_hexdump(MSG_DEBUG, "WPS: E-Hash1", hash, SHA256_MAC_LEN);
72 hash = wpabuf_put(msg, SHA256_MAC_LEN);
76 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 4, addr, len, hash);
77 wpa_hexdump(MSG_DEBUG, "WPS: E-Hash2", hash, SHA256_MAC_LEN);
567 u8 hash[WPS_HASH_LEN]; local
568 sha256_vector(1, &pk, &pk_len, hash);
569 if (os_memcmp_const(hash, wp
626 u8 hash[SHA256_MAC_LEN]; local
666 u8 hash[SHA256_MAC_LEN]; local
[all...]
/freebsd-current/contrib/llvm-project/compiler-rt/lib/builtins/
H A Datomic.c116 intptr_t hash = (intptr_t)ptr; local
118 // same memory operation to hash to the same value and therefore use the same
120 hash >>= 4;
121 // Use the next bits as the basis for the hash
122 intptr_t low = hash & SPINLOCK_MASK;
123 // Now use the high(er) set of bits to perturb the hash, so that we don't
125 hash >>= 16;
126 hash ^= low;
128 return locks + (hash & SPINLOCK_MASK);
/freebsd-current/sys/geom/mirror/
H A Dg_mirror.h260 u_char md_hash[16]; /* MD5 hash. */
450 char hash[16 * 2 + 1]; local
493 bzero(hash, sizeof(hash));
495 hash[i * 2] = hex[md->md_hash[i] >> 4];
496 hash[i * 2 + 1] = hex[md->md_hash[i] & 0x0f];
498 printf(" MD5 hash: %s\n", hash);
/freebsd-current/sys/geom/raid3/
H A Dg_raid3.h269 u_char md_hash[16]; /* MD5 hash. */
411 char hash[16 * 2 + 1]; local
453 bzero(hash, sizeof(hash));
455 hash[i * 2] = hex[md->md_hash[i] >> 4];
456 hash[i * 2 + 1] = hex[md->md_hash[i] & 0x0f];
458 printf(" MD5 hash: %s\n", hash);
/freebsd-current/contrib/libdiff/lib/
H A Ddiff_patience.c212 /* Sort by the simplistic hash */
213 if (a->hash < b->hash)
215 if (a->hash > b->hash)
294 * only using the cheap hash as indicator for differing atoms;
299 if (a->hash != b->hash)
/freebsd-current/contrib/elftoolchain/elfcopy/
H A Dsymbols.c66 hash_head hash[STHASHSIZE]; member in struct:strimpl
84 static int lookup_exact_string(hash_head *hash, const char *buf,
774 LIST_FOREACH_SAFE(sh, &st_buf->l.hash[i], sh_next,
779 LIST_FOREACH_SAFE(sh, &st_buf->g.hash[i], sh_next,
880 uint32_t hash; local
922 pos = lookup_exact_string(st_buf->B.hash, st_buf->B.buf,\
941 hash = str_hash(name); \
942 LIST_INSERT_HEAD(&st_buf->B.hash[hash], sh, \
1195 uint32_t hash; local
1207 uint32_t hash; local
[all...]
/freebsd-current/contrib/wpa/src/ap/
H A Dpmksa_cache_auth.c55 unsigned int hash; local
60 /* unlink from hash list */
61 hash = PMKID_HASH(entry->pmkid);
62 pos = pmksa->pmkid[hash];
69 pmksa->pmkid[hash] = entry->hnext;
226 int hash; local
245 hash = PMKID_HASH(entry->pmkid);
246 entry->hnext = pmksa->pmkid[hash];
247 pmksa->pmkid[hash] = entry;
/freebsd-current/sys/contrib/openzfs/module/zstd/lib/common/
H A Dxxhash.h36 Q.Score is a measure of quality of the hash function.
148 Calculate the 32-bits hash of sequence "length" bytes stored at memory address "input".
153 Calculate the 64-bits hash of sequence of length "len" stored at memory address "input".
174 /* hash streaming */
191 Start a new hash by initializing state with a seed, using XXH*_reset().
193 Then, feed the hash state by calling XXH*_update() as many times as necessary.
197 Finally, a hash value can be produced anytime, by using XXH*_digest().
198 This function returns the nn-bits hash as an int or long long.
200 It's still possible to continue inserting input into the hash state after a digest,
223 * These functions allow transformation of hash resul
[all...]
/freebsd-current/crypto/openssl/util/perl/OpenSSL/
H A DTemplate.pm61 my %hash = ( %{$opts{HASH}} );
68 %hash },
/freebsd-current/contrib/llvm-project/libcxx/include/__system_error/
H A Derror_code.h15 #include <__functional/hash.h>
135 struct _LIBCPP_TEMPLATE_VIS hash<error_code> : public __unary_function<error_code, size_t> { struct in inherits:__unary_function
H A Derror_condition.h15 #include <__functional/hash.h>
122 struct _LIBCPP_TEMPLATE_VIS hash<error_condition> : public __unary_function<error_condition, size_t> { struct in inherits:__unary_function
/freebsd-current/contrib/libdiff/include/
H A Ddiff_main.h35 /* This hash is just a very cheap speed up for finding *mismatching*
39 unsigned int hash; member in struct:diff_atom
42 /* Mix another atom_byte into the provided hash value and return the result.
43 * The hash value passed in for the first byte of the atom must be zero. */
45 diff_atom_hash_update(unsigned int hash, unsigned char atom_byte);

Completed in 428 milliseconds

<<11121314151617181920>>