Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/bcast.c: TIPC broadcast code | |
c4307285 | 3 | * |
4c94cc2d | 4 | * Copyright (c) 2004-2006, 2014-2017, 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" |
6beb19a6 | 42 | #include "link.h" |
2ae0b8af | 43 | #include "name_table.h" |
b97bf3fd | 44 | |
4c94cc2d JM |
45 | #define BCLINK_WIN_DEFAULT 50 /* bcast link window size (default) */ |
46 | #define BCLINK_WIN_MIN 32 /* bcast minimum link window size */ | |
b97bf3fd | 47 | |
3aec9cc9 | 48 | const char tipc_bclink_name[] = "broadcast-link"; |
b97bf3fd | 49 | |
6beb19a6 | 50 | /** |
2af5ae37 | 51 | * struct tipc_bc_base - base structure for keeping broadcast send state |
b06b281e | 52 | * @link: broadcast send link structure |
2af5ae37 | 53 | * @inputq: data input queue; will only carry SOCK_WAKEUP messages |
9cc1bf39 | 54 | * @dests: array keeping number of reachable destinations per bearer |
2af5ae37 | 55 | * @primary_bearer: a bearer having links to all broadcast destinations, if any |
9999974a | 56 | * @bcast_support: indicates if primary bearer, if any, supports broadcast |
02ec6caf | 57 | * @force_bcast: forces broadcast for multicast traffic |
01fd12bb | 58 | * @rcast_support: indicates if all peer nodes support replicast |
02ec6caf | 59 | * @force_rcast: forces replicast for multicast traffic |
01fd12bb | 60 | * @rc_ratio: dest count as percentage of cluster size where send method changes |
9cc1bf39 | 61 | * @bc_threshold: calculated from rc_ratio; if dests > threshold use broadcast |
6beb19a6 JPM |
62 | */ |
63 | struct tipc_bc_base { | |
32301906 | 64 | struct tipc_link *link; |
6beb19a6 | 65 | struct sk_buff_head inputq; |
b06b281e JPM |
66 | int dests[MAX_BEARERS]; |
67 | int primary_bearer; | |
9999974a | 68 | bool bcast_support; |
02ec6caf | 69 | bool force_bcast; |
01fd12bb | 70 | bool rcast_support; |
02ec6caf | 71 | bool force_rcast; |
01fd12bb JPM |
72 | int rc_ratio; |
73 | int bc_threshold; | |
6beb19a6 JPM |
74 | }; |
75 | ||
5fd9fd63 JPM |
76 | static struct tipc_bc_base *tipc_bc_base(struct net *net) |
77 | { | |
78 | return tipc_net(net)->bcbase; | |
79 | } | |
80 | ||
4c94cc2d JM |
81 | /* tipc_bcast_get_mtu(): -get the MTU currently used by broadcast link |
82 | * Note: the MTU is decremented to give room for a tunnel header, in | |
83 | * case the message needs to be sent as replicast | |
84 | */ | |
959e1781 | 85 | int tipc_bcast_get_mtu(struct net *net) |
078bec82 | 86 | { |
fc1b6d6d | 87 | return tipc_link_mss(tipc_bc_sndlink(net)); |
078bec82 JPM |
88 | } |
89 | ||
ba5f6a86 | 90 | void tipc_bcast_toggle_rcast(struct net *net, bool supp) |
01fd12bb | 91 | { |
ba5f6a86 | 92 | tipc_bc_base(net)->rcast_support = supp; |
01fd12bb JPM |
93 | } |
94 | ||
95 | static void tipc_bcbase_calc_bc_threshold(struct net *net) | |
96 | { | |
97 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
98 | int cluster_size = tipc_link_bc_peers(tipc_bc_sndlink(net)); | |
99 | ||
100 | bb->bc_threshold = 1 + (cluster_size * bb->rc_ratio / 100); | |
101 | } | |
102 | ||
b06b281e JPM |
103 | /* tipc_bcbase_select_primary(): find a bearer with links to all destinations, |
104 | * if any, and make it primary bearer | |
105 | */ | |
106 | static void tipc_bcbase_select_primary(struct net *net) | |
107 | { | |
108 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
109 | int all_dests = tipc_link_bc_peers(bb->link); | |
9999974a | 110 | int i, mtu, prim; |
b06b281e JPM |
111 | |
112 | bb->primary_bearer = INVALID_BEARER_ID; | |
9999974a | 113 | bb->bcast_support = true; |
b06b281e JPM |
114 | |
115 | if (!all_dests) | |
116 | return; | |
117 | ||
118 | for (i = 0; i < MAX_BEARERS; i++) { | |
959e1781 JPM |
119 | if (!bb->dests[i]) |
120 | continue; | |
121 | ||
122 | mtu = tipc_bearer_mtu(net, i); | |
123 | if (mtu < tipc_link_mtu(bb->link)) | |
124 | tipc_link_set_mtu(bb->link, mtu); | |
9999974a | 125 | bb->bcast_support &= tipc_bearer_bcast_support(net, i); |
b06b281e JPM |
126 | if (bb->dests[i] < all_dests) |
127 | continue; | |
128 | ||
129 | bb->primary_bearer = i; | |
130 | ||
131 | /* Reduce risk that all nodes select same primary */ | |
132 | if ((i ^ tipc_own_addr(net)) & 1) | |
133 | break; | |
134 | } | |
9999974a JPM |
135 | prim = bb->primary_bearer; |
136 | if (prim != INVALID_BEARER_ID) | |
137 | bb->bcast_support = tipc_bearer_bcast_support(net, prim); | |
b06b281e JPM |
138 | } |
139 | ||
140 | void tipc_bcast_inc_bearer_dst_cnt(struct net *net, int bearer_id) | |
141 | { | |
142 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
143 | ||
144 | tipc_bcast_lock(net); | |
145 | bb->dests[bearer_id]++; | |
146 | tipc_bcbase_select_primary(net); | |
147 | tipc_bcast_unlock(net); | |
148 | } | |
149 | ||
150 | void tipc_bcast_dec_bearer_dst_cnt(struct net *net, int bearer_id) | |
151 | { | |
152 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
153 | ||
154 | tipc_bcast_lock(net); | |
155 | bb->dests[bearer_id]--; | |
156 | tipc_bcbase_select_primary(net); | |
157 | tipc_bcast_unlock(net); | |
158 | } | |
159 | ||
b06b281e JPM |
160 | /* tipc_bcbase_xmit - broadcast a packet queue across one or more bearers |
161 | * | |
162 | * Note that number of reachable destinations, as indicated in the dests[] | |
163 | * array, may transitionally differ from the number of destinations indicated | |
164 | * in each sent buffer. We can sustain this. Excess destination nodes will | |
165 | * drop and never acknowledge the unexpected packets, and missing destinations | |
166 | * will either require retransmission (if they are just about to be added to | |
167 | * the bearer), or be removed from the buffer's 'ackers' counter (if they | |
168 | * just went down) | |
169 | */ | |
170 | static void tipc_bcbase_xmit(struct net *net, struct sk_buff_head *xmitq) | |
171 | { | |
172 | int bearer_id; | |
173 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
174 | struct sk_buff *skb, *_skb; | |
175 | struct sk_buff_head _xmitq; | |
176 | ||
177 | if (skb_queue_empty(xmitq)) | |
178 | return; | |
179 | ||
180 | /* The typical case: at least one bearer has links to all nodes */ | |
181 | bearer_id = bb->primary_bearer; | |
182 | if (bearer_id >= 0) { | |
183 | tipc_bearer_bc_xmit(net, bearer_id, xmitq); | |
184 | return; | |
185 | } | |
186 | ||
187 | /* We have to transmit across all bearers */ | |
e654f9f5 | 188 | __skb_queue_head_init(&_xmitq); |
b06b281e JPM |
189 | for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) { |
190 | if (!bb->dests[bearer_id]) | |
191 | continue; | |
192 | ||
193 | skb_queue_walk(xmitq, skb) { | |
194 | _skb = pskb_copy_for_clone(skb, GFP_ATOMIC); | |
195 | if (!_skb) | |
196 | break; | |
197 | __skb_queue_tail(&_xmitq, _skb); | |
198 | } | |
199 | tipc_bearer_bc_xmit(net, bearer_id, &_xmitq); | |
200 | } | |
201 | __skb_queue_purge(xmitq); | |
202 | __skb_queue_purge(&_xmitq); | |
203 | } | |
204 | ||
01fd12bb JPM |
205 | static void tipc_bcast_select_xmit_method(struct net *net, int dests, |
206 | struct tipc_mc_method *method) | |
207 | { | |
208 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
209 | unsigned long exp = method->expires; | |
210 | ||
211 | /* Broadcast supported by used bearer/bearers? */ | |
212 | if (!bb->bcast_support) { | |
213 | method->rcast = true; | |
214 | return; | |
215 | } | |
216 | /* Any destinations which don't support replicast ? */ | |
217 | if (!bb->rcast_support) { | |
218 | method->rcast = false; | |
219 | return; | |
220 | } | |
221 | /* Can current method be changed ? */ | |
222 | method->expires = jiffies + TIPC_METHOD_EXPIRE; | |
c55c8eda | 223 | if (method->mandatory) |
01fd12bb JPM |
224 | return; |
225 | ||
c55c8eda HL |
226 | if (!(tipc_net(net)->capabilities & TIPC_MCAST_RBCTL) && |
227 | time_before(jiffies, exp)) | |
228 | return; | |
229 | ||
230 | /* Configuration as force 'broadcast' method */ | |
231 | if (bb->force_bcast) { | |
232 | method->rcast = false; | |
233 | return; | |
234 | } | |
235 | /* Configuration as force 'replicast' method */ | |
236 | if (bb->force_rcast) { | |
237 | method->rcast = true; | |
238 | return; | |
239 | } | |
240 | /* Configuration as 'autoselect' or default method */ | |
01fd12bb JPM |
241 | /* Determine method to use now */ |
242 | method->rcast = dests <= bb->bc_threshold; | |
243 | } | |
244 | ||
a853e4c6 | 245 | /* tipc_bcast_xmit - broadcast the buffer chain to all external nodes |
f2f9800d | 246 | * @net: the applicable net namespace |
a853e4c6 JPM |
247 | * @pkts: chain of buffers containing message |
248 | * @cong_link_cnt: set to 1 if broadcast link is congested, otherwise 0 | |
365ad353 | 249 | * Consumes the buffer chain. |
a853e4c6 | 250 | * Returns 0 if success, otherwise errno: -EHOSTUNREACH,-EMSGSIZE |
078bec82 | 251 | */ |
a853e4c6 JPM |
252 | static int tipc_bcast_xmit(struct net *net, struct sk_buff_head *pkts, |
253 | u16 *cong_link_cnt) | |
078bec82 | 254 | { |
2f566124 | 255 | struct tipc_link *l = tipc_bc_sndlink(net); |
a853e4c6 | 256 | struct sk_buff_head xmitq; |
078bec82 | 257 | int rc = 0; |
078bec82 | 258 | |
e654f9f5 | 259 | __skb_queue_head_init(&xmitq); |
2f566124 JPM |
260 | tipc_bcast_lock(net); |
261 | if (tipc_link_bc_peers(l)) | |
a853e4c6 | 262 | rc = tipc_link_xmit(l, pkts, &xmitq); |
2f566124 | 263 | tipc_bcast_unlock(net); |
a853e4c6 JPM |
264 | tipc_bcbase_xmit(net, &xmitq); |
265 | __skb_queue_purge(pkts); | |
266 | if (rc == -ELINKCONG) { | |
267 | *cong_link_cnt = 1; | |
268 | rc = 0; | |
269 | } | |
270 | return rc; | |
271 | } | |
272 | ||
273 | /* tipc_rcast_xmit - replicate and send a message to given destination nodes | |
274 | * @net: the applicable net namespace | |
275 | * @pkts: chain of buffers containing message | |
276 | * @dests: list of destination nodes | |
277 | * @cong_link_cnt: returns number of congested links | |
278 | * @cong_links: returns identities of congested links | |
279 | * Returns 0 if success, otherwise errno | |
280 | */ | |
281 | static int tipc_rcast_xmit(struct net *net, struct sk_buff_head *pkts, | |
282 | struct tipc_nlist *dests, u16 *cong_link_cnt) | |
283 | { | |
a80ae530 | 284 | struct tipc_dest *dst, *tmp; |
a853e4c6 | 285 | struct sk_buff_head _pkts; |
a80ae530 | 286 | u32 dnode, selector; |
a853e4c6 JPM |
287 | |
288 | selector = msg_link_selector(buf_msg(skb_peek(pkts))); | |
e654f9f5 | 289 | __skb_queue_head_init(&_pkts); |
a853e4c6 | 290 | |
a80ae530 JM |
291 | list_for_each_entry_safe(dst, tmp, &dests->list, list) { |
292 | dnode = dst->node; | |
293 | if (!tipc_msg_pskb_copy(dnode, pkts, &_pkts)) | |
a853e4c6 | 294 | return -ENOMEM; |
078bec82 | 295 | |
a853e4c6 | 296 | /* Any other return value than -ELINKCONG is ignored */ |
a80ae530 | 297 | if (tipc_node_xmit(net, &_pkts, dnode, selector) == -ELINKCONG) |
a853e4c6 | 298 | (*cong_link_cnt)++; |
cb1b7280 | 299 | } |
a853e4c6 JPM |
300 | return 0; |
301 | } | |
52666986 | 302 | |
c55c8eda HL |
303 | /* tipc_mcast_send_sync - deliver a dummy message with SYN bit |
304 | * @net: the applicable net namespace | |
305 | * @skb: socket buffer to copy | |
306 | * @method: send method to be used | |
307 | * @dests: destination nodes for message. | |
308 | * @cong_link_cnt: returns number of encountered congested destination links | |
309 | * Returns 0 if success, otherwise errno | |
310 | */ | |
311 | static int tipc_mcast_send_sync(struct net *net, struct sk_buff *skb, | |
312 | struct tipc_mc_method *method, | |
313 | struct tipc_nlist *dests, | |
314 | u16 *cong_link_cnt) | |
315 | { | |
316 | struct tipc_msg *hdr, *_hdr; | |
317 | struct sk_buff_head tmpq; | |
318 | struct sk_buff *_skb; | |
319 | ||
320 | /* Is a cluster supporting with new capabilities ? */ | |
321 | if (!(tipc_net(net)->capabilities & TIPC_MCAST_RBCTL)) | |
322 | return 0; | |
323 | ||
324 | hdr = buf_msg(skb); | |
325 | if (msg_user(hdr) == MSG_FRAGMENTER) | |
a7dc51ad | 326 | hdr = msg_inner_hdr(hdr); |
c55c8eda HL |
327 | if (msg_type(hdr) != TIPC_MCAST_MSG) |
328 | return 0; | |
329 | ||
330 | /* Allocate dummy message */ | |
331 | _skb = tipc_buf_acquire(MCAST_H_SIZE, GFP_KERNEL); | |
6da88a82 | 332 | if (!_skb) |
c55c8eda HL |
333 | return -ENOMEM; |
334 | ||
335 | /* Preparing for 'synching' header */ | |
336 | msg_set_syn(hdr, 1); | |
337 | ||
338 | /* Copy skb's header into a dummy header */ | |
339 | skb_copy_to_linear_data(_skb, hdr, MCAST_H_SIZE); | |
340 | skb_orphan(_skb); | |
341 | ||
342 | /* Reverse method for dummy message */ | |
343 | _hdr = buf_msg(_skb); | |
344 | msg_set_size(_hdr, MCAST_H_SIZE); | |
345 | msg_set_is_rcast(_hdr, !msg_is_rcast(hdr)); | |
346 | ||
e654f9f5 | 347 | __skb_queue_head_init(&tmpq); |
c55c8eda HL |
348 | __skb_queue_tail(&tmpq, _skb); |
349 | if (method->rcast) | |
350 | tipc_bcast_xmit(net, &tmpq, cong_link_cnt); | |
351 | else | |
352 | tipc_rcast_xmit(net, &tmpq, dests, cong_link_cnt); | |
353 | ||
354 | /* This queue should normally be empty by now */ | |
355 | __skb_queue_purge(&tmpq); | |
356 | ||
357 | return 0; | |
358 | } | |
359 | ||
a853e4c6 JPM |
360 | /* tipc_mcast_xmit - deliver message to indicated destination nodes |
361 | * and to identified node local sockets | |
362 | * @net: the applicable net namespace | |
363 | * @pkts: chain of buffers containing message | |
01fd12bb JPM |
364 | * @method: send method to be used |
365 | * @dests: destination nodes for message. | |
a853e4c6 | 366 | * @cong_link_cnt: returns number of encountered congested destination links |
a853e4c6 JPM |
367 | * Consumes buffer chain. |
368 | * Returns 0 if success, otherwise errno | |
369 | */ | |
370 | int tipc_mcast_xmit(struct net *net, struct sk_buff_head *pkts, | |
01fd12bb JPM |
371 | struct tipc_mc_method *method, struct tipc_nlist *dests, |
372 | u16 *cong_link_cnt) | |
a853e4c6 | 373 | { |
a853e4c6 | 374 | struct sk_buff_head inputq, localq; |
c55c8eda HL |
375 | bool rcast = method->rcast; |
376 | struct tipc_msg *hdr; | |
377 | struct sk_buff *skb; | |
a853e4c6 JPM |
378 | int rc = 0; |
379 | ||
380 | skb_queue_head_init(&inputq); | |
e654f9f5 | 381 | __skb_queue_head_init(&localq); |
a853e4c6 JPM |
382 | |
383 | /* Clone packets before they are consumed by next call */ | |
384 | if (dests->local && !tipc_msg_reassemble(pkts, &localq)) { | |
385 | rc = -ENOMEM; | |
386 | goto exit; | |
387 | } | |
01fd12bb | 388 | /* Send according to determined transmit method */ |
a853e4c6 | 389 | if (dests->remote) { |
01fd12bb | 390 | tipc_bcast_select_xmit_method(net, dests->remote, method); |
c55c8eda HL |
391 | |
392 | skb = skb_peek(pkts); | |
393 | hdr = buf_msg(skb); | |
394 | if (msg_user(hdr) == MSG_FRAGMENTER) | |
a7dc51ad | 395 | hdr = msg_inner_hdr(hdr); |
c55c8eda HL |
396 | msg_set_is_rcast(hdr, method->rcast); |
397 | ||
398 | /* Switch method ? */ | |
399 | if (rcast != method->rcast) | |
400 | tipc_mcast_send_sync(net, skb, method, | |
401 | dests, cong_link_cnt); | |
402 | ||
01fd12bb | 403 | if (method->rcast) |
a853e4c6 JPM |
404 | rc = tipc_rcast_xmit(net, pkts, dests, cong_link_cnt); |
405 | else | |
406 | rc = tipc_bcast_xmit(net, pkts, cong_link_cnt); | |
407 | } | |
408 | ||
6c9081a3 JR |
409 | if (dests->local) { |
410 | tipc_loopback_trace(net, &localq); | |
a853e4c6 | 411 | tipc_sk_mcast_rcv(net, &localq, &inputq); |
6c9081a3 | 412 | } |
a853e4c6 | 413 | exit: |
01fd12bb | 414 | /* This queue should normally be empty by now */ |
a853e4c6 | 415 | __skb_queue_purge(pkts); |
365ad353 | 416 | return rc; |
078bec82 | 417 | } |
52666986 JPM |
418 | |
419 | /* tipc_bcast_rcv - receive a broadcast packet, and deliver to rcv link | |
420 | * | |
421 | * RCU is locked, no other locks set | |
422 | */ | |
423 | int tipc_bcast_rcv(struct net *net, struct tipc_link *l, struct sk_buff *skb) | |
424 | { | |
425 | struct tipc_msg *hdr = buf_msg(skb); | |
426 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq; | |
427 | struct sk_buff_head xmitq; | |
428 | int rc; | |
429 | ||
430 | __skb_queue_head_init(&xmitq); | |
431 | ||
432 | if (msg_mc_netid(hdr) != tipc_netid(net) || !tipc_link_is_up(l)) { | |
433 | kfree_skb(skb); | |
434 | return 0; | |
435 | } | |
436 | ||
437 | tipc_bcast_lock(net); | |
438 | if (msg_user(hdr) == BCAST_PROTOCOL) | |
439 | rc = tipc_link_bc_nack_rcv(l, skb, &xmitq); | |
440 | else | |
441 | rc = tipc_link_rcv(l, skb, NULL); | |
442 | tipc_bcast_unlock(net); | |
443 | ||
b06b281e | 444 | tipc_bcbase_xmit(net, &xmitq); |
52666986 JPM |
445 | |
446 | /* Any socket wakeup messages ? */ | |
447 | if (!skb_queue_empty(inputq)) | |
448 | tipc_sk_rcv(net, inputq); | |
449 | ||
450 | return rc; | |
451 | } | |
452 | ||
453 | /* tipc_bcast_ack_rcv - receive and handle a broadcast acknowledge | |
454 | * | |
455 | * RCU is locked, no other locks set | |
456 | */ | |
06bd2b1e JPM |
457 | void tipc_bcast_ack_rcv(struct net *net, struct tipc_link *l, |
458 | struct tipc_msg *hdr) | |
52666986 JPM |
459 | { |
460 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq; | |
06bd2b1e | 461 | u16 acked = msg_bcast_ack(hdr); |
52666986 JPM |
462 | struct sk_buff_head xmitq; |
463 | ||
06bd2b1e JPM |
464 | /* Ignore bc acks sent by peer before bcast synch point was received */ |
465 | if (msg_bc_ack_invalid(hdr)) | |
466 | return; | |
467 | ||
52666986 JPM |
468 | __skb_queue_head_init(&xmitq); |
469 | ||
470 | tipc_bcast_lock(net); | |
471 | tipc_link_bc_ack_rcv(l, acked, &xmitq); | |
472 | tipc_bcast_unlock(net); | |
473 | ||
b06b281e | 474 | tipc_bcbase_xmit(net, &xmitq); |
52666986 JPM |
475 | |
476 | /* Any socket wakeup messages ? */ | |
477 | if (!skb_queue_empty(inputq)) | |
478 | tipc_sk_rcv(net, inputq); | |
479 | } | |
480 | ||
481 | /* tipc_bcast_synch_rcv - check and update rcv link with peer's send state | |
482 | * | |
483 | * RCU is locked, no other locks set | |
484 | */ | |
02d11ca2 JPM |
485 | int tipc_bcast_sync_rcv(struct net *net, struct tipc_link *l, |
486 | struct tipc_msg *hdr) | |
52666986 JPM |
487 | { |
488 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq; | |
489 | struct sk_buff_head xmitq; | |
02d11ca2 | 490 | int rc = 0; |
52666986 JPM |
491 | |
492 | __skb_queue_head_init(&xmitq); | |
493 | ||
494 | tipc_bcast_lock(net); | |
06bd2b1e JPM |
495 | if (msg_type(hdr) != STATE_MSG) { |
496 | tipc_link_bc_init_rcv(l, hdr); | |
497 | } else if (!msg_bc_ack_invalid(hdr)) { | |
52666986 | 498 | tipc_link_bc_ack_rcv(l, msg_bcast_ack(hdr), &xmitq); |
02d11ca2 | 499 | rc = tipc_link_bc_sync_rcv(l, hdr, &xmitq); |
52666986 JPM |
500 | } |
501 | tipc_bcast_unlock(net); | |
502 | ||
b06b281e | 503 | tipc_bcbase_xmit(net, &xmitq); |
52666986 JPM |
504 | |
505 | /* Any socket wakeup messages ? */ | |
506 | if (!skb_queue_empty(inputq)) | |
507 | tipc_sk_rcv(net, inputq); | |
02d11ca2 | 508 | return rc; |
52666986 JPM |
509 | } |
510 | ||
511 | /* tipc_bcast_add_peer - add a peer node to broadcast link and bearer | |
512 | * | |
513 | * RCU is locked, node lock is set | |
514 | */ | |
b06b281e | 515 | void tipc_bcast_add_peer(struct net *net, struct tipc_link *uc_l, |
52666986 JPM |
516 | struct sk_buff_head *xmitq) |
517 | { | |
52666986 JPM |
518 | struct tipc_link *snd_l = tipc_bc_sndlink(net); |
519 | ||
b06b281e | 520 | tipc_bcast_lock(net); |
52666986 | 521 | tipc_link_add_bc_peer(snd_l, uc_l, xmitq); |
b06b281e | 522 | tipc_bcbase_select_primary(net); |
01fd12bb | 523 | tipc_bcbase_calc_bc_threshold(net); |
b06b281e | 524 | tipc_bcast_unlock(net); |
52666986 JPM |
525 | } |
526 | ||
527 | /* tipc_bcast_remove_peer - remove a peer node from broadcast link and bearer | |
528 | * | |
529 | * RCU is locked, node lock is set | |
530 | */ | |
b06b281e | 531 | void tipc_bcast_remove_peer(struct net *net, struct tipc_link *rcv_l) |
52666986 | 532 | { |
52666986 | 533 | struct tipc_link *snd_l = tipc_bc_sndlink(net); |
b06b281e | 534 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq; |
52666986 JPM |
535 | struct sk_buff_head xmitq; |
536 | ||
537 | __skb_queue_head_init(&xmitq); | |
538 | ||
b06b281e | 539 | tipc_bcast_lock(net); |
52666986 | 540 | tipc_link_remove_bc_peer(snd_l, rcv_l, &xmitq); |
b06b281e | 541 | tipc_bcbase_select_primary(net); |
01fd12bb | 542 | tipc_bcbase_calc_bc_threshold(net); |
b06b281e | 543 | tipc_bcast_unlock(net); |
52666986 | 544 | |
b06b281e | 545 | tipc_bcbase_xmit(net, &xmitq); |
52666986 JPM |
546 | |
547 | /* Any socket wakeup messages ? */ | |
548 | if (!skb_queue_empty(inputq)) | |
549 | tipc_sk_rcv(net, inputq); | |
550 | } | |
551 | ||
1da46568 | 552 | int tipc_bclink_reset_stats(struct net *net) |
b97bf3fd | 553 | { |
38206d59 | 554 | struct tipc_link *l = tipc_bc_sndlink(net); |
1da46568 | 555 | |
38206d59 | 556 | if (!l) |
b97bf3fd PL |
557 | return -ENOPROTOOPT; |
558 | ||
2af5ae37 | 559 | tipc_bcast_lock(net); |
38206d59 | 560 | tipc_link_reset_stats(l); |
2af5ae37 | 561 | tipc_bcast_unlock(net); |
0e35fd5e | 562 | return 0; |
b97bf3fd PL |
563 | } |
564 | ||
2af5ae37 | 565 | static int tipc_bc_link_set_queue_limits(struct net *net, u32 limit) |
b97bf3fd | 566 | { |
2af5ae37 | 567 | struct tipc_link *l = tipc_bc_sndlink(net); |
1da46568 | 568 | |
2af5ae37 | 569 | if (!l) |
b97bf3fd | 570 | return -ENOPROTOOPT; |
53387c4e JPM |
571 | if (limit < BCLINK_WIN_MIN) |
572 | limit = BCLINK_WIN_MIN; | |
573 | if (limit > TIPC_MAX_LINK_WIN) | |
b97bf3fd | 574 | return -EINVAL; |
2af5ae37 JPM |
575 | tipc_bcast_lock(net); |
576 | tipc_link_set_queue_limits(l, limit); | |
577 | tipc_bcast_unlock(net); | |
0e35fd5e | 578 | return 0; |
b97bf3fd PL |
579 | } |
580 | ||
02ec6caf HL |
581 | static int tipc_bc_link_set_broadcast_mode(struct net *net, u32 bc_mode) |
582 | { | |
583 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
584 | ||
585 | switch (bc_mode) { | |
586 | case BCLINK_MODE_BCAST: | |
587 | if (!bb->bcast_support) | |
588 | return -ENOPROTOOPT; | |
589 | ||
590 | bb->force_bcast = true; | |
591 | bb->force_rcast = false; | |
592 | break; | |
593 | case BCLINK_MODE_RCAST: | |
594 | if (!bb->rcast_support) | |
595 | return -ENOPROTOOPT; | |
596 | ||
597 | bb->force_bcast = false; | |
598 | bb->force_rcast = true; | |
599 | break; | |
600 | case BCLINK_MODE_SEL: | |
601 | if (!bb->bcast_support || !bb->rcast_support) | |
602 | return -ENOPROTOOPT; | |
603 | ||
604 | bb->force_bcast = false; | |
605 | bb->force_rcast = false; | |
606 | break; | |
607 | default: | |
608 | return -EINVAL; | |
609 | } | |
610 | ||
611 | return 0; | |
612 | } | |
613 | ||
614 | static int tipc_bc_link_set_broadcast_ratio(struct net *net, u32 bc_ratio) | |
615 | { | |
616 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
617 | ||
618 | if (!bb->bcast_support || !bb->rcast_support) | |
619 | return -ENOPROTOOPT; | |
620 | ||
621 | if (bc_ratio > 100 || bc_ratio <= 0) | |
622 | return -EINVAL; | |
623 | ||
624 | bb->rc_ratio = bc_ratio; | |
625 | tipc_bcast_lock(net); | |
626 | tipc_bcbase_calc_bc_threshold(net); | |
627 | tipc_bcast_unlock(net); | |
628 | ||
629 | return 0; | |
630 | } | |
631 | ||
670f4f88 RA |
632 | int tipc_nl_bc_link_set(struct net *net, struct nlattr *attrs[]) |
633 | { | |
634 | int err; | |
635 | u32 win; | |
02ec6caf HL |
636 | u32 bc_mode; |
637 | u32 bc_ratio; | |
670f4f88 RA |
638 | struct nlattr *props[TIPC_NLA_PROP_MAX + 1]; |
639 | ||
640 | if (!attrs[TIPC_NLA_LINK_PROP]) | |
641 | return -EINVAL; | |
642 | ||
643 | err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP], props); | |
644 | if (err) | |
645 | return err; | |
646 | ||
02ec6caf HL |
647 | if (!props[TIPC_NLA_PROP_WIN] && |
648 | !props[TIPC_NLA_PROP_BROADCAST] && | |
649 | !props[TIPC_NLA_PROP_BROADCAST_RATIO]) { | |
670f4f88 | 650 | return -EOPNOTSUPP; |
02ec6caf HL |
651 | } |
652 | ||
653 | if (props[TIPC_NLA_PROP_BROADCAST]) { | |
654 | bc_mode = nla_get_u32(props[TIPC_NLA_PROP_BROADCAST]); | |
655 | err = tipc_bc_link_set_broadcast_mode(net, bc_mode); | |
656 | } | |
670f4f88 | 657 | |
02ec6caf HL |
658 | if (!err && props[TIPC_NLA_PROP_BROADCAST_RATIO]) { |
659 | bc_ratio = nla_get_u32(props[TIPC_NLA_PROP_BROADCAST_RATIO]); | |
660 | err = tipc_bc_link_set_broadcast_ratio(net, bc_ratio); | |
661 | } | |
670f4f88 | 662 | |
02ec6caf HL |
663 | if (!err && props[TIPC_NLA_PROP_WIN]) { |
664 | win = nla_get_u32(props[TIPC_NLA_PROP_WIN]); | |
665 | err = tipc_bc_link_set_queue_limits(net, win); | |
666 | } | |
667 | ||
668 | return err; | |
670f4f88 RA |
669 | } |
670 | ||
6beb19a6 | 671 | int tipc_bcast_init(struct net *net) |
b97bf3fd | 672 | { |
32301906 | 673 | struct tipc_net *tn = tipc_net(net); |
32301906 JPM |
674 | struct tipc_bc_base *bb = NULL; |
675 | struct tipc_link *l = NULL; | |
676 | ||
a0732548 | 677 | bb = kzalloc(sizeof(*bb), GFP_KERNEL); |
32301906 JPM |
678 | if (!bb) |
679 | goto enomem; | |
680 | tn->bcbase = bb; | |
0043550b | 681 | spin_lock_init(&tipc_net(net)->bclock); |
32301906 | 682 | |
c72fa872 | 683 | if (!tipc_link_bc_create(net, 0, 0, |
4c94cc2d | 684 | FB_MTU, |
32301906 | 685 | BCLINK_WIN_DEFAULT, |
fd556f20 | 686 | 0, |
32301906 | 687 | &bb->inputq, |
2af5ae37 | 688 | NULL, |
52666986 | 689 | NULL, |
32301906 JPM |
690 | &l)) |
691 | goto enomem; | |
692 | bb->link = l; | |
693 | tn->bcl = l; | |
02ec6caf | 694 | bb->rc_ratio = 10; |
01fd12bb | 695 | bb->rcast_support = true; |
eb8b00f5 | 696 | return 0; |
32301906 | 697 | enomem: |
32301906 JPM |
698 | kfree(bb); |
699 | kfree(l); | |
700 | return -ENOMEM; | |
b97bf3fd PL |
701 | } |
702 | ||
6beb19a6 | 703 | void tipc_bcast_stop(struct net *net) |
b97bf3fd | 704 | { |
7f9f95d9 YX |
705 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
706 | ||
eb8b00f5 | 707 | synchronize_net(); |
6beb19a6 | 708 | kfree(tn->bcbase); |
32301906 | 709 | kfree(tn->bcl); |
b97bf3fd | 710 | } |
2ae0b8af JPM |
711 | |
712 | void tipc_nlist_init(struct tipc_nlist *nl, u32 self) | |
713 | { | |
714 | memset(nl, 0, sizeof(*nl)); | |
715 | INIT_LIST_HEAD(&nl->list); | |
716 | nl->self = self; | |
717 | } | |
718 | ||
719 | void tipc_nlist_add(struct tipc_nlist *nl, u32 node) | |
720 | { | |
721 | if (node == nl->self) | |
722 | nl->local = true; | |
a80ae530 | 723 | else if (tipc_dest_push(&nl->list, node, 0)) |
2ae0b8af JPM |
724 | nl->remote++; |
725 | } | |
726 | ||
727 | void tipc_nlist_del(struct tipc_nlist *nl, u32 node) | |
728 | { | |
729 | if (node == nl->self) | |
730 | nl->local = false; | |
a80ae530 | 731 | else if (tipc_dest_del(&nl->list, node, 0)) |
2ae0b8af JPM |
732 | nl->remote--; |
733 | } | |
734 | ||
735 | void tipc_nlist_purge(struct tipc_nlist *nl) | |
736 | { | |
a80ae530 | 737 | tipc_dest_list_purge(&nl->list); |
2ae0b8af | 738 | nl->remote = 0; |
c9efb15a | 739 | nl->local = false; |
2ae0b8af | 740 | } |
02ec6caf HL |
741 | |
742 | u32 tipc_bcast_get_broadcast_mode(struct net *net) | |
743 | { | |
744 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
745 | ||
746 | if (bb->force_bcast) | |
747 | return BCLINK_MODE_BCAST; | |
748 | ||
749 | if (bb->force_rcast) | |
750 | return BCLINK_MODE_RCAST; | |
751 | ||
752 | if (bb->bcast_support && bb->rcast_support) | |
753 | return BCLINK_MODE_SEL; | |
754 | ||
755 | return 0; | |
756 | } | |
757 | ||
758 | u32 tipc_bcast_get_broadcast_ratio(struct net *net) | |
759 | { | |
760 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
761 | ||
762 | return bb->rc_ratio; | |
763 | } | |
c55c8eda | 764 | |
08e046c8 | 765 | void tipc_mcast_filter_msg(struct net *net, struct sk_buff_head *defq, |
c55c8eda HL |
766 | struct sk_buff_head *inputq) |
767 | { | |
768 | struct sk_buff *skb, *_skb, *tmp; | |
769 | struct tipc_msg *hdr, *_hdr; | |
770 | bool match = false; | |
771 | u32 node, port; | |
772 | ||
773 | skb = skb_peek(inputq); | |
e1279ff7 HL |
774 | if (!skb) |
775 | return; | |
776 | ||
c55c8eda HL |
777 | hdr = buf_msg(skb); |
778 | ||
779 | if (likely(!msg_is_syn(hdr) && skb_queue_empty(defq))) | |
780 | return; | |
781 | ||
782 | node = msg_orignode(hdr); | |
08e046c8 HL |
783 | if (node == tipc_own_addr(net)) |
784 | return; | |
785 | ||
c55c8eda HL |
786 | port = msg_origport(hdr); |
787 | ||
788 | /* Has the twin SYN message already arrived ? */ | |
789 | skb_queue_walk(defq, _skb) { | |
790 | _hdr = buf_msg(_skb); | |
791 | if (msg_orignode(_hdr) != node) | |
792 | continue; | |
793 | if (msg_origport(_hdr) != port) | |
794 | continue; | |
795 | match = true; | |
796 | break; | |
797 | } | |
798 | ||
799 | if (!match) { | |
800 | if (!msg_is_syn(hdr)) | |
801 | return; | |
802 | __skb_dequeue(inputq); | |
803 | __skb_queue_tail(defq, skb); | |
804 | return; | |
805 | } | |
806 | ||
807 | /* Deliver non-SYN message from other link, otherwise queue it */ | |
808 | if (!msg_is_syn(hdr)) { | |
809 | if (msg_is_rcast(hdr) != msg_is_rcast(_hdr)) | |
810 | return; | |
811 | __skb_dequeue(inputq); | |
812 | __skb_queue_tail(defq, skb); | |
813 | return; | |
814 | } | |
815 | ||
816 | /* Queue non-SYN/SYN message from same link */ | |
817 | if (msg_is_rcast(hdr) == msg_is_rcast(_hdr)) { | |
818 | __skb_dequeue(inputq); | |
819 | __skb_queue_tail(defq, skb); | |
820 | return; | |
821 | } | |
822 | ||
823 | /* Matching SYN messages => return the one with data, if any */ | |
824 | __skb_unlink(_skb, defq); | |
825 | if (msg_data_sz(hdr)) { | |
826 | kfree_skb(_skb); | |
827 | } else { | |
828 | __skb_dequeue(inputq); | |
829 | kfree_skb(skb); | |
830 | __skb_queue_tail(inputq, _skb); | |
831 | } | |
832 | ||
833 | /* Deliver subsequent non-SYN messages from same peer */ | |
834 | skb_queue_walk_safe(defq, _skb, tmp) { | |
835 | _hdr = buf_msg(_skb); | |
836 | if (msg_orignode(_hdr) != node) | |
837 | continue; | |
838 | if (msg_origport(_hdr) != port) | |
839 | continue; | |
840 | if (msg_is_syn(_hdr)) | |
841 | break; | |
842 | __skb_unlink(_skb, defq); | |
843 | __skb_queue_tail(inputq, _skb); | |
844 | } | |
845 | } |