bcast.c 22.7 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 6 7 8
 * Copyright (c) 2004, Intel Corporation.
 * Copyright (c) 2005, Wind River Systems
 * 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 42 43 44 45 46
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "core.h"
#include "link.h"
#include "port.h"
#include "bcast.h"

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

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

47 48 49 50
/*
 * Loss rate for incoming broadcast frames; used to test retransmission code.
 * Set to N to cause every N'th frame to be discarded; 0 => don't discard any.
 */
51

52 53
#define TIPC_BCAST_LOSS_RATE 0

P
Per Liden 已提交
54 55 56 57
/**
 * struct bcbearer_pair - a pair of bearers used by broadcast link
 * @primary: pointer to primary bearer
 * @secondary: pointer to secondary bearer
58 59
 *
 * Bearers must have same priority and same set of reachable destinations
P
Per Liden 已提交
60 61 62 63 64 65 66 67 68 69 70 71 72
 * to be paired.
 */

struct bcbearer_pair {
	struct bearer *primary;
	struct bearer *secondary;
};

/**
 * struct bcbearer - bearer used by broadcast link
 * @bearer: (non-standard) broadcast bearer structure
 * @media: (non-standard) broadcast media structure
 * @bpairs: array of bearer pairs
73 74 75
 * @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()
76
 *
77 78 79 80
 * 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 已提交
81 82 83 84 85 86
 */

struct bcbearer {
	struct bearer bearer;
	struct media media;
	struct bcbearer_pair bpairs[MAX_BEARERS];
P
Per Liden 已提交
87
	struct bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1];
88 89
	struct tipc_node_map remains;
	struct tipc_node_map remains_new;
P
Per Liden 已提交
90 91 92 93 94 95
};

/**
 * struct bclink - link used for broadcast messages
 * @link: (non-standard) broadcast link structure
 * @node: (non-standard) node structure representing b'cast link's peer node
96
 *
P
Per Liden 已提交
97 98 99 100 101
 * Handles sequence numbering, fragmentation, bundling, etc.
 */

struct bclink {
	struct link link;
102
	struct tipc_node node;
P
Per Liden 已提交
103 104 105 106 107 108
};


static struct bcbearer *bcbearer = NULL;
static struct bclink *bclink = NULL;
static struct link *bcl = NULL;
I
Ingo Molnar 已提交
109
static DEFINE_SPINLOCK(bc_lock);
P
Per Liden 已提交
110

111 112 113
/* broadcast-capable node map */
struct tipc_node_map tipc_bcast_nmap;

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

116 117 118
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 已提交
119

S
Sam Ravnborg 已提交
120
static u32 buf_seqno(struct sk_buff *buf)
P
Per Liden 已提交
121 122
{
	return msg_seqno(buf_msg(buf));
123
}
P
Per Liden 已提交
124

S
Sam Ravnborg 已提交
125
static u32 bcbuf_acks(struct sk_buff *buf)
P
Per Liden 已提交
126
{
127
	return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle;
P
Per Liden 已提交
128 129
}

S
Sam Ravnborg 已提交
130
static void bcbuf_set_acks(struct sk_buff *buf, u32 acks)
P
Per Liden 已提交
131
{
132
	TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks;
P
Per Liden 已提交
133 134
}

S
Sam Ravnborg 已提交
135
static void bcbuf_decr_acks(struct sk_buff *buf)
P
Per Liden 已提交
136 137 138 139 140
{
	bcbuf_set_acks(buf, bcbuf_acks(buf) - 1);
}


141 142 143 144 145 146 147 148 149 150 151 152 153
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;
}

154
/**
P
Per Liden 已提交
155
 * bclink_set_gap - set gap according to contents of current deferred pkt queue
156
 *
P
Per Liden 已提交
157 158 159
 * Called with 'node' locked, bc_lock unlocked
 */

160
static void bclink_set_gap(struct tipc_node *n_ptr)
P
Per Liden 已提交
161 162 163 164 165 166 167 168 169
{
	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);
}

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

S
Sam Ravnborg 已提交
180
static int bclink_ack_allowed(u32 n)
P
Per Liden 已提交
181
{
E
Eric Dumazet 已提交
182
	return (n % TIPC_MIN_LINK_WIN) == tipc_own_tag;
P
Per Liden 已提交
183 184 185
}


