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