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_find_subseq - find sub-sequence (if any) matching a name instance 191 * 192 * Very time-critical, so binary searches through sub-sequence array. 193 */ 194 195 static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq, 196 u32 instance) 197 { 198 struct sub_seq *sseqs = nseq->sseqs; 199 int low = 0; 200 int high = nseq->first_free - 1; 201 int mid; 202 203 while (low <= high) { 204 mid = (low + high) / 2; 205 if (instance < sseqs[mid].lower) 206 high = mid - 1; 207 else if (instance > sseqs[mid].upper) 208 low = mid + 1; 209 else 210 return &sseqs[mid]; 211 } 212 return NULL; 213 } 214 215 /** 216 * nameseq_locate_subseq - determine position of name instance in sub-sequence 217 * 218 * Returns index in sub-sequence array of the entry that contains the specified 219 * instance value; if no entry contains that value, returns the position 220 * where a new entry for it would be inserted in the array. 221 * 222 * Note: Similar to binary search code for locating a sub-sequence. 223 */ 224 225 static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance) 226 { 227 struct sub_seq *sseqs = nseq->sseqs; 228 int low = 0; 229 int high = nseq->first_free - 1; 230 int mid; 231 232 while (low <= high) { 233 mid = (low + high) / 2; 234 if (instance < sseqs[mid].lower) 235 high = mid - 1; 236 else if (instance > sseqs[mid].upper) 237 low = mid + 1; 238 else 239 return mid; 240 } 241 return low; 242 } 243 244 /** 245 * tipc_nameseq_insert_publ - 246 */ 247 248 static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq, 249 u32 type, u32 lower, u32 upper, 250 u32 scope, u32 node, u32 port, u32 key) 251 { 252 struct tipc_subscription *s; 253 struct tipc_subscription *st; 254 struct publication *publ; 255 struct sub_seq *sseq; 256 struct name_info *info; 257 int created_subseq = 0; 258 259 sseq = nameseq_find_subseq(nseq, lower); 260 if (sseq) { 261 262 /* Lower end overlaps existing entry => need an exact match */ 263 264 if ((sseq->lower != lower) || (sseq->upper != upper)) { 265 warn("Cannot publish {%u,%u,%u}, overlap error\n", 266 type, lower, upper); 267 return NULL; 268 } 269 270 info = sseq->info; 271 } else { 272 u32 inspos; 273 struct sub_seq *freesseq; 274 275 /* Find where lower end should be inserted */ 276 277 inspos = nameseq_locate_subseq(nseq, lower); 278 279 /* Fail if upper end overlaps into an existing entry */ 280 281 if ((inspos < nseq->first_free) && 282 (upper >= nseq->sseqs[inspos].lower)) { 283 warn("Cannot publish {%u,%u,%u}, overlap error\n", 284 type, lower, upper); 285 return NULL; 286 } 287 288 /* Ensure there is space for new sub-sequence */ 289 290 if (nseq->first_free == nseq->alloc) { 291 struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2); 292 293 if (!sseqs) { 294 warn("Cannot publish {%u,%u,%u}, no memory\n", 295 type, lower, upper); 296 return NULL; 297 } 298 memcpy(sseqs, nseq->sseqs, 299 nseq->alloc * sizeof(struct sub_seq)); 300 kfree(nseq->sseqs); 301 nseq->sseqs = sseqs; 302 nseq->alloc *= 2; 303 } 304 305 info = kzalloc(sizeof(*info), GFP_ATOMIC); 306 if (!info) { 307 warn("Cannot publish {%u,%u,%u}, no memory\n", 308 type, lower, upper); 309 return NULL; 310 } 311 312 INIT_LIST_HEAD(&info->node_list); 313 INIT_LIST_HEAD(&info->cluster_list); 314 INIT_LIST_HEAD(&info->zone_list); 315 316 /* Insert new sub-sequence */ 317 318 sseq = &nseq->sseqs[inspos]; 319 freesseq = &nseq->sseqs[nseq->first_free]; 320 memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq)); 321 memset(sseq, 0, sizeof(*sseq)); 322 nseq->first_free++; 323 sseq->lower = lower; 324 sseq->upper = upper; 325 sseq->info = info; 326 created_subseq = 1; 327 } 328 329 /* Insert a publication: */ 330 331 publ = publ_create(type, lower, upper, scope, node, port, key); 332 if (!publ) 333 return NULL; 334 335 list_add(&publ->zone_list, &info->zone_list); 336 info->zone_list_size++; 337 338 if (in_own_cluster(node)) { 339 list_add(&publ->cluster_list, &info->cluster_list); 340 info->cluster_list_size++; 341 } 342 343 if (node == tipc_own_addr) { 344 list_add(&publ->node_list, &info->node_list); 345 info->node_list_size++; 346 } 347 348 /* 349 * Any subscriptions waiting for notification? 350 */ 351 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { 352 tipc_subscr_report_overlap(s, 353 publ->lower, 354 publ->upper, 355 TIPC_PUBLISHED, 356 publ->ref, 357 publ->node, 358 created_subseq); 359 } 360 return publ; 361 } 362 363 /** 364 * tipc_nameseq_remove_publ - 365 * 366 * NOTE: There may be cases where TIPC is asked to remove a publication 367 * that is not in the name table. For example, if another node issues a 368 * publication for a name sequence that overlaps an existing name sequence 369 * the publication will not be recorded, which means the publication won't 370 * be found when the name sequence is later withdrawn by that node. 371 * A failed withdraw request simply returns a failure indication and lets the 372 * caller issue any error or warning messages associated with such a problem. 373 */ 374 375 static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 inst, 376 u32 node, u32 ref, u32 key) 377 { 378 struct publication *publ; 379 struct sub_seq *sseq = nameseq_find_subseq(nseq, inst); 380 struct name_info *info; 381 struct sub_seq *free; 382 struct tipc_subscription *s, *st; 383 int removed_subseq = 0; 384 385 if (!sseq) 386 return NULL; 387 388 info = sseq->info; 389 390 /* Locate publication, if it exists */ 391 392 list_for_each_entry(publ, &info->zone_list, zone_list) { 393 if ((publ->key == key) && (publ->ref == ref) && 394 (!publ->node || (publ->node == node))) 395 goto found; 396 } 397 return NULL; 398 399 found: 400 /* Remove publication from zone scope list */ 401 402 list_del(&publ->zone_list); 403 info->zone_list_size--; 404 405 /* Remove publication from cluster scope list, if present */ 406 407 if (in_own_cluster(node)) { 408 list_del(&publ->cluster_list); 409 info->cluster_list_size--; 410 } 411 412 /* Remove publication from node scope list, if present */ 413 414 if (node == tipc_own_addr) { 415 list_del(&publ->node_list); 416 info->node_list_size--; 417 } 418 419 /* Contract subseq list if no more publications for that subseq */ 420 421 if (list_empty(&info->zone_list)) { 422 kfree(info); 423 free = &nseq->sseqs[nseq->first_free--]; 424 memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq)); 425 removed_subseq = 1; 426 } 427 428 /* Notify any waiting subscriptions */ 429 430 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { 431 tipc_subscr_report_overlap(s, 432 publ->lower, 433 publ->upper, 434 TIPC_WITHDRAWN, 435 publ->ref, 436 publ->node, 437 removed_subseq); 438 } 439 440 return publ; 441 } 442 443 /** 444 * tipc_nameseq_subscribe: attach a subscription, and issue 445 * the prescribed number of events if there is any sub- 446 * sequence overlapping with the requested sequence 447 */ 448 449 static void tipc_nameseq_subscribe(struct name_seq *nseq, 450 struct tipc_subscription *s) 451 { 452 struct sub_seq *sseq = nseq->sseqs; 453 454 list_add(&s->nameseq_list, &nseq->subscriptions); 455 456 if (!sseq) 457 return; 458 459 while (sseq != &nseq->sseqs[nseq->first_free]) { 460 if (tipc_subscr_overlap(s, sseq->lower, sseq->upper)) { 461 struct publication *crs; 462 struct name_info *info = sseq->info; 463 int must_report = 1; 464 465 list_for_each_entry(crs, &info->zone_list, zone_list) { 466 tipc_subscr_report_overlap(s, 467 sseq->lower, 468 sseq->upper, 469 TIPC_PUBLISHED, 470 crs->ref, 471 crs->node, 472 must_report); 473 must_report = 0; 474 } 475 } 476 sseq++; 477 } 478 } 479 480 static struct name_seq *nametbl_find_seq(u32 type) 481 { 482 struct hlist_head *seq_head; 483 struct hlist_node *seq_node; 484 struct name_seq *ns; 485 486 seq_head = &table.types[hash(type)]; 487 hlist_for_each_entry(ns, seq_node, seq_head, ns_list) { 488 if (ns->type == type) 489 return ns; 490 } 491 492 return NULL; 493 }; 494 495 struct publication *tipc_nametbl_insert_publ(u32 type, u32 lower, u32 upper, 496 u32 scope, u32 node, u32 port, u32 key) 497 { 498 struct name_seq *seq = nametbl_find_seq(type); 499 500 if (lower > upper) { 501 warn("Failed to publish illegal {%u,%u,%u}\n", 502 type, lower, upper); 503 return NULL; 504 } 505 506 if (!seq) 507 seq = tipc_nameseq_create(type, &table.types[hash(type)]); 508 if (!seq) 509 return NULL; 510 511 return tipc_nameseq_insert_publ(seq, type, lower, upper, 512 scope, node, port, key); 513 } 514 515 struct publication *tipc_nametbl_remove_publ(u32 type, u32 lower, 516 u32 node, u32 ref, u32 key) 517 { 518 struct publication *publ; 519 struct name_seq *seq = nametbl_find_seq(type); 520 521 if (!seq) 522 return NULL; 523 524 publ = tipc_nameseq_remove_publ(seq, lower, node, ref, key); 525 526 if (!seq->first_free && list_empty(&seq->subscriptions)) { 527 hlist_del_init(&seq->ns_list); 528 kfree(seq->sseqs); 529 kfree(seq); 530 } 531 return publ; 532 } 533 534 /* 535 * tipc_nametbl_translate - translate name to port id 536 * 537 * Note: on entry 'destnode' is the search domain used during translation; 538 * on exit it passes back the node address of the matching port (if any) 539 */ 540 541 u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode) 542 { 543 struct sub_seq *sseq; 544 struct name_info *info; 545 struct publication *publ; 546 struct name_seq *seq; 547 u32 ref = 0; 548 549 if (!tipc_in_scope(*destnode, tipc_own_addr)) 550 return 0; 551 552 read_lock_bh(&tipc_nametbl_lock); 553 seq = nametbl_find_seq(type); 554 if (unlikely(!seq)) 555 goto not_found; 556 sseq = nameseq_find_subseq(seq, instance); 557 if (unlikely(!sseq)) 558 goto not_found; 559 spin_lock_bh(&seq->lock); 560 info = sseq->info; 561 562 /* Closest-First Algorithm: */ 563 if (likely(!*destnode)) { 564 if (!list_empty(&info->node_list)) { 565 publ = list_first_entry(&info->node_list, 566 struct publication, 567 node_list); 568 list_move_tail(&publ->node_list, 569 &info->node_list); 570 } else if (!list_empty(&info->cluster_list)) { 571 publ = list_first_entry(&info->cluster_list, 572 struct publication, 573 cluster_list); 574 list_move_tail(&publ->cluster_list, 575 &info->cluster_list); 576 } else { 577 publ = list_first_entry(&info->zone_list, 578 struct publication, 579 zone_list); 580 list_move_tail(&publ->zone_list, 581 &info->zone_list); 582 } 583 } 584 585 /* Round-Robin Algorithm: */ 586 else if (*destnode == tipc_own_addr) { 587 if (list_empty(&info->node_list)) 588 goto no_match; 589 publ = list_first_entry(&info->node_list, struct publication, 590 node_list); 591 list_move_tail(&publ->node_list, &info->node_list); 592 } else if (in_own_cluster(*destnode)) { 593 if (list_empty(&info->cluster_list)) 594 goto no_match; 595 publ = list_first_entry(&info->cluster_list, struct publication, 596 cluster_list); 597 list_move_tail(&publ->cluster_list, &info->cluster_list); 598 } else { 599 publ = list_first_entry(&info->zone_list, struct publication, 600 zone_list); 601 list_move_tail(&publ->zone_list, &info->zone_list); 602 } 603 604 ref = publ->ref; 605 *destnode = publ->node; 606 no_match: 607 spin_unlock_bh(&seq->lock); 608 not_found: 609 read_unlock_bh(&tipc_nametbl_lock); 610 return ref; 611 } 612 613 /** 614 * tipc_nametbl_mc_translate - find multicast destinations 615 * 616 * Creates list of all local ports that overlap the given multicast address; 617 * also determines if any off-node ports overlap. 618 * 619 * Note: Publications with a scope narrower than 'limit' are ignored. 620 * (i.e. local node-scope publications mustn't receive messages arriving 621 * from another node, even if the multcast link brought it here) 622 * 623 * Returns non-zero if any off-node ports overlap 624 */ 625 626 int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit, 627 struct tipc_port_list *dports) 628 { 629 struct name_seq *seq; 630 struct sub_seq *sseq; 631 struct sub_seq *sseq_stop; 632 struct name_info *info; 633 int res = 0; 634 635 read_lock_bh(&tipc_nametbl_lock); 636 seq = nametbl_find_seq(type); 637 if (!seq) 638 goto exit; 639 640 spin_lock_bh(&seq->lock); 641 642 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower); 643 sseq_stop = seq->sseqs + seq->first_free; 644 for (; sseq != sseq_stop; sseq++) { 645 struct publication *publ; 646 647 if (sseq->lower > upper) 648 break; 649 650 info = sseq->info; 651 list_for_each_entry(publ, &info->node_list, node_list) { 652 if (publ->scope <= limit) 653 tipc_port_list_add(dports, publ->ref); 654 } 655 656 if (info->cluster_list_size != info->node_list_size) 657 res = 1; 658 } 659 660 spin_unlock_bh(&seq->lock); 661 exit: 662 read_unlock_bh(&tipc_nametbl_lock); 663 return res; 664 } 665 666 /* 667 * tipc_nametbl_publish - add name publication to network name tables 668 */ 669 670 struct publication *tipc_nametbl_publish(u32 type, u32 lower, u32 upper, 671 u32 scope, u32 port_ref, u32 key) 672 { 673 struct publication *publ; 674 675 if (table.local_publ_count >= tipc_max_publications) { 676 warn("Publication failed, local publication limit reached (%u)\n", 677 tipc_max_publications); 678 return NULL; 679 } 680 681 write_lock_bh(&tipc_nametbl_lock); 682 table.local_publ_count++; 683 publ = tipc_nametbl_insert_publ(type, lower, upper, scope, 684 tipc_own_addr, port_ref, key); 685 if (publ && (scope != TIPC_NODE_SCOPE)) 686 tipc_named_publish(publ); 687 write_unlock_bh(&tipc_nametbl_lock); 688 return publ; 689 } 690 691 /** 692 * tipc_nametbl_withdraw - withdraw name publication from network name tables 693 */ 694 695 int tipc_nametbl_withdraw(u32 type, u32 lower, u32 ref, u32 key) 696 { 697 struct publication *publ; 698 699 write_lock_bh(&tipc_nametbl_lock); 700 publ = tipc_nametbl_remove_publ(type, lower, tipc_own_addr, ref, key); 701 if (likely(publ)) { 702 table.local_publ_count--; 703 if (publ->scope != TIPC_NODE_SCOPE) 704 tipc_named_withdraw(publ); 705 write_unlock_bh(&tipc_nametbl_lock); 706 list_del_init(&publ->pport_list); 707 kfree(publ); 708 return 1; 709 } 710 write_unlock_bh(&tipc_nametbl_lock); 711 err("Unable to remove local publication\n" 712 "(type=%u, lower=%u, ref=%u, key=%u)\n", 713 type, lower, ref, key); 714 return 0; 715 } 716 717 /** 718 * tipc_nametbl_subscribe - add a subscription object to the name table 719 */ 720 721 void tipc_nametbl_subscribe(struct tipc_subscription *s) 722 { 723 u32 type = s->seq.type; 724 struct name_seq *seq; 725 726 write_lock_bh(&tipc_nametbl_lock); 727 seq = nametbl_find_seq(type); 728 if (!seq) 729 seq = tipc_nameseq_create(type, &table.types[hash(type)]); 730 if (seq) { 731 spin_lock_bh(&seq->lock); 732 tipc_nameseq_subscribe(seq, s); 733 spin_unlock_bh(&seq->lock); 734 } else { 735 warn("Failed to create subscription for {%u,%u,%u}\n", 736 s->seq.type, s->seq.lower, s->seq.upper); 737 } 738 write_unlock_bh(&tipc_nametbl_lock); 739 } 740 741 /** 742 * tipc_nametbl_unsubscribe - remove a subscription object from name table 743 */ 744 745 void tipc_nametbl_unsubscribe(struct tipc_subscription *s) 746 { 747 struct name_seq *seq; 748 749 write_lock_bh(&tipc_nametbl_lock); 750 seq = nametbl_find_seq(s->seq.type); 751 if (seq != NULL) { 752 spin_lock_bh(&seq->lock); 753 list_del_init(&s->nameseq_list); 754 spin_unlock_bh(&seq->lock); 755 if ((seq->first_free == 0) && list_empty(&seq->subscriptions)) { 756 hlist_del_init(&seq->ns_list); 757 kfree(seq->sseqs); 758 kfree(seq); 759 } 760 } 761 write_unlock_bh(&tipc_nametbl_lock); 762 } 763 764 765 /** 766 * subseq_list: print specified sub-sequence contents into the given buffer 767 */ 768 769 static void subseq_list(struct sub_seq *sseq, struct print_buf *buf, u32 depth, 770 u32 index) 771 { 772 char portIdStr[27]; 773 const char *scope_str[] = {"", " zone", " cluster", " node"}; 774 struct publication *publ; 775 struct name_info *info; 776 777 tipc_printf(buf, "%-10u %-10u ", sseq->lower, sseq->upper); 778 779 if (depth == 2) { 780 tipc_printf(buf, "\n"); 781 return; 782 } 783 784 info = sseq->info; 785 786 list_for_each_entry(publ, &info->zone_list, zone_list) { 787 sprintf(portIdStr, "<%u.%u.%u:%u>", 788 tipc_zone(publ->node), tipc_cluster(publ->node), 789 tipc_node(publ->node), publ->ref); 790 tipc_printf(buf, "%-26s ", portIdStr); 791 if (depth > 3) { 792 tipc_printf(buf, "%-10u %s", publ->key, 793 scope_str[publ->scope]); 794 } 795 if (!list_is_last(&publ->zone_list, &info->zone_list)) 796 tipc_printf(buf, "\n%33s", " "); 797 }; 798 799 tipc_printf(buf, "\n"); 800 } 801 802 /** 803 * nameseq_list: print specified name sequence contents into the given buffer 804 */ 805 806 static void nameseq_list(struct name_seq *seq, struct print_buf *buf, u32 depth, 807 u32 type, u32 lowbound, u32 upbound, u32 index) 808 { 809 struct sub_seq *sseq; 810 char typearea[11]; 811 812 if (seq->first_free == 0) 813 return; 814 815 sprintf(typearea, "%-10u", seq->type); 816 817 if (depth == 1) { 818 tipc_printf(buf, "%s\n", typearea); 819 return; 820 } 821 822 for (sseq = seq->sseqs; sseq != &seq->sseqs[seq->first_free]; sseq++) { 823 if ((lowbound <= sseq->upper) && (upbound >= sseq->lower)) { 824 tipc_printf(buf, "%s ", typearea); 825 spin_lock_bh(&seq->lock); 826 subseq_list(sseq, buf, depth, index); 827 spin_unlock_bh(&seq->lock); 828 sprintf(typearea, "%10s", " "); 829 } 830 } 831 } 832 833 /** 834 * nametbl_header - print name table header into the given buffer 835 */ 836 837 static void nametbl_header(struct print_buf *buf, u32 depth) 838 { 839 const char *header[] = { 840 "Type ", 841 "Lower Upper ", 842 "Port Identity ", 843 "Publication Scope" 844 }; 845 846 int i; 847 848 if (depth > 4) 849 depth = 4; 850 for (i = 0; i < depth; i++) 851 tipc_printf(buf, header[i]); 852 tipc_printf(buf, "\n"); 853 } 854 855 /** 856 * nametbl_list - print specified name table contents into the given buffer 857 */ 858 859 static void nametbl_list(struct print_buf *buf, u32 depth_info, 860 u32 type, u32 lowbound, u32 upbound) 861 { 862 struct hlist_head *seq_head; 863 struct hlist_node *seq_node; 864 struct name_seq *seq; 865 int all_types; 866 u32 depth; 867 u32 i; 868 869 all_types = (depth_info & TIPC_NTQ_ALLTYPES); 870 depth = (depth_info & ~TIPC_NTQ_ALLTYPES); 871 872 if (depth == 0) 873 return; 874 875 if (all_types) { 876 /* display all entries in name table to specified depth */ 877 nametbl_header(buf, depth); 878 lowbound = 0; 879 upbound = ~0; 880 for (i = 0; i < tipc_nametbl_size; i++) { 881 seq_head = &table.types[i]; 882 hlist_for_each_entry(seq, seq_node, seq_head, ns_list) { 883 nameseq_list(seq, buf, depth, seq->type, 884 lowbound, upbound, i); 885 } 886 } 887 } else { 888 /* display only the sequence that matches the specified type */ 889 if (upbound < lowbound) { 890 tipc_printf(buf, "invalid name sequence specified\n"); 891 return; 892 } 893 nametbl_header(buf, depth); 894 i = hash(type); 895 seq_head = &table.types[i]; 896 hlist_for_each_entry(seq, seq_node, seq_head, ns_list) { 897 if (seq->type == type) { 898 nameseq_list(seq, buf, depth, type, 899 lowbound, upbound, i); 900 break; 901 } 902 } 903 } 904 } 905 906 #define MAX_NAME_TBL_QUERY 32768 907 908 struct sk_buff *tipc_nametbl_get(const void *req_tlv_area, int req_tlv_space) 909 { 910 struct sk_buff *buf; 911 struct tipc_name_table_query *argv; 912 struct tlv_desc *rep_tlv; 913 struct print_buf b; 914 int str_len; 915 916 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NAME_TBL_QUERY)) 917 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); 918 919 buf = tipc_cfg_reply_alloc(TLV_SPACE(MAX_NAME_TBL_QUERY)); 920 if (!buf) 921 return NULL; 922 923 rep_tlv = (struct tlv_desc *)buf->data; 924 tipc_printbuf_init(&b, TLV_DATA(rep_tlv), MAX_NAME_TBL_QUERY); 925 argv = (struct tipc_name_table_query *)TLV_DATA(req_tlv_area); 926 read_lock_bh(&tipc_nametbl_lock); 927 nametbl_list(&b, ntohl(argv->depth), ntohl(argv->type), 928 ntohl(argv->lowbound), ntohl(argv->upbound)); 929 read_unlock_bh(&tipc_nametbl_lock); 930 str_len = tipc_printbuf_validate(&b); 931 932 skb_put(buf, TLV_SPACE(str_len)); 933 TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len); 934 935 return buf; 936 } 937 938 int tipc_nametbl_init(void) 939 { 940 table.types = kcalloc(tipc_nametbl_size, sizeof(struct hlist_head), 941 GFP_ATOMIC); 942 if (!table.types) 943 return -ENOMEM; 944 945 table.local_publ_count = 0; 946 return 0; 947 } 948 949 void tipc_nametbl_stop(void) 950 { 951 u32 i; 952 953 if (!table.types) 954 return; 955 956 /* Verify name table is empty, then release it */ 957 958 write_lock_bh(&tipc_nametbl_lock); 959 for (i = 0; i < tipc_nametbl_size; i++) { 960 if (!hlist_empty(&table.types[i])) 961 err("tipc_nametbl_stop(): hash chain %u is non-null\n", i); 962 } 963 kfree(table.types); 964 table.types = NULL; 965 write_unlock_bh(&tipc_nametbl_lock); 966 } 967 968