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 84b97bf3fdSPer Liden * @bpairs_temp: array of bearer pairs used during creation of "bpairs" 85b97bf3fdSPer Liden */ 86b97bf3fdSPer Liden 87b97bf3fdSPer Liden struct bcbearer { 88b97bf3fdSPer Liden struct bearer bearer; 89b97bf3fdSPer Liden struct media media; 90b97bf3fdSPer Liden struct bcbearer_pair bpairs[MAX_BEARERS]; 9116cb4b33SPer Liden struct bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1]; 92b97bf3fdSPer Liden }; 93b97bf3fdSPer Liden 94b97bf3fdSPer Liden /** 95b97bf3fdSPer Liden * struct bclink - link used for broadcast messages 96b97bf3fdSPer Liden * @link: (non-standard) broadcast link structure 97b97bf3fdSPer Liden * @node: (non-standard) node structure representing b'cast link's peer node 98b97bf3fdSPer Liden * 99b97bf3fdSPer Liden * Handles sequence numbering, fragmentation, bundling, etc. 100b97bf3fdSPer Liden */ 101b97bf3fdSPer Liden 102b97bf3fdSPer Liden struct bclink { 103b97bf3fdSPer Liden struct link link; 104b97bf3fdSPer Liden struct node node; 105b97bf3fdSPer Liden }; 106b97bf3fdSPer Liden 107b97bf3fdSPer Liden 108b97bf3fdSPer Liden static struct bcbearer *bcbearer = NULL; 109b97bf3fdSPer Liden static struct bclink *bclink = NULL; 110b97bf3fdSPer Liden static struct link *bcl = NULL; 111b97bf3fdSPer Liden static spinlock_t bc_lock = SPIN_LOCK_UNLOCKED; 112b97bf3fdSPer Liden 1134323add6SPer Liden char tipc_bclink_name[] = "multicast-link"; 114b97bf3fdSPer Liden 115b97bf3fdSPer Liden 11605790c64SSam Ravnborg static u32 buf_seqno(struct sk_buff *buf) 117b97bf3fdSPer Liden { 118b97bf3fdSPer Liden return msg_seqno(buf_msg(buf)); 119b97bf3fdSPer Liden } 120b97bf3fdSPer Liden 12105790c64SSam Ravnborg static u32 bcbuf_acks(struct sk_buff *buf) 122b97bf3fdSPer Liden { 123880b005fSDavid S. Miller return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle; 124b97bf3fdSPer Liden } 125b97bf3fdSPer Liden 12605790c64SSam Ravnborg static void bcbuf_set_acks(struct sk_buff *buf, u32 acks) 127b97bf3fdSPer Liden { 128880b005fSDavid S. Miller TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks; 129b97bf3fdSPer Liden } 130b97bf3fdSPer Liden 13105790c64SSam Ravnborg static void bcbuf_decr_acks(struct sk_buff *buf) 132b97bf3fdSPer Liden { 133b97bf3fdSPer Liden bcbuf_set_acks(buf, bcbuf_acks(buf) - 1); 134b97bf3fdSPer Liden } 135b97bf3fdSPer Liden 136b97bf3fdSPer Liden 137b97bf3fdSPer Liden /** 138b97bf3fdSPer Liden * bclink_set_gap - set gap according to contents of current deferred pkt queue 139b97bf3fdSPer Liden * 140b97bf3fdSPer Liden * Called with 'node' locked, bc_lock unlocked 141b97bf3fdSPer Liden */ 142b97bf3fdSPer Liden 14305790c64SSam Ravnborg static void bclink_set_gap(struct node *n_ptr) 144b97bf3fdSPer Liden { 145b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 146b97bf3fdSPer Liden 147b97bf3fdSPer Liden n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 148b97bf3fdSPer Liden mod(n_ptr->bclink.last_in); 149b97bf3fdSPer Liden if (unlikely(buf != NULL)) 150b97bf3fdSPer Liden n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1); 151b97bf3fdSPer Liden } 152b97bf3fdSPer Liden 153b97bf3fdSPer Liden /** 154b97bf3fdSPer Liden * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment 155b97bf3fdSPer Liden * 156b97bf3fdSPer Liden * This mechanism endeavours to prevent all nodes in network from trying 157b97bf3fdSPer Liden * to ACK or NACK at the same time. 158b97bf3fdSPer Liden * 159b97bf3fdSPer Liden * Note: TIPC uses a different trigger to distribute ACKs than it does to 160b97bf3fdSPer Liden * distribute NACKs, but tries to use the same spacing (divide by 16). 161b97bf3fdSPer Liden */ 162b97bf3fdSPer Liden 16305790c64SSam Ravnborg static int bclink_ack_allowed(u32 n) 164b97bf3fdSPer Liden { 165b97bf3fdSPer Liden return((n % TIPC_MIN_LINK_WIN) == tipc_own_tag); 166b97bf3fdSPer Liden } 167b97bf3fdSPer Liden 168b97bf3fdSPer Liden 169b97bf3fdSPer Liden /** 170b97bf3fdSPer Liden * bclink_retransmit_pkt - retransmit broadcast packets 171b97bf3fdSPer Liden * @after: sequence number of last packet to *not* retransmit 172b97bf3fdSPer Liden * @to: sequence number of last packet to retransmit 173b97bf3fdSPer Liden * 174d356eebaSAllan Stephens * Called with bc_lock locked 175b97bf3fdSPer Liden */ 176b97bf3fdSPer Liden 177b97bf3fdSPer Liden static void bclink_retransmit_pkt(u32 after, u32 to) 178b97bf3fdSPer Liden { 179b97bf3fdSPer Liden struct sk_buff *buf; 180b97bf3fdSPer Liden 181b97bf3fdSPer Liden buf = bcl->first_out; 182b97bf3fdSPer Liden while (buf && less_eq(buf_seqno(buf), after)) { 183b97bf3fdSPer Liden buf = buf->next; 184b97bf3fdSPer Liden } 1854323add6SPer Liden tipc_link_retransmit(bcl, buf, mod(to - after)); 186b97bf3fdSPer Liden } 187b97bf3fdSPer Liden 188b97bf3fdSPer Liden /** 1894323add6SPer Liden * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets 190b97bf3fdSPer Liden * @n_ptr: node that sent acknowledgement info 191b97bf3fdSPer Liden * @acked: broadcast sequence # that has been acknowledged 192b97bf3fdSPer Liden * 193b97bf3fdSPer Liden * Node is locked, bc_lock unlocked. 194b97bf3fdSPer Liden */ 195b97bf3fdSPer Liden 1964323add6SPer Liden void tipc_bclink_acknowledge(struct node *n_ptr, u32 acked) 197b97bf3fdSPer Liden { 198b97bf3fdSPer Liden struct sk_buff *crs; 199b97bf3fdSPer Liden struct sk_buff *next; 200b97bf3fdSPer Liden unsigned int released = 0; 201b97bf3fdSPer Liden 202b97bf3fdSPer Liden if (less_eq(acked, n_ptr->bclink.acked)) 203b97bf3fdSPer Liden return; 204b97bf3fdSPer Liden 205b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 206b97bf3fdSPer Liden 207b97bf3fdSPer Liden /* Skip over packets that node has previously acknowledged */ 208b97bf3fdSPer Liden 209b97bf3fdSPer Liden crs = bcl->first_out; 210b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) { 211b97bf3fdSPer Liden crs = crs->next; 212b97bf3fdSPer Liden } 213b97bf3fdSPer Liden 214b97bf3fdSPer Liden /* Update packets that node is now acknowledging */ 215b97bf3fdSPer Liden 216b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), acked)) { 217b97bf3fdSPer Liden next = crs->next; 218b97bf3fdSPer Liden bcbuf_decr_acks(crs); 219b97bf3fdSPer Liden if (bcbuf_acks(crs) == 0) { 220b97bf3fdSPer Liden bcl->first_out = next; 221b97bf3fdSPer Liden bcl->out_queue_size--; 222b97bf3fdSPer Liden buf_discard(crs); 223b97bf3fdSPer Liden released = 1; 224b97bf3fdSPer Liden } 225b97bf3fdSPer Liden crs = next; 226b97bf3fdSPer Liden } 227b97bf3fdSPer Liden n_ptr->bclink.acked = acked; 228b97bf3fdSPer Liden 229b97bf3fdSPer Liden /* Try resolving broadcast link congestion, if necessary */ 230b97bf3fdSPer Liden 231b97bf3fdSPer Liden if (unlikely(bcl->next_out)) 2324323add6SPer Liden tipc_link_push_queue(bcl); 233b97bf3fdSPer Liden if (unlikely(released && !list_empty(&bcl->waiting_ports))) 2344323add6SPer Liden tipc_link_wakeup_ports(bcl, 0); 235b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 236b97bf3fdSPer Liden } 237b97bf3fdSPer Liden 238b97bf3fdSPer Liden /** 239b97bf3fdSPer Liden * bclink_send_ack - unicast an ACK msg 240b97bf3fdSPer Liden * 2414323add6SPer Liden * tipc_net_lock and node lock set 242b97bf3fdSPer Liden */ 243b97bf3fdSPer Liden 244b97bf3fdSPer Liden static void bclink_send_ack(struct node *n_ptr) 245b97bf3fdSPer Liden { 246b97bf3fdSPer Liden struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1]; 247b97bf3fdSPer Liden 248b97bf3fdSPer Liden if (l_ptr != NULL) 2494323add6SPer Liden tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0); 250b97bf3fdSPer Liden } 251b97bf3fdSPer Liden 252b97bf3fdSPer Liden /** 253b97bf3fdSPer Liden * bclink_send_nack- broadcast a NACK msg 254b97bf3fdSPer Liden * 2554323add6SPer Liden * tipc_net_lock and node lock set 256b97bf3fdSPer Liden */ 257b97bf3fdSPer Liden 258b97bf3fdSPer Liden static void bclink_send_nack(struct node *n_ptr) 259b97bf3fdSPer Liden { 260b97bf3fdSPer Liden struct sk_buff *buf; 261b97bf3fdSPer Liden struct tipc_msg *msg; 262b97bf3fdSPer Liden 263b97bf3fdSPer Liden if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to)) 264b97bf3fdSPer Liden return; 265b97bf3fdSPer Liden 266b97bf3fdSPer Liden buf = buf_acquire(INT_H_SIZE); 267b97bf3fdSPer Liden if (buf) { 268b97bf3fdSPer Liden msg = buf_msg(buf); 269b97bf3fdSPer Liden msg_init(msg, BCAST_PROTOCOL, STATE_MSG, 270b97bf3fdSPer Liden TIPC_OK, INT_H_SIZE, n_ptr->addr); 271b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 272b97bf3fdSPer Liden msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in)); 273b97bf3fdSPer Liden msg_set_bcgap_after(msg, n_ptr->bclink.gap_after); 274b97bf3fdSPer Liden msg_set_bcgap_to(msg, n_ptr->bclink.gap_to); 275b97bf3fdSPer Liden msg_set_bcast_tag(msg, tipc_own_tag); 276b97bf3fdSPer Liden 2771fc54d8fSSam Ravnborg if (tipc_bearer_send(&bcbearer->bearer, buf, NULL)) { 278b97bf3fdSPer Liden bcl->stats.sent_nacks++; 279b97bf3fdSPer Liden buf_discard(buf); 280b97bf3fdSPer Liden } else { 2814323add6SPer Liden tipc_bearer_schedule(bcl->b_ptr, bcl); 282b97bf3fdSPer Liden bcl->proto_msg_queue = buf; 283b97bf3fdSPer Liden bcl->stats.bearer_congs++; 284b97bf3fdSPer Liden } 285b97bf3fdSPer Liden 286b97bf3fdSPer Liden /* 287b97bf3fdSPer Liden * Ensure we doesn't send another NACK msg to the node 288b97bf3fdSPer Liden * until 16 more deferred messages arrive from it 289b97bf3fdSPer Liden * (i.e. helps prevent all nodes from NACK'ing at same time) 290b97bf3fdSPer Liden */ 291b97bf3fdSPer Liden 292b97bf3fdSPer Liden n_ptr->bclink.nack_sync = tipc_own_tag; 293b97bf3fdSPer Liden } 294b97bf3fdSPer Liden } 295b97bf3fdSPer Liden 296b97bf3fdSPer Liden /** 2974323add6SPer Liden * tipc_bclink_check_gap - send a NACK if a sequence gap exists 298b97bf3fdSPer Liden * 2994323add6SPer Liden * tipc_net_lock and node lock set 300b97bf3fdSPer Liden */ 301b97bf3fdSPer Liden 3024323add6SPer Liden void tipc_bclink_check_gap(struct node *n_ptr, u32 last_sent) 303b97bf3fdSPer Liden { 304b97bf3fdSPer Liden if (!n_ptr->bclink.supported || 305b97bf3fdSPer Liden less_eq(last_sent, mod(n_ptr->bclink.last_in))) 306b97bf3fdSPer Liden return; 307b97bf3fdSPer Liden 308b97bf3fdSPer Liden bclink_set_gap(n_ptr); 309b97bf3fdSPer Liden if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to) 310b97bf3fdSPer Liden n_ptr->bclink.gap_to = last_sent; 311b97bf3fdSPer Liden bclink_send_nack(n_ptr); 312b97bf3fdSPer Liden } 313b97bf3fdSPer Liden 314b97bf3fdSPer Liden /** 3154323add6SPer Liden * tipc_bclink_peek_nack - process a NACK msg meant for another node 316b97bf3fdSPer Liden * 3174323add6SPer Liden * Only tipc_net_lock set. 318b97bf3fdSPer Liden */ 319b97bf3fdSPer Liden 320988f088aSAdrian Bunk static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to) 321b97bf3fdSPer Liden { 3224323add6SPer Liden struct node *n_ptr = tipc_node_find(dest); 323b97bf3fdSPer Liden u32 my_after, my_to; 324b97bf3fdSPer Liden 3254323add6SPer Liden if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr))) 326b97bf3fdSPer Liden return; 3274323add6SPer Liden tipc_node_lock(n_ptr); 328b97bf3fdSPer Liden /* 329b97bf3fdSPer Liden * Modify gap to suppress unnecessary NACKs from this node 330b97bf3fdSPer Liden */ 331b97bf3fdSPer Liden my_after = n_ptr->bclink.gap_after; 332b97bf3fdSPer Liden my_to = n_ptr->bclink.gap_to; 333b97bf3fdSPer Liden 334b97bf3fdSPer Liden if (less_eq(gap_after, my_after)) { 335b97bf3fdSPer Liden if (less(my_after, gap_to) && less(gap_to, my_to)) 336b97bf3fdSPer Liden n_ptr->bclink.gap_after = gap_to; 337b97bf3fdSPer Liden else if (less_eq(my_to, gap_to)) 338b97bf3fdSPer Liden n_ptr->bclink.gap_to = n_ptr->bclink.gap_after; 339b97bf3fdSPer Liden } else if (less_eq(gap_after, my_to)) { 340b97bf3fdSPer Liden if (less_eq(my_to, gap_to)) 341b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 342b97bf3fdSPer Liden } else { 343b97bf3fdSPer Liden /* 344b97bf3fdSPer Liden * Expand gap if missing bufs not in deferred queue: 345b97bf3fdSPer Liden */ 346b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 347b97bf3fdSPer Liden u32 prev = n_ptr->bclink.gap_to; 348b97bf3fdSPer Liden 349b97bf3fdSPer Liden for (; buf; buf = buf->next) { 350b97bf3fdSPer Liden u32 seqno = buf_seqno(buf); 351b97bf3fdSPer Liden 3523ac90216SEric Sesterhenn if (mod(seqno - prev) != 1) { 353b97bf3fdSPer Liden buf = NULL; 3543ac90216SEric Sesterhenn break; 3553ac90216SEric Sesterhenn } 356b97bf3fdSPer Liden if (seqno == gap_after) 357b97bf3fdSPer Liden break; 358b97bf3fdSPer Liden prev = seqno; 359b97bf3fdSPer Liden } 360b97bf3fdSPer Liden if (buf == NULL) 361b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 362b97bf3fdSPer Liden } 363b97bf3fdSPer Liden /* 364b97bf3fdSPer Liden * Some nodes may send a complementary NACK now: 365b97bf3fdSPer Liden */ 366b97bf3fdSPer Liden if (bclink_ack_allowed(sender_tag + 1)) { 367b97bf3fdSPer Liden if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) { 368b97bf3fdSPer Liden bclink_send_nack(n_ptr); 369b97bf3fdSPer Liden bclink_set_gap(n_ptr); 370b97bf3fdSPer Liden } 371b97bf3fdSPer Liden } 3724323add6SPer Liden tipc_node_unlock(n_ptr); 373b97bf3fdSPer Liden } 374b97bf3fdSPer Liden 375b97bf3fdSPer Liden /** 3764323add6SPer Liden * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster 377b97bf3fdSPer Liden */ 378b97bf3fdSPer Liden 3794323add6SPer Liden int tipc_bclink_send_msg(struct sk_buff *buf) 380b97bf3fdSPer Liden { 381b97bf3fdSPer Liden int res; 382b97bf3fdSPer Liden 383b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 384b97bf3fdSPer Liden 3854323add6SPer Liden res = tipc_link_send_buf(bcl, buf); 386b97bf3fdSPer Liden if (unlikely(res == -ELINKCONG)) 387b97bf3fdSPer Liden buf_discard(buf); 388b97bf3fdSPer Liden else 389b97bf3fdSPer Liden bcl->stats.sent_info++; 390b97bf3fdSPer Liden 391b97bf3fdSPer Liden if (bcl->out_queue_size > bcl->stats.max_queue_sz) 392b97bf3fdSPer Liden bcl->stats.max_queue_sz = bcl->out_queue_size; 393b97bf3fdSPer Liden bcl->stats.queue_sz_counts++; 394b97bf3fdSPer Liden bcl->stats.accu_queue_sz += bcl->out_queue_size; 395b97bf3fdSPer Liden 396b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 397b97bf3fdSPer Liden return res; 398b97bf3fdSPer Liden } 399b97bf3fdSPer Liden 400b97bf3fdSPer Liden /** 4014323add6SPer Liden * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards 402b97bf3fdSPer Liden * 4034323add6SPer Liden * tipc_net_lock is read_locked, no other locks set 404b97bf3fdSPer Liden */ 405b97bf3fdSPer Liden 4064323add6SPer Liden void tipc_bclink_recv_pkt(struct sk_buff *buf) 407b97bf3fdSPer Liden { 408d356eebaSAllan Stephens #if (TIPC_BCAST_LOSS_RATE) 409d356eebaSAllan Stephens static int rx_count = 0; 410d356eebaSAllan Stephens #endif 411b97bf3fdSPer Liden struct tipc_msg *msg = buf_msg(buf); 4124323add6SPer Liden struct node* node = tipc_node_find(msg_prevnode(msg)); 413b97bf3fdSPer Liden u32 next_in; 414b97bf3fdSPer Liden u32 seqno; 415b97bf3fdSPer Liden struct sk_buff *deferred; 416b97bf3fdSPer Liden 417b97bf3fdSPer Liden msg_dbg(msg, "<BC<<<"); 418b97bf3fdSPer Liden 4194323add6SPer Liden if (unlikely(!node || !tipc_node_is_up(node) || !node->bclink.supported || 420b97bf3fdSPer Liden (msg_mc_netid(msg) != tipc_net_id))) { 421b97bf3fdSPer Liden buf_discard(buf); 422b97bf3fdSPer Liden return; 423b97bf3fdSPer Liden } 424b97bf3fdSPer Liden 425b97bf3fdSPer Liden if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { 426b97bf3fdSPer Liden msg_dbg(msg, "<BCNACK<<<"); 427b97bf3fdSPer Liden if (msg_destnode(msg) == tipc_own_addr) { 4284323add6SPer Liden tipc_node_lock(node); 4294323add6SPer Liden tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); 4304323add6SPer Liden tipc_node_unlock(node); 431d356eebaSAllan Stephens spin_lock_bh(&bc_lock); 432b97bf3fdSPer Liden bcl->stats.recv_nacks++; 433d356eebaSAllan Stephens bcl->owner->next = node; /* remember requestor */ 434b97bf3fdSPer Liden bclink_retransmit_pkt(msg_bcgap_after(msg), 435b97bf3fdSPer Liden msg_bcgap_to(msg)); 436d356eebaSAllan Stephens bcl->owner->next = NULL; 437d356eebaSAllan Stephens spin_unlock_bh(&bc_lock); 438b97bf3fdSPer Liden } else { 4394323add6SPer Liden tipc_bclink_peek_nack(msg_destnode(msg), 440b97bf3fdSPer Liden msg_bcast_tag(msg), 441b97bf3fdSPer Liden msg_bcgap_after(msg), 442b97bf3fdSPer Liden msg_bcgap_to(msg)); 443b97bf3fdSPer Liden } 444b97bf3fdSPer Liden buf_discard(buf); 445b97bf3fdSPer Liden return; 446b97bf3fdSPer Liden } 447b97bf3fdSPer Liden 448d356eebaSAllan Stephens #if (TIPC_BCAST_LOSS_RATE) 449d356eebaSAllan Stephens if (++rx_count == TIPC_BCAST_LOSS_RATE) { 450d356eebaSAllan Stephens rx_count = 0; 451d356eebaSAllan Stephens buf_discard(buf); 452d356eebaSAllan Stephens return; 453d356eebaSAllan Stephens } 454d356eebaSAllan Stephens #endif 455d356eebaSAllan Stephens 4564323add6SPer Liden tipc_node_lock(node); 457b97bf3fdSPer Liden receive: 458b97bf3fdSPer Liden deferred = node->bclink.deferred_head; 459b97bf3fdSPer Liden next_in = mod(node->bclink.last_in + 1); 460b97bf3fdSPer Liden seqno = msg_seqno(msg); 461b97bf3fdSPer Liden 462b97bf3fdSPer Liden if (likely(seqno == next_in)) { 463b97bf3fdSPer Liden bcl->stats.recv_info++; 464b97bf3fdSPer Liden node->bclink.last_in++; 465b97bf3fdSPer Liden bclink_set_gap(node); 466b97bf3fdSPer Liden if (unlikely(bclink_ack_allowed(seqno))) { 467b97bf3fdSPer Liden bclink_send_ack(node); 468b97bf3fdSPer Liden bcl->stats.sent_acks++; 469b97bf3fdSPer Liden } 470b97bf3fdSPer Liden if (likely(msg_isdata(msg))) { 4714323add6SPer Liden tipc_node_unlock(node); 4724323add6SPer Liden tipc_port_recv_mcast(buf, NULL); 473b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_BUNDLER) { 474b97bf3fdSPer Liden bcl->stats.recv_bundles++; 475b97bf3fdSPer Liden bcl->stats.recv_bundled += msg_msgcnt(msg); 4764323add6SPer Liden tipc_node_unlock(node); 4774323add6SPer Liden tipc_link_recv_bundle(buf); 478b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_FRAGMENTER) { 479b97bf3fdSPer Liden bcl->stats.recv_fragments++; 4804323add6SPer Liden if (tipc_link_recv_fragment(&node->bclink.defragm, 481b97bf3fdSPer Liden &buf, &msg)) 482b97bf3fdSPer Liden bcl->stats.recv_fragmented++; 4834323add6SPer Liden tipc_node_unlock(node); 4844323add6SPer Liden tipc_net_route_msg(buf); 485b97bf3fdSPer Liden } else { 4864323add6SPer Liden tipc_node_unlock(node); 4874323add6SPer Liden tipc_net_route_msg(buf); 488b97bf3fdSPer Liden } 489b97bf3fdSPer Liden if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) { 4904323add6SPer Liden tipc_node_lock(node); 491b97bf3fdSPer Liden buf = deferred; 492b97bf3fdSPer Liden msg = buf_msg(buf); 493b97bf3fdSPer Liden node->bclink.deferred_head = deferred->next; 494b97bf3fdSPer Liden goto receive; 495b97bf3fdSPer Liden } 496b97bf3fdSPer Liden return; 497b97bf3fdSPer Liden } else if (less(next_in, seqno)) { 498b97bf3fdSPer Liden u32 gap_after = node->bclink.gap_after; 499b97bf3fdSPer Liden u32 gap_to = node->bclink.gap_to; 500b97bf3fdSPer Liden 5014323add6SPer Liden if (tipc_link_defer_pkt(&node->bclink.deferred_head, 502b97bf3fdSPer Liden &node->bclink.deferred_tail, 503b97bf3fdSPer Liden buf)) { 504b97bf3fdSPer Liden node->bclink.nack_sync++; 505b97bf3fdSPer Liden bcl->stats.deferred_recv++; 506b97bf3fdSPer Liden if (seqno == mod(gap_after + 1)) 507b97bf3fdSPer Liden node->bclink.gap_after = seqno; 508b97bf3fdSPer Liden else if (less(gap_after, seqno) && less(seqno, gap_to)) 509b97bf3fdSPer Liden node->bclink.gap_to = seqno; 510b97bf3fdSPer Liden } 511b97bf3fdSPer Liden if (bclink_ack_allowed(node->bclink.nack_sync)) { 512b97bf3fdSPer Liden if (gap_to != gap_after) 513b97bf3fdSPer Liden bclink_send_nack(node); 514b97bf3fdSPer Liden bclink_set_gap(node); 515b97bf3fdSPer Liden } 516b97bf3fdSPer Liden } else { 517b97bf3fdSPer Liden bcl->stats.duplicates++; 518b97bf3fdSPer Liden buf_discard(buf); 519b97bf3fdSPer Liden } 5204323add6SPer Liden tipc_node_unlock(node); 521b97bf3fdSPer Liden } 522b97bf3fdSPer Liden 5234323add6SPer Liden u32 tipc_bclink_get_last_sent(void) 524b97bf3fdSPer Liden { 525b97bf3fdSPer Liden u32 last_sent = mod(bcl->next_out_no - 1); 526b97bf3fdSPer Liden 527b97bf3fdSPer Liden if (bcl->next_out) 528b97bf3fdSPer Liden last_sent = mod(buf_seqno(bcl->next_out) - 1); 529b97bf3fdSPer Liden return last_sent; 530b97bf3fdSPer Liden } 531b97bf3fdSPer Liden 5324323add6SPer Liden u32 tipc_bclink_acks_missing(struct node *n_ptr) 533b97bf3fdSPer Liden { 534b97bf3fdSPer Liden return (n_ptr->bclink.supported && 5354323add6SPer Liden (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); 536b97bf3fdSPer Liden } 537b97bf3fdSPer Liden 538b97bf3fdSPer Liden 539b97bf3fdSPer Liden /** 5404323add6SPer Liden * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer 541b97bf3fdSPer Liden * 542b97bf3fdSPer Liden * Send through as many bearers as necessary to reach all nodes 543b97bf3fdSPer Liden * that support TIPC multicasting. 544b97bf3fdSPer Liden * 545b97bf3fdSPer Liden * Returns 0 if packet sent successfully, non-zero if not 546b97bf3fdSPer Liden */ 547b97bf3fdSPer Liden 548988f088aSAdrian Bunk static int tipc_bcbearer_send(struct sk_buff *buf, 549b97bf3fdSPer Liden struct tipc_bearer *unused1, 550b97bf3fdSPer Liden struct tipc_media_addr *unused2) 551b97bf3fdSPer Liden { 552b97bf3fdSPer Liden static int send_count = 0; 553b97bf3fdSPer Liden 554de70c5baSPer Liden struct node_map *remains; 555de70c5baSPer Liden struct node_map *remains_new; 556de70c5baSPer Liden struct node_map *remains_tmp; 557b97bf3fdSPer Liden int bp_index; 558b97bf3fdSPer Liden int swap_time; 559de70c5baSPer Liden int err; 560b97bf3fdSPer Liden 561b97bf3fdSPer Liden /* Prepare buffer for broadcasting (if first time trying to send it) */ 562b97bf3fdSPer Liden 563b97bf3fdSPer Liden if (likely(!msg_non_seq(buf_msg(buf)))) { 564b97bf3fdSPer Liden struct tipc_msg *msg; 565b97bf3fdSPer Liden 5664323add6SPer Liden assert(tipc_cltr_bcast_nodes.count != 0); 5674323add6SPer Liden bcbuf_set_acks(buf, tipc_cltr_bcast_nodes.count); 568b97bf3fdSPer Liden msg = buf_msg(buf); 569b97bf3fdSPer Liden msg_set_non_seq(msg); 570b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 571b97bf3fdSPer Liden } 572b97bf3fdSPer Liden 573b97bf3fdSPer Liden /* Determine if bearer pairs should be swapped following this attempt */ 574b97bf3fdSPer Liden 575b97bf3fdSPer Liden if ((swap_time = (++send_count >= 10))) 576b97bf3fdSPer Liden send_count = 0; 577b97bf3fdSPer Liden 578b97bf3fdSPer Liden /* Send buffer over bearers until all targets reached */ 579b97bf3fdSPer Liden 580de70c5baSPer Liden remains = kmalloc(sizeof(struct node_map), GFP_ATOMIC); 581de70c5baSPer Liden remains_new = kmalloc(sizeof(struct node_map), GFP_ATOMIC); 582de70c5baSPer Liden *remains = tipc_cltr_bcast_nodes; 583b97bf3fdSPer Liden 584b97bf3fdSPer Liden for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { 585b97bf3fdSPer Liden struct bearer *p = bcbearer->bpairs[bp_index].primary; 586b97bf3fdSPer Liden struct bearer *s = bcbearer->bpairs[bp_index].secondary; 587b97bf3fdSPer Liden 588b97bf3fdSPer Liden if (!p) 589b97bf3fdSPer Liden break; /* no more bearers to try */ 590b97bf3fdSPer Liden 591de70c5baSPer Liden tipc_nmap_diff(remains, &p->nodes, remains_new); 592de70c5baSPer Liden if (remains_new->count == remains->count) 593b97bf3fdSPer Liden continue; /* bearer pair doesn't add anything */ 594b97bf3fdSPer Liden 595b97bf3fdSPer Liden if (!p->publ.blocked && 596b97bf3fdSPer Liden !p->media->send_msg(buf, &p->publ, &p->media->bcast_addr)) { 597b97bf3fdSPer Liden if (swap_time && s && !s->publ.blocked) 598b97bf3fdSPer Liden goto swap; 599b97bf3fdSPer Liden else 600b97bf3fdSPer Liden goto update; 601b97bf3fdSPer Liden } 602b97bf3fdSPer Liden 603b97bf3fdSPer Liden if (!s || s->publ.blocked || 604b97bf3fdSPer Liden s->media->send_msg(buf, &s->publ, &s->media->bcast_addr)) 605b97bf3fdSPer Liden continue; /* unable to send using bearer pair */ 606b97bf3fdSPer Liden swap: 607b97bf3fdSPer Liden bcbearer->bpairs[bp_index].primary = s; 608b97bf3fdSPer Liden bcbearer->bpairs[bp_index].secondary = p; 609b97bf3fdSPer Liden update: 610de70c5baSPer Liden if (remains_new->count == 0) { 611de70c5baSPer Liden err = TIPC_OK; 612de70c5baSPer Liden goto out; 613de70c5baSPer Liden } 614b97bf3fdSPer Liden 615de70c5baSPer Liden /* swap map */ 616de70c5baSPer Liden remains_tmp = remains; 617b97bf3fdSPer Liden remains = remains_new; 618de70c5baSPer Liden remains_new = remains_tmp; 619b97bf3fdSPer Liden } 620b97bf3fdSPer Liden 621b97bf3fdSPer Liden /* Unable to reach all targets */ 622b97bf3fdSPer Liden 623b97bf3fdSPer Liden bcbearer->bearer.publ.blocked = 1; 624b97bf3fdSPer Liden bcl->stats.bearer_congs++; 625de70c5baSPer Liden err = ~TIPC_OK; 626de70c5baSPer Liden 627de70c5baSPer Liden out: 628de70c5baSPer Liden kfree(remains_new); 629de70c5baSPer Liden kfree(remains); 630de70c5baSPer Liden return err; 631b97bf3fdSPer Liden } 632b97bf3fdSPer Liden 633b97bf3fdSPer Liden /** 6344323add6SPer Liden * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer 635b97bf3fdSPer Liden */ 636b97bf3fdSPer Liden 6374323add6SPer Liden void tipc_bcbearer_sort(void) 638b97bf3fdSPer Liden { 639b97bf3fdSPer Liden struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp; 640b97bf3fdSPer Liden struct bcbearer_pair *bp_curr; 641b97bf3fdSPer Liden int b_index; 642b97bf3fdSPer Liden int pri; 643b97bf3fdSPer Liden 644b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 645b97bf3fdSPer Liden 646b97bf3fdSPer Liden /* Group bearers by priority (can assume max of two per priority) */ 647b97bf3fdSPer Liden 648b97bf3fdSPer Liden memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); 649b97bf3fdSPer Liden 650b97bf3fdSPer Liden for (b_index = 0; b_index < MAX_BEARERS; b_index++) { 6514323add6SPer Liden struct bearer *b = &tipc_bearers[b_index]; 652b97bf3fdSPer Liden 653b97bf3fdSPer Liden if (!b->active || !b->nodes.count) 654b97bf3fdSPer Liden continue; 655b97bf3fdSPer Liden 656b97bf3fdSPer Liden if (!bp_temp[b->priority].primary) 657b97bf3fdSPer Liden bp_temp[b->priority].primary = b; 658b97bf3fdSPer Liden else 659b97bf3fdSPer Liden bp_temp[b->priority].secondary = b; 660b97bf3fdSPer Liden } 661b97bf3fdSPer Liden 662b97bf3fdSPer Liden /* Create array of bearer pairs for broadcasting */ 663b97bf3fdSPer Liden 664b97bf3fdSPer Liden bp_curr = bcbearer->bpairs; 665b97bf3fdSPer Liden memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); 666b97bf3fdSPer Liden 66716cb4b33SPer Liden for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { 668b97bf3fdSPer Liden 669b97bf3fdSPer Liden if (!bp_temp[pri].primary) 670b97bf3fdSPer Liden continue; 671b97bf3fdSPer Liden 672b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].primary; 673b97bf3fdSPer Liden 674b97bf3fdSPer Liden if (bp_temp[pri].secondary) { 6754323add6SPer Liden if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, 676b97bf3fdSPer Liden &bp_temp[pri].secondary->nodes)) { 677b97bf3fdSPer Liden bp_curr->secondary = bp_temp[pri].secondary; 678b97bf3fdSPer Liden } else { 679b97bf3fdSPer Liden bp_curr++; 680b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].secondary; 681b97bf3fdSPer Liden } 682b97bf3fdSPer Liden } 683b97bf3fdSPer Liden 684b97bf3fdSPer Liden bp_curr++; 685b97bf3fdSPer Liden } 686b97bf3fdSPer Liden 687b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 688b97bf3fdSPer Liden } 689b97bf3fdSPer Liden 690b97bf3fdSPer Liden /** 6914323add6SPer Liden * tipc_bcbearer_push - resolve bearer congestion 692b97bf3fdSPer Liden * 693b97bf3fdSPer Liden * Forces bclink to push out any unsent packets, until all packets are gone 694b97bf3fdSPer Liden * or congestion reoccurs. 695b97bf3fdSPer Liden * No locks set when function called 696b97bf3fdSPer Liden */ 697b97bf3fdSPer Liden 6984323add6SPer Liden void tipc_bcbearer_push(void) 699b97bf3fdSPer Liden { 700b97bf3fdSPer Liden struct bearer *b_ptr; 701b97bf3fdSPer Liden 702b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 703b97bf3fdSPer Liden b_ptr = &bcbearer->bearer; 704b97bf3fdSPer Liden if (b_ptr->publ.blocked) { 705b97bf3fdSPer Liden b_ptr->publ.blocked = 0; 7064323add6SPer Liden tipc_bearer_lock_push(b_ptr); 707b97bf3fdSPer Liden } 708b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 709b97bf3fdSPer Liden } 710b97bf3fdSPer Liden 711b97bf3fdSPer Liden 7124323add6SPer Liden int tipc_bclink_stats(char *buf, const u32 buf_size) 713b97bf3fdSPer Liden { 714b97bf3fdSPer Liden struct print_buf pb; 715b97bf3fdSPer Liden 716b97bf3fdSPer Liden if (!bcl) 717b97bf3fdSPer Liden return 0; 718b97bf3fdSPer Liden 7194323add6SPer Liden tipc_printbuf_init(&pb, buf, buf_size); 720b97bf3fdSPer Liden 721b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 722b97bf3fdSPer Liden 723b97bf3fdSPer Liden tipc_printf(&pb, "Link <%s>\n" 724b97bf3fdSPer Liden " Window:%u packets\n", 725b97bf3fdSPer Liden bcl->name, bcl->queue_limit[0]); 726b97bf3fdSPer Liden tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n", 727b97bf3fdSPer Liden bcl->stats.recv_info, 728b97bf3fdSPer Liden bcl->stats.recv_fragments, 729b97bf3fdSPer Liden bcl->stats.recv_fragmented, 730b97bf3fdSPer Liden bcl->stats.recv_bundles, 731b97bf3fdSPer Liden bcl->stats.recv_bundled); 732b97bf3fdSPer Liden tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n", 733b97bf3fdSPer Liden bcl->stats.sent_info, 734b97bf3fdSPer Liden bcl->stats.sent_fragments, 735b97bf3fdSPer Liden bcl->stats.sent_fragmented, 736b97bf3fdSPer Liden bcl->stats.sent_bundles, 737b97bf3fdSPer Liden bcl->stats.sent_bundled); 738b97bf3fdSPer Liden tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n", 739b97bf3fdSPer Liden bcl->stats.recv_nacks, 740b97bf3fdSPer Liden bcl->stats.deferred_recv, 741b97bf3fdSPer Liden bcl->stats.duplicates); 742b97bf3fdSPer Liden tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n", 743b97bf3fdSPer Liden bcl->stats.sent_nacks, 744b97bf3fdSPer Liden bcl->stats.sent_acks, 745b97bf3fdSPer Liden bcl->stats.retransmitted); 746b97bf3fdSPer Liden tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n", 747b97bf3fdSPer Liden bcl->stats.bearer_congs, 748b97bf3fdSPer Liden bcl->stats.link_congs, 749b97bf3fdSPer Liden bcl->stats.max_queue_sz, 750b97bf3fdSPer Liden bcl->stats.queue_sz_counts 751b97bf3fdSPer Liden ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts) 752b97bf3fdSPer Liden : 0); 753b97bf3fdSPer Liden 754b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7554323add6SPer Liden return tipc_printbuf_validate(&pb); 756b97bf3fdSPer Liden } 757b97bf3fdSPer Liden 7584323add6SPer Liden int tipc_bclink_reset_stats(void) 759b97bf3fdSPer Liden { 760b97bf3fdSPer Liden if (!bcl) 761b97bf3fdSPer Liden return -ENOPROTOOPT; 762b97bf3fdSPer Liden 763b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 764b97bf3fdSPer Liden memset(&bcl->stats, 0, sizeof(bcl->stats)); 765b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 766b97bf3fdSPer Liden return TIPC_OK; 767b97bf3fdSPer Liden } 768b97bf3fdSPer Liden 7694323add6SPer Liden int tipc_bclink_set_queue_limits(u32 limit) 770b97bf3fdSPer Liden { 771b97bf3fdSPer Liden if (!bcl) 772b97bf3fdSPer Liden return -ENOPROTOOPT; 773b97bf3fdSPer Liden if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) 774b97bf3fdSPer Liden return -EINVAL; 775b97bf3fdSPer Liden 776b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 7774323add6SPer Liden tipc_link_set_queue_limits(bcl, limit); 778b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 779b97bf3fdSPer Liden return TIPC_OK; 780b97bf3fdSPer Liden } 781b97bf3fdSPer Liden 7824323add6SPer Liden int tipc_bclink_init(void) 783b97bf3fdSPer Liden { 784b97bf3fdSPer Liden bcbearer = kmalloc(sizeof(*bcbearer), GFP_ATOMIC); 785b97bf3fdSPer Liden bclink = kmalloc(sizeof(*bclink), GFP_ATOMIC); 786b97bf3fdSPer Liden if (!bcbearer || !bclink) { 787b97bf3fdSPer Liden nomem: 788b97bf3fdSPer Liden warn("Memory squeeze; Failed to create multicast link\n"); 789b97bf3fdSPer Liden kfree(bcbearer); 790b97bf3fdSPer Liden bcbearer = NULL; 791b97bf3fdSPer Liden kfree(bclink); 792b97bf3fdSPer Liden bclink = NULL; 793b97bf3fdSPer Liden return -ENOMEM; 794b97bf3fdSPer Liden } 795b97bf3fdSPer Liden 796b97bf3fdSPer Liden memset(bcbearer, 0, sizeof(struct bcbearer)); 797b97bf3fdSPer Liden INIT_LIST_HEAD(&bcbearer->bearer.cong_links); 798b97bf3fdSPer Liden bcbearer->bearer.media = &bcbearer->media; 7994323add6SPer Liden bcbearer->media.send_msg = tipc_bcbearer_send; 800b97bf3fdSPer Liden sprintf(bcbearer->media.name, "tipc-multicast"); 801b97bf3fdSPer Liden 802b97bf3fdSPer Liden bcl = &bclink->link; 803b97bf3fdSPer Liden memset(bclink, 0, sizeof(struct bclink)); 804b97bf3fdSPer Liden INIT_LIST_HEAD(&bcl->waiting_ports); 805b97bf3fdSPer Liden bcl->next_out_no = 1; 806b97bf3fdSPer Liden bclink->node.lock = SPIN_LOCK_UNLOCKED; 807b97bf3fdSPer Liden bcl->owner = &bclink->node; 808b97bf3fdSPer Liden bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; 8094323add6SPer Liden tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); 810b97bf3fdSPer Liden bcl->b_ptr = &bcbearer->bearer; 811b97bf3fdSPer Liden bcl->state = WORKING_WORKING; 8124323add6SPer Liden sprintf(bcl->name, tipc_bclink_name); 813b97bf3fdSPer Liden 814b97bf3fdSPer Liden if (BCLINK_LOG_BUF_SIZE) { 815b97bf3fdSPer Liden char *pb = kmalloc(BCLINK_LOG_BUF_SIZE, GFP_ATOMIC); 816b97bf3fdSPer Liden 817b97bf3fdSPer Liden if (!pb) 818b97bf3fdSPer Liden goto nomem; 8194323add6SPer Liden tipc_printbuf_init(&bcl->print_buf, pb, BCLINK_LOG_BUF_SIZE); 820b97bf3fdSPer Liden } 821b97bf3fdSPer Liden 822b97bf3fdSPer Liden return TIPC_OK; 823b97bf3fdSPer Liden } 824b97bf3fdSPer Liden 8254323add6SPer Liden void tipc_bclink_stop(void) 826b97bf3fdSPer Liden { 827b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 828b97bf3fdSPer Liden if (bcbearer) { 8294323add6SPer Liden tipc_link_stop(bcl); 830b97bf3fdSPer Liden if (BCLINK_LOG_BUF_SIZE) 831b97bf3fdSPer Liden kfree(bcl->print_buf.buf); 832b97bf3fdSPer Liden bcl = NULL; 833b97bf3fdSPer Liden kfree(bclink); 834b97bf3fdSPer Liden bclink = NULL; 835b97bf3fdSPer Liden kfree(bcbearer); 836b97bf3fdSPer Liden bcbearer = NULL; 837b97bf3fdSPer Liden } 838b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 839b97bf3fdSPer Liden } 840b97bf3fdSPer Liden 841