/netbsd-current/sys/fs/ntfs/ |
H A D | ntfs_ihash.c | 54 static u_long ntfs_nthash; /* size of hash table - 1 */ 60 * Initialize inode hash table. 71 * Reinitialize inode hash table. 78 struct nthashhead *oldhash, *hash; local 82 hash = hashinit(desiredvnodes, HASH_LIST, true, &mask); 87 ntfs_nthashtbl = hash; 93 LIST_INSERT_HEAD(&hash[val], ip, i_hash); 101 * Free the inode hash table. Called from ntfs_done(), only needed 134 * Insert the ntnode into the hash table. 149 * Remove the inode from the hash tabl [all...] |
/netbsd-current/external/bsd/ntp/dist/lib/isc/ |
H A D | hash.c | 1 /* $NetBSD: hash.c,v 1.6 2020/05/25 20:47:20 christos Exp $ */ 20 /* Id: hash.c,v 1.16 2009/09/01 00:22:28 jinmei Exp */ 23 * Some portion of this code was derived from universal hash function 64 #include <isc/hash.h> 78 * A large 32-bit prime number that specifies the range of the hash output. 84 * Types of random seed and hash accumulator. Perhaps they can be system 91 /*% isc hash structure */ 106 static isc_hash_t *hash = NULL; variable 158 * operation at the last stage of hash calculation, the accumulator 229 INSIST(hash [all...] |
/netbsd-current/sys/arch/powerpc/include/oea/ |
H A D | vmparam.h | 125 #define VSID_MAKE(sr, hash) \ 127 (((sr) << VSID__KEYSHFT) | ((hash) & VSID__HASMASK)) 137 #define VSID_MAKE(sr, hash) \ 139 (((hash) << VSID__HASHSHFT) | ((sr) & VSID__KEYMASK)) \
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | libfuncs.h | 50 static hashval_t hash (libfunc_entry *);
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/objc/ |
H A D | objc-map.h | 51 to convert a hash to a position in the hashtable by simply doing 52 "position = hash & mask", where mask is number_of_slots - 1 140 objc_map_private_hash_t hash = IDENTIFIER_HASH_VALUE (key); local 141 size_t i = hash & map->mask; 176 objc_map_private_hash_t hash = IDENTIFIER_HASH_VALUE (key); local 182 i = hash & map->mask;
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++11/ |
H A D | hash_c++0x.cc | 1 // std::hash definitions -*- C++ -*- 35 hash<long double>::operator()(long double __val) const noexcept 37 // 0 and -0 both hash to zero.
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/ |
H A D | hash-long-double-tr1-aux.cc | 1 // std::tr1::hash definitions, long double bits -*- C++ -*- 35 hash<long double>::operator()(long double __val) const 37 // 0 and -0 both hash to zero.
|
/netbsd-current/external/gpl3/gdb.old/dist/ld/testsuite/ld-cris/ |
H A D | pic-gc-72.d | 5 #ld: --shared -m crislinux --gc-sections --hash-style=sysv 15 Contents of section .hash:
|
H A D | tls-local-54.d | 3 #ld: --shared -m crislinux --hash-style=sysv 20 Contents of section .hash:
|
H A D | tls-local-60.d | 4 #ld: -m crislinux --shared --hash-style=sysv 25 Contents of section \.hash:
|
H A D | tls-local-61.d | 3 #ld: -m crislinux --shared --hash-style=sysv 24 Contents of section \.hash:
|
/netbsd-current/external/gpl3/gdb.old/dist/gdb/arch/ |
H A D | arc.h | 55 /* Used by std::unordered_map to hash the feature sets. The hash is 60 std::size_t hash () const noexcept
|
/netbsd-current/crypto/external/bsd/openssl/dist/crypto/ess/ |
H A D | ess_asn1.c | 28 ASN1_SIMPLE(ESS_CERT_ID, hash, ASN1_OCTET_STRING), 45 ASN1_SIMPLE(ESS_CERT_ID_V2, hash, ASN1_OCTET_STRING),
|
/netbsd-current/external/gpl3/gcc/dist/gcc/objc/ |
H A D | objc-map.h | 51 to convert a hash to a position in the hashtable by simply doing 52 "position = hash & mask", where mask is number_of_slots - 1 140 objc_map_private_hash_t hash = IDENTIFIER_HASH_VALUE (key); local 141 size_t i = hash & map->mask; 176 objc_map_private_hash_t hash = IDENTIFIER_HASH_VALUE (key); local 182 i = hash & map->mask;
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | libfuncs.h | 50 static hashval_t hash (libfunc_entry *);
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/src/c++11/ |
H A D | hash_c++0x.cc | 1 // std::hash definitions -*- C++ -*- 35 hash<long double>::operator()(long double __val) const noexcept 37 // 0 and -0 both hash to zero.
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/src/c++98/ |
H A D | hash-long-double-tr1-aux.cc | 1 // std::tr1::hash definitions, long double bits -*- C++ -*- 35 hash<long double>::operator()(long double __val) const 37 // 0 and -0 both hash to zero.
|
/netbsd-current/external/gpl3/gdb/dist/gdb/ |
H A D | bcache.h | 57 there's another problem. A bcache stores all its strings in a hash 59 its hash value. This means that the modified string is now in the 60 wrong place in the hash table, and future bcache probes will never 71 Assuming a 32-bit system (the hash table slots are 4 bytes), 75 bcache: This uses a separate linked list to track the hash chain. 76 The numbers show roughly 100% occupancy of the hash table and an 82 hashtab: This uses a more traditional re-hash algorithm where the 83 chain is maintained within the hash table. The table occupancy is 109 Speed of bcache VS hashtab (the half hash hack): 114 hash [all...] |
/netbsd-current/external/gpl3/gdb/dist/gdb/arch/ |
H A D | arc.h | 55 /* Used by std::unordered_map to hash the feature sets. The hash is 60 std::size_t hash () const noexcept
|
/netbsd-current/usr.bin/mail/ |
H A D | vars.c | 84 * the variable or group hash table. 87 hash(const char *name) function 107 for (vp = variables[hash(name)]; vp != NULL; vp = vp->v_link) 122 h = hash(name); 157 for (gh = groups[hash(name)]; gh != NULL; gh = gh->g_link)
|
/netbsd-current/external/bsd/libarchive/dist/libarchive/ |
H A D | archive_write_disk_set_standard_lookup.c | 55 int hash; member in struct:bucket 60 static unsigned int hash(const char *); 78 * TODO: Replace these hash tables with simpler move-to-front LRU 79 * lists with a bounded size (128 items?). The hash is a bit faster, 111 h = hash(gname); 113 if (b->name != NULL && b->hash == h && strcmp(gname, b->name) == 0) 120 b->hash = h; 180 h = hash(uname); 182 if (b->name != NULL && b->hash == h && strcmp(uname, b->name) == 0) 189 b->hash 250 hash(const char *p) function [all...] |
/netbsd-current/external/bsd/openldap/dist/contrib/slapd-modules/passwd/totp/ |
H A D | slapd-totp.c | 67 #define HMAC_setup(ctx, key, len, hash) \ 69 HMAC_Init_ex(ctx, key, len, hash, 0) 84 #define HMAC_setup(ctx, key, len, hash) \ 85 const struct nettle_hash *h=hash;\ 361 const void *hash, 369 HMAC_setup(ctx, key->mv_val, key->mv_len, hash); 630 struct berval *hash) 634 hash->bv_len = scheme->bv_len + b32len; 635 hash->bv_val = ber_memalloc(hash 360 do_hmac( const void *hash, myval *key, myval *data, myval *out) argument 627 passwd_string32( const struct berval *scheme, const struct berval *passwd, struct berval *hash) argument 647 hash_totp_and_pw( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text) argument 715 hash_totp1( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text) argument 730 hash_totp256( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text) argument 745 hash_totp512( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text) argument 760 hash_totp1andpw( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text) argument 775 hash_totp256andpw( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text) argument 790 hash_totp512andpw( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text) argument [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/digest/ |
H A D | package.d | 84 ubyte[4] hash = context.finish(); 85 assert(toHexString(hash) == "39A34F41"); 121 void digestFile(Hash)(ref Hash hash, string filename) 129 hash.put(buffer); 131 auto result = hash.finish(); 161 void digestFile(Digest hash, string filename) 168 hash.put(buffer); 170 ubyte[] result = hash.finish(); 171 writefln("%s (%s) = %s", typeid(hash).toString(), filename, toHexString(result)); 239 * The finish function returns the final hash su [all...] |
/netbsd-current/crypto/external/bsd/heimdal/dist/lib/hcrypto/ |
H A D | mdtest.c | 114 unsigned char hash[64]; member in struct:test 239 hash_test (struct hash_foo *hash, struct test *tests) argument 244 void *ctx = malloc(hash->psize); 245 unsigned char *res = malloc(hash->hsize); 247 printf ("%s... ", hash->name); 252 if (hash->evp() == NULL) { 256 EVP_DigestInit_ex(ectx, hash->evp(), NULL); 258 (*hash->init)(ctx); 263 (*hash->update)(ctx, buf, sizeof(buf)); 267 (*hash [all...] |
/netbsd-current/external/bsd/unbound/dist/services/cache/ |
H A D | rrset.c | 96 hashvalue_type hash, rrset_id_type id) 98 struct lruhash* table = slabhash_gettable(&r->table, hash); 110 /* we have locked the hash table, the item can still be deleted. 114 * also, with hash not changed, we are using the right slab. 117 if(key->id == id && key->entry.hash == hash) { 191 hashvalue_type h = k->entry.hash; 268 rrset->entry.hash = rrset_key_hash(&rrset->rk); 291 key.entry.hash = rrset_key_hash(&key.rk); 293 if((e = slabhash_lookup(&r->table, key.entry.hash, 95 rrset_cache_touch(struct rrset_cache* r, struct ub_packed_rrset_key* key, hashvalue_type hash, rrset_id_type id) argument [all...] |