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" |
b97bf3fd | 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 | ||
69 | static void tipc_node_link_down(struct tipc_node *n, int bearer_id); | |
6c00055a DM |
70 | static void node_lost_contact(struct tipc_node *n_ptr); |
71 | static void node_established_contact(struct tipc_node *n_ptr); | |
8a0f6ebe | 72 | static void tipc_node_delete(struct tipc_node *node); |
8a1577c9 | 73 | static void tipc_node_timeout(unsigned long data); |
d999297c | 74 | static void tipc_node_fsm_evt(struct tipc_node *n, int evt); |
b97bf3fd | 75 | |
02be61a9 JPM |
76 | struct tipc_sock_conn { |
77 | u32 port; | |
78 | u32 peer_port; | |
79 | u32 peer_node; | |
80 | struct list_head list; | |
81 | }; | |
82 | ||
3e4b6ab5 RA |
83 | static const struct nla_policy tipc_nl_node_policy[TIPC_NLA_NODE_MAX + 1] = { |
84 | [TIPC_NLA_NODE_UNSPEC] = { .type = NLA_UNSPEC }, | |
85 | [TIPC_NLA_NODE_ADDR] = { .type = NLA_U32 }, | |
86 | [TIPC_NLA_NODE_UP] = { .type = NLA_FLAG } | |
87 | }; | |
88 | ||
a635b46b AS |
89 | /* |
90 | * A trivial power-of-two bitmask technique is used for speed, since this | |
91 | * operation is done for every incoming TIPC packet. The number of hash table | |
92 | * entries has been chosen so that no hash chain exceeds 8 nodes and will | |
93 | * usually be much smaller (typically only a single node). | |
94 | */ | |
872f24db | 95 | static unsigned int tipc_hashfn(u32 addr) |
a635b46b AS |
96 | { |
97 | return addr & (NODE_HTABLE_SIZE - 1); | |
98 | } | |
99 | ||
8a0f6ebe YX |
100 | static void tipc_node_kref_release(struct kref *kref) |
101 | { | |
102 | struct tipc_node *node = container_of(kref, struct tipc_node, kref); | |
103 | ||
104 | tipc_node_delete(node); | |
105 | } | |
106 | ||
107 | void tipc_node_put(struct tipc_node *node) | |
108 | { | |
109 | kref_put(&node->kref, tipc_node_kref_release); | |
110 | } | |
111 | ||
112 | static void tipc_node_get(struct tipc_node *node) | |
113 | { | |
114 | kref_get(&node->kref); | |
115 | } | |
116 | ||
1ec2bb08 | 117 | /* |
672d99e1 AS |
118 | * tipc_node_find - locate specified node object, if it exists |
119 | */ | |
f2f9800d | 120 | struct tipc_node *tipc_node_find(struct net *net, u32 addr) |
672d99e1 | 121 | { |
f2f9800d | 122 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
672d99e1 | 123 | struct tipc_node *node; |
672d99e1 | 124 | |
34747539 | 125 | if (unlikely(!in_own_cluster_exact(net, addr))) |
672d99e1 AS |
126 | return NULL; |
127 | ||
6c7a762e | 128 | rcu_read_lock(); |
f2f9800d YX |
129 | hlist_for_each_entry_rcu(node, &tn->node_htable[tipc_hashfn(addr)], |
130 | hash) { | |
46651c59 | 131 | if (node->addr == addr) { |
8a0f6ebe | 132 | tipc_node_get(node); |
6c7a762e | 133 | rcu_read_unlock(); |
672d99e1 | 134 | return node; |
46651c59 | 135 | } |
672d99e1 | 136 | } |
6c7a762e | 137 | rcu_read_unlock(); |
672d99e1 AS |
138 | return NULL; |
139 | } | |
140 | ||
f2f9800d | 141 | struct tipc_node *tipc_node_create(struct net *net, u32 addr) |
b97bf3fd | 142 | { |
f2f9800d | 143 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
672d99e1 | 144 | struct tipc_node *n_ptr, *temp_node; |
b97bf3fd | 145 | |
f2f9800d | 146 | spin_lock_bh(&tn->node_list_lock); |
b45db71b JPM |
147 | n_ptr = tipc_node_find(net, addr); |
148 | if (n_ptr) | |
149 | goto exit; | |
5af54792 | 150 | n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC); |
a10bd924 | 151 | if (!n_ptr) { |
2cf8aa19 | 152 | pr_warn("Node creation failed, no memory\n"); |
b45db71b | 153 | goto exit; |
a10bd924 | 154 | } |
a10bd924 | 155 | n_ptr->addr = addr; |
f2f9800d | 156 | n_ptr->net = net; |
8a0f6ebe | 157 | kref_init(&n_ptr->kref); |
51a8e4de | 158 | spin_lock_init(&n_ptr->lock); |
672d99e1 AS |
159 | INIT_HLIST_NODE(&n_ptr->hash); |
160 | INIT_LIST_HEAD(&n_ptr->list); | |
a8f48af5 | 161 | INIT_LIST_HEAD(&n_ptr->publ_list); |
02be61a9 | 162 | INIT_LIST_HEAD(&n_ptr->conn_sks); |
d39bbd44 | 163 | skb_queue_head_init(&n_ptr->bclink.namedq); |
05dcc5aa | 164 | __skb_queue_head_init(&n_ptr->bclink.deferdq); |
f2f9800d | 165 | hlist_add_head_rcu(&n_ptr->hash, &tn->node_htable[tipc_hashfn(addr)]); |
f2f9800d | 166 | list_for_each_entry_rcu(temp_node, &tn->node_list, list) { |
672d99e1 AS |
167 | if (n_ptr->addr < temp_node->addr) |
168 | break; | |
169 | } | |
6c7a762e | 170 | list_add_tail_rcu(&n_ptr->list, &temp_node->list); |
d999297c | 171 | n_ptr->state = SELF_DOWN_PEER_LEAVING; |
fc0eea69 | 172 | n_ptr->signature = INVALID_NODE_SIG; |
36e78a46 JPM |
173 | n_ptr->active_links[0] = INVALID_BEARER_ID; |
174 | n_ptr->active_links[1] = INVALID_BEARER_ID; | |
8a0f6ebe | 175 | tipc_node_get(n_ptr); |
8a1577c9 JPM |
176 | setup_timer(&n_ptr->timer, tipc_node_timeout, (unsigned long)n_ptr); |
177 | n_ptr->keepalive_intv = U32_MAX; | |
b45db71b | 178 | exit: |
f2f9800d | 179 | spin_unlock_bh(&tn->node_list_lock); |
b97bf3fd PL |
180 | return n_ptr; |
181 | } | |
182 | ||
8a1577c9 JPM |
183 | static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l) |
184 | { | |
185 | unsigned long tol = l->tolerance; | |
186 | unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4; | |
187 | unsigned long keepalive_intv = msecs_to_jiffies(intv); | |
188 | ||
189 | /* Link with lowest tolerance determines timer interval */ | |
190 | if (keepalive_intv < n->keepalive_intv) | |
191 | n->keepalive_intv = keepalive_intv; | |
192 | ||
193 | /* Ensure link's abort limit corresponds to current interval */ | |
194 | l->abort_limit = l->tolerance / jiffies_to_msecs(n->keepalive_intv); | |
195 | } | |
196 | ||
8a0f6ebe | 197 | static void tipc_node_delete(struct tipc_node *node) |
b97bf3fd | 198 | { |
8a0f6ebe YX |
199 | list_del_rcu(&node->list); |
200 | hlist_del_rcu(&node->hash); | |
201 | kfree_rcu(node, rcu); | |
b97bf3fd PL |
202 | } |
203 | ||
f2f9800d | 204 | void tipc_node_stop(struct net *net) |
46651c59 | 205 | { |
f2f9800d | 206 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
46651c59 YX |
207 | struct tipc_node *node, *t_node; |
208 | ||
f2f9800d | 209 | spin_lock_bh(&tn->node_list_lock); |
8a1577c9 JPM |
210 | list_for_each_entry_safe(node, t_node, &tn->node_list, list) { |
211 | if (del_timer(&node->timer)) | |
212 | tipc_node_put(node); | |
8a0f6ebe | 213 | tipc_node_put(node); |
8a1577c9 | 214 | } |
f2f9800d | 215 | spin_unlock_bh(&tn->node_list_lock); |
46651c59 YX |
216 | } |
217 | ||
f2f9800d | 218 | int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port) |
02be61a9 JPM |
219 | { |
220 | struct tipc_node *node; | |
221 | struct tipc_sock_conn *conn; | |
8a0f6ebe | 222 | int err = 0; |
02be61a9 | 223 | |
34747539 | 224 | if (in_own_node(net, dnode)) |
02be61a9 JPM |
225 | return 0; |
226 | ||
f2f9800d | 227 | node = tipc_node_find(net, dnode); |
02be61a9 JPM |
228 | if (!node) { |
229 | pr_warn("Connecting sock to node 0x%x failed\n", dnode); | |
230 | return -EHOSTUNREACH; | |
231 | } | |
232 | conn = kmalloc(sizeof(*conn), GFP_ATOMIC); | |
8a0f6ebe YX |
233 | if (!conn) { |
234 | err = -EHOSTUNREACH; | |
235 | goto exit; | |
236 | } | |
02be61a9 JPM |
237 | conn->peer_node = dnode; |
238 | conn->port = port; | |
239 | conn->peer_port = peer_port; | |
240 | ||
241 | tipc_node_lock(node); | |
242 | list_add_tail(&conn->list, &node->conn_sks); | |
243 | tipc_node_unlock(node); | |
8a0f6ebe YX |
244 | exit: |
245 | tipc_node_put(node); | |
246 | return err; | |
02be61a9 JPM |
247 | } |
248 | ||
f2f9800d | 249 | void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port) |
02be61a9 JPM |
250 | { |
251 | struct tipc_node *node; | |
252 | struct tipc_sock_conn *conn, *safe; | |
253 | ||
34747539 | 254 | if (in_own_node(net, dnode)) |
02be61a9 JPM |
255 | return; |
256 | ||
f2f9800d | 257 | node = tipc_node_find(net, dnode); |
02be61a9 JPM |
258 | if (!node) |
259 | return; | |
260 | ||
261 | tipc_node_lock(node); | |
262 | list_for_each_entry_safe(conn, safe, &node->conn_sks, list) { | |
263 | if (port != conn->port) | |
264 | continue; | |
265 | list_del(&conn->list); | |
266 | kfree(conn); | |
267 | } | |
268 | tipc_node_unlock(node); | |
8a0f6ebe | 269 | tipc_node_put(node); |
02be61a9 JPM |
270 | } |
271 | ||
8a1577c9 JPM |
272 | /* tipc_node_timeout - handle expiration of node timer |
273 | */ | |
274 | static void tipc_node_timeout(unsigned long data) | |
275 | { | |
276 | struct tipc_node *n = (struct tipc_node *)data; | |
277 | struct sk_buff_head xmitq; | |
278 | struct tipc_link *l; | |
279 | struct tipc_media_addr *maddr; | |
280 | int bearer_id; | |
281 | int rc = 0; | |
282 | ||
283 | __skb_queue_head_init(&xmitq); | |
284 | ||
285 | for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) { | |
286 | tipc_node_lock(n); | |
287 | l = n->links[bearer_id].link; | |
288 | if (l) { | |
289 | /* Link tolerance may change asynchronously: */ | |
290 | tipc_node_calculate_timer(n, l); | |
291 | rc = tipc_link_timeout(l, &xmitq); | |
292 | if (rc & TIPC_LINK_DOWN_EVT) | |
655fb243 | 293 | tipc_node_link_down(n, bearer_id); |
8a1577c9 JPM |
294 | } |
295 | tipc_node_unlock(n); | |
296 | maddr = &n->links[bearer_id].maddr; | |
297 | tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr); | |
298 | } | |
299 | if (!mod_timer(&n->timer, jiffies + n->keepalive_intv)) | |
300 | tipc_node_get(n); | |
301 | tipc_node_put(n); | |
302 | } | |
303 | ||
b97bf3fd | 304 | /** |
4323add6 | 305 | * tipc_node_link_up - handle addition of link |
c4307285 | 306 | * |
b97bf3fd PL |
307 | * Link becomes active (alone or shared) or standby, depending on its priority. |
308 | */ | |
6e498158 JPM |
309 | static void tipc_node_link_up(struct tipc_node *n, int bearer_id, |
310 | struct sk_buff_head *xmitq) | |
b97bf3fd | 311 | { |
36e78a46 JPM |
312 | int *slot0 = &n->active_links[0]; |
313 | int *slot1 = &n->active_links[1]; | |
6e498158 JPM |
314 | struct tipc_link *ol = node_active_link(n, 0); |
315 | struct tipc_link *nl = n->links[bearer_id].link; | |
9d13ec65 | 316 | |
6e498158 JPM |
317 | if (n->working_links > 1) { |
318 | pr_warn("Attempt to establish 3rd link to %x\n", n->addr); | |
319 | return; | |
320 | } | |
9d13ec65 JPM |
321 | n->working_links++; |
322 | n->action_flags |= TIPC_NOTIFY_LINK_UP; | |
6e498158 JPM |
323 | n->link_id = nl->peer_bearer_id << 16 | bearer_id; |
324 | ||
325 | /* Leave room for tunnel header when returning 'mtu' to users: */ | |
326 | n->links[bearer_id].mtu = nl->mtu - INT_H_SIZE; | |
7b8613e0 | 327 | |
cbeb83ca JPM |
328 | tipc_bearer_add_dest(n->net, bearer_id, n->addr); |
329 | ||
3fa9cacd | 330 | pr_debug("Established link <%s> on network plane %c\n", |
6e498158 | 331 | nl->name, nl->net_plane); |
c4307285 | 332 | |
6e498158 JPM |
333 | /* First link? => give it both slots */ |
334 | if (!ol) { | |
36e78a46 JPM |
335 | *slot0 = bearer_id; |
336 | *slot1 = bearer_id; | |
6e498158 | 337 | nl->exec_mode = TIPC_LINK_OPEN; |
5045f7b9 | 338 | tipc_link_build_bcast_sync_msg(nl, xmitq); |
9d13ec65 JPM |
339 | node_established_contact(n); |
340 | return; | |
b97bf3fd | 341 | } |
36e78a46 | 342 | |
6e498158 JPM |
343 | /* Second link => redistribute slots */ |
344 | if (nl->priority > ol->priority) { | |
345 | pr_debug("Old link <%s> becomes standby\n", ol->name); | |
36e78a46 | 346 | *slot0 = bearer_id; |
6e498158 JPM |
347 | *slot1 = bearer_id; |
348 | } else if (nl->priority == ol->priority) { | |
349 | *slot0 = bearer_id; | |
350 | } else { | |
351 | pr_debug("New link <%s> is standby\n", nl->name); | |
b97bf3fd | 352 | } |
b97bf3fd | 353 | |
6e498158 JPM |
354 | /* Prepare synchronization with first link */ |
355 | tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq); | |
b97bf3fd PL |
356 | } |
357 | ||
358 | /** | |
4323add6 | 359 | * tipc_node_link_down - handle loss of link |
b97bf3fd | 360 | */ |
6e498158 | 361 | static void tipc_node_link_down(struct tipc_node *n, int bearer_id) |
b97bf3fd | 362 | { |
36e78a46 JPM |
363 | int *slot0 = &n->active_links[0]; |
364 | int *slot1 = &n->active_links[1]; | |
6e498158 | 365 | struct tipc_media_addr *maddr = &n->links[bearer_id].maddr; |
36e78a46 | 366 | int i, highest = 0; |
6e498158 JPM |
367 | struct tipc_link *l, *_l, *tnl; |
368 | struct sk_buff_head xmitq; | |
b97bf3fd | 369 | |
36e78a46 | 370 | l = n->links[bearer_id].link; |
655fb243 JPM |
371 | if (!l || !tipc_link_is_up(l)) |
372 | return; | |
373 | ||
6e498158 JPM |
374 | __skb_queue_head_init(&xmitq); |
375 | ||
9d13ec65 JPM |
376 | n->working_links--; |
377 | n->action_flags |= TIPC_NOTIFY_LINK_DOWN; | |
6e498158 | 378 | n->link_id = l->peer_bearer_id << 16 | bearer_id; |
5392d646 | 379 | |
655fb243 JPM |
380 | tipc_bearer_remove_dest(n->net, l->bearer_id, n->addr); |
381 | ||
3fa9cacd | 382 | pr_debug("Lost link <%s> on network plane %c\n", |
9d13ec65 | 383 | l->name, l->net_plane); |
16e166b8 | 384 | |
36e78a46 JPM |
385 | /* Select new active link if any available */ |
386 | *slot0 = INVALID_BEARER_ID; | |
387 | *slot1 = INVALID_BEARER_ID; | |
388 | for (i = 0; i < MAX_BEARERS; i++) { | |
389 | _l = n->links[i].link; | |
390 | if (!_l || !tipc_link_is_up(_l)) | |
391 | continue; | |
655fb243 JPM |
392 | if (_l == l) |
393 | continue; | |
36e78a46 JPM |
394 | if (_l->priority < highest) |
395 | continue; | |
396 | if (_l->priority > highest) { | |
397 | highest = _l->priority; | |
398 | *slot0 = i; | |
399 | *slot1 = i; | |
400 | continue; | |
401 | } | |
402 | *slot1 = i; | |
403 | } | |
655fb243 | 404 | |
6e498158 JPM |
405 | if (!tipc_node_is_up(n)) { |
406 | tipc_link_reset(l); | |
407 | node_lost_contact(n); | |
408 | return; | |
409 | } | |
655fb243 | 410 | |
6e498158 JPM |
411 | /* There is still a working link => initiate failover */ |
412 | tnl = node_active_link(n, 0); | |
413 | tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT); | |
414 | n->sync_point = tnl->rcv_nxt + (U16_MAX / 2 - 1); | |
415 | tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, &xmitq); | |
655fb243 | 416 | tipc_link_reset(l); |
6e498158 | 417 | tipc_bearer_xmit(n->net, tnl->bearer_id, &xmitq, maddr); |
b97bf3fd PL |
418 | } |
419 | ||
9d13ec65 | 420 | bool tipc_node_is_up(struct tipc_node *n) |
b97bf3fd | 421 | { |
36e78a46 | 422 | return n->active_links[0] != INVALID_BEARER_ID; |
b97bf3fd PL |
423 | } |
424 | ||
d3a43b90 JPM |
425 | void tipc_node_check_dest(struct tipc_node *n, struct tipc_bearer *b, |
426 | bool *link_up, bool *addr_match, | |
427 | struct tipc_media_addr *maddr) | |
428 | { | |
429 | struct tipc_link *l = n->links[b->identity].link; | |
430 | struct tipc_media_addr *curr = &n->links[b->identity].maddr; | |
431 | ||
432 | *link_up = l && tipc_link_is_up(l); | |
433 | *addr_match = l && !memcmp(curr, maddr, sizeof(*maddr)); | |
434 | } | |
435 | ||
436 | bool tipc_node_update_dest(struct tipc_node *n, struct tipc_bearer *b, | |
437 | struct tipc_media_addr *maddr) | |
438 | { | |
439 | struct tipc_link *l = n->links[b->identity].link; | |
440 | struct tipc_media_addr *curr = &n->links[b->identity].maddr; | |
d39bbd44 | 441 | struct sk_buff_head *inputq = &n->links[b->identity].inputq; |
d3a43b90 | 442 | |
8a1577c9 | 443 | if (!l) { |
d39bbd44 | 444 | l = tipc_link_create(n, b, maddr, inputq, &n->bclink.namedq); |
8a1577c9 JPM |
445 | if (!l) |
446 | return false; | |
447 | tipc_node_calculate_timer(n, l); | |
448 | if (n->link_cnt == 1) { | |
449 | if (!mod_timer(&n->timer, jiffies + n->keepalive_intv)) | |
450 | tipc_node_get(n); | |
451 | } | |
452 | } | |
d3a43b90 JPM |
453 | memcpy(&l->media_addr, maddr, sizeof(*maddr)); |
454 | memcpy(curr, maddr, sizeof(*maddr)); | |
655fb243 | 455 | tipc_node_link_down(n, b->identity); |
d3a43b90 JPM |
456 | return true; |
457 | } | |
458 | ||
6144a996 JPM |
459 | void tipc_node_delete_links(struct net *net, int bearer_id) |
460 | { | |
461 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
462 | struct tipc_link *l; | |
463 | struct tipc_node *n; | |
464 | ||
465 | rcu_read_lock(); | |
466 | list_for_each_entry_rcu(n, &tn->node_list, list) { | |
467 | tipc_node_lock(n); | |
468 | l = n->links[bearer_id].link; | |
469 | if (l) { | |
655fb243 | 470 | tipc_node_link_down(n, bearer_id); |
6144a996 JPM |
471 | n->links[bearer_id].link = NULL; |
472 | n->link_cnt--; | |
473 | } | |
474 | tipc_node_unlock(n); | |
475 | kfree(l); | |
476 | } | |
477 | rcu_read_unlock(); | |
478 | } | |
479 | ||
480 | static void tipc_node_reset_links(struct tipc_node *n) | |
481 | { | |
482 | char addr_string[16]; | |
483 | u32 i; | |
484 | ||
485 | tipc_node_lock(n); | |
486 | ||
487 | pr_warn("Resetting all links to %s\n", | |
488 | tipc_addr_string_fill(addr_string, n->addr)); | |
489 | ||
490 | for (i = 0; i < MAX_BEARERS; i++) { | |
655fb243 JPM |
491 | if (!n->links[i].link) |
492 | continue; | |
493 | tipc_node_link_down(n, i); | |
6144a996 JPM |
494 | } |
495 | tipc_node_unlock(n); | |
496 | } | |
497 | ||
a18c4bc3 | 498 | void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 499 | { |
9d13ec65 | 500 | n_ptr->links[l_ptr->bearer_id].link = l_ptr; |
37b9c08a | 501 | n_ptr->link_cnt++; |
b97bf3fd PL |
502 | } |
503 | ||
a18c4bc3 | 504 | void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 505 | { |
7d33939f JPM |
506 | int i; |
507 | ||
508 | for (i = 0; i < MAX_BEARERS; i++) { | |
9d13ec65 | 509 | if (l_ptr != n_ptr->links[i].link) |
074bb43e | 510 | continue; |
9d13ec65 | 511 | n_ptr->links[i].link = NULL; |
074bb43e | 512 | n_ptr->link_cnt--; |
7d33939f | 513 | } |
b97bf3fd PL |
514 | } |
515 | ||
1a20cc25 JPM |
516 | /* tipc_node_fsm_evt - node finite state machine |
517 | * Determines when contact is allowed with peer node | |
518 | */ | |
d999297c | 519 | static void tipc_node_fsm_evt(struct tipc_node *n, int evt) |
1a20cc25 JPM |
520 | { |
521 | int state = n->state; | |
522 | ||
523 | switch (state) { | |
524 | case SELF_DOWN_PEER_DOWN: | |
525 | switch (evt) { | |
526 | case SELF_ESTABL_CONTACT_EVT: | |
527 | state = SELF_UP_PEER_COMING; | |
528 | break; | |
529 | case PEER_ESTABL_CONTACT_EVT: | |
530 | state = SELF_COMING_PEER_UP; | |
531 | break; | |
532 | case SELF_LOST_CONTACT_EVT: | |
533 | case PEER_LOST_CONTACT_EVT: | |
534 | break; | |
66996b6c JPM |
535 | case NODE_SYNCH_END_EVT: |
536 | case NODE_SYNCH_BEGIN_EVT: | |
537 | case NODE_FAILOVER_BEGIN_EVT: | |
538 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 | 539 | default: |
66996b6c | 540 | goto illegal_evt; |
1a20cc25 JPM |
541 | } |
542 | break; | |
543 | case SELF_UP_PEER_UP: | |
544 | switch (evt) { | |
545 | case SELF_LOST_CONTACT_EVT: | |
546 | state = SELF_DOWN_PEER_LEAVING; | |
547 | break; | |
548 | case PEER_LOST_CONTACT_EVT: | |
549 | state = SELF_LEAVING_PEER_DOWN; | |
550 | break; | |
66996b6c JPM |
551 | case NODE_SYNCH_BEGIN_EVT: |
552 | state = NODE_SYNCHING; | |
553 | break; | |
554 | case NODE_FAILOVER_BEGIN_EVT: | |
555 | state = NODE_FAILINGOVER; | |
556 | break; | |
1a20cc25 JPM |
557 | case SELF_ESTABL_CONTACT_EVT: |
558 | case PEER_ESTABL_CONTACT_EVT: | |
66996b6c JPM |
559 | case NODE_SYNCH_END_EVT: |
560 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 JPM |
561 | break; |
562 | default: | |
66996b6c | 563 | goto illegal_evt; |
1a20cc25 JPM |
564 | } |
565 | break; | |
566 | case SELF_DOWN_PEER_LEAVING: | |
567 | switch (evt) { | |
568 | case PEER_LOST_CONTACT_EVT: | |
569 | state = SELF_DOWN_PEER_DOWN; | |
570 | break; | |
571 | case SELF_ESTABL_CONTACT_EVT: | |
572 | case PEER_ESTABL_CONTACT_EVT: | |
573 | case SELF_LOST_CONTACT_EVT: | |
574 | break; | |
66996b6c JPM |
575 | case NODE_SYNCH_END_EVT: |
576 | case NODE_SYNCH_BEGIN_EVT: | |
577 | case NODE_FAILOVER_BEGIN_EVT: | |
578 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 | 579 | default: |
66996b6c | 580 | goto illegal_evt; |
1a20cc25 JPM |
581 | } |
582 | break; | |
583 | case SELF_UP_PEER_COMING: | |
584 | switch (evt) { | |
585 | case PEER_ESTABL_CONTACT_EVT: | |
586 | state = SELF_UP_PEER_UP; | |
587 | break; | |
588 | case SELF_LOST_CONTACT_EVT: | |
589 | state = SELF_DOWN_PEER_LEAVING; | |
590 | break; | |
591 | case SELF_ESTABL_CONTACT_EVT: | |
592 | case PEER_LOST_CONTACT_EVT: | |
593 | break; | |
66996b6c JPM |
594 | case NODE_SYNCH_END_EVT: |
595 | case NODE_SYNCH_BEGIN_EVT: | |
596 | case NODE_FAILOVER_BEGIN_EVT: | |
597 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 | 598 | default: |
66996b6c | 599 | goto illegal_evt; |
1a20cc25 JPM |
600 | } |
601 | break; | |
602 | case SELF_COMING_PEER_UP: | |
603 | switch (evt) { | |
604 | case SELF_ESTABL_CONTACT_EVT: | |
605 | state = SELF_UP_PEER_UP; | |
606 | break; | |
607 | case PEER_LOST_CONTACT_EVT: | |
608 | state = SELF_LEAVING_PEER_DOWN; | |
609 | break; | |
610 | case SELF_LOST_CONTACT_EVT: | |
611 | case PEER_ESTABL_CONTACT_EVT: | |
612 | break; | |
66996b6c JPM |
613 | case NODE_SYNCH_END_EVT: |
614 | case NODE_SYNCH_BEGIN_EVT: | |
615 | case NODE_FAILOVER_BEGIN_EVT: | |
616 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 | 617 | default: |
66996b6c | 618 | goto illegal_evt; |
1a20cc25 JPM |
619 | } |
620 | break; | |
621 | case SELF_LEAVING_PEER_DOWN: | |
622 | switch (evt) { | |
623 | case SELF_LOST_CONTACT_EVT: | |
624 | state = SELF_DOWN_PEER_DOWN; | |
625 | break; | |
626 | case SELF_ESTABL_CONTACT_EVT: | |
627 | case PEER_ESTABL_CONTACT_EVT: | |
628 | case PEER_LOST_CONTACT_EVT: | |
629 | break; | |
66996b6c JPM |
630 | case NODE_SYNCH_END_EVT: |
631 | case NODE_SYNCH_BEGIN_EVT: | |
632 | case NODE_FAILOVER_BEGIN_EVT: | |
633 | case NODE_FAILOVER_END_EVT: | |
634 | default: | |
635 | goto illegal_evt; | |
636 | } | |
637 | break; | |
638 | case NODE_FAILINGOVER: | |
639 | switch (evt) { | |
640 | case SELF_LOST_CONTACT_EVT: | |
641 | state = SELF_DOWN_PEER_LEAVING; | |
642 | break; | |
643 | case PEER_LOST_CONTACT_EVT: | |
644 | state = SELF_LEAVING_PEER_DOWN; | |
645 | break; | |
646 | case NODE_FAILOVER_END_EVT: | |
647 | state = SELF_UP_PEER_UP; | |
648 | break; | |
649 | case NODE_FAILOVER_BEGIN_EVT: | |
650 | case SELF_ESTABL_CONTACT_EVT: | |
651 | case PEER_ESTABL_CONTACT_EVT: | |
652 | break; | |
653 | case NODE_SYNCH_BEGIN_EVT: | |
654 | case NODE_SYNCH_END_EVT: | |
1a20cc25 | 655 | default: |
66996b6c JPM |
656 | goto illegal_evt; |
657 | } | |
658 | break; | |
659 | case NODE_SYNCHING: | |
660 | switch (evt) { | |
661 | case SELF_LOST_CONTACT_EVT: | |
662 | state = SELF_DOWN_PEER_LEAVING; | |
663 | break; | |
664 | case PEER_LOST_CONTACT_EVT: | |
665 | state = SELF_LEAVING_PEER_DOWN; | |
666 | break; | |
667 | case NODE_SYNCH_END_EVT: | |
668 | state = SELF_UP_PEER_UP; | |
669 | break; | |
670 | case NODE_FAILOVER_BEGIN_EVT: | |
671 | state = NODE_FAILINGOVER; | |
672 | break; | |
673 | case NODE_SYNCH_BEGIN_EVT: | |
674 | case SELF_ESTABL_CONTACT_EVT: | |
675 | case PEER_ESTABL_CONTACT_EVT: | |
676 | break; | |
677 | case NODE_FAILOVER_END_EVT: | |
678 | default: | |
679 | goto illegal_evt; | |
1a20cc25 JPM |
680 | } |
681 | break; | |
682 | default: | |
683 | pr_err("Unknown node fsm state %x\n", state); | |
684 | break; | |
685 | } | |
1a20cc25 | 686 | n->state = state; |
66996b6c JPM |
687 | return; |
688 | ||
689 | illegal_evt: | |
690 | pr_err("Illegal node fsm evt %x in state %x\n", evt, state); | |
1a20cc25 JPM |
691 | } |
692 | ||
6e498158 | 693 | bool tipc_node_filter_pkt(struct tipc_node *n, struct tipc_msg *hdr) |
1a20cc25 JPM |
694 | { |
695 | int state = n->state; | |
696 | ||
697 | if (likely(state == SELF_UP_PEER_UP)) | |
698 | return true; | |
d999297c | 699 | |
1a20cc25 JPM |
700 | if (state == SELF_LEAVING_PEER_DOWN) |
701 | return false; | |
d999297c JPM |
702 | |
703 | if (state == SELF_DOWN_PEER_LEAVING) { | |
6e498158 | 704 | if (msg_peer_node_is_up(hdr)) |
d999297c | 705 | return false; |
d999297c | 706 | } |
6e498158 JPM |
707 | |
708 | return true; | |
1a20cc25 JPM |
709 | } |
710 | ||
6c00055a | 711 | static void node_established_contact(struct tipc_node *n_ptr) |
b97bf3fd | 712 | { |
1a20cc25 | 713 | tipc_node_fsm_evt(n_ptr, SELF_ESTABL_CONTACT_EVT); |
aecb9bb8 | 714 | n_ptr->action_flags |= TIPC_NOTIFY_NODE_UP; |
c64f7a6a | 715 | n_ptr->bclink.oos_state = 0; |
1da46568 YX |
716 | n_ptr->bclink.acked = tipc_bclink_get_last_sent(n_ptr->net); |
717 | tipc_bclink_add_node(n_ptr->net, n_ptr->addr); | |
b97bf3fd PL |
718 | } |
719 | ||
6c00055a | 720 | static void node_lost_contact(struct tipc_node *n_ptr) |
b97bf3fd | 721 | { |
b97bf3fd | 722 | char addr_string[16]; |
708ac32c JPM |
723 | struct tipc_sock_conn *conn, *safe; |
724 | struct list_head *conns = &n_ptr->conn_sks; | |
725 | struct sk_buff *skb; | |
726 | struct tipc_net *tn = net_generic(n_ptr->net, tipc_net_id); | |
727 | uint i; | |
b97bf3fd | 728 | |
3fa9cacd EH |
729 | pr_debug("Lost contact with %s\n", |
730 | tipc_addr_string_fill(addr_string, n_ptr->addr)); | |
c5bd4d85 AS |
731 | |
732 | /* Flush broadcast link info associated with lost node */ | |
389dd9bc | 733 | if (n_ptr->bclink.recv_permitted) { |
05dcc5aa | 734 | __skb_queue_purge(&n_ptr->bclink.deferdq); |
c5bd4d85 | 735 | |
37e22164 JPM |
736 | if (n_ptr->bclink.reasm_buf) { |
737 | kfree_skb(n_ptr->bclink.reasm_buf); | |
738 | n_ptr->bclink.reasm_buf = NULL; | |
c5bd4d85 AS |
739 | } |
740 | ||
1da46568 | 741 | tipc_bclink_remove_node(n_ptr->net, n_ptr->addr); |
36559591 | 742 | tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ); |
b97bf3fd | 743 | |
389dd9bc | 744 | n_ptr->bclink.recv_permitted = false; |
c5bd4d85 | 745 | } |
b97bf3fd | 746 | |
dff29b1a | 747 | /* Abort any ongoing link failover */ |
b97bf3fd | 748 | for (i = 0; i < MAX_BEARERS; i++) { |
9d13ec65 | 749 | struct tipc_link *l_ptr = n_ptr->links[i].link; |
c4307285 | 750 | if (!l_ptr) |
b97bf3fd | 751 | continue; |
d3504c34 | 752 | l_ptr->exec_mode = TIPC_LINK_OPEN; |
6e498158 JPM |
753 | kfree_skb(l_ptr->failover_reasm_skb); |
754 | l_ptr->failover_reasm_skb = NULL; | |
4323add6 | 755 | tipc_link_reset_fragments(l_ptr); |
b97bf3fd | 756 | } |
708ac32c | 757 | /* Prevent re-contact with node until cleanup is done */ |
1a20cc25 | 758 | tipc_node_fsm_evt(n_ptr, SELF_LOST_CONTACT_EVT); |
708ac32c JPM |
759 | |
760 | /* Notify publications from this node */ | |
761 | n_ptr->action_flags |= TIPC_NOTIFY_NODE_DOWN; | |
762 | ||
763 | /* Notify sockets connected to node */ | |
764 | list_for_each_entry_safe(conn, safe, conns, list) { | |
765 | skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG, | |
766 | SHORT_H_SIZE, 0, tn->own_addr, | |
767 | conn->peer_node, conn->port, | |
768 | conn->peer_port, TIPC_ERR_NO_NODE); | |
769 | if (likely(skb)) { | |
770 | skb_queue_tail(n_ptr->inputq, skb); | |
771 | n_ptr->action_flags |= TIPC_MSG_EVT; | |
772 | } | |
773 | list_del(&conn->list); | |
774 | kfree(conn); | |
775 | } | |
b97bf3fd PL |
776 | } |
777 | ||
78acb1f9 EH |
778 | /** |
779 | * tipc_node_get_linkname - get the name of a link | |
780 | * | |
781 | * @bearer_id: id of the bearer | |
782 | * @node: peer node address | |
783 | * @linkname: link name output buffer | |
784 | * | |
785 | * Returns 0 on success | |
786 | */ | |
f2f9800d YX |
787 | int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr, |
788 | char *linkname, size_t len) | |
78acb1f9 EH |
789 | { |
790 | struct tipc_link *link; | |
8a0f6ebe | 791 | int err = -EINVAL; |
f2f9800d | 792 | struct tipc_node *node = tipc_node_find(net, addr); |
78acb1f9 | 793 | |
8a0f6ebe YX |
794 | if (!node) |
795 | return err; | |
796 | ||
797 | if (bearer_id >= MAX_BEARERS) | |
798 | goto exit; | |
799 | ||
78acb1f9 | 800 | tipc_node_lock(node); |
9d13ec65 | 801 | link = node->links[bearer_id].link; |
78acb1f9 EH |
802 | if (link) { |
803 | strncpy(linkname, link->name, len); | |
8a0f6ebe | 804 | err = 0; |
78acb1f9 | 805 | } |
8a0f6ebe | 806 | exit: |
78acb1f9 | 807 | tipc_node_unlock(node); |
8a0f6ebe YX |
808 | tipc_node_put(node); |
809 | return err; | |
78acb1f9 | 810 | } |
9db9fdd1 YX |
811 | |
812 | void tipc_node_unlock(struct tipc_node *node) | |
813 | { | |
f2f9800d | 814 | struct net *net = node->net; |
ca0c4273 | 815 | u32 addr = 0; |
c637c103 | 816 | u32 flags = node->action_flags; |
7b8613e0 | 817 | u32 link_id = 0; |
708ac32c | 818 | struct list_head *publ_list; |
c637c103 | 819 | struct sk_buff_head *inputq = node->inputq; |
708ac32c | 820 | struct sk_buff_head *namedq; |
9db9fdd1 | 821 | |
c637c103 JPM |
822 | if (likely(!flags || (flags == TIPC_MSG_EVT))) { |
823 | node->action_flags = 0; | |
9db9fdd1 | 824 | spin_unlock_bh(&node->lock); |
c637c103 JPM |
825 | if (flags == TIPC_MSG_EVT) |
826 | tipc_sk_rcv(net, inputq); | |
9db9fdd1 YX |
827 | return; |
828 | } | |
829 | ||
7b8613e0 YX |
830 | addr = node->addr; |
831 | link_id = node->link_id; | |
c637c103 | 832 | namedq = node->namedq; |
708ac32c | 833 | publ_list = &node->publ_list; |
7b8613e0 | 834 | |
cb1b7280 JPM |
835 | node->action_flags &= ~(TIPC_MSG_EVT | |
836 | TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP | | |
837 | TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP | | |
838 | TIPC_WAKEUP_BCAST_USERS | TIPC_BCAST_MSG_EVT | | |
b952b2be | 839 | TIPC_NAMED_MSG_EVT | TIPC_BCAST_RESET); |
7b8613e0 | 840 | |
9db9fdd1 YX |
841 | spin_unlock_bh(&node->lock); |
842 | ||
708ac32c JPM |
843 | if (flags & TIPC_NOTIFY_NODE_DOWN) |
844 | tipc_publ_notify(net, publ_list, addr); | |
50100a5e | 845 | |
908344cd | 846 | if (flags & TIPC_WAKEUP_BCAST_USERS) |
f2f9800d | 847 | tipc_bclink_wakeup_users(net); |
908344cd | 848 | |
7b8613e0 | 849 | if (flags & TIPC_NOTIFY_NODE_UP) |
f2f9800d | 850 | tipc_named_node_up(net, addr); |
7b8613e0 YX |
851 | |
852 | if (flags & TIPC_NOTIFY_LINK_UP) | |
f2f9800d | 853 | tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr, |
7b8613e0 YX |
854 | TIPC_NODE_SCOPE, link_id, addr); |
855 | ||
856 | if (flags & TIPC_NOTIFY_LINK_DOWN) | |
f2f9800d | 857 | tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr, |
7b8613e0 | 858 | link_id, addr); |
c637c103 JPM |
859 | |
860 | if (flags & TIPC_MSG_EVT) | |
861 | tipc_sk_rcv(net, inputq); | |
862 | ||
863 | if (flags & TIPC_NAMED_MSG_EVT) | |
864 | tipc_named_rcv(net, namedq); | |
cb1b7280 JPM |
865 | |
866 | if (flags & TIPC_BCAST_MSG_EVT) | |
867 | tipc_bclink_input(net); | |
b952b2be YX |
868 | |
869 | if (flags & TIPC_BCAST_RESET) | |
6144a996 | 870 | tipc_node_reset_links(node); |
9db9fdd1 | 871 | } |
3e4b6ab5 RA |
872 | |
873 | /* Caller should hold node lock for the passed node */ | |
d8182804 | 874 | static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node) |
3e4b6ab5 RA |
875 | { |
876 | void *hdr; | |
877 | struct nlattr *attrs; | |
878 | ||
bfb3e5dd | 879 | hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family, |
3e4b6ab5 RA |
880 | NLM_F_MULTI, TIPC_NL_NODE_GET); |
881 | if (!hdr) | |
882 | return -EMSGSIZE; | |
883 | ||
884 | attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE); | |
885 | if (!attrs) | |
886 | goto msg_full; | |
887 | ||
888 | if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr)) | |
889 | goto attr_msg_full; | |
890 | if (tipc_node_is_up(node)) | |
891 | if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP)) | |
892 | goto attr_msg_full; | |
893 | ||
894 | nla_nest_end(msg->skb, attrs); | |
895 | genlmsg_end(msg->skb, hdr); | |
896 | ||
897 | return 0; | |
898 | ||
899 | attr_msg_full: | |
900 | nla_nest_cancel(msg->skb, attrs); | |
901 | msg_full: | |
902 | genlmsg_cancel(msg->skb, hdr); | |
903 | ||
904 | return -EMSGSIZE; | |
905 | } | |
906 | ||
af9b028e JPM |
907 | static struct tipc_link *tipc_node_select_link(struct tipc_node *n, int sel, |
908 | int *bearer_id, | |
909 | struct tipc_media_addr **maddr) | |
910 | { | |
911 | int id = n->active_links[sel & 1]; | |
912 | ||
913 | if (unlikely(id < 0)) | |
914 | return NULL; | |
915 | ||
916 | *bearer_id = id; | |
917 | *maddr = &n->links[id].maddr; | |
918 | return n->links[id].link; | |
919 | } | |
920 | ||
921 | /** | |
922 | * tipc_node_xmit() is the general link level function for message sending | |
923 | * @net: the applicable net namespace | |
924 | * @list: chain of buffers containing message | |
925 | * @dnode: address of destination node | |
926 | * @selector: a number used for deterministic link selection | |
927 | * Consumes the buffer chain, except when returning -ELINKCONG | |
928 | * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE | |
929 | */ | |
930 | int tipc_node_xmit(struct net *net, struct sk_buff_head *list, | |
931 | u32 dnode, int selector) | |
932 | { | |
933 | struct tipc_link *l = NULL; | |
934 | struct tipc_node *n; | |
935 | struct sk_buff_head xmitq; | |
936 | struct tipc_media_addr *maddr; | |
937 | int bearer_id; | |
938 | int rc = -EHOSTUNREACH; | |
939 | ||
940 | __skb_queue_head_init(&xmitq); | |
941 | n = tipc_node_find(net, dnode); | |
942 | if (likely(n)) { | |
943 | tipc_node_lock(n); | |
944 | l = tipc_node_select_link(n, selector, &bearer_id, &maddr); | |
945 | if (likely(l)) | |
946 | rc = tipc_link_xmit(l, list, &xmitq); | |
947 | if (unlikely(rc == -ENOBUFS)) | |
655fb243 | 948 | tipc_node_link_down(n, bearer_id); |
af9b028e JPM |
949 | tipc_node_unlock(n); |
950 | tipc_node_put(n); | |
951 | } | |
952 | if (likely(!rc)) { | |
953 | tipc_bearer_xmit(net, bearer_id, &xmitq, maddr); | |
954 | return 0; | |
955 | } | |
956 | if (likely(in_own_node(net, dnode))) { | |
957 | tipc_sk_rcv(net, list); | |
958 | return 0; | |
959 | } | |
960 | return rc; | |
961 | } | |
962 | ||
963 | /* tipc_node_xmit_skb(): send single buffer to destination | |
964 | * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE | |
965 | * messages, which will not be rejected | |
966 | * The only exception is datagram messages rerouted after secondary | |
967 | * lookup, which are rare and safe to dispose of anyway. | |
968 | * TODO: Return real return value, and let callers use | |
969 | * tipc_wait_for_sendpkt() where applicable | |
970 | */ | |
971 | int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode, | |
972 | u32 selector) | |
973 | { | |
974 | struct sk_buff_head head; | |
975 | int rc; | |
976 | ||
977 | skb_queue_head_init(&head); | |
978 | __skb_queue_tail(&head, skb); | |
979 | rc = tipc_node_xmit(net, &head, dnode, selector); | |
980 | if (rc == -ELINKCONG) | |
981 | kfree_skb(skb); | |
982 | return 0; | |
983 | } | |
984 | ||
6e498158 JPM |
985 | /** |
986 | * tipc_node_check_state - check and if necessary update node state | |
987 | * @skb: TIPC packet | |
988 | * @bearer_id: identity of bearer delivering the packet | |
989 | * Returns true if state is ok, otherwise consumes buffer and returns false | |
6144a996 | 990 | */ |
6e498158 JPM |
991 | static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb, |
992 | int bearer_id) | |
6144a996 | 993 | { |
6144a996 | 994 | struct tipc_msg *hdr = buf_msg(skb); |
6e498158 JPM |
995 | int usr = msg_user(hdr); |
996 | int mtyp = msg_type(hdr); | |
6144a996 | 997 | u16 oseqno = msg_seqno(hdr); |
6e498158 JPM |
998 | u16 iseqno = msg_seqno(msg_get_wrapped(hdr)); |
999 | u16 exp_pkts = msg_msgcnt(hdr); | |
1000 | u16 rcv_nxt, syncpt, dlv_nxt; | |
1001 | int state = n->state; | |
1002 | struct tipc_link *l, *pl = NULL; | |
1003 | struct sk_buff_head; | |
1004 | int i; | |
6144a996 | 1005 | |
6e498158 JPM |
1006 | l = n->links[bearer_id].link; |
1007 | if (!l) | |
1008 | return false; | |
1009 | rcv_nxt = l->rcv_nxt; | |
6144a996 | 1010 | |
6144a996 | 1011 | |
6e498158 JPM |
1012 | if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) |
1013 | return true; | |
6144a996 | 1014 | |
6e498158 JPM |
1015 | /* Find parallel link, if any */ |
1016 | for (i = 0; i < MAX_BEARERS; i++) { | |
1017 | if ((i != bearer_id) && n->links[i].link) { | |
1018 | pl = n->links[i].link; | |
1019 | break; | |
1020 | } | |
1021 | } | |
6144a996 | 1022 | |
6e498158 JPM |
1023 | /* Update node accesibility if applicable */ |
1024 | if (state == SELF_UP_PEER_COMING) { | |
1025 | if (!tipc_link_is_up(l)) | |
1026 | return true; | |
1027 | if (!msg_peer_link_is_up(hdr)) | |
1028 | return true; | |
1029 | tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT); | |
1030 | } | |
1031 | ||
1032 | if (state == SELF_DOWN_PEER_LEAVING) { | |
1033 | if (msg_peer_node_is_up(hdr)) | |
1034 | return false; | |
1035 | tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT); | |
1036 | } | |
1037 | ||
1038 | /* Ignore duplicate packets */ | |
1039 | if (less(oseqno, rcv_nxt)) | |
1040 | return true; | |
1041 | ||
1042 | /* Initiate or update failover mode if applicable */ | |
1043 | if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) { | |
1044 | syncpt = oseqno + exp_pkts - 1; | |
1045 | if (pl && tipc_link_is_up(pl)) { | |
1046 | tipc_node_link_down(n, pl->bearer_id); | |
6144a996 JPM |
1047 | pl->exec_mode = TIPC_LINK_BLOCKED; |
1048 | } | |
6e498158 JPM |
1049 | /* If pkts arrive out of order, use lowest calculated syncpt */ |
1050 | if (less(syncpt, n->sync_point)) | |
1051 | n->sync_point = syncpt; | |
1052 | } | |
1053 | ||
1054 | /* Open parallel link when tunnel link reaches synch point */ | |
1055 | if ((n->state == NODE_FAILINGOVER) && (more(rcv_nxt, n->sync_point))) { | |
1056 | tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT); | |
1057 | if (pl) | |
1058 | pl->exec_mode = TIPC_LINK_OPEN; | |
1059 | return true; | |
1060 | } | |
1061 | ||
1062 | /* Initiate or update synch mode if applicable */ | |
1063 | if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG)) { | |
1064 | syncpt = iseqno + exp_pkts - 1; | |
1065 | if (n->state == SELF_UP_PEER_UP) { | |
1066 | n->sync_point = syncpt; | |
1067 | tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT); | |
1068 | } | |
1069 | l->exec_mode = TIPC_LINK_TUNNEL; | |
1070 | if (less(syncpt, n->sync_point)) | |
1071 | n->sync_point = syncpt; | |
6144a996 | 1072 | } |
6e498158 JPM |
1073 | |
1074 | /* Open tunnel link when parallel link reaches synch point */ | |
1075 | if ((n->state == NODE_SYNCHING) && (l->exec_mode == TIPC_LINK_TUNNEL)) { | |
1076 | if (pl) | |
1077 | dlv_nxt = mod(pl->rcv_nxt - skb_queue_len(pl->inputq)); | |
1078 | if (!pl || more(dlv_nxt, n->sync_point)) { | |
1079 | tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT); | |
1080 | l->exec_mode = TIPC_LINK_OPEN; | |
1081 | return true; | |
1082 | } | |
1083 | if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG)) | |
1084 | return true; | |
1085 | if (usr == LINK_PROTOCOL) | |
1086 | return true; | |
1087 | return false; | |
1088 | } | |
1089 | return true; | |
6144a996 JPM |
1090 | } |
1091 | ||
d999297c JPM |
1092 | /** |
1093 | * tipc_rcv - process TIPC packets/messages arriving from off-node | |
1094 | * @net: the applicable net namespace | |
1095 | * @skb: TIPC packet | |
1096 | * @bearer: pointer to bearer message arrived on | |
1097 | * | |
1098 | * Invoked with no locks held. Bearer pointer must point to a valid bearer | |
1099 | * structure (i.e. cannot be NULL), but bearer can be inactive. | |
1100 | */ | |
1101 | void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b) | |
1102 | { | |
1103 | struct sk_buff_head xmitq; | |
1104 | struct tipc_node *n; | |
6e498158 JPM |
1105 | struct tipc_msg *hdr = buf_msg(skb); |
1106 | int usr = msg_user(hdr); | |
d999297c | 1107 | int bearer_id = b->identity; |
6e498158 | 1108 | struct tipc_link_entry *le; |
d999297c JPM |
1109 | int rc = 0; |
1110 | ||
1111 | __skb_queue_head_init(&xmitq); | |
1112 | ||
1113 | /* Ensure message is well-formed */ | |
1114 | if (unlikely(!tipc_msg_validate(skb))) | |
1115 | goto discard; | |
1116 | ||
1117 | /* Handle arrival of a non-unicast link packet */ | |
d999297c | 1118 | if (unlikely(msg_non_seq(hdr))) { |
6144a996 | 1119 | if (usr == LINK_CONFIG) |
d999297c JPM |
1120 | tipc_disc_rcv(net, skb, b); |
1121 | else | |
1122 | tipc_bclink_rcv(net, skb); | |
1123 | return; | |
1124 | } | |
1125 | ||
1126 | /* Locate neighboring node that sent packet */ | |
1127 | n = tipc_node_find(net, msg_prevnode(hdr)); | |
1128 | if (unlikely(!n)) | |
1129 | goto discard; | |
6e498158 | 1130 | le = &n->links[bearer_id]; |
d999297c | 1131 | |
6e498158 | 1132 | tipc_node_lock(n); |
6144a996 | 1133 | |
6e498158 JPM |
1134 | /* Is reception permitted at the moment ? */ |
1135 | if (!tipc_node_filter_pkt(n, hdr)) | |
d999297c JPM |
1136 | goto unlock; |
1137 | ||
6e498158 | 1138 | if (unlikely(msg_user(hdr) == LINK_PROTOCOL)) |
d999297c JPM |
1139 | tipc_bclink_sync_state(n, hdr); |
1140 | ||
1141 | /* Release acked broadcast messages */ | |
1142 | if (unlikely(n->bclink.acked != msg_bcast_ack(hdr))) | |
1143 | tipc_bclink_acknowledge(n, msg_bcast_ack(hdr)); | |
1144 | ||
6e498158 JPM |
1145 | /* Check and if necessary update node state */ |
1146 | if (likely(tipc_node_check_state(n, skb, bearer_id))) { | |
1147 | rc = tipc_link_rcv(le->link, skb, &xmitq); | |
1148 | skb = NULL; | |
1149 | } | |
d999297c JPM |
1150 | |
1151 | if (unlikely(rc & TIPC_LINK_UP_EVT)) | |
6e498158 JPM |
1152 | tipc_node_link_up(n, bearer_id, &xmitq); |
1153 | ||
d999297c | 1154 | if (unlikely(rc & TIPC_LINK_DOWN_EVT)) |
655fb243 | 1155 | tipc_node_link_down(n, bearer_id); |
d999297c JPM |
1156 | unlock: |
1157 | tipc_node_unlock(n); | |
6e498158 JPM |
1158 | |
1159 | if (!skb_queue_empty(&le->inputq)) | |
1160 | tipc_sk_rcv(net, &le->inputq); | |
1161 | ||
1162 | if (!skb_queue_empty(&xmitq)) | |
1163 | tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr); | |
1164 | ||
d999297c JPM |
1165 | tipc_node_put(n); |
1166 | discard: | |
1167 | kfree_skb(skb); | |
1168 | } | |
1169 | ||
3e4b6ab5 RA |
1170 | int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb) |
1171 | { | |
1172 | int err; | |
f2f9800d YX |
1173 | struct net *net = sock_net(skb->sk); |
1174 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
3e4b6ab5 RA |
1175 | int done = cb->args[0]; |
1176 | int last_addr = cb->args[1]; | |
1177 | struct tipc_node *node; | |
1178 | struct tipc_nl_msg msg; | |
1179 | ||
1180 | if (done) | |
1181 | return 0; | |
1182 | ||
1183 | msg.skb = skb; | |
1184 | msg.portid = NETLINK_CB(cb->skb).portid; | |
1185 | msg.seq = cb->nlh->nlmsg_seq; | |
1186 | ||
1187 | rcu_read_lock(); | |
8a0f6ebe YX |
1188 | if (last_addr) { |
1189 | node = tipc_node_find(net, last_addr); | |
1190 | if (!node) { | |
1191 | rcu_read_unlock(); | |
1192 | /* We never set seq or call nl_dump_check_consistent() | |
1193 | * this means that setting prev_seq here will cause the | |
1194 | * consistence check to fail in the netlink callback | |
1195 | * handler. Resulting in the NLMSG_DONE message having | |
1196 | * the NLM_F_DUMP_INTR flag set if the node state | |
1197 | * changed while we released the lock. | |
1198 | */ | |
1199 | cb->prev_seq = 1; | |
1200 | return -EPIPE; | |
1201 | } | |
1202 | tipc_node_put(node); | |
3e4b6ab5 RA |
1203 | } |
1204 | ||
f2f9800d | 1205 | list_for_each_entry_rcu(node, &tn->node_list, list) { |
3e4b6ab5 RA |
1206 | if (last_addr) { |
1207 | if (node->addr == last_addr) | |
1208 | last_addr = 0; | |
1209 | else | |
1210 | continue; | |
1211 | } | |
1212 | ||
1213 | tipc_node_lock(node); | |
1214 | err = __tipc_nl_add_node(&msg, node); | |
1215 | if (err) { | |
1216 | last_addr = node->addr; | |
1217 | tipc_node_unlock(node); | |
1218 | goto out; | |
1219 | } | |
1220 | ||
1221 | tipc_node_unlock(node); | |
1222 | } | |
1223 | done = 1; | |
1224 | out: | |
1225 | cb->args[0] = done; | |
1226 | cb->args[1] = last_addr; | |
1227 | rcu_read_unlock(); | |
1228 | ||
1229 | return skb->len; | |
1230 | } |