186
/**
P
Per Liden 已提交
187 188 189
 * bclink_retransmit_pkt - retransmit broadcast packets
 * @after: sequence number of last packet to *not* retransmit
 * @to: sequence number of last packet to retransmit
190
 *
191
 * Called with bc_lock locked
P
Per Liden 已提交
192 193 194 195 196 197 198 199
 */

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

	buf = bcl->first_out;
	while (buf && less_eq(buf_seqno(buf), after)) {
200
		buf = buf->next;
P
Per Liden 已提交
201
	}
202
	tipc_link_retransmit(bcl, buf, mod(to - after));
P
Per Liden 已提交
203 204
}

205
/**
206
 * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets
P
Per Liden 已提交
207 208
 * @n_ptr: node that sent acknowledgement info
 * @acked: broadcast sequence # that has been acknowledged
209
 *
P
Per Liden 已提交
210 211 212
 * Node is locked, bc_lock unlocked.
 */

213
void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked)
P
Per Liden 已提交
214 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 242 243 244 245 246 247
{
	struct sk_buff *crs;
	struct sk_buff *next;
	unsigned int released = 0;

	if (less_eq(acked, n_ptr->bclink.acked))
		return;

	spin_lock_bh(&bc_lock);

	/* Skip over packets that node has previously acknowledged */

	crs = bcl->first_out;
	while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) {
		crs = crs->next;
	}

	/* Update packets that node is now acknowledging */

	while (crs && less_eq(buf_seqno(crs), acked)) {
		next = crs->next;
		bcbuf_decr_acks(crs);
		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 */

248
	if (unlikely(bcl->next_out)) {
249
		tipc_link_push_queue(bcl);
250 251
		bclink_set_last_sent();
	}
P
Per Liden 已提交
252
	if (unlikely(released && !list_empty(&bcl->waiting_ports)))
253
		tipc_link_wakeup_ports(bcl, 0);
P
Per Liden 已提交
254 255 256
	spin_unlock_bh(&bc_lock);
}

257
/**
P
Per Liden 已提交
258
 * bclink_send_ack - unicast an ACK msg
259
 *
260
 * tipc_net_lock and node lock set
P
Per Liden 已提交
261 262
 */

263
static void bclink_send_ack(struct tipc_node *n_ptr)
P
Per Liden 已提交
264 265 266 267
{
	struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1];

	if (l_ptr != NULL)
268
		tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0);
P
Per Liden 已提交
269 270
}

271
/**
P
Per Liden 已提交
272
 * bclink_send_nack- broadcast a NACK msg
273
 *
274
 * tipc_net_lock and node lock set
P
Per Liden 已提交
275 276
 */

277
static void bclink_send_nack(struct tipc_node *n_ptr)
P
Per Liden 已提交
278 279 280 281 282 283 284
{
	struct sk_buff *buf;
	struct tipc_msg *msg;

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

285
	buf = tipc_buf_acquire(INT_H_SIZE);
P
Per Liden 已提交
286 287
	if (buf) {
		msg = buf_msg(buf);
288
		tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG,
289
			 INT_H_SIZE, n_ptr->addr);
P
Per Liden 已提交
290
		msg_set_mc_netid(msg, tipc_net_id);
291
		msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in));
P
Per Liden 已提交
292 293 294 295
		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);

296
		if (tipc_bearer_send(&bcbearer->bearer, buf, NULL)) {
P
Per Liden 已提交
297 298 299
			bcl->stats.sent_nacks++;
			buf_discard(buf);
		} else {
300
			tipc_bearer_schedule(bcl->b_ptr, bcl);
P
Per Liden 已提交
301 302 303 304
			bcl->proto_msg_queue = buf;
			bcl->stats.bearer_congs++;
		}

305
		/*
P
Per Liden 已提交
306 307 308 309
		 * 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)
		 */
310

P
Per Liden 已提交
311 312 313 314
		n_ptr->bclink.nack_sync = tipc_own_tag;
	}
}

315
/**
316
 * tipc_bclink_check_gap - send a NACK if a sequence gap exists
P
Per Liden 已提交
317
 *
318
 * tipc_net_lock and node lock set
P
Per Liden 已提交
319 320
 */

