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