Lines Matching refs:node
68 isc_radix_node_t *node = NULL;
76 result = isc_radix_insert(tab->radix, &node, NULL, &pfx);
82 /* If a node already contains data, don't overwrite it */
88 if (node->data[0] == NULL)
89 node->data[0] = &dns_iptable_pos;
90 if (node->data[1] == NULL)
91 node->data[1] = &dns_iptable_pos;
93 if (node->data[0] == NULL)
94 node->data[0] = &dns_iptable_neg;
95 if (node->data[1] == NULL)
96 node->data[1] = &dns_iptable_neg;
100 if (node->data[ISC_IS6(family)] == NULL) {
102 node->data[ISC_IS6(family)] = &dns_iptable_pos;
104 node->data[ISC_IS6(family)] = &dns_iptable_neg;
119 isc_radix_node_t *node, *new_node;
122 RADIX_WALK (source->radix->head, node) {
124 result = isc_radix_insert (tab->radix, &new_node, node, NULL);
131 * reverse the sense of every node. However, this
132 * could lead to a negative node in a nested ACL
138 if (node->data[0] &&
139 *(isc_boolean_t *) node->data[0] == ISC_TRUE)
142 if (node->data[1] &&
143 *(isc_boolean_t *) node->data[1] == ISC_TRUE)
147 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];