2 * net/tipc/bcast.c: TIPC broadcast code
4 * Copyright (c) 2004-2006, 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.
42 #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) */
46 #define BCBEARER MAX_BEARERS
49 * struct tipc_bcbearer_pair - a pair of bearers used by broadcast link
50 * @primary: pointer to primary bearer
51 * @secondary: pointer to secondary bearer
53 * Bearers must have same priority and same set of reachable destinations
57 struct tipc_bcbearer_pair
{
58 struct tipc_bearer
*primary
;
59 struct tipc_bearer
*secondary
;
63 * struct tipc_bcbearer - bearer used by broadcast link
64 * @bearer: (non-standard) broadcast bearer structure
65 * @media: (non-standard) broadcast media structure
66 * @bpairs: array of bearer pairs
67 * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort()
68 * @remains: temporary node map used by tipc_bcbearer_send()
69 * @remains_new: temporary node map used tipc_bcbearer_send()
71 * Note: The fields labelled "temporary" are incorporated into the bearer
72 * to avoid consuming potentially limited stack space through the use of
73 * large local variables within multicast routines. Concurrent access is
74 * prevented through use of the spinlock "bc_lock".
76 struct tipc_bcbearer
{
77 struct tipc_bearer bearer
;
78 struct tipc_media media
;
79 struct tipc_bcbearer_pair bpairs
[MAX_BEARERS
];
80 struct tipc_bcbearer_pair bpairs_temp
[TIPC_MAX_LINK_PRI
+ 1];
81 struct tipc_node_map remains
;
82 struct tipc_node_map remains_new
;
86 * struct tipc_bclink - link used for broadcast messages
87 * @link: (non-standard) broadcast link structure
88 * @node: (non-standard) node structure representing b'cast link's peer node
89 * @bcast_nodes: map of broadcast-capable nodes
90 * @retransmit_to: node that most recently requested a retransmit
92 * Handles sequence numbering, fragmentation, bundling, etc.
95 struct tipc_link link
;
96 struct tipc_node node
;
97 struct tipc_node_map bcast_nodes
;
98 struct tipc_node
*retransmit_to
;
101 static struct tipc_bcbearer bcast_bearer
;
102 static struct tipc_bclink bcast_link
;
104 static struct tipc_bcbearer
*bcbearer
= &bcast_bearer
;
105 static struct tipc_bclink
*bclink
= &bcast_link
;
106 static struct tipc_link
*bcl
= &bcast_link
.link
;
108 static DEFINE_SPINLOCK(bc_lock
);
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
);
116 static u32
bcbuf_acks(struct sk_buff
*buf
)
118 return (u32
)(unsigned long)TIPC_SKB_CB(buf
)->handle
;
121 static void bcbuf_set_acks(struct sk_buff
*buf
, u32 acks
)
123 TIPC_SKB_CB(buf
)->handle
= (void *)(unsigned long)acks
;
126 static void bcbuf_decr_acks(struct sk_buff
*buf
)
128 bcbuf_set_acks(buf
, bcbuf_acks(buf
) - 1);
131 void tipc_bclink_add_node(u32 addr
)
133 spin_lock_bh(&bc_lock
);
134 tipc_nmap_add(&bclink
->bcast_nodes
, addr
);
135 spin_unlock_bh(&bc_lock
);
138 void tipc_bclink_remove_node(u32 addr
)
140 spin_lock_bh(&bc_lock
);
141 tipc_nmap_remove(&bclink
->bcast_nodes
, addr
);
142 spin_unlock_bh(&bc_lock
);
145 static void bclink_set_last_sent(void)
148 bcl
->fsm_msg_cnt
= mod(buf_seqno(bcl
->next_out
) - 1);
150 bcl
->fsm_msg_cnt
= mod(bcl
->next_out_no
- 1);
153 u32
tipc_bclink_get_last_sent(void)
155 return bcl
->fsm_msg_cnt
;
158 static void bclink_update_last_sent(struct tipc_node
*node
, u32 seqno
)
160 node
->bclink
.last_sent
= less_eq(node
->bclink
.last_sent
, seqno
) ?
161 seqno
: node
->bclink
.last_sent
;
166 * tipc_bclink_retransmit_to - get most recent node to request retransmission
168 * Called with bc_lock locked
170 struct tipc_node
*tipc_bclink_retransmit_to(void)
172 return bclink
->retransmit_to
;
176 * bclink_retransmit_pkt - retransmit broadcast packets
177 * @after: sequence number of last packet to *not* retransmit
178 * @to: sequence number of last packet to retransmit
180 * Called with bc_lock locked
182 static void bclink_retransmit_pkt(u32 after
, u32 to
)
186 buf
= bcl
->first_out
;
187 while (buf
&& less_eq(buf_seqno(buf
), after
))
189 tipc_link_retransmit(bcl
, buf
, mod(to
- after
));
193 * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets
194 * @n_ptr: node that sent acknowledgement info
195 * @acked: broadcast sequence # that has been acknowledged
197 * Node is locked, bc_lock unlocked.
199 void tipc_bclink_acknowledge(struct tipc_node
*n_ptr
, u32 acked
)
202 struct sk_buff
*next
;
203 unsigned int released
= 0;
205 spin_lock_bh(&bc_lock
);
207 /* Bail out if tx queue is empty (no clean up is required) */
208 crs
= bcl
->first_out
;
212 /* Determine which messages need to be acknowledged */
213 if (acked
== INVALID_LINK_SEQ
) {
215 * Contact with specified node has been lost, so need to
216 * acknowledge sent messages only (if other nodes still exist)
217 * or both sent and unsent messages (otherwise)
219 if (bclink
->bcast_nodes
.count
)
220 acked
= bcl
->fsm_msg_cnt
;
222 acked
= bcl
->next_out_no
;
225 * Bail out if specified sequence number does not correspond
226 * to a message that has been sent and not yet acknowledged
228 if (less(acked
, buf_seqno(crs
)) ||
229 less(bcl
->fsm_msg_cnt
, acked
) ||
230 less_eq(acked
, n_ptr
->bclink
.acked
))
234 /* Skip over packets that node has previously acknowledged */
235 while (crs
&& less_eq(buf_seqno(crs
), n_ptr
->bclink
.acked
))
238 /* Update packets that node is now acknowledging */
240 while (crs
&& less_eq(buf_seqno(crs
), acked
)) {
243 if (crs
!= bcl
->next_out
)
244 bcbuf_decr_acks(crs
);
246 bcbuf_set_acks(crs
, 0);
247 bcl
->next_out
= next
;
248 bclink_set_last_sent();
251 if (bcbuf_acks(crs
) == 0) {
252 bcl
->first_out
= next
;
253 bcl
->out_queue_size
--;
259 n_ptr
->bclink
.acked
= acked
;
261 /* Try resolving broadcast link congestion, if necessary */
263 if (unlikely(bcl
->next_out
)) {
264 tipc_link_push_queue(bcl
);
265 bclink_set_last_sent();
267 if (unlikely(released
&& !list_empty(&bcl
->waiting_ports
)))
268 tipc_link_wakeup_ports(bcl
, 0);
270 spin_unlock_bh(&bc_lock
);
274 * tipc_bclink_update_link_state - update broadcast link state
276 * tipc_net_lock and node lock set
278 void tipc_bclink_update_link_state(struct tipc_node
*n_ptr
, u32 last_sent
)
282 /* Ignore "stale" link state info */
284 if (less_eq(last_sent
, n_ptr
->bclink
.last_in
))
287 /* Update link synchronization state; quit if in sync */
289 bclink_update_last_sent(n_ptr
, last_sent
);
291 if (n_ptr
->bclink
.last_sent
== n_ptr
->bclink
.last_in
)
294 /* Update out-of-sync state; quit if loss is still unconfirmed */
296 if ((++n_ptr
->bclink
.oos_state
) == 1) {
297 if (n_ptr
->bclink
.deferred_size
< (TIPC_MIN_LINK_WIN
/ 2))
299 n_ptr
->bclink
.oos_state
++;
302 /* Don't NACK if one has been recently sent (or seen) */
304 if (n_ptr
->bclink
.oos_state
& 0x1)
309 buf
= tipc_buf_acquire(INT_H_SIZE
);
311 struct tipc_msg
*msg
= buf_msg(buf
);
313 tipc_msg_init(msg
, BCAST_PROTOCOL
, STATE_MSG
,
314 INT_H_SIZE
, n_ptr
->addr
);
315 msg_set_non_seq(msg
, 1);
316 msg_set_mc_netid(msg
, tipc_net_id
);
317 msg_set_bcast_ack(msg
, n_ptr
->bclink
.last_in
);
318 msg_set_bcgap_after(msg
, n_ptr
->bclink
.last_in
);
319 msg_set_bcgap_to(msg
, n_ptr
->bclink
.deferred_head
320 ? buf_seqno(n_ptr
->bclink
.deferred_head
) - 1
321 : n_ptr
->bclink
.last_sent
);
323 spin_lock_bh(&bc_lock
);
324 tipc_bearer_send(&bcbearer
->bearer
, buf
, NULL
);
325 bcl
->stats
.sent_nacks
++;
326 spin_unlock_bh(&bc_lock
);
329 n_ptr
->bclink
.oos_state
++;
334 * bclink_peek_nack - monitor retransmission requests sent by other nodes
336 * Delay any upcoming NACK by this node if another node has already
337 * requested the first message this node is going to ask for.
339 * Only tipc_net_lock set.
341 static void bclink_peek_nack(struct tipc_msg
*msg
)
343 struct tipc_node
*n_ptr
= tipc_node_find(msg_destnode(msg
));
345 if (unlikely(!n_ptr
))
348 tipc_node_lock(n_ptr
);
350 if (n_ptr
->bclink
.recv_permitted
&&
351 (n_ptr
->bclink
.last_in
!= n_ptr
->bclink
.last_sent
) &&
352 (n_ptr
->bclink
.last_in
== msg_bcgap_after(msg
)))
353 n_ptr
->bclink
.oos_state
= 2;
355 tipc_node_unlock(n_ptr
);
359 * tipc_bclink_xmit - broadcast a packet to all nodes in cluster
361 int tipc_bclink_xmit(struct sk_buff
*buf
)
365 spin_lock_bh(&bc_lock
);
367 if (!bclink
->bcast_nodes
.count
) {
368 res
= msg_data_sz(buf_msg(buf
));
373 res
= __tipc_link_xmit(bcl
, buf
);
374 if (likely(res
>= 0)) {
375 bclink_set_last_sent();
376 bcl
->stats
.queue_sz_counts
++;
377 bcl
->stats
.accu_queue_sz
+= bcl
->out_queue_size
;
380 spin_unlock_bh(&bc_lock
);
385 * bclink_accept_pkt - accept an incoming, in-sequence broadcast packet
387 * Called with both sending node's lock and bc_lock taken.
389 static void bclink_accept_pkt(struct tipc_node
*node
, u32 seqno
)
391 bclink_update_last_sent(node
, seqno
);
392 node
->bclink
.last_in
= seqno
;
393 node
->bclink
.oos_state
= 0;
394 bcl
->stats
.recv_info
++;
397 * Unicast an ACK periodically, ensuring that
398 * all nodes in the cluster don't ACK at the same time
401 if (((seqno
- tipc_own_addr
) % TIPC_MIN_LINK_WIN
) == 0) {
402 tipc_link_proto_xmit(node
->active_links
[node
->addr
& 1],
403 STATE_MSG
, 0, 0, 0, 0, 0);
404 bcl
->stats
.sent_acks
++;
409 * tipc_bclink_rcv - receive a broadcast packet, and deliver upwards
411 * tipc_net_lock is read_locked, no other locks set
413 void tipc_bclink_rcv(struct sk_buff
*buf
)
415 struct tipc_msg
*msg
= buf_msg(buf
);
416 struct tipc_node
*node
;
421 /* Screen out unwanted broadcast messages */
423 if (msg_mc_netid(msg
) != tipc_net_id
)
426 node
= tipc_node_find(msg_prevnode(msg
));
430 tipc_node_lock(node
);
431 if (unlikely(!node
->bclink
.recv_permitted
))
434 /* Handle broadcast protocol message */
436 if (unlikely(msg_user(msg
) == BCAST_PROTOCOL
)) {
437 if (msg_type(msg
) != STATE_MSG
)
439 if (msg_destnode(msg
) == tipc_own_addr
) {
440 tipc_bclink_acknowledge(node
, msg_bcast_ack(msg
));
441 tipc_node_unlock(node
);
442 spin_lock_bh(&bc_lock
);
443 bcl
->stats
.recv_nacks
++;
444 bclink
->retransmit_to
= node
;
445 bclink_retransmit_pkt(msg_bcgap_after(msg
),
447 spin_unlock_bh(&bc_lock
);
449 tipc_node_unlock(node
);
450 bclink_peek_nack(msg
);
455 /* Handle in-sequence broadcast message */
457 seqno
= msg_seqno(msg
);
458 next_in
= mod(node
->bclink
.last_in
+ 1);
460 if (likely(seqno
== next_in
)) {
462 /* Deliver message to destination */
464 if (likely(msg_isdata(msg
))) {
465 spin_lock_bh(&bc_lock
);
466 bclink_accept_pkt(node
, seqno
);
467 spin_unlock_bh(&bc_lock
);
468 tipc_node_unlock(node
);
469 if (likely(msg_mcast(msg
)))
470 tipc_port_mcast_rcv(buf
, NULL
);
473 } else if (msg_user(msg
) == MSG_BUNDLER
) {
474 spin_lock_bh(&bc_lock
);
475 bclink_accept_pkt(node
, seqno
);
476 bcl
->stats
.recv_bundles
++;
477 bcl
->stats
.recv_bundled
+= msg_msgcnt(msg
);
478 spin_unlock_bh(&bc_lock
);
479 tipc_node_unlock(node
);
480 tipc_link_bundle_rcv(buf
);
481 } else if (msg_user(msg
) == MSG_FRAGMENTER
) {
483 ret
= tipc_link_frag_rcv(&node
->bclink
.reasm_head
,
484 &node
->bclink
.reasm_tail
,
486 if (ret
== LINK_REASM_ERROR
)
488 spin_lock_bh(&bc_lock
);
489 bclink_accept_pkt(node
, seqno
);
490 bcl
->stats
.recv_fragments
++;
491 if (ret
== LINK_REASM_COMPLETE
) {
492 bcl
->stats
.recv_fragmented
++;
493 /* Point msg to inner header */
495 spin_unlock_bh(&bc_lock
);
498 spin_unlock_bh(&bc_lock
);
499 tipc_node_unlock(node
);
500 } else if (msg_user(msg
) == NAME_DISTRIBUTOR
) {
501 spin_lock_bh(&bc_lock
);
502 bclink_accept_pkt(node
, seqno
);
503 spin_unlock_bh(&bc_lock
);
504 tipc_node_unlock(node
);
507 spin_lock_bh(&bc_lock
);
508 bclink_accept_pkt(node
, seqno
);
509 spin_unlock_bh(&bc_lock
);
510 tipc_node_unlock(node
);
515 /* Determine new synchronization state */
517 tipc_node_lock(node
);
518 if (unlikely(!tipc_node_is_up(node
)))
521 if (node
->bclink
.last_in
== node
->bclink
.last_sent
)
524 if (!node
->bclink
.deferred_head
) {
525 node
->bclink
.oos_state
= 1;
529 msg
= buf_msg(node
->bclink
.deferred_head
);
530 seqno
= msg_seqno(msg
);
531 next_in
= mod(next_in
+ 1);
532 if (seqno
!= next_in
)
535 /* Take in-sequence message from deferred queue & deliver it */
537 buf
= node
->bclink
.deferred_head
;
538 node
->bclink
.deferred_head
= buf
->next
;
539 node
->bclink
.deferred_size
--;
543 /* Handle out-of-sequence broadcast message */
545 if (less(next_in
, seqno
)) {
546 deferred
= tipc_link_defer_pkt(&node
->bclink
.deferred_head
,
547 &node
->bclink
.deferred_tail
,
549 node
->bclink
.deferred_size
+= deferred
;
550 bclink_update_last_sent(node
, seqno
);
555 spin_lock_bh(&bc_lock
);
558 bcl
->stats
.deferred_recv
++;
560 bcl
->stats
.duplicates
++;
562 spin_unlock_bh(&bc_lock
);
565 tipc_node_unlock(node
);
570 u32
tipc_bclink_acks_missing(struct tipc_node
*n_ptr
)
572 return (n_ptr
->bclink
.recv_permitted
&&
573 (tipc_bclink_get_last_sent() != n_ptr
->bclink
.acked
));
578 * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer
580 * Send packet over as many bearers as necessary to reach all nodes
581 * that have joined the broadcast link.
583 * Returns 0 (packet sent successfully) under all circumstances,
584 * since the broadcast link's pseudo-bearer never blocks
586 static int tipc_bcbearer_send(struct sk_buff
*buf
, struct tipc_bearer
*unused1
,
587 struct tipc_media_addr
*unused2
)
591 /* Prepare broadcast link message for reliable transmission,
592 * if first time trying to send it;
593 * preparation is skipped for broadcast link protocol messages
594 * since they are sent in an unreliable manner and don't need it
596 if (likely(!msg_non_seq(buf_msg(buf
)))) {
597 struct tipc_msg
*msg
;
599 bcbuf_set_acks(buf
, bclink
->bcast_nodes
.count
);
601 msg_set_non_seq(msg
, 1);
602 msg_set_mc_netid(msg
, tipc_net_id
);
603 bcl
->stats
.sent_info
++;
605 if (WARN_ON(!bclink
->bcast_nodes
.count
)) {
611 /* Send buffer over bearers until all targets reached */
612 bcbearer
->remains
= bclink
->bcast_nodes
;
614 for (bp_index
= 0; bp_index
< MAX_BEARERS
; bp_index
++) {
615 struct tipc_bearer
*p
= bcbearer
->bpairs
[bp_index
].primary
;
616 struct tipc_bearer
*s
= bcbearer
->bpairs
[bp_index
].secondary
;
617 struct tipc_bearer
*b
= p
;
618 struct sk_buff
*tbuf
;
621 break; /* No more bearers to try */
623 tipc_nmap_diff(&bcbearer
->remains
, &b
->nodes
,
624 &bcbearer
->remains_new
);
625 if (bcbearer
->remains_new
.count
== bcbearer
->remains
.count
)
626 continue; /* Nothing added by bearer pair */
629 /* Use original buffer for first bearer */
630 tipc_bearer_send(b
, buf
, &b
->bcast_addr
);
632 /* Avoid concurrent buffer access */
633 tbuf
= pskb_copy(buf
, GFP_ATOMIC
);
636 tipc_bearer_send(b
, tbuf
, &b
->bcast_addr
);
637 kfree_skb(tbuf
); /* Bearer keeps a clone */
640 /* Swap bearers for next packet */
642 bcbearer
->bpairs
[bp_index
].primary
= s
;
643 bcbearer
->bpairs
[bp_index
].secondary
= p
;
646 if (bcbearer
->remains_new
.count
== 0)
647 break; /* All targets reached */
649 bcbearer
->remains
= bcbearer
->remains_new
;
656 * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer
658 void tipc_bcbearer_sort(void)
660 struct tipc_bcbearer_pair
*bp_temp
= bcbearer
->bpairs_temp
;
661 struct tipc_bcbearer_pair
*bp_curr
;
665 spin_lock_bh(&bc_lock
);
667 /* Group bearers by priority (can assume max of two per priority) */
668 memset(bp_temp
, 0, sizeof(bcbearer
->bpairs_temp
));
670 for (b_index
= 0; b_index
< MAX_BEARERS
; b_index
++) {
671 struct tipc_bearer
*b
= bearer_list
[b_index
];
672 if (!b
|| !b
->nodes
.count
)
675 if (!bp_temp
[b
->priority
].primary
)
676 bp_temp
[b
->priority
].primary
= b
;
678 bp_temp
[b
->priority
].secondary
= b
;
681 /* Create array of bearer pairs for broadcasting */
682 bp_curr
= bcbearer
->bpairs
;
683 memset(bcbearer
->bpairs
, 0, sizeof(bcbearer
->bpairs
));
685 for (pri
= TIPC_MAX_LINK_PRI
; pri
>= 0; pri
--) {
687 if (!bp_temp
[pri
].primary
)
690 bp_curr
->primary
= bp_temp
[pri
].primary
;
692 if (bp_temp
[pri
].secondary
) {
693 if (tipc_nmap_equal(&bp_temp
[pri
].primary
->nodes
,
694 &bp_temp
[pri
].secondary
->nodes
)) {
695 bp_curr
->secondary
= bp_temp
[pri
].secondary
;
698 bp_curr
->primary
= bp_temp
[pri
].secondary
;
705 spin_unlock_bh(&bc_lock
);
709 int tipc_bclink_stats(char *buf
, const u32 buf_size
)
712 struct tipc_stats
*s
;
717 spin_lock_bh(&bc_lock
);
721 ret
= tipc_snprintf(buf
, buf_size
, "Link <%s>\n"
722 " Window:%u packets\n",
723 bcl
->name
, bcl
->queue_limit
[0]);
724 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
725 " RX packets:%u fragments:%u/%u bundles:%u/%u\n",
726 s
->recv_info
, s
->recv_fragments
,
727 s
->recv_fragmented
, s
->recv_bundles
,
729 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
730 " TX packets:%u fragments:%u/%u bundles:%u/%u\n",
731 s
->sent_info
, s
->sent_fragments
,
732 s
->sent_fragmented
, s
->sent_bundles
,
734 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
735 " RX naks:%u defs:%u dups:%u\n",
736 s
->recv_nacks
, s
->deferred_recv
, s
->duplicates
);
737 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
738 " TX naks:%u acks:%u dups:%u\n",
739 s
->sent_nacks
, s
->sent_acks
, s
->retransmitted
);
740 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
741 " Congestion link:%u Send queue max:%u avg:%u\n",
742 s
->link_congs
, s
->max_queue_sz
,
744 (s
->accu_queue_sz
/ s
->queue_sz_counts
) : 0);
746 spin_unlock_bh(&bc_lock
);
750 int tipc_bclink_reset_stats(void)
755 spin_lock_bh(&bc_lock
);
756 memset(&bcl
->stats
, 0, sizeof(bcl
->stats
));
757 spin_unlock_bh(&bc_lock
);
761 int tipc_bclink_set_queue_limits(u32 limit
)
765 if ((limit
< TIPC_MIN_LINK_WIN
) || (limit
> TIPC_MAX_LINK_WIN
))
768 spin_lock_bh(&bc_lock
);
769 tipc_link_set_queue_limits(bcl
, limit
);
770 spin_unlock_bh(&bc_lock
);
774 void tipc_bclink_init(void)
776 bcbearer
->bearer
.media
= &bcbearer
->media
;
777 bcbearer
->media
.send_msg
= tipc_bcbearer_send
;
778 sprintf(bcbearer
->media
.name
, "tipc-broadcast");
780 INIT_LIST_HEAD(&bcl
->waiting_ports
);
781 bcl
->next_out_no
= 1;
782 spin_lock_init(&bclink
->node
.lock
);
783 bcl
->owner
= &bclink
->node
;
784 bcl
->max_pkt
= MAX_PKT_DEFAULT_MCAST
;
785 tipc_link_set_queue_limits(bcl
, BCLINK_WIN_DEFAULT
);
786 bcl
->b_ptr
= &bcbearer
->bearer
;
787 bearer_list
[BCBEARER
] = &bcbearer
->bearer
;
788 bcl
->state
= WORKING_WORKING
;
789 strlcpy(bcl
->name
, tipc_bclink_name
, TIPC_MAX_LINK_NAME
);
792 void tipc_bclink_stop(void)
794 spin_lock_bh(&bc_lock
);
795 tipc_link_purge_queues(bcl
);
796 spin_unlock_bh(&bc_lock
);
798 bearer_list
[BCBEARER
] = NULL
;
799 memset(bclink
, 0, sizeof(*bclink
));
800 memset(bcbearer
, 0, sizeof(*bcbearer
));
805 * tipc_nmap_add - add a node to a node map
807 void tipc_nmap_add(struct tipc_node_map
*nm_ptr
, u32 node
)
809 int n
= tipc_node(node
);
811 u32 mask
= (1 << (n
% WSIZE
));
813 if ((nm_ptr
->map
[w
] & mask
) == 0) {
815 nm_ptr
->map
[w
] |= mask
;
820 * tipc_nmap_remove - remove a node from a node map
822 void tipc_nmap_remove(struct tipc_node_map
*nm_ptr
, u32 node
)
824 int n
= tipc_node(node
);
826 u32 mask
= (1 << (n
% WSIZE
));
828 if ((nm_ptr
->map
[w
] & mask
) != 0) {
829 nm_ptr
->map
[w
] &= ~mask
;
835 * tipc_nmap_diff - find differences between node maps
836 * @nm_a: input node map A
837 * @nm_b: input node map B
838 * @nm_diff: output node map A-B (i.e. nodes of A that are not in B)
840 static void tipc_nmap_diff(struct tipc_node_map
*nm_a
,
841 struct tipc_node_map
*nm_b
,
842 struct tipc_node_map
*nm_diff
)
844 int stop
= ARRAY_SIZE(nm_a
->map
);
849 memset(nm_diff
, 0, sizeof(*nm_diff
));
850 for (w
= 0; w
< stop
; w
++) {
851 map
= nm_a
->map
[w
] ^ (nm_a
->map
[w
] & nm_b
->map
[w
]);
852 nm_diff
->map
[w
] = map
;
854 for (b
= 0 ; b
< WSIZE
; b
++) {
863 * tipc_port_list_add - add a port to a port list, ensuring no duplicates
865 void tipc_port_list_add(struct tipc_port_list
*pl_ptr
, u32 port
)
867 struct tipc_port_list
*item
= pl_ptr
;
869 int item_sz
= PLSIZE
;
870 int cnt
= pl_ptr
->count
;
872 for (; ; cnt
-= item_sz
, item
= item
->next
) {
875 for (i
= 0; i
< item_sz
; i
++)
876 if (item
->ports
[i
] == port
)
879 item
->ports
[i
] = port
;
884 item
->next
= kmalloc(sizeof(*item
), GFP_ATOMIC
);
886 pr_warn("Incomplete multicast delivery, no memory\n");
889 item
->next
->next
= NULL
;
895 * tipc_port_list_free - free dynamically created entries in port_list chain
898 void tipc_port_list_free(struct tipc_port_list
*pl_ptr
)
900 struct tipc_port_list
*item
;
901 struct tipc_port_list
*next
;
903 for (item
= pl_ptr
->next
; item
; item
= next
) {