Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/node.c: TIPC node management routines | |
c4307285 | 3 | * |
16e166b8 | 4 | * Copyright (c) 2000-2006, 2012-2014, 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" | |
38 | #include "config.h" | |
39 | #include "node.h" | |
b97bf3fd | 40 | #include "name_distr.h" |
50100a5e | 41 | #include "socket.h" |
b97bf3fd | 42 | |
a635b46b AS |
43 | #define NODE_HTABLE_SIZE 512 |
44 | ||
6c00055a DM |
45 | static void node_lost_contact(struct tipc_node *n_ptr); |
46 | static void node_established_contact(struct tipc_node *n_ptr); | |
b97bf3fd | 47 | |
672d99e1 AS |
48 | static struct hlist_head node_htable[NODE_HTABLE_SIZE]; |
49 | LIST_HEAD(tipc_node_list); | |
50 | static u32 tipc_num_nodes; | |
dde20266 | 51 | static u32 tipc_num_links; |
46651c59 | 52 | static DEFINE_SPINLOCK(node_list_lock); |
34e46258 | 53 | |
02be61a9 JPM |
54 | struct tipc_sock_conn { |
55 | u32 port; | |
56 | u32 peer_port; | |
57 | u32 peer_node; | |
58 | struct list_head list; | |
59 | }; | |
60 | ||
3e4b6ab5 RA |
61 | static const struct nla_policy tipc_nl_node_policy[TIPC_NLA_NODE_MAX + 1] = { |
62 | [TIPC_NLA_NODE_UNSPEC] = { .type = NLA_UNSPEC }, | |
63 | [TIPC_NLA_NODE_ADDR] = { .type = NLA_U32 }, | |
64 | [TIPC_NLA_NODE_UP] = { .type = NLA_FLAG } | |
65 | }; | |
66 | ||
a635b46b AS |
67 | /* |
68 | * A trivial power-of-two bitmask technique is used for speed, since this | |
69 | * operation is done for every incoming TIPC packet. The number of hash table | |
70 | * entries has been chosen so that no hash chain exceeds 8 nodes and will | |
71 | * usually be much smaller (typically only a single node). | |
72 | */ | |
872f24db | 73 | static unsigned int tipc_hashfn(u32 addr) |
a635b46b AS |
74 | { |
75 | return addr & (NODE_HTABLE_SIZE - 1); | |
76 | } | |
77 | ||
1ec2bb08 | 78 | /* |
672d99e1 AS |
79 | * tipc_node_find - locate specified node object, if it exists |
80 | */ | |
672d99e1 AS |
81 | struct tipc_node *tipc_node_find(u32 addr) |
82 | { | |
83 | struct tipc_node *node; | |
672d99e1 | 84 | |
336ebf5b | 85 | if (unlikely(!in_own_cluster_exact(addr))) |
672d99e1 AS |
86 | return NULL; |
87 | ||
6c7a762e YX |
88 | rcu_read_lock(); |
89 | hlist_for_each_entry_rcu(node, &node_htable[tipc_hashfn(addr)], hash) { | |
46651c59 | 90 | if (node->addr == addr) { |
6c7a762e | 91 | rcu_read_unlock(); |
672d99e1 | 92 | return node; |
46651c59 | 93 | } |
672d99e1 | 94 | } |
6c7a762e | 95 | rcu_read_unlock(); |
672d99e1 AS |
96 | return NULL; |
97 | } | |
98 | ||
6c00055a | 99 | struct tipc_node *tipc_node_create(u32 addr) |
b97bf3fd | 100 | { |
672d99e1 | 101 | struct tipc_node *n_ptr, *temp_node; |
b97bf3fd | 102 | |
46651c59 | 103 | spin_lock_bh(&node_list_lock); |
2ecb0924 | 104 | |
5af54792 | 105 | n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC); |
a10bd924 | 106 | if (!n_ptr) { |
46651c59 | 107 | spin_unlock_bh(&node_list_lock); |
2cf8aa19 | 108 | pr_warn("Node creation failed, no memory\n"); |
a10bd924 AS |
109 | return NULL; |
110 | } | |
111 | ||
a10bd924 | 112 | n_ptr->addr = addr; |
51a8e4de | 113 | spin_lock_init(&n_ptr->lock); |
672d99e1 AS |
114 | INIT_HLIST_NODE(&n_ptr->hash); |
115 | INIT_LIST_HEAD(&n_ptr->list); | |
a8f48af5 | 116 | INIT_LIST_HEAD(&n_ptr->publ_list); |
02be61a9 | 117 | INIT_LIST_HEAD(&n_ptr->conn_sks); |
50100a5e | 118 | __skb_queue_head_init(&n_ptr->waiting_sks); |
bc6fecd4 | 119 | __skb_queue_head_init(&n_ptr->bclink.deferred_queue); |
8f92df6a | 120 | |
6c7a762e | 121 | hlist_add_head_rcu(&n_ptr->hash, &node_htable[tipc_hashfn(addr)]); |
672d99e1 | 122 | |
6c7a762e | 123 | list_for_each_entry_rcu(temp_node, &tipc_node_list, list) { |
672d99e1 AS |
124 | if (n_ptr->addr < temp_node->addr) |
125 | break; | |
126 | } | |
6c7a762e | 127 | list_add_tail_rcu(&n_ptr->list, &temp_node->list); |
aecb9bb8 | 128 | n_ptr->action_flags = TIPC_WAIT_PEER_LINKS_DOWN; |
fc0eea69 | 129 | n_ptr->signature = INVALID_NODE_SIG; |
672d99e1 AS |
130 | |
131 | tipc_num_nodes++; | |
a10bd924 | 132 | |
46651c59 | 133 | spin_unlock_bh(&node_list_lock); |
b97bf3fd PL |
134 | return n_ptr; |
135 | } | |
136 | ||
46651c59 | 137 | static void tipc_node_delete(struct tipc_node *n_ptr) |
b97bf3fd | 138 | { |
6c7a762e YX |
139 | list_del_rcu(&n_ptr->list); |
140 | hlist_del_rcu(&n_ptr->hash); | |
141 | kfree_rcu(n_ptr, rcu); | |
8f92df6a | 142 | |
672d99e1 | 143 | tipc_num_nodes--; |
b97bf3fd PL |
144 | } |
145 | ||
46651c59 YX |
146 | void tipc_node_stop(void) |
147 | { | |
148 | struct tipc_node *node, *t_node; | |
149 | ||
150 | spin_lock_bh(&node_list_lock); | |
151 | list_for_each_entry_safe(node, t_node, &tipc_node_list, list) | |
152 | tipc_node_delete(node); | |
153 | spin_unlock_bh(&node_list_lock); | |
154 | } | |
155 | ||
02be61a9 JPM |
156 | int tipc_node_add_conn(u32 dnode, u32 port, u32 peer_port) |
157 | { | |
158 | struct tipc_node *node; | |
159 | struct tipc_sock_conn *conn; | |
160 | ||
161 | if (in_own_node(dnode)) | |
162 | return 0; | |
163 | ||
164 | node = tipc_node_find(dnode); | |
165 | if (!node) { | |
166 | pr_warn("Connecting sock to node 0x%x failed\n", dnode); | |
167 | return -EHOSTUNREACH; | |
168 | } | |
169 | conn = kmalloc(sizeof(*conn), GFP_ATOMIC); | |
170 | if (!conn) | |
171 | return -EHOSTUNREACH; | |
172 | conn->peer_node = dnode; | |
173 | conn->port = port; | |
174 | conn->peer_port = peer_port; | |
175 | ||
176 | tipc_node_lock(node); | |
177 | list_add_tail(&conn->list, &node->conn_sks); | |
178 | tipc_node_unlock(node); | |
179 | return 0; | |
180 | } | |
181 | ||
182 | void tipc_node_remove_conn(u32 dnode, u32 port) | |
183 | { | |
184 | struct tipc_node *node; | |
185 | struct tipc_sock_conn *conn, *safe; | |
186 | ||
187 | if (in_own_node(dnode)) | |
188 | return; | |
189 | ||
190 | node = tipc_node_find(dnode); | |
191 | if (!node) | |
192 | return; | |
193 | ||
194 | tipc_node_lock(node); | |
195 | list_for_each_entry_safe(conn, safe, &node->conn_sks, list) { | |
196 | if (port != conn->port) | |
197 | continue; | |
198 | list_del(&conn->list); | |
199 | kfree(conn); | |
200 | } | |
201 | tipc_node_unlock(node); | |
202 | } | |
203 | ||
204 | void tipc_node_abort_sock_conns(struct list_head *conns) | |
205 | { | |
206 | struct tipc_sock_conn *conn, *safe; | |
207 | struct sk_buff *buf; | |
208 | ||
209 | list_for_each_entry_safe(conn, safe, conns, list) { | |
210 | buf = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG, | |
211 | SHORT_H_SIZE, 0, tipc_own_addr, | |
212 | conn->peer_node, conn->port, | |
213 | conn->peer_port, TIPC_ERR_NO_NODE); | |
214 | if (likely(buf)) | |
215 | tipc_sk_rcv(buf); | |
216 | list_del(&conn->list); | |
217 | kfree(conn); | |
218 | } | |
219 | } | |
220 | ||
b97bf3fd | 221 | /** |
4323add6 | 222 | * tipc_node_link_up - handle addition of link |
c4307285 | 223 | * |
b97bf3fd PL |
224 | * Link becomes active (alone or shared) or standby, depending on its priority. |
225 | */ | |
a18c4bc3 | 226 | void tipc_node_link_up(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 227 | { |
a18c4bc3 | 228 | struct tipc_link **active = &n_ptr->active_links[0]; |
b97bf3fd | 229 | |
5392d646 | 230 | n_ptr->working_links++; |
7b8613e0 YX |
231 | n_ptr->action_flags |= TIPC_NOTIFY_LINK_UP; |
232 | n_ptr->link_id = l_ptr->peer_bearer_id << 16 | l_ptr->bearer_id; | |
233 | ||
2cf8aa19 | 234 | pr_info("Established link <%s> on network plane %c\n", |
7a2f7d18 | 235 | l_ptr->name, l_ptr->net_plane); |
c4307285 | 236 | |
b97bf3fd | 237 | if (!active[0]) { |
b97bf3fd PL |
238 | active[0] = active[1] = l_ptr; |
239 | node_established_contact(n_ptr); | |
16e166b8 | 240 | goto exit; |
b97bf3fd | 241 | } |
c4307285 | 242 | if (l_ptr->priority < active[0]->priority) { |
2cf8aa19 | 243 | pr_info("New link <%s> becomes standby\n", l_ptr->name); |
16e166b8 | 244 | goto exit; |
b97bf3fd | 245 | } |
247f0f3c | 246 | tipc_link_dup_queue_xmit(active[0], l_ptr); |
c4307285 | 247 | if (l_ptr->priority == active[0]->priority) { |
b97bf3fd | 248 | active[0] = l_ptr; |
16e166b8 | 249 | goto exit; |
b97bf3fd | 250 | } |
2cf8aa19 | 251 | pr_info("Old link <%s> becomes standby\n", active[0]->name); |
a10bd924 | 252 | if (active[1] != active[0]) |
2cf8aa19 | 253 | pr_info("Old link <%s> becomes standby\n", active[1]->name); |
b97bf3fd | 254 | active[0] = active[1] = l_ptr; |
16e166b8 JPM |
255 | exit: |
256 | /* Leave room for changeover header when returning 'mtu' to users: */ | |
257 | n_ptr->act_mtus[0] = active[0]->max_pkt - INT_H_SIZE; | |
258 | n_ptr->act_mtus[1] = active[1]->max_pkt - INT_H_SIZE; | |
b97bf3fd PL |
259 | } |
260 | ||
261 | /** | |
262 | * node_select_active_links - select active link | |
263 | */ | |
6c00055a | 264 | static void node_select_active_links(struct tipc_node *n_ptr) |
b97bf3fd | 265 | { |
a18c4bc3 | 266 | struct tipc_link **active = &n_ptr->active_links[0]; |
b97bf3fd PL |
267 | u32 i; |
268 | u32 highest_prio = 0; | |
269 | ||
c4307285 | 270 | active[0] = active[1] = NULL; |
b97bf3fd PL |
271 | |
272 | for (i = 0; i < MAX_BEARERS; i++) { | |
a18c4bc3 | 273 | struct tipc_link *l_ptr = n_ptr->links[i]; |
b97bf3fd | 274 | |
4323add6 | 275 | if (!l_ptr || !tipc_link_is_up(l_ptr) || |
b97bf3fd PL |
276 | (l_ptr->priority < highest_prio)) |
277 | continue; | |
278 | ||
279 | if (l_ptr->priority > highest_prio) { | |
c4307285 | 280 | highest_prio = l_ptr->priority; |
b97bf3fd PL |
281 | active[0] = active[1] = l_ptr; |
282 | } else { | |
283 | active[1] = l_ptr; | |
284 | } | |
285 | } | |
286 | } | |
287 | ||
288 | /** | |
4323add6 | 289 | * tipc_node_link_down - handle loss of link |
b97bf3fd | 290 | */ |
a18c4bc3 | 291 | void tipc_node_link_down(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 292 | { |
a18c4bc3 | 293 | struct tipc_link **active; |
b97bf3fd | 294 | |
5392d646 | 295 | n_ptr->working_links--; |
7b8613e0 YX |
296 | n_ptr->action_flags |= TIPC_NOTIFY_LINK_DOWN; |
297 | n_ptr->link_id = l_ptr->peer_bearer_id << 16 | l_ptr->bearer_id; | |
5392d646 | 298 | |
4323add6 | 299 | if (!tipc_link_is_active(l_ptr)) { |
2cf8aa19 | 300 | pr_info("Lost standby link <%s> on network plane %c\n", |
7a2f7d18 | 301 | l_ptr->name, l_ptr->net_plane); |
b97bf3fd PL |
302 | return; |
303 | } | |
2cf8aa19 | 304 | pr_info("Lost link <%s> on network plane %c\n", |
7a2f7d18 | 305 | l_ptr->name, l_ptr->net_plane); |
b97bf3fd PL |
306 | |
307 | active = &n_ptr->active_links[0]; | |
308 | if (active[0] == l_ptr) | |
309 | active[0] = active[1]; | |
310 | if (active[1] == l_ptr) | |
311 | active[1] = active[0]; | |
312 | if (active[0] == l_ptr) | |
313 | node_select_active_links(n_ptr); | |
c4307285 | 314 | if (tipc_node_is_up(n_ptr)) |
170b3927 | 315 | tipc_link_failover_send_queue(l_ptr); |
c4307285 | 316 | else |
b97bf3fd | 317 | node_lost_contact(n_ptr); |
16e166b8 JPM |
318 | |
319 | /* Leave room for changeover header when returning 'mtu' to users: */ | |
320 | if (active[0]) { | |
321 | n_ptr->act_mtus[0] = active[0]->max_pkt - INT_H_SIZE; | |
322 | n_ptr->act_mtus[1] = active[1]->max_pkt - INT_H_SIZE; | |
323 | return; | |
324 | } | |
325 | ||
326 | /* Loopback link went down? No fragmentation needed from now on. */ | |
327 | if (n_ptr->addr == tipc_own_addr) { | |
328 | n_ptr->act_mtus[0] = MAX_MSG_SIZE; | |
329 | n_ptr->act_mtus[1] = MAX_MSG_SIZE; | |
330 | } | |
b97bf3fd PL |
331 | } |
332 | ||
8f19afb2 | 333 | int tipc_node_active_links(struct tipc_node *n_ptr) |
b97bf3fd | 334 | { |
76ae0d71 | 335 | return n_ptr->active_links[0] != NULL; |
b97bf3fd PL |
336 | } |
337 | ||
6c00055a | 338 | int tipc_node_is_up(struct tipc_node *n_ptr) |
b97bf3fd | 339 | { |
8f19afb2 | 340 | return tipc_node_active_links(n_ptr); |
b97bf3fd PL |
341 | } |
342 | ||
a18c4bc3 | 343 | void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 344 | { |
7a2f7d18 | 345 | n_ptr->links[l_ptr->bearer_id] = l_ptr; |
dde20266 YX |
346 | spin_lock_bh(&node_list_lock); |
347 | tipc_num_links++; | |
348 | spin_unlock_bh(&node_list_lock); | |
37b9c08a | 349 | n_ptr->link_cnt++; |
b97bf3fd PL |
350 | } |
351 | ||
a18c4bc3 | 352 | void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 353 | { |
7d33939f JPM |
354 | int i; |
355 | ||
356 | for (i = 0; i < MAX_BEARERS; i++) { | |
074bb43e JPM |
357 | if (l_ptr != n_ptr->links[i]) |
358 | continue; | |
359 | n_ptr->links[i] = NULL; | |
dde20266 YX |
360 | spin_lock_bh(&node_list_lock); |
361 | tipc_num_links--; | |
362 | spin_unlock_bh(&node_list_lock); | |
074bb43e | 363 | n_ptr->link_cnt--; |
7d33939f | 364 | } |
b97bf3fd PL |
365 | } |
366 | ||
6c00055a | 367 | static void node_established_contact(struct tipc_node *n_ptr) |
b97bf3fd | 368 | { |
aecb9bb8 | 369 | n_ptr->action_flags |= TIPC_NOTIFY_NODE_UP; |
c64f7a6a | 370 | n_ptr->bclink.oos_state = 0; |
818f4da5 YX |
371 | n_ptr->bclink.acked = tipc_bclink_get_last_sent(); |
372 | tipc_bclink_add_node(n_ptr->addr); | |
b97bf3fd PL |
373 | } |
374 | ||
6c00055a | 375 | static void node_lost_contact(struct tipc_node *n_ptr) |
b97bf3fd | 376 | { |
b97bf3fd PL |
377 | char addr_string[16]; |
378 | u32 i; | |
379 | ||
2cf8aa19 EH |
380 | pr_info("Lost contact with %s\n", |
381 | tipc_addr_string_fill(addr_string, n_ptr->addr)); | |
c5bd4d85 AS |
382 | |
383 | /* Flush broadcast link info associated with lost node */ | |
389dd9bc | 384 | if (n_ptr->bclink.recv_permitted) { |
bc6fecd4 | 385 | __skb_queue_purge(&n_ptr->bclink.deferred_queue); |
c5bd4d85 | 386 | |
37e22164 JPM |
387 | if (n_ptr->bclink.reasm_buf) { |
388 | kfree_skb(n_ptr->bclink.reasm_buf); | |
389 | n_ptr->bclink.reasm_buf = NULL; | |
c5bd4d85 AS |
390 | } |
391 | ||
cd3decdf | 392 | tipc_bclink_remove_node(n_ptr->addr); |
36559591 | 393 | tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ); |
b97bf3fd | 394 | |
389dd9bc | 395 | n_ptr->bclink.recv_permitted = false; |
c5bd4d85 | 396 | } |
b97bf3fd PL |
397 | |
398 | /* Abort link changeover */ | |
399 | for (i = 0; i < MAX_BEARERS; i++) { | |
a18c4bc3 | 400 | struct tipc_link *l_ptr = n_ptr->links[i]; |
c4307285 | 401 | if (!l_ptr) |
b97bf3fd PL |
402 | continue; |
403 | l_ptr->reset_checkpoint = l_ptr->next_in_no; | |
404 | l_ptr->exp_msg_count = 0; | |
4323add6 | 405 | tipc_link_reset_fragments(l_ptr); |
b97bf3fd PL |
406 | } |
407 | ||
ca9cf06a YX |
408 | n_ptr->action_flags &= ~TIPC_WAIT_OWN_LINKS_DOWN; |
409 | ||
9d561949 YX |
410 | /* Notify subscribers and prevent re-contact with node until |
411 | * cleanup is done. | |
412 | */ | |
ca9cf06a YX |
413 | n_ptr->action_flags |= TIPC_WAIT_PEER_LINKS_DOWN | |
414 | TIPC_NOTIFY_NODE_DOWN; | |
b97bf3fd PL |
415 | } |
416 | ||
4323add6 | 417 | struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space) |
b97bf3fd PL |
418 | { |
419 | u32 domain; | |
420 | struct sk_buff *buf; | |
6c00055a | 421 | struct tipc_node *n_ptr; |
c4307285 | 422 | struct tipc_node_info node_info; |
ea13847b | 423 | u32 payload_size; |
b97bf3fd PL |
424 | |
425 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR)) | |
4323add6 | 426 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd | 427 | |
3e6c8cd5 | 428 | domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area)); |
4323add6 PL |
429 | if (!tipc_addr_domain_valid(domain)) |
430 | return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE | |
431 | " (network address)"); | |
b97bf3fd | 432 | |
46651c59 | 433 | spin_lock_bh(&node_list_lock); |
672d99e1 | 434 | if (!tipc_num_nodes) { |
46651c59 | 435 | spin_unlock_bh(&node_list_lock); |
c4307285 | 436 | return tipc_cfg_reply_none(); |
1aad72d6 | 437 | } |
b97bf3fd | 438 | |
08c80e9a | 439 | /* For now, get space for all other nodes */ |
672d99e1 | 440 | payload_size = TLV_SPACE(sizeof(node_info)) * tipc_num_nodes; |
1aad72d6 | 441 | if (payload_size > 32768u) { |
46651c59 | 442 | spin_unlock_bh(&node_list_lock); |
ea13847b AS |
443 | return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED |
444 | " (too many nodes)"); | |
1aad72d6 | 445 | } |
2220646a YX |
446 | spin_unlock_bh(&node_list_lock); |
447 | ||
ea13847b | 448 | buf = tipc_cfg_reply_alloc(payload_size); |
2220646a | 449 | if (!buf) |
b97bf3fd PL |
450 | return NULL; |
451 | ||
452 | /* Add TLVs for all nodes in scope */ | |
6c7a762e YX |
453 | rcu_read_lock(); |
454 | list_for_each_entry_rcu(n_ptr, &tipc_node_list, list) { | |
672d99e1 | 455 | if (!tipc_in_scope(domain, n_ptr->addr)) |
b97bf3fd | 456 | continue; |
c4307285 YH |
457 | node_info.addr = htonl(n_ptr->addr); |
458 | node_info.up = htonl(tipc_node_is_up(n_ptr)); | |
459 | tipc_cfg_append_tlv(buf, TIPC_TLV_NODE_INFO, | |
4323add6 | 460 | &node_info, sizeof(node_info)); |
b97bf3fd | 461 | } |
6c7a762e | 462 | rcu_read_unlock(); |
b97bf3fd PL |
463 | return buf; |
464 | } | |
465 | ||
4323add6 | 466 | struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space) |
b97bf3fd PL |
467 | { |
468 | u32 domain; | |
469 | struct sk_buff *buf; | |
6c00055a | 470 | struct tipc_node *n_ptr; |
c4307285 | 471 | struct tipc_link_info link_info; |
ea13847b | 472 | u32 payload_size; |
b97bf3fd PL |
473 | |
474 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR)) | |
4323add6 | 475 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd | 476 | |
3e6c8cd5 | 477 | domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area)); |
4323add6 PL |
478 | if (!tipc_addr_domain_valid(domain)) |
479 | return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE | |
480 | " (network address)"); | |
b97bf3fd | 481 | |
b58343f9 | 482 | if (!tipc_own_addr) |
c4307285 YH |
483 | return tipc_cfg_reply_none(); |
484 | ||
46651c59 | 485 | spin_lock_bh(&node_list_lock); |
7a54d4a9 | 486 | /* Get space for all unicast links + broadcast link */ |
dde20266 | 487 | payload_size = TLV_SPACE((sizeof(link_info)) * (tipc_num_links + 1)); |
1aad72d6 | 488 | if (payload_size > 32768u) { |
46651c59 | 489 | spin_unlock_bh(&node_list_lock); |
ea13847b AS |
490 | return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED |
491 | " (too many links)"); | |
1aad72d6 | 492 | } |
dde20266 YX |
493 | spin_unlock_bh(&node_list_lock); |
494 | ||
ea13847b | 495 | buf = tipc_cfg_reply_alloc(payload_size); |
dde20266 | 496 | if (!buf) |
b97bf3fd PL |
497 | return NULL; |
498 | ||
499 | /* Add TLV for broadcast link */ | |
a3796f89 | 500 | link_info.dest = htonl(tipc_cluster_mask(tipc_own_addr)); |
c4307285 | 501 | link_info.up = htonl(1); |
4b704d59 | 502 | strlcpy(link_info.str, tipc_bclink_name, TIPC_MAX_LINK_NAME); |
4323add6 | 503 | tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, &link_info, sizeof(link_info)); |
b97bf3fd PL |
504 | |
505 | /* Add TLVs for any other links in scope */ | |
6c7a762e YX |
506 | rcu_read_lock(); |
507 | list_for_each_entry_rcu(n_ptr, &tipc_node_list, list) { | |
c4307285 | 508 | u32 i; |
b97bf3fd | 509 | |
672d99e1 | 510 | if (!tipc_in_scope(domain, n_ptr->addr)) |
b97bf3fd | 511 | continue; |
1aad72d6 | 512 | tipc_node_lock(n_ptr); |
c4307285 YH |
513 | for (i = 0; i < MAX_BEARERS; i++) { |
514 | if (!n_ptr->links[i]) | |
515 | continue; | |
516 | link_info.dest = htonl(n_ptr->addr); | |
517 | link_info.up = htonl(tipc_link_is_up(n_ptr->links[i])); | |
518 | strcpy(link_info.str, n_ptr->links[i]->name); | |
519 | tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, | |
4323add6 | 520 | &link_info, sizeof(link_info)); |
c4307285 | 521 | } |
1aad72d6 | 522 | tipc_node_unlock(n_ptr); |
b97bf3fd | 523 | } |
6c7a762e | 524 | rcu_read_unlock(); |
b97bf3fd PL |
525 | return buf; |
526 | } | |
78acb1f9 EH |
527 | |
528 | /** | |
529 | * tipc_node_get_linkname - get the name of a link | |
530 | * | |
531 | * @bearer_id: id of the bearer | |
532 | * @node: peer node address | |
533 | * @linkname: link name output buffer | |
534 | * | |
535 | * Returns 0 on success | |
536 | */ | |
537 | int tipc_node_get_linkname(u32 bearer_id, u32 addr, char *linkname, size_t len) | |
538 | { | |
539 | struct tipc_link *link; | |
540 | struct tipc_node *node = tipc_node_find(addr); | |
541 | ||
d7bb74c3 | 542 | if ((bearer_id >= MAX_BEARERS) || !node) |
78acb1f9 EH |
543 | return -EINVAL; |
544 | tipc_node_lock(node); | |
545 | link = node->links[bearer_id]; | |
546 | if (link) { | |
547 | strncpy(linkname, link->name, len); | |
548 | tipc_node_unlock(node); | |
549 | return 0; | |
550 | } | |
551 | tipc_node_unlock(node); | |
552 | return -EINVAL; | |
553 | } | |
9db9fdd1 YX |
554 | |
555 | void tipc_node_unlock(struct tipc_node *node) | |
556 | { | |
557 | LIST_HEAD(nsub_list); | |
02be61a9 | 558 | LIST_HEAD(conn_sks); |
50100a5e | 559 | struct sk_buff_head waiting_sks; |
ca0c4273 | 560 | u32 addr = 0; |
7b8613e0 YX |
561 | int flags = node->action_flags; |
562 | u32 link_id = 0; | |
9db9fdd1 | 563 | |
7b8613e0 | 564 | if (likely(!flags)) { |
9db9fdd1 YX |
565 | spin_unlock_bh(&node->lock); |
566 | return; | |
567 | } | |
568 | ||
7b8613e0 YX |
569 | addr = node->addr; |
570 | link_id = node->link_id; | |
50100a5e | 571 | __skb_queue_head_init(&waiting_sks); |
7b8613e0 YX |
572 | |
573 | if (flags & TIPC_WAKEUP_USERS) | |
50100a5e | 574 | skb_queue_splice_init(&node->waiting_sks, &waiting_sks); |
7b8613e0 YX |
575 | |
576 | if (flags & TIPC_NOTIFY_NODE_DOWN) { | |
a8f48af5 | 577 | list_replace_init(&node->publ_list, &nsub_list); |
02be61a9 | 578 | list_replace_init(&node->conn_sks, &conn_sks); |
9db9fdd1 | 579 | } |
7b8613e0 YX |
580 | node->action_flags &= ~(TIPC_WAKEUP_USERS | TIPC_NOTIFY_NODE_DOWN | |
581 | TIPC_NOTIFY_NODE_UP | TIPC_NOTIFY_LINK_UP | | |
582 | TIPC_NOTIFY_LINK_DOWN | | |
583 | TIPC_WAKEUP_BCAST_USERS); | |
584 | ||
9db9fdd1 YX |
585 | spin_unlock_bh(&node->lock); |
586 | ||
50100a5e JPM |
587 | while (!skb_queue_empty(&waiting_sks)) |
588 | tipc_sk_rcv(__skb_dequeue(&waiting_sks)); | |
589 | ||
02be61a9 JPM |
590 | if (!list_empty(&conn_sks)) |
591 | tipc_node_abort_sock_conns(&conn_sks); | |
592 | ||
9db9fdd1 | 593 | if (!list_empty(&nsub_list)) |
a8f48af5 | 594 | tipc_publ_notify(&nsub_list, addr); |
50100a5e | 595 | |
908344cd JM |
596 | if (flags & TIPC_WAKEUP_BCAST_USERS) |
597 | tipc_bclink_wakeup_users(); | |
598 | ||
7b8613e0 | 599 | if (flags & TIPC_NOTIFY_NODE_UP) |
dbdf6d24 | 600 | tipc_named_node_up(addr); |
7b8613e0 YX |
601 | |
602 | if (flags & TIPC_NOTIFY_LINK_UP) | |
603 | tipc_nametbl_publish(TIPC_LINK_STATE, addr, addr, | |
604 | TIPC_NODE_SCOPE, link_id, addr); | |
605 | ||
606 | if (flags & TIPC_NOTIFY_LINK_DOWN) | |
607 | tipc_nametbl_withdraw(TIPC_LINK_STATE, addr, | |
608 | link_id, addr); | |
9db9fdd1 | 609 | } |
3e4b6ab5 RA |
610 | |
611 | /* Caller should hold node lock for the passed node */ | |
d8182804 | 612 | static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node) |
3e4b6ab5 RA |
613 | { |
614 | void *hdr; | |
615 | struct nlattr *attrs; | |
616 | ||
617 | hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_v2_family, | |
618 | NLM_F_MULTI, TIPC_NL_NODE_GET); | |
619 | if (!hdr) | |
620 | return -EMSGSIZE; | |
621 | ||
622 | attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE); | |
623 | if (!attrs) | |
624 | goto msg_full; | |
625 | ||
626 | if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr)) | |
627 | goto attr_msg_full; | |
628 | if (tipc_node_is_up(node)) | |
629 | if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP)) | |
630 | goto attr_msg_full; | |
631 | ||
632 | nla_nest_end(msg->skb, attrs); | |
633 | genlmsg_end(msg->skb, hdr); | |
634 | ||
635 | return 0; | |
636 | ||
637 | attr_msg_full: | |
638 | nla_nest_cancel(msg->skb, attrs); | |
639 | msg_full: | |
640 | genlmsg_cancel(msg->skb, hdr); | |
641 | ||
642 | return -EMSGSIZE; | |
643 | } | |
644 | ||
645 | int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb) | |
646 | { | |
647 | int err; | |
648 | int done = cb->args[0]; | |
649 | int last_addr = cb->args[1]; | |
650 | struct tipc_node *node; | |
651 | struct tipc_nl_msg msg; | |
652 | ||
653 | if (done) | |
654 | return 0; | |
655 | ||
656 | msg.skb = skb; | |
657 | msg.portid = NETLINK_CB(cb->skb).portid; | |
658 | msg.seq = cb->nlh->nlmsg_seq; | |
659 | ||
660 | rcu_read_lock(); | |
661 | ||
662 | if (last_addr && !tipc_node_find(last_addr)) { | |
663 | rcu_read_unlock(); | |
664 | /* We never set seq or call nl_dump_check_consistent() this | |
665 | * means that setting prev_seq here will cause the consistence | |
666 | * check to fail in the netlink callback handler. Resulting in | |
667 | * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if | |
668 | * the node state changed while we released the lock. | |
669 | */ | |
670 | cb->prev_seq = 1; | |
671 | return -EPIPE; | |
672 | } | |
673 | ||
674 | list_for_each_entry_rcu(node, &tipc_node_list, list) { | |
675 | if (last_addr) { | |
676 | if (node->addr == last_addr) | |
677 | last_addr = 0; | |
678 | else | |
679 | continue; | |
680 | } | |
681 | ||
682 | tipc_node_lock(node); | |
683 | err = __tipc_nl_add_node(&msg, node); | |
684 | if (err) { | |
685 | last_addr = node->addr; | |
686 | tipc_node_unlock(node); | |
687 | goto out; | |
688 | } | |
689 | ||
690 | tipc_node_unlock(node); | |
691 | } | |
692 | done = 1; | |
693 | out: | |
694 | cb->args[0] = done; | |
695 | cb->args[1] = last_addr; | |
696 | rcu_read_unlock(); | |
697 | ||
698 | return skb->len; | |
699 | } |