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 53b97bf3fdSPer Liden #define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */ 54b97bf3fdSPer Liden 55b97bf3fdSPer Liden #define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */ 56b97bf3fdSPer Liden 57b97bf3fdSPer Liden #define BCLINK_LOG_BUF_SIZE 0 58b97bf3fdSPer Liden 59b97bf3fdSPer Liden /** 60b97bf3fdSPer Liden * struct bcbearer_pair - a pair of bearers used by broadcast link 61b97bf3fdSPer Liden * @primary: pointer to primary bearer 62b97bf3fdSPer Liden * @secondary: pointer to secondary bearer 63b97bf3fdSPer Liden * 64b97bf3fdSPer Liden * Bearers must have same priority and same set of reachable destinations 65b97bf3fdSPer Liden * to be paired. 66b97bf3fdSPer Liden */ 67b97bf3fdSPer Liden 68b97bf3fdSPer Liden struct bcbearer_pair { 69b97bf3fdSPer Liden struct bearer *primary; 70b97bf3fdSPer Liden struct bearer *secondary; 71b97bf3fdSPer Liden }; 72b97bf3fdSPer Liden 73b97bf3fdSPer Liden /** 74b97bf3fdSPer Liden * struct bcbearer - bearer used by broadcast link 75b97bf3fdSPer Liden * @bearer: (non-standard) broadcast bearer structure 76b97bf3fdSPer Liden * @media: (non-standard) broadcast media structure 77b97bf3fdSPer Liden * @bpairs: array of bearer pairs 78b97bf3fdSPer Liden * @bpairs_temp: array of bearer pairs used during creation of "bpairs" 79b97bf3fdSPer Liden */ 80b97bf3fdSPer Liden 81b97bf3fdSPer Liden struct bcbearer { 82b97bf3fdSPer Liden struct bearer bearer; 83b97bf3fdSPer Liden struct media media; 84b97bf3fdSPer Liden struct bcbearer_pair bpairs[MAX_BEARERS]; 85b97bf3fdSPer Liden struct bcbearer_pair bpairs_temp[TIPC_NUM_LINK_PRI]; 86b97bf3fdSPer Liden }; 87b97bf3fdSPer Liden 88b97bf3fdSPer Liden /** 89b97bf3fdSPer Liden * struct bclink - link used for broadcast messages 90b97bf3fdSPer Liden * @link: (non-standard) broadcast link structure 91b97bf3fdSPer Liden * @node: (non-standard) node structure representing b'cast link's peer node 92b97bf3fdSPer Liden * 93b97bf3fdSPer Liden * Handles sequence numbering, fragmentation, bundling, etc. 94b97bf3fdSPer Liden */ 95b97bf3fdSPer Liden 96b97bf3fdSPer Liden struct bclink { 97b97bf3fdSPer Liden struct link link; 98b97bf3fdSPer Liden struct node node; 99b97bf3fdSPer Liden }; 100b97bf3fdSPer Liden 101b97bf3fdSPer Liden 102b97bf3fdSPer Liden static struct bcbearer *bcbearer = NULL; 103b97bf3fdSPer Liden static struct bclink *bclink = NULL; 104b97bf3fdSPer Liden static struct link *bcl = NULL; 105b97bf3fdSPer Liden static spinlock_t bc_lock = SPIN_LOCK_UNLOCKED; 106b97bf3fdSPer Liden 107b97bf3fdSPer Liden char bc_link_name[] = "multicast-link"; 108b97bf3fdSPer Liden 109b97bf3fdSPer Liden 110b97bf3fdSPer Liden static inline u32 buf_seqno(struct sk_buff *buf) 111b97bf3fdSPer Liden { 112b97bf3fdSPer Liden return msg_seqno(buf_msg(buf)); 113b97bf3fdSPer Liden } 114b97bf3fdSPer Liden 115b97bf3fdSPer Liden static inline u32 bcbuf_acks(struct sk_buff *buf) 116b97bf3fdSPer Liden { 117880b005fSDavid S. Miller return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle; 118b97bf3fdSPer Liden } 119b97bf3fdSPer Liden 120b97bf3fdSPer Liden static inline void bcbuf_set_acks(struct sk_buff *buf, u32 acks) 121b97bf3fdSPer Liden { 122880b005fSDavid S. Miller TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks; 123b97bf3fdSPer Liden } 124b97bf3fdSPer Liden 125b97bf3fdSPer Liden static inline void bcbuf_decr_acks(struct sk_buff *buf) 126b97bf3fdSPer Liden { 127b97bf3fdSPer Liden bcbuf_set_acks(buf, bcbuf_acks(buf) - 1); 128b97bf3fdSPer Liden } 129b97bf3fdSPer Liden 130b97bf3fdSPer Liden 131b97bf3fdSPer Liden /** 132b97bf3fdSPer Liden * bclink_set_gap - set gap according to contents of current deferred pkt queue 133b97bf3fdSPer Liden * 134b97bf3fdSPer Liden * Called with 'node' locked, bc_lock unlocked 135b97bf3fdSPer Liden */ 136b97bf3fdSPer Liden 137b97bf3fdSPer Liden static inline void bclink_set_gap(struct node *n_ptr) 138b97bf3fdSPer Liden { 139b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 140b97bf3fdSPer Liden 141b97bf3fdSPer Liden n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 142b97bf3fdSPer Liden mod(n_ptr->bclink.last_in); 143b97bf3fdSPer Liden if (unlikely(buf != NULL)) 144b97bf3fdSPer Liden n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1); 145b97bf3fdSPer Liden } 146b97bf3fdSPer Liden 147b97bf3fdSPer Liden /** 148b97bf3fdSPer Liden * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment 149b97bf3fdSPer Liden * 150b97bf3fdSPer Liden * This mechanism endeavours to prevent all nodes in network from trying 151b97bf3fdSPer Liden * to ACK or NACK at the same time. 152b97bf3fdSPer Liden * 153b97bf3fdSPer Liden * Note: TIPC uses a different trigger to distribute ACKs than it does to 154b97bf3fdSPer Liden * distribute NACKs, but tries to use the same spacing (divide by 16). 155b97bf3fdSPer Liden */ 156b97bf3fdSPer Liden 157b97bf3fdSPer Liden static inline int bclink_ack_allowed(u32 n) 158b97bf3fdSPer Liden { 159b97bf3fdSPer Liden return((n % TIPC_MIN_LINK_WIN) == tipc_own_tag); 160b97bf3fdSPer Liden } 161b97bf3fdSPer Liden 162b97bf3fdSPer Liden 163b97bf3fdSPer Liden /** 164b97bf3fdSPer Liden * bclink_retransmit_pkt - retransmit broadcast packets 165b97bf3fdSPer Liden * @after: sequence number of last packet to *not* retransmit 166b97bf3fdSPer Liden * @to: sequence number of last packet to retransmit 167b97bf3fdSPer Liden * 168b97bf3fdSPer Liden * Called with 'node' locked, bc_lock unlocked 169b97bf3fdSPer Liden */ 170b97bf3fdSPer Liden 171b97bf3fdSPer Liden static void bclink_retransmit_pkt(u32 after, u32 to) 172b97bf3fdSPer Liden { 173b97bf3fdSPer Liden struct sk_buff *buf; 174b97bf3fdSPer Liden 175b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 176b97bf3fdSPer Liden buf = bcl->first_out; 177b97bf3fdSPer Liden while (buf && less_eq(buf_seqno(buf), after)) { 178b97bf3fdSPer Liden buf = buf->next; 179b97bf3fdSPer Liden } 180b97bf3fdSPer Liden if (buf != NULL) 181b97bf3fdSPer Liden link_retransmit(bcl, buf, mod(to - after)); 182b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 183b97bf3fdSPer Liden } 184b97bf3fdSPer Liden 185b97bf3fdSPer Liden /** 186b97bf3fdSPer Liden * bclink_acknowledge - handle acknowledgement of broadcast packets 187b97bf3fdSPer Liden * @n_ptr: node that sent acknowledgement info 188b97bf3fdSPer Liden * @acked: broadcast sequence # that has been acknowledged 189b97bf3fdSPer Liden * 190b97bf3fdSPer Liden * Node is locked, bc_lock unlocked. 191b97bf3fdSPer Liden */ 192b97bf3fdSPer Liden 193b97bf3fdSPer Liden void bclink_acknowledge(struct node *n_ptr, u32 acked) 194b97bf3fdSPer Liden { 195b97bf3fdSPer Liden struct sk_buff *crs; 196b97bf3fdSPer Liden struct sk_buff *next; 197b97bf3fdSPer Liden unsigned int released = 0; 198b97bf3fdSPer Liden 199b97bf3fdSPer Liden if (less_eq(acked, n_ptr->bclink.acked)) 200b97bf3fdSPer Liden return; 201b97bf3fdSPer Liden 202b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 203b97bf3fdSPer Liden 204b97bf3fdSPer Liden /* Skip over packets that node has previously acknowledged */ 205b97bf3fdSPer Liden 206b97bf3fdSPer Liden crs = bcl->first_out; 207b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) { 208b97bf3fdSPer Liden crs = crs->next; 209b97bf3fdSPer Liden } 210b97bf3fdSPer Liden 211b97bf3fdSPer Liden /* Update packets that node is now acknowledging */ 212b97bf3fdSPer Liden 213b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), acked)) { 214b97bf3fdSPer Liden next = crs->next; 215b97bf3fdSPer Liden bcbuf_decr_acks(crs); 216b97bf3fdSPer Liden if (bcbuf_acks(crs) == 0) { 217b97bf3fdSPer Liden bcl->first_out = next; 218b97bf3fdSPer Liden bcl->out_queue_size--; 219b97bf3fdSPer Liden buf_discard(crs); 220b97bf3fdSPer Liden released = 1; 221b97bf3fdSPer Liden } 222b97bf3fdSPer Liden crs = next; 223b97bf3fdSPer Liden } 224b97bf3fdSPer Liden n_ptr->bclink.acked = acked; 225b97bf3fdSPer Liden 226b97bf3fdSPer Liden /* Try resolving broadcast link congestion, if necessary */ 227b97bf3fdSPer Liden 228b97bf3fdSPer Liden if (unlikely(bcl->next_out)) 229b97bf3fdSPer Liden link_push_queue(bcl); 230b97bf3fdSPer Liden if (unlikely(released && !list_empty(&bcl->waiting_ports))) 231b97bf3fdSPer Liden link_wakeup_ports(bcl, 0); 232b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 233b97bf3fdSPer Liden } 234b97bf3fdSPer Liden 235b97bf3fdSPer Liden /** 236b97bf3fdSPer Liden * bclink_send_ack - unicast an ACK msg 237b97bf3fdSPer Liden * 238b97bf3fdSPer Liden * net_lock and node lock set 239b97bf3fdSPer Liden */ 240b97bf3fdSPer Liden 241b97bf3fdSPer Liden static void bclink_send_ack(struct node *n_ptr) 242b97bf3fdSPer Liden { 243b97bf3fdSPer Liden struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1]; 244b97bf3fdSPer Liden 245b97bf3fdSPer Liden if (l_ptr != NULL) 246b97bf3fdSPer Liden link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0); 247b97bf3fdSPer Liden } 248b97bf3fdSPer Liden 249b97bf3fdSPer Liden /** 250b97bf3fdSPer Liden * bclink_send_nack- broadcast a NACK msg 251b97bf3fdSPer Liden * 252b97bf3fdSPer Liden * net_lock and node lock set 253b97bf3fdSPer Liden */ 254b97bf3fdSPer Liden 255b97bf3fdSPer Liden static void bclink_send_nack(struct node *n_ptr) 256b97bf3fdSPer Liden { 257b97bf3fdSPer Liden struct sk_buff *buf; 258b97bf3fdSPer Liden struct tipc_msg *msg; 259b97bf3fdSPer Liden 260b97bf3fdSPer Liden if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to)) 261b97bf3fdSPer Liden return; 262b97bf3fdSPer Liden 263b97bf3fdSPer Liden buf = buf_acquire(INT_H_SIZE); 264b97bf3fdSPer Liden if (buf) { 265b97bf3fdSPer Liden msg = buf_msg(buf); 266b97bf3fdSPer Liden msg_init(msg, BCAST_PROTOCOL, STATE_MSG, 267b97bf3fdSPer Liden TIPC_OK, INT_H_SIZE, n_ptr->addr); 268b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 269b97bf3fdSPer Liden msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in)); 270b97bf3fdSPer Liden msg_set_bcgap_after(msg, n_ptr->bclink.gap_after); 271b97bf3fdSPer Liden msg_set_bcgap_to(msg, n_ptr->bclink.gap_to); 272b97bf3fdSPer Liden msg_set_bcast_tag(msg, tipc_own_tag); 273b97bf3fdSPer Liden 274b97bf3fdSPer Liden if (bearer_send(&bcbearer->bearer, buf, 0)) { 275b97bf3fdSPer Liden bcl->stats.sent_nacks++; 276b97bf3fdSPer Liden buf_discard(buf); 277b97bf3fdSPer Liden } else { 278b97bf3fdSPer Liden bearer_schedule(bcl->b_ptr, bcl); 279b97bf3fdSPer Liden bcl->proto_msg_queue = buf; 280b97bf3fdSPer Liden bcl->stats.bearer_congs++; 281b97bf3fdSPer Liden } 282b97bf3fdSPer Liden 283b97bf3fdSPer Liden /* 284b97bf3fdSPer Liden * Ensure we doesn't send another NACK msg to the node 285b97bf3fdSPer Liden * until 16 more deferred messages arrive from it 286b97bf3fdSPer Liden * (i.e. helps prevent all nodes from NACK'ing at same time) 287b97bf3fdSPer Liden */ 288b97bf3fdSPer Liden 289b97bf3fdSPer Liden n_ptr->bclink.nack_sync = tipc_own_tag; 290b97bf3fdSPer Liden } 291b97bf3fdSPer Liden } 292b97bf3fdSPer Liden 293b97bf3fdSPer Liden /** 294b97bf3fdSPer Liden * bclink_check_gap - send a NACK if a sequence gap exists 295b97bf3fdSPer Liden * 296b97bf3fdSPer Liden * net_lock and node lock set 297b97bf3fdSPer Liden */ 298b97bf3fdSPer Liden 299b97bf3fdSPer Liden void bclink_check_gap(struct node *n_ptr, u32 last_sent) 300b97bf3fdSPer Liden { 301b97bf3fdSPer Liden if (!n_ptr->bclink.supported || 302b97bf3fdSPer Liden less_eq(last_sent, mod(n_ptr->bclink.last_in))) 303b97bf3fdSPer Liden return; 304b97bf3fdSPer Liden 305b97bf3fdSPer Liden bclink_set_gap(n_ptr); 306b97bf3fdSPer Liden if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to) 307b97bf3fdSPer Liden n_ptr->bclink.gap_to = last_sent; 308b97bf3fdSPer Liden bclink_send_nack(n_ptr); 309b97bf3fdSPer Liden } 310b97bf3fdSPer Liden 311b97bf3fdSPer Liden /** 312b97bf3fdSPer Liden * bclink_peek_nack - process a NACK msg meant for another node 313b97bf3fdSPer Liden * 314b97bf3fdSPer Liden * Only net_lock set. 315b97bf3fdSPer Liden */ 316b97bf3fdSPer Liden 317b97bf3fdSPer Liden void bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to) 318b97bf3fdSPer Liden { 319b97bf3fdSPer Liden struct node *n_ptr = node_find(dest); 320b97bf3fdSPer Liden u32 my_after, my_to; 321b97bf3fdSPer Liden 322b97bf3fdSPer Liden if (unlikely(!n_ptr || !node_is_up(n_ptr))) 323b97bf3fdSPer Liden return; 324b97bf3fdSPer Liden node_lock(n_ptr); 325b97bf3fdSPer Liden /* 326b97bf3fdSPer Liden * Modify gap to suppress unnecessary NACKs from this node 327b97bf3fdSPer Liden */ 328b97bf3fdSPer Liden my_after = n_ptr->bclink.gap_after; 329b97bf3fdSPer Liden my_to = n_ptr->bclink.gap_to; 330b97bf3fdSPer Liden 331b97bf3fdSPer Liden if (less_eq(gap_after, my_after)) { 332b97bf3fdSPer Liden if (less(my_after, gap_to) && less(gap_to, my_to)) 333b97bf3fdSPer Liden n_ptr->bclink.gap_after = gap_to; 334b97bf3fdSPer Liden else if (less_eq(my_to, gap_to)) 335b97bf3fdSPer Liden n_ptr->bclink.gap_to = n_ptr->bclink.gap_after; 336b97bf3fdSPer Liden } else if (less_eq(gap_after, my_to)) { 337b97bf3fdSPer Liden if (less_eq(my_to, gap_to)) 338b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 339b97bf3fdSPer Liden } else { 340b97bf3fdSPer Liden /* 341b97bf3fdSPer Liden * Expand gap if missing bufs not in deferred queue: 342b97bf3fdSPer Liden */ 343b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 344b97bf3fdSPer Liden u32 prev = n_ptr->bclink.gap_to; 345b97bf3fdSPer Liden 346b97bf3fdSPer Liden for (; buf; buf = buf->next) { 347b97bf3fdSPer Liden u32 seqno = buf_seqno(buf); 348b97bf3fdSPer Liden 349b97bf3fdSPer Liden if (mod(seqno - prev) != 1) 350b97bf3fdSPer Liden buf = NULL; 351b97bf3fdSPer Liden if (seqno == gap_after) 352b97bf3fdSPer Liden break; 353b97bf3fdSPer Liden prev = seqno; 354b97bf3fdSPer Liden } 355b97bf3fdSPer Liden if (buf == NULL) 356b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 357b97bf3fdSPer Liden } 358b97bf3fdSPer Liden /* 359b97bf3fdSPer Liden * Some nodes may send a complementary NACK now: 360b97bf3fdSPer Liden */ 361b97bf3fdSPer Liden if (bclink_ack_allowed(sender_tag + 1)) { 362b97bf3fdSPer Liden if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) { 363b97bf3fdSPer Liden bclink_send_nack(n_ptr); 364b97bf3fdSPer Liden bclink_set_gap(n_ptr); 365b97bf3fdSPer Liden } 366b97bf3fdSPer Liden } 367b97bf3fdSPer Liden node_unlock(n_ptr); 368b97bf3fdSPer Liden } 369b97bf3fdSPer Liden 370b97bf3fdSPer Liden /** 371b97bf3fdSPer Liden * bclink_send_msg - broadcast a packet to all nodes in cluster 372b97bf3fdSPer Liden */ 373b97bf3fdSPer Liden 374b97bf3fdSPer Liden int bclink_send_msg(struct sk_buff *buf) 375b97bf3fdSPer Liden { 376b97bf3fdSPer Liden int res; 377b97bf3fdSPer Liden 378b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 379b97bf3fdSPer Liden 380b97bf3fdSPer Liden res = link_send_buf(bcl, buf); 381b97bf3fdSPer Liden if (unlikely(res == -ELINKCONG)) 382b97bf3fdSPer Liden buf_discard(buf); 383b97bf3fdSPer Liden else 384b97bf3fdSPer Liden bcl->stats.sent_info++; 385b97bf3fdSPer Liden 386b97bf3fdSPer Liden if (bcl->out_queue_size > bcl->stats.max_queue_sz) 387b97bf3fdSPer Liden bcl->stats.max_queue_sz = bcl->out_queue_size; 388b97bf3fdSPer Liden bcl->stats.queue_sz_counts++; 389b97bf3fdSPer Liden bcl->stats.accu_queue_sz += bcl->out_queue_size; 390b97bf3fdSPer Liden 391b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 392b97bf3fdSPer Liden return res; 393b97bf3fdSPer Liden } 394b97bf3fdSPer Liden 395b97bf3fdSPer Liden /** 396b97bf3fdSPer Liden * bclink_recv_pkt - receive a broadcast packet, and deliver upwards 397b97bf3fdSPer Liden * 398b97bf3fdSPer Liden * net_lock is read_locked, no other locks set 399b97bf3fdSPer Liden */ 400b97bf3fdSPer Liden 401b97bf3fdSPer Liden void bclink_recv_pkt(struct sk_buff *buf) 402b97bf3fdSPer Liden { 403b97bf3fdSPer Liden struct tipc_msg *msg = buf_msg(buf); 404b97bf3fdSPer Liden struct node* node = node_find(msg_prevnode(msg)); 405b97bf3fdSPer Liden u32 next_in; 406b97bf3fdSPer Liden u32 seqno; 407b97bf3fdSPer Liden struct sk_buff *deferred; 408b97bf3fdSPer Liden 409b97bf3fdSPer Liden msg_dbg(msg, "<BC<<<"); 410b97bf3fdSPer Liden 411b97bf3fdSPer Liden if (unlikely(!node || !node_is_up(node) || !node->bclink.supported || 412b97bf3fdSPer Liden (msg_mc_netid(msg) != tipc_net_id))) { 413b97bf3fdSPer Liden buf_discard(buf); 414b97bf3fdSPer Liden return; 415b97bf3fdSPer Liden } 416b97bf3fdSPer Liden 417b97bf3fdSPer Liden if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { 418b97bf3fdSPer Liden msg_dbg(msg, "<BCNACK<<<"); 419b97bf3fdSPer Liden if (msg_destnode(msg) == tipc_own_addr) { 420b97bf3fdSPer Liden node_lock(node); 421b97bf3fdSPer Liden bclink_acknowledge(node, msg_bcast_ack(msg)); 422b97bf3fdSPer Liden node_unlock(node); 423b97bf3fdSPer Liden bcl->stats.recv_nacks++; 424b97bf3fdSPer Liden bclink_retransmit_pkt(msg_bcgap_after(msg), 425b97bf3fdSPer Liden msg_bcgap_to(msg)); 426b97bf3fdSPer Liden } else { 427b97bf3fdSPer Liden bclink_peek_nack(msg_destnode(msg), 428b97bf3fdSPer Liden msg_bcast_tag(msg), 429b97bf3fdSPer Liden msg_bcgap_after(msg), 430b97bf3fdSPer Liden msg_bcgap_to(msg)); 431b97bf3fdSPer Liden } 432b97bf3fdSPer Liden buf_discard(buf); 433b97bf3fdSPer Liden return; 434b97bf3fdSPer Liden } 435b97bf3fdSPer Liden 436b97bf3fdSPer Liden node_lock(node); 437b97bf3fdSPer Liden receive: 438b97bf3fdSPer Liden deferred = node->bclink.deferred_head; 439b97bf3fdSPer Liden next_in = mod(node->bclink.last_in + 1); 440b97bf3fdSPer Liden seqno = msg_seqno(msg); 441b97bf3fdSPer Liden 442b97bf3fdSPer Liden if (likely(seqno == next_in)) { 443b97bf3fdSPer Liden bcl->stats.recv_info++; 444b97bf3fdSPer Liden node->bclink.last_in++; 445b97bf3fdSPer Liden bclink_set_gap(node); 446b97bf3fdSPer Liden if (unlikely(bclink_ack_allowed(seqno))) { 447b97bf3fdSPer Liden bclink_send_ack(node); 448b97bf3fdSPer Liden bcl->stats.sent_acks++; 449b97bf3fdSPer Liden } 450b97bf3fdSPer Liden if (likely(msg_isdata(msg))) { 451b97bf3fdSPer Liden node_unlock(node); 452b97bf3fdSPer Liden port_recv_mcast(buf, NULL); 453b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_BUNDLER) { 454b97bf3fdSPer Liden bcl->stats.recv_bundles++; 455b97bf3fdSPer Liden bcl->stats.recv_bundled += msg_msgcnt(msg); 456b97bf3fdSPer Liden node_unlock(node); 457b97bf3fdSPer Liden link_recv_bundle(buf); 458b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_FRAGMENTER) { 459b97bf3fdSPer Liden bcl->stats.recv_fragments++; 460b97bf3fdSPer Liden if (link_recv_fragment(&node->bclink.defragm, 461b97bf3fdSPer Liden &buf, &msg)) 462b97bf3fdSPer Liden bcl->stats.recv_fragmented++; 463b97bf3fdSPer Liden node_unlock(node); 464b97bf3fdSPer Liden net_route_msg(buf); 465b97bf3fdSPer Liden } else { 466b97bf3fdSPer Liden node_unlock(node); 467b97bf3fdSPer Liden net_route_msg(buf); 468b97bf3fdSPer Liden } 469b97bf3fdSPer Liden if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) { 470b97bf3fdSPer Liden node_lock(node); 471b97bf3fdSPer Liden buf = deferred; 472b97bf3fdSPer Liden msg = buf_msg(buf); 473b97bf3fdSPer Liden node->bclink.deferred_head = deferred->next; 474b97bf3fdSPer Liden goto receive; 475b97bf3fdSPer Liden } 476b97bf3fdSPer Liden return; 477b97bf3fdSPer Liden } else if (less(next_in, seqno)) { 478b97bf3fdSPer Liden u32 gap_after = node->bclink.gap_after; 479b97bf3fdSPer Liden u32 gap_to = node->bclink.gap_to; 480b97bf3fdSPer Liden 481b97bf3fdSPer Liden if (link_defer_pkt(&node->bclink.deferred_head, 482b97bf3fdSPer Liden &node->bclink.deferred_tail, 483b97bf3fdSPer Liden buf)) { 484b97bf3fdSPer Liden node->bclink.nack_sync++; 485b97bf3fdSPer Liden bcl->stats.deferred_recv++; 486b97bf3fdSPer Liden if (seqno == mod(gap_after + 1)) 487b97bf3fdSPer Liden node->bclink.gap_after = seqno; 488b97bf3fdSPer Liden else if (less(gap_after, seqno) && less(seqno, gap_to)) 489b97bf3fdSPer Liden node->bclink.gap_to = seqno; 490b97bf3fdSPer Liden } 491b97bf3fdSPer Liden if (bclink_ack_allowed(node->bclink.nack_sync)) { 492b97bf3fdSPer Liden if (gap_to != gap_after) 493b97bf3fdSPer Liden bclink_send_nack(node); 494b97bf3fdSPer Liden bclink_set_gap(node); 495b97bf3fdSPer Liden } 496b97bf3fdSPer Liden } else { 497b97bf3fdSPer Liden bcl->stats.duplicates++; 498b97bf3fdSPer Liden buf_discard(buf); 499b97bf3fdSPer Liden } 500b97bf3fdSPer Liden node_unlock(node); 501b97bf3fdSPer Liden } 502b97bf3fdSPer Liden 503b97bf3fdSPer Liden u32 bclink_get_last_sent(void) 504b97bf3fdSPer Liden { 505b97bf3fdSPer Liden u32 last_sent = mod(bcl->next_out_no - 1); 506b97bf3fdSPer Liden 507b97bf3fdSPer Liden if (bcl->next_out) 508b97bf3fdSPer Liden last_sent = mod(buf_seqno(bcl->next_out) - 1); 509b97bf3fdSPer Liden return last_sent; 510b97bf3fdSPer Liden } 511b97bf3fdSPer Liden 512b97bf3fdSPer Liden u32 bclink_acks_missing(struct node *n_ptr) 513b97bf3fdSPer Liden { 514b97bf3fdSPer Liden return (n_ptr->bclink.supported && 515b97bf3fdSPer Liden (bclink_get_last_sent() != n_ptr->bclink.acked)); 516b97bf3fdSPer Liden } 517b97bf3fdSPer Liden 518b97bf3fdSPer Liden 519b97bf3fdSPer Liden /** 520b97bf3fdSPer Liden * bcbearer_send - send a packet through the broadcast pseudo-bearer 521b97bf3fdSPer Liden * 522b97bf3fdSPer Liden * Send through as many bearers as necessary to reach all nodes 523b97bf3fdSPer Liden * that support TIPC multicasting. 524b97bf3fdSPer Liden * 525b97bf3fdSPer Liden * Returns 0 if packet sent successfully, non-zero if not 526b97bf3fdSPer Liden */ 527b97bf3fdSPer Liden 528b97bf3fdSPer Liden int bcbearer_send(struct sk_buff *buf, 529b97bf3fdSPer Liden struct tipc_bearer *unused1, 530b97bf3fdSPer Liden struct tipc_media_addr *unused2) 531b97bf3fdSPer Liden { 532b97bf3fdSPer Liden static int send_count = 0; 533b97bf3fdSPer Liden 534b97bf3fdSPer Liden struct node_map remains; 535b97bf3fdSPer Liden struct node_map remains_new; 536b97bf3fdSPer Liden int bp_index; 537b97bf3fdSPer Liden int swap_time; 538b97bf3fdSPer Liden 539b97bf3fdSPer Liden /* Prepare buffer for broadcasting (if first time trying to send it) */ 540b97bf3fdSPer Liden 541b97bf3fdSPer Liden if (likely(!msg_non_seq(buf_msg(buf)))) { 542b97bf3fdSPer Liden struct tipc_msg *msg; 543b97bf3fdSPer Liden 544b97bf3fdSPer Liden assert(cluster_bcast_nodes.count != 0); 545b97bf3fdSPer Liden bcbuf_set_acks(buf, cluster_bcast_nodes.count); 546b97bf3fdSPer Liden msg = buf_msg(buf); 547b97bf3fdSPer Liden msg_set_non_seq(msg); 548b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 549b97bf3fdSPer Liden } 550b97bf3fdSPer Liden 551b97bf3fdSPer Liden /* Determine if bearer pairs should be swapped following this attempt */ 552b97bf3fdSPer Liden 553b97bf3fdSPer Liden if ((swap_time = (++send_count >= 10))) 554b97bf3fdSPer Liden send_count = 0; 555b97bf3fdSPer Liden 556b97bf3fdSPer Liden /* Send buffer over bearers until all targets reached */ 557b97bf3fdSPer Liden 558b97bf3fdSPer Liden remains = cluster_bcast_nodes; 559b97bf3fdSPer Liden 560b97bf3fdSPer Liden for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { 561b97bf3fdSPer Liden struct bearer *p = bcbearer->bpairs[bp_index].primary; 562b97bf3fdSPer Liden struct bearer *s = bcbearer->bpairs[bp_index].secondary; 563b97bf3fdSPer Liden 564b97bf3fdSPer Liden if (!p) 565b97bf3fdSPer Liden break; /* no more bearers to try */ 566b97bf3fdSPer Liden 567b97bf3fdSPer Liden nmap_diff(&remains, &p->nodes, &remains_new); 568b97bf3fdSPer Liden if (remains_new.count == remains.count) 569b97bf3fdSPer Liden continue; /* bearer pair doesn't add anything */ 570b97bf3fdSPer Liden 571b97bf3fdSPer Liden if (!p->publ.blocked && 572b97bf3fdSPer Liden !p->media->send_msg(buf, &p->publ, &p->media->bcast_addr)) { 573b97bf3fdSPer Liden if (swap_time && s && !s->publ.blocked) 574b97bf3fdSPer Liden goto swap; 575b97bf3fdSPer Liden else 576b97bf3fdSPer Liden goto update; 577b97bf3fdSPer Liden } 578b97bf3fdSPer Liden 579b97bf3fdSPer Liden if (!s || s->publ.blocked || 580b97bf3fdSPer Liden s->media->send_msg(buf, &s->publ, &s->media->bcast_addr)) 581b97bf3fdSPer Liden continue; /* unable to send using bearer pair */ 582b97bf3fdSPer Liden swap: 583b97bf3fdSPer Liden bcbearer->bpairs[bp_index].primary = s; 584b97bf3fdSPer Liden bcbearer->bpairs[bp_index].secondary = p; 585b97bf3fdSPer Liden update: 586b97bf3fdSPer Liden if (remains_new.count == 0) 587b97bf3fdSPer Liden return TIPC_OK; 588b97bf3fdSPer Liden 589b97bf3fdSPer Liden remains = remains_new; 590b97bf3fdSPer Liden } 591b97bf3fdSPer Liden 592b97bf3fdSPer Liden /* Unable to reach all targets */ 593b97bf3fdSPer Liden 594b97bf3fdSPer Liden bcbearer->bearer.publ.blocked = 1; 595b97bf3fdSPer Liden bcl->stats.bearer_congs++; 596b97bf3fdSPer Liden return ~TIPC_OK; 597b97bf3fdSPer Liden } 598b97bf3fdSPer Liden 599b97bf3fdSPer Liden /** 600b97bf3fdSPer Liden * bcbearer_sort - create sets of bearer pairs used by broadcast bearer 601b97bf3fdSPer Liden */ 602b97bf3fdSPer Liden 603b97bf3fdSPer Liden void bcbearer_sort(void) 604b97bf3fdSPer Liden { 605b97bf3fdSPer Liden struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp; 606b97bf3fdSPer Liden struct bcbearer_pair *bp_curr; 607b97bf3fdSPer Liden int b_index; 608b97bf3fdSPer Liden int pri; 609b97bf3fdSPer Liden 610b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 611b97bf3fdSPer Liden 612b97bf3fdSPer Liden /* Group bearers by priority (can assume max of two per priority) */ 613b97bf3fdSPer Liden 614b97bf3fdSPer Liden memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); 615b97bf3fdSPer Liden 616b97bf3fdSPer Liden for (b_index = 0; b_index < MAX_BEARERS; b_index++) { 617b97bf3fdSPer Liden struct bearer *b = &bearers[b_index]; 618b97bf3fdSPer Liden 619b97bf3fdSPer Liden if (!b->active || !b->nodes.count) 620b97bf3fdSPer Liden continue; 621b97bf3fdSPer Liden 622b97bf3fdSPer Liden if (!bp_temp[b->priority].primary) 623b97bf3fdSPer Liden bp_temp[b->priority].primary = b; 624b97bf3fdSPer Liden else 625b97bf3fdSPer Liden bp_temp[b->priority].secondary = b; 626b97bf3fdSPer Liden } 627b97bf3fdSPer Liden 628b97bf3fdSPer Liden /* Create array of bearer pairs for broadcasting */ 629b97bf3fdSPer Liden 630b97bf3fdSPer Liden bp_curr = bcbearer->bpairs; 631b97bf3fdSPer Liden memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); 632b97bf3fdSPer Liden 633b97bf3fdSPer Liden for (pri = (TIPC_NUM_LINK_PRI - 1); pri >= 0; pri--) { 634b97bf3fdSPer Liden 635b97bf3fdSPer Liden if (!bp_temp[pri].primary) 636b97bf3fdSPer Liden continue; 637b97bf3fdSPer Liden 638b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].primary; 639b97bf3fdSPer Liden 640b97bf3fdSPer Liden if (bp_temp[pri].secondary) { 641b97bf3fdSPer Liden if (nmap_equal(&bp_temp[pri].primary->nodes, 642b97bf3fdSPer Liden &bp_temp[pri].secondary->nodes)) { 643b97bf3fdSPer Liden bp_curr->secondary = bp_temp[pri].secondary; 644b97bf3fdSPer Liden } else { 645b97bf3fdSPer Liden bp_curr++; 646b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].secondary; 647b97bf3fdSPer Liden } 648b97bf3fdSPer Liden } 649b97bf3fdSPer Liden 650b97bf3fdSPer Liden bp_curr++; 651b97bf3fdSPer Liden } 652b97bf3fdSPer Liden 653b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 654b97bf3fdSPer Liden } 655b97bf3fdSPer Liden 656b97bf3fdSPer Liden /** 657b97bf3fdSPer Liden * bcbearer_push - resolve bearer congestion 658b97bf3fdSPer Liden * 659b97bf3fdSPer Liden * Forces bclink to push out any unsent packets, until all packets are gone 660b97bf3fdSPer Liden * or congestion reoccurs. 661b97bf3fdSPer Liden * No locks set when function called 662b97bf3fdSPer Liden */ 663b97bf3fdSPer Liden 664b97bf3fdSPer Liden void bcbearer_push(void) 665b97bf3fdSPer Liden { 666b97bf3fdSPer Liden struct bearer *b_ptr; 667b97bf3fdSPer Liden 668b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 669b97bf3fdSPer Liden b_ptr = &bcbearer->bearer; 670b97bf3fdSPer Liden if (b_ptr->publ.blocked) { 671b97bf3fdSPer Liden b_ptr->publ.blocked = 0; 672b97bf3fdSPer Liden bearer_lock_push(b_ptr); 673b97bf3fdSPer Liden } 674b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 675b97bf3fdSPer Liden } 676b97bf3fdSPer Liden 677b97bf3fdSPer Liden 678b97bf3fdSPer Liden int bclink_stats(char *buf, const u32 buf_size) 679b97bf3fdSPer Liden { 680b97bf3fdSPer Liden struct print_buf pb; 681b97bf3fdSPer Liden 682b97bf3fdSPer Liden if (!bcl) 683b97bf3fdSPer Liden return 0; 684b97bf3fdSPer Liden 685b97bf3fdSPer Liden printbuf_init(&pb, buf, buf_size); 686b97bf3fdSPer Liden 687b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 688b97bf3fdSPer Liden 689b97bf3fdSPer Liden tipc_printf(&pb, "Link <%s>\n" 690b97bf3fdSPer Liden " Window:%u packets\n", 691b97bf3fdSPer Liden bcl->name, bcl->queue_limit[0]); 692b97bf3fdSPer Liden tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n", 693b97bf3fdSPer Liden bcl->stats.recv_info, 694b97bf3fdSPer Liden bcl->stats.recv_fragments, 695b97bf3fdSPer Liden bcl->stats.recv_fragmented, 696b97bf3fdSPer Liden bcl->stats.recv_bundles, 697b97bf3fdSPer Liden bcl->stats.recv_bundled); 698b97bf3fdSPer Liden tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n", 699b97bf3fdSPer Liden bcl->stats.sent_info, 700b97bf3fdSPer Liden bcl->stats.sent_fragments, 701b97bf3fdSPer Liden bcl->stats.sent_fragmented, 702b97bf3fdSPer Liden bcl->stats.sent_bundles, 703b97bf3fdSPer Liden bcl->stats.sent_bundled); 704b97bf3fdSPer Liden tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n", 705b97bf3fdSPer Liden bcl->stats.recv_nacks, 706b97bf3fdSPer Liden bcl->stats.deferred_recv, 707b97bf3fdSPer Liden bcl->stats.duplicates); 708b97bf3fdSPer Liden tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n", 709b97bf3fdSPer Liden bcl->stats.sent_nacks, 710b97bf3fdSPer Liden bcl->stats.sent_acks, 711b97bf3fdSPer Liden bcl->stats.retransmitted); 712b97bf3fdSPer Liden tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n", 713b97bf3fdSPer Liden bcl->stats.bearer_congs, 714b97bf3fdSPer Liden bcl->stats.link_congs, 715b97bf3fdSPer Liden bcl->stats.max_queue_sz, 716b97bf3fdSPer Liden bcl->stats.queue_sz_counts 717b97bf3fdSPer Liden ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts) 718b97bf3fdSPer Liden : 0); 719b97bf3fdSPer Liden 720b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 721b97bf3fdSPer Liden return printbuf_validate(&pb); 722b97bf3fdSPer Liden } 723b97bf3fdSPer Liden 724b97bf3fdSPer Liden int bclink_reset_stats(void) 725b97bf3fdSPer Liden { 726b97bf3fdSPer Liden if (!bcl) 727b97bf3fdSPer Liden return -ENOPROTOOPT; 728b97bf3fdSPer Liden 729b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 730b97bf3fdSPer Liden memset(&bcl->stats, 0, sizeof(bcl->stats)); 731b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 732b97bf3fdSPer Liden return TIPC_OK; 733b97bf3fdSPer Liden } 734b97bf3fdSPer Liden 735b97bf3fdSPer Liden int bclink_set_queue_limits(u32 limit) 736b97bf3fdSPer Liden { 737b97bf3fdSPer Liden if (!bcl) 738b97bf3fdSPer Liden return -ENOPROTOOPT; 739b97bf3fdSPer Liden if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) 740b97bf3fdSPer Liden return -EINVAL; 741b97bf3fdSPer Liden 742b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 743b97bf3fdSPer Liden link_set_queue_limits(bcl, limit); 744b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 745b97bf3fdSPer Liden return TIPC_OK; 746b97bf3fdSPer Liden } 747b97bf3fdSPer Liden 748b97bf3fdSPer Liden int bclink_init(void) 749b97bf3fdSPer Liden { 750b97bf3fdSPer Liden bcbearer = kmalloc(sizeof(*bcbearer), GFP_ATOMIC); 751b97bf3fdSPer Liden bclink = kmalloc(sizeof(*bclink), GFP_ATOMIC); 752b97bf3fdSPer Liden if (!bcbearer || !bclink) { 753b97bf3fdSPer Liden nomem: 754b97bf3fdSPer Liden warn("Memory squeeze; Failed to create multicast link\n"); 755b97bf3fdSPer Liden kfree(bcbearer); 756b97bf3fdSPer Liden bcbearer = NULL; 757b97bf3fdSPer Liden kfree(bclink); 758b97bf3fdSPer Liden bclink = NULL; 759b97bf3fdSPer Liden return -ENOMEM; 760b97bf3fdSPer Liden } 761b97bf3fdSPer Liden 762b97bf3fdSPer Liden memset(bcbearer, 0, sizeof(struct bcbearer)); 763b97bf3fdSPer Liden INIT_LIST_HEAD(&bcbearer->bearer.cong_links); 764b97bf3fdSPer Liden bcbearer->bearer.media = &bcbearer->media; 765b97bf3fdSPer Liden bcbearer->media.send_msg = bcbearer_send; 766b97bf3fdSPer Liden sprintf(bcbearer->media.name, "tipc-multicast"); 767b97bf3fdSPer Liden 768b97bf3fdSPer Liden bcl = &bclink->link; 769b97bf3fdSPer Liden memset(bclink, 0, sizeof(struct bclink)); 770b97bf3fdSPer Liden INIT_LIST_HEAD(&bcl->waiting_ports); 771b97bf3fdSPer Liden bcl->next_out_no = 1; 772b97bf3fdSPer Liden bclink->node.lock = SPIN_LOCK_UNLOCKED; 773b97bf3fdSPer Liden bcl->owner = &bclink->node; 774b97bf3fdSPer Liden bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; 775b97bf3fdSPer Liden link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); 776b97bf3fdSPer Liden bcl->b_ptr = &bcbearer->bearer; 777b97bf3fdSPer Liden bcl->state = WORKING_WORKING; 778b97bf3fdSPer Liden sprintf(bcl->name, bc_link_name); 779b97bf3fdSPer Liden 780b97bf3fdSPer Liden if (BCLINK_LOG_BUF_SIZE) { 781b97bf3fdSPer Liden char *pb = kmalloc(BCLINK_LOG_BUF_SIZE, GFP_ATOMIC); 782b97bf3fdSPer Liden 783b97bf3fdSPer Liden if (!pb) 784b97bf3fdSPer Liden goto nomem; 785b97bf3fdSPer Liden printbuf_init(&bcl->print_buf, pb, BCLINK_LOG_BUF_SIZE); 786b97bf3fdSPer Liden } 787b97bf3fdSPer Liden 788b97bf3fdSPer Liden return TIPC_OK; 789b97bf3fdSPer Liden } 790b97bf3fdSPer Liden 791b97bf3fdSPer Liden void bclink_stop(void) 792b97bf3fdSPer Liden { 793b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 794b97bf3fdSPer Liden if (bcbearer) { 795b97bf3fdSPer Liden link_stop(bcl); 796b97bf3fdSPer Liden if (BCLINK_LOG_BUF_SIZE) 797b97bf3fdSPer Liden kfree(bcl->print_buf.buf); 798b97bf3fdSPer Liden bcl = NULL; 799b97bf3fdSPer Liden kfree(bclink); 800b97bf3fdSPer Liden bclink = NULL; 801b97bf3fdSPer Liden kfree(bcbearer); 802b97bf3fdSPer Liden bcbearer = NULL; 803b97bf3fdSPer Liden } 804b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 805b97bf3fdSPer Liden } 806b97bf3fdSPer Liden 807