/freebsd-10.2-release/contrib/amd/amd/ |
H A D | info_exec.c | 176 char *hash; local 193 hash = strchr(qanswer, '#'); 194 if (hash) 195 *hash = '\0';
|
/freebsd-10.2-release/contrib/amd/mk-amd-map/ |
H A D | mk-amd-map.c | 122 char *hash; local 140 hash = strchr(key_val, '#'); 141 if (hash) 142 *hash = '\0';
|
/freebsd-10.2-release/sys/dev/cxgbe/ |
H A D | t4_l2t.h | 55 * packets awaiting address resolution. Second, it is a node of a hash table 57 * pointer. Finally, each node is a bucket of a hash table, pointing to the 67 struct l2t_entry *first; /* start of hash chain */ 72 uint16_t hash; /* hash bucket the entry is on */ member in struct:l2t_entry
|
/freebsd-10.2-release/sys/fs/nfsclient/ |
H A D | nfs_clnode.c | 103 u_int hash; local 110 hash = fnv_32_buf(fhp, fhsize, FNV1_32_INIT); 116 error = vfs_hash_get(mntp, hash, lkflags, 173 error = vfs_hash_insert(vp, hash, lkflags,
|
/freebsd-10.2-release/sys/dev/drm2/ttm/ |
H A D | ttm_object.h | 92 * @hash: hash entry for the per-device object hash. 101 * including the hash entry. A reference to a base object can 108 * already been taken out of the per-device hash. The parameter 123 struct drm_hash_item hash; member in struct:ttm_base_object 224 * @hash_order: Order of the hash table used to hold the reference objects. 249 * @hash_order: Order of hash table used to hash the base objects.
|
/freebsd-10.2-release/sys/netpfil/ipfw/ |
H A D | dn_heap.h | 28 * Binary heap and hash tables, header file 108 * This module implements a generic hash table with support for 110 * memory during hash table operations, objects must reserve 112 * an SLIST suffices, and we can tolerate the cost of a hash 119 * hash(key, flags, arg) called to return a bucket index. 130 * used to insert or delete elements in the hash table. 149 * It is usally of interest for the hash and match functions. 168 uint32_t (*hash)(uintptr_t, int, void *),
|
/freebsd-10.2-release/sys/nfsclient/ |
H A D | nfs_node.c | 112 u_int hash; local 119 hash = fnv_32_buf(fhp->fh_bytes, fhsize, FNV1_32_INIT); 123 error = vfs_hash_get(mntp, hash, flags, 171 error = vfs_hash_insert(vp, hash, flags,
|
/freebsd-10.2-release/sys/kgssapi/krb5/ |
H A D | kcrypto_des.c | 230 char hash[16]; local 240 MD5Final(hash, &md5); 242 des1_encrypt_1(ks, 0, hash, 0, 16, NULL, CRD_F_ENCRYPT); 243 m_copyback(inout, skip + inlen, outlen, hash + 8);
|
/freebsd-10.2-release/sys/net/ |
H A D | flowtable.c | 43 #include <sys/hash.h> 100 uint32_t f_hash; /* hash flowing forward */ 427 flowtable_list(struct flowtable *ft, uint32_t hash) argument 431 return (zpcpu_get(ft->ft_table[hash % ft->ft_size])); 495 flowtable_insert(struct flowtable *ft, uint32_t hash, uint32_t *key, argument 561 rtalloc_mpath_fib(ro, hash, fibnum); 611 fle->f_hash = hash; 624 flist = flowtable_list(ft, hash); 627 bit_set(mask, (hash % ft->ft_size)); 637 KASSERT(iter->f_hash % ft->ft_size == hash 709 uint32_t hash; local 1046 flowtable_list_pcpu(struct flowtable *ft, uint32_t hash, int cpuid) argument [all...] |
H A D | radix_mpath.c | 55 * give some jitter to hash, to avoid synchronization between routers 201 rtalloc_mpath_fib(struct route *ro, uint32_t hash, u_int fibnum) argument 230 hash += hashjitter; 231 hash %= n; 232 for (weight = abs((int32_t)hash), rt = ro->ro_rt;
|
H A D | if_vlan.c | 90 struct ifvlanhead *hash; /* dynamic hash-list table */ member in struct:ifvlantrunk 160 * The VLAN_ARRAY substitutes the dynamic hash with a static array 237 KASSERT(trunk->hwidth == 0 && trunk->hash == NULL, 238 ("%s: hash already initialized", __func__)); 243 trunk->hash = malloc(sizeof(struct ifvlanhead) * n, M_VLAN, M_WAITOK); 245 LIST_INIT(&trunk->hash[i]); 256 KASSERT(LIST_EMPTY(&trunk->hash[i]), 257 ("%s: hash table not empty", __func__)); 259 free(trunk->hash, M_VLA [all...] |
/freebsd-10.2-release/sys/vm/ |
H A D | uma_int.h | 43 * managing a hash of page addresses that maps pages to uma_slab_t structures 117 * size of the hash table for uma_slabs that are managed off page. This hash 142 int uh_hashsize; /* Current size of the hash table */ 237 SLIST_ENTRY(uma_slab) us_hlink; /* Link for hash table */ 343 static __inline uma_slab_t hash_sfind(struct uma_hash *hash, uint8_t *data); 379 * Find a slab within a hash table. This is used for OFFPAGE zones to lookup 383 * hash The hash table to search. 390 hash_sfind(struct uma_hash *hash, uint8_ argument [all...] |
/freebsd-10.2-release/crypto/openssh/ |
H A D | roaming_common.c | 229 u_char hash[SSH_DIGEST_MAX_LENGTH]; local 237 if (ssh_digest_buffer(SSH_DIGEST_SHA1, &b, hash, sizeof(hash)) != 0) 241 buffer_append(&b, hash, ssh_digest_bytes(SSH_DIGEST_SHA1));
|
/freebsd-10.2-release/sys/contrib/octeon-sdk/ |
H A D | cvmx-helper-check-defines.h | 94 #error CVMX_HELPER_INPUT_TAG_* values for determining tag hash inputs must be defined in executive-config.h
|
/freebsd-10.2-release/usr.bin/mkstr/ |
H A D | mkstr.c | 58 * Modified March 1978 to hash old messages to be able to recompile 270 struct hash { struct 273 struct hash *hnext; 280 struct hash *hp; 304 hp = (struct hash *) calloc(1, sizeof *hp);
|
/freebsd-10.2-release/usr.sbin/IPXrouted/ |
H A D | sap.h | 69 int hash; member in struct:sap_entry
|
H A D | sap_tables.c | 54 * This hash use the first 14 letters of the ServName and the ServType 55 * to create a 32 bit hash value. 88 * A hash is created and used to index into the hash table. Then 104 if ((hsh == sap->hash) && 171 nsap->hash = saphash(si->ServType, si->ServName); 173 sh = &sap_head[nsap->hash & SAPHASHMASK]; 295 nsap->hash = saphash(clone->ServType, clone->ServName);
|
/freebsd-10.2-release/usr.sbin/lpr/pac/ |
H A D | pac.c | 67 static size_t hcount; /* Count of hash entries */ 84 #define HSHSIZE 97 /* Number of hash buckets */ 87 struct hent *h_link; /* Forward hash link */ 100 static int hash(const char _name[]); 204 * for the users that we have in the hash table. If allflag 328 * Enter the name into the hash table and return the pointer allocated. 339 h = hash(name); 352 * Lookup a name in the hash table and return a pointer 362 h = hash(name); 371 * the hash tabl 374 hash(const char name[]) function [all...] |
/freebsd-10.2-release/contrib/llvm/tools/lldb/include/lldb/Core/ |
H A D | MappedHash.h | 23 eHashFunctionDJB = 0u // Daniel J Bernstein hash function that is also used by the ELF GNU_HASH sections 49 assert (!"Invalid hash function index"); 64 uint16_t hash_function; // The hash function enumeration that was used 65 uint32_t bucket_count; // The number of buckets in this hash table 66 uint32_t hashes_count; // The total number of unique hash values and hash data offsets in this table 188 uint32_t hash; member in struct:MappedHash::ExportTable::Entry 196 // Map a name hash to one or more name infos 213 entry.hash = MappedHash::HashString (eHashFunctionDJB, cstr); 244 unique_hashes[i] = m_entries[i].hash; 271 const uint32_t hash = m_entries[i].hash; local [all...] |
/freebsd-10.2-release/crypto/openssl/apps/ |
H A D | passwd.c | 405 char *hash = NULL; local 465 /* now compute password hash */ 468 hash = DES_crypt(passwd, *salt_p); 472 hash = md5crypt(passwd, (use1 ? "1" : "apr1"), *salt_p); 474 assert(hash != NULL); 477 BIO_printf(out, "%s\t%s\n", passwd, hash); 479 BIO_printf(out, "%s\t%s\n", hash, passwd); 481 BIO_printf(out, "%s\n", hash);
|
/freebsd-10.2-release/sys/netinet/ |
H A D | tcp_hostcache.c | 135 "Per-bucket hash limit for hostcache"); 164 /* XXX: What is the recommended hash to get good entropy for IPv6 addresses? */ 193 printf("WARNING: hostcache hash size is not a power of 2.\n"); 209 * Allocate the hash table. 216 * Initialize the hash buckets. 252 /* Free the uma zone and the allocated hash table. */ 270 int hash; local 280 hash = HOSTCACHE_HASH6(&inc->inc6_faddr); 282 hash = HOSTCACHE_HASH(&inc->inc_faddr); 284 hc_head = &V_tcp_hostcache.hashbase[hash]; 325 int hash; local [all...] |
/freebsd-10.2-release/contrib/subversion/subversion/libsvn_subr/ |
H A D | properties.c | 259 reference the same memory as the base/target_props hash. */ 379 svn_prop_hash_to_array(const apr_hash_t *hash, 384 apr_hash_count((apr_hash_t *)hash), 387 for (hi = apr_hash_first(pool, (apr_hash_t *)hash); hi; 404 svn_prop_hash_dup(const apr_hash_t *hash, 410 for (hi = apr_hash_first(pool, (apr_hash_t *)hash); hi; 378 svn_prop_hash_to_array(const apr_hash_t *hash, apr_pool_t *pool) argument 403 svn_prop_hash_dup(const apr_hash_t *hash, apr_pool_t *pool) argument
|
/freebsd-10.2-release/crypto/heimdal/base/ |
H A D | heimbase.c | 184 * Get hash value of object 186 * @param object object to get hash value for 188 * @return a hash value 195 if (isa->hash) 196 return isa->hash(ptr); 273 heim_type_hash hash) 287 type->hash = hash; 268 _heim_create_type(const char *name, heim_type_init init, heim_type_dealloc dealloc, heim_type_copy copy, heim_type_cmp cmp, heim_type_hash hash) argument
|
/freebsd-10.2-release/contrib/gcclibs/libiberty/ |
H A D | hashtab.c | 1 /* An expandable hash tables datatype. 22 /* This package implements basic hash table functionality. It is possible 28 grows too high the hash table will be expanded. 32 expanded by creation of new hash table and transferring elements from 77 hash-table routines to handle NULL specially; that would avoid 194 /* Returns a hash code for P. */ 216 /* Return the current size of given hash table. */ 226 /* Return the current number of elements in given hash table. */ 264 /* Compute the primary hash for HASH given HTAB's current size. */ 267 htab_mod (hashval_t hash, htab_ argument 276 htab_mod_m2(hashval_t hash, htab_t htab) argument 456 find_empty_slot_for_expand(htab_t htab, hashval_t hash) argument 560 htab_find_with_hash(htab_t htab, const PTR element, hashval_t hash) argument 608 htab_find_slot_with_hash(htab_t htab, const PTR element, hashval_t hash, enum insert_option insert) argument 698 htab_remove_elt_with_hash(htab_t htab, PTR element, hashval_t hash) argument [all...] |
/freebsd-10.2-release/contrib/binutils/libiberty/ |
H A D | hashtab.c | 1 /* An expandable hash tables datatype. 22 /* This package implements basic hash table functionality. It is possible 28 grows too high the hash table will be expanded. 32 expanded by creation of new hash table and transferring elements from 77 hash-table routines to handle NULL specially; that would avoid 194 /* Returns a hash code for P. */ 216 /* Return the current size of given hash table. */ 226 /* Return the current number of elements in given hash table. */ 264 /* Compute the primary hash for HASH given HTAB's current size. */ 267 htab_mod (hashval_t hash, htab_ argument 276 htab_mod_m2(hashval_t hash, htab_t htab) argument 456 find_empty_slot_for_expand(htab_t htab, hashval_t hash) argument 560 htab_find_with_hash(htab_t htab, const PTR element, hashval_t hash) argument 608 htab_find_slot_with_hash(htab_t htab, const PTR element, hashval_t hash, enum insert_option insert) argument 698 htab_remove_elt_with_hash(htab_t htab, PTR element, hashval_t hash) argument [all...] |