]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blob - net/tipc/link.c
Merge branch 'ras-core-for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git...
[mirror_ubuntu-artful-kernel.git] / net / tipc / link.c
1 /*
2 * net/tipc/link.c: TIPC link code
3 *
4 * Copyright (c) 1996-2007, 2012-2016, Ericsson AB
5 * Copyright (c) 2004-2007, 2010-2013, Wind River Systems
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
10 *
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.
19 *
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
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37 #include "core.h"
38 #include "subscr.h"
39 #include "link.h"
40 #include "bcast.h"
41 #include "socket.h"
42 #include "name_distr.h"
43 #include "discover.h"
44 #include "netlink.h"
45
46 #include <linux/pkt_sched.h>
47
48 struct tipc_stats {
49 u32 sent_info; /* used in counting # sent packets */
50 u32 recv_info; /* used in counting # recv'd packets */
51 u32 sent_states;
52 u32 recv_states;
53 u32 sent_probes;
54 u32 recv_probes;
55 u32 sent_nacks;
56 u32 recv_nacks;
57 u32 sent_acks;
58 u32 sent_bundled;
59 u32 sent_bundles;
60 u32 recv_bundled;
61 u32 recv_bundles;
62 u32 retransmitted;
63 u32 sent_fragmented;
64 u32 sent_fragments;
65 u32 recv_fragmented;
66 u32 recv_fragments;
67 u32 link_congs; /* # port sends blocked by congestion */
68 u32 deferred_recv;
69 u32 duplicates;
70 u32 max_queue_sz; /* send queue size high water mark */
71 u32 accu_queue_sz; /* used for send queue size profiling */
72 u32 queue_sz_counts; /* used for send queue size profiling */
73 u32 msg_length_counts; /* used for message length profiling */
74 u32 msg_lengths_total; /* used for message length profiling */
75 u32 msg_length_profile[7]; /* used for msg. length profiling */
76 };
77
78 /**
79 * struct tipc_link - TIPC link data structure
80 * @addr: network address of link's peer node
81 * @name: link name character string
82 * @media_addr: media address to use when sending messages over link
83 * @timer: link timer
84 * @net: pointer to namespace struct
85 * @refcnt: reference counter for permanent references (owner node & timer)
86 * @peer_session: link session # being used by peer end of link
87 * @peer_bearer_id: bearer id used by link's peer endpoint
88 * @bearer_id: local bearer id used by link
89 * @tolerance: minimum link continuity loss needed to reset link [in ms]
90 * @keepalive_intv: link keepalive timer interval
91 * @abort_limit: # of unacknowledged continuity probes needed to reset link
92 * @state: current state of link FSM
93 * @peer_caps: bitmap describing capabilities of peer node
94 * @silent_intv_cnt: # of timer intervals without any reception from peer
95 * @proto_msg: template for control messages generated by link
96 * @pmsg: convenience pointer to "proto_msg" field
97 * @priority: current link priority
98 * @net_plane: current link network plane ('A' through 'H')
99 * @backlog_limit: backlog queue congestion thresholds (indexed by importance)
100 * @exp_msg_count: # of tunnelled messages expected during link changeover
101 * @reset_rcv_checkpt: seq # of last acknowledged message at time of link reset
102 * @mtu: current maximum packet size for this link
103 * @advertised_mtu: advertised own mtu when link is being established
104 * @transmitq: queue for sent, non-acked messages
105 * @backlogq: queue for messages waiting to be sent
106 * @snt_nxt: next sequence number to use for outbound messages
107 * @last_retransmitted: sequence number of most recently retransmitted message
108 * @stale_count: # of identical retransmit requests made by peer
109 * @ackers: # of peers that needs to ack each packet before it can be released
110 * @acked: # last packet acked by a certain peer. Used for broadcast.
111 * @rcv_nxt: next sequence number to expect for inbound messages
112 * @deferred_queue: deferred queue saved OOS b'cast message received from node
113 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer
114 * @inputq: buffer queue for messages to be delivered upwards
115 * @namedq: buffer queue for name table messages to be delivered upwards
116 * @next_out: ptr to first unsent outbound message in queue
117 * @wakeupq: linked list of wakeup msgs waiting for link congestion to abate
118 * @long_msg_seq_no: next identifier to use for outbound fragmented messages
119 * @reasm_buf: head of partially reassembled inbound message fragments
120 * @bc_rcvr: marks that this is a broadcast receiver link
121 * @stats: collects statistics regarding link activity
122 */
123 struct tipc_link {
124 u32 addr;
125 char name[TIPC_MAX_LINK_NAME];
126 struct net *net;
127
128 /* Management and link supervision data */
129 u32 peer_session;
130 u32 session;
131 u32 peer_bearer_id;
132 u32 bearer_id;
133 u32 tolerance;
134 unsigned long keepalive_intv;
135 u32 abort_limit;
136 u32 state;
137 u16 peer_caps;
138 bool active;
139 u32 silent_intv_cnt;
140 char if_name[TIPC_MAX_IF_NAME];
141 u32 priority;
142 char net_plane;
143 u16 rst_cnt;
144
145 /* Failover/synch */
146 u16 drop_point;
147 struct sk_buff *failover_reasm_skb;
148
149 /* Max packet negotiation */
150 u16 mtu;
151 u16 advertised_mtu;
152
153 /* Sending */
154 struct sk_buff_head transmq;
155 struct sk_buff_head backlogq;
156 struct {
157 u16 len;
158 u16 limit;
159 } backlog[5];
160 u16 snd_nxt;
161 u16 last_retransm;
162 u16 window;
163 u32 stale_count;
164
165 /* Reception */
166 u16 rcv_nxt;
167 u32 rcv_unacked;
168 struct sk_buff_head deferdq;
169 struct sk_buff_head *inputq;
170 struct sk_buff_head *namedq;
171
172 /* Congestion handling */
173 struct sk_buff_head wakeupq;
174
175 /* Fragmentation/reassembly */
176 struct sk_buff *reasm_buf;
177
178 /* Broadcast */
179 u16 ackers;
180 u16 acked;
181 struct tipc_link *bc_rcvlink;
182 struct tipc_link *bc_sndlink;
183 int nack_state;
184 bool bc_peer_is_up;
185
186 /* Statistics */
187 struct tipc_stats stats;
188 };
189
190 /*
191 * Error message prefixes
192 */
193 static const char *link_co_err = "Link tunneling error, ";
194 static const char *link_rst_msg = "Resetting link ";
195
196 /* Send states for broadcast NACKs
197 */
198 enum {
199 BC_NACK_SND_CONDITIONAL,
200 BC_NACK_SND_UNCONDITIONAL,
201 BC_NACK_SND_SUPPRESS,
202 };
203
204 /*
205 * Interval between NACKs when packets arrive out of order
206 */
207 #define TIPC_NACK_INTV (TIPC_MIN_LINK_WIN * 2)
208
209 /* Wildcard value for link session numbers. When it is known that
210 * peer endpoint is down, any session number must be accepted.
211 */
212 #define ANY_SESSION 0x10000
213
214 /* Link FSM states:
215 */
216 enum {
217 LINK_ESTABLISHED = 0xe,
218 LINK_ESTABLISHING = 0xe << 4,
219 LINK_RESET = 0x1 << 8,
220 LINK_RESETTING = 0x2 << 12,
221 LINK_PEER_RESET = 0xd << 16,
222 LINK_FAILINGOVER = 0xf << 20,
223 LINK_SYNCHING = 0xc << 24
224 };
225
226 /* Link FSM state checking routines
227 */
228 static int link_is_up(struct tipc_link *l)
229 {
230 return l->state & (LINK_ESTABLISHED | LINK_SYNCHING);
231 }
232
233 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb,
234 struct sk_buff_head *xmitq);
235 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe,
236 u16 rcvgap, int tolerance, int priority,
237 struct sk_buff_head *xmitq);
238 static void link_print(struct tipc_link *l, const char *str);
239 static void tipc_link_build_nack_msg(struct tipc_link *l,
240 struct sk_buff_head *xmitq);
241 static void tipc_link_build_bc_init_msg(struct tipc_link *l,
242 struct sk_buff_head *xmitq);
243 static bool tipc_link_release_pkts(struct tipc_link *l, u16 to);
244
245 /*
246 * Simple non-static link routines (i.e. referenced outside this file)
247 */
248 bool tipc_link_is_up(struct tipc_link *l)
249 {
250 return link_is_up(l);
251 }
252
253 bool tipc_link_peer_is_down(struct tipc_link *l)
254 {
255 return l->state == LINK_PEER_RESET;
256 }
257
258 bool tipc_link_is_reset(struct tipc_link *l)
259 {
260 return l->state & (LINK_RESET | LINK_FAILINGOVER | LINK_ESTABLISHING);
261 }
262
263 bool tipc_link_is_establishing(struct tipc_link *l)
264 {
265 return l->state == LINK_ESTABLISHING;
266 }
267
268 bool tipc_link_is_synching(struct tipc_link *l)
269 {
270 return l->state == LINK_SYNCHING;
271 }
272
273 bool tipc_link_is_failingover(struct tipc_link *l)
274 {
275 return l->state == LINK_FAILINGOVER;
276 }
277
278 bool tipc_link_is_blocked(struct tipc_link *l)
279 {
280 return l->state & (LINK_RESETTING | LINK_PEER_RESET | LINK_FAILINGOVER);
281 }
282
283 static bool link_is_bc_sndlink(struct tipc_link *l)
284 {
285 return !l->bc_sndlink;
286 }
287
288 static bool link_is_bc_rcvlink(struct tipc_link *l)
289 {
290 return ((l->bc_rcvlink == l) && !link_is_bc_sndlink(l));
291 }
292
293 int tipc_link_is_active(struct tipc_link *l)
294 {
295 return l->active;
296 }
297
298 void tipc_link_set_active(struct tipc_link *l, bool active)
299 {
300 l->active = active;
301 }
302
303 u32 tipc_link_id(struct tipc_link *l)
304 {
305 return l->peer_bearer_id << 16 | l->bearer_id;
306 }
307
308 int tipc_link_window(struct tipc_link *l)
309 {
310 return l->window;
311 }
312
313 int tipc_link_prio(struct tipc_link *l)
314 {
315 return l->priority;
316 }
317
318 unsigned long tipc_link_tolerance(struct tipc_link *l)
319 {
320 return l->tolerance;
321 }
322
323 struct sk_buff_head *tipc_link_inputq(struct tipc_link *l)
324 {
325 return l->inputq;
326 }
327
328 char tipc_link_plane(struct tipc_link *l)
329 {
330 return l->net_plane;
331 }
332
333 void tipc_link_add_bc_peer(struct tipc_link *snd_l,
334 struct tipc_link *uc_l,
335 struct sk_buff_head *xmitq)
336 {
337 struct tipc_link *rcv_l = uc_l->bc_rcvlink;
338
339 snd_l->ackers++;
340 rcv_l->acked = snd_l->snd_nxt - 1;
341 snd_l->state = LINK_ESTABLISHED;
342 tipc_link_build_bc_init_msg(uc_l, xmitq);
343 }
344
345 void tipc_link_remove_bc_peer(struct tipc_link *snd_l,
346 struct tipc_link *rcv_l,
347 struct sk_buff_head *xmitq)
348 {
349 u16 ack = snd_l->snd_nxt - 1;
350
351 snd_l->ackers--;
352 rcv_l->bc_peer_is_up = true;
353 rcv_l->state = LINK_ESTABLISHED;
354 tipc_link_bc_ack_rcv(rcv_l, ack, xmitq);
355 tipc_link_reset(rcv_l);
356 rcv_l->state = LINK_RESET;
357 if (!snd_l->ackers) {
358 tipc_link_reset(snd_l);
359 snd_l->state = LINK_RESET;
360 __skb_queue_purge(xmitq);
361 }
362 }
363
364 int tipc_link_bc_peers(struct tipc_link *l)
365 {
366 return l->ackers;
367 }
368
369 void tipc_link_set_mtu(struct tipc_link *l, int mtu)
370 {
371 l->mtu = mtu;
372 }
373
374 int tipc_link_mtu(struct tipc_link *l)
375 {
376 return l->mtu;
377 }
378
379 u16 tipc_link_rcv_nxt(struct tipc_link *l)
380 {
381 return l->rcv_nxt;
382 }
383
384 u16 tipc_link_acked(struct tipc_link *l)
385 {
386 return l->acked;
387 }
388
389 char *tipc_link_name(struct tipc_link *l)
390 {
391 return l->name;
392 }
393
394 /**
395 * tipc_link_create - create a new link
396 * @n: pointer to associated node
397 * @if_name: associated interface name
398 * @bearer_id: id (index) of associated bearer
399 * @tolerance: link tolerance to be used by link
400 * @net_plane: network plane (A,B,c..) this link belongs to
401 * @mtu: mtu to be advertised by link
402 * @priority: priority to be used by link
403 * @window: send window to be used by link
404 * @session: session to be used by link
405 * @ownnode: identity of own node
406 * @peer: node id of peer node
407 * @peer_caps: bitmap describing peer node capabilities
408 * @bc_sndlink: the namespace global link used for broadcast sending
409 * @bc_rcvlink: the peer specific link used for broadcast reception
410 * @inputq: queue to put messages ready for delivery
411 * @namedq: queue to put binding table update messages ready for delivery
412 * @link: return value, pointer to put the created link
413 *
414 * Returns true if link was created, otherwise false
415 */
416 bool tipc_link_create(struct net *net, char *if_name, int bearer_id,
417 int tolerance, char net_plane, u32 mtu, int priority,
418 int window, u32 session, u32 ownnode, u32 peer,
419 u16 peer_caps,
420 struct tipc_link *bc_sndlink,
421 struct tipc_link *bc_rcvlink,
422 struct sk_buff_head *inputq,
423 struct sk_buff_head *namedq,
424 struct tipc_link **link)
425 {
426 struct tipc_link *l;
427
428 l = kzalloc(sizeof(*l), GFP_ATOMIC);
429 if (!l)
430 return false;
431 *link = l;
432 l->session = session;
433
434 /* Note: peer i/f name is completed by reset/activate message */
435 sprintf(l->name, "%u.%u.%u:%s-%u.%u.%u:unknown",
436 tipc_zone(ownnode), tipc_cluster(ownnode), tipc_node(ownnode),
437 if_name, tipc_zone(peer), tipc_cluster(peer), tipc_node(peer));
438 strcpy(l->if_name, if_name);
439 l->addr = peer;
440 l->peer_caps = peer_caps;
441 l->net = net;
442 l->peer_session = ANY_SESSION;
443 l->bearer_id = bearer_id;
444 l->tolerance = tolerance;
445 l->net_plane = net_plane;
446 l->advertised_mtu = mtu;
447 l->mtu = mtu;
448 l->priority = priority;
449 tipc_link_set_queue_limits(l, window);
450 l->ackers = 1;
451 l->bc_sndlink = bc_sndlink;
452 l->bc_rcvlink = bc_rcvlink;
453 l->inputq = inputq;
454 l->namedq = namedq;
455 l->state = LINK_RESETTING;
456 __skb_queue_head_init(&l->transmq);
457 __skb_queue_head_init(&l->backlogq);
458 __skb_queue_head_init(&l->deferdq);
459 skb_queue_head_init(&l->wakeupq);
460 skb_queue_head_init(l->inputq);
461 return true;
462 }
463
464 /**
465 * tipc_link_bc_create - create new link to be used for broadcast
466 * @n: pointer to associated node
467 * @mtu: mtu to be used
468 * @window: send window to be used
469 * @inputq: queue to put messages ready for delivery
470 * @namedq: queue to put binding table update messages ready for delivery
471 * @link: return value, pointer to put the created link
472 *
473 * Returns true if link was created, otherwise false
474 */
475 bool tipc_link_bc_create(struct net *net, u32 ownnode, u32 peer,
476 int mtu, int window, u16 peer_caps,
477 struct sk_buff_head *inputq,
478 struct sk_buff_head *namedq,
479 struct tipc_link *bc_sndlink,
480 struct tipc_link **link)
481 {
482 struct tipc_link *l;
483
484 if (!tipc_link_create(net, "", MAX_BEARERS, 0, 'Z', mtu, 0, window,
485 0, ownnode, peer, peer_caps, bc_sndlink,
486 NULL, inputq, namedq, link))
487 return false;
488
489 l = *link;
490 strcpy(l->name, tipc_bclink_name);
491 tipc_link_reset(l);
492 l->state = LINK_RESET;
493 l->ackers = 0;
494 l->bc_rcvlink = l;
495
496 /* Broadcast send link is always up */
497 if (link_is_bc_sndlink(l))
498 l->state = LINK_ESTABLISHED;
499
500 return true;
501 }
502
503 /**
504 * tipc_link_fsm_evt - link finite state machine
505 * @l: pointer to link
506 * @evt: state machine event to be processed
507 */
508 int tipc_link_fsm_evt(struct tipc_link *l, int evt)
509 {
510 int rc = 0;
511
512 switch (l->state) {
513 case LINK_RESETTING:
514 switch (evt) {
515 case LINK_PEER_RESET_EVT:
516 l->state = LINK_PEER_RESET;
517 break;
518 case LINK_RESET_EVT:
519 l->state = LINK_RESET;
520 break;
521 case LINK_FAILURE_EVT:
522 case LINK_FAILOVER_BEGIN_EVT:
523 case LINK_ESTABLISH_EVT:
524 case LINK_FAILOVER_END_EVT:
525 case LINK_SYNCH_BEGIN_EVT:
526 case LINK_SYNCH_END_EVT:
527 default:
528 goto illegal_evt;
529 }
530 break;
531 case LINK_RESET:
532 switch (evt) {
533 case LINK_PEER_RESET_EVT:
534 l->state = LINK_ESTABLISHING;
535 break;
536 case LINK_FAILOVER_BEGIN_EVT:
537 l->state = LINK_FAILINGOVER;
538 case LINK_FAILURE_EVT:
539 case LINK_RESET_EVT:
540 case LINK_ESTABLISH_EVT:
541 case LINK_FAILOVER_END_EVT:
542 break;
543 case LINK_SYNCH_BEGIN_EVT:
544 case LINK_SYNCH_END_EVT:
545 default:
546 goto illegal_evt;
547 }
548 break;
549 case LINK_PEER_RESET:
550 switch (evt) {
551 case LINK_RESET_EVT:
552 l->state = LINK_ESTABLISHING;
553 break;
554 case LINK_PEER_RESET_EVT:
555 case LINK_ESTABLISH_EVT:
556 case LINK_FAILURE_EVT:
557 break;
558 case LINK_SYNCH_BEGIN_EVT:
559 case LINK_SYNCH_END_EVT:
560 case LINK_FAILOVER_BEGIN_EVT:
561 case LINK_FAILOVER_END_EVT:
562 default:
563 goto illegal_evt;
564 }
565 break;
566 case LINK_FAILINGOVER:
567 switch (evt) {
568 case LINK_FAILOVER_END_EVT:
569 l->state = LINK_RESET;
570 break;
571 case LINK_PEER_RESET_EVT:
572 case LINK_RESET_EVT:
573 case LINK_ESTABLISH_EVT:
574 case LINK_FAILURE_EVT:
575 break;
576 case LINK_FAILOVER_BEGIN_EVT:
577 case LINK_SYNCH_BEGIN_EVT:
578 case LINK_SYNCH_END_EVT:
579 default:
580 goto illegal_evt;
581 }
582 break;
583 case LINK_ESTABLISHING:
584 switch (evt) {
585 case LINK_ESTABLISH_EVT:
586 l->state = LINK_ESTABLISHED;
587 break;
588 case LINK_FAILOVER_BEGIN_EVT:
589 l->state = LINK_FAILINGOVER;
590 break;
591 case LINK_RESET_EVT:
592 l->state = LINK_RESET;
593 break;
594 case LINK_FAILURE_EVT:
595 case LINK_PEER_RESET_EVT:
596 case LINK_SYNCH_BEGIN_EVT:
597 case LINK_FAILOVER_END_EVT:
598 break;
599 case LINK_SYNCH_END_EVT:
600 default:
601 goto illegal_evt;
602 }
603 break;
604 case LINK_ESTABLISHED:
605 switch (evt) {
606 case LINK_PEER_RESET_EVT:
607 l->state = LINK_PEER_RESET;
608 rc |= TIPC_LINK_DOWN_EVT;
609 break;
610 case LINK_FAILURE_EVT:
611 l->state = LINK_RESETTING;
612 rc |= TIPC_LINK_DOWN_EVT;
613 break;
614 case LINK_RESET_EVT:
615 l->state = LINK_RESET;
616 break;
617 case LINK_ESTABLISH_EVT:
618 case LINK_SYNCH_END_EVT:
619 break;
620 case LINK_SYNCH_BEGIN_EVT:
621 l->state = LINK_SYNCHING;
622 break;
623 case LINK_FAILOVER_BEGIN_EVT:
624 case LINK_FAILOVER_END_EVT:
625 default:
626 goto illegal_evt;
627 }
628 break;
629 case LINK_SYNCHING:
630 switch (evt) {
631 case LINK_PEER_RESET_EVT:
632 l->state = LINK_PEER_RESET;
633 rc |= TIPC_LINK_DOWN_EVT;
634 break;
635 case LINK_FAILURE_EVT:
636 l->state = LINK_RESETTING;
637 rc |= TIPC_LINK_DOWN_EVT;
638 break;
639 case LINK_RESET_EVT:
640 l->state = LINK_RESET;
641 break;
642 case LINK_ESTABLISH_EVT:
643 case LINK_SYNCH_BEGIN_EVT:
644 break;
645 case LINK_SYNCH_END_EVT:
646 l->state = LINK_ESTABLISHED;
647 break;
648 case LINK_FAILOVER_BEGIN_EVT:
649 case LINK_FAILOVER_END_EVT:
650 default:
651 goto illegal_evt;
652 }
653 break;
654 default:
655 pr_err("Unknown FSM state %x in %s\n", l->state, l->name);
656 }
657 return rc;
658 illegal_evt:
659 pr_err("Illegal FSM event %x in state %x on link %s\n",
660 evt, l->state, l->name);
661 return rc;
662 }
663
664 /* link_profile_stats - update statistical profiling of traffic
665 */
666 static void link_profile_stats(struct tipc_link *l)
667 {
668 struct sk_buff *skb;
669 struct tipc_msg *msg;
670 int length;
671
672 /* Update counters used in statistical profiling of send traffic */
673 l->stats.accu_queue_sz += skb_queue_len(&l->transmq);
674 l->stats.queue_sz_counts++;
675
676 skb = skb_peek(&l->transmq);
677 if (!skb)
678 return;
679 msg = buf_msg(skb);
680 length = msg_size(msg);
681
682 if (msg_user(msg) == MSG_FRAGMENTER) {
683 if (msg_type(msg) != FIRST_FRAGMENT)
684 return;
685 length = msg_size(msg_get_wrapped(msg));
686 }
687 l->stats.msg_lengths_total += length;
688 l->stats.msg_length_counts++;
689 if (length <= 64)
690 l->stats.msg_length_profile[0]++;
691 else if (length <= 256)
692 l->stats.msg_length_profile[1]++;
693 else if (length <= 1024)
694 l->stats.msg_length_profile[2]++;
695 else if (length <= 4096)
696 l->stats.msg_length_profile[3]++;
697 else if (length <= 16384)
698 l->stats.msg_length_profile[4]++;
699 else if (length <= 32768)
700 l->stats.msg_length_profile[5]++;
701 else
702 l->stats.msg_length_profile[6]++;
703 }
704
705 /* tipc_link_timeout - perform periodic task as instructed from node timeout
706 */
707 int tipc_link_timeout(struct tipc_link *l, struct sk_buff_head *xmitq)
708 {
709 int mtyp = 0;
710 int rc = 0;
711 bool state = false;
712 bool probe = false;
713 bool setup = false;
714 u16 bc_snt = l->bc_sndlink->snd_nxt - 1;
715 u16 bc_acked = l->bc_rcvlink->acked;
716
717 link_profile_stats(l);
718
719 switch (l->state) {
720 case LINK_ESTABLISHED:
721 case LINK_SYNCHING:
722 if (l->silent_intv_cnt > l->abort_limit)
723 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
724 mtyp = STATE_MSG;
725 state = bc_acked != bc_snt;
726 probe = l->silent_intv_cnt;
727 l->silent_intv_cnt++;
728 break;
729 case LINK_RESET:
730 setup = l->rst_cnt++ <= 4;
731 setup |= !(l->rst_cnt % 16);
732 mtyp = RESET_MSG;
733 break;
734 case LINK_ESTABLISHING:
735 setup = true;
736 mtyp = ACTIVATE_MSG;
737 break;
738 case LINK_PEER_RESET:
739 case LINK_RESETTING:
740 case LINK_FAILINGOVER:
741 break;
742 default:
743 break;
744 }
745
746 if (state || probe || setup)
747 tipc_link_build_proto_msg(l, mtyp, probe, 0, 0, 0, xmitq);
748
749 return rc;
750 }
751
752 /**
753 * link_schedule_user - schedule a message sender for wakeup after congestion
754 * @link: congested link
755 * @list: message that was attempted sent
756 * Create pseudo msg to send back to user when congestion abates
757 * Does not consume buffer list
758 */
759 static int link_schedule_user(struct tipc_link *link, struct sk_buff_head *list)
760 {
761 struct tipc_msg *msg = buf_msg(skb_peek(list));
762 int imp = msg_importance(msg);
763 u32 oport = msg_origport(msg);
764 u32 addr = tipc_own_addr(link->net);
765 struct sk_buff *skb;
766
767 /* This really cannot happen... */
768 if (unlikely(imp > TIPC_CRITICAL_IMPORTANCE)) {
769 pr_warn("%s<%s>, send queue full", link_rst_msg, link->name);
770 return -ENOBUFS;
771 }
772 /* Non-blocking sender: */
773 if (TIPC_SKB_CB(skb_peek(list))->wakeup_pending)
774 return -ELINKCONG;
775
776 /* Create and schedule wakeup pseudo message */
777 skb = tipc_msg_create(SOCK_WAKEUP, 0, INT_H_SIZE, 0,
778 addr, addr, oport, 0, 0);
779 if (!skb)
780 return -ENOBUFS;
781 TIPC_SKB_CB(skb)->chain_sz = skb_queue_len(list);
782 TIPC_SKB_CB(skb)->chain_imp = imp;
783 skb_queue_tail(&link->wakeupq, skb);
784 link->stats.link_congs++;
785 return -ELINKCONG;
786 }
787
788 /**
789 * link_prepare_wakeup - prepare users for wakeup after congestion
790 * @link: congested link
791 * Move a number of waiting users, as permitted by available space in
792 * the send queue, from link wait queue to node wait queue for wakeup
793 */
794 void link_prepare_wakeup(struct tipc_link *l)
795 {
796 int pnd[TIPC_SYSTEM_IMPORTANCE + 1] = {0,};
797 int imp, lim;
798 struct sk_buff *skb, *tmp;
799
800 skb_queue_walk_safe(&l->wakeupq, skb, tmp) {
801 imp = TIPC_SKB_CB(skb)->chain_imp;
802 lim = l->window + l->backlog[imp].limit;
803 pnd[imp] += TIPC_SKB_CB(skb)->chain_sz;
804 if ((pnd[imp] + l->backlog[imp].len) >= lim)
805 break;
806 skb_unlink(skb, &l->wakeupq);
807 skb_queue_tail(l->inputq, skb);
808 }
809 }
810
811 void tipc_link_reset(struct tipc_link *l)
812 {
813 l->peer_session = ANY_SESSION;
814 l->session++;
815 l->mtu = l->advertised_mtu;
816 __skb_queue_purge(&l->transmq);
817 __skb_queue_purge(&l->deferdq);
818 skb_queue_splice_init(&l->wakeupq, l->inputq);
819 __skb_queue_purge(&l->backlogq);
820 l->backlog[TIPC_LOW_IMPORTANCE].len = 0;
821 l->backlog[TIPC_MEDIUM_IMPORTANCE].len = 0;
822 l->backlog[TIPC_HIGH_IMPORTANCE].len = 0;
823 l->backlog[TIPC_CRITICAL_IMPORTANCE].len = 0;
824 l->backlog[TIPC_SYSTEM_IMPORTANCE].len = 0;
825 kfree_skb(l->reasm_buf);
826 kfree_skb(l->failover_reasm_skb);
827 l->reasm_buf = NULL;
828 l->failover_reasm_skb = NULL;
829 l->rcv_unacked = 0;
830 l->snd_nxt = 1;
831 l->rcv_nxt = 1;
832 l->acked = 0;
833 l->silent_intv_cnt = 0;
834 l->rst_cnt = 0;
835 l->stats.recv_info = 0;
836 l->stale_count = 0;
837 l->bc_peer_is_up = false;
838 tipc_link_reset_stats(l);
839 }
840
841 /**
842 * tipc_link_xmit(): enqueue buffer list according to queue situation
843 * @link: link to use
844 * @list: chain of buffers containing message
845 * @xmitq: returned list of packets to be sent by caller
846 *
847 * Consumes the buffer chain, except when returning -ELINKCONG,
848 * since the caller then may want to make more send attempts.
849 * Returns 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS
850 * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted
851 */
852 int tipc_link_xmit(struct tipc_link *l, struct sk_buff_head *list,
853 struct sk_buff_head *xmitq)
854 {
855 struct tipc_msg *hdr = buf_msg(skb_peek(list));
856 unsigned int maxwin = l->window;
857 unsigned int i, imp = msg_importance(hdr);
858 unsigned int mtu = l->mtu;
859 u16 ack = l->rcv_nxt - 1;
860 u16 seqno = l->snd_nxt;
861 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
862 struct sk_buff_head *transmq = &l->transmq;
863 struct sk_buff_head *backlogq = &l->backlogq;
864 struct sk_buff *skb, *_skb, *bskb;
865
866 /* Match msg importance against this and all higher backlog limits: */
867 for (i = imp; i <= TIPC_SYSTEM_IMPORTANCE; i++) {
868 if (unlikely(l->backlog[i].len >= l->backlog[i].limit))
869 return link_schedule_user(l, list);
870 }
871 if (unlikely(msg_size(hdr) > mtu)) {
872 skb_queue_purge(list);
873 return -EMSGSIZE;
874 }
875
876 /* Prepare each packet for sending, and add to relevant queue: */
877 while (skb_queue_len(list)) {
878 skb = skb_peek(list);
879 hdr = buf_msg(skb);
880 msg_set_seqno(hdr, seqno);
881 msg_set_ack(hdr, ack);
882 msg_set_bcast_ack(hdr, bc_ack);
883
884 if (likely(skb_queue_len(transmq) < maxwin)) {
885 _skb = skb_clone(skb, GFP_ATOMIC);
886 if (!_skb) {
887 skb_queue_purge(list);
888 return -ENOBUFS;
889 }
890 __skb_dequeue(list);
891 __skb_queue_tail(transmq, skb);
892 __skb_queue_tail(xmitq, _skb);
893 TIPC_SKB_CB(skb)->ackers = l->ackers;
894 l->rcv_unacked = 0;
895 seqno++;
896 continue;
897 }
898 if (tipc_msg_bundle(skb_peek_tail(backlogq), hdr, mtu)) {
899 kfree_skb(__skb_dequeue(list));
900 l->stats.sent_bundled++;
901 continue;
902 }
903 if (tipc_msg_make_bundle(&bskb, hdr, mtu, l->addr)) {
904 kfree_skb(__skb_dequeue(list));
905 __skb_queue_tail(backlogq, bskb);
906 l->backlog[msg_importance(buf_msg(bskb))].len++;
907 l->stats.sent_bundled++;
908 l->stats.sent_bundles++;
909 continue;
910 }
911 l->backlog[imp].len += skb_queue_len(list);
912 skb_queue_splice_tail_init(list, backlogq);
913 }
914 l->snd_nxt = seqno;
915 return 0;
916 }
917
918 void tipc_link_advance_backlog(struct tipc_link *l, struct sk_buff_head *xmitq)
919 {
920 struct sk_buff *skb, *_skb;
921 struct tipc_msg *hdr;
922 u16 seqno = l->snd_nxt;
923 u16 ack = l->rcv_nxt - 1;
924 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
925
926 while (skb_queue_len(&l->transmq) < l->window) {
927 skb = skb_peek(&l->backlogq);
928 if (!skb)
929 break;
930 _skb = skb_clone(skb, GFP_ATOMIC);
931 if (!_skb)
932 break;
933 __skb_dequeue(&l->backlogq);
934 hdr = buf_msg(skb);
935 l->backlog[msg_importance(hdr)].len--;
936 __skb_queue_tail(&l->transmq, skb);
937 __skb_queue_tail(xmitq, _skb);
938 TIPC_SKB_CB(skb)->ackers = l->ackers;
939 msg_set_seqno(hdr, seqno);
940 msg_set_ack(hdr, ack);
941 msg_set_bcast_ack(hdr, bc_ack);
942 l->rcv_unacked = 0;
943 seqno++;
944 }
945 l->snd_nxt = seqno;
946 }
947
948 static void link_retransmit_failure(struct tipc_link *l, struct sk_buff *skb)
949 {
950 struct tipc_msg *hdr = buf_msg(skb);
951
952 pr_warn("Retransmission failure on link <%s>\n", l->name);
953 link_print(l, "Resetting link ");
954 pr_info("Failed msg: usr %u, typ %u, len %u, err %u\n",
955 msg_user(hdr), msg_type(hdr), msg_size(hdr), msg_errcode(hdr));
956 pr_info("sqno %u, prev: %x, src: %x\n",
957 msg_seqno(hdr), msg_prevnode(hdr), msg_orignode(hdr));
958 }
959
960 int tipc_link_retrans(struct tipc_link *l, u16 from, u16 to,
961 struct sk_buff_head *xmitq)
962 {
963 struct sk_buff *_skb, *skb = skb_peek(&l->transmq);
964 struct tipc_msg *hdr;
965 u16 ack = l->rcv_nxt - 1;
966 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1;
967
968 if (!skb)
969 return 0;
970
971 /* Detect repeated retransmit failures on same packet */
972 if (likely(l->last_retransm != buf_seqno(skb))) {
973 l->last_retransm = buf_seqno(skb);
974 l->stale_count = 1;
975 } else if (++l->stale_count > 100) {
976 link_retransmit_failure(l, skb);
977 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
978 }
979
980 /* Move forward to where retransmission should start */
981 skb_queue_walk(&l->transmq, skb) {
982 if (!less(buf_seqno(skb), from))
983 break;
984 }
985
986 skb_queue_walk_from(&l->transmq, skb) {
987 if (more(buf_seqno(skb), to))
988 break;
989 hdr = buf_msg(skb);
990 _skb = __pskb_copy(skb, MIN_H_SIZE, GFP_ATOMIC);
991 if (!_skb)
992 return 0;
993 hdr = buf_msg(_skb);
994 msg_set_ack(hdr, ack);
995 msg_set_bcast_ack(hdr, bc_ack);
996 _skb->priority = TC_PRIO_CONTROL;
997 __skb_queue_tail(xmitq, _skb);
998 l->stats.retransmitted++;
999 }
1000 return 0;
1001 }
1002
1003 /* tipc_data_input - deliver data and name distr msgs to upper layer
1004 *
1005 * Consumes buffer if message is of right type
1006 * Node lock must be held
1007 */
1008 static bool tipc_data_input(struct tipc_link *l, struct sk_buff *skb,
1009 struct sk_buff_head *inputq)
1010 {
1011 switch (msg_user(buf_msg(skb))) {
1012 case TIPC_LOW_IMPORTANCE:
1013 case TIPC_MEDIUM_IMPORTANCE:
1014 case TIPC_HIGH_IMPORTANCE:
1015 case TIPC_CRITICAL_IMPORTANCE:
1016 case CONN_MANAGER:
1017 skb_queue_tail(inputq, skb);
1018 return true;
1019 case NAME_DISTRIBUTOR:
1020 l->bc_rcvlink->state = LINK_ESTABLISHED;
1021 skb_queue_tail(l->namedq, skb);
1022 return true;
1023 case MSG_BUNDLER:
1024 case TUNNEL_PROTOCOL:
1025 case MSG_FRAGMENTER:
1026 case BCAST_PROTOCOL:
1027 return false;
1028 default:
1029 pr_warn("Dropping received illegal msg type\n");
1030 kfree_skb(skb);
1031 return false;
1032 };
1033 }
1034
1035 /* tipc_link_input - process packet that has passed link protocol check
1036 *
1037 * Consumes buffer
1038 */
1039 static int tipc_link_input(struct tipc_link *l, struct sk_buff *skb,
1040 struct sk_buff_head *inputq)
1041 {
1042 struct tipc_msg *hdr = buf_msg(skb);
1043 struct sk_buff **reasm_skb = &l->reasm_buf;
1044 struct sk_buff *iskb;
1045 struct sk_buff_head tmpq;
1046 int usr = msg_user(hdr);
1047 int rc = 0;
1048 int pos = 0;
1049 int ipos = 0;
1050
1051 if (unlikely(usr == TUNNEL_PROTOCOL)) {
1052 if (msg_type(hdr) == SYNCH_MSG) {
1053 __skb_queue_purge(&l->deferdq);
1054 goto drop;
1055 }
1056 if (!tipc_msg_extract(skb, &iskb, &ipos))
1057 return rc;
1058 kfree_skb(skb);
1059 skb = iskb;
1060 hdr = buf_msg(skb);
1061 if (less(msg_seqno(hdr), l->drop_point))
1062 goto drop;
1063 if (tipc_data_input(l, skb, inputq))
1064 return rc;
1065 usr = msg_user(hdr);
1066 reasm_skb = &l->failover_reasm_skb;
1067 }
1068
1069 if (usr == MSG_BUNDLER) {
1070 skb_queue_head_init(&tmpq);
1071 l->stats.recv_bundles++;
1072 l->stats.recv_bundled += msg_msgcnt(hdr);
1073 while (tipc_msg_extract(skb, &iskb, &pos))
1074 tipc_data_input(l, iskb, &tmpq);
1075 tipc_skb_queue_splice_tail(&tmpq, inputq);
1076 return 0;
1077 } else if (usr == MSG_FRAGMENTER) {
1078 l->stats.recv_fragments++;
1079 if (tipc_buf_append(reasm_skb, &skb)) {
1080 l->stats.recv_fragmented++;
1081 tipc_data_input(l, skb, inputq);
1082 } else if (!*reasm_skb && !link_is_bc_rcvlink(l)) {
1083 pr_warn_ratelimited("Unable to build fragment list\n");
1084 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1085 }
1086 return 0;
1087 } else if (usr == BCAST_PROTOCOL) {
1088 tipc_bcast_lock(l->net);
1089 tipc_link_bc_init_rcv(l->bc_rcvlink, hdr);
1090 tipc_bcast_unlock(l->net);
1091 }
1092 drop:
1093 kfree_skb(skb);
1094 return 0;
1095 }
1096
1097 static bool tipc_link_release_pkts(struct tipc_link *l, u16 acked)
1098 {
1099 bool released = false;
1100 struct sk_buff *skb, *tmp;
1101
1102 skb_queue_walk_safe(&l->transmq, skb, tmp) {
1103 if (more(buf_seqno(skb), acked))
1104 break;
1105 __skb_unlink(skb, &l->transmq);
1106 kfree_skb(skb);
1107 released = true;
1108 }
1109 return released;
1110 }
1111
1112 /* tipc_link_build_state_msg: prepare link state message for transmission
1113 *
1114 * Note that sending of broadcast ack is coordinated among nodes, to reduce
1115 * risk of ack storms towards the sender
1116 */
1117 int tipc_link_build_state_msg(struct tipc_link *l, struct sk_buff_head *xmitq)
1118 {
1119 if (!l)
1120 return 0;
1121
1122 /* Broadcast ACK must be sent via a unicast link => defer to caller */
1123 if (link_is_bc_rcvlink(l)) {
1124 if (((l->rcv_nxt ^ tipc_own_addr(l->net)) & 0xf) != 0xf)
1125 return 0;
1126 l->rcv_unacked = 0;
1127 return TIPC_LINK_SND_BC_ACK;
1128 }
1129
1130 /* Unicast ACK */
1131 l->rcv_unacked = 0;
1132 l->stats.sent_acks++;
1133 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, xmitq);
1134 return 0;
1135 }
1136
1137 /* tipc_link_build_reset_msg: prepare link RESET or ACTIVATE message
1138 */
1139 void tipc_link_build_reset_msg(struct tipc_link *l, struct sk_buff_head *xmitq)
1140 {
1141 int mtyp = RESET_MSG;
1142 struct sk_buff *skb;
1143
1144 if (l->state == LINK_ESTABLISHING)
1145 mtyp = ACTIVATE_MSG;
1146
1147 tipc_link_build_proto_msg(l, mtyp, 0, 0, 0, 0, xmitq);
1148
1149 /* Inform peer that this endpoint is going down if applicable */
1150 skb = skb_peek_tail(xmitq);
1151 if (skb && (l->state == LINK_RESET))
1152 msg_set_peer_stopping(buf_msg(skb), 1);
1153 }
1154
1155 /* tipc_link_build_nack_msg: prepare link nack message for transmission
1156 */
1157 static void tipc_link_build_nack_msg(struct tipc_link *l,
1158 struct sk_buff_head *xmitq)
1159 {
1160 u32 def_cnt = ++l->stats.deferred_recv;
1161
1162 if (link_is_bc_rcvlink(l))
1163 return;
1164
1165 if ((skb_queue_len(&l->deferdq) == 1) || !(def_cnt % TIPC_NACK_INTV))
1166 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, xmitq);
1167 }
1168
1169 /* tipc_link_rcv - process TIPC packets/messages arriving from off-node
1170 * @l: the link that should handle the message
1171 * @skb: TIPC packet
1172 * @xmitq: queue to place packets to be sent after this call
1173 */
1174 int tipc_link_rcv(struct tipc_link *l, struct sk_buff *skb,
1175 struct sk_buff_head *xmitq)
1176 {
1177 struct sk_buff_head *defq = &l->deferdq;
1178 struct tipc_msg *hdr;
1179 u16 seqno, rcv_nxt, win_lim;
1180 int rc = 0;
1181
1182 do {
1183 hdr = buf_msg(skb);
1184 seqno = msg_seqno(hdr);
1185 rcv_nxt = l->rcv_nxt;
1186 win_lim = rcv_nxt + TIPC_MAX_LINK_WIN;
1187
1188 /* Verify and update link state */
1189 if (unlikely(msg_user(hdr) == LINK_PROTOCOL))
1190 return tipc_link_proto_rcv(l, skb, xmitq);
1191
1192 if (unlikely(!link_is_up(l))) {
1193 if (l->state == LINK_ESTABLISHING)
1194 rc = TIPC_LINK_UP_EVT;
1195 goto drop;
1196 }
1197
1198 /* Don't send probe at next timeout expiration */
1199 l->silent_intv_cnt = 0;
1200
1201 /* Drop if outside receive window */
1202 if (unlikely(less(seqno, rcv_nxt) || more(seqno, win_lim))) {
1203 l->stats.duplicates++;
1204 goto drop;
1205 }
1206
1207 /* Forward queues and wake up waiting users */
1208 if (likely(tipc_link_release_pkts(l, msg_ack(hdr)))) {
1209 tipc_link_advance_backlog(l, xmitq);
1210 if (unlikely(!skb_queue_empty(&l->wakeupq)))
1211 link_prepare_wakeup(l);
1212 }
1213
1214 /* Defer delivery if sequence gap */
1215 if (unlikely(seqno != rcv_nxt)) {
1216 __tipc_skb_queue_sorted(defq, seqno, skb);
1217 tipc_link_build_nack_msg(l, xmitq);
1218 break;
1219 }
1220
1221 /* Deliver packet */
1222 l->rcv_nxt++;
1223 l->stats.recv_info++;
1224 if (!tipc_data_input(l, skb, l->inputq))
1225 rc |= tipc_link_input(l, skb, l->inputq);
1226 if (unlikely(++l->rcv_unacked >= TIPC_MIN_LINK_WIN))
1227 rc |= tipc_link_build_state_msg(l, xmitq);
1228 if (unlikely(rc & ~TIPC_LINK_SND_BC_ACK))
1229 break;
1230 } while ((skb = __skb_dequeue(defq)));
1231
1232 return rc;
1233 drop:
1234 kfree_skb(skb);
1235 return rc;
1236 }
1237
1238 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe,
1239 u16 rcvgap, int tolerance, int priority,
1240 struct sk_buff_head *xmitq)
1241 {
1242 struct sk_buff *skb;
1243 struct tipc_msg *hdr;
1244 struct sk_buff_head *dfq = &l->deferdq;
1245 bool node_up = link_is_up(l->bc_rcvlink);
1246
1247 /* Don't send protocol message during reset or link failover */
1248 if (tipc_link_is_blocked(l))
1249 return;
1250
1251 if (!tipc_link_is_up(l) && (mtyp == STATE_MSG))
1252 return;
1253
1254 if (!skb_queue_empty(dfq))
1255 rcvgap = buf_seqno(skb_peek(dfq)) - l->rcv_nxt;
1256
1257 skb = tipc_msg_create(LINK_PROTOCOL, mtyp, INT_H_SIZE,
1258 TIPC_MAX_IF_NAME, l->addr,
1259 tipc_own_addr(l->net), 0, 0, 0);
1260 if (!skb)
1261 return;
1262
1263 hdr = buf_msg(skb);
1264 msg_set_session(hdr, l->session);
1265 msg_set_bearer_id(hdr, l->bearer_id);
1266 msg_set_net_plane(hdr, l->net_plane);
1267 msg_set_next_sent(hdr, l->snd_nxt);
1268 msg_set_ack(hdr, l->rcv_nxt - 1);
1269 msg_set_bcast_ack(hdr, l->bc_rcvlink->rcv_nxt - 1);
1270 msg_set_last_bcast(hdr, l->bc_sndlink->snd_nxt - 1);
1271 msg_set_link_tolerance(hdr, tolerance);
1272 msg_set_linkprio(hdr, priority);
1273 msg_set_redundant_link(hdr, node_up);
1274 msg_set_seq_gap(hdr, 0);
1275 msg_set_seqno(hdr, l->snd_nxt + U16_MAX / 2);
1276
1277 if (mtyp == STATE_MSG) {
1278 msg_set_seq_gap(hdr, rcvgap);
1279 msg_set_size(hdr, INT_H_SIZE);
1280 msg_set_probe(hdr, probe);
1281 l->stats.sent_states++;
1282 l->rcv_unacked = 0;
1283 } else {
1284 /* RESET_MSG or ACTIVATE_MSG */
1285 msg_set_max_pkt(hdr, l->advertised_mtu);
1286 strcpy(msg_data(hdr), l->if_name);
1287 }
1288 if (probe)
1289 l->stats.sent_probes++;
1290 if (rcvgap)
1291 l->stats.sent_nacks++;
1292 skb->priority = TC_PRIO_CONTROL;
1293 __skb_queue_tail(xmitq, skb);
1294 }
1295
1296 /* tipc_link_tnl_prepare(): prepare and return a list of tunnel packets
1297 * with contents of the link's transmit and backlog queues.
1298 */
1299 void tipc_link_tnl_prepare(struct tipc_link *l, struct tipc_link *tnl,
1300 int mtyp, struct sk_buff_head *xmitq)
1301 {
1302 struct sk_buff *skb, *tnlskb;
1303 struct tipc_msg *hdr, tnlhdr;
1304 struct sk_buff_head *queue = &l->transmq;
1305 struct sk_buff_head tmpxq, tnlq;
1306 u16 pktlen, pktcnt, seqno = l->snd_nxt;
1307
1308 if (!tnl)
1309 return;
1310
1311 skb_queue_head_init(&tnlq);
1312 skb_queue_head_init(&tmpxq);
1313
1314 /* At least one packet required for safe algorithm => add dummy */
1315 skb = tipc_msg_create(TIPC_LOW_IMPORTANCE, TIPC_DIRECT_MSG,
1316 BASIC_H_SIZE, 0, l->addr, tipc_own_addr(l->net),
1317 0, 0, TIPC_ERR_NO_PORT);
1318 if (!skb) {
1319 pr_warn("%sunable to create tunnel packet\n", link_co_err);
1320 return;
1321 }
1322 skb_queue_tail(&tnlq, skb);
1323 tipc_link_xmit(l, &tnlq, &tmpxq);
1324 __skb_queue_purge(&tmpxq);
1325
1326 /* Initialize reusable tunnel packet header */
1327 tipc_msg_init(tipc_own_addr(l->net), &tnlhdr, TUNNEL_PROTOCOL,
1328 mtyp, INT_H_SIZE, l->addr);
1329 pktcnt = skb_queue_len(&l->transmq) + skb_queue_len(&l->backlogq);
1330 msg_set_msgcnt(&tnlhdr, pktcnt);
1331 msg_set_bearer_id(&tnlhdr, l->peer_bearer_id);
1332 tnl:
1333 /* Wrap each packet into a tunnel packet */
1334 skb_queue_walk(queue, skb) {
1335 hdr = buf_msg(skb);
1336 if (queue == &l->backlogq)
1337 msg_set_seqno(hdr, seqno++);
1338 pktlen = msg_size(hdr);
1339 msg_set_size(&tnlhdr, pktlen + INT_H_SIZE);
1340 tnlskb = tipc_buf_acquire(pktlen + INT_H_SIZE);
1341 if (!tnlskb) {
1342 pr_warn("%sunable to send packet\n", link_co_err);
1343 return;
1344 }
1345 skb_copy_to_linear_data(tnlskb, &tnlhdr, INT_H_SIZE);
1346 skb_copy_to_linear_data_offset(tnlskb, INT_H_SIZE, hdr, pktlen);
1347 __skb_queue_tail(&tnlq, tnlskb);
1348 }
1349 if (queue != &l->backlogq) {
1350 queue = &l->backlogq;
1351 goto tnl;
1352 }
1353
1354 tipc_link_xmit(tnl, &tnlq, xmitq);
1355
1356 if (mtyp == FAILOVER_MSG) {
1357 tnl->drop_point = l->rcv_nxt;
1358 tnl->failover_reasm_skb = l->reasm_buf;
1359 l->reasm_buf = NULL;
1360 }
1361 }
1362
1363 /* tipc_link_proto_rcv(): receive link level protocol message :
1364 * Note that network plane id propagates through the network, and may
1365 * change at any time. The node with lowest numerical id determines
1366 * network plane
1367 */
1368 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb,
1369 struct sk_buff_head *xmitq)
1370 {
1371 struct tipc_msg *hdr = buf_msg(skb);
1372 u16 rcvgap = 0;
1373 u16 ack = msg_ack(hdr);
1374 u16 gap = msg_seq_gap(hdr);
1375 u16 peers_snd_nxt = msg_next_sent(hdr);
1376 u16 peers_tol = msg_link_tolerance(hdr);
1377 u16 peers_prio = msg_linkprio(hdr);
1378 u16 rcv_nxt = l->rcv_nxt;
1379 int mtyp = msg_type(hdr);
1380 char *if_name;
1381 int rc = 0;
1382
1383 if (tipc_link_is_blocked(l) || !xmitq)
1384 goto exit;
1385
1386 if (tipc_own_addr(l->net) > msg_prevnode(hdr))
1387 l->net_plane = msg_net_plane(hdr);
1388
1389 switch (mtyp) {
1390 case RESET_MSG:
1391
1392 /* Ignore duplicate RESET with old session number */
1393 if ((less_eq(msg_session(hdr), l->peer_session)) &&
1394 (l->peer_session != ANY_SESSION))
1395 break;
1396 /* fall thru' */
1397
1398 case ACTIVATE_MSG:
1399 skb_linearize(skb);
1400 hdr = buf_msg(skb);
1401
1402 /* Complete own link name with peer's interface name */
1403 if_name = strrchr(l->name, ':') + 1;
1404 if (sizeof(l->name) - (if_name - l->name) <= TIPC_MAX_IF_NAME)
1405 break;
1406 if (msg_data_sz(hdr) < TIPC_MAX_IF_NAME)
1407 break;
1408 strncpy(if_name, msg_data(hdr), TIPC_MAX_IF_NAME);
1409
1410 /* Update own tolerance if peer indicates a non-zero value */
1411 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL))
1412 l->tolerance = peers_tol;
1413
1414 /* Update own priority if peer's priority is higher */
1415 if (in_range(peers_prio, l->priority + 1, TIPC_MAX_LINK_PRI))
1416 l->priority = peers_prio;
1417
1418 /* ACTIVATE_MSG serves as PEER_RESET if link is already down */
1419 if (msg_peer_stopping(hdr))
1420 rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1421 else if ((mtyp == RESET_MSG) || !link_is_up(l))
1422 rc = tipc_link_fsm_evt(l, LINK_PEER_RESET_EVT);
1423
1424 /* ACTIVATE_MSG takes up link if it was already locally reset */
1425 if ((mtyp == ACTIVATE_MSG) && (l->state == LINK_ESTABLISHING))
1426 rc = TIPC_LINK_UP_EVT;
1427
1428 l->peer_session = msg_session(hdr);
1429 l->peer_bearer_id = msg_bearer_id(hdr);
1430 if (l->mtu > msg_max_pkt(hdr))
1431 l->mtu = msg_max_pkt(hdr);
1432 break;
1433
1434 case STATE_MSG:
1435
1436 /* Update own tolerance if peer indicates a non-zero value */
1437 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL))
1438 l->tolerance = peers_tol;
1439
1440 if (peers_prio && in_range(peers_prio, TIPC_MIN_LINK_PRI,
1441 TIPC_MAX_LINK_PRI)) {
1442 l->priority = peers_prio;
1443 rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1444 }
1445
1446 l->silent_intv_cnt = 0;
1447 l->stats.recv_states++;
1448 if (msg_probe(hdr))
1449 l->stats.recv_probes++;
1450
1451 if (!link_is_up(l)) {
1452 if (l->state == LINK_ESTABLISHING)
1453 rc = TIPC_LINK_UP_EVT;
1454 break;
1455 }
1456
1457 /* Send NACK if peer has sent pkts we haven't received yet */
1458 if (more(peers_snd_nxt, rcv_nxt) && !tipc_link_is_synching(l))
1459 rcvgap = peers_snd_nxt - l->rcv_nxt;
1460 if (rcvgap || (msg_probe(hdr)))
1461 tipc_link_build_proto_msg(l, STATE_MSG, 0, rcvgap,
1462 0, 0, xmitq);
1463 tipc_link_release_pkts(l, ack);
1464
1465 /* If NACK, retransmit will now start at right position */
1466 if (gap) {
1467 rc = tipc_link_retrans(l, ack + 1, ack + gap, xmitq);
1468 l->stats.recv_nacks++;
1469 }
1470
1471 tipc_link_advance_backlog(l, xmitq);
1472 if (unlikely(!skb_queue_empty(&l->wakeupq)))
1473 link_prepare_wakeup(l);
1474 }
1475 exit:
1476 kfree_skb(skb);
1477 return rc;
1478 }
1479
1480 /* tipc_link_build_bc_proto_msg() - create broadcast protocol message
1481 */
1482 static bool tipc_link_build_bc_proto_msg(struct tipc_link *l, bool bcast,
1483 u16 peers_snd_nxt,
1484 struct sk_buff_head *xmitq)
1485 {
1486 struct sk_buff *skb;
1487 struct tipc_msg *hdr;
1488 struct sk_buff *dfrd_skb = skb_peek(&l->deferdq);
1489 u16 ack = l->rcv_nxt - 1;
1490 u16 gap_to = peers_snd_nxt - 1;
1491
1492 skb = tipc_msg_create(BCAST_PROTOCOL, STATE_MSG, INT_H_SIZE,
1493 0, l->addr, tipc_own_addr(l->net), 0, 0, 0);
1494 if (!skb)
1495 return false;
1496 hdr = buf_msg(skb);
1497 msg_set_last_bcast(hdr, l->bc_sndlink->snd_nxt - 1);
1498 msg_set_bcast_ack(hdr, ack);
1499 msg_set_bcgap_after(hdr, ack);
1500 if (dfrd_skb)
1501 gap_to = buf_seqno(dfrd_skb) - 1;
1502 msg_set_bcgap_to(hdr, gap_to);
1503 msg_set_non_seq(hdr, bcast);
1504 __skb_queue_tail(xmitq, skb);
1505 return true;
1506 }
1507
1508 /* tipc_link_build_bc_init_msg() - synchronize broadcast link endpoints.
1509 *
1510 * Give a newly added peer node the sequence number where it should
1511 * start receiving and acking broadcast packets.
1512 */
1513 static void tipc_link_build_bc_init_msg(struct tipc_link *l,
1514 struct sk_buff_head *xmitq)
1515 {
1516 struct sk_buff_head list;
1517
1518 __skb_queue_head_init(&list);
1519 if (!tipc_link_build_bc_proto_msg(l->bc_rcvlink, false, 0, &list))
1520 return;
1521 tipc_link_xmit(l, &list, xmitq);
1522 }
1523
1524 /* tipc_link_bc_init_rcv - receive initial broadcast synch data from peer
1525 */
1526 void tipc_link_bc_init_rcv(struct tipc_link *l, struct tipc_msg *hdr)
1527 {
1528 int mtyp = msg_type(hdr);
1529 u16 peers_snd_nxt = msg_bc_snd_nxt(hdr);
1530
1531 if (link_is_up(l))
1532 return;
1533
1534 if (msg_user(hdr) == BCAST_PROTOCOL) {
1535 l->rcv_nxt = peers_snd_nxt;
1536 l->state = LINK_ESTABLISHED;
1537 return;
1538 }
1539
1540 if (l->peer_caps & TIPC_BCAST_SYNCH)
1541 return;
1542
1543 if (msg_peer_node_is_up(hdr))
1544 return;
1545
1546 /* Compatibility: accept older, less safe initial synch data */
1547 if ((mtyp == RESET_MSG) || (mtyp == ACTIVATE_MSG))
1548 l->rcv_nxt = peers_snd_nxt;
1549 }
1550
1551 /* tipc_link_bc_sync_rcv - update rcv link according to peer's send state
1552 */
1553 void tipc_link_bc_sync_rcv(struct tipc_link *l, struct tipc_msg *hdr,
1554 struct sk_buff_head *xmitq)
1555 {
1556 u16 peers_snd_nxt = msg_bc_snd_nxt(hdr);
1557
1558 if (!link_is_up(l))
1559 return;
1560
1561 if (!msg_peer_node_is_up(hdr))
1562 return;
1563
1564 /* Open when peer ackowledges our bcast init msg (pkt #1) */
1565 if (msg_ack(hdr))
1566 l->bc_peer_is_up = true;
1567
1568 if (!l->bc_peer_is_up)
1569 return;
1570
1571 /* Ignore if peers_snd_nxt goes beyond receive window */
1572 if (more(peers_snd_nxt, l->rcv_nxt + l->window))
1573 return;
1574
1575 if (!more(peers_snd_nxt, l->rcv_nxt)) {
1576 l->nack_state = BC_NACK_SND_CONDITIONAL;
1577 return;
1578 }
1579
1580 /* Don't NACK if one was recently sent or peeked */
1581 if (l->nack_state == BC_NACK_SND_SUPPRESS) {
1582 l->nack_state = BC_NACK_SND_UNCONDITIONAL;
1583 return;
1584 }
1585
1586 /* Conditionally delay NACK sending until next synch rcv */
1587 if (l->nack_state == BC_NACK_SND_CONDITIONAL) {
1588 l->nack_state = BC_NACK_SND_UNCONDITIONAL;
1589 if ((peers_snd_nxt - l->rcv_nxt) < TIPC_MIN_LINK_WIN)
1590 return;
1591 }
1592
1593 /* Send NACK now but suppress next one */
1594 tipc_link_build_bc_proto_msg(l, true, peers_snd_nxt, xmitq);
1595 l->nack_state = BC_NACK_SND_SUPPRESS;
1596 }
1597
1598 void tipc_link_bc_ack_rcv(struct tipc_link *l, u16 acked,
1599 struct sk_buff_head *xmitq)
1600 {
1601 struct sk_buff *skb, *tmp;
1602 struct tipc_link *snd_l = l->bc_sndlink;
1603
1604 if (!link_is_up(l) || !l->bc_peer_is_up)
1605 return;
1606
1607 if (!more(acked, l->acked))
1608 return;
1609
1610 /* Skip over packets peer has already acked */
1611 skb_queue_walk(&snd_l->transmq, skb) {
1612 if (more(buf_seqno(skb), l->acked))
1613 break;
1614 }
1615
1616 /* Update/release the packets peer is acking now */
1617 skb_queue_walk_from_safe(&snd_l->transmq, skb, tmp) {
1618 if (more(buf_seqno(skb), acked))
1619 break;
1620 if (!--TIPC_SKB_CB(skb)->ackers) {
1621 __skb_unlink(skb, &snd_l->transmq);
1622 kfree_skb(skb);
1623 }
1624 }
1625 l->acked = acked;
1626 tipc_link_advance_backlog(snd_l, xmitq);
1627 if (unlikely(!skb_queue_empty(&snd_l->wakeupq)))
1628 link_prepare_wakeup(snd_l);
1629 }
1630
1631 /* tipc_link_bc_nack_rcv(): receive broadcast nack message
1632 */
1633 int tipc_link_bc_nack_rcv(struct tipc_link *l, struct sk_buff *skb,
1634 struct sk_buff_head *xmitq)
1635 {
1636 struct tipc_msg *hdr = buf_msg(skb);
1637 u32 dnode = msg_destnode(hdr);
1638 int mtyp = msg_type(hdr);
1639 u16 acked = msg_bcast_ack(hdr);
1640 u16 from = acked + 1;
1641 u16 to = msg_bcgap_to(hdr);
1642 u16 peers_snd_nxt = to + 1;
1643 int rc = 0;
1644
1645 kfree_skb(skb);
1646
1647 if (!tipc_link_is_up(l) || !l->bc_peer_is_up)
1648 return 0;
1649
1650 if (mtyp != STATE_MSG)
1651 return 0;
1652
1653 if (dnode == tipc_own_addr(l->net)) {
1654 tipc_link_bc_ack_rcv(l, acked, xmitq);
1655 rc = tipc_link_retrans(l->bc_sndlink, from, to, xmitq);
1656 l->stats.recv_nacks++;
1657 return rc;
1658 }
1659
1660 /* Msg for other node => suppress own NACK at next sync if applicable */
1661 if (more(peers_snd_nxt, l->rcv_nxt) && !less(l->rcv_nxt, from))
1662 l->nack_state = BC_NACK_SND_SUPPRESS;
1663
1664 return 0;
1665 }
1666
1667 void tipc_link_set_queue_limits(struct tipc_link *l, u32 win)
1668 {
1669 int max_bulk = TIPC_MAX_PUBLICATIONS / (l->mtu / ITEM_SIZE);
1670
1671 l->window = win;
1672 l->backlog[TIPC_LOW_IMPORTANCE].limit = win / 2;
1673 l->backlog[TIPC_MEDIUM_IMPORTANCE].limit = win;
1674 l->backlog[TIPC_HIGH_IMPORTANCE].limit = win / 2 * 3;
1675 l->backlog[TIPC_CRITICAL_IMPORTANCE].limit = win * 2;
1676 l->backlog[TIPC_SYSTEM_IMPORTANCE].limit = max_bulk;
1677 }
1678
1679 /**
1680 * link_reset_stats - reset link statistics
1681 * @l: pointer to link
1682 */
1683 void tipc_link_reset_stats(struct tipc_link *l)
1684 {
1685 memset(&l->stats, 0, sizeof(l->stats));
1686 if (!link_is_bc_sndlink(l)) {
1687 l->stats.sent_info = l->snd_nxt;
1688 l->stats.recv_info = l->rcv_nxt;
1689 }
1690 }
1691
1692 static void link_print(struct tipc_link *l, const char *str)
1693 {
1694 struct sk_buff *hskb = skb_peek(&l->transmq);
1695 u16 head = hskb ? msg_seqno(buf_msg(hskb)) : l->snd_nxt - 1;
1696 u16 tail = l->snd_nxt - 1;
1697
1698 pr_info("%s Link <%s> state %x\n", str, l->name, l->state);
1699 pr_info("XMTQ: %u [%u-%u], BKLGQ: %u, SNDNX: %u, RCVNX: %u\n",
1700 skb_queue_len(&l->transmq), head, tail,
1701 skb_queue_len(&l->backlogq), l->snd_nxt, l->rcv_nxt);
1702 }
1703
1704 /* Parse and validate nested (link) properties valid for media, bearer and link
1705 */
1706 int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[])
1707 {
1708 int err;
1709
1710 err = nla_parse_nested(props, TIPC_NLA_PROP_MAX, prop,
1711 tipc_nl_prop_policy);
1712 if (err)
1713 return err;
1714
1715 if (props[TIPC_NLA_PROP_PRIO]) {
1716 u32 prio;
1717
1718 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
1719 if (prio > TIPC_MAX_LINK_PRI)
1720 return -EINVAL;
1721 }
1722
1723 if (props[TIPC_NLA_PROP_TOL]) {
1724 u32 tol;
1725
1726 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
1727 if ((tol < TIPC_MIN_LINK_TOL) || (tol > TIPC_MAX_LINK_TOL))
1728 return -EINVAL;
1729 }
1730
1731 if (props[TIPC_NLA_PROP_WIN]) {
1732 u32 win;
1733
1734 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
1735 if ((win < TIPC_MIN_LINK_WIN) || (win > TIPC_MAX_LINK_WIN))
1736 return -EINVAL;
1737 }
1738
1739 return 0;
1740 }
1741
1742 static int __tipc_nl_add_stats(struct sk_buff *skb, struct tipc_stats *s)
1743 {
1744 int i;
1745 struct nlattr *stats;
1746
1747 struct nla_map {
1748 u32 key;
1749 u32 val;
1750 };
1751
1752 struct nla_map map[] = {
1753 {TIPC_NLA_STATS_RX_INFO, s->recv_info},
1754 {TIPC_NLA_STATS_RX_FRAGMENTS, s->recv_fragments},
1755 {TIPC_NLA_STATS_RX_FRAGMENTED, s->recv_fragmented},
1756 {TIPC_NLA_STATS_RX_BUNDLES, s->recv_bundles},
1757 {TIPC_NLA_STATS_RX_BUNDLED, s->recv_bundled},
1758 {TIPC_NLA_STATS_TX_INFO, s->sent_info},
1759 {TIPC_NLA_STATS_TX_FRAGMENTS, s->sent_fragments},
1760 {TIPC_NLA_STATS_TX_FRAGMENTED, s->sent_fragmented},
1761 {TIPC_NLA_STATS_TX_BUNDLES, s->sent_bundles},
1762 {TIPC_NLA_STATS_TX_BUNDLED, s->sent_bundled},
1763 {TIPC_NLA_STATS_MSG_PROF_TOT, (s->msg_length_counts) ?
1764 s->msg_length_counts : 1},
1765 {TIPC_NLA_STATS_MSG_LEN_CNT, s->msg_length_counts},
1766 {TIPC_NLA_STATS_MSG_LEN_TOT, s->msg_lengths_total},
1767 {TIPC_NLA_STATS_MSG_LEN_P0, s->msg_length_profile[0]},
1768 {TIPC_NLA_STATS_MSG_LEN_P1, s->msg_length_profile[1]},
1769 {TIPC_NLA_STATS_MSG_LEN_P2, s->msg_length_profile[2]},
1770 {TIPC_NLA_STATS_MSG_LEN_P3, s->msg_length_profile[3]},
1771 {TIPC_NLA_STATS_MSG_LEN_P4, s->msg_length_profile[4]},
1772 {TIPC_NLA_STATS_MSG_LEN_P5, s->msg_length_profile[5]},
1773 {TIPC_NLA_STATS_MSG_LEN_P6, s->msg_length_profile[6]},
1774 {TIPC_NLA_STATS_RX_STATES, s->recv_states},
1775 {TIPC_NLA_STATS_RX_PROBES, s->recv_probes},
1776 {TIPC_NLA_STATS_RX_NACKS, s->recv_nacks},
1777 {TIPC_NLA_STATS_RX_DEFERRED, s->deferred_recv},
1778 {TIPC_NLA_STATS_TX_STATES, s->sent_states},
1779 {TIPC_NLA_STATS_TX_PROBES, s->sent_probes},
1780 {TIPC_NLA_STATS_TX_NACKS, s->sent_nacks},
1781 {TIPC_NLA_STATS_TX_ACKS, s->sent_acks},
1782 {TIPC_NLA_STATS_RETRANSMITTED, s->retransmitted},
1783 {TIPC_NLA_STATS_DUPLICATES, s->duplicates},
1784 {TIPC_NLA_STATS_LINK_CONGS, s->link_congs},
1785 {TIPC_NLA_STATS_MAX_QUEUE, s->max_queue_sz},
1786 {TIPC_NLA_STATS_AVG_QUEUE, s->queue_sz_counts ?
1787 (s->accu_queue_sz / s->queue_sz_counts) : 0}
1788 };
1789
1790 stats = nla_nest_start(skb, TIPC_NLA_LINK_STATS);
1791 if (!stats)
1792 return -EMSGSIZE;
1793
1794 for (i = 0; i < ARRAY_SIZE(map); i++)
1795 if (nla_put_u32(skb, map[i].key, map[i].val))
1796 goto msg_full;
1797
1798 nla_nest_end(skb, stats);
1799
1800 return 0;
1801 msg_full:
1802 nla_nest_cancel(skb, stats);
1803
1804 return -EMSGSIZE;
1805 }
1806
1807 /* Caller should hold appropriate locks to protect the link */
1808 int __tipc_nl_add_link(struct net *net, struct tipc_nl_msg *msg,
1809 struct tipc_link *link, int nlflags)
1810 {
1811 int err;
1812 void *hdr;
1813 struct nlattr *attrs;
1814 struct nlattr *prop;
1815 struct tipc_net *tn = net_generic(net, tipc_net_id);
1816
1817 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1818 nlflags, TIPC_NL_LINK_GET);
1819 if (!hdr)
1820 return -EMSGSIZE;
1821
1822 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK);
1823 if (!attrs)
1824 goto msg_full;
1825
1826 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, link->name))
1827 goto attr_msg_full;
1828 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_DEST,
1829 tipc_cluster_mask(tn->own_addr)))
1830 goto attr_msg_full;
1831 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_MTU, link->mtu))
1832 goto attr_msg_full;
1833 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, link->rcv_nxt))
1834 goto attr_msg_full;
1835 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, link->snd_nxt))
1836 goto attr_msg_full;
1837
1838 if (tipc_link_is_up(link))
1839 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
1840 goto attr_msg_full;
1841 if (link->active)
1842 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_ACTIVE))
1843 goto attr_msg_full;
1844
1845 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP);
1846 if (!prop)
1847 goto attr_msg_full;
1848 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
1849 goto prop_msg_full;
1850 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_TOL, link->tolerance))
1851 goto prop_msg_full;
1852 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN,
1853 link->window))
1854 goto prop_msg_full;
1855 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
1856 goto prop_msg_full;
1857 nla_nest_end(msg->skb, prop);
1858
1859 err = __tipc_nl_add_stats(msg->skb, &link->stats);
1860 if (err)
1861 goto attr_msg_full;
1862
1863 nla_nest_end(msg->skb, attrs);
1864 genlmsg_end(msg->skb, hdr);
1865
1866 return 0;
1867
1868 prop_msg_full:
1869 nla_nest_cancel(msg->skb, prop);
1870 attr_msg_full:
1871 nla_nest_cancel(msg->skb, attrs);
1872 msg_full:
1873 genlmsg_cancel(msg->skb, hdr);
1874
1875 return -EMSGSIZE;
1876 }
1877
1878 static int __tipc_nl_add_bc_link_stat(struct sk_buff *skb,
1879 struct tipc_stats *stats)
1880 {
1881 int i;
1882 struct nlattr *nest;
1883
1884 struct nla_map {
1885 __u32 key;
1886 __u32 val;
1887 };
1888
1889 struct nla_map map[] = {
1890 {TIPC_NLA_STATS_RX_INFO, stats->recv_info},
1891 {TIPC_NLA_STATS_RX_FRAGMENTS, stats->recv_fragments},
1892 {TIPC_NLA_STATS_RX_FRAGMENTED, stats->recv_fragmented},
1893 {TIPC_NLA_STATS_RX_BUNDLES, stats->recv_bundles},
1894 {TIPC_NLA_STATS_RX_BUNDLED, stats->recv_bundled},
1895 {TIPC_NLA_STATS_TX_INFO, stats->sent_info},
1896 {TIPC_NLA_STATS_TX_FRAGMENTS, stats->sent_fragments},
1897 {TIPC_NLA_STATS_TX_FRAGMENTED, stats->sent_fragmented},
1898 {TIPC_NLA_STATS_TX_BUNDLES, stats->sent_bundles},
1899 {TIPC_NLA_STATS_TX_BUNDLED, stats->sent_bundled},
1900 {TIPC_NLA_STATS_RX_NACKS, stats->recv_nacks},
1901 {TIPC_NLA_STATS_RX_DEFERRED, stats->deferred_recv},
1902 {TIPC_NLA_STATS_TX_NACKS, stats->sent_nacks},
1903 {TIPC_NLA_STATS_TX_ACKS, stats->sent_acks},
1904 {TIPC_NLA_STATS_RETRANSMITTED, stats->retransmitted},
1905 {TIPC_NLA_STATS_DUPLICATES, stats->duplicates},
1906 {TIPC_NLA_STATS_LINK_CONGS, stats->link_congs},
1907 {TIPC_NLA_STATS_MAX_QUEUE, stats->max_queue_sz},
1908 {TIPC_NLA_STATS_AVG_QUEUE, stats->queue_sz_counts ?
1909 (stats->accu_queue_sz / stats->queue_sz_counts) : 0}
1910 };
1911
1912 nest = nla_nest_start(skb, TIPC_NLA_LINK_STATS);
1913 if (!nest)
1914 return -EMSGSIZE;
1915
1916 for (i = 0; i < ARRAY_SIZE(map); i++)
1917 if (nla_put_u32(skb, map[i].key, map[i].val))
1918 goto msg_full;
1919
1920 nla_nest_end(skb, nest);
1921
1922 return 0;
1923 msg_full:
1924 nla_nest_cancel(skb, nest);
1925
1926 return -EMSGSIZE;
1927 }
1928
1929 int tipc_nl_add_bc_link(struct net *net, struct tipc_nl_msg *msg)
1930 {
1931 int err;
1932 void *hdr;
1933 struct nlattr *attrs;
1934 struct nlattr *prop;
1935 struct tipc_net *tn = net_generic(net, tipc_net_id);
1936 struct tipc_link *bcl = tn->bcl;
1937
1938 if (!bcl)
1939 return 0;
1940
1941 tipc_bcast_lock(net);
1942
1943 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1944 NLM_F_MULTI, TIPC_NL_LINK_GET);
1945 if (!hdr) {
1946 tipc_bcast_unlock(net);
1947 return -EMSGSIZE;
1948 }
1949
1950 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK);
1951 if (!attrs)
1952 goto msg_full;
1953
1954 /* The broadcast link is always up */
1955 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
1956 goto attr_msg_full;
1957
1958 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_BROADCAST))
1959 goto attr_msg_full;
1960 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, bcl->name))
1961 goto attr_msg_full;
1962 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, bcl->rcv_nxt))
1963 goto attr_msg_full;
1964 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, bcl->snd_nxt))
1965 goto attr_msg_full;
1966
1967 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP);
1968 if (!prop)
1969 goto attr_msg_full;
1970 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, bcl->window))
1971 goto prop_msg_full;
1972 nla_nest_end(msg->skb, prop);
1973
1974 err = __tipc_nl_add_bc_link_stat(msg->skb, &bcl->stats);
1975 if (err)
1976 goto attr_msg_full;
1977
1978 tipc_bcast_unlock(net);
1979 nla_nest_end(msg->skb, attrs);
1980 genlmsg_end(msg->skb, hdr);
1981
1982 return 0;
1983
1984 prop_msg_full:
1985 nla_nest_cancel(msg->skb, prop);
1986 attr_msg_full:
1987 nla_nest_cancel(msg->skb, attrs);
1988 msg_full:
1989 tipc_bcast_unlock(net);
1990 genlmsg_cancel(msg->skb, hdr);
1991
1992 return -EMSGSIZE;
1993 }
1994
1995 void tipc_link_set_tolerance(struct tipc_link *l, u32 tol,
1996 struct sk_buff_head *xmitq)
1997 {
1998 l->tolerance = tol;
1999 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, tol, 0, xmitq);
2000 }
2001
2002 void tipc_link_set_prio(struct tipc_link *l, u32 prio,
2003 struct sk_buff_head *xmitq)
2004 {
2005 l->priority = prio;
2006 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, prio, xmitq);
2007 }
2008
2009 void tipc_link_set_abort_limit(struct tipc_link *l, u32 limit)
2010 {
2011 l->abort_limit = limit;
2012 }