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 1607a54d4a9SAllan Stephens static void bclink_update_last_sent(struct tipc_node *node, u32 seqno) 161b97bf3fdSPer Liden { 1627a54d4a9SAllan Stephens node->bclink.last_sent = less_eq(node->bclink.last_sent, seqno) ? 1637a54d4a9SAllan Stephens seqno : node->bclink.last_sent; 164b97bf3fdSPer Liden } 165b97bf3fdSPer Liden 166b97bf3fdSPer Liden 1677a54d4a9SAllan Stephens /* 16801d83eddSAllan Stephens * tipc_bclink_retransmit_to - get most recent node to request retransmission 16901d83eddSAllan Stephens * 17001d83eddSAllan Stephens * Called with bc_lock locked 17101d83eddSAllan Stephens */ 17201d83eddSAllan Stephens 17301d83eddSAllan Stephens struct tipc_node *tipc_bclink_retransmit_to(void) 17401d83eddSAllan Stephens { 17501d83eddSAllan Stephens return bclink->retransmit_to; 17601d83eddSAllan Stephens } 17701d83eddSAllan Stephens 17801d83eddSAllan Stephens /** 179b97bf3fdSPer Liden * bclink_retransmit_pkt - retransmit broadcast packets 180b97bf3fdSPer Liden * @after: sequence number of last packet to *not* retransmit 181b97bf3fdSPer Liden * @to: sequence number of last packet to retransmit 182b97bf3fdSPer Liden * 183d356eebaSAllan Stephens * Called with bc_lock locked 184b97bf3fdSPer Liden */ 185b97bf3fdSPer Liden 186b97bf3fdSPer Liden static void bclink_retransmit_pkt(u32 after, u32 to) 187b97bf3fdSPer Liden { 188b97bf3fdSPer Liden struct sk_buff *buf; 189b97bf3fdSPer Liden 190b97bf3fdSPer Liden buf = bcl->first_out; 191a016892cSAllan Stephens while (buf && less_eq(buf_seqno(buf), after)) 192b97bf3fdSPer Liden buf = buf->next; 1934323add6SPer Liden tipc_link_retransmit(bcl, buf, mod(to - after)); 194b97bf3fdSPer Liden } 195b97bf3fdSPer Liden 196b97bf3fdSPer Liden /** 1974323add6SPer Liden * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets 198b97bf3fdSPer Liden * @n_ptr: node that sent acknowledgement info 199b97bf3fdSPer Liden * @acked: broadcast sequence # that has been acknowledged 200b97bf3fdSPer Liden * 201b97bf3fdSPer Liden * Node is locked, bc_lock unlocked. 202b97bf3fdSPer Liden */ 203b97bf3fdSPer Liden 2046c00055aSDavid S. Miller void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked) 205b97bf3fdSPer Liden { 206b97bf3fdSPer Liden struct sk_buff *crs; 207b97bf3fdSPer Liden struct sk_buff *next; 208b97bf3fdSPer Liden unsigned int released = 0; 209b97bf3fdSPer Liden 210b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 211b97bf3fdSPer Liden 21236559591SAllan Stephens /* Bail out if tx queue is empty (no clean up is required) */ 213b97bf3fdSPer Liden crs = bcl->first_out; 21436559591SAllan Stephens if (!crs) 21536559591SAllan Stephens goto exit; 21636559591SAllan Stephens 21736559591SAllan Stephens /* Determine which messages need to be acknowledged */ 21836559591SAllan Stephens if (acked == INVALID_LINK_SEQ) { 21936559591SAllan Stephens /* 22036559591SAllan Stephens * Contact with specified node has been lost, so need to 22136559591SAllan Stephens * acknowledge sent messages only (if other nodes still exist) 22236559591SAllan Stephens * or both sent and unsent messages (otherwise) 22336559591SAllan Stephens */ 22436559591SAllan Stephens if (bclink->bcast_nodes.count) 22536559591SAllan Stephens acked = bcl->fsm_msg_cnt; 22636559591SAllan Stephens else 22736559591SAllan Stephens acked = bcl->next_out_no; 22836559591SAllan Stephens } else { 22936559591SAllan Stephens /* 23036559591SAllan Stephens * Bail out if specified sequence number does not correspond 23136559591SAllan Stephens * to a message that has been sent and not yet acknowledged 23236559591SAllan Stephens */ 23336559591SAllan Stephens if (less(acked, buf_seqno(crs)) || 23436559591SAllan Stephens less(bcl->fsm_msg_cnt, acked) || 23536559591SAllan Stephens less_eq(acked, n_ptr->bclink.acked)) 23636559591SAllan Stephens goto exit; 23736559591SAllan Stephens } 23836559591SAllan Stephens 23936559591SAllan Stephens /* Skip over packets that node has previously acknowledged */ 240a016892cSAllan Stephens while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) 241b97bf3fdSPer Liden crs = crs->next; 242b97bf3fdSPer Liden 243b97bf3fdSPer Liden /* Update packets that node is now acknowledging */ 244b97bf3fdSPer Liden 245b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), acked)) { 246b97bf3fdSPer Liden next = crs->next; 24710745cd5SAllan Stephens 24810745cd5SAllan Stephens if (crs != bcl->next_out) 249b97bf3fdSPer Liden bcbuf_decr_acks(crs); 25010745cd5SAllan Stephens else { 25110745cd5SAllan Stephens bcbuf_set_acks(crs, 0); 25210745cd5SAllan Stephens bcl->next_out = next; 25310745cd5SAllan Stephens bclink_set_last_sent(); 25410745cd5SAllan Stephens } 25510745cd5SAllan Stephens 256b97bf3fdSPer Liden if (bcbuf_acks(crs) == 0) { 257b97bf3fdSPer Liden bcl->first_out = next; 258b97bf3fdSPer Liden bcl->out_queue_size--; 2595f6d9123SAllan Stephens kfree_skb(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); 27436559591SAllan Stephens exit: 275b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 276b97bf3fdSPer Liden } 277b97bf3fdSPer Liden 2787a54d4a9SAllan Stephens /* 2797a54d4a9SAllan Stephens * tipc_bclink_update_link_state - update broadcast link state 280b97bf3fdSPer Liden * 2814323add6SPer Liden * tipc_net_lock and node lock set 282b97bf3fdSPer Liden */ 283b97bf3fdSPer Liden 2847a54d4a9SAllan Stephens void tipc_bclink_update_link_state(struct tipc_node *n_ptr, u32 last_sent) 285b97bf3fdSPer Liden { 286b97bf3fdSPer Liden struct sk_buff *buf; 287b97bf3fdSPer Liden 2887a54d4a9SAllan Stephens /* Ignore "stale" link state info */ 2897a54d4a9SAllan Stephens 2907a54d4a9SAllan Stephens if (less_eq(last_sent, n_ptr->bclink.last_in)) 291b97bf3fdSPer Liden return; 292b97bf3fdSPer Liden 2937a54d4a9SAllan Stephens /* Update link synchronization state; quit if in sync */ 2947a54d4a9SAllan Stephens 2957a54d4a9SAllan Stephens bclink_update_last_sent(n_ptr, last_sent); 2967a54d4a9SAllan Stephens 2977a54d4a9SAllan Stephens if (n_ptr->bclink.last_sent == n_ptr->bclink.last_in) 2987a54d4a9SAllan Stephens return; 2997a54d4a9SAllan Stephens 3007a54d4a9SAllan Stephens /* Update out-of-sync state; quit if loss is still unconfirmed */ 3017a54d4a9SAllan Stephens 3027a54d4a9SAllan Stephens if ((++n_ptr->bclink.oos_state) == 1) { 3037a54d4a9SAllan Stephens if (n_ptr->bclink.deferred_size < (TIPC_MIN_LINK_WIN / 2)) 3047a54d4a9SAllan Stephens return; 3057a54d4a9SAllan Stephens n_ptr->bclink.oos_state++; 3067a54d4a9SAllan Stephens } 3077a54d4a9SAllan Stephens 3087a54d4a9SAllan Stephens /* Don't NACK if one has been recently sent (or seen) */ 3097a54d4a9SAllan Stephens 3107a54d4a9SAllan Stephens if (n_ptr->bclink.oos_state & 0x1) 3117a54d4a9SAllan Stephens return; 3127a54d4a9SAllan Stephens 3137a54d4a9SAllan Stephens /* Send NACK */ 3147a54d4a9SAllan Stephens 31531e3c3f6Sstephen hemminger buf = tipc_buf_acquire(INT_H_SIZE); 316b97bf3fdSPer Liden if (buf) { 3177a54d4a9SAllan Stephens struct tipc_msg *msg = buf_msg(buf); 3187a54d4a9SAllan Stephens 319c68ca7b7SAllan Stephens tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG, 32075715217SAllan Stephens INT_H_SIZE, n_ptr->addr); 321bf781ecfSAllan Stephens msg_set_non_seq(msg, 1); 322b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 3237a54d4a9SAllan Stephens msg_set_bcast_ack(msg, n_ptr->bclink.last_in); 3247a54d4a9SAllan Stephens msg_set_bcgap_after(msg, n_ptr->bclink.last_in); 3257a54d4a9SAllan Stephens msg_set_bcgap_to(msg, n_ptr->bclink.deferred_head 3267a54d4a9SAllan Stephens ? buf_seqno(n_ptr->bclink.deferred_head) - 1 3277a54d4a9SAllan Stephens : n_ptr->bclink.last_sent); 328b97bf3fdSPer Liden 32957732560SAllan Stephens spin_lock_bh(&bc_lock); 3300f38513dSAllan Stephens tipc_bearer_send(&bcbearer->bearer, buf, NULL); 331b97bf3fdSPer Liden bcl->stats.sent_nacks++; 33257732560SAllan Stephens spin_unlock_bh(&bc_lock); 3335f6d9123SAllan Stephens kfree_skb(buf); 334b97bf3fdSPer Liden 3357a54d4a9SAllan Stephens n_ptr->bclink.oos_state++; 3367a54d4a9SAllan Stephens } 3377a54d4a9SAllan Stephens } 3387a54d4a9SAllan Stephens 339b97bf3fdSPer Liden /* 3407a54d4a9SAllan Stephens * bclink_peek_nack - monitor retransmission requests sent by other nodes 341b97bf3fdSPer Liden * 3427a54d4a9SAllan Stephens * Delay any upcoming NACK by this node if another node has already 3437a54d4a9SAllan Stephens * requested the first message this node is going to ask for. 344b97bf3fdSPer Liden * 3454323add6SPer Liden * Only tipc_net_lock set. 346b97bf3fdSPer Liden */ 347b97bf3fdSPer Liden 3487a54d4a9SAllan Stephens static void bclink_peek_nack(struct tipc_msg *msg) 349b97bf3fdSPer Liden { 3507a54d4a9SAllan Stephens struct tipc_node *n_ptr = tipc_node_find(msg_destnode(msg)); 351b97bf3fdSPer Liden 3527a54d4a9SAllan Stephens if (unlikely(!n_ptr)) 353b97bf3fdSPer Liden return; 3547a54d4a9SAllan Stephens 3554323add6SPer Liden tipc_node_lock(n_ptr); 356b97bf3fdSPer Liden 3577a54d4a9SAllan Stephens if (n_ptr->bclink.supported && 3587a54d4a9SAllan Stephens (n_ptr->bclink.last_in != n_ptr->bclink.last_sent) && 3597a54d4a9SAllan Stephens (n_ptr->bclink.last_in == msg_bcgap_after(msg))) 3607a54d4a9SAllan Stephens n_ptr->bclink.oos_state = 2; 361b97bf3fdSPer Liden 3624323add6SPer Liden tipc_node_unlock(n_ptr); 363b97bf3fdSPer Liden } 364b97bf3fdSPer Liden 3657a54d4a9SAllan Stephens /* 3664323add6SPer Liden * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster 367b97bf3fdSPer Liden */ 368b97bf3fdSPer Liden 3694323add6SPer Liden int tipc_bclink_send_msg(struct sk_buff *buf) 370b97bf3fdSPer Liden { 371b97bf3fdSPer Liden int res; 372b97bf3fdSPer Liden 373b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 374b97bf3fdSPer Liden 3752b78f9a0SAllan Stephens if (!bclink->bcast_nodes.count) { 3762b78f9a0SAllan Stephens res = msg_data_sz(buf_msg(buf)); 3775f6d9123SAllan Stephens kfree_skb(buf); 3782b78f9a0SAllan Stephens goto exit; 3792b78f9a0SAllan Stephens } 3802b78f9a0SAllan Stephens 3814323add6SPer Liden res = tipc_link_send_buf(bcl, buf); 3829157bafbSAllan Stephens if (likely(res >= 0)) { 3835b1f7bdeSAllan Stephens bclink_set_last_sent(); 384b97bf3fdSPer Liden bcl->stats.queue_sz_counts++; 385b97bf3fdSPer Liden bcl->stats.accu_queue_sz += bcl->out_queue_size; 3869157bafbSAllan Stephens } 3872b78f9a0SAllan Stephens exit: 388b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 389b97bf3fdSPer Liden return res; 390b97bf3fdSPer Liden } 391b97bf3fdSPer Liden 39263e7f1acSAllan Stephens /* 39363e7f1acSAllan Stephens * bclink_accept_pkt - accept an incoming, in-sequence broadcast packet 39463e7f1acSAllan Stephens * 39563e7f1acSAllan Stephens * Called with both sending node's lock and bc_lock taken. 39663e7f1acSAllan Stephens */ 39763e7f1acSAllan Stephens 39863e7f1acSAllan Stephens static void bclink_accept_pkt(struct tipc_node *node, u32 seqno) 39963e7f1acSAllan Stephens { 40063e7f1acSAllan Stephens bclink_update_last_sent(node, seqno); 40163e7f1acSAllan Stephens node->bclink.last_in = seqno; 40263e7f1acSAllan Stephens node->bclink.oos_state = 0; 40363e7f1acSAllan Stephens bcl->stats.recv_info++; 40463e7f1acSAllan Stephens 40563e7f1acSAllan Stephens /* 40663e7f1acSAllan Stephens * Unicast an ACK periodically, ensuring that 40763e7f1acSAllan Stephens * all nodes in the cluster don't ACK at the same time 40863e7f1acSAllan Stephens */ 40963e7f1acSAllan Stephens 41063e7f1acSAllan Stephens if (((seqno - tipc_own_addr) % TIPC_MIN_LINK_WIN) == 0) { 41163e7f1acSAllan Stephens tipc_link_send_proto_msg( 41263e7f1acSAllan Stephens node->active_links[node->addr & 1], 41363e7f1acSAllan Stephens STATE_MSG, 0, 0, 0, 0, 0); 41463e7f1acSAllan Stephens bcl->stats.sent_acks++; 41563e7f1acSAllan Stephens } 41663e7f1acSAllan Stephens } 41763e7f1acSAllan Stephens 41863e7f1acSAllan Stephens /* 4194323add6SPer Liden * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards 420b97bf3fdSPer Liden * 4214323add6SPer Liden * tipc_net_lock is read_locked, no other locks set 422b97bf3fdSPer Liden */ 423b97bf3fdSPer Liden 4244323add6SPer Liden void tipc_bclink_recv_pkt(struct sk_buff *buf) 425b97bf3fdSPer Liden { 426b97bf3fdSPer Liden struct tipc_msg *msg = buf_msg(buf); 4275d3c488dSAllan Stephens struct tipc_node *node; 428b97bf3fdSPer Liden u32 next_in; 429b97bf3fdSPer Liden u32 seqno; 4308a275a6aSAllan Stephens int deferred; 431b97bf3fdSPer Liden 4325d3c488dSAllan Stephens /* Screen out unwanted broadcast messages */ 4335d3c488dSAllan Stephens 4345d3c488dSAllan Stephens if (msg_mc_netid(msg) != tipc_net_id) 4355d3c488dSAllan Stephens goto exit; 4365d3c488dSAllan Stephens 4375d3c488dSAllan Stephens node = tipc_node_find(msg_prevnode(msg)); 4385d3c488dSAllan Stephens if (unlikely(!node)) 4395d3c488dSAllan Stephens goto exit; 4405d3c488dSAllan Stephens 4415d3c488dSAllan Stephens tipc_node_lock(node); 4425d3c488dSAllan Stephens if (unlikely(!node->bclink.supported)) 4435d3c488dSAllan Stephens goto unlock; 444b97bf3fdSPer Liden 4458a275a6aSAllan Stephens /* Handle broadcast protocol message */ 4468a275a6aSAllan Stephens 447b97bf3fdSPer Liden if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { 4489f6bdcd4SAllan Stephens if (msg_type(msg) != STATE_MSG) 4499f6bdcd4SAllan Stephens goto unlock; 450b97bf3fdSPer Liden if (msg_destnode(msg) == tipc_own_addr) { 4514323add6SPer Liden tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); 4524323add6SPer Liden tipc_node_unlock(node); 453d356eebaSAllan Stephens spin_lock_bh(&bc_lock); 454b97bf3fdSPer Liden bcl->stats.recv_nacks++; 45501d83eddSAllan Stephens bclink->retransmit_to = node; 456b97bf3fdSPer Liden bclink_retransmit_pkt(msg_bcgap_after(msg), 457b97bf3fdSPer Liden msg_bcgap_to(msg)); 458d356eebaSAllan Stephens spin_unlock_bh(&bc_lock); 459b97bf3fdSPer Liden } else { 4605d3c488dSAllan Stephens tipc_node_unlock(node); 4617a54d4a9SAllan Stephens bclink_peek_nack(msg); 462b97bf3fdSPer Liden } 4635d3c488dSAllan Stephens goto exit; 464b97bf3fdSPer Liden } 465b97bf3fdSPer Liden 4665d3c488dSAllan Stephens /* Handle in-sequence broadcast message */ 4675d3c488dSAllan Stephens 468b97bf3fdSPer Liden seqno = msg_seqno(msg); 4698a275a6aSAllan Stephens next_in = mod(node->bclink.last_in + 1); 470b97bf3fdSPer Liden 471b97bf3fdSPer Liden if (likely(seqno == next_in)) { 4728a275a6aSAllan Stephens receive: 4737a54d4a9SAllan Stephens /* Deliver message to destination */ 4747a54d4a9SAllan Stephens 475b97bf3fdSPer Liden if (likely(msg_isdata(msg))) { 47663e7f1acSAllan Stephens spin_lock_bh(&bc_lock); 47763e7f1acSAllan Stephens bclink_accept_pkt(node, seqno); 478b98158e3SAllan Stephens spin_unlock_bh(&bc_lock); 4794323add6SPer Liden tipc_node_unlock(node); 4809f6bdcd4SAllan Stephens if (likely(msg_mcast(msg))) 4814323add6SPer Liden tipc_port_recv_mcast(buf, NULL); 4829f6bdcd4SAllan Stephens else 4835f6d9123SAllan Stephens kfree_skb(buf); 484b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_BUNDLER) { 48563e7f1acSAllan Stephens spin_lock_bh(&bc_lock); 48663e7f1acSAllan Stephens bclink_accept_pkt(node, seqno); 487b97bf3fdSPer Liden bcl->stats.recv_bundles++; 488b97bf3fdSPer Liden bcl->stats.recv_bundled += msg_msgcnt(msg); 489b98158e3SAllan Stephens spin_unlock_bh(&bc_lock); 4904323add6SPer Liden tipc_node_unlock(node); 4914323add6SPer Liden tipc_link_recv_bundle(buf); 492b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_FRAGMENTER) { 49363e7f1acSAllan Stephens int ret = tipc_link_recv_fragment(&node->bclink.defragm, 49463e7f1acSAllan Stephens &buf, &msg); 49563e7f1acSAllan Stephens if (ret < 0) 49663e7f1acSAllan Stephens goto unlock; 49763e7f1acSAllan Stephens spin_lock_bh(&bc_lock); 49863e7f1acSAllan Stephens bclink_accept_pkt(node, seqno); 499b97bf3fdSPer Liden bcl->stats.recv_fragments++; 50063e7f1acSAllan Stephens if (ret > 0) 501b97bf3fdSPer Liden bcl->stats.recv_fragmented++; 502b98158e3SAllan Stephens spin_unlock_bh(&bc_lock); 5034323add6SPer Liden tipc_node_unlock(node); 5044323add6SPer Liden tipc_net_route_msg(buf); 5059f6bdcd4SAllan Stephens } else if (msg_user(msg) == NAME_DISTRIBUTOR) { 50663e7f1acSAllan Stephens spin_lock_bh(&bc_lock); 50763e7f1acSAllan Stephens bclink_accept_pkt(node, seqno); 508b98158e3SAllan Stephens spin_unlock_bh(&bc_lock); 5099f6bdcd4SAllan Stephens tipc_node_unlock(node); 5109f6bdcd4SAllan Stephens tipc_named_recv(buf); 511b97bf3fdSPer Liden } else { 51263e7f1acSAllan Stephens spin_lock_bh(&bc_lock); 51363e7f1acSAllan Stephens bclink_accept_pkt(node, seqno); 514b98158e3SAllan Stephens spin_unlock_bh(&bc_lock); 5154323add6SPer Liden tipc_node_unlock(node); 5165f6d9123SAllan Stephens kfree_skb(buf); 517b97bf3fdSPer Liden } 5185d3c488dSAllan Stephens buf = NULL; 5198a275a6aSAllan Stephens 5208a275a6aSAllan Stephens /* Determine new synchronization state */ 5218a275a6aSAllan Stephens 5224323add6SPer Liden tipc_node_lock(node); 5238a275a6aSAllan Stephens if (unlikely(!tipc_node_is_up(node))) 5248a275a6aSAllan Stephens goto unlock; 5258a275a6aSAllan Stephens 5267a54d4a9SAllan Stephens if (node->bclink.last_in == node->bclink.last_sent) 5278a275a6aSAllan Stephens goto unlock; 5288a275a6aSAllan Stephens 5297a54d4a9SAllan Stephens if (!node->bclink.deferred_head) { 5307a54d4a9SAllan Stephens node->bclink.oos_state = 1; 5317a54d4a9SAllan Stephens goto unlock; 5327a54d4a9SAllan Stephens } 5337a54d4a9SAllan Stephens 5348a275a6aSAllan Stephens msg = buf_msg(node->bclink.deferred_head); 5358a275a6aSAllan Stephens seqno = msg_seqno(msg); 5368a275a6aSAllan Stephens next_in = mod(next_in + 1); 5378a275a6aSAllan Stephens if (seqno != next_in) 5388a275a6aSAllan Stephens goto unlock; 5398a275a6aSAllan Stephens 5408a275a6aSAllan Stephens /* Take in-sequence message from deferred queue & deliver it */ 5418a275a6aSAllan Stephens 5428a275a6aSAllan Stephens buf = node->bclink.deferred_head; 5438a275a6aSAllan Stephens node->bclink.deferred_head = buf->next; 5447a54d4a9SAllan Stephens node->bclink.deferred_size--; 545b97bf3fdSPer Liden goto receive; 546b97bf3fdSPer Liden } 5478a275a6aSAllan Stephens 5488a275a6aSAllan Stephens /* Handle out-of-sequence broadcast message */ 5498a275a6aSAllan Stephens 5508a275a6aSAllan Stephens if (less(next_in, seqno)) { 5518a275a6aSAllan Stephens deferred = tipc_link_defer_pkt(&node->bclink.deferred_head, 552b97bf3fdSPer Liden &node->bclink.deferred_tail, 5538a275a6aSAllan Stephens buf); 5547a54d4a9SAllan Stephens node->bclink.deferred_size += deferred; 5557a54d4a9SAllan Stephens bclink_update_last_sent(node, seqno); 5565d3c488dSAllan Stephens buf = NULL; 5578a275a6aSAllan Stephens } else 5588a275a6aSAllan Stephens deferred = 0; 5598a275a6aSAllan Stephens 560b98158e3SAllan Stephens spin_lock_bh(&bc_lock); 561b98158e3SAllan Stephens 5628a275a6aSAllan Stephens if (deferred) 5638a275a6aSAllan Stephens bcl->stats.deferred_recv++; 5640232c5a5SAllan Stephens else 5650232c5a5SAllan Stephens bcl->stats.duplicates++; 5668a275a6aSAllan Stephens 567b98158e3SAllan Stephens spin_unlock_bh(&bc_lock); 568b98158e3SAllan Stephens 5695d3c488dSAllan Stephens unlock: 5704323add6SPer Liden tipc_node_unlock(node); 5715d3c488dSAllan Stephens exit: 5725f6d9123SAllan Stephens kfree_skb(buf); 573b97bf3fdSPer Liden } 574b97bf3fdSPer Liden 5756c00055aSDavid S. Miller u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) 576b97bf3fdSPer Liden { 577b97bf3fdSPer Liden return (n_ptr->bclink.supported && 5784323add6SPer Liden (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); 579b97bf3fdSPer Liden } 580b97bf3fdSPer Liden 581b97bf3fdSPer Liden 582b97bf3fdSPer Liden /** 5834323add6SPer Liden * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer 584b97bf3fdSPer Liden * 5852ff9f924SAllan Stephens * Send packet over as many bearers as necessary to reach all nodes 5862ff9f924SAllan Stephens * that have joined the broadcast link. 587b97bf3fdSPer Liden * 5882ff9f924SAllan Stephens * Returns 0 (packet sent successfully) under all circumstances, 5892ff9f924SAllan Stephens * since the broadcast link's pseudo-bearer never blocks 590b97bf3fdSPer Liden */ 591b97bf3fdSPer Liden 592988f088aSAdrian Bunk static int tipc_bcbearer_send(struct sk_buff *buf, 593b97bf3fdSPer Liden struct tipc_bearer *unused1, 594b97bf3fdSPer Liden struct tipc_media_addr *unused2) 595b97bf3fdSPer Liden { 596b97bf3fdSPer Liden int bp_index; 597b97bf3fdSPer Liden 5982ff9f924SAllan Stephens /* 5992ff9f924SAllan Stephens * Prepare broadcast link message for reliable transmission, 6002ff9f924SAllan Stephens * if first time trying to send it; 6012ff9f924SAllan Stephens * preparation is skipped for broadcast link protocol messages 6022ff9f924SAllan Stephens * since they are sent in an unreliable manner and don't need it 6032ff9f924SAllan Stephens */ 604b97bf3fdSPer Liden 605b97bf3fdSPer Liden if (likely(!msg_non_seq(buf_msg(buf)))) { 606b97bf3fdSPer Liden struct tipc_msg *msg; 607b97bf3fdSPer Liden 608cd3decdfSAllan Stephens bcbuf_set_acks(buf, bclink->bcast_nodes.count); 609b97bf3fdSPer Liden msg = buf_msg(buf); 61040aecb1bSAllan Stephens msg_set_non_seq(msg, 1); 611b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 6120048b826SAllan Stephens bcl->stats.sent_info++; 6135e726900SAllan Stephens 614cd3decdfSAllan Stephens if (WARN_ON(!bclink->bcast_nodes.count)) { 6155e726900SAllan Stephens dump_stack(); 6165e726900SAllan Stephens return 0; 6175e726900SAllan Stephens } 618b97bf3fdSPer Liden } 619b97bf3fdSPer Liden 620b97bf3fdSPer Liden /* Send buffer over bearers until all targets reached */ 621b97bf3fdSPer Liden 622cd3decdfSAllan Stephens bcbearer->remains = bclink->bcast_nodes; 623b97bf3fdSPer Liden 624b97bf3fdSPer Liden for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { 6252d627b92SAllan Stephens struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary; 6262d627b92SAllan Stephens struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary; 627b97bf3fdSPer Liden 628b97bf3fdSPer Liden if (!p) 629b97bf3fdSPer Liden break; /* no more bearers to try */ 630b97bf3fdSPer Liden 63165f51ef0SAllan Stephens tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new); 63265f51ef0SAllan Stephens if (bcbearer->remains_new.count == bcbearer->remains.count) 633b97bf3fdSPer Liden continue; /* bearer pair doesn't add anything */ 634b97bf3fdSPer Liden 6352d627b92SAllan Stephens if (p->blocked || 6362d627b92SAllan Stephens p->media->send_msg(buf, p, &p->media->bcast_addr)) { 6371a624832SNeil Horman /* unable to send on primary bearer */ 6382d627b92SAllan Stephens if (!s || s->blocked || 6392d627b92SAllan Stephens s->media->send_msg(buf, s, 6401a624832SNeil Horman &s->media->bcast_addr)) { 6411a624832SNeil Horman /* unable to send on either bearer */ 6421a624832SNeil Horman continue; 6431a624832SNeil Horman } 644b97bf3fdSPer Liden } 645b97bf3fdSPer Liden 6461a624832SNeil Horman if (s) { 647b97bf3fdSPer Liden bcbearer->bpairs[bp_index].primary = s; 648b97bf3fdSPer Liden bcbearer->bpairs[bp_index].secondary = p; 6491a624832SNeil Horman } 6501a624832SNeil Horman 65165f51ef0SAllan Stephens if (bcbearer->remains_new.count == 0) 6522ff9f924SAllan Stephens break; /* all targets reached */ 653b97bf3fdSPer Liden 65465f51ef0SAllan Stephens bcbearer->remains = bcbearer->remains_new; 655b97bf3fdSPer Liden } 656b97bf3fdSPer Liden 6572ff9f924SAllan Stephens return 0; 658b97bf3fdSPer Liden } 659b97bf3fdSPer Liden 660b97bf3fdSPer Liden /** 6614323add6SPer Liden * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer 662b97bf3fdSPer Liden */ 663b97bf3fdSPer Liden 6644323add6SPer Liden void tipc_bcbearer_sort(void) 665b97bf3fdSPer Liden { 6667f9ab6acSPaul Gortmaker struct tipc_bcbearer_pair *bp_temp = bcbearer->bpairs_temp; 6677f9ab6acSPaul Gortmaker struct tipc_bcbearer_pair *bp_curr; 668b97bf3fdSPer Liden int b_index; 669b97bf3fdSPer Liden int pri; 670b97bf3fdSPer Liden 671b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 672b97bf3fdSPer Liden 673b97bf3fdSPer Liden /* Group bearers by priority (can assume max of two per priority) */ 674b97bf3fdSPer Liden 675b97bf3fdSPer Liden memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); 676b97bf3fdSPer Liden 677b97bf3fdSPer Liden for (b_index = 0; b_index < MAX_BEARERS; b_index++) { 6782d627b92SAllan Stephens struct tipc_bearer *b = &tipc_bearers[b_index]; 679b97bf3fdSPer Liden 680b97bf3fdSPer Liden if (!b->active || !b->nodes.count) 681b97bf3fdSPer Liden continue; 682b97bf3fdSPer Liden 683b97bf3fdSPer Liden if (!bp_temp[b->priority].primary) 684b97bf3fdSPer Liden bp_temp[b->priority].primary = b; 685b97bf3fdSPer Liden else 686b97bf3fdSPer Liden bp_temp[b->priority].secondary = b; 687b97bf3fdSPer Liden } 688b97bf3fdSPer Liden 689b97bf3fdSPer Liden /* Create array of bearer pairs for broadcasting */ 690b97bf3fdSPer Liden 691b97bf3fdSPer Liden bp_curr = bcbearer->bpairs; 692b97bf3fdSPer Liden memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); 693b97bf3fdSPer Liden 69416cb4b33SPer Liden for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { 695b97bf3fdSPer Liden 696b97bf3fdSPer Liden if (!bp_temp[pri].primary) 697b97bf3fdSPer Liden continue; 698b97bf3fdSPer Liden 699b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].primary; 700b97bf3fdSPer Liden 701b97bf3fdSPer Liden if (bp_temp[pri].secondary) { 7024323add6SPer Liden if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, 703b97bf3fdSPer Liden &bp_temp[pri].secondary->nodes)) { 704b97bf3fdSPer Liden bp_curr->secondary = bp_temp[pri].secondary; 705b97bf3fdSPer Liden } else { 706b97bf3fdSPer Liden bp_curr++; 707b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].secondary; 708b97bf3fdSPer Liden } 709b97bf3fdSPer Liden } 710b97bf3fdSPer Liden 711b97bf3fdSPer Liden bp_curr++; 712b97bf3fdSPer Liden } 713b97bf3fdSPer Liden 714b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 715b97bf3fdSPer Liden } 716b97bf3fdSPer Liden 717b97bf3fdSPer Liden 7184323add6SPer Liden int tipc_bclink_stats(char *buf, const u32 buf_size) 719b97bf3fdSPer Liden { 720b97bf3fdSPer Liden struct print_buf pb; 721b97bf3fdSPer Liden 722b97bf3fdSPer Liden if (!bcl) 723b97bf3fdSPer Liden return 0; 724b97bf3fdSPer Liden 7254323add6SPer Liden tipc_printbuf_init(&pb, buf, buf_size); 726b97bf3fdSPer Liden 727b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 728b97bf3fdSPer Liden 729b97bf3fdSPer Liden tipc_printf(&pb, "Link <%s>\n" 730b97bf3fdSPer Liden " Window:%u packets\n", 731b97bf3fdSPer Liden bcl->name, bcl->queue_limit[0]); 732b97bf3fdSPer Liden tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n", 733b97bf3fdSPer Liden bcl->stats.recv_info, 734b97bf3fdSPer Liden bcl->stats.recv_fragments, 735b97bf3fdSPer Liden bcl->stats.recv_fragmented, 736b97bf3fdSPer Liden bcl->stats.recv_bundles, 737b97bf3fdSPer Liden bcl->stats.recv_bundled); 738b97bf3fdSPer Liden tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n", 739b97bf3fdSPer Liden bcl->stats.sent_info, 740b97bf3fdSPer Liden bcl->stats.sent_fragments, 741b97bf3fdSPer Liden bcl->stats.sent_fragmented, 742b97bf3fdSPer Liden bcl->stats.sent_bundles, 743b97bf3fdSPer Liden bcl->stats.sent_bundled); 744b97bf3fdSPer Liden tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n", 745b97bf3fdSPer Liden bcl->stats.recv_nacks, 746b97bf3fdSPer Liden bcl->stats.deferred_recv, 747b97bf3fdSPer Liden bcl->stats.duplicates); 748b97bf3fdSPer Liden tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n", 749b97bf3fdSPer Liden bcl->stats.sent_nacks, 750b97bf3fdSPer Liden bcl->stats.sent_acks, 751b97bf3fdSPer Liden bcl->stats.retransmitted); 752b97bf3fdSPer Liden tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n", 753b97bf3fdSPer Liden bcl->stats.bearer_congs, 754b97bf3fdSPer Liden bcl->stats.link_congs, 755b97bf3fdSPer Liden bcl->stats.max_queue_sz, 756b97bf3fdSPer Liden bcl->stats.queue_sz_counts 757b97bf3fdSPer Liden ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts) 758b97bf3fdSPer Liden : 0); 759b97bf3fdSPer Liden 760b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7614323add6SPer Liden return tipc_printbuf_validate(&pb); 762b97bf3fdSPer Liden } 763b97bf3fdSPer Liden 7644323add6SPer Liden int tipc_bclink_reset_stats(void) 765b97bf3fdSPer Liden { 766b97bf3fdSPer Liden if (!bcl) 767b97bf3fdSPer Liden return -ENOPROTOOPT; 768b97bf3fdSPer Liden 769b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 770b97bf3fdSPer Liden memset(&bcl->stats, 0, sizeof(bcl->stats)); 771b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7720e35fd5eSAllan Stephens return 0; 773b97bf3fdSPer Liden } 774b97bf3fdSPer Liden 7754323add6SPer Liden int tipc_bclink_set_queue_limits(u32 limit) 776b97bf3fdSPer Liden { 777b97bf3fdSPer Liden if (!bcl) 778b97bf3fdSPer Liden return -ENOPROTOOPT; 779b97bf3fdSPer Liden if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) 780b97bf3fdSPer Liden return -EINVAL; 781b97bf3fdSPer Liden 782b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 7834323add6SPer Liden tipc_link_set_queue_limits(bcl, limit); 784b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 7850e35fd5eSAllan Stephens return 0; 786b97bf3fdSPer Liden } 787b97bf3fdSPer Liden 788c47e9b91SAllan Stephens void tipc_bclink_init(void) 789b97bf3fdSPer Liden { 790b97bf3fdSPer Liden INIT_LIST_HEAD(&bcbearer->bearer.cong_links); 791b97bf3fdSPer Liden bcbearer->bearer.media = &bcbearer->media; 7924323add6SPer Liden bcbearer->media.send_msg = tipc_bcbearer_send; 7932e2d9be8SAllan Stephens sprintf(bcbearer->media.name, "tipc-broadcast"); 794b97bf3fdSPer Liden 795b97bf3fdSPer Liden INIT_LIST_HEAD(&bcl->waiting_ports); 796b97bf3fdSPer Liden bcl->next_out_no = 1; 79734af946aSIngo Molnar spin_lock_init(&bclink->node.lock); 798b97bf3fdSPer Liden bcl->owner = &bclink->node; 799b97bf3fdSPer Liden bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; 8004323add6SPer Liden tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); 801b97bf3fdSPer Liden bcl->b_ptr = &bcbearer->bearer; 802b97bf3fdSPer Liden bcl->state = WORKING_WORKING; 8034b704d59SStephen Hemminger strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME); 804b97bf3fdSPer Liden } 805b97bf3fdSPer Liden 8064323add6SPer Liden void tipc_bclink_stop(void) 807b97bf3fdSPer Liden { 808b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 8094323add6SPer Liden tipc_link_stop(bcl); 810b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 811c47e9b91SAllan Stephens 812c47e9b91SAllan Stephens memset(bclink, 0, sizeof(*bclink)); 813c47e9b91SAllan Stephens memset(bcbearer, 0, sizeof(*bcbearer)); 814b97bf3fdSPer Liden } 815b97bf3fdSPer Liden 8163e22e62bSAllan Stephens 8173e22e62bSAllan Stephens /** 8183e22e62bSAllan Stephens * tipc_nmap_add - add a node to a node map 8193e22e62bSAllan Stephens */ 8203e22e62bSAllan Stephens 8213e22e62bSAllan Stephens void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node) 8223e22e62bSAllan Stephens { 8233e22e62bSAllan Stephens int n = tipc_node(node); 8243e22e62bSAllan Stephens int w = n / WSIZE; 8253e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8263e22e62bSAllan Stephens 8273e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) == 0) { 8283e22e62bSAllan Stephens nm_ptr->count++; 8293e22e62bSAllan Stephens nm_ptr->map[w] |= mask; 8303e22e62bSAllan Stephens } 8313e22e62bSAllan Stephens } 8323e22e62bSAllan Stephens 8333e22e62bSAllan Stephens /** 8343e22e62bSAllan Stephens * tipc_nmap_remove - remove a node from a node map 8353e22e62bSAllan Stephens */ 8363e22e62bSAllan Stephens 8373e22e62bSAllan Stephens void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node) 8383e22e62bSAllan Stephens { 8393e22e62bSAllan Stephens int n = tipc_node(node); 8403e22e62bSAllan Stephens int w = n / WSIZE; 8413e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8423e22e62bSAllan Stephens 8433e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) != 0) { 8443e22e62bSAllan Stephens nm_ptr->map[w] &= ~mask; 8453e22e62bSAllan Stephens nm_ptr->count--; 8463e22e62bSAllan Stephens } 8473e22e62bSAllan Stephens } 8483e22e62bSAllan Stephens 8493e22e62bSAllan Stephens /** 8503e22e62bSAllan Stephens * tipc_nmap_diff - find differences between node maps 8513e22e62bSAllan Stephens * @nm_a: input node map A 8523e22e62bSAllan Stephens * @nm_b: input node map B 8533e22e62bSAllan Stephens * @nm_diff: output node map A-B (i.e. nodes of A that are not in B) 8543e22e62bSAllan Stephens */ 8553e22e62bSAllan Stephens 85631e3c3f6Sstephen hemminger static void tipc_nmap_diff(struct tipc_node_map *nm_a, 85731e3c3f6Sstephen hemminger struct tipc_node_map *nm_b, 8583e22e62bSAllan Stephens struct tipc_node_map *nm_diff) 8593e22e62bSAllan Stephens { 8603e22e62bSAllan Stephens int stop = ARRAY_SIZE(nm_a->map); 8613e22e62bSAllan Stephens int w; 8623e22e62bSAllan Stephens int b; 8633e22e62bSAllan Stephens u32 map; 8643e22e62bSAllan Stephens 8653e22e62bSAllan Stephens memset(nm_diff, 0, sizeof(*nm_diff)); 8663e22e62bSAllan Stephens for (w = 0; w < stop; w++) { 8673e22e62bSAllan Stephens map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]); 8683e22e62bSAllan Stephens nm_diff->map[w] = map; 8693e22e62bSAllan Stephens if (map != 0) { 8703e22e62bSAllan Stephens for (b = 0 ; b < WSIZE; b++) { 8713e22e62bSAllan Stephens if (map & (1 << b)) 8723e22e62bSAllan Stephens nm_diff->count++; 8733e22e62bSAllan Stephens } 8743e22e62bSAllan Stephens } 8753e22e62bSAllan Stephens } 8763e22e62bSAllan Stephens } 87743608edcSAllan Stephens 87843608edcSAllan Stephens /** 87943608edcSAllan Stephens * tipc_port_list_add - add a port to a port list, ensuring no duplicates 88043608edcSAllan Stephens */ 88143608edcSAllan Stephens 8824584310bSPaul Gortmaker void tipc_port_list_add(struct tipc_port_list *pl_ptr, u32 port) 88343608edcSAllan Stephens { 8844584310bSPaul Gortmaker struct tipc_port_list *item = pl_ptr; 88543608edcSAllan Stephens int i; 88643608edcSAllan Stephens int item_sz = PLSIZE; 88743608edcSAllan Stephens int cnt = pl_ptr->count; 88843608edcSAllan Stephens 88943608edcSAllan Stephens for (; ; cnt -= item_sz, item = item->next) { 89043608edcSAllan Stephens if (cnt < PLSIZE) 89143608edcSAllan Stephens item_sz = cnt; 89243608edcSAllan Stephens for (i = 0; i < item_sz; i++) 89343608edcSAllan Stephens if (item->ports[i] == port) 89443608edcSAllan Stephens return; 89543608edcSAllan Stephens if (i < PLSIZE) { 89643608edcSAllan Stephens item->ports[i] = port; 89743608edcSAllan Stephens pl_ptr->count++; 89843608edcSAllan Stephens return; 89943608edcSAllan Stephens } 90043608edcSAllan Stephens if (!item->next) { 90143608edcSAllan Stephens item->next = kmalloc(sizeof(*item), GFP_ATOMIC); 90243608edcSAllan Stephens if (!item->next) { 90343608edcSAllan Stephens warn("Incomplete multicast delivery, no memory\n"); 90443608edcSAllan Stephens return; 90543608edcSAllan Stephens } 90643608edcSAllan Stephens item->next->next = NULL; 90743608edcSAllan Stephens } 90843608edcSAllan Stephens } 90943608edcSAllan Stephens } 91043608edcSAllan Stephens 91143608edcSAllan Stephens /** 91243608edcSAllan Stephens * tipc_port_list_free - free dynamically created entries in port_list chain 91343608edcSAllan Stephens * 91443608edcSAllan Stephens */ 91543608edcSAllan Stephens 9164584310bSPaul Gortmaker void tipc_port_list_free(struct tipc_port_list *pl_ptr) 91743608edcSAllan Stephens { 9184584310bSPaul Gortmaker struct tipc_port_list *item; 9194584310bSPaul Gortmaker struct tipc_port_list *next; 92043608edcSAllan Stephens 92143608edcSAllan Stephens for (item = pl_ptr->next; item; item = next) { 92243608edcSAllan Stephens next = item->next; 92343608edcSAllan Stephens kfree(item); 92443608edcSAllan Stephens } 92543608edcSAllan Stephens } 92643608edcSAllan Stephens 927