/freebsd-11-stable/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-11-stable/contrib/subversion/subversion/libsvn_ra_serf/ |
H A D | getlocks.c | 71 /* return hash */ 72 apr_hash_t *hash; 182 svn_hash_sets(lock_ctx->hash, result_lock->path, result_lock); 257 lock_ctx->hash = apr_hash_make(pool); 300 *locks = lock_ctx->hash; 70 apr_hash_t *hash; member in struct:lock_context_t
|
/freebsd-11-stable/contrib/wpa/src/utils/ |
H A D | http-utils.h | 24 u8 *hash; member in struct:http_logo
|
/freebsd-11-stable/lib/libc/db/test/hash.tests/ |
H A D | driver2.c | 79 info.hash = my_hash; 105 perror("closing hash file");
|
H A D | tcreat3.c | 67 ctl.hash = NULL; 75 fprintf(stderr, "cannot create: hash table (size %d)\n",
|
H A D | tread2.c | 70 ctl.hash = NULL; 77 fprintf(stderr, "cannot open: hash table\n" );
|
H A D | tverify.c | 71 ctl.hash = NULL; 78 fprintf(stderr, "cannot open: hash table\n" );
|
/freebsd-11-stable/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])); 494 flowtable_insert(struct flowtable *ft, uint32_t hash, uint32_t *key, argument 560 rtalloc_mpath_fib(ro, hash, fibnum); 610 fle->f_hash = hash; 623 flist = flowtable_list(ft, hash); 626 bit_set(mask, (hash % ft->ft_size)); 636 KASSERT(iter->f_hash % ft->ft_size == hash 711 uint32_t hash; local 1042 flowtable_list_pcpu(struct flowtable *ft, uint32_t hash, int cpuid) argument [all...] |
H A D | rss_config.h | 38 * Supported RSS hash functions. 40 #define RSS_HASH_NAIVE 0x00000001 /* Poor but fast hash. */ 47 * Instances of struct inpcbinfo declare an RSS hash type indicating what 57 * calculate which hash types to enable and which not to enable. 86 * For RSS hash methods that do a software hash on an mbuf, the packet 115 u_int rss_getbucket(u_int hash);
|
/freebsd-11-stable/usr.bin/mkstr/ |
H A D | mkstr.c | 58 * Modified March 1978 to hash old messages to be able to recompile 270 static struct hash { struct 273 struct hash *hnext; 280 struct hash *hp; 304 hp = (struct hash *) calloc(1, sizeof *hp);
|
/freebsd-11-stable/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-11-stable/sys/dev/random/ |
H A D | hash.c | 48 #include <dev/random/hash.h> 53 /* Initialise the hash */ 61 /* Iterate the hash */ 69 /* Conclude by returning the hash in the supplied <*buf> which must be
|
H A D | other_algorithm.c | 60 #include <dev/random/hash.h>
|
/freebsd-11-stable/crypto/openssl/crypto/txt_db/ |
H A D | txt_db.h | 102 LHASH_HASH_FN_TYPE hash, LHASH_COMP_FN_TYPE cmp);
|
/freebsd-11-stable/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-11-stable/contrib/bmake/mk/ |
H A D | whats.mk | 39 what_uuid = what_${what_thing}_${.CURDIR:T:hash} 40 what_var = what_${.CURDIR:T:hash}
|
/freebsd-11-stable/contrib/amd/amd/ |
H A D | info_exec.c | 172 char *hash; local 189 hash = strchr(qanswer, '#'); 190 if (hash) 191 *hash = '\0';
|
/freebsd-11-stable/contrib/amd/mk-amd-map/ |
H A D | mk-amd-map.c | 118 char *hash; local 136 hash = strchr(key_val, '#'); 137 if (hash) 138 *hash = '\0';
|
/freebsd-11-stable/contrib/ofed/opensm/include/opensm/ |
H A D | st.h | 62 st_ptr_t(*hash) (void *); member in struct:st_hash_type
|
/freebsd-11-stable/sys/fs/ext2fs/ |
H A D | ext2_htree.c | 59 static int ext2_htree_check_next(struct inode *ip, uint32_t hash, 63 int namelen, uint32_t *hash, uint8_t *hash_version, 70 uint32_t hash, uint32_t blk); 72 uint32_t hash, uint32_t blk); 79 uint32_t hash); 100 ext2_htree_check_next(struct inode *ip, uint32_t hash, const char *name, argument 123 if ((hash & 1) == 0) { 124 if (hash != (next_hash & ~1)) 180 ext2_htree_set_hash(struct ext2fs_htree_entry *ep, uint32_t hash) argument 182 ep->h_hash = hash; 227 ext2_htree_find_leaf(struct inode *ip, const char *name, int namelen, uint32_t *hash, uint8_t *hash_ver, struct ext2fs_htree_lookup_info *info) argument 433 ext2_htree_insert_entry_to_level(struct ext2fs_htree_lookup_level *level, uint32_t hash, uint32_t blk) argument 453 ext2_htree_insert_entry(struct ext2fs_htree_lookup_info *info, uint32_t hash, uint32_t blk) argument [all...] |
/freebsd-11-stable/sys/contrib/ck/src/ |
H A D | ck_ht.c | 343 * Check memoized portion of hash value before 354 if (cursor->hash != h.value) 430 h.value = entry->hash; 441 h.value = entry->hash; 458 CK_HT_TYPE_STORE(&priority->hash, entry->hash); 543 snapshot->hash = CK_HT_TYPE_LOAD(&cursor->hash); 565 * Check memoized portion of hash value before 575 if (snapshot->hash ! [all...] |
/freebsd-11-stable/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 usually of interest for the hash and match functions. 168 uint32_t (*hash)(uintptr_t, int, void *),
|
/freebsd-11-stable/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 69 struct l2t_entry *first; /* start of hash chain */ 74 uint16_t hash; /* hash bucket the entry is on */ member in struct:l2t_entry
|
/freebsd-11-stable/sys/kgssapi/krb5/ |
H A D | kcrypto_des.c | 233 char hash[16]; local 243 MD5Final(hash, &md5); 245 des1_encrypt_1(ks, 0, hash, 0, 16, NULL, CRD_F_ENCRYPT); 246 m_copyback(inout, skip + inlen, outlen, hash + 8);
|
/freebsd-11-stable/sys/vm/ |
H A D | uma_int.h | 46 * managing a hash of page addresses that maps pages to uma_slab_t structures 122 * size of the hash table for uma_slabs that are managed off page. This hash 147 u_int uh_hashsize; /* Current size of the hash table */ 241 SLIST_ENTRY(uma_slab) us_hlink; /* Link for hash table */ 339 static __inline uma_slab_t hash_sfind(struct uma_hash *hash, uint8_t *data); 375 * Find a slab within a hash table. This is used for OFFPAGE zones to lookup 379 * hash The hash table to search. 386 hash_sfind(struct uma_hash *hash, uint8_ argument [all...] |