1b97bf3fdSPer Liden /* 2b97bf3fdSPer Liden * net/tipc/bcast.c: TIPC broadcast code 3b97bf3fdSPer Liden * 4593a5f22SPer Liden * Copyright (c) 2004-2006, Ericsson AB 5b97bf3fdSPer Liden * Copyright (c) 2004, Intel Corporation. 6b97bf3fdSPer Liden * Copyright (c) 2005, Wind River Systems 7b97bf3fdSPer Liden * All rights reserved. 8b97bf3fdSPer Liden * 9b97bf3fdSPer Liden * Redistribution and use in source and binary forms, with or without 10b97bf3fdSPer Liden * modification, are permitted provided that the following conditions are met: 11b97bf3fdSPer Liden * 129ea1fd3cSPer Liden * 1. Redistributions of source code must retain the above copyright 139ea1fd3cSPer Liden * notice, this list of conditions and the following disclaimer. 149ea1fd3cSPer Liden * 2. Redistributions in binary form must reproduce the above copyright 159ea1fd3cSPer Liden * notice, this list of conditions and the following disclaimer in the 169ea1fd3cSPer Liden * documentation and/or other materials provided with the distribution. 179ea1fd3cSPer Liden * 3. Neither the names of the copyright holders nor the names of its 189ea1fd3cSPer Liden * contributors may be used to endorse or promote products derived from 199ea1fd3cSPer Liden * this software without specific prior written permission. 209ea1fd3cSPer Liden * 219ea1fd3cSPer Liden * Alternatively, this software may be distributed under the terms of the 229ea1fd3cSPer Liden * GNU General Public License ("GPL") version 2 as published by the Free 239ea1fd3cSPer Liden * Software Foundation. 24b97bf3fdSPer Liden * 25b97bf3fdSPer Liden * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 26b97bf3fdSPer Liden * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27b97bf3fdSPer Liden * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28b97bf3fdSPer Liden * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 29b97bf3fdSPer Liden * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 30b97bf3fdSPer Liden * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 31b97bf3fdSPer Liden * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 32b97bf3fdSPer Liden * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 33b97bf3fdSPer Liden * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 34b97bf3fdSPer Liden * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 35b97bf3fdSPer Liden * POSSIBILITY OF SUCH DAMAGE. 36b97bf3fdSPer Liden */ 37b97bf3fdSPer Liden 38b97bf3fdSPer Liden #include "core.h" 39b97bf3fdSPer Liden #include "msg.h" 40b97bf3fdSPer Liden #include "dbg.h" 41b97bf3fdSPer Liden #include "link.h" 42b97bf3fdSPer Liden #include "net.h" 43b97bf3fdSPer Liden #include "node.h" 44b97bf3fdSPer Liden #include "port.h" 45b97bf3fdSPer Liden #include "addr.h" 46b97bf3fdSPer Liden #include "node_subscr.h" 47b97bf3fdSPer Liden #include "name_distr.h" 48b97bf3fdSPer Liden #include "bearer.h" 49b97bf3fdSPer Liden #include "name_table.h" 50b97bf3fdSPer Liden #include "bcast.h" 51b97bf3fdSPer Liden 52b97bf3fdSPer Liden #define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */ 53b97bf3fdSPer Liden 54b97bf3fdSPer Liden #define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */ 55b97bf3fdSPer Liden 56b97bf3fdSPer Liden #define BCLINK_LOG_BUF_SIZE 0 57b97bf3fdSPer Liden 58d356eebaSAllan Stephens /* 59d356eebaSAllan Stephens * Loss rate for incoming broadcast frames; used to test retransmission code. 60d356eebaSAllan Stephens * Set to N to cause every N'th frame to be discarded; 0 => don't discard any. 61d356eebaSAllan Stephens */ 62d356eebaSAllan Stephens 63d356eebaSAllan Stephens #define TIPC_BCAST_LOSS_RATE 0 64d356eebaSAllan Stephens 65b97bf3fdSPer Liden /** 66b97bf3fdSPer Liden * struct bcbearer_pair - a pair of bearers used by broadcast link 67b97bf3fdSPer Liden * @primary: pointer to primary bearer 68b97bf3fdSPer Liden * @secondary: pointer to secondary bearer 69b97bf3fdSPer Liden * 70b97bf3fdSPer Liden * Bearers must have same priority and same set of reachable destinations 71b97bf3fdSPer Liden * to be paired. 72b97bf3fdSPer Liden */ 73b97bf3fdSPer Liden 74b97bf3fdSPer Liden struct bcbearer_pair { 75b97bf3fdSPer Liden struct bearer *primary; 76b97bf3fdSPer Liden struct bearer *secondary; 77b97bf3fdSPer Liden }; 78b97bf3fdSPer Liden 79b97bf3fdSPer Liden /** 80b97bf3fdSPer Liden * struct bcbearer - bearer used by broadcast link 81b97bf3fdSPer Liden * @bearer: (non-standard) broadcast bearer structure 82b97bf3fdSPer Liden * @media: (non-standard) broadcast media structure 83b97bf3fdSPer Liden * @bpairs: array of bearer pairs 8465f51ef0SAllan Stephens * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort() 8565f51ef0SAllan Stephens * @remains: temporary node map used by tipc_bcbearer_send() 8665f51ef0SAllan Stephens * @remains_new: temporary node map used tipc_bcbearer_send() 8765f51ef0SAllan Stephens * 8865f51ef0SAllan Stephens * Note: The fields labelled "temporary" are incorporated into the bearer 8965f51ef0SAllan Stephens * to avoid consuming potentially limited stack space through the use of 9065f51ef0SAllan Stephens * large local variables within multicast routines. Concurrent access is 9165f51ef0SAllan Stephens * prevented through use of the spinlock "bc_lock". 92b97bf3fdSPer Liden */ 93b97bf3fdSPer Liden 94b97bf3fdSPer Liden struct bcbearer { 95b97bf3fdSPer Liden struct bearer bearer; 96b97bf3fdSPer Liden struct media media; 97b97bf3fdSPer Liden struct bcbearer_pair bpairs[MAX_BEARERS]; 9816cb4b33SPer Liden struct bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1]; 996c00055aSDavid S. Miller struct tipc_node_map remains; 1006c00055aSDavid S. Miller struct tipc_node_map remains_new; 101b97bf3fdSPer Liden }; 102b97bf3fdSPer Liden 103b97bf3fdSPer Liden /** 104b97bf3fdSPer Liden * struct bclink - link used for broadcast messages 105b97bf3fdSPer Liden * @link: (non-standard) broadcast link structure 106b97bf3fdSPer Liden * @node: (non-standard) node structure representing b'cast link's peer node 107b97bf3fdSPer Liden * 108b97bf3fdSPer Liden * Handles sequence numbering, fragmentation, bundling, etc. 109b97bf3fdSPer Liden */ 110b97bf3fdSPer Liden 111b97bf3fdSPer Liden struct bclink { 112b97bf3fdSPer Liden struct link link; 1136c00055aSDavid S. Miller struct tipc_node node; 114b97bf3fdSPer Liden }; 115b97bf3fdSPer Liden 116b97bf3fdSPer Liden 117b97bf3fdSPer Liden static struct bcbearer *bcbearer = NULL; 118b97bf3fdSPer Liden static struct bclink *bclink = NULL; 119b97bf3fdSPer Liden static struct link *bcl = NULL; 12034af946aSIngo Molnar static DEFINE_SPINLOCK(bc_lock); 121b97bf3fdSPer Liden 1223aec9cc9SAllan Stephens const char tipc_bclink_name[] = "broadcast-link"; 123b97bf3fdSPer Liden 124b97bf3fdSPer Liden 12505790c64SSam Ravnborg static u32 buf_seqno(struct sk_buff *buf) 126b97bf3fdSPer Liden { 127b97bf3fdSPer Liden return msg_seqno(buf_msg(buf)); 128b97bf3fdSPer Liden } 129b97bf3fdSPer Liden 13005790c64SSam Ravnborg static u32 bcbuf_acks(struct sk_buff *buf) 131b97bf3fdSPer Liden { 132880b005fSDavid S. Miller return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle; 133b97bf3fdSPer Liden } 134b97bf3fdSPer Liden 13505790c64SSam Ravnborg static void bcbuf_set_acks(struct sk_buff *buf, u32 acks) 136b97bf3fdSPer Liden { 137880b005fSDavid S. Miller TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks; 138b97bf3fdSPer Liden } 139b97bf3fdSPer Liden 14005790c64SSam Ravnborg static void bcbuf_decr_acks(struct sk_buff *buf) 141b97bf3fdSPer Liden { 142b97bf3fdSPer Liden bcbuf_set_acks(buf, bcbuf_acks(buf) - 1); 143b97bf3fdSPer Liden } 144b97bf3fdSPer Liden 145b97bf3fdSPer Liden 146b97bf3fdSPer Liden /** 147b97bf3fdSPer Liden * bclink_set_gap - set gap according to contents of current deferred pkt queue 148b97bf3fdSPer Liden * 149b97bf3fdSPer Liden * Called with 'node' locked, bc_lock unlocked 150b97bf3fdSPer Liden */ 151b97bf3fdSPer Liden 1526c00055aSDavid S. Miller static void bclink_set_gap(struct tipc_node *n_ptr) 153b97bf3fdSPer Liden { 154b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 155b97bf3fdSPer Liden 156b97bf3fdSPer Liden n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 157b97bf3fdSPer Liden mod(n_ptr->bclink.last_in); 158b97bf3fdSPer Liden if (unlikely(buf != NULL)) 159b97bf3fdSPer Liden n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1); 160b97bf3fdSPer Liden } 161b97bf3fdSPer Liden 162b97bf3fdSPer Liden /** 163b97bf3fdSPer Liden * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment 164b97bf3fdSPer Liden * 165b97bf3fdSPer Liden * This mechanism endeavours to prevent all nodes in network from trying 166b97bf3fdSPer Liden * to ACK or NACK at the same time. 167b97bf3fdSPer Liden * 168b97bf3fdSPer Liden * Note: TIPC uses a different trigger to distribute ACKs than it does to 169b97bf3fdSPer Liden * distribute NACKs, but tries to use the same spacing (divide by 16). 170b97bf3fdSPer Liden */ 171b97bf3fdSPer Liden 17205790c64SSam Ravnborg static int bclink_ack_allowed(u32 n) 173b97bf3fdSPer Liden { 174b97bf3fdSPer Liden return((n % TIPC_MIN_LINK_WIN) == tipc_own_tag); 175b97bf3fdSPer Liden } 176b97bf3fdSPer Liden 177b97bf3fdSPer Liden 178b97bf3fdSPer Liden /** 179b97bf3fdSPer Liden * bclink_retransmit_pkt - retransmit broadcast packets 180b97bf3fdSPer Liden * @after: sequence number of last packet to *not* retransmit 181b97bf3fdSPer Liden * @to: sequence number of last packet to retransmit 182b97bf3fdSPer Liden * 183d356eebaSAllan Stephens * Called with bc_lock locked 184b97bf3fdSPer Liden */ 185b97bf3fdSPer Liden 186b97bf3fdSPer Liden static void bclink_retransmit_pkt(u32 after, u32 to) 187b97bf3fdSPer Liden { 188b97bf3fdSPer Liden struct sk_buff *buf; 189b97bf3fdSPer Liden 190b97bf3fdSPer Liden buf = bcl->first_out; 191b97bf3fdSPer Liden while (buf && less_eq(buf_seqno(buf), after)) { 192b97bf3fdSPer Liden buf = buf->next; 193b97bf3fdSPer Liden } 1944323add6SPer Liden tipc_link_retransmit(bcl, buf, mod(to - after)); 195b97bf3fdSPer Liden } 196b97bf3fdSPer Liden 197b97bf3fdSPer Liden /** 1984323add6SPer Liden * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets 199b97bf3fdSPer Liden * @n_ptr: node that sent acknowledgement info 200b97bf3fdSPer Liden * @acked: broadcast sequence # that has been acknowledged 201b97bf3fdSPer Liden * 202b97bf3fdSPer Liden * Node is locked, bc_lock unlocked. 203b97bf3fdSPer Liden */ 204b97bf3fdSPer Liden 2056c00055aSDavid S. Miller void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked) 206b97bf3fdSPer Liden { 207b97bf3fdSPer Liden struct sk_buff *crs; 208b97bf3fdSPer Liden struct sk_buff *next; 209b97bf3fdSPer Liden unsigned int released = 0; 210b97bf3fdSPer Liden 211b97bf3fdSPer Liden if (less_eq(acked, n_ptr->bclink.acked)) 212b97bf3fdSPer Liden return; 213b97bf3fdSPer Liden 214b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 215b97bf3fdSPer Liden 216b97bf3fdSPer Liden /* Skip over packets that node has previously acknowledged */ 217b97bf3fdSPer Liden 218b97bf3fdSPer Liden crs = bcl->first_out; 219b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) { 220b97bf3fdSPer Liden crs = crs->next; 221b97bf3fdSPer Liden } 222b97bf3fdSPer Liden 223b97bf3fdSPer Liden /* Update packets that node is now acknowledging */ 224b97bf3fdSPer Liden 225b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), acked)) { 226b97bf3fdSPer Liden next = crs->next; 227b97bf3fdSPer Liden bcbuf_decr_acks(crs); 228b97bf3fdSPer Liden if (bcbuf_acks(crs) == 0) { 229b97bf3fdSPer Liden bcl->first_out = next; 230b97bf3fdSPer Liden bcl->out_queue_size--; 231b97bf3fdSPer Liden buf_discard(crs); 232b97bf3fdSPer Liden released = 1; 233b97bf3fdSPer Liden } 234b97bf3fdSPer Liden crs = next; 235b97bf3fdSPer Liden } 236b97bf3fdSPer Liden n_ptr->bclink.acked = acked; 237b97bf3fdSPer Liden 238b97bf3fdSPer Liden /* Try resolving broadcast link congestion, if necessary */ 239b97bf3fdSPer Liden 240b97bf3fdSPer Liden if (unlikely(bcl->next_out)) 2414323add6SPer Liden tipc_link_push_queue(bcl); 242b97bf3fdSPer Liden if (unlikely(released && !list_empty(&bcl->waiting_ports))) 2434323add6SPer Liden tipc_link_wakeup_ports(bcl, 0); 244b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 245b97bf3fdSPer Liden } 246b97bf3fdSPer Liden 247b97bf3fdSPer Liden /** 248b97bf3fdSPer Liden * bclink_send_ack - unicast an ACK msg 249b97bf3fdSPer Liden * 2504323add6SPer Liden * tipc_net_lock and node lock set 251b97bf3fdSPer Liden */ 252b97bf3fdSPer Liden 2536c00055aSDavid S. Miller static void bclink_send_ack(struct tipc_node *n_ptr) 254b97bf3fdSPer Liden { 255b97bf3fdSPer Liden struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1]; 256b97bf3fdSPer Liden 257b97bf3fdSPer Liden if (l_ptr != NULL) 2584323add6SPer Liden tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0); 259b97bf3fdSPer Liden } 260b97bf3fdSPer Liden 261b97bf3fdSPer Liden /** 262b97bf3fdSPer Liden * bclink_send_nack- broadcast a NACK msg 263b97bf3fdSPer Liden * 2644323add6SPer Liden * tipc_net_lock and node lock set 265b97bf3fdSPer Liden */ 266b97bf3fdSPer Liden 2676c00055aSDavid S. Miller static void bclink_send_nack(struct tipc_node *n_ptr) 268b97bf3fdSPer Liden { 269b97bf3fdSPer Liden struct sk_buff *buf; 270b97bf3fdSPer Liden struct tipc_msg *msg; 271b97bf3fdSPer Liden 272b97bf3fdSPer Liden if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to)) 273b97bf3fdSPer Liden return; 274b97bf3fdSPer Liden 275b97bf3fdSPer Liden buf = buf_acquire(INT_H_SIZE); 276b97bf3fdSPer Liden if (buf) { 277b97bf3fdSPer Liden msg = buf_msg(buf); 278b97bf3fdSPer Liden msg_init(msg, BCAST_PROTOCOL, STATE_MSG, 27975715217SAllan Stephens INT_H_SIZE, n_ptr->addr); 280b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 281b97bf3fdSPer Liden msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in)); 282b97bf3fdSPer Liden msg_set_bcgap_after(msg, n_ptr->bclink.gap_after); 283b97bf3fdSPer Liden msg_set_bcgap_to(msg, n_ptr->bclink.gap_to); 284b97bf3fdSPer Liden msg_set_bcast_tag(msg, tipc_own_tag); 285b97bf3fdSPer Liden 2861fc54d8fSSam Ravnborg if (tipc_bearer_send(&bcbearer->bearer, buf, NULL)) { 287b97bf3fdSPer Liden bcl->stats.sent_nacks++; 288b97bf3fdSPer Liden buf_discard(buf); 289b97bf3fdSPer Liden } else { 2904323add6SPer Liden tipc_bearer_schedule(bcl->b_ptr, bcl); 291b97bf3fdSPer Liden bcl->proto_msg_queue = buf; 292b97bf3fdSPer Liden bcl->stats.bearer_congs++; 293b97bf3fdSPer Liden } 294b97bf3fdSPer Liden 295b97bf3fdSPer Liden /* 296b97bf3fdSPer Liden * Ensure we doesn't send another NACK msg to the node 297b97bf3fdSPer Liden * until 16 more deferred messages arrive from it 298b97bf3fdSPer Liden * (i.e. helps prevent all nodes from NACK'ing at same time) 299b97bf3fdSPer Liden */ 300b97bf3fdSPer Liden 301b97bf3fdSPer Liden n_ptr->bclink.nack_sync = tipc_own_tag; 302b97bf3fdSPer Liden } 303b97bf3fdSPer Liden } 304b97bf3fdSPer Liden 305b97bf3fdSPer Liden /** 3064323add6SPer Liden * tipc_bclink_check_gap - send a NACK if a sequence gap exists 307b97bf3fdSPer Liden * 3084323add6SPer Liden * tipc_net_lock and node lock set 309b97bf3fdSPer Liden */ 310b97bf3fdSPer Liden 3116c00055aSDavid S. Miller void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 last_sent) 312b97bf3fdSPer Liden { 313b97bf3fdSPer Liden if (!n_ptr->bclink.supported || 314b97bf3fdSPer Liden less_eq(last_sent, mod(n_ptr->bclink.last_in))) 315b97bf3fdSPer Liden return; 316b97bf3fdSPer Liden 317b97bf3fdSPer Liden bclink_set_gap(n_ptr); 318b97bf3fdSPer Liden if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to) 319b97bf3fdSPer Liden n_ptr->bclink.gap_to = last_sent; 320b97bf3fdSPer Liden bclink_send_nack(n_ptr); 321b97bf3fdSPer Liden } 322b97bf3fdSPer Liden 323b97bf3fdSPer Liden /** 3244323add6SPer Liden * tipc_bclink_peek_nack - process a NACK msg meant for another node 325b97bf3fdSPer Liden * 3264323add6SPer Liden * Only tipc_net_lock set. 327b97bf3fdSPer Liden */ 328b97bf3fdSPer Liden 329988f088aSAdrian Bunk static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to) 330b97bf3fdSPer Liden { 3316c00055aSDavid S. Miller struct tipc_node *n_ptr = tipc_node_find(dest); 332b97bf3fdSPer Liden u32 my_after, my_to; 333b97bf3fdSPer Liden 3344323add6SPer Liden if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr))) 335b97bf3fdSPer Liden return; 3364323add6SPer Liden tipc_node_lock(n_ptr); 337b97bf3fdSPer Liden /* 338b97bf3fdSPer Liden * Modify gap to suppress unnecessary NACKs from this node 339b97bf3fdSPer Liden */ 340b97bf3fdSPer Liden my_after = n_ptr->bclink.gap_after; 341b97bf3fdSPer Liden my_to = n_ptr->bclink.gap_to; 342b97bf3fdSPer Liden 343b97bf3fdSPer Liden if (less_eq(gap_after, my_after)) { 344b97bf3fdSPer Liden if (less(my_after, gap_to) && less(gap_to, my_to)) 345b97bf3fdSPer Liden n_ptr->bclink.gap_after = gap_to; 346b97bf3fdSPer Liden else if (less_eq(my_to, gap_to)) 347b97bf3fdSPer Liden n_ptr->bclink.gap_to = n_ptr->bclink.gap_after; 348b97bf3fdSPer Liden } else if (less_eq(gap_after, my_to)) { 349b97bf3fdSPer Liden if (less_eq(my_to, gap_to)) 350b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 351b97bf3fdSPer Liden } else { 352b97bf3fdSPer Liden /* 353b97bf3fdSPer Liden * Expand gap if missing bufs not in deferred queue: 354b97bf3fdSPer Liden */ 355b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 356b97bf3fdSPer Liden u32 prev = n_ptr->bclink.gap_to; 357b97bf3fdSPer Liden 358b97bf3fdSPer Liden for (; buf; buf = buf->next) { 359b97bf3fdSPer Liden u32 seqno = buf_seqno(buf); 360b97bf3fdSPer Liden 3613ac90216SEric Sesterhenn if (mod(seqno - prev) != 1) { 362b97bf3fdSPer Liden buf = NULL; 3633ac90216SEric Sesterhenn break; 3643ac90216SEric Sesterhenn } 365b97bf3fdSPer Liden if (seqno == gap_after) 366b97bf3fdSPer Liden break; 367b97bf3fdSPer Liden prev = seqno; 368b97bf3fdSPer Liden } 369b97bf3fdSPer Liden if (buf == NULL) 370b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 371b97bf3fdSPer Liden } 372b97bf3fdSPer Liden /* 373b97bf3fdSPer Liden * Some nodes may send a complementary NACK now: 374b97bf3fdSPer Liden */ 375b97bf3fdSPer Liden if (bclink_ack_allowed(sender_tag + 1)) { 376b97bf3fdSPer Liden if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) { 377b97bf3fdSPer Liden bclink_send_nack(n_ptr); 378b97bf3fdSPer Liden bclink_set_gap(n_ptr); 379b97bf3fdSPer Liden } 380b97bf3fdSPer Liden } 3814323add6SPer Liden tipc_node_unlock(n_ptr); 382b97bf3fdSPer Liden } 383b97bf3fdSPer Liden 384b97bf3fdSPer Liden /** 3854323add6SPer Liden * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster 386b97bf3fdSPer Liden */ 387b97bf3fdSPer Liden 3884323add6SPer Liden int tipc_bclink_send_msg(struct sk_buff *buf) 389b97bf3fdSPer Liden { 390b97bf3fdSPer Liden int res; 391b97bf3fdSPer Liden 392b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 393b97bf3fdSPer Liden 3944323add6SPer Liden res = tipc_link_send_buf(bcl, buf); 395b97bf3fdSPer Liden if (unlikely(res == -ELINKCONG)) 396b97bf3fdSPer Liden buf_discard(buf); 397b97bf3fdSPer Liden else 398b97bf3fdSPer Liden bcl->stats.sent_info++; 399b97bf3fdSPer Liden 400b97bf3fdSPer Liden if (bcl->out_queue_size > bcl->stats.max_queue_sz) 401b97bf3fdSPer Liden bcl->stats.max_queue_sz = bcl->out_queue_size; 402b97bf3fdSPer Liden bcl->stats.queue_sz_counts++; 403b97bf3fdSPer Liden bcl->stats.accu_queue_sz += bcl->out_queue_size; 404b97bf3fdSPer Liden 405b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 406b97bf3fdSPer Liden return res; 407b97bf3fdSPer Liden } 408b97bf3fdSPer Liden 409b97bf3fdSPer Liden /** 4104323add6SPer Liden * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards 411b97bf3fdSPer Liden * 4124323add6SPer Liden * tipc_net_lock is read_locked, no other locks set 413b97bf3fdSPer Liden */ 414b97bf3fdSPer Liden 4154323add6SPer Liden void tipc_bclink_recv_pkt(struct sk_buff *buf) 416b97bf3fdSPer Liden { 417d356eebaSAllan Stephens #if (TIPC_BCAST_LOSS_RATE) 418d356eebaSAllan Stephens static int rx_count = 0; 419d356eebaSAllan Stephens #endif 420b97bf3fdSPer Liden struct tipc_msg *msg = buf_msg(buf); 4216c00055aSDavid S. Miller struct tipc_node* node = tipc_node_find(msg_prevnode(msg)); 422b97bf3fdSPer Liden u32 next_in; 423b97bf3fdSPer Liden u32 seqno; 424b97bf3fdSPer Liden struct sk_buff *deferred; 425b97bf3fdSPer Liden 426b97bf3fdSPer Liden msg_dbg(msg, "<BC<<<"); 427b97bf3fdSPer Liden 4284323add6SPer Liden if (unlikely(!node || !tipc_node_is_up(node) || !node->bclink.supported || 429b97bf3fdSPer Liden (msg_mc_netid(msg) != tipc_net_id))) { 430b97bf3fdSPer Liden buf_discard(buf); 431b97bf3fdSPer Liden return; 432b97bf3fdSPer Liden } 433b97bf3fdSPer Liden 434b97bf3fdSPer Liden if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { 435b97bf3fdSPer Liden msg_dbg(msg, "<BCNACK<<<"); 436b97bf3fdSPer Liden if (msg_destnode(msg) == tipc_own_addr) { 4374323add6SPer Liden tipc_node_lock(node); 4384323add6SPer Liden tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); 4394323add6SPer Liden tipc_node_unlock(node); 440d356eebaSAllan Stephens spin_lock_bh(&bc_lock); 441b97bf3fdSPer Liden bcl->stats.recv_nacks++; 442d356eebaSAllan Stephens bcl->owner->next = node; /* remember requestor */ 443b97bf3fdSPer Liden bclink_retransmit_pkt(msg_bcgap_after(msg), 444b97bf3fdSPer Liden msg_bcgap_to(msg)); 445d356eebaSAllan Stephens bcl->owner->next = NULL; 446d356eebaSAllan Stephens spin_unlock_bh(&bc_lock); 447b97bf3fdSPer Liden } else { 4484323add6SPer Liden tipc_bclink_peek_nack(msg_destnode(msg), 449b97bf3fdSPer Liden msg_bcast_tag(msg), 450b97bf3fdSPer Liden msg_bcgap_after(msg), 451b97bf3fdSPer Liden msg_bcgap_to(msg)); 452b97bf3fdSPer Liden } 453b97bf3fdSPer Liden buf_discard(buf); 454b97bf3fdSPer Liden return; 455b97bf3fdSPer Liden } 456b97bf3fdSPer Liden 457d356eebaSAllan Stephens #if (TIPC_BCAST_LOSS_RATE) 458d356eebaSAllan Stephens if (++rx_count == TIPC_BCAST_LOSS_RATE) { 459d356eebaSAllan Stephens rx_count = 0; 460d356eebaSAllan Stephens buf_discard(buf); 461d356eebaSAllan Stephens return; 462d356eebaSAllan Stephens } 463d356eebaSAllan Stephens #endif 464d356eebaSAllan Stephens 4654323add6SPer Liden tipc_node_lock(node); 466b97bf3fdSPer Liden receive: 467b97bf3fdSPer Liden deferred = node->bclink.deferred_head; 468b97bf3fdSPer Liden next_in = mod(node->bclink.last_in + 1); 469b97bf3fdSPer Liden seqno = msg_seqno(msg); 470b97bf3fdSPer Liden 471b97bf3fdSPer Liden if (likely(seqno == next_in)) { 472b97bf3fdSPer Liden bcl->stats.recv_info++; 473b97bf3fdSPer Liden node->bclink.last_in++; 474b97bf3fdSPer Liden bclink_set_gap(node); 475b97bf3fdSPer Liden if (unlikely(bclink_ack_allowed(seqno))) { 476b97bf3fdSPer Liden bclink_send_ack(node); 477b97bf3fdSPer Liden bcl->stats.sent_acks++; 478b97bf3fdSPer Liden } 479b97bf3fdSPer Liden if (likely(msg_isdata(msg))) { 4804323add6SPer Liden tipc_node_unlock(node); 4814323add6SPer Liden tipc_port_recv_mcast(buf, NULL); 482b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_BUNDLER) { 483b97bf3fdSPer Liden bcl->stats.recv_bundles++; 484b97bf3fdSPer Liden bcl->stats.recv_bundled += msg_msgcnt(msg); 4854323add6SPer Liden tipc_node_unlock(node); 4864323add6SPer Liden tipc_link_recv_bundle(buf); 487b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_FRAGMENTER) { 488b97bf3fdSPer Liden bcl->stats.recv_fragments++; 4894323add6SPer Liden if (tipc_link_recv_fragment(&node->bclink.defragm, 490b97bf3fdSPer Liden &buf, &msg)) 491b97bf3fdSPer Liden bcl->stats.recv_fragmented++; 4924323add6SPer Liden tipc_node_unlock(node); 4934323add6SPer Liden tipc_net_route_msg(buf); 494b97bf3fdSPer Liden } else { 4954323add6SPer Liden tipc_node_unlock(node); 4964323add6SPer Liden tipc_net_route_msg(buf); 497b97bf3fdSPer Liden } 498b97bf3fdSPer Liden if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) { 4994323add6SPer Liden tipc_node_lock(node); 500b97bf3fdSPer Liden buf = deferred; 501b97bf3fdSPer Liden msg = buf_msg(buf); 502b97bf3fdSPer Liden node->bclink.deferred_head = deferred->next; 503b97bf3fdSPer Liden goto receive; 504b97bf3fdSPer Liden } 505b97bf3fdSPer Liden return; 506b97bf3fdSPer Liden } else if (less(next_in, seqno)) { 507b97bf3fdSPer Liden u32 gap_after = node->bclink.gap_after; 508b97bf3fdSPer Liden u32 gap_to = node->bclink.gap_to; 509b97bf3fdSPer Liden 5104323add6SPer Liden if (tipc_link_defer_pkt(&node->bclink.deferred_head, 511b97bf3fdSPer Liden &node->bclink.deferred_tail, 512b97bf3fdSPer Liden buf)) { 513b97bf3fdSPer Liden node->bclink.nack_sync++; 514b97bf3fdSPer Liden bcl->stats.deferred_recv++; 515b97bf3fdSPer Liden if (seqno == mod(gap_after + 1)) 516b97bf3fdSPer Liden node->bclink.gap_after = seqno; 517b97bf3fdSPer Liden else if (less(gap_after, seqno) && less(seqno, gap_to)) 518b97bf3fdSPer Liden node->bclink.gap_to = seqno; 519b97bf3fdSPer Liden } 520b97bf3fdSPer Liden if (bclink_ack_allowed(node->bclink.nack_sync)) { 521b97bf3fdSPer Liden if (gap_to != gap_after) 522b97bf3fdSPer Liden bclink_send_nack(node); 523b97bf3fdSPer Liden bclink_set_gap(node); 524b97bf3fdSPer Liden } 525b97bf3fdSPer Liden } else { 526b97bf3fdSPer Liden bcl->stats.duplicates++; 527b97bf3fdSPer Liden buf_discard(buf); 528b97bf3fdSPer Liden } 5294323add6SPer Liden tipc_node_unlock(node); 530b97bf3fdSPer Liden } 531b97bf3fdSPer Liden 5324323add6SPer Liden u32 tipc_bclink_get_last_sent(void) 533b97bf3fdSPer Liden { 534b97bf3fdSPer Liden u32 last_sent = mod(bcl->next_out_no - 1); 535b97bf3fdSPer Liden 536b97bf3fdSPer Liden if (bcl->next_out) 537b97bf3fdSPer Liden last_sent = mod(buf_seqno(bcl->next_out) - 1); 538b97bf3fdSPer Liden return last_sent; 539b97bf3fdSPer Liden } 540b97bf3fdSPer Liden 5416c00055aSDavid S. Miller u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) 542b97bf3fdSPer Liden { 543b97bf3fdSPer Liden return (n_ptr->bclink.supported && 5444323add6SPer Liden (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); 545b97bf3fdSPer Liden } 546b97bf3fdSPer Liden 547b97bf3fdSPer Liden 548b97bf3fdSPer Liden /** 5494323add6SPer Liden * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer 550b97bf3fdSPer Liden * 551b97bf3fdSPer Liden * Send through as many bearers as necessary to reach all nodes 552b97bf3fdSPer Liden * that support TIPC multicasting. 553b97bf3fdSPer Liden * 554b97bf3fdSPer Liden * Returns 0 if packet sent successfully, non-zero if not 555b97bf3fdSPer Liden */ 556b97bf3fdSPer Liden 557988f088aSAdrian Bunk static int tipc_bcbearer_send(struct sk_buff *buf, 558b97bf3fdSPer Liden struct tipc_bearer *unused1, 559b97bf3fdSPer Liden struct tipc_media_addr *unused2) 560b97bf3fdSPer Liden { 561b97bf3fdSPer Liden int bp_index; 562b97bf3fdSPer Liden 563b97bf3fdSPer Liden /* Prepare buffer for broadcasting (if first time trying to send it) */ 564b97bf3fdSPer Liden 565b97bf3fdSPer Liden if (likely(!msg_non_seq(buf_msg(buf)))) { 566b97bf3fdSPer Liden struct tipc_msg *msg; 567b97bf3fdSPer Liden 5684323add6SPer Liden assert(tipc_cltr_bcast_nodes.count != 0); 5694323add6SPer Liden bcbuf_set_acks(buf, tipc_cltr_bcast_nodes.count); 570b97bf3fdSPer Liden msg = buf_msg(buf); 57140aecb1bSAllan Stephens msg_set_non_seq(msg, 1); 572b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 573b97bf3fdSPer Liden } 574b97bf3fdSPer Liden 575b97bf3fdSPer Liden /* Send buffer over bearers until all targets reached */ 576b97bf3fdSPer Liden 57765f51ef0SAllan Stephens bcbearer->remains = tipc_cltr_bcast_nodes; 578b97bf3fdSPer Liden 579b97bf3fdSPer Liden for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { 580b97bf3fdSPer Liden struct bearer *p = bcbearer->bpairs[bp_index].primary; 581b97bf3fdSPer Liden struct bearer *s = bcbearer->bpairs[bp_index].secondary; 582b97bf3fdSPer Liden 583b97bf3fdSPer Liden if (!p) 584b97bf3fdSPer Liden break; /* no more bearers to try */ 585b97bf3fdSPer Liden 58665f51ef0SAllan Stephens tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new); 58765f51ef0SAllan Stephens if (bcbearer->remains_new.count == bcbearer->remains.count) 588b97bf3fdSPer Liden continue; /* bearer pair doesn't add anything */ 589b97bf3fdSPer Liden 5901a624832SNeil Horman if (p->publ.blocked || 5911a624832SNeil Horman p->media->send_msg(buf, &p->publ, &p->media->bcast_addr)) { 5921a624832SNeil Horman /* unable to send on primary bearer */ 5931a624832SNeil Horman if (!s || s->publ.blocked || 5941a624832SNeil Horman s->media->send_msg(buf, &s->publ, 5951a624832SNeil Horman &s->media->bcast_addr)) { 5961a624832SNeil Horman /* unable to send on either bearer */ 5971a624832SNeil Horman continue; 5981a624832SNeil Horman } 599b97bf3fdSPer Liden } 600b97bf3fdSPer Liden 6011a624832SNeil Horman if (s) { 602b97bf3fdSPer Liden bcbearer->bpairs[bp_index].primary = s; 603b97bf3fdSPer Liden bcbearer->bpairs[bp_index].secondary = p; 6041a624832SNeil Horman } 6051a624832SNeil Horman 60665f51ef0SAllan Stephens if (bcbearer->remains_new.count == 0) 6070e35fd5eSAllan Stephens return 0; 608b97bf3fdSPer Liden 60965f51ef0SAllan Stephens bcbearer->remains = bcbearer->remains_new; 610b97bf3fdSPer Liden } 611b97bf3fdSPer Liden 612b97bf3fdSPer Liden /* Unable to reach all targets */ 613b97bf3fdSPer Liden 614b97bf3fdSPer Liden bcbearer->bearer.publ.blocked = 1; 615b97bf3fdSPer Liden bcl->stats.bearer_congs++; 6160e35fd5eSAllan Stephens return 1; 617b97bf3fdSPer Liden } 618b97bf3fdSPer Liden 619b97bf3fdSPer Liden /** 6204323add6SPer Liden * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer 621b97bf3fdSPer Liden */ 622b97bf3fdSPer Liden 6234323add6SPer Liden void tipc_bcbearer_sort(void) 624b97bf3fdSPer Liden { 625b97bf3fdSPer Liden struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp; 626b97bf3fdSPer Liden struct bcbearer_pair *bp_curr; 627b97bf3fdSPer Liden int b_index; 628b97bf3fdSPer Liden int pri; 629b97bf3fdSPer Liden 630b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 631b97bf3fdSPer Liden 632b97bf3fdSPer Liden /* Group bearers by priority (can assume max of two per priority) */ 633b97bf3fdSPer Liden 634b97bf3fdSPer Liden memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); 635b97bf3fdSPer Liden 636b97bf3fdSPer Liden for (b_index = 0; b_index < MAX_BEARERS; b_index++) { 6374323add6SPer Liden struct bearer *b = &tipc_bearers[b_index]; 638b97bf3fdSPer Liden 639b97bf3fdSPer Liden if (!b->active || !b->nodes.count) 640b97bf3fdSPer Liden continue; 641b97bf3fdSPer Liden 642b97bf3fdSPer Liden if (!bp_temp[b->priority].primary) 643b97bf3fdSPer Liden bp_temp[b->priority].primary = b; 644b97bf3fdSPer Liden else 645b97bf3fdSPer Liden bp_temp[b->priority].secondary = b; 646b97bf3fdSPer Liden } 647b97bf3fdSPer Liden 648b97bf3fdSPer Liden /* Create array of bearer pairs for broadcasting */ 649b97bf3fdSPer Liden 650b97bf3fdSPer Liden bp_curr = bcbearer->bpairs; 651b97bf3fdSPer Liden memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); 652b97bf3fdSPer Liden 65316cb4b33SPer Liden for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { 654b97bf3fdSPer Liden 655b97bf3fdSPer Liden if (!bp_temp[pri].primary) 656b97bf3fdSPer Liden continue; 657b97bf3fdSPer Liden 658b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].primary; 659b97bf3fdSPer Liden 660b97bf3fdSPer Liden if (bp_temp[pri].secondary) { 6614323add6SPer Liden if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, 662b97bf3fdSPer Liden &bp_temp[pri].secondary->nodes)) { 663b97bf3fdSPer Liden bp_curr->secondary = bp_temp[pri].secondary; 664b97bf3fdSPer Liden } else { 665b97bf3fdSPer Liden bp_curr++; 666b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].secondary; 667b97bf3fdSPer Liden } 668b97bf3fdSPer Liden } 669b97bf3fdSPer Liden 670b97bf3fdSPer Liden bp_curr++; 671b97bf3fdSPer Liden } 672b97bf3fdSPer Liden 673b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 674b97bf3fdSPer Liden } 675b97bf3fdSPer Liden 676b97bf3fdSPer Liden /** 6774323add6SPer Liden * tipc_bcbearer_push - resolve bearer congestion 678b97bf3fdSPer Liden * 679b97bf3fdSPer Liden * Forces bclink to push out any unsent packets, until all packets are gone 680b97bf3fdSPer Liden * or congestion reoccurs. 681b97bf3fdSPer Liden * No locks set when function called 682b97bf3fdSPer Liden */ 683b97bf3fdSPer Liden 6844323add6SPer Liden void tipc_bcbearer_push(void) 685b97bf3fdSPer Liden { 686b97bf3fdSPer Liden struct bearer *b_ptr; 687b97bf3fdSPer Liden 688b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 689b97bf3fdSPer Liden b_ptr = &bcbearer->bearer; 690b97bf3fdSPer Liden if (b_ptr->publ.blocked) { 691b97bf3fdSPer Liden b_ptr->publ.blocked = 0; 6924323add6SPer Liden tipc_bearer_lock_push(b_ptr); 693b97bf3fdSPer Liden } 694b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 695b97bf3fdSPer Liden } 696b97bf3fdSPer Liden 697b97bf3fdSPer Liden 6984323add6SPer Liden int tipc_bclink_stats(char *buf, const u32 buf_size) 699b97bf3fdSPer Liden { 700b97bf3fdSPer Liden struct print_buf pb; 701b97bf3fdSPer Liden 702b97bf3fdSPer Liden if (!bcl) 703b97bf3fdSPer Liden return 0; 704b97bf3fdSPer Liden 7054323add6SPer Liden tipc_printbuf_init(&pb, buf, buf_size); 706b97bf3fdSPer Liden 707b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 708b97bf3fdSPer Liden 709b97bf3fdSPer Liden tipc_printf(&pb, "Link <%s>\n" 710b97bf3fdSPer Liden " Window:%u packets\n", 711b97bf3fdSPer Liden bcl->name, bcl->queue_limit[0]); 712b97bf3fdSPer Liden tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n", 713b97bf3fdSPer Liden bcl->stats.recv_info, 714b97bf3fdSPer Liden bcl->stats.recv_fragments, 715b97bf3fdSPer Liden bcl->stats.recv_fragmented, 716b97bf3fdSPer Liden bcl->stats.recv_bundles, 717b97bf3fdSPer Liden bcl->stats.recv_bundled); 718b97bf3fdSPer Liden tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n", 719b97bf3fdSPer Liden bcl->stats.sent_info, 720b97bf3fdSPer Liden bcl->stats.sent_fragments, 721b97bf3fdSPer Liden bcl->stats.sent_fragmented, 722b97bf3fdSPer Liden bcl->stats.sent_bundles, 723b97bf3fdSPer Liden bcl->stats.sent_bundled); 724b97bf3fdSPer Liden tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n", 725b97bf3fdSPer Liden bcl->stats.recv_nacks, 726b97bf3fdSPer Liden bcl->stats.deferred_recv, 727b97bf3fdSPer Liden bcl->stats.duplicates); 728b97bf3fdSPer Liden tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n", 729b97bf3fdSPer Liden bcl->stats.sent_nacks, 730b97bf3fdSPer Liden bcl->stats.sent_acks, 731b97bf3fdSPer Liden bcl->stats.retransmitted); 732b97bf3fdSPer Liden tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n", 733b97bf3fdSPer Liden bcl->stats.bearer_congs, 734b97bf3fdSPer Liden bcl->stats.link_congs, 735b97bf3fdSPer Liden bcl->stats.max_queue_sz, 736b97bf3fdSPer Liden bcl->stats.queue_sz_counts 737b97bf3fdSPer Liden ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts) 738b97bf3fdSPer Liden : 0); 739b97bf3fdSPer Liden 740b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7414323add6SPer Liden return tipc_printbuf_validate(&pb); 742b97bf3fdSPer Liden } 743b97bf3fdSPer Liden 7444323add6SPer Liden int tipc_bclink_reset_stats(void) 745b97bf3fdSPer Liden { 746b97bf3fdSPer Liden if (!bcl) 747b97bf3fdSPer Liden return -ENOPROTOOPT; 748b97bf3fdSPer Liden 749b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 750b97bf3fdSPer Liden memset(&bcl->stats, 0, sizeof(bcl->stats)); 751b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7520e35fd5eSAllan Stephens return 0; 753b97bf3fdSPer Liden } 754b97bf3fdSPer Liden 7554323add6SPer Liden int tipc_bclink_set_queue_limits(u32 limit) 756b97bf3fdSPer Liden { 757b97bf3fdSPer Liden if (!bcl) 758b97bf3fdSPer Liden return -ENOPROTOOPT; 759b97bf3fdSPer Liden if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) 760b97bf3fdSPer Liden return -EINVAL; 761b97bf3fdSPer Liden 762b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 7634323add6SPer Liden tipc_link_set_queue_limits(bcl, limit); 764b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7650e35fd5eSAllan Stephens return 0; 766b97bf3fdSPer Liden } 767b97bf3fdSPer Liden 7684323add6SPer Liden int tipc_bclink_init(void) 769b97bf3fdSPer Liden { 7702710b57fSArnaldo Carvalho de Melo bcbearer = kzalloc(sizeof(*bcbearer), GFP_ATOMIC); 7712710b57fSArnaldo Carvalho de Melo bclink = kzalloc(sizeof(*bclink), GFP_ATOMIC); 772b97bf3fdSPer Liden if (!bcbearer || !bclink) { 773b97bf3fdSPer Liden nomem: 774a10bd924SAllan Stephens warn("Multicast link creation failed, no memory\n"); 775b97bf3fdSPer Liden kfree(bcbearer); 776b97bf3fdSPer Liden bcbearer = NULL; 777b97bf3fdSPer Liden kfree(bclink); 778b97bf3fdSPer Liden bclink = NULL; 779b97bf3fdSPer Liden return -ENOMEM; 780b97bf3fdSPer Liden } 781b97bf3fdSPer Liden 782b97bf3fdSPer Liden INIT_LIST_HEAD(&bcbearer->bearer.cong_links); 783b97bf3fdSPer Liden bcbearer->bearer.media = &bcbearer->media; 7844323add6SPer Liden bcbearer->media.send_msg = tipc_bcbearer_send; 785b97bf3fdSPer Liden sprintf(bcbearer->media.name, "tipc-multicast"); 786b97bf3fdSPer Liden 787b97bf3fdSPer Liden bcl = &bclink->link; 788b97bf3fdSPer Liden INIT_LIST_HEAD(&bcl->waiting_ports); 789b97bf3fdSPer Liden bcl->next_out_no = 1; 79034af946aSIngo Molnar spin_lock_init(&bclink->node.lock); 791b97bf3fdSPer Liden bcl->owner = &bclink->node; 792b97bf3fdSPer Liden bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; 7934323add6SPer Liden tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); 794b97bf3fdSPer Liden bcl->b_ptr = &bcbearer->bearer; 795b97bf3fdSPer Liden bcl->state = WORKING_WORKING; 7964b704d59SStephen Hemminger strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME); 797b97bf3fdSPer Liden 798b97bf3fdSPer Liden if (BCLINK_LOG_BUF_SIZE) { 799b97bf3fdSPer Liden char *pb = kmalloc(BCLINK_LOG_BUF_SIZE, GFP_ATOMIC); 800b97bf3fdSPer Liden 801b97bf3fdSPer Liden if (!pb) 802b97bf3fdSPer Liden goto nomem; 8034323add6SPer Liden tipc_printbuf_init(&bcl->print_buf, pb, BCLINK_LOG_BUF_SIZE); 804b97bf3fdSPer Liden } 805b97bf3fdSPer Liden 8060e35fd5eSAllan Stephens return 0; 807b97bf3fdSPer Liden } 808b97bf3fdSPer Liden 8094323add6SPer Liden void tipc_bclink_stop(void) 810b97bf3fdSPer Liden { 811b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 812b97bf3fdSPer Liden if (bcbearer) { 8134323add6SPer Liden tipc_link_stop(bcl); 814b97bf3fdSPer Liden if (BCLINK_LOG_BUF_SIZE) 815b97bf3fdSPer Liden kfree(bcl->print_buf.buf); 816b97bf3fdSPer Liden bcl = NULL; 817b97bf3fdSPer Liden kfree(bclink); 818b97bf3fdSPer Liden bclink = NULL; 819b97bf3fdSPer Liden kfree(bcbearer); 820b97bf3fdSPer Liden bcbearer = NULL; 821b97bf3fdSPer Liden } 822b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 823b97bf3fdSPer Liden } 824b97bf3fdSPer Liden 825