Lines Matching defs:node
87 struct iter_forward_zone* node = (struct iter_forward_zone*)n;
88 fwd_zone_free(node);
112 struct iter_forward_zone* node = (struct iter_forward_zone*)malloc(
114 if(!node) {
118 node->node.key = node;
119 node->dclass = c;
120 node->name = memdup(nm, nmlen);
121 if(!node->name) {
123 free(node);
126 node->namelen = nmlen;
127 node->namelabs = nmlabs;
128 node->dp = dp;
129 if(!rbtree_insert(fwd->tree, &node->node)) {
134 free(node->name);
135 free(node);
152 struct iter_forward_zone* node, *prev = NULL, *p;
154 RBTREE_FOR(node, struct iter_forward_zone*, fwd->tree) {
155 node->parent = NULL;
156 if(!prev || prev->dclass != node->dclass) {
157 prev = node;
160 (void)dname_lab_cmp(prev->name, prev->namelabs, node->name,
161 node->namelabs, &m); /* we know prev is smaller */
170 node->parent = p;
173 prev = node;
292 key.node.key = &key;
346 key.node.key = &key;
362 key.node.key = &key;
419 key.node.key = &key;
440 /* not a root node, return next higher item */
464 key.node.key = &key;
476 (void)rbtree_delete(fwd->tree, &z->node);
491 (void)rbtree_delete(fwd->tree, &z->node);
514 (void)rbtree_delete(fwd->tree, &z->node);