2 * net/tipc/link.c: TIPC link code
4 * Copyright (c) 1996-2007, 2012-2015, Ericsson AB
5 * Copyright (c) 2004-2007, 2010-2013, Wind River Systems
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
42 #include "name_distr.h"
46 #include <linux/pkt_sched.h>
49 * Error message prefixes
51 static const char *link_co_err = "Link tunneling error, ";
52 static const char *link_rst_msg = "Resetting link ";
54 static const struct nla_policy tipc_nl_link_policy[TIPC_NLA_LINK_MAX + 1] = {
55 [TIPC_NLA_LINK_UNSPEC] = { .type = NLA_UNSPEC },
56 [TIPC_NLA_LINK_NAME] = {
58 .len = TIPC_MAX_LINK_NAME
60 [TIPC_NLA_LINK_MTU] = { .type = NLA_U32 },
61 [TIPC_NLA_LINK_BROADCAST] = { .type = NLA_FLAG },
62 [TIPC_NLA_LINK_UP] = { .type = NLA_FLAG },
63 [TIPC_NLA_LINK_ACTIVE] = { .type = NLA_FLAG },
64 [TIPC_NLA_LINK_PROP] = { .type = NLA_NESTED },
65 [TIPC_NLA_LINK_STATS] = { .type = NLA_NESTED },
66 [TIPC_NLA_LINK_RX] = { .type = NLA_U32 },
67 [TIPC_NLA_LINK_TX] = { .type = NLA_U32 }
70 /* Properties valid for media, bearar and link */
71 static const struct nla_policy tipc_nl_prop_policy[TIPC_NLA_PROP_MAX + 1] = {
72 [TIPC_NLA_PROP_UNSPEC] = { .type = NLA_UNSPEC },
73 [TIPC_NLA_PROP_PRIO] = { .type = NLA_U32 },
74 [TIPC_NLA_PROP_TOL] = { .type = NLA_U32 },
75 [TIPC_NLA_PROP_WIN] = { .type = NLA_U32 }
79 * Interval between NACKs when packets arrive out of order
81 #define TIPC_NACK_INTV (TIPC_MIN_LINK_WIN * 2)
83 * Out-of-range value for link session numbers
85 #define WILDCARD_SESSION 0x10000
90 LINK_ESTABLISHED = 0xe,
91 LINK_ESTABLISHING = 0xe << 4,
92 LINK_RESET = 0x1 << 8,
93 LINK_RESETTING = 0x2 << 12,
94 LINK_PEER_RESET = 0xd << 16,
95 LINK_FAILINGOVER = 0xf << 20,
96 LINK_SYNCHING = 0xc << 24
99 /* Link FSM state checking routines
101 static int link_is_up(struct tipc_link *l)
103 return l->state & (LINK_ESTABLISHED | LINK_SYNCHING);
106 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb,
107 struct sk_buff_head *xmitq);
108 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe,
109 u16 rcvgap, int tolerance, int priority,
110 struct sk_buff_head *xmitq);
111 static void link_reset_statistics(struct tipc_link *l_ptr);
112 static void link_print(struct tipc_link *l_ptr, const char *str);
113 static void tipc_link_sync_rcv(struct tipc_node *n, struct sk_buff *buf);
116 * Simple non-static link routines (i.e. referenced outside this file)
118 bool tipc_link_is_up(struct tipc_link *l)
120 return link_is_up(l);
123 bool tipc_link_peer_is_down(struct tipc_link *l)
125 return l->state == LINK_PEER_RESET;
128 bool tipc_link_is_reset(struct tipc_link *l)
130 return l->state & (LINK_RESET | LINK_FAILINGOVER | LINK_ESTABLISHING);
133 bool tipc_link_is_establishing(struct tipc_link *l)
135 return l->state == LINK_ESTABLISHING;
138 bool tipc_link_is_synching(struct tipc_link *l)
140 return l->state == LINK_SYNCHING;
143 bool tipc_link_is_failingover(struct tipc_link *l)
145 return l->state == LINK_FAILINGOVER;
148 bool tipc_link_is_blocked(struct tipc_link *l)
150 return l->state & (LINK_RESETTING | LINK_PEER_RESET | LINK_FAILINGOVER);
153 int tipc_link_is_active(struct tipc_link *l)
155 struct tipc_node *n = l->owner;
157 return (node_active_link(n, 0) == l) || (node_active_link(n, 1) == l);
160 static u32 link_own_addr(struct tipc_link *l)
162 return msg_prevnode(l->pmsg);
166 * tipc_link_create - create a new link
167 * @n: pointer to associated node
168 * @if_name: associated interface name
169 * @bearer_id: id (index) of associated bearer
170 * @tolerance: link tolerance to be used by link
171 * @net_plane: network plane (A,B,c..) this link belongs to
172 * @mtu: mtu to be advertised by link
173 * @priority: priority to be used by link
174 * @window: send window to be used by link
175 * @session: session to be used by link
176 * @ownnode: identity of own node
177 * @peer: node id of peer node
178 * @maddr: media address to be used
179 * @inputq: queue to put messages ready for delivery
180 * @namedq: queue to put binding table update messages ready for delivery
181 * @link: return value, pointer to put the created link
183 * Returns true if link was created, otherwise false
185 bool tipc_link_create(struct tipc_node *n, char *if_name, int bearer_id,
186 int tolerance, char net_plane, u32 mtu, int priority,
187 int window, u32 session, u32 ownnode, u32 peer,
188 struct tipc_media_addr *maddr,
189 struct sk_buff_head *inputq, struct sk_buff_head *namedq,
190 struct tipc_link **link)
193 struct tipc_msg *hdr;
195 l = kzalloc(sizeof(*l), GFP_ATOMIC);
199 l->pmsg = (struct tipc_msg *)&l->proto_msg;
201 tipc_msg_init(ownnode, hdr, LINK_PROTOCOL, RESET_MSG, INT_H_SIZE, peer);
202 msg_set_size(hdr, sizeof(l->proto_msg));
203 msg_set_session(hdr, session);
204 msg_set_bearer_id(hdr, l->bearer_id);
206 /* Note: peer i/f name is completed by reset/activate message */
207 sprintf(l->name, "%u.%u.%u:%s-%u.%u.%u:unknown",
208 tipc_zone(ownnode), tipc_cluster(ownnode), tipc_node(ownnode),
209 if_name, tipc_zone(peer), tipc_cluster(peer), tipc_node(peer));
210 strcpy((char *)msg_data(hdr), if_name);
213 l->media_addr = maddr;
215 l->peer_session = WILDCARD_SESSION;
216 l->bearer_id = bearer_id;
217 l->tolerance = tolerance;
218 l->net_plane = net_plane;
219 l->advertised_mtu = mtu;
221 l->priority = priority;
222 tipc_link_set_queue_limits(l, window);
225 l->state = LINK_RESETTING;
226 __skb_queue_head_init(&l->transmq);
227 __skb_queue_head_init(&l->backlogq);
228 __skb_queue_head_init(&l->deferdq);
229 skb_queue_head_init(&l->wakeupq);
230 skb_queue_head_init(l->inputq);
234 /* tipc_link_build_bcast_sync_msg() - synchronize broadcast link endpoints.
236 * Give a newly added peer node the sequence number where it should
237 * start receiving and acking broadcast packets.
239 void tipc_link_build_bcast_sync_msg(struct tipc_link *l,
240 struct sk_buff_head *xmitq)
243 struct sk_buff_head list;
246 skb = tipc_msg_create(BCAST_PROTOCOL, STATE_MSG, INT_H_SIZE,
247 0, l->addr, link_own_addr(l), 0, 0, 0);
250 last_sent = tipc_bclink_get_last_sent(l->owner->net);
251 msg_set_last_bcast(buf_msg(skb), last_sent);
252 __skb_queue_head_init(&list);
253 __skb_queue_tail(&list, skb);
254 tipc_link_xmit(l, &list, xmitq);
258 * tipc_link_fsm_evt - link finite state machine
259 * @l: pointer to link
260 * @evt: state machine event to be processed
262 int tipc_link_fsm_evt(struct tipc_link *l, int evt)
269 case LINK_PEER_RESET_EVT:
270 l->state = LINK_PEER_RESET;
273 l->state = LINK_RESET;
275 case LINK_FAILURE_EVT:
276 case LINK_FAILOVER_BEGIN_EVT:
277 case LINK_ESTABLISH_EVT:
278 case LINK_FAILOVER_END_EVT:
279 case LINK_SYNCH_BEGIN_EVT:
280 case LINK_SYNCH_END_EVT:
287 case LINK_PEER_RESET_EVT:
288 l->state = LINK_ESTABLISHING;
290 case LINK_FAILOVER_BEGIN_EVT:
291 l->state = LINK_FAILINGOVER;
292 case LINK_FAILURE_EVT:
294 case LINK_ESTABLISH_EVT:
295 case LINK_FAILOVER_END_EVT:
297 case LINK_SYNCH_BEGIN_EVT:
298 case LINK_SYNCH_END_EVT:
303 case LINK_PEER_RESET:
306 l->state = LINK_ESTABLISHING;
308 case LINK_PEER_RESET_EVT:
309 case LINK_ESTABLISH_EVT:
310 case LINK_FAILURE_EVT:
312 case LINK_SYNCH_BEGIN_EVT:
313 case LINK_SYNCH_END_EVT:
314 case LINK_FAILOVER_BEGIN_EVT:
315 case LINK_FAILOVER_END_EVT:
320 case LINK_FAILINGOVER:
322 case LINK_FAILOVER_END_EVT:
323 l->state = LINK_RESET;
325 case LINK_PEER_RESET_EVT:
327 case LINK_ESTABLISH_EVT:
328 case LINK_FAILURE_EVT:
330 case LINK_FAILOVER_BEGIN_EVT:
331 case LINK_SYNCH_BEGIN_EVT:
332 case LINK_SYNCH_END_EVT:
337 case LINK_ESTABLISHING:
339 case LINK_ESTABLISH_EVT:
340 l->state = LINK_ESTABLISHED;
342 case LINK_FAILOVER_BEGIN_EVT:
343 l->state = LINK_FAILINGOVER;
346 l->state = LINK_RESET;
348 case LINK_FAILURE_EVT:
349 case LINK_PEER_RESET_EVT:
350 case LINK_SYNCH_BEGIN_EVT:
351 case LINK_FAILOVER_END_EVT:
353 case LINK_SYNCH_END_EVT:
358 case LINK_ESTABLISHED:
360 case LINK_PEER_RESET_EVT:
361 l->state = LINK_PEER_RESET;
362 rc |= TIPC_LINK_DOWN_EVT;
364 case LINK_FAILURE_EVT:
365 l->state = LINK_RESETTING;
366 rc |= TIPC_LINK_DOWN_EVT;
369 l->state = LINK_RESET;
371 case LINK_ESTABLISH_EVT:
372 case LINK_SYNCH_END_EVT:
374 case LINK_SYNCH_BEGIN_EVT:
375 l->state = LINK_SYNCHING;
377 case LINK_FAILOVER_BEGIN_EVT:
378 case LINK_FAILOVER_END_EVT:
385 case LINK_PEER_RESET_EVT:
386 l->state = LINK_PEER_RESET;
387 rc |= TIPC_LINK_DOWN_EVT;
389 case LINK_FAILURE_EVT:
390 l->state = LINK_RESETTING;
391 rc |= TIPC_LINK_DOWN_EVT;
394 l->state = LINK_RESET;
396 case LINK_ESTABLISH_EVT:
397 case LINK_SYNCH_BEGIN_EVT:
399 case LINK_SYNCH_END_EVT:
400 l->state = LINK_ESTABLISHED;
402 case LINK_FAILOVER_BEGIN_EVT:
403 case LINK_FAILOVER_END_EVT:
409 pr_err("Unknown FSM state %x in %s\n", l->state, l->name);
413 pr_err("Illegal FSM event %x in state %x on link %s\n",
414 evt, l->state, l->name);
418 /* link_profile_stats - update statistical profiling of traffic
420 static void link_profile_stats(struct tipc_link *l)
423 struct tipc_msg *msg;
426 /* Update counters used in statistical profiling of send traffic */
427 l->stats.accu_queue_sz += skb_queue_len(&l->transmq);
428 l->stats.queue_sz_counts++;
430 skb = skb_peek(&l->transmq);
434 length = msg_size(msg);
436 if (msg_user(msg) == MSG_FRAGMENTER) {
437 if (msg_type(msg) != FIRST_FRAGMENT)
439 length = msg_size(msg_get_wrapped(msg));
441 l->stats.msg_lengths_total += length;
442 l->stats.msg_length_counts++;
444 l->stats.msg_length_profile[0]++;
445 else if (length <= 256)
446 l->stats.msg_length_profile[1]++;
447 else if (length <= 1024)
448 l->stats.msg_length_profile[2]++;
449 else if (length <= 4096)
450 l->stats.msg_length_profile[3]++;
451 else if (length <= 16384)
452 l->stats.msg_length_profile[4]++;
453 else if (length <= 32768)
454 l->stats.msg_length_profile[5]++;
456 l->stats.msg_length_profile[6]++;
459 /* tipc_link_timeout - perform periodic task as instructed from node timeout
461 int tipc_link_timeout(struct tipc_link *l, struct sk_buff_head *xmitq)
464 int mtyp = STATE_MSG;
468 link_profile_stats(l);
471 case LINK_ESTABLISHED:
473 if (!l->silent_intv_cnt) {
474 if (tipc_bclink_acks_missing(l->owner))
476 } else if (l->silent_intv_cnt <= l->abort_limit) {
480 rc |= tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
482 l->silent_intv_cnt++;
488 case LINK_ESTABLISHING:
492 case LINK_PEER_RESET:
494 case LINK_FAILINGOVER:
501 tipc_link_build_proto_msg(l, mtyp, prb, 0, 0, 0, xmitq);
507 * link_schedule_user - schedule a message sender for wakeup after congestion
508 * @link: congested link
509 * @list: message that was attempted sent
510 * Create pseudo msg to send back to user when congestion abates
511 * Does not consume buffer list
513 static int link_schedule_user(struct tipc_link *link, struct sk_buff_head *list)
515 struct tipc_msg *msg = buf_msg(skb_peek(list));
516 int imp = msg_importance(msg);
517 u32 oport = msg_origport(msg);
518 u32 addr = link_own_addr(link);
521 /* This really cannot happen... */
522 if (unlikely(imp > TIPC_CRITICAL_IMPORTANCE)) {
523 pr_warn("%s<%s>, send queue full", link_rst_msg, link->name);
526 /* Non-blocking sender: */
527 if (TIPC_SKB_CB(skb_peek(list))->wakeup_pending)
530 /* Create and schedule wakeup pseudo message */
531 skb = tipc_msg_create(SOCK_WAKEUP, 0, INT_H_SIZE, 0,
532 addr, addr, oport, 0, 0);
535 TIPC_SKB_CB(skb)->chain_sz = skb_queue_len(list);
536 TIPC_SKB_CB(skb)->chain_imp = imp;
537 skb_queue_tail(&link->wakeupq, skb);
538 link->stats.link_congs++;
543 * link_prepare_wakeup - prepare users for wakeup after congestion
544 * @link: congested link
545 * Move a number of waiting users, as permitted by available space in
546 * the send queue, from link wait queue to node wait queue for wakeup
548 void link_prepare_wakeup(struct tipc_link *l)
550 int pnd[TIPC_SYSTEM_IMPORTANCE + 1] = {0,};
552 struct sk_buff *skb, *tmp;
554 skb_queue_walk_safe(&l->wakeupq, skb, tmp) {
555 imp = TIPC_SKB_CB(skb)->chain_imp;
556 lim = l->window + l->backlog[imp].limit;
557 pnd[imp] += TIPC_SKB_CB(skb)->chain_sz;
558 if ((pnd[imp] + l->backlog[imp].len) >= lim)
560 skb_unlink(skb, &l->wakeupq);
561 skb_queue_tail(l->inputq, skb);
566 * tipc_link_reset_fragments - purge link's inbound message fragments queue
567 * @l_ptr: pointer to link
569 void tipc_link_reset_fragments(struct tipc_link *l_ptr)
571 kfree_skb(l_ptr->reasm_buf);
572 l_ptr->reasm_buf = NULL;
575 void tipc_link_purge_backlog(struct tipc_link *l)
577 __skb_queue_purge(&l->backlogq);
578 l->backlog[TIPC_LOW_IMPORTANCE].len = 0;
579 l->backlog[TIPC_MEDIUM_IMPORTANCE].len = 0;
580 l->backlog[TIPC_HIGH_IMPORTANCE].len = 0;
581 l->backlog[TIPC_CRITICAL_IMPORTANCE].len = 0;
582 l->backlog[TIPC_SYSTEM_IMPORTANCE].len = 0;
586 * tipc_link_purge_queues - purge all pkt queues associated with link
587 * @l_ptr: pointer to link
589 void tipc_link_purge_queues(struct tipc_link *l_ptr)
591 __skb_queue_purge(&l_ptr->deferdq);
592 __skb_queue_purge(&l_ptr->transmq);
593 tipc_link_purge_backlog(l_ptr);
594 tipc_link_reset_fragments(l_ptr);
597 void tipc_link_reset(struct tipc_link *l)
599 /* Link is down, accept any session */
600 l->peer_session = WILDCARD_SESSION;
602 /* If peer is up, it only accepts an incremented session number */
603 msg_set_session(l->pmsg, msg_session(l->pmsg) + 1);
605 /* Prepare for renewed mtu size negotiation */
606 l->mtu = l->advertised_mtu;
608 /* Clean up all queues: */
609 __skb_queue_purge(&l->transmq);
610 __skb_queue_purge(&l->deferdq);
611 skb_queue_splice_init(&l->wakeupq, l->inputq);
613 tipc_link_purge_backlog(l);
614 kfree_skb(l->reasm_buf);
615 kfree_skb(l->failover_reasm_skb);
617 l->failover_reasm_skb = NULL;
621 l->silent_intv_cnt = 0;
622 l->stats.recv_info = 0;
624 link_reset_statistics(l);
628 * __tipc_link_xmit(): same as tipc_link_xmit, but destlink is known & locked
630 * @list: chain of buffers containing message
632 * Consumes the buffer chain, except when returning an error code,
633 * Returns 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS
634 * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted
636 int __tipc_link_xmit(struct net *net, struct tipc_link *link,
637 struct sk_buff_head *list)
639 struct tipc_msg *msg = buf_msg(skb_peek(list));
640 unsigned int maxwin = link->window;
641 unsigned int i, imp = msg_importance(msg);
642 uint mtu = link->mtu;
643 u16 ack = mod(link->rcv_nxt - 1);
644 u16 seqno = link->snd_nxt;
645 u16 bc_last_in = link->owner->bclink.last_in;
646 struct tipc_media_addr *addr = link->media_addr;
647 struct sk_buff_head *transmq = &link->transmq;
648 struct sk_buff_head *backlogq = &link->backlogq;
649 struct sk_buff *skb, *bskb;
651 /* Match msg importance against this and all higher backlog limits: */
652 for (i = imp; i <= TIPC_SYSTEM_IMPORTANCE; i++) {
653 if (unlikely(link->backlog[i].len >= link->backlog[i].limit))
654 return link_schedule_user(link, list);
656 if (unlikely(msg_size(msg) > mtu))
659 /* Prepare each packet for sending, and add to relevant queue: */
660 while (skb_queue_len(list)) {
661 skb = skb_peek(list);
663 msg_set_seqno(msg, seqno);
664 msg_set_ack(msg, ack);
665 msg_set_bcast_ack(msg, bc_last_in);
667 if (likely(skb_queue_len(transmq) < maxwin)) {
669 __skb_queue_tail(transmq, skb);
670 tipc_bearer_send(net, link->bearer_id, skb, addr);
671 link->rcv_unacked = 0;
675 if (tipc_msg_bundle(skb_peek_tail(backlogq), msg, mtu)) {
676 kfree_skb(__skb_dequeue(list));
677 link->stats.sent_bundled++;
680 if (tipc_msg_make_bundle(&bskb, msg, mtu, link->addr)) {
681 kfree_skb(__skb_dequeue(list));
682 __skb_queue_tail(backlogq, bskb);
683 link->backlog[msg_importance(buf_msg(bskb))].len++;
684 link->stats.sent_bundled++;
685 link->stats.sent_bundles++;
688 link->backlog[imp].len += skb_queue_len(list);
689 skb_queue_splice_tail_init(list, backlogq);
691 link->snd_nxt = seqno;
696 * tipc_link_xmit(): enqueue buffer list according to queue situation
698 * @list: chain of buffers containing message
699 * @xmitq: returned list of packets to be sent by caller
701 * Consumes the buffer chain, except when returning -ELINKCONG,
702 * since the caller then may want to make more send attempts.
703 * Returns 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS
704 * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted
706 int tipc_link_xmit(struct tipc_link *l, struct sk_buff_head *list,
707 struct sk_buff_head *xmitq)
709 struct tipc_msg *hdr = buf_msg(skb_peek(list));
710 unsigned int maxwin = l->window;
711 unsigned int i, imp = msg_importance(hdr);
712 unsigned int mtu = l->mtu;
713 u16 ack = l->rcv_nxt - 1;
714 u16 seqno = l->snd_nxt;
715 u16 bc_last_in = l->owner->bclink.last_in;
716 struct sk_buff_head *transmq = &l->transmq;
717 struct sk_buff_head *backlogq = &l->backlogq;
718 struct sk_buff *skb, *_skb, *bskb;
720 /* Match msg importance against this and all higher backlog limits: */
721 for (i = imp; i <= TIPC_SYSTEM_IMPORTANCE; i++) {
722 if (unlikely(l->backlog[i].len >= l->backlog[i].limit))
723 return link_schedule_user(l, list);
725 if (unlikely(msg_size(hdr) > mtu))
728 /* Prepare each packet for sending, and add to relevant queue: */
729 while (skb_queue_len(list)) {
730 skb = skb_peek(list);
732 msg_set_seqno(hdr, seqno);
733 msg_set_ack(hdr, ack);
734 msg_set_bcast_ack(hdr, bc_last_in);
736 if (likely(skb_queue_len(transmq) < maxwin)) {
737 _skb = skb_clone(skb, GFP_ATOMIC);
741 __skb_queue_tail(transmq, skb);
742 __skb_queue_tail(xmitq, _skb);
747 if (tipc_msg_bundle(skb_peek_tail(backlogq), hdr, mtu)) {
748 kfree_skb(__skb_dequeue(list));
749 l->stats.sent_bundled++;
752 if (tipc_msg_make_bundle(&bskb, hdr, mtu, l->addr)) {
753 kfree_skb(__skb_dequeue(list));
754 __skb_queue_tail(backlogq, bskb);
755 l->backlog[msg_importance(buf_msg(bskb))].len++;
756 l->stats.sent_bundled++;
757 l->stats.sent_bundles++;
760 l->backlog[imp].len += skb_queue_len(list);
761 skb_queue_splice_tail_init(list, backlogq);
768 * tipc_link_sync_rcv - synchronize broadcast link endpoints.
769 * Receive the sequence number where we should start receiving and
770 * acking broadcast packets from a newly added peer node, and open
771 * up for reception of such packets.
773 * Called with node locked
775 static void tipc_link_sync_rcv(struct tipc_node *n, struct sk_buff *buf)
777 struct tipc_msg *msg = buf_msg(buf);
779 n->bclink.last_sent = n->bclink.last_in = msg_last_bcast(msg);
780 n->bclink.recv_permitted = true;
785 * tipc_link_push_packets - push unsent packets to bearer
787 * Push out the unsent messages of a link where congestion
788 * has abated. Node is locked.
790 * Called with node locked
792 void tipc_link_push_packets(struct tipc_link *link)
795 struct tipc_msg *msg;
796 u16 seqno = link->snd_nxt;
797 u16 ack = mod(link->rcv_nxt - 1);
799 while (skb_queue_len(&link->transmq) < link->window) {
800 skb = __skb_dequeue(&link->backlogq);
804 link->backlog[msg_importance(msg)].len--;
805 msg_set_ack(msg, ack);
806 msg_set_seqno(msg, seqno);
807 seqno = mod(seqno + 1);
808 msg_set_bcast_ack(msg, link->owner->bclink.last_in);
809 link->rcv_unacked = 0;
810 __skb_queue_tail(&link->transmq, skb);
811 tipc_bearer_send(link->owner->net, link->bearer_id,
812 skb, link->media_addr);
814 link->snd_nxt = seqno;
817 void tipc_link_advance_backlog(struct tipc_link *l, struct sk_buff_head *xmitq)
819 struct sk_buff *skb, *_skb;
820 struct tipc_msg *hdr;
821 u16 seqno = l->snd_nxt;
822 u16 ack = l->rcv_nxt - 1;
824 while (skb_queue_len(&l->transmq) < l->window) {
825 skb = skb_peek(&l->backlogq);
828 _skb = skb_clone(skb, GFP_ATOMIC);
831 __skb_dequeue(&l->backlogq);
833 l->backlog[msg_importance(hdr)].len--;
834 __skb_queue_tail(&l->transmq, skb);
835 __skb_queue_tail(xmitq, _skb);
836 msg_set_ack(hdr, ack);
837 msg_set_seqno(hdr, seqno);
838 msg_set_bcast_ack(hdr, l->owner->bclink.last_in);
845 static void link_retransmit_failure(struct tipc_link *l_ptr,
848 struct tipc_msg *msg = buf_msg(buf);
849 struct net *net = l_ptr->owner->net;
851 pr_warn("Retransmission failure on link <%s>\n", l_ptr->name);
854 /* Handle failure on standard link */
855 link_print(l_ptr, "Resetting link ");
856 pr_info("Failed msg: usr %u, typ %u, len %u, err %u\n",
857 msg_user(msg), msg_type(msg), msg_size(msg),
859 pr_info("sqno %u, prev: %x, src: %x\n",
860 msg_seqno(msg), msg_prevnode(msg), msg_orignode(msg));
862 /* Handle failure on broadcast link */
863 struct tipc_node *n_ptr;
864 char addr_string[16];
866 pr_info("Msg seq number: %u, ", msg_seqno(msg));
867 pr_cont("Outstanding acks: %lu\n",
868 (unsigned long) TIPC_SKB_CB(buf)->handle);
870 n_ptr = tipc_bclink_retransmit_to(net);
872 tipc_addr_string_fill(addr_string, n_ptr->addr);
873 pr_info("Broadcast link info for %s\n", addr_string);
874 pr_info("Reception permitted: %d, Acked: %u\n",
875 n_ptr->bclink.recv_permitted,
876 n_ptr->bclink.acked);
877 pr_info("Last in: %u, Oos state: %u, Last sent: %u\n",
878 n_ptr->bclink.last_in,
879 n_ptr->bclink.oos_state,
880 n_ptr->bclink.last_sent);
882 n_ptr->action_flags |= TIPC_BCAST_RESET;
883 l_ptr->stale_count = 0;
887 void tipc_link_retransmit(struct tipc_link *l_ptr, struct sk_buff *skb,
890 struct tipc_msg *msg;
897 /* Detect repeated retransmit failures */
898 if (l_ptr->last_retransm == msg_seqno(msg)) {
899 if (++l_ptr->stale_count > 100) {
900 link_retransmit_failure(l_ptr, skb);
904 l_ptr->last_retransm = msg_seqno(msg);
905 l_ptr->stale_count = 1;
908 skb_queue_walk_from(&l_ptr->transmq, skb) {
912 msg_set_ack(msg, mod(l_ptr->rcv_nxt - 1));
913 msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in);
914 tipc_bearer_send(l_ptr->owner->net, l_ptr->bearer_id, skb,
917 l_ptr->stats.retransmitted++;
921 static int tipc_link_retransm(struct tipc_link *l, int retransm,
922 struct sk_buff_head *xmitq)
924 struct sk_buff *_skb, *skb = skb_peek(&l->transmq);
925 struct tipc_msg *hdr;
930 /* Detect repeated retransmit failures on same packet */
931 if (likely(l->last_retransm != buf_seqno(skb))) {
932 l->last_retransm = buf_seqno(skb);
934 } else if (++l->stale_count > 100) {
935 link_retransmit_failure(l, skb);
936 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
938 skb_queue_walk(&l->transmq, skb) {
942 _skb = __pskb_copy(skb, MIN_H_SIZE, GFP_ATOMIC);
946 msg_set_ack(hdr, l->rcv_nxt - 1);
947 msg_set_bcast_ack(hdr, l->owner->bclink.last_in);
948 _skb->priority = TC_PRIO_CONTROL;
949 __skb_queue_tail(xmitq, _skb);
951 l->stats.retransmitted++;
956 /* tipc_data_input - deliver data and name distr msgs to upper layer
958 * Consumes buffer if message is of right type
959 * Node lock must be held
961 static bool tipc_data_input(struct tipc_link *link, struct sk_buff *skb,
962 struct sk_buff_head *inputq)
964 struct tipc_node *node = link->owner;
966 switch (msg_user(buf_msg(skb))) {
967 case TIPC_LOW_IMPORTANCE:
968 case TIPC_MEDIUM_IMPORTANCE:
969 case TIPC_HIGH_IMPORTANCE:
970 case TIPC_CRITICAL_IMPORTANCE:
972 skb_queue_tail(inputq, skb);
974 case NAME_DISTRIBUTOR:
975 node->bclink.recv_permitted = true;
976 skb_queue_tail(link->namedq, skb);
979 case TUNNEL_PROTOCOL:
984 pr_warn("Dropping received illegal msg type\n");
990 /* tipc_link_input - process packet that has passed link protocol check
994 static int tipc_link_input(struct tipc_link *l, struct sk_buff *skb,
995 struct sk_buff_head *inputq)
997 struct tipc_node *node = l->owner;
998 struct tipc_msg *hdr = buf_msg(skb);
999 struct sk_buff **reasm_skb = &l->reasm_buf;
1000 struct sk_buff *iskb;
1001 struct sk_buff_head tmpq;
1002 int usr = msg_user(hdr);
1007 if (unlikely(usr == TUNNEL_PROTOCOL)) {
1008 if (msg_type(hdr) == SYNCH_MSG) {
1009 __skb_queue_purge(&l->deferdq);
1012 if (!tipc_msg_extract(skb, &iskb, &ipos))
1017 if (less(msg_seqno(hdr), l->drop_point))
1019 if (tipc_data_input(l, skb, inputq))
1021 usr = msg_user(hdr);
1022 reasm_skb = &l->failover_reasm_skb;
1025 if (usr == MSG_BUNDLER) {
1026 skb_queue_head_init(&tmpq);
1027 l->stats.recv_bundles++;
1028 l->stats.recv_bundled += msg_msgcnt(hdr);
1029 while (tipc_msg_extract(skb, &iskb, &pos))
1030 tipc_data_input(l, iskb, &tmpq);
1031 tipc_skb_queue_splice_tail(&tmpq, inputq);
1033 } else if (usr == MSG_FRAGMENTER) {
1034 l->stats.recv_fragments++;
1035 if (tipc_buf_append(reasm_skb, &skb)) {
1036 l->stats.recv_fragmented++;
1037 tipc_data_input(l, skb, inputq);
1038 } else if (!*reasm_skb) {
1039 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1042 } else if (usr == BCAST_PROTOCOL) {
1043 tipc_link_sync_rcv(node, skb);
1051 static bool tipc_link_release_pkts(struct tipc_link *l, u16 acked)
1053 bool released = false;
1054 struct sk_buff *skb, *tmp;
1056 skb_queue_walk_safe(&l->transmq, skb, tmp) {
1057 if (more(buf_seqno(skb), acked))
1059 __skb_unlink(skb, &l->transmq);
1066 /* tipc_link_build_ack_msg: prepare link acknowledge message for transmission
1068 void tipc_link_build_ack_msg(struct tipc_link *l, struct sk_buff_head *xmitq)
1071 l->stats.sent_acks++;
1072 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, xmitq);
1075 /* tipc_link_build_reset_msg: prepare link RESET or ACTIVATE message
1077 void tipc_link_build_reset_msg(struct tipc_link *l, struct sk_buff_head *xmitq)
1079 int mtyp = RESET_MSG;
1081 if (l->state == LINK_ESTABLISHING)
1082 mtyp = ACTIVATE_MSG;
1084 tipc_link_build_proto_msg(l, mtyp, 0, 0, 0, 0, xmitq);
1087 /* tipc_link_build_nack_msg: prepare link nack message for transmission
1089 static void tipc_link_build_nack_msg(struct tipc_link *l,
1090 struct sk_buff_head *xmitq)
1092 u32 def_cnt = ++l->stats.deferred_recv;
1094 if ((skb_queue_len(&l->deferdq) == 1) || !(def_cnt % TIPC_NACK_INTV))
1095 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, xmitq);
1098 /* tipc_link_rcv - process TIPC packets/messages arriving from off-node
1099 * @l: the link that should handle the message
1101 * @xmitq: queue to place packets to be sent after this call
1103 int tipc_link_rcv(struct tipc_link *l, struct sk_buff *skb,
1104 struct sk_buff_head *xmitq)
1106 struct sk_buff_head *defq = &l->deferdq;
1107 struct tipc_msg *hdr;
1108 u16 seqno, rcv_nxt, win_lim;
1113 seqno = msg_seqno(hdr);
1114 rcv_nxt = l->rcv_nxt;
1115 win_lim = rcv_nxt + TIPC_MAX_LINK_WIN;
1117 /* Verify and update link state */
1118 if (unlikely(msg_user(hdr) == LINK_PROTOCOL))
1119 return tipc_link_proto_rcv(l, skb, xmitq);
1121 if (unlikely(!link_is_up(l))) {
1122 if (l->state == LINK_ESTABLISHING)
1123 rc = TIPC_LINK_UP_EVT;
1127 /* Don't send probe at next timeout expiration */
1128 l->silent_intv_cnt = 0;
1130 /* Drop if outside receive window */
1131 if (unlikely(less(seqno, rcv_nxt) || more(seqno, win_lim))) {
1132 l->stats.duplicates++;
1136 /* Forward queues and wake up waiting users */
1137 if (likely(tipc_link_release_pkts(l, msg_ack(hdr)))) {
1138 tipc_link_advance_backlog(l, xmitq);
1139 if (unlikely(!skb_queue_empty(&l->wakeupq)))
1140 link_prepare_wakeup(l);
1143 /* Defer delivery if sequence gap */
1144 if (unlikely(seqno != rcv_nxt)) {
1145 __tipc_skb_queue_sorted(defq, seqno, skb);
1146 tipc_link_build_nack_msg(l, xmitq);
1150 /* Deliver packet */
1152 l->stats.recv_info++;
1153 if (!tipc_data_input(l, skb, l->inputq))
1154 rc = tipc_link_input(l, skb, l->inputq);
1157 if (unlikely(++l->rcv_unacked >= TIPC_MIN_LINK_WIN))
1158 tipc_link_build_ack_msg(l, xmitq);
1160 } while ((skb = __skb_dequeue(defq)));
1169 * tipc_link_defer_pkt - Add out-of-sequence message to deferred reception queue
1171 * Returns increase in queue length (i.e. 0 or 1)
1173 u32 tipc_link_defer_pkt(struct sk_buff_head *list, struct sk_buff *skb)
1175 struct sk_buff *skb1;
1176 u16 seq_no = buf_seqno(skb);
1179 if (skb_queue_empty(list)) {
1180 __skb_queue_tail(list, skb);
1185 if (less(buf_seqno(skb_peek_tail(list)), seq_no)) {
1186 __skb_queue_tail(list, skb);
1190 /* Locate insertion point in queue, then insert; discard if duplicate */
1191 skb_queue_walk(list, skb1) {
1192 u16 curr_seqno = buf_seqno(skb1);
1194 if (seq_no == curr_seqno) {
1199 if (less(seq_no, curr_seqno))
1203 __skb_queue_before(list, skb1, skb);
1208 * Send protocol message to the other endpoint.
1210 void tipc_link_proto_xmit(struct tipc_link *l, u32 msg_typ, int probe_msg,
1211 u32 gap, u32 tolerance, u32 priority)
1213 struct sk_buff *skb = NULL;
1214 struct sk_buff_head xmitq;
1216 __skb_queue_head_init(&xmitq);
1217 tipc_link_build_proto_msg(l, msg_typ, probe_msg, gap,
1218 tolerance, priority, &xmitq);
1219 skb = __skb_dequeue(&xmitq);
1222 tipc_bearer_send(l->owner->net, l->bearer_id, skb, l->media_addr);
1227 /* tipc_link_build_proto_msg: prepare link protocol message for transmission
1229 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe,
1230 u16 rcvgap, int tolerance, int priority,
1231 struct sk_buff_head *xmitq)
1233 struct sk_buff *skb = NULL;
1234 struct tipc_msg *hdr = l->pmsg;
1235 u16 snd_nxt = l->snd_nxt;
1236 u16 rcv_nxt = l->rcv_nxt;
1237 u16 rcv_last = rcv_nxt - 1;
1238 int node_up = l->owner->bclink.recv_permitted;
1240 /* Don't send protocol message during reset or link failover */
1241 if (tipc_link_is_blocked(l))
1244 msg_set_type(hdr, mtyp);
1245 msg_set_net_plane(hdr, l->net_plane);
1246 msg_set_bcast_ack(hdr, l->owner->bclink.last_in);
1247 msg_set_last_bcast(hdr, tipc_bclink_get_last_sent(l->owner->net));
1248 msg_set_link_tolerance(hdr, tolerance);
1249 msg_set_linkprio(hdr, priority);
1250 msg_set_redundant_link(hdr, node_up);
1251 msg_set_seq_gap(hdr, 0);
1253 /* Compatibility: created msg must not be in sequence with pkt flow */
1254 msg_set_seqno(hdr, snd_nxt + U16_MAX / 2);
1256 if (mtyp == STATE_MSG) {
1257 if (!tipc_link_is_up(l))
1259 msg_set_next_sent(hdr, snd_nxt);
1261 /* Override rcvgap if there are packets in deferred queue */
1262 if (!skb_queue_empty(&l->deferdq))
1263 rcvgap = buf_seqno(skb_peek(&l->deferdq)) - rcv_nxt;
1265 msg_set_seq_gap(hdr, rcvgap);
1266 l->stats.sent_nacks++;
1268 msg_set_ack(hdr, rcv_last);
1269 msg_set_probe(hdr, probe);
1271 l->stats.sent_probes++;
1272 l->stats.sent_states++;
1274 /* RESET_MSG or ACTIVATE_MSG */
1275 msg_set_max_pkt(hdr, l->advertised_mtu);
1276 msg_set_ack(hdr, l->rcv_nxt - 1);
1277 msg_set_next_sent(hdr, 1);
1279 skb = tipc_buf_acquire(msg_size(hdr));
1282 skb_copy_to_linear_data(skb, hdr, msg_size(hdr));
1283 skb->priority = TC_PRIO_CONTROL;
1284 __skb_queue_tail(xmitq, skb);
1287 /* tipc_link_tnl_prepare(): prepare and return a list of tunnel packets
1288 * with contents of the link's transmit and backlog queues.
1290 void tipc_link_tnl_prepare(struct tipc_link *l, struct tipc_link *tnl,
1291 int mtyp, struct sk_buff_head *xmitq)
1293 struct sk_buff *skb, *tnlskb;
1294 struct tipc_msg *hdr, tnlhdr;
1295 struct sk_buff_head *queue = &l->transmq;
1296 struct sk_buff_head tmpxq, tnlq;
1297 u16 pktlen, pktcnt, seqno = l->snd_nxt;
1302 skb_queue_head_init(&tnlq);
1303 skb_queue_head_init(&tmpxq);
1305 /* At least one packet required for safe algorithm => add dummy */
1306 skb = tipc_msg_create(TIPC_LOW_IMPORTANCE, TIPC_DIRECT_MSG,
1307 BASIC_H_SIZE, 0, l->addr, link_own_addr(l),
1308 0, 0, TIPC_ERR_NO_PORT);
1310 pr_warn("%sunable to create tunnel packet\n", link_co_err);
1313 skb_queue_tail(&tnlq, skb);
1314 tipc_link_xmit(l, &tnlq, &tmpxq);
1315 __skb_queue_purge(&tmpxq);
1317 /* Initialize reusable tunnel packet header */
1318 tipc_msg_init(link_own_addr(l), &tnlhdr, TUNNEL_PROTOCOL,
1319 mtyp, INT_H_SIZE, l->addr);
1320 pktcnt = skb_queue_len(&l->transmq) + skb_queue_len(&l->backlogq);
1321 msg_set_msgcnt(&tnlhdr, pktcnt);
1322 msg_set_bearer_id(&tnlhdr, l->peer_bearer_id);
1324 /* Wrap each packet into a tunnel packet */
1325 skb_queue_walk(queue, skb) {
1327 if (queue == &l->backlogq)
1328 msg_set_seqno(hdr, seqno++);
1329 pktlen = msg_size(hdr);
1330 msg_set_size(&tnlhdr, pktlen + INT_H_SIZE);
1331 tnlskb = tipc_buf_acquire(pktlen + INT_H_SIZE);
1333 pr_warn("%sunable to send packet\n", link_co_err);
1336 skb_copy_to_linear_data(tnlskb, &tnlhdr, INT_H_SIZE);
1337 skb_copy_to_linear_data_offset(tnlskb, INT_H_SIZE, hdr, pktlen);
1338 __skb_queue_tail(&tnlq, tnlskb);
1340 if (queue != &l->backlogq) {
1341 queue = &l->backlogq;
1345 tipc_link_xmit(tnl, &tnlq, xmitq);
1347 if (mtyp == FAILOVER_MSG) {
1348 tnl->drop_point = l->rcv_nxt;
1349 tnl->failover_reasm_skb = l->reasm_buf;
1350 l->reasm_buf = NULL;
1354 /* tipc_link_proto_rcv(): receive link level protocol message :
1355 * Note that network plane id propagates through the network, and may
1356 * change at any time. The node with lowest numerical id determines
1359 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb,
1360 struct sk_buff_head *xmitq)
1362 struct tipc_msg *hdr = buf_msg(skb);
1364 u16 nacked_gap = msg_seq_gap(hdr);
1365 u16 peers_snd_nxt = msg_next_sent(hdr);
1366 u16 peers_tol = msg_link_tolerance(hdr);
1367 u16 peers_prio = msg_linkprio(hdr);
1368 u16 rcv_nxt = l->rcv_nxt;
1369 int mtyp = msg_type(hdr);
1373 if (tipc_link_is_blocked(l))
1376 if (link_own_addr(l) > msg_prevnode(hdr))
1377 l->net_plane = msg_net_plane(hdr);
1382 /* Ignore duplicate RESET with old session number */
1383 if ((less_eq(msg_session(hdr), l->peer_session)) &&
1384 (l->peer_session != WILDCARD_SESSION))
1390 /* Complete own link name with peer's interface name */
1391 if_name = strrchr(l->name, ':') + 1;
1392 if (sizeof(l->name) - (if_name - l->name) <= TIPC_MAX_IF_NAME)
1394 if (msg_data_sz(hdr) < TIPC_MAX_IF_NAME)
1396 strncpy(if_name, msg_data(hdr), TIPC_MAX_IF_NAME);
1398 /* Update own tolerance if peer indicates a non-zero value */
1399 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL))
1400 l->tolerance = peers_tol;
1402 /* Update own priority if peer's priority is higher */
1403 if (in_range(peers_prio, l->priority + 1, TIPC_MAX_LINK_PRI))
1404 l->priority = peers_prio;
1406 /* ACTIVATE_MSG serves as PEER_RESET if link is already down */
1407 if ((mtyp == RESET_MSG) || !link_is_up(l))
1408 rc = tipc_link_fsm_evt(l, LINK_PEER_RESET_EVT);
1410 /* ACTIVATE_MSG takes up link if it was already locally reset */
1411 if ((mtyp == ACTIVATE_MSG) && (l->state == LINK_ESTABLISHING))
1412 rc = TIPC_LINK_UP_EVT;
1414 l->peer_session = msg_session(hdr);
1415 l->peer_bearer_id = msg_bearer_id(hdr);
1416 if (l->mtu > msg_max_pkt(hdr))
1417 l->mtu = msg_max_pkt(hdr);
1422 /* Update own tolerance if peer indicates a non-zero value */
1423 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL))
1424 l->tolerance = peers_tol;
1426 l->silent_intv_cnt = 0;
1427 l->stats.recv_states++;
1429 l->stats.recv_probes++;
1431 if (!link_is_up(l)) {
1432 if (l->state == LINK_ESTABLISHING)
1433 rc = TIPC_LINK_UP_EVT;
1437 /* Send NACK if peer has sent pkts we haven't received yet */
1438 if (more(peers_snd_nxt, rcv_nxt) && !tipc_link_is_synching(l))
1439 rcvgap = peers_snd_nxt - l->rcv_nxt;
1440 if (rcvgap || (msg_probe(hdr)))
1441 tipc_link_build_proto_msg(l, STATE_MSG, 0, rcvgap,
1443 tipc_link_release_pkts(l, msg_ack(hdr));
1445 /* If NACK, retransmit will now start at right position */
1447 rc = tipc_link_retransm(l, nacked_gap, xmitq);
1448 l->stats.recv_nacks++;
1451 tipc_link_advance_backlog(l, xmitq);
1452 if (unlikely(!skb_queue_empty(&l->wakeupq)))
1453 link_prepare_wakeup(l);
1460 void tipc_link_set_queue_limits(struct tipc_link *l, u32 win)
1462 int max_bulk = TIPC_MAX_PUBLICATIONS / (l->mtu / ITEM_SIZE);
1465 l->backlog[TIPC_LOW_IMPORTANCE].limit = win / 2;
1466 l->backlog[TIPC_MEDIUM_IMPORTANCE].limit = win;
1467 l->backlog[TIPC_HIGH_IMPORTANCE].limit = win / 2 * 3;
1468 l->backlog[TIPC_CRITICAL_IMPORTANCE].limit = win * 2;
1469 l->backlog[TIPC_SYSTEM_IMPORTANCE].limit = max_bulk;
1472 /* tipc_link_find_owner - locate owner node of link by link's name
1473 * @net: the applicable net namespace
1474 * @name: pointer to link name string
1475 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1477 * Returns pointer to node owning the link, or 0 if no matching link is found.
1479 static struct tipc_node *tipc_link_find_owner(struct net *net,
1480 const char *link_name,
1481 unsigned int *bearer_id)
1483 struct tipc_net *tn = net_generic(net, tipc_net_id);
1484 struct tipc_link *l_ptr;
1485 struct tipc_node *n_ptr;
1486 struct tipc_node *found_node = NULL;
1491 list_for_each_entry_rcu(n_ptr, &tn->node_list, list) {
1492 tipc_node_lock(n_ptr);
1493 for (i = 0; i < MAX_BEARERS; i++) {
1494 l_ptr = n_ptr->links[i].link;
1495 if (l_ptr && !strcmp(l_ptr->name, link_name)) {
1501 tipc_node_unlock(n_ptr);
1511 * link_reset_statistics - reset link statistics
1512 * @l_ptr: pointer to link
1514 static void link_reset_statistics(struct tipc_link *l_ptr)
1516 memset(&l_ptr->stats, 0, sizeof(l_ptr->stats));
1517 l_ptr->stats.sent_info = l_ptr->snd_nxt;
1518 l_ptr->stats.recv_info = l_ptr->rcv_nxt;
1521 static void link_print(struct tipc_link *l, const char *str)
1523 struct sk_buff *hskb = skb_peek(&l->transmq);
1524 u16 head = hskb ? msg_seqno(buf_msg(hskb)) : l->snd_nxt;
1525 u16 tail = l->snd_nxt - 1;
1527 pr_info("%s Link <%s> state %x\n", str, l->name, l->state);
1528 pr_info("XMTQ: %u [%u-%u], BKLGQ: %u, SNDNX: %u, RCVNX: %u\n",
1529 skb_queue_len(&l->transmq), head, tail,
1530 skb_queue_len(&l->backlogq), l->snd_nxt, l->rcv_nxt);
1533 /* Parse and validate nested (link) properties valid for media, bearer and link
1535 int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[])
1539 err = nla_parse_nested(props, TIPC_NLA_PROP_MAX, prop,
1540 tipc_nl_prop_policy);
1544 if (props[TIPC_NLA_PROP_PRIO]) {
1547 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
1548 if (prio > TIPC_MAX_LINK_PRI)
1552 if (props[TIPC_NLA_PROP_TOL]) {
1555 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
1556 if ((tol < TIPC_MIN_LINK_TOL) || (tol > TIPC_MAX_LINK_TOL))
1560 if (props[TIPC_NLA_PROP_WIN]) {
1563 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
1564 if ((win < TIPC_MIN_LINK_WIN) || (win > TIPC_MAX_LINK_WIN))
1571 int tipc_nl_link_set(struct sk_buff *skb, struct genl_info *info)
1577 struct tipc_link *link;
1578 struct tipc_node *node;
1579 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1580 struct net *net = sock_net(skb->sk);
1582 if (!info->attrs[TIPC_NLA_LINK])
1585 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1586 info->attrs[TIPC_NLA_LINK],
1587 tipc_nl_link_policy);
1591 if (!attrs[TIPC_NLA_LINK_NAME])
1594 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1596 if (strcmp(name, tipc_bclink_name) == 0)
1597 return tipc_nl_bc_link_set(net, attrs);
1599 node = tipc_link_find_owner(net, name, &bearer_id);
1603 tipc_node_lock(node);
1605 link = node->links[bearer_id].link;
1611 if (attrs[TIPC_NLA_LINK_PROP]) {
1612 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
1614 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
1621 if (props[TIPC_NLA_PROP_TOL]) {
1624 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
1625 link->tolerance = tol;
1626 tipc_link_proto_xmit(link, STATE_MSG, 0, 0, tol, 0);
1628 if (props[TIPC_NLA_PROP_PRIO]) {
1631 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
1632 link->priority = prio;
1633 tipc_link_proto_xmit(link, STATE_MSG, 0, 0, 0, prio);
1635 if (props[TIPC_NLA_PROP_WIN]) {
1638 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
1639 tipc_link_set_queue_limits(link, win);
1644 tipc_node_unlock(node);
1649 static int __tipc_nl_add_stats(struct sk_buff *skb, struct tipc_stats *s)
1652 struct nlattr *stats;
1659 struct nla_map map[] = {
1660 {TIPC_NLA_STATS_RX_INFO, s->recv_info},
1661 {TIPC_NLA_STATS_RX_FRAGMENTS, s->recv_fragments},
1662 {TIPC_NLA_STATS_RX_FRAGMENTED, s->recv_fragmented},
1663 {TIPC_NLA_STATS_RX_BUNDLES, s->recv_bundles},
1664 {TIPC_NLA_STATS_RX_BUNDLED, s->recv_bundled},
1665 {TIPC_NLA_STATS_TX_INFO, s->sent_info},
1666 {TIPC_NLA_STATS_TX_FRAGMENTS, s->sent_fragments},
1667 {TIPC_NLA_STATS_TX_FRAGMENTED, s->sent_fragmented},
1668 {TIPC_NLA_STATS_TX_BUNDLES, s->sent_bundles},
1669 {TIPC_NLA_STATS_TX_BUNDLED, s->sent_bundled},
1670 {TIPC_NLA_STATS_MSG_PROF_TOT, (s->msg_length_counts) ?
1671 s->msg_length_counts : 1},
1672 {TIPC_NLA_STATS_MSG_LEN_CNT, s->msg_length_counts},
1673 {TIPC_NLA_STATS_MSG_LEN_TOT, s->msg_lengths_total},
1674 {TIPC_NLA_STATS_MSG_LEN_P0, s->msg_length_profile[0]},
1675 {TIPC_NLA_STATS_MSG_LEN_P1, s->msg_length_profile[1]},
1676 {TIPC_NLA_STATS_MSG_LEN_P2, s->msg_length_profile[2]},
1677 {TIPC_NLA_STATS_MSG_LEN_P3, s->msg_length_profile[3]},
1678 {TIPC_NLA_STATS_MSG_LEN_P4, s->msg_length_profile[4]},
1679 {TIPC_NLA_STATS_MSG_LEN_P5, s->msg_length_profile[5]},
1680 {TIPC_NLA_STATS_MSG_LEN_P6, s->msg_length_profile[6]},
1681 {TIPC_NLA_STATS_RX_STATES, s->recv_states},
1682 {TIPC_NLA_STATS_RX_PROBES, s->recv_probes},
1683 {TIPC_NLA_STATS_RX_NACKS, s->recv_nacks},
1684 {TIPC_NLA_STATS_RX_DEFERRED, s->deferred_recv},
1685 {TIPC_NLA_STATS_TX_STATES, s->sent_states},
1686 {TIPC_NLA_STATS_TX_PROBES, s->sent_probes},
1687 {TIPC_NLA_STATS_TX_NACKS, s->sent_nacks},
1688 {TIPC_NLA_STATS_TX_ACKS, s->sent_acks},
1689 {TIPC_NLA_STATS_RETRANSMITTED, s->retransmitted},
1690 {TIPC_NLA_STATS_DUPLICATES, s->duplicates},
1691 {TIPC_NLA_STATS_LINK_CONGS, s->link_congs},
1692 {TIPC_NLA_STATS_MAX_QUEUE, s->max_queue_sz},
1693 {TIPC_NLA_STATS_AVG_QUEUE, s->queue_sz_counts ?
1694 (s->accu_queue_sz / s->queue_sz_counts) : 0}
1697 stats = nla_nest_start(skb, TIPC_NLA_LINK_STATS);
1701 for (i = 0; i < ARRAY_SIZE(map); i++)
1702 if (nla_put_u32(skb, map[i].key, map[i].val))
1705 nla_nest_end(skb, stats);
1709 nla_nest_cancel(skb, stats);
1714 /* Caller should hold appropriate locks to protect the link */
1715 static int __tipc_nl_add_link(struct net *net, struct tipc_nl_msg *msg,
1716 struct tipc_link *link, int nlflags)
1720 struct nlattr *attrs;
1721 struct nlattr *prop;
1722 struct tipc_net *tn = net_generic(net, tipc_net_id);
1724 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1725 nlflags, TIPC_NL_LINK_GET);
1729 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK);
1733 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, link->name))
1735 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_DEST,
1736 tipc_cluster_mask(tn->own_addr)))
1738 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_MTU, link->mtu))
1740 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, link->rcv_nxt))
1742 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, link->snd_nxt))
1745 if (tipc_link_is_up(link))
1746 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
1748 if (tipc_link_is_active(link))
1749 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_ACTIVE))
1752 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP);
1755 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
1757 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_TOL, link->tolerance))
1759 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN,
1762 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
1764 nla_nest_end(msg->skb, prop);
1766 err = __tipc_nl_add_stats(msg->skb, &link->stats);
1770 nla_nest_end(msg->skb, attrs);
1771 genlmsg_end(msg->skb, hdr);
1776 nla_nest_cancel(msg->skb, prop);
1778 nla_nest_cancel(msg->skb, attrs);
1780 genlmsg_cancel(msg->skb, hdr);
1785 /* Caller should hold node lock */
1786 static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
1787 struct tipc_node *node, u32 *prev_link)
1792 for (i = *prev_link; i < MAX_BEARERS; i++) {
1795 if (!node->links[i].link)
1798 err = __tipc_nl_add_link(net, msg,
1799 node->links[i].link, NLM_F_MULTI);
1808 int tipc_nl_link_dump(struct sk_buff *skb, struct netlink_callback *cb)
1810 struct net *net = sock_net(skb->sk);
1811 struct tipc_net *tn = net_generic(net, tipc_net_id);
1812 struct tipc_node *node;
1813 struct tipc_nl_msg msg;
1814 u32 prev_node = cb->args[0];
1815 u32 prev_link = cb->args[1];
1816 int done = cb->args[2];
1823 msg.portid = NETLINK_CB(cb->skb).portid;
1824 msg.seq = cb->nlh->nlmsg_seq;
1828 node = tipc_node_find(net, prev_node);
1830 /* We never set seq or call nl_dump_check_consistent()
1831 * this means that setting prev_seq here will cause the
1832 * consistence check to fail in the netlink callback
1833 * handler. Resulting in the last NLMSG_DONE message
1834 * having the NLM_F_DUMP_INTR flag set.
1839 tipc_node_put(node);
1841 list_for_each_entry_continue_rcu(node, &tn->node_list,
1843 tipc_node_lock(node);
1844 err = __tipc_nl_add_node_links(net, &msg, node,
1846 tipc_node_unlock(node);
1850 prev_node = node->addr;
1853 err = tipc_nl_add_bc_link(net, &msg);
1857 list_for_each_entry_rcu(node, &tn->node_list, list) {
1858 tipc_node_lock(node);
1859 err = __tipc_nl_add_node_links(net, &msg, node,
1861 tipc_node_unlock(node);
1865 prev_node = node->addr;
1872 cb->args[0] = prev_node;
1873 cb->args[1] = prev_link;
1879 int tipc_nl_link_get(struct sk_buff *skb, struct genl_info *info)
1881 struct net *net = genl_info_net(info);
1882 struct tipc_nl_msg msg;
1886 msg.portid = info->snd_portid;
1887 msg.seq = info->snd_seq;
1889 if (!info->attrs[TIPC_NLA_LINK_NAME])
1891 name = nla_data(info->attrs[TIPC_NLA_LINK_NAME]);
1893 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
1897 if (strcmp(name, tipc_bclink_name) == 0) {
1898 err = tipc_nl_add_bc_link(net, &msg);
1900 nlmsg_free(msg.skb);
1905 struct tipc_node *node;
1906 struct tipc_link *link;
1908 node = tipc_link_find_owner(net, name, &bearer_id);
1912 tipc_node_lock(node);
1913 link = node->links[bearer_id].link;
1915 tipc_node_unlock(node);
1916 nlmsg_free(msg.skb);
1920 err = __tipc_nl_add_link(net, &msg, link, 0);
1921 tipc_node_unlock(node);
1923 nlmsg_free(msg.skb);
1928 return genlmsg_reply(msg.skb, info);
1931 int tipc_nl_link_reset_stats(struct sk_buff *skb, struct genl_info *info)
1935 unsigned int bearer_id;
1936 struct tipc_link *link;
1937 struct tipc_node *node;
1938 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1939 struct net *net = sock_net(skb->sk);
1941 if (!info->attrs[TIPC_NLA_LINK])
1944 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1945 info->attrs[TIPC_NLA_LINK],
1946 tipc_nl_link_policy);
1950 if (!attrs[TIPC_NLA_LINK_NAME])
1953 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1955 if (strcmp(link_name, tipc_bclink_name) == 0) {
1956 err = tipc_bclink_reset_stats(net);
1962 node = tipc_link_find_owner(net, link_name, &bearer_id);
1966 tipc_node_lock(node);
1968 link = node->links[bearer_id].link;
1970 tipc_node_unlock(node);
1974 link_reset_statistics(link);
1976 tipc_node_unlock(node);