bearer.c 17.4 KB
Newer Older
P
Per Liden 已提交
1 2 3
/*
 * net/tipc/bearer.c: TIPC bearer code
 * 
P
Per Liden 已提交
4
 * Copyright (c) 1996-2006, Ericsson AB
P
Per Liden 已提交
5 6 7
 * Copyright (c) 2004-2005, Wind River Systems
 * 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 45 46 47 48 49 50
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "core.h"
#include "config.h"
#include "dbg.h"
#include "bearer.h"
#include "link.h"
#include "port.h"
#include "discover.h"
#include "bcast.h"

#define MAX_ADDR_STR 32

static struct media *media_list = 0;
static u32 media_count = 0;

51
struct bearer *tipc_bearers = 0;
P
Per Liden 已提交
52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109

/**
 * media_name_valid - validate media name
 * 
 * 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;
	return (strspn(name, tipc_alphabet) == len);
}

/**
 * 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;
	}
	return 0;
}

/**
 * tipc_register_media - register a media type
 * 
 * Bearers for this media type must be activated separately at a later stage.
 */

int  tipc_register_media(u32 media_type,
			 char *name, 
			 int (*enable)(struct tipc_bearer *), 
			 void (*disable)(struct tipc_bearer *), 
			 int (*send_msg)(struct sk_buff *, 
					 struct tipc_bearer *,
					 struct tipc_media_addr *), 
			 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;

110
	write_lock_bh(&tipc_net_lock);
P
Per Liden 已提交
111 112 113 114 115 116 117 118 119 120 121
	if (!media_list)
		goto exit;

	if (!media_name_valid(name)) {
		warn("Media registration error: illegal name <%s>\n", name);
		goto exit;
	}
	if (!bcast_addr) {
		warn("Media registration error: no broadcast address supplied\n");
		goto exit;
	}
P
Per Liden 已提交
122 123
	if ((bearer_priority < TIPC_MIN_LINK_PRI) &&
	    (bearer_priority > TIPC_MAX_LINK_PRI)) {
P
Per Liden 已提交
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
		warn("Media registration error: priority %u\n", bearer_priority);
		goto exit;
	}
	if ((link_tolerance < TIPC_MIN_LINK_TOL) || 
	    (link_tolerance > TIPC_MAX_LINK_TOL)) {
		warn("Media registration error: tolerance %u\n", link_tolerance);
		goto exit;
	}

	media_id = media_count++;
	if (media_id >= MAX_MEDIA) {
		warn("Attempt to register more than %u media\n", MAX_MEDIA);
		media_count--;
		goto exit;
	}
	for (i = 0; i < media_id; i++) {
		if (media_list[i].type_id == media_type) {
			warn("Attempt to register second media with type %u\n", 
			     media_type);
			media_count--;
			goto exit;
		}
		if (!strcmp(name, media_list[i].name)) {
			warn("Attempt to re-register media name <%s>\n", name);
			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:
168
	write_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
169 170 171 172
	return res;
}

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

176
void tipc_media_addr_printf(struct print_buf *pb, struct tipc_media_addr *a)
P
Per Liden 已提交
177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
{
	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];

		tipc_printf(pb, "%s(%s) ", m_ptr->name, 
			    m_ptr->addr2str(a, addr_str, sizeof(addr_str)));
	} else {
		unchar *addr = (unchar *)&a->dev_addr;

		tipc_printf(pb, "UNKNOWN(%u):", media_type);
		for (i = 0; i < (sizeof(*a) - sizeof(a->type)); i++) {
			tipc_printf(pb, "%02x ", addr[i]);
		}
	}
}

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

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

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

217
	read_lock_bh(&tipc_net_lock);
P
Per Liden 已提交
218
	for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
219 220
		tipc_cfg_append_tlv(buf, TIPC_TLV_MEDIA_NAME, m_ptr->name, 
				    strlen(m_ptr->name) + 1);
P
Per Liden 已提交
221
	}
222
	read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
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 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285
	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)
 * 
 * Returns 1 if bearer name is valid, otherwise 0.
 */

