Lines Matching defs:asext_tree

71 struct lsa_tree		 asext_tree;
145 	lsa_init(&asext_tree);
224 	for (v = RB_MIN(lsa_tree, &asext_tree); v != NULL; v = nv) {
225 		nv = RB_NEXT(lsa_tree, &asext_tree, v);
582 				lsa_dump(&asext_tree, imsg.hdr.type,
590 						lsa_dump(&asext_tree,
861 	RB_FOREACH(v, lsa_tree, &asext_tree) {
1147 RB_HEAD(asext_tree, asext_node)		ast;
1148 RB_PROTOTYPE(asext_tree, asext_node, entry, asext_compare)
1149 RB_GENERATE(asext_tree, asext_node, entry, asext_compare)
1173 	return (RB_FIND(asext_tree, &ast, &a));
1214 		RB_INSERT(asext_tree, &ast, an);
1252 				RB_REMOVE(asext_tree, &ast, an);
1308 	RB_REMOVE(asext_tree, &ast, an);
1317 	for (an = RB_MIN(asext_tree, &ast); an != NULL; an = nan) {
1318 		nan = RB_NEXT(asext_tree, &ast, an);
1319 		RB_REMOVE(asext_tree, &ast, an);