Searched refs:nodes (Results 1 - 9 of 9) sorted by relevance

/bind-9.11.3/lib/dns/
H A Dmasterdump.c230 unsigned int nodes; member in struct:dns_dumpctx
1460 dctx->nodes = 0;
1624 unsigned int nodes; local
1659 nodes = dctx->nodes;
1661 while (result == ISC_R_SUCCESS && (dctx->nodes == 0 || nodes--)) {
1696 * Work out how many nodes can be written in the time between
1698 * use it as a estimate for the number of nodes to be written in the
1701 if (dctx->nodes !
[all...]
H A Dacl.c320 int max_node = 0, nodes; local
405 nodes = max_node + dest->node_count;
409 if (nodes > dest->node_count)
410 dest->node_count = nodes;
577 * Called via isc_radix_process() to find IP table nodes that are
H A Decdb.c35 * scalability in terms of the number of nodes.
45 ISC_LIST(struct dns_ecdbnode) nodes; member in struct:dns_ecdb
194 if (ecdb->references == 0 && ISC_LIST_EMPTY(ecdb->nodes))
232 ISC_LIST_UNLINK(ecdb->nodes, node, link);
233 if (ecdb->references == 0 && ISC_LIST_EMPTY(ecdb->nodes))
375 ISC_LIST_APPEND(ecdb->nodes, node, link);
632 ISC_LIST_INIT(ecdb->nodes);
H A Drbt.c121 * out the nodes, reserving space as we go, correcting addresses to point
409 size_t nodes = 1; local
414 nodes++;
418 return (nodes);
596 * nodes out in list order (which we currently do.)
738 /* Serialize nodes */
1178 * 2. Our RBT nodes contain not only single labels but label
1621 * Walk all the nodes in the hash bucket pointed
1734 * downward search when certain special nodes
2646 * Swap the two nodes; i
[all...]
H A Drbtdb.c658 /* Locks the tree structure (prevents nodes appearing/disappearing) */
660 /* Locks for individual tree nodes */
689 * Temporary storage for stale cache nodes and dynamically deleted
690 * nodes that await being cleaned up.
1152 * Work out how many nodes can be deleted in the time between two
1154 * as a estimate for the number of nodes to be deleted in the next
1163 unsigned int nodes; local
1176 * Double the nodes deleted next time.
1183 nodes = old * interval;
1184 nodes /
[all...]
H A Dzone.c353 isc_uint32_t nodes; member in struct:dns_zone
670 * a NSEC3 chain only the non-NSEC3 nodes will be iterated. If we are
671 * removing a NSEC3 chain then both NSEC3 and non-NSEC3 nodes will be
1042 zone->nodes = 100;
4484 "number of nodes in database: %u",
7396 isc_uint32_t nodes; local
7479 * We keep pulling nodes off each iterator in turn until
7480 * we have no more nodes to pull off or we reach the limits
7483 nodes = zone->nodes;
8299 isc_uint32_t nodes; local
17269 dns_zone_setnodes(dns_zone_t *zone, isc_uint32_t nodes) argument
[all...]
/bind-9.11.3/lib/dns/include/dns/
H A Dzone.h2126 dns_zone_setnodes(dns_zone_t *zone, isc_uint32_t nodes);
2128 * Set the number of nodes that will be checked per quantum.
/bind-9.11.3/bin/dnssec/
H A Ddnssec-signzone.c703 hashlist_init(hashlist_t *l, unsigned int nodes, unsigned int length) { argument
708 if (nodes != 0) {
709 l->size = nodes;
1473 * For NSEC zones nodes with zone data have NSEC records.
1474 * For NSEC3 zones the NSEC3 nodes are zone data but
2299 * Add hashs for empty nodes. Use closest encloser logic.
2430 * Add NSEC3's for empty nodes. Use closest encloser logic.
/bind-9.11.3/bin/named/
H A Dserver.c13202 isc_uint32_t serial, signed_serial, nodes; local
13280 nodes = dns_db_nodecount(hasraw ? rawdb : db);
13281 snprintf(nodebuf, sizeof(nodebuf), "%u", nodes);

Completed in 6705 milliseconds