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
}

/**
 * tipc_register_media - register a media type
85
 *
Per Liden's avatar
Per Liden committed
86
87
88
 * Bearers for this media type must be activated separately at a later stage.
 */

89
int  tipc_register_media(struct media *m_ptr)
Per Liden's avatar
Per Liden committed
90
91
92
93
94
{
	u32 media_id;
	u32 i;
	int res = -EINVAL;

95
	write_lock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
96

97
	if (tipc_mode != TIPC_NET_MODE) {
98
99
		warn("Media <%s> rejected, not in networked mode yet\n",
		     m_ptr->name);
100
101
		goto exit;
	}
102
103
	if (!media_name_valid(m_ptr->name)) {
		warn("Media <%s> rejected, illegal name\n", m_ptr->name);
Per Liden's avatar
Per Liden committed
104
105
		goto exit;
	}
106
107
108
	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
109
110
		goto exit;
	}
111
112
113
114
	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
115
116
		goto exit;
	}
117
118
119
120
	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
121
122
123
124
125
		goto exit;
	}

	media_id = media_count++;
	if (media_id >= MAX_MEDIA) {
126
127
		warn("Media <%s> rejected, media limit reached (%u)\n",
		     m_ptr->name, MAX_MEDIA);
Per Liden's avatar
Per Liden committed
128
129
130
131
		media_count--;
		goto exit;
	}
	for (i = 0; i < media_id; i++) {
132
133
134
		if (media_list[i].type_id == m_ptr->type_id) {
			warn("Media <%s> rejected, duplicate type (%u)\n",
			     m_ptr->name, m_ptr->type_id);
Per Liden's avatar
Per Liden committed
135
136
137
			media_count--;
			goto exit;
		}
138
139
140
		if (!strcmp(m_ptr->name, media_list[i].name)) {
			warn("Media <%s> rejected, duplicate name\n",
			     m_ptr->name);
Per Liden's avatar
Per Liden committed
141
142
143
144
145
			media_count--;
			goto exit;
		}
	}

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

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

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

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

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

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

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

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

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

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

	/* validate component parts of bearer name */

243
244
	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
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
	    (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
 */

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

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

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

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

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

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

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

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

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

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

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

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

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

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


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

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

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

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

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


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

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

436
437
438
439
/**
 * tipc_bearer_congested - determines if bearer is currently congested
 */

440
int tipc_bearer_congested(struct tipc_bearer *b_ptr, struct link *l_ptr)
441
{
442
	if (unlikely(b_ptr->blocked))
443
444
445
446
447
		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
448
449
450

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

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

464
465
466
	if (tipc_mode != TIPC_NET_MODE) {
		warn("Bearer <%s> rejected, not supported in standalone mode\n",
		     name);
Per Liden's avatar
Per Liden committed
467
		return -ENOPROTOOPT;
468
469
470
	}
	if (!bearer_name_validate(name, &b_name)) {
		warn("Bearer <%s> rejected, illegal name\n", name);
471
		return -EINVAL;
472
	}
473
474
475
476
477
478
479
480
481
	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) {
482
		warn("Bearer <%s> rejected, illegal discovery domain\n", name);
483
484
		return -EINVAL;
	}
485
486
	if ((priority < TIPC_MIN_LINK_PRI ||
	     priority > TIPC_MAX_LINK_PRI) &&
487
488
	    (priority != TIPC_MEDIA_LINK_PRI)) {
		warn("Bearer <%s> rejected, illegal priority\n", name);
Per Liden's avatar
Per Liden committed
489
		return -EINVAL;
490
	}
Per Liden's avatar
Per Liden committed
491

492
	write_lock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
493
494
495

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

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

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

	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);
549
	spin_lock_init(&b_ptr->lock);
550
551
552
553
554
555
556
557

	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;
	}
558
	info("Enabled bearer <%s>, discovery domain %s, priority %u\n",
559
	     name, tipc_addr_string_fill(addr_string, disc_domain), priority);
560
exit:
561
	write_unlock_bh(&tipc_net_lock);
Per Liden's avatar
Per Liden committed
562
563
564
565
566
567
568
569
570
571
	return res;
}

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

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

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

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

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

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

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

611
612
613
614
	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);
615
	list_splice_init(&b_ptr->cong_links, &b_ptr->links);
Per Liden's avatar
Per Liden committed
616
	list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) {
617
		tipc_link_delete(l_ptr);
Per Liden's avatar
Per Liden committed
618
	}
619
620
	if (b_ptr->link_req)
		tipc_disc_delete(b_ptr->link_req);
621
622
	spin_unlock_bh(&b_ptr->lock);
	memset(b_ptr, 0, sizeof(struct tipc_bearer));
Per Liden's avatar
Per Liden committed
623
624
625
626
}

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

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



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

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