Searched refs:hash (Results 326 - 350 of 799) sorted by relevance

<<11121314151617181920>>

/freebsd-current/usr.sbin/pkg/
H A Dpkg.c56 #include "hash.h"
80 char hash[BUFSIZ]; member in struct:fingerprint
316 strlcpy(f->hash, fp, sizeof(f->hash));
462 warnx("Error creating SHA256 hash for package");
669 char *hash; local
671 hash = NULL;
708 hash = sha256_buf(sc->cert, sc->certlen);
710 /* Check if this hash is revoked */
713 if (strcasecmp(fingerprint->hash, has
[all...]
/freebsd-current/contrib/openbsm/bin/auditdistd/
H A Dauditdistd.c227 unsigned char rnd[32], hash[32], resp[32]; local
345 (int)strlen(adhost->adh_password), rnd, (int)sizeof(rnd), hash,
347 pjdlog_error("Unable to generate hash.");
352 if (memcmp(resp, hash, sizeof(hash)) != 0) {
367 (int)strlen(adhost->adh_password), rnd, (int)sizeof(rnd), hash,
374 if (proto_send(conn, hash, sizeof(hash)) == -1) {
H A Dsender.c136 unsigned char rnd[32], hash[32], resp[32]; local
231 (int)strlen(adhost->adh_password), rnd, (int)sizeof(rnd), hash,
239 if (proto_send(conn, hash, sizeof(hash)) == -1) {
271 (int)strlen(adhost->adh_password), rnd, (int)sizeof(rnd), hash,
273 pjdlog_warning("Unable to generate hash.");
279 if (memcmp(resp, hash, sizeof(hash)) != 0) {
/freebsd-current/sys/kern/
H A Dsubr_lock.c389 lock_prof_sum(struct lock_prof *match, struct lock_prof *dst, int hash, argument
403 SLIST_FOREACH(l, &type->lpt_hash[hash], link) {
524 u_int hash; local
529 hash = (uintptr_t)lo->lo_name * 31 + (uintptr_t)p * 31 + line;
530 hash &= LPROF_HASH_MASK;
532 head = &type->lpt_hash[hash];
548 SLIST_INSERT_HEAD(&type->lpt_hash[hash], lp, link);
/freebsd-current/usr.sbin/makefs/zfs/
H A Dzap.c46 uint64_t hash; /* key hash */ member in struct:zfs_zap_entry
61 uint64_t hashsalt; /* key hash input */
141 ent->hash = zap_hash(zap->hashsalt, ent->name);
258 * Find the shortest hash prefix length which lets us distribute keys without
283 li = ZAP_HASH_IDX(ent->hash, prefixlen);
329 /* Initialize the leaf hash table. */
410 * the upper bits of its hash, allocate chunks from that leaf, and fill
420 hi = ZAP_HASH_IDX(ent->hash, zt->zt_shift);
421 li = ZAP_HASH_IDX(ent->hash, prefixle
[all...]
/freebsd-current/sys/dev/qat/qat_api/common/crypto/sym/
H A Dlac_sym_alg_chain.c59 * This callback function will be invoked whenever a hash precompute
153 /* Following hash don't support partial */
159 /* Following hash may support partial based on device capabilities */
354 * - the hash part of the ContentDescriptor in DRAM */
355 /* - the hash part of the CD control block in the Request template */
598 /* Calculate hash states offsets */
693 /* LW 28 is used to set hash flags for AlgChaining. */
796 /* Need to set LW 28 hash flags as well. */
801 /* Need to set LW 28 hash flags as well. */
880 CpaCySymHashAlgorithm hash,
879 LacSymAlgChain_GetSpcState(CpaCySymCipherAlgorithm cipher, CpaCySymHashAlgorithm hash, Cpa32U capabilitiesMask) argument
1572 CpaCySymHashAlgorithm hash; local
[all...]
/freebsd-current/sys/netinet6/
H A Dip6_mroute.c811 u_long hash; local
838 hash = MF6CHASH(mfccp->mf6cc_origin.sin6_addr,
840 for (rt = mf6ctable[hash], nstl = 0; rt; rt = rt->mf6c_next) {
873 n6expire[hash]--;
894 MRT6_DLOG(DEBUG_MFC, "no upcall h %lu o %s g %s p %x", hash,
899 for (rt = mf6ctable[hash]; rt; rt = rt->mf6c_next) {
914 n6expire[hash]--;
927 /* insert new entry at head of hash chain */
940 rt->mf6c_next = mf6ctable[hash];
941 mf6ctable[hash]
988 u_long hash; local
1067 u_long hash; local
[all...]
/freebsd-current/contrib/wpa/src/eap_common/
H A Deap_sim_common.c238 u8 hash[SHA256_MAC_LEN]; local
250 addr[0] = hash;
265 hmac_sha256_vector(k, 32, 5, addr, len, hash);
268 os_memcpy(res, hash, hlen);
429 u8 hash[SHA256_MAC_LEN]; local
483 hmac_sha256_vector(key, sizeof(key), 5, addr, len, hash);
485 hash, sizeof(hash));
487 os_memcpy(ck, hash, EAP_AKA_CK_LEN);
488 os_memcpy(ik, hash
[all...]
H A Deap_sake_common.c216 u8 hash[SHA1_MAC_LEN]; local
240 hash) < 0)
242 os_memcpy(&buf[pos], hash, plen);
/freebsd-current/contrib/wpa/src/crypto/
H A Dcrypto_module_tests.c901 char *hash; member in struct:__anon59
942 u8 hash[16]; local
952 if (md5_vector(1, addr, len, hash) < 0 ||
953 os_memcmp(hash, tests[i].hash, 16) != 0) {
964 if (md5_vector(1, addr, len, hash) < 0 ||
965 os_memcmp(hash, tests[i].hash, 16) != 0) {
1097 "PAC to master secret label hash",
1425 u8 hash[3 member in struct:__anon60
1452 u8 hash[32]; /* HMAC-SHA-256 */ member in struct:hmac_test
1839 u8 hash[32]; local
1949 u8 hash[48]; local
[all...]
/freebsd-current/crypto/heimdal/lib/gssapi/krb5/
H A Dwrap.c212 u_char hash[16]; local
276 EVP_DigestFinal_ex(md5, hash, NULL);
282 DES_cbc_cksum ((void *)hash, (void *)hash, sizeof(hash),
284 memcpy (p - 8, hash, 8);
/freebsd-current/contrib/tcpdump/
H A Dprint-hncp.c515 uint64_t hash; local
520 hash = GET_BE_U_8(value);
521 ND_PRINT(" hash: %016" PRIx64, hash);
528 uint64_t hash; local
536 hash = GET_BE_U_8(value + 12);
537 ND_PRINT(" NID: %s seqno: %u %s hash: %016" PRIx64,
541 hash
/freebsd-current/sys/netpfil/ipfw/
H A Ddn_sched_fq_codel.c57 #include <sys/hash.h>
209 * Classify a packet to queue number using Jenkins hash function.
211 * the input of the hash are protocol no, perturbation, src IP, dst IP,
221 uint16_t hash=0; local
252 hash = jenkins_hash(tuple, 41, HASHINIT) % fcount;
253 return hash;
278 hash = jenkins_hash(tuple, 17, HASHINIT) % fcount;
280 return hash;
/freebsd-current/contrib/llvm-project/libcxx/modules/std/
H A Dmemory.inc176 // [util.smartptr.hash], hash support
177 using std::hash;
/freebsd-current/usr.sbin/pmcstat/
H A Dpmcpl_callgraph.c84 * The toplevel CG nodes (i.e., with rank == 0) are placed in a hash table.
125 * hash table that corresponds to the given `pc' value in the process
138 unsigned int i, hash; local
160 for (hash = i = 0; i < sizeof(uintfptr_t); i++)
161 hash += (pc >> i) & 0xFF;
163 hash &= PMCSTAT_HASH_MASK;
166 LIST_FOREACH(h, &pmcstat_cgnode_hash[hash], pch_next)
181 * new callgraph node and a new hash table entry for it.
189 LIST_INSERT_HEAD(&pmcstat_cgnode_hash[hash], h, pch_next);
342 * Find the callgraph node recorded in the global hash tabl
[all...]
/freebsd-current/sys/net/
H A Dif_gif.c260 struct gif_list *hash; local
263 hash = malloc(sizeof(struct gif_list) * GIF_HASH_SIZE,
266 CK_LIST_INIT(&hash[i]);
268 return (hash);
272 gif_hashdestroy(struct gif_list *hash) argument
275 free(hash, M_GIF);
H A Dmppcc.c51 uint16_t hash[MPPE_HIST_LEN]; member in struct:MPPC_comp_state
190 /* Prognose matching position using hash function. */
192 p = hist + state->hash[idx];
193 state->hash[idx] = (uint16_t) (s - hist);
/freebsd-current/crypto/openssl/apps/
H A Dcrl.c46 {"hash", OPT_HASH, '-', "Print hash value"},
48 {"hash_old", OPT_HASH_OLD, '-', "Print old-style (MD5) hash value"},
91 int hash = 0, issuer = 0, lastupdate = 0, nextupdate = 0, noout = 0; local
174 hash = ++num;
311 if (hash == i) {
318 BIO_printf(bio_out, "issuer name hash=");
329 BIO_printf(bio_out, "issuer name old hash=");
/freebsd-current/usr.sbin/nscd/
H A Dcachelib.c71 * Hashing and comparing routines, that are used with the hash tables
380 hashtable_index_t hash; local
396 hash = HASHTABLE_CALCULATE_HASH(cache_ht_, &entry->items,
398 assert(hash < HASHTABLE_ENTRIES_COUNT(&entry->items));
400 ht_item = HASHTABLE_GET_ENTRY(&(entry->items), hash);
701 hashtable_index_t hash; local
717 hash = HASHTABLE_CALCULATE_HASH(cache_ht_, &common_entry->items,
719 assert(hash < HASHTABLE_ENTRIES_COUNT(&common_entry->items));
721 item = HASHTABLE_GET_ENTRY(&(common_entry->items), hash);
807 hashtable_index_t hash; local
[all...]
/freebsd-current/usr.bin/jot/
H A Djot.c403 int dot, hash, space, sign, numbers = 0; local
434 dot = hash = space = sign = numbers = 0;
440 hash++)) ||
/freebsd-current/contrib/bmake/unit-tests/
H A Dcond-token-plain.mk19 .if ${:U} != "#hash"
26 .if ${:U\#hash} != "\#hash"
43 .if ${:U\\} != "\\#hash"
51 .if ${:U\#hash} != \#hash
/freebsd-current/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/
H A DAppleDWARFIndex.cpp86 std::optional<uint64_t> hash = form_value->getAsUnsignedConstant();
87 return hash && (*hash == expected_hash);
250 // We have a tag but no qual hash.
/freebsd-current/contrib/llvm-project/libcxx/include/__thread/
H A Dthread.h16 #include <__functional/hash.h>
115 struct _LIBCPP_TEMPLATE_VIS hash<__thread_id> : public __unary_function<__thread_id, size_t> { struct in inherits:__unary_function
117 return hash<__libcpp_thread_id>()(__v.__id_);
/freebsd-current/contrib/llvm-project/lld/COFF/
H A DICF.cpp256 // Collect only mergeable sections and group by hash value.
274 // Initially, we use hash values to partition sections.
280 // hash.
283 uint32_t hash = sc->eqClass[cnt % 2];
286 hash += sym->getChunk()->eqClass[cnt % 2];
287 // Set MSB to 1 to avoid collisions with non-hash classes.
288 sc->eqClass[(cnt + 1) % 2] = hash | (1U << 31);
/freebsd-current/contrib/jemalloc/include/jemalloc/internal/
H A Dmutex_pool.h4 #include "jemalloc/internal/hash.h"
22 hash(&key, sizeof(key), 0xd50dcc1b, hash_result);

Completed in 311 milliseconds

<<11121314151617181920>>