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 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. * media_find - locates specified media object by name
  60. */
  61. static struct media *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 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 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.type != htonl(m_ptr->type_id))
  94. goto exit;
  95. if (m_ptr->priority > TIPC_MAX_LINK_PRI)
  96. goto exit;
  97. if ((m_ptr->tolerance < TIPC_MIN_LINK_TOL) ||
  98. (m_ptr->tolerance > TIPC_MAX_LINK_TOL))
  99. goto exit;
  100. if (media_count >= MAX_MEDIA)
  101. goto exit;
  102. if (media_find(m_ptr->name) || media_find_id(m_ptr->type_id))
  103. goto exit;
  104. media_list[media_count] = m_ptr;
  105. media_count++;
  106. res = 0;
  107. exit:
  108. write_unlock_bh(&tipc_net_lock);
  109. if (res)
  110. warn("Media <%s> registration error\n", m_ptr->name);
  111. return res;
  112. }
  113. /**
  114. * tipc_media_addr_printf - record media address in print buffer
  115. */
  116. void tipc_media_addr_printf(struct print_buf *pb, struct tipc_media_addr *a)
  117. {
  118. struct media *m_ptr;
  119. u32 media_type;
  120. u32 i;
  121. media_type = ntohl(a->type);
  122. m_ptr = media_find_id(media_type);
  123. if (m_ptr && (m_ptr->addr2str != NULL)) {
  124. char addr_str[MAX_ADDR_STR];
  125. tipc_printf(pb, "%s(%s)", m_ptr->name,
  126. m_ptr->addr2str(a, addr_str, sizeof(addr_str)));
  127. } else {
  128. unchar *addr = (unchar *)&a->dev_addr;
  129. tipc_printf(pb, "UNKNOWN(%u)", media_type);
  130. for (i = 0; i < (sizeof(*a) - sizeof(a->type)); i++)
  131. tipc_printf(pb, "-%02x", addr[i]);
  132. }
  133. }
  134. /**
  135. * tipc_media_get_names - record names of registered media in buffer
  136. */
  137. struct sk_buff *tipc_media_get_names(void)
  138. {
  139. struct sk_buff *buf;
  140. int i;
  141. buf = tipc_cfg_reply_alloc(MAX_MEDIA * TLV_SPACE(TIPC_MAX_MEDIA_NAME));
  142. if (!buf)
  143. return NULL;
  144. read_lock_bh(&tipc_net_lock);
  145. for (i = 0; i < media_count; i++) {
  146. tipc_cfg_append_tlv(buf, TIPC_TLV_MEDIA_NAME,
  147. media_list[i]->name,
  148. strlen(media_list[i]->name) + 1);
  149. }
  150. read_unlock_bh(&tipc_net_lock);
  151. return buf;
  152. }
  153. /**
  154. * bearer_name_validate - validate & (optionally) deconstruct bearer name
  155. * @name - ptr to bearer name string
  156. * @name_parts - ptr to area for bearer name components (or NULL if not needed)
  157. *
  158. * Returns 1 if bearer name is valid, otherwise 0.
  159. */
  160. static int bearer_name_validate(const char *name,
  161. struct bearer_name *name_parts)
  162. {
  163. char name_copy[TIPC_MAX_BEARER_NAME];
  164. char *media_name;
  165. char *if_name;
  166. u32 media_len;
  167. u32 if_len;
  168. /* copy bearer name & ensure length is OK */
  169. name_copy[TIPC_MAX_BEARER_NAME - 1] = 0;
  170. /* need above in case non-Posix strncpy() doesn't pad with nulls */
  171. strncpy(name_copy, name, TIPC_MAX_BEARER_NAME);
  172. if (name_copy[TIPC_MAX_BEARER_NAME - 1] != 0)
  173. return 0;
  174. /* ensure all component parts of bearer name are present */
  175. media_name = name_copy;
  176. if_name = strchr(media_name, ':');
  177. if (if_name == NULL)
  178. return 0;
  179. *(if_name++) = 0;
  180. media_len = if_name - media_name;
  181. if_len = strlen(if_name) + 1;
  182. /* validate component parts of bearer name */
  183. if ((media_len <= 1) || (media_len > TIPC_MAX_MEDIA_NAME) ||
  184. (if_len <= 1) || (if_len > TIPC_MAX_IF_NAME) ||
  185. (strspn(media_name, tipc_alphabet) != (media_len - 1)) ||
  186. (strspn(if_name, tipc_alphabet) != (if_len - 1)))
  187. return 0;
  188. /* return bearer name components, if necessary */
  189. if (name_parts) {
  190. strcpy(name_parts->media_name, media_name);
  191. strcpy(name_parts->if_name, if_name);
  192. }
  193. return 1;
  194. }
  195. /**
  196. * bearer_find - locates bearer object with matching bearer name
  197. */
  198. static struct tipc_bearer *bearer_find(const char *name)
  199. {
  200. struct tipc_bearer *b_ptr;
  201. u32 i;
  202. for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) {
  203. if (b_ptr->active && (!strcmp(b_ptr->name, name)))
  204. return b_ptr;
  205. }
  206. return NULL;
  207. }
  208. /**
  209. * tipc_bearer_find_interface - locates bearer object with matching interface name
  210. */
  211. struct tipc_bearer *tipc_bearer_find_interface(const char *if_name)
  212. {
  213. struct tipc_bearer *b_ptr;
  214. char *b_if_name;
  215. u32 i;
  216. for (i = 0, b_ptr = tipc_bearers; i < MAX_BEARERS; i++, b_ptr++) {
  217. if (!b_ptr->active)
  218. continue;
  219. b_if_name = strchr(b_ptr->name, ':') + 1;
  220. if (!strcmp(b_if_name, if_name))
  221. return b_ptr;
  222. }
  223. return NULL;
  224. }
  225. /**
  226. * tipc_bearer_get_names - record names of bearers in buffer
  227. */
  228. struct sk_buff *tipc_bearer_get_names(void)
  229. {
  230. struct sk_buff *buf;
  231. struct tipc_bearer *b_ptr;
  232. int i, j;
  233. buf = tipc_cfg_reply_alloc(MAX_BEARERS * TLV_SPACE(TIPC_MAX_BEARER_NAME));
  234. if (!buf)
  235. return NULL;
  236. read_lock_bh(&tipc_net_lock);
  237. for (i = 0; i < media_count; i++) {
  238. for (j = 0; j < MAX_BEARERS; j++) {
  239. b_ptr = &tipc_bearers[j];
  240. if (b_ptr->active && (b_ptr->media == media_list[i])) {
  241. tipc_cfg_append_tlv(buf, TIPC_TLV_BEARER_NAME,
  242. b_ptr->name,
  243. strlen(b_ptr->name) + 1);
  244. }
  245. }
  246. }
  247. read_unlock_bh(&tipc_net_lock);
  248. return buf;
  249. }
  250. void tipc_bearer_add_dest(struct tipc_bearer *b_ptr, u32 dest)
  251. {
  252. tipc_nmap_add(&b_ptr->nodes, dest);
  253. tipc_bcbearer_sort();
  254. tipc_disc_add_dest(b_ptr->link_req);
  255. }
  256. void tipc_bearer_remove_dest(struct tipc_bearer *b_ptr, u32 dest)
  257. {
  258. tipc_nmap_remove(&b_ptr->nodes, dest);
  259. tipc_bcbearer_sort();
  260. tipc_disc_remove_dest(b_ptr->link_req);
  261. }
  262. /*
  263. * bearer_push(): Resolve bearer congestion. Force the waiting
  264. * links to push out their unsent packets, one packet per link
  265. * per iteration, until all packets are gone or congestion reoccurs.
  266. * 'tipc_net_lock' is read_locked when this function is called
  267. * bearer.lock must be taken before calling
  268. * Returns binary true(1) ore false(0)
  269. */
  270. static int bearer_push(struct tipc_bearer *b_ptr)
  271. {
  272. u32 res = 0;
  273. struct link *ln, *tln;
  274. if (b_ptr->blocked)
  275. return 0;
  276. while (!list_empty(&b_ptr->cong_links) && (res != PUSH_FAILED)) {
  277. list_for_each_entry_safe(ln, tln, &b_ptr->cong_links, link_list) {
  278. res = tipc_link_push_packet(ln);
  279. if (res == PUSH_FAILED)
  280. break;
  281. if (res == PUSH_FINISHED)
  282. list_move_tail(&ln->link_list, &b_ptr->links);
  283. }
  284. }
  285. return list_empty(&b_ptr->cong_links);
  286. }
  287. void tipc_bearer_lock_push(struct tipc_bearer *b_ptr)
  288. {
  289. spin_lock_bh(&b_ptr->lock);
  290. bearer_push(b_ptr);
  291. spin_unlock_bh(&b_ptr->lock);
  292. }
  293. /*
  294. * Interrupt enabling new requests after bearer congestion or blocking:
  295. * See bearer_send().
  296. */
  297. void tipc_continue(struct tipc_bearer *b_ptr)
  298. {
  299. spin_lock_bh(&b_ptr->lock);
  300. if (!list_empty(&b_ptr->cong_links))
  301. tipc_k_signal((Handler)tipc_bearer_lock_push, (unsigned long)b_ptr);
  302. b_ptr->blocked = 0;
  303. spin_unlock_bh(&b_ptr->lock);
  304. }
  305. /*
  306. * Schedule link for sending of messages after the bearer
  307. * has been deblocked by 'continue()'. This method is called
  308. * when somebody tries to send a message via this link while
  309. * the bearer is congested. 'tipc_net_lock' is in read_lock here
  310. * bearer.lock is busy
  311. */
  312. static void tipc_bearer_schedule_unlocked(struct tipc_bearer *b_ptr, struct link *l_ptr)
  313. {
  314. list_move_tail(&l_ptr->link_list, &b_ptr->cong_links);
  315. }
  316. /*
  317. * Schedule link for sending of messages after the bearer
  318. * has been deblocked by 'continue()'. This method is called
  319. * when somebody tries to send a message via this link while
  320. * the bearer is congested. 'tipc_net_lock' is in read_lock here,
  321. * bearer.lock is free
  322. */
  323. void tipc_bearer_schedule(struct tipc_bearer *b_ptr, struct link *l_ptr)
  324. {
  325. spin_lock_bh(&b_ptr->lock);
  326. tipc_bearer_schedule_unlocked(b_ptr, l_ptr);
  327. spin_unlock_bh(&b_ptr->lock);
  328. }
  329. /*
  330. * tipc_bearer_resolve_congestion(): Check if there is bearer congestion,
  331. * and if there is, try to resolve it before returning.
  332. * 'tipc_net_lock' is read_locked when this function is called
  333. */
  334. int tipc_bearer_resolve_congestion(struct tipc_bearer *b_ptr, struct link *l_ptr)
  335. {
  336. int res = 1;
  337. if (list_empty(&b_ptr->cong_links))
  338. return 1;
  339. spin_lock_bh(&b_ptr->lock);
  340. if (!bearer_push(b_ptr)) {
  341. tipc_bearer_schedule_unlocked(b_ptr, l_ptr);
  342. res = 0;
  343. }
  344. spin_unlock_bh(&b_ptr->lock);
  345. return res;
  346. }
  347. /**
  348. * tipc_bearer_congested - determines if bearer is currently congested
  349. */
  350. int tipc_bearer_congested(struct tipc_bearer *b_ptr, struct link *l_ptr)
  351. {
  352. if (unlikely(b_ptr->blocked))
  353. return 1;
  354. if (likely(list_empty(&b_ptr->cong_links)))
  355. return 0;
  356. return !tipc_bearer_resolve_congestion(b_ptr, l_ptr);
  357. }
  358. /**
  359. * tipc_enable_bearer - enable bearer with the given name
  360. */
  361. int tipc_enable_bearer(const char *name, u32 disc_domain, u32 priority)
  362. {
  363. struct tipc_bearer *b_ptr;
  364. struct media *m_ptr;
  365. struct bearer_name b_name;
  366. char addr_string[16];
  367. u32 bearer_id;
  368. u32 with_this_prio;
  369. u32 i;
  370. int res = -EINVAL;
  371. if (tipc_mode != TIPC_NET_MODE) {
  372. warn("Bearer <%s> rejected, not supported in standalone mode\n",
  373. name);
  374. return -ENOPROTOOPT;
  375. }
  376. if (!bearer_name_validate(name, &b_name)) {
  377. warn("Bearer <%s> rejected, illegal name\n", name);
  378. return -EINVAL;
  379. }
  380. if (tipc_addr_domain_valid(disc_domain) &&
  381. (disc_domain != tipc_own_addr)) {
  382. if (tipc_in_scope(disc_domain, tipc_own_addr)) {
  383. disc_domain = tipc_own_addr & TIPC_CLUSTER_MASK;
  384. res = 0; /* accept any node in own cluster */
  385. } else if (in_own_cluster(disc_domain))
  386. res = 0; /* accept specified node in own cluster */
  387. }
  388. if (res) {
  389. warn("Bearer <%s> rejected, illegal discovery domain\n", name);
  390. return -EINVAL;
  391. }
  392. if ((priority < TIPC_MIN_LINK_PRI ||
  393. priority > TIPC_MAX_LINK_PRI) &&
  394. (priority != TIPC_MEDIA_LINK_PRI)) {
  395. warn("Bearer <%s> rejected, illegal priority\n", name);
  396. return -EINVAL;
  397. }
  398. write_lock_bh(&tipc_net_lock);
  399. m_ptr = media_find(b_name.media_name);
  400. if (!m_ptr) {
  401. warn("Bearer <%s> rejected, media <%s> not registered\n", name,
  402. b_name.media_name);
  403. goto exit;
  404. }
  405. if (priority == TIPC_MEDIA_LINK_PRI)
  406. priority = m_ptr->priority;
  407. restart:
  408. bearer_id = MAX_BEARERS;
  409. with_this_prio = 1;
  410. for (i = MAX_BEARERS; i-- != 0; ) {
  411. if (!tipc_bearers[i].active) {
  412. bearer_id = i;
  413. continue;
  414. }
  415. if (!strcmp(name, tipc_bearers[i].name)) {
  416. warn("Bearer <%s> rejected, already enabled\n", name);
  417. goto exit;
  418. }
  419. if ((tipc_bearers[i].priority == priority) &&
  420. (++with_this_prio > 2)) {
  421. if (priority-- == 0) {
  422. warn("Bearer <%s> rejected, duplicate priority\n",
  423. name);
  424. goto exit;
  425. }
  426. warn("Bearer <%s> priority adjustment required %u->%u\n",
  427. name, priority + 1, priority);
  428. goto restart;
  429. }
  430. }
  431. if (bearer_id >= MAX_BEARERS) {
  432. warn("Bearer <%s> rejected, bearer limit reached (%u)\n",
  433. name, MAX_BEARERS);
  434. goto exit;
  435. }
  436. b_ptr = &tipc_bearers[bearer_id];
  437. strcpy(b_ptr->name, name);
  438. res = m_ptr->enable_bearer(b_ptr);
  439. if (res) {
  440. warn("Bearer <%s> rejected, enable failure (%d)\n", name, -res);
  441. goto exit;
  442. }
  443. b_ptr->identity = bearer_id;
  444. b_ptr->media = m_ptr;
  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 link *l_ptr;
  472. struct link *temp_l_ptr;
  473. read_lock_bh(&tipc_net_lock);
  474. b_ptr = 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 link *l_ptr;
  502. struct 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 = 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. }