bearer.c 17.0 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/bearer.c: TIPC bearer code
3
 *
P
Per Liden 已提交
4
 * Copyright (c) 1996-2006, Ericsson AB
5
 * Copyright (c) 2004-2006, Wind River Systems
P
Per Liden 已提交
6 7
 * All rights reserved.
 *
P
Per Liden 已提交
8
 * Redistribution and use in source and binary forms, with or without
P
Per Liden 已提交
9 10
 * modification, are permitted provided that the following conditions are met:
 *
P
Per Liden 已提交
11 12 13 14 15 16 17 18
 * 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 已提交
19
 *
P
Per Liden 已提交
20 21 22 23 24 25 26 27 28 29 30 31 32 33
 * 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 已提交
34 35 36 37 38 39 40 41 42 43 44
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "core.h"
#include "config.h"
#include "bearer.h"
#include "port.h"
#include "discover.h"

#define MAX_ADDR_STR 32

45
static struct media media_list[MAX_MEDIA];
P
Per Liden 已提交
46 47
static u32 media_count = 0;

48
struct bearer tipc_bearers[MAX_BEARERS];
P
Per Liden 已提交
49 50 51

/**
 * media_name_valid - validate media name
52
 *
P
Per Liden 已提交
53 54 55 56 57 58 59 60 61 62
 * Returns 1 if media name is valid, otherwise 0.
 */

static int media_name_valid(const char *name)
{
	u32 len;

	len = strlen(name);
	if ((len + 1) > TIPC_MAX_MEDIA_NAME)
		return 0;
E
Eric Dumazet 已提交
63
	return strspn(name, tipc_alphabet) == len;
P
Per Liden 已提交
64 65 66 67 68 69 70 71 72 73 74 75 76 77 78
}

/**
 * media_find - locates specified media object by name
 */

static struct media *media_find(const char *name)
{
	struct media *m_ptr;
	u32 i;

	for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
		if (!strcmp(m_ptr->name, name))
			return m_ptr;
	}
79
	return NULL;
P
Per Liden 已提交
80 81 82 83
}

/**
 * tipc_register_media - register a media type
84
 *
P
Per Liden 已提交
85 86 87 88
 * Bearers for this media type must be activated separately at a later stage.
 */

int  tipc_register_media(u32 media_type,
89 90 91 92
			 char *name,
			 int (*enable)(struct tipc_bearer *),
			 void (*disable)(struct tipc_bearer *),
			 int (*send_msg)(struct sk_buff *,
P
Per Liden 已提交
93
					 struct tipc_bearer *,
94
					 struct tipc_media_addr *),
P
Per Liden 已提交
95 96 97 98 99 100 101 102 103 104 105 106
			 char *(*addr2str)(struct tipc_media_addr *a,
					   char *str_buf, int str_size),
			 struct tipc_media_addr *bcast_addr,
			 const u32 bearer_priority,
			 const u32 link_tolerance,  /* [ms] */
			 const u32 send_window_limit)
{
	struct media *m_ptr;
	u32 media_id;
	u32 i;
	int res = -EINVAL;

107
	write_lock_bh(&tipc_net_lock);
P
Per Liden 已提交
108

109 110 111 112
	if (tipc_mode != TIPC_NET_MODE) {
		warn("Media <%s> rejected, not in networked mode yet\n", name);
		goto exit;
	}
P
Per Liden 已提交
113
	if (!media_name_valid(name)) {
114
		warn("Media <%s> rejected, illegal name\n", name);
P
Per Liden 已提交
115 116 117
		goto exit;
	}
	if (!bcast_addr) {
118
		warn("Media <%s> rejected, no broadcast address\n", name);
P
Per Liden 已提交
119 120
		goto exit;
	}
121
	if ((bearer_priority < TIPC_MIN_LINK_PRI) ||
P
Per Liden 已提交
122
	    (bearer_priority > TIPC_MAX_LINK_PRI)) {
123
		warn("Media <%s> rejected, illegal priority (%u)\n", name,
124
		     bearer_priority);
P
Per Liden 已提交
125 126
		goto exit;
	}
127
	if ((link_tolerance < TIPC_MIN_LINK_TOL) ||
P
Per Liden 已提交
128
	    (link_tolerance > TIPC_MAX_LINK_TOL)) {
129 130
		warn("Media <%s> rejected, illegal tolerance (%u)\n", name,
		     link_tolerance);
P
Per Liden 已提交
131 132 133 134 135
		goto exit;
	}

	media_id = media_count++;
	if (media_id >= MAX_MEDIA) {
136 137
		warn("Media <%s> rejected, media limit reached (%u)\n", name,
		     MAX_MEDIA);
P
Per Liden 已提交
138 139 140 141 142
		media_count--;
		goto exit;
	}
	for (i = 0; i < media_id; i++) {
		if (media_list[i].type_id == media_type) {
143
			warn("Media <%s> rejected, duplicate type (%u)\n", name,
P
Per Liden 已提交
144 145 146 147 148
			     media_type);
			media_count--;
			goto exit;
		}
		if (!strcmp(name, media_list[i].name)) {
149
			warn("Media <%s> rejected, duplicate name\n", name);
P
Per Liden 已提交
150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169
			media_count--;
			goto exit;
		}
	}

	m_ptr = &media_list[media_id];
	m_ptr->type_id = media_type;
	m_ptr->send_msg = send_msg;
	m_ptr->enable_bearer = enable;
	m_ptr->disable_bearer = disable;
	m_ptr->addr2str = addr2str;
	memcpy(&m_ptr->bcast_addr, bcast_addr, sizeof(*bcast_addr));
	m_ptr->bcast = 1;
	strcpy(m_ptr->name, name);
	m_ptr->priority = bearer_priority;
	m_ptr->tolerance = link_tolerance;
	m_ptr->window = send_window_limit;
	dbg("Media <%s> registered\n", name);
	res = 0;
exit:
170
	write_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
171 172 173 174
	return res;
}

