/freebsd-current/sys/fs/ext2fs/ |
H A D | ext2_htree.c | 69 static int ext2_htree_check_next(struct inode *ip, uint32_t hash, 73 int namelen, uint32_t *hash, uint8_t *hash_version, 80 uint32_t hash, uint32_t blk); 82 uint32_t hash, uint32_t blk); 89 uint32_t hash); 112 ext2_htree_check_next(struct inode *ip, uint32_t hash, const char *name, argument 135 if ((hash & 1) == 0) { 136 if (hash != (next_hash & ~1)) 192 ext2_htree_set_hash(struct ext2fs_htree_entry *ep, uint32_t hash) argument 194 ep->h_hash = htole32(hash); 256 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 465 ext2_htree_insert_entry_to_level(struct ext2fs_htree_lookup_level *level, uint32_t hash, uint32_t blk) argument 485 ext2_htree_insert_entry(struct ext2fs_htree_lookup_info *info, uint32_t hash, uint32_t blk) argument [all...] |
/freebsd-current/sys/dev/cxgbe/ |
H A D | t4_l2t.h | 56 * packets awaiting address resolution. Second, it is a node of a hash table 58 * pointer. Finally, each node is a bucket of a hash table, pointing to the 70 struct l2t_entry *first; /* start of hash chain */ 75 uint16_t hash; /* hash bucket the entry is on */ member in struct:l2t_entry
|
/freebsd-current/sys/dev/drm2/ttm/ |
H A D | ttm_object.h | 91 * @hash: hash entry for the per-device object hash. 100 * including the hash entry. A reference to a base object can 107 * already been taken out of the per-device hash. The parameter 122 struct drm_hash_item hash; member in struct:ttm_base_object 223 * @hash_order: Order of the hash table used to hold the reference objects. 248 * @hash_order: Order of hash table used to hash the base objects.
|
/freebsd-current/sys/netpfil/ipfw/ |
H A D | dn_heap.h | 30 * 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-current/usr.bin/mkstr/ |
H A D | mkstr.c | 45 * Modified March 1978 to hash old messages to be able to recompile 257 static struct hash { struct 260 struct hash *hnext; 267 struct hash *hp; 291 hp = (struct hash *) calloc(1, sizeof *hp);
|
/freebsd-current/lib/libpmcstat/ |
H A D | libpmcstat_process.c | 218 uint32_t hash; local 222 hash = (uint32_t) pid & PMCSTAT_HASH_MASK; /* simplicity wins */ 224 LIST_FOREACH_SAFE(pp, &pmcstat_process_hash[hash], pp_next, pptmp) 254 LIST_INSERT_HEAD(&pmcstat_process_hash[hash], pp, pp_next);
|
/freebsd-current/lib/libc/db/test/hash.tests/ |
H A D | tverify.c | 61 ctl.hash = NULL; 68 fprintf(stderr, "cannot open: hash table\n" );
|
H A D | tdel.c | 59 ctl.hash = NULL; 67 fprintf(stderr, "cannot create: hash table size %d)\n",
|
H A D | tread2.c | 60 ctl.hash = NULL; 67 fprintf(stderr, "cannot open: hash table\n" );
|
H A D | driver2.c | 69 info.hash = my_hash; 95 perror("closing hash file");
|
H A D | tcreat3.c | 57 ctl.hash = NULL; 65 fprintf(stderr, "cannot create: hash table (size %d)\n",
|
/freebsd-current/usr.sbin/lpr/pac/ |
H A D | pac.c | 55 static size_t hcount; /* Count of hash entries */ 72 #define HSHSIZE 97 /* Number of hash buckets */ 75 struct hent *h_link; /* Forward hash link */ 88 static int hash(const char _name[]); 192 * for the users that we have in the hash table. If allflag 316 * Enter the name into the hash table and return the pointer allocated. 327 h = hash(name); 340 * Lookup a name in the hash table and return a pointer 350 h = hash(name); 359 * the hash tabl 362 hash(const char name[]) function [all...] |
/freebsd-current/crypto/openssl/util/perl/OpenSSL/Config/ |
H A D | Query.pm | 51 A reference to a unified information hash table, most commonly known as 56 A reference to a config information hash table, most commonly known as 96 The returned result is a hash table reference, with each key being one of 141 The returned result is a hash table reference, with each key being one of
|
/freebsd-current/contrib/bmake/mk/ |
H A D | whats.mk | 34 what_uuid = what_${what_thing}_${.CURDIR:T:hash} 35 what_var = what_${.CURDIR:T:hash}
|
/freebsd-current/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_stackdepotbase.h | 66 u32 find(u32 s, args_type args, hash_type hash) const; 80 u32 s, args_type args, hash_type hash) const { 84 if (node.eq(hash, args)) 121 hash_type h = Node::hash(args); 164 // Do not lock hash table. It's very expensive, but it's not rely needed. The 168 // the hash table, but the only issue is a few items inserted by parent
|
/freebsd-current/contrib/llvm-project/libcxx/src/ |
H A D | barrier.cpp | 34 __current = hash<thread::id>()(this_thread::get_id()) % ((__expected + 1) >> 1);
|
/freebsd-current/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | DWARFDebugInfo.h | 42 DWARFTypeUnit *GetTypeUnitForHash(uint64_t hash);
|
/freebsd-current/contrib/wpa/src/eap_common/ |
H A D | eap_gpsk_common.c | 44 u8 ibuf[2], hash[16]; local 48 hashlen = sizeof(hash); 60 if (omac1_aes_128_vector(psk, 2, addr, vlen, hash)) 63 os_memcpy(opos, hash, clen); 79 u8 ibuf[2], hash[SHA256_MAC_LEN]; local 95 if (hmac_sha256_vector(psk, 32, 2, addr, vlen, hash)) 98 os_memcpy(opos, hash, clen);
|
/freebsd-current/crypto/heimdal/lib/gssapi/krb5/ |
H A D | unwrap.c | 52 u_char hash[16]; local 142 EVP_DigestFinal_ex(md5, hash, NULL); 148 DES_cbc_cksum ((void *)hash, (void *)hash, sizeof(hash), 150 if (ct_memcmp (p - 8, hash, 8) != 0) { 170 EVP_CipherInit_ex(des_ctx, EVP_des_cbc(), NULL, key->keyvalue.data, hash, 0);
|
/freebsd-current/sys/netpfil/pf/ |
H A D | pf_syncookies.c | 315 uint32_t hash, ack, seq; local 330 hash = pf_syncookie_mac(pd, cookie, seq); 331 if ((ack & ~0xff) != (hash & ~0xff)) 467 uint32_t iss, hash; local 489 hash = pf_syncookie_mac(pd, cookie, ntohl(pd->hdr.tcp.th_seq)); 492 * Put the flags into the hash and XOR them to get better ISS number 497 iss = hash & ~0xff; 498 iss |= cookie.cookie ^ (hash >> 24);
|
/freebsd-current/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-current/contrib/llvm-project/lld/MachO/ |
H A D | InputSection.h | 171 // compact as possible. Hence the use of 31 rather than 64 bits for the hash. 177 uint32_t hash : 31; member in struct:lld::macho::StringPiece 181 StringPiece(uint64_t off, uint32_t hash) argument 182 : inSecOff(off), live(!config->deadStrip), hash(hash) {} 232 return {getStringRef(i), pieces[i].hash};
|
/freebsd-current/contrib/llvm-project/lldb/source/Utility/ |
H A D | ConstString.cpp | 82 const uint8_t h = hash(llvm::StringRef(ccstr)); 103 const uint8_t h = hash(string_ref); 128 const uint8_t h = hash(demangled); 144 const uint8_t h = hash(llvm::StringRef(mangled_ccstr)); 174 uint8_t hash(llvm::StringRef s) const { function in class:Pool
|
/freebsd-current/contrib/wpa/src/utils/ |
H A D | http_curl.c | 479 HashAlgAndValue *hash, ASN1_IA5STRING *uri) 485 if (hash == NULL || uri == NULL) 488 res = OBJ_obj2txt(txt, sizeof(txt), hash->hashAlg->algorithm, 1); 504 n->hash_len = ASN1_STRING_length(hash->hashValue); 505 n->hash = os_memdup(ASN1_STRING_get0_data(hash->hashValue), 507 if (n->hash == NULL) { 516 os_free(n->hash); 551 HashAlgAndValue *hash; local 554 hash 478 add_logo(struct http_ctx *ctx, struct http_cert *hcert, HashAlgAndValue *hash, ASN1_IA5STRING *uri) argument 597 HashAlgAndValue *hash; local 606 i2r_HashAlgAndValue(HashAlgAndValue *hash, BIO *out, int indent) argument 636 HashAlgAndValue *hash; local 738 HashAlgAndValue *hash; local [all...] |
/freebsd-current/sys/netinet/ |
H A D | in_fib_dxr.c | 184 LIST_HEAD(, trie_desc) unused_trie; /* abuses hash link entry */ 387 uint32_t hash = fdesc->fragments; local 390 hash = (hash << 7) + (hash >> 13) + *p; 392 return (hash + (hash >> 16)); 402 uint32_t hash = chunk_hash(da, fdesc); local 406 LIST_FOREACH(cdp, &da->chunk_hashtbl[hash & CHUNK_HASH_MASK], 408 if (cdp->cd_hash != hash || cd 505 uint32_t hash = chunk_hash(da, fdesc); local 567 uint32_t hash = 0; local 586 uint32_t hash = trie_hash(da, dxr_x, index); local [all...] |