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" 429f6bdcd4SAllan Stephens #include "name_distr.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 /** 49b97bf3fdSPer Liden * struct bcbearer_pair - a pair of bearers used by broadcast link 50b97bf3fdSPer Liden * @primary: pointer to primary bearer 51b97bf3fdSPer Liden * @secondary: pointer to secondary bearer 52b97bf3fdSPer Liden * 53b97bf3fdSPer Liden * Bearers must have same priority and same set of reachable destinations 54b97bf3fdSPer Liden * to be paired. 55b97bf3fdSPer Liden */ 56b97bf3fdSPer Liden 57b97bf3fdSPer Liden struct bcbearer_pair { 582d627b92SAllan Stephens struct tipc_bearer *primary; 592d627b92SAllan Stephens struct tipc_bearer *secondary; 60b97bf3fdSPer Liden }; 61b97bf3fdSPer Liden 62b97bf3fdSPer Liden /** 63b97bf3fdSPer Liden * struct bcbearer - bearer used by broadcast link 64b97bf3fdSPer Liden * @bearer: (non-standard) broadcast bearer structure 65b97bf3fdSPer Liden * @media: (non-standard) broadcast media structure 66b97bf3fdSPer Liden * @bpairs: array of bearer pairs 6765f51ef0SAllan Stephens * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort() 6865f51ef0SAllan Stephens * @remains: temporary node map used by tipc_bcbearer_send() 6965f51ef0SAllan Stephens * @remains_new: temporary node map used tipc_bcbearer_send() 7065f51ef0SAllan Stephens * 7165f51ef0SAllan Stephens * Note: The fields labelled "temporary" are incorporated into the bearer 7265f51ef0SAllan Stephens * to avoid consuming potentially limited stack space through the use of 7365f51ef0SAllan Stephens * large local variables within multicast routines. Concurrent access is 7465f51ef0SAllan Stephens * prevented through use of the spinlock "bc_lock". 75b97bf3fdSPer Liden */ 76b97bf3fdSPer Liden 77b97bf3fdSPer Liden struct bcbearer { 782d627b92SAllan Stephens struct tipc_bearer bearer; 79b97bf3fdSPer Liden struct media media; 80b97bf3fdSPer Liden struct bcbearer_pair bpairs[MAX_BEARERS]; 8116cb4b33SPer Liden struct bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1]; 826c00055aSDavid S. Miller struct tipc_node_map remains; 836c00055aSDavid S. Miller struct tipc_node_map remains_new; 84b97bf3fdSPer Liden }; 85b97bf3fdSPer Liden 86b97bf3fdSPer Liden /** 87b97bf3fdSPer Liden * struct bclink - link used for broadcast messages 88b97bf3fdSPer Liden * @link: (non-standard) broadcast link structure 89b97bf3fdSPer Liden * @node: (non-standard) node structure representing b'cast link's peer node 90cd3decdfSAllan Stephens * @bcast_nodes: map of broadcast-capable nodes 9101d83eddSAllan Stephens * @retransmit_to: node that most recently requested a retransmit 92b97bf3fdSPer Liden * 93b97bf3fdSPer Liden * Handles sequence numbering, fragmentation, bundling, etc. 94b97bf3fdSPer Liden */ 95b97bf3fdSPer Liden 96b97bf3fdSPer Liden struct bclink { 97b97bf3fdSPer Liden struct link link; 986c00055aSDavid S. Miller struct tipc_node node; 99cd3decdfSAllan Stephens struct tipc_node_map bcast_nodes; 10001d83eddSAllan Stephens struct tipc_node *retransmit_to; 101b97bf3fdSPer Liden }; 102b97bf3fdSPer Liden 103c47e9b91SAllan Stephens static struct bcbearer bcast_bearer; 104c47e9b91SAllan Stephens static struct bclink bcast_link; 105b97bf3fdSPer Liden 106c47e9b91SAllan Stephens static struct bcbearer *bcbearer = &bcast_bearer; 107c47e9b91SAllan Stephens static struct bclink *bclink = &bcast_link; 108c47e9b91SAllan Stephens static struct link *bcl = &bcast_link.link; 109c47e9b91SAllan Stephens 11034af946aSIngo Molnar static DEFINE_SPINLOCK(bc_lock); 111b97bf3fdSPer Liden 1123aec9cc9SAllan Stephens const char tipc_bclink_name[] = "broadcast-link"; 113b97bf3fdSPer Liden 11431e3c3f6Sstephen hemminger static void tipc_nmap_diff(struct tipc_node_map *nm_a, 11531e3c3f6Sstephen hemminger struct tipc_node_map *nm_b, 11631e3c3f6Sstephen hemminger struct tipc_node_map *nm_diff); 117b97bf3fdSPer Liden 11805790c64SSam Ravnborg static u32 buf_seqno(struct sk_buff *buf) 119b97bf3fdSPer Liden { 120b97bf3fdSPer Liden return msg_seqno(buf_msg(buf)); 121b97bf3fdSPer Liden } 122b97bf3fdSPer Liden 12305790c64SSam Ravnborg static u32 bcbuf_acks(struct sk_buff *buf) 124b97bf3fdSPer Liden { 125880b005fSDavid S. Miller return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle; 126b97bf3fdSPer Liden } 127b97bf3fdSPer Liden 12805790c64SSam Ravnborg static void bcbuf_set_acks(struct sk_buff *buf, u32 acks) 129b97bf3fdSPer Liden { 130880b005fSDavid S. Miller TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks; 131b97bf3fdSPer Liden } 132b97bf3fdSPer Liden 13305790c64SSam Ravnborg static void bcbuf_decr_acks(struct sk_buff *buf) 134b97bf3fdSPer Liden { 135b97bf3fdSPer Liden bcbuf_set_acks(buf, bcbuf_acks(buf) - 1); 136b97bf3fdSPer Liden } 137b97bf3fdSPer Liden 138cd3decdfSAllan Stephens void tipc_bclink_add_node(u32 addr) 139cd3decdfSAllan Stephens { 140cd3decdfSAllan Stephens spin_lock_bh(&bc_lock); 141cd3decdfSAllan Stephens tipc_nmap_add(&bclink->bcast_nodes, addr); 142cd3decdfSAllan Stephens spin_unlock_bh(&bc_lock); 143cd3decdfSAllan Stephens } 144cd3decdfSAllan Stephens 145cd3decdfSAllan Stephens void tipc_bclink_remove_node(u32 addr) 146cd3decdfSAllan Stephens { 147cd3decdfSAllan Stephens spin_lock_bh(&bc_lock); 148cd3decdfSAllan Stephens tipc_nmap_remove(&bclink->bcast_nodes, addr); 149cd3decdfSAllan Stephens spin_unlock_bh(&bc_lock); 150cd3decdfSAllan Stephens } 151b97bf3fdSPer Liden 1525b1f7bdeSAllan Stephens static void bclink_set_last_sent(void) 1535b1f7bdeSAllan Stephens { 1545b1f7bdeSAllan Stephens if (bcl->next_out) 1555b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1); 1565b1f7bdeSAllan Stephens else 1575b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1); 1585b1f7bdeSAllan Stephens } 1595b1f7bdeSAllan Stephens 1605b1f7bdeSAllan Stephens u32 tipc_bclink_get_last_sent(void) 1615b1f7bdeSAllan Stephens { 1625b1f7bdeSAllan Stephens return bcl->fsm_msg_cnt; 1635b1f7bdeSAllan Stephens } 1645b1f7bdeSAllan Stephens 165b97bf3fdSPer Liden /** 166b97bf3fdSPer Liden * bclink_set_gap - set gap according to contents of current deferred pkt queue 167b97bf3fdSPer Liden * 168b97bf3fdSPer Liden * Called with 'node' locked, bc_lock unlocked 169b97bf3fdSPer Liden */ 170b97bf3fdSPer Liden 1716c00055aSDavid S. Miller static void bclink_set_gap(struct tipc_node *n_ptr) 172b97bf3fdSPer Liden { 173b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 174b97bf3fdSPer Liden 175b97bf3fdSPer Liden n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 176b97bf3fdSPer Liden mod(n_ptr->bclink.last_in); 177b97bf3fdSPer Liden if (unlikely(buf != NULL)) 178b97bf3fdSPer Liden n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1); 179b97bf3fdSPer Liden } 180b97bf3fdSPer Liden 181b97bf3fdSPer Liden /** 182b97bf3fdSPer Liden * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment 183b97bf3fdSPer Liden * 184b97bf3fdSPer Liden * This mechanism endeavours to prevent all nodes in network from trying 185b97bf3fdSPer Liden * to ACK or NACK at the same time. 186b97bf3fdSPer Liden * 187b97bf3fdSPer Liden * Note: TIPC uses a different trigger to distribute ACKs than it does to 188b97bf3fdSPer Liden * distribute NACKs, but tries to use the same spacing (divide by 16). 189b97bf3fdSPer Liden */ 190b97bf3fdSPer Liden 19105790c64SSam Ravnborg static int bclink_ack_allowed(u32 n) 192b97bf3fdSPer Liden { 193a02cec21SEric Dumazet return (n % TIPC_MIN_LINK_WIN) == tipc_own_tag; 194b97bf3fdSPer Liden } 195b97bf3fdSPer Liden 196b97bf3fdSPer Liden 197b97bf3fdSPer Liden /** 19801d83eddSAllan Stephens * tipc_bclink_retransmit_to - get most recent node to request retransmission 19901d83eddSAllan Stephens * 20001d83eddSAllan Stephens * Called with bc_lock locked 20101d83eddSAllan Stephens */ 20201d83eddSAllan Stephens 20301d83eddSAllan Stephens struct tipc_node *tipc_bclink_retransmit_to(void) 20401d83eddSAllan Stephens { 20501d83eddSAllan Stephens return bclink->retransmit_to; 20601d83eddSAllan Stephens } 20701d83eddSAllan Stephens 20801d83eddSAllan Stephens /** 209b97bf3fdSPer Liden * bclink_retransmit_pkt - retransmit broadcast packets 210b97bf3fdSPer Liden * @after: sequence number of last packet to *not* retransmit 211b97bf3fdSPer Liden * @to: sequence number of last packet to retransmit 212b97bf3fdSPer Liden * 213d356eebaSAllan Stephens * Called with bc_lock locked 214b97bf3fdSPer Liden */ 215b97bf3fdSPer Liden 216b97bf3fdSPer Liden static void bclink_retransmit_pkt(u32 after, u32 to) 217b97bf3fdSPer Liden { 218b97bf3fdSPer Liden struct sk_buff *buf; 219b97bf3fdSPer Liden 220b97bf3fdSPer Liden buf = bcl->first_out; 221a016892cSAllan Stephens while (buf && less_eq(buf_seqno(buf), after)) 222b97bf3fdSPer Liden buf = buf->next; 2234323add6SPer Liden tipc_link_retransmit(bcl, buf, mod(to - after)); 224b97bf3fdSPer Liden } 225b97bf3fdSPer Liden 226b97bf3fdSPer Liden /** 2274323add6SPer Liden * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets 228b97bf3fdSPer Liden * @n_ptr: node that sent acknowledgement info 229b97bf3fdSPer Liden * @acked: broadcast sequence # that has been acknowledged 230b97bf3fdSPer Liden * 231b97bf3fdSPer Liden * Node is locked, bc_lock unlocked. 232b97bf3fdSPer Liden */ 233b97bf3fdSPer Liden 2346c00055aSDavid S. Miller void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked) 235b97bf3fdSPer Liden { 236b97bf3fdSPer Liden struct sk_buff *crs; 237b97bf3fdSPer Liden struct sk_buff *next; 238b97bf3fdSPer Liden unsigned int released = 0; 239b97bf3fdSPer Liden 240b97bf3fdSPer Liden if (less_eq(acked, n_ptr->bclink.acked)) 241b97bf3fdSPer Liden return; 242b97bf3fdSPer Liden 243b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 244b97bf3fdSPer Liden 245b97bf3fdSPer Liden /* Skip over packets that node has previously acknowledged */ 246b97bf3fdSPer Liden 247b97bf3fdSPer Liden crs = bcl->first_out; 248a016892cSAllan Stephens while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) 249b97bf3fdSPer Liden crs = crs->next; 250b97bf3fdSPer Liden 251b97bf3fdSPer Liden /* Update packets that node is now acknowledging */ 252b97bf3fdSPer Liden 253b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), acked)) { 254b97bf3fdSPer Liden next = crs->next; 255b97bf3fdSPer Liden bcbuf_decr_acks(crs); 256b97bf3fdSPer Liden if (bcbuf_acks(crs) == 0) { 257b97bf3fdSPer Liden bcl->first_out = next; 258b97bf3fdSPer Liden bcl->out_queue_size--; 259b97bf3fdSPer Liden buf_discard(crs); 260b97bf3fdSPer Liden released = 1; 261b97bf3fdSPer Liden } 262b97bf3fdSPer Liden crs = next; 263b97bf3fdSPer Liden } 264b97bf3fdSPer Liden n_ptr->bclink.acked = acked; 265b97bf3fdSPer Liden 266b97bf3fdSPer Liden /* Try resolving broadcast link congestion, if necessary */ 267b97bf3fdSPer Liden 2685b1f7bdeSAllan Stephens if (unlikely(bcl->next_out)) { 2694323add6SPer Liden tipc_link_push_queue(bcl); 2705b1f7bdeSAllan Stephens bclink_set_last_sent(); 2715b1f7bdeSAllan Stephens } 272b97bf3fdSPer Liden if (unlikely(released && !list_empty(&bcl->waiting_ports))) 2734323add6SPer Liden tipc_link_wakeup_ports(bcl, 0); 274b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 275b97bf3fdSPer Liden } 276b97bf3fdSPer Liden 277b97bf3fdSPer Liden /** 278b97bf3fdSPer Liden * bclink_send_ack - unicast an ACK msg 279b97bf3fdSPer Liden * 2804323add6SPer Liden * tipc_net_lock and node lock set 281b97bf3fdSPer Liden */ 282b97bf3fdSPer Liden 2836c00055aSDavid S. Miller static void bclink_send_ack(struct tipc_node *n_ptr) 284b97bf3fdSPer Liden { 285b97bf3fdSPer Liden struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1]; 286b97bf3fdSPer Liden 287b97bf3fdSPer Liden if (l_ptr != NULL) 2884323add6SPer Liden tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0); 289b97bf3fdSPer Liden } 290b97bf3fdSPer Liden 291b97bf3fdSPer Liden /** 292b97bf3fdSPer Liden * bclink_send_nack- broadcast a NACK msg 293b97bf3fdSPer Liden * 2944323add6SPer Liden * tipc_net_lock and node lock set 295b97bf3fdSPer Liden */ 296b97bf3fdSPer Liden 2976c00055aSDavid S. Miller static void bclink_send_nack(struct tipc_node *n_ptr) 298b97bf3fdSPer Liden { 299b97bf3fdSPer Liden struct sk_buff *buf; 300b97bf3fdSPer Liden struct tipc_msg *msg; 301b97bf3fdSPer Liden 302b97bf3fdSPer Liden if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to)) 303b97bf3fdSPer Liden return; 304b97bf3fdSPer Liden 30531e3c3f6Sstephen hemminger buf = tipc_buf_acquire(INT_H_SIZE); 306b97bf3fdSPer Liden if (buf) { 307b97bf3fdSPer Liden msg = buf_msg(buf); 308c68ca7b7SAllan Stephens tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG, 30975715217SAllan Stephens INT_H_SIZE, n_ptr->addr); 310bf781ecfSAllan Stephens msg_set_non_seq(msg, 1); 311b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 312b97bf3fdSPer Liden msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in)); 313b97bf3fdSPer Liden msg_set_bcgap_after(msg, n_ptr->bclink.gap_after); 314b97bf3fdSPer Liden msg_set_bcgap_to(msg, n_ptr->bclink.gap_to); 315b97bf3fdSPer Liden msg_set_bcast_tag(msg, tipc_own_tag); 316b97bf3fdSPer Liden 3170f38513dSAllan Stephens tipc_bearer_send(&bcbearer->bearer, buf, NULL); 318b97bf3fdSPer Liden bcl->stats.sent_nacks++; 319b97bf3fdSPer Liden buf_discard(buf); 320b97bf3fdSPer Liden 321b97bf3fdSPer Liden /* 322b97bf3fdSPer Liden * Ensure we doesn't send another NACK msg to the node 323b97bf3fdSPer Liden * until 16 more deferred messages arrive from it 324b97bf3fdSPer Liden * (i.e. helps prevent all nodes from NACK'ing at same time) 325b97bf3fdSPer Liden */ 326b97bf3fdSPer Liden 327b97bf3fdSPer Liden n_ptr->bclink.nack_sync = tipc_own_tag; 328b97bf3fdSPer Liden } 329b97bf3fdSPer Liden } 330b97bf3fdSPer Liden 331b97bf3fdSPer Liden /** 3324323add6SPer Liden * tipc_bclink_check_gap - send a NACK if a sequence gap exists 333b97bf3fdSPer Liden * 3344323add6SPer Liden * tipc_net_lock and node lock set 335b97bf3fdSPer Liden */ 336b97bf3fdSPer Liden 3376c00055aSDavid S. Miller void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 last_sent) 338b97bf3fdSPer Liden { 339b97bf3fdSPer Liden if (!n_ptr->bclink.supported || 340b97bf3fdSPer Liden less_eq(last_sent, mod(n_ptr->bclink.last_in))) 341b97bf3fdSPer Liden return; 342b97bf3fdSPer Liden 343b97bf3fdSPer Liden bclink_set_gap(n_ptr); 344b97bf3fdSPer Liden if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to) 345b97bf3fdSPer Liden n_ptr->bclink.gap_to = last_sent; 346b97bf3fdSPer Liden bclink_send_nack(n_ptr); 347b97bf3fdSPer Liden } 348b97bf3fdSPer Liden 349b97bf3fdSPer Liden /** 3504323add6SPer Liden * tipc_bclink_peek_nack - process a NACK msg meant for another node 351b97bf3fdSPer Liden * 3524323add6SPer Liden * Only tipc_net_lock set. 353b97bf3fdSPer Liden */ 354b97bf3fdSPer Liden 355988f088aSAdrian Bunk static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to) 356b97bf3fdSPer Liden { 3576c00055aSDavid S. Miller struct tipc_node *n_ptr = tipc_node_find(dest); 358b97bf3fdSPer Liden u32 my_after, my_to; 359b97bf3fdSPer Liden 3604323add6SPer Liden if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr))) 361b97bf3fdSPer Liden return; 3624323add6SPer Liden tipc_node_lock(n_ptr); 363b97bf3fdSPer Liden /* 364b97bf3fdSPer Liden * Modify gap to suppress unnecessary NACKs from this node 365b97bf3fdSPer Liden */ 366b97bf3fdSPer Liden my_after = n_ptr->bclink.gap_after; 367b97bf3fdSPer Liden my_to = n_ptr->bclink.gap_to; 368b97bf3fdSPer Liden 369b97bf3fdSPer Liden if (less_eq(gap_after, my_after)) { 370b97bf3fdSPer Liden if (less(my_after, gap_to) && less(gap_to, my_to)) 371b97bf3fdSPer Liden n_ptr->bclink.gap_after = gap_to; 372b97bf3fdSPer Liden else if (less_eq(my_to, gap_to)) 373b97bf3fdSPer Liden n_ptr->bclink.gap_to = n_ptr->bclink.gap_after; 374b97bf3fdSPer Liden } else if (less_eq(gap_after, my_to)) { 375b97bf3fdSPer Liden if (less_eq(my_to, gap_to)) 376b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 377b97bf3fdSPer Liden } else { 378b97bf3fdSPer Liden /* 379b97bf3fdSPer Liden * Expand gap if missing bufs not in deferred queue: 380b97bf3fdSPer Liden */ 381b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 382b97bf3fdSPer Liden u32 prev = n_ptr->bclink.gap_to; 383b97bf3fdSPer Liden 384b97bf3fdSPer Liden for (; buf; buf = buf->next) { 385b97bf3fdSPer Liden u32 seqno = buf_seqno(buf); 386b97bf3fdSPer Liden 3873ac90216SEric Sesterhenn if (mod(seqno - prev) != 1) { 388b97bf3fdSPer Liden buf = NULL; 3893ac90216SEric Sesterhenn break; 3903ac90216SEric Sesterhenn } 391b97bf3fdSPer Liden if (seqno == gap_after) 392b97bf3fdSPer Liden break; 393b97bf3fdSPer Liden prev = seqno; 394b97bf3fdSPer Liden } 395b97bf3fdSPer Liden if (buf == NULL) 396b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 397b97bf3fdSPer Liden } 398b97bf3fdSPer Liden /* 399b97bf3fdSPer Liden * Some nodes may send a complementary NACK now: 400b97bf3fdSPer Liden */ 401b97bf3fdSPer Liden if (bclink_ack_allowed(sender_tag + 1)) { 402b97bf3fdSPer Liden if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) { 403b97bf3fdSPer Liden bclink_send_nack(n_ptr); 404b97bf3fdSPer Liden bclink_set_gap(n_ptr); 405b97bf3fdSPer Liden } 406b97bf3fdSPer Liden } 4074323add6SPer Liden tipc_node_unlock(n_ptr); 408b97bf3fdSPer Liden } 409b97bf3fdSPer Liden 410b97bf3fdSPer Liden /** 4114323add6SPer Liden * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster 412b97bf3fdSPer Liden */ 413b97bf3fdSPer Liden 4144323add6SPer Liden int tipc_bclink_send_msg(struct sk_buff *buf) 415b97bf3fdSPer Liden { 416b97bf3fdSPer Liden int res; 417b97bf3fdSPer Liden 418b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 419b97bf3fdSPer Liden 4202b78f9a0SAllan Stephens if (!bclink->bcast_nodes.count) { 4212b78f9a0SAllan Stephens res = msg_data_sz(buf_msg(buf)); 4222b78f9a0SAllan Stephens buf_discard(buf); 4232b78f9a0SAllan Stephens goto exit; 4242b78f9a0SAllan Stephens } 4252b78f9a0SAllan Stephens 4264323add6SPer Liden res = tipc_link_send_buf(bcl, buf); 427bebc55aeSAllan Stephens if (likely(res > 0)) 4285b1f7bdeSAllan Stephens bclink_set_last_sent(); 429b97bf3fdSPer Liden 430b97bf3fdSPer Liden bcl->stats.queue_sz_counts++; 431b97bf3fdSPer Liden bcl->stats.accu_queue_sz += bcl->out_queue_size; 4322b78f9a0SAllan Stephens exit: 433b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 434b97bf3fdSPer Liden return res; 435b97bf3fdSPer Liden } 436b97bf3fdSPer Liden 437b97bf3fdSPer Liden /** 4384323add6SPer Liden * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards 439b97bf3fdSPer Liden * 4404323add6SPer Liden * tipc_net_lock is read_locked, no other locks set 441b97bf3fdSPer Liden */ 442b97bf3fdSPer Liden 4434323add6SPer Liden void tipc_bclink_recv_pkt(struct sk_buff *buf) 444b97bf3fdSPer Liden { 445b97bf3fdSPer Liden struct tipc_msg *msg = buf_msg(buf); 4465d3c488dSAllan Stephens struct tipc_node *node; 447b97bf3fdSPer Liden u32 next_in; 448b97bf3fdSPer Liden u32 seqno; 449b97bf3fdSPer Liden struct sk_buff *deferred; 450b97bf3fdSPer Liden 4515d3c488dSAllan Stephens /* Screen out unwanted broadcast messages */ 4525d3c488dSAllan Stephens 4535d3c488dSAllan Stephens if (msg_mc_netid(msg) != tipc_net_id) 4545d3c488dSAllan Stephens goto exit; 4555d3c488dSAllan Stephens 4565d3c488dSAllan Stephens node = tipc_node_find(msg_prevnode(msg)); 4575d3c488dSAllan Stephens if (unlikely(!node)) 4585d3c488dSAllan Stephens goto exit; 4595d3c488dSAllan Stephens 4605d3c488dSAllan Stephens tipc_node_lock(node); 4615d3c488dSAllan Stephens if (unlikely(!node->bclink.supported)) 4625d3c488dSAllan Stephens goto unlock; 463b97bf3fdSPer Liden 464b97bf3fdSPer Liden if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { 4659f6bdcd4SAllan Stephens if (msg_type(msg) != STATE_MSG) 4669f6bdcd4SAllan Stephens goto unlock; 467b97bf3fdSPer Liden if (msg_destnode(msg) == tipc_own_addr) { 4684323add6SPer Liden tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); 4694323add6SPer Liden tipc_node_unlock(node); 470d356eebaSAllan Stephens spin_lock_bh(&bc_lock); 471b97bf3fdSPer Liden bcl->stats.recv_nacks++; 47201d83eddSAllan Stephens bclink->retransmit_to = node; 473b97bf3fdSPer Liden bclink_retransmit_pkt(msg_bcgap_after(msg), 474b97bf3fdSPer Liden msg_bcgap_to(msg)); 475d356eebaSAllan Stephens spin_unlock_bh(&bc_lock); 476b97bf3fdSPer Liden } else { 4775d3c488dSAllan Stephens tipc_node_unlock(node); 4784323add6SPer Liden tipc_bclink_peek_nack(msg_destnode(msg), 479b97bf3fdSPer Liden msg_bcast_tag(msg), 480b97bf3fdSPer Liden msg_bcgap_after(msg), 481b97bf3fdSPer Liden msg_bcgap_to(msg)); 482b97bf3fdSPer Liden } 4835d3c488dSAllan Stephens goto exit; 484b97bf3fdSPer Liden } 485b97bf3fdSPer Liden 4865d3c488dSAllan Stephens /* Handle in-sequence broadcast message */ 4875d3c488dSAllan Stephens 488b97bf3fdSPer Liden receive: 489b97bf3fdSPer Liden next_in = mod(node->bclink.last_in + 1); 490b97bf3fdSPer Liden seqno = msg_seqno(msg); 491b97bf3fdSPer Liden 492b97bf3fdSPer Liden if (likely(seqno == next_in)) { 493b97bf3fdSPer Liden bcl->stats.recv_info++; 494b97bf3fdSPer Liden node->bclink.last_in++; 495b97bf3fdSPer Liden bclink_set_gap(node); 496b97bf3fdSPer Liden if (unlikely(bclink_ack_allowed(seqno))) { 497b97bf3fdSPer Liden bclink_send_ack(node); 498b97bf3fdSPer Liden bcl->stats.sent_acks++; 499b97bf3fdSPer Liden } 500b97bf3fdSPer Liden if (likely(msg_isdata(msg))) { 5014323add6SPer Liden tipc_node_unlock(node); 5029f6bdcd4SAllan Stephens if (likely(msg_mcast(msg))) 5034323add6SPer Liden tipc_port_recv_mcast(buf, NULL); 5049f6bdcd4SAllan Stephens else 5059f6bdcd4SAllan Stephens buf_discard(buf); 506b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_BUNDLER) { 507b97bf3fdSPer Liden bcl->stats.recv_bundles++; 508b97bf3fdSPer Liden bcl->stats.recv_bundled += msg_msgcnt(msg); 5094323add6SPer Liden tipc_node_unlock(node); 5104323add6SPer Liden tipc_link_recv_bundle(buf); 511b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_FRAGMENTER) { 512b97bf3fdSPer Liden bcl->stats.recv_fragments++; 5134323add6SPer Liden if (tipc_link_recv_fragment(&node->bclink.defragm, 514b97bf3fdSPer Liden &buf, &msg)) 515b97bf3fdSPer Liden bcl->stats.recv_fragmented++; 5164323add6SPer Liden tipc_node_unlock(node); 5174323add6SPer Liden tipc_net_route_msg(buf); 5189f6bdcd4SAllan Stephens } else if (msg_user(msg) == NAME_DISTRIBUTOR) { 5199f6bdcd4SAllan Stephens tipc_node_unlock(node); 5209f6bdcd4SAllan Stephens tipc_named_recv(buf); 521b97bf3fdSPer Liden } else { 5224323add6SPer Liden tipc_node_unlock(node); 5239f6bdcd4SAllan Stephens buf_discard(buf); 524b97bf3fdSPer Liden } 5255d3c488dSAllan Stephens buf = NULL; 5264323add6SPer Liden tipc_node_lock(node); 527693d03aeSAllan Stephens deferred = node->bclink.deferred_head; 5285d3c488dSAllan Stephens if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) { 529b97bf3fdSPer Liden buf = deferred; 530b97bf3fdSPer Liden msg = buf_msg(buf); 531b97bf3fdSPer Liden node->bclink.deferred_head = deferred->next; 532b97bf3fdSPer Liden goto receive; 533b97bf3fdSPer Liden } 534b97bf3fdSPer Liden } else if (less(next_in, seqno)) { 535b97bf3fdSPer Liden u32 gap_after = node->bclink.gap_after; 536b97bf3fdSPer Liden u32 gap_to = node->bclink.gap_to; 537b97bf3fdSPer Liden 5384323add6SPer Liden if (tipc_link_defer_pkt(&node->bclink.deferred_head, 539b97bf3fdSPer Liden &node->bclink.deferred_tail, 540b97bf3fdSPer Liden buf)) { 541b97bf3fdSPer Liden node->bclink.nack_sync++; 542b97bf3fdSPer Liden bcl->stats.deferred_recv++; 543b97bf3fdSPer Liden if (seqno == mod(gap_after + 1)) 544b97bf3fdSPer Liden node->bclink.gap_after = seqno; 545b97bf3fdSPer Liden else if (less(gap_after, seqno) && less(seqno, gap_to)) 546b97bf3fdSPer Liden node->bclink.gap_to = seqno; 547b97bf3fdSPer Liden } 5485d3c488dSAllan Stephens buf = NULL; 549b97bf3fdSPer Liden if (bclink_ack_allowed(node->bclink.nack_sync)) { 550b97bf3fdSPer Liden if (gap_to != gap_after) 551b97bf3fdSPer Liden bclink_send_nack(node); 552b97bf3fdSPer Liden bclink_set_gap(node); 553b97bf3fdSPer Liden } 554b97bf3fdSPer Liden } else { 555b97bf3fdSPer Liden bcl->stats.duplicates++; 556b97bf3fdSPer Liden } 5575d3c488dSAllan Stephens unlock: 5584323add6SPer Liden tipc_node_unlock(node); 5595d3c488dSAllan Stephens exit: 5605d3c488dSAllan Stephens buf_discard(buf); 561b97bf3fdSPer Liden } 562b97bf3fdSPer Liden 5636c00055aSDavid S. Miller u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) 564b97bf3fdSPer Liden { 565b97bf3fdSPer Liden return (n_ptr->bclink.supported && 5664323add6SPer Liden (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); 567b97bf3fdSPer Liden } 568b97bf3fdSPer Liden 569b97bf3fdSPer Liden 570b97bf3fdSPer Liden /** 5714323add6SPer Liden * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer 572b97bf3fdSPer Liden * 5732ff9f924SAllan Stephens * Send packet over as many bearers as necessary to reach all nodes 5742ff9f924SAllan Stephens * that have joined the broadcast link. 575b97bf3fdSPer Liden * 5762ff9f924SAllan Stephens * Returns 0 (packet sent successfully) under all circumstances, 5772ff9f924SAllan Stephens * since the broadcast link's pseudo-bearer never blocks 578b97bf3fdSPer Liden */ 579b97bf3fdSPer Liden 580988f088aSAdrian Bunk static int tipc_bcbearer_send(struct sk_buff *buf, 581b97bf3fdSPer Liden struct tipc_bearer *unused1, 582b97bf3fdSPer Liden struct tipc_media_addr *unused2) 583b97bf3fdSPer Liden { 584b97bf3fdSPer Liden int bp_index; 585b97bf3fdSPer Liden 5862ff9f924SAllan Stephens /* 5872ff9f924SAllan Stephens * Prepare broadcast link message for reliable transmission, 5882ff9f924SAllan Stephens * if first time trying to send it; 5892ff9f924SAllan Stephens * preparation is skipped for broadcast link protocol messages 5902ff9f924SAllan Stephens * since they are sent in an unreliable manner and don't need it 5912ff9f924SAllan Stephens */ 592b97bf3fdSPer Liden 593b97bf3fdSPer Liden if (likely(!msg_non_seq(buf_msg(buf)))) { 594b97bf3fdSPer Liden struct tipc_msg *msg; 595b97bf3fdSPer Liden 596cd3decdfSAllan Stephens bcbuf_set_acks(buf, bclink->bcast_nodes.count); 597b97bf3fdSPer Liden msg = buf_msg(buf); 59840aecb1bSAllan Stephens msg_set_non_seq(msg, 1); 599b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 6000048b826SAllan Stephens bcl->stats.sent_info++; 6015e726900SAllan Stephens 602cd3decdfSAllan Stephens if (WARN_ON(!bclink->bcast_nodes.count)) { 6035e726900SAllan Stephens dump_stack(); 6045e726900SAllan Stephens return 0; 6055e726900SAllan Stephens } 606b97bf3fdSPer Liden } 607b97bf3fdSPer Liden 608b97bf3fdSPer Liden /* Send buffer over bearers until all targets reached */ 609b97bf3fdSPer Liden 610cd3decdfSAllan Stephens bcbearer->remains = bclink->bcast_nodes; 611b97bf3fdSPer Liden 612b97bf3fdSPer Liden for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { 6132d627b92SAllan Stephens struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary; 6142d627b92SAllan Stephens struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary; 615b97bf3fdSPer Liden 616b97bf3fdSPer Liden if (!p) 617b97bf3fdSPer Liden break; /* no more bearers to try */ 618b97bf3fdSPer Liden 61965f51ef0SAllan Stephens tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new); 62065f51ef0SAllan Stephens if (bcbearer->remains_new.count == bcbearer->remains.count) 621b97bf3fdSPer Liden continue; /* bearer pair doesn't add anything */ 622b97bf3fdSPer Liden 6232d627b92SAllan Stephens if (p->blocked || 6242d627b92SAllan Stephens p->media->send_msg(buf, p, &p->media->bcast_addr)) { 6251a624832SNeil Horman /* unable to send on primary bearer */ 6262d627b92SAllan Stephens if (!s || s->blocked || 6272d627b92SAllan Stephens s->media->send_msg(buf, s, 6281a624832SNeil Horman &s->media->bcast_addr)) { 6291a624832SNeil Horman /* unable to send on either bearer */ 6301a624832SNeil Horman continue; 6311a624832SNeil Horman } 632b97bf3fdSPer Liden } 633b97bf3fdSPer Liden 6341a624832SNeil Horman if (s) { 635b97bf3fdSPer Liden bcbearer->bpairs[bp_index].primary = s; 636b97bf3fdSPer Liden bcbearer->bpairs[bp_index].secondary = p; 6371a624832SNeil Horman } 6381a624832SNeil Horman 63965f51ef0SAllan Stephens if (bcbearer->remains_new.count == 0) 6402ff9f924SAllan Stephens break; /* all targets reached */ 641b97bf3fdSPer Liden 64265f51ef0SAllan Stephens bcbearer->remains = bcbearer->remains_new; 643b97bf3fdSPer Liden } 644b97bf3fdSPer Liden 6452ff9f924SAllan Stephens return 0; 646b97bf3fdSPer Liden } 647b97bf3fdSPer Liden 648b97bf3fdSPer Liden /** 6494323add6SPer Liden * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer 650b97bf3fdSPer Liden */ 651b97bf3fdSPer Liden 6524323add6SPer Liden void tipc_bcbearer_sort(void) 653b97bf3fdSPer Liden { 654b97bf3fdSPer Liden struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp; 655b97bf3fdSPer Liden struct bcbearer_pair *bp_curr; 656b97bf3fdSPer Liden int b_index; 657b97bf3fdSPer Liden int pri; 658b97bf3fdSPer Liden 659b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 660b97bf3fdSPer Liden 661b97bf3fdSPer Liden /* Group bearers by priority (can assume max of two per priority) */ 662b97bf3fdSPer Liden 663b97bf3fdSPer Liden memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); 664b97bf3fdSPer Liden 665b97bf3fdSPer Liden for (b_index = 0; b_index < MAX_BEARERS; b_index++) { 6662d627b92SAllan Stephens struct tipc_bearer *b = &tipc_bearers[b_index]; 667b97bf3fdSPer Liden 668b97bf3fdSPer Liden if (!b->active || !b->nodes.count) 669b97bf3fdSPer Liden continue; 670b97bf3fdSPer Liden 671b97bf3fdSPer Liden if (!bp_temp[b->priority].primary) 672b97bf3fdSPer Liden bp_temp[b->priority].primary = b; 673b97bf3fdSPer Liden else 674b97bf3fdSPer Liden bp_temp[b->priority].secondary = b; 675b97bf3fdSPer Liden } 676b97bf3fdSPer Liden 677b97bf3fdSPer Liden /* Create array of bearer pairs for broadcasting */ 678b97bf3fdSPer Liden 679b97bf3fdSPer Liden bp_curr = bcbearer->bpairs; 680b97bf3fdSPer Liden memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); 681b97bf3fdSPer Liden 68216cb4b33SPer Liden for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { 683b97bf3fdSPer Liden 684b97bf3fdSPer Liden if (!bp_temp[pri].primary) 685b97bf3fdSPer Liden continue; 686b97bf3fdSPer Liden 687b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].primary; 688b97bf3fdSPer Liden 689b97bf3fdSPer Liden if (bp_temp[pri].secondary) { 6904323add6SPer Liden if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, 691b97bf3fdSPer Liden &bp_temp[pri].secondary->nodes)) { 692b97bf3fdSPer Liden bp_curr->secondary = bp_temp[pri].secondary; 693b97bf3fdSPer Liden } else { 694b97bf3fdSPer Liden bp_curr++; 695b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].secondary; 696b97bf3fdSPer Liden } 697b97bf3fdSPer Liden } 698b97bf3fdSPer Liden 699b97bf3fdSPer Liden bp_curr++; 700b97bf3fdSPer Liden } 701b97bf3fdSPer Liden 702b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 703b97bf3fdSPer Liden } 704b97bf3fdSPer Liden 705b97bf3fdSPer Liden 7064323add6SPer Liden int tipc_bclink_stats(char *buf, const u32 buf_size) 707b97bf3fdSPer Liden { 708b97bf3fdSPer Liden struct print_buf pb; 709b97bf3fdSPer Liden 710b97bf3fdSPer Liden if (!bcl) 711b97bf3fdSPer Liden return 0; 712b97bf3fdSPer Liden 7134323add6SPer Liden tipc_printbuf_init(&pb, buf, buf_size); 714b97bf3fdSPer Liden 715b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 716b97bf3fdSPer Liden 717b97bf3fdSPer Liden tipc_printf(&pb, "Link <%s>\n" 718b97bf3fdSPer Liden " Window:%u packets\n", 719b97bf3fdSPer Liden bcl->name, bcl->queue_limit[0]); 720b97bf3fdSPer Liden tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n", 721b97bf3fdSPer Liden bcl->stats.recv_info, 722b97bf3fdSPer Liden bcl->stats.recv_fragments, 723b97bf3fdSPer Liden bcl->stats.recv_fragmented, 724b97bf3fdSPer Liden bcl->stats.recv_bundles, 725b97bf3fdSPer Liden bcl->stats.recv_bundled); 726b97bf3fdSPer Liden tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n", 727b97bf3fdSPer Liden bcl->stats.sent_info, 728b97bf3fdSPer Liden bcl->stats.sent_fragments, 729b97bf3fdSPer Liden bcl->stats.sent_fragmented, 730b97bf3fdSPer Liden bcl->stats.sent_bundles, 731b97bf3fdSPer Liden bcl->stats.sent_bundled); 732b97bf3fdSPer Liden tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n", 733b97bf3fdSPer Liden bcl->stats.recv_nacks, 734b97bf3fdSPer Liden bcl->stats.deferred_recv, 735b97bf3fdSPer Liden bcl->stats.duplicates); 736b97bf3fdSPer Liden tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n", 737b97bf3fdSPer Liden bcl->stats.sent_nacks, 738b97bf3fdSPer Liden bcl->stats.sent_acks, 739b97bf3fdSPer Liden bcl->stats.retransmitted); 740b97bf3fdSPer Liden tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n", 741b97bf3fdSPer Liden bcl->stats.bearer_congs, 742b97bf3fdSPer Liden bcl->stats.link_congs, 743b97bf3fdSPer Liden bcl->stats.max_queue_sz, 744b97bf3fdSPer Liden bcl->stats.queue_sz_counts 745b97bf3fdSPer Liden ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts) 746b97bf3fdSPer Liden : 0); 747b97bf3fdSPer Liden 748b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7494323add6SPer Liden return tipc_printbuf_validate(&pb); 750b97bf3fdSPer Liden } 751b97bf3fdSPer Liden 7524323add6SPer Liden int tipc_bclink_reset_stats(void) 753b97bf3fdSPer Liden { 754b97bf3fdSPer Liden if (!bcl) 755b97bf3fdSPer Liden return -ENOPROTOOPT; 756b97bf3fdSPer Liden 757b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 758b97bf3fdSPer Liden memset(&bcl->stats, 0, sizeof(bcl->stats)); 759b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7600e35fd5eSAllan Stephens return 0; 761b97bf3fdSPer Liden } 762b97bf3fdSPer Liden 7634323add6SPer Liden int tipc_bclink_set_queue_limits(u32 limit) 764b97bf3fdSPer Liden { 765b97bf3fdSPer Liden if (!bcl) 766b97bf3fdSPer Liden return -ENOPROTOOPT; 767b97bf3fdSPer Liden if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) 768b97bf3fdSPer Liden return -EINVAL; 769b97bf3fdSPer Liden 770b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 7714323add6SPer Liden tipc_link_set_queue_limits(bcl, limit); 772b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7730e35fd5eSAllan Stephens return 0; 774b97bf3fdSPer Liden } 775b97bf3fdSPer Liden 776c47e9b91SAllan Stephens void tipc_bclink_init(void) 777b97bf3fdSPer Liden { 778b97bf3fdSPer Liden INIT_LIST_HEAD(&bcbearer->bearer.cong_links); 779b97bf3fdSPer Liden bcbearer->bearer.media = &bcbearer->media; 7804323add6SPer Liden bcbearer->media.send_msg = tipc_bcbearer_send; 7812e2d9be8SAllan Stephens sprintf(bcbearer->media.name, "tipc-broadcast"); 782b97bf3fdSPer Liden 783b97bf3fdSPer Liden INIT_LIST_HEAD(&bcl->waiting_ports); 784b97bf3fdSPer Liden bcl->next_out_no = 1; 78534af946aSIngo Molnar spin_lock_init(&bclink->node.lock); 786b97bf3fdSPer Liden bcl->owner = &bclink->node; 787b97bf3fdSPer Liden bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; 7884323add6SPer Liden tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); 789b97bf3fdSPer Liden bcl->b_ptr = &bcbearer->bearer; 790b97bf3fdSPer Liden bcl->state = WORKING_WORKING; 7914b704d59SStephen Hemminger strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME); 792b97bf3fdSPer Liden } 793b97bf3fdSPer Liden 7944323add6SPer Liden void tipc_bclink_stop(void) 795b97bf3fdSPer Liden { 796b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 7974323add6SPer Liden tipc_link_stop(bcl); 798b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 799c47e9b91SAllan Stephens 800c47e9b91SAllan Stephens memset(bclink, 0, sizeof(*bclink)); 801c47e9b91SAllan Stephens memset(bcbearer, 0, sizeof(*bcbearer)); 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