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 */ 767f9ab6acSPaul Gortmaker struct tipc_bcbearer { 772d627b92SAllan Stephens struct tipc_bearer bearer; 78358a0d1cSPaul Gortmaker struct tipc_media media; 797f9ab6acSPaul Gortmaker struct tipc_bcbearer_pair bpairs[MAX_BEARERS]; 807f9ab6acSPaul Gortmaker struct tipc_bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1]; 816c00055aSDavid S. Miller struct tipc_node_map remains; 826c00055aSDavid S. Miller struct tipc_node_map remains_new; 83b97bf3fdSPer Liden }; 84b97bf3fdSPer Liden 85b97bf3fdSPer Liden /** 866765fd67SPaul Gortmaker * struct tipc_bclink - link used for broadcast messages 87b97bf3fdSPer Liden * @link: (non-standard) broadcast link structure 88b97bf3fdSPer Liden * @node: (non-standard) node structure representing b'cast link's peer node 89cd3decdfSAllan Stephens * @bcast_nodes: map of broadcast-capable nodes 9001d83eddSAllan Stephens * @retransmit_to: node that most recently requested a retransmit 91b97bf3fdSPer Liden * 92b97bf3fdSPer Liden * Handles sequence numbering, fragmentation, bundling, etc. 93b97bf3fdSPer Liden */ 946765fd67SPaul Gortmaker struct tipc_bclink { 95a18c4bc3SPaul Gortmaker struct tipc_link link; 966c00055aSDavid S. Miller struct tipc_node node; 97cd3decdfSAllan Stephens struct tipc_node_map bcast_nodes; 9801d83eddSAllan Stephens struct tipc_node *retransmit_to; 99b97bf3fdSPer Liden }; 100b97bf3fdSPer Liden 1017f9ab6acSPaul Gortmaker static struct tipc_bcbearer bcast_bearer; 1026765fd67SPaul Gortmaker static struct tipc_bclink bcast_link; 103b97bf3fdSPer Liden 1047f9ab6acSPaul Gortmaker static struct tipc_bcbearer *bcbearer = &bcast_bearer; 1056765fd67SPaul Gortmaker static struct tipc_bclink *bclink = &bcast_link; 106a18c4bc3SPaul Gortmaker static struct tipc_link *bcl = &bcast_link.link; 107c47e9b91SAllan Stephens 10834af946aSIngo Molnar static DEFINE_SPINLOCK(bc_lock); 109b97bf3fdSPer Liden 1103aec9cc9SAllan Stephens const char tipc_bclink_name[] = "broadcast-link"; 111b97bf3fdSPer Liden 11231e3c3f6Sstephen hemminger static void tipc_nmap_diff(struct tipc_node_map *nm_a, 11331e3c3f6Sstephen hemminger struct tipc_node_map *nm_b, 11431e3c3f6Sstephen hemminger struct tipc_node_map *nm_diff); 115b97bf3fdSPer Liden 11605790c64SSam Ravnborg static u32 bcbuf_acks(struct sk_buff *buf) 117b97bf3fdSPer Liden { 118880b005fSDavid S. Miller return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle; 119b97bf3fdSPer Liden } 120b97bf3fdSPer Liden 12105790c64SSam Ravnborg static void bcbuf_set_acks(struct sk_buff *buf, u32 acks) 122b97bf3fdSPer Liden { 123880b005fSDavid S. Miller TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks; 124b97bf3fdSPer Liden } 125b97bf3fdSPer Liden 12605790c64SSam Ravnborg static void bcbuf_decr_acks(struct sk_buff *buf) 127b97bf3fdSPer Liden { 128b97bf3fdSPer Liden bcbuf_set_acks(buf, bcbuf_acks(buf) - 1); 129b97bf3fdSPer Liden } 130b97bf3fdSPer Liden 131cd3decdfSAllan Stephens void tipc_bclink_add_node(u32 addr) 132cd3decdfSAllan Stephens { 133cd3decdfSAllan Stephens spin_lock_bh(&bc_lock); 134cd3decdfSAllan Stephens tipc_nmap_add(&bclink->bcast_nodes, addr); 135cd3decdfSAllan Stephens spin_unlock_bh(&bc_lock); 136cd3decdfSAllan Stephens } 137cd3decdfSAllan Stephens 138cd3decdfSAllan Stephens void tipc_bclink_remove_node(u32 addr) 139cd3decdfSAllan Stephens { 140cd3decdfSAllan Stephens spin_lock_bh(&bc_lock); 141cd3decdfSAllan Stephens tipc_nmap_remove(&bclink->bcast_nodes, addr); 142cd3decdfSAllan Stephens spin_unlock_bh(&bc_lock); 143cd3decdfSAllan Stephens } 144b97bf3fdSPer Liden 1455b1f7bdeSAllan Stephens static void bclink_set_last_sent(void) 1465b1f7bdeSAllan Stephens { 1475b1f7bdeSAllan Stephens if (bcl->next_out) 1485b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1); 1495b1f7bdeSAllan Stephens else 1505b1f7bdeSAllan Stephens bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1); 1515b1f7bdeSAllan Stephens } 1525b1f7bdeSAllan Stephens 1535b1f7bdeSAllan Stephens u32 tipc_bclink_get_last_sent(void) 1545b1f7bdeSAllan Stephens { 1555b1f7bdeSAllan Stephens return bcl->fsm_msg_cnt; 1565b1f7bdeSAllan Stephens } 1575b1f7bdeSAllan Stephens 1587a54d4a9SAllan Stephens static void bclink_update_last_sent(struct tipc_node *node, u32 seqno) 159b97bf3fdSPer Liden { 1607a54d4a9SAllan Stephens node->bclink.last_sent = less_eq(node->bclink.last_sent, seqno) ? 1617a54d4a9SAllan Stephens seqno : node->bclink.last_sent; 162b97bf3fdSPer Liden } 163b97bf3fdSPer Liden 164b97bf3fdSPer Liden 1652c53040fSBen Hutchings /** 16601d83eddSAllan Stephens * tipc_bclink_retransmit_to - get most recent node to request retransmission 16701d83eddSAllan Stephens * 16801d83eddSAllan Stephens * Called with bc_lock locked 16901d83eddSAllan Stephens */ 17001d83eddSAllan Stephens struct tipc_node *tipc_bclink_retransmit_to(void) 17101d83eddSAllan Stephens { 17201d83eddSAllan Stephens return bclink->retransmit_to; 17301d83eddSAllan Stephens } 17401d83eddSAllan Stephens 17501d83eddSAllan Stephens /** 176b97bf3fdSPer Liden * bclink_retransmit_pkt - retransmit broadcast packets 177b97bf3fdSPer Liden * @after: sequence number of last packet to *not* retransmit 178b97bf3fdSPer Liden * @to: sequence number of last packet to retransmit 179b97bf3fdSPer Liden * 180d356eebaSAllan Stephens * Called with bc_lock locked 181b97bf3fdSPer Liden */ 182b97bf3fdSPer Liden static void bclink_retransmit_pkt(u32 after, u32 to) 183b97bf3fdSPer Liden { 184b97bf3fdSPer Liden struct sk_buff *buf; 185b97bf3fdSPer Liden 186b97bf3fdSPer Liden buf = bcl->first_out; 187a016892cSAllan Stephens while (buf && less_eq(buf_seqno(buf), after)) 188b97bf3fdSPer Liden buf = buf->next; 1894323add6SPer Liden tipc_link_retransmit(bcl, buf, mod(to - after)); 190b97bf3fdSPer Liden } 191b97bf3fdSPer Liden 192b97bf3fdSPer Liden /** 1934323add6SPer Liden * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets 194b97bf3fdSPer Liden * @n_ptr: node that sent acknowledgement info 195b97bf3fdSPer Liden * @acked: broadcast sequence # that has been acknowledged 196b97bf3fdSPer Liden * 197b97bf3fdSPer Liden * Node is locked, bc_lock unlocked. 198b97bf3fdSPer Liden */ 1996c00055aSDavid S. Miller void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked) 200b97bf3fdSPer Liden { 201b97bf3fdSPer Liden struct sk_buff *crs; 202b97bf3fdSPer Liden struct sk_buff *next; 203b97bf3fdSPer Liden unsigned int released = 0; 204b97bf3fdSPer Liden 205b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 206b97bf3fdSPer Liden 20736559591SAllan Stephens /* Bail out if tx queue is empty (no clean up is required) */ 208b97bf3fdSPer Liden crs = bcl->first_out; 20936559591SAllan Stephens if (!crs) 21036559591SAllan Stephens goto exit; 21136559591SAllan Stephens 21236559591SAllan Stephens /* Determine which messages need to be acknowledged */ 21336559591SAllan Stephens if (acked == INVALID_LINK_SEQ) { 21436559591SAllan Stephens /* 21536559591SAllan Stephens * Contact with specified node has been lost, so need to 21636559591SAllan Stephens * acknowledge sent messages only (if other nodes still exist) 21736559591SAllan Stephens * or both sent and unsent messages (otherwise) 21836559591SAllan Stephens */ 21936559591SAllan Stephens if (bclink->bcast_nodes.count) 22036559591SAllan Stephens acked = bcl->fsm_msg_cnt; 22136559591SAllan Stephens else 22236559591SAllan Stephens acked = bcl->next_out_no; 22336559591SAllan Stephens } else { 22436559591SAllan Stephens /* 22536559591SAllan Stephens * Bail out if specified sequence number does not correspond 22636559591SAllan Stephens * to a message that has been sent and not yet acknowledged 22736559591SAllan Stephens */ 22836559591SAllan Stephens if (less(acked, buf_seqno(crs)) || 22936559591SAllan Stephens less(bcl->fsm_msg_cnt, acked) || 23036559591SAllan Stephens less_eq(acked, n_ptr->bclink.acked)) 23136559591SAllan Stephens goto exit; 23236559591SAllan Stephens } 23336559591SAllan Stephens 23436559591SAllan Stephens /* Skip over packets that node has previously acknowledged */ 235a016892cSAllan Stephens while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) 236b97bf3fdSPer Liden crs = crs->next; 237b97bf3fdSPer Liden 238b97bf3fdSPer Liden /* Update packets that node is now acknowledging */ 239b97bf3fdSPer Liden 240b97bf3fdSPer Liden while (crs && less_eq(buf_seqno(crs), acked)) { 241b97bf3fdSPer Liden next = crs->next; 24210745cd5SAllan Stephens 24310745cd5SAllan Stephens if (crs != bcl->next_out) 244b97bf3fdSPer Liden bcbuf_decr_acks(crs); 24510745cd5SAllan Stephens else { 24610745cd5SAllan Stephens bcbuf_set_acks(crs, 0); 24710745cd5SAllan Stephens bcl->next_out = next; 24810745cd5SAllan Stephens bclink_set_last_sent(); 24910745cd5SAllan Stephens } 25010745cd5SAllan Stephens 251b97bf3fdSPer Liden if (bcbuf_acks(crs) == 0) { 252b97bf3fdSPer Liden bcl->first_out = next; 253b97bf3fdSPer Liden bcl->out_queue_size--; 2545f6d9123SAllan Stephens kfree_skb(crs); 255b97bf3fdSPer Liden released = 1; 256b97bf3fdSPer Liden } 257b97bf3fdSPer Liden crs = next; 258b97bf3fdSPer Liden } 259b97bf3fdSPer Liden n_ptr->bclink.acked = acked; 260b97bf3fdSPer Liden 261b97bf3fdSPer Liden /* Try resolving broadcast link congestion, if necessary */ 262b97bf3fdSPer Liden 2635b1f7bdeSAllan Stephens if (unlikely(bcl->next_out)) { 2644323add6SPer Liden tipc_link_push_queue(bcl); 2655b1f7bdeSAllan Stephens bclink_set_last_sent(); 2665b1f7bdeSAllan Stephens } 267b97bf3fdSPer Liden if (unlikely(released && !list_empty(&bcl->waiting_ports))) 2684323add6SPer Liden tipc_link_wakeup_ports(bcl, 0); 26936559591SAllan Stephens exit: 270b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 271b97bf3fdSPer Liden } 272b97bf3fdSPer Liden 2732c53040fSBen Hutchings /** 2747a54d4a9SAllan Stephens * tipc_bclink_update_link_state - update broadcast link state 275b97bf3fdSPer Liden * 2764323add6SPer Liden * tipc_net_lock and node lock set 277b97bf3fdSPer Liden */ 2787a54d4a9SAllan Stephens void tipc_bclink_update_link_state(struct tipc_node *n_ptr, u32 last_sent) 279b97bf3fdSPer Liden { 280b97bf3fdSPer Liden struct sk_buff *buf; 281b97bf3fdSPer Liden 2827a54d4a9SAllan Stephens /* Ignore "stale" link state info */ 2837a54d4a9SAllan Stephens 2847a54d4a9SAllan Stephens if (less_eq(last_sent, n_ptr->bclink.last_in)) 285b97bf3fdSPer Liden return; 286b97bf3fdSPer Liden 2877a54d4a9SAllan Stephens /* Update link synchronization state; quit if in sync */ 2887a54d4a9SAllan Stephens 2897a54d4a9SAllan Stephens bclink_update_last_sent(n_ptr, last_sent); 2907a54d4a9SAllan Stephens 2917a54d4a9SAllan Stephens if (n_ptr->bclink.last_sent == n_ptr->bclink.last_in) 2927a54d4a9SAllan Stephens return; 2937a54d4a9SAllan Stephens 2947a54d4a9SAllan Stephens /* Update out-of-sync state; quit if loss is still unconfirmed */ 2957a54d4a9SAllan Stephens 2967a54d4a9SAllan Stephens if ((++n_ptr->bclink.oos_state) == 1) { 2977a54d4a9SAllan Stephens if (n_ptr->bclink.deferred_size < (TIPC_MIN_LINK_WIN / 2)) 2987a54d4a9SAllan Stephens return; 2997a54d4a9SAllan Stephens n_ptr->bclink.oos_state++; 3007a54d4a9SAllan Stephens } 3017a54d4a9SAllan Stephens 3027a54d4a9SAllan Stephens /* Don't NACK if one has been recently sent (or seen) */ 3037a54d4a9SAllan Stephens 3047a54d4a9SAllan Stephens if (n_ptr->bclink.oos_state & 0x1) 3057a54d4a9SAllan Stephens return; 3067a54d4a9SAllan Stephens 3077a54d4a9SAllan Stephens /* Send NACK */ 3087a54d4a9SAllan Stephens 30931e3c3f6Sstephen hemminger buf = tipc_buf_acquire(INT_H_SIZE); 310b97bf3fdSPer Liden if (buf) { 3117a54d4a9SAllan Stephens struct tipc_msg *msg = buf_msg(buf); 3127a54d4a9SAllan Stephens 313c68ca7b7SAllan Stephens tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG, 31475715217SAllan Stephens INT_H_SIZE, n_ptr->addr); 315bf781ecfSAllan Stephens msg_set_non_seq(msg, 1); 316b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 3177a54d4a9SAllan Stephens msg_set_bcast_ack(msg, n_ptr->bclink.last_in); 3187a54d4a9SAllan Stephens msg_set_bcgap_after(msg, n_ptr->bclink.last_in); 3197a54d4a9SAllan Stephens msg_set_bcgap_to(msg, n_ptr->bclink.deferred_head 3207a54d4a9SAllan Stephens ? buf_seqno(n_ptr->bclink.deferred_head) - 1 3217a54d4a9SAllan Stephens : n_ptr->bclink.last_sent); 322b97bf3fdSPer Liden 32357732560SAllan Stephens spin_lock_bh(&bc_lock); 3240f38513dSAllan Stephens tipc_bearer_send(&bcbearer->bearer, buf, NULL); 325b97bf3fdSPer Liden bcl->stats.sent_nacks++; 32657732560SAllan Stephens spin_unlock_bh(&bc_lock); 3275f6d9123SAllan Stephens kfree_skb(buf); 328b97bf3fdSPer Liden 3297a54d4a9SAllan Stephens n_ptr->bclink.oos_state++; 3307a54d4a9SAllan Stephens } 3317a54d4a9SAllan Stephens } 3327a54d4a9SAllan Stephens 3332c53040fSBen Hutchings /** 3347a54d4a9SAllan Stephens * bclink_peek_nack - monitor retransmission requests sent by other nodes 335b97bf3fdSPer Liden * 3367a54d4a9SAllan Stephens * Delay any upcoming NACK by this node if another node has already 3377a54d4a9SAllan Stephens * requested the first message this node is going to ask for. 338b97bf3fdSPer Liden * 3394323add6SPer Liden * Only tipc_net_lock set. 340b97bf3fdSPer Liden */ 3417a54d4a9SAllan Stephens static void bclink_peek_nack(struct tipc_msg *msg) 342b97bf3fdSPer Liden { 3437a54d4a9SAllan Stephens struct tipc_node *n_ptr = tipc_node_find(msg_destnode(msg)); 344b97bf3fdSPer Liden 3457a54d4a9SAllan Stephens if (unlikely(!n_ptr)) 346b97bf3fdSPer Liden return; 3477a54d4a9SAllan Stephens 3484323add6SPer Liden tipc_node_lock(n_ptr); 349b97bf3fdSPer Liden 350389dd9bcSYing Xue if (n_ptr->bclink.recv_permitted && 3517a54d4a9SAllan Stephens (n_ptr->bclink.last_in != n_ptr->bclink.last_sent) && 3527a54d4a9SAllan Stephens (n_ptr->bclink.last_in == msg_bcgap_after(msg))) 3537a54d4a9SAllan Stephens n_ptr->bclink.oos_state = 2; 354b97bf3fdSPer Liden 3554323add6SPer Liden tipc_node_unlock(n_ptr); 356b97bf3fdSPer Liden } 357b97bf3fdSPer Liden 3587a54d4a9SAllan Stephens /* 3594323add6SPer Liden * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster 360b97bf3fdSPer Liden */ 3614323add6SPer Liden int tipc_bclink_send_msg(struct sk_buff *buf) 362b97bf3fdSPer Liden { 363b97bf3fdSPer Liden int res; 364b97bf3fdSPer Liden 365b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 366b97bf3fdSPer Liden 3672b78f9a0SAllan Stephens if (!bclink->bcast_nodes.count) { 3682b78f9a0SAllan Stephens res = msg_data_sz(buf_msg(buf)); 3695f6d9123SAllan Stephens kfree_skb(buf); 3702b78f9a0SAllan Stephens goto exit; 3712b78f9a0SAllan Stephens } 3722b78f9a0SAllan Stephens 3734323add6SPer Liden res = tipc_link_send_buf(bcl, buf); 3749157bafbSAllan Stephens if (likely(res >= 0)) { 3755b1f7bdeSAllan Stephens bclink_set_last_sent(); 376b97bf3fdSPer Liden bcl->stats.queue_sz_counts++; 377b97bf3fdSPer Liden bcl->stats.accu_queue_sz += bcl->out_queue_size; 3789157bafbSAllan Stephens } 3792b78f9a0SAllan Stephens exit: 380b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 381b97bf3fdSPer Liden return res; 382b97bf3fdSPer Liden } 383b97bf3fdSPer Liden 3842c53040fSBen Hutchings /** 38563e7f1acSAllan Stephens * bclink_accept_pkt - accept an incoming, in-sequence broadcast packet 38663e7f1acSAllan Stephens * 38763e7f1acSAllan Stephens * Called with both sending node's lock and bc_lock taken. 38863e7f1acSAllan Stephens */ 38963e7f1acSAllan Stephens static void bclink_accept_pkt(struct tipc_node *node, u32 seqno) 39063e7f1acSAllan Stephens { 39163e7f1acSAllan Stephens bclink_update_last_sent(node, seqno); 39263e7f1acSAllan Stephens node->bclink.last_in = seqno; 39363e7f1acSAllan Stephens node->bclink.oos_state = 0; 39463e7f1acSAllan Stephens bcl->stats.recv_info++; 39563e7f1acSAllan Stephens 39663e7f1acSAllan Stephens /* 39763e7f1acSAllan Stephens * Unicast an ACK periodically, ensuring that 39863e7f1acSAllan Stephens * all nodes in the cluster don't ACK at the same time 39963e7f1acSAllan Stephens */ 40063e7f1acSAllan Stephens 40163e7f1acSAllan Stephens if (((seqno - tipc_own_addr) % TIPC_MIN_LINK_WIN) == 0) { 40263e7f1acSAllan Stephens tipc_link_send_proto_msg( 40363e7f1acSAllan Stephens node->active_links[node->addr & 1], 40463e7f1acSAllan Stephens STATE_MSG, 0, 0, 0, 0, 0); 40563e7f1acSAllan Stephens bcl->stats.sent_acks++; 40663e7f1acSAllan Stephens } 40763e7f1acSAllan Stephens } 40863e7f1acSAllan Stephens 4092c53040fSBen Hutchings /** 4104323add6SPer Liden * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards 411b97bf3fdSPer Liden * 4124323add6SPer Liden * tipc_net_lock is read_locked, no other locks set 413b97bf3fdSPer Liden */ 4144323add6SPer Liden void tipc_bclink_recv_pkt(struct sk_buff *buf) 415b97bf3fdSPer Liden { 416b97bf3fdSPer Liden struct tipc_msg *msg = buf_msg(buf); 4175d3c488dSAllan Stephens struct tipc_node *node; 418b97bf3fdSPer Liden u32 next_in; 419b97bf3fdSPer Liden u32 seqno; 4208a275a6aSAllan Stephens int deferred; 421b97bf3fdSPer Liden 4225d3c488dSAllan Stephens /* Screen out unwanted broadcast messages */ 4235d3c488dSAllan Stephens 4245d3c488dSAllan Stephens if (msg_mc_netid(msg) != tipc_net_id) 4255d3c488dSAllan Stephens goto exit; 4265d3c488dSAllan Stephens 4275d3c488dSAllan Stephens node = tipc_node_find(msg_prevnode(msg)); 4285d3c488dSAllan Stephens if (unlikely(!node)) 4295d3c488dSAllan Stephens goto exit; 4305d3c488dSAllan Stephens 4315d3c488dSAllan Stephens tipc_node_lock(node); 432389dd9bcSYing Xue if (unlikely(!node->bclink.recv_permitted)) 4335d3c488dSAllan Stephens goto unlock; 434b97bf3fdSPer Liden 4358a275a6aSAllan Stephens /* Handle broadcast protocol message */ 4368a275a6aSAllan Stephens 437b97bf3fdSPer Liden if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { 4389f6bdcd4SAllan Stephens if (msg_type(msg) != STATE_MSG) 4399f6bdcd4SAllan Stephens goto unlock; 440b97bf3fdSPer Liden if (msg_destnode(msg) == tipc_own_addr) { 4414323add6SPer Liden tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); 4424323add6SPer Liden tipc_node_unlock(node); 443d356eebaSAllan Stephens spin_lock_bh(&bc_lock); 444b97bf3fdSPer Liden bcl->stats.recv_nacks++; 44501d83eddSAllan Stephens bclink->retransmit_to = node; 446b97bf3fdSPer Liden bclink_retransmit_pkt(msg_bcgap_after(msg), 447b97bf3fdSPer Liden msg_bcgap_to(msg)); 448d356eebaSAllan Stephens spin_unlock_bh(&bc_lock); 449b97bf3fdSPer Liden } else { 4505d3c488dSAllan Stephens tipc_node_unlock(node); 4517a54d4a9SAllan Stephens bclink_peek_nack(msg); 452b97bf3fdSPer Liden } 4535d3c488dSAllan Stephens goto exit; 454b97bf3fdSPer Liden } 455b97bf3fdSPer Liden 4565d3c488dSAllan Stephens /* Handle in-sequence broadcast message */ 4575d3c488dSAllan Stephens 458b97bf3fdSPer Liden seqno = msg_seqno(msg); 4598a275a6aSAllan Stephens next_in = mod(node->bclink.last_in + 1); 460b97bf3fdSPer Liden 461b97bf3fdSPer Liden if (likely(seqno == next_in)) { 4628a275a6aSAllan Stephens receive: 4637a54d4a9SAllan Stephens /* Deliver message to destination */ 4647a54d4a9SAllan Stephens 465b97bf3fdSPer Liden if (likely(msg_isdata(msg))) { 46663e7f1acSAllan Stephens spin_lock_bh(&bc_lock); 46763e7f1acSAllan Stephens bclink_accept_pkt(node, seqno); 468b98158e3SAllan Stephens spin_unlock_bh(&bc_lock); 4694323add6SPer Liden tipc_node_unlock(node); 4709f6bdcd4SAllan Stephens if (likely(msg_mcast(msg))) 4714323add6SPer Liden tipc_port_recv_mcast(buf, NULL); 4729f6bdcd4SAllan Stephens else 4735f6d9123SAllan Stephens kfree_skb(buf); 474b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_BUNDLER) { 47563e7f1acSAllan Stephens spin_lock_bh(&bc_lock); 47663e7f1acSAllan Stephens bclink_accept_pkt(node, seqno); 477b97bf3fdSPer Liden bcl->stats.recv_bundles++; 478b97bf3fdSPer Liden bcl->stats.recv_bundled += msg_msgcnt(msg); 479b98158e3SAllan Stephens spin_unlock_bh(&bc_lock); 4804323add6SPer Liden tipc_node_unlock(node); 4814323add6SPer Liden tipc_link_recv_bundle(buf); 482b97bf3fdSPer Liden } else if (msg_user(msg) == MSG_FRAGMENTER) { 48363e7f1acSAllan Stephens int ret = tipc_link_recv_fragment(&node->bclink.defragm, 48463e7f1acSAllan Stephens &buf, &msg); 48563e7f1acSAllan Stephens if (ret < 0) 48663e7f1acSAllan Stephens goto unlock; 48763e7f1acSAllan Stephens spin_lock_bh(&bc_lock); 48863e7f1acSAllan Stephens bclink_accept_pkt(node, seqno); 489b97bf3fdSPer Liden bcl->stats.recv_fragments++; 49063e7f1acSAllan Stephens if (ret > 0) 491b97bf3fdSPer Liden bcl->stats.recv_fragmented++; 492b98158e3SAllan Stephens spin_unlock_bh(&bc_lock); 4934323add6SPer Liden tipc_node_unlock(node); 4944323add6SPer Liden tipc_net_route_msg(buf); 4959f6bdcd4SAllan Stephens } else if (msg_user(msg) == NAME_DISTRIBUTOR) { 49663e7f1acSAllan Stephens spin_lock_bh(&bc_lock); 49763e7f1acSAllan Stephens bclink_accept_pkt(node, seqno); 498b98158e3SAllan Stephens spin_unlock_bh(&bc_lock); 4999f6bdcd4SAllan Stephens tipc_node_unlock(node); 5009f6bdcd4SAllan Stephens tipc_named_recv(buf); 501b97bf3fdSPer Liden } else { 50263e7f1acSAllan Stephens spin_lock_bh(&bc_lock); 50363e7f1acSAllan Stephens bclink_accept_pkt(node, seqno); 504b98158e3SAllan Stephens spin_unlock_bh(&bc_lock); 5054323add6SPer Liden tipc_node_unlock(node); 5065f6d9123SAllan Stephens kfree_skb(buf); 507b97bf3fdSPer Liden } 5085d3c488dSAllan Stephens buf = NULL; 5098a275a6aSAllan Stephens 5108a275a6aSAllan Stephens /* Determine new synchronization state */ 5118a275a6aSAllan Stephens 5124323add6SPer Liden tipc_node_lock(node); 5138a275a6aSAllan Stephens if (unlikely(!tipc_node_is_up(node))) 5148a275a6aSAllan Stephens goto unlock; 5158a275a6aSAllan Stephens 5167a54d4a9SAllan Stephens if (node->bclink.last_in == node->bclink.last_sent) 5178a275a6aSAllan Stephens goto unlock; 5188a275a6aSAllan Stephens 5197a54d4a9SAllan Stephens if (!node->bclink.deferred_head) { 5207a54d4a9SAllan Stephens node->bclink.oos_state = 1; 5217a54d4a9SAllan Stephens goto unlock; 5227a54d4a9SAllan Stephens } 5237a54d4a9SAllan Stephens 5248a275a6aSAllan Stephens msg = buf_msg(node->bclink.deferred_head); 5258a275a6aSAllan Stephens seqno = msg_seqno(msg); 5268a275a6aSAllan Stephens next_in = mod(next_in + 1); 5278a275a6aSAllan Stephens if (seqno != next_in) 5288a275a6aSAllan Stephens goto unlock; 5298a275a6aSAllan Stephens 5308a275a6aSAllan Stephens /* Take in-sequence message from deferred queue & deliver it */ 5318a275a6aSAllan Stephens 5328a275a6aSAllan Stephens buf = node->bclink.deferred_head; 5338a275a6aSAllan Stephens node->bclink.deferred_head = buf->next; 5347a54d4a9SAllan Stephens node->bclink.deferred_size--; 535b97bf3fdSPer Liden goto receive; 536b97bf3fdSPer Liden } 5378a275a6aSAllan Stephens 5388a275a6aSAllan Stephens /* Handle out-of-sequence broadcast message */ 5398a275a6aSAllan Stephens 5408a275a6aSAllan Stephens if (less(next_in, seqno)) { 5418a275a6aSAllan Stephens deferred = tipc_link_defer_pkt(&node->bclink.deferred_head, 542b97bf3fdSPer Liden &node->bclink.deferred_tail, 5438a275a6aSAllan Stephens buf); 5447a54d4a9SAllan Stephens node->bclink.deferred_size += deferred; 5457a54d4a9SAllan Stephens bclink_update_last_sent(node, seqno); 5465d3c488dSAllan Stephens buf = NULL; 5478a275a6aSAllan Stephens } else 5488a275a6aSAllan Stephens deferred = 0; 5498a275a6aSAllan Stephens 550b98158e3SAllan Stephens spin_lock_bh(&bc_lock); 551b98158e3SAllan Stephens 5528a275a6aSAllan Stephens if (deferred) 5538a275a6aSAllan Stephens bcl->stats.deferred_recv++; 5540232c5a5SAllan Stephens else 5550232c5a5SAllan Stephens bcl->stats.duplicates++; 5568a275a6aSAllan Stephens 557b98158e3SAllan Stephens spin_unlock_bh(&bc_lock); 558b98158e3SAllan Stephens 5595d3c488dSAllan Stephens unlock: 5604323add6SPer Liden tipc_node_unlock(node); 5615d3c488dSAllan Stephens exit: 5625f6d9123SAllan Stephens kfree_skb(buf); 563b97bf3fdSPer Liden } 564b97bf3fdSPer Liden 5656c00055aSDavid S. Miller u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) 566b97bf3fdSPer Liden { 567389dd9bcSYing Xue return (n_ptr->bclink.recv_permitted && 5684323add6SPer Liden (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); 569b97bf3fdSPer Liden } 570b97bf3fdSPer Liden 571b97bf3fdSPer Liden 572b97bf3fdSPer Liden /** 5734323add6SPer Liden * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer 574b97bf3fdSPer Liden * 5752ff9f924SAllan Stephens * Send packet over as many bearers as necessary to reach all nodes 5762ff9f924SAllan Stephens * that have joined the broadcast link. 577b97bf3fdSPer Liden * 5782ff9f924SAllan Stephens * Returns 0 (packet sent successfully) under all circumstances, 5792ff9f924SAllan Stephens * since the broadcast link's pseudo-bearer never blocks 580b97bf3fdSPer Liden */ 581ae8509c4SPaul Gortmaker static int tipc_bcbearer_send(struct sk_buff *buf, struct tipc_bearer *unused1, 582b97bf3fdSPer Liden struct tipc_media_addr *unused2) 583b97bf3fdSPer Liden { 584b97bf3fdSPer Liden int bp_index; 585b97bf3fdSPer Liden 586e6160710SGerlando Falauto /* Prepare broadcast link message for reliable transmission, 5872ff9f924SAllan Stephens * if first time trying to send it; 5882ff9f924SAllan Stephens * preparation is skipped for broadcast link protocol messages 5892ff9f924SAllan Stephens * since they are sent in an unreliable manner and don't need it 5902ff9f924SAllan Stephens */ 591b97bf3fdSPer Liden if (likely(!msg_non_seq(buf_msg(buf)))) { 592b97bf3fdSPer Liden struct tipc_msg *msg; 593b97bf3fdSPer Liden 594cd3decdfSAllan Stephens bcbuf_set_acks(buf, bclink->bcast_nodes.count); 595b97bf3fdSPer Liden msg = buf_msg(buf); 59640aecb1bSAllan Stephens msg_set_non_seq(msg, 1); 597b97bf3fdSPer Liden msg_set_mc_netid(msg, tipc_net_id); 5980048b826SAllan Stephens bcl->stats.sent_info++; 5995e726900SAllan Stephens 600cd3decdfSAllan Stephens if (WARN_ON(!bclink->bcast_nodes.count)) { 6015e726900SAllan Stephens dump_stack(); 6025e726900SAllan Stephens return 0; 6035e726900SAllan Stephens } 604b97bf3fdSPer Liden } 605b97bf3fdSPer Liden 606b97bf3fdSPer Liden /* Send buffer over bearers until all targets reached */ 607cd3decdfSAllan Stephens bcbearer->remains = bclink->bcast_nodes; 608b97bf3fdSPer Liden 609b97bf3fdSPer Liden for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { 6102d627b92SAllan Stephens struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary; 6112d627b92SAllan Stephens struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary; 61277861d9cSGerlando Falauto struct tipc_bearer *b = p; 613488fc9afSGerlando Falauto struct sk_buff *tbuf; 614b97bf3fdSPer Liden 615b97bf3fdSPer Liden if (!p) 616e6160710SGerlando Falauto break; /* No more bearers to try */ 617b97bf3fdSPer Liden 61877861d9cSGerlando Falauto if (tipc_bearer_blocked(p)) { 61977861d9cSGerlando Falauto if (!s || tipc_bearer_blocked(s)) 62077861d9cSGerlando Falauto continue; /* Can't use either bearer */ 62177861d9cSGerlando Falauto b = s; 62277861d9cSGerlando Falauto } 62377861d9cSGerlando Falauto 62477861d9cSGerlando Falauto tipc_nmap_diff(&bcbearer->remains, &b->nodes, 625e6160710SGerlando Falauto &bcbearer->remains_new); 62665f51ef0SAllan Stephens if (bcbearer->remains_new.count == bcbearer->remains.count) 627e6160710SGerlando Falauto continue; /* Nothing added by bearer pair */ 628b97bf3fdSPer Liden 629488fc9afSGerlando Falauto if (bp_index == 0) { 630488fc9afSGerlando Falauto /* Use original buffer for first bearer */ 63177861d9cSGerlando Falauto tipc_bearer_send(b, buf, &b->bcast_addr); 632488fc9afSGerlando Falauto } else { 633488fc9afSGerlando Falauto /* Avoid concurrent buffer access */ 634488fc9afSGerlando Falauto tbuf = pskb_copy(buf, GFP_ATOMIC); 635488fc9afSGerlando Falauto if (!tbuf) 636488fc9afSGerlando Falauto break; 637488fc9afSGerlando Falauto tipc_bearer_send(b, tbuf, &b->bcast_addr); 638488fc9afSGerlando Falauto kfree_skb(tbuf); /* Bearer keeps a clone */ 639488fc9afSGerlando Falauto } 640b97bf3fdSPer Liden 641e6160710SGerlando Falauto /* Swap bearers for next packet */ 6421a624832SNeil Horman if (s) { 643b97bf3fdSPer Liden bcbearer->bpairs[bp_index].primary = s; 644b97bf3fdSPer Liden bcbearer->bpairs[bp_index].secondary = p; 6451a624832SNeil Horman } 6461a624832SNeil Horman 64765f51ef0SAllan Stephens if (bcbearer->remains_new.count == 0) 648e6160710SGerlando Falauto break; /* All targets reached */ 649b97bf3fdSPer Liden 65065f51ef0SAllan Stephens bcbearer->remains = bcbearer->remains_new; 651b97bf3fdSPer Liden } 652b97bf3fdSPer Liden 6532ff9f924SAllan Stephens return 0; 654b97bf3fdSPer Liden } 655b97bf3fdSPer Liden 656b97bf3fdSPer Liden /** 6574323add6SPer Liden * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer 658b97bf3fdSPer Liden */ 6594323add6SPer Liden void tipc_bcbearer_sort(void) 660b97bf3fdSPer Liden { 6617f9ab6acSPaul Gortmaker struct tipc_bcbearer_pair *bp_temp = bcbearer->bpairs_temp; 6627f9ab6acSPaul Gortmaker struct tipc_bcbearer_pair *bp_curr; 663b97bf3fdSPer Liden int b_index; 664b97bf3fdSPer Liden int pri; 665b97bf3fdSPer Liden 666b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 667b97bf3fdSPer Liden 668b97bf3fdSPer Liden /* Group bearers by priority (can assume max of two per priority) */ 669b97bf3fdSPer Liden memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); 670b97bf3fdSPer Liden 671b97bf3fdSPer Liden for (b_index = 0; b_index < MAX_BEARERS; b_index++) { 6722d627b92SAllan Stephens struct tipc_bearer *b = &tipc_bearers[b_index]; 673b97bf3fdSPer Liden 674b97bf3fdSPer Liden if (!b->active || !b->nodes.count) 675b97bf3fdSPer Liden continue; 676b97bf3fdSPer Liden 677b97bf3fdSPer Liden if (!bp_temp[b->priority].primary) 678b97bf3fdSPer Liden bp_temp[b->priority].primary = b; 679b97bf3fdSPer Liden else 680b97bf3fdSPer Liden bp_temp[b->priority].secondary = b; 681b97bf3fdSPer Liden } 682b97bf3fdSPer Liden 683b97bf3fdSPer Liden /* Create array of bearer pairs for broadcasting */ 684b97bf3fdSPer Liden bp_curr = bcbearer->bpairs; 685b97bf3fdSPer Liden memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); 686b97bf3fdSPer Liden 68716cb4b33SPer Liden for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { 688b97bf3fdSPer Liden 689b97bf3fdSPer Liden if (!bp_temp[pri].primary) 690b97bf3fdSPer Liden continue; 691b97bf3fdSPer Liden 692b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].primary; 693b97bf3fdSPer Liden 694b97bf3fdSPer Liden if (bp_temp[pri].secondary) { 6954323add6SPer Liden if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, 696b97bf3fdSPer Liden &bp_temp[pri].secondary->nodes)) { 697b97bf3fdSPer Liden bp_curr->secondary = bp_temp[pri].secondary; 698b97bf3fdSPer Liden } else { 699b97bf3fdSPer Liden bp_curr++; 700b97bf3fdSPer Liden bp_curr->primary = bp_temp[pri].secondary; 701b97bf3fdSPer Liden } 702b97bf3fdSPer Liden } 703b97bf3fdSPer Liden 704b97bf3fdSPer Liden bp_curr++; 705b97bf3fdSPer Liden } 706b97bf3fdSPer Liden 707b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 708b97bf3fdSPer Liden } 709b97bf3fdSPer Liden 710b97bf3fdSPer Liden 7114323add6SPer Liden int tipc_bclink_stats(char *buf, const u32 buf_size) 712b97bf3fdSPer Liden { 713dc1aed37SErik Hugne int ret; 714dc1aed37SErik Hugne struct tipc_stats *s; 715b97bf3fdSPer Liden 716b97bf3fdSPer Liden if (!bcl) 717b97bf3fdSPer Liden return 0; 718b97bf3fdSPer Liden 719b97bf3fdSPer Liden spin_lock_bh(&bc_lock); 720b97bf3fdSPer Liden 721dc1aed37SErik Hugne s = &bcl->stats; 722dc1aed37SErik Hugne 723dc1aed37SErik Hugne ret = tipc_snprintf(buf, buf_size, "Link <%s>\n" 724b97bf3fdSPer Liden " Window:%u packets\n", 725b97bf3fdSPer Liden bcl->name, bcl->queue_limit[0]); 726dc1aed37SErik Hugne ret += tipc_snprintf(buf + ret, buf_size - ret, 727dc1aed37SErik Hugne " RX packets:%u fragments:%u/%u bundles:%u/%u\n", 728dc1aed37SErik Hugne s->recv_info, s->recv_fragments, 729dc1aed37SErik Hugne s->recv_fragmented, s->recv_bundles, 730dc1aed37SErik Hugne s->recv_bundled); 731dc1aed37SErik Hugne ret += tipc_snprintf(buf + ret, buf_size - ret, 732dc1aed37SErik Hugne " TX packets:%u fragments:%u/%u bundles:%u/%u\n", 733dc1aed37SErik Hugne s->sent_info, s->sent_fragments, 734dc1aed37SErik Hugne s->sent_fragmented, s->sent_bundles, 735dc1aed37SErik Hugne s->sent_bundled); 736dc1aed37SErik Hugne ret += tipc_snprintf(buf + ret, buf_size - ret, 737dc1aed37SErik Hugne " RX naks:%u defs:%u dups:%u\n", 738dc1aed37SErik Hugne s->recv_nacks, s->deferred_recv, s->duplicates); 739dc1aed37SErik Hugne ret += tipc_snprintf(buf + ret, buf_size - ret, 740dc1aed37SErik Hugne " TX naks:%u acks:%u dups:%u\n", 741dc1aed37SErik Hugne s->sent_nacks, s->sent_acks, s->retransmitted); 742dc1aed37SErik Hugne ret += tipc_snprintf(buf + ret, buf_size - ret, 7433c294cb3SYing Xue " Congestion link:%u Send queue max:%u avg:%u\n", 7443c294cb3SYing Xue s->link_congs, s->max_queue_sz, 745dc1aed37SErik Hugne s->queue_sz_counts ? 746dc1aed37SErik Hugne (s->accu_queue_sz / s->queue_sz_counts) : 0); 747b97bf3fdSPer Liden 748b97bf3fdSPer Liden spin_unlock_bh(&bc_lock); 749dc1aed37SErik Hugne return ret; 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 bcbearer->bearer.media = &bcbearer->media; 7794323add6SPer Liden bcbearer->media.send_msg = tipc_bcbearer_send; 7802e2d9be8SAllan Stephens sprintf(bcbearer->media.name, "tipc-broadcast"); 781b97bf3fdSPer Liden 782b97bf3fdSPer Liden INIT_LIST_HEAD(&bcl->waiting_ports); 783b97bf3fdSPer Liden bcl->next_out_no = 1; 78434af946aSIngo Molnar spin_lock_init(&bclink->node.lock); 785b97bf3fdSPer Liden bcl->owner = &bclink->node; 786b97bf3fdSPer Liden bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; 7874323add6SPer Liden tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); 788c5c73dcaSErik Hugne spin_lock_init(&bcbearer->bearer.lock); 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 void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node) 8093e22e62bSAllan Stephens { 8103e22e62bSAllan Stephens int n = tipc_node(node); 8113e22e62bSAllan Stephens int w = n / WSIZE; 8123e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8133e22e62bSAllan Stephens 8143e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) == 0) { 8153e22e62bSAllan Stephens nm_ptr->count++; 8163e22e62bSAllan Stephens nm_ptr->map[w] |= mask; 8173e22e62bSAllan Stephens } 8183e22e62bSAllan Stephens } 8193e22e62bSAllan Stephens 8203e22e62bSAllan Stephens /** 8213e22e62bSAllan Stephens * tipc_nmap_remove - remove a node from a node map 8223e22e62bSAllan Stephens */ 8233e22e62bSAllan Stephens void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node) 8243e22e62bSAllan Stephens { 8253e22e62bSAllan Stephens int n = tipc_node(node); 8263e22e62bSAllan Stephens int w = n / WSIZE; 8273e22e62bSAllan Stephens u32 mask = (1 << (n % WSIZE)); 8283e22e62bSAllan Stephens 8293e22e62bSAllan Stephens if ((nm_ptr->map[w] & mask) != 0) { 8303e22e62bSAllan Stephens nm_ptr->map[w] &= ~mask; 8313e22e62bSAllan Stephens nm_ptr->count--; 8323e22e62bSAllan Stephens } 8333e22e62bSAllan Stephens } 8343e22e62bSAllan Stephens 8353e22e62bSAllan Stephens /** 8363e22e62bSAllan Stephens * tipc_nmap_diff - find differences between node maps 8373e22e62bSAllan Stephens * @nm_a: input node map A 8383e22e62bSAllan Stephens * @nm_b: input node map B 8393e22e62bSAllan Stephens * @nm_diff: output node map A-B (i.e. nodes of A that are not in B) 8403e22e62bSAllan Stephens */ 84131e3c3f6Sstephen hemminger static void tipc_nmap_diff(struct tipc_node_map *nm_a, 84231e3c3f6Sstephen hemminger struct tipc_node_map *nm_b, 8433e22e62bSAllan Stephens struct tipc_node_map *nm_diff) 8443e22e62bSAllan Stephens { 8453e22e62bSAllan Stephens int stop = ARRAY_SIZE(nm_a->map); 8463e22e62bSAllan Stephens int w; 8473e22e62bSAllan Stephens int b; 8483e22e62bSAllan Stephens u32 map; 8493e22e62bSAllan Stephens 8503e22e62bSAllan Stephens memset(nm_diff, 0, sizeof(*nm_diff)); 8513e22e62bSAllan Stephens for (w = 0; w < stop; w++) { 8523e22e62bSAllan Stephens map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]); 8533e22e62bSAllan Stephens nm_diff->map[w] = map; 8543e22e62bSAllan Stephens if (map != 0) { 8553e22e62bSAllan Stephens for (b = 0 ; b < WSIZE; b++) { 8563e22e62bSAllan Stephens if (map & (1 << b)) 8573e22e62bSAllan Stephens nm_diff->count++; 8583e22e62bSAllan Stephens } 8593e22e62bSAllan Stephens } 8603e22e62bSAllan Stephens } 8613e22e62bSAllan Stephens } 86243608edcSAllan Stephens 86343608edcSAllan Stephens /** 86443608edcSAllan Stephens * tipc_port_list_add - add a port to a port list, ensuring no duplicates 86543608edcSAllan Stephens */ 8664584310bSPaul Gortmaker void tipc_port_list_add(struct tipc_port_list *pl_ptr, u32 port) 86743608edcSAllan Stephens { 8684584310bSPaul Gortmaker struct tipc_port_list *item = pl_ptr; 86943608edcSAllan Stephens int i; 87043608edcSAllan Stephens int item_sz = PLSIZE; 87143608edcSAllan Stephens int cnt = pl_ptr->count; 87243608edcSAllan Stephens 87343608edcSAllan Stephens for (; ; cnt -= item_sz, item = item->next) { 87443608edcSAllan Stephens if (cnt < PLSIZE) 87543608edcSAllan Stephens item_sz = cnt; 87643608edcSAllan Stephens for (i = 0; i < item_sz; i++) 87743608edcSAllan Stephens if (item->ports[i] == port) 87843608edcSAllan Stephens return; 87943608edcSAllan Stephens if (i < PLSIZE) { 88043608edcSAllan Stephens item->ports[i] = port; 88143608edcSAllan Stephens pl_ptr->count++; 88243608edcSAllan Stephens return; 88343608edcSAllan Stephens } 88443608edcSAllan Stephens if (!item->next) { 88543608edcSAllan Stephens item->next = kmalloc(sizeof(*item), GFP_ATOMIC); 88643608edcSAllan Stephens if (!item->next) { 8872cf8aa19SErik Hugne pr_warn("Incomplete multicast delivery, no memory\n"); 88843608edcSAllan Stephens return; 88943608edcSAllan Stephens } 89043608edcSAllan Stephens item->next->next = NULL; 89143608edcSAllan Stephens } 89243608edcSAllan Stephens } 89343608edcSAllan Stephens } 89443608edcSAllan Stephens 89543608edcSAllan Stephens /** 89643608edcSAllan Stephens * tipc_port_list_free - free dynamically created entries in port_list chain 89743608edcSAllan Stephens * 89843608edcSAllan Stephens */ 8994584310bSPaul Gortmaker void tipc_port_list_free(struct tipc_port_list *pl_ptr) 90043608edcSAllan Stephens { 9014584310bSPaul Gortmaker struct tipc_port_list *item; 9024584310bSPaul Gortmaker struct tipc_port_list *next; 90343608edcSAllan Stephens 90443608edcSAllan Stephens for (item = pl_ptr->next; item; item = next) { 90543608edcSAllan Stephens next = item->next; 90643608edcSAllan Stephens kfree(item); 90743608edcSAllan Stephens } 90843608edcSAllan Stephens } 909