2 * net/tipc/name_table.c: TIPC name table code
4 * Copyright (c) 2000-2006, 2014-2018, Ericsson AB
5 * Copyright (c) 2004-2008, 2010-2014, Wind River Systems
6 * Copyright (c) 2020-2021, Red Hat Inc
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the names of the copyright holders nor the names of its
18 * contributors may be used to endorse or promote products derived from
19 * this software without specific prior written permission.
21 * Alternatively, this software may be distributed under the terms of the
22 * GNU General Public License ("GPL") version 2 as published by the Free
23 * Software Foundation.
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
26 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
29 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 * POSSIBILITY OF SUCH DAMAGE.
39 #include <linux/list_sort.h>
40 #include <linux/rbtree_augmented.h>
43 #include "name_table.h"
44 #include "name_distr.h"
52 * struct service_range - container for all bindings of a service range
53 * @lower: service range lower bound
54 * @upper: service range upper bound
55 * @tree_node: member of service range RB tree
56 * @max: largest 'upper' in this node subtree
57 * @local_publ: list of identical publications made from this node
58 * Used by closest_first lookup and multicast lookup algorithm
59 * @all_publ: all publications identical to this one, whatever node and scope
60 * Used by round-robin lookup algorithm
62 struct service_range {
65 struct rb_node tree_node;
67 struct list_head local_publ;
68 struct list_head all_publ;
72 * struct tipc_service - container for all published instances of a service type
73 * @type: 32 bit 'type' value for service
74 * @publ_cnt: increasing counter for publications in this service
75 * @ranges: rb tree containing all service ranges for this service
76 * @service_list: links to adjacent name ranges in hash chain
77 * @subscriptions: list of subscriptions for this service type
78 * @lock: spinlock controlling access to pertaining service ranges/publications
79 * @rcu: RCU callback head used for deferred freeing
84 struct rb_root ranges;
85 struct hlist_node service_list;
86 struct list_head subscriptions;
87 spinlock_t lock; /* Covers service range list */
91 #define service_range_upper(sr) ((sr)->upper)
92 RB_DECLARE_CALLBACKS_MAX(static, sr_callbacks,
93 struct service_range, tree_node, u32, max,
96 #define service_range_entry(rbtree_node) \
97 (container_of(rbtree_node, struct service_range, tree_node))
99 #define service_range_overlap(sr, start, end) \
100 ((sr)->lower <= (end) && (sr)->upper >= (start))
103 * service_range_foreach_match - iterate over tipc service rbtree for each
105 * @sr: the service range pointer as a loop cursor
106 * @sc: the pointer to tipc service which holds the service range rbtree
107 * @start: beginning of the search range (end >= start) for matching
108 * @end: end of the search range (end >= start) for matching
110 #define service_range_foreach_match(sr, sc, start, end) \
111 for (sr = service_range_match_first((sc)->ranges.rb_node, \
115 sr = service_range_match_next(&(sr)->tree_node, \
120 * service_range_match_first - find first service range matching a range
121 * @n: the root node of service range rbtree for searching
122 * @start: beginning of the search range (end >= start) for matching
123 * @end: end of the search range (end >= start) for matching
125 * Return: the leftmost service range node in the rbtree that overlaps the
126 * specific range if any. Otherwise, returns NULL.
128 static struct service_range *service_range_match_first(struct rb_node *n,
131 struct service_range *sr;
132 struct rb_node *l, *r;
134 /* Non overlaps in tree at all? */
135 if (!n || service_range_entry(n)->max < start)
140 if (l && service_range_entry(l)->max >= start) {
141 /* A leftmost overlap range node must be one in the left
142 * subtree. If not, it has lower > end, then nodes on
143 * the right side cannot satisfy the condition either.
149 /* No one in the left subtree can match, return if this node is
150 * an overlap i.e. leftmost.
152 sr = service_range_entry(n);
153 if (service_range_overlap(sr, start, end))
156 /* Ok, try to lookup on the right side */
158 if (sr->lower <= end &&
159 r && service_range_entry(r)->max >= start) {
170 * service_range_match_next - find next service range matching a range
171 * @n: a node in service range rbtree from which the searching starts
172 * @start: beginning of the search range (end >= start) for matching
173 * @end: end of the search range (end >= start) for matching
175 * Return: the next service range node to the given node in the rbtree that
176 * overlaps the specific range if any. Otherwise, returns NULL.
178 static struct service_range *service_range_match_next(struct rb_node *n,
181 struct service_range *sr;
182 struct rb_node *p, *r;
186 if (r && service_range_entry(r)->max >= start)
187 /* A next overlap range node must be one in the right
188 * subtree. If not, it has lower > end, then any next
189 * successor (- an ancestor) of this node cannot
190 * satisfy the condition either.
192 return service_range_match_first(r, start, end);
194 /* No one in the right subtree can match, go up to find an
195 * ancestor of this node which is parent of a left-hand child.
197 while ((p = rb_parent(n)) && n == p->rb_right)
202 /* Return if this ancestor is an overlap */
203 sr = service_range_entry(p);
204 if (service_range_overlap(sr, start, end))
207 /* Ok, try to lookup more from this ancestor */
208 if (sr->lower <= end) {
218 static int hash(int x)
220 return x & (TIPC_NAMETBL_SIZE - 1);
224 * tipc_publ_create - create a publication structure
225 * @ua: the service range the user is binding to
226 * @sk: the address of the socket that is bound
227 * @key: publication key
229 static struct publication *tipc_publ_create(struct tipc_uaddr *ua,
230 struct tipc_socket_addr *sk,
233 struct publication *p = kzalloc(sizeof(*p), GFP_ATOMIC);
240 p->scope = ua->scope;
242 INIT_LIST_HEAD(&p->binding_sock);
243 INIT_LIST_HEAD(&p->binding_node);
244 INIT_LIST_HEAD(&p->local_publ);
245 INIT_LIST_HEAD(&p->all_publ);
246 INIT_LIST_HEAD(&p->list);
251 * tipc_service_create - create a service structure for the specified 'type'
252 * @type: service type
253 * @hd: name_table services list
255 * Allocates a single range structure and sets it to all 0's.
257 static struct tipc_service *tipc_service_create(u32 type, struct hlist_head *hd)
259 struct tipc_service *service = kzalloc(sizeof(*service), GFP_ATOMIC);
262 pr_warn("Service creation failed, no memory\n");
266 spin_lock_init(&service->lock);
267 service->type = type;
268 service->ranges = RB_ROOT;
269 INIT_HLIST_NODE(&service->service_list);
270 INIT_LIST_HEAD(&service->subscriptions);
271 hlist_add_head_rcu(&service->service_list, hd);
275 /* tipc_service_find_range - find service range matching publication parameters
277 static struct service_range *tipc_service_find_range(struct tipc_service *sc,
278 struct tipc_uaddr *ua)
280 struct service_range *sr;
282 service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) {
283 /* Look for exact match */
284 if (sr->lower == ua->sr.lower && sr->upper == ua->sr.upper)
291 static struct service_range *tipc_service_create_range(struct tipc_service *sc,
292 struct publication *p)
294 struct rb_node **n, *parent = NULL;
295 struct service_range *sr;
296 u32 lower = p->sr.lower;
297 u32 upper = p->sr.upper;
299 n = &sc->ranges.rb_node;
302 sr = service_range_entry(parent);
303 if (lower == sr->lower && upper == sr->upper)
307 if (lower <= sr->lower)
308 n = &parent->rb_left;
310 n = &parent->rb_right;
312 sr = kzalloc(sizeof(*sr), GFP_ATOMIC);
318 INIT_LIST_HEAD(&sr->local_publ);
319 INIT_LIST_HEAD(&sr->all_publ);
320 rb_link_node(&sr->tree_node, parent, n);
321 rb_insert_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks);
325 static bool tipc_service_insert_publ(struct net *net,
326 struct tipc_service *sc,
327 struct publication *p)
329 struct tipc_subscription *sub, *tmp;
330 struct service_range *sr;
331 struct publication *_p;
332 u32 node = p->sk.node;
336 spin_lock_bh(&sc->lock);
337 sr = tipc_service_create_range(sc, p);
341 first = list_empty(&sr->all_publ);
343 /* Return if the publication already exists */
344 list_for_each_entry(_p, &sr->all_publ, all_publ) {
345 if (_p->key == p->key && (!_p->sk.node || _p->sk.node == node))
349 if (in_own_node(net, p->sk.node))
350 list_add(&p->local_publ, &sr->local_publ);
351 list_add(&p->all_publ, &sr->all_publ);
352 p->id = sc->publ_cnt++;
354 /* Any subscriptions waiting for notification? */
355 list_for_each_entry_safe(sub, tmp, &sc->subscriptions, service_list) {
356 tipc_sub_report_overlap(sub, p->sr.lower, p->sr.upper,
357 TIPC_PUBLISHED, p->sk.ref, p->sk.node,
363 pr_warn("Failed to bind to %u,%u,%u\n",
364 p->sr.type, p->sr.lower, p->sr.upper);
365 spin_unlock_bh(&sc->lock);
370 * tipc_service_remove_publ - remove a publication from a service
371 * @r: service_range to remove publication from
372 * @sk: address publishing socket
373 * @key: target publication key
375 static struct publication *tipc_service_remove_publ(struct service_range *r,
376 struct tipc_socket_addr *sk,
379 struct publication *p;
382 list_for_each_entry(p, &r->all_publ, all_publ) {
383 if (p->key != key || (node && node != p->sk.node))
385 list_del(&p->all_publ);
386 list_del(&p->local_publ);
393 * Code reused: time_after32() for the same purpose
395 #define publication_after(pa, pb) time_after32((pa)->id, (pb)->id)
396 static int tipc_publ_sort(void *priv, struct list_head *a,
399 struct publication *pa, *pb;
401 pa = container_of(a, struct publication, list);
402 pb = container_of(b, struct publication, list);
403 return publication_after(pa, pb);
407 * tipc_service_subscribe - attach a subscription, and optionally
408 * issue the prescribed number of events if there is any service
409 * range overlapping with the requested range
410 * @service: the tipc_service to attach the @sub to
411 * @sub: the subscription to attach
413 static void tipc_service_subscribe(struct tipc_service *service,
414 struct tipc_subscription *sub)
416 struct tipc_subscr *sb = &sub->evt.s;
417 struct publication *p, *first, *tmp;
418 struct list_head publ_list;
419 struct service_range *sr;
420 struct tipc_service_range r;
423 r.type = tipc_sub_read(sb, seq.type);
424 r.lower = tipc_sub_read(sb, seq.lower);
425 r.upper = tipc_sub_read(sb, seq.upper);
426 filter = tipc_sub_read(sb, filter);
429 list_add(&sub->service_list, &service->subscriptions);
431 if (filter & TIPC_SUB_NO_STATUS)
434 INIT_LIST_HEAD(&publ_list);
435 service_range_foreach_match(sr, service, r.lower, r.upper) {
437 list_for_each_entry(p, &sr->all_publ, all_publ) {
438 if (filter & TIPC_SUB_PORTS)
439 list_add_tail(&p->list, &publ_list);
440 else if (!first || publication_after(first, p))
441 /* Pick this range's *first* publication */
445 list_add_tail(&first->list, &publ_list);
448 /* Sort the publications before reporting */
449 list_sort(NULL, &publ_list, tipc_publ_sort);
450 list_for_each_entry_safe(p, tmp, &publ_list, list) {
451 tipc_sub_report_overlap(sub, p->sr.lower, p->sr.upper,
452 TIPC_PUBLISHED, p->sk.ref, p->sk.node,
454 list_del_init(&p->list);
458 static struct tipc_service *tipc_service_find(struct net *net, u32 type)
460 struct name_table *nt = tipc_name_table(net);
461 struct hlist_head *service_head;
462 struct tipc_service *service;
464 service_head = &nt->services[hash(type)];
465 hlist_for_each_entry_rcu(service, service_head, service_list) {
466 if (service->type == type)
472 struct publication *tipc_nametbl_insert_publ(struct net *net,
473 struct tipc_uaddr *ua,
474 struct tipc_socket_addr *sk,
477 struct name_table *nt = tipc_name_table(net);
478 struct tipc_service *sc;
479 struct publication *p;
480 u32 type = ua->sr.type;
482 p = tipc_publ_create(ua, sk, key);
486 if (ua->sr.lower > ua->sr.upper) {
487 pr_debug("Failed to bind illegal {%u,%u,%u} from node %u\n",
488 type, ua->sr.lower, ua->sr.upper, sk->node);
491 sc = tipc_service_find(net, type);
493 sc = tipc_service_create(type, &nt->services[hash(type)]);
494 if (sc && tipc_service_insert_publ(net, sc, p))
500 struct publication *tipc_nametbl_remove_publ(struct net *net,
501 struct tipc_uaddr *ua,
502 struct tipc_socket_addr *sk,
505 struct tipc_subscription *sub, *tmp;
506 struct publication *p = NULL;
507 struct service_range *sr;
508 struct tipc_service *sc;
509 u32 upper = ua->sr.upper;
510 u32 lower = ua->sr.lower;
513 sc = tipc_service_find(net, ua->sr.type);
517 spin_lock_bh(&sc->lock);
518 sr = tipc_service_find_range(sc, ua);
521 p = tipc_service_remove_publ(sr, sk, key);
525 /* Notify any waiting subscriptions */
526 last = list_empty(&sr->all_publ);
527 list_for_each_entry_safe(sub, tmp, &sc->subscriptions, service_list) {
528 tipc_sub_report_overlap(sub, lower, upper, TIPC_WITHDRAWN,
529 sk->ref, sk->node, ua->scope, last);
532 /* Remove service range item if this was its last publication */
533 if (list_empty(&sr->all_publ)) {
534 rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks);
538 /* Delete service item if this no more publications and subscriptions */
539 if (RB_EMPTY_ROOT(&sc->ranges) && list_empty(&sc->subscriptions)) {
540 hlist_del_init_rcu(&sc->service_list);
544 spin_unlock_bh(&sc->lock);
549 * tipc_nametbl_lookup_anycast - perform service instance to socket translation
550 * @net: network namespace
551 * @ua: service address to look up
552 * @sk: address to socket we want to find
554 * On entry, a non-zero 'sk->node' indicates the node where we want lookup to be
555 * performed, which may not be this one.
557 * - If lookup is deferred to another node, leave 'sk->node' unchanged and
559 * - If lookup is successful, set the 'sk->node' and 'sk->ref' (== portid) which
560 * represent the bound socket and return 'true'.
561 * - If lookup fails, return 'false'
563 * Note that for legacy users (node configured with Z.C.N address format) the
564 * 'closest-first' lookup algorithm must be maintained, i.e., if sk.node is 0
565 * we must look in the local binding list first
567 bool tipc_nametbl_lookup_anycast(struct net *net,
568 struct tipc_uaddr *ua,
569 struct tipc_socket_addr *sk)
571 struct tipc_net *tn = tipc_net(net);
572 bool legacy = tn->legacy_addr_format;
573 u32 self = tipc_own_addr(net);
574 u32 inst = ua->sa.instance;
575 struct service_range *r;
576 struct tipc_service *sc;
577 struct publication *p;
581 if (!tipc_in_scope(legacy, sk->node, self))
585 sc = tipc_service_find(net, ua->sr.type);
589 spin_lock_bh(&sc->lock);
590 service_range_foreach_match(r, sc, inst, inst) {
591 /* Select lookup algo: local, closest-first or round-robin */
592 if (sk->node == self) {
596 p = list_first_entry(l, struct publication, local_publ);
597 list_move_tail(&p->local_publ, &r->local_publ);
598 } else if (legacy && !sk->node && !list_empty(&r->local_publ)) {
600 p = list_first_entry(l, struct publication, local_publ);
601 list_move_tail(&p->local_publ, &r->local_publ);
604 p = list_first_entry(l, struct publication, all_publ);
605 list_move_tail(&p->all_publ, &r->all_publ);
609 /* Todo: as for legacy, pick the first matching range only, a
610 * "true" round-robin will be performed as needed.
614 spin_unlock_bh(&sc->lock);
621 /* tipc_nametbl_lookup_group(): lookup destinaton(s) in a communication group
622 * Returns a list of one (== group anycast) or more (== group multicast)
623 * destination socket/node pairs matching the given address.
624 * The requester may or may not want to exclude himself from the list.
626 bool tipc_nametbl_lookup_group(struct net *net, struct tipc_uaddr *ua,
627 struct list_head *dsts, int *dstcnt,
628 u32 exclude, bool mcast)
630 u32 self = tipc_own_addr(net);
631 u32 inst = ua->sa.instance;
632 struct service_range *sr;
633 struct tipc_service *sc;
634 struct publication *p;
638 sc = tipc_service_find(net, ua->sa.type);
642 spin_lock_bh(&sc->lock);
644 /* Todo: a full search i.e. service_range_foreach_match() instead? */
645 sr = service_range_match_first(sc->ranges.rb_node, inst, inst);
649 list_for_each_entry(p, &sr->all_publ, all_publ) {
650 if (p->scope != ua->scope)
652 if (p->sk.ref == exclude && p->sk.node == self)
654 tipc_dest_push(dsts, p->sk.node, p->sk.ref);
658 list_move_tail(&p->all_publ, &sr->all_publ);
662 spin_unlock_bh(&sc->lock);
665 return !list_empty(dsts);
668 /* tipc_nametbl_lookup_mcast_sockets(): look up node local destinaton sockets
669 * matching the given address
670 * Used on nodes which have received a multicast/broadcast message
671 * Returns a list of local sockets
673 void tipc_nametbl_lookup_mcast_sockets(struct net *net, struct tipc_uaddr *ua,
674 bool exact, struct list_head *dports)
676 struct service_range *sr;
677 struct tipc_service *sc;
678 struct publication *p;
679 u32 scope = ua->scope;
682 sc = tipc_service_find(net, ua->sr.type);
686 spin_lock_bh(&sc->lock);
687 service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) {
688 list_for_each_entry(p, &sr->local_publ, local_publ) {
689 if (p->scope == scope || (!exact && p->scope < scope))
690 tipc_dest_push(dports, 0, p->sk.ref);
693 spin_unlock_bh(&sc->lock);
698 /* tipc_nametbl_lookup_mcast_nodes(): look up all destination nodes matching
699 * the given address. Used in sending node.
700 * Used on nodes which are sending out a multicast/broadcast message
701 * Returns a list of nodes, including own node if applicable
703 void tipc_nametbl_lookup_mcast_nodes(struct net *net, struct tipc_uaddr *ua,
704 struct tipc_nlist *nodes)
706 struct service_range *sr;
707 struct tipc_service *sc;
708 struct publication *p;
711 sc = tipc_service_find(net, ua->sr.type);
715 spin_lock_bh(&sc->lock);
716 service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) {
717 list_for_each_entry(p, &sr->all_publ, all_publ) {
718 tipc_nlist_add(nodes, p->sk.node);
721 spin_unlock_bh(&sc->lock);
726 /* tipc_nametbl_build_group - build list of communication group members
728 void tipc_nametbl_build_group(struct net *net, struct tipc_group *grp,
731 struct service_range *sr;
732 struct tipc_service *sc;
733 struct publication *p;
737 sc = tipc_service_find(net, type);
741 spin_lock_bh(&sc->lock);
742 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) {
743 sr = container_of(n, struct service_range, tree_node);
744 list_for_each_entry(p, &sr->all_publ, all_publ) {
745 if (p->scope != scope)
747 tipc_group_add_member(grp, p->sk.node, p->sk.ref, p->sr.lower);
750 spin_unlock_bh(&sc->lock);
755 /* tipc_nametbl_publish - add service binding to name table
757 struct publication *tipc_nametbl_publish(struct net *net, struct tipc_uaddr *ua,
758 struct tipc_socket_addr *sk, u32 key)
760 struct name_table *nt = tipc_name_table(net);
761 struct tipc_net *tn = tipc_net(net);
762 struct publication *p = NULL;
763 struct sk_buff *skb = NULL;
766 spin_lock_bh(&tn->nametbl_lock);
768 if (nt->local_publ_count >= TIPC_MAX_PUBL) {
769 pr_warn("Bind failed, max limit %u reached\n", TIPC_MAX_PUBL);
773 p = tipc_nametbl_insert_publ(net, ua, sk, key);
775 nt->local_publ_count++;
776 skb = tipc_named_publish(net, p);
778 rc_dests = nt->rc_dests;
780 spin_unlock_bh(&tn->nametbl_lock);
783 tipc_node_broadcast(net, skb, rc_dests);
789 * tipc_nametbl_withdraw - withdraw a service binding
790 * @net: network namespace
791 * @ua: service address/range being unbound
792 * @sk: address of the socket being unbound from
793 * @key: target publication key
795 void tipc_nametbl_withdraw(struct net *net, struct tipc_uaddr *ua,
796 struct tipc_socket_addr *sk, u32 key)
798 struct name_table *nt = tipc_name_table(net);
799 struct tipc_net *tn = tipc_net(net);
800 struct sk_buff *skb = NULL;
801 struct publication *p;
804 spin_lock_bh(&tn->nametbl_lock);
806 p = tipc_nametbl_remove_publ(net, ua, sk, key);
808 nt->local_publ_count--;
809 skb = tipc_named_withdraw(net, p);
810 list_del_init(&p->binding_sock);
813 pr_err("Failed to remove local publication {%u,%u,%u}/%u\n",
814 ua->sr.type, ua->sr.lower, ua->sr.upper, key);
816 rc_dests = nt->rc_dests;
817 spin_unlock_bh(&tn->nametbl_lock);
820 tipc_node_broadcast(net, skb, rc_dests);
824 * tipc_nametbl_subscribe - add a subscription object to the name table
825 * @sub: subscription to add
827 bool tipc_nametbl_subscribe(struct tipc_subscription *sub)
829 struct name_table *nt = tipc_name_table(sub->net);
830 struct tipc_net *tn = tipc_net(sub->net);
831 struct tipc_subscr *s = &sub->evt.s;
832 u32 type = tipc_sub_read(s, seq.type);
833 struct tipc_service *sc;
836 spin_lock_bh(&tn->nametbl_lock);
837 sc = tipc_service_find(sub->net, type);
839 sc = tipc_service_create(type, &nt->services[hash(type)]);
841 spin_lock_bh(&sc->lock);
842 tipc_service_subscribe(sc, sub);
843 spin_unlock_bh(&sc->lock);
845 pr_warn("Failed to subscribe for {%u,%u,%u}\n", type,
846 tipc_sub_read(s, seq.lower),
847 tipc_sub_read(s, seq.upper));
850 spin_unlock_bh(&tn->nametbl_lock);
855 * tipc_nametbl_unsubscribe - remove a subscription object from name table
856 * @sub: subscription to remove
858 void tipc_nametbl_unsubscribe(struct tipc_subscription *sub)
860 struct tipc_net *tn = tipc_net(sub->net);
861 struct tipc_subscr *s = &sub->evt.s;
862 u32 type = tipc_sub_read(s, seq.type);
863 struct tipc_service *sc;
865 spin_lock_bh(&tn->nametbl_lock);
866 sc = tipc_service_find(sub->net, type);
870 spin_lock_bh(&sc->lock);
871 list_del_init(&sub->service_list);
874 /* Delete service item if no more publications and subscriptions */
875 if (RB_EMPTY_ROOT(&sc->ranges) && list_empty(&sc->subscriptions)) {
876 hlist_del_init_rcu(&sc->service_list);
879 spin_unlock_bh(&sc->lock);
881 spin_unlock_bh(&tn->nametbl_lock);
884 int tipc_nametbl_init(struct net *net)
886 struct tipc_net *tn = tipc_net(net);
887 struct name_table *nt;
890 nt = kzalloc(sizeof(*nt), GFP_KERNEL);
894 for (i = 0; i < TIPC_NAMETBL_SIZE; i++)
895 INIT_HLIST_HEAD(&nt->services[i]);
897 INIT_LIST_HEAD(&nt->node_scope);
898 INIT_LIST_HEAD(&nt->cluster_scope);
899 rwlock_init(&nt->cluster_scope_lock);
901 spin_lock_init(&tn->nametbl_lock);
906 * tipc_service_delete - purge all publications for a service and delete it
907 * @net: the associated network namespace
908 * @sc: tipc_service to delete
910 static void tipc_service_delete(struct net *net, struct tipc_service *sc)
912 struct service_range *sr, *tmpr;
913 struct publication *p, *tmp;
915 spin_lock_bh(&sc->lock);
916 rbtree_postorder_for_each_entry_safe(sr, tmpr, &sc->ranges, tree_node) {
917 list_for_each_entry_safe(p, tmp, &sr->all_publ, all_publ) {
918 tipc_service_remove_publ(sr, &p->sk, p->key);
921 rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks);
924 hlist_del_init_rcu(&sc->service_list);
925 spin_unlock_bh(&sc->lock);
929 void tipc_nametbl_stop(struct net *net)
931 struct name_table *nt = tipc_name_table(net);
932 struct tipc_net *tn = tipc_net(net);
933 struct hlist_head *service_head;
934 struct tipc_service *service;
937 /* Verify name table is empty and purge any lingering
938 * publications, then release the name table
940 spin_lock_bh(&tn->nametbl_lock);
941 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) {
942 if (hlist_empty(&nt->services[i]))
944 service_head = &nt->services[i];
945 hlist_for_each_entry_rcu(service, service_head, service_list) {
946 tipc_service_delete(net, service);
949 spin_unlock_bh(&tn->nametbl_lock);
955 static int __tipc_nl_add_nametable_publ(struct tipc_nl_msg *msg,
956 struct tipc_service *service,
957 struct service_range *sr,
960 struct publication *p;
961 struct nlattr *attrs;
966 list_for_each_entry(p, &sr->all_publ, all_publ)
967 if (p->key == *last_key)
969 if (p->key != *last_key)
972 p = list_first_entry(&sr->all_publ,
977 list_for_each_entry_from(p, &sr->all_publ, all_publ) {
980 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq,
981 &tipc_genl_family, NLM_F_MULTI,
982 TIPC_NL_NAME_TABLE_GET);
986 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_NAME_TABLE);
990 b = nla_nest_start_noflag(msg->skb, TIPC_NLA_NAME_TABLE_PUBL);
994 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_TYPE, service->type))
996 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_LOWER, sr->lower))
998 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_UPPER, sr->upper))
1000 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_SCOPE, p->scope))
1002 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_NODE, p->sk.node))
1004 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_REF, p->sk.ref))
1006 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_KEY, p->key))
1009 nla_nest_end(msg->skb, b);
1010 nla_nest_end(msg->skb, attrs);
1011 genlmsg_end(msg->skb, hdr);
1018 nla_nest_cancel(msg->skb, b);
1020 nla_nest_cancel(msg->skb, attrs);
1022 genlmsg_cancel(msg->skb, hdr);
1027 static int __tipc_nl_service_range_list(struct tipc_nl_msg *msg,
1028 struct tipc_service *sc,
1029 u32 *last_lower, u32 *last_key)
1031 struct service_range *sr;
1035 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) {
1036 sr = container_of(n, struct service_range, tree_node);
1037 if (sr->lower < *last_lower)
1039 err = __tipc_nl_add_nametable_publ(msg, sc, sr, last_key);
1041 *last_lower = sr->lower;
1049 static int tipc_nl_service_list(struct net *net, struct tipc_nl_msg *msg,
1050 u32 *last_type, u32 *last_lower, u32 *last_key)
1052 struct tipc_net *tn = tipc_net(net);
1053 struct tipc_service *service = NULL;
1054 struct hlist_head *head;
1059 i = hash(*last_type);
1063 for (; i < TIPC_NAMETBL_SIZE; i++) {
1064 head = &tn->nametbl->services[i];
1067 (!i && *last_key && (*last_lower == *last_key))) {
1068 service = tipc_service_find(net, *last_type);
1072 hlist_for_each_entry_rcu(service, head, service_list)
1078 hlist_for_each_entry_from_rcu(service, service_list) {
1079 spin_lock_bh(&service->lock);
1080 err = __tipc_nl_service_range_list(msg, service,
1085 *last_type = service->type;
1086 spin_unlock_bh(&service->lock);
1089 spin_unlock_bh(&service->lock);
1096 int tipc_nl_name_table_dump(struct sk_buff *skb, struct netlink_callback *cb)
1098 struct net *net = sock_net(skb->sk);
1099 u32 last_type = cb->args[0];
1100 u32 last_lower = cb->args[1];
1101 u32 last_key = cb->args[2];
1102 int done = cb->args[3];
1103 struct tipc_nl_msg msg;
1110 msg.portid = NETLINK_CB(cb->skb).portid;
1111 msg.seq = cb->nlh->nlmsg_seq;
1114 err = tipc_nl_service_list(net, &msg, &last_type,
1115 &last_lower, &last_key);
1118 } else if (err != -EMSGSIZE) {
1119 /* We never set seq or call nl_dump_check_consistent() this
1120 * means that setting prev_seq here will cause the consistence
1121 * check to fail in the netlink callback handler. Resulting in
1122 * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if
1129 cb->args[0] = last_type;
1130 cb->args[1] = last_lower;
1131 cb->args[2] = last_key;
1137 struct tipc_dest *tipc_dest_find(struct list_head *l, u32 node, u32 port)
1139 struct tipc_dest *dst;
1141 list_for_each_entry(dst, l, list) {
1142 if (dst->node == node && dst->port == port)
1148 bool tipc_dest_push(struct list_head *l, u32 node, u32 port)
1150 struct tipc_dest *dst;
1152 if (tipc_dest_find(l, node, port))
1155 dst = kmalloc(sizeof(*dst), GFP_ATOMIC);
1160 list_add(&dst->list, l);
1164 bool tipc_dest_pop(struct list_head *l, u32 *node, u32 *port)
1166 struct tipc_dest *dst;
1170 dst = list_first_entry(l, typeof(*dst), list);
1175 list_del(&dst->list);
1180 bool tipc_dest_del(struct list_head *l, u32 node, u32 port)
1182 struct tipc_dest *dst;
1184 dst = tipc_dest_find(l, node, port);
1187 list_del(&dst->list);
1192 void tipc_dest_list_purge(struct list_head *l)
1194 struct tipc_dest *dst, *tmp;
1196 list_for_each_entry_safe(dst, tmp, l, list) {
1197 list_del(&dst->list);
1202 int tipc_dest_list_len(struct list_head *l)
1204 struct tipc_dest *dst;
1207 list_for_each_entry(dst, l, list) {