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