/**
175
 * tipc_media_addr_printf - record media address in print buffer
P
Per Liden 已提交
176 177
 */

178
void tipc_media_addr_printf(struct print_buf *pb, struct tipc_media_addr *a)
P
Per Liden 已提交
179 180 181 182 183 184 185 186 187 188 189 190 191 192
{
	struct media *m_ptr;
	u32 media_type;
	u32 i;

	media_type = ntohl(a->type);
	for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
		if (m_ptr->type_id == media_type)
			break;
	}

	if ((i < media_count) && (m_ptr->addr2str != NULL)) {
		char addr_str[MAX_ADDR_STR];

193
		tipc_printf(pb, "%s(%s)", m_ptr->name,
P
Per Liden 已提交
194 195 196 197
			    m_ptr->addr2str(a, addr_str, sizeof(addr_str)));
	} else {
		unchar *addr = (unchar *)&a->dev_addr;

198
		tipc_printf(pb, "UNKNOWN(%u)", media_type);
P
Per Liden 已提交
199
		for (i = 0; i < (sizeof(*a) - sizeof(a->type)); i++) {
200
			tipc_printf(pb, "-%02x", addr[i]);
P
Per Liden 已提交
201 202 203 204 205
		}
	}
}

/**
206
 * tipc_media_get_names - record names of registered media in buffer
P
Per Liden 已提交
207 208
 */

209
struct sk_buff *tipc_media_get_names(void)
P
Per Liden 已提交
210 211 212 213 214
{
	struct sk_buff *buf;
	struct media *m_ptr;
	int i;

215
	buf = tipc_cfg_reply_alloc(MAX_MEDIA * TLV_SPACE(TIPC_MAX_MEDIA_NAME));
P
Per Liden 已提交
216 217 218
	if (!buf)
		return NULL;

219
	read_lock_bh(&tipc_net_lock);
P
Per Liden 已提交
220
	for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
221
		tipc_cfg_append_tlv(buf, TIPC_TLV_MEDIA_NAME, m_ptr->name,
222
				    strlen(m_ptr->name) + 1);
P
Per Liden 已提交
223
	}
224
	read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
225 226 227 228 229 230 231
	return buf;
}

/**
 * bearer_name_validate - validate & (optionally) deconstruct bearer name
 * @name - ptr to bearer name string
 * @name_parts - ptr to area for bearer name components (or NULL if not needed)
232
 *
P
Per Liden 已提交
233 234 235
 * Returns 1 if bearer name is valid, otherwise 0.
 */

236
static int bearer_name_validate(const char *name,
P
Per Liden 已提交
237 238 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
				struct bearer_name *name_parts)
{
	char name_copy[TIPC_MAX_BEARER_NAME];
	char *media_name;
	char *if_name;
	u32 media_len;
	u32 if_len;

	/* copy bearer name & ensure length is OK */

