/freebsd-current/crypto/openssh/ |
H A D | auth2.c | 232 u_char *hash = xmalloc(len); local 237 if (ssh_digest_memory(SSH_DIGEST_SHA512, b, strlen(b), hash, len) != 0) 240 delay = (double)PEEK_U32(hash) / 1000 / 1000 / 1000 / 1000; 241 freezero(hash, len);
|
/freebsd-current/sys/kern/ |
H A D | subr_kdb.c | 704 u_int hash; local 712 hash = p->p_pid & pidhash; 716 if (++hash > pidhash) 718 p = LIST_FIRST(&pidhashtbl[hash]);
|
/freebsd-current/sys/compat/linuxkpi/common/include/linux/ |
H A D | hashtable.h | 34 #include <linux/hash.h> 85 * Unfortunately Linux doesn't have an own type for the hash
|
/freebsd-current/crypto/openssl/util/perl/OpenSSL/Test/ |
H A D | Utils.pm | 68 Returns an item from the %config hash in \$TOP/configdata.pm.
|
/freebsd-current/crypto/openssl/ssl/ |
H A D | s3_enc.c | 248 const EVP_MD *hash; local 256 if (!ssl_cipher_get_evp(s->ctx, s->session, &c, &hash, NULL, NULL, &comp, 266 s->s3.tmp.new_hash = hash; 273 num = EVP_MD_get_size(hash);
|
/freebsd-current/sys/sys/ |
H A D | umtxvar.h | 59 int hash; member in struct:umtx_key 102 /* List entry in hash */ 114 /* Linked list for the hash. */
|
/freebsd-current/sys/dev/random/ |
H A D | hash.c | 57 #include <dev/random/hash.h> 83 /* Initialise the hash */ 91 /* Iterate the hash */ 99 /* Conclude by returning the hash in the supplied <*buf> which must be 197 * material into the hash iterator that will produce key'.
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ProfileData/ |
H A D | FunctionId.h | 29 /// comes with two forms: a string or a hash code. The latter form is the 64-bit 33 /// When representing a hash code, we utilize the LengthOrHashCode field to 44 /// Extension to memcmp to handle hash code representation. If both are hash 46 /// comparison using getIntValue). If only one is hash code, it is considered 66 /// Constructor from a hash code. 73 /// the case where one or both are hash codes. Comparing their int values are 74 /// sufficient. A hash code FunctionId is considered not equal to a StringRef 83 /// greater than the hash code FunctionId. Otherwise this is the the same 106 /// representing a StringRef, not a hash cod 205 template <> struct hash<llvm::sampleprof::FunctionId> { struct in namespace:std [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MIRFSDiscriminator.cpp | 58 // Compute a hash value using debug line number, and the line numbers from the 80 std::hash<uint64_t> Hasher;
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | FoldingSet.h | 10 /// This file defines a hash set that can be used to remove duplication of nodes 38 /// This class is implemented as a single-link chained hash table, where the 111 /// structure is an array of buckets. Each bucket is indexed by the hash of 184 /// this function to compute a hash value for the given node. 190 /// GrowHashTable - Double the size of the hash table and rehash everything. 193 /// GrowBucketCount - resize the hash table and rehash everything. 247 // ComputeHash - Compute a hash value for X, using TempID to 249 // just calls Profile and does a regular hash computation. 297 /// ComputeHash - Compute a strong hash value for this FoldingSetNodeIDRef, 318 /// hash valu 458 bucket_begin(unsigned hash) argument 462 bucket_end(unsigned hash) argument [all...] |
/freebsd-current/contrib/llvm-project/lldb/source/Breakpoint/ |
H A D | BreakpointOptions.cpp | 478 std::hash<std::string> hasher; 482 const char *BreakpointOptions::GetConditionText(size_t *hash) const { 484 if (hash) 485 *hash = m_condition_text_hash;
|
/freebsd-current/sys/contrib/openzfs/include/sys/ |
H A D | zap_leaf.h | 46 * block size (1<<l->l_bs) - hash entry size (2) * number of hash 77 * The leaf hash table has block size / 2^5 (32) number of entries, 88 * The chunks start immediately after the hash table. The end of the 89 * hash table is at l_hash + HASH_NUMENTRIES, which we simply cast to a 115 uint64_t lh_prefix; /* hash prefix of this leaf */ 128 * The header is followed by a hash table with 129 * ZAP_LEAF_HASH_NUMENTRIES(zap) entries. The hash table is 142 uint16_t le_next; /* next entry in hash chain */ 148 uint64_t le_hash; /* hash valu [all...] |
/freebsd-current/sys/net/ |
H A D | if_me.c | 151 struct me_list *hash; local 154 hash = malloc(sizeof(struct me_list) * ME_HASH_SIZE, 157 CK_LIST_INIT(&hash[i]); 159 return (hash);
|
/freebsd-current/contrib/unbound/util/data/ |
H A D | msgparse.h | 77 /** number of buckets in parse rrset hash table. Must be power of 2. */ 135 * Based on name, type, class. Same hash value as in rrset cache. 149 /** next in hash bucket */ 153 /** hash value of rrset */ 154 hashvalue_type hash; member in struct:rrset_parse 333 * Calculate hash value for rrset in packet. 339 * @return hash value 348 * @param h: hash value 361 * Remove rrset from hash table. 363 * @param rrset: with hash valu [all...] |
/freebsd-current/contrib/llvm-project/libcxx/src/ |
H A D | atomic.cpp | 126 static hash<void const volatile*> __libcpp_contention_hasher;
|
/freebsd-current/contrib/xz/src/liblzma/lz/ |
H A D | lz_encoder.h | 106 uint32_t *hash; member in struct:lzma_mf_s 128 /// Number of elements in hash[]
|
/freebsd-current/sys/netinet/ |
H A D | in_pcb.c | 49 #include <sys/hash.h> 244 * functions often modify hash chains or addresses in pcbs. 1411 * inpcb hash lookups are protected by SMR section. 1487 * that may be found due to lockless access to the hash, but dropped 1494 * inp_next() - inpcb hash/list traversal iterator 1502 * a single hash slot. Note: only rip_input() does the latter. 1520 #define II_LIST_FIRST(ipi, hash) \ 1521 (((hash) == INP_ALL_LIST) ? \ 1523 CK_LIST_FIRST(&(ipi)->ipi_hash_exact[(hash)])) 1524 #define II_LIST_NEXT(inp, hash) \ 1538 int hash = ii->hash; local 2557 uint32_t hash; local 2698 uint32_t hash; local [all...] |
/freebsd-current/contrib/wpa/src/crypto/ |
H A D | crypto_wolfssl.c | 890 struct crypto_hash *hash; local 893 hash = os_zalloc(sizeof(*hash)); 894 if (!hash) 900 hash->size = 16; 907 hash->size = 20; 914 hash->size = 32; 922 if (wc_HmacSetKey(&hash->hmac, type, key, key_len) != 0) 925 ret = hash; 926 hash [all...] |
/freebsd-current/crypto/openssl/crypto/poly1305/asm/ |
H A D | poly1305-sparcv9.pl | 17 # This module implements Poly1305 hash for SPARCv9, vanilla, as well 92 stx %g0,[$ctx+8] ! zero hash value 161 ld [$ctx+0],$h1 ! load hash value 268 st $h1,[$ctx+0] ! store hash value 298 ldx [$ctx+0],$H0 ! load hash value 362 stx $H0,[$ctx+0] ! store hash value 380 ld [$ctx+0],$h1 ! load hash value 477 std $two0,[$ctx+8*0] ! initial hash value, biased 0 628 ldd [$ctx+8*0],$h0lo ! load [biased] hash value 699 fsubd $h0lo,$two0, $h0lo ! de-bias hash valu [all...] |
/freebsd-current/contrib/bearssl/src/ssl/ |
H A D | ssl_lru.c | 67 * with a HMAC value computed over the replaced part; the hash function 114 * value is truncated if needed). HMAC will use the same hash function 133 br_hmac_key_init(&hkc, cc->hash, cc->index_key, sizeof cc->index_key); 347 cc->hash = br_hmac_drbg_get_hash(&server_ctx->eng.rng);
|
/freebsd-current/cddl/contrib/opensolaris/tools/ctf/cvt/ |
H A D | tdata.c | 40 * The layout hash is used during the equivalency checking. We have a node in 45 * the node into the hash. If we don't, we'll end up with the vast majority of 51 * incorporate anything into the hash for a named struct or union node that 87 * the hash value, assuming there are any. 93 /* Use the first element in the hash value */ 387 * we store the iidescs as a hash. 446 tdata_build_hashes_common(tdata_t *td, hash_t *hash) argument 448 (void) iitraverse_hash(hash, &td->td_curvgen, NULL, NULL,
|
/freebsd-current/contrib/wpa/src/wps/ |
H A D | wps_validate.c | 780 static int wps_validate_e_hash1(const u8 *hash, int mandatory) argument 782 if (hash == NULL) { 794 static int wps_validate_e_hash2(const u8 *hash, int mandatory) argument 796 if (hash == NULL) { 808 static int wps_validate_r_hash1(const u8 *hash, int mandatory) argument 810 if (hash == NULL) { 822 static int wps_validate_r_hash2(const u8 *hash, int mandatory) argument 824 if (hash == NULL) {
|
/freebsd-current/sys/contrib/ncsw/Peripherals/FM/MAC/ |
H A D | fman_tgec.c | 202 uint32_t hash = (crc >> TGEC_HASH_MCAST_SHIFT) & TGEC_HASH_ADR_MSK; /* Take 9 MSB bits */ local 203 iowrite32be(hash | TGEC_HASH_MCAST_EN, ®s->hashtable_ctrl);
|
/freebsd-current/contrib/wpa/src/eap_server/ |
H A D | eap_server_aka.c | 273 u8 hash[SHA256_MAC_LEN]; local 286 /* Checkcode is SHA1 hash over all EAP-AKA/Identity packets. */ 291 sha256_vector(1, &addr, &len, hash); 293 sha1_vector(1, &addr, &len, hash); 295 eap_sim_msg_add(msg, EAP_SIM_AT_CHECKCODE, 0, hash, 306 u8 hash[SHA256_MAC_LEN]; local 332 /* Checkcode is SHA1 hash over all EAP-AKA/Identity packets. */ 336 sha256_vector(1, &addr, &len, hash); 338 sha1_vector(1, &addr, &len, hash); 340 if (os_memcmp_const(hash, checkcod [all...] |
/freebsd-current/sys/contrib/openzfs/module/lua/ |
H A D | lstate.c | 226 luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size); 287 g->strt.hash = NULL;
|