net/tipc/link.c

   1 /*
   2  * net/tipc/link.c: TIPC link code
   3  *
   4  * Copyright (c) 1996-2007, 2012-2015, 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
  46 #include <linux/pkt_sched.h>
  47
  48 /*
  49  * Error message prefixes
  50  */
  51 static const char *link_co_err = "Link tunneling error, ";
  52 static const char *link_rst_msg = "Resetting link ";
  53
  54 static const struct nla_policy tipc_nl_link_policy[TIPC_NLA_LINK_MAX + 1] = {
  55         [TIPC_NLA_LINK_UNSPEC]          = { .type = NLA_UNSPEC },
  56         [TIPC_NLA_LINK_NAME] = {
  57                 .type = NLA_STRING,
  58                 .len = TIPC_MAX_LINK_NAME
  59         },
  60         [TIPC_NLA_LINK_MTU]             = { .type = NLA_U32 },
  61         [TIPC_NLA_LINK_BROADCAST]       = { .type = NLA_FLAG },
  62         [TIPC_NLA_LINK_UP]              = { .type = NLA_FLAG },
  63         [TIPC_NLA_LINK_ACTIVE]          = { .type = NLA_FLAG },
  64         [TIPC_NLA_LINK_PROP]            = { .type = NLA_NESTED },
  65         [TIPC_NLA_LINK_STATS]           = { .type = NLA_NESTED },
  66         [TIPC_NLA_LINK_RX]              = { .type = NLA_U32 },
  67         [TIPC_NLA_LINK_TX]              = { .type = NLA_U32 }
  68 };
  69
  70 /* Properties valid for media, bearar and link */
  71 static const struct nla_policy tipc_nl_prop_policy[TIPC_NLA_PROP_MAX + 1] = {
  72         [TIPC_NLA_PROP_UNSPEC]          = { .type = NLA_UNSPEC },
  73         [TIPC_NLA_PROP_PRIO]            = { .type = NLA_U32 },
  74         [TIPC_NLA_PROP_TOL]             = { .type = NLA_U32 },
  75         [TIPC_NLA_PROP_WIN]             = { .type = NLA_U32 }
  76 };
  77
  78 /*
  79  * Interval between NACKs when packets arrive out of order
  80  */
  81 #define TIPC_NACK_INTV (TIPC_MIN_LINK_WIN * 2)
  82 /*
  83  * Out-of-range value for link session numbers
  84  */
  85 #define WILDCARD_SESSION 0x10000
  86
  87 /* Link FSM states:
  88  */
  89 enum {
  90         LINK_ESTABLISHED     = 0xe,
  91         LINK_ESTABLISHING    = 0xe  << 4,
  92         LINK_RESET           = 0x1  << 8,
  93         LINK_RESETTING       = 0x2  << 12,
  94         LINK_PEER_RESET      = 0xd  << 16,
  95         LINK_FAILINGOVER     = 0xf  << 20,
  96         LINK_SYNCHING        = 0xc  << 24
  97 };
  98
  99 /* Link FSM state checking routines
 100  */
 101 static int link_is_up(struct tipc_link *l)
 102 {
 103         return l->state & (LINK_ESTABLISHED | LINK_SYNCHING);
 104 }
 105
 106 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb,
 107                                struct sk_buff_head *xmitq);
 108 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe,
 109                                       u16 rcvgap, int tolerance, int priority,
 110                                       struct sk_buff_head *xmitq);
 111 static void link_reset_statistics(struct tipc_link *l_ptr);
 112 static void link_print(struct tipc_link *l_ptr, const char *str);
 113 static void tipc_link_sync_rcv(struct tipc_node *n, struct sk_buff *buf);
 114
 115 /*
 116  *  Simple non-static link routines (i.e. referenced outside this file)
 117  */
 118 bool tipc_link_is_up(struct tipc_link *l)
 119 {
 120         return link_is_up(l);
 121 }
 122
 123 bool tipc_link_is_reset(struct tipc_link *l)
 124 {
 125         return l->state & (LINK_RESET | LINK_FAILINGOVER | LINK_ESTABLISHING);
 126 }
 127
 128 bool tipc_link_is_synching(struct tipc_link *l)
 129 {
 130         return l->state == LINK_SYNCHING;
 131 }
 132
 133 bool tipc_link_is_failingover(struct tipc_link *l)
 134 {
 135         return l->state == LINK_FAILINGOVER;
 136 }
 137
 138 bool tipc_link_is_blocked(struct tipc_link *l)
 139 {
 140         return l->state & (LINK_RESETTING | LINK_PEER_RESET | LINK_FAILINGOVER);
 141 }
 142
 143 int tipc_link_is_active(struct tipc_link *l)
 144 {
 145         struct tipc_node *n = l->owner;
 146
 147         return (node_active_link(n, 0) == l) || (node_active_link(n, 1) == l);
 148 }
 149
 150 static u32 link_own_addr(struct tipc_link *l)
 151 {
 152         return msg_prevnode(l->pmsg);
 153 }
 154
 155 /**
 156  * tipc_link_create - create a new link
 157  * @n: pointer to associated node
 158  * @b: pointer to associated bearer
 159  * @ownnode: identity of own node
 160  * @peer: identity of peer node
 161  * @maddr: media address to be used
 162  * @inputq: queue to put messages ready for delivery
 163  * @namedq: queue to put binding table update messages ready for delivery
 164  * @link: return value, pointer to put the created link
 165  *
 166  * Returns true if link was created, otherwise false
 167  */
 168 bool tipc_link_create(struct tipc_node *n, struct tipc_bearer *b, u32 session,
 169                       u32 ownnode, u32 peer, struct tipc_media_addr *maddr,
 170                       struct sk_buff_head *inputq, struct sk_buff_head *namedq,
 171                       struct tipc_link **link)
 172 {
 173         struct tipc_link *l;
 174         struct tipc_msg *hdr;
 175         char *if_name;
 176
 177         l = kzalloc(sizeof(*l), GFP_ATOMIC);
 178         if (!l)
 179                 return false;
 180         *link = l;
 181
 182         /* Note: peer i/f name is completed by reset/activate message */
 183         if_name = strchr(b->name, ':') + 1;
 184         sprintf(l->name, "%u.%u.%u:%s-%u.%u.%u:unknown",
 185                 tipc_zone(ownnode), tipc_cluster(ownnode), tipc_node(ownnode),
 186                 if_name, tipc_zone(peer), tipc_cluster(peer), tipc_node(peer));
 187
 188         l->addr = peer;
 189         l->media_addr = maddr;
 190         l->owner = n;
 191         l->peer_session = WILDCARD_SESSION;
 192         l->bearer_id = b->identity;
 193         l->tolerance = b->tolerance;
 194         l->net_plane = b->net_plane;
 195         l->advertised_mtu = b->mtu;
 196         l->mtu = b->mtu;
 197         l->priority = b->priority;
 198         tipc_link_set_queue_limits(l, b->window);
 199         l->inputq = inputq;
 200         l->namedq = namedq;
 201         l->state = LINK_RESETTING;
 202         l->pmsg = (struct tipc_msg *)&l->proto_msg;
 203         hdr = l->pmsg;
 204         tipc_msg_init(ownnode, hdr, LINK_PROTOCOL, RESET_MSG, INT_H_SIZE, peer);
 205         msg_set_size(hdr, sizeof(l->proto_msg));
 206         msg_set_session(hdr, session);
 207         msg_set_bearer_id(hdr, l->bearer_id);
 208         strcpy((char *)msg_data(hdr), if_name);
 209         __skb_queue_head_init(&l->transmq);
 210         __skb_queue_head_init(&l->backlogq);
 211         __skb_queue_head_init(&l->deferdq);
 212         skb_queue_head_init(&l->wakeupq);
 213         skb_queue_head_init(l->inputq);
 214         return true;
 215 }
 216
 217 /* tipc_link_build_bcast_sync_msg() - synchronize broadcast link endpoints.
 218  *
 219  * Give a newly added peer node the sequence number where it should
 220  * start receiving and acking broadcast packets.
 221  */
 222 void tipc_link_build_bcast_sync_msg(struct tipc_link *l,
 223                                     struct sk_buff_head *xmitq)
 224 {
 225         struct sk_buff *skb;
 226         struct sk_buff_head list;
 227         u16 last_sent;
 228
 229         skb = tipc_msg_create(BCAST_PROTOCOL, STATE_MSG, INT_H_SIZE,
 230                               0, l->addr, link_own_addr(l), 0, 0, 0);
 231         if (!skb)
 232                 return;
 233         last_sent = tipc_bclink_get_last_sent(l->owner->net);
 234         msg_set_last_bcast(buf_msg(skb), last_sent);
 235         __skb_queue_head_init(&list);
 236         __skb_queue_tail(&list, skb);
 237         tipc_link_xmit(l, &list, xmitq);
 238 }
 239
 240 /**
 241  * tipc_link_fsm_evt - link finite state machine
 242  * @l: pointer to link
 243  * @evt: state machine event to be processed
 244  */
 245 int tipc_link_fsm_evt(struct tipc_link *l, int evt)
 246 {
 247         int rc = 0;
 248
 249         switch (l->state) {
 250         case LINK_RESETTING:
 251                 switch (evt) {
 252                 case LINK_PEER_RESET_EVT:
 253                         l->state = LINK_PEER_RESET;
 254                         break;
 255                 case LINK_RESET_EVT:
 256                         l->state = LINK_RESET;
 257                         break;
 258                 case LINK_FAILURE_EVT:
 259                 case LINK_FAILOVER_BEGIN_EVT:
 260                 case LINK_ESTABLISH_EVT:
 261                 case LINK_FAILOVER_END_EVT:
 262                 case LINK_SYNCH_BEGIN_EVT:
 263                 case LINK_SYNCH_END_EVT:
 264                 default:
 265                         goto illegal_evt;
 266                 }
 267                 break;
 268         case LINK_RESET:
 269                 switch (evt) {
 270                 case LINK_PEER_RESET_EVT:
 271                         l->state = LINK_ESTABLISHING;
 272                         break;
 273                 case LINK_FAILOVER_BEGIN_EVT:
 274                         l->state = LINK_FAILINGOVER;
 275                 case LINK_FAILURE_EVT:
 276                 case LINK_RESET_EVT:
 277                 case LINK_ESTABLISH_EVT:
 278                 case LINK_FAILOVER_END_EVT:
 279                         break;
 280                 case LINK_SYNCH_BEGIN_EVT:
 281                 case LINK_SYNCH_END_EVT:
 282                 default:
 283                         goto illegal_evt;
 284                 }
 285                 break;
 286         case LINK_PEER_RESET:
 287                 switch (evt) {
 288                 case LINK_RESET_EVT:
 289                         l->state = LINK_ESTABLISHING;
 290                         break;
 291                 case LINK_PEER_RESET_EVT:
 292                 case LINK_ESTABLISH_EVT:
 293                 case LINK_FAILURE_EVT:
 294                         break;
 295                 case LINK_SYNCH_BEGIN_EVT:
 296                 case LINK_SYNCH_END_EVT:
 297                 case LINK_FAILOVER_BEGIN_EVT:
 298                 case LINK_FAILOVER_END_EVT:
 299                 default:
 300                         goto illegal_evt;
 301                 }
 302                 break;
 303         case LINK_FAILINGOVER:
 304                 switch (evt) {
 305                 case LINK_FAILOVER_END_EVT:
 306                         l->state = LINK_RESET;
 307                         break;
 308                 case LINK_PEER_RESET_EVT:
 309                 case LINK_RESET_EVT:
 310                 case LINK_ESTABLISH_EVT:
 311                 case LINK_FAILURE_EVT:
 312                         break;
 313                 case LINK_FAILOVER_BEGIN_EVT:
 314                 case LINK_SYNCH_BEGIN_EVT:
 315                 case LINK_SYNCH_END_EVT:
 316                 default:
 317                         goto illegal_evt;
 318                 }
 319                 break;
 320         case LINK_ESTABLISHING:
 321                 switch (evt) {
 322                 case LINK_ESTABLISH_EVT:
 323                         l->state = LINK_ESTABLISHED;
 324                         rc |= TIPC_LINK_UP_EVT;
 325                         break;
 326                 case LINK_FAILOVER_BEGIN_EVT:
 327                         l->state = LINK_FAILINGOVER;
 328                         break;
 329                 case LINK_PEER_RESET_EVT:
 330                 case LINK_RESET_EVT:
 331                 case LINK_FAILURE_EVT:
 332                 case LINK_SYNCH_BEGIN_EVT:
 333                 case LINK_FAILOVER_END_EVT:
 334                         break;
 335                 case LINK_SYNCH_END_EVT:
 336                 default:
 337                         goto illegal_evt;
 338                 }
 339                 break;
 340         case LINK_ESTABLISHED:
 341                 switch (evt) {
 342                 case LINK_PEER_RESET_EVT:
 343                         l->state = LINK_PEER_RESET;
 344                         rc |= TIPC_LINK_DOWN_EVT;
 345                         break;
 346                 case LINK_FAILURE_EVT:
 347                         l->state = LINK_RESETTING;
 348                         rc |= TIPC_LINK_DOWN_EVT;
 349                         break;
 350                 case LINK_RESET_EVT:
 351                         l->state = LINK_RESET;
 352                         break;
 353                 case LINK_ESTABLISH_EVT:
 354                 case LINK_SYNCH_END_EVT:
 355                         break;
 356                 case LINK_SYNCH_BEGIN_EVT:
 357                         l->state = LINK_SYNCHING;
 358                         break;
 359                 case LINK_FAILOVER_BEGIN_EVT:
 360                 case LINK_FAILOVER_END_EVT:
 361                 default:
 362                         goto illegal_evt;
 363                 }
 364                 break;
 365         case LINK_SYNCHING:
 366                 switch (evt) {
 367                 case LINK_PEER_RESET_EVT:
 368                         l->state = LINK_PEER_RESET;
 369                         rc |= TIPC_LINK_DOWN_EVT;
 370                         break;
 371                 case LINK_FAILURE_EVT:
 372                         l->state = LINK_RESETTING;
 373                         rc |= TIPC_LINK_DOWN_EVT;
 374                         break;
 375                 case LINK_RESET_EVT:
 376                         l->state = LINK_RESET;
 377                         break;
 378                 case LINK_ESTABLISH_EVT:
 379                 case LINK_SYNCH_BEGIN_EVT:
 380                         break;
 381                 case LINK_SYNCH_END_EVT:
 382                         l->state = LINK_ESTABLISHED;
 383                         break;
 384                 case LINK_FAILOVER_BEGIN_EVT:
 385                 case LINK_FAILOVER_END_EVT:
 386                 default:
 387                         goto illegal_evt;
 388                 }
 389                 break;
 390         default:
 391                 pr_err("Unknown FSM state %x in %s\n", l->state, l->name);
 392         }
 393         return rc;
 394 illegal_evt:
 395         pr_err("Illegal FSM event %x in state %x on link %s\n",
 396                evt, l->state, l->name);
 397         return rc;
 398 }
 399
 400 /* link_profile_stats - update statistical profiling of traffic
 401  */
 402 static void link_profile_stats(struct tipc_link *l)
 403 {
 404         struct sk_buff *skb;
 405         struct tipc_msg *msg;
 406         int length;
 407
 408         /* Update counters used in statistical profiling of send traffic */
 409         l->stats.accu_queue_sz += skb_queue_len(&l->transmq);
 410         l->stats.queue_sz_counts++;
 411
 412         skb = skb_peek(&l->transmq);
 413         if (!skb)
 414                 return;
 415         msg = buf_msg(skb);
 416         length = msg_size(msg);
 417
 418         if (msg_user(msg) == MSG_FRAGMENTER) {
 419                 if (msg_type(msg) != FIRST_FRAGMENT)
 420                         return;
 421                 length = msg_size(msg_get_wrapped(msg));
 422         }
 423         l->stats.msg_lengths_total += length;
 424         l->stats.msg_length_counts++;
 425         if (length <= 64)
 426                 l->stats.msg_length_profile[0]++;
 427         else if (length <= 256)
 428                 l->stats.msg_length_profile[1]++;
 429         else if (length <= 1024)
 430                 l->stats.msg_length_profile[2]++;
 431         else if (length <= 4096)
 432                 l->stats.msg_length_profile[3]++;
 433         else if (length <= 16384)
 434                 l->stats.msg_length_profile[4]++;
 435         else if (length <= 32768)
 436                 l->stats.msg_length_profile[5]++;
 437         else
 438                 l->stats.msg_length_profile[6]++;
 439 }
 440
 441 /* tipc_link_timeout - perform periodic task as instructed from node timeout
 442  */
 443 int tipc_link_timeout(struct tipc_link *l, struct sk_buff_head *xmitq)
 444 {
 445         int rc = 0;
 446         int mtyp = STATE_MSG;
 447         bool xmit = false;
 448         bool prb = false;
 449
 450         link_profile_stats(l);
 451
 452         switch (l->state) {
 453         case LINK_ESTABLISHED:
 454         case LINK_SYNCHING:
 455                 if (!l->silent_intv_cnt) {
 456                         if (tipc_bclink_acks_missing(l->owner))
 457                                 xmit = true;
 458                 } else if (l->silent_intv_cnt <= l->abort_limit) {
 459                         xmit = true;
 460                         prb = true;
 461                 } else {
 462                         rc |= tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
 463                 }
 464                 l->silent_intv_cnt++;
 465                 break;
 466         case LINK_RESET:
 467                 xmit = true;
 468                 mtyp = RESET_MSG;
 469                 break;
 470         case LINK_ESTABLISHING:
 471                 xmit = true;
 472                 mtyp = ACTIVATE_MSG;
 473                 break;
 474         case LINK_PEER_RESET:
 475         case LINK_RESETTING:
 476         case LINK_FAILINGOVER:
 477                 break;
 478         default:
 479                 break;
 480         }
 481
 482         if (xmit)
 483                 tipc_link_build_proto_msg(l, mtyp, prb, 0, 0, 0, xmitq);
 484
 485         return rc;
 486 }
 487
 488 /**
 489  * link_schedule_user - schedule a message sender for wakeup after congestion
 490  * @link: congested link
 491  * @list: message that was attempted sent
 492  * Create pseudo msg to send back to user when congestion abates
 493  * Does not consume buffer list
 494  */
 495 static int link_schedule_user(struct tipc_link *link, struct sk_buff_head *list)
 496 {
 497         struct tipc_msg *msg = buf_msg(skb_peek(list));
 498         int imp = msg_importance(msg);
 499         u32 oport = msg_origport(msg);
 500         u32 addr = link_own_addr(link);
 501         struct sk_buff *skb;
 502
 503         /* This really cannot happen...  */
 504         if (unlikely(imp > TIPC_CRITICAL_IMPORTANCE)) {
 505                 pr_warn("%s<%s>, send queue full", link_rst_msg, link->name);
 506                 return -ENOBUFS;
 507         }
 508         /* Non-blocking sender: */
 509         if (TIPC_SKB_CB(skb_peek(list))->wakeup_pending)
 510                 return -ELINKCONG;
 511
 512         /* Create and schedule wakeup pseudo message */
 513         skb = tipc_msg_create(SOCK_WAKEUP, 0, INT_H_SIZE, 0,
 514                               addr, addr, oport, 0, 0);
 515         if (!skb)
 516                 return -ENOBUFS;
 517         TIPC_SKB_CB(skb)->chain_sz = skb_queue_len(list);
 518         TIPC_SKB_CB(skb)->chain_imp = imp;
 519         skb_queue_tail(&link->wakeupq, skb);
 520         link->stats.link_congs++;
 521         return -ELINKCONG;
 522 }
 523
 524 /**
 525  * link_prepare_wakeup - prepare users for wakeup after congestion
 526  * @link: congested link
 527  * Move a number of waiting users, as permitted by available space in
 528  * the send queue, from link wait queue to node wait queue for wakeup
 529  */
 530 void link_prepare_wakeup(struct tipc_link *l)
 531 {
 532         int pnd[TIPC_SYSTEM_IMPORTANCE + 1] = {0,};
 533         int imp, lim;
 534         struct sk_buff *skb, *tmp;
 535
 536         skb_queue_walk_safe(&l->wakeupq, skb, tmp) {
 537                 imp = TIPC_SKB_CB(skb)->chain_imp;
 538                 lim = l->window + l->backlog[imp].limit;
 539                 pnd[imp] += TIPC_SKB_CB(skb)->chain_sz;
 540                 if ((pnd[imp] + l->backlog[imp].len) >= lim)
 541                         break;
 542                 skb_unlink(skb, &l->wakeupq);
 543                 skb_queue_tail(l->inputq, skb);
 544         }
 545 }
 546
 547 /**
 548  * tipc_link_reset_fragments - purge link's inbound message fragments queue
 549  * @l_ptr: pointer to link
 550  */
 551 void tipc_link_reset_fragments(struct tipc_link *l_ptr)
 552 {
 553         kfree_skb(l_ptr->reasm_buf);
 554         l_ptr->reasm_buf = NULL;
 555 }
 556
 557 void tipc_link_purge_backlog(struct tipc_link *l)
 558 {
 559         __skb_queue_purge(&l->backlogq);
 560         l->backlog[TIPC_LOW_IMPORTANCE].len = 0;
 561         l->backlog[TIPC_MEDIUM_IMPORTANCE].len = 0;
 562         l->backlog[TIPC_HIGH_IMPORTANCE].len = 0;
 563         l->backlog[TIPC_CRITICAL_IMPORTANCE].len = 0;
 564         l->backlog[TIPC_SYSTEM_IMPORTANCE].len = 0;
 565 }
 566
 567 /**
 568  * tipc_link_purge_queues - purge all pkt queues associated with link
 569  * @l_ptr: pointer to link
 570  */
 571 void tipc_link_purge_queues(struct tipc_link *l_ptr)
 572 {
 573         __skb_queue_purge(&l_ptr->deferdq);
 574         __skb_queue_purge(&l_ptr->transmq);
 575         tipc_link_purge_backlog(l_ptr);
 576         tipc_link_reset_fragments(l_ptr);
 577 }
 578
 579 void tipc_link_reset(struct tipc_link *l)
 580 {
 581         tipc_link_fsm_evt(l, LINK_RESET_EVT);
 582
 583         /* Link is down, accept any session */
 584         l->peer_session = WILDCARD_SESSION;
 585
 586         /* If peer is up, it only accepts an incremented session number */
 587         msg_set_session(l->pmsg, msg_session(l->pmsg) + 1);
 588
 589         /* Prepare for renewed mtu size negotiation */
 590         l->mtu = l->advertised_mtu;
 591
 592         /* Clean up all queues: */
 593         __skb_queue_purge(&l->transmq);
 594         __skb_queue_purge(&l->deferdq);
 595         skb_queue_splice_init(&l->wakeupq, l->inputq);
 596
 597         tipc_link_purge_backlog(l);
 598         kfree_skb(l->reasm_buf);
 599         kfree_skb(l->failover_reasm_skb);
 600         l->reasm_buf = NULL;
 601         l->failover_reasm_skb = NULL;
 602         l->rcv_unacked = 0;
 603         l->snd_nxt = 1;
 604         l->rcv_nxt = 1;
 605         l->silent_intv_cnt = 0;
 606         l->stats.recv_info = 0;
 607         l->stale_count = 0;
 608         link_reset_statistics(l);
 609 }
 610
 611 /**
 612  * __tipc_link_xmit(): same as tipc_link_xmit, but destlink is known & locked
 613  * @link: link to use
 614  * @list: chain of buffers containing message
 615  *
 616  * Consumes the buffer chain, except when returning an error code,
 617  * Returns 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS
 618  * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted
 619  */
 620 int __tipc_link_xmit(struct net *net, struct tipc_link *link,
 621                      struct sk_buff_head *list)
 622 {
 623         struct tipc_msg *msg = buf_msg(skb_peek(list));
 624         unsigned int maxwin = link->window;
 625         unsigned int i, imp = msg_importance(msg);
 626         uint mtu = link->mtu;
 627         u16 ack = mod(link->rcv_nxt - 1);
 628         u16 seqno = link->snd_nxt;
 629         u16 bc_last_in = link->owner->bclink.last_in;
 630         struct tipc_media_addr *addr = link->media_addr;
 631         struct sk_buff_head *transmq = &link->transmq;
 632         struct sk_buff_head *backlogq = &link->backlogq;
 633         struct sk_buff *skb, *bskb;
 634
 635         /* Match msg importance against this and all higher backlog limits: */
 636         for (i = imp; i <= TIPC_SYSTEM_IMPORTANCE; i++) {
 637                 if (unlikely(link->backlog[i].len >= link->backlog[i].limit))
 638                         return link_schedule_user(link, list);
 639         }
 640         if (unlikely(msg_size(msg) > mtu))
 641                 return -EMSGSIZE;
 642
 643         /* Prepare each packet for sending, and add to relevant queue: */
 644         while (skb_queue_len(list)) {
 645                 skb = skb_peek(list);
 646                 msg = buf_msg(skb);
 647                 msg_set_seqno(msg, seqno);
 648                 msg_set_ack(msg, ack);
 649                 msg_set_bcast_ack(msg, bc_last_in);
 650
 651                 if (likely(skb_queue_len(transmq) < maxwin)) {
 652                         __skb_dequeue(list);
 653                         __skb_queue_tail(transmq, skb);
 654                         tipc_bearer_send(net, link->bearer_id, skb, addr);
 655                         link->rcv_unacked = 0;
 656                         seqno++;
 657                         continue;
 658                 }
 659                 if (tipc_msg_bundle(skb_peek_tail(backlogq), msg, mtu)) {
 660                         kfree_skb(__skb_dequeue(list));
 661                         link->stats.sent_bundled++;
 662                         continue;
 663                 }
 664                 if (tipc_msg_make_bundle(&bskb, msg, mtu, link->addr)) {
 665                         kfree_skb(__skb_dequeue(list));
 666                         __skb_queue_tail(backlogq, bskb);
 667                         link->backlog[msg_importance(buf_msg(bskb))].len++;
 668                         link->stats.sent_bundled++;
 669                         link->stats.sent_bundles++;
 670                         continue;
 671                 }
 672                 link->backlog[imp].len += skb_queue_len(list);
 673                 skb_queue_splice_tail_init(list, backlogq);
 674         }
 675         link->snd_nxt = seqno;
 676         return 0;
 677 }
 678
 679 /**
 680  * tipc_link_xmit(): enqueue buffer list according to queue situation
 681  * @link: link to use
 682  * @list: chain of buffers containing message
 683  * @xmitq: returned list of packets to be sent by caller
 684  *
 685  * Consumes the buffer chain, except when returning -ELINKCONG,
 686  * since the caller then may want to make more send attempts.
 687  * Returns 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS
 688  * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted
 689  */
 690 int tipc_link_xmit(struct tipc_link *l, struct sk_buff_head *list,
 691                    struct sk_buff_head *xmitq)
 692 {
 693         struct tipc_msg *hdr = buf_msg(skb_peek(list));
 694         unsigned int maxwin = l->window;
 695         unsigned int i, imp = msg_importance(hdr);
 696         unsigned int mtu = l->mtu;
 697         u16 ack = l->rcv_nxt - 1;
 698         u16 seqno = l->snd_nxt;
 699         u16 bc_last_in = l->owner->bclink.last_in;
 700         struct sk_buff_head *transmq = &l->transmq;
 701         struct sk_buff_head *backlogq = &l->backlogq;
 702         struct sk_buff *skb, *_skb, *bskb;
 703
 704         /* Match msg importance against this and all higher backlog limits: */
 705         for (i = imp; i <= TIPC_SYSTEM_IMPORTANCE; i++) {
 706                 if (unlikely(l->backlog[i].len >= l->backlog[i].limit))
 707                         return link_schedule_user(l, list);
 708         }
 709         if (unlikely(msg_size(hdr) > mtu))
 710                 return -EMSGSIZE;
 711
 712         /* Prepare each packet for sending, and add to relevant queue: */
 713         while (skb_queue_len(list)) {
 714                 skb = skb_peek(list);
 715                 hdr = buf_msg(skb);
 716                 msg_set_seqno(hdr, seqno);
 717                 msg_set_ack(hdr, ack);
 718                 msg_set_bcast_ack(hdr, bc_last_in);
 719
 720                 if (likely(skb_queue_len(transmq) < maxwin)) {
 721                         _skb = skb_clone(skb, GFP_ATOMIC);
 722                         if (!_skb)
 723                                 return -ENOBUFS;
 724                         __skb_dequeue(list);
 725                         __skb_queue_tail(transmq, skb);
 726                         __skb_queue_tail(xmitq, _skb);
 727                         l->rcv_unacked = 0;
 728                         seqno++;
 729                         continue;
 730                 }
 731                 if (tipc_msg_bundle(skb_peek_tail(backlogq), hdr, mtu)) {
 732                         kfree_skb(__skb_dequeue(list));
 733                         l->stats.sent_bundled++;
 734                         continue;
 735                 }
 736                 if (tipc_msg_make_bundle(&bskb, hdr, mtu, l->addr)) {
 737                         kfree_skb(__skb_dequeue(list));
 738                         __skb_queue_tail(backlogq, bskb);
 739                         l->backlog[msg_importance(buf_msg(bskb))].len++;
 740                         l->stats.sent_bundled++;
 741                         l->stats.sent_bundles++;
 742                         continue;
 743                 }
 744                 l->backlog[imp].len += skb_queue_len(list);
 745                 skb_queue_splice_tail_init(list, backlogq);
 746         }
 747         l->snd_nxt = seqno;
 748         return 0;
 749 }
 750
 751 /*
 752  * tipc_link_sync_rcv - synchronize broadcast link endpoints.
 753  * Receive the sequence number where we should start receiving and
 754  * acking broadcast packets from a newly added peer node, and open
 755  * up for reception of such packets.
 756  *
 757  * Called with node locked
 758  */
 759 static void tipc_link_sync_rcv(struct tipc_node *n, struct sk_buff *buf)
 760 {
 761         struct tipc_msg *msg = buf_msg(buf);
 762
 763         n->bclink.last_sent = n->bclink.last_in = msg_last_bcast(msg);
 764         n->bclink.recv_permitted = true;
 765         kfree_skb(buf);
 766 }
 767
 768 /*
 769  * tipc_link_push_packets - push unsent packets to bearer
 770  *
 771  * Push out the unsent messages of a link where congestion
 772  * has abated. Node is locked.
 773  *
 774  * Called with node locked
 775  */
 776 void tipc_link_push_packets(struct tipc_link *link)
 777 {
 778         struct sk_buff *skb;
 779         struct tipc_msg *msg;
 780         u16 seqno = link->snd_nxt;
 781         u16 ack = mod(link->rcv_nxt - 1);
 782
 783         while (skb_queue_len(&link->transmq) < link->window) {
 784                 skb = __skb_dequeue(&link->backlogq);
 785                 if (!skb)
 786                         break;
 787                 msg = buf_msg(skb);
 788                 link->backlog[msg_importance(msg)].len--;
 789                 msg_set_ack(msg, ack);
 790                 msg_set_seqno(msg, seqno);
 791                 seqno = mod(seqno + 1);
 792                 msg_set_bcast_ack(msg, link->owner->bclink.last_in);
 793                 link->rcv_unacked = 0;
 794                 __skb_queue_tail(&link->transmq, skb);
 795                 tipc_bearer_send(link->owner->net, link->bearer_id,
 796                                  skb, link->media_addr);
 797         }
 798         link->snd_nxt = seqno;
 799 }
 800
 801 void tipc_link_advance_backlog(struct tipc_link *l, struct sk_buff_head *xmitq)
 802 {
 803         struct sk_buff *skb, *_skb;
 804         struct tipc_msg *hdr;
 805         u16 seqno = l->snd_nxt;
 806         u16 ack = l->rcv_nxt - 1;
 807
 808         while (skb_queue_len(&l->transmq) < l->window) {
 809                 skb = skb_peek(&l->backlogq);
 810                 if (!skb)
 811                         break;
 812                 _skb = skb_clone(skb, GFP_ATOMIC);
 813                 if (!_skb)
 814                         break;
 815                 __skb_dequeue(&l->backlogq);
 816                 hdr = buf_msg(skb);
 817                 l->backlog[msg_importance(hdr)].len--;
 818                 __skb_queue_tail(&l->transmq, skb);
 819                 __skb_queue_tail(xmitq, _skb);
 820                 msg_set_ack(hdr, ack);
 821                 msg_set_seqno(hdr, seqno);
 822                 msg_set_bcast_ack(hdr, l->owner->bclink.last_in);
 823                 l->rcv_unacked = 0;
 824                 seqno++;
 825         }
 826         l->snd_nxt = seqno;
 827 }
 828
 829 static void link_retransmit_failure(struct tipc_link *l_ptr,
 830                                     struct sk_buff *buf)
 831 {
 832         struct tipc_msg *msg = buf_msg(buf);
 833         struct net *net = l_ptr->owner->net;
 834
 835         pr_warn("Retransmission failure on link <%s>\n", l_ptr->name);
 836
 837         if (l_ptr->addr) {
 838                 /* Handle failure on standard link */
 839                 link_print(l_ptr, "Resetting link ");
 840                 pr_info("Failed msg: usr %u, typ %u, len %u, err %u\n",
 841                         msg_user(msg), msg_type(msg), msg_size(msg),
 842                         msg_errcode(msg));
 843                 pr_info("sqno %u, prev: %x, src: %x\n",
 844                         msg_seqno(msg), msg_prevnode(msg), msg_orignode(msg));
 845         } else {
 846                 /* Handle failure on broadcast link */
 847                 struct tipc_node *n_ptr;
 848                 char addr_string[16];
 849
 850                 pr_info("Msg seq number: %u,  ", msg_seqno(msg));
 851                 pr_cont("Outstanding acks: %lu\n",
 852                         (unsigned long) TIPC_SKB_CB(buf)->handle);
 853
 854                 n_ptr = tipc_bclink_retransmit_to(net);
 855
 856                 tipc_addr_string_fill(addr_string, n_ptr->addr);
 857                 pr_info("Broadcast link info for %s\n", addr_string);
 858                 pr_info("Reception permitted: %d,  Acked: %u\n",
 859                         n_ptr->bclink.recv_permitted,
 860                         n_ptr->bclink.acked);
 861                 pr_info("Last in: %u,  Oos state: %u,  Last sent: %u\n",
 862                         n_ptr->bclink.last_in,
 863                         n_ptr->bclink.oos_state,
 864                         n_ptr->bclink.last_sent);
 865
 866                 n_ptr->action_flags |= TIPC_BCAST_RESET;
 867                 l_ptr->stale_count = 0;
 868         }
 869 }
 870
 871 void tipc_link_retransmit(struct tipc_link *l_ptr, struct sk_buff *skb,
 872                           u32 retransmits)
 873 {
 874         struct tipc_msg *msg;
 875
 876         if (!skb)
 877                 return;
 878
 879         msg = buf_msg(skb);
 880
 881         /* Detect repeated retransmit failures */
 882         if (l_ptr->last_retransm == msg_seqno(msg)) {
 883                 if (++l_ptr->stale_count > 100) {
 884                         link_retransmit_failure(l_ptr, skb);
 885                         return;
 886                 }
 887         } else {
 888                 l_ptr->last_retransm = msg_seqno(msg);
 889                 l_ptr->stale_count = 1;
 890         }
 891
 892         skb_queue_walk_from(&l_ptr->transmq, skb) {
 893                 if (!retransmits)
 894                         break;
 895                 msg = buf_msg(skb);
 896                 msg_set_ack(msg, mod(l_ptr->rcv_nxt - 1));
 897                 msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in);
 898                 tipc_bearer_send(l_ptr->owner->net, l_ptr->bearer_id, skb,
 899                                  l_ptr->media_addr);
 900                 retransmits--;
 901                 l_ptr->stats.retransmitted++;
 902         }
 903 }
 904
 905 static int tipc_link_retransm(struct tipc_link *l, int retransm,
 906                               struct sk_buff_head *xmitq)
 907 {
 908         struct sk_buff *_skb, *skb = skb_peek(&l->transmq);
 909         struct tipc_msg *hdr;
 910
 911         if (!skb)
 912                 return 0;
 913
 914         /* Detect repeated retransmit failures on same packet */
 915         if (likely(l->last_retransm != buf_seqno(skb))) {
 916                 l->last_retransm = buf_seqno(skb);
 917                 l->stale_count = 1;
 918         } else if (++l->stale_count > 100) {
 919                 link_retransmit_failure(l, skb);
 920                 return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
 921         }
 922         skb_queue_walk(&l->transmq, skb) {
 923                 if (!retransm)
 924                         return 0;
 925                 hdr = buf_msg(skb);
 926                 _skb = __pskb_copy(skb, MIN_H_SIZE, GFP_ATOMIC);
 927                 if (!_skb)
 928                         return 0;
 929                 hdr = buf_msg(_skb);
 930                 msg_set_ack(hdr, l->rcv_nxt - 1);
 931                 msg_set_bcast_ack(hdr, l->owner->bclink.last_in);
 932                 _skb->priority = TC_PRIO_CONTROL;
 933                 __skb_queue_tail(xmitq, _skb);
 934                 retransm--;
 935                 l->stats.retransmitted++;
 936         }
 937         return 0;
 938 }
 939
 940 /* tipc_data_input - deliver data and name distr msgs to upper layer
 941  *
 942  * Consumes buffer if message is of right type
 943  * Node lock must be held
 944  */
 945 static bool tipc_data_input(struct tipc_link *link, struct sk_buff *skb,
 946                             struct sk_buff_head *inputq)
 947 {
 948         struct tipc_node *node = link->owner;
 949
 950         switch (msg_user(buf_msg(skb))) {
 951         case TIPC_LOW_IMPORTANCE:
 952         case TIPC_MEDIUM_IMPORTANCE:
 953         case TIPC_HIGH_IMPORTANCE:
 954         case TIPC_CRITICAL_IMPORTANCE:
 955         case CONN_MANAGER:
 956                 skb_queue_tail(inputq, skb);
 957                 return true;
 958         case NAME_DISTRIBUTOR:
 959                 node->bclink.recv_permitted = true;
 960                 skb_queue_tail(link->namedq, skb);
 961                 return true;
 962         case MSG_BUNDLER:
 963         case TUNNEL_PROTOCOL:
 964         case MSG_FRAGMENTER:
 965         case BCAST_PROTOCOL:
 966                 return false;
 967         default:
 968                 pr_warn("Dropping received illegal msg type\n");
 969                 kfree_skb(skb);
 970                 return false;
 971         };
 972 }
 973
 974 /* tipc_link_input - process packet that has passed link protocol check
 975  *
 976  * Consumes buffer
 977  */
 978 static int tipc_link_input(struct tipc_link *l, struct sk_buff *skb,
 979                            struct sk_buff_head *inputq)
 980 {
 981         struct tipc_node *node = l->owner;
 982         struct tipc_msg *hdr = buf_msg(skb);
 983         struct sk_buff **reasm_skb = &l->reasm_buf;
 984         struct sk_buff *iskb;
 985         struct sk_buff_head tmpq;
 986         int usr = msg_user(hdr);
 987         int rc = 0;
 988         int pos = 0;
 989         int ipos = 0;
 990
 991         if (unlikely(usr == TUNNEL_PROTOCOL)) {
 992                 if (msg_type(hdr) == SYNCH_MSG) {
 993                         __skb_queue_purge(&l->deferdq);
 994                         goto drop;
 995                 }
 996                 if (!tipc_msg_extract(skb, &iskb, &ipos))
 997                         return rc;
 998                 kfree_skb(skb);
 999                 skb = iskb;
1000                 hdr = buf_msg(skb);
1001                 if (less(msg_seqno(hdr), l->drop_point))
1002                         goto drop;
1003                 if (tipc_data_input(l, skb, inputq))
1004                         return rc;
1005                 usr = msg_user(hdr);
1006                 reasm_skb = &l->failover_reasm_skb;
1007         }
1008
1009         if (usr == MSG_BUNDLER) {
1010                 skb_queue_head_init(&tmpq);
1011                 l->stats.recv_bundles++;
1012                 l->stats.recv_bundled += msg_msgcnt(hdr);
1013                 while (tipc_msg_extract(skb, &iskb, &pos))
1014                         tipc_data_input(l, iskb, &tmpq);
1015                 tipc_skb_queue_splice_tail(&tmpq, inputq);
1016                 return 0;
1017         } else if (usr == MSG_FRAGMENTER) {
1018                 l->stats.recv_fragments++;
1019                 if (tipc_buf_append(reasm_skb, &skb)) {
1020                         l->stats.recv_fragmented++;
1021                         tipc_data_input(l, skb, inputq);
1022                 } else if (!*reasm_skb) {
1023                         return tipc_link_fsm_evt(l, LINK_FAILURE_EVT);
1024                 }
1025                 return 0;
1026         } else if (usr == BCAST_PROTOCOL) {
1027                 tipc_link_sync_rcv(node, skb);
1028                 return 0;
1029         }
1030 drop:
1031         kfree_skb(skb);
1032         return 0;
1033 }
1034
1035 static bool tipc_link_release_pkts(struct tipc_link *l, u16 acked)
1036 {
1037         bool released = false;
1038         struct sk_buff *skb, *tmp;
1039
1040         skb_queue_walk_safe(&l->transmq, skb, tmp) {
1041                 if (more(buf_seqno(skb), acked))
1042                         break;
1043                 __skb_unlink(skb, &l->transmq);
1044                 kfree_skb(skb);
1045                 released = true;
1046         }
1047         return released;
1048 }
1049
1050 /* tipc_link_build_ack_msg: prepare link acknowledge message for transmission
1051  */
1052 void tipc_link_build_ack_msg(struct tipc_link *l, struct sk_buff_head *xmitq)
1053 {
1054         l->rcv_unacked = 0;
1055         l->stats.sent_acks++;
1056         tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, xmitq);
1057 }
1058
1059 /* tipc_link_build_nack_msg: prepare link nack message for transmission
1060  */
1061 static void tipc_link_build_nack_msg(struct tipc_link *l,
1062                                      struct sk_buff_head *xmitq)
1063 {
1064         u32 def_cnt = ++l->stats.deferred_recv;
1065
1066         if ((skb_queue_len(&l->deferdq) == 1) || !(def_cnt % TIPC_NACK_INTV))
1067                 tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, xmitq);
1068 }
1069
1070 /* tipc_link_rcv - process TIPC packets/messages arriving from off-node
1071  * @l: the link that should handle the message
1072  * @skb: TIPC packet
1073  * @xmitq: queue to place packets to be sent after this call
1074  */
1075 int tipc_link_rcv(struct tipc_link *l, struct sk_buff *skb,
1076                   struct sk_buff_head *xmitq)
1077 {
1078         struct sk_buff_head *defq = &l->deferdq;
1079         struct tipc_msg *hdr;
1080         u16 seqno, rcv_nxt, win_lim;
1081         int rc = 0;
1082
1083         do {
1084                 hdr = buf_msg(skb);
1085                 seqno = msg_seqno(hdr);
1086                 rcv_nxt = l->rcv_nxt;
1087                 win_lim = rcv_nxt + TIPC_MAX_LINK_WIN;
1088
1089                 /* Verify and update link state */
1090                 if (unlikely(msg_user(hdr) == LINK_PROTOCOL))
1091                         return tipc_link_proto_rcv(l, skb, xmitq);
1092
1093                 if (unlikely(!link_is_up(l))) {
1094                         rc = tipc_link_fsm_evt(l, LINK_ESTABLISH_EVT);
1095                         if (!link_is_up(l))
1096                                 goto drop;
1097                 }
1098
1099                 /* Don't send probe at next timeout expiration */
1100                 l->silent_intv_cnt = 0;
1101
1102                 /* Drop if outside receive window */
1103                 if (unlikely(less(seqno, rcv_nxt) || more(seqno, win_lim))) {
1104                         l->stats.duplicates++;
1105                         goto drop;
1106                 }
1107
1108                 /* Forward queues and wake up waiting users */
1109                 if (likely(tipc_link_release_pkts(l, msg_ack(hdr)))) {
1110                         tipc_link_advance_backlog(l, xmitq);
1111                         if (unlikely(!skb_queue_empty(&l->wakeupq)))
1112                                 link_prepare_wakeup(l);
1113                 }
1114
1115                 /* Defer delivery if sequence gap */
1116                 if (unlikely(seqno != rcv_nxt)) {
1117                         __tipc_skb_queue_sorted(defq, seqno, skb);
1118                         tipc_link_build_nack_msg(l, xmitq);
1119                         break;
1120                 }
1121
1122                 /* Deliver packet */
1123                 l->rcv_nxt++;
1124                 l->stats.recv_info++;
1125                 if (!tipc_data_input(l, skb, l->inputq))
1126                         rc = tipc_link_input(l, skb, l->inputq);
1127                 if (unlikely(rc))
1128                         break;
1129                 if (unlikely(++l->rcv_unacked >= TIPC_MIN_LINK_WIN))
1130                         tipc_link_build_ack_msg(l, xmitq);
1131
1132         } while ((skb = __skb_dequeue(defq)));
1133
1134         return rc;
1135 drop:
1136         kfree_skb(skb);
1137         return rc;
1138 }
1139
1140 /**
1141  * tipc_link_defer_pkt - Add out-of-sequence message to deferred reception queue
1142  *
1143  * Returns increase in queue length (i.e. 0 or 1)
1144  */
1145 u32 tipc_link_defer_pkt(struct sk_buff_head *list, struct sk_buff *skb)
1146 {
1147         struct sk_buff *skb1;
1148         u16 seq_no = buf_seqno(skb);
1149
1150         /* Empty queue ? */
1151         if (skb_queue_empty(list)) {
1152                 __skb_queue_tail(list, skb);
1153                 return 1;
1154         }
1155
1156         /* Last ? */
1157         if (less(buf_seqno(skb_peek_tail(list)), seq_no)) {
1158                 __skb_queue_tail(list, skb);
1159                 return 1;
1160         }
1161
1162         /* Locate insertion point in queue, then insert; discard if duplicate */
1163         skb_queue_walk(list, skb1) {
1164                 u16 curr_seqno = buf_seqno(skb1);
1165
1166                 if (seq_no == curr_seqno) {
1167                         kfree_skb(skb);
1168                         return 0;
1169                 }
1170
1171                 if (less(seq_no, curr_seqno))
1172                         break;
1173         }
1174
1175         __skb_queue_before(list, skb1, skb);
1176         return 1;
1177 }
1178
1179 /*
1180  * Send protocol message to the other endpoint.
1181  */
1182 void tipc_link_proto_xmit(struct tipc_link *l, u32 msg_typ, int probe_msg,
1183                           u32 gap, u32 tolerance, u32 priority)
1184 {
1185         struct sk_buff *skb = NULL;
1186         struct sk_buff_head xmitq;
1187
1188         __skb_queue_head_init(&xmitq);
1189         tipc_link_build_proto_msg(l, msg_typ, probe_msg, gap,
1190                                   tolerance, priority, &xmitq);
1191         skb = __skb_dequeue(&xmitq);
1192         if (!skb)
1193                 return;
1194         tipc_bearer_send(l->owner->net, l->bearer_id, skb, l->media_addr);
1195         l->rcv_unacked = 0;
1196         kfree_skb(skb);
1197 }
1198
1199 /* tipc_link_build_proto_msg: prepare link protocol message for transmission
1200  */
1201 static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe,
1202                                       u16 rcvgap, int tolerance, int priority,
1203                                       struct sk_buff_head *xmitq)
1204 {
1205         struct sk_buff *skb = NULL;
1206         struct tipc_msg *hdr = l->pmsg;
1207         u16 snd_nxt = l->snd_nxt;
1208         u16 rcv_nxt = l->rcv_nxt;
1209         u16 rcv_last = rcv_nxt - 1;
1210         int node_up = l->owner->bclink.recv_permitted;
1211
1212         /* Don't send protocol message during reset or link failover */
1213         if (tipc_link_is_blocked(l))
1214                 return;
1215
1216         msg_set_type(hdr, mtyp);
1217         msg_set_net_plane(hdr, l->net_plane);
1218         msg_set_bcast_ack(hdr, l->owner->bclink.last_in);
1219         msg_set_last_bcast(hdr, tipc_bclink_get_last_sent(l->owner->net));
1220         msg_set_link_tolerance(hdr, tolerance);
1221         msg_set_linkprio(hdr, priority);
1222         msg_set_redundant_link(hdr, node_up);
1223         msg_set_seq_gap(hdr, 0);
1224
1225         /* Compatibility: created msg must not be in sequence with pkt flow */
1226         msg_set_seqno(hdr, snd_nxt + U16_MAX / 2);
1227
1228         if (mtyp == STATE_MSG) {
1229                 if (!tipc_link_is_up(l))
1230                         return;
1231                 msg_set_next_sent(hdr, snd_nxt);
1232
1233                 /* Override rcvgap if there are packets in deferred queue */
1234                 if (!skb_queue_empty(&l->deferdq))
1235                         rcvgap = buf_seqno(skb_peek(&l->deferdq)) - rcv_nxt;
1236                 if (rcvgap) {
1237                         msg_set_seq_gap(hdr, rcvgap);
1238                         l->stats.sent_nacks++;
1239                 }
1240                 msg_set_ack(hdr, rcv_last);
1241                 msg_set_probe(hdr, probe);
1242                 if (probe)
1243                         l->stats.sent_probes++;
1244                 l->stats.sent_states++;
1245         } else {
1246                 /* RESET_MSG or ACTIVATE_MSG */
1247                 msg_set_max_pkt(hdr, l->advertised_mtu);
1248                 msg_set_ack(hdr, l->rcv_nxt - 1);
1249                 msg_set_next_sent(hdr, 1);
1250         }
1251         skb = tipc_buf_acquire(msg_size(hdr));
1252         if (!skb)
1253                 return;
1254         skb_copy_to_linear_data(skb, hdr, msg_size(hdr));
1255         skb->priority = TC_PRIO_CONTROL;
1256         __skb_queue_tail(xmitq, skb);
1257 }
1258
1259 /* tipc_link_tnl_prepare(): prepare and return a list of tunnel packets
1260  * with contents of the link's transmit and backlog queues.
1261  */
1262 void tipc_link_tnl_prepare(struct tipc_link *l, struct tipc_link *tnl,
1263                            int mtyp, struct sk_buff_head *xmitq)
1264 {
1265         struct sk_buff *skb, *tnlskb;
1266         struct tipc_msg *hdr, tnlhdr;
1267         struct sk_buff_head *queue = &l->transmq;
1268         struct sk_buff_head tmpxq, tnlq;
1269         u16 pktlen, pktcnt, seqno = l->snd_nxt;
1270
1271         if (!tnl)
1272                 return;
1273
1274         skb_queue_head_init(&tnlq);
1275         skb_queue_head_init(&tmpxq);
1276
1277         /* At least one packet required for safe algorithm => add dummy */
1278         skb = tipc_msg_create(TIPC_LOW_IMPORTANCE, TIPC_DIRECT_MSG,
1279                               BASIC_H_SIZE, 0, l->addr, link_own_addr(l),
1280                               0, 0, TIPC_ERR_NO_PORT);
1281         if (!skb) {
1282                 pr_warn("%sunable to create tunnel packet\n", link_co_err);
1283                 return;
1284         }
1285         skb_queue_tail(&tnlq, skb);
1286         tipc_link_xmit(l, &tnlq, &tmpxq);
1287         __skb_queue_purge(&tmpxq);
1288
1289         /* Initialize reusable tunnel packet header */
1290         tipc_msg_init(link_own_addr(l), &tnlhdr, TUNNEL_PROTOCOL,
1291                       mtyp, INT_H_SIZE, l->addr);
1292         pktcnt = skb_queue_len(&l->transmq) + skb_queue_len(&l->backlogq);
1293         msg_set_msgcnt(&tnlhdr, pktcnt);
1294         msg_set_bearer_id(&tnlhdr, l->peer_bearer_id);
1295 tnl:
1296         /* Wrap each packet into a tunnel packet */
1297         skb_queue_walk(queue, skb) {
1298                 hdr = buf_msg(skb);
1299                 if (queue == &l->backlogq)
1300                         msg_set_seqno(hdr, seqno++);
1301                 pktlen = msg_size(hdr);
1302                 msg_set_size(&tnlhdr, pktlen + INT_H_SIZE);
1303                 tnlskb = tipc_buf_acquire(pktlen + INT_H_SIZE);
1304                 if (!tnlskb) {
1305                         pr_warn("%sunable to send packet\n", link_co_err);
1306                         return;
1307                 }
1308                 skb_copy_to_linear_data(tnlskb, &tnlhdr, INT_H_SIZE);
1309                 skb_copy_to_linear_data_offset(tnlskb, INT_H_SIZE, hdr, pktlen);
1310                 __skb_queue_tail(&tnlq, tnlskb);
1311         }
1312         if (queue != &l->backlogq) {
1313                 queue = &l->backlogq;
1314                 goto tnl;
1315         }
1316
1317         tipc_link_xmit(tnl, &tnlq, xmitq);
1318
1319         if (mtyp == FAILOVER_MSG) {
1320                 tnl->drop_point = l->rcv_nxt;
1321                 tnl->failover_reasm_skb = l->reasm_buf;
1322                 l->reasm_buf = NULL;
1323         }
1324 }
1325
1326 /* tipc_link_proto_rcv(): receive link level protocol message :
1327  * Note that network plane id propagates through the network, and may
1328  * change at any time. The node with lowest numerical id determines
1329  * network plane
1330  */
1331 static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb,
1332                                struct sk_buff_head *xmitq)
1333 {
1334         struct tipc_msg *hdr = buf_msg(skb);
1335         u16 rcvgap = 0;
1336         u16 nacked_gap = msg_seq_gap(hdr);
1337         u16 peers_snd_nxt =  msg_next_sent(hdr);
1338         u16 peers_tol = msg_link_tolerance(hdr);
1339         u16 peers_prio = msg_linkprio(hdr);
1340         u16 rcv_nxt = l->rcv_nxt;
1341         char *if_name;
1342         int rc = 0;
1343
1344         if (tipc_link_is_blocked(l))
1345                 goto exit;
1346
1347         if (link_own_addr(l) > msg_prevnode(hdr))
1348                 l->net_plane = msg_net_plane(hdr);
1349
1350         switch (msg_type(hdr)) {
1351         case RESET_MSG:
1352
1353                 /* Ignore duplicate RESET with old session number */
1354                 if ((less_eq(msg_session(hdr), l->peer_session)) &&
1355                     (l->peer_session != WILDCARD_SESSION))
1356                         break;
1357                 /* fall thru' */
1358
1359         case ACTIVATE_MSG:
1360
1361                 /* Complete own link name with peer's interface name */
1362                 if_name =  strrchr(l->name, ':') + 1;
1363                 if (sizeof(l->name) - (if_name - l->name) <= TIPC_MAX_IF_NAME)
1364                         break;
1365                 if (msg_data_sz(hdr) < TIPC_MAX_IF_NAME)
1366                         break;
1367                 strncpy(if_name, msg_data(hdr), TIPC_MAX_IF_NAME);
1368
1369                 /* Update own tolerance if peer indicates a non-zero value */
1370                 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL))
1371                         l->tolerance = peers_tol;
1372
1373                 /* Update own priority if peer's priority is higher */
1374                 if (in_range(peers_prio, l->priority + 1, TIPC_MAX_LINK_PRI))
1375                         l->priority = peers_prio;
1376
1377                 if (msg_type(hdr) == RESET_MSG) {
1378                         rc |= tipc_link_fsm_evt(l, LINK_PEER_RESET_EVT);
1379                 } else if (!link_is_up(l)) {
1380                         tipc_link_fsm_evt(l, LINK_PEER_RESET_EVT);
1381                         rc |= tipc_link_fsm_evt(l, LINK_ESTABLISH_EVT);
1382                 }
1383                 l->peer_session = msg_session(hdr);
1384                 l->peer_bearer_id = msg_bearer_id(hdr);
1385                 if (l->mtu > msg_max_pkt(hdr))
1386                         l->mtu = msg_max_pkt(hdr);
1387                 break;
1388
1389         case STATE_MSG:
1390
1391                 /* Update own tolerance if peer indicates a non-zero value */
1392                 if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL))
1393                         l->tolerance = peers_tol;
1394
1395                 l->silent_intv_cnt = 0;
1396                 l->stats.recv_states++;
1397                 if (msg_probe(hdr))
1398                         l->stats.recv_probes++;
1399                 rc = tipc_link_fsm_evt(l, LINK_ESTABLISH_EVT);
1400                 if (!link_is_up(l))
1401                         break;
1402
1403                 /* Send NACK if peer has sent pkts we haven't received yet */
1404                 if (more(peers_snd_nxt, rcv_nxt) && !tipc_link_is_synching(l))
1405                         rcvgap = peers_snd_nxt - l->rcv_nxt;
1406                 if (rcvgap || (msg_probe(hdr)))
1407                         tipc_link_build_proto_msg(l, STATE_MSG, 0, rcvgap,
1408                                                   0, 0, xmitq);
1409                 tipc_link_release_pkts(l, msg_ack(hdr));
1410
1411                 /* If NACK, retransmit will now start at right position */
1412                 if (nacked_gap) {
1413                         rc = tipc_link_retransm(l, nacked_gap, xmitq);
1414                         l->stats.recv_nacks++;
1415                 }
1416
1417                 tipc_link_advance_backlog(l, xmitq);
1418                 if (unlikely(!skb_queue_empty(&l->wakeupq)))
1419                         link_prepare_wakeup(l);
1420         }
1421 exit:
1422         kfree_skb(skb);
1423         return rc;
1424 }
1425
1426 void tipc_link_set_queue_limits(struct tipc_link *l, u32 win)
1427 {
1428         int max_bulk = TIPC_MAX_PUBLICATIONS / (l->mtu / ITEM_SIZE);
1429
1430         l->window = win;
1431         l->backlog[TIPC_LOW_IMPORTANCE].limit      = win / 2;
1432         l->backlog[TIPC_MEDIUM_IMPORTANCE].limit   = win;
1433         l->backlog[TIPC_HIGH_IMPORTANCE].limit     = win / 2 * 3;
1434         l->backlog[TIPC_CRITICAL_IMPORTANCE].limit = win * 2;
1435         l->backlog[TIPC_SYSTEM_IMPORTANCE].limit   = max_bulk;
1436 }
1437
1438 /* tipc_link_find_owner - locate owner node of link by link's name
1439  * @net: the applicable net namespace
1440  * @name: pointer to link name string
1441  * @bearer_id: pointer to index in 'node->links' array where the link was found.
1442  *
1443  * Returns pointer to node owning the link, or 0 if no matching link is found.
1444  */
1445 static struct tipc_node *tipc_link_find_owner(struct net *net,
1446                                               const char *link_name,
1447                                               unsigned int *bearer_id)
1448 {
1449         struct tipc_net *tn = net_generic(net, tipc_net_id);
1450         struct tipc_link *l_ptr;
1451         struct tipc_node *n_ptr;
1452         struct tipc_node *found_node = NULL;
1453         int i;
1454
1455         *bearer_id = 0;
1456         rcu_read_lock();
1457         list_for_each_entry_rcu(n_ptr, &tn->node_list, list) {
1458                 tipc_node_lock(n_ptr);
1459                 for (i = 0; i < MAX_BEARERS; i++) {
1460                         l_ptr = n_ptr->links[i].link;
1461                         if (l_ptr && !strcmp(l_ptr->name, link_name)) {
1462                                 *bearer_id = i;
1463                                 found_node = n_ptr;
1464                                 break;
1465                         }
1466                 }
1467                 tipc_node_unlock(n_ptr);
1468                 if (found_node)
1469                         break;
1470         }
1471         rcu_read_unlock();
1472
1473         return found_node;
1474 }
1475
1476 /**
1477  * link_reset_statistics - reset link statistics
1478  * @l_ptr: pointer to link
1479  */
1480 static void link_reset_statistics(struct tipc_link *l_ptr)
1481 {
1482         memset(&l_ptr->stats, 0, sizeof(l_ptr->stats));
1483         l_ptr->stats.sent_info = l_ptr->snd_nxt;
1484         l_ptr->stats.recv_info = l_ptr->rcv_nxt;
1485 }
1486
1487 static void link_print(struct tipc_link *l, const char *str)
1488 {
1489         struct sk_buff *hskb = skb_peek(&l->transmq);
1490         u16 head = hskb ? msg_seqno(buf_msg(hskb)) : l->snd_nxt;
1491         u16 tail = l->snd_nxt - 1;
1492
1493         pr_info("%s Link <%s> state %x\n", str, l->name, l->state);
1494         pr_info("XMTQ: %u [%u-%u], BKLGQ: %u, SNDNX: %u, RCVNX: %u\n",
1495                 skb_queue_len(&l->transmq), head, tail,
1496                 skb_queue_len(&l->backlogq), l->snd_nxt, l->rcv_nxt);
1497 }
1498
1499 /* Parse and validate nested (link) properties valid for media, bearer and link
1500  */
1501 int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[])
1502 {
1503         int err;
1504
1505         err = nla_parse_nested(props, TIPC_NLA_PROP_MAX, prop,
1506                                tipc_nl_prop_policy);
1507         if (err)
1508                 return err;
1509
1510         if (props[TIPC_NLA_PROP_PRIO]) {
1511                 u32 prio;
1512
1513                 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
1514                 if (prio > TIPC_MAX_LINK_PRI)
1515                         return -EINVAL;
1516         }
1517
1518         if (props[TIPC_NLA_PROP_TOL]) {
1519                 u32 tol;
1520
1521                 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
1522                 if ((tol < TIPC_MIN_LINK_TOL) || (tol > TIPC_MAX_LINK_TOL))
1523                         return -EINVAL;
1524         }
1525
1526         if (props[TIPC_NLA_PROP_WIN]) {
1527                 u32 win;
1528
1529                 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
1530                 if ((win < TIPC_MIN_LINK_WIN) || (win > TIPC_MAX_LINK_WIN))
1531                         return -EINVAL;
1532         }
1533
1534         return 0;
1535 }
1536
1537 int tipc_nl_link_set(struct sk_buff *skb, struct genl_info *info)
1538 {
1539         int err;
1540         int res = 0;
1541         int bearer_id;
1542         char *name;
1543         struct tipc_link *link;
1544         struct tipc_node *node;
1545         struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1546         struct net *net = sock_net(skb->sk);
1547
1548         if (!info->attrs[TIPC_NLA_LINK])
1549                 return -EINVAL;
1550
1551         err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1552                                info->attrs[TIPC_NLA_LINK],
1553                                tipc_nl_link_policy);
1554         if (err)
1555                 return err;
1556
1557         if (!attrs[TIPC_NLA_LINK_NAME])
1558                 return -EINVAL;
1559
1560         name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1561
1562         if (strcmp(name, tipc_bclink_name) == 0)
1563                 return tipc_nl_bc_link_set(net, attrs);
1564
1565         node = tipc_link_find_owner(net, name, &bearer_id);
1566         if (!node)
1567                 return -EINVAL;
1568
1569         tipc_node_lock(node);
1570
1571         link = node->links[bearer_id].link;
1572         if (!link) {
1573                 res = -EINVAL;
1574                 goto out;
1575         }
1576
1577         if (attrs[TIPC_NLA_LINK_PROP]) {
1578                 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
1579
1580                 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
1581                                               props);
1582                 if (err) {
1583                         res = err;
1584                         goto out;
1585                 }
1586
1587                 if (props[TIPC_NLA_PROP_TOL]) {
1588                         u32 tol;
1589
1590                         tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
1591                         link->tolerance = tol;
1592                         tipc_link_proto_xmit(link, STATE_MSG, 0, 0, tol, 0);
1593                 }
1594                 if (props[TIPC_NLA_PROP_PRIO]) {
1595                         u32 prio;
1596
1597                         prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
1598                         link->priority = prio;
1599                         tipc_link_proto_xmit(link, STATE_MSG, 0, 0, 0, prio);
1600                 }
1601                 if (props[TIPC_NLA_PROP_WIN]) {
1602                         u32 win;
1603
1604                         win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
1605                         tipc_link_set_queue_limits(link, win);
1606                 }
1607         }
1608
1609 out:
1610         tipc_node_unlock(node);
1611
1612         return res;
1613 }
1614
1615 static int __tipc_nl_add_stats(struct sk_buff *skb, struct tipc_stats *s)
1616 {
1617         int i;
1618         struct nlattr *stats;
1619
1620         struct nla_map {
1621                 u32 key;
1622                 u32 val;
1623         };
1624
1625         struct nla_map map[] = {
1626                 {TIPC_NLA_STATS_RX_INFO, s->recv_info},
1627                 {TIPC_NLA_STATS_RX_FRAGMENTS, s->recv_fragments},
1628                 {TIPC_NLA_STATS_RX_FRAGMENTED, s->recv_fragmented},
1629                 {TIPC_NLA_STATS_RX_BUNDLES, s->recv_bundles},
1630                 {TIPC_NLA_STATS_RX_BUNDLED, s->recv_bundled},
1631                 {TIPC_NLA_STATS_TX_INFO, s->sent_info},
1632                 {TIPC_NLA_STATS_TX_FRAGMENTS, s->sent_fragments},
1633                 {TIPC_NLA_STATS_TX_FRAGMENTED, s->sent_fragmented},
1634                 {TIPC_NLA_STATS_TX_BUNDLES, s->sent_bundles},
1635                 {TIPC_NLA_STATS_TX_BUNDLED, s->sent_bundled},
1636                 {TIPC_NLA_STATS_MSG_PROF_TOT, (s->msg_length_counts) ?
1637                         s->msg_length_counts : 1},
1638                 {TIPC_NLA_STATS_MSG_LEN_CNT, s->msg_length_counts},
1639                 {TIPC_NLA_STATS_MSG_LEN_TOT, s->msg_lengths_total},
1640                 {TIPC_NLA_STATS_MSG_LEN_P0, s->msg_length_profile[0]},
1641                 {TIPC_NLA_STATS_MSG_LEN_P1, s->msg_length_profile[1]},
1642                 {TIPC_NLA_STATS_MSG_LEN_P2, s->msg_length_profile[2]},
1643                 {TIPC_NLA_STATS_MSG_LEN_P3, s->msg_length_profile[3]},
1644                 {TIPC_NLA_STATS_MSG_LEN_P4, s->msg_length_profile[4]},
1645                 {TIPC_NLA_STATS_MSG_LEN_P5, s->msg_length_profile[5]},
1646                 {TIPC_NLA_STATS_MSG_LEN_P6, s->msg_length_profile[6]},
1647                 {TIPC_NLA_STATS_RX_STATES, s->recv_states},
1648                 {TIPC_NLA_STATS_RX_PROBES, s->recv_probes},
1649                 {TIPC_NLA_STATS_RX_NACKS, s->recv_nacks},
1650                 {TIPC_NLA_STATS_RX_DEFERRED, s->deferred_recv},
1651                 {TIPC_NLA_STATS_TX_STATES, s->sent_states},
1652                 {TIPC_NLA_STATS_TX_PROBES, s->sent_probes},
1653                 {TIPC_NLA_STATS_TX_NACKS, s->sent_nacks},
1654                 {TIPC_NLA_STATS_TX_ACKS, s->sent_acks},
1655                 {TIPC_NLA_STATS_RETRANSMITTED, s->retransmitted},
1656                 {TIPC_NLA_STATS_DUPLICATES, s->duplicates},
1657                 {TIPC_NLA_STATS_LINK_CONGS, s->link_congs},
1658                 {TIPC_NLA_STATS_MAX_QUEUE, s->max_queue_sz},
1659                 {TIPC_NLA_STATS_AVG_QUEUE, s->queue_sz_counts ?
1660                         (s->accu_queue_sz / s->queue_sz_counts) : 0}
1661         };
1662
1663         stats = nla_nest_start(skb, TIPC_NLA_LINK_STATS);
1664         if (!stats)
1665                 return -EMSGSIZE;
1666
1667         for (i = 0; i <  ARRAY_SIZE(map); i++)
1668                 if (nla_put_u32(skb, map[i].key, map[i].val))
1669                         goto msg_full;
1670
1671         nla_nest_end(skb, stats);
1672
1673         return 0;
1674 msg_full:
1675         nla_nest_cancel(skb, stats);
1676
1677         return -EMSGSIZE;
1678 }
1679
1680 /* Caller should hold appropriate locks to protect the link */
1681 static int __tipc_nl_add_link(struct net *net, struct tipc_nl_msg *msg,
1682                               struct tipc_link *link, int nlflags)
1683 {
1684         int err;
1685         void *hdr;
1686         struct nlattr *attrs;
1687         struct nlattr *prop;
1688         struct tipc_net *tn = net_generic(net, tipc_net_id);
1689
1690         hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1691                           nlflags, TIPC_NL_LINK_GET);
1692         if (!hdr)
1693                 return -EMSGSIZE;
1694
1695         attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK);
1696         if (!attrs)
1697                 goto msg_full;
1698
1699         if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, link->name))
1700                 goto attr_msg_full;
1701         if (nla_put_u32(msg->skb, TIPC_NLA_LINK_DEST,
1702                         tipc_cluster_mask(tn->own_addr)))
1703                 goto attr_msg_full;
1704         if (nla_put_u32(msg->skb, TIPC_NLA_LINK_MTU, link->mtu))
1705                 goto attr_msg_full;
1706         if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, link->rcv_nxt))
1707                 goto attr_msg_full;
1708         if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, link->snd_nxt))
1709                 goto attr_msg_full;
1710
1711         if (tipc_link_is_up(link))
1712                 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP))
1713                         goto attr_msg_full;
1714         if (tipc_link_is_active(link))
1715                 if (nla_put_flag(msg->skb, TIPC_NLA_LINK_ACTIVE))
1716                         goto attr_msg_full;
1717
1718         prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP);
1719         if (!prop)
1720                 goto attr_msg_full;
1721         if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
1722                 goto prop_msg_full;
1723         if (nla_put_u32(msg->skb, TIPC_NLA_PROP_TOL, link->tolerance))
1724                 goto prop_msg_full;
1725         if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN,
1726                         link->window))
1727                 goto prop_msg_full;
1728         if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority))
1729                 goto prop_msg_full;
1730         nla_nest_end(msg->skb, prop);
1731
1732         err = __tipc_nl_add_stats(msg->skb, &link->stats);
1733         if (err)
1734                 goto attr_msg_full;
1735
1736         nla_nest_end(msg->skb, attrs);
1737         genlmsg_end(msg->skb, hdr);
1738
1739         return 0;
1740
1741 prop_msg_full:
1742         nla_nest_cancel(msg->skb, prop);
1743 attr_msg_full:
1744         nla_nest_cancel(msg->skb, attrs);
1745 msg_full:
1746         genlmsg_cancel(msg->skb, hdr);
1747
1748         return -EMSGSIZE;
1749 }
1750
1751 /* Caller should hold node lock  */
1752 static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
1753                                     struct tipc_node *node, u32 *prev_link)
1754 {
1755         u32 i;
1756         int err;
1757
1758         for (i = *prev_link; i < MAX_BEARERS; i++) {
1759                 *prev_link = i;
1760
1761                 if (!node->links[i].link)
1762                         continue;
1763
1764                 err = __tipc_nl_add_link(net, msg,
1765                                          node->links[i].link, NLM_F_MULTI);
1766                 if (err)
1767                         return err;
1768         }
1769         *prev_link = 0;
1770
1771         return 0;
1772 }
1773
1774 int tipc_nl_link_dump(struct sk_buff *skb, struct netlink_callback *cb)
1775 {
1776         struct net *net = sock_net(skb->sk);
1777         struct tipc_net *tn = net_generic(net, tipc_net_id);
1778         struct tipc_node *node;
1779         struct tipc_nl_msg msg;
1780         u32 prev_node = cb->args[0];
1781         u32 prev_link = cb->args[1];
1782         int done = cb->args[2];
1783         int err;
1784
1785         if (done)
1786                 return 0;
1787
1788         msg.skb = skb;
1789         msg.portid = NETLINK_CB(cb->skb).portid;
1790         msg.seq = cb->nlh->nlmsg_seq;
1791
1792         rcu_read_lock();
1793         if (prev_node) {
1794                 node = tipc_node_find(net, prev_node);
1795                 if (!node) {
1796                         /* We never set seq or call nl_dump_check_consistent()
1797                          * this means that setting prev_seq here will cause the
1798                          * consistence check to fail in the netlink callback
1799                          * handler. Resulting in the last NLMSG_DONE message
1800                          * having the NLM_F_DUMP_INTR flag set.
1801                          */
1802                         cb->prev_seq = 1;
1803                         goto out;
1804                 }
1805                 tipc_node_put(node);
1806
1807                 list_for_each_entry_continue_rcu(node, &tn->node_list,
1808                                                  list) {
1809                         tipc_node_lock(node);
1810                         err = __tipc_nl_add_node_links(net, &msg, node,
1811                                                        &prev_link);
1812                         tipc_node_unlock(node);
1813                         if (err)
1814                                 goto out;
1815
1816                         prev_node = node->addr;
1817                 }
1818         } else {
1819                 err = tipc_nl_add_bc_link(net, &msg);
1820                 if (err)
1821                         goto out;
1822
1823                 list_for_each_entry_rcu(node, &tn->node_list, list) {
1824                         tipc_node_lock(node);
1825                         err = __tipc_nl_add_node_links(net, &msg, node,
1826                                                        &prev_link);
1827                         tipc_node_unlock(node);
1828                         if (err)
1829                                 goto out;
1830
1831                         prev_node = node->addr;
1832                 }
1833         }
1834         done = 1;
1835 out:
1836         rcu_read_unlock();
1837
1838         cb->args[0] = prev_node;
1839         cb->args[1] = prev_link;
1840         cb->args[2] = done;
1841
1842         return skb->len;
1843 }
1844
1845 int tipc_nl_link_get(struct sk_buff *skb, struct genl_info *info)
1846 {
1847         struct net *net = genl_info_net(info);
1848         struct tipc_nl_msg msg;
1849         char *name;
1850         int err;
1851
1852         msg.portid = info->snd_portid;
1853         msg.seq = info->snd_seq;
1854
1855         if (!info->attrs[TIPC_NLA_LINK_NAME])
1856                 return -EINVAL;
1857         name = nla_data(info->attrs[TIPC_NLA_LINK_NAME]);
1858
1859         msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
1860         if (!msg.skb)
1861                 return -ENOMEM;
1862
1863         if (strcmp(name, tipc_bclink_name) == 0) {
1864                 err = tipc_nl_add_bc_link(net, &msg);
1865                 if (err) {
1866                         nlmsg_free(msg.skb);
1867                         return err;
1868                 }
1869         } else {
1870                 int bearer_id;
1871                 struct tipc_node *node;
1872                 struct tipc_link *link;
1873
1874                 node = tipc_link_find_owner(net, name, &bearer_id);
1875                 if (!node)
1876                         return -EINVAL;
1877
1878                 tipc_node_lock(node);
1879                 link = node->links[bearer_id].link;
1880                 if (!link) {
1881                         tipc_node_unlock(node);
1882                         nlmsg_free(msg.skb);
1883                         return -EINVAL;
1884                 }
1885
1886                 err = __tipc_nl_add_link(net, &msg, link, 0);
1887                 tipc_node_unlock(node);
1888                 if (err) {
1889                         nlmsg_free(msg.skb);
1890                         return err;
1891                 }
1892         }
1893
1894         return genlmsg_reply(msg.skb, info);
1895 }
1896
1897 int tipc_nl_link_reset_stats(struct sk_buff *skb, struct genl_info *info)
1898 {
1899         int err;
1900         char *link_name;
1901         unsigned int bearer_id;
1902         struct tipc_link *link;
1903         struct tipc_node *node;
1904         struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1905         struct net *net = sock_net(skb->sk);
1906
1907         if (!info->attrs[TIPC_NLA_LINK])
1908                 return -EINVAL;
1909
1910         err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1911                                info->attrs[TIPC_NLA_LINK],
1912                                tipc_nl_link_policy);
1913         if (err)
1914                 return err;
1915
1916         if (!attrs[TIPC_NLA_LINK_NAME])
1917                 return -EINVAL;
1918
1919         link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1920
1921         if (strcmp(link_name, tipc_bclink_name) == 0) {
1922                 err = tipc_bclink_reset_stats(net);
1923                 if (err)
1924                         return err;
1925                 return 0;
1926         }
1927
1928         node = tipc_link_find_owner(net, link_name, &bearer_id);
1929         if (!node)
1930                 return -EINVAL;
1931
1932         tipc_node_lock(node);
1933
1934         link = node->links[bearer_id].link;
1935         if (!link) {
1936                 tipc_node_unlock(node);
1937                 return -EINVAL;
1938         }
1939
1940         link_reset_statistics(link);
1941
1942         tipc_node_unlock(node);
1943
1944         return 0;
1945 }