| 1 | |
| 2 | * net/tipc/bcast.c: TIPC broadcast code
|
| 3 | *
|
| 4 | * Copyright (c) 2004-2006, 2014-2017, Ericsson AB
|
| 5 | * Copyright (c) 2004, Intel Corporation.
|
| 6 | * Copyright (c) 2005, 2010-2011, Wind River Systems
|
| 7 | * All rights reserved.
|
| 8 | *
|
| 9 | * Redistribution and use in source and binary forms, with or without
|
| 10 | * modification, are permitted provided that the following conditions are met:
|
| 11 | *
|
| 12 | * 1. Redistributions of source code must retain the above copyright
|
| 13 | * notice, this list of conditions and the following disclaimer.
|
| 14 | * 2. Redistributions in binary form must reproduce the above copyright
|
| 15 | * notice, this list of conditions and the following disclaimer in the
|
| 16 | * documentation and/or other materials provided with the distribution.
|
| 17 | * 3. Neither the names of the copyright holders nor the names of its
|
| 18 | * contributors may be used to endorse or promote products derived from
|
| 19 | * this software without specific prior written permission.
|
| 20 | *
|
| 21 | * Alternatively, this software may be distributed under the terms of the
|
| 22 | * GNU General Public License ("GPL") version 2 as published by the Free
|
| 23 | * Software Foundation.
|
| 24 | *
|
| 25 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 26 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 27 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 28 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
| 29 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
| 30 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
| 31 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
| 32 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
| 33 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
| 34 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
| 35 | * POSSIBILITY OF SUCH DAMAGE.
|
| 36 |
|
| 37 |
|
| 38 | #include <linux/tipc_config.h>
|
| 39 | #include "socket.h"
|
| 40 | #include "msg.h"
|
| 41 | #include "bcast.h"
|
| 42 | #include "link.h"
|
| 43 | #include "name_table.h"
|
| 44 |
|
| 45 | #define BCLINK_WIN_DEFAULT 50
|
| 46 | #define BCLINK_WIN_MIN 32
|
| 47 |
|
| 48 | const char tipc_bclink_name[] = "broadcast-link";
|
| 49 | unsigned long sysctl_tipc_bc_retruni __read_mostly;
|
| 50 |
|
| 51 | |
| 52 | * struct tipc_bc_base - base structure for keeping broadcast send state
|
| 53 | * @link: broadcast send link structure
|
| 54 | * @inputq: data input queue; will only carry SOCK_WAKEUP messages
|
| 55 | * @dests: array keeping number of reachable destinations per bearer
|
| 56 | * @primary_bearer: a bearer having links to all broadcast destinations, if any
|
| 57 | * @bcast_support: indicates if primary bearer, if any, supports broadcast
|
| 58 | * @force_bcast: forces broadcast for multicast traffic
|
| 59 | * @rcast_support: indicates if all peer nodes support replicast
|
| 60 | * @force_rcast: forces replicast for multicast traffic
|
| 61 | * @rc_ratio: dest count as percentage of cluster size where send method changes
|
| 62 | * @bc_threshold: calculated from rc_ratio; if dests > threshold use broadcast
|
| 63 |
|
| 64 | struct tipc_bc_base {
|
| 65 | struct tipc_link *link;
|
| 66 | struct sk_buff_head inputq;
|
| 67 | int dests[MAX_BEARERS];
|
| 68 | int primary_bearer;
|
| 69 | bool bcast_support;
|
| 70 | bool force_bcast;
|
| 71 | bool rcast_support;
|
| 72 | bool force_rcast;
|
| 73 | int rc_ratio;
|
| 74 | int bc_threshold;
|
| 75 | };
|
| 76 |
|
| 77 | static struct tipc_bc_base *tipc_bc_base(struct net *net)
|
| 78 | {
|
| 79 | return tipc_net(net)->bcbase;
|
| 80 | }
|
| 81 |
|
| 82 | |
| 83 | * Note: the MTU is decremented to give room for a tunnel header, in
|
| 84 | * case the message needs to be sent as replicast
|
| 85 |
|
| 86 | int tipc_bcast_get_mtu(struct net *net)
|
| 87 | {
|
| 88 | return tipc_link_mss(tipc_bc_sndlink(net));
|
| 89 | }
|
| 90 |
|
| 91 | void tipc_bcast_toggle_rcast(struct net *net, bool supp)
|
| 92 | {
|
| 93 | tipc_bc_base(net)->rcast_support = supp;
|
| 94 | }
|
| 95 |
|
| 96 | static void tipc_bcbase_calc_bc_threshold(struct net *net)
|
| 97 | {
|
| 98 | struct tipc_bc_base *bb = tipc_bc_base(net);
|
| 99 | int cluster_size = tipc_link_bc_peers(tipc_bc_sndlink(net));
|
| 100 |
|
| 101 | bb->bc_threshold = 1 + (cluster_size * bb->rc_ratio / 100);
|
| 102 | }
|
| 103 |
|
| 104 | |
| 105 | * if any, and make it primary bearer
|
| 106 |
|
| 107 | static void tipc_bcbase_select_primary(struct net *net)
|
| 108 | {
|
| 109 | struct tipc_bc_base *bb = tipc_bc_base(net);
|
| 110 | int all_dests = tipc_link_bc_peers(bb->link);
|
| 111 | int max_win = tipc_link_max_win(bb->link);
|
| 112 | int min_win = tipc_link_min_win(bb->link);
|
| 113 | int i, mtu, prim;
|
| 114 |
|
| 115 | bb->primary_bearer = INVALID_BEARER_ID;
|
| 116 | bb->bcast_support = true;
|
| 117 |
|
| 118 | if (!all_dests)
|
| 119 | return;
|
| 120 |
|
| 121 | for (i = 0; i < MAX_BEARERS; i++) {
|
| 122 | if (!bb->dests[i])
|
| 123 | continue;
|
| 124 |
|
| 125 | mtu = tipc_bearer_mtu(net, i);
|
| 126 | if (mtu < tipc_link_mtu(bb->link)) {
|
| 127 | tipc_link_set_mtu(bb->link, mtu);
|
| 128 | tipc_link_set_queue_limits(bb->link,
|
| 129 | min_win,
|
| 130 | max_win);
|
| 131 | }
|
| 132 | bb->bcast_support &= tipc_bearer_bcast_support(net, i);
|
| 133 | if (bb->dests[i] < all_dests)
|
| 134 | continue;
|
| 135 |
|
| 136 | bb->primary_bearer = i;
|
| 137 |
|
| 138 |
|
| 139 | if ((i ^ tipc_own_addr(net)) & 1)
|
| 140 | break;
|
| 141 | }
|
| 142 | prim = bb->primary_bearer;
|
| 143 | if (prim != INVALID_BEARER_ID)
|
| 144 | bb->bcast_support = tipc_bearer_bcast_support(net, prim);
|
| 145 | }
|
| 146 |
|
| 147 | void tipc_bcast_inc_bearer_dst_cnt(struct net *net, int bearer_id)
|
| 148 | {
|
| 149 | struct tipc_bc_base *bb = tipc_bc_base(net);
|
| 150 |
|
| 151 | tipc_bcast_lock(net);
|
| 152 | bb->dests[bearer_id]++;
|
| 153 | tipc_bcbase_select_primary(net);
|
| 154 | tipc_bcast_unlock(net);
|
| 155 | }
|
| 156 |
|
| 157 | void tipc_bcast_dec_bearer_dst_cnt(struct net *net, int bearer_id)
|
| 158 | {
|
| 159 | struct tipc_bc_base *bb = tipc_bc_base(net);
|
| 160 |
|
| 161 | tipc_bcast_lock(net);
|
| 162 | bb->dests[bearer_id]--;
|
| 163 | tipc_bcbase_select_primary(net);
|
| 164 | tipc_bcast_unlock(net);
|
| 165 | }
|
| 166 |
|
| 167 | |
| 168 | *
|
| 169 | * Note that number of reachable destinations, as indicated in the dests[]
|
| 170 | * array, may transitionally differ from the number of destinations indicated
|
| 171 | * in each sent buffer. We can sustain this. Excess destination nodes will
|
| 172 | * drop and never acknowledge the unexpected packets, and missing destinations
|
| 173 | * will either require retransmission (if they are just about to be added to
|
| 174 | * the bearer), or be removed from the buffer's 'ackers' counter (if they
|
| 175 | * just went down)
|
| 176 |
|
| 177 | static void tipc_bcbase_xmit(struct net *net, struct sk_buff_head *xmitq)
|
| 178 | {
|
| 179 | int bearer_id;
|
| 180 | struct tipc_bc_base *bb = tipc_bc_base(net);
|
| 181 | struct sk_buff *skb, *_skb;
|
| 182 | struct sk_buff_head _xmitq;
|
| 183 |
|
| 184 | if (skb_queue_empty(xmitq))
|
| 185 | return;
|
| 186 |
|
| 187 |
|
| 188 | bearer_id = bb->primary_bearer;
|
| 189 | if (bearer_id >= 0) {
|
| 190 | tipc_bearer_bc_xmit(net, bearer_id, xmitq);
|
| 191 | return;
|
| 192 | }
|
| 193 |
|
| 194 |
|
| 195 | __skb_queue_head_init(&_xmitq);
|
| 196 | for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
|
| 197 | if (!bb->dests[bearer_id])
|
| 198 | continue;
|
| 199 |
|
| 200 | skb_queue_walk(xmitq, skb) {
|
| 201 | _skb = pskb_copy_for_clone(skb, GFP_ATOMIC);
|
| 202 | if (!_skb)
|
| 203 | break;
|
| 204 | __skb_queue_tail(&_xmitq, _skb);
|
| 205 | }
|
| 206 | tipc_bearer_bc_xmit(net, bearer_id, &_xmitq);
|
| 207 | }
|
| 208 | __skb_queue_purge(xmitq);
|
| 209 | __skb_queue_purge(&_xmitq);
|
| 210 | }
|
| 211 |
|
| 212 | static void tipc_bcast_select_xmit_method(struct net *net, int dests,
|
| 213 | struct tipc_mc_method *method)
|
| 214 | {
|
| 215 | struct tipc_bc_base *bb = tipc_bc_base(net);
|
| 216 | unsigned long exp = method->expires;
|
| 217 |
|
| 218 |
|
| 219 | if (!bb->bcast_support) {
|
| 220 | method->rcast = true;
|
| 221 | return;
|
| 222 | }
|
| 223 |
|
| 224 | if (!bb->rcast_support) {
|
| 225 | method->rcast = false;
|
| 226 | return;
|
| 227 | }
|
| 228 |
|
| 229 | method->expires = jiffies + TIPC_METHOD_EXPIRE;
|
| 230 | if (method->mandatory)
|
| 231 | return;
|
| 232 |
|
| 233 | if (!(tipc_net(net)->capabilities & TIPC_MCAST_RBCTL) &&
|
| 234 | time_before(jiffies, exp))
|
| 235 | return;
|
| 236 |
|
| 237 |
|
| 238 | if (bb->force_bcast) {
|
| 239 | method->rcast = false;
|
| 240 | return;
|
| 241 | }
|
| 242 |
|
| 243 | if (bb->force_rcast) {
|
| 244 | method->rcast = true;
|
| 245 | return;
|
| 246 | }
|
| 247 |
|
| 248 |
|
| 249 | method->rcast = dests <= bb->bc_threshold;
|
| 250 | }
|
| 251 |
|
| 252 | |
| 253 | * @net: the applicable net namespace
|
| 254 | * @pkts: chain of buffers containing message
|
| 255 | * @cong_link_cnt: set to 1 if broadcast link is congested, otherwise 0
|
| 256 | * Consumes the buffer chain.
|
| 257 | * Returns 0 if success, otherwise errno: -EHOSTUNREACH,-EMSGSIZE
|
| 258 |
|
| 259 | int tipc_bcast_xmit(struct net *net, struct sk_buff_head *pkts,
|
| 260 | u16 *cong_link_cnt)
|
| 261 | {
|
| 262 | struct tipc_link *l = tipc_bc_sndlink(net);
|
| 263 | struct sk_buff_head xmitq;
|
| 264 | int rc = 0;
|
| 265 |
|
| 266 | __skb_queue_head_init(&xmitq);
|
| 267 | tipc_bcast_lock(net);
|
| 268 | if (tipc_link_bc_peers(l))
|
| 269 | rc = tipc_link_xmit(l, pkts, &xmitq);
|
| 270 | tipc_bcast_unlock(net);
|
| 271 | tipc_bcbase_xmit(net, &xmitq);
|
| 272 | __skb_queue_purge(pkts);
|
| 273 | if (rc == -ELINKCONG) {
|
| 274 | *cong_link_cnt = 1;
|
| 275 | rc = 0;
|
| 276 | }
|
| 277 | return rc;
|
| 278 | }
|
| 279 |
|
| 280 | |
| 281 | * @net: the applicable net namespace
|
| 282 | * @pkts: chain of buffers containing message
|
| 283 | * @dests: list of destination nodes
|
| 284 | * @cong_link_cnt: returns number of congested links
|
| 285 | * @cong_links: returns identities of congested links
|
| 286 | * Returns 0 if success, otherwise errno
|
| 287 |
|
| 288 | static int tipc_rcast_xmit(struct net *net, struct sk_buff_head *pkts,
|
| 289 | struct tipc_nlist *dests, u16 *cong_link_cnt)
|
| 290 | {
|
| 291 | struct tipc_dest *dst, *tmp;
|
| 292 | struct sk_buff_head _pkts;
|
| 293 | u32 dnode, selector;
|
| 294 |
|
| 295 | selector = msg_link_selector(buf_msg(skb_peek(pkts)));
|
| 296 | __skb_queue_head_init(&_pkts);
|
| 297 |
|
| 298 | list_for_each_entry_safe(dst, tmp, &dests->list, list) {
|
| 299 | dnode = dst->node;
|
| 300 | if (!tipc_msg_pskb_copy(dnode, pkts, &_pkts))
|
| 301 | return -ENOMEM;
|
| 302 |
|
| 303 |
|
| 304 | if (tipc_node_xmit(net, &_pkts, dnode, selector) == -ELINKCONG)
|
| 305 | (*cong_link_cnt)++;
|
| 306 | }
|
| 307 | return 0;
|
| 308 | }
|
| 309 |
|
| 310 | |
| 311 | * @net: the applicable net namespace
|
| 312 | * @skb: socket buffer to copy
|
| 313 | * @method: send method to be used
|
| 314 | * @dests: destination nodes for message.
|
| 315 | * Returns 0 if success, otherwise errno
|
| 316 |
|
| 317 | static int tipc_mcast_send_sync(struct net *net, struct sk_buff *skb,
|
| 318 | struct tipc_mc_method *method,
|
| 319 | struct tipc_nlist *dests)
|
| 320 | {
|
| 321 | struct tipc_msg *hdr, *_hdr;
|
| 322 | struct sk_buff_head tmpq;
|
| 323 | u16 cong_link_cnt = 0;
|
| 324 | struct sk_buff *_skb;
|
| 325 | int rc = 0;
|
| 326 |
|
| 327 |
|
| 328 | if (!(tipc_net(net)->capabilities & TIPC_MCAST_RBCTL))
|
| 329 | return 0;
|
| 330 |
|
| 331 | hdr = buf_msg(skb);
|
| 332 | if (msg_user(hdr) == MSG_FRAGMENTER)
|
| 333 | hdr = msg_inner_hdr(hdr);
|
| 334 | if (msg_type(hdr) != TIPC_MCAST_MSG)
|
| 335 | return 0;
|
| 336 |
|
| 337 |
|
| 338 | _skb = tipc_buf_acquire(MCAST_H_SIZE, GFP_KERNEL);
|
| 339 | if (!_skb)
|
| 340 | return -ENOMEM;
|
| 341 |
|
| 342 |
|
| 343 | msg_set_syn(hdr, 1);
|
| 344 |
|
| 345 |
|
| 346 | skb_copy_to_linear_data(_skb, hdr, MCAST_H_SIZE);
|
| 347 | skb_orphan(_skb);
|
| 348 |
|
| 349 |
|
| 350 | _hdr = buf_msg(_skb);
|
| 351 | msg_set_size(_hdr, MCAST_H_SIZE);
|
| 352 | msg_set_is_rcast(_hdr, !msg_is_rcast(hdr));
|
| 353 | msg_set_errcode(_hdr, TIPC_ERR_NO_PORT);
|
| 354 |
|
| 355 | __skb_queue_head_init(&tmpq);
|
| 356 | __skb_queue_tail(&tmpq, _skb);
|
| 357 | if (method->rcast)
|
| 358 | rc = tipc_bcast_xmit(net, &tmpq, &cong_link_cnt);
|
| 359 | else
|
| 360 | rc = tipc_rcast_xmit(net, &tmpq, dests, &cong_link_cnt);
|
| 361 |
|
| 362 |
|
| 363 | __skb_queue_purge(&tmpq);
|
| 364 |
|
| 365 | return rc;
|
| 366 | }
|
| 367 |
|
| 368 | |
| 369 | * and to identified node local sockets
|
| 370 | * @net: the applicable net namespace
|
| 371 | * @pkts: chain of buffers containing message
|
| 372 | * @method: send method to be used
|
| 373 | * @dests: destination nodes for message.
|
| 374 | * @cong_link_cnt: returns number of encountered congested destination links
|
| 375 | * Consumes buffer chain.
|
| 376 | * Returns 0 if success, otherwise errno
|
| 377 |
|
| 378 | int tipc_mcast_xmit(struct net *net, struct sk_buff_head *pkts,
|
| 379 | struct tipc_mc_method *method, struct tipc_nlist *dests,
|
| 380 | u16 *cong_link_cnt)
|
| 381 | {
|
| 382 | struct sk_buff_head inputq, localq;
|
| 383 | bool rcast = method->rcast;
|
| 384 | struct tipc_msg *hdr;
|
| 385 | struct sk_buff *skb;
|
| 386 | int rc = 0;
|
| 387 |
|
| 388 | skb_queue_head_init(&inputq);
|
| 389 | __skb_queue_head_init(&localq);
|
| 390 |
|
| 391 |
|
| 392 | if (dests->local && !tipc_msg_reassemble(pkts, &localq)) {
|
| 393 | rc = -ENOMEM;
|
| 394 | goto exit;
|
| 395 | }
|
| 396 |
|
| 397 | if (dests->remote) {
|
| 398 | tipc_bcast_select_xmit_method(net, dests->remote, method);
|
| 399 |
|
| 400 | skb = skb_peek(pkts);
|
| 401 | hdr = buf_msg(skb);
|
| 402 | if (msg_user(hdr) == MSG_FRAGMENTER)
|
| 403 | hdr = msg_inner_hdr(hdr);
|
| 404 | msg_set_is_rcast(hdr, method->rcast);
|
| 405 |
|
| 406 |
|
| 407 | if (rcast != method->rcast) {
|
| 408 | rc = tipc_mcast_send_sync(net, skb, method, dests);
|
| 409 | if (unlikely(rc)) {
|
| 410 | pr_err("Unable to send SYN: method %d, rc %d\n",
|
| 411 | rcast, rc);
|
| 412 | goto exit;
|
| 413 | }
|
| 414 | }
|
| 415 |
|
| 416 | if (method->rcast)
|
| 417 | rc = tipc_rcast_xmit(net, pkts, dests, cong_link_cnt);
|
| 418 | else
|
| 419 | rc = tipc_bcast_xmit(net, pkts, cong_link_cnt);
|
| 420 | }
|
| 421 |
|
| 422 | if (dests->local) {
|
| 423 | tipc_loopback_trace(net, &localq);
|
| 424 | tipc_sk_mcast_rcv(net, &localq, &inputq);
|
| 425 | }
|
| 426 | exit:
|
| 427 |
|
| 428 | __skb_queue_purge(pkts);
|
| 429 | return rc;
|
| 430 | }
|
| 431 |
|
| 432 | |
| 433 | *
|
| 434 | * RCU is locked, no other locks set
|
| 435 |
|
| 436 | int tipc_bcast_rcv(struct net *net, struct tipc_link *l, struct sk_buff *skb)
|
| 437 | {
|
| 438 | struct tipc_msg *hdr = buf_msg(skb);
|
| 439 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq;
|
| 440 | struct sk_buff_head xmitq;
|
| 441 | int rc;
|
| 442 |
|
| 443 | __skb_queue_head_init(&xmitq);
|
| 444 |
|
| 445 | if (msg_mc_netid(hdr) != tipc_netid(net) || !tipc_link_is_up(l)) {
|
| 446 | kfree_skb(skb);
|
| 447 | return 0;
|
| 448 | }
|
| 449 |
|
| 450 | tipc_bcast_lock(net);
|
| 451 | if (msg_user(hdr) == BCAST_PROTOCOL)
|
| 452 | rc = tipc_link_bc_nack_rcv(l, skb, &xmitq);
|
| 453 | else
|
| 454 | rc = tipc_link_rcv(l, skb, NULL);
|
| 455 | tipc_bcast_unlock(net);
|
| 456 |
|
| 457 | tipc_bcbase_xmit(net, &xmitq);
|
| 458 |
|
| 459 |
|
| 460 | if (!skb_queue_empty(inputq))
|
| 461 | tipc_sk_rcv(net, inputq);
|
| 462 |
|
| 463 | return rc;
|
| 464 | }
|
| 465 |
|
| 466 | |
| 467 | *
|
| 468 | * RCU is locked, no other locks set
|
| 469 |
|
| 470 | void tipc_bcast_ack_rcv(struct net *net, struct tipc_link *l,
|
| 471 | struct tipc_msg *hdr)
|
| 472 | {
|
| 473 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq;
|
| 474 | u16 acked = msg_bcast_ack(hdr);
|
| 475 | struct sk_buff_head xmitq;
|
| 476 |
|
| 477 |
|
| 478 | if (msg_bc_ack_invalid(hdr))
|
| 479 | return;
|
| 480 |
|
| 481 | __skb_queue_head_init(&xmitq);
|
| 482 |
|
| 483 | tipc_bcast_lock(net);
|
| 484 | tipc_link_bc_ack_rcv(l, acked, 0, NULL, &xmitq, NULL);
|
| 485 | tipc_bcast_unlock(net);
|
| 486 |
|
| 487 | tipc_bcbase_xmit(net, &xmitq);
|
| 488 |
|
| 489 |
|
| 490 | if (!skb_queue_empty(inputq))
|
| 491 | tipc_sk_rcv(net, inputq);
|
| 492 | }
|
| 493 |
|
| 494 | |
| 495 | *
|
| 496 | * RCU is locked, no other locks set
|
| 497 |
|
| 498 | int tipc_bcast_sync_rcv(struct net *net, struct tipc_link *l,
|
| 499 | struct tipc_msg *hdr,
|
| 500 | struct sk_buff_head *retrq, bool *valid)
|
| 501 | {
|
| 502 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq;
|
| 503 | struct tipc_gap_ack_blks *ga;
|
| 504 | struct sk_buff_head xmitq;
|
| 505 | int rc = 0;
|
| 506 | u16 glen;
|
| 507 |
|
| 508 | __skb_queue_head_init(&xmitq);
|
| 509 |
|
| 510 | tipc_bcast_lock(net);
|
| 511 | if (msg_type(hdr) != STATE_MSG) {
|
| 512 | tipc_link_bc_init_rcv(l, hdr);
|
| 513 | } else if (!msg_bc_ack_invalid(hdr)) {
|
| 514 | glen = tipc_get_gap_ack_blks(&ga, l, hdr, false);
|
| 515 | if (glen > msg_data_sz(hdr)) {
|
| 516 |
|
| 517 | *valid = false;
|
| 518 | } else {
|
| 519 | if (!sysctl_tipc_bc_retruni)
|
| 520 | retrq = &xmitq;
|
| 521 | rc = tipc_link_bc_ack_rcv(l, msg_bcast_ack(hdr),
|
| 522 | msg_bc_gap(hdr), ga, &xmitq,
|
| 523 | retrq);
|
| 524 | rc |= tipc_link_bc_sync_rcv(l, hdr, &xmitq);
|
| 525 | }
|
| 526 | }
|
| 527 | tipc_bcast_unlock(net);
|
| 528 |
|
| 529 | tipc_bcbase_xmit(net, &xmitq);
|
| 530 |
|
| 531 |
|
| 532 | if (!skb_queue_empty(inputq))
|
| 533 | tipc_sk_rcv(net, inputq);
|
| 534 | return rc;
|
| 535 | }
|
| 536 |
|
| 537 | |
| 538 | *
|
| 539 | * RCU is locked, node lock is set
|
| 540 |
|
| 541 | void tipc_bcast_add_peer(struct net *net, struct tipc_link *uc_l,
|
| 542 | struct sk_buff_head *xmitq)
|
| 543 | {
|
| 544 | struct tipc_link *snd_l = tipc_bc_sndlink(net);
|
| 545 |
|
| 546 | tipc_bcast_lock(net);
|
| 547 | tipc_link_add_bc_peer(snd_l, uc_l, xmitq);
|
| 548 | tipc_bcbase_select_primary(net);
|
| 549 | tipc_bcbase_calc_bc_threshold(net);
|
| 550 | tipc_bcast_unlock(net);
|
| 551 | }
|
| 552 |
|
| 553 | |
| 554 | *
|
| 555 | * RCU is locked, node lock is set
|
| 556 |
|
| 557 | void tipc_bcast_remove_peer(struct net *net, struct tipc_link *rcv_l)
|
| 558 | {
|
| 559 | struct tipc_link *snd_l = tipc_bc_sndlink(net);
|
| 560 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq;
|
| 561 | struct sk_buff_head xmitq;
|
| 562 |
|
| 563 | __skb_queue_head_init(&xmitq);
|
| 564 |
|
| 565 | tipc_bcast_lock(net);
|
| 566 | tipc_link_remove_bc_peer(snd_l, rcv_l, &xmitq);
|
| 567 | tipc_bcbase_select_primary(net);
|
| 568 | tipc_bcbase_calc_bc_threshold(net);
|
| 569 | tipc_bcast_unlock(net);
|
| 570 |
|
| 571 | tipc_bcbase_xmit(net, &xmitq);
|
| 572 |
|
| 573 |
|
| 574 | if (!skb_queue_empty(inputq))
|
| 575 | tipc_sk_rcv(net, inputq);
|
| 576 | }
|
| 577 |
|
| 578 | int tipc_bclink_reset_stats(struct net *net, struct tipc_link *l)
|
| 579 | {
|
| 580 | if (!l)
|
| 581 | return -ENOPROTOOPT;
|
| 582 |
|
| 583 | tipc_bcast_lock(net);
|
| 584 | tipc_link_reset_stats(l);
|
| 585 | tipc_bcast_unlock(net);
|
| 586 | return 0;
|
| 587 | }
|
| 588 |
|
| 589 | static int tipc_bc_link_set_queue_limits(struct net *net, u32 max_win)
|
| 590 | {
|
| 591 | struct tipc_link *l = tipc_bc_sndlink(net);
|
| 592 |
|
| 593 | if (!l)
|
| 594 | return -ENOPROTOOPT;
|
| 595 | if (max_win < BCLINK_WIN_MIN)
|
| 596 | max_win = BCLINK_WIN_MIN;
|
| 597 | if (max_win > TIPC_MAX_LINK_WIN)
|
| 598 | return -EINVAL;
|
| 599 | tipc_bcast_lock(net);
|
| 600 | tipc_link_set_queue_limits(l, tipc_link_min_win(l), max_win);
|
| 601 | tipc_bcast_unlock(net);
|
| 602 | return 0;
|
| 603 | }
|
| 604 |
|
| 605 | static int tipc_bc_link_set_broadcast_mode(struct net *net, u32 bc_mode)
|
| 606 | {
|
| 607 | struct tipc_bc_base *bb = tipc_bc_base(net);
|
| 608 |
|
| 609 | switch (bc_mode) {
|
| 610 | case BCLINK_MODE_BCAST:
|
| 611 | if (!bb->bcast_support)
|
| 612 | return -ENOPROTOOPT;
|
| 613 |
|
| 614 | bb->force_bcast = true;
|
| 615 | bb->force_rcast = false;
|
| 616 | break;
|
| 617 | case BCLINK_MODE_RCAST:
|
| 618 | if (!bb->rcast_support)
|
| 619 | return -ENOPROTOOPT;
|
| 620 |
|
| 621 | bb->force_bcast = false;
|
| 622 | bb->force_rcast = true;
|
| 623 | break;
|
| 624 | case BCLINK_MODE_SEL:
|
| 625 | if (!bb->bcast_support || !bb->rcast_support)
|
| 626 | return -ENOPROTOOPT;
|
| 627 |
|
| 628 | bb->force_bcast = false;
|
| 629 | bb->force_rcast = false;
|
| 630 | break;
|
| 631 | default:
|
| 632 | return -EINVAL;
|
| 633 | }
|
| 634 |
|
| 635 | return 0;
|
| 636 | }
|
| 637 |
|
| 638 | static int tipc_bc_link_set_broadcast_ratio(struct net *net, u32 bc_ratio)
|
| 639 | {
|
| 640 | struct tipc_bc_base *bb = tipc_bc_base(net);
|
| 641 |
|
| 642 | if (!bb->bcast_support || !bb->rcast_support)
|
| 643 | return -ENOPROTOOPT;
|
| 644 |
|
| 645 | if (bc_ratio > 100 || bc_ratio <= 0)
|
| 646 | return -EINVAL;
|
| 647 |
|
| 648 | bb->rc_ratio = bc_ratio;
|
| 649 | tipc_bcast_lock(net);
|
| 650 | tipc_bcbase_calc_bc_threshold(net);
|
| 651 | tipc_bcast_unlock(net);
|
| 652 |
|
| 653 | return 0;
|
| 654 | }
|
| 655 |
|
| 656 | int tipc_nl_bc_link_set(struct net *net, struct nlattr *attrs[])
|
| 657 | {
|
| 658 | int err;
|
| 659 | u32 win;
|
| 660 | u32 bc_mode;
|
| 661 | u32 bc_ratio;
|
| 662 | struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
|
| 663 |
|
| 664 | if (!attrs[TIPC_NLA_LINK_PROP])
|
| 665 | return -EINVAL;
|
| 666 |
|
| 667 | err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP], props);
|
| 668 | if (err)
|
| 669 | return err;
|
| 670 |
|
| 671 | if (!props[TIPC_NLA_PROP_WIN] &&
|
| 672 | !props[TIPC_NLA_PROP_BROADCAST] &&
|
| 673 | !props[TIPC_NLA_PROP_BROADCAST_RATIO]) {
|
| 674 | return -EOPNOTSUPP;
|
| 675 | }
|
| 676 |
|
| 677 | if (props[TIPC_NLA_PROP_BROADCAST]) {
|
| 678 | bc_mode = nla_get_u32(props[TIPC_NLA_PROP_BROADCAST]);
|
| 679 | err = tipc_bc_link_set_broadcast_mode(net, bc_mode);
|
| 680 | }
|
| 681 |
|
| 682 | if (!err && props[TIPC_NLA_PROP_BROADCAST_RATIO]) {
|
| 683 | bc_ratio = nla_get_u32(props[TIPC_NLA_PROP_BROADCAST_RATIO]);
|
| 684 | err = tipc_bc_link_set_broadcast_ratio(net, bc_ratio);
|
| 685 | }
|
| 686 |
|
| 687 | if (!err && props[TIPC_NLA_PROP_WIN]) {
|
| 688 | win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
|
| 689 | err = tipc_bc_link_set_queue_limits(net, win);
|
| 690 | }
|
| 691 |
|
| 692 | return err;
|
| 693 | }
|
| 694 |
|
| 695 | int tipc_bcast_init(struct net *net)
|
| 696 | {
|
| 697 | struct tipc_net *tn = tipc_net(net);
|
| 698 | struct tipc_bc_base *bb = NULL;
|
| 699 | struct tipc_link *l = NULL;
|
| 700 |
|
| 701 | bb = kzalloc_obj(*bb);
|
| 702 | if (!bb)
|
| 703 | goto enomem;
|
| 704 | tn->bcbase = bb;
|
| 705 | spin_lock_init(&tipc_net(net)->bclock);
|
| 706 |
|
| 707 | if (!tipc_link_bc_create(net, 0, 0, NULL,
|
| 708 | one_page_mtu,
|
| 709 | BCLINK_WIN_DEFAULT,
|
| 710 | BCLINK_WIN_DEFAULT,
|
| 711 | 0,
|
| 712 | &bb->inputq,
|
| 713 | NULL,
|
| 714 | NULL,
|
| 715 | &l))
|
| 716 | goto enomem;
|
| 717 | bb->link = l;
|
| 718 | tn->bcl = l;
|
| 719 | bb->rc_ratio = 10;
|
| 720 | bb->rcast_support = true;
|
| 721 | return 0;
|
| 722 | enomem:
|
| 723 | kfree(bb);
|
| 724 | kfree(l);
|
| 725 | return -ENOMEM;
|
| 726 | }
|
| 727 |
|
| 728 | void tipc_bcast_stop(struct net *net)
|
| 729 | {
|
| 730 | struct tipc_net *tn = net_generic(net, tipc_net_id);
|
| 731 |
|
| 732 | synchronize_net();
|
| 733 | kfree(tn->bcbase);
|
| 734 | kfree(tn->bcl);
|
| 735 | }
|
| 736 |
|
| 737 | void tipc_nlist_init(struct tipc_nlist *nl, u32 self)
|
| 738 | {
|
| 739 | memset(nl, 0, sizeof(*nl));
|
| 740 | INIT_LIST_HEAD(&nl->list);
|
| 741 | nl->self = self;
|
| 742 | }
|
| 743 |
|
| 744 | void tipc_nlist_add(struct tipc_nlist *nl, u32 node)
|
| 745 | {
|
| 746 | if (node == nl->self)
|
| 747 | nl->local = true;
|
| 748 | else if (tipc_dest_push(&nl->list, node, 0))
|
| 749 | nl->remote++;
|
| 750 | }
|
| 751 |
|
| 752 | void tipc_nlist_del(struct tipc_nlist *nl, u32 node)
|
| 753 | {
|
| 754 | if (node == nl->self)
|
| 755 | nl->local = false;
|
| 756 | else if (tipc_dest_del(&nl->list, node, 0))
|
| 757 | nl->remote--;
|
| 758 | }
|
| 759 |
|
| 760 | void tipc_nlist_purge(struct tipc_nlist *nl)
|
| 761 | {
|
| 762 | tipc_dest_list_purge(&nl->list);
|
| 763 | nl->remote = 0;
|
| 764 | nl->local = false;
|
| 765 | }
|
| 766 |
|
| 767 | u32 tipc_bcast_get_mode(struct net *net)
|
| 768 | {
|
| 769 | struct tipc_bc_base *bb = tipc_bc_base(net);
|
| 770 |
|
| 771 | if (bb->force_bcast)
|
| 772 | return BCLINK_MODE_BCAST;
|
| 773 |
|
| 774 | if (bb->force_rcast)
|
| 775 | return BCLINK_MODE_RCAST;
|
| 776 |
|
| 777 | if (bb->bcast_support && bb->rcast_support)
|
| 778 | return BCLINK_MODE_SEL;
|
| 779 |
|
| 780 | return 0;
|
| 781 | }
|
| 782 |
|
| 783 | u32 tipc_bcast_get_broadcast_ratio(struct net *net)
|
| 784 | {
|
| 785 | struct tipc_bc_base *bb = tipc_bc_base(net);
|
| 786 |
|
| 787 | return bb->rc_ratio;
|
| 788 | }
|
| 789 |
|
| 790 | void tipc_mcast_filter_msg(struct net *net, struct sk_buff_head *defq,
|
| 791 | struct sk_buff_head *inputq)
|
| 792 | {
|
| 793 | struct sk_buff *skb, *_skb, *tmp;
|
| 794 | struct tipc_msg *hdr, *_hdr;
|
| 795 | bool match = false;
|
| 796 | u32 node, port;
|
| 797 |
|
| 798 | skb = skb_peek(inputq);
|
| 799 | if (!skb)
|
| 800 | return;
|
| 801 |
|
| 802 | hdr = buf_msg(skb);
|
| 803 |
|
| 804 | if (likely(!msg_is_syn(hdr) && skb_queue_empty(defq)))
|
| 805 | return;
|
| 806 |
|
| 807 | node = msg_orignode(hdr);
|
| 808 | if (node == tipc_own_addr(net))
|
| 809 | return;
|
| 810 |
|
| 811 | port = msg_origport(hdr);
|
| 812 |
|
| 813 |
|
| 814 | skb_queue_walk(defq, _skb) {
|
| 815 | _hdr = buf_msg(_skb);
|
| 816 | if (msg_orignode(_hdr) != node)
|
| 817 | continue;
|
| 818 | if (msg_origport(_hdr) != port)
|
| 819 | continue;
|
| 820 | match = true;
|
| 821 | break;
|
| 822 | }
|
| 823 |
|
| 824 | if (!match) {
|
| 825 | if (!msg_is_syn(hdr))
|
| 826 | return;
|
| 827 | __skb_dequeue(inputq);
|
| 828 | __skb_queue_tail(defq, skb);
|
| 829 | return;
|
| 830 | }
|
| 831 |
|
| 832 |
|
| 833 | if (!msg_is_syn(hdr)) {
|
| 834 | if (msg_is_rcast(hdr) != msg_is_rcast(_hdr))
|
| 835 | return;
|
| 836 | __skb_dequeue(inputq);
|
| 837 | __skb_queue_tail(defq, skb);
|
| 838 | return;
|
| 839 | }
|
| 840 |
|
| 841 |
|
| 842 | if (msg_is_rcast(hdr) == msg_is_rcast(_hdr)) {
|
| 843 | __skb_dequeue(inputq);
|
| 844 | __skb_queue_tail(defq, skb);
|
| 845 | return;
|
| 846 | }
|
| 847 |
|
| 848 |
|
| 849 | __skb_unlink(_skb, defq);
|
| 850 | if (msg_data_sz(hdr)) {
|
| 851 | kfree_skb(_skb);
|
| 852 | } else {
|
| 853 | __skb_dequeue(inputq);
|
| 854 | kfree_skb(skb);
|
| 855 | __skb_queue_tail(inputq, _skb);
|
| 856 | }
|
| 857 |
|
| 858 |
|
| 859 | skb_queue_walk_safe(defq, _skb, tmp) {
|
| 860 | _hdr = buf_msg(_skb);
|
| 861 | if (msg_orignode(_hdr) != node)
|
| 862 | continue;
|
| 863 | if (msg_origport(_hdr) != port)
|
| 864 | continue;
|
| 865 | if (msg_is_syn(_hdr))
|
| 866 | break;
|
| 867 | __skb_unlink(_skb, defq);
|
| 868 | __skb_queue_tail(inputq, _skb);
|
| 869 | }
|
| 870 | }
|