Searched defs:hash (Results 1 - 25 of 40) sorted by relevance

12

/bind-9.11.3/lib/dns/rdata/generic/
H A Dnsec3param_51.h23 dns_hash_t hash; member in struct:dns_rdata_nsec3param
H A Dnsec3_50.h23 dns_hash_t hash; member in struct:dns_rdata_nsec3
H A Dnsec3_50.c87 * 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(&region);
H A Dnsec3param_51.c91 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(&region);
/bind-9.11.3/bin/tools/
H A Dnsec3hash.c67 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/bin/tests/
H A Dhash_test.c28 print_digest(const char *s, const char *hash, unsigned char *d, argument
33 printf("hash (%s) %s:\n\t", hash, s);
/bind-9.11.3/lib/dns/tests/
H A Dprivate_test.c40 unsigned char hash; member in struct:__anon202
91 params.hash = testcase->hash;
H A Ddbversion_test.c564 dns_hash_t hash; local
576 result = dns_db_getnsec3parameters(db1, VERSION(callback), &hash,
/bind-9.11.3/lib/isccc/
H A Dsymtab.c130 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; \
/bind-9.11.3/lib/isc/
H A Dht.c13 #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 Dsymtab.c119 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);
H A Dentropy.c67 * Number of bytes returned per hash. This must be true:
527 * Do this by stiring the pool and returning a part of hash as randomness.
528 * Note that no secrets are given away here since parts of the hash are
539 isc_sha1_t hash; local
614 isc_sha1_init(&hash);
615 isc_sha1_update(&hash, (void *)(ent->pool.pool),
617 isc_sha1_final(&hash, digest);
/bind-9.11.3/contrib/idn/idnkit-1.0-src/lib/
H A Dnormalizer.c114 idn__strhash_t hash; local
124 if ((r = idn__strhash_create(&hash)) != idn_success)
126 scheme_hash = hash;
H A Dstrhash.c59 * 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 Ducsmap.c65 * 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 Dconverter.c211 idn__strhash_t hash; local
220 if ((r = idn__strhash_create(&hash)) != idn_success)
222 encoding_name_hash = hash;
/bind-9.11.3/lib/dns/
H A Dcompress.c146 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 Drrl.c37 * 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 Dnsec3.c222 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 Drequest.c59 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 Ddb.c991 dns_hash_t *hash, isc_uint8_t *flags,
999 return ((db->methods->getnsec3parameters)(db, version, hash,
990 dns_db_getnsec3parameters(dns_db_t *db, dns_dbversion_t *version, dns_hash_t *hash, isc_uint8_t *flags, isc_uint16_t *iterations, unsigned char *salt, size_t *salt_length) argument
H A Dgen.c511 unsigned int hash; local
709 * Spit out a quick and dirty hash function. Here,
711 * a hash. This isn't perfect, but it will generate "pretty
716 * the hash (mod 256) for each name.
745 hash = HASH(ttn->typename);
746 fprintf(stdout, "\t\tcase %u: \\\n", hash);
750 * this hash.
756 if (hash == HASH(ttn2->typename)) {
/bind-9.11.3/lib/isc/unix/
H A Dfile.c712 char buf[PATH_MAX], hash[PATH_MAX]; local
721 * allow room for a full sha256 hash (64 chars
735 /* Check whether the full-length SHA256 hash filename exists */
736 isc_sha256_data((const void *) base, strlen(base), hash);
739 hash, ext != NULL ? "." : "", ext != NULL ? ext : "");
745 /* Check for a truncated SHA256 hash filename */
746 hash[16] = '\0';
749 hash, ext != NULL ? "." : "", ext != NULL ? ext : "");
756 * If neither hash filename already exists, then we'll use
758 * or the truncated hash nam
[all...]
/bind-9.11.3/lib/isc/win32/
H A Dfile.c783 char buf[PATH_MAX], hash[PATH_MAX]; local
792 * allow room for a full sha256 hash (64 chars
806 /* Check whether the full-length SHA256 hash filename exists */
807 isc_sha256_data((const void *) base, strlen(base), hash);
810 hash, ext != NULL ? "." : "", ext != NULL ? ext : "");
816 /* Check for a truncated SHA256 hash filename */
817 hash[16] = '\0';
820 hash, ext != NULL ? "." : "", ext != NULL ? ext : "");
827 * If neither hash filename already exists, then we'll use
829 * or the truncated hash nam
[all...]
/bind-9.11.3/lib/dns/include/dns/
H A Drrl.h77 * The hash of the qname should be wide enough to make the probability
79 * We need a 32-bit hash value for 10000 qps (e.g. random qnames forged
157 * A hash table of rate-limit entries.
228 dns_rrl_hash_t *hash; member in struct:dns_rrl

Completed in 56 milliseconds

12