?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
[TIPC]: Force linearization of non-linear sk_buffs
[linux-2.6/btrfs-unstable.git] / net / tipc / link.c
blob087379366d3c8aba1519104424fe3ba3b5623a9b
1 /*
2 * net/tipc/link.c: TIPC link code
3 *
4 * Copyright (c) 1996-2007, Ericsson AB
5 * Copyright (c) 2004-2007, 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 "dbg.h"
39 #include "link.h"
40 #include "net.h"
41 #include "node.h"
42 #include "port.h"
43 #include "addr.h"
44 #include "node_subscr.h"
45 #include "name_distr.h"
46 #include "bearer.h"
47 #include "name_table.h"
48 #include "discover.h"
49 #include "config.h"
50 #include "bcast.h"
51
52
53 /*
54 * Limit for deferred reception queue:
55 */
56
57 #define DEF_QUEUE_LIMIT 256u
58
59 /*
60 * Link state events:
61 */
62
63 #define STARTING_EVT 856384768 /* link processing trigger */
64 #define TRAFFIC_MSG_EVT 560815u /* rx'd ??? */
65 #define TIMEOUT_EVT 560817u /* link timer expired */
66
67 /*
68 * The following two 'message types' is really just implementation
69 * data conveniently stored in the message header.
70 * They must not be considered part of the protocol
71 */
72 #define OPEN_MSG 0
73 #define CLOSED_MSG 1
74
75 /*
76 * State value stored in 'exp_msg_count'
77 */
78
79 #define START_CHANGEOVER 100000u
80
81 /**
82 * struct link_name - deconstructed link name
83 * @addr_local: network address of node at this end
84 * @if_local: name of interface at this end
85 * @addr_peer: network address of node at far end
86 * @if_peer: name of interface at far end
87 */
88
89 struct link_name {
90 u32 addr_local;
91 char if_local[TIPC_MAX_IF_NAME];
92 u32 addr_peer;
93 char if_peer[TIPC_MAX_IF_NAME];
94 };
95
96 #if 0
97
98 /* LINK EVENT CODE IS NOT SUPPORTED AT PRESENT */
99
100 /**
101 * struct link_event - link up/down event notification
102 */
103
104 struct link_event {
105 u32 addr;
106 int up;
107 void (*fcn)(u32, char *, int);
108 char name[TIPC_MAX_LINK_NAME];
109 };
110
111 #endif
112
113 static void link_handle_out_of_seq_msg(struct link *l_ptr,
114 struct sk_buff *buf);
115 static void link_recv_proto_msg(struct link *l_ptr, struct sk_buff *buf);
116 static int link_recv_changeover_msg(struct link **l_ptr, struct sk_buff **buf);
117 static void link_set_supervision_props(struct link *l_ptr, u32 tolerance);
118 static int link_send_sections_long(struct port *sender,
119 struct iovec const *msg_sect,
120 u32 num_sect, u32 destnode);
121 static void link_check_defragm_bufs(struct link *l_ptr);
122 static void link_state_event(struct link *l_ptr, u32 event);
123 static void link_reset_statistics(struct link *l_ptr);
124 static void link_print(struct link *l_ptr, struct print_buf *buf,
125 const char *str);
126
127 /*
128 * Debugging code used by link routines only
129 *
130 * When debugging link problems on a system that has multiple links,
131 * the standard TIPC debugging routines may not be useful since they
132 * allow the output from multiple links to be intermixed. For this reason
133 * routines of the form "dbg_link_XXX()" have been created that will capture
134 * debug info into a link's personal print buffer, which can then be dumped
135 * into the TIPC system log (TIPC_LOG) upon request.
136 *
137 * To enable per-link debugging, use LINK_LOG_BUF_SIZE to specify the size
138 * of the print buffer used by each link. If LINK_LOG_BUF_SIZE is set to 0,
139 * the dbg_link_XXX() routines simply send their output to the standard
140 * debug print buffer (DBG_OUTPUT), if it has been defined; this can be useful
141 * when there is only a single link in the system being debugged.
142 *
143 * Notes:
144 * - When enabled, LINK_LOG_BUF_SIZE should be set to at least TIPC_PB_MIN_SIZE
145 * - "l_ptr" must be valid when using dbg_link_XXX() macros
146 */
147
148 #define LINK_LOG_BUF_SIZE 0
149
150 #define dbg_link(fmt, arg...) do {if (LINK_LOG_BUF_SIZE) tipc_printf(&l_ptr->print_buf, fmt, ## arg); } while(0)
151 #define dbg_link_msg(msg, txt) do {if (LINK_LOG_BUF_SIZE) tipc_msg_print(&l_ptr->print_buf, msg, txt); } while(0)
152 #define dbg_link_state(txt) do {if (LINK_LOG_BUF_SIZE) link_print(l_ptr, &l_ptr->print_buf, txt); } while(0)
153 #define dbg_link_dump() do { \
154 if (LINK_LOG_BUF_SIZE) { \
155 tipc_printf(LOG, "\n\nDumping link <%s>:\n", l_ptr->name); \
156 tipc_printbuf_move(LOG, &l_ptr->print_buf); \
157 } \
158 } while (0)
159
160 static void dbg_print_link(struct link *l_ptr, const char *str)
161 {
162 if (DBG_OUTPUT != TIPC_NULL)
163 link_print(l_ptr, DBG_OUTPUT, str);
164 }
165
166 static void dbg_print_buf_chain(struct sk_buff *root_buf)
167 {
168 if (DBG_OUTPUT != TIPC_NULL) {
169 struct sk_buff *buf = root_buf;
170
171 while (buf) {
172 msg_dbg(buf_msg(buf), "In chain: ");
173 buf = buf->next;
174 }
175 }
176 }
177
178 /*
179 * Simple link routines
180 */
181
182 static unsigned int align(unsigned int i)
183 {
184 return (i + 3) & ~3u;
185 }
186
187 static int link_working_working(struct link *l_ptr)
188 {
189 return (l_ptr->state == WORKING_WORKING);
190 }
191
192 static int link_working_unknown(struct link *l_ptr)
193 {
194 return (l_ptr->state == WORKING_UNKNOWN);
195 }
196
197 static int link_reset_unknown(struct link *l_ptr)
198 {
199 return (l_ptr->state == RESET_UNKNOWN);
200 }
201
202 static int link_reset_reset(struct link *l_ptr)
203 {
204 return (l_ptr->state == RESET_RESET);
205 }
206
207 static int link_blocked(struct link *l_ptr)
208 {
209 return (l_ptr->exp_msg_count || l_ptr->blocked);
210 }
211
212 static int link_congested(struct link *l_ptr)
213 {
214 return (l_ptr->out_queue_size >= l_ptr->queue_limit[0]);
215 }
216
217 static u32 link_max_pkt(struct link *l_ptr)
218 {
219 return l_ptr->max_pkt;
220 }
221
222 static void link_init_max_pkt(struct link *l_ptr)
223 {
224 u32 max_pkt;
225
226 max_pkt = (l_ptr->b_ptr->publ.mtu & ~3);
227 if (max_pkt > MAX_MSG_SIZE)
228 max_pkt = MAX_MSG_SIZE;
229
230 l_ptr->max_pkt_target = max_pkt;
231 if (l_ptr->max_pkt_target < MAX_PKT_DEFAULT)
232 l_ptr->max_pkt = l_ptr->max_pkt_target;
233 else
234 l_ptr->max_pkt = MAX_PKT_DEFAULT;
235
236 l_ptr->max_pkt_probes = 0;
237 }
238
239 static u32 link_next_sent(struct link *l_ptr)
240 {
241 if (l_ptr->next_out)
242 return msg_seqno(buf_msg(l_ptr->next_out));
243 return mod(l_ptr->next_out_no);
244 }
245
246 static u32 link_last_sent(struct link *l_ptr)
247 {
248 return mod(link_next_sent(l_ptr) - 1);
249 }
250
251 /*
252 * Simple non-static link routines (i.e. referenced outside this file)
253 */
254
255 int tipc_link_is_up(struct link *l_ptr)
256 {
257 if (!l_ptr)
258 return 0;
259 return (link_working_working(l_ptr) || link_working_unknown(l_ptr));
260 }
261
262 int tipc_link_is_active(struct link *l_ptr)
263 {
264 return ((l_ptr->owner->active_links[0] == l_ptr) ||
265 (l_ptr->owner->active_links[1] == l_ptr));
266 }
267
268 /**
269 * link_name_validate - validate & (optionally) deconstruct link name
270 * @name - ptr to link name string
271 * @name_parts - ptr to area for link name components (or NULL if not needed)
272 *
273 * Returns 1 if link name is valid, otherwise 0.
274 */
275
276 static int link_name_validate(const char *name, struct link_name *name_parts)
277 {
278 char name_copy[TIPC_MAX_LINK_NAME];
279 char *addr_local;
280 char *if_local;
281 char *addr_peer;
282 char *if_peer;
283 char dummy;
284 u32 z_local, c_local, n_local;
285 u32 z_peer, c_peer, n_peer;
286 u32 if_local_len;
287 u32 if_peer_len;
288
289 /* copy link name & ensure length is OK */
290
291 name_copy[TIPC_MAX_LINK_NAME - 1] = 0;
292 /* need above in case non-Posix strncpy() doesn't pad with nulls */
293 strncpy(name_copy, name, TIPC_MAX_LINK_NAME);
294 if (name_copy[TIPC_MAX_LINK_NAME - 1] != 0)
295 return 0;
296
297 /* ensure all component parts of link name are present */
298
299 addr_local = name_copy;
300 if ((if_local = strchr(addr_local, ':')) == NULL)
301 return 0;
302 *(if_local++) = 0;
303 if ((addr_peer = strchr(if_local, '-')) == NULL)
304 return 0;
305 *(addr_peer++) = 0;
306 if_local_len = addr_peer - if_local;
307 if ((if_peer = strchr(addr_peer, ':')) == NULL)
308 return 0;
309 *(if_peer++) = 0;
310 if_peer_len = strlen(if_peer) + 1;
311
312 /* validate component parts of link name */
313
314 if ((sscanf(addr_local, "%u.%u.%u%c",
315 &z_local, &c_local, &n_local, &dummy) != 3) ||
316 (sscanf(addr_peer, "%u.%u.%u%c",
317 &z_peer, &c_peer, &n_peer, &dummy) != 3) ||
318 (z_local > 255) || (c_local > 4095) || (n_local > 4095) ||
319 (z_peer > 255) || (c_peer > 4095) || (n_peer > 4095) ||
320 (if_local_len <= 1) || (if_local_len > TIPC_MAX_IF_NAME) ||
321 (if_peer_len <= 1) || (if_peer_len > TIPC_MAX_IF_NAME) ||
322 (strspn(if_local, tipc_alphabet) != (if_local_len - 1)) ||
323 (strspn(if_peer, tipc_alphabet) != (if_peer_len - 1)))
324 return 0;
325
326 /* return link name components, if necessary */
327
328 if (name_parts) {
329 name_parts->addr_local = tipc_addr(z_local, c_local, n_local);
330 strcpy(name_parts->if_local, if_local);
331 name_parts->addr_peer = tipc_addr(z_peer, c_peer, n_peer);
332 strcpy(name_parts->if_peer, if_peer);
333 }
334 return 1;
335 }
336
337 /**
338 * link_timeout - handle expiration of link timer
339 * @l_ptr: pointer to link
340 *
341 * This routine must not grab "tipc_net_lock" to avoid a potential deadlock conflict
342 * with tipc_link_delete(). (There is no risk that the node will be deleted by
343 * another thread because tipc_link_delete() always cancels the link timer before
344 * tipc_node_delete() is called.)
345 */
346
347 static void link_timeout(struct link *l_ptr)
348 {
349 tipc_node_lock(l_ptr->owner);
350
351 /* update counters used in statistical profiling of send traffic */
352
353 l_ptr->stats.accu_queue_sz += l_ptr->out_queue_size;
354 l_ptr->stats.queue_sz_counts++;
355
356 if (l_ptr->out_queue_size > l_ptr->stats.max_queue_sz)
357 l_ptr->stats.max_queue_sz = l_ptr->out_queue_size;
358
359 if (l_ptr->first_out) {
360 struct tipc_msg *msg = buf_msg(l_ptr->first_out);
361 u32 length = msg_size(msg);
362
363 if ((msg_user(msg) == MSG_FRAGMENTER)
364 && (msg_type(msg) == FIRST_FRAGMENT)) {
365 length = msg_size(msg_get_wrapped(msg));
366 }
367 if (length) {
368 l_ptr->stats.msg_lengths_total += length;
369 l_ptr->stats.msg_length_counts++;
370 if (length <= 64)
371 l_ptr->stats.msg_length_profile[0]++;
372 else if (length <= 256)
373 l_ptr->stats.msg_length_profile[1]++;
374 else if (length <= 1024)
375 l_ptr->stats.msg_length_profile[2]++;
376 else if (length <= 4096)
377 l_ptr->stats.msg_length_profile[3]++;
378 else if (length <= 16384)
379 l_ptr->stats.msg_length_profile[4]++;
380 else if (length <= 32768)
381 l_ptr->stats.msg_length_profile[5]++;
382 else
383 l_ptr->stats.msg_length_profile[6]++;
384 }
385 }
386
387 /* do all other link processing performed on a periodic basis */
388
389 link_check_defragm_bufs(l_ptr);
390
391 link_state_event(l_ptr, TIMEOUT_EVT);
392
393 if (l_ptr->next_out)
394 tipc_link_push_queue(l_ptr);
395
396 tipc_node_unlock(l_ptr->owner);
397 }
398
399 static void link_set_timer(struct link *l_ptr, u32 time)
400 {
401 k_start_timer(&l_ptr->timer, time);
402 }
403
404 /**
405 * tipc_link_create - create a new link
406 * @b_ptr: pointer to associated bearer
407 * @peer: network address of node at other end of link
408 * @media_addr: media address to use when sending messages over link
409 *
410 * Returns pointer to link.
411 */
412
413 struct link *tipc_link_create(struct bearer *b_ptr, const u32 peer,
414 const struct tipc_media_addr *media_addr)
415 {
416 struct link *l_ptr;
417 struct tipc_msg *msg;
418 char *if_name;
419
420 l_ptr = kzalloc(sizeof(*l_ptr), GFP_ATOMIC);
421 if (!l_ptr) {
422 warn("Link creation failed, no memory\n");
423 return NULL;
424 }
425
426 if (LINK_LOG_BUF_SIZE) {
427 char *pb = kmalloc(LINK_LOG_BUF_SIZE, GFP_ATOMIC);
428
429 if (!pb) {
430 kfree(l_ptr);
431 warn("Link creation failed, no memory for print buffer\n");
432 return NULL;
433 }
434 tipc_printbuf_init(&l_ptr->print_buf, pb, LINK_LOG_BUF_SIZE);
435 }
436
437 l_ptr->addr = peer;
438 if_name = strchr(b_ptr->publ.name, ':') + 1;
439 sprintf(l_ptr->name, "%u.%u.%u:%s-%u.%u.%u:",
440 tipc_zone(tipc_own_addr), tipc_cluster(tipc_own_addr),
441 tipc_node(tipc_own_addr),
442 if_name,
443 tipc_zone(peer), tipc_cluster(peer), tipc_node(peer));
444 /* note: peer i/f is appended to link name by reset/activate */
445 memcpy(&l_ptr->media_addr, media_addr, sizeof(*media_addr));
446 l_ptr->checkpoint = 1;
447 l_ptr->b_ptr = b_ptr;
448 link_set_supervision_props(l_ptr, b_ptr->media->tolerance);
449 l_ptr->state = RESET_UNKNOWN;
450
451 l_ptr->pmsg = (struct tipc_msg *)&l_ptr->proto_msg;
452 msg = l_ptr->pmsg;
453 msg_init(msg, LINK_PROTOCOL, RESET_MSG, TIPC_OK, INT_H_SIZE, l_ptr->addr);
454 msg_set_size(msg, sizeof(l_ptr->proto_msg));
455 msg_set_session(msg, tipc_random);
456 msg_set_bearer_id(msg, b_ptr->identity);
457 strcpy((char *)msg_data(msg), if_name);
458
459 l_ptr->priority = b_ptr->priority;
460 tipc_link_set_queue_limits(l_ptr, b_ptr->media->window);
461
462 link_init_max_pkt(l_ptr);
463
464 l_ptr->next_out_no = 1;
465 INIT_LIST_HEAD(&l_ptr->waiting_ports);
466
467 link_reset_statistics(l_ptr);
468
469 l_ptr->owner = tipc_node_attach_link(l_ptr);
470 if (!l_ptr->owner) {
471 if (LINK_LOG_BUF_SIZE)
472 kfree(l_ptr->print_buf.buf);
473 kfree(l_ptr);
474 return NULL;
475 }
476
477 k_init_timer(&l_ptr->timer, (Handler)link_timeout, (unsigned long)l_ptr);
478 list_add_tail(&l_ptr->link_list, &b_ptr->links);
479 tipc_k_signal((Handler)tipc_link_start, (unsigned long)l_ptr);
480
481 dbg("tipc_link_create(): tolerance = %u,cont intv = %u, abort_limit = %u\n",
482 l_ptr->tolerance, l_ptr->continuity_interval, l_ptr->abort_limit);
483
484 return l_ptr;
485 }
486
487 /**
488 * tipc_link_delete - delete a link
489 * @l_ptr: pointer to link
490 *
491 * Note: 'tipc_net_lock' is write_locked, bearer is locked.
492 * This routine must not grab the node lock until after link timer cancellation
493 * to avoid a potential deadlock situation.
494 */
495
496 void tipc_link_delete(struct link *l_ptr)
497 {
498 if (!l_ptr) {
499 err("Attempt to delete non-existent link\n");
500 return;
501 }
502
503 dbg("tipc_link_delete()\n");
504
505 k_cancel_timer(&l_ptr->timer);
506
507 tipc_node_lock(l_ptr->owner);
508 tipc_link_reset(l_ptr);
509 tipc_node_detach_link(l_ptr->owner, l_ptr);
510 tipc_link_stop(l_ptr);
511 list_del_init(&l_ptr->link_list);
512 if (LINK_LOG_BUF_SIZE)
513 kfree(l_ptr->print_buf.buf);
514 tipc_node_unlock(l_ptr->owner);
515 k_term_timer(&l_ptr->timer);
516 kfree(l_ptr);
517 }
518
519 void tipc_link_start(struct link *l_ptr)
520 {
521 dbg("tipc_link_start %x\n", l_ptr);
522 link_state_event(l_ptr, STARTING_EVT);
523 }
524
525 /**
526 * link_schedule_port - schedule port for deferred sending
527 * @l_ptr: pointer to link
528 * @origport: reference to sending port
529 * @sz: amount of data to be sent
530 *
531 * Schedules port for renewed sending of messages after link congestion
532 * has abated.
533 */
534
535 static int link_schedule_port(struct link *l_ptr, u32 origport, u32 sz)
536 {
537 struct port *p_ptr;
538
539 spin_lock_bh(&tipc_port_list_lock);
540 p_ptr = tipc_port_lock(origport);
541 if (p_ptr) {
542 if (!p_ptr->wakeup)
543 goto exit;
544 if (!list_empty(&p_ptr->wait_list))
545 goto exit;
546 p_ptr->congested_link = l_ptr;
547 p_ptr->publ.congested = 1;
548 p_ptr->waiting_pkts = 1 + ((sz - 1) / link_max_pkt(l_ptr));
549 list_add_tail(&p_ptr->wait_list, &l_ptr->waiting_ports);
550 l_ptr->stats.link_congs++;
551 exit:
552 tipc_port_unlock(p_ptr);
553 }
554 spin_unlock_bh(&tipc_port_list_lock);
555 return -ELINKCONG;
556 }
557
558 void tipc_link_wakeup_ports(struct link *l_ptr, int all)
559 {
560 struct port *p_ptr;
561 struct port *temp_p_ptr;
562 int win = l_ptr->queue_limit[0] - l_ptr->out_queue_size;
563
564 if (all)
565 win = 100000;
566 if (win <= 0)
567 return;
568 if (!spin_trylock_bh(&tipc_port_list_lock))
569 return;
570 if (link_congested(l_ptr))
571 goto exit;
572 list_for_each_entry_safe(p_ptr, temp_p_ptr, &l_ptr->waiting_ports,
573 wait_list) {
574 if (win <= 0)
575 break;
576 list_del_init(&p_ptr->wait_list);
577 p_ptr->congested_link = NULL;
578 spin_lock_bh(p_ptr->publ.lock);
579 p_ptr->publ.congested = 0;
580 p_ptr->wakeup(&p_ptr->publ);
581 win -= p_ptr->waiting_pkts;
582 spin_unlock_bh(p_ptr->publ.lock);
583 }
584
585 exit:
586 spin_unlock_bh(&tipc_port_list_lock);
587 }
588
589 /**
590 * link_release_outqueue - purge link's outbound message queue
591 * @l_ptr: pointer to link
592 */
593
594 static void link_release_outqueue(struct link *l_ptr)
595 {
596 struct sk_buff *buf = l_ptr->first_out;
597 struct sk_buff *next;
598
599 while (buf) {
600 next = buf->next;
601 buf_discard(buf);
602 buf = next;
603 }
604 l_ptr->first_out = NULL;
605 l_ptr->out_queue_size = 0;
606 }
607
608 /**
609 * tipc_link_reset_fragments - purge link's inbound message fragments queue
610 * @l_ptr: pointer to link
611 */
612
613 void tipc_link_reset_fragments(struct link *l_ptr)
614 {
615 struct sk_buff *buf = l_ptr->defragm_buf;
616 struct sk_buff *next;
617
618 while (buf) {
619 next = buf->next;
620 buf_discard(buf);
621 buf = next;
622 }
623 l_ptr->defragm_buf = NULL;
624 }
625
626 /**
627 * tipc_link_stop - purge all inbound and outbound messages associated with link
628 * @l_ptr: pointer to link
629 */
630
631 void tipc_link_stop(struct link *l_ptr)
632 {
633 struct sk_buff *buf;
634 struct sk_buff *next;
635
636 buf = l_ptr->oldest_deferred_in;
637 while (buf) {
638 next = buf->next;
639 buf_discard(buf);
640 buf = next;
641 }
642
643 buf = l_ptr->first_out;
644 while (buf) {
645 next = buf->next;
646 buf_discard(buf);
647 buf = next;
648 }
649
650 tipc_link_reset_fragments(l_ptr);
651
652 buf_discard(l_ptr->proto_msg_queue);
653 l_ptr->proto_msg_queue = NULL;
654 }
655
656 #if 0
657
658 /* LINK EVENT CODE IS NOT SUPPORTED AT PRESENT */
659
660 static void link_recv_event(struct link_event *ev)
661 {
662 ev->fcn(ev->addr, ev->name, ev->up);
663 kfree(ev);
664 }
665
666 static void link_send_event(void (*fcn)(u32 a, char *n, int up),
667 struct link *l_ptr, int up)
668 {
669 struct link_event *ev;
670
671 ev = kmalloc(sizeof(*ev), GFP_ATOMIC);
672 if (!ev) {
673 warn("Link event allocation failure\n");
674 return;
675 }
676 ev->addr = l_ptr->addr;
677 ev->up = up;
678 ev->fcn = fcn;
679 memcpy(ev->name, l_ptr->name, TIPC_MAX_LINK_NAME);
680 tipc_k_signal((Handler)link_recv_event, (unsigned long)ev);
681 }
682
683 #else
684
685 #define link_send_event(fcn, l_ptr, up) do { } while (0)
686
687 #endif
688
689 void tipc_link_reset(struct link *l_ptr)
690 {
691 struct sk_buff *buf;
692 u32 prev_state = l_ptr->state;
693 u32 checkpoint = l_ptr->next_in_no;
694 int was_active_link = tipc_link_is_active(l_ptr);
695
696 msg_set_session(l_ptr->pmsg, msg_session(l_ptr->pmsg) + 1);
697
698 /* Link is down, accept any session: */
699 l_ptr->peer_session = 0;
700
701 /* Prepare for max packet size negotiation */
702 link_init_max_pkt(l_ptr);
703
704 l_ptr->state = RESET_UNKNOWN;
705 dbg_link_state("Resetting Link\n");
706
707 if ((prev_state == RESET_UNKNOWN) || (prev_state == RESET_RESET))
708 return;
709
710 tipc_node_link_down(l_ptr->owner, l_ptr);
711 tipc_bearer_remove_dest(l_ptr->b_ptr, l_ptr->addr);
712 #if 0
713 tipc_printf(TIPC_CONS, "\nReset link <%s>\n", l_ptr->name);
714 dbg_link_dump();
715 #endif
716 if (was_active_link && tipc_node_has_active_links(l_ptr->owner) &&
717 l_ptr->owner->permit_changeover) {
718 l_ptr->reset_checkpoint = checkpoint;
719 l_ptr->exp_msg_count = START_CHANGEOVER;
720 }
721
722 /* Clean up all queues: */
723
724 link_release_outqueue(l_ptr);
725 buf_discard(l_ptr->proto_msg_queue);
726 l_ptr->proto_msg_queue = NULL;
727 buf = l_ptr->oldest_deferred_in;
728 while (buf) {
729 struct sk_buff *next = buf->next;
730 buf_discard(buf);
731 buf = next;
732 }
733 if (!list_empty(&l_ptr->waiting_ports))
734 tipc_link_wakeup_ports(l_ptr, 1);
735
736 l_ptr->retransm_queue_head = 0;
737 l_ptr->retransm_queue_size = 0;
738 l_ptr->last_out = NULL;
739 l_ptr->first_out = NULL;
740 l_ptr->next_out = NULL;
741 l_ptr->unacked_window = 0;
742 l_ptr->checkpoint = 1;
743 l_ptr->next_out_no = 1;
744 l_ptr->deferred_inqueue_sz = 0;
745 l_ptr->oldest_deferred_in = NULL;
746 l_ptr->newest_deferred_in = NULL;
747 l_ptr->fsm_msg_cnt = 0;
748 l_ptr->stale_count = 0;
749 link_reset_statistics(l_ptr);
750
751 link_send_event(tipc_cfg_link_event, l_ptr, 0);
752 if (!in_own_cluster(l_ptr->addr))
753 link_send_event(tipc_disc_link_event, l_ptr, 0);
754 }
755
756
757 static void link_activate(struct link *l_ptr)
758 {
759 l_ptr->next_in_no = l_ptr->stats.recv_info = 1;
760 tipc_node_link_up(l_ptr->owner, l_ptr);
761 tipc_bearer_add_dest(l_ptr->b_ptr, l_ptr->addr);
762 link_send_event(tipc_cfg_link_event, l_ptr, 1);
763 if (!in_own_cluster(l_ptr->addr))
764 link_send_event(tipc_disc_link_event, l_ptr, 1);
765 }
766
767 /**
768 * link_state_event - link finite state machine
769 * @l_ptr: pointer to link
770 * @event: state machine event to process
771 */
772
773 static void link_state_event(struct link *l_ptr, unsigned event)
774 {
775 struct link *other;
776 u32 cont_intv = l_ptr->continuity_interval;
777
778 if (!l_ptr->started && (event != STARTING_EVT))
779 return; /* Not yet. */
780
781 if (link_blocked(l_ptr)) {
782 if (event == TIMEOUT_EVT) {
783 link_set_timer(l_ptr, cont_intv);
784 }
785 return; /* Changeover going on */
786 }
787 dbg_link("STATE_EV: <%s> ", l_ptr->name);
788
789 switch (l_ptr->state) {
790 case WORKING_WORKING:
791 dbg_link("WW/");
792 switch (event) {
793 case TRAFFIC_MSG_EVT:
794 dbg_link("TRF-");
795 /* fall through */
796 case ACTIVATE_MSG:
797 dbg_link("ACT\n");
798 break;
799 case TIMEOUT_EVT:
800 dbg_link("TIM ");
801 if (l_ptr->next_in_no != l_ptr->checkpoint) {
802 l_ptr->checkpoint = l_ptr->next_in_no;
803 if (tipc_bclink_acks_missing(l_ptr->owner)) {
804 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
805 0, 0, 0, 0, 0);
806 l_ptr->fsm_msg_cnt++;
807 } else if (l_ptr->max_pkt < l_ptr->max_pkt_target) {
808 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
809 1, 0, 0, 0, 0);
810 l_ptr->fsm_msg_cnt++;
811 }
812 link_set_timer(l_ptr, cont_intv);
813 break;
814 }
815 dbg_link(" -> WU\n");
816 l_ptr->state = WORKING_UNKNOWN;
817 l_ptr->fsm_msg_cnt = 0;
818 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 1, 0, 0, 0, 0);
819 l_ptr->fsm_msg_cnt++;
820 link_set_timer(l_ptr, cont_intv / 4);
821 break;
822 case RESET_MSG:
823 dbg_link("RES -> RR\n");
824 info("Resetting link <%s>, requested by peer\n",
825 l_ptr->name);
826 tipc_link_reset(l_ptr);
827 l_ptr->state = RESET_RESET;
828 l_ptr->fsm_msg_cnt = 0;
829 tipc_link_send_proto_msg(l_ptr, ACTIVATE_MSG, 0, 0, 0, 0, 0);
830 l_ptr->fsm_msg_cnt++;
831 link_set_timer(l_ptr, cont_intv);
832 break;
833 default:
834 err("Unknown link event %u in WW state\n", event);
835 }
836 break;
837 case WORKING_UNKNOWN:
838 dbg_link("WU/");
839 switch (event) {
840 case TRAFFIC_MSG_EVT:
841 dbg_link("TRF-");
842 case ACTIVATE_MSG:
843 dbg_link("ACT -> WW\n");
844 l_ptr->state = WORKING_WORKING;
845 l_ptr->fsm_msg_cnt = 0;
846 link_set_timer(l_ptr, cont_intv);
847 break;
848 case RESET_MSG:
849 dbg_link("RES -> RR\n");
850 info("Resetting link <%s>, requested by peer "
851 "while probing\n", l_ptr->name);
852 tipc_link_reset(l_ptr);
853 l_ptr->state = RESET_RESET;
854 l_ptr->fsm_msg_cnt = 0;
855 tipc_link_send_proto_msg(l_ptr, ACTIVATE_MSG, 0, 0, 0, 0, 0);
856 l_ptr->fsm_msg_cnt++;
857 link_set_timer(l_ptr, cont_intv);
858 break;
859 case TIMEOUT_EVT:
860 dbg_link("TIM ");
861 if (l_ptr->next_in_no != l_ptr->checkpoint) {
862 dbg_link("-> WW \n");
863 l_ptr->state = WORKING_WORKING;
864 l_ptr->fsm_msg_cnt = 0;
865 l_ptr->checkpoint = l_ptr->next_in_no;
866 if (tipc_bclink_acks_missing(l_ptr->owner)) {
867 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
868 0, 0, 0, 0, 0);
869 l_ptr->fsm_msg_cnt++;
870 }
871 link_set_timer(l_ptr, cont_intv);
872 } else if (l_ptr->fsm_msg_cnt < l_ptr->abort_limit) {
873 dbg_link("Probing %u/%u,timer = %u ms)\n",
874 l_ptr->fsm_msg_cnt, l_ptr->abort_limit,
875 cont_intv / 4);
876 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
877 1, 0, 0, 0, 0);
878 l_ptr->fsm_msg_cnt++;
879 link_set_timer(l_ptr, cont_intv / 4);
880 } else { /* Link has failed */
881 dbg_link("-> RU (%u probes unanswered)\n",
882 l_ptr->fsm_msg_cnt);
883 warn("Resetting link <%s>, peer not responding\n",
884 l_ptr->name);
885 tipc_link_reset(l_ptr);
886 l_ptr->state = RESET_UNKNOWN;
887 l_ptr->fsm_msg_cnt = 0;
888 tipc_link_send_proto_msg(l_ptr, RESET_MSG,
889 0, 0, 0, 0, 0);
890 l_ptr->fsm_msg_cnt++;
891 link_set_timer(l_ptr, cont_intv);
892 }
893 break;
894 default:
895 err("Unknown link event %u in WU state\n", event);
896 }
897 break;
898 case RESET_UNKNOWN:
899 dbg_link("RU/");
900 switch (event) {
901 case TRAFFIC_MSG_EVT:
902 dbg_link("TRF-\n");
903 break;
904 case ACTIVATE_MSG:
905 other = l_ptr->owner->active_links[0];
906 if (other && link_working_unknown(other)) {
907 dbg_link("ACT\n");
908 break;
909 }
910 dbg_link("ACT -> WW\n");
911 l_ptr->state = WORKING_WORKING;
912 l_ptr->fsm_msg_cnt = 0;
913 link_activate(l_ptr);
914 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 1, 0, 0, 0, 0);
915 l_ptr->fsm_msg_cnt++;
916 link_set_timer(l_ptr, cont_intv);
917 break;
918 case RESET_MSG:
919 dbg_link("RES \n");
920 dbg_link(" -> RR\n");
921 l_ptr->state = RESET_RESET;
922 l_ptr->fsm_msg_cnt = 0;
923 tipc_link_send_proto_msg(l_ptr, ACTIVATE_MSG, 1, 0, 0, 0, 0);
924 l_ptr->fsm_msg_cnt++;
925 link_set_timer(l_ptr, cont_intv);
926 break;
927 case STARTING_EVT:
928 dbg_link("START-");
929 l_ptr->started = 1;
930 /* fall through */
931 case TIMEOUT_EVT:
932 dbg_link("TIM \n");
933 tipc_link_send_proto_msg(l_ptr, RESET_MSG, 0, 0, 0, 0, 0);
934 l_ptr->fsm_msg_cnt++;
935 link_set_timer(l_ptr, cont_intv);
936 break;
937 default:
938 err("Unknown link event %u in RU state\n", event);
939 }
940 break;
941 case RESET_RESET:
942 dbg_link("RR/ ");
943 switch (event) {
944 case TRAFFIC_MSG_EVT:
945 dbg_link("TRF-");
946 /* fall through */
947 case ACTIVATE_MSG:
948 other = l_ptr->owner->active_links[0];
949 if (other && link_working_unknown(other)) {
950 dbg_link("ACT\n");
951 break;
952 }
953 dbg_link("ACT -> WW\n");
954 l_ptr->state = WORKING_WORKING;
955 l_ptr->fsm_msg_cnt = 0;
956 link_activate(l_ptr);
957 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 1, 0, 0, 0, 0);
958 l_ptr->fsm_msg_cnt++;
959 link_set_timer(l_ptr, cont_intv);
960 break;
961 case RESET_MSG:
962 dbg_link("RES\n");
963 break;
964 case TIMEOUT_EVT:
965 dbg_link("TIM\n");
966 tipc_link_send_proto_msg(l_ptr, ACTIVATE_MSG, 0, 0, 0, 0, 0);
967 l_ptr->fsm_msg_cnt++;
968 link_set_timer(l_ptr, cont_intv);
969 dbg_link("fsm_msg_cnt %u\n", l_ptr->fsm_msg_cnt);
970 break;
971 default:
972 err("Unknown link event %u in RR state\n", event);
973 }
974 break;
975 default:
976 err("Unknown link state %u/%u\n", l_ptr->state, event);
977 }
978 }
979
980 /*
981 * link_bundle_buf(): Append contents of a buffer to
982 * the tail of an existing one.
983 */
984
985 static int link_bundle_buf(struct link *l_ptr,
986 struct sk_buff *bundler,
987 struct sk_buff *buf)
988 {
989 struct tipc_msg *bundler_msg = buf_msg(bundler);
990 struct tipc_msg *msg = buf_msg(buf);
991 u32 size = msg_size(msg);
992 u32 bundle_size = msg_size(bundler_msg);
993 u32 to_pos = align(bundle_size);
994 u32 pad = to_pos - bundle_size;
995
996 if (msg_user(bundler_msg) != MSG_BUNDLER)
997 return 0;
998 if (msg_type(bundler_msg) != OPEN_MSG)
999 return 0;
1000 if (skb_tailroom(bundler) < (pad + size))
1001 return 0;
1002 if (link_max_pkt(l_ptr) < (to_pos + size))
1003 return 0;
1004
1005 skb_put(bundler, pad + size);
1006 skb_copy_to_linear_data_offset(bundler, to_pos, buf->data, size);
1007 msg_set_size(bundler_msg, to_pos + size);
1008 msg_set_msgcnt(bundler_msg, msg_msgcnt(bundler_msg) + 1);
1009 dbg("Packed msg # %u(%u octets) into pos %u in buf(#%u)\n",
1010 msg_msgcnt(bundler_msg), size, to_pos, msg_seqno(bundler_msg));
1011 msg_dbg(msg, "PACKD:");
1012 buf_discard(buf);
1013 l_ptr->stats.sent_bundled++;
1014 return 1;
1015 }
1016
1017 static void link_add_to_outqueue(struct link *l_ptr,
1018 struct sk_buff *buf,
1019 struct tipc_msg *msg)
1020 {
1021 u32 ack = mod(l_ptr->next_in_no - 1);
1022 u32 seqno = mod(l_ptr->next_out_no++);
1023
1024 msg_set_word(msg, 2, ((ack << 16) | seqno));
1025 msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in);
1026 buf->next = NULL;
1027 if (l_ptr->first_out) {
1028 l_ptr->last_out->next = buf;
1029 l_ptr->last_out = buf;
1030 } else
1031 l_ptr->first_out = l_ptr->last_out = buf;
1032 l_ptr->out_queue_size++;
1033 }
1034
1035 /*
1036 * tipc_link_send_buf() is the 'full path' for messages, called from
1037 * inside TIPC when the 'fast path' in tipc_send_buf
1038 * has failed, and from link_send()
1039 */
1040
1041 int tipc_link_send_buf(struct link *l_ptr, struct sk_buff *buf)
1042 {
1043 struct tipc_msg *msg = buf_msg(buf);
1044 u32 size = msg_size(msg);
1045 u32 dsz = msg_data_sz(msg);
1046 u32 queue_size = l_ptr->out_queue_size;
1047 u32 imp = msg_tot_importance(msg);
1048 u32 queue_limit = l_ptr->queue_limit[imp];
1049 u32 max_packet = link_max_pkt(l_ptr);
1050
1051 msg_set_prevnode(msg, tipc_own_addr); /* If routed message */
1052
1053 /* Match msg importance against queue limits: */
1054
1055 if (unlikely(queue_size >= queue_limit)) {
1056 if (imp <= TIPC_CRITICAL_IMPORTANCE) {
1057 return link_schedule_port(l_ptr, msg_origport(msg),
1058 size);
1059 }
1060 msg_dbg(msg, "TIPC: Congestion, throwing away\n");
1061 buf_discard(buf);
1062 if (imp > CONN_MANAGER) {
1063 warn("Resetting link <%s>, send queue full", l_ptr->name);
1064 tipc_link_reset(l_ptr);
1065 }
1066 return dsz;
1067 }
1068
1069 /* Fragmentation needed ? */
1070
1071 if (size > max_packet)
1072 return tipc_link_send_long_buf(l_ptr, buf);
1073
1074 /* Packet can be queued or sent: */
1075
1076 if (queue_size > l_ptr->stats.max_queue_sz)
1077 l_ptr->stats.max_queue_sz = queue_size;
1078
1079 if (likely(!tipc_bearer_congested(l_ptr->b_ptr, l_ptr) &&
1080 !link_congested(l_ptr))) {
1081 link_add_to_outqueue(l_ptr, buf, msg);
1082
1083 if (likely(tipc_bearer_send(l_ptr->b_ptr, buf, &l_ptr->media_addr))) {
1084 l_ptr->unacked_window = 0;
1085 } else {
1086 tipc_bearer_schedule(l_ptr->b_ptr, l_ptr);
1087 l_ptr->stats.bearer_congs++;
1088 l_ptr->next_out = buf;
1089 }
1090 return dsz;
1091 }
1092 /* Congestion: can message be bundled ?: */
1093
1094 if ((msg_user(msg) != CHANGEOVER_PROTOCOL) &&
1095 (msg_user(msg) != MSG_FRAGMENTER)) {
1096
1097 /* Try adding message to an existing bundle */
1098
1099 if (l_ptr->next_out &&
1100 link_bundle_buf(l_ptr, l_ptr->last_out, buf)) {
1101 tipc_bearer_resolve_congestion(l_ptr->b_ptr, l_ptr);
1102 return dsz;
1103 }
1104
1105 /* Try creating a new bundle */
1106
1107 if (size <= max_packet * 2 / 3) {
1108 struct sk_buff *bundler = buf_acquire(max_packet);
1109 struct tipc_msg bundler_hdr;
1110
1111 if (bundler) {
1112 msg_init(&bundler_hdr, MSG_BUNDLER, OPEN_MSG,
1113 TIPC_OK, INT_H_SIZE, l_ptr->addr);
1114 skb_copy_to_linear_data(bundler, &bundler_hdr,
1115 INT_H_SIZE);
1116 skb_trim(bundler, INT_H_SIZE);
1117 link_bundle_buf(l_ptr, bundler, buf);
1118 buf = bundler;
1119 msg = buf_msg(buf);
1120 l_ptr->stats.sent_bundles++;
1121 }
1122 }
1123 }
1124 if (!l_ptr->next_out)
1125 l_ptr->next_out = buf;
1126 link_add_to_outqueue(l_ptr, buf, msg);
1127 tipc_bearer_resolve_congestion(l_ptr->b_ptr, l_ptr);
1128 return dsz;
1129 }
1130
1131 /*
1132 * tipc_link_send(): same as tipc_link_send_buf(), but the link to use has
1133 * not been selected yet, and the the owner node is not locked
1134 * Called by TIPC internal users, e.g. the name distributor
1135 */
1136
1137 int tipc_link_send(struct sk_buff *buf, u32 dest, u32 selector)
1138 {
1139 struct link *l_ptr;
1140 struct node *n_ptr;
1141 int res = -ELINKCONG;
1142
1143 read_lock_bh(&tipc_net_lock);
1144 n_ptr = tipc_node_select(dest, selector);
1145 if (n_ptr) {
1146 tipc_node_lock(n_ptr);
1147 l_ptr = n_ptr->active_links[selector & 1];
1148 if (l_ptr) {
1149 dbg("tipc_link_send: found link %x for dest %x\n", l_ptr, dest);
1150 res = tipc_link_send_buf(l_ptr, buf);
1151 } else {
1152 dbg("Attempt to send msg to unreachable node:\n");
1153 msg_dbg(buf_msg(buf),">>>");
1154 buf_discard(buf);
1155 }
1156 tipc_node_unlock(n_ptr);
1157 } else {
1158 dbg("Attempt to send msg to unknown node:\n");
1159 msg_dbg(buf_msg(buf),">>>");
1160 buf_discard(buf);
1161 }
1162 read_unlock_bh(&tipc_net_lock);
1163 return res;
1164 }
1165
1166 /*
1167 * link_send_buf_fast: Entry for data messages where the
1168 * destination link is known and the header is complete,
1169 * inclusive total message length. Very time critical.
1170 * Link is locked. Returns user data length.
1171 */
1172
1173 static int link_send_buf_fast(struct link *l_ptr, struct sk_buff *buf,
1174 u32 *used_max_pkt)
1175 {
1176 struct tipc_msg *msg = buf_msg(buf);
1177 int res = msg_data_sz(msg);
1178
1179 if (likely(!link_congested(l_ptr))) {
1180 if (likely(msg_size(msg) <= link_max_pkt(l_ptr))) {
1181 if (likely(list_empty(&l_ptr->b_ptr->cong_links))) {
1182 link_add_to_outqueue(l_ptr, buf, msg);
1183 if (likely(tipc_bearer_send(l_ptr->b_ptr, buf,
1184 &l_ptr->media_addr))) {
1185 l_ptr->unacked_window = 0;
1186 msg_dbg(msg,"SENT_FAST:");
1187 return res;
1188 }
1189 dbg("failed sent fast...\n");
1190 tipc_bearer_schedule(l_ptr->b_ptr, l_ptr);
1191 l_ptr->stats.bearer_congs++;
1192 l_ptr->next_out = buf;
1193 return res;
1194 }
1195 }
1196 else
1197 *used_max_pkt = link_max_pkt(l_ptr);
1198 }
1199 return tipc_link_send_buf(l_ptr, buf); /* All other cases */
1200 }
1201
1202 /*
1203 * tipc_send_buf_fast: Entry for data messages where the
1204 * destination node is known and the header is complete,
1205 * inclusive total message length.
1206 * Returns user data length.
1207 */
1208 int tipc_send_buf_fast(struct sk_buff *buf, u32 destnode)
1209 {
1210 struct link *l_ptr;
1211 struct node *n_ptr;
1212 int res;
1213 u32 selector = msg_origport(buf_msg(buf)) & 1;
1214 u32 dummy;
1215
1216 if (destnode == tipc_own_addr)
1217 return tipc_port_recv_msg(buf);
1218
1219 read_lock_bh(&tipc_net_lock);
1220 n_ptr = tipc_node_select(destnode, selector);
1221 if (likely(n_ptr)) {
1222 tipc_node_lock(n_ptr);
1223 l_ptr = n_ptr->active_links[selector];
1224 dbg("send_fast: buf %x selected %x, destnode = %x\n",
1225 buf, l_ptr, destnode);
1226 if (likely(l_ptr)) {
1227 res = link_send_buf_fast(l_ptr, buf, &dummy);
1228 tipc_node_unlock(n_ptr);
1229 read_unlock_bh(&tipc_net_lock);
1230 return res;
1231 }
1232 tipc_node_unlock(n_ptr);
1233 }
1234 read_unlock_bh(&tipc_net_lock);
1235 res = msg_data_sz(buf_msg(buf));
1236 tipc_reject_msg(buf, TIPC_ERR_NO_NODE);
1237 return res;
1238 }
1239
1240
1241 /*
1242 * tipc_link_send_sections_fast: Entry for messages where the
1243 * destination processor is known and the header is complete,
1244 * except for total message length.
1245 * Returns user data length or errno.
1246 */
1247 int tipc_link_send_sections_fast(struct port *sender,
1248 struct iovec const *msg_sect,
1249 const u32 num_sect,
1250 u32 destaddr)
1251 {
1252 struct tipc_msg *hdr = &sender->publ.phdr;
1253 struct link *l_ptr;
1254 struct sk_buff *buf;
1255 struct node *node;
1256 int res;
1257 u32 selector = msg_origport(hdr) & 1;
1258
1259 again:
1260 /*
1261 * Try building message using port's max_pkt hint.
1262 * (Must not hold any locks while building message.)
1263 */
1264
1265 res = msg_build(hdr, msg_sect, num_sect, sender->publ.max_pkt,
1266 !sender->user_port, &buf);
1267
1268 read_lock_bh(&tipc_net_lock);
1269 node = tipc_node_select(destaddr, selector);
1270 if (likely(node)) {
1271 tipc_node_lock(node);
1272 l_ptr = node->active_links[selector];
1273 if (likely(l_ptr)) {
1274 if (likely(buf)) {
1275 res = link_send_buf_fast(l_ptr, buf,
1276 &sender->publ.max_pkt);
1277 if (unlikely(res < 0))
1278 buf_discard(buf);
1279 exit:
1280 tipc_node_unlock(node);
1281 read_unlock_bh(&tipc_net_lock);
1282 return res;
1283 }
1284
1285 /* Exit if build request was invalid */
1286
1287 if (unlikely(res < 0))
1288 goto exit;
1289
1290 /* Exit if link (or bearer) is congested */
1291
1292 if (link_congested(l_ptr) ||
1293 !list_empty(&l_ptr->b_ptr->cong_links)) {
1294 res = link_schedule_port(l_ptr,
1295 sender->publ.ref, res);
1296 goto exit;
1297 }
1298
1299 /*
1300 * Message size exceeds max_pkt hint; update hint,
1301 * then re-try fast path or fragment the message
1302 */
1303
1304 sender->publ.max_pkt = link_max_pkt(l_ptr);
1305 tipc_node_unlock(node);
1306 read_unlock_bh(&tipc_net_lock);
1307
1308
1309 if ((msg_hdr_sz(hdr) + res) <= sender->publ.max_pkt)
1310 goto again;
1311
1312 return link_send_sections_long(sender, msg_sect,
1313 num_sect, destaddr);
1314 }
1315 tipc_node_unlock(node);
1316 }
1317 read_unlock_bh(&tipc_net_lock);
1318
1319 /* Couldn't find a link to the destination node */
1320
1321 if (buf)
1322 return tipc_reject_msg(buf, TIPC_ERR_NO_NODE);
1323 if (res >= 0)
1324 return tipc_port_reject_sections(sender, hdr, msg_sect, num_sect,
1325 TIPC_ERR_NO_NODE);
1326 return res;
1327 }
1328
1329 /*
1330 * link_send_sections_long(): Entry for long messages where the
1331 * destination node is known and the header is complete,
1332 * inclusive total message length.
1333 * Link and bearer congestion status have been checked to be ok,
1334 * and are ignored if they change.
1335 *
1336 * Note that fragments do not use the full link MTU so that they won't have
1337 * to undergo refragmentation if link changeover causes them to be sent
1338 * over another link with an additional tunnel header added as prefix.
1339 * (Refragmentation will still occur if the other link has a smaller MTU.)
1340 *
1341 * Returns user data length or errno.
1342 */
1343 static int link_send_sections_long(struct port *sender,
1344 struct iovec const *msg_sect,
1345 u32 num_sect,
1346 u32 destaddr)
1347 {
1348 struct link *l_ptr;
1349 struct node *node;
1350 struct tipc_msg *hdr = &sender->publ.phdr;
1351 u32 dsz = msg_data_sz(hdr);
1352 u32 max_pkt,fragm_sz,rest;
1353 struct tipc_msg fragm_hdr;
1354 struct sk_buff *buf,*buf_chain,*prev;
1355 u32 fragm_crs,fragm_rest,hsz,sect_rest;
1356 const unchar *sect_crs;
1357 int curr_sect;
1358 u32 fragm_no;
1359
1360 again:
1361 fragm_no = 1;
1362 max_pkt = sender->publ.max_pkt - INT_H_SIZE;
1363 /* leave room for tunnel header in case of link changeover */
1364 fragm_sz = max_pkt - INT_H_SIZE;
1365 /* leave room for fragmentation header in each fragment */
1366 rest = dsz;
1367 fragm_crs = 0;
1368 fragm_rest = 0;
1369 sect_rest = 0;
1370 sect_crs = NULL;
1371 curr_sect = -1;
1372
1373 /* Prepare reusable fragment header: */
1374
1375 msg_dbg(hdr, ">FRAGMENTING>");
1376 msg_init(&fragm_hdr, MSG_FRAGMENTER, FIRST_FRAGMENT,
1377 TIPC_OK, INT_H_SIZE, msg_destnode(hdr));
1378 msg_set_link_selector(&fragm_hdr, sender->publ.ref);
1379 msg_set_size(&fragm_hdr, max_pkt);
1380 msg_set_fragm_no(&fragm_hdr, 1);
1381
1382 /* Prepare header of first fragment: */
1383
1384 buf_chain = buf = buf_acquire(max_pkt);
1385 if (!buf)
1386 return -ENOMEM;
1387 buf->next = NULL;
1388 skb_copy_to_linear_data(buf, &fragm_hdr, INT_H_SIZE);
1389 hsz = msg_hdr_sz(hdr);
1390 skb_copy_to_linear_data_offset(buf, INT_H_SIZE, hdr, hsz);
1391 msg_dbg(buf_msg(buf), ">BUILD>");
1392
1393 /* Chop up message: */
1394
1395 fragm_crs = INT_H_SIZE + hsz;
1396 fragm_rest = fragm_sz - hsz;
1397
1398 do { /* For all sections */
1399 u32 sz;
1400
1401 if (!sect_rest) {
1402 sect_rest = msg_sect[++curr_sect].iov_len;
1403 sect_crs = (const unchar *)msg_sect[curr_sect].iov_base;
1404 }
1405
1406 if (sect_rest < fragm_rest)
1407 sz = sect_rest;
1408 else
1409 sz = fragm_rest;
1410
1411 if (likely(!sender->user_port)) {
1412 if (copy_from_user(buf->data + fragm_crs, sect_crs, sz)) {
1413 error:
1414 for (; buf_chain; buf_chain = buf) {
1415 buf = buf_chain->next;
1416 buf_discard(buf_chain);
1417 }
1418 return -EFAULT;
1419 }
1420 } else
1421 skb_copy_to_linear_data_offset(buf, fragm_crs,
1422 sect_crs, sz);
1423 sect_crs += sz;
1424 sect_rest -= sz;
1425 fragm_crs += sz;
1426 fragm_rest -= sz;
1427 rest -= sz;
1428
1429 if (!fragm_rest && rest) {
1430
1431 /* Initiate new fragment: */
1432 if (rest <= fragm_sz) {
1433 fragm_sz = rest;
1434 msg_set_type(&fragm_hdr,LAST_FRAGMENT);
1435 } else {
1436 msg_set_type(&fragm_hdr, FRAGMENT);
1437 }
1438 msg_set_size(&fragm_hdr, fragm_sz + INT_H_SIZE);
1439 msg_set_fragm_no(&fragm_hdr, ++fragm_no);
1440 prev = buf;
1441 buf = buf_acquire(fragm_sz + INT_H_SIZE);
1442 if (!buf)
1443 goto error;
1444
1445 buf->next = NULL;
1446 prev->next = buf;
1447 skb_copy_to_linear_data(buf, &fragm_hdr, INT_H_SIZE);
1448 fragm_crs = INT_H_SIZE;
1449 fragm_rest = fragm_sz;
1450 msg_dbg(buf_msg(buf)," >BUILD>");
1451 }
1452 }
1453 while (rest > 0);
1454
1455 /*
1456 * Now we have a buffer chain. Select a link and check
1457 * that packet size is still OK
1458 */
1459 node = tipc_node_select(destaddr, sender->publ.ref & 1);
1460 if (likely(node)) {
1461 tipc_node_lock(node);
1462 l_ptr = node->active_links[sender->publ.ref & 1];
1463 if (!l_ptr) {
1464 tipc_node_unlock(node);
1465 goto reject;
1466 }
1467 if (link_max_pkt(l_ptr) < max_pkt) {
1468 sender->publ.max_pkt = link_max_pkt(l_ptr);
1469 tipc_node_unlock(node);
1470 for (; buf_chain; buf_chain = buf) {
1471 buf = buf_chain->next;
1472 buf_discard(buf_chain);
1473 }
1474 goto again;
1475 }
1476 } else {
1477 reject:
1478 for (; buf_chain; buf_chain = buf) {
1479 buf = buf_chain->next;
1480 buf_discard(buf_chain);
1481 }
1482 return tipc_port_reject_sections(sender, hdr, msg_sect, num_sect,
1483 TIPC_ERR_NO_NODE);
1484 }
1485
1486 /* Append whole chain to send queue: */
1487
1488 buf = buf_chain;
1489 l_ptr->long_msg_seq_no = mod(l_ptr->long_msg_seq_no + 1);
1490 if (!l_ptr->next_out)
1491 l_ptr->next_out = buf_chain;
1492 l_ptr->stats.sent_fragmented++;
1493 while (buf) {
1494 struct sk_buff *next = buf->next;
1495 struct tipc_msg *msg = buf_msg(buf);
1496
1497 l_ptr->stats.sent_fragments++;
1498 msg_set_long_msgno(msg, l_ptr->long_msg_seq_no);
1499 link_add_to_outqueue(l_ptr, buf, msg);
1500 msg_dbg(msg, ">ADD>");
1501 buf = next;
1502 }
1503
1504 /* Send it, if possible: */
1505
1506 tipc_link_push_queue(l_ptr);
1507 tipc_node_unlock(node);
1508 return dsz;
1509 }
1510
1511 /*
1512 * tipc_link_push_packet: Push one unsent packet to the media
1513 */
1514 u32 tipc_link_push_packet(struct link *l_ptr)
1515 {
1516 struct sk_buff *buf = l_ptr->first_out;
1517 u32 r_q_size = l_ptr->retransm_queue_size;
1518 u32 r_q_head = l_ptr->retransm_queue_head;
1519
1520 /* Step to position where retransmission failed, if any, */
1521 /* consider that buffers may have been released in meantime */
1522
1523 if (r_q_size && buf) {
1524 u32 last = lesser(mod(r_q_head + r_q_size),
1525 link_last_sent(l_ptr));
1526 u32 first = msg_seqno(buf_msg(buf));
1527
1528 while (buf && less(first, r_q_head)) {
1529 first = mod(first + 1);
1530 buf = buf->next;
1531 }
1532 l_ptr->retransm_queue_head = r_q_head = first;
1533 l_ptr->retransm_queue_size = r_q_size = mod(last - first);
1534 }
1535
1536 /* Continue retransmission now, if there is anything: */
1537
1538 if (r_q_size && buf && !skb_cloned(buf)) {
1539 msg_set_ack(buf_msg(buf), mod(l_ptr->next_in_no - 1));
1540 msg_set_bcast_ack(buf_msg(buf), l_ptr->owner->bclink.last_in);
1541 if (tipc_bearer_send(l_ptr->b_ptr, buf, &l_ptr->media_addr)) {
1542 msg_dbg(buf_msg(buf), ">DEF-RETR>");
1543 l_ptr->retransm_queue_head = mod(++r_q_head);
1544 l_ptr->retransm_queue_size = --r_q_size;
1545 l_ptr->stats.retransmitted++;
1546 return TIPC_OK;
1547 } else {
1548 l_ptr->stats.bearer_congs++;
1549 msg_dbg(buf_msg(buf), "|>DEF-RETR>");
1550 return PUSH_FAILED;
1551 }
1552 }
1553
1554 /* Send deferred protocol message, if any: */
1555
1556 buf = l_ptr->proto_msg_queue;
1557 if (buf) {
1558 msg_set_ack(buf_msg(buf), mod(l_ptr->next_in_no - 1));
1559 msg_set_bcast_ack(buf_msg(buf),l_ptr->owner->bclink.last_in);
1560 if (tipc_bearer_send(l_ptr->b_ptr, buf, &l_ptr->media_addr)) {
1561 msg_dbg(buf_msg(buf), ">DEF-PROT>");
1562 l_ptr->unacked_window = 0;
1563 buf_discard(buf);
1564 l_ptr->proto_msg_queue = NULL;
1565 return TIPC_OK;
1566 } else {
1567 msg_dbg(buf_msg(buf), "|>DEF-PROT>");
1568 l_ptr->stats.bearer_congs++;
1569 return PUSH_FAILED;
1570 }
1571 }
1572
1573 /* Send one deferred data message, if send window not full: */
1574
1575 buf = l_ptr->next_out;
1576 if (buf) {
1577 struct tipc_msg *msg = buf_msg(buf);
1578 u32 next = msg_seqno(msg);
1579 u32 first = msg_seqno(buf_msg(l_ptr->first_out));
1580
1581 if (mod(next - first) < l_ptr->queue_limit[0]) {
1582 msg_set_ack(msg, mod(l_ptr->next_in_no - 1));
1583 msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in);
1584 if (tipc_bearer_send(l_ptr->b_ptr, buf, &l_ptr->media_addr)) {
1585 if (msg_user(msg) == MSG_BUNDLER)
1586 msg_set_type(msg, CLOSED_MSG);
1587 msg_dbg(msg, ">PUSH-DATA>");
1588 l_ptr->next_out = buf->next;
1589 return TIPC_OK;
1590 } else {
1591 msg_dbg(msg, "|PUSH-DATA|");
1592 l_ptr->stats.bearer_congs++;
1593 return PUSH_FAILED;
1594 }
1595 }
1596 }
1597 return PUSH_FINISHED;
1598 }
1599
1600 /*
1601 * push_queue(): push out the unsent messages of a link where
1602 * congestion has abated. Node is locked
1603 */
1604 void tipc_link_push_queue(struct link *l_ptr)
1605 {
1606 u32 res;
1607
1608 if (tipc_bearer_congested(l_ptr->b_ptr, l_ptr))
1609 return;
1610
1611 do {
1612 res = tipc_link_push_packet(l_ptr);
1613 }
1614 while (res == TIPC_OK);
1615 if (res == PUSH_FAILED)
1616 tipc_bearer_schedule(l_ptr->b_ptr, l_ptr);
1617 }
1618
1619 static void link_reset_all(unsigned long addr)
1620 {
1621 struct node *n_ptr;
1622 char addr_string[16];
1623 u32 i;
1624
1625 read_lock_bh(&tipc_net_lock);
1626 n_ptr = tipc_node_find((u32)addr);
1627 if (!n_ptr) {
1628 read_unlock_bh(&tipc_net_lock);
1629 return; /* node no longer exists */
1630 }
1631
1632 tipc_node_lock(n_ptr);
1633
1634 warn("Resetting all links to %s\n",
1635 addr_string_fill(addr_string, n_ptr->addr));
1636
1637 for (i = 0; i < MAX_BEARERS; i++) {
1638 if (n_ptr->links[i]) {
1639 link_print(n_ptr->links[i], TIPC_OUTPUT,
1640 "Resetting link\n");
1641 tipc_link_reset(n_ptr->links[i]);
1642 }
1643 }
1644
1645 tipc_node_unlock(n_ptr);
1646 read_unlock_bh(&tipc_net_lock);
1647 }
1648
1649 static void link_retransmit_failure(struct link *l_ptr, struct sk_buff *buf)
1650 {
1651 struct tipc_msg *msg = buf_msg(buf);
1652
1653 warn("Retransmission failure on link <%s>\n", l_ptr->name);
1654 tipc_msg_print(TIPC_OUTPUT, msg, ">RETR-FAIL>");
1655
1656 if (l_ptr->addr) {
1657
1658 /* Handle failure on standard link */
1659
1660 link_print(l_ptr, TIPC_OUTPUT, "Resetting link\n");
1661 tipc_link_reset(l_ptr);
1662
1663 } else {
1664
1665 /* Handle failure on broadcast link */
1666
1667 struct node *n_ptr;
1668 char addr_string[16];
1669
1670 tipc_printf(TIPC_OUTPUT, "Msg seq number: %u, ", msg_seqno(msg));
1671 tipc_printf(TIPC_OUTPUT, "Outstanding acks: %lu\n",
1672 (unsigned long) TIPC_SKB_CB(buf)->handle);
1673
1674 n_ptr = l_ptr->owner->next;
1675 tipc_node_lock(n_ptr);
1676
1677 addr_string_fill(addr_string, n_ptr->addr);
1678 tipc_printf(TIPC_OUTPUT, "Multicast link info for %s\n", addr_string);
1679 tipc_printf(TIPC_OUTPUT, "Supported: %d, ", n_ptr->bclink.supported);
1680 tipc_printf(TIPC_OUTPUT, "Acked: %u\n", n_ptr->bclink.acked);
1681 tipc_printf(TIPC_OUTPUT, "Last in: %u, ", n_ptr->bclink.last_in);
1682 tipc_printf(TIPC_OUTPUT, "Gap after: %u, ", n_ptr->bclink.gap_after);
1683 tipc_printf(TIPC_OUTPUT, "Gap to: %u\n", n_ptr->bclink.gap_to);
1684 tipc_printf(TIPC_OUTPUT, "Nack sync: %u\n\n", n_ptr->bclink.nack_sync);
1685
1686 tipc_k_signal((Handler)link_reset_all, (unsigned long)n_ptr->addr);
1687
1688 tipc_node_unlock(n_ptr);
1689
1690 l_ptr->stale_count = 0;
1691 }
1692 }
1693
1694 void tipc_link_retransmit(struct link *l_ptr, struct sk_buff *buf,
1695 u32 retransmits)
1696 {
1697 struct tipc_msg *msg;
1698
1699 if (!buf)
1700 return;
1701
1702 msg = buf_msg(buf);
1703
1704 dbg("Retransmitting %u in link %x\n", retransmits, l_ptr);
1705
1706 if (tipc_bearer_congested(l_ptr->b_ptr, l_ptr)) {
1707 if (!skb_cloned(buf)) {
1708 msg_dbg(msg, ">NO_RETR->BCONG>");
1709 dbg_print_link(l_ptr, " ");
1710 l_ptr->retransm_queue_head = msg_seqno(msg);
1711 l_ptr->retransm_queue_size = retransmits;
1712 return;
1713 } else {
1714 /* Don't retransmit if driver already has the buffer */
1715 }
1716 } else {
1717 /* Detect repeated retransmit failures on uncongested bearer */
1718
1719 if (l_ptr->last_retransmitted == msg_seqno(msg)) {
1720 if (++l_ptr->stale_count > 100) {
1721 link_retransmit_failure(l_ptr, buf);
1722 return;
1723 }
1724 } else {
1725 l_ptr->last_retransmitted = msg_seqno(msg);
1726 l_ptr->stale_count = 1;
1727 }
1728 }
1729
1730 while (retransmits && (buf != l_ptr->next_out) && buf && !skb_cloned(buf)) {
1731 msg = buf_msg(buf);
1732 msg_set_ack(msg, mod(l_ptr->next_in_no - 1));
1733 msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in);
1734 if (tipc_bearer_send(l_ptr->b_ptr, buf, &l_ptr->media_addr)) {
1735 msg_dbg(buf_msg(buf), ">RETR>");
1736 buf = buf->next;
1737 retransmits--;
1738 l_ptr->stats.retransmitted++;
1739 } else {
1740 tipc_bearer_schedule(l_ptr->b_ptr, l_ptr);
1741 l_ptr->stats.bearer_congs++;
1742 l_ptr->retransm_queue_head = msg_seqno(buf_msg(buf));
1743 l_ptr->retransm_queue_size = retransmits;
1744 return;
1745 }
1746 }
1747
1748 l_ptr->retransm_queue_head = l_ptr->retransm_queue_size = 0;
1749 }
1750
1751 /*
1752 * link_recv_non_seq: Receive packets which are outside
1753 * the link sequence flow
1754 */
1755
1756 static void link_recv_non_seq(struct sk_buff *buf)
1757 {
1758 struct tipc_msg *msg = buf_msg(buf);
1759
1760 if (msg_user(msg) == LINK_CONFIG)
1761 tipc_disc_recv_msg(buf);
1762 else
1763 tipc_bclink_recv_pkt(buf);
1764 }
1765
1766 /**
1767 * link_insert_deferred_queue - insert deferred messages back into receive chain
1768 */
1769
1770 static struct sk_buff *link_insert_deferred_queue(struct link *l_ptr,
1771 struct sk_buff *buf)
1772 {
1773 u32 seq_no;
1774
1775 if (l_ptr->oldest_deferred_in == NULL)
1776 return buf;
1777
1778 seq_no = msg_seqno(buf_msg(l_ptr->oldest_deferred_in));
1779 if (seq_no == mod(l_ptr->next_in_no)) {
1780 l_ptr->newest_deferred_in->next = buf;
1781 buf = l_ptr->oldest_deferred_in;
1782 l_ptr->oldest_deferred_in = NULL;
1783 l_ptr->deferred_inqueue_sz = 0;
1784 }
1785 return buf;
1786 }
1787
1788 void tipc_recv_msg(struct sk_buff *head, struct tipc_bearer *tb_ptr)
1789 {
1790 read_lock_bh(&tipc_net_lock);
1791 while (head) {
1792 struct bearer *b_ptr;
1793 struct node *n_ptr;
1794 struct link *l_ptr;
1795 struct sk_buff *crs;
1796 struct sk_buff *buf = head;
1797 struct tipc_msg *msg = buf_msg(buf);
1798 u32 seq_no = msg_seqno(msg);
1799 u32 ackd = msg_ack(msg);
1800 u32 released = 0;
1801 int type;
1802
1803 b_ptr = (struct bearer *)tb_ptr;
1804 TIPC_SKB_CB(buf)->handle = b_ptr;
1805
1806 head = head->next;
1807 if (unlikely(msg_version(msg) != TIPC_VERSION))
1808 goto cont;
1809 #if 0
1810 if (msg_user(msg) != LINK_PROTOCOL)
1811 #endif
1812 msg_dbg(msg,"<REC<");
1813
1814 /* Ensure message data is a single contiguous unit */
1815
1816 if (unlikely(buf_linearize(buf))) {
1817 goto cont;
1818 }
1819
1820 if (unlikely(msg_non_seq(msg))) {
1821 link_recv_non_seq(buf);
1822 continue;
1823 }
1824
1825 if (unlikely(!msg_short(msg) &&
1826 (msg_destnode(msg) != tipc_own_addr)))
1827 goto cont;
1828
1829 n_ptr = tipc_node_find(msg_prevnode(msg));
1830 if (unlikely(!n_ptr))
1831 goto cont;
1832
1833 tipc_node_lock(n_ptr);
1834 l_ptr = n_ptr->links[b_ptr->identity];
1835 if (unlikely(!l_ptr)) {
1836 tipc_node_unlock(n_ptr);
1837 goto cont;
1838 }
1839 /*
1840 * Release acked messages
1841 */
1842 if (less(n_ptr->bclink.acked, msg_bcast_ack(msg))) {
1843 if (tipc_node_is_up(n_ptr) && n_ptr->bclink.supported)
1844 tipc_bclink_acknowledge(n_ptr, msg_bcast_ack(msg));
1845 }
1846
1847 crs = l_ptr->first_out;
1848 while ((crs != l_ptr->next_out) &&
1849 less_eq(msg_seqno(buf_msg(crs)), ackd)) {
1850 struct sk_buff *next = crs->next;
1851
1852 buf_discard(crs);
1853 crs = next;
1854 released++;
1855 }
1856 if (released) {
1857 l_ptr->first_out = crs;
1858 l_ptr->out_queue_size -= released;
1859 }
1860 if (unlikely(l_ptr->next_out))
1861 tipc_link_push_queue(l_ptr);
1862 if (unlikely(!list_empty(&l_ptr->waiting_ports)))
1863 tipc_link_wakeup_ports(l_ptr, 0);
1864 if (unlikely(++l_ptr->unacked_window >= TIPC_MIN_LINK_WIN)) {
1865 l_ptr->stats.sent_acks++;
1866 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0);
1867 }
1868
1869 protocol_check:
1870 if (likely(link_working_working(l_ptr))) {
1871 if (likely(seq_no == mod(l_ptr->next_in_no))) {
1872 l_ptr->next_in_no++;
1873 if (unlikely(l_ptr->oldest_deferred_in))
1874 head = link_insert_deferred_queue(l_ptr,
1875 head);
1876 if (likely(msg_is_dest(msg, tipc_own_addr))) {
1877 deliver:
1878 if (likely(msg_isdata(msg))) {
1879 tipc_node_unlock(n_ptr);
1880 tipc_port_recv_msg(buf);
1881 continue;
1882 }
1883 switch (msg_user(msg)) {
1884 case MSG_BUNDLER:
1885 l_ptr->stats.recv_bundles++;
1886 l_ptr->stats.recv_bundled +=
1887 msg_msgcnt(msg);
1888 tipc_node_unlock(n_ptr);
1889 tipc_link_recv_bundle(buf);
1890 continue;
1891 case ROUTE_DISTRIBUTOR:
1892 tipc_node_unlock(n_ptr);
1893 tipc_cltr_recv_routing_table(buf);
1894 continue;
1895 case NAME_DISTRIBUTOR:
1896 tipc_node_unlock(n_ptr);
1897 tipc_named_recv(buf);
1898 continue;
1899 case CONN_MANAGER:
1900 tipc_node_unlock(n_ptr);
1901 tipc_port_recv_proto_msg(buf);
1902 continue;
1903 case MSG_FRAGMENTER:
1904 l_ptr->stats.recv_fragments++;
1905 if (tipc_link_recv_fragment(&l_ptr->defragm_buf,
1906 &buf, &msg)) {
1907 l_ptr->stats.recv_fragmented++;
1908 goto deliver;
1909 }
1910 break;
1911 case CHANGEOVER_PROTOCOL:
1912 type = msg_type(msg);
1913 if (link_recv_changeover_msg(&l_ptr, &buf)) {
1914 msg = buf_msg(buf);
1915 seq_no = msg_seqno(msg);
1916 TIPC_SKB_CB(buf)->handle
1917 = b_ptr;
1918 if (type == ORIGINAL_MSG)
1919 goto deliver;
1920 goto protocol_check;
1921 }
1922 break;
1923 }
1924 }
1925 tipc_node_unlock(n_ptr);
1926 tipc_net_route_msg(buf);
1927 continue;
1928 }
1929 link_handle_out_of_seq_msg(l_ptr, buf);
1930 head = link_insert_deferred_queue(l_ptr, head);
1931 tipc_node_unlock(n_ptr);
1932 continue;
1933 }
1934
1935 if (msg_user(msg) == LINK_PROTOCOL) {
1936 link_recv_proto_msg(l_ptr, buf);
1937 head = link_insert_deferred_queue(l_ptr, head);
1938 tipc_node_unlock(n_ptr);
1939 continue;
1940 }
1941 msg_dbg(msg,"NSEQ<REC<");
1942 link_state_event(l_ptr, TRAFFIC_MSG_EVT);
1943
1944 if (link_working_working(l_ptr)) {
1945 /* Re-insert in front of queue */
1946 msg_dbg(msg,"RECV-REINS:");
1947 buf->next = head;
1948 head = buf;
1949 tipc_node_unlock(n_ptr);
1950 continue;
1951 }
1952 tipc_node_unlock(n_ptr);
1953 cont:
1954 buf_discard(buf);
1955 }
1956 read_unlock_bh(&tipc_net_lock);
1957 }
1958
1959 /*
1960 * link_defer_buf(): Sort a received out-of-sequence packet
1961 * into the deferred reception queue.
1962 * Returns the increase of the queue length,i.e. 0 or 1
1963 */
1964
1965 u32 tipc_link_defer_pkt(struct sk_buff **head,
1966 struct sk_buff **tail,
1967 struct sk_buff *buf)
1968 {
1969 struct sk_buff *prev = NULL;
1970 struct sk_buff *crs = *head;
1971 u32 seq_no = msg_seqno(buf_msg(buf));
1972
1973 buf->next = NULL;
1974
1975 /* Empty queue ? */
1976 if (*head == NULL) {
1977 *head = *tail = buf;
1978 return 1;
1979 }
1980
1981 /* Last ? */
1982 if (less(msg_seqno(buf_msg(*tail)), seq_no)) {
1983 (*tail)->next = buf;
1984 *tail = buf;
1985 return 1;
1986 }
1987
1988 /* Scan through queue and sort it in */
1989 do {
1990 struct tipc_msg *msg = buf_msg(crs);
1991
1992 if (less(seq_no, msg_seqno(msg))) {
1993 buf->next = crs;
1994 if (prev)
1995 prev->next = buf;
1996 else
1997 *head = buf;
1998 return 1;
1999 }
2000 if (seq_no == msg_seqno(msg)) {
2001 break;
2002 }
2003 prev = crs;
2004 crs = crs->next;
2005 }
2006 while (crs);
2007
2008 /* Message is a duplicate of an existing message */
2009
2010 buf_discard(buf);
2011 return 0;
2012 }
2013
2014 /**
2015 * link_handle_out_of_seq_msg - handle arrival of out-of-sequence packet
2016 */
2017
2018 static void link_handle_out_of_seq_msg(struct link *l_ptr,
2019 struct sk_buff *buf)
2020 {
2021 u32 seq_no = msg_seqno(buf_msg(buf));
2022
2023 if (likely(msg_user(buf_msg(buf)) == LINK_PROTOCOL)) {
2024 link_recv_proto_msg(l_ptr, buf);
2025 return;
2026 }
2027
2028 dbg("rx OOS msg: seq_no %u, expecting %u (%u)\n",
2029 seq_no, mod(l_ptr->next_in_no), l_ptr->next_in_no);
2030
2031 /* Record OOS packet arrival (force mismatch on next timeout) */
2032
2033 l_ptr->checkpoint--;
2034
2035 /*
2036 * Discard packet if a duplicate; otherwise add it to deferred queue
2037 * and notify peer of gap as per protocol specification
2038 */
2039
2040 if (less(seq_no, mod(l_ptr->next_in_no))) {
2041 l_ptr->stats.duplicates++;
2042 buf_discard(buf);
2043 return;
2044 }
2045
2046 if (tipc_link_defer_pkt(&l_ptr->oldest_deferred_in,
2047 &l_ptr->newest_deferred_in, buf)) {
2048 l_ptr->deferred_inqueue_sz++;
2049 l_ptr->stats.deferred_recv++;
2050 if ((l_ptr->deferred_inqueue_sz % 16) == 1)
2051 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0);
2052 } else
2053 l_ptr->stats.duplicates++;
2054 }
2055
2056 /*
2057 * Send protocol message to the other endpoint.
2058 */
2059 void tipc_link_send_proto_msg(struct link *l_ptr, u32 msg_typ, int probe_msg,
2060 u32 gap, u32 tolerance, u32 priority, u32 ack_mtu)
2061 {
2062 struct sk_buff *buf = NULL;
2063 struct tipc_msg *msg = l_ptr->pmsg;
2064 u32 msg_size = sizeof(l_ptr->proto_msg);
2065
2066 if (link_blocked(l_ptr))
2067 return;
2068 msg_set_type(msg, msg_typ);
2069 msg_set_net_plane(msg, l_ptr->b_ptr->net_plane);
2070 msg_set_bcast_ack(msg, mod(l_ptr->owner->bclink.last_in));
2071 msg_set_last_bcast(msg, tipc_bclink_get_last_sent());
2072
2073 if (msg_typ == STATE_MSG) {
2074 u32 next_sent = mod(l_ptr->next_out_no);
2075
2076 if (!tipc_link_is_up(l_ptr))
2077 return;
2078 if (l_ptr->next_out)
2079 next_sent = msg_seqno(buf_msg(l_ptr->next_out));
2080 msg_set_next_sent(msg, next_sent);
2081 if (l_ptr->oldest_deferred_in) {
2082 u32 rec = msg_seqno(buf_msg(l_ptr->oldest_deferred_in));
2083 gap = mod(rec - mod(l_ptr->next_in_no));
2084 }
2085 msg_set_seq_gap(msg, gap);
2086 if (gap)
2087 l_ptr->stats.sent_nacks++;
2088 msg_set_link_tolerance(msg, tolerance);
2089 msg_set_linkprio(msg, priority);
2090 msg_set_max_pkt(msg, ack_mtu);
2091 msg_set_ack(msg, mod(l_ptr->next_in_no - 1));
2092 msg_set_probe(msg, probe_msg != 0);
2093 if (probe_msg) {
2094 u32 mtu = l_ptr->max_pkt;
2095
2096 if ((mtu < l_ptr->max_pkt_target) &&
2097 link_working_working(l_ptr) &&
2098 l_ptr->fsm_msg_cnt) {
2099 msg_size = (mtu + (l_ptr->max_pkt_target - mtu)/2 + 2) & ~3;
2100 if (l_ptr->max_pkt_probes == 10) {
2101 l_ptr->max_pkt_target = (msg_size - 4);
2102 l_ptr->max_pkt_probes = 0;
2103 msg_size = (mtu + (l_ptr->max_pkt_target - mtu)/2 + 2) & ~3;
2104 }
2105 l_ptr->max_pkt_probes++;
2106 }
2107
2108 l_ptr->stats.sent_probes++;
2109 }
2110 l_ptr->stats.sent_states++;
2111 } else { /* RESET_MSG or ACTIVATE_MSG */
2112 msg_set_ack(msg, mod(l_ptr->reset_checkpoint - 1));
2113 msg_set_seq_gap(msg, 0);
2114 msg_set_next_sent(msg, 1);
2115 msg_set_link_tolerance(msg, l_ptr->tolerance);
2116 msg_set_linkprio(msg, l_ptr->priority);
2117 msg_set_max_pkt(msg, l_ptr->max_pkt_target);
2118 }
2119
2120 if (tipc_node_has_redundant_links(l_ptr->owner)) {
2121 msg_set_redundant_link(msg);
2122 } else {
2123 msg_clear_redundant_link(msg);
2124 }
2125 msg_set_linkprio(msg, l_ptr->priority);
2126
2127 /* Ensure sequence number will not fit : */
2128
2129 msg_set_seqno(msg, mod(l_ptr->next_out_no + (0xffff/2)));
2130
2131 /* Congestion? */
2132
2133 if (tipc_bearer_congested(l_ptr->b_ptr, l_ptr)) {
2134 if (!l_ptr->proto_msg_queue) {
2135 l_ptr->proto_msg_queue =
2136 buf_acquire(sizeof(l_ptr->proto_msg));
2137 }
2138 buf = l_ptr->proto_msg_queue;
2139 if (!buf)
2140 return;
2141 skb_copy_to_linear_data(buf, msg, sizeof(l_ptr->proto_msg));
2142 return;
2143 }
2144 msg_set_timestamp(msg, jiffies_to_msecs(jiffies));
2145
2146 /* Message can be sent */
2147
2148 msg_dbg(msg, ">>");
2149
2150 buf = buf_acquire(msg_size);
2151 if (!buf)
2152 return;
2153
2154 skb_copy_to_linear_data(buf, msg, sizeof(l_ptr->proto_msg));
2155 msg_set_size(buf_msg(buf), msg_size);
2156
2157 if (tipc_bearer_send(l_ptr->b_ptr, buf, &l_ptr->media_addr)) {
2158 l_ptr->unacked_window = 0;
2159 buf_discard(buf);
2160 return;
2161 }
2162
2163 /* New congestion */
2164 tipc_bearer_schedule(l_ptr->b_ptr, l_ptr);
2165 l_ptr->proto_msg_queue = buf;
2166 l_ptr->stats.bearer_congs++;
2167 }
2168
2169 /*
2170 * Receive protocol message :
2171 * Note that network plane id propagates through the network, and may
2172 * change at any time. The node with lowest address rules
2173 */
2174
2175 static void link_recv_proto_msg(struct link *l_ptr, struct sk_buff *buf)
2176 {
2177 u32 rec_gap = 0;
2178 u32 max_pkt_info;
2179 u32 max_pkt_ack;
2180 u32 msg_tol;
2181 struct tipc_msg *msg = buf_msg(buf);
2182
2183 dbg("AT(%u):", jiffies_to_msecs(jiffies));
2184 msg_dbg(msg, "<<");
2185 if (link_blocked(l_ptr))
2186 goto exit;
2187
2188 /* record unnumbered packet arrival (force mismatch on next timeout) */
2189
2190 l_ptr->checkpoint--;
2191
2192 if (l_ptr->b_ptr->net_plane != msg_net_plane(msg))
2193 if (tipc_own_addr > msg_prevnode(msg))
2194 l_ptr->b_ptr->net_plane = msg_net_plane(msg);
2195
2196 l_ptr->owner->permit_changeover = msg_redundant_link(msg);
2197
2198 switch (msg_type(msg)) {
2199
2200 case RESET_MSG:
2201 if (!link_working_unknown(l_ptr) && l_ptr->peer_session) {
2202 if (msg_session(msg) == l_ptr->peer_session) {
2203 dbg("Duplicate RESET: %u<->%u\n",
2204 msg_session(msg), l_ptr->peer_session);
2205 break; /* duplicate: ignore */
2206 }
2207 }
2208 /* fall thru' */
2209 case ACTIVATE_MSG:
2210 /* Update link settings according other endpoint's values */
2211
2212 strcpy((strrchr(l_ptr->name, ':') + 1), (char *)msg_data(msg));
2213
2214 if ((msg_tol = msg_link_tolerance(msg)) &&
2215 (msg_tol > l_ptr->tolerance))
2216 link_set_supervision_props(l_ptr, msg_tol);
2217
2218 if (msg_linkprio(msg) > l_ptr->priority)
2219 l_ptr->priority = msg_linkprio(msg);
2220
2221 max_pkt_info = msg_max_pkt(msg);
2222 if (max_pkt_info) {
2223 if (max_pkt_info < l_ptr->max_pkt_target)
2224 l_ptr->max_pkt_target = max_pkt_info;
2225 if (l_ptr->max_pkt > l_ptr->max_pkt_target)
2226 l_ptr->max_pkt = l_ptr->max_pkt_target;
2227 } else {
2228 l_ptr->max_pkt = l_ptr->max_pkt_target;
2229 }
2230 l_ptr->owner->bclink.supported = (max_pkt_info != 0);
2231
2232 link_state_event(l_ptr, msg_type(msg));
2233
2234 l_ptr->peer_session = msg_session(msg);
2235 l_ptr->peer_bearer_id = msg_bearer_id(msg);
2236
2237 /* Synchronize broadcast sequence numbers */
2238 if (!tipc_node_has_redundant_links(l_ptr->owner)) {
2239 l_ptr->owner->bclink.last_in = mod(msg_last_bcast(msg));
2240 }
2241 break;
2242 case STATE_MSG:
2243
2244 if ((msg_tol = msg_link_tolerance(msg)))
2245 link_set_supervision_props(l_ptr, msg_tol);
2246
2247 if (msg_linkprio(msg) &&
2248 (msg_linkprio(msg) != l_ptr->priority)) {
2249 warn("Resetting link <%s>, priority change %u->%u\n",
2250 l_ptr->name, l_ptr->priority, msg_linkprio(msg));
2251 l_ptr->priority = msg_linkprio(msg);
2252 tipc_link_reset(l_ptr); /* Enforce change to take effect */
2253 break;
2254 }
2255 link_state_event(l_ptr, TRAFFIC_MSG_EVT);
2256 l_ptr->stats.recv_states++;
2257 if (link_reset_unknown(l_ptr))
2258 break;
2259
2260 if (less_eq(mod(l_ptr->next_in_no), msg_next_sent(msg))) {
2261 rec_gap = mod(msg_next_sent(msg) -
2262 mod(l_ptr->next_in_no));
2263 }
2264
2265 max_pkt_ack = msg_max_pkt(msg);
2266 if (max_pkt_ack > l_ptr->max_pkt) {
2267 dbg("Link <%s> updated MTU %u -> %u\n",
2268 l_ptr->name, l_ptr->max_pkt, max_pkt_ack);
2269 l_ptr->max_pkt = max_pkt_ack;
2270 l_ptr->max_pkt_probes = 0;
2271 }
2272
2273 max_pkt_ack = 0;
2274 if (msg_probe(msg)) {
2275 l_ptr->stats.recv_probes++;
2276 if (msg_size(msg) > sizeof(l_ptr->proto_msg)) {
2277 max_pkt_ack = msg_size(msg);
2278 }
2279 }
2280
2281 /* Protocol message before retransmits, reduce loss risk */
2282
2283 tipc_bclink_check_gap(l_ptr->owner, msg_last_bcast(msg));
2284
2285 if (rec_gap || (msg_probe(msg))) {
2286 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
2287 0, rec_gap, 0, 0, max_pkt_ack);
2288 }
2289 if (msg_seq_gap(msg)) {
2290 msg_dbg(msg, "With Gap:");
2291 l_ptr->stats.recv_nacks++;
2292 tipc_link_retransmit(l_ptr, l_ptr->first_out,
2293 msg_seq_gap(msg));
2294 }
2295 break;
2296 default:
2297 msg_dbg(buf_msg(buf), "<DISCARDING UNKNOWN<");
2298 }
2299 exit:
2300 buf_discard(buf);
2301 }
2302
2303
2304 /*
2305 * tipc_link_tunnel(): Send one message via a link belonging to
2306 * another bearer. Owner node is locked.
2307 */
2308 void tipc_link_tunnel(struct link *l_ptr,
2309 struct tipc_msg *tunnel_hdr,
2310 struct tipc_msg *msg,
2311 u32 selector)
2312 {
2313 struct link *tunnel;
2314 struct sk_buff *buf;
2315 u32 length = msg_size(msg);
2316
2317 tunnel = l_ptr->owner->active_links[selector & 1];
2318 if (!tipc_link_is_up(tunnel)) {
2319 warn("Link changeover error, "
2320 "tunnel link no longer available\n");
2321 return;
2322 }
2323 msg_set_size(tunnel_hdr, length + INT_H_SIZE);
2324 buf = buf_acquire(length + INT_H_SIZE);
2325 if (!buf) {
2326 warn("Link changeover error, "
2327 "unable to send tunnel msg\n");
2328 return;
2329 }
2330 skb_copy_to_linear_data(buf, tunnel_hdr, INT_H_SIZE);
2331 skb_copy_to_linear_data_offset(buf, INT_H_SIZE, msg, length);
2332 dbg("%c->%c:", l_ptr->b_ptr->net_plane, tunnel->b_ptr->net_plane);
2333 msg_dbg(buf_msg(buf), ">SEND>");
2334 tipc_link_send_buf(tunnel, buf);
2335 }
2336
2337
2338
2339 /*
2340 * changeover(): Send whole message queue via the remaining link
2341 * Owner node is locked.
2342 */
2343
2344 void tipc_link_changeover(struct link *l_ptr)
2345 {
2346 u32 msgcount = l_ptr->out_queue_size;
2347 struct sk_buff *crs = l_ptr->first_out;
2348 struct link *tunnel = l_ptr->owner->active_links[0];
2349 struct tipc_msg tunnel_hdr;
2350 int split_bundles;
2351
2352 if (!tunnel)
2353 return;
2354
2355 if (!l_ptr->owner->permit_changeover) {
2356 warn("Link changeover error, "
2357 "peer did not permit changeover\n");
2358 return;
2359 }
2360
2361 msg_init(&tunnel_hdr, CHANGEOVER_PROTOCOL,
2362 ORIGINAL_MSG, TIPC_OK, INT_H_SIZE, l_ptr->addr);
2363 msg_set_bearer_id(&tunnel_hdr, l_ptr->peer_bearer_id);
2364 msg_set_msgcnt(&tunnel_hdr, msgcount);
2365 dbg("Link changeover requires %u tunnel messages\n", msgcount);
2366
2367 if (!l_ptr->first_out) {
2368 struct sk_buff *buf;
2369
2370 buf = buf_acquire(INT_H_SIZE);
2371 if (buf) {
2372 skb_copy_to_linear_data(buf, &tunnel_hdr, INT_H_SIZE);
2373 msg_set_size(&tunnel_hdr, INT_H_SIZE);
2374 dbg("%c->%c:", l_ptr->b_ptr->net_plane,
2375 tunnel->b_ptr->net_plane);
2376 msg_dbg(&tunnel_hdr, "EMPTY>SEND>");
2377 tipc_link_send_buf(tunnel, buf);
2378 } else {
2379 warn("Link changeover error, "
2380 "unable to send changeover msg\n");
2381 }
2382 return;
2383 }
2384
2385 split_bundles = (l_ptr->owner->active_links[0] !=
2386 l_ptr->owner->active_links[1]);
2387
2388 while (crs) {
2389 struct tipc_msg *msg = buf_msg(crs);
2390
2391 if ((msg_user(msg) == MSG_BUNDLER) && split_bundles) {
2392 struct tipc_msg *m = msg_get_wrapped(msg);
2393 unchar* pos = (unchar*)m;
2394
2395 msgcount = msg_msgcnt(msg);
2396 while (msgcount--) {
2397 msg_set_seqno(m,msg_seqno(msg));
2398 tipc_link_tunnel(l_ptr, &tunnel_hdr, m,
2399 msg_link_selector(m));
2400 pos += align(msg_size(m));
2401 m = (struct tipc_msg *)pos;
2402 }
2403 } else {
2404 tipc_link_tunnel(l_ptr, &tunnel_hdr, msg,
2405 msg_link_selector(msg));
2406 }
2407 crs = crs->next;
2408 }
2409 }
2410
2411 void tipc_link_send_duplicate(struct link *l_ptr, struct link *tunnel)
2412 {
2413 struct sk_buff *iter;
2414 struct tipc_msg tunnel_hdr;
2415
2416 msg_init(&tunnel_hdr, CHANGEOVER_PROTOCOL,
2417 DUPLICATE_MSG, TIPC_OK, INT_H_SIZE, l_ptr->addr);
2418 msg_set_msgcnt(&tunnel_hdr, l_ptr->out_queue_size);
2419 msg_set_bearer_id(&tunnel_hdr, l_ptr->peer_bearer_id);
2420 iter = l_ptr->first_out;
2421 while (iter) {
2422 struct sk_buff *outbuf;
2423 struct tipc_msg *msg = buf_msg(iter);
2424 u32 length = msg_size(msg);
2425
2426 if (msg_user(msg) == MSG_BUNDLER)
2427 msg_set_type(msg, CLOSED_MSG);
2428 msg_set_ack(msg, mod(l_ptr->next_in_no - 1)); /* Update */
2429 msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in);
2430 msg_set_size(&tunnel_hdr, length + INT_H_SIZE);
2431 outbuf = buf_acquire(length + INT_H_SIZE);
2432 if (outbuf == NULL) {
2433 warn("Link changeover error, "
2434 "unable to send duplicate msg\n");
2435 return;
2436 }
2437 skb_copy_to_linear_data(outbuf, &tunnel_hdr, INT_H_SIZE);
2438 skb_copy_to_linear_data_offset(outbuf, INT_H_SIZE, iter->data,
2439 length);
2440 dbg("%c->%c:", l_ptr->b_ptr->net_plane,
2441 tunnel->b_ptr->net_plane);
2442 msg_dbg(buf_msg(outbuf), ">SEND>");
2443 tipc_link_send_buf(tunnel, outbuf);
2444 if (!tipc_link_is_up(l_ptr))
2445 return;
2446 iter = iter->next;
2447 }
2448 }
2449
2450
2451
2452 /**
2453 * buf_extract - extracts embedded TIPC message from another message
2454 * @skb: encapsulating message buffer
2455 * @from_pos: offset to extract from
2456 *
2457 * Returns a new message buffer containing an embedded message. The
2458 * encapsulating message itself is left unchanged.
2459 */
2460
2461 static struct sk_buff *buf_extract(struct sk_buff *skb, u32 from_pos)
2462 {
2463 struct tipc_msg *msg = (struct tipc_msg *)(skb->data + from_pos);
2464 u32 size = msg_size(msg);
2465 struct sk_buff *eb;
2466
2467 eb = buf_acquire(size);
2468 if (eb)
2469 skb_copy_to_linear_data(eb, msg, size);
2470 return eb;
2471 }
2472
2473 /*
2474 * link_recv_changeover_msg(): Receive tunneled packet sent
2475 * via other link. Node is locked. Return extracted buffer.
2476 */
2477
2478 static int link_recv_changeover_msg(struct link **l_ptr,
2479 struct sk_buff **buf)
2480 {
2481 struct sk_buff *tunnel_buf = *buf;
2482 struct link *dest_link;
2483 struct tipc_msg *msg;
2484 struct tipc_msg *tunnel_msg = buf_msg(tunnel_buf);
2485 u32 msg_typ = msg_type(tunnel_msg);
2486 u32 msg_count = msg_msgcnt(tunnel_msg);
2487
2488 dest_link = (*l_ptr)->owner->links[msg_bearer_id(tunnel_msg)];
2489 if (!dest_link) {
2490 msg_dbg(tunnel_msg, "NOLINK/<REC<");
2491 goto exit;
2492 }
2493 if (dest_link == *l_ptr) {
2494 err("Unexpected changeover message on link <%s>\n",
2495 (*l_ptr)->name);
2496 goto exit;
2497 }
2498 dbg("%c<-%c:", dest_link->b_ptr->net_plane,
2499 (*l_ptr)->b_ptr->net_plane);
2500 *l_ptr = dest_link;
2501 msg = msg_get_wrapped(tunnel_msg);
2502
2503 if (msg_typ == DUPLICATE_MSG) {
2504 if (less(msg_seqno(msg), mod(dest_link->next_in_no))) {
2505 msg_dbg(tunnel_msg, "DROP/<REC<");
2506 goto exit;
2507 }
2508 *buf = buf_extract(tunnel_buf,INT_H_SIZE);
2509 if (*buf == NULL) {
2510 warn("Link changeover error, duplicate msg dropped\n");
2511 goto exit;
2512 }
2513 msg_dbg(tunnel_msg, "TNL<REC<");
2514 buf_discard(tunnel_buf);
2515 return 1;
2516 }
2517
2518 /* First original message ?: */
2519
2520 if (tipc_link_is_up(dest_link)) {
2521 msg_dbg(tunnel_msg, "UP/FIRST/<REC<");
2522 info("Resetting link <%s>, changeover initiated by peer\n",
2523 dest_link->name);
2524 tipc_link_reset(dest_link);
2525 dest_link->exp_msg_count = msg_count;
2526 dbg("Expecting %u tunnelled messages\n", msg_count);
2527 if (!msg_count)
2528 goto exit;
2529 } else if (dest_link->exp_msg_count == START_CHANGEOVER) {
2530 msg_dbg(tunnel_msg, "BLK/FIRST/<REC<");
2531 dest_link->exp_msg_count = msg_count;
2532 dbg("Expecting %u tunnelled messages\n", msg_count);
2533 if (!msg_count)
2534 goto exit;
2535 }
2536
2537 /* Receive original message */
2538
2539 if (dest_link->exp_msg_count == 0) {
2540 warn("Link switchover error, "
2541 "got too many tunnelled messages\n");
2542 msg_dbg(tunnel_msg, "OVERDUE/DROP/<REC<");
2543 dbg_print_link(dest_link, "LINK:");
2544 goto exit;
2545 }
2546 dest_link->exp_msg_count--;
2547 if (less(msg_seqno(msg), dest_link->reset_checkpoint)) {
2548 msg_dbg(tunnel_msg, "DROP/DUPL/<REC<");
2549 goto exit;
2550 } else {
2551 *buf = buf_extract(tunnel_buf, INT_H_SIZE);
2552 if (*buf != NULL) {
2553 msg_dbg(tunnel_msg, "TNL<REC<");
2554 buf_discard(tunnel_buf);
2555 return 1;
2556 } else {
2557 warn("Link changeover error, original msg dropped\n");
2558 }
2559 }
2560 exit:
2561 *buf = NULL;
2562 buf_discard(tunnel_buf);
2563 return 0;
2564 }
2565
2566 /*
2567 * Bundler functionality:
2568 */
2569 void tipc_link_recv_bundle(struct sk_buff *buf)
2570 {
2571 u32 msgcount = msg_msgcnt(buf_msg(buf));
2572 u32 pos = INT_H_SIZE;
2573 struct sk_buff *obuf;
2574
2575 msg_dbg(buf_msg(buf), "<BNDL<: ");
2576 while (msgcount--) {
2577 obuf = buf_extract(buf, pos);
2578 if (obuf == NULL) {
2579 warn("Link unable to unbundle message(s)\n");
2580 break;
2581 }
2582 pos += align(msg_size(buf_msg(obuf)));
2583 msg_dbg(buf_msg(obuf), " /");
2584 tipc_net_route_msg(obuf);
2585 }
2586 buf_discard(buf);
2587 }
2588
2589 /*
2590 * Fragmentation/defragmentation:
2591 */
2592
2593
2594 /*
2595 * tipc_link_send_long_buf: Entry for buffers needing fragmentation.
2596 * The buffer is complete, inclusive total message length.
2597 * Returns user data length.
2598 */
2599 int tipc_link_send_long_buf(struct link *l_ptr, struct sk_buff *buf)
2600 {
2601 struct tipc_msg *inmsg = buf_msg(buf);
2602 struct tipc_msg fragm_hdr;
2603 u32 insize = msg_size(inmsg);
2604 u32 dsz = msg_data_sz(inmsg);
2605 unchar *crs = buf->data;
2606 u32 rest = insize;
2607 u32 pack_sz = link_max_pkt(l_ptr);
2608 u32 fragm_sz = pack_sz - INT_H_SIZE;
2609 u32 fragm_no = 1;
2610 u32 destaddr = msg_destnode(inmsg);
2611
2612 if (msg_short(inmsg))
2613 destaddr = l_ptr->addr;
2614
2615 if (msg_routed(inmsg))
2616 msg_set_prevnode(inmsg, tipc_own_addr);
2617
2618 /* Prepare reusable fragment header: */
2619
2620 msg_init(&fragm_hdr, MSG_FRAGMENTER, FIRST_FRAGMENT,
2621 TIPC_OK, INT_H_SIZE, destaddr);
2622 msg_set_link_selector(&fragm_hdr, msg_link_selector(inmsg));
2623 msg_set_long_msgno(&fragm_hdr, mod(l_ptr->long_msg_seq_no++));
2624 msg_set_fragm_no(&fragm_hdr, fragm_no);
2625 l_ptr->stats.sent_fragmented++;
2626
2627 /* Chop up message: */
2628
2629 while (rest > 0) {
2630 struct sk_buff *fragm;
2631
2632 if (rest <= fragm_sz) {
2633 fragm_sz = rest;
2634 msg_set_type(&fragm_hdr, LAST_FRAGMENT);
2635 }
2636 fragm = buf_acquire(fragm_sz + INT_H_SIZE);
2637 if (fragm == NULL) {
2638 warn("Link unable to fragment message\n");
2639 dsz = -ENOMEM;
2640 goto exit;
2641 }
2642 msg_set_size(&fragm_hdr, fragm_sz + INT_H_SIZE);
2643 skb_copy_to_linear_data(fragm, &fragm_hdr, INT_H_SIZE);
2644 skb_copy_to_linear_data_offset(fragm, INT_H_SIZE, crs,
2645 fragm_sz);
2646 /* Send queued messages first, if any: */
2647
2648 l_ptr->stats.sent_fragments++;
2649 tipc_link_send_buf(l_ptr, fragm);
2650 if (!tipc_link_is_up(l_ptr))
2651 return dsz;
2652 msg_set_fragm_no(&fragm_hdr, ++fragm_no);
2653 rest -= fragm_sz;
2654 crs += fragm_sz;
2655 msg_set_type(&fragm_hdr, FRAGMENT);
2656 }
2657 exit:
2658 buf_discard(buf);
2659 return dsz;
2660 }
2661
2662 /*
2663 * A pending message being re-assembled must store certain values
2664 * to handle subsequent fragments correctly. The following functions
2665 * help storing these values in unused, available fields in the
2666 * pending message. This makes dynamic memory allocation unecessary.
2667 */
2668
2669 static void set_long_msg_seqno(struct sk_buff *buf, u32 seqno)
2670 {
2671 msg_set_seqno(buf_msg(buf), seqno);
2672 }
2673
2674 static u32 get_fragm_size(struct sk_buff *buf)
2675 {
2676 return msg_ack(buf_msg(buf));
2677 }
2678
2679 static void set_fragm_size(struct sk_buff *buf, u32 sz)
2680 {
2681 msg_set_ack(buf_msg(buf), sz);
2682 }
2683
2684 static u32 get_expected_frags(struct sk_buff *buf)
2685 {
2686 return msg_bcast_ack(buf_msg(buf));
2687 }
2688
2689 static void set_expected_frags(struct sk_buff *buf, u32 exp)
2690 {
2691 msg_set_bcast_ack(buf_msg(buf), exp);
2692 }
2693
2694 static u32 get_timer_cnt(struct sk_buff *buf)
2695 {
2696 return msg_reroute_cnt(buf_msg(buf));
2697 }
2698
2699 static void incr_timer_cnt(struct sk_buff *buf)
2700 {
2701 msg_incr_reroute_cnt(buf_msg(buf));
2702 }
2703
2704 /*
2705 * tipc_link_recv_fragment(): Called with node lock on. Returns
2706 * the reassembled buffer if message is complete.
2707 */
2708 int tipc_link_recv_fragment(struct sk_buff **pending, struct sk_buff **fb,
2709 struct tipc_msg **m)
2710 {
2711 struct sk_buff *prev = NULL;
2712 struct sk_buff *fbuf = *fb;
2713 struct tipc_msg *fragm = buf_msg(fbuf);
2714 struct sk_buff *pbuf = *pending;
2715 u32 long_msg_seq_no = msg_long_msgno(fragm);
2716
2717 *fb = NULL;
2718 msg_dbg(fragm,"FRG<REC<");
2719
2720 /* Is there an incomplete message waiting for this fragment? */
2721
2722 while (pbuf && ((msg_seqno(buf_msg(pbuf)) != long_msg_seq_no)
2723 || (msg_orignode(fragm) != msg_orignode(buf_msg(pbuf))))) {
2724 prev = pbuf;
2725 pbuf = pbuf->next;
2726 }
2727
2728 if (!pbuf && (msg_type(fragm) == FIRST_FRAGMENT)) {
2729 struct tipc_msg *imsg = (struct tipc_msg *)msg_data(fragm);
2730 u32 msg_sz = msg_size(imsg);
2731 u32 fragm_sz = msg_data_sz(fragm);
2732 u32 exp_fragm_cnt = msg_sz/fragm_sz + !!(msg_sz % fragm_sz);
2733 u32 max = TIPC_MAX_USER_MSG_SIZE + LONG_H_SIZE;
2734 if (msg_type(imsg) == TIPC_MCAST_MSG)
2735 max = TIPC_MAX_USER_MSG_SIZE + MCAST_H_SIZE;
2736 if (msg_size(imsg) > max) {
2737 msg_dbg(fragm,"<REC<Oversized: ");
2738 buf_discard(fbuf);
2739 return 0;
2740 }
2741 pbuf = buf_acquire(msg_size(imsg));
2742 if (pbuf != NULL) {
2743 pbuf->next = *pending;
2744 *pending = pbuf;
2745 skb_copy_to_linear_data(pbuf, imsg,
2746 msg_data_sz(fragm));
2747 /* Prepare buffer for subsequent fragments. */
2748
2749 set_long_msg_seqno(pbuf, long_msg_seq_no);
2750 set_fragm_size(pbuf,fragm_sz);
2751 set_expected_frags(pbuf,exp_fragm_cnt - 1);
2752 } else {
2753 warn("Link unable to reassemble fragmented message\n");
2754 }
2755 buf_discard(fbuf);
2756 return 0;
2757 } else if (pbuf && (msg_type(fragm) != FIRST_FRAGMENT)) {
2758 u32 dsz = msg_data_sz(fragm);
2759 u32 fsz = get_fragm_size(pbuf);
2760 u32 crs = ((msg_fragm_no(fragm) - 1) * fsz);
2761 u32 exp_frags = get_expected_frags(pbuf) - 1;
2762 skb_copy_to_linear_data_offset(pbuf, crs,
2763 msg_data(fragm), dsz);
2764 buf_discard(fbuf);
2765
2766 /* Is message complete? */
2767
2768 if (exp_frags == 0) {
2769 if (prev)
2770 prev->next = pbuf->next;
2771 else
2772 *pending = pbuf->next;
2773 msg_reset_reroute_cnt(buf_msg(pbuf));
2774 *fb = pbuf;
2775 *m = buf_msg(pbuf);
2776 return 1;
2777 }
2778 set_expected_frags(pbuf,exp_frags);
2779 return 0;
2780 }
2781 dbg(" Discarding orphan fragment %x\n",fbuf);
2782 msg_dbg(fragm,"ORPHAN:");
2783 dbg("Pending long buffers:\n");
2784 dbg_print_buf_chain(*pending);
2785 buf_discard(fbuf);
2786 return 0;
2787 }
2788
2789 /**
2790 * link_check_defragm_bufs - flush stale incoming message fragments
2791 * @l_ptr: pointer to link
2792 */
2793
2794 static void link_check_defragm_bufs(struct link *l_ptr)
2795 {
2796 struct sk_buff *prev = NULL;
2797 struct sk_buff *next = NULL;
2798 struct sk_buff *buf = l_ptr->defragm_buf;
2799
2800 if (!buf)
2801 return;
2802 if (!link_working_working(l_ptr))
2803 return;
2804 while (buf) {
2805 u32 cnt = get_timer_cnt(buf);
2806
2807 next = buf->next;
2808 if (cnt < 4) {
2809 incr_timer_cnt(buf);
2810 prev = buf;
2811 } else {
2812 dbg(" Discarding incomplete long buffer\n");
2813 msg_dbg(buf_msg(buf), "LONG:");
2814 dbg_print_link(l_ptr, "curr:");
2815 dbg("Pending long buffers:\n");
2816 dbg_print_buf_chain(l_ptr->defragm_buf);
2817 if (prev)
2818 prev->next = buf->next;
2819 else
2820 l_ptr->defragm_buf = buf->next;
2821 buf_discard(buf);
2822 }
2823 buf = next;
2824 }
2825 }
2826
2827
2828
2829 static void link_set_supervision_props(struct link *l_ptr, u32 tolerance)
2830 {
2831 l_ptr->tolerance = tolerance;
2832 l_ptr->continuity_interval =
2833 ((tolerance / 4) > 500) ? 500 : tolerance / 4;
2834 l_ptr->abort_limit = tolerance / (l_ptr->continuity_interval / 4);
2835 }
2836
2837
2838 void tipc_link_set_queue_limits(struct link *l_ptr, u32 window)
2839 {
2840 /* Data messages from this node, inclusive FIRST_FRAGM */
2841 l_ptr->queue_limit[TIPC_LOW_IMPORTANCE] = window;
2842 l_ptr->queue_limit[TIPC_MEDIUM_IMPORTANCE] = (window / 3) * 4;
2843 l_ptr->queue_limit[TIPC_HIGH_IMPORTANCE] = (window / 3) * 5;
2844 l_ptr->queue_limit[TIPC_CRITICAL_IMPORTANCE] = (window / 3) * 6;
2845 /* Transiting data messages,inclusive FIRST_FRAGM */
2846 l_ptr->queue_limit[TIPC_LOW_IMPORTANCE + 4] = 300;
2847 l_ptr->queue_limit[TIPC_MEDIUM_IMPORTANCE + 4] = 600;
2848 l_ptr->queue_limit[TIPC_HIGH_IMPORTANCE + 4] = 900;
2849 l_ptr->queue_limit[TIPC_CRITICAL_IMPORTANCE + 4] = 1200;
2850 l_ptr->queue_limit[CONN_MANAGER] = 1200;
2851 l_ptr->queue_limit[ROUTE_DISTRIBUTOR] = 1200;
2852 l_ptr->queue_limit[CHANGEOVER_PROTOCOL] = 2500;
2853 l_ptr->queue_limit[NAME_DISTRIBUTOR] = 3000;
2854 /* FRAGMENT and LAST_FRAGMENT packets */
2855 l_ptr->queue_limit[MSG_FRAGMENTER] = 4000;
2856 }
2857
2858 /**
2859 * link_find_link - locate link by name
2860 * @name - ptr to link name string
2861 * @node - ptr to area to be filled with ptr to associated node
2862 *
2863 * Caller must hold 'tipc_net_lock' to ensure node and bearer are not deleted;
2864 * this also prevents link deletion.
2865 *
2866 * Returns pointer to link (or 0 if invalid link name).
2867 */
2868
2869 static struct link *link_find_link(const char *name, struct node **node)
2870 {
2871 struct link_name link_name_parts;
2872 struct bearer *b_ptr;
2873 struct link *l_ptr;
2874
2875 if (!link_name_validate(name, &link_name_parts))
2876 return NULL;
2877
2878 b_ptr = tipc_bearer_find_interface(link_name_parts.if_local);
2879 if (!b_ptr)
2880 return NULL;
2881
2882 *node = tipc_node_find(link_name_parts.addr_peer);
2883 if (!*node)
2884 return NULL;
2885
2886 l_ptr = (*node)->links[b_ptr->identity];
2887 if (!l_ptr || strcmp(l_ptr->name, name))
2888 return NULL;
2889
2890 return l_ptr;
2891 }
2892
2893 struct sk_buff *tipc_link_cmd_config(const void *req_tlv_area, int req_tlv_space,
2894 u16 cmd)
2895 {
2896 struct tipc_link_config *args;
2897 u32 new_value;
2898 struct link *l_ptr;
2899 struct node *node;
2900 int res;
2901
2902 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_LINK_CONFIG))
2903 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
2904
2905 args = (struct tipc_link_config *)TLV_DATA(req_tlv_area);
2906 new_value = ntohl(args->value);
2907
2908 if (!strcmp(args->name, tipc_bclink_name)) {
2909 if ((cmd == TIPC_CMD_SET_LINK_WINDOW) &&
2910 (tipc_bclink_set_queue_limits(new_value) == 0))
2911 return tipc_cfg_reply_none();
2912 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
2913 " (cannot change setting on broadcast link)");
2914 }
2915
2916 read_lock_bh(&tipc_net_lock);
2917 l_ptr = link_find_link(args->name, &node);
2918 if (!l_ptr) {
2919 read_unlock_bh(&tipc_net_lock);
2920 return tipc_cfg_reply_error_string("link not found");
2921 }
2922
2923 tipc_node_lock(node);
2924 res = -EINVAL;
2925 switch (cmd) {
2926 case TIPC_CMD_SET_LINK_TOL:
2927 if ((new_value >= TIPC_MIN_LINK_TOL) &&
2928 (new_value <= TIPC_MAX_LINK_TOL)) {
2929 link_set_supervision_props(l_ptr, new_value);
2930 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
2931 0, 0, new_value, 0, 0);
2932 res = TIPC_OK;
2933 }
2934 break;
2935 case TIPC_CMD_SET_LINK_PRI:
2936 if ((new_value >= TIPC_MIN_LINK_PRI) &&
2937 (new_value <= TIPC_MAX_LINK_PRI)) {
2938 l_ptr->priority = new_value;
2939 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
2940 0, 0, 0, new_value, 0);
2941 res = TIPC_OK;
2942 }
2943 break;
2944 case TIPC_CMD_SET_LINK_WINDOW:
2945 if ((new_value >= TIPC_MIN_LINK_WIN) &&
2946 (new_value <= TIPC_MAX_LINK_WIN)) {
2947 tipc_link_set_queue_limits(l_ptr, new_value);
2948 res = TIPC_OK;
2949 }
2950 break;
2951 }
2952 tipc_node_unlock(node);
2953
2954 read_unlock_bh(&tipc_net_lock);
2955 if (res)
2956 return tipc_cfg_reply_error_string("cannot change link setting");
2957
2958 return tipc_cfg_reply_none();
2959 }
2960
2961 /**
2962 * link_reset_statistics - reset link statistics
2963 * @l_ptr: pointer to link
2964 */
2965
2966 static void link_reset_statistics(struct link *l_ptr)
2967 {
2968 memset(&l_ptr->stats, 0, sizeof(l_ptr->stats));
2969 l_ptr->stats.sent_info = l_ptr->next_out_no;
2970 l_ptr->stats.recv_info = l_ptr->next_in_no;
2971 }
2972
2973 struct sk_buff *tipc_link_cmd_reset_stats(const void *req_tlv_area, int req_tlv_space)
2974 {
2975 char *link_name;
2976 struct link *l_ptr;
2977 struct node *node;
2978
2979 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_LINK_NAME))
2980 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
2981
2982 link_name = (char *)TLV_DATA(req_tlv_area);
2983 if (!strcmp(link_name, tipc_bclink_name)) {
2984 if (tipc_bclink_reset_stats())
2985 return tipc_cfg_reply_error_string("link not found");
2986 return tipc_cfg_reply_none();
2987 }
2988
2989 read_lock_bh(&tipc_net_lock);
2990 l_ptr = link_find_link(link_name, &node);
2991 if (!l_ptr) {
2992 read_unlock_bh(&tipc_net_lock);
2993 return tipc_cfg_reply_error_string("link not found");
2994 }
2995
2996 tipc_node_lock(node);
2997 link_reset_statistics(l_ptr);
2998 tipc_node_unlock(node);
2999 read_unlock_bh(&tipc_net_lock);
3000 return tipc_cfg_reply_none();
3001 }
3002
3003 /**
3004 * percent - convert count to a percentage of total (rounding up or down)
3005 */
3006
3007 static u32 percent(u32 count, u32 total)
3008 {
3009 return (count * 100 + (total / 2)) / total;
3010 }
3011
3012 /**
3013 * tipc_link_stats - print link statistics
3014 * @name: link name
3015 * @buf: print buffer area
3016 * @buf_size: size of print buffer area
3017 *
3018 * Returns length of print buffer data string (or 0 if error)
3019 */
3020
3021 static int tipc_link_stats(const char *name, char *buf, const u32 buf_size)
3022 {
3023 struct print_buf pb;
3024 struct link *l_ptr;
3025 struct node *node;
3026 char *status;
3027 u32 profile_total = 0;
3028
3029 if (!strcmp(name, tipc_bclink_name))
3030 return tipc_bclink_stats(buf, buf_size);
3031
3032 tipc_printbuf_init(&pb, buf, buf_size);
3033
3034 read_lock_bh(&tipc_net_lock);
3035 l_ptr = link_find_link(name, &node);
3036 if (!l_ptr) {
3037 read_unlock_bh(&tipc_net_lock);
3038 return 0;
3039 }
3040 tipc_node_lock(node);
3041
3042 if (tipc_link_is_active(l_ptr))
3043 status = "ACTIVE";
3044 else if (tipc_link_is_up(l_ptr))
3045 status = "STANDBY";
3046 else
3047 status = "DEFUNCT";
3048 tipc_printf(&pb, "Link <%s>\n"
3049 " %s MTU:%u Priority:%u Tolerance:%u ms"
3050 " Window:%u packets\n",
3051 l_ptr->name, status, link_max_pkt(l_ptr),
3052 l_ptr->priority, l_ptr->tolerance, l_ptr->queue_limit[0]);
3053 tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n",
3054 l_ptr->next_in_no - l_ptr->stats.recv_info,
3055 l_ptr->stats.recv_fragments,
3056 l_ptr->stats.recv_fragmented,
3057 l_ptr->stats.recv_bundles,
3058 l_ptr->stats.recv_bundled);
3059 tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n",
3060 l_ptr->next_out_no - l_ptr->stats.sent_info,
3061 l_ptr->stats.sent_fragments,
3062 l_ptr->stats.sent_fragmented,
3063 l_ptr->stats.sent_bundles,
3064 l_ptr->stats.sent_bundled);
3065 profile_total = l_ptr->stats.msg_length_counts;
3066 if (!profile_total)
3067 profile_total = 1;
3068 tipc_printf(&pb, " TX profile sample:%u packets average:%u octets\n"
3069 " 0-64:%u%% -256:%u%% -1024:%u%% -4096:%u%% "
3070 "-16354:%u%% -32768:%u%% -66000:%u%%\n",
3071 l_ptr->stats.msg_length_counts,
3072 l_ptr->stats.msg_lengths_total / profile_total,
3073 percent(l_ptr->stats.msg_length_profile[0], profile_total),
3074 percent(l_ptr->stats.msg_length_profile[1], profile_total),
3075 percent(l_ptr->stats.msg_length_profile[2], profile_total),
3076 percent(l_ptr->stats.msg_length_profile[3], profile_total),
3077 percent(l_ptr->stats.msg_length_profile[4], profile_total),
3078 percent(l_ptr->stats.msg_length_profile[5], profile_total),
3079 percent(l_ptr->stats.msg_length_profile[6], profile_total));
3080 tipc_printf(&pb, " RX states:%u probes:%u naks:%u defs:%u dups:%u\n",
3081 l_ptr->stats.recv_states,
3082 l_ptr->stats.recv_probes,
3083 l_ptr->stats.recv_nacks,
3084 l_ptr->stats.deferred_recv,
3085 l_ptr->stats.duplicates);
3086 tipc_printf(&pb, " TX states:%u probes:%u naks:%u acks:%u dups:%u\n",
3087 l_ptr->stats.sent_states,
3088 l_ptr->stats.sent_probes,
3089 l_ptr->stats.sent_nacks,
3090 l_ptr->stats.sent_acks,
3091 l_ptr->stats.retransmitted);
3092 tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n",
3093 l_ptr->stats.bearer_congs,
3094 l_ptr->stats.link_congs,
3095 l_ptr->stats.max_queue_sz,
3096 l_ptr->stats.queue_sz_counts
3097 ? (l_ptr->stats.accu_queue_sz / l_ptr->stats.queue_sz_counts)
3098 : 0);
3099
3100 tipc_node_unlock(node);
3101 read_unlock_bh(&tipc_net_lock);
3102 return tipc_printbuf_validate(&pb);
3103 }
3104
3105 #define MAX_LINK_STATS_INFO 2000
3106
3107 struct sk_buff *tipc_link_cmd_show_stats(const void *req_tlv_area, int req_tlv_space)
3108 {
3109 struct sk_buff *buf;
3110 struct tlv_desc *rep_tlv;
3111 int str_len;
3112
3113 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_LINK_NAME))
3114 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
3115
3116 buf = tipc_cfg_reply_alloc(TLV_SPACE(MAX_LINK_STATS_INFO));
3117 if (!buf)
3118 return NULL;
3119
3120 rep_tlv = (struct tlv_desc *)buf->data;
3121
3122 str_len = tipc_link_stats((char *)TLV_DATA(req_tlv_area),
3123 (char *)TLV_DATA(rep_tlv), MAX_LINK_STATS_INFO);
3124 if (!str_len) {
3125 buf_discard(buf);
3126 return tipc_cfg_reply_error_string("link not found");
3127 }
3128
3129 skb_put(buf, TLV_SPACE(str_len));
3130 TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len);
3131
3132 return buf;
3133 }
3134
3135 #if 0
3136 int link_control(const char *name, u32 op, u32 val)
3137 {
3138 int res = -EINVAL;
3139 struct link *l_ptr;
3140 u32 bearer_id;
3141 struct node * node;
3142 u32 a;
3143
3144 a = link_name2addr(name, &bearer_id);
3145 read_lock_bh(&tipc_net_lock);
3146 node = tipc_node_find(a);
3147 if (node) {
3148 tipc_node_lock(node);
3149 l_ptr = node->links[bearer_id];
3150 if (l_ptr) {
3151 if (op == TIPC_REMOVE_LINK) {
3152 struct bearer *b_ptr = l_ptr->b_ptr;
3153 spin_lock_bh(&b_ptr->publ.lock);
3154 tipc_link_delete(l_ptr);
3155 spin_unlock_bh(&b_ptr->publ.lock);
3156 }
3157 if (op == TIPC_CMD_BLOCK_LINK) {
3158 tipc_link_reset(l_ptr);
3159 l_ptr->blocked = 1;
3160 }
3161 if (op == TIPC_CMD_UNBLOCK_LINK) {
3162 l_ptr->blocked = 0;
3163 }
3164 res = TIPC_OK;
3165 }
3166 tipc_node_unlock(node);
3167 }
3168 read_unlock_bh(&tipc_net_lock);
3169 return res;
3170 }
3171 #endif
3172
3173 /**
3174 * tipc_link_get_max_pkt - get maximum packet size to use when sending to destination
3175 * @dest: network address of destination node
3176 * @selector: used to select from set of active links
3177 *
3178 * If no active link can be found, uses default maximum packet size.
3179 */
3180
3181 u32 tipc_link_get_max_pkt(u32 dest, u32 selector)
3182 {
3183 struct node *n_ptr;
3184 struct link *l_ptr;
3185 u32 res = MAX_PKT_DEFAULT;
3186
3187 if (dest == tipc_own_addr)
3188 return MAX_MSG_SIZE;
3189
3190 read_lock_bh(&tipc_net_lock);
3191 n_ptr = tipc_node_select(dest, selector);
3192 if (n_ptr) {
3193 tipc_node_lock(n_ptr);
3194 l_ptr = n_ptr->active_links[selector & 1];
3195 if (l_ptr)
3196 res = link_max_pkt(l_ptr);
3197 tipc_node_unlock(n_ptr);
3198 }
3199 read_unlock_bh(&tipc_net_lock);
3200 return res;
3201 }
3202
3203 #if 0
3204 static void link_dump_rec_queue(struct link *l_ptr)
3205 {
3206 struct sk_buff *crs;
3207
3208 if (!l_ptr->oldest_deferred_in) {
3209 info("Reception queue empty\n");
3210 return;
3211 }
3212 info("Contents of Reception queue:\n");
3213 crs = l_ptr->oldest_deferred_in;
3214 while (crs) {
3215 if (crs->data == (void *)0x0000a3a3) {
3216 info("buffer %x invalid\n", crs);
3217 return;
3218 }
3219 msg_dbg(buf_msg(crs), "In rec queue: \n");
3220 crs = crs->next;
3221 }
3222 }
3223 #endif
3224
3225 static void link_dump_send_queue(struct link *l_ptr)
3226 {
3227 if (l_ptr->next_out) {
3228 info("\nContents of unsent queue:\n");
3229 dbg_print_buf_chain(l_ptr->next_out);
3230 }
3231 info("\nContents of send queue:\n");
3232 if (l_ptr->first_out) {
3233 dbg_print_buf_chain(l_ptr->first_out);
3234 }
3235 info("Empty send queue\n");
3236 }
3237
3238 static void link_print(struct link *l_ptr, struct print_buf *buf,
3239 const char *str)
3240 {
3241 tipc_printf(buf, str);
3242 if (link_reset_reset(l_ptr) || link_reset_unknown(l_ptr))
3243 return;
3244 tipc_printf(buf, "Link %x<%s>:",
3245 l_ptr->addr, l_ptr->b_ptr->publ.name);
3246 tipc_printf(buf, ": NXO(%u):", mod(l_ptr->next_out_no));
3247 tipc_printf(buf, "NXI(%u):", mod(l_ptr->next_in_no));
3248 tipc_printf(buf, "SQUE");
3249 if (l_ptr->first_out) {
3250 tipc_printf(buf, "[%u..", msg_seqno(buf_msg(l_ptr->first_out)));
3251 if (l_ptr->next_out)
3252 tipc_printf(buf, "%u..",
3253 msg_seqno(buf_msg(l_ptr->next_out)));
3254 tipc_printf(buf, "%u]",
3255 msg_seqno(buf_msg
3256 (l_ptr->last_out)), l_ptr->out_queue_size);
3257 if ((mod(msg_seqno(buf_msg(l_ptr->last_out)) -
3258 msg_seqno(buf_msg(l_ptr->first_out)))
3259 != (l_ptr->out_queue_size - 1))
3260 || (l_ptr->last_out->next != NULL)) {
3261 tipc_printf(buf, "\nSend queue inconsistency\n");
3262 tipc_printf(buf, "first_out= %x ", l_ptr->first_out);
3263 tipc_printf(buf, "next_out= %x ", l_ptr->next_out);
3264 tipc_printf(buf, "last_out= %x ", l_ptr->last_out);
3265 link_dump_send_queue(l_ptr);
3266 }
3267 } else
3268 tipc_printf(buf, "[]");
3269 tipc_printf(buf, "SQSIZ(%u)", l_ptr->out_queue_size);
3270 if (l_ptr->oldest_deferred_in) {
3271 u32 o = msg_seqno(buf_msg(l_ptr->oldest_deferred_in));
3272 u32 n = msg_seqno(buf_msg(l_ptr->newest_deferred_in));
3273 tipc_printf(buf, ":RQUE[%u..%u]", o, n);
3274 if (l_ptr->deferred_inqueue_sz != mod((n + 1) - o)) {
3275 tipc_printf(buf, ":RQSIZ(%u)",
3276 l_ptr->deferred_inqueue_sz);
3277 }
3278 }
3279 if (link_working_unknown(l_ptr))
3280 tipc_printf(buf, ":WU");
3281 if (link_reset_reset(l_ptr))
3282 tipc_printf(buf, ":RR");
3283 if (link_reset_unknown(l_ptr))
3284 tipc_printf(buf, ":RU");
3285 if (link_working_working(l_ptr))
3286 tipc_printf(buf, ":WW");
3287 tipc_printf(buf, "\n");
3288 }
3289
(deprecated) Btrfs devel tree