Merge branch 'topic/asoc' into for-linus
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / net / tipc / bearer.c
blob9927d1d56c4f1f8e2a015752be33b781c6ea6480
1 /*
2 * net/tipc/bearer.c: TIPC bearer code
4 * Copyright (c) 1996-2006, Ericsson AB
5 * Copyright (c) 2004-2006, Wind River Systems
6 * All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
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.
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.
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
34 * POSSIBILITY OF SUCH DAMAGE.
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"
46 #define MAX_ADDR_STR 32
48 static struct media media_list[MAX_MEDIA];
49 static u32 media_count = 0;
51 struct bearer tipc_bearers[MAX_BEARERS];
53 /**
54 * media_name_valid - validate media name
56 * Returns 1 if media name is valid, otherwise 0.
59 static int media_name_valid(const char *name)
61 u32 len;
63 len = strlen(name);
64 if ((len + 1) > TIPC_MAX_MEDIA_NAME)
65 return 0;
66 return strspn(name, tipc_alphabet) == len;
69 /**
70 * media_find - locates specified media object by name
73 static struct media *media_find(const char *name)
75 struct media *m_ptr;
76 u32 i;
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;
82 return NULL;
85 /**
86 * tipc_register_media - register a media type
88 * Bearers for this media type must be activated separately at a later stage.
91 int tipc_register_media(u32 media_type,
92 char *name,
93 int (*enable)(struct tipc_bearer *),
94 void (*disable)(struct tipc_bearer *),
95 int (*send_msg)(struct sk_buff *,
96 struct tipc_bearer *,
97 struct tipc_media_addr *),
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)
105 struct media *m_ptr;
106 u32 media_id;
107 u32 i;
108 int res = -EINVAL;
110 write_lock_bh(&tipc_net_lock);
112 if (tipc_mode != TIPC_NET_MODE) {
113 warn("Media <%s> rejected, not in networked mode yet\n", name);
114 goto exit;
116 if (!media_name_valid(name)) {
117 warn("Media <%s> rejected, illegal name\n", name);
118 goto exit;
120 if (!bcast_addr) {
121 warn("Media <%s> rejected, no broadcast address\n", name);
122 goto exit;
124 if ((bearer_priority < TIPC_MIN_LINK_PRI) ||
125 (bearer_priority > TIPC_MAX_LINK_PRI)) {
126 warn("Media <%s> rejected, illegal priority (%u)\n", name,
127 bearer_priority);
128 goto exit;
130 if ((link_tolerance < TIPC_MIN_LINK_TOL) ||
131 (link_tolerance > TIPC_MAX_LINK_TOL)) {
132 warn("Media <%s> rejected, illegal tolerance (%u)\n", name,
133 link_tolerance);
134 goto exit;
137 media_id = media_count++;
138 if (media_id >= MAX_MEDIA) {
139 warn("Media <%s> rejected, media limit reached (%u)\n", name,
140 MAX_MEDIA);
141 media_count--;
142 goto exit;
144 for (i = 0; i < media_id; i++) {
145 if (media_list[i].type_id == media_type) {
146 warn("Media <%s> rejected, duplicate type (%u)\n", name,
147 media_type);
148 media_count--;
149 goto exit;
151 if (!strcmp(name, media_list[i].name)) {
152 warn("Media <%s> rejected, duplicate name\n", name);
153 media_count--;
154 goto exit;
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;
172 exit:
173 write_unlock_bh(&tipc_net_lock);
174 return res;
178 * tipc_media_addr_printf - record media address in print buffer
181 void tipc_media_addr_printf(struct print_buf *pb, struct tipc_media_addr *a)
183 struct media *m_ptr;
184 u32 media_type;
185 u32 i;
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;
193 if ((i < media_count) && (m_ptr->addr2str != NULL)) {
194 char addr_str[MAX_ADDR_STR];
196 tipc_printf(pb, "%s(%s)", m_ptr->name,
197 m_ptr->addr2str(a, addr_str, sizeof(addr_str)));
198 } else {
199 unchar *addr = (unchar *)&a->dev_addr;
201 tipc_printf(pb, "UNKNOWN(%u)", media_type);
202 for (i = 0; i < (sizeof(*a) - sizeof(a->type)); i++) {
203 tipc_printf(pb, "-%02x", addr[i]);
209 * tipc_media_get_names - record names of registered media in buffer
212 struct sk_buff *tipc_media_get_names(void)
214 struct sk_buff *buf;
215 struct media *m_ptr;
216 int i;
218 buf = tipc_cfg_reply_alloc(MAX_MEDIA * TLV_SPACE(TIPC_MAX_MEDIA_NAME));
219 if (!buf)
220 return NULL;
222 read_lock_bh(&tipc_net_lock);
223 for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
224 tipc_cfg_append_tlv(buf, TIPC_TLV_MEDIA_NAME, m_ptr->name,
225 strlen(m_ptr->name) + 1);
227 read_unlock_bh(&tipc_net_lock);
228 return buf;
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)
236 * Returns 1 if bearer name is valid, otherwise 0.
239 static int bearer_name_validate(const char *name,
240 struct bearer_name *name_parts)
242 char name_copy[TIPC_MAX_BEARER_NAME];
243 char *media_name;
244 char *if_name;
245 u32 media_len;
246 u32 if_len;
248 /* copy bearer name & ensure length is OK */
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;
256 /* ensure all component parts of bearer name are present */
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;
265 /* validate component parts of bearer name */
267 if ((media_len <= 1) || (media_len > TIPC_MAX_MEDIA_NAME) ||
268 (if_len <= 1) || (if_len > TIPC_MAX_IF_NAME) ||
269 (strspn(media_name, tipc_alphabet) != (media_len - 1)) ||
270 (strspn(if_name, tipc_alphabet) != (if_len - 1)))
271 return 0;
273 /* return bearer name components, if necessary */
275 if (name_parts) {
276 strcpy(name_parts->media_name, media_name);
277 strcpy(name_parts->if_name, if_name);
279 return 1;
283 * bearer_find - locates bearer object with matching bearer name
286 static struct bearer *bearer_find(const char *name)
288 struct bearer *b_ptr;
289 u32 i;
291 for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) {
292 if (b_ptr->active && (!strcmp(b_ptr->publ.name, name)))
293 return b_ptr;
295 return NULL;
299 * tipc_bearer_find_interface - locates bearer object with matching interface name
302 struct bearer *tipc_bearer_find_interface(const char *if_name)
304 struct bearer *b_ptr;
305 char *b_if_name;
306 u32 i;
308 for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) {
309 if (!b_ptr->active)
310 continue;
311 b_if_name = strchr(b_ptr->publ.name, ':') + 1;
312 if (!strcmp(b_if_name, if_name))
313 return b_ptr;
315 return NULL;
319 * tipc_bearer_get_names - record names of bearers in buffer
322 struct sk_buff *tipc_bearer_get_names(void)
324 struct sk_buff *buf;
325 struct media *m_ptr;
326 struct bearer *b_ptr;
327 int i, j;
329 buf = tipc_cfg_reply_alloc(MAX_BEARERS * TLV_SPACE(TIPC_MAX_BEARER_NAME));
330 if (!buf)
331 return NULL;
333 read_lock_bh(&tipc_net_lock);
334 for (i = 0, m_ptr = media_list; i < media_count; i++, m_ptr++) {
335 for (j = 0; j < MAX_BEARERS; j++) {
336 b_ptr = &tipc_bearers[j];
337 if (b_ptr->active && (b_ptr->media == m_ptr)) {
338 tipc_cfg_append_tlv(buf, TIPC_TLV_BEARER_NAME,
339 b_ptr->publ.name,
340 strlen(b_ptr->publ.name) + 1);
344 read_unlock_bh(&tipc_net_lock);
345 return buf;
348 void tipc_bearer_add_dest(struct bearer *b_ptr, u32 dest)
350 tipc_nmap_add(&b_ptr->nodes, dest);
351 tipc_disc_update_link_req(b_ptr->link_req);
352 tipc_bcbearer_sort();
355 void tipc_bearer_remove_dest(struct bearer *b_ptr, u32 dest)
357 tipc_nmap_remove(&b_ptr->nodes, dest);
358 tipc_disc_update_link_req(b_ptr->link_req);
359 tipc_bcbearer_sort();
363 * bearer_push(): Resolve bearer congestion. Force the waiting
364 * links to push out their unsent packets, one packet per link
365 * per iteration, until all packets are gone or congestion reoccurs.
366 * 'tipc_net_lock' is read_locked when this function is called
367 * bearer.lock must be taken before calling
368 * Returns binary true(1) ore false(0)
370 static int bearer_push(struct bearer *b_ptr)
372 u32 res = 0;
373 struct link *ln, *tln;
375 if (b_ptr->publ.blocked)
376 return 0;
378 while (!list_empty(&b_ptr->cong_links) && (res != PUSH_FAILED)) {
379 list_for_each_entry_safe(ln, tln, &b_ptr->cong_links, link_list) {
380 res = tipc_link_push_packet(ln);
381 if (res == PUSH_FAILED)
382 break;
383 if (res == PUSH_FINISHED)
384 list_move_tail(&ln->link_list, &b_ptr->links);
387 return list_empty(&b_ptr->cong_links);
390 void tipc_bearer_lock_push(struct bearer *b_ptr)
392 int res;
394 spin_lock_bh(&b_ptr->publ.lock);
395 res = bearer_push(b_ptr);
396 spin_unlock_bh(&b_ptr->publ.lock);
397 if (res)
398 tipc_bcbearer_push();
403 * Interrupt enabling new requests after bearer congestion or blocking:
404 * See bearer_send().
406 void tipc_continue(struct tipc_bearer *tb_ptr)
408 struct bearer *b_ptr = (struct bearer *)tb_ptr;
410 spin_lock_bh(&b_ptr->publ.lock);
411 b_ptr->continue_count++;
412 if (!list_empty(&b_ptr->cong_links))
413 tipc_k_signal((Handler)tipc_bearer_lock_push, (unsigned long)b_ptr);
414 b_ptr->publ.blocked = 0;
415 spin_unlock_bh(&b_ptr->publ.lock);
419 * Schedule link for sending of messages after the bearer
420 * has been deblocked by 'continue()'. This method is called
421 * when somebody tries to send a message via this link while
422 * the bearer is congested. 'tipc_net_lock' is in read_lock here
423 * bearer.lock is busy
426 static void tipc_bearer_schedule_unlocked(struct bearer *b_ptr, struct link *l_ptr)
428 list_move_tail(&l_ptr->link_list, &b_ptr->cong_links);
432 * Schedule link for sending of messages after the bearer
433 * has been deblocked by 'continue()'. This method is called
434 * when somebody tries to send a message via this link while
435 * the bearer is congested. 'tipc_net_lock' is in read_lock here,
436 * bearer.lock is free
439 void tipc_bearer_schedule(struct bearer *b_ptr, struct link *l_ptr)
441 spin_lock_bh(&b_ptr->publ.lock);
442 tipc_bearer_schedule_unlocked(b_ptr, l_ptr);
443 spin_unlock_bh(&b_ptr->publ.lock);
448 * tipc_bearer_resolve_congestion(): Check if there is bearer congestion,
449 * and if there is, try to resolve it before returning.
450 * 'tipc_net_lock' is read_locked when this function is called
452 int tipc_bearer_resolve_congestion(struct bearer *b_ptr, struct link *l_ptr)
454 int res = 1;
456 if (list_empty(&b_ptr->cong_links))
457 return 1;
458 spin_lock_bh(&b_ptr->publ.lock);
459 if (!bearer_push(b_ptr)) {
460 tipc_bearer_schedule_unlocked(b_ptr, l_ptr);
461 res = 0;
463 spin_unlock_bh(&b_ptr->publ.lock);
464 return res;
468 * tipc_bearer_congested - determines if bearer is currently congested
471 int tipc_bearer_congested(struct bearer *b_ptr, struct link *l_ptr)
473 if (unlikely(b_ptr->publ.blocked))
474 return 1;
475 if (likely(list_empty(&b_ptr->cong_links)))
476 return 0;
477 return !tipc_bearer_resolve_congestion(b_ptr, l_ptr);
481 * tipc_enable_bearer - enable bearer with the given name
484 int tipc_enable_bearer(const char *name, u32 bcast_scope, u32 priority)
486 struct bearer *b_ptr;
487 struct media *m_ptr;
488 struct bearer_name b_name;
489 char addr_string[16];
490 u32 bearer_id;
491 u32 with_this_prio;
492 u32 i;
493 int res = -EINVAL;
495 if (tipc_mode != TIPC_NET_MODE) {
496 warn("Bearer <%s> rejected, not supported in standalone mode\n",
497 name);
498 return -ENOPROTOOPT;
500 if (!bearer_name_validate(name, &b_name)) {
501 warn("Bearer <%s> rejected, illegal name\n", name);
502 return -EINVAL;
504 if (!tipc_addr_domain_valid(bcast_scope) ||
505 !tipc_in_scope(bcast_scope, tipc_own_addr)) {
506 warn("Bearer <%s> rejected, illegal broadcast scope\n", name);
507 return -EINVAL;
509 if ((priority < TIPC_MIN_LINK_PRI ||
510 priority > TIPC_MAX_LINK_PRI) &&
511 (priority != TIPC_MEDIA_LINK_PRI)) {
512 warn("Bearer <%s> rejected, illegal priority\n", name);
513 return -EINVAL;
516 write_lock_bh(&tipc_net_lock);
518 m_ptr = media_find(b_name.media_name);
519 if (!m_ptr) {
520 warn("Bearer <%s> rejected, media <%s> not registered\n", name,
521 b_name.media_name);
522 goto failed;
525 if (priority == TIPC_MEDIA_LINK_PRI)
526 priority = m_ptr->priority;
528 restart:
529 bearer_id = MAX_BEARERS;
530 with_this_prio = 1;
531 for (i = MAX_BEARERS; i-- != 0; ) {
532 if (!tipc_bearers[i].active) {
533 bearer_id = i;
534 continue;
536 if (!strcmp(name, tipc_bearers[i].publ.name)) {
537 warn("Bearer <%s> rejected, already enabled\n", name);
538 goto failed;
540 if ((tipc_bearers[i].priority == priority) &&
541 (++with_this_prio > 2)) {
542 if (priority-- == 0) {
543 warn("Bearer <%s> rejected, duplicate priority\n",
544 name);
545 goto failed;
547 warn("Bearer <%s> priority adjustment required %u->%u\n",
548 name, priority + 1, priority);
549 goto restart;
552 if (bearer_id >= MAX_BEARERS) {
553 warn("Bearer <%s> rejected, bearer limit reached (%u)\n",
554 name, MAX_BEARERS);
555 goto failed;
558 b_ptr = &tipc_bearers[bearer_id];
559 strcpy(b_ptr->publ.name, name);
560 res = m_ptr->enable_bearer(&b_ptr->publ);
561 if (res) {
562 warn("Bearer <%s> rejected, enable failure (%d)\n", name, -res);
563 goto failed;
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;
570 b_ptr->detect_scope = bcast_scope;
571 b_ptr->priority = priority;
572 INIT_LIST_HEAD(&b_ptr->cong_links);
573 INIT_LIST_HEAD(&b_ptr->links);
574 if (m_ptr->bcast) {
575 b_ptr->link_req = tipc_disc_init_link_req(b_ptr, &m_ptr->bcast_addr,
576 bcast_scope, 2);
578 spin_lock_init(&b_ptr->publ.lock);
579 write_unlock_bh(&tipc_net_lock);
580 info("Enabled bearer <%s>, discovery domain %s, priority %u\n",
581 name, tipc_addr_string_fill(addr_string, bcast_scope), priority);
582 return 0;
583 failed:
584 write_unlock_bh(&tipc_net_lock);
585 return res;
589 * tipc_block_bearer(): Block the bearer with the given name,
590 * and reset all its links
593 int tipc_block_bearer(const char *name)
595 struct bearer *b_ptr = NULL;
596 struct link *l_ptr;
597 struct link *temp_l_ptr;
599 read_lock_bh(&tipc_net_lock);
600 b_ptr = bearer_find(name);
601 if (!b_ptr) {
602 warn("Attempt to block unknown bearer <%s>\n", name);
603 read_unlock_bh(&tipc_net_lock);
604 return -EINVAL;
607 info("Blocking bearer <%s>\n", name);
608 spin_lock_bh(&b_ptr->publ.lock);
609 b_ptr->publ.blocked = 1;
610 list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) {
611 struct tipc_node *n_ptr = l_ptr->owner;
613 spin_lock_bh(&n_ptr->lock);
614 tipc_link_reset(l_ptr);
615 spin_unlock_bh(&n_ptr->lock);
617 spin_unlock_bh(&b_ptr->publ.lock);
618 read_unlock_bh(&tipc_net_lock);
619 return 0;
623 * bearer_disable -
625 * Note: This routine assumes caller holds tipc_net_lock.
628 static int bearer_disable(struct bearer *b_ptr)
630 struct link *l_ptr;
631 struct link *temp_l_ptr;
633 info("Disabling bearer <%s>\n", b_ptr->publ.name);
634 tipc_disc_stop_link_req(b_ptr->link_req);
635 spin_lock_bh(&b_ptr->publ.lock);
636 b_ptr->link_req = NULL;
637 b_ptr->publ.blocked = 1;
638 b_ptr->media->disable_bearer(&b_ptr->publ);
639 list_for_each_entry_safe(l_ptr, temp_l_ptr, &b_ptr->links, link_list) {
640 tipc_link_delete(l_ptr);
642 spin_unlock_bh(&b_ptr->publ.lock);
643 memset(b_ptr, 0, sizeof(struct bearer));
644 return 0;
647 int tipc_disable_bearer(const char *name)
649 struct bearer *b_ptr;
650 int res;
652 write_lock_bh(&tipc_net_lock);
653 b_ptr = bearer_find(name);
654 if (b_ptr == NULL) {
655 warn("Attempt to disable unknown bearer <%s>\n", name);
656 res = -EINVAL;
657 } else
658 res = bearer_disable(b_ptr);
659 write_unlock_bh(&tipc_net_lock);
660 return res;
665 void tipc_bearer_stop(void)
667 u32 i;
669 for (i = 0; i < MAX_BEARERS; i++) {
670 if (tipc_bearers[i].active)
671 bearer_disable(&tipc_bearers[i]);
673 media_count = 0;