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