	name_copy[TIPC_MAX_BEARER_NAME - 1] = 0;
	/* need above in case non-Posix strncpy() doesn't pad with nulls */
	strncpy(name_copy, name, TIPC_MAX_BEARER_NAME);
	if (name_copy[TIPC_MAX_BEARER_NAME - 1] != 0)
		return 0;

	/* ensure all component parts of bearer name are present */

	media_name = name_copy;
	if ((if_name = strchr(media_name, ':')) == NULL)
		return 0;
	*(if_name++) = 0;
	media_len = if_name - media_name;
	if_len = strlen(if_name) + 1;

	/* validate component parts of bearer name */

264 265
	if ((media_len <= 1) || (media_len > TIPC_MAX_MEDIA_NAME) ||
	    (if_len <= 1) || (if_len > TIPC_MAX_IF_NAME) ||
P
Per Liden 已提交
266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287
	    (strspn(media_name, tipc_alphabet) != (media_len - 1)) ||
	    (strspn(if_name, tipc_alphabet) != (if_len - 1)))
		return 0;

	/* return bearer name components, if necessary */

	if (name_parts) {
		strcpy(name_parts->media_name, media_name);
		strcpy(name_parts->if_name, if_name);
	}
	return 1;
}

/**
 * bearer_find - locates bearer object with matching bearer name
 */

static struct bearer *bearer_find(const char *name)
{
	struct bearer *b_ptr;
	u32 i;

288
	for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) {
P
Per Liden 已提交
289 290 291
		if (b_ptr->active && (!strcmp(b_ptr->publ.name, name)))
			return b_ptr;
	}
292
	return NULL;
P
Per Liden 已提交
293 294 295
}

/**
296
 * tipc_bearer_find_interface - locates bearer object with matching interface name
P
Per Liden 已提交
297 298
 */

299
struct bearer *tipc_bearer_find_interface(const char *if_name)
P
Per Liden 已提交
300 301 302 303 304
{
	struct bearer *b_ptr;
	char *b_if_name;
	u32 i;

305
	for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) {
P
Per Liden 已提交
306 307 308 309 310 311
		if (!b_ptr->active)
			continue;
		b_if_name = strchr(b_ptr->publ.name, ':') + 1;
		if (!strcmp(b_if_name, if_name))
			return b_ptr;
	}
312
	return NULL;
P
Per Liden 已提交
313 314 315
}

/**
316
 * tipc_bearer_get_names - record names of bearers in buffer
P
Per Liden 已提交
317 318
 */

319
struct sk_buff *tipc_bearer_get_names(void)
P
Per Liden 已提交
320 321 322 323 324 325
{
	struct sk_buff *buf;
	struct media *m_ptr;
	struct bearer *b_ptr;
	int i, j;

326
	buf = tipc_cfg_reply_alloc(MAX_BEARERS * TLV_SPACE(TIPC_MAX_BEARER_NAME));
P
Per Liden 已提交
327 328 329
	if (!buf)
		return NULL;

330
	read_lock_bh(&tipc_net_lock);
P
Per Liden 已提交
331 332
	for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
		for (j = 0; j < MAX_BEARERS; j++) {
333
			b_ptr = &tipc_bearers[j];
P
Per Liden 已提交
334
			if (b_ptr->active && (b_ptr->media == m_ptr)) {
335 336
				tipc_cfg_append_tlv(buf, TIPC_TLV_BEARER_NAME,
						    b_ptr->publ.name,
337
						    strlen(b_ptr->publ.name) + 1);
P
Per Liden 已提交
338 339 340
			}
		}
	}
341
	read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
342 343 344
	return buf;
}

345
void tipc_bearer_add_dest(struct bearer *b_ptr, u32 dest)
P
Per Liden 已提交
346
{
347 348 349
	tipc_nmap_add(&b_ptr->nodes, dest);
	tipc_disc_update_link_req(b_ptr->link_req);
	tipc_bcbearer_sort();
P
Per Liden 已提交
350 351
}

352
void tipc_bearer_remove_dest(struct bearer *b_ptr, u32 dest)
P
Per Liden 已提交
353
{
354 355 356
	tipc_nmap_remove(&b_ptr->nodes, dest);
	tipc_disc_update_link_req(b_ptr->link_req);
	tipc_bcbearer_sort();
P
Per Liden 已提交
357 358 359 360 361 362
}

