/freebsd-10.2-release/contrib/wpa/src/eap_server/ |
H A D | eap_server_aka.c | 272 u8 hash[SHA256_MAC_LEN]; local 285 /* Checkcode is SHA1 hash over all EAP-AKA/Identity packets. */ 290 sha256_vector(1, &addr, &len, hash); 292 sha1_vector(1, &addr, &len, hash); 294 eap_sim_msg_add(msg, EAP_SIM_AT_CHECKCODE, 0, hash, 305 u8 hash[SHA256_MAC_LEN]; local 331 /* Checkcode is SHA1 hash over all EAP-AKA/Identity packets. */ 335 sha256_vector(1, &addr, &len, hash); 337 sha1_vector(1, &addr, &len, hash); 339 if (os_memcmp(hash, checkcod [all...] |
/freebsd-10.2-release/contrib/wpa/src/wps/ |
H A D | wps_validate.c | 778 static int wps_validate_e_hash1(const u8 *hash, int mandatory) argument 780 if (hash == NULL) { 792 static int wps_validate_e_hash2(const u8 *hash, int mandatory) argument 794 if (hash == NULL) { 806 static int wps_validate_r_hash1(const u8 *hash, int mandatory) argument 808 if (hash == NULL) { 820 static int wps_validate_r_hash2(const u8 *hash, int mandatory) argument 822 if (hash == NULL) {
|
/freebsd-10.2-release/crypto/openssl/crypto/txt_db/ |
H A D | txt_db.c | 222 LHASH_HASH_FN_TYPE hash, LHASH_COMP_FN_TYPE cmp) 233 if ((idx = (LHASH_OF(OPENSSL_STRING) *)lh_new(hash, cmp)) == NULL) { 221 TXT_DB_create_index(TXT_DB *db, int field, int (*qual) (OPENSSL_STRING *), LHASH_HASH_FN_TYPE hash, LHASH_COMP_FN_TYPE cmp) argument
|
/freebsd-10.2-release/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-10.2-release/contrib/jemalloc/include/jemalloc/internal/ |
H A D | hash.h | 2 * The following hash function is based on MurmurHash3, placed into the public 22 void hash(const void *key, size_t len, const uint32_t seed, 317 hash(const void *key, size_t len, const uint32_t seed, size_t r_hash[2]) function
|
/freebsd-10.2-release/usr.bin/mail/ |
H A D | extern.h | 137 int hash(const char *);
|
/freebsd-10.2-release/usr.bin/xlint/lint1/ |
H A D | scan.l | 70 static int hash(const char *); 296 h = hash(sym->s_name); 357 hash(const char *s) 381 * length and hash value. If there is already a symbol of the same name 396 sb->sb_hash = hash(yytext); 1381 h = hash(s); 1443 h = hash(sym->s_name); 1487 h = hash(sym->s_name);
|
/freebsd-10.2-release/contrib/gcc/ |
H A D | loop-invariant.c | 124 /* Entry for hash table of invariant expressions. */ 137 /* Its hash. */ 138 hashval_t hash; member in struct:invariant_expr_entry 252 /* Computes hash value for invariant expression X in INSN. */ 395 /* Returns hash value for invariant expression entry E. */ 402 return entry->hash; 428 hashval_t hash = hash_invariant_expr_1 (inv->insn, expr); local 436 slot = htab_find_slot_with_hash (eq, &pentry, hash, INSERT); 446 entry->hash = hash; [all...] |
H A D | gcse.c | 245 1) Build the hash table of expressions we wish to GCSE (expr_hash_table). 296 /* Next entry with the same hash. */ 334 /* Expression and copy propagation hash tables. 335 Each hash table is an array of buckets. 349 /* Size of the hash table, in elements. */ 352 /* Number of hash table elements. */ 359 /* Expression hash table. */ 362 /* Copy propagation hash table. */ 456 unsigned int hash_index; /* Index when in a hash table. */ 476 It is computed during hash tabl 1443 unsigned int hash; local 1462 unsigned int hash; local 1491 unsigned int hash; local 1592 unsigned int hash; local 2154 unsigned int hash = hash_set (regno, table->size); local 5053 unsigned int hash; local 5355 unsigned int hash = ptr->hash_index % expr_hash_table.size; local [all...] |
H A D | print-tree.c | 33 /* Define the hash table of nodes already seen. 174 int hash; 212 hash = ((unsigned long) node) % HASH_SIZE; 215 for (b = table[hash]; b; b = b->next) 225 b->next = table[hash]; 226 table[hash] = b; 173 int hash; local
|
/freebsd-10.2-release/contrib/gcclibs/libcpp/ |
H A D | lex.c | 513 unsigned int hash = HT_HASHSTEP (0, *base); local 519 hash = HT_HASHSTEP (hash, *cur); 539 hash = HT_HASHFINISH (hash, len); 542 ht_lookup_with_hash (pfile->hash_table, base, len, hash, HT_ALLOC);
|
/freebsd-10.2-release/contrib/subversion/subversion/libsvn_fs_fs/ |
H A D | temp_serializer.c | 217 /* auxilliary structure representing the content of a directory hash */ 292 /* copy the hash entries to an auxilliary struct of known layout */ 336 /* Utility function to reconstruct a dir entries hash from serialized data 352 /* fixup the references within each entry and add it to the hash */ 362 /* add the entry to the hash */ 366 /* return the now complete hash */ 554 /* Auxilliary structure representing the content of a properties hash. 559 /* number of entries in the hash */ 617 apr_hash_t *hash = in; local 625 properties.count = apr_hash_count(hash); 661 apr_hash_t *hash = svn_hash__make(pool); local [all...] |
/freebsd-10.2-release/sys/dev/sfxge/common/ |
H A D | hunt_filter.c | 442 * As the area of the efx_filter_spec_t we need to hash is DWORD 542 * An arbitrary search limit for the software hash table. As per the linux net 557 uint32_t hash; local 571 hash = hunt_filter_hash(spec); 590 i = (hash + depth) & (EFX_HUNT_FILTER_TBL_ROWS - 1); 834 unsigned int hash; local 842 hash = hunt_filter_hash(spec); 849 i = (hash + depth) & (EFX_HUNT_FILTER_TBL_ROWS - 1);
|
/freebsd-10.2-release/usr.sbin/pmcstat/ |
H A D | pmcpl_calltree.c | 143 * All nodes indexed by function/image name are placed in a hash table. 600 * hash table that corresponds to the given `pc' value in the process map 661 unsigned int hash; local 674 for (hash = i = 0; i < (int)sizeof(uintfptr_t); i++) 675 hash += (pc >> i) & 0xFF; 677 hash &= PMCSTAT_HASH_MASK; 679 STAILQ_FOREACH(h, &pmcpl_ct_node_hash[hash], pch_next) { 695 * new callgraph node and a new hash table entry for it. 712 STAILQ_INSERT_HEAD(&pmcpl_ct_node_hash[hash], h, pch_next);
|
/freebsd-10.2-release/sys/powerpc/aim/ |
H A D | mmu_oea.c | 152 #define VSID_MAKE(sr, hash) ((sr) | (((hash) & 0xfffff) << 4)) 442 u_int hash; local 444 hash = (sr & SR_VSID_MASK) ^ (((u_int)addr & ADDR_PIDX) >> 446 return (hash & moea_pteg_mask); 1657 u_int hash, n; local 1662 * VSID more random so that the PT hash function collides 1667 hash = moea_vsidcontext & (NPMAPS - 1); 1668 if (hash == 0) /* 0 is special, avoid it */ 1670 n = hash >> [all...] |
/freebsd-10.2-release/sys/cddl/contrib/opensolaris/uts/common/dtrace/ |
H A D | dtrace.c | 240 static dtrace_dynvar_t dtrace_dynhash_sink; /* end of dynamic hash chains */ 374 * On DEBUG kernels, DTrace will track the errors that has seen in a hash 378 * error hash may be examined with the ::dtrace_errhash MDB dcmd. 395 #define DTRACE_HASHSTR(hash, probe) \ 396 dtrace_hash_str(*((char **)((uintptr_t)(probe) + (hash)->dth_stroffs))) 398 #define DTRACE_HASHNEXT(hash, probe) \ 399 (dtrace_probe_t **)((uintptr_t)(probe) + (hash)->dth_nextoffs) 401 #define DTRACE_HASHPREV(hash, probe) \ 402 (dtrace_probe_t **)((uintptr_t)(probe) + (hash)->dth_prevoffs) 404 #define DTRACE_HASHEQ(hash, lh 1712 dtrace_dynhash_t *hash = dstate->dtds_hash; local [all...] |
/freebsd-10.2-release/sys/dev/hme/ |
H A D | if_hme.c | 1665 u_int32_t hash[4]; local 1669 /* Clear the hash table. */ 1670 hash[3] = hash[2] = hash[1] = hash[0] = 0; 1677 * and hash filter. Depending on the case, the right bit will be 1691 /* Disable the hash filter before writing to the filter registers. */ 1694 device_printf(sc->sc_dev, "cannot disable hash filter\n"); 1733 hash[cr [all...] |
/freebsd-10.2-release/contrib/gdb/gdb/ |
H A D | stabsread.c | 4236 int hash; 4255 for (hash = 0; hash < HASHSIZE; hash++) 4257 if (global_sym_chain[hash]) 4260 if (hash >= HASHSIZE) 4282 /* Get the hash index and check all the symbols 4283 under that hash index. */ 4285 hash = hashname (DEPRECATED_SYMBOL_NAME (msymbol)); 4287 for (sym = global_sym_chain[hash]; sy 4228 int hash; local [all...] |
/freebsd-10.2-release/contrib/binutils/bfd/ |
H A D | cofflink.c | 55 /* Create an entry in a COFF linker hash table. */ 90 /* Initialize a COFF linker hash table. */ 104 /* Create a COFF linker hash table. */ 126 /* Create an entry in a COFF debug merge hash table. */ 157 /* Given a COFF BFD, add symbols to the global hash table as 230 h = bfd_link_hash_lookup (info->hash, name, FALSE, FALSE, TRUE); 236 h = bfd_link_hash_lookup (info->hash, name + 6, FALSE, FALSE, TRUE); 286 /* Add all the symbols from an object file to the hash table. */ 316 /* We keep a list of the linker hash table entries that correspond 481 if (info->hash 1352 bfd_boolean copy, hash; local 2529 bfd_boolean hash; local [all...] |
/freebsd-10.2-release/sys/netgraph/ |
H A D | ng_base.c | 48 #include <sys/hash.h> 665 /* Get an ID and put us in the hash chain. */ 847 uint32_t hash; local 869 hash = hash32_str(name, HASHINIT) & V_ng_name_hmask; 871 LIST_FOREACH(node2, &V_ng_name_hash[hash], nd_nodes) 884 /* Update name hash. */ 885 LIST_INSERT_HEAD(&V_ng_name_hash[hash], node, nd_nodes); 906 int hash; local 920 hash = hash32_str(name, HASHINIT) & V_ng_name_hmask; 922 LIST_FOREACH(node, &V_ng_name_hash[hash], nd_node 973 uint32_t hash; local 1004 uint32_t hash; local [all...] |
/freebsd-10.2-release/crypto/heimdal/appl/ftp/ftp/ |
H A D | ftp.c | 651 while (hash && bytes > hashbytes) { 820 while (hash && (bytes >= hashbytes)) { 834 if (hash) { 1050 if (hash) { 1058 if (hash && bytes > 0) { 1102 while (hash && (bytes >= hashbytes)) { 1130 if (hash) {
|
/freebsd-10.2-release/sys/fs/nfsserver/ |
H A D | nfs_nfsdsubs.c | 1837 u_long hash = 0; local 1848 hash += ((u_char)'.'); 1850 hash += ((u_char)'.'); 1947 hash += ((u_char)val); 1963 hash += ((u_char)*fromcp); 1979 hash += ((u_char)*fromcp); 2022 *hashp = hash;
|
/freebsd-10.2-release/sys/cddl/dev/fbt/ |
H A D | fbt.c | 457 fbt_probe_t *fbt = parg, *next, *hash, *last; local 471 hash = fbt_probetab[ndx]; 473 while (hash != fbt) { 474 ASSERT(hash != NULL); 475 last = hash; 476 hash = hash->fbtp_hashnext; 1345 /* Choose the hash mask for the probe table. */
|
/freebsd-10.2-release/contrib/binutils/ld/ |
H A D | ldlang.c | 446 /* We can just do a hash lookup for the section with the right name. 1008 /* The hash table. */ 1012 /* Support routines for the hash table used by lang_output_section_find, 1069 einfo (_("%P%F: can not create hash table: %E\n")); 1103 scripts, there are none. Why a hash table then? Well, it's somewhat 1111 einfo (_("%P%F: can not create hash table: %E\n")); 1206 unsigned long hash; local 1214 hash = entry->root.hash; 1222 && entry->root.hash 1233 unsigned long hash; local [all...] |
/freebsd-10.2-release/contrib/ofed/management/infiniband-diags/src/ |
H A D | ibnetdiscover.c | 247 int hash = HASHGUID(new->nodeguid) % HTSZ; local 250 for (node = nodestbl[hash]; node; node = node->htnext) 261 int hash = HASHGUID(temp->nodeguid) % HTSZ; local 271 node->htnext = nodestbl[hash]; 272 nodestbl[hash] = node;
|