]>
Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/node.c: TIPC node management routines | |
c4307285 | 3 | * |
dd3f9e70 | 4 | * Copyright (c) 2000-2006, 2012-2015, Ericsson AB |
46651c59 | 5 | * Copyright (c) 2005-2006, 2010-2014, Wind River Systems |
b97bf3fd PL |
6 | * All rights reserved. |
7 | * | |
9ea1fd3c | 8 | * Redistribution and use in source and binary forms, with or without |
b97bf3fd PL |
9 | * modification, are permitted provided that the following conditions are met: |
10 | * | |
9ea1fd3c PL |
11 | * 1. Redistributions of source code must retain the above copyright |
12 | * notice, this list of conditions and the following disclaimer. | |
13 | * 2. Redistributions in binary form must reproduce the above copyright | |
14 | * notice, this list of conditions and the following disclaimer in the | |
15 | * documentation and/or other materials provided with the distribution. | |
16 | * 3. Neither the names of the copyright holders nor the names of its | |
17 | * contributors may be used to endorse or promote products derived from | |
18 | * this software without specific prior written permission. | |
b97bf3fd | 19 | * |
9ea1fd3c PL |
20 | * Alternatively, this software may be distributed under the terms of the |
21 | * GNU General Public License ("GPL") version 2 as published by the Free | |
22 | * Software Foundation. | |
23 | * | |
24 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | |
25 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
26 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
27 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | |
28 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | |
29 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | |
30 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
31 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | |
32 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
33 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
b97bf3fd PL |
34 | * POSSIBILITY OF SUCH DAMAGE. |
35 | */ | |
36 | ||
37 | #include "core.h" | |
22ae7cff | 38 | #include "link.h" |
b97bf3fd | 39 | #include "node.h" |
b97bf3fd | 40 | #include "name_distr.h" |
50100a5e | 41 | #include "socket.h" |
a6bf70f7 | 42 | #include "bcast.h" |
d999297c | 43 | #include "discover.h" |
c8199300 | 44 | |
6e498158 JPM |
45 | /* Node FSM states and events: |
46 | */ | |
47 | enum { | |
48 | SELF_DOWN_PEER_DOWN = 0xdd, | |
49 | SELF_UP_PEER_UP = 0xaa, | |
50 | SELF_DOWN_PEER_LEAVING = 0xd1, | |
51 | SELF_UP_PEER_COMING = 0xac, | |
52 | SELF_COMING_PEER_UP = 0xca, | |
53 | SELF_LEAVING_PEER_DOWN = 0x1d, | |
54 | NODE_FAILINGOVER = 0xf0, | |
55 | NODE_SYNCHING = 0xcc | |
56 | }; | |
57 | ||
58 | enum { | |
59 | SELF_ESTABL_CONTACT_EVT = 0xece, | |
60 | SELF_LOST_CONTACT_EVT = 0x1ce, | |
61 | PEER_ESTABL_CONTACT_EVT = 0x9ece, | |
62 | PEER_LOST_CONTACT_EVT = 0x91ce, | |
63 | NODE_FAILOVER_BEGIN_EVT = 0xfbe, | |
64 | NODE_FAILOVER_END_EVT = 0xfee, | |
65 | NODE_SYNCH_BEGIN_EVT = 0xcbe, | |
66 | NODE_SYNCH_END_EVT = 0xcee | |
67 | }; | |
68 | ||
598411d7 JPM |
69 | static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id, |
70 | struct sk_buff_head *xmitq, | |
71 | struct tipc_media_addr **maddr); | |
72 | static void tipc_node_link_down(struct tipc_node *n, int bearer_id, | |
73 | bool delete); | |
74 | static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq); | |
8a0f6ebe | 75 | static void tipc_node_delete(struct tipc_node *node); |
8a1577c9 | 76 | static void tipc_node_timeout(unsigned long data); |
d999297c | 77 | static void tipc_node_fsm_evt(struct tipc_node *n, int evt); |
b97bf3fd | 78 | |
02be61a9 JPM |
79 | struct tipc_sock_conn { |
80 | u32 port; | |
81 | u32 peer_port; | |
82 | u32 peer_node; | |
83 | struct list_head list; | |
84 | }; | |
85 | ||
3e4b6ab5 RA |
86 | static const struct nla_policy tipc_nl_node_policy[TIPC_NLA_NODE_MAX + 1] = { |
87 | [TIPC_NLA_NODE_UNSPEC] = { .type = NLA_UNSPEC }, | |
88 | [TIPC_NLA_NODE_ADDR] = { .type = NLA_U32 }, | |
89 | [TIPC_NLA_NODE_UP] = { .type = NLA_FLAG } | |
90 | }; | |
91 | ||
a635b46b AS |
92 | /* |
93 | * A trivial power-of-two bitmask technique is used for speed, since this | |
94 | * operation is done for every incoming TIPC packet. The number of hash table | |
95 | * entries has been chosen so that no hash chain exceeds 8 nodes and will | |
96 | * usually be much smaller (typically only a single node). | |
97 | */ | |
872f24db | 98 | static unsigned int tipc_hashfn(u32 addr) |
a635b46b AS |
99 | { |
100 | return addr & (NODE_HTABLE_SIZE - 1); | |
101 | } | |
102 | ||
8a0f6ebe YX |
103 | static void tipc_node_kref_release(struct kref *kref) |
104 | { | |
105 | struct tipc_node *node = container_of(kref, struct tipc_node, kref); | |
106 | ||
107 | tipc_node_delete(node); | |
108 | } | |
109 | ||
110 | void tipc_node_put(struct tipc_node *node) | |
111 | { | |
112 | kref_put(&node->kref, tipc_node_kref_release); | |
113 | } | |
114 | ||
115 | static void tipc_node_get(struct tipc_node *node) | |
116 | { | |
117 | kref_get(&node->kref); | |
118 | } | |
119 | ||
1ec2bb08 | 120 | /* |
672d99e1 AS |
121 | * tipc_node_find - locate specified node object, if it exists |
122 | */ | |
f2f9800d | 123 | struct tipc_node *tipc_node_find(struct net *net, u32 addr) |
672d99e1 | 124 | { |
f2f9800d | 125 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
672d99e1 | 126 | struct tipc_node *node; |
672d99e1 | 127 | |
34747539 | 128 | if (unlikely(!in_own_cluster_exact(net, addr))) |
672d99e1 AS |
129 | return NULL; |
130 | ||
6c7a762e | 131 | rcu_read_lock(); |
f2f9800d YX |
132 | hlist_for_each_entry_rcu(node, &tn->node_htable[tipc_hashfn(addr)], |
133 | hash) { | |
46651c59 | 134 | if (node->addr == addr) { |
8a0f6ebe | 135 | tipc_node_get(node); |
6c7a762e | 136 | rcu_read_unlock(); |
672d99e1 | 137 | return node; |
46651c59 | 138 | } |
672d99e1 | 139 | } |
6c7a762e | 140 | rcu_read_unlock(); |
672d99e1 AS |
141 | return NULL; |
142 | } | |
143 | ||
cf148816 | 144 | struct tipc_node *tipc_node_create(struct net *net, u32 addr, u16 capabilities) |
b97bf3fd | 145 | { |
f2f9800d | 146 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
672d99e1 | 147 | struct tipc_node *n_ptr, *temp_node; |
b97bf3fd | 148 | |
f2f9800d | 149 | spin_lock_bh(&tn->node_list_lock); |
b45db71b JPM |
150 | n_ptr = tipc_node_find(net, addr); |
151 | if (n_ptr) | |
152 | goto exit; | |
5af54792 | 153 | n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC); |
a10bd924 | 154 | if (!n_ptr) { |
2cf8aa19 | 155 | pr_warn("Node creation failed, no memory\n"); |
b45db71b | 156 | goto exit; |
a10bd924 | 157 | } |
a10bd924 | 158 | n_ptr->addr = addr; |
f2f9800d | 159 | n_ptr->net = net; |
cf148816 | 160 | n_ptr->capabilities = capabilities; |
8a0f6ebe | 161 | kref_init(&n_ptr->kref); |
51a8e4de | 162 | spin_lock_init(&n_ptr->lock); |
672d99e1 AS |
163 | INIT_HLIST_NODE(&n_ptr->hash); |
164 | INIT_LIST_HEAD(&n_ptr->list); | |
a8f48af5 | 165 | INIT_LIST_HEAD(&n_ptr->publ_list); |
02be61a9 | 166 | INIT_LIST_HEAD(&n_ptr->conn_sks); |
52666986 JPM |
167 | skb_queue_head_init(&n_ptr->bc_entry.namedq); |
168 | skb_queue_head_init(&n_ptr->bc_entry.inputq1); | |
169 | __skb_queue_head_init(&n_ptr->bc_entry.arrvq); | |
170 | skb_queue_head_init(&n_ptr->bc_entry.inputq2); | |
f2f9800d | 171 | hlist_add_head_rcu(&n_ptr->hash, &tn->node_htable[tipc_hashfn(addr)]); |
f2f9800d | 172 | list_for_each_entry_rcu(temp_node, &tn->node_list, list) { |
672d99e1 AS |
173 | if (n_ptr->addr < temp_node->addr) |
174 | break; | |
175 | } | |
6c7a762e | 176 | list_add_tail_rcu(&n_ptr->list, &temp_node->list); |
d999297c | 177 | n_ptr->state = SELF_DOWN_PEER_LEAVING; |
fc0eea69 | 178 | n_ptr->signature = INVALID_NODE_SIG; |
36e78a46 JPM |
179 | n_ptr->active_links[0] = INVALID_BEARER_ID; |
180 | n_ptr->active_links[1] = INVALID_BEARER_ID; | |
52666986 JPM |
181 | if (!tipc_link_bc_create(n_ptr, tipc_own_addr(net), n_ptr->addr, |
182 | U16_MAX, tipc_bc_sndlink(net)->window, | |
183 | n_ptr->capabilities, | |
184 | &n_ptr->bc_entry.inputq1, | |
185 | &n_ptr->bc_entry.namedq, | |
186 | tipc_bc_sndlink(net), | |
187 | &n_ptr->bc_entry.link)) { | |
188 | pr_warn("Broadcast rcv link creation failed, no memory\n"); | |
189 | kfree(n_ptr); | |
190 | n_ptr = NULL; | |
191 | goto exit; | |
192 | } | |
8a0f6ebe | 193 | tipc_node_get(n_ptr); |
8a1577c9 JPM |
194 | setup_timer(&n_ptr->timer, tipc_node_timeout, (unsigned long)n_ptr); |
195 | n_ptr->keepalive_intv = U32_MAX; | |
b45db71b | 196 | exit: |
f2f9800d | 197 | spin_unlock_bh(&tn->node_list_lock); |
b97bf3fd PL |
198 | return n_ptr; |
199 | } | |
200 | ||
8a1577c9 JPM |
201 | static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l) |
202 | { | |
203 | unsigned long tol = l->tolerance; | |
204 | unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4; | |
205 | unsigned long keepalive_intv = msecs_to_jiffies(intv); | |
206 | ||
207 | /* Link with lowest tolerance determines timer interval */ | |
208 | if (keepalive_intv < n->keepalive_intv) | |
209 | n->keepalive_intv = keepalive_intv; | |
210 | ||
211 | /* Ensure link's abort limit corresponds to current interval */ | |
212 | l->abort_limit = l->tolerance / jiffies_to_msecs(n->keepalive_intv); | |
213 | } | |
214 | ||
8a0f6ebe | 215 | static void tipc_node_delete(struct tipc_node *node) |
b97bf3fd | 216 | { |
8a0f6ebe YX |
217 | list_del_rcu(&node->list); |
218 | hlist_del_rcu(&node->hash); | |
52666986 | 219 | kfree(node->bc_entry.link); |
8a0f6ebe | 220 | kfree_rcu(node, rcu); |
b97bf3fd PL |
221 | } |
222 | ||
f2f9800d | 223 | void tipc_node_stop(struct net *net) |
46651c59 | 224 | { |
f2f9800d | 225 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
46651c59 YX |
226 | struct tipc_node *node, *t_node; |
227 | ||
f2f9800d | 228 | spin_lock_bh(&tn->node_list_lock); |
8a1577c9 JPM |
229 | list_for_each_entry_safe(node, t_node, &tn->node_list, list) { |
230 | if (del_timer(&node->timer)) | |
231 | tipc_node_put(node); | |
8a0f6ebe | 232 | tipc_node_put(node); |
8a1577c9 | 233 | } |
f2f9800d | 234 | spin_unlock_bh(&tn->node_list_lock); |
46651c59 YX |
235 | } |
236 | ||
f2f9800d | 237 | int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port) |
02be61a9 JPM |
238 | { |
239 | struct tipc_node *node; | |
240 | struct tipc_sock_conn *conn; | |
8a0f6ebe | 241 | int err = 0; |
02be61a9 | 242 | |
34747539 | 243 | if (in_own_node(net, dnode)) |
02be61a9 JPM |
244 | return 0; |
245 | ||
f2f9800d | 246 | node = tipc_node_find(net, dnode); |
02be61a9 JPM |
247 | if (!node) { |
248 | pr_warn("Connecting sock to node 0x%x failed\n", dnode); | |
249 | return -EHOSTUNREACH; | |
250 | } | |
251 | conn = kmalloc(sizeof(*conn), GFP_ATOMIC); | |
8a0f6ebe YX |
252 | if (!conn) { |
253 | err = -EHOSTUNREACH; | |
254 | goto exit; | |
255 | } | |
02be61a9 JPM |
256 | conn->peer_node = dnode; |
257 | conn->port = port; | |
258 | conn->peer_port = peer_port; | |
259 | ||
260 | tipc_node_lock(node); | |
261 | list_add_tail(&conn->list, &node->conn_sks); | |
262 | tipc_node_unlock(node); | |
8a0f6ebe YX |
263 | exit: |
264 | tipc_node_put(node); | |
265 | return err; | |
02be61a9 JPM |
266 | } |
267 | ||
f2f9800d | 268 | void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port) |
02be61a9 JPM |
269 | { |
270 | struct tipc_node *node; | |
271 | struct tipc_sock_conn *conn, *safe; | |
272 | ||
34747539 | 273 | if (in_own_node(net, dnode)) |
02be61a9 JPM |
274 | return; |
275 | ||
f2f9800d | 276 | node = tipc_node_find(net, dnode); |
02be61a9 JPM |
277 | if (!node) |
278 | return; | |
279 | ||
280 | tipc_node_lock(node); | |
281 | list_for_each_entry_safe(conn, safe, &node->conn_sks, list) { | |
282 | if (port != conn->port) | |
283 | continue; | |
284 | list_del(&conn->list); | |
285 | kfree(conn); | |
286 | } | |
287 | tipc_node_unlock(node); | |
8a0f6ebe | 288 | tipc_node_put(node); |
02be61a9 JPM |
289 | } |
290 | ||
8a1577c9 JPM |
291 | /* tipc_node_timeout - handle expiration of node timer |
292 | */ | |
293 | static void tipc_node_timeout(unsigned long data) | |
294 | { | |
295 | struct tipc_node *n = (struct tipc_node *)data; | |
598411d7 | 296 | struct tipc_link_entry *le; |
8a1577c9 | 297 | struct sk_buff_head xmitq; |
8a1577c9 JPM |
298 | int bearer_id; |
299 | int rc = 0; | |
300 | ||
301 | __skb_queue_head_init(&xmitq); | |
302 | ||
303 | for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) { | |
304 | tipc_node_lock(n); | |
598411d7 JPM |
305 | le = &n->links[bearer_id]; |
306 | if (le->link) { | |
8a1577c9 | 307 | /* Link tolerance may change asynchronously: */ |
598411d7 JPM |
308 | tipc_node_calculate_timer(n, le->link); |
309 | rc = tipc_link_timeout(le->link, &xmitq); | |
8a1577c9 JPM |
310 | } |
311 | tipc_node_unlock(n); | |
598411d7 JPM |
312 | tipc_bearer_xmit(n->net, bearer_id, &xmitq, &le->maddr); |
313 | if (rc & TIPC_LINK_DOWN_EVT) | |
314 | tipc_node_link_down(n, bearer_id, false); | |
8a1577c9 JPM |
315 | } |
316 | if (!mod_timer(&n->timer, jiffies + n->keepalive_intv)) | |
317 | tipc_node_get(n); | |
318 | tipc_node_put(n); | |
319 | } | |
320 | ||
b97bf3fd | 321 | /** |
598411d7 JPM |
322 | * __tipc_node_link_up - handle addition of link |
323 | * Node lock must be held by caller | |
b97bf3fd PL |
324 | * Link becomes active (alone or shared) or standby, depending on its priority. |
325 | */ | |
598411d7 JPM |
326 | static void __tipc_node_link_up(struct tipc_node *n, int bearer_id, |
327 | struct sk_buff_head *xmitq) | |
b97bf3fd | 328 | { |
36e78a46 JPM |
329 | int *slot0 = &n->active_links[0]; |
330 | int *slot1 = &n->active_links[1]; | |
6e498158 JPM |
331 | struct tipc_link *ol = node_active_link(n, 0); |
332 | struct tipc_link *nl = n->links[bearer_id].link; | |
9d13ec65 | 333 | |
73f646ce JPM |
334 | if (!nl) |
335 | return; | |
336 | ||
337 | tipc_link_fsm_evt(nl, LINK_ESTABLISH_EVT); | |
338 | if (!tipc_link_is_up(nl)) | |
598411d7 JPM |
339 | return; |
340 | ||
9d13ec65 JPM |
341 | n->working_links++; |
342 | n->action_flags |= TIPC_NOTIFY_LINK_UP; | |
6e498158 JPM |
343 | n->link_id = nl->peer_bearer_id << 16 | bearer_id; |
344 | ||
345 | /* Leave room for tunnel header when returning 'mtu' to users: */ | |
346 | n->links[bearer_id].mtu = nl->mtu - INT_H_SIZE; | |
7b8613e0 | 347 | |
cbeb83ca | 348 | tipc_bearer_add_dest(n->net, bearer_id, n->addr); |
b06b281e | 349 | tipc_bcast_inc_bearer_dst_cnt(n->net, bearer_id); |
cbeb83ca | 350 | |
3fa9cacd | 351 | pr_debug("Established link <%s> on network plane %c\n", |
6e498158 | 352 | nl->name, nl->net_plane); |
c4307285 | 353 | |
6e498158 JPM |
354 | /* First link? => give it both slots */ |
355 | if (!ol) { | |
36e78a46 JPM |
356 | *slot0 = bearer_id; |
357 | *slot1 = bearer_id; | |
52666986 JPM |
358 | tipc_node_fsm_evt(n, SELF_ESTABL_CONTACT_EVT); |
359 | n->action_flags |= TIPC_NOTIFY_NODE_UP; | |
b06b281e | 360 | tipc_bcast_add_peer(n->net, nl, xmitq); |
9d13ec65 | 361 | return; |
b97bf3fd | 362 | } |
36e78a46 | 363 | |
6e498158 JPM |
364 | /* Second link => redistribute slots */ |
365 | if (nl->priority > ol->priority) { | |
366 | pr_debug("Old link <%s> becomes standby\n", ol->name); | |
36e78a46 | 367 | *slot0 = bearer_id; |
6e498158 JPM |
368 | *slot1 = bearer_id; |
369 | } else if (nl->priority == ol->priority) { | |
370 | *slot0 = bearer_id; | |
371 | } else { | |
372 | pr_debug("New link <%s> is standby\n", nl->name); | |
b97bf3fd | 373 | } |
b97bf3fd | 374 | |
6e498158 JPM |
375 | /* Prepare synchronization with first link */ |
376 | tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq); | |
b97bf3fd PL |
377 | } |
378 | ||
379 | /** | |
598411d7 JPM |
380 | * tipc_node_link_up - handle addition of link |
381 | * | |
382 | * Link becomes active (alone or shared) or standby, depending on its priority. | |
b97bf3fd | 383 | */ |
598411d7 JPM |
384 | static void tipc_node_link_up(struct tipc_node *n, int bearer_id, |
385 | struct sk_buff_head *xmitq) | |
b97bf3fd | 386 | { |
598411d7 JPM |
387 | tipc_node_lock(n); |
388 | __tipc_node_link_up(n, bearer_id, xmitq); | |
389 | tipc_node_unlock(n); | |
390 | } | |
391 | ||
392 | /** | |
393 | * __tipc_node_link_down - handle loss of link | |
394 | */ | |
395 | static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id, | |
396 | struct sk_buff_head *xmitq, | |
397 | struct tipc_media_addr **maddr) | |
398 | { | |
399 | struct tipc_link_entry *le = &n->links[*bearer_id]; | |
36e78a46 JPM |
400 | int *slot0 = &n->active_links[0]; |
401 | int *slot1 = &n->active_links[1]; | |
402 | int i, highest = 0; | |
6e498158 | 403 | struct tipc_link *l, *_l, *tnl; |
b97bf3fd | 404 | |
598411d7 | 405 | l = n->links[*bearer_id].link; |
662921cd | 406 | if (!l || tipc_link_is_reset(l)) |
655fb243 JPM |
407 | return; |
408 | ||
9d13ec65 JPM |
409 | n->working_links--; |
410 | n->action_flags |= TIPC_NOTIFY_LINK_DOWN; | |
598411d7 | 411 | n->link_id = l->peer_bearer_id << 16 | *bearer_id; |
5392d646 | 412 | |
598411d7 | 413 | tipc_bearer_remove_dest(n->net, *bearer_id, n->addr); |
655fb243 | 414 | |
3fa9cacd | 415 | pr_debug("Lost link <%s> on network plane %c\n", |
9d13ec65 | 416 | l->name, l->net_plane); |
16e166b8 | 417 | |
36e78a46 JPM |
418 | /* Select new active link if any available */ |
419 | *slot0 = INVALID_BEARER_ID; | |
420 | *slot1 = INVALID_BEARER_ID; | |
421 | for (i = 0; i < MAX_BEARERS; i++) { | |
422 | _l = n->links[i].link; | |
423 | if (!_l || !tipc_link_is_up(_l)) | |
424 | continue; | |
655fb243 JPM |
425 | if (_l == l) |
426 | continue; | |
36e78a46 JPM |
427 | if (_l->priority < highest) |
428 | continue; | |
429 | if (_l->priority > highest) { | |
430 | highest = _l->priority; | |
431 | *slot0 = i; | |
432 | *slot1 = i; | |
433 | continue; | |
434 | } | |
435 | *slot1 = i; | |
436 | } | |
655fb243 | 437 | |
6e498158 | 438 | if (!tipc_node_is_up(n)) { |
c8199300 JPM |
439 | if (tipc_link_peer_is_down(l)) |
440 | tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT); | |
441 | tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT); | |
442 | tipc_link_fsm_evt(l, LINK_RESET_EVT); | |
6e498158 | 443 | tipc_link_reset(l); |
282b3a05 JPM |
444 | tipc_link_build_reset_msg(l, xmitq); |
445 | *maddr = &n->links[*bearer_id].maddr; | |
598411d7 | 446 | node_lost_contact(n, &le->inputq); |
b06b281e | 447 | tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id); |
6e498158 JPM |
448 | return; |
449 | } | |
b06b281e | 450 | tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id); |
655fb243 | 451 | |
6e498158 JPM |
452 | /* There is still a working link => initiate failover */ |
453 | tnl = node_active_link(n, 0); | |
5ae2f8e6 JPM |
454 | tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT); |
455 | tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT); | |
6e498158 | 456 | n->sync_point = tnl->rcv_nxt + (U16_MAX / 2 - 1); |
598411d7 | 457 | tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq); |
655fb243 | 458 | tipc_link_reset(l); |
c8199300 | 459 | tipc_link_fsm_evt(l, LINK_RESET_EVT); |
662921cd | 460 | tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT); |
598411d7 JPM |
461 | tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT); |
462 | *maddr = &n->links[tnl->bearer_id].maddr; | |
463 | *bearer_id = tnl->bearer_id; | |
464 | } | |
465 | ||
466 | static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete) | |
467 | { | |
468 | struct tipc_link_entry *le = &n->links[bearer_id]; | |
73f646ce | 469 | struct tipc_link *l = le->link; |
598411d7 JPM |
470 | struct tipc_media_addr *maddr; |
471 | struct sk_buff_head xmitq; | |
472 | ||
73f646ce JPM |
473 | if (!l) |
474 | return; | |
475 | ||
598411d7 JPM |
476 | __skb_queue_head_init(&xmitq); |
477 | ||
478 | tipc_node_lock(n); | |
73f646ce JPM |
479 | if (!tipc_link_is_establishing(l)) { |
480 | __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr); | |
481 | if (delete) { | |
482 | kfree(l); | |
483 | le->link = NULL; | |
484 | n->link_cnt--; | |
485 | } | |
486 | } else { | |
487 | /* Defuse pending tipc_node_link_up() */ | |
488 | tipc_link_fsm_evt(l, LINK_RESET_EVT); | |
598411d7 JPM |
489 | } |
490 | tipc_node_unlock(n); | |
598411d7 JPM |
491 | tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr); |
492 | tipc_sk_rcv(n->net, &le->inputq); | |
b97bf3fd PL |
493 | } |
494 | ||
9d13ec65 | 495 | bool tipc_node_is_up(struct tipc_node *n) |
b97bf3fd | 496 | { |
36e78a46 | 497 | return n->active_links[0] != INVALID_BEARER_ID; |
b97bf3fd PL |
498 | } |
499 | ||
cf148816 JPM |
500 | void tipc_node_check_dest(struct net *net, u32 onode, |
501 | struct tipc_bearer *b, | |
502 | u16 capabilities, u32 signature, | |
503 | struct tipc_media_addr *maddr, | |
504 | bool *respond, bool *dupl_addr) | |
d3a43b90 | 505 | { |
cf148816 JPM |
506 | struct tipc_node *n; |
507 | struct tipc_link *l; | |
440d8963 | 508 | struct tipc_link_entry *le; |
cf148816 JPM |
509 | bool addr_match = false; |
510 | bool sign_match = false; | |
511 | bool link_up = false; | |
512 | bool accept_addr = false; | |
598411d7 | 513 | bool reset = true; |
0e05498e | 514 | char *if_name; |
440d8963 | 515 | |
cf148816 JPM |
516 | *dupl_addr = false; |
517 | *respond = false; | |
518 | ||
519 | n = tipc_node_create(net, onode, capabilities); | |
520 | if (!n) | |
521 | return; | |
d3a43b90 | 522 | |
cf148816 JPM |
523 | tipc_node_lock(n); |
524 | ||
440d8963 | 525 | le = &n->links[b->identity]; |
cf148816 JPM |
526 | |
527 | /* Prepare to validate requesting node's signature and media address */ | |
440d8963 | 528 | l = le->link; |
cf148816 | 529 | link_up = l && tipc_link_is_up(l); |
440d8963 | 530 | addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr)); |
cf148816 JPM |
531 | sign_match = (signature == n->signature); |
532 | ||
533 | /* These three flags give us eight permutations: */ | |
534 | ||
535 | if (sign_match && addr_match && link_up) { | |
536 | /* All is fine. Do nothing. */ | |
598411d7 | 537 | reset = false; |
cf148816 JPM |
538 | } else if (sign_match && addr_match && !link_up) { |
539 | /* Respond. The link will come up in due time */ | |
540 | *respond = true; | |
541 | } else if (sign_match && !addr_match && link_up) { | |
542 | /* Peer has changed i/f address without rebooting. | |
543 | * If so, the link will reset soon, and the next | |
544 | * discovery will be accepted. So we can ignore it. | |
545 | * It may also be an cloned or malicious peer having | |
546 | * chosen the same node address and signature as an | |
547 | * existing one. | |
548 | * Ignore requests until the link goes down, if ever. | |
549 | */ | |
550 | *dupl_addr = true; | |
551 | } else if (sign_match && !addr_match && !link_up) { | |
552 | /* Peer link has changed i/f address without rebooting. | |
553 | * It may also be a cloned or malicious peer; we can't | |
554 | * distinguish between the two. | |
555 | * The signature is correct, so we must accept. | |
556 | */ | |
557 | accept_addr = true; | |
558 | *respond = true; | |
559 | } else if (!sign_match && addr_match && link_up) { | |
560 | /* Peer node rebooted. Two possibilities: | |
561 | * - Delayed re-discovery; this link endpoint has already | |
562 | * reset and re-established contact with the peer, before | |
563 | * receiving a discovery message from that node. | |
564 | * (The peer happened to receive one from this node first). | |
565 | * - The peer came back so fast that our side has not | |
566 | * discovered it yet. Probing from this side will soon | |
567 | * reset the link, since there can be no working link | |
568 | * endpoint at the peer end, and the link will re-establish. | |
569 | * Accept the signature, since it comes from a known peer. | |
570 | */ | |
571 | n->signature = signature; | |
572 | } else if (!sign_match && addr_match && !link_up) { | |
573 | /* The peer node has rebooted. | |
574 | * Accept signature, since it is a known peer. | |
575 | */ | |
576 | n->signature = signature; | |
577 | *respond = true; | |
578 | } else if (!sign_match && !addr_match && link_up) { | |
579 | /* Peer rebooted with new address, or a new/duplicate peer. | |
580 | * Ignore until the link goes down, if ever. | |
581 | */ | |
582 | *dupl_addr = true; | |
583 | } else if (!sign_match && !addr_match && !link_up) { | |
584 | /* Peer rebooted with new address, or it is a new peer. | |
585 | * Accept signature and address. | |
586 | */ | |
587 | n->signature = signature; | |
588 | accept_addr = true; | |
589 | *respond = true; | |
590 | } | |
d3a43b90 | 591 | |
cf148816 JPM |
592 | if (!accept_addr) |
593 | goto exit; | |
d3a43b90 | 594 | |
cf148816 | 595 | /* Now create new link if not already existing */ |
8a1577c9 | 596 | if (!l) { |
440d8963 JPM |
597 | if (n->link_cnt == 2) { |
598 | pr_warn("Cannot establish 3rd link to %x\n", n->addr); | |
599 | goto exit; | |
600 | } | |
0e05498e JPM |
601 | if_name = strchr(b->name, ':') + 1; |
602 | if (!tipc_link_create(n, if_name, b->identity, b->tolerance, | |
603 | b->net_plane, b->mtu, b->priority, | |
604 | b->window, mod(tipc_net(net)->random), | |
fd556f20 | 605 | tipc_own_addr(net), onode, |
52666986 JPM |
606 | n->capabilities, &le->maddr, |
607 | tipc_bc_sndlink(n->net), n->bc_entry.link, | |
608 | &le->inputq, | |
609 | &n->bc_entry.namedq, &l)) { | |
cf148816 JPM |
610 | *respond = false; |
611 | goto exit; | |
612 | } | |
440d8963 | 613 | tipc_link_reset(l); |
c8199300 | 614 | tipc_link_fsm_evt(l, LINK_RESET_EVT); |
17b20630 JPM |
615 | if (n->state == NODE_FAILINGOVER) |
616 | tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT); | |
440d8963 JPM |
617 | le->link = l; |
618 | n->link_cnt++; | |
8a1577c9 | 619 | tipc_node_calculate_timer(n, l); |
cf148816 | 620 | if (n->link_cnt == 1) |
8a1577c9 JPM |
621 | if (!mod_timer(&n->timer, jiffies + n->keepalive_intv)) |
622 | tipc_node_get(n); | |
8a1577c9 | 623 | } |
440d8963 | 624 | memcpy(&le->maddr, maddr, sizeof(*maddr)); |
cf148816 JPM |
625 | exit: |
626 | tipc_node_unlock(n); | |
73f646ce | 627 | if (reset && !tipc_link_is_reset(l)) |
598411d7 | 628 | tipc_node_link_down(n, b->identity, false); |
cf148816 | 629 | tipc_node_put(n); |
d3a43b90 JPM |
630 | } |
631 | ||
6144a996 JPM |
632 | void tipc_node_delete_links(struct net *net, int bearer_id) |
633 | { | |
634 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
6144a996 JPM |
635 | struct tipc_node *n; |
636 | ||
637 | rcu_read_lock(); | |
638 | list_for_each_entry_rcu(n, &tn->node_list, list) { | |
598411d7 | 639 | tipc_node_link_down(n, bearer_id, true); |
6144a996 JPM |
640 | } |
641 | rcu_read_unlock(); | |
642 | } | |
643 | ||
644 | static void tipc_node_reset_links(struct tipc_node *n) | |
645 | { | |
646 | char addr_string[16]; | |
598411d7 | 647 | int i; |
6144a996 JPM |
648 | |
649 | pr_warn("Resetting all links to %s\n", | |
650 | tipc_addr_string_fill(addr_string, n->addr)); | |
651 | ||
652 | for (i = 0; i < MAX_BEARERS; i++) { | |
598411d7 | 653 | tipc_node_link_down(n, i, false); |
6144a996 | 654 | } |
6144a996 JPM |
655 | } |
656 | ||
1a20cc25 JPM |
657 | /* tipc_node_fsm_evt - node finite state machine |
658 | * Determines when contact is allowed with peer node | |
659 | */ | |
d999297c | 660 | static void tipc_node_fsm_evt(struct tipc_node *n, int evt) |
1a20cc25 JPM |
661 | { |
662 | int state = n->state; | |
663 | ||
664 | switch (state) { | |
665 | case SELF_DOWN_PEER_DOWN: | |
666 | switch (evt) { | |
667 | case SELF_ESTABL_CONTACT_EVT: | |
668 | state = SELF_UP_PEER_COMING; | |
669 | break; | |
670 | case PEER_ESTABL_CONTACT_EVT: | |
671 | state = SELF_COMING_PEER_UP; | |
672 | break; | |
673 | case SELF_LOST_CONTACT_EVT: | |
674 | case PEER_LOST_CONTACT_EVT: | |
675 | break; | |
66996b6c JPM |
676 | case NODE_SYNCH_END_EVT: |
677 | case NODE_SYNCH_BEGIN_EVT: | |
678 | case NODE_FAILOVER_BEGIN_EVT: | |
679 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 | 680 | default: |
66996b6c | 681 | goto illegal_evt; |
1a20cc25 JPM |
682 | } |
683 | break; | |
684 | case SELF_UP_PEER_UP: | |
685 | switch (evt) { | |
686 | case SELF_LOST_CONTACT_EVT: | |
687 | state = SELF_DOWN_PEER_LEAVING; | |
688 | break; | |
689 | case PEER_LOST_CONTACT_EVT: | |
690 | state = SELF_LEAVING_PEER_DOWN; | |
691 | break; | |
66996b6c JPM |
692 | case NODE_SYNCH_BEGIN_EVT: |
693 | state = NODE_SYNCHING; | |
694 | break; | |
695 | case NODE_FAILOVER_BEGIN_EVT: | |
696 | state = NODE_FAILINGOVER; | |
697 | break; | |
1a20cc25 JPM |
698 | case SELF_ESTABL_CONTACT_EVT: |
699 | case PEER_ESTABL_CONTACT_EVT: | |
66996b6c JPM |
700 | case NODE_SYNCH_END_EVT: |
701 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 JPM |
702 | break; |
703 | default: | |
66996b6c | 704 | goto illegal_evt; |
1a20cc25 JPM |
705 | } |
706 | break; | |
707 | case SELF_DOWN_PEER_LEAVING: | |
708 | switch (evt) { | |
709 | case PEER_LOST_CONTACT_EVT: | |
710 | state = SELF_DOWN_PEER_DOWN; | |
711 | break; | |
712 | case SELF_ESTABL_CONTACT_EVT: | |
713 | case PEER_ESTABL_CONTACT_EVT: | |
714 | case SELF_LOST_CONTACT_EVT: | |
715 | break; | |
66996b6c JPM |
716 | case NODE_SYNCH_END_EVT: |
717 | case NODE_SYNCH_BEGIN_EVT: | |
718 | case NODE_FAILOVER_BEGIN_EVT: | |
719 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 | 720 | default: |
66996b6c | 721 | goto illegal_evt; |
1a20cc25 JPM |
722 | } |
723 | break; | |
724 | case SELF_UP_PEER_COMING: | |
725 | switch (evt) { | |
726 | case PEER_ESTABL_CONTACT_EVT: | |
727 | state = SELF_UP_PEER_UP; | |
728 | break; | |
729 | case SELF_LOST_CONTACT_EVT: | |
730 | state = SELF_DOWN_PEER_LEAVING; | |
731 | break; | |
732 | case SELF_ESTABL_CONTACT_EVT: | |
733 | case PEER_LOST_CONTACT_EVT: | |
66996b6c | 734 | case NODE_SYNCH_END_EVT: |
66996b6c | 735 | case NODE_FAILOVER_BEGIN_EVT: |
73f646ce JPM |
736 | break; |
737 | case NODE_SYNCH_BEGIN_EVT: | |
66996b6c | 738 | case NODE_FAILOVER_END_EVT: |
1a20cc25 | 739 | default: |
66996b6c | 740 | goto illegal_evt; |
1a20cc25 JPM |
741 | } |
742 | break; | |
743 | case SELF_COMING_PEER_UP: | |
744 | switch (evt) { | |
745 | case SELF_ESTABL_CONTACT_EVT: | |
746 | state = SELF_UP_PEER_UP; | |
747 | break; | |
748 | case PEER_LOST_CONTACT_EVT: | |
749 | state = SELF_LEAVING_PEER_DOWN; | |
750 | break; | |
751 | case SELF_LOST_CONTACT_EVT: | |
752 | case PEER_ESTABL_CONTACT_EVT: | |
753 | break; | |
66996b6c JPM |
754 | case NODE_SYNCH_END_EVT: |
755 | case NODE_SYNCH_BEGIN_EVT: | |
756 | case NODE_FAILOVER_BEGIN_EVT: | |
757 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 | 758 | default: |
66996b6c | 759 | goto illegal_evt; |
1a20cc25 JPM |
760 | } |
761 | break; | |
762 | case SELF_LEAVING_PEER_DOWN: | |
763 | switch (evt) { | |
764 | case SELF_LOST_CONTACT_EVT: | |
765 | state = SELF_DOWN_PEER_DOWN; | |
766 | break; | |
767 | case SELF_ESTABL_CONTACT_EVT: | |
768 | case PEER_ESTABL_CONTACT_EVT: | |
769 | case PEER_LOST_CONTACT_EVT: | |
770 | break; | |
66996b6c JPM |
771 | case NODE_SYNCH_END_EVT: |
772 | case NODE_SYNCH_BEGIN_EVT: | |
773 | case NODE_FAILOVER_BEGIN_EVT: | |
774 | case NODE_FAILOVER_END_EVT: | |
775 | default: | |
776 | goto illegal_evt; | |
777 | } | |
778 | break; | |
779 | case NODE_FAILINGOVER: | |
780 | switch (evt) { | |
781 | case SELF_LOST_CONTACT_EVT: | |
782 | state = SELF_DOWN_PEER_LEAVING; | |
783 | break; | |
784 | case PEER_LOST_CONTACT_EVT: | |
785 | state = SELF_LEAVING_PEER_DOWN; | |
786 | break; | |
787 | case NODE_FAILOVER_END_EVT: | |
788 | state = SELF_UP_PEER_UP; | |
789 | break; | |
790 | case NODE_FAILOVER_BEGIN_EVT: | |
791 | case SELF_ESTABL_CONTACT_EVT: | |
792 | case PEER_ESTABL_CONTACT_EVT: | |
793 | break; | |
794 | case NODE_SYNCH_BEGIN_EVT: | |
795 | case NODE_SYNCH_END_EVT: | |
1a20cc25 | 796 | default: |
66996b6c JPM |
797 | goto illegal_evt; |
798 | } | |
799 | break; | |
800 | case NODE_SYNCHING: | |
801 | switch (evt) { | |
802 | case SELF_LOST_CONTACT_EVT: | |
803 | state = SELF_DOWN_PEER_LEAVING; | |
804 | break; | |
805 | case PEER_LOST_CONTACT_EVT: | |
806 | state = SELF_LEAVING_PEER_DOWN; | |
807 | break; | |
808 | case NODE_SYNCH_END_EVT: | |
809 | state = SELF_UP_PEER_UP; | |
810 | break; | |
811 | case NODE_FAILOVER_BEGIN_EVT: | |
812 | state = NODE_FAILINGOVER; | |
813 | break; | |
814 | case NODE_SYNCH_BEGIN_EVT: | |
815 | case SELF_ESTABL_CONTACT_EVT: | |
816 | case PEER_ESTABL_CONTACT_EVT: | |
817 | break; | |
818 | case NODE_FAILOVER_END_EVT: | |
819 | default: | |
820 | goto illegal_evt; | |
1a20cc25 JPM |
821 | } |
822 | break; | |
823 | default: | |
824 | pr_err("Unknown node fsm state %x\n", state); | |
825 | break; | |
826 | } | |
1a20cc25 | 827 | n->state = state; |
66996b6c JPM |
828 | return; |
829 | ||
830 | illegal_evt: | |
831 | pr_err("Illegal node fsm evt %x in state %x\n", evt, state); | |
1a20cc25 JPM |
832 | } |
833 | ||
6e498158 | 834 | bool tipc_node_filter_pkt(struct tipc_node *n, struct tipc_msg *hdr) |
1a20cc25 JPM |
835 | { |
836 | int state = n->state; | |
837 | ||
838 | if (likely(state == SELF_UP_PEER_UP)) | |
839 | return true; | |
d999297c | 840 | |
1a20cc25 JPM |
841 | if (state == SELF_LEAVING_PEER_DOWN) |
842 | return false; | |
d999297c JPM |
843 | |
844 | if (state == SELF_DOWN_PEER_LEAVING) { | |
6e498158 | 845 | if (msg_peer_node_is_up(hdr)) |
d999297c | 846 | return false; |
d999297c | 847 | } |
6e498158 JPM |
848 | |
849 | return true; | |
1a20cc25 JPM |
850 | } |
851 | ||
52666986 | 852 | static void node_lost_contact(struct tipc_node *n, |
598411d7 | 853 | struct sk_buff_head *inputq) |
b97bf3fd | 854 | { |
b97bf3fd | 855 | char addr_string[16]; |
708ac32c | 856 | struct tipc_sock_conn *conn, *safe; |
598411d7 | 857 | struct tipc_link *l; |
52666986 | 858 | struct list_head *conns = &n->conn_sks; |
708ac32c | 859 | struct sk_buff *skb; |
708ac32c | 860 | uint i; |
b97bf3fd | 861 | |
3fa9cacd | 862 | pr_debug("Lost contact with %s\n", |
52666986 | 863 | tipc_addr_string_fill(addr_string, n->addr)); |
c5bd4d85 | 864 | |
52666986 | 865 | /* Clean up broadcast state */ |
b06b281e | 866 | tipc_bcast_remove_peer(n->net, n->bc_entry.link); |
b97bf3fd | 867 | |
dff29b1a | 868 | /* Abort any ongoing link failover */ |
b97bf3fd | 869 | for (i = 0; i < MAX_BEARERS; i++) { |
52666986 | 870 | l = n->links[i].link; |
598411d7 JPM |
871 | if (l) |
872 | tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT); | |
b97bf3fd | 873 | } |
598411d7 | 874 | |
708ac32c | 875 | /* Notify publications from this node */ |
52666986 | 876 | n->action_flags |= TIPC_NOTIFY_NODE_DOWN; |
708ac32c JPM |
877 | |
878 | /* Notify sockets connected to node */ | |
879 | list_for_each_entry_safe(conn, safe, conns, list) { | |
880 | skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG, | |
52666986 | 881 | SHORT_H_SIZE, 0, tipc_own_addr(n->net), |
708ac32c JPM |
882 | conn->peer_node, conn->port, |
883 | conn->peer_port, TIPC_ERR_NO_NODE); | |
23d8335d | 884 | if (likely(skb)) |
598411d7 | 885 | skb_queue_tail(inputq, skb); |
708ac32c JPM |
886 | list_del(&conn->list); |
887 | kfree(conn); | |
888 | } | |
b97bf3fd PL |
889 | } |
890 | ||
78acb1f9 EH |
891 | /** |
892 | * tipc_node_get_linkname - get the name of a link | |
893 | * | |
894 | * @bearer_id: id of the bearer | |
895 | * @node: peer node address | |
896 | * @linkname: link name output buffer | |
897 | * | |
898 | * Returns 0 on success | |
899 | */ | |
f2f9800d YX |
900 | int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr, |
901 | char *linkname, size_t len) | |
78acb1f9 EH |
902 | { |
903 | struct tipc_link *link; | |
8a0f6ebe | 904 | int err = -EINVAL; |
f2f9800d | 905 | struct tipc_node *node = tipc_node_find(net, addr); |
78acb1f9 | 906 | |
8a0f6ebe YX |
907 | if (!node) |
908 | return err; | |
909 | ||
910 | if (bearer_id >= MAX_BEARERS) | |
911 | goto exit; | |
912 | ||
78acb1f9 | 913 | tipc_node_lock(node); |
9d13ec65 | 914 | link = node->links[bearer_id].link; |
78acb1f9 EH |
915 | if (link) { |
916 | strncpy(linkname, link->name, len); | |
8a0f6ebe | 917 | err = 0; |
78acb1f9 | 918 | } |
8a0f6ebe | 919 | exit: |
78acb1f9 | 920 | tipc_node_unlock(node); |
8a0f6ebe YX |
921 | tipc_node_put(node); |
922 | return err; | |
78acb1f9 | 923 | } |
9db9fdd1 YX |
924 | |
925 | void tipc_node_unlock(struct tipc_node *node) | |
926 | { | |
f2f9800d | 927 | struct net *net = node->net; |
ca0c4273 | 928 | u32 addr = 0; |
c637c103 | 929 | u32 flags = node->action_flags; |
7b8613e0 | 930 | u32 link_id = 0; |
708ac32c | 931 | struct list_head *publ_list; |
9db9fdd1 | 932 | |
23d8335d | 933 | if (likely(!flags)) { |
9db9fdd1 YX |
934 | spin_unlock_bh(&node->lock); |
935 | return; | |
936 | } | |
937 | ||
7b8613e0 YX |
938 | addr = node->addr; |
939 | link_id = node->link_id; | |
708ac32c | 940 | publ_list = &node->publ_list; |
7b8613e0 | 941 | |
23d8335d | 942 | node->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP | |
cb1b7280 JPM |
943 | TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP | |
944 | TIPC_WAKEUP_BCAST_USERS | TIPC_BCAST_MSG_EVT | | |
23d8335d | 945 | TIPC_BCAST_RESET); |
7b8613e0 | 946 | |
9db9fdd1 YX |
947 | spin_unlock_bh(&node->lock); |
948 | ||
708ac32c JPM |
949 | if (flags & TIPC_NOTIFY_NODE_DOWN) |
950 | tipc_publ_notify(net, publ_list, addr); | |
50100a5e | 951 | |
908344cd | 952 | if (flags & TIPC_WAKEUP_BCAST_USERS) |
f2f9800d | 953 | tipc_bclink_wakeup_users(net); |
908344cd | 954 | |
7b8613e0 | 955 | if (flags & TIPC_NOTIFY_NODE_UP) |
f2f9800d | 956 | tipc_named_node_up(net, addr); |
7b8613e0 YX |
957 | |
958 | if (flags & TIPC_NOTIFY_LINK_UP) | |
f2f9800d | 959 | tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr, |
7b8613e0 YX |
960 | TIPC_NODE_SCOPE, link_id, addr); |
961 | ||
962 | if (flags & TIPC_NOTIFY_LINK_DOWN) | |
f2f9800d | 963 | tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr, |
7b8613e0 | 964 | link_id, addr); |
c637c103 | 965 | |
cb1b7280 JPM |
966 | if (flags & TIPC_BCAST_MSG_EVT) |
967 | tipc_bclink_input(net); | |
b952b2be YX |
968 | |
969 | if (flags & TIPC_BCAST_RESET) | |
6144a996 | 970 | tipc_node_reset_links(node); |
9db9fdd1 | 971 | } |
3e4b6ab5 RA |
972 | |
973 | /* Caller should hold node lock for the passed node */ | |
d8182804 | 974 | static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node) |
3e4b6ab5 RA |
975 | { |
976 | void *hdr; | |
977 | struct nlattr *attrs; | |
978 | ||
bfb3e5dd | 979 | hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family, |
3e4b6ab5 RA |
980 | NLM_F_MULTI, TIPC_NL_NODE_GET); |
981 | if (!hdr) | |
982 | return -EMSGSIZE; | |
983 | ||
984 | attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE); | |
985 | if (!attrs) | |
986 | goto msg_full; | |
987 | ||
988 | if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr)) | |
989 | goto attr_msg_full; | |
990 | if (tipc_node_is_up(node)) | |
991 | if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP)) | |
992 | goto attr_msg_full; | |
993 | ||
994 | nla_nest_end(msg->skb, attrs); | |
995 | genlmsg_end(msg->skb, hdr); | |
996 | ||
997 | return 0; | |
998 | ||
999 | attr_msg_full: | |
1000 | nla_nest_cancel(msg->skb, attrs); | |
1001 | msg_full: | |
1002 | genlmsg_cancel(msg->skb, hdr); | |
1003 | ||
1004 | return -EMSGSIZE; | |
1005 | } | |
1006 | ||
af9b028e JPM |
1007 | static struct tipc_link *tipc_node_select_link(struct tipc_node *n, int sel, |
1008 | int *bearer_id, | |
1009 | struct tipc_media_addr **maddr) | |
1010 | { | |
1011 | int id = n->active_links[sel & 1]; | |
1012 | ||
1013 | if (unlikely(id < 0)) | |
1014 | return NULL; | |
1015 | ||
1016 | *bearer_id = id; | |
1017 | *maddr = &n->links[id].maddr; | |
1018 | return n->links[id].link; | |
1019 | } | |
1020 | ||
1021 | /** | |
1022 | * tipc_node_xmit() is the general link level function for message sending | |
1023 | * @net: the applicable net namespace | |
1024 | * @list: chain of buffers containing message | |
1025 | * @dnode: address of destination node | |
1026 | * @selector: a number used for deterministic link selection | |
1027 | * Consumes the buffer chain, except when returning -ELINKCONG | |
1028 | * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE | |
1029 | */ | |
1030 | int tipc_node_xmit(struct net *net, struct sk_buff_head *list, | |
1031 | u32 dnode, int selector) | |
1032 | { | |
1033 | struct tipc_link *l = NULL; | |
1034 | struct tipc_node *n; | |
1035 | struct sk_buff_head xmitq; | |
1036 | struct tipc_media_addr *maddr; | |
1037 | int bearer_id; | |
1038 | int rc = -EHOSTUNREACH; | |
1039 | ||
1040 | __skb_queue_head_init(&xmitq); | |
1041 | n = tipc_node_find(net, dnode); | |
1042 | if (likely(n)) { | |
1043 | tipc_node_lock(n); | |
1044 | l = tipc_node_select_link(n, selector, &bearer_id, &maddr); | |
1045 | if (likely(l)) | |
1046 | rc = tipc_link_xmit(l, list, &xmitq); | |
af9b028e | 1047 | tipc_node_unlock(n); |
598411d7 JPM |
1048 | if (unlikely(rc == -ENOBUFS)) |
1049 | tipc_node_link_down(n, bearer_id, false); | |
af9b028e JPM |
1050 | tipc_node_put(n); |
1051 | } | |
1052 | if (likely(!rc)) { | |
1053 | tipc_bearer_xmit(net, bearer_id, &xmitq, maddr); | |
1054 | return 0; | |
1055 | } | |
1056 | if (likely(in_own_node(net, dnode))) { | |
1057 | tipc_sk_rcv(net, list); | |
1058 | return 0; | |
1059 | } | |
1060 | return rc; | |
1061 | } | |
1062 | ||
1063 | /* tipc_node_xmit_skb(): send single buffer to destination | |
1064 | * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE | |
1065 | * messages, which will not be rejected | |
1066 | * The only exception is datagram messages rerouted after secondary | |
1067 | * lookup, which are rare and safe to dispose of anyway. | |
1068 | * TODO: Return real return value, and let callers use | |
1069 | * tipc_wait_for_sendpkt() where applicable | |
1070 | */ | |
1071 | int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode, | |
1072 | u32 selector) | |
1073 | { | |
1074 | struct sk_buff_head head; | |
1075 | int rc; | |
1076 | ||
1077 | skb_queue_head_init(&head); | |
1078 | __skb_queue_tail(&head, skb); | |
1079 | rc = tipc_node_xmit(net, &head, dnode, selector); | |
1080 | if (rc == -ELINKCONG) | |
1081 | kfree_skb(skb); | |
1082 | return 0; | |
1083 | } | |
1084 | ||
52666986 JPM |
1085 | /** |
1086 | * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node | |
1087 | * @net: the applicable net namespace | |
1088 | * @skb: TIPC packet | |
1089 | * @bearer_id: id of bearer message arrived on | |
1090 | * | |
1091 | * Invoked with no locks held. | |
1092 | */ | |
1093 | void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id) | |
1094 | { | |
1095 | int rc; | |
1096 | struct sk_buff_head xmitq; | |
1097 | struct tipc_bclink_entry *be; | |
1098 | struct tipc_link_entry *le; | |
1099 | struct tipc_msg *hdr = buf_msg(skb); | |
1100 | int usr = msg_user(hdr); | |
1101 | u32 dnode = msg_destnode(hdr); | |
1102 | struct tipc_node *n; | |
1103 | ||
1104 | __skb_queue_head_init(&xmitq); | |
1105 | ||
1106 | /* If NACK for other node, let rcv link for that node peek into it */ | |
1107 | if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net))) | |
1108 | n = tipc_node_find(net, dnode); | |
1109 | else | |
1110 | n = tipc_node_find(net, msg_prevnode(hdr)); | |
1111 | if (!n) { | |
1112 | kfree_skb(skb); | |
1113 | return; | |
1114 | } | |
1115 | be = &n->bc_entry; | |
1116 | le = &n->links[bearer_id]; | |
1117 | ||
1118 | rc = tipc_bcast_rcv(net, be->link, skb); | |
1119 | ||
1120 | /* Broadcast link reset may happen at reassembly failure */ | |
1121 | if (rc & TIPC_LINK_DOWN_EVT) | |
1122 | tipc_node_reset_links(n); | |
1123 | ||
1124 | /* Broadcast ACKs are sent on a unicast link */ | |
1125 | if (rc & TIPC_LINK_SND_BC_ACK) { | |
1126 | tipc_node_lock(n); | |
1127 | tipc_link_build_ack_msg(le->link, &xmitq); | |
1128 | tipc_node_unlock(n); | |
1129 | } | |
1130 | ||
1131 | if (!skb_queue_empty(&xmitq)) | |
1132 | tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr); | |
1133 | ||
1134 | /* Deliver. 'arrvq' is under inputq2's lock protection */ | |
1135 | if (!skb_queue_empty(&be->inputq1)) { | |
1136 | spin_lock_bh(&be->inputq2.lock); | |
1137 | spin_lock_bh(&be->inputq1.lock); | |
1138 | skb_queue_splice_tail_init(&be->inputq1, &be->arrvq); | |
1139 | spin_unlock_bh(&be->inputq1.lock); | |
1140 | spin_unlock_bh(&be->inputq2.lock); | |
1141 | tipc_sk_mcast_rcv(net, &be->arrvq, &be->inputq2); | |
1142 | } | |
1143 | tipc_node_put(n); | |
1144 | } | |
1145 | ||
6e498158 JPM |
1146 | /** |
1147 | * tipc_node_check_state - check and if necessary update node state | |
1148 | * @skb: TIPC packet | |
1149 | * @bearer_id: identity of bearer delivering the packet | |
1150 | * Returns true if state is ok, otherwise consumes buffer and returns false | |
6144a996 | 1151 | */ |
6e498158 | 1152 | static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb, |
662921cd | 1153 | int bearer_id, struct sk_buff_head *xmitq) |
6144a996 | 1154 | { |
6144a996 | 1155 | struct tipc_msg *hdr = buf_msg(skb); |
6e498158 JPM |
1156 | int usr = msg_user(hdr); |
1157 | int mtyp = msg_type(hdr); | |
6144a996 | 1158 | u16 oseqno = msg_seqno(hdr); |
6e498158 JPM |
1159 | u16 iseqno = msg_seqno(msg_get_wrapped(hdr)); |
1160 | u16 exp_pkts = msg_msgcnt(hdr); | |
1161 | u16 rcv_nxt, syncpt, dlv_nxt; | |
1162 | int state = n->state; | |
2be80c2d | 1163 | struct tipc_link *l, *tnl, *pl = NULL; |
598411d7 JPM |
1164 | struct tipc_media_addr *maddr; |
1165 | int i, pb_id; | |
6144a996 | 1166 | |
6e498158 JPM |
1167 | l = n->links[bearer_id].link; |
1168 | if (!l) | |
1169 | return false; | |
1170 | rcv_nxt = l->rcv_nxt; | |
6144a996 | 1171 | |
6144a996 | 1172 | |
6e498158 JPM |
1173 | if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) |
1174 | return true; | |
6144a996 | 1175 | |
6e498158 JPM |
1176 | /* Find parallel link, if any */ |
1177 | for (i = 0; i < MAX_BEARERS; i++) { | |
1178 | if ((i != bearer_id) && n->links[i].link) { | |
1179 | pl = n->links[i].link; | |
1180 | break; | |
1181 | } | |
1182 | } | |
6144a996 | 1183 | |
6e498158 JPM |
1184 | /* Update node accesibility if applicable */ |
1185 | if (state == SELF_UP_PEER_COMING) { | |
1186 | if (!tipc_link_is_up(l)) | |
1187 | return true; | |
1188 | if (!msg_peer_link_is_up(hdr)) | |
1189 | return true; | |
1190 | tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT); | |
1191 | } | |
1192 | ||
1193 | if (state == SELF_DOWN_PEER_LEAVING) { | |
1194 | if (msg_peer_node_is_up(hdr)) | |
1195 | return false; | |
1196 | tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT); | |
1197 | } | |
1198 | ||
1199 | /* Ignore duplicate packets */ | |
0f8b8e28 | 1200 | if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt)) |
6e498158 JPM |
1201 | return true; |
1202 | ||
1203 | /* Initiate or update failover mode if applicable */ | |
1204 | if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) { | |
1205 | syncpt = oseqno + exp_pkts - 1; | |
598411d7 JPM |
1206 | if (pl && tipc_link_is_up(pl)) { |
1207 | pb_id = pl->bearer_id; | |
1208 | __tipc_node_link_down(n, &pb_id, xmitq, &maddr); | |
1209 | tipc_skb_queue_splice_tail_init(pl->inputq, l->inputq); | |
1210 | } | |
6e498158 JPM |
1211 | /* If pkts arrive out of order, use lowest calculated syncpt */ |
1212 | if (less(syncpt, n->sync_point)) | |
1213 | n->sync_point = syncpt; | |
1214 | } | |
1215 | ||
1216 | /* Open parallel link when tunnel link reaches synch point */ | |
17b20630 | 1217 | if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) { |
662921cd JPM |
1218 | if (!more(rcv_nxt, n->sync_point)) |
1219 | return true; | |
6e498158 JPM |
1220 | tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT); |
1221 | if (pl) | |
662921cd | 1222 | tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT); |
6e498158 JPM |
1223 | return true; |
1224 | } | |
1225 | ||
5ae2f8e6 JPM |
1226 | /* No synching needed if only one link */ |
1227 | if (!pl || !tipc_link_is_up(pl)) | |
1228 | return true; | |
1229 | ||
0f8b8e28 JPM |
1230 | /* Initiate synch mode if applicable */ |
1231 | if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) { | |
6e498158 | 1232 | syncpt = iseqno + exp_pkts - 1; |
662921cd JPM |
1233 | if (!tipc_link_is_up(l)) { |
1234 | tipc_link_fsm_evt(l, LINK_ESTABLISH_EVT); | |
598411d7 | 1235 | __tipc_node_link_up(n, bearer_id, xmitq); |
662921cd | 1236 | } |
6e498158 JPM |
1237 | if (n->state == SELF_UP_PEER_UP) { |
1238 | n->sync_point = syncpt; | |
662921cd | 1239 | tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT); |
6e498158 JPM |
1240 | tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT); |
1241 | } | |
6e498158 JPM |
1242 | if (less(syncpt, n->sync_point)) |
1243 | n->sync_point = syncpt; | |
6144a996 | 1244 | } |
6e498158 JPM |
1245 | |
1246 | /* Open tunnel link when parallel link reaches synch point */ | |
662921cd | 1247 | if ((n->state == NODE_SYNCHING) && tipc_link_is_synching(l)) { |
2be80c2d JPM |
1248 | if (tipc_link_is_synching(l)) { |
1249 | tnl = l; | |
1250 | } else { | |
1251 | tnl = pl; | |
1252 | pl = l; | |
1253 | } | |
5ae2f8e6 JPM |
1254 | dlv_nxt = pl->rcv_nxt - mod(skb_queue_len(pl->inputq)); |
1255 | if (more(dlv_nxt, n->sync_point)) { | |
2be80c2d | 1256 | tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT); |
6e498158 | 1257 | tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT); |
6e498158 JPM |
1258 | return true; |
1259 | } | |
2be80c2d JPM |
1260 | if (l == pl) |
1261 | return true; | |
6e498158 JPM |
1262 | if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG)) |
1263 | return true; | |
1264 | if (usr == LINK_PROTOCOL) | |
1265 | return true; | |
1266 | return false; | |
1267 | } | |
1268 | return true; | |
6144a996 JPM |
1269 | } |
1270 | ||
d999297c JPM |
1271 | /** |
1272 | * tipc_rcv - process TIPC packets/messages arriving from off-node | |
1273 | * @net: the applicable net namespace | |
1274 | * @skb: TIPC packet | |
1275 | * @bearer: pointer to bearer message arrived on | |
1276 | * | |
1277 | * Invoked with no locks held. Bearer pointer must point to a valid bearer | |
1278 | * structure (i.e. cannot be NULL), but bearer can be inactive. | |
1279 | */ | |
1280 | void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b) | |
1281 | { | |
1282 | struct sk_buff_head xmitq; | |
1283 | struct tipc_node *n; | |
6e498158 JPM |
1284 | struct tipc_msg *hdr = buf_msg(skb); |
1285 | int usr = msg_user(hdr); | |
d999297c | 1286 | int bearer_id = b->identity; |
6e498158 | 1287 | struct tipc_link_entry *le; |
52666986 | 1288 | u16 bc_ack = msg_bcast_ack(hdr); |
d999297c JPM |
1289 | int rc = 0; |
1290 | ||
1291 | __skb_queue_head_init(&xmitq); | |
1292 | ||
1293 | /* Ensure message is well-formed */ | |
1294 | if (unlikely(!tipc_msg_validate(skb))) | |
1295 | goto discard; | |
1296 | ||
52666986 | 1297 | /* Handle arrival of discovery or broadcast packet */ |
d999297c | 1298 | if (unlikely(msg_non_seq(hdr))) { |
52666986 JPM |
1299 | if (unlikely(usr == LINK_CONFIG)) |
1300 | return tipc_disc_rcv(net, skb, b); | |
d999297c | 1301 | else |
52666986 | 1302 | return tipc_node_bc_rcv(net, skb, bearer_id); |
d999297c JPM |
1303 | } |
1304 | ||
1305 | /* Locate neighboring node that sent packet */ | |
1306 | n = tipc_node_find(net, msg_prevnode(hdr)); | |
1307 | if (unlikely(!n)) | |
1308 | goto discard; | |
6e498158 | 1309 | le = &n->links[bearer_id]; |
d999297c | 1310 | |
52666986 JPM |
1311 | /* Ensure broadcast reception is in synch with peer's send state */ |
1312 | if (unlikely(usr == LINK_PROTOCOL)) | |
1313 | tipc_bcast_sync_rcv(net, n->bc_entry.link, hdr); | |
1314 | else if (unlikely(n->bc_entry.link->acked != bc_ack)) | |
1315 | tipc_bcast_ack_rcv(net, n->bc_entry.link, bc_ack); | |
1316 | ||
6e498158 | 1317 | tipc_node_lock(n); |
6144a996 | 1318 | |
6e498158 JPM |
1319 | /* Is reception permitted at the moment ? */ |
1320 | if (!tipc_node_filter_pkt(n, hdr)) | |
d999297c JPM |
1321 | goto unlock; |
1322 | ||
6e498158 | 1323 | /* Check and if necessary update node state */ |
662921cd | 1324 | if (likely(tipc_node_check_state(n, skb, bearer_id, &xmitq))) { |
6e498158 JPM |
1325 | rc = tipc_link_rcv(le->link, skb, &xmitq); |
1326 | skb = NULL; | |
1327 | } | |
598411d7 JPM |
1328 | unlock: |
1329 | tipc_node_unlock(n); | |
d999297c JPM |
1330 | |
1331 | if (unlikely(rc & TIPC_LINK_UP_EVT)) | |
6e498158 JPM |
1332 | tipc_node_link_up(n, bearer_id, &xmitq); |
1333 | ||
d999297c | 1334 | if (unlikely(rc & TIPC_LINK_DOWN_EVT)) |
598411d7 | 1335 | tipc_node_link_down(n, bearer_id, false); |
6e498158 | 1336 | |
52666986 JPM |
1337 | if (unlikely(!skb_queue_empty(&n->bc_entry.namedq))) |
1338 | tipc_named_rcv(net, &n->bc_entry.namedq); | |
23d8335d | 1339 | |
6e498158 JPM |
1340 | if (!skb_queue_empty(&le->inputq)) |
1341 | tipc_sk_rcv(net, &le->inputq); | |
1342 | ||
1343 | if (!skb_queue_empty(&xmitq)) | |
1344 | tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr); | |
1345 | ||
d999297c JPM |
1346 | tipc_node_put(n); |
1347 | discard: | |
1348 | kfree_skb(skb); | |
1349 | } | |
1350 | ||
3e4b6ab5 RA |
1351 | int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb) |
1352 | { | |
1353 | int err; | |
f2f9800d YX |
1354 | struct net *net = sock_net(skb->sk); |
1355 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
3e4b6ab5 RA |
1356 | int done = cb->args[0]; |
1357 | int last_addr = cb->args[1]; | |
1358 | struct tipc_node *node; | |
1359 | struct tipc_nl_msg msg; | |
1360 | ||
1361 | if (done) | |
1362 | return 0; | |
1363 | ||
1364 | msg.skb = skb; | |
1365 | msg.portid = NETLINK_CB(cb->skb).portid; | |
1366 | msg.seq = cb->nlh->nlmsg_seq; | |
1367 | ||
1368 | rcu_read_lock(); | |
8a0f6ebe YX |
1369 | if (last_addr) { |
1370 | node = tipc_node_find(net, last_addr); | |
1371 | if (!node) { | |
1372 | rcu_read_unlock(); | |
1373 | /* We never set seq or call nl_dump_check_consistent() | |
1374 | * this means that setting prev_seq here will cause the | |
1375 | * consistence check to fail in the netlink callback | |
1376 | * handler. Resulting in the NLMSG_DONE message having | |
1377 | * the NLM_F_DUMP_INTR flag set if the node state | |
1378 | * changed while we released the lock. | |
1379 | */ | |
1380 | cb->prev_seq = 1; | |
1381 | return -EPIPE; | |
1382 | } | |
1383 | tipc_node_put(node); | |
3e4b6ab5 RA |
1384 | } |
1385 | ||
f2f9800d | 1386 | list_for_each_entry_rcu(node, &tn->node_list, list) { |
3e4b6ab5 RA |
1387 | if (last_addr) { |
1388 | if (node->addr == last_addr) | |
1389 | last_addr = 0; | |
1390 | else | |
1391 | continue; | |
1392 | } | |
1393 | ||
1394 | tipc_node_lock(node); | |
1395 | err = __tipc_nl_add_node(&msg, node); | |
1396 | if (err) { | |
1397 | last_addr = node->addr; | |
1398 | tipc_node_unlock(node); | |
1399 | goto out; | |
1400 | } | |
1401 | ||
1402 | tipc_node_unlock(node); | |
1403 | } | |
1404 | done = 1; | |
1405 | out: | |
1406 | cb->args[0] = done; | |
1407 | cb->args[1] = last_addr; | |
1408 | rcu_read_unlock(); | |
1409 | ||
1410 | return skb->len; | |
1411 | } |