/*
 * bearer_push(): Resolve bearer congestion. Force the waiting
 * links to push out their unsent packets, one packet per link
 * per iteration, until all packets are gone or congestion reoccurs.
363
 * 'tipc_net_lock' is read_locked when this function is called
P
Per Liden 已提交
364 365 366 367 368
 * bearer.lock must be taken before calling
 * Returns binary true(1) ore false(0)
 */
static int bearer_push(struct bearer *b_ptr)
{
369
	u32 res = 0;
P
Per Liden 已提交
370 371 372 373 374 375 376
	struct link *ln, *tln;

	if (b_ptr->publ.blocked)
		return 0;

	while (!list_empty(&b_ptr->cong_links) && (res != PUSH_FAILED)) {
		list_for_each_entry_safe(ln, tln, &b_ptr->cong_links, link_list) {
377
			res = tipc_link_push_packet(ln);
P
Per Liden 已提交
378 379 380 381 382 383 384 385 386
			if (res == PUSH_FAILED)
				break;
			if (res == PUSH_FINISHED)
				list_move_tail(&ln->link_list, &b_ptr->links);
		}
	}
	return list_empty(&b_ptr->cong_links);
}

387
void tipc_bearer_lock_push(struct bearer *b_ptr)
P
Per Liden 已提交
388 389 390 391 392 393 394
{
	int res;

	spin_lock_bh(&b_ptr->publ.lock);
	res = bearer_push(b_ptr);
	spin_unlock_bh(&b_ptr->publ.lock);
	if (res)
395
		tipc_bcbearer_push();
P
Per Liden 已提交
396 397 398 399
}


/*
400 401
 * Interrupt enabling new requests after bearer congestion or blocking:
 * See bearer_send().
P
Per Liden 已提交
402 403 404 405 406 407 408 409
 */
void tipc_continue(struct tipc_bearer *tb_ptr)
{
	struct bearer *b_ptr = (struct bearer *)tb_ptr;

	spin_lock_bh(&b_ptr->publ.lock);
	b_ptr->continue_count++;
	if (!list_empty(&b_ptr->cong_links))
410
		tipc_k_signal((Handler)tipc_bearer_lock_push, (unsigned long)b_ptr);
P
Per Liden 已提交
411 412 413 414 415
	b_ptr->publ.blocked = 0;
	spin_unlock_bh(&b_ptr->publ.lock);
}

/*
416 417 418
 * Schedule link for sending of messages after the bearer
 * has been deblocked by 'continue()'. This method is called
 * when somebody tries to send a message via this link while
419
 * the bearer is congested. 'tipc_net_lock' is in read_lock here
P
Per Liden 已提交
420 421 422
 * bearer.lock is busy
 */

423
static void tipc_bearer_schedule_unlocked(struct bearer *b_ptr, struct link *l_ptr)
P
Per Liden 已提交
424 425 426 427 428
{
	list_move_tail(&l_ptr->link_list, &b_ptr->cong_links);
}

/*
429 430 431
 * Schedule link for sending of messages after the bearer
 * has been deblocked by 'continue()'. This method is called
 * when somebody tries to send a message via this link while
432
 * the bearer is congested. 'tipc_net_lock' is in read_lock here,
P
Per Liden 已提交
433 434 435
 * bearer.lock is free
 */

436
void tipc_bearer_schedule(struct bearer *b_ptr, struct link *l_ptr)
P
Per Liden 已提交
437 438
{
	spin_lock_bh(&b_ptr->publ.lock);
439
	tipc_bearer_schedule_unlocked(b_ptr, l_ptr);
P
Per Liden 已提交
440 441 442 443 444
	spin_unlock_bh(&b_ptr->publ.lock);
}


/*
445
 * tipc_bearer_resolve_congestion(): Check if there is bearer congestion,
P
Per Liden 已提交
446
 * and if there is, try to resolve it before returning.
447
 * 'tipc_net_lock' is read_locked when this function is called
P
Per Liden 已提交
448
 */
449
int tipc_bearer_resolve_congestion(struct bearer *b_ptr, struct link *l_ptr)
P
Per Liden 已提交
450 451 452 453 454 455 456
{
	int res = 1;

	if (list_empty(&b_ptr->cong_links))
		return 1;
	spin_lock_bh(&b_ptr->publ.lock);
	if (!bearer_push(b_ptr)) {
457
		tipc_bearer_schedule_unlocked(b_ptr, l_ptr);
P
Per Liden 已提交
458 459 460 461 462 463
		res = 0;
	}
	spin_unlock_bh(&b_ptr->publ.lock);
	return res;
}

