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);
112 /* Last node? => reset backlog queue */
113 if (!tn->bclink->bcast_nodes.count)
114 tipc_link_purge_backlog(&tn->bclink->link);
116 tipc_bclink_unlock(net);
119 static void bclink_set_last_sent(struct net *net)
121 struct tipc_net *tn = net_generic(net, tipc_net_id);
122 struct tipc_link *bcl = tn->bcl;
124 bcl->silent_intv_cnt = mod(bcl->snd_nxt - 1);
127 u32 tipc_bclink_get_last_sent(struct net *net)
129 struct tipc_net *tn = net_generic(net, tipc_net_id);
131 return tn->bcl->silent_intv_cnt;
134 static void bclink_update_last_sent(struct tipc_node *node, u32 seqno)
136 node->bclink.last_sent = less_eq(node->bclink.last_sent, seqno) ?
137 seqno : node->bclink.last_sent;
141 * tipc_bclink_retransmit_to - get most recent node to request retransmission
143 * Called with bclink_lock locked
145 struct tipc_node *tipc_bclink_retransmit_to(struct net *net)
147 struct tipc_net *tn = net_generic(net, tipc_net_id);
149 return tn->bclink->retransmit_to;
153 * bclink_retransmit_pkt - retransmit broadcast packets
154 * @after: sequence number of last packet to *not* retransmit
155 * @to: sequence number of last packet to retransmit
157 * Called with bclink_lock locked
159 static void bclink_retransmit_pkt(struct tipc_net *tn, u32 after, u32 to)
162 struct tipc_link *bcl = tn->bcl;
164 skb_queue_walk(&bcl->transmq, skb) {
165 if (more(buf_seqno(skb), after)) {
166 tipc_link_retransmit(bcl, skb, mod(to - after));
173 * bclink_prepare_wakeup - prepare users for wakeup after congestion
174 * @bcl: broadcast link
175 * @resultq: queue for users which can be woken up
176 * Move a number of waiting users, as permitted by available space in
177 * the send queue, from link wait queue to specified queue for wakeup
179 static void bclink_prepare_wakeup(struct tipc_link *bcl, struct sk_buff_head *resultq)
181 int pnd[TIPC_SYSTEM_IMPORTANCE + 1] = {0,};
183 struct sk_buff *skb, *tmp;
185 skb_queue_walk_safe(&bcl->wakeupq, skb, tmp) {
186 imp = TIPC_SKB_CB(skb)->chain_imp;
187 lim = bcl->window + bcl->backlog[imp].limit;
188 pnd[imp] += TIPC_SKB_CB(skb)->chain_sz;
189 if ((pnd[imp] + bcl->backlog[imp].len) >= lim)
191 skb_unlink(skb, &bcl->wakeupq);
192 skb_queue_tail(resultq, skb);
197 * tipc_bclink_wakeup_users - wake up pending users
199 * Called with no locks taken
201 void tipc_bclink_wakeup_users(struct net *net)
203 struct tipc_net *tn = net_generic(net, tipc_net_id);
204 struct tipc_link *bcl = tn->bcl;
205 struct sk_buff_head resultq;
207 skb_queue_head_init(&resultq);
208 bclink_prepare_wakeup(bcl, &resultq);
209 tipc_sk_rcv(net, &resultq);
213 * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets
214 * @n_ptr: node that sent acknowledgement info
215 * @acked: broadcast sequence # that has been acknowledged
217 * Node is locked, bclink_lock unlocked.
219 void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked)
221 struct sk_buff *skb, *tmp;
222 unsigned int released = 0;
223 struct net *net = n_ptr->net;
224 struct tipc_net *tn = net_generic(net, tipc_net_id);
226 if (unlikely(!n_ptr->bclink.recv_permitted))
229 tipc_bclink_lock(net);
231 /* Bail out if tx queue is empty (no clean up is required) */
232 skb = skb_peek(&tn->bcl->transmq);
236 /* Determine which messages need to be acknowledged */
237 if (acked == INVALID_LINK_SEQ) {
239 * Contact with specified node has been lost, so need to
240 * acknowledge sent messages only (if other nodes still exist)
241 * or both sent and unsent messages (otherwise)
243 if (tn->bclink->bcast_nodes.count)
244 acked = tn->bcl->silent_intv_cnt;
246 acked = tn->bcl->snd_nxt;
249 * Bail out if specified sequence number does not correspond
250 * to a message that has been sent and not yet acknowledged
252 if (less(acked, buf_seqno(skb)) ||
253 less(tn->bcl->silent_intv_cnt, acked) ||
254 less_eq(acked, n_ptr->bclink.acked))
258 /* Skip over packets that node has previously acknowledged */
259 skb_queue_walk(&tn->bcl->transmq, skb) {
260 if (more(buf_seqno(skb), n_ptr->bclink.acked))
264 /* Update packets that node is now acknowledging */
265 skb_queue_walk_from_safe(&tn->bcl->transmq, skb, tmp) {
266 if (more(buf_seqno(skb), acked))
268 bcbuf_decr_acks(skb);
269 bclink_set_last_sent(net);
270 if (bcbuf_acks(skb) == 0) {
271 __skb_unlink(skb, &tn->bcl->transmq);
276 n_ptr->bclink.acked = acked;
278 /* Try resolving broadcast link congestion, if necessary */
279 if (unlikely(skb_peek(&tn->bcl->backlogq))) {
280 tipc_link_push_packets(tn->bcl);
281 bclink_set_last_sent(net);
283 if (unlikely(released && !skb_queue_empty(&tn->bcl->wakeupq)))
284 n_ptr->action_flags |= TIPC_WAKEUP_BCAST_USERS;
286 tipc_bclink_unlock(net);
290 * tipc_bclink_update_link_state - update broadcast link state
292 * RCU and node lock set
294 void tipc_bclink_update_link_state(struct tipc_node *n_ptr,
298 struct net *net = n_ptr->net;
299 struct tipc_net *tn = net_generic(net, tipc_net_id);
301 /* Ignore "stale" link state info */
302 if (less_eq(last_sent, n_ptr->bclink.last_in))
305 /* Update link synchronization state; quit if in sync */
306 bclink_update_last_sent(n_ptr, last_sent);
308 if (n_ptr->bclink.last_sent == n_ptr->bclink.last_in)
311 /* Update out-of-sync state; quit if loss is still unconfirmed */
312 if ((++n_ptr->bclink.oos_state) == 1) {
313 if (n_ptr->bclink.deferred_size < (TIPC_MIN_LINK_WIN / 2))
315 n_ptr->bclink.oos_state++;
318 /* Don't NACK if one has been recently sent (or seen) */
319 if (n_ptr->bclink.oos_state & 0x1)
323 buf = tipc_buf_acquire(INT_H_SIZE);
325 struct tipc_msg *msg = buf_msg(buf);
326 struct sk_buff *skb = skb_peek(&n_ptr->bclink.deferdq);
327 u32 to = skb ? buf_seqno(skb) - 1 : n_ptr->bclink.last_sent;
329 tipc_msg_init(tn->own_addr, msg, BCAST_PROTOCOL, STATE_MSG,
330 INT_H_SIZE, n_ptr->addr);
331 msg_set_non_seq(msg, 1);
332 msg_set_mc_netid(msg, tn->net_id);
333 msg_set_bcast_ack(msg, n_ptr->bclink.last_in);
334 msg_set_bcgap_after(msg, n_ptr->bclink.last_in);
335 msg_set_bcgap_to(msg, to);
337 tipc_bclink_lock(net);
338 tipc_bearer_send(net, MAX_BEARERS, buf, NULL);
339 tn->bcl->stats.sent_nacks++;
340 tipc_bclink_unlock(net);
343 n_ptr->bclink.oos_state++;
347 void tipc_bclink_sync_state(struct tipc_node *n, struct tipc_msg *hdr)
349 u16 last = msg_last_bcast(hdr);
350 int mtyp = msg_type(hdr);
352 if (unlikely(msg_user(hdr) != LINK_PROTOCOL))
354 if (mtyp == STATE_MSG) {
355 tipc_bclink_update_link_state(n, last);
358 /* Compatibility: older nodes don't know BCAST_PROTOCOL synchronization,
359 * and transfer synch info in LINK_PROTOCOL messages.
361 if (tipc_node_is_up(n))
363 if ((mtyp != RESET_MSG) && (mtyp != ACTIVATE_MSG))
365 n->bclink.last_sent = last;
366 n->bclink.last_in = last;
367 n->bclink.oos_state = 0;
371 * bclink_peek_nack - monitor retransmission requests sent by other nodes
373 * Delay any upcoming NACK by this node if another node has already
374 * requested the first message this node is going to ask for.
376 static void bclink_peek_nack(struct net *net, struct tipc_msg *msg)
378 struct tipc_node *n_ptr = tipc_node_find(net, msg_destnode(msg));
380 if (unlikely(!n_ptr))
383 tipc_node_lock(n_ptr);
384 if (n_ptr->bclink.recv_permitted &&
385 (n_ptr->bclink.last_in != n_ptr->bclink.last_sent) &&
386 (n_ptr->bclink.last_in == msg_bcgap_after(msg)))
387 n_ptr->bclink.oos_state = 2;
388 tipc_node_unlock(n_ptr);
389 tipc_node_put(n_ptr);
392 /* tipc_bclink_xmit - deliver buffer chain to all nodes in cluster
393 * and to identified node local sockets
394 * @net: the applicable net namespace
395 * @list: chain of buffers containing message
396 * Consumes the buffer chain, except when returning -ELINKCONG
397 * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE
399 int tipc_bclink_xmit(struct net *net, struct sk_buff_head *list)
401 struct tipc_net *tn = net_generic(net, tipc_net_id);
402 struct tipc_link *bcl = tn->bcl;
403 struct tipc_bclink *bclink = tn->bclink;
407 struct sk_buff_head arrvq;
408 struct sk_buff_head inputq;
410 /* Prepare clone of message for local node */
411 skb = tipc_msg_reassemble(list);
413 return -EHOSTUNREACH;
415 /* Broadcast to all nodes */
416 if (likely(bclink)) {
417 tipc_bclink_lock(net);
418 if (likely(bclink->bcast_nodes.count)) {
419 rc = __tipc_link_xmit(net, bcl, list);
421 u32 len = skb_queue_len(&bcl->transmq);
423 bclink_set_last_sent(net);
424 bcl->stats.queue_sz_counts++;
425 bcl->stats.accu_queue_sz += len;
429 tipc_bclink_unlock(net);
433 __skb_queue_purge(list);
439 /* Deliver message clone */
440 __skb_queue_head_init(&arrvq);
441 skb_queue_head_init(&inputq);
442 __skb_queue_tail(&arrvq, skb);
443 tipc_sk_mcast_rcv(net, &arrvq, &inputq);
448 * bclink_accept_pkt - accept an incoming, in-sequence broadcast packet
450 * Called with both sending node's lock and bclink_lock taken.
452 static void bclink_accept_pkt(struct tipc_node *node, u32 seqno)
454 struct tipc_net *tn = net_generic(node->net, tipc_net_id);
456 bclink_update_last_sent(node, seqno);
457 node->bclink.last_in = seqno;
458 node->bclink.oos_state = 0;
459 tn->bcl->stats.recv_info++;
462 * Unicast an ACK periodically, ensuring that
463 * all nodes in the cluster don't ACK at the same time
465 if (((seqno - tn->own_addr) % TIPC_MIN_LINK_WIN) == 0) {
466 tipc_link_proto_xmit(node_active_link(node, node->addr),
467 STATE_MSG, 0, 0, 0, 0);
468 tn->bcl->stats.sent_acks++;
473 * tipc_bclink_rcv - receive a broadcast packet, and deliver upwards
475 * RCU is locked, no other locks set
477 void tipc_bclink_rcv(struct net *net, struct sk_buff *buf)
479 struct tipc_net *tn = net_generic(net, tipc_net_id);
480 struct tipc_link *bcl = tn->bcl;
481 struct tipc_msg *msg = buf_msg(buf);
482 struct tipc_node *node;
487 struct sk_buff *iskb;
488 struct sk_buff_head *arrvq, *inputq;
490 /* Screen out unwanted broadcast messages */
491 if (msg_mc_netid(msg) != tn->net_id)
494 node = tipc_node_find(net, msg_prevnode(msg));
498 tipc_node_lock(node);
499 if (unlikely(!node->bclink.recv_permitted))
502 /* Handle broadcast protocol message */
503 if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) {
504 if (msg_type(msg) != STATE_MSG)
506 if (msg_destnode(msg) == tn->own_addr) {
507 tipc_bclink_acknowledge(node, msg_bcast_ack(msg));
508 tipc_bclink_lock(net);
509 bcl->stats.recv_nacks++;
510 tn->bclink->retransmit_to = node;
511 bclink_retransmit_pkt(tn, msg_bcgap_after(msg),
513 tipc_bclink_unlock(net);
514 tipc_node_unlock(node);
516 tipc_node_unlock(node);
517 bclink_peek_nack(net, msg);
523 /* Handle in-sequence broadcast message */
524 seqno = msg_seqno(msg);
525 next_in = mod(node->bclink.last_in + 1);
526 arrvq = &tn->bclink->arrvq;
527 inputq = &tn->bclink->inputq;
529 if (likely(seqno == next_in)) {
531 /* Deliver message to destination */
532 if (likely(msg_isdata(msg))) {
533 tipc_bclink_lock(net);
534 bclink_accept_pkt(node, seqno);
535 spin_lock_bh(&inputq->lock);
536 __skb_queue_tail(arrvq, buf);
537 spin_unlock_bh(&inputq->lock);
538 node->action_flags |= TIPC_BCAST_MSG_EVT;
539 tipc_bclink_unlock(net);
540 tipc_node_unlock(node);
541 } else if (msg_user(msg) == MSG_BUNDLER) {
542 tipc_bclink_lock(net);
543 bclink_accept_pkt(node, seqno);
544 bcl->stats.recv_bundles++;
545 bcl->stats.recv_bundled += msg_msgcnt(msg);
547 while (tipc_msg_extract(buf, &iskb, &pos)) {
548 spin_lock_bh(&inputq->lock);
549 __skb_queue_tail(arrvq, iskb);
550 spin_unlock_bh(&inputq->lock);
552 node->action_flags |= TIPC_BCAST_MSG_EVT;
553 tipc_bclink_unlock(net);
554 tipc_node_unlock(node);
555 } else if (msg_user(msg) == MSG_FRAGMENTER) {
556 tipc_bclink_lock(net);
557 bclink_accept_pkt(node, seqno);
558 tipc_buf_append(&node->bclink.reasm_buf, &buf);
559 if (unlikely(!buf && !node->bclink.reasm_buf)) {
560 tipc_bclink_unlock(net);
563 bcl->stats.recv_fragments++;
565 bcl->stats.recv_fragmented++;
567 tipc_bclink_unlock(net);
570 tipc_bclink_unlock(net);
571 tipc_node_unlock(node);
573 tipc_bclink_lock(net);
574 bclink_accept_pkt(node, seqno);
575 tipc_bclink_unlock(net);
576 tipc_node_unlock(node);
581 /* Determine new synchronization state */
582 tipc_node_lock(node);
583 if (unlikely(!tipc_node_is_up(node)))
586 if (node->bclink.last_in == node->bclink.last_sent)
589 if (skb_queue_empty(&node->bclink.deferdq)) {
590 node->bclink.oos_state = 1;
594 msg = buf_msg(skb_peek(&node->bclink.deferdq));
595 seqno = msg_seqno(msg);
596 next_in = mod(next_in + 1);
597 if (seqno != next_in)
600 /* Take in-sequence message from deferred queue & deliver it */
601 buf = __skb_dequeue(&node->bclink.deferdq);
605 /* Handle out-of-sequence broadcast message */
606 if (less(next_in, seqno)) {
607 deferred = tipc_link_defer_pkt(&node->bclink.deferdq,
609 bclink_update_last_sent(node, seqno);
613 tipc_bclink_lock(net);
616 bcl->stats.deferred_recv++;
618 bcl->stats.duplicates++;
620 tipc_bclink_unlock(net);
623 tipc_node_unlock(node);
629 u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr)
631 return (n_ptr->bclink.recv_permitted &&
632 (tipc_bclink_get_last_sent(n_ptr->net) != n_ptr->bclink.acked));
637 * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer
639 * Send packet over as many bearers as necessary to reach all nodes
640 * that have joined the broadcast link.
642 * Returns 0 (packet sent successfully) under all circumstances,
643 * since the broadcast link's pseudo-bearer never blocks
645 static int tipc_bcbearer_send(struct net *net, struct sk_buff *buf,
646 struct tipc_bearer *unused1,
647 struct tipc_media_addr *unused2)
650 struct tipc_msg *msg = buf_msg(buf);
651 struct tipc_net *tn = net_generic(net, tipc_net_id);
652 struct tipc_bcbearer *bcbearer = tn->bcbearer;
653 struct tipc_bclink *bclink = tn->bclink;
655 /* Prepare broadcast link message for reliable transmission,
656 * if first time trying to send it;
657 * preparation is skipped for broadcast link protocol messages
658 * since they are sent in an unreliable manner and don't need it
660 if (likely(!msg_non_seq(buf_msg(buf)))) {
661 bcbuf_set_acks(buf, bclink->bcast_nodes.count);
662 msg_set_non_seq(msg, 1);
663 msg_set_mc_netid(msg, tn->net_id);
664 tn->bcl->stats.sent_info++;
665 if (WARN_ON(!bclink->bcast_nodes.count)) {
671 /* Send buffer over bearers until all targets reached */
672 bcbearer->remains = bclink->bcast_nodes;
674 for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) {
675 struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary;
676 struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary;
677 struct tipc_bearer *bp[2] = {p, s};
678 struct tipc_bearer *b = bp[msg_link_selector(msg)];
679 struct sk_buff *tbuf;
682 break; /* No more bearers to try */
685 tipc_nmap_diff(&bcbearer->remains, &b->nodes,
686 &bcbearer->remains_new);
687 if (bcbearer->remains_new.count == bcbearer->remains.count)
688 continue; /* Nothing added by bearer pair */
691 /* Use original buffer for first bearer */
692 tipc_bearer_send(net, b->identity, buf, &b->bcast_addr);
694 /* Avoid concurrent buffer access */
695 tbuf = pskb_copy_for_clone(buf, GFP_ATOMIC);
698 tipc_bearer_send(net, b->identity, tbuf,
700 kfree_skb(tbuf); /* Bearer keeps a clone */
702 if (bcbearer->remains_new.count == 0)
703 break; /* All targets reached */
705 bcbearer->remains = bcbearer->remains_new;
712 * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer
714 void tipc_bcbearer_sort(struct net *net, struct tipc_node_map *nm_ptr,
715 u32 node, bool action)
717 struct tipc_net *tn = net_generic(net, tipc_net_id);
718 struct tipc_bcbearer *bcbearer = tn->bcbearer;
719 struct tipc_bcbearer_pair *bp_temp = bcbearer->bpairs_temp;
720 struct tipc_bcbearer_pair *bp_curr;
721 struct tipc_bearer *b;
725 tipc_bclink_lock(net);
728 tipc_nmap_add(nm_ptr, node);
730 tipc_nmap_remove(nm_ptr, node);
732 /* Group bearers by priority (can assume max of two per priority) */
733 memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp));
736 for (b_index = 0; b_index < MAX_BEARERS; b_index++) {
737 b = rcu_dereference_rtnl(tn->bearer_list[b_index]);
738 if (!b || !b->nodes.count)
741 if (!bp_temp[b->priority].primary)
742 bp_temp[b->priority].primary = b;
744 bp_temp[b->priority].secondary = b;
748 /* Create array of bearer pairs for broadcasting */
749 bp_curr = bcbearer->bpairs;
750 memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs));
752 for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) {
754 if (!bp_temp[pri].primary)
757 bp_curr->primary = bp_temp[pri].primary;
759 if (bp_temp[pri].secondary) {
760 if (tipc_nmap_equal(&bp_temp[pri].primary->nodes,
761 &bp_temp[pri].secondary->nodes)) {
762 bp_curr->secondary = bp_temp[pri].secondary;
765 bp_curr->primary = bp_temp[pri].secondary;
772 tipc_bclink_unlock(net);
775 static int __tipc_nl_add_bc_link_stat(struct sk_buff *skb,
776 struct tipc_stats *stats)
786 struct nla_map map[] = {
787 {TIPC_NLA_STATS_RX_INFO, stats->recv_info},
788 {TIPC_NLA_STATS_RX_FRAGMENTS, stats->recv_fragments},
789 {TIPC_NLA_STATS_RX_FRAGMENTED, stats->recv_fragmented},
790 {TIPC_NLA_STATS_RX_BUNDLES, stats->recv_bundles},
791 {TIPC_NLA_STATS_RX_BUNDLED, stats->recv_bundled},
792 {TIPC_NLA_STATS_TX_INFO, stats->sent_info},
793 {TIPC_NLA_STATS_TX_FRAGMENTS, stats->sent_fragments},
794 {TIPC_NLA_STATS_TX_FRAGMENTED, stats->sent_fragmented},
795 {TIPC_NLA_STATS_TX_BUNDLES, stats->sent_bundles},
796 {TIPC_NLA_STATS_TX_BUNDLED, stats->sent_bundled},
797 {TIPC_NLA_STATS_RX_NACKS, stats->recv_nacks},
798 {TIPC_NLA_STATS_RX_DEFERRED, stats->deferred_recv},
799 {TIPC_NLA_STATS_TX_NACKS, stats->sent_nacks},
800 {TIPC_NLA_STATS_TX_ACKS, stats->sent_acks},
801 {TIPC_NLA_STATS_RETRANSMITTED, stats->retransmitted},
802 {TIPC_NLA_STATS_DUPLICATES, stats->duplicates},
803 {TIPC_NLA_STATS_LINK_CONGS, stats->link_congs},
804 {TIPC_NLA_STATS_MAX_QUEUE, stats->max_queue_sz},
805 {TIPC_NLA_STATS_AVG_QUEUE, stats->queue_sz_counts ?
806 (stats->accu_queue_sz / stats->queue_sz_counts) : 0}
809 nest = nla_nest_start(skb, TIPC_NLA_LINK_STATS);
813 for (i = 0; i < ARRAY_SIZE(map); i++)
814 if (nla_put_u32(skb, map[i].key, map[i].val))
817 nla_nest_end(skb, nest);
821 nla_nest_cancel(skb, nest);
826 int tipc_nl_add_bc_link(struct net *net, struct tipc_nl_msg *msg)
830 struct nlattr *attrs;
832 struct tipc_net *tn = net_generic(net, tipc_net_id);
833 struct tipc_link *bcl = tn->bcl;
838 tipc_bclink_lock(net);
840 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
841 NLM_F_MULTI, TIPC_NL_LINK_GET);
845 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK);
849 /* The broadcast link is always up */
850 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
853 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_BROADCAST))
855 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, bcl->name))
857 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, bcl->rcv_nxt))
859 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, bcl->snd_nxt))
862 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP);
865 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, bcl->window))
867 nla_nest_end(msg->skb, prop);
869 err = __tipc_nl_add_bc_link_stat(msg->skb, &bcl->stats);
873 tipc_bclink_unlock(net);
874 nla_nest_end(msg->skb, attrs);
875 genlmsg_end(msg->skb, hdr);
880 nla_nest_cancel(msg->skb, prop);
882 nla_nest_cancel(msg->skb, attrs);
884 tipc_bclink_unlock(net);
885 genlmsg_cancel(msg->skb, hdr);
890 int tipc_bclink_reset_stats(struct net *net)
892 struct tipc_net *tn = net_generic(net, tipc_net_id);
893 struct tipc_link *bcl = tn->bcl;
898 tipc_bclink_lock(net);
899 memset(&bcl->stats, 0, sizeof(bcl->stats));
900 tipc_bclink_unlock(net);
904 int tipc_bclink_set_queue_limits(struct net *net, u32 limit)
906 struct tipc_net *tn = net_generic(net, tipc_net_id);
907 struct tipc_link *bcl = tn->bcl;
911 if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN))
914 tipc_bclink_lock(net);
915 tipc_link_set_queue_limits(bcl, limit);
916 tipc_bclink_unlock(net);
920 int tipc_nl_bc_link_set(struct net *net, struct nlattr *attrs[])
924 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
926 if (!attrs[TIPC_NLA_LINK_PROP])
929 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP], props);
933 if (!props[TIPC_NLA_PROP_WIN])
936 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
938 return tipc_bclink_set_queue_limits(net, win);
941 int tipc_bclink_init(struct net *net)
943 struct tipc_net *tn = net_generic(net, tipc_net_id);
944 struct tipc_bcbearer *bcbearer;
945 struct tipc_bclink *bclink;
946 struct tipc_link *bcl;
948 bcbearer = kzalloc(sizeof(*bcbearer), GFP_ATOMIC);
952 bclink = kzalloc(sizeof(*bclink), GFP_ATOMIC);
959 bcbearer->bearer.media = &bcbearer->media;
960 bcbearer->media.send_msg = tipc_bcbearer_send;
961 sprintf(bcbearer->media.name, "tipc-broadcast");
963 spin_lock_init(&bclink->lock);
964 __skb_queue_head_init(&bcl->transmq);
965 __skb_queue_head_init(&bcl->backlogq);
966 __skb_queue_head_init(&bcl->deferdq);
967 skb_queue_head_init(&bcl->wakeupq);
969 spin_lock_init(&bclink->node.lock);
970 __skb_queue_head_init(&bclink->arrvq);
971 skb_queue_head_init(&bclink->inputq);
972 bcl->owner = &bclink->node;
973 bcl->owner->net = net;
974 bcl->mtu = MAX_PKT_DEFAULT_MCAST;
975 tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT);
976 bcl->bearer_id = MAX_BEARERS;
977 rcu_assign_pointer(tn->bearer_list[MAX_BEARERS], &bcbearer->bearer);
978 bcl->pmsg = (struct tipc_msg *)&bcl->proto_msg;
979 msg_set_prevnode(bcl->pmsg, tn->own_addr);
980 strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME);
981 tn->bcbearer = bcbearer;
987 void tipc_bclink_stop(struct net *net)
989 struct tipc_net *tn = net_generic(net, tipc_net_id);
991 tipc_bclink_lock(net);
992 tipc_link_purge_queues(tn->bcl);
993 tipc_bclink_unlock(net);
995 RCU_INIT_POINTER(tn->bearer_list[BCBEARER], NULL);
1002 * tipc_nmap_add - add a node to a node map
1004 static void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node)
1006 int n = tipc_node(node);
1008 u32 mask = (1 << (n % WSIZE));
1010 if ((nm_ptr->map[w] & mask) == 0) {
1012 nm_ptr->map[w] |= mask;
1017 * tipc_nmap_remove - remove a node from a node map
1019 static void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node)
1021 int n = tipc_node(node);
1023 u32 mask = (1 << (n % WSIZE));
1025 if ((nm_ptr->map[w] & mask) != 0) {
1026 nm_ptr->map[w] &= ~mask;
1032 * tipc_nmap_diff - find differences between node maps
1033 * @nm_a: input node map A
1034 * @nm_b: input node map B
1035 * @nm_diff: output node map A-B (i.e. nodes of A that are not in B)
1037 static void tipc_nmap_diff(struct tipc_node_map *nm_a,
1038 struct tipc_node_map *nm_b,
1039 struct tipc_node_map *nm_diff)
1041 int stop = ARRAY_SIZE(nm_a->map);
1046 memset(nm_diff, 0, sizeof(*nm_diff));
1047 for (w = 0; w < stop; w++) {
1048 map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]);
1049 nm_diff->map[w] = map;
1051 for (b = 0 ; b < WSIZE; b++) {