Lines Matching defs:node
88 struct iter_forward_zone* node = (struct iter_forward_zone*)n;
89 fwd_zone_free(node);
114 struct iter_forward_zone* node = (struct iter_forward_zone*)malloc(
116 if(!node) {
120 node->node.key = node;
121 node->dclass = c;
122 node->name = memdup(nm, nmlen);
123 if(!node->name) {
125 free(node);
128 node->namelen = nmlen;
129 node->namelabs = nmlabs;
130 node->dp = dp;
131 if(!rbtree_insert(fwd->tree, &node->node)) {
136 free(node->name);
137 free(node);
154 struct iter_forward_zone* node, *prev = NULL, *p;
156 RBTREE_FOR(node, struct iter_forward_zone*, fwd->tree) {
157 node->parent = NULL;
158 if(!prev || prev->dclass != node->dclass) {
159 prev = node;
162 (void)dname_lab_cmp(prev->name, prev->namelabs, node->name,
163 node->namelabs, &m); /* we know prev is smaller */
172 node->parent = p;
175 prev = node;
302 key.node.key = &key;
402 key.node.key = &key;
423 key.node.key = &key;
486 key.node.key = &key;
507 /* not a root node, return next higher item */
544 key.node.key = &key;
559 (void)rbtree_delete(fwd->tree, &z->node);
582 (void)rbtree_delete(fwd->tree, &z->node);
622 (void)rbtree_delete(fwd->tree, &z->node);