Loading...
1/*
2 * net/tipc/name_table.c: TIPC name table code
3 *
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
7 * All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions are met:
11 *
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.
20 *
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.
24 *
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.
36 */
37
38#include <net/sock.h>
39#include <linux/list_sort.h>
40#include <linux/rbtree_augmented.h>
41#include "core.h"
42#include "netlink.h"
43#include "name_table.h"
44#include "name_distr.h"
45#include "subscr.h"
46#include "bcast.h"
47#include "addr.h"
48#include "node.h"
49#include "group.h"
50
51/**
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
61 */
62struct service_range {
63 u32 lower;
64 u32 upper;
65 struct rb_node tree_node;
66 u32 max;
67 struct list_head local_publ;
68 struct list_head all_publ;
69};
70
71/**
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
80 */
81struct tipc_service {
82 u32 type;
83 u32 publ_cnt;
84 struct rb_root ranges;
85 struct hlist_node service_list;
86 struct list_head subscriptions;
87 spinlock_t lock; /* Covers service range list */
88 struct rcu_head rcu;
89};
90
91#define service_range_upper(sr) ((sr)->upper)
92RB_DECLARE_CALLBACKS_MAX(static, sr_callbacks,
93 struct service_range, tree_node, u32, max,
94 service_range_upper)
95
96#define service_range_entry(rbtree_node) \
97 (container_of(rbtree_node, struct service_range, tree_node))
98
99#define service_range_overlap(sr, start, end) \
100 ((sr)->lower <= (end) && (sr)->upper >= (start))
101
102/**
103 * service_range_foreach_match - iterate over tipc service rbtree for each
104 * range match
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
109 */
110#define service_range_foreach_match(sr, sc, start, end) \
111 for (sr = service_range_match_first((sc)->ranges.rb_node, \
112 start, \
113 end); \
114 sr; \
115 sr = service_range_match_next(&(sr)->tree_node, \
116 start, \
117 end))
118
119/**
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
124 *
125 * Return: the leftmost service range node in the rbtree that overlaps the
126 * specific range if any. Otherwise, returns NULL.
127 */
128static struct service_range *service_range_match_first(struct rb_node *n,
129 u32 start, u32 end)
130{
131 struct service_range *sr;
132 struct rb_node *l, *r;
133
134 /* Non overlaps in tree at all? */
135 if (!n || service_range_entry(n)->max < start)
136 return NULL;
137
138 while (n) {
139 l = n->rb_left;
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.
144 */
145 n = l;
146 continue;
147 }
148
149 /* No one in the left subtree can match, return if this node is
150 * an overlap i.e. leftmost.
151 */
152 sr = service_range_entry(n);
153 if (service_range_overlap(sr, start, end))
154 return sr;
155
156 /* Ok, try to lookup on the right side */
157 r = n->rb_right;
158 if (sr->lower <= end &&
159 r && service_range_entry(r)->max >= start) {
160 n = r;
161 continue;
162 }
163 break;
164 }
165
166 return NULL;
167}
168
169/**
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
174 *
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.
177 */
178static struct service_range *service_range_match_next(struct rb_node *n,
179 u32 start, u32 end)
180{
181 struct service_range *sr;
182 struct rb_node *p, *r;
183
184 while (n) {
185 r = n->rb_right;
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.
191 */
192 return service_range_match_first(r, start, end);
193
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.
196 */
197 while ((p = rb_parent(n)) && n == p->rb_right)
198 n = p;
199 if (!p)
200 break;
201
202 /* Return if this ancestor is an overlap */
203 sr = service_range_entry(p);
204 if (service_range_overlap(sr, start, end))
205 return sr;
206
207 /* Ok, try to lookup more from this ancestor */
208 if (sr->lower <= end) {
209 n = p;
210 continue;
211 }
212 break;
213 }
214
215 return NULL;
216}
217
218static int hash(int x)
219{
220 return x & (TIPC_NAMETBL_SIZE - 1);
221}
222
223/**
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
228 */
229static struct publication *tipc_publ_create(struct tipc_uaddr *ua,
230 struct tipc_socket_addr *sk,
231 u32 key)
232{
233 struct publication *p = kzalloc(sizeof(*p), GFP_ATOMIC);
234
235 if (!p)
236 return NULL;
237
238 p->sr = ua->sr;
239 p->sk = *sk;
240 p->scope = ua->scope;
241 p->key = key;
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);
247 return p;
248}
249
250/**
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
254 *
255 * Allocates a single range structure and sets it to all 0's.
256 */
257static struct tipc_service *tipc_service_create(struct net *net,
258 struct tipc_uaddr *ua)
259{
260 struct name_table *nt = tipc_name_table(net);
261 struct tipc_service *service;
262 struct hlist_head *hd;
263
264 service = kzalloc(sizeof(*service), GFP_ATOMIC);
265 if (!service) {
266 pr_warn("Service creation failed, no memory\n");
267 return NULL;
268 }
269
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);
277 return service;
278}
279
280/* tipc_service_find_range - find service range matching publication parameters
281 */
282static struct service_range *tipc_service_find_range(struct tipc_service *sc,
283 struct tipc_uaddr *ua)
284{
285 struct service_range *sr;
286
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)
290 return sr;
291 }
292
293 return NULL;
294}
295
296static struct service_range *tipc_service_create_range(struct tipc_service *sc,
297 struct publication *p)
298{
299 struct rb_node **n, *parent = NULL;
300 struct service_range *sr;
301 u32 lower = p->sr.lower;
302 u32 upper = p->sr.upper;
303
304 n = &sc->ranges.rb_node;
305 while (*n) {
306 parent = *n;
307 sr = service_range_entry(parent);
308 if (lower == sr->lower && upper == sr->upper)
309 return sr;
310 if (sr->max < upper)
311 sr->max = upper;
312 if (lower <= sr->lower)
313 n = &parent->rb_left;
314 else
315 n = &parent->rb_right;
316 }
317 sr = kzalloc(sizeof(*sr), GFP_ATOMIC);
318 if (!sr)
319 return NULL;
320 sr->lower = lower;
321 sr->upper = upper;
322 sr->max = upper;
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);
327 return sr;
328}
329
330static bool tipc_service_insert_publ(struct net *net,
331 struct tipc_service *sc,
332 struct publication *p)
333{
334 struct tipc_subscription *sub, *tmp;
335 struct service_range *sr;
336 struct publication *_p;
337 u32 node = p->sk.node;
338 bool first = false;
339 bool res = false;
340 u32 key = p->key;
341
342 spin_lock_bh(&sc->lock);
343 sr = tipc_service_create_range(sc, p);
344 if (!sr)
345 goto exit;
346
347 first = list_empty(&sr->all_publ);
348
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);
355 goto exit;
356 }
357 }
358
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++;
363
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);
367 }
368 res = true;
369exit:
370 if (!res)
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);
374 return res;
375}
376
377/**
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
382 */
383static struct publication *tipc_service_remove_publ(struct service_range *r,
384 struct tipc_socket_addr *sk,
385 u32 key)
386{
387 struct publication *p;
388 u32 node = sk->node;
389
390 list_for_each_entry(p, &r->all_publ, all_publ) {
391 if (p->key != key || (node && node != p->sk.node))
392 continue;
393 list_del(&p->all_publ);
394 list_del(&p->local_publ);
395 return p;
396 }
397 return NULL;
398}
399
400/*
401 * Code reused: time_after32() for the same purpose
402 */
403#define publication_after(pa, pb) time_after32((pa)->id, (pb)->id)
404static int tipc_publ_sort(void *priv, const struct list_head *a,
405 const struct list_head *b)
406{
407 struct publication *pa, *pb;
408
409 pa = container_of(a, struct publication, list);
410 pb = container_of(b, struct publication, list);
411 return publication_after(pa, pb);
412}
413
414/**
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
420 */
421static void tipc_service_subscribe(struct tipc_service *service,
422 struct tipc_subscription *sub)
423{
424 struct publication *p, *first, *tmp;
425 struct list_head publ_list;
426 struct service_range *sr;
427 u32 filter, lower, upper;
428
429 filter = sub->s.filter;
430 lower = sub->s.seq.lower;
431 upper = sub->s.seq.upper;
432
433 tipc_sub_get(sub);
434 list_add(&sub->service_list, &service->subscriptions);
435
436 if (filter & TIPC_SUB_NO_STATUS)
437 return;
438
439 INIT_LIST_HEAD(&publ_list);
440 service_range_foreach_match(sr, service, lower, upper) {
441 first = NULL;
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 */
447 first = p;
448 }
449 if (first)
450 list_add_tail(&first->list, &publ_list);
451 }
452
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);
458 }
459}
460
461static struct tipc_service *tipc_service_find(struct net *net,
462 struct tipc_uaddr *ua)
463{
464 struct name_table *nt = tipc_name_table(net);
465 struct hlist_head *service_head;
466 struct tipc_service *service;
467
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)
471 return service;
472 }
473 return NULL;
474};
475
476struct publication *tipc_nametbl_insert_publ(struct net *net,
477 struct tipc_uaddr *ua,
478 struct tipc_socket_addr *sk,
479 u32 key)
480{
481 struct tipc_service *sc;
482 struct publication *p;
483
484 p = tipc_publ_create(ua, sk, key);
485 if (!p)
486 return NULL;
487
488 sc = tipc_service_find(net, ua);
489 if (!sc)
490 sc = tipc_service_create(net, ua);
491 if (sc && tipc_service_insert_publ(net, sc, p))
492 return p;
493 kfree(p);
494 return NULL;
495}
496
497struct publication *tipc_nametbl_remove_publ(struct net *net,
498 struct tipc_uaddr *ua,
499 struct tipc_socket_addr *sk,
500 u32 key)
501{
502 struct tipc_subscription *sub, *tmp;
503 struct publication *p = NULL;
504 struct service_range *sr;
505 struct tipc_service *sc;
506 bool last;
507
508 sc = tipc_service_find(net, ua);
509 if (!sc)
510 goto exit;
511
512 spin_lock_bh(&sc->lock);
513 sr = tipc_service_find_range(sc, ua);
514 if (!sr)
515 goto unlock;
516 p = tipc_service_remove_publ(sr, sk, key);
517 if (!p)
518 goto unlock;
519
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);
524 }
525
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);
529 kfree(sr);
530 }
531
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);
535 kfree_rcu(sc, rcu);
536 }
537unlock:
538 spin_unlock_bh(&sc->lock);
539exit:
540 if (!p) {
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);
544 }
545 return p;
546}
547
548/**
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
553 *
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.
556 *
557 * On exit:
558 *
559 * - If lookup is deferred to another node, leave 'sk->node' unchanged and
560 * return 'true'.
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'
564 *
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
568 */
569bool tipc_nametbl_lookup_anycast(struct net *net,
570 struct tipc_uaddr *ua,
571 struct tipc_socket_addr *sk)
572{
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;
580 struct list_head *l;
581 bool res = false;
582
583 if (!tipc_in_scope(legacy, sk->node, self))
584 return true;
585
586 rcu_read_lock();
587 sc = tipc_service_find(net, ua);
588 if (unlikely(!sc))
589 goto exit;
590
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) {
595 l = &r->local_publ;
596 if (list_empty(l))
597 continue;
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)) {
601 l = &r->local_publ;
602 p = list_first_entry(l, struct publication, local_publ);
603 list_move_tail(&p->local_publ, &r->local_publ);
604 } else {
605 l = &r->all_publ;
606 p = list_first_entry(l, struct publication, all_publ);
607 list_move_tail(&p->all_publ, &r->all_publ);
608 }
609 *sk = p->sk;
610 res = true;
611 /* Todo: as for legacy, pick the first matching range only, a
612 * "true" round-robin will be performed as needed.
613 */
614 break;
615 }
616 spin_unlock_bh(&sc->lock);
617
618exit:
619 rcu_read_unlock();
620 return res;
621}
622
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.
627 */
628bool tipc_nametbl_lookup_group(struct net *net, struct tipc_uaddr *ua,
629 struct list_head *dsts, int *dstcnt,
630 u32 exclude, bool mcast)
631{
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;
637
638 *dstcnt = 0;
639 rcu_read_lock();
640 sc = tipc_service_find(net, ua);
641 if (unlikely(!sc))
642 goto exit;
643
644 spin_lock_bh(&sc->lock);
645
646 /* Todo: a full search i.e. service_range_foreach_match() instead? */
647 sr = service_range_match_first(sc->ranges.rb_node, inst, inst);
648 if (!sr)
649 goto no_match;
650
651 list_for_each_entry(p, &sr->all_publ, all_publ) {
652 if (p->scope != ua->scope)
653 continue;
654 if (p->sk.ref == exclude && p->sk.node == self)
655 continue;
656 tipc_dest_push(dsts, p->sk.node, p->sk.ref);
657 (*dstcnt)++;
658 if (mcast)
659 continue;
660 list_move_tail(&p->all_publ, &sr->all_publ);
661 break;
662 }
663no_match:
664 spin_unlock_bh(&sc->lock);
665exit:
666 rcu_read_unlock();
667 return !list_empty(dsts);
668}
669
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
674 */
675void tipc_nametbl_lookup_mcast_sockets(struct net *net, struct tipc_uaddr *ua,
676 struct list_head *dports)
677{
678 struct service_range *sr;
679 struct tipc_service *sc;
680 struct publication *p;
681 u8 scope = ua->scope;
682
683 rcu_read_lock();
684 sc = tipc_service_find(net, ua);
685 if (!sc)
686 goto exit;
687
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);
693 }
694 }
695 spin_unlock_bh(&sc->lock);
696exit:
697 rcu_read_unlock();
698}
699
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
704 */
705void tipc_nametbl_lookup_mcast_nodes(struct net *net, struct tipc_uaddr *ua,
706 struct tipc_nlist *nodes)
707{
708 struct service_range *sr;
709 struct tipc_service *sc;
710 struct publication *p;
711
712 rcu_read_lock();
713 sc = tipc_service_find(net, ua);
714 if (!sc)
715 goto exit;
716
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);
721 }
722 }
723 spin_unlock_bh(&sc->lock);
724exit:
725 rcu_read_unlock();
726}
727
728/* tipc_nametbl_build_group - build list of communication group members
729 */
730void tipc_nametbl_build_group(struct net *net, struct tipc_group *grp,
731 struct tipc_uaddr *ua)
732{
733 struct service_range *sr;
734 struct tipc_service *sc;
735 struct publication *p;
736 struct rb_node *n;
737
738 rcu_read_lock();
739 sc = tipc_service_find(net, ua);
740 if (!sc)
741 goto exit;
742
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)
748 continue;
749 tipc_group_add_member(grp, p->sk.node, p->sk.ref,
750 p->sr.lower);
751 }
752 }
753 spin_unlock_bh(&sc->lock);
754exit:
755 rcu_read_unlock();
756}
757
758/* tipc_nametbl_publish - add service binding to name table
759 */
760struct publication *tipc_nametbl_publish(struct net *net, struct tipc_uaddr *ua,
761 struct tipc_socket_addr *sk, u32 key)
762{
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;
767 u32 rc_dests;
768
769 spin_lock_bh(&tn->nametbl_lock);
770
771 if (nt->local_publ_count >= TIPC_MAX_PUBL) {
772 pr_warn("Bind failed, max limit %u reached\n", TIPC_MAX_PUBL);
773 goto exit;
774 }
775
776 p = tipc_nametbl_insert_publ(net, ua, sk, key);
777 if (p) {
778 nt->local_publ_count++;
779 skb = tipc_named_publish(net, p);
780 }
781 rc_dests = nt->rc_dests;
782exit:
783 spin_unlock_bh(&tn->nametbl_lock);
784
785 if (skb)
786 tipc_node_broadcast(net, skb, rc_dests);
787 return p;
788
789}
790
791/**
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
797 */
798void tipc_nametbl_withdraw(struct net *net, struct tipc_uaddr *ua,
799 struct tipc_socket_addr *sk, u32 key)
800{
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;
805 u32 rc_dests;
806
807 spin_lock_bh(&tn->nametbl_lock);
808
809 p = tipc_nametbl_remove_publ(net, ua, sk, key);
810 if (p) {
811 nt->local_publ_count--;
812 skb = tipc_named_withdraw(net, p);
813 list_del_init(&p->binding_sock);
814 kfree_rcu(p, rcu);
815 }
816 rc_dests = nt->rc_dests;
817 spin_unlock_bh(&tn->nametbl_lock);
818
819 if (skb)
820 tipc_node_broadcast(net, skb, rc_dests);
821}
822
823/**
824 * tipc_nametbl_subscribe - add a subscription object to the name table
825 * @sub: subscription to add
826 */
827bool tipc_nametbl_subscribe(struct tipc_subscription *sub)
828{
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;
833 bool res = true;
834
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);
839 if (!sc)
840 sc = tipc_service_create(sub->net, &ua);
841 if (sc) {
842 spin_lock_bh(&sc->lock);
843 tipc_service_subscribe(sc, sub);
844 spin_unlock_bh(&sc->lock);
845 } else {
846 pr_warn("Failed to subscribe for {%u,%u,%u}\n",
847 type, sub->s.seq.lower, sub->s.seq.upper);
848 res = false;
849 }
850 spin_unlock_bh(&tn->nametbl_lock);
851 return res;
852}
853
854/**
855 * tipc_nametbl_unsubscribe - remove a subscription object from name table
856 * @sub: subscription to remove
857 */
858void tipc_nametbl_unsubscribe(struct tipc_subscription *sub)
859{
860 struct tipc_net *tn = tipc_net(sub->net);
861 struct tipc_service *sc;
862 struct tipc_uaddr ua;
863
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);
868 if (!sc)
869 goto exit;
870
871 spin_lock_bh(&sc->lock);
872 list_del_init(&sub->service_list);
873 tipc_sub_put(sub);
874
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);
878 kfree_rcu(sc, rcu);
879 }
880 spin_unlock_bh(&sc->lock);
881exit:
882 spin_unlock_bh(&tn->nametbl_lock);
883}
884
885int tipc_nametbl_init(struct net *net)
886{
887 struct tipc_net *tn = tipc_net(net);
888 struct name_table *nt;
889 int i;
890
891 nt = kzalloc(sizeof(*nt), GFP_KERNEL);
892 if (!nt)
893 return -ENOMEM;
894
895 for (i = 0; i < TIPC_NAMETBL_SIZE; i++)
896 INIT_HLIST_HEAD(&nt->services[i]);
897
898 INIT_LIST_HEAD(&nt->node_scope);
899 INIT_LIST_HEAD(&nt->cluster_scope);
900 rwlock_init(&nt->cluster_scope_lock);
901 tn->nametbl = nt;
902 spin_lock_init(&tn->nametbl_lock);
903 return 0;
904}
905
906/**
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
910 */
911static void tipc_service_delete(struct net *net, struct tipc_service *sc)
912{
913 struct service_range *sr, *tmpr;
914 struct publication *p, *tmp;
915
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);
920 kfree_rcu(p, rcu);
921 }
922 rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks);
923 kfree(sr);
924 }
925 hlist_del_init_rcu(&sc->service_list);
926 spin_unlock_bh(&sc->lock);
927 kfree_rcu(sc, rcu);
928}
929
930void tipc_nametbl_stop(struct net *net)
931{
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;
936 u32 i;
937
938 /* Verify name table is empty and purge any lingering
939 * publications, then release the name table
940 */
941 spin_lock_bh(&tn->nametbl_lock);
942 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) {
943 if (hlist_empty(&nt->services[i]))
944 continue;
945 service_head = &nt->services[i];
946 hlist_for_each_entry_rcu(service, service_head, service_list) {
947 tipc_service_delete(net, service);
948 }
949 }
950 spin_unlock_bh(&tn->nametbl_lock);
951
952 synchronize_net();
953 kfree(nt);
954}
955
956static int __tipc_nl_add_nametable_publ(struct tipc_nl_msg *msg,
957 struct tipc_service *service,
958 struct service_range *sr,
959 u32 *last_key)
960{
961 struct publication *p;
962 struct nlattr *attrs;
963 struct nlattr *b;
964 void *hdr;
965
966 if (*last_key) {
967 list_for_each_entry(p, &sr->all_publ, all_publ)
968 if (p->key == *last_key)
969 break;
970 if (p->key != *last_key)
971 return -EPIPE;
972 } else {
973 p = list_first_entry(&sr->all_publ,
974 struct publication,
975 all_publ);
976 }
977
978 list_for_each_entry_from(p, &sr->all_publ, all_publ) {
979 *last_key = p->key;
980
981 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq,
982 &tipc_genl_family, NLM_F_MULTI,
983 TIPC_NL_NAME_TABLE_GET);
984 if (!hdr)
985 return -EMSGSIZE;
986
987 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_NAME_TABLE);
988 if (!attrs)
989 goto msg_full;
990
991 b = nla_nest_start_noflag(msg->skb, TIPC_NLA_NAME_TABLE_PUBL);
992 if (!b)
993 goto attr_msg_full;
994
995 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_TYPE, service->type))
996 goto publ_msg_full;
997 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_LOWER, sr->lower))
998 goto publ_msg_full;
999 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_UPPER, sr->upper))
1000 goto publ_msg_full;
1001 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_SCOPE, p->scope))
1002 goto publ_msg_full;
1003 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_NODE, p->sk.node))
1004 goto publ_msg_full;
1005 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_REF, p->sk.ref))
1006 goto publ_msg_full;
1007 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_KEY, p->key))
1008 goto publ_msg_full;
1009
1010 nla_nest_end(msg->skb, b);
1011 nla_nest_end(msg->skb, attrs);
1012 genlmsg_end(msg->skb, hdr);
1013 }
1014 *last_key = 0;
1015
1016 return 0;
1017
1018publ_msg_full:
1019 nla_nest_cancel(msg->skb, b);
1020attr_msg_full:
1021 nla_nest_cancel(msg->skb, attrs);
1022msg_full:
1023 genlmsg_cancel(msg->skb, hdr);
1024
1025 return -EMSGSIZE;
1026}
1027
1028static int __tipc_nl_service_range_list(struct tipc_nl_msg *msg,
1029 struct tipc_service *sc,
1030 u32 *last_lower, u32 *last_key)
1031{
1032 struct service_range *sr;
1033 struct rb_node *n;
1034 int err;
1035
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)
1039 continue;
1040 err = __tipc_nl_add_nametable_publ(msg, sc, sr, last_key);
1041 if (err) {
1042 *last_lower = sr->lower;
1043 return err;
1044 }
1045 }
1046 *last_lower = 0;
1047 return 0;
1048}
1049
1050static int tipc_nl_service_list(struct net *net, struct tipc_nl_msg *msg,
1051 u32 *last_type, u32 *last_lower, u32 *last_key)
1052{
1053 struct tipc_net *tn = tipc_net(net);
1054 struct tipc_service *service = NULL;
1055 struct hlist_head *head;
1056 struct tipc_uaddr ua;
1057 int err;
1058 int i;
1059
1060 if (*last_type)
1061 i = hash(*last_type);
1062 else
1063 i = 0;
1064
1065 for (; i < TIPC_NAMETBL_SIZE; i++) {
1066 head = &tn->nametbl->services[i];
1067
1068 if (*last_type ||
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);
1073 if (!service)
1074 return -EPIPE;
1075 } else {
1076 hlist_for_each_entry_rcu(service, head, service_list)
1077 break;
1078 if (!service)
1079 continue;
1080 }
1081
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,
1085 last_lower,
1086 last_key);
1087
1088 if (err) {
1089 *last_type = service->type;
1090 spin_unlock_bh(&service->lock);
1091 return err;
1092 }
1093 spin_unlock_bh(&service->lock);
1094 }
1095 *last_type = 0;
1096 }
1097 return 0;
1098}
1099
1100int tipc_nl_name_table_dump(struct sk_buff *skb, struct netlink_callback *cb)
1101{
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;
1108 int err;
1109
1110 if (done)
1111 return 0;
1112
1113 msg.skb = skb;
1114 msg.portid = NETLINK_CB(cb->skb).portid;
1115 msg.seq = cb->nlh->nlmsg_seq;
1116
1117 rcu_read_lock();
1118 err = tipc_nl_service_list(net, &msg, &last_type,
1119 &last_lower, &last_key);
1120 if (!err) {
1121 done = 1;
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
1127 * we got an error.
1128 */
1129 cb->prev_seq = 1;
1130 }
1131 rcu_read_unlock();
1132
1133 cb->args[0] = last_type;
1134 cb->args[1] = last_lower;
1135 cb->args[2] = last_key;
1136 cb->args[3] = done;
1137
1138 return skb->len;
1139}
1140
1141struct tipc_dest *tipc_dest_find(struct list_head *l, u32 node, u32 port)
1142{
1143 struct tipc_dest *dst;
1144
1145 list_for_each_entry(dst, l, list) {
1146 if (dst->node == node && dst->port == port)
1147 return dst;
1148 }
1149 return NULL;
1150}
1151
1152bool tipc_dest_push(struct list_head *l, u32 node, u32 port)
1153{
1154 struct tipc_dest *dst;
1155
1156 if (tipc_dest_find(l, node, port))
1157 return false;
1158
1159 dst = kmalloc(sizeof(*dst), GFP_ATOMIC);
1160 if (unlikely(!dst))
1161 return false;
1162 dst->node = node;
1163 dst->port = port;
1164 list_add(&dst->list, l);
1165 return true;
1166}
1167
1168bool tipc_dest_pop(struct list_head *l, u32 *node, u32 *port)
1169{
1170 struct tipc_dest *dst;
1171
1172 if (list_empty(l))
1173 return false;
1174 dst = list_first_entry(l, typeof(*dst), list);
1175 if (port)
1176 *port = dst->port;
1177 if (node)
1178 *node = dst->node;
1179 list_del(&dst->list);
1180 kfree(dst);
1181 return true;
1182}
1183
1184bool tipc_dest_del(struct list_head *l, u32 node, u32 port)
1185{
1186 struct tipc_dest *dst;
1187
1188 dst = tipc_dest_find(l, node, port);
1189 if (!dst)
1190 return false;
1191 list_del(&dst->list);
1192 kfree(dst);
1193 return true;
1194}
1195
1196void tipc_dest_list_purge(struct list_head *l)
1197{
1198 struct tipc_dest *dst, *tmp;
1199
1200 list_for_each_entry_safe(dst, tmp, l, list) {
1201 list_del(&dst->list);
1202 kfree(dst);
1203 }
1204}
1205
1206int tipc_dest_list_len(struct list_head *l)
1207{
1208 struct tipc_dest *dst;
1209 int i = 0;
1210
1211 list_for_each_entry(dst, l, list) {
1212 i++;
1213 }
1214 return i;
1215}
1/*
2 * net/tipc/name_table.c: TIPC name table code
3 *
4 * Copyright (c) 2000-2006, Ericsson AB
5 * Copyright (c) 2004-2008, 2010-2011, Wind River Systems
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
19 *
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
38#include "config.h"
39#include "name_table.h"
40#include "name_distr.h"
41#include "subscr.h"
42#include "port.h"
43
44static int tipc_nametbl_size = 1024; /* must be a power of 2 */
45
46/**
47 * struct name_info - name sequence publication info
48 * @node_list: circular list of publications made by own node
49 * @cluster_list: circular list of publications made by own cluster
50 * @zone_list: circular list of publications made by own zone
51 * @node_list_size: number of entries in "node_list"
52 * @cluster_list_size: number of entries in "cluster_list"
53 * @zone_list_size: number of entries in "zone_list"
54 *
55 * Note: The zone list always contains at least one entry, since all
56 * publications of the associated name sequence belong to it.
57 * (The cluster and node lists may be empty.)
58 */
59struct name_info {
60 struct list_head node_list;
61 struct list_head cluster_list;
62 struct list_head zone_list;
63 u32 node_list_size;
64 u32 cluster_list_size;
65 u32 zone_list_size;
66};
67
68/**
69 * struct sub_seq - container for all published instances of a name sequence
70 * @lower: name sequence lower bound
71 * @upper: name sequence upper bound
72 * @info: pointer to name sequence publication info
73 */
74struct sub_seq {
75 u32 lower;
76 u32 upper;
77 struct name_info *info;
78};
79
80/**
81 * struct name_seq - container for all published instances of a name type
82 * @type: 32 bit 'type' value for name sequence
83 * @sseq: pointer to dynamically-sized array of sub-sequences of this 'type';
84 * sub-sequences are sorted in ascending order
85 * @alloc: number of sub-sequences currently in array
86 * @first_free: array index of first unused sub-sequence entry
87 * @ns_list: links to adjacent name sequences in hash chain
88 * @subscriptions: list of subscriptions for this 'type'
89 * @lock: spinlock controlling access to publication lists of all sub-sequences
90 */
91struct name_seq {
92 u32 type;
93 struct sub_seq *sseqs;
94 u32 alloc;
95 u32 first_free;
96 struct hlist_node ns_list;
97 struct list_head subscriptions;
98 spinlock_t lock;
99};
100
101/**
102 * struct name_table - table containing all existing port name publications
103 * @types: pointer to fixed-sized array of name sequence lists,
104 * accessed via hashing on 'type'; name sequence lists are *not* sorted
105 * @local_publ_count: number of publications issued by this node
106 */
107struct name_table {
108 struct hlist_head *types;
109 u32 local_publ_count;
110};
111
112static struct name_table table;
113DEFINE_RWLOCK(tipc_nametbl_lock);
114
115static int hash(int x)
116{
117 return x & (tipc_nametbl_size - 1);
118}
119
120/**
121 * publ_create - create a publication structure
122 */
123static struct publication *publ_create(u32 type, u32 lower, u32 upper,
124 u32 scope, u32 node, u32 port_ref,
125 u32 key)
126{
127 struct publication *publ = kzalloc(sizeof(*publ), GFP_ATOMIC);
128 if (publ == NULL) {
129 warn("Publication creation failure, no memory\n");
130 return NULL;
131 }
132
133 publ->type = type;
134 publ->lower = lower;
135 publ->upper = upper;
136 publ->scope = scope;
137 publ->node = node;
138 publ->ref = port_ref;
139 publ->key = key;
140 INIT_LIST_HEAD(&publ->local_list);
141 INIT_LIST_HEAD(&publ->pport_list);
142 INIT_LIST_HEAD(&publ->subscr.nodesub_list);
143 return publ;
144}
145
146/**
147 * tipc_subseq_alloc - allocate a specified number of sub-sequence structures
148 */
149static struct sub_seq *tipc_subseq_alloc(u32 cnt)
150{
151 struct sub_seq *sseq = kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC);
152 return sseq;
153}
154
155/**
156 * tipc_nameseq_create - create a name sequence structure for the specified 'type'
157 *
158 * Allocates a single sub-sequence structure and sets it to all 0's.
159 */
160static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head)
161{
162 struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC);
163 struct sub_seq *sseq = tipc_subseq_alloc(1);
164
165 if (!nseq || !sseq) {
166 warn("Name sequence creation failed, no memory\n");
167 kfree(nseq);
168 kfree(sseq);
169 return NULL;
170 }
171
172 spin_lock_init(&nseq->lock);
173 nseq->type = type;
174 nseq->sseqs = sseq;
175 nseq->alloc = 1;
176 INIT_HLIST_NODE(&nseq->ns_list);
177 INIT_LIST_HEAD(&nseq->subscriptions);
178 hlist_add_head(&nseq->ns_list, seq_head);
179 return nseq;
180}
181
182/*
183 * nameseq_delete_empty - deletes a name sequence structure if now unused
184 */
185static void nameseq_delete_empty(struct name_seq *seq)
186{
187 if (!seq->first_free && list_empty(&seq->subscriptions)) {
188 hlist_del_init(&seq->ns_list);
189 kfree(seq->sseqs);
190 kfree(seq);
191 }
192}
193
194/*
195 * nameseq_find_subseq - find sub-sequence (if any) matching a name instance
196 *
197 * Very time-critical, so binary searches through sub-sequence array.
198 */
199static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq,
200 u32 instance)
201{
202 struct sub_seq *sseqs = nseq->sseqs;
203 int low = 0;
204 int high = nseq->first_free - 1;
205 int mid;
206
207 while (low <= high) {
208 mid = (low + high) / 2;
209 if (instance < sseqs[mid].lower)
210 high = mid - 1;
211 else if (instance > sseqs[mid].upper)
212 low = mid + 1;
213 else
214 return &sseqs[mid];
215 }
216 return NULL;
217}
218
219/**
220 * nameseq_locate_subseq - determine position of name instance in sub-sequence
221 *
222 * Returns index in sub-sequence array of the entry that contains the specified
223 * instance value; if no entry contains that value, returns the position
224 * where a new entry for it would be inserted in the array.
225 *
226 * Note: Similar to binary search code for locating a sub-sequence.
227 */
228static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance)
229{
230 struct sub_seq *sseqs = nseq->sseqs;
231 int low = 0;
232 int high = nseq->first_free - 1;
233 int mid;
234
235 while (low <= high) {
236 mid = (low + high) / 2;
237 if (instance < sseqs[mid].lower)
238 high = mid - 1;
239 else if (instance > sseqs[mid].upper)
240 low = mid + 1;
241 else
242 return mid;
243 }
244 return low;
245}
246
247/**
248 * tipc_nameseq_insert_publ
249 */
250static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq,
251 u32 type, u32 lower, u32 upper,
252 u32 scope, u32 node, u32 port, u32 key)
253{
254 struct tipc_subscription *s;
255 struct tipc_subscription *st;
256 struct publication *publ;
257 struct sub_seq *sseq;
258 struct name_info *info;
259 int created_subseq = 0;
260
261 sseq = nameseq_find_subseq(nseq, lower);
262 if (sseq) {
263
264 /* Lower end overlaps existing entry => need an exact match */
265 if ((sseq->lower != lower) || (sseq->upper != upper)) {
266 warn("Cannot publish {%u,%u,%u}, overlap error\n",
267 type, lower, upper);
268 return NULL;
269 }
270
271 info = sseq->info;
272
273 /* Check if an identical publication already exists */
274 list_for_each_entry(publ, &info->zone_list, zone_list) {
275 if ((publ->ref == port) && (publ->key == key) &&
276 (!publ->node || (publ->node == node)))
277 return NULL;
278 }
279 } else {
280 u32 inspos;
281 struct sub_seq *freesseq;
282
283 /* Find where lower end should be inserted */
284 inspos = nameseq_locate_subseq(nseq, lower);
285
286 /* Fail if upper end overlaps into an existing entry */
287 if ((inspos < nseq->first_free) &&
288 (upper >= nseq->sseqs[inspos].lower)) {
289 warn("Cannot publish {%u,%u,%u}, overlap error\n",
290 type, lower, upper);
291 return NULL;
292 }
293
294 /* Ensure there is space for new sub-sequence */
295 if (nseq->first_free == nseq->alloc) {
296 struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2);
297
298 if (!sseqs) {
299 warn("Cannot publish {%u,%u,%u}, no memory\n",
300 type, lower, upper);
301 return NULL;
302 }
303 memcpy(sseqs, nseq->sseqs,
304 nseq->alloc * sizeof(struct sub_seq));
305 kfree(nseq->sseqs);
306 nseq->sseqs = sseqs;
307 nseq->alloc *= 2;
308 }
309
310 info = kzalloc(sizeof(*info), GFP_ATOMIC);
311 if (!info) {
312 warn("Cannot publish {%u,%u,%u}, no memory\n",
313 type, lower, upper);
314 return NULL;
315 }
316
317 INIT_LIST_HEAD(&info->node_list);
318 INIT_LIST_HEAD(&info->cluster_list);
319 INIT_LIST_HEAD(&info->zone_list);
320
321 /* Insert new sub-sequence */
322 sseq = &nseq->sseqs[inspos];
323 freesseq = &nseq->sseqs[nseq->first_free];
324 memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq));
325 memset(sseq, 0, sizeof(*sseq));
326 nseq->first_free++;
327 sseq->lower = lower;
328 sseq->upper = upper;
329 sseq->info = info;
330 created_subseq = 1;
331 }
332
333 /* Insert a publication */
334 publ = publ_create(type, lower, upper, scope, node, port, key);
335 if (!publ)
336 return NULL;
337
338 list_add(&publ->zone_list, &info->zone_list);
339 info->zone_list_size++;
340
341 if (in_own_cluster(node)) {
342 list_add(&publ->cluster_list, &info->cluster_list);
343 info->cluster_list_size++;
344 }
345
346 if (in_own_node(node)) {
347 list_add(&publ->node_list, &info->node_list);
348 info->node_list_size++;
349 }
350
351 /* Any subscriptions waiting for notification? */
352 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
353 tipc_subscr_report_overlap(s,
354 publ->lower,
355 publ->upper,
356 TIPC_PUBLISHED,
357 publ->ref,
358 publ->node,
359 created_subseq);
360 }
361 return publ;
362}
363
364/**
365 * tipc_nameseq_remove_publ
366 *
367 * NOTE: There may be cases where TIPC is asked to remove a publication
368 * that is not in the name table. For example, if another node issues a
369 * publication for a name sequence that overlaps an existing name sequence
370 * the publication will not be recorded, which means the publication won't
371 * be found when the name sequence is later withdrawn by that node.
372 * A failed withdraw request simply returns a failure indication and lets the
373 * caller issue any error or warning messages associated with such a problem.
374 */
375static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 inst,
376 u32 node, u32 ref, u32 key)
377{
378 struct publication *publ;
379 struct sub_seq *sseq = nameseq_find_subseq(nseq, inst);
380 struct name_info *info;
381 struct sub_seq *free;
382 struct tipc_subscription *s, *st;
383 int removed_subseq = 0;
384
385 if (!sseq)
386 return NULL;
387
388 info = sseq->info;
389
390 /* Locate publication, if it exists */
391 list_for_each_entry(publ, &info->zone_list, zone_list) {
392 if ((publ->key == key) && (publ->ref == ref) &&
393 (!publ->node || (publ->node == node)))
394 goto found;
395 }
396 return NULL;
397
398found:
399 /* Remove publication from zone scope list */
400 list_del(&publ->zone_list);
401 info->zone_list_size--;
402
403 /* Remove publication from cluster scope list, if present */
404 if (in_own_cluster(node)) {
405 list_del(&publ->cluster_list);
406 info->cluster_list_size--;
407 }
408
409 /* Remove publication from node scope list, if present */
410 if (in_own_node(node)) {
411 list_del(&publ->node_list);
412 info->node_list_size--;
413 }
414
415 /* Contract subseq list if no more publications for that subseq */
416 if (list_empty(&info->zone_list)) {
417 kfree(info);
418 free = &nseq->sseqs[nseq->first_free--];
419 memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq));
420 removed_subseq = 1;
421 }
422
423 /* Notify any waiting subscriptions */
424 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
425 tipc_subscr_report_overlap(s,
426 publ->lower,
427 publ->upper,
428 TIPC_WITHDRAWN,
429 publ->ref,
430 publ->node,
431 removed_subseq);
432 }
433
434 return publ;
435}
436
437/**
438 * tipc_nameseq_subscribe: attach a subscription, and issue
439 * the prescribed number of events if there is any sub-
440 * sequence overlapping with the requested sequence
441 */
442static void tipc_nameseq_subscribe(struct name_seq *nseq,
443 struct tipc_subscription *s)
444{
445 struct sub_seq *sseq = nseq->sseqs;
446
447 list_add(&s->nameseq_list, &nseq->subscriptions);
448
449 if (!sseq)
450 return;
451
452 while (sseq != &nseq->sseqs[nseq->first_free]) {
453 if (tipc_subscr_overlap(s, sseq->lower, sseq->upper)) {
454 struct publication *crs;
455 struct name_info *info = sseq->info;
456 int must_report = 1;
457
458 list_for_each_entry(crs, &info->zone_list, zone_list) {
459 tipc_subscr_report_overlap(s,
460 sseq->lower,
461 sseq->upper,
462 TIPC_PUBLISHED,
463 crs->ref,
464 crs->node,
465 must_report);
466 must_report = 0;
467 }
468 }
469 sseq++;
470 }
471}
472
473static struct name_seq *nametbl_find_seq(u32 type)
474{
475 struct hlist_head *seq_head;
476 struct hlist_node *seq_node;
477 struct name_seq *ns;
478
479 seq_head = &table.types[hash(type)];
480 hlist_for_each_entry(ns, seq_node, seq_head, ns_list) {
481 if (ns->type == type)
482 return ns;
483 }
484
485 return NULL;
486};
487
488struct publication *tipc_nametbl_insert_publ(u32 type, u32 lower, u32 upper,
489 u32 scope, u32 node, u32 port, u32 key)
490{
491 struct name_seq *seq = nametbl_find_seq(type);
492
493 if ((scope < TIPC_ZONE_SCOPE) || (scope > TIPC_NODE_SCOPE) ||
494 (lower > upper)) {
495 dbg("Failed to publish illegal {%u,%u,%u} with scope %u\n",
496 type, lower, upper, scope);
497 return NULL;
498 }
499
500 if (!seq)
501 seq = tipc_nameseq_create(type, &table.types[hash(type)]);
502 if (!seq)
503 return NULL;
504
505 return tipc_nameseq_insert_publ(seq, type, lower, upper,
506 scope, node, port, key);
507}
508
509struct publication *tipc_nametbl_remove_publ(u32 type, u32 lower,
510 u32 node, u32 ref, u32 key)
511{
512 struct publication *publ;
513 struct name_seq *seq = nametbl_find_seq(type);
514
515 if (!seq)
516 return NULL;
517
518 publ = tipc_nameseq_remove_publ(seq, lower, node, ref, key);
519 nameseq_delete_empty(seq);
520 return publ;
521}
522
523/*
524 * tipc_nametbl_translate - perform name translation
525 *
526 * On entry, 'destnode' is the search domain used during translation.
527 *
528 * On exit:
529 * - if name translation is deferred to another node/cluster/zone,
530 * leaves 'destnode' unchanged (will be non-zero) and returns 0
531 * - if name translation is attempted and succeeds, sets 'destnode'
532 * to publishing node and returns port reference (will be non-zero)
533 * - if name translation is attempted and fails, sets 'destnode' to 0
534 * and returns 0
535 */
536u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode)
537{
538 struct sub_seq *sseq;
539 struct name_info *info;
540 struct publication *publ;
541 struct name_seq *seq;
542 u32 ref = 0;
543 u32 node = 0;
544
545 if (!tipc_in_scope(*destnode, tipc_own_addr))
546 return 0;
547
548 read_lock_bh(&tipc_nametbl_lock);
549 seq = nametbl_find_seq(type);
550 if (unlikely(!seq))
551 goto not_found;
552 sseq = nameseq_find_subseq(seq, instance);
553 if (unlikely(!sseq))
554 goto not_found;
555 spin_lock_bh(&seq->lock);
556 info = sseq->info;
557
558 /* Closest-First Algorithm */
559 if (likely(!*destnode)) {
560 if (!list_empty(&info->node_list)) {
561 publ = list_first_entry(&info->node_list,
562 struct publication,
563 node_list);
564 list_move_tail(&publ->node_list,
565 &info->node_list);
566 } else if (!list_empty(&info->cluster_list)) {
567 publ = list_first_entry(&info->cluster_list,
568 struct publication,
569 cluster_list);
570 list_move_tail(&publ->cluster_list,
571 &info->cluster_list);
572 } else {
573 publ = list_first_entry(&info->zone_list,
574 struct publication,
575 zone_list);
576 list_move_tail(&publ->zone_list,
577 &info->zone_list);
578 }
579 }
580
581 /* Round-Robin Algorithm */
582 else if (*destnode == tipc_own_addr) {
583 if (list_empty(&info->node_list))
584 goto no_match;
585 publ = list_first_entry(&info->node_list, struct publication,
586 node_list);
587 list_move_tail(&publ->node_list, &info->node_list);
588 } else if (in_own_cluster_exact(*destnode)) {
589 if (list_empty(&info->cluster_list))
590 goto no_match;
591 publ = list_first_entry(&info->cluster_list, struct publication,
592 cluster_list);
593 list_move_tail(&publ->cluster_list, &info->cluster_list);
594 } else {
595 publ = list_first_entry(&info->zone_list, struct publication,
596 zone_list);
597 list_move_tail(&publ->zone_list, &info->zone_list);
598 }
599
600 ref = publ->ref;
601 node = publ->node;
602no_match:
603 spin_unlock_bh(&seq->lock);
604not_found:
605 read_unlock_bh(&tipc_nametbl_lock);
606 *destnode = node;
607 return ref;
608}
609
610/**
611 * tipc_nametbl_mc_translate - find multicast destinations
612 *
613 * Creates list of all local ports that overlap the given multicast address;
614 * also determines if any off-node ports overlap.
615 *
616 * Note: Publications with a scope narrower than 'limit' are ignored.
617 * (i.e. local node-scope publications mustn't receive messages arriving
618 * from another node, even if the multcast link brought it here)
619 *
620 * Returns non-zero if any off-node ports overlap
621 */
622int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit,
623 struct tipc_port_list *dports)
624{
625 struct name_seq *seq;
626 struct sub_seq *sseq;
627 struct sub_seq *sseq_stop;
628 struct name_info *info;
629 int res = 0;
630
631 read_lock_bh(&tipc_nametbl_lock);
632 seq = nametbl_find_seq(type);
633 if (!seq)
634 goto exit;
635
636 spin_lock_bh(&seq->lock);
637
638 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower);
639 sseq_stop = seq->sseqs + seq->first_free;
640 for (; sseq != sseq_stop; sseq++) {
641 struct publication *publ;
642
643 if (sseq->lower > upper)
644 break;
645
646 info = sseq->info;
647 list_for_each_entry(publ, &info->node_list, node_list) {
648 if (publ->scope <= limit)
649 tipc_port_list_add(dports, publ->ref);
650 }
651
652 if (info->cluster_list_size != info->node_list_size)
653 res = 1;
654 }
655
656 spin_unlock_bh(&seq->lock);
657exit:
658 read_unlock_bh(&tipc_nametbl_lock);
659 return res;
660}
661
662/*
663 * tipc_nametbl_publish - add name publication to network name tables
664 */
665struct publication *tipc_nametbl_publish(u32 type, u32 lower, u32 upper,
666 u32 scope, u32 port_ref, u32 key)
667{
668 struct publication *publ;
669
670 if (table.local_publ_count >= tipc_max_publications) {
671 warn("Publication failed, local publication limit reached (%u)\n",
672 tipc_max_publications);
673 return NULL;
674 }
675
676 write_lock_bh(&tipc_nametbl_lock);
677 publ = tipc_nametbl_insert_publ(type, lower, upper, scope,
678 tipc_own_addr, port_ref, key);
679 if (likely(publ)) {
680 table.local_publ_count++;
681 tipc_named_publish(publ);
682 }
683 write_unlock_bh(&tipc_nametbl_lock);
684 return publ;
685}
686
687/**
688 * tipc_nametbl_withdraw - withdraw name publication from network name tables
689 */
690int tipc_nametbl_withdraw(u32 type, u32 lower, u32 ref, u32 key)
691{
692 struct publication *publ;
693
694 write_lock_bh(&tipc_nametbl_lock);
695 publ = tipc_nametbl_remove_publ(type, lower, tipc_own_addr, ref, key);
696 if (likely(publ)) {
697 table.local_publ_count--;
698 tipc_named_withdraw(publ);
699 write_unlock_bh(&tipc_nametbl_lock);
700 list_del_init(&publ->pport_list);
701 kfree(publ);
702 return 1;
703 }
704 write_unlock_bh(&tipc_nametbl_lock);
705 err("Unable to remove local publication\n"
706 "(type=%u, lower=%u, ref=%u, key=%u)\n",
707 type, lower, ref, key);
708 return 0;
709}
710
711/**
712 * tipc_nametbl_subscribe - add a subscription object to the name table
713 */
714void tipc_nametbl_subscribe(struct tipc_subscription *s)
715{
716 u32 type = s->seq.type;
717 struct name_seq *seq;
718
719 write_lock_bh(&tipc_nametbl_lock);
720 seq = nametbl_find_seq(type);
721 if (!seq)
722 seq = tipc_nameseq_create(type, &table.types[hash(type)]);
723 if (seq) {
724 spin_lock_bh(&seq->lock);
725 tipc_nameseq_subscribe(seq, s);
726 spin_unlock_bh(&seq->lock);
727 } else {
728 warn("Failed to create subscription for {%u,%u,%u}\n",
729 s->seq.type, s->seq.lower, s->seq.upper);
730 }
731 write_unlock_bh(&tipc_nametbl_lock);
732}
733
734/**
735 * tipc_nametbl_unsubscribe - remove a subscription object from name table
736 */
737void tipc_nametbl_unsubscribe(struct tipc_subscription *s)
738{
739 struct name_seq *seq;
740
741 write_lock_bh(&tipc_nametbl_lock);
742 seq = nametbl_find_seq(s->seq.type);
743 if (seq != NULL) {
744 spin_lock_bh(&seq->lock);
745 list_del_init(&s->nameseq_list);
746 spin_unlock_bh(&seq->lock);
747 nameseq_delete_empty(seq);
748 }
749 write_unlock_bh(&tipc_nametbl_lock);
750}
751
752
753/**
754 * subseq_list: print specified sub-sequence contents into the given buffer
755 */
756static void subseq_list(struct sub_seq *sseq, struct print_buf *buf, u32 depth,
757 u32 index)
758{
759 char portIdStr[27];
760 const char *scope_str[] = {"", " zone", " cluster", " node"};
761 struct publication *publ;
762 struct name_info *info;
763
764 tipc_printf(buf, "%-10u %-10u ", sseq->lower, sseq->upper);
765
766 if (depth == 2) {
767 tipc_printf(buf, "\n");
768 return;
769 }
770
771 info = sseq->info;
772
773 list_for_each_entry(publ, &info->zone_list, zone_list) {
774 sprintf(portIdStr, "<%u.%u.%u:%u>",
775 tipc_zone(publ->node), tipc_cluster(publ->node),
776 tipc_node(publ->node), publ->ref);
777 tipc_printf(buf, "%-26s ", portIdStr);
778 if (depth > 3) {
779 tipc_printf(buf, "%-10u %s", publ->key,
780 scope_str[publ->scope]);
781 }
782 if (!list_is_last(&publ->zone_list, &info->zone_list))
783 tipc_printf(buf, "\n%33s", " ");
784 };
785
786 tipc_printf(buf, "\n");
787}
788
789/**
790 * nameseq_list: print specified name sequence contents into the given buffer
791 */
792static void nameseq_list(struct name_seq *seq, struct print_buf *buf, u32 depth,
793 u32 type, u32 lowbound, u32 upbound, u32 index)
794{
795 struct sub_seq *sseq;
796 char typearea[11];
797
798 if (seq->first_free == 0)
799 return;
800
801 sprintf(typearea, "%-10u", seq->type);
802
803 if (depth == 1) {
804 tipc_printf(buf, "%s\n", typearea);
805 return;
806 }
807
808 for (sseq = seq->sseqs; sseq != &seq->sseqs[seq->first_free]; sseq++) {
809 if ((lowbound <= sseq->upper) && (upbound >= sseq->lower)) {
810 tipc_printf(buf, "%s ", typearea);
811 spin_lock_bh(&seq->lock);
812 subseq_list(sseq, buf, depth, index);
813 spin_unlock_bh(&seq->lock);
814 sprintf(typearea, "%10s", " ");
815 }
816 }
817}
818
819/**
820 * nametbl_header - print name table header into the given buffer
821 */
822static void nametbl_header(struct print_buf *buf, u32 depth)
823{
824 const char *header[] = {
825 "Type ",
826 "Lower Upper ",
827 "Port Identity ",
828 "Publication Scope"
829 };
830
831 int i;
832
833 if (depth > 4)
834 depth = 4;
835 for (i = 0; i < depth; i++)
836 tipc_printf(buf, header[i]);
837 tipc_printf(buf, "\n");
838}
839
840/**
841 * nametbl_list - print specified name table contents into the given buffer
842 */
843static void nametbl_list(struct print_buf *buf, u32 depth_info,
844 u32 type, u32 lowbound, u32 upbound)
845{
846 struct hlist_head *seq_head;
847 struct hlist_node *seq_node;
848 struct name_seq *seq;
849 int all_types;
850 u32 depth;
851 u32 i;
852
853 all_types = (depth_info & TIPC_NTQ_ALLTYPES);
854 depth = (depth_info & ~TIPC_NTQ_ALLTYPES);
855
856 if (depth == 0)
857 return;
858
859 if (all_types) {
860 /* display all entries in name table to specified depth */
861 nametbl_header(buf, depth);
862 lowbound = 0;
863 upbound = ~0;
864 for (i = 0; i < tipc_nametbl_size; i++) {
865 seq_head = &table.types[i];
866 hlist_for_each_entry(seq, seq_node, seq_head, ns_list) {
867 nameseq_list(seq, buf, depth, seq->type,
868 lowbound, upbound, i);
869 }
870 }
871 } else {
872 /* display only the sequence that matches the specified type */
873 if (upbound < lowbound) {
874 tipc_printf(buf, "invalid name sequence specified\n");
875 return;
876 }
877 nametbl_header(buf, depth);
878 i = hash(type);
879 seq_head = &table.types[i];
880 hlist_for_each_entry(seq, seq_node, seq_head, ns_list) {
881 if (seq->type == type) {
882 nameseq_list(seq, buf, depth, type,
883 lowbound, upbound, i);
884 break;
885 }
886 }
887 }
888}
889
890#define MAX_NAME_TBL_QUERY 32768
891
892struct sk_buff *tipc_nametbl_get(const void *req_tlv_area, int req_tlv_space)
893{
894 struct sk_buff *buf;
895 struct tipc_name_table_query *argv;
896 struct tlv_desc *rep_tlv;
897 struct print_buf b;
898 int str_len;
899
900 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NAME_TBL_QUERY))
901 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
902
903 buf = tipc_cfg_reply_alloc(TLV_SPACE(MAX_NAME_TBL_QUERY));
904 if (!buf)
905 return NULL;
906
907 rep_tlv = (struct tlv_desc *)buf->data;
908 tipc_printbuf_init(&b, TLV_DATA(rep_tlv), MAX_NAME_TBL_QUERY);
909 argv = (struct tipc_name_table_query *)TLV_DATA(req_tlv_area);
910 read_lock_bh(&tipc_nametbl_lock);
911 nametbl_list(&b, ntohl(argv->depth), ntohl(argv->type),
912 ntohl(argv->lowbound), ntohl(argv->upbound));
913 read_unlock_bh(&tipc_nametbl_lock);
914 str_len = tipc_printbuf_validate(&b);
915
916 skb_put(buf, TLV_SPACE(str_len));
917 TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len);
918
919 return buf;
920}
921
922int tipc_nametbl_init(void)
923{
924 table.types = kcalloc(tipc_nametbl_size, sizeof(struct hlist_head),
925 GFP_ATOMIC);
926 if (!table.types)
927 return -ENOMEM;
928
929 table.local_publ_count = 0;
930 return 0;
931}
932
933void tipc_nametbl_stop(void)
934{
935 u32 i;
936
937 if (!table.types)
938 return;
939
940 /* Verify name table is empty, then release it */
941 write_lock_bh(&tipc_nametbl_lock);
942 for (i = 0; i < tipc_nametbl_size; i++) {
943 if (!hlist_empty(&table.types[i]))
944 err("tipc_nametbl_stop(): hash chain %u is non-null\n", i);
945 }
946 kfree(table.types);
947 table.types = NULL;
948 write_unlock_bh(&tipc_nametbl_lock);
949}