1 /* 2 * net/tipc/name_table.c: TIPC name table code 3 * 4 * Copyright (c) 2000-2006, 2014-2015, 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 #include <net/genetlink.h> 48 49 #define TIPC_NAMETBL_SIZE 1024 /* must be a power of 2 */ 50 51 /** 52 * struct name_info - name sequence publication info 53 * @node_list: circular list of publications made by own node 54 * @cluster_list: circular list of publications made by own cluster 55 * @zone_list: circular list of publications made by own zone 56 * @node_list_size: number of entries in "node_list" 57 * @cluster_list_size: number of entries in "cluster_list" 58 * @zone_list_size: number of entries in "zone_list" 59 * 60 * Note: The zone list always contains at least one entry, since all 61 * publications of the associated name sequence belong to it. 62 * (The cluster and node lists may be empty.) 63 */ 64 struct name_info { 65 struct list_head node_list; 66 struct list_head cluster_list; 67 struct list_head zone_list; 68 u32 node_list_size; 69 u32 cluster_list_size; 70 u32 zone_list_size; 71 }; 72 73 /** 74 * struct sub_seq - container for all published instances of a name sequence 75 * @lower: name sequence lower bound 76 * @upper: name sequence upper bound 77 * @info: pointer to name sequence publication info 78 */ 79 struct sub_seq { 80 u32 lower; 81 u32 upper; 82 struct name_info *info; 83 }; 84 85 /** 86 * struct name_seq - container for all published instances of a name type 87 * @type: 32 bit 'type' value for name sequence 88 * @sseq: pointer to dynamically-sized array of sub-sequences of this 'type'; 89 * sub-sequences are sorted in ascending order 90 * @alloc: number of sub-sequences currently in array 91 * @first_free: array index of first unused sub-sequence entry 92 * @ns_list: links to adjacent name sequences in hash chain 93 * @subscriptions: list of subscriptions for this 'type' 94 * @lock: spinlock controlling access to publication lists of all sub-sequences 95 * @rcu: RCU callback head used for deferred freeing 96 */ 97 struct name_seq { 98 u32 type; 99 struct sub_seq *sseqs; 100 u32 alloc; 101 u32 first_free; 102 struct hlist_node ns_list; 103 struct list_head subscriptions; 104 spinlock_t lock; 105 struct rcu_head rcu; 106 }; 107 108 static int hash(int x) 109 { 110 return x & (TIPC_NAMETBL_SIZE - 1); 111 } 112 113 /** 114 * publ_create - create a publication structure 115 */ 116 static struct publication *publ_create(u32 type, u32 lower, u32 upper, 117 u32 scope, u32 node, u32 port_ref, 118 u32 key) 119 { 120 struct publication *publ = kzalloc(sizeof(*publ), GFP_ATOMIC); 121 if (publ == NULL) { 122 pr_warn("Publication creation failure, no memory\n"); 123 return NULL; 124 } 125 126 publ->type = type; 127 publ->lower = lower; 128 publ->upper = upper; 129 publ->scope = scope; 130 publ->node = node; 131 publ->ref = port_ref; 132 publ->key = key; 133 INIT_LIST_HEAD(&publ->pport_list); 134 return publ; 135 } 136 137 /** 138 * tipc_subseq_alloc - allocate a specified number of sub-sequence structures 139 */ 140 static struct sub_seq *tipc_subseq_alloc(u32 cnt) 141 { 142 return kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC); 143 } 144 145 /** 146 * tipc_nameseq_create - create a name sequence structure for the specified 'type' 147 * 148 * Allocates a single sub-sequence structure and sets it to all 0's. 149 */ 150 static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head) 151 { 152 struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC); 153 struct sub_seq *sseq = tipc_subseq_alloc(1); 154 155 if (!nseq || !sseq) { 156 pr_warn("Name sequence creation failed, no memory\n"); 157 kfree(nseq); 158 kfree(sseq); 159 return NULL; 160 } 161 162 spin_lock_init(&nseq->lock); 163 nseq->type = type; 164 nseq->sseqs = sseq; 165 nseq->alloc = 1; 166 INIT_HLIST_NODE(&nseq->ns_list); 167 INIT_LIST_HEAD(&nseq->subscriptions); 168 hlist_add_head_rcu(&nseq->ns_list, seq_head); 169 return nseq; 170 } 171 172 /** 173 * nameseq_find_subseq - find sub-sequence (if any) matching a name instance 174 * 175 * Very time-critical, so binary searches through sub-sequence array. 176 */ 177 static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq, 178 u32 instance) 179 { 180 struct sub_seq *sseqs = nseq->sseqs; 181 int low = 0; 182 int high = nseq->first_free - 1; 183 int mid; 184 185 while (low <= high) { 186 mid = (low + high) / 2; 187 if (instance < sseqs[mid].lower) 188 high = mid - 1; 189 else if (instance > sseqs[mid].upper) 190 low = mid + 1; 191 else 192 return &sseqs[mid]; 193 } 194 return NULL; 195 } 196 197 /** 198 * nameseq_locate_subseq - determine position of name instance in sub-sequence 199 * 200 * Returns index in sub-sequence array of the entry that contains the specified 201 * instance value; if no entry contains that value, returns the position 202 * where a new entry for it would be inserted in the array. 203 * 204 * Note: Similar to binary search code for locating a sub-sequence. 205 */ 206 static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance) 207 { 208 struct sub_seq *sseqs = nseq->sseqs; 209 int low = 0; 210 int high = nseq->first_free - 1; 211 int mid; 212 213 while (low <= high) { 214 mid = (low + high) / 2; 215 if (instance < sseqs[mid].lower) 216 high = mid - 1; 217 else if (instance > sseqs[mid].upper) 218 low = mid + 1; 219 else 220 return mid; 221 } 222 return low; 223 } 224 225 /** 226 * tipc_nameseq_insert_publ 227 */ 228 static struct publication *tipc_nameseq_insert_publ(struct net *net, 229 struct name_seq *nseq, 230 u32 type, u32 lower, 231 u32 upper, u32 scope, 232 u32 node, u32 port, u32 key) 233 { 234 struct tipc_subscription *s; 235 struct tipc_subscription *st; 236 struct publication *publ; 237 struct sub_seq *sseq; 238 struct name_info *info; 239 int created_subseq = 0; 240 241 sseq = nameseq_find_subseq(nseq, lower); 242 if (sseq) { 243 244 /* Lower end overlaps existing entry => need an exact match */ 245 if ((sseq->lower != lower) || (sseq->upper != upper)) { 246 return NULL; 247 } 248 249 info = sseq->info; 250 251 /* Check if an identical publication already exists */ 252 list_for_each_entry(publ, &info->zone_list, zone_list) { 253 if ((publ->ref == port) && (publ->key == key) && 254 (!publ->node || (publ->node == node))) 255 return NULL; 256 } 257 } else { 258 u32 inspos; 259 struct sub_seq *freesseq; 260 261 /* Find where lower end should be inserted */ 262 inspos = nameseq_locate_subseq(nseq, lower); 263 264 /* Fail if upper end overlaps into an existing entry */ 265 if ((inspos < nseq->first_free) && 266 (upper >= nseq->sseqs[inspos].lower)) { 267 return NULL; 268 } 269 270 /* Ensure there is space for new sub-sequence */ 271 if (nseq->first_free == nseq->alloc) { 272 struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2); 273 274 if (!sseqs) { 275 pr_warn("Cannot publish {%u,%u,%u}, no memory\n", 276 type, lower, upper); 277 return NULL; 278 } 279 memcpy(sseqs, nseq->sseqs, 280 nseq->alloc * sizeof(struct sub_seq)); 281 kfree(nseq->sseqs); 282 nseq->sseqs = sseqs; 283 nseq->alloc *= 2; 284 } 285 286 info = kzalloc(sizeof(*info), GFP_ATOMIC); 287 if (!info) { 288 pr_warn("Cannot publish {%u,%u,%u}, no memory\n", 289 type, lower, upper); 290 return NULL; 291 } 292 293 INIT_LIST_HEAD(&info->node_list); 294 INIT_LIST_HEAD(&info->cluster_list); 295 INIT_LIST_HEAD(&info->zone_list); 296 297 /* Insert new sub-sequence */ 298 sseq = &nseq->sseqs[inspos]; 299 freesseq = &nseq->sseqs[nseq->first_free]; 300 memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq)); 301 memset(sseq, 0, sizeof(*sseq)); 302 nseq->first_free++; 303 sseq->lower = lower; 304 sseq->upper = upper; 305 sseq->info = info; 306 created_subseq = 1; 307 } 308 309 /* Insert a publication */ 310 publ = publ_create(type, lower, upper, scope, node, port, key); 311 if (!publ) 312 return NULL; 313 314 list_add(&publ->zone_list, &info->zone_list); 315 info->zone_list_size++; 316 317 if (in_own_cluster(net, node)) { 318 list_add(&publ->cluster_list, &info->cluster_list); 319 info->cluster_list_size++; 320 } 321 322 if (in_own_node(net, node)) { 323 list_add(&publ->node_list, &info->node_list); 324 info->node_list_size++; 325 } 326 327 /* Any subscriptions waiting for notification? */ 328 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { 329 tipc_sub_report_overlap(s, publ->lower, publ->upper, 330 TIPC_PUBLISHED, publ->ref, 331 publ->node, publ->scope, 332 created_subseq); 333 } 334 return publ; 335 } 336 337 /** 338 * tipc_nameseq_remove_publ 339 * 340 * NOTE: There may be cases where TIPC is asked to remove a publication 341 * that is not in the name table. For example, if another node issues a 342 * publication for a name sequence that overlaps an existing name sequence 343 * the publication will not be recorded, which means the publication won't 344 * be found when the name sequence is later withdrawn by that node. 345 * A failed withdraw request simply returns a failure indication and lets the 346 * caller issue any error or warning messages associated with such a problem. 347 */ 348 static struct publication *tipc_nameseq_remove_publ(struct net *net, 349 struct name_seq *nseq, 350 u32 inst, u32 node, 351 u32 ref, u32 key) 352 { 353 struct publication *publ; 354 struct sub_seq *sseq = nameseq_find_subseq(nseq, inst); 355 struct name_info *info; 356 struct sub_seq *free; 357 struct tipc_subscription *s, *st; 358 int removed_subseq = 0; 359 360 if (!sseq) 361 return NULL; 362 363 info = sseq->info; 364 365 /* Locate publication, if it exists */ 366 list_for_each_entry(publ, &info->zone_list, zone_list) { 367 if ((publ->key == key) && (publ->ref == ref) && 368 (!publ->node || (publ->node == node))) 369 goto found; 370 } 371 return NULL; 372 373 found: 374 /* Remove publication from zone scope list */ 375 list_del(&publ->zone_list); 376 info->zone_list_size--; 377 378 /* Remove publication from cluster scope list, if present */ 379 if (in_own_cluster(net, node)) { 380 list_del(&publ->cluster_list); 381 info->cluster_list_size--; 382 } 383 384 /* Remove publication from node scope list, if present */ 385 if (in_own_node(net, node)) { 386 list_del(&publ->node_list); 387 info->node_list_size--; 388 } 389 390 /* Contract subseq list if no more publications for that subseq */ 391 if (list_empty(&info->zone_list)) { 392 kfree(info); 393 free = &nseq->sseqs[nseq->first_free--]; 394 memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq)); 395 removed_subseq = 1; 396 } 397 398 /* Notify any waiting subscriptions */ 399 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { 400 tipc_sub_report_overlap(s, publ->lower, publ->upper, 401 TIPC_WITHDRAWN, publ->ref, publ->node, 402 publ->scope, removed_subseq); 403 } 404 405 return publ; 406 } 407 408 /** 409 * tipc_nameseq_subscribe - attach a subscription, and optionally 410 * issue the prescribed number of events if there is any sub- 411 * sequence overlapping with the requested sequence 412 */ 413 static void tipc_nameseq_subscribe(struct name_seq *nseq, 414 struct tipc_subscription *sub) 415 { 416 struct sub_seq *sseq = nseq->sseqs; 417 struct tipc_name_seq ns; 418 struct tipc_subscr *s = &sub->evt.s; 419 bool no_status; 420 421 ns.type = tipc_sub_read(s, seq.type); 422 ns.lower = tipc_sub_read(s, seq.lower); 423 ns.upper = tipc_sub_read(s, seq.upper); 424 no_status = tipc_sub_read(s, filter) & TIPC_SUB_NO_STATUS; 425 426 tipc_sub_get(sub); 427 list_add(&sub->nameseq_list, &nseq->subscriptions); 428 429 if (no_status || !sseq) 430 return; 431 432 while (sseq != &nseq->sseqs[nseq->first_free]) { 433 if (tipc_sub_check_overlap(&ns, sseq->lower, sseq->upper)) { 434 struct publication *crs; 435 struct name_info *info = sseq->info; 436 int must_report = 1; 437 438 list_for_each_entry(crs, &info->zone_list, zone_list) { 439 tipc_sub_report_overlap(sub, sseq->lower, 440 sseq->upper, 441 TIPC_PUBLISHED, 442 crs->ref, crs->node, 443 crs->scope, 444 must_report); 445 must_report = 0; 446 } 447 } 448 sseq++; 449 } 450 } 451 452 static struct name_seq *nametbl_find_seq(struct net *net, u32 type) 453 { 454 struct tipc_net *tn = net_generic(net, tipc_net_id); 455 struct hlist_head *seq_head; 456 struct name_seq *ns; 457 458 seq_head = &tn->nametbl->seq_hlist[hash(type)]; 459 hlist_for_each_entry_rcu(ns, seq_head, ns_list) { 460 if (ns->type == type) 461 return ns; 462 } 463 464 return NULL; 465 }; 466 467 struct publication *tipc_nametbl_insert_publ(struct net *net, u32 type, 468 u32 lower, u32 upper, u32 scope, 469 u32 node, u32 port, u32 key) 470 { 471 struct tipc_net *tn = net_generic(net, tipc_net_id); 472 struct publication *publ; 473 struct name_seq *seq = nametbl_find_seq(net, type); 474 int index = hash(type); 475 476 if ((scope < TIPC_ZONE_SCOPE) || (scope > TIPC_NODE_SCOPE) || 477 (lower > upper)) { 478 pr_debug("Failed to publish illegal {%u,%u,%u} with scope %u\n", 479 type, lower, upper, scope); 480 return NULL; 481 } 482 483 if (!seq) 484 seq = tipc_nameseq_create(type, &tn->nametbl->seq_hlist[index]); 485 if (!seq) 486 return NULL; 487 488 spin_lock_bh(&seq->lock); 489 publ = tipc_nameseq_insert_publ(net, seq, type, lower, upper, 490 scope, node, port, key); 491 spin_unlock_bh(&seq->lock); 492 return publ; 493 } 494 495 struct publication *tipc_nametbl_remove_publ(struct net *net, u32 type, 496 u32 lower, u32 node, u32 ref, 497 u32 key) 498 { 499 struct publication *publ; 500 struct name_seq *seq = nametbl_find_seq(net, type); 501 502 if (!seq) 503 return NULL; 504 505 spin_lock_bh(&seq->lock); 506 publ = tipc_nameseq_remove_publ(net, seq, lower, node, ref, key); 507 if (!seq->first_free && list_empty(&seq->subscriptions)) { 508 hlist_del_init_rcu(&seq->ns_list); 509 kfree(seq->sseqs); 510 spin_unlock_bh(&seq->lock); 511 kfree_rcu(seq, rcu); 512 return publ; 513 } 514 spin_unlock_bh(&seq->lock); 515 return publ; 516 } 517 518 /** 519 * tipc_nametbl_translate - perform name translation 520 * 521 * On entry, 'destnode' is the search domain used during translation. 522 * 523 * On exit: 524 * - if name translation is deferred to another node/cluster/zone, 525 * leaves 'destnode' unchanged (will be non-zero) and returns 0 526 * - if name translation is attempted and succeeds, sets 'destnode' 527 * to publishing node and returns port reference (will be non-zero) 528 * - if name translation is attempted and fails, sets 'destnode' to 0 529 * and returns 0 530 */ 531 u32 tipc_nametbl_translate(struct net *net, u32 type, u32 instance, 532 u32 *destnode) 533 { 534 struct tipc_net *tn = net_generic(net, tipc_net_id); 535 struct sub_seq *sseq; 536 struct name_info *info; 537 struct publication *publ; 538 struct name_seq *seq; 539 u32 ref = 0; 540 u32 node = 0; 541 542 if (!tipc_in_scope(*destnode, tn->own_addr)) 543 return 0; 544 545 rcu_read_lock(); 546 seq = nametbl_find_seq(net, type); 547 if (unlikely(!seq)) 548 goto not_found; 549 spin_lock_bh(&seq->lock); 550 sseq = nameseq_find_subseq(seq, instance); 551 if (unlikely(!sseq)) 552 goto no_match; 553 info = sseq->info; 554 555 /* Closest-First Algorithm */ 556 if (likely(!*destnode)) { 557 if (!list_empty(&info->node_list)) { 558 publ = list_first_entry(&info->node_list, 559 struct publication, 560 node_list); 561 list_move_tail(&publ->node_list, 562 &info->node_list); 563 } else if (!list_empty(&info->cluster_list)) { 564 publ = list_first_entry(&info->cluster_list, 565 struct publication, 566 cluster_list); 567 list_move_tail(&publ->cluster_list, 568 &info->cluster_list); 569 } else { 570 publ = list_first_entry(&info->zone_list, 571 struct publication, 572 zone_list); 573 list_move_tail(&publ->zone_list, 574 &info->zone_list); 575 } 576 } 577 578 /* Round-Robin Algorithm */ 579 else if (*destnode == tn->own_addr) { 580 if (list_empty(&info->node_list)) 581 goto no_match; 582 publ = list_first_entry(&info->node_list, struct publication, 583 node_list); 584 list_move_tail(&publ->node_list, &info->node_list); 585 } else if (in_own_cluster_exact(net, *destnode)) { 586 if (list_empty(&info->cluster_list)) 587 goto no_match; 588 publ = list_first_entry(&info->cluster_list, struct publication, 589 cluster_list); 590 list_move_tail(&publ->cluster_list, &info->cluster_list); 591 } else { 592 publ = list_first_entry(&info->zone_list, struct publication, 593 zone_list); 594 list_move_tail(&publ->zone_list, &info->zone_list); 595 } 596 597 ref = publ->ref; 598 node = publ->node; 599 no_match: 600 spin_unlock_bh(&seq->lock); 601 not_found: 602 rcu_read_unlock(); 603 *destnode = node; 604 return ref; 605 } 606 607 bool tipc_nametbl_lookup(struct net *net, u32 type, u32 instance, u32 scope, 608 struct list_head *dsts, int *dstcnt, u32 exclude, 609 bool all) 610 { 611 u32 self = tipc_own_addr(net); 612 struct publication *publ; 613 struct name_info *info; 614 struct name_seq *seq; 615 struct sub_seq *sseq; 616 617 *dstcnt = 0; 618 rcu_read_lock(); 619 seq = nametbl_find_seq(net, type); 620 if (unlikely(!seq)) 621 goto exit; 622 spin_lock_bh(&seq->lock); 623 sseq = nameseq_find_subseq(seq, instance); 624 if (likely(sseq)) { 625 info = sseq->info; 626 list_for_each_entry(publ, &info->zone_list, zone_list) { 627 if (publ->scope != scope) 628 continue; 629 if (publ->ref == exclude && publ->node == self) 630 continue; 631 tipc_dest_push(dsts, publ->node, publ->ref); 632 (*dstcnt)++; 633 if (all) 634 continue; 635 list_move_tail(&publ->zone_list, &info->zone_list); 636 break; 637 } 638 } 639 spin_unlock_bh(&seq->lock); 640 exit: 641 rcu_read_unlock(); 642 return !list_empty(dsts); 643 } 644 645 int tipc_nametbl_mc_lookup(struct net *net, u32 type, u32 lower, u32 upper, 646 u32 scope, bool exact, struct list_head *dports) 647 { 648 struct sub_seq *sseq_stop; 649 struct name_info *info; 650 struct publication *p; 651 struct name_seq *seq; 652 struct sub_seq *sseq; 653 int res = 0; 654 655 rcu_read_lock(); 656 seq = nametbl_find_seq(net, type); 657 if (!seq) 658 goto exit; 659 660 spin_lock_bh(&seq->lock); 661 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower); 662 sseq_stop = seq->sseqs + seq->first_free; 663 for (; sseq != sseq_stop; sseq++) { 664 if (sseq->lower > upper) 665 break; 666 info = sseq->info; 667 list_for_each_entry(p, &info->node_list, node_list) { 668 if (p->scope == scope || (!exact && p->scope < scope)) 669 tipc_dest_push(dports, 0, p->ref); 670 } 671 672 if (info->cluster_list_size != info->node_list_size) 673 res = 1; 674 } 675 spin_unlock_bh(&seq->lock); 676 exit: 677 rcu_read_unlock(); 678 return res; 679 } 680 681 /* tipc_nametbl_lookup_dst_nodes - find broadcast destination nodes 682 * - Creates list of nodes that overlap the given multicast address 683 * - Determines if any node local ports overlap 684 */ 685 void tipc_nametbl_lookup_dst_nodes(struct net *net, u32 type, u32 lower, 686 u32 upper, struct tipc_nlist *nodes) 687 { 688 struct sub_seq *sseq, *stop; 689 struct publication *publ; 690 struct name_info *info; 691 struct name_seq *seq; 692 693 rcu_read_lock(); 694 seq = nametbl_find_seq(net, type); 695 if (!seq) 696 goto exit; 697 698 spin_lock_bh(&seq->lock); 699 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower); 700 stop = seq->sseqs + seq->first_free; 701 for (; sseq != stop && sseq->lower <= upper; sseq++) { 702 info = sseq->info; 703 list_for_each_entry(publ, &info->zone_list, zone_list) { 704 tipc_nlist_add(nodes, publ->node); 705 } 706 } 707 spin_unlock_bh(&seq->lock); 708 exit: 709 rcu_read_unlock(); 710 } 711 712 /* tipc_nametbl_build_group - build list of communication group members 713 */ 714 void tipc_nametbl_build_group(struct net *net, struct tipc_group *grp, 715 u32 type, u32 scope) 716 { 717 struct sub_seq *sseq, *stop; 718 struct name_info *info; 719 struct publication *p; 720 struct name_seq *seq; 721 722 rcu_read_lock(); 723 seq = nametbl_find_seq(net, type); 724 if (!seq) 725 goto exit; 726 727 spin_lock_bh(&seq->lock); 728 sseq = seq->sseqs; 729 stop = seq->sseqs + seq->first_free; 730 for (; sseq != stop; sseq++) { 731 info = sseq->info; 732 list_for_each_entry(p, &info->zone_list, zone_list) { 733 if (p->scope != scope) 734 continue; 735 tipc_group_add_member(grp, p->node, p->ref, p->lower); 736 } 737 } 738 spin_unlock_bh(&seq->lock); 739 exit: 740 rcu_read_unlock(); 741 } 742 743 /* 744 * tipc_nametbl_publish - add name publication to network name tables 745 */ 746 struct publication *tipc_nametbl_publish(struct net *net, u32 type, u32 lower, 747 u32 upper, u32 scope, u32 port_ref, 748 u32 key) 749 { 750 struct publication *publ; 751 struct sk_buff *buf = NULL; 752 struct tipc_net *tn = net_generic(net, tipc_net_id); 753 754 spin_lock_bh(&tn->nametbl_lock); 755 if (tn->nametbl->local_publ_count >= TIPC_MAX_PUBLICATIONS) { 756 pr_warn("Publication failed, local publication limit reached (%u)\n", 757 TIPC_MAX_PUBLICATIONS); 758 spin_unlock_bh(&tn->nametbl_lock); 759 return NULL; 760 } 761 762 publ = tipc_nametbl_insert_publ(net, type, lower, upper, scope, 763 tn->own_addr, port_ref, key); 764 if (likely(publ)) { 765 tn->nametbl->local_publ_count++; 766 buf = tipc_named_publish(net, publ); 767 /* Any pending external events? */ 768 tipc_named_process_backlog(net); 769 } 770 spin_unlock_bh(&tn->nametbl_lock); 771 772 if (buf) 773 tipc_node_broadcast(net, buf); 774 return publ; 775 } 776 777 /** 778 * tipc_nametbl_withdraw - withdraw name publication from network name tables 779 */ 780 int tipc_nametbl_withdraw(struct net *net, u32 type, u32 lower, u32 ref, 781 u32 key) 782 { 783 struct publication *publ; 784 struct sk_buff *skb = NULL; 785 struct tipc_net *tn = net_generic(net, tipc_net_id); 786 787 spin_lock_bh(&tn->nametbl_lock); 788 publ = tipc_nametbl_remove_publ(net, type, lower, tn->own_addr, 789 ref, key); 790 if (likely(publ)) { 791 tn->nametbl->local_publ_count--; 792 skb = tipc_named_withdraw(net, publ); 793 /* Any pending external events? */ 794 tipc_named_process_backlog(net); 795 list_del_init(&publ->pport_list); 796 kfree_rcu(publ, rcu); 797 } else { 798 pr_err("Unable to remove local publication\n" 799 "(type=%u, lower=%u, ref=%u, key=%u)\n", 800 type, lower, ref, key); 801 } 802 spin_unlock_bh(&tn->nametbl_lock); 803 804 if (skb) { 805 tipc_node_broadcast(net, skb); 806 return 1; 807 } 808 return 0; 809 } 810 811 /** 812 * tipc_nametbl_subscribe - add a subscription object to the name table 813 */ 814 void tipc_nametbl_subscribe(struct tipc_subscription *sub) 815 { 816 struct tipc_net *tn = tipc_net(sub->net); 817 struct tipc_subscr *s = &sub->evt.s; 818 u32 type = tipc_sub_read(s, seq.type); 819 int index = hash(type); 820 struct name_seq *seq; 821 struct tipc_name_seq ns; 822 823 spin_lock_bh(&tn->nametbl_lock); 824 seq = nametbl_find_seq(sub->net, type); 825 if (!seq) 826 seq = tipc_nameseq_create(type, &tn->nametbl->seq_hlist[index]); 827 if (seq) { 828 spin_lock_bh(&seq->lock); 829 tipc_nameseq_subscribe(seq, sub); 830 spin_unlock_bh(&seq->lock); 831 } else { 832 ns.type = tipc_sub_read(s, seq.type); 833 ns.lower = tipc_sub_read(s, seq.lower); 834 ns.upper = tipc_sub_read(s, seq.upper); 835 pr_warn("Failed to create subscription for {%u,%u,%u}\n", 836 ns.type, ns.lower, ns.upper); 837 } 838 spin_unlock_bh(&tn->nametbl_lock); 839 } 840 841 /** 842 * tipc_nametbl_unsubscribe - remove a subscription object from name table 843 */ 844 void tipc_nametbl_unsubscribe(struct tipc_subscription *sub) 845 { 846 struct tipc_subscr *s = &sub->evt.s; 847 struct tipc_net *tn = tipc_net(sub->net); 848 struct name_seq *seq; 849 u32 type = tipc_sub_read(s, seq.type); 850 851 spin_lock_bh(&tn->nametbl_lock); 852 seq = nametbl_find_seq(sub->net, type); 853 if (seq != NULL) { 854 spin_lock_bh(&seq->lock); 855 list_del_init(&sub->nameseq_list); 856 tipc_sub_put(sub); 857 if (!seq->first_free && list_empty(&seq->subscriptions)) { 858 hlist_del_init_rcu(&seq->ns_list); 859 kfree(seq->sseqs); 860 spin_unlock_bh(&seq->lock); 861 kfree_rcu(seq, rcu); 862 } else { 863 spin_unlock_bh(&seq->lock); 864 } 865 } 866 spin_unlock_bh(&tn->nametbl_lock); 867 } 868 869 int tipc_nametbl_init(struct net *net) 870 { 871 struct tipc_net *tn = net_generic(net, tipc_net_id); 872 struct name_table *tipc_nametbl; 873 int i; 874 875 tipc_nametbl = kzalloc(sizeof(*tipc_nametbl), GFP_ATOMIC); 876 if (!tipc_nametbl) 877 return -ENOMEM; 878 879 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) 880 INIT_HLIST_HEAD(&tipc_nametbl->seq_hlist[i]); 881 882 INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_ZONE_SCOPE]); 883 INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_CLUSTER_SCOPE]); 884 INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_NODE_SCOPE]); 885 tn->nametbl = tipc_nametbl; 886 spin_lock_init(&tn->nametbl_lock); 887 return 0; 888 } 889 890 /** 891 * tipc_purge_publications - remove all publications for a given type 892 * 893 * tipc_nametbl_lock must be held when calling this function 894 */ 895 static void tipc_purge_publications(struct net *net, struct name_seq *seq) 896 { 897 struct publication *publ, *safe; 898 struct sub_seq *sseq; 899 struct name_info *info; 900 901 spin_lock_bh(&seq->lock); 902 sseq = seq->sseqs; 903 info = sseq->info; 904 list_for_each_entry_safe(publ, safe, &info->zone_list, zone_list) { 905 tipc_nameseq_remove_publ(net, seq, publ->lower, publ->node, 906 publ->ref, publ->key); 907 kfree_rcu(publ, rcu); 908 } 909 hlist_del_init_rcu(&seq->ns_list); 910 kfree(seq->sseqs); 911 spin_unlock_bh(&seq->lock); 912 913 kfree_rcu(seq, rcu); 914 } 915 916 void tipc_nametbl_stop(struct net *net) 917 { 918 u32 i; 919 struct name_seq *seq; 920 struct hlist_head *seq_head; 921 struct tipc_net *tn = net_generic(net, tipc_net_id); 922 struct name_table *tipc_nametbl = tn->nametbl; 923 924 /* Verify name table is empty and purge any lingering 925 * publications, then release the name table 926 */ 927 spin_lock_bh(&tn->nametbl_lock); 928 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) { 929 if (hlist_empty(&tipc_nametbl->seq_hlist[i])) 930 continue; 931 seq_head = &tipc_nametbl->seq_hlist[i]; 932 hlist_for_each_entry_rcu(seq, seq_head, ns_list) { 933 tipc_purge_publications(net, seq); 934 } 935 } 936 spin_unlock_bh(&tn->nametbl_lock); 937 938 synchronize_net(); 939 kfree(tipc_nametbl); 940 941 } 942 943 static int __tipc_nl_add_nametable_publ(struct tipc_nl_msg *msg, 944 struct name_seq *seq, 945 struct sub_seq *sseq, u32 *last_publ) 946 { 947 void *hdr; 948 struct nlattr *attrs; 949 struct nlattr *publ; 950 struct publication *p; 951 952 if (*last_publ) { 953 list_for_each_entry(p, &sseq->info->zone_list, zone_list) 954 if (p->key == *last_publ) 955 break; 956 if (p->key != *last_publ) 957 return -EPIPE; 958 } else { 959 p = list_first_entry(&sseq->info->zone_list, struct publication, 960 zone_list); 961 } 962 963 list_for_each_entry_from(p, &sseq->info->zone_list, zone_list) { 964 *last_publ = p->key; 965 966 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, 967 &tipc_genl_family, NLM_F_MULTI, 968 TIPC_NL_NAME_TABLE_GET); 969 if (!hdr) 970 return -EMSGSIZE; 971 972 attrs = nla_nest_start(msg->skb, TIPC_NLA_NAME_TABLE); 973 if (!attrs) 974 goto msg_full; 975 976 publ = nla_nest_start(msg->skb, TIPC_NLA_NAME_TABLE_PUBL); 977 if (!publ) 978 goto attr_msg_full; 979 980 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_TYPE, seq->type)) 981 goto publ_msg_full; 982 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_LOWER, sseq->lower)) 983 goto publ_msg_full; 984 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_UPPER, sseq->upper)) 985 goto publ_msg_full; 986 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_SCOPE, p->scope)) 987 goto publ_msg_full; 988 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_NODE, p->node)) 989 goto publ_msg_full; 990 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_REF, p->ref)) 991 goto publ_msg_full; 992 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_KEY, p->key)) 993 goto publ_msg_full; 994 995 nla_nest_end(msg->skb, publ); 996 nla_nest_end(msg->skb, attrs); 997 genlmsg_end(msg->skb, hdr); 998 } 999 *last_publ = 0; 1000 1001 return 0; 1002 1003 publ_msg_full: 1004 nla_nest_cancel(msg->skb, publ); 1005 attr_msg_full: 1006 nla_nest_cancel(msg->skb, attrs); 1007 msg_full: 1008 genlmsg_cancel(msg->skb, hdr); 1009 1010 return -EMSGSIZE; 1011 } 1012 1013 static int __tipc_nl_subseq_list(struct tipc_nl_msg *msg, struct name_seq *seq, 1014 u32 *last_lower, u32 *last_publ) 1015 { 1016 struct sub_seq *sseq; 1017 struct sub_seq *sseq_start; 1018 int err; 1019 1020 if (*last_lower) { 1021 sseq_start = nameseq_find_subseq(seq, *last_lower); 1022 if (!sseq_start) 1023 return -EPIPE; 1024 } else { 1025 sseq_start = seq->sseqs; 1026 } 1027 1028 for (sseq = sseq_start; sseq != &seq->sseqs[seq->first_free]; sseq++) { 1029 err = __tipc_nl_add_nametable_publ(msg, seq, sseq, last_publ); 1030 if (err) { 1031 *last_lower = sseq->lower; 1032 return err; 1033 } 1034 } 1035 *last_lower = 0; 1036 1037 return 0; 1038 } 1039 1040 static int tipc_nl_seq_list(struct net *net, struct tipc_nl_msg *msg, 1041 u32 *last_type, u32 *last_lower, u32 *last_publ) 1042 { 1043 struct tipc_net *tn = net_generic(net, tipc_net_id); 1044 struct hlist_head *seq_head; 1045 struct name_seq *seq = NULL; 1046 int err; 1047 int i; 1048 1049 if (*last_type) 1050 i = hash(*last_type); 1051 else 1052 i = 0; 1053 1054 for (; i < TIPC_NAMETBL_SIZE; i++) { 1055 seq_head = &tn->nametbl->seq_hlist[i]; 1056 1057 if (*last_type) { 1058 seq = nametbl_find_seq(net, *last_type); 1059 if (!seq) 1060 return -EPIPE; 1061 } else { 1062 hlist_for_each_entry_rcu(seq, seq_head, ns_list) 1063 break; 1064 if (!seq) 1065 continue; 1066 } 1067 1068 hlist_for_each_entry_from_rcu(seq, ns_list) { 1069 spin_lock_bh(&seq->lock); 1070 err = __tipc_nl_subseq_list(msg, seq, last_lower, 1071 last_publ); 1072 1073 if (err) { 1074 *last_type = seq->type; 1075 spin_unlock_bh(&seq->lock); 1076 return err; 1077 } 1078 spin_unlock_bh(&seq->lock); 1079 } 1080 *last_type = 0; 1081 } 1082 return 0; 1083 } 1084 1085 int tipc_nl_name_table_dump(struct sk_buff *skb, struct netlink_callback *cb) 1086 { 1087 int err; 1088 int done = cb->args[3]; 1089 u32 last_type = cb->args[0]; 1090 u32 last_lower = cb->args[1]; 1091 u32 last_publ = cb->args[2]; 1092 struct net *net = sock_net(skb->sk); 1093 struct tipc_nl_msg msg; 1094 1095 if (done) 1096 return 0; 1097 1098 msg.skb = skb; 1099 msg.portid = NETLINK_CB(cb->skb).portid; 1100 msg.seq = cb->nlh->nlmsg_seq; 1101 1102 rcu_read_lock(); 1103 err = tipc_nl_seq_list(net, &msg, &last_type, &last_lower, &last_publ); 1104 if (!err) { 1105 done = 1; 1106 } else if (err != -EMSGSIZE) { 1107 /* We never set seq or call nl_dump_check_consistent() this 1108 * means that setting prev_seq here will cause the consistence 1109 * check to fail in the netlink callback handler. Resulting in 1110 * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if 1111 * we got an error. 1112 */ 1113 cb->prev_seq = 1; 1114 } 1115 rcu_read_unlock(); 1116 1117 cb->args[0] = last_type; 1118 cb->args[1] = last_lower; 1119 cb->args[2] = last_publ; 1120 cb->args[3] = done; 1121 1122 return skb->len; 1123 } 1124 1125 struct tipc_dest *tipc_dest_find(struct list_head *l, u32 node, u32 port) 1126 { 1127 u64 value = (u64)node << 32 | port; 1128 struct tipc_dest *dst; 1129 1130 list_for_each_entry(dst, l, list) { 1131 if (dst->value != value) 1132 continue; 1133 return dst; 1134 } 1135 return NULL; 1136 } 1137 1138 bool tipc_dest_push(struct list_head *l, u32 node, u32 port) 1139 { 1140 u64 value = (u64)node << 32 | port; 1141 struct tipc_dest *dst; 1142 1143 if (tipc_dest_find(l, node, port)) 1144 return false; 1145 1146 dst = kmalloc(sizeof(*dst), GFP_ATOMIC); 1147 if (unlikely(!dst)) 1148 return false; 1149 dst->value = value; 1150 list_add(&dst->list, l); 1151 return true; 1152 } 1153 1154 bool tipc_dest_pop(struct list_head *l, u32 *node, u32 *port) 1155 { 1156 struct tipc_dest *dst; 1157 1158 if (list_empty(l)) 1159 return false; 1160 dst = list_first_entry(l, typeof(*dst), list); 1161 if (port) 1162 *port = dst->port; 1163 if (node) 1164 *node = dst->node; 1165 list_del(&dst->list); 1166 kfree(dst); 1167 return true; 1168 } 1169 1170 bool tipc_dest_del(struct list_head *l, u32 node, u32 port) 1171 { 1172 struct tipc_dest *dst; 1173 1174 dst = tipc_dest_find(l, node, port); 1175 if (!dst) 1176 return false; 1177 list_del(&dst->list); 1178 kfree(dst); 1179 return true; 1180 } 1181 1182 void tipc_dest_list_purge(struct list_head *l) 1183 { 1184 struct tipc_dest *dst, *tmp; 1185 1186 list_for_each_entry_safe(dst, tmp, l, list) { 1187 list_del(&dst->list); 1188 kfree(dst); 1189 } 1190 } 1191 1192 int tipc_dest_list_len(struct list_head *l) 1193 { 1194 struct tipc_dest *dst; 1195 int i = 0; 1196 1197 list_for_each_entry(dst, l, list) { 1198 i++; 1199 } 1200 return i; 1201 } 1202