2 * net/tipc/link.c: TIPC link code
4 * Copyright (c) 1996-2007, 2012-2016, Ericsson AB
5 * Copyright (c) 2004-2007, 2010-2013, Wind River Systems
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
42 #include "name_distr.h"
47 #include <linux/pkt_sched.h>
68 u32 link_congs; /* # port sends blocked by congestion */
71 u32 max_queue_sz; /* send queue size high water mark */
72 u32 accu_queue_sz; /* used for send queue size profiling */
73 u32 queue_sz_counts; /* used for send queue size profiling */
74 u32 msg_length_counts; /* used for message length profiling */
75 u32 msg_lengths_total; /* used for message length profiling */
76 u32 msg_length_profile[7]; /* used for msg. length profiling */
80 * struct tipc_link - TIPC link data structure
81 * @addr: network address of link's peer node
82 * @name: link name character string
83 * @media_addr: media address to use when sending messages over link
85 * @net: pointer to namespace struct
86 * @refcnt: reference counter for permanent references (owner node & timer)
87 * @peer_session: link session # being used by peer end of link
88 * @peer_bearer_id: bearer id used by link's peer endpoint
89 * @bearer_id: local bearer id used by link
90 * @tolerance: minimum link continuity loss needed to reset link [in ms]
91 * @abort_limit: # of unacknowledged continuity probes needed to reset link
92 * @state: current state of link FSM
93 * @peer_caps: bitmap describing capabilities of peer node
94 * @silent_intv_cnt: # of timer intervals without any reception from peer
95 * @proto_msg: template for control messages generated by link
96 * @pmsg: convenience pointer to "proto_msg" field
97 * @priority: current link priority
98 * @net_plane: current link network plane ('A' through 'H')
99 * @mon_state: cookie with information needed by link monitor
100 * @backlog_limit: backlog queue congestion thresholds (indexed by importance)
101 * @exp_msg_count: # of tunnelled messages expected during link changeover
102 * @reset_rcv_checkpt: seq # of last acknowledged message at time of link reset
103 * @mtu: current maximum packet size for this link
104 * @advertised_mtu: advertised own mtu when link is being established
105 * @transmitq: queue for sent, non-acked messages
106 * @backlogq: queue for messages waiting to be sent
107 * @snt_nxt: next sequence number to use for outbound messages
108 * @last_retransmitted: sequence number of most recently retransmitted message
109 * @stale_cnt: counter for number of identical retransmit attempts
110 * @stale_limit: time when repeated identical retransmits must force link reset
111 * @ackers: # of peers that needs to ack each packet before it can be released
112 * @acked: # last packet acked by a certain peer. Used for broadcast.
113 * @rcv_nxt: next sequence number to expect for inbound messages
114 * @deferred_queue: deferred queue saved OOS b'cast message received from node
115 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer
116 * @inputq: buffer queue for messages to be delivered upwards
117 * @namedq: buffer queue for name table messages to be delivered upwards
118 * @next_out: ptr to first unsent outbound message in queue
119 * @wakeupq: linked list of wakeup msgs waiting for link congestion to abate
120 * @long_msg_seq_no: next identifier to use for outbound fragmented messages
121 * @reasm_buf: head of partially reassembled inbound message fragments
122 * @bc_rcvr: marks that this is a broadcast receiver link
123 * @stats: collects statistics regarding link activity
127 char name[TIPC_MAX_LINK_NAME];
130 /* Management and link supervision data */
144 char if_name[TIPC_MAX_IF_NAME];
147 struct tipc_mon_state mon_state;
152 struct sk_buff *failover_reasm_skb;
154 /* Max packet negotiation */
159 struct sk_buff_head transmq;
160 struct sk_buff_head backlogq;
164 struct sk_buff *target_bskb;
170 unsigned long stale_limit;
175 struct sk_buff_head deferdq;
176 struct sk_buff_head *inputq;
177 struct sk_buff_head *namedq;
179 /* Congestion handling */
180 struct sk_buff_head wakeupq;
182 /* Fragmentation/reassembly */
183 struct sk_buff *reasm_buf;
188 struct tipc_link *bc_rcvlink;
189 struct tipc_link *bc_sndlink;
190 unsigned long prev_retr;
197 struct tipc_stats stats;
201 * Error message prefixes
203 static const char *link_co_err = "Link tunneling error, ";
204 static const char *link_rst_msg = "Resetting link ";
206 /* Send states for broadcast NACKs
209 BC_NACK_SND_CONDITIONAL,
210 BC_NACK_SND_UNCONDITIONAL,
211 BC_NACK_SND_SUPPRESS,
214 #define TIPC_BC_RETR_LIMIT 10 /* [ms] */
217 * Interval between NACKs when packets arrive out of order
219 #define TIPC_NACK_INTV (TIPC_MIN_LINK_WIN * 2)
224 LINK_ESTABLISHED = 0xe,
225 LINK_ESTABLISHING = 0xe << 4,
226 LINK_RESET = 0x1 << 8,
227 LINK_RESETTING = 0x2 << 12,
228 LINK_PEER_RESET = 0xd << 16,
229 LINK_FAILINGOVER = 0xf << 20,
230 LINK_SYNCHING = 0xc << 24
233 /* Link FSM state checking routines
235 static int link_is_up(struct tipc_link *l)
237 return l->state & (LINK_ESTABLISHED | LINK_SYNCHING);
240 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb,
241 struct sk_buff_head *xmitq);
242 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe,
243 bool probe_reply, u16 rcvgap,
244 int tolerance, int priority,
245 struct sk_buff_head *xmitq);
246 static void link_print(struct tipc_link *l, const char *str);
247 static int tipc_link_build_nack_msg(struct tipc_link *l,
248 struct sk_buff_head *xmitq);
249 static void tipc_link_build_bc_init_msg(struct tipc_link *l,
250 struct sk_buff_head *xmitq);
251 static bool tipc_link_release_pkts(struct tipc_link *l, u16 to);
254 * Simple non-static link routines (i.e. referenced outside this file)
256 bool tipc_link_is_up(struct tipc_link *l)
258 return link_is_up(l);
261 bool tipc_link_peer_is_down(struct tipc_link *l)
263 return l->state == LINK_PEER_RESET;
266 bool tipc_link_is_reset(struct tipc_link *l)
268 return l->state & (LINK_RESET | LINK_FAILINGOVER | LINK_ESTABLISHING);
271 bool tipc_link_is_establishing(struct tipc_link *l)
273 return l->state == LINK_ESTABLISHING;
276 bool tipc_link_is_synching(struct tipc_link *l)
278 return l->state == LINK_SYNCHING;
281 bool tipc_link_is_failingover(struct tipc_link *l)
283 return l->state == LINK_FAILINGOVER;
286 bool tipc_link_is_blocked(struct tipc_link *l)
288 return l->state & (LINK_RESETTING | LINK_PEER_RESET | LINK_FAILINGOVER);
291 static bool link_is_bc_sndlink(struct tipc_link *l)
293 return !l->bc_sndlink;
296 static bool link_is_bc_rcvlink(struct tipc_link *l)
298 return ((l->bc_rcvlink == l) && !link_is_bc_sndlink(l));
301 void tipc_link_set_active(struct tipc_link *l, bool active)
306 u32 tipc_link_id(struct tipc_link *l)
308 return l->peer_bearer_id << 16 | l->bearer_id;
311 int tipc_link_window(struct tipc_link *l)
316 int tipc_link_prio(struct tipc_link *l)
321 unsigned long tipc_link_tolerance(struct tipc_link *l)
326 struct sk_buff_head *tipc_link_inputq(struct tipc_link *l)
331 char tipc_link_plane(struct tipc_link *l)
336 void tipc_link_update_caps(struct tipc_link *l, u16 capabilities)
338 l->peer_caps = capabilities;
341 void tipc_link_add_bc_peer(struct tipc_link *snd_l,
342 struct tipc_link *uc_l,
343 struct sk_buff_head *xmitq)
345 struct tipc_link *rcv_l = uc_l->bc_rcvlink;
348 rcv_l->acked = snd_l->snd_nxt - 1;
349 snd_l->state = LINK_ESTABLISHED;
350 tipc_link_build_bc_init_msg(uc_l, xmitq);
353 void tipc_link_remove_bc_peer(struct tipc_link *snd_l,
354 struct tipc_link *rcv_l,
355 struct sk_buff_head *xmitq)
357 u16 ack = snd_l->snd_nxt - 1;
360 rcv_l->bc_peer_is_up = true;
361 rcv_l->state = LINK_ESTABLISHED;
362 tipc_link_bc_ack_rcv(rcv_l, ack, xmitq);
363 tipc_link_reset(rcv_l);
364 rcv_l->state = LINK_RESET;
365 if (!snd_l->ackers) {
366 tipc_link_reset(snd_l);
367 snd_l->state = LINK_RESET;
368 __skb_queue_purge(xmitq);
372 int tipc_link_bc_peers(struct tipc_link *l)
377 static u16 link_bc_rcv_gap(struct tipc_link *l)
379 struct sk_buff *skb = skb_peek(&l->deferdq);
382 if (more(l->snd_nxt, l->rcv_nxt))
383 gap = l->snd_nxt - l->rcv_nxt;
385 gap = buf_seqno(skb) - l->rcv_nxt;
389 void tipc_link_set_mtu(struct tipc_link *l, int mtu)
394 int tipc_link_mtu(struct tipc_link *l)
399 u16 tipc_link_rcv_nxt(struct tipc_link *l)
404 u16 tipc_link_acked(struct tipc_link *l)
409 char *tipc_link_name(struct tipc_link *l)
414 u32 tipc_link_state(struct tipc_link *l)
420 * tipc_link_create - create a new link
421 * @n: pointer to associated node
422 * @if_name: associated interface name
423 * @bearer_id: id (index) of associated bearer
424 * @tolerance: link tolerance to be used by link
425 * @net_plane: network plane (A,B,c..) this link belongs to
426 * @mtu: mtu to be advertised by link
427 * @priority: priority to be used by link
428 * @window: send window to be used by link
429 * @session: session to be used by link
430 * @ownnode: identity of own node
431 * @peer: node id of peer node
432 * @peer_caps: bitmap describing peer node capabilities
433 * @bc_sndlink: the namespace global link used for broadcast sending
434 * @bc_rcvlink: the peer specific link used for broadcast reception
435 * @inputq: queue to put messages ready for delivery
436 * @namedq: queue to put binding table update messages ready for delivery
437 * @link: return value, pointer to put the created link
439 * Returns true if link was created, otherwise false
441 bool tipc_link_create(struct net *net, char *if_name, int bearer_id,
442 int tolerance, char net_plane, u32 mtu, int priority,
443 int window, u32 session, u32 self,
444 u32 peer, u8 *peer_id, u16 peer_caps,
445 struct tipc_link *bc_sndlink,
446 struct tipc_link *bc_rcvlink,
447 struct sk_buff_head *inputq,
448 struct sk_buff_head *namedq,
449 struct tipc_link **link)
451 char peer_str[NODE_ID_STR_LEN] = {0,};
452 char self_str[NODE_ID_STR_LEN] = {0,};
455 l = kzalloc(sizeof(*l), GFP_ATOMIC);
459 l->session = session;
461 /* Set link name for unicast links only */
463 tipc_nodeid2string(self_str, tipc_own_id(net));
464 if (strlen(self_str) > 16)
465 sprintf(self_str, "%x", self);
466 tipc_nodeid2string(peer_str, peer_id);
467 if (strlen(peer_str) > 16)
468 sprintf(peer_str, "%x", peer);
470 /* Peer i/f name will be completed by reset/activate message */
471 snprintf(l->name, sizeof(l->name), "%s:%s-%s:unknown",
472 self_str, if_name, peer_str);
474 strcpy(l->if_name, if_name);
476 l->peer_caps = peer_caps;
478 l->in_session = false;
479 l->bearer_id = bearer_id;
480 l->tolerance = tolerance;
482 bc_rcvlink->tolerance = tolerance;
483 l->net_plane = net_plane;
484 l->advertised_mtu = mtu;
486 l->priority = priority;
487 tipc_link_set_queue_limits(l, window);
489 l->bc_sndlink = bc_sndlink;
490 l->bc_rcvlink = bc_rcvlink;
493 l->state = LINK_RESETTING;
494 __skb_queue_head_init(&l->transmq);
495 __skb_queue_head_init(&l->backlogq);
496 __skb_queue_head_init(&l->deferdq);
497 skb_queue_head_init(&l->wakeupq);
498 skb_queue_head_init(l->inputq);
503 * tipc_link_bc_create - create new link to be used for broadcast
504 * @n: pointer to associated node
505 * @mtu: mtu to be used initially if no peers
506 * @window: send window to be used
507 * @inputq: queue to put messages ready for delivery
508 * @namedq: queue to put binding table update messages ready for delivery
509 * @link: return value, pointer to put the created link
511 * Returns true if link was created, otherwise false
513 bool tipc_link_bc_create(struct net *net, u32 ownnode, u32 peer,
514 int mtu, int window, u16 peer_caps,
515 struct sk_buff_head *inputq,
516 struct sk_buff_head *namedq,
517 struct tipc_link *bc_sndlink,
518 struct tipc_link **link)
522 if (!tipc_link_create(net, "", MAX_BEARERS, 0, 'Z', mtu, 0, window,
523 0, ownnode, peer, NULL, peer_caps, bc_sndlink,
524 NULL, inputq, namedq, link))
528 strcpy(l->name, tipc_bclink_name);
530 l->state = LINK_RESET;
534 /* Broadcast send link is always up */
535 if (link_is_bc_sndlink(l))
536 l->state = LINK_ESTABLISHED;
538 /* Disable replicast if even a single peer doesn't support it */
539 if (link_is_bc_rcvlink(l) && !(peer_caps & TIPC_BCAST_RCAST))
540 tipc_bcast_disable_rcast(net);
546 * tipc_link_fsm_evt - link finite state machine
547 * @l: pointer to link
548 * @evt: state machine event to be processed
550 int tipc_link_fsm_evt(struct tipc_link *l, int evt)
557 case LINK_PEER_RESET_EVT:
558 l->state = LINK_PEER_RESET;
561 l->state = LINK_RESET;
563 case LINK_FAILURE_EVT:
564 case LINK_FAILOVER_BEGIN_EVT:
565 case LINK_ESTABLISH_EVT:
566 case LINK_FAILOVER_END_EVT:
567 case LINK_SYNCH_BEGIN_EVT:
568 case LINK_SYNCH_END_EVT:
575 case LINK_PEER_RESET_EVT:
576 l->state = LINK_ESTABLISHING;
578 case LINK_FAILOVER_BEGIN_EVT:
579 l->state = LINK_FAILINGOVER;
580 case LINK_FAILURE_EVT:
582 case LINK_ESTABLISH_EVT:
583 case LINK_FAILOVER_END_EVT:
585 case LINK_SYNCH_BEGIN_EVT:
586 case LINK_SYNCH_END_EVT:
591 case LINK_PEER_RESET:
594 l->state = LINK_ESTABLISHING;
596 case LINK_PEER_RESET_EVT:
597 case LINK_ESTABLISH_EVT:
598 case LINK_FAILURE_EVT:
600 case LINK_SYNCH_BEGIN_EVT:
601 case LINK_SYNCH_END_EVT:
602 case LINK_FAILOVER_BEGIN_EVT:
603 case LINK_FAILOVER_END_EVT:
608 case LINK_FAILINGOVER:
610 case LINK_FAILOVER_END_EVT:
611 l->state = LINK_RESET;
613 case LINK_PEER_RESET_EVT:
615 case LINK_ESTABLISH_EVT:
616 case LINK_FAILURE_EVT:
618 case LINK_FAILOVER_BEGIN_EVT:
619 case LINK_SYNCH_BEGIN_EVT:
620 case LINK_SYNCH_END_EVT:
625 case LINK_ESTABLISHING:
627 case LINK_ESTABLISH_EVT:
628 l->state = LINK_ESTABLISHED;
630 case LINK_FAILOVER_BEGIN_EVT:
631 l->state = LINK_FAILINGOVER;
634 l->state = LINK_RESET;
636 case LINK_FAILURE_EVT:
637 case LINK_PEER_RESET_EVT:
638 case LINK_SYNCH_BEGIN_EVT:
639 case LINK_FAILOVER_END_EVT:
641 case LINK_SYNCH_END_EVT:
646 case LINK_ESTABLISHED:
648 case LINK_PEER_RESET_EVT:
649 l->state = LINK_PEER_RESET;
650 rc |= TIPC_LINK_DOWN_EVT;
652 case LINK_FAILURE_EVT:
653 l->state = LINK_RESETTING;
654 rc |= TIPC_LINK_DOWN_EVT;
657 l->state = LINK_RESET;
659 case LINK_ESTABLISH_EVT:
660 case LINK_SYNCH_END_EVT:
662 case LINK_SYNCH_BEGIN_EVT:
663 l->state = LINK_SYNCHING;
665 case LINK_FAILOVER_BEGIN_EVT:
666 case LINK_FAILOVER_END_EVT:
673 case LINK_PEER_RESET_EVT:
674 l->state = LINK_PEER_RESET;
675 rc |= TIPC_LINK_DOWN_EVT;
677 case LINK_FAILURE_EVT:
678 l->state = LINK_RESETTING;
679 rc |= TIPC_LINK_DOWN_EVT;
682 l->state = LINK_RESET;
684 case LINK_ESTABLISH_EVT:
685 case LINK_SYNCH_BEGIN_EVT:
687 case LINK_SYNCH_END_EVT:
688 l->state = LINK_ESTABLISHED;
690 case LINK_FAILOVER_BEGIN_EVT:
691 case LINK_FAILOVER_END_EVT:
697 pr_err("Unknown FSM state %x in %s\n", l->state, l->name);
701 pr_err("Illegal FSM event %x in state %x on link %s\n",
702 evt, l->state, l->name);
706 /* link_profile_stats - update statistical profiling of traffic
708 static void link_profile_stats(struct tipc_link *l)
711 struct tipc_msg *msg;
714 /* Update counters used in statistical profiling of send traffic */
715 l->stats.accu_queue_sz += skb_queue_len(&l->transmq);
716 l->stats.queue_sz_counts++;
718 skb = skb_peek(&l->transmq);
722 length = msg_size(msg);
724 if (msg_user(msg) == MSG_FRAGMENTER) {
725 if (msg_type(msg) != FIRST_FRAGMENT)
727 length = msg_size(msg_get_wrapped(msg));
729 l->stats.msg_lengths_total += length;
730 l->stats.msg_length_counts++;
732 l->stats.msg_length_profile[0]++;
733 else if (length <= 256)
734 l->stats.msg_length_profile[1]++;
735 else if (length <= 1024)
736 l->stats.msg_length_profile[2]++;
737 else if (length <= 4096)
738 l->stats.msg_length_profile[3]++;
739 else if (length <= 16384)
740 l->stats.msg_length_profile[4]++;
741 else if (length <= 32768)
742 l->stats.msg_length_profile[5]++;
744 l->stats.msg_length_profile[6]++;
747 /* tipc_link_timeout - perform periodic task as instructed from node timeout
749 int tipc_link_timeout(struct tipc_link *l, struct sk_buff_head *xmitq)
756 u16 bc_snt = l->bc_sndlink->snd_nxt - 1;
757 u16 bc_acked = l->bc_rcvlink->acked;
758 struct tipc_mon_state *mstate = &l->mon_state;
761 case LINK_ESTABLISHED:
764 link_profile_stats(l);
765 tipc_mon_get_state(l->net, l->addr, mstate, l->bearer_id);
766 if (mstate->reset || (l->silent_intv_cnt > l->abort_limit))
767 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
768 state = bc_acked != bc_snt;
769 state |= l->bc_rcvlink->rcv_unacked;
770 state |= l->rcv_unacked;
771 state |= !skb_queue_empty(&l->transmq);
772 state |= !skb_queue_empty(&l->deferdq);
773 probe = mstate->probing;
774 probe |= l->silent_intv_cnt;
775 if (probe || mstate->monitoring)
776 l->silent_intv_cnt++;
779 setup = l->rst_cnt++ <= 4;
780 setup |= !(l->rst_cnt % 16);
783 case LINK_ESTABLISHING:
787 case LINK_PEER_RESET:
789 case LINK_FAILINGOVER:
795 if (state || probe || setup)
796 tipc_link_build_proto_msg(l, mtyp, probe, 0, 0, 0, 0, xmitq);
802 * link_schedule_user - schedule a message sender for wakeup after congestion
804 * @hdr: header of message that is being sent
805 * Create pseudo msg to send back to user when congestion abates
807 static int link_schedule_user(struct tipc_link *l, struct tipc_msg *hdr)
809 u32 dnode = tipc_own_addr(l->net);
810 u32 dport = msg_origport(hdr);
813 /* Create and schedule wakeup pseudo message */
814 skb = tipc_msg_create(SOCK_WAKEUP, 0, INT_H_SIZE, 0,
815 dnode, l->addr, dport, 0, 0);
818 msg_set_dest_droppable(buf_msg(skb), true);
819 TIPC_SKB_CB(skb)->chain_imp = msg_importance(hdr);
820 skb_queue_tail(&l->wakeupq, skb);
821 l->stats.link_congs++;
826 * link_prepare_wakeup - prepare users for wakeup after congestion
828 * Wake up a number of waiting users, as permitted by available space
831 static void link_prepare_wakeup(struct tipc_link *l)
833 struct sk_buff_head *wakeupq = &l->wakeupq;
834 struct sk_buff_head *inputq = l->inputq;
835 struct sk_buff *skb, *tmp;
836 struct sk_buff_head tmpq;
840 __skb_queue_head_init(&tmpq);
842 for (; imp <= TIPC_SYSTEM_IMPORTANCE; imp++)
843 avail[imp] = l->backlog[imp].limit - l->backlog[imp].len;
845 skb_queue_walk_safe(wakeupq, skb, tmp) {
846 imp = TIPC_SKB_CB(skb)->chain_imp;
850 __skb_unlink(skb, wakeupq);
851 __skb_queue_tail(&tmpq, skb);
854 spin_lock_bh(&inputq->lock);
855 skb_queue_splice_tail(&tmpq, inputq);
856 spin_unlock_bh(&inputq->lock);
860 void tipc_link_reset(struct tipc_link *l)
862 struct sk_buff_head list;
865 __skb_queue_head_init(&list);
867 l->in_session = false;
869 l->mtu = l->advertised_mtu;
871 spin_lock_bh(&l->wakeupq.lock);
872 skb_queue_splice_init(&l->wakeupq, &list);
873 spin_unlock_bh(&l->wakeupq.lock);
875 spin_lock_bh(&l->inputq->lock);
876 skb_queue_splice_init(&list, l->inputq);
877 spin_unlock_bh(&l->inputq->lock);
879 __skb_queue_purge(&l->transmq);
880 __skb_queue_purge(&l->deferdq);
881 __skb_queue_purge(&l->backlogq);
882 for (imp = 0; imp <= TIPC_SYSTEM_IMPORTANCE; imp++) {
883 l->backlog[imp].len = 0;
884 l->backlog[imp].target_bskb = NULL;
886 kfree_skb(l->reasm_buf);
887 kfree_skb(l->failover_reasm_skb);
889 l->failover_reasm_skb = NULL;
893 l->snd_nxt_state = 1;
894 l->rcv_nxt_state = 1;
896 l->silent_intv_cnt = 0;
899 l->bc_peer_is_up = false;
900 memset(&l->mon_state, 0, sizeof(l->mon_state));
901 tipc_link_reset_stats(l);
905 * tipc_link_xmit(): enqueue buffer list according to queue situation
907 * @list: chain of buffers containing message
908 * @xmitq: returned list of packets to be sent by caller
910 * Consumes the buffer chain.
911 * Returns 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS
912 * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted
914 int tipc_link_xmit(struct tipc_link *l, struct sk_buff_head *list,
915 struct sk_buff_head *xmitq)
917 unsigned int maxwin = l->window;
918 unsigned int mtu = l->mtu;
919 u16 ack = l->rcv_nxt - 1;
920 u16 seqno = l->snd_nxt;
921 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
922 struct sk_buff_head *transmq = &l->transmq;
923 struct sk_buff_head *backlogq = &l->backlogq;
924 struct sk_buff *skb, *_skb, **tskb;
925 int pkt_cnt = skb_queue_len(list);
926 struct tipc_msg *hdr;
933 hdr = buf_msg(skb_peek(list));
934 if (unlikely(msg_size(hdr) > mtu)) {
935 __skb_queue_purge(list);
939 imp = msg_importance(hdr);
940 /* Allow oversubscription of one data msg per source at congestion */
941 if (unlikely(l->backlog[imp].len >= l->backlog[imp].limit)) {
942 if (imp == TIPC_SYSTEM_IMPORTANCE) {
943 pr_warn("%s<%s>, link overflow", link_rst_msg, l->name);
946 rc = link_schedule_user(l, hdr);
950 l->stats.sent_fragmented++;
951 l->stats.sent_fragments += pkt_cnt;
954 /* Prepare each packet for sending, and add to relevant queue: */
955 while (skb_queue_len(list)) {
956 skb = skb_peek(list);
958 msg_set_seqno(hdr, seqno);
959 msg_set_ack(hdr, ack);
960 msg_set_bcast_ack(hdr, bc_ack);
962 if (likely(skb_queue_len(transmq) < maxwin)) {
963 _skb = skb_clone(skb, GFP_ATOMIC);
965 __skb_queue_purge(list);
969 __skb_queue_tail(transmq, skb);
970 __skb_queue_tail(xmitq, _skb);
971 TIPC_SKB_CB(skb)->ackers = l->ackers;
973 l->stats.sent_pkts++;
977 tskb = &l->backlog[imp].target_bskb;
978 if (tipc_msg_bundle(*tskb, hdr, mtu)) {
979 kfree_skb(__skb_dequeue(list));
980 l->stats.sent_bundled++;
983 if (tipc_msg_make_bundle(tskb, hdr, mtu, l->addr)) {
984 kfree_skb(__skb_dequeue(list));
985 __skb_queue_tail(backlogq, *tskb);
986 l->backlog[imp].len++;
987 l->stats.sent_bundled++;
988 l->stats.sent_bundles++;
991 l->backlog[imp].target_bskb = NULL;
992 l->backlog[imp].len += skb_queue_len(list);
993 skb_queue_splice_tail_init(list, backlogq);
999 static void tipc_link_advance_backlog(struct tipc_link *l,
1000 struct sk_buff_head *xmitq)
1002 struct sk_buff *skb, *_skb;
1003 struct tipc_msg *hdr;
1004 u16 seqno = l->snd_nxt;
1005 u16 ack = l->rcv_nxt - 1;
1006 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
1009 while (skb_queue_len(&l->transmq) < l->window) {
1010 skb = skb_peek(&l->backlogq);
1013 _skb = skb_clone(skb, GFP_ATOMIC);
1016 __skb_dequeue(&l->backlogq);
1018 imp = msg_importance(hdr);
1019 l->backlog[imp].len--;
1020 if (unlikely(skb == l->backlog[imp].target_bskb))
1021 l->backlog[imp].target_bskb = NULL;
1022 __skb_queue_tail(&l->transmq, skb);
1023 __skb_queue_tail(xmitq, _skb);
1024 TIPC_SKB_CB(skb)->ackers = l->ackers;
1025 msg_set_seqno(hdr, seqno);
1026 msg_set_ack(hdr, ack);
1027 msg_set_bcast_ack(hdr, bc_ack);
1029 l->stats.sent_pkts++;
1035 static void link_retransmit_failure(struct tipc_link *l, struct sk_buff *skb)
1037 struct tipc_msg *hdr = buf_msg(skb);
1039 pr_warn("Retransmission failure on link <%s>\n", l->name);
1040 link_print(l, "State of link ");
1041 pr_info("Failed msg: usr %u, typ %u, len %u, err %u\n",
1042 msg_user(hdr), msg_type(hdr), msg_size(hdr), msg_errcode(hdr));
1043 pr_info("sqno %u, prev: %x, src: %x\n",
1044 msg_seqno(hdr), msg_prevnode(hdr), msg_orignode(hdr));
1047 /* tipc_link_retrans() - retransmit one or more packets
1048 * @l: the link to transmit on
1049 * @r: the receiving link ordering the retransmit. Same as l if unicast
1050 * @from: retransmit from (inclusive) this sequence number
1051 * @to: retransmit to (inclusive) this sequence number
1052 * xmitq: queue for accumulating the retransmitted packets
1054 static int tipc_link_retrans(struct tipc_link *l, struct tipc_link *r,
1055 u16 from, u16 to, struct sk_buff_head *xmitq)
1057 struct sk_buff *_skb, *skb = skb_peek(&l->transmq);
1058 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
1059 u16 ack = l->rcv_nxt - 1;
1060 struct tipc_msg *hdr;
1065 /* Detect repeated retransmit failures on same packet */
1066 if (r->last_retransm != buf_seqno(skb)) {
1067 r->last_retransm = buf_seqno(skb);
1068 r->stale_limit = jiffies + msecs_to_jiffies(r->tolerance);
1070 } else if (++r->stale_cnt > 99 && time_after(jiffies, r->stale_limit)) {
1071 link_retransmit_failure(l, skb);
1072 if (link_is_bc_sndlink(l))
1073 return TIPC_LINK_DOWN_EVT;
1074 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1077 skb_queue_walk(&l->transmq, skb) {
1079 if (less(msg_seqno(hdr), from))
1081 if (more(msg_seqno(hdr), to))
1083 _skb = __pskb_copy(skb, MIN_H_SIZE, GFP_ATOMIC);
1086 hdr = buf_msg(_skb);
1087 msg_set_ack(hdr, ack);
1088 msg_set_bcast_ack(hdr, bc_ack);
1089 _skb->priority = TC_PRIO_CONTROL;
1090 __skb_queue_tail(xmitq, _skb);
1091 l->stats.retransmitted++;
1096 /* tipc_data_input - deliver data and name distr msgs to upper layer
1098 * Consumes buffer if message is of right type
1099 * Node lock must be held
1101 static bool tipc_data_input(struct tipc_link *l, struct sk_buff *skb,
1102 struct sk_buff_head *inputq)
1104 struct sk_buff_head *mc_inputq = l->bc_rcvlink->inputq;
1105 struct tipc_msg *hdr = buf_msg(skb);
1107 switch (msg_user(hdr)) {
1108 case TIPC_LOW_IMPORTANCE:
1109 case TIPC_MEDIUM_IMPORTANCE:
1110 case TIPC_HIGH_IMPORTANCE:
1111 case TIPC_CRITICAL_IMPORTANCE:
1112 if (unlikely(msg_in_group(hdr) || msg_mcast(hdr))) {
1113 skb_queue_tail(mc_inputq, skb);
1116 /* else: fall through */
1118 skb_queue_tail(inputq, skb);
1120 case GROUP_PROTOCOL:
1121 skb_queue_tail(mc_inputq, skb);
1123 case NAME_DISTRIBUTOR:
1124 l->bc_rcvlink->state = LINK_ESTABLISHED;
1125 skb_queue_tail(l->namedq, skb);
1128 case TUNNEL_PROTOCOL:
1129 case MSG_FRAGMENTER:
1130 case BCAST_PROTOCOL:
1133 pr_warn("Dropping received illegal msg type\n");
1139 /* tipc_link_input - process packet that has passed link protocol check
1143 static int tipc_link_input(struct tipc_link *l, struct sk_buff *skb,
1144 struct sk_buff_head *inputq)
1146 struct tipc_msg *hdr = buf_msg(skb);
1147 struct sk_buff **reasm_skb = &l->reasm_buf;
1148 struct sk_buff *iskb;
1149 struct sk_buff_head tmpq;
1150 int usr = msg_user(hdr);
1155 if (unlikely(usr == TUNNEL_PROTOCOL)) {
1156 if (msg_type(hdr) == SYNCH_MSG) {
1157 __skb_queue_purge(&l->deferdq);
1160 if (!tipc_msg_extract(skb, &iskb, &ipos))
1165 if (less(msg_seqno(hdr), l->drop_point))
1167 if (tipc_data_input(l, skb, inputq))
1169 usr = msg_user(hdr);
1170 reasm_skb = &l->failover_reasm_skb;
1173 if (usr == MSG_BUNDLER) {
1174 skb_queue_head_init(&tmpq);
1175 l->stats.recv_bundles++;
1176 l->stats.recv_bundled += msg_msgcnt(hdr);
1177 while (tipc_msg_extract(skb, &iskb, &pos))
1178 tipc_data_input(l, iskb, &tmpq);
1179 tipc_skb_queue_splice_tail(&tmpq, inputq);
1181 } else if (usr == MSG_FRAGMENTER) {
1182 l->stats.recv_fragments++;
1183 if (tipc_buf_append(reasm_skb, &skb)) {
1184 l->stats.recv_fragmented++;
1185 tipc_data_input(l, skb, inputq);
1186 } else if (!*reasm_skb && !link_is_bc_rcvlink(l)) {
1187 pr_warn_ratelimited("Unable to build fragment list\n");
1188 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1191 } else if (usr == BCAST_PROTOCOL) {
1192 tipc_bcast_lock(l->net);
1193 tipc_link_bc_init_rcv(l->bc_rcvlink, hdr);
1194 tipc_bcast_unlock(l->net);
1201 static bool tipc_link_release_pkts(struct tipc_link *l, u16 acked)
1203 bool released = false;
1204 struct sk_buff *skb, *tmp;
1206 skb_queue_walk_safe(&l->transmq, skb, tmp) {
1207 if (more(buf_seqno(skb), acked))
1209 __skb_unlink(skb, &l->transmq);
1216 /* tipc_link_build_state_msg: prepare link state message for transmission
1218 * Note that sending of broadcast ack is coordinated among nodes, to reduce
1219 * risk of ack storms towards the sender
1221 int tipc_link_build_state_msg(struct tipc_link *l, struct sk_buff_head *xmitq)
1226 /* Broadcast ACK must be sent via a unicast link => defer to caller */
1227 if (link_is_bc_rcvlink(l)) {
1228 if (((l->rcv_nxt ^ tipc_own_addr(l->net)) & 0xf) != 0xf)
1232 /* Use snd_nxt to store peer's snd_nxt in broadcast rcv link */
1233 l->snd_nxt = l->rcv_nxt;
1234 return TIPC_LINK_SND_STATE;
1239 l->stats.sent_acks++;
1240 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, 0, xmitq);
1244 /* tipc_link_build_reset_msg: prepare link RESET or ACTIVATE message
1246 void tipc_link_build_reset_msg(struct tipc_link *l, struct sk_buff_head *xmitq)
1248 int mtyp = RESET_MSG;
1249 struct sk_buff *skb;
1251 if (l->state == LINK_ESTABLISHING)
1252 mtyp = ACTIVATE_MSG;
1254 tipc_link_build_proto_msg(l, mtyp, 0, 0, 0, 0, 0, xmitq);
1256 /* Inform peer that this endpoint is going down if applicable */
1257 skb = skb_peek_tail(xmitq);
1258 if (skb && (l->state == LINK_RESET))
1259 msg_set_peer_stopping(buf_msg(skb), 1);
1262 /* tipc_link_build_nack_msg: prepare link nack message for transmission
1263 * Note that sending of broadcast NACK is coordinated among nodes, to
1264 * reduce the risk of NACK storms towards the sender
1266 static int tipc_link_build_nack_msg(struct tipc_link *l,
1267 struct sk_buff_head *xmitq)
1269 u32 def_cnt = ++l->stats.deferred_recv;
1272 if (link_is_bc_rcvlink(l)) {
1273 match1 = def_cnt & 0xf;
1274 match2 = tipc_own_addr(l->net) & 0xf;
1275 if (match1 == match2)
1276 return TIPC_LINK_SND_STATE;
1280 if ((skb_queue_len(&l->deferdq) == 1) || !(def_cnt % TIPC_NACK_INTV))
1281 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, 0, xmitq);
1285 /* tipc_link_rcv - process TIPC packets/messages arriving from off-node
1286 * @l: the link that should handle the message
1288 * @xmitq: queue to place packets to be sent after this call
1290 int tipc_link_rcv(struct tipc_link *l, struct sk_buff *skb,
1291 struct sk_buff_head *xmitq)
1293 struct sk_buff_head *defq = &l->deferdq;
1294 struct tipc_msg *hdr;
1295 u16 seqno, rcv_nxt, win_lim;
1300 seqno = msg_seqno(hdr);
1301 rcv_nxt = l->rcv_nxt;
1302 win_lim = rcv_nxt + TIPC_MAX_LINK_WIN;
1304 /* Verify and update link state */
1305 if (unlikely(msg_user(hdr) == LINK_PROTOCOL))
1306 return tipc_link_proto_rcv(l, skb, xmitq);
1308 if (unlikely(!link_is_up(l))) {
1309 if (l->state == LINK_ESTABLISHING)
1310 rc = TIPC_LINK_UP_EVT;
1314 /* Don't send probe at next timeout expiration */
1315 l->silent_intv_cnt = 0;
1317 /* Drop if outside receive window */
1318 if (unlikely(less(seqno, rcv_nxt) || more(seqno, win_lim))) {
1319 l->stats.duplicates++;
1323 /* Forward queues and wake up waiting users */
1324 if (likely(tipc_link_release_pkts(l, msg_ack(hdr)))) {
1326 tipc_link_advance_backlog(l, xmitq);
1327 if (unlikely(!skb_queue_empty(&l->wakeupq)))
1328 link_prepare_wakeup(l);
1331 /* Defer delivery if sequence gap */
1332 if (unlikely(seqno != rcv_nxt)) {
1333 __tipc_skb_queue_sorted(defq, seqno, skb);
1334 rc |= tipc_link_build_nack_msg(l, xmitq);
1338 /* Deliver packet */
1340 l->stats.recv_pkts++;
1341 if (!tipc_data_input(l, skb, l->inputq))
1342 rc |= tipc_link_input(l, skb, l->inputq);
1343 if (unlikely(++l->rcv_unacked >= TIPC_MIN_LINK_WIN))
1344 rc |= tipc_link_build_state_msg(l, xmitq);
1345 if (unlikely(rc & ~TIPC_LINK_SND_STATE))
1347 } while ((skb = __skb_dequeue(defq)));
1355 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe,
1356 bool probe_reply, u16 rcvgap,
1357 int tolerance, int priority,
1358 struct sk_buff_head *xmitq)
1360 struct tipc_link *bcl = l->bc_rcvlink;
1361 struct sk_buff *skb;
1362 struct tipc_msg *hdr;
1363 struct sk_buff_head *dfq = &l->deferdq;
1364 bool node_up = link_is_up(bcl);
1365 struct tipc_mon_state *mstate = &l->mon_state;
1369 /* Don't send protocol message during reset or link failover */
1370 if (tipc_link_is_blocked(l))
1373 if (!tipc_link_is_up(l) && (mtyp == STATE_MSG))
1376 if (!skb_queue_empty(dfq))
1377 rcvgap = buf_seqno(skb_peek(dfq)) - l->rcv_nxt;
1379 skb = tipc_msg_create(LINK_PROTOCOL, mtyp, INT_H_SIZE,
1380 tipc_max_domain_size, l->addr,
1381 tipc_own_addr(l->net), 0, 0, 0);
1386 data = msg_data(hdr);
1387 msg_set_session(hdr, l->session);
1388 msg_set_bearer_id(hdr, l->bearer_id);
1389 msg_set_net_plane(hdr, l->net_plane);
1390 msg_set_next_sent(hdr, l->snd_nxt);
1391 msg_set_ack(hdr, l->rcv_nxt - 1);
1392 msg_set_bcast_ack(hdr, bcl->rcv_nxt - 1);
1393 msg_set_bc_ack_invalid(hdr, !node_up);
1394 msg_set_last_bcast(hdr, l->bc_sndlink->snd_nxt - 1);
1395 msg_set_link_tolerance(hdr, tolerance);
1396 msg_set_linkprio(hdr, priority);
1397 msg_set_redundant_link(hdr, node_up);
1398 msg_set_seq_gap(hdr, 0);
1399 msg_set_seqno(hdr, l->snd_nxt + U16_MAX / 2);
1401 if (mtyp == STATE_MSG) {
1402 if (l->peer_caps & TIPC_LINK_PROTO_SEQNO)
1403 msg_set_seqno(hdr, l->snd_nxt_state++);
1404 msg_set_seq_gap(hdr, rcvgap);
1405 msg_set_bc_gap(hdr, link_bc_rcv_gap(bcl));
1406 msg_set_probe(hdr, probe);
1407 msg_set_is_keepalive(hdr, probe || probe_reply);
1408 tipc_mon_prep(l->net, data, &dlen, mstate, l->bearer_id);
1409 msg_set_size(hdr, INT_H_SIZE + dlen);
1410 skb_trim(skb, INT_H_SIZE + dlen);
1411 l->stats.sent_states++;
1414 /* RESET_MSG or ACTIVATE_MSG */
1415 msg_set_max_pkt(hdr, l->advertised_mtu);
1416 strcpy(data, l->if_name);
1417 msg_set_size(hdr, INT_H_SIZE + TIPC_MAX_IF_NAME);
1418 skb_trim(skb, INT_H_SIZE + TIPC_MAX_IF_NAME);
1421 l->stats.sent_probes++;
1423 l->stats.sent_nacks++;
1424 skb->priority = TC_PRIO_CONTROL;
1425 __skb_queue_tail(xmitq, skb);
1428 void tipc_link_create_dummy_tnl_msg(struct tipc_link *l,
1429 struct sk_buff_head *xmitq)
1431 u32 onode = tipc_own_addr(l->net);
1432 struct tipc_msg *hdr, *ihdr;
1433 struct sk_buff_head tnlq;
1434 struct sk_buff *skb;
1435 u32 dnode = l->addr;
1437 __skb_queue_head_init(&tnlq);
1438 skb = tipc_msg_create(TUNNEL_PROTOCOL, FAILOVER_MSG,
1439 INT_H_SIZE, BASIC_H_SIZE,
1440 dnode, onode, 0, 0, 0);
1442 pr_warn("%sunable to create tunnel packet\n", link_co_err);
1447 msg_set_msgcnt(hdr, 1);
1448 msg_set_bearer_id(hdr, l->peer_bearer_id);
1450 ihdr = (struct tipc_msg *)msg_data(hdr);
1451 tipc_msg_init(onode, ihdr, TIPC_LOW_IMPORTANCE, TIPC_DIRECT_MSG,
1452 BASIC_H_SIZE, dnode);
1453 msg_set_errcode(ihdr, TIPC_ERR_NO_PORT);
1454 __skb_queue_tail(&tnlq, skb);
1455 tipc_link_xmit(l, &tnlq, xmitq);
1458 /* tipc_link_tnl_prepare(): prepare and return a list of tunnel packets
1459 * with contents of the link's transmit and backlog queues.
1461 void tipc_link_tnl_prepare(struct tipc_link *l, struct tipc_link *tnl,
1462 int mtyp, struct sk_buff_head *xmitq)
1464 struct sk_buff *skb, *tnlskb;
1465 struct tipc_msg *hdr, tnlhdr;
1466 struct sk_buff_head *queue = &l->transmq;
1467 struct sk_buff_head tmpxq, tnlq;
1468 u16 pktlen, pktcnt, seqno = l->snd_nxt;
1473 __skb_queue_head_init(&tnlq);
1474 __skb_queue_head_init(&tmpxq);
1476 /* At least one packet required for safe algorithm => add dummy */
1477 skb = tipc_msg_create(TIPC_LOW_IMPORTANCE, TIPC_DIRECT_MSG,
1478 BASIC_H_SIZE, 0, l->addr, tipc_own_addr(l->net),
1479 0, 0, TIPC_ERR_NO_PORT);
1481 pr_warn("%sunable to create tunnel packet\n", link_co_err);
1484 __skb_queue_tail(&tnlq, skb);
1485 tipc_link_xmit(l, &tnlq, &tmpxq);
1486 __skb_queue_purge(&tmpxq);
1488 /* Initialize reusable tunnel packet header */
1489 tipc_msg_init(tipc_own_addr(l->net), &tnlhdr, TUNNEL_PROTOCOL,
1490 mtyp, INT_H_SIZE, l->addr);
1491 pktcnt = skb_queue_len(&l->transmq) + skb_queue_len(&l->backlogq);
1492 msg_set_msgcnt(&tnlhdr, pktcnt);
1493 msg_set_bearer_id(&tnlhdr, l->peer_bearer_id);
1495 /* Wrap each packet into a tunnel packet */
1496 skb_queue_walk(queue, skb) {
1498 if (queue == &l->backlogq)
1499 msg_set_seqno(hdr, seqno++);
1500 pktlen = msg_size(hdr);
1501 msg_set_size(&tnlhdr, pktlen + INT_H_SIZE);
1502 tnlskb = tipc_buf_acquire(pktlen + INT_H_SIZE, GFP_ATOMIC);
1504 pr_warn("%sunable to send packet\n", link_co_err);
1507 skb_copy_to_linear_data(tnlskb, &tnlhdr, INT_H_SIZE);
1508 skb_copy_to_linear_data_offset(tnlskb, INT_H_SIZE, hdr, pktlen);
1509 __skb_queue_tail(&tnlq, tnlskb);
1511 if (queue != &l->backlogq) {
1512 queue = &l->backlogq;
1516 tipc_link_xmit(tnl, &tnlq, xmitq);
1518 if (mtyp == FAILOVER_MSG) {
1519 tnl->drop_point = l->rcv_nxt;
1520 tnl->failover_reasm_skb = l->reasm_buf;
1521 l->reasm_buf = NULL;
1525 /* tipc_link_validate_msg(): validate message against current link state
1526 * Returns true if message should be accepted, otherwise false
1528 bool tipc_link_validate_msg(struct tipc_link *l, struct tipc_msg *hdr)
1530 u16 curr_session = l->peer_session;
1531 u16 session = msg_session(hdr);
1532 int mtyp = msg_type(hdr);
1534 if (msg_user(hdr) != LINK_PROTOCOL)
1541 /* Accept only RESET with new session number */
1542 return more(session, curr_session);
1546 /* Accept only ACTIVATE with new or current session number */
1547 return !less(session, curr_session);
1549 /* Accept only STATE with current session number */
1552 if (session != curr_session)
1554 /* Extra sanity check */
1555 if (!link_is_up(l) && msg_ack(hdr))
1557 if (!(l->peer_caps & TIPC_LINK_PROTO_SEQNO))
1559 /* Accept only STATE with new sequence number */
1560 return !less(msg_seqno(hdr), l->rcv_nxt_state);
1566 /* tipc_link_proto_rcv(): receive link level protocol message :
1567 * Note that network plane id propagates through the network, and may
1568 * change at any time. The node with lowest numerical id determines
1571 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb,
1572 struct sk_buff_head *xmitq)
1574 struct tipc_msg *hdr = buf_msg(skb);
1576 u16 ack = msg_ack(hdr);
1577 u16 gap = msg_seq_gap(hdr);
1578 u16 peers_snd_nxt = msg_next_sent(hdr);
1579 u16 peers_tol = msg_link_tolerance(hdr);
1580 u16 peers_prio = msg_linkprio(hdr);
1581 u16 rcv_nxt = l->rcv_nxt;
1582 u32 dlen = msg_data_sz(hdr);
1583 int mtyp = msg_type(hdr);
1584 bool reply = msg_probe(hdr);
1592 if (tipc_link_is_blocked(l) || !xmitq)
1595 if (tipc_own_addr(l->net) > msg_prevnode(hdr))
1596 l->net_plane = msg_net_plane(hdr);
1600 data = msg_data(hdr);
1602 if (!tipc_link_validate_msg(l, hdr))
1608 /* Complete own link name with peer's interface name */
1609 if_name = strrchr(l->name, ':') + 1;
1610 if (sizeof(l->name) - (if_name - l->name) <= TIPC_MAX_IF_NAME)
1612 if (msg_data_sz(hdr) < TIPC_MAX_IF_NAME)
1614 strncpy(if_name, data, TIPC_MAX_IF_NAME);
1616 /* Update own tolerance if peer indicates a non-zero value */
1617 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL)) {
1618 l->tolerance = peers_tol;
1619 l->bc_rcvlink->tolerance = peers_tol;
1621 /* Update own priority if peer's priority is higher */
1622 if (in_range(peers_prio, l->priority + 1, TIPC_MAX_LINK_PRI))
1623 l->priority = peers_prio;
1625 /* If peer is going down we want full re-establish cycle */
1626 if (msg_peer_stopping(hdr)) {
1627 rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1630 /* ACTIVATE_MSG serves as PEER_RESET if link is already down */
1631 if (mtyp == RESET_MSG || !link_is_up(l))
1632 rc = tipc_link_fsm_evt(l, LINK_PEER_RESET_EVT);
1634 /* ACTIVATE_MSG takes up link if it was already locally reset */
1635 if (mtyp == ACTIVATE_MSG && l->state == LINK_ESTABLISHING)
1636 rc = TIPC_LINK_UP_EVT;
1638 l->peer_session = msg_session(hdr);
1639 l->in_session = true;
1640 l->peer_bearer_id = msg_bearer_id(hdr);
1641 if (l->mtu > msg_max_pkt(hdr))
1642 l->mtu = msg_max_pkt(hdr);
1646 l->rcv_nxt_state = msg_seqno(hdr) + 1;
1648 /* Update own tolerance if peer indicates a non-zero value */
1649 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL)) {
1650 l->tolerance = peers_tol;
1651 l->bc_rcvlink->tolerance = peers_tol;
1653 /* Update own prio if peer indicates a different value */
1654 if ((peers_prio != l->priority) &&
1655 in_range(peers_prio, 1, TIPC_MAX_LINK_PRI)) {
1656 l->priority = peers_prio;
1657 rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1660 l->silent_intv_cnt = 0;
1661 l->stats.recv_states++;
1663 l->stats.recv_probes++;
1665 if (!link_is_up(l)) {
1666 if (l->state == LINK_ESTABLISHING)
1667 rc = TIPC_LINK_UP_EVT;
1670 tipc_mon_rcv(l->net, data, dlen, l->addr,
1671 &l->mon_state, l->bearer_id);
1673 /* Send NACK if peer has sent pkts we haven't received yet */
1674 if (more(peers_snd_nxt, rcv_nxt) && !tipc_link_is_synching(l))
1675 rcvgap = peers_snd_nxt - l->rcv_nxt;
1676 if (rcvgap || reply)
1677 tipc_link_build_proto_msg(l, STATE_MSG, 0, reply,
1678 rcvgap, 0, 0, xmitq);
1679 tipc_link_release_pkts(l, ack);
1681 /* If NACK, retransmit will now start at right position */
1683 rc = tipc_link_retrans(l, l, ack + 1, ack + gap, xmitq);
1684 l->stats.recv_nacks++;
1687 tipc_link_advance_backlog(l, xmitq);
1688 if (unlikely(!skb_queue_empty(&l->wakeupq)))
1689 link_prepare_wakeup(l);
1696 /* tipc_link_build_bc_proto_msg() - create broadcast protocol message
1698 static bool tipc_link_build_bc_proto_msg(struct tipc_link *l, bool bcast,
1700 struct sk_buff_head *xmitq)
1702 struct sk_buff *skb;
1703 struct tipc_msg *hdr;
1704 struct sk_buff *dfrd_skb = skb_peek(&l->deferdq);
1705 u16 ack = l->rcv_nxt - 1;
1706 u16 gap_to = peers_snd_nxt - 1;
1708 skb = tipc_msg_create(BCAST_PROTOCOL, STATE_MSG, INT_H_SIZE,
1709 0, l->addr, tipc_own_addr(l->net), 0, 0, 0);
1713 msg_set_last_bcast(hdr, l->bc_sndlink->snd_nxt - 1);
1714 msg_set_bcast_ack(hdr, ack);
1715 msg_set_bcgap_after(hdr, ack);
1717 gap_to = buf_seqno(dfrd_skb) - 1;
1718 msg_set_bcgap_to(hdr, gap_to);
1719 msg_set_non_seq(hdr, bcast);
1720 __skb_queue_tail(xmitq, skb);
1724 /* tipc_link_build_bc_init_msg() - synchronize broadcast link endpoints.
1726 * Give a newly added peer node the sequence number where it should
1727 * start receiving and acking broadcast packets.
1729 static void tipc_link_build_bc_init_msg(struct tipc_link *l,
1730 struct sk_buff_head *xmitq)
1732 struct sk_buff_head list;
1734 __skb_queue_head_init(&list);
1735 if (!tipc_link_build_bc_proto_msg(l->bc_rcvlink, false, 0, &list))
1737 msg_set_bc_ack_invalid(buf_msg(skb_peek(&list)), true);
1738 tipc_link_xmit(l, &list, xmitq);
1741 /* tipc_link_bc_init_rcv - receive initial broadcast synch data from peer
1743 void tipc_link_bc_init_rcv(struct tipc_link *l, struct tipc_msg *hdr)
1745 int mtyp = msg_type(hdr);
1746 u16 peers_snd_nxt = msg_bc_snd_nxt(hdr);
1751 if (msg_user(hdr) == BCAST_PROTOCOL) {
1752 l->rcv_nxt = peers_snd_nxt;
1753 l->state = LINK_ESTABLISHED;
1757 if (l->peer_caps & TIPC_BCAST_SYNCH)
1760 if (msg_peer_node_is_up(hdr))
1763 /* Compatibility: accept older, less safe initial synch data */
1764 if ((mtyp == RESET_MSG) || (mtyp == ACTIVATE_MSG))
1765 l->rcv_nxt = peers_snd_nxt;
1768 /* link_bc_retr eval()- check if the indicated range can be retransmitted now
1769 * - Adjust permitted range if there is overlap with previous retransmission
1771 static bool link_bc_retr_eval(struct tipc_link *l, u16 *from, u16 *to)
1773 unsigned long elapsed = jiffies_to_msecs(jiffies - l->prev_retr);
1775 if (less(*to, *from))
1778 /* New retransmission request */
1779 if ((elapsed > TIPC_BC_RETR_LIMIT) ||
1780 less(*to, l->prev_from) || more(*from, l->prev_to)) {
1781 l->prev_from = *from;
1783 l->prev_retr = jiffies;
1787 /* Inside range of previous retransmit */
1788 if (!less(*from, l->prev_from) && !more(*to, l->prev_to))
1791 /* Fully or partially outside previous range => exclude overlap */
1792 if (less(*from, l->prev_from)) {
1793 *to = l->prev_from - 1;
1794 l->prev_from = *from;
1796 if (more(*to, l->prev_to)) {
1797 *from = l->prev_to + 1;
1800 l->prev_retr = jiffies;
1804 /* tipc_link_bc_sync_rcv - update rcv link according to peer's send state
1806 int tipc_link_bc_sync_rcv(struct tipc_link *l, struct tipc_msg *hdr,
1807 struct sk_buff_head *xmitq)
1809 struct tipc_link *snd_l = l->bc_sndlink;
1810 u16 peers_snd_nxt = msg_bc_snd_nxt(hdr);
1811 u16 from = msg_bcast_ack(hdr) + 1;
1812 u16 to = from + msg_bc_gap(hdr) - 1;
1818 if (!msg_peer_node_is_up(hdr))
1821 /* Open when peer ackowledges our bcast init msg (pkt #1) */
1823 l->bc_peer_is_up = true;
1825 if (!l->bc_peer_is_up)
1828 l->stats.recv_nacks++;
1830 /* Ignore if peers_snd_nxt goes beyond receive window */
1831 if (more(peers_snd_nxt, l->rcv_nxt + l->window))
1834 if (link_bc_retr_eval(snd_l, &from, &to))
1835 rc = tipc_link_retrans(snd_l, l, from, to, xmitq);
1837 l->snd_nxt = peers_snd_nxt;
1838 if (link_bc_rcv_gap(l))
1839 rc |= TIPC_LINK_SND_STATE;
1841 /* Return now if sender supports nack via STATE messages */
1842 if (l->peer_caps & TIPC_BCAST_STATE_NACK)
1845 /* Otherwise, be backwards compatible */
1847 if (!more(peers_snd_nxt, l->rcv_nxt)) {
1848 l->nack_state = BC_NACK_SND_CONDITIONAL;
1852 /* Don't NACK if one was recently sent or peeked */
1853 if (l->nack_state == BC_NACK_SND_SUPPRESS) {
1854 l->nack_state = BC_NACK_SND_UNCONDITIONAL;
1858 /* Conditionally delay NACK sending until next synch rcv */
1859 if (l->nack_state == BC_NACK_SND_CONDITIONAL) {
1860 l->nack_state = BC_NACK_SND_UNCONDITIONAL;
1861 if ((peers_snd_nxt - l->rcv_nxt) < TIPC_MIN_LINK_WIN)
1865 /* Send NACK now but suppress next one */
1866 tipc_link_build_bc_proto_msg(l, true, peers_snd_nxt, xmitq);
1867 l->nack_state = BC_NACK_SND_SUPPRESS;
1871 void tipc_link_bc_ack_rcv(struct tipc_link *l, u16 acked,
1872 struct sk_buff_head *xmitq)
1874 struct sk_buff *skb, *tmp;
1875 struct tipc_link *snd_l = l->bc_sndlink;
1877 if (!link_is_up(l) || !l->bc_peer_is_up)
1880 if (!more(acked, l->acked))
1883 /* Skip over packets peer has already acked */
1884 skb_queue_walk(&snd_l->transmq, skb) {
1885 if (more(buf_seqno(skb), l->acked))
1889 /* Update/release the packets peer is acking now */
1890 skb_queue_walk_from_safe(&snd_l->transmq, skb, tmp) {
1891 if (more(buf_seqno(skb), acked))
1893 if (!--TIPC_SKB_CB(skb)->ackers) {
1894 __skb_unlink(skb, &snd_l->transmq);
1899 tipc_link_advance_backlog(snd_l, xmitq);
1900 if (unlikely(!skb_queue_empty(&snd_l->wakeupq)))
1901 link_prepare_wakeup(snd_l);
1904 /* tipc_link_bc_nack_rcv(): receive broadcast nack message
1905 * This function is here for backwards compatibility, since
1906 * no BCAST_PROTOCOL/STATE messages occur from TIPC v2.5.
1908 int tipc_link_bc_nack_rcv(struct tipc_link *l, struct sk_buff *skb,
1909 struct sk_buff_head *xmitq)
1911 struct tipc_msg *hdr = buf_msg(skb);
1912 u32 dnode = msg_destnode(hdr);
1913 int mtyp = msg_type(hdr);
1914 u16 acked = msg_bcast_ack(hdr);
1915 u16 from = acked + 1;
1916 u16 to = msg_bcgap_to(hdr);
1917 u16 peers_snd_nxt = to + 1;
1922 if (!tipc_link_is_up(l) || !l->bc_peer_is_up)
1925 if (mtyp != STATE_MSG)
1928 if (dnode == tipc_own_addr(l->net)) {
1929 tipc_link_bc_ack_rcv(l, acked, xmitq);
1930 rc = tipc_link_retrans(l->bc_sndlink, l, from, to, xmitq);
1931 l->stats.recv_nacks++;
1935 /* Msg for other node => suppress own NACK at next sync if applicable */
1936 if (more(peers_snd_nxt, l->rcv_nxt) && !less(l->rcv_nxt, from))
1937 l->nack_state = BC_NACK_SND_SUPPRESS;
1942 void tipc_link_set_queue_limits(struct tipc_link *l, u32 win)
1944 int max_bulk = TIPC_MAX_PUBL / (l->mtu / ITEM_SIZE);
1947 l->backlog[TIPC_LOW_IMPORTANCE].limit = max_t(u16, 50, win);
1948 l->backlog[TIPC_MEDIUM_IMPORTANCE].limit = max_t(u16, 100, win * 2);
1949 l->backlog[TIPC_HIGH_IMPORTANCE].limit = max_t(u16, 150, win * 3);
1950 l->backlog[TIPC_CRITICAL_IMPORTANCE].limit = max_t(u16, 200, win * 4);
1951 l->backlog[TIPC_SYSTEM_IMPORTANCE].limit = max_bulk;
1955 * link_reset_stats - reset link statistics
1956 * @l: pointer to link
1958 void tipc_link_reset_stats(struct tipc_link *l)
1960 memset(&l->stats, 0, sizeof(l->stats));
1963 static void link_print(struct tipc_link *l, const char *str)
1965 struct sk_buff *hskb = skb_peek(&l->transmq);
1966 u16 head = hskb ? msg_seqno(buf_msg(hskb)) : l->snd_nxt - 1;
1967 u16 tail = l->snd_nxt - 1;
1969 pr_info("%s Link <%s> state %x\n", str, l->name, l->state);
1970 pr_info("XMTQ: %u [%u-%u], BKLGQ: %u, SNDNX: %u, RCVNX: %u\n",
1971 skb_queue_len(&l->transmq), head, tail,
1972 skb_queue_len(&l->backlogq), l->snd_nxt, l->rcv_nxt);
1975 /* Parse and validate nested (link) properties valid for media, bearer and link
1977 int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[])
1981 err = nla_parse_nested(props, TIPC_NLA_PROP_MAX, prop,
1982 tipc_nl_prop_policy, NULL);
1986 if (props[TIPC_NLA_PROP_PRIO]) {
1989 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
1990 if (prio > TIPC_MAX_LINK_PRI)
1994 if (props[TIPC_NLA_PROP_TOL]) {
1997 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
1998 if ((tol < TIPC_MIN_LINK_TOL) || (tol > TIPC_MAX_LINK_TOL))
2002 if (props[TIPC_NLA_PROP_WIN]) {
2005 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2006 if ((win < TIPC_MIN_LINK_WIN) || (win > TIPC_MAX_LINK_WIN))
2013 static int __tipc_nl_add_stats(struct sk_buff *skb, struct tipc_stats *s)
2016 struct nlattr *stats;
2023 struct nla_map map[] = {
2024 {TIPC_NLA_STATS_RX_INFO, 0},
2025 {TIPC_NLA_STATS_RX_FRAGMENTS, s->recv_fragments},
2026 {TIPC_NLA_STATS_RX_FRAGMENTED, s->recv_fragmented},
2027 {TIPC_NLA_STATS_RX_BUNDLES, s->recv_bundles},
2028 {TIPC_NLA_STATS_RX_BUNDLED, s->recv_bundled},
2029 {TIPC_NLA_STATS_TX_INFO, 0},
2030 {TIPC_NLA_STATS_TX_FRAGMENTS, s->sent_fragments},
2031 {TIPC_NLA_STATS_TX_FRAGMENTED, s->sent_fragmented},
2032 {TIPC_NLA_STATS_TX_BUNDLES, s->sent_bundles},
2033 {TIPC_NLA_STATS_TX_BUNDLED, s->sent_bundled},
2034 {TIPC_NLA_STATS_MSG_PROF_TOT, (s->msg_length_counts) ?
2035 s->msg_length_counts : 1},
2036 {TIPC_NLA_STATS_MSG_LEN_CNT, s->msg_length_counts},
2037 {TIPC_NLA_STATS_MSG_LEN_TOT, s->msg_lengths_total},
2038 {TIPC_NLA_STATS_MSG_LEN_P0, s->msg_length_profile[0]},
2039 {TIPC_NLA_STATS_MSG_LEN_P1, s->msg_length_profile[1]},
2040 {TIPC_NLA_STATS_MSG_LEN_P2, s->msg_length_profile[2]},
2041 {TIPC_NLA_STATS_MSG_LEN_P3, s->msg_length_profile[3]},
2042 {TIPC_NLA_STATS_MSG_LEN_P4, s->msg_length_profile[4]},
2043 {TIPC_NLA_STATS_MSG_LEN_P5, s->msg_length_profile[5]},
2044 {TIPC_NLA_STATS_MSG_LEN_P6, s->msg_length_profile[6]},
2045 {TIPC_NLA_STATS_RX_STATES, s->recv_states},
2046 {TIPC_NLA_STATS_RX_PROBES, s->recv_probes},
2047 {TIPC_NLA_STATS_RX_NACKS, s->recv_nacks},
2048 {TIPC_NLA_STATS_RX_DEFERRED, s->deferred_recv},
2049 {TIPC_NLA_STATS_TX_STATES, s->sent_states},
2050 {TIPC_NLA_STATS_TX_PROBES, s->sent_probes},
2051 {TIPC_NLA_STATS_TX_NACKS, s->sent_nacks},
2052 {TIPC_NLA_STATS_TX_ACKS, s->sent_acks},
2053 {TIPC_NLA_STATS_RETRANSMITTED, s->retransmitted},
2054 {TIPC_NLA_STATS_DUPLICATES, s->duplicates},
2055 {TIPC_NLA_STATS_LINK_CONGS, s->link_congs},
2056 {TIPC_NLA_STATS_MAX_QUEUE, s->max_queue_sz},
2057 {TIPC_NLA_STATS_AVG_QUEUE, s->queue_sz_counts ?
2058 (s->accu_queue_sz / s->queue_sz_counts) : 0}
2061 stats = nla_nest_start(skb, TIPC_NLA_LINK_STATS);
2065 for (i = 0; i < ARRAY_SIZE(map); i++)
2066 if (nla_put_u32(skb, map[i].key, map[i].val))
2069 nla_nest_end(skb, stats);
2073 nla_nest_cancel(skb, stats);
2078 /* Caller should hold appropriate locks to protect the link */
2079 int __tipc_nl_add_link(struct net *net, struct tipc_nl_msg *msg,
2080 struct tipc_link *link, int nlflags)
2082 u32 self = tipc_own_addr(net);
2083 struct nlattr *attrs;
2084 struct nlattr *prop;
2088 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2089 nlflags, TIPC_NL_LINK_GET);
2093 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK);
2097 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, link->name))
2099 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_DEST, tipc_cluster_mask(self)))
2101 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_MTU, link->mtu))
2103 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, link->stats.recv_pkts))
2105 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, link->stats.sent_pkts))
2108 if (tipc_link_is_up(link))
2109 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
2112 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_ACTIVE))
2115 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP);
2118 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
2120 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_TOL, link->tolerance))
2122 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN,
2125 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
2127 nla_nest_end(msg->skb, prop);
2129 err = __tipc_nl_add_stats(msg->skb, &link->stats);
2133 nla_nest_end(msg->skb, attrs);
2134 genlmsg_end(msg->skb, hdr);
2139 nla_nest_cancel(msg->skb, prop);
2141 nla_nest_cancel(msg->skb, attrs);
2143 genlmsg_cancel(msg->skb, hdr);
2148 static int __tipc_nl_add_bc_link_stat(struct sk_buff *skb,
2149 struct tipc_stats *stats)
2152 struct nlattr *nest;
2159 struct nla_map map[] = {
2160 {TIPC_NLA_STATS_RX_INFO, stats->recv_pkts},
2161 {TIPC_NLA_STATS_RX_FRAGMENTS, stats->recv_fragments},
2162 {TIPC_NLA_STATS_RX_FRAGMENTED, stats->recv_fragmented},
2163 {TIPC_NLA_STATS_RX_BUNDLES, stats->recv_bundles},
2164 {TIPC_NLA_STATS_RX_BUNDLED, stats->recv_bundled},
2165 {TIPC_NLA_STATS_TX_INFO, stats->sent_pkts},
2166 {TIPC_NLA_STATS_TX_FRAGMENTS, stats->sent_fragments},
2167 {TIPC_NLA_STATS_TX_FRAGMENTED, stats->sent_fragmented},
2168 {TIPC_NLA_STATS_TX_BUNDLES, stats->sent_bundles},
2169 {TIPC_NLA_STATS_TX_BUNDLED, stats->sent_bundled},
2170 {TIPC_NLA_STATS_RX_NACKS, stats->recv_nacks},
2171 {TIPC_NLA_STATS_RX_DEFERRED, stats->deferred_recv},
2172 {TIPC_NLA_STATS_TX_NACKS, stats->sent_nacks},
2173 {TIPC_NLA_STATS_TX_ACKS, stats->sent_acks},
2174 {TIPC_NLA_STATS_RETRANSMITTED, stats->retransmitted},
2175 {TIPC_NLA_STATS_DUPLICATES, stats->duplicates},
2176 {TIPC_NLA_STATS_LINK_CONGS, stats->link_congs},
2177 {TIPC_NLA_STATS_MAX_QUEUE, stats->max_queue_sz},
2178 {TIPC_NLA_STATS_AVG_QUEUE, stats->queue_sz_counts ?
2179 (stats->accu_queue_sz / stats->queue_sz_counts) : 0}
2182 nest = nla_nest_start(skb, TIPC_NLA_LINK_STATS);
2186 for (i = 0; i < ARRAY_SIZE(map); i++)
2187 if (nla_put_u32(skb, map[i].key, map[i].val))
2190 nla_nest_end(skb, nest);
2194 nla_nest_cancel(skb, nest);
2199 int tipc_nl_add_bc_link(struct net *net, struct tipc_nl_msg *msg)
2203 struct nlattr *attrs;
2204 struct nlattr *prop;
2205 struct tipc_net *tn = net_generic(net, tipc_net_id);
2206 struct tipc_link *bcl = tn->bcl;
2211 tipc_bcast_lock(net);
2213 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2214 NLM_F_MULTI, TIPC_NL_LINK_GET);
2216 tipc_bcast_unlock(net);
2220 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK);
2224 /* The broadcast link is always up */
2225 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
2228 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_BROADCAST))
2230 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, bcl->name))
2232 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, 0))
2234 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, 0))
2237 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP);
2240 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, bcl->window))
2242 nla_nest_end(msg->skb, prop);
2244 err = __tipc_nl_add_bc_link_stat(msg->skb, &bcl->stats);
2248 tipc_bcast_unlock(net);
2249 nla_nest_end(msg->skb, attrs);
2250 genlmsg_end(msg->skb, hdr);
2255 nla_nest_cancel(msg->skb, prop);
2257 nla_nest_cancel(msg->skb, attrs);
2259 tipc_bcast_unlock(net);
2260 genlmsg_cancel(msg->skb, hdr);
2265 void tipc_link_set_tolerance(struct tipc_link *l, u32 tol,
2266 struct sk_buff_head *xmitq)
2270 l->bc_rcvlink->tolerance = tol;
2272 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, tol, 0, xmitq);
2275 void tipc_link_set_prio(struct tipc_link *l, u32 prio,
2276 struct sk_buff_head *xmitq)
2279 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, prio, xmitq);
2282 void tipc_link_set_abort_limit(struct tipc_link *l, u32 limit)
2284 l->abort_limit = limit;