tipc: use generic SKB list APIs to manage link receive queue
[deliverable/linux.git] / net / tipc / link.c
1 /*
2 * net/tipc/link.c: TIPC link code
3 *
4 * Copyright (c) 1996-2007, 2012-2014, Ericsson AB
5 * Copyright (c) 2004-2007, 2010-2013, Wind River Systems
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
19 *
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37 #include "core.h"
38 #include "link.h"
39 #include "bcast.h"
40 #include "socket.h"
41 #include "name_distr.h"
42 #include "discover.h"
43 #include "config.h"
44 #include "netlink.h"
45
46 #include <linux/pkt_sched.h>
47
48 /*
49 * Error message prefixes
50 */
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 ";
54
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] = {
58 .type = NLA_STRING,
59 .len = TIPC_MAX_LINK_NAME
60 },
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 }
69 };
70
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 }
77 };
78
79 /*
80 * Out-of-range value for link session numbers
81 */
82 #define INVALID_SESSION 0x10000
83
84 /*
85 * Link state events:
86 */
87 #define STARTING_EVT 856384768 /* link processing trigger */
88 #define TRAFFIC_MSG_EVT 560815u /* rx'd ??? */
89 #define TIMEOUT_EVT 560817u /* link timer expired */
90
91 /*
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
95 */
96 #define OPEN_MSG 0
97 #define CLOSED_MSG 1
98
99 /*
100 * State value stored in 'exp_msg_count'
101 */
102 #define START_CHANGEOVER 100000u
103
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);
117
118 /*
119 * Simple link routines
120 */
121 static unsigned int align(unsigned int i)
122 {
123 return (i + 3) & ~3u;
124 }
125
126 static void link_init_max_pkt(struct tipc_link *l_ptr)
127 {
128 struct tipc_bearer *b_ptr;
129 u32 max_pkt;
130
131 rcu_read_lock();
132 b_ptr = rcu_dereference_rtnl(bearer_list[l_ptr->bearer_id]);
133 if (!b_ptr) {
134 rcu_read_unlock();
135 return;
136 }
137 max_pkt = (b_ptr->mtu & ~3);
138 rcu_read_unlock();
139
140 if (max_pkt > MAX_MSG_SIZE)
141 max_pkt = MAX_MSG_SIZE;
142
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;
146 else
147 l_ptr->max_pkt = MAX_PKT_DEFAULT;
148
149 l_ptr->max_pkt_probes = 0;
150 }
151
152 /*
153 * Simple non-static link routines (i.e. referenced outside this file)
154 */
155 int tipc_link_is_up(struct tipc_link *l_ptr)
156 {
157 if (!l_ptr)
158 return 0;
159 return link_working_working(l_ptr) || link_working_unknown(l_ptr);
160 }
161
162 int tipc_link_is_active(struct tipc_link *l_ptr)
163 {
164 return (l_ptr->owner->active_links[0] == l_ptr) ||
165 (l_ptr->owner->active_links[1] == l_ptr);
166 }
167
168 /**
169 * link_timeout - handle expiration of link timer
170 * @l_ptr: pointer to link
171 */
172 static void link_timeout(struct tipc_link *l_ptr)
173 {
174 struct sk_buff *skb;
175
176 tipc_node_lock(l_ptr->owner);
177
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++;
181
182 skb = skb_peek(&l_ptr->outqueue);
183 if (skb) {
184 struct tipc_msg *msg = buf_msg(skb);
185 u32 length = msg_size(msg);
186
187 if ((msg_user(msg) == MSG_FRAGMENTER) &&
188 (msg_type(msg) == FIRST_FRAGMENT)) {
189 length = msg_size(msg_get_wrapped(msg));
190 }
191 if (length) {
192 l_ptr->stats.msg_lengths_total += length;
193 l_ptr->stats.msg_length_counts++;
194 if (length <= 64)
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]++;
206 else
207 l_ptr->stats.msg_length_profile[6]++;
208 }
209 }
210
211 /* do all other link processing performed on a periodic basis */
212 link_state_event(l_ptr, TIMEOUT_EVT);
213
214 if (l_ptr->next_out)
215 tipc_link_push_packets(l_ptr);
216
217 tipc_node_unlock(l_ptr->owner);
218 }
219
220 static void link_set_timer(struct tipc_link *l_ptr, u32 time)
221 {
222 k_start_timer(&l_ptr->timer, time);
223 }
224
225 /**
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
230 *
231 * Returns pointer to link.
232 */
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)
236 {
237 struct tipc_link *l_ptr;
238 struct tipc_msg *msg;
239 char *if_name;
240 char addr_string[16];
241 u32 peer = n_ptr->addr;
242
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);
247 return NULL;
248 }
249
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);
254 return NULL;
255 }
256
257 l_ptr = kzalloc(sizeof(*l_ptr), GFP_ATOMIC);
258 if (!l_ptr) {
259 pr_warn("Link creation failed, no memory\n");
260 return NULL;
261 }
262
263 l_ptr->addr = peer;
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),
268 if_name,
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;
278
279 l_ptr->pmsg = (struct tipc_msg *)&l_ptr->proto_msg;
280 msg = l_ptr->pmsg;
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);
286
287 l_ptr->priority = b_ptr->priority;
288 tipc_link_set_queue_limits(l_ptr, b_ptr->window);
289
290 l_ptr->net_plane = b_ptr->net_plane;
291 link_init_max_pkt(l_ptr);
292
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);
297
298 link_reset_statistics(l_ptr);
299
300 tipc_node_attach_link(n_ptr, l_ptr);
301
302 k_init_timer(&l_ptr->timer, (Handler)link_timeout,
303 (unsigned long)l_ptr);
304
305 link_state_event(l_ptr, STARTING_EVT);
306
307 return l_ptr;
308 }
309
310 void tipc_link_delete_list(unsigned int bearer_id, bool shutting_down)
311 {
312 struct tipc_link *l_ptr;
313 struct tipc_node *n_ptr;
314
315 rcu_read_lock();
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];
319 if (l_ptr) {
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);
325
326 /* Nobody else can access this link now: */
327 del_timer_sync(&l_ptr->timer);
328 kfree(l_ptr);
329 } else {
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);
334 }
335 continue;
336 }
337 tipc_node_unlock(n_ptr);
338 }
339 rcu_read_unlock();
340 }
341
342 /**
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
349 */
350 static bool link_schedule_user(struct tipc_link *link, u32 oport,
351 uint chain_sz, uint imp)
352 {
353 struct sk_buff *buf;
354
355 buf = tipc_msg_create(SOCK_WAKEUP, 0, INT_H_SIZE, 0, tipc_own_addr,
356 tipc_own_addr, oport, 0, 0);
357 if (!buf)
358 return false;
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++;
363 return true;
364 }
365
366 /**
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
371 */
372 static void link_prepare_wakeup(struct tipc_link *link)
373 {
374 uint pend_qsz = skb_queue_len(&link->outqueue);
375 struct sk_buff *skb, *tmp;
376
377 skb_queue_walk_safe(&link->waiting_sks, skb, tmp) {
378 if (pend_qsz >= link->queue_limit[TIPC_SKB_CB(skb)->chain_imp])
379 break;
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);
383 }
384 }
385
386 /**
387 * tipc_link_reset_fragments - purge link's inbound message fragments queue
388 * @l_ptr: pointer to link
389 */
390 void tipc_link_reset_fragments(struct tipc_link *l_ptr)
391 {
392 kfree_skb(l_ptr->reasm_buf);
393 l_ptr->reasm_buf = NULL;
394 }
395
396 /**
397 * tipc_link_purge_queues - purge all pkt queues associated with link
398 * @l_ptr: pointer to link
399 */
400 void tipc_link_purge_queues(struct tipc_link *l_ptr)
401 {
402 __skb_queue_purge(&l_ptr->deferred_queue);
403 __skb_queue_purge(&l_ptr->outqueue);
404 tipc_link_reset_fragments(l_ptr);
405 }
406
407 void tipc_link_reset(struct tipc_link *l_ptr)
408 {
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;
413
414 msg_set_session(l_ptr->pmsg, ((msg_session(l_ptr->pmsg) + 1) & 0xffff));
415
416 /* Link is down, accept any session */
417 l_ptr->peer_session = INVALID_SESSION;
418
419 /* Prepare for max packet size negotiation */
420 link_init_max_pkt(l_ptr);
421
422 l_ptr->state = RESET_UNKNOWN;
423
424 if ((prev_state == RESET_UNKNOWN) || (prev_state == RESET_RESET))
425 return;
426
427 tipc_node_link_down(l_ptr->owner, l_ptr);
428 tipc_bearer_remove_dest(l_ptr->bearer_id, l_ptr->addr);
429
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;
433 }
434
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;
441 }
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);
449 }
450
451 void tipc_link_reset_list(unsigned int bearer_id)
452 {
453 struct tipc_link *l_ptr;
454 struct tipc_node *n_ptr;
455
456 rcu_read_lock();
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];
460 if (l_ptr)
461 tipc_link_reset(l_ptr);
462 tipc_node_unlock(n_ptr);
463 }
464 rcu_read_unlock();
465 }
466
467 static void link_activate(struct tipc_link *l_ptr)
468 {
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);
472 }
473
474 /**
475 * link_state_event - link finite state machine
476 * @l_ptr: pointer to link
477 * @event: state machine event to process
478 */
479 static void link_state_event(struct tipc_link *l_ptr, unsigned int event)
480 {
481 struct tipc_link *other;
482 u32 cont_intv = l_ptr->continuity_interval;
483
484 if (l_ptr->flags & LINK_STOPPED)
485 return;
486
487 if (!(l_ptr->flags & LINK_STARTED) && (event != STARTING_EVT))
488 return; /* Not yet. */
489
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);
494 return;
495 }
496
497 switch (l_ptr->state) {
498 case WORKING_WORKING:
499 switch (event) {
500 case TRAFFIC_MSG_EVT:
501 case ACTIVATE_MSG:
502 break;
503 case TIMEOUT_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,
508 0, 0, 0, 0, 0);
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,
512 1, 0, 0, 0, 0);
513 l_ptr->fsm_msg_cnt++;
514 }
515 link_set_timer(l_ptr, cont_intv);
516 break;
517 }
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);
523 break;
524 case RESET_MSG:
525 pr_info("%s<%s>, requested by peer\n", link_rst_msg,
526 l_ptr->name);
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,
531 0, 0, 0, 0, 0);
532 l_ptr->fsm_msg_cnt++;
533 link_set_timer(l_ptr, cont_intv);
534 break;
535 default:
536 pr_err("%s%u in WW state\n", link_unk_evt, event);
537 }
538 break;
539 case WORKING_UNKNOWN:
540 switch (event) {
541 case TRAFFIC_MSG_EVT:
542 case ACTIVATE_MSG:
543 l_ptr->state = WORKING_WORKING;
544 l_ptr->fsm_msg_cnt = 0;
545 link_set_timer(l_ptr, cont_intv);
546 break;
547 case RESET_MSG:
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,
554 0, 0, 0, 0, 0);
555 l_ptr->fsm_msg_cnt++;
556 link_set_timer(l_ptr, cont_intv);
557 break;
558 case TIMEOUT_EVT:
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,
565 0, 0, 0, 0, 0);
566 l_ptr->fsm_msg_cnt++;
567 }
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,
571 1, 0, 0, 0, 0);
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,
581 0, 0, 0, 0, 0);
582 l_ptr->fsm_msg_cnt++;
583 link_set_timer(l_ptr, cont_intv);
584 }
585 break;
586 default:
587 pr_err("%s%u in WU state\n", link_unk_evt, event);
588 }
589 break;
590 case RESET_UNKNOWN:
591 switch (event) {
592 case TRAFFIC_MSG_EVT:
593 break;
594 case ACTIVATE_MSG:
595 other = l_ptr->owner->active_links[0];
596 if (other && link_working_unknown(other))
597 break;
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);
606 break;
607 case RESET_MSG:
608 l_ptr->state = RESET_RESET;
609 l_ptr->fsm_msg_cnt = 0;
610 tipc_link_proto_xmit(l_ptr, ACTIVATE_MSG,
611 1, 0, 0, 0, 0);
612 l_ptr->fsm_msg_cnt++;
613 link_set_timer(l_ptr, cont_intv);
614 break;
615 case STARTING_EVT:
616 l_ptr->flags |= LINK_STARTED;
617 /* fall through */
618 case TIMEOUT_EVT:
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);
622 break;
623 default:
624 pr_err("%s%u in RU state\n", link_unk_evt, event);
625 }
626 break;
627 case RESET_RESET:
628 switch (event) {
629 case TRAFFIC_MSG_EVT:
630 case ACTIVATE_MSG:
631 other = l_ptr->owner->active_links[0];
632 if (other && link_working_unknown(other))
633 break;
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);
642 break;
643 case RESET_MSG:
644 break;
645 case TIMEOUT_EVT:
646 tipc_link_proto_xmit(l_ptr, ACTIVATE_MSG,
647 0, 0, 0, 0, 0);
648 l_ptr->fsm_msg_cnt++;
649 link_set_timer(l_ptr, cont_intv);
650 break;
651 default:
652 pr_err("%s%u in RR state\n", link_unk_evt, event);
653 }
654 break;
655 default:
656 pr_err("Unknown link state %u/%u\n", l_ptr->state, event);
657 }
658 }
659
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
663 * return -ELINKONG.
664 * - For all other messages we discard the buffer and return -EHOSTUNREACH
665 * - For TIPC internal messages we also reset the link
666 */
667 static int tipc_link_cong(struct tipc_link *link, struct sk_buff *buf)
668 {
669 struct tipc_msg *msg = buf_msg(buf);
670 uint imp = tipc_msg_tot_importance(msg);
671 u32 oport = msg_tot_origport(msg);
672
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);
676 goto drop;
677 }
678 if (unlikely(msg_errcode(msg)))
679 goto drop;
680 if (unlikely(msg_reroute_cnt(msg)))
681 goto drop;
682 if (TIPC_SKB_CB(buf)->wakeup_pending)
683 return -ELINKCONG;
684 if (link_schedule_user(link, oport, TIPC_SKB_CB(buf)->chain_sz, imp))
685 return -ELINKCONG;
686 drop:
687 kfree_skb_list(buf);
688 return -EHOSTUNREACH;
689 }
690
691 /**
692 * __tipc_link_xmit(): same as tipc_link_xmit, but destlink is known & locked
693 * @link: link to use
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.
700 */
701 int __tipc_link_xmit(struct tipc_link *link, struct sk_buff *skb)
702 {
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;
714
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);
718
719 /* Has valid packet limit been used ? */
720 if (unlikely(psz > mtu)) {
721 kfree_skb_list(skb);
722 return -EMSGSIZE;
723 }
724
725 /* Prepare each packet for sending, and add to outqueue: */
726 while (skb) {
727 next = skb->next;
728 msg = buf_msg(skb);
729 msg_set_word(msg, 2, ((ack << 16) | mod(seqno)));
730 msg_set_bcast_ack(msg, bc_last_in);
731
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++;
739 skb = next;
740 continue;
741 } else if (tipc_msg_make_bundle(outqueue, skb, mtu,
742 link->addr)) {
743 link->stats.sent_bundled++;
744 link->stats.sent_bundles++;
745 if (!link->next_out)
746 link->next_out = skb_peek_tail(outqueue);
747 } else {
748 __skb_queue_tail(outqueue, skb);
749 if (!link->next_out)
750 link->next_out = skb;
751 }
752 seqno++;
753 skb = next;
754 }
755 link->next_out_no = seqno;
756 return 0;
757 }
758
759 /**
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
767 */
768 int tipc_link_xmit(struct sk_buff *buf, u32 dnode, u32 selector)
769 {
770 struct tipc_link *link = NULL;
771 struct tipc_node *node;
772 int rc = -EHOSTUNREACH;
773
774 node = tipc_node_find(dnode);
775 if (node) {
776 tipc_node_lock(node);
777 link = node->active_links[selector & 1];
778 if (link)
779 rc = __tipc_link_xmit(link, buf);
780 tipc_node_unlock(node);
781 }
782
783 if (link)
784 return rc;
785
786 if (likely(in_own_node(dnode)))
787 return tipc_sk_rcv(buf);
788
789 kfree_skb_list(buf);
790 return rc;
791 }
792
793 /*
794 * tipc_link_sync_xmit - synchronize broadcast link endpoints.
795 *
796 * Give a newly added peer node the sequence number where it should
797 * start receiving and acking broadcast packets.
798 *
799 * Called with node locked
800 */
801 static void tipc_link_sync_xmit(struct tipc_link *link)
802 {
803 struct sk_buff *buf;
804 struct tipc_msg *msg;
805
806 buf = tipc_buf_acquire(INT_H_SIZE);
807 if (!buf)
808 return;
809
810 msg = buf_msg(buf);
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);
814 }
815
816 /*
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.
821 *
822 * Called with node locked
823 */
824 static void tipc_link_sync_rcv(struct tipc_node *n, struct sk_buff *buf)
825 {
826 struct tipc_msg *msg = buf_msg(buf);
827
828 n->bclink.last_sent = n->bclink.last_in = msg_last_bcast(msg);
829 n->bclink.recv_permitted = true;
830 kfree_skb(buf);
831 }
832
833 struct sk_buff *tipc_skb_queue_next(const struct sk_buff_head *list,
834 const struct sk_buff *skb)
835 {
836 if (skb_queue_is_last(list, skb))
837 return NULL;
838 return skb->next;
839 }
840
841 /*
842 * tipc_link_push_packets - push unsent packets to bearer
843 *
844 * Push out the unsent messages of a link where congestion
845 * has abated. Node is locked.
846 *
847 * Called with node locked
848 */
849 void tipc_link_push_packets(struct tipc_link *l_ptr)
850 {
851 struct sk_buff_head *outqueue = &l_ptr->outqueue;
852 struct sk_buff *skb = l_ptr->next_out;
853 struct tipc_msg *msg;
854 u32 next, first;
855
856 skb_queue_walk_from(outqueue, skb) {
857 msg = buf_msg(skb);
858 next = msg_seqno(msg);
859 first = buf_seqno(skb_peek(outqueue));
860
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,
867 &l_ptr->media_addr);
868 l_ptr->next_out = tipc_skb_queue_next(outqueue, skb);
869 } else {
870 break;
871 }
872 }
873 }
874
875 void tipc_link_reset_all(struct tipc_node *node)
876 {
877 char addr_string[16];
878 u32 i;
879
880 tipc_node_lock(node);
881
882 pr_warn("Resetting all links to %s\n",
883 tipc_addr_string_fill(addr_string, node->addr));
884
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]);
889 }
890 }
891
892 tipc_node_unlock(node);
893 }
894
895 static void link_retransmit_failure(struct tipc_link *l_ptr,
896 struct sk_buff *buf)
897 {
898 struct tipc_msg *msg = buf_msg(buf);
899
900 pr_warn("Retransmission failure on link <%s>\n", l_ptr->name);
901
902 if (l_ptr->addr) {
903 /* Handle failure on standard link */
904 link_print(l_ptr, "Resetting link\n");
905 tipc_link_reset(l_ptr);
906
907 } else {
908 /* Handle failure on broadcast link */
909 struct tipc_node *n_ptr;
910 char addr_string[16];
911
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);
915
916 n_ptr = tipc_bclink_retransmit_to();
917 tipc_node_lock(n_ptr);
918
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);
928
929 tipc_node_unlock(n_ptr);
930
931 tipc_bclink_set_flags(TIPC_BCLINK_RESET);
932 l_ptr->stale_count = 0;
933 }
934 }
935
936 void tipc_link_retransmit(struct tipc_link *l_ptr, struct sk_buff *skb,
937 u32 retransmits)
938 {
939 struct tipc_msg *msg;
940
941 if (!skb)
942 return;
943
944 msg = buf_msg(skb);
945
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);
950 return;
951 }
952 } else {
953 l_ptr->last_retransmitted = msg_seqno(msg);
954 l_ptr->stale_count = 1;
955 }
956
957 skb_queue_walk_from(&l_ptr->outqueue, skb) {
958 if (!retransmits || skb == l_ptr->next_out)
959 break;
960 msg = buf_msg(skb);
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);
964 retransmits--;
965 l_ptr->stats.retransmitted++;
966 }
967 }
968
969 static void link_retrieve_defq(struct tipc_link *link,
970 struct sk_buff_head *list)
971 {
972 u32 seq_no;
973
974 if (skb_queue_empty(&link->deferred_queue))
975 return;
976
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);
980 }
981
982 /**
983 * link_recv_buf_validate - validate basic format of received message
984 *
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.
989 *
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.
993 */
994 static int link_recv_buf_validate(struct sk_buff *buf)
995 {
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
999 };
1000
1001 struct tipc_msg *msg;
1002 u32 tipc_hdr[2];
1003 u32 size;
1004 u32 hdr_size;
1005 u32 min_hdr_size;
1006
1007 /* If this packet comes from the defer queue, the skb has already
1008 * been validated
1009 */
1010 if (unlikely(TIPC_SKB_CB(buf)->deferred))
1011 return 1;
1012
1013 if (unlikely(buf->len < MIN_H_SIZE))
1014 return 0;
1015
1016 msg = skb_header_pointer(buf, 0, sizeof(tipc_hdr), tipc_hdr);
1017 if (msg == NULL)
1018 return 0;
1019
1020 if (unlikely(msg_version(msg) != TIPC_VERSION))
1021 return 0;
1022
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;
1027
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)))
1032 return 0;
1033
1034 return pskb_may_pull(buf, hdr_size);
1035 }
1036
1037 /**
1038 * tipc_rcv - process TIPC packets/messages arriving from off-node
1039 * @skb: TIPC packet
1040 * @b_ptr: pointer to bearer message arrived on
1041 *
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.
1044 */
1045 void tipc_rcv(struct sk_buff *skb, struct tipc_bearer *b_ptr)
1046 {
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;
1052 u32 seq_no;
1053 u32 ackd;
1054 u32 released;
1055
1056 __skb_queue_head_init(&head);
1057 __skb_queue_tail(&head, skb);
1058
1059 while ((skb = __skb_dequeue(&head))) {
1060 /* Ensure message is well-formed */
1061 if (unlikely(!link_recv_buf_validate(skb)))
1062 goto discard;
1063
1064 /* Ensure message data is a single contiguous unit */
1065 if (unlikely(skb_linearize(skb)))
1066 goto discard;
1067
1068 /* Handle arrival of a non-unicast link message */
1069 msg = buf_msg(skb);
1070
1071 if (unlikely(msg_non_seq(msg))) {
1072 if (msg_user(msg) == LINK_CONFIG)
1073 tipc_disc_rcv(skb, b_ptr);
1074 else
1075 tipc_bclink_rcv(skb);
1076 continue;
1077 }
1078
1079 /* Discard unicast link messages destined for another node */
1080 if (unlikely(!msg_short(msg) &&
1081 (msg_destnode(msg) != tipc_own_addr)))
1082 goto discard;
1083
1084 /* Locate neighboring node that sent message */
1085 n_ptr = tipc_node_find(msg_prevnode(msg));
1086 if (unlikely(!n_ptr))
1087 goto discard;
1088 tipc_node_lock(n_ptr);
1089
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;
1094
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;
1102
1103 if (tipc_node_blocked(n_ptr))
1104 goto unlock_discard;
1105
1106 /* Validate message sequence number info */
1107 seq_no = msg_seqno(msg);
1108 ackd = msg_ack(msg);
1109
1110 /* Release acked messages */
1111 if (n_ptr->bclink.recv_permitted)
1112 tipc_bclink_acknowledge(n_ptr, msg_bcast_ack(msg));
1113
1114 released = 0;
1115 skb_queue_walk_safe(&l_ptr->outqueue, skb1, tmp) {
1116 if (skb1 == l_ptr->next_out ||
1117 more(buf_seqno(skb1), ackd))
1118 break;
1119 __skb_unlink(skb1, &l_ptr->outqueue);
1120 kfree_skb(skb1);
1121 released = 1;
1122 }
1123
1124 /* Try sending any messages link endpoint has pending */
1125 if (unlikely(l_ptr->next_out))
1126 tipc_link_push_packets(l_ptr);
1127
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;
1131 }
1132
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);
1139 continue;
1140 }
1141
1142 /* Traffic message. Conditionally activate link */
1143 link_state_event(l_ptr, TRAFFIC_MSG_EVT);
1144
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);
1149 continue;
1150 }
1151 goto unlock_discard;
1152 }
1153
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);
1159 continue;
1160 }
1161 l_ptr->next_in_no++;
1162 if (unlikely(!skb_queue_empty(&l_ptr->deferred_queue)))
1163 link_retrieve_defq(l_ptr, &head);
1164
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);
1168 }
1169
1170 if (tipc_link_prepare_input(l_ptr, &skb)) {
1171 tipc_node_unlock(n_ptr);
1172 continue;
1173 }
1174 tipc_node_unlock(n_ptr);
1175
1176 if (tipc_link_input(l_ptr, skb) != 0)
1177 goto discard;
1178 continue;
1179 unlock_discard:
1180 tipc_node_unlock(n_ptr);
1181 discard:
1182 kfree_skb(skb);
1183 }
1184 }
1185
1186 /**
1187 * tipc_link_prepare_input - process TIPC link messages
1188 *
1189 * returns nonzero if the message was consumed
1190 *
1191 * Node lock must be held
1192 */
1193 static int tipc_link_prepare_input(struct tipc_link *l, struct sk_buff **buf)
1194 {
1195 struct tipc_node *n;
1196 struct tipc_msg *msg;
1197 int res = -EINVAL;
1198
1199 n = l->owner;
1200 msg = buf_msg(*buf);
1201 switch (msg_user(msg)) {
1202 case CHANGEOVER_PROTOCOL:
1203 if (tipc_link_tunnel_rcv(n, buf))
1204 res = 0;
1205 break;
1206 case MSG_FRAGMENTER:
1207 l->stats.recv_fragments++;
1208 if (tipc_buf_append(&l->reasm_buf, buf)) {
1209 l->stats.recv_fragmented++;
1210 res = 0;
1211 } else if (!l->reasm_buf) {
1212 tipc_link_reset(l);
1213 }
1214 break;
1215 case MSG_BUNDLER:
1216 l->stats.recv_bundles++;
1217 l->stats.recv_bundled += msg_msgcnt(msg);
1218 res = 0;
1219 break;
1220 case NAME_DISTRIBUTOR:
1221 n->bclink.recv_permitted = true;
1222 res = 0;
1223 break;
1224 case BCAST_PROTOCOL:
1225 tipc_link_sync_rcv(n, *buf);
1226 break;
1227 default:
1228 res = 0;
1229 }
1230 return res;
1231 }
1232 /**
1233 * tipc_link_input - Deliver message too higher layers
1234 */
1235 static int tipc_link_input(struct tipc_link *l, struct sk_buff *buf)
1236 {
1237 struct tipc_msg *msg = buf_msg(buf);
1238 int res = 0;
1239
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:
1245 case CONN_MANAGER:
1246 tipc_sk_rcv(buf);
1247 break;
1248 case NAME_DISTRIBUTOR:
1249 tipc_named_rcv(buf);
1250 break;
1251 case MSG_BUNDLER:
1252 tipc_link_bundle_rcv(buf);
1253 break;
1254 default:
1255 res = -EINVAL;
1256 }
1257 return res;
1258 }
1259
1260 /**
1261 * tipc_link_defer_pkt - Add out-of-sequence message to deferred reception queue
1262 *
1263 * Returns increase in queue length (i.e. 0 or 1)
1264 */
1265 u32 tipc_link_defer_pkt(struct sk_buff_head *list, struct sk_buff *skb)
1266 {
1267 struct sk_buff *skb1;
1268 u32 seq_no = buf_seqno(skb);
1269
1270 /* Empty queue ? */
1271 if (skb_queue_empty(list)) {
1272 __skb_queue_tail(list, skb);
1273 return 1;
1274 }
1275
1276 /* Last ? */
1277 if (less(buf_seqno(skb_peek_tail(list)), seq_no)) {
1278 __skb_queue_tail(list, skb);
1279 return 1;
1280 }
1281
1282 /* Locate insertion point in queue, then insert; discard if duplicate */
1283 skb_queue_walk(list, skb1) {
1284 u32 curr_seqno = buf_seqno(skb1);
1285
1286 if (seq_no == curr_seqno) {
1287 kfree_skb(skb);
1288 return 0;
1289 }
1290
1291 if (less(seq_no, curr_seqno))
1292 break;
1293 }
1294
1295 __skb_queue_before(list, skb1, skb);
1296 return 1;
1297 }
1298
1299 /*
1300 * link_handle_out_of_seq_msg - handle arrival of out-of-sequence packet
1301 */
1302 static void link_handle_out_of_seq_msg(struct tipc_link *l_ptr,
1303 struct sk_buff *buf)
1304 {
1305 u32 seq_no = buf_seqno(buf);
1306
1307 if (likely(msg_user(buf_msg(buf)) == LINK_PROTOCOL)) {
1308 tipc_link_proto_rcv(l_ptr, buf);
1309 return;
1310 }
1311
1312 /* Record OOS packet arrival (force mismatch on next timeout) */
1313 l_ptr->checkpoint--;
1314
1315 /*
1316 * Discard packet if a duplicate; otherwise add it to deferred queue
1317 * and notify peer of gap as per protocol specification
1318 */
1319 if (less(seq_no, mod(l_ptr->next_in_no))) {
1320 l_ptr->stats.duplicates++;
1321 kfree_skb(buf);
1322 return;
1323 }
1324
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);
1330 } else {
1331 l_ptr->stats.duplicates++;
1332 }
1333 }
1334
1335 /*
1336 * Send protocol message to the other endpoint.
1337 */
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)
1340 {
1341 struct sk_buff *buf = NULL;
1342 struct tipc_msg *msg = l_ptr->pmsg;
1343 u32 msg_size = sizeof(l_ptr->proto_msg);
1344 int r_flag;
1345
1346 /* Don't send protocol message during link changeover */
1347 if (l_ptr->exp_msg_count)
1348 return;
1349
1350 /* Abort non-RESET send if communication with node is prohibited */
1351 if ((tipc_node_blocked(l_ptr->owner)) && (msg_typ != RESET_MSG))
1352 return;
1353
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());
1359
1360 if (msg_typ == STATE_MSG) {
1361 u32 next_sent = mod(l_ptr->next_out_no);
1362
1363 if (!tipc_link_is_up(l_ptr))
1364 return;
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));
1371 }
1372 msg_set_seq_gap(msg, gap);
1373 if (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);
1380 if (probe_msg) {
1381 u32 mtu = l_ptr->max_pkt;
1382
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;
1391 }
1392 l_ptr->max_pkt_probes++;
1393 }
1394
1395 l_ptr->stats.sent_probes++;
1396 }
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);
1406 }
1407
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);
1412
1413 msg_set_seqno(msg, mod(l_ptr->next_out_no + (0xffff/2)));
1414
1415 buf = tipc_buf_acquire(msg_size);
1416 if (!buf)
1417 return;
1418
1419 skb_copy_to_linear_data(buf, msg, sizeof(l_ptr->proto_msg));
1420 buf->priority = TC_PRIO_CONTROL;
1421
1422 tipc_bearer_send(l_ptr->bearer_id, buf, &l_ptr->media_addr);
1423 l_ptr->unacked_window = 0;
1424 kfree_skb(buf);
1425 }
1426
1427 /*
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
1431 */
1432 static void tipc_link_proto_rcv(struct tipc_link *l_ptr, struct sk_buff *buf)
1433 {
1434 u32 rec_gap = 0;
1435 u32 max_pkt_info;
1436 u32 max_pkt_ack;
1437 u32 msg_tol;
1438 struct tipc_msg *msg = buf_msg(buf);
1439
1440 /* Discard protocol message during link changeover */
1441 if (l_ptr->exp_msg_count)
1442 goto exit;
1443
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);
1447
1448 switch (msg_type(msg)) {
1449
1450 case RESET_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 */
1455 }
1456
1457 if (!msg_redundant_link(msg) && (link_working_working(l_ptr) ||
1458 link_working_unknown(l_ptr))) {
1459 /*
1460 * peer has lost contact -- don't allow peer's links
1461 * to reactivate before we recognize loss & clean up
1462 */
1463 l_ptr->owner->action_flags |= TIPC_WAIT_OWN_LINKS_DOWN;
1464 }
1465
1466 link_state_event(l_ptr, RESET_MSG);
1467
1468 /* fall thru' */
1469 case ACTIVATE_MSG:
1470 /* Update link settings according other endpoint's values */
1471 strcpy((strrchr(l_ptr->name, ':') + 1), (char *)msg_data(msg));
1472
1473 msg_tol = msg_link_tolerance(msg);
1474 if (msg_tol > l_ptr->tolerance)
1475 link_set_supervision_props(l_ptr, msg_tol);
1476
1477 if (msg_linkprio(msg) > l_ptr->priority)
1478 l_ptr->priority = msg_linkprio(msg);
1479
1480 max_pkt_info = msg_max_pkt(msg);
1481 if (max_pkt_info) {
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;
1486 } else {
1487 l_ptr->max_pkt = l_ptr->max_pkt_target;
1488 }
1489
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;
1496 }
1497
1498 l_ptr->peer_session = msg_session(msg);
1499 l_ptr->peer_bearer_id = msg_bearer_id(msg);
1500
1501 if (msg_type(msg) == ACTIVATE_MSG)
1502 link_state_event(l_ptr, ACTIVATE_MSG);
1503 break;
1504 case STATE_MSG:
1505
1506 msg_tol = msg_link_tolerance(msg);
1507 if (msg_tol)
1508 link_set_supervision_props(l_ptr, msg_tol);
1509
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,
1514 msg_linkprio(msg));
1515 l_ptr->priority = msg_linkprio(msg);
1516 tipc_link_reset(l_ptr); /* Enforce change to take effect */
1517 break;
1518 }
1519
1520 /* Record reception; force mismatch at next timeout: */
1521 l_ptr->checkpoint--;
1522
1523 link_state_event(l_ptr, TRAFFIC_MSG_EVT);
1524 l_ptr->stats.recv_states++;
1525 if (link_reset_unknown(l_ptr))
1526 break;
1527
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));
1531 }
1532
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;
1537 }
1538
1539 max_pkt_ack = 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);
1544 }
1545
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));
1550
1551 if (rec_gap || (msg_probe(msg))) {
1552 tipc_link_proto_xmit(l_ptr, STATE_MSG, 0, rec_gap, 0,
1553 0, max_pkt_ack);
1554 }
1555 if (msg_seq_gap(msg)) {
1556 l_ptr->stats.recv_nacks++;
1557 tipc_link_retransmit(l_ptr, skb_peek(&l_ptr->outqueue),
1558 msg_seq_gap(msg));
1559 }
1560 break;
1561 }
1562 exit:
1563 kfree_skb(buf);
1564 }
1565
1566
1567 /* tipc_link_tunnel_xmit(): Tunnel one packet via a link belonging to
1568 * a different bearer. Owner node is locked.
1569 */
1570 static void tipc_link_tunnel_xmit(struct tipc_link *l_ptr,
1571 struct tipc_msg *tunnel_hdr,
1572 struct tipc_msg *msg,
1573 u32 selector)
1574 {
1575 struct tipc_link *tunnel;
1576 struct sk_buff *buf;
1577 u32 length = msg_size(msg);
1578
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);
1582 return;
1583 }
1584 msg_set_size(tunnel_hdr, length + INT_H_SIZE);
1585 buf = tipc_buf_acquire(length + INT_H_SIZE);
1586 if (!buf) {
1587 pr_warn("%sunable to send tunnel msg\n", link_co_err);
1588 return;
1589 }
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);
1593 }
1594
1595
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.
1601 */
1602 void tipc_link_failover_send_queue(struct tipc_link *l_ptr)
1603 {
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;
1608 int split_bundles;
1609
1610 if (!tunnel)
1611 return;
1612
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);
1617
1618 if (skb_queue_empty(&l_ptr->outqueue)) {
1619 skb = tipc_buf_acquire(INT_H_SIZE);
1620 if (skb) {
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);
1624 } else {
1625 pr_warn("%sunable to send changeover msg\n",
1626 link_co_err);
1627 }
1628 return;
1629 }
1630
1631 split_bundles = (l_ptr->owner->active_links[0] !=
1632 l_ptr->owner->active_links[1]);
1633
1634 skb_queue_walk(&l_ptr->outqueue, skb) {
1635 struct tipc_msg *msg = buf_msg(skb);
1636
1637 if ((msg_user(msg) == MSG_BUNDLER) && split_bundles) {
1638 struct tipc_msg *m = msg_get_wrapped(msg);
1639 unchar *pos = (unchar *)m;
1640
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;
1648 }
1649 } else {
1650 tipc_link_tunnel_xmit(l_ptr, &tunnel_hdr, msg,
1651 msg_link_selector(msg));
1652 }
1653 }
1654 }
1655
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.
1664 */
1665 void tipc_link_dup_queue_xmit(struct tipc_link *l_ptr,
1666 struct tipc_link *tunnel)
1667 {
1668 struct sk_buff *skb;
1669 struct tipc_msg tunnel_hdr;
1670
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);
1679
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",
1688 link_co_err);
1689 return;
1690 }
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,
1693 length);
1694 __tipc_link_xmit(tunnel, outskb);
1695 if (!tipc_link_is_up(l_ptr))
1696 return;
1697 }
1698 }
1699
1700 /**
1701 * buf_extract - extracts embedded TIPC message from another message
1702 * @skb: encapsulating message buffer
1703 * @from_pos: offset to extract from
1704 *
1705 * Returns a new message buffer containing an embedded message. The
1706 * encapsulating message itself is left unchanged.
1707 */
1708 static struct sk_buff *buf_extract(struct sk_buff *skb, u32 from_pos)
1709 {
1710 struct tipc_msg *msg = (struct tipc_msg *)(skb->data + from_pos);
1711 u32 size = msg_size(msg);
1712 struct sk_buff *eb;
1713
1714 eb = tipc_buf_acquire(size);
1715 if (eb)
1716 skb_copy_to_linear_data(eb, msg, size);
1717 return eb;
1718 }
1719
1720
1721
1722 /* tipc_link_dup_rcv(): Receive a tunnelled DUPLICATE_MSG packet.
1723 * Owner node is locked.
1724 */
1725 static void tipc_link_dup_rcv(struct tipc_link *l_ptr,
1726 struct sk_buff *t_buf)
1727 {
1728 struct sk_buff *buf;
1729
1730 if (!tipc_link_is_up(l_ptr))
1731 return;
1732
1733 buf = buf_extract(t_buf, INT_H_SIZE);
1734 if (buf == NULL) {
1735 pr_warn("%sfailed to extract inner dup pkt\n", link_co_err);
1736 return;
1737 }
1738
1739 /* Add buffer to deferred queue, if applicable: */
1740 link_handle_out_of_seq_msg(l_ptr, buf);
1741 }
1742
1743 /* tipc_link_failover_rcv(): Receive a tunnelled ORIGINAL_MSG packet
1744 * Owner node is locked.
1745 */
1746 static struct sk_buff *tipc_link_failover_rcv(struct tipc_link *l_ptr,
1747 struct sk_buff *t_buf)
1748 {
1749 struct tipc_msg *t_msg = buf_msg(t_buf);
1750 struct sk_buff *buf = NULL;
1751 struct tipc_msg *msg;
1752
1753 if (tipc_link_is_up(l_ptr))
1754 tipc_link_reset(l_ptr);
1755
1756 /* First failover packet? */
1757 if (l_ptr->exp_msg_count == START_CHANGEOVER)
1758 l_ptr->exp_msg_count = msg_msgcnt(t_msg);
1759
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);
1764 if (buf == NULL) {
1765 pr_warn("%sno inner failover pkt\n", link_co_err);
1766 goto exit;
1767 }
1768 msg = buf_msg(buf);
1769
1770 if (less(msg_seqno(msg), l_ptr->reset_checkpoint)) {
1771 kfree_skb(buf);
1772 buf = NULL;
1773 goto exit;
1774 }
1775 if (msg_user(msg) == MSG_FRAGMENTER) {
1776 l_ptr->stats.recv_fragments++;
1777 tipc_buf_append(&l_ptr->reasm_buf, &buf);
1778 }
1779 }
1780 exit:
1781 if ((l_ptr->exp_msg_count == 0) && (l_ptr->flags & LINK_STOPPED)) {
1782 tipc_node_detach_link(l_ptr->owner, l_ptr);
1783 kfree(l_ptr);
1784 }
1785 return buf;
1786 }
1787
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.
1793 */
1794 static int tipc_link_tunnel_rcv(struct tipc_node *n_ptr,
1795 struct sk_buff **buf)
1796 {
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);
1801
1802 *buf = NULL;
1803
1804 if (bearer_id >= MAX_BEARERS)
1805 goto exit;
1806
1807 l_ptr = n_ptr->links[bearer_id];
1808 if (!l_ptr)
1809 goto exit;
1810
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);
1815 else
1816 pr_warn("%sunknown tunnel pkt received\n", link_co_err);
1817 exit:
1818 kfree_skb(t_buf);
1819 return *buf != NULL;
1820 }
1821
1822 /*
1823 * Bundler functionality:
1824 */
1825 void tipc_link_bundle_rcv(struct sk_buff *buf)
1826 {
1827 u32 msgcount = msg_msgcnt(buf_msg(buf));
1828 u32 pos = INT_H_SIZE;
1829 struct sk_buff *obuf;
1830 struct tipc_msg *omsg;
1831
1832 while (msgcount--) {
1833 obuf = buf_extract(buf, pos);
1834 if (obuf == NULL) {
1835 pr_warn("Link unable to unbundle message(s)\n");
1836 break;
1837 }
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);
1843 else
1844 tipc_sk_rcv(obuf);
1845 } else if (msg_user(omsg) == CONN_MANAGER) {
1846 tipc_sk_rcv(obuf);
1847 } else if (msg_user(omsg) == NAME_DISTRIBUTOR) {
1848 tipc_named_rcv(obuf);
1849 } else {
1850 pr_warn("Illegal bundled msg: %u\n", msg_user(omsg));
1851 kfree_skb(obuf);
1852 }
1853 }
1854 kfree_skb(buf);
1855 }
1856
1857 static void link_set_supervision_props(struct tipc_link *l_ptr, u32 tolerance)
1858 {
1859 if ((tolerance < TIPC_MIN_LINK_TOL) || (tolerance > TIPC_MAX_LINK_TOL))
1860 return;
1861
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);
1866 }
1867
1868 void tipc_link_set_queue_limits(struct tipc_link *l_ptr, u32 window)
1869 {
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;
1885 }
1886
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.
1890 *
1891 * Returns pointer to node owning the link, or 0 if no matching link is found.
1892 */
1893 static struct tipc_node *tipc_link_find_owner(const char *link_name,
1894 unsigned int *bearer_id)
1895 {
1896 struct tipc_link *l_ptr;
1897 struct tipc_node *n_ptr;
1898 struct tipc_node *found_node = 0;
1899 int i;
1900
1901 *bearer_id = 0;
1902 rcu_read_lock();
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)) {
1908 *bearer_id = i;
1909 found_node = n_ptr;
1910 break;
1911 }
1912 }
1913 tipc_node_unlock(n_ptr);
1914 if (found_node)
1915 break;
1916 }
1917 rcu_read_unlock();
1918
1919 return found_node;
1920 }
1921
1922 /**
1923 * link_value_is_valid -- validate proposed link tolerance/priority/window
1924 *
1925 * @cmd: value type (TIPC_CMD_SET_LINK_*)
1926 * @new_value: the new value
1927 *
1928 * Returns 1 if value is within range, 0 if not.
1929 */
1930 static int link_value_is_valid(u16 cmd, u32 new_value)
1931 {
1932 switch (cmd) {
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);
1941 }
1942 return 0;
1943 }
1944
1945 /**
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_*)
1950 *
1951 * Caller must hold RTNL lock to ensure link/bearer/media is not deleted.
1952 *
1953 * Returns 0 if value updated and negative value on error.
1954 */
1955 static int link_cmd_set_value(const char *name, u32 new_value, u16 cmd)
1956 {
1957 struct tipc_node *node;
1958 struct tipc_link *l_ptr;
1959 struct tipc_bearer *b_ptr;
1960 struct tipc_media *m_ptr;
1961 int bearer_id;
1962 int res = 0;
1963
1964 node = tipc_link_find_owner(name, &bearer_id);
1965 if (node) {
1966 tipc_node_lock(node);
1967 l_ptr = node->links[bearer_id];
1968
1969 if (l_ptr) {
1970 switch (cmd) {
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,
1974 new_value, 0, 0);
1975 break;
1976 case TIPC_CMD_SET_LINK_PRI:
1977 l_ptr->priority = new_value;
1978 tipc_link_proto_xmit(l_ptr, STATE_MSG, 0, 0,
1979 0, new_value, 0);
1980 break;
1981 case TIPC_CMD_SET_LINK_WINDOW:
1982 tipc_link_set_queue_limits(l_ptr, new_value);
1983 break;
1984 default:
1985 res = -EINVAL;
1986 break;
1987 }
1988 }
1989 tipc_node_unlock(node);
1990 return res;
1991 }
1992
1993 b_ptr = tipc_bearer_find(name);
1994 if (b_ptr) {
1995 switch (cmd) {
1996 case TIPC_CMD_SET_LINK_TOL:
1997 b_ptr->tolerance = new_value;
1998 break;
1999 case TIPC_CMD_SET_LINK_PRI:
2000 b_ptr->priority = new_value;
2001 break;
2002 case TIPC_CMD_SET_LINK_WINDOW:
2003 b_ptr->window = new_value;
2004 break;
2005 default:
2006 res = -EINVAL;
2007 break;
2008 }
2009 return res;
2010 }
2011
2012 m_ptr = tipc_media_find(name);
2013 if (!m_ptr)
2014 return -ENODEV;
2015 switch (cmd) {
2016 case TIPC_CMD_SET_LINK_TOL:
2017 m_ptr->tolerance = new_value;
2018 break;
2019 case TIPC_CMD_SET_LINK_PRI:
2020 m_ptr->priority = new_value;
2021 break;
2022 case TIPC_CMD_SET_LINK_WINDOW:
2023 m_ptr->window = new_value;
2024 break;
2025 default:
2026 res = -EINVAL;
2027 break;
2028 }
2029 return res;
2030 }
2031
2032 struct sk_buff *tipc_link_cmd_config(const void *req_tlv_area, int req_tlv_space,
2033 u16 cmd)
2034 {
2035 struct tipc_link_config *args;
2036 u32 new_value;
2037 int res;
2038
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);
2041
2042 args = (struct tipc_link_config *)TLV_DATA(req_tlv_area);
2043 new_value = ntohl(args->value);
2044
2045 if (!link_value_is_valid(cmd, new_value))
2046 return tipc_cfg_reply_error_string(
2047 "cannot change, value invalid");
2048
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)");
2055 }
2056
2057 res = link_cmd_set_value(args->name, new_value, cmd);
2058 if (res)
2059 return tipc_cfg_reply_error_string("cannot change link setting");
2060
2061 return tipc_cfg_reply_none();
2062 }
2063
2064 /**
2065 * link_reset_statistics - reset link statistics
2066 * @l_ptr: pointer to link
2067 */
2068 static void link_reset_statistics(struct tipc_link *l_ptr)
2069 {
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;
2073 }
2074
2075 struct sk_buff *tipc_link_cmd_reset_stats(const void *req_tlv_area, int req_tlv_space)
2076 {
2077 char *link_name;
2078 struct tipc_link *l_ptr;
2079 struct tipc_node *node;
2080 unsigned int bearer_id;
2081
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);
2084
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();
2090 }
2091 node = tipc_link_find_owner(link_name, &bearer_id);
2092 if (!node)
2093 return tipc_cfg_reply_error_string("link not found");
2094
2095 tipc_node_lock(node);
2096 l_ptr = node->links[bearer_id];
2097 if (!l_ptr) {
2098 tipc_node_unlock(node);
2099 return tipc_cfg_reply_error_string("link not found");
2100 }
2101 link_reset_statistics(l_ptr);
2102 tipc_node_unlock(node);
2103 return tipc_cfg_reply_none();
2104 }
2105
2106 /**
2107 * percent - convert count to a percentage of total (rounding up or down)
2108 */
2109 static u32 percent(u32 count, u32 total)
2110 {
2111 return (count * 100 + (total / 2)) / total;
2112 }
2113
2114 /**
2115 * tipc_link_stats - print link statistics
2116 * @name: link name
2117 * @buf: print buffer area
2118 * @buf_size: size of print buffer area
2119 *
2120 * Returns length of print buffer data string (or 0 if error)
2121 */
2122 static int tipc_link_stats(const char *name, char *buf, const u32 buf_size)
2123 {
2124 struct tipc_link *l;
2125 struct tipc_stats *s;
2126 struct tipc_node *node;
2127 char *status;
2128 u32 profile_total = 0;
2129 unsigned int bearer_id;
2130 int ret;
2131
2132 if (!strcmp(name, tipc_bclink_name))
2133 return tipc_bclink_stats(buf, buf_size);
2134
2135 node = tipc_link_find_owner(name, &bearer_id);
2136 if (!node)
2137 return 0;
2138
2139 tipc_node_lock(node);
2140
2141 l = node->links[bearer_id];
2142 if (!l) {
2143 tipc_node_unlock(node);
2144 return 0;
2145 }
2146
2147 s = &l->stats;
2148
2149 if (tipc_link_is_active(l))
2150 status = "ACTIVE";
2151 else if (tipc_link_is_up(l))
2152 status = "STANDBY";
2153 else
2154 status = "DEFUNCT";
2155
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]);
2161
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,
2166 s->recv_bundled);
2167
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,
2172 s->sent_bundled);
2173
2174 profile_total = s->msg_length_counts;
2175 if (!profile_total)
2176 profile_total = 1;
2177
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));
2191
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);
2196
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);
2201
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);
2207
2208 tipc_node_unlock(node);
2209 return ret;
2210 }
2211
2212 struct sk_buff *tipc_link_cmd_show_stats(const void *req_tlv_area, int req_tlv_space)
2213 {
2214 struct sk_buff *buf;
2215 struct tlv_desc *rep_tlv;
2216 int str_len;
2217 int pb_len;
2218 char *pb;
2219
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);
2222
2223 buf = tipc_cfg_reply_alloc(TLV_SPACE(ULTRA_STRING_MAX_LEN));
2224 if (!buf)
2225 return NULL;
2226
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),
2231 pb, pb_len);
2232 if (!str_len) {
2233 kfree_skb(buf);
2234 return tipc_cfg_reply_error_string("link not found");
2235 }
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);
2239
2240 return buf;
2241 }
2242
2243 /**
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
2247 *
2248 * If no active link can be found, uses default maximum packet size.
2249 */
2250 u32 tipc_link_get_max_pkt(u32 dest, u32 selector)
2251 {
2252 struct tipc_node *n_ptr;
2253 struct tipc_link *l_ptr;
2254 u32 res = MAX_PKT_DEFAULT;
2255
2256 if (dest == tipc_own_addr)
2257 return MAX_MSG_SIZE;
2258
2259 n_ptr = tipc_node_find(dest);
2260 if (n_ptr) {
2261 tipc_node_lock(n_ptr);
2262 l_ptr = n_ptr->active_links[selector & 1];
2263 if (l_ptr)
2264 res = l_ptr->max_pkt;
2265 tipc_node_unlock(n_ptr);
2266 }
2267 return res;
2268 }
2269
2270 static void link_print(struct tipc_link *l_ptr, const char *str)
2271 {
2272 struct tipc_bearer *b_ptr;
2273
2274 rcu_read_lock();
2275 b_ptr = rcu_dereference_rtnl(bearer_list[l_ptr->bearer_id]);
2276 if (b_ptr)
2277 pr_info("%s Link %x<%s>:", str, l_ptr->addr, b_ptr->name);
2278 rcu_read_unlock();
2279
2280 if (link_working_unknown(l_ptr))
2281 pr_cont(":WU\n");
2282 else if (link_reset_reset(l_ptr))
2283 pr_cont(":RR\n");
2284 else if (link_reset_unknown(l_ptr))
2285 pr_cont(":RU\n");
2286 else if (link_working_working(l_ptr))
2287 pr_cont(":WW\n");
2288 else
2289 pr_cont("\n");
2290 }
2291
2292 /* Parse and validate nested (link) properties valid for media, bearer and link
2293 */
2294 int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[])
2295 {
2296 int err;
2297
2298 err = nla_parse_nested(props, TIPC_NLA_PROP_MAX, prop,
2299 tipc_nl_prop_policy);
2300 if (err)
2301 return err;
2302
2303 if (props[TIPC_NLA_PROP_PRIO]) {
2304 u32 prio;
2305
2306 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
2307 if (prio > TIPC_MAX_LINK_PRI)
2308 return -EINVAL;
2309 }
2310
2311 if (props[TIPC_NLA_PROP_TOL]) {
2312 u32 tol;
2313
2314 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
2315 if ((tol < TIPC_MIN_LINK_TOL) || (tol > TIPC_MAX_LINK_TOL))
2316 return -EINVAL;
2317 }
2318
2319 if (props[TIPC_NLA_PROP_WIN]) {
2320 u32 win;
2321
2322 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2323 if ((win < TIPC_MIN_LINK_WIN) || (win > TIPC_MAX_LINK_WIN))
2324 return -EINVAL;
2325 }
2326
2327 return 0;
2328 }
2329
2330 int tipc_nl_link_set(struct sk_buff *skb, struct genl_info *info)
2331 {
2332 int err;
2333 int res = 0;
2334 int bearer_id;
2335 char *name;
2336 struct tipc_link *link;
2337 struct tipc_node *node;
2338 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2339
2340 if (!info->attrs[TIPC_NLA_LINK])
2341 return -EINVAL;
2342
2343 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2344 info->attrs[TIPC_NLA_LINK],
2345 tipc_nl_link_policy);
2346 if (err)
2347 return err;
2348
2349 if (!attrs[TIPC_NLA_LINK_NAME])
2350 return -EINVAL;
2351
2352 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2353
2354 node = tipc_link_find_owner(name, &bearer_id);
2355 if (!node)
2356 return -EINVAL;
2357
2358 tipc_node_lock(node);
2359
2360 link = node->links[bearer_id];
2361 if (!link) {
2362 res = -EINVAL;
2363 goto out;
2364 }
2365
2366 if (attrs[TIPC_NLA_LINK_PROP]) {
2367 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
2368
2369 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
2370 props);
2371 if (err) {
2372 res = err;
2373 goto out;
2374 }
2375
2376 if (props[TIPC_NLA_PROP_TOL]) {
2377 u32 tol;
2378
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);
2382 }
2383 if (props[TIPC_NLA_PROP_PRIO]) {
2384 u32 prio;
2385
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);
2389 }
2390 if (props[TIPC_NLA_PROP_WIN]) {
2391 u32 win;
2392
2393 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2394 tipc_link_set_queue_limits(link, win);
2395 }
2396 }
2397
2398 out:
2399 tipc_node_unlock(node);
2400
2401 return res;
2402 }
2403
2404 static int __tipc_nl_add_stats(struct sk_buff *skb, struct tipc_stats *s)
2405 {
2406 int i;
2407 struct nlattr *stats;
2408
2409 struct nla_map {
2410 u32 key;
2411 u32 val;
2412 };
2413
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}
2450 };
2451
2452 stats = nla_nest_start(skb, TIPC_NLA_LINK_STATS);
2453 if (!stats)
2454 return -EMSGSIZE;
2455
2456 for (i = 0; i < ARRAY_SIZE(map); i++)
2457 if (nla_put_u32(skb, map[i].key, map[i].val))
2458 goto msg_full;
2459
2460 nla_nest_end(skb, stats);
2461
2462 return 0;
2463 msg_full:
2464 nla_nest_cancel(skb, stats);
2465
2466 return -EMSGSIZE;
2467 }
2468
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)
2471 {
2472 int err;
2473 void *hdr;
2474 struct nlattr *attrs;
2475 struct nlattr *prop;
2476
2477 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_v2_family,
2478 NLM_F_MULTI, TIPC_NL_LINK_GET);
2479 if (!hdr)
2480 return -EMSGSIZE;
2481
2482 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK);
2483 if (!attrs)
2484 goto msg_full;
2485
2486 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, link->name))
2487 goto attr_msg_full;
2488 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_DEST,
2489 tipc_cluster_mask(tipc_own_addr)))
2490 goto attr_msg_full;
2491 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_MTU, link->max_pkt))
2492 goto attr_msg_full;
2493 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, link->next_in_no))
2494 goto attr_msg_full;
2495 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, link->next_out_no))
2496 goto attr_msg_full;
2497
2498 if (tipc_link_is_up(link))
2499 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
2500 goto attr_msg_full;
2501 if (tipc_link_is_active(link))
2502 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_ACTIVE))
2503 goto attr_msg_full;
2504
2505 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP);
2506 if (!prop)
2507 goto attr_msg_full;
2508 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
2509 goto prop_msg_full;
2510 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_TOL, link->tolerance))
2511 goto prop_msg_full;
2512 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN,
2513 link->queue_limit[TIPC_LOW_IMPORTANCE]))
2514 goto prop_msg_full;
2515 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
2516 goto prop_msg_full;
2517 nla_nest_end(msg->skb, prop);
2518
2519 err = __tipc_nl_add_stats(msg->skb, &link->stats);
2520 if (err)
2521 goto attr_msg_full;
2522
2523 nla_nest_end(msg->skb, attrs);
2524 genlmsg_end(msg->skb, hdr);
2525
2526 return 0;
2527
2528 prop_msg_full:
2529 nla_nest_cancel(msg->skb, prop);
2530 attr_msg_full:
2531 nla_nest_cancel(msg->skb, attrs);
2532 msg_full:
2533 genlmsg_cancel(msg->skb, hdr);
2534
2535 return -EMSGSIZE;
2536 }
2537
2538 /* Caller should hold node lock */
2539 static int __tipc_nl_add_node_links(struct tipc_nl_msg *msg,
2540 struct tipc_node *node,
2541 u32 *prev_link)
2542 {
2543 u32 i;
2544 int err;
2545
2546 for (i = *prev_link; i < MAX_BEARERS; i++) {
2547 *prev_link = i;
2548
2549 if (!node->links[i])
2550 continue;
2551
2552 err = __tipc_nl_add_link(msg, node->links[i]);
2553 if (err)
2554 return err;
2555 }
2556 *prev_link = 0;
2557
2558 return 0;
2559 }
2560
2561 int tipc_nl_link_dump(struct sk_buff *skb, struct netlink_callback *cb)
2562 {
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];
2568 int err;
2569
2570 if (done)
2571 return 0;
2572
2573 msg.skb = skb;
2574 msg.portid = NETLINK_CB(cb->skb).portid;
2575 msg.seq = cb->nlh->nlmsg_seq;
2576
2577 rcu_read_lock();
2578
2579 if (prev_node) {
2580 node = tipc_node_find(prev_node);
2581 if (!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.
2587 */
2588 cb->prev_seq = 1;
2589 goto out;
2590 }
2591
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);
2596 if (err)
2597 goto out;
2598
2599 prev_node = node->addr;
2600 }
2601 } else {
2602 err = tipc_nl_add_bc_link(&msg);
2603 if (err)
2604 goto out;
2605
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);
2610 if (err)
2611 goto out;
2612
2613 prev_node = node->addr;
2614 }
2615 }
2616 done = 1;
2617 out:
2618 rcu_read_unlock();
2619
2620 cb->args[0] = prev_node;
2621 cb->args[1] = prev_link;
2622 cb->args[2] = done;
2623
2624 return skb->len;
2625 }
2626
2627 int tipc_nl_link_get(struct sk_buff *skb, struct genl_info *info)
2628 {
2629 struct sk_buff *ans_skb;
2630 struct tipc_nl_msg msg;
2631 struct tipc_link *link;
2632 struct tipc_node *node;
2633 char *name;
2634 int bearer_id;
2635 int err;
2636
2637 if (!info->attrs[TIPC_NLA_LINK_NAME])
2638 return -EINVAL;
2639
2640 name = nla_data(info->attrs[TIPC_NLA_LINK_NAME]);
2641 node = tipc_link_find_owner(name, &bearer_id);
2642 if (!node)
2643 return -EINVAL;
2644
2645 ans_skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2646 if (!ans_skb)
2647 return -ENOMEM;
2648
2649 msg.skb = ans_skb;
2650 msg.portid = info->snd_portid;
2651 msg.seq = info->snd_seq;
2652
2653 tipc_node_lock(node);
2654 link = node->links[bearer_id];
2655 if (!link) {
2656 err = -EINVAL;
2657 goto err_out;
2658 }
2659
2660 err = __tipc_nl_add_link(&msg, link);
2661 if (err)
2662 goto err_out;
2663
2664 tipc_node_unlock(node);
2665
2666 return genlmsg_reply(ans_skb, info);
2667
2668 err_out:
2669 tipc_node_unlock(node);
2670 nlmsg_free(ans_skb);
2671
2672 return err;
2673 }
2674
2675 int tipc_nl_link_reset_stats(struct sk_buff *skb, struct genl_info *info)
2676 {
2677 int err;
2678 char *link_name;
2679 unsigned int bearer_id;
2680 struct tipc_link *link;
2681 struct tipc_node *node;
2682 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2683
2684 if (!info->attrs[TIPC_NLA_LINK])
2685 return -EINVAL;
2686
2687 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2688 info->attrs[TIPC_NLA_LINK],
2689 tipc_nl_link_policy);
2690 if (err)
2691 return err;
2692
2693 if (!attrs[TIPC_NLA_LINK_NAME])
2694 return -EINVAL;
2695
2696 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2697
2698 if (strcmp(link_name, tipc_bclink_name) == 0) {
2699 err = tipc_bclink_reset_stats();
2700 if (err)
2701 return err;
2702 return 0;
2703 }
2704
2705 node = tipc_link_find_owner(link_name, &bearer_id);
2706 if (!node)
2707 return -EINVAL;
2708
2709 tipc_node_lock(node);
2710
2711 link = node->links[bearer_id];
2712 if (!link) {
2713 tipc_node_unlock(node);
2714 return -EINVAL;
2715 }
2716
2717 link_reset_statistics(link);
2718
2719 tipc_node_unlock(node);
2720
2721 return 0;
2722 }
This page took 0.086835 seconds and 5 git commands to generate.