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