projects / deliverable / linux.git / blob
? search:


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