bcast.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831
  1. /*
  2. * net/tipc/bcast.c: TIPC broadcast code
  3. *
  4. * Copyright (c) 2004-2006, Ericsson AB
  5. * Copyright (c) 2004, Intel Corporation.
  6. * Copyright (c) 2005, Wind River Systems
  7. * All rights reserved.
  8. *
  9. * Redistribution and use in source and binary forms, with or without
  10. * modification, are permitted provided that the following conditions are met:
  11. *
  12. * 1. Redistributions of source code must retain the above copyright
  13. * notice, this list of conditions and the following disclaimer.
  14. * 2. Redistributions in binary form must reproduce the above copyright
  15. * notice, this list of conditions and the following disclaimer in the
  16. * documentation and/or other materials provided with the distribution.
  17. * 3. Neither the names of the copyright holders nor the names of its
  18. * contributors may be used to endorse or promote products derived from
  19. * this software without specific prior written permission.
  20. *
  21. * Alternatively, this software may be distributed under the terms of the
  22. * GNU General Public License ("GPL") version 2 as published by the Free
  23. * Software Foundation.
  24. *
  25. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  26. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  27. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  28. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  29. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  30. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  31. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  32. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  33. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  34. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  35. * POSSIBILITY OF SUCH DAMAGE.
  36. */
  37. #include "core.h"
  38. #include "msg.h"
  39. #include "dbg.h"
  40. #include "link.h"
  41. #include "net.h"
  42. #include "node.h"
  43. #include "port.h"
  44. #include "addr.h"
  45. #include "node_subscr.h"
  46. #include "name_distr.h"
  47. #include "bearer.h"
  48. #include "name_table.h"
  49. #include "bcast.h"
  50. #define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */
  51. #define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */
  52. #define BCLINK_LOG_BUF_SIZE 0
  53. /*
  54. * Loss rate for incoming broadcast frames; used to test retransmission code.
  55. * Set to N to cause every N'th frame to be discarded; 0 => don't discard any.
  56. */
  57. #define TIPC_BCAST_LOSS_RATE 0
  58. /**
  59. * struct bcbearer_pair - a pair of bearers used by broadcast link
  60. * @primary: pointer to primary bearer
  61. * @secondary: pointer to secondary bearer
  62. *
  63. * Bearers must have same priority and same set of reachable destinations
  64. * to be paired.
  65. */
  66. struct bcbearer_pair {
  67. struct bearer *primary;
  68. struct bearer *secondary;
  69. };
  70. /**
  71. * struct bcbearer - bearer used by broadcast link
  72. * @bearer: (non-standard) broadcast bearer structure
  73. * @media: (non-standard) broadcast media structure
  74. * @bpairs: array of bearer pairs
  75. * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort()
  76. * @remains: temporary node map used by tipc_bcbearer_send()
  77. * @remains_new: temporary node map used tipc_bcbearer_send()
  78. *
  79. * Note: The fields labelled "temporary" are incorporated into the bearer
  80. * to avoid consuming potentially limited stack space through the use of
  81. * large local variables within multicast routines. Concurrent access is
  82. * prevented through use of the spinlock "bc_lock".
  83. */
  84. struct bcbearer {
  85. struct bearer bearer;
  86. struct media media;
  87. struct bcbearer_pair bpairs[MAX_BEARERS];
  88. struct bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1];
  89. struct node_map remains;
  90. struct node_map remains_new;
  91. };
  92. /**
  93. * struct bclink - link used for broadcast messages
  94. * @link: (non-standard) broadcast link structure
  95. * @node: (non-standard) node structure representing b'cast link's peer node
  96. *
  97. * Handles sequence numbering, fragmentation, bundling, etc.
  98. */
  99. struct bclink {
  100. struct link link;
  101. struct node node;
  102. };
  103. static struct bcbearer *bcbearer = NULL;
  104. static struct bclink *bclink = NULL;
  105. static struct link *bcl = NULL;
  106. static DEFINE_SPINLOCK(bc_lock);
  107. char tipc_bclink_name[] = "multicast-link";
  108. static u32 buf_seqno(struct sk_buff *buf)
  109. {
  110. return msg_seqno(buf_msg(buf));
  111. }
  112. static u32 bcbuf_acks(struct sk_buff *buf)
  113. {
  114. return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle;
  115. }
  116. static void bcbuf_set_acks(struct sk_buff *buf, u32 acks)
  117. {
  118. TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks;
  119. }
  120. static void bcbuf_decr_acks(struct sk_buff *buf)
  121. {
  122. bcbuf_set_acks(buf, bcbuf_acks(buf) - 1);
  123. }
  124. /**
  125. * bclink_set_gap - set gap according to contents of current deferred pkt queue
  126. *
  127. * Called with 'node' locked, bc_lock unlocked
  128. */
  129. static void bclink_set_gap(struct node *n_ptr)
  130. {
  131. struct sk_buff *buf = n_ptr->bclink.deferred_head;
  132. n_ptr->bclink.gap_after = n_ptr->bclink.gap_to =
  133. mod(n_ptr->bclink.last_in);
  134. if (unlikely(buf != NULL))
  135. n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1);
  136. }
  137. /**
  138. * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment
  139. *
  140. * This mechanism endeavours to prevent all nodes in network from trying
  141. * to ACK or NACK at the same time.
  142. *
  143. * Note: TIPC uses a different trigger to distribute ACKs than it does to
  144. * distribute NACKs, but tries to use the same spacing (divide by 16).
  145. */
  146. static int bclink_ack_allowed(u32 n)
  147. {
  148. return((n % TIPC_MIN_LINK_WIN) == tipc_own_tag);
  149. }
  150. /**
  151. * bclink_retransmit_pkt - retransmit broadcast packets
  152. * @after: sequence number of last packet to *not* retransmit
  153. * @to: sequence number of last packet to retransmit
  154. *
  155. * Called with bc_lock locked
  156. */
  157. static void bclink_retransmit_pkt(u32 after, u32 to)
  158. {
  159. struct sk_buff *buf;
  160. buf = bcl->first_out;
  161. while (buf && less_eq(buf_seqno(buf), after)) {
  162. buf = buf->next;
  163. }
  164. tipc_link_retransmit(bcl, buf, mod(to - after));
  165. }
  166. /**
  167. * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets
  168. * @n_ptr: node that sent acknowledgement info
  169. * @acked: broadcast sequence # that has been acknowledged
  170. *
  171. * Node is locked, bc_lock unlocked.
  172. */
  173. void tipc_bclink_acknowledge(struct node *n_ptr, u32 acked)
  174. {
  175. struct sk_buff *crs;
  176. struct sk_buff *next;
  177. unsigned int released = 0;
  178. if (less_eq(acked, n_ptr->bclink.acked))
  179. return;
  180. spin_lock_bh(&bc_lock);
  181. /* Skip over packets that node has previously acknowledged */
  182. crs = bcl->first_out;
  183. while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) {
  184. crs = crs->next;
  185. }
  186. /* Update packets that node is now acknowledging */
  187. while (crs && less_eq(buf_seqno(crs), acked)) {
  188. next = crs->next;
  189. bcbuf_decr_acks(crs);
  190. if (bcbuf_acks(crs) == 0) {
  191. bcl->first_out = next;
  192. bcl->out_queue_size--;
  193. buf_discard(crs);
  194. released = 1;
  195. }
  196. crs = next;
  197. }
  198. n_ptr->bclink.acked = acked;
  199. /* Try resolving broadcast link congestion, if necessary */
  200. if (unlikely(bcl->next_out))
  201. tipc_link_push_queue(bcl);
  202. if (unlikely(released && !list_empty(&bcl->waiting_ports)))
  203. tipc_link_wakeup_ports(bcl, 0);
  204. spin_unlock_bh(&bc_lock);
  205. }
  206. /**
  207. * bclink_send_ack - unicast an ACK msg
  208. *
  209. * tipc_net_lock and node lock set
  210. */
  211. static void bclink_send_ack(struct node *n_ptr)
  212. {
  213. struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1];
  214. if (l_ptr != NULL)
  215. tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0);
  216. }
  217. /**
  218. * bclink_send_nack- broadcast a NACK msg
  219. *
  220. * tipc_net_lock and node lock set
  221. */
  222. static void bclink_send_nack(struct node *n_ptr)
  223. {
  224. struct sk_buff *buf;
  225. struct tipc_msg *msg;
  226. if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to))
  227. return;
  228. buf = buf_acquire(INT_H_SIZE);
  229. if (buf) {
  230. msg = buf_msg(buf);
  231. msg_init(msg, BCAST_PROTOCOL, STATE_MSG,
  232. TIPC_OK, INT_H_SIZE, n_ptr->addr);
  233. msg_set_mc_netid(msg, tipc_net_id);
  234. msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in));
  235. msg_set_bcgap_after(msg, n_ptr->bclink.gap_after);
  236. msg_set_bcgap_to(msg, n_ptr->bclink.gap_to);
  237. msg_set_bcast_tag(msg, tipc_own_tag);
  238. if (tipc_bearer_send(&bcbearer->bearer, buf, NULL)) {
  239. bcl->stats.sent_nacks++;
  240. buf_discard(buf);
  241. } else {
  242. tipc_bearer_schedule(bcl->b_ptr, bcl);
  243. bcl->proto_msg_queue = buf;
  244. bcl->stats.bearer_congs++;
  245. }
  246. /*
  247. * Ensure we doesn't send another NACK msg to the node
  248. * until 16 more deferred messages arrive from it
  249. * (i.e. helps prevent all nodes from NACK'ing at same time)
  250. */
  251. n_ptr->bclink.nack_sync = tipc_own_tag;
  252. }
  253. }
  254. /**
  255. * tipc_bclink_check_gap - send a NACK if a sequence gap exists
  256. *
  257. * tipc_net_lock and node lock set
  258. */
  259. void tipc_bclink_check_gap(struct node *n_ptr, u32 last_sent)
  260. {
  261. if (!n_ptr->bclink.supported ||
  262. less_eq(last_sent, mod(n_ptr->bclink.last_in)))
  263. return;
  264. bclink_set_gap(n_ptr);
  265. if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to)
  266. n_ptr->bclink.gap_to = last_sent;
  267. bclink_send_nack(n_ptr);
  268. }
  269. /**
  270. * tipc_bclink_peek_nack - process a NACK msg meant for another node
  271. *
  272. * Only tipc_net_lock set.
  273. */
  274. static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to)
  275. {
  276. struct node *n_ptr = tipc_node_find(dest);
  277. u32 my_after, my_to;
  278. if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr)))
  279. return;
  280. tipc_node_lock(n_ptr);
  281. /*
  282. * Modify gap to suppress unnecessary NACKs from this node
  283. */
  284. my_after = n_ptr->bclink.gap_after;
  285. my_to = n_ptr->bclink.gap_to;
  286. if (less_eq(gap_after, my_after)) {
  287. if (less(my_after, gap_to) && less(gap_to, my_to))
  288. n_ptr->bclink.gap_after = gap_to;
  289. else if (less_eq(my_to, gap_to))
  290. n_ptr->bclink.gap_to = n_ptr->bclink.gap_after;
  291. } else if (less_eq(gap_after, my_to)) {
  292. if (less_eq(my_to, gap_to))
  293. n_ptr->bclink.gap_to = gap_after;
  294. } else {
  295. /*
  296. * Expand gap if missing bufs not in deferred queue:
  297. */
  298. struct sk_buff *buf = n_ptr->bclink.deferred_head;
  299. u32 prev = n_ptr->bclink.gap_to;
  300. for (; buf; buf = buf->next) {
  301. u32 seqno = buf_seqno(buf);
  302. if (mod(seqno - prev) != 1) {
  303. buf = NULL;
  304. break;
  305. }
  306. if (seqno == gap_after)
  307. break;
  308. prev = seqno;
  309. }
  310. if (buf == NULL)
  311. n_ptr->bclink.gap_to = gap_after;
  312. }
  313. /*
  314. * Some nodes may send a complementary NACK now:
  315. */
  316. if (bclink_ack_allowed(sender_tag + 1)) {
  317. if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) {
  318. bclink_send_nack(n_ptr);
  319. bclink_set_gap(n_ptr);
  320. }
  321. }
  322. tipc_node_unlock(n_ptr);
  323. }
  324. /**
  325. * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster
  326. */
  327. int tipc_bclink_send_msg(struct sk_buff *buf)
  328. {
  329. int res;
  330. spin_lock_bh(&bc_lock);
  331. res = tipc_link_send_buf(bcl, buf);
  332. if (unlikely(res == -ELINKCONG))
  333. buf_discard(buf);
  334. else
  335. bcl->stats.sent_info++;
  336. if (bcl->out_queue_size > bcl->stats.max_queue_sz)
  337. bcl->stats.max_queue_sz = bcl->out_queue_size;
  338. bcl->stats.queue_sz_counts++;
  339. bcl->stats.accu_queue_sz += bcl->out_queue_size;
  340. spin_unlock_bh(&bc_lock);
  341. return res;
  342. }
  343. /**
  344. * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards
  345. *
  346. * tipc_net_lock is read_locked, no other locks set
  347. */
  348. void tipc_bclink_recv_pkt(struct sk_buff *buf)
  349. {
  350. #if (TIPC_BCAST_LOSS_RATE)
  351. static int rx_count = 0;
  352. #endif
  353. struct tipc_msg *msg = buf_msg(buf);
  354. struct node* node = tipc_node_find(msg_prevnode(msg));
  355. u32 next_in;
  356. u32 seqno;
  357. struct sk_buff *deferred;
  358. msg_dbg(msg, "<BC<<<");
  359. if (unlikely(!node || !tipc_node_is_up(node) || !node->bclink.supported ||
  360. (msg_mc_netid(msg) != tipc_net_id))) {
  361. buf_discard(buf);
  362. return;
  363. }
  364. if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) {
  365. msg_dbg(msg, "<BCNACK<<<");
  366. if (msg_destnode(msg) == tipc_own_addr) {
  367. tipc_node_lock(node);
  368. tipc_bclink_acknowledge(node, msg_bcast_ack(msg));
  369. tipc_node_unlock(node);
  370. spin_lock_bh(&bc_lock);
  371. bcl->stats.recv_nacks++;
  372. bcl->owner->next = node; /* remember requestor */
  373. bclink_retransmit_pkt(msg_bcgap_after(msg),
  374. msg_bcgap_to(msg));
  375. bcl->owner->next = NULL;
  376. spin_unlock_bh(&bc_lock);
  377. } else {
  378. tipc_bclink_peek_nack(msg_destnode(msg),
  379. msg_bcast_tag(msg),
  380. msg_bcgap_after(msg),
  381. msg_bcgap_to(msg));
  382. }
  383. buf_discard(buf);
  384. return;
  385. }
  386. #if (TIPC_BCAST_LOSS_RATE)
  387. if (++rx_count == TIPC_BCAST_LOSS_RATE) {
  388. rx_count = 0;
  389. buf_discard(buf);
  390. return;
  391. }
  392. #endif
  393. tipc_node_lock(node);
  394. receive:
  395. deferred = node->bclink.deferred_head;
  396. next_in = mod(node->bclink.last_in + 1);
  397. seqno = msg_seqno(msg);
  398. if (likely(seqno == next_in)) {
  399. bcl->stats.recv_info++;
  400. node->bclink.last_in++;
  401. bclink_set_gap(node);
  402. if (unlikely(bclink_ack_allowed(seqno))) {
  403. bclink_send_ack(node);
  404. bcl->stats.sent_acks++;
  405. }
  406. if (likely(msg_isdata(msg))) {
  407. tipc_node_unlock(node);
  408. tipc_port_recv_mcast(buf, NULL);
  409. } else if (msg_user(msg) == MSG_BUNDLER) {
  410. bcl->stats.recv_bundles++;
  411. bcl->stats.recv_bundled += msg_msgcnt(msg);
  412. tipc_node_unlock(node);
  413. tipc_link_recv_bundle(buf);
  414. } else if (msg_user(msg) == MSG_FRAGMENTER) {
  415. bcl->stats.recv_fragments++;
  416. if (tipc_link_recv_fragment(&node->bclink.defragm,
  417. &buf, &msg))
  418. bcl->stats.recv_fragmented++;
  419. tipc_node_unlock(node);
  420. tipc_net_route_msg(buf);
  421. } else {
  422. tipc_node_unlock(node);
  423. tipc_net_route_msg(buf);
  424. }
  425. if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) {
  426. tipc_node_lock(node);
  427. buf = deferred;
  428. msg = buf_msg(buf);
  429. node->bclink.deferred_head = deferred->next;
  430. goto receive;
  431. }
  432. return;
  433. } else if (less(next_in, seqno)) {
  434. u32 gap_after = node->bclink.gap_after;
  435. u32 gap_to = node->bclink.gap_to;
  436. if (tipc_link_defer_pkt(&node->bclink.deferred_head,
  437. &node->bclink.deferred_tail,
  438. buf)) {
  439. node->bclink.nack_sync++;
  440. bcl->stats.deferred_recv++;
  441. if (seqno == mod(gap_after + 1))
  442. node->bclink.gap_after = seqno;
  443. else if (less(gap_after, seqno) && less(seqno, gap_to))
  444. node->bclink.gap_to = seqno;
  445. }
  446. if (bclink_ack_allowed(node->bclink.nack_sync)) {
  447. if (gap_to != gap_after)
  448. bclink_send_nack(node);
  449. bclink_set_gap(node);
  450. }
  451. } else {
  452. bcl->stats.duplicates++;
  453. buf_discard(buf);
  454. }
  455. tipc_node_unlock(node);
  456. }
  457. u32 tipc_bclink_get_last_sent(void)
  458. {
  459. u32 last_sent = mod(bcl->next_out_no - 1);
  460. if (bcl->next_out)
  461. last_sent = mod(buf_seqno(bcl->next_out) - 1);
  462. return last_sent;
  463. }
  464. u32 tipc_bclink_acks_missing(struct node *n_ptr)
  465. {
  466. return (n_ptr->bclink.supported &&
  467. (tipc_bclink_get_last_sent() != n_ptr->bclink.acked));
  468. }
  469. /**
  470. * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer
  471. *
  472. * Send through as many bearers as necessary to reach all nodes
  473. * that support TIPC multicasting.
  474. *
  475. * Returns 0 if packet sent successfully, non-zero if not
  476. */
  477. static int tipc_bcbearer_send(struct sk_buff *buf,
  478. struct tipc_bearer *unused1,
  479. struct tipc_media_addr *unused2)
  480. {
  481. static int send_count = 0;
  482. int bp_index;
  483. int swap_time;
  484. /* Prepare buffer for broadcasting (if first time trying to send it) */
  485. if (likely(!msg_non_seq(buf_msg(buf)))) {
  486. struct tipc_msg *msg;
  487. assert(tipc_cltr_bcast_nodes.count != 0);
  488. bcbuf_set_acks(buf, tipc_cltr_bcast_nodes.count);
  489. msg = buf_msg(buf);
  490. msg_set_non_seq(msg);
  491. msg_set_mc_netid(msg, tipc_net_id);
  492. }
  493. /* Determine if bearer pairs should be swapped following this attempt */
  494. if ((swap_time = (++send_count >= 10)))
  495. send_count = 0;
  496. /* Send buffer over bearers until all targets reached */
  497. bcbearer->remains = tipc_cltr_bcast_nodes;
  498. for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) {
  499. struct bearer *p = bcbearer->bpairs[bp_index].primary;
  500. struct bearer *s = bcbearer->bpairs[bp_index].secondary;
  501. if (!p)
  502. break; /* no more bearers to try */
  503. tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new);
  504. if (bcbearer->remains_new.count == bcbearer->remains.count)
  505. continue; /* bearer pair doesn't add anything */
  506. if (!p->publ.blocked &&
  507. !p->media->send_msg(buf, &p->publ, &p->media->bcast_addr)) {
  508. if (swap_time && s && !s->publ.blocked)
  509. goto swap;
  510. else
  511. goto update;
  512. }
  513. if (!s || s->publ.blocked ||
  514. s->media->send_msg(buf, &s->publ, &s->media->bcast_addr))
  515. continue; /* unable to send using bearer pair */
  516. swap:
  517. bcbearer->bpairs[bp_index].primary = s;
  518. bcbearer->bpairs[bp_index].secondary = p;
  519. update:
  520. if (bcbearer->remains_new.count == 0)
  521. return TIPC_OK;
  522. bcbearer->remains = bcbearer->remains_new;
  523. }
  524. /* Unable to reach all targets */
  525. bcbearer->bearer.publ.blocked = 1;
  526. bcl->stats.bearer_congs++;
  527. return ~TIPC_OK;
  528. }
  529. /**
  530. * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer
  531. */
  532. void tipc_bcbearer_sort(void)
  533. {
  534. struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp;
  535. struct bcbearer_pair *bp_curr;
  536. int b_index;
  537. int pri;
  538. spin_lock_bh(&bc_lock);
  539. /* Group bearers by priority (can assume max of two per priority) */
  540. memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp));
  541. for (b_index = 0; b_index < MAX_BEARERS; b_index++) {
  542. struct bearer *b = &tipc_bearers[b_index];
  543. if (!b->active || !b->nodes.count)
  544. continue;
  545. if (!bp_temp[b->priority].primary)
  546. bp_temp[b->priority].primary = b;
  547. else
  548. bp_temp[b->priority].secondary = b;
  549. }
  550. /* Create array of bearer pairs for broadcasting */
  551. bp_curr = bcbearer->bpairs;
  552. memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs));
  553. for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) {
  554. if (!bp_temp[pri].primary)
  555. continue;
  556. bp_curr->primary = bp_temp[pri].primary;
  557. if (bp_temp[pri].secondary) {
  558. if (tipc_nmap_equal(&bp_temp[pri].primary->nodes,
  559. &bp_temp[pri].secondary->nodes)) {
  560. bp_curr->secondary = bp_temp[pri].secondary;
  561. } else {
  562. bp_curr++;
  563. bp_curr->primary = bp_temp[pri].secondary;
  564. }
  565. }
  566. bp_curr++;
  567. }
  568. spin_unlock_bh(&bc_lock);
  569. }
  570. /**
  571. * tipc_bcbearer_push - resolve bearer congestion
  572. *
  573. * Forces bclink to push out any unsent packets, until all packets are gone
  574. * or congestion reoccurs.
  575. * No locks set when function called
  576. */
  577. void tipc_bcbearer_push(void)
  578. {
  579. struct bearer *b_ptr;
  580. spin_lock_bh(&bc_lock);
  581. b_ptr = &bcbearer->bearer;
  582. if (b_ptr->publ.blocked) {
  583. b_ptr->publ.blocked = 0;
  584. tipc_bearer_lock_push(b_ptr);
  585. }
  586. spin_unlock_bh(&bc_lock);
  587. }
  588. int tipc_bclink_stats(char *buf, const u32 buf_size)
  589. {
  590. struct print_buf pb;
  591. if (!bcl)
  592. return 0;
  593. tipc_printbuf_init(&pb, buf, buf_size);
  594. spin_lock_bh(&bc_lock);
  595. tipc_printf(&pb, "Link <%s>\n"
  596. " Window:%u packets\n",
  597. bcl->name, bcl->queue_limit[0]);
  598. tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n",
  599. bcl->stats.recv_info,
  600. bcl->stats.recv_fragments,
  601. bcl->stats.recv_fragmented,
  602. bcl->stats.recv_bundles,
  603. bcl->stats.recv_bundled);
  604. tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n",
  605. bcl->stats.sent_info,
  606. bcl->stats.sent_fragments,
  607. bcl->stats.sent_fragmented,
  608. bcl->stats.sent_bundles,
  609. bcl->stats.sent_bundled);
  610. tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n",
  611. bcl->stats.recv_nacks,
  612. bcl->stats.deferred_recv,
  613. bcl->stats.duplicates);
  614. tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n",
  615. bcl->stats.sent_nacks,
  616. bcl->stats.sent_acks,
  617. bcl->stats.retransmitted);
  618. tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n",
  619. bcl->stats.bearer_congs,
  620. bcl->stats.link_congs,
  621. bcl->stats.max_queue_sz,
  622. bcl->stats.queue_sz_counts
  623. ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts)
  624. : 0);
  625. spin_unlock_bh(&bc_lock);
  626. return tipc_printbuf_validate(&pb);
  627. }
  628. int tipc_bclink_reset_stats(void)
  629. {
  630. if (!bcl)
  631. return -ENOPROTOOPT;
  632. spin_lock_bh(&bc_lock);
  633. memset(&bcl->stats, 0, sizeof(bcl->stats));
  634. spin_unlock_bh(&bc_lock);
  635. return TIPC_OK;
  636. }
  637. int tipc_bclink_set_queue_limits(u32 limit)
  638. {
  639. if (!bcl)
  640. return -ENOPROTOOPT;
  641. if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN))
  642. return -EINVAL;
  643. spin_lock_bh(&bc_lock);
  644. tipc_link_set_queue_limits(bcl, limit);
  645. spin_unlock_bh(&bc_lock);
  646. return TIPC_OK;
  647. }
  648. int tipc_bclink_init(void)
  649. {
  650. bcbearer = kzalloc(sizeof(*bcbearer), GFP_ATOMIC);
  651. bclink = kzalloc(sizeof(*bclink), GFP_ATOMIC);
  652. if (!bcbearer || !bclink) {
  653. nomem:
  654. warn("Multicast link creation failed, no memory\n");
  655. kfree(bcbearer);
  656. bcbearer = NULL;
  657. kfree(bclink);
  658. bclink = NULL;
  659. return -ENOMEM;
  660. }
  661. INIT_LIST_HEAD(&bcbearer->bearer.cong_links);
  662. bcbearer->bearer.media = &bcbearer->media;
  663. bcbearer->media.send_msg = tipc_bcbearer_send;
  664. sprintf(bcbearer->media.name, "tipc-multicast");
  665. bcl = &bclink->link;
  666. INIT_LIST_HEAD(&bcl->waiting_ports);
  667. bcl->next_out_no = 1;
  668. spin_lock_init(&bclink->node.lock);
  669. bcl->owner = &bclink->node;
  670. bcl->max_pkt = MAX_PKT_DEFAULT_MCAST;
  671. tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT);
  672. bcl->b_ptr = &bcbearer->bearer;
  673. bcl->state = WORKING_WORKING;
  674. sprintf(bcl->name, tipc_bclink_name);
  675. if (BCLINK_LOG_BUF_SIZE) {
  676. char *pb = kmalloc(BCLINK_LOG_BUF_SIZE, GFP_ATOMIC);
  677. if (!pb)
  678. goto nomem;
  679. tipc_printbuf_init(&bcl->print_buf, pb, BCLINK_LOG_BUF_SIZE);
  680. }
  681. return TIPC_OK;
  682. }
  683. void tipc_bclink_stop(void)
  684. {
  685. spin_lock_bh(&bc_lock);
  686. if (bcbearer) {
  687. tipc_link_stop(bcl);
  688. if (BCLINK_LOG_BUF_SIZE)
  689. kfree(bcl->print_buf.buf);
  690. bcl = NULL;
  691. kfree(bclink);
  692. bclink = NULL;
  693. kfree(bcbearer);
  694. bcbearer = NULL;
  695. }
  696. spin_unlock_bh(&bc_lock);
  697. }