321
void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 last_sent)
P
Per Liden 已提交
322 323 324 325 326 327 328 329 330 331 332
{
	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);
}

333
/**
334
 * tipc_bclink_peek_nack - process a NACK msg meant for another node
335
 *
336
 * Only tipc_net_lock set.
P
Per Liden 已提交
337 338
 */

A
Adrian Bunk 已提交
339
static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to)
P
Per Liden 已提交
340
{
341
	struct tipc_node *n_ptr = tipc_node_find(dest);
P
Per Liden 已提交
342 343
	u32 my_after, my_to;

344
	if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr)))
P
Per Liden 已提交
345
		return;
346
	tipc_node_lock(n_ptr);
P
Per Liden 已提交
347 348 349 350 351 352 353 354 355 356 357 358 359 360 361
	/*
	 * 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 {
362
		/*
P
Per Liden 已提交
363 364 365 366 367 368 369 370
		 * 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);

371
			if (mod(seqno - prev) != 1) {
P
Per Liden 已提交
372
				buf = NULL;
373 374
				break;
			}
P
Per Liden 已提交
375 376 377 378 379 380 381 382 383
			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:
384
	 */
P
Per Liden 已提交
385 386 387 388 389 390
	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);
		}
	}
391
	tipc_node_unlock(n_ptr);
P
Per Liden 已提交
392 393 394
}

/**
395
 * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster
P
Per Liden 已提交
396 397
 */

398
int tipc_bclink_send_msg(struct sk_buff *buf)
P
Per Liden 已提交
399 400 401 402 403
{
	int res;

	spin_lock_bh(&bc_lock);

404
	res = tipc_link_send_buf(bcl, buf);
P
Per Liden 已提交
405 406
	if (unlikely(res == -ELINKCONG))
		buf_discard(buf);
407
	else
408
		bclink_set_last_sent();
P
Per Liden 已提交
409 410 411 412 413 414 415 416 417 418 419

	if (bcl->out_queue_size > bcl->stats.max_queue_sz)
		bcl->stats.max_queue_sz = bcl->out_queue_size;
	bcl->stats.queue_sz_counts++;
	bcl->stats.accu_queue_sz += bcl->out_queue_size;

	spin_unlock_bh(&bc_lock);
	return res;
}

/**
420
 * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards
421
 *
422
 * tipc_net_lock is read_locked, no other locks set
P
Per Liden 已提交
423 424
 */

425
void tipc_bclink_recv_pkt(struct sk_buff *buf)
426 427 428 429
{
#if (TIPC_BCAST_LOSS_RATE)
	static int rx_count = 0;
#endif
P
Per Liden 已提交
430
	struct tipc_msg *msg = buf_msg(buf);
431
	struct tipc_node* node = tipc_node_find(msg_prevnode(msg));
P
Per Liden 已提交
432 433 434 435
	u32 next_in;
	u32 seqno;
	struct sk_buff *deferred;

436
	if (unlikely(!node || !tipc_node_is_up(node) || !node->bclink.supported ||
P
Per Liden 已提交
437 438 439 440 441 442 443
		     (msg_mc_netid(msg) != tipc_net_id))) {
		buf_discard(buf);
		return;
	}

	if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) {
		if (msg_destnode(msg) == tipc_own_addr) {
444 445 446
			tipc_node_lock(node);
			tipc_bclink_acknowledge(node, msg_bcast_ack(msg));
			tipc_node_unlock(node);
447
			spin_lock_bh(&bc_lock);
P
Per Liden 已提交
448
			bcl->stats.recv_nacks++;
449
			bcl->owner->next = node;   /* remember requestor */
P
Per Liden 已提交
450 451
			bclink_retransmit_pkt(msg_bcgap_after(msg),
					      msg_bcgap_to(msg));
452
			bcl->owner->next = NULL;
453
			spin_unlock_bh(&bc_lock);
P
Per Liden 已提交
454
		} else {
455
			tipc_bclink_peek_nack(msg_destnode(msg),
A
Adrian Bunk 已提交
456 457 458
					      msg_bcast_tag(msg),
					      msg_bcgap_after(msg),
					      msg_bcgap_to(msg));
P
Per Liden 已提交
459 460 461 462 463
		}
		buf_discard(buf);
		return;
	}

