/bind-9.11.3/contrib/idn/idnkit-1.0-src/include/idn/ |
H A D | strhash.h | 52 * String-keyed hash table 54 * Just a hash table. Nothing special. Number of hash buckets 71 * Create a hash table. 81 * Delete a hash table created by 'idn__strhash_create'. 83 * hash to release memory for them. 86 idn__strhash_destroy(idn__strhash_t hash, idn__strhash_freeproc_t proc); 89 * Register an item to the hash table. This function makes a 97 idn__strhash_put(idn__strhash_t hash, const char *key, void *value); 107 idn__strhash_get(idn__strhash_t hash, cons [all...] |
/bind-9.11.3/contrib/idn/idnkit-1.0-src/lib/ |
H A D | strhash.c | 59 * Initially, the number of hash buckets is INITIAL_HASH_SIZE. 60 * As the more elements are put in the hash, the number of elements 85 unsigned long hash); 87 static idn_result_t expand_bins(idn__strhash_t hash, int new_size); 91 idn__strhash_t hash; local 100 if ((hash = malloc(sizeof(struct idn__strhash))) == NULL) { 101 WARNING(("idn__strhash_create: malloc failed (hash)\n")); 104 hash->nbins = 0; 105 hash->nelements = 0; 106 hash 119 idn__strhash_destroy(idn__strhash_t hash, idn__strhash_freeproc_t proc) argument 141 idn__strhash_put(idn__strhash_t hash, const char *key, void *value) argument 177 idn__strhash_get(idn__strhash_t hash, const char *key, void **valuep) argument 193 idn__strhash_exists(idn__strhash_t hash, const char *key) argument 215 find_entry(strhash_entry_t *entry, const char *key, unsigned long hash) argument 247 expand_bins(idn__strhash_t hash, int new_size) argument [all...] |
H A D | ucsmap.c | 65 * To speed up mapping table lookup, a combination of hash and 71 * Entries are sorted by its hash index and code point. 74 short hidx; /* hash index */ 102 ucsmap_hash_t hash[UCSMAP_HASH_SIZE]; member in struct:idn_ucsmap 237 /* Initialize hash. */ 239 ctx->hash[i].entry = NULL; 240 ctx->hash[i].n = 0; 246 /* Sort entries by the hash value and code point. */ 250 * Now the entries are sorted by their hash value, and 251 * sorted by its code point among the ones with the same hash valu 268 int hash; local [all...] |
H A D | normalizer.c | 114 idn__strhash_t hash; local 124 if ((r = idn__strhash_create(&hash)) != idn_success) 126 scheme_hash = hash;
|
/bind-9.11.3/lib/dns/rdata/generic/ |
H A D | nsec3param_51.h | 23 dns_hash_t hash; member in struct:dns_rdata_nsec3param
|
H A D | nsec3_50.h | 23 dns_hash_t hash; member in struct:dns_rdata_nsec3
|
H A D | nsec3param_51.c | 91 unsigned char hash; local 103 hash = uint8_fromregion(&sr); 112 snprintf(buf, sizeof(buf), "%u ", hash); 151 /* hash(1), flags(1), iterations(2), saltlen(1) */ 206 RETERR(uint8_tobuffer(nsec3param->hash, target)); 230 nsec3param->hash = uint8_consume_fromregion(®ion);
|
H A D | nsec3_50.c | 87 * Next hash a single base32hex word. 105 unsigned char hash; local 116 hash = uint8_fromregion(&sr); 118 snprintf(buf, sizeof(buf), "%u ", hash); 150 /* Next hash */ 189 /* hash(1), flags(1), iteration(2), saltlen(1) */ 254 REQUIRE(nsec3->hash == dns_hash_sha1); 259 RETERR(uint8_tobuffer(nsec3->hash, target)); 288 nsec3->hash = uint8_consume_fromregion(®ion);
|
/bind-9.11.3/lib/isc/ |
H A D | ht.c | 13 #include <isc/hash.h> 123 isc_uint32_t hash; local 128 hash = isc_hash_function(key, keysize, ISC_TRUE, NULL); 129 node = ht->table[hash & ht->mask]; 144 node->next = ht->table[hash & ht->mask]; 148 ht->table[hash & ht->mask] = node; 157 isc_uint32_t hash; local 163 hash = isc_hash_function(key, keysize, ISC_TRUE, NULL); 164 node = ht->table[hash & ht->mask]; 180 isc_uint32_t hash; local 283 isc_uint32_t hash; local [all...] |
H A D | symtab.c | 119 hash(const char *key, isc_boolean_t case_sensitive) { function 125 * This hash function is similar to the one Ousterhout 145 b = hash((k), (s)->case_sensitive) % (s)->size; \ 208 hv = hash(elt->key, symtab->case_sensitive);
|
/bind-9.11.3/bin/tools/ |
H A D | nsec3hash.c | 67 unsigned char hash[NSEC3_MAX_HASH_LENGTH]; local 91 fatal("hash algorithm too large"); 104 length = isc_iterated_hash(hash, hash_alg, iterations, salt, 108 region.base = hash; 112 fprintf(stdout, "%.*s (salt=%s, hash=%u, iterations=%u)\n",
|
/bind-9.11.3/lib/isc/tests/ |
H A D | isctest.h | 17 #include <isc/hash.h>
|
/bind-9.11.3/lib/dns/ |
H A D | compress.c | 146 unsigned int labels, hash, n; local 168 hash = dns_name_hash(&tname, ISC_FALSE) % 170 for (node = cctx->table[hash]; node != NULL; node = node->next) 215 unsigned int hash; local 257 hash = dns_name_hash(&tname, ISC_FALSE) % 284 node->next = cctx->table[hash]; 285 cctx->table[hash] = node;
|
H A D | rrl.c | 37 * Get a modulus for a hash function that is tolerably likely to be 41 * This works well in practice for hash tables up to at least 100 42 * times the square of the last prime and better than a multiplicative hash. 212 rrl->hash != NULL) { 221 rrl->hash->length, rate); 248 get_bin(dns_rrl_hash_t *hash, unsigned int hval) { argument 249 INSIST(hash != NULL); 250 return (&hash->bins[hval % hash->length]); 278 dns_rrl_hash_t *hash; local 495 dns_rrl_hash_t *hash; local [all...] |
H A D | request.c | 59 unsigned int hash; member in struct:dns_requestmgr 66 unsigned int hash; member in struct:dns_request 197 requestmgr->hash = 0; 414 requestmgr->hash++; 415 return (requestmgr->hash % DNS_REQUEST_NLOCKS); 868 request->hash = mgr_gethash(requestmgr); 1094 request->hash = mgr_gethash(requestmgr); 1250 LOCK(&request->requestmgr->locks[request->hash]); 1255 UNLOCK(&request->requestmgr->locks[request->hash]); 1266 LOCK(&request->requestmgr->locks[request->hash]); [all...] |
H A D | nsec3.c | 222 unsigned char hash[NSEC3_MAX_HASH_LENGTH]; local 231 rethash = hash; 239 /* hash the node name */ 249 /* convert the hash to base32hex non-padded */ 262 dns_nsec3_hashlength(dns_hash_t hash) { argument 264 switch (hash) { 272 dns_nsec3_supportedhash(dns_hash_t hash) { argument 273 switch (hash) { 365 if (nsec3->hash == nsec3param->hash 509 dns_hash_t hash; local 1320 dns_hash_t hash; local 1861 unsigned char hash[NSEC3_MAX_HASH_LENGTH]; local [all...] |
H A D | lib.c | 17 #include <isc/hash.h>
|
H A D | view.c | 18 #include <isc/hash.h> 1687 isc_uint32_t hash; local 1697 for (hash = 0; hash < DNS_VIEW_DELONLYHASH; hash++) 1698 ISC_LIST_INIT(view->delonly[hash]); 1700 hash = dns_name_hash(name, ISC_FALSE) % DNS_VIEW_DELONLYHASH; 1701 item = ISC_LIST_HEAD(view->delonly[hash]); 1712 ISC_LIST_APPEND(view->delonly[hash], item, link); 1722 isc_uint32_t hash; local 1756 isc_uint32_t hash; local [all...] |
/bind-9.11.3/lib/dns/tests/ |
H A D | private_test.c | 40 unsigned char hash; member in struct:__anon202 91 params.hash = testcase->hash;
|
H A D | dnstest.h | 15 #include <isc/hash.h>
|
/bind-9.11.3/lib/dns/include/dns/ |
H A D | nsec3.h | 26 * hash = 1, flags =1, iterations = 2, salt length = 1, salt = 255 (max) 27 * hash length = 1, hash = 255 (max), bitmap = 8192 + 512 (max) 31 * hash = 1, flags = 1, iterations = 2, salt length = 1, salt = 255 (max) 80 * the raw hash is stored there. 84 dns_nsec3_hashlength(dns_hash_t hash); 86 * Return the length of the hash produced by the specified algorithm 91 dns_nsec3_supportedhash(dns_hash_t hash); 93 * Return whether we support this hash algorithm or not.
|
/bind-9.11.3/bin/tests/system/dyndb/driver/ |
H A D | driver.c | 21 #include <isc/hash.h>
|
/bind-9.11.3/util/ |
H A D | kit.sh | 71 hash=`git ls-remote $repo refs/heads/$tag | awk '{print $1}'` 72 if [ -z "$hash" ]; then 73 hash=`git ls-remote $repo refs/tags/$tag | awk '{print $1}'` 75 if [ -z "$hash" ]; then 76 echo "Unable to determine hash for $tag, aborting." 79 shorthash=`echo $hash | cut -c1-7` 86 git archive --format=tar $remote $hash version | ( cd $verdir ;tar xf - ) 115 git archive --format=tar $remote $hash | ( cd $topdir; tar xf -)
|
/bind-9.11.3/bin/dnssec/ |
H A D | dnssectool.c | 60 isc_uint8_t hash; member in struct:nsec3_chain_fixed 713 if (e1->hash < e2->hash) 715 if (e1->hash > e2->hash) 739 if (e1->hash != e2->hash) 768 element->hash = nsec3->hash; 809 if (nsec3.hash [all...] |
/bind-9.11.3/lib/isccc/ |
H A D | symtab.c | 130 hash(const char *key, isc_boolean_t case_sensitive) { function 137 * P. J. Weinberger's hash function, adapted from p. 436 of 166 b = hash((k), (s)->case_sensitive) % (s)->size; \
|