464 465 466 467 468 469 470 471 472 473 474 475
/**
 * tipc_bearer_congested - determines if bearer is currently congested
 */

int tipc_bearer_congested(struct bearer *b_ptr, struct link *l_ptr)
{
	if (unlikely(b_ptr->publ.blocked))
		return 1;
	if (likely(list_empty(&b_ptr->cong_links)))
		return 0;
	return !tipc_bearer_resolve_congestion(b_ptr, l_ptr);
}
P
Per Liden 已提交
476 477 478

/**
 * tipc_enable_bearer - enable bearer with the given name
479
 */
P
Per Liden 已提交
480 481 482 483 484 485 486 487 488 489 490 491

int tipc_enable_bearer(const char *name, u32 bcast_scope, u32 priority)
{
	struct bearer *b_ptr;
	struct media *m_ptr;
	struct bearer_name b_name;
	char addr_string[16];
	u32 bearer_id;
	u32 with_this_prio;
	u32 i;
	int res = -EINVAL;

492 493 494
	if (tipc_mode != TIPC_NET_MODE) {
		warn("Bearer <%s> rejected, not supported in standalone mode\n",
		     name);
P
Per Liden 已提交
495
		return -ENOPROTOOPT;
496 497 498
	}
	if (!bearer_name_validate(name, &b_name)) {
		warn("Bearer <%s> rejected, illegal name\n", name);
P
Per Liden 已提交
499
		return -EINVAL;
500
	}
501
	if (!tipc_addr_domain_valid(bcast_scope) ||
502
	    !tipc_in_scope(bcast_scope, tipc_own_addr)) {
503 504 505
		warn("Bearer <%s> rejected, illegal broadcast scope\n", name);
		return -EINVAL;
	}
P
Per Liden 已提交
506 507
	if ((priority < TIPC_MIN_LINK_PRI ||
	     priority > TIPC_MAX_LINK_PRI) &&
508 509
	    (priority != TIPC_MEDIA_LINK_PRI)) {
		warn("Bearer <%s> rejected, illegal priority\n", name);
P
Per Liden 已提交
510
		return -EINVAL;
511
	}
P
Per Liden 已提交
512

513
	write_lock_bh(&tipc_net_lock);
P
Per Liden 已提交
514 515 516

	m_ptr = media_find(b_name.media_name);
	if (!m_ptr) {
517 518
		warn("Bearer <%s> rejected, media <%s> not registered\n", name,
		     b_name.media_name);
P
Per Liden 已提交
519 520
		goto failed;
	}
P
Per Liden 已提交
521 522

	if (priority == TIPC_MEDIA_LINK_PRI)
P
Per Liden 已提交
523 524 525 526 527 528
		priority = m_ptr->priority;

restart:
	bearer_id = MAX_BEARERS;
	with_this_prio = 1;
	for (i = MAX_BEARERS; i-- != 0; ) {
529
		if (!tipc_bearers[i].active) {
P
Per Liden 已提交
530 531 532
			bearer_id = i;
			continue;
		}
533
		if (!strcmp(name, tipc_bearers[i].publ.name)) {
534
			warn("Bearer <%s> rejected, already enabled\n", name);
P
Per Liden 已提交
535 536
			goto failed;
		}
537
		if ((tipc_bearers[i].priority == priority) &&
P
Per Liden 已提交
538 539
		    (++with_this_prio > 2)) {
			if (priority-- == 0) {
540 541
				warn("Bearer <%s> rejected, duplicate priority\n",
				     name);
P
Per Liden 已提交
542 543
				goto failed;
			}
544
			warn("Bearer <%s> priority adjustment required %u->%u\n",
P
Per Liden 已提交
545 546 547 548 549
			     name, priority + 1, priority);
			goto restart;
		}
	}
	if (bearer_id >= MAX_BEARERS) {
550
		warn("Bearer <%s> rejected, bearer limit reached (%u)\n",
551
		     name, MAX_BEARERS);
P
Per Liden 已提交
552 553 554
		goto failed;
	}

555
	b_ptr = &tipc_bearers[bearer_id];
P
Per Liden 已提交
556 557 558
	strcpy(b_ptr->publ.name, name);
	res = m_ptr->enable_bearer(&b_ptr->publ);
	if (res) {
559
		warn("Bearer <%s> rejected, enable failure (%d)\n", name, -res);
P
Per Liden 已提交
560 561 562 563 564 565 566 567 568 569 570 571
		goto failed;
	}

	b_ptr->identity = bearer_id;
	b_ptr->media = m_ptr;
	b_ptr->net_plane = bearer_id + 'A';
	b_ptr->active = 1;
	b_ptr->detect_scope = bcast_scope;
	b_ptr->priority = priority;
	INIT_LIST_HEAD(&b_ptr->cong_links);
	INIT_LIST_HEAD(&b_ptr->links);
	if (m_ptr->bcast) {
572 573
		b_ptr->link_req = tipc_disc_init_link_req(b_ptr, &m_ptr->bcast_addr,
							  bcast_scope, 2);
P
Per Liden 已提交
574
	}
I
Ingo Molnar 已提交
575
	spin_lock_init(&b_ptr->publ.lock);
576
	write_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
577
	info("Enabled bearer <%s>, discovery domain %s, priority %u\n",
578
	     name, tipc_addr_string_fill(addr_string, bcast_scope), priority);
P
Per Liden 已提交
579 580
	return 0;
failed:
581
	write_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
582 583 584 585 586 587 588 589 590 591
	return res;
}

