/freebsd-11-stable/contrib/unbound/services/cache/ |
H A D | rrset.h | 57 /** uses partitioned hash table */ 100 * @param hash: hash value of the item. Please read it from the key when 105 hashvalue_type hash, rrset_id_type id); 197 * storage as it uses the initial locks to obtain hash values. 199 * @param scratch: region for temporary storage of hash values.
|
/freebsd-11-stable/contrib/libarchive/libarchive/ |
H A D | archive_hmac_private.h | 62 PBYTE hash; member in struct:__anon12
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_stackdepotbase.h | 39 static Node *find(Node *s, args_type args, u32 hash); 62 u32 hash) { 65 if (s->eq(hash, args)) { 101 uptr h = Node::hash(args); 60 find(Node *s, args_type args, u32 hash) argument
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | DWARFDebugInfo.h | 44 DWARFTypeUnit *GetTypeUnitForHash(uint64_t hash);
|
/freebsd-11-stable/crypto/openssl/apps/ |
H A D | passwd.c | 405 char *hash = NULL; local 465 /* now compute password hash */ 468 hash = DES_crypt(passwd, *salt_p); 472 hash = md5crypt(passwd, (use1 ? "1" : "apr1"), *salt_p); 474 assert(hash != NULL); 477 BIO_printf(out, "%s\t%s\n", passwd, hash); 479 BIO_printf(out, "%s\t%s\n", hash, passwd); 481 BIO_printf(out, "%s\n", hash);
|
/freebsd-11-stable/contrib/wpa/src/eap_common/ |
H A D | eap_gpsk_common.c | 44 u8 ibuf[2], hash[16]; local 48 hashlen = sizeof(hash); 60 if (omac1_aes_128_vector(psk, 2, addr, vlen, hash)) 63 os_memcpy(opos, hash, clen); 79 u8 ibuf[2], hash[SHA256_MAC_LEN]; local 95 if (hmac_sha256_vector(psk, 32, 2, addr, vlen, hash)) 98 os_memcpy(opos, hash, clen);
|
/freebsd-11-stable/sys/netinet/ |
H A D | tcp_hostcache.c | 145 "Per-bucket hash limit for hostcache"); 177 /* XXX: What is the recommended hash to get good entropy for IPv6 addresses? */ 206 printf("WARNING: hostcache hash size is not a power of 2.\n"); 222 * Allocate the hash table. 229 * Initialize the hash buckets. 265 /* Free the uma zone and the allocated hash table. */ 283 int hash; local 296 hash = HOSTCACHE_HASH6(&inc->inc6_faddr); 298 hash = HOSTCACHE_HASH(&inc->inc_faddr); 300 hc_head = &V_tcp_hostcache.hashbase[hash]; 342 int hash; local [all...] |
/freebsd-11-stable/crypto/heimdal/base/ |
H A D | heimbase.c | 184 * Get hash value of object 186 * @param object object to get hash value for 188 * @return a hash value 195 if (isa->hash) 196 return isa->hash(ptr); 273 heim_type_hash hash) 287 type->hash = hash; 268 _heim_create_type(const char *name, heim_type_init init, heim_type_dealloc dealloc, heim_type_copy copy, heim_type_cmp cmp, heim_type_hash hash) argument
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/ |
H A D | ConstString.cpp | 54 const uint8_t h = hash(llvm::StringRef(ccstr)); 75 const uint8_t h = hash(string_ref); 100 const uint8_t h = hash(demangled); 116 const uint8_t h = hash(llvm::StringRef(mangled_ccstr)); 147 uint8_t hash(const llvm::StringRef &s) const { function in class:Pool
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | properties.c | 259 reference the same memory as the base/target_props hash. */ 379 svn_prop_hash_to_array(const apr_hash_t *hash, 384 apr_hash_count((apr_hash_t *)hash), 387 for (hi = apr_hash_first(pool, (apr_hash_t *)hash); hi; 404 svn_prop_hash_dup(const apr_hash_t *hash, 410 for (hi = apr_hash_first(pool, (apr_hash_t *)hash); hi; 378 svn_prop_hash_to_array(const apr_hash_t *hash, apr_pool_t *pool) argument 403 svn_prop_hash_dup(const apr_hash_t *hash, apr_pool_t *pool) argument
|
/freebsd-11-stable/contrib/llvm-project/lld/ELF/ |
H A D | InputSection.h | 225 SectionPiece(size_t off, uint32_t hash, bool live) argument 226 : inputOff(off), live(live || !config->gcSections), hash(hash >> 1) {} 230 uint32_t hash : 31; member in struct:lld::elf::SectionPiece 263 return {toStringRef(data().slice(begin, end - begin)), pieces[i].hash};
|
/freebsd-11-stable/contrib/wpa/src/utils/ |
H A D | http_curl.c | 479 HashAlgAndValue *hash, ASN1_IA5STRING *uri) 485 if (hash == NULL || uri == NULL) 488 res = OBJ_obj2txt(txt, sizeof(txt), hash->hashAlg->algorithm, 1); 504 n->hash_len = ASN1_STRING_length(hash->hashValue); 505 n->hash = os_memdup(ASN1_STRING_get0_data(hash->hashValue), 507 if (n->hash == NULL) { 516 os_free(n->hash); 551 HashAlgAndValue *hash; local 554 hash 478 add_logo(struct http_ctx *ctx, struct http_cert *hcert, HashAlgAndValue *hash, ASN1_IA5STRING *uri) argument 597 HashAlgAndValue *hash; local 606 i2r_HashAlgAndValue(HashAlgAndValue *hash, BIO *out, int indent) argument 636 HashAlgAndValue *hash; local 738 HashAlgAndValue *hash; local [all...] |
/freebsd-11-stable/contrib/gcclibs/libiberty/ |
H A D | hashtab.c | 1 /* An expandable hash tables datatype. 22 /* This package implements basic hash table functionality. It is possible 28 grows too high the hash table will be expanded. 32 expanded by creation of new hash table and transferring elements from 77 hash-table routines to handle NULL specially; that would avoid 194 /* Returns a hash code for P. */ 216 /* Return the current size of given hash table. */ 226 /* Return the current number of elements in given hash table. */ 264 /* Compute the primary hash for HASH given HTAB's current size. */ 267 htab_mod (hashval_t hash, htab_ argument 276 htab_mod_m2(hashval_t hash, htab_t htab) argument 456 find_empty_slot_for_expand(htab_t htab, hashval_t hash) argument 560 htab_find_with_hash(htab_t htab, const PTR element, hashval_t hash) argument 608 htab_find_slot_with_hash(htab_t htab, const PTR element, hashval_t hash, enum insert_option insert) argument 698 htab_remove_elt_with_hash(htab_t htab, PTR element, hashval_t hash) argument [all...] |
/freebsd-11-stable/contrib/binutils/libiberty/ |
H A D | hashtab.c | 1 /* An expandable hash tables datatype. 22 /* This package implements basic hash table functionality. It is possible 28 grows too high the hash table will be expanded. 32 expanded by creation of new hash table and transferring elements from 77 hash-table routines to handle NULL specially; that would avoid 194 /* Returns a hash code for P. */ 216 /* Return the current size of given hash table. */ 226 /* Return the current number of elements in given hash table. */ 264 /* Compute the primary hash for HASH given HTAB's current size. */ 267 htab_mod (hashval_t hash, htab_ argument 276 htab_mod_m2(hashval_t hash, htab_t htab) argument 456 find_empty_slot_for_expand(htab_t htab, hashval_t hash) argument 560 htab_find_with_hash(htab_t htab, const PTR element, hashval_t hash) argument 608 htab_find_slot_with_hash(htab_t htab, const PTR element, hashval_t hash, enum insert_option insert) argument 698 htab_remove_elt_with_hash(htab_t htab, PTR element, hashval_t hash) argument [all...] |
/freebsd-11-stable/sys/netpfil/ipfw/ |
H A D | ip_fw_table_algo.c | 281 * Dumps options like items size/hash size, etc. 892 * addr:hash cmds 1060 uint16_t hash, hsize; local 1071 hash = hash_ip(a, hsize); 1072 SLIST_FOREACH(ent, &head[hash], next) { 1086 hash = hash_ip6_slow(&addr6, key, imask, hsize); 1087 SLIST_FOREACH(ent, &head[hash], next) { 1105 uint16_t hash, hsize; local 1116 hash = hash_ip(a, hsize); 1117 SLIST_FOREACH(ent, &head[hash], nex 1154 uint16_t hash, hsize; local 1398 uint32_t hash; local 1466 uint32_t hash; local 1563 uint32_t hash, value; local 1648 uint32_t hash; local 3189 uint32_t hash; local 3209 uint16_t hash; local 3445 uint32_t hash; local 3534 uint32_t hash, value; local 3606 uint32_t hash; local [all...] |
/freebsd-11-stable/crypto/openssh/ |
H A D | umac.c | 283 /* The NH-based hash functions used in UMAC are described in the UMAC paper 287 * in a single buffer and returns the hash result immediately. The second 291 * hash, the client calls nh_final() which calculates the hash output. 292 * Before beginning another hash calculation the nh_reset() routine 297 * responsability to pass no more than L1_KEY_LEN bytes per hash result. 309 #define STREAMS (UMAC_OUTPUT_LEN / 4) /* Number of times hash is applied */ 328 /* NH hashing primitive. Previous (partial) hash result is loaded and 364 * reading and writing 16 bytes of hash-state per call. 411 * reading and writing 24 bytes of hash 772 nh_ctx hash; /* Hash context for L1 NH hash */ member in struct:uhash_ctx 1179 uhash_ctx hash; /* Hash function for message compression */ member in struct:umac_ctx [all...] |
/freebsd-11-stable/contrib/wpa/src/tls/ |
H A D | tlsv1_client_read.c | 285 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); 502 u8 hash[SHA256_MAC_LEN]; local 506 "TLSv1: Validate server certificate hash"); 510 hash) < 0 || 511 os_memcmp(conn->cred->srv_cert_hash, hash, 514 "TLSv1: Server certificate hash mismatc 727 u8 hash[64]; local 1317 u8 hash[MD5_MAC_LEN + SHA1_MAC_LEN]; local [all...] |
/freebsd-11-stable/contrib/ncurses/ncurses/tty/ |
H A D | hashmap.c | 49 sped up by hashing. If a line hash is unique in both screens, those 53 We don't worry about false pairs produced by hash collisions, on the 118 hash(SCREEN *sp, NCURSES_CH_T * text) function 298 /* re-hash only changed lines */ 301 newhash(SP_PARM)[i] = hash(SP_PARM, NEWTEXT(SP_PARM, i)); 304 /* re-hash all */ 314 newhash(SP_PARM)[i] = hash(SP_PARM, NEWTEXT(SP_PARM, i)); 315 oldhash(SP_PARM)[i] = hash(SP_PARM, OLDTEXT(SP_PARM, i)); 321 if (newhash(SP_PARM)[i] != hash(SP_PARM, NEWTEXT(SP_PARM, i))) 323 if (oldhash(SP_PARM)[i] != hash(SP_PAR [all...] |
/freebsd-11-stable/contrib/libgnuregex/ |
H A D | regex_internal.c | 26 unsigned int hash) internal_function; 30 unsigned int hash) internal_function; 1462 unsigned int hash = nodes->nelem + context; 1465 hash += nodes->elems[i]; 1466 return hash; 1483 unsigned int hash; 1492 hash = calc_state_hash (nodes, 0); 1493 spot = dfa->state_table + (hash & dfa->state_hash_mask); 1498 if (hash != state->hash) 1459 unsigned int hash = nodes->nelem + context; local 1480 unsigned int hash; local 1524 unsigned int hash; local 1558 register_state(const re_dfa_t *dfa, re_dfastate_t *newstate, unsigned int hash) argument 1613 create_ci_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int hash) argument 1663 create_cd_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context, unsigned int hash) argument [all...] |
/freebsd-11-stable/contrib/wpa/src/radius/ |
H A D | radius.c | 526 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-11-stable/contrib/gcc/ |
H A D | postreload-gcse.c | 63 1. Build available expressions hash table: 66 the hash table. 91 /* We need to keep a hash table of expressions. The table entries are of 98 /* Expression elements in the hash table. */ 104 /* The same hash for this entry. */ member in struct:expr 105 hashval_t hash; 144 This array is used during the building of the hash table (step 1) to 178 /* Support for hash table construction and transformations. */ 239 /* Allocate the available expressions hash table. We don't want to 240 make the hash tabl 326 hashval_t hash; local 406 hashval_t hash = hash_expr (pat, &do_not_record_p); local [all...] |
/freebsd-11-stable/sys/dev/mlx5/mlx5_core/ |
H A D | mlx5_eswitch.c | 56 /* E-Switch UC L2 table hash node */ 63 /* E-Switch MC FDB table hash node */ 70 /* Vport UC/MC hash node */ 345 struct hlist_head *hash = esw->l2_table.l2_hash; local 351 esw_uc = l2addr_hash_find(hash, mac, struct esw_uc_addr); 359 esw_uc = l2addr_hash_add(hash, mac, struct esw_uc_addr, GFP_KERNEL); 381 struct hlist_head *hash = esw->l2_table.l2_hash; local 386 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 483 struct hlist_head *hash; local 517 struct hlist_head *hash; local [all...] |
/freebsd-11-stable/sys/geom/raid3/ |
H A D | g_raid3.h | 285 u_char md_hash[16]; /* MD5 hash. */ 427 char hash[16 * 2 + 1]; local 469 bzero(hash, sizeof(hash)); 471 hash[i * 2] = hex[md->md_hash[i] >> 4]; 472 hash[i * 2 + 1] = hex[md->md_hash[i] & 0x0f]; 474 printf(" MD5 hash: %s\n", hash);
|
/freebsd-11-stable/sys/geom/mirror/ |
H A D | g_mirror.h | 272 u_char md_hash[16]; /* MD5 hash. */ 462 char hash[16 * 2 + 1]; local 505 bzero(hash, sizeof(hash)); 507 hash[i * 2] = hex[md->md_hash[i] >> 4]; 508 hash[i * 2 + 1] = hex[md->md_hash[i] & 0x0f]; 510 printf(" MD5 hash: %s\n", hash);
|
/freebsd-11-stable/contrib/wpa/src/crypto/ |
H A D | ms_funcs.c | 84 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);
|