bcast.c 12.1 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/bcast.c: TIPC broadcast code
3
 *
4
 * Copyright (c) 2004-2006, 2014-2016, Ericsson AB
P
Per Liden 已提交
5
 * Copyright (c) 2004, Intel Corporation.
6
 * Copyright (c) 2005, 2010-2011, Wind River Systems
P
Per Liden 已提交
7 8
 * All rights reserved.
 *
P
Per Liden 已提交
9
 * Redistribution and use in source and binary forms, with or without
P
Per Liden 已提交
10 11
 * modification, are permitted provided that the following conditions are met:
 *
P
Per Liden 已提交
12 13 14 15 16 17 18 19
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the names of the copyright holders nor the names of its
 *    contributors may be used to endorse or promote products derived from
 *    this software without specific prior written permission.
P
Per Liden 已提交
20
 *
P
Per Liden 已提交
21 22 23 24 25 26 27 28 29 30 31 32 33 34
 * Alternatively, this software may be distributed under the terms of the
 * GNU General Public License ("GPL") version 2 as published by the Free
 * Software Foundation.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
P
Per Liden 已提交
35 36 37
 * POSSIBILITY OF SUCH DAMAGE.
 */

38
#include <linux/tipc_config.h>
39 40
#include "socket.h"
#include "msg.h"
P
Per Liden 已提交
41
#include "bcast.h"
42
#include "link.h"
43
#include "name_table.h"
P
Per Liden 已提交
44

45 46
#define	BCLINK_WIN_DEFAULT	50	/* bcast link window size (default) */
#define	BCLINK_WIN_MIN	        32	/* bcast minimum link window size */
P
Per Liden 已提交
47

48
const char tipc_bclink_name[] = "broadcast-link";
P
Per Liden 已提交
49

50
/**
51
 * struct tipc_bc_base - base structure for keeping broadcast send state
52
 * @link: broadcast send link structure
53 54 55
 * @inputq: data input queue; will only carry SOCK_WAKEUP messages
 * @dest: array keeping number of reachable destinations per bearer
 * @primary_bearer: a bearer having links to all broadcast destinations, if any
56
 * @bcast_support: indicates if primary bearer, if any, supports broadcast
57 58
 */
struct tipc_bc_base {
59
	struct tipc_link *link;
60
	struct sk_buff_head inputq;
61 62
	int dests[MAX_BEARERS];
	int primary_bearer;
63
	bool bcast_support;
64 65
};

66 67 68 69 70
static struct tipc_bc_base *tipc_bc_base(struct net *net)
{
	return tipc_net(net)->bcbase;
}

71
int tipc_bcast_get_mtu(struct net *net)
72
{
73
	return tipc_link_mtu(tipc_bc_sndlink(net));
74 75
}

76 77 78 79 80 81 82
/* tipc_bcbase_select_primary(): find a bearer with links to all destinations,
 *                               if any, and make it primary bearer
 */
static void tipc_bcbase_select_primary(struct net *net)
{
	struct tipc_bc_base *bb = tipc_bc_base(net);
	int all_dests =  tipc_link_bc_peers(bb->link);
83
	int i, mtu, prim;
84 85

	bb->primary_bearer = INVALID_BEARER_ID;
86
	bb->bcast_support = true;
87 88 89 90 91

	if (!all_dests)
		return;

	for (i = 0; i < MAX_BEARERS; i++) {
92 93 94 95 96 97
		if (!bb->dests[i])
			continue;

		mtu = tipc_bearer_mtu(net, i);
		if (mtu < tipc_link_mtu(bb->link))
			tipc_link_set_mtu(bb->link, mtu);
98
		bb->bcast_support &= tipc_bearer_bcast_support(net, i);
99 100 101 102 103 104 105 106 107
		if (bb->dests[i] < all_dests)
			continue;

		bb->primary_bearer = i;

		/* Reduce risk that all nodes select same primary */
		if ((i ^ tipc_own_addr(net)) & 1)
			break;
	}
108 109 110
	prim = bb->primary_bearer;
	if (prim != INVALID_BEARER_ID)
		bb->bcast_support = tipc_bearer_bcast_support(net, prim);
111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177
}

