bcast.c 23.3 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/bcast.c: TIPC broadcast code
3
 *
P
Per Liden 已提交
4
 * Copyright (c) 2004-2006, 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 38 39 40 41
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "core.h"
#include "link.h"
#include "port.h"
#include "bcast.h"
42
#include "name_distr.h"
P
Per Liden 已提交
43 44 45 46 47 48

#define MAX_PKT_DEFAULT_MCAST 1500	/* bcast link max packet size (fixed) */

#define BCLINK_WIN_DEFAULT 20		/* bcast link window size (default) */

/**
49
 * struct tipc_bcbearer_pair - a pair of bearers used by broadcast link
P
Per Liden 已提交
50 51
 * @primary: pointer to primary bearer
 * @secondary: pointer to secondary bearer
52 53
 *
 * Bearers must have same priority and same set of reachable destinations
P
Per Liden 已提交
54 55 56
 * to be paired.
 */

57
struct tipc_bcbearer_pair {
58 59
	struct tipc_bearer *primary;
	struct tipc_bearer *secondary;
P
Per Liden 已提交
60 61 62
};

/**
63
 * struct tipc_bcbearer - bearer used by broadcast link
P
Per Liden 已提交
64 65 66
 * @bearer: (non-standard) broadcast bearer structure
 * @media: (non-standard) broadcast media structure
 * @bpairs: array of bearer pairs
67 68 69
 * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort()
 * @remains: temporary node map used by tipc_bcbearer_send()
 * @remains_new: temporary node map used tipc_bcbearer_send()
70
 *
71 72 73 74
 * Note: The fields labelled "temporary" are incorporated into the bearer
 * to avoid consuming potentially limited stack space through the use of
 * large local variables within multicast routines.  Concurrent access is
 * prevented through use of the spinlock "bc_lock".
P
Per Liden 已提交
75 76
 */

77
struct tipc_bcbearer {
78
	struct tipc_bearer bearer;
79
	struct tipc_media media;
80 81
	struct tipc_bcbearer_pair bpairs[MAX_BEARERS];
	struct tipc_bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1];
82 83
	struct tipc_node_map remains;
	struct tipc_node_map remains_new;
P
Per Liden 已提交
84 85 86
};

/**
87
 * struct tipc_bclink - link used for broadcast messages
P
Per Liden 已提交
88 89
 * @link: (non-standard) broadcast link structure
 * @node: (non-standard) node structure representing b'cast link's peer node
90
 * @bcast_nodes: map of broadcast-capable nodes
91
 * @retransmit_to: node that most recently requested a retransmit
92
 *
P
Per Liden 已提交
93 94 95
 * Handles sequence numbering, fragmentation, bundling, etc.
 */

96
struct tipc_bclink {
P
Per Liden 已提交
97
	struct link link;
98
	struct tipc_node node;
99
	struct tipc_node_map bcast_nodes;
100
	struct tipc_node *retransmit_to;
P
Per Liden 已提交
101 102
};

103
static struct tipc_bcbearer bcast_bearer;
104
static struct tipc_bclink bcast_link;
105

106
static struct tipc_bcbearer *bcbearer = &bcast_bearer;
107
static struct tipc_bclink *bclink = &bcast_link;
108
static struct link *bcl = &bcast_link.link;
P
Per Liden 已提交
109

I
Ingo Molnar 已提交
110
static DEFINE_SPINLOCK(bc_lock);
P
Per Liden 已提交
111

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

114 115 116
static void tipc_nmap_diff(struct tipc_node_map *nm_a,
			   struct tipc_node_map *nm_b,
			   struct tipc_node_map *nm_diff);
P
Per Liden 已提交
117

S
Sam Ravnborg 已提交
118
static u32 bcbuf_acks(struct sk_buff *buf)
P
Per Liden 已提交
119
{
120
	return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle;
P
Per Liden 已提交
121 122
}

S
Sam Ravnborg 已提交
123
static void bcbuf_set_acks(struct sk_buff *buf, u32 acks)
P
Per Liden 已提交
124
{
125
	TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks;
P
Per Liden 已提交
126 127
}

S
Sam Ravnborg 已提交
128
static void bcbuf_decr_acks(struct sk_buff *buf)
P
Per Liden 已提交
129 130 131 132
{
	bcbuf_set_acks(buf, bcbuf_acks(buf) - 1);
}

