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 /** 497f9ab6acSPaul Gortmaker * struct tipc_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 577f9ab6acSPaul Gortmaker struct tipc_bcbearer_pair { 582d627b92SAllan Stephens struct tipc_bearer *primary; 592d627b92SAllan Stephens struct tipc_bearer *secondary; 60b97bf3fdSPer Liden }; 61b97bf3fdSPer Liden 62b97bf3fdSPer Liden /** 637f9ab6acSPaul Gortmaker * struct tipc_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 777f9ab6acSPaul Gortmaker struct tipc_bcbearer { 782d627b92SAllan Stephens struct tipc_bearer bearer; 79358a0d1cSPaul Gortmaker struct tipc_media media; 807f9ab6acSPaul Gortmaker struct tipc_bcbearer_pair bpairs[MAX_BEARERS]; 817f9ab6acSPaul Gortmaker struct tipc_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 /** 876765fd67SPaul Gortmaker * struct tipc_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 966765fd67SPaul Gortmaker struct tipc_bclink { 97a18c4bc3SPaul Gortmaker struct tipc_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 1037f9ab6acSPaul Gortmaker static struct tipc_bcbearer bcast_bearer; 1046765fd67SPaul Gortmaker static struct tipc_bclink bcast_link; 105b97bf3fdSPer Liden 1067f9ab6acSPaul Gortmaker static struct tipc_bcbearer *bcbearer = &bcast_bearer; 1076765fd67SPaul Gortmaker static struct tipc_bclink *bclink = &bcast_link; 108a18c4bc3SPaul Gortmaker static struct tipc_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 bcbuf_acks(struct sk_buff *buf) 119b97bf3fdSPer Liden { 120880b005fSDavid S. Miller return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle; 121b97bf3fdSPer Liden } 122b97bf3fdSPer Liden 12305790c64SSam Ravnborg static void bcbuf_set_acks(struct sk_buff *buf, u32 acks) 124b97bf3fdSPer Liden { 125880b005fSDavid S. Miller TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks; 126b97bf3fdSPer Liden } 127b97bf3fdSPer Liden 12805790c64SSam Ravnborg static void bcbuf_decr_acks(struct sk_buff *buf) 129b97bf3fdSPer Liden { 130b97bf3fdSPer Liden bcbuf_set_acks(buf, bcbuf_acks(buf) - 1); 131b97bf3fdSPer Liden } 132b97bf3fdSPer Liden 133cd3decdfSAllan Stephens void tipc_bclink_add_node(u32 addr) 134cd3decdfSAllan Stephens { 135cd3decdfSAllan Stephens spin_lock_bh(&bc_lock); 136cd3decdfSAllan Stephens tipc_nmap_add(&bclink->bcast_nodes, addr); 137cd3decdfSAllan Stephens spin_unlock_bh(&bc_lock); 138cd3decdfSAllan Stephens } 139cd3decdfSAllan Stephens 140cd3decdfSAllan Stephens void tipc_bclink_remove_node(u32 addr) 141cd3decdfSAllan Stephens { 142cd3decdfSAllan Stephens spin_lock_bh(&bc_lock); 143cd3decdfSAllan Stephens tipc_nmap_remove(&bclink->bcast_nodes, addr); 144cd3decdfSAllan Stephens spin_unlock_bh(&bc_lock); 145cd3decdfSAllan Stephens } 146b97bf3fdSPer Liden 1475b1f7bdeSAllan Stephens static void bclink_set_last_sent(void) 1485b1f7bdeSAllan Stephens { 1495b1f7bdeSAllan Stephens if (bcl->next_out) 1505b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1); 1515b1f7bdeSAllan Stephens else 1525b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1); 1535b1f7bdeSAllan Stephens } 1545b1f7bdeSAllan Stephens 1555b1f7bdeSAllan Stephens u32 tipc_bclink_get_last_sent(void) 1565b1f7bdeSAllan Stephens { 1575b1f7bdeSAllan Stephens return bcl->fsm_msg_cnt; 1585b1f7bdeSAllan Stephens } 1595b1f7bdeSAllan Stephens 160b97bf3fdSPer Liden /** 161b97bf3fdSPer Liden * bclink_set_gap - set gap according to contents of current deferred pkt queue 162b97bf3fdSPer Liden * 163b97bf3fdSPer Liden * Called with 'node' locked, bc_lock unlocked 164b97bf3fdSPer Liden */ 165b97bf3fdSPer Liden 1666c00055aSDavid S. Miller static void bclink_set_gap(struct tipc_node *n_ptr) 167b97bf3fdSPer Liden { 168b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 169b97bf3fdSPer Liden 170b97bf3fdSPer Liden n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 171b97bf3fdSPer Liden mod(n_ptr->bclink.last_in); 172b97bf3fdSPer Liden if (unlikely(buf != NULL)) 173b97bf3fdSPer Liden n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1); 174b97bf3fdSPer Liden } 175b97bf3fdSPer Liden 176b97bf3fdSPer Liden /** 177b97bf3fdSPer Liden * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment 178b97bf3fdSPer Liden * 179b97bf3fdSPer Liden * This mechanism endeavours to prevent all nodes in network from trying 180b97bf3fdSPer Liden * to ACK or NACK at the same time. 181b97bf3fdSPer Liden * 182b97bf3fdSPer Liden * Note: TIPC uses a different trigger to distribute ACKs than it does to 183b97bf3fdSPer Liden * distribute NACKs, but tries to use the same spacing (divide by 16). 184b97bf3fdSPer Liden */ 185b97bf3fdSPer Liden 18605790c64SSam Ravnborg static int bclink_ack_allowed(u32 n) 187b97bf3fdSPer Liden { 188a02cec21SEric Dumazet return (n % TIPC_MIN_LINK_WIN) == tipc_own_tag; 189b97bf3fdSPer Liden } 190b97bf3fdSPer Liden 191b97bf3fdSPer Liden 192b97bf3fdSPer Liden /** 19301d83eddSAllan Stephens * tipc_bclink_retransmit_to - get most recent node to request retransmission 19401d83eddSAllan Stephens * 19501d83eddSAllan Stephens * Called with bc_lock locked 19601d83eddSAllan Stephens */ 19701d83eddSAllan Stephens 19801d83eddSAllan Stephens struct tipc_node *tipc_bclink_retransmit_to(void) 19901d83eddSAllan Stephens { 20001d83eddSAllan Stephens return bclink->retransmit_to; 20101d83eddSAllan Stephens } 20201d83eddSAllan Stephens 20301d83eddSAllan Stephens /** 204b97bf3fdSPer Liden * bclink_retransmit_pkt - retransmit broadcast packets 205b97bf3fdSPer Liden * @after: sequence number of last packet to *not* retransmit 206b97bf3fdSPer Liden * @to: sequence number of last packet to retransmit 207b97bf3fdSPer Liden * 208d356eebaSAllan Stephens * Called with bc_lock locked 209b97bf3fdSPer Liden */ 210b97bf3fdSPer Liden 211b97bf3fdSPer Liden static void bclink_retransmit_pkt(u32 after, u32 to) 212b97bf3fdSPer Liden { 213b97bf3fdSPer Liden struct sk_buff *buf; 214b97bf3fdSPer Liden 215b97bf3fdSPer Liden buf = bcl->first_out; 216a016892cSAllan Stephens while (buf && less_eq(buf_seqno(buf), after)) 217b97bf3fdSPer Liden buf = buf->next; 2184323add6SPer Liden tipc_link_retransmit(bcl, buf, mod(to - after)); 219b97bf3fdSPer Liden } 220b97bf3fdSPer Liden 221b97bf3fdSPer Liden /** 2224323add6SPer Liden * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets 223b97bf3fdSPer Liden * @n_ptr: node that sent acknowledgement info 224b97bf3fdSPer Liden * @acked: broadcast sequence # that has been acknowledged 225b97bf3fdSPer Liden * 226b97bf3fdSPer Liden * Node is locked, bc_lock unlocked. 227b97bf3fdSPer Liden */ 228b97bf3fdSPer Liden 2296c00055aSDavid S. Miller void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked) 230b97bf3fdSPer Liden { 231b97bf3fdSPer Liden struct sk_buff *crs; 232b97bf3fdSPer Liden struct sk_buff *next; 233b97bf3fdSPer Liden unsigned int released = 0; 234b97bf3fdSPer Liden 235b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 236b97bf3fdSPer Liden 23736559591SAllan Stephens /* Bail out if tx queue is empty (no clean up is required) */ 238b97bf3fdSPer Liden crs = bcl->first_out; 23936559591SAllan Stephens if (!crs) 24036559591SAllan Stephens goto exit; 24136559591SAllan Stephens 24236559591SAllan Stephens /* Determine which messages need to be acknowledged */ 24336559591SAllan Stephens if (acked == INVALID_LINK_SEQ) { 24436559591SAllan Stephens /* 24536559591SAllan Stephens * Contact with specified node has been lost, so need to 24636559591SAllan Stephens * acknowledge sent messages only (if other nodes still exist) 24736559591SAllan Stephens * or both sent and unsent messages (otherwise) 24836559591SAllan Stephens */ 24936559591SAllan Stephens if (bclink->bcast_nodes.count) 25036559591SAllan Stephens acked = bcl->fsm_msg_cnt; 25136559591SAllan Stephens else 25236559591SAllan Stephens acked = bcl->next_out_no; 25336559591SAllan Stephens } else { 25436559591SAllan Stephens /* 25536559591SAllan Stephens * Bail out if specified sequence number does not correspond 25636559591SAllan Stephens * to a message that has been sent and not yet acknowledged 25736559591SAllan Stephens */ 25836559591SAllan Stephens if (less(acked, buf_seqno(crs)) || 25936559591SAllan Stephens less(bcl->fsm_msg_cnt, acked) || 26036559591SAllan Stephens less_eq(acked, n_ptr->bclink.acked)) 26136559591SAllan Stephens goto exit; 26236559591SAllan Stephens } 26336559591SAllan Stephens 26436559591SAllan Stephens /* Skip over packets that node has previously acknowledged */ 265a016892cSAllan Stephens while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) 266b97bf3fdSPer Liden crs = crs->next; 267b97bf3fdSPer Liden 268b97bf3fdSPer Liden /* Update packets that node is now acknowledging */ 269b97bf3fdSPer Liden 270b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), acked)) { 271b97bf3fdSPer Liden next = crs->next; 27210745cd5SAllan Stephens 27310745cd5SAllan Stephens if (crs != bcl->next_out) 274b97bf3fdSPer Liden bcbuf_decr_acks(crs); 27510745cd5SAllan Stephens else { 27610745cd5SAllan Stephens bcbuf_set_acks(crs, 0); 27710745cd5SAllan Stephens bcl->next_out = next; 27810745cd5SAllan Stephens bclink_set_last_sent(); 27910745cd5SAllan Stephens } 28010745cd5SAllan Stephens 281b97bf3fdSPer Liden if (bcbuf_acks(crs) == 0) { 282b97bf3fdSPer Liden bcl->first_out = next; 283b97bf3fdSPer Liden bcl->out_queue_size--; 284b97bf3fdSPer Liden buf_discard(crs); 285b97bf3fdSPer Liden released = 1; 286b97bf3fdSPer Liden } 287b97bf3fdSPer Liden crs = next; 288b97bf3fdSPer Liden } 289b97bf3fdSPer Liden n_ptr->bclink.acked = acked; 290b97bf3fdSPer Liden 291b97bf3fdSPer Liden /* Try resolving broadcast link congestion, if necessary */ 292b97bf3fdSPer Liden 2935b1f7bdeSAllan Stephens if (unlikely(bcl->next_out)) { 2944323add6SPer Liden tipc_link_push_queue(bcl); 2955b1f7bdeSAllan Stephens bclink_set_last_sent(); 2965b1f7bdeSAllan Stephens } 297b97bf3fdSPer Liden if (unlikely(released && !list_empty(&bcl->waiting_ports))) 2984323add6SPer Liden tipc_link_wakeup_ports(bcl, 0); 29936559591SAllan Stephens exit: 300b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 301b97bf3fdSPer Liden } 302b97bf3fdSPer Liden 303b97bf3fdSPer Liden /** 304b97bf3fdSPer Liden * bclink_send_ack - unicast an ACK msg 305b97bf3fdSPer Liden * 3064323add6SPer Liden * tipc_net_lock and node lock set 307b97bf3fdSPer Liden */ 308b97bf3fdSPer Liden 3096c00055aSDavid S. Miller static void bclink_send_ack(struct tipc_node *n_ptr) 310b97bf3fdSPer Liden { 311a18c4bc3SPaul Gortmaker struct tipc_link *l_ptr = n_ptr->active_links[n_ptr->addr & 1]; 312b97bf3fdSPer Liden 313b97bf3fdSPer Liden if (l_ptr != NULL) 3144323add6SPer Liden tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0); 315b97bf3fdSPer Liden } 316b97bf3fdSPer Liden 317b97bf3fdSPer Liden /** 318b97bf3fdSPer Liden * bclink_send_nack- broadcast a NACK msg 319b97bf3fdSPer Liden * 3204323add6SPer Liden * tipc_net_lock and node lock set 321b97bf3fdSPer Liden */ 322b97bf3fdSPer Liden 3236c00055aSDavid S. Miller static void bclink_send_nack(struct tipc_node *n_ptr) 324b97bf3fdSPer Liden { 325b97bf3fdSPer Liden struct sk_buff *buf; 326b97bf3fdSPer Liden struct tipc_msg *msg; 327b97bf3fdSPer Liden 328b97bf3fdSPer Liden if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to)) 329b97bf3fdSPer Liden return; 330b97bf3fdSPer Liden 33131e3c3f6Sstephen hemminger buf = tipc_buf_acquire(INT_H_SIZE); 332b97bf3fdSPer Liden if (buf) { 333b97bf3fdSPer Liden msg = buf_msg(buf); 334c68ca7b7SAllan Stephens tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG, 33575715217SAllan Stephens INT_H_SIZE, n_ptr->addr); 336bf781ecfSAllan Stephens msg_set_non_seq(msg, 1); 337b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 338b97bf3fdSPer Liden msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in)); 339b97bf3fdSPer Liden msg_set_bcgap_after(msg, n_ptr->bclink.gap_after); 340b97bf3fdSPer Liden msg_set_bcgap_to(msg, n_ptr->bclink.gap_to); 341b97bf3fdSPer Liden msg_set_bcast_tag(msg, tipc_own_tag); 342b97bf3fdSPer Liden 3430f38513dSAllan Stephens tipc_bearer_send(&bcbearer->bearer, buf, NULL); 344b97bf3fdSPer Liden bcl->stats.sent_nacks++; 345b97bf3fdSPer Liden buf_discard(buf); 346b97bf3fdSPer Liden 347b97bf3fdSPer Liden /* 348b97bf3fdSPer Liden * Ensure we doesn't send another NACK msg to the node 349b97bf3fdSPer Liden * until 16 more deferred messages arrive from it 350b97bf3fdSPer Liden * (i.e. helps prevent all nodes from NACK'ing at same time) 351b97bf3fdSPer Liden */ 352b97bf3fdSPer Liden 353b97bf3fdSPer Liden n_ptr->bclink.nack_sync = tipc_own_tag; 354b97bf3fdSPer Liden } 355b97bf3fdSPer Liden } 356b97bf3fdSPer Liden 357b97bf3fdSPer Liden /** 3584323add6SPer Liden * tipc_bclink_check_gap - send a NACK if a sequence gap exists 359b97bf3fdSPer Liden * 3604323add6SPer Liden * tipc_net_lock and node lock set 361b97bf3fdSPer Liden */ 362b97bf3fdSPer Liden 3636c00055aSDavid S. Miller void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 last_sent) 364b97bf3fdSPer Liden { 365b97bf3fdSPer Liden if (!n_ptr->bclink.supported || 366b97bf3fdSPer Liden less_eq(last_sent, mod(n_ptr->bclink.last_in))) 367b97bf3fdSPer Liden return; 368b97bf3fdSPer Liden 369b97bf3fdSPer Liden bclink_set_gap(n_ptr); 370b97bf3fdSPer Liden if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to) 371b97bf3fdSPer Liden n_ptr->bclink.gap_to = last_sent; 372b97bf3fdSPer Liden bclink_send_nack(n_ptr); 373b97bf3fdSPer Liden } 374b97bf3fdSPer Liden 375b97bf3fdSPer Liden /** 3764323add6SPer Liden * tipc_bclink_peek_nack - process a NACK msg meant for another node 377b97bf3fdSPer Liden * 3784323add6SPer Liden * Only tipc_net_lock set. 379b97bf3fdSPer Liden */ 380b97bf3fdSPer Liden 381988f088aSAdrian Bunk static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to) 382b97bf3fdSPer Liden { 3836c00055aSDavid S. Miller struct tipc_node *n_ptr = tipc_node_find(dest); 384b97bf3fdSPer Liden u32 my_after, my_to; 385b97bf3fdSPer Liden 3864323add6SPer Liden if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr))) 387b97bf3fdSPer Liden return; 3884323add6SPer Liden tipc_node_lock(n_ptr); 389b97bf3fdSPer Liden /* 390b97bf3fdSPer Liden * Modify gap to suppress unnecessary NACKs from this node 391b97bf3fdSPer Liden */ 392b97bf3fdSPer Liden my_after = n_ptr->bclink.gap_after; 393b97bf3fdSPer Liden my_to = n_ptr->bclink.gap_to; 394b97bf3fdSPer Liden 395b97bf3fdSPer Liden if (less_eq(gap_after, my_after)) { 396b97bf3fdSPer Liden if (less(my_after, gap_to) && less(gap_to, my_to)) 397b97bf3fdSPer Liden n_ptr->bclink.gap_after = gap_to; 398b97bf3fdSPer Liden else if (less_eq(my_to, gap_to)) 399b97bf3fdSPer Liden n_ptr->bclink.gap_to = n_ptr->bclink.gap_after; 400b97bf3fdSPer Liden } else if (less_eq(gap_after, my_to)) { 401b97bf3fdSPer Liden if (less_eq(my_to, gap_to)) 402b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 403b97bf3fdSPer Liden } else { 404b97bf3fdSPer Liden /* 405b97bf3fdSPer Liden * Expand gap if missing bufs not in deferred queue: 406b97bf3fdSPer Liden */ 407b97bf3fdSPer Liden struct sk_buff *buf = n_ptr->bclink.deferred_head; 408b97bf3fdSPer Liden u32 prev = n_ptr->bclink.gap_to; 409b97bf3fdSPer Liden 410b97bf3fdSPer Liden for (; buf; buf = buf->next) { 411b97bf3fdSPer Liden u32 seqno = buf_seqno(buf); 412b97bf3fdSPer Liden 4133ac90216SEric Sesterhenn if (mod(seqno - prev) != 1) { 414b97bf3fdSPer Liden buf = NULL; 4153ac90216SEric Sesterhenn break; 4163ac90216SEric Sesterhenn } 417b97bf3fdSPer Liden if (seqno == gap_after) 418b97bf3fdSPer Liden break; 419b97bf3fdSPer Liden prev = seqno; 420b97bf3fdSPer Liden } 421b97bf3fdSPer Liden if (buf == NULL) 422b97bf3fdSPer Liden n_ptr->bclink.gap_to = gap_after; 423b97bf3fdSPer Liden } 424b97bf3fdSPer Liden /* 425b97bf3fdSPer Liden * Some nodes may send a complementary NACK now: 426b97bf3fdSPer Liden */ 427b97bf3fdSPer Liden if (bclink_ack_allowed(sender_tag + 1)) { 428b97bf3fdSPer Liden if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) { 429b97bf3fdSPer Liden bclink_send_nack(n_ptr); 430b97bf3fdSPer Liden bclink_set_gap(n_ptr); 431b97bf3fdSPer Liden } 432b97bf3fdSPer Liden } 4334323add6SPer Liden tipc_node_unlock(n_ptr); 434b97bf3fdSPer Liden } 435b97bf3fdSPer Liden 436b97bf3fdSPer Liden /** 4374323add6SPer Liden * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster 438b97bf3fdSPer Liden */ 439b97bf3fdSPer Liden 4404323add6SPer Liden int tipc_bclink_send_msg(struct sk_buff *buf) 441b97bf3fdSPer Liden { 442b97bf3fdSPer Liden int res; 443b97bf3fdSPer Liden 444b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 445b97bf3fdSPer Liden 4462b78f9a0SAllan Stephens if (!bclink->bcast_nodes.count) { 4472b78f9a0SAllan Stephens res = msg_data_sz(buf_msg(buf)); 4482b78f9a0SAllan Stephens buf_discard(buf); 4492b78f9a0SAllan Stephens goto exit; 4502b78f9a0SAllan Stephens } 4512b78f9a0SAllan Stephens 4524323add6SPer Liden res = tipc_link_send_buf(bcl, buf); 4539157bafbSAllan Stephens if (likely(res >= 0)) { 4545b1f7bdeSAllan Stephens bclink_set_last_sent(); 455b97bf3fdSPer Liden bcl->stats.queue_sz_counts++; 456b97bf3fdSPer Liden bcl->stats.accu_queue_sz += bcl->out_queue_size; 4579157bafbSAllan Stephens } 4582b78f9a0SAllan Stephens exit: 459b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 460b97bf3fdSPer Liden return res; 461b97bf3fdSPer Liden } 462b97bf3fdSPer Liden 463b97bf3fdSPer Liden /** 4644323add6SPer Liden * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards 465b97bf3fdSPer Liden * 4664323add6SPer Liden * tipc_net_lock is read_locked, no other locks set 467b97bf3fdSPer Liden */ 468b97bf3fdSPer Liden 4694323add6SPer Liden void tipc_bclink_recv_pkt(struct sk_buff *buf) 470b97bf3fdSPer Liden { 471b97bf3fdSPer Liden struct tipc_msg *msg = buf_msg(buf); 4725d3c488dSAllan Stephens struct tipc_node *node; 473b97bf3fdSPer Liden u32 next_in; 474b97bf3fdSPer Liden u32 seqno; 475b97bf3fdSPer Liden struct sk_buff *deferred; 476b97bf3fdSPer Liden 4775d3c488dSAllan Stephens /* Screen out unwanted broadcast messages */ 4785d3c488dSAllan Stephens 4795d3c488dSAllan Stephens if (msg_mc_netid(msg) != tipc_net_id) 4805d3c488dSAllan Stephens goto exit; 4815d3c488dSAllan Stephens 4825d3c488dSAllan Stephens node = tipc_node_find(msg_prevnode(msg)); 4835d3c488dSAllan Stephens if (unlikely(!node)) 4845d3c488dSAllan Stephens goto exit; 4855d3c488dSAllan Stephens 4865d3c488dSAllan Stephens tipc_node_lock(node); 4875d3c488dSAllan Stephens if (unlikely(!node->bclink.supported)) 4885d3c488dSAllan Stephens goto unlock; 489b97bf3fdSPer Liden 490b97bf3fdSPer Liden if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { 4919f6bdcd4SAllan Stephens if (msg_type(msg) != STATE_MSG) 4929f6bdcd4SAllan Stephens goto unlock; 493b97bf3fdSPer Liden if (msg_destnode(msg) == tipc_own_addr) { 4944323add6SPer Liden tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); 4954323add6SPer Liden tipc_node_unlock(node); 496d356eebaSAllan Stephens spin_lock_bh(&bc_lock); 497b97bf3fdSPer Liden bcl->stats.recv_nacks++; 49801d83eddSAllan Stephens bclink->retransmit_to = node; 499b97bf3fdSPer Liden bclink_retransmit_pkt(msg_bcgap_after(msg), 500b97bf3fdSPer Liden msg_bcgap_to(msg)); 501d356eebaSAllan Stephens spin_unlock_bh(&bc_lock); 502b97bf3fdSPer Liden } else { 5035d3c488dSAllan Stephens tipc_node_unlock(node); 5044323add6SPer Liden tipc_bclink_peek_nack(msg_destnode(msg), 505b97bf3fdSPer Liden msg_bcast_tag(msg), 506b97bf3fdSPer Liden msg_bcgap_after(msg), 507b97bf3fdSPer Liden msg_bcgap_to(msg)); 508b97bf3fdSPer Liden } 5095d3c488dSAllan Stephens goto exit; 510b97bf3fdSPer Liden } 511b97bf3fdSPer Liden 5125d3c488dSAllan Stephens /* Handle in-sequence broadcast message */ 5135d3c488dSAllan Stephens 514b97bf3fdSPer Liden receive: 515b97bf3fdSPer Liden next_in = mod(node->bclink.last_in + 1); 516b97bf3fdSPer Liden seqno = msg_seqno(msg); 517b97bf3fdSPer Liden 518b97bf3fdSPer Liden if (likely(seqno == next_in)) { 519b97bf3fdSPer Liden bcl->stats.recv_info++; 520b97bf3fdSPer Liden node->bclink.last_in++; 521b97bf3fdSPer Liden bclink_set_gap(node); 522b97bf3fdSPer Liden if (unlikely(bclink_ack_allowed(seqno))) { 523b97bf3fdSPer Liden bclink_send_ack(node); 524b97bf3fdSPer Liden bcl->stats.sent_acks++; 525b97bf3fdSPer Liden } 526b97bf3fdSPer Liden if (likely(msg_isdata(msg))) { 5274323add6SPer Liden tipc_node_unlock(node); 5289f6bdcd4SAllan Stephens if (likely(msg_mcast(msg))) 5294323add6SPer Liden tipc_port_recv_mcast(buf, NULL); 5309f6bdcd4SAllan Stephens else 5319f6bdcd4SAllan Stephens buf_discard(buf); 532b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_BUNDLER) { 533b97bf3fdSPer Liden bcl->stats.recv_bundles++; 534b97bf3fdSPer Liden bcl->stats.recv_bundled += msg_msgcnt(msg); 5354323add6SPer Liden tipc_node_unlock(node); 5364323add6SPer Liden tipc_link_recv_bundle(buf); 537b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_FRAGMENTER) { 538b97bf3fdSPer Liden bcl->stats.recv_fragments++; 5394323add6SPer Liden if (tipc_link_recv_fragment(&node->bclink.defragm, 540b97bf3fdSPer Liden &buf, &msg)) 541b97bf3fdSPer Liden bcl->stats.recv_fragmented++; 5424323add6SPer Liden tipc_node_unlock(node); 5434323add6SPer Liden tipc_net_route_msg(buf); 5449f6bdcd4SAllan Stephens } else if (msg_user(msg) == NAME_DISTRIBUTOR) { 5459f6bdcd4SAllan Stephens tipc_node_unlock(node); 5469f6bdcd4SAllan Stephens tipc_named_recv(buf); 547b97bf3fdSPer Liden } else { 5484323add6SPer Liden tipc_node_unlock(node); 5499f6bdcd4SAllan Stephens buf_discard(buf); 550b97bf3fdSPer Liden } 5515d3c488dSAllan Stephens buf = NULL; 5524323add6SPer Liden tipc_node_lock(node); 553693d03aeSAllan Stephens deferred = node->bclink.deferred_head; 5545d3c488dSAllan Stephens if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) { 555b97bf3fdSPer Liden buf = deferred; 556b97bf3fdSPer Liden msg = buf_msg(buf); 557b97bf3fdSPer Liden node->bclink.deferred_head = deferred->next; 558b97bf3fdSPer Liden goto receive; 559b97bf3fdSPer Liden } 560b97bf3fdSPer Liden } else if (less(next_in, seqno)) { 561b97bf3fdSPer Liden u32 gap_after = node->bclink.gap_after; 562b97bf3fdSPer Liden u32 gap_to = node->bclink.gap_to; 563b97bf3fdSPer Liden 5644323add6SPer Liden if (tipc_link_defer_pkt(&node->bclink.deferred_head, 565b97bf3fdSPer Liden &node->bclink.deferred_tail, 566b97bf3fdSPer Liden buf)) { 567b97bf3fdSPer Liden node->bclink.nack_sync++; 568b97bf3fdSPer Liden bcl->stats.deferred_recv++; 569b97bf3fdSPer Liden if (seqno == mod(gap_after + 1)) 570b97bf3fdSPer Liden node->bclink.gap_after = seqno; 571b97bf3fdSPer Liden else if (less(gap_after, seqno) && less(seqno, gap_to)) 572b97bf3fdSPer Liden node->bclink.gap_to = seqno; 573b97bf3fdSPer Liden } 5745d3c488dSAllan Stephens buf = NULL; 575b97bf3fdSPer Liden if (bclink_ack_allowed(node->bclink.nack_sync)) { 576b97bf3fdSPer Liden if (gap_to != gap_after) 577b97bf3fdSPer Liden bclink_send_nack(node); 578b97bf3fdSPer Liden bclink_set_gap(node); 579b97bf3fdSPer Liden } 580b97bf3fdSPer Liden } else { 581b97bf3fdSPer Liden bcl->stats.duplicates++; 582b97bf3fdSPer Liden } 5835d3c488dSAllan Stephens unlock: 5844323add6SPer Liden tipc_node_unlock(node); 5855d3c488dSAllan Stephens exit: 5865d3c488dSAllan Stephens buf_discard(buf); 587b97bf3fdSPer Liden } 588b97bf3fdSPer Liden 5896c00055aSDavid S. Miller u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) 590b97bf3fdSPer Liden { 591b97bf3fdSPer Liden return (n_ptr->bclink.supported && 5924323add6SPer Liden (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); 593b97bf3fdSPer Liden } 594b97bf3fdSPer Liden 595b97bf3fdSPer Liden 596b97bf3fdSPer Liden /** 5974323add6SPer Liden * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer 598b97bf3fdSPer Liden * 5992ff9f924SAllan Stephens * Send packet over as many bearers as necessary to reach all nodes 6002ff9f924SAllan Stephens * that have joined the broadcast link. 601b97bf3fdSPer Liden * 6022ff9f924SAllan Stephens * Returns 0 (packet sent successfully) under all circumstances, 6032ff9f924SAllan Stephens * since the broadcast link's pseudo-bearer never blocks 604b97bf3fdSPer Liden */ 605b97bf3fdSPer Liden 606988f088aSAdrian Bunk static int tipc_bcbearer_send(struct sk_buff *buf, 607b97bf3fdSPer Liden struct tipc_bearer *unused1, 608b97bf3fdSPer Liden struct tipc_media_addr *unused2) 609b97bf3fdSPer Liden { 610b97bf3fdSPer Liden int bp_index; 611b97bf3fdSPer Liden 6122ff9f924SAllan Stephens /* 6132ff9f924SAllan Stephens * Prepare broadcast link message for reliable transmission, 6142ff9f924SAllan Stephens * if first time trying to send it; 6152ff9f924SAllan Stephens * preparation is skipped for broadcast link protocol messages 6162ff9f924SAllan Stephens * since they are sent in an unreliable manner and don't need it 6172ff9f924SAllan Stephens */ 618b97bf3fdSPer Liden 619b97bf3fdSPer Liden if (likely(!msg_non_seq(buf_msg(buf)))) { 620b97bf3fdSPer Liden struct tipc_msg *msg; 621b97bf3fdSPer Liden 622cd3decdfSAllan Stephens bcbuf_set_acks(buf, bclink->bcast_nodes.count); 623b97bf3fdSPer Liden msg = buf_msg(buf); 62440aecb1bSAllan Stephens msg_set_non_seq(msg, 1); 625b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 6260048b826SAllan Stephens bcl->stats.sent_info++; 6275e726900SAllan Stephens 628cd3decdfSAllan Stephens if (WARN_ON(!bclink->bcast_nodes.count)) { 6295e726900SAllan Stephens dump_stack(); 6305e726900SAllan Stephens return 0; 6315e726900SAllan Stephens } 632b97bf3fdSPer Liden } 633b97bf3fdSPer Liden 634b97bf3fdSPer Liden /* Send buffer over bearers until all targets reached */ 635b97bf3fdSPer Liden 636cd3decdfSAllan Stephens bcbearer->remains = bclink->bcast_nodes; 637b97bf3fdSPer Liden 638b97bf3fdSPer Liden for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { 6392d627b92SAllan Stephens struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary; 6402d627b92SAllan Stephens struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary; 641b97bf3fdSPer Liden 642b97bf3fdSPer Liden if (!p) 643b97bf3fdSPer Liden break; /* no more bearers to try */ 644b97bf3fdSPer Liden 64565f51ef0SAllan Stephens tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new); 64665f51ef0SAllan Stephens if (bcbearer->remains_new.count == bcbearer->remains.count) 647b97bf3fdSPer Liden continue; /* bearer pair doesn't add anything */ 648b97bf3fdSPer Liden 6492d627b92SAllan Stephens if (p->blocked || 6502d627b92SAllan Stephens p->media->send_msg(buf, p, &p->media->bcast_addr)) { 6511a624832SNeil Horman /* unable to send on primary bearer */ 6522d627b92SAllan Stephens if (!s || s->blocked || 6532d627b92SAllan Stephens s->media->send_msg(buf, s, 6541a624832SNeil Horman &s->media->bcast_addr)) { 6551a624832SNeil Horman /* unable to send on either bearer */ 6561a624832SNeil Horman continue; 6571a624832SNeil Horman } 658b97bf3fdSPer Liden } 659b97bf3fdSPer Liden 6601a624832SNeil Horman if (s) { 661b97bf3fdSPer Liden bcbearer->bpairs[bp_index].primary = s; 662b97bf3fdSPer Liden bcbearer->bpairs[bp_index].secondary = p; 6631a624832SNeil Horman } 6641a624832SNeil Horman 66565f51ef0SAllan Stephens if (bcbearer->remains_new.count == 0) 6662ff9f924SAllan Stephens break; /* all targets reached */ 667b97bf3fdSPer Liden 66865f51ef0SAllan Stephens bcbearer->remains = bcbearer->remains_new; 669b97bf3fdSPer Liden } 670b97bf3fdSPer Liden 6712ff9f924SAllan Stephens return 0; 672b97bf3fdSPer Liden } 673b97bf3fdSPer Liden 674b97bf3fdSPer Liden /** 6754323add6SPer Liden * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer 676b97bf3fdSPer Liden */ 677b97bf3fdSPer Liden 6784323add6SPer Liden void tipc_bcbearer_sort(void) 679b97bf3fdSPer Liden { 6807f9ab6acSPaul Gortmaker struct tipc_bcbearer_pair *bp_temp = bcbearer->bpairs_temp; 6817f9ab6acSPaul Gortmaker struct tipc_bcbearer_pair *bp_curr; 682b97bf3fdSPer Liden int b_index; 683b97bf3fdSPer Liden int pri; 684b97bf3fdSPer Liden 685b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 686b97bf3fdSPer Liden 687b97bf3fdSPer Liden /* Group bearers by priority (can assume max of two per priority) */ 688b97bf3fdSPer Liden 689b97bf3fdSPer Liden memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); 690b97bf3fdSPer Liden 691b97bf3fdSPer Liden for (b_index = 0; b_index < MAX_BEARERS; b_index++) { 6922d627b92SAllan Stephens struct tipc_bearer *b = &tipc_bearers[b_index]; 693b97bf3fdSPer Liden 694b97bf3fdSPer Liden if (!b->active || !b->nodes.count) 695b97bf3fdSPer Liden continue; 696b97bf3fdSPer Liden 697b97bf3fdSPer Liden if (!bp_temp[b->priority].primary) 698b97bf3fdSPer Liden bp_temp[b->priority].primary = b; 699b97bf3fdSPer Liden else 700b97bf3fdSPer Liden bp_temp[b->priority].secondary = b; 701b97bf3fdSPer Liden } 702b97bf3fdSPer Liden 703b97bf3fdSPer Liden /* Create array of bearer pairs for broadcasting */ 704b97bf3fdSPer Liden 705b97bf3fdSPer Liden bp_curr = bcbearer->bpairs; 706b97bf3fdSPer Liden memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); 707b97bf3fdSPer Liden 70816cb4b33SPer Liden for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { 709b97bf3fdSPer Liden 710b97bf3fdSPer Liden if (!bp_temp[pri].primary) 711b97bf3fdSPer Liden continue; 712b97bf3fdSPer Liden 713b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].primary; 714b97bf3fdSPer Liden 715b97bf3fdSPer Liden if (bp_temp[pri].secondary) { 7164323add6SPer Liden if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, 717b97bf3fdSPer Liden &bp_temp[pri].secondary->nodes)) { 718b97bf3fdSPer Liden bp_curr->secondary = bp_temp[pri].secondary; 719b97bf3fdSPer Liden } else { 720b97bf3fdSPer Liden bp_curr++; 721b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].secondary; 722b97bf3fdSPer Liden } 723b97bf3fdSPer Liden } 724b97bf3fdSPer Liden 725b97bf3fdSPer Liden bp_curr++; 726b97bf3fdSPer Liden } 727b97bf3fdSPer Liden 728b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 729b97bf3fdSPer Liden } 730b97bf3fdSPer Liden 731b97bf3fdSPer Liden 7324323add6SPer Liden int tipc_bclink_stats(char *buf, const u32 buf_size) 733b97bf3fdSPer Liden { 734b97bf3fdSPer Liden struct print_buf pb; 735b97bf3fdSPer Liden 736b97bf3fdSPer Liden if (!bcl) 737b97bf3fdSPer Liden return 0; 738b97bf3fdSPer Liden 7394323add6SPer Liden tipc_printbuf_init(&pb, buf, buf_size); 740b97bf3fdSPer Liden 741b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 742b97bf3fdSPer Liden 743b97bf3fdSPer Liden tipc_printf(&pb, "Link <%s>\n" 744b97bf3fdSPer Liden " Window:%u packets\n", 745b97bf3fdSPer Liden bcl->name, bcl->queue_limit[0]); 746b97bf3fdSPer Liden tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n", 747b97bf3fdSPer Liden bcl->stats.recv_info, 748b97bf3fdSPer Liden bcl->stats.recv_fragments, 749b97bf3fdSPer Liden bcl->stats.recv_fragmented, 750b97bf3fdSPer Liden bcl->stats.recv_bundles, 751b97bf3fdSPer Liden bcl->stats.recv_bundled); 752b97bf3fdSPer Liden tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n", 753b97bf3fdSPer Liden bcl->stats.sent_info, 754b97bf3fdSPer Liden bcl->stats.sent_fragments, 755b97bf3fdSPer Liden bcl->stats.sent_fragmented, 756b97bf3fdSPer Liden bcl->stats.sent_bundles, 757b97bf3fdSPer Liden bcl->stats.sent_bundled); 758b97bf3fdSPer Liden tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n", 759b97bf3fdSPer Liden bcl->stats.recv_nacks, 760b97bf3fdSPer Liden bcl->stats.deferred_recv, 761b97bf3fdSPer Liden bcl->stats.duplicates); 762b97bf3fdSPer Liden tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n", 763b97bf3fdSPer Liden bcl->stats.sent_nacks, 764b97bf3fdSPer Liden bcl->stats.sent_acks, 765b97bf3fdSPer Liden bcl->stats.retransmitted); 766b97bf3fdSPer Liden tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n", 767b97bf3fdSPer Liden bcl->stats.bearer_congs, 768b97bf3fdSPer Liden bcl->stats.link_congs, 769b97bf3fdSPer Liden bcl->stats.max_queue_sz, 770b97bf3fdSPer Liden bcl->stats.queue_sz_counts 771b97bf3fdSPer Liden ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts) 772b97bf3fdSPer Liden : 0); 773b97bf3fdSPer Liden 774b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7754323add6SPer Liden return tipc_printbuf_validate(&pb); 776b97bf3fdSPer Liden } 777b97bf3fdSPer Liden 7784323add6SPer Liden int tipc_bclink_reset_stats(void) 779b97bf3fdSPer Liden { 780b97bf3fdSPer Liden if (!bcl) 781b97bf3fdSPer Liden return -ENOPROTOOPT; 782b97bf3fdSPer Liden 783b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 784b97bf3fdSPer Liden memset(&bcl->stats, 0, sizeof(bcl->stats)); 785b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7860e35fd5eSAllan Stephens return 0; 787b97bf3fdSPer Liden } 788b97bf3fdSPer Liden 7894323add6SPer Liden int tipc_bclink_set_queue_limits(u32 limit) 790b97bf3fdSPer Liden { 791b97bf3fdSPer Liden if (!bcl) 792b97bf3fdSPer Liden return -ENOPROTOOPT; 793b97bf3fdSPer Liden if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) 794b97bf3fdSPer Liden return -EINVAL; 795b97bf3fdSPer Liden 796b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 7974323add6SPer Liden tipc_link_set_queue_limits(bcl, limit); 798b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7990e35fd5eSAllan Stephens return 0; 800b97bf3fdSPer Liden } 801b97bf3fdSPer Liden 802c47e9b91SAllan Stephens void tipc_bclink_init(void) 803b97bf3fdSPer Liden { 804b97bf3fdSPer Liden INIT_LIST_HEAD(&bcbearer->bearer.cong_links); 805b97bf3fdSPer Liden bcbearer->bearer.media = &bcbearer->media; 8064323add6SPer Liden bcbearer->media.send_msg = tipc_bcbearer_send; 8072e2d9be8SAllan Stephens sprintf(bcbearer->media.name, "tipc-broadcast"); 808b97bf3fdSPer Liden 809b97bf3fdSPer Liden INIT_LIST_HEAD(&bcl->waiting_ports); 810b97bf3fdSPer Liden bcl->next_out_no = 1; 81134af946aSIngo Molnar spin_lock_init(&bclink->node.lock); 812b97bf3fdSPer Liden bcl->owner = &bclink->node; 813b97bf3fdSPer Liden bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; 8144323add6SPer Liden tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); 815b97bf3fdSPer Liden bcl->b_ptr = &bcbearer->bearer; 816b97bf3fdSPer Liden bcl->state = WORKING_WORKING; 8174b704d59SStephen Hemminger strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME); 818b97bf3fdSPer Liden } 819b97bf3fdSPer Liden 8204323add6SPer Liden void tipc_bclink_stop(void) 821b97bf3fdSPer Liden { 822b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 8234323add6SPer Liden tipc_link_stop(bcl); 824b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 825c47e9b91SAllan Stephens 826c47e9b91SAllan Stephens memset(bclink, 0, sizeof(*bclink)); 827c47e9b91SAllan Stephens memset(bcbearer, 0, sizeof(*bcbearer)); 828b97bf3fdSPer Liden } 829b97bf3fdSPer Liden 8303e22e62bSAllan Stephens 8313e22e62bSAllan Stephens /** 8323e22e62bSAllan Stephens * tipc_nmap_add - add a node to a node map 8333e22e62bSAllan Stephens */ 8343e22e62bSAllan Stephens 8353e22e62bSAllan Stephens void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node) 8363e22e62bSAllan Stephens { 8373e22e62bSAllan Stephens int n = tipc_node(node); 8383e22e62bSAllan Stephens int w = n / WSIZE; 8393e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8403e22e62bSAllan Stephens 8413e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) == 0) { 8423e22e62bSAllan Stephens nm_ptr->count++; 8433e22e62bSAllan Stephens nm_ptr->map[w] |= mask; 8443e22e62bSAllan Stephens } 8453e22e62bSAllan Stephens } 8463e22e62bSAllan Stephens 8473e22e62bSAllan Stephens /** 8483e22e62bSAllan Stephens * tipc_nmap_remove - remove a node from a node map 8493e22e62bSAllan Stephens */ 8503e22e62bSAllan Stephens 8513e22e62bSAllan Stephens void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node) 8523e22e62bSAllan Stephens { 8533e22e62bSAllan Stephens int n = tipc_node(node); 8543e22e62bSAllan Stephens int w = n / WSIZE; 8553e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8563e22e62bSAllan Stephens 8573e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) != 0) { 8583e22e62bSAllan Stephens nm_ptr->map[w] &= ~mask; 8593e22e62bSAllan Stephens nm_ptr->count--; 8603e22e62bSAllan Stephens } 8613e22e62bSAllan Stephens } 8623e22e62bSAllan Stephens 8633e22e62bSAllan Stephens /** 8643e22e62bSAllan Stephens * tipc_nmap_diff - find differences between node maps 8653e22e62bSAllan Stephens * @nm_a: input node map A 8663e22e62bSAllan Stephens * @nm_b: input node map B 8673e22e62bSAllan Stephens * @nm_diff: output node map A-B (i.e. nodes of A that are not in B) 8683e22e62bSAllan Stephens */ 8693e22e62bSAllan Stephens 87031e3c3f6Sstephen hemminger static void tipc_nmap_diff(struct tipc_node_map *nm_a, 87131e3c3f6Sstephen hemminger struct tipc_node_map *nm_b, 8723e22e62bSAllan Stephens struct tipc_node_map *nm_diff) 8733e22e62bSAllan Stephens { 8743e22e62bSAllan Stephens int stop = ARRAY_SIZE(nm_a->map); 8753e22e62bSAllan Stephens int w; 8763e22e62bSAllan Stephens int b; 8773e22e62bSAllan Stephens u32 map; 8783e22e62bSAllan Stephens 8793e22e62bSAllan Stephens memset(nm_diff, 0, sizeof(*nm_diff)); 8803e22e62bSAllan Stephens for (w = 0; w < stop; w++) { 8813e22e62bSAllan Stephens map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]); 8823e22e62bSAllan Stephens nm_diff->map[w] = map; 8833e22e62bSAllan Stephens if (map != 0) { 8843e22e62bSAllan Stephens for (b = 0 ; b < WSIZE; b++) { 8853e22e62bSAllan Stephens if (map & (1 << b)) 8863e22e62bSAllan Stephens nm_diff->count++; 8873e22e62bSAllan Stephens } 8883e22e62bSAllan Stephens } 8893e22e62bSAllan Stephens } 8903e22e62bSAllan Stephens } 89143608edcSAllan Stephens 89243608edcSAllan Stephens /** 89343608edcSAllan Stephens * tipc_port_list_add - add a port to a port list, ensuring no duplicates 89443608edcSAllan Stephens */ 89543608edcSAllan Stephens 8964584310bSPaul Gortmaker void tipc_port_list_add(struct tipc_port_list *pl_ptr, u32 port) 89743608edcSAllan Stephens { 8984584310bSPaul Gortmaker struct tipc_port_list *item = pl_ptr; 89943608edcSAllan Stephens int i; 90043608edcSAllan Stephens int item_sz = PLSIZE; 90143608edcSAllan Stephens int cnt = pl_ptr->count; 90243608edcSAllan Stephens 90343608edcSAllan Stephens for (; ; cnt -= item_sz, item = item->next) { 90443608edcSAllan Stephens if (cnt < PLSIZE) 90543608edcSAllan Stephens item_sz = cnt; 90643608edcSAllan Stephens for (i = 0; i < item_sz; i++) 90743608edcSAllan Stephens if (item->ports[i] == port) 90843608edcSAllan Stephens return; 90943608edcSAllan Stephens if (i < PLSIZE) { 91043608edcSAllan Stephens item->ports[i] = port; 91143608edcSAllan Stephens pl_ptr->count++; 91243608edcSAllan Stephens return; 91343608edcSAllan Stephens } 91443608edcSAllan Stephens if (!item->next) { 91543608edcSAllan Stephens item->next = kmalloc(sizeof(*item), GFP_ATOMIC); 91643608edcSAllan Stephens if (!item->next) { 91743608edcSAllan Stephens warn("Incomplete multicast delivery, no memory\n"); 91843608edcSAllan Stephens return; 91943608edcSAllan Stephens } 92043608edcSAllan Stephens item->next->next = NULL; 92143608edcSAllan Stephens } 92243608edcSAllan Stephens } 92343608edcSAllan Stephens } 92443608edcSAllan Stephens 92543608edcSAllan Stephens /** 92643608edcSAllan Stephens * tipc_port_list_free - free dynamically created entries in port_list chain 92743608edcSAllan Stephens * 92843608edcSAllan Stephens */ 92943608edcSAllan Stephens 9304584310bSPaul Gortmaker void tipc_port_list_free(struct tipc_port_list *pl_ptr) 93143608edcSAllan Stephens { 9324584310bSPaul Gortmaker struct tipc_port_list *item; 9334584310bSPaul Gortmaker struct tipc_port_list *next; 93443608edcSAllan Stephens 93543608edcSAllan Stephens for (item = pl_ptr->next; item; item = next) { 93643608edcSAllan Stephens next = item->next; 93743608edcSAllan Stephens kfree(item); 93843608edcSAllan Stephens } 93943608edcSAllan Stephens } 94043608edcSAllan Stephens 941