bearer.c 15 KB

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