133 134 135 136 137 138 139 140 141 142 143 144 145
void tipc_bclink_add_node(u32 addr)
{
	spin_lock_bh(&bc_lock);
	tipc_nmap_add(&bclink->bcast_nodes, addr);
	spin_unlock_bh(&bc_lock);
}

void tipc_bclink_remove_node(u32 addr)
{
	spin_lock_bh(&bc_lock);
	tipc_nmap_remove(&bclink->bcast_nodes, addr);
	spin_unlock_bh(&bc_lock);
}
P
Per Liden 已提交
146

147 148 149 150 151 152 153 154 155 156 157 158 159
static void bclink_set_last_sent(void)
{
	if (bcl->next_out)
		bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1);
	else
		bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1);
}

u32 tipc_bclink_get_last_sent(void)
{
	return bcl->fsm_msg_cnt;
}

160
/**
P
Per Liden 已提交
161
 * bclink_set_gap - set gap according to contents of current deferred pkt queue
162
 *
P
Per Liden 已提交
163 164 165
 * Called with 'node' locked, bc_lock unlocked
 */

166
static void bclink_set_gap(struct tipc_node *n_ptr)
P
Per Liden 已提交
167 168 169 170 171 172 173 174 175
{
	struct sk_buff *buf = n_ptr->bclink.deferred_head;

	n_ptr->bclink.gap_after = n_ptr->bclink.gap_to =
		mod(n_ptr->bclink.last_in);
	if (unlikely(buf != NULL))
		n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1);
}

176
/**
P
Per Liden 已提交
177
 * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment
178
 *
P
Per Liden 已提交
179 180
 * This mechanism endeavours to prevent all nodes in network from trying
 * to ACK or NACK at the same time.
181
 *
P
Per Liden 已提交
182
 * Note: TIPC uses a different trigger to distribute ACKs than it does to
183
 *       distribute NACKs, but tries to use the same spacing (divide by 16).
P
Per Liden 已提交
184 185
 */

S
Sam Ravnborg 已提交
186
static int bclink_ack_allowed(u32 n)
P
Per Liden 已提交
187
{
E
Eric Dumazet 已提交
188
	return (n % TIPC_MIN_LINK_WIN) == tipc_own_tag;
P
Per Liden 已提交
189 190 191
}


192 193 194 195 196 197 198 199 200 201 202
/**
 * tipc_bclink_retransmit_to - get most recent node to request retransmission
 *
 * Called with bc_lock locked
 */

struct tipc_node *tipc_bclink_retransmit_to(void)
{
	return bclink->retransmit_to;
}

203
/**
P
Per Liden 已提交
204 205 206
 * bclink_retransmit_pkt - retransmit broadcast packets
 * @after: sequence number of last packet to *not* retransmit
 * @to: sequence number of last packet to retransmit
207
 *
208
 * Called with bc_lock locked
P
Per Liden 已提交
209 210 211 212 213 214 215
 */

static void bclink_retransmit_pkt(u32 after, u32 to)
{
	struct sk_buff *buf;

	buf = bcl->first_out;
216
	while (buf && less_eq(buf_seqno(buf), after))
217
		buf = buf->next;
218
	tipc_link_retransmit(bcl, buf, mod(to - after));
P
Per Liden 已提交
219 220
}

221
/**
222
 * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets
P
Per Liden 已提交
223 224
 * @n_ptr: node that sent acknowledgement info
 * @acked: broadcast sequence # that has been acknowledged
225
 *
P
Per Liden 已提交
226 227 228
 * Node is locked, bc_lock unlocked.
 */

229
void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked)
P
Per Liden 已提交
230 231 232 233 234 235 236
{
	struct sk_buff *crs;
	struct sk_buff *next;
	unsigned int released = 0;

	spin_lock_bh(&bc_lock);

237
	/* Bail out if tx queue is empty (no clean up is required) */
P
Per Liden 已提交
238
	crs = bcl->first_out;
239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264
	if (!crs)
		goto exit;

	/* Determine which messages need to be acknowledged */
	if (acked == INVALID_LINK_SEQ) {
		/*
		 * Contact with specified node has been lost, so need to
		 * acknowledge sent messages only (if other nodes still exist)
		 * or both sent and unsent messages (otherwise)
		 */
		if (bclink->bcast_nodes.count)
			acked = bcl->fsm_msg_cnt;
		else
			acked = bcl->next_out_no;
	} else {
		/*
		 * Bail out if specified sequence number does not correspond
		 * to a message that has been sent and not yet acknowledged
		 */
		if (less(acked, buf_seqno(crs)) ||
		    less(bcl->fsm_msg_cnt, acked) ||
		    less_eq(acked, n_ptr->bclink.acked))
			goto exit;
	}

	/* Skip over packets that node has previously acknowledged */
265
	while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked))