static int bearer_name_validate(const char *name, 
				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 */

	if ((media_len <= 1) || (media_len > TIPC_MAX_MEDIA_NAME) || 
	    (if_len <= 1) || (if_len > TIPC_MAX_IF_NAME) || 
	    (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;

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

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

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

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

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

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

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

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

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

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

/*
 * 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.
361
 * 'tipc_net_lock' is read_locked when this function is called
P
Per Liden 已提交
362 363 364 365 366 367 368 369 370 371 372 373 374
 * bearer.lock must be taken before calling
 * Returns binary true(1) ore false(0)
 */
static int bearer_push(struct bearer *b_ptr)
{
	u32 res = TIPC_OK;
	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) {
375
			res = tipc_link_push_packet(ln);
P
Per Liden 已提交
376 377 378 379 380 381 382 383 384
			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);
}

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

	spin_lock_bh(&b_ptr->publ.lock);
	res = bearer_push(b_ptr);
	spin_unlock_bh(&b_ptr->publ.lock);
	if (res)
393
		tipc_bcbearer_push();
P
Per Liden 已提交
394 395 396 397 398 399 400 401 402 403 404 405 406 407
}


/*
 * Interrupt enabling new requests after bearer congestion or blocking:    
 * See bearer_send().   
 */
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))
408
		tipc_k_signal((Handler)tipc_bearer_lock_push, (unsigned long)b_ptr);
P
Per Liden 已提交
409 410 411 412 413 414 415 416
	b_ptr->publ.blocked = 0;
	spin_unlock_bh(&b_ptr->publ.lock);
}

/*
 * 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 
417
 * the bearer is congested. 'tipc_net_lock' is in read_lock here
P
Per Liden 已提交
418 419 420
 * bearer.lock is busy
 */

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

/*
 * 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 
430
 * the bearer is congested. 'tipc_net_lock' is in read_lock here,
P
Per Liden 已提交
431 432 433
 * bearer.lock is free
 */

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


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

	if (list_empty(&b_ptr->cong_links))
		return 1;
	spin_lock_bh(&b_ptr->publ.lock);
	if (!bearer_push(b_ptr)) {
455
		tipc_bearer_schedule_unlocked(b_ptr, l_ptr);
P
Per Liden 已提交
456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479
		res = 0;
	}
	spin_unlock_bh(&b_ptr->publ.lock);
	return res;
}


/**
 * tipc_enable_bearer - enable bearer with the given name
 */              

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;

	if (tipc_mode != TIPC_NET_MODE)
		return -ENOPROTOOPT;
P
Per Liden 已提交
480

P
Per Liden 已提交
481
	if (!bearer_name_validate(name, &b_name) ||
482
	    !tipc_addr_domain_valid(bcast_scope) ||
P
Per Liden 已提交
483 484 485 486 487 488
	    !in_scope(bcast_scope, tipc_own_addr))
		return -EINVAL;

	if ((priority < TIPC_MIN_LINK_PRI ||
	     priority > TIPC_MAX_LINK_PRI) &&
	    (priority != TIPC_MEDIA_LINK_PRI))
P
Per Liden 已提交
489 490
		return -EINVAL;

491 492
	write_lock_bh(&tipc_net_lock);
	if (!tipc_bearers)
P
Per Liden 已提交
493 494 495 496 497 498 499
		goto failed;

	m_ptr = media_find(b_name.media_name);
	if (!m_ptr) {
		warn("No media <%s>\n", b_name.media_name);
		goto failed;
	}
P
Per Liden 已提交
500 501

	if (priority == TIPC_MEDIA_LINK_PRI)
P
Per Liden 已提交
502 503 504 505 506 507
		priority = m_ptr->priority;

restart:
	bearer_id = MAX_BEARERS;
	with_this_prio = 1;
	for (i = MAX_BEARERS; i-- != 0; ) {
508
		if (!tipc_bearers[i].active) {
P
Per Liden 已提交
509 510 511
			bearer_id = i;
			continue;
		}
512
		if (!strcmp(name, tipc_bearers[i].publ.name)) {
P
Per Liden 已提交
513 514 515
			warn("Bearer <%s> already enabled\n", name);
			goto failed;
		}
516
		if ((tipc_bearers[i].priority == priority) &&
P
Per Liden 已提交
517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532
		    (++with_this_prio > 2)) {
			if (priority-- == 0) {
				warn("Third bearer <%s> with priority %u, unable to lower to %u\n",
				     name, priority + 1, priority);
				goto failed;
			}
			warn("Third bearer <%s> with priority %u, lowering to %u\n",
			     name, priority + 1, priority);
			goto restart;
		}
	}
	if (bearer_id >= MAX_BEARERS) {
		warn("Attempt to enable more than %d bearers\n", MAX_BEARERS);
		goto failed;
	}

533
	b_ptr = &tipc_bearers[bearer_id];
