1 /* 2 * net/tipc/name_table.c: TIPC name table code 3 * 4 * Copyright (c) 2000-2006, Ericsson AB 5 * Copyright (c) 2004-2008, 2010-2011, Wind River Systems 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions are met: 10 * 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. Neither the names of the copyright holders nor the names of its 17 * contributors may be used to endorse or promote products derived from 18 * this software without specific prior written permission. 19 * 20 * Alternatively, this software may be distributed under the terms of the 21 * GNU General Public License ("GPL") version 2 as published by the Free 22 * Software Foundation. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 34 * POSSIBILITY OF SUCH DAMAGE. 35 */ 36 37 #include "core.h" 38 #include "config.h" 39 #include "name_table.h" 40 #include "name_distr.h" 41 #include "subscr.h" 42 #include "port.h" 43 44 static int tipc_nametbl_size = 1024; /* must be a power of 2 */ 45 46 /** 47 * struct name_info - name sequence publication info 48 * @node_list: circular list of publications made by own node 49 * @cluster_list: circular list of publications made by own cluster 50 * @zone_list: circular list of publications made by own zone 51 * @node_list_size: number of entries in "node_list" 52 * @cluster_list_size: number of entries in "cluster_list" 53 * @zone_list_size: number of entries in "zone_list" 54 * 55 * Note: The zone list always contains at least one entry, since all 56 * publications of the associated name sequence belong to it. 57 * (The cluster and node lists may be empty.) 58 */ 59 60 struct name_info { 61 struct list_head node_list; 62 struct list_head cluster_list; 63 struct list_head zone_list; 64 u32 node_list_size; 65 u32 cluster_list_size; 66 u32 zone_list_size; 67 }; 68 69 /** 70 * struct sub_seq - container for all published instances of a name sequence 71 * @lower: name sequence lower bound 72 * @upper: name sequence upper bound 73 * @info: pointer to name sequence publication info 74 */ 75 76 struct sub_seq { 77 u32 lower; 78 u32 upper; 79 struct name_info *info; 80 }; 81 82 /** 83 * struct name_seq - container for all published instances of a name type 84 * @type: 32 bit 'type' value for name sequence 85 * @sseq: pointer to dynamically-sized array of sub-sequences of this 'type'; 86 * sub-sequences are sorted in ascending order 87 * @alloc: number of sub-sequences currently in array 88 * @first_free: array index of first unused sub-sequence entry 89 * @ns_list: links to adjacent name sequences in hash chain 90 * @subscriptions: list of subscriptions for this 'type' 91 * @lock: spinlock controlling access to publication lists of all sub-sequences 92 */ 93 94 struct name_seq { 95 u32 type; 96 struct sub_seq *sseqs; 97 u32 alloc; 98 u32 first_free; 99 struct hlist_node ns_list; 100 struct list_head subscriptions; 101 spinlock_t lock; 102 }; 103 104 /** 105 * struct name_table - table containing all existing port name publications 106 * @types: pointer to fixed-sized array of name sequence lists, 107 * accessed via hashing on 'type'; name sequence lists are *not* sorted 108 * @local_publ_count: number of publications issued by this node 109 */ 110 111 struct name_table { 112 struct hlist_head *types; 113 u32 local_publ_count; 114 }; 115 116 static struct name_table table; 117 DEFINE_RWLOCK(tipc_nametbl_lock); 118 119 static int hash(int x) 120 { 121 return x & (tipc_nametbl_size - 1); 122 } 123 124 /** 125 * publ_create - create a publication structure 126 */ 127 128 static struct publication *publ_create(u32 type, u32 lower, u32 upper, 129 u32 scope, u32 node, u32 port_ref, 130 u32 key) 131 { 132 struct publication *publ = kzalloc(sizeof(*publ), GFP_ATOMIC); 133 if (publ == NULL) { 134 warn("Publication creation failure, no memory\n"); 135 return NULL; 136 } 137 138 publ->type = type; 139 publ->lower = lower; 140 publ->upper = upper; 141 publ->scope = scope; 142 publ->node = node; 143 publ->ref = port_ref; 144 publ->key = key; 145 INIT_LIST_HEAD(&publ->local_list); 146 INIT_LIST_HEAD(&publ->pport_list); 147 INIT_LIST_HEAD(&publ->subscr.nodesub_list); 148 return publ; 149 } 150 151 /** 152 * tipc_subseq_alloc - allocate a specified number of sub-sequence structures 153 */ 154 155 static struct sub_seq *tipc_subseq_alloc(u32 cnt) 156 { 157 struct sub_seq *sseq = kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC); 158 return sseq; 159 } 160 161 /** 162 * tipc_nameseq_create - create a name sequence structure for the specified 'type' 163 * 164 * Allocates a single sub-sequence structure and sets it to all 0's. 165 */ 166 167 static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head) 168 { 169 struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC); 170 struct sub_seq *sseq = tipc_subseq_alloc(1); 171 172 if (!nseq || !sseq) { 173 warn("Name sequence creation failed, no memory\n"); 174 kfree(nseq); 175 kfree(sseq); 176 return NULL; 177 } 178 179 spin_lock_init(&nseq->lock); 180 nseq->type = type; 181 nseq->sseqs = sseq; 182 nseq->alloc = 1; 183 INIT_HLIST_NODE(&nseq->ns_list); 184 INIT_LIST_HEAD(&nseq->subscriptions); 185 hlist_add_head(&nseq->ns_list, seq_head); 186 return nseq; 187 } 188 189 /* 190 * nameseq_delete_empty - deletes a name sequence structure if now unused 191 */ 192 static void nameseq_delete_empty(struct name_seq *seq) 193 { 194 if (!seq->first_free && list_empty(&seq->subscriptions)) { 195 hlist_del_init(&seq->ns_list); 196 kfree(seq->sseqs); 197 kfree(seq); 198 } 199 } 200 201 /* 202 * nameseq_find_subseq - find sub-sequence (if any) matching a name instance 203 * 204 * Very time-critical, so binary searches through sub-sequence array. 205 */ 206 207 static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq, 208 u32 instance) 209 { 210 struct sub_seq *sseqs = nseq->sseqs; 211 int low = 0; 212 int high = nseq->first_free - 1; 213 int mid; 214 215 while (low <= high) { 216 mid = (low + high) / 2; 217 if (instance < sseqs[mid].lower) 218 high = mid - 1; 219 else if (instance > sseqs[mid].upper) 220 low = mid + 1; 221 else 222 return &sseqs[mid]; 223 } 224 return NULL; 225 } 226 227 /** 228 * nameseq_locate_subseq - determine position of name instance in sub-sequence 229 * 230 * Returns index in sub-sequence array of the entry that contains the specified 231 * instance value; if no entry contains that value, returns the position 232 * where a new entry for it would be inserted in the array. 233 * 234 * Note: Similar to binary search code for locating a sub-sequence. 235 */ 236 237 static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance) 238 { 239 struct sub_seq *sseqs = nseq->sseqs; 240 int low = 0; 241 int high = nseq->first_free - 1; 242 int mid; 243 244 while (low <= high) { 245 mid = (low + high) / 2; 246 if (instance < sseqs[mid].lower) 247 high = mid - 1; 248 else if (instance > sseqs[mid].upper) 249 low = mid + 1; 250 else 251 return mid; 252 } 253 return low; 254 } 255 256 /** 257 * tipc_nameseq_insert_publ - 258 */ 259 260 static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq, 261 u32 type, u32 lower, u32 upper, 262 u32 scope, u32 node, u32 port, u32 key) 263 { 264 struct tipc_subscription *s; 265 struct tipc_subscription *st; 266 struct publication *publ; 267 struct sub_seq *sseq; 268 struct name_info *info; 269 int created_subseq = 0; 270 271 sseq = nameseq_find_subseq(nseq, lower); 272 if (sseq) { 273 274 /* Lower end overlaps existing entry => need an exact match */ 275 276 if ((sseq->lower != lower) || (sseq->upper != upper)) { 277 warn("Cannot publish {%u,%u,%u}, overlap error\n", 278 type, lower, upper); 279 return NULL; 280 } 281 282 info = sseq->info; 283 284 /* Check if an identical publication already exists */ 285 list_for_each_entry(publ, &info->zone_list, zone_list) { 286 if ((publ->ref == port) && (publ->key == key) && 287 (!publ->node || (publ->node == node))) 288 return NULL; 289 } 290 } else { 291 u32 inspos; 292 struct sub_seq *freesseq; 293 294 /* Find where lower end should be inserted */ 295 296 inspos = nameseq_locate_subseq(nseq, lower); 297 298 /* Fail if upper end overlaps into an existing entry */ 299 300 if ((inspos < nseq->first_free) && 301 (upper >= nseq->sseqs[inspos].lower)) { 302 warn("Cannot publish {%u,%u,%u}, overlap error\n", 303 type, lower, upper); 304 return NULL; 305 } 306 307 /* Ensure there is space for new sub-sequence */ 308 309 if (nseq->first_free == nseq->alloc) { 310 struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2); 311 312 if (!sseqs) { 313 warn("Cannot publish {%u,%u,%u}, no memory\n", 314 type, lower, upper); 315 return NULL; 316 } 317 memcpy(sseqs, nseq->sseqs, 318 nseq->alloc * sizeof(struct sub_seq)); 319 kfree(nseq->sseqs); 320 nseq->sseqs = sseqs; 321 nseq->alloc *= 2; 322 } 323 324 info = kzalloc(sizeof(*info), GFP_ATOMIC); 325 if (!info) { 326 warn("Cannot publish {%u,%u,%u}, no memory\n", 327 type, lower, upper); 328 return NULL; 329 } 330 331 INIT_LIST_HEAD(&info->node_list); 332 INIT_LIST_HEAD(&info->cluster_list); 333 INIT_LIST_HEAD(&info->zone_list); 334 335 /* Insert new sub-sequence */ 336 337 sseq = &nseq->sseqs[inspos]; 338 freesseq = &nseq->sseqs[nseq->first_free]; 339 memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq)); 340 memset(sseq, 0, sizeof(*sseq)); 341 nseq->first_free++; 342 sseq->lower = lower; 343 sseq->upper = upper; 344 sseq->info = info; 345 created_subseq = 1; 346 } 347 348 /* Insert a publication: */ 349 350 publ = publ_create(type, lower, upper, scope, node, port, key); 351 if (!publ) 352 return NULL; 353 354 list_add(&publ->zone_list, &info->zone_list); 355 info->zone_list_size++; 356 357 if (in_own_cluster(node)) { 358 list_add(&publ->cluster_list, &info->cluster_list); 359 info->cluster_list_size++; 360 } 361 362 if (in_own_node(node)) { 363 list_add(&publ->node_list, &info->node_list); 364 info->node_list_size++; 365 } 366 367 /* 368 * Any subscriptions waiting for notification? 369 */ 370 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { 371 tipc_subscr_report_overlap(s, 372 publ->lower, 373 publ->upper, 374 TIPC_PUBLISHED, 375 publ->ref, 376 publ->node, 377 created_subseq); 378 } 379 return publ; 380 } 381 382 /** 383 * tipc_nameseq_remove_publ - 384 * 385 * NOTE: There may be cases where TIPC is asked to remove a publication 386 * that is not in the name table. For example, if another node issues a 387 * publication for a name sequence that overlaps an existing name sequence 388 * the publication will not be recorded, which means the publication won't 389 * be found when the name sequence is later withdrawn by that node. 390 * A failed withdraw request simply returns a failure indication and lets the 391 * caller issue any error or warning messages associated with such a problem. 392 */ 393 394 static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 inst, 395 u32 node, u32 ref, u32 key) 396 { 397 struct publication *publ; 398 struct sub_seq *sseq = nameseq_find_subseq(nseq, inst); 399 struct name_info *info; 400 struct sub_seq *free; 401 struct tipc_subscription *s, *st; 402 int removed_subseq = 0; 403 404 if (!sseq) 405 return NULL; 406 407 info = sseq->info; 408 409 /* Locate publication, if it exists */ 410 411 list_for_each_entry(publ, &info->zone_list, zone_list) { 412 if ((publ->key == key) && (publ->ref == ref) && 413 (!publ->node || (publ->node == node))) 414 goto found; 415 } 416 return NULL; 417 418 found: 419 /* Remove publication from zone scope list */ 420 421 list_del(&publ->zone_list); 422 info->zone_list_size--; 423 424 /* Remove publication from cluster scope list, if present */ 425 426 if (in_own_cluster(node)) { 427 list_del(&publ->cluster_list); 428 info->cluster_list_size--; 429 } 430 431 /* Remove publication from node scope list, if present */ 432 433 if (in_own_node(node)) { 434 list_del(&publ->node_list); 435 info->node_list_size--; 436 } 437 438 /* Contract subseq list if no more publications for that subseq */ 439 440 if (list_empty(&info->zone_list)) { 441 kfree(info); 442 free = &nseq->sseqs[nseq->first_free--]; 443 memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq)); 444 removed_subseq = 1; 445 } 446 447 /* Notify any waiting subscriptions */ 448 449 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { 450 tipc_subscr_report_overlap(s, 451 publ->lower, 452 publ->upper, 453 TIPC_WITHDRAWN, 454 publ->ref, 455 publ->node, 456 removed_subseq); 457 } 458 459 return publ; 460 } 461 462 /** 463 * tipc_nameseq_subscribe: attach a subscription, and issue 464 * the prescribed number of events if there is any sub- 465 * sequence overlapping with the requested sequence 466 */ 467 468 static void tipc_nameseq_subscribe(struct name_seq *nseq, 469 struct tipc_subscription *s) 470 { 471 struct sub_seq *sseq = nseq->sseqs; 472 473 list_add(&s->nameseq_list, &nseq->subscriptions); 474 475 if (!sseq) 476 return; 477 478 while (sseq != &nseq->sseqs[nseq->first_free]) { 479 if (tipc_subscr_overlap(s, sseq->lower, sseq->upper)) { 480 struct publication *crs; 481 struct name_info *info = sseq->info; 482 int must_report = 1; 483 484 list_for_each_entry(crs, &info->zone_list, zone_list) { 485 tipc_subscr_report_overlap(s, 486 sseq->lower, 487 sseq->upper, 488 TIPC_PUBLISHED, 489 crs->ref, 490 crs->node, 491 must_report); 492 must_report = 0; 493 } 494 } 495 sseq++; 496 } 497 } 498 499 static struct name_seq *nametbl_find_seq(u32 type) 500 { 501 struct hlist_head *seq_head; 502 struct hlist_node *seq_node; 503 struct name_seq *ns; 504 505 seq_head = &table.types[hash(type)]; 506 hlist_for_each_entry(ns, seq_node, seq_head, ns_list) { 507 if (ns->type == type) 508 return ns; 509 } 510 511 return NULL; 512 }; 513 514 struct publication *tipc_nametbl_insert_publ(u32 type, u32 lower, u32 upper, 515 u32 scope, u32 node, u32 port, u32 key) 516 { 517 struct name_seq *seq = nametbl_find_seq(type); 518 519 if (lower > upper) { 520 warn("Failed to publish illegal {%u,%u,%u}\n", 521 type, lower, upper); 522 return NULL; 523 } 524 525 if (!seq) 526 seq = tipc_nameseq_create(type, &table.types[hash(type)]); 527 if (!seq) 528 return NULL; 529 530 return tipc_nameseq_insert_publ(seq, type, lower, upper, 531 scope, node, port, key); 532 } 533 534 struct publication *tipc_nametbl_remove_publ(u32 type, u32 lower, 535 u32 node, u32 ref, u32 key) 536 { 537 struct publication *publ; 538 struct name_seq *seq = nametbl_find_seq(type); 539 540 if (!seq) 541 return NULL; 542 543 publ = tipc_nameseq_remove_publ(seq, lower, node, ref, key); 544 nameseq_delete_empty(seq); 545 return publ; 546 } 547 548 /* 549 * tipc_nametbl_translate - perform name translation 550 * 551 * On entry, 'destnode' is the search domain used during translation. 552 * 553 * On exit: 554 * - if name translation is deferred to another node/cluster/zone, 555 * leaves 'destnode' unchanged (will be non-zero) and returns 0 556 * - if name translation is attempted and succeeds, sets 'destnode' 557 * to publishing node and returns port reference (will be non-zero) 558 * - if name translation is attempted and fails, sets 'destnode' to 0 559 * and returns 0 560 */ 561 562 u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode) 563 { 564 struct sub_seq *sseq; 565 struct name_info *info; 566 struct publication *publ; 567 struct name_seq *seq; 568 u32 ref = 0; 569 u32 node = 0; 570 571 if (!tipc_in_scope(*destnode, tipc_own_addr)) 572 return 0; 573 574 read_lock_bh(&tipc_nametbl_lock); 575 seq = nametbl_find_seq(type); 576 if (unlikely(!seq)) 577 goto not_found; 578 sseq = nameseq_find_subseq(seq, instance); 579 if (unlikely(!sseq)) 580 goto not_found; 581 spin_lock_bh(&seq->lock); 582 info = sseq->info; 583 584 /* Closest-First Algorithm: */ 585 if (likely(!*destnode)) { 586 if (!list_empty(&info->node_list)) { 587 publ = list_first_entry(&info->node_list, 588 struct publication, 589 node_list); 590 list_move_tail(&publ->node_list, 591 &info->node_list); 592 } else if (!list_empty(&info->cluster_list)) { 593 publ = list_first_entry(&info->cluster_list, 594 struct publication, 595 cluster_list); 596 list_move_tail(&publ->cluster_list, 597 &info->cluster_list); 598 } else { 599 publ = list_first_entry(&info->zone_list, 600 struct publication, 601 zone_list); 602 list_move_tail(&publ->zone_list, 603 &info->zone_list); 604 } 605 } 606 607 /* Round-Robin Algorithm: */ 608 else if (*destnode == tipc_own_addr) { 609 if (list_empty(&info->node_list)) 610 goto no_match; 611 publ = list_first_entry(&info->node_list, struct publication, 612 node_list); 613 list_move_tail(&publ->node_list, &info->node_list); 614 } else if (in_own_cluster_exact(*destnode)) { 615 if (list_empty(&info->cluster_list)) 616 goto no_match; 617 publ = list_first_entry(&info->cluster_list, struct publication, 618 cluster_list); 619 list_move_tail(&publ->cluster_list, &info->cluster_list); 620 } else { 621 publ = list_first_entry(&info->zone_list, struct publication, 622 zone_list); 623 list_move_tail(&publ->zone_list, &info->zone_list); 624 } 625 626 ref = publ->ref; 627 node = publ->node; 628 no_match: 629 spin_unlock_bh(&seq->lock); 630 not_found: 631 read_unlock_bh(&tipc_nametbl_lock); 632 *destnode = node; 633 return ref; 634 } 635 636 /** 637 * tipc_nametbl_mc_translate - find multicast destinations 638 * 639 * Creates list of all local ports that overlap the given multicast address; 640 * also determines if any off-node ports overlap. 641 * 642 * Note: Publications with a scope narrower than 'limit' are ignored. 643 * (i.e. local node-scope publications mustn't receive messages arriving 644 * from another node, even if the multcast link brought it here) 645 * 646 * Returns non-zero if any off-node ports overlap 647 */ 648 649 int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit, 650 struct tipc_port_list *dports) 651 { 652 struct name_seq *seq; 653 struct sub_seq *sseq; 654 struct sub_seq *sseq_stop; 655 struct name_info *info; 656 int res = 0; 657 658 read_lock_bh(&tipc_nametbl_lock); 659 seq = nametbl_find_seq(type); 660 if (!seq) 661 goto exit; 662 663 spin_lock_bh(&seq->lock); 664 665 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower); 666 sseq_stop = seq->sseqs + seq->first_free; 667 for (; sseq != sseq_stop; sseq++) { 668 struct publication *publ; 669 670 if (sseq->lower > upper) 671 break; 672 673 info = sseq->info; 674 list_for_each_entry(publ, &info->node_list, node_list) { 675 if (publ->scope <= limit) 676 tipc_port_list_add(dports, publ->ref); 677 } 678 679 if (info->cluster_list_size != info->node_list_size) 680 res = 1; 681 } 682 683 spin_unlock_bh(&seq->lock); 684 exit: 685 read_unlock_bh(&tipc_nametbl_lock); 686 return res; 687 } 688 689 /* 690 * tipc_nametbl_publish - add name publication to network name tables 691 */ 692 693 struct publication *tipc_nametbl_publish(u32 type, u32 lower, u32 upper, 694 u32 scope, u32 port_ref, u32 key) 695 { 696 struct publication *publ; 697 698 if (table.local_publ_count >= tipc_max_publications) { 699 warn("Publication failed, local publication limit reached (%u)\n", 700 tipc_max_publications); 701 return NULL; 702 } 703 704 write_lock_bh(&tipc_nametbl_lock); 705 publ = tipc_nametbl_insert_publ(type, lower, upper, scope, 706 tipc_own_addr, port_ref, key); 707 if (likely(publ)) { 708 table.local_publ_count++; 709 tipc_named_publish(publ); 710 } 711 write_unlock_bh(&tipc_nametbl_lock); 712 return publ; 713 } 714 715 /** 716 * tipc_nametbl_withdraw - withdraw name publication from network name tables 717 */ 718 719 int tipc_nametbl_withdraw(u32 type, u32 lower, u32 ref, u32 key) 720 { 721 struct publication *publ; 722 723 write_lock_bh(&tipc_nametbl_lock); 724 publ = tipc_nametbl_remove_publ(type, lower, tipc_own_addr, ref, key); 725 if (likely(publ)) { 726 table.local_publ_count--; 727 tipc_named_withdraw(publ); 728 write_unlock_bh(&tipc_nametbl_lock); 729 list_del_init(&publ->pport_list); 730 kfree(publ); 731 return 1; 732 } 733 write_unlock_bh(&tipc_nametbl_lock); 734 err("Unable to remove local publication\n" 735 "(type=%u, lower=%u, ref=%u, key=%u)\n", 736 type, lower, ref, key); 737 return 0; 738 } 739 740 /** 741 * tipc_nametbl_subscribe - add a subscription object to the name table 742 */ 743 744 void tipc_nametbl_subscribe(struct tipc_subscription *s) 745 { 746 u32 type = s->seq.type; 747 struct name_seq *seq; 748 749 write_lock_bh(&tipc_nametbl_lock); 750 seq = nametbl_find_seq(type); 751 if (!seq) 752 seq = tipc_nameseq_create(type, &table.types[hash(type)]); 753 if (seq) { 754 spin_lock_bh(&seq->lock); 755 tipc_nameseq_subscribe(seq, s); 756 spin_unlock_bh(&seq->lock); 757 } else { 758 warn("Failed to create subscription for {%u,%u,%u}\n", 759 s->seq.type, s->seq.lower, s->seq.upper); 760 } 761 write_unlock_bh(&tipc_nametbl_lock); 762 } 763 764 /** 765 * tipc_nametbl_unsubscribe - remove a subscription object from name table 766 */ 767 768 void tipc_nametbl_unsubscribe(struct tipc_subscription *s) 769 { 770 struct name_seq *seq; 771 772 write_lock_bh(&tipc_nametbl_lock); 773 seq = nametbl_find_seq(s->seq.type); 774 if (seq != NULL) { 775 spin_lock_bh(&seq->lock); 776 list_del_init(&s->nameseq_list); 777 spin_unlock_bh(&seq->lock); 778 nameseq_delete_empty(seq); 779 } 780 write_unlock_bh(&tipc_nametbl_lock); 781 } 782 783 784 /** 785 * subseq_list: print specified sub-sequence contents into the given buffer 786 */ 787 788 static void subseq_list(struct sub_seq *sseq, struct print_buf *buf, u32 depth, 789 u32 index) 790 { 791 char portIdStr[27]; 792 const char *scope_str[] = {"", " zone", " cluster", " node"}; 793 struct publication *publ; 794 struct name_info *info; 795 796 tipc_printf(buf, "%-10u %-10u ", sseq->lower, sseq->upper); 797 798 if (depth == 2) { 799 tipc_printf(buf, "\n"); 800 return; 801 } 802 803 info = sseq->info; 804 805 list_for_each_entry(publ, &info->zone_list, zone_list) { 806 sprintf(portIdStr, "<%u.%u.%u:%u>", 807 tipc_zone(publ->node), tipc_cluster(publ->node), 808 tipc_node(publ->node), publ->ref); 809 tipc_printf(buf, "%-26s ", portIdStr); 810 if (depth > 3) { 811 tipc_printf(buf, "%-10u %s", publ->key, 812 scope_str[publ->scope]); 813 } 814 if (!list_is_last(&publ->zone_list, &info->zone_list)) 815 tipc_printf(buf, "\n%33s", " "); 816 }; 817 818 tipc_printf(buf, "\n"); 819 } 820 821 /** 822 * nameseq_list: print specified name sequence contents into the given buffer 823 */ 824 825 static void nameseq_list(struct name_seq *seq, struct print_buf *buf, u32 depth, 826 u32 type, u32 lowbound, u32 upbound, u32 index) 827 { 828 struct sub_seq *sseq; 829 char typearea[11]; 830 831 if (seq->first_free == 0) 832 return; 833 834 sprintf(typearea, "%-10u", seq->type); 835 836 if (depth == 1) { 837 tipc_printf(buf, "%s\n", typearea); 838 return; 839 } 840 841 for (sseq = seq->sseqs; sseq != &seq->sseqs[seq->first_free]; sseq++) { 842 if ((lowbound <= sseq->upper) && (upbound >= sseq->lower)) { 843 tipc_printf(buf, "%s ", typearea); 844 spin_lock_bh(&seq->lock); 845 subseq_list(sseq, buf, depth, index); 846 spin_unlock_bh(&seq->lock); 847 sprintf(typearea, "%10s", " "); 848 } 849 } 850 } 851 852 /** 853 * nametbl_header - print name table header into the given buffer 854 */ 855 856 static void nametbl_header(struct print_buf *buf, u32 depth) 857 { 858 const char *header[] = { 859 "Type ", 860 "Lower Upper ", 861 "Port Identity ", 862 "Publication Scope" 863 }; 864 865 int i; 866 867 if (depth > 4) 868 depth = 4; 869 for (i = 0; i < depth; i++) 870 tipc_printf(buf, header[i]); 871 tipc_printf(buf, "\n"); 872 } 873 874 /** 875 * nametbl_list - print specified name table contents into the given buffer 876 */ 877 878 static void nametbl_list(struct print_buf *buf, u32 depth_info, 879 u32 type, u32 lowbound, u32 upbound) 880 { 881 struct hlist_head *seq_head; 882 struct hlist_node *seq_node; 883 struct name_seq *seq; 884 int all_types; 885 u32 depth; 886 u32 i; 887 888 all_types = (depth_info & TIPC_NTQ_ALLTYPES); 889 depth = (depth_info & ~TIPC_NTQ_ALLTYPES); 890 891 if (depth == 0) 892 return; 893 894 if (all_types) { 895 /* display all entries in name table to specified depth */ 896 nametbl_header(buf, depth); 897 lowbound = 0; 898 upbound = ~0; 899 for (i = 0; i < tipc_nametbl_size; i++) { 900 seq_head = &table.types[i]; 901 hlist_for_each_entry(seq, seq_node, seq_head, ns_list) { 902 nameseq_list(seq, buf, depth, seq->type, 903 lowbound, upbound, i); 904 } 905 } 906 } else { 907 /* display only the sequence that matches the specified type */ 908 if (upbound < lowbound) { 909 tipc_printf(buf, "invalid name sequence specified\n"); 910 return; 911 } 912 nametbl_header(buf, depth); 913 i = hash(type); 914 seq_head = &table.types[i]; 915 hlist_for_each_entry(seq, seq_node, seq_head, ns_list) { 916 if (seq->type == type) { 917 nameseq_list(seq, buf, depth, type, 918 lowbound, upbound, i); 919 break; 920 } 921 } 922 } 923 } 924 925 #define MAX_NAME_TBL_QUERY 32768 926 927 struct sk_buff *tipc_nametbl_get(const void *req_tlv_area, int req_tlv_space) 928 { 929 struct sk_buff *buf; 930 struct tipc_name_table_query *argv; 931 struct tlv_desc *rep_tlv; 932 struct print_buf b; 933 int str_len; 934 935 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NAME_TBL_QUERY)) 936 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); 937 938 buf = tipc_cfg_reply_alloc(TLV_SPACE(MAX_NAME_TBL_QUERY)); 939 if (!buf) 940 return NULL; 941 942 rep_tlv = (struct tlv_desc *)buf->data; 943 tipc_printbuf_init(&b, TLV_DATA(rep_tlv), MAX_NAME_TBL_QUERY); 944 argv = (struct tipc_name_table_query *)TLV_DATA(req_tlv_area); 945 read_lock_bh(&tipc_nametbl_lock); 946 nametbl_list(&b, ntohl(argv->depth), ntohl(argv->type), 947 ntohl(argv->lowbound), ntohl(argv->upbound)); 948 read_unlock_bh(&tipc_nametbl_lock); 949 str_len = tipc_printbuf_validate(&b); 950 951 skb_put(buf, TLV_SPACE(str_len)); 952 TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len); 953 954 return buf; 955 } 956 957 int tipc_nametbl_init(void) 958 { 959 table.types = kcalloc(tipc_nametbl_size, sizeof(struct hlist_head), 960 GFP_ATOMIC); 961 if (!table.types) 962 return -ENOMEM; 963 964 table.local_publ_count = 0; 965 return 0; 966 } 967 968 void tipc_nametbl_stop(void) 969 { 970 u32 i; 971 972 if (!table.types) 973 return; 974 975 /* Verify name table is empty, then release it */ 976 977 write_lock_bh(&tipc_nametbl_lock); 978 for (i = 0; i < tipc_nametbl_size; i++) { 979 if (!hlist_empty(&table.types[i])) 980 err("tipc_nametbl_stop(): hash chain %u is non-null\n", i); 981 } 982 kfree(table.types); 983 table.types = NULL; 984 write_unlock_bh(&tipc_nametbl_lock); 985 } 986 987