P
Per Liden 已提交
266 267 268 269 270 271
		crs = crs->next;

	/* Update packets that node is now acknowledging */

	while (crs && less_eq(buf_seqno(crs), acked)) {
		next = crs->next;
272 273 274 275 276 277 278 279 280

		if (crs != bcl->next_out)
			bcbuf_decr_acks(crs);
		else {
			bcbuf_set_acks(crs, 0);
			bcl->next_out = next;
			bclink_set_last_sent();
		}

P
Per Liden 已提交
281 282 283 284 285 286 287 288 289 290 291 292
		if (bcbuf_acks(crs) == 0) {
			bcl->first_out = next;
			bcl->out_queue_size--;
			buf_discard(crs);
			released = 1;
		}
		crs = next;
	}
	n_ptr->bclink.acked = acked;

	/* Try resolving broadcast link congestion, if necessary */

293
	if (unlikely(bcl->next_out)) {
294
		tipc_link_push_queue(bcl);
295 296
		bclink_set_last_sent();
	}
P
Per Liden 已提交
297
	if (unlikely(released && !list_empty(&bcl->waiting_ports)))
298
		tipc_link_wakeup_ports(bcl, 0);
299
exit:
P
Per Liden 已提交
300 301 302
	spin_unlock_bh(&bc_lock);
}

303
/**
P
Per Liden 已提交
304
 * bclink_send_ack - unicast an ACK msg
305
 *
306
 * tipc_net_lock and node lock set
P
Per Liden 已提交
307 308
 */

309
static void bclink_send_ack(struct tipc_node *n_ptr)
P
Per Liden 已提交
310 311 312 313
{
	struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1];

	if (l_ptr != NULL)
314
		tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0);
P
Per Liden 已提交
315 316
}

317
/**
P
Per Liden 已提交
318
 * bclink_send_nack- broadcast a NACK msg
319
 *
320
 * tipc_net_lock and node lock set
P
Per Liden 已提交
321 322
 */

323
static void bclink_send_nack(struct tipc_node *n_ptr)
P
Per Liden 已提交
324 325 326 327 328 329 330
{
	struct sk_buff *buf;
	struct tipc_msg *msg;

	if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to))
		return;

331
	buf = tipc_buf_acquire(INT_H_SIZE);
P
Per Liden 已提交
332 333
	if (buf) {
		msg = buf_msg(buf);
334
		tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG,
335
			 INT_H_SIZE, n_ptr->addr);
336
		msg_set_non_seq(msg, 1);
P
Per Liden 已提交
337
		msg_set_mc_netid(msg, tipc_net_id);
338
		msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in));
P
Per Liden 已提交
339 340 341 342
		msg_set_bcgap_after(msg, n_ptr->bclink.gap_after);
		msg_set_bcgap_to(msg, n_ptr->bclink.gap_to);
		msg_set_bcast_tag(msg, tipc_own_tag);

343 344 345
		tipc_bearer_send(&bcbearer->bearer, buf, NULL);
		bcl->stats.sent_nacks++;
		buf_discard(buf);
P
Per Liden 已提交
346

347
		/*
P
Per Liden 已提交
348 349 350 351
		 * Ensure we doesn't send another NACK msg to the node
		 * until 16 more deferred messages arrive from it
		 * (i.e. helps prevent all nodes from NACK'ing at same time)
		 */
352

P
Per Liden 已提交
353 354 355 356
		n_ptr->bclink.nack_sync = tipc_own_tag;
	}
}

357
/**
358
 * tipc_bclink_check_gap - send a NACK if a sequence gap exists
P
Per Liden 已提交
359
 *
360
 * tipc_net_lock and node lock set
P
Per Liden 已提交
361 362
 */

363
void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 last_sent)
P
Per Liden 已提交
364 365 366 367 368 369 370 371 372 373 374
{
	if (!n_ptr->bclink.supported ||
	    less_eq(last_sent, mod(n_ptr->bclink.last_in)))
		return;

	bclink_set_gap(n_ptr);
	if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to)
		n_ptr->bclink.gap_to = last_sent;
	bclink_send_nack(n_ptr);
}

