bearer.c 16 KB

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