bearer.c 16.5 KB
Newer Older
Per Liden's avatar
Per Liden committed
1
2
/*
 * net/tipc/bearer.c: TIPC bearer code
3
 *
4
 * Copyright (c) 1996-2006, Ericsson AB
5
 * Copyright (c) 2004-2006, 2010-2011, Wind River Systems
Per Liden's avatar
Per Liden committed
6
7
 * All rights reserved.
 *
Per Liden's avatar
Per Liden committed
8
 * Redistribution and use in source and binary forms, with or without
Per Liden's avatar
Per Liden committed
9
10
 * modification, are permitted provided that the following conditions are met:
 *
Per Liden's avatar
Per Liden committed
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.
Per Liden's avatar
Per Liden committed
19
 *
Per Liden's avatar
Per Liden committed
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
Per Liden's avatar
Per Liden committed
34
35
36
37
38
39
40
41
42
43
 * POSSIBILITY OF SUCH DAMAGE.
 */

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

#define MAX_ADDR_STR 32

44
static struct media media_list[MAX_MEDIA];
45
static u32 media_count;
Per Liden's avatar
Per Liden committed
46

47
struct tipc_bearer tipc_bearers[MAX_BEARERS];
Per Liden's avatar
Per Liden committed
48

49
50
static void bearer_disable(struct tipc_bearer *b_ptr);

Per Liden's avatar
Per Liden committed
51
52
/**
 * media_name_valid - validate media name
53
 *
Per Liden's avatar
Per Liden committed
54
55
56
57
58
59
60
61
62
63
 * 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;
Eric Dumazet's avatar
Eric Dumazet committed
64
	return strspn(name, tipc_alphabet) == len;
Per Liden's avatar
Per Liden committed
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
}

/**
 * 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;
	}
80
	return NULL;
Per Liden's avatar
Per Liden committed
81
82
}

83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
/**
 * media_find_id - locates specified media object by type identifier
 */

static struct media *media_find_id(u8 type)
{
	u32 i;

	for (i = 0; i < media_count; i++) {
		if (media_list[i].type_id == type)
			return &media_list[i];
	}
	return NULL;
}

Per Liden's avatar
Per Liden committed
98
99
/**
 * tipc_register_media - register a media type
100
 *
Per Liden's avatar
Per Liden committed
101
102
103
 * Bearers for this media type must be activated separately at a later stage.
 */

104
int  tipc_register_media(struct media *m_ptr)
Per Liden's avatar
Per Liden committed
105
106
107
{
	int res = -EINVAL;

108
	write_lock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
109

110
	if (tipc_mode != TIPC_NET_MODE) {
111
112
		warn("Media <%s> rejected, not in networked mode yet\n",
		     m_ptr->name);
113
114
		goto exit;
	}
115
116
	if (!media_name_valid(m_ptr->name)) {
		warn("Media <%s> rejected, illegal name\n", m_ptr->name);
Per Liden's avatar
Per Liden committed
117
118
		goto exit;
	}
119
120
121
	if (m_ptr->bcast_addr.type != htonl(m_ptr->type_id)) {
		warn("Media <%s> rejected, illegal broadcast address\n",
		     m_ptr->name);
Per Liden's avatar
Per Liden committed
122
123
		goto exit;
	}
124
125
126
127
	if ((m_ptr->priority < TIPC_MIN_LINK_PRI) ||
	    (m_ptr->priority > TIPC_MAX_LINK_PRI)) {
		warn("Media <%s> rejected, illegal priority (%u)\n",
		     m_ptr->name, m_ptr->priority);
Per Liden's avatar
Per Liden committed
128
129
		goto exit;
	}
130
131
132
133
	if ((m_ptr->tolerance < TIPC_MIN_LINK_TOL) ||
	    (m_ptr->tolerance > TIPC_MAX_LINK_TOL)) {
		warn("Media <%s> rejected, illegal tolerance (%u)\n",
		     m_ptr->name, m_ptr->tolerance);
Per Liden's avatar
Per Liden committed
134
135
136
		goto exit;
	}

137
	if (media_count >= MAX_MEDIA) {
138
139
		warn("Media <%s> rejected, media limit reached (%u)\n",
		     m_ptr->name, MAX_MEDIA);
Per Liden's avatar
Per Liden committed
140
141
		goto exit;
	}
142
143
144
	if (media_find(m_ptr->name) || media_find_id(m_ptr->type_id)) {
		warn("Media <%s> rejected, already registered\n", m_ptr->name);
		goto exit;
Per Liden's avatar
Per Liden committed
145
146
	}

147
148
	media_list[media_count] = *m_ptr;
	media_count++;
Per Liden's avatar
Per Liden committed
149
150
	res = 0;
exit:
151
	write_unlock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
152
153
154
155
	return res;
}