375
/**
376
 * tipc_bclink_peek_nack - process a NACK msg meant for another node
377
 *
378
 * Only tipc_net_lock set.
P
Per Liden 已提交
379 380
 */

A
Adrian Bunk 已提交
381
static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to)
P
Per Liden 已提交
382
{
383
	struct tipc_node *n_ptr = tipc_node_find(dest);
P
Per Liden 已提交
384 385
	u32 my_after, my_to;

386
	if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr)))
P
Per Liden 已提交
387
		return;
388
	tipc_node_lock(n_ptr);
P
Per Liden 已提交
389 390 391 392 393 394 395 396 397 398 399 400 401 402 403
	/*
	 * Modify gap to suppress unnecessary NACKs from this node
	 */
	my_after = n_ptr->bclink.gap_after;
	my_to = n_ptr->bclink.gap_to;

	if (less_eq(gap_after, my_after)) {
		if (less(my_after, gap_to) && less(gap_to, my_to))
			n_ptr->bclink.gap_after = gap_to;
		else if (less_eq(my_to, gap_to))
			n_ptr->bclink.gap_to = n_ptr->bclink.gap_after;
	} else if (less_eq(gap_after, my_to)) {
		if (less_eq(my_to, gap_to))
			n_ptr->bclink.gap_to = gap_after;
	} else {
404
		/*
P
Per Liden 已提交
405 406 407 408 409 410 411 412
		 * Expand gap if missing bufs not in deferred queue:
		 */
		struct sk_buff *buf = n_ptr->bclink.deferred_head;
		u32 prev = n_ptr->bclink.gap_to;

		for (; buf; buf = buf->next) {
			u32 seqno = buf_seqno(buf);

413
			if (mod(seqno - prev) != 1) {
P
Per Liden 已提交
414
				buf = NULL;
415 416
				break;
			}
P
Per Liden 已提交
417 418 419 420 421 422 423 424 425
			if (seqno == gap_after)
				break;
			prev = seqno;
		}
		if (buf == NULL)
			n_ptr->bclink.gap_to = gap_after;
	}
	/*
	 * Some nodes may send a complementary NACK now:
426
	 */
P
Per Liden 已提交
427 428 429 430 431 432
	if (bclink_ack_allowed(sender_tag + 1)) {
		if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) {
			bclink_send_nack(n_ptr);
			bclink_set_gap(n_ptr);
		}
	}
433
	tipc_node_unlock(n_ptr);
P
Per Liden 已提交
434 435 436
}

/**
437
 * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster
P
Per Liden 已提交
438 439
 */

440
int tipc_bclink_send_msg(struct sk_buff *buf)
P
Per Liden 已提交
441 442 443 444 445
{
	int res;

	spin_lock_bh(&bc_lock);

446 447 448 449 450 451
	if (!bclink->bcast_nodes.count) {
		res = msg_data_sz(buf_msg(buf));
		buf_discard(buf);
		goto exit;
	}

452
	res = tipc_link_send_buf(bcl, buf);
453
	if (likely(res >= 0)) {
454
		bclink_set_last_sent();
455 456 457
		bcl->stats.queue_sz_counts++;
		bcl->stats.accu_queue_sz += bcl->out_queue_size;
	}
458
exit:
P
Per Liden 已提交
459 460 461 462 463
	spin_unlock_bh(&bc_lock);
	return res;
}

/**
464
 * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards
465
 *
466
 * tipc_net_lock is read_locked, no other locks set
P
Per Liden 已提交
467 468
 */

