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 "bcast.h" 42b97bf3fdSPer Liden 43b97bf3fdSPer Liden #define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */ 44b97bf3fdSPer Liden 45b97bf3fdSPer Liden #define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */ 46b97bf3fdSPer Liden 47d356eebaSAllan Stephens /* 48d356eebaSAllan Stephens * Loss rate for incoming broadcast frames; used to test retransmission code. 49d356eebaSAllan Stephens * Set to N to cause every N'th frame to be discarded; 0 => don't discard any. 50d356eebaSAllan Stephens */ 51d356eebaSAllan Stephens 52d356eebaSAllan Stephens #define TIPC_BCAST_LOSS_RATE 0 53d356eebaSAllan Stephens 54b97bf3fdSPer Liden /** 55b97bf3fdSPer Liden * struct bcbearer_pair - a pair of bearers used by broadcast link 56b97bf3fdSPer Liden * @primary: pointer to primary bearer 57b97bf3fdSPer Liden * @secondary: pointer to secondary bearer 58b97bf3fdSPer Liden * 59b97bf3fdSPer Liden * Bearers must have same priority and same set of reachable destinations 60b97bf3fdSPer Liden * to be paired. 61b97bf3fdSPer Liden */ 62b97bf3fdSPer Liden 63b97bf3fdSPer Liden struct bcbearer_pair { 64b97bf3fdSPer Liden struct bearer *primary; 65b97bf3fdSPer Liden struct bearer *secondary; 66b97bf3fdSPer Liden }; 67b97bf3fdSPer Liden 68b97bf3fdSPer Liden /** 69b97bf3fdSPer Liden * struct bcbearer - bearer used by broadcast link 70b97bf3fdSPer Liden * @bearer: (non-standard) broadcast bearer structure 71b97bf3fdSPer Liden * @media: (non-standard) broadcast media structure 72b97bf3fdSPer Liden * @bpairs: array of bearer pairs 7365f51ef0SAllan Stephens * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort() 7465f51ef0SAllan Stephens * @remains: temporary node map used by tipc_bcbearer_send() 7565f51ef0SAllan Stephens * @remains_new: temporary node map used tipc_bcbearer_send() 7665f51ef0SAllan Stephens * 7765f51ef0SAllan Stephens * Note: The fields labelled "temporary" are incorporated into the bearer 7865f51ef0SAllan Stephens * to avoid consuming potentially limited stack space through the use of 7965f51ef0SAllan Stephens * large local variables within multicast routines. Concurrent access is 8065f51ef0SAllan Stephens * prevented through use of the spinlock "bc_lock". 81b97bf3fdSPer Liden */ 82b97bf3fdSPer Liden 83b97bf3fdSPer Liden struct bcbearer { 84b97bf3fdSPer Liden struct bearer bearer; 85b97bf3fdSPer Liden struct media media; 86b97bf3fdSPer Liden struct bcbearer_pair bpairs[MAX_BEARERS]; 8716cb4b33SPer Liden struct bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1]; 886c00055aSDavid S. Miller struct tipc_node_map remains; 896c00055aSDavid S. Miller struct tipc_node_map remains_new; 90b97bf3fdSPer Liden }; 91b97bf3fdSPer Liden 92b97bf3fdSPer Liden /** 93b97bf3fdSPer Liden * struct bclink - link used for broadcast messages 94b97bf3fdSPer Liden * @link: (non-standard) broadcast link structure 95b97bf3fdSPer Liden * @node: (non-standard) node structure representing b'cast link's peer node 96b97bf3fdSPer Liden * 97b97bf3fdSPer Liden * Handles sequence numbering, fragmentation, bundling, etc. 98b97bf3fdSPer Liden */ 99b97bf3fdSPer Liden 100b97bf3fdSPer Liden struct bclink { 101b97bf3fdSPer Liden struct link link; 1026c00055aSDavid S. Miller struct tipc_node node; 103b97bf3fdSPer Liden }; 104b97bf3fdSPer Liden 105b97bf3fdSPer Liden 106e3ec9c7dSAllan Stephens static struct bcbearer *bcbearer; 107e3ec9c7dSAllan Stephens static struct bclink *bclink; 108e3ec9c7dSAllan Stephens static struct link *bcl; 10934af946aSIngo Molnar static DEFINE_SPINLOCK(bc_lock); 110b97bf3fdSPer Liden 1118f92df6aSAllan Stephens /* broadcast-capable node map */ 1128f92df6aSAllan Stephens struct tipc_node_map tipc_bcast_nmap; 1138f92df6aSAllan Stephens 1143aec9cc9SAllan Stephens const char tipc_bclink_name[] = "broadcast-link"; 115b97bf3fdSPer Liden 11631e3c3f6Sstephen hemminger static void tipc_nmap_diff(struct tipc_node_map *nm_a, 11731e3c3f6Sstephen hemminger struct tipc_node_map *nm_b, 11831e3c3f6Sstephen hemminger struct tipc_node_map *nm_diff); 119b97bf3fdSPer Liden 12005790c64SSam Ravnborg static u32 buf_seqno(struct sk_buff *buf) 121b97bf3fdSPer Liden { 122b97bf3fdSPer Liden return msg_seqno(buf_msg(buf)); 123b97bf3fdSPer Liden } 124b97bf3fdSPer Liden 12505790c64SSam Ravnborg static u32 bcbuf_acks(struct sk_buff *buf) 126b97bf3fdSPer Liden { 127880b005fSDavid S. Miller return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle; 128b97bf3fdSPer Liden } 129b97bf3fdSPer Liden 13005790c64SSam Ravnborg static void bcbuf_set_acks(struct sk_buff *buf, u32 acks) 131b97bf3fdSPer Liden { 132880b005fSDavid S. Miller TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks; 133b97bf3fdSPer Liden } 134b97bf3fdSPer Liden 13505790c64SSam Ravnborg static void bcbuf_decr_acks(struct sk_buff *buf) 136b97bf3fdSPer Liden { 137b97bf3fdSPer Liden bcbuf_set_acks(buf, bcbuf_acks(buf) - 1); 138b97bf3fdSPer Liden } 139b97bf3fdSPer Liden 140b97bf3fdSPer Liden 1415b1f7bdeSAllan Stephens static void bclink_set_last_sent(void) 1425b1f7bdeSAllan Stephens { 1435b1f7bdeSAllan Stephens if (bcl->next_out) 1445b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1); 1455b1f7bdeSAllan Stephens else 1465b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1); 1475b1f7bdeSAllan Stephens } 1485b1f7bdeSAllan Stephens 1495b1f7bdeSAllan Stephens u32 tipc_bclink_get_last_sent(void) 1505b1f7bdeSAllan Stephens { 1515b1f7bdeSAllan Stephens return bcl->fsm_msg_cnt; 1525b1f7bdeSAllan Stephens } 1535b1f7bdeSAllan Stephens 154b97bf3fdSPer Liden /** 155b97bf3fdSPer Liden * bclink_set_gap - set gap according to contents of current deferred pkt queue 156b97bf3fdSPer Liden * 157b97bf3fdSPer Liden * Called with 'node' locked, bc_lock unlocked 158b97bf3fdSPer Liden */ 159b97bf3fdSPer Liden 1606c00055aSDavid S. Miller static void bclink_set_gap(struct tipc_node *n_ptr) 161b97bf3fdSPer Liden { 162b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 163b97bf3fdSPer Liden 164b97bf3fdSPer Liden n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 165b97bf3fdSPer Liden mod(n_ptr->bclink.last_in); 166b97bf3fdSPer Liden if (unlikely(buf != NULL)) 167b97bf3fdSPer Liden n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1); 168b97bf3fdSPer Liden } 169b97bf3fdSPer Liden 170b97bf3fdSPer Liden /** 171b97bf3fdSPer Liden * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment 172b97bf3fdSPer Liden * 173b97bf3fdSPer Liden * This mechanism endeavours to prevent all nodes in network from trying 174b97bf3fdSPer Liden * to ACK or NACK at the same time. 175b97bf3fdSPer Liden * 176b97bf3fdSPer Liden * Note: TIPC uses a different trigger to distribute ACKs than it does to 177b97bf3fdSPer Liden * distribute NACKs, but tries to use the same spacing (divide by 16). 178b97bf3fdSPer Liden */ 179b97bf3fdSPer Liden 18005790c64SSam Ravnborg static int bclink_ack_allowed(u32 n) 181b97bf3fdSPer Liden { 182a02cec21SEric Dumazet return (n % TIPC_MIN_LINK_WIN) == tipc_own_tag; 183b97bf3fdSPer Liden } 184b97bf3fdSPer Liden 185b97bf3fdSPer Liden 186b97bf3fdSPer Liden /** 187b97bf3fdSPer Liden * bclink_retransmit_pkt - retransmit broadcast packets 188b97bf3fdSPer Liden * @after: sequence number of last packet to *not* retransmit 189b97bf3fdSPer Liden * @to: sequence number of last packet to retransmit 190b97bf3fdSPer Liden * 191d356eebaSAllan Stephens * Called with bc_lock locked 192b97bf3fdSPer Liden */ 193b97bf3fdSPer Liden 194b97bf3fdSPer Liden static void bclink_retransmit_pkt(u32 after, u32 to) 195b97bf3fdSPer Liden { 196b97bf3fdSPer Liden struct sk_buff *buf; 197b97bf3fdSPer Liden 198b97bf3fdSPer Liden buf = bcl->first_out; 199a016892cSAllan Stephens while (buf && less_eq(buf_seqno(buf), after)) 200b97bf3fdSPer Liden buf = buf->next; 2014323add6SPer Liden tipc_link_retransmit(bcl, buf, mod(to - after)); 202b97bf3fdSPer Liden } 203b97bf3fdSPer Liden 204b97bf3fdSPer Liden /** 2054323add6SPer Liden * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets 206b97bf3fdSPer Liden * @n_ptr: node that sent acknowledgement info 207b97bf3fdSPer Liden * @acked: broadcast sequence # that has been acknowledged 208b97bf3fdSPer Liden * 209b97bf3fdSPer Liden * Node is locked, bc_lock unlocked. 210b97bf3fdSPer Liden */ 211b97bf3fdSPer Liden 2126c00055aSDavid S. Miller void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked) 213b97bf3fdSPer Liden { 214b97bf3fdSPer Liden struct sk_buff *crs; 215b97bf3fdSPer Liden struct sk_buff *next; 216b97bf3fdSPer Liden unsigned int released = 0; 217b97bf3fdSPer Liden 218b97bf3fdSPer Liden if (less_eq(acked, n_ptr->bclink.acked)) 219b97bf3fdSPer Liden return; 220b97bf3fdSPer Liden 221b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 222b97bf3fdSPer Liden 223b97bf3fdSPer Liden /* Skip over packets that node has previously acknowledged */ 224b97bf3fdSPer Liden 225b97bf3fdSPer Liden crs = bcl->first_out; 226a016892cSAllan Stephens while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) 227b97bf3fdSPer Liden crs = crs->next; 228b97bf3fdSPer Liden 229b97bf3fdSPer Liden /* Update packets that node is now acknowledging */ 230b97bf3fdSPer Liden 231b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), acked)) { 232b97bf3fdSPer Liden next = crs->next; 233b97bf3fdSPer Liden bcbuf_decr_acks(crs); 234b97bf3fdSPer Liden if (bcbuf_acks(crs) == 0) { 235b97bf3fdSPer Liden bcl->first_out = next; 236b97bf3fdSPer Liden bcl->out_queue_size--; 237b97bf3fdSPer Liden buf_discard(crs); 238b97bf3fdSPer Liden released = 1; 239b97bf3fdSPer Liden } 240b97bf3fdSPer Liden crs = next; 241b97bf3fdSPer Liden } 242b97bf3fdSPer Liden n_ptr->bclink.acked = acked; 243b97bf3fdSPer Liden 244b97bf3fdSPer Liden /* Try resolving broadcast link congestion, if necessary */ 245b97bf3fdSPer Liden 2465b1f7bdeSAllan Stephens if (unlikely(bcl->next_out)) { 2474323add6SPer Liden tipc_link_push_queue(bcl); 2485b1f7bdeSAllan Stephens bclink_set_last_sent(); 2495b1f7bdeSAllan Stephens } 250b97bf3fdSPer Liden if (unlikely(released && !list_empty(&bcl->waiting_ports))) 2514323add6SPer Liden tipc_link_wakeup_ports(bcl, 0); 252b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 253b97bf3fdSPer Liden } 254b97bf3fdSPer Liden 255b97bf3fdSPer Liden /** 256b97bf3fdSPer Liden * bclink_send_ack - unicast an ACK msg 257b97bf3fdSPer Liden * 2584323add6SPer Liden * tipc_net_lock and node lock set 259b97bf3fdSPer Liden */ 260b97bf3fdSPer Liden 2616c00055aSDavid S. Miller static void bclink_send_ack(struct tipc_node *n_ptr) 262b97bf3fdSPer Liden { 263b97bf3fdSPer Liden struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1]; 264b97bf3fdSPer Liden 265b97bf3fdSPer Liden if (l_ptr != NULL) 2664323add6SPer Liden tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0); 267b97bf3fdSPer Liden } 268b97bf3fdSPer Liden 269b97bf3fdSPer Liden /** 270b97bf3fdSPer Liden * bclink_send_nack- broadcast a NACK msg 271b97bf3fdSPer Liden * 2724323add6SPer Liden * tipc_net_lock and node lock set 273b97bf3fdSPer Liden */ 274b97bf3fdSPer Liden 2756c00055aSDavid S. Miller static void bclink_send_nack(struct tipc_node *n_ptr) 276b97bf3fdSPer Liden { 277b97bf3fdSPer Liden struct sk_buff *buf; 278b97bf3fdSPer Liden struct tipc_msg *msg; 279b97bf3fdSPer Liden 280b97bf3fdSPer Liden if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to)) 281b97bf3fdSPer Liden return; 282b97bf3fdSPer Liden 28331e3c3f6Sstephen hemminger buf = tipc_buf_acquire(INT_H_SIZE); 284b97bf3fdSPer Liden if (buf) { 285b97bf3fdSPer Liden msg = buf_msg(buf); 286c68ca7b7SAllan Stephens tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG, 28775715217SAllan Stephens INT_H_SIZE, n_ptr->addr); 288b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 289b97bf3fdSPer Liden msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in)); 290b97bf3fdSPer Liden msg_set_bcgap_after(msg, n_ptr->bclink.gap_after); 291b97bf3fdSPer Liden msg_set_bcgap_to(msg, n_ptr->bclink.gap_to); 292b97bf3fdSPer Liden msg_set_bcast_tag(msg, tipc_own_tag); 293b97bf3fdSPer Liden 2941fc54d8fSSam Ravnborg if (tipc_bearer_send(&bcbearer->bearer, buf, NULL)) { 295b97bf3fdSPer Liden bcl->stats.sent_nacks++; 296b97bf3fdSPer Liden buf_discard(buf); 297b97bf3fdSPer Liden } else { 2984323add6SPer Liden tipc_bearer_schedule(bcl->b_ptr, bcl); 299b97bf3fdSPer Liden bcl->proto_msg_queue = buf; 300b97bf3fdSPer Liden bcl->stats.bearer_congs++; 301b97bf3fdSPer Liden } 302b97bf3fdSPer Liden 303b97bf3fdSPer Liden /* 304b97bf3fdSPer Liden * Ensure we doesn't send another NACK msg to the node 305b97bf3fdSPer Liden * until 16 more deferred messages arrive from it 306b97bf3fdSPer Liden * (i.e. helps prevent all nodes from NACK'ing at same time) 307b97bf3fdSPer Liden */ 308b97bf3fdSPer Liden 309b97bf3fdSPer Liden n_ptr->bclink.nack_sync = tipc_own_tag; 310b97bf3fdSPer Liden } 311b97bf3fdSPer Liden } 312b97bf3fdSPer Liden 313b97bf3fdSPer Liden /** 3144323add6SPer Liden * tipc_bclink_check_gap - send a NACK if a sequence gap exists 315b97bf3fdSPer Liden * 3164323add6SPer Liden * tipc_net_lock and node lock set 317b97bf3fdSPer Liden */ 318b97bf3fdSPer Liden 3196c00055aSDavid S. Miller void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 last_sent) 320b97bf3fdSPer Liden { 321b97bf3fdSPer Liden if (!n_ptr->bclink.supported || 322b97bf3fdSPer Liden less_eq(last_sent, mod(n_ptr->bclink.last_in))) 323b97bf3fdSPer Liden return; 324b97bf3fdSPer Liden 325b97bf3fdSPer Liden bclink_set_gap(n_ptr); 326b97bf3fdSPer Liden if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to) 327b97bf3fdSPer Liden n_ptr->bclink.gap_to = last_sent; 328b97bf3fdSPer Liden bclink_send_nack(n_ptr); 329b97bf3fdSPer Liden } 330b97bf3fdSPer Liden 331b97bf3fdSPer Liden /** 3324323add6SPer Liden * tipc_bclink_peek_nack - process a NACK msg meant for another node 333b97bf3fdSPer Liden * 3344323add6SPer Liden * Only tipc_net_lock set. 335b97bf3fdSPer Liden */ 336b97bf3fdSPer Liden 337988f088aSAdrian Bunk static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to) 338b97bf3fdSPer Liden { 3396c00055aSDavid S. Miller struct tipc_node *n_ptr = tipc_node_find(dest); 340b97bf3fdSPer Liden u32 my_after, my_to; 341b97bf3fdSPer Liden 3424323add6SPer Liden if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr))) 343b97bf3fdSPer Liden return; 3444323add6SPer Liden tipc_node_lock(n_ptr); 345b97bf3fdSPer Liden /* 346b97bf3fdSPer Liden * Modify gap to suppress unnecessary NACKs from this node 347b97bf3fdSPer Liden */ 348b97bf3fdSPer Liden my_after = n_ptr->bclink.gap_after; 349b97bf3fdSPer Liden my_to = n_ptr->bclink.gap_to; 350b97bf3fdSPer Liden 351b97bf3fdSPer Liden if (less_eq(gap_after, my_after)) { 352b97bf3fdSPer Liden if (less(my_after, gap_to) && less(gap_to, my_to)) 353b97bf3fdSPer Liden n_ptr->bclink.gap_after = gap_to; 354b97bf3fdSPer Liden else if (less_eq(my_to, gap_to)) 355b97bf3fdSPer Liden n_ptr->bclink.gap_to = n_ptr->bclink.gap_after; 356b97bf3fdSPer Liden } else if (less_eq(gap_after, my_to)) { 357b97bf3fdSPer Liden if (less_eq(my_to, gap_to)) 358b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 359b97bf3fdSPer Liden } else { 360b97bf3fdSPer Liden /* 361b97bf3fdSPer Liden * Expand gap if missing bufs not in deferred queue: 362b97bf3fdSPer Liden */ 363b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 364b97bf3fdSPer Liden u32 prev = n_ptr->bclink.gap_to; 365b97bf3fdSPer Liden 366b97bf3fdSPer Liden for (; buf; buf = buf->next) { 367b97bf3fdSPer Liden u32 seqno = buf_seqno(buf); 368b97bf3fdSPer Liden 3693ac90216SEric Sesterhenn if (mod(seqno - prev) != 1) { 370b97bf3fdSPer Liden buf = NULL; 3713ac90216SEric Sesterhenn break; 3723ac90216SEric Sesterhenn } 373b97bf3fdSPer Liden if (seqno == gap_after) 374b97bf3fdSPer Liden break; 375b97bf3fdSPer Liden prev = seqno; 376b97bf3fdSPer Liden } 377b97bf3fdSPer Liden if (buf == NULL) 378b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 379b97bf3fdSPer Liden } 380b97bf3fdSPer Liden /* 381b97bf3fdSPer Liden * Some nodes may send a complementary NACK now: 382b97bf3fdSPer Liden */ 383b97bf3fdSPer Liden if (bclink_ack_allowed(sender_tag + 1)) { 384b97bf3fdSPer Liden if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) { 385b97bf3fdSPer Liden bclink_send_nack(n_ptr); 386b97bf3fdSPer Liden bclink_set_gap(n_ptr); 387b97bf3fdSPer Liden } 388b97bf3fdSPer Liden } 3894323add6SPer Liden tipc_node_unlock(n_ptr); 390b97bf3fdSPer Liden } 391b97bf3fdSPer Liden 392b97bf3fdSPer Liden /** 3934323add6SPer Liden * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster 394b97bf3fdSPer Liden */ 395b97bf3fdSPer Liden 3964323add6SPer Liden int tipc_bclink_send_msg(struct sk_buff *buf) 397b97bf3fdSPer Liden { 398b97bf3fdSPer Liden int res; 399b97bf3fdSPer Liden 400b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 401b97bf3fdSPer Liden 4024323add6SPer Liden res = tipc_link_send_buf(bcl, buf); 403b97bf3fdSPer Liden if (unlikely(res == -ELINKCONG)) 404b97bf3fdSPer Liden buf_discard(buf); 4050048b826SAllan Stephens else 4065b1f7bdeSAllan Stephens bclink_set_last_sent(); 407b97bf3fdSPer Liden 408b97bf3fdSPer Liden if (bcl->out_queue_size > bcl->stats.max_queue_sz) 409b97bf3fdSPer Liden bcl->stats.max_queue_sz = bcl->out_queue_size; 410b97bf3fdSPer Liden bcl->stats.queue_sz_counts++; 411b97bf3fdSPer Liden bcl->stats.accu_queue_sz += bcl->out_queue_size; 412b97bf3fdSPer Liden 413b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 414b97bf3fdSPer Liden return res; 415b97bf3fdSPer Liden } 416b97bf3fdSPer Liden 417b97bf3fdSPer Liden /** 4184323add6SPer Liden * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards 419b97bf3fdSPer Liden * 4204323add6SPer Liden * tipc_net_lock is read_locked, no other locks set 421b97bf3fdSPer Liden */ 422b97bf3fdSPer Liden 4234323add6SPer Liden void tipc_bclink_recv_pkt(struct sk_buff *buf) 424b97bf3fdSPer Liden { 425d356eebaSAllan Stephens #if (TIPC_BCAST_LOSS_RATE) 426e3ec9c7dSAllan Stephens static int rx_count; 427d356eebaSAllan Stephens #endif 428b97bf3fdSPer Liden struct tipc_msg *msg = buf_msg(buf); 4296c00055aSDavid S. Miller struct tipc_node *node = tipc_node_find(msg_prevnode(msg)); 430b97bf3fdSPer Liden u32 next_in; 431b97bf3fdSPer Liden u32 seqno; 432b97bf3fdSPer Liden struct sk_buff *deferred; 433b97bf3fdSPer Liden 4344323add6SPer Liden if (unlikely(!node || !tipc_node_is_up(node) || !node->bclink.supported || 435b97bf3fdSPer Liden (msg_mc_netid(msg) != tipc_net_id))) { 436b97bf3fdSPer Liden buf_discard(buf); 437b97bf3fdSPer Liden return; 438b97bf3fdSPer Liden } 439b97bf3fdSPer Liden 440b97bf3fdSPer Liden if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { 441b97bf3fdSPer Liden if (msg_destnode(msg) == tipc_own_addr) { 4424323add6SPer Liden tipc_node_lock(node); 4434323add6SPer Liden tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); 4444323add6SPer Liden tipc_node_unlock(node); 445d356eebaSAllan Stephens spin_lock_bh(&bc_lock); 446b97bf3fdSPer Liden bcl->stats.recv_nacks++; 447d356eebaSAllan Stephens bcl->owner->next = node; /* remember requestor */ 448b97bf3fdSPer Liden bclink_retransmit_pkt(msg_bcgap_after(msg), 449b97bf3fdSPer Liden msg_bcgap_to(msg)); 450d356eebaSAllan Stephens bcl->owner->next = NULL; 451d356eebaSAllan Stephens spin_unlock_bh(&bc_lock); 452b97bf3fdSPer Liden } else { 4534323add6SPer Liden tipc_bclink_peek_nack(msg_destnode(msg), 454b97bf3fdSPer Liden msg_bcast_tag(msg), 455b97bf3fdSPer Liden msg_bcgap_after(msg), 456b97bf3fdSPer Liden msg_bcgap_to(msg)); 457b97bf3fdSPer Liden } 458b97bf3fdSPer Liden buf_discard(buf); 459b97bf3fdSPer Liden return; 460b97bf3fdSPer Liden } 461b97bf3fdSPer Liden 462d356eebaSAllan Stephens #if (TIPC_BCAST_LOSS_RATE) 463d356eebaSAllan Stephens if (++rx_count == TIPC_BCAST_LOSS_RATE) { 464d356eebaSAllan Stephens rx_count = 0; 465d356eebaSAllan Stephens buf_discard(buf); 466d356eebaSAllan Stephens return; 467d356eebaSAllan Stephens } 468d356eebaSAllan Stephens #endif 469d356eebaSAllan Stephens 4704323add6SPer Liden tipc_node_lock(node); 471b97bf3fdSPer Liden receive: 472b97bf3fdSPer Liden deferred = node->bclink.deferred_head; 473b97bf3fdSPer Liden next_in = mod(node->bclink.last_in + 1); 474b97bf3fdSPer Liden seqno = msg_seqno(msg); 475b97bf3fdSPer Liden 476b97bf3fdSPer Liden if (likely(seqno == next_in)) { 477b97bf3fdSPer Liden bcl->stats.recv_info++; 478b97bf3fdSPer Liden node->bclink.last_in++; 479b97bf3fdSPer Liden bclink_set_gap(node); 480b97bf3fdSPer Liden if (unlikely(bclink_ack_allowed(seqno))) { 481b97bf3fdSPer Liden bclink_send_ack(node); 482b97bf3fdSPer Liden bcl->stats.sent_acks++; 483b97bf3fdSPer Liden } 484b97bf3fdSPer Liden if (likely(msg_isdata(msg))) { 4854323add6SPer Liden tipc_node_unlock(node); 4864323add6SPer Liden tipc_port_recv_mcast(buf, NULL); 487b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_BUNDLER) { 488b97bf3fdSPer Liden bcl->stats.recv_bundles++; 489b97bf3fdSPer Liden bcl->stats.recv_bundled += msg_msgcnt(msg); 4904323add6SPer Liden tipc_node_unlock(node); 4914323add6SPer Liden tipc_link_recv_bundle(buf); 492b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_FRAGMENTER) { 493b97bf3fdSPer Liden bcl->stats.recv_fragments++; 4944323add6SPer Liden if (tipc_link_recv_fragment(&node->bclink.defragm, 495b97bf3fdSPer Liden &buf, &msg)) 496b97bf3fdSPer Liden bcl->stats.recv_fragmented++; 4974323add6SPer Liden tipc_node_unlock(node); 4984323add6SPer Liden tipc_net_route_msg(buf); 499b97bf3fdSPer Liden } else { 5004323add6SPer Liden tipc_node_unlock(node); 5014323add6SPer Liden tipc_net_route_msg(buf); 502b97bf3fdSPer Liden } 503b97bf3fdSPer Liden if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) { 5044323add6SPer Liden tipc_node_lock(node); 505b97bf3fdSPer Liden buf = deferred; 506b97bf3fdSPer Liden msg = buf_msg(buf); 507b97bf3fdSPer Liden node->bclink.deferred_head = deferred->next; 508b97bf3fdSPer Liden goto receive; 509b97bf3fdSPer Liden } 510b97bf3fdSPer Liden return; 511b97bf3fdSPer Liden } else if (less(next_in, seqno)) { 512b97bf3fdSPer Liden u32 gap_after = node->bclink.gap_after; 513b97bf3fdSPer Liden u32 gap_to = node->bclink.gap_to; 514b97bf3fdSPer Liden 5154323add6SPer Liden if (tipc_link_defer_pkt(&node->bclink.deferred_head, 516b97bf3fdSPer Liden &node->bclink.deferred_tail, 517b97bf3fdSPer Liden buf)) { 518b97bf3fdSPer Liden node->bclink.nack_sync++; 519b97bf3fdSPer Liden bcl->stats.deferred_recv++; 520b97bf3fdSPer Liden if (seqno == mod(gap_after + 1)) 521b97bf3fdSPer Liden node->bclink.gap_after = seqno; 522b97bf3fdSPer Liden else if (less(gap_after, seqno) && less(seqno, gap_to)) 523b97bf3fdSPer Liden node->bclink.gap_to = seqno; 524b97bf3fdSPer Liden } 525b97bf3fdSPer Liden if (bclink_ack_allowed(node->bclink.nack_sync)) { 526b97bf3fdSPer Liden if (gap_to != gap_after) 527b97bf3fdSPer Liden bclink_send_nack(node); 528b97bf3fdSPer Liden bclink_set_gap(node); 529b97bf3fdSPer Liden } 530b97bf3fdSPer Liden } else { 531b97bf3fdSPer Liden bcl->stats.duplicates++; 532b97bf3fdSPer Liden buf_discard(buf); 533b97bf3fdSPer Liden } 5344323add6SPer Liden tipc_node_unlock(node); 535b97bf3fdSPer Liden } 536b97bf3fdSPer Liden 5376c00055aSDavid S. Miller u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) 538b97bf3fdSPer Liden { 539b97bf3fdSPer Liden return (n_ptr->bclink.supported && 5404323add6SPer Liden (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); 541b97bf3fdSPer Liden } 542b97bf3fdSPer Liden 543b97bf3fdSPer Liden 544b97bf3fdSPer Liden /** 5454323add6SPer Liden * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer 546b97bf3fdSPer Liden * 547b97bf3fdSPer Liden * Send through as many bearers as necessary to reach all nodes 548b97bf3fdSPer Liden * that support TIPC multicasting. 549b97bf3fdSPer Liden * 550b97bf3fdSPer Liden * Returns 0 if packet sent successfully, non-zero if not 551b97bf3fdSPer Liden */ 552b97bf3fdSPer Liden 553988f088aSAdrian Bunk static int tipc_bcbearer_send(struct sk_buff *buf, 554b97bf3fdSPer Liden struct tipc_bearer *unused1, 555b97bf3fdSPer Liden struct tipc_media_addr *unused2) 556b97bf3fdSPer Liden { 557b97bf3fdSPer Liden int bp_index; 558b97bf3fdSPer Liden 559b97bf3fdSPer Liden /* Prepare buffer for broadcasting (if first time trying to send it) */ 560b97bf3fdSPer Liden 561b97bf3fdSPer Liden if (likely(!msg_non_seq(buf_msg(buf)))) { 562b97bf3fdSPer Liden struct tipc_msg *msg; 563b97bf3fdSPer Liden 5648f92df6aSAllan Stephens assert(tipc_bcast_nmap.count != 0); 5658f92df6aSAllan Stephens bcbuf_set_acks(buf, tipc_bcast_nmap.count); 566b97bf3fdSPer Liden msg = buf_msg(buf); 56740aecb1bSAllan Stephens msg_set_non_seq(msg, 1); 568b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 5690048b826SAllan Stephens bcl->stats.sent_info++; 570b97bf3fdSPer Liden } 571b97bf3fdSPer Liden 572b97bf3fdSPer Liden /* Send buffer over bearers until all targets reached */ 573b97bf3fdSPer Liden 5748f92df6aSAllan Stephens bcbearer->remains = tipc_bcast_nmap; 575b97bf3fdSPer Liden 576b97bf3fdSPer Liden for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { 577b97bf3fdSPer Liden struct bearer *p = bcbearer->bpairs[bp_index].primary; 578b97bf3fdSPer Liden struct bearer *s = bcbearer->bpairs[bp_index].secondary; 579b97bf3fdSPer Liden 580b97bf3fdSPer Liden if (!p) 581b97bf3fdSPer Liden break; /* no more bearers to try */ 582b97bf3fdSPer Liden 58365f51ef0SAllan Stephens tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new); 58465f51ef0SAllan Stephens if (bcbearer->remains_new.count == bcbearer->remains.count) 585b97bf3fdSPer Liden continue; /* bearer pair doesn't add anything */ 586b97bf3fdSPer Liden 5871a624832SNeil Horman if (p->publ.blocked || 5881a624832SNeil Horman p->media->send_msg(buf, &p->publ, &p->media->bcast_addr)) { 5891a624832SNeil Horman /* unable to send on primary bearer */ 5901a624832SNeil Horman if (!s || s->publ.blocked || 5911a624832SNeil Horman s->media->send_msg(buf, &s->publ, 5921a624832SNeil Horman &s->media->bcast_addr)) { 5931a624832SNeil Horman /* unable to send on either bearer */ 5941a624832SNeil Horman continue; 5951a624832SNeil Horman } 596b97bf3fdSPer Liden } 597b97bf3fdSPer Liden 5981a624832SNeil Horman if (s) { 599b97bf3fdSPer Liden bcbearer->bpairs[bp_index].primary = s; 600b97bf3fdSPer Liden bcbearer->bpairs[bp_index].secondary = p; 6011a624832SNeil Horman } 6021a624832SNeil Horman 60365f51ef0SAllan Stephens if (bcbearer->remains_new.count == 0) 6040e35fd5eSAllan Stephens return 0; 605b97bf3fdSPer Liden 60665f51ef0SAllan Stephens bcbearer->remains = bcbearer->remains_new; 607b97bf3fdSPer Liden } 608b97bf3fdSPer Liden 6097e3e5d09SAllan Stephens /* 6107e3e5d09SAllan Stephens * Unable to reach all targets (indicate success, since currently 6117e3e5d09SAllan Stephens * there isn't code in place to properly block & unblock the 6127e3e5d09SAllan Stephens * pseudo-bearer used by the broadcast link) 6137e3e5d09SAllan Stephens */ 614b97bf3fdSPer Liden 6157e3e5d09SAllan Stephens return TIPC_OK; 616b97bf3fdSPer Liden } 617b97bf3fdSPer Liden 618b97bf3fdSPer Liden /** 6194323add6SPer Liden * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer 620b97bf3fdSPer Liden */ 621b97bf3fdSPer Liden 6224323add6SPer Liden void tipc_bcbearer_sort(void) 623b97bf3fdSPer Liden { 624b97bf3fdSPer Liden struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp; 625b97bf3fdSPer Liden struct bcbearer_pair *bp_curr; 626b97bf3fdSPer Liden int b_index; 627b97bf3fdSPer Liden int pri; 628b97bf3fdSPer Liden 629b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 630b97bf3fdSPer Liden 631b97bf3fdSPer Liden /* Group bearers by priority (can assume max of two per priority) */ 632b97bf3fdSPer Liden 633b97bf3fdSPer Liden memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); 634b97bf3fdSPer Liden 635b97bf3fdSPer Liden for (b_index = 0; b_index < MAX_BEARERS; b_index++) { 6364323add6SPer Liden struct bearer *b = &tipc_bearers[b_index]; 637b97bf3fdSPer Liden 638b97bf3fdSPer Liden if (!b->active || !b->nodes.count) 639b97bf3fdSPer Liden continue; 640b97bf3fdSPer Liden 641b97bf3fdSPer Liden if (!bp_temp[b->priority].primary) 642b97bf3fdSPer Liden bp_temp[b->priority].primary = b; 643b97bf3fdSPer Liden else 644b97bf3fdSPer Liden bp_temp[b->priority].secondary = b; 645b97bf3fdSPer Liden } 646b97bf3fdSPer Liden 647b97bf3fdSPer Liden /* Create array of bearer pairs for broadcasting */ 648b97bf3fdSPer Liden 649b97bf3fdSPer Liden bp_curr = bcbearer->bpairs; 650b97bf3fdSPer Liden memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); 651b97bf3fdSPer Liden 65216cb4b33SPer Liden for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { 653b97bf3fdSPer Liden 654b97bf3fdSPer Liden if (!bp_temp[pri].primary) 655b97bf3fdSPer Liden continue; 656b97bf3fdSPer Liden 657b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].primary; 658b97bf3fdSPer Liden 659b97bf3fdSPer Liden if (bp_temp[pri].secondary) { 6604323add6SPer Liden if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, 661b97bf3fdSPer Liden &bp_temp[pri].secondary->nodes)) { 662b97bf3fdSPer Liden bp_curr->secondary = bp_temp[pri].secondary; 663b97bf3fdSPer Liden } else { 664b97bf3fdSPer Liden bp_curr++; 665b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].secondary; 666b97bf3fdSPer Liden } 667b97bf3fdSPer Liden } 668b97bf3fdSPer Liden 669b97bf3fdSPer Liden bp_curr++; 670b97bf3fdSPer Liden } 671b97bf3fdSPer Liden 672b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 673b97bf3fdSPer Liden } 674b97bf3fdSPer Liden 675b97bf3fdSPer Liden /** 6764323add6SPer Liden * tipc_bcbearer_push - resolve bearer congestion 677b97bf3fdSPer Liden * 678b97bf3fdSPer Liden * Forces bclink to push out any unsent packets, until all packets are gone 679b97bf3fdSPer Liden * or congestion reoccurs. 680b97bf3fdSPer Liden * No locks set when function called 681b97bf3fdSPer Liden */ 682b97bf3fdSPer Liden 6834323add6SPer Liden void tipc_bcbearer_push(void) 684b97bf3fdSPer Liden { 685b97bf3fdSPer Liden struct bearer *b_ptr; 686b97bf3fdSPer Liden 687b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 688b97bf3fdSPer Liden b_ptr = &bcbearer->bearer; 689b97bf3fdSPer Liden if (b_ptr->publ.blocked) { 690b97bf3fdSPer Liden b_ptr->publ.blocked = 0; 6914323add6SPer Liden tipc_bearer_lock_push(b_ptr); 692b97bf3fdSPer Liden } 693b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 694b97bf3fdSPer Liden } 695b97bf3fdSPer Liden 696b97bf3fdSPer Liden 6974323add6SPer Liden int tipc_bclink_stats(char *buf, const u32 buf_size) 698b97bf3fdSPer Liden { 699b97bf3fdSPer Liden struct print_buf pb; 700b97bf3fdSPer Liden 701b97bf3fdSPer Liden if (!bcl) 702b97bf3fdSPer Liden return 0; 703b97bf3fdSPer Liden 7044323add6SPer Liden tipc_printbuf_init(&pb, buf, buf_size); 705b97bf3fdSPer Liden 706b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 707b97bf3fdSPer Liden 708b97bf3fdSPer Liden tipc_printf(&pb, "Link <%s>\n" 709b97bf3fdSPer Liden " Window:%u packets\n", 710b97bf3fdSPer Liden bcl->name, bcl->queue_limit[0]); 711b97bf3fdSPer Liden tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n", 712b97bf3fdSPer Liden bcl->stats.recv_info, 713b97bf3fdSPer Liden bcl->stats.recv_fragments, 714b97bf3fdSPer Liden bcl->stats.recv_fragmented, 715b97bf3fdSPer Liden bcl->stats.recv_bundles, 716b97bf3fdSPer Liden bcl->stats.recv_bundled); 717b97bf3fdSPer Liden tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n", 718b97bf3fdSPer Liden bcl->stats.sent_info, 719b97bf3fdSPer Liden bcl->stats.sent_fragments, 720b97bf3fdSPer Liden bcl->stats.sent_fragmented, 721b97bf3fdSPer Liden bcl->stats.sent_bundles, 722b97bf3fdSPer Liden bcl->stats.sent_bundled); 723b97bf3fdSPer Liden tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n", 724b97bf3fdSPer Liden bcl->stats.recv_nacks, 725b97bf3fdSPer Liden bcl->stats.deferred_recv, 726b97bf3fdSPer Liden bcl->stats.duplicates); 727b97bf3fdSPer Liden tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n", 728b97bf3fdSPer Liden bcl->stats.sent_nacks, 729b97bf3fdSPer Liden bcl->stats.sent_acks, 730b97bf3fdSPer Liden bcl->stats.retransmitted); 731b97bf3fdSPer Liden tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n", 732b97bf3fdSPer Liden bcl->stats.bearer_congs, 733b97bf3fdSPer Liden bcl->stats.link_congs, 734b97bf3fdSPer Liden bcl->stats.max_queue_sz, 735b97bf3fdSPer Liden bcl->stats.queue_sz_counts 736b97bf3fdSPer Liden ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts) 737b97bf3fdSPer Liden : 0); 738b97bf3fdSPer Liden 739b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7404323add6SPer Liden return tipc_printbuf_validate(&pb); 741b97bf3fdSPer Liden } 742b97bf3fdSPer Liden 7434323add6SPer Liden int tipc_bclink_reset_stats(void) 744b97bf3fdSPer Liden { 745b97bf3fdSPer Liden if (!bcl) 746b97bf3fdSPer Liden return -ENOPROTOOPT; 747b97bf3fdSPer Liden 748b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 749b97bf3fdSPer Liden memset(&bcl->stats, 0, sizeof(bcl->stats)); 750b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7510e35fd5eSAllan Stephens return 0; 752b97bf3fdSPer Liden } 753b97bf3fdSPer Liden 7544323add6SPer Liden int tipc_bclink_set_queue_limits(u32 limit) 755b97bf3fdSPer Liden { 756b97bf3fdSPer Liden if (!bcl) 757b97bf3fdSPer Liden return -ENOPROTOOPT; 758b97bf3fdSPer Liden if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) 759b97bf3fdSPer Liden return -EINVAL; 760b97bf3fdSPer Liden 761b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 7624323add6SPer Liden tipc_link_set_queue_limits(bcl, limit); 763b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7640e35fd5eSAllan Stephens return 0; 765b97bf3fdSPer Liden } 766b97bf3fdSPer Liden 7674323add6SPer Liden int tipc_bclink_init(void) 768b97bf3fdSPer Liden { 7692710b57fSArnaldo Carvalho de Melo bcbearer = kzalloc(sizeof(*bcbearer), GFP_ATOMIC); 7702710b57fSArnaldo Carvalho de Melo bclink = kzalloc(sizeof(*bclink), GFP_ATOMIC); 771b97bf3fdSPer Liden if (!bcbearer || !bclink) { 772a10bd924SAllan Stephens warn("Multicast link creation failed, no memory\n"); 773b97bf3fdSPer Liden kfree(bcbearer); 774b97bf3fdSPer Liden bcbearer = NULL; 775b97bf3fdSPer Liden kfree(bclink); 776b97bf3fdSPer Liden bclink = NULL; 777b97bf3fdSPer Liden return -ENOMEM; 778b97bf3fdSPer Liden } 779b97bf3fdSPer Liden 780b97bf3fdSPer Liden INIT_LIST_HEAD(&bcbearer->bearer.cong_links); 781b97bf3fdSPer Liden bcbearer->bearer.media = &bcbearer->media; 7824323add6SPer Liden bcbearer->media.send_msg = tipc_bcbearer_send; 783b97bf3fdSPer Liden sprintf(bcbearer->media.name, "tipc-multicast"); 784b97bf3fdSPer Liden 785b97bf3fdSPer Liden bcl = &bclink->link; 786b97bf3fdSPer Liden INIT_LIST_HEAD(&bcl->waiting_ports); 787b97bf3fdSPer Liden bcl->next_out_no = 1; 78834af946aSIngo Molnar spin_lock_init(&bclink->node.lock); 789b97bf3fdSPer Liden bcl->owner = &bclink->node; 790b97bf3fdSPer Liden bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; 7914323add6SPer Liden tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); 792b97bf3fdSPer Liden bcl->b_ptr = &bcbearer->bearer; 793b97bf3fdSPer Liden bcl->state = WORKING_WORKING; 7944b704d59SStephen Hemminger strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME); 795b97bf3fdSPer Liden 7960e35fd5eSAllan Stephens return 0; 797b97bf3fdSPer Liden } 798b97bf3fdSPer Liden 7994323add6SPer Liden void tipc_bclink_stop(void) 800b97bf3fdSPer Liden { 801b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 802b97bf3fdSPer Liden if (bcbearer) { 8034323add6SPer Liden tipc_link_stop(bcl); 804b97bf3fdSPer Liden bcl = NULL; 805b97bf3fdSPer Liden kfree(bclink); 806b97bf3fdSPer Liden bclink = NULL; 807b97bf3fdSPer Liden kfree(bcbearer); 808b97bf3fdSPer Liden bcbearer = NULL; 809b97bf3fdSPer Liden } 810b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 811b97bf3fdSPer Liden } 812b97bf3fdSPer Liden 8133e22e62bSAllan Stephens 8143e22e62bSAllan Stephens /** 8153e22e62bSAllan Stephens * tipc_nmap_add - add a node to a node map 8163e22e62bSAllan Stephens */ 8173e22e62bSAllan Stephens 8183e22e62bSAllan Stephens void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node) 8193e22e62bSAllan Stephens { 8203e22e62bSAllan Stephens int n = tipc_node(node); 8213e22e62bSAllan Stephens int w = n / WSIZE; 8223e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8233e22e62bSAllan Stephens 8243e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) == 0) { 8253e22e62bSAllan Stephens nm_ptr->count++; 8263e22e62bSAllan Stephens nm_ptr->map[w] |= mask; 8273e22e62bSAllan Stephens } 8283e22e62bSAllan Stephens } 8293e22e62bSAllan Stephens 8303e22e62bSAllan Stephens /** 8313e22e62bSAllan Stephens * tipc_nmap_remove - remove a node from a node map 8323e22e62bSAllan Stephens */ 8333e22e62bSAllan Stephens 8343e22e62bSAllan Stephens void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node) 8353e22e62bSAllan Stephens { 8363e22e62bSAllan Stephens int n = tipc_node(node); 8373e22e62bSAllan Stephens int w = n / WSIZE; 8383e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8393e22e62bSAllan Stephens 8403e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) != 0) { 8413e22e62bSAllan Stephens nm_ptr->map[w] &= ~mask; 8423e22e62bSAllan Stephens nm_ptr->count--; 8433e22e62bSAllan Stephens } 8443e22e62bSAllan Stephens } 8453e22e62bSAllan Stephens 8463e22e62bSAllan Stephens /** 8473e22e62bSAllan Stephens * tipc_nmap_diff - find differences between node maps 8483e22e62bSAllan Stephens * @nm_a: input node map A 8493e22e62bSAllan Stephens * @nm_b: input node map B 8503e22e62bSAllan Stephens * @nm_diff: output node map A-B (i.e. nodes of A that are not in B) 8513e22e62bSAllan Stephens */ 8523e22e62bSAllan Stephens 85331e3c3f6Sstephen hemminger static void tipc_nmap_diff(struct tipc_node_map *nm_a, 85431e3c3f6Sstephen hemminger struct tipc_node_map *nm_b, 8553e22e62bSAllan Stephens struct tipc_node_map *nm_diff) 8563e22e62bSAllan Stephens { 8573e22e62bSAllan Stephens int stop = ARRAY_SIZE(nm_a->map); 8583e22e62bSAllan Stephens int w; 8593e22e62bSAllan Stephens int b; 8603e22e62bSAllan Stephens u32 map; 8613e22e62bSAllan Stephens 8623e22e62bSAllan Stephens memset(nm_diff, 0, sizeof(*nm_diff)); 8633e22e62bSAllan Stephens for (w = 0; w < stop; w++) { 8643e22e62bSAllan Stephens map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]); 8653e22e62bSAllan Stephens nm_diff->map[w] = map; 8663e22e62bSAllan Stephens if (map != 0) { 8673e22e62bSAllan Stephens for (b = 0 ; b < WSIZE; b++) { 8683e22e62bSAllan Stephens if (map & (1 << b)) 8693e22e62bSAllan Stephens nm_diff->count++; 8703e22e62bSAllan Stephens } 8713e22e62bSAllan Stephens } 8723e22e62bSAllan Stephens } 8733e22e62bSAllan Stephens } 87443608edcSAllan Stephens 87543608edcSAllan Stephens /** 87643608edcSAllan Stephens * tipc_port_list_add - add a port to a port list, ensuring no duplicates 87743608edcSAllan Stephens */ 87843608edcSAllan Stephens 87943608edcSAllan Stephens void tipc_port_list_add(struct port_list *pl_ptr, u32 port) 88043608edcSAllan Stephens { 88143608edcSAllan Stephens struct port_list *item = pl_ptr; 88243608edcSAllan Stephens int i; 88343608edcSAllan Stephens int item_sz = PLSIZE; 88443608edcSAllan Stephens int cnt = pl_ptr->count; 88543608edcSAllan Stephens 88643608edcSAllan Stephens for (; ; cnt -= item_sz, item = item->next) { 88743608edcSAllan Stephens if (cnt < PLSIZE) 88843608edcSAllan Stephens item_sz = cnt; 88943608edcSAllan Stephens for (i = 0; i < item_sz; i++) 89043608edcSAllan Stephens if (item->ports[i] == port) 89143608edcSAllan Stephens return; 89243608edcSAllan Stephens if (i < PLSIZE) { 89343608edcSAllan Stephens item->ports[i] = port; 89443608edcSAllan Stephens pl_ptr->count++; 89543608edcSAllan Stephens return; 89643608edcSAllan Stephens } 89743608edcSAllan Stephens if (!item->next) { 89843608edcSAllan Stephens item->next = kmalloc(sizeof(*item), GFP_ATOMIC); 89943608edcSAllan Stephens if (!item->next) { 90043608edcSAllan Stephens warn("Incomplete multicast delivery, no memory\n"); 90143608edcSAllan Stephens return; 90243608edcSAllan Stephens } 90343608edcSAllan Stephens item->next->next = NULL; 90443608edcSAllan Stephens } 90543608edcSAllan Stephens } 90643608edcSAllan Stephens } 90743608edcSAllan Stephens 90843608edcSAllan Stephens /** 90943608edcSAllan Stephens * tipc_port_list_free - free dynamically created entries in port_list chain 91043608edcSAllan Stephens * 91143608edcSAllan Stephens */ 91243608edcSAllan Stephens 91343608edcSAllan Stephens void tipc_port_list_free(struct port_list *pl_ptr) 91443608edcSAllan Stephens { 91543608edcSAllan Stephens struct port_list *item; 91643608edcSAllan Stephens struct port_list *next; 91743608edcSAllan Stephens 91843608edcSAllan Stephens for (item = pl_ptr->next; item; item = next) { 91943608edcSAllan Stephens next = item->next; 92043608edcSAllan Stephens kfree(item); 92143608edcSAllan Stephens } 92243608edcSAllan Stephens } 92343608edcSAllan Stephens 924