bcast.c revision 10745cd5990542447268f60078133df8b1ee960b
1/* 2 * net/tipc/bcast.c: TIPC broadcast code 3 * 4 * Copyright (c) 2004-2006, Ericsson AB 5 * Copyright (c) 2004, Intel Corporation. 6 * Copyright (c) 2005, 2010-2011, Wind River Systems 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 "core.h" 39#include "link.h" 40#include "port.h" 41#include "bcast.h" 42#include "name_distr.h" 43 44#define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */ 45 46#define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */ 47 48/** 49 * struct bcbearer_pair - a pair of bearers used by broadcast link 50 * @primary: pointer to primary bearer 51 * @secondary: pointer to secondary bearer 52 * 53 * Bearers must have same priority and same set of reachable destinations 54 * to be paired. 55 */ 56 57struct bcbearer_pair { 58 struct tipc_bearer *primary; 59 struct tipc_bearer *secondary; 60}; 61 62/** 63 * struct bcbearer - bearer used by broadcast link 64 * @bearer: (non-standard) broadcast bearer structure 65 * @media: (non-standard) broadcast media structure 66 * @bpairs: array of bearer pairs 67 * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort() 68 * @remains: temporary node map used by tipc_bcbearer_send() 69 * @remains_new: temporary node map used tipc_bcbearer_send() 70 * 71 * Note: The fields labelled "temporary" are incorporated into the bearer 72 * to avoid consuming potentially limited stack space through the use of 73 * large local variables within multicast routines. Concurrent access is 74 * prevented through use of the spinlock "bc_lock". 75 */ 76 77struct bcbearer { 78 struct tipc_bearer bearer; 79 struct media media; 80 struct bcbearer_pair bpairs[MAX_BEARERS]; 81 struct bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1]; 82 struct tipc_node_map remains; 83 struct tipc_node_map remains_new; 84}; 85 86/** 87 * struct bclink - link used for broadcast messages 88 * @link: (non-standard) broadcast link structure 89 * @node: (non-standard) node structure representing b'cast link's peer node 90 * @bcast_nodes: map of broadcast-capable nodes 91 * @retransmit_to: node that most recently requested a retransmit 92 * 93 * Handles sequence numbering, fragmentation, bundling, etc. 94 */ 95 96struct bclink { 97 struct link link; 98 struct tipc_node node; 99 struct tipc_node_map bcast_nodes; 100 struct tipc_node *retransmit_to; 101}; 102 103static struct bcbearer bcast_bearer; 104static struct bclink bcast_link; 105 106static struct bcbearer *bcbearer = &bcast_bearer; 107static struct bclink *bclink = &bcast_link; 108static struct link *bcl = &bcast_link.link; 109 110static DEFINE_SPINLOCK(bc_lock); 111 112const char tipc_bclink_name[] = "broadcast-link"; 113 114static void tipc_nmap_diff(struct tipc_node_map *nm_a, 115 struct tipc_node_map *nm_b, 116 struct tipc_node_map *nm_diff); 117 118static u32 buf_seqno(struct sk_buff *buf) 119{ 120 return msg_seqno(buf_msg(buf)); 121} 122 123static u32 bcbuf_acks(struct sk_buff *buf) 124{ 125 return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle; 126} 127 128static void bcbuf_set_acks(struct sk_buff *buf, u32 acks) 129{ 130 TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks; 131} 132 133static void bcbuf_decr_acks(struct sk_buff *buf) 134{ 135 bcbuf_set_acks(buf, bcbuf_acks(buf) - 1); 136} 137 138void tipc_bclink_add_node(u32 addr) 139{ 140 spin_lock_bh(&bc_lock); 141 tipc_nmap_add(&bclink->bcast_nodes, addr); 142 spin_unlock_bh(&bc_lock); 143} 144 145void tipc_bclink_remove_node(u32 addr) 146{ 147 spin_lock_bh(&bc_lock); 148 tipc_nmap_remove(&bclink->bcast_nodes, addr); 149 spin_unlock_bh(&bc_lock); 150} 151 152static void bclink_set_last_sent(void) 153{ 154 if (bcl->next_out) 155 bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1); 156 else 157 bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1); 158} 159 160u32 tipc_bclink_get_last_sent(void) 161{ 162 return bcl->fsm_msg_cnt; 163} 164 165/** 166 * bclink_set_gap - set gap according to contents of current deferred pkt queue 167 * 168 * Called with 'node' locked, bc_lock unlocked 169 */ 170 171static void bclink_set_gap(struct tipc_node *n_ptr) 172{ 173 struct sk_buff *buf = n_ptr->bclink.deferred_head; 174 175 n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 176 mod(n_ptr->bclink.last_in); 177 if (unlikely(buf != NULL)) 178 n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1); 179} 180 181/** 182 * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment 183 * 184 * This mechanism endeavours to prevent all nodes in network from trying 185 * to ACK or NACK at the same time. 186 * 187 * Note: TIPC uses a different trigger to distribute ACKs than it does to 188 * distribute NACKs, but tries to use the same spacing (divide by 16). 189 */ 190 191static int bclink_ack_allowed(u32 n) 192{ 193 return (n % TIPC_MIN_LINK_WIN) == tipc_own_tag; 194} 195 196 197/** 198 * tipc_bclink_retransmit_to - get most recent node to request retransmission 199 * 200 * Called with bc_lock locked 201 */ 202 203struct tipc_node *tipc_bclink_retransmit_to(void) 204{ 205 return bclink->retransmit_to; 206} 207 208/** 209 * bclink_retransmit_pkt - retransmit broadcast packets 210 * @after: sequence number of last packet to *not* retransmit 211 * @to: sequence number of last packet to retransmit 212 * 213 * Called with bc_lock locked 214 */ 215 216static void bclink_retransmit_pkt(u32 after, u32 to) 217{ 218 struct sk_buff *buf; 219 220 buf = bcl->first_out; 221 while (buf && less_eq(buf_seqno(buf), after)) 222 buf = buf->next; 223 tipc_link_retransmit(bcl, buf, mod(to - after)); 224} 225 226/** 227 * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets 228 * @n_ptr: node that sent acknowledgement info 229 * @acked: broadcast sequence # that has been acknowledged 230 * 231 * Node is locked, bc_lock unlocked. 232 */ 233 234void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked) 235{ 236 struct sk_buff *crs; 237 struct sk_buff *next; 238 unsigned int released = 0; 239 240 if (less_eq(acked, n_ptr->bclink.acked)) 241 return; 242 243 spin_lock_bh(&bc_lock); 244 245 /* Skip over packets that node has previously acknowledged */ 246 247 crs = bcl->first_out; 248 while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) 249 crs = crs->next; 250 251 /* Update packets that node is now acknowledging */ 252 253 while (crs && less_eq(buf_seqno(crs), acked)) { 254 next = crs->next; 255 256 if (crs != bcl->next_out) 257 bcbuf_decr_acks(crs); 258 else if (bclink->bcast_nodes.count) 259 break; 260 else { 261 bcbuf_set_acks(crs, 0); 262 bcl->next_out = next; 263 bclink_set_last_sent(); 264 } 265 266 if (bcbuf_acks(crs) == 0) { 267 bcl->first_out = next; 268 bcl->out_queue_size--; 269 buf_discard(crs); 270 released = 1; 271 } 272 crs = next; 273 } 274 n_ptr->bclink.acked = acked; 275 276 /* Try resolving broadcast link congestion, if necessary */ 277 278 if (unlikely(bcl->next_out)) { 279 tipc_link_push_queue(bcl); 280 bclink_set_last_sent(); 281 } 282 if (unlikely(released && !list_empty(&bcl->waiting_ports))) 283 tipc_link_wakeup_ports(bcl, 0); 284 spin_unlock_bh(&bc_lock); 285} 286 287/** 288 * bclink_send_ack - unicast an ACK msg 289 * 290 * tipc_net_lock and node lock set 291 */ 292 293static void bclink_send_ack(struct tipc_node *n_ptr) 294{ 295 struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1]; 296 297 if (l_ptr != NULL) 298 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0); 299} 300 301/** 302 * bclink_send_nack- broadcast a NACK msg 303 * 304 * tipc_net_lock and node lock set 305 */ 306 307static void bclink_send_nack(struct tipc_node *n_ptr) 308{ 309 struct sk_buff *buf; 310 struct tipc_msg *msg; 311 312 if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to)) 313 return; 314 315 buf = tipc_buf_acquire(INT_H_SIZE); 316 if (buf) { 317 msg = buf_msg(buf); 318 tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG, 319 INT_H_SIZE, n_ptr->addr); 320 msg_set_non_seq(msg, 1); 321 msg_set_mc_netid(msg, tipc_net_id); 322 msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in)); 323 msg_set_bcgap_after(msg, n_ptr->bclink.gap_after); 324 msg_set_bcgap_to(msg, n_ptr->bclink.gap_to); 325 msg_set_bcast_tag(msg, tipc_own_tag); 326 327 tipc_bearer_send(&bcbearer->bearer, buf, NULL); 328 bcl->stats.sent_nacks++; 329 buf_discard(buf); 330 331 /* 332 * Ensure we doesn't send another NACK msg to the node 333 * until 16 more deferred messages arrive from it 334 * (i.e. helps prevent all nodes from NACK'ing at same time) 335 */ 336 337 n_ptr->bclink.nack_sync = tipc_own_tag; 338 } 339} 340 341/** 342 * tipc_bclink_check_gap - send a NACK if a sequence gap exists 343 * 344 * tipc_net_lock and node lock set 345 */ 346 347void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 last_sent) 348{ 349 if (!n_ptr->bclink.supported || 350 less_eq(last_sent, mod(n_ptr->bclink.last_in))) 351 return; 352 353 bclink_set_gap(n_ptr); 354 if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to) 355 n_ptr->bclink.gap_to = last_sent; 356 bclink_send_nack(n_ptr); 357} 358 359/** 360 * tipc_bclink_peek_nack - process a NACK msg meant for another node 361 * 362 * Only tipc_net_lock set. 363 */ 364 365static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to) 366{ 367 struct tipc_node *n_ptr = tipc_node_find(dest); 368 u32 my_after, my_to; 369 370 if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr))) 371 return; 372 tipc_node_lock(n_ptr); 373 /* 374 * Modify gap to suppress unnecessary NACKs from this node 375 */ 376 my_after = n_ptr->bclink.gap_after; 377 my_to = n_ptr->bclink.gap_to; 378 379 if (less_eq(gap_after, my_after)) { 380 if (less(my_after, gap_to) && less(gap_to, my_to)) 381 n_ptr->bclink.gap_after = gap_to; 382 else if (less_eq(my_to, gap_to)) 383 n_ptr->bclink.gap_to = n_ptr->bclink.gap_after; 384 } else if (less_eq(gap_after, my_to)) { 385 if (less_eq(my_to, gap_to)) 386 n_ptr->bclink.gap_to = gap_after; 387 } else { 388 /* 389 * Expand gap if missing bufs not in deferred queue: 390 */ 391 struct sk_buff *buf = n_ptr->bclink.deferred_head; 392 u32 prev = n_ptr->bclink.gap_to; 393 394 for (; buf; buf = buf->next) { 395 u32 seqno = buf_seqno(buf); 396 397 if (mod(seqno - prev) != 1) { 398 buf = NULL; 399 break; 400 } 401 if (seqno == gap_after) 402 break; 403 prev = seqno; 404 } 405 if (buf == NULL) 406 n_ptr->bclink.gap_to = gap_after; 407 } 408 /* 409 * Some nodes may send a complementary NACK now: 410 */ 411 if (bclink_ack_allowed(sender_tag + 1)) { 412 if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) { 413 bclink_send_nack(n_ptr); 414 bclink_set_gap(n_ptr); 415 } 416 } 417 tipc_node_unlock(n_ptr); 418} 419 420/** 421 * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster 422 */ 423 424int tipc_bclink_send_msg(struct sk_buff *buf) 425{ 426 int res; 427 428 spin_lock_bh(&bc_lock); 429 430 if (!bclink->bcast_nodes.count) { 431 res = msg_data_sz(buf_msg(buf)); 432 buf_discard(buf); 433 goto exit; 434 } 435 436 res = tipc_link_send_buf(bcl, buf); 437 if (likely(res >= 0)) { 438 bclink_set_last_sent(); 439 bcl->stats.queue_sz_counts++; 440 bcl->stats.accu_queue_sz += bcl->out_queue_size; 441 } 442exit: 443 spin_unlock_bh(&bc_lock); 444 return res; 445} 446 447/** 448 * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards 449 * 450 * tipc_net_lock is read_locked, no other locks set 451 */ 452 453void tipc_bclink_recv_pkt(struct sk_buff *buf) 454{ 455 struct tipc_msg *msg = buf_msg(buf); 456 struct tipc_node *node; 457 u32 next_in; 458 u32 seqno; 459 struct sk_buff *deferred; 460 461 /* Screen out unwanted broadcast messages */ 462 463 if (msg_mc_netid(msg) != tipc_net_id) 464 goto exit; 465 466 node = tipc_node_find(msg_prevnode(msg)); 467 if (unlikely(!node)) 468 goto exit; 469 470 tipc_node_lock(node); 471 if (unlikely(!node->bclink.supported)) 472 goto unlock; 473 474 if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { 475 if (msg_type(msg) != STATE_MSG) 476 goto unlock; 477 if (msg_destnode(msg) == tipc_own_addr) { 478 tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); 479 tipc_node_unlock(node); 480 spin_lock_bh(&bc_lock); 481 bcl->stats.recv_nacks++; 482 bclink->retransmit_to = node; 483 bclink_retransmit_pkt(msg_bcgap_after(msg), 484 msg_bcgap_to(msg)); 485 spin_unlock_bh(&bc_lock); 486 } else { 487 tipc_node_unlock(node); 488 tipc_bclink_peek_nack(msg_destnode(msg), 489 msg_bcast_tag(msg), 490 msg_bcgap_after(msg), 491 msg_bcgap_to(msg)); 492 } 493 goto exit; 494 } 495 496 /* Handle in-sequence broadcast message */ 497 498receive: 499 next_in = mod(node->bclink.last_in + 1); 500 seqno = msg_seqno(msg); 501 502 if (likely(seqno == next_in)) { 503 bcl->stats.recv_info++; 504 node->bclink.last_in++; 505 bclink_set_gap(node); 506 if (unlikely(bclink_ack_allowed(seqno))) { 507 bclink_send_ack(node); 508 bcl->stats.sent_acks++; 509 } 510 if (likely(msg_isdata(msg))) { 511 tipc_node_unlock(node); 512 if (likely(msg_mcast(msg))) 513 tipc_port_recv_mcast(buf, NULL); 514 else 515 buf_discard(buf); 516 } else if (msg_user(msg) == MSG_BUNDLER) { 517 bcl->stats.recv_bundles++; 518 bcl->stats.recv_bundled += msg_msgcnt(msg); 519 tipc_node_unlock(node); 520 tipc_link_recv_bundle(buf); 521 } else if (msg_user(msg) == MSG_FRAGMENTER) { 522 bcl->stats.recv_fragments++; 523 if (tipc_link_recv_fragment(&node->bclink.defragm, 524 &buf, &msg)) 525 bcl->stats.recv_fragmented++; 526 tipc_node_unlock(node); 527 tipc_net_route_msg(buf); 528 } else if (msg_user(msg) == NAME_DISTRIBUTOR) { 529 tipc_node_unlock(node); 530 tipc_named_recv(buf); 531 } else { 532 tipc_node_unlock(node); 533 buf_discard(buf); 534 } 535 buf = NULL; 536 tipc_node_lock(node); 537 deferred = node->bclink.deferred_head; 538 if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) { 539 buf = deferred; 540 msg = buf_msg(buf); 541 node->bclink.deferred_head = deferred->next; 542 goto receive; 543 } 544 } else if (less(next_in, seqno)) { 545 u32 gap_after = node->bclink.gap_after; 546 u32 gap_to = node->bclink.gap_to; 547 548 if (tipc_link_defer_pkt(&node->bclink.deferred_head, 549 &node->bclink.deferred_tail, 550 buf)) { 551 node->bclink.nack_sync++; 552 bcl->stats.deferred_recv++; 553 if (seqno == mod(gap_after + 1)) 554 node->bclink.gap_after = seqno; 555 else if (less(gap_after, seqno) && less(seqno, gap_to)) 556 node->bclink.gap_to = seqno; 557 } 558 buf = NULL; 559 if (bclink_ack_allowed(node->bclink.nack_sync)) { 560 if (gap_to != gap_after) 561 bclink_send_nack(node); 562 bclink_set_gap(node); 563 } 564 } else { 565 bcl->stats.duplicates++; 566 } 567unlock: 568 tipc_node_unlock(node); 569exit: 570 buf_discard(buf); 571} 572 573u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) 574{ 575 return (n_ptr->bclink.supported && 576 (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); 577} 578 579 580/** 581 * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer 582 * 583 * Send packet over as many bearers as necessary to reach all nodes 584 * that have joined the broadcast link. 585 * 586 * Returns 0 (packet sent successfully) under all circumstances, 587 * since the broadcast link's pseudo-bearer never blocks 588 */ 589 590static int tipc_bcbearer_send(struct sk_buff *buf, 591 struct tipc_bearer *unused1, 592 struct tipc_media_addr *unused2) 593{ 594 int bp_index; 595 596 /* 597 * Prepare broadcast link message for reliable transmission, 598 * if first time trying to send it; 599 * preparation is skipped for broadcast link protocol messages 600 * since they are sent in an unreliable manner and don't need it 601 */ 602 603 if (likely(!msg_non_seq(buf_msg(buf)))) { 604 struct tipc_msg *msg; 605 606 bcbuf_set_acks(buf, bclink->bcast_nodes.count); 607 msg = buf_msg(buf); 608 msg_set_non_seq(msg, 1); 609 msg_set_mc_netid(msg, tipc_net_id); 610 bcl->stats.sent_info++; 611 612 if (WARN_ON(!bclink->bcast_nodes.count)) { 613 dump_stack(); 614 return 0; 615 } 616 } 617 618 /* Send buffer over bearers until all targets reached */ 619 620 bcbearer->remains = bclink->bcast_nodes; 621 622 for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { 623 struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary; 624 struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary; 625 626 if (!p) 627 break; /* no more bearers to try */ 628 629 tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new); 630 if (bcbearer->remains_new.count == bcbearer->remains.count) 631 continue; /* bearer pair doesn't add anything */ 632 633 if (p->blocked || 634 p->media->send_msg(buf, p, &p->media->bcast_addr)) { 635 /* unable to send on primary bearer */ 636 if (!s || s->blocked || 637 s->media->send_msg(buf, s, 638 &s->media->bcast_addr)) { 639 /* unable to send on either bearer */ 640 continue; 641 } 642 } 643 644 if (s) { 645 bcbearer->bpairs[bp_index].primary = s; 646 bcbearer->bpairs[bp_index].secondary = p; 647 } 648 649 if (bcbearer->remains_new.count == 0) 650 break; /* all targets reached */ 651 652 bcbearer->remains = bcbearer->remains_new; 653 } 654 655 return 0; 656} 657 658/** 659 * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer 660 */ 661 662void tipc_bcbearer_sort(void) 663{ 664 struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp; 665 struct bcbearer_pair *bp_curr; 666 int b_index; 667 int pri; 668 669 spin_lock_bh(&bc_lock); 670 671 /* Group bearers by priority (can assume max of two per priority) */ 672 673 memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); 674 675 for (b_index = 0; b_index < MAX_BEARERS; b_index++) { 676 struct tipc_bearer *b = &tipc_bearers[b_index]; 677 678 if (!b->active || !b->nodes.count) 679 continue; 680 681 if (!bp_temp[b->priority].primary) 682 bp_temp[b->priority].primary = b; 683 else 684 bp_temp[b->priority].secondary = b; 685 } 686 687 /* Create array of bearer pairs for broadcasting */ 688 689 bp_curr = bcbearer->bpairs; 690 memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); 691 692 for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { 693 694 if (!bp_temp[pri].primary) 695 continue; 696 697 bp_curr->primary = bp_temp[pri].primary; 698 699 if (bp_temp[pri].secondary) { 700 if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, 701 &bp_temp[pri].secondary->nodes)) { 702 bp_curr->secondary = bp_temp[pri].secondary; 703 } else { 704 bp_curr++; 705 bp_curr->primary = bp_temp[pri].secondary; 706 } 707 } 708 709 bp_curr++; 710 } 711 712 spin_unlock_bh(&bc_lock); 713} 714 715 716int tipc_bclink_stats(char *buf, const u32 buf_size) 717{ 718 struct print_buf pb; 719 720 if (!bcl) 721 return 0; 722 723 tipc_printbuf_init(&pb, buf, buf_size); 724 725 spin_lock_bh(&bc_lock); 726 727 tipc_printf(&pb, "Link <%s>\n" 728 " Window:%u packets\n", 729 bcl->name, bcl->queue_limit[0]); 730 tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n", 731 bcl->stats.recv_info, 732 bcl->stats.recv_fragments, 733 bcl->stats.recv_fragmented, 734 bcl->stats.recv_bundles, 735 bcl->stats.recv_bundled); 736 tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n", 737 bcl->stats.sent_info, 738 bcl->stats.sent_fragments, 739 bcl->stats.sent_fragmented, 740 bcl->stats.sent_bundles, 741 bcl->stats.sent_bundled); 742 tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n", 743 bcl->stats.recv_nacks, 744 bcl->stats.deferred_recv, 745 bcl->stats.duplicates); 746 tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n", 747 bcl->stats.sent_nacks, 748 bcl->stats.sent_acks, 749 bcl->stats.retransmitted); 750 tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n", 751 bcl->stats.bearer_congs, 752 bcl->stats.link_congs, 753 bcl->stats.max_queue_sz, 754 bcl->stats.queue_sz_counts 755 ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts) 756 : 0); 757 758 spin_unlock_bh(&bc_lock); 759 return tipc_printbuf_validate(&pb); 760} 761 762int tipc_bclink_reset_stats(void) 763{ 764 if (!bcl) 765 return -ENOPROTOOPT; 766 767 spin_lock_bh(&bc_lock); 768 memset(&bcl->stats, 0, sizeof(bcl->stats)); 769 spin_unlock_bh(&bc_lock); 770 return 0; 771} 772 773int tipc_bclink_set_queue_limits(u32 limit) 774{ 775 if (!bcl) 776 return -ENOPROTOOPT; 777 if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) 778 return -EINVAL; 779 780 spin_lock_bh(&bc_lock); 781 tipc_link_set_queue_limits(bcl, limit); 782 spin_unlock_bh(&bc_lock); 783 return 0; 784} 785 786void tipc_bclink_init(void) 787{ 788 INIT_LIST_HEAD(&bcbearer->bearer.cong_links); 789 bcbearer->bearer.media = &bcbearer->media; 790 bcbearer->media.send_msg = tipc_bcbearer_send; 791 sprintf(bcbearer->media.name, "tipc-broadcast"); 792 793 INIT_LIST_HEAD(&bcl->waiting_ports); 794 bcl->next_out_no = 1; 795 spin_lock_init(&bclink->node.lock); 796 bcl->owner = &bclink->node; 797 bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; 798 tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); 799 bcl->b_ptr = &bcbearer->bearer; 800 bcl->state = WORKING_WORKING; 801 strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME); 802} 803 804void tipc_bclink_stop(void) 805{ 806 spin_lock_bh(&bc_lock); 807 tipc_link_stop(bcl); 808 spin_unlock_bh(&bc_lock); 809 810 memset(bclink, 0, sizeof(*bclink)); 811 memset(bcbearer, 0, sizeof(*bcbearer)); 812} 813 814 815/** 816 * tipc_nmap_add - add a node to a node map 817 */ 818 819void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node) 820{ 821 int n = tipc_node(node); 822 int w = n / WSIZE; 823 u32 mask = (1 << (n % WSIZE)); 824 825 if ((nm_ptr->map[w] & mask) == 0) { 826 nm_ptr->count++; 827 nm_ptr->map[w] |= mask; 828 } 829} 830 831/** 832 * tipc_nmap_remove - remove a node from a node map 833 */ 834 835void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node) 836{ 837 int n = tipc_node(node); 838 int w = n / WSIZE; 839 u32 mask = (1 << (n % WSIZE)); 840 841 if ((nm_ptr->map[w] & mask) != 0) { 842 nm_ptr->map[w] &= ~mask; 843 nm_ptr->count--; 844 } 845} 846 847/** 848 * tipc_nmap_diff - find differences between node maps 849 * @nm_a: input node map A 850 * @nm_b: input node map B 851 * @nm_diff: output node map A-B (i.e. nodes of A that are not in B) 852 */ 853 854static void tipc_nmap_diff(struct tipc_node_map *nm_a, 855 struct tipc_node_map *nm_b, 856 struct tipc_node_map *nm_diff) 857{ 858 int stop = ARRAY_SIZE(nm_a->map); 859 int w; 860 int b; 861 u32 map; 862 863 memset(nm_diff, 0, sizeof(*nm_diff)); 864 for (w = 0; w < stop; w++) { 865 map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]); 866 nm_diff->map[w] = map; 867 if (map != 0) { 868 for (b = 0 ; b < WSIZE; b++) { 869 if (map & (1 << b)) 870 nm_diff->count++; 871 } 872 } 873 } 874} 875 876/** 877 * tipc_port_list_add - add a port to a port list, ensuring no duplicates 878 */ 879 880void tipc_port_list_add(struct port_list *pl_ptr, u32 port) 881{ 882 struct port_list *item = pl_ptr; 883 int i; 884 int item_sz = PLSIZE; 885 int cnt = pl_ptr->count; 886 887 for (; ; cnt -= item_sz, item = item->next) { 888 if (cnt < PLSIZE) 889 item_sz = cnt; 890 for (i = 0; i < item_sz; i++) 891 if (item->ports[i] == port) 892 return; 893 if (i < PLSIZE) { 894 item->ports[i] = port; 895 pl_ptr->count++; 896 return; 897 } 898 if (!item->next) { 899 item->next = kmalloc(sizeof(*item), GFP_ATOMIC); 900 if (!item->next) { 901 warn("Incomplete multicast delivery, no memory\n"); 902 return; 903 } 904 item->next->next = NULL; 905 } 906 } 907} 908 909/** 910 * tipc_port_list_free - free dynamically created entries in port_list chain 911 * 912 */ 913 914void tipc_port_list_free(struct port_list *pl_ptr) 915{ 916 struct port_list *item; 917 struct port_list *next; 918 919 for (item = pl_ptr->next; item; item = next) { 920 next = item->next; 921 kfree(item); 922 } 923} 924 925