Searched refs:node_num (Results 1 – 14 of 14) sorted by relevance
278 if (node->node_num[fam] != -1 && in isc_radix_search()280 (*target)->node_num[tfam] > node->node_num[fam])) in isc_radix_search()322 node->node_num[i] = -1; in isc_radix_insert()343 if (source->node_num[i] != -1) { in isc_radix_insert()344 node->node_num[i] = in isc_radix_insert()346 source->node_num[i]; in isc_radix_insert()355 node->node_num[i] = next; in isc_radix_insert()358 node->node_num[ISC_RADIX_FAMILY(prefix)] = next; in isc_radix_insert()429 if (node->node_num[i] == -1 && in isc_radix_insert()430 source->node_num[i] != -1) in isc_radix_insert()[all …]
272 if (node->node_num[fam] != -1 && in isc_radix_search() 274 (*target)->node_num[tfam] > node->node_num[fam])) in isc_radix_search() 316 node->node_num[i] = -1; in isc_radix_insert() 331 * the node_num values consistent, the calling in isc_radix_insert() 337 if (source->node_num[i] != -1) { in isc_radix_insert() 338 node->node_num[i] = in isc_radix_insert() 340 source->node_num[i]; in isc_radix_insert() 349 node->node_num[i] = next; in isc_radix_insert() 352 node->node_num[ISC_RADIX_FAMIL in isc_radix_insert() [all...]
210 match_num = node->node_num[fam]; in dns_acl_match()225 if (match_num != -1 && match_num < e->node_num) { in dns_acl_match()231 if (match_num == -1 || e->node_num < match_num) { in dns_acl_match()233 *match = -e->node_num; in dns_acl_match()235 *match = e->node_num; in dns_acl_match()295 if (source->elements[i].node_num > max_node) { in dns_acl_merge()296 max_node = source->elements[i].node_num; in dns_acl_merge()303 dest->elements[nelem + i].node_num = in dns_acl_merge()304 source->elements[i].node_num + dns_acl_node_count(dest); in dns_acl_merge()
135 if (node->node_num[i] > max_node) { in dns_iptable_merge()136 max_node = node->node_num[i]; in dns_iptable_merge()
186 match_num = node->node_num[fam]; in dns_acl_match() 196 /* Now search non-radix elements for a match with a lower node_num. */ in dns_acl_match() 201 if (match_num != -1 && match_num < e->node_num) { in dns_acl_match() 207 if (match_num == -1 || e->node_num < match_num) { in dns_acl_match() 209 *match = -e->node_num; in dns_acl_match() 211 *match = e->node_num; in dns_acl_match() 298 * Now copy in the new elements, increasing their node_num306 if (source->elements[i].node_num > max_node) {307 max_node = source->elements[i].node_num;314 dest->elements[nelem + i].node_num in dns_acl_merge() [all...]
121 if (node->node_num[i] > max_node) { in dns_iptable_merge() 122 max_node = node->node_num[i]; in dns_iptable_merge()
83 de->node_num = dns_acl_node_count(geoip); in ISC_RUN_TEST_IMPL()
75 int node_num; member
99 int node_num[RADIX_FAMILIES]; /* which node member
75 * disambiguate between them, node_num and data are two-element arrays:77 * - node_num[0] and data[0] are used for IPv4 client addresses78 * - node_num[1] and data[1] are used for IPv6 client addresses98 int node_num[RADIX_FAMILIES]; /* which node member
82 int node_num;83 int node_num; global() member
969 de->node_num = dns_acl_node_count(dacl); in cfg_acl_fromconfig2()
920 de->node_num = dns_acl_node_count(dacl); in cfg_acl_fromconfig2()
1990 unsigned int node_num ; /* node is equal to that one */ member