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 * 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 <net/sock.h>
38#include "core.h"
39#include "netlink.h"
40#include "name_table.h"
41#include "name_distr.h"
42#include "subscr.h"
43#include "bcast.h"
44#include "addr.h"
45#include "node.h"
46#include "group.h"
47
48/**
49 * struct service_range - container for all bindings of a service range
50 * @lower: service range lower bound
51 * @upper: service range upper bound
52 * @tree_node: member of service range RB tree
53 * @local_publ: list of identical publications made from this node
54 * Used by closest_first lookup and multicast lookup algorithm
55 * @all_publ: all publications identical to this one, whatever node and scope
56 * Used by round-robin lookup algorithm
57 */
58struct service_range {
59 u32 lower;
60 u32 upper;
61 struct rb_node tree_node;
62 struct list_head local_publ;
63 struct list_head all_publ;
64};
65
66/**
67 * struct tipc_service - container for all published instances of a service type
68 * @type: 32 bit 'type' value for service
69 * @ranges: rb tree containing all service ranges for this service
70 * @service_list: links to adjacent name ranges in hash chain
71 * @subscriptions: list of subscriptions for this service type
72 * @lock: spinlock controlling access to pertaining service ranges/publications
73 * @rcu: RCU callback head used for deferred freeing
74 */
75struct tipc_service {
76 u32 type;
77 struct rb_root ranges;
78 struct hlist_node service_list;
79 struct list_head subscriptions;
80 spinlock_t lock; /* Covers service range list */
81 struct rcu_head rcu;
82};
83
84static int hash(int x)
85{
86 return x & (TIPC_NAMETBL_SIZE - 1);
87}
88
89/**
90 * tipc_publ_create - create a publication structure
91 */
92static struct publication *tipc_publ_create(u32 type, u32 lower, u32 upper,
93 u32 scope, u32 node, u32 port,
94 u32 key)
95{
96 struct publication *publ = kzalloc(sizeof(*publ), GFP_ATOMIC);
97
98 if (!publ)
99 return NULL;
100
101 publ->type = type;
102 publ->lower = lower;
103 publ->upper = upper;
104 publ->scope = scope;
105 publ->node = node;
106 publ->port = port;
107 publ->key = key;
108 INIT_LIST_HEAD(&publ->binding_sock);
109 INIT_LIST_HEAD(&publ->binding_node);
110 INIT_LIST_HEAD(&publ->local_publ);
111 INIT_LIST_HEAD(&publ->all_publ);
112 return publ;
113}
114
115/**
116 * tipc_service_create - create a service structure for the specified 'type'
117 *
118 * Allocates a single range structure and sets it to all 0's.
119 */
120static struct tipc_service *tipc_service_create(u32 type, struct hlist_head *hd)
121{
122 struct tipc_service *service = kzalloc(sizeof(*service), GFP_ATOMIC);
123
124 if (!service) {
125 pr_warn("Service creation failed, no memory\n");
126 return NULL;
127 }
128
129 spin_lock_init(&service->lock);
130 service->type = type;
131 service->ranges = RB_ROOT;
132 INIT_HLIST_NODE(&service->service_list);
133 INIT_LIST_HEAD(&service->subscriptions);
134 hlist_add_head_rcu(&service->service_list, hd);
135 return service;
136}
137
138/**
139 * tipc_service_first_range - find first service range in tree matching instance
140 *
141 * Very time-critical, so binary search through range rb tree
142 */
143static struct service_range *tipc_service_first_range(struct tipc_service *sc,
144 u32 instance)
145{
146 struct rb_node *n = sc->ranges.rb_node;
147 struct service_range *sr;
148
149 while (n) {
150 sr = container_of(n, struct service_range, tree_node);
151 if (sr->lower > instance)
152 n = n->rb_left;
153 else if (sr->upper < instance)
154 n = n->rb_right;
155 else
156 return sr;
157 }
158 return NULL;
159}
160
161/* tipc_service_find_range - find service range matching publication parameters
162 */
163static struct service_range *tipc_service_find_range(struct tipc_service *sc,
164 u32 lower, u32 upper)
165{
166 struct rb_node *n = sc->ranges.rb_node;
167 struct service_range *sr;
168
169 sr = tipc_service_first_range(sc, lower);
170 if (!sr)
171 return NULL;
172
173 /* Look for exact match */
174 for (n = &sr->tree_node; n; n = rb_next(n)) {
175 sr = container_of(n, struct service_range, tree_node);
176 if (sr->upper == upper)
177 break;
178 }
179 if (!n || sr->lower != lower || sr->upper != upper)
180 return NULL;
181
182 return sr;
183}
184
185static struct service_range *tipc_service_create_range(struct tipc_service *sc,
186 u32 lower, u32 upper)
187{
188 struct rb_node **n, *parent = NULL;
189 struct service_range *sr, *tmp;
190
191 n = &sc->ranges.rb_node;
192 while (*n) {
193 tmp = container_of(*n, struct service_range, tree_node);
194 parent = *n;
195 tmp = container_of(parent, struct service_range, tree_node);
196 if (lower < tmp->lower)
197 n = &(*n)->rb_left;
198 else if (lower > tmp->lower)
199 n = &(*n)->rb_right;
200 else if (upper < tmp->upper)
201 n = &(*n)->rb_left;
202 else if (upper > tmp->upper)
203 n = &(*n)->rb_right;
204 else
205 return tmp;
206 }
207 sr = kzalloc(sizeof(*sr), GFP_ATOMIC);
208 if (!sr)
209 return NULL;
210 sr->lower = lower;
211 sr->upper = upper;
212 INIT_LIST_HEAD(&sr->local_publ);
213 INIT_LIST_HEAD(&sr->all_publ);
214 rb_link_node(&sr->tree_node, parent, n);
215 rb_insert_color(&sr->tree_node, &sc->ranges);
216 return sr;
217}
218
219static struct publication *tipc_service_insert_publ(struct net *net,
220 struct tipc_service *sc,
221 u32 type, u32 lower,
222 u32 upper, u32 scope,
223 u32 node, u32 port,
224 u32 key)
225{
226 struct tipc_subscription *sub, *tmp;
227 struct service_range *sr;
228 struct publication *p;
229 bool first = false;
230
231 sr = tipc_service_create_range(sc, lower, upper);
232 if (!sr)
233 goto err;
234
235 first = list_empty(&sr->all_publ);
236
237 /* Return if the publication already exists */
238 list_for_each_entry(p, &sr->all_publ, all_publ) {
239 if (p->key == key && (!p->node || p->node == node))
240 return NULL;
241 }
242
243 /* Create and insert publication */
244 p = tipc_publ_create(type, lower, upper, scope, node, port, key);
245 if (!p)
246 goto err;
247 if (in_own_node(net, node))
248 list_add(&p->local_publ, &sr->local_publ);
249 list_add(&p->all_publ, &sr->all_publ);
250
251 /* Any subscriptions waiting for notification? */
252 list_for_each_entry_safe(sub, tmp, &sc->subscriptions, service_list) {
253 tipc_sub_report_overlap(sub, p->lower, p->upper, TIPC_PUBLISHED,
254 p->port, p->node, p->scope, first);
255 }
256 return p;
257err:
258 pr_warn("Failed to bind to %u,%u,%u, no memory\n", type, lower, upper);
259 return NULL;
260}
261
262/**
263 * tipc_service_remove_publ - remove a publication from a service
264 */
265static struct publication *tipc_service_remove_publ(struct service_range *sr,
266 u32 node, u32 key)
267{
268 struct publication *p;
269
270 list_for_each_entry(p, &sr->all_publ, all_publ) {
271 if (p->key != key || (node && node != p->node))
272 continue;
273 list_del(&p->all_publ);
274 list_del(&p->local_publ);
275 return p;
276 }
277 return NULL;
278}
279
280/**
281 * tipc_service_subscribe - attach a subscription, and optionally
282 * issue the prescribed number of events if there is any service
283 * range overlapping with the requested range
284 */
285static void tipc_service_subscribe(struct tipc_service *service,
286 struct tipc_subscription *sub)
287{
288 struct tipc_subscr *sb = &sub->evt.s;
289 struct service_range *sr;
290 struct tipc_name_seq ns;
291 struct publication *p;
292 struct rb_node *n;
293 bool first;
294
295 ns.type = tipc_sub_read(sb, seq.type);
296 ns.lower = tipc_sub_read(sb, seq.lower);
297 ns.upper = tipc_sub_read(sb, seq.upper);
298
299 tipc_sub_get(sub);
300 list_add(&sub->service_list, &service->subscriptions);
301
302 if (tipc_sub_read(sb, filter) & TIPC_SUB_NO_STATUS)
303 return;
304
305 for (n = rb_first(&service->ranges); n; n = rb_next(n)) {
306 sr = container_of(n, struct service_range, tree_node);
307 if (sr->lower > ns.upper)
308 break;
309 if (!tipc_sub_check_overlap(&ns, sr->lower, sr->upper))
310 continue;
311 first = true;
312
313 list_for_each_entry(p, &sr->all_publ, all_publ) {
314 tipc_sub_report_overlap(sub, sr->lower, sr->upper,
315 TIPC_PUBLISHED, p->port,
316 p->node, p->scope, first);
317 first = false;
318 }
319 }
320}
321
322static struct tipc_service *tipc_service_find(struct net *net, u32 type)
323{
324 struct name_table *nt = tipc_name_table(net);
325 struct hlist_head *service_head;
326 struct tipc_service *service;
327
328 service_head = &nt->services[hash(type)];
329 hlist_for_each_entry_rcu(service, service_head, service_list) {
330 if (service->type == type)
331 return service;
332 }
333 return NULL;
334};
335
336struct publication *tipc_nametbl_insert_publ(struct net *net, u32 type,
337 u32 lower, u32 upper,
338 u32 scope, u32 node,
339 u32 port, u32 key)
340{
341 struct name_table *nt = tipc_name_table(net);
342 struct tipc_service *sc;
343 struct publication *p;
344
345 if (scope > TIPC_NODE_SCOPE || lower > upper) {
346 pr_debug("Failed to bind illegal {%u,%u,%u} with scope %u\n",
347 type, lower, upper, scope);
348 return NULL;
349 }
350 sc = tipc_service_find(net, type);
351 if (!sc)
352 sc = tipc_service_create(type, &nt->services[hash(type)]);
353 if (!sc)
354 return NULL;
355
356 spin_lock_bh(&sc->lock);
357 p = tipc_service_insert_publ(net, sc, type, lower, upper,
358 scope, node, port, key);
359 spin_unlock_bh(&sc->lock);
360 return p;
361}
362
363struct publication *tipc_nametbl_remove_publ(struct net *net, u32 type,
364 u32 lower, u32 upper,
365 u32 node, u32 key)
366{
367 struct tipc_service *sc = tipc_service_find(net, type);
368 struct tipc_subscription *sub, *tmp;
369 struct service_range *sr = NULL;
370 struct publication *p = NULL;
371 bool last;
372
373 if (!sc)
374 return NULL;
375
376 spin_lock_bh(&sc->lock);
377 sr = tipc_service_find_range(sc, lower, upper);
378 if (!sr)
379 goto exit;
380 p = tipc_service_remove_publ(sr, node, key);
381 if (!p)
382 goto exit;
383
384 /* Notify any waiting subscriptions */
385 last = list_empty(&sr->all_publ);
386 list_for_each_entry_safe(sub, tmp, &sc->subscriptions, service_list) {
387 tipc_sub_report_overlap(sub, lower, upper, TIPC_WITHDRAWN,
388 p->port, node, p->scope, last);
389 }
390
391 /* Remove service range item if this was its last publication */
392 if (list_empty(&sr->all_publ)) {
393 rb_erase(&sr->tree_node, &sc->ranges);
394 kfree(sr);
395 }
396
397 /* Delete service item if this no more publications and subscriptions */
398 if (RB_EMPTY_ROOT(&sc->ranges) && list_empty(&sc->subscriptions)) {
399 hlist_del_init_rcu(&sc->service_list);
400 kfree_rcu(sc, rcu);
401 }
402exit:
403 spin_unlock_bh(&sc->lock);
404 return p;
405}
406
407/**
408 * tipc_nametbl_translate - perform service instance to socket translation
409 *
410 * On entry, 'dnode' is the search domain used during translation.
411 *
412 * On exit:
413 * - if translation is deferred to another node, leave 'dnode' unchanged and
414 * return 0
415 * - if translation is attempted and succeeds, set 'dnode' to the publishing
416 * node and return the published (non-zero) port number
417 * - if translation is attempted and fails, set 'dnode' to 0 and return 0
418 *
419 * Note that for legacy users (node configured with Z.C.N address format) the
420 * 'closest-first' lookup algorithm must be maintained, i.e., if dnode is 0
421 * we must look in the local binding list first
422 */
423u32 tipc_nametbl_translate(struct net *net, u32 type, u32 instance, u32 *dnode)
424{
425 struct tipc_net *tn = tipc_net(net);
426 bool legacy = tn->legacy_addr_format;
427 u32 self = tipc_own_addr(net);
428 struct service_range *sr;
429 struct tipc_service *sc;
430 struct list_head *list;
431 struct publication *p;
432 u32 port = 0;
433 u32 node = 0;
434
435 if (!tipc_in_scope(legacy, *dnode, self))
436 return 0;
437
438 rcu_read_lock();
439 sc = tipc_service_find(net, type);
440 if (unlikely(!sc))
441 goto not_found;
442
443 spin_lock_bh(&sc->lock);
444 sr = tipc_service_first_range(sc, instance);
445 if (unlikely(!sr))
446 goto no_match;
447
448 /* Select lookup algorithm: local, closest-first or round-robin */
449 if (*dnode == self) {
450 list = &sr->local_publ;
451 if (list_empty(list))
452 goto no_match;
453 p = list_first_entry(list, struct publication, local_publ);
454 list_move_tail(&p->local_publ, &sr->local_publ);
455 } else if (legacy && !*dnode && !list_empty(&sr->local_publ)) {
456 list = &sr->local_publ;
457 p = list_first_entry(list, struct publication, local_publ);
458 list_move_tail(&p->local_publ, &sr->local_publ);
459 } else {
460 list = &sr->all_publ;
461 p = list_first_entry(list, struct publication, all_publ);
462 list_move_tail(&p->all_publ, &sr->all_publ);
463 }
464 port = p->port;
465 node = p->node;
466no_match:
467 spin_unlock_bh(&sc->lock);
468not_found:
469 rcu_read_unlock();
470 *dnode = node;
471 return port;
472}
473
474bool tipc_nametbl_lookup(struct net *net, u32 type, u32 instance, u32 scope,
475 struct list_head *dsts, int *dstcnt, u32 exclude,
476 bool all)
477{
478 u32 self = tipc_own_addr(net);
479 struct service_range *sr;
480 struct tipc_service *sc;
481 struct publication *p;
482
483 *dstcnt = 0;
484 rcu_read_lock();
485 sc = tipc_service_find(net, type);
486 if (unlikely(!sc))
487 goto exit;
488
489 spin_lock_bh(&sc->lock);
490
491 sr = tipc_service_first_range(sc, instance);
492 if (!sr)
493 goto no_match;
494
495 list_for_each_entry(p, &sr->all_publ, all_publ) {
496 if (p->scope != scope)
497 continue;
498 if (p->port == exclude && p->node == self)
499 continue;
500 tipc_dest_push(dsts, p->node, p->port);
501 (*dstcnt)++;
502 if (all)
503 continue;
504 list_move_tail(&p->all_publ, &sr->all_publ);
505 break;
506 }
507no_match:
508 spin_unlock_bh(&sc->lock);
509exit:
510 rcu_read_unlock();
511 return !list_empty(dsts);
512}
513
514void tipc_nametbl_mc_lookup(struct net *net, u32 type, u32 lower, u32 upper,
515 u32 scope, bool exact, struct list_head *dports)
516{
517 struct service_range *sr;
518 struct tipc_service *sc;
519 struct publication *p;
520 struct rb_node *n;
521
522 rcu_read_lock();
523 sc = tipc_service_find(net, type);
524 if (!sc)
525 goto exit;
526
527 spin_lock_bh(&sc->lock);
528
529 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) {
530 sr = container_of(n, struct service_range, tree_node);
531 if (sr->upper < lower)
532 continue;
533 if (sr->lower > upper)
534 break;
535 list_for_each_entry(p, &sr->local_publ, local_publ) {
536 if (p->scope == scope || (!exact && p->scope < scope))
537 tipc_dest_push(dports, 0, p->port);
538 }
539 }
540 spin_unlock_bh(&sc->lock);
541exit:
542 rcu_read_unlock();
543}
544
545/* tipc_nametbl_lookup_dst_nodes - find broadcast destination nodes
546 * - Creates list of nodes that overlap the given multicast address
547 * - Determines if any node local destinations overlap
548 */
549void tipc_nametbl_lookup_dst_nodes(struct net *net, u32 type, u32 lower,
550 u32 upper, struct tipc_nlist *nodes)
551{
552 struct service_range *sr;
553 struct tipc_service *sc;
554 struct publication *p;
555 struct rb_node *n;
556
557 rcu_read_lock();
558 sc = tipc_service_find(net, type);
559 if (!sc)
560 goto exit;
561
562 spin_lock_bh(&sc->lock);
563
564 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) {
565 sr = container_of(n, struct service_range, tree_node);
566 if (sr->upper < lower)
567 continue;
568 if (sr->lower > upper)
569 break;
570 list_for_each_entry(p, &sr->all_publ, all_publ) {
571 tipc_nlist_add(nodes, p->node);
572 }
573 }
574 spin_unlock_bh(&sc->lock);
575exit:
576 rcu_read_unlock();
577}
578
579/* tipc_nametbl_build_group - build list of communication group members
580 */
581void tipc_nametbl_build_group(struct net *net, struct tipc_group *grp,
582 u32 type, u32 scope)
583{
584 struct service_range *sr;
585 struct tipc_service *sc;
586 struct publication *p;
587 struct rb_node *n;
588
589 rcu_read_lock();
590 sc = tipc_service_find(net, type);
591 if (!sc)
592 goto exit;
593
594 spin_lock_bh(&sc->lock);
595 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) {
596 sr = container_of(n, struct service_range, tree_node);
597 list_for_each_entry(p, &sr->all_publ, all_publ) {
598 if (p->scope != scope)
599 continue;
600 tipc_group_add_member(grp, p->node, p->port, p->lower);
601 }
602 }
603 spin_unlock_bh(&sc->lock);
604exit:
605 rcu_read_unlock();
606}
607
608/* tipc_nametbl_publish - add service binding to name table
609 */
610struct publication *tipc_nametbl_publish(struct net *net, u32 type, u32 lower,
611 u32 upper, u32 scope, u32 port,
612 u32 key)
613{
614 struct name_table *nt = tipc_name_table(net);
615 struct tipc_net *tn = tipc_net(net);
616 struct publication *p = NULL;
617 struct sk_buff *skb = NULL;
618
619 spin_lock_bh(&tn->nametbl_lock);
620
621 if (nt->local_publ_count >= TIPC_MAX_PUBL) {
622 pr_warn("Bind failed, max limit %u reached\n", TIPC_MAX_PUBL);
623 goto exit;
624 }
625
626 p = tipc_nametbl_insert_publ(net, type, lower, upper, scope,
627 tipc_own_addr(net), port, key);
628 if (p) {
629 nt->local_publ_count++;
630 skb = tipc_named_publish(net, p);
631 }
632exit:
633 spin_unlock_bh(&tn->nametbl_lock);
634
635 if (skb)
636 tipc_node_broadcast(net, skb);
637 return p;
638}
639
640/**
641 * tipc_nametbl_withdraw - withdraw a service binding
642 */
643int tipc_nametbl_withdraw(struct net *net, u32 type, u32 lower,
644 u32 upper, u32 key)
645{
646 struct name_table *nt = tipc_name_table(net);
647 struct tipc_net *tn = tipc_net(net);
648 u32 self = tipc_own_addr(net);
649 struct sk_buff *skb = NULL;
650 struct publication *p;
651
652 spin_lock_bh(&tn->nametbl_lock);
653
654 p = tipc_nametbl_remove_publ(net, type, lower, upper, self, key);
655 if (p) {
656 nt->local_publ_count--;
657 skb = tipc_named_withdraw(net, p);
658 list_del_init(&p->binding_sock);
659 kfree_rcu(p, rcu);
660 } else {
661 pr_err("Failed to remove local publication {%u,%u,%u}/%u\n",
662 type, lower, upper, key);
663 }
664 spin_unlock_bh(&tn->nametbl_lock);
665
666 if (skb) {
667 tipc_node_broadcast(net, skb);
668 return 1;
669 }
670 return 0;
671}
672
673/**
674 * tipc_nametbl_subscribe - add a subscription object to the name table
675 */
676bool tipc_nametbl_subscribe(struct tipc_subscription *sub)
677{
678 struct name_table *nt = tipc_name_table(sub->net);
679 struct tipc_net *tn = tipc_net(sub->net);
680 struct tipc_subscr *s = &sub->evt.s;
681 u32 type = tipc_sub_read(s, seq.type);
682 struct tipc_service *sc;
683 bool res = true;
684
685 spin_lock_bh(&tn->nametbl_lock);
686 sc = tipc_service_find(sub->net, type);
687 if (!sc)
688 sc = tipc_service_create(type, &nt->services[hash(type)]);
689 if (sc) {
690 spin_lock_bh(&sc->lock);
691 tipc_service_subscribe(sc, sub);
692 spin_unlock_bh(&sc->lock);
693 } else {
694 pr_warn("Failed to subscribe for {%u,%u,%u}\n", type,
695 tipc_sub_read(s, seq.lower),
696 tipc_sub_read(s, seq.upper));
697 res = false;
698 }
699 spin_unlock_bh(&tn->nametbl_lock);
700 return res;
701}
702
703/**
704 * tipc_nametbl_unsubscribe - remove a subscription object from name table
705 */
706void tipc_nametbl_unsubscribe(struct tipc_subscription *sub)
707{
708 struct tipc_net *tn = tipc_net(sub->net);
709 struct tipc_subscr *s = &sub->evt.s;
710 u32 type = tipc_sub_read(s, seq.type);
711 struct tipc_service *sc;
712
713 spin_lock_bh(&tn->nametbl_lock);
714 sc = tipc_service_find(sub->net, type);
715 if (!sc)
716 goto exit;
717
718 spin_lock_bh(&sc->lock);
719 list_del_init(&sub->service_list);
720 tipc_sub_put(sub);
721
722 /* Delete service item if no more publications and subscriptions */
723 if (RB_EMPTY_ROOT(&sc->ranges) && list_empty(&sc->subscriptions)) {
724 hlist_del_init_rcu(&sc->service_list);
725 kfree_rcu(sc, rcu);
726 }
727 spin_unlock_bh(&sc->lock);
728exit:
729 spin_unlock_bh(&tn->nametbl_lock);
730}
731
732int tipc_nametbl_init(struct net *net)
733{
734 struct tipc_net *tn = tipc_net(net);
735 struct name_table *nt;
736 int i;
737
738 nt = kzalloc(sizeof(*nt), GFP_KERNEL);
739 if (!nt)
740 return -ENOMEM;
741
742 for (i = 0; i < TIPC_NAMETBL_SIZE; i++)
743 INIT_HLIST_HEAD(&nt->services[i]);
744
745 INIT_LIST_HEAD(&nt->node_scope);
746 INIT_LIST_HEAD(&nt->cluster_scope);
747 rwlock_init(&nt->cluster_scope_lock);
748 tn->nametbl = nt;
749 spin_lock_init(&tn->nametbl_lock);
750 return 0;
751}
752
753/**
754 * tipc_service_delete - purge all publications for a service and delete it
755 */
756static void tipc_service_delete(struct net *net, struct tipc_service *sc)
757{
758 struct service_range *sr, *tmpr;
759 struct publication *p, *tmp;
760
761 spin_lock_bh(&sc->lock);
762 rbtree_postorder_for_each_entry_safe(sr, tmpr, &sc->ranges, tree_node) {
763 list_for_each_entry_safe(p, tmp, &sr->all_publ, all_publ) {
764 tipc_service_remove_publ(sr, p->node, p->key);
765 kfree_rcu(p, rcu);
766 }
767 rb_erase(&sr->tree_node, &sc->ranges);
768 kfree(sr);
769 }
770 hlist_del_init_rcu(&sc->service_list);
771 spin_unlock_bh(&sc->lock);
772 kfree_rcu(sc, rcu);
773}
774
775void tipc_nametbl_stop(struct net *net)
776{
777 struct name_table *nt = tipc_name_table(net);
778 struct tipc_net *tn = tipc_net(net);
779 struct hlist_head *service_head;
780 struct tipc_service *service;
781 u32 i;
782
783 /* Verify name table is empty and purge any lingering
784 * publications, then release the name table
785 */
786 spin_lock_bh(&tn->nametbl_lock);
787 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) {
788 if (hlist_empty(&nt->services[i]))
789 continue;
790 service_head = &nt->services[i];
791 hlist_for_each_entry_rcu(service, service_head, service_list) {
792 tipc_service_delete(net, service);
793 }
794 }
795 spin_unlock_bh(&tn->nametbl_lock);
796
797 synchronize_net();
798 kfree(nt);
799}
800
801static int __tipc_nl_add_nametable_publ(struct tipc_nl_msg *msg,
802 struct tipc_service *service,
803 struct service_range *sr,
804 u32 *last_key)
805{
806 struct publication *p;
807 struct nlattr *attrs;
808 struct nlattr *b;
809 void *hdr;
810
811 if (*last_key) {
812 list_for_each_entry(p, &sr->all_publ, all_publ)
813 if (p->key == *last_key)
814 break;
815 if (p->key != *last_key)
816 return -EPIPE;
817 } else {
818 p = list_first_entry(&sr->all_publ,
819 struct publication,
820 all_publ);
821 }
822
823 list_for_each_entry_from(p, &sr->all_publ, all_publ) {
824 *last_key = p->key;
825
826 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq,
827 &tipc_genl_family, NLM_F_MULTI,
828 TIPC_NL_NAME_TABLE_GET);
829 if (!hdr)
830 return -EMSGSIZE;
831
832 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_NAME_TABLE);
833 if (!attrs)
834 goto msg_full;
835
836 b = nla_nest_start_noflag(msg->skb, TIPC_NLA_NAME_TABLE_PUBL);
837 if (!b)
838 goto attr_msg_full;
839
840 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_TYPE, service->type))
841 goto publ_msg_full;
842 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_LOWER, sr->lower))
843 goto publ_msg_full;
844 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_UPPER, sr->upper))
845 goto publ_msg_full;
846 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_SCOPE, p->scope))
847 goto publ_msg_full;
848 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_NODE, p->node))
849 goto publ_msg_full;
850 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_REF, p->port))
851 goto publ_msg_full;
852 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_KEY, p->key))
853 goto publ_msg_full;
854
855 nla_nest_end(msg->skb, b);
856 nla_nest_end(msg->skb, attrs);
857 genlmsg_end(msg->skb, hdr);
858 }
859 *last_key = 0;
860
861 return 0;
862
863publ_msg_full:
864 nla_nest_cancel(msg->skb, b);
865attr_msg_full:
866 nla_nest_cancel(msg->skb, attrs);
867msg_full:
868 genlmsg_cancel(msg->skb, hdr);
869
870 return -EMSGSIZE;
871}
872
873static int __tipc_nl_service_range_list(struct tipc_nl_msg *msg,
874 struct tipc_service *sc,
875 u32 *last_lower, u32 *last_key)
876{
877 struct service_range *sr;
878 struct rb_node *n;
879 int err;
880
881 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) {
882 sr = container_of(n, struct service_range, tree_node);
883 if (sr->lower < *last_lower)
884 continue;
885 err = __tipc_nl_add_nametable_publ(msg, sc, sr, last_key);
886 if (err) {
887 *last_lower = sr->lower;
888 return err;
889 }
890 }
891 *last_lower = 0;
892 return 0;
893}
894
895static int tipc_nl_service_list(struct net *net, struct tipc_nl_msg *msg,
896 u32 *last_type, u32 *last_lower, u32 *last_key)
897{
898 struct tipc_net *tn = tipc_net(net);
899 struct tipc_service *service = NULL;
900 struct hlist_head *head;
901 int err;
902 int i;
903
904 if (*last_type)
905 i = hash(*last_type);
906 else
907 i = 0;
908
909 for (; i < TIPC_NAMETBL_SIZE; i++) {
910 head = &tn->nametbl->services[i];
911
912 if (*last_type ||
913 (!i && *last_key && (*last_lower == *last_key))) {
914 service = tipc_service_find(net, *last_type);
915 if (!service)
916 return -EPIPE;
917 } else {
918 hlist_for_each_entry_rcu(service, head, service_list)
919 break;
920 if (!service)
921 continue;
922 }
923
924 hlist_for_each_entry_from_rcu(service, service_list) {
925 spin_lock_bh(&service->lock);
926 err = __tipc_nl_service_range_list(msg, service,
927 last_lower,
928 last_key);
929
930 if (err) {
931 *last_type = service->type;
932 spin_unlock_bh(&service->lock);
933 return err;
934 }
935 spin_unlock_bh(&service->lock);
936 }
937 *last_type = 0;
938 }
939 return 0;
940}
941
942int tipc_nl_name_table_dump(struct sk_buff *skb, struct netlink_callback *cb)
943{
944 struct net *net = sock_net(skb->sk);
945 u32 last_type = cb->args[0];
946 u32 last_lower = cb->args[1];
947 u32 last_key = cb->args[2];
948 int done = cb->args[3];
949 struct tipc_nl_msg msg;
950 int err;
951
952 if (done)
953 return 0;
954
955 msg.skb = skb;
956 msg.portid = NETLINK_CB(cb->skb).portid;
957 msg.seq = cb->nlh->nlmsg_seq;
958
959 rcu_read_lock();
960 err = tipc_nl_service_list(net, &msg, &last_type,
961 &last_lower, &last_key);
962 if (!err) {
963 done = 1;
964 } else if (err != -EMSGSIZE) {
965 /* We never set seq or call nl_dump_check_consistent() this
966 * means that setting prev_seq here will cause the consistence
967 * check to fail in the netlink callback handler. Resulting in
968 * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if
969 * we got an error.
970 */
971 cb->prev_seq = 1;
972 }
973 rcu_read_unlock();
974
975 cb->args[0] = last_type;
976 cb->args[1] = last_lower;
977 cb->args[2] = last_key;
978 cb->args[3] = done;
979
980 return skb->len;
981}
982
983struct tipc_dest *tipc_dest_find(struct list_head *l, u32 node, u32 port)
984{
985 struct tipc_dest *dst;
986
987 list_for_each_entry(dst, l, list) {
988 if (dst->node == node && dst->port == port)
989 return dst;
990 }
991 return NULL;
992}
993
994bool tipc_dest_push(struct list_head *l, u32 node, u32 port)
995{
996 struct tipc_dest *dst;
997
998 if (tipc_dest_find(l, node, port))
999 return false;
1000
1001 dst = kmalloc(sizeof(*dst), GFP_ATOMIC);
1002 if (unlikely(!dst))
1003 return false;
1004 dst->node = node;
1005 dst->port = port;
1006 list_add(&dst->list, l);
1007 return true;
1008}
1009
1010bool tipc_dest_pop(struct list_head *l, u32 *node, u32 *port)
1011{
1012 struct tipc_dest *dst;
1013
1014 if (list_empty(l))
1015 return false;
1016 dst = list_first_entry(l, typeof(*dst), list);
1017 if (port)
1018 *port = dst->port;
1019 if (node)
1020 *node = dst->node;
1021 list_del(&dst->list);
1022 kfree(dst);
1023 return true;
1024}
1025
1026bool tipc_dest_del(struct list_head *l, u32 node, u32 port)
1027{
1028 struct tipc_dest *dst;
1029
1030 dst = tipc_dest_find(l, node, port);
1031 if (!dst)
1032 return false;
1033 list_del(&dst->list);
1034 kfree(dst);
1035 return true;
1036}
1037
1038void tipc_dest_list_purge(struct list_head *l)
1039{
1040 struct tipc_dest *dst, *tmp;
1041
1042 list_for_each_entry_safe(dst, tmp, l, list) {
1043 list_del(&dst->list);
1044 kfree(dst);
1045 }
1046}
1047
1048int tipc_dest_list_len(struct list_head *l)
1049{
1050 struct tipc_dest *dst;
1051 int i = 0;
1052
1053 list_for_each_entry(dst, l, list) {
1054 i++;
1055 }
1056 return i;
1057}
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
44#define 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 pr_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 return kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC);
152}
153
154/**
155 * tipc_nameseq_create - create a name sequence structure for the specified 'type'
156 *
157 * Allocates a single sub-sequence structure and sets it to all 0's.
158 */
159static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head)
160{
161 struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC);
162 struct sub_seq *sseq = tipc_subseq_alloc(1);
163
164 if (!nseq || !sseq) {
165 pr_warn("Name sequence creation failed, no memory\n");
166 kfree(nseq);
167 kfree(sseq);
168 return NULL;
169 }
170
171 spin_lock_init(&nseq->lock);
172 nseq->type = type;
173 nseq->sseqs = sseq;
174 nseq->alloc = 1;
175 INIT_HLIST_NODE(&nseq->ns_list);
176 INIT_LIST_HEAD(&nseq->subscriptions);
177 hlist_add_head(&nseq->ns_list, seq_head);
178 return nseq;
179}
180
181/*
182 * nameseq_delete_empty - deletes a name sequence structure if now unused
183 */
184static void nameseq_delete_empty(struct name_seq *seq)
185{
186 if (!seq->first_free && list_empty(&seq->subscriptions)) {
187 hlist_del_init(&seq->ns_list);
188 kfree(seq->sseqs);
189 kfree(seq);
190 }
191}
192
193/**
194 * nameseq_find_subseq - find sub-sequence (if any) matching a name instance
195 *
196 * Very time-critical, so binary searches through sub-sequence array.
197 */
198static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq,
199 u32 instance)
200{
201 struct sub_seq *sseqs = nseq->sseqs;
202 int low = 0;
203 int high = nseq->first_free - 1;
204 int mid;
205
206 while (low <= high) {
207 mid = (low + high) / 2;
208 if (instance < sseqs[mid].lower)
209 high = mid - 1;
210 else if (instance > sseqs[mid].upper)
211 low = mid + 1;
212 else
213 return &sseqs[mid];
214 }
215 return NULL;
216}
217
218/**
219 * nameseq_locate_subseq - determine position of name instance in sub-sequence
220 *
221 * Returns index in sub-sequence array of the entry that contains the specified
222 * instance value; if no entry contains that value, returns the position
223 * where a new entry for it would be inserted in the array.
224 *
225 * Note: Similar to binary search code for locating a sub-sequence.
226 */
227static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance)
228{
229 struct sub_seq *sseqs = nseq->sseqs;
230 int low = 0;
231 int high = nseq->first_free - 1;
232 int mid;
233
234 while (low <= high) {
235 mid = (low + high) / 2;
236 if (instance < sseqs[mid].lower)
237 high = mid - 1;
238 else if (instance > sseqs[mid].upper)
239 low = mid + 1;
240 else
241 return mid;
242 }
243 return low;
244}
245
246/**
247 * tipc_nameseq_insert_publ
248 */
249static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq,
250 u32 type, u32 lower, u32 upper,
251 u32 scope, u32 node, u32 port, u32 key)
252{
253 struct tipc_subscription *s;
254 struct tipc_subscription *st;
255 struct publication *publ;
256 struct sub_seq *sseq;
257 struct name_info *info;
258 int created_subseq = 0;
259
260 sseq = nameseq_find_subseq(nseq, lower);
261 if (sseq) {
262
263 /* Lower end overlaps existing entry => need an exact match */
264 if ((sseq->lower != lower) || (sseq->upper != upper)) {
265 pr_warn("Cannot publish {%u,%u,%u}, overlap error\n",
266 type, lower, upper);
267 return NULL;
268 }
269
270 info = sseq->info;
271
272 /* Check if an identical publication already exists */
273 list_for_each_entry(publ, &info->zone_list, zone_list) {
274 if ((publ->ref == port) && (publ->key == key) &&
275 (!publ->node || (publ->node == node)))
276 return NULL;
277 }
278 } else {
279 u32 inspos;
280 struct sub_seq *freesseq;
281
282 /* Find where lower end should be inserted */
283 inspos = nameseq_locate_subseq(nseq, lower);
284
285 /* Fail if upper end overlaps into an existing entry */
286 if ((inspos < nseq->first_free) &&
287 (upper >= nseq->sseqs[inspos].lower)) {
288 pr_warn("Cannot publish {%u,%u,%u}, overlap error\n",
289 type, lower, upper);
290 return NULL;
291 }
292
293 /* Ensure there is space for new sub-sequence */
294 if (nseq->first_free == nseq->alloc) {
295 struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2);
296
297 if (!sseqs) {
298 pr_warn("Cannot publish {%u,%u,%u}, no memory\n",
299 type, lower, upper);
300 return NULL;
301 }
302 memcpy(sseqs, nseq->sseqs,
303 nseq->alloc * sizeof(struct sub_seq));
304 kfree(nseq->sseqs);
305 nseq->sseqs = sseqs;
306 nseq->alloc *= 2;
307 }
308
309 info = kzalloc(sizeof(*info), GFP_ATOMIC);
310 if (!info) {
311 pr_warn("Cannot publish {%u,%u,%u}, no memory\n",
312 type, lower, upper);
313 return NULL;
314 }
315
316 INIT_LIST_HEAD(&info->node_list);
317 INIT_LIST_HEAD(&info->cluster_list);
318 INIT_LIST_HEAD(&info->zone_list);
319
320 /* Insert new sub-sequence */
321 sseq = &nseq->sseqs[inspos];
322 freesseq = &nseq->sseqs[nseq->first_free];
323 memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq));
324 memset(sseq, 0, sizeof(*sseq));
325 nseq->first_free++;
326 sseq->lower = lower;
327 sseq->upper = upper;
328 sseq->info = info;
329 created_subseq = 1;
330 }
331
332 /* Insert a publication */
333 publ = publ_create(type, lower, upper, scope, node, port, key);
334 if (!publ)
335 return NULL;
336
337 list_add(&publ->zone_list, &info->zone_list);
338 info->zone_list_size++;
339
340 if (in_own_cluster(node)) {
341 list_add(&publ->cluster_list, &info->cluster_list);
342 info->cluster_list_size++;
343 }
344
345 if (in_own_node(node)) {
346 list_add(&publ->node_list, &info->node_list);
347 info->node_list_size++;
348 }
349
350 /* Any subscriptions waiting for notification? */
351 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
352 tipc_subscr_report_overlap(s,
353 publ->lower,
354 publ->upper,
355 TIPC_PUBLISHED,
356 publ->ref,
357 publ->node,
358 created_subseq);
359 }
360 return publ;
361}
362
363/**
364 * tipc_nameseq_remove_publ
365 *
366 * NOTE: There may be cases where TIPC is asked to remove a publication
367 * that is not in the name table. For example, if another node issues a
368 * publication for a name sequence that overlaps an existing name sequence
369 * the publication will not be recorded, which means the publication won't
370 * be found when the name sequence is later withdrawn by that node.
371 * A failed withdraw request simply returns a failure indication and lets the
372 * caller issue any error or warning messages associated with such a problem.
373 */
374static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 inst,
375 u32 node, u32 ref, u32 key)
376{
377 struct publication *publ;
378 struct sub_seq *sseq = nameseq_find_subseq(nseq, inst);
379 struct name_info *info;
380 struct sub_seq *free;
381 struct tipc_subscription *s, *st;
382 int removed_subseq = 0;
383
384 if (!sseq)
385 return NULL;
386
387 info = sseq->info;
388
389 /* Locate publication, if it exists */
390 list_for_each_entry(publ, &info->zone_list, zone_list) {
391 if ((publ->key == key) && (publ->ref == ref) &&
392 (!publ->node || (publ->node == node)))
393 goto found;
394 }
395 return NULL;
396
397found:
398 /* Remove publication from zone scope list */
399 list_del(&publ->zone_list);
400 info->zone_list_size--;
401
402 /* Remove publication from cluster scope list, if present */
403 if (in_own_cluster(node)) {
404 list_del(&publ->cluster_list);
405 info->cluster_list_size--;
406 }
407
408 /* Remove publication from node scope list, if present */
409 if (in_own_node(node)) {
410 list_del(&publ->node_list);
411 info->node_list_size--;
412 }
413
414 /* Contract subseq list if no more publications for that subseq */
415 if (list_empty(&info->zone_list)) {
416 kfree(info);
417 free = &nseq->sseqs[nseq->first_free--];
418 memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq));
419 removed_subseq = 1;
420 }
421
422 /* Notify any waiting subscriptions */
423 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
424 tipc_subscr_report_overlap(s,
425 publ->lower,
426 publ->upper,
427 TIPC_WITHDRAWN,
428 publ->ref,
429 publ->node,
430 removed_subseq);
431 }
432
433 return publ;
434}
435
436/**
437 * tipc_nameseq_subscribe - attach a subscription, and issue
438 * the prescribed number of events if there is any sub-
439 * sequence overlapping with the requested sequence
440 */
441static void tipc_nameseq_subscribe(struct name_seq *nseq,
442 struct tipc_subscription *s)
443{
444 struct sub_seq *sseq = nseq->sseqs;
445
446 list_add(&s->nameseq_list, &nseq->subscriptions);
447
448 if (!sseq)
449 return;
450
451 while (sseq != &nseq->sseqs[nseq->first_free]) {
452 if (tipc_subscr_overlap(s, sseq->lower, sseq->upper)) {
453 struct publication *crs;
454 struct name_info *info = sseq->info;
455 int must_report = 1;
456
457 list_for_each_entry(crs, &info->zone_list, zone_list) {
458 tipc_subscr_report_overlap(s,
459 sseq->lower,
460 sseq->upper,
461 TIPC_PUBLISHED,
462 crs->ref,
463 crs->node,
464 must_report);
465 must_report = 0;
466 }
467 }
468 sseq++;
469 }
470}
471
472static struct name_seq *nametbl_find_seq(u32 type)
473{
474 struct hlist_head *seq_head;
475 struct name_seq *ns;
476
477 seq_head = &table.types[hash(type)];
478 hlist_for_each_entry(ns, seq_head, ns_list) {
479 if (ns->type == type)
480 return ns;
481 }
482
483 return NULL;
484};
485
486struct publication *tipc_nametbl_insert_publ(u32 type, u32 lower, u32 upper,
487 u32 scope, u32 node, u32 port, u32 key)
488{
489 struct name_seq *seq = nametbl_find_seq(type);
490
491 if ((scope < TIPC_ZONE_SCOPE) || (scope > TIPC_NODE_SCOPE) ||
492 (lower > upper)) {
493 pr_debug("Failed to publish illegal {%u,%u,%u} with scope %u\n",
494 type, lower, upper, scope);
495 return NULL;
496 }
497
498 if (!seq)
499 seq = tipc_nameseq_create(type, &table.types[hash(type)]);
500 if (!seq)
501 return NULL;
502
503 return tipc_nameseq_insert_publ(seq, type, lower, upper,
504 scope, node, port, key);
505}
506
507struct publication *tipc_nametbl_remove_publ(u32 type, u32 lower,
508 u32 node, u32 ref, u32 key)
509{
510 struct publication *publ;
511 struct name_seq *seq = nametbl_find_seq(type);
512
513 if (!seq)
514 return NULL;
515
516 publ = tipc_nameseq_remove_publ(seq, lower, node, ref, key);
517 nameseq_delete_empty(seq);
518 return publ;
519}
520
521/**
522 * tipc_nametbl_translate - perform name translation
523 *
524 * On entry, 'destnode' is the search domain used during translation.
525 *
526 * On exit:
527 * - if name translation is deferred to another node/cluster/zone,
528 * leaves 'destnode' unchanged (will be non-zero) and returns 0
529 * - if name translation is attempted and succeeds, sets 'destnode'
530 * to publishing node and returns port reference (will be non-zero)
531 * - if name translation is attempted and fails, sets 'destnode' to 0
532 * and returns 0
533 */
534u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode)
535{
536 struct sub_seq *sseq;
537 struct name_info *info;
538 struct publication *publ;
539 struct name_seq *seq;
540 u32 ref = 0;
541 u32 node = 0;
542
543 if (!tipc_in_scope(*destnode, tipc_own_addr))
544 return 0;
545
546 read_lock_bh(&tipc_nametbl_lock);
547 seq = nametbl_find_seq(type);
548 if (unlikely(!seq))
549 goto not_found;
550 sseq = nameseq_find_subseq(seq, instance);
551 if (unlikely(!sseq))
552 goto not_found;
553 spin_lock_bh(&seq->lock);
554 info = sseq->info;
555
556 /* Closest-First Algorithm */
557 if (likely(!*destnode)) {
558 if (!list_empty(&info->node_list)) {
559 publ = list_first_entry(&info->node_list,
560 struct publication,
561 node_list);
562 list_move_tail(&publ->node_list,
563 &info->node_list);
564 } else if (!list_empty(&info->cluster_list)) {
565 publ = list_first_entry(&info->cluster_list,
566 struct publication,
567 cluster_list);
568 list_move_tail(&publ->cluster_list,
569 &info->cluster_list);
570 } else {
571 publ = list_first_entry(&info->zone_list,
572 struct publication,
573 zone_list);
574 list_move_tail(&publ->zone_list,
575 &info->zone_list);
576 }
577 }
578
579 /* Round-Robin Algorithm */
580 else if (*destnode == tipc_own_addr) {
581 if (list_empty(&info->node_list))
582 goto no_match;
583 publ = list_first_entry(&info->node_list, struct publication,
584 node_list);
585 list_move_tail(&publ->node_list, &info->node_list);
586 } else if (in_own_cluster_exact(*destnode)) {
587 if (list_empty(&info->cluster_list))
588 goto no_match;
589 publ = list_first_entry(&info->cluster_list, struct publication,
590 cluster_list);
591 list_move_tail(&publ->cluster_list, &info->cluster_list);
592 } else {
593 publ = list_first_entry(&info->zone_list, struct publication,
594 zone_list);
595 list_move_tail(&publ->zone_list, &info->zone_list);
596 }
597
598 ref = publ->ref;
599 node = publ->node;
600no_match:
601 spin_unlock_bh(&seq->lock);
602not_found:
603 read_unlock_bh(&tipc_nametbl_lock);
604 *destnode = node;
605 return ref;
606}
607
608/**
609 * tipc_nametbl_mc_translate - find multicast destinations
610 *
611 * Creates list of all local ports that overlap the given multicast address;
612 * also determines if any off-node ports overlap.
613 *
614 * Note: Publications with a scope narrower than 'limit' are ignored.
615 * (i.e. local node-scope publications mustn't receive messages arriving
616 * from another node, even if the multcast link brought it here)
617 *
618 * Returns non-zero if any off-node ports overlap
619 */
620int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit,
621 struct tipc_port_list *dports)
622{
623 struct name_seq *seq;
624 struct sub_seq *sseq;
625 struct sub_seq *sseq_stop;
626 struct name_info *info;
627 int res = 0;
628
629 read_lock_bh(&tipc_nametbl_lock);
630 seq = nametbl_find_seq(type);
631 if (!seq)
632 goto exit;
633
634 spin_lock_bh(&seq->lock);
635
636 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower);
637 sseq_stop = seq->sseqs + seq->first_free;
638 for (; sseq != sseq_stop; sseq++) {
639 struct publication *publ;
640
641 if (sseq->lower > upper)
642 break;
643
644 info = sseq->info;
645 list_for_each_entry(publ, &info->node_list, node_list) {
646 if (publ->scope <= limit)
647 tipc_port_list_add(dports, publ->ref);
648 }
649
650 if (info->cluster_list_size != info->node_list_size)
651 res = 1;
652 }
653
654 spin_unlock_bh(&seq->lock);
655exit:
656 read_unlock_bh(&tipc_nametbl_lock);
657 return res;
658}
659
660/*
661 * tipc_nametbl_publish - add name publication to network name tables
662 */
663struct publication *tipc_nametbl_publish(u32 type, u32 lower, u32 upper,
664 u32 scope, u32 port_ref, u32 key)
665{
666 struct publication *publ;
667
668 if (table.local_publ_count >= TIPC_MAX_PUBLICATIONS) {
669 pr_warn("Publication failed, local publication limit reached (%u)\n",
670 TIPC_MAX_PUBLICATIONS);
671 return NULL;
672 }
673
674 write_lock_bh(&tipc_nametbl_lock);
675 publ = tipc_nametbl_insert_publ(type, lower, upper, scope,
676 tipc_own_addr, port_ref, key);
677 if (likely(publ)) {
678 table.local_publ_count++;
679 tipc_named_publish(publ);
680 }
681 write_unlock_bh(&tipc_nametbl_lock);
682 return publ;
683}
684
685/**
686 * tipc_nametbl_withdraw - withdraw name publication from network name tables
687 */
688int tipc_nametbl_withdraw(u32 type, u32 lower, u32 ref, u32 key)
689{
690 struct publication *publ;
691
692 write_lock_bh(&tipc_nametbl_lock);
693 publ = tipc_nametbl_remove_publ(type, lower, tipc_own_addr, ref, key);
694 if (likely(publ)) {
695 table.local_publ_count--;
696 tipc_named_withdraw(publ);
697 write_unlock_bh(&tipc_nametbl_lock);
698 list_del_init(&publ->pport_list);
699 kfree(publ);
700 return 1;
701 }
702 write_unlock_bh(&tipc_nametbl_lock);
703 pr_err("Unable to remove local publication\n"
704 "(type=%u, lower=%u, ref=%u, key=%u)\n",
705 type, lower, ref, key);
706 return 0;
707}
708
709/**
710 * tipc_nametbl_subscribe - add a subscription object to the name table
711 */
712void tipc_nametbl_subscribe(struct tipc_subscription *s)
713{
714 u32 type = s->seq.type;
715 struct name_seq *seq;
716
717 write_lock_bh(&tipc_nametbl_lock);
718 seq = nametbl_find_seq(type);
719 if (!seq)
720 seq = tipc_nameseq_create(type, &table.types[hash(type)]);
721 if (seq) {
722 spin_lock_bh(&seq->lock);
723 tipc_nameseq_subscribe(seq, s);
724 spin_unlock_bh(&seq->lock);
725 } else {
726 pr_warn("Failed to create subscription for {%u,%u,%u}\n",
727 s->seq.type, s->seq.lower, s->seq.upper);
728 }
729 write_unlock_bh(&tipc_nametbl_lock);
730}
731
732/**
733 * tipc_nametbl_unsubscribe - remove a subscription object from name table
734 */
735void tipc_nametbl_unsubscribe(struct tipc_subscription *s)
736{
737 struct name_seq *seq;
738
739 write_lock_bh(&tipc_nametbl_lock);
740 seq = nametbl_find_seq(s->seq.type);
741 if (seq != NULL) {
742 spin_lock_bh(&seq->lock);
743 list_del_init(&s->nameseq_list);
744 spin_unlock_bh(&seq->lock);
745 nameseq_delete_empty(seq);
746 }
747 write_unlock_bh(&tipc_nametbl_lock);
748}
749
750
751/**
752 * subseq_list - print specified sub-sequence contents into the given buffer
753 */
754static int subseq_list(struct sub_seq *sseq, char *buf, int len, u32 depth,
755 u32 index)
756{
757 char portIdStr[27];
758 const char *scope_str[] = {"", " zone", " cluster", " node"};
759 struct publication *publ;
760 struct name_info *info;
761 int ret;
762
763 ret = tipc_snprintf(buf, len, "%-10u %-10u ", sseq->lower, sseq->upper);
764
765 if (depth == 2) {
766 ret += tipc_snprintf(buf - ret, len + ret, "\n");
767 return ret;
768 }
769
770 info = sseq->info;
771
772 list_for_each_entry(publ, &info->zone_list, zone_list) {
773 sprintf(portIdStr, "<%u.%u.%u:%u>",
774 tipc_zone(publ->node), tipc_cluster(publ->node),
775 tipc_node(publ->node), publ->ref);
776 ret += tipc_snprintf(buf + ret, len - ret, "%-26s ", portIdStr);
777 if (depth > 3) {
778 ret += tipc_snprintf(buf + ret, len - ret, "%-10u %s",
779 publ->key, scope_str[publ->scope]);
780 }
781 if (!list_is_last(&publ->zone_list, &info->zone_list))
782 ret += tipc_snprintf(buf + ret, len - ret,
783 "\n%33s", " ");
784 }
785
786 ret += tipc_snprintf(buf + ret, len - ret, "\n");
787 return ret;
788}
789
790/**
791 * nameseq_list - print specified name sequence contents into the given buffer
792 */
793static int nameseq_list(struct name_seq *seq, char *buf, int len, u32 depth,
794 u32 type, u32 lowbound, u32 upbound, u32 index)
795{
796 struct sub_seq *sseq;
797 char typearea[11];
798 int ret = 0;
799
800 if (seq->first_free == 0)
801 return 0;
802
803 sprintf(typearea, "%-10u", seq->type);
804
805 if (depth == 1) {
806 ret += tipc_snprintf(buf, len, "%s\n", typearea);
807 return ret;
808 }
809
810 for (sseq = seq->sseqs; sseq != &seq->sseqs[seq->first_free]; sseq++) {
811 if ((lowbound <= sseq->upper) && (upbound >= sseq->lower)) {
812 ret += tipc_snprintf(buf + ret, len - ret, "%s ",
813 typearea);
814 spin_lock_bh(&seq->lock);
815 ret += subseq_list(sseq, buf + ret, len - ret,
816 depth, index);
817 spin_unlock_bh(&seq->lock);
818 sprintf(typearea, "%10s", " ");
819 }
820 }
821 return ret;
822}
823
824/**
825 * nametbl_header - print name table header into the given buffer
826 */
827static int nametbl_header(char *buf, int len, u32 depth)
828{
829 const char *header[] = {
830 "Type ",
831 "Lower Upper ",
832 "Port Identity ",
833 "Publication Scope"
834 };
835
836 int i;
837 int ret = 0;
838
839 if (depth > 4)
840 depth = 4;
841 for (i = 0; i < depth; i++)
842 ret += tipc_snprintf(buf + ret, len - ret, header[i]);
843 ret += tipc_snprintf(buf + ret, len - ret, "\n");
844 return ret;
845}
846
847/**
848 * nametbl_list - print specified name table contents into the given buffer
849 */
850static int nametbl_list(char *buf, int len, u32 depth_info,
851 u32 type, u32 lowbound, u32 upbound)
852{
853 struct hlist_head *seq_head;
854 struct name_seq *seq;
855 int all_types;
856 int ret = 0;
857 u32 depth;
858 u32 i;
859
860 all_types = (depth_info & TIPC_NTQ_ALLTYPES);
861 depth = (depth_info & ~TIPC_NTQ_ALLTYPES);
862
863 if (depth == 0)
864 return 0;
865
866 if (all_types) {
867 /* display all entries in name table to specified depth */
868 ret += nametbl_header(buf, len, depth);
869 lowbound = 0;
870 upbound = ~0;
871 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) {
872 seq_head = &table.types[i];
873 hlist_for_each_entry(seq, seq_head, ns_list) {
874 ret += nameseq_list(seq, buf + ret, len - ret,
875 depth, seq->type,
876 lowbound, upbound, i);
877 }
878 }
879 } else {
880 /* display only the sequence that matches the specified type */
881 if (upbound < lowbound) {
882 ret += tipc_snprintf(buf + ret, len - ret,
883 "invalid name sequence specified\n");
884 return ret;
885 }
886 ret += nametbl_header(buf + ret, len - ret, depth);
887 i = hash(type);
888 seq_head = &table.types[i];
889 hlist_for_each_entry(seq, seq_head, ns_list) {
890 if (seq->type == type) {
891 ret += nameseq_list(seq, buf + ret, len - ret,
892 depth, type,
893 lowbound, upbound, i);
894 break;
895 }
896 }
897 }
898 return ret;
899}
900
901struct sk_buff *tipc_nametbl_get(const void *req_tlv_area, int req_tlv_space)
902{
903 struct sk_buff *buf;
904 struct tipc_name_table_query *argv;
905 struct tlv_desc *rep_tlv;
906 char *pb;
907 int pb_len;
908 int str_len;
909
910 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NAME_TBL_QUERY))
911 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
912
913 buf = tipc_cfg_reply_alloc(TLV_SPACE(ULTRA_STRING_MAX_LEN));
914 if (!buf)
915 return NULL;
916
917 rep_tlv = (struct tlv_desc *)buf->data;
918 pb = TLV_DATA(rep_tlv);
919 pb_len = ULTRA_STRING_MAX_LEN;
920 argv = (struct tipc_name_table_query *)TLV_DATA(req_tlv_area);
921 read_lock_bh(&tipc_nametbl_lock);
922 str_len = nametbl_list(pb, pb_len, ntohl(argv->depth),
923 ntohl(argv->type),
924 ntohl(argv->lowbound), ntohl(argv->upbound));
925 read_unlock_bh(&tipc_nametbl_lock);
926 str_len += 1; /* for "\0" */
927 skb_put(buf, TLV_SPACE(str_len));
928 TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len);
929
930 return buf;
931}
932
933int tipc_nametbl_init(void)
934{
935 table.types = kcalloc(TIPC_NAMETBL_SIZE, sizeof(struct hlist_head),
936 GFP_ATOMIC);
937 if (!table.types)
938 return -ENOMEM;
939
940 table.local_publ_count = 0;
941 return 0;
942}
943
944/**
945 * tipc_purge_publications - remove all publications for a given type
946 *
947 * tipc_nametbl_lock must be held when calling this function
948 */
949static void tipc_purge_publications(struct name_seq *seq)
950{
951 struct publication *publ, *safe;
952 struct sub_seq *sseq;
953 struct name_info *info;
954
955 if (!seq->sseqs) {
956 nameseq_delete_empty(seq);
957 return;
958 }
959 sseq = seq->sseqs;
960 info = sseq->info;
961 list_for_each_entry_safe(publ, safe, &info->zone_list, zone_list) {
962 tipc_nametbl_remove_publ(publ->type, publ->lower, publ->node,
963 publ->ref, publ->key);
964 }
965}
966
967void tipc_nametbl_stop(void)
968{
969 u32 i;
970 struct name_seq *seq;
971 struct hlist_head *seq_head;
972 struct hlist_node *safe;
973
974 /* Verify name table is empty and purge any lingering
975 * publications, then release the name table
976 */
977 write_lock_bh(&tipc_nametbl_lock);
978 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) {
979 if (hlist_empty(&table.types[i]))
980 continue;
981 seq_head = &table.types[i];
982 hlist_for_each_entry_safe(seq, safe, seq_head, ns_list) {
983 tipc_purge_publications(seq);
984 }
985 continue;
986 }
987 kfree(table.types);
988 table.types = NULL;
989 write_unlock_bh(&tipc_nametbl_lock);
990}