Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/bcast.c: TIPC broadcast code | |
c4307285 | 3 | * |
3c724acd | 4 | * Copyright (c) 2004-2006, 2014-2015, Ericsson AB |
b97bf3fd | 5 | * Copyright (c) 2004, Intel Corporation. |
2d627b92 | 6 | * Copyright (c) 2005, 2010-2011, Wind River Systems |
b97bf3fd PL |
7 | * All rights reserved. |
8 | * | |
9ea1fd3c | 9 | * Redistribution and use in source and binary forms, with or without |
b97bf3fd PL |
10 | * modification, are permitted provided that the following conditions are met: |
11 | * | |
9ea1fd3c PL |
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. | |
b97bf3fd | 20 | * |
9ea1fd3c PL |
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 | |
b97bf3fd PL |
35 | * POSSIBILITY OF SUCH DAMAGE. |
36 | */ | |
37 | ||
6beb19a6 | 38 | #include <linux/tipc_config.h> |
078bec82 JPM |
39 | #include "socket.h" |
40 | #include "msg.h" | |
b97bf3fd | 41 | #include "bcast.h" |
9f6bdcd4 | 42 | #include "name_distr.h" |
6beb19a6 JPM |
43 | #include "link.h" |
44 | #include "node.h" | |
b97bf3fd | 45 | |
987b58be | 46 | #define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */ |
53387c4e JPM |
47 | #define BCLINK_WIN_DEFAULT 50 /* bcast link window size (default) */ |
48 | #define BCLINK_WIN_MIN 32 /* bcast minimum link window size */ | |
b97bf3fd | 49 | |
3aec9cc9 | 50 | const char tipc_bclink_name[] = "broadcast-link"; |
b97bf3fd | 51 | |
6beb19a6 JPM |
52 | /** |
53 | * struct tipc_bcbearer_pair - a pair of bearers used by broadcast link | |
54 | * @primary: pointer to primary bearer | |
55 | * @secondary: pointer to secondary bearer | |
56 | * | |
57 | * Bearers must have same priority and same set of reachable destinations | |
58 | * to be paired. | |
59 | */ | |
60 | ||
61 | struct tipc_bcbearer_pair { | |
62 | struct tipc_bearer *primary; | |
63 | struct tipc_bearer *secondary; | |
64 | }; | |
65 | ||
66 | #define BCBEARER MAX_BEARERS | |
67 | ||
68 | /** | |
69 | * struct tipc_bcbearer - bearer used by broadcast link | |
70 | * @bearer: (non-standard) broadcast bearer structure | |
71 | * @media: (non-standard) broadcast media structure | |
72 | * @bpairs: array of bearer pairs | |
73 | * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort() | |
74 | * @remains: temporary node map used by tipc_bcbearer_send() | |
75 | * @remains_new: temporary node map used tipc_bcbearer_send() | |
76 | * | |
77 | * Note: The fields labelled "temporary" are incorporated into the bearer | |
78 | * to avoid consuming potentially limited stack space through the use of | |
79 | * large local variables within multicast routines. Concurrent access is | |
80 | * prevented through use of the spinlock "bcast_lock". | |
81 | */ | |
82 | struct tipc_bcbearer { | |
83 | struct tipc_bearer bearer; | |
84 | struct tipc_media media; | |
85 | struct tipc_bcbearer_pair bpairs[MAX_BEARERS]; | |
86 | struct tipc_bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1]; | |
87 | struct tipc_node_map remains; | |
88 | struct tipc_node_map remains_new; | |
89 | }; | |
90 | ||
91 | /** | |
92 | * struct tipc_bc_base - link used for broadcast messages | |
6beb19a6 JPM |
93 | * @link: (non-standard) broadcast link structure |
94 | * @node: (non-standard) node structure representing b'cast link's peer node | |
95 | * @bcast_nodes: map of broadcast-capable nodes | |
96 | * @retransmit_to: node that most recently requested a retransmit | |
97 | * | |
98 | * Handles sequence numbering, fragmentation, bundling, etc. | |
99 | */ | |
100 | struct tipc_bc_base { | |
32301906 | 101 | struct tipc_link *link; |
6beb19a6 JPM |
102 | struct tipc_node node; |
103 | struct sk_buff_head arrvq; | |
104 | struct sk_buff_head inputq; | |
32301906 | 105 | struct sk_buff_head namedq; |
6beb19a6 JPM |
106 | struct tipc_node_map bcast_nodes; |
107 | struct tipc_node *retransmit_to; | |
108 | }; | |
109 | ||
5fd9fd63 JPM |
110 | static struct tipc_bc_base *tipc_bc_base(struct net *net) |
111 | { | |
112 | return tipc_net(net)->bcbase; | |
113 | } | |
114 | ||
6beb19a6 JPM |
115 | /** |
116 | * tipc_nmap_equal - test for equality of node maps | |
117 | */ | |
118 | static int tipc_nmap_equal(struct tipc_node_map *nm_a, | |
119 | struct tipc_node_map *nm_b) | |
120 | { | |
121 | return !memcmp(nm_a, nm_b, sizeof(*nm_a)); | |
122 | } | |
123 | ||
2f566124 | 124 | static void tipc_bcbearer_xmit(struct net *net, struct sk_buff_head *xmitq); |
31e3c3f6 | 125 | static void tipc_nmap_diff(struct tipc_node_map *nm_a, |
126 | struct tipc_node_map *nm_b, | |
127 | struct tipc_node_map *nm_diff); | |
28dd9418 YX |
128 | static void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node); |
129 | static void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node); | |
1da46568 | 130 | static void tipc_bclink_lock(struct net *net) |
d69afc90 | 131 | { |
0043550b | 132 | tipc_bcast_lock(net); |
d69afc90 YX |
133 | } |
134 | ||
1da46568 | 135 | static void tipc_bclink_unlock(struct net *net) |
d69afc90 | 136 | { |
0043550b | 137 | tipc_bcast_unlock(net); |
3f5a12bd YX |
138 | } |
139 | ||
cb1b7280 JPM |
140 | void tipc_bclink_input(struct net *net) |
141 | { | |
142 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
143 | ||
6beb19a6 | 144 | tipc_sk_mcast_rcv(net, &tn->bcbase->arrvq, &tn->bcbase->inputq); |
cb1b7280 JPM |
145 | } |
146 | ||
6beb19a6 | 147 | uint tipc_bcast_get_mtu(void) |
078bec82 JPM |
148 | { |
149 | return MAX_PKT_DEFAULT_MCAST; | |
150 | } | |
151 | ||
2f566124 | 152 | static u16 bcbuf_acks(struct sk_buff *skb) |
b97bf3fd | 153 | { |
2f566124 | 154 | return TIPC_SKB_CB(skb)->ackers; |
b97bf3fd PL |
155 | } |
156 | ||
2f566124 | 157 | static void bcbuf_set_acks(struct sk_buff *buf, u16 ackers) |
b97bf3fd | 158 | { |
2f566124 | 159 | TIPC_SKB_CB(buf)->ackers = ackers; |
b97bf3fd PL |
160 | } |
161 | ||
05790c64 | 162 | static void bcbuf_decr_acks(struct sk_buff *buf) |
b97bf3fd PL |
163 | { |
164 | bcbuf_set_acks(buf, bcbuf_acks(buf) - 1); | |
165 | } | |
166 | ||
1da46568 | 167 | static void bclink_set_last_sent(struct net *net) |
5b1f7bde | 168 | { |
1da46568 YX |
169 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
170 | struct tipc_link *bcl = tn->bcl; | |
171 | ||
dd3f9e70 | 172 | bcl->silent_intv_cnt = mod(bcl->snd_nxt - 1); |
5b1f7bde AS |
173 | } |
174 | ||
1da46568 | 175 | u32 tipc_bclink_get_last_sent(struct net *net) |
5b1f7bde | 176 | { |
1da46568 YX |
177 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
178 | ||
a97b9d3f | 179 | return tn->bcl->silent_intv_cnt; |
5b1f7bde AS |
180 | } |
181 | ||
7a54d4a9 | 182 | static void bclink_update_last_sent(struct tipc_node *node, u32 seqno) |
b97bf3fd | 183 | { |
7a54d4a9 AS |
184 | node->bclink.last_sent = less_eq(node->bclink.last_sent, seqno) ? |
185 | seqno : node->bclink.last_sent; | |
b97bf3fd PL |
186 | } |
187 | ||
2c53040f | 188 | /** |
01d83edd AS |
189 | * tipc_bclink_retransmit_to - get most recent node to request retransmission |
190 | * | |
d69afc90 | 191 | * Called with bclink_lock locked |
01d83edd | 192 | */ |
1da46568 | 193 | struct tipc_node *tipc_bclink_retransmit_to(struct net *net) |
01d83edd | 194 | { |
1da46568 YX |
195 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
196 | ||
6beb19a6 | 197 | return tn->bcbase->retransmit_to; |
01d83edd AS |
198 | } |
199 | ||
c4307285 | 200 | /** |
b97bf3fd PL |
201 | * bclink_retransmit_pkt - retransmit broadcast packets |
202 | * @after: sequence number of last packet to *not* retransmit | |
203 | * @to: sequence number of last packet to retransmit | |
c4307285 | 204 | * |
d69afc90 | 205 | * Called with bclink_lock locked |
b97bf3fd | 206 | */ |
1da46568 | 207 | static void bclink_retransmit_pkt(struct tipc_net *tn, u32 after, u32 to) |
b97bf3fd | 208 | { |
58dc55f2 | 209 | struct sk_buff *skb; |
1da46568 | 210 | struct tipc_link *bcl = tn->bcl; |
b97bf3fd | 211 | |
05dcc5aa | 212 | skb_queue_walk(&bcl->transmq, skb) { |
703068ee JM |
213 | if (more(buf_seqno(skb), after)) { |
214 | tipc_link_retransmit(bcl, skb, mod(to - after)); | |
58dc55f2 | 215 | break; |
703068ee | 216 | } |
58dc55f2 | 217 | } |
b97bf3fd PL |
218 | } |
219 | ||
7845989c KD |
220 | /** |
221 | * bclink_prepare_wakeup - prepare users for wakeup after congestion | |
222 | * @bcl: broadcast link | |
223 | * @resultq: queue for users which can be woken up | |
224 | * Move a number of waiting users, as permitted by available space in | |
225 | * the send queue, from link wait queue to specified queue for wakeup | |
226 | */ | |
227 | static void bclink_prepare_wakeup(struct tipc_link *bcl, struct sk_buff_head *resultq) | |
228 | { | |
229 | int pnd[TIPC_SYSTEM_IMPORTANCE + 1] = {0,}; | |
230 | int imp, lim; | |
231 | struct sk_buff *skb, *tmp; | |
232 | ||
233 | skb_queue_walk_safe(&bcl->wakeupq, skb, tmp) { | |
234 | imp = TIPC_SKB_CB(skb)->chain_imp; | |
235 | lim = bcl->window + bcl->backlog[imp].limit; | |
236 | pnd[imp] += TIPC_SKB_CB(skb)->chain_sz; | |
237 | if ((pnd[imp] + bcl->backlog[imp].len) >= lim) | |
238 | continue; | |
239 | skb_unlink(skb, &bcl->wakeupq); | |
240 | skb_queue_tail(resultq, skb); | |
241 | } | |
242 | } | |
243 | ||
908344cd JM |
244 | /** |
245 | * tipc_bclink_wakeup_users - wake up pending users | |
246 | * | |
247 | * Called with no locks taken | |
248 | */ | |
f2f9800d | 249 | void tipc_bclink_wakeup_users(struct net *net) |
908344cd | 250 | { |
1da46568 | 251 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
7845989c KD |
252 | struct tipc_link *bcl = tn->bcl; |
253 | struct sk_buff_head resultq; | |
4988bb4a | 254 | |
7845989c KD |
255 | skb_queue_head_init(&resultq); |
256 | bclink_prepare_wakeup(bcl, &resultq); | |
257 | tipc_sk_rcv(net, &resultq); | |
908344cd JM |
258 | } |
259 | ||
c4307285 | 260 | /** |
4323add6 | 261 | * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets |
b97bf3fd PL |
262 | * @n_ptr: node that sent acknowledgement info |
263 | * @acked: broadcast sequence # that has been acknowledged | |
c4307285 | 264 | * |
d69afc90 | 265 | * Node is locked, bclink_lock unlocked. |
b97bf3fd | 266 | */ |
6c00055a | 267 | void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked) |
b97bf3fd | 268 | { |
58dc55f2 | 269 | struct sk_buff *skb, *tmp; |
b97bf3fd | 270 | unsigned int released = 0; |
1da46568 YX |
271 | struct net *net = n_ptr->net; |
272 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
b97bf3fd | 273 | |
2cdf3918 JPM |
274 | if (unlikely(!n_ptr->bclink.recv_permitted)) |
275 | return; | |
1da46568 | 276 | tipc_bclink_lock(net); |
2cdf3918 | 277 | |
36559591 | 278 | /* Bail out if tx queue is empty (no clean up is required) */ |
05dcc5aa | 279 | skb = skb_peek(&tn->bcl->transmq); |
58dc55f2 | 280 | if (!skb) |
36559591 AS |
281 | goto exit; |
282 | ||
283 | /* Determine which messages need to be acknowledged */ | |
284 | if (acked == INVALID_LINK_SEQ) { | |
285 | /* | |
286 | * Contact with specified node has been lost, so need to | |
287 | * acknowledge sent messages only (if other nodes still exist) | |
288 | * or both sent and unsent messages (otherwise) | |
289 | */ | |
6beb19a6 | 290 | if (tn->bcbase->bcast_nodes.count) |
a97b9d3f | 291 | acked = tn->bcl->silent_intv_cnt; |
36559591 | 292 | else |
a97b9d3f | 293 | acked = tn->bcl->snd_nxt; |
36559591 AS |
294 | } else { |
295 | /* | |
296 | * Bail out if specified sequence number does not correspond | |
297 | * to a message that has been sent and not yet acknowledged | |
298 | */ | |
58dc55f2 | 299 | if (less(acked, buf_seqno(skb)) || |
a97b9d3f | 300 | less(tn->bcl->silent_intv_cnt, acked) || |
36559591 AS |
301 | less_eq(acked, n_ptr->bclink.acked)) |
302 | goto exit; | |
303 | } | |
36559591 | 304 | /* Skip over packets that node has previously acknowledged */ |
05dcc5aa | 305 | skb_queue_walk(&tn->bcl->transmq, skb) { |
58dc55f2 YX |
306 | if (more(buf_seqno(skb), n_ptr->bclink.acked)) |
307 | break; | |
308 | } | |
b97bf3fd | 309 | /* Update packets that node is now acknowledging */ |
05dcc5aa | 310 | skb_queue_walk_from_safe(&tn->bcl->transmq, skb, tmp) { |
58dc55f2 YX |
311 | if (more(buf_seqno(skb), acked)) |
312 | break; | |
05dcc5aa JPM |
313 | bcbuf_decr_acks(skb); |
314 | bclink_set_last_sent(net); | |
58dc55f2 | 315 | if (bcbuf_acks(skb) == 0) { |
05dcc5aa | 316 | __skb_unlink(skb, &tn->bcl->transmq); |
58dc55f2 | 317 | kfree_skb(skb); |
b97bf3fd PL |
318 | released = 1; |
319 | } | |
b97bf3fd PL |
320 | } |
321 | n_ptr->bclink.acked = acked; | |
322 | ||
323 | /* Try resolving broadcast link congestion, if necessary */ | |
05dcc5aa | 324 | if (unlikely(skb_peek(&tn->bcl->backlogq))) { |
1da46568 YX |
325 | tipc_link_push_packets(tn->bcl); |
326 | bclink_set_last_sent(net); | |
5b1f7bde | 327 | } |
c637c103 | 328 | if (unlikely(released && !skb_queue_empty(&tn->bcl->wakeupq))) |
908344cd | 329 | n_ptr->action_flags |= TIPC_WAKEUP_BCAST_USERS; |
36559591 | 330 | exit: |
1da46568 | 331 | tipc_bclink_unlock(net); |
b97bf3fd PL |
332 | } |
333 | ||
2c53040f | 334 | /** |
7a54d4a9 | 335 | * tipc_bclink_update_link_state - update broadcast link state |
c4307285 | 336 | * |
7216cd94 | 337 | * RCU and node lock set |
b97bf3fd | 338 | */ |
c5898636 | 339 | void tipc_bclink_update_link_state(struct tipc_node *n_ptr, |
c93d3baa | 340 | u32 last_sent) |
b97bf3fd | 341 | { |
7a54d4a9 | 342 | struct sk_buff *buf; |
c5898636 | 343 | struct net *net = n_ptr->net; |
c93d3baa | 344 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
2f566124 | 345 | struct tipc_link *bcl = tn->bcl; |
b97bf3fd | 346 | |
7a54d4a9 | 347 | /* Ignore "stale" link state info */ |
7a54d4a9 AS |
348 | if (less_eq(last_sent, n_ptr->bclink.last_in)) |
349 | return; | |
b97bf3fd | 350 | |
7a54d4a9 | 351 | /* Update link synchronization state; quit if in sync */ |
7a54d4a9 AS |
352 | bclink_update_last_sent(n_ptr, last_sent); |
353 | ||
2f566124 JPM |
354 | /* This is a good location for statistical profiling */ |
355 | bcl->stats.queue_sz_counts++; | |
356 | bcl->stats.accu_queue_sz += skb_queue_len(&bcl->transmq); | |
357 | ||
7a54d4a9 AS |
358 | if (n_ptr->bclink.last_sent == n_ptr->bclink.last_in) |
359 | return; | |
360 | ||
361 | /* Update out-of-sync state; quit if loss is still unconfirmed */ | |
7a54d4a9 AS |
362 | if ((++n_ptr->bclink.oos_state) == 1) { |
363 | if (n_ptr->bclink.deferred_size < (TIPC_MIN_LINK_WIN / 2)) | |
364 | return; | |
365 | n_ptr->bclink.oos_state++; | |
366 | } | |
367 | ||
368 | /* Don't NACK if one has been recently sent (or seen) */ | |
7a54d4a9 | 369 | if (n_ptr->bclink.oos_state & 0x1) |
b97bf3fd PL |
370 | return; |
371 | ||
7a54d4a9 | 372 | /* Send NACK */ |
31e3c3f6 | 373 | buf = tipc_buf_acquire(INT_H_SIZE); |
b97bf3fd | 374 | if (buf) { |
7a54d4a9 | 375 | struct tipc_msg *msg = buf_msg(buf); |
05dcc5aa | 376 | struct sk_buff *skb = skb_peek(&n_ptr->bclink.deferdq); |
bc6fecd4 | 377 | u32 to = skb ? buf_seqno(skb) - 1 : n_ptr->bclink.last_sent; |
7a54d4a9 | 378 | |
c5898636 | 379 | tipc_msg_init(tn->own_addr, msg, BCAST_PROTOCOL, STATE_MSG, |
7a54d4a9 | 380 | INT_H_SIZE, n_ptr->addr); |
bf781ecf | 381 | msg_set_non_seq(msg, 1); |
c93d3baa | 382 | msg_set_mc_netid(msg, tn->net_id); |
7a54d4a9 AS |
383 | msg_set_bcast_ack(msg, n_ptr->bclink.last_in); |
384 | msg_set_bcgap_after(msg, n_ptr->bclink.last_in); | |
bc6fecd4 | 385 | msg_set_bcgap_to(msg, to); |
b97bf3fd | 386 | |
1da46568 | 387 | tipc_bclink_lock(net); |
7f9f95d9 | 388 | tipc_bearer_send(net, MAX_BEARERS, buf, NULL); |
1da46568 YX |
389 | tn->bcl->stats.sent_nacks++; |
390 | tipc_bclink_unlock(net); | |
5f6d9123 | 391 | kfree_skb(buf); |
b97bf3fd | 392 | |
7a54d4a9 | 393 | n_ptr->bclink.oos_state++; |
b97bf3fd PL |
394 | } |
395 | } | |
396 | ||
d999297c JPM |
397 | void tipc_bclink_sync_state(struct tipc_node *n, struct tipc_msg *hdr) |
398 | { | |
399 | u16 last = msg_last_bcast(hdr); | |
400 | int mtyp = msg_type(hdr); | |
401 | ||
402 | if (unlikely(msg_user(hdr) != LINK_PROTOCOL)) | |
403 | return; | |
404 | if (mtyp == STATE_MSG) { | |
405 | tipc_bclink_update_link_state(n, last); | |
406 | return; | |
407 | } | |
408 | /* Compatibility: older nodes don't know BCAST_PROTOCOL synchronization, | |
409 | * and transfer synch info in LINK_PROTOCOL messages. | |
410 | */ | |
411 | if (tipc_node_is_up(n)) | |
412 | return; | |
413 | if ((mtyp != RESET_MSG) && (mtyp != ACTIVATE_MSG)) | |
414 | return; | |
415 | n->bclink.last_sent = last; | |
416 | n->bclink.last_in = last; | |
417 | n->bclink.oos_state = 0; | |
418 | } | |
419 | ||
2c53040f | 420 | /** |
7a54d4a9 | 421 | * bclink_peek_nack - monitor retransmission requests sent by other nodes |
b97bf3fd | 422 | * |
7a54d4a9 AS |
423 | * Delay any upcoming NACK by this node if another node has already |
424 | * requested the first message this node is going to ask for. | |
b97bf3fd | 425 | */ |
f2f9800d | 426 | static void bclink_peek_nack(struct net *net, struct tipc_msg *msg) |
b97bf3fd | 427 | { |
f2f9800d | 428 | struct tipc_node *n_ptr = tipc_node_find(net, msg_destnode(msg)); |
b97bf3fd | 429 | |
7a54d4a9 | 430 | if (unlikely(!n_ptr)) |
b97bf3fd | 431 | return; |
7a54d4a9 | 432 | |
4323add6 | 433 | tipc_node_lock(n_ptr); |
389dd9bc | 434 | if (n_ptr->bclink.recv_permitted && |
7a54d4a9 AS |
435 | (n_ptr->bclink.last_in != n_ptr->bclink.last_sent) && |
436 | (n_ptr->bclink.last_in == msg_bcgap_after(msg))) | |
437 | n_ptr->bclink.oos_state = 2; | |
4323add6 | 438 | tipc_node_unlock(n_ptr); |
8a0f6ebe | 439 | tipc_node_put(n_ptr); |
b97bf3fd PL |
440 | } |
441 | ||
6beb19a6 | 442 | /* tipc_bcast_xmit - deliver buffer chain to all nodes in cluster |
9fbfb8b1 | 443 | * and to identified node local sockets |
f2f9800d | 444 | * @net: the applicable net namespace |
a6ca1094 | 445 | * @list: chain of buffers containing message |
078bec82 JPM |
446 | * Consumes the buffer chain, except when returning -ELINKCONG |
447 | * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE | |
448 | */ | |
6beb19a6 | 449 | int tipc_bcast_xmit(struct net *net, struct sk_buff_head *list) |
078bec82 | 450 | { |
2f566124 JPM |
451 | struct tipc_link *l = tipc_bc_sndlink(net); |
452 | struct sk_buff_head xmitq, inputq, rcvq; | |
078bec82 | 453 | int rc = 0; |
078bec82 | 454 | |
2f566124 JPM |
455 | __skb_queue_head_init(&rcvq); |
456 | __skb_queue_head_init(&xmitq); | |
457 | skb_queue_head_init(&inputq); | |
22d85c79 | 458 | |
2f566124 JPM |
459 | /* Prepare message clone for local node */ |
460 | if (unlikely(!tipc_msg_reassemble(list, &rcvq))) | |
461 | return -EHOSTUNREACH; | |
078bec82 | 462 | |
2f566124 JPM |
463 | tipc_bcast_lock(net); |
464 | if (tipc_link_bc_peers(l)) | |
465 | rc = tipc_link_xmit(l, list, &xmitq); | |
466 | bclink_set_last_sent(net); | |
467 | tipc_bcast_unlock(net); | |
078bec82 | 468 | |
2f566124 | 469 | /* Don't send to local node if adding to link failed */ |
cb1b7280 | 470 | if (unlikely(rc)) { |
2f566124 | 471 | __skb_queue_purge(&rcvq); |
cb1b7280 JPM |
472 | return rc; |
473 | } | |
52666986 | 474 | |
2f566124 JPM |
475 | /* Broadcast to all nodes, inluding local node */ |
476 | tipc_bcbearer_xmit(net, &xmitq); | |
477 | tipc_sk_mcast_rcv(net, &rcvq, &inputq); | |
478 | __skb_queue_purge(list); | |
479 | return 0; | |
078bec82 | 480 | } |
52666986 JPM |
481 | |
482 | /* tipc_bcast_rcv - receive a broadcast packet, and deliver to rcv link | |
483 | * | |
484 | * RCU is locked, no other locks set | |
485 | */ | |
486 | int tipc_bcast_rcv(struct net *net, struct tipc_link *l, struct sk_buff *skb) | |
487 | { | |
488 | struct tipc_msg *hdr = buf_msg(skb); | |
489 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq; | |
490 | struct sk_buff_head xmitq; | |
491 | int rc; | |
492 | ||
493 | __skb_queue_head_init(&xmitq); | |
494 | ||
495 | if (msg_mc_netid(hdr) != tipc_netid(net) || !tipc_link_is_up(l)) { | |
496 | kfree_skb(skb); | |
497 | return 0; | |
498 | } | |
499 | ||
500 | tipc_bcast_lock(net); | |
501 | if (msg_user(hdr) == BCAST_PROTOCOL) | |
502 | rc = tipc_link_bc_nack_rcv(l, skb, &xmitq); | |
503 | else | |
504 | rc = tipc_link_rcv(l, skb, NULL); | |
505 | tipc_bcast_unlock(net); | |
506 | ||
507 | if (!skb_queue_empty(&xmitq)) | |
508 | tipc_bcbearer_xmit(net, &xmitq); | |
509 | ||
510 | /* Any socket wakeup messages ? */ | |
511 | if (!skb_queue_empty(inputq)) | |
512 | tipc_sk_rcv(net, inputq); | |
513 | ||
514 | return rc; | |
515 | } | |
516 | ||
517 | /* tipc_bcast_ack_rcv - receive and handle a broadcast acknowledge | |
518 | * | |
519 | * RCU is locked, no other locks set | |
520 | */ | |
521 | void tipc_bcast_ack_rcv(struct net *net, struct tipc_link *l, u32 acked) | |
522 | { | |
523 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq; | |
524 | struct sk_buff_head xmitq; | |
525 | ||
526 | __skb_queue_head_init(&xmitq); | |
527 | ||
528 | tipc_bcast_lock(net); | |
529 | tipc_link_bc_ack_rcv(l, acked, &xmitq); | |
530 | tipc_bcast_unlock(net); | |
531 | ||
532 | tipc_bcbearer_xmit(net, &xmitq); | |
533 | ||
534 | /* Any socket wakeup messages ? */ | |
535 | if (!skb_queue_empty(inputq)) | |
536 | tipc_sk_rcv(net, inputq); | |
537 | } | |
538 | ||
539 | /* tipc_bcast_synch_rcv - check and update rcv link with peer's send state | |
540 | * | |
541 | * RCU is locked, no other locks set | |
542 | */ | |
543 | void tipc_bcast_sync_rcv(struct net *net, struct tipc_link *l, | |
544 | struct tipc_msg *hdr) | |
545 | { | |
546 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq; | |
547 | struct sk_buff_head xmitq; | |
548 | ||
549 | __skb_queue_head_init(&xmitq); | |
550 | ||
551 | tipc_bcast_lock(net); | |
552 | if (msg_type(hdr) == STATE_MSG) { | |
553 | tipc_link_bc_ack_rcv(l, msg_bcast_ack(hdr), &xmitq); | |
554 | tipc_link_bc_sync_rcv(l, hdr, &xmitq); | |
555 | } else { | |
556 | tipc_link_bc_init_rcv(l, hdr); | |
557 | } | |
558 | tipc_bcast_unlock(net); | |
559 | ||
560 | tipc_bcbearer_xmit(net, &xmitq); | |
561 | ||
562 | /* Any socket wakeup messages ? */ | |
563 | if (!skb_queue_empty(inputq)) | |
564 | tipc_sk_rcv(net, inputq); | |
565 | } | |
566 | ||
567 | /* tipc_bcast_add_peer - add a peer node to broadcast link and bearer | |
568 | * | |
569 | * RCU is locked, node lock is set | |
570 | */ | |
571 | void tipc_bcast_add_peer(struct net *net, u32 addr, struct tipc_link *uc_l, | |
572 | struct sk_buff_head *xmitq) | |
573 | { | |
574 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
575 | struct tipc_link *snd_l = tipc_bc_sndlink(net); | |
576 | ||
577 | tipc_bclink_lock(net); | |
578 | tipc_nmap_add(&tn->bcbase->bcast_nodes, addr); | |
579 | tipc_link_add_bc_peer(snd_l, uc_l, xmitq); | |
580 | tipc_bclink_unlock(net); | |
581 | } | |
582 | ||
583 | /* tipc_bcast_remove_peer - remove a peer node from broadcast link and bearer | |
584 | * | |
585 | * RCU is locked, node lock is set | |
586 | */ | |
587 | void tipc_bcast_remove_peer(struct net *net, u32 addr, | |
588 | struct tipc_link *rcv_l) | |
589 | { | |
590 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
591 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq; | |
592 | struct tipc_link *snd_l = tipc_bc_sndlink(net); | |
593 | struct sk_buff_head xmitq; | |
594 | ||
595 | __skb_queue_head_init(&xmitq); | |
596 | ||
597 | tipc_bclink_lock(net); | |
598 | tipc_nmap_remove(&tn->bcbase->bcast_nodes, addr); | |
599 | tipc_link_remove_bc_peer(snd_l, rcv_l, &xmitq); | |
600 | tipc_bclink_unlock(net); | |
601 | ||
602 | tipc_bcbearer_xmit(net, &xmitq); | |
603 | ||
604 | /* Any socket wakeup messages ? */ | |
605 | if (!skb_queue_empty(inputq)) | |
606 | tipc_sk_rcv(net, inputq); | |
607 | } | |
608 | ||
2c53040f | 609 | /** |
63e7f1ac AS |
610 | * bclink_accept_pkt - accept an incoming, in-sequence broadcast packet |
611 | * | |
d69afc90 | 612 | * Called with both sending node's lock and bclink_lock taken. |
63e7f1ac | 613 | */ |
63e7f1ac AS |
614 | static void bclink_accept_pkt(struct tipc_node *node, u32 seqno) |
615 | { | |
1da46568 YX |
616 | struct tipc_net *tn = net_generic(node->net, tipc_net_id); |
617 | ||
63e7f1ac AS |
618 | bclink_update_last_sent(node, seqno); |
619 | node->bclink.last_in = seqno; | |
620 | node->bclink.oos_state = 0; | |
1da46568 | 621 | tn->bcl->stats.recv_info++; |
63e7f1ac AS |
622 | |
623 | /* | |
624 | * Unicast an ACK periodically, ensuring that | |
625 | * all nodes in the cluster don't ACK at the same time | |
626 | */ | |
34747539 | 627 | if (((seqno - tn->own_addr) % TIPC_MIN_LINK_WIN) == 0) { |
9d13ec65 | 628 | tipc_link_proto_xmit(node_active_link(node, node->addr), |
ed193ece | 629 | STATE_MSG, 0, 0, 0, 0); |
1da46568 | 630 | tn->bcl->stats.sent_acks++; |
63e7f1ac AS |
631 | } |
632 | } | |
633 | ||
2c53040f | 634 | /** |
247f0f3c | 635 | * tipc_bclink_rcv - receive a broadcast packet, and deliver upwards |
c4307285 | 636 | * |
7216cd94 | 637 | * RCU is locked, no other locks set |
b97bf3fd | 638 | */ |
c93d3baa | 639 | void tipc_bclink_rcv(struct net *net, struct sk_buff *buf) |
d356eeba | 640 | { |
c93d3baa | 641 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
1da46568 | 642 | struct tipc_link *bcl = tn->bcl; |
b97bf3fd | 643 | struct tipc_msg *msg = buf_msg(buf); |
5d3c488d | 644 | struct tipc_node *node; |
b97bf3fd PL |
645 | u32 next_in; |
646 | u32 seqno; | |
0abd8ff2 | 647 | int deferred = 0; |
c637c103 JPM |
648 | int pos = 0; |
649 | struct sk_buff *iskb; | |
cb1b7280 | 650 | struct sk_buff_head *arrvq, *inputq; |
b97bf3fd | 651 | |
5d3c488d | 652 | /* Screen out unwanted broadcast messages */ |
c93d3baa | 653 | if (msg_mc_netid(msg) != tn->net_id) |
5d3c488d AS |
654 | goto exit; |
655 | ||
f2f9800d | 656 | node = tipc_node_find(net, msg_prevnode(msg)); |
5d3c488d AS |
657 | if (unlikely(!node)) |
658 | goto exit; | |
5d3c488d | 659 | tipc_node_lock(node); |
389dd9bc | 660 | if (unlikely(!node->bclink.recv_permitted)) |
5d3c488d | 661 | goto unlock; |
b97bf3fd | 662 | |
8a275a6a | 663 | /* Handle broadcast protocol message */ |
b97bf3fd | 664 | if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { |
9f6bdcd4 AS |
665 | if (msg_type(msg) != STATE_MSG) |
666 | goto unlock; | |
34747539 | 667 | if (msg_destnode(msg) == tn->own_addr) { |
4323add6 | 668 | tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); |
1da46568 | 669 | tipc_bclink_lock(net); |
b97bf3fd | 670 | bcl->stats.recv_nacks++; |
6beb19a6 | 671 | tn->bcbase->retransmit_to = node; |
1da46568 | 672 | bclink_retransmit_pkt(tn, msg_bcgap_after(msg), |
b97bf3fd | 673 | msg_bcgap_to(msg)); |
1da46568 | 674 | tipc_bclink_unlock(net); |
b952b2be | 675 | tipc_node_unlock(node); |
b97bf3fd | 676 | } else { |
5d3c488d | 677 | tipc_node_unlock(node); |
f2f9800d | 678 | bclink_peek_nack(net, msg); |
b97bf3fd | 679 | } |
8a0f6ebe | 680 | tipc_node_put(node); |
5d3c488d | 681 | goto exit; |
b97bf3fd | 682 | } |
5d3c488d | 683 | /* Handle in-sequence broadcast message */ |
b97bf3fd | 684 | seqno = msg_seqno(msg); |
8a275a6a | 685 | next_in = mod(node->bclink.last_in + 1); |
6beb19a6 JPM |
686 | arrvq = &tn->bcbase->arrvq; |
687 | inputq = &tn->bcbase->inputq; | |
b97bf3fd PL |
688 | |
689 | if (likely(seqno == next_in)) { | |
8a275a6a | 690 | receive: |
7a54d4a9 | 691 | /* Deliver message to destination */ |
b97bf3fd | 692 | if (likely(msg_isdata(msg))) { |
1da46568 | 693 | tipc_bclink_lock(net); |
63e7f1ac | 694 | bclink_accept_pkt(node, seqno); |
cb1b7280 JPM |
695 | spin_lock_bh(&inputq->lock); |
696 | __skb_queue_tail(arrvq, buf); | |
697 | spin_unlock_bh(&inputq->lock); | |
698 | node->action_flags |= TIPC_BCAST_MSG_EVT; | |
1da46568 | 699 | tipc_bclink_unlock(net); |
4323add6 | 700 | tipc_node_unlock(node); |
b97bf3fd | 701 | } else if (msg_user(msg) == MSG_BUNDLER) { |
1da46568 | 702 | tipc_bclink_lock(net); |
63e7f1ac | 703 | bclink_accept_pkt(node, seqno); |
b97bf3fd PL |
704 | bcl->stats.recv_bundles++; |
705 | bcl->stats.recv_bundled += msg_msgcnt(msg); | |
cb1b7280 JPM |
706 | pos = 0; |
707 | while (tipc_msg_extract(buf, &iskb, &pos)) { | |
708 | spin_lock_bh(&inputq->lock); | |
709 | __skb_queue_tail(arrvq, iskb); | |
710 | spin_unlock_bh(&inputq->lock); | |
711 | } | |
712 | node->action_flags |= TIPC_BCAST_MSG_EVT; | |
1da46568 | 713 | tipc_bclink_unlock(net); |
4323add6 | 714 | tipc_node_unlock(node); |
b97bf3fd | 715 | } else if (msg_user(msg) == MSG_FRAGMENTER) { |
1da46568 | 716 | tipc_bclink_lock(net); |
63e7f1ac | 717 | bclink_accept_pkt(node, seqno); |
bc14b8d6 YX |
718 | tipc_buf_append(&node->bclink.reasm_buf, &buf); |
719 | if (unlikely(!buf && !node->bclink.reasm_buf)) { | |
720 | tipc_bclink_unlock(net); | |
721 | goto unlock; | |
722 | } | |
b97bf3fd | 723 | bcl->stats.recv_fragments++; |
37e22164 | 724 | if (buf) { |
b97bf3fd | 725 | bcl->stats.recv_fragmented++; |
40ba3cdf | 726 | msg = buf_msg(buf); |
1da46568 | 727 | tipc_bclink_unlock(net); |
528f6f4b EH |
728 | goto receive; |
729 | } | |
1da46568 | 730 | tipc_bclink_unlock(net); |
4323add6 | 731 | tipc_node_unlock(node); |
b97bf3fd | 732 | } else { |
1da46568 | 733 | tipc_bclink_lock(net); |
63e7f1ac | 734 | bclink_accept_pkt(node, seqno); |
1da46568 | 735 | tipc_bclink_unlock(net); |
4323add6 | 736 | tipc_node_unlock(node); |
5f6d9123 | 737 | kfree_skb(buf); |
b97bf3fd | 738 | } |
5d3c488d | 739 | buf = NULL; |
8a275a6a AS |
740 | |
741 | /* Determine new synchronization state */ | |
5d3c488d | 742 | tipc_node_lock(node); |
8a275a6a AS |
743 | if (unlikely(!tipc_node_is_up(node))) |
744 | goto unlock; | |
745 | ||
7a54d4a9 | 746 | if (node->bclink.last_in == node->bclink.last_sent) |
8a275a6a AS |
747 | goto unlock; |
748 | ||
05dcc5aa | 749 | if (skb_queue_empty(&node->bclink.deferdq)) { |
7a54d4a9 AS |
750 | node->bclink.oos_state = 1; |
751 | goto unlock; | |
752 | } | |
753 | ||
05dcc5aa | 754 | msg = buf_msg(skb_peek(&node->bclink.deferdq)); |
8a275a6a AS |
755 | seqno = msg_seqno(msg); |
756 | next_in = mod(next_in + 1); | |
757 | if (seqno != next_in) | |
758 | goto unlock; | |
759 | ||
760 | /* Take in-sequence message from deferred queue & deliver it */ | |
05dcc5aa | 761 | buf = __skb_dequeue(&node->bclink.deferdq); |
8a275a6a AS |
762 | goto receive; |
763 | } | |
764 | ||
765 | /* Handle out-of-sequence broadcast message */ | |
8a275a6a | 766 | if (less(next_in, seqno)) { |
05dcc5aa | 767 | deferred = tipc_link_defer_pkt(&node->bclink.deferdq, |
8a275a6a | 768 | buf); |
7a54d4a9 | 769 | bclink_update_last_sent(node, seqno); |
5d3c488d | 770 | buf = NULL; |
0abd8ff2 | 771 | } |
8a275a6a | 772 | |
1da46568 | 773 | tipc_bclink_lock(net); |
b98158e3 | 774 | |
8a275a6a AS |
775 | if (deferred) |
776 | bcl->stats.deferred_recv++; | |
0232c5a5 AS |
777 | else |
778 | bcl->stats.duplicates++; | |
8a275a6a | 779 | |
1da46568 | 780 | tipc_bclink_unlock(net); |
b98158e3 | 781 | |
5d3c488d | 782 | unlock: |
4323add6 | 783 | tipc_node_unlock(node); |
8a0f6ebe | 784 | tipc_node_put(node); |
5d3c488d | 785 | exit: |
5f6d9123 | 786 | kfree_skb(buf); |
b97bf3fd PL |
787 | } |
788 | ||
6c00055a | 789 | u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) |
b97bf3fd | 790 | { |
389dd9bc | 791 | return (n_ptr->bclink.recv_permitted && |
1da46568 | 792 | (tipc_bclink_get_last_sent(n_ptr->net) != n_ptr->bclink.acked)); |
b97bf3fd PL |
793 | } |
794 | ||
795 | ||
796 | /** | |
4323add6 | 797 | * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer |
c4307285 | 798 | * |
2ff9f924 AS |
799 | * Send packet over as many bearers as necessary to reach all nodes |
800 | * that have joined the broadcast link. | |
c4307285 | 801 | * |
2ff9f924 AS |
802 | * Returns 0 (packet sent successfully) under all circumstances, |
803 | * since the broadcast link's pseudo-bearer never blocks | |
b97bf3fd | 804 | */ |
1da46568 YX |
805 | static int tipc_bcbearer_send(struct net *net, struct sk_buff *buf, |
806 | struct tipc_bearer *unused1, | |
988f088a | 807 | struct tipc_media_addr *unused2) |
b97bf3fd | 808 | { |
b97bf3fd | 809 | int bp_index; |
6f92ee54 | 810 | struct tipc_msg *msg = buf_msg(buf); |
c93d3baa | 811 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
1da46568 | 812 | struct tipc_bcbearer *bcbearer = tn->bcbearer; |
6beb19a6 | 813 | struct tipc_bc_base *bclink = tn->bcbase; |
b97bf3fd | 814 | |
e6160710 | 815 | /* Prepare broadcast link message for reliable transmission, |
2ff9f924 AS |
816 | * if first time trying to send it; |
817 | * preparation is skipped for broadcast link protocol messages | |
818 | * since they are sent in an unreliable manner and don't need it | |
819 | */ | |
b97bf3fd | 820 | if (likely(!msg_non_seq(buf_msg(buf)))) { |
cd3decdf | 821 | bcbuf_set_acks(buf, bclink->bcast_nodes.count); |
40aecb1b | 822 | msg_set_non_seq(msg, 1); |
c93d3baa | 823 | msg_set_mc_netid(msg, tn->net_id); |
1da46568 | 824 | tn->bcl->stats.sent_info++; |
cd3decdf | 825 | if (WARN_ON(!bclink->bcast_nodes.count)) { |
5e726900 AS |
826 | dump_stack(); |
827 | return 0; | |
828 | } | |
b97bf3fd | 829 | } |
52666986 | 830 | msg_set_mc_netid(msg, tn->net_id); |
b97bf3fd | 831 | |
b97bf3fd | 832 | /* Send buffer over bearers until all targets reached */ |
cd3decdf | 833 | bcbearer->remains = bclink->bcast_nodes; |
b97bf3fd PL |
834 | |
835 | for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { | |
2d627b92 AS |
836 | struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary; |
837 | struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary; | |
6f92ee54 JPM |
838 | struct tipc_bearer *bp[2] = {p, s}; |
839 | struct tipc_bearer *b = bp[msg_link_selector(msg)]; | |
488fc9af | 840 | struct sk_buff *tbuf; |
b97bf3fd PL |
841 | |
842 | if (!p) | |
e6160710 | 843 | break; /* No more bearers to try */ |
6f92ee54 JPM |
844 | if (!b) |
845 | b = p; | |
77861d9c | 846 | tipc_nmap_diff(&bcbearer->remains, &b->nodes, |
e6160710 | 847 | &bcbearer->remains_new); |
65f51ef0 | 848 | if (bcbearer->remains_new.count == bcbearer->remains.count) |
e6160710 | 849 | continue; /* Nothing added by bearer pair */ |
b97bf3fd | 850 | |
488fc9af GF |
851 | if (bp_index == 0) { |
852 | /* Use original buffer for first bearer */ | |
7f9f95d9 | 853 | tipc_bearer_send(net, b->identity, buf, &b->bcast_addr); |
488fc9af GF |
854 | } else { |
855 | /* Avoid concurrent buffer access */ | |
bad93e9d | 856 | tbuf = pskb_copy_for_clone(buf, GFP_ATOMIC); |
488fc9af GF |
857 | if (!tbuf) |
858 | break; | |
7f9f95d9 YX |
859 | tipc_bearer_send(net, b->identity, tbuf, |
860 | &b->bcast_addr); | |
488fc9af GF |
861 | kfree_skb(tbuf); /* Bearer keeps a clone */ |
862 | } | |
65f51ef0 | 863 | if (bcbearer->remains_new.count == 0) |
e6160710 | 864 | break; /* All targets reached */ |
b97bf3fd | 865 | |
65f51ef0 | 866 | bcbearer->remains = bcbearer->remains_new; |
b97bf3fd | 867 | } |
c4307285 | 868 | |
2ff9f924 | 869 | return 0; |
b97bf3fd PL |
870 | } |
871 | ||
2f566124 JPM |
872 | static void tipc_bcbearer_xmit(struct net *net, struct sk_buff_head *xmitq) |
873 | { | |
874 | struct sk_buff *skb, *tmp; | |
875 | ||
876 | skb_queue_walk_safe(xmitq, skb, tmp) { | |
877 | __skb_dequeue(xmitq); | |
878 | tipc_bcbearer_send(net, skb, NULL, NULL); | |
879 | ||
880 | /* Until we remove cloning in tipc_l2_send_msg(): */ | |
881 | kfree_skb(skb); | |
882 | } | |
883 | } | |
884 | ||
b97bf3fd | 885 | /** |
4323add6 | 886 | * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer |
b97bf3fd | 887 | */ |
7f9f95d9 YX |
888 | void tipc_bcbearer_sort(struct net *net, struct tipc_node_map *nm_ptr, |
889 | u32 node, bool action) | |
b97bf3fd | 890 | { |
7f9f95d9 | 891 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
1da46568 | 892 | struct tipc_bcbearer *bcbearer = tn->bcbearer; |
7f9ab6ac PG |
893 | struct tipc_bcbearer_pair *bp_temp = bcbearer->bpairs_temp; |
894 | struct tipc_bcbearer_pair *bp_curr; | |
f8322dfc | 895 | struct tipc_bearer *b; |
b97bf3fd PL |
896 | int b_index; |
897 | int pri; | |
898 | ||
1da46568 | 899 | tipc_bclink_lock(net); |
b97bf3fd | 900 | |
28dd9418 YX |
901 | if (action) |
902 | tipc_nmap_add(nm_ptr, node); | |
903 | else | |
904 | tipc_nmap_remove(nm_ptr, node); | |
905 | ||
b97bf3fd | 906 | /* Group bearers by priority (can assume max of two per priority) */ |
b97bf3fd PL |
907 | memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); |
908 | ||
f8322dfc | 909 | rcu_read_lock(); |
b97bf3fd | 910 | for (b_index = 0; b_index < MAX_BEARERS; b_index++) { |
7f9f95d9 | 911 | b = rcu_dereference_rtnl(tn->bearer_list[b_index]); |
f47de12b | 912 | if (!b || !b->nodes.count) |
b97bf3fd PL |
913 | continue; |
914 | ||
915 | if (!bp_temp[b->priority].primary) | |
916 | bp_temp[b->priority].primary = b; | |
917 | else | |
918 | bp_temp[b->priority].secondary = b; | |
919 | } | |
f8322dfc | 920 | rcu_read_unlock(); |
b97bf3fd PL |
921 | |
922 | /* Create array of bearer pairs for broadcasting */ | |
b97bf3fd PL |
923 | bp_curr = bcbearer->bpairs; |
924 | memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); | |
925 | ||
16cb4b33 | 926 | for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { |
b97bf3fd PL |
927 | |
928 | if (!bp_temp[pri].primary) | |
929 | continue; | |
930 | ||
931 | bp_curr->primary = bp_temp[pri].primary; | |
932 | ||
933 | if (bp_temp[pri].secondary) { | |
4323add6 PL |
934 | if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, |
935 | &bp_temp[pri].secondary->nodes)) { | |
b97bf3fd PL |
936 | bp_curr->secondary = bp_temp[pri].secondary; |
937 | } else { | |
938 | bp_curr++; | |
939 | bp_curr->primary = bp_temp[pri].secondary; | |
940 | } | |
941 | } | |
942 | ||
943 | bp_curr++; | |
944 | } | |
945 | ||
1da46568 | 946 | tipc_bclink_unlock(net); |
b97bf3fd PL |
947 | } |
948 | ||
d8182804 RA |
949 | static int __tipc_nl_add_bc_link_stat(struct sk_buff *skb, |
950 | struct tipc_stats *stats) | |
7be57fc6 RA |
951 | { |
952 | int i; | |
953 | struct nlattr *nest; | |
954 | ||
955 | struct nla_map { | |
956 | __u32 key; | |
957 | __u32 val; | |
958 | }; | |
959 | ||
960 | struct nla_map map[] = { | |
961 | {TIPC_NLA_STATS_RX_INFO, stats->recv_info}, | |
962 | {TIPC_NLA_STATS_RX_FRAGMENTS, stats->recv_fragments}, | |
963 | {TIPC_NLA_STATS_RX_FRAGMENTED, stats->recv_fragmented}, | |
964 | {TIPC_NLA_STATS_RX_BUNDLES, stats->recv_bundles}, | |
965 | {TIPC_NLA_STATS_RX_BUNDLED, stats->recv_bundled}, | |
966 | {TIPC_NLA_STATS_TX_INFO, stats->sent_info}, | |
967 | {TIPC_NLA_STATS_TX_FRAGMENTS, stats->sent_fragments}, | |
968 | {TIPC_NLA_STATS_TX_FRAGMENTED, stats->sent_fragmented}, | |
969 | {TIPC_NLA_STATS_TX_BUNDLES, stats->sent_bundles}, | |
970 | {TIPC_NLA_STATS_TX_BUNDLED, stats->sent_bundled}, | |
971 | {TIPC_NLA_STATS_RX_NACKS, stats->recv_nacks}, | |
972 | {TIPC_NLA_STATS_RX_DEFERRED, stats->deferred_recv}, | |
973 | {TIPC_NLA_STATS_TX_NACKS, stats->sent_nacks}, | |
974 | {TIPC_NLA_STATS_TX_ACKS, stats->sent_acks}, | |
975 | {TIPC_NLA_STATS_RETRANSMITTED, stats->retransmitted}, | |
976 | {TIPC_NLA_STATS_DUPLICATES, stats->duplicates}, | |
977 | {TIPC_NLA_STATS_LINK_CONGS, stats->link_congs}, | |
978 | {TIPC_NLA_STATS_MAX_QUEUE, stats->max_queue_sz}, | |
979 | {TIPC_NLA_STATS_AVG_QUEUE, stats->queue_sz_counts ? | |
980 | (stats->accu_queue_sz / stats->queue_sz_counts) : 0} | |
981 | }; | |
982 | ||
983 | nest = nla_nest_start(skb, TIPC_NLA_LINK_STATS); | |
984 | if (!nest) | |
985 | return -EMSGSIZE; | |
986 | ||
987 | for (i = 0; i < ARRAY_SIZE(map); i++) | |
988 | if (nla_put_u32(skb, map[i].key, map[i].val)) | |
989 | goto msg_full; | |
990 | ||
991 | nla_nest_end(skb, nest); | |
992 | ||
993 | return 0; | |
994 | msg_full: | |
995 | nla_nest_cancel(skb, nest); | |
996 | ||
997 | return -EMSGSIZE; | |
998 | } | |
999 | ||
1da46568 | 1000 | int tipc_nl_add_bc_link(struct net *net, struct tipc_nl_msg *msg) |
7be57fc6 RA |
1001 | { |
1002 | int err; | |
1003 | void *hdr; | |
1004 | struct nlattr *attrs; | |
1005 | struct nlattr *prop; | |
1da46568 YX |
1006 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
1007 | struct tipc_link *bcl = tn->bcl; | |
7be57fc6 RA |
1008 | |
1009 | if (!bcl) | |
1010 | return 0; | |
1011 | ||
1da46568 | 1012 | tipc_bclink_lock(net); |
7be57fc6 | 1013 | |
bfb3e5dd | 1014 | hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family, |
7be57fc6 RA |
1015 | NLM_F_MULTI, TIPC_NL_LINK_GET); |
1016 | if (!hdr) | |
1017 | return -EMSGSIZE; | |
1018 | ||
1019 | attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK); | |
1020 | if (!attrs) | |
1021 | goto msg_full; | |
1022 | ||
1023 | /* The broadcast link is always up */ | |
1024 | if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP)) | |
1025 | goto attr_msg_full; | |
1026 | ||
1027 | if (nla_put_flag(msg->skb, TIPC_NLA_LINK_BROADCAST)) | |
1028 | goto attr_msg_full; | |
1029 | if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, bcl->name)) | |
1030 | goto attr_msg_full; | |
a97b9d3f | 1031 | if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, bcl->rcv_nxt)) |
7be57fc6 | 1032 | goto attr_msg_full; |
a97b9d3f | 1033 | if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, bcl->snd_nxt)) |
7be57fc6 RA |
1034 | goto attr_msg_full; |
1035 | ||
1036 | prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP); | |
1037 | if (!prop) | |
1038 | goto attr_msg_full; | |
1f66d161 | 1039 | if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, bcl->window)) |
7be57fc6 RA |
1040 | goto prop_msg_full; |
1041 | nla_nest_end(msg->skb, prop); | |
1042 | ||
1043 | err = __tipc_nl_add_bc_link_stat(msg->skb, &bcl->stats); | |
1044 | if (err) | |
1045 | goto attr_msg_full; | |
1046 | ||
1da46568 | 1047 | tipc_bclink_unlock(net); |
7be57fc6 RA |
1048 | nla_nest_end(msg->skb, attrs); |
1049 | genlmsg_end(msg->skb, hdr); | |
1050 | ||
1051 | return 0; | |
1052 | ||
1053 | prop_msg_full: | |
1054 | nla_nest_cancel(msg->skb, prop); | |
1055 | attr_msg_full: | |
1056 | nla_nest_cancel(msg->skb, attrs); | |
1057 | msg_full: | |
1da46568 | 1058 | tipc_bclink_unlock(net); |
7be57fc6 RA |
1059 | genlmsg_cancel(msg->skb, hdr); |
1060 | ||
1061 | return -EMSGSIZE; | |
1062 | } | |
b97bf3fd | 1063 | |
1da46568 | 1064 | int tipc_bclink_reset_stats(struct net *net) |
b97bf3fd | 1065 | { |
1da46568 YX |
1066 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
1067 | struct tipc_link *bcl = tn->bcl; | |
1068 | ||
b97bf3fd PL |
1069 | if (!bcl) |
1070 | return -ENOPROTOOPT; | |
1071 | ||
1da46568 | 1072 | tipc_bclink_lock(net); |
b97bf3fd | 1073 | memset(&bcl->stats, 0, sizeof(bcl->stats)); |
1da46568 | 1074 | tipc_bclink_unlock(net); |
0e35fd5e | 1075 | return 0; |
b97bf3fd PL |
1076 | } |
1077 | ||
1da46568 | 1078 | int tipc_bclink_set_queue_limits(struct net *net, u32 limit) |
b97bf3fd | 1079 | { |
1da46568 YX |
1080 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
1081 | struct tipc_link *bcl = tn->bcl; | |
1082 | ||
b97bf3fd PL |
1083 | if (!bcl) |
1084 | return -ENOPROTOOPT; | |
53387c4e JPM |
1085 | if (limit < BCLINK_WIN_MIN) |
1086 | limit = BCLINK_WIN_MIN; | |
1087 | if (limit > TIPC_MAX_LINK_WIN) | |
b97bf3fd | 1088 | return -EINVAL; |
1da46568 | 1089 | tipc_bclink_lock(net); |
4323add6 | 1090 | tipc_link_set_queue_limits(bcl, limit); |
1da46568 | 1091 | tipc_bclink_unlock(net); |
0e35fd5e | 1092 | return 0; |
b97bf3fd PL |
1093 | } |
1094 | ||
670f4f88 RA |
1095 | int tipc_nl_bc_link_set(struct net *net, struct nlattr *attrs[]) |
1096 | { | |
1097 | int err; | |
1098 | u32 win; | |
1099 | struct nlattr *props[TIPC_NLA_PROP_MAX + 1]; | |
1100 | ||
1101 | if (!attrs[TIPC_NLA_LINK_PROP]) | |
1102 | return -EINVAL; | |
1103 | ||
1104 | err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP], props); | |
1105 | if (err) | |
1106 | return err; | |
1107 | ||
1108 | if (!props[TIPC_NLA_PROP_WIN]) | |
1109 | return -EOPNOTSUPP; | |
1110 | ||
1111 | win = nla_get_u32(props[TIPC_NLA_PROP_WIN]); | |
1112 | ||
1113 | return tipc_bclink_set_queue_limits(net, win); | |
1114 | } | |
1115 | ||
6beb19a6 | 1116 | int tipc_bcast_init(struct net *net) |
b97bf3fd | 1117 | { |
32301906 JPM |
1118 | struct tipc_net *tn = tipc_net(net); |
1119 | struct tipc_bcbearer *bcb = NULL; | |
1120 | struct tipc_bc_base *bb = NULL; | |
1121 | struct tipc_link *l = NULL; | |
1122 | ||
1123 | bcb = kzalloc(sizeof(*bcb), GFP_ATOMIC); | |
1124 | if (!bcb) | |
1125 | goto enomem; | |
1126 | tn->bcbearer = bcb; | |
1127 | ||
1128 | bcb->bearer.window = BCLINK_WIN_DEFAULT; | |
1129 | bcb->bearer.mtu = MAX_PKT_DEFAULT_MCAST; | |
1130 | bcb->bearer.identity = MAX_BEARERS; | |
1131 | ||
1132 | bcb->bearer.media = &bcb->media; | |
1133 | bcb->media.send_msg = tipc_bcbearer_send; | |
1134 | sprintf(bcb->media.name, "tipc-broadcast"); | |
1135 | strcpy(bcb->bearer.name, bcb->media.name); | |
1136 | ||
1137 | bb = kzalloc(sizeof(*bb), GFP_ATOMIC); | |
1138 | if (!bb) | |
1139 | goto enomem; | |
1140 | tn->bcbase = bb; | |
1141 | __skb_queue_head_init(&bb->arrvq); | |
0043550b | 1142 | spin_lock_init(&tipc_net(net)->bclock); |
32301906 JPM |
1143 | bb->node.net = net; |
1144 | ||
52666986 | 1145 | if (!tipc_link_bc_create(&bb->node, 0, 0, |
32301906 JPM |
1146 | MAX_PKT_DEFAULT_MCAST, |
1147 | BCLINK_WIN_DEFAULT, | |
fd556f20 | 1148 | 0, |
32301906 JPM |
1149 | &bb->inputq, |
1150 | &bb->namedq, | |
52666986 | 1151 | NULL, |
32301906 JPM |
1152 | &l)) |
1153 | goto enomem; | |
1154 | bb->link = l; | |
1155 | tn->bcl = l; | |
1156 | rcu_assign_pointer(tn->bearer_list[MAX_BEARERS], &bcb->bearer); | |
eb8b00f5 | 1157 | return 0; |
32301906 JPM |
1158 | enomem: |
1159 | kfree(bcb); | |
1160 | kfree(bb); | |
1161 | kfree(l); | |
1162 | return -ENOMEM; | |
b97bf3fd PL |
1163 | } |
1164 | ||
5fd9fd63 JPM |
1165 | void tipc_bcast_reinit(struct net *net) |
1166 | { | |
1167 | struct tipc_bc_base *b = tipc_bc_base(net); | |
1168 | ||
32301906 | 1169 | msg_set_prevnode(b->link->pmsg, tipc_own_addr(net)); |
5fd9fd63 JPM |
1170 | } |
1171 | ||
6beb19a6 | 1172 | void tipc_bcast_stop(struct net *net) |
b97bf3fd | 1173 | { |
7f9f95d9 YX |
1174 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
1175 | ||
1da46568 YX |
1176 | tipc_bclink_lock(net); |
1177 | tipc_link_purge_queues(tn->bcl); | |
1178 | tipc_bclink_unlock(net); | |
7f9f95d9 | 1179 | RCU_INIT_POINTER(tn->bearer_list[BCBEARER], NULL); |
eb8b00f5 | 1180 | synchronize_net(); |
1da46568 | 1181 | kfree(tn->bcbearer); |
6beb19a6 | 1182 | kfree(tn->bcbase); |
32301906 | 1183 | kfree(tn->bcl); |
b97bf3fd PL |
1184 | } |
1185 | ||
3e22e62b AS |
1186 | /** |
1187 | * tipc_nmap_add - add a node to a node map | |
1188 | */ | |
28dd9418 | 1189 | static void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node) |
3e22e62b AS |
1190 | { |
1191 | int n = tipc_node(node); | |
1192 | int w = n / WSIZE; | |
1193 | u32 mask = (1 << (n % WSIZE)); | |
1194 | ||
1195 | if ((nm_ptr->map[w] & mask) == 0) { | |
1196 | nm_ptr->count++; | |
1197 | nm_ptr->map[w] |= mask; | |
1198 | } | |
1199 | } | |
1200 | ||
1201 | /** | |
1202 | * tipc_nmap_remove - remove a node from a node map | |
1203 | */ | |
28dd9418 | 1204 | static void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node) |
3e22e62b AS |
1205 | { |
1206 | int n = tipc_node(node); | |
1207 | int w = n / WSIZE; | |
1208 | u32 mask = (1 << (n % WSIZE)); | |
1209 | ||
1210 | if ((nm_ptr->map[w] & mask) != 0) { | |
1211 | nm_ptr->map[w] &= ~mask; | |
1212 | nm_ptr->count--; | |
1213 | } | |
1214 | } | |
1215 | ||
1216 | /** | |
1217 | * tipc_nmap_diff - find differences between node maps | |
1218 | * @nm_a: input node map A | |
1219 | * @nm_b: input node map B | |
1220 | * @nm_diff: output node map A-B (i.e. nodes of A that are not in B) | |
1221 | */ | |
31e3c3f6 | 1222 | static void tipc_nmap_diff(struct tipc_node_map *nm_a, |
1223 | struct tipc_node_map *nm_b, | |
1224 | struct tipc_node_map *nm_diff) | |
3e22e62b AS |
1225 | { |
1226 | int stop = ARRAY_SIZE(nm_a->map); | |
1227 | int w; | |
1228 | int b; | |
1229 | u32 map; | |
1230 | ||
1231 | memset(nm_diff, 0, sizeof(*nm_diff)); | |
1232 | for (w = 0; w < stop; w++) { | |
1233 | map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]); | |
1234 | nm_diff->map[w] = map; | |
1235 | if (map != 0) { | |
1236 | for (b = 0 ; b < WSIZE; b++) { | |
1237 | if (map & (1 << b)) | |
1238 | nm_diff->count++; | |
1239 | } | |
1240 | } | |
1241 | } | |
1242 | } |