75 	node->parent_edge = edge;  in edge_create()
103 	node->parent_edge = NULL;  in node_create()
117 	return sizeof *n + sizeof *n->parent_edge + n->parent_edge->len +   in node_size()
217 	struct addredge *parent_edge, *child_edge = NULL;  in purge_node()  local
222 	parent_edge = node->parent_edge;  in purge_node()
223 	if (keep || !parent_edge) return;  in purge_node()
225 	index = parent_edge->parent_index;  in purge_node()
228 		child_edge->parent_node  = parent_edge->parent_node;  in purge_node()
231 	parent_edge->parent_node->edge[index] = child_edge;  in purge_node()
233 	free(parent_edge->str);  in purge_node()
234 	free(parent_edge);  in purge_node()
255 		if (children == 2 || !n->parent_edge) {  in lru_cleanup()
259 		p = n->parent_edge->parent_node;  in lru_cleanup()
265 		if (!p->elem && children == 1 && p->parent_edge) {  in lru_cleanup()
288 		free(n->parent_edge->str);  in addrtree_delete()
289 		free(n->parent_edge);  in addrtree_delete()