Lines Matching defs: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 */
87 if (node->data[i] == NULL)
88 node->data[i] = pos ? &dns_iptable_pos
94 if (node->data[offset] == NULL) {
95 node->data[offset] = pos ? &dns_iptable_pos
111 isc_radix_node_t *node, *new_node;
114 RADIX_WALK (source->radix->head, node) {
116 result = isc_radix_insert (tab->radix, &new_node, node, NULL);
123 * reverse the sense of every node. However, this
124 * could lead to a negative node in a nested ACL
131 if (node->data[i] &&
132 *(isc_boolean_t *) node->data[i])
135 if (node->node_num[i] > max_node)
136 max_node = node->node_num[i];