/freebsd-11-stable/usr.bin/du/ |
H A D | du.c | 376 int hash; local 380 /* If necessary, initialize the hash table. */ 390 /* If the hash table is getting too full, enlarge it. */ 416 hash = (le->dev ^ le->ino) % new_size; 418 if (new_buckets[hash] != NULL) 419 new_buckets[hash]->previous = 421 le->next = new_buckets[hash]; 423 new_buckets[hash] = le; 432 /* Try to locate this entry in the hash table. */ 433 hash [all...] |
/freebsd-11-stable/sys/contrib/xz-embedded/linux/lib/xz/ |
H A D | xz_dec_stream.c | 104 struct xz_dec_hash hash; member in struct:xz_dec::__anon8900 123 * Hash calculated from the Records (matches block.hash in 126 struct xz_dec_hash hash; member in struct:xz_dec::__anon8901 226 * the sizes possibly stored in the Block Header. Update the hash and 275 s->block.hash.unpadded += s->block_header.size 279 s->block.hash.unpadded += check_sizes[s->check_type]; 282 s->block.hash.unpadded += 4; 284 s->block.hash.unpadded += 8; 287 s->block.hash.uncompressed += s->block.uncompressed; 288 s->block.hash [all...] |
/freebsd-11-stable/crypto/heimdal/lib/asn1/ |
H A D | hash.c | 42 static Hashentry *_search(Hashtab * htab, /* The hash table */ 48 unsigned (*hash) (void *)) 63 htab->hash = hash; 77 for (hptr = htab->tab[(*htab->hash) (ptr) % htab->sz]; 85 /* Search for element in hash table */ 96 /* add element to hash table */ 115 tabptr = &htab->tab[(*htab->hash) (ptr) % htab->sz]; 163 /* standard hash-functions for strings */ 167 { /* Standard hash functio [all...] |
/freebsd-11-stable/sys/dev/glxsb/ |
H A D | glxsb_hash.c | 79 * Compute keyed-hash authenticator. 85 u_char hash[HASH_MAX_LEN]; local 96 axf->Final(hash, &ctx); 99 axf->Update(&ctx, hash, axf->hashsize); 100 axf->Final(hash, &ctx); 104 ses->ses_mlen == 0 ? axf->hashsize : ses->ses_mlen, hash);
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_stackdepot.cpp | 38 bool eq(u32 hash, const args_type &args) const { argument 41 if ((hash & kHashMask) != hash_bits || args.size != size || args.tag != tag) 52 static u32 hash(const args_type &args) { function in struct:__sanitizer::StackDepotNode 60 void store(const args_type &args, u32 hash) { argument 61 atomic_store(&hash_and_use_count, hash & kHashMask, memory_order_relaxed);
|
/freebsd-11-stable/crypto/openssl/crypto/x509/ |
H A D | by_dir.c | 76 unsigned long hash; member in struct:lookup_dir_hashes_st 162 static void by_dir_hash_free(BY_DIR_HASH *hash) argument 164 OPENSSL_free(hash); 170 if ((*a)->hash > (*b)->hash) 172 if ((*a)->hash < (*b)->hash) 313 htmp.hash = h; 397 htmp.hash = h; 409 hent->hash [all...] |
/freebsd-11-stable/usr.sbin/ppp/ |
H A D | pred.c | 54 /* The following hash code is the heart of the algorithm: 55 * It builds a sliding hash sum of the previous 3-and-a-bit characters 57 * A better hash function would result in additional compression, 60 #define HASH(state, x) state->hash = (state->hash << 4) ^ (x) 64 u_short hash; member in struct:pred1_state 79 if (state->dict[state->hash] == *source) { 82 state->dict[state->hash] = *source; 97 *dest++ = state->dict[state->hash] = *source; 114 *dest = state->dict[state->hash]; /* Gues [all...] |
/freebsd-11-stable/contrib/wpa/src/eap_common/ |
H A D | ikev2_common.c | 57 size_t data_len, u8 *hash) 67 os_memcpy(hash, tmphash, 12); 74 os_memcpy(hash, tmphash, 12); 99 u8 *hash) 104 hash); 106 return hmac_md5_vector(key, key_len, num_elem, addr, len, hash); 117 u8 hash[IKEV2_MAX_HASH_LEN]; local 130 addr[0] = hash; 144 &len[1], hash); 147 hash); 56 ikev2_integ_hash(int alg, const u8 *key, size_t key_len, const u8 *data, size_t data_len, u8 *hash) argument 97 ikev2_prf_hash(int alg, const u8 *key, size_t key_len, size_t num_elem, const u8 *addr[], const size_t *len, u8 *hash) argument 378 u8 *sign_data, *pos, *buf, hash[IKEV2_MAX_HASH_LEN]; local 436 u8 hash[IKEV2_MAX_HASH_LEN], *decrypted; local [all...] |
H A D | eap_pax_common.c | 93 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-11-stable/contrib/libarchive/libarchive/ |
H A D | archive_blake2sp_ref.c | 12 More information about the BLAKE2 hash function can be found at 186 uint8_t hash[PARALLELISM_DEGREE][BLAKE2S_OUTBYTES]; local 204 blake2s_final( S->S[i], hash[i], BLAKE2S_OUTBYTES ); 208 blake2s_update( S->R, hash[i], BLAKE2S_OUTBYTES ); 216 uint8_t hash[PARALLELISM_DEGREE][BLAKE2S_OUTBYTES]; local 250 #pragma omp parallel shared(S,hash), num_threads(PARALLELISM_DEGREE) 277 blake2s_final( S[i], hash[i], BLAKE2S_OUTBYTES ); 286 blake2s_update( FS, hash[i], BLAKE2S_OUTBYTES ); 311 uint8_t hash[BLAKE2S_OUTBYTES]; local 312 blake2sp( hash, BLAKE2S_OUTBYTE 323 uint8_t hash[BLAKE2S_OUTBYTES]; local [all...] |
/freebsd-11-stable/contrib/unbound/validator/ |
H A D | val_nsec3.c | 250 size_t nsec3_hash_to_b32(uint8_t* hash, size_t hashlen, uint8_t* zone, argument 257 ret = sldns_b32_ntop_extended_hex(hash, hashlen, (char*)buf+1, max-1); 548 log_err("nsec3 hash of unknown algo %d", algo); 569 /** perform hash of name */ 588 log_err("nsec3 hash of unknown algo %d", algo); 591 c->hash = (uint8_t*)regional_alloc(region, c->hash_len); 592 if(!c->hash) 595 sldns_buffer_limit(buf), (unsigned char*)c->hash); 598 sldns_buffer_write(buf, c->hash, c->hash_len); 603 sldns_buffer_limit(buf), (unsigned char*)c->hash); 630 nsec3_hash_name(rbtree_type* table, struct regional* region, sldns_buffer* buf, struct ub_packed_rrset_key* nsec3, int rr, uint8_t* dname, size_t dname_len, struct nsec3_cached_hash** hash) argument 703 nsec3_hash_matches_owner(struct nsec3_filter* flt, struct nsec3_cached_hash* hash, struct ub_packed_rrset_key* s) argument 743 struct nsec3_cached_hash* hash = NULL; local 769 nsec3_covers(uint8_t* zone, struct nsec3_cached_hash* hash, struct ub_packed_rrset_key* rrset, int rr, sldns_buffer* buf) argument 836 struct nsec3_cached_hash* hash = NULL; local [all...] |
H A D | val_kcache.c | 95 slabhash_insert(kcache->slab, k->entry.hash, &k->entry, 121 e = slabhash_lookup(kcache->slab, lookfor.entry.hash, &lookfor, wr); 171 slabhash_remove(kcache->slab, lookfor.entry.hash, &lookfor);
|
/freebsd-11-stable/contrib/ntp/ntpd/ |
H A D | ntp_monitor.c | 27 * Each entry is doubly linked into two lists, a hash table and a most- 29 * the hash table. If found, the statistics are updated and the entry 31 * allocated, initialized and linked into both the hash table and at the 37 * tail for the MRU list, unlinking from the hash table, and 61 * Pointers to the hash table and the MRU list. Memory for the hash 64 mon_entry ** mon_hash; /* MRU hash table */ 121 * remove_from_hash - removes an entry from the address hash table and 129 u_int hash; local 133 hash 319 u_int hash; local [all...] |
/freebsd-11-stable/sys/netinet/ |
H A D | in_rss.c | 60 /* for software rss hash support */ 110 * The protocol code may wish to do a software hash of the given 111 * tuple. This depends upon the currently configured RSS hash types. 123 uint32_t hash; local 126 * Next, choose the hash type depending upon the protocol 131 hash = rss_hash_ip4_4tuple(s, sp, d, dp); 132 *hashval = hash; 137 hash = rss_hash_ip4_4tuple(s, sp, d, dp); 138 *hashval = hash; 142 /* RSS doesn't hash o [all...] |
/freebsd-11-stable/sys/netinet6/ |
H A D | in6_rss.c | 60 /* for software rss hash support */ 111 * The protocol code may wish to do a software hash of the given 112 * tuple. This depends upon the currently configured RSS hash types. 124 uint32_t hash; local 127 * Next, choose the hash type depending upon the protocol 132 hash = rss_hash_ip6_4tuple(s, sp, d, dp); 133 *hashval = hash; 138 hash = rss_hash_ip6_4tuple(s, sp, d, dp); 139 *hashval = hash; 143 /* RSS doesn't hash o [all...] |
/freebsd-11-stable/sys/net80211/ |
H A D | ieee80211_acl.c | 87 /* simple hash is enough for variation of macaddr */ 134 int hash; local 136 hash = ACL_HASH(macaddr); 137 LIST_FOREACH(acl, &as->as_hash[hash], acl_hash) { 177 int hash; local 189 hash = ACL_HASH(mac); 190 LIST_FOREACH(acl, &as->as_hash[hash], acl_hash) { 202 LIST_INSERT_HEAD(&as->as_hash[hash], new, acl_hash);
|
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libdtrace/common/ |
H A D | dt_aggregate.c | 448 dt_ahash_t *hash = &agp->dtat_hash; local 482 if (hash->dtah_hash == NULL) { 485 hash->dtah_size = DTRACE_AHASHSIZE; 486 size = hash->dtah_size * sizeof (dt_ahashent_t *); 488 if ((hash->dtah_hash = malloc(size)) == NULL) 491 bzero(hash->dtah_hash, size); 552 ndx = hashval % hash->dtah_size; 554 for (h = hash->dtah_hash[ndx]; h != NULL; h = h->dtahe_next) { 691 if (hash->dtah_hash[ndx] != NULL) 692 hash 1204 dt_ahash_t *hash = &agp->dtat_hash; local 1220 dt_ahash_t *hash = &agp->dtat_hash; local 1286 dt_ahash_t *hash = &dtp->dt_aggregate.dtat_hash; local 1310 dt_ahash_t *hash = &agp->dtat_hash; local 1421 dt_ahash_t *hash = &agp->dtat_hash; local 1535 dt_ahash_t *hash = &agp->dtat_hash; local 1680 dt_ahash_t *hash = &agp->dtat_hash; local 2140 dt_ahash_t *hash = &agp->dtat_hash; local 2166 dt_ahash_t *hash = &agp->dtat_hash; local [all...] |
/freebsd-11-stable/sys/dev/random/ |
H A D | randomdev.c | 55 #include <dev/random/hash.h> 222 static struct randomdev_hash hash; local 228 randomdev_hash_init(&hash); 230 randomdev_hash_iterate(&hash, ×tamp, sizeof(timestamp)); 231 randomdev_hash_iterate(&hash, buf, count); 233 randomdev_hash_iterate(&hash, ×tamp, sizeof(timestamp)); 234 randomdev_hash_finish(&hash, entropy_data); 235 explicit_bzero(&hash, sizeof(hash));
|
H A D | fortuna.c | 55 #include <dev/random/hash.h> 73 #include <dev/random/hash.h> 263 uint8_t hash[RANDOM_KEYSIZE]; local 274 randomdev_hash_finish(&context, hash); 276 randomdev_hash_iterate(&context, hash, RANDOM_KEYSIZE); 277 randomdev_hash_finish(&context, hash); 278 randomdev_encrypt_init(&fortuna_state.fs_key, hash); 279 explicit_bzero(hash, sizeof(hash));
|
/freebsd-11-stable/sys/dev/mthca/ |
H A D | mthca_mcg.c | 54 * 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-11-stable/contrib/subversion/subversion/libsvn_ra_serf/ |
H A D | blncache.c | 44 /* A hash mapping 'svn_revnum_t *' baseline revisions to 'const 49 /* A hash mapping 'const char *' baseline URLs to 'baseline_info_t *' 79 hash_set_copy(apr_hash_t *hash, 86 apr_hash_set(hash, apr_pmemdup(apr_hash_pool_get(hash), key, klen), 78 hash_set_copy(apr_hash_t *hash, const void *key, apr_ssize_t klen, const void *val) argument
|
/freebsd-11-stable/sys/opencrypto/ |
H A D | gmac.c | 78 v = agc->hash; 99 agc->hash = v; 115 a = gf128_add(agc->hash, gf128_read(enccntr));
|
/freebsd-11-stable/usr.bin/xlint/lint2/ |
H A D | hash.c | 1 /* $NetBSD: hash.c,v 1.7 2002/01/21 19:49:52 tv Exp $ */ 36 __RCSID("$NetBSD: hash.c,v 1.7 2002/01/21 19:49:52 tv Exp $"); 41 * XXX Really need a generalized hash table package 52 /* pointer to hash table, initialized in inithash() */ 55 static int hash(const char *); 58 * Initialize hash table. 71 * Compute hash value from a string. 74 hash(const char *s) function 88 * Look for a hash table entry. If no hash tabl [all...] |
/freebsd-11-stable/crypto/openssh/ |
H A D | kexc25519.c | 95 u_char *hash, size_t *hashlen) 123 if (ssh_digest_buffer(hash_alg, b, hash, *hashlen) != 0) { 130 dump_digest("hash", hash, *hashlen); 85 kex_c25519_hash( int hash_alg, const char *client_version_string, const char *server_version_string, const u_char *ckexinit, size_t ckexinitlen, const u_char *skexinit, size_t skexinitlen, const u_char *serverhostkeyblob, size_t sbloblen, const u_char client_dh_pub[CURVE25519_SIZE], const u_char server_dh_pub[CURVE25519_SIZE], const u_char *shared_secret, size_t secretlen, u_char *hash, size_t *hashlen) argument
|
/freebsd-11-stable/usr.bin/sockstat/ |
H A D | sockstat.c | 302 int hash, vflag; local 421 hash = (int)((uintptr_t)sock->socket % 423 sock->next = sockhash[hash]; 424 sockhash[hash] = sock; 547 hash = (int)((uintptr_t)sock->socket % 549 sock->next = sockhash[hash]; 550 sockhash[hash] = sock; 575 int hash, retry, vflag; local 710 hash = (int)((uintptr_t)sock->socket % HASHSIZE); 711 sock->next = sockhash[hash]; 728 int hash, retry; local 983 int hash, first; local 1085 int hash, n, pos; local [all...] |