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. 62d627b92SAllan Stephens * Copyright (c) 2005, 2010-2011, 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 47b97bf3fdSPer Liden /** 48b97bf3fdSPer Liden * struct bcbearer_pair - a pair of bearers used by broadcast link 49b97bf3fdSPer Liden * @primary: pointer to primary bearer 50b97bf3fdSPer Liden * @secondary: pointer to secondary bearer 51b97bf3fdSPer Liden * 52b97bf3fdSPer Liden * Bearers must have same priority and same set of reachable destinations 53b97bf3fdSPer Liden * to be paired. 54b97bf3fdSPer Liden */ 55b97bf3fdSPer Liden 56b97bf3fdSPer Liden struct bcbearer_pair { 572d627b92SAllan Stephens struct tipc_bearer *primary; 582d627b92SAllan Stephens struct tipc_bearer *secondary; 59b97bf3fdSPer Liden }; 60b97bf3fdSPer Liden 61b97bf3fdSPer Liden /** 62b97bf3fdSPer Liden * struct bcbearer - bearer used by broadcast link 63b97bf3fdSPer Liden * @bearer: (non-standard) broadcast bearer structure 64b97bf3fdSPer Liden * @media: (non-standard) broadcast media structure 65b97bf3fdSPer Liden * @bpairs: array of bearer pairs 6665f51ef0SAllan Stephens * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort() 6765f51ef0SAllan Stephens * @remains: temporary node map used by tipc_bcbearer_send() 6865f51ef0SAllan Stephens * @remains_new: temporary node map used tipc_bcbearer_send() 6965f51ef0SAllan Stephens * 7065f51ef0SAllan Stephens * Note: The fields labelled "temporary" are incorporated into the bearer 7165f51ef0SAllan Stephens * to avoid consuming potentially limited stack space through the use of 7265f51ef0SAllan Stephens * large local variables within multicast routines. Concurrent access is 7365f51ef0SAllan Stephens * prevented through use of the spinlock "bc_lock". 74b97bf3fdSPer Liden */ 75b97bf3fdSPer Liden 76b97bf3fdSPer Liden struct bcbearer { 772d627b92SAllan Stephens struct tipc_bearer bearer; 78b97bf3fdSPer Liden struct media media; 79b97bf3fdSPer Liden struct bcbearer_pair bpairs[MAX_BEARERS]; 8016cb4b33SPer Liden struct bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1]; 816c00055aSDavid S. Miller struct tipc_node_map remains; 826c00055aSDavid S. Miller struct tipc_node_map remains_new; 83b97bf3fdSPer Liden }; 84b97bf3fdSPer Liden 85b97bf3fdSPer Liden /** 86b97bf3fdSPer Liden * struct bclink - link used for broadcast messages 87b97bf3fdSPer Liden * @link: (non-standard) broadcast link structure 88b97bf3fdSPer Liden * @node: (non-standard) node structure representing b'cast link's peer node 8901d83eddSAllan Stephens * @retransmit_to: node that most recently requested a retransmit 90b97bf3fdSPer Liden * 91b97bf3fdSPer Liden * Handles sequence numbering, fragmentation, bundling, etc. 92b97bf3fdSPer Liden */ 93b97bf3fdSPer Liden 94b97bf3fdSPer Liden struct bclink { 95b97bf3fdSPer Liden struct link link; 966c00055aSDavid S. Miller struct tipc_node node; 9701d83eddSAllan Stephens struct tipc_node *retransmit_to; 98b97bf3fdSPer Liden }; 99b97bf3fdSPer Liden 100b97bf3fdSPer Liden 101e3ec9c7dSAllan Stephens static struct bcbearer *bcbearer; 102e3ec9c7dSAllan Stephens static struct bclink *bclink; 103e3ec9c7dSAllan Stephens static struct link *bcl; 10434af946aSIngo Molnar static DEFINE_SPINLOCK(bc_lock); 105b97bf3fdSPer Liden 1068f92df6aSAllan Stephens /* broadcast-capable node map */ 1078f92df6aSAllan Stephens struct tipc_node_map tipc_bcast_nmap; 1088f92df6aSAllan Stephens 1093aec9cc9SAllan Stephens const char tipc_bclink_name[] = "broadcast-link"; 110b97bf3fdSPer Liden 11131e3c3f6Sstephen hemminger static void tipc_nmap_diff(struct tipc_node_map *nm_a, 11231e3c3f6Sstephen hemminger struct tipc_node_map *nm_b, 11331e3c3f6Sstephen hemminger struct tipc_node_map *nm_diff); 114b97bf3fdSPer Liden 11505790c64SSam Ravnborg static u32 buf_seqno(struct sk_buff *buf) 116b97bf3fdSPer Liden { 117b97bf3fdSPer Liden return msg_seqno(buf_msg(buf)); 118b97bf3fdSPer Liden } 119b97bf3fdSPer Liden 12005790c64SSam Ravnborg static u32 bcbuf_acks(struct sk_buff *buf) 121b97bf3fdSPer Liden { 122880b005fSDavid S. Miller return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle; 123b97bf3fdSPer Liden } 124b97bf3fdSPer Liden 12505790c64SSam Ravnborg static void bcbuf_set_acks(struct sk_buff *buf, u32 acks) 126b97bf3fdSPer Liden { 127880b005fSDavid S. Miller TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks; 128b97bf3fdSPer Liden } 129b97bf3fdSPer Liden 13005790c64SSam Ravnborg static void bcbuf_decr_acks(struct sk_buff *buf) 131b97bf3fdSPer Liden { 132b97bf3fdSPer Liden bcbuf_set_acks(buf, bcbuf_acks(buf) - 1); 133b97bf3fdSPer Liden } 134b97bf3fdSPer Liden 135b97bf3fdSPer Liden 1365b1f7bdeSAllan Stephens static void bclink_set_last_sent(void) 1375b1f7bdeSAllan Stephens { 1385b1f7bdeSAllan Stephens if (bcl->next_out) 1395b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1); 1405b1f7bdeSAllan Stephens else 1415b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1); 1425b1f7bdeSAllan Stephens } 1435b1f7bdeSAllan Stephens 1445b1f7bdeSAllan Stephens u32 tipc_bclink_get_last_sent(void) 1455b1f7bdeSAllan Stephens { 1465b1f7bdeSAllan Stephens return bcl->fsm_msg_cnt; 1475b1f7bdeSAllan Stephens } 1485b1f7bdeSAllan Stephens 149b97bf3fdSPer Liden /** 150b97bf3fdSPer Liden * bclink_set_gap - set gap according to contents of current deferred pkt queue 151b97bf3fdSPer Liden * 152b97bf3fdSPer Liden * Called with 'node' locked, bc_lock unlocked 153b97bf3fdSPer Liden */ 154b97bf3fdSPer Liden 1556c00055aSDavid S. Miller static void bclink_set_gap(struct tipc_node *n_ptr) 156b97bf3fdSPer Liden { 157b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 158b97bf3fdSPer Liden 159b97bf3fdSPer Liden n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 160b97bf3fdSPer Liden mod(n_ptr->bclink.last_in); 161b97bf3fdSPer Liden if (unlikely(buf != NULL)) 162b97bf3fdSPer Liden n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1); 163b97bf3fdSPer Liden } 164b97bf3fdSPer Liden 165b97bf3fdSPer Liden /** 166b97bf3fdSPer Liden * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment 167b97bf3fdSPer Liden * 168b97bf3fdSPer Liden * This mechanism endeavours to prevent all nodes in network from trying 169b97bf3fdSPer Liden * to ACK or NACK at the same time. 170b97bf3fdSPer Liden * 171b97bf3fdSPer Liden * Note: TIPC uses a different trigger to distribute ACKs than it does to 172b97bf3fdSPer Liden * distribute NACKs, but tries to use the same spacing (divide by 16). 173b97bf3fdSPer Liden */ 174b97bf3fdSPer Liden 17505790c64SSam Ravnborg static int bclink_ack_allowed(u32 n) 176b97bf3fdSPer Liden { 177a02cec21SEric Dumazet return (n % TIPC_MIN_LINK_WIN) == tipc_own_tag; 178b97bf3fdSPer Liden } 179b97bf3fdSPer Liden 180b97bf3fdSPer Liden 181b97bf3fdSPer Liden /** 18201d83eddSAllan Stephens * tipc_bclink_retransmit_to - get most recent node to request retransmission 18301d83eddSAllan Stephens * 18401d83eddSAllan Stephens * Called with bc_lock locked 18501d83eddSAllan Stephens */ 18601d83eddSAllan Stephens 18701d83eddSAllan Stephens struct tipc_node *tipc_bclink_retransmit_to(void) 18801d83eddSAllan Stephens { 18901d83eddSAllan Stephens return bclink->retransmit_to; 19001d83eddSAllan Stephens } 19101d83eddSAllan Stephens 19201d83eddSAllan Stephens /** 193b97bf3fdSPer Liden * bclink_retransmit_pkt - retransmit broadcast packets 194b97bf3fdSPer Liden * @after: sequence number of last packet to *not* retransmit 195b97bf3fdSPer Liden * @to: sequence number of last packet to retransmit 196b97bf3fdSPer Liden * 197d356eebaSAllan Stephens * Called with bc_lock locked 198b97bf3fdSPer Liden */ 199b97bf3fdSPer Liden 200b97bf3fdSPer Liden static void bclink_retransmit_pkt(u32 after, u32 to) 201b97bf3fdSPer Liden { 202b97bf3fdSPer Liden struct sk_buff *buf; 203b97bf3fdSPer Liden 204b97bf3fdSPer Liden buf = bcl->first_out; 205a016892cSAllan Stephens while (buf && less_eq(buf_seqno(buf), after)) 206b97bf3fdSPer Liden buf = buf->next; 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; 232a016892cSAllan Stephens while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) 233b97bf3fdSPer Liden crs = crs->next; 234b97bf3fdSPer Liden 235b97bf3fdSPer Liden /* Update packets that node is now acknowledging */ 236b97bf3fdSPer Liden 237b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), acked)) { 238b97bf3fdSPer Liden next = crs->next; 239b97bf3fdSPer Liden bcbuf_decr_acks(crs); 240b97bf3fdSPer Liden if (bcbuf_acks(crs) == 0) { 241b97bf3fdSPer Liden bcl->first_out = next; 242b97bf3fdSPer Liden bcl->out_queue_size--; 243b97bf3fdSPer Liden buf_discard(crs); 244b97bf3fdSPer Liden released = 1; 245b97bf3fdSPer Liden } 246b97bf3fdSPer Liden crs = next; 247b97bf3fdSPer Liden } 248b97bf3fdSPer Liden n_ptr->bclink.acked = acked; 249b97bf3fdSPer Liden 250b97bf3fdSPer Liden /* Try resolving broadcast link congestion, if necessary */ 251b97bf3fdSPer Liden 2525b1f7bdeSAllan Stephens if (unlikely(bcl->next_out)) { 2534323add6SPer Liden tipc_link_push_queue(bcl); 2545b1f7bdeSAllan Stephens bclink_set_last_sent(); 2555b1f7bdeSAllan Stephens } 256b97bf3fdSPer Liden if (unlikely(released && !list_empty(&bcl->waiting_ports))) 2574323add6SPer Liden tipc_link_wakeup_ports(bcl, 0); 258b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 259b97bf3fdSPer Liden } 260b97bf3fdSPer Liden 261b97bf3fdSPer Liden /** 262b97bf3fdSPer Liden * bclink_send_ack - unicast an ACK msg 263b97bf3fdSPer Liden * 2644323add6SPer Liden * tipc_net_lock and node lock set 265b97bf3fdSPer Liden */ 266b97bf3fdSPer Liden 2676c00055aSDavid S. Miller static void bclink_send_ack(struct tipc_node *n_ptr) 268b97bf3fdSPer Liden { 269b97bf3fdSPer Liden struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1]; 270b97bf3fdSPer Liden 271b97bf3fdSPer Liden if (l_ptr != NULL) 2724323add6SPer Liden tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0); 273b97bf3fdSPer Liden } 274b97bf3fdSPer Liden 275b97bf3fdSPer Liden /** 276b97bf3fdSPer Liden * bclink_send_nack- broadcast a NACK msg 277b97bf3fdSPer Liden * 2784323add6SPer Liden * tipc_net_lock and node lock set 279b97bf3fdSPer Liden */ 280b97bf3fdSPer Liden 2816c00055aSDavid S. Miller static void bclink_send_nack(struct tipc_node *n_ptr) 282b97bf3fdSPer Liden { 283b97bf3fdSPer Liden struct sk_buff *buf; 284b97bf3fdSPer Liden struct tipc_msg *msg; 285b97bf3fdSPer Liden 286b97bf3fdSPer Liden if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to)) 287b97bf3fdSPer Liden return; 288b97bf3fdSPer Liden 28931e3c3f6Sstephen hemminger buf = tipc_buf_acquire(INT_H_SIZE); 290b97bf3fdSPer Liden if (buf) { 291b97bf3fdSPer Liden msg = buf_msg(buf); 292c68ca7b7SAllan Stephens tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG, 29375715217SAllan Stephens INT_H_SIZE, n_ptr->addr); 294bf781ecfSAllan Stephens msg_set_non_seq(msg, 1); 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); 410bebc55aeSAllan Stephens if (likely(res > 0)) 4115b1f7bdeSAllan Stephens bclink_set_last_sent(); 412b97bf3fdSPer Liden 413b97bf3fdSPer Liden bcl->stats.queue_sz_counts++; 414b97bf3fdSPer Liden bcl->stats.accu_queue_sz += bcl->out_queue_size; 415b97bf3fdSPer Liden 416b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 417b97bf3fdSPer Liden return res; 418b97bf3fdSPer Liden } 419b97bf3fdSPer Liden 420b97bf3fdSPer Liden /** 4214323add6SPer Liden * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards 422b97bf3fdSPer Liden * 4234323add6SPer Liden * tipc_net_lock is read_locked, no other locks set 424b97bf3fdSPer Liden */ 425b97bf3fdSPer Liden 4264323add6SPer Liden void tipc_bclink_recv_pkt(struct sk_buff *buf) 427b97bf3fdSPer Liden { 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++; 44701d83eddSAllan Stephens bclink->retransmit_to = node; 448b97bf3fdSPer Liden bclink_retransmit_pkt(msg_bcgap_after(msg), 449b97bf3fdSPer Liden msg_bcgap_to(msg)); 450d356eebaSAllan Stephens spin_unlock_bh(&bc_lock); 451b97bf3fdSPer Liden } else { 4524323add6SPer Liden tipc_bclink_peek_nack(msg_destnode(msg), 453b97bf3fdSPer Liden msg_bcast_tag(msg), 454b97bf3fdSPer Liden msg_bcgap_after(msg), 455b97bf3fdSPer Liden msg_bcgap_to(msg)); 456b97bf3fdSPer Liden } 457b97bf3fdSPer Liden buf_discard(buf); 458b97bf3fdSPer Liden return; 459b97bf3fdSPer Liden } 460b97bf3fdSPer Liden 4614323add6SPer Liden tipc_node_lock(node); 462b97bf3fdSPer Liden receive: 463b97bf3fdSPer Liden deferred = node->bclink.deferred_head; 464b97bf3fdSPer Liden next_in = mod(node->bclink.last_in + 1); 465b97bf3fdSPer Liden seqno = msg_seqno(msg); 466b97bf3fdSPer Liden 467b97bf3fdSPer Liden if (likely(seqno == next_in)) { 468b97bf3fdSPer Liden bcl->stats.recv_info++; 469b97bf3fdSPer Liden node->bclink.last_in++; 470b97bf3fdSPer Liden bclink_set_gap(node); 471b97bf3fdSPer Liden if (unlikely(bclink_ack_allowed(seqno))) { 472b97bf3fdSPer Liden bclink_send_ack(node); 473b97bf3fdSPer Liden bcl->stats.sent_acks++; 474b97bf3fdSPer Liden } 475b97bf3fdSPer Liden if (likely(msg_isdata(msg))) { 4764323add6SPer Liden tipc_node_unlock(node); 4774323add6SPer Liden tipc_port_recv_mcast(buf, NULL); 478b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_BUNDLER) { 479b97bf3fdSPer Liden bcl->stats.recv_bundles++; 480b97bf3fdSPer Liden bcl->stats.recv_bundled += msg_msgcnt(msg); 4814323add6SPer Liden tipc_node_unlock(node); 4824323add6SPer Liden tipc_link_recv_bundle(buf); 483b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_FRAGMENTER) { 484b97bf3fdSPer Liden bcl->stats.recv_fragments++; 4854323add6SPer Liden if (tipc_link_recv_fragment(&node->bclink.defragm, 486b97bf3fdSPer Liden &buf, &msg)) 487b97bf3fdSPer Liden bcl->stats.recv_fragmented++; 4884323add6SPer Liden tipc_node_unlock(node); 4894323add6SPer Liden tipc_net_route_msg(buf); 490b97bf3fdSPer Liden } else { 4914323add6SPer Liden tipc_node_unlock(node); 4924323add6SPer Liden tipc_net_route_msg(buf); 493b97bf3fdSPer Liden } 494b97bf3fdSPer Liden if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) { 4954323add6SPer Liden tipc_node_lock(node); 496b97bf3fdSPer Liden buf = deferred; 497b97bf3fdSPer Liden msg = buf_msg(buf); 498b97bf3fdSPer Liden node->bclink.deferred_head = deferred->next; 499b97bf3fdSPer Liden goto receive; 500b97bf3fdSPer Liden } 501b97bf3fdSPer Liden return; 502b97bf3fdSPer Liden } else if (less(next_in, seqno)) { 503b97bf3fdSPer Liden u32 gap_after = node->bclink.gap_after; 504b97bf3fdSPer Liden u32 gap_to = node->bclink.gap_to; 505b97bf3fdSPer Liden 5064323add6SPer Liden if (tipc_link_defer_pkt(&node->bclink.deferred_head, 507b97bf3fdSPer Liden &node->bclink.deferred_tail, 508b97bf3fdSPer Liden buf)) { 509b97bf3fdSPer Liden node->bclink.nack_sync++; 510b97bf3fdSPer Liden bcl->stats.deferred_recv++; 511b97bf3fdSPer Liden if (seqno == mod(gap_after + 1)) 512b97bf3fdSPer Liden node->bclink.gap_after = seqno; 513b97bf3fdSPer Liden else if (less(gap_after, seqno) && less(seqno, gap_to)) 514b97bf3fdSPer Liden node->bclink.gap_to = seqno; 515b97bf3fdSPer Liden } 516b97bf3fdSPer Liden if (bclink_ack_allowed(node->bclink.nack_sync)) { 517b97bf3fdSPer Liden if (gap_to != gap_after) 518b97bf3fdSPer Liden bclink_send_nack(node); 519b97bf3fdSPer Liden bclink_set_gap(node); 520b97bf3fdSPer Liden } 521b97bf3fdSPer Liden } else { 522b97bf3fdSPer Liden bcl->stats.duplicates++; 523b97bf3fdSPer Liden buf_discard(buf); 524b97bf3fdSPer Liden } 5254323add6SPer Liden tipc_node_unlock(node); 526b97bf3fdSPer Liden } 527b97bf3fdSPer Liden 5286c00055aSDavid S. Miller u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) 529b97bf3fdSPer Liden { 530b97bf3fdSPer Liden return (n_ptr->bclink.supported && 5314323add6SPer Liden (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); 532b97bf3fdSPer Liden } 533b97bf3fdSPer Liden 534b97bf3fdSPer Liden 535b97bf3fdSPer Liden /** 5364323add6SPer Liden * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer 537b97bf3fdSPer Liden * 538b97bf3fdSPer Liden * Send through as many bearers as necessary to reach all nodes 539b97bf3fdSPer Liden * that support TIPC multicasting. 540b97bf3fdSPer Liden * 541b97bf3fdSPer Liden * Returns 0 if packet sent successfully, non-zero if not 542b97bf3fdSPer Liden */ 543b97bf3fdSPer Liden 544988f088aSAdrian Bunk static int tipc_bcbearer_send(struct sk_buff *buf, 545b97bf3fdSPer Liden struct tipc_bearer *unused1, 546b97bf3fdSPer Liden struct tipc_media_addr *unused2) 547b97bf3fdSPer Liden { 548b97bf3fdSPer Liden int bp_index; 549b97bf3fdSPer Liden 550b97bf3fdSPer Liden /* Prepare buffer for broadcasting (if first time trying to send it) */ 551b97bf3fdSPer Liden 552b97bf3fdSPer Liden if (likely(!msg_non_seq(buf_msg(buf)))) { 553b97bf3fdSPer Liden struct tipc_msg *msg; 554b97bf3fdSPer Liden 5558f92df6aSAllan Stephens assert(tipc_bcast_nmap.count != 0); 5568f92df6aSAllan Stephens bcbuf_set_acks(buf, tipc_bcast_nmap.count); 557b97bf3fdSPer Liden msg = buf_msg(buf); 55840aecb1bSAllan Stephens msg_set_non_seq(msg, 1); 559b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 5600048b826SAllan Stephens bcl->stats.sent_info++; 561b97bf3fdSPer Liden } 562b97bf3fdSPer Liden 563b97bf3fdSPer Liden /* Send buffer over bearers until all targets reached */ 564b97bf3fdSPer Liden 5658f92df6aSAllan Stephens bcbearer->remains = tipc_bcast_nmap; 566b97bf3fdSPer Liden 567b97bf3fdSPer Liden for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { 5682d627b92SAllan Stephens struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary; 5692d627b92SAllan Stephens struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary; 570b97bf3fdSPer Liden 571b97bf3fdSPer Liden if (!p) 572b97bf3fdSPer Liden break; /* no more bearers to try */ 573b97bf3fdSPer Liden 57465f51ef0SAllan Stephens tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new); 57565f51ef0SAllan Stephens if (bcbearer->remains_new.count == bcbearer->remains.count) 576b97bf3fdSPer Liden continue; /* bearer pair doesn't add anything */ 577b97bf3fdSPer Liden 5782d627b92SAllan Stephens if (p->blocked || 5792d627b92SAllan Stephens p->media->send_msg(buf, p, &p->media->bcast_addr)) { 5801a624832SNeil Horman /* unable to send on primary bearer */ 5812d627b92SAllan Stephens if (!s || s->blocked || 5822d627b92SAllan Stephens s->media->send_msg(buf, s, 5831a624832SNeil Horman &s->media->bcast_addr)) { 5841a624832SNeil Horman /* unable to send on either bearer */ 5851a624832SNeil Horman continue; 5861a624832SNeil Horman } 587b97bf3fdSPer Liden } 588b97bf3fdSPer Liden 5891a624832SNeil Horman if (s) { 590b97bf3fdSPer Liden bcbearer->bpairs[bp_index].primary = s; 591b97bf3fdSPer Liden bcbearer->bpairs[bp_index].secondary = p; 5921a624832SNeil Horman } 5931a624832SNeil Horman 59465f51ef0SAllan Stephens if (bcbearer->remains_new.count == 0) 5950e35fd5eSAllan Stephens return 0; 596b97bf3fdSPer Liden 59765f51ef0SAllan Stephens bcbearer->remains = bcbearer->remains_new; 598b97bf3fdSPer Liden } 599b97bf3fdSPer Liden 6007e3e5d09SAllan Stephens /* 6017e3e5d09SAllan Stephens * Unable to reach all targets (indicate success, since currently 6027e3e5d09SAllan Stephens * there isn't code in place to properly block & unblock the 6037e3e5d09SAllan Stephens * pseudo-bearer used by the broadcast link) 6047e3e5d09SAllan Stephens */ 605b97bf3fdSPer Liden 6067e3e5d09SAllan Stephens return TIPC_OK; 607b97bf3fdSPer Liden } 608b97bf3fdSPer Liden 609b97bf3fdSPer Liden /** 6104323add6SPer Liden * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer 611b97bf3fdSPer Liden */ 612b97bf3fdSPer Liden 6134323add6SPer Liden void tipc_bcbearer_sort(void) 614b97bf3fdSPer Liden { 615b97bf3fdSPer Liden struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp; 616b97bf3fdSPer Liden struct bcbearer_pair *bp_curr; 617b97bf3fdSPer Liden int b_index; 618b97bf3fdSPer Liden int pri; 619b97bf3fdSPer Liden 620b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 621b97bf3fdSPer Liden 622b97bf3fdSPer Liden /* Group bearers by priority (can assume max of two per priority) */ 623b97bf3fdSPer Liden 624b97bf3fdSPer Liden memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); 625b97bf3fdSPer Liden 626b97bf3fdSPer Liden for (b_index = 0; b_index < MAX_BEARERS; b_index++) { 6272d627b92SAllan Stephens struct tipc_bearer *b = &tipc_bearers[b_index]; 628b97bf3fdSPer Liden 629b97bf3fdSPer Liden if (!b->active || !b->nodes.count) 630b97bf3fdSPer Liden continue; 631b97bf3fdSPer Liden 632b97bf3fdSPer Liden if (!bp_temp[b->priority].primary) 633b97bf3fdSPer Liden bp_temp[b->priority].primary = b; 634b97bf3fdSPer Liden else 635b97bf3fdSPer Liden bp_temp[b->priority].secondary = b; 636b97bf3fdSPer Liden } 637b97bf3fdSPer Liden 638b97bf3fdSPer Liden /* Create array of bearer pairs for broadcasting */ 639b97bf3fdSPer Liden 640b97bf3fdSPer Liden bp_curr = bcbearer->bpairs; 641b97bf3fdSPer Liden memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); 642b97bf3fdSPer Liden 64316cb4b33SPer Liden for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { 644b97bf3fdSPer Liden 645b97bf3fdSPer Liden if (!bp_temp[pri].primary) 646b97bf3fdSPer Liden continue; 647b97bf3fdSPer Liden 648b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].primary; 649b97bf3fdSPer Liden 650b97bf3fdSPer Liden if (bp_temp[pri].secondary) { 6514323add6SPer Liden if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, 652b97bf3fdSPer Liden &bp_temp[pri].secondary->nodes)) { 653b97bf3fdSPer Liden bp_curr->secondary = bp_temp[pri].secondary; 654b97bf3fdSPer Liden } else { 655b97bf3fdSPer Liden bp_curr++; 656b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].secondary; 657b97bf3fdSPer Liden } 658b97bf3fdSPer Liden } 659b97bf3fdSPer Liden 660b97bf3fdSPer Liden bp_curr++; 661b97bf3fdSPer Liden } 662b97bf3fdSPer Liden 663b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 664b97bf3fdSPer Liden } 665b97bf3fdSPer Liden 666b97bf3fdSPer Liden /** 6674323add6SPer Liden * tipc_bcbearer_push - resolve bearer congestion 668b97bf3fdSPer Liden * 669b97bf3fdSPer Liden * Forces bclink to push out any unsent packets, until all packets are gone 670b97bf3fdSPer Liden * or congestion reoccurs. 671b97bf3fdSPer Liden * No locks set when function called 672b97bf3fdSPer Liden */ 673b97bf3fdSPer Liden 6744323add6SPer Liden void tipc_bcbearer_push(void) 675b97bf3fdSPer Liden { 6762d627b92SAllan Stephens struct tipc_bearer *b_ptr; 677b97bf3fdSPer Liden 678b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 679b97bf3fdSPer Liden b_ptr = &bcbearer->bearer; 6802d627b92SAllan Stephens if (b_ptr->blocked) { 6812d627b92SAllan Stephens b_ptr->blocked = 0; 6824323add6SPer Liden tipc_bearer_lock_push(b_ptr); 683b97bf3fdSPer Liden } 684b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 685b97bf3fdSPer Liden } 686b97bf3fdSPer Liden 687b97bf3fdSPer Liden 6884323add6SPer Liden int tipc_bclink_stats(char *buf, const u32 buf_size) 689b97bf3fdSPer Liden { 690b97bf3fdSPer Liden struct print_buf pb; 691b97bf3fdSPer Liden 692b97bf3fdSPer Liden if (!bcl) 693b97bf3fdSPer Liden return 0; 694b97bf3fdSPer Liden 6954323add6SPer Liden tipc_printbuf_init(&pb, buf, buf_size); 696b97bf3fdSPer Liden 697b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 698b97bf3fdSPer Liden 699b97bf3fdSPer Liden tipc_printf(&pb, "Link <%s>\n" 700b97bf3fdSPer Liden " Window:%u packets\n", 701b97bf3fdSPer Liden bcl->name, bcl->queue_limit[0]); 702b97bf3fdSPer Liden tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n", 703b97bf3fdSPer Liden bcl->stats.recv_info, 704b97bf3fdSPer Liden bcl->stats.recv_fragments, 705b97bf3fdSPer Liden bcl->stats.recv_fragmented, 706b97bf3fdSPer Liden bcl->stats.recv_bundles, 707b97bf3fdSPer Liden bcl->stats.recv_bundled); 708b97bf3fdSPer Liden tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n", 709b97bf3fdSPer Liden bcl->stats.sent_info, 710b97bf3fdSPer Liden bcl->stats.sent_fragments, 711b97bf3fdSPer Liden bcl->stats.sent_fragmented, 712b97bf3fdSPer Liden bcl->stats.sent_bundles, 713b97bf3fdSPer Liden bcl->stats.sent_bundled); 714b97bf3fdSPer Liden tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n", 715b97bf3fdSPer Liden bcl->stats.recv_nacks, 716b97bf3fdSPer Liden bcl->stats.deferred_recv, 717b97bf3fdSPer Liden bcl->stats.duplicates); 718b97bf3fdSPer Liden tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n", 719b97bf3fdSPer Liden bcl->stats.sent_nacks, 720b97bf3fdSPer Liden bcl->stats.sent_acks, 721b97bf3fdSPer Liden bcl->stats.retransmitted); 722b97bf3fdSPer Liden tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n", 723b97bf3fdSPer Liden bcl->stats.bearer_congs, 724b97bf3fdSPer Liden bcl->stats.link_congs, 725b97bf3fdSPer Liden bcl->stats.max_queue_sz, 726b97bf3fdSPer Liden bcl->stats.queue_sz_counts 727b97bf3fdSPer Liden ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts) 728b97bf3fdSPer Liden : 0); 729b97bf3fdSPer Liden 730b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7314323add6SPer Liden return tipc_printbuf_validate(&pb); 732b97bf3fdSPer Liden } 733b97bf3fdSPer Liden 7344323add6SPer Liden int tipc_bclink_reset_stats(void) 735b97bf3fdSPer Liden { 736b97bf3fdSPer Liden if (!bcl) 737b97bf3fdSPer Liden return -ENOPROTOOPT; 738b97bf3fdSPer Liden 739b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 740b97bf3fdSPer Liden memset(&bcl->stats, 0, sizeof(bcl->stats)); 741b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7420e35fd5eSAllan Stephens return 0; 743b97bf3fdSPer Liden } 744b97bf3fdSPer Liden 7454323add6SPer Liden int tipc_bclink_set_queue_limits(u32 limit) 746b97bf3fdSPer Liden { 747b97bf3fdSPer Liden if (!bcl) 748b97bf3fdSPer Liden return -ENOPROTOOPT; 749b97bf3fdSPer Liden if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) 750b97bf3fdSPer Liden return -EINVAL; 751b97bf3fdSPer Liden 752b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 7534323add6SPer Liden tipc_link_set_queue_limits(bcl, limit); 754b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7550e35fd5eSAllan Stephens return 0; 756b97bf3fdSPer Liden } 757b97bf3fdSPer Liden 7584323add6SPer Liden int tipc_bclink_init(void) 759b97bf3fdSPer Liden { 7602710b57fSArnaldo Carvalho de Melo bcbearer = kzalloc(sizeof(*bcbearer), GFP_ATOMIC); 7612710b57fSArnaldo Carvalho de Melo bclink = kzalloc(sizeof(*bclink), GFP_ATOMIC); 762b97bf3fdSPer Liden if (!bcbearer || !bclink) { 763a10bd924SAllan Stephens warn("Multicast link creation failed, no memory\n"); 764b97bf3fdSPer Liden kfree(bcbearer); 765b97bf3fdSPer Liden bcbearer = NULL; 766b97bf3fdSPer Liden kfree(bclink); 767b97bf3fdSPer Liden bclink = NULL; 768b97bf3fdSPer Liden return -ENOMEM; 769b97bf3fdSPer Liden } 770b97bf3fdSPer Liden 771b97bf3fdSPer Liden INIT_LIST_HEAD(&bcbearer->bearer.cong_links); 772b97bf3fdSPer Liden bcbearer->bearer.media = &bcbearer->media; 7734323add6SPer Liden bcbearer->media.send_msg = tipc_bcbearer_send; 774b97bf3fdSPer Liden sprintf(bcbearer->media.name, "tipc-multicast"); 775b97bf3fdSPer Liden 776b97bf3fdSPer Liden bcl = &bclink->link; 777b97bf3fdSPer Liden INIT_LIST_HEAD(&bcl->waiting_ports); 778b97bf3fdSPer Liden bcl->next_out_no = 1; 77934af946aSIngo Molnar spin_lock_init(&bclink->node.lock); 780b97bf3fdSPer Liden bcl->owner = &bclink->node; 781b97bf3fdSPer Liden bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; 7824323add6SPer Liden tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); 783b97bf3fdSPer Liden bcl->b_ptr = &bcbearer->bearer; 784b97bf3fdSPer Liden bcl->state = WORKING_WORKING; 7854b704d59SStephen Hemminger strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME); 786b97bf3fdSPer Liden 7870e35fd5eSAllan Stephens return 0; 788b97bf3fdSPer Liden } 789b97bf3fdSPer Liden 7904323add6SPer Liden void tipc_bclink_stop(void) 791b97bf3fdSPer Liden { 792b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 793b97bf3fdSPer Liden if (bcbearer) { 7944323add6SPer Liden tipc_link_stop(bcl); 795b97bf3fdSPer Liden bcl = NULL; 796b97bf3fdSPer Liden kfree(bclink); 797b97bf3fdSPer Liden bclink = NULL; 798b97bf3fdSPer Liden kfree(bcbearer); 799b97bf3fdSPer Liden bcbearer = NULL; 800b97bf3fdSPer Liden } 801b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 802b97bf3fdSPer Liden } 803b97bf3fdSPer Liden 8043e22e62bSAllan Stephens 8053e22e62bSAllan Stephens /** 8063e22e62bSAllan Stephens * tipc_nmap_add - add a node to a node map 8073e22e62bSAllan Stephens */ 8083e22e62bSAllan Stephens 8093e22e62bSAllan Stephens void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node) 8103e22e62bSAllan Stephens { 8113e22e62bSAllan Stephens int n = tipc_node(node); 8123e22e62bSAllan Stephens int w = n / WSIZE; 8133e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8143e22e62bSAllan Stephens 8153e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) == 0) { 8163e22e62bSAllan Stephens nm_ptr->count++; 8173e22e62bSAllan Stephens nm_ptr->map[w] |= mask; 8183e22e62bSAllan Stephens } 8193e22e62bSAllan Stephens } 8203e22e62bSAllan Stephens 8213e22e62bSAllan Stephens /** 8223e22e62bSAllan Stephens * tipc_nmap_remove - remove a node from a node map 8233e22e62bSAllan Stephens */ 8243e22e62bSAllan Stephens 8253e22e62bSAllan Stephens void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node) 8263e22e62bSAllan Stephens { 8273e22e62bSAllan Stephens int n = tipc_node(node); 8283e22e62bSAllan Stephens int w = n / WSIZE; 8293e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8303e22e62bSAllan Stephens 8313e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) != 0) { 8323e22e62bSAllan Stephens nm_ptr->map[w] &= ~mask; 8333e22e62bSAllan Stephens nm_ptr->count--; 8343e22e62bSAllan Stephens } 8353e22e62bSAllan Stephens } 8363e22e62bSAllan Stephens 8373e22e62bSAllan Stephens /** 8383e22e62bSAllan Stephens * tipc_nmap_diff - find differences between node maps 8393e22e62bSAllan Stephens * @nm_a: input node map A 8403e22e62bSAllan Stephens * @nm_b: input node map B 8413e22e62bSAllan Stephens * @nm_diff: output node map A-B (i.e. nodes of A that are not in B) 8423e22e62bSAllan Stephens */ 8433e22e62bSAllan Stephens 84431e3c3f6Sstephen hemminger static void tipc_nmap_diff(struct tipc_node_map *nm_a, 84531e3c3f6Sstephen hemminger struct tipc_node_map *nm_b, 8463e22e62bSAllan Stephens struct tipc_node_map *nm_diff) 8473e22e62bSAllan Stephens { 8483e22e62bSAllan Stephens int stop = ARRAY_SIZE(nm_a->map); 8493e22e62bSAllan Stephens int w; 8503e22e62bSAllan Stephens int b; 8513e22e62bSAllan Stephens u32 map; 8523e22e62bSAllan Stephens 8533e22e62bSAllan Stephens memset(nm_diff, 0, sizeof(*nm_diff)); 8543e22e62bSAllan Stephens for (w = 0; w < stop; w++) { 8553e22e62bSAllan Stephens map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]); 8563e22e62bSAllan Stephens nm_diff->map[w] = map; 8573e22e62bSAllan Stephens if (map != 0) { 8583e22e62bSAllan Stephens for (b = 0 ; b < WSIZE; b++) { 8593e22e62bSAllan Stephens if (map & (1 << b)) 8603e22e62bSAllan Stephens nm_diff->count++; 8613e22e62bSAllan Stephens } 8623e22e62bSAllan Stephens } 8633e22e62bSAllan Stephens } 8643e22e62bSAllan Stephens } 86543608edcSAllan Stephens 86643608edcSAllan Stephens /** 86743608edcSAllan Stephens * tipc_port_list_add - add a port to a port list, ensuring no duplicates 86843608edcSAllan Stephens */ 86943608edcSAllan Stephens 87043608edcSAllan Stephens void tipc_port_list_add(struct port_list *pl_ptr, u32 port) 87143608edcSAllan Stephens { 87243608edcSAllan Stephens struct port_list *item = pl_ptr; 87343608edcSAllan Stephens int i; 87443608edcSAllan Stephens int item_sz = PLSIZE; 87543608edcSAllan Stephens int cnt = pl_ptr->count; 87643608edcSAllan Stephens 87743608edcSAllan Stephens for (; ; cnt -= item_sz, item = item->next) { 87843608edcSAllan Stephens if (cnt < PLSIZE) 87943608edcSAllan Stephens item_sz = cnt; 88043608edcSAllan Stephens for (i = 0; i < item_sz; i++) 88143608edcSAllan Stephens if (item->ports[i] == port) 88243608edcSAllan Stephens return; 88343608edcSAllan Stephens if (i < PLSIZE) { 88443608edcSAllan Stephens item->ports[i] = port; 88543608edcSAllan Stephens pl_ptr->count++; 88643608edcSAllan Stephens return; 88743608edcSAllan Stephens } 88843608edcSAllan Stephens if (!item->next) { 88943608edcSAllan Stephens item->next = kmalloc(sizeof(*item), GFP_ATOMIC); 89043608edcSAllan Stephens if (!item->next) { 89143608edcSAllan Stephens warn("Incomplete multicast delivery, no memory\n"); 89243608edcSAllan Stephens return; 89343608edcSAllan Stephens } 89443608edcSAllan Stephens item->next->next = NULL; 89543608edcSAllan Stephens } 89643608edcSAllan Stephens } 89743608edcSAllan Stephens } 89843608edcSAllan Stephens 89943608edcSAllan Stephens /** 90043608edcSAllan Stephens * tipc_port_list_free - free dynamically created entries in port_list chain 90143608edcSAllan Stephens * 90243608edcSAllan Stephens */ 90343608edcSAllan Stephens 90443608edcSAllan Stephens void tipc_port_list_free(struct port_list *pl_ptr) 90543608edcSAllan Stephens { 90643608edcSAllan Stephens struct port_list *item; 90743608edcSAllan Stephens struct port_list *next; 90843608edcSAllan Stephens 90943608edcSAllan Stephens for (item = pl_ptr->next; item; item = next) { 91043608edcSAllan Stephens next = item->next; 91143608edcSAllan Stephens kfree(item); 91243608edcSAllan Stephens } 91343608edcSAllan Stephens } 91443608edcSAllan Stephens 915