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