464 465 466 467 468 469 470 471
#if (TIPC_BCAST_LOSS_RATE)
	if (++rx_count == TIPC_BCAST_LOSS_RATE) {
		rx_count = 0;
		buf_discard(buf);
		return;
	}
#endif

472
	tipc_node_lock(node);
P
Per Liden 已提交
473 474 475 476 477 478 479 480 481 482 483 484 485 486
receive:
	deferred = node->bclink.deferred_head;
	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))) {
487 488
			tipc_node_unlock(node);
			tipc_port_recv_mcast(buf, NULL);
P
Per Liden 已提交
489 490 491
		} else if (msg_user(msg) == MSG_BUNDLER) {
			bcl->stats.recv_bundles++;
			bcl->stats.recv_bundled += msg_msgcnt(msg);
492 493
			tipc_node_unlock(node);
			tipc_link_recv_bundle(buf);
P
Per Liden 已提交
494 495
		} else if (msg_user(msg) == MSG_FRAGMENTER) {
			bcl->stats.recv_fragments++;
496 497
			if (tipc_link_recv_fragment(&node->bclink.defragm,
						    &buf, &msg))
P
Per Liden 已提交
498
				bcl->stats.recv_fragmented++;
499 500
			tipc_node_unlock(node);
			tipc_net_route_msg(buf);
P
Per Liden 已提交
501
		} else {
502 503
			tipc_node_unlock(node);
			tipc_net_route_msg(buf);
P
Per Liden 已提交
504 505
		}
		if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) {
506
			tipc_node_lock(node);
P
Per Liden 已提交
507 508 509 510 511 512 513 514 515 516
			buf = deferred;
			msg = buf_msg(buf);
			node->bclink.deferred_head = deferred->next;
			goto receive;
		}
		return;
	} else if (less(next_in, seqno)) {
		u32 gap_after = node->bclink.gap_after;
		u32 gap_to = node->bclink.gap_to;

517 518 519
		if (tipc_link_defer_pkt(&node->bclink.deferred_head,
					&node->bclink.deferred_tail,
					buf)) {
P
Per Liden 已提交
520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535
			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;
		}
		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++;
		buf_discard(buf);
	}
536
	tipc_node_unlock(node);
P
Per Liden 已提交
537 538
}

539
u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr)
P
Per Liden 已提交
540 541
{
	return (n_ptr->bclink.supported &&
542
		(tipc_bclink_get_last_sent() != n_ptr->bclink.acked));
P
Per Liden 已提交
543 544 545 546
}


/**
547
 * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer
548
 *
P
Per Liden 已提交
549 550
 * Send through as many bearers as necessary to reach all nodes
 * that support TIPC multicasting.
551
 *
P
Per Liden 已提交
552 553 554
 * Returns 0 if packet sent successfully, non-zero if not
 */

A
Adrian Bunk 已提交
555 556 557
static int tipc_bcbearer_send(struct sk_buff *buf,
			      struct tipc_bearer *unused1,
			      struct tipc_media_addr *unused2)
P
Per Liden 已提交
558 559 560 561 562 563 564 565
{
	int bp_index;

	/* Prepare buffer for broadcasting (if first time trying to send it) */

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

566 567
		assert(tipc_bcast_nmap.count != 0);
		bcbuf_set_acks(buf, tipc_bcast_nmap.count);
P
Per Liden 已提交
568
		msg = buf_msg(buf);
569
		msg_set_non_seq(msg, 1);
P
Per Liden 已提交
570
		msg_set_mc_netid(msg, tipc_net_id);
571
		bcl->stats.sent_info++;
P
Per Liden 已提交
572 573 574
	}

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

576
	bcbearer->remains = tipc_bcast_nmap;
