Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/bcast.c: TIPC broadcast code | |
c4307285 | 3 | * |
593a5f22 | 4 | * Copyright (c) 2004-2006, 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" |
b97bf3fd | 40 | #include "port.h" |
b97bf3fd | 41 | #include "bcast.h" |
9f6bdcd4 | 42 | #include "name_distr.h" |
b97bf3fd | 43 | |
b97bf3fd PL |
44 | #define MAX_PKT_DEFAULT_MCAST 1500 /* bcast link max packet size (fixed) */ |
45 | ||
46 | #define BCLINK_WIN_DEFAULT 20 /* bcast link window size (default) */ | |
47 | ||
b97bf3fd | 48 | /** |
7f9ab6ac | 49 | * struct tipc_bcbearer_pair - a pair of bearers used by broadcast link |
b97bf3fd PL |
50 | * @primary: pointer to primary bearer |
51 | * @secondary: pointer to secondary bearer | |
c4307285 YH |
52 | * |
53 | * Bearers must have same priority and same set of reachable destinations | |
b97bf3fd PL |
54 | * to be paired. |
55 | */ | |
56 | ||
7f9ab6ac | 57 | struct tipc_bcbearer_pair { |
2d627b92 AS |
58 | struct tipc_bearer *primary; |
59 | struct tipc_bearer *secondary; | |
b97bf3fd PL |
60 | }; |
61 | ||
62 | /** | |
7f9ab6ac | 63 | * struct tipc_bcbearer - bearer used by broadcast link |
b97bf3fd PL |
64 | * @bearer: (non-standard) broadcast bearer structure |
65 | * @media: (non-standard) broadcast media structure | |
66 | * @bpairs: array of bearer pairs | |
65f51ef0 AS |
67 | * @bpairs_temp: temporary array of bearer pairs used by tipc_bcbearer_sort() |
68 | * @remains: temporary node map used by tipc_bcbearer_send() | |
69 | * @remains_new: temporary node map used tipc_bcbearer_send() | |
c4307285 | 70 | * |
65f51ef0 AS |
71 | * Note: The fields labelled "temporary" are incorporated into the bearer |
72 | * to avoid consuming potentially limited stack space through the use of | |
73 | * large local variables within multicast routines. Concurrent access is | |
74 | * prevented through use of the spinlock "bc_lock". | |
b97bf3fd PL |
75 | */ |
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 |
b97bf3fd PL |
88 | * @link: (non-standard) broadcast link structure |
89 | * @node: (non-standard) node structure representing b'cast link's peer node | |
cd3decdf | 90 | * @bcast_nodes: map of broadcast-capable nodes |
01d83edd | 91 | * @retransmit_to: node that most recently requested a retransmit |
c4307285 | 92 | * |
b97bf3fd PL |
93 | * Handles sequence numbering, fragmentation, bundling, etc. |
94 | */ | |
95 | ||
6765fd67 | 96 | struct tipc_bclink { |
a18c4bc3 | 97 | struct tipc_link link; |
6c00055a | 98 | struct tipc_node node; |
cd3decdf | 99 | struct tipc_node_map bcast_nodes; |
01d83edd | 100 | struct tipc_node *retransmit_to; |
b97bf3fd PL |
101 | }; |
102 | ||
7f9ab6ac | 103 | static struct tipc_bcbearer bcast_bearer; |
6765fd67 | 104 | static struct tipc_bclink bcast_link; |
c47e9b91 | 105 | |
7f9ab6ac | 106 | static struct tipc_bcbearer *bcbearer = &bcast_bearer; |
6765fd67 | 107 | static struct tipc_bclink *bclink = &bcast_link; |
a18c4bc3 | 108 | static struct tipc_link *bcl = &bcast_link.link; |
b97bf3fd | 109 | |
34af946a | 110 | static DEFINE_SPINLOCK(bc_lock); |
b97bf3fd | 111 | |
3aec9cc9 | 112 | const char tipc_bclink_name[] = "broadcast-link"; |
b97bf3fd | 113 | |
31e3c3f6 | 114 | static void tipc_nmap_diff(struct tipc_node_map *nm_a, |
115 | struct tipc_node_map *nm_b, | |
116 | struct tipc_node_map *nm_diff); | |
b97bf3fd | 117 | |
05790c64 | 118 | static u32 bcbuf_acks(struct sk_buff *buf) |
b97bf3fd | 119 | { |
880b005f | 120 | return (u32)(unsigned long)TIPC_SKB_CB(buf)->handle; |
b97bf3fd PL |
121 | } |
122 | ||
05790c64 | 123 | static void bcbuf_set_acks(struct sk_buff *buf, u32 acks) |
b97bf3fd | 124 | { |
880b005f | 125 | TIPC_SKB_CB(buf)->handle = (void *)(unsigned long)acks; |
b97bf3fd PL |
126 | } |
127 | ||
05790c64 | 128 | static void bcbuf_decr_acks(struct sk_buff *buf) |
b97bf3fd PL |
129 | { |
130 | bcbuf_set_acks(buf, bcbuf_acks(buf) - 1); | |
131 | } | |
132 | ||
cd3decdf AS |
133 | void tipc_bclink_add_node(u32 addr) |
134 | { | |
135 | spin_lock_bh(&bc_lock); | |
136 | tipc_nmap_add(&bclink->bcast_nodes, addr); | |
137 | spin_unlock_bh(&bc_lock); | |
138 | } | |
139 | ||
140 | void tipc_bclink_remove_node(u32 addr) | |
141 | { | |
142 | spin_lock_bh(&bc_lock); | |
143 | tipc_nmap_remove(&bclink->bcast_nodes, addr); | |
144 | spin_unlock_bh(&bc_lock); | |
145 | } | |
b97bf3fd | 146 | |
5b1f7bde AS |
147 | static void bclink_set_last_sent(void) |
148 | { | |
149 | if (bcl->next_out) | |
150 | bcl->fsm_msg_cnt = mod(buf_seqno(bcl->next_out) - 1); | |
151 | else | |
152 | bcl->fsm_msg_cnt = mod(bcl->next_out_no - 1); | |
153 | } | |
154 | ||
155 | u32 tipc_bclink_get_last_sent(void) | |
156 | { | |
157 | return bcl->fsm_msg_cnt; | |
158 | } | |
159 | ||
7a54d4a9 | 160 | static void bclink_update_last_sent(struct tipc_node *node, u32 seqno) |
b97bf3fd | 161 | { |
7a54d4a9 AS |
162 | node->bclink.last_sent = less_eq(node->bclink.last_sent, seqno) ? |
163 | seqno : node->bclink.last_sent; | |
b97bf3fd PL |
164 | } |
165 | ||
b97bf3fd | 166 | |
7a54d4a9 | 167 | /* |
01d83edd AS |
168 | * tipc_bclink_retransmit_to - get most recent node to request retransmission |
169 | * | |
170 | * Called with bc_lock locked | |
171 | */ | |
172 | ||
173 | struct tipc_node *tipc_bclink_retransmit_to(void) | |
174 | { | |
175 | return bclink->retransmit_to; | |
176 | } | |
177 | ||
c4307285 | 178 | /** |
b97bf3fd PL |
179 | * bclink_retransmit_pkt - retransmit broadcast packets |
180 | * @after: sequence number of last packet to *not* retransmit | |
181 | * @to: sequence number of last packet to retransmit | |
c4307285 | 182 | * |
d356eeba | 183 | * Called with bc_lock locked |
b97bf3fd PL |
184 | */ |
185 | ||
186 | static void bclink_retransmit_pkt(u32 after, u32 to) | |
187 | { | |
188 | struct sk_buff *buf; | |
189 | ||
b97bf3fd | 190 | buf = bcl->first_out; |
a016892c | 191 | while (buf && less_eq(buf_seqno(buf), after)) |
c4307285 | 192 | buf = buf->next; |
d356eeba | 193 | tipc_link_retransmit(bcl, buf, mod(to - after)); |
b97bf3fd PL |
194 | } |
195 | ||
c4307285 | 196 | /** |
4323add6 | 197 | * tipc_bclink_acknowledge - handle acknowledgement of broadcast packets |
b97bf3fd PL |
198 | * @n_ptr: node that sent acknowledgement info |
199 | * @acked: broadcast sequence # that has been acknowledged | |
c4307285 | 200 | * |
b97bf3fd PL |
201 | * Node is locked, bc_lock unlocked. |
202 | */ | |
203 | ||
6c00055a | 204 | void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked) |
b97bf3fd PL |
205 | { |
206 | struct sk_buff *crs; | |
207 | struct sk_buff *next; | |
208 | unsigned int released = 0; | |
209 | ||
b97bf3fd PL |
210 | spin_lock_bh(&bc_lock); |
211 | ||
36559591 | 212 | /* Bail out if tx queue is empty (no clean up is required) */ |
b97bf3fd | 213 | crs = bcl->first_out; |
36559591 AS |
214 | if (!crs) |
215 | goto exit; | |
216 | ||
217 | /* Determine which messages need to be acknowledged */ | |
218 | if (acked == INVALID_LINK_SEQ) { | |
219 | /* | |
220 | * Contact with specified node has been lost, so need to | |
221 | * acknowledge sent messages only (if other nodes still exist) | |
222 | * or both sent and unsent messages (otherwise) | |
223 | */ | |
224 | if (bclink->bcast_nodes.count) | |
225 | acked = bcl->fsm_msg_cnt; | |
226 | else | |
227 | acked = bcl->next_out_no; | |
228 | } else { | |
229 | /* | |
230 | * Bail out if specified sequence number does not correspond | |
231 | * to a message that has been sent and not yet acknowledged | |
232 | */ | |
233 | if (less(acked, buf_seqno(crs)) || | |
234 | less(bcl->fsm_msg_cnt, acked) || | |
235 | less_eq(acked, n_ptr->bclink.acked)) | |
236 | goto exit; | |
237 | } | |
238 | ||
239 | /* Skip over packets that node has previously acknowledged */ | |
a016892c | 240 | while (crs && less_eq(buf_seqno(crs), n_ptr->bclink.acked)) |
b97bf3fd | 241 | crs = crs->next; |
b97bf3fd PL |
242 | |
243 | /* Update packets that node is now acknowledging */ | |
244 | ||
245 | while (crs && less_eq(buf_seqno(crs), acked)) { | |
246 | next = crs->next; | |
10745cd5 AS |
247 | |
248 | if (crs != bcl->next_out) | |
249 | bcbuf_decr_acks(crs); | |
10745cd5 AS |
250 | else { |
251 | bcbuf_set_acks(crs, 0); | |
252 | bcl->next_out = next; | |
253 | bclink_set_last_sent(); | |
254 | } | |
255 | ||
b97bf3fd PL |
256 | if (bcbuf_acks(crs) == 0) { |
257 | bcl->first_out = next; | |
258 | bcl->out_queue_size--; | |
259 | buf_discard(crs); | |
260 | released = 1; | |
261 | } | |
262 | crs = next; | |
263 | } | |
264 | n_ptr->bclink.acked = acked; | |
265 | ||
266 | /* Try resolving broadcast link congestion, if necessary */ | |
267 | ||
5b1f7bde | 268 | if (unlikely(bcl->next_out)) { |
4323add6 | 269 | tipc_link_push_queue(bcl); |
5b1f7bde AS |
270 | bclink_set_last_sent(); |
271 | } | |
b97bf3fd | 272 | if (unlikely(released && !list_empty(&bcl->waiting_ports))) |
4323add6 | 273 | tipc_link_wakeup_ports(bcl, 0); |
36559591 | 274 | exit: |
b97bf3fd PL |
275 | spin_unlock_bh(&bc_lock); |
276 | } | |
277 | ||
7a54d4a9 AS |
278 | /* |
279 | * tipc_bclink_update_link_state - update broadcast link state | |
c4307285 | 280 | * |
4323add6 | 281 | * tipc_net_lock and node lock set |
b97bf3fd PL |
282 | */ |
283 | ||
7a54d4a9 | 284 | void tipc_bclink_update_link_state(struct tipc_node *n_ptr, u32 last_sent) |
b97bf3fd | 285 | { |
7a54d4a9 | 286 | struct sk_buff *buf; |
b97bf3fd | 287 | |
7a54d4a9 | 288 | /* Ignore "stale" link state info */ |
b97bf3fd | 289 | |
7a54d4a9 AS |
290 | if (less_eq(last_sent, n_ptr->bclink.last_in)) |
291 | return; | |
b97bf3fd | 292 | |
7a54d4a9 AS |
293 | /* Update link synchronization state; quit if in sync */ |
294 | ||
295 | bclink_update_last_sent(n_ptr, last_sent); | |
296 | ||
297 | if (n_ptr->bclink.last_sent == n_ptr->bclink.last_in) | |
298 | return; | |
299 | ||
300 | /* Update out-of-sync state; quit if loss is still unconfirmed */ | |
301 | ||
302 | if ((++n_ptr->bclink.oos_state) == 1) { | |
303 | if (n_ptr->bclink.deferred_size < (TIPC_MIN_LINK_WIN / 2)) | |
304 | return; | |
305 | n_ptr->bclink.oos_state++; | |
306 | } | |
307 | ||
308 | /* Don't NACK if one has been recently sent (or seen) */ | |
b97bf3fd | 309 | |
7a54d4a9 | 310 | if (n_ptr->bclink.oos_state & 0x1) |
b97bf3fd PL |
311 | return; |
312 | ||
7a54d4a9 AS |
313 | /* Send NACK */ |
314 | ||
31e3c3f6 | 315 | buf = tipc_buf_acquire(INT_H_SIZE); |
b97bf3fd | 316 | if (buf) { |
7a54d4a9 AS |
317 | struct tipc_msg *msg = buf_msg(buf); |
318 | ||
c68ca7b7 | 319 | tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG, |
7a54d4a9 | 320 | INT_H_SIZE, n_ptr->addr); |
bf781ecf | 321 | msg_set_non_seq(msg, 1); |
b97bf3fd | 322 | msg_set_mc_netid(msg, tipc_net_id); |
7a54d4a9 AS |
323 | msg_set_bcast_ack(msg, n_ptr->bclink.last_in); |
324 | msg_set_bcgap_after(msg, n_ptr->bclink.last_in); | |
325 | msg_set_bcgap_to(msg, n_ptr->bclink.deferred_head | |
326 | ? buf_seqno(n_ptr->bclink.deferred_head) - 1 | |
327 | : n_ptr->bclink.last_sent); | |
b97bf3fd | 328 | |
57732560 | 329 | spin_lock_bh(&bc_lock); |
0f38513d AS |
330 | tipc_bearer_send(&bcbearer->bearer, buf, NULL); |
331 | bcl->stats.sent_nacks++; | |
57732560 | 332 | spin_unlock_bh(&bc_lock); |
0f38513d | 333 | buf_discard(buf); |
b97bf3fd | 334 | |
7a54d4a9 | 335 | n_ptr->bclink.oos_state++; |
b97bf3fd PL |
336 | } |
337 | } | |
338 | ||
7a54d4a9 AS |
339 | /* |
340 | * bclink_peek_nack - monitor retransmission requests sent by other nodes | |
b97bf3fd | 341 | * |
7a54d4a9 AS |
342 | * Delay any upcoming NACK by this node if another node has already |
343 | * requested the first message this node is going to ask for. | |
c4307285 | 344 | * |
4323add6 | 345 | * Only tipc_net_lock set. |
b97bf3fd PL |
346 | */ |
347 | ||
7a54d4a9 | 348 | static void bclink_peek_nack(struct tipc_msg *msg) |
b97bf3fd | 349 | { |
7a54d4a9 | 350 | struct tipc_node *n_ptr = tipc_node_find(msg_destnode(msg)); |
b97bf3fd | 351 | |
7a54d4a9 | 352 | if (unlikely(!n_ptr)) |
b97bf3fd | 353 | return; |
7a54d4a9 | 354 | |
4323add6 | 355 | tipc_node_lock(n_ptr); |
7a54d4a9 AS |
356 | |
357 | if (n_ptr->bclink.supported && | |
358 | (n_ptr->bclink.last_in != n_ptr->bclink.last_sent) && | |
359 | (n_ptr->bclink.last_in == msg_bcgap_after(msg))) | |
360 | n_ptr->bclink.oos_state = 2; | |
361 | ||
4323add6 | 362 | tipc_node_unlock(n_ptr); |
b97bf3fd PL |
363 | } |
364 | ||
7a54d4a9 | 365 | /* |
4323add6 | 366 | * tipc_bclink_send_msg - broadcast a packet to all nodes in cluster |
b97bf3fd PL |
367 | */ |
368 | ||
4323add6 | 369 | int tipc_bclink_send_msg(struct sk_buff *buf) |
b97bf3fd PL |
370 | { |
371 | int res; | |
372 | ||
373 | spin_lock_bh(&bc_lock); | |
374 | ||
2b78f9a0 AS |
375 | if (!bclink->bcast_nodes.count) { |
376 | res = msg_data_sz(buf_msg(buf)); | |
377 | buf_discard(buf); | |
378 | goto exit; | |
379 | } | |
380 | ||
4323add6 | 381 | res = tipc_link_send_buf(bcl, buf); |
9157bafb | 382 | if (likely(res >= 0)) { |
5b1f7bde | 383 | bclink_set_last_sent(); |
9157bafb AS |
384 | bcl->stats.queue_sz_counts++; |
385 | bcl->stats.accu_queue_sz += bcl->out_queue_size; | |
386 | } | |
2b78f9a0 | 387 | exit: |
b97bf3fd PL |
388 | spin_unlock_bh(&bc_lock); |
389 | return res; | |
390 | } | |
391 | ||
392 | /** | |
4323add6 | 393 | * tipc_bclink_recv_pkt - receive a broadcast packet, and deliver upwards |
c4307285 | 394 | * |
4323add6 | 395 | * tipc_net_lock is read_locked, no other locks set |
b97bf3fd PL |
396 | */ |
397 | ||
4323add6 | 398 | void tipc_bclink_recv_pkt(struct sk_buff *buf) |
d356eeba | 399 | { |
b97bf3fd | 400 | struct tipc_msg *msg = buf_msg(buf); |
5d3c488d | 401 | struct tipc_node *node; |
b97bf3fd PL |
402 | u32 next_in; |
403 | u32 seqno; | |
8a275a6a | 404 | int deferred; |
b97bf3fd | 405 | |
5d3c488d AS |
406 | /* Screen out unwanted broadcast messages */ |
407 | ||
408 | if (msg_mc_netid(msg) != tipc_net_id) | |
409 | goto exit; | |
410 | ||
411 | node = tipc_node_find(msg_prevnode(msg)); | |
412 | if (unlikely(!node)) | |
413 | goto exit; | |
414 | ||
415 | tipc_node_lock(node); | |
416 | if (unlikely(!node->bclink.supported)) | |
417 | goto unlock; | |
b97bf3fd | 418 | |
8a275a6a AS |
419 | /* Handle broadcast protocol message */ |
420 | ||
b97bf3fd | 421 | if (unlikely(msg_user(msg) == BCAST_PROTOCOL)) { |
9f6bdcd4 AS |
422 | if (msg_type(msg) != STATE_MSG) |
423 | goto unlock; | |
b97bf3fd | 424 | if (msg_destnode(msg) == tipc_own_addr) { |
4323add6 PL |
425 | tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); |
426 | tipc_node_unlock(node); | |
d356eeba | 427 | spin_lock_bh(&bc_lock); |
b97bf3fd | 428 | bcl->stats.recv_nacks++; |
01d83edd | 429 | bclink->retransmit_to = node; |
b97bf3fd PL |
430 | bclink_retransmit_pkt(msg_bcgap_after(msg), |
431 | msg_bcgap_to(msg)); | |
c4307285 | 432 | spin_unlock_bh(&bc_lock); |
b97bf3fd | 433 | } else { |
5d3c488d | 434 | tipc_node_unlock(node); |
7a54d4a9 | 435 | bclink_peek_nack(msg); |
b97bf3fd | 436 | } |
5d3c488d | 437 | goto exit; |
b97bf3fd PL |
438 | } |
439 | ||
5d3c488d AS |
440 | /* Handle in-sequence broadcast message */ |
441 | ||
b97bf3fd | 442 | seqno = msg_seqno(msg); |
8a275a6a | 443 | next_in = mod(node->bclink.last_in + 1); |
b97bf3fd PL |
444 | |
445 | if (likely(seqno == next_in)) { | |
7a54d4a9 | 446 | bclink_update_last_sent(node, seqno); |
8a275a6a | 447 | receive: |
7a54d4a9 AS |
448 | node->bclink.last_in = seqno; |
449 | node->bclink.oos_state = 0; | |
450 | ||
b98158e3 | 451 | spin_lock_bh(&bc_lock); |
b97bf3fd | 452 | bcl->stats.recv_info++; |
7a54d4a9 AS |
453 | |
454 | /* | |
455 | * Unicast an ACK periodically, ensuring that | |
456 | * all nodes in the cluster don't ACK at the same time | |
457 | */ | |
458 | ||
459 | if (((seqno - tipc_own_addr) % TIPC_MIN_LINK_WIN) == 0) { | |
460 | tipc_link_send_proto_msg( | |
461 | node->active_links[node->addr & 1], | |
462 | STATE_MSG, 0, 0, 0, 0, 0); | |
b97bf3fd PL |
463 | bcl->stats.sent_acks++; |
464 | } | |
b98158e3 | 465 | |
7a54d4a9 AS |
466 | /* Deliver message to destination */ |
467 | ||
b97bf3fd | 468 | if (likely(msg_isdata(msg))) { |
b98158e3 | 469 | spin_unlock_bh(&bc_lock); |
4323add6 | 470 | tipc_node_unlock(node); |
9f6bdcd4 AS |
471 | if (likely(msg_mcast(msg))) |
472 | tipc_port_recv_mcast(buf, NULL); | |
473 | else | |
474 | buf_discard(buf); | |
b97bf3fd PL |
475 | } else if (msg_user(msg) == MSG_BUNDLER) { |
476 | bcl->stats.recv_bundles++; | |
477 | bcl->stats.recv_bundled += msg_msgcnt(msg); | |
b98158e3 | 478 | spin_unlock_bh(&bc_lock); |
4323add6 PL |
479 | tipc_node_unlock(node); |
480 | tipc_link_recv_bundle(buf); | |
b97bf3fd PL |
481 | } else if (msg_user(msg) == MSG_FRAGMENTER) { |
482 | bcl->stats.recv_fragments++; | |
4323add6 PL |
483 | if (tipc_link_recv_fragment(&node->bclink.defragm, |
484 | &buf, &msg)) | |
b97bf3fd | 485 | bcl->stats.recv_fragmented++; |
b98158e3 | 486 | spin_unlock_bh(&bc_lock); |
4323add6 PL |
487 | tipc_node_unlock(node); |
488 | tipc_net_route_msg(buf); | |
9f6bdcd4 | 489 | } else if (msg_user(msg) == NAME_DISTRIBUTOR) { |
b98158e3 | 490 | spin_unlock_bh(&bc_lock); |
9f6bdcd4 AS |
491 | tipc_node_unlock(node); |
492 | tipc_named_recv(buf); | |
b97bf3fd | 493 | } else { |
b98158e3 | 494 | spin_unlock_bh(&bc_lock); |
4323add6 | 495 | tipc_node_unlock(node); |
9f6bdcd4 | 496 | buf_discard(buf); |
b97bf3fd | 497 | } |
5d3c488d | 498 | buf = NULL; |
8a275a6a AS |
499 | |
500 | /* Determine new synchronization state */ | |
501 | ||
5d3c488d | 502 | tipc_node_lock(node); |
8a275a6a AS |
503 | if (unlikely(!tipc_node_is_up(node))) |
504 | goto unlock; | |
505 | ||
7a54d4a9 | 506 | if (node->bclink.last_in == node->bclink.last_sent) |
8a275a6a AS |
507 | goto unlock; |
508 | ||
7a54d4a9 AS |
509 | if (!node->bclink.deferred_head) { |
510 | node->bclink.oos_state = 1; | |
511 | goto unlock; | |
512 | } | |
513 | ||
8a275a6a AS |
514 | msg = buf_msg(node->bclink.deferred_head); |
515 | seqno = msg_seqno(msg); | |
516 | next_in = mod(next_in + 1); | |
517 | if (seqno != next_in) | |
518 | goto unlock; | |
519 | ||
520 | /* Take in-sequence message from deferred queue & deliver it */ | |
521 | ||
522 | buf = node->bclink.deferred_head; | |
523 | node->bclink.deferred_head = buf->next; | |
7a54d4a9 | 524 | node->bclink.deferred_size--; |
8a275a6a AS |
525 | goto receive; |
526 | } | |
527 | ||
528 | /* Handle out-of-sequence broadcast message */ | |
529 | ||
530 | if (less(next_in, seqno)) { | |
8a275a6a AS |
531 | deferred = tipc_link_defer_pkt(&node->bclink.deferred_head, |
532 | &node->bclink.deferred_tail, | |
533 | buf); | |
7a54d4a9 AS |
534 | node->bclink.deferred_size += deferred; |
535 | bclink_update_last_sent(node, seqno); | |
5d3c488d | 536 | buf = NULL; |
8a275a6a AS |
537 | } else |
538 | deferred = 0; | |
539 | ||
b98158e3 AS |
540 | spin_lock_bh(&bc_lock); |
541 | ||
8a275a6a AS |
542 | if (deferred) |
543 | bcl->stats.deferred_recv++; | |
0232c5a5 AS |
544 | else |
545 | bcl->stats.duplicates++; | |
8a275a6a | 546 | |
b98158e3 AS |
547 | spin_unlock_bh(&bc_lock); |
548 | ||
5d3c488d | 549 | unlock: |
4323add6 | 550 | tipc_node_unlock(node); |
5d3c488d AS |
551 | exit: |
552 | buf_discard(buf); | |
b97bf3fd PL |
553 | } |
554 | ||
6c00055a | 555 | u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr) |
b97bf3fd PL |
556 | { |
557 | return (n_ptr->bclink.supported && | |
4323add6 | 558 | (tipc_bclink_get_last_sent() != n_ptr->bclink.acked)); |
b97bf3fd PL |
559 | } |
560 | ||
561 | ||
562 | /** | |
4323add6 | 563 | * tipc_bcbearer_send - send a packet through the broadcast pseudo-bearer |
c4307285 | 564 | * |
2ff9f924 AS |
565 | * Send packet over as many bearers as necessary to reach all nodes |
566 | * that have joined the broadcast link. | |
c4307285 | 567 | * |
2ff9f924 AS |
568 | * Returns 0 (packet sent successfully) under all circumstances, |
569 | * since the broadcast link's pseudo-bearer never blocks | |
b97bf3fd PL |
570 | */ |
571 | ||
988f088a AB |
572 | static int tipc_bcbearer_send(struct sk_buff *buf, |
573 | struct tipc_bearer *unused1, | |
574 | struct tipc_media_addr *unused2) | |
b97bf3fd | 575 | { |
b97bf3fd | 576 | int bp_index; |
b97bf3fd | 577 | |
2ff9f924 AS |
578 | /* |
579 | * Prepare broadcast link message for reliable transmission, | |
580 | * if first time trying to send it; | |
581 | * preparation is skipped for broadcast link protocol messages | |
582 | * since they are sent in an unreliable manner and don't need it | |
583 | */ | |
b97bf3fd PL |
584 | |
585 | if (likely(!msg_non_seq(buf_msg(buf)))) { | |
586 | struct tipc_msg *msg; | |
587 | ||
cd3decdf | 588 | bcbuf_set_acks(buf, bclink->bcast_nodes.count); |
b97bf3fd | 589 | msg = buf_msg(buf); |
40aecb1b | 590 | msg_set_non_seq(msg, 1); |
b97bf3fd | 591 | msg_set_mc_netid(msg, tipc_net_id); |
0048b826 | 592 | bcl->stats.sent_info++; |
5e726900 | 593 | |
cd3decdf | 594 | if (WARN_ON(!bclink->bcast_nodes.count)) { |
5e726900 AS |
595 | dump_stack(); |
596 | return 0; | |
597 | } | |
b97bf3fd PL |
598 | } |
599 | ||
b97bf3fd | 600 | /* Send buffer over bearers until all targets reached */ |
c4307285 | 601 | |
cd3decdf | 602 | bcbearer->remains = bclink->bcast_nodes; |
b97bf3fd PL |
603 | |
604 | for (bp_index = 0; bp_index < MAX_BEARERS; bp_index++) { | |
2d627b92 AS |
605 | struct tipc_bearer *p = bcbearer->bpairs[bp_index].primary; |
606 | struct tipc_bearer *s = bcbearer->bpairs[bp_index].secondary; | |
b97bf3fd PL |
607 | |
608 | if (!p) | |
609 | break; /* no more bearers to try */ | |
610 | ||
65f51ef0 AS |
611 | tipc_nmap_diff(&bcbearer->remains, &p->nodes, &bcbearer->remains_new); |
612 | if (bcbearer->remains_new.count == bcbearer->remains.count) | |
b97bf3fd PL |
613 | continue; /* bearer pair doesn't add anything */ |
614 | ||
2d627b92 AS |
615 | if (p->blocked || |
616 | p->media->send_msg(buf, p, &p->media->bcast_addr)) { | |
1a624832 | 617 | /* unable to send on primary bearer */ |
2d627b92 AS |
618 | if (!s || s->blocked || |
619 | s->media->send_msg(buf, s, | |
1a624832 NH |
620 | &s->media->bcast_addr)) { |
621 | /* unable to send on either bearer */ | |
622 | continue; | |
623 | } | |
624 | } | |
625 | ||
626 | if (s) { | |
627 | bcbearer->bpairs[bp_index].primary = s; | |
628 | bcbearer->bpairs[bp_index].secondary = p; | |
b97bf3fd PL |
629 | } |
630 | ||
65f51ef0 | 631 | if (bcbearer->remains_new.count == 0) |
2ff9f924 | 632 | break; /* all targets reached */ |
b97bf3fd | 633 | |
65f51ef0 | 634 | bcbearer->remains = bcbearer->remains_new; |
b97bf3fd | 635 | } |
c4307285 | 636 | |
2ff9f924 | 637 | return 0; |
b97bf3fd PL |
638 | } |
639 | ||
640 | /** | |
4323add6 | 641 | * tipc_bcbearer_sort - create sets of bearer pairs used by broadcast bearer |
b97bf3fd PL |
642 | */ |
643 | ||
4323add6 | 644 | void tipc_bcbearer_sort(void) |
b97bf3fd | 645 | { |
7f9ab6ac PG |
646 | struct tipc_bcbearer_pair *bp_temp = bcbearer->bpairs_temp; |
647 | struct tipc_bcbearer_pair *bp_curr; | |
b97bf3fd PL |
648 | int b_index; |
649 | int pri; | |
650 | ||
651 | spin_lock_bh(&bc_lock); | |
652 | ||
653 | /* Group bearers by priority (can assume max of two per priority) */ | |
654 | ||
655 | memset(bp_temp, 0, sizeof(bcbearer->bpairs_temp)); | |
656 | ||
657 | for (b_index = 0; b_index < MAX_BEARERS; b_index++) { | |
2d627b92 | 658 | struct tipc_bearer *b = &tipc_bearers[b_index]; |
b97bf3fd PL |
659 | |
660 | if (!b->active || !b->nodes.count) | |
661 | continue; | |
662 | ||
663 | if (!bp_temp[b->priority].primary) | |
664 | bp_temp[b->priority].primary = b; | |
665 | else | |
666 | bp_temp[b->priority].secondary = b; | |
667 | } | |
668 | ||
669 | /* Create array of bearer pairs for broadcasting */ | |
670 | ||
671 | bp_curr = bcbearer->bpairs; | |
672 | memset(bcbearer->bpairs, 0, sizeof(bcbearer->bpairs)); | |
673 | ||
16cb4b33 | 674 | for (pri = TIPC_MAX_LINK_PRI; pri >= 0; pri--) { |
b97bf3fd PL |
675 | |
676 | if (!bp_temp[pri].primary) | |
677 | continue; | |
678 | ||
679 | bp_curr->primary = bp_temp[pri].primary; | |
680 | ||
681 | if (bp_temp[pri].secondary) { | |
4323add6 PL |
682 | if (tipc_nmap_equal(&bp_temp[pri].primary->nodes, |
683 | &bp_temp[pri].secondary->nodes)) { | |
b97bf3fd PL |
684 | bp_curr->secondary = bp_temp[pri].secondary; |
685 | } else { | |
686 | bp_curr++; | |
687 | bp_curr->primary = bp_temp[pri].secondary; | |
688 | } | |
689 | } | |
690 | ||
691 | bp_curr++; | |
692 | } | |
693 | ||
694 | spin_unlock_bh(&bc_lock); | |
695 | } | |
696 | ||
b97bf3fd | 697 | |
4323add6 | 698 | int tipc_bclink_stats(char *buf, const u32 buf_size) |
b97bf3fd PL |
699 | { |
700 | struct print_buf pb; | |
701 | ||
702 | if (!bcl) | |
703 | return 0; | |
704 | ||
4323add6 | 705 | tipc_printbuf_init(&pb, buf, buf_size); |
b97bf3fd PL |
706 | |
707 | spin_lock_bh(&bc_lock); | |
708 | ||
709 | tipc_printf(&pb, "Link <%s>\n" | |
c4307285 | 710 | " Window:%u packets\n", |
b97bf3fd | 711 | bcl->name, bcl->queue_limit[0]); |
c4307285 | 712 | tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n", |
b97bf3fd PL |
713 | bcl->stats.recv_info, |
714 | bcl->stats.recv_fragments, | |
715 | bcl->stats.recv_fragmented, | |
716 | bcl->stats.recv_bundles, | |
717 | bcl->stats.recv_bundled); | |
c4307285 | 718 | tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n", |
b97bf3fd PL |
719 | bcl->stats.sent_info, |
720 | bcl->stats.sent_fragments, | |
c4307285 | 721 | bcl->stats.sent_fragmented, |
b97bf3fd PL |
722 | bcl->stats.sent_bundles, |
723 | bcl->stats.sent_bundled); | |
c4307285 | 724 | tipc_printf(&pb, " RX naks:%u defs:%u dups:%u\n", |
b97bf3fd | 725 | bcl->stats.recv_nacks, |
c4307285 | 726 | bcl->stats.deferred_recv, |
b97bf3fd | 727 | bcl->stats.duplicates); |
c4307285 YH |
728 | tipc_printf(&pb, " TX naks:%u acks:%u dups:%u\n", |
729 | bcl->stats.sent_nacks, | |
730 | bcl->stats.sent_acks, | |
b97bf3fd PL |
731 | bcl->stats.retransmitted); |
732 | tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n", | |
733 | bcl->stats.bearer_congs, | |
734 | bcl->stats.link_congs, | |
735 | bcl->stats.max_queue_sz, | |
736 | bcl->stats.queue_sz_counts | |
737 | ? (bcl->stats.accu_queue_sz / bcl->stats.queue_sz_counts) | |
738 | : 0); | |
739 | ||
740 | spin_unlock_bh(&bc_lock); | |
4323add6 | 741 | return tipc_printbuf_validate(&pb); |
b97bf3fd PL |
742 | } |
743 | ||
4323add6 | 744 | int tipc_bclink_reset_stats(void) |
b97bf3fd PL |
745 | { |
746 | if (!bcl) | |
747 | return -ENOPROTOOPT; | |
748 | ||
749 | spin_lock_bh(&bc_lock); | |
750 | memset(&bcl->stats, 0, sizeof(bcl->stats)); | |
751 | spin_unlock_bh(&bc_lock); | |
0e35fd5e | 752 | return 0; |
b97bf3fd PL |
753 | } |
754 | ||
4323add6 | 755 | int tipc_bclink_set_queue_limits(u32 limit) |
b97bf3fd PL |
756 | { |
757 | if (!bcl) | |
758 | return -ENOPROTOOPT; | |
759 | if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN)) | |
760 | return -EINVAL; | |
761 | ||
762 | spin_lock_bh(&bc_lock); | |
4323add6 | 763 | tipc_link_set_queue_limits(bcl, limit); |
b97bf3fd | 764 | spin_unlock_bh(&bc_lock); |
0e35fd5e | 765 | return 0; |
b97bf3fd PL |
766 | } |
767 | ||
c47e9b91 | 768 | void tipc_bclink_init(void) |
b97bf3fd | 769 | { |
b97bf3fd PL |
770 | INIT_LIST_HEAD(&bcbearer->bearer.cong_links); |
771 | bcbearer->bearer.media = &bcbearer->media; | |
4323add6 | 772 | bcbearer->media.send_msg = tipc_bcbearer_send; |
2e2d9be8 | 773 | sprintf(bcbearer->media.name, "tipc-broadcast"); |
b97bf3fd | 774 | |
b97bf3fd PL |
775 | INIT_LIST_HEAD(&bcl->waiting_ports); |
776 | bcl->next_out_no = 1; | |
34af946a | 777 | spin_lock_init(&bclink->node.lock); |
b97bf3fd | 778 | bcl->owner = &bclink->node; |
c4307285 | 779 | bcl->max_pkt = MAX_PKT_DEFAULT_MCAST; |
4323add6 | 780 | tipc_link_set_queue_limits(bcl, BCLINK_WIN_DEFAULT); |
b97bf3fd PL |
781 | bcl->b_ptr = &bcbearer->bearer; |
782 | bcl->state = WORKING_WORKING; | |
4b704d59 | 783 | strlcpy(bcl->name, tipc_bclink_name, TIPC_MAX_LINK_NAME); |
b97bf3fd PL |
784 | } |
785 | ||
4323add6 | 786 | void tipc_bclink_stop(void) |
b97bf3fd PL |
787 | { |
788 | spin_lock_bh(&bc_lock); | |
c47e9b91 | 789 | tipc_link_stop(bcl); |
b97bf3fd | 790 | spin_unlock_bh(&bc_lock); |
c47e9b91 AS |
791 | |
792 | memset(bclink, 0, sizeof(*bclink)); | |
793 | memset(bcbearer, 0, sizeof(*bcbearer)); | |
b97bf3fd PL |
794 | } |
795 | ||
3e22e62b AS |
796 | |
797 | /** | |
798 | * tipc_nmap_add - add a node to a node map | |
799 | */ | |
800 | ||
801 | void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node) | |
802 | { | |
803 | int n = tipc_node(node); | |
804 | int w = n / WSIZE; | |
805 | u32 mask = (1 << (n % WSIZE)); | |
806 | ||
807 | if ((nm_ptr->map[w] & mask) == 0) { | |
808 | nm_ptr->count++; | |
809 | nm_ptr->map[w] |= mask; | |
810 | } | |
811 | } | |
812 | ||
813 | /** | |
814 | * tipc_nmap_remove - remove a node from a node map | |
815 | */ | |
816 | ||
817 | void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node) | |
818 | { | |
819 | int n = tipc_node(node); | |
820 | int w = n / WSIZE; | |
821 | u32 mask = (1 << (n % WSIZE)); | |
822 | ||
823 | if ((nm_ptr->map[w] & mask) != 0) { | |
824 | nm_ptr->map[w] &= ~mask; | |
825 | nm_ptr->count--; | |
826 | } | |
827 | } | |
828 | ||
829 | /** | |
830 | * tipc_nmap_diff - find differences between node maps | |
831 | * @nm_a: input node map A | |
832 | * @nm_b: input node map B | |
833 | * @nm_diff: output node map A-B (i.e. nodes of A that are not in B) | |
834 | */ | |
835 | ||
31e3c3f6 | 836 | static void tipc_nmap_diff(struct tipc_node_map *nm_a, |
837 | struct tipc_node_map *nm_b, | |
838 | struct tipc_node_map *nm_diff) | |
3e22e62b AS |
839 | { |
840 | int stop = ARRAY_SIZE(nm_a->map); | |
841 | int w; | |
842 | int b; | |
843 | u32 map; | |
844 | ||
845 | memset(nm_diff, 0, sizeof(*nm_diff)); | |
846 | for (w = 0; w < stop; w++) { | |
847 | map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]); | |
848 | nm_diff->map[w] = map; | |
849 | if (map != 0) { | |
850 | for (b = 0 ; b < WSIZE; b++) { | |
851 | if (map & (1 << b)) | |
852 | nm_diff->count++; | |
853 | } | |
854 | } | |
855 | } | |
856 | } | |
43608edc AS |
857 | |
858 | /** | |
859 | * tipc_port_list_add - add a port to a port list, ensuring no duplicates | |
860 | */ | |
861 | ||
4584310b | 862 | void tipc_port_list_add(struct tipc_port_list *pl_ptr, u32 port) |
43608edc | 863 | { |
4584310b | 864 | struct tipc_port_list *item = pl_ptr; |
43608edc AS |
865 | int i; |
866 | int item_sz = PLSIZE; | |
867 | int cnt = pl_ptr->count; | |
868 | ||
869 | for (; ; cnt -= item_sz, item = item->next) { | |
870 | if (cnt < PLSIZE) | |
871 | item_sz = cnt; | |
872 | for (i = 0; i < item_sz; i++) | |
873 | if (item->ports[i] == port) | |
874 | return; | |
875 | if (i < PLSIZE) { | |
876 | item->ports[i] = port; | |
877 | pl_ptr->count++; | |
878 | return; | |
879 | } | |
880 | if (!item->next) { | |
881 | item->next = kmalloc(sizeof(*item), GFP_ATOMIC); | |
882 | if (!item->next) { | |
883 | warn("Incomplete multicast delivery, no memory\n"); | |
884 | return; | |
885 | } | |
886 | item->next->next = NULL; | |
887 | } | |
888 | } | |
889 | } | |
890 | ||
891 | /** | |
892 | * tipc_port_list_free - free dynamically created entries in port_list chain | |
893 | * | |
894 | */ | |
895 | ||
4584310b | 896 | void tipc_port_list_free(struct tipc_port_list *pl_ptr) |
43608edc | 897 | { |
4584310b PG |
898 | struct tipc_port_list *item; |
899 | struct tipc_port_list *next; | |
43608edc AS |
900 | |
901 | for (item = pl_ptr->next; item; item = next) { | |
902 | next = item->next; | |
903 | kfree(item); | |
904 | } | |
905 | } | |
906 |