469
void tipc_bclink_recv_pkt(struct sk_buff *buf)
470
{
P
Per Liden 已提交
471
	struct tipc_msg *msg = buf_msg(buf);
472
	struct tipc_node *node;
P
Per Liden 已提交
473 474 475 476
	u32 next_in;
	u32 seqno;
	struct sk_buff *deferred;

477 478 479 480 481 482 483 484 485 486 487 488
	/* Screen out unwanted broadcast messages */

	if (msg_mc_netid(msg) != tipc_net_id)
		goto exit;

	node = tipc_node_find(msg_prevnode(msg));
	if (unlikely(!node))
		goto exit;

	tipc_node_lock(node);
	if (unlikely(!node->bclink.supported))
		goto unlock;
P
Per Liden 已提交
489 490

	if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) {
491 492
		if (msg_type(msg) != STATE_MSG)
			goto unlock;
P
Per Liden 已提交
493
		if (msg_destnode(msg) == tipc_own_addr) {
494 495
			tipc_bclink_acknowledge(node, msg_bcast_ack(msg));
			tipc_node_unlock(node);
496
			spin_lock_bh(&bc_lock);
P
Per Liden 已提交
497
			bcl->stats.recv_nacks++;
498
			bclink->retransmit_to = node;
P
Per Liden 已提交
499 500
			bclink_retransmit_pkt(msg_bcgap_after(msg),
					      msg_bcgap_to(msg));
501
			spin_unlock_bh(&bc_lock);
P
Per Liden 已提交
502
		} else {
503
			tipc_node_unlock(node);
504
			tipc_bclink_peek_nack(msg_destnode(msg),
A
Adrian Bunk 已提交
505 506 507
					      msg_bcast_tag(msg),
					      msg_bcgap_after(msg),
					      msg_bcgap_to(msg));
P
Per Liden 已提交
508
		}
509
		goto exit;
P
Per Liden 已提交
510 511
	}

512 513
	/* Handle in-sequence broadcast message */

P
Per Liden 已提交
514 515 516 517 518 519 520 521 522 523 524 525 526
receive:
	next_in = mod(node->bclink.last_in + 1);
	seqno = msg_seqno(msg);

	if (likely(seqno == next_in)) {
		bcl->stats.recv_info++;
		node->bclink.last_in++;
		bclink_set_gap(node);
		if (unlikely(bclink_ack_allowed(seqno))) {
			bclink_send_ack(node);
			bcl->stats.sent_acks++;
		}
		if (likely(msg_isdata(msg))) {
527
			tipc_node_unlock(node);
528 529 530 531
			if (likely(msg_mcast(msg)))
				tipc_port_recv_mcast(buf, NULL);
			else
				buf_discard(buf);
P
Per Liden 已提交
532 533 534
		} else if (msg_user(msg) == MSG_BUNDLER) {
			bcl->stats.recv_bundles++;
			bcl->stats.recv_bundled += msg_msgcnt(msg);
535 536
			tipc_node_unlock(node);
			tipc_link_recv_bundle(buf);
P
Per Liden 已提交
537 538
		} else if (msg_user(msg) == MSG_FRAGMENTER) {
			bcl->stats.recv_fragments++;
539 540
			if (tipc_link_recv_fragment(&node->bclink.defragm,
						    &buf, &msg))
P
Per Liden 已提交
541
				bcl->stats.recv_fragmented++;
542 543
			tipc_node_unlock(node);
			tipc_net_route_msg(buf);
544 545 546
		} else if (msg_user(msg) == NAME_DISTRIBUTOR) {
			tipc_node_unlock(node);
			tipc_named_recv(buf);
P
Per Liden 已提交
547
		} else {
548
			tipc_node_unlock(node);
549
			buf_discard(buf);
P
Per Liden 已提交
550
		}
551 552
		buf = NULL;
		tipc_node_lock(node);
553
		deferred = node->bclink.deferred_head;
P
Per Liden 已提交
554 555 556 557 558 559 560 561 562 563
		if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) {
			buf = deferred;
			msg = buf_msg(buf);
			node->bclink.deferred_head = deferred->next;
			goto receive;
		}
	} else if (less(next_in, seqno)) {
		u32 gap_after = node->bclink.gap_after;
		u32 gap_to = node->bclink.gap_to;

564 565 566
		if (tipc_link_defer_pkt(&node->bclink.deferred_head,
					&node->bclink.deferred_tail,
					buf)) {
P
Per Liden 已提交
567 568 569 570 571 572 573
			node->bclink.nack_sync++;
			bcl->stats.deferred_recv++;
			if (seqno == mod(gap_after + 1))
				node->bclink.gap_after = seqno;
			else if (less(gap_after, seqno) && less(seqno, gap_to))
				node->bclink.gap_to = seqno;
		}
574
		buf = NULL;
P
Per Liden 已提交
575 576 577 578 579 580 581 582
		if (bclink_ack_allowed(node->bclink.nack_sync)) {
			if (gap_to != gap_after)
				bclink_send_nack(node);
			bclink_set_gap(node);
		}
	} else {
		bcl->stats.duplicates++;
	}