/**
156
 * tipc_media_addr_printf - record media address in print buffer
Per Liden's avatar
Per Liden committed
157
158
 */

159
void tipc_media_addr_printf(struct print_buf *pb, struct tipc_media_addr *a)
Per Liden's avatar
Per Liden committed
160
161
162
163
164
165
166
167
168
169
170
171
172
173
{
	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];

174
		tipc_printf(pb, "%s(%s)", m_ptr->name,
Per Liden's avatar
Per Liden committed
175
176
177
178
			    m_ptr->addr2str(a, addr_str, sizeof(addr_str)));
	} else {
		unchar *addr = (unchar *)&a->dev_addr;

179
		tipc_printf(pb, "UNKNOWN(%u)", media_type);
180
		for (i = 0; i < (sizeof(*a) - sizeof(a->type)); i++)
181
			tipc_printf(pb, "-%02x", addr[i]);
Per Liden's avatar
Per Liden committed
182
183
184
185
	}
}

/**
186
 * tipc_media_get_names - record names of registered media in buffer
Per Liden's avatar
Per Liden committed
187
188
 */

189
struct sk_buff *tipc_media_get_names(void)
Per Liden's avatar
Per Liden committed
190
191
192
193
194
{
	struct sk_buff *buf;
	struct media *m_ptr;
	int i;

195
	buf = tipc_cfg_reply_alloc(MAX_MEDIA * TLV_SPACE(TIPC_MAX_MEDIA_NAME));
Per Liden's avatar
Per Liden committed
196
197
198
	if (!buf)
		return NULL;

199
	read_lock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
200
	for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
201
		tipc_cfg_append_tlv(buf, TIPC_TLV_MEDIA_NAME, m_ptr->name,
202
				    strlen(m_ptr->name) + 1);
Per Liden's avatar
Per Liden committed
203
	}
204
	read_unlock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
205
206
207
208
209
210
211
	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)
212
 *
Per Liden's avatar
Per Liden committed
213
214
215
 * Returns 1 if bearer name is valid, otherwise 0.
 */

