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 */ 62 struct 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 */ 81 struct 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) 92 RB_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 */ 128 static 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 */ 178 static 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 218 static 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 */ 229 static 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 */ 257 static 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 */ 282 static 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 296 static 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 330 static 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 341 spin_lock_bh(&sc->lock); 342 sr = tipc_service_create_range(sc, p); 343 if (!sr) 344 goto exit; 345 346 first = list_empty(&sr->all_publ); 347 348 /* Return if the publication already exists */ 349 list_for_each_entry(_p, &sr->all_publ, all_publ) { 350 if (_p->key == p->key && (!_p->sk.node || _p->sk.node == node)) 351 goto exit; 352 } 353 354 if (in_own_node(net, p->sk.node)) 355 list_add(&p->local_publ, &sr->local_publ); 356 list_add(&p->all_publ, &sr->all_publ); 357 p->id = sc->publ_cnt++; 358 359 /* Any subscriptions waiting for notification? */ 360 list_for_each_entry_safe(sub, tmp, &sc->subscriptions, service_list) { 361 tipc_sub_report_overlap(sub, p, TIPC_PUBLISHED, first); 362 } 363 res = true; 364 exit: 365 if (!res) 366 pr_warn("Failed to bind to %u,%u,%u\n", 367 p->sr.type, p->sr.lower, p->sr.upper); 368 spin_unlock_bh(&sc->lock); 369 return res; 370 } 371 372 /** 373 * tipc_service_remove_publ - remove a publication from a service 374 * @r: service_range to remove publication from 375 * @sk: address publishing socket 376 * @key: target publication key 377 */ 378 static struct publication *tipc_service_remove_publ(struct service_range *r, 379 struct tipc_socket_addr *sk, 380 u32 key) 381 { 382 struct publication *p; 383 u32 node = sk->node; 384 385 list_for_each_entry(p, &r->all_publ, all_publ) { 386 if (p->key != key || (node && node != p->sk.node)) 387 continue; 388 list_del(&p->all_publ); 389 list_del(&p->local_publ); 390 return p; 391 } 392 return NULL; 393 } 394 395 /* 396 * Code reused: time_after32() for the same purpose 397 */ 398 #define publication_after(pa, pb) time_after32((pa)->id, (pb)->id) 399 static int tipc_publ_sort(void *priv, struct list_head *a, 400 struct list_head *b) 401 { 402 struct publication *pa, *pb; 403 404 pa = container_of(a, struct publication, list); 405 pb = container_of(b, struct publication, list); 406 return publication_after(pa, pb); 407 } 408 409 /** 410 * tipc_service_subscribe - attach a subscription, and optionally 411 * issue the prescribed number of events if there is any service 412 * range overlapping with the requested range 413 * @service: the tipc_service to attach the @sub to 414 * @sub: the subscription to attach 415 */ 416 static void tipc_service_subscribe(struct tipc_service *service, 417 struct tipc_subscription *sub) 418 { 419 struct tipc_subscr *sb = &sub->evt.s; 420 struct publication *p, *first, *tmp; 421 struct list_head publ_list; 422 struct service_range *sr; 423 struct tipc_service_range r; 424 u32 filter; 425 426 r.type = tipc_sub_read(sb, seq.type); 427 r.lower = tipc_sub_read(sb, seq.lower); 428 r.upper = tipc_sub_read(sb, seq.upper); 429 filter = tipc_sub_read(sb, filter); 430 431 tipc_sub_get(sub); 432 list_add(&sub->service_list, &service->subscriptions); 433 434 if (filter & TIPC_SUB_NO_STATUS) 435 return; 436 437 INIT_LIST_HEAD(&publ_list); 438 service_range_foreach_match(sr, service, r.lower, r.upper) { 439 first = NULL; 440 list_for_each_entry(p, &sr->all_publ, all_publ) { 441 if (filter & TIPC_SUB_PORTS) 442 list_add_tail(&p->list, &publ_list); 443 else if (!first || publication_after(first, p)) 444 /* Pick this range's *first* publication */ 445 first = p; 446 } 447 if (first) 448 list_add_tail(&first->list, &publ_list); 449 } 450 451 /* Sort the publications before reporting */ 452 list_sort(NULL, &publ_list, tipc_publ_sort); 453 list_for_each_entry_safe(p, tmp, &publ_list, list) { 454 tipc_sub_report_overlap(sub, p, TIPC_PUBLISHED, true); 455 list_del_init(&p->list); 456 } 457 } 458 459 static struct tipc_service *tipc_service_find(struct net *net, 460 struct tipc_uaddr *ua) 461 { 462 struct name_table *nt = tipc_name_table(net); 463 struct hlist_head *service_head; 464 struct tipc_service *service; 465 466 service_head = &nt->services[hash(ua->sr.type)]; 467 hlist_for_each_entry_rcu(service, service_head, service_list) { 468 if (service->type == ua->sr.type) 469 return service; 470 } 471 return NULL; 472 }; 473 474 struct publication *tipc_nametbl_insert_publ(struct net *net, 475 struct tipc_uaddr *ua, 476 struct tipc_socket_addr *sk, 477 u32 key) 478 { 479 struct tipc_service *sc; 480 struct publication *p; 481 u32 type = ua->sr.type; 482 483 p = tipc_publ_create(ua, sk, key); 484 if (!p) 485 return NULL; 486 487 if (ua->sr.lower > ua->sr.upper) { 488 pr_debug("Failed to bind illegal {%u,%u,%u} from node %u\n", 489 type, ua->sr.lower, ua->sr.upper, sk->node); 490 return NULL; 491 } 492 sc = tipc_service_find(net, ua); 493 if (!sc) 494 sc = tipc_service_create(net, ua); 495 if (sc && tipc_service_insert_publ(net, sc, p)) 496 return p; 497 kfree(p); 498 return NULL; 499 } 500 501 struct publication *tipc_nametbl_remove_publ(struct net *net, 502 struct tipc_uaddr *ua, 503 struct tipc_socket_addr *sk, 504 u32 key) 505 { 506 struct tipc_subscription *sub, *tmp; 507 struct publication *p = NULL; 508 struct service_range *sr; 509 struct tipc_service *sc; 510 bool last; 511 512 sc = tipc_service_find(net, ua); 513 if (!sc) 514 return NULL; 515 516 spin_lock_bh(&sc->lock); 517 sr = tipc_service_find_range(sc, ua); 518 if (!sr) 519 goto exit; 520 p = tipc_service_remove_publ(sr, sk, key); 521 if (!p) 522 goto exit; 523 524 /* Notify any waiting subscriptions */ 525 last = list_empty(&sr->all_publ); 526 list_for_each_entry_safe(sub, tmp, &sc->subscriptions, service_list) { 527 tipc_sub_report_overlap(sub, p, TIPC_WITHDRAWN, last); 528 } 529 530 /* Remove service range item if this was its last publication */ 531 if (list_empty(&sr->all_publ)) { 532 rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); 533 kfree(sr); 534 } 535 536 /* Delete service item if no more publications and subscriptions */ 537 if (RB_EMPTY_ROOT(&sc->ranges) && list_empty(&sc->subscriptions)) { 538 hlist_del_init_rcu(&sc->service_list); 539 kfree_rcu(sc, rcu); 540 } 541 exit: 542 spin_unlock_bh(&sc->lock); 543 return p; 544 } 545 546 /** 547 * tipc_nametbl_lookup_anycast - perform service instance to socket translation 548 * @net: network namespace 549 * @ua: service address to look up 550 * @sk: address to socket we want to find 551 * 552 * On entry, a non-zero 'sk->node' indicates the node where we want lookup to be 553 * performed, which may not be this one. 554 * On exit: 555 * - If lookup is deferred to another node, leave 'sk->node' unchanged and 556 * return 'true'. 557 * - If lookup is successful, set the 'sk->node' and 'sk->ref' (== portid) which 558 * represent the bound socket and return 'true'. 559 * - If lookup fails, return 'false' 560 * 561 * Note that for legacy users (node configured with Z.C.N address format) the 562 * 'closest-first' lookup algorithm must be maintained, i.e., if sk.node is 0 563 * we must look in the local binding list first 564 */ 565 bool tipc_nametbl_lookup_anycast(struct net *net, 566 struct tipc_uaddr *ua, 567 struct tipc_socket_addr *sk) 568 { 569 struct tipc_net *tn = tipc_net(net); 570 bool legacy = tn->legacy_addr_format; 571 u32 self = tipc_own_addr(net); 572 u32 inst = ua->sa.instance; 573 struct service_range *r; 574 struct tipc_service *sc; 575 struct publication *p; 576 struct list_head *l; 577 bool res = false; 578 579 if (!tipc_in_scope(legacy, sk->node, self)) 580 return true; 581 582 rcu_read_lock(); 583 sc = tipc_service_find(net, ua); 584 if (unlikely(!sc)) 585 goto exit; 586 587 spin_lock_bh(&sc->lock); 588 service_range_foreach_match(r, sc, inst, inst) { 589 /* Select lookup algo: local, closest-first or round-robin */ 590 if (sk->node == self) { 591 l = &r->local_publ; 592 if (list_empty(l)) 593 continue; 594 p = list_first_entry(l, struct publication, local_publ); 595 list_move_tail(&p->local_publ, &r->local_publ); 596 } else if (legacy && !sk->node && !list_empty(&r->local_publ)) { 597 l = &r->local_publ; 598 p = list_first_entry(l, struct publication, local_publ); 599 list_move_tail(&p->local_publ, &r->local_publ); 600 } else { 601 l = &r->all_publ; 602 p = list_first_entry(l, struct publication, all_publ); 603 list_move_tail(&p->all_publ, &r->all_publ); 604 } 605 *sk = p->sk; 606 res = true; 607 /* Todo: as for legacy, pick the first matching range only, a 608 * "true" round-robin will be performed as needed. 609 */ 610 break; 611 } 612 spin_unlock_bh(&sc->lock); 613 614 exit: 615 rcu_read_unlock(); 616 return res; 617 } 618 619 /* tipc_nametbl_lookup_group(): lookup destinaton(s) in a communication group 620 * Returns a list of one (== group anycast) or more (== group multicast) 621 * destination socket/node pairs matching the given address. 622 * The requester may or may not want to exclude himself from the list. 623 */ 624 bool tipc_nametbl_lookup_group(struct net *net, struct tipc_uaddr *ua, 625 struct list_head *dsts, int *dstcnt, 626 u32 exclude, bool mcast) 627 { 628 u32 self = tipc_own_addr(net); 629 u32 inst = ua->sa.instance; 630 struct service_range *sr; 631 struct tipc_service *sc; 632 struct publication *p; 633 634 *dstcnt = 0; 635 rcu_read_lock(); 636 sc = tipc_service_find(net, ua); 637 if (unlikely(!sc)) 638 goto exit; 639 640 spin_lock_bh(&sc->lock); 641 642 /* Todo: a full search i.e. service_range_foreach_match() instead? */ 643 sr = service_range_match_first(sc->ranges.rb_node, inst, inst); 644 if (!sr) 645 goto no_match; 646 647 list_for_each_entry(p, &sr->all_publ, all_publ) { 648 if (p->scope != ua->scope) 649 continue; 650 if (p->sk.ref == exclude && p->sk.node == self) 651 continue; 652 tipc_dest_push(dsts, p->sk.node, p->sk.ref); 653 (*dstcnt)++; 654 if (mcast) 655 continue; 656 list_move_tail(&p->all_publ, &sr->all_publ); 657 break; 658 } 659 no_match: 660 spin_unlock_bh(&sc->lock); 661 exit: 662 rcu_read_unlock(); 663 return !list_empty(dsts); 664 } 665 666 /* tipc_nametbl_lookup_mcast_sockets(): look up node local destinaton sockets 667 * matching the given address 668 * Used on nodes which have received a multicast/broadcast message 669 * Returns a list of local sockets 670 */ 671 void tipc_nametbl_lookup_mcast_sockets(struct net *net, struct tipc_uaddr *ua, 672 bool exact, struct list_head *dports) 673 { 674 struct service_range *sr; 675 struct tipc_service *sc; 676 struct publication *p; 677 u32 scope = ua->scope; 678 679 rcu_read_lock(); 680 sc = tipc_service_find(net, ua); 681 if (!sc) 682 goto exit; 683 684 spin_lock_bh(&sc->lock); 685 service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) { 686 list_for_each_entry(p, &sr->local_publ, local_publ) { 687 if (p->scope == scope || (!exact && p->scope < scope)) 688 tipc_dest_push(dports, 0, p->sk.ref); 689 } 690 } 691 spin_unlock_bh(&sc->lock); 692 exit: 693 rcu_read_unlock(); 694 } 695 696 /* tipc_nametbl_lookup_mcast_nodes(): look up all destination nodes matching 697 * the given address. Used in sending node. 698 * Used on nodes which are sending out a multicast/broadcast message 699 * Returns a list of nodes, including own node if applicable 700 */ 701 void tipc_nametbl_lookup_mcast_nodes(struct net *net, struct tipc_uaddr *ua, 702 struct tipc_nlist *nodes) 703 { 704 struct service_range *sr; 705 struct tipc_service *sc; 706 struct publication *p; 707 708 rcu_read_lock(); 709 sc = tipc_service_find(net, ua); 710 if (!sc) 711 goto exit; 712 713 spin_lock_bh(&sc->lock); 714 service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) { 715 list_for_each_entry(p, &sr->all_publ, all_publ) { 716 tipc_nlist_add(nodes, p->sk.node); 717 } 718 } 719 spin_unlock_bh(&sc->lock); 720 exit: 721 rcu_read_unlock(); 722 } 723 724 /* tipc_nametbl_build_group - build list of communication group members 725 */ 726 void tipc_nametbl_build_group(struct net *net, struct tipc_group *grp, 727 struct tipc_uaddr *ua) 728 { 729 struct service_range *sr; 730 struct tipc_service *sc; 731 struct publication *p; 732 struct rb_node *n; 733 734 rcu_read_lock(); 735 sc = tipc_service_find(net, ua); 736 if (!sc) 737 goto exit; 738 739 spin_lock_bh(&sc->lock); 740 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) { 741 sr = container_of(n, struct service_range, tree_node); 742 list_for_each_entry(p, &sr->all_publ, all_publ) { 743 if (p->scope != ua->scope) 744 continue; 745 tipc_group_add_member(grp, p->sk.node, p->sk.ref, 746 p->sr.lower); 747 } 748 } 749 spin_unlock_bh(&sc->lock); 750 exit: 751 rcu_read_unlock(); 752 } 753 754 /* tipc_nametbl_publish - add service binding to name table 755 */ 756 struct publication *tipc_nametbl_publish(struct net *net, struct tipc_uaddr *ua, 757 struct tipc_socket_addr *sk, u32 key) 758 { 759 struct name_table *nt = tipc_name_table(net); 760 struct tipc_net *tn = tipc_net(net); 761 struct publication *p = NULL; 762 struct sk_buff *skb = NULL; 763 u32 rc_dests; 764 765 spin_lock_bh(&tn->nametbl_lock); 766 767 if (nt->local_publ_count >= TIPC_MAX_PUBL) { 768 pr_warn("Bind failed, max limit %u reached\n", TIPC_MAX_PUBL); 769 goto exit; 770 } 771 772 p = tipc_nametbl_insert_publ(net, ua, sk, key); 773 if (p) { 774 nt->local_publ_count++; 775 skb = tipc_named_publish(net, p); 776 } 777 rc_dests = nt->rc_dests; 778 exit: 779 spin_unlock_bh(&tn->nametbl_lock); 780 781 if (skb) 782 tipc_node_broadcast(net, skb, rc_dests); 783 return p; 784 785 } 786 787 /** 788 * tipc_nametbl_withdraw - withdraw a service binding 789 * @net: network namespace 790 * @ua: service address/range being unbound 791 * @sk: address of the socket being unbound from 792 * @key: target publication key 793 */ 794 void tipc_nametbl_withdraw(struct net *net, struct tipc_uaddr *ua, 795 struct tipc_socket_addr *sk, u32 key) 796 { 797 struct name_table *nt = tipc_name_table(net); 798 struct tipc_net *tn = tipc_net(net); 799 struct sk_buff *skb = NULL; 800 struct publication *p; 801 u32 rc_dests; 802 803 spin_lock_bh(&tn->nametbl_lock); 804 805 p = tipc_nametbl_remove_publ(net, ua, sk, key); 806 if (p) { 807 nt->local_publ_count--; 808 skb = tipc_named_withdraw(net, p); 809 list_del_init(&p->binding_sock); 810 kfree_rcu(p, rcu); 811 } else { 812 pr_err("Failed to remove local publication {%u,%u,%u}/%u\n", 813 ua->sr.type, ua->sr.lower, ua->sr.upper, key); 814 } 815 rc_dests = nt->rc_dests; 816 spin_unlock_bh(&tn->nametbl_lock); 817 818 if (skb) 819 tipc_node_broadcast(net, skb, rc_dests); 820 } 821 822 /** 823 * tipc_nametbl_subscribe - add a subscription object to the name table 824 * @sub: subscription to add 825 */ 826 bool tipc_nametbl_subscribe(struct tipc_subscription *sub) 827 { 828 struct tipc_net *tn = tipc_net(sub->net); 829 struct tipc_subscr *s = &sub->evt.s; 830 u32 type = tipc_sub_read(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 tipc_sub_read(s, seq.lower), tipc_sub_read(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", type, 847 tipc_sub_read(s, seq.lower), 848 tipc_sub_read(s, seq.upper)); 849 res = false; 850 } 851 spin_unlock_bh(&tn->nametbl_lock); 852 return res; 853 } 854 855 /** 856 * tipc_nametbl_unsubscribe - remove a subscription object from name table 857 * @sub: subscription to remove 858 */ 859 void tipc_nametbl_unsubscribe(struct tipc_subscription *sub) 860 { 861 struct tipc_net *tn = tipc_net(sub->net); 862 struct tipc_subscr *s = &sub->evt.s; 863 u32 type = tipc_sub_read(s, seq.type); 864 struct tipc_service *sc; 865 struct tipc_uaddr ua; 866 867 tipc_uaddr(&ua, TIPC_SERVICE_RANGE, TIPC_NODE_SCOPE, type, 868 tipc_sub_read(s, seq.lower), tipc_sub_read(s, seq.upper)); 869 spin_lock_bh(&tn->nametbl_lock); 870 sc = tipc_service_find(sub->net, &ua); 871 if (!sc) 872 goto exit; 873 874 spin_lock_bh(&sc->lock); 875 list_del_init(&sub->service_list); 876 tipc_sub_put(sub); 877 878 /* Delete service item if no more publications and subscriptions */ 879 if (RB_EMPTY_ROOT(&sc->ranges) && list_empty(&sc->subscriptions)) { 880 hlist_del_init_rcu(&sc->service_list); 881 kfree_rcu(sc, rcu); 882 } 883 spin_unlock_bh(&sc->lock); 884 exit: 885 spin_unlock_bh(&tn->nametbl_lock); 886 } 887 888 int tipc_nametbl_init(struct net *net) 889 { 890 struct tipc_net *tn = tipc_net(net); 891 struct name_table *nt; 892 int i; 893 894 nt = kzalloc(sizeof(*nt), GFP_KERNEL); 895 if (!nt) 896 return -ENOMEM; 897 898 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) 899 INIT_HLIST_HEAD(&nt->services[i]); 900 901 INIT_LIST_HEAD(&nt->node_scope); 902 INIT_LIST_HEAD(&nt->cluster_scope); 903 rwlock_init(&nt->cluster_scope_lock); 904 tn->nametbl = nt; 905 spin_lock_init(&tn->nametbl_lock); 906 return 0; 907 } 908 909 /** 910 * tipc_service_delete - purge all publications for a service and delete it 911 * @net: the associated network namespace 912 * @sc: tipc_service to delete 913 */ 914 static void tipc_service_delete(struct net *net, struct tipc_service *sc) 915 { 916 struct service_range *sr, *tmpr; 917 struct publication *p, *tmp; 918 919 spin_lock_bh(&sc->lock); 920 rbtree_postorder_for_each_entry_safe(sr, tmpr, &sc->ranges, tree_node) { 921 list_for_each_entry_safe(p, tmp, &sr->all_publ, all_publ) { 922 tipc_service_remove_publ(sr, &p->sk, p->key); 923 kfree_rcu(p, rcu); 924 } 925 rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); 926 kfree(sr); 927 } 928 hlist_del_init_rcu(&sc->service_list); 929 spin_unlock_bh(&sc->lock); 930 kfree_rcu(sc, rcu); 931 } 932 933 void tipc_nametbl_stop(struct net *net) 934 { 935 struct name_table *nt = tipc_name_table(net); 936 struct tipc_net *tn = tipc_net(net); 937 struct hlist_head *service_head; 938 struct tipc_service *service; 939 u32 i; 940 941 /* Verify name table is empty and purge any lingering 942 * publications, then release the name table 943 */ 944 spin_lock_bh(&tn->nametbl_lock); 945 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) { 946 if (hlist_empty(&nt->services[i])) 947 continue; 948 service_head = &nt->services[i]; 949 hlist_for_each_entry_rcu(service, service_head, service_list) { 950 tipc_service_delete(net, service); 951 } 952 } 953 spin_unlock_bh(&tn->nametbl_lock); 954 955 synchronize_net(); 956 kfree(nt); 957 } 958 959 static int __tipc_nl_add_nametable_publ(struct tipc_nl_msg *msg, 960 struct tipc_service *service, 961 struct service_range *sr, 962 u32 *last_key) 963 { 964 struct publication *p; 965 struct nlattr *attrs; 966 struct nlattr *b; 967 void *hdr; 968 969 if (*last_key) { 970 list_for_each_entry(p, &sr->all_publ, all_publ) 971 if (p->key == *last_key) 972 break; 973 if (p->key != *last_key) 974 return -EPIPE; 975 } else { 976 p = list_first_entry(&sr->all_publ, 977 struct publication, 978 all_publ); 979 } 980 981 list_for_each_entry_from(p, &sr->all_publ, all_publ) { 982 *last_key = p->key; 983 984 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, 985 &tipc_genl_family, NLM_F_MULTI, 986 TIPC_NL_NAME_TABLE_GET); 987 if (!hdr) 988 return -EMSGSIZE; 989 990 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_NAME_TABLE); 991 if (!attrs) 992 goto msg_full; 993 994 b = nla_nest_start_noflag(msg->skb, TIPC_NLA_NAME_TABLE_PUBL); 995 if (!b) 996 goto attr_msg_full; 997 998 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_TYPE, service->type)) 999 goto publ_msg_full; 1000 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_LOWER, sr->lower)) 1001 goto publ_msg_full; 1002 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_UPPER, sr->upper)) 1003 goto publ_msg_full; 1004 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_SCOPE, p->scope)) 1005 goto publ_msg_full; 1006 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_NODE, p->sk.node)) 1007 goto publ_msg_full; 1008 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_REF, p->sk.ref)) 1009 goto publ_msg_full; 1010 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_KEY, p->key)) 1011 goto publ_msg_full; 1012 1013 nla_nest_end(msg->skb, b); 1014 nla_nest_end(msg->skb, attrs); 1015 genlmsg_end(msg->skb, hdr); 1016 } 1017 *last_key = 0; 1018 1019 return 0; 1020 1021 publ_msg_full: 1022 nla_nest_cancel(msg->skb, b); 1023 attr_msg_full: 1024 nla_nest_cancel(msg->skb, attrs); 1025 msg_full: 1026 genlmsg_cancel(msg->skb, hdr); 1027 1028 return -EMSGSIZE; 1029 } 1030 1031 static int __tipc_nl_service_range_list(struct tipc_nl_msg *msg, 1032 struct tipc_service *sc, 1033 u32 *last_lower, u32 *last_key) 1034 { 1035 struct service_range *sr; 1036 struct rb_node *n; 1037 int err; 1038 1039 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) { 1040 sr = container_of(n, struct service_range, tree_node); 1041 if (sr->lower < *last_lower) 1042 continue; 1043 err = __tipc_nl_add_nametable_publ(msg, sc, sr, last_key); 1044 if (err) { 1045 *last_lower = sr->lower; 1046 return err; 1047 } 1048 } 1049 *last_lower = 0; 1050 return 0; 1051 } 1052 1053 static int tipc_nl_service_list(struct net *net, struct tipc_nl_msg *msg, 1054 u32 *last_type, u32 *last_lower, u32 *last_key) 1055 { 1056 struct tipc_net *tn = tipc_net(net); 1057 struct tipc_service *service = NULL; 1058 struct hlist_head *head; 1059 struct tipc_uaddr ua; 1060 int err; 1061 int i; 1062 1063 if (*last_type) 1064 i = hash(*last_type); 1065 else 1066 i = 0; 1067 1068 for (; i < TIPC_NAMETBL_SIZE; i++) { 1069 head = &tn->nametbl->services[i]; 1070 1071 if (*last_type || 1072 (!i && *last_key && (*last_lower == *last_key))) { 1073 tipc_uaddr(&ua, TIPC_SERVICE_RANGE, TIPC_NODE_SCOPE, 1074 *last_type, *last_lower, *last_lower); 1075 service = tipc_service_find(net, &ua); 1076 if (!service) 1077 return -EPIPE; 1078 } else { 1079 hlist_for_each_entry_rcu(service, head, service_list) 1080 break; 1081 if (!service) 1082 continue; 1083 } 1084 1085 hlist_for_each_entry_from_rcu(service, service_list) { 1086 spin_lock_bh(&service->lock); 1087 err = __tipc_nl_service_range_list(msg, service, 1088 last_lower, 1089 last_key); 1090 1091 if (err) { 1092 *last_type = service->type; 1093 spin_unlock_bh(&service->lock); 1094 return err; 1095 } 1096 spin_unlock_bh(&service->lock); 1097 } 1098 *last_type = 0; 1099 } 1100 return 0; 1101 } 1102 1103 int tipc_nl_name_table_dump(struct sk_buff *skb, struct netlink_callback *cb) 1104 { 1105 struct net *net = sock_net(skb->sk); 1106 u32 last_type = cb->args[0]; 1107 u32 last_lower = cb->args[1]; 1108 u32 last_key = cb->args[2]; 1109 int done = cb->args[3]; 1110 struct tipc_nl_msg msg; 1111 int err; 1112 1113 if (done) 1114 return 0; 1115 1116 msg.skb = skb; 1117 msg.portid = NETLINK_CB(cb->skb).portid; 1118 msg.seq = cb->nlh->nlmsg_seq; 1119 1120 rcu_read_lock(); 1121 err = tipc_nl_service_list(net, &msg, &last_type, 1122 &last_lower, &last_key); 1123 if (!err) { 1124 done = 1; 1125 } else if (err != -EMSGSIZE) { 1126 /* We never set seq or call nl_dump_check_consistent() this 1127 * means that setting prev_seq here will cause the consistence 1128 * check to fail in the netlink callback handler. Resulting in 1129 * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if 1130 * we got an error. 1131 */ 1132 cb->prev_seq = 1; 1133 } 1134 rcu_read_unlock(); 1135 1136 cb->args[0] = last_type; 1137 cb->args[1] = last_lower; 1138 cb->args[2] = last_key; 1139 cb->args[3] = done; 1140 1141 return skb->len; 1142 } 1143 1144 struct tipc_dest *tipc_dest_find(struct list_head *l, u32 node, u32 port) 1145 { 1146 struct tipc_dest *dst; 1147 1148 list_for_each_entry(dst, l, list) { 1149 if (dst->node == node && dst->port == port) 1150 return dst; 1151 } 1152 return NULL; 1153 } 1154 1155 bool tipc_dest_push(struct list_head *l, u32 node, u32 port) 1156 { 1157 struct tipc_dest *dst; 1158 1159 if (tipc_dest_find(l, node, port)) 1160 return false; 1161 1162 dst = kmalloc(sizeof(*dst), GFP_ATOMIC); 1163 if (unlikely(!dst)) 1164 return false; 1165 dst->node = node; 1166 dst->port = port; 1167 list_add(&dst->list, l); 1168 return true; 1169 } 1170 1171 bool tipc_dest_pop(struct list_head *l, u32 *node, u32 *port) 1172 { 1173 struct tipc_dest *dst; 1174 1175 if (list_empty(l)) 1176 return false; 1177 dst = list_first_entry(l, typeof(*dst), list); 1178 if (port) 1179 *port = dst->port; 1180 if (node) 1181 *node = dst->node; 1182 list_del(&dst->list); 1183 kfree(dst); 1184 return true; 1185 } 1186 1187 bool tipc_dest_del(struct list_head *l, u32 node, u32 port) 1188 { 1189 struct tipc_dest *dst; 1190 1191 dst = tipc_dest_find(l, node, port); 1192 if (!dst) 1193 return false; 1194 list_del(&dst->list); 1195 kfree(dst); 1196 return true; 1197 } 1198 1199 void tipc_dest_list_purge(struct list_head *l) 1200 { 1201 struct tipc_dest *dst, *tmp; 1202 1203 list_for_each_entry_safe(dst, tmp, l, list) { 1204 list_del(&dst->list); 1205 kfree(dst); 1206 } 1207 } 1208 1209 int tipc_dest_list_len(struct list_head *l) 1210 { 1211 struct tipc_dest *dst; 1212 int i = 0; 1213 1214 list_for_each_entry(dst, l, list) { 1215 i++; 1216 } 1217 return i; 1218 } 1219