583
unlock:
584
	tipc_node_unlock(node);
585 586
exit:
	buf_discard(buf);
P
Per Liden 已提交
587 588
}

589
u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr)
P
Per Liden 已提交
590 591
{
	return (n_ptr->bclink.supported &&
592
		(tipc_bclink_get_last_sent() != n_ptr->bclink.acked));
P
Per Liden 已提交
593 594 595 596
}


/**
597
 * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer
598
 *
599 600
 * Send packet over as many bearers as necessary to reach all nodes
 * that have joined the broadcast link.
601
 *
602 603
 * Returns 0 (packet sent successfully) under all circumstances,
 * since the broadcast link's pseudo-bearer never blocks
P
Per Liden 已提交
604 605
 */

A
Adrian Bunk 已提交
606 607 608
static int tipc_bcbearer_send(struct sk_buff *buf,
			      struct tipc_bearer *unused1,
			      struct tipc_media_addr *unused2)
P
Per Liden 已提交
609 610 611
{
	int bp_index;

612 613 614 615 616 617
	/*
	 * Prepare broadcast link message for reliable transmission,
	 * if first time trying to send it;
	 * preparation is skipped for broadcast link protocol messages
	 * since they are sent in an unreliable manner and don't need it
	 */
P
Per Liden 已提交
618 619 620 621

	if (likely(!msg_non_seq(buf_msg(buf)))) {
		struct tipc_msg *msg;

622
		bcbuf_set_acks(buf, bclink->bcast_nodes.count);
P
Per Liden 已提交
623
		msg = buf_msg(buf);
624
		msg_set_non_seq(msg, 1);
P
Per Liden 已提交
625
		msg_set_mc_netid(msg, tipc_net_id);
626
		bcl->stats.sent_info++;
627

628
		if (WARN_ON(!bclink->bcast_nodes.count)) {
629 630 631
			dump_stack();
			return 0;
		}
P
Per Liden 已提交
632 633 634
	}

	/* Send buffer over bearers until all targets reached */
635

636
	bcbearer->remains = bclink->bcast_nodes;
P
Per Liden 已提交
637 638

	for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) {
639 640
		struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary;
		struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary;
P
Per Liden 已提交
641 642 643 644

		if (!p)
			break;	/* no more bearers to try */

645 646
		tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new);
		if (bcbearer->remains_new.count == bcbearer->remains.count)
P
Per Liden 已提交
647 648
			continue;	/* bearer pair doesn't add anything */

649 650
		if (p->blocked ||
		    p->media->send_msg(buf, p, &p->media->bcast_addr)) {
651
			/* unable to send on primary bearer */
652 653
			if (!s || s->blocked ||
			    s->media->send_msg(buf, s,
654 655 656 657 658 659 660 661 662
					       &s->media->bcast_addr)) {
				/* unable to send on either bearer */
				continue;
			}
		}

		if (s) {
			bcbearer->bpairs[bp_index].primary = s;
			bcbearer->bpairs[bp_index].secondary = p;
P
Per Liden 已提交
663 664
		}

665
		if (bcbearer->remains_new.count == 0)
666
			break;	/* all targets reached */
P
Per Liden 已提交
667

668
		bcbearer->remains = bcbearer->remains_new;
P
Per Liden 已提交
669
	}
670

671
	return 0;
P
Per Liden 已提交
672 673 674
}

/**
675
 * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer
P
Per Liden 已提交
676 677
 */

678
void tipc_bcbearer_sort(void)
P
Per Liden 已提交
679
{
680 681
	struct tipc_bcbearer_pair *bp_temp = bcbearer->bpairs_temp;
	struct tipc_bcbearer_pair *bp_curr;
P
Per Liden 已提交
682 683 684 685 686 687 688 689 690 691
	int b_index;
	int pri;

	spin_lock_bh(&bc_lock);

	/* Group bearers by priority (can assume max of two per priority) */

	memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp));

	for (b_index = 0; b_index < MAX_BEARERS; b_index++) {
692
		struct tipc_bearer *b = &tipc_bearers[b_index];
P
Per Liden 已提交
693 694 695 696 697 698 699 700 701 702 703 704 705 706 707

		if (!b->active || !b->nodes.count)
			continue;

		if (!bp_temp[b->priority].primary)
			bp_temp[b->priority].primary = b;
		else
			bp_temp[b->priority].secondary = b;
	}

	/* Create array of bearer pairs for broadcasting */

	bp_curr = bcbearer->bpairs;
	memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs));