P
Per Liden 已提交
534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551
	memset(b_ptr, 0, sizeof(struct bearer));

	strcpy(b_ptr->publ.name, name);
	res = m_ptr->enable_bearer(&b_ptr->publ);
	if (res) {
		warn("Failed to enable bearer <%s>\n", name);
		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) {
552 553
		b_ptr->link_req = tipc_disc_init_link_req(b_ptr, &m_ptr->bcast_addr,
							  bcast_scope, 2);
P
Per Liden 已提交
554 555
	}
	b_ptr->publ.lock = SPIN_LOCK_UNLOCKED;
556
	write_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
557 558
	info("Enabled bearer <%s>, discovery domain %s, priority %u\n",
	     name, addr_string_fill(addr_string, bcast_scope), priority);
P
Per Liden 已提交
559 560
	return 0;
failed:
561
	write_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578
	return res;
}

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

int tipc_block_bearer(const char *name)
{
	struct bearer *b_ptr = 0;
	struct link *l_ptr;
	struct link *temp_l_ptr;

	if (tipc_mode != TIPC_NET_MODE)
		return -ENOPROTOOPT;

579
	read_lock_bh(&tipc_net_lock);
P
Per Liden 已提交
580 581 582
	b_ptr = bearer_find(name);
	if (!b_ptr) {
		warn("Attempt to block unknown bearer <%s>\n", name);
583
		read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
584 585 586 587 588 589 590 591 592
		return -EINVAL;
	}

	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) {
		struct node *n_ptr = l_ptr->owner;

		spin_lock_bh(&n_ptr->lock);
593
		tipc_link_reset(l_ptr);
P
Per Liden 已提交
594 595 596
		spin_unlock_bh(&n_ptr->lock);
	}
	spin_unlock_bh(&b_ptr->publ.lock);
597
	read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
598 599 600 601 602 603 604
	info("Blocked bearer <%s>\n", name);
	return TIPC_OK;
}

/**
 * bearer_disable -
 * 
605
 * Note: This routine assumes caller holds tipc_net_lock.
P
Per Liden 已提交
606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622
 */

static int bearer_disable(const char *name)
{
	struct bearer *b_ptr;
	struct link *l_ptr;
	struct link *temp_l_ptr;

	if (tipc_mode != TIPC_NET_MODE)
		return -ENOPROTOOPT;

	b_ptr = bearer_find(name);
	if (!b_ptr) {
		warn("Attempt to disable unknown bearer <%s>\n", name);
		return -EINVAL;
	}

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

int tipc_disable_bearer(const char *name)
{
	int res;

647
	write_lock_bh(&tipc_net_lock);
P
Per Liden 已提交
648
	res = bearer_disable(name);
649
	write_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
650 651 652 653 654
	return res;
}



655
int tipc_bearer_init(void)
P
Per Liden 已提交
656 657 658
{
	int res;

659 660
	write_lock_bh(&tipc_net_lock);
	tipc_bearers = kmalloc(MAX_BEARERS * sizeof(struct bearer), GFP_ATOMIC);
P
Per Liden 已提交
661
	media_list = kmalloc(MAX_MEDIA * sizeof(struct media), GFP_ATOMIC);
662 663
	if (tipc_bearers && media_list) {
		memset(tipc_bearers, 0, MAX_BEARERS * sizeof(struct bearer));
P
Per Liden 已提交
664 665 666
		memset(media_list, 0, MAX_MEDIA * sizeof(struct media));
		res = TIPC_OK;
	} else {
667
		kfree(tipc_bearers);
P
Per Liden 已提交
668
		kfree(media_list);
669
		tipc_bearers = 0;
P
Per Liden 已提交
670 671 672
		media_list = 0;
		res = -ENOMEM;
	}
673
	write_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
674 675 676
	return res;
}

677
void tipc_bearer_stop(void)
P
Per Liden 已提交
678 679 680
{
	u32 i;

681
	if (!tipc_bearers)
P
Per Liden 已提交
682 683 684
		return;

	for (i = 0; i < MAX_BEARERS; i++) {
685 686
		if (tipc_bearers[i].active)
			tipc_bearers[i].publ.blocked = 1;
P
Per Liden 已提交
687 688
	}
	for (i = 0; i < MAX_BEARERS; i++) {
689 690
		if (tipc_bearers[i].active)
			bearer_disable(tipc_bearers[i].publ.name);
P
Per Liden 已提交
691
	}
692
	kfree(tipc_bearers);
P
Per Liden 已提交
693
	kfree(media_list);
694
	tipc_bearers = 0;
P
Per Liden 已提交
695 696 697 698 699
	media_list = 0;
	media_count = 0;
}