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"
48 #include <linux/pkt_sched.h>
69 u32 link_congs
; /* # port sends blocked by congestion */
72 u32 max_queue_sz
; /* send queue size high water mark */
73 u32 accu_queue_sz
; /* used for send queue size profiling */
74 u32 queue_sz_counts
; /* used for send queue size profiling */
75 u32 msg_length_counts
; /* used for message length profiling */
76 u32 msg_lengths_total
; /* used for message length profiling */
77 u32 msg_length_profile
[7]; /* used for msg. length profiling */
81 * struct tipc_link - TIPC link data structure
82 * @addr: network address of link's peer node
83 * @name: link name character string
84 * @media_addr: media address to use when sending messages over link
86 * @net: pointer to namespace struct
87 * @refcnt: reference counter for permanent references (owner node & timer)
88 * @peer_session: link session # being used by peer end of link
89 * @peer_bearer_id: bearer id used by link's peer endpoint
90 * @bearer_id: local bearer id used by link
91 * @tolerance: minimum link continuity loss needed to reset link [in ms]
92 * @abort_limit: # of unacknowledged continuity probes needed to reset link
93 * @state: current state of link FSM
94 * @peer_caps: bitmap describing capabilities of peer node
95 * @silent_intv_cnt: # of timer intervals without any reception from peer
96 * @proto_msg: template for control messages generated by link
97 * @pmsg: convenience pointer to "proto_msg" field
98 * @priority: current link priority
99 * @net_plane: current link network plane ('A' through 'H')
100 * @mon_state: cookie with information needed by link monitor
101 * @backlog_limit: backlog queue congestion thresholds (indexed by importance)
102 * @exp_msg_count: # of tunnelled messages expected during link changeover
103 * @reset_rcv_checkpt: seq # of last acknowledged message at time of link reset
104 * @mtu: current maximum packet size for this link
105 * @advertised_mtu: advertised own mtu when link is being established
106 * @transmitq: queue for sent, non-acked messages
107 * @backlogq: queue for messages waiting to be sent
108 * @snt_nxt: next sequence number to use for outbound messages
109 * @prev_from: sequence number of most previous retransmission request
110 * @stale_cnt: counter for number of identical retransmit attempts
111 * @stale_limit: time when repeated identical retransmits must force link reset
112 * @ackers: # of peers that needs to ack each packet before it can be released
113 * @acked: # last packet acked by a certain peer. Used for broadcast.
114 * @rcv_nxt: next sequence number to expect for inbound messages
115 * @deferred_queue: deferred queue saved OOS b'cast message received from node
116 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer
117 * @inputq: buffer queue for messages to be delivered upwards
118 * @namedq: buffer queue for name table messages to be delivered upwards
119 * @next_out: ptr to first unsent outbound message in queue
120 * @wakeupq: linked list of wakeup msgs waiting for link congestion to abate
121 * @long_msg_seq_no: next identifier to use for outbound fragmented messages
122 * @reasm_buf: head of partially reassembled inbound message fragments
123 * @bc_rcvr: marks that this is a broadcast receiver link
124 * @stats: collects statistics regarding link activity
128 char name
[TIPC_MAX_LINK_NAME
];
131 /* Management and link supervision data */
145 char if_name
[TIPC_MAX_IF_NAME
];
148 struct tipc_mon_state mon_state
;
153 struct sk_buff
*failover_reasm_skb
;
155 /* Max packet negotiation */
160 struct sk_buff_head transmq
;
161 struct sk_buff_head backlogq
;
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
;
194 struct tipc_stats stats
;
198 * Error message prefixes
200 static const char *link_co_err
= "Link tunneling error, ";
201 static const char *link_rst_msg
= "Resetting link ";
203 /* Send states for broadcast NACKs
206 BC_NACK_SND_CONDITIONAL
,
207 BC_NACK_SND_UNCONDITIONAL
,
208 BC_NACK_SND_SUPPRESS
,
211 #define TIPC_BC_RETR_LIM msecs_to_jiffies(10) /* [ms] */
214 * Interval between NACKs when packets arrive out of order
216 #define TIPC_NACK_INTV (TIPC_MIN_LINK_WIN * 2)
221 LINK_ESTABLISHED
= 0xe,
222 LINK_ESTABLISHING
= 0xe << 4,
223 LINK_RESET
= 0x1 << 8,
224 LINK_RESETTING
= 0x2 << 12,
225 LINK_PEER_RESET
= 0xd << 16,
226 LINK_FAILINGOVER
= 0xf << 20,
227 LINK_SYNCHING
= 0xc << 24
230 /* Link FSM state checking routines
232 static int link_is_up(struct tipc_link
*l
)
234 return l
->state
& (LINK_ESTABLISHED
| LINK_SYNCHING
);
237 static int tipc_link_proto_rcv(struct tipc_link
*l
, struct sk_buff
*skb
,
238 struct sk_buff_head
*xmitq
);
239 static void tipc_link_build_proto_msg(struct tipc_link
*l
, int mtyp
, bool probe
,
240 bool probe_reply
, u16 rcvgap
,
241 int tolerance
, int priority
,
242 struct sk_buff_head
*xmitq
);
243 static void link_print(struct tipc_link
*l
, const char *str
);
244 static int tipc_link_build_nack_msg(struct tipc_link
*l
,
245 struct sk_buff_head
*xmitq
);
246 static void tipc_link_build_bc_init_msg(struct tipc_link
*l
,
247 struct sk_buff_head
*xmitq
);
248 static bool tipc_link_release_pkts(struct tipc_link
*l
, u16 to
);
251 * Simple non-static link routines (i.e. referenced outside this file)
253 bool tipc_link_is_up(struct tipc_link
*l
)
255 return link_is_up(l
);
258 bool tipc_link_peer_is_down(struct tipc_link
*l
)
260 return l
->state
== LINK_PEER_RESET
;
263 bool tipc_link_is_reset(struct tipc_link
*l
)
265 return l
->state
& (LINK_RESET
| LINK_FAILINGOVER
| LINK_ESTABLISHING
);
268 bool tipc_link_is_establishing(struct tipc_link
*l
)
270 return l
->state
== LINK_ESTABLISHING
;
273 bool tipc_link_is_synching(struct tipc_link
*l
)
275 return l
->state
== LINK_SYNCHING
;
278 bool tipc_link_is_failingover(struct tipc_link
*l
)
280 return l
->state
== LINK_FAILINGOVER
;
283 bool tipc_link_is_blocked(struct tipc_link
*l
)
285 return l
->state
& (LINK_RESETTING
| LINK_PEER_RESET
| LINK_FAILINGOVER
);
288 static bool link_is_bc_sndlink(struct tipc_link
*l
)
290 return !l
->bc_sndlink
;
293 static bool link_is_bc_rcvlink(struct tipc_link
*l
)
295 return ((l
->bc_rcvlink
== l
) && !link_is_bc_sndlink(l
));
298 void tipc_link_set_active(struct tipc_link
*l
, bool active
)
303 u32
tipc_link_id(struct tipc_link
*l
)
305 return l
->peer_bearer_id
<< 16 | l
->bearer_id
;
308 int tipc_link_window(struct tipc_link
*l
)
313 int tipc_link_prio(struct tipc_link
*l
)
318 unsigned long tipc_link_tolerance(struct tipc_link
*l
)
323 struct sk_buff_head
*tipc_link_inputq(struct tipc_link
*l
)
328 char tipc_link_plane(struct tipc_link
*l
)
333 void tipc_link_update_caps(struct tipc_link
*l
, u16 capabilities
)
335 l
->peer_caps
= capabilities
;
338 void tipc_link_add_bc_peer(struct tipc_link
*snd_l
,
339 struct tipc_link
*uc_l
,
340 struct sk_buff_head
*xmitq
)
342 struct tipc_link
*rcv_l
= uc_l
->bc_rcvlink
;
345 rcv_l
->acked
= snd_l
->snd_nxt
- 1;
346 snd_l
->state
= LINK_ESTABLISHED
;
347 tipc_link_build_bc_init_msg(uc_l
, xmitq
);
350 void tipc_link_remove_bc_peer(struct tipc_link
*snd_l
,
351 struct tipc_link
*rcv_l
,
352 struct sk_buff_head
*xmitq
)
354 u16 ack
= snd_l
->snd_nxt
- 1;
357 rcv_l
->bc_peer_is_up
= true;
358 rcv_l
->state
= LINK_ESTABLISHED
;
359 tipc_link_bc_ack_rcv(rcv_l
, ack
, xmitq
);
360 trace_tipc_link_reset(rcv_l
, TIPC_DUMP_ALL
, "bclink removed!");
361 tipc_link_reset(rcv_l
);
362 rcv_l
->state
= LINK_RESET
;
363 if (!snd_l
->ackers
) {
364 trace_tipc_link_reset(snd_l
, TIPC_DUMP_ALL
, "zero ackers!");
365 tipc_link_reset(snd_l
);
366 snd_l
->state
= LINK_RESET
;
367 __skb_queue_purge(xmitq
);
371 int tipc_link_bc_peers(struct tipc_link
*l
)
376 static u16
link_bc_rcv_gap(struct tipc_link
*l
)
378 struct sk_buff
*skb
= skb_peek(&l
->deferdq
);
381 if (more(l
->snd_nxt
, l
->rcv_nxt
))
382 gap
= l
->snd_nxt
- l
->rcv_nxt
;
384 gap
= buf_seqno(skb
) - l
->rcv_nxt
;
388 void tipc_link_set_mtu(struct tipc_link
*l
, int mtu
)
393 int tipc_link_mtu(struct tipc_link
*l
)
398 u16
tipc_link_rcv_nxt(struct tipc_link
*l
)
403 u16
tipc_link_acked(struct tipc_link
*l
)
408 char *tipc_link_name(struct tipc_link
*l
)
413 u32
tipc_link_state(struct tipc_link
*l
)
419 * tipc_link_create - create a new link
420 * @n: pointer to associated node
421 * @if_name: associated interface name
422 * @bearer_id: id (index) of associated bearer
423 * @tolerance: link tolerance to be used by link
424 * @net_plane: network plane (A,B,c..) this link belongs to
425 * @mtu: mtu to be advertised by link
426 * @priority: priority to be used by link
427 * @window: send window to be used by link
428 * @session: session to be used by link
429 * @ownnode: identity of own node
430 * @peer: node id of peer node
431 * @peer_caps: bitmap describing peer node capabilities
432 * @bc_sndlink: the namespace global link used for broadcast sending
433 * @bc_rcvlink: the peer specific link used for broadcast reception
434 * @inputq: queue to put messages ready for delivery
435 * @namedq: queue to put binding table update messages ready for delivery
436 * @link: return value, pointer to put the created link
438 * Returns true if link was created, otherwise false
440 bool tipc_link_create(struct net
*net
, char *if_name
, int bearer_id
,
441 int tolerance
, char net_plane
, u32 mtu
, int priority
,
442 int window
, u32 session
, u32 self
,
443 u32 peer
, u8
*peer_id
, u16 peer_caps
,
444 struct tipc_link
*bc_sndlink
,
445 struct tipc_link
*bc_rcvlink
,
446 struct sk_buff_head
*inputq
,
447 struct sk_buff_head
*namedq
,
448 struct tipc_link
**link
)
450 char peer_str
[NODE_ID_STR_LEN
] = {0,};
451 char self_str
[NODE_ID_STR_LEN
] = {0,};
454 l
= kzalloc(sizeof(*l
), GFP_ATOMIC
);
458 l
->session
= session
;
460 /* Set link name for unicast links only */
462 tipc_nodeid2string(self_str
, tipc_own_id(net
));
463 if (strlen(self_str
) > 16)
464 sprintf(self_str
, "%x", self
);
465 tipc_nodeid2string(peer_str
, peer_id
);
466 if (strlen(peer_str
) > 16)
467 sprintf(peer_str
, "%x", peer
);
469 /* Peer i/f name will be completed by reset/activate message */
470 snprintf(l
->name
, sizeof(l
->name
), "%s:%s-%s:unknown",
471 self_str
, if_name
, peer_str
);
473 strcpy(l
->if_name
, if_name
);
475 l
->peer_caps
= peer_caps
;
477 l
->in_session
= false;
478 l
->bearer_id
= bearer_id
;
479 l
->tolerance
= tolerance
;
481 bc_rcvlink
->tolerance
= tolerance
;
482 l
->net_plane
= net_plane
;
483 l
->advertised_mtu
= mtu
;
485 l
->priority
= priority
;
486 tipc_link_set_queue_limits(l
, window
);
488 l
->bc_sndlink
= bc_sndlink
;
489 l
->bc_rcvlink
= bc_rcvlink
;
492 l
->state
= LINK_RESETTING
;
493 __skb_queue_head_init(&l
->transmq
);
494 __skb_queue_head_init(&l
->backlogq
);
495 __skb_queue_head_init(&l
->deferdq
);
496 skb_queue_head_init(&l
->wakeupq
);
497 skb_queue_head_init(l
->inputq
);
502 * tipc_link_bc_create - create new link to be used for broadcast
503 * @n: pointer to associated node
504 * @mtu: mtu to be used initially if no peers
505 * @window: send window to be used
506 * @inputq: queue to put messages ready for delivery
507 * @namedq: queue to put binding table update messages ready for delivery
508 * @link: return value, pointer to put the created link
510 * Returns true if link was created, otherwise false
512 bool tipc_link_bc_create(struct net
*net
, u32 ownnode
, u32 peer
,
513 int mtu
, int window
, u16 peer_caps
,
514 struct sk_buff_head
*inputq
,
515 struct sk_buff_head
*namedq
,
516 struct tipc_link
*bc_sndlink
,
517 struct tipc_link
**link
)
521 if (!tipc_link_create(net
, "", MAX_BEARERS
, 0, 'Z', mtu
, 0, window
,
522 0, ownnode
, peer
, NULL
, peer_caps
, bc_sndlink
,
523 NULL
, inputq
, namedq
, link
))
527 strcpy(l
->name
, tipc_bclink_name
);
528 trace_tipc_link_reset(l
, TIPC_DUMP_ALL
, "bclink created!");
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
)
553 int old_state
= l
->state
;
558 case LINK_PEER_RESET_EVT
:
559 l
->state
= LINK_PEER_RESET
;
562 l
->state
= LINK_RESET
;
564 case LINK_FAILURE_EVT
:
565 case LINK_FAILOVER_BEGIN_EVT
:
566 case LINK_ESTABLISH_EVT
:
567 case LINK_FAILOVER_END_EVT
:
568 case LINK_SYNCH_BEGIN_EVT
:
569 case LINK_SYNCH_END_EVT
:
576 case LINK_PEER_RESET_EVT
:
577 l
->state
= LINK_ESTABLISHING
;
579 case LINK_FAILOVER_BEGIN_EVT
:
580 l
->state
= LINK_FAILINGOVER
;
581 case LINK_FAILURE_EVT
:
583 case LINK_ESTABLISH_EVT
:
584 case LINK_FAILOVER_END_EVT
:
586 case LINK_SYNCH_BEGIN_EVT
:
587 case LINK_SYNCH_END_EVT
:
592 case LINK_PEER_RESET
:
595 l
->state
= LINK_ESTABLISHING
;
597 case LINK_PEER_RESET_EVT
:
598 case LINK_ESTABLISH_EVT
:
599 case LINK_FAILURE_EVT
:
601 case LINK_SYNCH_BEGIN_EVT
:
602 case LINK_SYNCH_END_EVT
:
603 case LINK_FAILOVER_BEGIN_EVT
:
604 case LINK_FAILOVER_END_EVT
:
609 case LINK_FAILINGOVER
:
611 case LINK_FAILOVER_END_EVT
:
612 l
->state
= LINK_RESET
;
614 case LINK_PEER_RESET_EVT
:
616 case LINK_ESTABLISH_EVT
:
617 case LINK_FAILURE_EVT
:
619 case LINK_FAILOVER_BEGIN_EVT
:
620 case LINK_SYNCH_BEGIN_EVT
:
621 case LINK_SYNCH_END_EVT
:
626 case LINK_ESTABLISHING
:
628 case LINK_ESTABLISH_EVT
:
629 l
->state
= LINK_ESTABLISHED
;
631 case LINK_FAILOVER_BEGIN_EVT
:
632 l
->state
= LINK_FAILINGOVER
;
635 l
->state
= LINK_RESET
;
637 case LINK_FAILURE_EVT
:
638 case LINK_PEER_RESET_EVT
:
639 case LINK_SYNCH_BEGIN_EVT
:
640 case LINK_FAILOVER_END_EVT
:
642 case LINK_SYNCH_END_EVT
:
647 case LINK_ESTABLISHED
:
649 case LINK_PEER_RESET_EVT
:
650 l
->state
= LINK_PEER_RESET
;
651 rc
|= TIPC_LINK_DOWN_EVT
;
653 case LINK_FAILURE_EVT
:
654 l
->state
= LINK_RESETTING
;
655 rc
|= TIPC_LINK_DOWN_EVT
;
658 l
->state
= LINK_RESET
;
660 case LINK_ESTABLISH_EVT
:
661 case LINK_SYNCH_END_EVT
:
663 case LINK_SYNCH_BEGIN_EVT
:
664 l
->state
= LINK_SYNCHING
;
666 case LINK_FAILOVER_BEGIN_EVT
:
667 case LINK_FAILOVER_END_EVT
:
674 case LINK_PEER_RESET_EVT
:
675 l
->state
= LINK_PEER_RESET
;
676 rc
|= TIPC_LINK_DOWN_EVT
;
678 case LINK_FAILURE_EVT
:
679 l
->state
= LINK_RESETTING
;
680 rc
|= TIPC_LINK_DOWN_EVT
;
683 l
->state
= LINK_RESET
;
685 case LINK_ESTABLISH_EVT
:
686 case LINK_SYNCH_BEGIN_EVT
:
688 case LINK_SYNCH_END_EVT
:
689 l
->state
= LINK_ESTABLISHED
;
691 case LINK_FAILOVER_BEGIN_EVT
:
692 case LINK_FAILOVER_END_EVT
:
698 pr_err("Unknown FSM state %x in %s\n", l
->state
, l
->name
);
700 trace_tipc_link_fsm(l
->name
, old_state
, l
->state
, evt
);
703 pr_err("Illegal FSM event %x in state %x on link %s\n",
704 evt
, l
->state
, l
->name
);
705 trace_tipc_link_fsm(l
->name
, old_state
, l
->state
, evt
);
709 /* link_profile_stats - update statistical profiling of traffic
711 static void link_profile_stats(struct tipc_link
*l
)
714 struct tipc_msg
*msg
;
717 /* Update counters used in statistical profiling of send traffic */
718 l
->stats
.accu_queue_sz
+= skb_queue_len(&l
->transmq
);
719 l
->stats
.queue_sz_counts
++;
721 skb
= skb_peek(&l
->transmq
);
725 length
= msg_size(msg
);
727 if (msg_user(msg
) == MSG_FRAGMENTER
) {
728 if (msg_type(msg
) != FIRST_FRAGMENT
)
730 length
= msg_size(msg_get_wrapped(msg
));
732 l
->stats
.msg_lengths_total
+= length
;
733 l
->stats
.msg_length_counts
++;
735 l
->stats
.msg_length_profile
[0]++;
736 else if (length
<= 256)
737 l
->stats
.msg_length_profile
[1]++;
738 else if (length
<= 1024)
739 l
->stats
.msg_length_profile
[2]++;
740 else if (length
<= 4096)
741 l
->stats
.msg_length_profile
[3]++;
742 else if (length
<= 16384)
743 l
->stats
.msg_length_profile
[4]++;
744 else if (length
<= 32768)
745 l
->stats
.msg_length_profile
[5]++;
747 l
->stats
.msg_length_profile
[6]++;
751 * tipc_link_too_silent - check if link is "too silent"
752 * @l: tipc link to be checked
754 * Returns true if the link 'silent_intv_cnt' is about to reach the
755 * 'abort_limit' value, otherwise false
757 bool tipc_link_too_silent(struct tipc_link
*l
)
759 return (l
->silent_intv_cnt
+ 2 > l
->abort_limit
);
762 /* tipc_link_timeout - perform periodic task as instructed from node timeout
764 int tipc_link_timeout(struct tipc_link
*l
, struct sk_buff_head
*xmitq
)
771 u16 bc_snt
= l
->bc_sndlink
->snd_nxt
- 1;
772 u16 bc_acked
= l
->bc_rcvlink
->acked
;
773 struct tipc_mon_state
*mstate
= &l
->mon_state
;
775 trace_tipc_link_timeout(l
, TIPC_DUMP_NONE
, " ");
776 trace_tipc_link_too_silent(l
, TIPC_DUMP_ALL
, " ");
778 case LINK_ESTABLISHED
:
781 link_profile_stats(l
);
782 tipc_mon_get_state(l
->net
, l
->addr
, mstate
, l
->bearer_id
);
783 if (mstate
->reset
|| (l
->silent_intv_cnt
> l
->abort_limit
))
784 return tipc_link_fsm_evt(l
, LINK_FAILURE_EVT
);
785 state
= bc_acked
!= bc_snt
;
786 state
|= l
->bc_rcvlink
->rcv_unacked
;
787 state
|= l
->rcv_unacked
;
788 state
|= !skb_queue_empty(&l
->transmq
);
789 state
|= !skb_queue_empty(&l
->deferdq
);
790 probe
= mstate
->probing
;
791 probe
|= l
->silent_intv_cnt
;
792 if (probe
|| mstate
->monitoring
)
793 l
->silent_intv_cnt
++;
796 setup
= l
->rst_cnt
++ <= 4;
797 setup
|= !(l
->rst_cnt
% 16);
800 case LINK_ESTABLISHING
:
804 case LINK_PEER_RESET
:
806 case LINK_FAILINGOVER
:
812 if (state
|| probe
|| setup
)
813 tipc_link_build_proto_msg(l
, mtyp
, probe
, 0, 0, 0, 0, xmitq
);
819 * link_schedule_user - schedule a message sender for wakeup after congestion
821 * @hdr: header of message that is being sent
822 * Create pseudo msg to send back to user when congestion abates
824 static int link_schedule_user(struct tipc_link
*l
, struct tipc_msg
*hdr
)
826 u32 dnode
= tipc_own_addr(l
->net
);
827 u32 dport
= msg_origport(hdr
);
830 /* Create and schedule wakeup pseudo message */
831 skb
= tipc_msg_create(SOCK_WAKEUP
, 0, INT_H_SIZE
, 0,
832 dnode
, l
->addr
, dport
, 0, 0);
835 msg_set_dest_droppable(buf_msg(skb
), true);
836 TIPC_SKB_CB(skb
)->chain_imp
= msg_importance(hdr
);
837 skb_queue_tail(&l
->wakeupq
, skb
);
838 l
->stats
.link_congs
++;
839 trace_tipc_link_conges(l
, TIPC_DUMP_ALL
, "wakeup scheduled!");
844 * link_prepare_wakeup - prepare users for wakeup after congestion
846 * Wake up a number of waiting users, as permitted by available space
849 static void link_prepare_wakeup(struct tipc_link
*l
)
851 struct sk_buff
*skb
, *tmp
;
854 skb_queue_walk_safe(&l
->wakeupq
, skb
, tmp
) {
855 imp
= TIPC_SKB_CB(skb
)->chain_imp
;
856 if (l
->backlog
[imp
].len
< l
->backlog
[imp
].limit
) {
857 skb_unlink(skb
, &l
->wakeupq
);
858 skb_queue_tail(l
->inputq
, skb
);
859 } else if (i
++ > 10) {
865 void tipc_link_reset(struct tipc_link
*l
)
867 struct sk_buff_head list
;
869 __skb_queue_head_init(&list
);
871 l
->in_session
= false;
873 l
->mtu
= l
->advertised_mtu
;
875 spin_lock_bh(&l
->wakeupq
.lock
);
876 skb_queue_splice_init(&l
->wakeupq
, &list
);
877 spin_unlock_bh(&l
->wakeupq
.lock
);
879 spin_lock_bh(&l
->inputq
->lock
);
880 skb_queue_splice_init(&list
, l
->inputq
);
881 spin_unlock_bh(&l
->inputq
->lock
);
883 __skb_queue_purge(&l
->transmq
);
884 __skb_queue_purge(&l
->deferdq
);
885 __skb_queue_purge(&l
->backlogq
);
886 l
->backlog
[TIPC_LOW_IMPORTANCE
].len
= 0;
887 l
->backlog
[TIPC_MEDIUM_IMPORTANCE
].len
= 0;
888 l
->backlog
[TIPC_HIGH_IMPORTANCE
].len
= 0;
889 l
->backlog
[TIPC_CRITICAL_IMPORTANCE
].len
= 0;
890 l
->backlog
[TIPC_SYSTEM_IMPORTANCE
].len
= 0;
891 kfree_skb(l
->reasm_buf
);
892 kfree_skb(l
->failover_reasm_skb
);
894 l
->failover_reasm_skb
= NULL
;
898 l
->snd_nxt_state
= 1;
899 l
->rcv_nxt_state
= 1;
901 l
->silent_intv_cnt
= 0;
904 l
->bc_peer_is_up
= false;
905 memset(&l
->mon_state
, 0, sizeof(l
->mon_state
));
906 tipc_link_reset_stats(l
);
910 * tipc_link_xmit(): enqueue buffer list according to queue situation
912 * @list: chain of buffers containing message
913 * @xmitq: returned list of packets to be sent by caller
915 * Consumes the buffer chain.
916 * Returns 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS
917 * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted
919 int tipc_link_xmit(struct tipc_link
*l
, struct sk_buff_head
*list
,
920 struct sk_buff_head
*xmitq
)
922 struct tipc_msg
*hdr
= buf_msg(skb_peek(list
));
923 unsigned int maxwin
= l
->window
;
924 int imp
= msg_importance(hdr
);
925 unsigned int mtu
= l
->mtu
;
926 u16 ack
= l
->rcv_nxt
- 1;
927 u16 seqno
= l
->snd_nxt
;
928 u16 bc_ack
= l
->bc_rcvlink
->rcv_nxt
- 1;
929 struct sk_buff_head
*transmq
= &l
->transmq
;
930 struct sk_buff_head
*backlogq
= &l
->backlogq
;
931 struct sk_buff
*skb
, *_skb
, *bskb
;
932 int pkt_cnt
= skb_queue_len(list
);
935 if (unlikely(msg_size(hdr
) > mtu
)) {
936 skb_queue_purge(list
);
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 /* next retransmit attempt */
971 if (link_is_bc_sndlink(l
))
972 TIPC_SKB_CB(skb
)->nxt_retr
=
973 jiffies
+ TIPC_BC_RETR_LIM
;
974 __skb_queue_tail(xmitq
, _skb
);
975 TIPC_SKB_CB(skb
)->ackers
= l
->ackers
;
977 l
->stats
.sent_pkts
++;
981 if (tipc_msg_bundle(skb_peek_tail(backlogq
), hdr
, mtu
)) {
982 kfree_skb(__skb_dequeue(list
));
983 l
->stats
.sent_bundled
++;
986 if (tipc_msg_make_bundle(&bskb
, hdr
, mtu
, l
->addr
)) {
987 kfree_skb(__skb_dequeue(list
));
988 __skb_queue_tail(backlogq
, bskb
);
989 l
->backlog
[msg_importance(buf_msg(bskb
))].len
++;
990 l
->stats
.sent_bundled
++;
991 l
->stats
.sent_bundles
++;
994 l
->backlog
[imp
].len
+= skb_queue_len(list
);
995 skb_queue_splice_tail_init(list
, backlogq
);
1001 static void tipc_link_advance_backlog(struct tipc_link
*l
,
1002 struct sk_buff_head
*xmitq
)
1004 struct sk_buff
*skb
, *_skb
;
1005 struct tipc_msg
*hdr
;
1006 u16 seqno
= l
->snd_nxt
;
1007 u16 ack
= l
->rcv_nxt
- 1;
1008 u16 bc_ack
= l
->bc_rcvlink
->rcv_nxt
- 1;
1010 while (skb_queue_len(&l
->transmq
) < l
->window
) {
1011 skb
= skb_peek(&l
->backlogq
);
1014 _skb
= skb_clone(skb
, GFP_ATOMIC
);
1017 __skb_dequeue(&l
->backlogq
);
1019 l
->backlog
[msg_importance(hdr
)].len
--;
1020 __skb_queue_tail(&l
->transmq
, skb
);
1021 /* next retransmit attempt */
1022 if (link_is_bc_sndlink(l
))
1023 TIPC_SKB_CB(skb
)->nxt_retr
= jiffies
+ TIPC_BC_RETR_LIM
;
1025 __skb_queue_tail(xmitq
, _skb
);
1026 TIPC_SKB_CB(skb
)->ackers
= l
->ackers
;
1027 msg_set_seqno(hdr
, seqno
);
1028 msg_set_ack(hdr
, ack
);
1029 msg_set_bcast_ack(hdr
, bc_ack
);
1031 l
->stats
.sent_pkts
++;
1037 static void link_retransmit_failure(struct tipc_link
*l
, struct sk_buff
*skb
)
1039 struct tipc_msg
*hdr
= buf_msg(skb
);
1041 pr_warn("Retransmission failure on link <%s>\n", l
->name
);
1042 link_print(l
, "State of link ");
1043 pr_info("Failed msg: usr %u, typ %u, len %u, err %u\n",
1044 msg_user(hdr
), msg_type(hdr
), msg_size(hdr
), msg_errcode(hdr
));
1045 pr_info("sqno %u, prev: %x, src: %x\n",
1046 msg_seqno(hdr
), msg_prevnode(hdr
), msg_orignode(hdr
));
1049 /* tipc_link_retrans() - retransmit one or more packets
1050 * @l: the link to transmit on
1051 * @r: the receiving link ordering the retransmit. Same as l if unicast
1052 * @from: retransmit from (inclusive) this sequence number
1053 * @to: retransmit to (inclusive) this sequence number
1054 * xmitq: queue for accumulating the retransmitted packets
1056 static int tipc_link_retrans(struct tipc_link
*l
, struct tipc_link
*r
,
1057 u16 from
, u16 to
, struct sk_buff_head
*xmitq
)
1059 struct sk_buff
*_skb
, *skb
= skb_peek(&l
->transmq
);
1060 u16 bc_ack
= l
->bc_rcvlink
->rcv_nxt
- 1;
1061 u16 ack
= l
->rcv_nxt
- 1;
1062 struct tipc_msg
*hdr
;
1069 trace_tipc_link_retrans(r
, from
, to
, &l
->transmq
);
1070 /* Detect repeated retransmit failures on same packet */
1071 if (r
->prev_from
!= from
) {
1072 r
->prev_from
= from
;
1073 r
->stale_limit
= jiffies
+ msecs_to_jiffies(r
->tolerance
);
1075 } else if (++r
->stale_cnt
> 99 && time_after(jiffies
, r
->stale_limit
)) {
1076 link_retransmit_failure(l
, skb
);
1077 trace_tipc_list_dump(&l
->transmq
, true, "retrans failure!");
1078 trace_tipc_link_dump(l
, TIPC_DUMP_NONE
, "retrans failure!");
1079 trace_tipc_link_dump(r
, TIPC_DUMP_NONE
, "retrans failure!");
1080 if (link_is_bc_sndlink(l
))
1081 return TIPC_LINK_DOWN_EVT
;
1082 return tipc_link_fsm_evt(l
, LINK_FAILURE_EVT
);
1085 skb_queue_walk(&l
->transmq
, skb
) {
1087 if (less(msg_seqno(hdr
), from
))
1089 if (more(msg_seqno(hdr
), to
))
1091 if (link_is_bc_sndlink(l
)) {
1092 if (time_before(jiffies
, TIPC_SKB_CB(skb
)->nxt_retr
))
1094 TIPC_SKB_CB(skb
)->nxt_retr
= jiffies
+ TIPC_BC_RETR_LIM
;
1096 _skb
= __pskb_copy(skb
, MIN_H_SIZE
, GFP_ATOMIC
);
1099 hdr
= buf_msg(_skb
);
1100 msg_set_ack(hdr
, ack
);
1101 msg_set_bcast_ack(hdr
, bc_ack
);
1102 _skb
->priority
= TC_PRIO_CONTROL
;
1103 __skb_queue_tail(xmitq
, _skb
);
1104 l
->stats
.retransmitted
++;
1109 /* tipc_data_input - deliver data and name distr msgs to upper layer
1111 * Consumes buffer if message is of right type
1112 * Node lock must be held
1114 static bool tipc_data_input(struct tipc_link
*l
, struct sk_buff
*skb
,
1115 struct sk_buff_head
*inputq
)
1117 struct sk_buff_head
*mc_inputq
= l
->bc_rcvlink
->inputq
;
1118 struct tipc_msg
*hdr
= buf_msg(skb
);
1120 switch (msg_user(hdr
)) {
1121 case TIPC_LOW_IMPORTANCE
:
1122 case TIPC_MEDIUM_IMPORTANCE
:
1123 case TIPC_HIGH_IMPORTANCE
:
1124 case TIPC_CRITICAL_IMPORTANCE
:
1125 if (unlikely(msg_in_group(hdr
) || msg_mcast(hdr
))) {
1126 skb_queue_tail(mc_inputq
, skb
);
1131 skb_queue_tail(inputq
, skb
);
1133 case GROUP_PROTOCOL
:
1134 skb_queue_tail(mc_inputq
, skb
);
1136 case NAME_DISTRIBUTOR
:
1137 l
->bc_rcvlink
->state
= LINK_ESTABLISHED
;
1138 skb_queue_tail(l
->namedq
, skb
);
1141 case TUNNEL_PROTOCOL
:
1142 case MSG_FRAGMENTER
:
1143 case BCAST_PROTOCOL
:
1146 pr_warn("Dropping received illegal msg type\n");
1152 /* tipc_link_input - process packet that has passed link protocol check
1156 static int tipc_link_input(struct tipc_link
*l
, struct sk_buff
*skb
,
1157 struct sk_buff_head
*inputq
)
1159 struct tipc_msg
*hdr
= buf_msg(skb
);
1160 struct sk_buff
**reasm_skb
= &l
->reasm_buf
;
1161 struct sk_buff
*iskb
;
1162 struct sk_buff_head tmpq
;
1163 int usr
= msg_user(hdr
);
1168 if (unlikely(usr
== TUNNEL_PROTOCOL
)) {
1169 if (msg_type(hdr
) == SYNCH_MSG
) {
1170 __skb_queue_purge(&l
->deferdq
);
1173 if (!tipc_msg_extract(skb
, &iskb
, &ipos
))
1178 if (less(msg_seqno(hdr
), l
->drop_point
))
1180 if (tipc_data_input(l
, skb
, inputq
))
1182 usr
= msg_user(hdr
);
1183 reasm_skb
= &l
->failover_reasm_skb
;
1186 if (usr
== MSG_BUNDLER
) {
1187 skb_queue_head_init(&tmpq
);
1188 l
->stats
.recv_bundles
++;
1189 l
->stats
.recv_bundled
+= msg_msgcnt(hdr
);
1190 while (tipc_msg_extract(skb
, &iskb
, &pos
))
1191 tipc_data_input(l
, iskb
, &tmpq
);
1192 tipc_skb_queue_splice_tail(&tmpq
, inputq
);
1194 } else if (usr
== MSG_FRAGMENTER
) {
1195 l
->stats
.recv_fragments
++;
1196 if (tipc_buf_append(reasm_skb
, &skb
)) {
1197 l
->stats
.recv_fragmented
++;
1198 tipc_data_input(l
, skb
, inputq
);
1199 } else if (!*reasm_skb
&& !link_is_bc_rcvlink(l
)) {
1200 pr_warn_ratelimited("Unable to build fragment list\n");
1201 return tipc_link_fsm_evt(l
, LINK_FAILURE_EVT
);
1204 } else if (usr
== BCAST_PROTOCOL
) {
1205 tipc_bcast_lock(l
->net
);
1206 tipc_link_bc_init_rcv(l
->bc_rcvlink
, hdr
);
1207 tipc_bcast_unlock(l
->net
);
1214 static bool tipc_link_release_pkts(struct tipc_link
*l
, u16 acked
)
1216 bool released
= false;
1217 struct sk_buff
*skb
, *tmp
;
1219 skb_queue_walk_safe(&l
->transmq
, skb
, tmp
) {
1220 if (more(buf_seqno(skb
), acked
))
1222 __skb_unlink(skb
, &l
->transmq
);
1229 /* tipc_link_build_state_msg: prepare link state message for transmission
1231 * Note that sending of broadcast ack is coordinated among nodes, to reduce
1232 * risk of ack storms towards the sender
1234 int tipc_link_build_state_msg(struct tipc_link
*l
, struct sk_buff_head
*xmitq
)
1239 /* Broadcast ACK must be sent via a unicast link => defer to caller */
1240 if (link_is_bc_rcvlink(l
)) {
1241 if (((l
->rcv_nxt
^ tipc_own_addr(l
->net
)) & 0xf) != 0xf)
1245 /* Use snd_nxt to store peer's snd_nxt in broadcast rcv link */
1246 l
->snd_nxt
= l
->rcv_nxt
;
1247 return TIPC_LINK_SND_STATE
;
1252 l
->stats
.sent_acks
++;
1253 tipc_link_build_proto_msg(l
, STATE_MSG
, 0, 0, 0, 0, 0, xmitq
);
1257 /* tipc_link_build_reset_msg: prepare link RESET or ACTIVATE message
1259 void tipc_link_build_reset_msg(struct tipc_link
*l
, struct sk_buff_head
*xmitq
)
1261 int mtyp
= RESET_MSG
;
1262 struct sk_buff
*skb
;
1264 if (l
->state
== LINK_ESTABLISHING
)
1265 mtyp
= ACTIVATE_MSG
;
1267 tipc_link_build_proto_msg(l
, mtyp
, 0, 0, 0, 0, 0, xmitq
);
1269 /* Inform peer that this endpoint is going down if applicable */
1270 skb
= skb_peek_tail(xmitq
);
1271 if (skb
&& (l
->state
== LINK_RESET
))
1272 msg_set_peer_stopping(buf_msg(skb
), 1);
1275 /* tipc_link_build_nack_msg: prepare link nack message for transmission
1276 * Note that sending of broadcast NACK is coordinated among nodes, to
1277 * reduce the risk of NACK storms towards the sender
1279 static int tipc_link_build_nack_msg(struct tipc_link
*l
,
1280 struct sk_buff_head
*xmitq
)
1282 u32 def_cnt
= ++l
->stats
.deferred_recv
;
1285 if (link_is_bc_rcvlink(l
)) {
1286 match1
= def_cnt
& 0xf;
1287 match2
= tipc_own_addr(l
->net
) & 0xf;
1288 if (match1
== match2
)
1289 return TIPC_LINK_SND_STATE
;
1293 if ((skb_queue_len(&l
->deferdq
) == 1) || !(def_cnt
% TIPC_NACK_INTV
))
1294 tipc_link_build_proto_msg(l
, STATE_MSG
, 0, 0, 0, 0, 0, xmitq
);
1298 /* tipc_link_rcv - process TIPC packets/messages arriving from off-node
1299 * @l: the link that should handle the message
1301 * @xmitq: queue to place packets to be sent after this call
1303 int tipc_link_rcv(struct tipc_link
*l
, struct sk_buff
*skb
,
1304 struct sk_buff_head
*xmitq
)
1306 struct sk_buff_head
*defq
= &l
->deferdq
;
1307 struct tipc_msg
*hdr
;
1308 u16 seqno
, rcv_nxt
, win_lim
;
1313 seqno
= msg_seqno(hdr
);
1314 rcv_nxt
= l
->rcv_nxt
;
1315 win_lim
= rcv_nxt
+ TIPC_MAX_LINK_WIN
;
1317 /* Verify and update link state */
1318 if (unlikely(msg_user(hdr
) == LINK_PROTOCOL
))
1319 return tipc_link_proto_rcv(l
, skb
, xmitq
);
1321 if (unlikely(!link_is_up(l
))) {
1322 if (l
->state
== LINK_ESTABLISHING
)
1323 rc
= TIPC_LINK_UP_EVT
;
1327 /* Don't send probe at next timeout expiration */
1328 l
->silent_intv_cnt
= 0;
1330 /* Drop if outside receive window */
1331 if (unlikely(less(seqno
, rcv_nxt
) || more(seqno
, win_lim
))) {
1332 l
->stats
.duplicates
++;
1336 /* Forward queues and wake up waiting users */
1337 if (likely(tipc_link_release_pkts(l
, msg_ack(hdr
)))) {
1339 tipc_link_advance_backlog(l
, xmitq
);
1340 if (unlikely(!skb_queue_empty(&l
->wakeupq
)))
1341 link_prepare_wakeup(l
);
1344 /* Defer delivery if sequence gap */
1345 if (unlikely(seqno
!= rcv_nxt
)) {
1346 __tipc_skb_queue_sorted(defq
, seqno
, skb
);
1347 rc
|= tipc_link_build_nack_msg(l
, xmitq
);
1351 /* Deliver packet */
1353 l
->stats
.recv_pkts
++;
1354 if (!tipc_data_input(l
, skb
, l
->inputq
))
1355 rc
|= tipc_link_input(l
, skb
, l
->inputq
);
1356 if (unlikely(++l
->rcv_unacked
>= TIPC_MIN_LINK_WIN
))
1357 rc
|= tipc_link_build_state_msg(l
, xmitq
);
1358 if (unlikely(rc
& ~TIPC_LINK_SND_STATE
))
1360 } while ((skb
= __skb_dequeue(defq
)));
1368 static void tipc_link_build_proto_msg(struct tipc_link
*l
, int mtyp
, bool probe
,
1369 bool probe_reply
, u16 rcvgap
,
1370 int tolerance
, int priority
,
1371 struct sk_buff_head
*xmitq
)
1373 struct tipc_link
*bcl
= l
->bc_rcvlink
;
1374 struct sk_buff
*skb
;
1375 struct tipc_msg
*hdr
;
1376 struct sk_buff_head
*dfq
= &l
->deferdq
;
1377 bool node_up
= link_is_up(bcl
);
1378 struct tipc_mon_state
*mstate
= &l
->mon_state
;
1382 /* Don't send protocol message during reset or link failover */
1383 if (tipc_link_is_blocked(l
))
1386 if (!tipc_link_is_up(l
) && (mtyp
== STATE_MSG
))
1389 if (!skb_queue_empty(dfq
))
1390 rcvgap
= buf_seqno(skb_peek(dfq
)) - l
->rcv_nxt
;
1392 skb
= tipc_msg_create(LINK_PROTOCOL
, mtyp
, INT_H_SIZE
,
1393 tipc_max_domain_size
, l
->addr
,
1394 tipc_own_addr(l
->net
), 0, 0, 0);
1399 data
= msg_data(hdr
);
1400 msg_set_session(hdr
, l
->session
);
1401 msg_set_bearer_id(hdr
, l
->bearer_id
);
1402 msg_set_net_plane(hdr
, l
->net_plane
);
1403 msg_set_next_sent(hdr
, l
->snd_nxt
);
1404 msg_set_ack(hdr
, l
->rcv_nxt
- 1);
1405 msg_set_bcast_ack(hdr
, bcl
->rcv_nxt
- 1);
1406 msg_set_bc_ack_invalid(hdr
, !node_up
);
1407 msg_set_last_bcast(hdr
, l
->bc_sndlink
->snd_nxt
- 1);
1408 msg_set_link_tolerance(hdr
, tolerance
);
1409 msg_set_linkprio(hdr
, priority
);
1410 msg_set_redundant_link(hdr
, node_up
);
1411 msg_set_seq_gap(hdr
, 0);
1412 msg_set_seqno(hdr
, l
->snd_nxt
+ U16_MAX
/ 2);
1414 if (mtyp
== STATE_MSG
) {
1415 if (l
->peer_caps
& TIPC_LINK_PROTO_SEQNO
)
1416 msg_set_seqno(hdr
, l
->snd_nxt_state
++);
1417 msg_set_seq_gap(hdr
, rcvgap
);
1418 msg_set_bc_gap(hdr
, link_bc_rcv_gap(bcl
));
1419 msg_set_probe(hdr
, probe
);
1420 msg_set_is_keepalive(hdr
, probe
|| probe_reply
);
1421 tipc_mon_prep(l
->net
, data
, &dlen
, mstate
, l
->bearer_id
);
1422 msg_set_size(hdr
, INT_H_SIZE
+ dlen
);
1423 skb_trim(skb
, INT_H_SIZE
+ dlen
);
1424 l
->stats
.sent_states
++;
1427 /* RESET_MSG or ACTIVATE_MSG */
1428 if (mtyp
== ACTIVATE_MSG
) {
1429 msg_set_dest_session_valid(hdr
, 1);
1430 msg_set_dest_session(hdr
, l
->peer_session
);
1432 msg_set_max_pkt(hdr
, l
->advertised_mtu
);
1433 strcpy(data
, l
->if_name
);
1434 msg_set_size(hdr
, INT_H_SIZE
+ TIPC_MAX_IF_NAME
);
1435 skb_trim(skb
, INT_H_SIZE
+ TIPC_MAX_IF_NAME
);
1438 l
->stats
.sent_probes
++;
1440 l
->stats
.sent_nacks
++;
1441 skb
->priority
= TC_PRIO_CONTROL
;
1442 __skb_queue_tail(xmitq
, skb
);
1443 trace_tipc_proto_build(skb
, false, l
->name
);
1446 void tipc_link_create_dummy_tnl_msg(struct tipc_link
*l
,
1447 struct sk_buff_head
*xmitq
)
1449 u32 onode
= tipc_own_addr(l
->net
);
1450 struct tipc_msg
*hdr
, *ihdr
;
1451 struct sk_buff_head tnlq
;
1452 struct sk_buff
*skb
;
1453 u32 dnode
= l
->addr
;
1455 skb_queue_head_init(&tnlq
);
1456 skb
= tipc_msg_create(TUNNEL_PROTOCOL
, FAILOVER_MSG
,
1457 INT_H_SIZE
, BASIC_H_SIZE
,
1458 dnode
, onode
, 0, 0, 0);
1460 pr_warn("%sunable to create tunnel packet\n", link_co_err
);
1465 msg_set_msgcnt(hdr
, 1);
1466 msg_set_bearer_id(hdr
, l
->peer_bearer_id
);
1468 ihdr
= (struct tipc_msg
*)msg_data(hdr
);
1469 tipc_msg_init(onode
, ihdr
, TIPC_LOW_IMPORTANCE
, TIPC_DIRECT_MSG
,
1470 BASIC_H_SIZE
, dnode
);
1471 msg_set_errcode(ihdr
, TIPC_ERR_NO_PORT
);
1472 __skb_queue_tail(&tnlq
, skb
);
1473 tipc_link_xmit(l
, &tnlq
, xmitq
);
1476 /* tipc_link_tnl_prepare(): prepare and return a list of tunnel packets
1477 * with contents of the link's transmit and backlog queues.
1479 void tipc_link_tnl_prepare(struct tipc_link
*l
, struct tipc_link
*tnl
,
1480 int mtyp
, struct sk_buff_head
*xmitq
)
1482 struct sk_buff
*skb
, *tnlskb
;
1483 struct tipc_msg
*hdr
, tnlhdr
;
1484 struct sk_buff_head
*queue
= &l
->transmq
;
1485 struct sk_buff_head tmpxq
, tnlq
;
1486 u16 pktlen
, pktcnt
, seqno
= l
->snd_nxt
;
1491 skb_queue_head_init(&tnlq
);
1492 skb_queue_head_init(&tmpxq
);
1494 /* At least one packet required for safe algorithm => add dummy */
1495 skb
= tipc_msg_create(TIPC_LOW_IMPORTANCE
, TIPC_DIRECT_MSG
,
1496 BASIC_H_SIZE
, 0, l
->addr
, tipc_own_addr(l
->net
),
1497 0, 0, TIPC_ERR_NO_PORT
);
1499 pr_warn("%sunable to create tunnel packet\n", link_co_err
);
1502 skb_queue_tail(&tnlq
, skb
);
1503 tipc_link_xmit(l
, &tnlq
, &tmpxq
);
1504 __skb_queue_purge(&tmpxq
);
1506 /* Initialize reusable tunnel packet header */
1507 tipc_msg_init(tipc_own_addr(l
->net
), &tnlhdr
, TUNNEL_PROTOCOL
,
1508 mtyp
, INT_H_SIZE
, l
->addr
);
1509 pktcnt
= skb_queue_len(&l
->transmq
) + skb_queue_len(&l
->backlogq
);
1510 msg_set_msgcnt(&tnlhdr
, pktcnt
);
1511 msg_set_bearer_id(&tnlhdr
, l
->peer_bearer_id
);
1513 /* Wrap each packet into a tunnel packet */
1514 skb_queue_walk(queue
, skb
) {
1516 if (queue
== &l
->backlogq
)
1517 msg_set_seqno(hdr
, seqno
++);
1518 pktlen
= msg_size(hdr
);
1519 msg_set_size(&tnlhdr
, pktlen
+ INT_H_SIZE
);
1520 tnlskb
= tipc_buf_acquire(pktlen
+ INT_H_SIZE
, GFP_ATOMIC
);
1522 pr_warn("%sunable to send packet\n", link_co_err
);
1525 skb_copy_to_linear_data(tnlskb
, &tnlhdr
, INT_H_SIZE
);
1526 skb_copy_to_linear_data_offset(tnlskb
, INT_H_SIZE
, hdr
, pktlen
);
1527 __skb_queue_tail(&tnlq
, tnlskb
);
1529 if (queue
!= &l
->backlogq
) {
1530 queue
= &l
->backlogq
;
1534 tipc_link_xmit(tnl
, &tnlq
, xmitq
);
1536 if (mtyp
== FAILOVER_MSG
) {
1537 tnl
->drop_point
= l
->rcv_nxt
;
1538 tnl
->failover_reasm_skb
= l
->reasm_buf
;
1539 l
->reasm_buf
= NULL
;
1543 /* tipc_link_validate_msg(): validate message against current link state
1544 * Returns true if message should be accepted, otherwise false
1546 bool tipc_link_validate_msg(struct tipc_link
*l
, struct tipc_msg
*hdr
)
1548 u16 curr_session
= l
->peer_session
;
1549 u16 session
= msg_session(hdr
);
1550 int mtyp
= msg_type(hdr
);
1552 if (msg_user(hdr
) != LINK_PROTOCOL
)
1559 /* Accept only RESET with new session number */
1560 return more(session
, curr_session
);
1564 /* Accept only ACTIVATE with new or current session number */
1565 return !less(session
, curr_session
);
1567 /* Accept only STATE with current session number */
1570 if (session
!= curr_session
)
1572 /* Extra sanity check */
1573 if (!link_is_up(l
) && msg_ack(hdr
))
1575 if (!(l
->peer_caps
& TIPC_LINK_PROTO_SEQNO
))
1577 /* Accept only STATE with new sequence number */
1578 return !less(msg_seqno(hdr
), l
->rcv_nxt_state
);
1584 /* tipc_link_proto_rcv(): receive link level protocol message :
1585 * Note that network plane id propagates through the network, and may
1586 * change at any time. The node with lowest numerical id determines
1589 static int tipc_link_proto_rcv(struct tipc_link
*l
, struct sk_buff
*skb
,
1590 struct sk_buff_head
*xmitq
)
1592 struct tipc_msg
*hdr
= buf_msg(skb
);
1594 u16 ack
= msg_ack(hdr
);
1595 u16 gap
= msg_seq_gap(hdr
);
1596 u16 peers_snd_nxt
= msg_next_sent(hdr
);
1597 u16 peers_tol
= msg_link_tolerance(hdr
);
1598 u16 peers_prio
= msg_linkprio(hdr
);
1599 u16 rcv_nxt
= l
->rcv_nxt
;
1600 u16 dlen
= msg_data_sz(hdr
);
1601 int mtyp
= msg_type(hdr
);
1602 bool reply
= msg_probe(hdr
);
1607 trace_tipc_proto_rcv(skb
, false, l
->name
);
1608 if (tipc_link_is_blocked(l
) || !xmitq
)
1611 if (tipc_own_addr(l
->net
) > msg_prevnode(hdr
))
1612 l
->net_plane
= msg_net_plane(hdr
);
1616 data
= msg_data(hdr
);
1618 if (!tipc_link_validate_msg(l
, hdr
)) {
1619 trace_tipc_skb_dump(skb
, false, "PROTO invalid (1)!");
1620 trace_tipc_link_dump(l
, TIPC_DUMP_NONE
, "PROTO invalid (1)!");
1627 /* Complete own link name with peer's interface name */
1628 if_name
= strrchr(l
->name
, ':') + 1;
1629 if (sizeof(l
->name
) - (if_name
- l
->name
) <= TIPC_MAX_IF_NAME
)
1631 if (msg_data_sz(hdr
) < TIPC_MAX_IF_NAME
)
1633 strncpy(if_name
, data
, TIPC_MAX_IF_NAME
);
1635 /* Update own tolerance if peer indicates a non-zero value */
1636 if (in_range(peers_tol
, TIPC_MIN_LINK_TOL
, TIPC_MAX_LINK_TOL
)) {
1637 l
->tolerance
= peers_tol
;
1638 l
->bc_rcvlink
->tolerance
= peers_tol
;
1640 /* Update own priority if peer's priority is higher */
1641 if (in_range(peers_prio
, l
->priority
+ 1, TIPC_MAX_LINK_PRI
))
1642 l
->priority
= peers_prio
;
1644 /* If peer is going down we want full re-establish cycle */
1645 if (msg_peer_stopping(hdr
)) {
1646 rc
= tipc_link_fsm_evt(l
, LINK_FAILURE_EVT
);
1650 /* If this endpoint was re-created while peer was ESTABLISHING
1651 * it doesn't know current session number. Force re-synch.
1653 if (mtyp
== ACTIVATE_MSG
&& msg_dest_session_valid(hdr
) &&
1654 l
->session
!= msg_dest_session(hdr
)) {
1655 if (less(l
->session
, msg_dest_session(hdr
)))
1656 l
->session
= msg_dest_session(hdr
) + 1;
1660 /* ACTIVATE_MSG serves as PEER_RESET if link is already down */
1661 if (mtyp
== RESET_MSG
|| !link_is_up(l
))
1662 rc
= tipc_link_fsm_evt(l
, LINK_PEER_RESET_EVT
);
1664 /* ACTIVATE_MSG takes up link if it was already locally reset */
1665 if (mtyp
== ACTIVATE_MSG
&& l
->state
== LINK_ESTABLISHING
)
1666 rc
= TIPC_LINK_UP_EVT
;
1668 l
->peer_session
= msg_session(hdr
);
1669 l
->in_session
= true;
1670 l
->peer_bearer_id
= msg_bearer_id(hdr
);
1671 if (l
->mtu
> msg_max_pkt(hdr
))
1672 l
->mtu
= msg_max_pkt(hdr
);
1676 l
->rcv_nxt_state
= msg_seqno(hdr
) + 1;
1678 /* Update own tolerance if peer indicates a non-zero value */
1679 if (in_range(peers_tol
, TIPC_MIN_LINK_TOL
, TIPC_MAX_LINK_TOL
)) {
1680 l
->tolerance
= peers_tol
;
1681 l
->bc_rcvlink
->tolerance
= peers_tol
;
1683 /* Update own prio if peer indicates a different value */
1684 if ((peers_prio
!= l
->priority
) &&
1685 in_range(peers_prio
, 1, TIPC_MAX_LINK_PRI
)) {
1686 l
->priority
= peers_prio
;
1687 rc
= tipc_link_fsm_evt(l
, LINK_FAILURE_EVT
);
1690 l
->silent_intv_cnt
= 0;
1691 l
->stats
.recv_states
++;
1693 l
->stats
.recv_probes
++;
1695 if (!link_is_up(l
)) {
1696 if (l
->state
== LINK_ESTABLISHING
)
1697 rc
= TIPC_LINK_UP_EVT
;
1700 tipc_mon_rcv(l
->net
, data
, dlen
, l
->addr
,
1701 &l
->mon_state
, l
->bearer_id
);
1703 /* Send NACK if peer has sent pkts we haven't received yet */
1704 if (more(peers_snd_nxt
, rcv_nxt
) && !tipc_link_is_synching(l
))
1705 rcvgap
= peers_snd_nxt
- l
->rcv_nxt
;
1706 if (rcvgap
|| reply
)
1707 tipc_link_build_proto_msg(l
, STATE_MSG
, 0, reply
,
1708 rcvgap
, 0, 0, xmitq
);
1709 tipc_link_release_pkts(l
, ack
);
1711 /* If NACK, retransmit will now start at right position */
1713 rc
= tipc_link_retrans(l
, l
, ack
+ 1, ack
+ gap
, xmitq
);
1714 l
->stats
.recv_nacks
++;
1717 tipc_link_advance_backlog(l
, xmitq
);
1718 if (unlikely(!skb_queue_empty(&l
->wakeupq
)))
1719 link_prepare_wakeup(l
);
1726 /* tipc_link_build_bc_proto_msg() - create broadcast protocol message
1728 static bool tipc_link_build_bc_proto_msg(struct tipc_link
*l
, bool bcast
,
1730 struct sk_buff_head
*xmitq
)
1732 struct sk_buff
*skb
;
1733 struct tipc_msg
*hdr
;
1734 struct sk_buff
*dfrd_skb
= skb_peek(&l
->deferdq
);
1735 u16 ack
= l
->rcv_nxt
- 1;
1736 u16 gap_to
= peers_snd_nxt
- 1;
1738 skb
= tipc_msg_create(BCAST_PROTOCOL
, STATE_MSG
, INT_H_SIZE
,
1739 0, l
->addr
, tipc_own_addr(l
->net
), 0, 0, 0);
1743 msg_set_last_bcast(hdr
, l
->bc_sndlink
->snd_nxt
- 1);
1744 msg_set_bcast_ack(hdr
, ack
);
1745 msg_set_bcgap_after(hdr
, ack
);
1747 gap_to
= buf_seqno(dfrd_skb
) - 1;
1748 msg_set_bcgap_to(hdr
, gap_to
);
1749 msg_set_non_seq(hdr
, bcast
);
1750 __skb_queue_tail(xmitq
, skb
);
1754 /* tipc_link_build_bc_init_msg() - synchronize broadcast link endpoints.
1756 * Give a newly added peer node the sequence number where it should
1757 * start receiving and acking broadcast packets.
1759 static void tipc_link_build_bc_init_msg(struct tipc_link
*l
,
1760 struct sk_buff_head
*xmitq
)
1762 struct sk_buff_head list
;
1764 __skb_queue_head_init(&list
);
1765 if (!tipc_link_build_bc_proto_msg(l
->bc_rcvlink
, false, 0, &list
))
1767 msg_set_bc_ack_invalid(buf_msg(skb_peek(&list
)), true);
1768 tipc_link_xmit(l
, &list
, xmitq
);
1771 /* tipc_link_bc_init_rcv - receive initial broadcast synch data from peer
1773 void tipc_link_bc_init_rcv(struct tipc_link
*l
, struct tipc_msg
*hdr
)
1775 int mtyp
= msg_type(hdr
);
1776 u16 peers_snd_nxt
= msg_bc_snd_nxt(hdr
);
1781 if (msg_user(hdr
) == BCAST_PROTOCOL
) {
1782 l
->rcv_nxt
= peers_snd_nxt
;
1783 l
->state
= LINK_ESTABLISHED
;
1787 if (l
->peer_caps
& TIPC_BCAST_SYNCH
)
1790 if (msg_peer_node_is_up(hdr
))
1793 /* Compatibility: accept older, less safe initial synch data */
1794 if ((mtyp
== RESET_MSG
) || (mtyp
== ACTIVATE_MSG
))
1795 l
->rcv_nxt
= peers_snd_nxt
;
1798 /* tipc_link_bc_sync_rcv - update rcv link according to peer's send state
1800 int tipc_link_bc_sync_rcv(struct tipc_link
*l
, struct tipc_msg
*hdr
,
1801 struct sk_buff_head
*xmitq
)
1803 struct tipc_link
*snd_l
= l
->bc_sndlink
;
1804 u16 peers_snd_nxt
= msg_bc_snd_nxt(hdr
);
1805 u16 from
= msg_bcast_ack(hdr
) + 1;
1806 u16 to
= from
+ msg_bc_gap(hdr
) - 1;
1812 if (!msg_peer_node_is_up(hdr
))
1815 /* Open when peer ackowledges our bcast init msg (pkt #1) */
1817 l
->bc_peer_is_up
= true;
1819 if (!l
->bc_peer_is_up
)
1822 l
->stats
.recv_nacks
++;
1824 /* Ignore if peers_snd_nxt goes beyond receive window */
1825 if (more(peers_snd_nxt
, l
->rcv_nxt
+ l
->window
))
1828 rc
= tipc_link_retrans(snd_l
, l
, from
, to
, xmitq
);
1830 l
->snd_nxt
= peers_snd_nxt
;
1831 if (link_bc_rcv_gap(l
))
1832 rc
|= TIPC_LINK_SND_STATE
;
1834 /* Return now if sender supports nack via STATE messages */
1835 if (l
->peer_caps
& TIPC_BCAST_STATE_NACK
)
1838 /* Otherwise, be backwards compatible */
1840 if (!more(peers_snd_nxt
, l
->rcv_nxt
)) {
1841 l
->nack_state
= BC_NACK_SND_CONDITIONAL
;
1845 /* Don't NACK if one was recently sent or peeked */
1846 if (l
->nack_state
== BC_NACK_SND_SUPPRESS
) {
1847 l
->nack_state
= BC_NACK_SND_UNCONDITIONAL
;
1851 /* Conditionally delay NACK sending until next synch rcv */
1852 if (l
->nack_state
== BC_NACK_SND_CONDITIONAL
) {
1853 l
->nack_state
= BC_NACK_SND_UNCONDITIONAL
;
1854 if ((peers_snd_nxt
- l
->rcv_nxt
) < TIPC_MIN_LINK_WIN
)
1858 /* Send NACK now but suppress next one */
1859 tipc_link_build_bc_proto_msg(l
, true, peers_snd_nxt
, xmitq
);
1860 l
->nack_state
= BC_NACK_SND_SUPPRESS
;
1864 void tipc_link_bc_ack_rcv(struct tipc_link
*l
, u16 acked
,
1865 struct sk_buff_head
*xmitq
)
1867 struct sk_buff
*skb
, *tmp
;
1868 struct tipc_link
*snd_l
= l
->bc_sndlink
;
1870 if (!link_is_up(l
) || !l
->bc_peer_is_up
)
1873 if (!more(acked
, l
->acked
))
1876 trace_tipc_link_bc_ack(l
, l
->acked
, acked
, &snd_l
->transmq
);
1877 /* Skip over packets peer has already acked */
1878 skb_queue_walk(&snd_l
->transmq
, skb
) {
1879 if (more(buf_seqno(skb
), l
->acked
))
1883 /* Update/release the packets peer is acking now */
1884 skb_queue_walk_from_safe(&snd_l
->transmq
, skb
, tmp
) {
1885 if (more(buf_seqno(skb
), acked
))
1887 if (!--TIPC_SKB_CB(skb
)->ackers
) {
1888 __skb_unlink(skb
, &snd_l
->transmq
);
1893 tipc_link_advance_backlog(snd_l
, xmitq
);
1894 if (unlikely(!skb_queue_empty(&snd_l
->wakeupq
)))
1895 link_prepare_wakeup(snd_l
);
1898 /* tipc_link_bc_nack_rcv(): receive broadcast nack message
1899 * This function is here for backwards compatibility, since
1900 * no BCAST_PROTOCOL/STATE messages occur from TIPC v2.5.
1902 int tipc_link_bc_nack_rcv(struct tipc_link
*l
, struct sk_buff
*skb
,
1903 struct sk_buff_head
*xmitq
)
1905 struct tipc_msg
*hdr
= buf_msg(skb
);
1906 u32 dnode
= msg_destnode(hdr
);
1907 int mtyp
= msg_type(hdr
);
1908 u16 acked
= msg_bcast_ack(hdr
);
1909 u16 from
= acked
+ 1;
1910 u16 to
= msg_bcgap_to(hdr
);
1911 u16 peers_snd_nxt
= to
+ 1;
1916 if (!tipc_link_is_up(l
) || !l
->bc_peer_is_up
)
1919 if (mtyp
!= STATE_MSG
)
1922 if (dnode
== tipc_own_addr(l
->net
)) {
1923 tipc_link_bc_ack_rcv(l
, acked
, xmitq
);
1924 rc
= tipc_link_retrans(l
->bc_sndlink
, l
, from
, to
, xmitq
);
1925 l
->stats
.recv_nacks
++;
1929 /* Msg for other node => suppress own NACK at next sync if applicable */
1930 if (more(peers_snd_nxt
, l
->rcv_nxt
) && !less(l
->rcv_nxt
, from
))
1931 l
->nack_state
= BC_NACK_SND_SUPPRESS
;
1936 void tipc_link_set_queue_limits(struct tipc_link
*l
, u32 win
)
1938 int max_bulk
= TIPC_MAX_PUBL
/ (l
->mtu
/ ITEM_SIZE
);
1941 l
->backlog
[TIPC_LOW_IMPORTANCE
].limit
= max_t(u16
, 50, win
);
1942 l
->backlog
[TIPC_MEDIUM_IMPORTANCE
].limit
= max_t(u16
, 100, win
* 2);
1943 l
->backlog
[TIPC_HIGH_IMPORTANCE
].limit
= max_t(u16
, 150, win
* 3);
1944 l
->backlog
[TIPC_CRITICAL_IMPORTANCE
].limit
= max_t(u16
, 200, win
* 4);
1945 l
->backlog
[TIPC_SYSTEM_IMPORTANCE
].limit
= max_bulk
;
1949 * link_reset_stats - reset link statistics
1950 * @l: pointer to link
1952 void tipc_link_reset_stats(struct tipc_link
*l
)
1954 memset(&l
->stats
, 0, sizeof(l
->stats
));
1957 static void link_print(struct tipc_link
*l
, const char *str
)
1959 struct sk_buff
*hskb
= skb_peek(&l
->transmq
);
1960 u16 head
= hskb
? msg_seqno(buf_msg(hskb
)) : l
->snd_nxt
- 1;
1961 u16 tail
= l
->snd_nxt
- 1;
1963 pr_info("%s Link <%s> state %x\n", str
, l
->name
, l
->state
);
1964 pr_info("XMTQ: %u [%u-%u], BKLGQ: %u, SNDNX: %u, RCVNX: %u\n",
1965 skb_queue_len(&l
->transmq
), head
, tail
,
1966 skb_queue_len(&l
->backlogq
), l
->snd_nxt
, l
->rcv_nxt
);
1969 /* Parse and validate nested (link) properties valid for media, bearer and link
1971 int tipc_nl_parse_link_prop(struct nlattr
*prop
, struct nlattr
*props
[])
1975 err
= nla_parse_nested(props
, TIPC_NLA_PROP_MAX
, prop
,
1976 tipc_nl_prop_policy
, NULL
);
1980 if (props
[TIPC_NLA_PROP_PRIO
]) {
1983 prio
= nla_get_u32(props
[TIPC_NLA_PROP_PRIO
]);
1984 if (prio
> TIPC_MAX_LINK_PRI
)
1988 if (props
[TIPC_NLA_PROP_TOL
]) {
1991 tol
= nla_get_u32(props
[TIPC_NLA_PROP_TOL
]);
1992 if ((tol
< TIPC_MIN_LINK_TOL
) || (tol
> TIPC_MAX_LINK_TOL
))
1996 if (props
[TIPC_NLA_PROP_WIN
]) {
1999 win
= nla_get_u32(props
[TIPC_NLA_PROP_WIN
]);
2000 if ((win
< TIPC_MIN_LINK_WIN
) || (win
> TIPC_MAX_LINK_WIN
))
2007 static int __tipc_nl_add_stats(struct sk_buff
*skb
, struct tipc_stats
*s
)
2010 struct nlattr
*stats
;
2017 struct nla_map map
[] = {
2018 {TIPC_NLA_STATS_RX_INFO
, 0},
2019 {TIPC_NLA_STATS_RX_FRAGMENTS
, s
->recv_fragments
},
2020 {TIPC_NLA_STATS_RX_FRAGMENTED
, s
->recv_fragmented
},
2021 {TIPC_NLA_STATS_RX_BUNDLES
, s
->recv_bundles
},
2022 {TIPC_NLA_STATS_RX_BUNDLED
, s
->recv_bundled
},
2023 {TIPC_NLA_STATS_TX_INFO
, 0},
2024 {TIPC_NLA_STATS_TX_FRAGMENTS
, s
->sent_fragments
},
2025 {TIPC_NLA_STATS_TX_FRAGMENTED
, s
->sent_fragmented
},
2026 {TIPC_NLA_STATS_TX_BUNDLES
, s
->sent_bundles
},
2027 {TIPC_NLA_STATS_TX_BUNDLED
, s
->sent_bundled
},
2028 {TIPC_NLA_STATS_MSG_PROF_TOT
, (s
->msg_length_counts
) ?
2029 s
->msg_length_counts
: 1},
2030 {TIPC_NLA_STATS_MSG_LEN_CNT
, s
->msg_length_counts
},
2031 {TIPC_NLA_STATS_MSG_LEN_TOT
, s
->msg_lengths_total
},
2032 {TIPC_NLA_STATS_MSG_LEN_P0
, s
->msg_length_profile
[0]},
2033 {TIPC_NLA_STATS_MSG_LEN_P1
, s
->msg_length_profile
[1]},
2034 {TIPC_NLA_STATS_MSG_LEN_P2
, s
->msg_length_profile
[2]},
2035 {TIPC_NLA_STATS_MSG_LEN_P3
, s
->msg_length_profile
[3]},
2036 {TIPC_NLA_STATS_MSG_LEN_P4
, s
->msg_length_profile
[4]},
2037 {TIPC_NLA_STATS_MSG_LEN_P5
, s
->msg_length_profile
[5]},
2038 {TIPC_NLA_STATS_MSG_LEN_P6
, s
->msg_length_profile
[6]},
2039 {TIPC_NLA_STATS_RX_STATES
, s
->recv_states
},
2040 {TIPC_NLA_STATS_RX_PROBES
, s
->recv_probes
},
2041 {TIPC_NLA_STATS_RX_NACKS
, s
->recv_nacks
},
2042 {TIPC_NLA_STATS_RX_DEFERRED
, s
->deferred_recv
},
2043 {TIPC_NLA_STATS_TX_STATES
, s
->sent_states
},
2044 {TIPC_NLA_STATS_TX_PROBES
, s
->sent_probes
},
2045 {TIPC_NLA_STATS_TX_NACKS
, s
->sent_nacks
},
2046 {TIPC_NLA_STATS_TX_ACKS
, s
->sent_acks
},
2047 {TIPC_NLA_STATS_RETRANSMITTED
, s
->retransmitted
},
2048 {TIPC_NLA_STATS_DUPLICATES
, s
->duplicates
},
2049 {TIPC_NLA_STATS_LINK_CONGS
, s
->link_congs
},
2050 {TIPC_NLA_STATS_MAX_QUEUE
, s
->max_queue_sz
},
2051 {TIPC_NLA_STATS_AVG_QUEUE
, s
->queue_sz_counts
?
2052 (s
->accu_queue_sz
/ s
->queue_sz_counts
) : 0}
2055 stats
= nla_nest_start(skb
, TIPC_NLA_LINK_STATS
);
2059 for (i
= 0; i
< ARRAY_SIZE(map
); i
++)
2060 if (nla_put_u32(skb
, map
[i
].key
, map
[i
].val
))
2063 nla_nest_end(skb
, stats
);
2067 nla_nest_cancel(skb
, stats
);
2072 /* Caller should hold appropriate locks to protect the link */
2073 int __tipc_nl_add_link(struct net
*net
, struct tipc_nl_msg
*msg
,
2074 struct tipc_link
*link
, int nlflags
)
2076 u32 self
= tipc_own_addr(net
);
2077 struct nlattr
*attrs
;
2078 struct nlattr
*prop
;
2082 hdr
= genlmsg_put(msg
->skb
, msg
->portid
, msg
->seq
, &tipc_genl_family
,
2083 nlflags
, TIPC_NL_LINK_GET
);
2087 attrs
= nla_nest_start(msg
->skb
, TIPC_NLA_LINK
);
2091 if (nla_put_string(msg
->skb
, TIPC_NLA_LINK_NAME
, link
->name
))
2093 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_DEST
, tipc_cluster_mask(self
)))
2095 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_MTU
, link
->mtu
))
2097 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_RX
, link
->stats
.recv_pkts
))
2099 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_TX
, link
->stats
.sent_pkts
))
2102 if (tipc_link_is_up(link
))
2103 if (nla_put_flag(msg
->skb
, TIPC_NLA_LINK_UP
))
2106 if (nla_put_flag(msg
->skb
, TIPC_NLA_LINK_ACTIVE
))
2109 prop
= nla_nest_start(msg
->skb
, TIPC_NLA_LINK_PROP
);
2112 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_PRIO
, link
->priority
))
2114 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_TOL
, link
->tolerance
))
2116 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_WIN
,
2119 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_PRIO
, link
->priority
))
2121 nla_nest_end(msg
->skb
, prop
);
2123 err
= __tipc_nl_add_stats(msg
->skb
, &link
->stats
);
2127 nla_nest_end(msg
->skb
, attrs
);
2128 genlmsg_end(msg
->skb
, hdr
);
2133 nla_nest_cancel(msg
->skb
, prop
);
2135 nla_nest_cancel(msg
->skb
, attrs
);
2137 genlmsg_cancel(msg
->skb
, hdr
);
2142 static int __tipc_nl_add_bc_link_stat(struct sk_buff
*skb
,
2143 struct tipc_stats
*stats
)
2146 struct nlattr
*nest
;
2153 struct nla_map map
[] = {
2154 {TIPC_NLA_STATS_RX_INFO
, stats
->recv_pkts
},
2155 {TIPC_NLA_STATS_RX_FRAGMENTS
, stats
->recv_fragments
},
2156 {TIPC_NLA_STATS_RX_FRAGMENTED
, stats
->recv_fragmented
},
2157 {TIPC_NLA_STATS_RX_BUNDLES
, stats
->recv_bundles
},
2158 {TIPC_NLA_STATS_RX_BUNDLED
, stats
->recv_bundled
},
2159 {TIPC_NLA_STATS_TX_INFO
, stats
->sent_pkts
},
2160 {TIPC_NLA_STATS_TX_FRAGMENTS
, stats
->sent_fragments
},
2161 {TIPC_NLA_STATS_TX_FRAGMENTED
, stats
->sent_fragmented
},
2162 {TIPC_NLA_STATS_TX_BUNDLES
, stats
->sent_bundles
},
2163 {TIPC_NLA_STATS_TX_BUNDLED
, stats
->sent_bundled
},
2164 {TIPC_NLA_STATS_RX_NACKS
, stats
->recv_nacks
},
2165 {TIPC_NLA_STATS_RX_DEFERRED
, stats
->deferred_recv
},
2166 {TIPC_NLA_STATS_TX_NACKS
, stats
->sent_nacks
},
2167 {TIPC_NLA_STATS_TX_ACKS
, stats
->sent_acks
},
2168 {TIPC_NLA_STATS_RETRANSMITTED
, stats
->retransmitted
},
2169 {TIPC_NLA_STATS_DUPLICATES
, stats
->duplicates
},
2170 {TIPC_NLA_STATS_LINK_CONGS
, stats
->link_congs
},
2171 {TIPC_NLA_STATS_MAX_QUEUE
, stats
->max_queue_sz
},
2172 {TIPC_NLA_STATS_AVG_QUEUE
, stats
->queue_sz_counts
?
2173 (stats
->accu_queue_sz
/ stats
->queue_sz_counts
) : 0}
2176 nest
= nla_nest_start(skb
, TIPC_NLA_LINK_STATS
);
2180 for (i
= 0; i
< ARRAY_SIZE(map
); i
++)
2181 if (nla_put_u32(skb
, map
[i
].key
, map
[i
].val
))
2184 nla_nest_end(skb
, nest
);
2188 nla_nest_cancel(skb
, nest
);
2193 int tipc_nl_add_bc_link(struct net
*net
, struct tipc_nl_msg
*msg
)
2197 struct nlattr
*attrs
;
2198 struct nlattr
*prop
;
2199 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
2200 struct tipc_link
*bcl
= tn
->bcl
;
2205 tipc_bcast_lock(net
);
2207 hdr
= genlmsg_put(msg
->skb
, msg
->portid
, msg
->seq
, &tipc_genl_family
,
2208 NLM_F_MULTI
, TIPC_NL_LINK_GET
);
2210 tipc_bcast_unlock(net
);
2214 attrs
= nla_nest_start(msg
->skb
, TIPC_NLA_LINK
);
2218 /* The broadcast link is always up */
2219 if (nla_put_flag(msg
->skb
, TIPC_NLA_LINK_UP
))
2222 if (nla_put_flag(msg
->skb
, TIPC_NLA_LINK_BROADCAST
))
2224 if (nla_put_string(msg
->skb
, TIPC_NLA_LINK_NAME
, bcl
->name
))
2226 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_RX
, 0))
2228 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_TX
, 0))
2231 prop
= nla_nest_start(msg
->skb
, TIPC_NLA_LINK_PROP
);
2234 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_WIN
, bcl
->window
))
2236 nla_nest_end(msg
->skb
, prop
);
2238 err
= __tipc_nl_add_bc_link_stat(msg
->skb
, &bcl
->stats
);
2242 tipc_bcast_unlock(net
);
2243 nla_nest_end(msg
->skb
, attrs
);
2244 genlmsg_end(msg
->skb
, hdr
);
2249 nla_nest_cancel(msg
->skb
, prop
);
2251 nla_nest_cancel(msg
->skb
, attrs
);
2253 tipc_bcast_unlock(net
);
2254 genlmsg_cancel(msg
->skb
, hdr
);
2259 void tipc_link_set_tolerance(struct tipc_link
*l
, u32 tol
,
2260 struct sk_buff_head
*xmitq
)
2264 l
->bc_rcvlink
->tolerance
= tol
;
2266 tipc_link_build_proto_msg(l
, STATE_MSG
, 0, 0, 0, tol
, 0, xmitq
);
2269 void tipc_link_set_prio(struct tipc_link
*l
, u32 prio
,
2270 struct sk_buff_head
*xmitq
)
2273 tipc_link_build_proto_msg(l
, STATE_MSG
, 0, 0, 0, 0, prio
, xmitq
);
2276 void tipc_link_set_abort_limit(struct tipc_link
*l
, u32 limit
)
2278 l
->abort_limit
= limit
;
2281 char *tipc_link_name_ext(struct tipc_link
*l
, char *buf
)
2284 scnprintf(buf
, TIPC_MAX_LINK_NAME
, "null");
2285 else if (link_is_bc_sndlink(l
))
2286 scnprintf(buf
, TIPC_MAX_LINK_NAME
, "broadcast-sender");
2287 else if (link_is_bc_rcvlink(l
))
2288 scnprintf(buf
, TIPC_MAX_LINK_NAME
,
2289 "broadcast-receiver, peer %x", l
->addr
);
2291 memcpy(buf
, l
->name
, TIPC_MAX_LINK_NAME
);
2297 * tipc_link_dump - dump TIPC link data
2298 * @l: tipc link to be dumped
2299 * @dqueues: bitmask to decide if any link queue to be dumped?
2300 * - TIPC_DUMP_NONE: don't dump link queues
2301 * - TIPC_DUMP_TRANSMQ: dump link transmq queue
2302 * - TIPC_DUMP_BACKLOGQ: dump link backlog queue
2303 * - TIPC_DUMP_DEFERDQ: dump link deferd queue
2304 * - TIPC_DUMP_INPUTQ: dump link input queue
2305 * - TIPC_DUMP_WAKEUP: dump link wakeup queue
2306 * - TIPC_DUMP_ALL: dump all the link queues above
2307 * @buf: returned buffer of dump data in format
2309 int tipc_link_dump(struct tipc_link
*l
, u16 dqueues
, char *buf
)
2312 size_t sz
= (dqueues
) ? LINK_LMAX
: LINK_LMIN
;
2313 struct sk_buff_head
*list
;
2314 struct sk_buff
*hskb
, *tskb
;
2318 i
+= scnprintf(buf
, sz
, "link data: (null)\n");
2322 i
+= scnprintf(buf
, sz
, "link data: %x", l
->addr
);
2323 i
+= scnprintf(buf
+ i
, sz
- i
, " %x", l
->state
);
2324 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", l
->in_session
);
2325 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", l
->session
);
2326 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", l
->peer_session
);
2327 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", l
->snd_nxt
);
2328 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", l
->rcv_nxt
);
2329 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", l
->snd_nxt_state
);
2330 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", l
->rcv_nxt_state
);
2331 i
+= scnprintf(buf
+ i
, sz
- i
, " %x", l
->peer_caps
);
2332 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", l
->silent_intv_cnt
);
2333 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", l
->rst_cnt
);
2334 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", l
->prev_from
);
2335 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", l
->stale_cnt
);
2336 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", l
->acked
);
2339 len
= skb_queue_len(list
);
2340 hskb
= skb_peek(list
);
2341 tskb
= skb_peek_tail(list
);
2342 i
+= scnprintf(buf
+ i
, sz
- i
, " | %u %u %u", len
,
2343 (hskb
) ? msg_seqno(buf_msg(hskb
)) : 0,
2344 (tskb
) ? msg_seqno(buf_msg(tskb
)) : 0);
2347 len
= skb_queue_len(list
);
2348 hskb
= skb_peek(list
);
2349 tskb
= skb_peek_tail(list
);
2350 i
+= scnprintf(buf
+ i
, sz
- i
, " | %u %u %u", len
,
2351 (hskb
) ? msg_seqno(buf_msg(hskb
)) : 0,
2352 (tskb
) ? msg_seqno(buf_msg(tskb
)) : 0);
2354 list
= &l
->backlogq
;
2355 len
= skb_queue_len(list
);
2356 hskb
= skb_peek(list
);
2357 tskb
= skb_peek_tail(list
);
2358 i
+= scnprintf(buf
+ i
, sz
- i
, " | %u %u %u", len
,
2359 (hskb
) ? msg_seqno(buf_msg(hskb
)) : 0,
2360 (tskb
) ? msg_seqno(buf_msg(tskb
)) : 0);
2363 len
= skb_queue_len(list
);
2364 hskb
= skb_peek(list
);
2365 tskb
= skb_peek_tail(list
);
2366 i
+= scnprintf(buf
+ i
, sz
- i
, " | %u %u %u\n", len
,
2367 (hskb
) ? msg_seqno(buf_msg(hskb
)) : 0,
2368 (tskb
) ? msg_seqno(buf_msg(tskb
)) : 0);
2370 if (dqueues
& TIPC_DUMP_TRANSMQ
) {
2371 i
+= scnprintf(buf
+ i
, sz
- i
, "transmq: ");
2372 i
+= tipc_list_dump(&l
->transmq
, false, buf
+ i
);
2374 if (dqueues
& TIPC_DUMP_BACKLOGQ
) {
2375 i
+= scnprintf(buf
+ i
, sz
- i
,
2376 "backlogq: <%u %u %u %u %u>, ",
2377 l
->backlog
[TIPC_LOW_IMPORTANCE
].len
,
2378 l
->backlog
[TIPC_MEDIUM_IMPORTANCE
].len
,
2379 l
->backlog
[TIPC_HIGH_IMPORTANCE
].len
,
2380 l
->backlog
[TIPC_CRITICAL_IMPORTANCE
].len
,
2381 l
->backlog
[TIPC_SYSTEM_IMPORTANCE
].len
);
2382 i
+= tipc_list_dump(&l
->backlogq
, false, buf
+ i
);
2384 if (dqueues
& TIPC_DUMP_DEFERDQ
) {
2385 i
+= scnprintf(buf
+ i
, sz
- i
, "deferdq: ");
2386 i
+= tipc_list_dump(&l
->deferdq
, false, buf
+ i
);
2388 if (dqueues
& TIPC_DUMP_INPUTQ
) {
2389 i
+= scnprintf(buf
+ i
, sz
- i
, "inputq: ");
2390 i
+= tipc_list_dump(l
->inputq
, false, buf
+ i
);
2392 if (dqueues
& TIPC_DUMP_WAKEUP
) {
2393 i
+= scnprintf(buf
+ i
, sz
- i
, "wakeup: ");
2394 i
+= tipc_list_dump(&l
->wakeupq
, false, buf
+ i
);