/**
 * tipc_block_bearer(): Block the bearer with the given name,
 *                      and reset all its links
 */

int tipc_block_bearer(const char *name)
{
592
	struct bearer *b_ptr = NULL;
P
Per Liden 已提交
593 594 595
	struct link *l_ptr;
	struct link *temp_l_ptr;

596
	read_lock_bh(&tipc_net_lock);
P
Per Liden 已提交
597 598 599
	b_ptr = bearer_find(name);
	if (!b_ptr) {
		warn("Attempt to block unknown bearer <%s>\n", name);
600
		read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
601 602 603
		return -EINVAL;
	}

604
	info("Blocking bearer <%s>\n", name);
P
Per Liden 已提交
605 606 607
	spin_lock_bh(&b_ptr->publ.lock);
	b_ptr->publ.blocked = 1;
	list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) {
608
		struct tipc_node *n_ptr = l_ptr->owner;
P
Per Liden 已提交
609 610

		spin_lock_bh(&n_ptr->lock);
611
		tipc_link_reset(l_ptr);
P
Per Liden 已提交
612 613 614
		spin_unlock_bh(&n_ptr->lock);
	}
	spin_unlock_bh(&b_ptr->publ.lock);
615
	read_unlock_bh(&tipc_net_lock);
616
	return 0;
P
Per Liden 已提交
617 618 619 620
}

/**
 * bearer_disable -
621
 *
622
 * Note: This routine assumes caller holds tipc_net_lock.
P
Per Liden 已提交
623 624
 */

625
static int bearer_disable(struct bearer *b_ptr)
P
Per Liden 已提交
626 627 628 629
{
	struct link *l_ptr;
	struct link *temp_l_ptr;

630
	info("Disabling bearer <%s>\n", b_ptr->publ.name);
631
	tipc_disc_stop_link_req(b_ptr->link_req);
P
Per Liden 已提交
632 633 634
	spin_lock_bh(&b_ptr->publ.lock);
	b_ptr->link_req = NULL;
	b_ptr->publ.blocked = 1;
635
	b_ptr->media->disable_bearer(&b_ptr->publ);
P
Per Liden 已提交
636
	list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) {
637
		tipc_link_delete(l_ptr);
P
Per Liden 已提交
638 639 640
	}
	spin_unlock_bh(&b_ptr->publ.lock);
	memset(b_ptr, 0, sizeof(struct bearer));
641
	return 0;
P
Per Liden 已提交
642 643 644 645
}

int tipc_disable_bearer(const char *name)
{
646
	struct bearer *b_ptr;
P
Per Liden 已提交
647 648
	int res;

649
	write_lock_bh(&tipc_net_lock);
650 651 652 653 654 655
	b_ptr = bearer_find(name);
	if (b_ptr == NULL) {
		warn("Attempt to disable unknown bearer <%s>\n", name);
		res = -EINVAL;
	} else
		res = bearer_disable(b_ptr);
656
	write_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
657 658 659 660 661
	return res;
}



662
void tipc_bearer_stop(void)
P
Per Liden 已提交
663 664 665 666
{
	u32 i;

	for (i = 0; i < MAX_BEARERS; i++) {
667
		if (tipc_bearers[i].active)
668
			bearer_disable(&tipc_bearers[i]);
P
Per Liden 已提交
669 670 671
	}
	media_count = 0;
}