216
static int bearer_name_validate(const char *name,
Per Liden's avatar
Per Liden committed
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
				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;
236
237
	if_name = strchr(media_name, ':');
	if (if_name == NULL)
Per Liden's avatar
Per Liden committed
238
239
240
241
242
243
244
		return 0;
	*(if_name++) = 0;
	media_len = if_name - media_name;
	if_len = strlen(if_name) + 1;

	/* validate component parts of bearer name */

245
246
	if ((media_len <= 1) || (media_len > TIPC_MAX_MEDIA_NAME) ||
	    (if_len <= 1) || (if_len > TIPC_MAX_IF_NAME) ||
Per Liden's avatar
Per Liden committed
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
	    (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
 */

264
static struct tipc_bearer *bearer_find(const char *name)
Per Liden's avatar
Per Liden committed
265
{
266
	struct tipc_bearer *b_ptr;
Per Liden's avatar
Per Liden committed
267
268
	u32 i;

269
	for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) {
270
		if (b_ptr->active && (!strcmp(b_ptr->name, name)))
Per Liden's avatar
Per Liden committed
271
272
			return b_ptr;
	}
273
	return NULL;
Per Liden's avatar
Per Liden committed
274
275
276
}

/**
277
 * tipc_bearer_find_interface - locates bearer object with matching interface name
Per Liden's avatar
Per Liden committed
278
279
 */

280
struct tipc_bearer *tipc_bearer_find_interface(const char *if_name)
Per Liden's avatar
Per Liden committed
281
{
282
	struct tipc_bearer *b_ptr;
Per Liden's avatar
Per Liden committed
283
284
285
	char *b_if_name;
	u32 i;

286
	for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) {
Per Liden's avatar
Per Liden committed
287
288
		if (!b_ptr->active)
			continue;
289
		b_if_name = strchr(b_ptr->name, ':') + 1;
Per Liden's avatar
Per Liden committed
290
291
292
		if (!strcmp(b_if_name, if_name))
			return b_ptr;
	}
293
	return NULL;
Per Liden's avatar
Per Liden committed
294
295
296
}

/**
297
 * tipc_bearer_get_names - record names of bearers in buffer
Per Liden's avatar
Per Liden committed
298
299
 */

300
struct sk_buff *tipc_bearer_get_names(void)
Per Liden's avatar
Per Liden committed
301
302
303
{
	struct sk_buff *buf;
	struct media *m_ptr;
304
	struct tipc_bearer *b_ptr;
Per Liden's avatar
Per Liden committed
305
306
	int i, j;

307
	buf = tipc_cfg_reply_alloc(MAX_BEARERS * TLV_SPACE(TIPC_MAX_BEARER_NAME));
Per Liden's avatar
Per Liden committed
308
309
310
	if (!buf)
		return NULL;

311
	read_lock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
312
313
	for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
		for (j = 0; j < MAX_BEARERS; j++) {
314
			b_ptr = &tipc_bearers[j];
Per Liden's avatar
Per Liden committed
315
			if (b_ptr->active && (b_ptr->media == m_ptr)) {
316
				tipc_cfg_append_tlv(buf, TIPC_TLV_BEARER_NAME,
317
318
						    b_ptr->name,
						    strlen(b_ptr->name) + 1);
Per Liden's avatar
Per Liden committed
319
320
321
			}
		}
	}
322
	read_unlock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
323
324
325
	return buf;
}

326
void tipc_bearer_add_dest(struct tipc_bearer *b_ptr, u32 dest)
Per Liden's avatar
Per Liden committed
327
{
328
329
	tipc_nmap_add(&b_ptr->nodes, dest);
	tipc_bcbearer_sort();
330
	tipc_disc_add_dest(b_ptr->link_req);
Per Liden's avatar
Per Liden committed
331
332
}

333
void tipc_bearer_remove_dest(struct tipc_bearer *b_ptr, u32 dest)
Per Liden's avatar
Per Liden committed
334
{
335
336
	tipc_nmap_remove(&b_ptr->nodes, dest);
	tipc_bcbearer_sort();
337
	tipc_disc_remove_dest(b_ptr->link_req);
Per Liden's avatar
Per Liden committed
338
339
340
341
342
343
}

/*
 * 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.
344
 * 'tipc_net_lock' is read_locked when this function is called
Per Liden's avatar
Per Liden committed
345
346
347
 * bearer.lock must be taken before calling
 * Returns binary true(1) ore false(0)
 */
348
static int bearer_push(struct tipc_bearer *b_ptr)
Per Liden's avatar
Per Liden committed
349
{
350
	u32 res = 0;
Per Liden's avatar
Per Liden committed
351
352
	struct link *ln, *tln;

353
	if (b_ptr->blocked)
Per Liden's avatar
Per Liden committed
354
355
356
357
		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) {
358
			res = tipc_link_push_packet(ln);
Per Liden's avatar
Per Liden committed
359
360
361
362
363
364
365
366
367
			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);
}

368
void tipc_bearer_lock_push(struct tipc_bearer *b_ptr)
Per Liden's avatar
Per Liden committed
369
{
370
	spin_lock_bh(&b_ptr->lock);
371
	bearer_push(b_ptr);
372
	spin_unlock_bh(&b_ptr->lock);
Per Liden's avatar
Per Liden committed
373
374
375
376
}