void tipc_bcast_inc_bearer_dst_cnt(struct net *net, int bearer_id)
{
	struct tipc_bc_base *bb = tipc_bc_base(net);

	tipc_bcast_lock(net);
	bb->dests[bearer_id]++;
	tipc_bcbase_select_primary(net);
	tipc_bcast_unlock(net);
}

void tipc_bcast_dec_bearer_dst_cnt(struct net *net, int bearer_id)
{
	struct tipc_bc_base *bb = tipc_bc_base(net);

	tipc_bcast_lock(net);
	bb->dests[bearer_id]--;
	tipc_bcbase_select_primary(net);
	tipc_bcast_unlock(net);
}

/* tipc_bcbase_xmit - broadcast a packet queue across one or more bearers
 *
 * Note that number of reachable destinations, as indicated in the dests[]
 * array, may transitionally differ from the number of destinations indicated
 * in each sent buffer. We can sustain this. Excess destination nodes will
 * drop and never acknowledge the unexpected packets, and missing destinations
 * will either require retransmission (if they are just about to be added to
 * the bearer), or be removed from the buffer's 'ackers' counter (if they
 * just went down)
 */
static void tipc_bcbase_xmit(struct net *net, struct sk_buff_head *xmitq)
{
	int bearer_id;
	struct tipc_bc_base *bb = tipc_bc_base(net);
	struct sk_buff *skb, *_skb;
	struct sk_buff_head _xmitq;

	if (skb_queue_empty(xmitq))
		return;

	/* The typical case: at least one bearer has links to all nodes */
	bearer_id = bb->primary_bearer;
	if (bearer_id >= 0) {
		tipc_bearer_bc_xmit(net, bearer_id, xmitq);
		return;
	}

	/* We have to transmit across all bearers */
	skb_queue_head_init(&_xmitq);
	for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
		if (!bb->dests[bearer_id])
			continue;

		skb_queue_walk(xmitq, skb) {
			_skb = pskb_copy_for_clone(skb, GFP_ATOMIC);
			if (!_skb)
				break;
			__skb_queue_tail(&_xmitq, _skb);
		}
		tipc_bearer_bc_xmit(net, bearer_id, &_xmitq);
	}
	__skb_queue_purge(xmitq);
	__skb_queue_purge(&_xmitq);
}

178
/* tipc_bcast_xmit - deliver buffer chain to all nodes in cluster
179
 *                    and to identified node local sockets
180
 * @net: the applicable net namespace
181
 * @list: chain of buffers containing message
182
 * Consumes the buffer chain.
183 184
 * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE
 */
185
int tipc_bcast_xmit(struct net *net, struct sk_buff_head *list)
186
{
187 188
	struct tipc_link *l = tipc_bc_sndlink(net);
	struct sk_buff_head xmitq, inputq, rcvq;
189 190
	int rc = 0;

191 192 193
	__skb_queue_head_init(&rcvq);
	__skb_queue_head_init(&xmitq);
	skb_queue_head_init(&inputq);
194

195 196 197
	/* Prepare message clone for local node */
	if (unlikely(!tipc_msg_reassemble(list, &rcvq)))
		return -EHOSTUNREACH;
198

199 200 201 202
	tipc_bcast_lock(net);
	if (tipc_link_bc_peers(l))
		rc = tipc_link_xmit(l, list, &xmitq);
	tipc_bcast_unlock(net);
203

204
	/* Don't send to local node if adding to link failed */
205
	if (unlikely(rc && (rc != -ELINKCONG))) {
206
		__skb_queue_purge(&rcvq);
207 208
		return rc;
	}
209

210
	/* Broadcast to all nodes, inluding local node */
211
	tipc_bcbase_xmit(net, &xmitq);
212 213
	tipc_sk_mcast_rcv(net, &rcvq, &inputq);
	__skb_queue_purge(list);
214
	return rc;
215
}
216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241

/* tipc_bcast_rcv - receive a broadcast packet, and deliver to rcv link
 *
 * RCU is locked, no other locks set
 */
