Lines Matching refs:n
128 static struct service_range *service_range_match_first(struct rb_node *n,
135 if (!n || service_range_entry(n)->max < start)
138 while (n) {
139 l = n->rb_left;
145 n = l;
152 sr = service_range_entry(n);
157 r = n->rb_right;
160 n = r;
178 static struct service_range *service_range_match_next(struct rb_node *n, in service_range_match_next() argument
184 while (n) { in service_range_match_next()
185 r = n->rb_right; in service_range_match_next()
197 while ((p = rb_parent(n)) && n == p->rb_right) in service_range_match_next()
198 n = p; in service_range_match_next()
209 n = p; in service_range_match_next()
299 struct rb_node **n, *parent = NULL; in tipc_service_create_range() local
304 n = &sc->ranges.rb_node; in tipc_service_create_range()
305 while (*n) { in tipc_service_create_range()
306 parent = *n; in tipc_service_create_range()
313 n = &parent->rb_left; in tipc_service_create_range()
315 n = &parent->rb_right; in tipc_service_create_range()
325 rb_link_node(&sr->tree_node, parent, n); in tipc_service_create_range()
736 struct rb_node *n; in tipc_nametbl_build_group() local
744 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) { in tipc_nametbl_build_group()
745 sr = container_of(n, struct service_range, tree_node); in tipc_nametbl_build_group()
1033 struct rb_node *n; in __tipc_nl_service_range_list() local
1036 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) { in __tipc_nl_service_range_list()
1037 sr = container_of(n, struct service_range, tree_node); in __tipc_nl_service_range_list()