Searched refs:entries (Results 1 - 10 of 10) sorted by relevance

/bind-9.11.3/contrib/idn/idnkit-1.0-src/lib/
H A Ducsmap.c82 * Since the entries pointed by ucsmap_hash_t.entry are sorted,
103 ucsmap_entry_t *entries; /* array of entries */ member in struct:idn_ucsmap
105 size_t nentries; /* # of entries in use */
135 ctx->entries = NULL;
152 if (ctx->entries != NULL)
153 free(ctx->entries);
196 newbuf = realloc(ctx->entries, sizeof(*e) * ctx->entry_size);
199 ctx->entries = newbuf;
201 e = &ctx->entries[ct
[all...]
H A Dstrhash.c261 strhash_entry_t *entries = old_bins[old_index]; local
263 while (entries != NULL) {
264 strhash_entry_t *e = entries;
267 entries = entries->next;
/bind-9.11.3/lib/dns/
H A Dcatz.c46 /* key in entries is 'mhash', not domain name! */
47 isc_ht_t *entries; member in struct:dns_catz_zone
278 /* If one is NULL and the other isn't, the entries don't match */
366 result = isc_ht_iter_create(newzone->entries, &iter1);
370 result = isc_ht_iter_create(target->entries, &iter2);
425 result = isc_ht_find(target->entries, key,
454 result = isc_ht_delete(target->entries, key,
462 * Then - walk the old zone; only deleted entries should remain.
483 /* At this moment target->entries has to be be empty. */
484 INSIST(isc_ht_count(target->entries)
[all...]
H A Dacache.c70 * CLEANERINCREMENT is how many entries are examined in one pass.
75 #define DNS_ACACHE_CLEANERINCREMENT 1000 /* Number of entries. */
161 int increment; /* Number of entries to
164 unsigned long ncleaned; /* Number of entries cleaned
204 ISC_LIST(dns_acacheentry_t) entries;
225 /* Data for Management of cache entries */
301 if (ISC_LIST_EMPTY(acache->entries) && acache->dbentries == 0) {
319 * Release the dependency of all entries, and detach them.
321 for (entry = ISC_LIST_HEAD(acache->entries);
334 ISC_LIST_UNLINK(acache->entries, entr
[all...]
H A Dadb.c59 * For type 3 negative cache entries, we will remember that the address is
136 * Bucketized locks and lists for entries.
143 dns_adbentrylist_t *entries; member in struct:dns_adb
271 * persist until that time. This allows entries found
371 * Private flag(s) for entries.
540 * no longer grow beyond 2^28 entries.)
619 * Move entries to new arrays.
622 e = ISC_LIST_HEAD(adb->entries[i]);
624 ISC_LIST_UNLINK(adb->entries[i], e, plink);
631 e = ISC_LIST_HEAD(adb->entries[
[all...]
H A Drrl.c150 * All entries older than DNS_RRL_MAX_WINDOW seconds are ancient,
156 * This loop is almost always very short because most entries are
157 * recycled after one second and any entries that need to be marked
172 "rrl new time base scanned %d entries"
218 "increase from %d to %d RRL entries with"
229 "isc_mem_get(%d) failed for RRL entries",
236 e = b->entries;
317 " %d entries; average search length %.1f",
535 * Discard prevous hash table when all of its entries are old.
547 * Keep currently penalized and logged entries
[all...]
/bind-9.11.3/contrib/dlz/drivers/
H A Ddlz_ldap_driver.c345 "LDAP no entries to process.");
349 /* loop through all entries returned */
568 int entries; local
801 entries = ldap_count_entries((LDAP *) dbi->dbconn, ldap_msg);
802 if (entries == 0)
804 else if (entries > 0)
810 entries = ldap_count_entries((LDAP *) dbi->dbconn, ldap_msg);
811 if (entries == 0)
813 else if (entries > 0)
/bind-9.11.3/contrib/dlz/modules/ldap/
H A Ddlz_ldap_dynamic.c331 db->log(ISC_LOG_INFO, "LDAP no entries to process.");
335 /* loop through all entries returned */
544 int entries; local
748 entries = ldap_count_entries((LDAP *) dbi->dbconn, ldap_msg);
749 if (entries == 0)
751 else if (entries > 0)
757 entries = ldap_count_entries((LDAP *) dbi->dbconn, ldap_msg);
758 if (entries == 0)
760 else if (entries > 0)
/bind-9.11.3/lib/dns/include/dns/
H A Drrl.h100 * This should be small to limit the total size of the table of entries.
157 * A hash table of rate-limit entries.
167 * A block of rate-limit entries.
173 dns_rrl_entry_t entries[1]; member in struct:dns_rrl_block
/bind-9.11.3/bin/dnssec/
H A Ddnssec-signzone.c697 size_t entries; member in struct:hashlist
705 l->entries = 0;
724 l->entries = 0;
736 if (l->entries == l->size) {
742 memset(l->hashbuf + l->entries * l->length, 0, l->length);
743 memmove(l->hashbuf + l->entries * l->length, hash, len);
744 l->entries++;
778 qsort(l->hashbuf, l->entries, l->length, hashlist_comp);
785 size_t entries = l->entries; local
811 size_t entries = l->entries; local
[all...]

Completed in 47 milliseconds