88 	struct iter_forward_zone* node = (struct iter_forward_zone*)n;  in delfwdnode()  local
89 	fwd_zone_free(node);  in delfwdnode()
114 	struct iter_forward_zone* node = (struct iter_forward_zone*)malloc(  in forwards_insert_data()  local
116 	if(!node) {  in forwards_insert_data()
120 	node->node.key = node;  in forwards_insert_data()
121 	node->dclass = c;  in forwards_insert_data()
122 	node->name = memdup(nm, nmlen);  in forwards_insert_data()
123 	if(!node->name) {  in forwards_insert_data()
125 		free(node);  in forwards_insert_data()
128 	node->namelen = nmlen;  in forwards_insert_data()
129 	node->namelabs = nmlabs;  in forwards_insert_data()
130 	node->dp = dp;  in forwards_insert_data()
131 	if(!rbtree_insert(fwd->tree, &node->node)) {  in forwards_insert_data()
136 		free(node->name);  in forwards_insert_data()
137 		free(node);  in forwards_insert_data()
154 	struct iter_forward_zone* node, *prev = NULL, *p;  in fwd_init_parents()  local
156 	RBTREE_FOR(node, struct iter_forward_zone*, fwd->tree) {  in fwd_init_parents()
157 		node->parent = NULL;  in fwd_init_parents()
158 		if(!prev || prev->dclass != node->dclass) {  in fwd_init_parents()
159 			prev = node;  in fwd_init_parents()
162 		(void)dname_lab_cmp(prev->name, prev->namelabs, node->name,  in fwd_init_parents()
163 			node->namelabs, &m); /* we know prev is smaller */  in fwd_init_parents()
172 				node->parent = p;  in fwd_init_parents()
175 		prev = node;  in fwd_init_parents()
302 	key.node.key = &key;  in fwd_add_stub_hole()
368 	key.node.key = &key;  in forwards_find()
389 	key.node.key = &key;  in forwards_lookup()
452 	key.node.key = &key;  in next_root_locked()
510 	key.node.key = &key;  in fwd_zone_find()
525 		(void)rbtree_delete(fwd->tree, &z->node);  in forwards_add_zone()
548 	(void)rbtree_delete(fwd->tree, &z->node);  in forwards_delete_zone()
588 	(void)rbtree_delete(fwd->tree, &z->node);  in forwards_delete_stub_hole()