/*
377
378
 * Interrupt enabling new requests after bearer congestion or blocking:
 * See bearer_send().
Per Liden's avatar
Per Liden committed
379
 */
380
void tipc_continue(struct tipc_bearer *b_ptr)
Per Liden's avatar
Per Liden committed
381
{
382
	spin_lock_bh(&b_ptr->lock);
Per Liden's avatar
Per Liden committed
383
	if (!list_empty(&b_ptr->cong_links))
384
		tipc_k_signal((Handler)tipc_bearer_lock_push, (unsigned long)b_ptr);
385
386
	b_ptr->blocked = 0;
	spin_unlock_bh(&b_ptr->lock);
Per Liden's avatar
Per Liden committed
387
388
389
}

/*
390
391
392
 * 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
393
 * the bearer is congested. 'tipc_net_lock' is in read_lock here
Per Liden's avatar
Per Liden committed
394
395
396
 * bearer.lock is busy
 */

397
static void tipc_bearer_schedule_unlocked(struct tipc_bearer *b_ptr, struct link *l_ptr)
Per Liden's avatar
Per Liden committed
398
399
400
401
402
{
	list_move_tail(&l_ptr->link_list, &b_ptr->cong_links);
}

/*
403
404
405
 * 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
406
 * the bearer is congested. 'tipc_net_lock' is in read_lock here,
Per Liden's avatar
Per Liden committed
407
408
409
 * bearer.lock is free
 */

410
void tipc_bearer_schedule(struct tipc_bearer *b_ptr, struct link *l_ptr)
Per Liden's avatar
Per Liden committed
411
{
412
	spin_lock_bh(&b_ptr->lock);
413
	tipc_bearer_schedule_unlocked(b_ptr, l_ptr);
414
	spin_unlock_bh(&b_ptr->lock);
Per Liden's avatar
Per Liden committed
415
416
417
418
}


/*
419
 * tipc_bearer_resolve_congestion(): Check if there is bearer congestion,
Per Liden's avatar
Per Liden committed
420
 * and if there is, try to resolve it before returning.
421
 * 'tipc_net_lock' is read_locked when this function is called
Per Liden's avatar
Per Liden committed
422
 */
423
int tipc_bearer_resolve_congestion(struct tipc_bearer *b_ptr, struct link *l_ptr)
Per Liden's avatar
Per Liden committed
424
425
426
427
428
{
	int res = 1;

	if (list_empty(&b_ptr->cong_links))
		return 1;
429
	spin_lock_bh(&b_ptr->lock);
Per Liden's avatar
Per Liden committed
430
	if (!bearer_push(b_ptr)) {
431
		tipc_bearer_schedule_unlocked(b_ptr, l_ptr);
Per Liden's avatar
Per Liden committed
432
433
		res = 0;
	}
434
	spin_unlock_bh(&b_ptr->lock);
Per Liden's avatar
Per Liden committed
435
436
437
	return res;
}

438
439
440
441
/**
 * tipc_bearer_congested - determines if bearer is currently congested
 */

442
int tipc_bearer_congested(struct tipc_bearer *b_ptr, struct link *l_ptr)
443
{
444
	if (unlikely(b_ptr->blocked))
445
446
447
448
449
		return 1;
	if (likely(list_empty(&b_ptr->cong_links)))
		return 0;
	return !tipc_bearer_resolve_congestion(b_ptr, l_ptr);
}
Per Liden's avatar
Per Liden committed
450
451
452

/**
 * tipc_enable_bearer - enable bearer with the given name
453
 */
Per Liden's avatar
Per Liden committed
454

