1 /* 2 * net/tipc/link.c: TIPC link code 3 * 4 * Copyright (c) 1996-2007, 2012-2016, Ericsson AB 5 * Copyright (c) 2004-2007, 2010-2013, Wind River Systems 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions are met: 10 * 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. Neither the names of the copyright holders nor the names of its 17 * contributors may be used to endorse or promote products derived from 18 * this software without specific prior written permission. 19 * 20 * Alternatively, this software may be distributed under the terms of the 21 * GNU General Public License ("GPL") version 2 as published by the Free 22 * Software Foundation. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 34 * POSSIBILITY OF SUCH DAMAGE. 35 */ 36 37 #include "core.h" 38 #include "subscr.h" 39 #include "link.h" 40 #include "bcast.h" 41 #include "socket.h" 42 #include "name_distr.h" 43 #include "discover.h" 44 #include "netlink.h" 45 #include "monitor.h" 46 47 #include <linux/pkt_sched.h> 48 49 struct tipc_stats { 50 u32 sent_pkts; 51 u32 recv_pkts; 52 u32 sent_states; 53 u32 recv_states; 54 u32 sent_probes; 55 u32 recv_probes; 56 u32 sent_nacks; 57 u32 recv_nacks; 58 u32 sent_acks; 59 u32 sent_bundled; 60 u32 sent_bundles; 61 u32 recv_bundled; 62 u32 recv_bundles; 63 u32 retransmitted; 64 u32 sent_fragmented; 65 u32 sent_fragments; 66 u32 recv_fragmented; 67 u32 recv_fragments; 68 u32 link_congs; /* # port sends blocked by congestion */ 69 u32 deferred_recv; 70 u32 duplicates; 71 u32 max_queue_sz; /* send queue size high water mark */ 72 u32 accu_queue_sz; /* used for send queue size profiling */ 73 u32 queue_sz_counts; /* used for send queue size profiling */ 74 u32 msg_length_counts; /* used for message length profiling */ 75 u32 msg_lengths_total; /* used for message length profiling */ 76 u32 msg_length_profile[7]; /* used for msg. length profiling */ 77 }; 78 79 /** 80 * struct tipc_link - TIPC link data structure 81 * @addr: network address of link's peer node 82 * @name: link name character string 83 * @media_addr: media address to use when sending messages over link 84 * @timer: link timer 85 * @net: pointer to namespace struct 86 * @refcnt: reference counter for permanent references (owner node & timer) 87 * @peer_session: link session # being used by peer end of link 88 * @peer_bearer_id: bearer id used by link's peer endpoint 89 * @bearer_id: local bearer id used by link 90 * @tolerance: minimum link continuity loss needed to reset link [in ms] 91 * @abort_limit: # of unacknowledged continuity probes needed to reset link 92 * @state: current state of link FSM 93 * @peer_caps: bitmap describing capabilities of peer node 94 * @silent_intv_cnt: # of timer intervals without any reception from peer 95 * @proto_msg: template for control messages generated by link 96 * @pmsg: convenience pointer to "proto_msg" field 97 * @priority: current link priority 98 * @net_plane: current link network plane ('A' through 'H') 99 * @mon_state: cookie with information needed by link monitor 100 * @backlog_limit: backlog queue congestion thresholds (indexed by importance) 101 * @exp_msg_count: # of tunnelled messages expected during link changeover 102 * @reset_rcv_checkpt: seq # of last acknowledged message at time of link reset 103 * @mtu: current maximum packet size for this link 104 * @advertised_mtu: advertised own mtu when link is being established 105 * @transmitq: queue for sent, non-acked messages 106 * @backlogq: queue for messages waiting to be sent 107 * @snt_nxt: next sequence number to use for outbound messages 108 * @last_retransmitted: sequence number of most recently retransmitted message 109 * @stale_count: # of identical retransmit requests made by peer 110 * @ackers: # of peers that needs to ack each packet before it can be released 111 * @acked: # last packet acked by a certain peer. Used for broadcast. 112 * @rcv_nxt: next sequence number to expect for inbound messages 113 * @deferred_queue: deferred queue saved OOS b'cast message received from node 114 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer 115 * @inputq: buffer queue for messages to be delivered upwards 116 * @namedq: buffer queue for name table messages to be delivered upwards 117 * @next_out: ptr to first unsent outbound message in queue 118 * @wakeupq: linked list of wakeup msgs waiting for link congestion to abate 119 * @long_msg_seq_no: next identifier to use for outbound fragmented messages 120 * @reasm_buf: head of partially reassembled inbound message fragments 121 * @bc_rcvr: marks that this is a broadcast receiver link 122 * @stats: collects statistics regarding link activity 123 */ 124 struct tipc_link { 125 u32 addr; 126 char name[TIPC_MAX_LINK_NAME]; 127 struct net *net; 128 129 /* Management and link supervision data */ 130 u32 peer_session; 131 u32 session; 132 u32 peer_bearer_id; 133 u32 bearer_id; 134 u32 tolerance; 135 u32 abort_limit; 136 u32 state; 137 u16 peer_caps; 138 bool active; 139 u32 silent_intv_cnt; 140 char if_name[TIPC_MAX_IF_NAME]; 141 u32 priority; 142 char net_plane; 143 struct tipc_mon_state mon_state; 144 u16 rst_cnt; 145 146 /* Failover/synch */ 147 u16 drop_point; 148 struct sk_buff *failover_reasm_skb; 149 150 /* Max packet negotiation */ 151 u16 mtu; 152 u16 advertised_mtu; 153 154 /* Sending */ 155 struct sk_buff_head transmq; 156 struct sk_buff_head backlogq; 157 struct { 158 u16 len; 159 u16 limit; 160 } backlog[5]; 161 u16 snd_nxt; 162 u16 last_retransm; 163 u16 window; 164 u32 stale_count; 165 166 /* Reception */ 167 u16 rcv_nxt; 168 u32 rcv_unacked; 169 struct sk_buff_head deferdq; 170 struct sk_buff_head *inputq; 171 struct sk_buff_head *namedq; 172 173 /* Congestion handling */ 174 struct sk_buff_head wakeupq; 175 176 /* Fragmentation/reassembly */ 177 struct sk_buff *reasm_buf; 178 179 /* Broadcast */ 180 u16 ackers; 181 u16 acked; 182 struct tipc_link *bc_rcvlink; 183 struct tipc_link *bc_sndlink; 184 unsigned long prev_retr; 185 u16 prev_from; 186 u16 prev_to; 187 u8 nack_state; 188 bool bc_peer_is_up; 189 190 /* Statistics */ 191 struct tipc_stats stats; 192 }; 193 194 /* 195 * Error message prefixes 196 */ 197 static const char *link_co_err = "Link tunneling error, "; 198 static const char *link_rst_msg = "Resetting link "; 199 200 /* Send states for broadcast NACKs 201 */ 202 enum { 203 BC_NACK_SND_CONDITIONAL, 204 BC_NACK_SND_UNCONDITIONAL, 205 BC_NACK_SND_SUPPRESS, 206 }; 207 208 #define TIPC_BC_RETR_LIMIT 10 /* [ms] */ 209 210 /* 211 * Interval between NACKs when packets arrive out of order 212 */ 213 #define TIPC_NACK_INTV (TIPC_MIN_LINK_WIN * 2) 214 215 /* Wildcard value for link session numbers. When it is known that 216 * peer endpoint is down, any session number must be accepted. 217 */ 218 #define ANY_SESSION 0x10000 219 220 /* Link FSM states: 221 */ 222 enum { 223 LINK_ESTABLISHED = 0xe, 224 LINK_ESTABLISHING = 0xe << 4, 225 LINK_RESET = 0x1 << 8, 226 LINK_RESETTING = 0x2 << 12, 227 LINK_PEER_RESET = 0xd << 16, 228 LINK_FAILINGOVER = 0xf << 20, 229 LINK_SYNCHING = 0xc << 24 230 }; 231 232 /* Link FSM state checking routines 233 */ 234 static int link_is_up(struct tipc_link *l) 235 { 236 return l->state & (LINK_ESTABLISHED | LINK_SYNCHING); 237 } 238 239 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb, 240 struct sk_buff_head *xmitq); 241 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe, 242 u16 rcvgap, int tolerance, int priority, 243 struct sk_buff_head *xmitq); 244 static void link_print(struct tipc_link *l, const char *str); 245 static int tipc_link_build_nack_msg(struct tipc_link *l, 246 struct sk_buff_head *xmitq); 247 static void tipc_link_build_bc_init_msg(struct tipc_link *l, 248 struct sk_buff_head *xmitq); 249 static bool tipc_link_release_pkts(struct tipc_link *l, u16 to); 250 251 /* 252 * Simple non-static link routines (i.e. referenced outside this file) 253 */ 254 bool tipc_link_is_up(struct tipc_link *l) 255 { 256 return link_is_up(l); 257 } 258 259 bool tipc_link_peer_is_down(struct tipc_link *l) 260 { 261 return l->state == LINK_PEER_RESET; 262 } 263 264 bool tipc_link_is_reset(struct tipc_link *l) 265 { 266 return l->state & (LINK_RESET | LINK_FAILINGOVER | LINK_ESTABLISHING); 267 } 268 269 bool tipc_link_is_establishing(struct tipc_link *l) 270 { 271 return l->state == LINK_ESTABLISHING; 272 } 273 274 bool tipc_link_is_synching(struct tipc_link *l) 275 { 276 return l->state == LINK_SYNCHING; 277 } 278 279 bool tipc_link_is_failingover(struct tipc_link *l) 280 { 281 return l->state == LINK_FAILINGOVER; 282 } 283 284 bool tipc_link_is_blocked(struct tipc_link *l) 285 { 286 return l->state & (LINK_RESETTING | LINK_PEER_RESET | LINK_FAILINGOVER); 287 } 288 289 static bool link_is_bc_sndlink(struct tipc_link *l) 290 { 291 return !l->bc_sndlink; 292 } 293 294 static bool link_is_bc_rcvlink(struct tipc_link *l) 295 { 296 return ((l->bc_rcvlink == l) && !link_is_bc_sndlink(l)); 297 } 298 299 int tipc_link_is_active(struct tipc_link *l) 300 { 301 return l->active; 302 } 303 304 void tipc_link_set_active(struct tipc_link *l, bool active) 305 { 306 l->active = active; 307 } 308 309 u32 tipc_link_id(struct tipc_link *l) 310 { 311 return l->peer_bearer_id << 16 | l->bearer_id; 312 } 313 314 int tipc_link_window(struct tipc_link *l) 315 { 316 return l->window; 317 } 318 319 int tipc_link_prio(struct tipc_link *l) 320 { 321 return l->priority; 322 } 323 324 unsigned long tipc_link_tolerance(struct tipc_link *l) 325 { 326 return l->tolerance; 327 } 328 329 struct sk_buff_head *tipc_link_inputq(struct tipc_link *l) 330 { 331 return l->inputq; 332 } 333 334 char tipc_link_plane(struct tipc_link *l) 335 { 336 return l->net_plane; 337 } 338 339 void tipc_link_add_bc_peer(struct tipc_link *snd_l, 340 struct tipc_link *uc_l, 341 struct sk_buff_head *xmitq) 342 { 343 struct tipc_link *rcv_l = uc_l->bc_rcvlink; 344 345 snd_l->ackers++; 346 rcv_l->acked = snd_l->snd_nxt - 1; 347 snd_l->state = LINK_ESTABLISHED; 348 tipc_link_build_bc_init_msg(uc_l, xmitq); 349 } 350 351 void tipc_link_remove_bc_peer(struct tipc_link *snd_l, 352 struct tipc_link *rcv_l, 353 struct sk_buff_head *xmitq) 354 { 355 u16 ack = snd_l->snd_nxt - 1; 356 357 snd_l->ackers--; 358 rcv_l->bc_peer_is_up = true; 359 rcv_l->state = LINK_ESTABLISHED; 360 tipc_link_bc_ack_rcv(rcv_l, ack, xmitq); 361 tipc_link_reset(rcv_l); 362 rcv_l->state = LINK_RESET; 363 if (!snd_l->ackers) { 364 tipc_link_reset(snd_l); 365 snd_l->state = LINK_RESET; 366 __skb_queue_purge(xmitq); 367 } 368 } 369 370 int tipc_link_bc_peers(struct tipc_link *l) 371 { 372 return l->ackers; 373 } 374 375 u16 link_bc_rcv_gap(struct tipc_link *l) 376 { 377 struct sk_buff *skb = skb_peek(&l->deferdq); 378 u16 gap = 0; 379 380 if (more(l->snd_nxt, l->rcv_nxt)) 381 gap = l->snd_nxt - l->rcv_nxt; 382 if (skb) 383 gap = buf_seqno(skb) - l->rcv_nxt; 384 return gap; 385 } 386 387 void tipc_link_set_mtu(struct tipc_link *l, int mtu) 388 { 389 l->mtu = mtu; 390 } 391 392 int tipc_link_mtu(struct tipc_link *l) 393 { 394 return l->mtu; 395 } 396 397 u16 tipc_link_rcv_nxt(struct tipc_link *l) 398 { 399 return l->rcv_nxt; 400 } 401 402 u16 tipc_link_acked(struct tipc_link *l) 403 { 404 return l->acked; 405 } 406 407 char *tipc_link_name(struct tipc_link *l) 408 { 409 return l->name; 410 } 411 412 /** 413 * tipc_link_create - create a new link 414 * @n: pointer to associated node 415 * @if_name: associated interface name 416 * @bearer_id: id (index) of associated bearer 417 * @tolerance: link tolerance to be used by link 418 * @net_plane: network plane (A,B,c..) this link belongs to 419 * @mtu: mtu to be advertised by link 420 * @priority: priority to be used by link 421 * @window: send window to be used by link 422 * @session: session to be used by link 423 * @ownnode: identity of own node 424 * @peer: node id of peer node 425 * @peer_caps: bitmap describing peer node capabilities 426 * @bc_sndlink: the namespace global link used for broadcast sending 427 * @bc_rcvlink: the peer specific link used for broadcast reception 428 * @inputq: queue to put messages ready for delivery 429 * @namedq: queue to put binding table update messages ready for delivery 430 * @link: return value, pointer to put the created link 431 * 432 * Returns true if link was created, otherwise false 433 */ 434 bool tipc_link_create(struct net *net, char *if_name, int bearer_id, 435 int tolerance, char net_plane, u32 mtu, int priority, 436 int window, u32 session, u32 ownnode, u32 peer, 437 u16 peer_caps, 438 struct tipc_link *bc_sndlink, 439 struct tipc_link *bc_rcvlink, 440 struct sk_buff_head *inputq, 441 struct sk_buff_head *namedq, 442 struct tipc_link **link) 443 { 444 struct tipc_link *l; 445 446 l = kzalloc(sizeof(*l), GFP_ATOMIC); 447 if (!l) 448 return false; 449 *link = l; 450 l->session = session; 451 452 /* Note: peer i/f name is completed by reset/activate message */ 453 sprintf(l->name, "%u.%u.%u:%s-%u.%u.%u:unknown", 454 tipc_zone(ownnode), tipc_cluster(ownnode), tipc_node(ownnode), 455 if_name, tipc_zone(peer), tipc_cluster(peer), tipc_node(peer)); 456 strcpy(l->if_name, if_name); 457 l->addr = peer; 458 l->peer_caps = peer_caps; 459 l->net = net; 460 l->peer_session = ANY_SESSION; 461 l->bearer_id = bearer_id; 462 l->tolerance = tolerance; 463 l->net_plane = net_plane; 464 l->advertised_mtu = mtu; 465 l->mtu = mtu; 466 l->priority = priority; 467 tipc_link_set_queue_limits(l, window); 468 l->ackers = 1; 469 l->bc_sndlink = bc_sndlink; 470 l->bc_rcvlink = bc_rcvlink; 471 l->inputq = inputq; 472 l->namedq = namedq; 473 l->state = LINK_RESETTING; 474 __skb_queue_head_init(&l->transmq); 475 __skb_queue_head_init(&l->backlogq); 476 __skb_queue_head_init(&l->deferdq); 477 skb_queue_head_init(&l->wakeupq); 478 skb_queue_head_init(l->inputq); 479 return true; 480 } 481 482 /** 483 * tipc_link_bc_create - create new link to be used for broadcast 484 * @n: pointer to associated node 485 * @mtu: mtu to be used 486 * @window: send window to be used 487 * @inputq: queue to put messages ready for delivery 488 * @namedq: queue to put binding table update messages ready for delivery 489 * @link: return value, pointer to put the created link 490 * 491 * Returns true if link was created, otherwise false 492 */ 493 bool tipc_link_bc_create(struct net *net, u32 ownnode, u32 peer, 494 int mtu, int window, u16 peer_caps, 495 struct sk_buff_head *inputq, 496 struct sk_buff_head *namedq, 497 struct tipc_link *bc_sndlink, 498 struct tipc_link **link) 499 { 500 struct tipc_link *l; 501 502 if (!tipc_link_create(net, "", MAX_BEARERS, 0, 'Z', mtu, 0, window, 503 0, ownnode, peer, peer_caps, bc_sndlink, 504 NULL, inputq, namedq, link)) 505 return false; 506 507 l = *link; 508 strcpy(l->name, tipc_bclink_name); 509 tipc_link_reset(l); 510 l->state = LINK_RESET; 511 l->ackers = 0; 512 l->bc_rcvlink = l; 513 514 /* Broadcast send link is always up */ 515 if (link_is_bc_sndlink(l)) 516 l->state = LINK_ESTABLISHED; 517 518 /* Disable replicast if even a single peer doesn't support it */ 519 if (link_is_bc_rcvlink(l) && !(peer_caps & TIPC_BCAST_RCAST)) 520 tipc_bcast_disable_rcast(net); 521 522 return true; 523 } 524 525 /** 526 * tipc_link_fsm_evt - link finite state machine 527 * @l: pointer to link 528 * @evt: state machine event to be processed 529 */ 530 int tipc_link_fsm_evt(struct tipc_link *l, int evt) 531 { 532 int rc = 0; 533 534 switch (l->state) { 535 case LINK_RESETTING: 536 switch (evt) { 537 case LINK_PEER_RESET_EVT: 538 l->state = LINK_PEER_RESET; 539 break; 540 case LINK_RESET_EVT: 541 l->state = LINK_RESET; 542 break; 543 case LINK_FAILURE_EVT: 544 case LINK_FAILOVER_BEGIN_EVT: 545 case LINK_ESTABLISH_EVT: 546 case LINK_FAILOVER_END_EVT: 547 case LINK_SYNCH_BEGIN_EVT: 548 case LINK_SYNCH_END_EVT: 549 default: 550 goto illegal_evt; 551 } 552 break; 553 case LINK_RESET: 554 switch (evt) { 555 case LINK_PEER_RESET_EVT: 556 l->state = LINK_ESTABLISHING; 557 break; 558 case LINK_FAILOVER_BEGIN_EVT: 559 l->state = LINK_FAILINGOVER; 560 case LINK_FAILURE_EVT: 561 case LINK_RESET_EVT: 562 case LINK_ESTABLISH_EVT: 563 case LINK_FAILOVER_END_EVT: 564 break; 565 case LINK_SYNCH_BEGIN_EVT: 566 case LINK_SYNCH_END_EVT: 567 default: 568 goto illegal_evt; 569 } 570 break; 571 case LINK_PEER_RESET: 572 switch (evt) { 573 case LINK_RESET_EVT: 574 l->state = LINK_ESTABLISHING; 575 break; 576 case LINK_PEER_RESET_EVT: 577 case LINK_ESTABLISH_EVT: 578 case LINK_FAILURE_EVT: 579 break; 580 case LINK_SYNCH_BEGIN_EVT: 581 case LINK_SYNCH_END_EVT: 582 case LINK_FAILOVER_BEGIN_EVT: 583 case LINK_FAILOVER_END_EVT: 584 default: 585 goto illegal_evt; 586 } 587 break; 588 case LINK_FAILINGOVER: 589 switch (evt) { 590 case LINK_FAILOVER_END_EVT: 591 l->state = LINK_RESET; 592 break; 593 case LINK_PEER_RESET_EVT: 594 case LINK_RESET_EVT: 595 case LINK_ESTABLISH_EVT: 596 case LINK_FAILURE_EVT: 597 break; 598 case LINK_FAILOVER_BEGIN_EVT: 599 case LINK_SYNCH_BEGIN_EVT: 600 case LINK_SYNCH_END_EVT: 601 default: 602 goto illegal_evt; 603 } 604 break; 605 case LINK_ESTABLISHING: 606 switch (evt) { 607 case LINK_ESTABLISH_EVT: 608 l->state = LINK_ESTABLISHED; 609 break; 610 case LINK_FAILOVER_BEGIN_EVT: 611 l->state = LINK_FAILINGOVER; 612 break; 613 case LINK_RESET_EVT: 614 l->state = LINK_RESET; 615 break; 616 case LINK_FAILURE_EVT: 617 case LINK_PEER_RESET_EVT: 618 case LINK_SYNCH_BEGIN_EVT: 619 case LINK_FAILOVER_END_EVT: 620 break; 621 case LINK_SYNCH_END_EVT: 622 default: 623 goto illegal_evt; 624 } 625 break; 626 case LINK_ESTABLISHED: 627 switch (evt) { 628 case LINK_PEER_RESET_EVT: 629 l->state = LINK_PEER_RESET; 630 rc |= TIPC_LINK_DOWN_EVT; 631 break; 632 case LINK_FAILURE_EVT: 633 l->state = LINK_RESETTING; 634 rc |= TIPC_LINK_DOWN_EVT; 635 break; 636 case LINK_RESET_EVT: 637 l->state = LINK_RESET; 638 break; 639 case LINK_ESTABLISH_EVT: 640 case LINK_SYNCH_END_EVT: 641 break; 642 case LINK_SYNCH_BEGIN_EVT: 643 l->state = LINK_SYNCHING; 644 break; 645 case LINK_FAILOVER_BEGIN_EVT: 646 case LINK_FAILOVER_END_EVT: 647 default: 648 goto illegal_evt; 649 } 650 break; 651 case LINK_SYNCHING: 652 switch (evt) { 653 case LINK_PEER_RESET_EVT: 654 l->state = LINK_PEER_RESET; 655 rc |= TIPC_LINK_DOWN_EVT; 656 break; 657 case LINK_FAILURE_EVT: 658 l->state = LINK_RESETTING; 659 rc |= TIPC_LINK_DOWN_EVT; 660 break; 661 case LINK_RESET_EVT: 662 l->state = LINK_RESET; 663 break; 664 case LINK_ESTABLISH_EVT: 665 case LINK_SYNCH_BEGIN_EVT: 666 break; 667 case LINK_SYNCH_END_EVT: 668 l->state = LINK_ESTABLISHED; 669 break; 670 case LINK_FAILOVER_BEGIN_EVT: 671 case LINK_FAILOVER_END_EVT: 672 default: 673 goto illegal_evt; 674 } 675 break; 676 default: 677 pr_err("Unknown FSM state %x in %s\n", l->state, l->name); 678 } 679 return rc; 680 illegal_evt: 681 pr_err("Illegal FSM event %x in state %x on link %s\n", 682 evt, l->state, l->name); 683 return rc; 684 } 685 686 /* link_profile_stats - update statistical profiling of traffic 687 */ 688 static void link_profile_stats(struct tipc_link *l) 689 { 690 struct sk_buff *skb; 691 struct tipc_msg *msg; 692 int length; 693 694 /* Update counters used in statistical profiling of send traffic */ 695 l->stats.accu_queue_sz += skb_queue_len(&l->transmq); 696 l->stats.queue_sz_counts++; 697 698 skb = skb_peek(&l->transmq); 699 if (!skb) 700 return; 701 msg = buf_msg(skb); 702 length = msg_size(msg); 703 704 if (msg_user(msg) == MSG_FRAGMENTER) { 705 if (msg_type(msg) != FIRST_FRAGMENT) 706 return; 707 length = msg_size(msg_get_wrapped(msg)); 708 } 709 l->stats.msg_lengths_total += length; 710 l->stats.msg_length_counts++; 711 if (length <= 64) 712 l->stats.msg_length_profile[0]++; 713 else if (length <= 256) 714 l->stats.msg_length_profile[1]++; 715 else if (length <= 1024) 716 l->stats.msg_length_profile[2]++; 717 else if (length <= 4096) 718 l->stats.msg_length_profile[3]++; 719 else if (length <= 16384) 720 l->stats.msg_length_profile[4]++; 721 else if (length <= 32768) 722 l->stats.msg_length_profile[5]++; 723 else 724 l->stats.msg_length_profile[6]++; 725 } 726 727 /* tipc_link_timeout - perform periodic task as instructed from node timeout 728 */ 729 int tipc_link_timeout(struct tipc_link *l, struct sk_buff_head *xmitq) 730 { 731 int mtyp = 0; 732 int rc = 0; 733 bool state = false; 734 bool probe = false; 735 bool setup = false; 736 u16 bc_snt = l->bc_sndlink->snd_nxt - 1; 737 u16 bc_acked = l->bc_rcvlink->acked; 738 struct tipc_mon_state *mstate = &l->mon_state; 739 740 switch (l->state) { 741 case LINK_ESTABLISHED: 742 case LINK_SYNCHING: 743 mtyp = STATE_MSG; 744 link_profile_stats(l); 745 tipc_mon_get_state(l->net, l->addr, mstate, l->bearer_id); 746 if (mstate->reset || (l->silent_intv_cnt > l->abort_limit)) 747 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT); 748 state = bc_acked != bc_snt; 749 state |= l->bc_rcvlink->rcv_unacked; 750 state |= l->rcv_unacked; 751 state |= !skb_queue_empty(&l->transmq); 752 state |= !skb_queue_empty(&l->deferdq); 753 probe = mstate->probing; 754 probe |= l->silent_intv_cnt; 755 if (probe || mstate->monitoring) 756 l->silent_intv_cnt++; 757 break; 758 case LINK_RESET: 759 setup = l->rst_cnt++ <= 4; 760 setup |= !(l->rst_cnt % 16); 761 mtyp = RESET_MSG; 762 break; 763 case LINK_ESTABLISHING: 764 setup = true; 765 mtyp = ACTIVATE_MSG; 766 break; 767 case LINK_PEER_RESET: 768 case LINK_RESETTING: 769 case LINK_FAILINGOVER: 770 break; 771 default: 772 break; 773 } 774 775 if (state || probe || setup) 776 tipc_link_build_proto_msg(l, mtyp, probe, 0, 0, 0, xmitq); 777 778 return rc; 779 } 780 781 /** 782 * link_schedule_user - schedule a message sender for wakeup after congestion 783 * @l: congested link 784 * @hdr: header of message that is being sent 785 * Create pseudo msg to send back to user when congestion abates 786 */ 787 static int link_schedule_user(struct tipc_link *l, struct tipc_msg *hdr) 788 { 789 u32 dnode = tipc_own_addr(l->net); 790 u32 dport = msg_origport(hdr); 791 struct sk_buff *skb; 792 793 /* Create and schedule wakeup pseudo message */ 794 skb = tipc_msg_create(SOCK_WAKEUP, 0, INT_H_SIZE, 0, 795 dnode, l->addr, dport, 0, 0); 796 if (!skb) 797 return -ENOBUFS; 798 msg_set_dest_droppable(buf_msg(skb), true); 799 TIPC_SKB_CB(skb)->chain_imp = msg_importance(hdr); 800 skb_queue_tail(&l->wakeupq, skb); 801 l->stats.link_congs++; 802 return -ELINKCONG; 803 } 804 805 /** 806 * link_prepare_wakeup - prepare users for wakeup after congestion 807 * @l: congested link 808 * Wake up a number of waiting users, as permitted by available space 809 * in the send queue 810 */ 811 void link_prepare_wakeup(struct tipc_link *l) 812 { 813 struct sk_buff *skb, *tmp; 814 int imp, i = 0; 815 816 skb_queue_walk_safe(&l->wakeupq, skb, tmp) { 817 imp = TIPC_SKB_CB(skb)->chain_imp; 818 if (l->backlog[imp].len < l->backlog[imp].limit) { 819 skb_unlink(skb, &l->wakeupq); 820 skb_queue_tail(l->inputq, skb); 821 } else if (i++ > 10) { 822 break; 823 } 824 } 825 } 826 827 void tipc_link_reset(struct tipc_link *l) 828 { 829 l->peer_session = ANY_SESSION; 830 l->session++; 831 l->mtu = l->advertised_mtu; 832 __skb_queue_purge(&l->transmq); 833 __skb_queue_purge(&l->deferdq); 834 skb_queue_splice_init(&l->wakeupq, l->inputq); 835 __skb_queue_purge(&l->backlogq); 836 l->backlog[TIPC_LOW_IMPORTANCE].len = 0; 837 l->backlog[TIPC_MEDIUM_IMPORTANCE].len = 0; 838 l->backlog[TIPC_HIGH_IMPORTANCE].len = 0; 839 l->backlog[TIPC_CRITICAL_IMPORTANCE].len = 0; 840 l->backlog[TIPC_SYSTEM_IMPORTANCE].len = 0; 841 kfree_skb(l->reasm_buf); 842 kfree_skb(l->failover_reasm_skb); 843 l->reasm_buf = NULL; 844 l->failover_reasm_skb = NULL; 845 l->rcv_unacked = 0; 846 l->snd_nxt = 1; 847 l->rcv_nxt = 1; 848 l->acked = 0; 849 l->silent_intv_cnt = 0; 850 l->rst_cnt = 0; 851 l->stale_count = 0; 852 l->bc_peer_is_up = false; 853 memset(&l->mon_state, 0, sizeof(l->mon_state)); 854 tipc_link_reset_stats(l); 855 } 856 857 /** 858 * tipc_link_xmit(): enqueue buffer list according to queue situation 859 * @link: link to use 860 * @list: chain of buffers containing message 861 * @xmitq: returned list of packets to be sent by caller 862 * 863 * Consumes the buffer chain. 864 * Returns 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS 865 * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted 866 */ 867 int tipc_link_xmit(struct tipc_link *l, struct sk_buff_head *list, 868 struct sk_buff_head *xmitq) 869 { 870 struct tipc_msg *hdr = buf_msg(skb_peek(list)); 871 unsigned int maxwin = l->window; 872 int imp = msg_importance(hdr); 873 unsigned int mtu = l->mtu; 874 u16 ack = l->rcv_nxt - 1; 875 u16 seqno = l->snd_nxt; 876 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1; 877 struct sk_buff_head *transmq = &l->transmq; 878 struct sk_buff_head *backlogq = &l->backlogq; 879 struct sk_buff *skb, *_skb, *bskb; 880 int pkt_cnt = skb_queue_len(list); 881 int rc = 0; 882 883 if (unlikely(msg_size(hdr) > mtu)) { 884 skb_queue_purge(list); 885 return -EMSGSIZE; 886 } 887 888 /* Allow oversubscription of one data msg per source at congestion */ 889 if (unlikely(l->backlog[imp].len >= l->backlog[imp].limit)) { 890 if (imp == TIPC_SYSTEM_IMPORTANCE) { 891 pr_warn("%s<%s>, link overflow", link_rst_msg, l->name); 892 return -ENOBUFS; 893 } 894 rc = link_schedule_user(l, hdr); 895 } 896 897 if (pkt_cnt > 1) { 898 l->stats.sent_fragmented++; 899 l->stats.sent_fragments += pkt_cnt; 900 } 901 902 /* Prepare each packet for sending, and add to relevant queue: */ 903 while (skb_queue_len(list)) { 904 skb = skb_peek(list); 905 hdr = buf_msg(skb); 906 msg_set_seqno(hdr, seqno); 907 msg_set_ack(hdr, ack); 908 msg_set_bcast_ack(hdr, bc_ack); 909 910 if (likely(skb_queue_len(transmq) < maxwin)) { 911 _skb = skb_clone(skb, GFP_ATOMIC); 912 if (!_skb) { 913 skb_queue_purge(list); 914 return -ENOBUFS; 915 } 916 __skb_dequeue(list); 917 __skb_queue_tail(transmq, skb); 918 __skb_queue_tail(xmitq, _skb); 919 TIPC_SKB_CB(skb)->ackers = l->ackers; 920 l->rcv_unacked = 0; 921 l->stats.sent_pkts++; 922 seqno++; 923 continue; 924 } 925 if (tipc_msg_bundle(skb_peek_tail(backlogq), hdr, mtu)) { 926 kfree_skb(__skb_dequeue(list)); 927 l->stats.sent_bundled++; 928 continue; 929 } 930 if (tipc_msg_make_bundle(&bskb, hdr, mtu, l->addr)) { 931 kfree_skb(__skb_dequeue(list)); 932 __skb_queue_tail(backlogq, bskb); 933 l->backlog[msg_importance(buf_msg(bskb))].len++; 934 l->stats.sent_bundled++; 935 l->stats.sent_bundles++; 936 continue; 937 } 938 l->backlog[imp].len += skb_queue_len(list); 939 skb_queue_splice_tail_init(list, backlogq); 940 } 941 l->snd_nxt = seqno; 942 return rc; 943 } 944 945 void tipc_link_advance_backlog(struct tipc_link *l, struct sk_buff_head *xmitq) 946 { 947 struct sk_buff *skb, *_skb; 948 struct tipc_msg *hdr; 949 u16 seqno = l->snd_nxt; 950 u16 ack = l->rcv_nxt - 1; 951 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1; 952 953 while (skb_queue_len(&l->transmq) < l->window) { 954 skb = skb_peek(&l->backlogq); 955 if (!skb) 956 break; 957 _skb = skb_clone(skb, GFP_ATOMIC); 958 if (!_skb) 959 break; 960 __skb_dequeue(&l->backlogq); 961 hdr = buf_msg(skb); 962 l->backlog[msg_importance(hdr)].len--; 963 __skb_queue_tail(&l->transmq, skb); 964 __skb_queue_tail(xmitq, _skb); 965 TIPC_SKB_CB(skb)->ackers = l->ackers; 966 msg_set_seqno(hdr, seqno); 967 msg_set_ack(hdr, ack); 968 msg_set_bcast_ack(hdr, bc_ack); 969 l->rcv_unacked = 0; 970 l->stats.sent_pkts++; 971 seqno++; 972 } 973 l->snd_nxt = seqno; 974 } 975 976 static void link_retransmit_failure(struct tipc_link *l, struct sk_buff *skb) 977 { 978 struct tipc_msg *hdr = buf_msg(skb); 979 980 pr_warn("Retransmission failure on link <%s>\n", l->name); 981 link_print(l, "State of link "); 982 pr_info("Failed msg: usr %u, typ %u, len %u, err %u\n", 983 msg_user(hdr), msg_type(hdr), msg_size(hdr), msg_errcode(hdr)); 984 pr_info("sqno %u, prev: %x, src: %x\n", 985 msg_seqno(hdr), msg_prevnode(hdr), msg_orignode(hdr)); 986 } 987 988 int tipc_link_retrans(struct tipc_link *l, struct tipc_link *nacker, 989 u16 from, u16 to, struct sk_buff_head *xmitq) 990 { 991 struct sk_buff *_skb, *skb = skb_peek(&l->transmq); 992 struct tipc_msg *hdr; 993 u16 ack = l->rcv_nxt - 1; 994 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1; 995 996 if (!skb) 997 return 0; 998 999 /* Detect repeated retransmit failures on same packet */ 1000 if (nacker->last_retransm != buf_seqno(skb)) { 1001 nacker->last_retransm = buf_seqno(skb); 1002 nacker->stale_count = 1; 1003 } else if (++nacker->stale_count > 100) { 1004 link_retransmit_failure(l, skb); 1005 nacker->stale_count = 0; 1006 if (link_is_bc_sndlink(l)) 1007 return TIPC_LINK_DOWN_EVT; 1008 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT); 1009 } 1010 1011 /* Move forward to where retransmission should start */ 1012 skb_queue_walk(&l->transmq, skb) { 1013 if (!less(buf_seqno(skb), from)) 1014 break; 1015 } 1016 1017 skb_queue_walk_from(&l->transmq, skb) { 1018 if (more(buf_seqno(skb), to)) 1019 break; 1020 hdr = buf_msg(skb); 1021 _skb = __pskb_copy(skb, MIN_H_SIZE, GFP_ATOMIC); 1022 if (!_skb) 1023 return 0; 1024 hdr = buf_msg(_skb); 1025 msg_set_ack(hdr, ack); 1026 msg_set_bcast_ack(hdr, bc_ack); 1027 _skb->priority = TC_PRIO_CONTROL; 1028 __skb_queue_tail(xmitq, _skb); 1029 l->stats.retransmitted++; 1030 } 1031 return 0; 1032 } 1033 1034 /* tipc_data_input - deliver data and name distr msgs to upper layer 1035 * 1036 * Consumes buffer if message is of right type 1037 * Node lock must be held 1038 */ 1039 static bool tipc_data_input(struct tipc_link *l, struct sk_buff *skb, 1040 struct sk_buff_head *inputq) 1041 { 1042 struct tipc_msg *hdr = buf_msg(skb); 1043 1044 switch (msg_user(hdr)) { 1045 case TIPC_LOW_IMPORTANCE: 1046 case TIPC_MEDIUM_IMPORTANCE: 1047 case TIPC_HIGH_IMPORTANCE: 1048 case TIPC_CRITICAL_IMPORTANCE: 1049 if (unlikely(msg_type(hdr) == TIPC_MCAST_MSG)) { 1050 skb_queue_tail(l->bc_rcvlink->inputq, skb); 1051 return true; 1052 } 1053 case CONN_MANAGER: 1054 skb_queue_tail(inputq, skb); 1055 return true; 1056 case NAME_DISTRIBUTOR: 1057 l->bc_rcvlink->state = LINK_ESTABLISHED; 1058 skb_queue_tail(l->namedq, skb); 1059 return true; 1060 case MSG_BUNDLER: 1061 case TUNNEL_PROTOCOL: 1062 case MSG_FRAGMENTER: 1063 case BCAST_PROTOCOL: 1064 return false; 1065 default: 1066 pr_warn("Dropping received illegal msg type\n"); 1067 kfree_skb(skb); 1068 return false; 1069 }; 1070 } 1071 1072 /* tipc_link_input - process packet that has passed link protocol check 1073 * 1074 * Consumes buffer 1075 */ 1076 static int tipc_link_input(struct tipc_link *l, struct sk_buff *skb, 1077 struct sk_buff_head *inputq) 1078 { 1079 struct tipc_msg *hdr = buf_msg(skb); 1080 struct sk_buff **reasm_skb = &l->reasm_buf; 1081 struct sk_buff *iskb; 1082 struct sk_buff_head tmpq; 1083 int usr = msg_user(hdr); 1084 int rc = 0; 1085 int pos = 0; 1086 int ipos = 0; 1087 1088 if (unlikely(usr == TUNNEL_PROTOCOL)) { 1089 if (msg_type(hdr) == SYNCH_MSG) { 1090 __skb_queue_purge(&l->deferdq); 1091 goto drop; 1092 } 1093 if (!tipc_msg_extract(skb, &iskb, &ipos)) 1094 return rc; 1095 kfree_skb(skb); 1096 skb = iskb; 1097 hdr = buf_msg(skb); 1098 if (less(msg_seqno(hdr), l->drop_point)) 1099 goto drop; 1100 if (tipc_data_input(l, skb, inputq)) 1101 return rc; 1102 usr = msg_user(hdr); 1103 reasm_skb = &l->failover_reasm_skb; 1104 } 1105 1106 if (usr == MSG_BUNDLER) { 1107 skb_queue_head_init(&tmpq); 1108 l->stats.recv_bundles++; 1109 l->stats.recv_bundled += msg_msgcnt(hdr); 1110 while (tipc_msg_extract(skb, &iskb, &pos)) 1111 tipc_data_input(l, iskb, &tmpq); 1112 tipc_skb_queue_splice_tail(&tmpq, inputq); 1113 return 0; 1114 } else if (usr == MSG_FRAGMENTER) { 1115 l->stats.recv_fragments++; 1116 if (tipc_buf_append(reasm_skb, &skb)) { 1117 l->stats.recv_fragmented++; 1118 tipc_data_input(l, skb, inputq); 1119 } else if (!*reasm_skb && !link_is_bc_rcvlink(l)) { 1120 pr_warn_ratelimited("Unable to build fragment list\n"); 1121 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT); 1122 } 1123 return 0; 1124 } else if (usr == BCAST_PROTOCOL) { 1125 tipc_bcast_lock(l->net); 1126 tipc_link_bc_init_rcv(l->bc_rcvlink, hdr); 1127 tipc_bcast_unlock(l->net); 1128 } 1129 drop: 1130 kfree_skb(skb); 1131 return 0; 1132 } 1133 1134 static bool tipc_link_release_pkts(struct tipc_link *l, u16 acked) 1135 { 1136 bool released = false; 1137 struct sk_buff *skb, *tmp; 1138 1139 skb_queue_walk_safe(&l->transmq, skb, tmp) { 1140 if (more(buf_seqno(skb), acked)) 1141 break; 1142 __skb_unlink(skb, &l->transmq); 1143 kfree_skb(skb); 1144 released = true; 1145 } 1146 return released; 1147 } 1148 1149 /* tipc_link_build_state_msg: prepare link state message for transmission 1150 * 1151 * Note that sending of broadcast ack is coordinated among nodes, to reduce 1152 * risk of ack storms towards the sender 1153 */ 1154 int tipc_link_build_state_msg(struct tipc_link *l, struct sk_buff_head *xmitq) 1155 { 1156 if (!l) 1157 return 0; 1158 1159 /* Broadcast ACK must be sent via a unicast link => defer to caller */ 1160 if (link_is_bc_rcvlink(l)) { 1161 if (((l->rcv_nxt ^ tipc_own_addr(l->net)) & 0xf) != 0xf) 1162 return 0; 1163 l->rcv_unacked = 0; 1164 1165 /* Use snd_nxt to store peer's snd_nxt in broadcast rcv link */ 1166 l->snd_nxt = l->rcv_nxt; 1167 return TIPC_LINK_SND_STATE; 1168 } 1169 1170 /* Unicast ACK */ 1171 l->rcv_unacked = 0; 1172 l->stats.sent_acks++; 1173 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, xmitq); 1174 return 0; 1175 } 1176 1177 /* tipc_link_build_reset_msg: prepare link RESET or ACTIVATE message 1178 */ 1179 void tipc_link_build_reset_msg(struct tipc_link *l, struct sk_buff_head *xmitq) 1180 { 1181 int mtyp = RESET_MSG; 1182 struct sk_buff *skb; 1183 1184 if (l->state == LINK_ESTABLISHING) 1185 mtyp = ACTIVATE_MSG; 1186 1187 tipc_link_build_proto_msg(l, mtyp, 0, 0, 0, 0, xmitq); 1188 1189 /* Inform peer that this endpoint is going down if applicable */ 1190 skb = skb_peek_tail(xmitq); 1191 if (skb && (l->state == LINK_RESET)) 1192 msg_set_peer_stopping(buf_msg(skb), 1); 1193 } 1194 1195 /* tipc_link_build_nack_msg: prepare link nack message for transmission 1196 * Note that sending of broadcast NACK is coordinated among nodes, to 1197 * reduce the risk of NACK storms towards the sender 1198 */ 1199 static int tipc_link_build_nack_msg(struct tipc_link *l, 1200 struct sk_buff_head *xmitq) 1201 { 1202 u32 def_cnt = ++l->stats.deferred_recv; 1203 int match1, match2; 1204 1205 if (link_is_bc_rcvlink(l)) { 1206 match1 = def_cnt & 0xf; 1207 match2 = tipc_own_addr(l->net) & 0xf; 1208 if (match1 == match2) 1209 return TIPC_LINK_SND_STATE; 1210 return 0; 1211 } 1212 1213 if ((skb_queue_len(&l->deferdq) == 1) || !(def_cnt % TIPC_NACK_INTV)) 1214 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, xmitq); 1215 return 0; 1216 } 1217 1218 /* tipc_link_rcv - process TIPC packets/messages arriving from off-node 1219 * @l: the link that should handle the message 1220 * @skb: TIPC packet 1221 * @xmitq: queue to place packets to be sent after this call 1222 */ 1223 int tipc_link_rcv(struct tipc_link *l, struct sk_buff *skb, 1224 struct sk_buff_head *xmitq) 1225 { 1226 struct sk_buff_head *defq = &l->deferdq; 1227 struct tipc_msg *hdr; 1228 u16 seqno, rcv_nxt, win_lim; 1229 int rc = 0; 1230 1231 do { 1232 hdr = buf_msg(skb); 1233 seqno = msg_seqno(hdr); 1234 rcv_nxt = l->rcv_nxt; 1235 win_lim = rcv_nxt + TIPC_MAX_LINK_WIN; 1236 1237 /* Verify and update link state */ 1238 if (unlikely(msg_user(hdr) == LINK_PROTOCOL)) 1239 return tipc_link_proto_rcv(l, skb, xmitq); 1240 1241 if (unlikely(!link_is_up(l))) { 1242 if (l->state == LINK_ESTABLISHING) 1243 rc = TIPC_LINK_UP_EVT; 1244 goto drop; 1245 } 1246 1247 /* Don't send probe at next timeout expiration */ 1248 l->silent_intv_cnt = 0; 1249 1250 /* Drop if outside receive window */ 1251 if (unlikely(less(seqno, rcv_nxt) || more(seqno, win_lim))) { 1252 l->stats.duplicates++; 1253 goto drop; 1254 } 1255 1256 /* Forward queues and wake up waiting users */ 1257 if (likely(tipc_link_release_pkts(l, msg_ack(hdr)))) { 1258 tipc_link_advance_backlog(l, xmitq); 1259 if (unlikely(!skb_queue_empty(&l->wakeupq))) 1260 link_prepare_wakeup(l); 1261 } 1262 1263 /* Defer delivery if sequence gap */ 1264 if (unlikely(seqno != rcv_nxt)) { 1265 __tipc_skb_queue_sorted(defq, seqno, skb); 1266 rc |= tipc_link_build_nack_msg(l, xmitq); 1267 break; 1268 } 1269 1270 /* Deliver packet */ 1271 l->rcv_nxt++; 1272 l->stats.recv_pkts++; 1273 if (!tipc_data_input(l, skb, l->inputq)) 1274 rc |= tipc_link_input(l, skb, l->inputq); 1275 if (unlikely(++l->rcv_unacked >= TIPC_MIN_LINK_WIN)) 1276 rc |= tipc_link_build_state_msg(l, xmitq); 1277 if (unlikely(rc & ~TIPC_LINK_SND_STATE)) 1278 break; 1279 } while ((skb = __skb_dequeue(defq))); 1280 1281 return rc; 1282 drop: 1283 kfree_skb(skb); 1284 return rc; 1285 } 1286 1287 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe, 1288 u16 rcvgap, int tolerance, int priority, 1289 struct sk_buff_head *xmitq) 1290 { 1291 struct tipc_link *bcl = l->bc_rcvlink; 1292 struct sk_buff *skb; 1293 struct tipc_msg *hdr; 1294 struct sk_buff_head *dfq = &l->deferdq; 1295 bool node_up = link_is_up(bcl); 1296 struct tipc_mon_state *mstate = &l->mon_state; 1297 int dlen = 0; 1298 void *data; 1299 1300 /* Don't send protocol message during reset or link failover */ 1301 if (tipc_link_is_blocked(l)) 1302 return; 1303 1304 if (!tipc_link_is_up(l) && (mtyp == STATE_MSG)) 1305 return; 1306 1307 if (!skb_queue_empty(dfq)) 1308 rcvgap = buf_seqno(skb_peek(dfq)) - l->rcv_nxt; 1309 1310 skb = tipc_msg_create(LINK_PROTOCOL, mtyp, INT_H_SIZE, 1311 tipc_max_domain_size, l->addr, 1312 tipc_own_addr(l->net), 0, 0, 0); 1313 if (!skb) 1314 return; 1315 1316 hdr = buf_msg(skb); 1317 data = msg_data(hdr); 1318 msg_set_session(hdr, l->session); 1319 msg_set_bearer_id(hdr, l->bearer_id); 1320 msg_set_net_plane(hdr, l->net_plane); 1321 msg_set_next_sent(hdr, l->snd_nxt); 1322 msg_set_ack(hdr, l->rcv_nxt - 1); 1323 msg_set_bcast_ack(hdr, bcl->rcv_nxt - 1); 1324 msg_set_bc_ack_invalid(hdr, !node_up); 1325 msg_set_last_bcast(hdr, l->bc_sndlink->snd_nxt - 1); 1326 msg_set_link_tolerance(hdr, tolerance); 1327 msg_set_linkprio(hdr, priority); 1328 msg_set_redundant_link(hdr, node_up); 1329 msg_set_seq_gap(hdr, 0); 1330 msg_set_seqno(hdr, l->snd_nxt + U16_MAX / 2); 1331 1332 if (mtyp == STATE_MSG) { 1333 msg_set_seq_gap(hdr, rcvgap); 1334 msg_set_bc_gap(hdr, link_bc_rcv_gap(bcl)); 1335 msg_set_probe(hdr, probe); 1336 tipc_mon_prep(l->net, data, &dlen, mstate, l->bearer_id); 1337 msg_set_size(hdr, INT_H_SIZE + dlen); 1338 skb_trim(skb, INT_H_SIZE + dlen); 1339 l->stats.sent_states++; 1340 l->rcv_unacked = 0; 1341 } else { 1342 /* RESET_MSG or ACTIVATE_MSG */ 1343 msg_set_max_pkt(hdr, l->advertised_mtu); 1344 strcpy(data, l->if_name); 1345 msg_set_size(hdr, INT_H_SIZE + TIPC_MAX_IF_NAME); 1346 skb_trim(skb, INT_H_SIZE + TIPC_MAX_IF_NAME); 1347 } 1348 if (probe) 1349 l->stats.sent_probes++; 1350 if (rcvgap) 1351 l->stats.sent_nacks++; 1352 skb->priority = TC_PRIO_CONTROL; 1353 __skb_queue_tail(xmitq, skb); 1354 } 1355 1356 /* tipc_link_tnl_prepare(): prepare and return a list of tunnel packets 1357 * with contents of the link's transmit and backlog queues. 1358 */ 1359 void tipc_link_tnl_prepare(struct tipc_link *l, struct tipc_link *tnl, 1360 int mtyp, struct sk_buff_head *xmitq) 1361 { 1362 struct sk_buff *skb, *tnlskb; 1363 struct tipc_msg *hdr, tnlhdr; 1364 struct sk_buff_head *queue = &l->transmq; 1365 struct sk_buff_head tmpxq, tnlq; 1366 u16 pktlen, pktcnt, seqno = l->snd_nxt; 1367 1368 if (!tnl) 1369 return; 1370 1371 skb_queue_head_init(&tnlq); 1372 skb_queue_head_init(&tmpxq); 1373 1374 /* At least one packet required for safe algorithm => add dummy */ 1375 skb = tipc_msg_create(TIPC_LOW_IMPORTANCE, TIPC_DIRECT_MSG, 1376 BASIC_H_SIZE, 0, l->addr, tipc_own_addr(l->net), 1377 0, 0, TIPC_ERR_NO_PORT); 1378 if (!skb) { 1379 pr_warn("%sunable to create tunnel packet\n", link_co_err); 1380 return; 1381 } 1382 skb_queue_tail(&tnlq, skb); 1383 tipc_link_xmit(l, &tnlq, &tmpxq); 1384 __skb_queue_purge(&tmpxq); 1385 1386 /* Initialize reusable tunnel packet header */ 1387 tipc_msg_init(tipc_own_addr(l->net), &tnlhdr, TUNNEL_PROTOCOL, 1388 mtyp, INT_H_SIZE, l->addr); 1389 pktcnt = skb_queue_len(&l->transmq) + skb_queue_len(&l->backlogq); 1390 msg_set_msgcnt(&tnlhdr, pktcnt); 1391 msg_set_bearer_id(&tnlhdr, l->peer_bearer_id); 1392 tnl: 1393 /* Wrap each packet into a tunnel packet */ 1394 skb_queue_walk(queue, skb) { 1395 hdr = buf_msg(skb); 1396 if (queue == &l->backlogq) 1397 msg_set_seqno(hdr, seqno++); 1398 pktlen = msg_size(hdr); 1399 msg_set_size(&tnlhdr, pktlen + INT_H_SIZE); 1400 tnlskb = tipc_buf_acquire(pktlen + INT_H_SIZE, GFP_ATOMIC); 1401 if (!tnlskb) { 1402 pr_warn("%sunable to send packet\n", link_co_err); 1403 return; 1404 } 1405 skb_copy_to_linear_data(tnlskb, &tnlhdr, INT_H_SIZE); 1406 skb_copy_to_linear_data_offset(tnlskb, INT_H_SIZE, hdr, pktlen); 1407 __skb_queue_tail(&tnlq, tnlskb); 1408 } 1409 if (queue != &l->backlogq) { 1410 queue = &l->backlogq; 1411 goto tnl; 1412 } 1413 1414 tipc_link_xmit(tnl, &tnlq, xmitq); 1415 1416 if (mtyp == FAILOVER_MSG) { 1417 tnl->drop_point = l->rcv_nxt; 1418 tnl->failover_reasm_skb = l->reasm_buf; 1419 l->reasm_buf = NULL; 1420 } 1421 } 1422 1423 /* tipc_link_proto_rcv(): receive link level protocol message : 1424 * Note that network plane id propagates through the network, and may 1425 * change at any time. The node with lowest numerical id determines 1426 * network plane 1427 */ 1428 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb, 1429 struct sk_buff_head *xmitq) 1430 { 1431 struct tipc_msg *hdr = buf_msg(skb); 1432 u16 rcvgap = 0; 1433 u16 ack = msg_ack(hdr); 1434 u16 gap = msg_seq_gap(hdr); 1435 u16 peers_snd_nxt = msg_next_sent(hdr); 1436 u16 peers_tol = msg_link_tolerance(hdr); 1437 u16 peers_prio = msg_linkprio(hdr); 1438 u16 rcv_nxt = l->rcv_nxt; 1439 u16 dlen = msg_data_sz(hdr); 1440 int mtyp = msg_type(hdr); 1441 void *data; 1442 char *if_name; 1443 int rc = 0; 1444 1445 if (tipc_link_is_blocked(l) || !xmitq) 1446 goto exit; 1447 1448 if (tipc_own_addr(l->net) > msg_prevnode(hdr)) 1449 l->net_plane = msg_net_plane(hdr); 1450 1451 skb_linearize(skb); 1452 hdr = buf_msg(skb); 1453 data = msg_data(hdr); 1454 1455 switch (mtyp) { 1456 case RESET_MSG: 1457 1458 /* Ignore duplicate RESET with old session number */ 1459 if ((less_eq(msg_session(hdr), l->peer_session)) && 1460 (l->peer_session != ANY_SESSION)) 1461 break; 1462 /* fall thru' */ 1463 1464 case ACTIVATE_MSG: 1465 1466 /* Complete own link name with peer's interface name */ 1467 if_name = strrchr(l->name, ':') + 1; 1468 if (sizeof(l->name) - (if_name - l->name) <= TIPC_MAX_IF_NAME) 1469 break; 1470 if (msg_data_sz(hdr) < TIPC_MAX_IF_NAME) 1471 break; 1472 strncpy(if_name, data, TIPC_MAX_IF_NAME); 1473 1474 /* Update own tolerance if peer indicates a non-zero value */ 1475 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL)) 1476 l->tolerance = peers_tol; 1477 1478 /* Update own priority if peer's priority is higher */ 1479 if (in_range(peers_prio, l->priority + 1, TIPC_MAX_LINK_PRI)) 1480 l->priority = peers_prio; 1481 1482 /* ACTIVATE_MSG serves as PEER_RESET if link is already down */ 1483 if (msg_peer_stopping(hdr)) 1484 rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT); 1485 else if ((mtyp == RESET_MSG) || !link_is_up(l)) 1486 rc = tipc_link_fsm_evt(l, LINK_PEER_RESET_EVT); 1487 1488 /* ACTIVATE_MSG takes up link if it was already locally reset */ 1489 if ((mtyp == ACTIVATE_MSG) && (l->state == LINK_ESTABLISHING)) 1490 rc = TIPC_LINK_UP_EVT; 1491 1492 l->peer_session = msg_session(hdr); 1493 l->peer_bearer_id = msg_bearer_id(hdr); 1494 if (l->mtu > msg_max_pkt(hdr)) 1495 l->mtu = msg_max_pkt(hdr); 1496 break; 1497 1498 case STATE_MSG: 1499 1500 /* Update own tolerance if peer indicates a non-zero value */ 1501 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL)) 1502 l->tolerance = peers_tol; 1503 1504 /* Update own prio if peer indicates a different value */ 1505 if ((peers_prio != l->priority) && 1506 in_range(peers_prio, 1, TIPC_MAX_LINK_PRI)) { 1507 l->priority = peers_prio; 1508 rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT); 1509 } 1510 1511 l->silent_intv_cnt = 0; 1512 l->stats.recv_states++; 1513 if (msg_probe(hdr)) 1514 l->stats.recv_probes++; 1515 1516 if (!link_is_up(l)) { 1517 if (l->state == LINK_ESTABLISHING) 1518 rc = TIPC_LINK_UP_EVT; 1519 break; 1520 } 1521 tipc_mon_rcv(l->net, data, dlen, l->addr, 1522 &l->mon_state, l->bearer_id); 1523 1524 /* Send NACK if peer has sent pkts we haven't received yet */ 1525 if (more(peers_snd_nxt, rcv_nxt) && !tipc_link_is_synching(l)) 1526 rcvgap = peers_snd_nxt - l->rcv_nxt; 1527 if (rcvgap || (msg_probe(hdr))) 1528 tipc_link_build_proto_msg(l, STATE_MSG, 0, rcvgap, 1529 0, 0, xmitq); 1530 tipc_link_release_pkts(l, ack); 1531 1532 /* If NACK, retransmit will now start at right position */ 1533 if (gap) { 1534 rc = tipc_link_retrans(l, l, ack + 1, ack + gap, xmitq); 1535 l->stats.recv_nacks++; 1536 } 1537 1538 tipc_link_advance_backlog(l, xmitq); 1539 if (unlikely(!skb_queue_empty(&l->wakeupq))) 1540 link_prepare_wakeup(l); 1541 } 1542 exit: 1543 kfree_skb(skb); 1544 return rc; 1545 } 1546 1547 /* tipc_link_build_bc_proto_msg() - create broadcast protocol message 1548 */ 1549 static bool tipc_link_build_bc_proto_msg(struct tipc_link *l, bool bcast, 1550 u16 peers_snd_nxt, 1551 struct sk_buff_head *xmitq) 1552 { 1553 struct sk_buff *skb; 1554 struct tipc_msg *hdr; 1555 struct sk_buff *dfrd_skb = skb_peek(&l->deferdq); 1556 u16 ack = l->rcv_nxt - 1; 1557 u16 gap_to = peers_snd_nxt - 1; 1558 1559 skb = tipc_msg_create(BCAST_PROTOCOL, STATE_MSG, INT_H_SIZE, 1560 0, l->addr, tipc_own_addr(l->net), 0, 0, 0); 1561 if (!skb) 1562 return false; 1563 hdr = buf_msg(skb); 1564 msg_set_last_bcast(hdr, l->bc_sndlink->snd_nxt - 1); 1565 msg_set_bcast_ack(hdr, ack); 1566 msg_set_bcgap_after(hdr, ack); 1567 if (dfrd_skb) 1568 gap_to = buf_seqno(dfrd_skb) - 1; 1569 msg_set_bcgap_to(hdr, gap_to); 1570 msg_set_non_seq(hdr, bcast); 1571 __skb_queue_tail(xmitq, skb); 1572 return true; 1573 } 1574 1575 /* tipc_link_build_bc_init_msg() - synchronize broadcast link endpoints. 1576 * 1577 * Give a newly added peer node the sequence number where it should 1578 * start receiving and acking broadcast packets. 1579 */ 1580 static void tipc_link_build_bc_init_msg(struct tipc_link *l, 1581 struct sk_buff_head *xmitq) 1582 { 1583 struct sk_buff_head list; 1584 1585 __skb_queue_head_init(&list); 1586 if (!tipc_link_build_bc_proto_msg(l->bc_rcvlink, false, 0, &list)) 1587 return; 1588 msg_set_bc_ack_invalid(buf_msg(skb_peek(&list)), true); 1589 tipc_link_xmit(l, &list, xmitq); 1590 } 1591 1592 /* tipc_link_bc_init_rcv - receive initial broadcast synch data from peer 1593 */ 1594 void tipc_link_bc_init_rcv(struct tipc_link *l, struct tipc_msg *hdr) 1595 { 1596 int mtyp = msg_type(hdr); 1597 u16 peers_snd_nxt = msg_bc_snd_nxt(hdr); 1598 1599 if (link_is_up(l)) 1600 return; 1601 1602 if (msg_user(hdr) == BCAST_PROTOCOL) { 1603 l->rcv_nxt = peers_snd_nxt; 1604 l->state = LINK_ESTABLISHED; 1605 return; 1606 } 1607 1608 if (l->peer_caps & TIPC_BCAST_SYNCH) 1609 return; 1610 1611 if (msg_peer_node_is_up(hdr)) 1612 return; 1613 1614 /* Compatibility: accept older, less safe initial synch data */ 1615 if ((mtyp == RESET_MSG) || (mtyp == ACTIVATE_MSG)) 1616 l->rcv_nxt = peers_snd_nxt; 1617 } 1618 1619 /* link_bc_retr eval()- check if the indicated range can be retransmitted now 1620 * - Adjust permitted range if there is overlap with previous retransmission 1621 */ 1622 static bool link_bc_retr_eval(struct tipc_link *l, u16 *from, u16 *to) 1623 { 1624 unsigned long elapsed = jiffies_to_msecs(jiffies - l->prev_retr); 1625 1626 if (less(*to, *from)) 1627 return false; 1628 1629 /* New retransmission request */ 1630 if ((elapsed > TIPC_BC_RETR_LIMIT) || 1631 less(*to, l->prev_from) || more(*from, l->prev_to)) { 1632 l->prev_from = *from; 1633 l->prev_to = *to; 1634 l->prev_retr = jiffies; 1635 return true; 1636 } 1637 1638 /* Inside range of previous retransmit */ 1639 if (!less(*from, l->prev_from) && !more(*to, l->prev_to)) 1640 return false; 1641 1642 /* Fully or partially outside previous range => exclude overlap */ 1643 if (less(*from, l->prev_from)) { 1644 *to = l->prev_from - 1; 1645 l->prev_from = *from; 1646 } 1647 if (more(*to, l->prev_to)) { 1648 *from = l->prev_to + 1; 1649 l->prev_to = *to; 1650 } 1651 l->prev_retr = jiffies; 1652 return true; 1653 } 1654 1655 /* tipc_link_bc_sync_rcv - update rcv link according to peer's send state 1656 */ 1657 int tipc_link_bc_sync_rcv(struct tipc_link *l, struct tipc_msg *hdr, 1658 struct sk_buff_head *xmitq) 1659 { 1660 struct tipc_link *snd_l = l->bc_sndlink; 1661 u16 peers_snd_nxt = msg_bc_snd_nxt(hdr); 1662 u16 from = msg_bcast_ack(hdr) + 1; 1663 u16 to = from + msg_bc_gap(hdr) - 1; 1664 int rc = 0; 1665 1666 if (!link_is_up(l)) 1667 return rc; 1668 1669 if (!msg_peer_node_is_up(hdr)) 1670 return rc; 1671 1672 /* Open when peer ackowledges our bcast init msg (pkt #1) */ 1673 if (msg_ack(hdr)) 1674 l->bc_peer_is_up = true; 1675 1676 if (!l->bc_peer_is_up) 1677 return rc; 1678 1679 l->stats.recv_nacks++; 1680 1681 /* Ignore if peers_snd_nxt goes beyond receive window */ 1682 if (more(peers_snd_nxt, l->rcv_nxt + l->window)) 1683 return rc; 1684 1685 if (link_bc_retr_eval(snd_l, &from, &to)) 1686 rc = tipc_link_retrans(snd_l, l, from, to, xmitq); 1687 1688 l->snd_nxt = peers_snd_nxt; 1689 if (link_bc_rcv_gap(l)) 1690 rc |= TIPC_LINK_SND_STATE; 1691 1692 /* Return now if sender supports nack via STATE messages */ 1693 if (l->peer_caps & TIPC_BCAST_STATE_NACK) 1694 return rc; 1695 1696 /* Otherwise, be backwards compatible */ 1697 1698 if (!more(peers_snd_nxt, l->rcv_nxt)) { 1699 l->nack_state = BC_NACK_SND_CONDITIONAL; 1700 return 0; 1701 } 1702 1703 /* Don't NACK if one was recently sent or peeked */ 1704 if (l->nack_state == BC_NACK_SND_SUPPRESS) { 1705 l->nack_state = BC_NACK_SND_UNCONDITIONAL; 1706 return 0; 1707 } 1708 1709 /* Conditionally delay NACK sending until next synch rcv */ 1710 if (l->nack_state == BC_NACK_SND_CONDITIONAL) { 1711 l->nack_state = BC_NACK_SND_UNCONDITIONAL; 1712 if ((peers_snd_nxt - l->rcv_nxt) < TIPC_MIN_LINK_WIN) 1713 return 0; 1714 } 1715 1716 /* Send NACK now but suppress next one */ 1717 tipc_link_build_bc_proto_msg(l, true, peers_snd_nxt, xmitq); 1718 l->nack_state = BC_NACK_SND_SUPPRESS; 1719 return 0; 1720 } 1721 1722 void tipc_link_bc_ack_rcv(struct tipc_link *l, u16 acked, 1723 struct sk_buff_head *xmitq) 1724 { 1725 struct sk_buff *skb, *tmp; 1726 struct tipc_link *snd_l = l->bc_sndlink; 1727 1728 if (!link_is_up(l) || !l->bc_peer_is_up) 1729 return; 1730 1731 if (!more(acked, l->acked)) 1732 return; 1733 1734 /* Skip over packets peer has already acked */ 1735 skb_queue_walk(&snd_l->transmq, skb) { 1736 if (more(buf_seqno(skb), l->acked)) 1737 break; 1738 } 1739 1740 /* Update/release the packets peer is acking now */ 1741 skb_queue_walk_from_safe(&snd_l->transmq, skb, tmp) { 1742 if (more(buf_seqno(skb), acked)) 1743 break; 1744 if (!--TIPC_SKB_CB(skb)->ackers) { 1745 __skb_unlink(skb, &snd_l->transmq); 1746 kfree_skb(skb); 1747 } 1748 } 1749 l->acked = acked; 1750 tipc_link_advance_backlog(snd_l, xmitq); 1751 if (unlikely(!skb_queue_empty(&snd_l->wakeupq))) 1752 link_prepare_wakeup(snd_l); 1753 } 1754 1755 /* tipc_link_bc_nack_rcv(): receive broadcast nack message 1756 * This function is here for backwards compatibility, since 1757 * no BCAST_PROTOCOL/STATE messages occur from TIPC v2.5. 1758 */ 1759 int tipc_link_bc_nack_rcv(struct tipc_link *l, struct sk_buff *skb, 1760 struct sk_buff_head *xmitq) 1761 { 1762 struct tipc_msg *hdr = buf_msg(skb); 1763 u32 dnode = msg_destnode(hdr); 1764 int mtyp = msg_type(hdr); 1765 u16 acked = msg_bcast_ack(hdr); 1766 u16 from = acked + 1; 1767 u16 to = msg_bcgap_to(hdr); 1768 u16 peers_snd_nxt = to + 1; 1769 int rc = 0; 1770 1771 kfree_skb(skb); 1772 1773 if (!tipc_link_is_up(l) || !l->bc_peer_is_up) 1774 return 0; 1775 1776 if (mtyp != STATE_MSG) 1777 return 0; 1778 1779 if (dnode == tipc_own_addr(l->net)) { 1780 tipc_link_bc_ack_rcv(l, acked, xmitq); 1781 rc = tipc_link_retrans(l->bc_sndlink, l, from, to, xmitq); 1782 l->stats.recv_nacks++; 1783 return rc; 1784 } 1785 1786 /* Msg for other node => suppress own NACK at next sync if applicable */ 1787 if (more(peers_snd_nxt, l->rcv_nxt) && !less(l->rcv_nxt, from)) 1788 l->nack_state = BC_NACK_SND_SUPPRESS; 1789 1790 return 0; 1791 } 1792 1793 void tipc_link_set_queue_limits(struct tipc_link *l, u32 win) 1794 { 1795 int max_bulk = TIPC_MAX_PUBLICATIONS / (l->mtu / ITEM_SIZE); 1796 1797 l->window = win; 1798 l->backlog[TIPC_LOW_IMPORTANCE].limit = max_t(u16, 50, win); 1799 l->backlog[TIPC_MEDIUM_IMPORTANCE].limit = max_t(u16, 100, win * 2); 1800 l->backlog[TIPC_HIGH_IMPORTANCE].limit = max_t(u16, 150, win * 3); 1801 l->backlog[TIPC_CRITICAL_IMPORTANCE].limit = max_t(u16, 200, win * 4); 1802 l->backlog[TIPC_SYSTEM_IMPORTANCE].limit = max_bulk; 1803 } 1804 1805 /** 1806 * link_reset_stats - reset link statistics 1807 * @l: pointer to link 1808 */ 1809 void tipc_link_reset_stats(struct tipc_link *l) 1810 { 1811 memset(&l->stats, 0, sizeof(l->stats)); 1812 } 1813 1814 static void link_print(struct tipc_link *l, const char *str) 1815 { 1816 struct sk_buff *hskb = skb_peek(&l->transmq); 1817 u16 head = hskb ? msg_seqno(buf_msg(hskb)) : l->snd_nxt - 1; 1818 u16 tail = l->snd_nxt - 1; 1819 1820 pr_info("%s Link <%s> state %x\n", str, l->name, l->state); 1821 pr_info("XMTQ: %u [%u-%u], BKLGQ: %u, SNDNX: %u, RCVNX: %u\n", 1822 skb_queue_len(&l->transmq), head, tail, 1823 skb_queue_len(&l->backlogq), l->snd_nxt, l->rcv_nxt); 1824 } 1825 1826 /* Parse and validate nested (link) properties valid for media, bearer and link 1827 */ 1828 int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[]) 1829 { 1830 int err; 1831 1832 err = nla_parse_nested(props, TIPC_NLA_PROP_MAX, prop, 1833 tipc_nl_prop_policy, NULL); 1834 if (err) 1835 return err; 1836 1837 if (props[TIPC_NLA_PROP_PRIO]) { 1838 u32 prio; 1839 1840 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]); 1841 if (prio > TIPC_MAX_LINK_PRI) 1842 return -EINVAL; 1843 } 1844 1845 if (props[TIPC_NLA_PROP_TOL]) { 1846 u32 tol; 1847 1848 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]); 1849 if ((tol < TIPC_MIN_LINK_TOL) || (tol > TIPC_MAX_LINK_TOL)) 1850 return -EINVAL; 1851 } 1852 1853 if (props[TIPC_NLA_PROP_WIN]) { 1854 u32 win; 1855 1856 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]); 1857 if ((win < TIPC_MIN_LINK_WIN) || (win > TIPC_MAX_LINK_WIN)) 1858 return -EINVAL; 1859 } 1860 1861 return 0; 1862 } 1863 1864 static int __tipc_nl_add_stats(struct sk_buff *skb, struct tipc_stats *s) 1865 { 1866 int i; 1867 struct nlattr *stats; 1868 1869 struct nla_map { 1870 u32 key; 1871 u32 val; 1872 }; 1873 1874 struct nla_map map[] = { 1875 {TIPC_NLA_STATS_RX_INFO, 0}, 1876 {TIPC_NLA_STATS_RX_FRAGMENTS, s->recv_fragments}, 1877 {TIPC_NLA_STATS_RX_FRAGMENTED, s->recv_fragmented}, 1878 {TIPC_NLA_STATS_RX_BUNDLES, s->recv_bundles}, 1879 {TIPC_NLA_STATS_RX_BUNDLED, s->recv_bundled}, 1880 {TIPC_NLA_STATS_TX_INFO, 0}, 1881 {TIPC_NLA_STATS_TX_FRAGMENTS, s->sent_fragments}, 1882 {TIPC_NLA_STATS_TX_FRAGMENTED, s->sent_fragmented}, 1883 {TIPC_NLA_STATS_TX_BUNDLES, s->sent_bundles}, 1884 {TIPC_NLA_STATS_TX_BUNDLED, s->sent_bundled}, 1885 {TIPC_NLA_STATS_MSG_PROF_TOT, (s->msg_length_counts) ? 1886 s->msg_length_counts : 1}, 1887 {TIPC_NLA_STATS_MSG_LEN_CNT, s->msg_length_counts}, 1888 {TIPC_NLA_STATS_MSG_LEN_TOT, s->msg_lengths_total}, 1889 {TIPC_NLA_STATS_MSG_LEN_P0, s->msg_length_profile[0]}, 1890 {TIPC_NLA_STATS_MSG_LEN_P1, s->msg_length_profile[1]}, 1891 {TIPC_NLA_STATS_MSG_LEN_P2, s->msg_length_profile[2]}, 1892 {TIPC_NLA_STATS_MSG_LEN_P3, s->msg_length_profile[3]}, 1893 {TIPC_NLA_STATS_MSG_LEN_P4, s->msg_length_profile[4]}, 1894 {TIPC_NLA_STATS_MSG_LEN_P5, s->msg_length_profile[5]}, 1895 {TIPC_NLA_STATS_MSG_LEN_P6, s->msg_length_profile[6]}, 1896 {TIPC_NLA_STATS_RX_STATES, s->recv_states}, 1897 {TIPC_NLA_STATS_RX_PROBES, s->recv_probes}, 1898 {TIPC_NLA_STATS_RX_NACKS, s->recv_nacks}, 1899 {TIPC_NLA_STATS_RX_DEFERRED, s->deferred_recv}, 1900 {TIPC_NLA_STATS_TX_STATES, s->sent_states}, 1901 {TIPC_NLA_STATS_TX_PROBES, s->sent_probes}, 1902 {TIPC_NLA_STATS_TX_NACKS, s->sent_nacks}, 1903 {TIPC_NLA_STATS_TX_ACKS, s->sent_acks}, 1904 {TIPC_NLA_STATS_RETRANSMITTED, s->retransmitted}, 1905 {TIPC_NLA_STATS_DUPLICATES, s->duplicates}, 1906 {TIPC_NLA_STATS_LINK_CONGS, s->link_congs}, 1907 {TIPC_NLA_STATS_MAX_QUEUE, s->max_queue_sz}, 1908 {TIPC_NLA_STATS_AVG_QUEUE, s->queue_sz_counts ? 1909 (s->accu_queue_sz / s->queue_sz_counts) : 0} 1910 }; 1911 1912 stats = nla_nest_start(skb, TIPC_NLA_LINK_STATS); 1913 if (!stats) 1914 return -EMSGSIZE; 1915 1916 for (i = 0; i < ARRAY_SIZE(map); i++) 1917 if (nla_put_u32(skb, map[i].key, map[i].val)) 1918 goto msg_full; 1919 1920 nla_nest_end(skb, stats); 1921 1922 return 0; 1923 msg_full: 1924 nla_nest_cancel(skb, stats); 1925 1926 return -EMSGSIZE; 1927 } 1928 1929 /* Caller should hold appropriate locks to protect the link */ 1930 int __tipc_nl_add_link(struct net *net, struct tipc_nl_msg *msg, 1931 struct tipc_link *link, int nlflags) 1932 { 1933 int err; 1934 void *hdr; 1935 struct nlattr *attrs; 1936 struct nlattr *prop; 1937 struct tipc_net *tn = net_generic(net, tipc_net_id); 1938 1939 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family, 1940 nlflags, TIPC_NL_LINK_GET); 1941 if (!hdr) 1942 return -EMSGSIZE; 1943 1944 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK); 1945 if (!attrs) 1946 goto msg_full; 1947 1948 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, link->name)) 1949 goto attr_msg_full; 1950 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_DEST, 1951 tipc_cluster_mask(tn->own_addr))) 1952 goto attr_msg_full; 1953 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_MTU, link->mtu)) 1954 goto attr_msg_full; 1955 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, link->stats.recv_pkts)) 1956 goto attr_msg_full; 1957 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, link->stats.sent_pkts)) 1958 goto attr_msg_full; 1959 1960 if (tipc_link_is_up(link)) 1961 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP)) 1962 goto attr_msg_full; 1963 if (link->active) 1964 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_ACTIVE)) 1965 goto attr_msg_full; 1966 1967 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP); 1968 if (!prop) 1969 goto attr_msg_full; 1970 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority)) 1971 goto prop_msg_full; 1972 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_TOL, link->tolerance)) 1973 goto prop_msg_full; 1974 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, 1975 link->window)) 1976 goto prop_msg_full; 1977 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority)) 1978 goto prop_msg_full; 1979 nla_nest_end(msg->skb, prop); 1980 1981 err = __tipc_nl_add_stats(msg->skb, &link->stats); 1982 if (err) 1983 goto attr_msg_full; 1984 1985 nla_nest_end(msg->skb, attrs); 1986 genlmsg_end(msg->skb, hdr); 1987 1988 return 0; 1989 1990 prop_msg_full: 1991 nla_nest_cancel(msg->skb, prop); 1992 attr_msg_full: 1993 nla_nest_cancel(msg->skb, attrs); 1994 msg_full: 1995 genlmsg_cancel(msg->skb, hdr); 1996 1997 return -EMSGSIZE; 1998 } 1999 2000 static int __tipc_nl_add_bc_link_stat(struct sk_buff *skb, 2001 struct tipc_stats *stats) 2002 { 2003 int i; 2004 struct nlattr *nest; 2005 2006 struct nla_map { 2007 __u32 key; 2008 __u32 val; 2009 }; 2010 2011 struct nla_map map[] = { 2012 {TIPC_NLA_STATS_RX_INFO, stats->recv_pkts}, 2013 {TIPC_NLA_STATS_RX_FRAGMENTS, stats->recv_fragments}, 2014 {TIPC_NLA_STATS_RX_FRAGMENTED, stats->recv_fragmented}, 2015 {TIPC_NLA_STATS_RX_BUNDLES, stats->recv_bundles}, 2016 {TIPC_NLA_STATS_RX_BUNDLED, stats->recv_bundled}, 2017 {TIPC_NLA_STATS_TX_INFO, stats->sent_pkts}, 2018 {TIPC_NLA_STATS_TX_FRAGMENTS, stats->sent_fragments}, 2019 {TIPC_NLA_STATS_TX_FRAGMENTED, stats->sent_fragmented}, 2020 {TIPC_NLA_STATS_TX_BUNDLES, stats->sent_bundles}, 2021 {TIPC_NLA_STATS_TX_BUNDLED, stats->sent_bundled}, 2022 {TIPC_NLA_STATS_RX_NACKS, stats->recv_nacks}, 2023 {TIPC_NLA_STATS_RX_DEFERRED, stats->deferred_recv}, 2024 {TIPC_NLA_STATS_TX_NACKS, stats->sent_nacks}, 2025 {TIPC_NLA_STATS_TX_ACKS, stats->sent_acks}, 2026 {TIPC_NLA_STATS_RETRANSMITTED, stats->retransmitted}, 2027 {TIPC_NLA_STATS_DUPLICATES, stats->duplicates}, 2028 {TIPC_NLA_STATS_LINK_CONGS, stats->link_congs}, 2029 {TIPC_NLA_STATS_MAX_QUEUE, stats->max_queue_sz}, 2030 {TIPC_NLA_STATS_AVG_QUEUE, stats->queue_sz_counts ? 2031 (stats->accu_queue_sz / stats->queue_sz_counts) : 0} 2032 }; 2033 2034 nest = nla_nest_start(skb, TIPC_NLA_LINK_STATS); 2035 if (!nest) 2036 return -EMSGSIZE; 2037 2038 for (i = 0; i < ARRAY_SIZE(map); i++) 2039 if (nla_put_u32(skb, map[i].key, map[i].val)) 2040 goto msg_full; 2041 2042 nla_nest_end(skb, nest); 2043 2044 return 0; 2045 msg_full: 2046 nla_nest_cancel(skb, nest); 2047 2048 return -EMSGSIZE; 2049 } 2050 2051 int tipc_nl_add_bc_link(struct net *net, struct tipc_nl_msg *msg) 2052 { 2053 int err; 2054 void *hdr; 2055 struct nlattr *attrs; 2056 struct nlattr *prop; 2057 struct tipc_net *tn = net_generic(net, tipc_net_id); 2058 struct tipc_link *bcl = tn->bcl; 2059 2060 if (!bcl) 2061 return 0; 2062 2063 tipc_bcast_lock(net); 2064 2065 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family, 2066 NLM_F_MULTI, TIPC_NL_LINK_GET); 2067 if (!hdr) { 2068 tipc_bcast_unlock(net); 2069 return -EMSGSIZE; 2070 } 2071 2072 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK); 2073 if (!attrs) 2074 goto msg_full; 2075 2076 /* The broadcast link is always up */ 2077 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP)) 2078 goto attr_msg_full; 2079 2080 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_BROADCAST)) 2081 goto attr_msg_full; 2082 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, bcl->name)) 2083 goto attr_msg_full; 2084 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, 0)) 2085 goto attr_msg_full; 2086 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, 0)) 2087 goto attr_msg_full; 2088 2089 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP); 2090 if (!prop) 2091 goto attr_msg_full; 2092 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, bcl->window)) 2093 goto prop_msg_full; 2094 nla_nest_end(msg->skb, prop); 2095 2096 err = __tipc_nl_add_bc_link_stat(msg->skb, &bcl->stats); 2097 if (err) 2098 goto attr_msg_full; 2099 2100 tipc_bcast_unlock(net); 2101 nla_nest_end(msg->skb, attrs); 2102 genlmsg_end(msg->skb, hdr); 2103 2104 return 0; 2105 2106 prop_msg_full: 2107 nla_nest_cancel(msg->skb, prop); 2108 attr_msg_full: 2109 nla_nest_cancel(msg->skb, attrs); 2110 msg_full: 2111 tipc_bcast_unlock(net); 2112 genlmsg_cancel(msg->skb, hdr); 2113 2114 return -EMSGSIZE; 2115 } 2116 2117 void tipc_link_set_tolerance(struct tipc_link *l, u32 tol, 2118 struct sk_buff_head *xmitq) 2119 { 2120 l->tolerance = tol; 2121 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, tol, 0, xmitq); 2122 } 2123 2124 void tipc_link_set_prio(struct tipc_link *l, u32 prio, 2125 struct sk_buff_head *xmitq) 2126 { 2127 l->priority = prio; 2128 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, prio, xmitq); 2129 } 2130 2131 void tipc_link_set_abort_limit(struct tipc_link *l, u32 limit) 2132 { 2133 l->abort_limit = limit; 2134 } 2135