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, 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) */
46 #define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */
48 #define BCLINK_LOG_BUF_SIZE 0
51 * Loss rate for incoming broadcast frames; used to test retransmission code.
52 * Set to N to cause every N'th frame to be discarded; 0 => don't discard any.
55 #define TIPC_BCAST_LOSS_RATE 0
58 * struct bcbearer_pair - a pair of bearers used by broadcast link
59 * @primary: pointer to primary bearer
60 * @secondary: pointer to secondary bearer
62 * Bearers must have same priority and same set of reachable destinations
66 struct bcbearer_pair {
67 struct bearer *primary;
68 struct bearer *secondary;
72 * struct bcbearer - bearer used by broadcast link
73 * @bearer: (non-standard) broadcast bearer structure
74 * @media: (non-standard) broadcast media structure
75 * @bpairs: array of bearer pairs
76 * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort()
77 * @remains: temporary node map used by tipc_bcbearer_send()
78 * @remains_new: temporary node map used tipc_bcbearer_send()
80 * Note: The fields labelled "temporary" are incorporated into the bearer
81 * to avoid consuming potentially limited stack space through the use of
82 * large local variables within multicast routines. Concurrent access is
83 * prevented through use of the spinlock "bc_lock".
89 struct bcbearer_pair bpairs[MAX_BEARERS];
90 struct bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1];
91 struct tipc_node_map remains;
92 struct tipc_node_map remains_new;
96 * struct bclink - link used for broadcast messages
97 * @link: (non-standard) broadcast link structure
98 * @node: (non-standard) node structure representing b'cast link's peer node
100 * Handles sequence numbering, fragmentation, bundling, etc.
105 struct tipc_node node;
109 static struct bcbearer *bcbearer = NULL;
110 static struct bclink *bclink = NULL;
111 static struct link *bcl = NULL;
112 static DEFINE_SPINLOCK(bc_lock);
114 const char tipc_bclink_name[] = "broadcast-link";
116 static void tipc_nmap_diff(struct tipc_node_map *nm_a,
117 struct tipc_node_map *nm_b,
118 struct tipc_node_map *nm_diff);
120 static u32 buf_seqno(struct sk_buff *buf)
122 return msg_seqno(buf_msg(buf));
125 static u32 bcbuf_acks(struct sk_buff *buf)
127 return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle;
130 static void bcbuf_set_acks(struct sk_buff *buf, u32 acks)
132 TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks;
135 static void bcbuf_decr_acks(struct sk_buff *buf)
137 bcbuf_set_acks(buf, bcbuf_acks(buf) - 1);
141 static void bclink_set_last_sent(void)
144 bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1);
146 bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1);
149 u32 tipc_bclink_get_last_sent(void)
151 return bcl->fsm_msg_cnt;
155 * bclink_set_gap - set gap according to contents of current deferred pkt queue
157 * Called with 'node' locked, bc_lock unlocked
160 static void bclink_set_gap(struct tipc_node *n_ptr)
162 struct sk_buff *buf = n_ptr->bclink.deferred_head;
164 n_ptr->bclink.gap_after = n_ptr->bclink.gap_to =
165 mod(n_ptr->bclink.last_in);
166 if (unlikely(buf != NULL))
167 n_ptr->bclink.gap_to = mod(buf_seqno(buf) - 1);
171 * bclink_ack_allowed - test if ACK or NACK message can be sent at this moment
173 * This mechanism endeavours to prevent all nodes in network from trying
174 * to ACK or NACK at the same time.
176 * Note: TIPC uses a different trigger to distribute ACKs than it does to
177 * distribute NACKs, but tries to use the same spacing (divide by 16).
180 static int bclink_ack_allowed(u32 n)
182 return (n % TIPC_MIN_LINK_WIN) == tipc_own_tag;
187 * bclink_retransmit_pkt - retransmit broadcast packets
188 * @after: sequence number of last packet to *not* retransmit
189 * @to: sequence number of last packet to retransmit
191 * Called with bc_lock locked
194 static void bclink_retransmit_pkt(u32 after, u32 to)
198 buf = bcl->first_out;
199 while (buf && less_eq(buf_seqno(buf), after)) {
202 tipc_link_retransmit(bcl, buf, mod(to - after));
206 * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets
207 * @n_ptr: node that sent acknowledgement info
208 * @acked: broadcast sequence # that has been acknowledged
210 * Node is locked, bc_lock unlocked.
213 void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked)
216 struct sk_buff *next;
217 unsigned int released = 0;
219 if (less_eq(acked, n_ptr->bclink.acked))
222 spin_lock_bh(&bc_lock);
224 /* Skip over packets that node has previously acknowledged */
226 crs = bcl->first_out;
227 while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) {
231 /* Update packets that node is now acknowledging */
233 while (crs && less_eq(buf_seqno(crs), acked)) {
235 bcbuf_decr_acks(crs);
236 if (bcbuf_acks(crs) == 0) {
237 bcl->first_out = next;
238 bcl->out_queue_size--;
244 n_ptr->bclink.acked = acked;
246 /* Try resolving broadcast link congestion, if necessary */
248 if (unlikely(bcl->next_out)) {
249 tipc_link_push_queue(bcl);
250 bclink_set_last_sent();
252 if (unlikely(released && !list_empty(&bcl->waiting_ports)))
253 tipc_link_wakeup_ports(bcl, 0);
254 spin_unlock_bh(&bc_lock);
258 * bclink_send_ack - unicast an ACK msg
260 * tipc_net_lock and node lock set
263 static void bclink_send_ack(struct tipc_node *n_ptr)
265 struct link *l_ptr = n_ptr->active_links[n_ptr->addr & 1];
268 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0);
272 * bclink_send_nack- broadcast a NACK msg
274 * tipc_net_lock and node lock set
277 static void bclink_send_nack(struct tipc_node *n_ptr)
280 struct tipc_msg *msg;
282 if (!less(n_ptr->bclink.gap_after, n_ptr->bclink.gap_to))
285 buf = tipc_buf_acquire(INT_H_SIZE);
288 tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG,
289 INT_H_SIZE, n_ptr->addr);
290 msg_set_mc_netid(msg, tipc_net_id);
291 msg_set_bcast_ack(msg, mod(n_ptr->bclink.last_in));
292 msg_set_bcgap_after(msg, n_ptr->bclink.gap_after);
293 msg_set_bcgap_to(msg, n_ptr->bclink.gap_to);
294 msg_set_bcast_tag(msg, tipc_own_tag);
296 if (tipc_bearer_send(&bcbearer->bearer, buf, NULL)) {
297 bcl->stats.sent_nacks++;
300 tipc_bearer_schedule(bcl->b_ptr, bcl);
301 bcl->proto_msg_queue = buf;
302 bcl->stats.bearer_congs++;
306 * Ensure we doesn't send another NACK msg to the node
307 * until 16 more deferred messages arrive from it
308 * (i.e. helps prevent all nodes from NACK'ing at same time)
311 n_ptr->bclink.nack_sync = tipc_own_tag;
316 * tipc_bclink_check_gap - send a NACK if a sequence gap exists
318 * tipc_net_lock and node lock set
321 void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 last_sent)
323 if (!n_ptr->bclink.supported ||
324 less_eq(last_sent, mod(n_ptr->bclink.last_in)))
327 bclink_set_gap(n_ptr);
328 if (n_ptr->bclink.gap_after == n_ptr->bclink.gap_to)
329 n_ptr->bclink.gap_to = last_sent;
330 bclink_send_nack(n_ptr);
334 * tipc_bclink_peek_nack - process a NACK msg meant for another node
336 * Only tipc_net_lock set.
339 static void tipc_bclink_peek_nack(u32 dest, u32 sender_tag, u32 gap_after, u32 gap_to)
341 struct tipc_node *n_ptr = tipc_node_find(dest);
344 if (unlikely(!n_ptr || !tipc_node_is_up(n_ptr)))
346 tipc_node_lock(n_ptr);
348 * Modify gap to suppress unnecessary NACKs from this node
350 my_after = n_ptr->bclink.gap_after;
351 my_to = n_ptr->bclink.gap_to;
353 if (less_eq(gap_after, my_after)) {
354 if (less(my_after, gap_to) && less(gap_to, my_to))
355 n_ptr->bclink.gap_after = gap_to;
356 else if (less_eq(my_to, gap_to))
357 n_ptr->bclink.gap_to = n_ptr->bclink.gap_after;
358 } else if (less_eq(gap_after, my_to)) {
359 if (less_eq(my_to, gap_to))
360 n_ptr->bclink.gap_to = gap_after;
363 * Expand gap if missing bufs not in deferred queue:
365 struct sk_buff *buf = n_ptr->bclink.deferred_head;
366 u32 prev = n_ptr->bclink.gap_to;
368 for (; buf; buf = buf->next) {
369 u32 seqno = buf_seqno(buf);
371 if (mod(seqno - prev) != 1) {
375 if (seqno == gap_after)
380 n_ptr->bclink.gap_to = gap_after;
383 * Some nodes may send a complementary NACK now:
385 if (bclink_ack_allowed(sender_tag + 1)) {
386 if (n_ptr->bclink.gap_to != n_ptr->bclink.gap_after) {
387 bclink_send_nack(n_ptr);
388 bclink_set_gap(n_ptr);
391 tipc_node_unlock(n_ptr);
395 * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster
398 int tipc_bclink_send_msg(struct sk_buff *buf)
402 spin_lock_bh(&bc_lock);
404 res = tipc_link_send_buf(bcl, buf);
405 if (unlikely(res == -ELINKCONG))
408 bclink_set_last_sent();
410 if (bcl->out_queue_size > bcl->stats.max_queue_sz)
411 bcl->stats.max_queue_sz = bcl->out_queue_size;
412 bcl->stats.queue_sz_counts++;
413 bcl->stats.accu_queue_sz += bcl->out_queue_size;
415 spin_unlock_bh(&bc_lock);
420 * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards
422 * tipc_net_lock is read_locked, no other locks set
425 void tipc_bclink_recv_pkt(struct sk_buff *buf)
427 #if (TIPC_BCAST_LOSS_RATE)
428 static int rx_count = 0;
430 struct tipc_msg *msg = buf_msg(buf);
431 struct tipc_node* node = tipc_node_find(msg_prevnode(msg));
434 struct sk_buff *deferred;
436 msg_dbg(msg, "<BC<<<");
438 if (unlikely(!node || !tipc_node_is_up(node) || !node->bclink.supported ||
439 (msg_mc_netid(msg) != tipc_net_id))) {
444 if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) {
445 msg_dbg(msg, "<BCNACK<<<");
446 if (msg_destnode(msg) == tipc_own_addr) {
447 tipc_node_lock(node);
448 tipc_bclink_acknowledge(node, msg_bcast_ack(msg));
449 tipc_node_unlock(node);
450 spin_lock_bh(&bc_lock);
451 bcl->stats.recv_nacks++;
452 bcl->owner->next = node; /* remember requestor */
453 bclink_retransmit_pkt(msg_bcgap_after(msg),
455 bcl->owner->next = NULL;
456 spin_unlock_bh(&bc_lock);
458 tipc_bclink_peek_nack(msg_destnode(msg),
460 msg_bcgap_after(msg),
467 #if (TIPC_BCAST_LOSS_RATE)
468 if (++rx_count == TIPC_BCAST_LOSS_RATE) {
475 tipc_node_lock(node);
477 deferred = node->bclink.deferred_head;
478 next_in = mod(node->bclink.last_in + 1);
479 seqno = msg_seqno(msg);
481 if (likely(seqno == next_in)) {
482 bcl->stats.recv_info++;
483 node->bclink.last_in++;
484 bclink_set_gap(node);
485 if (unlikely(bclink_ack_allowed(seqno))) {
486 bclink_send_ack(node);
487 bcl->stats.sent_acks++;
489 if (likely(msg_isdata(msg))) {
490 tipc_node_unlock(node);
491 tipc_port_recv_mcast(buf, NULL);
492 } else if (msg_user(msg) == MSG_BUNDLER) {
493 bcl->stats.recv_bundles++;
494 bcl->stats.recv_bundled += msg_msgcnt(msg);
495 tipc_node_unlock(node);
496 tipc_link_recv_bundle(buf);
497 } else if (msg_user(msg) == MSG_FRAGMENTER) {
498 bcl->stats.recv_fragments++;
499 if (tipc_link_recv_fragment(&node->bclink.defragm,
501 bcl->stats.recv_fragmented++;
502 tipc_node_unlock(node);
503 tipc_net_route_msg(buf);
505 tipc_node_unlock(node);
506 tipc_net_route_msg(buf);
508 if (deferred && (buf_seqno(deferred) == mod(next_in + 1))) {
509 tipc_node_lock(node);
512 node->bclink.deferred_head = deferred->next;
516 } else if (less(next_in, seqno)) {
517 u32 gap_after = node->bclink.gap_after;
518 u32 gap_to = node->bclink.gap_to;
520 if (tipc_link_defer_pkt(&node->bclink.deferred_head,
521 &node->bclink.deferred_tail,
523 node->bclink.nack_sync++;
524 bcl->stats.deferred_recv++;
525 if (seqno == mod(gap_after + 1))
526 node->bclink.gap_after = seqno;
527 else if (less(gap_after, seqno) && less(seqno, gap_to))
528 node->bclink.gap_to = seqno;
530 if (bclink_ack_allowed(node->bclink.nack_sync)) {
531 if (gap_to != gap_after)
532 bclink_send_nack(node);
533 bclink_set_gap(node);
536 bcl->stats.duplicates++;
539 tipc_node_unlock(node);
542 u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr)
544 return (n_ptr->bclink.supported &&
545 (tipc_bclink_get_last_sent() != n_ptr->bclink.acked));
550 * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer
552 * Send through as many bearers as necessary to reach all nodes
553 * that support TIPC multicasting.
555 * Returns 0 if packet sent successfully, non-zero if not
558 static int tipc_bcbearer_send(struct sk_buff *buf,
559 struct tipc_bearer *unused1,
560 struct tipc_media_addr *unused2)
564 /* Prepare buffer for broadcasting (if first time trying to send it) */
566 if (likely(!msg_non_seq(buf_msg(buf)))) {
567 struct tipc_msg *msg;
569 assert(tipc_cltr_bcast_nodes.count != 0);
570 bcbuf_set_acks(buf, tipc_cltr_bcast_nodes.count);
572 msg_set_non_seq(msg, 1);
573 msg_set_mc_netid(msg, tipc_net_id);
574 bcl->stats.sent_info++;
577 /* Send buffer over bearers until all targets reached */
579 bcbearer->remains = tipc_cltr_bcast_nodes;
581 for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) {
582 struct bearer *p = bcbearer->bpairs[bp_index].primary;
583 struct bearer *s = bcbearer->bpairs[bp_index].secondary;
586 break; /* no more bearers to try */
588 tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new);
589 if (bcbearer->remains_new.count == bcbearer->remains.count)
590 continue; /* bearer pair doesn't add anything */
592 if (p->publ.blocked ||
593 p->media->send_msg(buf, &p->publ, &p->media->bcast_addr)) {
594 /* unable to send on primary bearer */
595 if (!s || s->publ.blocked ||
596 s->media->send_msg(buf, &s->publ,
597 &s->media->bcast_addr)) {
598 /* unable to send on either bearer */
604 bcbearer->bpairs[bp_index].primary = s;
605 bcbearer->bpairs[bp_index].secondary = p;
608 if (bcbearer->remains_new.count == 0)
611 bcbearer->remains = bcbearer->remains_new;
615 * Unable to reach all targets (indicate success, since currently
616 * there isn't code in place to properly block & unblock the
617 * pseudo-bearer used by the broadcast link)
624 * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer
627 void tipc_bcbearer_sort(void)
629 struct bcbearer_pair *bp_temp = bcbearer->bpairs_temp;
630 struct bcbearer_pair *bp_curr;
634 spin_lock_bh(&bc_lock);
636 /* Group bearers by priority (can assume max of two per priority) */
638 memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp));
640 for (b_index = 0; b_index < MAX_BEARERS; b_index++) {
641 struct bearer *b = &tipc_bearers[b_index];
643 if (!b->active || !b->nodes.count)
646 if (!bp_temp[b->priority].primary)
647 bp_temp[b->priority].primary = b;
649 bp_temp[b->priority].secondary = b;
652 /* Create array of bearer pairs for broadcasting */
654 bp_curr = bcbearer->bpairs;
655 memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs));
657 for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) {
659 if (!bp_temp[pri].primary)
662 bp_curr->primary = bp_temp[pri].primary;
664 if (bp_temp[pri].secondary) {
665 if (tipc_nmap_equal(&bp_temp[pri].primary->nodes,
666 &bp_temp[pri].secondary->nodes)) {
667 bp_curr->secondary = bp_temp[pri].secondary;
670 bp_curr->primary = bp_temp[pri].secondary;
677 spin_unlock_bh(&bc_lock);
681 * tipc_bcbearer_push - resolve bearer congestion
683 * Forces bclink to push out any unsent packets, until all packets are gone
684 * or congestion reoccurs.
685 * No locks set when function called
688 void tipc_bcbearer_push(void)
690 struct bearer *b_ptr;
692 spin_lock_bh(&bc_lock);
693 b_ptr = &bcbearer->bearer;
694 if (b_ptr->publ.blocked) {
695 b_ptr->publ.blocked = 0;
696 tipc_bearer_lock_push(b_ptr);
698 spin_unlock_bh(&bc_lock);
702 int tipc_bclink_stats(char *buf, const u32 buf_size)
709 tipc_printbuf_init(&pb, buf, buf_size);
711 spin_lock_bh(&bc_lock);
713 tipc_printf(&pb, "Link <%s>\n"
714 " Window:%u packets\n",
715 bcl->name, bcl->queue_limit[0]);
716 tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n",
717 bcl->stats.recv_info,
718 bcl->stats.recv_fragments,
719 bcl->stats.recv_fragmented,
720 bcl->stats.recv_bundles,
721 bcl->stats.recv_bundled);
722 tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n",
723 bcl->stats.sent_info,
724 bcl->stats.sent_fragments,
725 bcl->stats.sent_fragmented,
726 bcl->stats.sent_bundles,
727 bcl->stats.sent_bundled);
728 tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n",
729 bcl->stats.recv_nacks,
730 bcl->stats.deferred_recv,
731 bcl->stats.duplicates);
732 tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n",
733 bcl->stats.sent_nacks,
734 bcl->stats.sent_acks,
735 bcl->stats.retransmitted);
736 tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n",
737 bcl->stats.bearer_congs,
738 bcl->stats.link_congs,
739 bcl->stats.max_queue_sz,
740 bcl->stats.queue_sz_counts
741 ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts)
744 spin_unlock_bh(&bc_lock);
745 return tipc_printbuf_validate(&pb);
748 int tipc_bclink_reset_stats(void)
753 spin_lock_bh(&bc_lock);
754 memset(&bcl->stats, 0, sizeof(bcl->stats));
755 spin_unlock_bh(&bc_lock);
759 int tipc_bclink_set_queue_limits(u32 limit)
763 if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN))
766 spin_lock_bh(&bc_lock);
767 tipc_link_set_queue_limits(bcl, limit);
768 spin_unlock_bh(&bc_lock);
772 int tipc_bclink_init(void)
774 bcbearer = kzalloc(sizeof(*bcbearer), GFP_ATOMIC);
775 bclink = kzalloc(sizeof(*bclink), GFP_ATOMIC);
776 if (!bcbearer || !bclink) {
778 warn("Multicast link creation failed, no memory\n");
786 INIT_LIST_HEAD(&bcbearer->bearer.cong_links);
787 bcbearer->bearer.media = &bcbearer->media;
788 bcbearer->media.send_msg = tipc_bcbearer_send;
789 sprintf(bcbearer->media.name, "tipc-multicast");
792 INIT_LIST_HEAD(&bcl->waiting_ports);
793 bcl->next_out_no = 1;
794 spin_lock_init(&bclink->node.lock);
795 bcl->owner = &bclink->node;
796 bcl->max_pkt = MAX_PKT_DEFAULT_MCAST;
797 tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT);
798 bcl->b_ptr = &bcbearer->bearer;
799 bcl->state = WORKING_WORKING;
800 strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME);
802 if (BCLINK_LOG_BUF_SIZE) {
803 char *pb = kmalloc(BCLINK_LOG_BUF_SIZE, GFP_ATOMIC);
807 tipc_printbuf_init(&bcl->print_buf, pb, BCLINK_LOG_BUF_SIZE);
813 void tipc_bclink_stop(void)
815 spin_lock_bh(&bc_lock);
818 if (BCLINK_LOG_BUF_SIZE)
819 kfree(bcl->print_buf.buf);
826 spin_unlock_bh(&bc_lock);
831 * tipc_nmap_add - add a node to a node map
834 void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node)
836 int n = tipc_node(node);
838 u32 mask = (1 << (n % WSIZE));
840 if ((nm_ptr->map[w] & mask) == 0) {
842 nm_ptr->map[w] |= mask;
847 * tipc_nmap_remove - remove a node from a node map
850 void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node)
852 int n = tipc_node(node);
854 u32 mask = (1 << (n % WSIZE));
856 if ((nm_ptr->map[w] & mask) != 0) {
857 nm_ptr->map[w] &= ~mask;
863 * tipc_nmap_diff - find differences between node maps
864 * @nm_a: input node map A
865 * @nm_b: input node map B
866 * @nm_diff: output node map A-B (i.e. nodes of A that are not in B)
869 static void tipc_nmap_diff(struct tipc_node_map *nm_a,
870 struct tipc_node_map *nm_b,
871 struct tipc_node_map *nm_diff)
873 int stop = ARRAY_SIZE(nm_a->map);
878 memset(nm_diff, 0, sizeof(*nm_diff));
879 for (w = 0; w < stop; w++) {
880 map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]);
881 nm_diff->map[w] = map;
883 for (b = 0 ; b < WSIZE; b++) {
892 * tipc_port_list_add - add a port to a port list, ensuring no duplicates
895 void tipc_port_list_add(struct port_list *pl_ptr, u32 port)
897 struct port_list *item = pl_ptr;
899 int item_sz = PLSIZE;
900 int cnt = pl_ptr->count;
902 for (; ; cnt -= item_sz, item = item->next) {
905 for (i = 0; i < item_sz; i++)
906 if (item->ports[i] == port)
909 item->ports[i] = port;
914 item->next = kmalloc(sizeof(*item), GFP_ATOMIC);
916 warn("Incomplete multicast delivery, no memory\n");
919 item->next->next = NULL;
925 * tipc_port_list_free - free dynamically created entries in port_list chain
929 void tipc_port_list_free(struct port_list *pl_ptr)
931 struct port_list *item;
932 struct port_list *next;
934 for (item = pl_ptr->next; item; item = next) {