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 1465b1f7bdeSAllan Stephens static void bclink_set_last_sent(void) 1475b1f7bdeSAllan Stephens { 1485b1f7bdeSAllan Stephens if (bcl->next_out) 1495b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1); 1505b1f7bdeSAllan Stephens else 1515b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1); 1525b1f7bdeSAllan Stephens } 1535b1f7bdeSAllan Stephens 1545b1f7bdeSAllan Stephens u32 tipc_bclink_get_last_sent(void) 1555b1f7bdeSAllan Stephens { 1565b1f7bdeSAllan Stephens return bcl->fsm_msg_cnt; 1575b1f7bdeSAllan Stephens } 1585b1f7bdeSAllan Stephens 159b97bf3fdSPer Liden /** 160b97bf3fdSPer Liden * bclink_set_gap - set gap according to contents of current deferred pkt queue 161b97bf3fdSPer Liden * 162b97bf3fdSPer Liden * Called with 'node' locked, bc_lock unlocked 163b97bf3fdSPer Liden */ 164b97bf3fdSPer Liden 1656c00055aSDavid S. Miller static void bclink_set_gap(struct tipc_node *n_ptr) 166b97bf3fdSPer Liden { 167b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 168b97bf3fdSPer Liden 169b97bf3fdSPer Liden n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 170b97bf3fdSPer Liden mod(n_ptr->bclink.last_in); 171b97bf3fdSPer Liden if (unlikely(buf != NULL)) 172b97bf3fdSPer Liden n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1); 173b97bf3fdSPer Liden } 174b97bf3fdSPer Liden 175b97bf3fdSPer Liden /** 176b97bf3fdSPer Liden * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment 177b97bf3fdSPer Liden * 178b97bf3fdSPer Liden * This mechanism endeavours to prevent all nodes in network from trying 179b97bf3fdSPer Liden * to ACK or NACK at the same time. 180b97bf3fdSPer Liden * 181b97bf3fdSPer Liden * Note: TIPC uses a different trigger to distribute ACKs than it does to 182b97bf3fdSPer Liden * distribute NACKs, but tries to use the same spacing (divide by 16). 183b97bf3fdSPer Liden */ 184b97bf3fdSPer Liden 18505790c64SSam Ravnborg static int bclink_ack_allowed(u32 n) 186b97bf3fdSPer Liden { 187a02cec21SEric Dumazet return (n % TIPC_MIN_LINK_WIN) == tipc_own_tag; 188b97bf3fdSPer Liden } 189b97bf3fdSPer Liden 190b97bf3fdSPer Liden 191b97bf3fdSPer Liden /** 192b97bf3fdSPer Liden * bclink_retransmit_pkt - retransmit broadcast packets 193b97bf3fdSPer Liden * @after: sequence number of last packet to *not* retransmit 194b97bf3fdSPer Liden * @to: sequence number of last packet to retransmit 195b97bf3fdSPer Liden * 196d356eebaSAllan Stephens * Called with bc_lock locked 197b97bf3fdSPer Liden */ 198b97bf3fdSPer Liden 199b97bf3fdSPer Liden static void bclink_retransmit_pkt(u32 after, u32 to) 200b97bf3fdSPer Liden { 201b97bf3fdSPer Liden struct sk_buff *buf; 202b97bf3fdSPer Liden 203b97bf3fdSPer Liden buf = bcl->first_out; 204b97bf3fdSPer Liden while (buf && less_eq(buf_seqno(buf), after)) { 205b97bf3fdSPer Liden buf = buf->next; 206b97bf3fdSPer Liden } 2074323add6SPer Liden tipc_link_retransmit(bcl, buf, mod(to - after)); 208b97bf3fdSPer Liden } 209b97bf3fdSPer Liden 210b97bf3fdSPer Liden /** 2114323add6SPer Liden * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets 212b97bf3fdSPer Liden * @n_ptr: node that sent acknowledgement info 213b97bf3fdSPer Liden * @acked: broadcast sequence # that has been acknowledged 214b97bf3fdSPer Liden * 215b97bf3fdSPer Liden * Node is locked, bc_lock unlocked. 216b97bf3fdSPer Liden */ 217b97bf3fdSPer Liden 2186c00055aSDavid S. Miller void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked) 219b97bf3fdSPer Liden { 220b97bf3fdSPer Liden struct sk_buff *crs; 221b97bf3fdSPer Liden struct sk_buff *next; 222b97bf3fdSPer Liden unsigned int released = 0; 223b97bf3fdSPer Liden 224b97bf3fdSPer Liden if (less_eq(acked, n_ptr->bclink.acked)) 225b97bf3fdSPer Liden return; 226b97bf3fdSPer Liden 227b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 228b97bf3fdSPer Liden 229b97bf3fdSPer Liden /* Skip over packets that node has previously acknowledged */ 230b97bf3fdSPer Liden 231b97bf3fdSPer Liden crs = bcl->first_out; 232b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) { 233b97bf3fdSPer Liden crs = crs->next; 234b97bf3fdSPer Liden } 235b97bf3fdSPer Liden 236b97bf3fdSPer Liden /* Update packets that node is now acknowledging */ 237b97bf3fdSPer Liden 238b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), acked)) { 239b97bf3fdSPer Liden next = crs->next; 240b97bf3fdSPer Liden bcbuf_decr_acks(crs); 241b97bf3fdSPer Liden if (bcbuf_acks(crs) == 0) { 242b97bf3fdSPer Liden bcl->first_out = next; 243b97bf3fdSPer Liden bcl->out_queue_size--; 244b97bf3fdSPer Liden buf_discard(crs); 245b97bf3fdSPer Liden released = 1; 246b97bf3fdSPer Liden } 247b97bf3fdSPer Liden crs = next; 248b97bf3fdSPer Liden } 249b97bf3fdSPer Liden n_ptr->bclink.acked = acked; 250b97bf3fdSPer Liden 251b97bf3fdSPer Liden /* Try resolving broadcast link congestion, if necessary */ 252b97bf3fdSPer Liden 2535b1f7bdeSAllan Stephens if (unlikely(bcl->next_out)) { 2544323add6SPer Liden tipc_link_push_queue(bcl); 2555b1f7bdeSAllan Stephens bclink_set_last_sent(); 2565b1f7bdeSAllan Stephens } 257b97bf3fdSPer Liden if (unlikely(released && !list_empty(&bcl->waiting_ports))) 2584323add6SPer Liden tipc_link_wakeup_ports(bcl, 0); 259b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 260b97bf3fdSPer Liden } 261b97bf3fdSPer Liden 262b97bf3fdSPer Liden /** 263b97bf3fdSPer Liden * bclink_send_ack - unicast an ACK msg 264b97bf3fdSPer Liden * 2654323add6SPer Liden * tipc_net_lock and node lock set 266b97bf3fdSPer Liden */ 267b97bf3fdSPer Liden 2686c00055aSDavid S. Miller static void bclink_send_ack(struct tipc_node *n_ptr) 269b97bf3fdSPer Liden { 270b97bf3fdSPer Liden struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1]; 271b97bf3fdSPer Liden 272b97bf3fdSPer Liden if (l_ptr != NULL) 2734323add6SPer Liden tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0); 274b97bf3fdSPer Liden } 275b97bf3fdSPer Liden 276b97bf3fdSPer Liden /** 277b97bf3fdSPer Liden * bclink_send_nack- broadcast a NACK msg 278b97bf3fdSPer Liden * 2794323add6SPer Liden * tipc_net_lock and node lock set 280b97bf3fdSPer Liden */ 281b97bf3fdSPer Liden 2826c00055aSDavid S. Miller static void bclink_send_nack(struct tipc_node *n_ptr) 283b97bf3fdSPer Liden { 284b97bf3fdSPer Liden struct sk_buff *buf; 285b97bf3fdSPer Liden struct tipc_msg *msg; 286b97bf3fdSPer Liden 287b97bf3fdSPer Liden if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to)) 288b97bf3fdSPer Liden return; 289b97bf3fdSPer Liden 290b97bf3fdSPer Liden buf = buf_acquire(INT_H_SIZE); 291b97bf3fdSPer Liden if (buf) { 292b97bf3fdSPer Liden msg = buf_msg(buf); 293c68ca7b7SAllan Stephens tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG, 29475715217SAllan Stephens INT_H_SIZE, n_ptr->addr); 295b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 296b97bf3fdSPer Liden msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in)); 297b97bf3fdSPer Liden msg_set_bcgap_after(msg, n_ptr->bclink.gap_after); 298b97bf3fdSPer Liden msg_set_bcgap_to(msg, n_ptr->bclink.gap_to); 299b97bf3fdSPer Liden msg_set_bcast_tag(msg, tipc_own_tag); 300b97bf3fdSPer Liden 3011fc54d8fSSam Ravnborg if (tipc_bearer_send(&bcbearer->bearer, buf, NULL)) { 302b97bf3fdSPer Liden bcl->stats.sent_nacks++; 303b97bf3fdSPer Liden buf_discard(buf); 304b97bf3fdSPer Liden } else { 3054323add6SPer Liden tipc_bearer_schedule(bcl->b_ptr, bcl); 306b97bf3fdSPer Liden bcl->proto_msg_queue = buf; 307b97bf3fdSPer Liden bcl->stats.bearer_congs++; 308b97bf3fdSPer Liden } 309b97bf3fdSPer Liden 310b97bf3fdSPer Liden /* 311b97bf3fdSPer Liden * Ensure we doesn't send another NACK msg to the node 312b97bf3fdSPer Liden * until 16 more deferred messages arrive from it 313b97bf3fdSPer Liden * (i.e. helps prevent all nodes from NACK'ing at same time) 314b97bf3fdSPer Liden */ 315b97bf3fdSPer Liden 316b97bf3fdSPer Liden n_ptr->bclink.nack_sync = tipc_own_tag; 317b97bf3fdSPer Liden } 318b97bf3fdSPer Liden } 319b97bf3fdSPer Liden 320b97bf3fdSPer Liden /** 3214323add6SPer Liden * tipc_bclink_check_gap - send a NACK if a sequence gap exists 322b97bf3fdSPer Liden * 3234323add6SPer Liden * tipc_net_lock and node lock set 324b97bf3fdSPer Liden */ 325b97bf3fdSPer Liden 3266c00055aSDavid S. Miller void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 last_sent) 327b97bf3fdSPer Liden { 328b97bf3fdSPer Liden if (!n_ptr->bclink.supported || 329b97bf3fdSPer Liden less_eq(last_sent, mod(n_ptr->bclink.last_in))) 330b97bf3fdSPer Liden return; 331b97bf3fdSPer Liden 332b97bf3fdSPer Liden bclink_set_gap(n_ptr); 333b97bf3fdSPer Liden if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to) 334b97bf3fdSPer Liden n_ptr->bclink.gap_to = last_sent; 335b97bf3fdSPer Liden bclink_send_nack(n_ptr); 336b97bf3fdSPer Liden } 337b97bf3fdSPer Liden 338b97bf3fdSPer Liden /** 3394323add6SPer Liden * tipc_bclink_peek_nack - process a NACK msg meant for another node 340b97bf3fdSPer Liden * 3414323add6SPer Liden * Only tipc_net_lock set. 342b97bf3fdSPer Liden */ 343b97bf3fdSPer Liden 344988f088aSAdrian Bunk static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to) 345b97bf3fdSPer Liden { 3466c00055aSDavid S. Miller struct tipc_node *n_ptr = tipc_node_find(dest); 347b97bf3fdSPer Liden u32 my_after, my_to; 348b97bf3fdSPer Liden 3494323add6SPer Liden if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr))) 350b97bf3fdSPer Liden return; 3514323add6SPer Liden tipc_node_lock(n_ptr); 352b97bf3fdSPer Liden /* 353b97bf3fdSPer Liden * Modify gap to suppress unnecessary NACKs from this node 354b97bf3fdSPer Liden */ 355b97bf3fdSPer Liden my_after = n_ptr->bclink.gap_after; 356b97bf3fdSPer Liden my_to = n_ptr->bclink.gap_to; 357b97bf3fdSPer Liden 358b97bf3fdSPer Liden if (less_eq(gap_after, my_after)) { 359b97bf3fdSPer Liden if (less(my_after, gap_to) && less(gap_to, my_to)) 360b97bf3fdSPer Liden n_ptr->bclink.gap_after = gap_to; 361b97bf3fdSPer Liden else if (less_eq(my_to, gap_to)) 362b97bf3fdSPer Liden n_ptr->bclink.gap_to = n_ptr->bclink.gap_after; 363b97bf3fdSPer Liden } else if (less_eq(gap_after, my_to)) { 364b97bf3fdSPer Liden if (less_eq(my_to, gap_to)) 365b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 366b97bf3fdSPer Liden } else { 367b97bf3fdSPer Liden /* 368b97bf3fdSPer Liden * Expand gap if missing bufs not in deferred queue: 369b97bf3fdSPer Liden */ 370b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 371b97bf3fdSPer Liden u32 prev = n_ptr->bclink.gap_to; 372b97bf3fdSPer Liden 373b97bf3fdSPer Liden for (; buf; buf = buf->next) { 374b97bf3fdSPer Liden u32 seqno = buf_seqno(buf); 375b97bf3fdSPer Liden 3763ac90216SEric Sesterhenn if (mod(seqno - prev) != 1) { 377b97bf3fdSPer Liden buf = NULL; 3783ac90216SEric Sesterhenn break; 3793ac90216SEric Sesterhenn } 380b97bf3fdSPer Liden if (seqno == gap_after) 381b97bf3fdSPer Liden break; 382b97bf3fdSPer Liden prev = seqno; 383b97bf3fdSPer Liden } 384b97bf3fdSPer Liden if (buf == NULL) 385b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 386b97bf3fdSPer Liden } 387b97bf3fdSPer Liden /* 388b97bf3fdSPer Liden * Some nodes may send a complementary NACK now: 389b97bf3fdSPer Liden */ 390b97bf3fdSPer Liden if (bclink_ack_allowed(sender_tag + 1)) { 391b97bf3fdSPer Liden if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) { 392b97bf3fdSPer Liden bclink_send_nack(n_ptr); 393b97bf3fdSPer Liden bclink_set_gap(n_ptr); 394b97bf3fdSPer Liden } 395b97bf3fdSPer Liden } 3964323add6SPer Liden tipc_node_unlock(n_ptr); 397b97bf3fdSPer Liden } 398b97bf3fdSPer Liden 399b97bf3fdSPer Liden /** 4004323add6SPer Liden * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster 401b97bf3fdSPer Liden */ 402b97bf3fdSPer Liden 4034323add6SPer Liden int tipc_bclink_send_msg(struct sk_buff *buf) 404b97bf3fdSPer Liden { 405b97bf3fdSPer Liden int res; 406b97bf3fdSPer Liden 407b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 408b97bf3fdSPer Liden 4094323add6SPer Liden res = tipc_link_send_buf(bcl, buf); 410b97bf3fdSPer Liden if (unlikely(res == -ELINKCONG)) 411b97bf3fdSPer Liden buf_discard(buf); 4120048b826SAllan Stephens else 4135b1f7bdeSAllan Stephens bclink_set_last_sent(); 414b97bf3fdSPer Liden 415b97bf3fdSPer Liden if (bcl->out_queue_size > bcl->stats.max_queue_sz) 416b97bf3fdSPer Liden bcl->stats.max_queue_sz = bcl->out_queue_size; 417b97bf3fdSPer Liden bcl->stats.queue_sz_counts++; 418b97bf3fdSPer Liden bcl->stats.accu_queue_sz += bcl->out_queue_size; 419b97bf3fdSPer Liden 420b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 421b97bf3fdSPer Liden return res; 422b97bf3fdSPer Liden } 423b97bf3fdSPer Liden 424b97bf3fdSPer Liden /** 4254323add6SPer Liden * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards 426b97bf3fdSPer Liden * 4274323add6SPer Liden * tipc_net_lock is read_locked, no other locks set 428b97bf3fdSPer Liden */ 429b97bf3fdSPer Liden 4304323add6SPer Liden void tipc_bclink_recv_pkt(struct sk_buff *buf) 431b97bf3fdSPer Liden { 432d356eebaSAllan Stephens #if (TIPC_BCAST_LOSS_RATE) 433d356eebaSAllan Stephens static int rx_count = 0; 434d356eebaSAllan Stephens #endif 435b97bf3fdSPer Liden struct tipc_msg *msg = buf_msg(buf); 4366c00055aSDavid S. Miller struct tipc_node* node = tipc_node_find(msg_prevnode(msg)); 437b97bf3fdSPer Liden u32 next_in; 438b97bf3fdSPer Liden u32 seqno; 439b97bf3fdSPer Liden struct sk_buff *deferred; 440b97bf3fdSPer Liden 441b97bf3fdSPer Liden msg_dbg(msg, "<BC<<<"); 442b97bf3fdSPer Liden 4434323add6SPer Liden if (unlikely(!node || !tipc_node_is_up(node) || !node->bclink.supported || 444b97bf3fdSPer Liden (msg_mc_netid(msg) != tipc_net_id))) { 445b97bf3fdSPer Liden buf_discard(buf); 446b97bf3fdSPer Liden return; 447b97bf3fdSPer Liden } 448b97bf3fdSPer Liden 449b97bf3fdSPer Liden if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { 450b97bf3fdSPer Liden msg_dbg(msg, "<BCNACK<<<"); 451b97bf3fdSPer Liden if (msg_destnode(msg) == tipc_own_addr) { 4524323add6SPer Liden tipc_node_lock(node); 4534323add6SPer Liden tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); 4544323add6SPer Liden tipc_node_unlock(node); 455d356eebaSAllan Stephens spin_lock_bh(&bc_lock); 456b97bf3fdSPer Liden bcl->stats.recv_nacks++; 457d356eebaSAllan Stephens bcl->owner->next = node; /* remember requestor */ 458b97bf3fdSPer Liden bclink_retransmit_pkt(msg_bcgap_after(msg), 459b97bf3fdSPer Liden msg_bcgap_to(msg)); 460d356eebaSAllan Stephens bcl->owner->next = NULL; 461d356eebaSAllan Stephens spin_unlock_bh(&bc_lock); 462b97bf3fdSPer Liden } else { 4634323add6SPer Liden tipc_bclink_peek_nack(msg_destnode(msg), 464b97bf3fdSPer Liden msg_bcast_tag(msg), 465b97bf3fdSPer Liden msg_bcgap_after(msg), 466b97bf3fdSPer Liden msg_bcgap_to(msg)); 467b97bf3fdSPer Liden } 468b97bf3fdSPer Liden buf_discard(buf); 469b97bf3fdSPer Liden return; 470b97bf3fdSPer Liden } 471b97bf3fdSPer Liden 472d356eebaSAllan Stephens #if (TIPC_BCAST_LOSS_RATE) 473d356eebaSAllan Stephens if (++rx_count == TIPC_BCAST_LOSS_RATE) { 474d356eebaSAllan Stephens rx_count = 0; 475d356eebaSAllan Stephens buf_discard(buf); 476d356eebaSAllan Stephens return; 477d356eebaSAllan Stephens } 478d356eebaSAllan Stephens #endif 479d356eebaSAllan Stephens 4804323add6SPer Liden tipc_node_lock(node); 481b97bf3fdSPer Liden receive: 482b97bf3fdSPer Liden deferred = node->bclink.deferred_head; 483b97bf3fdSPer Liden next_in = mod(node->bclink.last_in + 1); 484b97bf3fdSPer Liden seqno = msg_seqno(msg); 485b97bf3fdSPer Liden 486b97bf3fdSPer Liden if (likely(seqno == next_in)) { 487b97bf3fdSPer Liden bcl->stats.recv_info++; 488b97bf3fdSPer Liden node->bclink.last_in++; 489b97bf3fdSPer Liden bclink_set_gap(node); 490b97bf3fdSPer Liden if (unlikely(bclink_ack_allowed(seqno))) { 491b97bf3fdSPer Liden bclink_send_ack(node); 492b97bf3fdSPer Liden bcl->stats.sent_acks++; 493b97bf3fdSPer Liden } 494b97bf3fdSPer Liden if (likely(msg_isdata(msg))) { 4954323add6SPer Liden tipc_node_unlock(node); 4964323add6SPer Liden tipc_port_recv_mcast(buf, NULL); 497b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_BUNDLER) { 498b97bf3fdSPer Liden bcl->stats.recv_bundles++; 499b97bf3fdSPer Liden bcl->stats.recv_bundled += msg_msgcnt(msg); 5004323add6SPer Liden tipc_node_unlock(node); 5014323add6SPer Liden tipc_link_recv_bundle(buf); 502b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_FRAGMENTER) { 503b97bf3fdSPer Liden bcl->stats.recv_fragments++; 5044323add6SPer Liden if (tipc_link_recv_fragment(&node->bclink.defragm, 505b97bf3fdSPer Liden &buf, &msg)) 506b97bf3fdSPer Liden bcl->stats.recv_fragmented++; 5074323add6SPer Liden tipc_node_unlock(node); 5084323add6SPer Liden tipc_net_route_msg(buf); 509b97bf3fdSPer Liden } else { 5104323add6SPer Liden tipc_node_unlock(node); 5114323add6SPer Liden tipc_net_route_msg(buf); 512b97bf3fdSPer Liden } 513b97bf3fdSPer Liden if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) { 5144323add6SPer Liden tipc_node_lock(node); 515b97bf3fdSPer Liden buf = deferred; 516b97bf3fdSPer Liden msg = buf_msg(buf); 517b97bf3fdSPer Liden node->bclink.deferred_head = deferred->next; 518b97bf3fdSPer Liden goto receive; 519b97bf3fdSPer Liden } 520b97bf3fdSPer Liden return; 521b97bf3fdSPer Liden } else if (less(next_in, seqno)) { 522b97bf3fdSPer Liden u32 gap_after = node->bclink.gap_after; 523b97bf3fdSPer Liden u32 gap_to = node->bclink.gap_to; 524b97bf3fdSPer Liden 5254323add6SPer Liden if (tipc_link_defer_pkt(&node->bclink.deferred_head, 526b97bf3fdSPer Liden &node->bclink.deferred_tail, 527b97bf3fdSPer Liden buf)) { 528b97bf3fdSPer Liden node->bclink.nack_sync++; 529b97bf3fdSPer Liden bcl->stats.deferred_recv++; 530b97bf3fdSPer Liden if (seqno == mod(gap_after + 1)) 531b97bf3fdSPer Liden node->bclink.gap_after = seqno; 532b97bf3fdSPer Liden else if (less(gap_after, seqno) && less(seqno, gap_to)) 533b97bf3fdSPer Liden node->bclink.gap_to = seqno; 534b97bf3fdSPer Liden } 535b97bf3fdSPer Liden if (bclink_ack_allowed(node->bclink.nack_sync)) { 536b97bf3fdSPer Liden if (gap_to != gap_after) 537b97bf3fdSPer Liden bclink_send_nack(node); 538b97bf3fdSPer Liden bclink_set_gap(node); 539b97bf3fdSPer Liden } 540b97bf3fdSPer Liden } else { 541b97bf3fdSPer Liden bcl->stats.duplicates++; 542b97bf3fdSPer Liden buf_discard(buf); 543b97bf3fdSPer Liden } 5444323add6SPer Liden tipc_node_unlock(node); 545b97bf3fdSPer Liden } 546b97bf3fdSPer Liden 5476c00055aSDavid S. Miller u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) 548b97bf3fdSPer Liden { 549b97bf3fdSPer Liden return (n_ptr->bclink.supported && 5504323add6SPer Liden (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); 551b97bf3fdSPer Liden } 552b97bf3fdSPer Liden 553b97bf3fdSPer Liden 554b97bf3fdSPer Liden /** 5554323add6SPer Liden * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer 556b97bf3fdSPer Liden * 557b97bf3fdSPer Liden * Send through as many bearers as necessary to reach all nodes 558b97bf3fdSPer Liden * that support TIPC multicasting. 559b97bf3fdSPer Liden * 560b97bf3fdSPer Liden * Returns 0 if packet sent successfully, non-zero if not 561b97bf3fdSPer Liden */ 562b97bf3fdSPer Liden 563988f088aSAdrian Bunk static int tipc_bcbearer_send(struct sk_buff *buf, 564b97bf3fdSPer Liden struct tipc_bearer *unused1, 565b97bf3fdSPer Liden struct tipc_media_addr *unused2) 566b97bf3fdSPer Liden { 567b97bf3fdSPer Liden int bp_index; 568b97bf3fdSPer Liden 569b97bf3fdSPer Liden /* Prepare buffer for broadcasting (if first time trying to send it) */ 570b97bf3fdSPer Liden 571b97bf3fdSPer Liden if (likely(!msg_non_seq(buf_msg(buf)))) { 572b97bf3fdSPer Liden struct tipc_msg *msg; 573b97bf3fdSPer Liden 5744323add6SPer Liden assert(tipc_cltr_bcast_nodes.count != 0); 5754323add6SPer Liden bcbuf_set_acks(buf, tipc_cltr_bcast_nodes.count); 576b97bf3fdSPer Liden msg = buf_msg(buf); 57740aecb1bSAllan Stephens msg_set_non_seq(msg, 1); 578b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 5790048b826SAllan Stephens bcl->stats.sent_info++; 580b97bf3fdSPer Liden } 581b97bf3fdSPer Liden 582b97bf3fdSPer Liden /* Send buffer over bearers until all targets reached */ 583b97bf3fdSPer Liden 58465f51ef0SAllan Stephens bcbearer->remains = tipc_cltr_bcast_nodes; 585b97bf3fdSPer Liden 586b97bf3fdSPer Liden for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { 587b97bf3fdSPer Liden struct bearer *p = bcbearer->bpairs[bp_index].primary; 588b97bf3fdSPer Liden struct bearer *s = bcbearer->bpairs[bp_index].secondary; 589b97bf3fdSPer Liden 590b97bf3fdSPer Liden if (!p) 591b97bf3fdSPer Liden break; /* no more bearers to try */ 592b97bf3fdSPer Liden 59365f51ef0SAllan Stephens tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new); 59465f51ef0SAllan Stephens if (bcbearer->remains_new.count == bcbearer->remains.count) 595b97bf3fdSPer Liden continue; /* bearer pair doesn't add anything */ 596b97bf3fdSPer Liden 5971a624832SNeil Horman if (p->publ.blocked || 5981a624832SNeil Horman p->media->send_msg(buf, &p->publ, &p->media->bcast_addr)) { 5991a624832SNeil Horman /* unable to send on primary bearer */ 6001a624832SNeil Horman if (!s || s->publ.blocked || 6011a624832SNeil Horman s->media->send_msg(buf, &s->publ, 6021a624832SNeil Horman &s->media->bcast_addr)) { 6031a624832SNeil Horman /* unable to send on either bearer */ 6041a624832SNeil Horman continue; 6051a624832SNeil Horman } 606b97bf3fdSPer Liden } 607b97bf3fdSPer Liden 6081a624832SNeil Horman if (s) { 609b97bf3fdSPer Liden bcbearer->bpairs[bp_index].primary = s; 610b97bf3fdSPer Liden bcbearer->bpairs[bp_index].secondary = p; 6111a624832SNeil Horman } 6121a624832SNeil Horman 61365f51ef0SAllan Stephens if (bcbearer->remains_new.count == 0) 6140e35fd5eSAllan Stephens return 0; 615b97bf3fdSPer Liden 61665f51ef0SAllan Stephens bcbearer->remains = bcbearer->remains_new; 617b97bf3fdSPer Liden } 618b97bf3fdSPer Liden 6197e3e5d09SAllan Stephens /* 6207e3e5d09SAllan Stephens * Unable to reach all targets (indicate success, since currently 6217e3e5d09SAllan Stephens * there isn't code in place to properly block & unblock the 6227e3e5d09SAllan Stephens * pseudo-bearer used by the broadcast link) 6237e3e5d09SAllan Stephens */ 624b97bf3fdSPer Liden 6257e3e5d09SAllan Stephens return TIPC_OK; 626b97bf3fdSPer Liden } 627b97bf3fdSPer Liden 628b97bf3fdSPer Liden /** 6294323add6SPer Liden * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer 630b97bf3fdSPer Liden */ 631b97bf3fdSPer Liden 6324323add6SPer Liden void tipc_bcbearer_sort(void) 633b97bf3fdSPer Liden { 634b97bf3fdSPer Liden struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp; 635b97bf3fdSPer Liden struct bcbearer_pair *bp_curr; 636b97bf3fdSPer Liden int b_index; 637b97bf3fdSPer Liden int pri; 638b97bf3fdSPer Liden 639b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 640b97bf3fdSPer Liden 641b97bf3fdSPer Liden /* Group bearers by priority (can assume max of two per priority) */ 642b97bf3fdSPer Liden 643b97bf3fdSPer Liden memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); 644b97bf3fdSPer Liden 645b97bf3fdSPer Liden for (b_index = 0; b_index < MAX_BEARERS; b_index++) { 6464323add6SPer Liden struct bearer *b = &tipc_bearers[b_index]; 647b97bf3fdSPer Liden 648b97bf3fdSPer Liden if (!b->active || !b->nodes.count) 649b97bf3fdSPer Liden continue; 650b97bf3fdSPer Liden 651b97bf3fdSPer Liden if (!bp_temp[b->priority].primary) 652b97bf3fdSPer Liden bp_temp[b->priority].primary = b; 653b97bf3fdSPer Liden else 654b97bf3fdSPer Liden bp_temp[b->priority].secondary = b; 655b97bf3fdSPer Liden } 656b97bf3fdSPer Liden 657b97bf3fdSPer Liden /* Create array of bearer pairs for broadcasting */ 658b97bf3fdSPer Liden 659b97bf3fdSPer Liden bp_curr = bcbearer->bpairs; 660b97bf3fdSPer Liden memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); 661b97bf3fdSPer Liden 66216cb4b33SPer Liden for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { 663b97bf3fdSPer Liden 664b97bf3fdSPer Liden if (!bp_temp[pri].primary) 665b97bf3fdSPer Liden continue; 666b97bf3fdSPer Liden 667b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].primary; 668b97bf3fdSPer Liden 669b97bf3fdSPer Liden if (bp_temp[pri].secondary) { 6704323add6SPer Liden if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, 671b97bf3fdSPer Liden &bp_temp[pri].secondary->nodes)) { 672b97bf3fdSPer Liden bp_curr->secondary = bp_temp[pri].secondary; 673b97bf3fdSPer Liden } else { 674b97bf3fdSPer Liden bp_curr++; 675b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].secondary; 676b97bf3fdSPer Liden } 677b97bf3fdSPer Liden } 678b97bf3fdSPer Liden 679b97bf3fdSPer Liden bp_curr++; 680b97bf3fdSPer Liden } 681b97bf3fdSPer Liden 682b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 683b97bf3fdSPer Liden } 684b97bf3fdSPer Liden 685b97bf3fdSPer Liden /** 6864323add6SPer Liden * tipc_bcbearer_push - resolve bearer congestion 687b97bf3fdSPer Liden * 688b97bf3fdSPer Liden * Forces bclink to push out any unsent packets, until all packets are gone 689b97bf3fdSPer Liden * or congestion reoccurs. 690b97bf3fdSPer Liden * No locks set when function called 691b97bf3fdSPer Liden */ 692b97bf3fdSPer Liden 6934323add6SPer Liden void tipc_bcbearer_push(void) 694b97bf3fdSPer Liden { 695b97bf3fdSPer Liden struct bearer *b_ptr; 696b97bf3fdSPer Liden 697b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 698b97bf3fdSPer Liden b_ptr = &bcbearer->bearer; 699b97bf3fdSPer Liden if (b_ptr->publ.blocked) { 700b97bf3fdSPer Liden b_ptr->publ.blocked = 0; 7014323add6SPer Liden tipc_bearer_lock_push(b_ptr); 702b97bf3fdSPer Liden } 703b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 704b97bf3fdSPer Liden } 705b97bf3fdSPer Liden 706b97bf3fdSPer Liden 7074323add6SPer Liden int tipc_bclink_stats(char *buf, const u32 buf_size) 708b97bf3fdSPer Liden { 709b97bf3fdSPer Liden struct print_buf pb; 710b97bf3fdSPer Liden 711b97bf3fdSPer Liden if (!bcl) 712b97bf3fdSPer Liden return 0; 713b97bf3fdSPer Liden 7144323add6SPer Liden tipc_printbuf_init(&pb, buf, buf_size); 715b97bf3fdSPer Liden 716b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 717b97bf3fdSPer Liden 718b97bf3fdSPer Liden tipc_printf(&pb, "Link <%s>\n" 719b97bf3fdSPer Liden " Window:%u packets\n", 720b97bf3fdSPer Liden bcl->name, bcl->queue_limit[0]); 721b97bf3fdSPer Liden tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n", 722b97bf3fdSPer Liden bcl->stats.recv_info, 723b97bf3fdSPer Liden bcl->stats.recv_fragments, 724b97bf3fdSPer Liden bcl->stats.recv_fragmented, 725b97bf3fdSPer Liden bcl->stats.recv_bundles, 726b97bf3fdSPer Liden bcl->stats.recv_bundled); 727b97bf3fdSPer Liden tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n", 728b97bf3fdSPer Liden bcl->stats.sent_info, 729b97bf3fdSPer Liden bcl->stats.sent_fragments, 730b97bf3fdSPer Liden bcl->stats.sent_fragmented, 731b97bf3fdSPer Liden bcl->stats.sent_bundles, 732b97bf3fdSPer Liden bcl->stats.sent_bundled); 733b97bf3fdSPer Liden tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n", 734b97bf3fdSPer Liden bcl->stats.recv_nacks, 735b97bf3fdSPer Liden bcl->stats.deferred_recv, 736b97bf3fdSPer Liden bcl->stats.duplicates); 737b97bf3fdSPer Liden tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n", 738b97bf3fdSPer Liden bcl->stats.sent_nacks, 739b97bf3fdSPer Liden bcl->stats.sent_acks, 740b97bf3fdSPer Liden bcl->stats.retransmitted); 741b97bf3fdSPer Liden tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n", 742b97bf3fdSPer Liden bcl->stats.bearer_congs, 743b97bf3fdSPer Liden bcl->stats.link_congs, 744b97bf3fdSPer Liden bcl->stats.max_queue_sz, 745b97bf3fdSPer Liden bcl->stats.queue_sz_counts 746b97bf3fdSPer Liden ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts) 747b97bf3fdSPer Liden : 0); 748b97bf3fdSPer Liden 749b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7504323add6SPer Liden return tipc_printbuf_validate(&pb); 751b97bf3fdSPer Liden } 752b97bf3fdSPer Liden 7534323add6SPer Liden int tipc_bclink_reset_stats(void) 754b97bf3fdSPer Liden { 755b97bf3fdSPer Liden if (!bcl) 756b97bf3fdSPer Liden return -ENOPROTOOPT; 757b97bf3fdSPer Liden 758b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 759b97bf3fdSPer Liden memset(&bcl->stats, 0, sizeof(bcl->stats)); 760b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7610e35fd5eSAllan Stephens return 0; 762b97bf3fdSPer Liden } 763b97bf3fdSPer Liden 7644323add6SPer Liden int tipc_bclink_set_queue_limits(u32 limit) 765b97bf3fdSPer Liden { 766b97bf3fdSPer Liden if (!bcl) 767b97bf3fdSPer Liden return -ENOPROTOOPT; 768b97bf3fdSPer Liden if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) 769b97bf3fdSPer Liden return -EINVAL; 770b97bf3fdSPer Liden 771b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 7724323add6SPer Liden tipc_link_set_queue_limits(bcl, limit); 773b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7740e35fd5eSAllan Stephens return 0; 775b97bf3fdSPer Liden } 776b97bf3fdSPer Liden 7774323add6SPer Liden int tipc_bclink_init(void) 778b97bf3fdSPer Liden { 7792710b57fSArnaldo Carvalho de Melo bcbearer = kzalloc(sizeof(*bcbearer), GFP_ATOMIC); 7802710b57fSArnaldo Carvalho de Melo bclink = kzalloc(sizeof(*bclink), GFP_ATOMIC); 781b97bf3fdSPer Liden if (!bcbearer || !bclink) { 782b97bf3fdSPer Liden nomem: 783a10bd924SAllan Stephens warn("Multicast link creation failed, no memory\n"); 784b97bf3fdSPer Liden kfree(bcbearer); 785b97bf3fdSPer Liden bcbearer = NULL; 786b97bf3fdSPer Liden kfree(bclink); 787b97bf3fdSPer Liden bclink = NULL; 788b97bf3fdSPer Liden return -ENOMEM; 789b97bf3fdSPer Liden } 790b97bf3fdSPer Liden 791b97bf3fdSPer Liden INIT_LIST_HEAD(&bcbearer->bearer.cong_links); 792b97bf3fdSPer Liden bcbearer->bearer.media = &bcbearer->media; 7934323add6SPer Liden bcbearer->media.send_msg = tipc_bcbearer_send; 794b97bf3fdSPer Liden sprintf(bcbearer->media.name, "tipc-multicast"); 795b97bf3fdSPer Liden 796b97bf3fdSPer Liden bcl = &bclink->link; 797b97bf3fdSPer Liden INIT_LIST_HEAD(&bcl->waiting_ports); 798b97bf3fdSPer Liden bcl->next_out_no = 1; 79934af946aSIngo Molnar spin_lock_init(&bclink->node.lock); 800b97bf3fdSPer Liden bcl->owner = &bclink->node; 801b97bf3fdSPer Liden bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; 8024323add6SPer Liden tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); 803b97bf3fdSPer Liden bcl->b_ptr = &bcbearer->bearer; 804b97bf3fdSPer Liden bcl->state = WORKING_WORKING; 8054b704d59SStephen Hemminger strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME); 806b97bf3fdSPer Liden 807b97bf3fdSPer Liden if (BCLINK_LOG_BUF_SIZE) { 808b97bf3fdSPer Liden char *pb = kmalloc(BCLINK_LOG_BUF_SIZE, GFP_ATOMIC); 809b97bf3fdSPer Liden 810b97bf3fdSPer Liden if (!pb) 811b97bf3fdSPer Liden goto nomem; 8124323add6SPer Liden tipc_printbuf_init(&bcl->print_buf, pb, BCLINK_LOG_BUF_SIZE); 813b97bf3fdSPer Liden } 814b97bf3fdSPer Liden 8150e35fd5eSAllan Stephens return 0; 816b97bf3fdSPer Liden } 817b97bf3fdSPer Liden 8184323add6SPer Liden void tipc_bclink_stop(void) 819b97bf3fdSPer Liden { 820b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 821b97bf3fdSPer Liden if (bcbearer) { 8224323add6SPer Liden tipc_link_stop(bcl); 823b97bf3fdSPer Liden if (BCLINK_LOG_BUF_SIZE) 824b97bf3fdSPer Liden kfree(bcl->print_buf.buf); 825b97bf3fdSPer Liden bcl = NULL; 826b97bf3fdSPer Liden kfree(bclink); 827b97bf3fdSPer Liden bclink = NULL; 828b97bf3fdSPer Liden kfree(bcbearer); 829b97bf3fdSPer Liden bcbearer = NULL; 830b97bf3fdSPer Liden } 831b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 832b97bf3fdSPer Liden } 833b97bf3fdSPer Liden 8343e22e62bSAllan Stephens 8353e22e62bSAllan Stephens /** 8363e22e62bSAllan Stephens * tipc_nmap_add - add a node to a node map 8373e22e62bSAllan Stephens */ 8383e22e62bSAllan Stephens 8393e22e62bSAllan Stephens void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node) 8403e22e62bSAllan Stephens { 8413e22e62bSAllan Stephens int n = tipc_node(node); 8423e22e62bSAllan Stephens int w = n / WSIZE; 8433e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8443e22e62bSAllan Stephens 8453e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) == 0) { 8463e22e62bSAllan Stephens nm_ptr->count++; 8473e22e62bSAllan Stephens nm_ptr->map[w] |= mask; 8483e22e62bSAllan Stephens } 8493e22e62bSAllan Stephens } 8503e22e62bSAllan Stephens 8513e22e62bSAllan Stephens /** 8523e22e62bSAllan Stephens * tipc_nmap_remove - remove a node from a node map 8533e22e62bSAllan Stephens */ 8543e22e62bSAllan Stephens 8553e22e62bSAllan Stephens void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node) 8563e22e62bSAllan Stephens { 8573e22e62bSAllan Stephens int n = tipc_node(node); 8583e22e62bSAllan Stephens int w = n / WSIZE; 8593e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8603e22e62bSAllan Stephens 8613e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) != 0) { 8623e22e62bSAllan Stephens nm_ptr->map[w] &= ~mask; 8633e22e62bSAllan Stephens nm_ptr->count--; 8643e22e62bSAllan Stephens } 8653e22e62bSAllan Stephens } 8663e22e62bSAllan Stephens 8673e22e62bSAllan Stephens /** 8683e22e62bSAllan Stephens * tipc_nmap_diff - find differences between node maps 8693e22e62bSAllan Stephens * @nm_a: input node map A 8703e22e62bSAllan Stephens * @nm_b: input node map B 8713e22e62bSAllan Stephens * @nm_diff: output node map A-B (i.e. nodes of A that are not in B) 8723e22e62bSAllan Stephens */ 8733e22e62bSAllan Stephens 8743e22e62bSAllan Stephens void tipc_nmap_diff(struct tipc_node_map *nm_a, struct tipc_node_map *nm_b, 8753e22e62bSAllan Stephens struct tipc_node_map *nm_diff) 8763e22e62bSAllan Stephens { 8773e22e62bSAllan Stephens int stop = ARRAY_SIZE(nm_a->map); 8783e22e62bSAllan Stephens int w; 8793e22e62bSAllan Stephens int b; 8803e22e62bSAllan Stephens u32 map; 8813e22e62bSAllan Stephens 8823e22e62bSAllan Stephens memset(nm_diff, 0, sizeof(*nm_diff)); 8833e22e62bSAllan Stephens for (w = 0; w < stop; w++) { 8843e22e62bSAllan Stephens map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]); 8853e22e62bSAllan Stephens nm_diff->map[w] = map; 8863e22e62bSAllan Stephens if (map != 0) { 8873e22e62bSAllan Stephens for (b = 0 ; b < WSIZE; b++) { 8883e22e62bSAllan Stephens if (map & (1 << b)) 8893e22e62bSAllan Stephens nm_diff->count++; 8903e22e62bSAllan Stephens } 8913e22e62bSAllan Stephens } 8923e22e62bSAllan Stephens } 8933e22e62bSAllan Stephens } 89443608edcSAllan Stephens 89543608edcSAllan Stephens /** 89643608edcSAllan Stephens * tipc_port_list_add - add a port to a port list, ensuring no duplicates 89743608edcSAllan Stephens */ 89843608edcSAllan Stephens 89943608edcSAllan Stephens void tipc_port_list_add(struct port_list *pl_ptr, u32 port) 90043608edcSAllan Stephens { 90143608edcSAllan Stephens struct port_list *item = pl_ptr; 90243608edcSAllan Stephens int i; 90343608edcSAllan Stephens int item_sz = PLSIZE; 90443608edcSAllan Stephens int cnt = pl_ptr->count; 90543608edcSAllan Stephens 90643608edcSAllan Stephens for (; ; cnt -= item_sz, item = item->next) { 90743608edcSAllan Stephens if (cnt < PLSIZE) 90843608edcSAllan Stephens item_sz = cnt; 90943608edcSAllan Stephens for (i = 0; i < item_sz; i++) 91043608edcSAllan Stephens if (item->ports[i] == port) 91143608edcSAllan Stephens return; 91243608edcSAllan Stephens if (i < PLSIZE) { 91343608edcSAllan Stephens item->ports[i] = port; 91443608edcSAllan Stephens pl_ptr->count++; 91543608edcSAllan Stephens return; 91643608edcSAllan Stephens } 91743608edcSAllan Stephens if (!item->next) { 91843608edcSAllan Stephens item->next = kmalloc(sizeof(*item), GFP_ATOMIC); 91943608edcSAllan Stephens if (!item->next) { 92043608edcSAllan Stephens warn("Incomplete multicast delivery, no memory\n"); 92143608edcSAllan Stephens return; 92243608edcSAllan Stephens } 92343608edcSAllan Stephens item->next->next = NULL; 92443608edcSAllan Stephens } 92543608edcSAllan Stephens } 92643608edcSAllan Stephens } 92743608edcSAllan Stephens 92843608edcSAllan Stephens /** 92943608edcSAllan Stephens * tipc_port_list_free - free dynamically created entries in port_list chain 93043608edcSAllan Stephens * 93143608edcSAllan Stephens */ 93243608edcSAllan Stephens 93343608edcSAllan Stephens void tipc_port_list_free(struct port_list *pl_ptr) 93443608edcSAllan Stephens { 93543608edcSAllan Stephens struct port_list *item; 93643608edcSAllan Stephens struct port_list *next; 93743608edcSAllan Stephens 93843608edcSAllan Stephens for (item = pl_ptr->next; item; item = next) { 93943608edcSAllan Stephens next = item->next; 94043608edcSAllan Stephens kfree(item); 94143608edcSAllan Stephens } 94243608edcSAllan Stephens } 94343608edcSAllan Stephens 944