P
Per Liden 已提交
577 578 579 580 581 582 583 584

	for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) {
		struct bearer *p = bcbearer->bpairs[bp_index].primary;
		struct bearer *s = bcbearer->bpairs[bp_index].secondary;

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

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

589 590 591 592 593 594 595 596 597 598 599 600 601 602
		if (p->publ.blocked ||
		    p->media->send_msg(buf, &p->publ, &p->media->bcast_addr)) {
			/* unable to send on primary bearer */
			if (!s || s->publ.blocked ||
			    s->media->send_msg(buf, &s->publ,
					       &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 已提交
603 604
		}

605
		if (bcbearer->remains_new.count == 0)
606
			return 0;
P
Per Liden 已提交
607

608
		bcbearer->remains = bcbearer->remains_new;
P
Per Liden 已提交
609
	}
610

611 612 613 614 615
	/*
	 * Unable to reach all targets (indicate success, since currently
	 * there isn't code in place to properly block & unblock the
	 * pseudo-bearer used by the broadcast link)
	 */
P
Per Liden 已提交
616

617
	return TIPC_OK;
P
Per Liden 已提交
618 619 620
}

/**
621
 * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer
P
Per Liden 已提交
622 623
 */

624
void tipc_bcbearer_sort(void)
P
Per Liden 已提交
625 626 627 628 629 630 631 632 633 634 635 636 637
{
	struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp;
	struct bcbearer_pair *bp_curr;
	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++) {
638
		struct bearer *b = &tipc_bearers[b_index];
P
Per Liden 已提交
639 640 641 642 643 644 645 646 647 648 649 650 651 652 653

		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 已提交
654
	for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) {
P
Per Liden 已提交
655 656 657 658 659 660 661

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

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

		if (bp_temp[pri].secondary) {
662 663
			if (tipc_nmap_equal(&bp_temp[pri].primary->nodes,
					    &bp_temp[pri].secondary->nodes)) {
P
Per Liden 已提交
664 665 666 667 668 669 670 671 672 673 674 675 676 677
				bp_curr->secondary = bp_temp[pri].secondary;
			} else {
				bp_curr++;
				bp_curr->primary = bp_temp[pri].secondary;
			}
		}

		bp_curr++;
	}

	spin_unlock_bh(&bc_lock);
}

/**
678
 * tipc_bcbearer_push - resolve bearer congestion
679
 *
P
Per Liden 已提交
680 681 682 683 684
 * Forces bclink to push out any unsent packets, until all packets are gone
 * or congestion reoccurs.
 * No locks set when function called
 */

685
void tipc_bcbearer_push(void)
P
Per Liden 已提交
686 687 688 689 690 691 692
{
	struct bearer *b_ptr;

	spin_lock_bh(&bc_lock);
	b_ptr = &bcbearer->bearer;
	if (b_ptr->publ.blocked) {
		b_ptr->publ.blocked = 0;
693
		tipc_bearer_lock_push(b_ptr);
P
Per Liden 已提交
694 695 696 697 698
	}
	spin_unlock_bh(&bc_lock);
}


699
int tipc_bclink_stats(char *buf, const u32 buf_size)
P
Per Liden 已提交
700 701 702 703 704 705
{
	struct print_buf pb;

	if (!bcl)
		return 0;

706
	tipc_printbuf_init(&pb, buf, buf_size);
P
Per Liden 已提交
707 708 709 710

	spin_lock_bh(&bc_lock);

	tipc_printf(&pb, "Link <%s>\n"
711
			 "  Window:%u packets\n",
P
Per Liden 已提交
712
		    bcl->name, bcl->queue_limit[0]);
713
	tipc_printf(&pb, "  RX packets:%u fragments:%u/%u bundles:%u/%u\n",
P
Per Liden 已提交
714 715 716 717 718
		    bcl->stats.recv_info,
		    bcl->stats.recv_fragments,
		    bcl->stats.recv_fragmented,
		    bcl->stats.recv_bundles,
		    bcl->stats.recv_bundled);
719
	tipc_printf(&pb, "  TX packets:%u fragments:%u/%u bundles:%u/%u\n",
P
Per Liden 已提交
720 721
		    bcl->stats.sent_info,
		    bcl->stats.sent_fragments,
722
		    bcl->stats.sent_fragmented,
P
Per Liden 已提交
723 724
		    bcl->stats.sent_bundles,
		    bcl->stats.sent_bundled);
725
	tipc_printf(&pb, "  RX naks:%u defs:%u dups:%u\n",
P
Per Liden 已提交
726
		    bcl->stats.recv_nacks,
727
		    bcl->stats.deferred_recv,
P
Per Liden 已提交
728
		    bcl->stats.duplicates);
729 730 731
	tipc_printf(&pb, "  TX naks:%u acks:%u dups:%u\n",
		    bcl->stats.sent_nacks,
		    bcl->stats.sent_acks,
P
Per Liden 已提交
732 733 734 735 736 737 738 739 740 741
		    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);
742
	return tipc_printbuf_validate(&pb);
P
Per Liden 已提交
743 744
}

