blob: 52ae17b2583e3457c77652a9f842ed2aba237916 [file] [log] [blame]
Per Lidenb97bf3f2006-01-02 19:04:38 +01001/*
2 * net/tipc/bearer.c: TIPC bearer code
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +09003 *
Per Liden593a5f22006-01-11 19:14:19 +01004 * Copyright (c) 1996-2006, Ericsson AB
Allan Stephense91ed0b2006-10-16 21:44:59 -07005 * Copyright (c) 2004-2006, Wind River Systems
Per Lidenb97bf3f2006-01-02 19:04:38 +01006 * All rights reserved.
7 *
Per Liden9ea1fd32006-01-11 13:30:43 +01008 * Redistribution and use in source and binary forms, with or without
Per Lidenb97bf3f2006-01-02 19:04:38 +01009 * modification, are permitted provided that the following conditions are met:
10 *
Per Liden9ea1fd32006-01-11 13:30:43 +010011 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
Per Lidenb97bf3f2006-01-02 19:04:38 +010019 *
Per Liden9ea1fd32006-01-11 13:30:43 +010020 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
Per Lidenb97bf3f2006-01-02 19:04:38 +010034 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
38#include "config.h"
39#include "dbg.h"
40#include "bearer.h"
41#include "link.h"
42#include "port.h"
43#include "discover.h"
44#include "bcast.h"
45
46#define MAX_ADDR_STR 32
47
Neil Hormand0021b22010-03-03 08:31:23 +000048static struct media media_list[MAX_MEDIA];
Per Lidenb97bf3f2006-01-02 19:04:38 +010049static u32 media_count = 0;
50
Neil Hormand0021b22010-03-03 08:31:23 +000051struct bearer tipc_bearers[MAX_BEARERS];
Per Lidenb97bf3f2006-01-02 19:04:38 +010052
53/**
54 * media_name_valid - validate media name
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090055 *
Per Lidenb97bf3f2006-01-02 19:04:38 +010056 * Returns 1 if media name is valid, otherwise 0.
57 */
58
59static int media_name_valid(const char *name)
60{
61 u32 len;
62
63 len = strlen(name);
64 if ((len + 1) > TIPC_MAX_MEDIA_NAME)
65 return 0;
66 return (strspn(name, tipc_alphabet) == len);
67}
68
69/**
70 * media_find - locates specified media object by name
71 */
72
73static struct media *media_find(const char *name)
74{
75 struct media *m_ptr;
76 u32 i;
77
78 for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
79 if (!strcmp(m_ptr->name, name))
80 return m_ptr;
81 }
Sam Ravnborg1fc54d82006-03-20 22:36:47 -080082 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +010083}
84
85/**
86 * tipc_register_media - register a media type
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090087 *
Per Lidenb97bf3f2006-01-02 19:04:38 +010088 * Bearers for this media type must be activated separately at a later stage.
89 */
90
91int tipc_register_media(u32 media_type,
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090092 char *name,
93 int (*enable)(struct tipc_bearer *),
94 void (*disable)(struct tipc_bearer *),
95 int (*send_msg)(struct sk_buff *,
Per Lidenb97bf3f2006-01-02 19:04:38 +010096 struct tipc_bearer *,
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090097 struct tipc_media_addr *),
Per Lidenb97bf3f2006-01-02 19:04:38 +010098 char *(*addr2str)(struct tipc_media_addr *a,
99 char *str_buf, int str_size),
100 struct tipc_media_addr *bcast_addr,
101 const u32 bearer_priority,
102 const u32 link_tolerance, /* [ms] */
103 const u32 send_window_limit)
104{
105 struct media *m_ptr;
106 u32 media_id;
107 u32 i;
108 int res = -EINVAL;
109
Per Liden4323add2006-01-18 00:38:21 +0100110 write_lock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100111
Neil Hormand0021b22010-03-03 08:31:23 +0000112 if (tipc_mode != TIPC_NET_MODE) {
113 warn("Media <%s> rejected, not in networked mode yet\n", name);
114 goto exit;
115 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100116 if (!media_name_valid(name)) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700117 warn("Media <%s> rejected, illegal name\n", name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100118 goto exit;
119 }
120 if (!bcast_addr) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700121 warn("Media <%s> rejected, no broadcast address\n", name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100122 goto exit;
123 }
roel kluinb3df9a52009-08-27 02:03:15 +0000124 if ((bearer_priority < TIPC_MIN_LINK_PRI) ||
Per Liden16cb4b32006-01-13 22:22:22 +0100125 (bearer_priority > TIPC_MAX_LINK_PRI)) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900126 warn("Media <%s> rejected, illegal priority (%u)\n", name,
Allan Stephensa10bd922006-06-25 23:52:17 -0700127 bearer_priority);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100128 goto exit;
129 }
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900130 if ((link_tolerance < TIPC_MIN_LINK_TOL) ||
Per Lidenb97bf3f2006-01-02 19:04:38 +0100131 (link_tolerance > TIPC_MAX_LINK_TOL)) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700132 warn("Media <%s> rejected, illegal tolerance (%u)\n", name,
133 link_tolerance);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100134 goto exit;
135 }
136
137 media_id = media_count++;
138 if (media_id >= MAX_MEDIA) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700139 warn("Media <%s> rejected, media limit reached (%u)\n", name,
140 MAX_MEDIA);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100141 media_count--;
142 goto exit;
143 }
144 for (i = 0; i < media_id; i++) {
145 if (media_list[i].type_id == media_type) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700146 warn("Media <%s> rejected, duplicate type (%u)\n", name,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100147 media_type);
148 media_count--;
149 goto exit;
150 }
151 if (!strcmp(name, media_list[i].name)) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700152 warn("Media <%s> rejected, duplicate name\n", name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100153 media_count--;
154 goto exit;
155 }
156 }
157
158 m_ptr = &media_list[media_id];
159 m_ptr->type_id = media_type;
160 m_ptr->send_msg = send_msg;
161 m_ptr->enable_bearer = enable;
162 m_ptr->disable_bearer = disable;
163 m_ptr->addr2str = addr2str;
164 memcpy(&m_ptr->bcast_addr, bcast_addr, sizeof(*bcast_addr));
165 m_ptr->bcast = 1;
166 strcpy(m_ptr->name, name);
167 m_ptr->priority = bearer_priority;
168 m_ptr->tolerance = link_tolerance;
169 m_ptr->window = send_window_limit;
170 dbg("Media <%s> registered\n", name);
171 res = 0;
172exit:
Per Liden4323add2006-01-18 00:38:21 +0100173 write_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100174 return res;
175}
176
177/**
Per Liden4323add2006-01-18 00:38:21 +0100178 * tipc_media_addr_printf - record media address in print buffer
Per Lidenb97bf3f2006-01-02 19:04:38 +0100179 */
180
Per Liden4323add2006-01-18 00:38:21 +0100181void tipc_media_addr_printf(struct print_buf *pb, struct tipc_media_addr *a)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100182{
183 struct media *m_ptr;
184 u32 media_type;
185 u32 i;
186
187 media_type = ntohl(a->type);
188 for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
189 if (m_ptr->type_id == media_type)
190 break;
191 }
192
193 if ((i < media_count) && (m_ptr->addr2str != NULL)) {
194 char addr_str[MAX_ADDR_STR];
195
Allan Stephense91ed0b2006-10-16 21:44:59 -0700196 tipc_printf(pb, "%s(%s)", m_ptr->name,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100197 m_ptr->addr2str(a, addr_str, sizeof(addr_str)));
198 } else {
199 unchar *addr = (unchar *)&a->dev_addr;
200
Allan Stephense91ed0b2006-10-16 21:44:59 -0700201 tipc_printf(pb, "UNKNOWN(%u)", media_type);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100202 for (i = 0; i < (sizeof(*a) - sizeof(a->type)); i++) {
Allan Stephense91ed0b2006-10-16 21:44:59 -0700203 tipc_printf(pb, "-%02x", addr[i]);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100204 }
205 }
206}
207
208/**
Per Liden4323add2006-01-18 00:38:21 +0100209 * tipc_media_get_names - record names of registered media in buffer
Per Lidenb97bf3f2006-01-02 19:04:38 +0100210 */
211
Per Liden4323add2006-01-18 00:38:21 +0100212struct sk_buff *tipc_media_get_names(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100213{
214 struct sk_buff *buf;
215 struct media *m_ptr;
216 int i;
217
Per Liden4323add2006-01-18 00:38:21 +0100218 buf = tipc_cfg_reply_alloc(MAX_MEDIA * TLV_SPACE(TIPC_MAX_MEDIA_NAME));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100219 if (!buf)
220 return NULL;
221
Per Liden4323add2006-01-18 00:38:21 +0100222 read_lock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100223 for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900224 tipc_cfg_append_tlv(buf, TIPC_TLV_MEDIA_NAME, m_ptr->name,
Per Liden4323add2006-01-18 00:38:21 +0100225 strlen(m_ptr->name) + 1);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100226 }
Per Liden4323add2006-01-18 00:38:21 +0100227 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100228 return buf;
229}
230
231/**
232 * bearer_name_validate - validate & (optionally) deconstruct bearer name
233 * @name - ptr to bearer name string
234 * @name_parts - ptr to area for bearer name components (or NULL if not needed)
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900235 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100236 * Returns 1 if bearer name is valid, otherwise 0.
237 */
238
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900239static int bearer_name_validate(const char *name,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100240 struct bearer_name *name_parts)
241{
242 char name_copy[TIPC_MAX_BEARER_NAME];
243 char *media_name;
244 char *if_name;
245 u32 media_len;
246 u32 if_len;
247
248 /* copy bearer name & ensure length is OK */
249
250 name_copy[TIPC_MAX_BEARER_NAME - 1] = 0;
251 /* need above in case non-Posix strncpy() doesn't pad with nulls */
252 strncpy(name_copy, name, TIPC_MAX_BEARER_NAME);
253 if (name_copy[TIPC_MAX_BEARER_NAME - 1] != 0)
254 return 0;
255
256 /* ensure all component parts of bearer name are present */
257
258 media_name = name_copy;
259 if ((if_name = strchr(media_name, ':')) == NULL)
260 return 0;
261 *(if_name++) = 0;
262 media_len = if_name - media_name;
263 if_len = strlen(if_name) + 1;
264
265 /* validate component parts of bearer name */
266
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900267 if ((media_len <= 1) || (media_len > TIPC_MAX_MEDIA_NAME) ||
268 (if_len <= 1) || (if_len > TIPC_MAX_IF_NAME) ||
Per Lidenb97bf3f2006-01-02 19:04:38 +0100269 (strspn(media_name, tipc_alphabet) != (media_len - 1)) ||
270 (strspn(if_name, tipc_alphabet) != (if_len - 1)))
271 return 0;
272
273 /* return bearer name components, if necessary */
274
275 if (name_parts) {
276 strcpy(name_parts->media_name, media_name);
277 strcpy(name_parts->if_name, if_name);
278 }
279 return 1;
280}
281
282/**
283 * bearer_find - locates bearer object with matching bearer name
284 */
285
286static struct bearer *bearer_find(const char *name)
287{
288 struct bearer *b_ptr;
289 u32 i;
290
Allan Stephensa10bd922006-06-25 23:52:17 -0700291 if (tipc_mode != TIPC_NET_MODE)
292 return NULL;
293
Per Liden4323add2006-01-18 00:38:21 +0100294 for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100295 if (b_ptr->active && (!strcmp(b_ptr->publ.name, name)))
296 return b_ptr;
297 }
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800298 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100299}
300
301/**
Per Liden4323add2006-01-18 00:38:21 +0100302 * tipc_bearer_find_interface - locates bearer object with matching interface name
Per Lidenb97bf3f2006-01-02 19:04:38 +0100303 */
304
Per Liden4323add2006-01-18 00:38:21 +0100305struct bearer *tipc_bearer_find_interface(const char *if_name)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100306{
307 struct bearer *b_ptr;
308 char *b_if_name;
309 u32 i;
310
Per Liden4323add2006-01-18 00:38:21 +0100311 for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100312 if (!b_ptr->active)
313 continue;
314 b_if_name = strchr(b_ptr->publ.name, ':') + 1;
315 if (!strcmp(b_if_name, if_name))
316 return b_ptr;
317 }
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800318 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100319}
320
321/**
Per Liden4323add2006-01-18 00:38:21 +0100322 * tipc_bearer_get_names - record names of bearers in buffer
Per Lidenb97bf3f2006-01-02 19:04:38 +0100323 */
324
Per Liden4323add2006-01-18 00:38:21 +0100325struct sk_buff *tipc_bearer_get_names(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100326{
327 struct sk_buff *buf;
328 struct media *m_ptr;
329 struct bearer *b_ptr;
330 int i, j;
331
Per Liden4323add2006-01-18 00:38:21 +0100332 buf = tipc_cfg_reply_alloc(MAX_BEARERS * TLV_SPACE(TIPC_MAX_BEARER_NAME));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100333 if (!buf)
334 return NULL;
335
Per Liden4323add2006-01-18 00:38:21 +0100336 read_lock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100337 for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
338 for (j = 0; j < MAX_BEARERS; j++) {
Per Liden4323add2006-01-18 00:38:21 +0100339 b_ptr = &tipc_bearers[j];
Per Lidenb97bf3f2006-01-02 19:04:38 +0100340 if (b_ptr->active && (b_ptr->media == m_ptr)) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900341 tipc_cfg_append_tlv(buf, TIPC_TLV_BEARER_NAME,
342 b_ptr->publ.name,
Per Liden4323add2006-01-18 00:38:21 +0100343 strlen(b_ptr->publ.name) + 1);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100344 }
345 }
346 }
Per Liden4323add2006-01-18 00:38:21 +0100347 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100348 return buf;
349}
350
Per Liden4323add2006-01-18 00:38:21 +0100351void tipc_bearer_add_dest(struct bearer *b_ptr, u32 dest)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100352{
Per Liden4323add2006-01-18 00:38:21 +0100353 tipc_nmap_add(&b_ptr->nodes, dest);
354 tipc_disc_update_link_req(b_ptr->link_req);
355 tipc_bcbearer_sort();
Per Lidenb97bf3f2006-01-02 19:04:38 +0100356}
357
Per Liden4323add2006-01-18 00:38:21 +0100358void tipc_bearer_remove_dest(struct bearer *b_ptr, u32 dest)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100359{
Per Liden4323add2006-01-18 00:38:21 +0100360 tipc_nmap_remove(&b_ptr->nodes, dest);
361 tipc_disc_update_link_req(b_ptr->link_req);
362 tipc_bcbearer_sort();
Per Lidenb97bf3f2006-01-02 19:04:38 +0100363}
364
365/*
366 * bearer_push(): Resolve bearer congestion. Force the waiting
367 * links to push out their unsent packets, one packet per link
368 * per iteration, until all packets are gone or congestion reoccurs.
Per Liden4323add2006-01-18 00:38:21 +0100369 * 'tipc_net_lock' is read_locked when this function is called
Per Lidenb97bf3f2006-01-02 19:04:38 +0100370 * bearer.lock must be taken before calling
371 * Returns binary true(1) ore false(0)
372 */
373static int bearer_push(struct bearer *b_ptr)
374{
Allan Stephens0e35fd52008-07-14 22:44:01 -0700375 u32 res = 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100376 struct link *ln, *tln;
377
378 if (b_ptr->publ.blocked)
379 return 0;
380
381 while (!list_empty(&b_ptr->cong_links) && (res != PUSH_FAILED)) {
382 list_for_each_entry_safe(ln, tln, &b_ptr->cong_links, link_list) {
Per Liden4323add2006-01-18 00:38:21 +0100383 res = tipc_link_push_packet(ln);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100384 if (res == PUSH_FAILED)
385 break;
386 if (res == PUSH_FINISHED)
387 list_move_tail(&ln->link_list, &b_ptr->links);
388 }
389 }
390 return list_empty(&b_ptr->cong_links);
391}
392
Per Liden4323add2006-01-18 00:38:21 +0100393void tipc_bearer_lock_push(struct bearer *b_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100394{
395 int res;
396
397 spin_lock_bh(&b_ptr->publ.lock);
398 res = bearer_push(b_ptr);
399 spin_unlock_bh(&b_ptr->publ.lock);
400 if (res)
Per Liden4323add2006-01-18 00:38:21 +0100401 tipc_bcbearer_push();
Per Lidenb97bf3f2006-01-02 19:04:38 +0100402}
403
404
405/*
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900406 * Interrupt enabling new requests after bearer congestion or blocking:
407 * See bearer_send().
Per Lidenb97bf3f2006-01-02 19:04:38 +0100408 */
409void tipc_continue(struct tipc_bearer *tb_ptr)
410{
411 struct bearer *b_ptr = (struct bearer *)tb_ptr;
412
413 spin_lock_bh(&b_ptr->publ.lock);
414 b_ptr->continue_count++;
415 if (!list_empty(&b_ptr->cong_links))
Per Liden4323add2006-01-18 00:38:21 +0100416 tipc_k_signal((Handler)tipc_bearer_lock_push, (unsigned long)b_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100417 b_ptr->publ.blocked = 0;
418 spin_unlock_bh(&b_ptr->publ.lock);
419}
420
421/*
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900422 * Schedule link for sending of messages after the bearer
423 * has been deblocked by 'continue()'. This method is called
424 * when somebody tries to send a message via this link while
Per Liden4323add2006-01-18 00:38:21 +0100425 * the bearer is congested. 'tipc_net_lock' is in read_lock here
Per Lidenb97bf3f2006-01-02 19:04:38 +0100426 * bearer.lock is busy
427 */
428
Per Liden4323add2006-01-18 00:38:21 +0100429static void tipc_bearer_schedule_unlocked(struct bearer *b_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100430{
431 list_move_tail(&l_ptr->link_list, &b_ptr->cong_links);
432}
433
434/*
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900435 * Schedule link for sending of messages after the bearer
436 * has been deblocked by 'continue()'. This method is called
437 * when somebody tries to send a message via this link while
Per Liden4323add2006-01-18 00:38:21 +0100438 * the bearer is congested. 'tipc_net_lock' is in read_lock here,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100439 * bearer.lock is free
440 */
441
Per Liden4323add2006-01-18 00:38:21 +0100442void tipc_bearer_schedule(struct bearer *b_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100443{
444 spin_lock_bh(&b_ptr->publ.lock);
Per Liden4323add2006-01-18 00:38:21 +0100445 tipc_bearer_schedule_unlocked(b_ptr, l_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100446 spin_unlock_bh(&b_ptr->publ.lock);
447}
448
449
450/*
Per Liden4323add2006-01-18 00:38:21 +0100451 * tipc_bearer_resolve_congestion(): Check if there is bearer congestion,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100452 * and if there is, try to resolve it before returning.
Per Liden4323add2006-01-18 00:38:21 +0100453 * 'tipc_net_lock' is read_locked when this function is called
Per Lidenb97bf3f2006-01-02 19:04:38 +0100454 */
Per Liden4323add2006-01-18 00:38:21 +0100455int tipc_bearer_resolve_congestion(struct bearer *b_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100456{
457 int res = 1;
458
459 if (list_empty(&b_ptr->cong_links))
460 return 1;
461 spin_lock_bh(&b_ptr->publ.lock);
462 if (!bearer_push(b_ptr)) {
Per Liden4323add2006-01-18 00:38:21 +0100463 tipc_bearer_schedule_unlocked(b_ptr, l_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100464 res = 0;
465 }
466 spin_unlock_bh(&b_ptr->publ.lock);
467 return res;
468}
469
Allan Stephensb274f4a2010-05-11 14:30:16 +0000470/**
471 * tipc_bearer_congested - determines if bearer is currently congested
472 */
473
474int tipc_bearer_congested(struct bearer *b_ptr, struct link *l_ptr)
475{
476 if (unlikely(b_ptr->publ.blocked))
477 return 1;
478 if (likely(list_empty(&b_ptr->cong_links)))
479 return 0;
480 return !tipc_bearer_resolve_congestion(b_ptr, l_ptr);
481}
Per Lidenb97bf3f2006-01-02 19:04:38 +0100482
483/**
484 * tipc_enable_bearer - enable bearer with the given name
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900485 */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100486
487int tipc_enable_bearer(const char *name, u32 bcast_scope, u32 priority)
488{
489 struct bearer *b_ptr;
490 struct media *m_ptr;
491 struct bearer_name b_name;
492 char addr_string[16];
493 u32 bearer_id;
494 u32 with_this_prio;
495 u32 i;
496 int res = -EINVAL;
497
Allan Stephensa10bd922006-06-25 23:52:17 -0700498 if (tipc_mode != TIPC_NET_MODE) {
499 warn("Bearer <%s> rejected, not supported in standalone mode\n",
500 name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100501 return -ENOPROTOOPT;
Allan Stephensa10bd922006-06-25 23:52:17 -0700502 }
503 if (!bearer_name_validate(name, &b_name)) {
504 warn("Bearer <%s> rejected, illegal name\n", name);
Per Liden16cb4b32006-01-13 22:22:22 +0100505 return -EINVAL;
Allan Stephensa10bd922006-06-25 23:52:17 -0700506 }
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900507 if (!tipc_addr_domain_valid(bcast_scope) ||
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000508 !tipc_in_scope(bcast_scope, tipc_own_addr)) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700509 warn("Bearer <%s> rejected, illegal broadcast scope\n", name);
510 return -EINVAL;
511 }
Per Liden16cb4b32006-01-13 22:22:22 +0100512 if ((priority < TIPC_MIN_LINK_PRI ||
513 priority > TIPC_MAX_LINK_PRI) &&
Allan Stephensa10bd922006-06-25 23:52:17 -0700514 (priority != TIPC_MEDIA_LINK_PRI)) {
515 warn("Bearer <%s> rejected, illegal priority\n", name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100516 return -EINVAL;
Allan Stephensa10bd922006-06-25 23:52:17 -0700517 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100518
Per Liden4323add2006-01-18 00:38:21 +0100519 write_lock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100520
521 m_ptr = media_find(b_name.media_name);
522 if (!m_ptr) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700523 warn("Bearer <%s> rejected, media <%s> not registered\n", name,
524 b_name.media_name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100525 goto failed;
526 }
Per Liden16cb4b32006-01-13 22:22:22 +0100527
528 if (priority == TIPC_MEDIA_LINK_PRI)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100529 priority = m_ptr->priority;
530
531restart:
532 bearer_id = MAX_BEARERS;
533 with_this_prio = 1;
534 for (i = MAX_BEARERS; i-- != 0; ) {
Per Liden4323add2006-01-18 00:38:21 +0100535 if (!tipc_bearers[i].active) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100536 bearer_id = i;
537 continue;
538 }
Per Liden4323add2006-01-18 00:38:21 +0100539 if (!strcmp(name, tipc_bearers[i].publ.name)) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700540 warn("Bearer <%s> rejected, already enabled\n", name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100541 goto failed;
542 }
Per Liden4323add2006-01-18 00:38:21 +0100543 if ((tipc_bearers[i].priority == priority) &&
Per Lidenb97bf3f2006-01-02 19:04:38 +0100544 (++with_this_prio > 2)) {
545 if (priority-- == 0) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700546 warn("Bearer <%s> rejected, duplicate priority\n",
547 name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100548 goto failed;
549 }
Allan Stephensa10bd922006-06-25 23:52:17 -0700550 warn("Bearer <%s> priority adjustment required %u->%u\n",
Per Lidenb97bf3f2006-01-02 19:04:38 +0100551 name, priority + 1, priority);
552 goto restart;
553 }
554 }
555 if (bearer_id >= MAX_BEARERS) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900556 warn("Bearer <%s> rejected, bearer limit reached (%u)\n",
Allan Stephensa10bd922006-06-25 23:52:17 -0700557 name, MAX_BEARERS);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100558 goto failed;
559 }
560
Per Liden4323add2006-01-18 00:38:21 +0100561 b_ptr = &tipc_bearers[bearer_id];
Per Lidenb97bf3f2006-01-02 19:04:38 +0100562 memset(b_ptr, 0, sizeof(struct bearer));
563
564 strcpy(b_ptr->publ.name, name);
565 res = m_ptr->enable_bearer(&b_ptr->publ);
566 if (res) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700567 warn("Bearer <%s> rejected, enable failure (%d)\n", name, -res);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100568 goto failed;
569 }
570
571 b_ptr->identity = bearer_id;
572 b_ptr->media = m_ptr;
573 b_ptr->net_plane = bearer_id + 'A';
574 b_ptr->active = 1;
575 b_ptr->detect_scope = bcast_scope;
576 b_ptr->priority = priority;
577 INIT_LIST_HEAD(&b_ptr->cong_links);
578 INIT_LIST_HEAD(&b_ptr->links);
579 if (m_ptr->bcast) {
Per Liden4323add2006-01-18 00:38:21 +0100580 b_ptr->link_req = tipc_disc_init_link_req(b_ptr, &m_ptr->bcast_addr,
581 bcast_scope, 2);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100582 }
Ingo Molnar34af9462006-06-27 02:53:55 -0700583 spin_lock_init(&b_ptr->publ.lock);
Per Liden4323add2006-01-18 00:38:21 +0100584 write_unlock_bh(&tipc_net_lock);
Per Liden16cb4b32006-01-13 22:22:22 +0100585 info("Enabled bearer <%s>, discovery domain %s, priority %u\n",
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000586 name, tipc_addr_string_fill(addr_string, bcast_scope), priority);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100587 return 0;
588failed:
Per Liden4323add2006-01-18 00:38:21 +0100589 write_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100590 return res;
591}
592
593/**
594 * tipc_block_bearer(): Block the bearer with the given name,
595 * and reset all its links
596 */
597
598int tipc_block_bearer(const char *name)
599{
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800600 struct bearer *b_ptr = NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100601 struct link *l_ptr;
602 struct link *temp_l_ptr;
603
Per Liden4323add2006-01-18 00:38:21 +0100604 read_lock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100605 b_ptr = bearer_find(name);
606 if (!b_ptr) {
607 warn("Attempt to block unknown bearer <%s>\n", name);
Per Liden4323add2006-01-18 00:38:21 +0100608 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100609 return -EINVAL;
610 }
611
Allan Stephensa10bd922006-06-25 23:52:17 -0700612 info("Blocking bearer <%s>\n", name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100613 spin_lock_bh(&b_ptr->publ.lock);
614 b_ptr->publ.blocked = 1;
615 list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) {
David S. Miller6c000552008-09-02 23:38:32 -0700616 struct tipc_node *n_ptr = l_ptr->owner;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100617
618 spin_lock_bh(&n_ptr->lock);
Per Liden4323add2006-01-18 00:38:21 +0100619 tipc_link_reset(l_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100620 spin_unlock_bh(&n_ptr->lock);
621 }
622 spin_unlock_bh(&b_ptr->publ.lock);
Per Liden4323add2006-01-18 00:38:21 +0100623 read_unlock_bh(&tipc_net_lock);
Allan Stephens0e35fd52008-07-14 22:44:01 -0700624 return 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100625}
626
627/**
628 * bearer_disable -
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900629 *
Per Liden4323add2006-01-18 00:38:21 +0100630 * Note: This routine assumes caller holds tipc_net_lock.
Per Lidenb97bf3f2006-01-02 19:04:38 +0100631 */
632
633static int bearer_disable(const char *name)
634{
635 struct bearer *b_ptr;
636 struct link *l_ptr;
637 struct link *temp_l_ptr;
638
Per Lidenb97bf3f2006-01-02 19:04:38 +0100639 b_ptr = bearer_find(name);
640 if (!b_ptr) {
641 warn("Attempt to disable unknown bearer <%s>\n", name);
642 return -EINVAL;
643 }
644
Allan Stephensa10bd922006-06-25 23:52:17 -0700645 info("Disabling bearer <%s>\n", name);
Per Liden4323add2006-01-18 00:38:21 +0100646 tipc_disc_stop_link_req(b_ptr->link_req);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100647 spin_lock_bh(&b_ptr->publ.lock);
648 b_ptr->link_req = NULL;
649 b_ptr->publ.blocked = 1;
650 if (b_ptr->media->disable_bearer) {
651 spin_unlock_bh(&b_ptr->publ.lock);
Per Liden4323add2006-01-18 00:38:21 +0100652 write_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100653 b_ptr->media->disable_bearer(&b_ptr->publ);
Per Liden4323add2006-01-18 00:38:21 +0100654 write_lock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100655 spin_lock_bh(&b_ptr->publ.lock);
656 }
657 list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) {
Per Liden4323add2006-01-18 00:38:21 +0100658 tipc_link_delete(l_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100659 }
660 spin_unlock_bh(&b_ptr->publ.lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100661 memset(b_ptr, 0, sizeof(struct bearer));
Allan Stephens0e35fd52008-07-14 22:44:01 -0700662 return 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100663}
664
665int tipc_disable_bearer(const char *name)
666{
667 int res;
668
Per Liden4323add2006-01-18 00:38:21 +0100669 write_lock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100670 res = bearer_disable(name);
Per Liden4323add2006-01-18 00:38:21 +0100671 write_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100672 return res;
673}
674
675
676
Per Liden4323add2006-01-18 00:38:21 +0100677void tipc_bearer_stop(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100678{
679 u32 i;
680
Per Lidenb97bf3f2006-01-02 19:04:38 +0100681 for (i = 0; i < MAX_BEARERS; i++) {
Per Liden4323add2006-01-18 00:38:21 +0100682 if (tipc_bearers[i].active)
683 tipc_bearers[i].publ.blocked = 1;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100684 }
685 for (i = 0; i < MAX_BEARERS; i++) {
Per Liden4323add2006-01-18 00:38:21 +0100686 if (tipc_bearers[i].active)
687 bearer_disable(tipc_bearers[i].publ.name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100688 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100689 media_count = 0;
690}
691
692