77 	struct rb_root ranges;  member
131 	service->ranges = RB_ROOT;  in tipc_service_create()
146 	struct rb_node *n = sc->ranges.rb_node;  in tipc_service_first_range()
166 	struct rb_node *n = sc->ranges.rb_node;  in tipc_service_find_range()
191 	n = &sc->ranges.rb_node;  in tipc_service_create_range()
215 	rb_insert_color(&sr->tree_node, &sc->ranges);  in tipc_service_create_range()
305 	for (n = rb_first(&service->ranges); n; n = rb_next(n)) {  in tipc_service_subscribe()
393 		rb_erase(&sr->tree_node, &sc->ranges);  in tipc_nametbl_remove_publ()
398 	if (RB_EMPTY_ROOT(&sc->ranges) && list_empty(&sc->subscriptions)) {  in tipc_nametbl_remove_publ()
529 	for (n = rb_first(&sc->ranges); n; n = rb_next(n)) {  in tipc_nametbl_mc_lookup()
564 	for (n = rb_first(&sc->ranges); n; n = rb_next(n)) {  in tipc_nametbl_lookup_dst_nodes()
595 	for (n = rb_first(&sc->ranges); n; n = rb_next(n)) {  in tipc_nametbl_build_group()
723 	if (RB_EMPTY_ROOT(&sc->ranges) && list_empty(&sc->subscriptions)) {  in tipc_nametbl_unsubscribe()
762 	rbtree_postorder_for_each_entry_safe(sr, tmpr, &sc->ranges, tree_node) {  in tipc_service_delete()
767 		rb_erase(&sr->tree_node, &sc->ranges);  in tipc_service_delete()
881 	for (n = rb_first(&sc->ranges); n; n = rb_next(n)) {  in __tipc_nl_service_range_list()