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"
46 #include <linux/pkt_sched.h>
49 * Error message prefixes
51 static const char *link_co_err
= "Link changeover error, ";
52 static const char *link_rst_msg
= "Resetting link ";
53 static const char *link_unk_evt
= "Unknown link event ";
55 static const struct nla_policy tipc_nl_link_policy
[TIPC_NLA_LINK_MAX
+ 1] = {
56 [TIPC_NLA_LINK_UNSPEC
] = { .type
= NLA_UNSPEC
},
57 [TIPC_NLA_LINK_NAME
] = {
59 .len
= TIPC_MAX_LINK_NAME
61 [TIPC_NLA_LINK_MTU
] = { .type
= NLA_U32
},
62 [TIPC_NLA_LINK_BROADCAST
] = { .type
= NLA_FLAG
},
63 [TIPC_NLA_LINK_UP
] = { .type
= NLA_FLAG
},
64 [TIPC_NLA_LINK_ACTIVE
] = { .type
= NLA_FLAG
},
65 [TIPC_NLA_LINK_PROP
] = { .type
= NLA_NESTED
},
66 [TIPC_NLA_LINK_STATS
] = { .type
= NLA_NESTED
},
67 [TIPC_NLA_LINK_RX
] = { .type
= NLA_U32
},
68 [TIPC_NLA_LINK_TX
] = { .type
= NLA_U32
}
71 /* Properties valid for media, bearar and link */
72 static const struct nla_policy tipc_nl_prop_policy
[TIPC_NLA_PROP_MAX
+ 1] = {
73 [TIPC_NLA_PROP_UNSPEC
] = { .type
= NLA_UNSPEC
},
74 [TIPC_NLA_PROP_PRIO
] = { .type
= NLA_U32
},
75 [TIPC_NLA_PROP_TOL
] = { .type
= NLA_U32
},
76 [TIPC_NLA_PROP_WIN
] = { .type
= NLA_U32
}
80 * Out-of-range value for link session numbers
82 #define INVALID_SESSION 0x10000
87 #define STARTING_EVT 856384768 /* link processing trigger */
88 #define TRAFFIC_MSG_EVT 560815u /* rx'd ??? */
89 #define TIMEOUT_EVT 560817u /* link timer expired */
92 * The following two 'message types' is really just implementation
93 * data conveniently stored in the message header.
94 * They must not be considered part of the protocol
100 * State value stored in 'exp_msg_count'
102 #define START_CHANGEOVER 100000u
104 static void link_handle_out_of_seq_msg(struct tipc_link
*l_ptr
,
105 struct sk_buff
*buf
);
106 static void tipc_link_proto_rcv(struct tipc_link
*l_ptr
, struct sk_buff
*buf
);
107 static int tipc_link_tunnel_rcv(struct tipc_node
*n_ptr
,
108 struct sk_buff
**buf
);
109 static void link_set_supervision_props(struct tipc_link
*l_ptr
, u32 tolerance
);
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 int tipc_link_input(struct tipc_link
*l
, struct sk_buff
*buf
);
116 static int tipc_link_prepare_input(struct tipc_link
*l
, struct sk_buff
**buf
);
119 * Simple link routines
121 static unsigned int align(unsigned int i
)
123 return (i
+ 3) & ~3u;
126 static void link_init_max_pkt(struct tipc_link
*l_ptr
)
128 struct tipc_bearer
*b_ptr
;
132 b_ptr
= rcu_dereference_rtnl(bearer_list
[l_ptr
->bearer_id
]);
137 max_pkt
= (b_ptr
->mtu
& ~3);
140 if (max_pkt
> MAX_MSG_SIZE
)
141 max_pkt
= MAX_MSG_SIZE
;
143 l_ptr
->max_pkt_target
= max_pkt
;
144 if (l_ptr
->max_pkt_target
< MAX_PKT_DEFAULT
)
145 l_ptr
->max_pkt
= l_ptr
->max_pkt_target
;
147 l_ptr
->max_pkt
= MAX_PKT_DEFAULT
;
149 l_ptr
->max_pkt_probes
= 0;
153 * Simple non-static link routines (i.e. referenced outside this file)
155 int tipc_link_is_up(struct tipc_link
*l_ptr
)
159 return link_working_working(l_ptr
) || link_working_unknown(l_ptr
);
162 int tipc_link_is_active(struct tipc_link
*l_ptr
)
164 return (l_ptr
->owner
->active_links
[0] == l_ptr
) ||
165 (l_ptr
->owner
->active_links
[1] == l_ptr
);
169 * link_timeout - handle expiration of link timer
170 * @l_ptr: pointer to link
172 static void link_timeout(struct tipc_link
*l_ptr
)
176 tipc_node_lock(l_ptr
->owner
);
178 /* update counters used in statistical profiling of send traffic */
179 l_ptr
->stats
.accu_queue_sz
+= skb_queue_len(&l_ptr
->outqueue
);
180 l_ptr
->stats
.queue_sz_counts
++;
182 skb
= skb_peek(&l_ptr
->outqueue
);
184 struct tipc_msg
*msg
= buf_msg(skb
);
185 u32 length
= msg_size(msg
);
187 if ((msg_user(msg
) == MSG_FRAGMENTER
) &&
188 (msg_type(msg
) == FIRST_FRAGMENT
)) {
189 length
= msg_size(msg_get_wrapped(msg
));
192 l_ptr
->stats
.msg_lengths_total
+= length
;
193 l_ptr
->stats
.msg_length_counts
++;
195 l_ptr
->stats
.msg_length_profile
[0]++;
196 else if (length
<= 256)
197 l_ptr
->stats
.msg_length_profile
[1]++;
198 else if (length
<= 1024)
199 l_ptr
->stats
.msg_length_profile
[2]++;
200 else if (length
<= 4096)
201 l_ptr
->stats
.msg_length_profile
[3]++;
202 else if (length
<= 16384)
203 l_ptr
->stats
.msg_length_profile
[4]++;
204 else if (length
<= 32768)
205 l_ptr
->stats
.msg_length_profile
[5]++;
207 l_ptr
->stats
.msg_length_profile
[6]++;
211 /* do all other link processing performed on a periodic basis */
212 link_state_event(l_ptr
, TIMEOUT_EVT
);
215 tipc_link_push_packets(l_ptr
);
217 tipc_node_unlock(l_ptr
->owner
);
220 static void link_set_timer(struct tipc_link
*l_ptr
, u32 time
)
222 k_start_timer(&l_ptr
->timer
, time
);
226 * tipc_link_create - create a new link
227 * @n_ptr: pointer to associated node
228 * @b_ptr: pointer to associated bearer
229 * @media_addr: media address to use when sending messages over link
231 * Returns pointer to link.
233 struct tipc_link
*tipc_link_create(struct tipc_node
*n_ptr
,
234 struct tipc_bearer
*b_ptr
,
235 const struct tipc_media_addr
*media_addr
)
237 struct tipc_link
*l_ptr
;
238 struct tipc_msg
*msg
;
240 char addr_string
[16];
241 u32 peer
= n_ptr
->addr
;
243 if (n_ptr
->link_cnt
>= MAX_BEARERS
) {
244 tipc_addr_string_fill(addr_string
, n_ptr
->addr
);
245 pr_err("Attempt to establish %uth link to %s. Max %u allowed.\n",
246 n_ptr
->link_cnt
, addr_string
, MAX_BEARERS
);
250 if (n_ptr
->links
[b_ptr
->identity
]) {
251 tipc_addr_string_fill(addr_string
, n_ptr
->addr
);
252 pr_err("Attempt to establish second link on <%s> to %s\n",
253 b_ptr
->name
, addr_string
);
257 l_ptr
= kzalloc(sizeof(*l_ptr
), GFP_ATOMIC
);
259 pr_warn("Link creation failed, no memory\n");
264 if_name
= strchr(b_ptr
->name
, ':') + 1;
265 sprintf(l_ptr
->name
, "%u.%u.%u:%s-%u.%u.%u:unknown",
266 tipc_zone(tipc_own_addr
), tipc_cluster(tipc_own_addr
),
267 tipc_node(tipc_own_addr
),
269 tipc_zone(peer
), tipc_cluster(peer
), tipc_node(peer
));
270 /* note: peer i/f name is updated by reset/activate message */
271 memcpy(&l_ptr
->media_addr
, media_addr
, sizeof(*media_addr
));
272 l_ptr
->owner
= n_ptr
;
273 l_ptr
->checkpoint
= 1;
274 l_ptr
->peer_session
= INVALID_SESSION
;
275 l_ptr
->bearer_id
= b_ptr
->identity
;
276 link_set_supervision_props(l_ptr
, b_ptr
->tolerance
);
277 l_ptr
->state
= RESET_UNKNOWN
;
279 l_ptr
->pmsg
= (struct tipc_msg
*)&l_ptr
->proto_msg
;
281 tipc_msg_init(msg
, LINK_PROTOCOL
, RESET_MSG
, INT_H_SIZE
, l_ptr
->addr
);
282 msg_set_size(msg
, sizeof(l_ptr
->proto_msg
));
283 msg_set_session(msg
, (tipc_random
& 0xffff));
284 msg_set_bearer_id(msg
, b_ptr
->identity
);
285 strcpy((char *)msg_data(msg
), if_name
);
287 l_ptr
->priority
= b_ptr
->priority
;
288 tipc_link_set_queue_limits(l_ptr
, b_ptr
->window
);
290 l_ptr
->net_plane
= b_ptr
->net_plane
;
291 link_init_max_pkt(l_ptr
);
293 l_ptr
->next_out_no
= 1;
294 __skb_queue_head_init(&l_ptr
->outqueue
);
295 __skb_queue_head_init(&l_ptr
->deferred_queue
);
296 __skb_queue_head_init(&l_ptr
->waiting_sks
);
298 link_reset_statistics(l_ptr
);
300 tipc_node_attach_link(n_ptr
, l_ptr
);
302 k_init_timer(&l_ptr
->timer
, (Handler
)link_timeout
,
303 (unsigned long)l_ptr
);
305 link_state_event(l_ptr
, STARTING_EVT
);
310 void tipc_link_delete_list(unsigned int bearer_id
, bool shutting_down
)
312 struct tipc_link
*l_ptr
;
313 struct tipc_node
*n_ptr
;
316 list_for_each_entry_rcu(n_ptr
, &tipc_node_list
, list
) {
317 tipc_node_lock(n_ptr
);
318 l_ptr
= n_ptr
->links
[bearer_id
];
320 tipc_link_reset(l_ptr
);
321 if (shutting_down
|| !tipc_node_is_up(n_ptr
)) {
322 tipc_node_detach_link(l_ptr
->owner
, l_ptr
);
323 tipc_link_reset_fragments(l_ptr
);
324 tipc_node_unlock(n_ptr
);
326 /* Nobody else can access this link now: */
327 del_timer_sync(&l_ptr
->timer
);
330 /* Detach/delete when failover is finished: */
331 l_ptr
->flags
|= LINK_STOPPED
;
332 tipc_node_unlock(n_ptr
);
333 del_timer_sync(&l_ptr
->timer
);
337 tipc_node_unlock(n_ptr
);
343 * link_schedule_user - schedule user for wakeup after congestion
344 * @link: congested link
345 * @oport: sending port
346 * @chain_sz: size of buffer chain that was attempted sent
347 * @imp: importance of message attempted sent
348 * Create pseudo msg to send back to user when congestion abates
350 static bool link_schedule_user(struct tipc_link
*link
, u32 oport
,
351 uint chain_sz
, uint imp
)
355 buf
= tipc_msg_create(SOCK_WAKEUP
, 0, INT_H_SIZE
, 0, tipc_own_addr
,
356 tipc_own_addr
, oport
, 0, 0);
359 TIPC_SKB_CB(buf
)->chain_sz
= chain_sz
;
360 TIPC_SKB_CB(buf
)->chain_imp
= imp
;
361 __skb_queue_tail(&link
->waiting_sks
, buf
);
362 link
->stats
.link_congs
++;
367 * link_prepare_wakeup - prepare users for wakeup after congestion
368 * @link: congested link
369 * Move a number of waiting users, as permitted by available space in
370 * the send queue, from link wait queue to node wait queue for wakeup
372 static void link_prepare_wakeup(struct tipc_link
*link
)
374 uint pend_qsz
= skb_queue_len(&link
->outqueue
);
375 struct sk_buff
*skb
, *tmp
;
377 skb_queue_walk_safe(&link
->waiting_sks
, skb
, tmp
) {
378 if (pend_qsz
>= link
->queue_limit
[TIPC_SKB_CB(skb
)->chain_imp
])
380 pend_qsz
+= TIPC_SKB_CB(skb
)->chain_sz
;
381 __skb_unlink(skb
, &link
->waiting_sks
);
382 __skb_queue_tail(&link
->owner
->waiting_sks
, skb
);
387 * tipc_link_reset_fragments - purge link's inbound message fragments queue
388 * @l_ptr: pointer to link
390 void tipc_link_reset_fragments(struct tipc_link
*l_ptr
)
392 kfree_skb(l_ptr
->reasm_buf
);
393 l_ptr
->reasm_buf
= NULL
;
397 * tipc_link_purge_queues - purge all pkt queues associated with link
398 * @l_ptr: pointer to link
400 void tipc_link_purge_queues(struct tipc_link
*l_ptr
)
402 __skb_queue_purge(&l_ptr
->deferred_queue
);
403 __skb_queue_purge(&l_ptr
->outqueue
);
404 tipc_link_reset_fragments(l_ptr
);
407 void tipc_link_reset(struct tipc_link
*l_ptr
)
409 u32 prev_state
= l_ptr
->state
;
410 u32 checkpoint
= l_ptr
->next_in_no
;
411 int was_active_link
= tipc_link_is_active(l_ptr
);
412 struct tipc_node
*owner
= l_ptr
->owner
;
414 msg_set_session(l_ptr
->pmsg
, ((msg_session(l_ptr
->pmsg
) + 1) & 0xffff));
416 /* Link is down, accept any session */
417 l_ptr
->peer_session
= INVALID_SESSION
;
419 /* Prepare for max packet size negotiation */
420 link_init_max_pkt(l_ptr
);
422 l_ptr
->state
= RESET_UNKNOWN
;
424 if ((prev_state
== RESET_UNKNOWN
) || (prev_state
== RESET_RESET
))
427 tipc_node_link_down(l_ptr
->owner
, l_ptr
);
428 tipc_bearer_remove_dest(l_ptr
->bearer_id
, l_ptr
->addr
);
430 if (was_active_link
&& tipc_node_active_links(l_ptr
->owner
)) {
431 l_ptr
->reset_checkpoint
= checkpoint
;
432 l_ptr
->exp_msg_count
= START_CHANGEOVER
;
435 /* Clean up all queues: */
436 __skb_queue_purge(&l_ptr
->outqueue
);
437 __skb_queue_purge(&l_ptr
->deferred_queue
);
438 if (!skb_queue_empty(&l_ptr
->waiting_sks
)) {
439 skb_queue_splice_init(&l_ptr
->waiting_sks
, &owner
->waiting_sks
);
440 owner
->action_flags
|= TIPC_WAKEUP_USERS
;
442 l_ptr
->next_out
= NULL
;
443 l_ptr
->unacked_window
= 0;
444 l_ptr
->checkpoint
= 1;
445 l_ptr
->next_out_no
= 1;
446 l_ptr
->fsm_msg_cnt
= 0;
447 l_ptr
->stale_count
= 0;
448 link_reset_statistics(l_ptr
);
451 void tipc_link_reset_list(unsigned int bearer_id
)
453 struct tipc_link
*l_ptr
;
454 struct tipc_node
*n_ptr
;
457 list_for_each_entry_rcu(n_ptr
, &tipc_node_list
, list
) {
458 tipc_node_lock(n_ptr
);
459 l_ptr
= n_ptr
->links
[bearer_id
];
461 tipc_link_reset(l_ptr
);
462 tipc_node_unlock(n_ptr
);
467 static void link_activate(struct tipc_link
*l_ptr
)
469 l_ptr
->next_in_no
= l_ptr
->stats
.recv_info
= 1;
470 tipc_node_link_up(l_ptr
->owner
, l_ptr
);
471 tipc_bearer_add_dest(l_ptr
->bearer_id
, l_ptr
->addr
);
475 * link_state_event - link finite state machine
476 * @l_ptr: pointer to link
477 * @event: state machine event to process
479 static void link_state_event(struct tipc_link
*l_ptr
, unsigned int event
)
481 struct tipc_link
*other
;
482 u32 cont_intv
= l_ptr
->continuity_interval
;
484 if (l_ptr
->flags
& LINK_STOPPED
)
487 if (!(l_ptr
->flags
& LINK_STARTED
) && (event
!= STARTING_EVT
))
488 return; /* Not yet. */
490 /* Check whether changeover is going on */
491 if (l_ptr
->exp_msg_count
) {
492 if (event
== TIMEOUT_EVT
)
493 link_set_timer(l_ptr
, cont_intv
);
497 switch (l_ptr
->state
) {
498 case WORKING_WORKING
:
500 case TRAFFIC_MSG_EVT
:
504 if (l_ptr
->next_in_no
!= l_ptr
->checkpoint
) {
505 l_ptr
->checkpoint
= l_ptr
->next_in_no
;
506 if (tipc_bclink_acks_missing(l_ptr
->owner
)) {
507 tipc_link_proto_xmit(l_ptr
, STATE_MSG
,
509 l_ptr
->fsm_msg_cnt
++;
510 } else if (l_ptr
->max_pkt
< l_ptr
->max_pkt_target
) {
511 tipc_link_proto_xmit(l_ptr
, STATE_MSG
,
513 l_ptr
->fsm_msg_cnt
++;
515 link_set_timer(l_ptr
, cont_intv
);
518 l_ptr
->state
= WORKING_UNKNOWN
;
519 l_ptr
->fsm_msg_cnt
= 0;
520 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 1, 0, 0, 0, 0);
521 l_ptr
->fsm_msg_cnt
++;
522 link_set_timer(l_ptr
, cont_intv
/ 4);
525 pr_info("%s<%s>, requested by peer\n", link_rst_msg
,
527 tipc_link_reset(l_ptr
);
528 l_ptr
->state
= RESET_RESET
;
529 l_ptr
->fsm_msg_cnt
= 0;
530 tipc_link_proto_xmit(l_ptr
, ACTIVATE_MSG
,
532 l_ptr
->fsm_msg_cnt
++;
533 link_set_timer(l_ptr
, cont_intv
);
536 pr_err("%s%u in WW state\n", link_unk_evt
, event
);
539 case WORKING_UNKNOWN
:
541 case TRAFFIC_MSG_EVT
:
543 l_ptr
->state
= WORKING_WORKING
;
544 l_ptr
->fsm_msg_cnt
= 0;
545 link_set_timer(l_ptr
, cont_intv
);
548 pr_info("%s<%s>, requested by peer while probing\n",
549 link_rst_msg
, l_ptr
->name
);
550 tipc_link_reset(l_ptr
);
551 l_ptr
->state
= RESET_RESET
;
552 l_ptr
->fsm_msg_cnt
= 0;
553 tipc_link_proto_xmit(l_ptr
, ACTIVATE_MSG
,
555 l_ptr
->fsm_msg_cnt
++;
556 link_set_timer(l_ptr
, cont_intv
);
559 if (l_ptr
->next_in_no
!= l_ptr
->checkpoint
) {
560 l_ptr
->state
= WORKING_WORKING
;
561 l_ptr
->fsm_msg_cnt
= 0;
562 l_ptr
->checkpoint
= l_ptr
->next_in_no
;
563 if (tipc_bclink_acks_missing(l_ptr
->owner
)) {
564 tipc_link_proto_xmit(l_ptr
, STATE_MSG
,
566 l_ptr
->fsm_msg_cnt
++;
568 link_set_timer(l_ptr
, cont_intv
);
569 } else if (l_ptr
->fsm_msg_cnt
< l_ptr
->abort_limit
) {
570 tipc_link_proto_xmit(l_ptr
, STATE_MSG
,
572 l_ptr
->fsm_msg_cnt
++;
573 link_set_timer(l_ptr
, cont_intv
/ 4);
574 } else { /* Link has failed */
575 pr_warn("%s<%s>, peer not responding\n",
576 link_rst_msg
, l_ptr
->name
);
577 tipc_link_reset(l_ptr
);
578 l_ptr
->state
= RESET_UNKNOWN
;
579 l_ptr
->fsm_msg_cnt
= 0;
580 tipc_link_proto_xmit(l_ptr
, RESET_MSG
,
582 l_ptr
->fsm_msg_cnt
++;
583 link_set_timer(l_ptr
, cont_intv
);
587 pr_err("%s%u in WU state\n", link_unk_evt
, event
);
592 case TRAFFIC_MSG_EVT
:
595 other
= l_ptr
->owner
->active_links
[0];
596 if (other
&& link_working_unknown(other
))
598 l_ptr
->state
= WORKING_WORKING
;
599 l_ptr
->fsm_msg_cnt
= 0;
600 link_activate(l_ptr
);
601 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 1, 0, 0, 0, 0);
602 l_ptr
->fsm_msg_cnt
++;
603 if (l_ptr
->owner
->working_links
== 1)
604 tipc_link_sync_xmit(l_ptr
);
605 link_set_timer(l_ptr
, cont_intv
);
608 l_ptr
->state
= RESET_RESET
;
609 l_ptr
->fsm_msg_cnt
= 0;
610 tipc_link_proto_xmit(l_ptr
, ACTIVATE_MSG
,
612 l_ptr
->fsm_msg_cnt
++;
613 link_set_timer(l_ptr
, cont_intv
);
616 l_ptr
->flags
|= LINK_STARTED
;
619 tipc_link_proto_xmit(l_ptr
, RESET_MSG
, 0, 0, 0, 0, 0);
620 l_ptr
->fsm_msg_cnt
++;
621 link_set_timer(l_ptr
, cont_intv
);
624 pr_err("%s%u in RU state\n", link_unk_evt
, event
);
629 case TRAFFIC_MSG_EVT
:
631 other
= l_ptr
->owner
->active_links
[0];
632 if (other
&& link_working_unknown(other
))
634 l_ptr
->state
= WORKING_WORKING
;
635 l_ptr
->fsm_msg_cnt
= 0;
636 link_activate(l_ptr
);
637 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 1, 0, 0, 0, 0);
638 l_ptr
->fsm_msg_cnt
++;
639 if (l_ptr
->owner
->working_links
== 1)
640 tipc_link_sync_xmit(l_ptr
);
641 link_set_timer(l_ptr
, cont_intv
);
646 tipc_link_proto_xmit(l_ptr
, ACTIVATE_MSG
,
648 l_ptr
->fsm_msg_cnt
++;
649 link_set_timer(l_ptr
, cont_intv
);
652 pr_err("%s%u in RR state\n", link_unk_evt
, event
);
656 pr_err("Unknown link state %u/%u\n", l_ptr
->state
, event
);
660 /* tipc_link_cong: determine return value and how to treat the
661 * sent buffer during link congestion.
662 * - For plain, errorless user data messages we keep the buffer and
664 * - For all other messages we discard the buffer and return -EHOSTUNREACH
665 * - For TIPC internal messages we also reset the link
667 static int tipc_link_cong(struct tipc_link
*link
, struct sk_buff
*buf
)
669 struct tipc_msg
*msg
= buf_msg(buf
);
670 uint imp
= tipc_msg_tot_importance(msg
);
671 u32 oport
= msg_tot_origport(msg
);
673 if (unlikely(imp
> TIPC_CRITICAL_IMPORTANCE
)) {
674 pr_warn("%s<%s>, send queue full", link_rst_msg
, link
->name
);
675 tipc_link_reset(link
);
678 if (unlikely(msg_errcode(msg
)))
680 if (unlikely(msg_reroute_cnt(msg
)))
682 if (TIPC_SKB_CB(buf
)->wakeup_pending
)
684 if (link_schedule_user(link
, oport
, TIPC_SKB_CB(buf
)->chain_sz
, imp
))
688 return -EHOSTUNREACH
;
692 * __tipc_link_xmit(): same as tipc_link_xmit, but destlink is known & locked
694 * @skb: chain of buffers containing message
695 * Consumes the buffer chain, except when returning -ELINKCONG
696 * Returns 0 if success, otherwise errno: -ELINKCONG, -EMSGSIZE (plain socket
697 * user data messages) or -EHOSTUNREACH (all other messages/senders)
698 * Only the socket functions tipc_send_stream() and tipc_send_packet() need
699 * to act on the return value, since they may need to do more send attempts.
701 int __tipc_link_xmit(struct tipc_link
*link
, struct sk_buff
*skb
)
703 struct tipc_msg
*msg
= buf_msg(skb
);
704 uint psz
= msg_size(msg
);
705 uint sndlim
= link
->queue_limit
[0];
706 uint imp
= tipc_msg_tot_importance(msg
);
707 uint mtu
= link
->max_pkt
;
708 uint ack
= mod(link
->next_in_no
- 1);
709 uint seqno
= link
->next_out_no
;
710 uint bc_last_in
= link
->owner
->bclink
.last_in
;
711 struct tipc_media_addr
*addr
= &link
->media_addr
;
712 struct sk_buff_head
*outqueue
= &link
->outqueue
;
713 struct sk_buff
*next
;
715 /* Match queue limits against msg importance: */
716 if (unlikely(skb_queue_len(outqueue
) >= link
->queue_limit
[imp
]))
717 return tipc_link_cong(link
, skb
);
719 /* Has valid packet limit been used ? */
720 if (unlikely(psz
> mtu
)) {
725 /* Prepare each packet for sending, and add to outqueue: */
729 msg_set_word(msg
, 2, ((ack
<< 16) | mod(seqno
)));
730 msg_set_bcast_ack(msg
, bc_last_in
);
732 if (skb_queue_len(outqueue
) < sndlim
) {
733 __skb_queue_tail(outqueue
, skb
);
734 tipc_bearer_send(link
->bearer_id
, skb
, addr
);
735 link
->next_out
= NULL
;
736 link
->unacked_window
= 0;
737 } else if (tipc_msg_bundle(outqueue
, skb
, mtu
)) {
738 link
->stats
.sent_bundled
++;
741 } else if (tipc_msg_make_bundle(outqueue
, skb
, mtu
,
743 link
->stats
.sent_bundled
++;
744 link
->stats
.sent_bundles
++;
746 link
->next_out
= skb_peek_tail(outqueue
);
748 __skb_queue_tail(outqueue
, skb
);
750 link
->next_out
= skb
;
755 link
->next_out_no
= seqno
;
760 * tipc_link_xmit() is the general link level function for message sending
761 * @buf: chain of buffers containing message
762 * @dsz: amount of user data to be sent
763 * @dnode: address of destination node
764 * @selector: a number used for deterministic link selection
765 * Consumes the buffer chain, except when returning -ELINKCONG
766 * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE
768 int tipc_link_xmit(struct sk_buff
*buf
, u32 dnode
, u32 selector
)
770 struct tipc_link
*link
= NULL
;
771 struct tipc_node
*node
;
772 int rc
= -EHOSTUNREACH
;
774 node
= tipc_node_find(dnode
);
776 tipc_node_lock(node
);
777 link
= node
->active_links
[selector
& 1];
779 rc
= __tipc_link_xmit(link
, buf
);
780 tipc_node_unlock(node
);
786 if (likely(in_own_node(dnode
)))
787 return tipc_sk_rcv(buf
);
794 * tipc_link_sync_xmit - synchronize broadcast link endpoints.
796 * Give a newly added peer node the sequence number where it should
797 * start receiving and acking broadcast packets.
799 * Called with node locked
801 static void tipc_link_sync_xmit(struct tipc_link
*link
)
804 struct tipc_msg
*msg
;
806 buf
= tipc_buf_acquire(INT_H_SIZE
);
811 tipc_msg_init(msg
, BCAST_PROTOCOL
, STATE_MSG
, INT_H_SIZE
, link
->addr
);
812 msg_set_last_bcast(msg
, link
->owner
->bclink
.acked
);
813 __tipc_link_xmit(link
, buf
);
817 * tipc_link_sync_rcv - synchronize broadcast link endpoints.
818 * Receive the sequence number where we should start receiving and
819 * acking broadcast packets from a newly added peer node, and open
820 * up for reception of such packets.
822 * Called with node locked
824 static void tipc_link_sync_rcv(struct tipc_node
*n
, struct sk_buff
*buf
)
826 struct tipc_msg
*msg
= buf_msg(buf
);
828 n
->bclink
.last_sent
= n
->bclink
.last_in
= msg_last_bcast(msg
);
829 n
->bclink
.recv_permitted
= true;
833 struct sk_buff
*tipc_skb_queue_next(const struct sk_buff_head
*list
,
834 const struct sk_buff
*skb
)
836 if (skb_queue_is_last(list
, skb
))
842 * tipc_link_push_packets - push unsent packets to bearer
844 * Push out the unsent messages of a link where congestion
845 * has abated. Node is locked.
847 * Called with node locked
849 void tipc_link_push_packets(struct tipc_link
*l_ptr
)
851 struct sk_buff_head
*outqueue
= &l_ptr
->outqueue
;
852 struct sk_buff
*skb
= l_ptr
->next_out
;
853 struct tipc_msg
*msg
;
856 skb_queue_walk_from(outqueue
, skb
) {
858 next
= msg_seqno(msg
);
859 first
= buf_seqno(skb_peek(outqueue
));
861 if (mod(next
- first
) < l_ptr
->queue_limit
[0]) {
862 msg_set_ack(msg
, mod(l_ptr
->next_in_no
- 1));
863 msg_set_bcast_ack(msg
, l_ptr
->owner
->bclink
.last_in
);
864 if (msg_user(msg
) == MSG_BUNDLER
)
865 TIPC_SKB_CB(skb
)->bundling
= false;
866 tipc_bearer_send(l_ptr
->bearer_id
, skb
,
868 l_ptr
->next_out
= tipc_skb_queue_next(outqueue
, skb
);
875 void tipc_link_reset_all(struct tipc_node
*node
)
877 char addr_string
[16];
880 tipc_node_lock(node
);
882 pr_warn("Resetting all links to %s\n",
883 tipc_addr_string_fill(addr_string
, node
->addr
));
885 for (i
= 0; i
< MAX_BEARERS
; i
++) {
886 if (node
->links
[i
]) {
887 link_print(node
->links
[i
], "Resetting link\n");
888 tipc_link_reset(node
->links
[i
]);
892 tipc_node_unlock(node
);
895 static void link_retransmit_failure(struct tipc_link
*l_ptr
,
898 struct tipc_msg
*msg
= buf_msg(buf
);
900 pr_warn("Retransmission failure on link <%s>\n", l_ptr
->name
);
903 /* Handle failure on standard link */
904 link_print(l_ptr
, "Resetting link\n");
905 tipc_link_reset(l_ptr
);
908 /* Handle failure on broadcast link */
909 struct tipc_node
*n_ptr
;
910 char addr_string
[16];
912 pr_info("Msg seq number: %u, ", msg_seqno(msg
));
913 pr_cont("Outstanding acks: %lu\n",
914 (unsigned long) TIPC_SKB_CB(buf
)->handle
);
916 n_ptr
= tipc_bclink_retransmit_to();
917 tipc_node_lock(n_ptr
);
919 tipc_addr_string_fill(addr_string
, n_ptr
->addr
);
920 pr_info("Broadcast link info for %s\n", addr_string
);
921 pr_info("Reception permitted: %d, Acked: %u\n",
922 n_ptr
->bclink
.recv_permitted
,
923 n_ptr
->bclink
.acked
);
924 pr_info("Last in: %u, Oos state: %u, Last sent: %u\n",
925 n_ptr
->bclink
.last_in
,
926 n_ptr
->bclink
.oos_state
,
927 n_ptr
->bclink
.last_sent
);
929 tipc_node_unlock(n_ptr
);
931 tipc_bclink_set_flags(TIPC_BCLINK_RESET
);
932 l_ptr
->stale_count
= 0;
936 void tipc_link_retransmit(struct tipc_link
*l_ptr
, struct sk_buff
*skb
,
939 struct tipc_msg
*msg
;
946 /* Detect repeated retransmit failures */
947 if (l_ptr
->last_retransmitted
== msg_seqno(msg
)) {
948 if (++l_ptr
->stale_count
> 100) {
949 link_retransmit_failure(l_ptr
, skb
);
953 l_ptr
->last_retransmitted
= msg_seqno(msg
);
954 l_ptr
->stale_count
= 1;
957 skb_queue_walk_from(&l_ptr
->outqueue
, skb
) {
958 if (!retransmits
|| skb
== l_ptr
->next_out
)
961 msg_set_ack(msg
, mod(l_ptr
->next_in_no
- 1));
962 msg_set_bcast_ack(msg
, l_ptr
->owner
->bclink
.last_in
);
963 tipc_bearer_send(l_ptr
->bearer_id
, skb
, &l_ptr
->media_addr
);
965 l_ptr
->stats
.retransmitted
++;
969 static void link_retrieve_defq(struct tipc_link
*link
,
970 struct sk_buff_head
*list
)
974 if (skb_queue_empty(&link
->deferred_queue
))
977 seq_no
= buf_seqno(skb_peek(&link
->deferred_queue
));
978 if (seq_no
== mod(link
->next_in_no
))
979 skb_queue_splice_tail_init(&link
->deferred_queue
, list
);
983 * link_recv_buf_validate - validate basic format of received message
985 * This routine ensures a TIPC message has an acceptable header, and at least
986 * as much data as the header indicates it should. The routine also ensures
987 * that the entire message header is stored in the main fragment of the message
988 * buffer, to simplify future access to message header fields.
990 * Note: Having extra info present in the message header or data areas is OK.
991 * TIPC will ignore the excess, under the assumption that it is optional info
992 * introduced by a later release of the protocol.
994 static int link_recv_buf_validate(struct sk_buff
*buf
)
996 static u32 min_data_hdr_size
[8] = {
997 SHORT_H_SIZE
, MCAST_H_SIZE
, NAMED_H_SIZE
, BASIC_H_SIZE
,
998 MAX_H_SIZE
, MAX_H_SIZE
, MAX_H_SIZE
, MAX_H_SIZE
1001 struct tipc_msg
*msg
;
1007 /* If this packet comes from the defer queue, the skb has already
1010 if (unlikely(TIPC_SKB_CB(buf
)->deferred
))
1013 if (unlikely(buf
->len
< MIN_H_SIZE
))
1016 msg
= skb_header_pointer(buf
, 0, sizeof(tipc_hdr
), tipc_hdr
);
1020 if (unlikely(msg_version(msg
) != TIPC_VERSION
))
1023 size
= msg_size(msg
);
1024 hdr_size
= msg_hdr_sz(msg
);
1025 min_hdr_size
= msg_isdata(msg
) ?
1026 min_data_hdr_size
[msg_type(msg
)] : INT_H_SIZE
;
1028 if (unlikely((hdr_size
< min_hdr_size
) ||
1029 (size
< hdr_size
) ||
1030 (buf
->len
< size
) ||
1031 (size
- hdr_size
> TIPC_MAX_USER_MSG_SIZE
)))
1034 return pskb_may_pull(buf
, hdr_size
);
1038 * tipc_rcv - process TIPC packets/messages arriving from off-node
1040 * @b_ptr: pointer to bearer message arrived on
1042 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1043 * structure (i.e. cannot be NULL), but bearer can be inactive.
1045 void tipc_rcv(struct sk_buff
*skb
, struct tipc_bearer
*b_ptr
)
1047 struct sk_buff_head head
;
1048 struct tipc_node
*n_ptr
;
1049 struct tipc_link
*l_ptr
;
1050 struct sk_buff
*skb1
, *tmp
;
1051 struct tipc_msg
*msg
;
1056 __skb_queue_head_init(&head
);
1057 __skb_queue_tail(&head
, skb
);
1059 while ((skb
= __skb_dequeue(&head
))) {
1060 /* Ensure message is well-formed */
1061 if (unlikely(!link_recv_buf_validate(skb
)))
1064 /* Ensure message data is a single contiguous unit */
1065 if (unlikely(skb_linearize(skb
)))
1068 /* Handle arrival of a non-unicast link message */
1071 if (unlikely(msg_non_seq(msg
))) {
1072 if (msg_user(msg
) == LINK_CONFIG
)
1073 tipc_disc_rcv(skb
, b_ptr
);
1075 tipc_bclink_rcv(skb
);
1079 /* Discard unicast link messages destined for another node */
1080 if (unlikely(!msg_short(msg
) &&
1081 (msg_destnode(msg
) != tipc_own_addr
)))
1084 /* Locate neighboring node that sent message */
1085 n_ptr
= tipc_node_find(msg_prevnode(msg
));
1086 if (unlikely(!n_ptr
))
1088 tipc_node_lock(n_ptr
);
1090 /* Locate unicast link endpoint that should handle message */
1091 l_ptr
= n_ptr
->links
[b_ptr
->identity
];
1092 if (unlikely(!l_ptr
))
1093 goto unlock_discard
;
1095 /* Verify that communication with node is currently allowed */
1096 if ((n_ptr
->action_flags
& TIPC_WAIT_PEER_LINKS_DOWN
) &&
1097 msg_user(msg
) == LINK_PROTOCOL
&&
1098 (msg_type(msg
) == RESET_MSG
||
1099 msg_type(msg
) == ACTIVATE_MSG
) &&
1100 !msg_redundant_link(msg
))
1101 n_ptr
->action_flags
&= ~TIPC_WAIT_PEER_LINKS_DOWN
;
1103 if (tipc_node_blocked(n_ptr
))
1104 goto unlock_discard
;
1106 /* Validate message sequence number info */
1107 seq_no
= msg_seqno(msg
);
1108 ackd
= msg_ack(msg
);
1110 /* Release acked messages */
1111 if (n_ptr
->bclink
.recv_permitted
)
1112 tipc_bclink_acknowledge(n_ptr
, msg_bcast_ack(msg
));
1115 skb_queue_walk_safe(&l_ptr
->outqueue
, skb1
, tmp
) {
1116 if (skb1
== l_ptr
->next_out
||
1117 more(buf_seqno(skb1
), ackd
))
1119 __skb_unlink(skb1
, &l_ptr
->outqueue
);
1124 /* Try sending any messages link endpoint has pending */
1125 if (unlikely(l_ptr
->next_out
))
1126 tipc_link_push_packets(l_ptr
);
1128 if (released
&& !skb_queue_empty(&l_ptr
->waiting_sks
)) {
1129 link_prepare_wakeup(l_ptr
);
1130 l_ptr
->owner
->action_flags
|= TIPC_WAKEUP_USERS
;
1133 /* Process the incoming packet */
1134 if (unlikely(!link_working_working(l_ptr
))) {
1135 if (msg_user(msg
) == LINK_PROTOCOL
) {
1136 tipc_link_proto_rcv(l_ptr
, skb
);
1137 link_retrieve_defq(l_ptr
, &head
);
1138 tipc_node_unlock(n_ptr
);
1142 /* Traffic message. Conditionally activate link */
1143 link_state_event(l_ptr
, TRAFFIC_MSG_EVT
);
1145 if (link_working_working(l_ptr
)) {
1146 /* Re-insert buffer in front of queue */
1147 __skb_queue_head(&head
, skb
);
1148 tipc_node_unlock(n_ptr
);
1151 goto unlock_discard
;
1154 /* Link is now in state WORKING_WORKING */
1155 if (unlikely(seq_no
!= mod(l_ptr
->next_in_no
))) {
1156 link_handle_out_of_seq_msg(l_ptr
, skb
);
1157 link_retrieve_defq(l_ptr
, &head
);
1158 tipc_node_unlock(n_ptr
);
1161 l_ptr
->next_in_no
++;
1162 if (unlikely(!skb_queue_empty(&l_ptr
->deferred_queue
)))
1163 link_retrieve_defq(l_ptr
, &head
);
1165 if (unlikely(++l_ptr
->unacked_window
>= TIPC_MIN_LINK_WIN
)) {
1166 l_ptr
->stats
.sent_acks
++;
1167 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 0, 0, 0, 0, 0);
1170 if (tipc_link_prepare_input(l_ptr
, &skb
)) {
1171 tipc_node_unlock(n_ptr
);
1174 tipc_node_unlock(n_ptr
);
1176 if (tipc_link_input(l_ptr
, skb
) != 0)
1180 tipc_node_unlock(n_ptr
);
1187 * tipc_link_prepare_input - process TIPC link messages
1189 * returns nonzero if the message was consumed
1191 * Node lock must be held
1193 static int tipc_link_prepare_input(struct tipc_link
*l
, struct sk_buff
**buf
)
1195 struct tipc_node
*n
;
1196 struct tipc_msg
*msg
;
1200 msg
= buf_msg(*buf
);
1201 switch (msg_user(msg
)) {
1202 case CHANGEOVER_PROTOCOL
:
1203 if (tipc_link_tunnel_rcv(n
, buf
))
1206 case MSG_FRAGMENTER
:
1207 l
->stats
.recv_fragments
++;
1208 if (tipc_buf_append(&l
->reasm_buf
, buf
)) {
1209 l
->stats
.recv_fragmented
++;
1211 } else if (!l
->reasm_buf
) {
1216 l
->stats
.recv_bundles
++;
1217 l
->stats
.recv_bundled
+= msg_msgcnt(msg
);
1220 case NAME_DISTRIBUTOR
:
1221 n
->bclink
.recv_permitted
= true;
1224 case BCAST_PROTOCOL
:
1225 tipc_link_sync_rcv(n
, *buf
);
1233 * tipc_link_input - Deliver message too higher layers
1235 static int tipc_link_input(struct tipc_link
*l
, struct sk_buff
*buf
)
1237 struct tipc_msg
*msg
= buf_msg(buf
);
1240 switch (msg_user(msg
)) {
1241 case TIPC_LOW_IMPORTANCE
:
1242 case TIPC_MEDIUM_IMPORTANCE
:
1243 case TIPC_HIGH_IMPORTANCE
:
1244 case TIPC_CRITICAL_IMPORTANCE
:
1248 case NAME_DISTRIBUTOR
:
1249 tipc_named_rcv(buf
);
1252 tipc_link_bundle_rcv(buf
);
1261 * tipc_link_defer_pkt - Add out-of-sequence message to deferred reception queue
1263 * Returns increase in queue length (i.e. 0 or 1)
1265 u32
tipc_link_defer_pkt(struct sk_buff_head
*list
, struct sk_buff
*skb
)
1267 struct sk_buff
*skb1
;
1268 u32 seq_no
= buf_seqno(skb
);
1271 if (skb_queue_empty(list
)) {
1272 __skb_queue_tail(list
, skb
);
1277 if (less(buf_seqno(skb_peek_tail(list
)), seq_no
)) {
1278 __skb_queue_tail(list
, skb
);
1282 /* Locate insertion point in queue, then insert; discard if duplicate */
1283 skb_queue_walk(list
, skb1
) {
1284 u32 curr_seqno
= buf_seqno(skb1
);
1286 if (seq_no
== curr_seqno
) {
1291 if (less(seq_no
, curr_seqno
))
1295 __skb_queue_before(list
, skb1
, skb
);
1300 * link_handle_out_of_seq_msg - handle arrival of out-of-sequence packet
1302 static void link_handle_out_of_seq_msg(struct tipc_link
*l_ptr
,
1303 struct sk_buff
*buf
)
1305 u32 seq_no
= buf_seqno(buf
);
1307 if (likely(msg_user(buf_msg(buf
)) == LINK_PROTOCOL
)) {
1308 tipc_link_proto_rcv(l_ptr
, buf
);
1312 /* Record OOS packet arrival (force mismatch on next timeout) */
1313 l_ptr
->checkpoint
--;
1316 * Discard packet if a duplicate; otherwise add it to deferred queue
1317 * and notify peer of gap as per protocol specification
1319 if (less(seq_no
, mod(l_ptr
->next_in_no
))) {
1320 l_ptr
->stats
.duplicates
++;
1325 if (tipc_link_defer_pkt(&l_ptr
->deferred_queue
, buf
)) {
1326 l_ptr
->stats
.deferred_recv
++;
1327 TIPC_SKB_CB(buf
)->deferred
= true;
1328 if ((skb_queue_len(&l_ptr
->deferred_queue
) % 16) == 1)
1329 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 0, 0, 0, 0, 0);
1331 l_ptr
->stats
.duplicates
++;
1336 * Send protocol message to the other endpoint.
1338 void tipc_link_proto_xmit(struct tipc_link
*l_ptr
, u32 msg_typ
, int probe_msg
,
1339 u32 gap
, u32 tolerance
, u32 priority
, u32 ack_mtu
)
1341 struct sk_buff
*buf
= NULL
;
1342 struct tipc_msg
*msg
= l_ptr
->pmsg
;
1343 u32 msg_size
= sizeof(l_ptr
->proto_msg
);
1346 /* Don't send protocol message during link changeover */
1347 if (l_ptr
->exp_msg_count
)
1350 /* Abort non-RESET send if communication with node is prohibited */
1351 if ((tipc_node_blocked(l_ptr
->owner
)) && (msg_typ
!= RESET_MSG
))
1354 /* Create protocol message with "out-of-sequence" sequence number */
1355 msg_set_type(msg
, msg_typ
);
1356 msg_set_net_plane(msg
, l_ptr
->net_plane
);
1357 msg_set_bcast_ack(msg
, l_ptr
->owner
->bclink
.last_in
);
1358 msg_set_last_bcast(msg
, tipc_bclink_get_last_sent());
1360 if (msg_typ
== STATE_MSG
) {
1361 u32 next_sent
= mod(l_ptr
->next_out_no
);
1363 if (!tipc_link_is_up(l_ptr
))
1365 if (l_ptr
->next_out
)
1366 next_sent
= buf_seqno(l_ptr
->next_out
);
1367 msg_set_next_sent(msg
, next_sent
);
1368 if (!skb_queue_empty(&l_ptr
->deferred_queue
)) {
1369 u32 rec
= buf_seqno(skb_peek(&l_ptr
->deferred_queue
));
1370 gap
= mod(rec
- mod(l_ptr
->next_in_no
));
1372 msg_set_seq_gap(msg
, gap
);
1374 l_ptr
->stats
.sent_nacks
++;
1375 msg_set_link_tolerance(msg
, tolerance
);
1376 msg_set_linkprio(msg
, priority
);
1377 msg_set_max_pkt(msg
, ack_mtu
);
1378 msg_set_ack(msg
, mod(l_ptr
->next_in_no
- 1));
1379 msg_set_probe(msg
, probe_msg
!= 0);
1381 u32 mtu
= l_ptr
->max_pkt
;
1383 if ((mtu
< l_ptr
->max_pkt_target
) &&
1384 link_working_working(l_ptr
) &&
1385 l_ptr
->fsm_msg_cnt
) {
1386 msg_size
= (mtu
+ (l_ptr
->max_pkt_target
- mtu
)/2 + 2) & ~3;
1387 if (l_ptr
->max_pkt_probes
== 10) {
1388 l_ptr
->max_pkt_target
= (msg_size
- 4);
1389 l_ptr
->max_pkt_probes
= 0;
1390 msg_size
= (mtu
+ (l_ptr
->max_pkt_target
- mtu
)/2 + 2) & ~3;
1392 l_ptr
->max_pkt_probes
++;
1395 l_ptr
->stats
.sent_probes
++;
1397 l_ptr
->stats
.sent_states
++;
1398 } else { /* RESET_MSG or ACTIVATE_MSG */
1399 msg_set_ack(msg
, mod(l_ptr
->reset_checkpoint
- 1));
1400 msg_set_seq_gap(msg
, 0);
1401 msg_set_next_sent(msg
, 1);
1402 msg_set_probe(msg
, 0);
1403 msg_set_link_tolerance(msg
, l_ptr
->tolerance
);
1404 msg_set_linkprio(msg
, l_ptr
->priority
);
1405 msg_set_max_pkt(msg
, l_ptr
->max_pkt_target
);
1408 r_flag
= (l_ptr
->owner
->working_links
> tipc_link_is_up(l_ptr
));
1409 msg_set_redundant_link(msg
, r_flag
);
1410 msg_set_linkprio(msg
, l_ptr
->priority
);
1411 msg_set_size(msg
, msg_size
);
1413 msg_set_seqno(msg
, mod(l_ptr
->next_out_no
+ (0xffff/2)));
1415 buf
= tipc_buf_acquire(msg_size
);
1419 skb_copy_to_linear_data(buf
, msg
, sizeof(l_ptr
->proto_msg
));
1420 buf
->priority
= TC_PRIO_CONTROL
;
1422 tipc_bearer_send(l_ptr
->bearer_id
, buf
, &l_ptr
->media_addr
);
1423 l_ptr
->unacked_window
= 0;
1428 * Receive protocol message :
1429 * Note that network plane id propagates through the network, and may
1430 * change at any time. The node with lowest address rules
1432 static void tipc_link_proto_rcv(struct tipc_link
*l_ptr
, struct sk_buff
*buf
)
1438 struct tipc_msg
*msg
= buf_msg(buf
);
1440 /* Discard protocol message during link changeover */
1441 if (l_ptr
->exp_msg_count
)
1444 if (l_ptr
->net_plane
!= msg_net_plane(msg
))
1445 if (tipc_own_addr
> msg_prevnode(msg
))
1446 l_ptr
->net_plane
= msg_net_plane(msg
);
1448 switch (msg_type(msg
)) {
1451 if (!link_working_unknown(l_ptr
) &&
1452 (l_ptr
->peer_session
!= INVALID_SESSION
)) {
1453 if (less_eq(msg_session(msg
), l_ptr
->peer_session
))
1454 break; /* duplicate or old reset: ignore */
1457 if (!msg_redundant_link(msg
) && (link_working_working(l_ptr
) ||
1458 link_working_unknown(l_ptr
))) {
1460 * peer has lost contact -- don't allow peer's links
1461 * to reactivate before we recognize loss & clean up
1463 l_ptr
->owner
->action_flags
|= TIPC_WAIT_OWN_LINKS_DOWN
;
1466 link_state_event(l_ptr
, RESET_MSG
);
1470 /* Update link settings according other endpoint's values */
1471 strcpy((strrchr(l_ptr
->name
, ':') + 1), (char *)msg_data(msg
));
1473 msg_tol
= msg_link_tolerance(msg
);
1474 if (msg_tol
> l_ptr
->tolerance
)
1475 link_set_supervision_props(l_ptr
, msg_tol
);
1477 if (msg_linkprio(msg
) > l_ptr
->priority
)
1478 l_ptr
->priority
= msg_linkprio(msg
);
1480 max_pkt_info
= msg_max_pkt(msg
);
1482 if (max_pkt_info
< l_ptr
->max_pkt_target
)
1483 l_ptr
->max_pkt_target
= max_pkt_info
;
1484 if (l_ptr
->max_pkt
> l_ptr
->max_pkt_target
)
1485 l_ptr
->max_pkt
= l_ptr
->max_pkt_target
;
1487 l_ptr
->max_pkt
= l_ptr
->max_pkt_target
;
1490 /* Synchronize broadcast link info, if not done previously */
1491 if (!tipc_node_is_up(l_ptr
->owner
)) {
1492 l_ptr
->owner
->bclink
.last_sent
=
1493 l_ptr
->owner
->bclink
.last_in
=
1494 msg_last_bcast(msg
);
1495 l_ptr
->owner
->bclink
.oos_state
= 0;
1498 l_ptr
->peer_session
= msg_session(msg
);
1499 l_ptr
->peer_bearer_id
= msg_bearer_id(msg
);
1501 if (msg_type(msg
) == ACTIVATE_MSG
)
1502 link_state_event(l_ptr
, ACTIVATE_MSG
);
1506 msg_tol
= msg_link_tolerance(msg
);
1508 link_set_supervision_props(l_ptr
, msg_tol
);
1510 if (msg_linkprio(msg
) &&
1511 (msg_linkprio(msg
) != l_ptr
->priority
)) {
1512 pr_warn("%s<%s>, priority change %u->%u\n",
1513 link_rst_msg
, l_ptr
->name
, l_ptr
->priority
,
1515 l_ptr
->priority
= msg_linkprio(msg
);
1516 tipc_link_reset(l_ptr
); /* Enforce change to take effect */
1520 /* Record reception; force mismatch at next timeout: */
1521 l_ptr
->checkpoint
--;
1523 link_state_event(l_ptr
, TRAFFIC_MSG_EVT
);
1524 l_ptr
->stats
.recv_states
++;
1525 if (link_reset_unknown(l_ptr
))
1528 if (less_eq(mod(l_ptr
->next_in_no
), msg_next_sent(msg
))) {
1529 rec_gap
= mod(msg_next_sent(msg
) -
1530 mod(l_ptr
->next_in_no
));
1533 max_pkt_ack
= msg_max_pkt(msg
);
1534 if (max_pkt_ack
> l_ptr
->max_pkt
) {
1535 l_ptr
->max_pkt
= max_pkt_ack
;
1536 l_ptr
->max_pkt_probes
= 0;
1540 if (msg_probe(msg
)) {
1541 l_ptr
->stats
.recv_probes
++;
1542 if (msg_size(msg
) > sizeof(l_ptr
->proto_msg
))
1543 max_pkt_ack
= msg_size(msg
);
1546 /* Protocol message before retransmits, reduce loss risk */
1547 if (l_ptr
->owner
->bclink
.recv_permitted
)
1548 tipc_bclink_update_link_state(l_ptr
->owner
,
1549 msg_last_bcast(msg
));
1551 if (rec_gap
|| (msg_probe(msg
))) {
1552 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 0, rec_gap
, 0,
1555 if (msg_seq_gap(msg
)) {
1556 l_ptr
->stats
.recv_nacks
++;
1557 tipc_link_retransmit(l_ptr
, skb_peek(&l_ptr
->outqueue
),
1567 /* tipc_link_tunnel_xmit(): Tunnel one packet via a link belonging to
1568 * a different bearer. Owner node is locked.
1570 static void tipc_link_tunnel_xmit(struct tipc_link
*l_ptr
,
1571 struct tipc_msg
*tunnel_hdr
,
1572 struct tipc_msg
*msg
,
1575 struct tipc_link
*tunnel
;
1576 struct sk_buff
*buf
;
1577 u32 length
= msg_size(msg
);
1579 tunnel
= l_ptr
->owner
->active_links
[selector
& 1];
1580 if (!tipc_link_is_up(tunnel
)) {
1581 pr_warn("%stunnel link no longer available\n", link_co_err
);
1584 msg_set_size(tunnel_hdr
, length
+ INT_H_SIZE
);
1585 buf
= tipc_buf_acquire(length
+ INT_H_SIZE
);
1587 pr_warn("%sunable to send tunnel msg\n", link_co_err
);
1590 skb_copy_to_linear_data(buf
, tunnel_hdr
, INT_H_SIZE
);
1591 skb_copy_to_linear_data_offset(buf
, INT_H_SIZE
, msg
, length
);
1592 __tipc_link_xmit(tunnel
, buf
);
1596 /* tipc_link_failover_send_queue(): A link has gone down, but a second
1597 * link is still active. We can do failover. Tunnel the failing link's
1598 * whole send queue via the remaining link. This way, we don't lose
1599 * any packets, and sequence order is preserved for subsequent traffic
1600 * sent over the remaining link. Owner node is locked.
1602 void tipc_link_failover_send_queue(struct tipc_link
*l_ptr
)
1604 u32 msgcount
= skb_queue_len(&l_ptr
->outqueue
);
1605 struct tipc_link
*tunnel
= l_ptr
->owner
->active_links
[0];
1606 struct tipc_msg tunnel_hdr
;
1607 struct sk_buff
*skb
;
1613 tipc_msg_init(&tunnel_hdr
, CHANGEOVER_PROTOCOL
,
1614 ORIGINAL_MSG
, INT_H_SIZE
, l_ptr
->addr
);
1615 msg_set_bearer_id(&tunnel_hdr
, l_ptr
->peer_bearer_id
);
1616 msg_set_msgcnt(&tunnel_hdr
, msgcount
);
1618 if (skb_queue_empty(&l_ptr
->outqueue
)) {
1619 skb
= tipc_buf_acquire(INT_H_SIZE
);
1621 skb_copy_to_linear_data(skb
, &tunnel_hdr
, INT_H_SIZE
);
1622 msg_set_size(&tunnel_hdr
, INT_H_SIZE
);
1623 __tipc_link_xmit(tunnel
, skb
);
1625 pr_warn("%sunable to send changeover msg\n",
1631 split_bundles
= (l_ptr
->owner
->active_links
[0] !=
1632 l_ptr
->owner
->active_links
[1]);
1634 skb_queue_walk(&l_ptr
->outqueue
, skb
) {
1635 struct tipc_msg
*msg
= buf_msg(skb
);
1637 if ((msg_user(msg
) == MSG_BUNDLER
) && split_bundles
) {
1638 struct tipc_msg
*m
= msg_get_wrapped(msg
);
1639 unchar
*pos
= (unchar
*)m
;
1641 msgcount
= msg_msgcnt(msg
);
1642 while (msgcount
--) {
1643 msg_set_seqno(m
, msg_seqno(msg
));
1644 tipc_link_tunnel_xmit(l_ptr
, &tunnel_hdr
, m
,
1645 msg_link_selector(m
));
1646 pos
+= align(msg_size(m
));
1647 m
= (struct tipc_msg
*)pos
;
1650 tipc_link_tunnel_xmit(l_ptr
, &tunnel_hdr
, msg
,
1651 msg_link_selector(msg
));
1656 /* tipc_link_dup_queue_xmit(): A second link has become active. Tunnel a
1657 * duplicate of the first link's send queue via the new link. This way, we
1658 * are guaranteed that currently queued packets from a socket are delivered
1659 * before future traffic from the same socket, even if this is using the
1660 * new link. The last arriving copy of each duplicate packet is dropped at
1661 * the receiving end by the regular protocol check, so packet cardinality
1662 * and sequence order is preserved per sender/receiver socket pair.
1663 * Owner node is locked.
1665 void tipc_link_dup_queue_xmit(struct tipc_link
*l_ptr
,
1666 struct tipc_link
*tunnel
)
1668 struct sk_buff
*skb
;
1669 struct tipc_msg tunnel_hdr
;
1671 tipc_msg_init(&tunnel_hdr
, CHANGEOVER_PROTOCOL
,
1672 DUPLICATE_MSG
, INT_H_SIZE
, l_ptr
->addr
);
1673 msg_set_msgcnt(&tunnel_hdr
, skb_queue_len(&l_ptr
->outqueue
));
1674 msg_set_bearer_id(&tunnel_hdr
, l_ptr
->peer_bearer_id
);
1675 skb_queue_walk(&l_ptr
->outqueue
, skb
) {
1676 struct sk_buff
*outskb
;
1677 struct tipc_msg
*msg
= buf_msg(skb
);
1678 u32 length
= msg_size(msg
);
1680 if (msg_user(msg
) == MSG_BUNDLER
)
1681 msg_set_type(msg
, CLOSED_MSG
);
1682 msg_set_ack(msg
, mod(l_ptr
->next_in_no
- 1)); /* Update */
1683 msg_set_bcast_ack(msg
, l_ptr
->owner
->bclink
.last_in
);
1684 msg_set_size(&tunnel_hdr
, length
+ INT_H_SIZE
);
1685 outskb
= tipc_buf_acquire(length
+ INT_H_SIZE
);
1686 if (outskb
== NULL
) {
1687 pr_warn("%sunable to send duplicate msg\n",
1691 skb_copy_to_linear_data(outskb
, &tunnel_hdr
, INT_H_SIZE
);
1692 skb_copy_to_linear_data_offset(outskb
, INT_H_SIZE
, skb
->data
,
1694 __tipc_link_xmit(tunnel
, outskb
);
1695 if (!tipc_link_is_up(l_ptr
))
1701 * buf_extract - extracts embedded TIPC message from another message
1702 * @skb: encapsulating message buffer
1703 * @from_pos: offset to extract from
1705 * Returns a new message buffer containing an embedded message. The
1706 * encapsulating message itself is left unchanged.
1708 static struct sk_buff
*buf_extract(struct sk_buff
*skb
, u32 from_pos
)
1710 struct tipc_msg
*msg
= (struct tipc_msg
*)(skb
->data
+ from_pos
);
1711 u32 size
= msg_size(msg
);
1714 eb
= tipc_buf_acquire(size
);
1716 skb_copy_to_linear_data(eb
, msg
, size
);
1722 /* tipc_link_dup_rcv(): Receive a tunnelled DUPLICATE_MSG packet.
1723 * Owner node is locked.
1725 static void tipc_link_dup_rcv(struct tipc_link
*l_ptr
,
1726 struct sk_buff
*t_buf
)
1728 struct sk_buff
*buf
;
1730 if (!tipc_link_is_up(l_ptr
))
1733 buf
= buf_extract(t_buf
, INT_H_SIZE
);
1735 pr_warn("%sfailed to extract inner dup pkt\n", link_co_err
);
1739 /* Add buffer to deferred queue, if applicable: */
1740 link_handle_out_of_seq_msg(l_ptr
, buf
);
1743 /* tipc_link_failover_rcv(): Receive a tunnelled ORIGINAL_MSG packet
1744 * Owner node is locked.
1746 static struct sk_buff
*tipc_link_failover_rcv(struct tipc_link
*l_ptr
,
1747 struct sk_buff
*t_buf
)
1749 struct tipc_msg
*t_msg
= buf_msg(t_buf
);
1750 struct sk_buff
*buf
= NULL
;
1751 struct tipc_msg
*msg
;
1753 if (tipc_link_is_up(l_ptr
))
1754 tipc_link_reset(l_ptr
);
1756 /* First failover packet? */
1757 if (l_ptr
->exp_msg_count
== START_CHANGEOVER
)
1758 l_ptr
->exp_msg_count
= msg_msgcnt(t_msg
);
1760 /* Should there be an inner packet? */
1761 if (l_ptr
->exp_msg_count
) {
1762 l_ptr
->exp_msg_count
--;
1763 buf
= buf_extract(t_buf
, INT_H_SIZE
);
1765 pr_warn("%sno inner failover pkt\n", link_co_err
);
1770 if (less(msg_seqno(msg
), l_ptr
->reset_checkpoint
)) {
1775 if (msg_user(msg
) == MSG_FRAGMENTER
) {
1776 l_ptr
->stats
.recv_fragments
++;
1777 tipc_buf_append(&l_ptr
->reasm_buf
, &buf
);
1781 if ((l_ptr
->exp_msg_count
== 0) && (l_ptr
->flags
& LINK_STOPPED
)) {
1782 tipc_node_detach_link(l_ptr
->owner
, l_ptr
);
1788 /* tipc_link_tunnel_rcv(): Receive a tunnelled packet, sent
1789 * via other link as result of a failover (ORIGINAL_MSG) or
1790 * a new active link (DUPLICATE_MSG). Failover packets are
1791 * returned to the active link for delivery upwards.
1792 * Owner node is locked.
1794 static int tipc_link_tunnel_rcv(struct tipc_node
*n_ptr
,
1795 struct sk_buff
**buf
)
1797 struct sk_buff
*t_buf
= *buf
;
1798 struct tipc_link
*l_ptr
;
1799 struct tipc_msg
*t_msg
= buf_msg(t_buf
);
1800 u32 bearer_id
= msg_bearer_id(t_msg
);
1804 if (bearer_id
>= MAX_BEARERS
)
1807 l_ptr
= n_ptr
->links
[bearer_id
];
1811 if (msg_type(t_msg
) == DUPLICATE_MSG
)
1812 tipc_link_dup_rcv(l_ptr
, t_buf
);
1813 else if (msg_type(t_msg
) == ORIGINAL_MSG
)
1814 *buf
= tipc_link_failover_rcv(l_ptr
, t_buf
);
1816 pr_warn("%sunknown tunnel pkt received\n", link_co_err
);
1819 return *buf
!= NULL
;
1823 * Bundler functionality:
1825 void tipc_link_bundle_rcv(struct sk_buff
*buf
)
1827 u32 msgcount
= msg_msgcnt(buf_msg(buf
));
1828 u32 pos
= INT_H_SIZE
;
1829 struct sk_buff
*obuf
;
1830 struct tipc_msg
*omsg
;
1832 while (msgcount
--) {
1833 obuf
= buf_extract(buf
, pos
);
1835 pr_warn("Link unable to unbundle message(s)\n");
1838 omsg
= buf_msg(obuf
);
1839 pos
+= align(msg_size(omsg
));
1840 if (msg_isdata(omsg
)) {
1841 if (unlikely(msg_type(omsg
) == TIPC_MCAST_MSG
))
1842 tipc_sk_mcast_rcv(obuf
);
1845 } else if (msg_user(omsg
) == CONN_MANAGER
) {
1847 } else if (msg_user(omsg
) == NAME_DISTRIBUTOR
) {
1848 tipc_named_rcv(obuf
);
1850 pr_warn("Illegal bundled msg: %u\n", msg_user(omsg
));
1857 static void link_set_supervision_props(struct tipc_link
*l_ptr
, u32 tolerance
)
1859 if ((tolerance
< TIPC_MIN_LINK_TOL
) || (tolerance
> TIPC_MAX_LINK_TOL
))
1862 l_ptr
->tolerance
= tolerance
;
1863 l_ptr
->continuity_interval
=
1864 ((tolerance
/ 4) > 500) ? 500 : tolerance
/ 4;
1865 l_ptr
->abort_limit
= tolerance
/ (l_ptr
->continuity_interval
/ 4);
1868 void tipc_link_set_queue_limits(struct tipc_link
*l_ptr
, u32 window
)
1870 /* Data messages from this node, inclusive FIRST_FRAGM */
1871 l_ptr
->queue_limit
[TIPC_LOW_IMPORTANCE
] = window
;
1872 l_ptr
->queue_limit
[TIPC_MEDIUM_IMPORTANCE
] = (window
/ 3) * 4;
1873 l_ptr
->queue_limit
[TIPC_HIGH_IMPORTANCE
] = (window
/ 3) * 5;
1874 l_ptr
->queue_limit
[TIPC_CRITICAL_IMPORTANCE
] = (window
/ 3) * 6;
1875 /* Transiting data messages,inclusive FIRST_FRAGM */
1876 l_ptr
->queue_limit
[TIPC_LOW_IMPORTANCE
+ 4] = 300;
1877 l_ptr
->queue_limit
[TIPC_MEDIUM_IMPORTANCE
+ 4] = 600;
1878 l_ptr
->queue_limit
[TIPC_HIGH_IMPORTANCE
+ 4] = 900;
1879 l_ptr
->queue_limit
[TIPC_CRITICAL_IMPORTANCE
+ 4] = 1200;
1880 l_ptr
->queue_limit
[CONN_MANAGER
] = 1200;
1881 l_ptr
->queue_limit
[CHANGEOVER_PROTOCOL
] = 2500;
1882 l_ptr
->queue_limit
[NAME_DISTRIBUTOR
] = 3000;
1883 /* FRAGMENT and LAST_FRAGMENT packets */
1884 l_ptr
->queue_limit
[MSG_FRAGMENTER
] = 4000;
1887 /* tipc_link_find_owner - locate owner node of link by link's name
1888 * @name: pointer to link name string
1889 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1891 * Returns pointer to node owning the link, or 0 if no matching link is found.
1893 static struct tipc_node
*tipc_link_find_owner(const char *link_name
,
1894 unsigned int *bearer_id
)
1896 struct tipc_link
*l_ptr
;
1897 struct tipc_node
*n_ptr
;
1898 struct tipc_node
*found_node
= 0;
1903 list_for_each_entry_rcu(n_ptr
, &tipc_node_list
, list
) {
1904 tipc_node_lock(n_ptr
);
1905 for (i
= 0; i
< MAX_BEARERS
; i
++) {
1906 l_ptr
= n_ptr
->links
[i
];
1907 if (l_ptr
&& !strcmp(l_ptr
->name
, link_name
)) {
1913 tipc_node_unlock(n_ptr
);
1923 * link_value_is_valid -- validate proposed link tolerance/priority/window
1925 * @cmd: value type (TIPC_CMD_SET_LINK_*)
1926 * @new_value: the new value
1928 * Returns 1 if value is within range, 0 if not.
1930 static int link_value_is_valid(u16 cmd
, u32 new_value
)
1933 case TIPC_CMD_SET_LINK_TOL
:
1934 return (new_value
>= TIPC_MIN_LINK_TOL
) &&
1935 (new_value
<= TIPC_MAX_LINK_TOL
);
1936 case TIPC_CMD_SET_LINK_PRI
:
1937 return (new_value
<= TIPC_MAX_LINK_PRI
);
1938 case TIPC_CMD_SET_LINK_WINDOW
:
1939 return (new_value
>= TIPC_MIN_LINK_WIN
) &&
1940 (new_value
<= TIPC_MAX_LINK_WIN
);
1946 * link_cmd_set_value - change priority/tolerance/window for link/bearer/media
1947 * @name: ptr to link, bearer, or media name
1948 * @new_value: new value of link, bearer, or media setting
1949 * @cmd: which link, bearer, or media attribute to set (TIPC_CMD_SET_LINK_*)
1951 * Caller must hold RTNL lock to ensure link/bearer/media is not deleted.
1953 * Returns 0 if value updated and negative value on error.
1955 static int link_cmd_set_value(const char *name
, u32 new_value
, u16 cmd
)
1957 struct tipc_node
*node
;
1958 struct tipc_link
*l_ptr
;
1959 struct tipc_bearer
*b_ptr
;
1960 struct tipc_media
*m_ptr
;
1964 node
= tipc_link_find_owner(name
, &bearer_id
);
1966 tipc_node_lock(node
);
1967 l_ptr
= node
->links
[bearer_id
];
1971 case TIPC_CMD_SET_LINK_TOL
:
1972 link_set_supervision_props(l_ptr
, new_value
);
1973 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 0, 0,
1976 case TIPC_CMD_SET_LINK_PRI
:
1977 l_ptr
->priority
= new_value
;
1978 tipc_link_proto_xmit(l_ptr
, STATE_MSG
, 0, 0,
1981 case TIPC_CMD_SET_LINK_WINDOW
:
1982 tipc_link_set_queue_limits(l_ptr
, new_value
);
1989 tipc_node_unlock(node
);
1993 b_ptr
= tipc_bearer_find(name
);
1996 case TIPC_CMD_SET_LINK_TOL
:
1997 b_ptr
->tolerance
= new_value
;
1999 case TIPC_CMD_SET_LINK_PRI
:
2000 b_ptr
->priority
= new_value
;
2002 case TIPC_CMD_SET_LINK_WINDOW
:
2003 b_ptr
->window
= new_value
;
2012 m_ptr
= tipc_media_find(name
);
2016 case TIPC_CMD_SET_LINK_TOL
:
2017 m_ptr
->tolerance
= new_value
;
2019 case TIPC_CMD_SET_LINK_PRI
:
2020 m_ptr
->priority
= new_value
;
2022 case TIPC_CMD_SET_LINK_WINDOW
:
2023 m_ptr
->window
= new_value
;
2032 struct sk_buff
*tipc_link_cmd_config(const void *req_tlv_area
, int req_tlv_space
,
2035 struct tipc_link_config
*args
;
2039 if (!TLV_CHECK(req_tlv_area
, req_tlv_space
, TIPC_TLV_LINK_CONFIG
))
2040 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR
);
2042 args
= (struct tipc_link_config
*)TLV_DATA(req_tlv_area
);
2043 new_value
= ntohl(args
->value
);
2045 if (!link_value_is_valid(cmd
, new_value
))
2046 return tipc_cfg_reply_error_string(
2047 "cannot change, value invalid");
2049 if (!strcmp(args
->name
, tipc_bclink_name
)) {
2050 if ((cmd
== TIPC_CMD_SET_LINK_WINDOW
) &&
2051 (tipc_bclink_set_queue_limits(new_value
) == 0))
2052 return tipc_cfg_reply_none();
2053 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
2054 " (cannot change setting on broadcast link)");
2057 res
= link_cmd_set_value(args
->name
, new_value
, cmd
);
2059 return tipc_cfg_reply_error_string("cannot change link setting");
2061 return tipc_cfg_reply_none();
2065 * link_reset_statistics - reset link statistics
2066 * @l_ptr: pointer to link
2068 static void link_reset_statistics(struct tipc_link
*l_ptr
)
2070 memset(&l_ptr
->stats
, 0, sizeof(l_ptr
->stats
));
2071 l_ptr
->stats
.sent_info
= l_ptr
->next_out_no
;
2072 l_ptr
->stats
.recv_info
= l_ptr
->next_in_no
;
2075 struct sk_buff
*tipc_link_cmd_reset_stats(const void *req_tlv_area
, int req_tlv_space
)
2078 struct tipc_link
*l_ptr
;
2079 struct tipc_node
*node
;
2080 unsigned int bearer_id
;
2082 if (!TLV_CHECK(req_tlv_area
, req_tlv_space
, TIPC_TLV_LINK_NAME
))
2083 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR
);
2085 link_name
= (char *)TLV_DATA(req_tlv_area
);
2086 if (!strcmp(link_name
, tipc_bclink_name
)) {
2087 if (tipc_bclink_reset_stats())
2088 return tipc_cfg_reply_error_string("link not found");
2089 return tipc_cfg_reply_none();
2091 node
= tipc_link_find_owner(link_name
, &bearer_id
);
2093 return tipc_cfg_reply_error_string("link not found");
2095 tipc_node_lock(node
);
2096 l_ptr
= node
->links
[bearer_id
];
2098 tipc_node_unlock(node
);
2099 return tipc_cfg_reply_error_string("link not found");
2101 link_reset_statistics(l_ptr
);
2102 tipc_node_unlock(node
);
2103 return tipc_cfg_reply_none();
2107 * percent - convert count to a percentage of total (rounding up or down)
2109 static u32
percent(u32 count
, u32 total
)
2111 return (count
* 100 + (total
/ 2)) / total
;
2115 * tipc_link_stats - print link statistics
2117 * @buf: print buffer area
2118 * @buf_size: size of print buffer area
2120 * Returns length of print buffer data string (or 0 if error)
2122 static int tipc_link_stats(const char *name
, char *buf
, const u32 buf_size
)
2124 struct tipc_link
*l
;
2125 struct tipc_stats
*s
;
2126 struct tipc_node
*node
;
2128 u32 profile_total
= 0;
2129 unsigned int bearer_id
;
2132 if (!strcmp(name
, tipc_bclink_name
))
2133 return tipc_bclink_stats(buf
, buf_size
);
2135 node
= tipc_link_find_owner(name
, &bearer_id
);
2139 tipc_node_lock(node
);
2141 l
= node
->links
[bearer_id
];
2143 tipc_node_unlock(node
);
2149 if (tipc_link_is_active(l
))
2151 else if (tipc_link_is_up(l
))
2156 ret
= tipc_snprintf(buf
, buf_size
, "Link <%s>\n"
2157 " %s MTU:%u Priority:%u Tolerance:%u ms"
2158 " Window:%u packets\n",
2159 l
->name
, status
, l
->max_pkt
, l
->priority
,
2160 l
->tolerance
, l
->queue_limit
[0]);
2162 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
2163 " RX packets:%u fragments:%u/%u bundles:%u/%u\n",
2164 l
->next_in_no
- s
->recv_info
, s
->recv_fragments
,
2165 s
->recv_fragmented
, s
->recv_bundles
,
2168 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
2169 " TX packets:%u fragments:%u/%u bundles:%u/%u\n",
2170 l
->next_out_no
- s
->sent_info
, s
->sent_fragments
,
2171 s
->sent_fragmented
, s
->sent_bundles
,
2174 profile_total
= s
->msg_length_counts
;
2178 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
2179 " TX profile sample:%u packets average:%u octets\n"
2180 " 0-64:%u%% -256:%u%% -1024:%u%% -4096:%u%% "
2181 "-16384:%u%% -32768:%u%% -66000:%u%%\n",
2182 s
->msg_length_counts
,
2183 s
->msg_lengths_total
/ profile_total
,
2184 percent(s
->msg_length_profile
[0], profile_total
),
2185 percent(s
->msg_length_profile
[1], profile_total
),
2186 percent(s
->msg_length_profile
[2], profile_total
),
2187 percent(s
->msg_length_profile
[3], profile_total
),
2188 percent(s
->msg_length_profile
[4], profile_total
),
2189 percent(s
->msg_length_profile
[5], profile_total
),
2190 percent(s
->msg_length_profile
[6], profile_total
));
2192 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
2193 " RX states:%u probes:%u naks:%u defs:%u"
2194 " dups:%u\n", s
->recv_states
, s
->recv_probes
,
2195 s
->recv_nacks
, s
->deferred_recv
, s
->duplicates
);
2197 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
2198 " TX states:%u probes:%u naks:%u acks:%u"
2199 " dups:%u\n", s
->sent_states
, s
->sent_probes
,
2200 s
->sent_nacks
, s
->sent_acks
, s
->retransmitted
);
2202 ret
+= tipc_snprintf(buf
+ ret
, buf_size
- ret
,
2203 " Congestion link:%u Send queue"
2204 " max:%u avg:%u\n", s
->link_congs
,
2205 s
->max_queue_sz
, s
->queue_sz_counts
?
2206 (s
->accu_queue_sz
/ s
->queue_sz_counts
) : 0);
2208 tipc_node_unlock(node
);
2212 struct sk_buff
*tipc_link_cmd_show_stats(const void *req_tlv_area
, int req_tlv_space
)
2214 struct sk_buff
*buf
;
2215 struct tlv_desc
*rep_tlv
;
2220 if (!TLV_CHECK(req_tlv_area
, req_tlv_space
, TIPC_TLV_LINK_NAME
))
2221 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR
);
2223 buf
= tipc_cfg_reply_alloc(TLV_SPACE(ULTRA_STRING_MAX_LEN
));
2227 rep_tlv
= (struct tlv_desc
*)buf
->data
;
2228 pb
= TLV_DATA(rep_tlv
);
2229 pb_len
= ULTRA_STRING_MAX_LEN
;
2230 str_len
= tipc_link_stats((char *)TLV_DATA(req_tlv_area
),
2234 return tipc_cfg_reply_error_string("link not found");
2236 str_len
+= 1; /* for "\0" */
2237 skb_put(buf
, TLV_SPACE(str_len
));
2238 TLV_SET(rep_tlv
, TIPC_TLV_ULTRA_STRING
, NULL
, str_len
);
2244 * tipc_link_get_max_pkt - get maximum packet size to use when sending to destination
2245 * @dest: network address of destination node
2246 * @selector: used to select from set of active links
2248 * If no active link can be found, uses default maximum packet size.
2250 u32
tipc_link_get_max_pkt(u32 dest
, u32 selector
)
2252 struct tipc_node
*n_ptr
;
2253 struct tipc_link
*l_ptr
;
2254 u32 res
= MAX_PKT_DEFAULT
;
2256 if (dest
== tipc_own_addr
)
2257 return MAX_MSG_SIZE
;
2259 n_ptr
= tipc_node_find(dest
);
2261 tipc_node_lock(n_ptr
);
2262 l_ptr
= n_ptr
->active_links
[selector
& 1];
2264 res
= l_ptr
->max_pkt
;
2265 tipc_node_unlock(n_ptr
);
2270 static void link_print(struct tipc_link
*l_ptr
, const char *str
)
2272 struct tipc_bearer
*b_ptr
;
2275 b_ptr
= rcu_dereference_rtnl(bearer_list
[l_ptr
->bearer_id
]);
2277 pr_info("%s Link %x<%s>:", str
, l_ptr
->addr
, b_ptr
->name
);
2280 if (link_working_unknown(l_ptr
))
2282 else if (link_reset_reset(l_ptr
))
2284 else if (link_reset_unknown(l_ptr
))
2286 else if (link_working_working(l_ptr
))
2292 /* Parse and validate nested (link) properties valid for media, bearer and link
2294 int tipc_nl_parse_link_prop(struct nlattr
*prop
, struct nlattr
*props
[])
2298 err
= nla_parse_nested(props
, TIPC_NLA_PROP_MAX
, prop
,
2299 tipc_nl_prop_policy
);
2303 if (props
[TIPC_NLA_PROP_PRIO
]) {
2306 prio
= nla_get_u32(props
[TIPC_NLA_PROP_PRIO
]);
2307 if (prio
> TIPC_MAX_LINK_PRI
)
2311 if (props
[TIPC_NLA_PROP_TOL
]) {
2314 tol
= nla_get_u32(props
[TIPC_NLA_PROP_TOL
]);
2315 if ((tol
< TIPC_MIN_LINK_TOL
) || (tol
> TIPC_MAX_LINK_TOL
))
2319 if (props
[TIPC_NLA_PROP_WIN
]) {
2322 win
= nla_get_u32(props
[TIPC_NLA_PROP_WIN
]);
2323 if ((win
< TIPC_MIN_LINK_WIN
) || (win
> TIPC_MAX_LINK_WIN
))
2330 int tipc_nl_link_set(struct sk_buff
*skb
, struct genl_info
*info
)
2336 struct tipc_link
*link
;
2337 struct tipc_node
*node
;
2338 struct nlattr
*attrs
[TIPC_NLA_LINK_MAX
+ 1];
2340 if (!info
->attrs
[TIPC_NLA_LINK
])
2343 err
= nla_parse_nested(attrs
, TIPC_NLA_LINK_MAX
,
2344 info
->attrs
[TIPC_NLA_LINK
],
2345 tipc_nl_link_policy
);
2349 if (!attrs
[TIPC_NLA_LINK_NAME
])
2352 name
= nla_data(attrs
[TIPC_NLA_LINK_NAME
]);
2354 node
= tipc_link_find_owner(name
, &bearer_id
);
2358 tipc_node_lock(node
);
2360 link
= node
->links
[bearer_id
];
2366 if (attrs
[TIPC_NLA_LINK_PROP
]) {
2367 struct nlattr
*props
[TIPC_NLA_PROP_MAX
+ 1];
2369 err
= tipc_nl_parse_link_prop(attrs
[TIPC_NLA_LINK_PROP
],
2376 if (props
[TIPC_NLA_PROP_TOL
]) {
2379 tol
= nla_get_u32(props
[TIPC_NLA_PROP_TOL
]);
2380 link_set_supervision_props(link
, tol
);
2381 tipc_link_proto_xmit(link
, STATE_MSG
, 0, 0, tol
, 0, 0);
2383 if (props
[TIPC_NLA_PROP_PRIO
]) {
2386 prio
= nla_get_u32(props
[TIPC_NLA_PROP_PRIO
]);
2387 link
->priority
= prio
;
2388 tipc_link_proto_xmit(link
, STATE_MSG
, 0, 0, 0, prio
, 0);
2390 if (props
[TIPC_NLA_PROP_WIN
]) {
2393 win
= nla_get_u32(props
[TIPC_NLA_PROP_WIN
]);
2394 tipc_link_set_queue_limits(link
, win
);
2399 tipc_node_unlock(node
);
2404 static int __tipc_nl_add_stats(struct sk_buff
*skb
, struct tipc_stats
*s
)
2407 struct nlattr
*stats
;
2414 struct nla_map map
[] = {
2415 {TIPC_NLA_STATS_RX_INFO
, s
->recv_info
},
2416 {TIPC_NLA_STATS_RX_FRAGMENTS
, s
->recv_fragments
},
2417 {TIPC_NLA_STATS_RX_FRAGMENTED
, s
->recv_fragmented
},
2418 {TIPC_NLA_STATS_RX_BUNDLES
, s
->recv_bundles
},
2419 {TIPC_NLA_STATS_RX_BUNDLED
, s
->recv_bundled
},
2420 {TIPC_NLA_STATS_TX_INFO
, s
->sent_info
},
2421 {TIPC_NLA_STATS_TX_FRAGMENTS
, s
->sent_fragments
},
2422 {TIPC_NLA_STATS_TX_FRAGMENTED
, s
->sent_fragmented
},
2423 {TIPC_NLA_STATS_TX_BUNDLES
, s
->sent_bundles
},
2424 {TIPC_NLA_STATS_TX_BUNDLED
, s
->sent_bundled
},
2425 {TIPC_NLA_STATS_MSG_PROF_TOT
, (s
->msg_length_counts
) ?
2426 s
->msg_length_counts
: 1},
2427 {TIPC_NLA_STATS_MSG_LEN_CNT
, s
->msg_length_counts
},
2428 {TIPC_NLA_STATS_MSG_LEN_TOT
, s
->msg_lengths_total
},
2429 {TIPC_NLA_STATS_MSG_LEN_P0
, s
->msg_length_profile
[0]},
2430 {TIPC_NLA_STATS_MSG_LEN_P1
, s
->msg_length_profile
[1]},
2431 {TIPC_NLA_STATS_MSG_LEN_P2
, s
->msg_length_profile
[2]},
2432 {TIPC_NLA_STATS_MSG_LEN_P3
, s
->msg_length_profile
[3]},
2433 {TIPC_NLA_STATS_MSG_LEN_P4
, s
->msg_length_profile
[4]},
2434 {TIPC_NLA_STATS_MSG_LEN_P5
, s
->msg_length_profile
[5]},
2435 {TIPC_NLA_STATS_MSG_LEN_P6
, s
->msg_length_profile
[6]},
2436 {TIPC_NLA_STATS_RX_STATES
, s
->recv_states
},
2437 {TIPC_NLA_STATS_RX_PROBES
, s
->recv_probes
},
2438 {TIPC_NLA_STATS_RX_NACKS
, s
->recv_nacks
},
2439 {TIPC_NLA_STATS_RX_DEFERRED
, s
->deferred_recv
},
2440 {TIPC_NLA_STATS_TX_STATES
, s
->sent_states
},
2441 {TIPC_NLA_STATS_TX_PROBES
, s
->sent_probes
},
2442 {TIPC_NLA_STATS_TX_NACKS
, s
->sent_nacks
},
2443 {TIPC_NLA_STATS_TX_ACKS
, s
->sent_acks
},
2444 {TIPC_NLA_STATS_RETRANSMITTED
, s
->retransmitted
},
2445 {TIPC_NLA_STATS_DUPLICATES
, s
->duplicates
},
2446 {TIPC_NLA_STATS_LINK_CONGS
, s
->link_congs
},
2447 {TIPC_NLA_STATS_MAX_QUEUE
, s
->max_queue_sz
},
2448 {TIPC_NLA_STATS_AVG_QUEUE
, s
->queue_sz_counts
?
2449 (s
->accu_queue_sz
/ s
->queue_sz_counts
) : 0}
2452 stats
= nla_nest_start(skb
, TIPC_NLA_LINK_STATS
);
2456 for (i
= 0; i
< ARRAY_SIZE(map
); i
++)
2457 if (nla_put_u32(skb
, map
[i
].key
, map
[i
].val
))
2460 nla_nest_end(skb
, stats
);
2464 nla_nest_cancel(skb
, stats
);
2469 /* Caller should hold appropriate locks to protect the link */
2470 static int __tipc_nl_add_link(struct tipc_nl_msg
*msg
, struct tipc_link
*link
)
2474 struct nlattr
*attrs
;
2475 struct nlattr
*prop
;
2477 hdr
= genlmsg_put(msg
->skb
, msg
->portid
, msg
->seq
, &tipc_genl_v2_family
,
2478 NLM_F_MULTI
, TIPC_NL_LINK_GET
);
2482 attrs
= nla_nest_start(msg
->skb
, TIPC_NLA_LINK
);
2486 if (nla_put_string(msg
->skb
, TIPC_NLA_LINK_NAME
, link
->name
))
2488 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_DEST
,
2489 tipc_cluster_mask(tipc_own_addr
)))
2491 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_MTU
, link
->max_pkt
))
2493 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_RX
, link
->next_in_no
))
2495 if (nla_put_u32(msg
->skb
, TIPC_NLA_LINK_TX
, link
->next_out_no
))
2498 if (tipc_link_is_up(link
))
2499 if (nla_put_flag(msg
->skb
, TIPC_NLA_LINK_UP
))
2501 if (tipc_link_is_active(link
))
2502 if (nla_put_flag(msg
->skb
, TIPC_NLA_LINK_ACTIVE
))
2505 prop
= nla_nest_start(msg
->skb
, TIPC_NLA_LINK_PROP
);
2508 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_PRIO
, link
->priority
))
2510 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_TOL
, link
->tolerance
))
2512 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_WIN
,
2513 link
->queue_limit
[TIPC_LOW_IMPORTANCE
]))
2515 if (nla_put_u32(msg
->skb
, TIPC_NLA_PROP_PRIO
, link
->priority
))
2517 nla_nest_end(msg
->skb
, prop
);
2519 err
= __tipc_nl_add_stats(msg
->skb
, &link
->stats
);
2523 nla_nest_end(msg
->skb
, attrs
);
2524 genlmsg_end(msg
->skb
, hdr
);
2529 nla_nest_cancel(msg
->skb
, prop
);
2531 nla_nest_cancel(msg
->skb
, attrs
);
2533 genlmsg_cancel(msg
->skb
, hdr
);
2538 /* Caller should hold node lock */
2539 static int __tipc_nl_add_node_links(struct tipc_nl_msg
*msg
,
2540 struct tipc_node
*node
,
2546 for (i
= *prev_link
; i
< MAX_BEARERS
; i
++) {
2549 if (!node
->links
[i
])
2552 err
= __tipc_nl_add_link(msg
, node
->links
[i
]);
2561 int tipc_nl_link_dump(struct sk_buff
*skb
, struct netlink_callback
*cb
)
2563 struct tipc_node
*node
;
2564 struct tipc_nl_msg msg
;
2565 u32 prev_node
= cb
->args
[0];
2566 u32 prev_link
= cb
->args
[1];
2567 int done
= cb
->args
[2];
2574 msg
.portid
= NETLINK_CB(cb
->skb
).portid
;
2575 msg
.seq
= cb
->nlh
->nlmsg_seq
;
2580 node
= tipc_node_find(prev_node
);
2582 /* We never set seq or call nl_dump_check_consistent()
2583 * this means that setting prev_seq here will cause the
2584 * consistence check to fail in the netlink callback
2585 * handler. Resulting in the last NLMSG_DONE message
2586 * having the NLM_F_DUMP_INTR flag set.
2592 list_for_each_entry_continue_rcu(node
, &tipc_node_list
, list
) {
2593 tipc_node_lock(node
);
2594 err
= __tipc_nl_add_node_links(&msg
, node
, &prev_link
);
2595 tipc_node_unlock(node
);
2599 prev_node
= node
->addr
;
2602 err
= tipc_nl_add_bc_link(&msg
);
2606 list_for_each_entry_rcu(node
, &tipc_node_list
, list
) {
2607 tipc_node_lock(node
);
2608 err
= __tipc_nl_add_node_links(&msg
, node
, &prev_link
);
2609 tipc_node_unlock(node
);
2613 prev_node
= node
->addr
;
2620 cb
->args
[0] = prev_node
;
2621 cb
->args
[1] = prev_link
;
2627 int tipc_nl_link_get(struct sk_buff
*skb
, struct genl_info
*info
)
2629 struct sk_buff
*ans_skb
;
2630 struct tipc_nl_msg msg
;
2631 struct tipc_link
*link
;
2632 struct tipc_node
*node
;
2637 if (!info
->attrs
[TIPC_NLA_LINK_NAME
])
2640 name
= nla_data(info
->attrs
[TIPC_NLA_LINK_NAME
]);
2641 node
= tipc_link_find_owner(name
, &bearer_id
);
2645 ans_skb
= nlmsg_new(NLMSG_GOODSIZE
, GFP_KERNEL
);
2650 msg
.portid
= info
->snd_portid
;
2651 msg
.seq
= info
->snd_seq
;
2653 tipc_node_lock(node
);
2654 link
= node
->links
[bearer_id
];
2660 err
= __tipc_nl_add_link(&msg
, link
);
2664 tipc_node_unlock(node
);
2666 return genlmsg_reply(ans_skb
, info
);
2669 tipc_node_unlock(node
);
2670 nlmsg_free(ans_skb
);
2675 int tipc_nl_link_reset_stats(struct sk_buff
*skb
, struct genl_info
*info
)
2679 unsigned int bearer_id
;
2680 struct tipc_link
*link
;
2681 struct tipc_node
*node
;
2682 struct nlattr
*attrs
[TIPC_NLA_LINK_MAX
+ 1];
2684 if (!info
->attrs
[TIPC_NLA_LINK
])
2687 err
= nla_parse_nested(attrs
, TIPC_NLA_LINK_MAX
,
2688 info
->attrs
[TIPC_NLA_LINK
],
2689 tipc_nl_link_policy
);
2693 if (!attrs
[TIPC_NLA_LINK_NAME
])
2696 link_name
= nla_data(attrs
[TIPC_NLA_LINK_NAME
]);
2698 if (strcmp(link_name
, tipc_bclink_name
) == 0) {
2699 err
= tipc_bclink_reset_stats();
2705 node
= tipc_link_find_owner(link_name
, &bearer_id
);
2709 tipc_node_lock(node
);
2711 link
= node
->links
[bearer_id
];
2713 tipc_node_unlock(node
);
2717 link_reset_statistics(link
);
2719 tipc_node_unlock(node
);