]>
Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/bearer.c: TIPC bearer code | |
c4307285 | 3 | * |
593a5f22 | 4 | * Copyright (c) 1996-2006, Ericsson AB |
e91ed0bc | 5 | * Copyright (c) 2004-2006, 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" | |
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 | ||
1fc54d8f | 48 | static struct media *media_list = NULL; |
b97bf3fd PL |
49 | static u32 media_count = 0; |
50 | ||
1fc54d8f | 51 | struct bearer *tipc_bearers = NULL; |
b97bf3fd PL |
52 | |
53 | /** | |
54 | * media_name_valid - validate media name | |
c4307285 | 55 | * |
b97bf3fd PL |
56 | * Returns 1 if media name is valid, otherwise 0. |
57 | */ | |
58 | ||
59 | static 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 | ||
73 | static 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 | } | |
1fc54d8f | 82 | return NULL; |
b97bf3fd PL |
83 | } |
84 | ||
85 | /** | |
86 | * tipc_register_media - register a media type | |
c4307285 | 87 | * |
b97bf3fd PL |
88 | * Bearers for this media type must be activated separately at a later stage. |
89 | */ | |
90 | ||
91 | int tipc_register_media(u32 media_type, | |
c4307285 YH |
92 | char *name, |
93 | int (*enable)(struct tipc_bearer *), | |
94 | void (*disable)(struct tipc_bearer *), | |
95 | int (*send_msg)(struct sk_buff *, | |
b97bf3fd | 96 | struct tipc_bearer *, |
c4307285 | 97 | struct tipc_media_addr *), |
b97bf3fd PL |
98 | 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 | ||
4323add6 | 110 | write_lock_bh(&tipc_net_lock); |
b97bf3fd PL |
111 | if (!media_list) |
112 | goto exit; | |
113 | ||
114 | if (!media_name_valid(name)) { | |
a10bd924 | 115 | warn("Media <%s> rejected, illegal name\n", name); |
b97bf3fd PL |
116 | goto exit; |
117 | } | |
118 | if (!bcast_addr) { | |
a10bd924 | 119 | warn("Media <%s> rejected, no broadcast address\n", name); |
b97bf3fd PL |
120 | goto exit; |
121 | } | |
b3df9a51 | 122 | if ((bearer_priority < TIPC_MIN_LINK_PRI) || |
16cb4b33 | 123 | (bearer_priority > TIPC_MAX_LINK_PRI)) { |
c4307285 | 124 | warn("Media <%s> rejected, illegal priority (%u)\n", name, |
a10bd924 | 125 | bearer_priority); |
b97bf3fd PL |
126 | goto exit; |
127 | } | |
c4307285 | 128 | if ((link_tolerance < TIPC_MIN_LINK_TOL) || |
b97bf3fd | 129 | (link_tolerance > TIPC_MAX_LINK_TOL)) { |
a10bd924 AS |
130 | warn("Media <%s> rejected, illegal tolerance (%u)\n", name, |
131 | link_tolerance); | |
b97bf3fd PL |
132 | goto exit; |
133 | } | |
134 | ||
135 | media_id = media_count++; | |
136 | if (media_id >= MAX_MEDIA) { | |
a10bd924 AS |
137 | warn("Media <%s> rejected, media limit reached (%u)\n", name, |
138 | MAX_MEDIA); | |
b97bf3fd PL |
139 | media_count--; |
140 | goto exit; | |
141 | } | |
142 | for (i = 0; i < media_id; i++) { | |
143 | if (media_list[i].type_id == media_type) { | |
a10bd924 | 144 | warn("Media <%s> rejected, duplicate type (%u)\n", name, |
b97bf3fd PL |
145 | media_type); |
146 | media_count--; | |
147 | goto exit; | |
148 | } | |
149 | if (!strcmp(name, media_list[i].name)) { | |
a10bd924 | 150 | warn("Media <%s> rejected, duplicate name\n", name); |
b97bf3fd PL |
151 | media_count--; |
152 | goto exit; | |
153 | } | |
154 | } | |
155 | ||
156 | m_ptr = &media_list[media_id]; | |
157 | m_ptr->type_id = media_type; | |
158 | m_ptr->send_msg = send_msg; | |
159 | m_ptr->enable_bearer = enable; | |
160 | m_ptr->disable_bearer = disable; | |
161 | m_ptr->addr2str = addr2str; | |
162 | memcpy(&m_ptr->bcast_addr, bcast_addr, sizeof(*bcast_addr)); | |
163 | m_ptr->bcast = 1; | |
164 | strcpy(m_ptr->name, name); | |
165 | m_ptr->priority = bearer_priority; | |
166 | m_ptr->tolerance = link_tolerance; | |
167 | m_ptr->window = send_window_limit; | |
168 | dbg("Media <%s> registered\n", name); | |
169 | res = 0; | |
170 | exit: | |
4323add6 | 171 | write_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
172 | return res; |
173 | } | |
174 | ||
175 | /** | |
4323add6 | 176 | * tipc_media_addr_printf - record media address in print buffer |
b97bf3fd PL |
177 | */ |
178 | ||
4323add6 | 179 | void tipc_media_addr_printf(struct print_buf *pb, struct tipc_media_addr *a) |
b97bf3fd PL |
180 | { |
181 | struct media *m_ptr; | |
182 | u32 media_type; | |
183 | u32 i; | |
184 | ||
185 | media_type = ntohl(a->type); | |
186 | for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) { | |
187 | if (m_ptr->type_id == media_type) | |
188 | break; | |
189 | } | |
190 | ||
191 | if ((i < media_count) && (m_ptr->addr2str != NULL)) { | |
192 | char addr_str[MAX_ADDR_STR]; | |
193 | ||
e91ed0bc | 194 | tipc_printf(pb, "%s(%s)", m_ptr->name, |
b97bf3fd PL |
195 | m_ptr->addr2str(a, addr_str, sizeof(addr_str))); |
196 | } else { | |
197 | unchar *addr = (unchar *)&a->dev_addr; | |
198 | ||
e91ed0bc | 199 | tipc_printf(pb, "UNKNOWN(%u)", media_type); |
b97bf3fd | 200 | for (i = 0; i < (sizeof(*a) - sizeof(a->type)); i++) { |
e91ed0bc | 201 | tipc_printf(pb, "-%02x", addr[i]); |
b97bf3fd PL |
202 | } |
203 | } | |
204 | } | |
205 | ||
206 | /** | |
4323add6 | 207 | * tipc_media_get_names - record names of registered media in buffer |
b97bf3fd PL |
208 | */ |
209 | ||
4323add6 | 210 | struct sk_buff *tipc_media_get_names(void) |
b97bf3fd PL |
211 | { |
212 | struct sk_buff *buf; | |
213 | struct media *m_ptr; | |
214 | int i; | |
215 | ||
4323add6 | 216 | buf = tipc_cfg_reply_alloc(MAX_MEDIA * TLV_SPACE(TIPC_MAX_MEDIA_NAME)); |
b97bf3fd PL |
217 | if (!buf) |
218 | return NULL; | |
219 | ||
4323add6 | 220 | read_lock_bh(&tipc_net_lock); |
b97bf3fd | 221 | for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) { |
c4307285 | 222 | tipc_cfg_append_tlv(buf, TIPC_TLV_MEDIA_NAME, m_ptr->name, |
4323add6 | 223 | strlen(m_ptr->name) + 1); |
b97bf3fd | 224 | } |
4323add6 | 225 | read_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
226 | return buf; |
227 | } | |
228 | ||
229 | /** | |
230 | * bearer_name_validate - validate & (optionally) deconstruct bearer name | |
231 | * @name - ptr to bearer name string | |
232 | * @name_parts - ptr to area for bearer name components (or NULL if not needed) | |
c4307285 | 233 | * |
b97bf3fd PL |
234 | * Returns 1 if bearer name is valid, otherwise 0. |
235 | */ | |
236 | ||
c4307285 | 237 | static int bearer_name_validate(const char *name, |
b97bf3fd PL |
238 | struct bearer_name *name_parts) |
239 | { | |
240 | char name_copy[TIPC_MAX_BEARER_NAME]; | |
241 | char *media_name; | |
242 | char *if_name; | |
243 | u32 media_len; | |
244 | u32 if_len; | |
245 | ||
246 | /* copy bearer name & ensure length is OK */ | |
247 | ||
248 | name_copy[TIPC_MAX_BEARER_NAME - 1] = 0; | |
249 | /* need above in case non-Posix strncpy() doesn't pad with nulls */ | |
250 | strncpy(name_copy, name, TIPC_MAX_BEARER_NAME); | |
251 | if (name_copy[TIPC_MAX_BEARER_NAME - 1] != 0) | |
252 | return 0; | |
253 | ||
254 | /* ensure all component parts of bearer name are present */ | |
255 | ||
256 | media_name = name_copy; | |
257 | if ((if_name = strchr(media_name, ':')) == NULL) | |
258 | return 0; | |
259 | *(if_name++) = 0; | |
260 | media_len = if_name - media_name; | |
261 | if_len = strlen(if_name) + 1; | |
262 | ||
263 | /* validate component parts of bearer name */ | |
264 | ||
c4307285 YH |
265 | if ((media_len <= 1) || (media_len > TIPC_MAX_MEDIA_NAME) || |
266 | (if_len <= 1) || (if_len > TIPC_MAX_IF_NAME) || | |
b97bf3fd PL |
267 | (strspn(media_name, tipc_alphabet) != (media_len - 1)) || |
268 | (strspn(if_name, tipc_alphabet) != (if_len - 1))) | |
269 | return 0; | |
270 | ||
271 | /* return bearer name components, if necessary */ | |
272 | ||
273 | if (name_parts) { | |
274 | strcpy(name_parts->media_name, media_name); | |
275 | strcpy(name_parts->if_name, if_name); | |
276 | } | |
277 | return 1; | |
278 | } | |
279 | ||
280 | /** | |
281 | * bearer_find - locates bearer object with matching bearer name | |
282 | */ | |
283 | ||
284 | static struct bearer *bearer_find(const char *name) | |
285 | { | |
286 | struct bearer *b_ptr; | |
287 | u32 i; | |
288 | ||
a10bd924 AS |
289 | if (tipc_mode != TIPC_NET_MODE) |
290 | return NULL; | |
291 | ||
4323add6 | 292 | for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) { |
b97bf3fd PL |
293 | if (b_ptr->active && (!strcmp(b_ptr->publ.name, name))) |
294 | return b_ptr; | |
295 | } | |
1fc54d8f | 296 | return NULL; |
b97bf3fd PL |
297 | } |
298 | ||
299 | /** | |
4323add6 | 300 | * tipc_bearer_find_interface - locates bearer object with matching interface name |
b97bf3fd PL |
301 | */ |
302 | ||
4323add6 | 303 | struct bearer *tipc_bearer_find_interface(const char *if_name) |
b97bf3fd PL |
304 | { |
305 | struct bearer *b_ptr; | |
306 | char *b_if_name; | |
307 | u32 i; | |
308 | ||
4323add6 | 309 | for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) { |
b97bf3fd PL |
310 | if (!b_ptr->active) |
311 | continue; | |
312 | b_if_name = strchr(b_ptr->publ.name, ':') + 1; | |
313 | if (!strcmp(b_if_name, if_name)) | |
314 | return b_ptr; | |
315 | } | |
1fc54d8f | 316 | return NULL; |
b97bf3fd PL |
317 | } |
318 | ||
319 | /** | |
4323add6 | 320 | * tipc_bearer_get_names - record names of bearers in buffer |
b97bf3fd PL |
321 | */ |
322 | ||
4323add6 | 323 | struct sk_buff *tipc_bearer_get_names(void) |
b97bf3fd PL |
324 | { |
325 | struct sk_buff *buf; | |
326 | struct media *m_ptr; | |
327 | struct bearer *b_ptr; | |
328 | int i, j; | |
329 | ||
4323add6 | 330 | buf = tipc_cfg_reply_alloc(MAX_BEARERS * TLV_SPACE(TIPC_MAX_BEARER_NAME)); |
b97bf3fd PL |
331 | if (!buf) |
332 | return NULL; | |
333 | ||
4323add6 | 334 | read_lock_bh(&tipc_net_lock); |
b97bf3fd PL |
335 | for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) { |
336 | for (j = 0; j < MAX_BEARERS; j++) { | |
4323add6 | 337 | b_ptr = &tipc_bearers[j]; |
b97bf3fd | 338 | if (b_ptr->active && (b_ptr->media == m_ptr)) { |
c4307285 YH |
339 | tipc_cfg_append_tlv(buf, TIPC_TLV_BEARER_NAME, |
340 | b_ptr->publ.name, | |
4323add6 | 341 | strlen(b_ptr->publ.name) + 1); |
b97bf3fd PL |
342 | } |
343 | } | |
344 | } | |
4323add6 | 345 | read_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
346 | return buf; |
347 | } | |
348 | ||
4323add6 | 349 | void tipc_bearer_add_dest(struct bearer *b_ptr, u32 dest) |
b97bf3fd | 350 | { |
4323add6 PL |
351 | tipc_nmap_add(&b_ptr->nodes, dest); |
352 | tipc_disc_update_link_req(b_ptr->link_req); | |
353 | tipc_bcbearer_sort(); | |
b97bf3fd PL |
354 | } |
355 | ||
4323add6 | 356 | void tipc_bearer_remove_dest(struct bearer *b_ptr, u32 dest) |
b97bf3fd | 357 | { |
4323add6 PL |
358 | tipc_nmap_remove(&b_ptr->nodes, dest); |
359 | tipc_disc_update_link_req(b_ptr->link_req); | |
360 | tipc_bcbearer_sort(); | |
b97bf3fd PL |
361 | } |
362 | ||
363 | /* | |
364 | * bearer_push(): Resolve bearer congestion. Force the waiting | |
365 | * links to push out their unsent packets, one packet per link | |
366 | * per iteration, until all packets are gone or congestion reoccurs. | |
4323add6 | 367 | * 'tipc_net_lock' is read_locked when this function is called |
b97bf3fd PL |
368 | * bearer.lock must be taken before calling |
369 | * Returns binary true(1) ore false(0) | |
370 | */ | |
371 | static int bearer_push(struct bearer *b_ptr) | |
372 | { | |
0e35fd5e | 373 | u32 res = 0; |
b97bf3fd PL |
374 | struct link *ln, *tln; |
375 | ||
376 | if (b_ptr->publ.blocked) | |
377 | return 0; | |
378 | ||
379 | while (!list_empty(&b_ptr->cong_links) && (res != PUSH_FAILED)) { | |
380 | list_for_each_entry_safe(ln, tln, &b_ptr->cong_links, link_list) { | |
4323add6 | 381 | res = tipc_link_push_packet(ln); |
b97bf3fd PL |
382 | if (res == PUSH_FAILED) |
383 | break; | |
384 | if (res == PUSH_FINISHED) | |
385 | list_move_tail(&ln->link_list, &b_ptr->links); | |
386 | } | |
387 | } | |
388 | return list_empty(&b_ptr->cong_links); | |
389 | } | |
390 | ||
4323add6 | 391 | void tipc_bearer_lock_push(struct bearer *b_ptr) |
b97bf3fd PL |
392 | { |
393 | int res; | |
394 | ||
395 | spin_lock_bh(&b_ptr->publ.lock); | |
396 | res = bearer_push(b_ptr); | |
397 | spin_unlock_bh(&b_ptr->publ.lock); | |
398 | if (res) | |
4323add6 | 399 | tipc_bcbearer_push(); |
b97bf3fd PL |
400 | } |
401 | ||
402 | ||
403 | /* | |
c4307285 YH |
404 | * Interrupt enabling new requests after bearer congestion or blocking: |
405 | * See bearer_send(). | |
b97bf3fd PL |
406 | */ |
407 | void tipc_continue(struct tipc_bearer *tb_ptr) | |
408 | { | |
409 | struct bearer *b_ptr = (struct bearer *)tb_ptr; | |
410 | ||
411 | spin_lock_bh(&b_ptr->publ.lock); | |
412 | b_ptr->continue_count++; | |
413 | if (!list_empty(&b_ptr->cong_links)) | |
4323add6 | 414 | tipc_k_signal((Handler)tipc_bearer_lock_push, (unsigned long)b_ptr); |
b97bf3fd PL |
415 | b_ptr->publ.blocked = 0; |
416 | spin_unlock_bh(&b_ptr->publ.lock); | |
417 | } | |
418 | ||
419 | /* | |
c4307285 YH |
420 | * Schedule link for sending of messages after the bearer |
421 | * has been deblocked by 'continue()'. This method is called | |
422 | * when somebody tries to send a message via this link while | |
4323add6 | 423 | * the bearer is congested. 'tipc_net_lock' is in read_lock here |
b97bf3fd PL |
424 | * bearer.lock is busy |
425 | */ | |
426 | ||
4323add6 | 427 | static void tipc_bearer_schedule_unlocked(struct bearer *b_ptr, struct link *l_ptr) |
b97bf3fd PL |
428 | { |
429 | list_move_tail(&l_ptr->link_list, &b_ptr->cong_links); | |
430 | } | |
431 | ||
432 | /* | |
c4307285 YH |
433 | * Schedule link for sending of messages after the bearer |
434 | * has been deblocked by 'continue()'. This method is called | |
435 | * when somebody tries to send a message via this link while | |
4323add6 | 436 | * the bearer is congested. 'tipc_net_lock' is in read_lock here, |
b97bf3fd PL |
437 | * bearer.lock is free |
438 | */ | |
439 | ||
4323add6 | 440 | void tipc_bearer_schedule(struct bearer *b_ptr, struct link *l_ptr) |
b97bf3fd PL |
441 | { |
442 | spin_lock_bh(&b_ptr->publ.lock); | |
4323add6 | 443 | tipc_bearer_schedule_unlocked(b_ptr, l_ptr); |
b97bf3fd PL |
444 | spin_unlock_bh(&b_ptr->publ.lock); |
445 | } | |
446 | ||
447 | ||
448 | /* | |
4323add6 | 449 | * tipc_bearer_resolve_congestion(): Check if there is bearer congestion, |
b97bf3fd | 450 | * and if there is, try to resolve it before returning. |
4323add6 | 451 | * 'tipc_net_lock' is read_locked when this function is called |
b97bf3fd | 452 | */ |
4323add6 | 453 | int tipc_bearer_resolve_congestion(struct bearer *b_ptr, struct link *l_ptr) |
b97bf3fd PL |
454 | { |
455 | int res = 1; | |
456 | ||
457 | if (list_empty(&b_ptr->cong_links)) | |
458 | return 1; | |
459 | spin_lock_bh(&b_ptr->publ.lock); | |
460 | if (!bearer_push(b_ptr)) { | |
4323add6 | 461 | tipc_bearer_schedule_unlocked(b_ptr, l_ptr); |
b97bf3fd PL |
462 | res = 0; |
463 | } | |
464 | spin_unlock_bh(&b_ptr->publ.lock); | |
465 | return res; | |
466 | } | |
467 | ||
468 | ||
469 | /** | |
470 | * tipc_enable_bearer - enable bearer with the given name | |
c4307285 | 471 | */ |
b97bf3fd PL |
472 | |
473 | int tipc_enable_bearer(const char *name, u32 bcast_scope, u32 priority) | |
474 | { | |
475 | struct bearer *b_ptr; | |
476 | struct media *m_ptr; | |
477 | struct bearer_name b_name; | |
478 | char addr_string[16]; | |
479 | u32 bearer_id; | |
480 | u32 with_this_prio; | |
481 | u32 i; | |
482 | int res = -EINVAL; | |
483 | ||
a10bd924 AS |
484 | if (tipc_mode != TIPC_NET_MODE) { |
485 | warn("Bearer <%s> rejected, not supported in standalone mode\n", | |
486 | name); | |
b97bf3fd | 487 | return -ENOPROTOOPT; |
a10bd924 AS |
488 | } |
489 | if (!bearer_name_validate(name, &b_name)) { | |
490 | warn("Bearer <%s> rejected, illegal name\n", name); | |
16cb4b33 | 491 | return -EINVAL; |
a10bd924 | 492 | } |
c4307285 | 493 | if (!tipc_addr_domain_valid(bcast_scope) || |
a10bd924 AS |
494 | !in_scope(bcast_scope, tipc_own_addr)) { |
495 | warn("Bearer <%s> rejected, illegal broadcast scope\n", name); | |
496 | return -EINVAL; | |
497 | } | |
16cb4b33 PL |
498 | if ((priority < TIPC_MIN_LINK_PRI || |
499 | priority > TIPC_MAX_LINK_PRI) && | |
a10bd924 AS |
500 | (priority != TIPC_MEDIA_LINK_PRI)) { |
501 | warn("Bearer <%s> rejected, illegal priority\n", name); | |
b97bf3fd | 502 | return -EINVAL; |
a10bd924 | 503 | } |
b97bf3fd | 504 | |
4323add6 | 505 | write_lock_bh(&tipc_net_lock); |
b97bf3fd PL |
506 | |
507 | m_ptr = media_find(b_name.media_name); | |
508 | if (!m_ptr) { | |
a10bd924 AS |
509 | warn("Bearer <%s> rejected, media <%s> not registered\n", name, |
510 | b_name.media_name); | |
b97bf3fd PL |
511 | goto failed; |
512 | } | |
16cb4b33 PL |
513 | |
514 | if (priority == TIPC_MEDIA_LINK_PRI) | |
b97bf3fd PL |
515 | priority = m_ptr->priority; |
516 | ||
517 | restart: | |
518 | bearer_id = MAX_BEARERS; | |
519 | with_this_prio = 1; | |
520 | for (i = MAX_BEARERS; i-- != 0; ) { | |
4323add6 | 521 | if (!tipc_bearers[i].active) { |
b97bf3fd PL |
522 | bearer_id = i; |
523 | continue; | |
524 | } | |
4323add6 | 525 | if (!strcmp(name, tipc_bearers[i].publ.name)) { |
a10bd924 | 526 | warn("Bearer <%s> rejected, already enabled\n", name); |
b97bf3fd PL |
527 | goto failed; |
528 | } | |
4323add6 | 529 | if ((tipc_bearers[i].priority == priority) && |
b97bf3fd PL |
530 | (++with_this_prio > 2)) { |
531 | if (priority-- == 0) { | |
a10bd924 AS |
532 | warn("Bearer <%s> rejected, duplicate priority\n", |
533 | name); | |
b97bf3fd PL |
534 | goto failed; |
535 | } | |
a10bd924 | 536 | warn("Bearer <%s> priority adjustment required %u->%u\n", |
b97bf3fd PL |
537 | name, priority + 1, priority); |
538 | goto restart; | |
539 | } | |
540 | } | |
541 | if (bearer_id >= MAX_BEARERS) { | |
c4307285 | 542 | warn("Bearer <%s> rejected, bearer limit reached (%u)\n", |
a10bd924 | 543 | name, MAX_BEARERS); |
b97bf3fd PL |
544 | goto failed; |
545 | } | |
546 | ||
4323add6 | 547 | b_ptr = &tipc_bearers[bearer_id]; |
b97bf3fd PL |
548 | memset(b_ptr, 0, sizeof(struct bearer)); |
549 | ||
550 | strcpy(b_ptr->publ.name, name); | |
551 | res = m_ptr->enable_bearer(&b_ptr->publ); | |
552 | if (res) { | |
a10bd924 | 553 | warn("Bearer <%s> rejected, enable failure (%d)\n", name, -res); |
b97bf3fd PL |
554 | goto failed; |
555 | } | |
556 | ||
557 | b_ptr->identity = bearer_id; | |
558 | b_ptr->media = m_ptr; | |
559 | b_ptr->net_plane = bearer_id + 'A'; | |
560 | b_ptr->active = 1; | |
561 | b_ptr->detect_scope = bcast_scope; | |
562 | b_ptr->priority = priority; | |
563 | INIT_LIST_HEAD(&b_ptr->cong_links); | |
564 | INIT_LIST_HEAD(&b_ptr->links); | |
565 | if (m_ptr->bcast) { | |
4323add6 PL |
566 | b_ptr->link_req = tipc_disc_init_link_req(b_ptr, &m_ptr->bcast_addr, |
567 | bcast_scope, 2); | |
b97bf3fd | 568 | } |
34af946a | 569 | spin_lock_init(&b_ptr->publ.lock); |
4323add6 | 570 | write_unlock_bh(&tipc_net_lock); |
16cb4b33 PL |
571 | info("Enabled bearer <%s>, discovery domain %s, priority %u\n", |
572 | name, addr_string_fill(addr_string, bcast_scope), priority); | |
b97bf3fd PL |
573 | return 0; |
574 | failed: | |
4323add6 | 575 | write_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
576 | return res; |
577 | } | |
578 | ||
579 | /** | |
580 | * tipc_block_bearer(): Block the bearer with the given name, | |
581 | * and reset all its links | |
582 | */ | |
583 | ||
584 | int tipc_block_bearer(const char *name) | |
585 | { | |
1fc54d8f | 586 | struct bearer *b_ptr = NULL; |
b97bf3fd PL |
587 | struct link *l_ptr; |
588 | struct link *temp_l_ptr; | |
589 | ||
4323add6 | 590 | read_lock_bh(&tipc_net_lock); |
b97bf3fd PL |
591 | b_ptr = bearer_find(name); |
592 | if (!b_ptr) { | |
593 | warn("Attempt to block unknown bearer <%s>\n", name); | |
4323add6 | 594 | read_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
595 | return -EINVAL; |
596 | } | |
597 | ||
a10bd924 | 598 | info("Blocking bearer <%s>\n", name); |
b97bf3fd PL |
599 | spin_lock_bh(&b_ptr->publ.lock); |
600 | b_ptr->publ.blocked = 1; | |
601 | list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) { | |
6c00055a | 602 | struct tipc_node *n_ptr = l_ptr->owner; |
b97bf3fd PL |
603 | |
604 | spin_lock_bh(&n_ptr->lock); | |
4323add6 | 605 | tipc_link_reset(l_ptr); |
b97bf3fd PL |
606 | spin_unlock_bh(&n_ptr->lock); |
607 | } | |
608 | spin_unlock_bh(&b_ptr->publ.lock); | |
4323add6 | 609 | read_unlock_bh(&tipc_net_lock); |
0e35fd5e | 610 | return 0; |
b97bf3fd PL |
611 | } |
612 | ||
613 | /** | |
614 | * bearer_disable - | |
c4307285 | 615 | * |
4323add6 | 616 | * Note: This routine assumes caller holds tipc_net_lock. |
b97bf3fd PL |
617 | */ |
618 | ||
619 | static int bearer_disable(const char *name) | |
620 | { | |
621 | struct bearer *b_ptr; | |
622 | struct link *l_ptr; | |
623 | struct link *temp_l_ptr; | |
624 | ||
b97bf3fd PL |
625 | b_ptr = bearer_find(name); |
626 | if (!b_ptr) { | |
627 | warn("Attempt to disable unknown bearer <%s>\n", name); | |
628 | return -EINVAL; | |
629 | } | |
630 | ||
a10bd924 | 631 | info("Disabling bearer <%s>\n", name); |
4323add6 | 632 | tipc_disc_stop_link_req(b_ptr->link_req); |
b97bf3fd PL |
633 | spin_lock_bh(&b_ptr->publ.lock); |
634 | b_ptr->link_req = NULL; | |
635 | b_ptr->publ.blocked = 1; | |
636 | if (b_ptr->media->disable_bearer) { | |
637 | spin_unlock_bh(&b_ptr->publ.lock); | |
4323add6 | 638 | write_unlock_bh(&tipc_net_lock); |
b97bf3fd | 639 | b_ptr->media->disable_bearer(&b_ptr->publ); |
4323add6 | 640 | write_lock_bh(&tipc_net_lock); |
b97bf3fd PL |
641 | spin_lock_bh(&b_ptr->publ.lock); |
642 | } | |
643 | list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) { | |
4323add6 | 644 | tipc_link_delete(l_ptr); |
b97bf3fd PL |
645 | } |
646 | spin_unlock_bh(&b_ptr->publ.lock); | |
b97bf3fd | 647 | memset(b_ptr, 0, sizeof(struct bearer)); |
0e35fd5e | 648 | return 0; |
b97bf3fd PL |
649 | } |
650 | ||
651 | int tipc_disable_bearer(const char *name) | |
652 | { | |
653 | int res; | |
654 | ||
4323add6 | 655 | write_lock_bh(&tipc_net_lock); |
b97bf3fd | 656 | res = bearer_disable(name); |
4323add6 | 657 | write_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
658 | return res; |
659 | } | |
660 | ||
661 | ||
662 | ||
4323add6 | 663 | int tipc_bearer_init(void) |
b97bf3fd PL |
664 | { |
665 | int res; | |
666 | ||
4323add6 | 667 | write_lock_bh(&tipc_net_lock); |
0da974f4 PI |
668 | tipc_bearers = kcalloc(MAX_BEARERS, sizeof(struct bearer), GFP_ATOMIC); |
669 | media_list = kcalloc(MAX_MEDIA, sizeof(struct media), GFP_ATOMIC); | |
4323add6 | 670 | if (tipc_bearers && media_list) { |
0e35fd5e | 671 | res = 0; |
b97bf3fd | 672 | } else { |
4323add6 | 673 | kfree(tipc_bearers); |
b97bf3fd | 674 | kfree(media_list); |
1fc54d8f SR |
675 | tipc_bearers = NULL; |
676 | media_list = NULL; | |
b97bf3fd PL |
677 | res = -ENOMEM; |
678 | } | |
4323add6 | 679 | write_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
680 | return res; |
681 | } | |
682 | ||
4323add6 | 683 | void tipc_bearer_stop(void) |
b97bf3fd PL |
684 | { |
685 | u32 i; | |
686 | ||
4323add6 | 687 | if (!tipc_bearers) |
b97bf3fd PL |
688 | return; |
689 | ||
690 | for (i = 0; i < MAX_BEARERS; i++) { | |
4323add6 PL |
691 | if (tipc_bearers[i].active) |
692 | tipc_bearers[i].publ.blocked = 1; | |
b97bf3fd PL |
693 | } |
694 | for (i = 0; i < MAX_BEARERS; i++) { | |
4323add6 PL |
695 | if (tipc_bearers[i].active) |
696 | bearer_disable(tipc_bearers[i].publ.name); | |
b97bf3fd | 697 | } |
4323add6 | 698 | kfree(tipc_bearers); |
b97bf3fd | 699 | kfree(media_list); |
1fc54d8f SR |
700 | tipc_bearers = NULL; |
701 | media_list = NULL; | |
b97bf3fd PL |
702 | media_count = 0; |
703 | } | |
704 | ||
705 |