blob: 716de1ac6cb560c8cc55a257a0d76d39230634f3 [file] [log] [blame]
Per Lidenb97bf3f2006-01-02 19:04:38 +01001/*
2 * net/tipc/bcast.c: TIPC broadcast code
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +09003 *
Per Liden593a5f22006-01-11 19:14:19 +01004 * Copyright (c) 2004-2006, Ericsson AB
Per Lidenb97bf3f2006-01-02 19:04:38 +01005 * Copyright (c) 2004, Intel Corporation.
Allan Stephens2d627b92011-01-07 13:00:11 -05006 * Copyright (c) 2005, 2010-2011, Wind River Systems
Per Lidenb97bf3f2006-01-02 19:04:38 +01007 * All rights reserved.
8 *
Per Liden9ea1fd32006-01-11 13:30:43 +01009 * Redistribution and use in source and binary forms, with or without
Per Lidenb97bf3f2006-01-02 19:04:38 +010010 * modification, are permitted provided that the following conditions are met:
11 *
Per Liden9ea1fd32006-01-11 13:30:43 +010012 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the names of the copyright holders nor the names of its
18 * contributors may be used to endorse or promote products derived from
19 * this software without specific prior written permission.
Per Lidenb97bf3f2006-01-02 19:04:38 +010020 *
Per Liden9ea1fd32006-01-11 13:30:43 +010021 * Alternatively, this software may be distributed under the terms of the
22 * GNU General Public License ("GPL") version 2 as published by the Free
23 * Software Foundation.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
26 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
29 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
Per Lidenb97bf3f2006-01-02 19:04:38 +010035 * POSSIBILITY OF SUCH DAMAGE.
36 */
37
38#include "core.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010039#include "link.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010040#include "port.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010041#include "bcast.h"
Allan Stephens9f6bdcd42011-04-07 14:57:53 -040042#include "name_distr.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010043
Per Lidenb97bf3f2006-01-02 19:04:38 +010044#define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */
45
46#define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */
47
Per Lidenb97bf3f2006-01-02 19:04:38 +010048/**
Paul Gortmaker7f9ab6a2011-12-29 20:55:27 -050049 * struct tipc_bcbearer_pair - a pair of bearers used by broadcast link
Per Lidenb97bf3f2006-01-02 19:04:38 +010050 * @primary: pointer to primary bearer
51 * @secondary: pointer to secondary bearer
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090052 *
53 * Bearers must have same priority and same set of reachable destinations
Per Lidenb97bf3f2006-01-02 19:04:38 +010054 * to be paired.
55 */
56
Paul Gortmaker7f9ab6a2011-12-29 20:55:27 -050057struct tipc_bcbearer_pair {
Allan Stephens2d627b92011-01-07 13:00:11 -050058 struct tipc_bearer *primary;
59 struct tipc_bearer *secondary;
Per Lidenb97bf3f2006-01-02 19:04:38 +010060};
61
62/**
Paul Gortmaker7f9ab6a2011-12-29 20:55:27 -050063 * struct tipc_bcbearer - bearer used by broadcast link
Per Lidenb97bf3f2006-01-02 19:04:38 +010064 * @bearer: (non-standard) broadcast bearer structure
65 * @media: (non-standard) broadcast media structure
66 * @bpairs: array of bearer pairs
Allan Stephens65f51ef2006-06-25 23:53:20 -070067 * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort()
68 * @remains: temporary node map used by tipc_bcbearer_send()
69 * @remains_new: temporary node map used tipc_bcbearer_send()
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090070 *
Allan Stephens65f51ef2006-06-25 23:53:20 -070071 * Note: The fields labelled "temporary" are incorporated into the bearer
72 * to avoid consuming potentially limited stack space through the use of
73 * large local variables within multicast routines. Concurrent access is
74 * prevented through use of the spinlock "bc_lock".
Per Lidenb97bf3f2006-01-02 19:04:38 +010075 */
Paul Gortmaker7f9ab6a2011-12-29 20:55:27 -050076struct tipc_bcbearer {
Allan Stephens2d627b92011-01-07 13:00:11 -050077 struct tipc_bearer bearer;
Paul Gortmaker358a0d12011-12-29 20:19:42 -050078 struct tipc_media media;
Paul Gortmaker7f9ab6a2011-12-29 20:55:27 -050079 struct tipc_bcbearer_pair bpairs[MAX_BEARERS];
80 struct tipc_bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1];
David S. Miller6c000552008-09-02 23:38:32 -070081 struct tipc_node_map remains;
82 struct tipc_node_map remains_new;
Per Lidenb97bf3f2006-01-02 19:04:38 +010083};
84
85/**
Paul Gortmaker6765fd62011-12-29 20:52:18 -050086 * struct tipc_bclink - link used for broadcast messages
Per Lidenb97bf3f2006-01-02 19:04:38 +010087 * @link: (non-standard) broadcast link structure
88 * @node: (non-standard) node structure representing b'cast link's peer node
Allan Stephenscd3decd2011-10-24 11:18:12 -040089 * @bcast_nodes: map of broadcast-capable nodes
Allan Stephens01d83ed2011-01-18 13:53:16 -050090 * @retransmit_to: node that most recently requested a retransmit
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090091 *
Per Lidenb97bf3f2006-01-02 19:04:38 +010092 * Handles sequence numbering, fragmentation, bundling, etc.
93 */
Paul Gortmaker6765fd62011-12-29 20:52:18 -050094struct tipc_bclink {
Paul Gortmakera18c4bc2011-12-29 20:58:42 -050095 struct tipc_link link;
David S. Miller6c000552008-09-02 23:38:32 -070096 struct tipc_node node;
Allan Stephenscd3decd2011-10-24 11:18:12 -040097 struct tipc_node_map bcast_nodes;
Allan Stephens01d83ed2011-01-18 13:53:16 -050098 struct tipc_node *retransmit_to;
Per Lidenb97bf3f2006-01-02 19:04:38 +010099};
100
Paul Gortmaker7f9ab6a2011-12-29 20:55:27 -0500101static struct tipc_bcbearer bcast_bearer;
Paul Gortmaker6765fd62011-12-29 20:52:18 -0500102static struct tipc_bclink bcast_link;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100103
Paul Gortmaker7f9ab6a2011-12-29 20:55:27 -0500104static struct tipc_bcbearer *bcbearer = &bcast_bearer;
Paul Gortmaker6765fd62011-12-29 20:52:18 -0500105static struct tipc_bclink *bclink = &bcast_link;
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500106static struct tipc_link *bcl = &bcast_link.link;
Allan Stephensc47e9b92011-10-24 10:29:26 -0400107
Ingo Molnar34af9462006-06-27 02:53:55 -0700108static DEFINE_SPINLOCK(bc_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100109
Allan Stephens3aec9cc2010-05-11 14:30:07 +0000110const char tipc_bclink_name[] = "broadcast-link";
Per Lidenb97bf3f2006-01-02 19:04:38 +0100111
stephen hemminger31e3c3f2010-10-13 13:20:35 +0000112static void tipc_nmap_diff(struct tipc_node_map *nm_a,
113 struct tipc_node_map *nm_b,
114 struct tipc_node_map *nm_diff);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100115
Sam Ravnborg05790c62006-03-20 22:37:04 -0800116static u32 bcbuf_acks(struct sk_buff *buf)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100117{
David S. Miller880b0052006-01-12 13:22:32 -0800118 return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100119}
120
Sam Ravnborg05790c62006-03-20 22:37:04 -0800121static void bcbuf_set_acks(struct sk_buff *buf, u32 acks)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100122{
David S. Miller880b0052006-01-12 13:22:32 -0800123 TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100124}
125
Sam Ravnborg05790c62006-03-20 22:37:04 -0800126static void bcbuf_decr_acks(struct sk_buff *buf)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100127{
128 bcbuf_set_acks(buf, bcbuf_acks(buf) - 1);
129}
130
Allan Stephenscd3decd2011-10-24 11:18:12 -0400131void tipc_bclink_add_node(u32 addr)
132{
133 spin_lock_bh(&bc_lock);
134 tipc_nmap_add(&bclink->bcast_nodes, addr);
135 spin_unlock_bh(&bc_lock);
136}
137
138void tipc_bclink_remove_node(u32 addr)
139{
140 spin_lock_bh(&bc_lock);
141 tipc_nmap_remove(&bclink->bcast_nodes, addr);
142 spin_unlock_bh(&bc_lock);
143}
Per Lidenb97bf3f2006-01-02 19:04:38 +0100144
Allan Stephens5b1f7bd2010-08-17 11:00:09 +0000145static void bclink_set_last_sent(void)
146{
147 if (bcl->next_out)
148 bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1);
149 else
150 bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1);
151}
152
153u32 tipc_bclink_get_last_sent(void)
154{
155 return bcl->fsm_msg_cnt;
156}
157
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400158static void bclink_update_last_sent(struct tipc_node *node, u32 seqno)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100159{
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400160 node->bclink.last_sent = less_eq(node->bclink.last_sent, seqno) ?
161 seqno : node->bclink.last_sent;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100162}
163
164
Ben Hutchings2c530402012-07-10 10:55:09 +0000165/**
Allan Stephens01d83ed2011-01-18 13:53:16 -0500166 * tipc_bclink_retransmit_to - get most recent node to request retransmission
167 *
168 * Called with bc_lock locked
169 */
Allan Stephens01d83ed2011-01-18 13:53:16 -0500170struct tipc_node *tipc_bclink_retransmit_to(void)
171{
172 return bclink->retransmit_to;
173}
174
175/**
Per Lidenb97bf3f2006-01-02 19:04:38 +0100176 * bclink_retransmit_pkt - retransmit broadcast packets
177 * @after: sequence number of last packet to *not* retransmit
178 * @to: sequence number of last packet to retransmit
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900179 *
Allan Stephensd356eeb2006-06-25 23:40:01 -0700180 * Called with bc_lock locked
Per Lidenb97bf3f2006-01-02 19:04:38 +0100181 */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100182static void bclink_retransmit_pkt(u32 after, u32 to)
183{
184 struct sk_buff *buf;
185
Per Lidenb97bf3f2006-01-02 19:04:38 +0100186 buf = bcl->first_out;
Allan Stephensa0168922010-12-31 18:59:35 +0000187 while (buf && less_eq(buf_seqno(buf), after))
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900188 buf = buf->next;
Allan Stephensd356eeb2006-06-25 23:40:01 -0700189 tipc_link_retransmit(bcl, buf, mod(to - after));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100190}
191
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900192/**
Per Liden4323add2006-01-18 00:38:21 +0100193 * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets
Per Lidenb97bf3f2006-01-02 19:04:38 +0100194 * @n_ptr: node that sent acknowledgement info
195 * @acked: broadcast sequence # that has been acknowledged
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900196 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100197 * Node is locked, bc_lock unlocked.
198 */
David S. Miller6c000552008-09-02 23:38:32 -0700199void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100200{
201 struct sk_buff *crs;
202 struct sk_buff *next;
203 unsigned int released = 0;
204
Per Lidenb97bf3f2006-01-02 19:04:38 +0100205 spin_lock_bh(&bc_lock);
206
Allan Stephens365595912011-10-24 15:26:24 -0400207 /* Bail out if tx queue is empty (no clean up is required) */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100208 crs = bcl->first_out;
Allan Stephens365595912011-10-24 15:26:24 -0400209 if (!crs)
210 goto exit;
211
212 /* Determine which messages need to be acknowledged */
213 if (acked == INVALID_LINK_SEQ) {
214 /*
215 * Contact with specified node has been lost, so need to
216 * acknowledge sent messages only (if other nodes still exist)
217 * or both sent and unsent messages (otherwise)
218 */
219 if (bclink->bcast_nodes.count)
220 acked = bcl->fsm_msg_cnt;
221 else
222 acked = bcl->next_out_no;
223 } else {
224 /*
225 * Bail out if specified sequence number does not correspond
226 * to a message that has been sent and not yet acknowledged
227 */
228 if (less(acked, buf_seqno(crs)) ||
229 less(bcl->fsm_msg_cnt, acked) ||
230 less_eq(acked, n_ptr->bclink.acked))
231 goto exit;
232 }
233
234 /* Skip over packets that node has previously acknowledged */
Allan Stephensa0168922010-12-31 18:59:35 +0000235 while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100236 crs = crs->next;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100237
238 /* Update packets that node is now acknowledging */
239
240 while (crs && less_eq(buf_seqno(crs), acked)) {
241 next = crs->next;
Allan Stephens10745cd2011-10-24 14:59:20 -0400242
243 if (crs != bcl->next_out)
244 bcbuf_decr_acks(crs);
Allan Stephens10745cd2011-10-24 14:59:20 -0400245 else {
246 bcbuf_set_acks(crs, 0);
247 bcl->next_out = next;
248 bclink_set_last_sent();
249 }
250
Per Lidenb97bf3f2006-01-02 19:04:38 +0100251 if (bcbuf_acks(crs) == 0) {
252 bcl->first_out = next;
253 bcl->out_queue_size--;
Allan Stephens5f6d9122011-11-04 13:24:29 -0400254 kfree_skb(crs);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100255 released = 1;
256 }
257 crs = next;
258 }
259 n_ptr->bclink.acked = acked;
260
261 /* Try resolving broadcast link congestion, if necessary */
262
Allan Stephens5b1f7bd2010-08-17 11:00:09 +0000263 if (unlikely(bcl->next_out)) {
Per Liden4323add2006-01-18 00:38:21 +0100264 tipc_link_push_queue(bcl);
Allan Stephens5b1f7bd2010-08-17 11:00:09 +0000265 bclink_set_last_sent();
266 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100267 if (unlikely(released && !list_empty(&bcl->waiting_ports)))
Per Liden4323add2006-01-18 00:38:21 +0100268 tipc_link_wakeup_ports(bcl, 0);
Allan Stephens365595912011-10-24 15:26:24 -0400269exit:
Per Lidenb97bf3f2006-01-02 19:04:38 +0100270 spin_unlock_bh(&bc_lock);
271}
272
Ben Hutchings2c530402012-07-10 10:55:09 +0000273/**
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400274 * tipc_bclink_update_link_state - update broadcast link state
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900275 *
Per Liden4323add2006-01-18 00:38:21 +0100276 * tipc_net_lock and node lock set
Per Lidenb97bf3f2006-01-02 19:04:38 +0100277 */
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400278void tipc_bclink_update_link_state(struct tipc_node *n_ptr, u32 last_sent)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100279{
280 struct sk_buff *buf;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100281
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400282 /* Ignore "stale" link state info */
283
284 if (less_eq(last_sent, n_ptr->bclink.last_in))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100285 return;
286
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400287 /* Update link synchronization state; quit if in sync */
288
289 bclink_update_last_sent(n_ptr, last_sent);
290
291 if (n_ptr->bclink.last_sent == n_ptr->bclink.last_in)
292 return;
293
294 /* Update out-of-sync state; quit if loss is still unconfirmed */
295
296 if ((++n_ptr->bclink.oos_state) == 1) {
297 if (n_ptr->bclink.deferred_size < (TIPC_MIN_LINK_WIN / 2))
298 return;
299 n_ptr->bclink.oos_state++;
300 }
301
302 /* Don't NACK if one has been recently sent (or seen) */
303
304 if (n_ptr->bclink.oos_state & 0x1)
305 return;
306
307 /* Send NACK */
308
stephen hemminger31e3c3f2010-10-13 13:20:35 +0000309 buf = tipc_buf_acquire(INT_H_SIZE);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100310 if (buf) {
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400311 struct tipc_msg *msg = buf_msg(buf);
312
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000313 tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG,
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400314 INT_H_SIZE, n_ptr->addr);
Allan Stephensbf781ec2011-01-25 16:12:39 -0500315 msg_set_non_seq(msg, 1);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100316 msg_set_mc_netid(msg, tipc_net_id);
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400317 msg_set_bcast_ack(msg, n_ptr->bclink.last_in);
318 msg_set_bcgap_after(msg, n_ptr->bclink.last_in);
319 msg_set_bcgap_to(msg, n_ptr->bclink.deferred_head
320 ? buf_seqno(n_ptr->bclink.deferred_head) - 1
321 : n_ptr->bclink.last_sent);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100322
Allan Stephens57732562011-10-26 11:41:45 -0400323 spin_lock_bh(&bc_lock);
Allan Stephens0f385132011-04-07 15:47:48 -0400324 tipc_bearer_send(&bcbearer->bearer, buf, NULL);
325 bcl->stats.sent_nacks++;
Allan Stephens57732562011-10-26 11:41:45 -0400326 spin_unlock_bh(&bc_lock);
Allan Stephens5f6d9122011-11-04 13:24:29 -0400327 kfree_skb(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100328
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400329 n_ptr->bclink.oos_state++;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100330 }
331}
332
Ben Hutchings2c530402012-07-10 10:55:09 +0000333/**
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400334 * bclink_peek_nack - monitor retransmission requests sent by other nodes
Per Lidenb97bf3f2006-01-02 19:04:38 +0100335 *
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400336 * Delay any upcoming NACK by this node if another node has already
337 * requested the first message this node is going to ask for.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900338 *
Per Liden4323add2006-01-18 00:38:21 +0100339 * Only tipc_net_lock set.
Per Lidenb97bf3f2006-01-02 19:04:38 +0100340 */
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400341static void bclink_peek_nack(struct tipc_msg *msg)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100342{
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400343 struct tipc_node *n_ptr = tipc_node_find(msg_destnode(msg));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100344
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400345 if (unlikely(!n_ptr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100346 return;
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400347
Per Liden4323add2006-01-18 00:38:21 +0100348 tipc_node_lock(n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100349
Ying Xue389dd9b2012-11-16 13:51:30 +0800350 if (n_ptr->bclink.recv_permitted &&
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400351 (n_ptr->bclink.last_in != n_ptr->bclink.last_sent) &&
352 (n_ptr->bclink.last_in == msg_bcgap_after(msg)))
353 n_ptr->bclink.oos_state = 2;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100354
Per Liden4323add2006-01-18 00:38:21 +0100355 tipc_node_unlock(n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100356}
357
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400358/*
Per Liden4323add2006-01-18 00:38:21 +0100359 * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster
Per Lidenb97bf3f2006-01-02 19:04:38 +0100360 */
Per Liden4323add2006-01-18 00:38:21 +0100361int tipc_bclink_send_msg(struct sk_buff *buf)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100362{
363 int res;
364
365 spin_lock_bh(&bc_lock);
366
Allan Stephens2b78f9a2011-10-24 13:05:55 -0400367 if (!bclink->bcast_nodes.count) {
368 res = msg_data_sz(buf_msg(buf));
Allan Stephens5f6d9122011-11-04 13:24:29 -0400369 kfree_skb(buf);
Allan Stephens2b78f9a2011-10-24 13:05:55 -0400370 goto exit;
371 }
372
Per Liden4323add2006-01-18 00:38:21 +0100373 res = tipc_link_send_buf(bcl, buf);
Allan Stephens9157baf2011-10-24 13:27:31 -0400374 if (likely(res >= 0)) {
Allan Stephens5b1f7bd2010-08-17 11:00:09 +0000375 bclink_set_last_sent();
Allan Stephens9157baf2011-10-24 13:27:31 -0400376 bcl->stats.queue_sz_counts++;
377 bcl->stats.accu_queue_sz += bcl->out_queue_size;
378 }
Allan Stephens2b78f9a2011-10-24 13:05:55 -0400379exit:
Per Lidenb97bf3f2006-01-02 19:04:38 +0100380 spin_unlock_bh(&bc_lock);
381 return res;
382}
383
Ben Hutchings2c530402012-07-10 10:55:09 +0000384/**
Allan Stephens63e7f1a2011-10-27 16:43:09 -0400385 * bclink_accept_pkt - accept an incoming, in-sequence broadcast packet
386 *
387 * Called with both sending node's lock and bc_lock taken.
388 */
Allan Stephens63e7f1a2011-10-27 16:43:09 -0400389static void bclink_accept_pkt(struct tipc_node *node, u32 seqno)
390{
391 bclink_update_last_sent(node, seqno);
392 node->bclink.last_in = seqno;
393 node->bclink.oos_state = 0;
394 bcl->stats.recv_info++;
395
396 /*
397 * Unicast an ACK periodically, ensuring that
398 * all nodes in the cluster don't ACK at the same time
399 */
400
401 if (((seqno - tipc_own_addr) % TIPC_MIN_LINK_WIN) == 0) {
402 tipc_link_send_proto_msg(
403 node->active_links[node->addr & 1],
404 STATE_MSG, 0, 0, 0, 0, 0);
405 bcl->stats.sent_acks++;
406 }
407}
408
Ben Hutchings2c530402012-07-10 10:55:09 +0000409/**
Per Liden4323add2006-01-18 00:38:21 +0100410 * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900411 *
Per Liden4323add2006-01-18 00:38:21 +0100412 * tipc_net_lock is read_locked, no other locks set
Per Lidenb97bf3f2006-01-02 19:04:38 +0100413 */
Per Liden4323add2006-01-18 00:38:21 +0100414void tipc_bclink_recv_pkt(struct sk_buff *buf)
Allan Stephensd356eeb2006-06-25 23:40:01 -0700415{
Per Lidenb97bf3f2006-01-02 19:04:38 +0100416 struct tipc_msg *msg = buf_msg(buf);
Allan Stephens5d3c4882011-04-07 13:57:25 -0400417 struct tipc_node *node;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100418 u32 next_in;
419 u32 seqno;
Allan Stephens8a275a62011-10-26 15:33:44 -0400420 int deferred;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100421
Allan Stephens5d3c4882011-04-07 13:57:25 -0400422 /* Screen out unwanted broadcast messages */
423
424 if (msg_mc_netid(msg) != tipc_net_id)
425 goto exit;
426
427 node = tipc_node_find(msg_prevnode(msg));
428 if (unlikely(!node))
429 goto exit;
430
431 tipc_node_lock(node);
Ying Xue389dd9b2012-11-16 13:51:30 +0800432 if (unlikely(!node->bclink.recv_permitted))
Allan Stephens5d3c4882011-04-07 13:57:25 -0400433 goto unlock;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100434
Allan Stephens8a275a62011-10-26 15:33:44 -0400435 /* Handle broadcast protocol message */
436
Per Lidenb97bf3f2006-01-02 19:04:38 +0100437 if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) {
Allan Stephens9f6bdcd42011-04-07 14:57:53 -0400438 if (msg_type(msg) != STATE_MSG)
439 goto unlock;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100440 if (msg_destnode(msg) == tipc_own_addr) {
Per Liden4323add2006-01-18 00:38:21 +0100441 tipc_bclink_acknowledge(node, msg_bcast_ack(msg));
442 tipc_node_unlock(node);
Allan Stephensd356eeb2006-06-25 23:40:01 -0700443 spin_lock_bh(&bc_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100444 bcl->stats.recv_nacks++;
Allan Stephens01d83ed2011-01-18 13:53:16 -0500445 bclink->retransmit_to = node;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100446 bclink_retransmit_pkt(msg_bcgap_after(msg),
447 msg_bcgap_to(msg));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900448 spin_unlock_bh(&bc_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100449 } else {
Allan Stephens5d3c4882011-04-07 13:57:25 -0400450 tipc_node_unlock(node);
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400451 bclink_peek_nack(msg);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100452 }
Allan Stephens5d3c4882011-04-07 13:57:25 -0400453 goto exit;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100454 }
455
Allan Stephens5d3c4882011-04-07 13:57:25 -0400456 /* Handle in-sequence broadcast message */
457
Per Lidenb97bf3f2006-01-02 19:04:38 +0100458 seqno = msg_seqno(msg);
Allan Stephens8a275a62011-10-26 15:33:44 -0400459 next_in = mod(node->bclink.last_in + 1);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100460
461 if (likely(seqno == next_in)) {
Allan Stephens8a275a62011-10-26 15:33:44 -0400462receive:
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400463 /* Deliver message to destination */
464
Per Lidenb97bf3f2006-01-02 19:04:38 +0100465 if (likely(msg_isdata(msg))) {
Allan Stephens63e7f1a2011-10-27 16:43:09 -0400466 spin_lock_bh(&bc_lock);
467 bclink_accept_pkt(node, seqno);
Allan Stephensb98158e2011-10-26 16:13:35 -0400468 spin_unlock_bh(&bc_lock);
Per Liden4323add2006-01-18 00:38:21 +0100469 tipc_node_unlock(node);
Allan Stephens9f6bdcd42011-04-07 14:57:53 -0400470 if (likely(msg_mcast(msg)))
471 tipc_port_recv_mcast(buf, NULL);
472 else
Allan Stephens5f6d9122011-11-04 13:24:29 -0400473 kfree_skb(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100474 } else if (msg_user(msg) == MSG_BUNDLER) {
Allan Stephens63e7f1a2011-10-27 16:43:09 -0400475 spin_lock_bh(&bc_lock);
476 bclink_accept_pkt(node, seqno);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100477 bcl->stats.recv_bundles++;
478 bcl->stats.recv_bundled += msg_msgcnt(msg);
Allan Stephensb98158e2011-10-26 16:13:35 -0400479 spin_unlock_bh(&bc_lock);
Per Liden4323add2006-01-18 00:38:21 +0100480 tipc_node_unlock(node);
481 tipc_link_recv_bundle(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100482 } else if (msg_user(msg) == MSG_FRAGMENTER) {
Allan Stephens63e7f1a2011-10-27 16:43:09 -0400483 int ret = tipc_link_recv_fragment(&node->bclink.defragm,
484 &buf, &msg);
485 if (ret < 0)
486 goto unlock;
487 spin_lock_bh(&bc_lock);
488 bclink_accept_pkt(node, seqno);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100489 bcl->stats.recv_fragments++;
Allan Stephens63e7f1a2011-10-27 16:43:09 -0400490 if (ret > 0)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100491 bcl->stats.recv_fragmented++;
Allan Stephensb98158e2011-10-26 16:13:35 -0400492 spin_unlock_bh(&bc_lock);
Per Liden4323add2006-01-18 00:38:21 +0100493 tipc_node_unlock(node);
494 tipc_net_route_msg(buf);
Allan Stephens9f6bdcd42011-04-07 14:57:53 -0400495 } else if (msg_user(msg) == NAME_DISTRIBUTOR) {
Allan Stephens63e7f1a2011-10-27 16:43:09 -0400496 spin_lock_bh(&bc_lock);
497 bclink_accept_pkt(node, seqno);
Allan Stephensb98158e2011-10-26 16:13:35 -0400498 spin_unlock_bh(&bc_lock);
Allan Stephens9f6bdcd42011-04-07 14:57:53 -0400499 tipc_node_unlock(node);
500 tipc_named_recv(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100501 } else {
Allan Stephens63e7f1a2011-10-27 16:43:09 -0400502 spin_lock_bh(&bc_lock);
503 bclink_accept_pkt(node, seqno);
Allan Stephensb98158e2011-10-26 16:13:35 -0400504 spin_unlock_bh(&bc_lock);
Per Liden4323add2006-01-18 00:38:21 +0100505 tipc_node_unlock(node);
Allan Stephens5f6d9122011-11-04 13:24:29 -0400506 kfree_skb(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100507 }
Allan Stephens5d3c4882011-04-07 13:57:25 -0400508 buf = NULL;
Allan Stephens8a275a62011-10-26 15:33:44 -0400509
510 /* Determine new synchronization state */
511
Allan Stephens5d3c4882011-04-07 13:57:25 -0400512 tipc_node_lock(node);
Allan Stephens8a275a62011-10-26 15:33:44 -0400513 if (unlikely(!tipc_node_is_up(node)))
514 goto unlock;
515
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400516 if (node->bclink.last_in == node->bclink.last_sent)
Allan Stephens8a275a62011-10-26 15:33:44 -0400517 goto unlock;
518
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400519 if (!node->bclink.deferred_head) {
520 node->bclink.oos_state = 1;
521 goto unlock;
522 }
523
Allan Stephens8a275a62011-10-26 15:33:44 -0400524 msg = buf_msg(node->bclink.deferred_head);
525 seqno = msg_seqno(msg);
526 next_in = mod(next_in + 1);
527 if (seqno != next_in)
528 goto unlock;
529
530 /* Take in-sequence message from deferred queue & deliver it */
531
532 buf = node->bclink.deferred_head;
533 node->bclink.deferred_head = buf->next;
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400534 node->bclink.deferred_size--;
Allan Stephens8a275a62011-10-26 15:33:44 -0400535 goto receive;
536 }
537
538 /* Handle out-of-sequence broadcast message */
539
540 if (less(next_in, seqno)) {
Allan Stephens8a275a62011-10-26 15:33:44 -0400541 deferred = tipc_link_defer_pkt(&node->bclink.deferred_head,
542 &node->bclink.deferred_tail,
543 buf);
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400544 node->bclink.deferred_size += deferred;
545 bclink_update_last_sent(node, seqno);
Allan Stephens5d3c4882011-04-07 13:57:25 -0400546 buf = NULL;
Allan Stephens8a275a62011-10-26 15:33:44 -0400547 } else
548 deferred = 0;
549
Allan Stephensb98158e2011-10-26 16:13:35 -0400550 spin_lock_bh(&bc_lock);
551
Allan Stephens8a275a62011-10-26 15:33:44 -0400552 if (deferred)
553 bcl->stats.deferred_recv++;
Allan Stephens0232c5a2011-10-26 15:57:26 -0400554 else
555 bcl->stats.duplicates++;
Allan Stephens8a275a62011-10-26 15:33:44 -0400556
Allan Stephensb98158e2011-10-26 16:13:35 -0400557 spin_unlock_bh(&bc_lock);
558
Allan Stephens5d3c4882011-04-07 13:57:25 -0400559unlock:
Per Liden4323add2006-01-18 00:38:21 +0100560 tipc_node_unlock(node);
Allan Stephens5d3c4882011-04-07 13:57:25 -0400561exit:
Allan Stephens5f6d9122011-11-04 13:24:29 -0400562 kfree_skb(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100563}
564
David S. Miller6c000552008-09-02 23:38:32 -0700565u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100566{
Ying Xue389dd9b2012-11-16 13:51:30 +0800567 return (n_ptr->bclink.recv_permitted &&
Per Liden4323add2006-01-18 00:38:21 +0100568 (tipc_bclink_get_last_sent() != n_ptr->bclink.acked));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100569}
570
571
572/**
Per Liden4323add2006-01-18 00:38:21 +0100573 * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900574 *
Allan Stephens2ff9f922011-04-07 10:44:54 -0400575 * Send packet over as many bearers as necessary to reach all nodes
576 * that have joined the broadcast link.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900577 *
Allan Stephens2ff9f922011-04-07 10:44:54 -0400578 * Returns 0 (packet sent successfully) under all circumstances,
579 * since the broadcast link's pseudo-bearer never blocks
Per Lidenb97bf3f2006-01-02 19:04:38 +0100580 */
Paul Gortmakerae8509c2013-06-17 10:54:47 -0400581static int tipc_bcbearer_send(struct sk_buff *buf, struct tipc_bearer *unused1,
Adrian Bunk988f0882006-03-20 22:37:52 -0800582 struct tipc_media_addr *unused2)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100583{
Per Lidenb97bf3f2006-01-02 19:04:38 +0100584 int bp_index;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100585
Gerlando Falautoe6160712013-05-01 12:04:44 +0000586 /* Prepare broadcast link message for reliable transmission,
Allan Stephens2ff9f922011-04-07 10:44:54 -0400587 * if first time trying to send it;
588 * preparation is skipped for broadcast link protocol messages
589 * since they are sent in an unreliable manner and don't need it
590 */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100591 if (likely(!msg_non_seq(buf_msg(buf)))) {
592 struct tipc_msg *msg;
593
Allan Stephenscd3decd2011-10-24 11:18:12 -0400594 bcbuf_set_acks(buf, bclink->bcast_nodes.count);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100595 msg = buf_msg(buf);
Allan Stephens40aecb12008-06-04 17:54:48 -0700596 msg_set_non_seq(msg, 1);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100597 msg_set_mc_netid(msg, tipc_net_id);
Allan Stephens0048b822010-08-17 11:00:10 +0000598 bcl->stats.sent_info++;
Allan Stephens5e726902011-05-23 13:14:18 -0400599
Allan Stephenscd3decd2011-10-24 11:18:12 -0400600 if (WARN_ON(!bclink->bcast_nodes.count)) {
Allan Stephens5e726902011-05-23 13:14:18 -0400601 dump_stack();
602 return 0;
603 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100604 }
605
Per Lidenb97bf3f2006-01-02 19:04:38 +0100606 /* Send buffer over bearers until all targets reached */
Allan Stephenscd3decd2011-10-24 11:18:12 -0400607 bcbearer->remains = bclink->bcast_nodes;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100608
609 for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) {
Allan Stephens2d627b92011-01-07 13:00:11 -0500610 struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary;
611 struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary;
Gerlando Falauto77861d92013-05-01 12:04:45 +0000612 struct tipc_bearer *b = p;
Gerlando Falauto488fc9a2013-05-01 12:04:46 +0000613 struct sk_buff *tbuf;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100614
615 if (!p)
Gerlando Falautoe6160712013-05-01 12:04:44 +0000616 break; /* No more bearers to try */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100617
Gerlando Falauto77861d92013-05-01 12:04:45 +0000618 if (tipc_bearer_blocked(p)) {
619 if (!s || tipc_bearer_blocked(s))
620 continue; /* Can't use either bearer */
621 b = s;
622 }
623
624 tipc_nmap_diff(&bcbearer->remains, &b->nodes,
Gerlando Falautoe6160712013-05-01 12:04:44 +0000625 &bcbearer->remains_new);
Allan Stephens65f51ef2006-06-25 23:53:20 -0700626 if (bcbearer->remains_new.count == bcbearer->remains.count)
Gerlando Falautoe6160712013-05-01 12:04:44 +0000627 continue; /* Nothing added by bearer pair */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100628
Gerlando Falauto488fc9a2013-05-01 12:04:46 +0000629 if (bp_index == 0) {
630 /* Use original buffer for first bearer */
631 tipc_bearer_send(b, buf, &b->bcast_addr);
632 } else {
633 /* Avoid concurrent buffer access */
634 tbuf = pskb_copy(buf, GFP_ATOMIC);
635 if (!tbuf)
636 break;
637 tipc_bearer_send(b, tbuf, &b->bcast_addr);
638 kfree_skb(tbuf); /* Bearer keeps a clone */
639 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100640
Gerlando Falautoe6160712013-05-01 12:04:44 +0000641 /* Swap bearers for next packet */
Neil Horman1a624832010-03-15 08:02:24 +0000642 if (s) {
643 bcbearer->bpairs[bp_index].primary = s;
644 bcbearer->bpairs[bp_index].secondary = p;
645 }
646
Allan Stephens65f51ef2006-06-25 23:53:20 -0700647 if (bcbearer->remains_new.count == 0)
Gerlando Falautoe6160712013-05-01 12:04:44 +0000648 break; /* All targets reached */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100649
Allan Stephens65f51ef2006-06-25 23:53:20 -0700650 bcbearer->remains = bcbearer->remains_new;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100651 }
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900652
Allan Stephens2ff9f922011-04-07 10:44:54 -0400653 return 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100654}
655
656/**
Per Liden4323add2006-01-18 00:38:21 +0100657 * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer
Per Lidenb97bf3f2006-01-02 19:04:38 +0100658 */
Per Liden4323add2006-01-18 00:38:21 +0100659void tipc_bcbearer_sort(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100660{
Paul Gortmaker7f9ab6a2011-12-29 20:55:27 -0500661 struct tipc_bcbearer_pair *bp_temp = bcbearer->bpairs_temp;
662 struct tipc_bcbearer_pair *bp_curr;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100663 int b_index;
664 int pri;
665
666 spin_lock_bh(&bc_lock);
667
668 /* Group bearers by priority (can assume max of two per priority) */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100669 memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp));
670
671 for (b_index = 0; b_index < MAX_BEARERS; b_index++) {
Allan Stephens2d627b92011-01-07 13:00:11 -0500672 struct tipc_bearer *b = &tipc_bearers[b_index];
Per Lidenb97bf3f2006-01-02 19:04:38 +0100673
674 if (!b->active || !b->nodes.count)
675 continue;
676
677 if (!bp_temp[b->priority].primary)
678 bp_temp[b->priority].primary = b;
679 else
680 bp_temp[b->priority].secondary = b;
681 }
682
683 /* Create array of bearer pairs for broadcasting */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100684 bp_curr = bcbearer->bpairs;
685 memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs));
686
Per Liden16cb4b32006-01-13 22:22:22 +0100687 for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100688
689 if (!bp_temp[pri].primary)
690 continue;
691
692 bp_curr->primary = bp_temp[pri].primary;
693
694 if (bp_temp[pri].secondary) {
Per Liden4323add2006-01-18 00:38:21 +0100695 if (tipc_nmap_equal(&bp_temp[pri].primary->nodes,
696 &bp_temp[pri].secondary->nodes)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100697 bp_curr->secondary = bp_temp[pri].secondary;
698 } else {
699 bp_curr++;
700 bp_curr->primary = bp_temp[pri].secondary;
701 }
702 }
703
704 bp_curr++;
705 }
706
707 spin_unlock_bh(&bc_lock);
708}
709
Per Lidenb97bf3f2006-01-02 19:04:38 +0100710
Per Liden4323add2006-01-18 00:38:21 +0100711int tipc_bclink_stats(char *buf, const u32 buf_size)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100712{
Erik Hugnedc1aed32012-06-29 00:50:23 -0400713 int ret;
714 struct tipc_stats *s;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100715
716 if (!bcl)
717 return 0;
718
Per Lidenb97bf3f2006-01-02 19:04:38 +0100719 spin_lock_bh(&bc_lock);
720
Erik Hugnedc1aed32012-06-29 00:50:23 -0400721 s = &bcl->stats;
722
723 ret = tipc_snprintf(buf, buf_size, "Link <%s>\n"
724 " Window:%u packets\n",
725 bcl->name, bcl->queue_limit[0]);
726 ret += tipc_snprintf(buf + ret, buf_size - ret,
727 " RX packets:%u fragments:%u/%u bundles:%u/%u\n",
728 s->recv_info, s->recv_fragments,
729 s->recv_fragmented, s->recv_bundles,
730 s->recv_bundled);
731 ret += tipc_snprintf(buf + ret, buf_size - ret,
732 " TX packets:%u fragments:%u/%u bundles:%u/%u\n",
733 s->sent_info, s->sent_fragments,
734 s->sent_fragmented, s->sent_bundles,
735 s->sent_bundled);
736 ret += tipc_snprintf(buf + ret, buf_size - ret,
737 " RX naks:%u defs:%u dups:%u\n",
738 s->recv_nacks, s->deferred_recv, s->duplicates);
739 ret += tipc_snprintf(buf + ret, buf_size - ret,
740 " TX naks:%u acks:%u dups:%u\n",
741 s->sent_nacks, s->sent_acks, s->retransmitted);
742 ret += tipc_snprintf(buf + ret, buf_size - ret,
Ying Xue3c294cb2012-11-15 11:34:45 +0800743 " Congestion link:%u Send queue max:%u avg:%u\n",
744 s->link_congs, s->max_queue_sz,
Erik Hugnedc1aed32012-06-29 00:50:23 -0400745 s->queue_sz_counts ?
746 (s->accu_queue_sz / s->queue_sz_counts) : 0);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100747
748 spin_unlock_bh(&bc_lock);
Erik Hugnedc1aed32012-06-29 00:50:23 -0400749 return ret;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100750}
751
Per Liden4323add2006-01-18 00:38:21 +0100752int tipc_bclink_reset_stats(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100753{
754 if (!bcl)
755 return -ENOPROTOOPT;
756
757 spin_lock_bh(&bc_lock);
758 memset(&bcl->stats, 0, sizeof(bcl->stats));
759 spin_unlock_bh(&bc_lock);
Allan Stephens0e35fd52008-07-14 22:44:01 -0700760 return 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100761}
762
Per Liden4323add2006-01-18 00:38:21 +0100763int tipc_bclink_set_queue_limits(u32 limit)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100764{
765 if (!bcl)
766 return -ENOPROTOOPT;
767 if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN))
768 return -EINVAL;
769
770 spin_lock_bh(&bc_lock);
Per Liden4323add2006-01-18 00:38:21 +0100771 tipc_link_set_queue_limits(bcl, limit);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100772 spin_unlock_bh(&bc_lock);
Allan Stephens0e35fd52008-07-14 22:44:01 -0700773 return 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100774}
775
Allan Stephensc47e9b92011-10-24 10:29:26 -0400776void tipc_bclink_init(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100777{
Per Lidenb97bf3f2006-01-02 19:04:38 +0100778 bcbearer->bearer.media = &bcbearer->media;
Per Liden4323add2006-01-18 00:38:21 +0100779 bcbearer->media.send_msg = tipc_bcbearer_send;
Allan Stephens2e2d9be2011-04-07 10:22:31 -0400780 sprintf(bcbearer->media.name, "tipc-broadcast");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100781
Per Lidenb97bf3f2006-01-02 19:04:38 +0100782 INIT_LIST_HEAD(&bcl->waiting_ports);
783 bcl->next_out_no = 1;
Ingo Molnar34af9462006-06-27 02:53:55 -0700784 spin_lock_init(&bclink->node.lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100785 bcl->owner = &bclink->node;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900786 bcl->max_pkt = MAX_PKT_DEFAULT_MCAST;
Per Liden4323add2006-01-18 00:38:21 +0100787 tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT);
Erik Hugnec5c73dc2013-02-14 14:43:33 +0000788 spin_lock_init(&bcbearer->bearer.lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100789 bcl->b_ptr = &bcbearer->bearer;
790 bcl->state = WORKING_WORKING;
Stephen Hemminger4b704d52009-03-18 19:11:29 -0700791 strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100792}
793
Per Liden4323add2006-01-18 00:38:21 +0100794void tipc_bclink_stop(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100795{
796 spin_lock_bh(&bc_lock);
Allan Stephensc47e9b92011-10-24 10:29:26 -0400797 tipc_link_stop(bcl);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100798 spin_unlock_bh(&bc_lock);
Allan Stephensc47e9b92011-10-24 10:29:26 -0400799
800 memset(bclink, 0, sizeof(*bclink));
801 memset(bcbearer, 0, sizeof(*bcbearer));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100802}
803
Allan Stephens3e22e622010-05-11 14:30:14 +0000804
805/**
806 * tipc_nmap_add - add a node to a node map
807 */
Allan Stephens3e22e622010-05-11 14:30:14 +0000808void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node)
809{
810 int n = tipc_node(node);
811 int w = n / WSIZE;
812 u32 mask = (1 << (n % WSIZE));
813
814 if ((nm_ptr->map[w] & mask) == 0) {
815 nm_ptr->count++;
816 nm_ptr->map[w] |= mask;
817 }
818}
819
820/**
821 * tipc_nmap_remove - remove a node from a node map
822 */
Allan Stephens3e22e622010-05-11 14:30:14 +0000823void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node)
824{
825 int n = tipc_node(node);
826 int w = n / WSIZE;
827 u32 mask = (1 << (n % WSIZE));
828
829 if ((nm_ptr->map[w] & mask) != 0) {
830 nm_ptr->map[w] &= ~mask;
831 nm_ptr->count--;
832 }
833}
834
835/**
836 * tipc_nmap_diff - find differences between node maps
837 * @nm_a: input node map A
838 * @nm_b: input node map B
839 * @nm_diff: output node map A-B (i.e. nodes of A that are not in B)
840 */
stephen hemminger31e3c3f2010-10-13 13:20:35 +0000841static void tipc_nmap_diff(struct tipc_node_map *nm_a,
842 struct tipc_node_map *nm_b,
843 struct tipc_node_map *nm_diff)
Allan Stephens3e22e622010-05-11 14:30:14 +0000844{
845 int stop = ARRAY_SIZE(nm_a->map);
846 int w;
847 int b;
848 u32 map;
849
850 memset(nm_diff, 0, sizeof(*nm_diff));
851 for (w = 0; w < stop; w++) {
852 map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]);
853 nm_diff->map[w] = map;
854 if (map != 0) {
855 for (b = 0 ; b < WSIZE; b++) {
856 if (map & (1 << b))
857 nm_diff->count++;
858 }
859 }
860 }
861}
Allan Stephens43608ed2010-05-11 14:30:15 +0000862
863/**
864 * tipc_port_list_add - add a port to a port list, ensuring no duplicates
865 */
Paul Gortmaker45843102011-12-29 20:33:30 -0500866void tipc_port_list_add(struct tipc_port_list *pl_ptr, u32 port)
Allan Stephens43608ed2010-05-11 14:30:15 +0000867{
Paul Gortmaker45843102011-12-29 20:33:30 -0500868 struct tipc_port_list *item = pl_ptr;
Allan Stephens43608ed2010-05-11 14:30:15 +0000869 int i;
870 int item_sz = PLSIZE;
871 int cnt = pl_ptr->count;
872
873 for (; ; cnt -= item_sz, item = item->next) {
874 if (cnt < PLSIZE)
875 item_sz = cnt;
876 for (i = 0; i < item_sz; i++)
877 if (item->ports[i] == port)
878 return;
879 if (i < PLSIZE) {
880 item->ports[i] = port;
881 pl_ptr->count++;
882 return;
883 }
884 if (!item->next) {
885 item->next = kmalloc(sizeof(*item), GFP_ATOMIC);
886 if (!item->next) {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400887 pr_warn("Incomplete multicast delivery, no memory\n");
Allan Stephens43608ed2010-05-11 14:30:15 +0000888 return;
889 }
890 item->next->next = NULL;
891 }
892 }
893}
894
895/**
896 * tipc_port_list_free - free dynamically created entries in port_list chain
897 *
898 */
Paul Gortmaker45843102011-12-29 20:33:30 -0500899void tipc_port_list_free(struct tipc_port_list *pl_ptr)
Allan Stephens43608ed2010-05-11 14:30:15 +0000900{
Paul Gortmaker45843102011-12-29 20:33:30 -0500901 struct tipc_port_list *item;
902 struct tipc_port_list *next;
Allan Stephens43608ed2010-05-11 14:30:15 +0000903
904 for (item = pl_ptr->next; item; item = next) {
905 next = item->next;
906 kfree(item);
907 }
908}