int tipc_bcast_rcv(struct net *net, struct tipc_link *l, struct sk_buff *skb)
{
	struct tipc_msg *hdr = buf_msg(skb);
	struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq;
	struct sk_buff_head xmitq;
	int rc;

	__skb_queue_head_init(&xmitq);

	if (msg_mc_netid(hdr) != tipc_netid(net) || !tipc_link_is_up(l)) {
		kfree_skb(skb);
		return 0;
	}

	tipc_bcast_lock(net);
	if (msg_user(hdr) == BCAST_PROTOCOL)
		rc = tipc_link_bc_nack_rcv(l, skb, &xmitq);
	else
		rc = tipc_link_rcv(l, skb, NULL);
	tipc_bcast_unlock(net);

242
	tipc_bcbase_xmit(net, &xmitq);
243 244 245 246 247 248 249 250 251 252 253 254

	/* Any socket wakeup messages ? */
	if (!skb_queue_empty(inputq))
		tipc_sk_rcv(net, inputq);

	return rc;
}

/* tipc_bcast_ack_rcv - receive and handle a broadcast acknowledge
 *
 * RCU is locked, no other locks set
 */
255 256
void tipc_bcast_ack_rcv(struct net *net, struct tipc_link *l,
			struct tipc_msg *hdr)
257 258
{
	struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq;
259
	u16 acked = msg_bcast_ack(hdr);
260 261
	struct sk_buff_head xmitq;

262 263 264 265
	/* Ignore bc acks sent by peer before bcast synch point was received */
	if (msg_bc_ack_invalid(hdr))
		return;

266 267 268 269 270 271
	__skb_queue_head_init(&xmitq);

	tipc_bcast_lock(net);
	tipc_link_bc_ack_rcv(l, acked, &xmitq);
	tipc_bcast_unlock(net);

272
	tipc_bcbase_xmit(net, &xmitq);
273 274 275 276 277 278 279 280 281 282

	/* Any socket wakeup messages ? */
	if (!skb_queue_empty(inputq))
		tipc_sk_rcv(net, inputq);
}

/* tipc_bcast_synch_rcv -  check and update rcv link with peer's send state
 *
 * RCU is locked, no other locks set
 */
283 284
int tipc_bcast_sync_rcv(struct net *net, struct tipc_link *l,
			struct tipc_msg *hdr)
285 286 287
{
	struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq;
	struct sk_buff_head xmitq;
288
	int rc = 0;
289 290 291 292

	__skb_queue_head_init(&xmitq);

	tipc_bcast_lock(net);
293 294 295
	if (msg_type(hdr) != STATE_MSG) {
		tipc_link_bc_init_rcv(l, hdr);
	} else if (!msg_bc_ack_invalid(hdr)) {
296
		tipc_link_bc_ack_rcv(l, msg_bcast_ack(hdr), &xmitq);
297
		rc = tipc_link_bc_sync_rcv(l, hdr, &xmitq);
298 299 300
	}
	tipc_bcast_unlock(net);

301
	tipc_bcbase_xmit(net, &xmitq);
302 303 304 305

	/* Any socket wakeup messages ? */
	if (!skb_queue_empty(inputq))
		tipc_sk_rcv(net, inputq);
306
	return rc;
307 308 309 310 311 312
}

/* tipc_bcast_add_peer - add a peer node to broadcast link and bearer
 *
 * RCU is locked, node lock is set
 */
313
void tipc_bcast_add_peer(struct net *net, struct tipc_link *uc_l,
314 315 316 317
			 struct sk_buff_head *xmitq)
{
	struct tipc_link *snd_l = tipc_bc_sndlink(net);

318
	tipc_bcast_lock(net);
319
	tipc_link_add_bc_peer(snd_l, uc_l, xmitq);
320 321
	tipc_bcbase_select_primary(net);
	tipc_bcast_unlock(net);
322 323 324 325 326 327
}

/* tipc_bcast_remove_peer - remove a peer node from broadcast link and bearer
 *
 * RCU is locked, node lock is set
 */
328
void tipc_bcast_remove_peer(struct net *net, struct tipc_link *rcv_l)
329 330
{
	struct tipc_link *snd_l = tipc_bc_sndlink(net);
331
	struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq;
332 333 334 335
	struct sk_buff_head xmitq;

	__skb_queue_head_init(&xmitq);

336
	tipc_bcast_lock(net);
337
	tipc_link_remove_bc_peer(snd_l, rcv_l, &xmitq);
338 339
	tipc_bcbase_select_primary(net);
	tipc_bcast_unlock(net);
340

341
	tipc_bcbase_xmit(net, &xmitq);
342 343 344 345 346 347

	/* Any socket wakeup messages ? */
	if (!skb_queue_empty(inputq))
		tipc_sk_rcv(net, inputq);
}

