/freebsd-10.2-release/usr.sbin/pmcstat/ |
H A D | pmcpl_callgraph.c | 81 * The toplevel CG nodes (i.e., with rank == 0) are placed in a hash table. 122 * hash table that corresponds to the given `pc' value in the process 135 unsigned int i, hash; local 155 for (hash = i = 0; i < sizeof(uintfptr_t); i++) 156 hash += (pc >> i) & 0xFF; 158 hash &= PMCSTAT_HASH_MASK; 161 LIST_FOREACH(h, &pmcstat_cgnode_hash[hash], pch_next) 176 * new callgraph node and a new hash table entry for it. 184 LIST_INSERT_HEAD(&pmcstat_cgnode_hash[hash], h, pch_next); 337 * Find the callgraph node recorded in the global hash tabl [all...] |
/freebsd-10.2-release/contrib/ntp/lib/isc/ |
H A D | symtab.c | 126 hash(const char *key, isc_boolean_t case_sensitive) { function 132 * This hash function is similar to the one Ousterhout 152 b = hash((k), (s)->case_sensitive) % (s)->size; \ 215 hv = hash(elt->key, symtab->case_sensitive);
|
/freebsd-10.2-release/contrib/wpa/src/eap_common/ |
H A D | eap_sake_common.c | 215 u8 hash[SHA1_MAC_LEN]; local 238 hash); 239 os_memcpy(&buf[pos], hash, plen);
|
/freebsd-10.2-release/sys/kern/ |
H A D | vfs_cache.c | 95 LIST_ENTRY(namecache) nc_hash; /* hash chain */ 114 LIST_ENTRY(namecache) nc_hash; /* hash chain */ 140 * used names will hang around. Cache is indexed by hash value 155 #define NCHHASH(hash) \ 156 (&nchashtbl[(hash) & nchash]) 159 static u_long nchash; /* size of hash table */ 161 "Size of namecache hash table"); 319 * Grab an atomic snapshot of the name cache hash chain lengths 322 "hash table stats"); 337 /* Scan hash table 480 uint32_t hash; local 716 uint32_t hash; local [all...] |
/freebsd-10.2-release/sys/dev/bm/ |
H A D | if_bm.c | 908 uint16_t hash[4]; local 933 hash[3] = hash[2] = hash[1] = hash[0] = 0xffff; 935 /* Clear the hash table. */ 936 memset(hash, 0, sizeof(hash)); 949 hash[crc >> 4] |= 1 << (crc & 0xf); 954 /* Write out new hash tabl [all...] |
/freebsd-10.2-release/crypto/openssl/apps/ |
H A D | crl.c | 83 " -hash - print hash value\n", 85 " -hash_old - print old-style (MD5) hash value\n", 113 int hash = 0, issuer = 0, lastupdate = 0, nextupdate = 0, noout = local 194 else if (strcmp(*argv, "-hash") == 0) 195 hash = ++num; 301 if (hash == i) {
|
/freebsd-10.2-release/usr.sbin/nscd/ |
H A D | cachelib.c | 73 * Hashing and comparing routines, that are used with the hash tables 382 hashtable_index_t hash; local 398 hash = HASHTABLE_CALCULATE_HASH(cache_ht_, &entry->items, 400 assert(hash < HASHTABLE_ENTRIES_COUNT(&entry->items)); 402 ht_item = HASHTABLE_GET_ENTRY(&(entry->items), hash); 703 hashtable_index_t hash; local 719 hash = HASHTABLE_CALCULATE_HASH(cache_ht_, &common_entry->items, 721 assert(hash < HASHTABLE_ENTRIES_COUNT(&common_entry->items)); 723 item = HASHTABLE_GET_ENTRY(&(common_entry->items), hash); 809 hashtable_index_t hash; local [all...] |
/freebsd-10.2-release/usr.bin/jot/ |
H A D | jot.c | 393 int dot, hash, space, sign, numbers = 0; local 424 dot = hash = space = sign = numbers = 0; 430 hash++)) ||
|
/freebsd-10.2-release/contrib/llvm/tools/lldb/include/lldb/Breakpoint/ |
H A D | BreakpointLocation.h | 180 GetConditionText (size_t *hash = NULL) const;
|
/freebsd-10.2-release/contrib/llvm/tools/clang/include/clang/Basic/ |
H A D | OnDiskHashTable.h | 11 /// \brief Defines facilities for reading and writing on-disk hash tables. 125 const uint32_t hash; member in class:clang::OnDiskChainedHashTableGenerator::Item 129 : key(k), data(d), next(0), hash(InfoObj.ComputeHash(k)) {} 145 unsigned idx = E->hash & (size - 1); 208 Emit32(out, I->hash); 293 // Each bucket is just a 32-bit offset into the hash table file. 306 // Read the hash. 367 Ptr += 4; // Skip the hash. 385 LocalPtr += 4; // Skip the hash. 431 Ptr += 4; // Skip the hash [all...] |
/freebsd-10.2-release/contrib/gcc/ |
H A D | tree-ssa-alias-warnings.c | 351 The elements of the hash tables are tree_map objects. */ 371 to_find.hash = htab_hash_pointer (key); 405 tp->hash = htab_hash_pointer(tp->from); 546 match.hash = htab_hash_pointer (match.from); 552 match.hash = htab_hash_pointer (match.from);
|
H A D | gensupport.c | 1149 /* Compute a hash function of a c_test structure, which is keyed 1156 hashval_t hash; 1161 hash = 0; 1165 hash += c + (c << 17); 1166 hash ^= hash >> 2; 1170 hash += len + (len << 17); 1171 hash ^= hash >> 2; 1173 return hash; 1151 hashval_t hash; local [all...] |
/freebsd-10.2-release/contrib/ntp/lib/isc/tests/ |
H A D | isctest.c | 28 #include <isc/hash.h>
|
/freebsd-10.2-release/contrib/wpa/src/tls/ |
H A D | tlsv1_server_read.c | 773 u8 hash[MD5_MAC_LEN + SHA1_MAC_LEN], *hpos, *buf; local 841 hpos = hash; 848 * hash algorithms. 851 * HashAlgorithm hash; 862 wpa_printf(MSG_DEBUG, "TLSv1.2: Unsupported hash(%u)/" 918 wpa_hexdump(MSG_MSGDUMP, "TLSv1: CertificateVerify hash", hash, hlen); 992 if (buflen != hlen || os_memcmp(buf, hash, buflen) != 0) { 995 "hash"); 1068 u8 hash[MD5_MAC_LE local [all...] |
/freebsd-10.2-release/contrib/unbound/util/data/ |
H A D | msgparse.h | 73 /** number of buckets in parse rrset hash table. Must be power of 2. */ 119 * Based on name, type, class. Same hash value as in rrset cache. 133 /** next in hash bucket */ 137 /** hash value of rrset */ 138 hashvalue_t hash; member in struct:rrset_parse 267 * Calculate hash value for rrset in packet. 273 * @return hash value 282 * @param h: hash value 295 * Remove rrset from hash table. 297 * @param rrset: with hash valu [all...] |
H A D | packed_rrset.c | 339 ck->entry.hash = key->entry.hash; 372 dk->entry.hash = key->entry.hash;
|
/freebsd-10.2-release/contrib/gperf/src/ |
H A D | hash-table.cc | 24 #include "hash-table.h" 28 #include <hash.h> 31 /* We use a hash table with double hashing. This is the simplest kind of 32 hash table, given that we always only insert and never remove entries 33 from the hash table. */ 38 /* We make the size of the hash table a power of 2. This allows for two 106 "\ndumping the hash table\n" 124 fprintf (stderr, "\nend dumping hash table\n\n");
|
/freebsd-10.2-release/contrib/binutils/bfd/ |
H A D | elfxx-sparc.h | 42 /* Sparc ELF linker hash table. */ 92 /* Get the SPARC ELF linker hash table from a link_info structure. */ 95 ((struct _bfd_sparc_elf_link_hash_table *) ((p)->hash))
|
/freebsd-10.2-release/contrib/libc++/src/ |
H A D | memory.cpp | 174 return muts[hash<const void*>()(p) & (__sp_mut_count-1)];
|
/freebsd-10.2-release/contrib/groff/src/preproc/refer/ |
H A D | ref.h | 84 unsigned hash() const { return h; } function in class:reference
|
/freebsd-10.2-release/sys/geom/ |
H A D | geom_mbr.c | 271 u_char hash[16]; local 303 error = g_getattr("MBR::slicesum", cp, &hash); 304 if (!error && !bcmp(ms->slicesum, hash, sizeof(hash))) {
|
/freebsd-10.2-release/sys/netpfil/pf/ |
H A D | pf_lb.c | 78 * hash function based on bridge_hash in if_bridge.c 81 pf_hash(struct pf_addr *inaddr, struct pf_addr *hash, argument 92 hash->addr32[0] = c + key->key32[2]; 100 hash->addr32[0] = c; 105 hash->addr32[1] = c; 110 hash->addr32[2] = c; 115 hash->addr32[3] = c; 415 unsigned char hash[16]; local 417 pf_hash(saddr, (struct pf_addr *)&hash, &rpool->key, af); 418 PF_POOLMASK(naddr, raddr, rmask, (struct pf_addr *)&hash, a [all...] |
/freebsd-10.2-release/sys/ufs/ufs/ |
H A D | ufs_dirhash.c | 27 * This implements a hash-based lookup scheme for UFS directories. 69 static MALLOC_DEFINE(M_DIRHASH, "ufs_dirhash", "UFS directory hash tables"); 91 "max time in seconds of hash inactivity before deletion in low VM events"); 180 * Either acquire an existing hash locked shared or create a new hash and 234 /* The hash could've been recycled while we were waiting. */ 245 /* If the hash is still valid we've succeeded. */ 249 * If the hash is NULL it has been recycled. Try to upgrade 266 * Acquire an exclusive lock on an existing hash. Requires an exclusive 288 * Acquire exclusively and free the hash pointe 1028 u_int32_t hash; local 1174 doff_t **hash; local [all...] |
/freebsd-10.2-release/include/ |
H A D | db.h | 136 uint32_t /* hash function */ 137 (*hash)(const void *, size_t); member in struct:__anon5678
|
/freebsd-10.2-release/usr.bin/vtfontcvt/ |
H A D | vtfontcvt.c | 153 int hash; local 158 hash = fnv_32_buf(bytes, wbytes * height, FNV1_32_INIT) % FONTCVT_NHASH; 159 SLIST_FOREACH(gl, &glyph_hash[hash], g_hash) { 173 SLIST_INSERT_HEAD(&glyph_hash[hash], gl, g_hash);
|