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.
41 #include "name_distr.h"
44 #define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */
45 #define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */
47 const char tipc_bclink_name[] = "broadcast-link";
49 static void tipc_nmap_diff(struct tipc_node_map *nm_a,
50 struct tipc_node_map *nm_b,
51 struct tipc_node_map *nm_diff);
52 static void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node);
53 static void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node);
55 static void tipc_bclink_lock(struct net *net)
57 struct tipc_net *tn = net_generic(net, tipc_net_id);
59 spin_lock_bh(&tn->bclink->lock);
62 static void tipc_bclink_unlock(struct net *net)
64 struct tipc_net *tn = net_generic(net, tipc_net_id);
66 spin_unlock_bh(&tn->bclink->lock);
69 void tipc_bclink_input(struct net *net)
71 struct tipc_net *tn = net_generic(net, tipc_net_id);
73 tipc_sk_mcast_rcv(net, &tn->bclink->arrvq, &tn->bclink->inputq);
76 uint tipc_bclink_get_mtu(void)
78 return MAX_PKT_DEFAULT_MCAST;
81 static u32 bcbuf_acks(struct sk_buff *buf)
83 return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle;
86 static void bcbuf_set_acks(struct sk_buff *buf, u32 acks)
88 TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks;
91 static void bcbuf_decr_acks(struct sk_buff *buf)
93 bcbuf_set_acks(buf, bcbuf_acks(buf) - 1);
96 void tipc_bclink_add_node(struct net *net, u32 addr)
98 struct tipc_net *tn = net_generic(net, tipc_net_id);
100 tipc_bclink_lock(net);
101 tipc_nmap_add(&tn->bclink->bcast_nodes, addr);
102 tipc_bclink_unlock(net);
105 void tipc_bclink_remove_node(struct net *net, u32 addr)
107 struct tipc_net *tn = net_generic(net, tipc_net_id);
109 tipc_bclink_lock(net);
110 tipc_nmap_remove(&tn->bclink->bcast_nodes, addr);
111 tipc_bclink_unlock(net);
114 static void bclink_set_last_sent(struct net *net)
116 struct tipc_net *tn = net_generic(net, tipc_net_id);
117 struct tipc_link *bcl = tn->bcl;
118 struct sk_buff *skb = skb_peek(&bcl->backlogq);
121 bcl->fsm_msg_cnt = mod(buf_seqno(skb) - 1);
123 bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1);
126 u32 tipc_bclink_get_last_sent(struct net *net)
128 struct tipc_net *tn = net_generic(net, tipc_net_id);
130 return tn->bcl->fsm_msg_cnt;
133 static void bclink_update_last_sent(struct tipc_node *node, u32 seqno)
135 node->bclink.last_sent = less_eq(node->bclink.last_sent, seqno) ?
136 seqno : node->bclink.last_sent;
140 * tipc_bclink_retransmit_to - get most recent node to request retransmission
142 * Called with bclink_lock locked
144 struct tipc_node *tipc_bclink_retransmit_to(struct net *net)
146 struct tipc_net *tn = net_generic(net, tipc_net_id);
148 return tn->bclink->retransmit_to;
152 * bclink_retransmit_pkt - retransmit broadcast packets
153 * @after: sequence number of last packet to *not* retransmit
154 * @to: sequence number of last packet to retransmit
156 * Called with bclink_lock locked
158 static void bclink_retransmit_pkt(struct tipc_net *tn, u32 after, u32 to)
161 struct tipc_link *bcl = tn->bcl;
163 skb_queue_walk(&bcl->transmq, skb) {
164 if (more(buf_seqno(skb), after)) {
165 tipc_link_retransmit(bcl, skb, mod(to - after));
172 * tipc_bclink_wakeup_users - wake up pending users
174 * Called with no locks taken
176 void tipc_bclink_wakeup_users(struct net *net)
178 struct tipc_net *tn = net_generic(net, tipc_net_id);
180 tipc_sk_rcv(net, &tn->bclink->link.wakeupq);
184 * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets
185 * @n_ptr: node that sent acknowledgement info
186 * @acked: broadcast sequence # that has been acknowledged
188 * Node is locked, bclink_lock unlocked.
190 void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked)
192 struct sk_buff *skb, *tmp;
193 unsigned int released = 0;
194 struct net *net = n_ptr->net;
195 struct tipc_net *tn = net_generic(net, tipc_net_id);
197 if (unlikely(!n_ptr->bclink.recv_permitted))
200 tipc_bclink_lock(net);
202 /* Bail out if tx queue is empty (no clean up is required) */
203 skb = skb_peek(&tn->bcl->transmq);
207 /* Determine which messages need to be acknowledged */
208 if (acked == INVALID_LINK_SEQ) {
210 * Contact with specified node has been lost, so need to
211 * acknowledge sent messages only (if other nodes still exist)
212 * or both sent and unsent messages (otherwise)
214 if (tn->bclink->bcast_nodes.count)
215 acked = tn->bcl->fsm_msg_cnt;
217 acked = tn->bcl->next_out_no;
220 * Bail out if specified sequence number does not correspond
221 * to a message that has been sent and not yet acknowledged
223 if (less(acked, buf_seqno(skb)) ||
224 less(tn->bcl->fsm_msg_cnt, acked) ||
225 less_eq(acked, n_ptr->bclink.acked))
229 /* Skip over packets that node has previously acknowledged */
230 skb_queue_walk(&tn->bcl->transmq, skb) {
231 if (more(buf_seqno(skb), n_ptr->bclink.acked))
235 /* Update packets that node is now acknowledging */
236 skb_queue_walk_from_safe(&tn->bcl->transmq, skb, tmp) {
237 if (more(buf_seqno(skb), acked))
239 bcbuf_decr_acks(skb);
240 bclink_set_last_sent(net);
241 if (bcbuf_acks(skb) == 0) {
242 __skb_unlink(skb, &tn->bcl->transmq);
247 n_ptr->bclink.acked = acked;
249 /* Try resolving broadcast link congestion, if necessary */
250 if (unlikely(skb_peek(&tn->bcl->backlogq))) {
251 tipc_link_push_packets(tn->bcl);
252 bclink_set_last_sent(net);
254 if (unlikely(released && !skb_queue_empty(&tn->bcl->wakeupq)))
255 n_ptr->action_flags |= TIPC_WAKEUP_BCAST_USERS;
257 tipc_bclink_unlock(net);
261 * tipc_bclink_update_link_state - update broadcast link state
263 * RCU and node lock set
265 void tipc_bclink_update_link_state(struct tipc_node *n_ptr,
269 struct net *net = n_ptr->net;
270 struct tipc_net *tn = net_generic(net, tipc_net_id);
272 /* Ignore "stale" link state info */
273 if (less_eq(last_sent, n_ptr->bclink.last_in))
276 /* Update link synchronization state; quit if in sync */
277 bclink_update_last_sent(n_ptr, last_sent);
279 if (n_ptr->bclink.last_sent == n_ptr->bclink.last_in)
282 /* Update out-of-sync state; quit if loss is still unconfirmed */
283 if ((++n_ptr->bclink.oos_state) == 1) {
284 if (n_ptr->bclink.deferred_size < (TIPC_MIN_LINK_WIN / 2))
286 n_ptr->bclink.oos_state++;
289 /* Don't NACK if one has been recently sent (or seen) */
290 if (n_ptr->bclink.oos_state & 0x1)
294 buf = tipc_buf_acquire(INT_H_SIZE);
296 struct tipc_msg *msg = buf_msg(buf);
297 struct sk_buff *skb = skb_peek(&n_ptr->bclink.deferdq);
298 u32 to = skb ? buf_seqno(skb) - 1 : n_ptr->bclink.last_sent;
300 tipc_msg_init(tn->own_addr, msg, BCAST_PROTOCOL, STATE_MSG,
301 INT_H_SIZE, n_ptr->addr);
302 msg_set_non_seq(msg, 1);
303 msg_set_mc_netid(msg, tn->net_id);
304 msg_set_bcast_ack(msg, n_ptr->bclink.last_in);
305 msg_set_bcgap_after(msg, n_ptr->bclink.last_in);
306 msg_set_bcgap_to(msg, to);
308 tipc_bclink_lock(net);
309 tipc_bearer_send(net, MAX_BEARERS, buf, NULL);
310 tn->bcl->stats.sent_nacks++;
311 tipc_bclink_unlock(net);
314 n_ptr->bclink.oos_state++;
319 * bclink_peek_nack - monitor retransmission requests sent by other nodes
321 * Delay any upcoming NACK by this node if another node has already
322 * requested the first message this node is going to ask for.
324 static void bclink_peek_nack(struct net *net, struct tipc_msg *msg)
326 struct tipc_node *n_ptr = tipc_node_find(net, msg_destnode(msg));
328 if (unlikely(!n_ptr))
331 tipc_node_lock(n_ptr);
333 if (n_ptr->bclink.recv_permitted &&
334 (n_ptr->bclink.last_in != n_ptr->bclink.last_sent) &&
335 (n_ptr->bclink.last_in == msg_bcgap_after(msg)))
336 n_ptr->bclink.oos_state = 2;
338 tipc_node_unlock(n_ptr);
341 /* tipc_bclink_xmit - deliver buffer chain to all nodes in cluster
342 * and to identified node local sockets
343 * @net: the applicable net namespace
344 * @list: chain of buffers containing message
345 * Consumes the buffer chain, except when returning -ELINKCONG
346 * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE
348 int tipc_bclink_xmit(struct net *net, struct sk_buff_head *list)
350 struct tipc_net *tn = net_generic(net, tipc_net_id);
351 struct tipc_link *bcl = tn->bcl;
352 struct tipc_bclink *bclink = tn->bclink;
356 struct sk_buff_head arrvq;
357 struct sk_buff_head inputq;
359 /* Prepare clone of message for local node */
360 skb = tipc_msg_reassemble(list);
361 if (unlikely(!skb)) {
362 __skb_queue_purge(list);
363 return -EHOSTUNREACH;
365 /* Broadcast to all nodes */
366 if (likely(bclink)) {
367 tipc_bclink_lock(net);
368 if (likely(bclink->bcast_nodes.count)) {
369 rc = __tipc_link_xmit(net, bcl, list);
371 u32 len = skb_queue_len(&bcl->transmq);
373 bclink_set_last_sent(net);
374 bcl->stats.queue_sz_counts++;
375 bcl->stats.accu_queue_sz += len;
379 tipc_bclink_unlock(net);
383 __skb_queue_purge(list);
389 /* Deliver message clone */
390 __skb_queue_head_init(&arrvq);
391 skb_queue_head_init(&inputq);
392 __skb_queue_tail(&arrvq, skb);
393 tipc_sk_mcast_rcv(net, &arrvq, &inputq);
398 * bclink_accept_pkt - accept an incoming, in-sequence broadcast packet
400 * Called with both sending node's lock and bclink_lock taken.
402 static void bclink_accept_pkt(struct tipc_node *node, u32 seqno)
404 struct tipc_net *tn = net_generic(node->net, tipc_net_id);
406 bclink_update_last_sent(node, seqno);
407 node->bclink.last_in = seqno;
408 node->bclink.oos_state = 0;
409 tn->bcl->stats.recv_info++;
412 * Unicast an ACK periodically, ensuring that
413 * all nodes in the cluster don't ACK at the same time
415 if (((seqno - tn->own_addr) % TIPC_MIN_LINK_WIN) == 0) {
416 tipc_link_proto_xmit(node->active_links[node->addr & 1],
417 STATE_MSG, 0, 0, 0, 0, 0);
418 tn->bcl->stats.sent_acks++;
423 * tipc_bclink_rcv - receive a broadcast packet, and deliver upwards
425 * RCU is locked, no other locks set
427 void tipc_bclink_rcv(struct net *net, struct sk_buff *buf)
429 struct tipc_net *tn = net_generic(net, tipc_net_id);
430 struct tipc_link *bcl = tn->bcl;
431 struct tipc_msg *msg = buf_msg(buf);
432 struct tipc_node *node;
437 struct sk_buff *iskb;
438 struct sk_buff_head *arrvq, *inputq;
440 /* Screen out unwanted broadcast messages */
441 if (msg_mc_netid(msg) != tn->net_id)
444 node = tipc_node_find(net, msg_prevnode(msg));
448 tipc_node_lock(node);
449 if (unlikely(!node->bclink.recv_permitted))
452 /* Handle broadcast protocol message */
453 if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) {
454 if (msg_type(msg) != STATE_MSG)
456 if (msg_destnode(msg) == tn->own_addr) {
457 tipc_bclink_acknowledge(node, msg_bcast_ack(msg));
458 tipc_bclink_lock(net);
459 bcl->stats.recv_nacks++;
460 tn->bclink->retransmit_to = node;
461 bclink_retransmit_pkt(tn, msg_bcgap_after(msg),
463 tipc_bclink_unlock(net);
464 tipc_node_unlock(node);
466 tipc_node_unlock(node);
467 bclink_peek_nack(net, msg);
472 /* Handle in-sequence broadcast message */
473 seqno = msg_seqno(msg);
474 next_in = mod(node->bclink.last_in + 1);
475 arrvq = &tn->bclink->arrvq;
476 inputq = &tn->bclink->inputq;
478 if (likely(seqno == next_in)) {
480 /* Deliver message to destination */
481 if (likely(msg_isdata(msg))) {
482 tipc_bclink_lock(net);
483 bclink_accept_pkt(node, seqno);
484 spin_lock_bh(&inputq->lock);
485 __skb_queue_tail(arrvq, buf);
486 spin_unlock_bh(&inputq->lock);
487 node->action_flags |= TIPC_BCAST_MSG_EVT;
488 tipc_bclink_unlock(net);
489 tipc_node_unlock(node);
490 } else if (msg_user(msg) == MSG_BUNDLER) {
491 tipc_bclink_lock(net);
492 bclink_accept_pkt(node, seqno);
493 bcl->stats.recv_bundles++;
494 bcl->stats.recv_bundled += msg_msgcnt(msg);
496 while (tipc_msg_extract(buf, &iskb, &pos)) {
497 spin_lock_bh(&inputq->lock);
498 __skb_queue_tail(arrvq, iskb);
499 spin_unlock_bh(&inputq->lock);
501 node->action_flags |= TIPC_BCAST_MSG_EVT;
502 tipc_bclink_unlock(net);
503 tipc_node_unlock(node);
504 } else if (msg_user(msg) == MSG_FRAGMENTER) {
505 tipc_bclink_lock(net);
506 bclink_accept_pkt(node, seqno);
507 tipc_buf_append(&node->bclink.reasm_buf, &buf);
508 if (unlikely(!buf && !node->bclink.reasm_buf)) {
509 tipc_bclink_unlock(net);
512 bcl->stats.recv_fragments++;
514 bcl->stats.recv_fragmented++;
516 tipc_bclink_unlock(net);
519 tipc_bclink_unlock(net);
520 tipc_node_unlock(node);
522 tipc_bclink_lock(net);
523 bclink_accept_pkt(node, seqno);
524 tipc_bclink_unlock(net);
525 tipc_node_unlock(node);
530 /* Determine new synchronization state */
531 tipc_node_lock(node);
532 if (unlikely(!tipc_node_is_up(node)))
535 if (node->bclink.last_in == node->bclink.last_sent)
538 if (skb_queue_empty(&node->bclink.deferdq)) {
539 node->bclink.oos_state = 1;
543 msg = buf_msg(skb_peek(&node->bclink.deferdq));
544 seqno = msg_seqno(msg);
545 next_in = mod(next_in + 1);
546 if (seqno != next_in)
549 /* Take in-sequence message from deferred queue & deliver it */
550 buf = __skb_dequeue(&node->bclink.deferdq);
554 /* Handle out-of-sequence broadcast message */
555 if (less(next_in, seqno)) {
556 deferred = tipc_link_defer_pkt(&node->bclink.deferdq,
558 bclink_update_last_sent(node, seqno);
562 tipc_bclink_lock(net);
565 bcl->stats.deferred_recv++;
567 bcl->stats.duplicates++;
569 tipc_bclink_unlock(net);
572 tipc_node_unlock(node);
577 u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr)
579 return (n_ptr->bclink.recv_permitted &&
580 (tipc_bclink_get_last_sent(n_ptr->net) != n_ptr->bclink.acked));
585 * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer
587 * Send packet over as many bearers as necessary to reach all nodes
588 * that have joined the broadcast link.
590 * Returns 0 (packet sent successfully) under all circumstances,
591 * since the broadcast link's pseudo-bearer never blocks
593 static int tipc_bcbearer_send(struct net *net, struct sk_buff *buf,
594 struct tipc_bearer *unused1,
595 struct tipc_media_addr *unused2)
598 struct tipc_msg *msg = buf_msg(buf);
599 struct tipc_net *tn = net_generic(net, tipc_net_id);
600 struct tipc_bcbearer *bcbearer = tn->bcbearer;
601 struct tipc_bclink *bclink = tn->bclink;
603 /* Prepare broadcast link message for reliable transmission,
604 * if first time trying to send it;
605 * preparation is skipped for broadcast link protocol messages
606 * since they are sent in an unreliable manner and don't need it
608 if (likely(!msg_non_seq(buf_msg(buf)))) {
609 bcbuf_set_acks(buf, bclink->bcast_nodes.count);
610 msg_set_non_seq(msg, 1);
611 msg_set_mc_netid(msg, tn->net_id);
612 tn->bcl->stats.sent_info++;
613 if (WARN_ON(!bclink->bcast_nodes.count)) {
619 /* Send buffer over bearers until all targets reached */
620 bcbearer->remains = bclink->bcast_nodes;
622 for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) {
623 struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary;
624 struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary;
625 struct tipc_bearer *bp[2] = {p, s};
626 struct tipc_bearer *b = bp[msg_link_selector(msg)];
627 struct sk_buff *tbuf;
630 break; /* No more bearers to try */
633 tipc_nmap_diff(&bcbearer->remains, &b->nodes,
634 &bcbearer->remains_new);
635 if (bcbearer->remains_new.count == bcbearer->remains.count)
636 continue; /* Nothing added by bearer pair */
639 /* Use original buffer for first bearer */
640 tipc_bearer_send(net, b->identity, buf, &b->bcast_addr);
642 /* Avoid concurrent buffer access */
643 tbuf = pskb_copy_for_clone(buf, GFP_ATOMIC);
646 tipc_bearer_send(net, b->identity, tbuf,
648 kfree_skb(tbuf); /* Bearer keeps a clone */
650 if (bcbearer->remains_new.count == 0)
651 break; /* All targets reached */
653 bcbearer->remains = bcbearer->remains_new;
660 * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer
662 void tipc_bcbearer_sort(struct net *net, struct tipc_node_map *nm_ptr,
663 u32 node, bool action)
665 struct tipc_net *tn = net_generic(net, tipc_net_id);
666 struct tipc_bcbearer *bcbearer = tn->bcbearer;
667 struct tipc_bcbearer_pair *bp_temp = bcbearer->bpairs_temp;
668 struct tipc_bcbearer_pair *bp_curr;
669 struct tipc_bearer *b;
673 tipc_bclink_lock(net);
676 tipc_nmap_add(nm_ptr, node);
678 tipc_nmap_remove(nm_ptr, node);
680 /* Group bearers by priority (can assume max of two per priority) */
681 memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp));
684 for (b_index = 0; b_index < MAX_BEARERS; b_index++) {
685 b = rcu_dereference_rtnl(tn->bearer_list[b_index]);
686 if (!b || !b->nodes.count)
689 if (!bp_temp[b->priority].primary)
690 bp_temp[b->priority].primary = b;
692 bp_temp[b->priority].secondary = b;
696 /* Create array of bearer pairs for broadcasting */
697 bp_curr = bcbearer->bpairs;
698 memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs));
700 for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) {
702 if (!bp_temp[pri].primary)
705 bp_curr->primary = bp_temp[pri].primary;
707 if (bp_temp[pri].secondary) {
708 if (tipc_nmap_equal(&bp_temp[pri].primary->nodes,
709 &bp_temp[pri].secondary->nodes)) {
710 bp_curr->secondary = bp_temp[pri].secondary;
713 bp_curr->primary = bp_temp[pri].secondary;
720 tipc_bclink_unlock(net);
723 static int __tipc_nl_add_bc_link_stat(struct sk_buff *skb,
724 struct tipc_stats *stats)
734 struct nla_map map[] = {
735 {TIPC_NLA_STATS_RX_INFO, stats->recv_info},
736 {TIPC_NLA_STATS_RX_FRAGMENTS, stats->recv_fragments},
737 {TIPC_NLA_STATS_RX_FRAGMENTED, stats->recv_fragmented},
738 {TIPC_NLA_STATS_RX_BUNDLES, stats->recv_bundles},
739 {TIPC_NLA_STATS_RX_BUNDLED, stats->recv_bundled},
740 {TIPC_NLA_STATS_TX_INFO, stats->sent_info},
741 {TIPC_NLA_STATS_TX_FRAGMENTS, stats->sent_fragments},
742 {TIPC_NLA_STATS_TX_FRAGMENTED, stats->sent_fragmented},
743 {TIPC_NLA_STATS_TX_BUNDLES, stats->sent_bundles},
744 {TIPC_NLA_STATS_TX_BUNDLED, stats->sent_bundled},
745 {TIPC_NLA_STATS_RX_NACKS, stats->recv_nacks},
746 {TIPC_NLA_STATS_RX_DEFERRED, stats->deferred_recv},
747 {TIPC_NLA_STATS_TX_NACKS, stats->sent_nacks},
748 {TIPC_NLA_STATS_TX_ACKS, stats->sent_acks},
749 {TIPC_NLA_STATS_RETRANSMITTED, stats->retransmitted},
750 {TIPC_NLA_STATS_DUPLICATES, stats->duplicates},
751 {TIPC_NLA_STATS_LINK_CONGS, stats->link_congs},
752 {TIPC_NLA_STATS_MAX_QUEUE, stats->max_queue_sz},
753 {TIPC_NLA_STATS_AVG_QUEUE, stats->queue_sz_counts ?
754 (stats->accu_queue_sz / stats->queue_sz_counts) : 0}
757 nest = nla_nest_start(skb, TIPC_NLA_LINK_STATS);
761 for (i = 0; i < ARRAY_SIZE(map); i++)
762 if (nla_put_u32(skb, map[i].key, map[i].val))
765 nla_nest_end(skb, nest);
769 nla_nest_cancel(skb, nest);
774 int tipc_nl_add_bc_link(struct net *net, struct tipc_nl_msg *msg)
778 struct nlattr *attrs;
780 struct tipc_net *tn = net_generic(net, tipc_net_id);
781 struct tipc_link *bcl = tn->bcl;
786 tipc_bclink_lock(net);
788 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
789 NLM_F_MULTI, TIPC_NL_LINK_GET);
793 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK);
797 /* The broadcast link is always up */
798 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
801 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_BROADCAST))
803 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, bcl->name))
805 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, bcl->next_in_no))
807 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, bcl->next_out_no))
810 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP);
813 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, bcl->window))
815 nla_nest_end(msg->skb, prop);
817 err = __tipc_nl_add_bc_link_stat(msg->skb, &bcl->stats);
821 tipc_bclink_unlock(net);
822 nla_nest_end(msg->skb, attrs);
823 genlmsg_end(msg->skb, hdr);
828 nla_nest_cancel(msg->skb, prop);
830 nla_nest_cancel(msg->skb, attrs);
832 tipc_bclink_unlock(net);
833 genlmsg_cancel(msg->skb, hdr);
838 int tipc_bclink_reset_stats(struct net *net)
840 struct tipc_net *tn = net_generic(net, tipc_net_id);
841 struct tipc_link *bcl = tn->bcl;
846 tipc_bclink_lock(net);
847 memset(&bcl->stats, 0, sizeof(bcl->stats));
848 tipc_bclink_unlock(net);
852 int tipc_bclink_set_queue_limits(struct net *net, u32 limit)
854 struct tipc_net *tn = net_generic(net, tipc_net_id);
855 struct tipc_link *bcl = tn->bcl;
859 if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN))
862 tipc_bclink_lock(net);
863 tipc_link_set_queue_limits(bcl, limit);
864 tipc_bclink_unlock(net);
868 int tipc_bclink_init(struct net *net)
870 struct tipc_net *tn = net_generic(net, tipc_net_id);
871 struct tipc_bcbearer *bcbearer;
872 struct tipc_bclink *bclink;
873 struct tipc_link *bcl;
875 bcbearer = kzalloc(sizeof(*bcbearer), GFP_ATOMIC);
879 bclink = kzalloc(sizeof(*bclink), GFP_ATOMIC);
886 bcbearer->bearer.media = &bcbearer->media;
887 bcbearer->media.send_msg = tipc_bcbearer_send;
888 sprintf(bcbearer->media.name, "tipc-broadcast");
890 spin_lock_init(&bclink->lock);
891 __skb_queue_head_init(&bcl->transmq);
892 __skb_queue_head_init(&bcl->backlogq);
893 __skb_queue_head_init(&bcl->deferdq);
894 skb_queue_head_init(&bcl->wakeupq);
895 bcl->next_out_no = 1;
896 spin_lock_init(&bclink->node.lock);
897 __skb_queue_head_init(&bclink->arrvq);
898 skb_queue_head_init(&bclink->inputq);
899 bcl->owner = &bclink->node;
900 bcl->owner->net = net;
901 bcl->max_pkt = MAX_PKT_DEFAULT_MCAST;
902 tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT);
903 bcl->bearer_id = MAX_BEARERS;
904 rcu_assign_pointer(tn->bearer_list[MAX_BEARERS], &bcbearer->bearer);
905 bcl->state = WORKING_WORKING;
906 bcl->pmsg = (struct tipc_msg *)&bcl->proto_msg;
907 msg_set_prevnode(bcl->pmsg, tn->own_addr);
908 strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME);
909 tn->bcbearer = bcbearer;
915 void tipc_bclink_stop(struct net *net)
917 struct tipc_net *tn = net_generic(net, tipc_net_id);
919 tipc_bclink_lock(net);
920 tipc_link_purge_queues(tn->bcl);
921 tipc_bclink_unlock(net);
923 RCU_INIT_POINTER(tn->bearer_list[BCBEARER], NULL);
930 * tipc_nmap_add - add a node to a node map
932 static void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node)
934 int n = tipc_node(node);
936 u32 mask = (1 << (n % WSIZE));
938 if ((nm_ptr->map[w] & mask) == 0) {
940 nm_ptr->map[w] |= mask;
945 * tipc_nmap_remove - remove a node from a node map
947 static void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node)
949 int n = tipc_node(node);
951 u32 mask = (1 << (n % WSIZE));
953 if ((nm_ptr->map[w] & mask) != 0) {
954 nm_ptr->map[w] &= ~mask;
960 * tipc_nmap_diff - find differences between node maps
961 * @nm_a: input node map A
962 * @nm_b: input node map B
963 * @nm_diff: output node map A-B (i.e. nodes of A that are not in B)
965 static void tipc_nmap_diff(struct tipc_node_map *nm_a,
966 struct tipc_node_map *nm_b,
967 struct tipc_node_map *nm_diff)
969 int stop = ARRAY_SIZE(nm_a->map);
974 memset(nm_diff, 0, sizeof(*nm_diff));
975 for (w = 0; w < stop; w++) {
976 map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]);
977 nm_diff->map[w] = map;
979 for (b = 0 ; b < WSIZE; b++) {