455
int tipc_enable_bearer(const char *name, u32 disc_domain, u32 priority)
Per Liden's avatar
Per Liden committed
456
{
457
	struct tipc_bearer *b_ptr;
Per Liden's avatar
Per Liden committed
458
459
460
461
462
463
464
465
	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;

466
467
468
	if (tipc_mode != TIPC_NET_MODE) {
		warn("Bearer <%s> rejected, not supported in standalone mode\n",
		     name);
Per Liden's avatar
Per Liden committed
469
		return -ENOPROTOOPT;
470
471
472
	}
	if (!bearer_name_validate(name, &b_name)) {
		warn("Bearer <%s> rejected, illegal name\n", name);
473
		return -EINVAL;
474
	}
475
476
477
478
479
480
481
482
483
	if (tipc_addr_domain_valid(disc_domain) &&
	    (disc_domain != tipc_own_addr)) {
		if (tipc_in_scope(disc_domain, tipc_own_addr)) {
			disc_domain = tipc_own_addr & TIPC_CLUSTER_MASK;
			res = 0;   /* accept any node in own cluster */
		} else if (in_own_cluster(disc_domain))
			res = 0;   /* accept specified node in own cluster */
	}
	if (res) {
484
		warn("Bearer <%s> rejected, illegal discovery domain\n", name);
485
486
		return -EINVAL;
	}
487
488
	if ((priority < TIPC_MIN_LINK_PRI ||
	     priority > TIPC_MAX_LINK_PRI) &&
489
490
	    (priority != TIPC_MEDIA_LINK_PRI)) {
		warn("Bearer <%s> rejected, illegal priority\n", name);
Per Liden's avatar
Per Liden committed
491
		return -EINVAL;
492
	}
Per Liden's avatar
Per Liden committed
493

494
	write_lock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
495
496
497

	m_ptr = media_find(b_name.media_name);
	if (!m_ptr) {
498
499
		warn("Bearer <%s> rejected, media <%s> not registered\n", name,
		     b_name.media_name);
500
		goto exit;
Per Liden's avatar
Per Liden committed
501
	}
502
503

	if (priority == TIPC_MEDIA_LINK_PRI)
Per Liden's avatar
Per Liden committed
504
505
506
507
508
509
		priority = m_ptr->priority;

restart:
	bearer_id = MAX_BEARERS;
	with_this_prio = 1;
	for (i = MAX_BEARERS; i-- != 0; ) {
510
		if (!tipc_bearers[i].active) {
Per Liden's avatar
Per Liden committed
511
512
513
			bearer_id = i;
			continue;
		}
514
		if (!strcmp(name, tipc_bearers[i].name)) {
515
			warn("Bearer <%s> rejected, already enabled\n", name);
516
			goto exit;
Per Liden's avatar
Per Liden committed
517
		}
518
		if ((tipc_bearers[i].priority == priority) &&
Per Liden's avatar
Per Liden committed
519
520
		    (++with_this_prio > 2)) {
			if (priority-- == 0) {
521
522
				warn("Bearer <%s> rejected, duplicate priority\n",
				     name);
523
				goto exit;
Per Liden's avatar
Per Liden committed
524
			}
525
			warn("Bearer <%s> priority adjustment required %u->%u\n",
Per Liden's avatar
Per Liden committed
526
527
528
529
530
			     name, priority + 1, priority);
			goto restart;
		}
	}
	if (bearer_id >= MAX_BEARERS) {
531
		warn("Bearer <%s> rejected, bearer limit reached (%u)\n",
532
		     name, MAX_BEARERS);
533
		goto exit;
Per Liden's avatar
Per Liden committed
534
535
	}

536
	b_ptr = &tipc_bearers[bearer_id];
537
538
	strcpy(b_ptr->name, name);
	res = m_ptr->enable_bearer(b_ptr);
Per Liden's avatar
Per Liden committed
539
	if (res) {
540
		warn("Bearer <%s> rejected, enable failure (%d)\n", name, -res);
541
		goto exit;
Per Liden's avatar
Per Liden committed
542
543
544
545
546
547
548
549
550
	}

	b_ptr->identity = bearer_id;
	b_ptr->media = m_ptr;
	b_ptr->net_plane = bearer_id + 'A';
	b_ptr->active = 1;
	b_ptr->priority = priority;
	INIT_LIST_HEAD(&b_ptr->cong_links);
	INIT_LIST_HEAD(&b_ptr->links);
551
	spin_lock_init(&b_ptr->lock);
552
553
554
555
556
557
558
559

	res = tipc_disc_create(b_ptr, &m_ptr->bcast_addr, disc_domain);
	if (res) {
		bearer_disable(b_ptr);
		warn("Bearer <%s> rejected, discovery object creation failed\n",
		     name);
		goto exit;
	}
560
	info("Enabled bearer <%s>, discovery domain %s, priority %u\n",
561
	     name, tipc_addr_string_fill(addr_string, disc_domain), priority);
562
exit:
563
	write_unlock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
564
565
566
567
568
569
570
571
572
573
	return res;
}

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

