Searched refs:hash (Results 1 - 25 of 55) sorted by relevance

123

/bind-9.6-ESV-R11/contrib/idn/idnkit-1.0-src/include/idn/
H A Dstrhash.h52 * 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.6-ESV-R11/contrib/idn/idnkit-1.0-src/lib/
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 Dnormalizer.c114 idn__strhash_t hash; local
124 if ((r = idn__strhash_create(&hash)) != idn_success)
126 scheme_hash = hash;
/bind-9.6-ESV-R11/lib/dns/rdata/generic/
H A Dnsec3param_51.h31 dns_hash_t hash; member in struct:dns_rdata_nsec3param
H A Dnsec3_50.h31 dns_hash_t hash; member in struct:dns_rdata_nsec3
H A Dnsec3param_51.c99 unsigned char hash; local
111 hash = uint8_fromregion(&sr);
120 sprintf(buf, "%u ", hash);
159 /* hash(1), flags(1), iterations(2), saltlen(1) */
214 RETERR(uint8_tobuffer(nsec3param->hash, target));
238 nsec3param->hash = uint8_consume_fromregion(&region);
H A Dnsec3_50.c98 * Next hash a single base32hex word.
141 unsigned char hash; local
153 hash = uint8_fromregion(&sr);
162 sprintf(buf, "%u ", hash);
241 /* hash(1), flags(1), iteration(2), saltlen(1) */
339 REQUIRE(nsec3->hash == dns_hash_sha1);
344 RETERR(uint8_tobuffer(nsec3->hash, target));
385 nsec3->hash = uint8_consume_fromregion(&region);
/bind-9.6-ESV-R11/lib/isc/
H A Dhash.c21 * Some portion of this code was derived from universal hash function
62 #include <isc/hash.h>
76 * A large 32-bit prime number that specifies the range of the hash output.
82 * Types of random seed and hash accumulator. Perhaps they can be system
89 /*% isc hash structure */
104 static isc_hash_t *hash = NULL; variable
156 * operation at the last stage of hash calculation, the accumulator
223 INSIST(hash == NULL);
229 if (hash == NULL)
230 result = isc_hash_ctxcreate(mctx, entropy, limit, &hash);
[all...]
H A Dsymtab.c128 hash(const char *key, isc_boolean_t case_sensitive) { function
134 * This hash function is similar to the one Ousterhout
154 b = hash((k), (s)->case_sensitive) % (s)->size; \
217 hv = hash(elt->key, symtab->case_sensitive);
/bind-9.6-ESV-R11/lib/isc/tests/
H A Disctest.h25 #include <isc/hash.h>
H A Disctest.c26 #include <isc/hash.h>
/bind-9.6-ESV-R11/bin/tests/
H A Dnsec3hash.c63 fatal("salt hash iterations domain");
73 unsigned char hash[NSEC3_MAX_HASH_LENGTH]; local
97 fatal("hash algorithm too large");
110 length = isc_iterated_hash(hash, hash_alg, iterations, salt,
114 region.base = hash;
118 fprintf(stdout, "%.*s (salt=%s, hash=%u, iterations=%u)\n",
H A Dhash_test.c34 print_digest(const char *s, const char *hash, unsigned char *d, argument
39 printf("hash (%s) %s:\n\t", hash, s);
/bind-9.6-ESV-R11/lib/dns/
H A Dcompress.c139 unsigned int labels, hash, n; local
156 hash = dns_name_hash(&tname, ISC_FALSE) %
158 for (node = cctx->table[hash]; node != NULL; node = node->next)
203 unsigned int hash; local
224 hash = dns_name_hash(&tname, ISC_FALSE) %
243 node->next = cctx->table[hash];
244 cctx->table[hash] = node;
H A Dnsec3.c265 unsigned char hash[NSEC3_MAX_HASH_LENGTH]; local
274 rethash = hash;
282 /* hash the node name */
291 /* convert the hash to base32hex */
304 dns_nsec3_hashlength(dns_hash_t hash) { argument
306 switch (hash) {
313 dns_nsec3_supportedhash(dns_hash_t hash) { argument
314 switch (hash) {
405 if (nsec3->hash == nsec3param->hash
541 dns_hash_t hash; local
1006 dns_hash_t hash; local
1456 unsigned char hash[NSEC3_MAX_HASH_LENGTH]; local
[all...]
H A Drequest.c68 unsigned int hash; member in struct:dns_requestmgr
75 unsigned int hash; member in struct:dns_request
205 requestmgr->hash = 0;
422 requestmgr->hash++;
423 return (requestmgr->hash % DNS_REQUEST_NLOCKS);
787 request->hash = mgr_gethash(requestmgr);
993 request->hash = mgr_gethash(requestmgr);
1146 LOCK(&request->requestmgr->locks[request->hash]);
1151 UNLOCK(&request->requestmgr->locks[request->hash]);
1162 LOCK(&request->requestmgr->locks[request->hash]);
[all...]
H A Dview.c24 #include <isc/hash.h>
1358 isc_uint32_t hash; local
1368 for (hash = 0; hash < DNS_VIEW_DELONLYHASH; hash++)
1369 ISC_LIST_INIT(view->delonly[hash]);
1371 hash = dns_name_hash(name, ISC_FALSE) % DNS_VIEW_DELONLYHASH;
1372 new = ISC_LIST_HEAD(view->delonly[hash]);
1383 ISC_LIST_APPEND(view->delonly[hash], new, link);
1393 isc_uint32_t hash; local
1427 isc_uint32_t hash; local
[all...]
H A Drbt.c757 unsigned int hash; local
760 * If there is no hash table, hashing can't be done.
792 hash = dns_name_fullhash(&hash_name, ISC_FALSE);
797 for (hnode = rbt->hashtable[hash % rbt->hashsize];
803 if (hash != HASHVAL(hnode))
839 * All of the labels have been tried against the hash
1492 unsigned int hash; local
1496 hash = HASHVAL(node) % rbt->hashsize;
1497 HASHNEXT(node) = rbt->hashtable[hash];
1499 rbt->hashtable[hash]
1523 unsigned int hash; local
[all...]
/bind-9.6-ESV-R11/lib/dns/include/dns/
H A Dnsec3.h34 * hash = 1, flags =1, iterations = 2, salt length = 1, salt = 255 (max)
35 * hash length = 1, hash = 255 (max), bitmap = 8192 + 512 (max)
39 * hash = 1, flags = 1, iterations = 2, salt length = 1, salt = 255 (max)
88 * the raw hash is stored there.
92 dns_nsec3_hashlength(dns_hash_t hash);
94 * Return the length of the hash produced by the specified algorithm
99 dns_nsec3_supportedhash(dns_hash_t hash);
101 * Return whether we support this hash algorithm or not.
H A Ddb.h152 dns_hash_t *hash,
1371 dns_hash_t *hash, isc_uint8_t *flags,
/bind-9.6-ESV-R11/lib/dns/tests/
H A Ddnstest.h25 #include <isc/hash.h>
/bind-9.6-ESV-R11/lib/isccc/
H A Dsymtab.c139 hash(const char *key, isc_boolean_t case_sensitive) { function
146 * P. J. Weinberger's hash function, adapted from p. 436 of
175 b = hash((k), (s)->case_sensitive) % (s)->size; \
/bind-9.6-ESV-R11/bin/dig/
H A Ddig.c1145 char *hash, *cmd; local
1218 hash = strchr(value, '#');
1219 if (hash != NULL) {
1221 parse_uint(hash + 1,
1223 *hash = '\0';
1233 if (hash != NULL)
1234 *hash = '#';
1237 if (hash != NULL)
1238 *hash = '#';
/bind-9.6-ESV-R11/bin/dnssec/
H A Ddnssec-signzone.c47 #include <isc/hash.h>
636 hashlist_add(hashlist_t *l, const unsigned char *hash, size_t len) argument
648 memmove(l->hashbuf + l->entries * l->length, hash, len);
659 unsigned char hash[NSEC3_MAX_HASH_LENGTH + 1]; local
663 len = isc_iterated_hash(hash, hashalg, iterations, salt, salt_length,
668 fprintf(stderr, "%02x", hash[i]);
671 hash[len++] = speculative ? 1 : 0;
672 hashlist_add(l, hash, len);
713 const unsigned char hash[NSEC3_MAX_HASH_LENGTH])
716 const unsigned char *next = bsearch(hash,
712 hashlist_findnext(const hashlist_t *l, const unsigned char hash[NSEC3_MAX_HASH_LENGTH]) argument
733 hashlist_exists(const hashlist_t *l, const unsigned char hash[NSEC3_MAX_HASH_LENGTH]) argument
2211 unsigned char hash[NSEC3_MAX_HASH_LENGTH]; local
2284 unsigned char hash[NSEC3_MAX_HASH_LENGTH + 1]; local
[all...]

Completed in 433 milliseconds

123