bearer.c 17 KB

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