int tipc_block_bearer(const char *name)
{
574
	struct tipc_bearer *b_ptr = NULL;
Per Liden's avatar
Per Liden committed
575
576
577
	struct link *l_ptr;
	struct link *temp_l_ptr;

578
	read_lock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
579
580
581
	b_ptr = bearer_find(name);
	if (!b_ptr) {
		warn("Attempt to block unknown bearer <%s>\n", name);
582
		read_unlock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
583
584
585
		return -EINVAL;
	}

586
	info("Blocking bearer <%s>\n", name);
587
588
	spin_lock_bh(&b_ptr->lock);
	b_ptr->blocked = 1;
589
	list_splice_init(&b_ptr->cong_links, &b_ptr->links);
Per Liden's avatar
Per Liden committed
590
	list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) {
591
		struct tipc_node *n_ptr = l_ptr->owner;
Per Liden's avatar
Per Liden committed
592
593

		spin_lock_bh(&n_ptr->lock);
594
		tipc_link_reset(l_ptr);
Per Liden's avatar
Per Liden committed
595
596
		spin_unlock_bh(&n_ptr->lock);
	}
597
	spin_unlock_bh(&b_ptr->lock);
598
	read_unlock_bh(&tipc_net_lock);
599
	return 0;
Per Liden's avatar
Per Liden committed
600
601
602
603
}

/**
 * bearer_disable -
604
 *
605
 * Note: This routine assumes caller holds tipc_net_lock.
Per Liden's avatar
Per Liden committed
606
607
 */

608
static void bearer_disable(struct tipc_bearer *b_ptr)
Per Liden's avatar
Per Liden committed
609
610
611
612
{
	struct link *l_ptr;
	struct link *temp_l_ptr;

613
614
615
616
	info("Disabling bearer <%s>\n", b_ptr->name);
	spin_lock_bh(&b_ptr->lock);
	b_ptr->blocked = 1;
	b_ptr->media->disable_bearer(b_ptr);
617
	list_splice_init(&b_ptr->cong_links, &b_ptr->links);
Per Liden's avatar
Per Liden committed
618
	list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) {
619
		tipc_link_delete(l_ptr);
Per Liden's avatar
Per Liden committed
620
	}
621
622
	if (b_ptr->link_req)
		tipc_disc_delete(b_ptr->link_req);
623
624
	spin_unlock_bh(&b_ptr->lock);
	memset(b_ptr, 0, sizeof(struct tipc_bearer));
Per Liden's avatar
Per Liden committed
625
626
627
628
}

int tipc_disable_bearer(const char *name)
{
629
	struct tipc_bearer *b_ptr;
Per Liden's avatar
Per Liden committed
630
631
	int res;

632
	write_lock_bh(&tipc_net_lock);
633
634
635
636
	b_ptr = bearer_find(name);
	if (b_ptr == NULL) {
		warn("Attempt to disable unknown bearer <%s>\n", name);
		res = -EINVAL;
637
638
639
640
	} else {
		bearer_disable(b_ptr);
		res = 0;
	}
641
	write_unlock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
642
643
644
645
646
	return res;
}



647
void tipc_bearer_stop(void)
Per Liden's avatar
Per Liden committed
648
649
650
651
{
	u32 i;

	for (i = 0; i < MAX_BEARERS; i++) {
652
		if (tipc_bearers[i].active)
653
			bearer_disable(&tipc_bearers[i]);
Per Liden's avatar
Per Liden committed
654
655
656
	}
	media_count = 0;
}