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