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 * @net: network namespace
253 * @ua: address representing the service to be bound
255 * Allocates a single range structure and sets it to all 0's.
257 static struct tipc_service *tipc_service_create(struct net *net,
258 struct tipc_uaddr *ua)
260 struct name_table *nt = tipc_name_table(net);
261 struct tipc_service *service;
262 struct hlist_head *hd;
264 service = kzalloc(sizeof(*service), GFP_ATOMIC);
266 pr_warn("Service creation failed, no memory\n");
270 spin_lock_init(&service->lock);
271 service->type = ua->sr.type;
272 service->ranges = RB_ROOT;
273 INIT_HLIST_NODE(&service->service_list);
274 INIT_LIST_HEAD(&service->subscriptions);
275 hd = &nt->services[hash(ua->sr.type)];
276 hlist_add_head_rcu(&service->service_list, hd);
280 /* tipc_service_find_range - find service range matching publication parameters
282 static struct service_range *tipc_service_find_range(struct tipc_service *sc,
283 struct tipc_uaddr *ua)
285 struct service_range *sr;
287 service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) {
288 /* Look for exact match */
289 if (sr->lower == ua->sr.lower && sr->upper == ua->sr.upper)
296 static struct service_range *tipc_service_create_range(struct tipc_service *sc,
297 struct publication *p)
299 struct rb_node **n, *parent = NULL;
300 struct service_range *sr;
301 u32 lower = p->sr.lower;
302 u32 upper = p->sr.upper;
304 n = &sc->ranges.rb_node;
307 sr = service_range_entry(parent);
308 if (lower == sr->lower && upper == sr->upper)
312 if (lower <= sr->lower)
313 n = &parent->rb_left;
315 n = &parent->rb_right;
317 sr = kzalloc(sizeof(*sr), GFP_ATOMIC);
323 INIT_LIST_HEAD(&sr->local_publ);
324 INIT_LIST_HEAD(&sr->all_publ);
325 rb_link_node(&sr->tree_node, parent, n);
326 rb_insert_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks);
330 static bool tipc_service_insert_publ(struct net *net,
331 struct tipc_service *sc,
332 struct publication *p)
334 struct tipc_subscription *sub, *tmp;
335 struct service_range *sr;
336 struct publication *_p;
337 u32 node = p->sk.node;
342 spin_lock_bh(&sc->lock);
343 sr = tipc_service_create_range(sc, p);
347 first = list_empty(&sr->all_publ);
349 /* Return if the publication already exists */
350 list_for_each_entry(_p, &sr->all_publ, all_publ) {
351 if (_p->key == key && (!_p->sk.node || _p->sk.node == node)) {
352 pr_debug("Failed to bind duplicate %u,%u,%u/%u:%u/%u\n",
353 p->sr.type, p->sr.lower, p->sr.upper,
354 node, p->sk.ref, key);
359 if (in_own_node(net, p->sk.node))
360 list_add(&p->local_publ, &sr->local_publ);
361 list_add(&p->all_publ, &sr->all_publ);
362 p->id = sc->publ_cnt++;
364 /* Any subscriptions waiting for notification? */
365 list_for_each_entry_safe(sub, tmp, &sc->subscriptions, service_list) {
366 tipc_sub_report_overlap(sub, p, TIPC_PUBLISHED, first);
371 pr_warn("Failed to bind to %u,%u,%u\n",
372 p->sr.type, p->sr.lower, p->sr.upper);
373 spin_unlock_bh(&sc->lock);
378 * tipc_service_remove_publ - remove a publication from a service
379 * @r: service_range to remove publication from
380 * @sk: address publishing socket
381 * @key: target publication key
383 static struct publication *tipc_service_remove_publ(struct service_range *r,
384 struct tipc_socket_addr *sk,
387 struct publication *p;
390 list_for_each_entry(p, &r->all_publ, all_publ) {
391 if (p->key != key || (node && node != p->sk.node))
393 list_del(&p->all_publ);
394 list_del(&p->local_publ);
401 * Code reused: time_after32() for the same purpose
403 #define publication_after(pa, pb) time_after32((pa)->id, (pb)->id)
404 static int tipc_publ_sort(void *priv, const struct list_head *a,
405 const struct list_head *b)
407 struct publication *pa, *pb;
409 pa = container_of(a, struct publication, list);
410 pb = container_of(b, struct publication, list);
411 return publication_after(pa, pb);
415 * tipc_service_subscribe - attach a subscription, and optionally
416 * issue the prescribed number of events if there is any service
417 * range overlapping with the requested range
418 * @service: the tipc_service to attach the @sub to
419 * @sub: the subscription to attach
421 static void tipc_service_subscribe(struct tipc_service *service,
422 struct tipc_subscription *sub)
424 struct publication *p, *first, *tmp;
425 struct list_head publ_list;
426 struct service_range *sr;
427 u32 filter, lower, upper;
429 filter = sub->s.filter;
430 lower = sub->s.seq.lower;
431 upper = sub->s.seq.upper;
434 list_add(&sub->service_list, &service->subscriptions);
436 if (filter & TIPC_SUB_NO_STATUS)
439 INIT_LIST_HEAD(&publ_list);
440 service_range_foreach_match(sr, service, lower, upper) {
442 list_for_each_entry(p, &sr->all_publ, all_publ) {
443 if (filter & TIPC_SUB_PORTS)
444 list_add_tail(&p->list, &publ_list);
445 else if (!first || publication_after(first, p))
446 /* Pick this range's *first* publication */
450 list_add_tail(&first->list, &publ_list);
453 /* Sort the publications before reporting */
454 list_sort(NULL, &publ_list, tipc_publ_sort);
455 list_for_each_entry_safe(p, tmp, &publ_list, list) {
456 tipc_sub_report_overlap(sub, p, TIPC_PUBLISHED, true);
457 list_del_init(&p->list);
461 static struct tipc_service *tipc_service_find(struct net *net,
462 struct tipc_uaddr *ua)
464 struct name_table *nt = tipc_name_table(net);
465 struct hlist_head *service_head;
466 struct tipc_service *service;
468 service_head = &nt->services[hash(ua->sr.type)];
469 hlist_for_each_entry_rcu(service, service_head, service_list) {
470 if (service->type == ua->sr.type)
476 struct publication *tipc_nametbl_insert_publ(struct net *net,
477 struct tipc_uaddr *ua,
478 struct tipc_socket_addr *sk,
481 struct tipc_service *sc;
482 struct publication *p;
484 p = tipc_publ_create(ua, sk, key);
488 sc = tipc_service_find(net, ua);
490 sc = tipc_service_create(net, ua);
491 if (sc && tipc_service_insert_publ(net, sc, p))
497 struct publication *tipc_nametbl_remove_publ(struct net *net,
498 struct tipc_uaddr *ua,
499 struct tipc_socket_addr *sk,
502 struct tipc_subscription *sub, *tmp;
503 struct publication *p = NULL;
504 struct service_range *sr;
505 struct tipc_service *sc;
508 sc = tipc_service_find(net, ua);
512 spin_lock_bh(&sc->lock);
513 sr = tipc_service_find_range(sc, ua);
516 p = tipc_service_remove_publ(sr, sk, key);
520 /* Notify any waiting subscriptions */
521 last = list_empty(&sr->all_publ);
522 list_for_each_entry_safe(sub, tmp, &sc->subscriptions, service_list) {
523 tipc_sub_report_overlap(sub, p, TIPC_WITHDRAWN, last);
526 /* Remove service range item if this was its last publication */
527 if (list_empty(&sr->all_publ)) {
528 rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks);
532 /* Delete service item if no more publications and subscriptions */
533 if (RB_EMPTY_ROOT(&sc->ranges) && list_empty(&sc->subscriptions)) {
534 hlist_del_init_rcu(&sc->service_list);
538 spin_unlock_bh(&sc->lock);
541 pr_err("Failed to remove unknown binding: %u,%u,%u/%u:%u/%u\n",
542 ua->sr.type, ua->sr.lower, ua->sr.upper,
543 sk->node, sk->ref, key);
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.
559 * - If lookup is deferred to another node, leave 'sk->node' unchanged and
561 * - If lookup is successful, set the 'sk->node' and 'sk->ref' (== portid) which
562 * represent the bound socket and return 'true'.
563 * - If lookup fails, return 'false'
565 * Note that for legacy users (node configured with Z.C.N address format) the
566 * 'closest-first' lookup algorithm must be maintained, i.e., if sk.node is 0
567 * we must look in the local binding list first
569 bool tipc_nametbl_lookup_anycast(struct net *net,
570 struct tipc_uaddr *ua,
571 struct tipc_socket_addr *sk)
573 struct tipc_net *tn = tipc_net(net);
574 bool legacy = tn->legacy_addr_format;
575 u32 self = tipc_own_addr(net);
576 u32 inst = ua->sa.instance;
577 struct service_range *r;
578 struct tipc_service *sc;
579 struct publication *p;
583 if (!tipc_in_scope(legacy, sk->node, self))
587 sc = tipc_service_find(net, ua);
591 spin_lock_bh(&sc->lock);
592 service_range_foreach_match(r, sc, inst, inst) {
593 /* Select lookup algo: local, closest-first or round-robin */
594 if (sk->node == self) {
598 p = list_first_entry(l, struct publication, local_publ);
599 list_move_tail(&p->local_publ, &r->local_publ);
600 } else if (legacy && !sk->node && !list_empty(&r->local_publ)) {
602 p = list_first_entry(l, struct publication, local_publ);
603 list_move_tail(&p->local_publ, &r->local_publ);
606 p = list_first_entry(l, struct publication, all_publ);
607 list_move_tail(&p->all_publ, &r->all_publ);
611 /* Todo: as for legacy, pick the first matching range only, a
612 * "true" round-robin will be performed as needed.
616 spin_unlock_bh(&sc->lock);
623 /* tipc_nametbl_lookup_group(): lookup destinaton(s) in a communication group
624 * Returns a list of one (== group anycast) or more (== group multicast)
625 * destination socket/node pairs matching the given address.
626 * The requester may or may not want to exclude himself from the list.
628 bool tipc_nametbl_lookup_group(struct net *net, struct tipc_uaddr *ua,
629 struct list_head *dsts, int *dstcnt,
630 u32 exclude, bool mcast)
632 u32 self = tipc_own_addr(net);
633 u32 inst = ua->sa.instance;
634 struct service_range *sr;
635 struct tipc_service *sc;
636 struct publication *p;
640 sc = tipc_service_find(net, ua);
644 spin_lock_bh(&sc->lock);
646 /* Todo: a full search i.e. service_range_foreach_match() instead? */
647 sr = service_range_match_first(sc->ranges.rb_node, inst, inst);
651 list_for_each_entry(p, &sr->all_publ, all_publ) {
652 if (p->scope != ua->scope)
654 if (p->sk.ref == exclude && p->sk.node == self)
656 tipc_dest_push(dsts, p->sk.node, p->sk.ref);
660 list_move_tail(&p->all_publ, &sr->all_publ);
664 spin_unlock_bh(&sc->lock);
667 return !list_empty(dsts);
670 /* tipc_nametbl_lookup_mcast_sockets(): look up node local destinaton sockets
671 * matching the given address
672 * Used on nodes which have received a multicast/broadcast message
673 * Returns a list of local sockets
675 void tipc_nametbl_lookup_mcast_sockets(struct net *net, struct tipc_uaddr *ua,
676 struct list_head *dports)
678 struct service_range *sr;
679 struct tipc_service *sc;
680 struct publication *p;
681 u8 scope = ua->scope;
684 sc = tipc_service_find(net, ua);
688 spin_lock_bh(&sc->lock);
689 service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) {
690 list_for_each_entry(p, &sr->local_publ, local_publ) {
691 if (scope == p->scope || scope == TIPC_ANY_SCOPE)
692 tipc_dest_push(dports, 0, p->sk.ref);
695 spin_unlock_bh(&sc->lock);
700 /* tipc_nametbl_lookup_mcast_nodes(): look up all destination nodes matching
701 * the given address. Used in sending node.
702 * Used on nodes which are sending out a multicast/broadcast message
703 * Returns a list of nodes, including own node if applicable
705 void tipc_nametbl_lookup_mcast_nodes(struct net *net, struct tipc_uaddr *ua,
706 struct tipc_nlist *nodes)
708 struct service_range *sr;
709 struct tipc_service *sc;
710 struct publication *p;
713 sc = tipc_service_find(net, ua);
717 spin_lock_bh(&sc->lock);
718 service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) {
719 list_for_each_entry(p, &sr->all_publ, all_publ) {
720 tipc_nlist_add(nodes, p->sk.node);
723 spin_unlock_bh(&sc->lock);
728 /* tipc_nametbl_build_group - build list of communication group members
730 void tipc_nametbl_build_group(struct net *net, struct tipc_group *grp,
731 struct tipc_uaddr *ua)
733 struct service_range *sr;
734 struct tipc_service *sc;
735 struct publication *p;
739 sc = tipc_service_find(net, ua);
743 spin_lock_bh(&sc->lock);
744 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) {
745 sr = container_of(n, struct service_range, tree_node);
746 list_for_each_entry(p, &sr->all_publ, all_publ) {
747 if (p->scope != ua->scope)
749 tipc_group_add_member(grp, p->sk.node, p->sk.ref,
753 spin_unlock_bh(&sc->lock);
758 /* tipc_nametbl_publish - add service binding to name table
760 struct publication *tipc_nametbl_publish(struct net *net, struct tipc_uaddr *ua,
761 struct tipc_socket_addr *sk, u32 key)
763 struct name_table *nt = tipc_name_table(net);
764 struct tipc_net *tn = tipc_net(net);
765 struct publication *p = NULL;
766 struct sk_buff *skb = NULL;
769 spin_lock_bh(&tn->nametbl_lock);
771 if (nt->local_publ_count >= TIPC_MAX_PUBL) {
772 pr_warn("Bind failed, max limit %u reached\n", TIPC_MAX_PUBL);
776 p = tipc_nametbl_insert_publ(net, ua, sk, key);
778 nt->local_publ_count++;
779 skb = tipc_named_publish(net, p);
781 rc_dests = nt->rc_dests;
783 spin_unlock_bh(&tn->nametbl_lock);
786 tipc_node_broadcast(net, skb, rc_dests);
792 * tipc_nametbl_withdraw - withdraw a service binding
793 * @net: network namespace
794 * @ua: service address/range being unbound
795 * @sk: address of the socket being unbound from
796 * @key: target publication key
798 void tipc_nametbl_withdraw(struct net *net, struct tipc_uaddr *ua,
799 struct tipc_socket_addr *sk, u32 key)
801 struct name_table *nt = tipc_name_table(net);
802 struct tipc_net *tn = tipc_net(net);
803 struct sk_buff *skb = NULL;
804 struct publication *p;
807 spin_lock_bh(&tn->nametbl_lock);
809 p = tipc_nametbl_remove_publ(net, ua, sk, key);
811 nt->local_publ_count--;
812 skb = tipc_named_withdraw(net, p);
813 list_del_init(&p->binding_sock);
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 tipc_net *tn = tipc_net(sub->net);
830 u32 type = sub->s.seq.type;
831 struct tipc_service *sc;
832 struct tipc_uaddr ua;
835 tipc_uaddr(&ua, TIPC_SERVICE_RANGE, TIPC_NODE_SCOPE, type,
836 sub->s.seq.lower, sub->s.seq.upper);
837 spin_lock_bh(&tn->nametbl_lock);
838 sc = tipc_service_find(sub->net, &ua);
840 sc = tipc_service_create(sub->net, &ua);
842 spin_lock_bh(&sc->lock);
843 tipc_service_subscribe(sc, sub);
844 spin_unlock_bh(&sc->lock);
846 pr_warn("Failed to subscribe for {%u,%u,%u}\n",
847 type, sub->s.seq.lower, sub->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_service *sc;
862 struct tipc_uaddr ua;
864 tipc_uaddr(&ua, TIPC_SERVICE_RANGE, TIPC_NODE_SCOPE,
865 sub->s.seq.type, sub->s.seq.lower, sub->s.seq.upper);
866 spin_lock_bh(&tn->nametbl_lock);
867 sc = tipc_service_find(sub->net, &ua);
871 spin_lock_bh(&sc->lock);
872 list_del_init(&sub->service_list);
875 /* Delete service item if no more publications and subscriptions */
876 if (RB_EMPTY_ROOT(&sc->ranges) && list_empty(&sc->subscriptions)) {
877 hlist_del_init_rcu(&sc->service_list);
880 spin_unlock_bh(&sc->lock);
882 spin_unlock_bh(&tn->nametbl_lock);
885 int tipc_nametbl_init(struct net *net)
887 struct tipc_net *tn = tipc_net(net);
888 struct name_table *nt;
891 nt = kzalloc(sizeof(*nt), GFP_KERNEL);
895 for (i = 0; i < TIPC_NAMETBL_SIZE; i++)
896 INIT_HLIST_HEAD(&nt->services[i]);
898 INIT_LIST_HEAD(&nt->node_scope);
899 INIT_LIST_HEAD(&nt->cluster_scope);
900 rwlock_init(&nt->cluster_scope_lock);
902 spin_lock_init(&tn->nametbl_lock);
907 * tipc_service_delete - purge all publications for a service and delete it
908 * @net: the associated network namespace
909 * @sc: tipc_service to delete
911 static void tipc_service_delete(struct net *net, struct tipc_service *sc)
913 struct service_range *sr, *tmpr;
914 struct publication *p, *tmp;
916 spin_lock_bh(&sc->lock);
917 rbtree_postorder_for_each_entry_safe(sr, tmpr, &sc->ranges, tree_node) {
918 list_for_each_entry_safe(p, tmp, &sr->all_publ, all_publ) {
919 tipc_service_remove_publ(sr, &p->sk, p->key);
922 rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks);
925 hlist_del_init_rcu(&sc->service_list);
926 spin_unlock_bh(&sc->lock);
930 void tipc_nametbl_stop(struct net *net)
932 struct name_table *nt = tipc_name_table(net);
933 struct tipc_net *tn = tipc_net(net);
934 struct hlist_head *service_head;
935 struct tipc_service *service;
938 /* Verify name table is empty and purge any lingering
939 * publications, then release the name table
941 spin_lock_bh(&tn->nametbl_lock);
942 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) {
943 if (hlist_empty(&nt->services[i]))
945 service_head = &nt->services[i];
946 hlist_for_each_entry_rcu(service, service_head, service_list) {
947 tipc_service_delete(net, service);
950 spin_unlock_bh(&tn->nametbl_lock);
956 static int __tipc_nl_add_nametable_publ(struct tipc_nl_msg *msg,
957 struct tipc_service *service,
958 struct service_range *sr,
961 struct publication *p;
962 struct nlattr *attrs;
967 list_for_each_entry(p, &sr->all_publ, all_publ)
968 if (p->key == *last_key)
970 if (list_entry_is_head(p, &sr->all_publ, all_publ))
973 p = list_first_entry(&sr->all_publ,
978 list_for_each_entry_from(p, &sr->all_publ, all_publ) {
981 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq,
982 &tipc_genl_family, NLM_F_MULTI,
983 TIPC_NL_NAME_TABLE_GET);
987 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_NAME_TABLE);
991 b = nla_nest_start_noflag(msg->skb, TIPC_NLA_NAME_TABLE_PUBL);
995 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_TYPE, service->type))
997 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_LOWER, sr->lower))
999 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_UPPER, sr->upper))
1001 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_SCOPE, p->scope))
1003 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_NODE, p->sk.node))
1005 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_REF, p->sk.ref))
1007 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_KEY, p->key))
1010 nla_nest_end(msg->skb, b);
1011 nla_nest_end(msg->skb, attrs);
1012 genlmsg_end(msg->skb, hdr);
1019 nla_nest_cancel(msg->skb, b);
1021 nla_nest_cancel(msg->skb, attrs);
1023 genlmsg_cancel(msg->skb, hdr);
1028 static int __tipc_nl_service_range_list(struct tipc_nl_msg *msg,
1029 struct tipc_service *sc,
1030 u32 *last_lower, u32 *last_key)
1032 struct service_range *sr;
1036 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) {
1037 sr = container_of(n, struct service_range, tree_node);
1038 if (sr->lower < *last_lower)
1040 err = __tipc_nl_add_nametable_publ(msg, sc, sr, last_key);
1042 *last_lower = sr->lower;
1050 static int tipc_nl_service_list(struct net *net, struct tipc_nl_msg *msg,
1051 u32 *last_type, u32 *last_lower, u32 *last_key)
1053 struct tipc_net *tn = tipc_net(net);
1054 struct tipc_service *service = NULL;
1055 struct hlist_head *head;
1056 struct tipc_uaddr ua;
1061 i = hash(*last_type);
1065 for (; i < TIPC_NAMETBL_SIZE; i++) {
1066 head = &tn->nametbl->services[i];
1069 (!i && *last_key && (*last_lower == *last_key))) {
1070 tipc_uaddr(&ua, TIPC_SERVICE_RANGE, TIPC_NODE_SCOPE,
1071 *last_type, *last_lower, *last_lower);
1072 service = tipc_service_find(net, &ua);
1076 hlist_for_each_entry_rcu(service, head, service_list)
1082 hlist_for_each_entry_from_rcu(service, service_list) {
1083 spin_lock_bh(&service->lock);
1084 err = __tipc_nl_service_range_list(msg, service,
1089 *last_type = service->type;
1090 spin_unlock_bh(&service->lock);
1093 spin_unlock_bh(&service->lock);
1100 int tipc_nl_name_table_dump(struct sk_buff *skb, struct netlink_callback *cb)
1102 struct net *net = sock_net(skb->sk);
1103 u32 last_type = cb->args[0];
1104 u32 last_lower = cb->args[1];
1105 u32 last_key = cb->args[2];
1106 int done = cb->args[3];
1107 struct tipc_nl_msg msg;
1114 msg.portid = NETLINK_CB(cb->skb).portid;
1115 msg.seq = cb->nlh->nlmsg_seq;
1118 err = tipc_nl_service_list(net, &msg, &last_type,
1119 &last_lower, &last_key);
1122 } else if (err != -EMSGSIZE) {
1123 /* We never set seq or call nl_dump_check_consistent() this
1124 * means that setting prev_seq here will cause the consistence
1125 * check to fail in the netlink callback handler. Resulting in
1126 * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if
1133 cb->args[0] = last_type;
1134 cb->args[1] = last_lower;
1135 cb->args[2] = last_key;
1141 struct tipc_dest *tipc_dest_find(struct list_head *l, u32 node, u32 port)
1143 struct tipc_dest *dst;
1145 list_for_each_entry(dst, l, list) {
1146 if (dst->node == node && dst->port == port)
1152 bool tipc_dest_push(struct list_head *l, u32 node, u32 port)
1154 struct tipc_dest *dst;
1156 if (tipc_dest_find(l, node, port))
1159 dst = kmalloc(sizeof(*dst), GFP_ATOMIC);
1164 list_add(&dst->list, l);
1168 bool tipc_dest_pop(struct list_head *l, u32 *node, u32 *port)
1170 struct tipc_dest *dst;
1174 dst = list_first_entry(l, typeof(*dst), list);
1179 list_del(&dst->list);
1184 bool tipc_dest_del(struct list_head *l, u32 node, u32 port)
1186 struct tipc_dest *dst;
1188 dst = tipc_dest_find(l, node, port);
1191 list_del(&dst->list);
1196 void tipc_dest_list_purge(struct list_head *l)
1198 struct tipc_dest *dst, *tmp;
1200 list_for_each_entry_safe(dst, tmp, l, list) {
1201 list_del(&dst->list);