Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/bearer.c: TIPC bearer code | |
c4307285 | 3 | * |
593a5f22 | 4 | * Copyright (c) 1996-2006, Ericsson AB |
2d627b92 | 5 | * Copyright (c) 2004-2006, 2010-2011, Wind River Systems |
b97bf3fd PL |
6 | * All rights reserved. |
7 | * | |
9ea1fd3c | 8 | * Redistribution and use in source and binary forms, with or without |
b97bf3fd PL |
9 | * modification, are permitted provided that the following conditions are met: |
10 | * | |
9ea1fd3c PL |
11 | * 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. | |
b97bf3fd | 19 | * |
9ea1fd3c PL |
20 | * 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 | |
b97bf3fd PL |
34 | * POSSIBILITY OF SUCH DAMAGE. |
35 | */ | |
36 | ||
37 | #include "core.h" | |
38 | #include "config.h" | |
b97bf3fd | 39 | #include "bearer.h" |
b97bf3fd | 40 | #include "discover.h" |
b97bf3fd PL |
41 | |
42 | #define MAX_ADDR_STR 32 | |
43 | ||
358a0d1c | 44 | static struct tipc_media *media_list[MAX_MEDIA]; |
e3ec9c7d | 45 | static u32 media_count; |
b97bf3fd | 46 | |
2d627b92 | 47 | struct tipc_bearer tipc_bearers[MAX_BEARERS]; |
b97bf3fd | 48 | |
3a777ff8 AS |
49 | static void bearer_disable(struct tipc_bearer *b_ptr); |
50 | ||
b97bf3fd | 51 | /** |
5c216e1d | 52 | * tipc_media_find - locates specified media object by name |
b97bf3fd | 53 | */ |
358a0d1c | 54 | struct tipc_media *tipc_media_find(const char *name) |
b97bf3fd | 55 | { |
b97bf3fd PL |
56 | u32 i; |
57 | ||
a31abe8d AS |
58 | for (i = 0; i < media_count; i++) { |
59 | if (!strcmp(media_list[i]->name, name)) | |
60 | return media_list[i]; | |
b97bf3fd | 61 | } |
1fc54d8f | 62 | return NULL; |
b97bf3fd PL |
63 | } |
64 | ||
c79be454 AS |
65 | /** |
66 | * media_find_id - locates specified media object by type identifier | |
67 | */ | |
358a0d1c | 68 | static struct tipc_media *media_find_id(u8 type) |
c79be454 AS |
69 | { |
70 | u32 i; | |
71 | ||
72 | for (i = 0; i < media_count; i++) { | |
a31abe8d AS |
73 | if (media_list[i]->type_id == type) |
74 | return media_list[i]; | |
c79be454 AS |
75 | } |
76 | return NULL; | |
77 | } | |
78 | ||
b97bf3fd PL |
79 | /** |
80 | * tipc_register_media - register a media type | |
c4307285 | 81 | * |
b97bf3fd PL |
82 | * Bearers for this media type must be activated separately at a later stage. |
83 | */ | |
358a0d1c | 84 | int tipc_register_media(struct tipc_media *m_ptr) |
b97bf3fd | 85 | { |
b97bf3fd PL |
86 | int res = -EINVAL; |
87 | ||
4323add6 | 88 | write_lock_bh(&tipc_net_lock); |
b97bf3fd | 89 | |
38129433 | 90 | if ((strlen(m_ptr->name) + 1) > TIPC_MAX_MEDIA_NAME) |
d0021b25 | 91 | goto exit; |
3d749a6a AS |
92 | if ((m_ptr->bcast_addr.media_id != m_ptr->type_id) || |
93 | !m_ptr->bcast_addr.broadcast) | |
b97bf3fd | 94 | goto exit; |
6c349210 | 95 | if (m_ptr->priority > TIPC_MAX_LINK_PRI) |
b97bf3fd | 96 | goto exit; |
706767da | 97 | if ((m_ptr->tolerance < TIPC_MIN_LINK_TOL) || |
6c349210 | 98 | (m_ptr->tolerance > TIPC_MAX_LINK_TOL)) |
b97bf3fd | 99 | goto exit; |
6c349210 | 100 | if (media_count >= MAX_MEDIA) |
b97bf3fd | 101 | goto exit; |
5c216e1d | 102 | if (tipc_media_find(m_ptr->name) || media_find_id(m_ptr->type_id)) |
c79be454 | 103 | goto exit; |
b97bf3fd | 104 | |
a31abe8d | 105 | media_list[media_count] = m_ptr; |
c79be454 | 106 | media_count++; |
b97bf3fd PL |
107 | res = 0; |
108 | exit: | |
4323add6 | 109 | write_unlock_bh(&tipc_net_lock); |
6c349210 | 110 | if (res) |
2cf8aa19 | 111 | pr_warn("Media <%s> registration error\n", m_ptr->name); |
b97bf3fd PL |
112 | return res; |
113 | } | |
114 | ||
115 | /** | |
4323add6 | 116 | * tipc_media_addr_printf - record media address in print buffer |
b97bf3fd | 117 | */ |
dc1aed37 | 118 | void tipc_media_addr_printf(char *buf, int len, struct tipc_media_addr *a) |
b97bf3fd | 119 | { |
c61b666e | 120 | char addr_str[MAX_ADDR_STR]; |
358a0d1c | 121 | struct tipc_media *m_ptr; |
dc1aed37 | 122 | int ret; |
b97bf3fd | 123 | |
3d749a6a | 124 | m_ptr = media_find_id(a->media_id); |
b97bf3fd | 125 | |
c61b666e | 126 | if (m_ptr && !m_ptr->addr2str(a, addr_str, sizeof(addr_str))) |
dc1aed37 | 127 | ret = tipc_snprintf(buf, len, "%s(%s)", m_ptr->name, addr_str); |
c61b666e | 128 | else { |
c61b666e | 129 | u32 i; |
b97bf3fd | 130 | |
dc1aed37 | 131 | ret = tipc_snprintf(buf, len, "UNKNOWN(%u)", a->media_id); |
3d749a6a | 132 | for (i = 0; i < sizeof(a->value); i++) |
dc1aed37 EH |
133 | ret += tipc_snprintf(buf - ret, len + ret, |
134 | "-%02x", a->value[i]); | |
b97bf3fd PL |
135 | } |
136 | } | |
137 | ||
138 | /** | |
4323add6 | 139 | * tipc_media_get_names - record names of registered media in buffer |
b97bf3fd | 140 | */ |
4323add6 | 141 | struct sk_buff *tipc_media_get_names(void) |
b97bf3fd PL |
142 | { |
143 | struct sk_buff *buf; | |
b97bf3fd PL |
144 | int i; |
145 | ||
4323add6 | 146 | buf = tipc_cfg_reply_alloc(MAX_MEDIA * TLV_SPACE(TIPC_MAX_MEDIA_NAME)); |
b97bf3fd PL |
147 | if (!buf) |
148 | return NULL; | |
149 | ||
4323add6 | 150 | read_lock_bh(&tipc_net_lock); |
a31abe8d AS |
151 | for (i = 0; i < media_count; i++) { |
152 | tipc_cfg_append_tlv(buf, TIPC_TLV_MEDIA_NAME, | |
153 | media_list[i]->name, | |
154 | strlen(media_list[i]->name) + 1); | |
b97bf3fd | 155 | } |
4323add6 | 156 | read_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
157 | return buf; |
158 | } | |
159 | ||
160 | /** | |
161 | * bearer_name_validate - validate & (optionally) deconstruct bearer name | |
2c53040f BH |
162 | * @name: ptr to bearer name string |
163 | * @name_parts: ptr to area for bearer name components (or NULL if not needed) | |
c4307285 | 164 | * |
b97bf3fd PL |
165 | * Returns 1 if bearer name is valid, otherwise 0. |
166 | */ | |
c4307285 | 167 | static int bearer_name_validate(const char *name, |
f19765f4 | 168 | struct tipc_bearer_names *name_parts) |
b97bf3fd PL |
169 | { |
170 | char name_copy[TIPC_MAX_BEARER_NAME]; | |
171 | char *media_name; | |
172 | char *if_name; | |
173 | u32 media_len; | |
174 | u32 if_len; | |
175 | ||
176 | /* copy bearer name & ensure length is OK */ | |
b97bf3fd PL |
177 | name_copy[TIPC_MAX_BEARER_NAME - 1] = 0; |
178 | /* need above in case non-Posix strncpy() doesn't pad with nulls */ | |
179 | strncpy(name_copy, name, TIPC_MAX_BEARER_NAME); | |
180 | if (name_copy[TIPC_MAX_BEARER_NAME - 1] != 0) | |
181 | return 0; | |
182 | ||
183 | /* ensure all component parts of bearer name are present */ | |
b97bf3fd | 184 | media_name = name_copy; |
2db9983a AS |
185 | if_name = strchr(media_name, ':'); |
186 | if (if_name == NULL) | |
b97bf3fd PL |
187 | return 0; |
188 | *(if_name++) = 0; | |
189 | media_len = if_name - media_name; | |
190 | if_len = strlen(if_name) + 1; | |
191 | ||
192 | /* validate component parts of bearer name */ | |
c4307285 | 193 | if ((media_len <= 1) || (media_len > TIPC_MAX_MEDIA_NAME) || |
fc073938 | 194 | (if_len <= 1) || (if_len > TIPC_MAX_IF_NAME)) |
b97bf3fd PL |
195 | return 0; |
196 | ||
197 | /* return bearer name components, if necessary */ | |
b97bf3fd PL |
198 | if (name_parts) { |
199 | strcpy(name_parts->media_name, media_name); | |
200 | strcpy(name_parts->if_name, if_name); | |
201 | } | |
202 | return 1; | |
203 | } | |
204 | ||
205 | /** | |
5c216e1d | 206 | * tipc_bearer_find - locates bearer object with matching bearer name |
b97bf3fd | 207 | */ |
5c216e1d | 208 | struct tipc_bearer *tipc_bearer_find(const char *name) |
b97bf3fd | 209 | { |
2d627b92 | 210 | struct tipc_bearer *b_ptr; |
b97bf3fd PL |
211 | u32 i; |
212 | ||
4323add6 | 213 | for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) { |
2d627b92 | 214 | if (b_ptr->active && (!strcmp(b_ptr->name, name))) |
b97bf3fd PL |
215 | return b_ptr; |
216 | } | |
1fc54d8f | 217 | return NULL; |
b97bf3fd PL |
218 | } |
219 | ||
220 | /** | |
4323add6 | 221 | * tipc_bearer_find_interface - locates bearer object with matching interface name |
b97bf3fd | 222 | */ |
2d627b92 | 223 | struct tipc_bearer *tipc_bearer_find_interface(const char *if_name) |
b97bf3fd | 224 | { |
2d627b92 | 225 | struct tipc_bearer *b_ptr; |
b97bf3fd PL |
226 | char *b_if_name; |
227 | u32 i; | |
228 | ||
4323add6 | 229 | for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) { |
b97bf3fd PL |
230 | if (!b_ptr->active) |
231 | continue; | |
2d627b92 | 232 | b_if_name = strchr(b_ptr->name, ':') + 1; |
b97bf3fd PL |
233 | if (!strcmp(b_if_name, if_name)) |
234 | return b_ptr; | |
235 | } | |
1fc54d8f | 236 | return NULL; |
b97bf3fd PL |
237 | } |
238 | ||
239 | /** | |
4323add6 | 240 | * tipc_bearer_get_names - record names of bearers in buffer |
b97bf3fd | 241 | */ |
4323add6 | 242 | struct sk_buff *tipc_bearer_get_names(void) |
b97bf3fd PL |
243 | { |
244 | struct sk_buff *buf; | |
2d627b92 | 245 | struct tipc_bearer *b_ptr; |
b97bf3fd PL |
246 | int i, j; |
247 | ||
4323add6 | 248 | buf = tipc_cfg_reply_alloc(MAX_BEARERS * TLV_SPACE(TIPC_MAX_BEARER_NAME)); |
b97bf3fd PL |
249 | if (!buf) |
250 | return NULL; | |
251 | ||
4323add6 | 252 | read_lock_bh(&tipc_net_lock); |
a31abe8d | 253 | for (i = 0; i < media_count; i++) { |
b97bf3fd | 254 | for (j = 0; j < MAX_BEARERS; j++) { |
4323add6 | 255 | b_ptr = &tipc_bearers[j]; |
a31abe8d | 256 | if (b_ptr->active && (b_ptr->media == media_list[i])) { |
c4307285 | 257 | tipc_cfg_append_tlv(buf, TIPC_TLV_BEARER_NAME, |
2d627b92 AS |
258 | b_ptr->name, |
259 | strlen(b_ptr->name) + 1); | |
b97bf3fd PL |
260 | } |
261 | } | |
262 | } | |
4323add6 | 263 | read_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
264 | return buf; |
265 | } | |
266 | ||
2d627b92 | 267 | void tipc_bearer_add_dest(struct tipc_bearer *b_ptr, u32 dest) |
b97bf3fd | 268 | { |
4323add6 | 269 | tipc_nmap_add(&b_ptr->nodes, dest); |
4323add6 | 270 | tipc_bcbearer_sort(); |
1209966c | 271 | tipc_disc_add_dest(b_ptr->link_req); |
b97bf3fd PL |
272 | } |
273 | ||
2d627b92 | 274 | void tipc_bearer_remove_dest(struct tipc_bearer *b_ptr, u32 dest) |
b97bf3fd | 275 | { |
4323add6 | 276 | tipc_nmap_remove(&b_ptr->nodes, dest); |
4323add6 | 277 | tipc_bcbearer_sort(); |
1209966c | 278 | tipc_disc_remove_dest(b_ptr->link_req); |
b97bf3fd PL |
279 | } |
280 | ||
281 | /* | |
282 | * bearer_push(): Resolve bearer congestion. Force the waiting | |
283 | * links to push out their unsent packets, one packet per link | |
284 | * per iteration, until all packets are gone or congestion reoccurs. | |
4323add6 | 285 | * 'tipc_net_lock' is read_locked when this function is called |
b97bf3fd PL |
286 | * bearer.lock must be taken before calling |
287 | * Returns binary true(1) ore false(0) | |
288 | */ | |
2d627b92 | 289 | static int bearer_push(struct tipc_bearer *b_ptr) |
b97bf3fd | 290 | { |
0e35fd5e | 291 | u32 res = 0; |
a18c4bc3 | 292 | struct tipc_link *ln, *tln; |
b97bf3fd | 293 | |
2d627b92 | 294 | if (b_ptr->blocked) |
b97bf3fd PL |
295 | return 0; |
296 | ||
297 | while (!list_empty(&b_ptr->cong_links) && (res != PUSH_FAILED)) { | |
298 | list_for_each_entry_safe(ln, tln, &b_ptr->cong_links, link_list) { | |
4323add6 | 299 | res = tipc_link_push_packet(ln); |
b97bf3fd PL |
300 | if (res == PUSH_FAILED) |
301 | break; | |
302 | if (res == PUSH_FINISHED) | |
303 | list_move_tail(&ln->link_list, &b_ptr->links); | |
304 | } | |
305 | } | |
306 | return list_empty(&b_ptr->cong_links); | |
307 | } | |
308 | ||
2d627b92 | 309 | void tipc_bearer_lock_push(struct tipc_bearer *b_ptr) |
b97bf3fd | 310 | { |
2d627b92 | 311 | spin_lock_bh(&b_ptr->lock); |
23f0ff90 | 312 | bearer_push(b_ptr); |
2d627b92 | 313 | spin_unlock_bh(&b_ptr->lock); |
b97bf3fd PL |
314 | } |
315 | ||
316 | ||
317 | /* | |
c4307285 YH |
318 | * Interrupt enabling new requests after bearer congestion or blocking: |
319 | * See bearer_send(). | |
b97bf3fd | 320 | */ |
2d627b92 | 321 | void tipc_continue(struct tipc_bearer *b_ptr) |
b97bf3fd | 322 | { |
2d627b92 | 323 | spin_lock_bh(&b_ptr->lock); |
b97bf3fd | 324 | if (!list_empty(&b_ptr->cong_links)) |
4323add6 | 325 | tipc_k_signal((Handler)tipc_bearer_lock_push, (unsigned long)b_ptr); |
2d627b92 AS |
326 | b_ptr->blocked = 0; |
327 | spin_unlock_bh(&b_ptr->lock); | |
b97bf3fd PL |
328 | } |
329 | ||
330 | /* | |
c4307285 YH |
331 | * Schedule link for sending of messages after the bearer |
332 | * has been deblocked by 'continue()'. This method is called | |
333 | * when somebody tries to send a message via this link while | |
4323add6 | 334 | * the bearer is congested. 'tipc_net_lock' is in read_lock here |
b97bf3fd PL |
335 | * bearer.lock is busy |
336 | */ | |
a18c4bc3 PG |
337 | static void tipc_bearer_schedule_unlocked(struct tipc_bearer *b_ptr, |
338 | struct tipc_link *l_ptr) | |
b97bf3fd PL |
339 | { |
340 | list_move_tail(&l_ptr->link_list, &b_ptr->cong_links); | |
341 | } | |
342 | ||
343 | /* | |
c4307285 YH |
344 | * Schedule link for sending of messages after the bearer |
345 | * has been deblocked by 'continue()'. This method is called | |
346 | * when somebody tries to send a message via this link while | |
4323add6 | 347 | * the bearer is congested. 'tipc_net_lock' is in read_lock here, |
b97bf3fd PL |
348 | * bearer.lock is free |
349 | */ | |
a18c4bc3 | 350 | void tipc_bearer_schedule(struct tipc_bearer *b_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 351 | { |
2d627b92 | 352 | spin_lock_bh(&b_ptr->lock); |
4323add6 | 353 | tipc_bearer_schedule_unlocked(b_ptr, l_ptr); |
2d627b92 | 354 | spin_unlock_bh(&b_ptr->lock); |
b97bf3fd PL |
355 | } |
356 | ||
357 | ||
358 | /* | |
4323add6 | 359 | * tipc_bearer_resolve_congestion(): Check if there is bearer congestion, |
b97bf3fd | 360 | * and if there is, try to resolve it before returning. |
4323add6 | 361 | * 'tipc_net_lock' is read_locked when this function is called |
b97bf3fd | 362 | */ |
a18c4bc3 PG |
363 | int tipc_bearer_resolve_congestion(struct tipc_bearer *b_ptr, |
364 | struct tipc_link *l_ptr) | |
b97bf3fd PL |
365 | { |
366 | int res = 1; | |
367 | ||
368 | if (list_empty(&b_ptr->cong_links)) | |
369 | return 1; | |
2d627b92 | 370 | spin_lock_bh(&b_ptr->lock); |
b97bf3fd | 371 | if (!bearer_push(b_ptr)) { |
4323add6 | 372 | tipc_bearer_schedule_unlocked(b_ptr, l_ptr); |
b97bf3fd PL |
373 | res = 0; |
374 | } | |
2d627b92 | 375 | spin_unlock_bh(&b_ptr->lock); |
b97bf3fd PL |
376 | return res; |
377 | } | |
378 | ||
b274f4ab AS |
379 | /** |
380 | * tipc_bearer_congested - determines if bearer is currently congested | |
381 | */ | |
a18c4bc3 | 382 | int tipc_bearer_congested(struct tipc_bearer *b_ptr, struct tipc_link *l_ptr) |
b274f4ab | 383 | { |
2d627b92 | 384 | if (unlikely(b_ptr->blocked)) |
b274f4ab AS |
385 | return 1; |
386 | if (likely(list_empty(&b_ptr->cong_links))) | |
387 | return 0; | |
388 | return !tipc_bearer_resolve_congestion(b_ptr, l_ptr); | |
389 | } | |
b97bf3fd PL |
390 | |
391 | /** | |
392 | * tipc_enable_bearer - enable bearer with the given name | |
c4307285 | 393 | */ |
50d3e639 | 394 | int tipc_enable_bearer(const char *name, u32 disc_domain, u32 priority) |
b97bf3fd | 395 | { |
2d627b92 | 396 | struct tipc_bearer *b_ptr; |
358a0d1c | 397 | struct tipc_media *m_ptr; |
f19765f4 | 398 | struct tipc_bearer_names b_names; |
b97bf3fd PL |
399 | char addr_string[16]; |
400 | u32 bearer_id; | |
401 | u32 with_this_prio; | |
402 | u32 i; | |
403 | int res = -EINVAL; | |
404 | ||
b58343f9 | 405 | if (!tipc_own_addr) { |
2cf8aa19 EH |
406 | pr_warn("Bearer <%s> rejected, not supported in standalone mode\n", |
407 | name); | |
b97bf3fd | 408 | return -ENOPROTOOPT; |
a10bd924 | 409 | } |
f19765f4 | 410 | if (!bearer_name_validate(name, &b_names)) { |
2cf8aa19 | 411 | pr_warn("Bearer <%s> rejected, illegal name\n", name); |
16cb4b33 | 412 | return -EINVAL; |
a10bd924 | 413 | } |
66e019a6 AS |
414 | if (tipc_addr_domain_valid(disc_domain) && |
415 | (disc_domain != tipc_own_addr)) { | |
416 | if (tipc_in_scope(disc_domain, tipc_own_addr)) { | |
417 | disc_domain = tipc_own_addr & TIPC_CLUSTER_MASK; | |
418 | res = 0; /* accept any node in own cluster */ | |
336ebf5b | 419 | } else if (in_own_cluster_exact(disc_domain)) |
66e019a6 AS |
420 | res = 0; /* accept specified node in own cluster */ |
421 | } | |
422 | if (res) { | |
2cf8aa19 EH |
423 | pr_warn("Bearer <%s> rejected, illegal discovery domain\n", |
424 | name); | |
a10bd924 AS |
425 | return -EINVAL; |
426 | } | |
9efde4a0 | 427 | if ((priority > TIPC_MAX_LINK_PRI) && |
a10bd924 | 428 | (priority != TIPC_MEDIA_LINK_PRI)) { |
2cf8aa19 | 429 | pr_warn("Bearer <%s> rejected, illegal priority\n", name); |
b97bf3fd | 430 | return -EINVAL; |
a10bd924 | 431 | } |
b97bf3fd | 432 | |
4323add6 | 433 | write_lock_bh(&tipc_net_lock); |
b97bf3fd | 434 | |
f19765f4 | 435 | m_ptr = tipc_media_find(b_names.media_name); |
b97bf3fd | 436 | if (!m_ptr) { |
2cf8aa19 EH |
437 | pr_warn("Bearer <%s> rejected, media <%s> not registered\n", |
438 | name, b_names.media_name); | |
3a777ff8 | 439 | goto exit; |
b97bf3fd | 440 | } |
16cb4b33 PL |
441 | |
442 | if (priority == TIPC_MEDIA_LINK_PRI) | |
b97bf3fd PL |
443 | priority = m_ptr->priority; |
444 | ||
445 | restart: | |
446 | bearer_id = MAX_BEARERS; | |
447 | with_this_prio = 1; | |
448 | for (i = MAX_BEARERS; i-- != 0; ) { | |
4323add6 | 449 | if (!tipc_bearers[i].active) { |
b97bf3fd PL |
450 | bearer_id = i; |
451 | continue; | |
452 | } | |
2d627b92 | 453 | if (!strcmp(name, tipc_bearers[i].name)) { |
2cf8aa19 EH |
454 | pr_warn("Bearer <%s> rejected, already enabled\n", |
455 | name); | |
3a777ff8 | 456 | goto exit; |
b97bf3fd | 457 | } |
4323add6 | 458 | if ((tipc_bearers[i].priority == priority) && |
b97bf3fd PL |
459 | (++with_this_prio > 2)) { |
460 | if (priority-- == 0) { | |
2cf8aa19 EH |
461 | pr_warn("Bearer <%s> rejected, duplicate priority\n", |
462 | name); | |
3a777ff8 | 463 | goto exit; |
b97bf3fd | 464 | } |
2cf8aa19 EH |
465 | pr_warn("Bearer <%s> priority adjustment required %u->%u\n", |
466 | name, priority + 1, priority); | |
b97bf3fd PL |
467 | goto restart; |
468 | } | |
469 | } | |
470 | if (bearer_id >= MAX_BEARERS) { | |
2cf8aa19 EH |
471 | pr_warn("Bearer <%s> rejected, bearer limit reached (%u)\n", |
472 | name, MAX_BEARERS); | |
3a777ff8 | 473 | goto exit; |
b97bf3fd PL |
474 | } |
475 | ||
4323add6 | 476 | b_ptr = &tipc_bearers[bearer_id]; |
2d627b92 AS |
477 | strcpy(b_ptr->name, name); |
478 | res = m_ptr->enable_bearer(b_ptr); | |
b97bf3fd | 479 | if (res) { |
2cf8aa19 EH |
480 | pr_warn("Bearer <%s> rejected, enable failure (%d)\n", |
481 | name, -res); | |
3a777ff8 | 482 | goto exit; |
b97bf3fd PL |
483 | } |
484 | ||
485 | b_ptr->identity = bearer_id; | |
486 | b_ptr->media = m_ptr; | |
5c216e1d AS |
487 | b_ptr->tolerance = m_ptr->tolerance; |
488 | b_ptr->window = m_ptr->window; | |
b97bf3fd PL |
489 | b_ptr->net_plane = bearer_id + 'A'; |
490 | b_ptr->active = 1; | |
b97bf3fd PL |
491 | b_ptr->priority = priority; |
492 | INIT_LIST_HEAD(&b_ptr->cong_links); | |
493 | INIT_LIST_HEAD(&b_ptr->links); | |
2d627b92 | 494 | spin_lock_init(&b_ptr->lock); |
3a777ff8 AS |
495 | |
496 | res = tipc_disc_create(b_ptr, &m_ptr->bcast_addr, disc_domain); | |
497 | if (res) { | |
498 | bearer_disable(b_ptr); | |
2cf8aa19 EH |
499 | pr_warn("Bearer <%s> rejected, discovery object creation failed\n", |
500 | name); | |
3a777ff8 AS |
501 | goto exit; |
502 | } | |
2cf8aa19 EH |
503 | pr_info("Enabled bearer <%s>, discovery domain %s, priority %u\n", |
504 | name, | |
505 | tipc_addr_string_fill(addr_string, disc_domain), priority); | |
3a777ff8 | 506 | exit: |
4323add6 | 507 | write_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
508 | return res; |
509 | } | |
510 | ||
511 | /** | |
2c53040f | 512 | * tipc_block_bearer - Block the bearer with the given name, and reset all its links |
b97bf3fd | 513 | */ |
b97bf3fd PL |
514 | int tipc_block_bearer(const char *name) |
515 | { | |
2d627b92 | 516 | struct tipc_bearer *b_ptr = NULL; |
a18c4bc3 PG |
517 | struct tipc_link *l_ptr; |
518 | struct tipc_link *temp_l_ptr; | |
b97bf3fd | 519 | |
4323add6 | 520 | read_lock_bh(&tipc_net_lock); |
5c216e1d | 521 | b_ptr = tipc_bearer_find(name); |
b97bf3fd | 522 | if (!b_ptr) { |
2cf8aa19 | 523 | pr_warn("Attempt to block unknown bearer <%s>\n", name); |
4323add6 | 524 | read_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
525 | return -EINVAL; |
526 | } | |
527 | ||
2cf8aa19 | 528 | pr_info("Blocking bearer <%s>\n", name); |
2d627b92 AS |
529 | spin_lock_bh(&b_ptr->lock); |
530 | b_ptr->blocked = 1; | |
4b3743ef | 531 | list_splice_init(&b_ptr->cong_links, &b_ptr->links); |
b97bf3fd | 532 | list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) { |
6c00055a | 533 | struct tipc_node *n_ptr = l_ptr->owner; |
b97bf3fd PL |
534 | |
535 | spin_lock_bh(&n_ptr->lock); | |
4323add6 | 536 | tipc_link_reset(l_ptr); |
b97bf3fd PL |
537 | spin_unlock_bh(&n_ptr->lock); |
538 | } | |
2d627b92 | 539 | spin_unlock_bh(&b_ptr->lock); |
4323add6 | 540 | read_unlock_bh(&tipc_net_lock); |
0e35fd5e | 541 | return 0; |
b97bf3fd PL |
542 | } |
543 | ||
544 | /** | |
617d3c7a | 545 | * bearer_disable |
c4307285 | 546 | * |
4323add6 | 547 | * Note: This routine assumes caller holds tipc_net_lock. |
b97bf3fd | 548 | */ |
2d627b92 | 549 | static void bearer_disable(struct tipc_bearer *b_ptr) |
b97bf3fd | 550 | { |
a18c4bc3 PG |
551 | struct tipc_link *l_ptr; |
552 | struct tipc_link *temp_l_ptr; | |
b97bf3fd | 553 | |
2cf8aa19 | 554 | pr_info("Disabling bearer <%s>\n", b_ptr->name); |
2d627b92 | 555 | spin_lock_bh(&b_ptr->lock); |
2d627b92 AS |
556 | b_ptr->blocked = 1; |
557 | b_ptr->media->disable_bearer(b_ptr); | |
4b3743ef | 558 | list_splice_init(&b_ptr->cong_links, &b_ptr->links); |
b97bf3fd | 559 | list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) { |
4323add6 | 560 | tipc_link_delete(l_ptr); |
b97bf3fd | 561 | } |
3a777ff8 AS |
562 | if (b_ptr->link_req) |
563 | tipc_disc_delete(b_ptr->link_req); | |
2d627b92 AS |
564 | spin_unlock_bh(&b_ptr->lock); |
565 | memset(b_ptr, 0, sizeof(struct tipc_bearer)); | |
b97bf3fd PL |
566 | } |
567 | ||
568 | int tipc_disable_bearer(const char *name) | |
569 | { | |
2d627b92 | 570 | struct tipc_bearer *b_ptr; |
b97bf3fd PL |
571 | int res; |
572 | ||
4323add6 | 573 | write_lock_bh(&tipc_net_lock); |
5c216e1d | 574 | b_ptr = tipc_bearer_find(name); |
ccc901ee | 575 | if (b_ptr == NULL) { |
2cf8aa19 | 576 | pr_warn("Attempt to disable unknown bearer <%s>\n", name); |
ccc901ee | 577 | res = -EINVAL; |
28cc937e AS |
578 | } else { |
579 | bearer_disable(b_ptr); | |
580 | res = 0; | |
581 | } | |
4323add6 | 582 | write_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
583 | return res; |
584 | } | |
585 | ||
586 | ||
587 | ||
4323add6 | 588 | void tipc_bearer_stop(void) |
b97bf3fd PL |
589 | { |
590 | u32 i; | |
591 | ||
b97bf3fd | 592 | for (i = 0; i < MAX_BEARERS; i++) { |
4323add6 | 593 | if (tipc_bearers[i].active) |
ccc901ee | 594 | bearer_disable(&tipc_bearers[i]); |
b97bf3fd | 595 | } |
b97bf3fd PL |
596 | media_count = 0; |
597 | } |