Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/bcast.c: TIPC broadcast code | |
c4307285 | 3 | * |
078bec82 | 4 | * Copyright (c) 2004-2006, 2014, 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 | ||
38 | #include "core.h" | |
b97bf3fd | 39 | #include "link.h" |
078bec82 JPM |
40 | #include "socket.h" |
41 | #include "msg.h" | |
b97bf3fd | 42 | #include "bcast.h" |
9f6bdcd4 | 43 | #include "name_distr.h" |
b97bf3fd | 44 | |
987b58be YX |
45 | #define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */ |
46 | #define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */ | |
47 | #define BCBEARER MAX_BEARERS | |
b97bf3fd | 48 | |
b97bf3fd | 49 | /** |
7f9ab6ac | 50 | * struct tipc_bcbearer_pair - a pair of bearers used by broadcast link |
b97bf3fd PL |
51 | * @primary: pointer to primary bearer |
52 | * @secondary: pointer to secondary bearer | |
c4307285 YH |
53 | * |
54 | * Bearers must have same priority and same set of reachable destinations | |
b97bf3fd PL |
55 | * to be paired. |
56 | */ | |
57 | ||
7f9ab6ac | 58 | struct tipc_bcbearer_pair { |
2d627b92 AS |
59 | struct tipc_bearer *primary; |
60 | struct tipc_bearer *secondary; | |
b97bf3fd PL |
61 | }; |
62 | ||
63 | /** | |
7f9ab6ac | 64 | * struct tipc_bcbearer - bearer used by broadcast link |
b97bf3fd PL |
65 | * @bearer: (non-standard) broadcast bearer structure |
66 | * @media: (non-standard) broadcast media structure | |
67 | * @bpairs: array of bearer pairs | |
65f51ef0 AS |
68 | * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort() |
69 | * @remains: temporary node map used by tipc_bcbearer_send() | |
70 | * @remains_new: temporary node map used tipc_bcbearer_send() | |
c4307285 | 71 | * |
65f51ef0 AS |
72 | * Note: The fields labelled "temporary" are incorporated into the bearer |
73 | * to avoid consuming potentially limited stack space through the use of | |
74 | * large local variables within multicast routines. Concurrent access is | |
d69afc90 | 75 | * prevented through use of the spinlock "bclink_lock". |
b97bf3fd | 76 | */ |
7f9ab6ac | 77 | struct tipc_bcbearer { |
2d627b92 | 78 | struct tipc_bearer bearer; |
358a0d1c | 79 | struct tipc_media media; |
7f9ab6ac PG |
80 | struct tipc_bcbearer_pair bpairs[MAX_BEARERS]; |
81 | struct tipc_bcbearer_pair bpairs_temp[TIPC_MAX_LINK_PRI + 1]; | |
6c00055a DM |
82 | struct tipc_node_map remains; |
83 | struct tipc_node_map remains_new; | |
b97bf3fd PL |
84 | }; |
85 | ||
86 | /** | |
6765fd67 | 87 | * struct tipc_bclink - link used for broadcast messages |
d69afc90 | 88 | * @lock: spinlock governing access to structure |
b97bf3fd PL |
89 | * @link: (non-standard) broadcast link structure |
90 | * @node: (non-standard) node structure representing b'cast link's peer node | |
3f5a12bd | 91 | * @flags: represent bclink states |
cd3decdf | 92 | * @bcast_nodes: map of broadcast-capable nodes |
01d83edd | 93 | * @retransmit_to: node that most recently requested a retransmit |
c4307285 | 94 | * |
b97bf3fd PL |
95 | * Handles sequence numbering, fragmentation, bundling, etc. |
96 | */ | |
6765fd67 | 97 | struct tipc_bclink { |
d69afc90 | 98 | spinlock_t lock; |
a18c4bc3 | 99 | struct tipc_link link; |
6c00055a | 100 | struct tipc_node node; |
3f5a12bd | 101 | unsigned int flags; |
cd3decdf | 102 | struct tipc_node_map bcast_nodes; |
01d83edd | 103 | struct tipc_node *retransmit_to; |
b97bf3fd PL |
104 | }; |
105 | ||
eb8b00f5 YX |
106 | static struct tipc_bcbearer *bcbearer; |
107 | static struct tipc_bclink *bclink; | |
108 | static struct tipc_link *bcl; | |
b97bf3fd | 109 | |
3aec9cc9 | 110 | const char tipc_bclink_name[] = "broadcast-link"; |
b97bf3fd | 111 | |
31e3c3f6 | 112 | static void tipc_nmap_diff(struct tipc_node_map *nm_a, |
113 | struct tipc_node_map *nm_b, | |
114 | struct tipc_node_map *nm_diff); | |
28dd9418 YX |
115 | static void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node); |
116 | static void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node); | |
b97bf3fd | 117 | |
d69afc90 YX |
118 | static void tipc_bclink_lock(void) |
119 | { | |
120 | spin_lock_bh(&bclink->lock); | |
121 | } | |
122 | ||
123 | static void tipc_bclink_unlock(void) | |
124 | { | |
3f5a12bd YX |
125 | struct tipc_node *node = NULL; |
126 | ||
127 | if (likely(!bclink->flags)) { | |
128 | spin_unlock_bh(&bclink->lock); | |
129 | return; | |
130 | } | |
131 | ||
132 | if (bclink->flags & TIPC_BCLINK_RESET) { | |
133 | bclink->flags &= ~TIPC_BCLINK_RESET; | |
134 | node = tipc_bclink_retransmit_to(); | |
135 | } | |
d69afc90 | 136 | spin_unlock_bh(&bclink->lock); |
3f5a12bd YX |
137 | |
138 | if (node) | |
139 | tipc_link_reset_all(node); | |
140 | } | |
141 | ||
078bec82 JPM |
142 | uint tipc_bclink_get_mtu(void) |
143 | { | |
144 | return MAX_PKT_DEFAULT_MCAST; | |
145 | } | |
146 | ||
3f5a12bd YX |
147 | void tipc_bclink_set_flags(unsigned int flags) |
148 | { | |
149 | bclink->flags |= flags; | |
d69afc90 YX |
150 | } |
151 | ||
05790c64 | 152 | static u32 bcbuf_acks(struct sk_buff *buf) |
b97bf3fd | 153 | { |
880b005f | 154 | return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle; |
b97bf3fd PL |
155 | } |
156 | ||
05790c64 | 157 | static void bcbuf_set_acks(struct sk_buff *buf, u32 acks) |
b97bf3fd | 158 | { |
880b005f | 159 | TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks; |
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 | ||
cd3decdf AS |
167 | void tipc_bclink_add_node(u32 addr) |
168 | { | |
d69afc90 | 169 | tipc_bclink_lock(); |
cd3decdf | 170 | tipc_nmap_add(&bclink->bcast_nodes, addr); |
d69afc90 | 171 | tipc_bclink_unlock(); |
cd3decdf AS |
172 | } |
173 | ||
174 | void tipc_bclink_remove_node(u32 addr) | |
175 | { | |
d69afc90 | 176 | tipc_bclink_lock(); |
cd3decdf | 177 | tipc_nmap_remove(&bclink->bcast_nodes, addr); |
d69afc90 | 178 | tipc_bclink_unlock(); |
cd3decdf | 179 | } |
b97bf3fd | 180 | |
5b1f7bde AS |
181 | static void bclink_set_last_sent(void) |
182 | { | |
183 | if (bcl->next_out) | |
184 | bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1); | |
185 | else | |
186 | bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1); | |
187 | } | |
188 | ||
189 | u32 tipc_bclink_get_last_sent(void) | |
190 | { | |
191 | return bcl->fsm_msg_cnt; | |
192 | } | |
193 | ||
7a54d4a9 | 194 | static void bclink_update_last_sent(struct tipc_node *node, u32 seqno) |
b97bf3fd | 195 | { |
7a54d4a9 AS |
196 | node->bclink.last_sent = less_eq(node->bclink.last_sent, seqno) ? |
197 | seqno : node->bclink.last_sent; | |
b97bf3fd PL |
198 | } |
199 | ||
b97bf3fd | 200 | |
2c53040f | 201 | /** |
01d83edd AS |
202 | * tipc_bclink_retransmit_to - get most recent node to request retransmission |
203 | * | |
d69afc90 | 204 | * Called with bclink_lock locked |
01d83edd | 205 | */ |
01d83edd AS |
206 | struct tipc_node *tipc_bclink_retransmit_to(void) |
207 | { | |
208 | return bclink->retransmit_to; | |
209 | } | |
210 | ||
c4307285 | 211 | /** |
b97bf3fd PL |
212 | * bclink_retransmit_pkt - retransmit broadcast packets |
213 | * @after: sequence number of last packet to *not* retransmit | |
214 | * @to: sequence number of last packet to retransmit | |
c4307285 | 215 | * |
d69afc90 | 216 | * Called with bclink_lock locked |
b97bf3fd | 217 | */ |
b97bf3fd PL |
218 | static void bclink_retransmit_pkt(u32 after, u32 to) |
219 | { | |
58dc55f2 | 220 | struct sk_buff *skb; |
b97bf3fd | 221 | |
58dc55f2 YX |
222 | skb_queue_walk(&bcl->outqueue, skb) { |
223 | if (more(buf_seqno(skb), after)) | |
224 | break; | |
225 | } | |
226 | tipc_link_retransmit(bcl, skb, mod(to - after)); | |
b97bf3fd PL |
227 | } |
228 | ||
908344cd JM |
229 | /** |
230 | * tipc_bclink_wakeup_users - wake up pending users | |
231 | * | |
232 | * Called with no locks taken | |
233 | */ | |
234 | void tipc_bclink_wakeup_users(void) | |
235 | { | |
4988bb4a EH |
236 | struct sk_buff *skb; |
237 | ||
238 | while ((skb = skb_dequeue(&bclink->link.waiting_sks))) | |
239 | tipc_sk_rcv(skb); | |
240 | ||
908344cd JM |
241 | } |
242 | ||
c4307285 | 243 | /** |
4323add6 | 244 | * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets |
b97bf3fd PL |
245 | * @n_ptr: node that sent acknowledgement info |
246 | * @acked: broadcast sequence # that has been acknowledged | |
c4307285 | 247 | * |
d69afc90 | 248 | * Node is locked, bclink_lock unlocked. |
b97bf3fd | 249 | */ |
6c00055a | 250 | void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked) |
b97bf3fd | 251 | { |
58dc55f2 | 252 | struct sk_buff *skb, *tmp; |
b97bf3fd PL |
253 | struct sk_buff *next; |
254 | unsigned int released = 0; | |
255 | ||
d69afc90 | 256 | tipc_bclink_lock(); |
36559591 | 257 | /* Bail out if tx queue is empty (no clean up is required) */ |
58dc55f2 YX |
258 | skb = skb_peek(&bcl->outqueue); |
259 | if (!skb) | |
36559591 AS |
260 | goto exit; |
261 | ||
262 | /* Determine which messages need to be acknowledged */ | |
263 | if (acked == INVALID_LINK_SEQ) { | |
264 | /* | |
265 | * Contact with specified node has been lost, so need to | |
266 | * acknowledge sent messages only (if other nodes still exist) | |
267 | * or both sent and unsent messages (otherwise) | |
268 | */ | |
269 | if (bclink->bcast_nodes.count) | |
270 | acked = bcl->fsm_msg_cnt; | |
271 | else | |
272 | acked = bcl->next_out_no; | |
273 | } else { | |
274 | /* | |
275 | * Bail out if specified sequence number does not correspond | |
276 | * to a message that has been sent and not yet acknowledged | |
277 | */ | |
58dc55f2 | 278 | if (less(acked, buf_seqno(skb)) || |
36559591 AS |
279 | less(bcl->fsm_msg_cnt, acked) || |
280 | less_eq(acked, n_ptr->bclink.acked)) | |
281 | goto exit; | |
282 | } | |
283 | ||
284 | /* Skip over packets that node has previously acknowledged */ | |
58dc55f2 YX |
285 | skb_queue_walk(&bcl->outqueue, skb) { |
286 | if (more(buf_seqno(skb), n_ptr->bclink.acked)) | |
287 | break; | |
288 | } | |
b97bf3fd PL |
289 | |
290 | /* Update packets that node is now acknowledging */ | |
58dc55f2 YX |
291 | skb_queue_walk_from_safe(&bcl->outqueue, skb, tmp) { |
292 | if (more(buf_seqno(skb), acked)) | |
293 | break; | |
b97bf3fd | 294 | |
58dc55f2 YX |
295 | next = tipc_skb_queue_next(&bcl->outqueue, skb); |
296 | if (skb != bcl->next_out) { | |
297 | bcbuf_decr_acks(skb); | |
298 | } else { | |
299 | bcbuf_set_acks(skb, 0); | |
10745cd5 AS |
300 | bcl->next_out = next; |
301 | bclink_set_last_sent(); | |
302 | } | |
303 | ||
58dc55f2 YX |
304 | if (bcbuf_acks(skb) == 0) { |
305 | __skb_unlink(skb, &bcl->outqueue); | |
306 | kfree_skb(skb); | |
b97bf3fd PL |
307 | released = 1; |
308 | } | |
b97bf3fd PL |
309 | } |
310 | n_ptr->bclink.acked = acked; | |
311 | ||
312 | /* Try resolving broadcast link congestion, if necessary */ | |
5b1f7bde | 313 | if (unlikely(bcl->next_out)) { |
47b4c9a8 | 314 | tipc_link_push_packets(bcl); |
5b1f7bde AS |
315 | bclink_set_last_sent(); |
316 | } | |
50100a5e | 317 | if (unlikely(released && !skb_queue_empty(&bcl->waiting_sks))) |
908344cd JM |
318 | n_ptr->action_flags |= TIPC_WAKEUP_BCAST_USERS; |
319 | ||
36559591 | 320 | exit: |
d69afc90 | 321 | tipc_bclink_unlock(); |
b97bf3fd PL |
322 | } |
323 | ||
2c53040f | 324 | /** |
7a54d4a9 | 325 | * tipc_bclink_update_link_state - update broadcast link state |
c4307285 | 326 | * |
7216cd94 | 327 | * RCU and node lock set |
b97bf3fd | 328 | */ |
7a54d4a9 | 329 | void tipc_bclink_update_link_state(struct tipc_node *n_ptr, u32 last_sent) |
b97bf3fd | 330 | { |
7a54d4a9 | 331 | struct sk_buff *buf; |
b97bf3fd | 332 | |
7a54d4a9 | 333 | /* Ignore "stale" link state info */ |
7a54d4a9 AS |
334 | if (less_eq(last_sent, n_ptr->bclink.last_in)) |
335 | return; | |
b97bf3fd | 336 | |
7a54d4a9 | 337 | /* Update link synchronization state; quit if in sync */ |
7a54d4a9 AS |
338 | bclink_update_last_sent(n_ptr, last_sent); |
339 | ||
340 | if (n_ptr->bclink.last_sent == n_ptr->bclink.last_in) | |
341 | return; | |
342 | ||
343 | /* Update out-of-sync state; quit if loss is still unconfirmed */ | |
7a54d4a9 AS |
344 | if ((++n_ptr->bclink.oos_state) == 1) { |
345 | if (n_ptr->bclink.deferred_size < (TIPC_MIN_LINK_WIN / 2)) | |
346 | return; | |
347 | n_ptr->bclink.oos_state++; | |
348 | } | |
349 | ||
350 | /* Don't NACK if one has been recently sent (or seen) */ | |
7a54d4a9 | 351 | if (n_ptr->bclink.oos_state & 0x1) |
b97bf3fd PL |
352 | return; |
353 | ||
7a54d4a9 | 354 | /* Send NACK */ |
31e3c3f6 | 355 | buf = tipc_buf_acquire(INT_H_SIZE); |
b97bf3fd | 356 | if (buf) { |
7a54d4a9 | 357 | struct tipc_msg *msg = buf_msg(buf); |
bc6fecd4 YX |
358 | struct sk_buff *skb = skb_peek(&n_ptr->bclink.deferred_queue); |
359 | u32 to = skb ? buf_seqno(skb) - 1 : n_ptr->bclink.last_sent; | |
7a54d4a9 | 360 | |
c68ca7b7 | 361 | tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG, |
7a54d4a9 | 362 | INT_H_SIZE, n_ptr->addr); |
bf781ecf | 363 | msg_set_non_seq(msg, 1); |
b97bf3fd | 364 | msg_set_mc_netid(msg, tipc_net_id); |
7a54d4a9 AS |
365 | msg_set_bcast_ack(msg, n_ptr->bclink.last_in); |
366 | msg_set_bcgap_after(msg, n_ptr->bclink.last_in); | |
bc6fecd4 | 367 | msg_set_bcgap_to(msg, to); |
b97bf3fd | 368 | |
d69afc90 | 369 | tipc_bclink_lock(); |
7a2f7d18 | 370 | tipc_bearer_send(MAX_BEARERS, buf, NULL); |
0f38513d | 371 | bcl->stats.sent_nacks++; |
d69afc90 | 372 | tipc_bclink_unlock(); |
5f6d9123 | 373 | kfree_skb(buf); |
b97bf3fd | 374 | |
7a54d4a9 | 375 | n_ptr->bclink.oos_state++; |
b97bf3fd PL |
376 | } |
377 | } | |
378 | ||
2c53040f | 379 | /** |
7a54d4a9 | 380 | * bclink_peek_nack - monitor retransmission requests sent by other nodes |
b97bf3fd | 381 | * |
7a54d4a9 AS |
382 | * Delay any upcoming NACK by this node if another node has already |
383 | * requested the first message this node is going to ask for. | |
b97bf3fd | 384 | */ |
7a54d4a9 | 385 | static void bclink_peek_nack(struct tipc_msg *msg) |
b97bf3fd | 386 | { |
7a54d4a9 | 387 | struct tipc_node *n_ptr = tipc_node_find(msg_destnode(msg)); |
b97bf3fd | 388 | |
7a54d4a9 | 389 | if (unlikely(!n_ptr)) |
b97bf3fd | 390 | return; |
7a54d4a9 | 391 | |
4323add6 | 392 | tipc_node_lock(n_ptr); |
7a54d4a9 | 393 | |
389dd9bc | 394 | if (n_ptr->bclink.recv_permitted && |
7a54d4a9 AS |
395 | (n_ptr->bclink.last_in != n_ptr->bclink.last_sent) && |
396 | (n_ptr->bclink.last_in == msg_bcgap_after(msg))) | |
397 | n_ptr->bclink.oos_state = 2; | |
398 | ||
4323add6 | 399 | tipc_node_unlock(n_ptr); |
b97bf3fd PL |
400 | } |
401 | ||
9fbfb8b1 JPM |
402 | /* tipc_bclink_xmit - broadcast buffer chain to all nodes in cluster |
403 | * and to identified node local sockets | |
a6ca1094 | 404 | * @list: chain of buffers containing message |
078bec82 JPM |
405 | * Consumes the buffer chain, except when returning -ELINKCONG |
406 | * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE | |
407 | */ | |
a6ca1094 | 408 | int tipc_bclink_xmit(struct sk_buff_head *list) |
078bec82 JPM |
409 | { |
410 | int rc = 0; | |
411 | int bc = 0; | |
a6ca1094 | 412 | struct sk_buff *skb; |
078bec82 JPM |
413 | |
414 | /* Prepare clone of message for local node */ | |
a6ca1094 YX |
415 | skb = tipc_msg_reassemble(list); |
416 | if (unlikely(!skb)) { | |
417 | __skb_queue_purge(list); | |
078bec82 JPM |
418 | return -EHOSTUNREACH; |
419 | } | |
420 | ||
421 | /* Broadcast to all other nodes */ | |
422 | if (likely(bclink)) { | |
423 | tipc_bclink_lock(); | |
424 | if (likely(bclink->bcast_nodes.count)) { | |
a6ca1094 | 425 | rc = __tipc_link_xmit(bcl, list); |
078bec82 | 426 | if (likely(!rc)) { |
58dc55f2 YX |
427 | u32 len = skb_queue_len(&bcl->outqueue); |
428 | ||
078bec82 JPM |
429 | bclink_set_last_sent(); |
430 | bcl->stats.queue_sz_counts++; | |
58dc55f2 | 431 | bcl->stats.accu_queue_sz += len; |
078bec82 JPM |
432 | } |
433 | bc = 1; | |
434 | } | |
435 | tipc_bclink_unlock(); | |
436 | } | |
437 | ||
438 | if (unlikely(!bc)) | |
a6ca1094 | 439 | __skb_queue_purge(list); |
078bec82 JPM |
440 | |
441 | /* Deliver message clone */ | |
442 | if (likely(!rc)) | |
a6ca1094 | 443 | tipc_sk_mcast_rcv(skb); |
078bec82 | 444 | else |
a6ca1094 | 445 | kfree_skb(skb); |
078bec82 JPM |
446 | |
447 | return rc; | |
448 | } | |
449 | ||
2c53040f | 450 | /** |
63e7f1ac AS |
451 | * bclink_accept_pkt - accept an incoming, in-sequence broadcast packet |
452 | * | |
d69afc90 | 453 | * Called with both sending node's lock and bclink_lock taken. |
63e7f1ac | 454 | */ |
63e7f1ac AS |
455 | static void bclink_accept_pkt(struct tipc_node *node, u32 seqno) |
456 | { | |
457 | bclink_update_last_sent(node, seqno); | |
458 | node->bclink.last_in = seqno; | |
459 | node->bclink.oos_state = 0; | |
460 | bcl->stats.recv_info++; | |
461 | ||
462 | /* | |
463 | * Unicast an ACK periodically, ensuring that | |
464 | * all nodes in the cluster don't ACK at the same time | |
465 | */ | |
63e7f1ac | 466 | if (((seqno - tipc_own_addr) % TIPC_MIN_LINK_WIN) == 0) { |
247f0f3c YX |
467 | tipc_link_proto_xmit(node->active_links[node->addr & 1], |
468 | STATE_MSG, 0, 0, 0, 0, 0); | |
63e7f1ac AS |
469 | bcl->stats.sent_acks++; |
470 | } | |
471 | } | |
472 | ||
2c53040f | 473 | /** |
247f0f3c | 474 | * tipc_bclink_rcv - receive a broadcast packet, and deliver upwards |
c4307285 | 475 | * |
7216cd94 | 476 | * RCU is locked, no other locks set |
b97bf3fd | 477 | */ |
247f0f3c | 478 | void tipc_bclink_rcv(struct sk_buff *buf) |
d356eeba | 479 | { |
b97bf3fd | 480 | struct tipc_msg *msg = buf_msg(buf); |
5d3c488d | 481 | struct tipc_node *node; |
b97bf3fd PL |
482 | u32 next_in; |
483 | u32 seqno; | |
0abd8ff2 | 484 | int deferred = 0; |
b97bf3fd | 485 | |
5d3c488d | 486 | /* Screen out unwanted broadcast messages */ |
5d3c488d AS |
487 | if (msg_mc_netid(msg) != tipc_net_id) |
488 | goto exit; | |
489 | ||
490 | node = tipc_node_find(msg_prevnode(msg)); | |
491 | if (unlikely(!node)) | |
492 | goto exit; | |
493 | ||
494 | tipc_node_lock(node); | |
389dd9bc | 495 | if (unlikely(!node->bclink.recv_permitted)) |
5d3c488d | 496 | goto unlock; |
b97bf3fd | 497 | |
8a275a6a | 498 | /* Handle broadcast protocol message */ |
b97bf3fd | 499 | if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { |
9f6bdcd4 AS |
500 | if (msg_type(msg) != STATE_MSG) |
501 | goto unlock; | |
b97bf3fd | 502 | if (msg_destnode(msg) == tipc_own_addr) { |
4323add6 PL |
503 | tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); |
504 | tipc_node_unlock(node); | |
d69afc90 | 505 | tipc_bclink_lock(); |
b97bf3fd | 506 | bcl->stats.recv_nacks++; |
01d83edd | 507 | bclink->retransmit_to = node; |
b97bf3fd PL |
508 | bclink_retransmit_pkt(msg_bcgap_after(msg), |
509 | msg_bcgap_to(msg)); | |
d69afc90 | 510 | tipc_bclink_unlock(); |
b97bf3fd | 511 | } else { |
5d3c488d | 512 | tipc_node_unlock(node); |
7a54d4a9 | 513 | bclink_peek_nack(msg); |
b97bf3fd | 514 | } |
5d3c488d | 515 | goto exit; |
b97bf3fd PL |
516 | } |
517 | ||
5d3c488d | 518 | /* Handle in-sequence broadcast message */ |
b97bf3fd | 519 | seqno = msg_seqno(msg); |
8a275a6a | 520 | next_in = mod(node->bclink.last_in + 1); |
b97bf3fd PL |
521 | |
522 | if (likely(seqno == next_in)) { | |
8a275a6a | 523 | receive: |
7a54d4a9 | 524 | /* Deliver message to destination */ |
b97bf3fd | 525 | if (likely(msg_isdata(msg))) { |
d69afc90 | 526 | tipc_bclink_lock(); |
63e7f1ac | 527 | bclink_accept_pkt(node, seqno); |
d69afc90 | 528 | tipc_bclink_unlock(); |
4323add6 | 529 | tipc_node_unlock(node); |
9f6bdcd4 | 530 | if (likely(msg_mcast(msg))) |
0abd8ff2 | 531 | tipc_sk_mcast_rcv(buf); |
9f6bdcd4 | 532 | else |
5f6d9123 | 533 | kfree_skb(buf); |
b97bf3fd | 534 | } else if (msg_user(msg) == MSG_BUNDLER) { |
d69afc90 | 535 | tipc_bclink_lock(); |
63e7f1ac | 536 | bclink_accept_pkt(node, seqno); |
b97bf3fd PL |
537 | bcl->stats.recv_bundles++; |
538 | bcl->stats.recv_bundled += msg_msgcnt(msg); | |
d69afc90 | 539 | tipc_bclink_unlock(); |
4323add6 | 540 | tipc_node_unlock(node); |
247f0f3c | 541 | tipc_link_bundle_rcv(buf); |
b97bf3fd | 542 | } else if (msg_user(msg) == MSG_FRAGMENTER) { |
37e22164 JPM |
543 | tipc_buf_append(&node->bclink.reasm_buf, &buf); |
544 | if (unlikely(!buf && !node->bclink.reasm_buf)) | |
63e7f1ac | 545 | goto unlock; |
d69afc90 | 546 | tipc_bclink_lock(); |
63e7f1ac | 547 | bclink_accept_pkt(node, seqno); |
b97bf3fd | 548 | bcl->stats.recv_fragments++; |
37e22164 | 549 | if (buf) { |
b97bf3fd | 550 | bcl->stats.recv_fragmented++; |
40ba3cdf | 551 | msg = buf_msg(buf); |
d69afc90 | 552 | tipc_bclink_unlock(); |
528f6f4b EH |
553 | goto receive; |
554 | } | |
d69afc90 | 555 | tipc_bclink_unlock(); |
4323add6 | 556 | tipc_node_unlock(node); |
9f6bdcd4 | 557 | } else if (msg_user(msg) == NAME_DISTRIBUTOR) { |
d69afc90 | 558 | tipc_bclink_lock(); |
63e7f1ac | 559 | bclink_accept_pkt(node, seqno); |
d69afc90 | 560 | tipc_bclink_unlock(); |
9f6bdcd4 | 561 | tipc_node_unlock(node); |
247f0f3c | 562 | tipc_named_rcv(buf); |
b97bf3fd | 563 | } else { |
d69afc90 | 564 | tipc_bclink_lock(); |
63e7f1ac | 565 | bclink_accept_pkt(node, seqno); |
d69afc90 | 566 | tipc_bclink_unlock(); |
4323add6 | 567 | tipc_node_unlock(node); |
5f6d9123 | 568 | kfree_skb(buf); |
b97bf3fd | 569 | } |
5d3c488d | 570 | buf = NULL; |
8a275a6a AS |
571 | |
572 | /* Determine new synchronization state */ | |
5d3c488d | 573 | tipc_node_lock(node); |
8a275a6a AS |
574 | if (unlikely(!tipc_node_is_up(node))) |
575 | goto unlock; | |
576 | ||
7a54d4a9 | 577 | if (node->bclink.last_in == node->bclink.last_sent) |
8a275a6a AS |
578 | goto unlock; |
579 | ||
bc6fecd4 | 580 | if (skb_queue_empty(&node->bclink.deferred_queue)) { |
7a54d4a9 AS |
581 | node->bclink.oos_state = 1; |
582 | goto unlock; | |
583 | } | |
584 | ||
bc6fecd4 | 585 | msg = buf_msg(skb_peek(&node->bclink.deferred_queue)); |
8a275a6a AS |
586 | seqno = msg_seqno(msg); |
587 | next_in = mod(next_in + 1); | |
588 | if (seqno != next_in) | |
589 | goto unlock; | |
590 | ||
591 | /* Take in-sequence message from deferred queue & deliver it */ | |
bc6fecd4 | 592 | buf = __skb_dequeue(&node->bclink.deferred_queue); |
8a275a6a AS |
593 | goto receive; |
594 | } | |
595 | ||
596 | /* Handle out-of-sequence broadcast message */ | |
8a275a6a | 597 | if (less(next_in, seqno)) { |
bc6fecd4 | 598 | deferred = tipc_link_defer_pkt(&node->bclink.deferred_queue, |
8a275a6a | 599 | buf); |
7a54d4a9 | 600 | bclink_update_last_sent(node, seqno); |
5d3c488d | 601 | buf = NULL; |
0abd8ff2 | 602 | } |
8a275a6a | 603 | |
d69afc90 | 604 | tipc_bclink_lock(); |
b98158e3 | 605 | |
8a275a6a AS |
606 | if (deferred) |
607 | bcl->stats.deferred_recv++; | |
0232c5a5 AS |
608 | else |
609 | bcl->stats.duplicates++; | |
8a275a6a | 610 | |
d69afc90 | 611 | tipc_bclink_unlock(); |
b98158e3 | 612 | |
5d3c488d | 613 | unlock: |
4323add6 | 614 | tipc_node_unlock(node); |
5d3c488d | 615 | exit: |
5f6d9123 | 616 | kfree_skb(buf); |
b97bf3fd PL |
617 | } |
618 | ||
6c00055a | 619 | u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) |
b97bf3fd | 620 | { |
389dd9bc | 621 | return (n_ptr->bclink.recv_permitted && |
4323add6 | 622 | (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); |
b97bf3fd PL |
623 | } |
624 | ||
625 | ||
626 | /** | |
4323add6 | 627 | * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer |
c4307285 | 628 | * |
2ff9f924 AS |
629 | * Send packet over as many bearers as necessary to reach all nodes |
630 | * that have joined the broadcast link. | |
c4307285 | 631 | * |
2ff9f924 AS |
632 | * Returns 0 (packet sent successfully) under all circumstances, |
633 | * since the broadcast link's pseudo-bearer never blocks | |
b97bf3fd | 634 | */ |
ae8509c4 | 635 | static int tipc_bcbearer_send(struct sk_buff *buf, struct tipc_bearer *unused1, |
988f088a | 636 | struct tipc_media_addr *unused2) |
b97bf3fd | 637 | { |
b97bf3fd | 638 | int bp_index; |
6f92ee54 | 639 | struct tipc_msg *msg = buf_msg(buf); |
b97bf3fd | 640 | |
e6160710 | 641 | /* Prepare broadcast link message for reliable transmission, |
2ff9f924 AS |
642 | * if first time trying to send it; |
643 | * preparation is skipped for broadcast link protocol messages | |
644 | * since they are sent in an unreliable manner and don't need it | |
645 | */ | |
b97bf3fd | 646 | if (likely(!msg_non_seq(buf_msg(buf)))) { |
cd3decdf | 647 | bcbuf_set_acks(buf, bclink->bcast_nodes.count); |
40aecb1b | 648 | msg_set_non_seq(msg, 1); |
b97bf3fd | 649 | msg_set_mc_netid(msg, tipc_net_id); |
0048b826 | 650 | bcl->stats.sent_info++; |
5e726900 | 651 | |
cd3decdf | 652 | if (WARN_ON(!bclink->bcast_nodes.count)) { |
5e726900 AS |
653 | dump_stack(); |
654 | return 0; | |
655 | } | |
b97bf3fd PL |
656 | } |
657 | ||
b97bf3fd | 658 | /* Send buffer over bearers until all targets reached */ |
cd3decdf | 659 | bcbearer->remains = bclink->bcast_nodes; |
b97bf3fd PL |
660 | |
661 | for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { | |
2d627b92 AS |
662 | struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary; |
663 | struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary; | |
6f92ee54 JPM |
664 | struct tipc_bearer *bp[2] = {p, s}; |
665 | struct tipc_bearer *b = bp[msg_link_selector(msg)]; | |
488fc9af | 666 | struct sk_buff *tbuf; |
b97bf3fd PL |
667 | |
668 | if (!p) | |
e6160710 | 669 | break; /* No more bearers to try */ |
6f92ee54 JPM |
670 | if (!b) |
671 | b = p; | |
77861d9c | 672 | tipc_nmap_diff(&bcbearer->remains, &b->nodes, |
e6160710 | 673 | &bcbearer->remains_new); |
65f51ef0 | 674 | if (bcbearer->remains_new.count == bcbearer->remains.count) |
e6160710 | 675 | continue; /* Nothing added by bearer pair */ |
b97bf3fd | 676 | |
488fc9af GF |
677 | if (bp_index == 0) { |
678 | /* Use original buffer for first bearer */ | |
7a2f7d18 | 679 | tipc_bearer_send(b->identity, buf, &b->bcast_addr); |
488fc9af GF |
680 | } else { |
681 | /* Avoid concurrent buffer access */ | |
bad93e9d | 682 | tbuf = pskb_copy_for_clone(buf, GFP_ATOMIC); |
488fc9af GF |
683 | if (!tbuf) |
684 | break; | |
7a2f7d18 | 685 | tipc_bearer_send(b->identity, tbuf, &b->bcast_addr); |
488fc9af GF |
686 | kfree_skb(tbuf); /* Bearer keeps a clone */ |
687 | } | |
65f51ef0 | 688 | if (bcbearer->remains_new.count == 0) |
e6160710 | 689 | break; /* All targets reached */ |
b97bf3fd | 690 | |
65f51ef0 | 691 | bcbearer->remains = bcbearer->remains_new; |
b97bf3fd | 692 | } |
c4307285 | 693 | |
2ff9f924 | 694 | return 0; |
b97bf3fd PL |
695 | } |
696 | ||
697 | /** | |
4323add6 | 698 | * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer |
b97bf3fd | 699 | */ |
28dd9418 | 700 | void tipc_bcbearer_sort(struct tipc_node_map *nm_ptr, u32 node, bool action) |
b97bf3fd | 701 | { |
7f9ab6ac PG |
702 | struct tipc_bcbearer_pair *bp_temp = bcbearer->bpairs_temp; |
703 | struct tipc_bcbearer_pair *bp_curr; | |
f8322dfc | 704 | struct tipc_bearer *b; |
b97bf3fd PL |
705 | int b_index; |
706 | int pri; | |
707 | ||
d69afc90 | 708 | tipc_bclink_lock(); |
b97bf3fd | 709 | |
28dd9418 YX |
710 | if (action) |
711 | tipc_nmap_add(nm_ptr, node); | |
712 | else | |
713 | tipc_nmap_remove(nm_ptr, node); | |
714 | ||
b97bf3fd | 715 | /* Group bearers by priority (can assume max of two per priority) */ |
b97bf3fd PL |
716 | memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); |
717 | ||
f8322dfc | 718 | rcu_read_lock(); |
b97bf3fd | 719 | for (b_index = 0; b_index < MAX_BEARERS; b_index++) { |
f8322dfc | 720 | b = rcu_dereference_rtnl(bearer_list[b_index]); |
f47de12b | 721 | if (!b || !b->nodes.count) |
b97bf3fd PL |
722 | continue; |
723 | ||
724 | if (!bp_temp[b->priority].primary) | |
725 | bp_temp[b->priority].primary = b; | |
726 | else | |
727 | bp_temp[b->priority].secondary = b; | |
728 | } | |
f8322dfc | 729 | rcu_read_unlock(); |
b97bf3fd PL |
730 | |
731 | /* Create array of bearer pairs for broadcasting */ | |
b97bf3fd PL |
732 | bp_curr = bcbearer->bpairs; |
733 | memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); | |
734 | ||
16cb4b33 | 735 | for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { |
b97bf3fd PL |
736 | |
737 | if (!bp_temp[pri].primary) | |
738 | continue; | |
739 | ||
740 | bp_curr->primary = bp_temp[pri].primary; | |
741 | ||
742 | if (bp_temp[pri].secondary) { | |
4323add6 PL |
743 | if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, |
744 | &bp_temp[pri].secondary->nodes)) { | |
b97bf3fd PL |
745 | bp_curr->secondary = bp_temp[pri].secondary; |
746 | } else { | |
747 | bp_curr++; | |
748 | bp_curr->primary = bp_temp[pri].secondary; | |
749 | } | |
750 | } | |
751 | ||
752 | bp_curr++; | |
753 | } | |
754 | ||
d69afc90 | 755 | tipc_bclink_unlock(); |
b97bf3fd PL |
756 | } |
757 | ||
d8182804 RA |
758 | static int __tipc_nl_add_bc_link_stat(struct sk_buff *skb, |
759 | struct tipc_stats *stats) | |
7be57fc6 RA |
760 | { |
761 | int i; | |
762 | struct nlattr *nest; | |
763 | ||
764 | struct nla_map { | |
765 | __u32 key; | |
766 | __u32 val; | |
767 | }; | |
768 | ||
769 | struct nla_map map[] = { | |
770 | {TIPC_NLA_STATS_RX_INFO, stats->recv_info}, | |
771 | {TIPC_NLA_STATS_RX_FRAGMENTS, stats->recv_fragments}, | |
772 | {TIPC_NLA_STATS_RX_FRAGMENTED, stats->recv_fragmented}, | |
773 | {TIPC_NLA_STATS_RX_BUNDLES, stats->recv_bundles}, | |
774 | {TIPC_NLA_STATS_RX_BUNDLED, stats->recv_bundled}, | |
775 | {TIPC_NLA_STATS_TX_INFO, stats->sent_info}, | |
776 | {TIPC_NLA_STATS_TX_FRAGMENTS, stats->sent_fragments}, | |
777 | {TIPC_NLA_STATS_TX_FRAGMENTED, stats->sent_fragmented}, | |
778 | {TIPC_NLA_STATS_TX_BUNDLES, stats->sent_bundles}, | |
779 | {TIPC_NLA_STATS_TX_BUNDLED, stats->sent_bundled}, | |
780 | {TIPC_NLA_STATS_RX_NACKS, stats->recv_nacks}, | |
781 | {TIPC_NLA_STATS_RX_DEFERRED, stats->deferred_recv}, | |
782 | {TIPC_NLA_STATS_TX_NACKS, stats->sent_nacks}, | |
783 | {TIPC_NLA_STATS_TX_ACKS, stats->sent_acks}, | |
784 | {TIPC_NLA_STATS_RETRANSMITTED, stats->retransmitted}, | |
785 | {TIPC_NLA_STATS_DUPLICATES, stats->duplicates}, | |
786 | {TIPC_NLA_STATS_LINK_CONGS, stats->link_congs}, | |
787 | {TIPC_NLA_STATS_MAX_QUEUE, stats->max_queue_sz}, | |
788 | {TIPC_NLA_STATS_AVG_QUEUE, stats->queue_sz_counts ? | |
789 | (stats->accu_queue_sz / stats->queue_sz_counts) : 0} | |
790 | }; | |
791 | ||
792 | nest = nla_nest_start(skb, TIPC_NLA_LINK_STATS); | |
793 | if (!nest) | |
794 | return -EMSGSIZE; | |
795 | ||
796 | for (i = 0; i < ARRAY_SIZE(map); i++) | |
797 | if (nla_put_u32(skb, map[i].key, map[i].val)) | |
798 | goto msg_full; | |
799 | ||
800 | nla_nest_end(skb, nest); | |
801 | ||
802 | return 0; | |
803 | msg_full: | |
804 | nla_nest_cancel(skb, nest); | |
805 | ||
806 | return -EMSGSIZE; | |
807 | } | |
808 | ||
809 | int tipc_nl_add_bc_link(struct tipc_nl_msg *msg) | |
810 | { | |
811 | int err; | |
812 | void *hdr; | |
813 | struct nlattr *attrs; | |
814 | struct nlattr *prop; | |
815 | ||
816 | if (!bcl) | |
817 | return 0; | |
818 | ||
819 | tipc_bclink_lock(); | |
820 | ||
821 | hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_v2_family, | |
822 | NLM_F_MULTI, TIPC_NL_LINK_GET); | |
823 | if (!hdr) | |
824 | return -EMSGSIZE; | |
825 | ||
826 | attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK); | |
827 | if (!attrs) | |
828 | goto msg_full; | |
829 | ||
830 | /* The broadcast link is always up */ | |
831 | if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP)) | |
832 | goto attr_msg_full; | |
833 | ||
834 | if (nla_put_flag(msg->skb, TIPC_NLA_LINK_BROADCAST)) | |
835 | goto attr_msg_full; | |
836 | if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, bcl->name)) | |
837 | goto attr_msg_full; | |
838 | if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, bcl->next_in_no)) | |
839 | goto attr_msg_full; | |
840 | if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, bcl->next_out_no)) | |
841 | goto attr_msg_full; | |
842 | ||
843 | prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP); | |
844 | if (!prop) | |
845 | goto attr_msg_full; | |
846 | if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, bcl->queue_limit[0])) | |
847 | goto prop_msg_full; | |
848 | nla_nest_end(msg->skb, prop); | |
849 | ||
850 | err = __tipc_nl_add_bc_link_stat(msg->skb, &bcl->stats); | |
851 | if (err) | |
852 | goto attr_msg_full; | |
853 | ||
854 | tipc_bclink_unlock(); | |
855 | nla_nest_end(msg->skb, attrs); | |
856 | genlmsg_end(msg->skb, hdr); | |
857 | ||
858 | return 0; | |
859 | ||
860 | prop_msg_full: | |
861 | nla_nest_cancel(msg->skb, prop); | |
862 | attr_msg_full: | |
863 | nla_nest_cancel(msg->skb, attrs); | |
864 | msg_full: | |
865 | tipc_bclink_unlock(); | |
866 | genlmsg_cancel(msg->skb, hdr); | |
867 | ||
868 | return -EMSGSIZE; | |
869 | } | |
b97bf3fd | 870 | |
4323add6 | 871 | int tipc_bclink_stats(char *buf, const u32 buf_size) |
b97bf3fd | 872 | { |
dc1aed37 EH |
873 | int ret; |
874 | struct tipc_stats *s; | |
b97bf3fd PL |
875 | |
876 | if (!bcl) | |
877 | return 0; | |
878 | ||
d69afc90 | 879 | tipc_bclink_lock(); |
b97bf3fd | 880 | |
dc1aed37 EH |
881 | s = &bcl->stats; |
882 | ||
883 | ret = tipc_snprintf(buf, buf_size, "Link <%s>\n" | |
884 | " Window:%u packets\n", | |
885 | bcl->name, bcl->queue_limit[0]); | |
886 | ret += tipc_snprintf(buf + ret, buf_size - ret, | |
887 | " RX packets:%u fragments:%u/%u bundles:%u/%u\n", | |
888 | s->recv_info, s->recv_fragments, | |
889 | s->recv_fragmented, s->recv_bundles, | |
890 | s->recv_bundled); | |
891 | ret += tipc_snprintf(buf + ret, buf_size - ret, | |
892 | " TX packets:%u fragments:%u/%u bundles:%u/%u\n", | |
893 | s->sent_info, s->sent_fragments, | |
894 | s->sent_fragmented, s->sent_bundles, | |
895 | s->sent_bundled); | |
896 | ret += tipc_snprintf(buf + ret, buf_size - ret, | |
897 | " RX naks:%u defs:%u dups:%u\n", | |
898 | s->recv_nacks, s->deferred_recv, s->duplicates); | |
899 | ret += tipc_snprintf(buf + ret, buf_size - ret, | |
900 | " TX naks:%u acks:%u dups:%u\n", | |
901 | s->sent_nacks, s->sent_acks, s->retransmitted); | |
902 | ret += tipc_snprintf(buf + ret, buf_size - ret, | |
3c294cb3 YX |
903 | " Congestion link:%u Send queue max:%u avg:%u\n", |
904 | s->link_congs, s->max_queue_sz, | |
dc1aed37 EH |
905 | s->queue_sz_counts ? |
906 | (s->accu_queue_sz / s->queue_sz_counts) : 0); | |
b97bf3fd | 907 | |
d69afc90 | 908 | tipc_bclink_unlock(); |
dc1aed37 | 909 | return ret; |
b97bf3fd PL |
910 | } |
911 | ||
4323add6 | 912 | int tipc_bclink_reset_stats(void) |
b97bf3fd PL |
913 | { |
914 | if (!bcl) | |
915 | return -ENOPROTOOPT; | |
916 | ||
d69afc90 | 917 | tipc_bclink_lock(); |
b97bf3fd | 918 | memset(&bcl->stats, 0, sizeof(bcl->stats)); |
d69afc90 | 919 | tipc_bclink_unlock(); |
0e35fd5e | 920 | return 0; |
b97bf3fd PL |
921 | } |
922 | ||
4323add6 | 923 | int tipc_bclink_set_queue_limits(u32 limit) |
b97bf3fd PL |
924 | { |
925 | if (!bcl) | |
926 | return -ENOPROTOOPT; | |
927 | if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) | |
928 | return -EINVAL; | |
929 | ||
d69afc90 | 930 | tipc_bclink_lock(); |
4323add6 | 931 | tipc_link_set_queue_limits(bcl, limit); |
d69afc90 | 932 | tipc_bclink_unlock(); |
0e35fd5e | 933 | return 0; |
b97bf3fd PL |
934 | } |
935 | ||
eb8b00f5 | 936 | int tipc_bclink_init(void) |
b97bf3fd | 937 | { |
eb8b00f5 YX |
938 | bcbearer = kzalloc(sizeof(*bcbearer), GFP_ATOMIC); |
939 | if (!bcbearer) | |
940 | return -ENOMEM; | |
941 | ||
942 | bclink = kzalloc(sizeof(*bclink), GFP_ATOMIC); | |
943 | if (!bclink) { | |
944 | kfree(bcbearer); | |
945 | return -ENOMEM; | |
946 | } | |
947 | ||
948 | bcl = &bclink->link; | |
b97bf3fd | 949 | bcbearer->bearer.media = &bcbearer->media; |
4323add6 | 950 | bcbearer->media.send_msg = tipc_bcbearer_send; |
2e2d9be8 | 951 | sprintf(bcbearer->media.name, "tipc-broadcast"); |
b97bf3fd | 952 | |
d69afc90 | 953 | spin_lock_init(&bclink->lock); |
58dc55f2 | 954 | __skb_queue_head_init(&bcl->outqueue); |
bc6fecd4 | 955 | __skb_queue_head_init(&bcl->deferred_queue); |
4988bb4a | 956 | skb_queue_head_init(&bcl->waiting_sks); |
b97bf3fd | 957 | bcl->next_out_no = 1; |
34af946a | 958 | spin_lock_init(&bclink->node.lock); |
50100a5e | 959 | __skb_queue_head_init(&bclink->node.waiting_sks); |
b97bf3fd | 960 | bcl->owner = &bclink->node; |
c4307285 | 961 | bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; |
4323add6 | 962 | tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); |
7a2f7d18 | 963 | bcl->bearer_id = MAX_BEARERS; |
f8322dfc | 964 | rcu_assign_pointer(bearer_list[MAX_BEARERS], &bcbearer->bearer); |
b97bf3fd | 965 | bcl->state = WORKING_WORKING; |
4b704d59 | 966 | strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME); |
eb8b00f5 | 967 | return 0; |
b97bf3fd PL |
968 | } |
969 | ||
4323add6 | 970 | void tipc_bclink_stop(void) |
b97bf3fd | 971 | { |
d69afc90 | 972 | tipc_bclink_lock(); |
581465fa | 973 | tipc_link_purge_queues(bcl); |
d69afc90 | 974 | tipc_bclink_unlock(); |
c47e9b91 | 975 | |
f8322dfc | 976 | RCU_INIT_POINTER(bearer_list[BCBEARER], NULL); |
eb8b00f5 YX |
977 | synchronize_net(); |
978 | kfree(bcbearer); | |
979 | kfree(bclink); | |
b97bf3fd PL |
980 | } |
981 | ||
3e22e62b AS |
982 | /** |
983 | * tipc_nmap_add - add a node to a node map | |
984 | */ | |
28dd9418 | 985 | static void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node) |
3e22e62b AS |
986 | { |
987 | int n = tipc_node(node); | |
988 | int w = n / WSIZE; | |
989 | u32 mask = (1 << (n % WSIZE)); | |
990 | ||
991 | if ((nm_ptr->map[w] & mask) == 0) { | |
992 | nm_ptr->count++; | |
993 | nm_ptr->map[w] |= mask; | |
994 | } | |
995 | } | |
996 | ||
997 | /** | |
998 | * tipc_nmap_remove - remove a node from a node map | |
999 | */ | |
28dd9418 | 1000 | static void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node) |
3e22e62b AS |
1001 | { |
1002 | int n = tipc_node(node); | |
1003 | int w = n / WSIZE; | |
1004 | u32 mask = (1 << (n % WSIZE)); | |
1005 | ||
1006 | if ((nm_ptr->map[w] & mask) != 0) { | |
1007 | nm_ptr->map[w] &= ~mask; | |
1008 | nm_ptr->count--; | |
1009 | } | |
1010 | } | |
1011 | ||
1012 | /** | |
1013 | * tipc_nmap_diff - find differences between node maps | |
1014 | * @nm_a: input node map A | |
1015 | * @nm_b: input node map B | |
1016 | * @nm_diff: output node map A-B (i.e. nodes of A that are not in B) | |
1017 | */ | |
31e3c3f6 | 1018 | static void tipc_nmap_diff(struct tipc_node_map *nm_a, |
1019 | struct tipc_node_map *nm_b, | |
1020 | struct tipc_node_map *nm_diff) | |
3e22e62b AS |
1021 | { |
1022 | int stop = ARRAY_SIZE(nm_a->map); | |
1023 | int w; | |
1024 | int b; | |
1025 | u32 map; | |
1026 | ||
1027 | memset(nm_diff, 0, sizeof(*nm_diff)); | |
1028 | for (w = 0; w < stop; w++) { | |
1029 | map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]); | |
1030 | nm_diff->map[w] = map; | |
1031 | if (map != 0) { | |
1032 | for (b = 0 ; b < WSIZE; b++) { | |
1033 | if (map & (1 << b)) | |
1034 | nm_diff->count++; | |
1035 | } | |
1036 | } | |
1037 | } | |
1038 | } | |
43608edc AS |
1039 | |
1040 | /** | |
1041 | * tipc_port_list_add - add a port to a port list, ensuring no duplicates | |
1042 | */ | |
4584310b | 1043 | void tipc_port_list_add(struct tipc_port_list *pl_ptr, u32 port) |
43608edc | 1044 | { |
4584310b | 1045 | struct tipc_port_list *item = pl_ptr; |
43608edc AS |
1046 | int i; |
1047 | int item_sz = PLSIZE; | |
1048 | int cnt = pl_ptr->count; | |
1049 | ||
1050 | for (; ; cnt -= item_sz, item = item->next) { | |
1051 | if (cnt < PLSIZE) | |
1052 | item_sz = cnt; | |
1053 | for (i = 0; i < item_sz; i++) | |
1054 | if (item->ports[i] == port) | |
1055 | return; | |
1056 | if (i < PLSIZE) { | |
1057 | item->ports[i] = port; | |
1058 | pl_ptr->count++; | |
1059 | return; | |
1060 | } | |
1061 | if (!item->next) { | |
1062 | item->next = kmalloc(sizeof(*item), GFP_ATOMIC); | |
1063 | if (!item->next) { | |
2cf8aa19 | 1064 | pr_warn("Incomplete multicast delivery, no memory\n"); |
43608edc AS |
1065 | return; |
1066 | } | |
1067 | item->next->next = NULL; | |
1068 | } | |
1069 | } | |
1070 | } | |
1071 | ||
1072 | /** | |
1073 | * tipc_port_list_free - free dynamically created entries in port_list chain | |
1074 | * | |
1075 | */ | |
4584310b | 1076 | void tipc_port_list_free(struct tipc_port_list *pl_ptr) |
43608edc | 1077 | { |
4584310b PG |
1078 | struct tipc_port_list *item; |
1079 | struct tipc_port_list *next; | |
43608edc AS |
1080 | |
1081 | for (item = pl_ptr->next; item; item = next) { | |
1082 | next = item->next; | |
1083 | kfree(item); | |
1084 | } | |
1085 | } |