/netbsd-current/tests/usr.bin/nbperf/ |
H A D | hash_driver.c | 37 #include "hash.c" 49 printf("%" PRId32 "\n", hash(line, len));
|
/netbsd-current/external/gpl2/groff/dist/src/libs/libbib/ |
H A D | common.cpp | 22 unsigned hash(const char *s, int len) function
|
/netbsd-current/external/gpl3/gdb.old/dist/gdbsupport/ |
H A D | hash_enum.h | 39 return std::hash<underlying> () (static_cast<underlying> (val));
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | tree-ssa-alias-compare.h | 40 inchash::hash &hstate);
|
H A D | tree-streamer.cc | 107 unsigned ix, tree t, hashval_t hash) 120 cache->hashes.safe_push (hash); 122 cache->hashes[ix] = hash; 139 tree t, hashval_t hash, unsigned *ix_p, 155 streamer_tree_cache_add_to_node_array (cache, ix, t, hash); 165 streamer_tree_cache_add_to_node_array (cache, ix, t, hash); 184 hashval_t hash, unsigned *ix_p) 186 return streamer_tree_cache_insert_1 (cache, t, hash, ix_p, true); 196 hashval_t hash = 0; local 198 hash 106 streamer_tree_cache_add_to_node_array(struct streamer_tree_cache_d *cache, unsigned ix, tree t, hashval_t hash) argument 138 streamer_tree_cache_insert_1(struct streamer_tree_cache_d *cache, tree t, hashval_t hash, unsigned *ix_p, bool insert_at_next_slot_p) argument 183 streamer_tree_cache_insert(struct streamer_tree_cache_d *cache, tree t, hashval_t hash, unsigned *ix_p) argument 209 streamer_tree_cache_append(struct streamer_tree_cache_d *cache, tree t, hashval_t hash) argument [all...] |
/netbsd-current/external/gpl3/gdb/dist/gdbsupport/ |
H A D | hash_enum.h | 39 return std::hash<underlying> () (static_cast<underlying> (val));
|
/netbsd-current/external/bsd/unbound/dist/util/storage/ |
H A D | slabhash.h | 39 * Hash table that consists of smaller hash tables. 64 /** lookup array of hash tables */ 69 * Create new slabbed hash table. 70 * @param numtables: number of hash tables to use, other parameters used to 80 * @return: new hash table or NULL on malloc failure. 88 * Delete hash table. Entries are all deleted. 94 * Clear hash table. Entries are all deleted. 103 * @param table: hash table. 104 * @param hash: hash valu [all...] |
/netbsd-current/external/mpl/bind/dist/lib/dns/rdata/generic/ |
H A D | nsec3_50.h | 26 dns_hash_t hash; member in struct:dns_rdata_nsec3
|
/netbsd-current/external/cddl/osnet/dist/uts/common/fs/zfs/ |
H A D | lzjb.c | 58 int mlen, offset, hash; local 74 hash = (src[0] << 16) + (src[1] << 8) + src[2]; 75 hash += hash >> 9; 76 hash += hash >> 5; 77 hp = &lempel[hash & (LEMPEL_SIZE - 1)];
|
/netbsd-current/external/gpl3/binutils.old/dist/bfd/ |
H A D | hash.c | 0 /* hash.c -- hash table routines for BFD 33 BFD provides a simple set of hash table functions. Routines 34 are provided to initialize a hash table, to free a hash table, 35 to look up a string in a hash table and optionally create an 36 entry for it, and to traverse a hash table. There is 37 currently no routine to delete an string from a hash table. 39 The basic hash table does not permit any data to be stored 40 with a string. However, a hash tabl 434 unsigned long hash; local 463 unsigned long hash; local 503 bfd_hash_insert(struct bfd_hash_table *table, const char *string, unsigned long hash) argument 816 _bfd_stringtab_add(struct bfd_strtab_hash *tab, const char *str, bfd_boolean hash, bfd_boolean copy) argument [all...] |
/netbsd-current/external/gpl3/binutils/dist/bfd/ |
H A D | hash.c | 0 /* hash.c -- hash table routines for BFD 33 BFD provides a simple set of hash table functions. Routines 34 are provided to initialize a hash table, to free a hash table, 35 to look up a string in a hash table and optionally create an 36 entry for it, and to traverse a hash table. There is 37 currently no routine to delete an string from a hash table. 39 The basic hash table does not permit any data to be stored 40 with a string. However, a hash tabl 434 unsigned long hash; local 463 unsigned long hash; local 503 bfd_hash_insert(struct bfd_hash_table *table, const char *string, unsigned long hash) argument 816 _bfd_stringtab_add(struct bfd_strtab_hash *tab, const char *str, bool hash, bool copy) argument [all...] |
/netbsd-current/external/gpl3/gdb.old/dist/bfd/ |
H A D | hash.c | 0 /* hash.c -- hash table routines for BFD 33 BFD provides a simple set of hash table functions. Routines 34 are provided to initialize a hash table, to free a hash table, 35 to look up a string in a hash table and optionally create an 36 entry for it, and to traverse a hash table. There is 37 currently no routine to delete an string from a hash table. 39 The basic hash table does not permit any data to be stored 40 with a string. However, a hash tabl 434 unsigned long hash; local 463 unsigned long hash; local 503 bfd_hash_insert(struct bfd_hash_table *table, const char *string, unsigned long hash) argument 815 _bfd_stringtab_add(struct bfd_strtab_hash *tab, const char *str, bfd_boolean hash, bfd_boolean copy) argument [all...] |
/netbsd-current/external/gpl3/gdb/dist/bfd/ |
H A D | hash.c | 0 /* hash.c -- hash table routines for BFD 33 BFD provides a simple set of hash table functions. Routines 34 are provided to initialize a hash table, to free a hash table, 35 to look up a string in a hash table and optionally create an 36 entry for it, and to traverse a hash table. There is 37 currently no routine to delete an string from a hash table. 39 The basic hash table does not permit any data to be stored 40 with a string. However, a hash tabl 434 unsigned long hash; local 463 unsigned long hash; local 503 bfd_hash_insert(struct bfd_hash_table *table, const char *string, unsigned long hash) argument 816 _bfd_stringtab_add(struct bfd_strtab_hash *tab, const char *str, bool hash, bool copy) argument [all...] |
/netbsd-current/external/bsd/openldap/dist/servers/slapd/back-sql/rdbms_depend/timesten/ |
H A D | tttestdb_create.sql | 9 unique hash on (id) pages=100; 17 unique hash on (id) pages=100; 24 unique hash on (id) pages=100; 34 ) unique hash on (pers_id, doc_id) pages=100; 41 unique hash on (id) pages=100;
|
/netbsd-current/sys/external/isc/libsodium/dist/src/libsodium/crypto_box/curve25519xsalsa20poly1305/ |
H A D | box_curve25519xsalsa20poly1305.c | 16 unsigned char hash[64]; local 18 crypto_hash_sha512(hash, seed, 32); 19 memcpy(sk, hash, 32); 20 sodium_memzero(hash, sizeof hash);
|
/netbsd-current/external/bsd/openldap/dist/libraries/liblutil/ |
H A D | ptest.c | 41 static char *hash[] = { variable 73 for( i= 0; hash[i]; i++ ) { 77 &passwd, &salt, hash[i] ); 81 passwd = lutil_passwd_hash( &pw[j], hash[i] ); 87 hash[i], pw[j].bv_val, pw[j].bv_len );
|
/netbsd-current/usr.sbin/veriexecgen/ |
H A D | veriexecgen.c | 70 /* this struct defines a hash algorithm */ 81 int exit_on_error; /* exit if we can't create a hash */ 91 /* this struct describes a directory entry to generate a hash for */ 94 char *hash_val; /* its associated hash value */ 100 /* define the possible hash algorithms */ 157 /* find a hash algorithm, given its name */ 161 hash_t *hash; local 163 for (hash = hashes; hash->hashname != NULL; hash 206 add_new_path_entry(veriexecgen_t *vp, const char *file, hash_t *hash) argument 240 add_new_ftsent_entry(veriexecgen_t *vp, FTSENT *file, hash_t *hash) argument 278 walk_dir(veriexecgen_t *vp, char **search_path, hash_t *hash) argument 318 read_from_file(veriexecgen_t *vp, hash_t *hash, FILE *file) argument 368 store_entries(veriexecgen_t *vp, hash_t *hash) argument 439 hash_t *hash = NULL; local [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | tree-streamer.c | 107 unsigned ix, tree t, hashval_t hash) 120 cache->hashes.safe_push (hash); 122 cache->hashes[ix] = hash; 139 tree t, hashval_t hash, unsigned *ix_p, 155 streamer_tree_cache_add_to_node_array (cache, ix, t, hash); 165 streamer_tree_cache_add_to_node_array (cache, ix, t, hash); 184 hashval_t hash, unsigned *ix_p) 186 return streamer_tree_cache_insert_1 (cache, t, hash, ix_p, true); 196 hashval_t hash = 0; local 198 hash 106 streamer_tree_cache_add_to_node_array(struct streamer_tree_cache_d *cache, unsigned ix, tree t, hashval_t hash) argument 138 streamer_tree_cache_insert_1(struct streamer_tree_cache_d *cache, tree t, hashval_t hash, unsigned *ix_p, bool insert_at_next_slot_p) argument 183 streamer_tree_cache_insert(struct streamer_tree_cache_d *cache, tree t, hashval_t hash, unsigned *ix_p) argument 209 streamer_tree_cache_append(struct streamer_tree_cache_d *cache, tree t, hashval_t hash) argument [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libgfortran/io/ |
H A D | format.c | 52 into a hash table. This avoids repeatedly parsing duplicate format strings 114 /* A simple hashing function to generate an index into the hash table. */ 121 uint32_t hash = 0; local 128 hash ^= key[i]; 129 hash &= (FORMAT_HASH_SIZE - 1); 130 return hash; 137 uint32_t hash; local 140 hash = format_hash (dtp); 143 /* Index into the hash table. We are simply replacing whatever is there 145 if (u->format_hash_table[hash] 160 uint32_t hash; local [all...] |
/netbsd-current/external/gpl3/gcc/dist/libgfortran/io/ |
H A D | format.c | 51 into a hash table. This avoids repeatedly parsing duplicate format strings 113 /* A simple hashing function to generate an index into the hash table. */ 120 uint32_t hash = 0; local 127 hash ^= key[i]; 128 hash &= (FORMAT_HASH_SIZE - 1); 129 return hash; 136 uint32_t hash; local 139 hash = format_hash (dtp); 142 /* Index into the hash table. We are simply replacing whatever is there 144 if (u->format_hash_table[hash] 159 uint32_t hash; local [all...] |
/netbsd-current/external/bsd/libarchive/dist/libarchive/ |
H A D | archive_hmac.c | 90 PBYTE hash; local 105 hash = (PBYTE)HeapAlloc(GetProcessHeap(), 0, hash_len); 106 if (hash == NULL) { 114 HeapFree(GetProcessHeap(), 0, hash); local 121 ctx->hash = hash; 136 BCryptFinishHash(ctx->hHash, ctx->hash, ctx->hash_len, 0); 138 memcpy(out, ctx->hash, *out_len); 146 HeapFree(GetProcessHeap(), 0, ctx->hash);
|
/netbsd-current/games/adventure/ |
H A D | vocab.c | 137 int hash, i; local 140 for (hash = 0, s = word, i = 0; i < 5 && *s; i++) /* some kind of hash*/ 141 hash += *s++; /* add all chars in the word */ 142 hash = (hash * 3719) & 077777; /* pulled that one out of a hat */ 143 hash %= HTSIZE; /* put it into range of table */ 145 for (adr = hash;; adr++) { /* look for entry in table */ 187 if (adr + 1 == hash || hash [all...] |
/netbsd-current/external/bsd/openldap/dist/servers/slapd/ |
H A D | slappasswd.c | 62 " -h hash\tpassword scheme\n" 130 struct berval hash = BER_BVNULL; local 271 hash = passwd; 275 lutil_passwd_hash( &passwd, scheme, &hash, &text ); 276 if ( BER_BVISNULL( &hash ) ) { 284 if( lutil_passwd( &hash, &passwd, NULL, &text ) ) { 292 printf( "%s%s" , hash.bv_val, newline ); 298 if ( !BER_BVISNULL( &hash ) ) { 299 ber_memfree( hash.bv_val ); 301 if ( passwd.bv_val != hash [all...] |
/netbsd-current/external/bsd/unbound/dist/util/ |
H A D | edns.c | 136 uint8_t* hash) 138 v4?siphash(in, 20, secret, hash, 8):siphash(in, 32, secret, hash, 8); 139 return hash; 146 uint8_t hash[8]; local 152 (void)edns_cookie_server_hash(buf, secret, v4, hash); 153 memcpy(buf + 16, hash, 8); 161 uint8_t hash[8]; local 180 if(memcmp(edns_cookie_server_hash(hash_input, secret, v4, hash), 135 edns_cookie_server_hash(const uint8_t* in, const uint8_t* secret, int v4, uint8_t* hash) argument
|
/netbsd-current/sys/external/bsd/drm2/dist/drm/vmwgfx/ |
H A D | vmwgfx_cmdbuf_res.c | 42 * @hash: Hash entry for the manager hash table. 50 struct drm_hash_item hash; member in struct:vmw_cmdbuf_res 89 struct drm_hash_item *hash; local 93 ret = drm_ht_find_item(&man->resources, key, &hash); 97 return drm_hash_entry(hash, struct vmw_cmdbuf_res, hash)->res; 113 WARN_ON(drm_ht_remove_item(&man->resources, &entry->hash)); 177 &entry->hash); 199 * resource to the hash tabl 254 struct drm_hash_item *hash; local [all...] |