2 * net/tipc/link.c: TIPC link code
4 * Copyright (c) 1996-2007, 2012-2014, 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.
41 #include "name_distr.h"
45 #include <linux/pkt_sched.h>
48 * Error message prefixes
50 static const char *link_co_err
= "Link changeover error, ";
51 static const char *link_rst_msg
= "Resetting link ";
52 static const char *link_unk_evt
= "Unknown link event ";
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 * Out-of-range value for link session numbers
81 #define INVALID_SESSION 0x10000
86 #define STARTING_EVT 856384768 /* link processing trigger */
87 #define TRAFFIC_MSG_EVT 560815u /* rx'd ??? */
88 #define TIMEOUT_EVT 560817u /* link timer expired */
91 * The following two 'message types' is really just implementation
92 * data conveniently stored in the message header.
93 * They must not be considered part of the protocol
99 * State value stored in 'exp_msg_count'
101 #define START_CHANGEOVER 100000u
103 static void link_handle_out_of_seq_msg(struct tipc_link
*link
,
104 struct sk_buff
*skb
);
105 static void tipc_link_proto_rcv(struct tipc_link
*link
,
106 struct sk_buff
*skb
);
107 static int tipc_link_tunnel_rcv(struct tipc_node
*node
,
108 struct sk_buff
**skb
);
109 static void link_set_supervision_props(struct tipc_link
*l_ptr
, u32 tol
);
110 static void link_state_event(struct tipc_link
*l_ptr
, u32 event
);
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_xmit(struct tipc_link
*l
);
114 static void tipc_link_sync_rcv(struct tipc_node
*n
, struct sk_buff
*buf
);
115 static void tipc_link_input(struct tipc_link
*l
, struct sk_buff
*skb
);
116 static bool tipc_data_input(struct tipc_link
*l
, struct sk_buff
*skb
);
119 * Simple link routines
121 static unsigned int align(unsigned int i
)
123 return (i
+ 3) & ~3u;
126 static void tipc_link_release(struct kref
*kref
)
128 kfree(container_of(kref
, struct tipc_link
, ref
));
131 static void tipc_link_get(struct tipc_link
*l_ptr
)
133 kref_get(&l_ptr
->ref
);
136 static void tipc_link_put(struct tipc_link
*l_ptr
)
138 kref_put(&l_ptr
->ref
, tipc_link_release
);
141 static void link_init_max_pkt(struct tipc_link
*l_ptr
)
143 struct tipc_node
*node
= l_ptr
->owner
;
144 struct tipc_net
*tn
= net_generic(node
->net
, tipc_net_id
);
145 struct tipc_bearer
*b_ptr
;
149 b_ptr
= rcu_dereference_rtnl(tn
->bearer_list
[l_ptr
->bearer_id
]);
154 max_pkt
= (b_ptr
->mtu
& ~3);
157 if (max_pkt
> MAX_MSG_SIZE
)
158 max_pkt
= MAX_MSG_SIZE
;
160 l_ptr
->max_pkt_target
= max_pkt
;
161 if (l_ptr
->max_pkt_target
< MAX_PKT_DEFAULT
)
162 l_ptr
->max_pkt
= l_ptr
->max_pkt_target
;
164 l_ptr
->max_pkt
= MAX_PKT_DEFAULT
;
166 l_ptr
->max_pkt_probes
= 0;
170 * Simple non-static link routines (i.e. referenced outside this file)
172 int tipc_link_is_up(struct tipc_link
*l_ptr
)
176 return link_working_working(l_ptr
) || link_working_unknown(l_ptr
);
179 int tipc_link_is_active(struct tipc_link
*l_ptr
)
181 return (l_ptr
->owner
->active_links
[0] == l_ptr
) ||
182 (l_ptr
->owner
->active_links
[1] == l_ptr
);
186 * link_timeout - handle expiration of link timer
187 * @l_ptr: pointer to link
189 static void link_timeout(unsigned long data
)
191 struct tipc_link
*l_ptr
= (struct tipc_link
*)data
;
194 tipc_node_lock(l_ptr
->owner
);
196 /* update counters used in statistical profiling of send traffic */
197 l_ptr
->stats
.accu_queue_sz
+= skb_queue_len(&l_ptr
->outqueue
);
198 l_ptr
->stats
.queue_sz_counts
++;
200 skb
= skb_peek(&l_ptr
->outqueue
);
202 struct tipc_msg
*msg
= buf_msg(skb
);
203 u32 length
= msg_size(msg
);
205 if ((msg_user(msg
) == MSG_FRAGMENTER
) &&
206 (msg_type(msg
) == FIRST_FRAGMENT
)) {
207 length
= msg_size(msg_get_wrapped(msg
));
210 l_ptr
->stats
.msg_lengths_total
+= length
;
211 l_ptr
->stats
.msg_length_counts
++;
213 l_ptr
->stats
.msg_length_profile
[0]++;
214 else if (length
<= 256)
215 l_ptr
->stats
.msg_length_profile
[1]++;
216 else if (length
<= 1024)
217 l_ptr
->stats
.msg_length_profile
[2]++;
218 else if (length
<= 4096)
219 l_ptr
->stats
.msg_length_profile
[3]++;
220 else if (length
<= 16384)
221 l_ptr
->stats
.msg_length_profile
[4]++;
222 else if (length
<= 32768)
223 l_ptr
->stats
.msg_length_profile
[5]++;
225 l_ptr
->stats
.msg_length_profile
[6]++;
229 /* do all other link processing performed on a periodic basis */
230 link_state_event(l_ptr
, TIMEOUT_EVT
);
233 tipc_link_push_packets(l_ptr
);
235 tipc_node_unlock(l_ptr
->owner
);
236 tipc_link_put(l_ptr
);
239 static void link_set_timer(struct tipc_link
*link
, unsigned long time
)
241 if (!mod_timer(&link
->timer
, jiffies
+ time
))
246 * tipc_link_create - create a new link
247 * @n_ptr: pointer to associated node
248 * @b_ptr: pointer to associated bearer
249 * @media_addr: media address to use when sending messages over link
251 * Returns pointer to link.
253 struct tipc_link
*tipc_link_create(struct tipc_node
*n_ptr
,
254 struct tipc_bearer
*b_ptr
,
255 const struct tipc_media_addr
*media_addr
)
257 struct tipc_net
*tn
= net_generic(n_ptr
->net
, tipc_net_id
);
258 struct tipc_link
*l_ptr
;
259 struct tipc_msg
*msg
;
261 char addr_string
[16];
262 u32 peer
= n_ptr
->addr
;
264 if (n_ptr
->link_cnt
>= MAX_BEARERS
) {
265 tipc_addr_string_fill(addr_string
, n_ptr
->addr
);
266 pr_err("Attempt to establish %uth link to %s. Max %u allowed.\n",
267 n_ptr
->link_cnt
, addr_string
, MAX_BEARERS
);
271 if (n_ptr
->links
[b_ptr
->identity
]) {
272 tipc_addr_string_fill(addr_string
, n_ptr
->addr
);
273 pr_err("Attempt to establish second link on <%s> to %s\n",
274 b_ptr
->name
, addr_string
);
278 l_ptr
= kzalloc(sizeof(*l_ptr
), GFP_ATOMIC
);
280 pr_warn("Link creation failed, no memory\n");
283 kref_init(&l_ptr
->ref
);
285 if_name
= strchr(b_ptr
->name
, ':') + 1;
286 sprintf(l_ptr
->name
, "%u.%u.%u:%s-%u.%u.%u:unknown",
287 tipc_zone(tn
->own_addr
), tipc_cluster(tn
->own_addr
),
288 tipc_node(tn
->own_addr
),
290 tipc_zone(peer
), tipc_cluster(peer
), tipc_node(peer
));
291 /* note: peer i/f name is updated by reset/activate message */
292 memcpy(&l_ptr
->media_addr
, media_addr
, sizeof(*media_addr
));
293 l_ptr
->owner
= n_ptr
;
294 l_ptr
->checkpoint
= 1;
295 l_ptr
->peer_session
= INVALID_SESSION
;
296 l_ptr
->bearer_id
= b_ptr
->identity
;
297 link_set_supervision_props(l_ptr
, b_ptr
->tolerance
);
298 l_ptr
->state
= RESET_UNKNOWN
;
300 l_ptr
->pmsg
= (struct tipc_msg
*)&l_ptr
->proto_msg
;
302 tipc_msg_init(tn
->own_addr
, msg
, LINK_PROTOCOL
, RESET_MSG
, INT_H_SIZE
,
304 msg_set_size(msg
, sizeof(l_ptr
->proto_msg
));
305 msg_set_session(msg
, (tn
->random
& 0xffff));
306 msg_set_bearer_id(msg
, b_ptr
->identity
);
307 strcpy((char *)msg_data(msg
), if_name
);
309 l_ptr
->priority
= b_ptr
->priority
;
310 tipc_link_set_queue_limits(l_ptr
, b_ptr
->window
);
312 l_ptr
->net_plane
= b_ptr
->net_plane
;
313 link_init_max_pkt(l_ptr
);
315 l_ptr
->next_out_no
= 1;
316 __skb_queue_head_init(&l_ptr
->outqueue
);
317 __skb_queue_head_init(&l_ptr
->deferred_queue
);
318 skb_queue_head_init(&l_ptr
->wakeupq
);
319 skb_queue_head_init(&l_ptr
->inputq
);
320 skb_queue_head_init(&l_ptr
->namedq
);
321 link_reset_statistics(l_ptr
);
322 tipc_node_attach_link(n_ptr
, l_ptr
);
323 setup_timer(&l_ptr
->timer
, link_timeout
, (unsigned long)l_ptr
);
324 link_state_event(l_ptr
, STARTING_EVT
);
330 * link_delete - Conditional deletion of link.
331 * If timer still running, real delete is done when it expires
332 * @link: link to be deleted
334 void tipc_link_delete(struct tipc_link
*link
)
336 tipc_link_reset_fragments(link
);
337 tipc_node_detach_link(link
->owner
, link
);
341 void tipc_link_delete_list(struct net
*net
, unsigned int bearer_id
,
344 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
345 struct tipc_link
*link
;
346 struct tipc_node
*node
;
349 list_for_each_entry_rcu(node
, &tn
->node_list
, list
) {
350 tipc_node_lock(node
);
351 link
= node
->links
[bearer_id
];
353 tipc_node_unlock(node
);
356 tipc_link_reset(link
);
357 if (del_timer(&link
->timer
))
359 link
->flags
|= LINK_STOPPED
;
360 /* Delete link now, or when failover is finished: */
361 if (shutting_down
|| !tipc_node_is_up(node
))
362 tipc_link_delete(link
);
363 tipc_node_unlock(node
);
369 * link_schedule_user - schedule user for wakeup after congestion
370 * @link: congested link
371 * @oport: sending port
372 * @chain_sz: size of buffer chain that was attempted sent
373 * @imp: importance of message attempted sent
374 * Create pseudo msg to send back to user when congestion abates
376 static bool link_schedule_user(struct tipc_link
*link
, u32 oport
,
377 uint chain_sz
, uint imp
)
381 buf
= tipc_msg_create(SOCK_WAKEUP
, 0, INT_H_SIZE
, 0,
382 link_own_addr(link
), link_own_addr(link
),
386 TIPC_SKB_CB(buf
)->chain_sz
= chain_sz
;
387 TIPC_SKB_CB(buf
)->chain_imp
= imp
;
388 skb_queue_tail(&link
->wakeupq
, buf
);
389 link
->stats
.link_congs
++;
394 * link_prepare_wakeup - prepare users for wakeup after congestion
395 * @link: congested link
396 * Move a number of waiting users, as permitted by available space in
397 * the send queue, from link wait queue to node wait queue for wakeup
399 void link_prepare_wakeup(struct tipc_link
*link
)
401 uint pend_qsz
= skb_queue_len(&link
->outqueue
);
402 struct sk_buff
*skb
, *tmp
;
404 skb_queue_walk_safe(&link
->wakeupq
, skb
, tmp
) {
405 if (pend_qsz
>= link
->queue_limit
[TIPC_SKB_CB(skb
)->chain_imp
])
407 pend_qsz
+= TIPC_SKB_CB(skb
)->chain_sz
;
408 skb_unlink(skb
, &link
->wakeupq
);
409 skb_queue_tail(&link
->inputq
, skb
);
410 link
->owner
->inputq
= &link
->inputq
;
411 link
->owner
->action_flags
|= TIPC_MSG_EVT
;
416 * tipc_link_reset_fragments - purge link's inbound message fragments queue
417 * @l_ptr: pointer to link
419 void tipc_link_reset_fragments(struct tipc_link
*l_ptr
)
421 kfree_skb(l_ptr
->reasm_buf
);
422 l_ptr
->reasm_buf
= NULL
;
426 * tipc_link_purge_queues - purge all pkt queues associated with link
427 * @l_ptr: pointer to link
429 void tipc_link_purge_queues(struct tipc_link
*l_ptr
)
431 __skb_queue_purge(&l_ptr
->deferred_queue
);
432 __skb_queue_purge(&l_ptr
->outqueue
);
433 tipc_link_reset_fragments(l_ptr
);
436 void tipc_link_reset(struct tipc_link
*l_ptr
)
438 u32 prev_state
= l_ptr
->state
;
439 u32 checkpoint
= l_ptr
->next_in_no
;
440 int was_active_link
= tipc_link_is_active(l_ptr
);
441 struct tipc_node
*owner
= l_ptr
->owner
;
443 msg_set_session(l_ptr
->pmsg
, ((msg_session(l_ptr
->pmsg
) + 1) & 0xffff));
445 /* Link is down, accept any session */
446 l_ptr
->peer_session
= INVALID_SESSION
;
448 /* Prepare for max packet size negotiation */
449 link_init_max_pkt(l_ptr
);
451 l_ptr
->state
= RESET_UNKNOWN
;
453 if ((prev_state
== RESET_UNKNOWN
) || (prev_state
== RESET_RESET
))
456 tipc_node_link_down(l_ptr
->owner
, l_ptr
);
457 tipc_bearer_remove_dest(owner
->net
, l_ptr
->bearer_id
, l_ptr
->addr
);
459 if (was_active_link
&& tipc_node_active_links(l_ptr
->owner
)) {
460 l_ptr
->reset_checkpoint
= checkpoint
;
461 l_ptr
->exp_msg_count
= START_CHANGEOVER
;
464 /* Clean up all queues, except inputq: */
465 __skb_queue_purge(&l_ptr
->outqueue
);
466 __skb_queue_purge(&l_ptr
->deferred_queue
);
467 skb_queue_splice_init(&l_ptr
->wakeupq
, &l_ptr
->inputq
);
468 if (!skb_queue_empty(&l_ptr
->inputq
))
469 owner
->action_flags
|= TIPC_MSG_EVT
;
470 owner
->inputq
= &l_ptr
->inputq
;
471 l_ptr
->next_out
= NULL
;
472 l_ptr
->unacked_window
= 0;
473 l_ptr
->checkpoint
= 1;
474 l_ptr
->next_out_no
= 1;
475 l_ptr
->fsm_msg_cnt
= 0;
476 l_ptr
->stale_count
= 0;
477 link_reset_statistics(l_ptr
);
480 void tipc_link_reset_list(struct net
*net
, unsigned int bearer_id
)
482 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
483 struct tipc_link
*l_ptr
;
484 struct tipc_node
*n_ptr
;
487 list_for_each_entry_rcu(n_ptr
, &tn
->node_list
, list
) {
488 tipc_node_lock(n_ptr
);
489 l_ptr
= n_ptr
->links
[bearer_id
];
491 tipc_link_reset(l_ptr
);
492 tipc_node_unlock(n_ptr
);
497 static void link_activate(struct tipc_link
*link
)
499 struct tipc_node
*node
= link
->owner
;
501 link
->next_in_no
= 1;
502 link
->stats
.recv_info
= 1;
503 tipc_node_link_up(node
, link
);
504 tipc_bearer_add_dest(node
->net
, link
->bearer_id
, link
->addr
);
508 * link_state_event - link finite state machine
509 * @l_ptr: pointer to link
510 * @event: state machine event to process
512 static void link_state_event(struct tipc_link
*l_ptr
, unsigned int event
)
514 struct tipc_link
*other
;
515 unsigned long cont_intv
= l_ptr
->cont_intv
;
517 if (l_ptr
->flags
& LINK_STOPPED
)
520 if (!(l_ptr
->flags
& LINK_STARTED
) && (event
!= STARTING_EVT
))
521 return; /* Not yet. */
523 /* Check whether changeover is going on */
524 if (l_ptr
->exp_msg_count
) {
525 if (event
== TIMEOUT_EVT
)
526 link_set_timer(l_ptr
, cont_intv
);
530 switch (l_ptr
->state
) {
531 case WORKING_WORKING
:
533 case TRAFFIC_MSG_EVT
:
537 if (l_ptr
->next_in_no
!= l_ptr
->checkpoint
) {
538 l_ptr
->checkpoint
= l_ptr
->next_in_no
;
539 if (tipc_bclink_acks_missing(l_ptr
->owner
)) {
540 tipc_link_proto_xmit(l_ptr
, STATE_MSG
,
542 l_ptr
->fsm_msg_cnt
++;
543 } else if (l_ptr
->max_pkt
< l_ptr
->max_pkt_target
) {
544 tipc_link_proto_xmit(l_ptr
, STATE_MSG
,
546 l_ptr
->fsm_msg_cnt
++;
548 link_set_timer(l_ptr
, cont_intv
);
551 l_ptr
->state
= WORKING_UNKNOWN
;
552 l_ptr
->fsm_msg_cnt
= 0;
553 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 1, 0, 0, 0, 0);
554 l_ptr
->fsm_msg_cnt
++;
555 link_set_timer(l_ptr
, cont_intv
/ 4);
558 pr_debug("%s<%s>, requested by peer\n",
559 link_rst_msg
, l_ptr
->name
);
560 tipc_link_reset(l_ptr
);
561 l_ptr
->state
= RESET_RESET
;
562 l_ptr
->fsm_msg_cnt
= 0;
563 tipc_link_proto_xmit(l_ptr
, ACTIVATE_MSG
,
565 l_ptr
->fsm_msg_cnt
++;
566 link_set_timer(l_ptr
, cont_intv
);
569 pr_debug("%s%u in WW state\n", link_unk_evt
, event
);
572 case WORKING_UNKNOWN
:
574 case TRAFFIC_MSG_EVT
:
576 l_ptr
->state
= WORKING_WORKING
;
577 l_ptr
->fsm_msg_cnt
= 0;
578 link_set_timer(l_ptr
, cont_intv
);
581 pr_debug("%s<%s>, requested by peer while probing\n",
582 link_rst_msg
, l_ptr
->name
);
583 tipc_link_reset(l_ptr
);
584 l_ptr
->state
= RESET_RESET
;
585 l_ptr
->fsm_msg_cnt
= 0;
586 tipc_link_proto_xmit(l_ptr
, ACTIVATE_MSG
,
588 l_ptr
->fsm_msg_cnt
++;
589 link_set_timer(l_ptr
, cont_intv
);
592 if (l_ptr
->next_in_no
!= l_ptr
->checkpoint
) {
593 l_ptr
->state
= WORKING_WORKING
;
594 l_ptr
->fsm_msg_cnt
= 0;
595 l_ptr
->checkpoint
= l_ptr
->next_in_no
;
596 if (tipc_bclink_acks_missing(l_ptr
->owner
)) {
597 tipc_link_proto_xmit(l_ptr
, STATE_MSG
,
599 l_ptr
->fsm_msg_cnt
++;
601 link_set_timer(l_ptr
, cont_intv
);
602 } else if (l_ptr
->fsm_msg_cnt
< l_ptr
->abort_limit
) {
603 tipc_link_proto_xmit(l_ptr
, STATE_MSG
,
605 l_ptr
->fsm_msg_cnt
++;
606 link_set_timer(l_ptr
, cont_intv
/ 4);
607 } else { /* Link has failed */
608 pr_debug("%s<%s>, peer not responding\n",
609 link_rst_msg
, l_ptr
->name
);
610 tipc_link_reset(l_ptr
);
611 l_ptr
->state
= RESET_UNKNOWN
;
612 l_ptr
->fsm_msg_cnt
= 0;
613 tipc_link_proto_xmit(l_ptr
, RESET_MSG
,
615 l_ptr
->fsm_msg_cnt
++;
616 link_set_timer(l_ptr
, cont_intv
);
620 pr_err("%s%u in WU state\n", link_unk_evt
, event
);
625 case TRAFFIC_MSG_EVT
:
628 other
= l_ptr
->owner
->active_links
[0];
629 if (other
&& link_working_unknown(other
))
631 l_ptr
->state
= WORKING_WORKING
;
632 l_ptr
->fsm_msg_cnt
= 0;
633 link_activate(l_ptr
);
634 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 1, 0, 0, 0, 0);
635 l_ptr
->fsm_msg_cnt
++;
636 if (l_ptr
->owner
->working_links
== 1)
637 tipc_link_sync_xmit(l_ptr
);
638 link_set_timer(l_ptr
, cont_intv
);
641 l_ptr
->state
= RESET_RESET
;
642 l_ptr
->fsm_msg_cnt
= 0;
643 tipc_link_proto_xmit(l_ptr
, ACTIVATE_MSG
,
645 l_ptr
->fsm_msg_cnt
++;
646 link_set_timer(l_ptr
, cont_intv
);
649 l_ptr
->flags
|= LINK_STARTED
;
650 l_ptr
->fsm_msg_cnt
++;
651 link_set_timer(l_ptr
, cont_intv
);
654 tipc_link_proto_xmit(l_ptr
, RESET_MSG
, 0, 0, 0, 0, 0);
655 l_ptr
->fsm_msg_cnt
++;
656 link_set_timer(l_ptr
, cont_intv
);
659 pr_err("%s%u in RU state\n", link_unk_evt
, event
);
664 case TRAFFIC_MSG_EVT
:
666 other
= l_ptr
->owner
->active_links
[0];
667 if (other
&& link_working_unknown(other
))
669 l_ptr
->state
= WORKING_WORKING
;
670 l_ptr
->fsm_msg_cnt
= 0;
671 link_activate(l_ptr
);
672 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 1, 0, 0, 0, 0);
673 l_ptr
->fsm_msg_cnt
++;
674 if (l_ptr
->owner
->working_links
== 1)
675 tipc_link_sync_xmit(l_ptr
);
676 link_set_timer(l_ptr
, cont_intv
);
681 tipc_link_proto_xmit(l_ptr
, ACTIVATE_MSG
,
683 l_ptr
->fsm_msg_cnt
++;
684 link_set_timer(l_ptr
, cont_intv
);
687 pr_err("%s%u in RR state\n", link_unk_evt
, event
);
691 pr_err("Unknown link state %u/%u\n", l_ptr
->state
, event
);
695 /* tipc_link_cong: determine return value and how to treat the
696 * sent buffer during link congestion.
697 * - For plain, errorless user data messages we keep the buffer and
699 * - For all other messages we discard the buffer and return -EHOSTUNREACH
700 * - For TIPC internal messages we also reset the link
702 static int tipc_link_cong(struct tipc_link
*link
, struct sk_buff_head
*list
)
704 struct sk_buff
*skb
= skb_peek(list
);
705 struct tipc_msg
*msg
= buf_msg(skb
);
706 uint imp
= tipc_msg_tot_importance(msg
);
707 u32 oport
= msg_tot_origport(msg
);
709 if (unlikely(imp
> TIPC_CRITICAL_IMPORTANCE
)) {
710 pr_warn("%s<%s>, send queue full", link_rst_msg
, link
->name
);
711 tipc_link_reset(link
);
714 if (unlikely(msg_errcode(msg
)))
716 if (unlikely(msg_reroute_cnt(msg
)))
718 if (TIPC_SKB_CB(skb
)->wakeup_pending
)
720 if (link_schedule_user(link
, oport
, skb_queue_len(list
), imp
))
723 __skb_queue_purge(list
);
724 return -EHOSTUNREACH
;
728 * __tipc_link_xmit(): same as tipc_link_xmit, but destlink is known & locked
730 * @list: chain of buffers containing message
732 * Consumes the buffer chain, except when returning -ELINKCONG
733 * Returns 0 if success, otherwise errno: -ELINKCONG, -EMSGSIZE (plain socket
734 * user data messages) or -EHOSTUNREACH (all other messages/senders)
735 * Only the socket functions tipc_send_stream() and tipc_send_packet() need
736 * to act on the return value, since they may need to do more send attempts.
738 int __tipc_link_xmit(struct net
*net
, struct tipc_link
*link
,
739 struct sk_buff_head
*list
)
741 struct tipc_msg
*msg
= buf_msg(skb_peek(list
));
742 uint psz
= msg_size(msg
);
743 uint sndlim
= link
->queue_limit
[0];
744 uint imp
= tipc_msg_tot_importance(msg
);
745 uint mtu
= link
->max_pkt
;
746 uint ack
= mod(link
->next_in_no
- 1);
747 uint seqno
= link
->next_out_no
;
748 uint bc_last_in
= link
->owner
->bclink
.last_in
;
749 struct tipc_media_addr
*addr
= &link
->media_addr
;
750 struct sk_buff_head
*outqueue
= &link
->outqueue
;
751 struct sk_buff
*skb
, *tmp
;
753 /* Match queue limits against msg importance: */
754 if (unlikely(skb_queue_len(outqueue
) >= link
->queue_limit
[imp
]))
755 return tipc_link_cong(link
, list
);
757 /* Has valid packet limit been used ? */
758 if (unlikely(psz
> mtu
)) {
759 __skb_queue_purge(list
);
763 /* Prepare each packet for sending, and add to outqueue: */
764 skb_queue_walk_safe(list
, skb
, tmp
) {
765 __skb_unlink(skb
, list
);
767 msg_set_word(msg
, 2, ((ack
<< 16) | mod(seqno
)));
768 msg_set_bcast_ack(msg
, bc_last_in
);
770 if (skb_queue_len(outqueue
) < sndlim
) {
771 __skb_queue_tail(outqueue
, skb
);
772 tipc_bearer_send(net
, link
->bearer_id
,
774 link
->next_out
= NULL
;
775 link
->unacked_window
= 0;
776 } else if (tipc_msg_bundle(outqueue
, skb
, mtu
)) {
777 link
->stats
.sent_bundled
++;
779 } else if (tipc_msg_make_bundle(outqueue
, skb
, mtu
,
781 link
->stats
.sent_bundled
++;
782 link
->stats
.sent_bundles
++;
784 link
->next_out
= skb_peek_tail(outqueue
);
786 __skb_queue_tail(outqueue
, skb
);
788 link
->next_out
= skb
;
792 link
->next_out_no
= seqno
;
796 static void skb2list(struct sk_buff
*skb
, struct sk_buff_head
*list
)
798 skb_queue_head_init(list
);
799 __skb_queue_tail(list
, skb
);
802 static int __tipc_link_xmit_skb(struct tipc_link
*link
, struct sk_buff
*skb
)
804 struct sk_buff_head head
;
806 skb2list(skb
, &head
);
807 return __tipc_link_xmit(link
->owner
->net
, link
, &head
);
810 int tipc_link_xmit_skb(struct net
*net
, struct sk_buff
*skb
, u32 dnode
,
813 struct sk_buff_head head
;
815 skb2list(skb
, &head
);
816 return tipc_link_xmit(net
, &head
, dnode
, selector
);
820 * tipc_link_xmit() is the general link level function for message sending
821 * @net: the applicable net namespace
822 * @list: chain of buffers containing message
823 * @dsz: amount of user data to be sent
824 * @dnode: address of destination node
825 * @selector: a number used for deterministic link selection
826 * Consumes the buffer chain, except when returning -ELINKCONG
827 * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE
829 int tipc_link_xmit(struct net
*net
, struct sk_buff_head
*list
, u32 dnode
,
832 struct tipc_link
*link
= NULL
;
833 struct tipc_node
*node
;
834 int rc
= -EHOSTUNREACH
;
836 node
= tipc_node_find(net
, dnode
);
838 tipc_node_lock(node
);
839 link
= node
->active_links
[selector
& 1];
841 rc
= __tipc_link_xmit(net
, link
, list
);
842 tipc_node_unlock(node
);
847 if (likely(in_own_node(net
, dnode
)))
848 return tipc_sk_rcv(net
, list
);
850 __skb_queue_purge(list
);
855 * tipc_link_sync_xmit - synchronize broadcast link endpoints.
857 * Give a newly added peer node the sequence number where it should
858 * start receiving and acking broadcast packets.
860 * Called with node locked
862 static void tipc_link_sync_xmit(struct tipc_link
*link
)
865 struct tipc_msg
*msg
;
867 skb
= tipc_buf_acquire(INT_H_SIZE
);
872 tipc_msg_init(link_own_addr(link
), msg
, BCAST_PROTOCOL
, STATE_MSG
,
873 INT_H_SIZE
, link
->addr
);
874 msg_set_last_bcast(msg
, link
->owner
->bclink
.acked
);
875 __tipc_link_xmit_skb(link
, skb
);
879 * tipc_link_sync_rcv - synchronize broadcast link endpoints.
880 * Receive the sequence number where we should start receiving and
881 * acking broadcast packets from a newly added peer node, and open
882 * up for reception of such packets.
884 * Called with node locked
886 static void tipc_link_sync_rcv(struct tipc_node
*n
, struct sk_buff
*buf
)
888 struct tipc_msg
*msg
= buf_msg(buf
);
890 n
->bclink
.last_sent
= n
->bclink
.last_in
= msg_last_bcast(msg
);
891 n
->bclink
.recv_permitted
= true;
895 struct sk_buff
*tipc_skb_queue_next(const struct sk_buff_head
*list
,
896 const struct sk_buff
*skb
)
898 if (skb_queue_is_last(list
, skb
))
904 * tipc_link_push_packets - push unsent packets to bearer
906 * Push out the unsent messages of a link where congestion
907 * has abated. Node is locked.
909 * Called with node locked
911 void tipc_link_push_packets(struct tipc_link
*l_ptr
)
913 struct sk_buff_head
*outqueue
= &l_ptr
->outqueue
;
914 struct sk_buff
*skb
= l_ptr
->next_out
;
915 struct tipc_msg
*msg
;
918 skb_queue_walk_from(outqueue
, skb
) {
920 next
= msg_seqno(msg
);
921 first
= buf_seqno(skb_peek(outqueue
));
923 if (mod(next
- first
) < l_ptr
->queue_limit
[0]) {
924 msg_set_ack(msg
, mod(l_ptr
->next_in_no
- 1));
925 msg_set_bcast_ack(msg
, l_ptr
->owner
->bclink
.last_in
);
926 if (msg_user(msg
) == MSG_BUNDLER
)
927 TIPC_SKB_CB(skb
)->bundling
= false;
928 tipc_bearer_send(l_ptr
->owner
->net
,
929 l_ptr
->bearer_id
, skb
,
931 l_ptr
->next_out
= tipc_skb_queue_next(outqueue
, skb
);
938 void tipc_link_reset_all(struct tipc_node
*node
)
940 char addr_string
[16];
943 tipc_node_lock(node
);
945 pr_warn("Resetting all links to %s\n",
946 tipc_addr_string_fill(addr_string
, node
->addr
));
948 for (i
= 0; i
< MAX_BEARERS
; i
++) {
949 if (node
->links
[i
]) {
950 link_print(node
->links
[i
], "Resetting link\n");
951 tipc_link_reset(node
->links
[i
]);
955 tipc_node_unlock(node
);
958 static void link_retransmit_failure(struct tipc_link
*l_ptr
,
961 struct tipc_msg
*msg
= buf_msg(buf
);
962 struct net
*net
= l_ptr
->owner
->net
;
964 pr_warn("Retransmission failure on link <%s>\n", l_ptr
->name
);
967 /* Handle failure on standard link */
968 link_print(l_ptr
, "Resetting link\n");
969 tipc_link_reset(l_ptr
);
972 /* Handle failure on broadcast link */
973 struct tipc_node
*n_ptr
;
974 char addr_string
[16];
976 pr_info("Msg seq number: %u, ", msg_seqno(msg
));
977 pr_cont("Outstanding acks: %lu\n",
978 (unsigned long) TIPC_SKB_CB(buf
)->handle
);
980 n_ptr
= tipc_bclink_retransmit_to(net
);
981 tipc_node_lock(n_ptr
);
983 tipc_addr_string_fill(addr_string
, n_ptr
->addr
);
984 pr_info("Broadcast link info for %s\n", addr_string
);
985 pr_info("Reception permitted: %d, Acked: %u\n",
986 n_ptr
->bclink
.recv_permitted
,
987 n_ptr
->bclink
.acked
);
988 pr_info("Last in: %u, Oos state: %u, Last sent: %u\n",
989 n_ptr
->bclink
.last_in
,
990 n_ptr
->bclink
.oos_state
,
991 n_ptr
->bclink
.last_sent
);
993 tipc_node_unlock(n_ptr
);
995 tipc_bclink_set_flags(net
, TIPC_BCLINK_RESET
);
996 l_ptr
->stale_count
= 0;
1000 void tipc_link_retransmit(struct tipc_link
*l_ptr
, struct sk_buff
*skb
,
1003 struct tipc_msg
*msg
;
1010 /* Detect repeated retransmit failures */
1011 if (l_ptr
->last_retransmitted
== msg_seqno(msg
)) {
1012 if (++l_ptr
->stale_count
> 100) {
1013 link_retransmit_failure(l_ptr
, skb
);
1017 l_ptr
->last_retransmitted
= msg_seqno(msg
);
1018 l_ptr
->stale_count
= 1;
1021 skb_queue_walk_from(&l_ptr
->outqueue
, skb
) {
1022 if (!retransmits
|| skb
== l_ptr
->next_out
)
1025 msg_set_ack(msg
, mod(l_ptr
->next_in_no
- 1));
1026 msg_set_bcast_ack(msg
, l_ptr
->owner
->bclink
.last_in
);
1027 tipc_bearer_send(l_ptr
->owner
->net
, l_ptr
->bearer_id
, skb
,
1028 &l_ptr
->media_addr
);
1030 l_ptr
->stats
.retransmitted
++;
1034 static void link_retrieve_defq(struct tipc_link
*link
,
1035 struct sk_buff_head
*list
)
1039 if (skb_queue_empty(&link
->deferred_queue
))
1042 seq_no
= buf_seqno(skb_peek(&link
->deferred_queue
));
1043 if (seq_no
== mod(link
->next_in_no
))
1044 skb_queue_splice_tail_init(&link
->deferred_queue
, list
);
1048 * link_recv_buf_validate - validate basic format of received message
1050 * This routine ensures a TIPC message has an acceptable header, and at least
1051 * as much data as the header indicates it should. The routine also ensures
1052 * that the entire message header is stored in the main fragment of the message
1053 * buffer, to simplify future access to message header fields.
1055 * Note: Having extra info present in the message header or data areas is OK.
1056 * TIPC will ignore the excess, under the assumption that it is optional info
1057 * introduced by a later release of the protocol.
1059 static int link_recv_buf_validate(struct sk_buff
*buf
)
1061 static u32 min_data_hdr_size
[8] = {
1062 SHORT_H_SIZE
, MCAST_H_SIZE
, NAMED_H_SIZE
, BASIC_H_SIZE
,
1063 MAX_H_SIZE
, MAX_H_SIZE
, MAX_H_SIZE
, MAX_H_SIZE
1066 struct tipc_msg
*msg
;
1072 /* If this packet comes from the defer queue, the skb has already
1075 if (unlikely(TIPC_SKB_CB(buf
)->deferred
))
1078 if (unlikely(buf
->len
< MIN_H_SIZE
))
1081 msg
= skb_header_pointer(buf
, 0, sizeof(tipc_hdr
), tipc_hdr
);
1085 if (unlikely(msg_version(msg
) != TIPC_VERSION
))
1088 size
= msg_size(msg
);
1089 hdr_size
= msg_hdr_sz(msg
);
1090 min_hdr_size
= msg_isdata(msg
) ?
1091 min_data_hdr_size
[msg_type(msg
)] : INT_H_SIZE
;
1093 if (unlikely((hdr_size
< min_hdr_size
) ||
1094 (size
< hdr_size
) ||
1095 (buf
->len
< size
) ||
1096 (size
- hdr_size
> TIPC_MAX_USER_MSG_SIZE
)))
1099 return pskb_may_pull(buf
, hdr_size
);
1103 * tipc_rcv - process TIPC packets/messages arriving from off-node
1104 * @net: the applicable net namespace
1106 * @b_ptr: pointer to bearer message arrived on
1108 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1109 * structure (i.e. cannot be NULL), but bearer can be inactive.
1111 void tipc_rcv(struct net
*net
, struct sk_buff
*skb
, struct tipc_bearer
*b_ptr
)
1113 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
1114 struct sk_buff_head head
;
1115 struct tipc_node
*n_ptr
;
1116 struct tipc_link
*l_ptr
;
1117 struct sk_buff
*skb1
, *tmp
;
1118 struct tipc_msg
*msg
;
1123 skb2list(skb
, &head
);
1125 while ((skb
= __skb_dequeue(&head
))) {
1126 /* Ensure message is well-formed */
1127 if (unlikely(!link_recv_buf_validate(skb
)))
1130 /* Ensure message data is a single contiguous unit */
1131 if (unlikely(skb_linearize(skb
)))
1134 /* Handle arrival of a non-unicast link message */
1137 if (unlikely(msg_non_seq(msg
))) {
1138 if (msg_user(msg
) == LINK_CONFIG
)
1139 tipc_disc_rcv(net
, skb
, b_ptr
);
1141 tipc_bclink_rcv(net
, skb
);
1145 /* Discard unicast link messages destined for another node */
1146 if (unlikely(!msg_short(msg
) &&
1147 (msg_destnode(msg
) != tn
->own_addr
)))
1150 /* Locate neighboring node that sent message */
1151 n_ptr
= tipc_node_find(net
, msg_prevnode(msg
));
1152 if (unlikely(!n_ptr
))
1154 tipc_node_lock(n_ptr
);
1156 /* Locate unicast link endpoint that should handle message */
1157 l_ptr
= n_ptr
->links
[b_ptr
->identity
];
1158 if (unlikely(!l_ptr
))
1161 /* Verify that communication with node is currently allowed */
1162 if ((n_ptr
->action_flags
& TIPC_WAIT_PEER_LINKS_DOWN
) &&
1163 msg_user(msg
) == LINK_PROTOCOL
&&
1164 (msg_type(msg
) == RESET_MSG
||
1165 msg_type(msg
) == ACTIVATE_MSG
) &&
1166 !msg_redundant_link(msg
))
1167 n_ptr
->action_flags
&= ~TIPC_WAIT_PEER_LINKS_DOWN
;
1169 if (tipc_node_blocked(n_ptr
))
1172 /* Validate message sequence number info */
1173 seq_no
= msg_seqno(msg
);
1174 ackd
= msg_ack(msg
);
1176 /* Release acked messages */
1177 if (n_ptr
->bclink
.recv_permitted
)
1178 tipc_bclink_acknowledge(n_ptr
, msg_bcast_ack(msg
));
1181 skb_queue_walk_safe(&l_ptr
->outqueue
, skb1
, tmp
) {
1182 if (skb1
== l_ptr
->next_out
||
1183 more(buf_seqno(skb1
), ackd
))
1185 __skb_unlink(skb1
, &l_ptr
->outqueue
);
1190 /* Try sending any messages link endpoint has pending */
1191 if (unlikely(l_ptr
->next_out
))
1192 tipc_link_push_packets(l_ptr
);
1194 if (released
&& !skb_queue_empty(&l_ptr
->wakeupq
))
1195 link_prepare_wakeup(l_ptr
);
1197 /* Process the incoming packet */
1198 if (unlikely(!link_working_working(l_ptr
))) {
1199 if (msg_user(msg
) == LINK_PROTOCOL
) {
1200 tipc_link_proto_rcv(l_ptr
, skb
);
1201 link_retrieve_defq(l_ptr
, &head
);
1206 /* Traffic message. Conditionally activate link */
1207 link_state_event(l_ptr
, TRAFFIC_MSG_EVT
);
1209 if (link_working_working(l_ptr
)) {
1210 /* Re-insert buffer in front of queue */
1211 __skb_queue_head(&head
, skb
);
1218 /* Link is now in state WORKING_WORKING */
1219 if (unlikely(seq_no
!= mod(l_ptr
->next_in_no
))) {
1220 link_handle_out_of_seq_msg(l_ptr
, skb
);
1221 link_retrieve_defq(l_ptr
, &head
);
1225 l_ptr
->next_in_no
++;
1226 if (unlikely(!skb_queue_empty(&l_ptr
->deferred_queue
)))
1227 link_retrieve_defq(l_ptr
, &head
);
1229 if (unlikely(++l_ptr
->unacked_window
>= TIPC_MIN_LINK_WIN
)) {
1230 l_ptr
->stats
.sent_acks
++;
1231 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 0, 0, 0, 0, 0);
1233 tipc_link_input(l_ptr
, skb
);
1236 tipc_node_unlock(n_ptr
);
1243 /* tipc_data_input - deliver data and name distr msgs to upper layer
1245 * Consumes buffer if message is of right type
1246 * Node lock must be held
1248 static bool tipc_data_input(struct tipc_link
*link
, struct sk_buff
*skb
)
1250 struct tipc_node
*node
= link
->owner
;
1251 struct tipc_msg
*msg
= buf_msg(skb
);
1252 u32 dport
= msg_destport(msg
);
1254 switch (msg_user(msg
)) {
1255 case TIPC_LOW_IMPORTANCE
:
1256 case TIPC_MEDIUM_IMPORTANCE
:
1257 case TIPC_HIGH_IMPORTANCE
:
1258 case TIPC_CRITICAL_IMPORTANCE
:
1260 if (tipc_skb_queue_tail(&link
->inputq
, skb
, dport
)) {
1261 node
->inputq
= &link
->inputq
;
1262 node
->action_flags
|= TIPC_MSG_EVT
;
1265 case NAME_DISTRIBUTOR
:
1266 node
->bclink
.recv_permitted
= true;
1267 node
->namedq
= &link
->namedq
;
1268 skb_queue_tail(&link
->namedq
, skb
);
1269 if (skb_queue_len(&link
->namedq
) == 1)
1270 node
->action_flags
|= TIPC_NAMED_MSG_EVT
;
1273 case CHANGEOVER_PROTOCOL
:
1274 case MSG_FRAGMENTER
:
1275 case BCAST_PROTOCOL
:
1278 pr_warn("Dropping received illegal msg type\n");
1284 /* tipc_link_input - process packet that has passed link protocol check
1287 * Node lock must be held
1289 static void tipc_link_input(struct tipc_link
*link
, struct sk_buff
*skb
)
1291 struct tipc_node
*node
= link
->owner
;
1292 struct tipc_msg
*msg
= buf_msg(skb
);
1293 struct sk_buff
*iskb
;
1296 if (likely(tipc_data_input(link
, skb
)))
1299 switch (msg_user(msg
)) {
1300 case CHANGEOVER_PROTOCOL
:
1301 if (!tipc_link_tunnel_rcv(node
, &skb
))
1303 if (msg_user(buf_msg(skb
)) != MSG_BUNDLER
) {
1304 tipc_data_input(link
, skb
);
1308 link
->stats
.recv_bundles
++;
1309 link
->stats
.recv_bundled
+= msg_msgcnt(msg
);
1311 while (tipc_msg_extract(skb
, &iskb
, &pos
))
1312 tipc_data_input(link
, iskb
);
1314 case MSG_FRAGMENTER
:
1315 link
->stats
.recv_fragments
++;
1316 if (tipc_buf_append(&link
->reasm_buf
, &skb
)) {
1317 link
->stats
.recv_fragmented
++;
1318 tipc_data_input(link
, skb
);
1319 } else if (!link
->reasm_buf
) {
1320 tipc_link_reset(link
);
1323 case BCAST_PROTOCOL
:
1324 tipc_link_sync_rcv(node
, skb
);
1332 * tipc_link_defer_pkt - Add out-of-sequence message to deferred reception queue
1334 * Returns increase in queue length (i.e. 0 or 1)
1336 u32
tipc_link_defer_pkt(struct sk_buff_head
*list
, struct sk_buff
*skb
)
1338 struct sk_buff
*skb1
;
1339 u32 seq_no
= buf_seqno(skb
);
1342 if (skb_queue_empty(list
)) {
1343 __skb_queue_tail(list
, skb
);
1348 if (less(buf_seqno(skb_peek_tail(list
)), seq_no
)) {
1349 __skb_queue_tail(list
, skb
);
1353 /* Locate insertion point in queue, then insert; discard if duplicate */
1354 skb_queue_walk(list
, skb1
) {
1355 u32 curr_seqno
= buf_seqno(skb1
);
1357 if (seq_no
== curr_seqno
) {
1362 if (less(seq_no
, curr_seqno
))
1366 __skb_queue_before(list
, skb1
, skb
);
1371 * link_handle_out_of_seq_msg - handle arrival of out-of-sequence packet
1373 static void link_handle_out_of_seq_msg(struct tipc_link
*l_ptr
,
1374 struct sk_buff
*buf
)
1376 u32 seq_no
= buf_seqno(buf
);
1378 if (likely(msg_user(buf_msg(buf
)) == LINK_PROTOCOL
)) {
1379 tipc_link_proto_rcv(l_ptr
, buf
);
1383 /* Record OOS packet arrival (force mismatch on next timeout) */
1384 l_ptr
->checkpoint
--;
1387 * Discard packet if a duplicate; otherwise add it to deferred queue
1388 * and notify peer of gap as per protocol specification
1390 if (less(seq_no
, mod(l_ptr
->next_in_no
))) {
1391 l_ptr
->stats
.duplicates
++;
1396 if (tipc_link_defer_pkt(&l_ptr
->deferred_queue
, buf
)) {
1397 l_ptr
->stats
.deferred_recv
++;
1398 TIPC_SKB_CB(buf
)->deferred
= true;
1399 if ((skb_queue_len(&l_ptr
->deferred_queue
) % 16) == 1)
1400 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 0, 0, 0, 0, 0);
1402 l_ptr
->stats
.duplicates
++;
1407 * Send protocol message to the other endpoint.
1409 void tipc_link_proto_xmit(struct tipc_link
*l_ptr
, u32 msg_typ
, int probe_msg
,
1410 u32 gap
, u32 tolerance
, u32 priority
, u32 ack_mtu
)
1412 struct sk_buff
*buf
= NULL
;
1413 struct tipc_msg
*msg
= l_ptr
->pmsg
;
1414 u32 msg_size
= sizeof(l_ptr
->proto_msg
);
1417 /* Don't send protocol message during link changeover */
1418 if (l_ptr
->exp_msg_count
)
1421 /* Abort non-RESET send if communication with node is prohibited */
1422 if ((tipc_node_blocked(l_ptr
->owner
)) && (msg_typ
!= RESET_MSG
))
1425 /* Create protocol message with "out-of-sequence" sequence number */
1426 msg_set_type(msg
, msg_typ
);
1427 msg_set_net_plane(msg
, l_ptr
->net_plane
);
1428 msg_set_bcast_ack(msg
, l_ptr
->owner
->bclink
.last_in
);
1429 msg_set_last_bcast(msg
, tipc_bclink_get_last_sent(l_ptr
->owner
->net
));
1431 if (msg_typ
== STATE_MSG
) {
1432 u32 next_sent
= mod(l_ptr
->next_out_no
);
1434 if (!tipc_link_is_up(l_ptr
))
1436 if (l_ptr
->next_out
)
1437 next_sent
= buf_seqno(l_ptr
->next_out
);
1438 msg_set_next_sent(msg
, next_sent
);
1439 if (!skb_queue_empty(&l_ptr
->deferred_queue
)) {
1440 u32 rec
= buf_seqno(skb_peek(&l_ptr
->deferred_queue
));
1441 gap
= mod(rec
- mod(l_ptr
->next_in_no
));
1443 msg_set_seq_gap(msg
, gap
);
1445 l_ptr
->stats
.sent_nacks
++;
1446 msg_set_link_tolerance(msg
, tolerance
);
1447 msg_set_linkprio(msg
, priority
);
1448 msg_set_max_pkt(msg
, ack_mtu
);
1449 msg_set_ack(msg
, mod(l_ptr
->next_in_no
- 1));
1450 msg_set_probe(msg
, probe_msg
!= 0);
1452 u32 mtu
= l_ptr
->max_pkt
;
1454 if ((mtu
< l_ptr
->max_pkt_target
) &&
1455 link_working_working(l_ptr
) &&
1456 l_ptr
->fsm_msg_cnt
) {
1457 msg_size
= (mtu
+ (l_ptr
->max_pkt_target
- mtu
)/2 + 2) & ~3;
1458 if (l_ptr
->max_pkt_probes
== 10) {
1459 l_ptr
->max_pkt_target
= (msg_size
- 4);
1460 l_ptr
->max_pkt_probes
= 0;
1461 msg_size
= (mtu
+ (l_ptr
->max_pkt_target
- mtu
)/2 + 2) & ~3;
1463 l_ptr
->max_pkt_probes
++;
1466 l_ptr
->stats
.sent_probes
++;
1468 l_ptr
->stats
.sent_states
++;
1469 } else { /* RESET_MSG or ACTIVATE_MSG */
1470 msg_set_ack(msg
, mod(l_ptr
->reset_checkpoint
- 1));
1471 msg_set_seq_gap(msg
, 0);
1472 msg_set_next_sent(msg
, 1);
1473 msg_set_probe(msg
, 0);
1474 msg_set_link_tolerance(msg
, l_ptr
->tolerance
);
1475 msg_set_linkprio(msg
, l_ptr
->priority
);
1476 msg_set_max_pkt(msg
, l_ptr
->max_pkt_target
);
1479 r_flag
= (l_ptr
->owner
->working_links
> tipc_link_is_up(l_ptr
));
1480 msg_set_redundant_link(msg
, r_flag
);
1481 msg_set_linkprio(msg
, l_ptr
->priority
);
1482 msg_set_size(msg
, msg_size
);
1484 msg_set_seqno(msg
, mod(l_ptr
->next_out_no
+ (0xffff/2)));
1486 buf
= tipc_buf_acquire(msg_size
);
1490 skb_copy_to_linear_data(buf
, msg
, sizeof(l_ptr
->proto_msg
));
1491 buf
->priority
= TC_PRIO_CONTROL
;
1493 tipc_bearer_send(l_ptr
->owner
->net
, l_ptr
->bearer_id
, buf
,
1494 &l_ptr
->media_addr
);
1495 l_ptr
->unacked_window
= 0;
1500 * Receive protocol message :
1501 * Note that network plane id propagates through the network, and may
1502 * change at any time. The node with lowest address rules
1504 static void tipc_link_proto_rcv(struct tipc_link
*l_ptr
,
1505 struct sk_buff
*buf
)
1511 struct tipc_msg
*msg
= buf_msg(buf
);
1513 /* Discard protocol message during link changeover */
1514 if (l_ptr
->exp_msg_count
)
1517 if (l_ptr
->net_plane
!= msg_net_plane(msg
))
1518 if (link_own_addr(l_ptr
) > msg_prevnode(msg
))
1519 l_ptr
->net_plane
= msg_net_plane(msg
);
1521 switch (msg_type(msg
)) {
1524 if (!link_working_unknown(l_ptr
) &&
1525 (l_ptr
->peer_session
!= INVALID_SESSION
)) {
1526 if (less_eq(msg_session(msg
), l_ptr
->peer_session
))
1527 break; /* duplicate or old reset: ignore */
1530 if (!msg_redundant_link(msg
) && (link_working_working(l_ptr
) ||
1531 link_working_unknown(l_ptr
))) {
1533 * peer has lost contact -- don't allow peer's links
1534 * to reactivate before we recognize loss & clean up
1536 l_ptr
->owner
->action_flags
|= TIPC_WAIT_OWN_LINKS_DOWN
;
1539 link_state_event(l_ptr
, RESET_MSG
);
1543 /* Update link settings according other endpoint's values */
1544 strcpy((strrchr(l_ptr
->name
, ':') + 1), (char *)msg_data(msg
));
1546 msg_tol
= msg_link_tolerance(msg
);
1547 if (msg_tol
> l_ptr
->tolerance
)
1548 link_set_supervision_props(l_ptr
, msg_tol
);
1550 if (msg_linkprio(msg
) > l_ptr
->priority
)
1551 l_ptr
->priority
= msg_linkprio(msg
);
1553 max_pkt_info
= msg_max_pkt(msg
);
1555 if (max_pkt_info
< l_ptr
->max_pkt_target
)
1556 l_ptr
->max_pkt_target
= max_pkt_info
;
1557 if (l_ptr
->max_pkt
> l_ptr
->max_pkt_target
)
1558 l_ptr
->max_pkt
= l_ptr
->max_pkt_target
;
1560 l_ptr
->max_pkt
= l_ptr
->max_pkt_target
;
1563 /* Synchronize broadcast link info, if not done previously */
1564 if (!tipc_node_is_up(l_ptr
->owner
)) {
1565 l_ptr
->owner
->bclink
.last_sent
=
1566 l_ptr
->owner
->bclink
.last_in
=
1567 msg_last_bcast(msg
);
1568 l_ptr
->owner
->bclink
.oos_state
= 0;
1571 l_ptr
->peer_session
= msg_session(msg
);
1572 l_ptr
->peer_bearer_id
= msg_bearer_id(msg
);
1574 if (msg_type(msg
) == ACTIVATE_MSG
)
1575 link_state_event(l_ptr
, ACTIVATE_MSG
);
1579 msg_tol
= msg_link_tolerance(msg
);
1581 link_set_supervision_props(l_ptr
, msg_tol
);
1583 if (msg_linkprio(msg
) &&
1584 (msg_linkprio(msg
) != l_ptr
->priority
)) {
1585 pr_debug("%s<%s>, priority change %u->%u\n",
1586 link_rst_msg
, l_ptr
->name
,
1587 l_ptr
->priority
, msg_linkprio(msg
));
1588 l_ptr
->priority
= msg_linkprio(msg
);
1589 tipc_link_reset(l_ptr
); /* Enforce change to take effect */
1593 /* Record reception; force mismatch at next timeout: */
1594 l_ptr
->checkpoint
--;
1596 link_state_event(l_ptr
, TRAFFIC_MSG_EVT
);
1597 l_ptr
->stats
.recv_states
++;
1598 if (link_reset_unknown(l_ptr
))
1601 if (less_eq(mod(l_ptr
->next_in_no
), msg_next_sent(msg
))) {
1602 rec_gap
= mod(msg_next_sent(msg
) -
1603 mod(l_ptr
->next_in_no
));
1606 max_pkt_ack
= msg_max_pkt(msg
);
1607 if (max_pkt_ack
> l_ptr
->max_pkt
) {
1608 l_ptr
->max_pkt
= max_pkt_ack
;
1609 l_ptr
->max_pkt_probes
= 0;
1613 if (msg_probe(msg
)) {
1614 l_ptr
->stats
.recv_probes
++;
1615 if (msg_size(msg
) > sizeof(l_ptr
->proto_msg
))
1616 max_pkt_ack
= msg_size(msg
);
1619 /* Protocol message before retransmits, reduce loss risk */
1620 if (l_ptr
->owner
->bclink
.recv_permitted
)
1621 tipc_bclink_update_link_state(l_ptr
->owner
,
1622 msg_last_bcast(msg
));
1624 if (rec_gap
|| (msg_probe(msg
))) {
1625 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 0, rec_gap
, 0,
1628 if (msg_seq_gap(msg
)) {
1629 l_ptr
->stats
.recv_nacks
++;
1630 tipc_link_retransmit(l_ptr
, skb_peek(&l_ptr
->outqueue
),
1640 /* tipc_link_tunnel_xmit(): Tunnel one packet via a link belonging to
1641 * a different bearer. Owner node is locked.
1643 static void tipc_link_tunnel_xmit(struct tipc_link
*l_ptr
,
1644 struct tipc_msg
*tunnel_hdr
,
1645 struct tipc_msg
*msg
,
1648 struct tipc_link
*tunnel
;
1649 struct sk_buff
*skb
;
1650 u32 length
= msg_size(msg
);
1652 tunnel
= l_ptr
->owner
->active_links
[selector
& 1];
1653 if (!tipc_link_is_up(tunnel
)) {
1654 pr_warn("%stunnel link no longer available\n", link_co_err
);
1657 msg_set_size(tunnel_hdr
, length
+ INT_H_SIZE
);
1658 skb
= tipc_buf_acquire(length
+ INT_H_SIZE
);
1660 pr_warn("%sunable to send tunnel msg\n", link_co_err
);
1663 skb_copy_to_linear_data(skb
, tunnel_hdr
, INT_H_SIZE
);
1664 skb_copy_to_linear_data_offset(skb
, INT_H_SIZE
, msg
, length
);
1665 __tipc_link_xmit_skb(tunnel
, skb
);
1669 /* tipc_link_failover_send_queue(): A link has gone down, but a second
1670 * link is still active. We can do failover. Tunnel the failing link's
1671 * whole send queue via the remaining link. This way, we don't lose
1672 * any packets, and sequence order is preserved for subsequent traffic
1673 * sent over the remaining link. Owner node is locked.
1675 void tipc_link_failover_send_queue(struct tipc_link
*l_ptr
)
1677 u32 msgcount
= skb_queue_len(&l_ptr
->outqueue
);
1678 struct tipc_link
*tunnel
= l_ptr
->owner
->active_links
[0];
1679 struct tipc_msg tunnel_hdr
;
1680 struct sk_buff
*skb
;
1686 tipc_msg_init(link_own_addr(l_ptr
), &tunnel_hdr
, CHANGEOVER_PROTOCOL
,
1687 ORIGINAL_MSG
, INT_H_SIZE
, l_ptr
->addr
);
1688 msg_set_bearer_id(&tunnel_hdr
, l_ptr
->peer_bearer_id
);
1689 msg_set_msgcnt(&tunnel_hdr
, msgcount
);
1691 if (skb_queue_empty(&l_ptr
->outqueue
)) {
1692 skb
= tipc_buf_acquire(INT_H_SIZE
);
1694 skb_copy_to_linear_data(skb
, &tunnel_hdr
, INT_H_SIZE
);
1695 msg_set_size(&tunnel_hdr
, INT_H_SIZE
);
1696 __tipc_link_xmit_skb(tunnel
, skb
);
1698 pr_warn("%sunable to send changeover msg\n",
1704 split_bundles
= (l_ptr
->owner
->active_links
[0] !=
1705 l_ptr
->owner
->active_links
[1]);
1707 skb_queue_walk(&l_ptr
->outqueue
, skb
) {
1708 struct tipc_msg
*msg
= buf_msg(skb
);
1710 if ((msg_user(msg
) == MSG_BUNDLER
) && split_bundles
) {
1711 struct tipc_msg
*m
= msg_get_wrapped(msg
);
1712 unchar
*pos
= (unchar
*)m
;
1714 msgcount
= msg_msgcnt(msg
);
1715 while (msgcount
--) {
1716 msg_set_seqno(m
, msg_seqno(msg
));
1717 tipc_link_tunnel_xmit(l_ptr
, &tunnel_hdr
, m
,
1718 msg_link_selector(m
));
1719 pos
+= align(msg_size(m
));
1720 m
= (struct tipc_msg
*)pos
;
1723 tipc_link_tunnel_xmit(l_ptr
, &tunnel_hdr
, msg
,
1724 msg_link_selector(msg
));
1729 /* tipc_link_dup_queue_xmit(): A second link has become active. Tunnel a
1730 * duplicate of the first link's send queue via the new link. This way, we
1731 * are guaranteed that currently queued packets from a socket are delivered
1732 * before future traffic from the same socket, even if this is using the
1733 * new link. The last arriving copy of each duplicate packet is dropped at
1734 * the receiving end by the regular protocol check, so packet cardinality
1735 * and sequence order is preserved per sender/receiver socket pair.
1736 * Owner node is locked.
1738 void tipc_link_dup_queue_xmit(struct tipc_link
*l_ptr
,
1739 struct tipc_link
*tunnel
)
1741 struct sk_buff
*skb
;
1742 struct tipc_msg tunnel_hdr
;
1744 tipc_msg_init(link_own_addr(l_ptr
), &tunnel_hdr
, CHANGEOVER_PROTOCOL
,
1745 DUPLICATE_MSG
, INT_H_SIZE
, l_ptr
->addr
);
1746 msg_set_msgcnt(&tunnel_hdr
, skb_queue_len(&l_ptr
->outqueue
));
1747 msg_set_bearer_id(&tunnel_hdr
, l_ptr
->peer_bearer_id
);
1748 skb_queue_walk(&l_ptr
->outqueue
, skb
) {
1749 struct sk_buff
*outskb
;
1750 struct tipc_msg
*msg
= buf_msg(skb
);
1751 u32 length
= msg_size(msg
);
1753 if (msg_user(msg
) == MSG_BUNDLER
)
1754 msg_set_type(msg
, CLOSED_MSG
);
1755 msg_set_ack(msg
, mod(l_ptr
->next_in_no
- 1)); /* Update */
1756 msg_set_bcast_ack(msg
, l_ptr
->owner
->bclink
.last_in
);
1757 msg_set_size(&tunnel_hdr
, length
+ INT_H_SIZE
);
1758 outskb
= tipc_buf_acquire(length
+ INT_H_SIZE
);
1759 if (outskb
== NULL
) {
1760 pr_warn("%sunable to send duplicate msg\n",
1764 skb_copy_to_linear_data(outskb
, &tunnel_hdr
, INT_H_SIZE
);
1765 skb_copy_to_linear_data_offset(outskb
, INT_H_SIZE
, skb
->data
,
1767 __tipc_link_xmit_skb(tunnel
, outskb
);
1768 if (!tipc_link_is_up(l_ptr
))
1774 * buf_extract - extracts embedded TIPC message from another message
1775 * @skb: encapsulating message buffer
1776 * @from_pos: offset to extract from
1778 * Returns a new message buffer containing an embedded message. The
1779 * encapsulating buffer is left unchanged.
1781 static struct sk_buff
*buf_extract(struct sk_buff
*skb
, u32 from_pos
)
1783 struct tipc_msg
*msg
= (struct tipc_msg
*)(skb
->data
+ from_pos
);
1784 u32 size
= msg_size(msg
);
1787 eb
= tipc_buf_acquire(size
);
1789 skb_copy_to_linear_data(eb
, msg
, size
);
1793 /* tipc_link_dup_rcv(): Receive a tunnelled DUPLICATE_MSG packet.
1794 * Owner node is locked.
1796 static void tipc_link_dup_rcv(struct tipc_link
*l_ptr
,
1797 struct sk_buff
*t_buf
)
1799 struct sk_buff
*buf
;
1801 if (!tipc_link_is_up(l_ptr
))
1804 buf
= buf_extract(t_buf
, INT_H_SIZE
);
1806 pr_warn("%sfailed to extract inner dup pkt\n", link_co_err
);
1810 /* Add buffer to deferred queue, if applicable: */
1811 link_handle_out_of_seq_msg(l_ptr
, buf
);
1814 /* tipc_link_failover_rcv(): Receive a tunnelled ORIGINAL_MSG packet
1815 * Owner node is locked.
1817 static struct sk_buff
*tipc_link_failover_rcv(struct tipc_link
*l_ptr
,
1818 struct sk_buff
*t_buf
)
1820 struct tipc_msg
*t_msg
= buf_msg(t_buf
);
1821 struct sk_buff
*buf
= NULL
;
1822 struct tipc_msg
*msg
;
1824 if (tipc_link_is_up(l_ptr
))
1825 tipc_link_reset(l_ptr
);
1827 /* First failover packet? */
1828 if (l_ptr
->exp_msg_count
== START_CHANGEOVER
)
1829 l_ptr
->exp_msg_count
= msg_msgcnt(t_msg
);
1831 /* Should there be an inner packet? */
1832 if (l_ptr
->exp_msg_count
) {
1833 l_ptr
->exp_msg_count
--;
1834 buf
= buf_extract(t_buf
, INT_H_SIZE
);
1836 pr_warn("%sno inner failover pkt\n", link_co_err
);
1841 if (less(msg_seqno(msg
), l_ptr
->reset_checkpoint
)) {
1846 if (msg_user(msg
) == MSG_FRAGMENTER
) {
1847 l_ptr
->stats
.recv_fragments
++;
1848 tipc_buf_append(&l_ptr
->reasm_buf
, &buf
);
1852 if ((!l_ptr
->exp_msg_count
) && (l_ptr
->flags
& LINK_STOPPED
))
1853 tipc_link_delete(l_ptr
);
1857 /* tipc_link_tunnel_rcv(): Receive a tunnelled packet, sent
1858 * via other link as result of a failover (ORIGINAL_MSG) or
1859 * a new active link (DUPLICATE_MSG). Failover packets are
1860 * returned to the active link for delivery upwards.
1861 * Owner node is locked.
1863 static int tipc_link_tunnel_rcv(struct tipc_node
*n_ptr
,
1864 struct sk_buff
**buf
)
1866 struct sk_buff
*t_buf
= *buf
;
1867 struct tipc_link
*l_ptr
;
1868 struct tipc_msg
*t_msg
= buf_msg(t_buf
);
1869 u32 bearer_id
= msg_bearer_id(t_msg
);
1873 if (bearer_id
>= MAX_BEARERS
)
1876 l_ptr
= n_ptr
->links
[bearer_id
];
1880 if (msg_type(t_msg
) == DUPLICATE_MSG
)
1881 tipc_link_dup_rcv(l_ptr
, t_buf
);
1882 else if (msg_type(t_msg
) == ORIGINAL_MSG
)
1883 *buf
= tipc_link_failover_rcv(l_ptr
, t_buf
);
1885 pr_warn("%sunknown tunnel pkt received\n", link_co_err
);
1888 return *buf
!= NULL
;
1891 static void link_set_supervision_props(struct tipc_link
*l_ptr
, u32 tol
)
1893 unsigned long intv
= ((tol
/ 4) > 500) ? 500 : tol
/ 4;
1895 if ((tol
< TIPC_MIN_LINK_TOL
) || (tol
> TIPC_MAX_LINK_TOL
))
1898 l_ptr
->tolerance
= tol
;
1899 l_ptr
->cont_intv
= msecs_to_jiffies(intv
);
1900 l_ptr
->abort_limit
= tol
/ (jiffies_to_msecs(l_ptr
->cont_intv
) / 4);
1903 void tipc_link_set_queue_limits(struct tipc_link
*l_ptr
, u32 window
)
1905 /* Data messages from this node, inclusive FIRST_FRAGM */
1906 l_ptr
->queue_limit
[TIPC_LOW_IMPORTANCE
] = window
;
1907 l_ptr
->queue_limit
[TIPC_MEDIUM_IMPORTANCE
] = (window
/ 3) * 4;
1908 l_ptr
->queue_limit
[TIPC_HIGH_IMPORTANCE
] = (window
/ 3) * 5;
1909 l_ptr
->queue_limit
[TIPC_CRITICAL_IMPORTANCE
] = (window
/ 3) * 6;
1910 /* Transiting data messages,inclusive FIRST_FRAGM */
1911 l_ptr
->queue_limit
[TIPC_LOW_IMPORTANCE
+ 4] = 300;
1912 l_ptr
->queue_limit
[TIPC_MEDIUM_IMPORTANCE
+ 4] = 600;
1913 l_ptr
->queue_limit
[TIPC_HIGH_IMPORTANCE
+ 4] = 900;
1914 l_ptr
->queue_limit
[TIPC_CRITICAL_IMPORTANCE
+ 4] = 1200;
1915 l_ptr
->queue_limit
[CONN_MANAGER
] = 1200;
1916 l_ptr
->queue_limit
[CHANGEOVER_PROTOCOL
] = 2500;
1917 l_ptr
->queue_limit
[NAME_DISTRIBUTOR
] = 3000;
1918 /* FRAGMENT and LAST_FRAGMENT packets */
1919 l_ptr
->queue_limit
[MSG_FRAGMENTER
] = 4000;
1922 /* tipc_link_find_owner - locate owner node of link by link's name
1923 * @net: the applicable net namespace
1924 * @name: pointer to link name string
1925 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1927 * Returns pointer to node owning the link, or 0 if no matching link is found.
1929 static struct tipc_node
*tipc_link_find_owner(struct net
*net
,
1930 const char *link_name
,
1931 unsigned int *bearer_id
)
1933 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
1934 struct tipc_link
*l_ptr
;
1935 struct tipc_node
*n_ptr
;
1936 struct tipc_node
*found_node
= NULL
;
1941 list_for_each_entry_rcu(n_ptr
, &tn
->node_list
, list
) {
1942 tipc_node_lock(n_ptr
);
1943 for (i
= 0; i
< MAX_BEARERS
; i
++) {
1944 l_ptr
= n_ptr
->links
[i
];
1945 if (l_ptr
&& !strcmp(l_ptr
->name
, link_name
)) {
1951 tipc_node_unlock(n_ptr
);
1961 * link_reset_statistics - reset link statistics
1962 * @l_ptr: pointer to link
1964 static void link_reset_statistics(struct tipc_link
*l_ptr
)
1966 memset(&l_ptr
->stats
, 0, sizeof(l_ptr
->stats
));
1967 l_ptr
->stats
.sent_info
= l_ptr
->next_out_no
;
1968 l_ptr
->stats
.recv_info
= l_ptr
->next_in_no
;
1971 static void link_print(struct tipc_link
*l_ptr
, const char *str
)
1973 struct tipc_net
*tn
= net_generic(l_ptr
->owner
->net
, tipc_net_id
);
1974 struct tipc_bearer
*b_ptr
;
1977 b_ptr
= rcu_dereference_rtnl(tn
->bearer_list
[l_ptr
->bearer_id
]);
1979 pr_info("%s Link %x<%s>:", str
, l_ptr
->addr
, b_ptr
->name
);
1982 if (link_working_unknown(l_ptr
))
1984 else if (link_reset_reset(l_ptr
))
1986 else if (link_reset_unknown(l_ptr
))
1988 else if (link_working_working(l_ptr
))
1994 /* Parse and validate nested (link) properties valid for media, bearer and link
1996 int tipc_nl_parse_link_prop(struct nlattr
*prop
, struct nlattr
*props
[])
2000 err
= nla_parse_nested(props
, TIPC_NLA_PROP_MAX
, prop
,
2001 tipc_nl_prop_policy
);
2005 if (props
[TIPC_NLA_PROP_PRIO
]) {
2008 prio
= nla_get_u32(props
[TIPC_NLA_PROP_PRIO
]);
2009 if (prio
> TIPC_MAX_LINK_PRI
)
2013 if (props
[TIPC_NLA_PROP_TOL
]) {
2016 tol
= nla_get_u32(props
[TIPC_NLA_PROP_TOL
]);
2017 if ((tol
< TIPC_MIN_LINK_TOL
) || (tol
> TIPC_MAX_LINK_TOL
))
2021 if (props
[TIPC_NLA_PROP_WIN
]) {
2024 win
= nla_get_u32(props
[TIPC_NLA_PROP_WIN
]);
2025 if ((win
< TIPC_MIN_LINK_WIN
) || (win
> TIPC_MAX_LINK_WIN
))
2032 int tipc_nl_link_set(struct sk_buff
*skb
, struct genl_info
*info
)
2038 struct tipc_link
*link
;
2039 struct tipc_node
*node
;
2040 struct nlattr
*attrs
[TIPC_NLA_LINK_MAX
+ 1];
2041 struct net
*net
= sock_net(skb
->sk
);
2043 if (!info
->attrs
[TIPC_NLA_LINK
])
2046 err
= nla_parse_nested(attrs
, TIPC_NLA_LINK_MAX
,
2047 info
->attrs
[TIPC_NLA_LINK
],
2048 tipc_nl_link_policy
);
2052 if (!attrs
[TIPC_NLA_LINK_NAME
])
2055 name
= nla_data(attrs
[TIPC_NLA_LINK_NAME
]);
2057 node
= tipc_link_find_owner(net
, name
, &bearer_id
);
2061 tipc_node_lock(node
);
2063 link
= node
->links
[bearer_id
];
2069 if (attrs
[TIPC_NLA_LINK_PROP
]) {
2070 struct nlattr
*props
[TIPC_NLA_PROP_MAX
+ 1];
2072 err
= tipc_nl_parse_link_prop(attrs
[TIPC_NLA_LINK_PROP
],
2079 if (props
[TIPC_NLA_PROP_TOL
]) {
2082 tol
= nla_get_u32(props
[TIPC_NLA_PROP_TOL
]);
2083 link_set_supervision_props(link
, tol
);
2084 tipc_link_proto_xmit(link
, STATE_MSG
, 0, 0, tol
, 0, 0);
2086 if (props
[TIPC_NLA_PROP_PRIO
]) {
2089 prio
= nla_get_u32(props
[TIPC_NLA_PROP_PRIO
]);
2090 link
->priority
= prio
;
2091 tipc_link_proto_xmit(link
, STATE_MSG
, 0, 0, 0, prio
, 0);
2093 if (props
[TIPC_NLA_PROP_WIN
]) {
2096 win
= nla_get_u32(props
[TIPC_NLA_PROP_WIN
]);
2097 tipc_link_set_queue_limits(link
, win
);
2102 tipc_node_unlock(node
);
2107 static int __tipc_nl_add_stats(struct sk_buff
*skb
, struct tipc_stats
*s
)
2110 struct nlattr
*stats
;
2117 struct nla_map map
[] = {
2118 {TIPC_NLA_STATS_RX_INFO
, s
->recv_info
},
2119 {TIPC_NLA_STATS_RX_FRAGMENTS
, s
->recv_fragments
},
2120 {TIPC_NLA_STATS_RX_FRAGMENTED
, s
->recv_fragmented
},
2121 {TIPC_NLA_STATS_RX_BUNDLES
, s
->recv_bundles
},
2122 {TIPC_NLA_STATS_RX_BUNDLED
, s
->recv_bundled
},
2123 {TIPC_NLA_STATS_TX_INFO
, s
->sent_info
},
2124 {TIPC_NLA_STATS_TX_FRAGMENTS
, s
->sent_fragments
},
2125 {TIPC_NLA_STATS_TX_FRAGMENTED
, s
->sent_fragmented
},
2126 {TIPC_NLA_STATS_TX_BUNDLES
, s
->sent_bundles
},
2127 {TIPC_NLA_STATS_TX_BUNDLED
, s
->sent_bundled
},
2128 {TIPC_NLA_STATS_MSG_PROF_TOT
, (s
->msg_length_counts
) ?
2129 s
->msg_length_counts
: 1},
2130 {TIPC_NLA_STATS_MSG_LEN_CNT
, s
->msg_length_counts
},
2131 {TIPC_NLA_STATS_MSG_LEN_TOT
, s
->msg_lengths_total
},
2132 {TIPC_NLA_STATS_MSG_LEN_P0
, s
->msg_length_profile
[0]},
2133 {TIPC_NLA_STATS_MSG_LEN_P1
, s
->msg_length_profile
[1]},
2134 {TIPC_NLA_STATS_MSG_LEN_P2
, s
->msg_length_profile
[2]},
2135 {TIPC_NLA_STATS_MSG_LEN_P3
, s
->msg_length_profile
[3]},
2136 {TIPC_NLA_STATS_MSG_LEN_P4
, s
->msg_length_profile
[4]},
2137 {TIPC_NLA_STATS_MSG_LEN_P5
, s
->msg_length_profile
[5]},
2138 {TIPC_NLA_STATS_MSG_LEN_P6
, s
->msg_length_profile
[6]},
2139 {TIPC_NLA_STATS_RX_STATES
, s
->recv_states
},
2140 {TIPC_NLA_STATS_RX_PROBES
, s
->recv_probes
},
2141 {TIPC_NLA_STATS_RX_NACKS
, s
->recv_nacks
},
2142 {TIPC_NLA_STATS_RX_DEFERRED
, s
->deferred_recv
},
2143 {TIPC_NLA_STATS_TX_STATES
, s
->sent_states
},
2144 {TIPC_NLA_STATS_TX_PROBES
, s
->sent_probes
},
2145 {TIPC_NLA_STATS_TX_NACKS
, s
->sent_nacks
},
2146 {TIPC_NLA_STATS_TX_ACKS
, s
->sent_acks
},
2147 {TIPC_NLA_STATS_RETRANSMITTED
, s
->retransmitted
},
2148 {TIPC_NLA_STATS_DUPLICATES
, s
->duplicates
},
2149 {TIPC_NLA_STATS_LINK_CONGS
, s
->link_congs
},
2150 {TIPC_NLA_STATS_MAX_QUEUE
, s
->max_queue_sz
},
2151 {TIPC_NLA_STATS_AVG_QUEUE
, s
->queue_sz_counts
?
2152 (s
->accu_queue_sz
/ s
->queue_sz_counts
) : 0}
2155 stats
= nla_nest_start(skb
, TIPC_NLA_LINK_STATS
);
2159 for (i
= 0; i
< ARRAY_SIZE(map
); i
++)
2160 if (nla_put_u32(skb
, map
[i
].key
, map
[i
].val
))
2163 nla_nest_end(skb
, stats
);
2167 nla_nest_cancel(skb
, stats
);
2172 /* Caller should hold appropriate locks to protect the link */
2173 static int __tipc_nl_add_link(struct net
*net
, struct tipc_nl_msg
*msg
,
2174 struct tipc_link
*link
)
2178 struct nlattr
*attrs
;
2179 struct nlattr
*prop
;
2180 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
2182 hdr
= genlmsg_put(msg
->skb
, msg
->portid
, msg
->seq
, &tipc_genl_family
,
2183 NLM_F_MULTI
, TIPC_NL_LINK_GET
);
2187 attrs
= nla_nest_start(msg
->skb
, TIPC_NLA_LINK
);
2191 if (nla_put_string(msg
->skb
, TIPC_NLA_LINK_NAME
, link
->name
))
2193 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_DEST
,
2194 tipc_cluster_mask(tn
->own_addr
)))
2196 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_MTU
, link
->max_pkt
))
2198 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_RX
, link
->next_in_no
))
2200 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_TX
, link
->next_out_no
))
2203 if (tipc_link_is_up(link
))
2204 if (nla_put_flag(msg
->skb
, TIPC_NLA_LINK_UP
))
2206 if (tipc_link_is_active(link
))
2207 if (nla_put_flag(msg
->skb
, TIPC_NLA_LINK_ACTIVE
))
2210 prop
= nla_nest_start(msg
->skb
, TIPC_NLA_LINK_PROP
);
2213 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_PRIO
, link
->priority
))
2215 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_TOL
, link
->tolerance
))
2217 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_WIN
,
2218 link
->queue_limit
[TIPC_LOW_IMPORTANCE
]))
2220 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_PRIO
, link
->priority
))
2222 nla_nest_end(msg
->skb
, prop
);
2224 err
= __tipc_nl_add_stats(msg
->skb
, &link
->stats
);
2228 nla_nest_end(msg
->skb
, attrs
);
2229 genlmsg_end(msg
->skb
, hdr
);
2234 nla_nest_cancel(msg
->skb
, prop
);
2236 nla_nest_cancel(msg
->skb
, attrs
);
2238 genlmsg_cancel(msg
->skb
, hdr
);
2243 /* Caller should hold node lock */
2244 static int __tipc_nl_add_node_links(struct net
*net
, struct tipc_nl_msg
*msg
,
2245 struct tipc_node
*node
, u32
*prev_link
)
2250 for (i
= *prev_link
; i
< MAX_BEARERS
; i
++) {
2253 if (!node
->links
[i
])
2256 err
= __tipc_nl_add_link(net
, msg
, node
->links
[i
]);
2265 int tipc_nl_link_dump(struct sk_buff
*skb
, struct netlink_callback
*cb
)
2267 struct net
*net
= sock_net(skb
->sk
);
2268 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
2269 struct tipc_node
*node
;
2270 struct tipc_nl_msg msg
;
2271 u32 prev_node
= cb
->args
[0];
2272 u32 prev_link
= cb
->args
[1];
2273 int done
= cb
->args
[2];
2280 msg
.portid
= NETLINK_CB(cb
->skb
).portid
;
2281 msg
.seq
= cb
->nlh
->nlmsg_seq
;
2286 node
= tipc_node_find(net
, prev_node
);
2288 /* We never set seq or call nl_dump_check_consistent()
2289 * this means that setting prev_seq here will cause the
2290 * consistence check to fail in the netlink callback
2291 * handler. Resulting in the last NLMSG_DONE message
2292 * having the NLM_F_DUMP_INTR flag set.
2298 list_for_each_entry_continue_rcu(node
, &tn
->node_list
,
2300 tipc_node_lock(node
);
2301 err
= __tipc_nl_add_node_links(net
, &msg
, node
,
2303 tipc_node_unlock(node
);
2307 prev_node
= node
->addr
;
2310 err
= tipc_nl_add_bc_link(net
, &msg
);
2314 list_for_each_entry_rcu(node
, &tn
->node_list
, list
) {
2315 tipc_node_lock(node
);
2316 err
= __tipc_nl_add_node_links(net
, &msg
, node
,
2318 tipc_node_unlock(node
);
2322 prev_node
= node
->addr
;
2329 cb
->args
[0] = prev_node
;
2330 cb
->args
[1] = prev_link
;
2336 int tipc_nl_link_get(struct sk_buff
*skb
, struct genl_info
*info
)
2338 struct net
*net
= genl_info_net(info
);
2339 struct sk_buff
*ans_skb
;
2340 struct tipc_nl_msg msg
;
2341 struct tipc_link
*link
;
2342 struct tipc_node
*node
;
2347 if (!info
->attrs
[TIPC_NLA_LINK_NAME
])
2350 name
= nla_data(info
->attrs
[TIPC_NLA_LINK_NAME
]);
2351 node
= tipc_link_find_owner(net
, name
, &bearer_id
);
2355 ans_skb
= nlmsg_new(NLMSG_GOODSIZE
, GFP_KERNEL
);
2360 msg
.portid
= info
->snd_portid
;
2361 msg
.seq
= info
->snd_seq
;
2363 tipc_node_lock(node
);
2364 link
= node
->links
[bearer_id
];
2370 err
= __tipc_nl_add_link(net
, &msg
, link
);
2374 tipc_node_unlock(node
);
2376 return genlmsg_reply(ans_skb
, info
);
2379 tipc_node_unlock(node
);
2380 nlmsg_free(ans_skb
);
2385 int tipc_nl_link_reset_stats(struct sk_buff
*skb
, struct genl_info
*info
)
2389 unsigned int bearer_id
;
2390 struct tipc_link
*link
;
2391 struct tipc_node
*node
;
2392 struct nlattr
*attrs
[TIPC_NLA_LINK_MAX
+ 1];
2393 struct net
*net
= sock_net(skb
->sk
);
2395 if (!info
->attrs
[TIPC_NLA_LINK
])
2398 err
= nla_parse_nested(attrs
, TIPC_NLA_LINK_MAX
,
2399 info
->attrs
[TIPC_NLA_LINK
],
2400 tipc_nl_link_policy
);
2404 if (!attrs
[TIPC_NLA_LINK_NAME
])
2407 link_name
= nla_data(attrs
[TIPC_NLA_LINK_NAME
]);
2409 if (strcmp(link_name
, tipc_bclink_name
) == 0) {
2410 err
= tipc_bclink_reset_stats(net
);
2416 node
= tipc_link_find_owner(net
, link_name
, &bearer_id
);
2420 tipc_node_lock(node
);
2422 link
= node
->links
[bearer_id
];
2424 tipc_node_unlock(node
);
2428 link_reset_statistics(link
);
2430 tipc_node_unlock(node
);