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