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 #include "trace.h" 47 48 #include <linux/pkt_sched.h> 49 50 struct tipc_stats { 51 u32 sent_pkts; 52 u32 recv_pkts; 53 u32 sent_states; 54 u32 recv_states; 55 u32 sent_probes; 56 u32 recv_probes; 57 u32 sent_nacks; 58 u32 recv_nacks; 59 u32 sent_acks; 60 u32 sent_bundled; 61 u32 sent_bundles; 62 u32 recv_bundled; 63 u32 recv_bundles; 64 u32 retransmitted; 65 u32 sent_fragmented; 66 u32 sent_fragments; 67 u32 recv_fragmented; 68 u32 recv_fragments; 69 u32 link_congs; /* # port sends blocked by congestion */ 70 u32 deferred_recv; 71 u32 duplicates; 72 u32 max_queue_sz; /* send queue size high water mark */ 73 u32 accu_queue_sz; /* used for send queue size profiling */ 74 u32 queue_sz_counts; /* used for send queue size profiling */ 75 u32 msg_length_counts; /* used for message length profiling */ 76 u32 msg_lengths_total; /* used for message length profiling */ 77 u32 msg_length_profile[7]; /* used for msg. length profiling */ 78 }; 79 80 /** 81 * struct tipc_link - TIPC link data structure 82 * @addr: network address of link's peer node 83 * @name: link name character string 84 * @media_addr: media address to use when sending messages over link 85 * @timer: link timer 86 * @net: pointer to namespace struct 87 * @refcnt: reference counter for permanent references (owner node & timer) 88 * @peer_session: link session # being used by peer end of link 89 * @peer_bearer_id: bearer id used by link's peer endpoint 90 * @bearer_id: local bearer id used by link 91 * @tolerance: minimum link continuity loss needed to reset link [in ms] 92 * @abort_limit: # of unacknowledged continuity probes needed to reset link 93 * @state: current state of link FSM 94 * @peer_caps: bitmap describing capabilities of peer node 95 * @silent_intv_cnt: # of timer intervals without any reception from peer 96 * @proto_msg: template for control messages generated by link 97 * @pmsg: convenience pointer to "proto_msg" field 98 * @priority: current link priority 99 * @net_plane: current link network plane ('A' through 'H') 100 * @mon_state: cookie with information needed by link monitor 101 * @backlog_limit: backlog queue congestion thresholds (indexed by importance) 102 * @exp_msg_count: # of tunnelled messages expected during link changeover 103 * @reset_rcv_checkpt: seq # of last acknowledged message at time of link reset 104 * @mtu: current maximum packet size for this link 105 * @advertised_mtu: advertised own mtu when link is being established 106 * @transmitq: queue for sent, non-acked messages 107 * @backlogq: queue for messages waiting to be sent 108 * @snt_nxt: next sequence number to use for outbound messages 109 * @prev_from: sequence number of most previous retransmission request 110 * @stale_cnt: counter for number of identical retransmit attempts 111 * @stale_limit: time when repeated identical retransmits must force link reset 112 * @ackers: # of peers that needs to ack each packet before it can be released 113 * @acked: # last packet acked by a certain peer. Used for broadcast. 114 * @rcv_nxt: next sequence number to expect for inbound messages 115 * @deferred_queue: deferred queue saved OOS b'cast message received from node 116 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer 117 * @inputq: buffer queue for messages to be delivered upwards 118 * @namedq: buffer queue for name table messages to be delivered upwards 119 * @next_out: ptr to first unsent outbound message in queue 120 * @wakeupq: linked list of wakeup msgs waiting for link congestion to abate 121 * @long_msg_seq_no: next identifier to use for outbound fragmented messages 122 * @reasm_buf: head of partially reassembled inbound message fragments 123 * @bc_rcvr: marks that this is a broadcast receiver link 124 * @stats: collects statistics regarding link activity 125 */ 126 struct tipc_link { 127 u32 addr; 128 char name[TIPC_MAX_LINK_NAME]; 129 struct net *net; 130 131 /* Management and link supervision data */ 132 u16 peer_session; 133 u16 session; 134 u16 snd_nxt_state; 135 u16 rcv_nxt_state; 136 u32 peer_bearer_id; 137 u32 bearer_id; 138 u32 tolerance; 139 u32 abort_limit; 140 u32 state; 141 u16 peer_caps; 142 bool in_session; 143 bool active; 144 u32 silent_intv_cnt; 145 char if_name[TIPC_MAX_IF_NAME]; 146 u32 priority; 147 char net_plane; 148 struct tipc_mon_state mon_state; 149 u16 rst_cnt; 150 151 /* Failover/synch */ 152 u16 drop_point; 153 struct sk_buff *failover_reasm_skb; 154 struct sk_buff_head failover_deferdq; 155 156 /* Max packet negotiation */ 157 u16 mtu; 158 u16 advertised_mtu; 159 160 /* Sending */ 161 struct sk_buff_head transmq; 162 struct sk_buff_head backlogq; 163 struct { 164 u16 len; 165 u16 limit; 166 } backlog[5]; 167 u16 snd_nxt; 168 u16 prev_from; 169 u16 window; 170 u16 stale_cnt; 171 unsigned long stale_limit; 172 173 /* Reception */ 174 u16 rcv_nxt; 175 u32 rcv_unacked; 176 struct sk_buff_head deferdq; 177 struct sk_buff_head *inputq; 178 struct sk_buff_head *namedq; 179 180 /* Congestion handling */ 181 struct sk_buff_head wakeupq; 182 183 /* Fragmentation/reassembly */ 184 struct sk_buff *reasm_buf; 185 186 /* Broadcast */ 187 u16 ackers; 188 u16 acked; 189 struct tipc_link *bc_rcvlink; 190 struct tipc_link *bc_sndlink; 191 u8 nack_state; 192 bool bc_peer_is_up; 193 194 /* Statistics */ 195 struct tipc_stats stats; 196 }; 197 198 /* 199 * Error message prefixes 200 */ 201 static const char *link_co_err = "Link tunneling error, "; 202 static const char *link_rst_msg = "Resetting link "; 203 204 /* Send states for broadcast NACKs 205 */ 206 enum { 207 BC_NACK_SND_CONDITIONAL, 208 BC_NACK_SND_UNCONDITIONAL, 209 BC_NACK_SND_SUPPRESS, 210 }; 211 212 #define TIPC_BC_RETR_LIM msecs_to_jiffies(10) /* [ms] */ 213 #define TIPC_UC_RETR_TIME (jiffies + msecs_to_jiffies(1)) 214 215 /* 216 * Interval between NACKs when packets arrive out of order 217 */ 218 #define TIPC_NACK_INTV (TIPC_MIN_LINK_WIN * 2) 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 bool probe_reply, u16 rcvgap, 243 int tolerance, int priority, 244 struct sk_buff_head *xmitq); 245 static void link_print(struct tipc_link *l, const char *str); 246 static int tipc_link_build_nack_msg(struct tipc_link *l, 247 struct sk_buff_head *xmitq); 248 static void tipc_link_build_bc_init_msg(struct tipc_link *l, 249 struct sk_buff_head *xmitq); 250 static bool tipc_link_release_pkts(struct tipc_link *l, u16 to); 251 static u16 tipc_build_gap_ack_blks(struct tipc_link *l, void *data); 252 static void tipc_link_advance_transmq(struct tipc_link *l, u16 acked, u16 gap, 253 struct tipc_gap_ack_blks *ga, 254 struct sk_buff_head *xmitq); 255 256 /* 257 * Simple non-static link routines (i.e. referenced outside this file) 258 */ 259 bool tipc_link_is_up(struct tipc_link *l) 260 { 261 return link_is_up(l); 262 } 263 264 bool tipc_link_peer_is_down(struct tipc_link *l) 265 { 266 return l->state == LINK_PEER_RESET; 267 } 268 269 bool tipc_link_is_reset(struct tipc_link *l) 270 { 271 return l->state & (LINK_RESET | LINK_FAILINGOVER | LINK_ESTABLISHING); 272 } 273 274 bool tipc_link_is_establishing(struct tipc_link *l) 275 { 276 return l->state == LINK_ESTABLISHING; 277 } 278 279 bool tipc_link_is_synching(struct tipc_link *l) 280 { 281 return l->state == LINK_SYNCHING; 282 } 283 284 bool tipc_link_is_failingover(struct tipc_link *l) 285 { 286 return l->state == LINK_FAILINGOVER; 287 } 288 289 bool tipc_link_is_blocked(struct tipc_link *l) 290 { 291 return l->state & (LINK_RESETTING | LINK_PEER_RESET | LINK_FAILINGOVER); 292 } 293 294 static bool link_is_bc_sndlink(struct tipc_link *l) 295 { 296 return !l->bc_sndlink; 297 } 298 299 static bool link_is_bc_rcvlink(struct tipc_link *l) 300 { 301 return ((l->bc_rcvlink == l) && !link_is_bc_sndlink(l)); 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_update_caps(struct tipc_link *l, u16 capabilities) 340 { 341 l->peer_caps = capabilities; 342 } 343 344 void tipc_link_add_bc_peer(struct tipc_link *snd_l, 345 struct tipc_link *uc_l, 346 struct sk_buff_head *xmitq) 347 { 348 struct tipc_link *rcv_l = uc_l->bc_rcvlink; 349 350 snd_l->ackers++; 351 rcv_l->acked = snd_l->snd_nxt - 1; 352 snd_l->state = LINK_ESTABLISHED; 353 tipc_link_build_bc_init_msg(uc_l, xmitq); 354 } 355 356 void tipc_link_remove_bc_peer(struct tipc_link *snd_l, 357 struct tipc_link *rcv_l, 358 struct sk_buff_head *xmitq) 359 { 360 u16 ack = snd_l->snd_nxt - 1; 361 362 snd_l->ackers--; 363 rcv_l->bc_peer_is_up = true; 364 rcv_l->state = LINK_ESTABLISHED; 365 tipc_link_bc_ack_rcv(rcv_l, ack, xmitq); 366 trace_tipc_link_reset(rcv_l, TIPC_DUMP_ALL, "bclink removed!"); 367 tipc_link_reset(rcv_l); 368 rcv_l->state = LINK_RESET; 369 if (!snd_l->ackers) { 370 trace_tipc_link_reset(snd_l, TIPC_DUMP_ALL, "zero ackers!"); 371 tipc_link_reset(snd_l); 372 snd_l->state = LINK_RESET; 373 __skb_queue_purge(xmitq); 374 } 375 } 376 377 int tipc_link_bc_peers(struct tipc_link *l) 378 { 379 return l->ackers; 380 } 381 382 static u16 link_bc_rcv_gap(struct tipc_link *l) 383 { 384 struct sk_buff *skb = skb_peek(&l->deferdq); 385 u16 gap = 0; 386 387 if (more(l->snd_nxt, l->rcv_nxt)) 388 gap = l->snd_nxt - l->rcv_nxt; 389 if (skb) 390 gap = buf_seqno(skb) - l->rcv_nxt; 391 return gap; 392 } 393 394 void tipc_link_set_mtu(struct tipc_link *l, int mtu) 395 { 396 l->mtu = mtu; 397 } 398 399 int tipc_link_mtu(struct tipc_link *l) 400 { 401 return l->mtu; 402 } 403 404 u16 tipc_link_rcv_nxt(struct tipc_link *l) 405 { 406 return l->rcv_nxt; 407 } 408 409 u16 tipc_link_acked(struct tipc_link *l) 410 { 411 return l->acked; 412 } 413 414 char *tipc_link_name(struct tipc_link *l) 415 { 416 return l->name; 417 } 418 419 u32 tipc_link_state(struct tipc_link *l) 420 { 421 return l->state; 422 } 423 424 /** 425 * tipc_link_create - create a new link 426 * @n: pointer to associated node 427 * @if_name: associated interface name 428 * @bearer_id: id (index) of associated bearer 429 * @tolerance: link tolerance to be used by link 430 * @net_plane: network plane (A,B,c..) this link belongs to 431 * @mtu: mtu to be advertised by link 432 * @priority: priority to be used by link 433 * @window: send window to be used by link 434 * @session: session to be used by link 435 * @ownnode: identity of own node 436 * @peer: node id of peer node 437 * @peer_caps: bitmap describing peer node capabilities 438 * @bc_sndlink: the namespace global link used for broadcast sending 439 * @bc_rcvlink: the peer specific link used for broadcast reception 440 * @inputq: queue to put messages ready for delivery 441 * @namedq: queue to put binding table update messages ready for delivery 442 * @link: return value, pointer to put the created link 443 * 444 * Returns true if link was created, otherwise false 445 */ 446 bool tipc_link_create(struct net *net, char *if_name, int bearer_id, 447 int tolerance, char net_plane, u32 mtu, int priority, 448 int window, u32 session, u32 self, 449 u32 peer, u8 *peer_id, u16 peer_caps, 450 struct tipc_link *bc_sndlink, 451 struct tipc_link *bc_rcvlink, 452 struct sk_buff_head *inputq, 453 struct sk_buff_head *namedq, 454 struct tipc_link **link) 455 { 456 char peer_str[NODE_ID_STR_LEN] = {0,}; 457 char self_str[NODE_ID_STR_LEN] = {0,}; 458 struct tipc_link *l; 459 460 l = kzalloc(sizeof(*l), GFP_ATOMIC); 461 if (!l) 462 return false; 463 *link = l; 464 l->session = session; 465 466 /* Set link name for unicast links only */ 467 if (peer_id) { 468 tipc_nodeid2string(self_str, tipc_own_id(net)); 469 if (strlen(self_str) > 16) 470 sprintf(self_str, "%x", self); 471 tipc_nodeid2string(peer_str, peer_id); 472 if (strlen(peer_str) > 16) 473 sprintf(peer_str, "%x", peer); 474 } 475 /* Peer i/f name will be completed by reset/activate message */ 476 snprintf(l->name, sizeof(l->name), "%s:%s-%s:unknown", 477 self_str, if_name, peer_str); 478 479 strcpy(l->if_name, if_name); 480 l->addr = peer; 481 l->peer_caps = peer_caps; 482 l->net = net; 483 l->in_session = false; 484 l->bearer_id = bearer_id; 485 l->tolerance = tolerance; 486 if (bc_rcvlink) 487 bc_rcvlink->tolerance = tolerance; 488 l->net_plane = net_plane; 489 l->advertised_mtu = mtu; 490 l->mtu = mtu; 491 l->priority = priority; 492 tipc_link_set_queue_limits(l, window); 493 l->ackers = 1; 494 l->bc_sndlink = bc_sndlink; 495 l->bc_rcvlink = bc_rcvlink; 496 l->inputq = inputq; 497 l->namedq = namedq; 498 l->state = LINK_RESETTING; 499 __skb_queue_head_init(&l->transmq); 500 __skb_queue_head_init(&l->backlogq); 501 __skb_queue_head_init(&l->deferdq); 502 __skb_queue_head_init(&l->failover_deferdq); 503 skb_queue_head_init(&l->wakeupq); 504 skb_queue_head_init(l->inputq); 505 return true; 506 } 507 508 /** 509 * tipc_link_bc_create - create new link to be used for broadcast 510 * @n: pointer to associated node 511 * @mtu: mtu to be used initially if no peers 512 * @window: send window to be used 513 * @inputq: queue to put messages ready for delivery 514 * @namedq: queue to put binding table update messages ready for delivery 515 * @link: return value, pointer to put the created link 516 * 517 * Returns true if link was created, otherwise false 518 */ 519 bool tipc_link_bc_create(struct net *net, u32 ownnode, u32 peer, 520 int mtu, int window, u16 peer_caps, 521 struct sk_buff_head *inputq, 522 struct sk_buff_head *namedq, 523 struct tipc_link *bc_sndlink, 524 struct tipc_link **link) 525 { 526 struct tipc_link *l; 527 528 if (!tipc_link_create(net, "", MAX_BEARERS, 0, 'Z', mtu, 0, window, 529 0, ownnode, peer, NULL, peer_caps, bc_sndlink, 530 NULL, inputq, namedq, link)) 531 return false; 532 533 l = *link; 534 strcpy(l->name, tipc_bclink_name); 535 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "bclink created!"); 536 tipc_link_reset(l); 537 l->state = LINK_RESET; 538 l->ackers = 0; 539 l->bc_rcvlink = l; 540 541 /* Broadcast send link is always up */ 542 if (link_is_bc_sndlink(l)) 543 l->state = LINK_ESTABLISHED; 544 545 /* Disable replicast if even a single peer doesn't support it */ 546 if (link_is_bc_rcvlink(l) && !(peer_caps & TIPC_BCAST_RCAST)) 547 tipc_bcast_disable_rcast(net); 548 549 return true; 550 } 551 552 /** 553 * tipc_link_fsm_evt - link finite state machine 554 * @l: pointer to link 555 * @evt: state machine event to be processed 556 */ 557 int tipc_link_fsm_evt(struct tipc_link *l, int evt) 558 { 559 int rc = 0; 560 int old_state = l->state; 561 562 switch (l->state) { 563 case LINK_RESETTING: 564 switch (evt) { 565 case LINK_PEER_RESET_EVT: 566 l->state = LINK_PEER_RESET; 567 break; 568 case LINK_RESET_EVT: 569 l->state = LINK_RESET; 570 break; 571 case LINK_FAILURE_EVT: 572 case LINK_FAILOVER_BEGIN_EVT: 573 case LINK_ESTABLISH_EVT: 574 case LINK_FAILOVER_END_EVT: 575 case LINK_SYNCH_BEGIN_EVT: 576 case LINK_SYNCH_END_EVT: 577 default: 578 goto illegal_evt; 579 } 580 break; 581 case LINK_RESET: 582 switch (evt) { 583 case LINK_PEER_RESET_EVT: 584 l->state = LINK_ESTABLISHING; 585 break; 586 case LINK_FAILOVER_BEGIN_EVT: 587 l->state = LINK_FAILINGOVER; 588 case LINK_FAILURE_EVT: 589 case LINK_RESET_EVT: 590 case LINK_ESTABLISH_EVT: 591 case LINK_FAILOVER_END_EVT: 592 break; 593 case LINK_SYNCH_BEGIN_EVT: 594 case LINK_SYNCH_END_EVT: 595 default: 596 goto illegal_evt; 597 } 598 break; 599 case LINK_PEER_RESET: 600 switch (evt) { 601 case LINK_RESET_EVT: 602 l->state = LINK_ESTABLISHING; 603 break; 604 case LINK_PEER_RESET_EVT: 605 case LINK_ESTABLISH_EVT: 606 case LINK_FAILURE_EVT: 607 break; 608 case LINK_SYNCH_BEGIN_EVT: 609 case LINK_SYNCH_END_EVT: 610 case LINK_FAILOVER_BEGIN_EVT: 611 case LINK_FAILOVER_END_EVT: 612 default: 613 goto illegal_evt; 614 } 615 break; 616 case LINK_FAILINGOVER: 617 switch (evt) { 618 case LINK_FAILOVER_END_EVT: 619 l->state = LINK_RESET; 620 break; 621 case LINK_PEER_RESET_EVT: 622 case LINK_RESET_EVT: 623 case LINK_ESTABLISH_EVT: 624 case LINK_FAILURE_EVT: 625 break; 626 case LINK_FAILOVER_BEGIN_EVT: 627 case LINK_SYNCH_BEGIN_EVT: 628 case LINK_SYNCH_END_EVT: 629 default: 630 goto illegal_evt; 631 } 632 break; 633 case LINK_ESTABLISHING: 634 switch (evt) { 635 case LINK_ESTABLISH_EVT: 636 l->state = LINK_ESTABLISHED; 637 break; 638 case LINK_FAILOVER_BEGIN_EVT: 639 l->state = LINK_FAILINGOVER; 640 break; 641 case LINK_RESET_EVT: 642 l->state = LINK_RESET; 643 break; 644 case LINK_FAILURE_EVT: 645 case LINK_PEER_RESET_EVT: 646 case LINK_SYNCH_BEGIN_EVT: 647 case LINK_FAILOVER_END_EVT: 648 break; 649 case LINK_SYNCH_END_EVT: 650 default: 651 goto illegal_evt; 652 } 653 break; 654 case LINK_ESTABLISHED: 655 switch (evt) { 656 case LINK_PEER_RESET_EVT: 657 l->state = LINK_PEER_RESET; 658 rc |= TIPC_LINK_DOWN_EVT; 659 break; 660 case LINK_FAILURE_EVT: 661 l->state = LINK_RESETTING; 662 rc |= TIPC_LINK_DOWN_EVT; 663 break; 664 case LINK_RESET_EVT: 665 l->state = LINK_RESET; 666 break; 667 case LINK_ESTABLISH_EVT: 668 case LINK_SYNCH_END_EVT: 669 break; 670 case LINK_SYNCH_BEGIN_EVT: 671 l->state = LINK_SYNCHING; 672 break; 673 case LINK_FAILOVER_BEGIN_EVT: 674 case LINK_FAILOVER_END_EVT: 675 default: 676 goto illegal_evt; 677 } 678 break; 679 case LINK_SYNCHING: 680 switch (evt) { 681 case LINK_PEER_RESET_EVT: 682 l->state = LINK_PEER_RESET; 683 rc |= TIPC_LINK_DOWN_EVT; 684 break; 685 case LINK_FAILURE_EVT: 686 l->state = LINK_RESETTING; 687 rc |= TIPC_LINK_DOWN_EVT; 688 break; 689 case LINK_RESET_EVT: 690 l->state = LINK_RESET; 691 break; 692 case LINK_ESTABLISH_EVT: 693 case LINK_SYNCH_BEGIN_EVT: 694 break; 695 case LINK_SYNCH_END_EVT: 696 l->state = LINK_ESTABLISHED; 697 break; 698 case LINK_FAILOVER_BEGIN_EVT: 699 case LINK_FAILOVER_END_EVT: 700 default: 701 goto illegal_evt; 702 } 703 break; 704 default: 705 pr_err("Unknown FSM state %x in %s\n", l->state, l->name); 706 } 707 trace_tipc_link_fsm(l->name, old_state, l->state, evt); 708 return rc; 709 illegal_evt: 710 pr_err("Illegal FSM event %x in state %x on link %s\n", 711 evt, l->state, l->name); 712 trace_tipc_link_fsm(l->name, old_state, l->state, evt); 713 return rc; 714 } 715 716 /* link_profile_stats - update statistical profiling of traffic 717 */ 718 static void link_profile_stats(struct tipc_link *l) 719 { 720 struct sk_buff *skb; 721 struct tipc_msg *msg; 722 int length; 723 724 /* Update counters used in statistical profiling of send traffic */ 725 l->stats.accu_queue_sz += skb_queue_len(&l->transmq); 726 l->stats.queue_sz_counts++; 727 728 skb = skb_peek(&l->transmq); 729 if (!skb) 730 return; 731 msg = buf_msg(skb); 732 length = msg_size(msg); 733 734 if (msg_user(msg) == MSG_FRAGMENTER) { 735 if (msg_type(msg) != FIRST_FRAGMENT) 736 return; 737 length = msg_size(msg_get_wrapped(msg)); 738 } 739 l->stats.msg_lengths_total += length; 740 l->stats.msg_length_counts++; 741 if (length <= 64) 742 l->stats.msg_length_profile[0]++; 743 else if (length <= 256) 744 l->stats.msg_length_profile[1]++; 745 else if (length <= 1024) 746 l->stats.msg_length_profile[2]++; 747 else if (length <= 4096) 748 l->stats.msg_length_profile[3]++; 749 else if (length <= 16384) 750 l->stats.msg_length_profile[4]++; 751 else if (length <= 32768) 752 l->stats.msg_length_profile[5]++; 753 else 754 l->stats.msg_length_profile[6]++; 755 } 756 757 /** 758 * tipc_link_too_silent - check if link is "too silent" 759 * @l: tipc link to be checked 760 * 761 * Returns true if the link 'silent_intv_cnt' is about to reach the 762 * 'abort_limit' value, otherwise false 763 */ 764 bool tipc_link_too_silent(struct tipc_link *l) 765 { 766 return (l->silent_intv_cnt + 2 > l->abort_limit); 767 } 768 769 /* tipc_link_timeout - perform periodic task as instructed from node timeout 770 */ 771 int tipc_link_timeout(struct tipc_link *l, struct sk_buff_head *xmitq) 772 { 773 int mtyp = 0; 774 int rc = 0; 775 bool state = false; 776 bool probe = false; 777 bool setup = false; 778 u16 bc_snt = l->bc_sndlink->snd_nxt - 1; 779 u16 bc_acked = l->bc_rcvlink->acked; 780 struct tipc_mon_state *mstate = &l->mon_state; 781 782 trace_tipc_link_timeout(l, TIPC_DUMP_NONE, " "); 783 trace_tipc_link_too_silent(l, TIPC_DUMP_ALL, " "); 784 switch (l->state) { 785 case LINK_ESTABLISHED: 786 case LINK_SYNCHING: 787 mtyp = STATE_MSG; 788 link_profile_stats(l); 789 tipc_mon_get_state(l->net, l->addr, mstate, l->bearer_id); 790 if (mstate->reset || (l->silent_intv_cnt > l->abort_limit)) 791 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT); 792 state = bc_acked != bc_snt; 793 state |= l->bc_rcvlink->rcv_unacked; 794 state |= l->rcv_unacked; 795 state |= !skb_queue_empty(&l->transmq); 796 state |= !skb_queue_empty(&l->deferdq); 797 probe = mstate->probing; 798 probe |= l->silent_intv_cnt; 799 if (probe || mstate->monitoring) 800 l->silent_intv_cnt++; 801 break; 802 case LINK_RESET: 803 setup = l->rst_cnt++ <= 4; 804 setup |= !(l->rst_cnt % 16); 805 mtyp = RESET_MSG; 806 break; 807 case LINK_ESTABLISHING: 808 setup = true; 809 mtyp = ACTIVATE_MSG; 810 break; 811 case LINK_PEER_RESET: 812 case LINK_RESETTING: 813 case LINK_FAILINGOVER: 814 break; 815 default: 816 break; 817 } 818 819 if (state || probe || setup) 820 tipc_link_build_proto_msg(l, mtyp, probe, 0, 0, 0, 0, xmitq); 821 822 return rc; 823 } 824 825 /** 826 * link_schedule_user - schedule a message sender for wakeup after congestion 827 * @l: congested link 828 * @hdr: header of message that is being sent 829 * Create pseudo msg to send back to user when congestion abates 830 */ 831 static int link_schedule_user(struct tipc_link *l, struct tipc_msg *hdr) 832 { 833 u32 dnode = tipc_own_addr(l->net); 834 u32 dport = msg_origport(hdr); 835 struct sk_buff *skb; 836 837 /* Create and schedule wakeup pseudo message */ 838 skb = tipc_msg_create(SOCK_WAKEUP, 0, INT_H_SIZE, 0, 839 dnode, l->addr, dport, 0, 0); 840 if (!skb) 841 return -ENOBUFS; 842 msg_set_dest_droppable(buf_msg(skb), true); 843 TIPC_SKB_CB(skb)->chain_imp = msg_importance(hdr); 844 skb_queue_tail(&l->wakeupq, skb); 845 l->stats.link_congs++; 846 trace_tipc_link_conges(l, TIPC_DUMP_ALL, "wakeup scheduled!"); 847 return -ELINKCONG; 848 } 849 850 /** 851 * link_prepare_wakeup - prepare users for wakeup after congestion 852 * @l: congested link 853 * Wake up a number of waiting users, as permitted by available space 854 * in the send queue 855 */ 856 static void link_prepare_wakeup(struct tipc_link *l) 857 { 858 struct sk_buff *skb, *tmp; 859 int imp, i = 0; 860 861 skb_queue_walk_safe(&l->wakeupq, skb, tmp) { 862 imp = TIPC_SKB_CB(skb)->chain_imp; 863 if (l->backlog[imp].len < l->backlog[imp].limit) { 864 skb_unlink(skb, &l->wakeupq); 865 skb_queue_tail(l->inputq, skb); 866 } else if (i++ > 10) { 867 break; 868 } 869 } 870 } 871 872 void tipc_link_reset(struct tipc_link *l) 873 { 874 struct sk_buff_head list; 875 876 __skb_queue_head_init(&list); 877 878 l->in_session = false; 879 l->session++; 880 l->mtu = l->advertised_mtu; 881 882 spin_lock_bh(&l->wakeupq.lock); 883 skb_queue_splice_init(&l->wakeupq, &list); 884 spin_unlock_bh(&l->wakeupq.lock); 885 886 spin_lock_bh(&l->inputq->lock); 887 skb_queue_splice_init(&list, l->inputq); 888 spin_unlock_bh(&l->inputq->lock); 889 890 __skb_queue_purge(&l->transmq); 891 __skb_queue_purge(&l->deferdq); 892 __skb_queue_purge(&l->backlogq); 893 __skb_queue_purge(&l->failover_deferdq); 894 l->backlog[TIPC_LOW_IMPORTANCE].len = 0; 895 l->backlog[TIPC_MEDIUM_IMPORTANCE].len = 0; 896 l->backlog[TIPC_HIGH_IMPORTANCE].len = 0; 897 l->backlog[TIPC_CRITICAL_IMPORTANCE].len = 0; 898 l->backlog[TIPC_SYSTEM_IMPORTANCE].len = 0; 899 kfree_skb(l->reasm_buf); 900 kfree_skb(l->failover_reasm_skb); 901 l->reasm_buf = NULL; 902 l->failover_reasm_skb = NULL; 903 l->rcv_unacked = 0; 904 l->snd_nxt = 1; 905 l->rcv_nxt = 1; 906 l->snd_nxt_state = 1; 907 l->rcv_nxt_state = 1; 908 l->acked = 0; 909 l->silent_intv_cnt = 0; 910 l->rst_cnt = 0; 911 l->stale_cnt = 0; 912 l->bc_peer_is_up = false; 913 memset(&l->mon_state, 0, sizeof(l->mon_state)); 914 tipc_link_reset_stats(l); 915 } 916 917 /** 918 * tipc_link_xmit(): enqueue buffer list according to queue situation 919 * @link: link to use 920 * @list: chain of buffers containing message 921 * @xmitq: returned list of packets to be sent by caller 922 * 923 * Consumes the buffer chain. 924 * Returns 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS 925 * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted 926 */ 927 int tipc_link_xmit(struct tipc_link *l, struct sk_buff_head *list, 928 struct sk_buff_head *xmitq) 929 { 930 struct tipc_msg *hdr = buf_msg(skb_peek(list)); 931 unsigned int maxwin = l->window; 932 int imp = msg_importance(hdr); 933 unsigned int mtu = l->mtu; 934 u16 ack = l->rcv_nxt - 1; 935 u16 seqno = l->snd_nxt; 936 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1; 937 struct sk_buff_head *transmq = &l->transmq; 938 struct sk_buff_head *backlogq = &l->backlogq; 939 struct sk_buff *skb, *_skb, *bskb; 940 int pkt_cnt = skb_queue_len(list); 941 int rc = 0; 942 943 if (unlikely(msg_size(hdr) > mtu)) { 944 skb_queue_purge(list); 945 return -EMSGSIZE; 946 } 947 948 /* Allow oversubscription of one data msg per source at congestion */ 949 if (unlikely(l->backlog[imp].len >= l->backlog[imp].limit)) { 950 if (imp == TIPC_SYSTEM_IMPORTANCE) { 951 pr_warn("%s<%s>, link overflow", link_rst_msg, l->name); 952 return -ENOBUFS; 953 } 954 rc = link_schedule_user(l, hdr); 955 } 956 957 if (pkt_cnt > 1) { 958 l->stats.sent_fragmented++; 959 l->stats.sent_fragments += pkt_cnt; 960 } 961 962 /* Prepare each packet for sending, and add to relevant queue: */ 963 while (skb_queue_len(list)) { 964 skb = skb_peek(list); 965 hdr = buf_msg(skb); 966 msg_set_seqno(hdr, seqno); 967 msg_set_ack(hdr, ack); 968 msg_set_bcast_ack(hdr, bc_ack); 969 970 if (likely(skb_queue_len(transmq) < maxwin)) { 971 _skb = skb_clone(skb, GFP_ATOMIC); 972 if (!_skb) { 973 skb_queue_purge(list); 974 return -ENOBUFS; 975 } 976 __skb_dequeue(list); 977 __skb_queue_tail(transmq, skb); 978 /* next retransmit attempt */ 979 if (link_is_bc_sndlink(l)) 980 TIPC_SKB_CB(skb)->nxt_retr = 981 jiffies + TIPC_BC_RETR_LIM; 982 __skb_queue_tail(xmitq, _skb); 983 TIPC_SKB_CB(skb)->ackers = l->ackers; 984 l->rcv_unacked = 0; 985 l->stats.sent_pkts++; 986 seqno++; 987 continue; 988 } 989 if (tipc_msg_bundle(skb_peek_tail(backlogq), hdr, mtu)) { 990 kfree_skb(__skb_dequeue(list)); 991 l->stats.sent_bundled++; 992 continue; 993 } 994 if (tipc_msg_make_bundle(&bskb, hdr, mtu, l->addr)) { 995 kfree_skb(__skb_dequeue(list)); 996 __skb_queue_tail(backlogq, bskb); 997 l->backlog[msg_importance(buf_msg(bskb))].len++; 998 l->stats.sent_bundled++; 999 l->stats.sent_bundles++; 1000 continue; 1001 } 1002 l->backlog[imp].len += skb_queue_len(list); 1003 skb_queue_splice_tail_init(list, backlogq); 1004 } 1005 l->snd_nxt = seqno; 1006 return rc; 1007 } 1008 1009 static void tipc_link_advance_backlog(struct tipc_link *l, 1010 struct sk_buff_head *xmitq) 1011 { 1012 struct sk_buff *skb, *_skb; 1013 struct tipc_msg *hdr; 1014 u16 seqno = l->snd_nxt; 1015 u16 ack = l->rcv_nxt - 1; 1016 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1; 1017 1018 while (skb_queue_len(&l->transmq) < l->window) { 1019 skb = skb_peek(&l->backlogq); 1020 if (!skb) 1021 break; 1022 _skb = skb_clone(skb, GFP_ATOMIC); 1023 if (!_skb) 1024 break; 1025 __skb_dequeue(&l->backlogq); 1026 hdr = buf_msg(skb); 1027 l->backlog[msg_importance(hdr)].len--; 1028 __skb_queue_tail(&l->transmq, skb); 1029 /* next retransmit attempt */ 1030 if (link_is_bc_sndlink(l)) 1031 TIPC_SKB_CB(skb)->nxt_retr = jiffies + TIPC_BC_RETR_LIM; 1032 1033 __skb_queue_tail(xmitq, _skb); 1034 TIPC_SKB_CB(skb)->ackers = l->ackers; 1035 msg_set_seqno(hdr, seqno); 1036 msg_set_ack(hdr, ack); 1037 msg_set_bcast_ack(hdr, bc_ack); 1038 l->rcv_unacked = 0; 1039 l->stats.sent_pkts++; 1040 seqno++; 1041 } 1042 l->snd_nxt = seqno; 1043 } 1044 1045 static void link_retransmit_failure(struct tipc_link *l, struct sk_buff *skb) 1046 { 1047 struct tipc_msg *hdr = buf_msg(skb); 1048 1049 pr_warn("Retransmission failure on link <%s>\n", l->name); 1050 link_print(l, "State of link "); 1051 pr_info("Failed msg: usr %u, typ %u, len %u, err %u\n", 1052 msg_user(hdr), msg_type(hdr), msg_size(hdr), msg_errcode(hdr)); 1053 pr_info("sqno %u, prev: %x, src: %x\n", 1054 msg_seqno(hdr), msg_prevnode(hdr), msg_orignode(hdr)); 1055 } 1056 1057 /* tipc_link_retrans() - retransmit one or more packets 1058 * @l: the link to transmit on 1059 * @r: the receiving link ordering the retransmit. Same as l if unicast 1060 * @from: retransmit from (inclusive) this sequence number 1061 * @to: retransmit to (inclusive) this sequence number 1062 * xmitq: queue for accumulating the retransmitted packets 1063 */ 1064 static int tipc_link_retrans(struct tipc_link *l, struct tipc_link *r, 1065 u16 from, u16 to, struct sk_buff_head *xmitq) 1066 { 1067 struct sk_buff *_skb, *skb = skb_peek(&l->transmq); 1068 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1; 1069 u16 ack = l->rcv_nxt - 1; 1070 struct tipc_msg *hdr; 1071 1072 if (!skb) 1073 return 0; 1074 if (less(to, from)) 1075 return 0; 1076 1077 trace_tipc_link_retrans(r, from, to, &l->transmq); 1078 /* Detect repeated retransmit failures on same packet */ 1079 if (r->prev_from != from) { 1080 r->prev_from = from; 1081 r->stale_limit = jiffies + msecs_to_jiffies(r->tolerance); 1082 r->stale_cnt = 0; 1083 } else if (++r->stale_cnt > 99 && time_after(jiffies, r->stale_limit)) { 1084 link_retransmit_failure(l, skb); 1085 trace_tipc_list_dump(&l->transmq, true, "retrans failure!"); 1086 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "retrans failure!"); 1087 trace_tipc_link_dump(r, TIPC_DUMP_NONE, "retrans failure!"); 1088 if (link_is_bc_sndlink(l)) 1089 return TIPC_LINK_DOWN_EVT; 1090 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT); 1091 } 1092 1093 skb_queue_walk(&l->transmq, skb) { 1094 hdr = buf_msg(skb); 1095 if (less(msg_seqno(hdr), from)) 1096 continue; 1097 if (more(msg_seqno(hdr), to)) 1098 break; 1099 if (link_is_bc_sndlink(l)) { 1100 if (time_before(jiffies, TIPC_SKB_CB(skb)->nxt_retr)) 1101 continue; 1102 TIPC_SKB_CB(skb)->nxt_retr = jiffies + TIPC_BC_RETR_LIM; 1103 } 1104 _skb = __pskb_copy(skb, MIN_H_SIZE, GFP_ATOMIC); 1105 if (!_skb) 1106 return 0; 1107 hdr = buf_msg(_skb); 1108 msg_set_ack(hdr, ack); 1109 msg_set_bcast_ack(hdr, bc_ack); 1110 _skb->priority = TC_PRIO_CONTROL; 1111 __skb_queue_tail(xmitq, _skb); 1112 l->stats.retransmitted++; 1113 } 1114 return 0; 1115 } 1116 1117 /* tipc_data_input - deliver data and name distr msgs to upper layer 1118 * 1119 * Consumes buffer if message is of right type 1120 * Node lock must be held 1121 */ 1122 static bool tipc_data_input(struct tipc_link *l, struct sk_buff *skb, 1123 struct sk_buff_head *inputq) 1124 { 1125 struct sk_buff_head *mc_inputq = l->bc_rcvlink->inputq; 1126 struct tipc_msg *hdr = buf_msg(skb); 1127 1128 switch (msg_user(hdr)) { 1129 case TIPC_LOW_IMPORTANCE: 1130 case TIPC_MEDIUM_IMPORTANCE: 1131 case TIPC_HIGH_IMPORTANCE: 1132 case TIPC_CRITICAL_IMPORTANCE: 1133 if (unlikely(msg_in_group(hdr) || msg_mcast(hdr))) { 1134 skb_queue_tail(mc_inputq, skb); 1135 return true; 1136 } 1137 /* fall through */ 1138 case CONN_MANAGER: 1139 skb_queue_tail(inputq, skb); 1140 return true; 1141 case GROUP_PROTOCOL: 1142 skb_queue_tail(mc_inputq, skb); 1143 return true; 1144 case NAME_DISTRIBUTOR: 1145 l->bc_rcvlink->state = LINK_ESTABLISHED; 1146 skb_queue_tail(l->namedq, skb); 1147 return true; 1148 case MSG_BUNDLER: 1149 case TUNNEL_PROTOCOL: 1150 case MSG_FRAGMENTER: 1151 case BCAST_PROTOCOL: 1152 return false; 1153 default: 1154 pr_warn("Dropping received illegal msg type\n"); 1155 kfree_skb(skb); 1156 return true; 1157 }; 1158 } 1159 1160 /* tipc_link_input - process packet that has passed link protocol check 1161 * 1162 * Consumes buffer 1163 */ 1164 static int tipc_link_input(struct tipc_link *l, struct sk_buff *skb, 1165 struct sk_buff_head *inputq, 1166 struct sk_buff **reasm_skb) 1167 { 1168 struct tipc_msg *hdr = buf_msg(skb); 1169 struct sk_buff *iskb; 1170 struct sk_buff_head tmpq; 1171 int usr = msg_user(hdr); 1172 int pos = 0; 1173 1174 if (usr == MSG_BUNDLER) { 1175 skb_queue_head_init(&tmpq); 1176 l->stats.recv_bundles++; 1177 l->stats.recv_bundled += msg_msgcnt(hdr); 1178 while (tipc_msg_extract(skb, &iskb, &pos)) 1179 tipc_data_input(l, iskb, &tmpq); 1180 tipc_skb_queue_splice_tail(&tmpq, inputq); 1181 return 0; 1182 } else if (usr == MSG_FRAGMENTER) { 1183 l->stats.recv_fragments++; 1184 if (tipc_buf_append(reasm_skb, &skb)) { 1185 l->stats.recv_fragmented++; 1186 tipc_data_input(l, skb, inputq); 1187 } else if (!*reasm_skb && !link_is_bc_rcvlink(l)) { 1188 pr_warn_ratelimited("Unable to build fragment list\n"); 1189 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT); 1190 } 1191 return 0; 1192 } else if (usr == BCAST_PROTOCOL) { 1193 tipc_bcast_lock(l->net); 1194 tipc_link_bc_init_rcv(l->bc_rcvlink, hdr); 1195 tipc_bcast_unlock(l->net); 1196 } 1197 1198 kfree_skb(skb); 1199 return 0; 1200 } 1201 1202 /* tipc_link_tnl_rcv() - receive TUNNEL_PROTOCOL message, drop or process the 1203 * inner message along with the ones in the old link's 1204 * deferdq 1205 * @l: tunnel link 1206 * @skb: TUNNEL_PROTOCOL message 1207 * @inputq: queue to put messages ready for delivery 1208 */ 1209 static int tipc_link_tnl_rcv(struct tipc_link *l, struct sk_buff *skb, 1210 struct sk_buff_head *inputq) 1211 { 1212 struct sk_buff **reasm_skb = &l->failover_reasm_skb; 1213 struct sk_buff_head *fdefq = &l->failover_deferdq; 1214 struct tipc_msg *hdr = buf_msg(skb); 1215 struct sk_buff *iskb; 1216 int ipos = 0; 1217 int rc = 0; 1218 u16 seqno; 1219 1220 /* SYNCH_MSG */ 1221 if (msg_type(hdr) == SYNCH_MSG) 1222 goto drop; 1223 1224 /* FAILOVER_MSG */ 1225 if (!tipc_msg_extract(skb, &iskb, &ipos)) { 1226 pr_warn_ratelimited("Cannot extract FAILOVER_MSG, defq: %d\n", 1227 skb_queue_len(fdefq)); 1228 return rc; 1229 } 1230 1231 do { 1232 seqno = buf_seqno(iskb); 1233 1234 if (unlikely(less(seqno, l->drop_point))) { 1235 kfree_skb(iskb); 1236 continue; 1237 } 1238 1239 if (unlikely(seqno != l->drop_point)) { 1240 __tipc_skb_queue_sorted(fdefq, seqno, iskb); 1241 continue; 1242 } 1243 1244 l->drop_point++; 1245 1246 if (!tipc_data_input(l, iskb, inputq)) 1247 rc |= tipc_link_input(l, iskb, inputq, reasm_skb); 1248 if (unlikely(rc)) 1249 break; 1250 } while ((iskb = __tipc_skb_dequeue(fdefq, l->drop_point))); 1251 1252 drop: 1253 kfree_skb(skb); 1254 return rc; 1255 } 1256 1257 static bool tipc_link_release_pkts(struct tipc_link *l, u16 acked) 1258 { 1259 bool released = false; 1260 struct sk_buff *skb, *tmp; 1261 1262 skb_queue_walk_safe(&l->transmq, skb, tmp) { 1263 if (more(buf_seqno(skb), acked)) 1264 break; 1265 __skb_unlink(skb, &l->transmq); 1266 kfree_skb(skb); 1267 released = true; 1268 } 1269 return released; 1270 } 1271 1272 /* tipc_build_gap_ack_blks - build Gap ACK blocks 1273 * @l: tipc link that data have come with gaps in sequence if any 1274 * @data: data buffer to store the Gap ACK blocks after built 1275 * 1276 * returns the actual allocated memory size 1277 */ 1278 static u16 tipc_build_gap_ack_blks(struct tipc_link *l, void *data) 1279 { 1280 struct sk_buff *skb = skb_peek(&l->deferdq); 1281 struct tipc_gap_ack_blks *ga = data; 1282 u16 len, expect, seqno = 0; 1283 u8 n = 0; 1284 1285 if (!skb) 1286 goto exit; 1287 1288 expect = buf_seqno(skb); 1289 skb_queue_walk(&l->deferdq, skb) { 1290 seqno = buf_seqno(skb); 1291 if (unlikely(more(seqno, expect))) { 1292 ga->gacks[n].ack = htons(expect - 1); 1293 ga->gacks[n].gap = htons(seqno - expect); 1294 if (++n >= MAX_GAP_ACK_BLKS) { 1295 pr_info_ratelimited("Too few Gap ACK blocks!\n"); 1296 goto exit; 1297 } 1298 } else if (unlikely(less(seqno, expect))) { 1299 pr_warn("Unexpected skb in deferdq!\n"); 1300 continue; 1301 } 1302 expect = seqno + 1; 1303 } 1304 1305 /* last block */ 1306 ga->gacks[n].ack = htons(seqno); 1307 ga->gacks[n].gap = 0; 1308 n++; 1309 1310 exit: 1311 len = tipc_gap_ack_blks_sz(n); 1312 ga->len = htons(len); 1313 ga->gack_cnt = n; 1314 return len; 1315 } 1316 1317 /* tipc_link_advance_transmq - advance TIPC link transmq queue by releasing 1318 * acked packets, also doing retransmissions if 1319 * gaps found 1320 * @l: tipc link with transmq queue to be advanced 1321 * @acked: seqno of last packet acked by peer without any gaps before 1322 * @gap: # of gap packets 1323 * @ga: buffer pointer to Gap ACK blocks from peer 1324 * @xmitq: queue for accumulating the retransmitted packets if any 1325 */ 1326 static void tipc_link_advance_transmq(struct tipc_link *l, u16 acked, u16 gap, 1327 struct tipc_gap_ack_blks *ga, 1328 struct sk_buff_head *xmitq) 1329 { 1330 struct sk_buff *skb, *_skb, *tmp; 1331 struct tipc_msg *hdr; 1332 u16 bc_ack = l->bc_rcvlink->rcv_nxt - 1; 1333 u16 ack = l->rcv_nxt - 1; 1334 u16 seqno; 1335 u16 n = 0; 1336 1337 skb_queue_walk_safe(&l->transmq, skb, tmp) { 1338 seqno = buf_seqno(skb); 1339 1340 next_gap_ack: 1341 if (less_eq(seqno, acked)) { 1342 /* release skb */ 1343 __skb_unlink(skb, &l->transmq); 1344 kfree_skb(skb); 1345 } else if (less_eq(seqno, acked + gap)) { 1346 /* retransmit skb */ 1347 if (time_before(jiffies, TIPC_SKB_CB(skb)->nxt_retr)) 1348 continue; 1349 TIPC_SKB_CB(skb)->nxt_retr = TIPC_UC_RETR_TIME; 1350 1351 _skb = __pskb_copy(skb, MIN_H_SIZE, GFP_ATOMIC); 1352 if (!_skb) 1353 continue; 1354 hdr = buf_msg(_skb); 1355 msg_set_ack(hdr, ack); 1356 msg_set_bcast_ack(hdr, bc_ack); 1357 _skb->priority = TC_PRIO_CONTROL; 1358 __skb_queue_tail(xmitq, _skb); 1359 l->stats.retransmitted++; 1360 } else { 1361 /* retry with Gap ACK blocks if any */ 1362 if (!ga || n >= ga->gack_cnt) 1363 break; 1364 acked = ntohs(ga->gacks[n].ack); 1365 gap = ntohs(ga->gacks[n].gap); 1366 n++; 1367 goto next_gap_ack; 1368 } 1369 } 1370 } 1371 1372 /* tipc_link_build_state_msg: prepare link state message for transmission 1373 * 1374 * Note that sending of broadcast ack is coordinated among nodes, to reduce 1375 * risk of ack storms towards the sender 1376 */ 1377 int tipc_link_build_state_msg(struct tipc_link *l, struct sk_buff_head *xmitq) 1378 { 1379 if (!l) 1380 return 0; 1381 1382 /* Broadcast ACK must be sent via a unicast link => defer to caller */ 1383 if (link_is_bc_rcvlink(l)) { 1384 if (((l->rcv_nxt ^ tipc_own_addr(l->net)) & 0xf) != 0xf) 1385 return 0; 1386 l->rcv_unacked = 0; 1387 1388 /* Use snd_nxt to store peer's snd_nxt in broadcast rcv link */ 1389 l->snd_nxt = l->rcv_nxt; 1390 return TIPC_LINK_SND_STATE; 1391 } 1392 1393 /* Unicast ACK */ 1394 l->rcv_unacked = 0; 1395 l->stats.sent_acks++; 1396 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, 0, xmitq); 1397 return 0; 1398 } 1399 1400 /* tipc_link_build_reset_msg: prepare link RESET or ACTIVATE message 1401 */ 1402 void tipc_link_build_reset_msg(struct tipc_link *l, struct sk_buff_head *xmitq) 1403 { 1404 int mtyp = RESET_MSG; 1405 struct sk_buff *skb; 1406 1407 if (l->state == LINK_ESTABLISHING) 1408 mtyp = ACTIVATE_MSG; 1409 1410 tipc_link_build_proto_msg(l, mtyp, 0, 0, 0, 0, 0, xmitq); 1411 1412 /* Inform peer that this endpoint is going down if applicable */ 1413 skb = skb_peek_tail(xmitq); 1414 if (skb && (l->state == LINK_RESET)) 1415 msg_set_peer_stopping(buf_msg(skb), 1); 1416 } 1417 1418 /* tipc_link_build_nack_msg: prepare link nack message for transmission 1419 * Note that sending of broadcast NACK is coordinated among nodes, to 1420 * reduce the risk of NACK storms towards the sender 1421 */ 1422 static int tipc_link_build_nack_msg(struct tipc_link *l, 1423 struct sk_buff_head *xmitq) 1424 { 1425 u32 def_cnt = ++l->stats.deferred_recv; 1426 u32 defq_len = skb_queue_len(&l->deferdq); 1427 int match1, match2; 1428 1429 if (link_is_bc_rcvlink(l)) { 1430 match1 = def_cnt & 0xf; 1431 match2 = tipc_own_addr(l->net) & 0xf; 1432 if (match1 == match2) 1433 return TIPC_LINK_SND_STATE; 1434 return 0; 1435 } 1436 1437 if (defq_len >= 3 && !((defq_len - 3) % 16)) 1438 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, 0, xmitq); 1439 return 0; 1440 } 1441 1442 /* tipc_link_rcv - process TIPC packets/messages arriving from off-node 1443 * @l: the link that should handle the message 1444 * @skb: TIPC packet 1445 * @xmitq: queue to place packets to be sent after this call 1446 */ 1447 int tipc_link_rcv(struct tipc_link *l, struct sk_buff *skb, 1448 struct sk_buff_head *xmitq) 1449 { 1450 struct sk_buff_head *defq = &l->deferdq; 1451 struct tipc_msg *hdr = buf_msg(skb); 1452 u16 seqno, rcv_nxt, win_lim; 1453 int rc = 0; 1454 1455 /* Verify and update link state */ 1456 if (unlikely(msg_user(hdr) == LINK_PROTOCOL)) 1457 return tipc_link_proto_rcv(l, skb, xmitq); 1458 1459 /* Don't send probe at next timeout expiration */ 1460 l->silent_intv_cnt = 0; 1461 1462 do { 1463 hdr = buf_msg(skb); 1464 seqno = msg_seqno(hdr); 1465 rcv_nxt = l->rcv_nxt; 1466 win_lim = rcv_nxt + TIPC_MAX_LINK_WIN; 1467 1468 if (unlikely(!link_is_up(l))) { 1469 if (l->state == LINK_ESTABLISHING) 1470 rc = TIPC_LINK_UP_EVT; 1471 goto drop; 1472 } 1473 1474 /* Drop if outside receive window */ 1475 if (unlikely(less(seqno, rcv_nxt) || more(seqno, win_lim))) { 1476 l->stats.duplicates++; 1477 goto drop; 1478 } 1479 1480 /* Forward queues and wake up waiting users */ 1481 if (likely(tipc_link_release_pkts(l, msg_ack(hdr)))) { 1482 l->stale_cnt = 0; 1483 tipc_link_advance_backlog(l, xmitq); 1484 if (unlikely(!skb_queue_empty(&l->wakeupq))) 1485 link_prepare_wakeup(l); 1486 } 1487 1488 /* Defer delivery if sequence gap */ 1489 if (unlikely(seqno != rcv_nxt)) { 1490 __tipc_skb_queue_sorted(defq, seqno, skb); 1491 rc |= tipc_link_build_nack_msg(l, xmitq); 1492 break; 1493 } 1494 1495 /* Deliver packet */ 1496 l->rcv_nxt++; 1497 l->stats.recv_pkts++; 1498 1499 if (unlikely(msg_user(hdr) == TUNNEL_PROTOCOL)) 1500 rc |= tipc_link_tnl_rcv(l, skb, l->inputq); 1501 else if (!tipc_data_input(l, skb, l->inputq)) 1502 rc |= tipc_link_input(l, skb, l->inputq, &l->reasm_buf); 1503 if (unlikely(++l->rcv_unacked >= TIPC_MIN_LINK_WIN)) 1504 rc |= tipc_link_build_state_msg(l, xmitq); 1505 if (unlikely(rc & ~TIPC_LINK_SND_STATE)) 1506 break; 1507 } while ((skb = __tipc_skb_dequeue(defq, l->rcv_nxt))); 1508 1509 return rc; 1510 drop: 1511 kfree_skb(skb); 1512 return rc; 1513 } 1514 1515 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe, 1516 bool probe_reply, u16 rcvgap, 1517 int tolerance, int priority, 1518 struct sk_buff_head *xmitq) 1519 { 1520 struct tipc_link *bcl = l->bc_rcvlink; 1521 struct sk_buff *skb; 1522 struct tipc_msg *hdr; 1523 struct sk_buff_head *dfq = &l->deferdq; 1524 bool node_up = link_is_up(bcl); 1525 struct tipc_mon_state *mstate = &l->mon_state; 1526 int dlen = 0; 1527 void *data; 1528 u16 glen = 0; 1529 1530 /* Don't send protocol message during reset or link failover */ 1531 if (tipc_link_is_blocked(l)) 1532 return; 1533 1534 if (!tipc_link_is_up(l) && (mtyp == STATE_MSG)) 1535 return; 1536 1537 if (!skb_queue_empty(dfq)) 1538 rcvgap = buf_seqno(skb_peek(dfq)) - l->rcv_nxt; 1539 1540 skb = tipc_msg_create(LINK_PROTOCOL, mtyp, INT_H_SIZE, 1541 tipc_max_domain_size + MAX_GAP_ACK_BLKS_SZ, 1542 l->addr, tipc_own_addr(l->net), 0, 0, 0); 1543 if (!skb) 1544 return; 1545 1546 hdr = buf_msg(skb); 1547 data = msg_data(hdr); 1548 msg_set_session(hdr, l->session); 1549 msg_set_bearer_id(hdr, l->bearer_id); 1550 msg_set_net_plane(hdr, l->net_plane); 1551 msg_set_next_sent(hdr, l->snd_nxt); 1552 msg_set_ack(hdr, l->rcv_nxt - 1); 1553 msg_set_bcast_ack(hdr, bcl->rcv_nxt - 1); 1554 msg_set_bc_ack_invalid(hdr, !node_up); 1555 msg_set_last_bcast(hdr, l->bc_sndlink->snd_nxt - 1); 1556 msg_set_link_tolerance(hdr, tolerance); 1557 msg_set_linkprio(hdr, priority); 1558 msg_set_redundant_link(hdr, node_up); 1559 msg_set_seq_gap(hdr, 0); 1560 msg_set_seqno(hdr, l->snd_nxt + U16_MAX / 2); 1561 1562 if (mtyp == STATE_MSG) { 1563 if (l->peer_caps & TIPC_LINK_PROTO_SEQNO) 1564 msg_set_seqno(hdr, l->snd_nxt_state++); 1565 msg_set_seq_gap(hdr, rcvgap); 1566 msg_set_bc_gap(hdr, link_bc_rcv_gap(bcl)); 1567 msg_set_probe(hdr, probe); 1568 msg_set_is_keepalive(hdr, probe || probe_reply); 1569 if (l->peer_caps & TIPC_GAP_ACK_BLOCK) 1570 glen = tipc_build_gap_ack_blks(l, data); 1571 tipc_mon_prep(l->net, data + glen, &dlen, mstate, l->bearer_id); 1572 msg_set_size(hdr, INT_H_SIZE + glen + dlen); 1573 skb_trim(skb, INT_H_SIZE + glen + dlen); 1574 l->stats.sent_states++; 1575 l->rcv_unacked = 0; 1576 } else { 1577 /* RESET_MSG or ACTIVATE_MSG */ 1578 if (mtyp == ACTIVATE_MSG) { 1579 msg_set_dest_session_valid(hdr, 1); 1580 msg_set_dest_session(hdr, l->peer_session); 1581 } 1582 msg_set_max_pkt(hdr, l->advertised_mtu); 1583 strcpy(data, l->if_name); 1584 msg_set_size(hdr, INT_H_SIZE + TIPC_MAX_IF_NAME); 1585 skb_trim(skb, INT_H_SIZE + TIPC_MAX_IF_NAME); 1586 } 1587 if (probe) 1588 l->stats.sent_probes++; 1589 if (rcvgap) 1590 l->stats.sent_nacks++; 1591 skb->priority = TC_PRIO_CONTROL; 1592 __skb_queue_tail(xmitq, skb); 1593 trace_tipc_proto_build(skb, false, l->name); 1594 } 1595 1596 void tipc_link_create_dummy_tnl_msg(struct tipc_link *l, 1597 struct sk_buff_head *xmitq) 1598 { 1599 u32 onode = tipc_own_addr(l->net); 1600 struct tipc_msg *hdr, *ihdr; 1601 struct sk_buff_head tnlq; 1602 struct sk_buff *skb; 1603 u32 dnode = l->addr; 1604 1605 skb_queue_head_init(&tnlq); 1606 skb = tipc_msg_create(TUNNEL_PROTOCOL, FAILOVER_MSG, 1607 INT_H_SIZE, BASIC_H_SIZE, 1608 dnode, onode, 0, 0, 0); 1609 if (!skb) { 1610 pr_warn("%sunable to create tunnel packet\n", link_co_err); 1611 return; 1612 } 1613 1614 hdr = buf_msg(skb); 1615 msg_set_msgcnt(hdr, 1); 1616 msg_set_bearer_id(hdr, l->peer_bearer_id); 1617 1618 ihdr = (struct tipc_msg *)msg_data(hdr); 1619 tipc_msg_init(onode, ihdr, TIPC_LOW_IMPORTANCE, TIPC_DIRECT_MSG, 1620 BASIC_H_SIZE, dnode); 1621 msg_set_errcode(ihdr, TIPC_ERR_NO_PORT); 1622 __skb_queue_tail(&tnlq, skb); 1623 tipc_link_xmit(l, &tnlq, xmitq); 1624 } 1625 1626 /* tipc_link_tnl_prepare(): prepare and return a list of tunnel packets 1627 * with contents of the link's transmit and backlog queues. 1628 */ 1629 void tipc_link_tnl_prepare(struct tipc_link *l, struct tipc_link *tnl, 1630 int mtyp, struct sk_buff_head *xmitq) 1631 { 1632 struct sk_buff_head *fdefq = &tnl->failover_deferdq; 1633 struct sk_buff *skb, *tnlskb; 1634 struct tipc_msg *hdr, tnlhdr; 1635 struct sk_buff_head *queue = &l->transmq; 1636 struct sk_buff_head tmpxq, tnlq; 1637 u16 pktlen, pktcnt, seqno = l->snd_nxt; 1638 1639 if (!tnl) 1640 return; 1641 1642 skb_queue_head_init(&tnlq); 1643 skb_queue_head_init(&tmpxq); 1644 1645 /* At least one packet required for safe algorithm => add dummy */ 1646 skb = tipc_msg_create(TIPC_LOW_IMPORTANCE, TIPC_DIRECT_MSG, 1647 BASIC_H_SIZE, 0, l->addr, tipc_own_addr(l->net), 1648 0, 0, TIPC_ERR_NO_PORT); 1649 if (!skb) { 1650 pr_warn("%sunable to create tunnel packet\n", link_co_err); 1651 return; 1652 } 1653 skb_queue_tail(&tnlq, skb); 1654 tipc_link_xmit(l, &tnlq, &tmpxq); 1655 __skb_queue_purge(&tmpxq); 1656 1657 /* Initialize reusable tunnel packet header */ 1658 tipc_msg_init(tipc_own_addr(l->net), &tnlhdr, TUNNEL_PROTOCOL, 1659 mtyp, INT_H_SIZE, l->addr); 1660 if (mtyp == SYNCH_MSG) 1661 pktcnt = l->snd_nxt - buf_seqno(skb_peek(&l->transmq)); 1662 else 1663 pktcnt = skb_queue_len(&l->transmq); 1664 pktcnt += skb_queue_len(&l->backlogq); 1665 msg_set_msgcnt(&tnlhdr, pktcnt); 1666 msg_set_bearer_id(&tnlhdr, l->peer_bearer_id); 1667 tnl: 1668 /* Wrap each packet into a tunnel packet */ 1669 skb_queue_walk(queue, skb) { 1670 hdr = buf_msg(skb); 1671 if (queue == &l->backlogq) 1672 msg_set_seqno(hdr, seqno++); 1673 pktlen = msg_size(hdr); 1674 msg_set_size(&tnlhdr, pktlen + INT_H_SIZE); 1675 tnlskb = tipc_buf_acquire(pktlen + INT_H_SIZE, GFP_ATOMIC); 1676 if (!tnlskb) { 1677 pr_warn("%sunable to send packet\n", link_co_err); 1678 return; 1679 } 1680 skb_copy_to_linear_data(tnlskb, &tnlhdr, INT_H_SIZE); 1681 skb_copy_to_linear_data_offset(tnlskb, INT_H_SIZE, hdr, pktlen); 1682 __skb_queue_tail(&tnlq, tnlskb); 1683 } 1684 if (queue != &l->backlogq) { 1685 queue = &l->backlogq; 1686 goto tnl; 1687 } 1688 1689 tipc_link_xmit(tnl, &tnlq, xmitq); 1690 1691 if (mtyp == FAILOVER_MSG) { 1692 tnl->drop_point = l->rcv_nxt; 1693 tnl->failover_reasm_skb = l->reasm_buf; 1694 l->reasm_buf = NULL; 1695 1696 /* Failover the link's deferdq */ 1697 if (unlikely(!skb_queue_empty(fdefq))) { 1698 pr_warn("Link failover deferdq not empty: %d!\n", 1699 skb_queue_len(fdefq)); 1700 __skb_queue_purge(fdefq); 1701 } 1702 skb_queue_splice_init(&l->deferdq, fdefq); 1703 } 1704 } 1705 1706 /* tipc_link_validate_msg(): validate message against current link state 1707 * Returns true if message should be accepted, otherwise false 1708 */ 1709 bool tipc_link_validate_msg(struct tipc_link *l, struct tipc_msg *hdr) 1710 { 1711 u16 curr_session = l->peer_session; 1712 u16 session = msg_session(hdr); 1713 int mtyp = msg_type(hdr); 1714 1715 if (msg_user(hdr) != LINK_PROTOCOL) 1716 return true; 1717 1718 switch (mtyp) { 1719 case RESET_MSG: 1720 if (!l->in_session) 1721 return true; 1722 /* Accept only RESET with new session number */ 1723 return more(session, curr_session); 1724 case ACTIVATE_MSG: 1725 if (!l->in_session) 1726 return true; 1727 /* Accept only ACTIVATE with new or current session number */ 1728 return !less(session, curr_session); 1729 case STATE_MSG: 1730 /* Accept only STATE with current session number */ 1731 if (!l->in_session) 1732 return false; 1733 if (session != curr_session) 1734 return false; 1735 /* Extra sanity check */ 1736 if (!link_is_up(l) && msg_ack(hdr)) 1737 return false; 1738 if (!(l->peer_caps & TIPC_LINK_PROTO_SEQNO)) 1739 return true; 1740 /* Accept only STATE with new sequence number */ 1741 return !less(msg_seqno(hdr), l->rcv_nxt_state); 1742 default: 1743 return false; 1744 } 1745 } 1746 1747 /* tipc_link_proto_rcv(): receive link level protocol message : 1748 * Note that network plane id propagates through the network, and may 1749 * change at any time. The node with lowest numerical id determines 1750 * network plane 1751 */ 1752 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb, 1753 struct sk_buff_head *xmitq) 1754 { 1755 struct tipc_msg *hdr = buf_msg(skb); 1756 struct tipc_gap_ack_blks *ga = NULL; 1757 u16 rcvgap = 0; 1758 u16 ack = msg_ack(hdr); 1759 u16 gap = msg_seq_gap(hdr); 1760 u16 peers_snd_nxt = msg_next_sent(hdr); 1761 u16 peers_tol = msg_link_tolerance(hdr); 1762 u16 peers_prio = msg_linkprio(hdr); 1763 u16 rcv_nxt = l->rcv_nxt; 1764 u16 dlen = msg_data_sz(hdr); 1765 int mtyp = msg_type(hdr); 1766 bool reply = msg_probe(hdr); 1767 u16 glen = 0; 1768 void *data; 1769 char *if_name; 1770 int rc = 0; 1771 1772 trace_tipc_proto_rcv(skb, false, l->name); 1773 if (tipc_link_is_blocked(l) || !xmitq) 1774 goto exit; 1775 1776 if (tipc_own_addr(l->net) > msg_prevnode(hdr)) 1777 l->net_plane = msg_net_plane(hdr); 1778 1779 skb_linearize(skb); 1780 hdr = buf_msg(skb); 1781 data = msg_data(hdr); 1782 1783 if (!tipc_link_validate_msg(l, hdr)) { 1784 trace_tipc_skb_dump(skb, false, "PROTO invalid (1)!"); 1785 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "PROTO invalid (1)!"); 1786 goto exit; 1787 } 1788 1789 switch (mtyp) { 1790 case RESET_MSG: 1791 case ACTIVATE_MSG: 1792 /* Complete own link name with peer's interface name */ 1793 if_name = strrchr(l->name, ':') + 1; 1794 if (sizeof(l->name) - (if_name - l->name) <= TIPC_MAX_IF_NAME) 1795 break; 1796 if (msg_data_sz(hdr) < TIPC_MAX_IF_NAME) 1797 break; 1798 strncpy(if_name, data, TIPC_MAX_IF_NAME); 1799 1800 /* Update own tolerance if peer indicates a non-zero value */ 1801 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL)) { 1802 l->tolerance = peers_tol; 1803 l->bc_rcvlink->tolerance = peers_tol; 1804 } 1805 /* Update own priority if peer's priority is higher */ 1806 if (in_range(peers_prio, l->priority + 1, TIPC_MAX_LINK_PRI)) 1807 l->priority = peers_prio; 1808 1809 /* If peer is going down we want full re-establish cycle */ 1810 if (msg_peer_stopping(hdr)) { 1811 rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT); 1812 break; 1813 } 1814 1815 /* If this endpoint was re-created while peer was ESTABLISHING 1816 * it doesn't know current session number. Force re-synch. 1817 */ 1818 if (mtyp == ACTIVATE_MSG && msg_dest_session_valid(hdr) && 1819 l->session != msg_dest_session(hdr)) { 1820 if (less(l->session, msg_dest_session(hdr))) 1821 l->session = msg_dest_session(hdr) + 1; 1822 break; 1823 } 1824 1825 /* ACTIVATE_MSG serves as PEER_RESET if link is already down */ 1826 if (mtyp == RESET_MSG || !link_is_up(l)) 1827 rc = tipc_link_fsm_evt(l, LINK_PEER_RESET_EVT); 1828 1829 /* ACTIVATE_MSG takes up link if it was already locally reset */ 1830 if (mtyp == ACTIVATE_MSG && l->state == LINK_ESTABLISHING) 1831 rc = TIPC_LINK_UP_EVT; 1832 1833 l->peer_session = msg_session(hdr); 1834 l->in_session = true; 1835 l->peer_bearer_id = msg_bearer_id(hdr); 1836 if (l->mtu > msg_max_pkt(hdr)) 1837 l->mtu = msg_max_pkt(hdr); 1838 break; 1839 1840 case STATE_MSG: 1841 l->rcv_nxt_state = msg_seqno(hdr) + 1; 1842 1843 /* Update own tolerance if peer indicates a non-zero value */ 1844 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL)) { 1845 l->tolerance = peers_tol; 1846 l->bc_rcvlink->tolerance = peers_tol; 1847 } 1848 /* Update own prio if peer indicates a different value */ 1849 if ((peers_prio != l->priority) && 1850 in_range(peers_prio, 1, TIPC_MAX_LINK_PRI)) { 1851 l->priority = peers_prio; 1852 rc = tipc_link_fsm_evt(l, LINK_FAILURE_EVT); 1853 } 1854 1855 l->silent_intv_cnt = 0; 1856 l->stats.recv_states++; 1857 if (msg_probe(hdr)) 1858 l->stats.recv_probes++; 1859 1860 if (!link_is_up(l)) { 1861 if (l->state == LINK_ESTABLISHING) 1862 rc = TIPC_LINK_UP_EVT; 1863 break; 1864 } 1865 1866 /* Receive Gap ACK blocks from peer if any */ 1867 if (l->peer_caps & TIPC_GAP_ACK_BLOCK) { 1868 ga = (struct tipc_gap_ack_blks *)data; 1869 glen = ntohs(ga->len); 1870 /* sanity check: if failed, ignore Gap ACK blocks */ 1871 if (glen != tipc_gap_ack_blks_sz(ga->gack_cnt)) 1872 ga = NULL; 1873 } 1874 1875 tipc_mon_rcv(l->net, data + glen, dlen - glen, l->addr, 1876 &l->mon_state, l->bearer_id); 1877 1878 /* Send NACK if peer has sent pkts we haven't received yet */ 1879 if (more(peers_snd_nxt, rcv_nxt) && !tipc_link_is_synching(l)) 1880 rcvgap = peers_snd_nxt - l->rcv_nxt; 1881 if (rcvgap || reply) 1882 tipc_link_build_proto_msg(l, STATE_MSG, 0, reply, 1883 rcvgap, 0, 0, xmitq); 1884 1885 tipc_link_advance_transmq(l, ack, gap, ga, xmitq); 1886 1887 /* If NACK, retransmit will now start at right position */ 1888 if (gap) 1889 l->stats.recv_nacks++; 1890 1891 tipc_link_advance_backlog(l, xmitq); 1892 if (unlikely(!skb_queue_empty(&l->wakeupq))) 1893 link_prepare_wakeup(l); 1894 } 1895 exit: 1896 kfree_skb(skb); 1897 return rc; 1898 } 1899 1900 /* tipc_link_build_bc_proto_msg() - create broadcast protocol message 1901 */ 1902 static bool tipc_link_build_bc_proto_msg(struct tipc_link *l, bool bcast, 1903 u16 peers_snd_nxt, 1904 struct sk_buff_head *xmitq) 1905 { 1906 struct sk_buff *skb; 1907 struct tipc_msg *hdr; 1908 struct sk_buff *dfrd_skb = skb_peek(&l->deferdq); 1909 u16 ack = l->rcv_nxt - 1; 1910 u16 gap_to = peers_snd_nxt - 1; 1911 1912 skb = tipc_msg_create(BCAST_PROTOCOL, STATE_MSG, INT_H_SIZE, 1913 0, l->addr, tipc_own_addr(l->net), 0, 0, 0); 1914 if (!skb) 1915 return false; 1916 hdr = buf_msg(skb); 1917 msg_set_last_bcast(hdr, l->bc_sndlink->snd_nxt - 1); 1918 msg_set_bcast_ack(hdr, ack); 1919 msg_set_bcgap_after(hdr, ack); 1920 if (dfrd_skb) 1921 gap_to = buf_seqno(dfrd_skb) - 1; 1922 msg_set_bcgap_to(hdr, gap_to); 1923 msg_set_non_seq(hdr, bcast); 1924 __skb_queue_tail(xmitq, skb); 1925 return true; 1926 } 1927 1928 /* tipc_link_build_bc_init_msg() - synchronize broadcast link endpoints. 1929 * 1930 * Give a newly added peer node the sequence number where it should 1931 * start receiving and acking broadcast packets. 1932 */ 1933 static void tipc_link_build_bc_init_msg(struct tipc_link *l, 1934 struct sk_buff_head *xmitq) 1935 { 1936 struct sk_buff_head list; 1937 1938 __skb_queue_head_init(&list); 1939 if (!tipc_link_build_bc_proto_msg(l->bc_rcvlink, false, 0, &list)) 1940 return; 1941 msg_set_bc_ack_invalid(buf_msg(skb_peek(&list)), true); 1942 tipc_link_xmit(l, &list, xmitq); 1943 } 1944 1945 /* tipc_link_bc_init_rcv - receive initial broadcast synch data from peer 1946 */ 1947 void tipc_link_bc_init_rcv(struct tipc_link *l, struct tipc_msg *hdr) 1948 { 1949 int mtyp = msg_type(hdr); 1950 u16 peers_snd_nxt = msg_bc_snd_nxt(hdr); 1951 1952 if (link_is_up(l)) 1953 return; 1954 1955 if (msg_user(hdr) == BCAST_PROTOCOL) { 1956 l->rcv_nxt = peers_snd_nxt; 1957 l->state = LINK_ESTABLISHED; 1958 return; 1959 } 1960 1961 if (l->peer_caps & TIPC_BCAST_SYNCH) 1962 return; 1963 1964 if (msg_peer_node_is_up(hdr)) 1965 return; 1966 1967 /* Compatibility: accept older, less safe initial synch data */ 1968 if ((mtyp == RESET_MSG) || (mtyp == ACTIVATE_MSG)) 1969 l->rcv_nxt = peers_snd_nxt; 1970 } 1971 1972 /* tipc_link_bc_sync_rcv - update rcv link according to peer's send state 1973 */ 1974 int tipc_link_bc_sync_rcv(struct tipc_link *l, struct tipc_msg *hdr, 1975 struct sk_buff_head *xmitq) 1976 { 1977 struct tipc_link *snd_l = l->bc_sndlink; 1978 u16 peers_snd_nxt = msg_bc_snd_nxt(hdr); 1979 u16 from = msg_bcast_ack(hdr) + 1; 1980 u16 to = from + msg_bc_gap(hdr) - 1; 1981 int rc = 0; 1982 1983 if (!link_is_up(l)) 1984 return rc; 1985 1986 if (!msg_peer_node_is_up(hdr)) 1987 return rc; 1988 1989 /* Open when peer ackowledges our bcast init msg (pkt #1) */ 1990 if (msg_ack(hdr)) 1991 l->bc_peer_is_up = true; 1992 1993 if (!l->bc_peer_is_up) 1994 return rc; 1995 1996 l->stats.recv_nacks++; 1997 1998 /* Ignore if peers_snd_nxt goes beyond receive window */ 1999 if (more(peers_snd_nxt, l->rcv_nxt + l->window)) 2000 return rc; 2001 2002 rc = tipc_link_retrans(snd_l, l, from, to, xmitq); 2003 2004 l->snd_nxt = peers_snd_nxt; 2005 if (link_bc_rcv_gap(l)) 2006 rc |= TIPC_LINK_SND_STATE; 2007 2008 /* Return now if sender supports nack via STATE messages */ 2009 if (l->peer_caps & TIPC_BCAST_STATE_NACK) 2010 return rc; 2011 2012 /* Otherwise, be backwards compatible */ 2013 2014 if (!more(peers_snd_nxt, l->rcv_nxt)) { 2015 l->nack_state = BC_NACK_SND_CONDITIONAL; 2016 return 0; 2017 } 2018 2019 /* Don't NACK if one was recently sent or peeked */ 2020 if (l->nack_state == BC_NACK_SND_SUPPRESS) { 2021 l->nack_state = BC_NACK_SND_UNCONDITIONAL; 2022 return 0; 2023 } 2024 2025 /* Conditionally delay NACK sending until next synch rcv */ 2026 if (l->nack_state == BC_NACK_SND_CONDITIONAL) { 2027 l->nack_state = BC_NACK_SND_UNCONDITIONAL; 2028 if ((peers_snd_nxt - l->rcv_nxt) < TIPC_MIN_LINK_WIN) 2029 return 0; 2030 } 2031 2032 /* Send NACK now but suppress next one */ 2033 tipc_link_build_bc_proto_msg(l, true, peers_snd_nxt, xmitq); 2034 l->nack_state = BC_NACK_SND_SUPPRESS; 2035 return 0; 2036 } 2037 2038 void tipc_link_bc_ack_rcv(struct tipc_link *l, u16 acked, 2039 struct sk_buff_head *xmitq) 2040 { 2041 struct sk_buff *skb, *tmp; 2042 struct tipc_link *snd_l = l->bc_sndlink; 2043 2044 if (!link_is_up(l) || !l->bc_peer_is_up) 2045 return; 2046 2047 if (!more(acked, l->acked)) 2048 return; 2049 2050 trace_tipc_link_bc_ack(l, l->acked, acked, &snd_l->transmq); 2051 /* Skip over packets peer has already acked */ 2052 skb_queue_walk(&snd_l->transmq, skb) { 2053 if (more(buf_seqno(skb), l->acked)) 2054 break; 2055 } 2056 2057 /* Update/release the packets peer is acking now */ 2058 skb_queue_walk_from_safe(&snd_l->transmq, skb, tmp) { 2059 if (more(buf_seqno(skb), acked)) 2060 break; 2061 if (!--TIPC_SKB_CB(skb)->ackers) { 2062 __skb_unlink(skb, &snd_l->transmq); 2063 kfree_skb(skb); 2064 } 2065 } 2066 l->acked = acked; 2067 tipc_link_advance_backlog(snd_l, xmitq); 2068 if (unlikely(!skb_queue_empty(&snd_l->wakeupq))) 2069 link_prepare_wakeup(snd_l); 2070 } 2071 2072 /* tipc_link_bc_nack_rcv(): receive broadcast nack message 2073 * This function is here for backwards compatibility, since 2074 * no BCAST_PROTOCOL/STATE messages occur from TIPC v2.5. 2075 */ 2076 int tipc_link_bc_nack_rcv(struct tipc_link *l, struct sk_buff *skb, 2077 struct sk_buff_head *xmitq) 2078 { 2079 struct tipc_msg *hdr = buf_msg(skb); 2080 u32 dnode = msg_destnode(hdr); 2081 int mtyp = msg_type(hdr); 2082 u16 acked = msg_bcast_ack(hdr); 2083 u16 from = acked + 1; 2084 u16 to = msg_bcgap_to(hdr); 2085 u16 peers_snd_nxt = to + 1; 2086 int rc = 0; 2087 2088 kfree_skb(skb); 2089 2090 if (!tipc_link_is_up(l) || !l->bc_peer_is_up) 2091 return 0; 2092 2093 if (mtyp != STATE_MSG) 2094 return 0; 2095 2096 if (dnode == tipc_own_addr(l->net)) { 2097 tipc_link_bc_ack_rcv(l, acked, xmitq); 2098 rc = tipc_link_retrans(l->bc_sndlink, l, from, to, xmitq); 2099 l->stats.recv_nacks++; 2100 return rc; 2101 } 2102 2103 /* Msg for other node => suppress own NACK at next sync if applicable */ 2104 if (more(peers_snd_nxt, l->rcv_nxt) && !less(l->rcv_nxt, from)) 2105 l->nack_state = BC_NACK_SND_SUPPRESS; 2106 2107 return 0; 2108 } 2109 2110 void tipc_link_set_queue_limits(struct tipc_link *l, u32 win) 2111 { 2112 int max_bulk = TIPC_MAX_PUBL / (l->mtu / ITEM_SIZE); 2113 2114 l->window = win; 2115 l->backlog[TIPC_LOW_IMPORTANCE].limit = max_t(u16, 50, win); 2116 l->backlog[TIPC_MEDIUM_IMPORTANCE].limit = max_t(u16, 100, win * 2); 2117 l->backlog[TIPC_HIGH_IMPORTANCE].limit = max_t(u16, 150, win * 3); 2118 l->backlog[TIPC_CRITICAL_IMPORTANCE].limit = max_t(u16, 200, win * 4); 2119 l->backlog[TIPC_SYSTEM_IMPORTANCE].limit = max_bulk; 2120 } 2121 2122 /** 2123 * link_reset_stats - reset link statistics 2124 * @l: pointer to link 2125 */ 2126 void tipc_link_reset_stats(struct tipc_link *l) 2127 { 2128 memset(&l->stats, 0, sizeof(l->stats)); 2129 } 2130 2131 static void link_print(struct tipc_link *l, const char *str) 2132 { 2133 struct sk_buff *hskb = skb_peek(&l->transmq); 2134 u16 head = hskb ? msg_seqno(buf_msg(hskb)) : l->snd_nxt - 1; 2135 u16 tail = l->snd_nxt - 1; 2136 2137 pr_info("%s Link <%s> state %x\n", str, l->name, l->state); 2138 pr_info("XMTQ: %u [%u-%u], BKLGQ: %u, SNDNX: %u, RCVNX: %u\n", 2139 skb_queue_len(&l->transmq), head, tail, 2140 skb_queue_len(&l->backlogq), l->snd_nxt, l->rcv_nxt); 2141 } 2142 2143 /* Parse and validate nested (link) properties valid for media, bearer and link 2144 */ 2145 int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[]) 2146 { 2147 int err; 2148 2149 err = nla_parse_nested(props, TIPC_NLA_PROP_MAX, prop, 2150 tipc_nl_prop_policy, NULL); 2151 if (err) 2152 return err; 2153 2154 if (props[TIPC_NLA_PROP_PRIO]) { 2155 u32 prio; 2156 2157 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]); 2158 if (prio > TIPC_MAX_LINK_PRI) 2159 return -EINVAL; 2160 } 2161 2162 if (props[TIPC_NLA_PROP_TOL]) { 2163 u32 tol; 2164 2165 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]); 2166 if ((tol < TIPC_MIN_LINK_TOL) || (tol > TIPC_MAX_LINK_TOL)) 2167 return -EINVAL; 2168 } 2169 2170 if (props[TIPC_NLA_PROP_WIN]) { 2171 u32 win; 2172 2173 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]); 2174 if ((win < TIPC_MIN_LINK_WIN) || (win > TIPC_MAX_LINK_WIN)) 2175 return -EINVAL; 2176 } 2177 2178 return 0; 2179 } 2180 2181 static int __tipc_nl_add_stats(struct sk_buff *skb, struct tipc_stats *s) 2182 { 2183 int i; 2184 struct nlattr *stats; 2185 2186 struct nla_map { 2187 u32 key; 2188 u32 val; 2189 }; 2190 2191 struct nla_map map[] = { 2192 {TIPC_NLA_STATS_RX_INFO, 0}, 2193 {TIPC_NLA_STATS_RX_FRAGMENTS, s->recv_fragments}, 2194 {TIPC_NLA_STATS_RX_FRAGMENTED, s->recv_fragmented}, 2195 {TIPC_NLA_STATS_RX_BUNDLES, s->recv_bundles}, 2196 {TIPC_NLA_STATS_RX_BUNDLED, s->recv_bundled}, 2197 {TIPC_NLA_STATS_TX_INFO, 0}, 2198 {TIPC_NLA_STATS_TX_FRAGMENTS, s->sent_fragments}, 2199 {TIPC_NLA_STATS_TX_FRAGMENTED, s->sent_fragmented}, 2200 {TIPC_NLA_STATS_TX_BUNDLES, s->sent_bundles}, 2201 {TIPC_NLA_STATS_TX_BUNDLED, s->sent_bundled}, 2202 {TIPC_NLA_STATS_MSG_PROF_TOT, (s->msg_length_counts) ? 2203 s->msg_length_counts : 1}, 2204 {TIPC_NLA_STATS_MSG_LEN_CNT, s->msg_length_counts}, 2205 {TIPC_NLA_STATS_MSG_LEN_TOT, s->msg_lengths_total}, 2206 {TIPC_NLA_STATS_MSG_LEN_P0, s->msg_length_profile[0]}, 2207 {TIPC_NLA_STATS_MSG_LEN_P1, s->msg_length_profile[1]}, 2208 {TIPC_NLA_STATS_MSG_LEN_P2, s->msg_length_profile[2]}, 2209 {TIPC_NLA_STATS_MSG_LEN_P3, s->msg_length_profile[3]}, 2210 {TIPC_NLA_STATS_MSG_LEN_P4, s->msg_length_profile[4]}, 2211 {TIPC_NLA_STATS_MSG_LEN_P5, s->msg_length_profile[5]}, 2212 {TIPC_NLA_STATS_MSG_LEN_P6, s->msg_length_profile[6]}, 2213 {TIPC_NLA_STATS_RX_STATES, s->recv_states}, 2214 {TIPC_NLA_STATS_RX_PROBES, s->recv_probes}, 2215 {TIPC_NLA_STATS_RX_NACKS, s->recv_nacks}, 2216 {TIPC_NLA_STATS_RX_DEFERRED, s->deferred_recv}, 2217 {TIPC_NLA_STATS_TX_STATES, s->sent_states}, 2218 {TIPC_NLA_STATS_TX_PROBES, s->sent_probes}, 2219 {TIPC_NLA_STATS_TX_NACKS, s->sent_nacks}, 2220 {TIPC_NLA_STATS_TX_ACKS, s->sent_acks}, 2221 {TIPC_NLA_STATS_RETRANSMITTED, s->retransmitted}, 2222 {TIPC_NLA_STATS_DUPLICATES, s->duplicates}, 2223 {TIPC_NLA_STATS_LINK_CONGS, s->link_congs}, 2224 {TIPC_NLA_STATS_MAX_QUEUE, s->max_queue_sz}, 2225 {TIPC_NLA_STATS_AVG_QUEUE, s->queue_sz_counts ? 2226 (s->accu_queue_sz / s->queue_sz_counts) : 0} 2227 }; 2228 2229 stats = nla_nest_start(skb, TIPC_NLA_LINK_STATS); 2230 if (!stats) 2231 return -EMSGSIZE; 2232 2233 for (i = 0; i < ARRAY_SIZE(map); i++) 2234 if (nla_put_u32(skb, map[i].key, map[i].val)) 2235 goto msg_full; 2236 2237 nla_nest_end(skb, stats); 2238 2239 return 0; 2240 msg_full: 2241 nla_nest_cancel(skb, stats); 2242 2243 return -EMSGSIZE; 2244 } 2245 2246 /* Caller should hold appropriate locks to protect the link */ 2247 int __tipc_nl_add_link(struct net *net, struct tipc_nl_msg *msg, 2248 struct tipc_link *link, int nlflags) 2249 { 2250 u32 self = tipc_own_addr(net); 2251 struct nlattr *attrs; 2252 struct nlattr *prop; 2253 void *hdr; 2254 int err; 2255 2256 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family, 2257 nlflags, TIPC_NL_LINK_GET); 2258 if (!hdr) 2259 return -EMSGSIZE; 2260 2261 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK); 2262 if (!attrs) 2263 goto msg_full; 2264 2265 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, link->name)) 2266 goto attr_msg_full; 2267 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_DEST, tipc_cluster_mask(self))) 2268 goto attr_msg_full; 2269 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_MTU, link->mtu)) 2270 goto attr_msg_full; 2271 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, link->stats.recv_pkts)) 2272 goto attr_msg_full; 2273 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, link->stats.sent_pkts)) 2274 goto attr_msg_full; 2275 2276 if (tipc_link_is_up(link)) 2277 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP)) 2278 goto attr_msg_full; 2279 if (link->active) 2280 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_ACTIVE)) 2281 goto attr_msg_full; 2282 2283 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP); 2284 if (!prop) 2285 goto attr_msg_full; 2286 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority)) 2287 goto prop_msg_full; 2288 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_TOL, link->tolerance)) 2289 goto prop_msg_full; 2290 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, 2291 link->window)) 2292 goto prop_msg_full; 2293 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority)) 2294 goto prop_msg_full; 2295 nla_nest_end(msg->skb, prop); 2296 2297 err = __tipc_nl_add_stats(msg->skb, &link->stats); 2298 if (err) 2299 goto attr_msg_full; 2300 2301 nla_nest_end(msg->skb, attrs); 2302 genlmsg_end(msg->skb, hdr); 2303 2304 return 0; 2305 2306 prop_msg_full: 2307 nla_nest_cancel(msg->skb, prop); 2308 attr_msg_full: 2309 nla_nest_cancel(msg->skb, attrs); 2310 msg_full: 2311 genlmsg_cancel(msg->skb, hdr); 2312 2313 return -EMSGSIZE; 2314 } 2315 2316 static int __tipc_nl_add_bc_link_stat(struct sk_buff *skb, 2317 struct tipc_stats *stats) 2318 { 2319 int i; 2320 struct nlattr *nest; 2321 2322 struct nla_map { 2323 __u32 key; 2324 __u32 val; 2325 }; 2326 2327 struct nla_map map[] = { 2328 {TIPC_NLA_STATS_RX_INFO, stats->recv_pkts}, 2329 {TIPC_NLA_STATS_RX_FRAGMENTS, stats->recv_fragments}, 2330 {TIPC_NLA_STATS_RX_FRAGMENTED, stats->recv_fragmented}, 2331 {TIPC_NLA_STATS_RX_BUNDLES, stats->recv_bundles}, 2332 {TIPC_NLA_STATS_RX_BUNDLED, stats->recv_bundled}, 2333 {TIPC_NLA_STATS_TX_INFO, stats->sent_pkts}, 2334 {TIPC_NLA_STATS_TX_FRAGMENTS, stats->sent_fragments}, 2335 {TIPC_NLA_STATS_TX_FRAGMENTED, stats->sent_fragmented}, 2336 {TIPC_NLA_STATS_TX_BUNDLES, stats->sent_bundles}, 2337 {TIPC_NLA_STATS_TX_BUNDLED, stats->sent_bundled}, 2338 {TIPC_NLA_STATS_RX_NACKS, stats->recv_nacks}, 2339 {TIPC_NLA_STATS_RX_DEFERRED, stats->deferred_recv}, 2340 {TIPC_NLA_STATS_TX_NACKS, stats->sent_nacks}, 2341 {TIPC_NLA_STATS_TX_ACKS, stats->sent_acks}, 2342 {TIPC_NLA_STATS_RETRANSMITTED, stats->retransmitted}, 2343 {TIPC_NLA_STATS_DUPLICATES, stats->duplicates}, 2344 {TIPC_NLA_STATS_LINK_CONGS, stats->link_congs}, 2345 {TIPC_NLA_STATS_MAX_QUEUE, stats->max_queue_sz}, 2346 {TIPC_NLA_STATS_AVG_QUEUE, stats->queue_sz_counts ? 2347 (stats->accu_queue_sz / stats->queue_sz_counts) : 0} 2348 }; 2349 2350 nest = nla_nest_start(skb, TIPC_NLA_LINK_STATS); 2351 if (!nest) 2352 return -EMSGSIZE; 2353 2354 for (i = 0; i < ARRAY_SIZE(map); i++) 2355 if (nla_put_u32(skb, map[i].key, map[i].val)) 2356 goto msg_full; 2357 2358 nla_nest_end(skb, nest); 2359 2360 return 0; 2361 msg_full: 2362 nla_nest_cancel(skb, nest); 2363 2364 return -EMSGSIZE; 2365 } 2366 2367 int tipc_nl_add_bc_link(struct net *net, struct tipc_nl_msg *msg) 2368 { 2369 int err; 2370 void *hdr; 2371 struct nlattr *attrs; 2372 struct nlattr *prop; 2373 struct tipc_net *tn = net_generic(net, tipc_net_id); 2374 u32 bc_mode = tipc_bcast_get_broadcast_mode(net); 2375 u32 bc_ratio = tipc_bcast_get_broadcast_ratio(net); 2376 struct tipc_link *bcl = tn->bcl; 2377 2378 if (!bcl) 2379 return 0; 2380 2381 tipc_bcast_lock(net); 2382 2383 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family, 2384 NLM_F_MULTI, TIPC_NL_LINK_GET); 2385 if (!hdr) { 2386 tipc_bcast_unlock(net); 2387 return -EMSGSIZE; 2388 } 2389 2390 attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK); 2391 if (!attrs) 2392 goto msg_full; 2393 2394 /* The broadcast link is always up */ 2395 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP)) 2396 goto attr_msg_full; 2397 2398 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_BROADCAST)) 2399 goto attr_msg_full; 2400 if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, bcl->name)) 2401 goto attr_msg_full; 2402 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, 0)) 2403 goto attr_msg_full; 2404 if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, 0)) 2405 goto attr_msg_full; 2406 2407 prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP); 2408 if (!prop) 2409 goto attr_msg_full; 2410 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, bcl->window)) 2411 goto prop_msg_full; 2412 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_BROADCAST, bc_mode)) 2413 goto prop_msg_full; 2414 if (bc_mode & BCLINK_MODE_SEL) 2415 if (nla_put_u32(msg->skb, TIPC_NLA_PROP_BROADCAST_RATIO, 2416 bc_ratio)) 2417 goto prop_msg_full; 2418 nla_nest_end(msg->skb, prop); 2419 2420 err = __tipc_nl_add_bc_link_stat(msg->skb, &bcl->stats); 2421 if (err) 2422 goto attr_msg_full; 2423 2424 tipc_bcast_unlock(net); 2425 nla_nest_end(msg->skb, attrs); 2426 genlmsg_end(msg->skb, hdr); 2427 2428 return 0; 2429 2430 prop_msg_full: 2431 nla_nest_cancel(msg->skb, prop); 2432 attr_msg_full: 2433 nla_nest_cancel(msg->skb, attrs); 2434 msg_full: 2435 tipc_bcast_unlock(net); 2436 genlmsg_cancel(msg->skb, hdr); 2437 2438 return -EMSGSIZE; 2439 } 2440 2441 void tipc_link_set_tolerance(struct tipc_link *l, u32 tol, 2442 struct sk_buff_head *xmitq) 2443 { 2444 l->tolerance = tol; 2445 if (l->bc_rcvlink) 2446 l->bc_rcvlink->tolerance = tol; 2447 if (link_is_up(l)) 2448 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, tol, 0, xmitq); 2449 } 2450 2451 void tipc_link_set_prio(struct tipc_link *l, u32 prio, 2452 struct sk_buff_head *xmitq) 2453 { 2454 l->priority = prio; 2455 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, prio, xmitq); 2456 } 2457 2458 void tipc_link_set_abort_limit(struct tipc_link *l, u32 limit) 2459 { 2460 l->abort_limit = limit; 2461 } 2462 2463 char *tipc_link_name_ext(struct tipc_link *l, char *buf) 2464 { 2465 if (!l) 2466 scnprintf(buf, TIPC_MAX_LINK_NAME, "null"); 2467 else if (link_is_bc_sndlink(l)) 2468 scnprintf(buf, TIPC_MAX_LINK_NAME, "broadcast-sender"); 2469 else if (link_is_bc_rcvlink(l)) 2470 scnprintf(buf, TIPC_MAX_LINK_NAME, 2471 "broadcast-receiver, peer %x", l->addr); 2472 else 2473 memcpy(buf, l->name, TIPC_MAX_LINK_NAME); 2474 2475 return buf; 2476 } 2477 2478 /** 2479 * tipc_link_dump - dump TIPC link data 2480 * @l: tipc link to be dumped 2481 * @dqueues: bitmask to decide if any link queue to be dumped? 2482 * - TIPC_DUMP_NONE: don't dump link queues 2483 * - TIPC_DUMP_TRANSMQ: dump link transmq queue 2484 * - TIPC_DUMP_BACKLOGQ: dump link backlog queue 2485 * - TIPC_DUMP_DEFERDQ: dump link deferd queue 2486 * - TIPC_DUMP_INPUTQ: dump link input queue 2487 * - TIPC_DUMP_WAKEUP: dump link wakeup queue 2488 * - TIPC_DUMP_ALL: dump all the link queues above 2489 * @buf: returned buffer of dump data in format 2490 */ 2491 int tipc_link_dump(struct tipc_link *l, u16 dqueues, char *buf) 2492 { 2493 int i = 0; 2494 size_t sz = (dqueues) ? LINK_LMAX : LINK_LMIN; 2495 struct sk_buff_head *list; 2496 struct sk_buff *hskb, *tskb; 2497 u32 len; 2498 2499 if (!l) { 2500 i += scnprintf(buf, sz, "link data: (null)\n"); 2501 return i; 2502 } 2503 2504 i += scnprintf(buf, sz, "link data: %x", l->addr); 2505 i += scnprintf(buf + i, sz - i, " %x", l->state); 2506 i += scnprintf(buf + i, sz - i, " %u", l->in_session); 2507 i += scnprintf(buf + i, sz - i, " %u", l->session); 2508 i += scnprintf(buf + i, sz - i, " %u", l->peer_session); 2509 i += scnprintf(buf + i, sz - i, " %u", l->snd_nxt); 2510 i += scnprintf(buf + i, sz - i, " %u", l->rcv_nxt); 2511 i += scnprintf(buf + i, sz - i, " %u", l->snd_nxt_state); 2512 i += scnprintf(buf + i, sz - i, " %u", l->rcv_nxt_state); 2513 i += scnprintf(buf + i, sz - i, " %x", l->peer_caps); 2514 i += scnprintf(buf + i, sz - i, " %u", l->silent_intv_cnt); 2515 i += scnprintf(buf + i, sz - i, " %u", l->rst_cnt); 2516 i += scnprintf(buf + i, sz - i, " %u", l->prev_from); 2517 i += scnprintf(buf + i, sz - i, " %u", l->stale_cnt); 2518 i += scnprintf(buf + i, sz - i, " %u", l->acked); 2519 2520 list = &l->transmq; 2521 len = skb_queue_len(list); 2522 hskb = skb_peek(list); 2523 tskb = skb_peek_tail(list); 2524 i += scnprintf(buf + i, sz - i, " | %u %u %u", len, 2525 (hskb) ? msg_seqno(buf_msg(hskb)) : 0, 2526 (tskb) ? msg_seqno(buf_msg(tskb)) : 0); 2527 2528 list = &l->deferdq; 2529 len = skb_queue_len(list); 2530 hskb = skb_peek(list); 2531 tskb = skb_peek_tail(list); 2532 i += scnprintf(buf + i, sz - i, " | %u %u %u", len, 2533 (hskb) ? msg_seqno(buf_msg(hskb)) : 0, 2534 (tskb) ? msg_seqno(buf_msg(tskb)) : 0); 2535 2536 list = &l->backlogq; 2537 len = skb_queue_len(list); 2538 hskb = skb_peek(list); 2539 tskb = skb_peek_tail(list); 2540 i += scnprintf(buf + i, sz - i, " | %u %u %u", len, 2541 (hskb) ? msg_seqno(buf_msg(hskb)) : 0, 2542 (tskb) ? msg_seqno(buf_msg(tskb)) : 0); 2543 2544 list = l->inputq; 2545 len = skb_queue_len(list); 2546 hskb = skb_peek(list); 2547 tskb = skb_peek_tail(list); 2548 i += scnprintf(buf + i, sz - i, " | %u %u %u\n", len, 2549 (hskb) ? msg_seqno(buf_msg(hskb)) : 0, 2550 (tskb) ? msg_seqno(buf_msg(tskb)) : 0); 2551 2552 if (dqueues & TIPC_DUMP_TRANSMQ) { 2553 i += scnprintf(buf + i, sz - i, "transmq: "); 2554 i += tipc_list_dump(&l->transmq, false, buf + i); 2555 } 2556 if (dqueues & TIPC_DUMP_BACKLOGQ) { 2557 i += scnprintf(buf + i, sz - i, 2558 "backlogq: <%u %u %u %u %u>, ", 2559 l->backlog[TIPC_LOW_IMPORTANCE].len, 2560 l->backlog[TIPC_MEDIUM_IMPORTANCE].len, 2561 l->backlog[TIPC_HIGH_IMPORTANCE].len, 2562 l->backlog[TIPC_CRITICAL_IMPORTANCE].len, 2563 l->backlog[TIPC_SYSTEM_IMPORTANCE].len); 2564 i += tipc_list_dump(&l->backlogq, false, buf + i); 2565 } 2566 if (dqueues & TIPC_DUMP_DEFERDQ) { 2567 i += scnprintf(buf + i, sz - i, "deferdq: "); 2568 i += tipc_list_dump(&l->deferdq, false, buf + i); 2569 } 2570 if (dqueues & TIPC_DUMP_INPUTQ) { 2571 i += scnprintf(buf + i, sz - i, "inputq: "); 2572 i += tipc_list_dump(l->inputq, false, buf + i); 2573 } 2574 if (dqueues & TIPC_DUMP_WAKEUP) { 2575 i += scnprintf(buf + i, sz - i, "wakeup: "); 2576 i += tipc_list_dump(&l->wakeupq, false, buf + i); 2577 } 2578 2579 return i; 2580 } 2581