2 * net/tipc/bcast.c: TIPC broadcast code
4 * Copyright (c) 2004-2006, 2014-2015, Ericsson AB
5 * Copyright (c) 2004, Intel Corporation.
6 * Copyright (c) 2005, 2010-2011, Wind River Systems
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions are met:
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.
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.
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.
38 #include <linux/tipc_config.h>
42 #include "name_distr.h"
46 #define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */
47 #define BCLINK_WIN_DEFAULT 50 /* bcast link window size (default) */
48 #define BCLINK_WIN_MIN 32 /* bcast minimum link window size */
50 const char tipc_bclink_name[] = "broadcast-link";
53 * struct tipc_bcbearer_pair - a pair of bearers used by broadcast link
54 * @primary: pointer to primary bearer
55 * @secondary: pointer to secondary bearer
57 * Bearers must have same priority and same set of reachable destinations
61 struct tipc_bcbearer_pair {
62 struct tipc_bearer *primary;
63 struct tipc_bearer *secondary;
66 #define BCBEARER MAX_BEARERS
69 * struct tipc_bcbearer - bearer used by broadcast link
70 * @bearer: (non-standard) broadcast bearer structure
71 * @media: (non-standard) broadcast media structure
72 * @bpairs: array of bearer pairs
73 * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort()
74 * @remains: temporary node map used by tipc_bcbearer_send()
75 * @remains_new: temporary node map used tipc_bcbearer_send()
77 * Note: The fields labelled "temporary" are incorporated into the bearer
78 * to avoid consuming potentially limited stack space through the use of
79 * large local variables within multicast routines. Concurrent access is
80 * prevented through use of the spinlock "bcast_lock".
82 struct tipc_bcbearer {
83 struct tipc_bearer bearer;
84 struct tipc_media media;
85 struct tipc_bcbearer_pair bpairs[MAX_BEARERS];
86 struct tipc_bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1];
87 struct tipc_node_map remains;
88 struct tipc_node_map remains_new;
92 * struct tipc_bc_base - link used for broadcast messages
93 * @link: (non-standard) broadcast link structure
94 * @node: (non-standard) node structure representing b'cast link's peer node
95 * @bcast_nodes: map of broadcast-capable nodes
96 * @retransmit_to: node that most recently requested a retransmit
98 * Handles sequence numbering, fragmentation, bundling, etc.
100 struct tipc_bc_base {
101 struct tipc_link *link;
102 struct tipc_node node;
103 struct sk_buff_head arrvq;
104 struct sk_buff_head inputq;
105 struct sk_buff_head namedq;
106 struct tipc_node_map bcast_nodes;
107 struct tipc_node *retransmit_to;
110 static struct tipc_bc_base *tipc_bc_base(struct net *net)
112 return tipc_net(net)->bcbase;
116 * tipc_nmap_equal - test for equality of node maps
118 static int tipc_nmap_equal(struct tipc_node_map *nm_a,
119 struct tipc_node_map *nm_b)
121 return !memcmp(nm_a, nm_b, sizeof(*nm_a));
124 static void tipc_nmap_diff(struct tipc_node_map *nm_a,
125 struct tipc_node_map *nm_b,
126 struct tipc_node_map *nm_diff);
127 static void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node);
128 static void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node);
129 static void tipc_bclink_lock(struct net *net)
131 tipc_bcast_lock(net);
134 static void tipc_bclink_unlock(struct net *net)
136 tipc_bcast_unlock(net);
139 void tipc_bclink_input(struct net *net)
141 struct tipc_net *tn = net_generic(net, tipc_net_id);
143 tipc_sk_mcast_rcv(net, &tn->bcbase->arrvq, &tn->bcbase->inputq);
146 uint tipc_bcast_get_mtu(void)
148 return MAX_PKT_DEFAULT_MCAST;
151 static u32 bcbuf_acks(struct sk_buff *buf)
153 return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle;
156 static void bcbuf_set_acks(struct sk_buff *buf, u32 acks)
158 TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks;
161 static void bcbuf_decr_acks(struct sk_buff *buf)
163 bcbuf_set_acks(buf, bcbuf_acks(buf) - 1);
166 void tipc_bclink_add_node(struct net *net, u32 addr)
168 struct tipc_net *tn = net_generic(net, tipc_net_id);
170 tipc_bclink_lock(net);
171 tipc_nmap_add(&tn->bcbase->bcast_nodes, addr);
172 tipc_bclink_unlock(net);
175 void tipc_bclink_remove_node(struct net *net, u32 addr)
177 struct tipc_net *tn = net_generic(net, tipc_net_id);
179 tipc_bclink_lock(net);
180 tipc_nmap_remove(&tn->bcbase->bcast_nodes, addr);
182 /* Last node? => reset backlog queue */
183 if (!tn->bcbase->bcast_nodes.count)
184 tipc_link_purge_backlog(tn->bcbase->link);
186 tipc_bclink_unlock(net);
189 static void bclink_set_last_sent(struct net *net)
191 struct tipc_net *tn = net_generic(net, tipc_net_id);
192 struct tipc_link *bcl = tn->bcl;
194 bcl->silent_intv_cnt = mod(bcl->snd_nxt - 1);
197 u32 tipc_bclink_get_last_sent(struct net *net)
199 struct tipc_net *tn = net_generic(net, tipc_net_id);
201 return tn->bcl->silent_intv_cnt;
204 static void bclink_update_last_sent(struct tipc_node *node, u32 seqno)
206 node->bclink.last_sent = less_eq(node->bclink.last_sent, seqno) ?
207 seqno : node->bclink.last_sent;
211 * tipc_bclink_retransmit_to - get most recent node to request retransmission
213 * Called with bclink_lock locked
215 struct tipc_node *tipc_bclink_retransmit_to(struct net *net)
217 struct tipc_net *tn = net_generic(net, tipc_net_id);
219 return tn->bcbase->retransmit_to;
223 * bclink_retransmit_pkt - retransmit broadcast packets
224 * @after: sequence number of last packet to *not* retransmit
225 * @to: sequence number of last packet to retransmit
227 * Called with bclink_lock locked
229 static void bclink_retransmit_pkt(struct tipc_net *tn, u32 after, u32 to)
232 struct tipc_link *bcl = tn->bcl;
234 skb_queue_walk(&bcl->transmq, skb) {
235 if (more(buf_seqno(skb), after)) {
236 tipc_link_retransmit(bcl, skb, mod(to - after));
243 * bclink_prepare_wakeup - prepare users for wakeup after congestion
244 * @bcl: broadcast link
245 * @resultq: queue for users which can be woken up
246 * Move a number of waiting users, as permitted by available space in
247 * the send queue, from link wait queue to specified queue for wakeup
249 static void bclink_prepare_wakeup(struct tipc_link *bcl, struct sk_buff_head *resultq)
251 int pnd[TIPC_SYSTEM_IMPORTANCE + 1] = {0,};
253 struct sk_buff *skb, *tmp;
255 skb_queue_walk_safe(&bcl->wakeupq, skb, tmp) {
256 imp = TIPC_SKB_CB(skb)->chain_imp;
257 lim = bcl->window + bcl->backlog[imp].limit;
258 pnd[imp] += TIPC_SKB_CB(skb)->chain_sz;
259 if ((pnd[imp] + bcl->backlog[imp].len) >= lim)
261 skb_unlink(skb, &bcl->wakeupq);
262 skb_queue_tail(resultq, skb);
267 * tipc_bclink_wakeup_users - wake up pending users
269 * Called with no locks taken
271 void tipc_bclink_wakeup_users(struct net *net)
273 struct tipc_net *tn = net_generic(net, tipc_net_id);
274 struct tipc_link *bcl = tn->bcl;
275 struct sk_buff_head resultq;
277 skb_queue_head_init(&resultq);
278 bclink_prepare_wakeup(bcl, &resultq);
279 tipc_sk_rcv(net, &resultq);
283 * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets
284 * @n_ptr: node that sent acknowledgement info
285 * @acked: broadcast sequence # that has been acknowledged
287 * Node is locked, bclink_lock unlocked.
289 void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked)
291 struct sk_buff *skb, *tmp;
292 unsigned int released = 0;
293 struct net *net = n_ptr->net;
294 struct tipc_net *tn = net_generic(net, tipc_net_id);
296 if (unlikely(!n_ptr->bclink.recv_permitted))
299 tipc_bclink_lock(net);
301 /* Bail out if tx queue is empty (no clean up is required) */
302 skb = skb_peek(&tn->bcl->transmq);
306 /* Determine which messages need to be acknowledged */
307 if (acked == INVALID_LINK_SEQ) {
309 * Contact with specified node has been lost, so need to
310 * acknowledge sent messages only (if other nodes still exist)
311 * or both sent and unsent messages (otherwise)
313 if (tn->bcbase->bcast_nodes.count)
314 acked = tn->bcl->silent_intv_cnt;
316 acked = tn->bcl->snd_nxt;
319 * Bail out if specified sequence number does not correspond
320 * to a message that has been sent and not yet acknowledged
322 if (less(acked, buf_seqno(skb)) ||
323 less(tn->bcl->silent_intv_cnt, acked) ||
324 less_eq(acked, n_ptr->bclink.acked))
328 /* Skip over packets that node has previously acknowledged */
329 skb_queue_walk(&tn->bcl->transmq, skb) {
330 if (more(buf_seqno(skb), n_ptr->bclink.acked))
334 /* Update packets that node is now acknowledging */
335 skb_queue_walk_from_safe(&tn->bcl->transmq, skb, tmp) {
336 if (more(buf_seqno(skb), acked))
338 bcbuf_decr_acks(skb);
339 bclink_set_last_sent(net);
340 if (bcbuf_acks(skb) == 0) {
341 __skb_unlink(skb, &tn->bcl->transmq);
346 n_ptr->bclink.acked = acked;
348 /* Try resolving broadcast link congestion, if necessary */
349 if (unlikely(skb_peek(&tn->bcl->backlogq))) {
350 tipc_link_push_packets(tn->bcl);
351 bclink_set_last_sent(net);
353 if (unlikely(released && !skb_queue_empty(&tn->bcl->wakeupq)))
354 n_ptr->action_flags |= TIPC_WAKEUP_BCAST_USERS;
356 tipc_bclink_unlock(net);
360 * tipc_bclink_update_link_state - update broadcast link state
362 * RCU and node lock set
364 void tipc_bclink_update_link_state(struct tipc_node *n_ptr,
368 struct net *net = n_ptr->net;
369 struct tipc_net *tn = net_generic(net, tipc_net_id);
371 /* Ignore "stale" link state info */
372 if (less_eq(last_sent, n_ptr->bclink.last_in))
375 /* Update link synchronization state; quit if in sync */
376 bclink_update_last_sent(n_ptr, last_sent);
378 if (n_ptr->bclink.last_sent == n_ptr->bclink.last_in)
381 /* Update out-of-sync state; quit if loss is still unconfirmed */
382 if ((++n_ptr->bclink.oos_state) == 1) {
383 if (n_ptr->bclink.deferred_size < (TIPC_MIN_LINK_WIN / 2))
385 n_ptr->bclink.oos_state++;
388 /* Don't NACK if one has been recently sent (or seen) */
389 if (n_ptr->bclink.oos_state & 0x1)
393 buf = tipc_buf_acquire(INT_H_SIZE);
395 struct tipc_msg *msg = buf_msg(buf);
396 struct sk_buff *skb = skb_peek(&n_ptr->bclink.deferdq);
397 u32 to = skb ? buf_seqno(skb) - 1 : n_ptr->bclink.last_sent;
399 tipc_msg_init(tn->own_addr, msg, BCAST_PROTOCOL, STATE_MSG,
400 INT_H_SIZE, n_ptr->addr);
401 msg_set_non_seq(msg, 1);
402 msg_set_mc_netid(msg, tn->net_id);
403 msg_set_bcast_ack(msg, n_ptr->bclink.last_in);
404 msg_set_bcgap_after(msg, n_ptr->bclink.last_in);
405 msg_set_bcgap_to(msg, to);
407 tipc_bclink_lock(net);
408 tipc_bearer_send(net, MAX_BEARERS, buf, NULL);
409 tn->bcl->stats.sent_nacks++;
410 tipc_bclink_unlock(net);
413 n_ptr->bclink.oos_state++;
417 void tipc_bclink_sync_state(struct tipc_node *n, struct tipc_msg *hdr)
419 u16 last = msg_last_bcast(hdr);
420 int mtyp = msg_type(hdr);
422 if (unlikely(msg_user(hdr) != LINK_PROTOCOL))
424 if (mtyp == STATE_MSG) {
425 tipc_bclink_update_link_state(n, last);
428 /* Compatibility: older nodes don't know BCAST_PROTOCOL synchronization,
429 * and transfer synch info in LINK_PROTOCOL messages.
431 if (tipc_node_is_up(n))
433 if ((mtyp != RESET_MSG) && (mtyp != ACTIVATE_MSG))
435 n->bclink.last_sent = last;
436 n->bclink.last_in = last;
437 n->bclink.oos_state = 0;
441 * bclink_peek_nack - monitor retransmission requests sent by other nodes
443 * Delay any upcoming NACK by this node if another node has already
444 * requested the first message this node is going to ask for.
446 static void bclink_peek_nack(struct net *net, struct tipc_msg *msg)
448 struct tipc_node *n_ptr = tipc_node_find(net, msg_destnode(msg));
450 if (unlikely(!n_ptr))
453 tipc_node_lock(n_ptr);
454 if (n_ptr->bclink.recv_permitted &&
455 (n_ptr->bclink.last_in != n_ptr->bclink.last_sent) &&
456 (n_ptr->bclink.last_in == msg_bcgap_after(msg)))
457 n_ptr->bclink.oos_state = 2;
458 tipc_node_unlock(n_ptr);
459 tipc_node_put(n_ptr);
462 /* tipc_bcast_xmit - deliver buffer chain to all nodes in cluster
463 * and to identified node local sockets
464 * @net: the applicable net namespace
465 * @list: chain of buffers containing message
466 * Consumes the buffer chain, except when returning -ELINKCONG
467 * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE
469 int tipc_bcast_xmit(struct net *net, struct sk_buff_head *list)
471 struct tipc_net *tn = net_generic(net, tipc_net_id);
472 struct tipc_link *bcl = tn->bcl;
473 struct tipc_bc_base *bclink = tn->bcbase;
477 struct sk_buff_head arrvq;
478 struct sk_buff_head inputq;
480 /* Prepare clone of message for local node */
481 skb = tipc_msg_reassemble(list);
483 return -EHOSTUNREACH;
485 /* Broadcast to all nodes */
486 if (likely(bclink)) {
487 tipc_bclink_lock(net);
488 if (likely(bclink->bcast_nodes.count)) {
489 rc = __tipc_link_xmit(net, bcl, list);
491 u32 len = skb_queue_len(&bcl->transmq);
493 bclink_set_last_sent(net);
494 bcl->stats.queue_sz_counts++;
495 bcl->stats.accu_queue_sz += len;
499 tipc_bclink_unlock(net);
503 __skb_queue_purge(list);
509 /* Deliver message clone */
510 __skb_queue_head_init(&arrvq);
511 skb_queue_head_init(&inputq);
512 __skb_queue_tail(&arrvq, skb);
513 tipc_sk_mcast_rcv(net, &arrvq, &inputq);
518 * bclink_accept_pkt - accept an incoming, in-sequence broadcast packet
520 * Called with both sending node's lock and bclink_lock taken.
522 static void bclink_accept_pkt(struct tipc_node *node, u32 seqno)
524 struct tipc_net *tn = net_generic(node->net, tipc_net_id);
526 bclink_update_last_sent(node, seqno);
527 node->bclink.last_in = seqno;
528 node->bclink.oos_state = 0;
529 tn->bcl->stats.recv_info++;
532 * Unicast an ACK periodically, ensuring that
533 * all nodes in the cluster don't ACK at the same time
535 if (((seqno - tn->own_addr) % TIPC_MIN_LINK_WIN) == 0) {
536 tipc_link_proto_xmit(node_active_link(node, node->addr),
537 STATE_MSG, 0, 0, 0, 0);
538 tn->bcl->stats.sent_acks++;
543 * tipc_bclink_rcv - receive a broadcast packet, and deliver upwards
545 * RCU is locked, no other locks set
547 void tipc_bclink_rcv(struct net *net, struct sk_buff *buf)
549 struct tipc_net *tn = net_generic(net, tipc_net_id);
550 struct tipc_link *bcl = tn->bcl;
551 struct tipc_msg *msg = buf_msg(buf);
552 struct tipc_node *node;
557 struct sk_buff *iskb;
558 struct sk_buff_head *arrvq, *inputq;
560 /* Screen out unwanted broadcast messages */
561 if (msg_mc_netid(msg) != tn->net_id)
564 node = tipc_node_find(net, msg_prevnode(msg));
568 tipc_node_lock(node);
569 if (unlikely(!node->bclink.recv_permitted))
572 /* Handle broadcast protocol message */
573 if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) {
574 if (msg_type(msg) != STATE_MSG)
576 if (msg_destnode(msg) == tn->own_addr) {
577 tipc_bclink_acknowledge(node, msg_bcast_ack(msg));
578 tipc_bclink_lock(net);
579 bcl->stats.recv_nacks++;
580 tn->bcbase->retransmit_to = node;
581 bclink_retransmit_pkt(tn, msg_bcgap_after(msg),
583 tipc_bclink_unlock(net);
584 tipc_node_unlock(node);
586 tipc_node_unlock(node);
587 bclink_peek_nack(net, msg);
593 /* Handle in-sequence broadcast message */
594 seqno = msg_seqno(msg);
595 next_in = mod(node->bclink.last_in + 1);
596 arrvq = &tn->bcbase->arrvq;
597 inputq = &tn->bcbase->inputq;
599 if (likely(seqno == next_in)) {
601 /* Deliver message to destination */
602 if (likely(msg_isdata(msg))) {
603 tipc_bclink_lock(net);
604 bclink_accept_pkt(node, seqno);
605 spin_lock_bh(&inputq->lock);
606 __skb_queue_tail(arrvq, buf);
607 spin_unlock_bh(&inputq->lock);
608 node->action_flags |= TIPC_BCAST_MSG_EVT;
609 tipc_bclink_unlock(net);
610 tipc_node_unlock(node);
611 } else if (msg_user(msg) == MSG_BUNDLER) {
612 tipc_bclink_lock(net);
613 bclink_accept_pkt(node, seqno);
614 bcl->stats.recv_bundles++;
615 bcl->stats.recv_bundled += msg_msgcnt(msg);
617 while (tipc_msg_extract(buf, &iskb, &pos)) {
618 spin_lock_bh(&inputq->lock);
619 __skb_queue_tail(arrvq, iskb);
620 spin_unlock_bh(&inputq->lock);
622 node->action_flags |= TIPC_BCAST_MSG_EVT;
623 tipc_bclink_unlock(net);
624 tipc_node_unlock(node);
625 } else if (msg_user(msg) == MSG_FRAGMENTER) {
626 tipc_bclink_lock(net);
627 bclink_accept_pkt(node, seqno);
628 tipc_buf_append(&node->bclink.reasm_buf, &buf);
629 if (unlikely(!buf && !node->bclink.reasm_buf)) {
630 tipc_bclink_unlock(net);
633 bcl->stats.recv_fragments++;
635 bcl->stats.recv_fragmented++;
637 tipc_bclink_unlock(net);
640 tipc_bclink_unlock(net);
641 tipc_node_unlock(node);
643 tipc_bclink_lock(net);
644 bclink_accept_pkt(node, seqno);
645 tipc_bclink_unlock(net);
646 tipc_node_unlock(node);
651 /* Determine new synchronization state */
652 tipc_node_lock(node);
653 if (unlikely(!tipc_node_is_up(node)))
656 if (node->bclink.last_in == node->bclink.last_sent)
659 if (skb_queue_empty(&node->bclink.deferdq)) {
660 node->bclink.oos_state = 1;
664 msg = buf_msg(skb_peek(&node->bclink.deferdq));
665 seqno = msg_seqno(msg);
666 next_in = mod(next_in + 1);
667 if (seqno != next_in)
670 /* Take in-sequence message from deferred queue & deliver it */
671 buf = __skb_dequeue(&node->bclink.deferdq);
675 /* Handle out-of-sequence broadcast message */
676 if (less(next_in, seqno)) {
677 deferred = tipc_link_defer_pkt(&node->bclink.deferdq,
679 bclink_update_last_sent(node, seqno);
683 tipc_bclink_lock(net);
686 bcl->stats.deferred_recv++;
688 bcl->stats.duplicates++;
690 tipc_bclink_unlock(net);
693 tipc_node_unlock(node);
699 u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr)
701 return (n_ptr->bclink.recv_permitted &&
702 (tipc_bclink_get_last_sent(n_ptr->net) != n_ptr->bclink.acked));
707 * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer
709 * Send packet over as many bearers as necessary to reach all nodes
710 * that have joined the broadcast link.
712 * Returns 0 (packet sent successfully) under all circumstances,
713 * since the broadcast link's pseudo-bearer never blocks
715 static int tipc_bcbearer_send(struct net *net, struct sk_buff *buf,
716 struct tipc_bearer *unused1,
717 struct tipc_media_addr *unused2)
720 struct tipc_msg *msg = buf_msg(buf);
721 struct tipc_net *tn = net_generic(net, tipc_net_id);
722 struct tipc_bcbearer *bcbearer = tn->bcbearer;
723 struct tipc_bc_base *bclink = tn->bcbase;
725 /* Prepare broadcast link message for reliable transmission,
726 * if first time trying to send it;
727 * preparation is skipped for broadcast link protocol messages
728 * since they are sent in an unreliable manner and don't need it
730 if (likely(!msg_non_seq(buf_msg(buf)))) {
731 bcbuf_set_acks(buf, bclink->bcast_nodes.count);
732 msg_set_non_seq(msg, 1);
733 msg_set_mc_netid(msg, tn->net_id);
734 tn->bcl->stats.sent_info++;
735 if (WARN_ON(!bclink->bcast_nodes.count)) {
741 /* Send buffer over bearers until all targets reached */
742 bcbearer->remains = bclink->bcast_nodes;
744 for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) {
745 struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary;
746 struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary;
747 struct tipc_bearer *bp[2] = {p, s};
748 struct tipc_bearer *b = bp[msg_link_selector(msg)];
749 struct sk_buff *tbuf;
752 break; /* No more bearers to try */
755 tipc_nmap_diff(&bcbearer->remains, &b->nodes,
756 &bcbearer->remains_new);
757 if (bcbearer->remains_new.count == bcbearer->remains.count)
758 continue; /* Nothing added by bearer pair */
761 /* Use original buffer for first bearer */
762 tipc_bearer_send(net, b->identity, buf, &b->bcast_addr);
764 /* Avoid concurrent buffer access */
765 tbuf = pskb_copy_for_clone(buf, GFP_ATOMIC);
768 tipc_bearer_send(net, b->identity, tbuf,
770 kfree_skb(tbuf); /* Bearer keeps a clone */
772 if (bcbearer->remains_new.count == 0)
773 break; /* All targets reached */
775 bcbearer->remains = bcbearer->remains_new;
782 * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer
784 void tipc_bcbearer_sort(struct net *net, struct tipc_node_map *nm_ptr,
785 u32 node, bool action)
787 struct tipc_net *tn = net_generic(net, tipc_net_id);
788 struct tipc_bcbearer *bcbearer = tn->bcbearer;
789 struct tipc_bcbearer_pair *bp_temp = bcbearer->bpairs_temp;
790 struct tipc_bcbearer_pair *bp_curr;
791 struct tipc_bearer *b;
795 tipc_bclink_lock(net);
798 tipc_nmap_add(nm_ptr, node);
800 tipc_nmap_remove(nm_ptr, node);
802 /* Group bearers by priority (can assume max of two per priority) */
803 memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp));
806 for (b_index = 0; b_index < MAX_BEARERS; b_index++) {
807 b = rcu_dereference_rtnl(tn->bearer_list[b_index]);
808 if (!b || !b->nodes.count)
811 if (!bp_temp[b->priority].primary)
812 bp_temp[b->priority].primary = b;
814 bp_temp[b->priority].secondary = b;
818 /* Create array of bearer pairs for broadcasting */
819 bp_curr = bcbearer->bpairs;
820 memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs));
822 for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) {
824 if (!bp_temp[pri].primary)
827 bp_curr->primary = bp_temp[pri].primary;
829 if (bp_temp[pri].secondary) {
830 if (tipc_nmap_equal(&bp_temp[pri].primary->nodes,
831 &bp_temp[pri].secondary->nodes)) {
832 bp_curr->secondary = bp_temp[pri].secondary;
835 bp_curr->primary = bp_temp[pri].secondary;
842 tipc_bclink_unlock(net);
845 static int __tipc_nl_add_bc_link_stat(struct sk_buff *skb,
846 struct tipc_stats *stats)
856 struct nla_map map[] = {
857 {TIPC_NLA_STATS_RX_INFO, stats->recv_info},
858 {TIPC_NLA_STATS_RX_FRAGMENTS, stats->recv_fragments},
859 {TIPC_NLA_STATS_RX_FRAGMENTED, stats->recv_fragmented},
860 {TIPC_NLA_STATS_RX_BUNDLES, stats->recv_bundles},
861 {TIPC_NLA_STATS_RX_BUNDLED, stats->recv_bundled},
862 {TIPC_NLA_STATS_TX_INFO, stats->sent_info},
863 {TIPC_NLA_STATS_TX_FRAGMENTS, stats->sent_fragments},
864 {TIPC_NLA_STATS_TX_FRAGMENTED, stats->sent_fragmented},
865 {TIPC_NLA_STATS_TX_BUNDLES, stats->sent_bundles},
866 {TIPC_NLA_STATS_TX_BUNDLED, stats->sent_bundled},
867 {TIPC_NLA_STATS_RX_NACKS, stats->recv_nacks},
868 {TIPC_NLA_STATS_RX_DEFERRED, stats->deferred_recv},
869 {TIPC_NLA_STATS_TX_NACKS, stats->sent_nacks},
870 {TIPC_NLA_STATS_TX_ACKS, stats->sent_acks},
871 {TIPC_NLA_STATS_RETRANSMITTED, stats->retransmitted},
872 {TIPC_NLA_STATS_DUPLICATES, stats->duplicates},
873 {TIPC_NLA_STATS_LINK_CONGS, stats->link_congs},
874 {TIPC_NLA_STATS_MAX_QUEUE, stats->max_queue_sz},
875 {TIPC_NLA_STATS_AVG_QUEUE, stats->queue_sz_counts ?
876 (stats->accu_queue_sz / stats->queue_sz_counts) : 0}
879 nest = nla_nest_start(skb, TIPC_NLA_LINK_STATS);
883 for (i = 0; i < ARRAY_SIZE(map); i++)
884 if (nla_put_u32(skb, map[i].key, map[i].val))
887 nla_nest_end(skb, nest);
891 nla_nest_cancel(skb, nest);
896 int tipc_nl_add_bc_link(struct net *net, struct tipc_nl_msg *msg)
900 struct nlattr *attrs;
902 struct tipc_net *tn = net_generic(net, tipc_net_id);
903 struct tipc_link *bcl = tn->bcl;
908 tipc_bclink_lock(net);
910 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
911 NLM_F_MULTI, TIPC_NL_LINK_GET);
915 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK);
919 /* The broadcast link is always up */
920 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
923 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_BROADCAST))
925 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, bcl->name))
927 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, bcl->rcv_nxt))
929 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, bcl->snd_nxt))
932 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP);
935 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, bcl->window))
937 nla_nest_end(msg->skb, prop);
939 err = __tipc_nl_add_bc_link_stat(msg->skb, &bcl->stats);
943 tipc_bclink_unlock(net);
944 nla_nest_end(msg->skb, attrs);
945 genlmsg_end(msg->skb, hdr);
950 nla_nest_cancel(msg->skb, prop);
952 nla_nest_cancel(msg->skb, attrs);
954 tipc_bclink_unlock(net);
955 genlmsg_cancel(msg->skb, hdr);
960 int tipc_bclink_reset_stats(struct net *net)
962 struct tipc_net *tn = net_generic(net, tipc_net_id);
963 struct tipc_link *bcl = tn->bcl;
968 tipc_bclink_lock(net);
969 memset(&bcl->stats, 0, sizeof(bcl->stats));
970 tipc_bclink_unlock(net);
974 int tipc_bclink_set_queue_limits(struct net *net, u32 limit)
976 struct tipc_net *tn = net_generic(net, tipc_net_id);
977 struct tipc_link *bcl = tn->bcl;
981 if (limit < BCLINK_WIN_MIN)
982 limit = BCLINK_WIN_MIN;
983 if (limit > TIPC_MAX_LINK_WIN)
985 tipc_bclink_lock(net);
986 tipc_link_set_queue_limits(bcl, limit);
987 tipc_bclink_unlock(net);
991 int tipc_nl_bc_link_set(struct net *net, struct nlattr *attrs[])
995 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
997 if (!attrs[TIPC_NLA_LINK_PROP])
1000 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP], props);
1004 if (!props[TIPC_NLA_PROP_WIN])
1007 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
1009 return tipc_bclink_set_queue_limits(net, win);
1012 int tipc_bcast_init(struct net *net)
1014 struct tipc_net *tn = tipc_net(net);
1015 struct tipc_bcbearer *bcb = NULL;
1016 struct tipc_bc_base *bb = NULL;
1017 struct tipc_link *l = NULL;
1019 bcb = kzalloc(sizeof(*bcb), GFP_ATOMIC);
1024 bcb->bearer.window = BCLINK_WIN_DEFAULT;
1025 bcb->bearer.mtu = MAX_PKT_DEFAULT_MCAST;
1026 bcb->bearer.identity = MAX_BEARERS;
1028 bcb->bearer.media = &bcb->media;
1029 bcb->media.send_msg = tipc_bcbearer_send;
1030 sprintf(bcb->media.name, "tipc-broadcast");
1031 strcpy(bcb->bearer.name, bcb->media.name);
1033 bb = kzalloc(sizeof(*bb), GFP_ATOMIC);
1037 __skb_queue_head_init(&bb->arrvq);
1038 spin_lock_init(&tipc_net(net)->bclock);
1041 if (!tipc_link_bc_create(&bb->node,
1042 MAX_PKT_DEFAULT_MCAST,
1050 rcu_assign_pointer(tn->bearer_list[MAX_BEARERS], &bcb->bearer);
1059 void tipc_bcast_reinit(struct net *net)
1061 struct tipc_bc_base *b = tipc_bc_base(net);
1063 msg_set_prevnode(b->link->pmsg, tipc_own_addr(net));
1066 void tipc_bcast_stop(struct net *net)
1068 struct tipc_net *tn = net_generic(net, tipc_net_id);
1070 tipc_bclink_lock(net);
1071 tipc_link_purge_queues(tn->bcl);
1072 tipc_bclink_unlock(net);
1073 RCU_INIT_POINTER(tn->bearer_list[BCBEARER], NULL);
1075 kfree(tn->bcbearer);
1081 * tipc_nmap_add - add a node to a node map
1083 static void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node)
1085 int n = tipc_node(node);
1087 u32 mask = (1 << (n % WSIZE));
1089 if ((nm_ptr->map[w] & mask) == 0) {
1091 nm_ptr->map[w] |= mask;
1096 * tipc_nmap_remove - remove a node from a node map
1098 static void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node)
1100 int n = tipc_node(node);
1102 u32 mask = (1 << (n % WSIZE));
1104 if ((nm_ptr->map[w] & mask) != 0) {
1105 nm_ptr->map[w] &= ~mask;
1111 * tipc_nmap_diff - find differences between node maps
1112 * @nm_a: input node map A
1113 * @nm_b: input node map B
1114 * @nm_diff: output node map A-B (i.e. nodes of A that are not in B)
1116 static void tipc_nmap_diff(struct tipc_node_map *nm_a,
1117 struct tipc_node_map *nm_b,
1118 struct tipc_node_map *nm_diff)
1120 int stop = ARRAY_SIZE(nm_a->map);
1125 memset(nm_diff, 0, sizeof(*nm_diff));
1126 for (w = 0; w < stop; w++) {
1127 map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]);
1128 nm_diff->map[w] = map;
1130 for (b = 0 ; b < WSIZE; b++) {