/freebsd-10.2-release/sys/powerpc/ps3/ |
H A D | mmu_ps3.c | 278 uint64_t hash; local 282 hash = (vsid & VSID_HASH_MASK) ^ (((uint64_t)addr & ADDR_PIDX) >> 284 return (hash & moea64_pteg_mask);
|
/freebsd-10.2-release/contrib/apr-util/memcache/ |
H A D | apr_memcache.c | 149 apr_memcache_find_server_hash(apr_memcache_t *mc, const apr_uint32_t hash) argument 152 return mc->server_func(mc->server_baton, mc, hash); 155 return apr_memcache_find_server_hash_default(NULL, mc, hash); 161 const apr_uint32_t hash) 164 apr_uint32_t h = hash ? hash : 1; 610 apr_uint32_t hash; local 620 hash = apr_memcache_hash(mc, key, key_size); 622 ms = apr_memcache_find_server_hash(mc, hash); 742 apr_uint32_t hash; local 160 apr_memcache_find_server_hash_default(void *baton, apr_memcache_t *mc, const apr_uint32_t hash) argument 874 apr_uint32_t hash; local 943 apr_uint32_t hash; local 1187 apr_uint32_t hash; local [all...] |
/freebsd-10.2-release/usr.sbin/pmcstat/ |
H A D | pmcstat_log.c | 135 * All image descriptors are kept in a hash table. 140 * All process descriptors are kept in a hash table. 264 * strcmp(). This speeds up hash table lookups and saves memory if 268 LIST_ENTRY(pmcstat_string) ps_next; /* hash link */ 304 * Compute a 'hash' value for a string. 310 unsigned hash; local 312 for (hash = 2166136261; *s; s++) 313 hash = (hash ^ *s) * 16777619; 315 return (hash 328 int hash, len; local 358 int hash, len; local 811 int hash; local 1240 uint32_t hash; local [all...] |
/freebsd-10.2-release/crypto/heimdal/lib/ntlm/ |
H A D | ntlm.c | 94 * function, message encode and decode function, and the hash function 1015 splitandenc(unsigned char *hash, argument 1022 key[0] = hash[0]; 1023 key[1] = (hash[0] << 7) | (hash[1] >> 1); 1024 key[2] = (hash[1] << 6) | (hash[2] >> 2); 1025 key[3] = (hash[2] << 5) | (hash[3] >> 3); 1026 key[4] = (hash[ [all...] |
/freebsd-10.2-release/contrib/ofed/management/opensm/opensm/ |
H A D | st.c | 53 unsigned int hash; member in struct:st_table_entry 108 #define do_hash(key,table) (unsigned int)(*(table)->type->hash)(((void*)key)) 258 ((ptr) != 0 && (ptr->hash != (hash_val) || !EQUAL((table), (key), (ptr)->key))) 310 entry->hash = hash_val;\ 365 hash_val = ptr->hash % new_num_bins;
|
/freebsd-10.2-release/crypto/heimdal/kdc/ |
H A D | kx509.c | 71 "pk-hash have wrong length: %lu", 89 "pk-hash is not correct"); 107 ret = krb5_data_alloc(rep->hash, HMAC_size(&ctx)); 128 HMAC_Final(&ctx, rep->hash->data, 0); 402 ALLOC(rep.hash); 403 if (rep.hash == NULL) 405 krb5_data_zero(rep.hash);
|
/freebsd-10.2-release/contrib/unbound/validator/ |
H A D | val_kentry.c | 104 kk->entry.hash = 0x654; 105 kk->entry.hash = hashlittle(&kk->key_class, sizeof(kk->key_class), 106 kk->entry.hash); 107 kk->entry.hash = dname_query_hash(kk->name, kk->entry.hash);
|
/freebsd-10.2-release/contrib/binutils/bfd/ |
H A D | section.c | 708 /* Initialize an entry in the section hash table. */ 797 hash table entries. 872 unsigned long hash; local 878 hash = sh->root.hash; 885 while (sh != NULL && sh->root.hash == hash 1048 section hash table. Even though we can't find it directly by a 1049 hash lookup, we'll be able to find the section by traversing
|
H A D | sunos.c | 100 /* The hash table of dynamic symbols is composed of two word entries. 218 /* Similarly, the relocs end at the hash table. */ 327 /* Check my understanding of the dynamic hash table by making sure 328 that each symbol can be located in the hash table. */ 346 unsigned long hash; local 350 hash = 0; 352 hash = (hash << 1) + *name++; 353 hash &= 0x7fffffff; 354 hash 1800 unsigned long hash; local [all...] |
H A D | linker.c | 41 The first routine creates a hash table used by the other 43 file to the hash table. The third routine takes all the 54 including the linker hash table (which was created by the 73 Creating a linker hash table 77 The linker routines must create a hash table, which must be 80 create a derived hash table. This entry point is called using 84 and initialize an instance of the desired hash table. If the 86 stored with the entries in the hash table, the entry point may 90 For example, with each entry in the hash table the a.out 95 defines the required structures and functions for a hash tabl 724 _bfd_generic_link_hash_table_free(struct bfd_link_hash_table *hash) argument [all...] |
/freebsd-10.2-release/contrib/ipfilter/lib/ |
H A D | printfr.c | 27 int hash; local 457 hash = 0; 462 hash = 1; 465 hash = 1; 468 if (hash == 0)
|
/freebsd-10.2-release/lib/libc/db/hash/ |
H A D | hash.c | 34 static char sccsid[] = "@(#)hash.c 8.9 (Berkeley) 6/16/94"; 37 __FBSDID("$FreeBSD: releng/10.2/lib/libc/db/hash/hash.c 254222 2013-08-11 15:38:48Z jilles $"); 55 #include "hash.h" 136 if (info && info->hash) 137 hashp->hash = info->hash; 139 hashp->hash = __default_hash; 149 /* Verify file type, versions and hash function */ 156 if ((int32_t)hashp->hash(CHARKE [all...] |
/freebsd-10.2-release/contrib/openbsm/bin/auditdistd/ |
H A D | auditdistd.c | 229 unsigned char rnd[32], hash[32], resp[32]; local 347 (int)strlen(adhost->adh_password), rnd, (int)sizeof(rnd), hash, 349 pjdlog_error("Unable to generate hash."); 354 if (memcmp(resp, hash, sizeof(hash)) != 0) { 369 (int)strlen(adhost->adh_password), rnd, (int)sizeof(rnd), hash, 376 if (proto_send(conn, hash, sizeof(hash)) == -1) {
|
H A D | sender.c | 138 unsigned char rnd[32], hash[32], resp[32]; local 233 (int)strlen(adhost->adh_password), rnd, (int)sizeof(rnd), hash, 241 if (proto_send(conn, hash, sizeof(hash)) == -1) { 273 (int)strlen(adhost->adh_password), rnd, (int)sizeof(rnd), hash, 275 pjdlog_warning("Unable to generate hash."); 281 if (memcmp(resp, hash, sizeof(hash)) != 0) {
|
/freebsd-10.2-release/contrib/unbound/services/cache/ |
H A D | infra.c | 146 /** calculate the hash value for a host key */ 151 /* select the pieces to hash, some OS have changing data inside */ 166 /** calculate infra hash for a key */ 183 k.entry.hash = hash_infra(addr, addrlen, name); 186 return slabhash_lookup(infra->hosts, k.entry.hash, &k, wr); 240 key->entry.hash = hash_infra(addr, addrlen, name); 290 slabhash_insert(infra->hosts, e->hash, e, data, NULL); 351 slabhash_insert(infra->hosts, e->hash, e, e->data, NULL); 423 slabhash_insert(infra->hosts, e->hash, e, e->data, NULL); 479 slabhash_insert(infra->hosts, e->hash, [all...] |
/freebsd-10.2-release/sys/kern/ |
H A D | subr_lock.c | 311 lock_prof_sum(struct lock_prof *match, struct lock_prof *dst, int hash, argument 327 SLIST_FOREACH(l, &type->lpt_hash[hash], link) { 446 u_int hash; local 451 hash = (uintptr_t)lo->lo_name * 31 + (uintptr_t)p * 31 + line; 452 hash &= LPROF_HASH_MASK; 454 head = &type->lpt_hash[hash]; 471 SLIST_INSERT_HEAD(&type->lpt_hash[hash], lp, link);
|
/freebsd-10.2-release/crypto/openssh/ |
H A D | kex.c | 561 derive_key(Kex *kex, int id, u_int need, u_char *hash, u_int hashlen, argument 582 ssh_digest_update(hashctx, hash, hashlen) != 0 || 600 ssh_digest_update(hashctx, hash, hashlen) != 0 || 619 kex_derive_keys(Kex *kex, u_char *hash, u_int hashlen, argument 626 keys[i] = derive_key(kex, 'A'+i, kex->we_need, hash, hashlen, 643 kex_derive_keys_bn(Kex *kex, u_char *hash, u_int hashlen, const BIGNUM *secret) argument 649 kex_derive_keys(kex, hash, hashlen,
|
/freebsd-10.2-release/sys/netinet6/ |
H A D | ip6_mroute.c | 793 u_long hash; local 820 hash = MF6CHASH(mfccp->mf6cc_origin.sin6_addr, 822 for (rt = mf6ctable[hash], nstl = 0; rt; rt = rt->mf6c_next) { 856 n6expire[hash]--; 877 MRT6_DLOG(DEBUG_MFC, "no upcall h %lu o %s g %s p %x", hash, 882 for (rt = mf6ctable[hash]; rt; rt = rt->mf6c_next) { 899 n6expire[hash]--; 912 /* insert new entry at head of hash chain */ 925 rt->mf6c_next = mf6ctable[hash]; 926 mf6ctable[hash] 973 u_long hash; local 1051 u_long hash; local [all...] |
/freebsd-10.2-release/contrib/gcc/ |
H A D | rtl-factoring.c | 51 In order to avoid the comparison of every insn with every other, hash 53 These hash values are used for grouping the sequence candidates. So 54 we only need to compare every insn with every other in same hash group. 56 FILL_HASH_BUCKET creates all hash values and stores into HASH_BUCKETS. 61 candidates which last insns are in the same hash group. If these 234 /* The hash value of the group. */ 235 unsigned int hash; member in struct:hash_bucket_def 292 /* Returns the hash value of INSN. */ 297 unsigned int hash = 0; local 300 hash [all...] |
/freebsd-10.2-release/contrib/wpa/src/eap_common/ |
H A D | eap_sim_common.c | 239 u8 hash[SHA256_MAC_LEN]; local 251 addr[0] = hash; 266 hmac_sha256_vector(k, 32, 5, addr, len, hash); 269 os_memcpy(res, hash, hlen); 431 u8 hash[SHA256_MAC_LEN]; local 485 hmac_sha256_vector(key, sizeof(key), 5, addr, len, hash); 487 hash, sizeof(hash)); 489 os_memcpy(ck, hash, EAP_AKA_CK_LEN); 490 os_memcpy(ik, hash [all...] |
/freebsd-10.2-release/sys/netinet/ |
H A D | siftr.c | 67 #include <sys/hash.h> 174 uint32_t hash; member in struct:pkt_node 314 "enable packet hash generation"); 341 * Create the key that will be used to create a hash index 342 * into our hash table. Our key consists of: 362 * If the list is not empty i.e. the hash index has 367 * Loop through the hash nodes in the list. 368 * There should normally only be 1 hash node in the list, 369 * except if there have been collisions at the hash index 376 * hash nod 633 uint32_t hash; local [all...] |
/freebsd-10.2-release/contrib/wpa/src/wps/ |
H A D | wps_enrollee.c | 47 u8 *hash; local 66 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-Hash1", hash, SHA256_MAC_LEN); 82 hash = wpabuf_put(msg, SHA256_MAC_LEN); 86 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 4, addr, len, hash); 87 wpa_hexdump(MSG_DEBUG, "WPS: E-Hash2", hash, SHA256_MAC_LEN); 568 u8 hash[SHA256_MAC_LEN]; local 589 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 4, addr, len, hash); 591 if (os_memcmp(wps->peer_hash1, hash, WPS_HASH_LE 608 u8 hash[SHA256_MAC_LEN]; local [all...] |
/freebsd-10.2-release/sys/netgraph/ |
H A D | ng_pppoe.c | 497 /* Find free session and add to hash. */ 504 uint16_t val, hash; local 514 hash = SESSHASH(val); 515 mtx_lock(&privp->sesshash[hash].mtx); 516 LIST_FOREACH(tsp, &privp->sesshash[hash].head, sessions) { 522 LIST_INSERT_HEAD(&privp->sesshash[hash].head, sp, sessions); 524 mtx_unlock(&privp->sesshash[hash].mtx); 533 /* Add specified session to hash. */ 538 uint16_t hash = SESSHASH(sp->Session_ID); local 540 mtx_lock(&privp->sesshash[hash] 550 uint16_t hash = SESSHASH(sp->Session_ID); local 562 uint16_t hash = SESSHASH(session); local [all...] |
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/ |
H A D | IdempotentOperationChecker.cpp | 109 mutable AssumptionMap hash; member in class:__anon3562::IdempotentOperationChecker 116 // Find or create an entry in the hash for this BinaryOperator instance. 120 BinaryOperatorData &Data = hash[B]; 333 BinaryOperatorData &Data = hash[B]; 351 // Iterate over the hash to see if we have any paths with definite 353 for (AssumptionMap::const_iterator i = hash.begin(); i != hash.end(); ++i) { 354 // Unpack the hash contents 438 hash.clear();
|
/freebsd-10.2-release/crypto/heimdal/lib/gssapi/krb5/ |
H A D | wrap.c | 212 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);
|