P
Per Liden 已提交
708
	for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) {
P
Per Liden 已提交
709 710 711 712 713 714 715

		if (!bp_temp[pri].primary)
			continue;

		bp_curr->primary = bp_temp[pri].primary;

		if (bp_temp[pri].secondary) {
716 717
			if (tipc_nmap_equal(&bp_temp[pri].primary->nodes,
					    &bp_temp[pri].secondary->nodes)) {
P
Per Liden 已提交
718 719 720 721 722 723 724 725 726 727 728 729 730 731
				bp_curr->secondary = bp_temp[pri].secondary;
			} else {
				bp_curr++;
				bp_curr->primary = bp_temp[pri].secondary;
			}
		}

		bp_curr++;
	}

	spin_unlock_bh(&bc_lock);
}


732
int tipc_bclink_stats(char *buf, const u32 buf_size)
P
Per Liden 已提交
733 734 735 736 737 738
{
	struct print_buf pb;

	if (!bcl)
		return 0;

739
	tipc_printbuf_init(&pb, buf, buf_size);
P
Per Liden 已提交
740 741 742 743

	spin_lock_bh(&bc_lock);

	tipc_printf(&pb, "Link <%s>\n"
744
			 "  Window:%u packets\n",
P
Per Liden 已提交
745
		    bcl->name, bcl->queue_limit[0]);
746
	tipc_printf(&pb, "  RX packets:%u fragments:%u/%u bundles:%u/%u\n",
P
Per Liden 已提交
747 748 749 750 751
		    bcl->stats.recv_info,
		    bcl->stats.recv_fragments,
		    bcl->stats.recv_fragmented,
		    bcl->stats.recv_bundles,
		    bcl->stats.recv_bundled);
752
	tipc_printf(&pb, "  TX packets:%u fragments:%u/%u bundles:%u/%u\n",
P
Per Liden 已提交
753 754
		    bcl->stats.sent_info,
		    bcl->stats.sent_fragments,
755
		    bcl->stats.sent_fragmented,
P
Per Liden 已提交
756 757
		    bcl->stats.sent_bundles,
		    bcl->stats.sent_bundled);
758
	tipc_printf(&pb, "  RX naks:%u defs:%u dups:%u\n",
P
Per Liden 已提交
759
		    bcl->stats.recv_nacks,
760
		    bcl->stats.deferred_recv,
P
Per Liden 已提交
761
		    bcl->stats.duplicates);
762 763 764
	tipc_printf(&pb, "  TX naks:%u acks:%u dups:%u\n",
		    bcl->stats.sent_nacks,
		    bcl->stats.sent_acks,
P
Per Liden 已提交
765 766 767 768 769 770 771 772 773 774
		    bcl->stats.retransmitted);
	tipc_printf(&pb, "  Congestion bearer:%u link:%u  Send queue max:%u avg:%u\n",
		    bcl->stats.bearer_congs,
		    bcl->stats.link_congs,
		    bcl->stats.max_queue_sz,
		    bcl->stats.queue_sz_counts
		    ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts)
		    : 0);

	spin_unlock_bh(&bc_lock);
775
	return tipc_printbuf_validate(&pb);
P
Per Liden 已提交
776 777
}

778
int tipc_bclink_reset_stats(void)
P
Per Liden 已提交
779 780 781 782 783 784 785
{
	if (!bcl)
		return -ENOPROTOOPT;

	spin_lock_bh(&bc_lock);
	memset(&bcl->stats, 0, sizeof(bcl->stats));
	spin_unlock_bh(&bc_lock);
786
	return 0;
P
Per Liden 已提交
787 788
}

789
int tipc_bclink_set_queue_limits(u32 limit)
P
Per Liden 已提交
790 791 792 793 794 795 796
{
	if (!bcl)
		return -ENOPROTOOPT;
	if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN))
		return -EINVAL;

	spin_lock_bh(&bc_lock);
797
	tipc_link_set_queue_limits(bcl, limit);
P
Per Liden 已提交
798
	spin_unlock_bh(&bc_lock);
799
	return 0;
P
Per Liden 已提交
800 801
}

