2 * net/tipc/bcast.c: TIPC broadcast code
4 * Copyright (c) 2004-2006, 2014, 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.
43 #include "name_distr.h"
45 #define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */
46 #define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */
47 #define BCBEARER MAX_BEARERS
50 * struct tipc_bcbearer_pair - a pair of bearers used by broadcast link
51 * @primary: pointer to primary bearer
52 * @secondary: pointer to secondary bearer
54 * Bearers must have same priority and same set of reachable destinations
58 struct tipc_bcbearer_pair
{
59 struct tipc_bearer
*primary
;
60 struct tipc_bearer
*secondary
;
64 * struct tipc_bcbearer - bearer used by broadcast link
65 * @bearer: (non-standard) broadcast bearer structure
66 * @media: (non-standard) broadcast media structure
67 * @bpairs: array of bearer pairs
68 * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort()
69 * @remains: temporary node map used by tipc_bcbearer_send()
70 * @remains_new: temporary node map used tipc_bcbearer_send()
72 * Note: The fields labelled "temporary" are incorporated into the bearer
73 * to avoid consuming potentially limited stack space through the use of
74 * large local variables within multicast routines. Concurrent access is
75 * prevented through use of the spinlock "bclink_lock".
77 struct tipc_bcbearer
{
78 struct tipc_bearer bearer
;
79 struct tipc_media media
;
80 struct tipc_bcbearer_pair bpairs
[MAX_BEARERS
];
81 struct tipc_bcbearer_pair bpairs_temp
[TIPC_MAX_LINK_PRI
+ 1];
82 struct tipc_node_map remains
;
83 struct tipc_node_map remains_new
;
87 * struct tipc_bclink - link used for broadcast messages
88 * @lock: spinlock governing access to structure
89 * @link: (non-standard) broadcast link structure
90 * @node: (non-standard) node structure representing b'cast link's peer node
91 * @flags: represent bclink states
92 * @bcast_nodes: map of broadcast-capable nodes
93 * @retransmit_to: node that most recently requested a retransmit
95 * Handles sequence numbering, fragmentation, bundling, etc.
99 struct tipc_link link
;
100 struct tipc_node node
;
102 struct tipc_node_map bcast_nodes
;
103 struct tipc_node
*retransmit_to
;
106 static struct tipc_bcbearer
*bcbearer
;
107 static struct tipc_bclink
*bclink
;
108 static struct tipc_link
*bcl
;
110 const char tipc_bclink_name
[] = "broadcast-link";
112 static void tipc_nmap_diff(struct tipc_node_map
*nm_a
,
113 struct tipc_node_map
*nm_b
,
114 struct tipc_node_map
*nm_diff
);
115 static void tipc_nmap_add(struct tipc_node_map
*nm_ptr
, u32 node
);
116 static void tipc_nmap_remove(struct tipc_node_map
*nm_ptr
, u32 node
);
118 static void tipc_bclink_lock(void)
120 spin_lock_bh(&bclink
->lock
);
123 static void tipc_bclink_unlock(void)
125 struct tipc_node
*node
= NULL
;
127 if (likely(!bclink
->flags
)) {
128 spin_unlock_bh(&bclink
->lock
);
132 if (bclink
->flags
& TIPC_BCLINK_RESET
) {
133 bclink
->flags
&= ~TIPC_BCLINK_RESET
;
134 node
= tipc_bclink_retransmit_to();
136 spin_unlock_bh(&bclink
->lock
);
139 tipc_link_reset_all(node
);
142 uint
tipc_bclink_get_mtu(void)
144 return MAX_PKT_DEFAULT_MCAST
;
147 void tipc_bclink_set_flags(unsigned int flags
)
149 bclink
->flags
|= flags
;
152 static u32
bcbuf_acks(struct sk_buff
*buf
)
154 return (u32
)(unsigned long)TIPC_SKB_CB(buf
)->handle
;
157 static void bcbuf_set_acks(struct sk_buff
*buf
, u32 acks
)
159 TIPC_SKB_CB(buf
)->handle
= (void *)(unsigned long)acks
;
162 static void bcbuf_decr_acks(struct sk_buff
*buf
)
164 bcbuf_set_acks(buf
, bcbuf_acks(buf
) - 1);
167 void tipc_bclink_add_node(u32 addr
)
170 tipc_nmap_add(&bclink
->bcast_nodes
, addr
);
171 tipc_bclink_unlock();
174 void tipc_bclink_remove_node(u32 addr
)
177 tipc_nmap_remove(&bclink
->bcast_nodes
, addr
);
178 tipc_bclink_unlock();
181 static void bclink_set_last_sent(void)
184 bcl
->fsm_msg_cnt
= mod(buf_seqno(bcl
->next_out
) - 1);
186 bcl
->fsm_msg_cnt
= mod(bcl
->next_out_no
- 1);
189 u32
tipc_bclink_get_last_sent(void)
191 return bcl
->fsm_msg_cnt
;
194 static void bclink_update_last_sent(struct tipc_node
*node
, u32 seqno
)
196 node
->bclink
.last_sent
= less_eq(node
->bclink
.last_sent
, seqno
) ?
197 seqno
: node
->bclink
.last_sent
;
202 * tipc_bclink_retransmit_to - get most recent node to request retransmission
204 * Called with bclink_lock locked
206 struct tipc_node
*tipc_bclink_retransmit_to(void)
208 return bclink
->retransmit_to
;
212 * bclink_retransmit_pkt - retransmit broadcast packets
213 * @after: sequence number of last packet to *not* retransmit
214 * @to: sequence number of last packet to retransmit
216 * Called with bclink_lock locked
218 static void bclink_retransmit_pkt(u32 after
, u32 to
)
222 buf
= bcl
->first_out
;
223 while (buf
&& less_eq(buf_seqno(buf
), after
))
225 tipc_link_retransmit(bcl
, buf
, mod(to
- after
));
229 * tipc_bclink_wakeup_users - wake up pending users
231 * Called with no locks taken
233 void tipc_bclink_wakeup_users(void)
235 while (skb_queue_len(&bclink
->link
.waiting_sks
))
236 tipc_sk_rcv(skb_dequeue(&bclink
->link
.waiting_sks
));
240 * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets
241 * @n_ptr: node that sent acknowledgement info
242 * @acked: broadcast sequence # that has been acknowledged
244 * Node is locked, bclink_lock unlocked.
246 void tipc_bclink_acknowledge(struct tipc_node
*n_ptr
, u32 acked
)
249 struct sk_buff
*next
;
250 unsigned int released
= 0;
253 /* Bail out if tx queue is empty (no clean up is required) */
254 crs
= bcl
->first_out
;
258 /* Determine which messages need to be acknowledged */
259 if (acked
== INVALID_LINK_SEQ
) {
261 * Contact with specified node has been lost, so need to
262 * acknowledge sent messages only (if other nodes still exist)
263 * or both sent and unsent messages (otherwise)
265 if (bclink
->bcast_nodes
.count
)
266 acked
= bcl
->fsm_msg_cnt
;
268 acked
= bcl
->next_out_no
;
271 * Bail out if specified sequence number does not correspond
272 * to a message that has been sent and not yet acknowledged
274 if (less(acked
, buf_seqno(crs
)) ||
275 less(bcl
->fsm_msg_cnt
, acked
) ||
276 less_eq(acked
, n_ptr
->bclink
.acked
))
280 /* Skip over packets that node has previously acknowledged */
281 while (crs
&& less_eq(buf_seqno(crs
), n_ptr
->bclink
.acked
))
284 /* Update packets that node is now acknowledging */
286 while (crs
&& less_eq(buf_seqno(crs
), acked
)) {
289 if (crs
!= bcl
->next_out
)
290 bcbuf_decr_acks(crs
);
292 bcbuf_set_acks(crs
, 0);
293 bcl
->next_out
= next
;
294 bclink_set_last_sent();
297 if (bcbuf_acks(crs
) == 0) {
298 bcl
->first_out
= next
;
299 bcl
->out_queue_size
--;
305 n_ptr
->bclink
.acked
= acked
;
307 /* Try resolving broadcast link congestion, if necessary */
309 if (unlikely(bcl
->next_out
)) {
310 tipc_link_push_queue(bcl
);
311 bclink_set_last_sent();
313 if (unlikely(released
&& !skb_queue_empty(&bcl
->waiting_sks
)))
314 n_ptr
->action_flags
|= TIPC_WAKEUP_BCAST_USERS
;
317 tipc_bclink_unlock();
321 * tipc_bclink_update_link_state - update broadcast link state
323 * RCU and node lock set
325 void tipc_bclink_update_link_state(struct tipc_node
*n_ptr
, u32 last_sent
)
329 /* Ignore "stale" link state info */
331 if (less_eq(last_sent
, n_ptr
->bclink
.last_in
))
334 /* Update link synchronization state; quit if in sync */
336 bclink_update_last_sent(n_ptr
, last_sent
);
338 if (n_ptr
->bclink
.last_sent
== n_ptr
->bclink
.last_in
)
341 /* Update out-of-sync state; quit if loss is still unconfirmed */
343 if ((++n_ptr
->bclink
.oos_state
) == 1) {
344 if (n_ptr
->bclink
.deferred_size
< (TIPC_MIN_LINK_WIN
/ 2))
346 n_ptr
->bclink
.oos_state
++;
349 /* Don't NACK if one has been recently sent (or seen) */
351 if (n_ptr
->bclink
.oos_state
& 0x1)
356 buf
= tipc_buf_acquire(INT_H_SIZE
);
358 struct tipc_msg
*msg
= buf_msg(buf
);
360 tipc_msg_init(msg
, BCAST_PROTOCOL
, STATE_MSG
,
361 INT_H_SIZE
, n_ptr
->addr
);
362 msg_set_non_seq(msg
, 1);
363 msg_set_mc_netid(msg
, tipc_net_id
);
364 msg_set_bcast_ack(msg
, n_ptr
->bclink
.last_in
);
365 msg_set_bcgap_after(msg
, n_ptr
->bclink
.last_in
);
366 msg_set_bcgap_to(msg
, n_ptr
->bclink
.deferred_head
367 ? buf_seqno(n_ptr
->bclink
.deferred_head
) - 1
368 : n_ptr
->bclink
.last_sent
);
371 tipc_bearer_send(MAX_BEARERS
, buf
, NULL
);
372 bcl
->stats
.sent_nacks
++;
373 tipc_bclink_unlock();
376 n_ptr
->bclink
.oos_state
++;
381 * bclink_peek_nack - monitor retransmission requests sent by other nodes
383 * Delay any upcoming NACK by this node if another node has already
384 * requested the first message this node is going to ask for.
386 static void bclink_peek_nack(struct tipc_msg
*msg
)
388 struct tipc_node
*n_ptr
= tipc_node_find(msg_destnode(msg
));
390 if (unlikely(!n_ptr
))
393 tipc_node_lock(n_ptr
);
395 if (n_ptr
->bclink
.recv_permitted
&&
396 (n_ptr
->bclink
.last_in
!= n_ptr
->bclink
.last_sent
) &&
397 (n_ptr
->bclink
.last_in
== msg_bcgap_after(msg
)))
398 n_ptr
->bclink
.oos_state
= 2;
400 tipc_node_unlock(n_ptr
);
403 /* tipc_bclink_xmit - broadcast buffer chain to all nodes in cluster
404 * and to identified node local sockets
405 * @buf: chain of buffers containing message
406 * Consumes the buffer chain, except when returning -ELINKCONG
407 * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE
409 int tipc_bclink_xmit(struct sk_buff
*buf
)
413 struct sk_buff
*clbuf
;
415 /* Prepare clone of message for local node */
416 clbuf
= tipc_msg_reassemble(buf
);
417 if (unlikely(!clbuf
)) {
419 return -EHOSTUNREACH
;
422 /* Broadcast to all other nodes */
423 if (likely(bclink
)) {
425 if (likely(bclink
->bcast_nodes
.count
)) {
426 rc
= __tipc_link_xmit(bcl
, buf
);
428 bclink_set_last_sent();
429 bcl
->stats
.queue_sz_counts
++;
430 bcl
->stats
.accu_queue_sz
+= bcl
->out_queue_size
;
434 tipc_bclink_unlock();
440 /* Deliver message clone */
442 tipc_sk_mcast_rcv(clbuf
);
450 * bclink_accept_pkt - accept an incoming, in-sequence broadcast packet
452 * Called with both sending node's lock and bclink_lock taken.
454 static void bclink_accept_pkt(struct tipc_node
*node
, u32 seqno
)
456 bclink_update_last_sent(node
, seqno
);
457 node
->bclink
.last_in
= seqno
;
458 node
->bclink
.oos_state
= 0;
459 bcl
->stats
.recv_info
++;
462 * Unicast an ACK periodically, ensuring that
463 * all nodes in the cluster don't ACK at the same time
466 if (((seqno
- tipc_own_addr
) % TIPC_MIN_LINK_WIN
) == 0) {
467 tipc_link_proto_xmit(node
->active_links
[node
->addr
& 1],
468 STATE_MSG
, 0, 0, 0, 0, 0);
469 bcl
->stats
.sent_acks
++;
474 * tipc_bclink_rcv - receive a broadcast packet, and deliver upwards
476 * RCU is locked, no other locks set
478 void tipc_bclink_rcv(struct sk_buff
*buf
)
480 struct tipc_msg
*msg
= buf_msg(buf
);
481 struct tipc_node
*node
;
486 /* Screen out unwanted broadcast messages */
488 if (msg_mc_netid(msg
) != tipc_net_id
)
491 node
= tipc_node_find(msg_prevnode(msg
));
495 tipc_node_lock(node
);
496 if (unlikely(!node
->bclink
.recv_permitted
))
499 /* Handle broadcast protocol message */
501 if (unlikely(msg_user(msg
) == BCAST_PROTOCOL
)) {
502 if (msg_type(msg
) != STATE_MSG
)
504 if (msg_destnode(msg
) == tipc_own_addr
) {
505 tipc_bclink_acknowledge(node
, msg_bcast_ack(msg
));
506 tipc_node_unlock(node
);
508 bcl
->stats
.recv_nacks
++;
509 bclink
->retransmit_to
= node
;
510 bclink_retransmit_pkt(msg_bcgap_after(msg
),
512 tipc_bclink_unlock();
514 tipc_node_unlock(node
);
515 bclink_peek_nack(msg
);
520 /* Handle in-sequence broadcast message */
522 seqno
= msg_seqno(msg
);
523 next_in
= mod(node
->bclink
.last_in
+ 1);
525 if (likely(seqno
== next_in
)) {
527 /* Deliver message to destination */
529 if (likely(msg_isdata(msg
))) {
531 bclink_accept_pkt(node
, seqno
);
532 tipc_bclink_unlock();
533 tipc_node_unlock(node
);
534 if (likely(msg_mcast(msg
)))
535 tipc_sk_mcast_rcv(buf
);
538 } else if (msg_user(msg
) == MSG_BUNDLER
) {
540 bclink_accept_pkt(node
, seqno
);
541 bcl
->stats
.recv_bundles
++;
542 bcl
->stats
.recv_bundled
+= msg_msgcnt(msg
);
543 tipc_bclink_unlock();
544 tipc_node_unlock(node
);
545 tipc_link_bundle_rcv(buf
);
546 } else if (msg_user(msg
) == MSG_FRAGMENTER
) {
547 tipc_buf_append(&node
->bclink
.reasm_buf
, &buf
);
548 if (unlikely(!buf
&& !node
->bclink
.reasm_buf
))
551 bclink_accept_pkt(node
, seqno
);
552 bcl
->stats
.recv_fragments
++;
554 bcl
->stats
.recv_fragmented
++;
556 tipc_bclink_unlock();
559 tipc_bclink_unlock();
560 tipc_node_unlock(node
);
561 } else if (msg_user(msg
) == NAME_DISTRIBUTOR
) {
563 bclink_accept_pkt(node
, seqno
);
564 tipc_bclink_unlock();
565 tipc_node_unlock(node
);
569 bclink_accept_pkt(node
, seqno
);
570 tipc_bclink_unlock();
571 tipc_node_unlock(node
);
576 /* Determine new synchronization state */
578 tipc_node_lock(node
);
579 if (unlikely(!tipc_node_is_up(node
)))
582 if (node
->bclink
.last_in
== node
->bclink
.last_sent
)
585 if (!node
->bclink
.deferred_head
) {
586 node
->bclink
.oos_state
= 1;
590 msg
= buf_msg(node
->bclink
.deferred_head
);
591 seqno
= msg_seqno(msg
);
592 next_in
= mod(next_in
+ 1);
593 if (seqno
!= next_in
)
596 /* Take in-sequence message from deferred queue & deliver it */
598 buf
= node
->bclink
.deferred_head
;
599 node
->bclink
.deferred_head
= buf
->next
;
601 node
->bclink
.deferred_size
--;
605 /* Handle out-of-sequence broadcast message */
607 if (less(next_in
, seqno
)) {
608 deferred
= tipc_link_defer_pkt(&node
->bclink
.deferred_head
,
609 &node
->bclink
.deferred_tail
,
611 node
->bclink
.deferred_size
+= deferred
;
612 bclink_update_last_sent(node
, seqno
);
619 bcl
->stats
.deferred_recv
++;
621 bcl
->stats
.duplicates
++;
623 tipc_bclink_unlock();
626 tipc_node_unlock(node
);
631 u32
tipc_bclink_acks_missing(struct tipc_node
*n_ptr
)
633 return (n_ptr
->bclink
.recv_permitted
&&
634 (tipc_bclink_get_last_sent() != n_ptr
->bclink
.acked
));
639 * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer
641 * Send packet over as many bearers as necessary to reach all nodes
642 * that have joined the broadcast link.
644 * Returns 0 (packet sent successfully) under all circumstances,
645 * since the broadcast link's pseudo-bearer never blocks
647 static int tipc_bcbearer_send(struct sk_buff
*buf
, struct tipc_bearer
*unused1
,
648 struct tipc_media_addr
*unused2
)
651 struct tipc_msg
*msg
= buf_msg(buf
);
653 /* Prepare broadcast link message for reliable transmission,
654 * if first time trying to send it;
655 * preparation is skipped for broadcast link protocol messages
656 * since they are sent in an unreliable manner and don't need it
658 if (likely(!msg_non_seq(buf_msg(buf
)))) {
659 bcbuf_set_acks(buf
, bclink
->bcast_nodes
.count
);
660 msg_set_non_seq(msg
, 1);
661 msg_set_mc_netid(msg
, tipc_net_id
);
662 bcl
->stats
.sent_info
++;
664 if (WARN_ON(!bclink
->bcast_nodes
.count
)) {
670 /* Send buffer over bearers until all targets reached */
671 bcbearer
->remains
= bclink
->bcast_nodes
;
673 for (bp_index
= 0; bp_index
< MAX_BEARERS
; bp_index
++) {
674 struct tipc_bearer
*p
= bcbearer
->bpairs
[bp_index
].primary
;
675 struct tipc_bearer
*s
= bcbearer
->bpairs
[bp_index
].secondary
;
676 struct tipc_bearer
*bp
[2] = {p
, s
};
677 struct tipc_bearer
*b
= bp
[msg_link_selector(msg
)];
678 struct sk_buff
*tbuf
;
681 break; /* No more bearers to try */
684 tipc_nmap_diff(&bcbearer
->remains
, &b
->nodes
,
685 &bcbearer
->remains_new
);
686 if (bcbearer
->remains_new
.count
== bcbearer
->remains
.count
)
687 continue; /* Nothing added by bearer pair */
690 /* Use original buffer for first bearer */
691 tipc_bearer_send(b
->identity
, buf
, &b
->bcast_addr
);
693 /* Avoid concurrent buffer access */
694 tbuf
= pskb_copy_for_clone(buf
, GFP_ATOMIC
);
697 tipc_bearer_send(b
->identity
, tbuf
, &b
->bcast_addr
);
698 kfree_skb(tbuf
); /* Bearer keeps a clone */
700 if (bcbearer
->remains_new
.count
== 0)
701 break; /* All targets reached */
703 bcbearer
->remains
= bcbearer
->remains_new
;
710 * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer
712 void tipc_bcbearer_sort(struct tipc_node_map
*nm_ptr
, u32 node
, bool action
)
714 struct tipc_bcbearer_pair
*bp_temp
= bcbearer
->bpairs_temp
;
715 struct tipc_bcbearer_pair
*bp_curr
;
716 struct tipc_bearer
*b
;
723 tipc_nmap_add(nm_ptr
, node
);
725 tipc_nmap_remove(nm_ptr
, node
);
727 /* Group bearers by priority (can assume max of two per priority) */
728 memset(bp_temp
, 0, sizeof(bcbearer
->bpairs_temp
));
731 for (b_index
= 0; b_index
< MAX_BEARERS
; b_index
++) {
732 b
= rcu_dereference_rtnl(bearer_list
[b_index
]);
733 if (!b
|| !b
->nodes
.count
)
736 if (!bp_temp
[b
->priority
].primary
)
737 bp_temp
[b
->priority
].primary
= b
;
739 bp_temp
[b
->priority
].secondary
= b
;
743 /* Create array of bearer pairs for broadcasting */
744 bp_curr
= bcbearer
->bpairs
;
745 memset(bcbearer
->bpairs
, 0, sizeof(bcbearer
->bpairs
));
747 for (pri
= TIPC_MAX_LINK_PRI
; pri
>= 0; pri
--) {
749 if (!bp_temp
[pri
].primary
)
752 bp_curr
->primary
= bp_temp
[pri
].primary
;
754 if (bp_temp
[pri
].secondary
) {
755 if (tipc_nmap_equal(&bp_temp
[pri
].primary
->nodes
,
756 &bp_temp
[pri
].secondary
->nodes
)) {
757 bp_curr
->secondary
= bp_temp
[pri
].secondary
;
760 bp_curr
->primary
= bp_temp
[pri
].secondary
;
767 tipc_bclink_unlock();
771 int tipc_bclink_stats(char *buf
, const u32 buf_size
)
774 struct tipc_stats
*s
;
783 ret
= tipc_snprintf(buf
, buf_size
, "Link <%s>\n"
784 " Window:%u packets\n",
785 bcl
->name
, bcl
->queue_limit
[0]);
786 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
787 " RX packets:%u fragments:%u/%u bundles:%u/%u\n",
788 s
->recv_info
, s
->recv_fragments
,
789 s
->recv_fragmented
, s
->recv_bundles
,
791 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
792 " TX packets:%u fragments:%u/%u bundles:%u/%u\n",
793 s
->sent_info
, s
->sent_fragments
,
794 s
->sent_fragmented
, s
->sent_bundles
,
796 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
797 " RX naks:%u defs:%u dups:%u\n",
798 s
->recv_nacks
, s
->deferred_recv
, s
->duplicates
);
799 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
800 " TX naks:%u acks:%u dups:%u\n",
801 s
->sent_nacks
, s
->sent_acks
, s
->retransmitted
);
802 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
803 " Congestion link:%u Send queue max:%u avg:%u\n",
804 s
->link_congs
, s
->max_queue_sz
,
806 (s
->accu_queue_sz
/ s
->queue_sz_counts
) : 0);
808 tipc_bclink_unlock();
812 int tipc_bclink_reset_stats(void)
818 memset(&bcl
->stats
, 0, sizeof(bcl
->stats
));
819 tipc_bclink_unlock();
823 int tipc_bclink_set_queue_limits(u32 limit
)
827 if ((limit
< TIPC_MIN_LINK_WIN
) || (limit
> TIPC_MAX_LINK_WIN
))
831 tipc_link_set_queue_limits(bcl
, limit
);
832 tipc_bclink_unlock();
836 int tipc_bclink_init(void)
838 bcbearer
= kzalloc(sizeof(*bcbearer
), GFP_ATOMIC
);
842 bclink
= kzalloc(sizeof(*bclink
), GFP_ATOMIC
);
849 bcbearer
->bearer
.media
= &bcbearer
->media
;
850 bcbearer
->media
.send_msg
= tipc_bcbearer_send
;
851 sprintf(bcbearer
->media
.name
, "tipc-broadcast");
853 spin_lock_init(&bclink
->lock
);
854 __skb_queue_head_init(&bcl
->waiting_sks
);
855 bcl
->next_out_no
= 1;
856 spin_lock_init(&bclink
->node
.lock
);
857 __skb_queue_head_init(&bclink
->node
.waiting_sks
);
858 bcl
->owner
= &bclink
->node
;
859 bcl
->max_pkt
= MAX_PKT_DEFAULT_MCAST
;
860 tipc_link_set_queue_limits(bcl
, BCLINK_WIN_DEFAULT
);
861 bcl
->bearer_id
= MAX_BEARERS
;
862 rcu_assign_pointer(bearer_list
[MAX_BEARERS
], &bcbearer
->bearer
);
863 bcl
->state
= WORKING_WORKING
;
864 strlcpy(bcl
->name
, tipc_bclink_name
, TIPC_MAX_LINK_NAME
);
868 void tipc_bclink_stop(void)
871 tipc_link_purge_queues(bcl
);
872 tipc_bclink_unlock();
874 RCU_INIT_POINTER(bearer_list
[BCBEARER
], NULL
);
881 * tipc_nmap_add - add a node to a node map
883 static void tipc_nmap_add(struct tipc_node_map
*nm_ptr
, u32 node
)
885 int n
= tipc_node(node
);
887 u32 mask
= (1 << (n
% WSIZE
));
889 if ((nm_ptr
->map
[w
] & mask
) == 0) {
891 nm_ptr
->map
[w
] |= mask
;
896 * tipc_nmap_remove - remove a node from a node map
898 static void tipc_nmap_remove(struct tipc_node_map
*nm_ptr
, u32 node
)
900 int n
= tipc_node(node
);
902 u32 mask
= (1 << (n
% WSIZE
));
904 if ((nm_ptr
->map
[w
] & mask
) != 0) {
905 nm_ptr
->map
[w
] &= ~mask
;
911 * tipc_nmap_diff - find differences between node maps
912 * @nm_a: input node map A
913 * @nm_b: input node map B
914 * @nm_diff: output node map A-B (i.e. nodes of A that are not in B)
916 static void tipc_nmap_diff(struct tipc_node_map
*nm_a
,
917 struct tipc_node_map
*nm_b
,
918 struct tipc_node_map
*nm_diff
)
920 int stop
= ARRAY_SIZE(nm_a
->map
);
925 memset(nm_diff
, 0, sizeof(*nm_diff
));
926 for (w
= 0; w
< stop
; w
++) {
927 map
= nm_a
->map
[w
] ^ (nm_a
->map
[w
] & nm_b
->map
[w
]);
928 nm_diff
->map
[w
] = map
;
930 for (b
= 0 ; b
< WSIZE
; b
++) {
939 * tipc_port_list_add - add a port to a port list, ensuring no duplicates
941 void tipc_port_list_add(struct tipc_port_list
*pl_ptr
, u32 port
)
943 struct tipc_port_list
*item
= pl_ptr
;
945 int item_sz
= PLSIZE
;
946 int cnt
= pl_ptr
->count
;
948 for (; ; cnt
-= item_sz
, item
= item
->next
) {
951 for (i
= 0; i
< item_sz
; i
++)
952 if (item
->ports
[i
] == port
)
955 item
->ports
[i
] = port
;
960 item
->next
= kmalloc(sizeof(*item
), GFP_ATOMIC
);
962 pr_warn("Incomplete multicast delivery, no memory\n");
965 item
->next
->next
= NULL
;
971 * tipc_port_list_free - free dynamically created entries in port_list chain
974 void tipc_port_list_free(struct tipc_port_list
*pl_ptr
)
976 struct tipc_port_list
*item
;
977 struct tipc_port_list
*next
;
979 for (item
= pl_ptr
->next
; item
; item
= next
) {