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 "link.h" 40b97bf3fdSPer Liden #include "port.h" 41b97bf3fdSPer Liden #include "name_distr.h" 42b97bf3fdSPer Liden #include "bcast.h" 43b97bf3fdSPer Liden 44b97bf3fdSPer Liden #define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */ 45b97bf3fdSPer Liden 46b97bf3fdSPer Liden #define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */ 47b97bf3fdSPer Liden 48b97bf3fdSPer Liden #define BCLINK_LOG_BUF_SIZE 0 49b97bf3fdSPer Liden 50d356eebaSAllan Stephens /* 51d356eebaSAllan Stephens * Loss rate for incoming broadcast frames; used to test retransmission code. 52d356eebaSAllan Stephens * Set to N to cause every N'th frame to be discarded; 0 => don't discard any. 53d356eebaSAllan Stephens */ 54d356eebaSAllan Stephens 55d356eebaSAllan Stephens #define TIPC_BCAST_LOSS_RATE 0 56d356eebaSAllan Stephens 57b97bf3fdSPer Liden /** 58b97bf3fdSPer Liden * struct bcbearer_pair - a pair of bearers used by broadcast link 59b97bf3fdSPer Liden * @primary: pointer to primary bearer 60b97bf3fdSPer Liden * @secondary: pointer to secondary bearer 61b97bf3fdSPer Liden * 62b97bf3fdSPer Liden * Bearers must have same priority and same set of reachable destinations 63b97bf3fdSPer Liden * to be paired. 64b97bf3fdSPer Liden */ 65b97bf3fdSPer Liden 66b97bf3fdSPer Liden struct bcbearer_pair { 67b97bf3fdSPer Liden struct bearer *primary; 68b97bf3fdSPer Liden struct bearer *secondary; 69b97bf3fdSPer Liden }; 70b97bf3fdSPer Liden 71b97bf3fdSPer Liden /** 72b97bf3fdSPer Liden * struct bcbearer - bearer used by broadcast link 73b97bf3fdSPer Liden * @bearer: (non-standard) broadcast bearer structure 74b97bf3fdSPer Liden * @media: (non-standard) broadcast media structure 75b97bf3fdSPer Liden * @bpairs: array of bearer pairs 7665f51ef0SAllan Stephens * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort() 7765f51ef0SAllan Stephens * @remains: temporary node map used by tipc_bcbearer_send() 7865f51ef0SAllan Stephens * @remains_new: temporary node map used tipc_bcbearer_send() 7965f51ef0SAllan Stephens * 8065f51ef0SAllan Stephens * Note: The fields labelled "temporary" are incorporated into the bearer 8165f51ef0SAllan Stephens * to avoid consuming potentially limited stack space through the use of 8265f51ef0SAllan Stephens * large local variables within multicast routines. Concurrent access is 8365f51ef0SAllan Stephens * prevented through use of the spinlock "bc_lock". 84b97bf3fdSPer Liden */ 85b97bf3fdSPer Liden 86b97bf3fdSPer Liden struct bcbearer { 87b97bf3fdSPer Liden struct bearer bearer; 88b97bf3fdSPer Liden struct media media; 89b97bf3fdSPer Liden struct bcbearer_pair bpairs[MAX_BEARERS]; 9016cb4b33SPer Liden struct bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1]; 916c00055aSDavid S. Miller struct tipc_node_map remains; 926c00055aSDavid S. Miller struct tipc_node_map remains_new; 93b97bf3fdSPer Liden }; 94b97bf3fdSPer Liden 95b97bf3fdSPer Liden /** 96b97bf3fdSPer Liden * struct bclink - link used for broadcast messages 97b97bf3fdSPer Liden * @link: (non-standard) broadcast link structure 98b97bf3fdSPer Liden * @node: (non-standard) node structure representing b'cast link's peer node 99b97bf3fdSPer Liden * 100b97bf3fdSPer Liden * Handles sequence numbering, fragmentation, bundling, etc. 101b97bf3fdSPer Liden */ 102b97bf3fdSPer Liden 103b97bf3fdSPer Liden struct bclink { 104b97bf3fdSPer Liden struct link link; 1056c00055aSDavid S. Miller struct tipc_node node; 106b97bf3fdSPer Liden }; 107b97bf3fdSPer Liden 108b97bf3fdSPer Liden 109b97bf3fdSPer Liden static struct bcbearer *bcbearer = NULL; 110b97bf3fdSPer Liden static struct bclink *bclink = NULL; 111b97bf3fdSPer Liden static struct link *bcl = NULL; 11234af946aSIngo Molnar static DEFINE_SPINLOCK(bc_lock); 113b97bf3fdSPer Liden 1148f92df6aSAllan Stephens /* broadcast-capable node map */ 1158f92df6aSAllan Stephens struct tipc_node_map tipc_bcast_nmap; 1168f92df6aSAllan Stephens 1173aec9cc9SAllan Stephens const char tipc_bclink_name[] = "broadcast-link"; 118b97bf3fdSPer Liden 11931e3c3f6Sstephen hemminger static void tipc_nmap_diff(struct tipc_node_map *nm_a, 12031e3c3f6Sstephen hemminger struct tipc_node_map *nm_b, 12131e3c3f6Sstephen hemminger struct tipc_node_map *nm_diff); 122b97bf3fdSPer Liden 12305790c64SSam Ravnborg static u32 buf_seqno(struct sk_buff *buf) 124b97bf3fdSPer Liden { 125b97bf3fdSPer Liden return msg_seqno(buf_msg(buf)); 126b97bf3fdSPer Liden } 127b97bf3fdSPer Liden 12805790c64SSam Ravnborg static u32 bcbuf_acks(struct sk_buff *buf) 129b97bf3fdSPer Liden { 130880b005fSDavid S. Miller return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle; 131b97bf3fdSPer Liden } 132b97bf3fdSPer Liden 13305790c64SSam Ravnborg static void bcbuf_set_acks(struct sk_buff *buf, u32 acks) 134b97bf3fdSPer Liden { 135880b005fSDavid S. Miller TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks; 136b97bf3fdSPer Liden } 137b97bf3fdSPer Liden 13805790c64SSam Ravnborg static void bcbuf_decr_acks(struct sk_buff *buf) 139b97bf3fdSPer Liden { 140b97bf3fdSPer Liden bcbuf_set_acks(buf, bcbuf_acks(buf) - 1); 141b97bf3fdSPer Liden } 142b97bf3fdSPer Liden 143b97bf3fdSPer Liden 1445b1f7bdeSAllan Stephens static void bclink_set_last_sent(void) 1455b1f7bdeSAllan Stephens { 1465b1f7bdeSAllan Stephens if (bcl->next_out) 1475b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1); 1485b1f7bdeSAllan Stephens else 1495b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1); 1505b1f7bdeSAllan Stephens } 1515b1f7bdeSAllan Stephens 1525b1f7bdeSAllan Stephens u32 tipc_bclink_get_last_sent(void) 1535b1f7bdeSAllan Stephens { 1545b1f7bdeSAllan Stephens return bcl->fsm_msg_cnt; 1555b1f7bdeSAllan Stephens } 1565b1f7bdeSAllan Stephens 157b97bf3fdSPer Liden /** 158b97bf3fdSPer Liden * bclink_set_gap - set gap according to contents of current deferred pkt queue 159b97bf3fdSPer Liden * 160b97bf3fdSPer Liden * Called with 'node' locked, bc_lock unlocked 161b97bf3fdSPer Liden */ 162b97bf3fdSPer Liden 1636c00055aSDavid S. Miller static void bclink_set_gap(struct tipc_node *n_ptr) 164b97bf3fdSPer Liden { 165b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 166b97bf3fdSPer Liden 167b97bf3fdSPer Liden n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 168b97bf3fdSPer Liden mod(n_ptr->bclink.last_in); 169b97bf3fdSPer Liden if (unlikely(buf != NULL)) 170b97bf3fdSPer Liden n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1); 171b97bf3fdSPer Liden } 172b97bf3fdSPer Liden 173b97bf3fdSPer Liden /** 174b97bf3fdSPer Liden * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment 175b97bf3fdSPer Liden * 176b97bf3fdSPer Liden * This mechanism endeavours to prevent all nodes in network from trying 177b97bf3fdSPer Liden * to ACK or NACK at the same time. 178b97bf3fdSPer Liden * 179b97bf3fdSPer Liden * Note: TIPC uses a different trigger to distribute ACKs than it does to 180b97bf3fdSPer Liden * distribute NACKs, but tries to use the same spacing (divide by 16). 181b97bf3fdSPer Liden */ 182b97bf3fdSPer Liden 18305790c64SSam Ravnborg static int bclink_ack_allowed(u32 n) 184b97bf3fdSPer Liden { 185a02cec21SEric Dumazet return (n % TIPC_MIN_LINK_WIN) == tipc_own_tag; 186b97bf3fdSPer Liden } 187b97bf3fdSPer Liden 188b97bf3fdSPer Liden 189b97bf3fdSPer Liden /** 190b97bf3fdSPer Liden * bclink_retransmit_pkt - retransmit broadcast packets 191b97bf3fdSPer Liden * @after: sequence number of last packet to *not* retransmit 192b97bf3fdSPer Liden * @to: sequence number of last packet to retransmit 193b97bf3fdSPer Liden * 194d356eebaSAllan Stephens * Called with bc_lock locked 195b97bf3fdSPer Liden */ 196b97bf3fdSPer Liden 197b97bf3fdSPer Liden static void bclink_retransmit_pkt(u32 after, u32 to) 198b97bf3fdSPer Liden { 199b97bf3fdSPer Liden struct sk_buff *buf; 200b97bf3fdSPer Liden 201b97bf3fdSPer Liden buf = bcl->first_out; 202b97bf3fdSPer Liden while (buf && less_eq(buf_seqno(buf), after)) { 203b97bf3fdSPer Liden buf = buf->next; 204b97bf3fdSPer Liden } 2054323add6SPer Liden tipc_link_retransmit(bcl, buf, mod(to - after)); 206b97bf3fdSPer Liden } 207b97bf3fdSPer Liden 208b97bf3fdSPer Liden /** 2094323add6SPer Liden * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets 210b97bf3fdSPer Liden * @n_ptr: node that sent acknowledgement info 211b97bf3fdSPer Liden * @acked: broadcast sequence # that has been acknowledged 212b97bf3fdSPer Liden * 213b97bf3fdSPer Liden * Node is locked, bc_lock unlocked. 214b97bf3fdSPer Liden */ 215b97bf3fdSPer Liden 2166c00055aSDavid S. Miller void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked) 217b97bf3fdSPer Liden { 218b97bf3fdSPer Liden struct sk_buff *crs; 219b97bf3fdSPer Liden struct sk_buff *next; 220b97bf3fdSPer Liden unsigned int released = 0; 221b97bf3fdSPer Liden 222b97bf3fdSPer Liden if (less_eq(acked, n_ptr->bclink.acked)) 223b97bf3fdSPer Liden return; 224b97bf3fdSPer Liden 225b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 226b97bf3fdSPer Liden 227b97bf3fdSPer Liden /* Skip over packets that node has previously acknowledged */ 228b97bf3fdSPer Liden 229b97bf3fdSPer Liden crs = bcl->first_out; 230b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) { 231b97bf3fdSPer Liden crs = crs->next; 232b97bf3fdSPer Liden } 233b97bf3fdSPer Liden 234b97bf3fdSPer Liden /* Update packets that node is now acknowledging */ 235b97bf3fdSPer Liden 236b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), acked)) { 237b97bf3fdSPer Liden next = crs->next; 238b97bf3fdSPer Liden bcbuf_decr_acks(crs); 239b97bf3fdSPer Liden if (bcbuf_acks(crs) == 0) { 240b97bf3fdSPer Liden bcl->first_out = next; 241b97bf3fdSPer Liden bcl->out_queue_size--; 242b97bf3fdSPer Liden buf_discard(crs); 243b97bf3fdSPer Liden released = 1; 244b97bf3fdSPer Liden } 245b97bf3fdSPer Liden crs = next; 246b97bf3fdSPer Liden } 247b97bf3fdSPer Liden n_ptr->bclink.acked = acked; 248b97bf3fdSPer Liden 249b97bf3fdSPer Liden /* Try resolving broadcast link congestion, if necessary */ 250b97bf3fdSPer Liden 2515b1f7bdeSAllan Stephens if (unlikely(bcl->next_out)) { 2524323add6SPer Liden tipc_link_push_queue(bcl); 2535b1f7bdeSAllan Stephens bclink_set_last_sent(); 2545b1f7bdeSAllan Stephens } 255b97bf3fdSPer Liden if (unlikely(released && !list_empty(&bcl->waiting_ports))) 2564323add6SPer Liden tipc_link_wakeup_ports(bcl, 0); 257b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 258b97bf3fdSPer Liden } 259b97bf3fdSPer Liden 260b97bf3fdSPer Liden /** 261b97bf3fdSPer Liden * bclink_send_ack - unicast an ACK msg 262b97bf3fdSPer Liden * 2634323add6SPer Liden * tipc_net_lock and node lock set 264b97bf3fdSPer Liden */ 265b97bf3fdSPer Liden 2666c00055aSDavid S. Miller static void bclink_send_ack(struct tipc_node *n_ptr) 267b97bf3fdSPer Liden { 268b97bf3fdSPer Liden struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1]; 269b97bf3fdSPer Liden 270b97bf3fdSPer Liden if (l_ptr != NULL) 2714323add6SPer Liden tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0); 272b97bf3fdSPer Liden } 273b97bf3fdSPer Liden 274b97bf3fdSPer Liden /** 275b97bf3fdSPer Liden * bclink_send_nack- broadcast a NACK msg 276b97bf3fdSPer Liden * 2774323add6SPer Liden * tipc_net_lock and node lock set 278b97bf3fdSPer Liden */ 279b97bf3fdSPer Liden 2806c00055aSDavid S. Miller static void bclink_send_nack(struct tipc_node *n_ptr) 281b97bf3fdSPer Liden { 282b97bf3fdSPer Liden struct sk_buff *buf; 283b97bf3fdSPer Liden struct tipc_msg *msg; 284b97bf3fdSPer Liden 285b97bf3fdSPer Liden if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to)) 286b97bf3fdSPer Liden return; 287b97bf3fdSPer Liden 28831e3c3f6Sstephen hemminger buf = tipc_buf_acquire(INT_H_SIZE); 289b97bf3fdSPer Liden if (buf) { 290b97bf3fdSPer Liden msg = buf_msg(buf); 291c68ca7b7SAllan Stephens tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG, 29275715217SAllan Stephens INT_H_SIZE, n_ptr->addr); 293b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 294b97bf3fdSPer Liden msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in)); 295b97bf3fdSPer Liden msg_set_bcgap_after(msg, n_ptr->bclink.gap_after); 296b97bf3fdSPer Liden msg_set_bcgap_to(msg, n_ptr->bclink.gap_to); 297b97bf3fdSPer Liden msg_set_bcast_tag(msg, tipc_own_tag); 298b97bf3fdSPer Liden 2991fc54d8fSSam Ravnborg if (tipc_bearer_send(&bcbearer->bearer, buf, NULL)) { 300b97bf3fdSPer Liden bcl->stats.sent_nacks++; 301b97bf3fdSPer Liden buf_discard(buf); 302b97bf3fdSPer Liden } else { 3034323add6SPer Liden tipc_bearer_schedule(bcl->b_ptr, bcl); 304b97bf3fdSPer Liden bcl->proto_msg_queue = buf; 305b97bf3fdSPer Liden bcl->stats.bearer_congs++; 306b97bf3fdSPer Liden } 307b97bf3fdSPer Liden 308b97bf3fdSPer Liden /* 309b97bf3fdSPer Liden * Ensure we doesn't send another NACK msg to the node 310b97bf3fdSPer Liden * until 16 more deferred messages arrive from it 311b97bf3fdSPer Liden * (i.e. helps prevent all nodes from NACK'ing at same time) 312b97bf3fdSPer Liden */ 313b97bf3fdSPer Liden 314b97bf3fdSPer Liden n_ptr->bclink.nack_sync = tipc_own_tag; 315b97bf3fdSPer Liden } 316b97bf3fdSPer Liden } 317b97bf3fdSPer Liden 318b97bf3fdSPer Liden /** 3194323add6SPer Liden * tipc_bclink_check_gap - send a NACK if a sequence gap exists 320b97bf3fdSPer Liden * 3214323add6SPer Liden * tipc_net_lock and node lock set 322b97bf3fdSPer Liden */ 323b97bf3fdSPer Liden 3246c00055aSDavid S. Miller void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 last_sent) 325b97bf3fdSPer Liden { 326b97bf3fdSPer Liden if (!n_ptr->bclink.supported || 327b97bf3fdSPer Liden less_eq(last_sent, mod(n_ptr->bclink.last_in))) 328b97bf3fdSPer Liden return; 329b97bf3fdSPer Liden 330b97bf3fdSPer Liden bclink_set_gap(n_ptr); 331b97bf3fdSPer Liden if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to) 332b97bf3fdSPer Liden n_ptr->bclink.gap_to = last_sent; 333b97bf3fdSPer Liden bclink_send_nack(n_ptr); 334b97bf3fdSPer Liden } 335b97bf3fdSPer Liden 336b97bf3fdSPer Liden /** 3374323add6SPer Liden * tipc_bclink_peek_nack - process a NACK msg meant for another node 338b97bf3fdSPer Liden * 3394323add6SPer Liden * Only tipc_net_lock set. 340b97bf3fdSPer Liden */ 341b97bf3fdSPer Liden 342988f088aSAdrian Bunk static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to) 343b97bf3fdSPer Liden { 3446c00055aSDavid S. Miller struct tipc_node *n_ptr = tipc_node_find(dest); 345b97bf3fdSPer Liden u32 my_after, my_to; 346b97bf3fdSPer Liden 3474323add6SPer Liden if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr))) 348b97bf3fdSPer Liden return; 3494323add6SPer Liden tipc_node_lock(n_ptr); 350b97bf3fdSPer Liden /* 351b97bf3fdSPer Liden * Modify gap to suppress unnecessary NACKs from this node 352b97bf3fdSPer Liden */ 353b97bf3fdSPer Liden my_after = n_ptr->bclink.gap_after; 354b97bf3fdSPer Liden my_to = n_ptr->bclink.gap_to; 355b97bf3fdSPer Liden 356b97bf3fdSPer Liden if (less_eq(gap_after, my_after)) { 357b97bf3fdSPer Liden if (less(my_after, gap_to) && less(gap_to, my_to)) 358b97bf3fdSPer Liden n_ptr->bclink.gap_after = gap_to; 359b97bf3fdSPer Liden else if (less_eq(my_to, gap_to)) 360b97bf3fdSPer Liden n_ptr->bclink.gap_to = n_ptr->bclink.gap_after; 361b97bf3fdSPer Liden } else if (less_eq(gap_after, my_to)) { 362b97bf3fdSPer Liden if (less_eq(my_to, gap_to)) 363b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 364b97bf3fdSPer Liden } else { 365b97bf3fdSPer Liden /* 366b97bf3fdSPer Liden * Expand gap if missing bufs not in deferred queue: 367b97bf3fdSPer Liden */ 368b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 369b97bf3fdSPer Liden u32 prev = n_ptr->bclink.gap_to; 370b97bf3fdSPer Liden 371b97bf3fdSPer Liden for (; buf; buf = buf->next) { 372b97bf3fdSPer Liden u32 seqno = buf_seqno(buf); 373b97bf3fdSPer Liden 3743ac90216SEric Sesterhenn if (mod(seqno - prev) != 1) { 375b97bf3fdSPer Liden buf = NULL; 3763ac90216SEric Sesterhenn break; 3773ac90216SEric Sesterhenn } 378b97bf3fdSPer Liden if (seqno == gap_after) 379b97bf3fdSPer Liden break; 380b97bf3fdSPer Liden prev = seqno; 381b97bf3fdSPer Liden } 382b97bf3fdSPer Liden if (buf == NULL) 383b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 384b97bf3fdSPer Liden } 385b97bf3fdSPer Liden /* 386b97bf3fdSPer Liden * Some nodes may send a complementary NACK now: 387b97bf3fdSPer Liden */ 388b97bf3fdSPer Liden if (bclink_ack_allowed(sender_tag + 1)) { 389b97bf3fdSPer Liden if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) { 390b97bf3fdSPer Liden bclink_send_nack(n_ptr); 391b97bf3fdSPer Liden bclink_set_gap(n_ptr); 392b97bf3fdSPer Liden } 393b97bf3fdSPer Liden } 3944323add6SPer Liden tipc_node_unlock(n_ptr); 395b97bf3fdSPer Liden } 396b97bf3fdSPer Liden 397b97bf3fdSPer Liden /** 3984323add6SPer Liden * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster 399b97bf3fdSPer Liden */ 400b97bf3fdSPer Liden 4014323add6SPer Liden int tipc_bclink_send_msg(struct sk_buff *buf) 402b97bf3fdSPer Liden { 403b97bf3fdSPer Liden int res; 404b97bf3fdSPer Liden 405b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 406b97bf3fdSPer Liden 4074323add6SPer Liden res = tipc_link_send_buf(bcl, buf); 408b97bf3fdSPer Liden if (unlikely(res == -ELINKCONG)) 409b97bf3fdSPer Liden buf_discard(buf); 4100048b826SAllan Stephens else 4115b1f7bdeSAllan Stephens bclink_set_last_sent(); 412b97bf3fdSPer Liden 413b97bf3fdSPer Liden if (bcl->out_queue_size > bcl->stats.max_queue_sz) 414b97bf3fdSPer Liden bcl->stats.max_queue_sz = bcl->out_queue_size; 415b97bf3fdSPer Liden bcl->stats.queue_sz_counts++; 416b97bf3fdSPer Liden bcl->stats.accu_queue_sz += bcl->out_queue_size; 417b97bf3fdSPer Liden 418b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 419b97bf3fdSPer Liden return res; 420b97bf3fdSPer Liden } 421b97bf3fdSPer Liden 422b97bf3fdSPer Liden /** 4234323add6SPer Liden * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards 424b97bf3fdSPer Liden * 4254323add6SPer Liden * tipc_net_lock is read_locked, no other locks set 426b97bf3fdSPer Liden */ 427b97bf3fdSPer Liden 4284323add6SPer Liden void tipc_bclink_recv_pkt(struct sk_buff *buf) 429b97bf3fdSPer Liden { 430d356eebaSAllan Stephens #if (TIPC_BCAST_LOSS_RATE) 431d356eebaSAllan Stephens static int rx_count = 0; 432d356eebaSAllan Stephens #endif 433b97bf3fdSPer Liden struct tipc_msg *msg = buf_msg(buf); 4346c00055aSDavid S. Miller struct tipc_node* node = tipc_node_find(msg_prevnode(msg)); 435b97bf3fdSPer Liden u32 next_in; 436b97bf3fdSPer Liden u32 seqno; 437b97bf3fdSPer Liden struct sk_buff *deferred; 438b97bf3fdSPer Liden 439b97bf3fdSPer Liden msg_dbg(msg, "<BC<<<"); 440b97bf3fdSPer Liden 4414323add6SPer Liden if (unlikely(!node || !tipc_node_is_up(node) || !node->bclink.supported || 442b97bf3fdSPer Liden (msg_mc_netid(msg) != tipc_net_id))) { 443b97bf3fdSPer Liden buf_discard(buf); 444b97bf3fdSPer Liden return; 445b97bf3fdSPer Liden } 446b97bf3fdSPer Liden 447b97bf3fdSPer Liden if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { 448b97bf3fdSPer Liden msg_dbg(msg, "<BCNACK<<<"); 449b97bf3fdSPer Liden if (msg_destnode(msg) == tipc_own_addr) { 4504323add6SPer Liden tipc_node_lock(node); 4514323add6SPer Liden tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); 4524323add6SPer Liden tipc_node_unlock(node); 453d356eebaSAllan Stephens spin_lock_bh(&bc_lock); 454b97bf3fdSPer Liden bcl->stats.recv_nacks++; 455d356eebaSAllan Stephens bcl->owner->next = node; /* remember requestor */ 456b97bf3fdSPer Liden bclink_retransmit_pkt(msg_bcgap_after(msg), 457b97bf3fdSPer Liden msg_bcgap_to(msg)); 458d356eebaSAllan Stephens bcl->owner->next = NULL; 459d356eebaSAllan Stephens spin_unlock_bh(&bc_lock); 460b97bf3fdSPer Liden } else { 4614323add6SPer Liden tipc_bclink_peek_nack(msg_destnode(msg), 462b97bf3fdSPer Liden msg_bcast_tag(msg), 463b97bf3fdSPer Liden msg_bcgap_after(msg), 464b97bf3fdSPer Liden msg_bcgap_to(msg)); 465b97bf3fdSPer Liden } 466b97bf3fdSPer Liden buf_discard(buf); 467b97bf3fdSPer Liden return; 468b97bf3fdSPer Liden } 469b97bf3fdSPer Liden 470d356eebaSAllan Stephens #if (TIPC_BCAST_LOSS_RATE) 471d356eebaSAllan Stephens if (++rx_count == TIPC_BCAST_LOSS_RATE) { 472d356eebaSAllan Stephens rx_count = 0; 473d356eebaSAllan Stephens buf_discard(buf); 474d356eebaSAllan Stephens return; 475d356eebaSAllan Stephens } 476d356eebaSAllan Stephens #endif 477d356eebaSAllan Stephens 4784323add6SPer Liden tipc_node_lock(node); 479b97bf3fdSPer Liden receive: 480b97bf3fdSPer Liden deferred = node->bclink.deferred_head; 481b97bf3fdSPer Liden next_in = mod(node->bclink.last_in + 1); 482b97bf3fdSPer Liden seqno = msg_seqno(msg); 483b97bf3fdSPer Liden 484b97bf3fdSPer Liden if (likely(seqno == next_in)) { 485b97bf3fdSPer Liden bcl->stats.recv_info++; 486b97bf3fdSPer Liden node->bclink.last_in++; 487b97bf3fdSPer Liden bclink_set_gap(node); 488b97bf3fdSPer Liden if (unlikely(bclink_ack_allowed(seqno))) { 489b97bf3fdSPer Liden bclink_send_ack(node); 490b97bf3fdSPer Liden bcl->stats.sent_acks++; 491b97bf3fdSPer Liden } 492b97bf3fdSPer Liden if (likely(msg_isdata(msg))) { 4934323add6SPer Liden tipc_node_unlock(node); 4944323add6SPer Liden tipc_port_recv_mcast(buf, NULL); 495b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_BUNDLER) { 496b97bf3fdSPer Liden bcl->stats.recv_bundles++; 497b97bf3fdSPer Liden bcl->stats.recv_bundled += msg_msgcnt(msg); 4984323add6SPer Liden tipc_node_unlock(node); 4994323add6SPer Liden tipc_link_recv_bundle(buf); 500b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_FRAGMENTER) { 501b97bf3fdSPer Liden bcl->stats.recv_fragments++; 5024323add6SPer Liden if (tipc_link_recv_fragment(&node->bclink.defragm, 503b97bf3fdSPer Liden &buf, &msg)) 504b97bf3fdSPer Liden bcl->stats.recv_fragmented++; 5054323add6SPer Liden tipc_node_unlock(node); 5064323add6SPer Liden tipc_net_route_msg(buf); 507b97bf3fdSPer Liden } else { 5084323add6SPer Liden tipc_node_unlock(node); 5094323add6SPer Liden tipc_net_route_msg(buf); 510b97bf3fdSPer Liden } 511b97bf3fdSPer Liden if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) { 5124323add6SPer Liden tipc_node_lock(node); 513b97bf3fdSPer Liden buf = deferred; 514b97bf3fdSPer Liden msg = buf_msg(buf); 515b97bf3fdSPer Liden node->bclink.deferred_head = deferred->next; 516b97bf3fdSPer Liden goto receive; 517b97bf3fdSPer Liden } 518b97bf3fdSPer Liden return; 519b97bf3fdSPer Liden } else if (less(next_in, seqno)) { 520b97bf3fdSPer Liden u32 gap_after = node->bclink.gap_after; 521b97bf3fdSPer Liden u32 gap_to = node->bclink.gap_to; 522b97bf3fdSPer Liden 5234323add6SPer Liden if (tipc_link_defer_pkt(&node->bclink.deferred_head, 524b97bf3fdSPer Liden &node->bclink.deferred_tail, 525b97bf3fdSPer Liden buf)) { 526b97bf3fdSPer Liden node->bclink.nack_sync++; 527b97bf3fdSPer Liden bcl->stats.deferred_recv++; 528b97bf3fdSPer Liden if (seqno == mod(gap_after + 1)) 529b97bf3fdSPer Liden node->bclink.gap_after = seqno; 530b97bf3fdSPer Liden else if (less(gap_after, seqno) && less(seqno, gap_to)) 531b97bf3fdSPer Liden node->bclink.gap_to = seqno; 532b97bf3fdSPer Liden } 533b97bf3fdSPer Liden if (bclink_ack_allowed(node->bclink.nack_sync)) { 534b97bf3fdSPer Liden if (gap_to != gap_after) 535b97bf3fdSPer Liden bclink_send_nack(node); 536b97bf3fdSPer Liden bclink_set_gap(node); 537b97bf3fdSPer Liden } 538b97bf3fdSPer Liden } else { 539b97bf3fdSPer Liden bcl->stats.duplicates++; 540b97bf3fdSPer Liden buf_discard(buf); 541b97bf3fdSPer Liden } 5424323add6SPer Liden tipc_node_unlock(node); 543b97bf3fdSPer Liden } 544b97bf3fdSPer Liden 5456c00055aSDavid S. Miller u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) 546b97bf3fdSPer Liden { 547b97bf3fdSPer Liden return (n_ptr->bclink.supported && 5484323add6SPer Liden (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); 549b97bf3fdSPer Liden } 550b97bf3fdSPer Liden 551b97bf3fdSPer Liden 552b97bf3fdSPer Liden /** 5534323add6SPer Liden * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer 554b97bf3fdSPer Liden * 555b97bf3fdSPer Liden * Send through as many bearers as necessary to reach all nodes 556b97bf3fdSPer Liden * that support TIPC multicasting. 557b97bf3fdSPer Liden * 558b97bf3fdSPer Liden * Returns 0 if packet sent successfully, non-zero if not 559b97bf3fdSPer Liden */ 560b97bf3fdSPer Liden 561988f088aSAdrian Bunk static int tipc_bcbearer_send(struct sk_buff *buf, 562b97bf3fdSPer Liden struct tipc_bearer *unused1, 563b97bf3fdSPer Liden struct tipc_media_addr *unused2) 564b97bf3fdSPer Liden { 565b97bf3fdSPer Liden int bp_index; 566b97bf3fdSPer Liden 567b97bf3fdSPer Liden /* Prepare buffer for broadcasting (if first time trying to send it) */ 568b97bf3fdSPer Liden 569b97bf3fdSPer Liden if (likely(!msg_non_seq(buf_msg(buf)))) { 570b97bf3fdSPer Liden struct tipc_msg *msg; 571b97bf3fdSPer Liden 5728f92df6aSAllan Stephens assert(tipc_bcast_nmap.count != 0); 5738f92df6aSAllan Stephens bcbuf_set_acks(buf, tipc_bcast_nmap.count); 574b97bf3fdSPer Liden msg = buf_msg(buf); 57540aecb1bSAllan Stephens msg_set_non_seq(msg, 1); 576b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 5770048b826SAllan Stephens bcl->stats.sent_info++; 578b97bf3fdSPer Liden } 579b97bf3fdSPer Liden 580b97bf3fdSPer Liden /* Send buffer over bearers until all targets reached */ 581b97bf3fdSPer Liden 5828f92df6aSAllan Stephens bcbearer->remains = tipc_bcast_nmap; 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 59165f51ef0SAllan Stephens tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new); 59265f51ef0SAllan Stephens if (bcbearer->remains_new.count == bcbearer->remains.count) 593b97bf3fdSPer Liden continue; /* bearer pair doesn't add anything */ 594b97bf3fdSPer Liden 5951a624832SNeil Horman if (p->publ.blocked || 5961a624832SNeil Horman p->media->send_msg(buf, &p->publ, &p->media->bcast_addr)) { 5971a624832SNeil Horman /* unable to send on primary bearer */ 5981a624832SNeil Horman if (!s || s->publ.blocked || 5991a624832SNeil Horman s->media->send_msg(buf, &s->publ, 6001a624832SNeil Horman &s->media->bcast_addr)) { 6011a624832SNeil Horman /* unable to send on either bearer */ 6021a624832SNeil Horman continue; 6031a624832SNeil Horman } 604b97bf3fdSPer Liden } 605b97bf3fdSPer Liden 6061a624832SNeil Horman if (s) { 607b97bf3fdSPer Liden bcbearer->bpairs[bp_index].primary = s; 608b97bf3fdSPer Liden bcbearer->bpairs[bp_index].secondary = p; 6091a624832SNeil Horman } 6101a624832SNeil Horman 61165f51ef0SAllan Stephens if (bcbearer->remains_new.count == 0) 6120e35fd5eSAllan Stephens return 0; 613b97bf3fdSPer Liden 61465f51ef0SAllan Stephens bcbearer->remains = bcbearer->remains_new; 615b97bf3fdSPer Liden } 616b97bf3fdSPer Liden 6177e3e5d09SAllan Stephens /* 6187e3e5d09SAllan Stephens * Unable to reach all targets (indicate success, since currently 6197e3e5d09SAllan Stephens * there isn't code in place to properly block & unblock the 6207e3e5d09SAllan Stephens * pseudo-bearer used by the broadcast link) 6217e3e5d09SAllan Stephens */ 622b97bf3fdSPer Liden 6237e3e5d09SAllan Stephens return TIPC_OK; 624b97bf3fdSPer Liden } 625b97bf3fdSPer Liden 626b97bf3fdSPer Liden /** 6274323add6SPer Liden * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer 628b97bf3fdSPer Liden */ 629b97bf3fdSPer Liden 6304323add6SPer Liden void tipc_bcbearer_sort(void) 631b97bf3fdSPer Liden { 632b97bf3fdSPer Liden struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp; 633b97bf3fdSPer Liden struct bcbearer_pair *bp_curr; 634b97bf3fdSPer Liden int b_index; 635b97bf3fdSPer Liden int pri; 636b97bf3fdSPer Liden 637b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 638b97bf3fdSPer Liden 639b97bf3fdSPer Liden /* Group bearers by priority (can assume max of two per priority) */ 640b97bf3fdSPer Liden 641b97bf3fdSPer Liden memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); 642b97bf3fdSPer Liden 643b97bf3fdSPer Liden for (b_index = 0; b_index < MAX_BEARERS; b_index++) { 6444323add6SPer Liden struct bearer *b = &tipc_bearers[b_index]; 645b97bf3fdSPer Liden 646b97bf3fdSPer Liden if (!b->active || !b->nodes.count) 647b97bf3fdSPer Liden continue; 648b97bf3fdSPer Liden 649b97bf3fdSPer Liden if (!bp_temp[b->priority].primary) 650b97bf3fdSPer Liden bp_temp[b->priority].primary = b; 651b97bf3fdSPer Liden else 652b97bf3fdSPer Liden bp_temp[b->priority].secondary = b; 653b97bf3fdSPer Liden } 654b97bf3fdSPer Liden 655b97bf3fdSPer Liden /* Create array of bearer pairs for broadcasting */ 656b97bf3fdSPer Liden 657b97bf3fdSPer Liden bp_curr = bcbearer->bpairs; 658b97bf3fdSPer Liden memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); 659b97bf3fdSPer Liden 66016cb4b33SPer Liden for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { 661b97bf3fdSPer Liden 662b97bf3fdSPer Liden if (!bp_temp[pri].primary) 663b97bf3fdSPer Liden continue; 664b97bf3fdSPer Liden 665b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].primary; 666b97bf3fdSPer Liden 667b97bf3fdSPer Liden if (bp_temp[pri].secondary) { 6684323add6SPer Liden if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, 669b97bf3fdSPer Liden &bp_temp[pri].secondary->nodes)) { 670b97bf3fdSPer Liden bp_curr->secondary = bp_temp[pri].secondary; 671b97bf3fdSPer Liden } else { 672b97bf3fdSPer Liden bp_curr++; 673b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].secondary; 674b97bf3fdSPer Liden } 675b97bf3fdSPer Liden } 676b97bf3fdSPer Liden 677b97bf3fdSPer Liden bp_curr++; 678b97bf3fdSPer Liden } 679b97bf3fdSPer Liden 680b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 681b97bf3fdSPer Liden } 682b97bf3fdSPer Liden 683b97bf3fdSPer Liden /** 6844323add6SPer Liden * tipc_bcbearer_push - resolve bearer congestion 685b97bf3fdSPer Liden * 686b97bf3fdSPer Liden * Forces bclink to push out any unsent packets, until all packets are gone 687b97bf3fdSPer Liden * or congestion reoccurs. 688b97bf3fdSPer Liden * No locks set when function called 689b97bf3fdSPer Liden */ 690b97bf3fdSPer Liden 6914323add6SPer Liden void tipc_bcbearer_push(void) 692b97bf3fdSPer Liden { 693b97bf3fdSPer Liden struct bearer *b_ptr; 694b97bf3fdSPer Liden 695b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 696b97bf3fdSPer Liden b_ptr = &bcbearer->bearer; 697b97bf3fdSPer Liden if (b_ptr->publ.blocked) { 698b97bf3fdSPer Liden b_ptr->publ.blocked = 0; 6994323add6SPer Liden tipc_bearer_lock_push(b_ptr); 700b97bf3fdSPer Liden } 701b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 702b97bf3fdSPer Liden } 703b97bf3fdSPer Liden 704b97bf3fdSPer Liden 7054323add6SPer Liden int tipc_bclink_stats(char *buf, const u32 buf_size) 706b97bf3fdSPer Liden { 707b97bf3fdSPer Liden struct print_buf pb; 708b97bf3fdSPer Liden 709b97bf3fdSPer Liden if (!bcl) 710b97bf3fdSPer Liden return 0; 711b97bf3fdSPer Liden 7124323add6SPer Liden tipc_printbuf_init(&pb, buf, buf_size); 713b97bf3fdSPer Liden 714b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 715b97bf3fdSPer Liden 716b97bf3fdSPer Liden tipc_printf(&pb, "Link <%s>\n" 717b97bf3fdSPer Liden " Window:%u packets\n", 718b97bf3fdSPer Liden bcl->name, bcl->queue_limit[0]); 719b97bf3fdSPer Liden tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n", 720b97bf3fdSPer Liden bcl->stats.recv_info, 721b97bf3fdSPer Liden bcl->stats.recv_fragments, 722b97bf3fdSPer Liden bcl->stats.recv_fragmented, 723b97bf3fdSPer Liden bcl->stats.recv_bundles, 724b97bf3fdSPer Liden bcl->stats.recv_bundled); 725b97bf3fdSPer Liden tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n", 726b97bf3fdSPer Liden bcl->stats.sent_info, 727b97bf3fdSPer Liden bcl->stats.sent_fragments, 728b97bf3fdSPer Liden bcl->stats.sent_fragmented, 729b97bf3fdSPer Liden bcl->stats.sent_bundles, 730b97bf3fdSPer Liden bcl->stats.sent_bundled); 731b97bf3fdSPer Liden tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n", 732b97bf3fdSPer Liden bcl->stats.recv_nacks, 733b97bf3fdSPer Liden bcl->stats.deferred_recv, 734b97bf3fdSPer Liden bcl->stats.duplicates); 735b97bf3fdSPer Liden tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n", 736b97bf3fdSPer Liden bcl->stats.sent_nacks, 737b97bf3fdSPer Liden bcl->stats.sent_acks, 738b97bf3fdSPer Liden bcl->stats.retransmitted); 739b97bf3fdSPer Liden tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n", 740b97bf3fdSPer Liden bcl->stats.bearer_congs, 741b97bf3fdSPer Liden bcl->stats.link_congs, 742b97bf3fdSPer Liden bcl->stats.max_queue_sz, 743b97bf3fdSPer Liden bcl->stats.queue_sz_counts 744b97bf3fdSPer Liden ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts) 745b97bf3fdSPer Liden : 0); 746b97bf3fdSPer Liden 747b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7484323add6SPer Liden return tipc_printbuf_validate(&pb); 749b97bf3fdSPer Liden } 750b97bf3fdSPer Liden 7514323add6SPer Liden int tipc_bclink_reset_stats(void) 752b97bf3fdSPer Liden { 753b97bf3fdSPer Liden if (!bcl) 754b97bf3fdSPer Liden return -ENOPROTOOPT; 755b97bf3fdSPer Liden 756b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 757b97bf3fdSPer Liden memset(&bcl->stats, 0, sizeof(bcl->stats)); 758b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7590e35fd5eSAllan Stephens return 0; 760b97bf3fdSPer Liden } 761b97bf3fdSPer Liden 7624323add6SPer Liden int tipc_bclink_set_queue_limits(u32 limit) 763b97bf3fdSPer Liden { 764b97bf3fdSPer Liden if (!bcl) 765b97bf3fdSPer Liden return -ENOPROTOOPT; 766b97bf3fdSPer Liden if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) 767b97bf3fdSPer Liden return -EINVAL; 768b97bf3fdSPer Liden 769b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 7704323add6SPer Liden tipc_link_set_queue_limits(bcl, limit); 771b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7720e35fd5eSAllan Stephens return 0; 773b97bf3fdSPer Liden } 774b97bf3fdSPer Liden 7754323add6SPer Liden int tipc_bclink_init(void) 776b97bf3fdSPer Liden { 7772710b57fSArnaldo Carvalho de Melo bcbearer = kzalloc(sizeof(*bcbearer), GFP_ATOMIC); 7782710b57fSArnaldo Carvalho de Melo bclink = kzalloc(sizeof(*bclink), GFP_ATOMIC); 779b97bf3fdSPer Liden if (!bcbearer || !bclink) { 780b97bf3fdSPer Liden nomem: 781a10bd924SAllan Stephens warn("Multicast link creation failed, no memory\n"); 782b97bf3fdSPer Liden kfree(bcbearer); 783b97bf3fdSPer Liden bcbearer = NULL; 784b97bf3fdSPer Liden kfree(bclink); 785b97bf3fdSPer Liden bclink = NULL; 786b97bf3fdSPer Liden return -ENOMEM; 787b97bf3fdSPer Liden } 788b97bf3fdSPer Liden 789b97bf3fdSPer Liden INIT_LIST_HEAD(&bcbearer->bearer.cong_links); 790b97bf3fdSPer Liden bcbearer->bearer.media = &bcbearer->media; 7914323add6SPer Liden bcbearer->media.send_msg = tipc_bcbearer_send; 792b97bf3fdSPer Liden sprintf(bcbearer->media.name, "tipc-multicast"); 793b97bf3fdSPer Liden 794b97bf3fdSPer Liden bcl = &bclink->link; 795b97bf3fdSPer Liden INIT_LIST_HEAD(&bcl->waiting_ports); 796b97bf3fdSPer Liden bcl->next_out_no = 1; 79734af946aSIngo Molnar spin_lock_init(&bclink->node.lock); 798b97bf3fdSPer Liden bcl->owner = &bclink->node; 799b97bf3fdSPer Liden bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; 8004323add6SPer Liden tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); 801b97bf3fdSPer Liden bcl->b_ptr = &bcbearer->bearer; 802b97bf3fdSPer Liden bcl->state = WORKING_WORKING; 8034b704d59SStephen Hemminger strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME); 804b97bf3fdSPer Liden 805b97bf3fdSPer Liden if (BCLINK_LOG_BUF_SIZE) { 806b97bf3fdSPer Liden char *pb = kmalloc(BCLINK_LOG_BUF_SIZE, GFP_ATOMIC); 807b97bf3fdSPer Liden 808b97bf3fdSPer Liden if (!pb) 809b97bf3fdSPer Liden goto nomem; 8104323add6SPer Liden tipc_printbuf_init(&bcl->print_buf, pb, BCLINK_LOG_BUF_SIZE); 811b97bf3fdSPer Liden } 812b97bf3fdSPer Liden 8130e35fd5eSAllan Stephens return 0; 814b97bf3fdSPer Liden } 815b97bf3fdSPer Liden 8164323add6SPer Liden void tipc_bclink_stop(void) 817b97bf3fdSPer Liden { 818b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 819b97bf3fdSPer Liden if (bcbearer) { 8204323add6SPer Liden tipc_link_stop(bcl); 821b97bf3fdSPer Liden if (BCLINK_LOG_BUF_SIZE) 822b97bf3fdSPer Liden kfree(bcl->print_buf.buf); 823b97bf3fdSPer Liden bcl = NULL; 824b97bf3fdSPer Liden kfree(bclink); 825b97bf3fdSPer Liden bclink = NULL; 826b97bf3fdSPer Liden kfree(bcbearer); 827b97bf3fdSPer Liden bcbearer = NULL; 828b97bf3fdSPer Liden } 829b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 830b97bf3fdSPer Liden } 831b97bf3fdSPer Liden 8323e22e62bSAllan Stephens 8333e22e62bSAllan Stephens /** 8343e22e62bSAllan Stephens * tipc_nmap_add - add a node to a node map 8353e22e62bSAllan Stephens */ 8363e22e62bSAllan Stephens 8373e22e62bSAllan Stephens void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node) 8383e22e62bSAllan Stephens { 8393e22e62bSAllan Stephens int n = tipc_node(node); 8403e22e62bSAllan Stephens int w = n / WSIZE; 8413e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8423e22e62bSAllan Stephens 8433e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) == 0) { 8443e22e62bSAllan Stephens nm_ptr->count++; 8453e22e62bSAllan Stephens nm_ptr->map[w] |= mask; 8463e22e62bSAllan Stephens } 8473e22e62bSAllan Stephens } 8483e22e62bSAllan Stephens 8493e22e62bSAllan Stephens /** 8503e22e62bSAllan Stephens * tipc_nmap_remove - remove a node from a node map 8513e22e62bSAllan Stephens */ 8523e22e62bSAllan Stephens 8533e22e62bSAllan Stephens void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node) 8543e22e62bSAllan Stephens { 8553e22e62bSAllan Stephens int n = tipc_node(node); 8563e22e62bSAllan Stephens int w = n / WSIZE; 8573e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8583e22e62bSAllan Stephens 8593e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) != 0) { 8603e22e62bSAllan Stephens nm_ptr->map[w] &= ~mask; 8613e22e62bSAllan Stephens nm_ptr->count--; 8623e22e62bSAllan Stephens } 8633e22e62bSAllan Stephens } 8643e22e62bSAllan Stephens 8653e22e62bSAllan Stephens /** 8663e22e62bSAllan Stephens * tipc_nmap_diff - find differences between node maps 8673e22e62bSAllan Stephens * @nm_a: input node map A 8683e22e62bSAllan Stephens * @nm_b: input node map B 8693e22e62bSAllan Stephens * @nm_diff: output node map A-B (i.e. nodes of A that are not in B) 8703e22e62bSAllan Stephens */ 8713e22e62bSAllan Stephens 87231e3c3f6Sstephen hemminger static void tipc_nmap_diff(struct tipc_node_map *nm_a, 87331e3c3f6Sstephen hemminger struct tipc_node_map *nm_b, 8743e22e62bSAllan Stephens struct tipc_node_map *nm_diff) 8753e22e62bSAllan Stephens { 8763e22e62bSAllan Stephens int stop = ARRAY_SIZE(nm_a->map); 8773e22e62bSAllan Stephens int w; 8783e22e62bSAllan Stephens int b; 8793e22e62bSAllan Stephens u32 map; 8803e22e62bSAllan Stephens 8813e22e62bSAllan Stephens memset(nm_diff, 0, sizeof(*nm_diff)); 8823e22e62bSAllan Stephens for (w = 0; w < stop; w++) { 8833e22e62bSAllan Stephens map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]); 8843e22e62bSAllan Stephens nm_diff->map[w] = map; 8853e22e62bSAllan Stephens if (map != 0) { 8863e22e62bSAllan Stephens for (b = 0 ; b < WSIZE; b++) { 8873e22e62bSAllan Stephens if (map & (1 << b)) 8883e22e62bSAllan Stephens nm_diff->count++; 8893e22e62bSAllan Stephens } 8903e22e62bSAllan Stephens } 8913e22e62bSAllan Stephens } 8923e22e62bSAllan Stephens } 89343608edcSAllan Stephens 89443608edcSAllan Stephens /** 89543608edcSAllan Stephens * tipc_port_list_add - add a port to a port list, ensuring no duplicates 89643608edcSAllan Stephens */ 89743608edcSAllan Stephens 89843608edcSAllan Stephens void tipc_port_list_add(struct port_list *pl_ptr, u32 port) 89943608edcSAllan Stephens { 90043608edcSAllan Stephens struct port_list *item = pl_ptr; 90143608edcSAllan Stephens int i; 90243608edcSAllan Stephens int item_sz = PLSIZE; 90343608edcSAllan Stephens int cnt = pl_ptr->count; 90443608edcSAllan Stephens 90543608edcSAllan Stephens for (; ; cnt -= item_sz, item = item->next) { 90643608edcSAllan Stephens if (cnt < PLSIZE) 90743608edcSAllan Stephens item_sz = cnt; 90843608edcSAllan Stephens for (i = 0; i < item_sz; i++) 90943608edcSAllan Stephens if (item->ports[i] == port) 91043608edcSAllan Stephens return; 91143608edcSAllan Stephens if (i < PLSIZE) { 91243608edcSAllan Stephens item->ports[i] = port; 91343608edcSAllan Stephens pl_ptr->count++; 91443608edcSAllan Stephens return; 91543608edcSAllan Stephens } 91643608edcSAllan Stephens if (!item->next) { 91743608edcSAllan Stephens item->next = kmalloc(sizeof(*item), GFP_ATOMIC); 91843608edcSAllan Stephens if (!item->next) { 91943608edcSAllan Stephens warn("Incomplete multicast delivery, no memory\n"); 92043608edcSAllan Stephens return; 92143608edcSAllan Stephens } 92243608edcSAllan Stephens item->next->next = NULL; 92343608edcSAllan Stephens } 92443608edcSAllan Stephens } 92543608edcSAllan Stephens } 92643608edcSAllan Stephens 92743608edcSAllan Stephens /** 92843608edcSAllan Stephens * tipc_port_list_free - free dynamically created entries in port_list chain 92943608edcSAllan Stephens * 93043608edcSAllan Stephens */ 93143608edcSAllan Stephens 93243608edcSAllan Stephens void tipc_port_list_free(struct port_list *pl_ptr) 93343608edcSAllan Stephens { 93443608edcSAllan Stephens struct port_list *item; 93543608edcSAllan Stephens struct port_list *next; 93643608edcSAllan Stephens 93743608edcSAllan Stephens for (item = pl_ptr->next; item; item = next) { 93843608edcSAllan Stephens next = item->next; 93943608edcSAllan Stephens kfree(item); 94043608edcSAllan Stephens } 94143608edcSAllan Stephens } 94243608edcSAllan Stephens 943