Searched refs:node_num (Results 1 - 6 of 6) sorted by relevance

/bind-9.6-ESV-R11/lib/isc/
H A Dradix.c284 if (node->node_num[ISC_IS6(prefix->family)] != -1 &&
286 (*target)->node_num[ISC_IS6(tfamily)] >
287 node->node_num[ISC_IS6(prefix->family)])) {
329 node->node_num[0] = node->node_num[1] = -1;
343 * the node_num values consistent, the calling
348 if (source->node_num[0] != -1)
349 node->node_num[0] = radix->num_added_node +
350 source->node_num[0];
351 if (source->node_num[
[all...]
/bind-9.6-ESV-R11/lib/dns/
H A Diptable.c147 if (node->node_num[0] > max_node)
148 max_node = node->node_num[0];
149 if (node->node_num[1] > max_node)
150 max_node = node->node_num[1];
H A Dacl.c226 match_num = node->node_num[ISC_IS6(family)];
233 /* Now search non-radix elements for a match with a lower node_num. */
238 if (match_num != -1 && match_num < e->node_num) {
245 if (match_num == -1 || e->node_num < match_num) {
247 *match = -e->node_num;
249 *match = e->node_num;
301 * Now copy in the new elements, increasing their node_num
309 if (source->elements[i].node_num > max_node)
310 max_node = source->elements[i].node_num;
316 dest->elements[nelem + i].node_num
[all...]
/bind-9.6-ESV-R11/lib/dns/include/dns/
H A Dacl.h70 int node_num; member in struct:dns_aclelement
/bind-9.6-ESV-R11/lib/isc/include/isc/
H A Dradix.h84 * disambiguate between them, node_num and data are two-element arrays;
85 * node_num[0] and data[0] are used for IPv4 addresses, node_num[1]
98 int node_num[2]; /* which node this was in the tree, member in struct:isc_radix_node
/bind-9.6-ESV-R11/lib/isccfg/
H A Daclconf.c433 de->node_num = dacl->node_count;

Completed in 14 milliseconds