802
void tipc_bclink_init(void)
P
Per Liden 已提交
803 804 805
{
	INIT_LIST_HEAD(&bcbearer->bearer.cong_links);
	bcbearer->bearer.media = &bcbearer->media;
806
	bcbearer->media.send_msg = tipc_bcbearer_send;
807
	sprintf(bcbearer->media.name, "tipc-broadcast");
P
Per Liden 已提交
808 809 810

	INIT_LIST_HEAD(&bcl->waiting_ports);
	bcl->next_out_no = 1;
I
Ingo Molnar 已提交
811
	spin_lock_init(&bclink->node.lock);
P
Per Liden 已提交
812
	bcl->owner = &bclink->node;
813
	bcl->max_pkt = MAX_PKT_DEFAULT_MCAST;
814
	tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT);
P
Per Liden 已提交
815 816
	bcl->b_ptr = &bcbearer->bearer;
	bcl->state = WORKING_WORKING;
817
	strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME);
P
Per Liden 已提交
818 819
}

820
void tipc_bclink_stop(void)
P
Per Liden 已提交
821 822
{
	spin_lock_bh(&bc_lock);
823
	tipc_link_stop(bcl);
P
Per Liden 已提交
824
	spin_unlock_bh(&bc_lock);
825 826 827

	memset(bclink, 0, sizeof(*bclink));
	memset(bcbearer, 0, sizeof(*bcbearer));
P
Per Liden 已提交
828 829
}

830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869

/**
 * tipc_nmap_add - add a node to a node map
 */

void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node)
{
	int n = tipc_node(node);
	int w = n / WSIZE;
	u32 mask = (1 << (n % WSIZE));

	if ((nm_ptr->map[w] & mask) == 0) {
		nm_ptr->count++;
		nm_ptr->map[w] |= mask;
	}
}

/**
 * tipc_nmap_remove - remove a node from a node map
 */

void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node)
{
	int n = tipc_node(node);
	int w = n / WSIZE;
	u32 mask = (1 << (n % WSIZE));

	if ((nm_ptr->map[w] & mask) != 0) {
		nm_ptr->map[w] &= ~mask;
		nm_ptr->count--;
	}
}

/**
 * tipc_nmap_diff - find differences between node maps
 * @nm_a: input node map A
 * @nm_b: input node map B
 * @nm_diff: output node map A-B (i.e. nodes of A that are not in B)
 */

870 871 872
static void tipc_nmap_diff(struct tipc_node_map *nm_a,
			   struct tipc_node_map *nm_b,
			   struct tipc_node_map *nm_diff)
873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890
{
	int stop = ARRAY_SIZE(nm_a->map);
	int w;
	int b;
	u32 map;

	memset(nm_diff, 0, sizeof(*nm_diff));
	for (w = 0; w < stop; w++) {
		map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]);
		nm_diff->map[w] = map;
		if (map != 0) {
			for (b = 0 ; b < WSIZE; b++) {
				if (map & (1 << b))
					nm_diff->count++;
			}
		}
	}
}
891 892 893 894 895

/**
 * tipc_port_list_add - add a port to a port list, ensuring no duplicates
 */

896
void tipc_port_list_add(struct tipc_port_list *pl_ptr, u32 port)
897
{
898
	struct tipc_port_list *item = pl_ptr;
899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929
	int i;
	int item_sz = PLSIZE;
	int cnt = pl_ptr->count;

	for (; ; cnt -= item_sz, item = item->next) {
		if (cnt < PLSIZE)
			item_sz = cnt;
		for (i = 0; i < item_sz; i++)
			if (item->ports[i] == port)
				return;
		if (i < PLSIZE) {
			item->ports[i] = port;
			pl_ptr->count++;
			return;
		}
		if (!item->next) {
			item->next = kmalloc(sizeof(*item), GFP_ATOMIC);
			if (!item->next) {
				warn("Incomplete multicast delivery, no memory\n");
				return;
			}
			item->next->next = NULL;
		}
	}
}

/**
 * tipc_port_list_free - free dynamically created entries in port_list chain
 *
 */

930
void tipc_port_list_free(struct tipc_port_list *pl_ptr)
931
{
932 933
	struct tipc_port_list *item;
	struct tipc_port_list *next;
934 935 936 937 938 939 940

	for (item = pl_ptr->next; item; item = next) {
		next = item->next;
		kfree(item);
	}
}