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 * @ackers: # of peers that needs to ack each packet before it can be released
110 * @acked: # last packet acked by a certain peer. Used for broadcast.
111 * @rcv_nxt: next sequence number to expect for inbound messages
112 * @deferred_queue: deferred queue saved OOS b'cast message received from node
113 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer
114 * @inputq: buffer queue for messages to be delivered upwards
115 * @namedq: buffer queue for name table messages to be delivered upwards
116 * @next_out: ptr to first unsent outbound message in queue
117 * @wakeupq: linked list of wakeup msgs waiting for link congestion to abate
118 * @long_msg_seq_no: next identifier to use for outbound fragmented messages
119 * @reasm_buf: head of partially reassembled inbound message fragments
120 * @bc_rcvr: marks that this is a broadcast receiver link
121 * @stats: collects statistics regarding link activity
125 char name[TIPC_MAX_LINK_NAME];
128 /* Management and link supervision data */
142 char if_name[TIPC_MAX_IF_NAME];
145 struct tipc_mon_state mon_state;
150 struct sk_buff *failover_reasm_skb;
151 struct sk_buff_head failover_deferdq;
153 /* Max packet negotiation */
158 struct sk_buff_head transmq;
159 struct sk_buff_head backlogq;
170 struct sk_buff_head deferdq;
171 struct sk_buff_head *inputq;
172 struct sk_buff_head *namedq;
174 /* Congestion handling */
175 struct sk_buff_head wakeupq;
177 /* Fragmentation/reassembly */
178 struct sk_buff *reasm_buf;
183 struct tipc_link *bc_rcvlink;
184 struct tipc_link *bc_sndlink;
189 struct tipc_stats stats;
193 * Error message prefixes
195 static const char *link_co_err = "Link tunneling error, ";
196 static const char *link_rst_msg = "Resetting link ";
198 /* Send states for broadcast NACKs
201 BC_NACK_SND_CONDITIONAL,
202 BC_NACK_SND_UNCONDITIONAL,
203 BC_NACK_SND_SUPPRESS,
206 #define TIPC_BC_RETR_LIM (jiffies + msecs_to_jiffies(10))
207 #define TIPC_UC_RETR_TIME (jiffies + msecs_to_jiffies(1))
210 * Interval between NACKs when packets arrive out of order
212 #define TIPC_NACK_INTV (TIPC_MIN_LINK_WIN * 2)
217 LINK_ESTABLISHED = 0xe,
218 LINK_ESTABLISHING = 0xe << 4,
219 LINK_RESET = 0x1 << 8,
220 LINK_RESETTING = 0x2 << 12,
221 LINK_PEER_RESET = 0xd << 16,
222 LINK_FAILINGOVER = 0xf << 20,
223 LINK_SYNCHING = 0xc << 24
226 /* Link FSM state checking routines
228 static int link_is_up(struct tipc_link *l)
230 return l->state & (LINK_ESTABLISHED | LINK_SYNCHING);
233 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb,
234 struct sk_buff_head *xmitq);
235 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe,
236 bool probe_reply, u16 rcvgap,
237 int tolerance, int priority,
238 struct sk_buff_head *xmitq);
239 static void link_print(struct tipc_link *l, const char *str);
240 static int tipc_link_build_nack_msg(struct tipc_link *l,
241 struct sk_buff_head *xmitq);
242 static void tipc_link_build_bc_init_msg(struct tipc_link *l,
243 struct sk_buff_head *xmitq);
244 static bool tipc_link_release_pkts(struct tipc_link *l, u16 to);
245 static u16 tipc_build_gap_ack_blks(struct tipc_link *l, void *data);
246 static int tipc_link_advance_transmq(struct tipc_link *l, u16 acked, u16 gap,
247 struct tipc_gap_ack_blks *ga,
248 struct sk_buff_head *xmitq);
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->failover_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);
529 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "bclink created!");
531 l->state = LINK_RESET;
535 /* Broadcast send link is always up */
536 if (link_is_bc_sndlink(l))
537 l->state = LINK_ESTABLISHED;
539 /* Disable replicast if even a single peer doesn't support it */
540 if (link_is_bc_rcvlink(l) && !(peer_caps & TIPC_BCAST_RCAST))
541 tipc_bcast_disable_rcast(net);
547 * tipc_link_fsm_evt - link finite state machine
548 * @l: pointer to link
549 * @evt: state machine event to be processed
551 int tipc_link_fsm_evt(struct tipc_link *l, int evt)
554 int old_state = l->state;
559 case LINK_PEER_RESET_EVT:
560 l->state = LINK_PEER_RESET;
563 l->state = LINK_RESET;
565 case LINK_FAILURE_EVT:
566 case LINK_FAILOVER_BEGIN_EVT:
567 case LINK_ESTABLISH_EVT:
568 case LINK_FAILOVER_END_EVT:
569 case LINK_SYNCH_BEGIN_EVT:
570 case LINK_SYNCH_END_EVT:
577 case LINK_PEER_RESET_EVT:
578 l->state = LINK_ESTABLISHING;
580 case LINK_FAILOVER_BEGIN_EVT:
581 l->state = LINK_FAILINGOVER;
582 case LINK_FAILURE_EVT:
584 case LINK_ESTABLISH_EVT:
585 case LINK_FAILOVER_END_EVT:
587 case LINK_SYNCH_BEGIN_EVT:
588 case LINK_SYNCH_END_EVT:
593 case LINK_PEER_RESET:
596 l->state = LINK_ESTABLISHING;
598 case LINK_PEER_RESET_EVT:
599 case LINK_ESTABLISH_EVT:
600 case LINK_FAILURE_EVT:
602 case LINK_SYNCH_BEGIN_EVT:
603 case LINK_SYNCH_END_EVT:
604 case LINK_FAILOVER_BEGIN_EVT:
605 case LINK_FAILOVER_END_EVT:
610 case LINK_FAILINGOVER:
612 case LINK_FAILOVER_END_EVT:
613 l->state = LINK_RESET;
615 case LINK_PEER_RESET_EVT:
617 case LINK_ESTABLISH_EVT:
618 case LINK_FAILURE_EVT:
620 case LINK_FAILOVER_BEGIN_EVT:
621 case LINK_SYNCH_BEGIN_EVT:
622 case LINK_SYNCH_END_EVT:
627 case LINK_ESTABLISHING:
629 case LINK_ESTABLISH_EVT:
630 l->state = LINK_ESTABLISHED;
632 case LINK_FAILOVER_BEGIN_EVT:
633 l->state = LINK_FAILINGOVER;
636 l->state = LINK_RESET;
638 case LINK_FAILURE_EVT:
639 case LINK_PEER_RESET_EVT:
640 case LINK_SYNCH_BEGIN_EVT:
641 case LINK_FAILOVER_END_EVT:
643 case LINK_SYNCH_END_EVT:
648 case LINK_ESTABLISHED:
650 case LINK_PEER_RESET_EVT:
651 l->state = LINK_PEER_RESET;
652 rc |= TIPC_LINK_DOWN_EVT;
654 case LINK_FAILURE_EVT:
655 l->state = LINK_RESETTING;
656 rc |= TIPC_LINK_DOWN_EVT;
659 l->state = LINK_RESET;
661 case LINK_ESTABLISH_EVT:
662 case LINK_SYNCH_END_EVT:
664 case LINK_SYNCH_BEGIN_EVT:
665 l->state = LINK_SYNCHING;
667 case LINK_FAILOVER_BEGIN_EVT:
668 case LINK_FAILOVER_END_EVT:
675 case LINK_PEER_RESET_EVT:
676 l->state = LINK_PEER_RESET;
677 rc |= TIPC_LINK_DOWN_EVT;
679 case LINK_FAILURE_EVT:
680 l->state = LINK_RESETTING;
681 rc |= TIPC_LINK_DOWN_EVT;
684 l->state = LINK_RESET;
686 case LINK_ESTABLISH_EVT:
687 case LINK_SYNCH_BEGIN_EVT:
689 case LINK_SYNCH_END_EVT:
690 l->state = LINK_ESTABLISHED;
692 case LINK_FAILOVER_BEGIN_EVT:
693 case LINK_FAILOVER_END_EVT:
699 pr_err("Unknown FSM state %x in %s\n", l->state, l->name);
701 trace_tipc_link_fsm(l->name, old_state, l->state, evt);
704 pr_err("Illegal FSM event %x in state %x on link %s\n",
705 evt, l->state, l->name);
706 trace_tipc_link_fsm(l->name, old_state, l->state, evt);
710 /* link_profile_stats - update statistical profiling of traffic
712 static void link_profile_stats(struct tipc_link *l)
715 struct tipc_msg *msg;
718 /* Update counters used in statistical profiling of send traffic */
719 l->stats.accu_queue_sz += skb_queue_len(&l->transmq);
720 l->stats.queue_sz_counts++;
722 skb = skb_peek(&l->transmq);
726 length = msg_size(msg);
728 if (msg_user(msg) == MSG_FRAGMENTER) {
729 if (msg_type(msg) != FIRST_FRAGMENT)
731 length = msg_size(msg_inner_hdr(msg));
733 l->stats.msg_lengths_total += length;
734 l->stats.msg_length_counts++;
736 l->stats.msg_length_profile[0]++;
737 else if (length <= 256)
738 l->stats.msg_length_profile[1]++;
739 else if (length <= 1024)
740 l->stats.msg_length_profile[2]++;
741 else if (length <= 4096)
742 l->stats.msg_length_profile[3]++;
743 else if (length <= 16384)
744 l->stats.msg_length_profile[4]++;
745 else if (length <= 32768)
746 l->stats.msg_length_profile[5]++;
748 l->stats.msg_length_profile[6]++;
752 * tipc_link_too_silent - check if link is "too silent"
753 * @l: tipc link to be checked
755 * Returns true if the link 'silent_intv_cnt' is about to reach the
756 * 'abort_limit' value, otherwise false
758 bool tipc_link_too_silent(struct tipc_link *l)
760 return (l->silent_intv_cnt + 2 > l->abort_limit);
763 /* tipc_link_timeout - perform periodic task as instructed from node timeout
765 int tipc_link_timeout(struct tipc_link *l, struct sk_buff_head *xmitq)
772 u16 bc_snt = l->bc_sndlink->snd_nxt - 1;
773 u16 bc_acked = l->bc_rcvlink->acked;
774 struct tipc_mon_state *mstate = &l->mon_state;
776 trace_tipc_link_timeout(l, TIPC_DUMP_NONE, " ");
777 trace_tipc_link_too_silent(l, TIPC_DUMP_ALL, " ");
779 case LINK_ESTABLISHED:
782 link_profile_stats(l);
783 tipc_mon_get_state(l->net, l->addr, mstate, l->bearer_id);
784 if (mstate->reset || (l->silent_intv_cnt > l->abort_limit))
785 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
786 state = bc_acked != bc_snt;
787 state |= l->bc_rcvlink->rcv_unacked;
788 state |= l->rcv_unacked;
789 state |= !skb_queue_empty(&l->transmq);
790 state |= !skb_queue_empty(&l->deferdq);
791 probe = mstate->probing;
792 probe |= l->silent_intv_cnt;
793 if (probe || mstate->monitoring)
794 l->silent_intv_cnt++;
797 setup = l->rst_cnt++ <= 4;
798 setup |= !(l->rst_cnt % 16);
801 case LINK_ESTABLISHING:
805 case LINK_PEER_RESET:
807 case LINK_FAILINGOVER:
813 if (state || probe || setup)
814 tipc_link_build_proto_msg(l, mtyp, probe, 0, 0, 0, 0, xmitq);
820 * link_schedule_user - schedule a message sender for wakeup after congestion
822 * @hdr: header of message that is being sent
823 * Create pseudo msg to send back to user when congestion abates
825 static int link_schedule_user(struct tipc_link *l, struct tipc_msg *hdr)
827 u32 dnode = tipc_own_addr(l->net);
828 u32 dport = msg_origport(hdr);
831 /* Create and schedule wakeup pseudo message */
832 skb = tipc_msg_create(SOCK_WAKEUP, 0, INT_H_SIZE, 0,
833 dnode, l->addr, dport, 0, 0);
836 msg_set_dest_droppable(buf_msg(skb), true);
837 TIPC_SKB_CB(skb)->chain_imp = msg_importance(hdr);
838 skb_queue_tail(&l->wakeupq, skb);
839 l->stats.link_congs++;
840 trace_tipc_link_conges(l, TIPC_DUMP_ALL, "wakeup scheduled!");
845 * link_prepare_wakeup - prepare users for wakeup after congestion
847 * Wake up a number of waiting users, as permitted by available space
850 static void link_prepare_wakeup(struct tipc_link *l)
852 struct sk_buff *skb, *tmp;
855 skb_queue_walk_safe(&l->wakeupq, skb, tmp) {
856 imp = TIPC_SKB_CB(skb)->chain_imp;
857 if (l->backlog[imp].len < l->backlog[imp].limit) {
858 skb_unlink(skb, &l->wakeupq);
859 skb_queue_tail(l->inputq, skb);
860 } else if (i++ > 10) {
866 void tipc_link_reset(struct tipc_link *l)
868 struct sk_buff_head list;
870 __skb_queue_head_init(&list);
872 l->in_session = false;
873 /* Force re-synch of peer session number before establishing */
876 l->mtu = l->advertised_mtu;
878 spin_lock_bh(&l->wakeupq.lock);
879 skb_queue_splice_init(&l->wakeupq, &list);
880 spin_unlock_bh(&l->wakeupq.lock);
882 spin_lock_bh(&l->inputq->lock);
883 skb_queue_splice_init(&list, l->inputq);
884 spin_unlock_bh(&l->inputq->lock);
886 __skb_queue_purge(&l->transmq);
887 __skb_queue_purge(&l->deferdq);
888 __skb_queue_purge(&l->backlogq);
889 __skb_queue_purge(&l->failover_deferdq);
890 l->backlog[TIPC_LOW_IMPORTANCE].len = 0;
891 l->backlog[TIPC_MEDIUM_IMPORTANCE].len = 0;
892 l->backlog[TIPC_HIGH_IMPORTANCE].len = 0;
893 l->backlog[TIPC_CRITICAL_IMPORTANCE].len = 0;
894 l->backlog[TIPC_SYSTEM_IMPORTANCE].len = 0;
895 kfree_skb(l->reasm_buf);
896 kfree_skb(l->failover_reasm_skb);
898 l->failover_reasm_skb = NULL;
902 l->snd_nxt_state = 1;
903 l->rcv_nxt_state = 1;
905 l->silent_intv_cnt = 0;
907 l->bc_peer_is_up = false;
908 memset(&l->mon_state, 0, sizeof(l->mon_state));
909 tipc_link_reset_stats(l);
913 * tipc_link_xmit(): enqueue buffer list according to queue situation
915 * @list: chain of buffers containing message
916 * @xmitq: returned list of packets to be sent by caller
918 * Consumes the buffer chain.
919 * Returns 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS
920 * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted
922 int tipc_link_xmit(struct tipc_link *l, struct sk_buff_head *list,
923 struct sk_buff_head *xmitq)
925 struct tipc_msg *hdr = buf_msg(skb_peek(list));
926 unsigned int maxwin = l->window;
927 int imp = msg_importance(hdr);
928 unsigned int mtu = l->mtu;
929 u16 ack = l->rcv_nxt - 1;
930 u16 seqno = l->snd_nxt;
931 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
932 struct sk_buff_head *transmq = &l->transmq;
933 struct sk_buff_head *backlogq = &l->backlogq;
934 struct sk_buff *skb, *_skb, *bskb;
935 int pkt_cnt = skb_queue_len(list);
938 if (unlikely(msg_size(hdr) > mtu)) {
939 skb_queue_purge(list);
943 /* Allow oversubscription of one data msg per source at congestion */
944 if (unlikely(l->backlog[imp].len >= l->backlog[imp].limit)) {
945 if (imp == TIPC_SYSTEM_IMPORTANCE) {
946 pr_warn("%s<%s>, link overflow", link_rst_msg, l->name);
949 rc = link_schedule_user(l, hdr);
953 l->stats.sent_fragmented++;
954 l->stats.sent_fragments += pkt_cnt;
957 /* Prepare each packet for sending, and add to relevant queue: */
958 while (skb_queue_len(list)) {
959 skb = skb_peek(list);
961 msg_set_seqno(hdr, seqno);
962 msg_set_ack(hdr, ack);
963 msg_set_bcast_ack(hdr, bc_ack);
965 if (likely(skb_queue_len(transmq) < maxwin)) {
966 _skb = skb_clone(skb, GFP_ATOMIC);
968 skb_queue_purge(list);
972 __skb_queue_tail(transmq, skb);
973 /* next retransmit attempt */
974 if (link_is_bc_sndlink(l))
975 TIPC_SKB_CB(skb)->nxt_retr = TIPC_BC_RETR_LIM;
976 __skb_queue_tail(xmitq, _skb);
977 TIPC_SKB_CB(skb)->ackers = l->ackers;
979 l->stats.sent_pkts++;
983 if (tipc_msg_bundle(skb_peek_tail(backlogq), hdr, mtu)) {
984 kfree_skb(__skb_dequeue(list));
985 l->stats.sent_bundled++;
988 if (tipc_msg_make_bundle(&bskb, hdr, mtu, l->addr)) {
989 kfree_skb(__skb_dequeue(list));
990 __skb_queue_tail(backlogq, bskb);
991 l->backlog[msg_importance(buf_msg(bskb))].len++;
992 l->stats.sent_bundled++;
993 l->stats.sent_bundles++;
996 l->backlog[imp].len += skb_queue_len(list);
997 skb_queue_splice_tail_init(list, backlogq);
1003 static void tipc_link_advance_backlog(struct tipc_link *l,
1004 struct sk_buff_head *xmitq)
1006 struct sk_buff *skb, *_skb;
1007 struct tipc_msg *hdr;
1008 u16 seqno = l->snd_nxt;
1009 u16 ack = l->rcv_nxt - 1;
1010 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
1012 while (skb_queue_len(&l->transmq) < l->window) {
1013 skb = skb_peek(&l->backlogq);
1016 _skb = skb_clone(skb, GFP_ATOMIC);
1019 __skb_dequeue(&l->backlogq);
1021 l->backlog[msg_importance(hdr)].len--;
1022 __skb_queue_tail(&l->transmq, skb);
1023 /* next retransmit attempt */
1024 if (link_is_bc_sndlink(l))
1025 TIPC_SKB_CB(skb)->nxt_retr = TIPC_BC_RETR_LIM;
1027 __skb_queue_tail(xmitq, _skb);
1028 TIPC_SKB_CB(skb)->ackers = l->ackers;
1029 msg_set_seqno(hdr, seqno);
1030 msg_set_ack(hdr, ack);
1031 msg_set_bcast_ack(hdr, bc_ack);
1033 l->stats.sent_pkts++;
1040 * link_retransmit_failure() - Detect repeated retransmit failures
1041 * @l: tipc link sender
1042 * @r: tipc link receiver (= l in case of unicast)
1043 * @rc: returned code
1045 * Return: true if the repeated retransmit failures happens, otherwise
1048 static bool link_retransmit_failure(struct tipc_link *l, struct tipc_link *r,
1051 struct sk_buff *skb = skb_peek(&l->transmq);
1052 struct tipc_msg *hdr;
1057 if (!TIPC_SKB_CB(skb)->retr_cnt)
1060 if (!time_after(jiffies, TIPC_SKB_CB(skb)->retr_stamp +
1061 msecs_to_jiffies(r->tolerance)))
1065 if (link_is_bc_sndlink(l) && !less(r->acked, msg_seqno(hdr)))
1068 pr_warn("Retransmission failure on link <%s>\n", l->name);
1069 link_print(l, "State of link ");
1070 pr_info("Failed msg: usr %u, typ %u, len %u, err %u\n",
1071 msg_user(hdr), msg_type(hdr), msg_size(hdr), msg_errcode(hdr));
1072 pr_info("sqno %u, prev: %x, dest: %x\n",
1073 msg_seqno(hdr), msg_prevnode(hdr), msg_destnode(hdr));
1074 pr_info("retr_stamp %d, retr_cnt %d\n",
1075 jiffies_to_msecs(TIPC_SKB_CB(skb)->retr_stamp),
1076 TIPC_SKB_CB(skb)->retr_cnt);
1078 trace_tipc_list_dump(&l->transmq, true, "retrans failure!");
1079 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "retrans failure!");
1080 trace_tipc_link_dump(r, TIPC_DUMP_NONE, "retrans failure!");
1082 if (link_is_bc_sndlink(l)) {
1083 r->state = LINK_RESET;
1084 *rc = TIPC_LINK_DOWN_EVT;
1086 *rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1092 /* tipc_link_bc_retrans() - retransmit zero or more packets
1093 * @l: the link to transmit on
1094 * @r: the receiving link ordering the retransmit. Same as l if unicast
1095 * @from: retransmit from (inclusive) this sequence number
1096 * @to: retransmit to (inclusive) this sequence number
1097 * xmitq: queue for accumulating the retransmitted packets
1099 static int tipc_link_bc_retrans(struct tipc_link *l, struct tipc_link *r,
1100 u16 from, u16 to, struct sk_buff_head *xmitq)
1102 struct sk_buff *_skb, *skb = skb_peek(&l->transmq);
1103 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
1104 u16 ack = l->rcv_nxt - 1;
1105 struct tipc_msg *hdr;
1113 trace_tipc_link_retrans(r, from, to, &l->transmq);
1115 if (link_retransmit_failure(l, r, &rc))
1118 skb_queue_walk(&l->transmq, skb) {
1120 if (less(msg_seqno(hdr), from))
1122 if (more(msg_seqno(hdr), to))
1125 if (time_before(jiffies, TIPC_SKB_CB(skb)->nxt_retr))
1127 TIPC_SKB_CB(skb)->nxt_retr = TIPC_BC_RETR_LIM;
1128 _skb = __pskb_copy(skb, LL_MAX_HEADER + MIN_H_SIZE, GFP_ATOMIC);
1131 hdr = buf_msg(_skb);
1132 msg_set_ack(hdr, ack);
1133 msg_set_bcast_ack(hdr, bc_ack);
1134 _skb->priority = TC_PRIO_CONTROL;
1135 __skb_queue_tail(xmitq, _skb);
1136 l->stats.retransmitted++;
1138 /* Increase actual retrans counter & mark first time */
1139 if (!TIPC_SKB_CB(skb)->retr_cnt++)
1140 TIPC_SKB_CB(skb)->retr_stamp = jiffies;
1145 /* tipc_data_input - deliver data and name distr msgs to upper layer
1147 * Consumes buffer if message is of right type
1148 * Node lock must be held
1150 static bool tipc_data_input(struct tipc_link *l, struct sk_buff *skb,
1151 struct sk_buff_head *inputq)
1153 struct sk_buff_head *mc_inputq = l->bc_rcvlink->inputq;
1154 struct tipc_msg *hdr = buf_msg(skb);
1156 switch (msg_user(hdr)) {
1157 case TIPC_LOW_IMPORTANCE:
1158 case TIPC_MEDIUM_IMPORTANCE:
1159 case TIPC_HIGH_IMPORTANCE:
1160 case TIPC_CRITICAL_IMPORTANCE:
1161 if (unlikely(msg_in_group(hdr) || msg_mcast(hdr))) {
1162 skb_queue_tail(mc_inputq, skb);
1167 skb_queue_tail(inputq, skb);
1169 case GROUP_PROTOCOL:
1170 skb_queue_tail(mc_inputq, skb);
1172 case NAME_DISTRIBUTOR:
1173 l->bc_rcvlink->state = LINK_ESTABLISHED;
1174 skb_queue_tail(l->namedq, skb);
1177 case TUNNEL_PROTOCOL:
1178 case MSG_FRAGMENTER:
1179 case BCAST_PROTOCOL:
1182 pr_warn("Dropping received illegal msg type\n");
1188 /* tipc_link_input - process packet that has passed link protocol check
1192 static int tipc_link_input(struct tipc_link *l, struct sk_buff *skb,
1193 struct sk_buff_head *inputq,
1194 struct sk_buff **reasm_skb)
1196 struct tipc_msg *hdr = buf_msg(skb);
1197 struct sk_buff *iskb;
1198 struct sk_buff_head tmpq;
1199 int usr = msg_user(hdr);
1202 if (usr == MSG_BUNDLER) {
1203 skb_queue_head_init(&tmpq);
1204 l->stats.recv_bundles++;
1205 l->stats.recv_bundled += msg_msgcnt(hdr);
1206 while (tipc_msg_extract(skb, &iskb, &pos))
1207 tipc_data_input(l, iskb, &tmpq);
1208 tipc_skb_queue_splice_tail(&tmpq, inputq);
1210 } else if (usr == MSG_FRAGMENTER) {
1211 l->stats.recv_fragments++;
1212 if (tipc_buf_append(reasm_skb, &skb)) {
1213 l->stats.recv_fragmented++;
1214 tipc_data_input(l, skb, inputq);
1215 } else if (!*reasm_skb && !link_is_bc_rcvlink(l)) {
1216 pr_warn_ratelimited("Unable to build fragment list\n");
1217 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1220 } else if (usr == BCAST_PROTOCOL) {
1221 tipc_bcast_lock(l->net);
1222 tipc_link_bc_init_rcv(l->bc_rcvlink, hdr);
1223 tipc_bcast_unlock(l->net);
1230 /* tipc_link_tnl_rcv() - receive TUNNEL_PROTOCOL message, drop or process the
1231 * inner message along with the ones in the old link's
1234 * @skb: TUNNEL_PROTOCOL message
1235 * @inputq: queue to put messages ready for delivery
1237 static int tipc_link_tnl_rcv(struct tipc_link *l, struct sk_buff *skb,
1238 struct sk_buff_head *inputq)
1240 struct sk_buff **reasm_skb = &l->failover_reasm_skb;
1241 struct sk_buff_head *fdefq = &l->failover_deferdq;
1242 struct tipc_msg *hdr = buf_msg(skb);
1243 struct sk_buff *iskb;
1249 if (msg_type(hdr) == SYNCH_MSG)
1253 if (!tipc_msg_extract(skb, &iskb, &ipos)) {
1254 pr_warn_ratelimited("Cannot extract FAILOVER_MSG, defq: %d\n",
1255 skb_queue_len(fdefq));
1260 seqno = buf_seqno(iskb);
1262 if (unlikely(less(seqno, l->drop_point))) {
1267 if (unlikely(seqno != l->drop_point)) {
1268 __tipc_skb_queue_sorted(fdefq, seqno, iskb);
1274 if (!tipc_data_input(l, iskb, inputq))
1275 rc |= tipc_link_input(l, iskb, inputq, reasm_skb);
1278 } while ((iskb = __tipc_skb_dequeue(fdefq, l->drop_point)));
1285 static bool tipc_link_release_pkts(struct tipc_link *l, u16 acked)
1287 bool released = false;
1288 struct sk_buff *skb, *tmp;
1290 skb_queue_walk_safe(&l->transmq, skb, tmp) {
1291 if (more(buf_seqno(skb), acked))
1293 __skb_unlink(skb, &l->transmq);
1300 /* tipc_build_gap_ack_blks - build Gap ACK blocks
1301 * @l: tipc link that data have come with gaps in sequence if any
1302 * @data: data buffer to store the Gap ACK blocks after built
1304 * returns the actual allocated memory size
1306 static u16 tipc_build_gap_ack_blks(struct tipc_link *l, void *data)
1308 struct sk_buff *skb = skb_peek(&l->deferdq);
1309 struct tipc_gap_ack_blks *ga = data;
1310 u16 len, expect, seqno = 0;
1316 expect = buf_seqno(skb);
1317 skb_queue_walk(&l->deferdq, skb) {
1318 seqno = buf_seqno(skb);
1319 if (unlikely(more(seqno, expect))) {
1320 ga->gacks[n].ack = htons(expect - 1);
1321 ga->gacks[n].gap = htons(seqno - expect);
1322 if (++n >= MAX_GAP_ACK_BLKS) {
1323 pr_info_ratelimited("Too few Gap ACK blocks!\n");
1326 } else if (unlikely(less(seqno, expect))) {
1327 pr_warn("Unexpected skb in deferdq!\n");
1334 ga->gacks[n].ack = htons(seqno);
1335 ga->gacks[n].gap = 0;
1339 len = tipc_gap_ack_blks_sz(n);
1340 ga->len = htons(len);
1345 /* tipc_link_advance_transmq - advance TIPC link transmq queue by releasing
1346 * acked packets, also doing retransmissions if
1348 * @l: tipc link with transmq queue to be advanced
1349 * @acked: seqno of last packet acked by peer without any gaps before
1350 * @gap: # of gap packets
1351 * @ga: buffer pointer to Gap ACK blocks from peer
1352 * @xmitq: queue for accumulating the retransmitted packets if any
1354 * In case of a repeated retransmit failures, the call will return shortly
1355 * with a returned code (e.g. TIPC_LINK_DOWN_EVT)
1357 static int tipc_link_advance_transmq(struct tipc_link *l, u16 acked, u16 gap,
1358 struct tipc_gap_ack_blks *ga,
1359 struct sk_buff_head *xmitq)
1361 struct sk_buff *skb, *_skb, *tmp;
1362 struct tipc_msg *hdr;
1363 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
1364 u16 ack = l->rcv_nxt - 1;
1365 bool passed = false;
1369 skb_queue_walk_safe(&l->transmq, skb, tmp) {
1370 seqno = buf_seqno(skb);
1373 if (less_eq(seqno, acked)) {
1375 __skb_unlink(skb, &l->transmq);
1377 } else if (less_eq(seqno, acked + gap)) {
1378 /* First, check if repeated retrans failures occurs? */
1379 if (!passed && link_retransmit_failure(l, l, &rc))
1383 /* retransmit skb if unrestricted*/
1384 if (time_before(jiffies, TIPC_SKB_CB(skb)->nxt_retr))
1386 TIPC_SKB_CB(skb)->nxt_retr = TIPC_UC_RETR_TIME;
1387 _skb = __pskb_copy(skb, LL_MAX_HEADER + MIN_H_SIZE,
1391 hdr = buf_msg(_skb);
1392 msg_set_ack(hdr, ack);
1393 msg_set_bcast_ack(hdr, bc_ack);
1394 _skb->priority = TC_PRIO_CONTROL;
1395 __skb_queue_tail(xmitq, _skb);
1396 l->stats.retransmitted++;
1398 /* Increase actual retrans counter & mark first time */
1399 if (!TIPC_SKB_CB(skb)->retr_cnt++)
1400 TIPC_SKB_CB(skb)->retr_stamp = jiffies;
1402 /* retry with Gap ACK blocks if any */
1403 if (!ga || n >= ga->gack_cnt)
1405 acked = ntohs(ga->gacks[n].ack);
1406 gap = ntohs(ga->gacks[n].gap);
1415 /* tipc_link_build_state_msg: prepare link state message for transmission
1417 * Note that sending of broadcast ack is coordinated among nodes, to reduce
1418 * risk of ack storms towards the sender
1420 int tipc_link_build_state_msg(struct tipc_link *l, struct sk_buff_head *xmitq)
1425 /* Broadcast ACK must be sent via a unicast link => defer to caller */
1426 if (link_is_bc_rcvlink(l)) {
1427 if (((l->rcv_nxt ^ tipc_own_addr(l->net)) & 0xf) != 0xf)
1431 /* Use snd_nxt to store peer's snd_nxt in broadcast rcv link */
1432 l->snd_nxt = l->rcv_nxt;
1433 return TIPC_LINK_SND_STATE;
1438 l->stats.sent_acks++;
1439 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, 0, xmitq);
1443 /* tipc_link_build_reset_msg: prepare link RESET or ACTIVATE message
1445 void tipc_link_build_reset_msg(struct tipc_link *l, struct sk_buff_head *xmitq)
1447 int mtyp = RESET_MSG;
1448 struct sk_buff *skb;
1450 if (l->state == LINK_ESTABLISHING)
1451 mtyp = ACTIVATE_MSG;
1453 tipc_link_build_proto_msg(l, mtyp, 0, 0, 0, 0, 0, xmitq);
1455 /* Inform peer that this endpoint is going down if applicable */
1456 skb = skb_peek_tail(xmitq);
1457 if (skb && (l->state == LINK_RESET))
1458 msg_set_peer_stopping(buf_msg(skb), 1);
1461 /* tipc_link_build_nack_msg: prepare link nack message for transmission
1462 * Note that sending of broadcast NACK is coordinated among nodes, to
1463 * reduce the risk of NACK storms towards the sender
1465 static int tipc_link_build_nack_msg(struct tipc_link *l,
1466 struct sk_buff_head *xmitq)
1468 u32 def_cnt = ++l->stats.deferred_recv;
1469 u32 defq_len = skb_queue_len(&l->deferdq);
1472 if (link_is_bc_rcvlink(l)) {
1473 match1 = def_cnt & 0xf;
1474 match2 = tipc_own_addr(l->net) & 0xf;
1475 if (match1 == match2)
1476 return TIPC_LINK_SND_STATE;
1480 if (defq_len >= 3 && !((defq_len - 3) % 16))
1481 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, 0, xmitq);
1485 /* tipc_link_rcv - process TIPC packets/messages arriving from off-node
1486 * @l: the link that should handle the message
1488 * @xmitq: queue to place packets to be sent after this call
1490 int tipc_link_rcv(struct tipc_link *l, struct sk_buff *skb,
1491 struct sk_buff_head *xmitq)
1493 struct sk_buff_head *defq = &l->deferdq;
1494 struct tipc_msg *hdr = buf_msg(skb);
1495 u16 seqno, rcv_nxt, win_lim;
1498 /* Verify and update link state */
1499 if (unlikely(msg_user(hdr) == LINK_PROTOCOL))
1500 return tipc_link_proto_rcv(l, skb, xmitq);
1502 /* Don't send probe at next timeout expiration */
1503 l->silent_intv_cnt = 0;
1507 seqno = msg_seqno(hdr);
1508 rcv_nxt = l->rcv_nxt;
1509 win_lim = rcv_nxt + TIPC_MAX_LINK_WIN;
1511 if (unlikely(!link_is_up(l))) {
1512 if (l->state == LINK_ESTABLISHING)
1513 rc = TIPC_LINK_UP_EVT;
1517 /* Drop if outside receive window */
1518 if (unlikely(less(seqno, rcv_nxt) || more(seqno, win_lim))) {
1519 l->stats.duplicates++;
1523 /* Forward queues and wake up waiting users */
1524 if (likely(tipc_link_release_pkts(l, msg_ack(hdr)))) {
1525 tipc_link_advance_backlog(l, xmitq);
1526 if (unlikely(!skb_queue_empty(&l->wakeupq)))
1527 link_prepare_wakeup(l);
1530 /* Defer delivery if sequence gap */
1531 if (unlikely(seqno != rcv_nxt)) {
1532 __tipc_skb_queue_sorted(defq, seqno, skb);
1533 rc |= tipc_link_build_nack_msg(l, xmitq);
1537 /* Deliver packet */
1539 l->stats.recv_pkts++;
1541 if (unlikely(msg_user(hdr) == TUNNEL_PROTOCOL))
1542 rc |= tipc_link_tnl_rcv(l, skb, l->inputq);
1543 else if (!tipc_data_input(l, skb, l->inputq))
1544 rc |= tipc_link_input(l, skb, l->inputq, &l->reasm_buf);
1545 if (unlikely(++l->rcv_unacked >= TIPC_MIN_LINK_WIN))
1546 rc |= tipc_link_build_state_msg(l, xmitq);
1547 if (unlikely(rc & ~TIPC_LINK_SND_STATE))
1549 } while ((skb = __tipc_skb_dequeue(defq, l->rcv_nxt)));
1557 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe,
1558 bool probe_reply, u16 rcvgap,
1559 int tolerance, int priority,
1560 struct sk_buff_head *xmitq)
1562 struct tipc_link *bcl = l->bc_rcvlink;
1563 struct sk_buff *skb;
1564 struct tipc_msg *hdr;
1565 struct sk_buff_head *dfq = &l->deferdq;
1566 bool node_up = link_is_up(bcl);
1567 struct tipc_mon_state *mstate = &l->mon_state;
1572 /* Don't send protocol message during reset or link failover */
1573 if (tipc_link_is_blocked(l))
1576 if (!tipc_link_is_up(l) && (mtyp == STATE_MSG))
1579 if (!skb_queue_empty(dfq))
1580 rcvgap = buf_seqno(skb_peek(dfq)) - l->rcv_nxt;
1582 skb = tipc_msg_create(LINK_PROTOCOL, mtyp, INT_H_SIZE,
1583 tipc_max_domain_size + MAX_GAP_ACK_BLKS_SZ,
1584 l->addr, tipc_own_addr(l->net), 0, 0, 0);
1589 data = msg_data(hdr);
1590 msg_set_session(hdr, l->session);
1591 msg_set_bearer_id(hdr, l->bearer_id);
1592 msg_set_net_plane(hdr, l->net_plane);
1593 msg_set_next_sent(hdr, l->snd_nxt);
1594 msg_set_ack(hdr, l->rcv_nxt - 1);
1595 msg_set_bcast_ack(hdr, bcl->rcv_nxt - 1);
1596 msg_set_bc_ack_invalid(hdr, !node_up);
1597 msg_set_last_bcast(hdr, l->bc_sndlink->snd_nxt - 1);
1598 msg_set_link_tolerance(hdr, tolerance);
1599 msg_set_linkprio(hdr, priority);
1600 msg_set_redundant_link(hdr, node_up);
1601 msg_set_seq_gap(hdr, 0);
1602 msg_set_seqno(hdr, l->snd_nxt + U16_MAX / 2);
1604 if (mtyp == STATE_MSG) {
1605 if (l->peer_caps & TIPC_LINK_PROTO_SEQNO)
1606 msg_set_seqno(hdr, l->snd_nxt_state++);
1607 msg_set_seq_gap(hdr, rcvgap);
1608 msg_set_bc_gap(hdr, link_bc_rcv_gap(bcl));
1609 msg_set_probe(hdr, probe);
1610 msg_set_is_keepalive(hdr, probe || probe_reply);
1611 if (l->peer_caps & TIPC_GAP_ACK_BLOCK)
1612 glen = tipc_build_gap_ack_blks(l, data);
1613 tipc_mon_prep(l->net, data + glen, &dlen, mstate, l->bearer_id);
1614 msg_set_size(hdr, INT_H_SIZE + glen + dlen);
1615 skb_trim(skb, INT_H_SIZE + glen + dlen);
1616 l->stats.sent_states++;
1619 /* RESET_MSG or ACTIVATE_MSG */
1620 if (mtyp == ACTIVATE_MSG) {
1621 msg_set_dest_session_valid(hdr, 1);
1622 msg_set_dest_session(hdr, l->peer_session);
1624 msg_set_max_pkt(hdr, l->advertised_mtu);
1625 strcpy(data, l->if_name);
1626 msg_set_size(hdr, INT_H_SIZE + TIPC_MAX_IF_NAME);
1627 skb_trim(skb, INT_H_SIZE + TIPC_MAX_IF_NAME);
1630 l->stats.sent_probes++;
1632 l->stats.sent_nacks++;
1633 skb->priority = TC_PRIO_CONTROL;
1634 __skb_queue_tail(xmitq, skb);
1635 trace_tipc_proto_build(skb, false, l->name);
1638 void tipc_link_create_dummy_tnl_msg(struct tipc_link *l,
1639 struct sk_buff_head *xmitq)
1641 u32 onode = tipc_own_addr(l->net);
1642 struct tipc_msg *hdr, *ihdr;
1643 struct sk_buff_head tnlq;
1644 struct sk_buff *skb;
1645 u32 dnode = l->addr;
1647 skb_queue_head_init(&tnlq);
1648 skb = tipc_msg_create(TUNNEL_PROTOCOL, FAILOVER_MSG,
1649 INT_H_SIZE, BASIC_H_SIZE,
1650 dnode, onode, 0, 0, 0);
1652 pr_warn("%sunable to create tunnel packet\n", link_co_err);
1657 msg_set_msgcnt(hdr, 1);
1658 msg_set_bearer_id(hdr, l->peer_bearer_id);
1660 ihdr = (struct tipc_msg *)msg_data(hdr);
1661 tipc_msg_init(onode, ihdr, TIPC_LOW_IMPORTANCE, TIPC_DIRECT_MSG,
1662 BASIC_H_SIZE, dnode);
1663 msg_set_errcode(ihdr, TIPC_ERR_NO_PORT);
1664 __skb_queue_tail(&tnlq, skb);
1665 tipc_link_xmit(l, &tnlq, xmitq);
1668 /* tipc_link_tnl_prepare(): prepare and return a list of tunnel packets
1669 * with contents of the link's transmit and backlog queues.
1671 void tipc_link_tnl_prepare(struct tipc_link *l, struct tipc_link *tnl,
1672 int mtyp, struct sk_buff_head *xmitq)
1674 struct sk_buff_head *fdefq = &tnl->failover_deferdq;
1675 struct sk_buff *skb, *tnlskb;
1676 struct tipc_msg *hdr, tnlhdr;
1677 struct sk_buff_head *queue = &l->transmq;
1678 struct sk_buff_head tmpxq, tnlq;
1679 u16 pktlen, pktcnt, seqno = l->snd_nxt;
1684 skb_queue_head_init(&tnlq);
1685 skb_queue_head_init(&tmpxq);
1687 /* At least one packet required for safe algorithm => add dummy */
1688 skb = tipc_msg_create(TIPC_LOW_IMPORTANCE, TIPC_DIRECT_MSG,
1689 BASIC_H_SIZE, 0, l->addr, tipc_own_addr(l->net),
1690 0, 0, TIPC_ERR_NO_PORT);
1692 pr_warn("%sunable to create tunnel packet\n", link_co_err);
1695 skb_queue_tail(&tnlq, skb);
1696 tipc_link_xmit(l, &tnlq, &tmpxq);
1697 __skb_queue_purge(&tmpxq);
1699 /* Initialize reusable tunnel packet header */
1700 tipc_msg_init(tipc_own_addr(l->net), &tnlhdr, TUNNEL_PROTOCOL,
1701 mtyp, INT_H_SIZE, l->addr);
1702 if (mtyp == SYNCH_MSG)
1703 pktcnt = l->snd_nxt - buf_seqno(skb_peek(&l->transmq));
1705 pktcnt = skb_queue_len(&l->transmq);
1706 pktcnt += skb_queue_len(&l->backlogq);
1707 msg_set_msgcnt(&tnlhdr, pktcnt);
1708 msg_set_bearer_id(&tnlhdr, l->peer_bearer_id);
1710 /* Wrap each packet into a tunnel packet */
1711 skb_queue_walk(queue, skb) {
1713 if (queue == &l->backlogq)
1714 msg_set_seqno(hdr, seqno++);
1715 pktlen = msg_size(hdr);
1716 msg_set_size(&tnlhdr, pktlen + INT_H_SIZE);
1717 tnlskb = tipc_buf_acquire(pktlen + INT_H_SIZE, GFP_ATOMIC);
1719 pr_warn("%sunable to send packet\n", link_co_err);
1722 skb_copy_to_linear_data(tnlskb, &tnlhdr, INT_H_SIZE);
1723 skb_copy_to_linear_data_offset(tnlskb, INT_H_SIZE, hdr, pktlen);
1724 __skb_queue_tail(&tnlq, tnlskb);
1726 if (queue != &l->backlogq) {
1727 queue = &l->backlogq;
1731 tipc_link_xmit(tnl, &tnlq, xmitq);
1733 if (mtyp == FAILOVER_MSG) {
1734 tnl->drop_point = l->rcv_nxt;
1735 tnl->failover_reasm_skb = l->reasm_buf;
1736 l->reasm_buf = NULL;
1738 /* Failover the link's deferdq */
1739 if (unlikely(!skb_queue_empty(fdefq))) {
1740 pr_warn("Link failover deferdq not empty: %d!\n",
1741 skb_queue_len(fdefq));
1742 __skb_queue_purge(fdefq);
1744 skb_queue_splice_init(&l->deferdq, fdefq);
1749 * tipc_link_failover_prepare() - prepare tnl for link failover
1751 * This is a special version of the precursor - tipc_link_tnl_prepare(),
1752 * see the tipc_node_link_failover() for details
1756 * @xmitq: queue for messages to be xmited
1758 void tipc_link_failover_prepare(struct tipc_link *l, struct tipc_link *tnl,
1759 struct sk_buff_head *xmitq)
1761 struct sk_buff_head *fdefq = &tnl->failover_deferdq;
1763 tipc_link_create_dummy_tnl_msg(tnl, xmitq);
1765 /* This failover link enpoint was never established before,
1766 * so it has not received anything from peer.
1767 * Otherwise, it must be a normal failover situation or the
1768 * node has entered SELF_DOWN_PEER_LEAVING and both peer nodes
1769 * would have to start over from scratch instead.
1771 tnl->drop_point = 1;
1772 tnl->failover_reasm_skb = NULL;
1774 /* Initiate the link's failover deferdq */
1775 if (unlikely(!skb_queue_empty(fdefq))) {
1776 pr_warn("Link failover deferdq not empty: %d!\n",
1777 skb_queue_len(fdefq));
1778 __skb_queue_purge(fdefq);
1782 /* tipc_link_validate_msg(): validate message against current link state
1783 * Returns true if message should be accepted, otherwise false
1785 bool tipc_link_validate_msg(struct tipc_link *l, struct tipc_msg *hdr)
1787 u16 curr_session = l->peer_session;
1788 u16 session = msg_session(hdr);
1789 int mtyp = msg_type(hdr);
1791 if (msg_user(hdr) != LINK_PROTOCOL)
1798 /* Accept only RESET with new session number */
1799 return more(session, curr_session);
1803 /* Accept only ACTIVATE with new or current session number */
1804 return !less(session, curr_session);
1806 /* Accept only STATE with current session number */
1809 if (session != curr_session)
1811 /* Extra sanity check */
1812 if (!link_is_up(l) && msg_ack(hdr))
1814 if (!(l->peer_caps & TIPC_LINK_PROTO_SEQNO))
1816 /* Accept only STATE with new sequence number */
1817 return !less(msg_seqno(hdr), l->rcv_nxt_state);
1823 /* tipc_link_proto_rcv(): receive link level protocol message :
1824 * Note that network plane id propagates through the network, and may
1825 * change at any time. The node with lowest numerical id determines
1828 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb,
1829 struct sk_buff_head *xmitq)
1831 struct tipc_msg *hdr = buf_msg(skb);
1832 struct tipc_gap_ack_blks *ga = NULL;
1834 u16 ack = msg_ack(hdr);
1835 u16 gap = msg_seq_gap(hdr);
1836 u16 peers_snd_nxt = msg_next_sent(hdr);
1837 u16 peers_tol = msg_link_tolerance(hdr);
1838 u16 peers_prio = msg_linkprio(hdr);
1839 u16 rcv_nxt = l->rcv_nxt;
1840 u16 dlen = msg_data_sz(hdr);
1841 int mtyp = msg_type(hdr);
1842 bool reply = msg_probe(hdr);
1848 trace_tipc_proto_rcv(skb, false, l->name);
1849 if (tipc_link_is_blocked(l) || !xmitq)
1852 if (tipc_own_addr(l->net) > msg_prevnode(hdr))
1853 l->net_plane = msg_net_plane(hdr);
1857 data = msg_data(hdr);
1859 if (!tipc_link_validate_msg(l, hdr)) {
1860 trace_tipc_skb_dump(skb, false, "PROTO invalid (1)!");
1861 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "PROTO invalid (1)!");
1868 /* Complete own link name with peer's interface name */
1869 if_name = strrchr(l->name, ':') + 1;
1870 if (sizeof(l->name) - (if_name - l->name) <= TIPC_MAX_IF_NAME)
1872 if (msg_data_sz(hdr) < TIPC_MAX_IF_NAME)
1874 strncpy(if_name, data, TIPC_MAX_IF_NAME);
1876 /* Update own tolerance if peer indicates a non-zero value */
1877 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL)) {
1878 l->tolerance = peers_tol;
1879 l->bc_rcvlink->tolerance = peers_tol;
1881 /* Update own priority if peer's priority is higher */
1882 if (in_range(peers_prio, l->priority + 1, TIPC_MAX_LINK_PRI))
1883 l->priority = peers_prio;
1885 /* If peer is going down we want full re-establish cycle */
1886 if (msg_peer_stopping(hdr)) {
1887 rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1891 /* If this endpoint was re-created while peer was ESTABLISHING
1892 * it doesn't know current session number. Force re-synch.
1894 if (mtyp == ACTIVATE_MSG && msg_dest_session_valid(hdr) &&
1895 l->session != msg_dest_session(hdr)) {
1896 if (less(l->session, msg_dest_session(hdr)))
1897 l->session = msg_dest_session(hdr) + 1;
1901 /* ACTIVATE_MSG serves as PEER_RESET if link is already down */
1902 if (mtyp == RESET_MSG || !link_is_up(l))
1903 rc = tipc_link_fsm_evt(l, LINK_PEER_RESET_EVT);
1905 /* ACTIVATE_MSG takes up link if it was already locally reset */
1906 if (mtyp == ACTIVATE_MSG && l->state == LINK_ESTABLISHING)
1907 rc = TIPC_LINK_UP_EVT;
1909 l->peer_session = msg_session(hdr);
1910 l->in_session = true;
1911 l->peer_bearer_id = msg_bearer_id(hdr);
1912 if (l->mtu > msg_max_pkt(hdr))
1913 l->mtu = msg_max_pkt(hdr);
1917 l->rcv_nxt_state = msg_seqno(hdr) + 1;
1919 /* Update own tolerance if peer indicates a non-zero value */
1920 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL)) {
1921 l->tolerance = peers_tol;
1922 l->bc_rcvlink->tolerance = peers_tol;
1924 /* Update own prio if peer indicates a different value */
1925 if ((peers_prio != l->priority) &&
1926 in_range(peers_prio, 1, TIPC_MAX_LINK_PRI)) {
1927 l->priority = peers_prio;
1928 rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1931 l->silent_intv_cnt = 0;
1932 l->stats.recv_states++;
1934 l->stats.recv_probes++;
1936 if (!link_is_up(l)) {
1937 if (l->state == LINK_ESTABLISHING)
1938 rc = TIPC_LINK_UP_EVT;
1942 /* Receive Gap ACK blocks from peer if any */
1943 if (l->peer_caps & TIPC_GAP_ACK_BLOCK) {
1944 ga = (struct tipc_gap_ack_blks *)data;
1945 glen = ntohs(ga->len);
1946 /* sanity check: if failed, ignore Gap ACK blocks */
1947 if (glen != tipc_gap_ack_blks_sz(ga->gack_cnt))
1951 tipc_mon_rcv(l->net, data + glen, dlen - glen, l->addr,
1952 &l->mon_state, l->bearer_id);
1954 /* Send NACK if peer has sent pkts we haven't received yet */
1955 if (more(peers_snd_nxt, rcv_nxt) && !tipc_link_is_synching(l))
1956 rcvgap = peers_snd_nxt - l->rcv_nxt;
1957 if (rcvgap || reply)
1958 tipc_link_build_proto_msg(l, STATE_MSG, 0, reply,
1959 rcvgap, 0, 0, xmitq);
1961 rc |= tipc_link_advance_transmq(l, ack, gap, ga, xmitq);
1963 /* If NACK, retransmit will now start at right position */
1965 l->stats.recv_nacks++;
1967 tipc_link_advance_backlog(l, xmitq);
1968 if (unlikely(!skb_queue_empty(&l->wakeupq)))
1969 link_prepare_wakeup(l);
1976 /* tipc_link_build_bc_proto_msg() - create broadcast protocol message
1978 static bool tipc_link_build_bc_proto_msg(struct tipc_link *l, bool bcast,
1980 struct sk_buff_head *xmitq)
1982 struct sk_buff *skb;
1983 struct tipc_msg *hdr;
1984 struct sk_buff *dfrd_skb = skb_peek(&l->deferdq);
1985 u16 ack = l->rcv_nxt - 1;
1986 u16 gap_to = peers_snd_nxt - 1;
1988 skb = tipc_msg_create(BCAST_PROTOCOL, STATE_MSG, INT_H_SIZE,
1989 0, l->addr, tipc_own_addr(l->net), 0, 0, 0);
1993 msg_set_last_bcast(hdr, l->bc_sndlink->snd_nxt - 1);
1994 msg_set_bcast_ack(hdr, ack);
1995 msg_set_bcgap_after(hdr, ack);
1997 gap_to = buf_seqno(dfrd_skb) - 1;
1998 msg_set_bcgap_to(hdr, gap_to);
1999 msg_set_non_seq(hdr, bcast);
2000 __skb_queue_tail(xmitq, skb);
2004 /* tipc_link_build_bc_init_msg() - synchronize broadcast link endpoints.
2006 * Give a newly added peer node the sequence number where it should
2007 * start receiving and acking broadcast packets.
2009 static void tipc_link_build_bc_init_msg(struct tipc_link *l,
2010 struct sk_buff_head *xmitq)
2012 struct sk_buff_head list;
2014 __skb_queue_head_init(&list);
2015 if (!tipc_link_build_bc_proto_msg(l->bc_rcvlink, false, 0, &list))
2017 msg_set_bc_ack_invalid(buf_msg(skb_peek(&list)), true);
2018 tipc_link_xmit(l, &list, xmitq);
2021 /* tipc_link_bc_init_rcv - receive initial broadcast synch data from peer
2023 void tipc_link_bc_init_rcv(struct tipc_link *l, struct tipc_msg *hdr)
2025 int mtyp = msg_type(hdr);
2026 u16 peers_snd_nxt = msg_bc_snd_nxt(hdr);
2031 if (msg_user(hdr) == BCAST_PROTOCOL) {
2032 l->rcv_nxt = peers_snd_nxt;
2033 l->state = LINK_ESTABLISHED;
2037 if (l->peer_caps & TIPC_BCAST_SYNCH)
2040 if (msg_peer_node_is_up(hdr))
2043 /* Compatibility: accept older, less safe initial synch data */
2044 if ((mtyp == RESET_MSG) || (mtyp == ACTIVATE_MSG))
2045 l->rcv_nxt = peers_snd_nxt;
2048 /* tipc_link_bc_sync_rcv - update rcv link according to peer's send state
2050 int tipc_link_bc_sync_rcv(struct tipc_link *l, struct tipc_msg *hdr,
2051 struct sk_buff_head *xmitq)
2053 struct tipc_link *snd_l = l->bc_sndlink;
2054 u16 peers_snd_nxt = msg_bc_snd_nxt(hdr);
2055 u16 from = msg_bcast_ack(hdr) + 1;
2056 u16 to = from + msg_bc_gap(hdr) - 1;
2062 if (!msg_peer_node_is_up(hdr))
2065 /* Open when peer ackowledges our bcast init msg (pkt #1) */
2067 l->bc_peer_is_up = true;
2069 if (!l->bc_peer_is_up)
2072 l->stats.recv_nacks++;
2074 /* Ignore if peers_snd_nxt goes beyond receive window */
2075 if (more(peers_snd_nxt, l->rcv_nxt + l->window))
2078 rc = tipc_link_bc_retrans(snd_l, l, from, to, xmitq);
2080 l->snd_nxt = peers_snd_nxt;
2081 if (link_bc_rcv_gap(l))
2082 rc |= TIPC_LINK_SND_STATE;
2084 /* Return now if sender supports nack via STATE messages */
2085 if (l->peer_caps & TIPC_BCAST_STATE_NACK)
2088 /* Otherwise, be backwards compatible */
2090 if (!more(peers_snd_nxt, l->rcv_nxt)) {
2091 l->nack_state = BC_NACK_SND_CONDITIONAL;
2095 /* Don't NACK if one was recently sent or peeked */
2096 if (l->nack_state == BC_NACK_SND_SUPPRESS) {
2097 l->nack_state = BC_NACK_SND_UNCONDITIONAL;
2101 /* Conditionally delay NACK sending until next synch rcv */
2102 if (l->nack_state == BC_NACK_SND_CONDITIONAL) {
2103 l->nack_state = BC_NACK_SND_UNCONDITIONAL;
2104 if ((peers_snd_nxt - l->rcv_nxt) < TIPC_MIN_LINK_WIN)
2108 /* Send NACK now but suppress next one */
2109 tipc_link_build_bc_proto_msg(l, true, peers_snd_nxt, xmitq);
2110 l->nack_state = BC_NACK_SND_SUPPRESS;
2114 void tipc_link_bc_ack_rcv(struct tipc_link *l, u16 acked,
2115 struct sk_buff_head *xmitq)
2117 struct sk_buff *skb, *tmp;
2118 struct tipc_link *snd_l = l->bc_sndlink;
2120 if (!link_is_up(l) || !l->bc_peer_is_up)
2123 if (!more(acked, l->acked))
2126 trace_tipc_link_bc_ack(l, l->acked, acked, &snd_l->transmq);
2127 /* Skip over packets peer has already acked */
2128 skb_queue_walk(&snd_l->transmq, skb) {
2129 if (more(buf_seqno(skb), l->acked))
2133 /* Update/release the packets peer is acking now */
2134 skb_queue_walk_from_safe(&snd_l->transmq, skb, tmp) {
2135 if (more(buf_seqno(skb), acked))
2137 if (!--TIPC_SKB_CB(skb)->ackers) {
2138 __skb_unlink(skb, &snd_l->transmq);
2143 tipc_link_advance_backlog(snd_l, xmitq);
2144 if (unlikely(!skb_queue_empty(&snd_l->wakeupq)))
2145 link_prepare_wakeup(snd_l);
2148 /* tipc_link_bc_nack_rcv(): receive broadcast nack message
2149 * This function is here for backwards compatibility, since
2150 * no BCAST_PROTOCOL/STATE messages occur from TIPC v2.5.
2152 int tipc_link_bc_nack_rcv(struct tipc_link *l, struct sk_buff *skb,
2153 struct sk_buff_head *xmitq)
2155 struct tipc_msg *hdr = buf_msg(skb);
2156 u32 dnode = msg_destnode(hdr);
2157 int mtyp = msg_type(hdr);
2158 u16 acked = msg_bcast_ack(hdr);
2159 u16 from = acked + 1;
2160 u16 to = msg_bcgap_to(hdr);
2161 u16 peers_snd_nxt = to + 1;
2166 if (!tipc_link_is_up(l) || !l->bc_peer_is_up)
2169 if (mtyp != STATE_MSG)
2172 if (dnode == tipc_own_addr(l->net)) {
2173 tipc_link_bc_ack_rcv(l, acked, xmitq);
2174 rc = tipc_link_bc_retrans(l->bc_sndlink, l, from, to, xmitq);
2175 l->stats.recv_nacks++;
2179 /* Msg for other node => suppress own NACK at next sync if applicable */
2180 if (more(peers_snd_nxt, l->rcv_nxt) && !less(l->rcv_nxt, from))
2181 l->nack_state = BC_NACK_SND_SUPPRESS;
2186 void tipc_link_set_queue_limits(struct tipc_link *l, u32 win)
2188 int max_bulk = TIPC_MAX_PUBL / (l->mtu / ITEM_SIZE);
2191 l->backlog[TIPC_LOW_IMPORTANCE].limit = max_t(u16, 50, win);
2192 l->backlog[TIPC_MEDIUM_IMPORTANCE].limit = max_t(u16, 100, win * 2);
2193 l->backlog[TIPC_HIGH_IMPORTANCE].limit = max_t(u16, 150, win * 3);
2194 l->backlog[TIPC_CRITICAL_IMPORTANCE].limit = max_t(u16, 200, win * 4);
2195 l->backlog[TIPC_SYSTEM_IMPORTANCE].limit = max_bulk;
2199 * link_reset_stats - reset link statistics
2200 * @l: pointer to link
2202 void tipc_link_reset_stats(struct tipc_link *l)
2204 memset(&l->stats, 0, sizeof(l->stats));
2207 static void link_print(struct tipc_link *l, const char *str)
2209 struct sk_buff *hskb = skb_peek(&l->transmq);
2210 u16 head = hskb ? msg_seqno(buf_msg(hskb)) : l->snd_nxt - 1;
2211 u16 tail = l->snd_nxt - 1;
2213 pr_info("%s Link <%s> state %x\n", str, l->name, l->state);
2214 pr_info("XMTQ: %u [%u-%u], BKLGQ: %u, SNDNX: %u, RCVNX: %u\n",
2215 skb_queue_len(&l->transmq), head, tail,
2216 skb_queue_len(&l->backlogq), l->snd_nxt, l->rcv_nxt);
2219 /* Parse and validate nested (link) properties valid for media, bearer and link
2221 int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[])
2225 err = nla_parse_nested_deprecated(props, TIPC_NLA_PROP_MAX, prop,
2226 tipc_nl_prop_policy, NULL);
2230 if (props[TIPC_NLA_PROP_PRIO]) {
2233 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
2234 if (prio > TIPC_MAX_LINK_PRI)
2238 if (props[TIPC_NLA_PROP_TOL]) {
2241 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
2242 if ((tol < TIPC_MIN_LINK_TOL) || (tol > TIPC_MAX_LINK_TOL))
2246 if (props[TIPC_NLA_PROP_WIN]) {
2249 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2250 if ((win < TIPC_MIN_LINK_WIN) || (win > TIPC_MAX_LINK_WIN))
2257 static int __tipc_nl_add_stats(struct sk_buff *skb, struct tipc_stats *s)
2260 struct nlattr *stats;
2267 struct nla_map map[] = {
2268 {TIPC_NLA_STATS_RX_INFO, 0},
2269 {TIPC_NLA_STATS_RX_FRAGMENTS, s->recv_fragments},
2270 {TIPC_NLA_STATS_RX_FRAGMENTED, s->recv_fragmented},
2271 {TIPC_NLA_STATS_RX_BUNDLES, s->recv_bundles},
2272 {TIPC_NLA_STATS_RX_BUNDLED, s->recv_bundled},
2273 {TIPC_NLA_STATS_TX_INFO, 0},
2274 {TIPC_NLA_STATS_TX_FRAGMENTS, s->sent_fragments},
2275 {TIPC_NLA_STATS_TX_FRAGMENTED, s->sent_fragmented},
2276 {TIPC_NLA_STATS_TX_BUNDLES, s->sent_bundles},
2277 {TIPC_NLA_STATS_TX_BUNDLED, s->sent_bundled},
2278 {TIPC_NLA_STATS_MSG_PROF_TOT, (s->msg_length_counts) ?
2279 s->msg_length_counts : 1},
2280 {TIPC_NLA_STATS_MSG_LEN_CNT, s->msg_length_counts},
2281 {TIPC_NLA_STATS_MSG_LEN_TOT, s->msg_lengths_total},
2282 {TIPC_NLA_STATS_MSG_LEN_P0, s->msg_length_profile[0]},
2283 {TIPC_NLA_STATS_MSG_LEN_P1, s->msg_length_profile[1]},
2284 {TIPC_NLA_STATS_MSG_LEN_P2, s->msg_length_profile[2]},
2285 {TIPC_NLA_STATS_MSG_LEN_P3, s->msg_length_profile[3]},
2286 {TIPC_NLA_STATS_MSG_LEN_P4, s->msg_length_profile[4]},
2287 {TIPC_NLA_STATS_MSG_LEN_P5, s->msg_length_profile[5]},
2288 {TIPC_NLA_STATS_MSG_LEN_P6, s->msg_length_profile[6]},
2289 {TIPC_NLA_STATS_RX_STATES, s->recv_states},
2290 {TIPC_NLA_STATS_RX_PROBES, s->recv_probes},
2291 {TIPC_NLA_STATS_RX_NACKS, s->recv_nacks},
2292 {TIPC_NLA_STATS_RX_DEFERRED, s->deferred_recv},
2293 {TIPC_NLA_STATS_TX_STATES, s->sent_states},
2294 {TIPC_NLA_STATS_TX_PROBES, s->sent_probes},
2295 {TIPC_NLA_STATS_TX_NACKS, s->sent_nacks},
2296 {TIPC_NLA_STATS_TX_ACKS, s->sent_acks},
2297 {TIPC_NLA_STATS_RETRANSMITTED, s->retransmitted},
2298 {TIPC_NLA_STATS_DUPLICATES, s->duplicates},
2299 {TIPC_NLA_STATS_LINK_CONGS, s->link_congs},
2300 {TIPC_NLA_STATS_MAX_QUEUE, s->max_queue_sz},
2301 {TIPC_NLA_STATS_AVG_QUEUE, s->queue_sz_counts ?
2302 (s->accu_queue_sz / s->queue_sz_counts) : 0}
2305 stats = nla_nest_start_noflag(skb, TIPC_NLA_LINK_STATS);
2309 for (i = 0; i < ARRAY_SIZE(map); i++)
2310 if (nla_put_u32(skb, map[i].key, map[i].val))
2313 nla_nest_end(skb, stats);
2317 nla_nest_cancel(skb, stats);
2322 /* Caller should hold appropriate locks to protect the link */
2323 int __tipc_nl_add_link(struct net *net, struct tipc_nl_msg *msg,
2324 struct tipc_link *link, int nlflags)
2326 u32 self = tipc_own_addr(net);
2327 struct nlattr *attrs;
2328 struct nlattr *prop;
2332 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2333 nlflags, TIPC_NL_LINK_GET);
2337 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_LINK);
2341 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, link->name))
2343 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_DEST, tipc_cluster_mask(self)))
2345 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_MTU, link->mtu))
2347 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, link->stats.recv_pkts))
2349 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, link->stats.sent_pkts))
2352 if (tipc_link_is_up(link))
2353 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
2356 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_ACTIVE))
2359 prop = nla_nest_start_noflag(msg->skb, TIPC_NLA_LINK_PROP);
2362 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
2364 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_TOL, link->tolerance))
2366 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN,
2369 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
2371 nla_nest_end(msg->skb, prop);
2373 err = __tipc_nl_add_stats(msg->skb, &link->stats);
2377 nla_nest_end(msg->skb, attrs);
2378 genlmsg_end(msg->skb, hdr);
2383 nla_nest_cancel(msg->skb, prop);
2385 nla_nest_cancel(msg->skb, attrs);
2387 genlmsg_cancel(msg->skb, hdr);
2392 static int __tipc_nl_add_bc_link_stat(struct sk_buff *skb,
2393 struct tipc_stats *stats)
2396 struct nlattr *nest;
2403 struct nla_map map[] = {
2404 {TIPC_NLA_STATS_RX_INFO, stats->recv_pkts},
2405 {TIPC_NLA_STATS_RX_FRAGMENTS, stats->recv_fragments},
2406 {TIPC_NLA_STATS_RX_FRAGMENTED, stats->recv_fragmented},
2407 {TIPC_NLA_STATS_RX_BUNDLES, stats->recv_bundles},
2408 {TIPC_NLA_STATS_RX_BUNDLED, stats->recv_bundled},
2409 {TIPC_NLA_STATS_TX_INFO, stats->sent_pkts},
2410 {TIPC_NLA_STATS_TX_FRAGMENTS, stats->sent_fragments},
2411 {TIPC_NLA_STATS_TX_FRAGMENTED, stats->sent_fragmented},
2412 {TIPC_NLA_STATS_TX_BUNDLES, stats->sent_bundles},
2413 {TIPC_NLA_STATS_TX_BUNDLED, stats->sent_bundled},
2414 {TIPC_NLA_STATS_RX_NACKS, stats->recv_nacks},
2415 {TIPC_NLA_STATS_RX_DEFERRED, stats->deferred_recv},
2416 {TIPC_NLA_STATS_TX_NACKS, stats->sent_nacks},
2417 {TIPC_NLA_STATS_TX_ACKS, stats->sent_acks},
2418 {TIPC_NLA_STATS_RETRANSMITTED, stats->retransmitted},
2419 {TIPC_NLA_STATS_DUPLICATES, stats->duplicates},
2420 {TIPC_NLA_STATS_LINK_CONGS, stats->link_congs},
2421 {TIPC_NLA_STATS_MAX_QUEUE, stats->max_queue_sz},
2422 {TIPC_NLA_STATS_AVG_QUEUE, stats->queue_sz_counts ?
2423 (stats->accu_queue_sz / stats->queue_sz_counts) : 0}
2426 nest = nla_nest_start_noflag(skb, TIPC_NLA_LINK_STATS);
2430 for (i = 0; i < ARRAY_SIZE(map); i++)
2431 if (nla_put_u32(skb, map[i].key, map[i].val))
2434 nla_nest_end(skb, nest);
2438 nla_nest_cancel(skb, nest);
2443 int tipc_nl_add_bc_link(struct net *net, struct tipc_nl_msg *msg)
2447 struct nlattr *attrs;
2448 struct nlattr *prop;
2449 struct tipc_net *tn = net_generic(net, tipc_net_id);
2450 u32 bc_mode = tipc_bcast_get_broadcast_mode(net);
2451 u32 bc_ratio = tipc_bcast_get_broadcast_ratio(net);
2452 struct tipc_link *bcl = tn->bcl;
2457 tipc_bcast_lock(net);
2459 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2460 NLM_F_MULTI, TIPC_NL_LINK_GET);
2462 tipc_bcast_unlock(net);
2466 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_LINK);
2470 /* The broadcast link is always up */
2471 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
2474 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_BROADCAST))
2476 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, bcl->name))
2478 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, 0))
2480 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, 0))
2483 prop = nla_nest_start_noflag(msg->skb, TIPC_NLA_LINK_PROP);
2486 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, bcl->window))
2488 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_BROADCAST, bc_mode))
2490 if (bc_mode & BCLINK_MODE_SEL)
2491 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_BROADCAST_RATIO,
2494 nla_nest_end(msg->skb, prop);
2496 err = __tipc_nl_add_bc_link_stat(msg->skb, &bcl->stats);
2500 tipc_bcast_unlock(net);
2501 nla_nest_end(msg->skb, attrs);
2502 genlmsg_end(msg->skb, hdr);
2507 nla_nest_cancel(msg->skb, prop);
2509 nla_nest_cancel(msg->skb, attrs);
2511 tipc_bcast_unlock(net);
2512 genlmsg_cancel(msg->skb, hdr);
2517 void tipc_link_set_tolerance(struct tipc_link *l, u32 tol,
2518 struct sk_buff_head *xmitq)
2522 l->bc_rcvlink->tolerance = tol;
2524 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, tol, 0, xmitq);
2527 void tipc_link_set_prio(struct tipc_link *l, u32 prio,
2528 struct sk_buff_head *xmitq)
2531 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, prio, xmitq);
2534 void tipc_link_set_abort_limit(struct tipc_link *l, u32 limit)
2536 l->abort_limit = limit;
2539 char *tipc_link_name_ext(struct tipc_link *l, char *buf)
2542 scnprintf(buf, TIPC_MAX_LINK_NAME, "null");
2543 else if (link_is_bc_sndlink(l))
2544 scnprintf(buf, TIPC_MAX_LINK_NAME, "broadcast-sender");
2545 else if (link_is_bc_rcvlink(l))
2546 scnprintf(buf, TIPC_MAX_LINK_NAME,
2547 "broadcast-receiver, peer %x", l->addr);
2549 memcpy(buf, l->name, TIPC_MAX_LINK_NAME);
2555 * tipc_link_dump - dump TIPC link data
2556 * @l: tipc link to be dumped
2557 * @dqueues: bitmask to decide if any link queue to be dumped?
2558 * - TIPC_DUMP_NONE: don't dump link queues
2559 * - TIPC_DUMP_TRANSMQ: dump link transmq queue
2560 * - TIPC_DUMP_BACKLOGQ: dump link backlog queue
2561 * - TIPC_DUMP_DEFERDQ: dump link deferd queue
2562 * - TIPC_DUMP_INPUTQ: dump link input queue
2563 * - TIPC_DUMP_WAKEUP: dump link wakeup queue
2564 * - TIPC_DUMP_ALL: dump all the link queues above
2565 * @buf: returned buffer of dump data in format
2567 int tipc_link_dump(struct tipc_link *l, u16 dqueues, char *buf)
2570 size_t sz = (dqueues) ? LINK_LMAX : LINK_LMIN;
2571 struct sk_buff_head *list;
2572 struct sk_buff *hskb, *tskb;
2576 i += scnprintf(buf, sz, "link data: (null)\n");
2580 i += scnprintf(buf, sz, "link data: %x", l->addr);
2581 i += scnprintf(buf + i, sz - i, " %x", l->state);
2582 i += scnprintf(buf + i, sz - i, " %u", l->in_session);
2583 i += scnprintf(buf + i, sz - i, " %u", l->session);
2584 i += scnprintf(buf + i, sz - i, " %u", l->peer_session);
2585 i += scnprintf(buf + i, sz - i, " %u", l->snd_nxt);
2586 i += scnprintf(buf + i, sz - i, " %u", l->rcv_nxt);
2587 i += scnprintf(buf + i, sz - i, " %u", l->snd_nxt_state);
2588 i += scnprintf(buf + i, sz - i, " %u", l->rcv_nxt_state);
2589 i += scnprintf(buf + i, sz - i, " %x", l->peer_caps);
2590 i += scnprintf(buf + i, sz - i, " %u", l->silent_intv_cnt);
2591 i += scnprintf(buf + i, sz - i, " %u", l->rst_cnt);
2592 i += scnprintf(buf + i, sz - i, " %u", 0);
2593 i += scnprintf(buf + i, sz - i, " %u", 0);
2594 i += scnprintf(buf + i, sz - i, " %u", l->acked);
2597 len = skb_queue_len(list);
2598 hskb = skb_peek(list);
2599 tskb = skb_peek_tail(list);
2600 i += scnprintf(buf + i, sz - i, " | %u %u %u", len,
2601 (hskb) ? msg_seqno(buf_msg(hskb)) : 0,
2602 (tskb) ? msg_seqno(buf_msg(tskb)) : 0);
2605 len = skb_queue_len(list);
2606 hskb = skb_peek(list);
2607 tskb = skb_peek_tail(list);
2608 i += scnprintf(buf + i, sz - i, " | %u %u %u", len,
2609 (hskb) ? msg_seqno(buf_msg(hskb)) : 0,
2610 (tskb) ? msg_seqno(buf_msg(tskb)) : 0);
2612 list = &l->backlogq;
2613 len = skb_queue_len(list);
2614 hskb = skb_peek(list);
2615 tskb = skb_peek_tail(list);
2616 i += scnprintf(buf + i, sz - i, " | %u %u %u", len,
2617 (hskb) ? msg_seqno(buf_msg(hskb)) : 0,
2618 (tskb) ? msg_seqno(buf_msg(tskb)) : 0);
2621 len = skb_queue_len(list);
2622 hskb = skb_peek(list);
2623 tskb = skb_peek_tail(list);
2624 i += scnprintf(buf + i, sz - i, " | %u %u %u\n", len,
2625 (hskb) ? msg_seqno(buf_msg(hskb)) : 0,
2626 (tskb) ? msg_seqno(buf_msg(tskb)) : 0);
2628 if (dqueues & TIPC_DUMP_TRANSMQ) {
2629 i += scnprintf(buf + i, sz - i, "transmq: ");
2630 i += tipc_list_dump(&l->transmq, false, buf + i);
2632 if (dqueues & TIPC_DUMP_BACKLOGQ) {
2633 i += scnprintf(buf + i, sz - i,
2634 "backlogq: <%u %u %u %u %u>, ",
2635 l->backlog[TIPC_LOW_IMPORTANCE].len,
2636 l->backlog[TIPC_MEDIUM_IMPORTANCE].len,
2637 l->backlog[TIPC_HIGH_IMPORTANCE].len,
2638 l->backlog[TIPC_CRITICAL_IMPORTANCE].len,
2639 l->backlog[TIPC_SYSTEM_IMPORTANCE].len);
2640 i += tipc_list_dump(&l->backlogq, false, buf + i);
2642 if (dqueues & TIPC_DUMP_DEFERDQ) {
2643 i += scnprintf(buf + i, sz - i, "deferdq: ");
2644 i += tipc_list_dump(&l->deferdq, false, buf + i);
2646 if (dqueues & TIPC_DUMP_INPUTQ) {
2647 i += scnprintf(buf + i, sz - i, "inputq: ");
2648 i += tipc_list_dump(l->inputq, false, buf + i);
2650 if (dqueues & TIPC_DUMP_WAKEUP) {
2651 i += scnprintf(buf + i, sz - i, "wakeup: ");
2652 i += tipc_list_dump(&l->wakeupq, false, buf + i);