745
int tipc_bclink_reset_stats(void)
P
Per Liden 已提交
746 747 748 749 750 751 752
{
	if (!bcl)
		return -ENOPROTOOPT;

	spin_lock_bh(&bc_lock);
	memset(&bcl->stats, 0, sizeof(bcl->stats));
	spin_unlock_bh(&bc_lock);
753
	return 0;
P
Per Liden 已提交
754 755
}

756
int tipc_bclink_set_queue_limits(u32 limit)
P
Per Liden 已提交
757 758 759 760 761 762 763
{
	if (!bcl)
		return -ENOPROTOOPT;
	if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN))
		return -EINVAL;

	spin_lock_bh(&bc_lock);
764
	tipc_link_set_queue_limits(bcl, limit);
P
Per Liden 已提交
765
	spin_unlock_bh(&bc_lock);
766
	return 0;
P
Per Liden 已提交
767 768
}

769
int tipc_bclink_init(void)
P
Per Liden 已提交
770
{
771 772
	bcbearer = kzalloc(sizeof(*bcbearer), GFP_ATOMIC);
	bclink = kzalloc(sizeof(*bclink), GFP_ATOMIC);
P
Per Liden 已提交
773
	if (!bcbearer || !bclink) {
774
		warn("Multicast link creation failed, no memory\n");
P
Per Liden 已提交
775 776 777 778 779 780 781 782 783
		kfree(bcbearer);
		bcbearer = NULL;
		kfree(bclink);
		bclink = NULL;
		return -ENOMEM;
	}

	INIT_LIST_HEAD(&bcbearer->bearer.cong_links);
	bcbearer->bearer.media = &bcbearer->media;
784
	bcbearer->media.send_msg = tipc_bcbearer_send;
P
Per Liden 已提交
785 786 787 788 789
	sprintf(bcbearer->media.name, "tipc-multicast");

	bcl = &bclink->link;
	INIT_LIST_HEAD(&bcl->waiting_ports);
	bcl->next_out_no = 1;
I
Ingo Molnar 已提交
790
	spin_lock_init(&bclink->node.lock);
P
Per Liden 已提交
791
	bcl->owner = &bclink->node;
792
	bcl->max_pkt = MAX_PKT_DEFAULT_MCAST;
793
	tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT);
P
Per Liden 已提交
794 795
	bcl->b_ptr = &bcbearer->bearer;
	bcl->state = WORKING_WORKING;
796
	strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME);
P
Per Liden 已提交
797

798
	return 0;
P
Per Liden 已提交
799 800
}

801
void tipc_bclink_stop(void)
P
Per Liden 已提交
802 803 804
{
	spin_lock_bh(&bc_lock);
	if (bcbearer) {
805
		tipc_link_stop(bcl);
P
Per Liden 已提交
806 807 808 809 810 811 812 813 814
		bcl = NULL;
		kfree(bclink);
		bclink = NULL;
		kfree(bcbearer);
		bcbearer = NULL;
	}
	spin_unlock_bh(&bc_lock);
}

815 816 817 818 819 820 821 822 823 824 825 826 827 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

/**
 * 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)
 */

855 856 857
static void tipc_nmap_diff(struct tipc_node_map *nm_a,
			   struct tipc_node_map *nm_b,
			   struct tipc_node_map *nm_diff)
858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875
{
	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++;
			}
		}
	}
}
876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 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

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

void tipc_port_list_add(struct port_list *pl_ptr, u32 port)
{
	struct port_list *item = pl_ptr;
	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
 *
 */

void tipc_port_list_free(struct port_list *pl_ptr)
{
	struct port_list *item;
	struct port_list *next;

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