net/tipc/bcast.c

   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
  57 struct 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
  77 struct 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
  96 struct 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
 103 static struct bcbearer bcast_bearer;
 104 static struct bclink bcast_link;
 105
 106 static struct bcbearer *bcbearer = &bcast_bearer;
 107 static struct bclink *bclink = &bcast_link;
 108 static struct link *bcl = &bcast_link.link;
 109
 110 static DEFINE_SPINLOCK(bc_lock);
 111
 112 const char tipc_bclink_name[] = "broadcast-link";
 113
 114 static 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
 118 static u32 buf_seqno(struct sk_buff *buf)
 119 {
 120         return msg_seqno(buf_msg(buf));
 121 }
 122
 123 static u32 bcbuf_acks(struct sk_buff *buf)
 124 {
 125         return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle;
 126 }
 127
 128 static void bcbuf_set_acks(struct sk_buff *buf, u32 acks)
 129 {
 130         TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks;
 131 }
 132
 133 static void bcbuf_decr_acks(struct sk_buff *buf)
 134 {
 135         bcbuf_set_acks(buf, bcbuf_acks(buf) - 1);
 136 }
 137
 138 void 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
 145 void 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
 152 static 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
 160 u32 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
 171 static 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
 191 static 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
 203 struct 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
 216 static 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
 234 void 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                 bcbuf_decr_acks(crs);
 256                 if (bcbuf_acks(crs) == 0) {
 257                         bcl->first_out = next;
 258                         bcl->out_queue_size--;
 259                         buf_discard(crs);
 260                         released = 1;
 261                 }
 262                 crs = next;
 263         }
 264         n_ptr->bclink.acked = acked;
 265
 266         /* Try resolving broadcast link congestion, if necessary */
 267
 268         if (unlikely(bcl->next_out)) {
 269                 tipc_link_push_queue(bcl);
 270                 bclink_set_last_sent();
 271         }
 272         if (unlikely(released && !list_empty(&bcl->waiting_ports)))
 273                 tipc_link_wakeup_ports(bcl, 0);
 274         spin_unlock_bh(&bc_lock);
 275 }
 276
 277 /**
 278  * bclink_send_ack - unicast an ACK msg
 279  *
 280  * tipc_net_lock and node lock set
 281  */
 282
 283 static void bclink_send_ack(struct tipc_node *n_ptr)
 284 {
 285         struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1];
 286
 287         if (l_ptr != NULL)
 288                 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0);
 289 }
 290
 291 /**
 292  * bclink_send_nack- broadcast a NACK msg
 293  *
 294  * tipc_net_lock and node lock set
 295  */
 296
 297 static void bclink_send_nack(struct tipc_node *n_ptr)
 298 {
 299         struct sk_buff *buf;
 300         struct tipc_msg *msg;
 301
 302         if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to))
 303                 return;
 304
 305         buf = tipc_buf_acquire(INT_H_SIZE);
 306         if (buf) {
 307                 msg = buf_msg(buf);
 308                 tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG,
 309                          INT_H_SIZE, n_ptr->addr);
 310                 msg_set_non_seq(msg, 1);
 311                 msg_set_mc_netid(msg, tipc_net_id);
 312                 msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in));
 313                 msg_set_bcgap_after(msg, n_ptr->bclink.gap_after);
 314                 msg_set_bcgap_to(msg, n_ptr->bclink.gap_to);
 315                 msg_set_bcast_tag(msg, tipc_own_tag);
 316
 317                 tipc_bearer_send(&bcbearer->bearer, buf, NULL);
 318                 bcl->stats.sent_nacks++;
 319                 buf_discard(buf);
 320
 321                 /*
 322                  * Ensure we doesn't send another NACK msg to the node
 323                  * until 16 more deferred messages arrive from it
 324                  * (i.e. helps prevent all nodes from NACK'ing at same time)
 325                  */
 326
 327                 n_ptr->bclink.nack_sync = tipc_own_tag;
 328         }
 329 }
 330
 331 /**
 332  * tipc_bclink_check_gap - send a NACK if a sequence gap exists
 333  *
 334  * tipc_net_lock and node lock set
 335  */
 336
 337 void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 last_sent)
 338 {
 339         if (!n_ptr->bclink.supported ||
 340             less_eq(last_sent, mod(n_ptr->bclink.last_in)))
 341                 return;
 342
 343         bclink_set_gap(n_ptr);
 344         if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to)
 345                 n_ptr->bclink.gap_to = last_sent;
 346         bclink_send_nack(n_ptr);
 347 }
 348
 349 /**
 350  * tipc_bclink_peek_nack - process a NACK msg meant for another node
 351  *
 352  * Only tipc_net_lock set.
 353  */
 354
 355 static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to)
 356 {
 357         struct tipc_node *n_ptr = tipc_node_find(dest);
 358         u32 my_after, my_to;
 359
 360         if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr)))
 361                 return;
 362         tipc_node_lock(n_ptr);
 363         /*
 364          * Modify gap to suppress unnecessary NACKs from this node
 365          */
 366         my_after = n_ptr->bclink.gap_after;
 367         my_to = n_ptr->bclink.gap_to;
 368
 369         if (less_eq(gap_after, my_after)) {
 370                 if (less(my_after, gap_to) && less(gap_to, my_to))
 371                         n_ptr->bclink.gap_after = gap_to;
 372                 else if (less_eq(my_to, gap_to))
 373                         n_ptr->bclink.gap_to = n_ptr->bclink.gap_after;
 374         } else if (less_eq(gap_after, my_to)) {
 375                 if (less_eq(my_to, gap_to))
 376                         n_ptr->bclink.gap_to = gap_after;
 377         } else {
 378                 /*
 379                  * Expand gap if missing bufs not in deferred queue:
 380                  */
 381                 struct sk_buff *buf = n_ptr->bclink.deferred_head;
 382                 u32 prev = n_ptr->bclink.gap_to;
 383
 384                 for (; buf; buf = buf->next) {
 385                         u32 seqno = buf_seqno(buf);
 386
 387                         if (mod(seqno - prev) != 1) {
 388                                 buf = NULL;
 389                                 break;
 390                         }
 391                         if (seqno == gap_after)
 392                                 break;
 393                         prev = seqno;
 394                 }
 395                 if (buf == NULL)
 396                         n_ptr->bclink.gap_to = gap_after;
 397         }
 398         /*
 399          * Some nodes may send a complementary NACK now:
 400          */
 401         if (bclink_ack_allowed(sender_tag + 1)) {
 402                 if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) {
 403                         bclink_send_nack(n_ptr);
 404                         bclink_set_gap(n_ptr);
 405                 }
 406         }
 407         tipc_node_unlock(n_ptr);
 408 }
 409
 410 /**
 411  * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster
 412  */
 413
 414 int tipc_bclink_send_msg(struct sk_buff *buf)
 415 {
 416         int res;
 417
 418         spin_lock_bh(&bc_lock);
 419
 420         res = tipc_link_send_buf(bcl, buf);
 421         if (likely(res > 0))
 422                 bclink_set_last_sent();
 423
 424         bcl->stats.queue_sz_counts++;
 425         bcl->stats.accu_queue_sz += bcl->out_queue_size;
 426
 427         spin_unlock_bh(&bc_lock);
 428         return res;
 429 }
 430
 431 /**
 432  * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards
 433  *
 434  * tipc_net_lock is read_locked, no other locks set
 435  */
 436
 437 void tipc_bclink_recv_pkt(struct sk_buff *buf)
 438 {
 439         struct tipc_msg *msg = buf_msg(buf);
 440         struct tipc_node *node;
 441         u32 next_in;
 442         u32 seqno;
 443         struct sk_buff *deferred;
 444
 445         /* Screen out unwanted broadcast messages */
 446
 447         if (msg_mc_netid(msg) != tipc_net_id)
 448                 goto exit;
 449
 450         node = tipc_node_find(msg_prevnode(msg));
 451         if (unlikely(!node))
 452                 goto exit;
 453
 454         tipc_node_lock(node);
 455         if (unlikely(!node->bclink.supported))
 456                 goto unlock;
 457
 458         if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) {
 459                 if (msg_type(msg) != STATE_MSG)
 460                         goto unlock;
 461                 if (msg_destnode(msg) == tipc_own_addr) {
 462                         tipc_bclink_acknowledge(node, msg_bcast_ack(msg));
 463                         tipc_node_unlock(node);
 464                         spin_lock_bh(&bc_lock);
 465                         bcl->stats.recv_nacks++;
 466                         bclink->retransmit_to = node;
 467                         bclink_retransmit_pkt(msg_bcgap_after(msg),
 468                                               msg_bcgap_to(msg));
 469                         spin_unlock_bh(&bc_lock);
 470                 } else {
 471                         tipc_node_unlock(node);
 472                         tipc_bclink_peek_nack(msg_destnode(msg),
 473                                               msg_bcast_tag(msg),
 474                                               msg_bcgap_after(msg),
 475                                               msg_bcgap_to(msg));
 476                 }
 477                 goto exit;
 478         }
 479
 480         /* Handle in-sequence broadcast message */
 481
 482 receive:
 483         next_in = mod(node->bclink.last_in + 1);
 484         seqno = msg_seqno(msg);
 485
 486         if (likely(seqno == next_in)) {
 487                 bcl->stats.recv_info++;
 488                 node->bclink.last_in++;
 489                 bclink_set_gap(node);
 490                 if (unlikely(bclink_ack_allowed(seqno))) {
 491                         bclink_send_ack(node);
 492                         bcl->stats.sent_acks++;
 493                 }
 494                 if (likely(msg_isdata(msg))) {
 495                         tipc_node_unlock(node);
 496                         if (likely(msg_mcast(msg)))
 497                                 tipc_port_recv_mcast(buf, NULL);
 498                         else
 499                                 buf_discard(buf);
 500                 } else if (msg_user(msg) == MSG_BUNDLER) {
 501                         bcl->stats.recv_bundles++;
 502                         bcl->stats.recv_bundled += msg_msgcnt(msg);
 503                         tipc_node_unlock(node);
 504                         tipc_link_recv_bundle(buf);
 505                 } else if (msg_user(msg) == MSG_FRAGMENTER) {
 506                         bcl->stats.recv_fragments++;
 507                         if (tipc_link_recv_fragment(&node->bclink.defragm,
 508                                                     &buf, &msg))
 509                                 bcl->stats.recv_fragmented++;
 510                         tipc_node_unlock(node);
 511                         tipc_net_route_msg(buf);
 512                 } else if (msg_user(msg) == NAME_DISTRIBUTOR) {
 513                         tipc_node_unlock(node);
 514                         tipc_named_recv(buf);
 515                 } else {
 516                         tipc_node_unlock(node);
 517                         buf_discard(buf);
 518                 }
 519                 buf = NULL;
 520                 tipc_node_lock(node);
 521                 deferred = node->bclink.deferred_head;
 522                 if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) {
 523                         buf = deferred;
 524                         msg = buf_msg(buf);
 525                         node->bclink.deferred_head = deferred->next;
 526                         goto receive;
 527                 }
 528         } else if (less(next_in, seqno)) {
 529                 u32 gap_after = node->bclink.gap_after;
 530                 u32 gap_to = node->bclink.gap_to;
 531
 532                 if (tipc_link_defer_pkt(&node->bclink.deferred_head,
 533                                         &node->bclink.deferred_tail,
 534                                         buf)) {
 535                         node->bclink.nack_sync++;
 536                         bcl->stats.deferred_recv++;
 537                         if (seqno == mod(gap_after + 1))
 538                                 node->bclink.gap_after = seqno;
 539                         else if (less(gap_after, seqno) && less(seqno, gap_to))
 540                                 node->bclink.gap_to = seqno;
 541                 }
 542                 buf = NULL;
 543                 if (bclink_ack_allowed(node->bclink.nack_sync)) {
 544                         if (gap_to != gap_after)
 545                                 bclink_send_nack(node);
 546                         bclink_set_gap(node);
 547                 }
 548         } else {
 549                 bcl->stats.duplicates++;
 550         }
 551 unlock:
 552         tipc_node_unlock(node);
 553 exit:
 554         buf_discard(buf);
 555 }
 556
 557 u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr)
 558 {
 559         return (n_ptr->bclink.supported &&
 560                 (tipc_bclink_get_last_sent() != n_ptr->bclink.acked));
 561 }
 562
 563
 564 /**
 565  * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer
 566  *
 567  * Send packet over as many bearers as necessary to reach all nodes
 568  * that have joined the broadcast link.
 569  *
 570  * Returns 0 (packet sent successfully) under all circumstances,
 571  * since the broadcast link's pseudo-bearer never blocks
 572  */
 573
 574 static int tipc_bcbearer_send(struct sk_buff *buf,
 575                               struct tipc_bearer *unused1,
 576                               struct tipc_media_addr *unused2)
 577 {
 578         int bp_index;
 579
 580         /*
 581          * Prepare broadcast link message for reliable transmission,
 582          * if first time trying to send it;
 583          * preparation is skipped for broadcast link protocol messages
 584          * since they are sent in an unreliable manner and don't need it
 585          */
 586
 587         if (likely(!msg_non_seq(buf_msg(buf)))) {
 588                 struct tipc_msg *msg;
 589
 590                 bcbuf_set_acks(buf, bclink->bcast_nodes.count);
 591                 msg = buf_msg(buf);
 592                 msg_set_non_seq(msg, 1);
 593                 msg_set_mc_netid(msg, tipc_net_id);
 594                 bcl->stats.sent_info++;
 595
 596                 if (WARN_ON(!bclink->bcast_nodes.count)) {
 597                         dump_stack();
 598                         return 0;
 599                 }
 600         }
 601
 602         /* Send buffer over bearers until all targets reached */
 603
 604         bcbearer->remains = bclink->bcast_nodes;
 605
 606         for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) {
 607                 struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary;
 608                 struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary;
 609
 610                 if (!p)
 611                         break;  /* no more bearers to try */
 612
 613                 tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new);
 614                 if (bcbearer->remains_new.count == bcbearer->remains.count)
 615                         continue;       /* bearer pair doesn't add anything */
 616
 617                 if (p->blocked ||
 618                     p->media->send_msg(buf, p, &p->media->bcast_addr)) {
 619                         /* unable to send on primary bearer */
 620                         if (!s || s->blocked ||
 621                             s->media->send_msg(buf, s,
 622                                                &s->media->bcast_addr)) {
 623                                 /* unable to send on either bearer */
 624                                 continue;
 625                         }
 626                 }
 627
 628                 if (s) {
 629                         bcbearer->bpairs[bp_index].primary = s;
 630                         bcbearer->bpairs[bp_index].secondary = p;
 631                 }
 632
 633                 if (bcbearer->remains_new.count == 0)
 634                         break;  /* all targets reached */
 635
 636                 bcbearer->remains = bcbearer->remains_new;
 637         }
 638
 639         return 0;
 640 }
 641
 642 /**
 643  * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer
 644  */
 645
 646 void tipc_bcbearer_sort(void)
 647 {
 648         struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp;
 649         struct bcbearer_pair *bp_curr;
 650         int b_index;
 651         int pri;
 652
 653         spin_lock_bh(&bc_lock);
 654
 655         /* Group bearers by priority (can assume max of two per priority) */
 656
 657         memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp));
 658
 659         for (b_index = 0; b_index < MAX_BEARERS; b_index++) {
 660                 struct tipc_bearer *b = &tipc_bearers[b_index];
 661
 662                 if (!b->active || !b->nodes.count)
 663                         continue;
 664
 665                 if (!bp_temp[b->priority].primary)
 666                         bp_temp[b->priority].primary = b;
 667                 else
 668                         bp_temp[b->priority].secondary = b;
 669         }
 670
 671         /* Create array of bearer pairs for broadcasting */
 672
 673         bp_curr = bcbearer->bpairs;
 674         memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs));
 675
 676         for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) {
 677
 678                 if (!bp_temp[pri].primary)
 679                         continue;
 680
 681                 bp_curr->primary = bp_temp[pri].primary;
 682
 683                 if (bp_temp[pri].secondary) {
 684                         if (tipc_nmap_equal(&bp_temp[pri].primary->nodes,
 685                                             &bp_temp[pri].secondary->nodes)) {
 686                                 bp_curr->secondary = bp_temp[pri].secondary;
 687                         } else {
 688                                 bp_curr++;
 689                                 bp_curr->primary = bp_temp[pri].secondary;
 690                         }
 691                 }
 692
 693                 bp_curr++;
 694         }
 695
 696         spin_unlock_bh(&bc_lock);
 697 }
 698
 699
 700 int tipc_bclink_stats(char *buf, const u32 buf_size)
 701 {
 702         struct print_buf pb;
 703
 704         if (!bcl)
 705                 return 0;
 706
 707         tipc_printbuf_init(&pb, buf, buf_size);
 708
 709         spin_lock_bh(&bc_lock);
 710
 711         tipc_printf(&pb, "Link <%s>\n"
 712                          "  Window:%u packets\n",
 713                     bcl->name, bcl->queue_limit[0]);
 714         tipc_printf(&pb, "  RX packets:%u fragments:%u/%u bundles:%u/%u\n",
 715                     bcl->stats.recv_info,
 716                     bcl->stats.recv_fragments,
 717                     bcl->stats.recv_fragmented,
 718                     bcl->stats.recv_bundles,
 719                     bcl->stats.recv_bundled);
 720         tipc_printf(&pb, "  TX packets:%u fragments:%u/%u bundles:%u/%u\n",
 721                     bcl->stats.sent_info,
 722                     bcl->stats.sent_fragments,
 723                     bcl->stats.sent_fragmented,
 724                     bcl->stats.sent_bundles,
 725                     bcl->stats.sent_bundled);
 726         tipc_printf(&pb, "  RX naks:%u defs:%u dups:%u\n",
 727                     bcl->stats.recv_nacks,
 728                     bcl->stats.deferred_recv,
 729                     bcl->stats.duplicates);
 730         tipc_printf(&pb, "  TX naks:%u acks:%u dups:%u\n",
 731                     bcl->stats.sent_nacks,
 732                     bcl->stats.sent_acks,
 733                     bcl->stats.retransmitted);
 734         tipc_printf(&pb, "  Congestion bearer:%u link:%u  Send queue max:%u avg:%u\n",
 735                     bcl->stats.bearer_congs,
 736                     bcl->stats.link_congs,
 737                     bcl->stats.max_queue_sz,
 738                     bcl->stats.queue_sz_counts
 739                     ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts)
 740                     : 0);
 741
 742         spin_unlock_bh(&bc_lock);
 743         return tipc_printbuf_validate(&pb);
 744 }
 745
 746 int tipc_bclink_reset_stats(void)
 747 {
 748         if (!bcl)
 749                 return -ENOPROTOOPT;
 750
 751         spin_lock_bh(&bc_lock);
 752         memset(&bcl->stats, 0, sizeof(bcl->stats));
 753         spin_unlock_bh(&bc_lock);
 754         return 0;
 755 }
 756
 757 int tipc_bclink_set_queue_limits(u32 limit)
 758 {
 759         if (!bcl)
 760                 return -ENOPROTOOPT;
 761         if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN))
 762                 return -EINVAL;
 763
 764         spin_lock_bh(&bc_lock);
 765         tipc_link_set_queue_limits(bcl, limit);
 766         spin_unlock_bh(&bc_lock);
 767         return 0;
 768 }
 769
 770 void tipc_bclink_init(void)
 771 {
 772         INIT_LIST_HEAD(&bcbearer->bearer.cong_links);
 773         bcbearer->bearer.media = &bcbearer->media;
 774         bcbearer->media.send_msg = tipc_bcbearer_send;
 775         sprintf(bcbearer->media.name, "tipc-broadcast");
 776
 777         INIT_LIST_HEAD(&bcl->waiting_ports);
 778         bcl->next_out_no = 1;
 779         spin_lock_init(&bclink->node.lock);
 780         bcl->owner = &bclink->node;
 781         bcl->max_pkt = MAX_PKT_DEFAULT_MCAST;
 782         tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT);
 783         bcl->b_ptr = &bcbearer->bearer;
 784         bcl->state = WORKING_WORKING;
 785         strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME);
 786 }
 787
 788 void tipc_bclink_stop(void)
 789 {
 790         spin_lock_bh(&bc_lock);
 791         tipc_link_stop(bcl);
 792         spin_unlock_bh(&bc_lock);
 793
 794         memset(bclink, 0, sizeof(*bclink));
 795         memset(bcbearer, 0, sizeof(*bcbearer));
 796 }
 797
 798
 799 /**
 800  * tipc_nmap_add - add a node to a node map
 801  */
 802
 803 void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node)
 804 {
 805         int n = tipc_node(node);
 806         int w = n / WSIZE;
 807         u32 mask = (1 << (n % WSIZE));
 808
 809         if ((nm_ptr->map[w] & mask) == 0) {
 810                 nm_ptr->count++;
 811                 nm_ptr->map[w] |= mask;
 812         }
 813 }
 814
 815 /**
 816  * tipc_nmap_remove - remove a node from a node map
 817  */
 818
 819 void tipc_nmap_remove(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->map[w] &= ~mask;
 827                 nm_ptr->count--;
 828         }
 829 }
 830
 831 /**
 832  * tipc_nmap_diff - find differences between node maps
 833  * @nm_a: input node map A
 834  * @nm_b: input node map B
 835  * @nm_diff: output node map A-B (i.e. nodes of A that are not in B)
 836  */
 837
 838 static void tipc_nmap_diff(struct tipc_node_map *nm_a,
 839                            struct tipc_node_map *nm_b,
 840                            struct tipc_node_map *nm_diff)
 841 {
 842         int stop = ARRAY_SIZE(nm_a->map);
 843         int w;
 844         int b;
 845         u32 map;
 846
 847         memset(nm_diff, 0, sizeof(*nm_diff));
 848         for (w = 0; w < stop; w++) {
 849                 map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]);
 850                 nm_diff->map[w] = map;
 851                 if (map != 0) {
 852                         for (b = 0 ; b < WSIZE; b++) {
 853                                 if (map & (1 << b))
 854                                         nm_diff->count++;
 855                         }
 856                 }
 857         }
 858 }
 859
 860 /**
 861  * tipc_port_list_add - add a port to a port list, ensuring no duplicates
 862  */
 863
 864 void tipc_port_list_add(struct port_list *pl_ptr, u32 port)
 865 {
 866         struct port_list *item = pl_ptr;
 867         int i;
 868         int item_sz = PLSIZE;
 869         int cnt = pl_ptr->count;
 870
 871         for (; ; cnt -= item_sz, item = item->next) {
 872                 if (cnt < PLSIZE)
 873                         item_sz = cnt;
 874                 for (i = 0; i < item_sz; i++)
 875                         if (item->ports[i] == port)
 876                                 return;
 877                 if (i < PLSIZE) {
 878                         item->ports[i] = port;
 879                         pl_ptr->count++;
 880                         return;
 881                 }
 882                 if (!item->next) {
 883                         item->next = kmalloc(sizeof(*item), GFP_ATOMIC);
 884                         if (!item->next) {
 885                                 warn("Incomplete multicast delivery, no memory\n");
 886                                 return;
 887                         }
 888                         item->next->next = NULL;
 889                 }
 890         }
 891 }
 892
 893 /**
 894  * tipc_port_list_free - free dynamically created entries in port_list chain
 895  *
 896  */
 897
 898 void tipc_port_list_free(struct port_list *pl_ptr)
 899 {
 900         struct port_list *item;
 901         struct port_list *next;
 902
 903         for (item = pl_ptr->next; item; item = next) {
 904                 next = item->next;
 905                 kfree(item);
 906         }
 907 }
 908