348
int tipc_bclink_reset_stats(struct net *net)
P
Per Liden 已提交
349
{
350
	struct tipc_link *l = tipc_bc_sndlink(net);
351

352
	if (!l)
P
Per Liden 已提交
353 354
		return -ENOPROTOOPT;

355
	tipc_bcast_lock(net);
356
	tipc_link_reset_stats(l);
357
	tipc_bcast_unlock(net);
358
	return 0;
P
Per Liden 已提交
359 360
}

361
static int tipc_bc_link_set_queue_limits(struct net *net, u32 limit)
P
Per Liden 已提交
362
{
363
	struct tipc_link *l = tipc_bc_sndlink(net);
364

365
	if (!l)
P
Per Liden 已提交
366
		return -ENOPROTOOPT;
367 368 369
	if (limit < BCLINK_WIN_MIN)
		limit = BCLINK_WIN_MIN;
	if (limit > TIPC_MAX_LINK_WIN)
P
Per Liden 已提交
370
		return -EINVAL;
371 372 373
	tipc_bcast_lock(net);
	tipc_link_set_queue_limits(l, limit);
	tipc_bcast_unlock(net);
374
	return 0;
P
Per Liden 已提交
375 376
}

377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394
int tipc_nl_bc_link_set(struct net *net, struct nlattr *attrs[])
{
	int err;
	u32 win;
	struct nlattr *props[TIPC_NLA_PROP_MAX + 1];

	if (!attrs[TIPC_NLA_LINK_PROP])
		return -EINVAL;

	err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP], props);
	if (err)
		return err;

	if (!props[TIPC_NLA_PROP_WIN])
		return -EOPNOTSUPP;

	win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);

395
	return tipc_bc_link_set_queue_limits(net, win);
396 397
}

398
int tipc_bcast_init(struct net *net)
P
Per Liden 已提交
399
{
400 401 402 403 404 405 406 407
	struct tipc_net *tn = tipc_net(net);
	struct tipc_bc_base *bb = NULL;
	struct tipc_link *l = NULL;

	bb = kzalloc(sizeof(*bb), GFP_ATOMIC);
	if (!bb)
		goto enomem;
	tn->bcbase = bb;
408
	spin_lock_init(&tipc_net(net)->bclock);
409

410
	if (!tipc_link_bc_create(net, 0, 0,
411
				 U16_MAX,
412
				 BCLINK_WIN_DEFAULT,
413
				 0,
414
				 &bb->inputq,
415
				 NULL,
416
				 NULL,
417 418 419 420
				 &l))
		goto enomem;
	bb->link = l;
	tn->bcl = l;
421
	return 0;
422 423 424 425
enomem:
	kfree(bb);
	kfree(l);
	return -ENOMEM;
P
Per Liden 已提交
426 427
}

428
void tipc_bcast_stop(struct net *net)
P
Per Liden 已提交
429
{
430 431
	struct tipc_net *tn = net_generic(net, tipc_net_id);

432
	synchronize_net();
433
	kfree(tn->bcbase);
434
	kfree(tn->bcl);
P
Per Liden 已提交
435
}
436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465

void tipc_nlist_init(struct tipc_nlist *nl, u32 self)
{
	memset(nl, 0, sizeof(*nl));
	INIT_LIST_HEAD(&nl->list);
	nl->self = self;
}

void tipc_nlist_add(struct tipc_nlist *nl, u32 node)
{
	if (node == nl->self)
		nl->local = true;
	else if (u32_push(&nl->list, node))
		nl->remote++;
}

void tipc_nlist_del(struct tipc_nlist *nl, u32 node)
{
	if (node == nl->self)
		nl->local = false;
	else if (u32_del(&nl->list, node))
		nl->remote--;
}

void tipc_nlist_purge(struct tipc_nlist *nl)
{
	u32_list_purge(&nl->list);
	nl->remote = 0;
	nl->local = 0;
}