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 |
01fd12bb JPM |
57 | * @rcast_support: indicates if all peer nodes support replicast |
58 | * @rc_ratio: dest count as percentage of cluster size where send method changes | |
9cc1bf39 | 59 | * @bc_threshold: calculated from rc_ratio; if dests > threshold use broadcast |
6beb19a6 JPM |
60 | */ |
61 | struct tipc_bc_base { | |
32301906 | 62 | struct tipc_link *link; |
6beb19a6 | 63 | struct sk_buff_head inputq; |
b06b281e JPM |
64 | int dests[MAX_BEARERS]; |
65 | int primary_bearer; | |
9999974a | 66 | bool bcast_support; |
01fd12bb JPM |
67 | bool rcast_support; |
68 | int rc_ratio; | |
69 | int bc_threshold; | |
6beb19a6 JPM |
70 | }; |
71 | ||
5fd9fd63 JPM |
72 | static struct tipc_bc_base *tipc_bc_base(struct net *net) |
73 | { | |
74 | return tipc_net(net)->bcbase; | |
75 | } | |
76 | ||
4c94cc2d JM |
77 | /* tipc_bcast_get_mtu(): -get the MTU currently used by broadcast link |
78 | * Note: the MTU is decremented to give room for a tunnel header, in | |
79 | * case the message needs to be sent as replicast | |
80 | */ | |
959e1781 | 81 | int tipc_bcast_get_mtu(struct net *net) |
078bec82 | 82 | { |
a853e4c6 | 83 | return tipc_link_mtu(tipc_bc_sndlink(net)) - INT_H_SIZE; |
078bec82 JPM |
84 | } |
85 | ||
01fd12bb JPM |
86 | void tipc_bcast_disable_rcast(struct net *net) |
87 | { | |
88 | tipc_bc_base(net)->rcast_support = false; | |
89 | } | |
90 | ||
91 | static void tipc_bcbase_calc_bc_threshold(struct net *net) | |
92 | { | |
93 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
94 | int cluster_size = tipc_link_bc_peers(tipc_bc_sndlink(net)); | |
95 | ||
96 | bb->bc_threshold = 1 + (cluster_size * bb->rc_ratio / 100); | |
97 | } | |
98 | ||
b06b281e JPM |
99 | /* tipc_bcbase_select_primary(): find a bearer with links to all destinations, |
100 | * if any, and make it primary bearer | |
101 | */ | |
102 | static void tipc_bcbase_select_primary(struct net *net) | |
103 | { | |
104 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
105 | int all_dests = tipc_link_bc_peers(bb->link); | |
9999974a | 106 | int i, mtu, prim; |
b06b281e JPM |
107 | |
108 | bb->primary_bearer = INVALID_BEARER_ID; | |
9999974a | 109 | bb->bcast_support = true; |
b06b281e JPM |
110 | |
111 | if (!all_dests) | |
112 | return; | |
113 | ||
114 | for (i = 0; i < MAX_BEARERS; i++) { | |
959e1781 JPM |
115 | if (!bb->dests[i]) |
116 | continue; | |
117 | ||
118 | mtu = tipc_bearer_mtu(net, i); | |
119 | if (mtu < tipc_link_mtu(bb->link)) | |
120 | tipc_link_set_mtu(bb->link, mtu); | |
9999974a | 121 | bb->bcast_support &= tipc_bearer_bcast_support(net, i); |
b06b281e JPM |
122 | if (bb->dests[i] < all_dests) |
123 | continue; | |
124 | ||
125 | bb->primary_bearer = i; | |
126 | ||
127 | /* Reduce risk that all nodes select same primary */ | |
128 | if ((i ^ tipc_own_addr(net)) & 1) | |
129 | break; | |
130 | } | |
9999974a JPM |
131 | prim = bb->primary_bearer; |
132 | if (prim != INVALID_BEARER_ID) | |
133 | bb->bcast_support = tipc_bearer_bcast_support(net, prim); | |
b06b281e JPM |
134 | } |
135 | ||
136 | void tipc_bcast_inc_bearer_dst_cnt(struct net *net, int bearer_id) | |
137 | { | |
138 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
139 | ||
140 | tipc_bcast_lock(net); | |
141 | bb->dests[bearer_id]++; | |
142 | tipc_bcbase_select_primary(net); | |
143 | tipc_bcast_unlock(net); | |
144 | } | |
145 | ||
146 | void tipc_bcast_dec_bearer_dst_cnt(struct net *net, int bearer_id) | |
147 | { | |
148 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
149 | ||
150 | tipc_bcast_lock(net); | |
151 | bb->dests[bearer_id]--; | |
152 | tipc_bcbase_select_primary(net); | |
153 | tipc_bcast_unlock(net); | |
154 | } | |
155 | ||
b06b281e JPM |
156 | /* tipc_bcbase_xmit - broadcast a packet queue across one or more bearers |
157 | * | |
158 | * Note that number of reachable destinations, as indicated in the dests[] | |
159 | * array, may transitionally differ from the number of destinations indicated | |
160 | * in each sent buffer. We can sustain this. Excess destination nodes will | |
161 | * drop and never acknowledge the unexpected packets, and missing destinations | |
162 | * will either require retransmission (if they are just about to be added to | |
163 | * the bearer), or be removed from the buffer's 'ackers' counter (if they | |
164 | * just went down) | |
165 | */ | |
166 | static void tipc_bcbase_xmit(struct net *net, struct sk_buff_head *xmitq) | |
167 | { | |
168 | int bearer_id; | |
169 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
170 | struct sk_buff *skb, *_skb; | |
171 | struct sk_buff_head _xmitq; | |
172 | ||
173 | if (skb_queue_empty(xmitq)) | |
174 | return; | |
175 | ||
176 | /* The typical case: at least one bearer has links to all nodes */ | |
177 | bearer_id = bb->primary_bearer; | |
178 | if (bearer_id >= 0) { | |
179 | tipc_bearer_bc_xmit(net, bearer_id, xmitq); | |
180 | return; | |
181 | } | |
182 | ||
183 | /* We have to transmit across all bearers */ | |
184 | skb_queue_head_init(&_xmitq); | |
185 | for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) { | |
186 | if (!bb->dests[bearer_id]) | |
187 | continue; | |
188 | ||
189 | skb_queue_walk(xmitq, skb) { | |
190 | _skb = pskb_copy_for_clone(skb, GFP_ATOMIC); | |
191 | if (!_skb) | |
192 | break; | |
193 | __skb_queue_tail(&_xmitq, _skb); | |
194 | } | |
195 | tipc_bearer_bc_xmit(net, bearer_id, &_xmitq); | |
196 | } | |
197 | __skb_queue_purge(xmitq); | |
198 | __skb_queue_purge(&_xmitq); | |
199 | } | |
200 | ||
01fd12bb JPM |
201 | static void tipc_bcast_select_xmit_method(struct net *net, int dests, |
202 | struct tipc_mc_method *method) | |
203 | { | |
204 | struct tipc_bc_base *bb = tipc_bc_base(net); | |
205 | unsigned long exp = method->expires; | |
206 | ||
207 | /* Broadcast supported by used bearer/bearers? */ | |
208 | if (!bb->bcast_support) { | |
209 | method->rcast = true; | |
210 | return; | |
211 | } | |
212 | /* Any destinations which don't support replicast ? */ | |
213 | if (!bb->rcast_support) { | |
214 | method->rcast = false; | |
215 | return; | |
216 | } | |
217 | /* Can current method be changed ? */ | |
218 | method->expires = jiffies + TIPC_METHOD_EXPIRE; | |
219 | if (method->mandatory || time_before(jiffies, exp)) | |
220 | return; | |
221 | ||
222 | /* Determine method to use now */ | |
223 | method->rcast = dests <= bb->bc_threshold; | |
224 | } | |
225 | ||
a853e4c6 | 226 | /* tipc_bcast_xmit - broadcast the buffer chain to all external nodes |
f2f9800d | 227 | * @net: the applicable net namespace |
a853e4c6 JPM |
228 | * @pkts: chain of buffers containing message |
229 | * @cong_link_cnt: set to 1 if broadcast link is congested, otherwise 0 | |
365ad353 | 230 | * Consumes the buffer chain. |
a853e4c6 | 231 | * Returns 0 if success, otherwise errno: -EHOSTUNREACH,-EMSGSIZE |
078bec82 | 232 | */ |
a853e4c6 JPM |
233 | static int tipc_bcast_xmit(struct net *net, struct sk_buff_head *pkts, |
234 | u16 *cong_link_cnt) | |
078bec82 | 235 | { |
2f566124 | 236 | struct tipc_link *l = tipc_bc_sndlink(net); |
a853e4c6 | 237 | struct sk_buff_head xmitq; |
078bec82 | 238 | int rc = 0; |
078bec82 | 239 | |
3382605f | 240 | skb_queue_head_init(&xmitq); |
2f566124 JPM |
241 | tipc_bcast_lock(net); |
242 | if (tipc_link_bc_peers(l)) | |
a853e4c6 | 243 | rc = tipc_link_xmit(l, pkts, &xmitq); |
2f566124 | 244 | tipc_bcast_unlock(net); |
a853e4c6 JPM |
245 | tipc_bcbase_xmit(net, &xmitq); |
246 | __skb_queue_purge(pkts); | |
247 | if (rc == -ELINKCONG) { | |
248 | *cong_link_cnt = 1; | |
249 | rc = 0; | |
250 | } | |
251 | return rc; | |
252 | } | |
253 | ||
254 | /* tipc_rcast_xmit - replicate and send a message to given destination nodes | |
255 | * @net: the applicable net namespace | |
256 | * @pkts: chain of buffers containing message | |
257 | * @dests: list of destination nodes | |
258 | * @cong_link_cnt: returns number of congested links | |
259 | * @cong_links: returns identities of congested links | |
260 | * Returns 0 if success, otherwise errno | |
261 | */ | |
262 | static int tipc_rcast_xmit(struct net *net, struct sk_buff_head *pkts, | |
263 | struct tipc_nlist *dests, u16 *cong_link_cnt) | |
264 | { | |
a80ae530 | 265 | struct tipc_dest *dst, *tmp; |
a853e4c6 | 266 | struct sk_buff_head _pkts; |
a80ae530 | 267 | u32 dnode, selector; |
a853e4c6 JPM |
268 | |
269 | selector = msg_link_selector(buf_msg(skb_peek(pkts))); | |
3382605f | 270 | skb_queue_head_init(&_pkts); |
a853e4c6 | 271 | |
a80ae530 JM |
272 | list_for_each_entry_safe(dst, tmp, &dests->list, list) { |
273 | dnode = dst->node; | |
274 | if (!tipc_msg_pskb_copy(dnode, pkts, &_pkts)) | |
a853e4c6 | 275 | return -ENOMEM; |
078bec82 | 276 | |
a853e4c6 | 277 | /* Any other return value than -ELINKCONG is ignored */ |
a80ae530 | 278 | if (tipc_node_xmit(net, &_pkts, dnode, selector) == -ELINKCONG) |
a853e4c6 | 279 | (*cong_link_cnt)++; |
cb1b7280 | 280 | } |
a853e4c6 JPM |
281 | return 0; |
282 | } | |
52666986 | 283 | |
a853e4c6 JPM |
284 | /* tipc_mcast_xmit - deliver message to indicated destination nodes |
285 | * and to identified node local sockets | |
286 | * @net: the applicable net namespace | |
287 | * @pkts: chain of buffers containing message | |
01fd12bb JPM |
288 | * @method: send method to be used |
289 | * @dests: destination nodes for message. | |
a853e4c6 | 290 | * @cong_link_cnt: returns number of encountered congested destination links |
a853e4c6 JPM |
291 | * Consumes buffer chain. |
292 | * Returns 0 if success, otherwise errno | |
293 | */ | |
294 | int tipc_mcast_xmit(struct net *net, struct sk_buff_head *pkts, | |
01fd12bb JPM |
295 | struct tipc_mc_method *method, struct tipc_nlist *dests, |
296 | u16 *cong_link_cnt) | |
a853e4c6 | 297 | { |
a853e4c6 JPM |
298 | struct sk_buff_head inputq, localq; |
299 | int rc = 0; | |
300 | ||
301 | skb_queue_head_init(&inputq); | |
302 | skb_queue_head_init(&localq); | |
303 | ||
304 | /* Clone packets before they are consumed by next call */ | |
305 | if (dests->local && !tipc_msg_reassemble(pkts, &localq)) { | |
306 | rc = -ENOMEM; | |
307 | goto exit; | |
308 | } | |
01fd12bb | 309 | /* Send according to determined transmit method */ |
a853e4c6 | 310 | if (dests->remote) { |
01fd12bb JPM |
311 | tipc_bcast_select_xmit_method(net, dests->remote, method); |
312 | if (method->rcast) | |
a853e4c6 JPM |
313 | rc = tipc_rcast_xmit(net, pkts, dests, cong_link_cnt); |
314 | else | |
315 | rc = tipc_bcast_xmit(net, pkts, cong_link_cnt); | |
316 | } | |
317 | ||
318 | if (dests->local) | |
319 | tipc_sk_mcast_rcv(net, &localq, &inputq); | |
320 | exit: | |
01fd12bb | 321 | /* This queue should normally be empty by now */ |
a853e4c6 | 322 | __skb_queue_purge(pkts); |
365ad353 | 323 | return rc; |
078bec82 | 324 | } |
52666986 JPM |
325 | |
326 | /* tipc_bcast_rcv - receive a broadcast packet, and deliver to rcv link | |
327 | * | |
328 | * RCU is locked, no other locks set | |
329 | */ | |
330 | int tipc_bcast_rcv(struct net *net, struct tipc_link *l, struct sk_buff *skb) | |
331 | { | |
332 | struct tipc_msg *hdr = buf_msg(skb); | |
333 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq; | |
334 | struct sk_buff_head xmitq; | |
335 | int rc; | |
336 | ||
337 | __skb_queue_head_init(&xmitq); | |
338 | ||
339 | if (msg_mc_netid(hdr) != tipc_netid(net) || !tipc_link_is_up(l)) { | |
340 | kfree_skb(skb); | |
341 | return 0; | |
342 | } | |
343 | ||
344 | tipc_bcast_lock(net); | |
345 | if (msg_user(hdr) == BCAST_PROTOCOL) | |
346 | rc = tipc_link_bc_nack_rcv(l, skb, &xmitq); | |
347 | else | |
348 | rc = tipc_link_rcv(l, skb, NULL); | |
349 | tipc_bcast_unlock(net); | |
350 | ||
b06b281e | 351 | tipc_bcbase_xmit(net, &xmitq); |
52666986 JPM |
352 | |
353 | /* Any socket wakeup messages ? */ | |
354 | if (!skb_queue_empty(inputq)) | |
355 | tipc_sk_rcv(net, inputq); | |
356 | ||
357 | return rc; | |
358 | } | |
359 | ||
360 | /* tipc_bcast_ack_rcv - receive and handle a broadcast acknowledge | |
361 | * | |
362 | * RCU is locked, no other locks set | |
363 | */ | |
06bd2b1e JPM |
364 | void tipc_bcast_ack_rcv(struct net *net, struct tipc_link *l, |
365 | struct tipc_msg *hdr) | |
52666986 JPM |
366 | { |
367 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq; | |
06bd2b1e | 368 | u16 acked = msg_bcast_ack(hdr); |
52666986 JPM |
369 | struct sk_buff_head xmitq; |
370 | ||
06bd2b1e JPM |
371 | /* Ignore bc acks sent by peer before bcast synch point was received */ |
372 | if (msg_bc_ack_invalid(hdr)) | |
373 | return; | |
374 | ||
52666986 JPM |
375 | __skb_queue_head_init(&xmitq); |
376 | ||
377 | tipc_bcast_lock(net); | |
378 | tipc_link_bc_ack_rcv(l, acked, &xmitq); | |
379 | tipc_bcast_unlock(net); | |
380 | ||
b06b281e | 381 | tipc_bcbase_xmit(net, &xmitq); |
52666986 JPM |
382 | |
383 | /* Any socket wakeup messages ? */ | |
384 | if (!skb_queue_empty(inputq)) | |
385 | tipc_sk_rcv(net, inputq); | |
386 | } | |
387 | ||
388 | /* tipc_bcast_synch_rcv - check and update rcv link with peer's send state | |
389 | * | |
390 | * RCU is locked, no other locks set | |
391 | */ | |
02d11ca2 JPM |
392 | int tipc_bcast_sync_rcv(struct net *net, struct tipc_link *l, |
393 | struct tipc_msg *hdr) | |
52666986 JPM |
394 | { |
395 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq; | |
396 | struct sk_buff_head xmitq; | |
02d11ca2 | 397 | int rc = 0; |
52666986 JPM |
398 | |
399 | __skb_queue_head_init(&xmitq); | |
400 | ||
401 | tipc_bcast_lock(net); | |
06bd2b1e JPM |
402 | if (msg_type(hdr) != STATE_MSG) { |
403 | tipc_link_bc_init_rcv(l, hdr); | |
404 | } else if (!msg_bc_ack_invalid(hdr)) { | |
52666986 | 405 | tipc_link_bc_ack_rcv(l, msg_bcast_ack(hdr), &xmitq); |
02d11ca2 | 406 | rc = tipc_link_bc_sync_rcv(l, hdr, &xmitq); |
52666986 JPM |
407 | } |
408 | tipc_bcast_unlock(net); | |
409 | ||
b06b281e | 410 | tipc_bcbase_xmit(net, &xmitq); |
52666986 JPM |
411 | |
412 | /* Any socket wakeup messages ? */ | |
413 | if (!skb_queue_empty(inputq)) | |
414 | tipc_sk_rcv(net, inputq); | |
02d11ca2 | 415 | return rc; |
52666986 JPM |
416 | } |
417 | ||
418 | /* tipc_bcast_add_peer - add a peer node to broadcast link and bearer | |
419 | * | |
420 | * RCU is locked, node lock is set | |
421 | */ | |
b06b281e | 422 | void tipc_bcast_add_peer(struct net *net, struct tipc_link *uc_l, |
52666986 JPM |
423 | struct sk_buff_head *xmitq) |
424 | { | |
52666986 JPM |
425 | struct tipc_link *snd_l = tipc_bc_sndlink(net); |
426 | ||
b06b281e | 427 | tipc_bcast_lock(net); |
52666986 | 428 | tipc_link_add_bc_peer(snd_l, uc_l, xmitq); |
b06b281e | 429 | tipc_bcbase_select_primary(net); |
01fd12bb | 430 | tipc_bcbase_calc_bc_threshold(net); |
b06b281e | 431 | tipc_bcast_unlock(net); |
52666986 JPM |
432 | } |
433 | ||
434 | /* tipc_bcast_remove_peer - remove a peer node from broadcast link and bearer | |
435 | * | |
436 | * RCU is locked, node lock is set | |
437 | */ | |
b06b281e | 438 | void tipc_bcast_remove_peer(struct net *net, struct tipc_link *rcv_l) |
52666986 | 439 | { |
52666986 | 440 | struct tipc_link *snd_l = tipc_bc_sndlink(net); |
b06b281e | 441 | struct sk_buff_head *inputq = &tipc_bc_base(net)->inputq; |
52666986 JPM |
442 | struct sk_buff_head xmitq; |
443 | ||
444 | __skb_queue_head_init(&xmitq); | |
445 | ||
b06b281e | 446 | tipc_bcast_lock(net); |
52666986 | 447 | tipc_link_remove_bc_peer(snd_l, rcv_l, &xmitq); |
b06b281e | 448 | tipc_bcbase_select_primary(net); |
01fd12bb | 449 | tipc_bcbase_calc_bc_threshold(net); |
b06b281e | 450 | tipc_bcast_unlock(net); |
52666986 | 451 | |
b06b281e | 452 | tipc_bcbase_xmit(net, &xmitq); |
52666986 JPM |
453 | |
454 | /* Any socket wakeup messages ? */ | |
455 | if (!skb_queue_empty(inputq)) | |
456 | tipc_sk_rcv(net, inputq); | |
457 | } | |
458 | ||
1da46568 | 459 | int tipc_bclink_reset_stats(struct net *net) |
b97bf3fd | 460 | { |
38206d59 | 461 | struct tipc_link *l = tipc_bc_sndlink(net); |
1da46568 | 462 | |
38206d59 | 463 | if (!l) |
b97bf3fd PL |
464 | return -ENOPROTOOPT; |
465 | ||
2af5ae37 | 466 | tipc_bcast_lock(net); |
38206d59 | 467 | tipc_link_reset_stats(l); |
2af5ae37 | 468 | tipc_bcast_unlock(net); |
0e35fd5e | 469 | return 0; |
b97bf3fd PL |
470 | } |
471 | ||
2af5ae37 | 472 | static int tipc_bc_link_set_queue_limits(struct net *net, u32 limit) |
b97bf3fd | 473 | { |
2af5ae37 | 474 | struct tipc_link *l = tipc_bc_sndlink(net); |
1da46568 | 475 | |
2af5ae37 | 476 | if (!l) |
b97bf3fd | 477 | return -ENOPROTOOPT; |
53387c4e JPM |
478 | if (limit < BCLINK_WIN_MIN) |
479 | limit = BCLINK_WIN_MIN; | |
480 | if (limit > TIPC_MAX_LINK_WIN) | |
b97bf3fd | 481 | return -EINVAL; |
2af5ae37 JPM |
482 | tipc_bcast_lock(net); |
483 | tipc_link_set_queue_limits(l, limit); | |
484 | tipc_bcast_unlock(net); | |
0e35fd5e | 485 | return 0; |
b97bf3fd PL |
486 | } |
487 | ||
670f4f88 RA |
488 | int tipc_nl_bc_link_set(struct net *net, struct nlattr *attrs[]) |
489 | { | |
490 | int err; | |
491 | u32 win; | |
492 | struct nlattr *props[TIPC_NLA_PROP_MAX + 1]; | |
493 | ||
494 | if (!attrs[TIPC_NLA_LINK_PROP]) | |
495 | return -EINVAL; | |
496 | ||
497 | err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP], props); | |
498 | if (err) | |
499 | return err; | |
500 | ||
501 | if (!props[TIPC_NLA_PROP_WIN]) | |
502 | return -EOPNOTSUPP; | |
503 | ||
504 | win = nla_get_u32(props[TIPC_NLA_PROP_WIN]); | |
505 | ||
2af5ae37 | 506 | return tipc_bc_link_set_queue_limits(net, win); |
670f4f88 RA |
507 | } |
508 | ||
6beb19a6 | 509 | int tipc_bcast_init(struct net *net) |
b97bf3fd | 510 | { |
32301906 | 511 | struct tipc_net *tn = tipc_net(net); |
32301906 JPM |
512 | struct tipc_bc_base *bb = NULL; |
513 | struct tipc_link *l = NULL; | |
514 | ||
a0732548 | 515 | bb = kzalloc(sizeof(*bb), GFP_KERNEL); |
32301906 JPM |
516 | if (!bb) |
517 | goto enomem; | |
518 | tn->bcbase = bb; | |
0043550b | 519 | spin_lock_init(&tipc_net(net)->bclock); |
32301906 | 520 | |
c72fa872 | 521 | if (!tipc_link_bc_create(net, 0, 0, |
4c94cc2d | 522 | FB_MTU, |
32301906 | 523 | BCLINK_WIN_DEFAULT, |
fd556f20 | 524 | 0, |
32301906 | 525 | &bb->inputq, |
2af5ae37 | 526 | NULL, |
52666986 | 527 | NULL, |
32301906 JPM |
528 | &l)) |
529 | goto enomem; | |
530 | bb->link = l; | |
531 | tn->bcl = l; | |
01fd12bb JPM |
532 | bb->rc_ratio = 25; |
533 | bb->rcast_support = true; | |
eb8b00f5 | 534 | return 0; |
32301906 | 535 | enomem: |
32301906 JPM |
536 | kfree(bb); |
537 | kfree(l); | |
538 | return -ENOMEM; | |
b97bf3fd PL |
539 | } |
540 | ||
6beb19a6 | 541 | void tipc_bcast_stop(struct net *net) |
b97bf3fd | 542 | { |
7f9f95d9 YX |
543 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
544 | ||
eb8b00f5 | 545 | synchronize_net(); |
6beb19a6 | 546 | kfree(tn->bcbase); |
32301906 | 547 | kfree(tn->bcl); |
b97bf3fd | 548 | } |
2ae0b8af JPM |
549 | |
550 | void tipc_nlist_init(struct tipc_nlist *nl, u32 self) | |
551 | { | |
552 | memset(nl, 0, sizeof(*nl)); | |
553 | INIT_LIST_HEAD(&nl->list); | |
554 | nl->self = self; | |
555 | } | |
556 | ||
557 | void tipc_nlist_add(struct tipc_nlist *nl, u32 node) | |
558 | { | |
559 | if (node == nl->self) | |
560 | nl->local = true; | |
a80ae530 | 561 | else if (tipc_dest_push(&nl->list, node, 0)) |
2ae0b8af JPM |
562 | nl->remote++; |
563 | } | |
564 | ||
565 | void tipc_nlist_del(struct tipc_nlist *nl, u32 node) | |
566 | { | |
567 | if (node == nl->self) | |
568 | nl->local = false; | |
a80ae530 | 569 | else if (tipc_dest_del(&nl->list, node, 0)) |
2ae0b8af JPM |
570 | nl->remote--; |
571 | } | |
572 | ||
573 | void tipc_nlist_purge(struct tipc_nlist *nl) | |
574 | { | |
a80ae530 | 575 | tipc_dest_list_purge(&nl->list); |
2ae0b8af | 576 | nl->remote = 0; |
c9efb15a | 577 | nl->local = false; |
2ae0b8af | 578 | } |