projects / linux-block.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
9p: Remove INET dependency
[linux-block.git] / net / tipc / link.c
CommitLineData
b97bf3fd
PL		 1/*
2 * net/tipc/link.c: TIPC link code
c4307285 3 *
e74a386d 4 * Copyright (c) 1996-2007, 2012-2016, Ericsson AB
198d73b8 5 * Copyright (c) 2004-2007, 2010-2013, Wind River Systems
b97bf3fd
PL		 6 * All rights reserved.
7 *
9ea1fd3c 8 * Redistribution and use in source and binary forms, with or without
b97bf3fd
PL		 9 * modification, are permitted provided that the following conditions are met:
10 *
9ea1fd3c
PL		 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.
b97bf3fd 19 *
9ea1fd3c
PL		 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.
23 *
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
b97bf3fd
PL		 34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
e3eea1eb 38#include "subscr.h"
b97bf3fd 39#include "link.h"
7be57fc6 40#include "bcast.h"
9816f061 41#include "socket.h"
b97bf3fd 42#include "name_distr.h"
b97bf3fd 43#include "discover.h"
0655f6a8 44#include "netlink.h"
35c55c98 45#include "monitor.h"
b4b9771b 46#include "trace.h"
fc1b6d6d 47#include "crypto.h"
b97bf3fd 48
796c75d0
YX		 49#include <linux/pkt_sched.h>
50
38206d59 51struct tipc_stats {
95901122
JPM		 52 u32 sent_pkts;
53 u32 recv_pkts;
38206d59
JPM		 54 u32 sent_states;
55 u32 recv_states;
56 u32 sent_probes;
57 u32 recv_probes;
58 u32 sent_nacks;
59 u32 recv_nacks;
60 u32 sent_acks;
61 u32 sent_bundled;
62 u32 sent_bundles;
63 u32 recv_bundled;
64 u32 recv_bundles;
65 u32 retransmitted;
66 u32 sent_fragmented;
67 u32 sent_fragments;
68 u32 recv_fragmented;
69 u32 recv_fragments;
70 u32 link_congs; /* # port sends blocked by congestion */
71 u32 deferred_recv;
72 u32 duplicates;
73 u32 max_queue_sz; /* send queue size high water mark */
74 u32 accu_queue_sz; /* used for send queue size profiling */
75 u32 queue_sz_counts; /* used for send queue size profiling */
76 u32 msg_length_counts; /* used for message length profiling */
77 u32 msg_lengths_total; /* used for message length profiling */
78 u32 msg_length_profile[7]; /* used for msg. length profiling */
79};
80
81/**
82 * struct tipc_link - TIPC link data structure
83 * @addr: network address of link's peer node
84 * @name: link name character string
85 * @media_addr: media address to use when sending messages over link
86 * @timer: link timer
87 * @net: pointer to namespace struct
88 * @refcnt: reference counter for permanent references (owner node & timer)
89 * @peer_session: link session # being used by peer end of link
90 * @peer_bearer_id: bearer id used by link's peer endpoint
91 * @bearer_id: local bearer id used by link
92 * @tolerance: minimum link continuity loss needed to reset link [in ms]
38206d59
JPM		 93 * @abort_limit: # of unacknowledged continuity probes needed to reset link
94 * @state: current state of link FSM
95 * @peer_caps: bitmap describing capabilities of peer node
96 * @silent_intv_cnt: # of timer intervals without any reception from peer
97 * @proto_msg: template for control messages generated by link
98 * @pmsg: convenience pointer to "proto_msg" field
99 * @priority: current link priority
100 * @net_plane: current link network plane ('A' through 'H')
35c55c98 101 * @mon_state: cookie with information needed by link monitor
38206d59
JPM		 102 * @backlog_limit: backlog queue congestion thresholds (indexed by importance)
103 * @exp_msg_count: # of tunnelled messages expected during link changeover
104 * @reset_rcv_checkpt: seq # of last acknowledged message at time of link reset
105 * @mtu: current maximum packet size for this link
106 * @advertised_mtu: advertised own mtu when link is being established
107 * @transmitq: queue for sent, non-acked messages
108 * @backlogq: queue for messages waiting to be sent
109 * @snt_nxt: next sequence number to use for outbound messages
38206d59
JPM		 110 * @ackers: # of peers that needs to ack each packet before it can be released
111 * @acked: # last packet acked by a certain peer. Used for broadcast.
112 * @rcv_nxt: next sequence number to expect for inbound messages
113 * @deferred_queue: deferred queue saved OOS b'cast message received from node
114 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer
115 * @inputq: buffer queue for messages to be delivered upwards
116 * @namedq: buffer queue for name table messages to be delivered upwards
117 * @next_out: ptr to first unsent outbound message in queue
118 * @wakeupq: linked list of wakeup msgs waiting for link congestion to abate
119 * @long_msg_seq_no: next identifier to use for outbound fragmented messages
120 * @reasm_buf: head of partially reassembled inbound message fragments
121 * @bc_rcvr: marks that this is a broadcast receiver link
122 * @stats: collects statistics regarding link activity
a99df449
RD		 123 * @session: session to be used by link
124 * @snd_nxt_state: next send seq number
125 * @rcv_nxt_state: next rcv seq number
126 * @in_session: have received ACTIVATE_MSG from peer
127 * @active: link is active
128 * @if_name: associated interface name
129 * @rst_cnt: link reset counter
130 * @drop_point: seq number for failover handling (FIXME)
131 * @failover_reasm_skb: saved failover msg ptr (FIXME)
132 * @failover_deferdq: deferred message queue for failover processing (FIXME)
133 * @transmq: the link's transmit queue
134 * @backlog: link's backlog by priority (importance)
135 * @snd_nxt: next sequence number to be used
136 * @rcv_unacked: # messages read by user, but not yet acked back to peer
137 * @deferdq: deferred receive queue
138 * @window: sliding window size for congestion handling
139 * @min_win: minimal send window to be used by link
140 * @ssthresh: slow start threshold for congestion handling
141 * @max_win: maximal send window to be used by link
142 * @cong_acks: congestion acks for congestion avoidance (FIXME)
143 * @checkpoint: seq number for congestion window size handling
144 * @reasm_tnlmsg: fragmentation/reassembly area for tunnel protocol message
145 * @last_gap: last gap ack blocks for bcast (FIXME)
146 * @last_ga: ptr to gap ack blocks
147 * @bc_rcvlink: the peer specific link used for broadcast reception
148 * @bc_sndlink: the namespace global link used for broadcast sending
149 * @nack_state: bcast nack state
150 * @bc_peer_is_up: peer has acked the bcast init msg
38206d59
JPM		 151 */
152struct tipc_link {
153 u32 addr;
154 char name[TIPC_MAX_LINK_NAME];
38206d59
JPM		 155 struct net *net;
156
157 /* Management and link supervision data */
7ea817f4
JM		 158 u16 peer_session;
159 u16 session;
9012de50
JM		 160 u16 snd_nxt_state;
161 u16 rcv_nxt_state;
38206d59
JPM		 162 u32 peer_bearer_id;
163 u32 bearer_id;
164 u32 tolerance;
38206d59
JPM		 165 u32 abort_limit;
166 u32 state;
167 u16 peer_caps;
7ea817f4 168 bool in_session;
38206d59
JPM		 169 bool active;
170 u32 silent_intv_cnt;
e74a386d 171 char if_name[TIPC_MAX_IF_NAME];
38206d59
JPM		 172 u32 priority;
173 char net_plane;
35c55c98 174 struct tipc_mon_state mon_state;
88e8ac70 175 u16 rst_cnt;
38206d59
JPM		 176
177 /* Failover/synch */
178 u16 drop_point;
179 struct sk_buff *failover_reasm_skb;
58ee86b8 180 struct sk_buff_head failover_deferdq;
38206d59
JPM		 181
182 /* Max packet negotiation */
183 u16 mtu;
184 u16 advertised_mtu;
185
186 /* Sending */
187 struct sk_buff_head transmq;
188 struct sk_buff_head backlogq;
189 struct {
190 u16 len;
191 u16 limit;
e95584a8 192 struct sk_buff *target_bskb;
38206d59
JPM		 193 } backlog[5];
194 u16 snd_nxt;
38206d59
JPM		 195
196 /* Reception */
197 u16 rcv_nxt;
198 u32 rcv_unacked;
199 struct sk_buff_head deferdq;
200 struct sk_buff_head *inputq;
201 struct sk_buff_head *namedq;
202
203 /* Congestion handling */
204 struct sk_buff_head wakeupq;
16ad3f40
JM		 205 u16 window;
206 u16 min_win;
207 u16 ssthresh;
208 u16 max_win;
209 u16 cong_acks;
210 u16 checkpoint;
38206d59
JPM		 211
212 /* Fragmentation/reassembly */
213 struct sk_buff *reasm_buf;
2320bcda 214 struct sk_buff *reasm_tnlmsg;
38206d59
JPM		 215
216 /* Broadcast */
217 u16 ackers;
218 u16 acked;
d7626b5a
TL		 219 u16 last_gap;
220 struct tipc_gap_ack_blks *last_ga;
38206d59
JPM		 221 struct tipc_link *bc_rcvlink;
222 struct tipc_link *bc_sndlink;
7c4a54b9 223 u8 nack_state;
38206d59
JPM		 224 bool bc_peer_is_up;
225
226 /* Statistics */
227 struct tipc_stats stats;
228};
229
2cf8aa19
EH		 230/*
231 * Error message prefixes
232 */
6e498158 233static const char *link_co_err = "Link tunneling error, ";
2cf8aa19 234static const char *link_rst_msg = "Resetting link ";
7be57fc6 235
52666986
JPM		 236/* Send states for broadcast NACKs
237 */
238enum {
239 BC_NACK_SND_CONDITIONAL,
240 BC_NACK_SND_UNCONDITIONAL,
241 BC_NACK_SND_SUPPRESS,
242};
243
53962bce 244#define TIPC_BC_RETR_LIM (jiffies + msecs_to_jiffies(10))
382f598f 245#define TIPC_UC_RETR_TIME (jiffies + msecs_to_jiffies(1))
7c4a54b9 246
662921cd 247/* Link FSM states:
b97bf3fd 248 */
d3504c34 249enum {
662921cd
JPM		 250 LINK_ESTABLISHED = 0xe,
251 LINK_ESTABLISHING = 0xe << 4,
252 LINK_RESET = 0x1 << 8,
253 LINK_RESETTING = 0x2 << 12,
254 LINK_PEER_RESET = 0xd << 16,
255 LINK_FAILINGOVER = 0xf << 20,
256 LINK_SYNCHING = 0xc << 24
d3504c34
JPM		 257};
258
259/* Link FSM state checking routines
260 */
662921cd 261static int link_is_up(struct tipc_link *l)
d3504c34 262{
662921cd 263 return l->state & (LINK_ESTABLISHED | LINK_SYNCHING);
d3504c34 264}
b97bf3fd 265
d999297c
JPM		 266static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb,
267 struct sk_buff_head *xmitq);
426cc2b8 268static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe,
8d6e79d3
JM		 269 bool probe_reply, u16 rcvgap,
270 int tolerance, int priority,
426cc2b8 271 struct sk_buff_head *xmitq);
1a90632d 272static void link_print(struct tipc_link *l, const char *str);
e0a05ebe
JPM		 273static int tipc_link_build_nack_msg(struct tipc_link *l,
274 struct sk_buff_head *xmitq);
52666986
JPM		 275static void tipc_link_build_bc_init_msg(struct tipc_link *l,
276 struct sk_buff_head *xmitq);
d7626b5a
TL		 277static u8 __tipc_build_gap_ack_blks(struct tipc_gap_ack_blks *ga,
278 struct tipc_link *l, u8 start_index);
279static u16 tipc_build_gap_ack_blks(struct tipc_link *l, struct tipc_msg *hdr);
280static int tipc_link_advance_transmq(struct tipc_link *l, struct tipc_link *r,
281 u16 acked, u16 gap,
6a6b5c8b 282 struct tipc_gap_ack_blks *ga,
d7626b5a
TL		 283 struct sk_buff_head *xmitq,
284 bool *retransmitted, int *rc);
16ad3f40
JM		 285static void tipc_link_update_cwin(struct tipc_link *l, int released,
286 bool retransmitted);
b97bf3fd 287/*
05790c64 288 * Simple non-static link routines (i.e. referenced outside this file)
b97bf3fd 289 */
662921cd 290bool tipc_link_is_up(struct tipc_link *l)
b97bf3fd 291{
662921cd
JPM		 292 return link_is_up(l);
293}
294
c8199300
JPM		 295bool tipc_link_peer_is_down(struct tipc_link *l)
296{
297 return l->state == LINK_PEER_RESET;
298}
299
662921cd
JPM		 300bool tipc_link_is_reset(struct tipc_link *l)
301{
302 return l->state & (LINK_RESET | LINK_FAILINGOVER | LINK_ESTABLISHING);
303}
304
73f646ce
JPM		 305bool tipc_link_is_establishing(struct tipc_link *l)
306{
307 return l->state == LINK_ESTABLISHING;
308}
309
662921cd
JPM		 310bool tipc_link_is_synching(struct tipc_link *l)
311{
312 return l->state == LINK_SYNCHING;
313}
314
315bool tipc_link_is_failingover(struct tipc_link *l)
316{
317 return l->state == LINK_FAILINGOVER;
318}
319
320bool tipc_link_is_blocked(struct tipc_link *l)
321{
322 return l->state & (LINK_RESETTING | LINK_PEER_RESET | LINK_FAILINGOVER);
b97bf3fd
PL		 323}
324
742e0383 325static bool link_is_bc_sndlink(struct tipc_link *l)
52666986
JPM		 326{
327 return !l->bc_sndlink;
328}
329
742e0383 330static bool link_is_bc_rcvlink(struct tipc_link *l)
52666986
JPM		 331{
332 return ((l->bc_rcvlink == l) && !link_is_bc_sndlink(l));
333}
334
c72fa872
JPM		 335void tipc_link_set_active(struct tipc_link *l, bool active)
336{
337 l->active = active;
b97bf3fd
PL		 338}
339
38206d59
JPM		 340u32 tipc_link_id(struct tipc_link *l)
341{
342 return l->peer_bearer_id << 16 | l->bearer_id;
343}
344
16ad3f40 345int tipc_link_min_win(struct tipc_link *l)
38206d59 346{
16ad3f40
JM		 347 return l->min_win;
348}
349
350int tipc_link_max_win(struct tipc_link *l)
351{
352 return l->max_win;
38206d59
JPM		 353}
354
355int tipc_link_prio(struct tipc_link *l)
356{
357 return l->priority;
358}
359
360unsigned long tipc_link_tolerance(struct tipc_link *l)
361{
362 return l->tolerance;
363}
364
365struct sk_buff_head *tipc_link_inputq(struct tipc_link *l)
366{
367 return l->inputq;
368}
369
370char tipc_link_plane(struct tipc_link *l)
371{
372 return l->net_plane;
373}
374
be07f056
XL		 375struct net *tipc_link_net(struct tipc_link *l)
376{
377 return l->net;
378}
379
9012de50
JM		 380void tipc_link_update_caps(struct tipc_link *l, u16 capabilities)
381{
382 l->peer_caps = capabilities;
383}
384
52666986
JPM		 385void tipc_link_add_bc_peer(struct tipc_link *snd_l,
386 struct tipc_link *uc_l,
387 struct sk_buff_head *xmitq)
2f566124 388{
52666986
JPM		 389 struct tipc_link *rcv_l = uc_l->bc_rcvlink;
390
391 snd_l->ackers++;
392 rcv_l->acked = snd_l->snd_nxt - 1;
9a650838 393 snd_l->state = LINK_ESTABLISHED;
52666986 394 tipc_link_build_bc_init_msg(uc_l, xmitq);
2f566124
JPM		 395}
396
52666986
JPM		 397void tipc_link_remove_bc_peer(struct tipc_link *snd_l,
398 struct tipc_link *rcv_l,
399 struct sk_buff_head *xmitq)
2f566124 400{
52666986
JPM		 401 u16 ack = snd_l->snd_nxt - 1;
402
403 snd_l->ackers--;
a71eb720
JPM		 404 rcv_l->bc_peer_is_up = true;
405 rcv_l->state = LINK_ESTABLISHED;
a91d55d1 406 tipc_link_bc_ack_rcv(rcv_l, ack, 0, NULL, xmitq, NULL);
26574db0 407 trace_tipc_link_reset(rcv_l, TIPC_DUMP_ALL, "bclink removed!");
52666986
JPM		 408 tipc_link_reset(rcv_l);
409 rcv_l->state = LINK_RESET;
410 if (!snd_l->ackers) {
26574db0 411 trace_tipc_link_reset(snd_l, TIPC_DUMP_ALL, "zero ackers!");
52666986 412 tipc_link_reset(snd_l);
9a650838 413 snd_l->state = LINK_RESET;
52666986
JPM		 414 __skb_queue_purge(xmitq);
415 }
2f566124
JPM		 416}
417
418int tipc_link_bc_peers(struct tipc_link *l)
419{
420 return l->ackers;
421}
422
e064cce1 423static u16 link_bc_rcv_gap(struct tipc_link *l)
02d11ca2
JPM		 424{
425 struct sk_buff *skb = skb_peek(&l->deferdq);
426 u16 gap = 0;
427
428 if (more(l->snd_nxt, l->rcv_nxt))
429 gap = l->snd_nxt - l->rcv_nxt;
430 if (skb)
431 gap = buf_seqno(skb) - l->rcv_nxt;
432 return gap;
433}
434
959e1781
JPM		 435void tipc_link_set_mtu(struct tipc_link *l, int mtu)
436{
437 l->mtu = mtu;
438}
439
440int tipc_link_mtu(struct tipc_link *l)
441{
442 return l->mtu;
443}
444
fc1b6d6d
TL		 445int tipc_link_mss(struct tipc_link *l)
446{
447#ifdef CONFIG_TIPC_CRYPTO
448 return l->mtu - INT_H_SIZE - EMSG_OVERHEAD;
449#else
450 return l->mtu - INT_H_SIZE;
451#endif
452}
453
38206d59
JPM		 454u16 tipc_link_rcv_nxt(struct tipc_link *l)
455{
456 return l->rcv_nxt;
457}
458
459u16 tipc_link_acked(struct tipc_link *l)
460{
461 return l->acked;
462}
463
464char *tipc_link_name(struct tipc_link *l)
465{
466 return l->name;
467}
468
c140eb16
LDC		 469u32 tipc_link_state(struct tipc_link *l)
470{
471 return l->state;
472}
473
b97bf3fd 474/**
4323add6 475 * tipc_link_create - create a new link
d8141208 476 * @net: pointer to associated network namespace
0e05498e
JPM		 477 * @if_name: associated interface name
478 * @bearer_id: id (index) of associated bearer
479 * @tolerance: link tolerance to be used by link
480 * @net_plane: network plane (A,B,c..) this link belongs to
481 * @mtu: mtu to be advertised by link
482 * @priority: priority to be used by link
16ad3f40
JM		 483 * @min_win: minimal send window to be used by link
484 * @max_win: maximal send window to be used by link
0e05498e 485 * @session: session to be used by link
0e05498e 486 * @peer: node id of peer node
fd556f20 487 * @peer_caps: bitmap describing peer node capabilities
52666986
JPM		 488 * @bc_sndlink: the namespace global link used for broadcast sending
489 * @bc_rcvlink: the peer specific link used for broadcast reception
440d8963
JPM		 490 * @inputq: queue to put messages ready for delivery
491 * @namedq: queue to put binding table update messages ready for delivery
492 * @link: return value, pointer to put the created link
a99df449
RD		 493 * @self: local unicast link id
494 * @peer_id: 128-bit ID of peer
c4307285 495 *
637b77fd 496 * Return: true if link was created, otherwise false
b97bf3fd 497 */
c72fa872 498bool tipc_link_create(struct net *net, char *if_name, int bearer_id,
0e05498e 499 int tolerance, char net_plane, u32 mtu, int priority,
16ad3f40 500 u32 min_win, u32 max_win, u32 session, u32 self,
25b0b9c4 501 u32 peer, u8 *peer_id, u16 peer_caps,
52666986
JPM		 502 struct tipc_link *bc_sndlink,
503 struct tipc_link *bc_rcvlink,
504 struct sk_buff_head *inputq,
505 struct sk_buff_head *namedq,
440d8963 506 struct tipc_link **link)
b97bf3fd 507{
25b0b9c4
JM		 508 char peer_str[NODE_ID_STR_LEN] = {0,};
509 char self_str[NODE_ID_STR_LEN] = {0,};
440d8963 510 struct tipc_link *l;
37b9c08a 511
440d8963
JPM		 512 l = kzalloc(sizeof(*l), GFP_ATOMIC);
513 if (!l)
514 return false;
515 *link = l;
e74a386d 516 l->session = session;
37b9c08a 517
25b0b9c4
JM		 518 /* Set link name for unicast links only */
519 if (peer_id) {
520 tipc_nodeid2string(self_str, tipc_own_id(net));
521 if (strlen(self_str) > 16)
522 sprintf(self_str, "%x", self);
523 tipc_nodeid2string(peer_str, peer_id);
524 if (strlen(peer_str) > 16)
525 sprintf(peer_str, "%x", peer);
526 }
527 /* Peer i/f name will be completed by reset/activate message */
7494cfa6
JM		 528 snprintf(l->name, sizeof(l->name), "%s:%s-%s:unknown",
529 self_str, if_name, peer_str);
25b0b9c4 530
e74a386d 531 strcpy(l->if_name, if_name);
440d8963 532 l->addr = peer;
fd556f20 533 l->peer_caps = peer_caps;
c72fa872 534 l->net = net;
7ea817f4 535 l->in_session = false;
0e05498e
JPM		 536 l->bearer_id = bearer_id;
537 l->tolerance = tolerance;
047491ea
JM		 538 if (bc_rcvlink)
539 bc_rcvlink->tolerance = tolerance;
0e05498e
JPM		 540 l->net_plane = net_plane;
541 l->advertised_mtu = mtu;
542 l->mtu = mtu;
543 l->priority = priority;
16ad3f40 544 tipc_link_set_queue_limits(l, min_win, max_win);
c1ab3f1d 545 l->ackers = 1;
52666986
JPM		 546 l->bc_sndlink = bc_sndlink;
547 l->bc_rcvlink = bc_rcvlink;
440d8963
JPM		 548 l->inputq = inputq;
549 l->namedq = namedq;
550 l->state = LINK_RESETTING;
440d8963
JPM		 551 __skb_queue_head_init(&l->transmq);
552 __skb_queue_head_init(&l->backlogq);
553 __skb_queue_head_init(&l->deferdq);
58ee86b8 554 __skb_queue_head_init(&l->failover_deferdq);
440d8963
JPM		 555 skb_queue_head_init(&l->wakeupq);
556 skb_queue_head_init(l->inputq);
557 return true;
b97bf3fd
PL		 558}
559
32301906
JPM		 560/**
561 * tipc_link_bc_create - create new link to be used for broadcast
d8141208 562 * @net: pointer to associated network namespace
4c94cc2d 563 * @mtu: mtu to be used initially if no peers
2e5117ba
LW		 564 * @min_win: minimal send window to be used by link
565 * @max_win: maximal send window to be used by link
32301906
JPM		 566 * @inputq: queue to put messages ready for delivery
567 * @namedq: queue to put binding table update messages ready for delivery
568 * @link: return value, pointer to put the created link
a99df449
RD		 569 * @ownnode: identity of own node
570 * @peer: node id of peer node
571 * @peer_id: 128-bit ID of peer
572 * @peer_caps: bitmap describing peer node capabilities
573 * @bc_sndlink: the namespace global link used for broadcast sending
32301906 574 *
637b77fd 575 * Return: true if link was created, otherwise false
32301906 576 */
03b6fefd 577bool tipc_link_bc_create(struct net *net, u32 ownnode, u32 peer, u8 *peer_id,
16ad3f40 578 int mtu, u32 min_win, u32 max_win, u16 peer_caps,
32301906
JPM		 579 struct sk_buff_head *inputq,
580 struct sk_buff_head *namedq,
52666986 581 struct tipc_link *bc_sndlink,
32301906
JPM		 582 struct tipc_link **link)
583{
584 struct tipc_link *l;
585
16ad3f40
JM		 586 if (!tipc_link_create(net, "", MAX_BEARERS, 0, 'Z', mtu, 0, min_win,
587 max_win, 0, ownnode, peer, NULL, peer_caps,
588 bc_sndlink, NULL, inputq, namedq, link))
32301906
JPM		 589 return false;
590
591 l = *link;
03b6fefd
TL		 592 if (peer_id) {
593 char peer_str[NODE_ID_STR_LEN] = {0,};
594
595 tipc_nodeid2string(peer_str, peer_id);
596 if (strlen(peer_str) > 16)
597 sprintf(peer_str, "%x", peer);
598 /* Broadcast receiver link name: "broadcast-link:<peer>" */
599 snprintf(l->name, sizeof(l->name), "%s:%s", tipc_bclink_name,
600 peer_str);
601 } else {
602 strcpy(l->name, tipc_bclink_name);
603 }
26574db0 604 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "bclink created!");
32301906 605 tipc_link_reset(l);
52666986 606 l->state = LINK_RESET;
2f566124 607 l->ackers = 0;
52666986 608 l->bc_rcvlink = l;
32301906 609
52666986
JPM		 610 /* Broadcast send link is always up */
611 if (link_is_bc_sndlink(l))
612 l->state = LINK_ESTABLISHED;
d999297c 613
01fd12bb
JPM		 614 /* Disable replicast if even a single peer doesn't support it */
615 if (link_is_bc_rcvlink(l) && !(peer_caps & TIPC_BCAST_RCAST))
ba5f6a86 616 tipc_bcast_toggle_rcast(net, false);
01fd12bb 617
52666986 618 return true;
d999297c
JPM		 619}
620
6ab30f9c
JPM		 621/**
622 * tipc_link_fsm_evt - link finite state machine
623 * @l: pointer to link
624 * @evt: state machine event to be processed
6ab30f9c 625 */
662921cd 626int tipc_link_fsm_evt(struct tipc_link *l, int evt)
6ab30f9c 627{
5045f7b9 628 int rc = 0;
26574db0 629 int old_state = l->state;
6ab30f9c
JPM		 630
631 switch (l->state) {
662921cd 632 case LINK_RESETTING:
6ab30f9c 633 switch (evt) {
662921cd
JPM		 634 case LINK_PEER_RESET_EVT:
635 l->state = LINK_PEER_RESET;
6ab30f9c 636 break;
662921cd
JPM		 637 case LINK_RESET_EVT:
638 l->state = LINK_RESET;
639 break;
640 case LINK_FAILURE_EVT:
641 case LINK_FAILOVER_BEGIN_EVT:
642 case LINK_ESTABLISH_EVT:
643 case LINK_FAILOVER_END_EVT:
644 case LINK_SYNCH_BEGIN_EVT:
645 case LINK_SYNCH_END_EVT:
646 default:
647 goto illegal_evt;
648 }
649 break;
650 case LINK_RESET:
651 switch (evt) {
652 case LINK_PEER_RESET_EVT:
653 l->state = LINK_ESTABLISHING;
6ab30f9c 654 break;
662921cd
JPM		 655 case LINK_FAILOVER_BEGIN_EVT:
656 l->state = LINK_FAILINGOVER;
1c78ba49 657 break;
662921cd
JPM		 658 case LINK_FAILURE_EVT:
659 case LINK_RESET_EVT:
660 case LINK_ESTABLISH_EVT:
661 case LINK_FAILOVER_END_EVT:
6ab30f9c 662 break;
662921cd
JPM		 663 case LINK_SYNCH_BEGIN_EVT:
664 case LINK_SYNCH_END_EVT:
6ab30f9c 665 default:
662921cd 666 goto illegal_evt;
6ab30f9c
JPM		 667 }
668 break;
662921cd 669 case LINK_PEER_RESET:
6ab30f9c 670 switch (evt) {
662921cd
JPM		 671 case LINK_RESET_EVT:
672 l->state = LINK_ESTABLISHING;
6ab30f9c 673 break;
662921cd
JPM		 674 case LINK_PEER_RESET_EVT:
675 case LINK_ESTABLISH_EVT:
676 case LINK_FAILURE_EVT:
6ab30f9c 677 break;
662921cd
JPM		 678 case LINK_SYNCH_BEGIN_EVT:
679 case LINK_SYNCH_END_EVT:
680 case LINK_FAILOVER_BEGIN_EVT:
681 case LINK_FAILOVER_END_EVT:
682 default:
683 goto illegal_evt;
684 }
685 break;
686 case LINK_FAILINGOVER:
687 switch (evt) {
688 case LINK_FAILOVER_END_EVT:
689 l->state = LINK_RESET;
6ab30f9c 690 break;
662921cd
JPM		 691 case LINK_PEER_RESET_EVT:
692 case LINK_RESET_EVT:
693 case LINK_ESTABLISH_EVT:
694 case LINK_FAILURE_EVT:
695 break;
696 case LINK_FAILOVER_BEGIN_EVT:
697 case LINK_SYNCH_BEGIN_EVT:
698 case LINK_SYNCH_END_EVT:
6ab30f9c 699 default:
662921cd 700 goto illegal_evt;
6ab30f9c
JPM		 701 }
702 break;
662921cd 703 case LINK_ESTABLISHING:
6ab30f9c 704 switch (evt) {
662921cd
JPM		 705 case LINK_ESTABLISH_EVT:
706 l->state = LINK_ESTABLISHED;
6ab30f9c 707 break;
662921cd
JPM		 708 case LINK_FAILOVER_BEGIN_EVT:
709 l->state = LINK_FAILINGOVER;
710 break;
662921cd 711 case LINK_RESET_EVT:
73f646ce
JPM		 712 l->state = LINK_RESET;
713 break;
662921cd 714 case LINK_FAILURE_EVT:
73f646ce 715 case LINK_PEER_RESET_EVT:
662921cd
JPM		 716 case LINK_SYNCH_BEGIN_EVT:
717 case LINK_FAILOVER_END_EVT:
718 break;
719 case LINK_SYNCH_END_EVT:
720 default:
721 goto illegal_evt;
722 }
723 break;
724 case LINK_ESTABLISHED:
725 switch (evt) {
726 case LINK_PEER_RESET_EVT:
727 l->state = LINK_PEER_RESET;
728 rc |= TIPC_LINK_DOWN_EVT;
729 break;
730 case LINK_FAILURE_EVT:
731 l->state = LINK_RESETTING;
732 rc |= TIPC_LINK_DOWN_EVT;
6ab30f9c 733 break;
662921cd
JPM		 734 case LINK_RESET_EVT:
735 l->state = LINK_RESET;
6ab30f9c 736 break;
662921cd 737 case LINK_ESTABLISH_EVT:
5ae2f8e6 738 case LINK_SYNCH_END_EVT:
6ab30f9c 739 break;
662921cd
JPM		 740 case LINK_SYNCH_BEGIN_EVT:
741 l->state = LINK_SYNCHING;
742 break;
662921cd
JPM		 743 case LINK_FAILOVER_BEGIN_EVT:
744 case LINK_FAILOVER_END_EVT:
6ab30f9c 745 default:
662921cd 746 goto illegal_evt;
6ab30f9c
JPM		 747 }
748 break;
662921cd 749 case LINK_SYNCHING:
6ab30f9c 750 switch (evt) {
662921cd
JPM		 751 case LINK_PEER_RESET_EVT:
752 l->state = LINK_PEER_RESET;
753 rc |= TIPC_LINK_DOWN_EVT;
754 break;
755 case LINK_FAILURE_EVT:
756 l->state = LINK_RESETTING;
757 rc |= TIPC_LINK_DOWN_EVT;
6ab30f9c 758 break;
662921cd
JPM		 759 case LINK_RESET_EVT:
760 l->state = LINK_RESET;
6ab30f9c 761 break;
662921cd
JPM		 762 case LINK_ESTABLISH_EVT:
763 case LINK_SYNCH_BEGIN_EVT:
6ab30f9c 764 break;
662921cd
JPM		 765 case LINK_SYNCH_END_EVT:
766 l->state = LINK_ESTABLISHED;
767 break;
768 case LINK_FAILOVER_BEGIN_EVT:
769 case LINK_FAILOVER_END_EVT:
6ab30f9c 770 default:
662921cd 771 goto illegal_evt;
6ab30f9c
JPM		 772 }
773 break;
774 default:
662921cd 775 pr_err("Unknown FSM state %x in %s\n", l->state, l->name);
6ab30f9c 776 }
26574db0 777 trace_tipc_link_fsm(l->name, old_state, l->state, evt);
662921cd
JPM		 778 return rc;
779illegal_evt:
780 pr_err("Illegal FSM event %x in state %x on link %s\n",
781 evt, l->state, l->name);
26574db0 782 trace_tipc_link_fsm(l->name, old_state, l->state, evt);
6ab30f9c
JPM		 783 return rc;
784}
785
333ef69e
JPM		 786/* link_profile_stats - update statistical profiling of traffic
787 */
788static void link_profile_stats(struct tipc_link *l)
789{
790 struct sk_buff *skb;
791 struct tipc_msg *msg;
792 int length;
793
794 /* Update counters used in statistical profiling of send traffic */
795 l->stats.accu_queue_sz += skb_queue_len(&l->transmq);
796 l->stats.queue_sz_counts++;
797
798 skb = skb_peek(&l->transmq);
799 if (!skb)
800 return;
801 msg = buf_msg(skb);
802 length = msg_size(msg);
803
804 if (msg_user(msg) == MSG_FRAGMENTER) {
805 if (msg_type(msg) != FIRST_FRAGMENT)
806 return;
a7dc51ad 807 length = msg_size(msg_inner_hdr(msg));
333ef69e
JPM		 808 }
809 l->stats.msg_lengths_total += length;
810 l->stats.msg_length_counts++;
811 if (length <= 64)
812 l->stats.msg_length_profile[0]++;
813 else if (length <= 256)
814 l->stats.msg_length_profile[1]++;
815 else if (length <= 1024)
816 l->stats.msg_length_profile[2]++;
817 else if (length <= 4096)
818 l->stats.msg_length_profile[3]++;
819 else if (length <= 16384)
820 l->stats.msg_length_profile[4]++;
821 else if (length <= 32768)
822 l->stats.msg_length_profile[5]++;
823 else
824 l->stats.msg_length_profile[6]++;
825}
826
26574db0
TL		 827/**
828 * tipc_link_too_silent - check if link is "too silent"
829 * @l: tipc link to be checked
830 *
637b77fd 831 * Return: true if the link 'silent_intv_cnt' is about to reach the
26574db0
TL		 832 * 'abort_limit' value, otherwise false
833 */
834bool tipc_link_too_silent(struct tipc_link *l)
835{
836 return (l->silent_intv_cnt + 2 > l->abort_limit);
837}
838
333ef69e
JPM		 839/* tipc_link_timeout - perform periodic task as instructed from node timeout
840 */
841int tipc_link_timeout(struct tipc_link *l, struct sk_buff_head *xmitq)
842{
c91522f8
YX		 843 int mtyp = 0;
844 int rc = 0;
42b18f60
JPM		 845 bool state = false;
846 bool probe = false;
847 bool setup = false;
52666986
JPM		 848 u16 bc_snt = l->bc_sndlink->snd_nxt - 1;
849 u16 bc_acked = l->bc_rcvlink->acked;
35c55c98 850 struct tipc_mon_state *mstate = &l->mon_state;
5045f7b9 851
26574db0
TL		 852 trace_tipc_link_timeout(l, TIPC_DUMP_NONE, " ");
853 trace_tipc_link_too_silent(l, TIPC_DUMP_ALL, " ");
662921cd
JPM		 854 switch (l->state) {
855 case LINK_ESTABLISHED:
856 case LINK_SYNCHING:
42b18f60 857 mtyp = STATE_MSG;
35c55c98
JPM		 858 link_profile_stats(l);
859 tipc_mon_get_state(l->net, l->addr, mstate, l->bearer_id);
860 if (mstate->reset || (l->silent_intv_cnt > l->abort_limit))
861 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
42b18f60 862 state = bc_acked != bc_snt;
35c55c98
JPM		 863 state |= l->bc_rcvlink->rcv_unacked;
864 state |= l->rcv_unacked;
865 state |= !skb_queue_empty(&l->transmq);
35c55c98
JPM		 866 probe = mstate->probing;
867 probe |= l->silent_intv_cnt;
868 if (probe || mstate->monitoring)
869 l->silent_intv_cnt++;
6ef9dcb7 870 probe |= !skb_queue_empty(&l->deferdq);
16ad3f40
JM		 871 if (l->snd_nxt == l->checkpoint) {
872 tipc_link_update_cwin(l, 0, 0);
873 probe = true;
874 }
875 l->checkpoint = l->snd_nxt;
662921cd
JPM		 876 break;
877 case LINK_RESET:
42b18f60
JPM		 878 setup = l->rst_cnt++ <= 4;
879 setup |= !(l->rst_cnt % 16);
5045f7b9 880 mtyp = RESET_MSG;
662921cd
JPM		 881 break;
882 case LINK_ESTABLISHING:
42b18f60 883 setup = true;
5045f7b9 884 mtyp = ACTIVATE_MSG;
662921cd 885 break;
662921cd 886 case LINK_PEER_RESET:
598411d7 887 case LINK_RESETTING:
662921cd
JPM		 888 case LINK_FAILINGOVER:
889 break;
890 default:
891 break;
5045f7b9 892 }
662921cd 893
42b18f60 894 if (state || probe || setup)
8d6e79d3 895 tipc_link_build_proto_msg(l, mtyp, probe, 0, 0, 0, 0, xmitq);
5045f7b9 896
333ef69e
JPM		 897 return rc;
898}
899
b97bf3fd 900/**
3127a020 901 * link_schedule_user - schedule a message sender for wakeup after congestion
365ad353
JPM		 902 * @l: congested link
903 * @hdr: header of message that is being sent
50100a5e 904 * Create pseudo msg to send back to user when congestion abates
b97bf3fd 905 */
365ad353 906static int link_schedule_user(struct tipc_link *l, struct tipc_msg *hdr)
b97bf3fd 907{
365ad353
JPM		 908 u32 dnode = tipc_own_addr(l->net);
909 u32 dport = msg_origport(hdr);
3127a020
JPM		 910 struct sk_buff *skb;
911
3127a020
JPM		 912 /* Create and schedule wakeup pseudo message */
913 skb = tipc_msg_create(SOCK_WAKEUP, 0, INT_H_SIZE, 0,
365ad353 914 dnode, l->addr, dport, 0, 0);
3127a020 915 if (!skb)
86704993 916 return -ENOBUFS;
365ad353
JPM		 917 msg_set_dest_droppable(buf_msg(skb), true);
918 TIPC_SKB_CB(skb)->chain_imp = msg_importance(hdr);
919 skb_queue_tail(&l->wakeupq, skb);
920 l->stats.link_congs++;
26574db0 921 trace_tipc_link_conges(l, TIPC_DUMP_ALL, "wakeup scheduled!");
3127a020 922 return -ELINKCONG;
b97bf3fd
PL		 923}
924
50100a5e
JPM		 925/**
926 * link_prepare_wakeup - prepare users for wakeup after congestion
365ad353
JPM		 927 * @l: congested link
928 * Wake up a number of waiting users, as permitted by available space
929 * in the send queue
50100a5e 930 */
e064cce1 931static void link_prepare_wakeup(struct tipc_link *l)
b97bf3fd 932{
7c5b4205
JM		 933 struct sk_buff_head *wakeupq = &l->wakeupq;
934 struct sk_buff_head *inputq = l->inputq;
58d78b32 935 struct sk_buff *skb, *tmp;
7c5b4205
JM		 936 struct sk_buff_head tmpq;
937 int avail[5] = {0,};
938 int imp = 0;
50100a5e 939
7c5b4205
JM		 940 __skb_queue_head_init(&tmpq);
941
942 for (; imp <= TIPC_SYSTEM_IMPORTANCE; imp++)
943 avail[imp] = l->backlog[imp].limit - l->backlog[imp].len;
944
945 skb_queue_walk_safe(wakeupq, skb, tmp) {
1f66d161 946 imp = TIPC_SKB_CB(skb)->chain_imp;
7c5b4205
JM		 947 if (avail[imp] <= 0)
948 continue;
949 avail[imp]--;
950 __skb_unlink(skb, wakeupq);
951 __skb_queue_tail(&tmpq, skb);
b97bf3fd 952 }
7c5b4205
JM		 953
954 spin_lock_bh(&inputq->lock);
955 skb_queue_splice_tail(&tmpq, inputq);
956 spin_unlock_bh(&inputq->lock);
957
b97bf3fd
PL		 958}
959
a34f8291
HM		 960/**
961 * tipc_link_set_skb_retransmit_time - set the time at which retransmission of
962 * the given skb should be next attempted
963 * @skb: skb to set a future retransmission time for
964 * @l: link the skb will be transmitted on
965 */
966static void tipc_link_set_skb_retransmit_time(struct sk_buff *skb,
967 struct tipc_link *l)
968{
969 if (link_is_bc_sndlink(l))
970 TIPC_SKB_CB(skb)->nxt_retr = TIPC_BC_RETR_LIM;
971 else
972 TIPC_SKB_CB(skb)->nxt_retr = TIPC_UC_RETR_TIME;
973}
974
6e498158 975void tipc_link_reset(struct tipc_link *l)
b97bf3fd 976{
a1f8dd34 977 struct sk_buff_head list;
e95584a8 978 u32 imp;
a1f8dd34
YX		 979
980 __skb_queue_head_init(&list);
981
7ea817f4 982 l->in_session = false;
f7a93780
TL		 983 /* Force re-synch of peer session number before establishing */
984 l->peer_session--;
e74a386d 985 l->session++;
6e498158 986 l->mtu = l->advertised_mtu;
a1f8dd34 987
3f32d0be 988 spin_lock_bh(&l->wakeupq.lock);
a1f8dd34
YX		 989 skb_queue_splice_init(&l->wakeupq, &list);
990 spin_unlock_bh(&l->wakeupq.lock);
991
3f32d0be 992 spin_lock_bh(&l->inputq->lock);
a1f8dd34 993 skb_queue_splice_init(&list, l->inputq);
3f32d0be 994 spin_unlock_bh(&l->inputq->lock);
3f32d0be 995
6e498158
JPM		 996 __skb_queue_purge(&l->transmq);
997 __skb_queue_purge(&l->deferdq);
2af5ae37 998 __skb_queue_purge(&l->backlogq);
58ee86b8 999 __skb_queue_purge(&l->failover_deferdq);
e95584a8
TL		 1000 for (imp = 0; imp <= TIPC_SYSTEM_IMPORTANCE; imp++) {
1001 l->backlog[imp].len = 0;
1002 l->backlog[imp].target_bskb = NULL;
1003 }
6e498158 1004 kfree_skb(l->reasm_buf);
2320bcda 1005 kfree_skb(l->reasm_tnlmsg);
6e498158
JPM		 1006 kfree_skb(l->failover_reasm_skb);
1007 l->reasm_buf = NULL;
2320bcda 1008 l->reasm_tnlmsg = NULL;
6e498158
JPM		 1009 l->failover_reasm_skb = NULL;
1010 l->rcv_unacked = 0;
1011 l->snd_nxt = 1;
1012 l->rcv_nxt = 1;
9012de50
JM		 1013 l->snd_nxt_state = 1;
1014 l->rcv_nxt_state = 1;
c1ab3f1d 1015 l->acked = 0;
d7626b5a
TL		 1016 l->last_gap = 0;
1017 kfree(l->last_ga);
1018 l->last_ga = NULL;
6e498158 1019 l->silent_intv_cnt = 0;
88e8ac70 1020 l->rst_cnt = 0;
52666986 1021 l->bc_peer_is_up = false;
35c55c98 1022 memset(&l->mon_state, 0, sizeof(l->mon_state));
38206d59 1023 tipc_link_reset_stats(l);
b97bf3fd
PL		 1024}
1025
af9b028e
JPM		 1026/**
1027 * tipc_link_xmit(): enqueue buffer list according to queue situation
d8141208 1028 * @l: link to use
af9b028e
JPM		 1029 * @list: chain of buffers containing message
1030 * @xmitq: returned list of packets to be sent by caller
1031 *
365ad353 1032 * Consumes the buffer chain.
af9b028e 1033 * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted
86704993 1034 * Return: 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS
af9b028e
JPM		 1035 */
1036int tipc_link_xmit(struct tipc_link *l, struct sk_buff_head *list,
1037 struct sk_buff_head *xmitq)
1038{
06e7c70c
TL		 1039 struct sk_buff_head *backlogq = &l->backlogq;
1040 struct sk_buff_head *transmq = &l->transmq;
1041 struct sk_buff *skb, *_skb;
1042 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
af9b028e
JPM		 1043 u16 ack = l->rcv_nxt - 1;
1044 u16 seqno = l->snd_nxt;
95901122 1045 int pkt_cnt = skb_queue_len(list);
fc1b6d6d 1046 unsigned int mss = tipc_link_mss(l);
16ad3f40 1047 unsigned int cwin = l->window;
06e7c70c 1048 unsigned int mtu = l->mtu;
b7741344 1049 struct tipc_msg *hdr;
06e7c70c 1050 bool new_bundle;
365ad353 1051 int rc = 0;
b7741344 1052 int imp;
af9b028e 1053
b7741344
HL		 1054 if (pkt_cnt <= 0)
1055 return 0;
1056
1057 hdr = buf_msg(skb_peek(list));
4952cd3e 1058 if (unlikely(msg_size(hdr) > mtu)) {
2320bcda
TL		 1059 pr_warn("Too large msg, purging xmit list %d %d %d %d %d!\n",
1060 skb_queue_len(list), msg_user(hdr),
1061 msg_type(hdr), msg_size(hdr), mtu);
e654f9f5 1062 __skb_queue_purge(list);
af9b028e 1063 return -EMSGSIZE;
4952cd3e 1064 }
af9b028e 1065
b7741344 1066 imp = msg_importance(hdr);
365ad353
JPM		 1067 /* Allow oversubscription of one data msg per source at congestion */
1068 if (unlikely(l->backlog[imp].len >= l->backlog[imp].limit)) {
1069 if (imp == TIPC_SYSTEM_IMPORTANCE) {
1070 pr_warn("%s<%s>, link overflow", link_rst_msg, l->name);
1071 return -ENOBUFS;
1072 }
1073 rc = link_schedule_user(l, hdr);
1074 }
1075
95901122
JPM		 1076 if (pkt_cnt > 1) {
1077 l->stats.sent_fragmented++;
1078 l->stats.sent_fragments += pkt_cnt;
1079 }
1080
af9b028e 1081 /* Prepare each packet for sending, and add to relevant queue: */
06e7c70c 1082 while ((skb = __skb_dequeue(list))) {
16ad3f40 1083 if (likely(skb_queue_len(transmq) < cwin)) {
06e7c70c
TL		 1084 hdr = buf_msg(skb);
1085 msg_set_seqno(hdr, seqno);
1086 msg_set_ack(hdr, ack);
1087 msg_set_bcast_ack(hdr, bc_ack);
af9b028e 1088 _skb = skb_clone(skb, GFP_ATOMIC);
4952cd3e 1089 if (!_skb) {
06e7c70c 1090 kfree_skb(skb);
e654f9f5 1091 __skb_queue_purge(list);
86704993 1092 return -ENOBUFS;
4952cd3e 1093 }
af9b028e 1094 __skb_queue_tail(transmq, skb);
a34f8291 1095 tipc_link_set_skb_retransmit_time(skb, l);
af9b028e 1096 __skb_queue_tail(xmitq, _skb);
c1ab3f1d 1097 TIPC_SKB_CB(skb)->ackers = l->ackers;
af9b028e 1098 l->rcv_unacked = 0;
95901122 1099 l->stats.sent_pkts++;
af9b028e
JPM		 1100 seqno++;
1101 continue;
1102 }
06e7c70c 1103 if (tipc_msg_try_bundle(l->backlog[imp].target_bskb, &skb,
fc1b6d6d 1104 mss, l->addr, &new_bundle)) {
06e7c70c
TL		 1105 if (skb) {
1106 /* Keep a ref. to the skb for next try */
1107 l->backlog[imp].target_bskb = skb;
1108 l->backlog[imp].len++;
1109 __skb_queue_tail(backlogq, skb);
1110 } else {
1111 if (new_bundle) {
1112 l->stats.sent_bundles++;
1113 l->stats.sent_bundled++;
1114 }
1115 l->stats.sent_bundled++;
1116 }
af9b028e
JPM		 1117 continue;
1118 }
e95584a8 1119 l->backlog[imp].target_bskb = NULL;
06e7c70c
TL		 1120 l->backlog[imp].len += (1 + skb_queue_len(list));
1121 __skb_queue_tail(backlogq, skb);
af9b028e
JPM		 1122 skb_queue_splice_tail_init(list, backlogq);
1123 }
1124 l->snd_nxt = seqno;
365ad353 1125 return rc;
af9b028e
JPM		 1126}
1127
16ad3f40
JM		 1128static void tipc_link_update_cwin(struct tipc_link *l, int released,
1129 bool retransmitted)
1130{
1131 int bklog_len = skb_queue_len(&l->backlogq);
1132 struct sk_buff_head *txq = &l->transmq;
1133 int txq_len = skb_queue_len(txq);
1134 u16 cwin = l->window;
1135
1136 /* Enter fast recovery */
1137 if (unlikely(retransmitted)) {
1138 l->ssthresh = max_t(u16, l->window / 2, 300);
edadedf1 1139 l->window = min_t(u16, l->ssthresh, l->window);
16ad3f40
JM		 1140 return;
1141 }
1142 /* Enter slow start */
1143 if (unlikely(!released)) {
1144 l->ssthresh = max_t(u16, l->window / 2, 300);
1145 l->window = l->min_win;
1146 return;
1147 }
1148 /* Don't increase window if no pressure on the transmit queue */
1149 if (txq_len + bklog_len < cwin)
1150 return;
1151
1152 /* Don't increase window if there are holes the transmit queue */
1153 if (txq_len && l->snd_nxt - buf_seqno(skb_peek(txq)) != txq_len)
1154 return;
1155
1156 l->cong_acks += released;
1157
1158 /* Slow start */
1159 if (cwin <= l->ssthresh) {
1160 l->window = min_t(u16, cwin + released, l->max_win);
1161 return;
1162 }
1163 /* Congestion avoidance */
1164 if (l->cong_acks < cwin)
1165 return;
1166 l->window = min_t(u16, ++cwin, l->max_win);
1167 l->cong_acks = 0;
1168}
1169
e064cce1
Y		 1170static void tipc_link_advance_backlog(struct tipc_link *l,
1171 struct sk_buff_head *xmitq)
d999297c 1172{
16ad3f40
JM		 1173 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
1174 struct sk_buff_head *txq = &l->transmq;
d999297c 1175 struct sk_buff *skb, *_skb;
d999297c 1176 u16 ack = l->rcv_nxt - 1;
16ad3f40
JM		 1177 u16 seqno = l->snd_nxt;
1178 struct tipc_msg *hdr;
1179 u16 cwin = l->window;
e95584a8 1180 u32 imp;
d999297c 1181
16ad3f40 1182 while (skb_queue_len(txq) < cwin) {
d999297c
JPM		 1183 skb = skb_peek(&l->backlogq);
1184 if (!skb)
1185 break;
1186 _skb = skb_clone(skb, GFP_ATOMIC);
1187 if (!_skb)
1188 break;
1189 __skb_dequeue(&l->backlogq);
1190 hdr = buf_msg(skb);
e95584a8
TL		 1191 imp = msg_importance(hdr);
1192 l->backlog[imp].len--;
1193 if (unlikely(skb == l->backlog[imp].target_bskb))
1194 l->backlog[imp].target_bskb = NULL;
d999297c 1195 __skb_queue_tail(&l->transmq, skb);
a34f8291 1196 tipc_link_set_skb_retransmit_time(skb, l);
05572271 1197
d999297c 1198 __skb_queue_tail(xmitq, _skb);
c1ab3f1d 1199 TIPC_SKB_CB(skb)->ackers = l->ackers;
d999297c 1200 msg_set_seqno(hdr, seqno);
52666986
JPM		 1201 msg_set_ack(hdr, ack);
1202 msg_set_bcast_ack(hdr, bc_ack);
d999297c 1203 l->rcv_unacked = 0;
95901122 1204 l->stats.sent_pkts++;
d999297c
JPM		 1205 seqno++;
1206 }
1207 l->snd_nxt = seqno;
1208}
1209
6a6b5c8b
TL		 1210/**
1211 * link_retransmit_failure() - Detect repeated retransmit failures
1212 * @l: tipc link sender
1213 * @r: tipc link receiver (= l in case of unicast)
6a6b5c8b
TL		 1214 * @rc: returned code
1215 *
1216 * Return: true if the repeated retransmit failures happens, otherwise
1217 * false
1218 */
1219static bool link_retransmit_failure(struct tipc_link *l, struct tipc_link *r,
71204231 1220 int *rc)
d356eeba 1221{
6a6b5c8b
TL		 1222 struct sk_buff *skb = skb_peek(&l->transmq);
1223 struct tipc_msg *hdr;
1224
1225 if (!skb)
1226 return false;
6a6b5c8b 1227
71204231
TL		 1228 if (!TIPC_SKB_CB(skb)->retr_cnt)
1229 return false;
6a6b5c8b 1230
71204231 1231 if (!time_after(jiffies, TIPC_SKB_CB(skb)->retr_stamp +
426071f1 1232 msecs_to_jiffies(r->tolerance * 10)))
71204231
TL		 1233 return false;
1234
1235 hdr = buf_msg(skb);
1236 if (link_is_bc_sndlink(l) && !less(r->acked, msg_seqno(hdr)))
1237 return false;
6a6b5c8b 1238
71204231
TL		 1239 pr_warn("Retransmission failure on link <%s>\n", l->name);
1240 link_print(l, "State of link ");
1241 pr_info("Failed msg: usr %u, typ %u, len %u, err %u\n",
1242 msg_user(hdr), msg_type(hdr), msg_size(hdr), msg_errcode(hdr));
1243 pr_info("sqno %u, prev: %x, dest: %x\n",
1244 msg_seqno(hdr), msg_prevnode(hdr), msg_destnode(hdr));
1245 pr_info("retr_stamp %d, retr_cnt %d\n",
1246 jiffies_to_msecs(TIPC_SKB_CB(skb)->retr_stamp),
1247 TIPC_SKB_CB(skb)->retr_cnt);
1248
1249 trace_tipc_list_dump(&l->transmq, true, "retrans failure!");
1250 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "retrans failure!");
1251 trace_tipc_link_dump(r, TIPC_DUMP_NONE, "retrans failure!");
1252
1253 if (link_is_bc_sndlink(l)) {
1254 r->state = LINK_RESET;
d7626b5a 1255 *rc |= TIPC_LINK_DOWN_EVT;
71204231 1256 } else {
d7626b5a 1257 *rc |= tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
6a6b5c8b 1258 }
52666986 1259
71204231 1260 return true;
d356eeba
AS		 1261}
1262
c637c103 1263/* tipc_data_input - deliver data and name distr msgs to upper layer
7ae934be 1264 *
c637c103 1265 * Consumes buffer if message is of right type
7ae934be
EH		 1266 * Node lock must be held
1267 */
52666986 1268static bool tipc_data_input(struct tipc_link *l, struct sk_buff *skb,
9073fb8b 1269 struct sk_buff_head *inputq)
7ae934be 1270{
399574d4 1271 struct sk_buff_head *mc_inputq = l->bc_rcvlink->inputq;
a853e4c6
JPM		 1272 struct tipc_msg *hdr = buf_msg(skb);
1273
1274 switch (msg_user(hdr)) {
c637c103
JPM		 1275 case TIPC_LOW_IMPORTANCE:
1276 case TIPC_MEDIUM_IMPORTANCE:
1277 case TIPC_HIGH_IMPORTANCE:
1278 case TIPC_CRITICAL_IMPORTANCE:
2f487712 1279 if (unlikely(msg_in_group(hdr) || msg_mcast(hdr))) {
399574d4 1280 skb_queue_tail(mc_inputq, skb);
a853e4c6
JPM		 1281 return true;
1282 }
7f8901b7 1283 fallthrough;
2f487712 1284 case CONN_MANAGER:
36c0a9df 1285 skb_queue_tail(inputq, skb);
c637c103 1286 return true;
399574d4
JM		 1287 case GROUP_PROTOCOL:
1288 skb_queue_tail(mc_inputq, skb);
1289 return true;
7ae934be 1290 case NAME_DISTRIBUTOR:
52666986
JPM		 1291 l->bc_rcvlink->state = LINK_ESTABLISHED;
1292 skb_queue_tail(l->namedq, skb);
c637c103
JPM		 1293 return true;
1294 case MSG_BUNDLER:
dff29b1a 1295 case TUNNEL_PROTOCOL:
c637c103 1296 case MSG_FRAGMENTER:
7ae934be 1297 case BCAST_PROTOCOL:
c637c103 1298 return false;
1ef6f7c9
TL		 1299#ifdef CONFIG_TIPC_CRYPTO
1300 case MSG_CRYPTO:
6180c780
XL		 1301 if (sysctl_tipc_key_exchange_enabled &&
1302 TIPC_SKB_CB(skb)->decrypted) {
271351d2
XL		 1303 tipc_crypto_msg_rcv(l->net, skb);
1304 return true;
1305 }
1306 fallthrough;
1ef6f7c9 1307#endif
7ae934be 1308 default:
c637c103
JPM		 1309 pr_warn("Dropping received illegal msg type\n");
1310 kfree_skb(skb);
7384b538 1311 return true;
f2219c32 1312 }
7ae934be 1313}
c637c103
JPM		 1314
1315/* tipc_link_input - process packet that has passed link protocol check
1316 *
1317 * Consumes buffer
7ae934be 1318 */
9073fb8b 1319static int tipc_link_input(struct tipc_link *l, struct sk_buff *skb,
58ee86b8
TL		 1320 struct sk_buff_head *inputq,
1321 struct sk_buff **reasm_skb)
7ae934be 1322{
6e498158 1323 struct tipc_msg *hdr = buf_msg(skb);
c637c103 1324 struct sk_buff *iskb;
9945e804 1325 struct sk_buff_head tmpq;
6e498158 1326 int usr = msg_user(hdr);
6e498158 1327 int pos = 0;
c637c103 1328
6e498158 1329 if (usr == MSG_BUNDLER) {
9945e804 1330 skb_queue_head_init(&tmpq);
6e498158
JPM		 1331 l->stats.recv_bundles++;
1332 l->stats.recv_bundled += msg_msgcnt(hdr);
c637c103 1333 while (tipc_msg_extract(skb, &iskb, &pos))
9945e804
JPM		 1334 tipc_data_input(l, iskb, &tmpq);
1335 tipc_skb_queue_splice_tail(&tmpq, inputq);
662921cd 1336 return 0;
6e498158
JPM		 1337 } else if (usr == MSG_FRAGMENTER) {
1338 l->stats.recv_fragments++;
1339 if (tipc_buf_append(reasm_skb, &skb)) {
1340 l->stats.recv_fragmented++;
9073fb8b 1341 tipc_data_input(l, skb, inputq);
52666986
JPM		 1342 } else if (!*reasm_skb && !link_is_bc_rcvlink(l)) {
1343 pr_warn_ratelimited("Unable to build fragment list\n");
662921cd 1344 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
c637c103 1345 }
662921cd 1346 return 0;
6e498158 1347 } else if (usr == BCAST_PROTOCOL) {
c72fa872 1348 tipc_bcast_lock(l->net);
52666986 1349 tipc_link_bc_init_rcv(l->bc_rcvlink, hdr);
c72fa872 1350 tipc_bcast_unlock(l->net);
6e498158 1351 }
58ee86b8 1352
6e498158 1353 kfree_skb(skb);
662921cd 1354 return 0;
7ae934be
EH		 1355}
1356
58ee86b8
TL		 1357/* tipc_link_tnl_rcv() - receive TUNNEL_PROTOCOL message, drop or process the
1358 * inner message along with the ones in the old link's
1359 * deferdq
1360 * @l: tunnel link
1361 * @skb: TUNNEL_PROTOCOL message
1362 * @inputq: queue to put messages ready for delivery
1363 */
1364static int tipc_link_tnl_rcv(struct tipc_link *l, struct sk_buff *skb,
1365 struct sk_buff_head *inputq)
1366{
1367 struct sk_buff **reasm_skb = &l->failover_reasm_skb;
2320bcda 1368 struct sk_buff **reasm_tnlmsg = &l->reasm_tnlmsg;
58ee86b8
TL		 1369 struct sk_buff_head *fdefq = &l->failover_deferdq;
1370 struct tipc_msg *hdr = buf_msg(skb);
1371 struct sk_buff *iskb;
1372 int ipos = 0;
1373 int rc = 0;
1374 u16 seqno;
1375
2320bcda
TL		 1376 if (msg_type(hdr) == SYNCH_MSG) {
1377 kfree_skb(skb);
1378 return 0;
1379 }
58ee86b8 1380
2320bcda
TL		 1381 /* Not a fragment? */
1382 if (likely(!msg_nof_fragms(hdr))) {
1383 if (unlikely(!tipc_msg_extract(skb, &iskb, &ipos))) {
1384 pr_warn_ratelimited("Unable to extract msg, defq: %d\n",
1385 skb_queue_len(fdefq));
1386 return 0;
1387 }
1388 kfree_skb(skb);
1389 } else {
1390 /* Set fragment type for buf_append */
1391 if (msg_fragm_no(hdr) == 1)
1392 msg_set_type(hdr, FIRST_FRAGMENT);
1393 else if (msg_fragm_no(hdr) < msg_nof_fragms(hdr))
1394 msg_set_type(hdr, FRAGMENT);
1395 else
1396 msg_set_type(hdr, LAST_FRAGMENT);
1397
1398 if (!tipc_buf_append(reasm_tnlmsg, &skb)) {
1399 /* Successful but non-complete reassembly? */
1400 if (*reasm_tnlmsg || link_is_bc_rcvlink(l))
1401 return 0;
1402 pr_warn_ratelimited("Unable to reassemble tunnel msg\n");
1403 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1404 }
1405 iskb = skb;
58ee86b8
TL		 1406 }
1407
1408 do {
1409 seqno = buf_seqno(iskb);
58ee86b8
TL		 1410 if (unlikely(less(seqno, l->drop_point))) {
1411 kfree_skb(iskb);
1412 continue;
1413 }
58ee86b8
TL		 1414 if (unlikely(seqno != l->drop_point)) {
1415 __tipc_skb_queue_sorted(fdefq, seqno, iskb);
1416 continue;
1417 }
1418
1419 l->drop_point++;
58ee86b8
TL		 1420 if (!tipc_data_input(l, iskb, inputq))
1421 rc |= tipc_link_input(l, iskb, inputq, reasm_skb);
1422 if (unlikely(rc))
1423 break;
1424 } while ((iskb = __tipc_skb_dequeue(fdefq, l->drop_point)));
1425
58ee86b8
TL		 1426 return rc;
1427}
1428
d7626b5a
TL		 1429/**
1430 * tipc_get_gap_ack_blks - get Gap ACK blocks from PROTOCOL/STATE_MSG
1431 * @ga: returned pointer to the Gap ACK blocks if any
1432 * @l: the tipc link
1433 * @hdr: the PROTOCOL/STATE_MSG header
1434 * @uc: desired Gap ACK blocks type, i.e. unicast (= 1) or broadcast (= 0)
1435 *
1436 * Return: the total Gap ACK blocks size
1437 */
1438u16 tipc_get_gap_ack_blks(struct tipc_gap_ack_blks **ga, struct tipc_link *l,
1439 struct tipc_msg *hdr, bool uc)
1440{
1441 struct tipc_gap_ack_blks *p;
1442 u16 sz = 0;
1443
1444 /* Does peer support the Gap ACK blocks feature? */
1445 if (l->peer_caps & TIPC_GAP_ACK_BLOCK) {
1446 p = (struct tipc_gap_ack_blks *)msg_data(hdr);
1447 sz = ntohs(p->len);
1448 /* Sanity check */
e034c6d2 1449 if (sz == struct_size(p, gacks, p->ugack_cnt + p->bgack_cnt)) {
d7626b5a
TL		 1450 /* Good, check if the desired type exists */
1451 if ((uc && p->ugack_cnt) || (!uc && p->bgack_cnt))
1452 goto ok;
1453 /* Backward compatible: peer might not support bc, but uc? */
e034c6d2 1454 } else if (uc && sz == struct_size(p, gacks, p->ugack_cnt)) {
d7626b5a
TL		 1455 if (p->ugack_cnt) {
1456 p->bgack_cnt = 0;
1457 goto ok;
1458 }
1459 }
d999297c 1460 }
d7626b5a
TL		 1461 /* Other cases: ignore! */
1462 p = NULL;
1463
1464ok:
1465 *ga = p;
1466 return sz;
d999297c
JPM		 1467}
1468
d7626b5a
TL		 1469static u8 __tipc_build_gap_ack_blks(struct tipc_gap_ack_blks *ga,
1470 struct tipc_link *l, u8 start_index)
9195948f 1471{
d7626b5a 1472 struct tipc_gap_ack *gacks = &ga->gacks[start_index];
9195948f 1473 struct sk_buff *skb = skb_peek(&l->deferdq);
d7626b5a 1474 u16 expect, seqno = 0;
9195948f
TL		 1475 u8 n = 0;
1476
d7626b5a
TL		 1477 if (!skb)
1478 return 0;
9195948f
TL		 1479
1480 expect = buf_seqno(skb);
1481 skb_queue_walk(&l->deferdq, skb) {
1482 seqno = buf_seqno(skb);
1483 if (unlikely(more(seqno, expect))) {
d7626b5a
TL		 1484 gacks[n].ack = htons(expect - 1);
1485 gacks[n].gap = htons(seqno - expect);
1486 if (++n >= MAX_GAP_ACK_BLKS / 2) {
d7626b5a 1487 pr_info_ratelimited("Gacks on %s: %d, ql: %d!\n",
03b6fefd 1488 l->name, n,
d7626b5a
TL		 1489 skb_queue_len(&l->deferdq));
1490 return n;
9195948f
TL		 1491 }
1492 } else if (unlikely(less(seqno, expect))) {
1493 pr_warn("Unexpected skb in deferdq!\n");
1494 continue;
1495 }
1496 expect = seqno + 1;
1497 }
1498
1499 /* last block */
d7626b5a
TL		 1500 gacks[n].ack = htons(seqno);
1501 gacks[n].gap = 0;
9195948f 1502 n++;
d7626b5a
TL		 1503 return n;
1504}
9195948f 1505
d7626b5a
TL		 1506/* tipc_build_gap_ack_blks - build Gap ACK blocks
1507 * @l: tipc unicast link
1508 * @hdr: the tipc message buffer to store the Gap ACK blocks after built
1509 *
1510 * The function builds Gap ACK blocks for both the unicast & broadcast receiver
1511 * links of a certain peer, the buffer after built has the network data format
1512 * as found at the struct tipc_gap_ack_blks definition.
1513 *
1514 * returns the actual allocated memory size
1515 */
1516static u16 tipc_build_gap_ack_blks(struct tipc_link *l, struct tipc_msg *hdr)
1517{
1518 struct tipc_link *bcl = l->bc_rcvlink;
1519 struct tipc_gap_ack_blks *ga;
1520 u16 len;
1521
1522 ga = (struct tipc_gap_ack_blks *)msg_data(hdr);
1523
1524 /* Start with broadcast link first */
1525 tipc_bcast_lock(bcl->net);
1526 msg_set_bcast_ack(hdr, bcl->rcv_nxt - 1);
1527 msg_set_bc_gap(hdr, link_bc_rcv_gap(bcl));
1528 ga->bgack_cnt = __tipc_build_gap_ack_blks(ga, bcl, 0);
1529 tipc_bcast_unlock(bcl->net);
1530
1531 /* Now for unicast link, but an explicit NACK only (???) */
1532 ga->ugack_cnt = (msg_seq_gap(hdr)) ?
1533 __tipc_build_gap_ack_blks(ga, l, ga->bgack_cnt) : 0;
1534
1535 /* Total len */
e034c6d2 1536 len = struct_size(ga, gacks, ga->bgack_cnt + ga->ugack_cnt);
9195948f 1537 ga->len = htons(len);
9195948f
TL		 1538 return len;
1539}
1540
1541/* tipc_link_advance_transmq - advance TIPC link transmq queue by releasing
1542 * acked packets, also doing retransmissions if
1543 * gaps found
1544 * @l: tipc link with transmq queue to be advanced
d7626b5a 1545 * @r: tipc link "receiver" i.e. in case of broadcast (= "l" if unicast)
9195948f
TL		 1546 * @acked: seqno of last packet acked by peer without any gaps before
1547 * @gap: # of gap packets
1548 * @ga: buffer pointer to Gap ACK blocks from peer
1549 * @xmitq: queue for accumulating the retransmitted packets if any
d7626b5a
TL		 1550 * @retransmitted: returned boolean value if a retransmission is really issued
1551 * @rc: returned code e.g. TIPC_LINK_DOWN_EVT if a repeated retransmit failures
1552 * happens (- unlikely case)
6a6b5c8b 1553 *
d7626b5a 1554 * Return: the number of packets released from the link transmq
9195948f 1555 */
d7626b5a
TL		 1556static int tipc_link_advance_transmq(struct tipc_link *l, struct tipc_link *r,
1557 u16 acked, u16 gap,
6a6b5c8b 1558 struct tipc_gap_ack_blks *ga,
d7626b5a
TL		 1559 struct sk_buff_head *xmitq,
1560 bool *retransmitted, int *rc)
9195948f 1561{
d7626b5a
TL		 1562 struct tipc_gap_ack_blks *last_ga = r->last_ga, *this_ga = NULL;
1563 struct tipc_gap_ack *gacks = NULL;
9195948f
TL		 1564 struct sk_buff *skb, *_skb, *tmp;
1565 struct tipc_msg *hdr;
d7626b5a
TL		 1566 u32 qlen = skb_queue_len(&l->transmq);
1567 u16 nacked = acked, ngap = gap, gack_cnt = 0;
9195948f
TL		 1568 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
1569 u16 ack = l->rcv_nxt - 1;
6a6b5c8b 1570 u16 seqno, n = 0;
d7626b5a
TL		 1571 u16 end = r->acked, start = end, offset = r->last_gap;
1572 u16 si = (last_ga) ? last_ga->start_index : 0;
1573 bool is_uc = !link_is_bc_sndlink(l);
1574 bool bc_has_acked = false;
1575
c6ed7a5c
TL		 1576 trace_tipc_link_retrans(r, acked + 1, acked + gap, &l->transmq);
1577
d7626b5a
TL		 1578 /* Determine Gap ACK blocks if any for the particular link */
1579 if (ga && is_uc) {
1580 /* Get the Gap ACKs, uc part */
1581 gack_cnt = ga->ugack_cnt;
1582 gacks = &ga->gacks[ga->bgack_cnt];
1583 } else if (ga) {
1584 /* Copy the Gap ACKs, bc part, for later renewal if needed */
e034c6d2 1585 this_ga = kmemdup(ga, struct_size(ga, gacks, ga->bgack_cnt),
d7626b5a
TL		 1586 GFP_ATOMIC);
1587 if (likely(this_ga)) {
1588 this_ga->start_index = 0;
1589 /* Start with the bc Gap ACKs */
1590 gack_cnt = this_ga->bgack_cnt;
1591 gacks = &this_ga->gacks[0];
1592 } else {
1593 /* Hmm, we can get in trouble..., simply ignore it */
1594 pr_warn_ratelimited("Ignoring bc Gap ACKs, no memory\n");
1595 }
1596 }
6a6b5c8b 1597
d7626b5a 1598 /* Advance the link transmq */
9195948f
TL		 1599 skb_queue_walk_safe(&l->transmq, skb, tmp) {
1600 seqno = buf_seqno(skb);
1601
1602next_gap_ack:
d7626b5a
TL		 1603 if (less_eq(seqno, nacked)) {
1604 if (is_uc)
1605 goto release;
1606 /* Skip packets peer has already acked */
1607 if (!more(seqno, r->acked))
1608 continue;
1609 /* Get the next of last Gap ACK blocks */
1610 while (more(seqno, end)) {
1611 if (!last_ga || si >= last_ga->bgack_cnt)
1612 break;
1613 start = end + offset + 1;
1614 end = ntohs(last_ga->gacks[si].ack);
1615 offset = ntohs(last_ga->gacks[si].gap);
1616 si++;
1617 WARN_ONCE(more(start, end) ||
1618 (!offset &&
1619 si < last_ga->bgack_cnt) ||
1620 si > MAX_GAP_ACK_BLKS,
1621 "Corrupted Gap ACK: %d %d %d %d %d\n",
1622 start, end, offset, si,
1623 last_ga->bgack_cnt);
1624 }
1625 /* Check against the last Gap ACK block */
1626 if (in_range(seqno, start, end))
1627 continue;
1628 /* Update/release the packet peer is acking */
1629 bc_has_acked = true;
1630 if (--TIPC_SKB_CB(skb)->ackers)
1631 continue;
1632release:
9195948f
TL		 1633 /* release skb */
1634 __skb_unlink(skb, &l->transmq);
1635 kfree_skb(skb);
d7626b5a
TL		 1636 } else if (less_eq(seqno, nacked + ngap)) {
1637 /* First gap: check if repeated retrans failures? */
1638 if (unlikely(seqno == acked + 1 &&
1639 link_retransmit_failure(l, r, rc))) {
1640 /* Ignore this bc Gap ACKs if any */
1641 kfree(this_ga);
1642 this_ga = NULL;
1643 break;
1644 }
71204231 1645 /* retransmit skb if unrestricted*/
382f598f
TL		 1646 if (time_before(jiffies, TIPC_SKB_CB(skb)->nxt_retr))
1647 continue;
a34f8291 1648 tipc_link_set_skb_retransmit_time(skb, l);
fc1b6d6d 1649 _skb = pskb_copy(skb, GFP_ATOMIC);
9195948f
TL		 1650 if (!_skb)
1651 continue;
1652 hdr = buf_msg(_skb);
1653 msg_set_ack(hdr, ack);
1654 msg_set_bcast_ack(hdr, bc_ack);
1655 _skb->priority = TC_PRIO_CONTROL;
1656 __skb_queue_tail(xmitq, _skb);
1657 l->stats.retransmitted++;
03b6fefd
TL		 1658 if (!is_uc)
1659 r->stats.retransmitted++;
d7626b5a 1660 *retransmitted = true;
71204231
TL		 1661 /* Increase actual retrans counter & mark first time */
1662 if (!TIPC_SKB_CB(skb)->retr_cnt++)
1663 TIPC_SKB_CB(skb)->retr_stamp = jiffies;
9195948f
TL		 1664 } else {
1665 /* retry with Gap ACK blocks if any */
d7626b5a 1666 if (n >= gack_cnt)
9195948f 1667 break;
d7626b5a
TL		 1668 nacked = ntohs(gacks[n].ack);
1669 ngap = ntohs(gacks[n].gap);
9195948f
TL		 1670 n++;
1671 goto next_gap_ack;
1672 }
1673 }
d7626b5a
TL		 1674
1675 /* Renew last Gap ACK blocks for bc if needed */
1676 if (bc_has_acked) {
1677 if (this_ga) {
1678 kfree(last_ga);
1679 r->last_ga = this_ga;
1680 r->last_gap = gap;
1681 } else if (last_ga) {
1682 if (less(acked, start)) {
1683 si--;
1684 offset = start - acked - 1;
1685 } else if (less(acked, end)) {
1686 acked = end;
1687 }
1688 if (si < last_ga->bgack_cnt) {
1689 last_ga->start_index = si;
1690 r->last_gap = offset;
1691 } else {
1692 kfree(last_ga);
1693 r->last_ga = NULL;
1694 r->last_gap = 0;
1695 }
1696 } else {
1697 r->last_gap = 0;
1698 }
1699 r->acked = acked;
1700 } else {
1701 kfree(this_ga);
1702 }
1703
1704 return qlen - skb_queue_len(&l->transmq);
9195948f
TL		 1705}
1706
34b9cd64 1707/* tipc_link_build_state_msg: prepare link state message for transmission
52666986
JPM		 1708 *
1709 * Note that sending of broadcast ack is coordinated among nodes, to reduce
1710 * risk of ack storms towards the sender
f9aa358a 1711 */
34b9cd64 1712int tipc_link_build_state_msg(struct tipc_link *l, struct sk_buff_head *xmitq)
f9aa358a 1713{
52666986
JPM		 1714 if (!l)
1715 return 0;
1716
1717 /* Broadcast ACK must be sent via a unicast link => defer to caller */
1718 if (link_is_bc_rcvlink(l)) {
e74a386d 1719 if (((l->rcv_nxt ^ tipc_own_addr(l->net)) & 0xf) != 0xf)
52666986
JPM		 1720 return 0;
1721 l->rcv_unacked = 0;
02d11ca2
JPM		 1722
1723 /* Use snd_nxt to store peer's snd_nxt in broadcast rcv link */
1724 l->snd_nxt = l->rcv_nxt;
1725 return TIPC_LINK_SND_STATE;
52666986 1726 }
52666986 1727 /* Unicast ACK */
f9aa358a
JPM		 1728 l->rcv_unacked = 0;
1729 l->stats.sent_acks++;
8d6e79d3 1730 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, 0, xmitq);
52666986 1731 return 0;
f9aa358a
JPM		 1732}
1733
282b3a05
JPM		 1734/* tipc_link_build_reset_msg: prepare link RESET or ACTIVATE message
1735 */
1736void tipc_link_build_reset_msg(struct tipc_link *l, struct sk_buff_head *xmitq)
1737{
1738 int mtyp = RESET_MSG;
634696b1 1739 struct sk_buff *skb;
282b3a05
JPM		 1740
1741 if (l->state == LINK_ESTABLISHING)
1742 mtyp = ACTIVATE_MSG;
1743
8d6e79d3 1744 tipc_link_build_proto_msg(l, mtyp, 0, 0, 0, 0, 0, xmitq);
634696b1
JPM		 1745
1746 /* Inform peer that this endpoint is going down if applicable */
1747 skb = skb_peek_tail(xmitq);
1748 if (skb && (l->state == LINK_RESET))
1749 msg_set_peer_stopping(buf_msg(skb), 1);
282b3a05
JPM		 1750}
1751
f9aa358a 1752/* tipc_link_build_nack_msg: prepare link nack message for transmission
e0a05ebe
JPM		 1753 * Note that sending of broadcast NACK is coordinated among nodes, to
1754 * reduce the risk of NACK storms towards the sender
f9aa358a 1755 */
e0a05ebe
JPM		 1756static int tipc_link_build_nack_msg(struct tipc_link *l,
1757 struct sk_buff_head *xmitq)
f9aa358a
JPM		 1758{
1759 u32 def_cnt = ++l->stats.deferred_recv;
02288248
JM		 1760 struct sk_buff_head *dfq = &l->deferdq;
1761 u32 defq_len = skb_queue_len(dfq);
e0a05ebe 1762 int match1, match2;
f9aa358a 1763
e0a05ebe
JPM		 1764 if (link_is_bc_rcvlink(l)) {
1765 match1 = def_cnt & 0xf;
1766 match2 = tipc_own_addr(l->net) & 0xf;
1767 if (match1 == match2)
1768 return TIPC_LINK_SND_STATE;
1769 return 0;
1770 }
52666986 1771
02288248
JM		 1772 if (defq_len >= 3 && !((defq_len - 3) % 16)) {
1773 u16 rcvgap = buf_seqno(skb_peek(dfq)) - l->rcv_nxt;
1774
1775 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0,
1776 rcvgap, 0, 0, xmitq);
1777 }
e0a05ebe 1778 return 0;
f9aa358a
JPM		 1779}
1780
d999297c 1781/* tipc_link_rcv - process TIPC packets/messages arriving from off-node
f9aa358a 1782 * @l: the link that should handle the message
d999297c
JPM		 1783 * @skb: TIPC packet
1784 * @xmitq: queue to place packets to be sent after this call
1785 */
1786int tipc_link_rcv(struct tipc_link *l, struct sk_buff *skb,
1787 struct sk_buff_head *xmitq)
1788{
f9aa358a 1789 struct sk_buff_head *defq = &l->deferdq;
382f598f 1790 struct tipc_msg *hdr = buf_msg(skb);
81204c49 1791 u16 seqno, rcv_nxt, win_lim;
16ad3f40 1792 int released = 0;
d999297c
JPM		 1793 int rc = 0;
1794
382f598f
TL		 1795 /* Verify and update link state */
1796 if (unlikely(msg_user(hdr) == LINK_PROTOCOL))
1797 return tipc_link_proto_rcv(l, skb, xmitq);
1798
1799 /* Don't send probe at next timeout expiration */
1800 l->silent_intv_cnt = 0;
1801
f9aa358a 1802 do {
d999297c 1803 hdr = buf_msg(skb);
f9aa358a
JPM		 1804 seqno = msg_seqno(hdr);
1805 rcv_nxt = l->rcv_nxt;
81204c49 1806 win_lim = rcv_nxt + TIPC_MAX_LINK_WIN;
d999297c 1807
662921cd 1808 if (unlikely(!link_is_up(l))) {
73f646ce
JPM		 1809 if (l->state == LINK_ESTABLISHING)
1810 rc = TIPC_LINK_UP_EVT;
16ad3f40
JM		 1811 kfree_skb(skb);
1812 break;
d999297c
JPM		 1813 }
1814
81204c49
JPM		 1815 /* Drop if outside receive window */
1816 if (unlikely(less(seqno, rcv_nxt) || more(seqno, win_lim))) {
1817 l->stats.duplicates++;
16ad3f40
JM		 1818 kfree_skb(skb);
1819 break;
d999297c 1820 }
d7626b5a
TL		 1821 released += tipc_link_advance_transmq(l, l, msg_ack(hdr), 0,
1822 NULL, NULL, NULL, NULL);
d999297c 1823
81204c49
JPM		 1824 /* Defer delivery if sequence gap */
1825 if (unlikely(seqno != rcv_nxt)) {
03b6fefd
TL		 1826 if (!__tipc_skb_queue_sorted(defq, seqno, skb))
1827 l->stats.duplicates++;
e0a05ebe 1828 rc |= tipc_link_build_nack_msg(l, xmitq);
f9aa358a 1829 break;
d999297c
JPM		 1830 }
1831
81204c49 1832 /* Deliver packet */
d999297c 1833 l->rcv_nxt++;
95901122 1834 l->stats.recv_pkts++;
58ee86b8
TL		 1835
1836 if (unlikely(msg_user(hdr) == TUNNEL_PROTOCOL))
1837 rc |= tipc_link_tnl_rcv(l, skb, l->inputq);
1838 else if (!tipc_data_input(l, skb, l->inputq))
1839 rc |= tipc_link_input(l, skb, l->inputq, &l->reasm_buf);
f9aa358a 1840 if (unlikely(++l->rcv_unacked >= TIPC_MIN_LINK_WIN))
34b9cd64 1841 rc |= tipc_link_build_state_msg(l, xmitq);
02d11ca2 1842 if (unlikely(rc & ~TIPC_LINK_SND_STATE))
52666986 1843 break;
382f598f 1844 } while ((skb = __tipc_skb_dequeue(defq, l->rcv_nxt)));
f9aa358a 1845
16ad3f40
JM		 1846 /* Forward queues and wake up waiting users */
1847 if (released) {
1848 tipc_link_update_cwin(l, released, 0);
1849 tipc_link_advance_backlog(l, xmitq);
1850 if (unlikely(!skb_queue_empty(&l->wakeupq)))
1851 link_prepare_wakeup(l);
1852 }
d999297c
JPM		 1853 return rc;
1854}
1855
426cc2b8 1856static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe,
8d6e79d3
JM		 1857 bool probe_reply, u16 rcvgap,
1858 int tolerance, int priority,
426cc2b8
JPM		 1859 struct sk_buff_head *xmitq)
1860{
03b6fefd
TL		 1861 struct tipc_mon_state *mstate = &l->mon_state;
1862 struct sk_buff_head *dfq = &l->deferdq;
02d11ca2 1863 struct tipc_link *bcl = l->bc_rcvlink;
e74a386d 1864 struct tipc_msg *hdr;
03b6fefd 1865 struct sk_buff *skb;
02d11ca2 1866 bool node_up = link_is_up(bcl);
03b6fefd 1867 u16 glen = 0, bc_rcvgap = 0;
35c55c98
JPM		 1868 int dlen = 0;
1869 void *data;
426cc2b8
JPM		 1870
1871 /* Don't send protocol message during reset or link failover */
662921cd 1872 if (tipc_link_is_blocked(l))
426cc2b8
JPM		 1873 return;
1874
e74a386d
JPM		 1875 if (!tipc_link_is_up(l) && (mtyp == STATE_MSG))
1876 return;
1877
02288248 1878 if ((probe || probe_reply) && !skb_queue_empty(dfq))
e74a386d
JPM		 1879 rcvgap = buf_seqno(skb_peek(dfq)) - l->rcv_nxt;
1880
1881 skb = tipc_msg_create(LINK_PROTOCOL, mtyp, INT_H_SIZE,
9195948f
TL		 1882 tipc_max_domain_size + MAX_GAP_ACK_BLKS_SZ,
1883 l->addr, tipc_own_addr(l->net), 0, 0, 0);
e74a386d
JPM		 1884 if (!skb)
1885 return;
1886
1887 hdr = buf_msg(skb);
35c55c98 1888 data = msg_data(hdr);
e74a386d
JPM		 1889 msg_set_session(hdr, l->session);
1890 msg_set_bearer_id(hdr, l->bearer_id);
426cc2b8 1891 msg_set_net_plane(hdr, l->net_plane);
52666986
JPM		 1892 msg_set_next_sent(hdr, l->snd_nxt);
1893 msg_set_ack(hdr, l->rcv_nxt - 1);
02d11ca2 1894 msg_set_bcast_ack(hdr, bcl->rcv_nxt - 1);
06bd2b1e 1895 msg_set_bc_ack_invalid(hdr, !node_up);
52666986 1896 msg_set_last_bcast(hdr, l->bc_sndlink->snd_nxt - 1);
426cc2b8
JPM		 1897 msg_set_link_tolerance(hdr, tolerance);
1898 msg_set_linkprio(hdr, priority);
1899 msg_set_redundant_link(hdr, node_up);
1900 msg_set_seq_gap(hdr, 0);
52666986 1901 msg_set_seqno(hdr, l->snd_nxt + U16_MAX / 2);
426cc2b8
JPM		 1902
1903 if (mtyp == STATE_MSG) {
9012de50
JM		 1904 if (l->peer_caps & TIPC_LINK_PROTO_SEQNO)
1905 msg_set_seqno(hdr, l->snd_nxt_state++);
e74a386d 1906 msg_set_seq_gap(hdr, rcvgap);
03b6fefd
TL		 1907 bc_rcvgap = link_bc_rcv_gap(bcl);
1908 msg_set_bc_gap(hdr, bc_rcvgap);
426cc2b8 1909 msg_set_probe(hdr, probe);
8d6e79d3 1910 msg_set_is_keepalive(hdr, probe || probe_reply);
9195948f 1911 if (l->peer_caps & TIPC_GAP_ACK_BLOCK)
d7626b5a 1912 glen = tipc_build_gap_ack_blks(l, hdr);
9195948f
TL		 1913 tipc_mon_prep(l->net, data + glen, &dlen, mstate, l->bearer_id);
1914 msg_set_size(hdr, INT_H_SIZE + glen + dlen);
1915 skb_trim(skb, INT_H_SIZE + glen + dlen);
426cc2b8 1916 l->stats.sent_states++;
52666986 1917 l->rcv_unacked = 0;
426cc2b8
JPM		 1918 } else {
1919 /* RESET_MSG or ACTIVATE_MSG */
91986ee1
TL		 1920 if (mtyp == ACTIVATE_MSG) {
1921 msg_set_dest_session_valid(hdr, 1);
1922 msg_set_dest_session(hdr, l->peer_session);
1923 }
426cc2b8 1924 msg_set_max_pkt(hdr, l->advertised_mtu);
35c55c98
JPM		 1925 strcpy(data, l->if_name);
1926 msg_set_size(hdr, INT_H_SIZE + TIPC_MAX_IF_NAME);
1927 skb_trim(skb, INT_H_SIZE + TIPC_MAX_IF_NAME);
426cc2b8 1928 }
e74a386d
JPM		 1929 if (probe)
1930 l->stats.sent_probes++;
1931 if (rcvgap)
1932 l->stats.sent_nacks++;
03b6fefd
TL		 1933 if (bc_rcvgap)
1934 bcl->stats.sent_nacks++;
426cc2b8 1935 skb->priority = TC_PRIO_CONTROL;
6e498158 1936 __skb_queue_tail(xmitq, skb);
26574db0 1937 trace_tipc_proto_build(skb, false, l->name);
b97bf3fd
PL		 1938}
1939
c140eb16
LDC		 1940void tipc_link_create_dummy_tnl_msg(struct tipc_link *l,
1941 struct sk_buff_head *xmitq)
1942{
1943 u32 onode = tipc_own_addr(l->net);
1944 struct tipc_msg *hdr, *ihdr;
1945 struct sk_buff_head tnlq;
1946 struct sk_buff *skb;
1947 u32 dnode = l->addr;
1948
e654f9f5 1949 __skb_queue_head_init(&tnlq);
c140eb16
LDC		 1950 skb = tipc_msg_create(TUNNEL_PROTOCOL, FAILOVER_MSG,
1951 INT_H_SIZE, BASIC_H_SIZE,
1952 dnode, onode, 0, 0, 0);
1953 if (!skb) {
1954 pr_warn("%sunable to create tunnel packet\n", link_co_err);
1955 return;
1956 }
1957
1958 hdr = buf_msg(skb);
1959 msg_set_msgcnt(hdr, 1);
1960 msg_set_bearer_id(hdr, l->peer_bearer_id);
1961
1962 ihdr = (struct tipc_msg *)msg_data(hdr);
1963 tipc_msg_init(onode, ihdr, TIPC_LOW_IMPORTANCE, TIPC_DIRECT_MSG,
1964 BASIC_H_SIZE, dnode);
1965 msg_set_errcode(ihdr, TIPC_ERR_NO_PORT);
1966 __skb_queue_tail(&tnlq, skb);
1967 tipc_link_xmit(l, &tnlq, xmitq);
1968}
1969
6e498158 1970/* tipc_link_tnl_prepare(): prepare and return a list of tunnel packets
f9aa358a 1971 * with contents of the link's transmit and backlog queues.
b97bf3fd 1972 */
6e498158
JPM		 1973void tipc_link_tnl_prepare(struct tipc_link *l, struct tipc_link *tnl,
1974 int mtyp, struct sk_buff_head *xmitq)
b97bf3fd 1975{
58ee86b8 1976 struct sk_buff_head *fdefq = &tnl->failover_deferdq;
6e498158
JPM		 1977 struct sk_buff *skb, *tnlskb;
1978 struct tipc_msg *hdr, tnlhdr;
1979 struct sk_buff_head *queue = &l->transmq;
2320bcda 1980 struct sk_buff_head tmpxq, tnlq, frags;
6e498158 1981 u16 pktlen, pktcnt, seqno = l->snd_nxt;
2320bcda 1982 bool pktcnt_need_update = false;
4929a932 1983 u16 syncpt;
2320bcda 1984 int rc;
b97bf3fd 1985
6e498158 1986 if (!tnl)
b97bf3fd
PL		 1987 return;
1988
e654f9f5 1989 __skb_queue_head_init(&tnlq);
4929a932
TL		 1990 /* Link Synching:
1991 * From now on, send only one single ("dummy") SYNCH message
1992 * to peer. The SYNCH message does not contain any data, just
1993 * a header conveying the synch point to the peer.
1994 */
1995 if (mtyp == SYNCH_MSG && (tnl->peer_caps & TIPC_TUNNEL_ENHANCED)) {
1996 tnlskb = tipc_msg_create(TUNNEL_PROTOCOL, SYNCH_MSG,
1997 INT_H_SIZE, 0, l->addr,
1998 tipc_own_addr(l->net),
1999 0, 0, 0);
2000 if (!tnlskb) {
2001 pr_warn("%sunable to create dummy SYNCH_MSG\n",
2002 link_co_err);
2003 return;
2004 }
2005
2006 hdr = buf_msg(tnlskb);
2007 syncpt = l->snd_nxt + skb_queue_len(&l->backlogq) - 1;
2008 msg_set_syncpt(hdr, syncpt);
2009 msg_set_bearer_id(hdr, l->peer_bearer_id);
2010 __skb_queue_tail(&tnlq, tnlskb);
2011 tipc_link_xmit(tnl, &tnlq, xmitq);
2012 return;
2013 }
2014
d0d605c5
TL		 2015 __skb_queue_head_init(&tmpxq);
2016 __skb_queue_head_init(&frags);
2017 /* At least one packet required for safe algorithm => add dummy */
2018 skb = tipc_msg_create(TIPC_LOW_IMPORTANCE, TIPC_DIRECT_MSG,
2019 BASIC_H_SIZE, 0, l->addr, tipc_own_addr(l->net),
2020 0, 0, TIPC_ERR_NO_PORT);
2021 if (!skb) {
2022 pr_warn("%sunable to create tunnel packet\n", link_co_err);
2023 return;
2024 }
2025 __skb_queue_tail(&tnlq, skb);
2026 tipc_link_xmit(l, &tnlq, &tmpxq);
2027 __skb_queue_purge(&tmpxq);
2028
6e498158 2029 /* Initialize reusable tunnel packet header */
e74a386d 2030 tipc_msg_init(tipc_own_addr(l->net), &tnlhdr, TUNNEL_PROTOCOL,
6e498158 2031 mtyp, INT_H_SIZE, l->addr);
58ee86b8
TL		 2032 if (mtyp == SYNCH_MSG)
2033 pktcnt = l->snd_nxt - buf_seqno(skb_peek(&l->transmq));
2034 else
2035 pktcnt = skb_queue_len(&l->transmq);
2036 pktcnt += skb_queue_len(&l->backlogq);
6e498158
JPM		 2037 msg_set_msgcnt(&tnlhdr, pktcnt);
2038 msg_set_bearer_id(&tnlhdr, l->peer_bearer_id);
2039tnl:
2040 /* Wrap each packet into a tunnel packet */
05dcc5aa 2041 skb_queue_walk(queue, skb) {
6e498158
JPM		 2042 hdr = buf_msg(skb);
2043 if (queue == &l->backlogq)
2044 msg_set_seqno(hdr, seqno++);
2045 pktlen = msg_size(hdr);
2320bcda
TL		 2046
2047 /* Tunnel link MTU is not large enough? This could be
2048 * due to:
2049 * 1) Link MTU has just changed or set differently;
2050 * 2) Or FAILOVER on the top of a SYNCH message
2051 *
2052 * The 2nd case should not happen if peer supports
2053 * TIPC_TUNNEL_ENHANCED
2054 */
2055 if (pktlen > tnl->mtu - INT_H_SIZE) {
2056 if (mtyp == FAILOVER_MSG &&
2057 (tnl->peer_caps & TIPC_TUNNEL_ENHANCED)) {
2058 rc = tipc_msg_fragment(skb, &tnlhdr, tnl->mtu,
2059 &frags);
2060 if (rc) {
2061 pr_warn("%sunable to frag msg: rc %d\n",
2062 link_co_err, rc);
2063 return;
2064 }
2065 pktcnt += skb_queue_len(&frags) - 1;
2066 pktcnt_need_update = true;
2067 skb_queue_splice_tail_init(&frags, &tnlq);
2068 continue;
2069 }
2070 /* Unluckily, peer doesn't have TIPC_TUNNEL_ENHANCED
2071 * => Just warn it and return!
2072 */
2073 pr_warn_ratelimited("%stoo large msg <%d, %d>: %d!\n",
2074 link_co_err, msg_user(hdr),
2075 msg_type(hdr), msg_size(hdr));
2076 return;
2077 }
2078
6e498158 2079 msg_set_size(&tnlhdr, pktlen + INT_H_SIZE);
57d5f64d 2080 tnlskb = tipc_buf_acquire(pktlen + INT_H_SIZE, GFP_ATOMIC);
6e498158
JPM		 2081 if (!tnlskb) {
2082 pr_warn("%sunable to send packet\n", link_co_err);
b97bf3fd
PL		 2083 return;
2084 }
6e498158
JPM		 2085 skb_copy_to_linear_data(tnlskb, &tnlhdr, INT_H_SIZE);
2086 skb_copy_to_linear_data_offset(tnlskb, INT_H_SIZE, hdr, pktlen);
2087 __skb_queue_tail(&tnlq, tnlskb);
b97bf3fd 2088 }
6e498158
JPM		 2089 if (queue != &l->backlogq) {
2090 queue = &l->backlogq;
2091 goto tnl;
f006c9c7 2092 }
1dab3d5a 2093
2320bcda
TL		 2094 if (pktcnt_need_update)
2095 skb_queue_walk(&tnlq, skb) {
2096 hdr = buf_msg(skb);
2097 msg_set_msgcnt(hdr, pktcnt);
2098 }
2099
6e498158 2100 tipc_link_xmit(tnl, &tnlq, xmitq);
b97bf3fd 2101
6e498158
JPM		 2102 if (mtyp == FAILOVER_MSG) {
2103 tnl->drop_point = l->rcv_nxt;
2104 tnl->failover_reasm_skb = l->reasm_buf;
2105 l->reasm_buf = NULL;
58ee86b8
TL		 2106
2107 /* Failover the link's deferdq */
2108 if (unlikely(!skb_queue_empty(fdefq))) {
2109 pr_warn("Link failover deferdq not empty: %d!\n",
2110 skb_queue_len(fdefq));
2111 __skb_queue_purge(fdefq);
2112 }
2113 skb_queue_splice_init(&l->deferdq, fdefq);
2da71425 2114 }
b97bf3fd
PL		 2115}
2116
c0b14a08
TL		 2117/**
2118 * tipc_link_failover_prepare() - prepare tnl for link failover
2119 *
2120 * This is a special version of the precursor - tipc_link_tnl_prepare(),
2121 * see the tipc_node_link_failover() for details
2122 *
2123 * @l: failover link
2124 * @tnl: tunnel link
2125 * @xmitq: queue for messages to be xmited
2126 */
2127void tipc_link_failover_prepare(struct tipc_link *l, struct tipc_link *tnl,
2128 struct sk_buff_head *xmitq)
2129{
2130 struct sk_buff_head *fdefq = &tnl->failover_deferdq;
2131
2132 tipc_link_create_dummy_tnl_msg(tnl, xmitq);
2133
8ebed8ae 2134 /* This failover link endpoint was never established before,
c0b14a08
TL		 2135 * so it has not received anything from peer.
2136 * Otherwise, it must be a normal failover situation or the
2137 * node has entered SELF_DOWN_PEER_LEAVING and both peer nodes
2138 * would have to start over from scratch instead.
2139 */
c0b14a08
TL		 2140 tnl->drop_point = 1;
2141 tnl->failover_reasm_skb = NULL;
2142
2143 /* Initiate the link's failover deferdq */
2144 if (unlikely(!skb_queue_empty(fdefq))) {
2145 pr_warn("Link failover deferdq not empty: %d!\n",
2146 skb_queue_len(fdefq));
2147 __skb_queue_purge(fdefq);
2148 }
2149}
2150
7ea817f4
JM		 2151/* tipc_link_validate_msg(): validate message against current link state
2152 * Returns true if message should be accepted, otherwise false
2153 */
2154bool tipc_link_validate_msg(struct tipc_link *l, struct tipc_msg *hdr)
2155{
2156 u16 curr_session = l->peer_session;
2157 u16 session = msg_session(hdr);
2158 int mtyp = msg_type(hdr);
2159
2160 if (msg_user(hdr) != LINK_PROTOCOL)
2161 return true;
2162
2163 switch (mtyp) {
2164 case RESET_MSG:
2165 if (!l->in_session)
2166 return true;
2167 /* Accept only RESET with new session number */
2168 return more(session, curr_session);
2169 case ACTIVATE_MSG:
2170 if (!l->in_session)
2171 return true;
2172 /* Accept only ACTIVATE with new or current session number */
2173 return !less(session, curr_session);
2174 case STATE_MSG:
2175 /* Accept only STATE with current session number */
2176 if (!l->in_session)
2177 return false;
2178 if (session != curr_session)
2179 return false;
d949cfed
LDC		 2180 /* Extra sanity check */
2181 if (!link_is_up(l) && msg_ack(hdr))
2182 return false;
7ea817f4
JM		 2183 if (!(l->peer_caps & TIPC_LINK_PROTO_SEQNO))
2184 return true;
2185 /* Accept only STATE with new sequence number */
2186 return !less(msg_seqno(hdr), l->rcv_nxt_state);
2187 default:
2188 return false;
2189 }
2190}
2191
d999297c
JPM		 2192/* tipc_link_proto_rcv(): receive link level protocol message :
2193 * Note that network plane id propagates through the network, and may
2194 * change at any time. The node with lowest numerical id determines
2195 * network plane
2196 */
2197static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb,
2198 struct sk_buff_head *xmitq)
2199{
2200 struct tipc_msg *hdr = buf_msg(skb);
9195948f 2201 struct tipc_gap_ack_blks *ga = NULL;
d7626b5a 2202 bool reply = msg_probe(hdr), retransmitted = false;
9aa422ad 2203 u32 dlen = msg_data_sz(hdr), glen = 0;
d999297c
JPM		 2204 u16 peers_snd_nxt = msg_next_sent(hdr);
2205 u16 peers_tol = msg_link_tolerance(hdr);
2206 u16 peers_prio = msg_linkprio(hdr);
d7626b5a
TL		 2207 u16 gap = msg_seq_gap(hdr);
2208 u16 ack = msg_ack(hdr);
2be80c2d 2209 u16 rcv_nxt = l->rcv_nxt;
d7626b5a 2210 u16 rcvgap = 0;
73f646ce 2211 int mtyp = msg_type(hdr);
d7626b5a 2212 int rc = 0, released;
d999297c 2213 char *if_name;
d7626b5a 2214 void *data;
d999297c 2215
26574db0 2216 trace_tipc_proto_rcv(skb, false, l->name);
9aa422ad
JM		 2217
2218 if (dlen > U16_MAX)
2219 goto exit;
2220
52666986 2221 if (tipc_link_is_blocked(l) || !xmitq)
d999297c
JPM		 2222 goto exit;
2223
e74a386d 2224 if (tipc_own_addr(l->net) > msg_prevnode(hdr))
d999297c
JPM		 2225 l->net_plane = msg_net_plane(hdr);
2226
743117a9
Y		 2227 if (skb_linearize(skb))
2228 goto exit;
2229
35c55c98
JPM		 2230 hdr = buf_msg(skb);
2231 data = msg_data(hdr);
2232
26574db0
TL		 2233 if (!tipc_link_validate_msg(l, hdr)) {
2234 trace_tipc_skb_dump(skb, false, "PROTO invalid (1)!");
2235 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "PROTO invalid (1)!");
7ea817f4 2236 goto exit;
26574db0 2237 }
7ea817f4 2238
73f646ce 2239 switch (mtyp) {
d999297c 2240 case RESET_MSG:
d999297c 2241 case ACTIVATE_MSG:
d999297c
JPM		 2242 /* Complete own link name with peer's interface name */
2243 if_name = strrchr(l->name, ':') + 1;
2244 if (sizeof(l->name) - (if_name - l->name) <= TIPC_MAX_IF_NAME)
2245 break;
2246 if (msg_data_sz(hdr) < TIPC_MAX_IF_NAME)
2247 break;
35c55c98 2248 strncpy(if_name, data, TIPC_MAX_IF_NAME);
d999297c
JPM		 2249
2250 /* Update own tolerance if peer indicates a non-zero value */
047491ea 2251 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL)) {
d999297c 2252 l->tolerance = peers_tol;
047491ea
JM		 2253 l->bc_rcvlink->tolerance = peers_tol;
2254 }
d999297c
JPM		 2255 /* Update own priority if peer's priority is higher */
2256 if (in_range(peers_prio, l->priority + 1, TIPC_MAX_LINK_PRI))
2257 l->priority = peers_prio;
2258
7ab412d3
JM		 2259 /* If peer is going down we want full re-establish cycle */
2260 if (msg_peer_stopping(hdr)) {
634696b1 2261 rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
7ab412d3
JM		 2262 break;
2263 }
91986ee1
TL		 2264
2265 /* If this endpoint was re-created while peer was ESTABLISHING
2266 * it doesn't know current session number. Force re-synch.
2267 */
2268 if (mtyp == ACTIVATE_MSG && msg_dest_session_valid(hdr) &&
2269 l->session != msg_dest_session(hdr)) {
2270 if (less(l->session, msg_dest_session(hdr)))
2271 l->session = msg_dest_session(hdr) + 1;
2272 break;
2273 }
2274
7ab412d3
JM		 2275 /* ACTIVATE_MSG serves as PEER_RESET if link is already down */
2276 if (mtyp == RESET_MSG || !link_is_up(l))
73f646ce
JPM		 2277 rc = tipc_link_fsm_evt(l, LINK_PEER_RESET_EVT);
2278
2279 /* ACTIVATE_MSG takes up link if it was already locally reset */
7ab412d3 2280 if (mtyp == ACTIVATE_MSG && l->state == LINK_ESTABLISHING)
73f646ce
JPM		 2281 rc = TIPC_LINK_UP_EVT;
2282
d999297c 2283 l->peer_session = msg_session(hdr);
7ea817f4 2284 l->in_session = true;
d999297c 2285 l->peer_bearer_id = msg_bearer_id(hdr);
d999297c
JPM		 2286 if (l->mtu > msg_max_pkt(hdr))
2287 l->mtu = msg_max_pkt(hdr);
2288 break;
662921cd 2289
d999297c 2290 case STATE_MSG:
c79fcc27
TN		 2291 /* Validate Gap ACK blocks, drop if invalid */
2292 glen = tipc_get_gap_ack_blks(&ga, l, hdr, true);
2293 if (glen > dlen)
2294 break;
2295
9012de50
JM		 2296 l->rcv_nxt_state = msg_seqno(hdr) + 1;
2297
d999297c 2298 /* Update own tolerance if peer indicates a non-zero value */
047491ea 2299 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL)) {
d999297c 2300 l->tolerance = peers_tol;
047491ea
JM		 2301 l->bc_rcvlink->tolerance = peers_tol;
2302 }
f7967556
JPM		 2303 /* Update own prio if peer indicates a different value */
2304 if ((peers_prio != l->priority) &&
2305 in_range(peers_prio, 1, TIPC_MAX_LINK_PRI)) {
81729810
RA		 2306 l->priority = peers_prio;
2307 rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
2308 }
2309
d999297c
JPM		 2310 l->silent_intv_cnt = 0;
2311 l->stats.recv_states++;
2312 if (msg_probe(hdr))
2313 l->stats.recv_probes++;
73f646ce
JPM		 2314
2315 if (!link_is_up(l)) {
2316 if (l->state == LINK_ESTABLISHING)
2317 rc = TIPC_LINK_UP_EVT;
d999297c 2318 break;
73f646ce 2319 }
9195948f 2320
9195948f 2321 tipc_mon_rcv(l->net, data + glen, dlen - glen, l->addr,
35c55c98 2322 &l->mon_state, l->bearer_id);
d999297c 2323
662921cd 2324 /* Send NACK if peer has sent pkts we haven't received yet */
d3b09995
JM		 2325 if ((reply || msg_is_keepalive(hdr)) &&
2326 more(peers_snd_nxt, rcv_nxt) &&
2327 !tipc_link_is_synching(l) &&
2328 skb_queue_empty(&l->deferdq))
d999297c 2329 rcvgap = peers_snd_nxt - l->rcv_nxt;
8d6e79d3
JM		 2330 if (rcvgap || reply)
2331 tipc_link_build_proto_msg(l, STATE_MSG, 0, reply,
2332 rcvgap, 0, 0, xmitq);
d999297c 2333
d7626b5a
TL		 2334 released = tipc_link_advance_transmq(l, l, ack, gap, ga, xmitq,
2335 &retransmitted, &rc);
9195948f 2336 if (gap)
d999297c 2337 l->stats.recv_nacks++;
d7626b5a
TL		 2338 if (released || retransmitted)
2339 tipc_link_update_cwin(l, released, retransmitted);
2340 if (released)
2341 tipc_link_advance_backlog(l, xmitq);
d999297c
JPM		 2342 if (unlikely(!skb_queue_empty(&l->wakeupq)))
2343 link_prepare_wakeup(l);
2344 }
2345exit:
2346 kfree_skb(skb);
2347 return rc;
2348}
2349
52666986
JPM		 2350/* tipc_link_build_bc_proto_msg() - create broadcast protocol message
2351 */
2352static bool tipc_link_build_bc_proto_msg(struct tipc_link *l, bool bcast,
2353 u16 peers_snd_nxt,
2354 struct sk_buff_head *xmitq)
2355{
2356 struct sk_buff *skb;
2357 struct tipc_msg *hdr;
2358 struct sk_buff *dfrd_skb = skb_peek(&l->deferdq);
2359 u16 ack = l->rcv_nxt - 1;
2360 u16 gap_to = peers_snd_nxt - 1;
2361
2362 skb = tipc_msg_create(BCAST_PROTOCOL, STATE_MSG, INT_H_SIZE,
e74a386d 2363 0, l->addr, tipc_own_addr(l->net), 0, 0, 0);
52666986
JPM		 2364 if (!skb)
2365 return false;
2366 hdr = buf_msg(skb);
2367 msg_set_last_bcast(hdr, l->bc_sndlink->snd_nxt - 1);
2368 msg_set_bcast_ack(hdr, ack);
2369 msg_set_bcgap_after(hdr, ack);
2370 if (dfrd_skb)
2371 gap_to = buf_seqno(dfrd_skb) - 1;
2372 msg_set_bcgap_to(hdr, gap_to);
2373 msg_set_non_seq(hdr, bcast);
2374 __skb_queue_tail(xmitq, skb);
2375 return true;
2376}
2377
2378/* tipc_link_build_bc_init_msg() - synchronize broadcast link endpoints.
2379 *
2380 * Give a newly added peer node the sequence number where it should
2381 * start receiving and acking broadcast packets.
2382 */
742e0383
WF		 2383static void tipc_link_build_bc_init_msg(struct tipc_link *l,
2384 struct sk_buff_head *xmitq)
52666986
JPM		 2385{
2386 struct sk_buff_head list;
2387
2388 __skb_queue_head_init(&list);
2389 if (!tipc_link_build_bc_proto_msg(l->bc_rcvlink, false, 0, &list))
2390 return;
06bd2b1e 2391 msg_set_bc_ack_invalid(buf_msg(skb_peek(&list)), true);
52666986
JPM		 2392 tipc_link_xmit(l, &list, xmitq);
2393}
2394
2395/* tipc_link_bc_init_rcv - receive initial broadcast synch data from peer
2396 */
2397void tipc_link_bc_init_rcv(struct tipc_link *l, struct tipc_msg *hdr)
2398{
2399 int mtyp = msg_type(hdr);
2400 u16 peers_snd_nxt = msg_bc_snd_nxt(hdr);
2401
2402 if (link_is_up(l))
2403 return;
2404
2405 if (msg_user(hdr) == BCAST_PROTOCOL) {
2406 l->rcv_nxt = peers_snd_nxt;
2407 l->state = LINK_ESTABLISHED;
2408 return;
2409 }
2410
2411 if (l->peer_caps & TIPC_BCAST_SYNCH)
2412 return;
2413
2414 if (msg_peer_node_is_up(hdr))
2415 return;
2416
2417 /* Compatibility: accept older, less safe initial synch data */
2418 if ((mtyp == RESET_MSG) || (mtyp == ACTIVATE_MSG))
2419 l->rcv_nxt = peers_snd_nxt;
2420}
2421
2422/* tipc_link_bc_sync_rcv - update rcv link according to peer's send state
2423 */
02d11ca2
JPM		 2424int tipc_link_bc_sync_rcv(struct tipc_link *l, struct tipc_msg *hdr,
2425 struct sk_buff_head *xmitq)
52666986
JPM		 2426{
2427 u16 peers_snd_nxt = msg_bc_snd_nxt(hdr);
02d11ca2 2428 int rc = 0;
52666986
JPM		 2429
2430 if (!link_is_up(l))
02d11ca2 2431 return rc;
52666986
JPM		 2432
2433 if (!msg_peer_node_is_up(hdr))
02d11ca2 2434 return rc;
52666986 2435
a99df449 2436 /* Open when peer acknowledges our bcast init msg (pkt #1) */
2d18ac4b
JPM		 2437 if (msg_ack(hdr))
2438 l->bc_peer_is_up = true;
2439
2440 if (!l->bc_peer_is_up)
02d11ca2 2441 return rc;
52666986
JPM		 2442
2443 /* Ignore if peers_snd_nxt goes beyond receive window */
2444 if (more(peers_snd_nxt, l->rcv_nxt + l->window))
02d11ca2
JPM		 2445 return rc;
2446
02d11ca2
JPM		 2447 l->snd_nxt = peers_snd_nxt;
2448 if (link_bc_rcv_gap(l))
2449 rc |= TIPC_LINK_SND_STATE;
2450
2451 /* Return now if sender supports nack via STATE messages */
2452 if (l->peer_caps & TIPC_BCAST_STATE_NACK)
2453 return rc;
2454
2455 /* Otherwise, be backwards compatible */
52666986
JPM		 2456
2457 if (!more(peers_snd_nxt, l->rcv_nxt)) {
2458 l->nack_state = BC_NACK_SND_CONDITIONAL;
02d11ca2 2459 return 0;
52666986
JPM		 2460 }
2461
2462 /* Don't NACK if one was recently sent or peeked */
2463 if (l->nack_state == BC_NACK_SND_SUPPRESS) {
2464 l->nack_state = BC_NACK_SND_UNCONDITIONAL;
02d11ca2 2465 return 0;
52666986
JPM		 2466 }
2467
2468 /* Conditionally delay NACK sending until next synch rcv */
2469 if (l->nack_state == BC_NACK_SND_CONDITIONAL) {
2470 l->nack_state = BC_NACK_SND_UNCONDITIONAL;
2471 if ((peers_snd_nxt - l->rcv_nxt) < TIPC_MIN_LINK_WIN)
02d11ca2 2472 return 0;
52666986
JPM		 2473 }
2474
2475 /* Send NACK now but suppress next one */
2476 tipc_link_build_bc_proto_msg(l, true, peers_snd_nxt, xmitq);
2477 l->nack_state = BC_NACK_SND_SUPPRESS;
02d11ca2 2478 return 0;
52666986
JPM		 2479}
2480
d7626b5a
TL		 2481int tipc_link_bc_ack_rcv(struct tipc_link *r, u16 acked, u16 gap,
2482 struct tipc_gap_ack_blks *ga,
a91d55d1
TL		 2483 struct sk_buff_head *xmitq,
2484 struct sk_buff_head *retrq)
52666986 2485{
d7626b5a
TL		 2486 struct tipc_link *l = r->bc_sndlink;
2487 bool unused = false;
2488 int rc = 0;
52666986 2489
d7626b5a
TL		 2490 if (!link_is_up(r) || !r->bc_peer_is_up)
2491 return 0;
52666986 2492
03b6fefd
TL		 2493 if (gap) {
2494 l->stats.recv_nacks++;
2495 r->stats.recv_nacks++;
2496 }
2497
d7626b5a
TL		 2498 if (less(acked, r->acked) || (acked == r->acked && !gap && !ga))
2499 return 0;
52666986 2500
c6ed7a5c 2501 trace_tipc_link_bc_ack(r, acked, gap, &l->transmq);
a91d55d1 2502 tipc_link_advance_transmq(l, r, acked, gap, ga, retrq, &unused, &rc);
52666986 2503
d7626b5a
TL		 2504 tipc_link_advance_backlog(l, xmitq);
2505 if (unlikely(!skb_queue_empty(&l->wakeupq)))
2506 link_prepare_wakeup(l);
2507
2508 return rc;
52666986
JPM		 2509}
2510
2511/* tipc_link_bc_nack_rcv(): receive broadcast nack message
02d11ca2
JPM		 2512 * This function is here for backwards compatibility, since
2513 * no BCAST_PROTOCOL/STATE messages occur from TIPC v2.5.
52666986
JPM		 2514 */
2515int tipc_link_bc_nack_rcv(struct tipc_link *l, struct sk_buff *skb,
2516 struct sk_buff_head *xmitq)
2517{
2518 struct tipc_msg *hdr = buf_msg(skb);
2519 u32 dnode = msg_destnode(hdr);
2520 int mtyp = msg_type(hdr);
2521 u16 acked = msg_bcast_ack(hdr);
2522 u16 from = acked + 1;
2523 u16 to = msg_bcgap_to(hdr);
2524 u16 peers_snd_nxt = to + 1;
2525 int rc = 0;
2526
2527 kfree_skb(skb);
2528
2529 if (!tipc_link_is_up(l) || !l->bc_peer_is_up)
2530 return 0;
2531
2532 if (mtyp != STATE_MSG)
2533 return 0;
2534
e74a386d 2535 if (dnode == tipc_own_addr(l->net)) {
a91d55d1
TL		 2536 rc = tipc_link_bc_ack_rcv(l, acked, to - acked, NULL, xmitq,
2537 xmitq);
52666986
JPM		 2538 l->stats.recv_nacks++;
2539 return rc;
2540 }
2541
2542 /* Msg for other node => suppress own NACK at next sync if applicable */
2543 if (more(peers_snd_nxt, l->rcv_nxt) && !less(l->rcv_nxt, from))
2544 l->nack_state = BC_NACK_SND_SUPPRESS;
2545
2546 return 0;
2547}
2548
16ad3f40 2549void tipc_link_set_queue_limits(struct tipc_link *l, u32 min_win, u32 max_win)
b97bf3fd 2550{
218527fe 2551 int max_bulk = TIPC_MAX_PUBL / (l->mtu / ITEM_SIZE);
e3eea1eb 2552
16ad3f40
JM		 2553 l->min_win = min_win;
2554 l->ssthresh = max_win;
2555 l->max_win = max_win;
2556 l->window = min_win;
2557 l->backlog[TIPC_LOW_IMPORTANCE].limit = min_win * 2;
2558 l->backlog[TIPC_MEDIUM_IMPORTANCE].limit = min_win * 4;
2559 l->backlog[TIPC_HIGH_IMPORTANCE].limit = min_win * 6;
2560 l->backlog[TIPC_CRITICAL_IMPORTANCE].limit = min_win * 8;
1f66d161 2561 l->backlog[TIPC_SYSTEM_IMPORTANCE].limit = max_bulk;
b97bf3fd
PL		 2562}
2563
b97bf3fd 2564/**
25764779 2565 * tipc_link_reset_stats - reset link statistics
1a90632d 2566 * @l: pointer to link
b97bf3fd 2567 */
38206d59 2568void tipc_link_reset_stats(struct tipc_link *l)
b97bf3fd 2569{
38206d59 2570 memset(&l->stats, 0, sizeof(l->stats));
b97bf3fd
PL		 2571}
2572
1a20cc25 2573static void link_print(struct tipc_link *l, const char *str)
b97bf3fd 2574{
1a20cc25 2575 struct sk_buff *hskb = skb_peek(&l->transmq);
c1ab3f1d 2576 u16 head = hskb ? msg_seqno(buf_msg(hskb)) : l->snd_nxt - 1;
1a20cc25 2577 u16 tail = l->snd_nxt - 1;
7a2f7d18 2578
662921cd 2579 pr_info("%s Link <%s> state %x\n", str, l->name, l->state);
1a20cc25
JPM		 2580 pr_info("XMTQ: %u [%u-%u], BKLGQ: %u, SNDNX: %u, RCVNX: %u\n",
2581 skb_queue_len(&l->transmq), head, tail,
2582 skb_queue_len(&l->backlogq), l->snd_nxt, l->rcv_nxt);
b97bf3fd 2583}
0655f6a8
RA		 2584
2585/* Parse and validate nested (link) properties valid for media, bearer and link
2586 */
2587int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[])
2588{
2589 int err;
2590
8cb08174
JB		 2591 err = nla_parse_nested_deprecated(props, TIPC_NLA_PROP_MAX, prop,
2592 tipc_nl_prop_policy, NULL);
0655f6a8
RA		 2593 if (err)
2594 return err;
2595
2596 if (props[TIPC_NLA_PROP_PRIO]) {
2597 u32 prio;
2598
2599 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
2600 if (prio > TIPC_MAX_LINK_PRI)
2601 return -EINVAL;
2602 }
2603
2604 if (props[TIPC_NLA_PROP_TOL]) {
2605 u32 tol;
2606
2607 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
2608 if ((tol < TIPC_MIN_LINK_TOL) || (tol > TIPC_MAX_LINK_TOL))
2609 return -EINVAL;
2610 }
2611
2612 if (props[TIPC_NLA_PROP_WIN]) {
16ad3f40 2613 u32 max_win;
0655f6a8 2614
16ad3f40
JM		 2615 max_win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2616 if (max_win < TIPC_DEF_LINK_WIN || max_win > TIPC_MAX_LINK_WIN)
0655f6a8
RA		 2617 return -EINVAL;
2618 }
2619
2620 return 0;
2621}
7be57fc6 2622
d8182804 2623static int __tipc_nl_add_stats(struct sk_buff *skb, struct tipc_stats *s)
7be57fc6
RA		 2624{
2625 int i;
2626 struct nlattr *stats;
2627
2628 struct nla_map {
2629 u32 key;
2630 u32 val;
2631 };
2632
2633 struct nla_map map[] = {
95901122 2634 {TIPC_NLA_STATS_RX_INFO, 0},
7be57fc6
RA		 2635 {TIPC_NLA_STATS_RX_FRAGMENTS, s->recv_fragments},
2636 {TIPC_NLA_STATS_RX_FRAGMENTED, s->recv_fragmented},
2637 {TIPC_NLA_STATS_RX_BUNDLES, s->recv_bundles},
2638 {TIPC_NLA_STATS_RX_BUNDLED, s->recv_bundled},
95901122 2639 {TIPC_NLA_STATS_TX_INFO, 0},
7be57fc6
RA		 2640 {TIPC_NLA_STATS_TX_FRAGMENTS, s->sent_fragments},
2641 {TIPC_NLA_STATS_TX_FRAGMENTED, s->sent_fragmented},
2642 {TIPC_NLA_STATS_TX_BUNDLES, s->sent_bundles},
2643 {TIPC_NLA_STATS_TX_BUNDLED, s->sent_bundled},
2644 {TIPC_NLA_STATS_MSG_PROF_TOT, (s->msg_length_counts) ?
2645 s->msg_length_counts : 1},
2646 {TIPC_NLA_STATS_MSG_LEN_CNT, s->msg_length_counts},
2647 {TIPC_NLA_STATS_MSG_LEN_TOT, s->msg_lengths_total},
2648 {TIPC_NLA_STATS_MSG_LEN_P0, s->msg_length_profile[0]},
2649 {TIPC_NLA_STATS_MSG_LEN_P1, s->msg_length_profile[1]},
2650 {TIPC_NLA_STATS_MSG_LEN_P2, s->msg_length_profile[2]},
2651 {TIPC_NLA_STATS_MSG_LEN_P3, s->msg_length_profile[3]},
2652 {TIPC_NLA_STATS_MSG_LEN_P4, s->msg_length_profile[4]},
2653 {TIPC_NLA_STATS_MSG_LEN_P5, s->msg_length_profile[5]},
2654 {TIPC_NLA_STATS_MSG_LEN_P6, s->msg_length_profile[6]},
2655 {TIPC_NLA_STATS_RX_STATES, s->recv_states},
2656 {TIPC_NLA_STATS_RX_PROBES, s->recv_probes},
2657 {TIPC_NLA_STATS_RX_NACKS, s->recv_nacks},
2658 {TIPC_NLA_STATS_RX_DEFERRED, s->deferred_recv},
2659 {TIPC_NLA_STATS_TX_STATES, s->sent_states},
2660 {TIPC_NLA_STATS_TX_PROBES, s->sent_probes},
2661 {TIPC_NLA_STATS_TX_NACKS, s->sent_nacks},
2662 {TIPC_NLA_STATS_TX_ACKS, s->sent_acks},
2663 {TIPC_NLA_STATS_RETRANSMITTED, s->retransmitted},
2664 {TIPC_NLA_STATS_DUPLICATES, s->duplicates},
2665 {TIPC_NLA_STATS_LINK_CONGS, s->link_congs},
2666 {TIPC_NLA_STATS_MAX_QUEUE, s->max_queue_sz},
2667 {TIPC_NLA_STATS_AVG_QUEUE, s->queue_sz_counts ?
2668 (s->accu_queue_sz / s->queue_sz_counts) : 0}
2669 };
2670
ae0be8de 2671 stats = nla_nest_start_noflag(skb, TIPC_NLA_LINK_STATS);
7be57fc6
RA		 2672 if (!stats)
2673 return -EMSGSIZE;
2674
2675 for (i = 0; i < ARRAY_SIZE(map); i++)
2676 if (nla_put_u32(skb, map[i].key, map[i].val))
2677 goto msg_full;
2678
2679 nla_nest_end(skb, stats);
2680
2681 return 0;
2682msg_full:
2683 nla_nest_cancel(skb, stats);
2684
2685 return -EMSGSIZE;
2686}
2687
2688/* Caller should hold appropriate locks to protect the link */
5be9c086
JPM		 2689int __tipc_nl_add_link(struct net *net, struct tipc_nl_msg *msg,
2690 struct tipc_link *link, int nlflags)
7be57fc6 2691{
23fd3eac 2692 u32 self = tipc_own_addr(net);
7be57fc6
RA		 2693 struct nlattr *attrs;
2694 struct nlattr *prop;
23fd3eac
JM		 2695 void *hdr;
2696 int err;
7be57fc6 2697
bfb3e5dd 2698 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
f2f67390 2699 nlflags, TIPC_NL_LINK_GET);
7be57fc6
RA		 2700 if (!hdr)
2701 return -EMSGSIZE;
2702
ae0be8de 2703 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_LINK);
7be57fc6
RA		 2704 if (!attrs)
2705 goto msg_full;
2706
2707 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, link->name))
2708 goto attr_msg_full;
23fd3eac 2709 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_DEST, tipc_cluster_mask(self)))
7be57fc6 2710 goto attr_msg_full;
ed193ece 2711 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_MTU, link->mtu))
7be57fc6 2712 goto attr_msg_full;
95901122 2713 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, link->stats.recv_pkts))
7be57fc6 2714 goto attr_msg_full;
95901122 2715 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, link->stats.sent_pkts))
7be57fc6
RA		 2716 goto attr_msg_full;
2717
2718 if (tipc_link_is_up(link))
2719 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
2720 goto attr_msg_full;
c72fa872 2721 if (link->active)
7be57fc6
RA		 2722 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_ACTIVE))
2723 goto attr_msg_full;
2724
ae0be8de 2725 prop = nla_nest_start_noflag(msg->skb, TIPC_NLA_LINK_PROP);
7be57fc6
RA		 2726 if (!prop)
2727 goto attr_msg_full;
2728 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
2729 goto prop_msg_full;
2730 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_TOL, link->tolerance))
2731 goto prop_msg_full;
2732 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN,
1f66d161 2733 link->window))
7be57fc6
RA		 2734 goto prop_msg_full;
2735 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
2736 goto prop_msg_full;
2737 nla_nest_end(msg->skb, prop);
2738
2739 err = __tipc_nl_add_stats(msg->skb, &link->stats);
2740 if (err)
2741 goto attr_msg_full;
2742
2743 nla_nest_end(msg->skb, attrs);
2744 genlmsg_end(msg->skb, hdr);
2745
2746 return 0;
2747
2748prop_msg_full:
2749 nla_nest_cancel(msg->skb, prop);
2750attr_msg_full:
2751 nla_nest_cancel(msg->skb, attrs);
2752msg_full:
2753 genlmsg_cancel(msg->skb, hdr);
2754
2755 return -EMSGSIZE;
2756}
38206d59
JPM		 2757
2758static int __tipc_nl_add_bc_link_stat(struct sk_buff *skb,
2759 struct tipc_stats *stats)
2760{
2761 int i;
2762 struct nlattr *nest;
2763
2764 struct nla_map {
2765 __u32 key;
2766 __u32 val;
2767 };
2768
2769 struct nla_map map[] = {
95901122 2770 {TIPC_NLA_STATS_RX_INFO, stats->recv_pkts},
38206d59
JPM		 2771 {TIPC_NLA_STATS_RX_FRAGMENTS, stats->recv_fragments},
2772 {TIPC_NLA_STATS_RX_FRAGMENTED, stats->recv_fragmented},
2773 {TIPC_NLA_STATS_RX_BUNDLES, stats->recv_bundles},
2774 {TIPC_NLA_STATS_RX_BUNDLED, stats->recv_bundled},
95901122 2775 {TIPC_NLA_STATS_TX_INFO, stats->sent_pkts},
38206d59
JPM		 2776 {TIPC_NLA_STATS_TX_FRAGMENTS, stats->sent_fragments},
2777 {TIPC_NLA_STATS_TX_FRAGMENTED, stats->sent_fragmented},
2778 {TIPC_NLA_STATS_TX_BUNDLES, stats->sent_bundles},
2779 {TIPC_NLA_STATS_TX_BUNDLED, stats->sent_bundled},
2780 {TIPC_NLA_STATS_RX_NACKS, stats->recv_nacks},
2781 {TIPC_NLA_STATS_RX_DEFERRED, stats->deferred_recv},
2782 {TIPC_NLA_STATS_TX_NACKS, stats->sent_nacks},
2783 {TIPC_NLA_STATS_TX_ACKS, stats->sent_acks},
2784 {TIPC_NLA_STATS_RETRANSMITTED, stats->retransmitted},
2785 {TIPC_NLA_STATS_DUPLICATES, stats->duplicates},
2786 {TIPC_NLA_STATS_LINK_CONGS, stats->link_congs},
2787 {TIPC_NLA_STATS_MAX_QUEUE, stats->max_queue_sz},
2788 {TIPC_NLA_STATS_AVG_QUEUE, stats->queue_sz_counts ?
2789 (stats->accu_queue_sz / stats->queue_sz_counts) : 0}
2790 };
2791
ae0be8de 2792 nest = nla_nest_start_noflag(skb, TIPC_NLA_LINK_STATS);
38206d59
JPM		 2793 if (!nest)
2794 return -EMSGSIZE;
2795
2796 for (i = 0; i < ARRAY_SIZE(map); i++)
2797 if (nla_put_u32(skb, map[i].key, map[i].val))
2798 goto msg_full;
2799
2800 nla_nest_end(skb, nest);
2801
2802 return 0;
2803msg_full:
2804 nla_nest_cancel(skb, nest);
2805
2806 return -EMSGSIZE;
2807}
2808
03b6fefd
TL		 2809int tipc_nl_add_bc_link(struct net *net, struct tipc_nl_msg *msg,
2810 struct tipc_link *bcl)
38206d59
JPM		 2811{
2812 int err;
2813 void *hdr;
2814 struct nlattr *attrs;
2815 struct nlattr *prop;
cad2929d 2816 u32 bc_mode = tipc_bcast_get_mode(net);
02ec6caf 2817 u32 bc_ratio = tipc_bcast_get_broadcast_ratio(net);
38206d59
JPM		 2818
2819 if (!bcl)
2820 return 0;
2821
2822 tipc_bcast_lock(net);
2823
2824 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2825 NLM_F_MULTI, TIPC_NL_LINK_GET);
b53ce3e7
IY		 2826 if (!hdr) {
2827 tipc_bcast_unlock(net);
38206d59 2828 return -EMSGSIZE;
b53ce3e7 2829 }
38206d59 2830
ae0be8de 2831 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_LINK);
38206d59
JPM		 2832 if (!attrs)
2833 goto msg_full;
2834
2835 /* The broadcast link is always up */
2836 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
2837 goto attr_msg_full;
2838
2839 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_BROADCAST))
2840 goto attr_msg_full;
2841 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, bcl->name))
2842 goto attr_msg_full;
95901122 2843 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, 0))
38206d59 2844 goto attr_msg_full;
95901122 2845 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, 0))
38206d59
JPM		 2846 goto attr_msg_full;
2847
ae0be8de 2848 prop = nla_nest_start_noflag(msg->skb, TIPC_NLA_LINK_PROP);
38206d59
JPM		 2849 if (!prop)
2850 goto attr_msg_full;
16ad3f40 2851 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, bcl->max_win))
38206d59 2852 goto prop_msg_full;
02ec6caf
HL		 2853 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_BROADCAST, bc_mode))
2854 goto prop_msg_full;
2855 if (bc_mode & BCLINK_MODE_SEL)
2856 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_BROADCAST_RATIO,
2857 bc_ratio))
2858 goto prop_msg_full;
38206d59
JPM		 2859 nla_nest_end(msg->skb, prop);
2860
2861 err = __tipc_nl_add_bc_link_stat(msg->skb, &bcl->stats);
2862 if (err)
2863 goto attr_msg_full;
2864
2865 tipc_bcast_unlock(net);
2866 nla_nest_end(msg->skb, attrs);
2867 genlmsg_end(msg->skb, hdr);
2868
2869 return 0;
2870
2871prop_msg_full:
2872 nla_nest_cancel(msg->skb, prop);
2873attr_msg_full:
2874 nla_nest_cancel(msg->skb, attrs);
2875msg_full:
2876 tipc_bcast_unlock(net);
2877 genlmsg_cancel(msg->skb, hdr);
2878
2879 return -EMSGSIZE;
2880}
2881
d01332f1
RA		 2882void tipc_link_set_tolerance(struct tipc_link *l, u32 tol,
2883 struct sk_buff_head *xmitq)
38206d59
JPM		 2884{
2885 l->tolerance = tol;
047491ea
JM		 2886 if (l->bc_rcvlink)
2887 l->bc_rcvlink->tolerance = tol;
37c64cf6
JM		 2888 if (link_is_up(l))
2889 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, tol, 0, xmitq);
38206d59
JPM		 2890}
2891
d01332f1
RA		 2892void tipc_link_set_prio(struct tipc_link *l, u32 prio,
2893 struct sk_buff_head *xmitq)
38206d59
JPM		 2894{
2895 l->priority = prio;
8d6e79d3 2896 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, prio, xmitq);
38206d59
JPM		 2897}
2898
2899void tipc_link_set_abort_limit(struct tipc_link *l, u32 limit)
2900{
2901 l->abort_limit = limit;
2902}
b4b9771b 2903
b4b9771b
TL		 2904/**
2905 * tipc_link_dump - dump TIPC link data
2906 * @l: tipc link to be dumped
2907 * @dqueues: bitmask to decide if any link queue to be dumped?
2908 * - TIPC_DUMP_NONE: don't dump link queues
2909 * - TIPC_DUMP_TRANSMQ: dump link transmq queue
2910 * - TIPC_DUMP_BACKLOGQ: dump link backlog queue
2911 * - TIPC_DUMP_DEFERDQ: dump link deferd queue
2912 * - TIPC_DUMP_INPUTQ: dump link input queue
2913 * - TIPC_DUMP_WAKEUP: dump link wakeup queue
2914 * - TIPC_DUMP_ALL: dump all the link queues above
2915 * @buf: returned buffer of dump data in format
2916 */
2917int tipc_link_dump(struct tipc_link *l, u16 dqueues, char *buf)
2918{
2919 int i = 0;
2920 size_t sz = (dqueues) ? LINK_LMAX : LINK_LMIN;
2921 struct sk_buff_head *list;
2922 struct sk_buff *hskb, *tskb;
2923 u32 len;
2924
2925 if (!l) {
2926 i += scnprintf(buf, sz, "link data: (null)\n");
2927 return i;
2928 }
2929
2930 i += scnprintf(buf, sz, "link data: %x", l->addr);
2931 i += scnprintf(buf + i, sz - i, " %x", l->state);
2932 i += scnprintf(buf + i, sz - i, " %u", l->in_session);
2933 i += scnprintf(buf + i, sz - i, " %u", l->session);
2934 i += scnprintf(buf + i, sz - i, " %u", l->peer_session);
2935 i += scnprintf(buf + i, sz - i, " %u", l->snd_nxt);
2936 i += scnprintf(buf + i, sz - i, " %u", l->rcv_nxt);
2937 i += scnprintf(buf + i, sz - i, " %u", l->snd_nxt_state);
2938 i += scnprintf(buf + i, sz - i, " %u", l->rcv_nxt_state);
2939 i += scnprintf(buf + i, sz - i, " %x", l->peer_caps);
2940 i += scnprintf(buf + i, sz - i, " %u", l->silent_intv_cnt);
2941 i += scnprintf(buf + i, sz - i, " %u", l->rst_cnt);
71204231 2942 i += scnprintf(buf + i, sz - i, " %u", 0);
77cf8edb 2943 i += scnprintf(buf + i, sz - i, " %u", 0);
b4b9771b
TL		 2944 i += scnprintf(buf + i, sz - i, " %u", l->acked);
2945
2946 list = &l->transmq;
2947 len = skb_queue_len(list);
2948 hskb = skb_peek(list);
2949 tskb = skb_peek_tail(list);
2950 i += scnprintf(buf + i, sz - i, " | %u %u %u", len,
2951 (hskb) ? msg_seqno(buf_msg(hskb)) : 0,
2952 (tskb) ? msg_seqno(buf_msg(tskb)) : 0);
2953
2954 list = &l->deferdq;
2955 len = skb_queue_len(list);
2956 hskb = skb_peek(list);
2957 tskb = skb_peek_tail(list);
2958 i += scnprintf(buf + i, sz - i, " | %u %u %u", len,
2959 (hskb) ? msg_seqno(buf_msg(hskb)) : 0,
2960 (tskb) ? msg_seqno(buf_msg(tskb)) : 0);
2961
2962 list = &l->backlogq;
2963 len = skb_queue_len(list);
2964 hskb = skb_peek(list);
2965 tskb = skb_peek_tail(list);
2966 i += scnprintf(buf + i, sz - i, " | %u %u %u", len,
2967 (hskb) ? msg_seqno(buf_msg(hskb)) : 0,
2968 (tskb) ? msg_seqno(buf_msg(tskb)) : 0);
2969
2970 list = l->inputq;
2971 len = skb_queue_len(list);
2972 hskb = skb_peek(list);
2973 tskb = skb_peek_tail(list);
2974 i += scnprintf(buf + i, sz - i, " | %u %u %u\n", len,
2975 (hskb) ? msg_seqno(buf_msg(hskb)) : 0,
2976 (tskb) ? msg_seqno(buf_msg(tskb)) : 0);
2977
2978 if (dqueues & TIPC_DUMP_TRANSMQ) {
2979 i += scnprintf(buf + i, sz - i, "transmq: ");
2980 i += tipc_list_dump(&l->transmq, false, buf + i);
2981 }
2982 if (dqueues & TIPC_DUMP_BACKLOGQ) {
2983 i += scnprintf(buf + i, sz - i,
2984 "backlogq: <%u %u %u %u %u>, ",
2985 l->backlog[TIPC_LOW_IMPORTANCE].len,
2986 l->backlog[TIPC_MEDIUM_IMPORTANCE].len,
2987 l->backlog[TIPC_HIGH_IMPORTANCE].len,
2988 l->backlog[TIPC_CRITICAL_IMPORTANCE].len,
2989 l->backlog[TIPC_SYSTEM_IMPORTANCE].len);
2990 i += tipc_list_dump(&l->backlogq, false, buf + i);
2991 }
2992 if (dqueues & TIPC_DUMP_DEFERDQ) {
2993 i += scnprintf(buf + i, sz - i, "deferdq: ");
2994 i += tipc_list_dump(&l->deferdq, false, buf + i);
2995 }
2996 if (dqueues & TIPC_DUMP_INPUTQ) {
2997 i += scnprintf(buf + i, sz - i, "inputq: ");
2998 i += tipc_list_dump(l->inputq, false, buf + i);
2999 }
3000 if (dqueues & TIPC_DUMP_WAKEUP) {
3001 i += scnprintf(buf + i, sz - i, "wakeup: ");
3002 i += tipc_list_dump(&l->wakeupq, false, buf + i);
3003 }
3004
3005 return i;
3006}
Linux 6.x block layer and io_uring tree(s)