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.
44 #include "name_distr.h"
46 #define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */
47 #define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */
48 #define BCBEARER MAX_BEARERS
51 * struct tipc_bcbearer_pair - a pair of bearers used by broadcast link
52 * @primary: pointer to primary bearer
53 * @secondary: pointer to secondary bearer
55 * Bearers must have same priority and same set of reachable destinations
59 struct tipc_bcbearer_pair {
60 struct tipc_bearer *primary;
61 struct tipc_bearer *secondary;
65 * struct tipc_bcbearer - bearer used by broadcast link
66 * @bearer: (non-standard) broadcast bearer structure
67 * @media: (non-standard) broadcast media structure
68 * @bpairs: array of bearer pairs
69 * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort()
70 * @remains: temporary node map used by tipc_bcbearer_send()
71 * @remains_new: temporary node map used tipc_bcbearer_send()
73 * Note: The fields labelled "temporary" are incorporated into the bearer
74 * to avoid consuming potentially limited stack space through the use of
75 * large local variables within multicast routines. Concurrent access is
76 * prevented through use of the spinlock "bclink_lock".
78 struct tipc_bcbearer {
79 struct tipc_bearer bearer;
80 struct tipc_media media;
81 struct tipc_bcbearer_pair bpairs[MAX_BEARERS];
82 struct tipc_bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1];
83 struct tipc_node_map remains;
84 struct tipc_node_map remains_new;
88 * struct tipc_bclink - link used for broadcast messages
89 * @lock: spinlock governing access to structure
90 * @link: (non-standard) broadcast link structure
91 * @node: (non-standard) node structure representing b'cast link's peer node
92 * @flags: represent bclink states
93 * @bcast_nodes: map of broadcast-capable nodes
94 * @retransmit_to: node that most recently requested a retransmit
96 * Handles sequence numbering, fragmentation, bundling, etc.
100 struct tipc_link link;
101 struct tipc_node node;
103 struct tipc_node_map bcast_nodes;
104 struct tipc_node *retransmit_to;
107 static struct tipc_bcbearer *bcbearer;
108 static struct tipc_bclink *bclink;
109 static struct tipc_link *bcl;
111 const char tipc_bclink_name[] = "broadcast-link";
113 static void tipc_nmap_diff(struct tipc_node_map *nm_a,
114 struct tipc_node_map *nm_b,
115 struct tipc_node_map *nm_diff);
116 static void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node);
117 static void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node);
119 static void tipc_bclink_lock(void)
121 spin_lock_bh(&bclink->lock);
124 static void tipc_bclink_unlock(void)
126 struct tipc_node *node = NULL;
128 if (likely(!bclink->flags)) {
129 spin_unlock_bh(&bclink->lock);
133 if (bclink->flags & TIPC_BCLINK_RESET) {
134 bclink->flags &= ~TIPC_BCLINK_RESET;
135 node = tipc_bclink_retransmit_to();
137 spin_unlock_bh(&bclink->lock);
140 tipc_link_reset_all(node);
143 uint tipc_bclink_get_mtu(void)
145 return MAX_PKT_DEFAULT_MCAST;
148 void tipc_bclink_set_flags(unsigned int flags)
150 bclink->flags |= flags;
153 static u32 bcbuf_acks(struct sk_buff *buf)
155 return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle;
158 static void bcbuf_set_acks(struct sk_buff *buf, u32 acks)
160 TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks;
163 static void bcbuf_decr_acks(struct sk_buff *buf)
165 bcbuf_set_acks(buf, bcbuf_acks(buf) - 1);
168 void tipc_bclink_add_node(u32 addr)
171 tipc_nmap_add(&bclink->bcast_nodes, addr);
172 tipc_bclink_unlock();
175 void tipc_bclink_remove_node(u32 addr)
178 tipc_nmap_remove(&bclink->bcast_nodes, addr);
179 tipc_bclink_unlock();
182 static void bclink_set_last_sent(void)
185 bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1);
187 bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1);
190 u32 tipc_bclink_get_last_sent(void)
192 return bcl->fsm_msg_cnt;
195 static void bclink_update_last_sent(struct tipc_node *node, u32 seqno)
197 node->bclink.last_sent = less_eq(node->bclink.last_sent, seqno) ?
198 seqno : node->bclink.last_sent;
203 * tipc_bclink_retransmit_to - get most recent node to request retransmission
205 * Called with bclink_lock locked
207 struct tipc_node *tipc_bclink_retransmit_to(void)
209 return bclink->retransmit_to;
213 * bclink_retransmit_pkt - retransmit broadcast packets
214 * @after: sequence number of last packet to *not* retransmit
215 * @to: sequence number of last packet to retransmit
217 * Called with bclink_lock locked
219 static void bclink_retransmit_pkt(u32 after, u32 to)
223 buf = bcl->first_out;
224 while (buf && less_eq(buf_seqno(buf), after))
226 tipc_link_retransmit(bcl, buf, mod(to - after));
230 * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets
231 * @n_ptr: node that sent acknowledgement info
232 * @acked: broadcast sequence # that has been acknowledged
234 * Node is locked, bclink_lock unlocked.
236 void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked)
239 struct sk_buff *next;
240 unsigned int released = 0;
243 /* Bail out if tx queue is empty (no clean up is required) */
244 crs = bcl->first_out;
248 /* Determine which messages need to be acknowledged */
249 if (acked == INVALID_LINK_SEQ) {
251 * Contact with specified node has been lost, so need to
252 * acknowledge sent messages only (if other nodes still exist)
253 * or both sent and unsent messages (otherwise)
255 if (bclink->bcast_nodes.count)
256 acked = bcl->fsm_msg_cnt;
258 acked = bcl->next_out_no;
261 * Bail out if specified sequence number does not correspond
262 * to a message that has been sent and not yet acknowledged
264 if (less(acked, buf_seqno(crs)) ||
265 less(bcl->fsm_msg_cnt, acked) ||
266 less_eq(acked, n_ptr->bclink.acked))
270 /* Skip over packets that node has previously acknowledged */
271 while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked))
274 /* Update packets that node is now acknowledging */
276 while (crs && less_eq(buf_seqno(crs), acked)) {
279 if (crs != bcl->next_out)
280 bcbuf_decr_acks(crs);
282 bcbuf_set_acks(crs, 0);
283 bcl->next_out = next;
284 bclink_set_last_sent();
287 if (bcbuf_acks(crs) == 0) {
288 bcl->first_out = next;
289 bcl->out_queue_size--;
295 n_ptr->bclink.acked = acked;
297 /* Try resolving broadcast link congestion, if necessary */
299 if (unlikely(bcl->next_out)) {
300 tipc_link_push_queue(bcl);
301 bclink_set_last_sent();
303 if (unlikely(released && !list_empty(&bcl->waiting_ports)))
304 tipc_link_wakeup_ports(bcl, 0);
306 tipc_bclink_unlock();
310 * tipc_bclink_update_link_state - update broadcast link state
312 * RCU and node lock set
314 void tipc_bclink_update_link_state(struct tipc_node *n_ptr, u32 last_sent)
318 /* Ignore "stale" link state info */
320 if (less_eq(last_sent, n_ptr->bclink.last_in))
323 /* Update link synchronization state; quit if in sync */
325 bclink_update_last_sent(n_ptr, last_sent);
327 if (n_ptr->bclink.last_sent == n_ptr->bclink.last_in)
330 /* Update out-of-sync state; quit if loss is still unconfirmed */
332 if ((++n_ptr->bclink.oos_state) == 1) {
333 if (n_ptr->bclink.deferred_size < (TIPC_MIN_LINK_WIN / 2))
335 n_ptr->bclink.oos_state++;
338 /* Don't NACK if one has been recently sent (or seen) */
340 if (n_ptr->bclink.oos_state & 0x1)
345 buf = tipc_buf_acquire(INT_H_SIZE);
347 struct tipc_msg *msg = buf_msg(buf);
349 tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG,
350 INT_H_SIZE, n_ptr->addr);
351 msg_set_non_seq(msg, 1);
352 msg_set_mc_netid(msg, tipc_net_id);
353 msg_set_bcast_ack(msg, n_ptr->bclink.last_in);
354 msg_set_bcgap_after(msg, n_ptr->bclink.last_in);
355 msg_set_bcgap_to(msg, n_ptr->bclink.deferred_head
356 ? buf_seqno(n_ptr->bclink.deferred_head) - 1
357 : n_ptr->bclink.last_sent);
360 tipc_bearer_send(MAX_BEARERS, buf, NULL);
361 bcl->stats.sent_nacks++;
362 tipc_bclink_unlock();
365 n_ptr->bclink.oos_state++;
370 * bclink_peek_nack - monitor retransmission requests sent by other nodes
372 * Delay any upcoming NACK by this node if another node has already
373 * requested the first message this node is going to ask for.
375 static void bclink_peek_nack(struct tipc_msg *msg)
377 struct tipc_node *n_ptr = tipc_node_find(msg_destnode(msg));
379 if (unlikely(!n_ptr))
382 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;
389 tipc_node_unlock(n_ptr);
393 * tipc_bclink_xmit - broadcast a packet to all nodes in cluster
395 int tipc_bclink_xmit(struct sk_buff *buf)
401 if (!bclink->bcast_nodes.count) {
402 res = msg_data_sz(buf_msg(buf));
407 res = __tipc_link_xmit(bcl, buf);
408 if (likely(res >= 0)) {
409 bclink_set_last_sent();
410 bcl->stats.queue_sz_counts++;
411 bcl->stats.accu_queue_sz += bcl->out_queue_size;
414 tipc_bclink_unlock();
418 /* tipc_bclink_xmit2 - broadcast buffer chain to all nodes in cluster
419 * and to identified node local sockets
420 * @buf: chain of buffers containing message
421 * Consumes the buffer chain, except when returning -ELINKCONG
422 * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE
424 int tipc_bclink_xmit2(struct sk_buff *buf)
428 struct sk_buff *clbuf;
430 /* Prepare clone of message for local node */
431 clbuf = tipc_msg_reassemble(buf);
432 if (unlikely(!clbuf)) {
434 return -EHOSTUNREACH;
437 /* Broadcast to all other nodes */
438 if (likely(bclink)) {
440 if (likely(bclink->bcast_nodes.count)) {
441 rc = __tipc_link_xmit(bcl, buf);
443 bclink_set_last_sent();
444 bcl->stats.queue_sz_counts++;
445 bcl->stats.accu_queue_sz += bcl->out_queue_size;
449 tipc_bclink_unlock();
455 /* Deliver message clone */
457 tipc_sk_mcast_rcv(clbuf);
465 * bclink_accept_pkt - accept an incoming, in-sequence broadcast packet
467 * Called with both sending node's lock and bclink_lock taken.
469 static void bclink_accept_pkt(struct tipc_node *node, u32 seqno)
471 bclink_update_last_sent(node, seqno);
472 node->bclink.last_in = seqno;
473 node->bclink.oos_state = 0;
474 bcl->stats.recv_info++;
477 * Unicast an ACK periodically, ensuring that
478 * all nodes in the cluster don't ACK at the same time
481 if (((seqno - tipc_own_addr) % TIPC_MIN_LINK_WIN) == 0) {
482 tipc_link_proto_xmit(node->active_links[node->addr & 1],
483 STATE_MSG, 0, 0, 0, 0, 0);
484 bcl->stats.sent_acks++;
489 * tipc_bclink_rcv - receive a broadcast packet, and deliver upwards
491 * RCU is locked, no other locks set
493 void tipc_bclink_rcv(struct sk_buff *buf)
495 struct tipc_msg *msg = buf_msg(buf);
496 struct tipc_node *node;
501 /* Screen out unwanted broadcast messages */
503 if (msg_mc_netid(msg) != tipc_net_id)
506 node = tipc_node_find(msg_prevnode(msg));
510 tipc_node_lock(node);
511 if (unlikely(!node->bclink.recv_permitted))
514 /* Handle broadcast protocol message */
516 if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) {
517 if (msg_type(msg) != STATE_MSG)
519 if (msg_destnode(msg) == tipc_own_addr) {
520 tipc_bclink_acknowledge(node, msg_bcast_ack(msg));
521 tipc_node_unlock(node);
523 bcl->stats.recv_nacks++;
524 bclink->retransmit_to = node;
525 bclink_retransmit_pkt(msg_bcgap_after(msg),
527 tipc_bclink_unlock();
529 tipc_node_unlock(node);
530 bclink_peek_nack(msg);
535 /* Handle in-sequence broadcast message */
537 seqno = msg_seqno(msg);
538 next_in = mod(node->bclink.last_in + 1);
540 if (likely(seqno == next_in)) {
542 /* Deliver message to destination */
544 if (likely(msg_isdata(msg))) {
546 bclink_accept_pkt(node, seqno);
547 tipc_bclink_unlock();
548 tipc_node_unlock(node);
549 if (likely(msg_mcast(msg)))
550 tipc_sk_mcast_rcv(buf);
553 } else if (msg_user(msg) == MSG_BUNDLER) {
555 bclink_accept_pkt(node, seqno);
556 bcl->stats.recv_bundles++;
557 bcl->stats.recv_bundled += msg_msgcnt(msg);
558 tipc_bclink_unlock();
559 tipc_node_unlock(node);
560 tipc_link_bundle_rcv(buf);
561 } else if (msg_user(msg) == MSG_FRAGMENTER) {
562 tipc_buf_append(&node->bclink.reasm_buf, &buf);
563 if (unlikely(!buf && !node->bclink.reasm_buf))
566 bclink_accept_pkt(node, seqno);
567 bcl->stats.recv_fragments++;
569 bcl->stats.recv_fragmented++;
571 tipc_bclink_unlock();
574 tipc_bclink_unlock();
575 tipc_node_unlock(node);
576 } else if (msg_user(msg) == NAME_DISTRIBUTOR) {
578 bclink_accept_pkt(node, seqno);
579 tipc_bclink_unlock();
580 tipc_node_unlock(node);
584 bclink_accept_pkt(node, seqno);
585 tipc_bclink_unlock();
586 tipc_node_unlock(node);
591 /* Determine new synchronization state */
593 tipc_node_lock(node);
594 if (unlikely(!tipc_node_is_up(node)))
597 if (node->bclink.last_in == node->bclink.last_sent)
600 if (!node->bclink.deferred_head) {
601 node->bclink.oos_state = 1;
605 msg = buf_msg(node->bclink.deferred_head);
606 seqno = msg_seqno(msg);
607 next_in = mod(next_in + 1);
608 if (seqno != next_in)
611 /* Take in-sequence message from deferred queue & deliver it */
613 buf = node->bclink.deferred_head;
614 node->bclink.deferred_head = buf->next;
616 node->bclink.deferred_size--;
620 /* Handle out-of-sequence broadcast message */
622 if (less(next_in, seqno)) {
623 deferred = tipc_link_defer_pkt(&node->bclink.deferred_head,
624 &node->bclink.deferred_tail,
626 node->bclink.deferred_size += deferred;
627 bclink_update_last_sent(node, seqno);
634 bcl->stats.deferred_recv++;
636 bcl->stats.duplicates++;
638 tipc_bclink_unlock();
641 tipc_node_unlock(node);
646 u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr)
648 return (n_ptr->bclink.recv_permitted &&
649 (tipc_bclink_get_last_sent() != n_ptr->bclink.acked));
654 * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer
656 * Send packet over as many bearers as necessary to reach all nodes
657 * that have joined the broadcast link.
659 * Returns 0 (packet sent successfully) under all circumstances,
660 * since the broadcast link's pseudo-bearer never blocks
662 static int tipc_bcbearer_send(struct sk_buff *buf, struct tipc_bearer *unused1,
663 struct tipc_media_addr *unused2)
667 /* Prepare broadcast link message for reliable transmission,
668 * if first time trying to send it;
669 * preparation is skipped for broadcast link protocol messages
670 * since they are sent in an unreliable manner and don't need it
672 if (likely(!msg_non_seq(buf_msg(buf)))) {
673 struct tipc_msg *msg;
675 bcbuf_set_acks(buf, bclink->bcast_nodes.count);
677 msg_set_non_seq(msg, 1);
678 msg_set_mc_netid(msg, tipc_net_id);
679 bcl->stats.sent_info++;
681 if (WARN_ON(!bclink->bcast_nodes.count)) {
687 /* Send buffer over bearers until all targets reached */
688 bcbearer->remains = bclink->bcast_nodes;
690 for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) {
691 struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary;
692 struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary;
693 struct tipc_bearer *b = p;
694 struct sk_buff *tbuf;
697 break; /* No more bearers to try */
699 tipc_nmap_diff(&bcbearer->remains, &b->nodes,
700 &bcbearer->remains_new);
701 if (bcbearer->remains_new.count == bcbearer->remains.count)
702 continue; /* Nothing added by bearer pair */
705 /* Use original buffer for first bearer */
706 tipc_bearer_send(b->identity, buf, &b->bcast_addr);
708 /* Avoid concurrent buffer access */
709 tbuf = pskb_copy_for_clone(buf, GFP_ATOMIC);
712 tipc_bearer_send(b->identity, tbuf, &b->bcast_addr);
713 kfree_skb(tbuf); /* Bearer keeps a clone */
716 /* Swap bearers for next packet */
718 bcbearer->bpairs[bp_index].primary = s;
719 bcbearer->bpairs[bp_index].secondary = p;
722 if (bcbearer->remains_new.count == 0)
723 break; /* All targets reached */
725 bcbearer->remains = bcbearer->remains_new;
732 * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer
734 void tipc_bcbearer_sort(struct tipc_node_map *nm_ptr, u32 node, bool action)
736 struct tipc_bcbearer_pair *bp_temp = bcbearer->bpairs_temp;
737 struct tipc_bcbearer_pair *bp_curr;
738 struct tipc_bearer *b;
745 tipc_nmap_add(nm_ptr, node);
747 tipc_nmap_remove(nm_ptr, node);
749 /* Group bearers by priority (can assume max of two per priority) */
750 memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp));
753 for (b_index = 0; b_index < MAX_BEARERS; b_index++) {
754 b = rcu_dereference_rtnl(bearer_list[b_index]);
755 if (!b || !b->nodes.count)
758 if (!bp_temp[b->priority].primary)
759 bp_temp[b->priority].primary = b;
761 bp_temp[b->priority].secondary = b;
765 /* Create array of bearer pairs for broadcasting */
766 bp_curr = bcbearer->bpairs;
767 memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs));
769 for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) {
771 if (!bp_temp[pri].primary)
774 bp_curr->primary = bp_temp[pri].primary;
776 if (bp_temp[pri].secondary) {
777 if (tipc_nmap_equal(&bp_temp[pri].primary->nodes,
778 &bp_temp[pri].secondary->nodes)) {
779 bp_curr->secondary = bp_temp[pri].secondary;
782 bp_curr->primary = bp_temp[pri].secondary;
789 tipc_bclink_unlock();
793 int tipc_bclink_stats(char *buf, const u32 buf_size)
796 struct tipc_stats *s;
805 ret = tipc_snprintf(buf, buf_size, "Link <%s>\n"
806 " Window:%u packets\n",
807 bcl->name, bcl->queue_limit[0]);
808 ret += tipc_snprintf(buf + ret, buf_size - ret,
809 " RX packets:%u fragments:%u/%u bundles:%u/%u\n",
810 s->recv_info, s->recv_fragments,
811 s->recv_fragmented, s->recv_bundles,
813 ret += tipc_snprintf(buf + ret, buf_size - ret,
814 " TX packets:%u fragments:%u/%u bundles:%u/%u\n",
815 s->sent_info, s->sent_fragments,
816 s->sent_fragmented, s->sent_bundles,
818 ret += tipc_snprintf(buf + ret, buf_size - ret,
819 " RX naks:%u defs:%u dups:%u\n",
820 s->recv_nacks, s->deferred_recv, s->duplicates);
821 ret += tipc_snprintf(buf + ret, buf_size - ret,
822 " TX naks:%u acks:%u dups:%u\n",
823 s->sent_nacks, s->sent_acks, s->retransmitted);
824 ret += tipc_snprintf(buf + ret, buf_size - ret,
825 " Congestion link:%u Send queue max:%u avg:%u\n",
826 s->link_congs, s->max_queue_sz,
828 (s->accu_queue_sz / s->queue_sz_counts) : 0);
830 tipc_bclink_unlock();
834 int tipc_bclink_reset_stats(void)
840 memset(&bcl->stats, 0, sizeof(bcl->stats));
841 tipc_bclink_unlock();
845 int tipc_bclink_set_queue_limits(u32 limit)
849 if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN))
853 tipc_link_set_queue_limits(bcl, limit);
854 tipc_bclink_unlock();
858 int tipc_bclink_init(void)
860 bcbearer = kzalloc(sizeof(*bcbearer), GFP_ATOMIC);
864 bclink = kzalloc(sizeof(*bclink), GFP_ATOMIC);
871 bcbearer->bearer.media = &bcbearer->media;
872 bcbearer->media.send_msg = tipc_bcbearer_send;
873 sprintf(bcbearer->media.name, "tipc-broadcast");
875 spin_lock_init(&bclink->lock);
876 INIT_LIST_HEAD(&bcl->waiting_ports);
877 bcl->next_out_no = 1;
878 spin_lock_init(&bclink->node.lock);
879 bcl->owner = &bclink->node;
880 bcl->max_pkt = MAX_PKT_DEFAULT_MCAST;
881 tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT);
882 bcl->bearer_id = MAX_BEARERS;
883 rcu_assign_pointer(bearer_list[MAX_BEARERS], &bcbearer->bearer);
884 bcl->state = WORKING_WORKING;
885 strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME);
889 void tipc_bclink_stop(void)
892 tipc_link_purge_queues(bcl);
893 tipc_bclink_unlock();
895 RCU_INIT_POINTER(bearer_list[BCBEARER], NULL);
902 * tipc_nmap_add - add a node to a node map
904 static void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node)
906 int n = tipc_node(node);
908 u32 mask = (1 << (n % WSIZE));
910 if ((nm_ptr->map[w] & mask) == 0) {
912 nm_ptr->map[w] |= mask;
917 * tipc_nmap_remove - remove a node from a node map
919 static void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node)
921 int n = tipc_node(node);
923 u32 mask = (1 << (n % WSIZE));
925 if ((nm_ptr->map[w] & mask) != 0) {
926 nm_ptr->map[w] &= ~mask;
932 * tipc_nmap_diff - find differences between node maps
933 * @nm_a: input node map A
934 * @nm_b: input node map B
935 * @nm_diff: output node map A-B (i.e. nodes of A that are not in B)
937 static void tipc_nmap_diff(struct tipc_node_map *nm_a,
938 struct tipc_node_map *nm_b,
939 struct tipc_node_map *nm_diff)
941 int stop = ARRAY_SIZE(nm_a->map);
946 memset(nm_diff, 0, sizeof(*nm_diff));
947 for (w = 0; w < stop; w++) {
948 map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]);
949 nm_diff->map[w] = map;
951 for (b = 0 ; b < WSIZE; b++) {
960 * tipc_port_list_add - add a port to a port list, ensuring no duplicates
962 void tipc_port_list_add(struct tipc_port_list *pl_ptr, u32 port)
964 struct tipc_port_list *item = pl_ptr;
966 int item_sz = PLSIZE;
967 int cnt = pl_ptr->count;
969 for (; ; cnt -= item_sz, item = item->next) {
972 for (i = 0; i < item_sz; i++)
973 if (item->ports[i] == port)
976 item->ports[i] = port;
981 item->next = kmalloc(sizeof(*item), GFP_ATOMIC);
983 pr_warn("Incomplete multicast delivery, no memory\n");
986 item->next->next = NULL;
992 * tipc_port_list_free - free dynamically created entries in port_list chain
995 void tipc_port_list_free(struct tipc_port_list *pl_ptr)
997 struct tipc_port_list *item;
998 struct tipc_port_list *next;
1000 for (item = pl_ptr->next; item; item = next) {