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