?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
mm, memory_hotplug: try to migrate full pfn range
[linux/fpc-iii.git] / net / tipc / node.c
blobdb2a6c3e0be9180aa0ca7debfb109d0a13d7035e
1 /*
2 * net/tipc/node.c: TIPC node management routines
3 *
4 * Copyright (c) 2000-2006, 2012-2016, Ericsson AB
5 * Copyright (c) 2005-2006, 2010-2014, Wind River Systems
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
10 *
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.
19 *
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
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37 #include "core.h"
38 #include "link.h"
39 #include "node.h"
40 #include "name_distr.h"
41 #include "socket.h"
42 #include "bcast.h"
43 #include "monitor.h"
44 #include "discover.h"
45 #include "netlink.h"
46 #include "trace.h"
47
48 #define INVALID_NODE_SIG 0x10000
49 #define NODE_CLEANUP_AFTER 300000
50
51 /* Flags used to take different actions according to flag type
52 * TIPC_NOTIFY_NODE_DOWN: notify node is down
53 * TIPC_NOTIFY_NODE_UP: notify node is up
54 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
55 */
56 enum {
57 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
58 TIPC_NOTIFY_NODE_UP = (1 << 4),
59 TIPC_NOTIFY_LINK_UP = (1 << 6),
60 TIPC_NOTIFY_LINK_DOWN = (1 << 7)
61 };
62
63 struct tipc_link_entry {
64 struct tipc_link *link;
65 spinlock_t lock; /* per link */
66 u32 mtu;
67 struct sk_buff_head inputq;
68 struct tipc_media_addr maddr;
69 };
70
71 struct tipc_bclink_entry {
72 struct tipc_link *link;
73 struct sk_buff_head inputq1;
74 struct sk_buff_head arrvq;
75 struct sk_buff_head inputq2;
76 struct sk_buff_head namedq;
77 };
78
79 /**
80 * struct tipc_node - TIPC node structure
81 * @addr: network address of node
82 * @ref: reference counter to node object
83 * @lock: rwlock governing access to structure
84 * @net: the applicable net namespace
85 * @hash: links to adjacent nodes in unsorted hash chain
86 * @inputq: pointer to input queue containing messages for msg event
87 * @namedq: pointer to name table input queue with name table messages
88 * @active_links: bearer ids of active links, used as index into links[] array
89 * @links: array containing references to all links to node
90 * @action_flags: bit mask of different types of node actions
91 * @state: connectivity state vs peer node
92 * @sync_point: sequence number where synch/failover is finished
93 * @list: links to adjacent nodes in sorted list of cluster's nodes
94 * @working_links: number of working links to node (both active and standby)
95 * @link_cnt: number of links to node
96 * @capabilities: bitmap, indicating peer node's functional capabilities
97 * @signature: node instance identifier
98 * @link_id: local and remote bearer ids of changing link, if any
99 * @publ_list: list of publications
100 * @rcu: rcu struct for tipc_node
101 * @delete_at: indicates the time for deleting a down node
102 */
103 struct tipc_node {
104 u32 addr;
105 struct kref kref;
106 rwlock_t lock;
107 struct net *net;
108 struct hlist_node hash;
109 int active_links[2];
110 struct tipc_link_entry links[MAX_BEARERS];
111 struct tipc_bclink_entry bc_entry;
112 int action_flags;
113 struct list_head list;
114 int state;
115 bool failover_sent;
116 u16 sync_point;
117 int link_cnt;
118 u16 working_links;
119 u16 capabilities;
120 u32 signature;
121 u32 link_id;
122 u8 peer_id[16];
123 struct list_head publ_list;
124 struct list_head conn_sks;
125 unsigned long keepalive_intv;
126 struct timer_list timer;
127 struct rcu_head rcu;
128 unsigned long delete_at;
129 };
130
131 /* Node FSM states and events:
132 */
133 enum {
134 SELF_DOWN_PEER_DOWN = 0xdd,
135 SELF_UP_PEER_UP = 0xaa,
136 SELF_DOWN_PEER_LEAVING = 0xd1,
137 SELF_UP_PEER_COMING = 0xac,
138 SELF_COMING_PEER_UP = 0xca,
139 SELF_LEAVING_PEER_DOWN = 0x1d,
140 NODE_FAILINGOVER = 0xf0,
141 NODE_SYNCHING = 0xcc
142 };
143
144 enum {
145 SELF_ESTABL_CONTACT_EVT = 0xece,
146 SELF_LOST_CONTACT_EVT = 0x1ce,
147 PEER_ESTABL_CONTACT_EVT = 0x9ece,
148 PEER_LOST_CONTACT_EVT = 0x91ce,
149 NODE_FAILOVER_BEGIN_EVT = 0xfbe,
150 NODE_FAILOVER_END_EVT = 0xfee,
151 NODE_SYNCH_BEGIN_EVT = 0xcbe,
152 NODE_SYNCH_END_EVT = 0xcee
153 };
154
155 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
156 struct sk_buff_head *xmitq,
157 struct tipc_media_addr **maddr);
158 static void tipc_node_link_down(struct tipc_node *n, int bearer_id,
159 bool delete);
160 static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq);
161 static void tipc_node_delete(struct tipc_node *node);
162 static void tipc_node_timeout(struct timer_list *t);
163 static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
164 static struct tipc_node *tipc_node_find(struct net *net, u32 addr);
165 static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id);
166 static void tipc_node_put(struct tipc_node *node);
167 static bool node_is_up(struct tipc_node *n);
168 static void tipc_node_delete_from_list(struct tipc_node *node);
169
170 struct tipc_sock_conn {
171 u32 port;
172 u32 peer_port;
173 u32 peer_node;
174 struct list_head list;
175 };
176
177 static struct tipc_link *node_active_link(struct tipc_node *n, int sel)
178 {
179 int bearer_id = n->active_links[sel & 1];
180
181 if (unlikely(bearer_id == INVALID_BEARER_ID))
182 return NULL;
183
184 return n->links[bearer_id].link;
185 }
186
187 int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel)
188 {
189 struct tipc_node *n;
190 int bearer_id;
191 unsigned int mtu = MAX_MSG_SIZE;
192
193 n = tipc_node_find(net, addr);
194 if (unlikely(!n))
195 return mtu;
196
197 bearer_id = n->active_links[sel & 1];
198 if (likely(bearer_id != INVALID_BEARER_ID))
199 mtu = n->links[bearer_id].mtu;
200 tipc_node_put(n);
201 return mtu;
202 }
203
204 bool tipc_node_get_id(struct net *net, u32 addr, u8 *id)
205 {
206 u8 *own_id = tipc_own_id(net);
207 struct tipc_node *n;
208
209 if (!own_id)
210 return true;
211
212 if (addr == tipc_own_addr(net)) {
213 memcpy(id, own_id, TIPC_NODEID_LEN);
214 return true;
215 }
216 n = tipc_node_find(net, addr);
217 if (!n)
218 return false;
219
220 memcpy(id, &n->peer_id, TIPC_NODEID_LEN);
221 tipc_node_put(n);
222 return true;
223 }
224
225 u16 tipc_node_get_capabilities(struct net *net, u32 addr)
226 {
227 struct tipc_node *n;
228 u16 caps;
229
230 n = tipc_node_find(net, addr);
231 if (unlikely(!n))
232 return TIPC_NODE_CAPABILITIES;
233 caps = n->capabilities;
234 tipc_node_put(n);
235 return caps;
236 }
237
238 static void tipc_node_kref_release(struct kref *kref)
239 {
240 struct tipc_node *n = container_of(kref, struct tipc_node, kref);
241
242 kfree(n->bc_entry.link);
243 kfree_rcu(n, rcu);
244 }
245
246 static void tipc_node_put(struct tipc_node *node)
247 {
248 kref_put(&node->kref, tipc_node_kref_release);
249 }
250
251 static void tipc_node_get(struct tipc_node *node)
252 {
253 kref_get(&node->kref);
254 }
255
256 /*
257 * tipc_node_find - locate specified node object, if it exists
258 */
259 static struct tipc_node *tipc_node_find(struct net *net, u32 addr)
260 {
261 struct tipc_net *tn = tipc_net(net);
262 struct tipc_node *node;
263 unsigned int thash = tipc_hashfn(addr);
264
265 rcu_read_lock();
266 hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) {
267 if (node->addr != addr)
268 continue;
269 if (!kref_get_unless_zero(&node->kref))
270 node = NULL;
271 break;
272 }
273 rcu_read_unlock();
274 return node;
275 }
276
277 /* tipc_node_find_by_id - locate specified node object by its 128-bit id
278 * Note: this function is called only when a discovery request failed
279 * to find the node by its 32-bit id, and is not time critical
280 */
281 static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id)
282 {
283 struct tipc_net *tn = tipc_net(net);
284 struct tipc_node *n;
285 bool found = false;
286
287 rcu_read_lock();
288 list_for_each_entry_rcu(n, &tn->node_list, list) {
289 read_lock_bh(&n->lock);
290 if (!memcmp(id, n->peer_id, 16) &&
291 kref_get_unless_zero(&n->kref))
292 found = true;
293 read_unlock_bh(&n->lock);
294 if (found)
295 break;
296 }
297 rcu_read_unlock();
298 return found ? n : NULL;
299 }
300
301 static void tipc_node_read_lock(struct tipc_node *n)
302 {
303 read_lock_bh(&n->lock);
304 }
305
306 static void tipc_node_read_unlock(struct tipc_node *n)
307 {
308 read_unlock_bh(&n->lock);
309 }
310
311 static void tipc_node_write_lock(struct tipc_node *n)
312 {
313 write_lock_bh(&n->lock);
314 }
315
316 static void tipc_node_write_unlock_fast(struct tipc_node *n)
317 {
318 write_unlock_bh(&n->lock);
319 }
320
321 static void tipc_node_write_unlock(struct tipc_node *n)
322 {
323 struct net *net = n->net;
324 u32 addr = 0;
325 u32 flags = n->action_flags;
326 u32 link_id = 0;
327 u32 bearer_id;
328 struct list_head *publ_list;
329
330 if (likely(!flags)) {
331 write_unlock_bh(&n->lock);
332 return;
333 }
334
335 addr = n->addr;
336 link_id = n->link_id;
337 bearer_id = link_id & 0xffff;
338 publ_list = &n->publ_list;
339
340 n->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
341 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP);
342
343 write_unlock_bh(&n->lock);
344
345 if (flags & TIPC_NOTIFY_NODE_DOWN)
346 tipc_publ_notify(net, publ_list, addr);
347
348 if (flags & TIPC_NOTIFY_NODE_UP)
349 tipc_named_node_up(net, addr);
350
351 if (flags & TIPC_NOTIFY_LINK_UP) {
352 tipc_mon_peer_up(net, addr, bearer_id);
353 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
354 TIPC_NODE_SCOPE, link_id, link_id);
355 }
356 if (flags & TIPC_NOTIFY_LINK_DOWN) {
357 tipc_mon_peer_down(net, addr, bearer_id);
358 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
359 addr, link_id);
360 }
361 }
362
363 static struct tipc_node *tipc_node_create(struct net *net, u32 addr,
364 u8 *peer_id, u16 capabilities)
365 {
366 struct tipc_net *tn = net_generic(net, tipc_net_id);
367 struct tipc_node *n, *temp_node;
368 struct tipc_link *l;
369 int bearer_id;
370 int i;
371
372 spin_lock_bh(&tn->node_list_lock);
373 n = tipc_node_find(net, addr);
374 if (n) {
375 if (n->capabilities == capabilities)
376 goto exit;
377 /* Same node may come back with new capabilities */
378 write_lock_bh(&n->lock);
379 n->capabilities = capabilities;
380 for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
381 l = n->links[bearer_id].link;
382 if (l)
383 tipc_link_update_caps(l, capabilities);
384 }
385 write_unlock_bh(&n->lock);
386 goto exit;
387 }
388 n = kzalloc(sizeof(*n), GFP_ATOMIC);
389 if (!n) {
390 pr_warn("Node creation failed, no memory\n");
391 goto exit;
392 }
393 n->addr = addr;
394 memcpy(&n->peer_id, peer_id, 16);
395 n->net = net;
396 n->capabilities = capabilities;
397 kref_init(&n->kref);
398 rwlock_init(&n->lock);
399 INIT_HLIST_NODE(&n->hash);
400 INIT_LIST_HEAD(&n->list);
401 INIT_LIST_HEAD(&n->publ_list);
402 INIT_LIST_HEAD(&n->conn_sks);
403 skb_queue_head_init(&n->bc_entry.namedq);
404 skb_queue_head_init(&n->bc_entry.inputq1);
405 __skb_queue_head_init(&n->bc_entry.arrvq);
406 skb_queue_head_init(&n->bc_entry.inputq2);
407 for (i = 0; i < MAX_BEARERS; i++)
408 spin_lock_init(&n->links[i].lock);
409 n->state = SELF_DOWN_PEER_LEAVING;
410 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
411 n->signature = INVALID_NODE_SIG;
412 n->active_links[0] = INVALID_BEARER_ID;
413 n->active_links[1] = INVALID_BEARER_ID;
414 if (!tipc_link_bc_create(net, tipc_own_addr(net),
415 addr, U16_MAX,
416 tipc_link_window(tipc_bc_sndlink(net)),
417 n->capabilities,
418 &n->bc_entry.inputq1,
419 &n->bc_entry.namedq,
420 tipc_bc_sndlink(net),
421 &n->bc_entry.link)) {
422 pr_warn("Broadcast rcv link creation failed, no memory\n");
423 kfree(n);
424 n = NULL;
425 goto exit;
426 }
427 tipc_node_get(n);
428 timer_setup(&n->timer, tipc_node_timeout, 0);
429 n->keepalive_intv = U32_MAX;
430 hlist_add_head_rcu(&n->hash, &tn->node_htable[tipc_hashfn(addr)]);
431 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
432 if (n->addr < temp_node->addr)
433 break;
434 }
435 list_add_tail_rcu(&n->list, &temp_node->list);
436 trace_tipc_node_create(n, true, " ");
437 exit:
438 spin_unlock_bh(&tn->node_list_lock);
439 return n;
440 }
441
442 static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l)
443 {
444 unsigned long tol = tipc_link_tolerance(l);
445 unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4;
446
447 /* Link with lowest tolerance determines timer interval */
448 if (intv < n->keepalive_intv)
449 n->keepalive_intv = intv;
450
451 /* Ensure link's abort limit corresponds to current tolerance */
452 tipc_link_set_abort_limit(l, tol / n->keepalive_intv);
453 }
454
455 static void tipc_node_delete_from_list(struct tipc_node *node)
456 {
457 list_del_rcu(&node->list);
458 hlist_del_rcu(&node->hash);
459 tipc_node_put(node);
460 }
461
462 static void tipc_node_delete(struct tipc_node *node)
463 {
464 trace_tipc_node_delete(node, true, " ");
465 tipc_node_delete_from_list(node);
466
467 del_timer_sync(&node->timer);
468 tipc_node_put(node);
469 }
470
471 void tipc_node_stop(struct net *net)
472 {
473 struct tipc_net *tn = tipc_net(net);
474 struct tipc_node *node, *t_node;
475
476 spin_lock_bh(&tn->node_list_lock);
477 list_for_each_entry_safe(node, t_node, &tn->node_list, list)
478 tipc_node_delete(node);
479 spin_unlock_bh(&tn->node_list_lock);
480 }
481
482 void tipc_node_subscribe(struct net *net, struct list_head *subscr, u32 addr)
483 {
484 struct tipc_node *n;
485
486 if (in_own_node(net, addr))
487 return;
488
489 n = tipc_node_find(net, addr);
490 if (!n) {
491 pr_warn("Node subscribe rejected, unknown node 0x%x\n", addr);
492 return;
493 }
494 tipc_node_write_lock(n);
495 list_add_tail(subscr, &n->publ_list);
496 tipc_node_write_unlock_fast(n);
497 tipc_node_put(n);
498 }
499
500 void tipc_node_unsubscribe(struct net *net, struct list_head *subscr, u32 addr)
501 {
502 struct tipc_node *n;
503
504 if (in_own_node(net, addr))
505 return;
506
507 n = tipc_node_find(net, addr);
508 if (!n) {
509 pr_warn("Node unsubscribe rejected, unknown node 0x%x\n", addr);
510 return;
511 }
512 tipc_node_write_lock(n);
513 list_del_init(subscr);
514 tipc_node_write_unlock_fast(n);
515 tipc_node_put(n);
516 }
517
518 int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port)
519 {
520 struct tipc_node *node;
521 struct tipc_sock_conn *conn;
522 int err = 0;
523
524 if (in_own_node(net, dnode))
525 return 0;
526
527 node = tipc_node_find(net, dnode);
528 if (!node) {
529 pr_warn("Connecting sock to node 0x%x failed\n", dnode);
530 return -EHOSTUNREACH;
531 }
532 conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
533 if (!conn) {
534 err = -EHOSTUNREACH;
535 goto exit;
536 }
537 conn->peer_node = dnode;
538 conn->port = port;
539 conn->peer_port = peer_port;
540
541 tipc_node_write_lock(node);
542 list_add_tail(&conn->list, &node->conn_sks);
543 tipc_node_write_unlock(node);
544 exit:
545 tipc_node_put(node);
546 return err;
547 }
548
549 void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port)
550 {
551 struct tipc_node *node;
552 struct tipc_sock_conn *conn, *safe;
553
554 if (in_own_node(net, dnode))
555 return;
556
557 node = tipc_node_find(net, dnode);
558 if (!node)
559 return;
560
561 tipc_node_write_lock(node);
562 list_for_each_entry_safe(conn, safe, &node->conn_sks, list) {
563 if (port != conn->port)
564 continue;
565 list_del(&conn->list);
566 kfree(conn);
567 }
568 tipc_node_write_unlock(node);
569 tipc_node_put(node);
570 }
571
572 static void tipc_node_clear_links(struct tipc_node *node)
573 {
574 int i;
575
576 for (i = 0; i < MAX_BEARERS; i++) {
577 struct tipc_link_entry *le = &node->links[i];
578
579 if (le->link) {
580 kfree(le->link);
581 le->link = NULL;
582 node->link_cnt--;
583 }
584 }
585 }
586
587 /* tipc_node_cleanup - delete nodes that does not
588 * have active links for NODE_CLEANUP_AFTER time
589 */
590 static bool tipc_node_cleanup(struct tipc_node *peer)
591 {
592 struct tipc_net *tn = tipc_net(peer->net);
593 bool deleted = false;
594
595 /* If lock held by tipc_node_stop() the node will be deleted anyway */
596 if (!spin_trylock_bh(&tn->node_list_lock))
597 return false;
598
599 tipc_node_write_lock(peer);
600
601 if (!node_is_up(peer) && time_after(jiffies, peer->delete_at)) {
602 tipc_node_clear_links(peer);
603 tipc_node_delete_from_list(peer);
604 deleted = true;
605 }
606 tipc_node_write_unlock(peer);
607 spin_unlock_bh(&tn->node_list_lock);
608 return deleted;
609 }
610
611 /* tipc_node_timeout - handle expiration of node timer
612 */
613 static void tipc_node_timeout(struct timer_list *t)
614 {
615 struct tipc_node *n = from_timer(n, t, timer);
616 struct tipc_link_entry *le;
617 struct sk_buff_head xmitq;
618 int remains = n->link_cnt;
619 int bearer_id;
620 int rc = 0;
621
622 trace_tipc_node_timeout(n, false, " ");
623 if (!node_is_up(n) && tipc_node_cleanup(n)) {
624 /*Removing the reference of Timer*/
625 tipc_node_put(n);
626 return;
627 }
628
629 __skb_queue_head_init(&xmitq);
630
631 /* Initial node interval to value larger (10 seconds), then it will be
632 * recalculated with link lowest tolerance
633 */
634 tipc_node_read_lock(n);
635 n->keepalive_intv = 10000;
636 tipc_node_read_unlock(n);
637 for (bearer_id = 0; remains && (bearer_id < MAX_BEARERS); bearer_id++) {
638 tipc_node_read_lock(n);
639 le = &n->links[bearer_id];
640 if (le->link) {
641 spin_lock_bh(&le->lock);
642 /* Link tolerance may change asynchronously: */
643 tipc_node_calculate_timer(n, le->link);
644 rc = tipc_link_timeout(le->link, &xmitq);
645 spin_unlock_bh(&le->lock);
646 remains--;
647 }
648 tipc_node_read_unlock(n);
649 tipc_bearer_xmit(n->net, bearer_id, &xmitq, &le->maddr);
650 if (rc & TIPC_LINK_DOWN_EVT)
651 tipc_node_link_down(n, bearer_id, false);
652 }
653 mod_timer(&n->timer, jiffies + msecs_to_jiffies(n->keepalive_intv));
654 }
655
656 /**
657 * __tipc_node_link_up - handle addition of link
658 * Node lock must be held by caller
659 * Link becomes active (alone or shared) or standby, depending on its priority.
660 */
661 static void __tipc_node_link_up(struct tipc_node *n, int bearer_id,
662 struct sk_buff_head *xmitq)
663 {
664 int *slot0 = &n->active_links[0];
665 int *slot1 = &n->active_links[1];
666 struct tipc_link *ol = node_active_link(n, 0);
667 struct tipc_link *nl = n->links[bearer_id].link;
668
669 if (!nl || tipc_link_is_up(nl))
670 return;
671
672 tipc_link_fsm_evt(nl, LINK_ESTABLISH_EVT);
673 if (!tipc_link_is_up(nl))
674 return;
675
676 n->working_links++;
677 n->action_flags |= TIPC_NOTIFY_LINK_UP;
678 n->link_id = tipc_link_id(nl);
679
680 /* Leave room for tunnel header when returning 'mtu' to users: */
681 n->links[bearer_id].mtu = tipc_link_mtu(nl) - INT_H_SIZE;
682
683 tipc_bearer_add_dest(n->net, bearer_id, n->addr);
684 tipc_bcast_inc_bearer_dst_cnt(n->net, bearer_id);
685
686 pr_debug("Established link <%s> on network plane %c\n",
687 tipc_link_name(nl), tipc_link_plane(nl));
688 trace_tipc_node_link_up(n, true, " ");
689
690 /* Ensure that a STATE message goes first */
691 tipc_link_build_state_msg(nl, xmitq);
692
693 /* First link? => give it both slots */
694 if (!ol) {
695 *slot0 = bearer_id;
696 *slot1 = bearer_id;
697 tipc_node_fsm_evt(n, SELF_ESTABL_CONTACT_EVT);
698 n->failover_sent = false;
699 n->action_flags |= TIPC_NOTIFY_NODE_UP;
700 tipc_link_set_active(nl, true);
701 tipc_bcast_add_peer(n->net, nl, xmitq);
702 return;
703 }
704
705 /* Second link => redistribute slots */
706 if (tipc_link_prio(nl) > tipc_link_prio(ol)) {
707 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol));
708 *slot0 = bearer_id;
709 *slot1 = bearer_id;
710 tipc_link_set_active(nl, true);
711 tipc_link_set_active(ol, false);
712 } else if (tipc_link_prio(nl) == tipc_link_prio(ol)) {
713 tipc_link_set_active(nl, true);
714 *slot1 = bearer_id;
715 } else {
716 pr_debug("New link <%s> is standby\n", tipc_link_name(nl));
717 }
718
719 /* Prepare synchronization with first link */
720 tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
721 }
722
723 /**
724 * tipc_node_link_up - handle addition of link
725 *
726 * Link becomes active (alone or shared) or standby, depending on its priority.
727 */
728 static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
729 struct sk_buff_head *xmitq)
730 {
731 struct tipc_media_addr *maddr;
732
733 tipc_node_write_lock(n);
734 __tipc_node_link_up(n, bearer_id, xmitq);
735 maddr = &n->links[bearer_id].maddr;
736 tipc_bearer_xmit(n->net, bearer_id, xmitq, maddr);
737 tipc_node_write_unlock(n);
738 }
739
740 /**
741 * __tipc_node_link_down - handle loss of link
742 */
743 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
744 struct sk_buff_head *xmitq,
745 struct tipc_media_addr **maddr)
746 {
747 struct tipc_link_entry *le = &n->links[*bearer_id];
748 int *slot0 = &n->active_links[0];
749 int *slot1 = &n->active_links[1];
750 int i, highest = 0, prio;
751 struct tipc_link *l, *_l, *tnl;
752
753 l = n->links[*bearer_id].link;
754 if (!l || tipc_link_is_reset(l))
755 return;
756
757 n->working_links--;
758 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
759 n->link_id = tipc_link_id(l);
760
761 tipc_bearer_remove_dest(n->net, *bearer_id, n->addr);
762
763 pr_debug("Lost link <%s> on network plane %c\n",
764 tipc_link_name(l), tipc_link_plane(l));
765
766 /* Select new active link if any available */
767 *slot0 = INVALID_BEARER_ID;
768 *slot1 = INVALID_BEARER_ID;
769 for (i = 0; i < MAX_BEARERS; i++) {
770 _l = n->links[i].link;
771 if (!_l || !tipc_link_is_up(_l))
772 continue;
773 if (_l == l)
774 continue;
775 prio = tipc_link_prio(_l);
776 if (prio < highest)
777 continue;
778 if (prio > highest) {
779 highest = prio;
780 *slot0 = i;
781 *slot1 = i;
782 continue;
783 }
784 *slot1 = i;
785 }
786
787 if (!node_is_up(n)) {
788 if (tipc_link_peer_is_down(l))
789 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
790 tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT);
791 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down!");
792 tipc_link_fsm_evt(l, LINK_RESET_EVT);
793 tipc_link_reset(l);
794 tipc_link_build_reset_msg(l, xmitq);
795 *maddr = &n->links[*bearer_id].maddr;
796 node_lost_contact(n, &le->inputq);
797 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
798 return;
799 }
800 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
801
802 /* There is still a working link => initiate failover */
803 *bearer_id = n->active_links[0];
804 tnl = n->links[*bearer_id].link;
805 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
806 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
807 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
808 tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq);
809 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down -> failover!");
810 tipc_link_reset(l);
811 tipc_link_fsm_evt(l, LINK_RESET_EVT);
812 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
813 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
814 *maddr = &n->links[*bearer_id].maddr;
815 }
816
817 static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete)
818 {
819 struct tipc_link_entry *le = &n->links[bearer_id];
820 struct tipc_link *l = le->link;
821 struct tipc_media_addr *maddr;
822 struct sk_buff_head xmitq;
823 int old_bearer_id = bearer_id;
824
825 if (!l)
826 return;
827
828 __skb_queue_head_init(&xmitq);
829
830 tipc_node_write_lock(n);
831 if (!tipc_link_is_establishing(l)) {
832 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
833 if (delete) {
834 kfree(l);
835 le->link = NULL;
836 n->link_cnt--;
837 }
838 } else {
839 /* Defuse pending tipc_node_link_up() */
840 tipc_link_fsm_evt(l, LINK_RESET_EVT);
841 }
842 trace_tipc_node_link_down(n, true, "node link down or deleted!");
843 tipc_node_write_unlock(n);
844 if (delete)
845 tipc_mon_remove_peer(n->net, n->addr, old_bearer_id);
846 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
847 tipc_sk_rcv(n->net, &le->inputq);
848 }
849
850 static bool node_is_up(struct tipc_node *n)
851 {
852 return n->active_links[0] != INVALID_BEARER_ID;
853 }
854
855 bool tipc_node_is_up(struct net *net, u32 addr)
856 {
857 struct tipc_node *n;
858 bool retval = false;
859
860 if (in_own_node(net, addr))
861 return true;
862
863 n = tipc_node_find(net, addr);
864 if (!n)
865 return false;
866 retval = node_is_up(n);
867 tipc_node_put(n);
868 return retval;
869 }
870
871 static u32 tipc_node_suggest_addr(struct net *net, u32 addr)
872 {
873 struct tipc_node *n;
874
875 addr ^= tipc_net(net)->random;
876 while ((n = tipc_node_find(net, addr))) {
877 tipc_node_put(n);
878 addr++;
879 }
880 return addr;
881 }
882
883 /* tipc_node_try_addr(): Check if addr can be used by peer, suggest other if not
884 * Returns suggested address if any, otherwise 0
885 */
886 u32 tipc_node_try_addr(struct net *net, u8 *id, u32 addr)
887 {
888 struct tipc_net *tn = tipc_net(net);
889 struct tipc_node *n;
890
891 /* Suggest new address if some other peer is using this one */
892 n = tipc_node_find(net, addr);
893 if (n) {
894 if (!memcmp(n->peer_id, id, NODE_ID_LEN))
895 addr = 0;
896 tipc_node_put(n);
897 if (!addr)
898 return 0;
899 return tipc_node_suggest_addr(net, addr);
900 }
901
902 /* Suggest previously used address if peer is known */
903 n = tipc_node_find_by_id(net, id);
904 if (n) {
905 addr = n->addr;
906 tipc_node_put(n);
907 return addr;
908 }
909
910 /* Even this node may be in conflict */
911 if (tn->trial_addr == addr)
912 return tipc_node_suggest_addr(net, addr);
913
914 return 0;
915 }
916
917 void tipc_node_check_dest(struct net *net, u32 addr,
918 u8 *peer_id, struct tipc_bearer *b,
919 u16 capabilities, u32 signature,
920 struct tipc_media_addr *maddr,
921 bool *respond, bool *dupl_addr)
922 {
923 struct tipc_node *n;
924 struct tipc_link *l;
925 struct tipc_link_entry *le;
926 bool addr_match = false;
927 bool sign_match = false;
928 bool link_up = false;
929 bool accept_addr = false;
930 bool reset = true;
931 char *if_name;
932 unsigned long intv;
933 u16 session;
934
935 *dupl_addr = false;
936 *respond = false;
937
938 n = tipc_node_create(net, addr, peer_id, capabilities);
939 if (!n)
940 return;
941
942 tipc_node_write_lock(n);
943
944 le = &n->links[b->identity];
945
946 /* Prepare to validate requesting node's signature and media address */
947 l = le->link;
948 link_up = l && tipc_link_is_up(l);
949 addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
950 sign_match = (signature == n->signature);
951
952 /* These three flags give us eight permutations: */
953
954 if (sign_match && addr_match && link_up) {
955 /* All is fine. Do nothing. */
956 reset = false;
957 } else if (sign_match && addr_match && !link_up) {
958 /* Respond. The link will come up in due time */
959 *respond = true;
960 } else if (sign_match && !addr_match && link_up) {
961 /* Peer has changed i/f address without rebooting.
962 * If so, the link will reset soon, and the next
963 * discovery will be accepted. So we can ignore it.
964 * It may also be an cloned or malicious peer having
965 * chosen the same node address and signature as an
966 * existing one.
967 * Ignore requests until the link goes down, if ever.
968 */
969 *dupl_addr = true;
970 } else if (sign_match && !addr_match && !link_up) {
971 /* Peer link has changed i/f address without rebooting.
972 * It may also be a cloned or malicious peer; we can't
973 * distinguish between the two.
974 * The signature is correct, so we must accept.
975 */
976 accept_addr = true;
977 *respond = true;
978 } else if (!sign_match && addr_match && link_up) {
979 /* Peer node rebooted. Two possibilities:
980 * - Delayed re-discovery; this link endpoint has already
981 * reset and re-established contact with the peer, before
982 * receiving a discovery message from that node.
983 * (The peer happened to receive one from this node first).
984 * - The peer came back so fast that our side has not
985 * discovered it yet. Probing from this side will soon
986 * reset the link, since there can be no working link
987 * endpoint at the peer end, and the link will re-establish.
988 * Accept the signature, since it comes from a known peer.
989 */
990 n->signature = signature;
991 } else if (!sign_match && addr_match && !link_up) {
992 /* The peer node has rebooted.
993 * Accept signature, since it is a known peer.
994 */
995 n->signature = signature;
996 *respond = true;
997 } else if (!sign_match && !addr_match && link_up) {
998 /* Peer rebooted with new address, or a new/duplicate peer.
999 * Ignore until the link goes down, if ever.
1000 */
1001 *dupl_addr = true;
1002 } else if (!sign_match && !addr_match && !link_up) {
1003 /* Peer rebooted with new address, or it is a new peer.
1004 * Accept signature and address.
1005 */
1006 n->signature = signature;
1007 accept_addr = true;
1008 *respond = true;
1009 }
1010
1011 if (!accept_addr)
1012 goto exit;
1013
1014 /* Now create new link if not already existing */
1015 if (!l) {
1016 if (n->link_cnt == 2)
1017 goto exit;
1018
1019 if_name = strchr(b->name, ':') + 1;
1020 get_random_bytes(&session, sizeof(u16));
1021 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
1022 b->net_plane, b->mtu, b->priority,
1023 b->window, session,
1024 tipc_own_addr(net), addr, peer_id,
1025 n->capabilities,
1026 tipc_bc_sndlink(n->net), n->bc_entry.link,
1027 &le->inputq,
1028 &n->bc_entry.namedq, &l)) {
1029 *respond = false;
1030 goto exit;
1031 }
1032 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link created!");
1033 tipc_link_reset(l);
1034 tipc_link_fsm_evt(l, LINK_RESET_EVT);
1035 if (n->state == NODE_FAILINGOVER)
1036 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
1037 le->link = l;
1038 n->link_cnt++;
1039 tipc_node_calculate_timer(n, l);
1040 if (n->link_cnt == 1) {
1041 intv = jiffies + msecs_to_jiffies(n->keepalive_intv);
1042 if (!mod_timer(&n->timer, intv))
1043 tipc_node_get(n);
1044 }
1045 }
1046 memcpy(&le->maddr, maddr, sizeof(*maddr));
1047 exit:
1048 tipc_node_write_unlock(n);
1049 if (reset && l && !tipc_link_is_reset(l))
1050 tipc_node_link_down(n, b->identity, false);
1051 tipc_node_put(n);
1052 }
1053
1054 void tipc_node_delete_links(struct net *net, int bearer_id)
1055 {
1056 struct tipc_net *tn = net_generic(net, tipc_net_id);
1057 struct tipc_node *n;
1058
1059 rcu_read_lock();
1060 list_for_each_entry_rcu(n, &tn->node_list, list) {
1061 tipc_node_link_down(n, bearer_id, true);
1062 }
1063 rcu_read_unlock();
1064 }
1065
1066 static void tipc_node_reset_links(struct tipc_node *n)
1067 {
1068 int i;
1069
1070 pr_warn("Resetting all links to %x\n", n->addr);
1071
1072 trace_tipc_node_reset_links(n, true, " ");
1073 for (i = 0; i < MAX_BEARERS; i++) {
1074 tipc_node_link_down(n, i, false);
1075 }
1076 }
1077
1078 /* tipc_node_fsm_evt - node finite state machine
1079 * Determines when contact is allowed with peer node
1080 */
1081 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
1082 {
1083 int state = n->state;
1084
1085 switch (state) {
1086 case SELF_DOWN_PEER_DOWN:
1087 switch (evt) {
1088 case SELF_ESTABL_CONTACT_EVT:
1089 state = SELF_UP_PEER_COMING;
1090 break;
1091 case PEER_ESTABL_CONTACT_EVT:
1092 state = SELF_COMING_PEER_UP;
1093 break;
1094 case SELF_LOST_CONTACT_EVT:
1095 case PEER_LOST_CONTACT_EVT:
1096 break;
1097 case NODE_SYNCH_END_EVT:
1098 case NODE_SYNCH_BEGIN_EVT:
1099 case NODE_FAILOVER_BEGIN_EVT:
1100 case NODE_FAILOVER_END_EVT:
1101 default:
1102 goto illegal_evt;
1103 }
1104 break;
1105 case SELF_UP_PEER_UP:
1106 switch (evt) {
1107 case SELF_LOST_CONTACT_EVT:
1108 state = SELF_DOWN_PEER_LEAVING;
1109 break;
1110 case PEER_LOST_CONTACT_EVT:
1111 state = SELF_LEAVING_PEER_DOWN;
1112 break;
1113 case NODE_SYNCH_BEGIN_EVT:
1114 state = NODE_SYNCHING;
1115 break;
1116 case NODE_FAILOVER_BEGIN_EVT:
1117 state = NODE_FAILINGOVER;
1118 break;
1119 case SELF_ESTABL_CONTACT_EVT:
1120 case PEER_ESTABL_CONTACT_EVT:
1121 case NODE_SYNCH_END_EVT:
1122 case NODE_FAILOVER_END_EVT:
1123 break;
1124 default:
1125 goto illegal_evt;
1126 }
1127 break;
1128 case SELF_DOWN_PEER_LEAVING:
1129 switch (evt) {
1130 case PEER_LOST_CONTACT_EVT:
1131 state = SELF_DOWN_PEER_DOWN;
1132 break;
1133 case SELF_ESTABL_CONTACT_EVT:
1134 case PEER_ESTABL_CONTACT_EVT:
1135 case SELF_LOST_CONTACT_EVT:
1136 break;
1137 case NODE_SYNCH_END_EVT:
1138 case NODE_SYNCH_BEGIN_EVT:
1139 case NODE_FAILOVER_BEGIN_EVT:
1140 case NODE_FAILOVER_END_EVT:
1141 default:
1142 goto illegal_evt;
1143 }
1144 break;
1145 case SELF_UP_PEER_COMING:
1146 switch (evt) {
1147 case PEER_ESTABL_CONTACT_EVT:
1148 state = SELF_UP_PEER_UP;
1149 break;
1150 case SELF_LOST_CONTACT_EVT:
1151 state = SELF_DOWN_PEER_DOWN;
1152 break;
1153 case SELF_ESTABL_CONTACT_EVT:
1154 case PEER_LOST_CONTACT_EVT:
1155 case NODE_SYNCH_END_EVT:
1156 case NODE_FAILOVER_BEGIN_EVT:
1157 break;
1158 case NODE_SYNCH_BEGIN_EVT:
1159 case NODE_FAILOVER_END_EVT:
1160 default:
1161 goto illegal_evt;
1162 }
1163 break;
1164 case SELF_COMING_PEER_UP:
1165 switch (evt) {
1166 case SELF_ESTABL_CONTACT_EVT:
1167 state = SELF_UP_PEER_UP;
1168 break;
1169 case PEER_LOST_CONTACT_EVT:
1170 state = SELF_DOWN_PEER_DOWN;
1171 break;
1172 case SELF_LOST_CONTACT_EVT:
1173 case PEER_ESTABL_CONTACT_EVT:
1174 break;
1175 case NODE_SYNCH_END_EVT:
1176 case NODE_SYNCH_BEGIN_EVT:
1177 case NODE_FAILOVER_BEGIN_EVT:
1178 case NODE_FAILOVER_END_EVT:
1179 default:
1180 goto illegal_evt;
1181 }
1182 break;
1183 case SELF_LEAVING_PEER_DOWN:
1184 switch (evt) {
1185 case SELF_LOST_CONTACT_EVT:
1186 state = SELF_DOWN_PEER_DOWN;
1187 break;
1188 case SELF_ESTABL_CONTACT_EVT:
1189 case PEER_ESTABL_CONTACT_EVT:
1190 case PEER_LOST_CONTACT_EVT:
1191 break;
1192 case NODE_SYNCH_END_EVT:
1193 case NODE_SYNCH_BEGIN_EVT:
1194 case NODE_FAILOVER_BEGIN_EVT:
1195 case NODE_FAILOVER_END_EVT:
1196 default:
1197 goto illegal_evt;
1198 }
1199 break;
1200 case NODE_FAILINGOVER:
1201 switch (evt) {
1202 case SELF_LOST_CONTACT_EVT:
1203 state = SELF_DOWN_PEER_LEAVING;
1204 break;
1205 case PEER_LOST_CONTACT_EVT:
1206 state = SELF_LEAVING_PEER_DOWN;
1207 break;
1208 case NODE_FAILOVER_END_EVT:
1209 state = SELF_UP_PEER_UP;
1210 break;
1211 case NODE_FAILOVER_BEGIN_EVT:
1212 case SELF_ESTABL_CONTACT_EVT:
1213 case PEER_ESTABL_CONTACT_EVT:
1214 break;
1215 case NODE_SYNCH_BEGIN_EVT:
1216 case NODE_SYNCH_END_EVT:
1217 default:
1218 goto illegal_evt;
1219 }
1220 break;
1221 case NODE_SYNCHING:
1222 switch (evt) {
1223 case SELF_LOST_CONTACT_EVT:
1224 state = SELF_DOWN_PEER_LEAVING;
1225 break;
1226 case PEER_LOST_CONTACT_EVT:
1227 state = SELF_LEAVING_PEER_DOWN;
1228 break;
1229 case NODE_SYNCH_END_EVT:
1230 state = SELF_UP_PEER_UP;
1231 break;
1232 case NODE_FAILOVER_BEGIN_EVT:
1233 state = NODE_FAILINGOVER;
1234 break;
1235 case NODE_SYNCH_BEGIN_EVT:
1236 case SELF_ESTABL_CONTACT_EVT:
1237 case PEER_ESTABL_CONTACT_EVT:
1238 break;
1239 case NODE_FAILOVER_END_EVT:
1240 default:
1241 goto illegal_evt;
1242 }
1243 break;
1244 default:
1245 pr_err("Unknown node fsm state %x\n", state);
1246 break;
1247 }
1248 trace_tipc_node_fsm(n->peer_id, n->state, state, evt);
1249 n->state = state;
1250 return;
1251
1252 illegal_evt:
1253 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
1254 trace_tipc_node_fsm(n->peer_id, n->state, state, evt);
1255 }
1256
1257 static void node_lost_contact(struct tipc_node *n,
1258 struct sk_buff_head *inputq)
1259 {
1260 struct tipc_sock_conn *conn, *safe;
1261 struct tipc_link *l;
1262 struct list_head *conns = &n->conn_sks;
1263 struct sk_buff *skb;
1264 uint i;
1265
1266 pr_debug("Lost contact with %x\n", n->addr);
1267 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
1268 trace_tipc_node_lost_contact(n, true, " ");
1269
1270 /* Clean up broadcast state */
1271 tipc_bcast_remove_peer(n->net, n->bc_entry.link);
1272
1273 /* Abort any ongoing link failover */
1274 for (i = 0; i < MAX_BEARERS; i++) {
1275 l = n->links[i].link;
1276 if (l)
1277 tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
1278 }
1279
1280 /* Notify publications from this node */
1281 n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
1282
1283 /* Notify sockets connected to node */
1284 list_for_each_entry_safe(conn, safe, conns, list) {
1285 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
1286 SHORT_H_SIZE, 0, tipc_own_addr(n->net),
1287 conn->peer_node, conn->port,
1288 conn->peer_port, TIPC_ERR_NO_NODE);
1289 if (likely(skb))
1290 skb_queue_tail(inputq, skb);
1291 list_del(&conn->list);
1292 kfree(conn);
1293 }
1294 }
1295
1296 /**
1297 * tipc_node_get_linkname - get the name of a link
1298 *
1299 * @bearer_id: id of the bearer
1300 * @node: peer node address
1301 * @linkname: link name output buffer
1302 *
1303 * Returns 0 on success
1304 */
1305 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1306 char *linkname, size_t len)
1307 {
1308 struct tipc_link *link;
1309 int err = -EINVAL;
1310 struct tipc_node *node = tipc_node_find(net, addr);
1311
1312 if (!node)
1313 return err;
1314
1315 if (bearer_id >= MAX_BEARERS)
1316 goto exit;
1317
1318 tipc_node_read_lock(node);
1319 link = node->links[bearer_id].link;
1320 if (link) {
1321 strncpy(linkname, tipc_link_name(link), len);
1322 err = 0;
1323 }
1324 tipc_node_read_unlock(node);
1325 exit:
1326 tipc_node_put(node);
1327 return err;
1328 }
1329
1330 /* Caller should hold node lock for the passed node */
1331 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
1332 {
1333 void *hdr;
1334 struct nlattr *attrs;
1335
1336 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1337 NLM_F_MULTI, TIPC_NL_NODE_GET);
1338 if (!hdr)
1339 return -EMSGSIZE;
1340
1341 attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE);
1342 if (!attrs)
1343 goto msg_full;
1344
1345 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1346 goto attr_msg_full;
1347 if (node_is_up(node))
1348 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1349 goto attr_msg_full;
1350
1351 nla_nest_end(msg->skb, attrs);
1352 genlmsg_end(msg->skb, hdr);
1353
1354 return 0;
1355
1356 attr_msg_full:
1357 nla_nest_cancel(msg->skb, attrs);
1358 msg_full:
1359 genlmsg_cancel(msg->skb, hdr);
1360
1361 return -EMSGSIZE;
1362 }
1363
1364 /**
1365 * tipc_node_xmit() is the general link level function for message sending
1366 * @net: the applicable net namespace
1367 * @list: chain of buffers containing message
1368 * @dnode: address of destination node
1369 * @selector: a number used for deterministic link selection
1370 * Consumes the buffer chain.
1371 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
1372 */
1373 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1374 u32 dnode, int selector)
1375 {
1376 struct tipc_link_entry *le = NULL;
1377 struct tipc_node *n;
1378 struct sk_buff_head xmitq;
1379 int bearer_id;
1380 int rc;
1381
1382 if (in_own_node(net, dnode)) {
1383 tipc_sk_rcv(net, list);
1384 return 0;
1385 }
1386
1387 n = tipc_node_find(net, dnode);
1388 if (unlikely(!n)) {
1389 skb_queue_purge(list);
1390 return -EHOSTUNREACH;
1391 }
1392
1393 tipc_node_read_lock(n);
1394 bearer_id = n->active_links[selector & 1];
1395 if (unlikely(bearer_id == INVALID_BEARER_ID)) {
1396 tipc_node_read_unlock(n);
1397 tipc_node_put(n);
1398 skb_queue_purge(list);
1399 return -EHOSTUNREACH;
1400 }
1401
1402 __skb_queue_head_init(&xmitq);
1403 le = &n->links[bearer_id];
1404 spin_lock_bh(&le->lock);
1405 rc = tipc_link_xmit(le->link, list, &xmitq);
1406 spin_unlock_bh(&le->lock);
1407 tipc_node_read_unlock(n);
1408
1409 if (unlikely(rc == -ENOBUFS))
1410 tipc_node_link_down(n, bearer_id, false);
1411 else
1412 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1413
1414 tipc_node_put(n);
1415
1416 return rc;
1417 }
1418
1419 /* tipc_node_xmit_skb(): send single buffer to destination
1420 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1421 * messages, which will not be rejected
1422 * The only exception is datagram messages rerouted after secondary
1423 * lookup, which are rare and safe to dispose of anyway.
1424 */
1425 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1426 u32 selector)
1427 {
1428 struct sk_buff_head head;
1429
1430 skb_queue_head_init(&head);
1431 __skb_queue_tail(&head, skb);
1432 tipc_node_xmit(net, &head, dnode, selector);
1433 return 0;
1434 }
1435
1436 /* tipc_node_distr_xmit(): send single buffer msgs to individual destinations
1437 * Note: this is only for SYSTEM_IMPORTANCE messages, which cannot be rejected
1438 */
1439 int tipc_node_distr_xmit(struct net *net, struct sk_buff_head *xmitq)
1440 {
1441 struct sk_buff *skb;
1442 u32 selector, dnode;
1443
1444 while ((skb = __skb_dequeue(xmitq))) {
1445 selector = msg_origport(buf_msg(skb));
1446 dnode = msg_destnode(buf_msg(skb));
1447 tipc_node_xmit_skb(net, skb, dnode, selector);
1448 }
1449 return 0;
1450 }
1451
1452 void tipc_node_broadcast(struct net *net, struct sk_buff *skb)
1453 {
1454 struct sk_buff *txskb;
1455 struct tipc_node *n;
1456 u32 dst;
1457
1458 rcu_read_lock();
1459 list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1460 dst = n->addr;
1461 if (in_own_node(net, dst))
1462 continue;
1463 if (!node_is_up(n))
1464 continue;
1465 txskb = pskb_copy(skb, GFP_ATOMIC);
1466 if (!txskb)
1467 break;
1468 msg_set_destnode(buf_msg(txskb), dst);
1469 tipc_node_xmit_skb(net, txskb, dst, 0);
1470 }
1471 rcu_read_unlock();
1472
1473 kfree_skb(skb);
1474 }
1475
1476 static void tipc_node_mcast_rcv(struct tipc_node *n)
1477 {
1478 struct tipc_bclink_entry *be = &n->bc_entry;
1479
1480 /* 'arrvq' is under inputq2's lock protection */
1481 spin_lock_bh(&be->inputq2.lock);
1482 spin_lock_bh(&be->inputq1.lock);
1483 skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1484 spin_unlock_bh(&be->inputq1.lock);
1485 spin_unlock_bh(&be->inputq2.lock);
1486 tipc_sk_mcast_rcv(n->net, &be->arrvq, &be->inputq2);
1487 }
1488
1489 static void tipc_node_bc_sync_rcv(struct tipc_node *n, struct tipc_msg *hdr,
1490 int bearer_id, struct sk_buff_head *xmitq)
1491 {
1492 struct tipc_link *ucl;
1493 int rc;
1494
1495 rc = tipc_bcast_sync_rcv(n->net, n->bc_entry.link, hdr);
1496
1497 if (rc & TIPC_LINK_DOWN_EVT) {
1498 tipc_node_reset_links(n);
1499 return;
1500 }
1501
1502 if (!(rc & TIPC_LINK_SND_STATE))
1503 return;
1504
1505 /* If probe message, a STATE response will be sent anyway */
1506 if (msg_probe(hdr))
1507 return;
1508
1509 /* Produce a STATE message carrying broadcast NACK */
1510 tipc_node_read_lock(n);
1511 ucl = n->links[bearer_id].link;
1512 if (ucl)
1513 tipc_link_build_state_msg(ucl, xmitq);
1514 tipc_node_read_unlock(n);
1515 }
1516
1517 /**
1518 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1519 * @net: the applicable net namespace
1520 * @skb: TIPC packet
1521 * @bearer_id: id of bearer message arrived on
1522 *
1523 * Invoked with no locks held.
1524 */
1525 static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
1526 {
1527 int rc;
1528 struct sk_buff_head xmitq;
1529 struct tipc_bclink_entry *be;
1530 struct tipc_link_entry *le;
1531 struct tipc_msg *hdr = buf_msg(skb);
1532 int usr = msg_user(hdr);
1533 u32 dnode = msg_destnode(hdr);
1534 struct tipc_node *n;
1535
1536 __skb_queue_head_init(&xmitq);
1537
1538 /* If NACK for other node, let rcv link for that node peek into it */
1539 if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1540 n = tipc_node_find(net, dnode);
1541 else
1542 n = tipc_node_find(net, msg_prevnode(hdr));
1543 if (!n) {
1544 kfree_skb(skb);
1545 return;
1546 }
1547 be = &n->bc_entry;
1548 le = &n->links[bearer_id];
1549
1550 rc = tipc_bcast_rcv(net, be->link, skb);
1551
1552 /* Broadcast ACKs are sent on a unicast link */
1553 if (rc & TIPC_LINK_SND_STATE) {
1554 tipc_node_read_lock(n);
1555 tipc_link_build_state_msg(le->link, &xmitq);
1556 tipc_node_read_unlock(n);
1557 }
1558
1559 if (!skb_queue_empty(&xmitq))
1560 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1561
1562 if (!skb_queue_empty(&be->inputq1))
1563 tipc_node_mcast_rcv(n);
1564
1565 /* Handle NAME_DISTRIBUTOR messages sent from 1.7 nodes */
1566 if (!skb_queue_empty(&n->bc_entry.namedq))
1567 tipc_named_rcv(net, &n->bc_entry.namedq);
1568
1569 /* If reassembly or retransmission failure => reset all links to peer */
1570 if (rc & TIPC_LINK_DOWN_EVT)
1571 tipc_node_reset_links(n);
1572
1573 tipc_node_put(n);
1574 }
1575
1576 /**
1577 * tipc_node_check_state - check and if necessary update node state
1578 * @skb: TIPC packet
1579 * @bearer_id: identity of bearer delivering the packet
1580 * Returns true if state and msg are ok, otherwise false
1581 */
1582 static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
1583 int bearer_id, struct sk_buff_head *xmitq)
1584 {
1585 struct tipc_msg *hdr = buf_msg(skb);
1586 int usr = msg_user(hdr);
1587 int mtyp = msg_type(hdr);
1588 u16 oseqno = msg_seqno(hdr);
1589 u16 iseqno = msg_seqno(msg_get_wrapped(hdr));
1590 u16 exp_pkts = msg_msgcnt(hdr);
1591 u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
1592 int state = n->state;
1593 struct tipc_link *l, *tnl, *pl = NULL;
1594 struct tipc_media_addr *maddr;
1595 int pb_id;
1596
1597 if (trace_tipc_node_check_state_enabled()) {
1598 trace_tipc_skb_dump(skb, false, "skb for node state check");
1599 trace_tipc_node_check_state(n, true, " ");
1600 }
1601 l = n->links[bearer_id].link;
1602 if (!l)
1603 return false;
1604 rcv_nxt = tipc_link_rcv_nxt(l);
1605
1606
1607 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1608 return true;
1609
1610 /* Find parallel link, if any */
1611 for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1612 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1613 pl = n->links[pb_id].link;
1614 break;
1615 }
1616 }
1617
1618 if (!tipc_link_validate_msg(l, hdr)) {
1619 trace_tipc_skb_dump(skb, false, "PROTO invalid (2)!");
1620 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "PROTO invalid (2)!");
1621 return false;
1622 }
1623
1624 /* Check and update node accesibility if applicable */
1625 if (state == SELF_UP_PEER_COMING) {
1626 if (!tipc_link_is_up(l))
1627 return true;
1628 if (!msg_peer_link_is_up(hdr))
1629 return true;
1630 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1631 }
1632
1633 if (state == SELF_DOWN_PEER_LEAVING) {
1634 if (msg_peer_node_is_up(hdr))
1635 return false;
1636 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
1637 return true;
1638 }
1639
1640 if (state == SELF_LEAVING_PEER_DOWN)
1641 return false;
1642
1643 /* Ignore duplicate packets */
1644 if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
1645 return true;
1646
1647 /* Initiate or update failover mode if applicable */
1648 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1649 syncpt = oseqno + exp_pkts - 1;
1650 if (pl && tipc_link_is_up(pl)) {
1651 __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
1652 trace_tipc_node_link_down(n, true,
1653 "node link down <- failover!");
1654 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1655 tipc_link_inputq(l));
1656 }
1657 /* If parallel link was already down, and this happened before
1658 * the tunnel link came up, FAILOVER was never sent. Ensure that
1659 * FAILOVER is sent to get peer out of NODE_FAILINGOVER state.
1660 */
1661 if (n->state != NODE_FAILINGOVER && !n->failover_sent) {
1662 tipc_link_create_dummy_tnl_msg(l, xmitq);
1663 n->failover_sent = true;
1664 }
1665 /* If pkts arrive out of order, use lowest calculated syncpt */
1666 if (less(syncpt, n->sync_point))
1667 n->sync_point = syncpt;
1668 }
1669
1670 /* Open parallel link when tunnel link reaches synch point */
1671 if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
1672 if (!more(rcv_nxt, n->sync_point))
1673 return true;
1674 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1675 if (pl)
1676 tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
1677 return true;
1678 }
1679
1680 /* No synching needed if only one link */
1681 if (!pl || !tipc_link_is_up(pl))
1682 return true;
1683
1684 /* Initiate synch mode if applicable */
1685 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
1686 syncpt = iseqno + exp_pkts - 1;
1687 if (!tipc_link_is_up(l))
1688 __tipc_node_link_up(n, bearer_id, xmitq);
1689 if (n->state == SELF_UP_PEER_UP) {
1690 n->sync_point = syncpt;
1691 tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
1692 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1693 }
1694 }
1695
1696 /* Open tunnel link when parallel link reaches synch point */
1697 if (n->state == NODE_SYNCHING) {
1698 if (tipc_link_is_synching(l)) {
1699 tnl = l;
1700 } else {
1701 tnl = pl;
1702 pl = l;
1703 }
1704 inputq_len = skb_queue_len(tipc_link_inputq(pl));
1705 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
1706 if (more(dlv_nxt, n->sync_point)) {
1707 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
1708 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
1709 return true;
1710 }
1711 if (l == pl)
1712 return true;
1713 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1714 return true;
1715 if (usr == LINK_PROTOCOL)
1716 return true;
1717 return false;
1718 }
1719 return true;
1720 }
1721
1722 /**
1723 * tipc_rcv - process TIPC packets/messages arriving from off-node
1724 * @net: the applicable net namespace
1725 * @skb: TIPC packet
1726 * @bearer: pointer to bearer message arrived on
1727 *
1728 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1729 * structure (i.e. cannot be NULL), but bearer can be inactive.
1730 */
1731 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1732 {
1733 struct sk_buff_head xmitq;
1734 struct tipc_node *n;
1735 struct tipc_msg *hdr;
1736 int bearer_id = b->identity;
1737 struct tipc_link_entry *le;
1738 u32 self = tipc_own_addr(net);
1739 int usr, rc = 0;
1740 u16 bc_ack;
1741
1742 __skb_queue_head_init(&xmitq);
1743
1744 /* Ensure message is well-formed before touching the header */
1745 if (unlikely(!tipc_msg_validate(&skb)))
1746 goto discard;
1747 hdr = buf_msg(skb);
1748 usr = msg_user(hdr);
1749 bc_ack = msg_bcast_ack(hdr);
1750
1751 /* Handle arrival of discovery or broadcast packet */
1752 if (unlikely(msg_non_seq(hdr))) {
1753 if (unlikely(usr == LINK_CONFIG))
1754 return tipc_disc_rcv(net, skb, b);
1755 else
1756 return tipc_node_bc_rcv(net, skb, bearer_id);
1757 }
1758
1759 /* Discard unicast link messages destined for another node */
1760 if (unlikely(!msg_short(hdr) && (msg_destnode(hdr) != self)))
1761 goto discard;
1762
1763 /* Locate neighboring node that sent packet */
1764 n = tipc_node_find(net, msg_prevnode(hdr));
1765 if (unlikely(!n))
1766 goto discard;
1767 le = &n->links[bearer_id];
1768
1769 /* Ensure broadcast reception is in synch with peer's send state */
1770 if (unlikely(usr == LINK_PROTOCOL))
1771 tipc_node_bc_sync_rcv(n, hdr, bearer_id, &xmitq);
1772 else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack))
1773 tipc_bcast_ack_rcv(net, n->bc_entry.link, hdr);
1774
1775 /* Receive packet directly if conditions permit */
1776 tipc_node_read_lock(n);
1777 if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
1778 spin_lock_bh(&le->lock);
1779 if (le->link) {
1780 rc = tipc_link_rcv(le->link, skb, &xmitq);
1781 skb = NULL;
1782 }
1783 spin_unlock_bh(&le->lock);
1784 }
1785 tipc_node_read_unlock(n);
1786
1787 /* Check/update node state before receiving */
1788 if (unlikely(skb)) {
1789 if (unlikely(skb_linearize(skb)))
1790 goto discard;
1791 tipc_node_write_lock(n);
1792 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
1793 if (le->link) {
1794 rc = tipc_link_rcv(le->link, skb, &xmitq);
1795 skb = NULL;
1796 }
1797 }
1798 tipc_node_write_unlock(n);
1799 }
1800
1801 if (unlikely(rc & TIPC_LINK_UP_EVT))
1802 tipc_node_link_up(n, bearer_id, &xmitq);
1803
1804 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
1805 tipc_node_link_down(n, bearer_id, false);
1806
1807 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
1808 tipc_named_rcv(net, &n->bc_entry.namedq);
1809
1810 if (unlikely(!skb_queue_empty(&n->bc_entry.inputq1)))
1811 tipc_node_mcast_rcv(n);
1812
1813 if (!skb_queue_empty(&le->inputq))
1814 tipc_sk_rcv(net, &le->inputq);
1815
1816 if (!skb_queue_empty(&xmitq))
1817 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1818
1819 tipc_node_put(n);
1820 discard:
1821 kfree_skb(skb);
1822 }
1823
1824 void tipc_node_apply_property(struct net *net, struct tipc_bearer *b,
1825 int prop)
1826 {
1827 struct tipc_net *tn = tipc_net(net);
1828 int bearer_id = b->identity;
1829 struct sk_buff_head xmitq;
1830 struct tipc_link_entry *e;
1831 struct tipc_node *n;
1832
1833 __skb_queue_head_init(&xmitq);
1834
1835 rcu_read_lock();
1836
1837 list_for_each_entry_rcu(n, &tn->node_list, list) {
1838 tipc_node_write_lock(n);
1839 e = &n->links[bearer_id];
1840 if (e->link) {
1841 if (prop == TIPC_NLA_PROP_TOL)
1842 tipc_link_set_tolerance(e->link, b->tolerance,
1843 &xmitq);
1844 else if (prop == TIPC_NLA_PROP_MTU)
1845 tipc_link_set_mtu(e->link, b->mtu);
1846 }
1847 tipc_node_write_unlock(n);
1848 tipc_bearer_xmit(net, bearer_id, &xmitq, &e->maddr);
1849 }
1850
1851 rcu_read_unlock();
1852 }
1853
1854 int tipc_nl_peer_rm(struct sk_buff *skb, struct genl_info *info)
1855 {
1856 struct net *net = sock_net(skb->sk);
1857 struct tipc_net *tn = net_generic(net, tipc_net_id);
1858 struct nlattr *attrs[TIPC_NLA_NET_MAX + 1];
1859 struct tipc_node *peer;
1860 u32 addr;
1861 int err;
1862
1863 /* We identify the peer by its net */
1864 if (!info->attrs[TIPC_NLA_NET])
1865 return -EINVAL;
1866
1867 err = nla_parse_nested(attrs, TIPC_NLA_NET_MAX,
1868 info->attrs[TIPC_NLA_NET], tipc_nl_net_policy,
1869 info->extack);
1870 if (err)
1871 return err;
1872
1873 if (!attrs[TIPC_NLA_NET_ADDR])
1874 return -EINVAL;
1875
1876 addr = nla_get_u32(attrs[TIPC_NLA_NET_ADDR]);
1877
1878 if (in_own_node(net, addr))
1879 return -ENOTSUPP;
1880
1881 spin_lock_bh(&tn->node_list_lock);
1882 peer = tipc_node_find(net, addr);
1883 if (!peer) {
1884 spin_unlock_bh(&tn->node_list_lock);
1885 return -ENXIO;
1886 }
1887
1888 tipc_node_write_lock(peer);
1889 if (peer->state != SELF_DOWN_PEER_DOWN &&
1890 peer->state != SELF_DOWN_PEER_LEAVING) {
1891 tipc_node_write_unlock(peer);
1892 err = -EBUSY;
1893 goto err_out;
1894 }
1895
1896 tipc_node_clear_links(peer);
1897 tipc_node_write_unlock(peer);
1898 tipc_node_delete(peer);
1899
1900 err = 0;
1901 err_out:
1902 tipc_node_put(peer);
1903 spin_unlock_bh(&tn->node_list_lock);
1904
1905 return err;
1906 }
1907
1908 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1909 {
1910 int err;
1911 struct net *net = sock_net(skb->sk);
1912 struct tipc_net *tn = net_generic(net, tipc_net_id);
1913 int done = cb->args[0];
1914 int last_addr = cb->args[1];
1915 struct tipc_node *node;
1916 struct tipc_nl_msg msg;
1917
1918 if (done)
1919 return 0;
1920
1921 msg.skb = skb;
1922 msg.portid = NETLINK_CB(cb->skb).portid;
1923 msg.seq = cb->nlh->nlmsg_seq;
1924
1925 rcu_read_lock();
1926 if (last_addr) {
1927 node = tipc_node_find(net, last_addr);
1928 if (!node) {
1929 rcu_read_unlock();
1930 /* We never set seq or call nl_dump_check_consistent()
1931 * this means that setting prev_seq here will cause the
1932 * consistence check to fail in the netlink callback
1933 * handler. Resulting in the NLMSG_DONE message having
1934 * the NLM_F_DUMP_INTR flag set if the node state
1935 * changed while we released the lock.
1936 */
1937 cb->prev_seq = 1;
1938 return -EPIPE;
1939 }
1940 tipc_node_put(node);
1941 }
1942
1943 list_for_each_entry_rcu(node, &tn->node_list, list) {
1944 if (last_addr) {
1945 if (node->addr == last_addr)
1946 last_addr = 0;
1947 else
1948 continue;
1949 }
1950
1951 tipc_node_read_lock(node);
1952 err = __tipc_nl_add_node(&msg, node);
1953 if (err) {
1954 last_addr = node->addr;
1955 tipc_node_read_unlock(node);
1956 goto out;
1957 }
1958
1959 tipc_node_read_unlock(node);
1960 }
1961 done = 1;
1962 out:
1963 cb->args[0] = done;
1964 cb->args[1] = last_addr;
1965 rcu_read_unlock();
1966
1967 return skb->len;
1968 }
1969
1970 /* tipc_node_find_by_name - locate owner node of link by link's name
1971 * @net: the applicable net namespace
1972 * @name: pointer to link name string
1973 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1974 *
1975 * Returns pointer to node owning the link, or 0 if no matching link is found.
1976 */
1977 static struct tipc_node *tipc_node_find_by_name(struct net *net,
1978 const char *link_name,
1979 unsigned int *bearer_id)
1980 {
1981 struct tipc_net *tn = net_generic(net, tipc_net_id);
1982 struct tipc_link *l;
1983 struct tipc_node *n;
1984 struct tipc_node *found_node = NULL;
1985 int i;
1986
1987 *bearer_id = 0;
1988 rcu_read_lock();
1989 list_for_each_entry_rcu(n, &tn->node_list, list) {
1990 tipc_node_read_lock(n);
1991 for (i = 0; i < MAX_BEARERS; i++) {
1992 l = n->links[i].link;
1993 if (l && !strcmp(tipc_link_name(l), link_name)) {
1994 *bearer_id = i;
1995 found_node = n;
1996 break;
1997 }
1998 }
1999 tipc_node_read_unlock(n);
2000 if (found_node)
2001 break;
2002 }
2003 rcu_read_unlock();
2004
2005 return found_node;
2006 }
2007
2008 int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
2009 {
2010 int err;
2011 int res = 0;
2012 int bearer_id;
2013 char *name;
2014 struct tipc_link *link;
2015 struct tipc_node *node;
2016 struct sk_buff_head xmitq;
2017 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2018 struct net *net = sock_net(skb->sk);
2019
2020 __skb_queue_head_init(&xmitq);
2021
2022 if (!info->attrs[TIPC_NLA_LINK])
2023 return -EINVAL;
2024
2025 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2026 info->attrs[TIPC_NLA_LINK],
2027 tipc_nl_link_policy, info->extack);
2028 if (err)
2029 return err;
2030
2031 if (!attrs[TIPC_NLA_LINK_NAME])
2032 return -EINVAL;
2033
2034 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2035
2036 if (strcmp(name, tipc_bclink_name) == 0)
2037 return tipc_nl_bc_link_set(net, attrs);
2038
2039 node = tipc_node_find_by_name(net, name, &bearer_id);
2040 if (!node)
2041 return -EINVAL;
2042
2043 tipc_node_read_lock(node);
2044
2045 link = node->links[bearer_id].link;
2046 if (!link) {
2047 res = -EINVAL;
2048 goto out;
2049 }
2050
2051 if (attrs[TIPC_NLA_LINK_PROP]) {
2052 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
2053
2054 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
2055 props);
2056 if (err) {
2057 res = err;
2058 goto out;
2059 }
2060
2061 if (props[TIPC_NLA_PROP_TOL]) {
2062 u32 tol;
2063
2064 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
2065 tipc_link_set_tolerance(link, tol, &xmitq);
2066 }
2067 if (props[TIPC_NLA_PROP_PRIO]) {
2068 u32 prio;
2069
2070 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
2071 tipc_link_set_prio(link, prio, &xmitq);
2072 }
2073 if (props[TIPC_NLA_PROP_WIN]) {
2074 u32 win;
2075
2076 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2077 tipc_link_set_queue_limits(link, win);
2078 }
2079 }
2080
2081 out:
2082 tipc_node_read_unlock(node);
2083 tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr);
2084 return res;
2085 }
2086
2087 int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
2088 {
2089 struct net *net = genl_info_net(info);
2090 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2091 struct tipc_nl_msg msg;
2092 char *name;
2093 int err;
2094
2095 msg.portid = info->snd_portid;
2096 msg.seq = info->snd_seq;
2097
2098 if (!info->attrs[TIPC_NLA_LINK])
2099 return -EINVAL;
2100
2101 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2102 info->attrs[TIPC_NLA_LINK],
2103 tipc_nl_link_policy, info->extack);
2104 if (err)
2105 return err;
2106
2107 if (!attrs[TIPC_NLA_LINK_NAME])
2108 return -EINVAL;
2109
2110 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2111
2112 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2113 if (!msg.skb)
2114 return -ENOMEM;
2115
2116 if (strcmp(name, tipc_bclink_name) == 0) {
2117 err = tipc_nl_add_bc_link(net, &msg);
2118 if (err)
2119 goto err_free;
2120 } else {
2121 int bearer_id;
2122 struct tipc_node *node;
2123 struct tipc_link *link;
2124
2125 node = tipc_node_find_by_name(net, name, &bearer_id);
2126 if (!node) {
2127 err = -EINVAL;
2128 goto err_free;
2129 }
2130
2131 tipc_node_read_lock(node);
2132 link = node->links[bearer_id].link;
2133 if (!link) {
2134 tipc_node_read_unlock(node);
2135 err = -EINVAL;
2136 goto err_free;
2137 }
2138
2139 err = __tipc_nl_add_link(net, &msg, link, 0);
2140 tipc_node_read_unlock(node);
2141 if (err)
2142 goto err_free;
2143 }
2144
2145 return genlmsg_reply(msg.skb, info);
2146
2147 err_free:
2148 nlmsg_free(msg.skb);
2149 return err;
2150 }
2151
2152 int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
2153 {
2154 int err;
2155 char *link_name;
2156 unsigned int bearer_id;
2157 struct tipc_link *link;
2158 struct tipc_node *node;
2159 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2160 struct net *net = sock_net(skb->sk);
2161 struct tipc_link_entry *le;
2162
2163 if (!info->attrs[TIPC_NLA_LINK])
2164 return -EINVAL;
2165
2166 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2167 info->attrs[TIPC_NLA_LINK],
2168 tipc_nl_link_policy, info->extack);
2169 if (err)
2170 return err;
2171
2172 if (!attrs[TIPC_NLA_LINK_NAME])
2173 return -EINVAL;
2174
2175 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2176
2177 if (strcmp(link_name, tipc_bclink_name) == 0) {
2178 err = tipc_bclink_reset_stats(net);
2179 if (err)
2180 return err;
2181 return 0;
2182 }
2183
2184 node = tipc_node_find_by_name(net, link_name, &bearer_id);
2185 if (!node)
2186 return -EINVAL;
2187
2188 le = &node->links[bearer_id];
2189 tipc_node_read_lock(node);
2190 spin_lock_bh(&le->lock);
2191 link = node->links[bearer_id].link;
2192 if (!link) {
2193 spin_unlock_bh(&le->lock);
2194 tipc_node_read_unlock(node);
2195 return -EINVAL;
2196 }
2197 tipc_link_reset_stats(link);
2198 spin_unlock_bh(&le->lock);
2199 tipc_node_read_unlock(node);
2200 return 0;
2201 }
2202
2203 /* Caller should hold node lock */
2204 static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
2205 struct tipc_node *node, u32 *prev_link)
2206 {
2207 u32 i;
2208 int err;
2209
2210 for (i = *prev_link; i < MAX_BEARERS; i++) {
2211 *prev_link = i;
2212
2213 if (!node->links[i].link)
2214 continue;
2215
2216 err = __tipc_nl_add_link(net, msg,
2217 node->links[i].link, NLM_F_MULTI);
2218 if (err)
2219 return err;
2220 }
2221 *prev_link = 0;
2222
2223 return 0;
2224 }
2225
2226 int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
2227 {
2228 struct net *net = sock_net(skb->sk);
2229 struct tipc_net *tn = net_generic(net, tipc_net_id);
2230 struct tipc_node *node;
2231 struct tipc_nl_msg msg;
2232 u32 prev_node = cb->args[0];
2233 u32 prev_link = cb->args[1];
2234 int done = cb->args[2];
2235 int err;
2236
2237 if (done)
2238 return 0;
2239
2240 msg.skb = skb;
2241 msg.portid = NETLINK_CB(cb->skb).portid;
2242 msg.seq = cb->nlh->nlmsg_seq;
2243
2244 rcu_read_lock();
2245 if (prev_node) {
2246 node = tipc_node_find(net, prev_node);
2247 if (!node) {
2248 /* We never set seq or call nl_dump_check_consistent()
2249 * this means that setting prev_seq here will cause the
2250 * consistence check to fail in the netlink callback
2251 * handler. Resulting in the last NLMSG_DONE message
2252 * having the NLM_F_DUMP_INTR flag set.
2253 */
2254 cb->prev_seq = 1;
2255 goto out;
2256 }
2257 tipc_node_put(node);
2258
2259 list_for_each_entry_continue_rcu(node, &tn->node_list,
2260 list) {
2261 tipc_node_read_lock(node);
2262 err = __tipc_nl_add_node_links(net, &msg, node,
2263 &prev_link);
2264 tipc_node_read_unlock(node);
2265 if (err)
2266 goto out;
2267
2268 prev_node = node->addr;
2269 }
2270 } else {
2271 err = tipc_nl_add_bc_link(net, &msg);
2272 if (err)
2273 goto out;
2274
2275 list_for_each_entry_rcu(node, &tn->node_list, list) {
2276 tipc_node_read_lock(node);
2277 err = __tipc_nl_add_node_links(net, &msg, node,
2278 &prev_link);
2279 tipc_node_read_unlock(node);
2280 if (err)
2281 goto out;
2282
2283 prev_node = node->addr;
2284 }
2285 }
2286 done = 1;
2287 out:
2288 rcu_read_unlock();
2289
2290 cb->args[0] = prev_node;
2291 cb->args[1] = prev_link;
2292 cb->args[2] = done;
2293
2294 return skb->len;
2295 }
2296
2297 int tipc_nl_node_set_monitor(struct sk_buff *skb, struct genl_info *info)
2298 {
2299 struct nlattr *attrs[TIPC_NLA_MON_MAX + 1];
2300 struct net *net = sock_net(skb->sk);
2301 int err;
2302
2303 if (!info->attrs[TIPC_NLA_MON])
2304 return -EINVAL;
2305
2306 err = nla_parse_nested(attrs, TIPC_NLA_MON_MAX,
2307 info->attrs[TIPC_NLA_MON],
2308 tipc_nl_monitor_policy, info->extack);
2309 if (err)
2310 return err;
2311
2312 if (attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]) {
2313 u32 val;
2314
2315 val = nla_get_u32(attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]);
2316 err = tipc_nl_monitor_set_threshold(net, val);
2317 if (err)
2318 return err;
2319 }
2320
2321 return 0;
2322 }
2323
2324 static int __tipc_nl_add_monitor_prop(struct net *net, struct tipc_nl_msg *msg)
2325 {
2326 struct nlattr *attrs;
2327 void *hdr;
2328 u32 val;
2329
2330 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2331 0, TIPC_NL_MON_GET);
2332 if (!hdr)
2333 return -EMSGSIZE;
2334
2335 attrs = nla_nest_start(msg->skb, TIPC_NLA_MON);
2336 if (!attrs)
2337 goto msg_full;
2338
2339 val = tipc_nl_monitor_get_threshold(net);
2340
2341 if (nla_put_u32(msg->skb, TIPC_NLA_MON_ACTIVATION_THRESHOLD, val))
2342 goto attr_msg_full;
2343
2344 nla_nest_end(msg->skb, attrs);
2345 genlmsg_end(msg->skb, hdr);
2346
2347 return 0;
2348
2349 attr_msg_full:
2350 nla_nest_cancel(msg->skb, attrs);
2351 msg_full:
2352 genlmsg_cancel(msg->skb, hdr);
2353
2354 return -EMSGSIZE;
2355 }
2356
2357 int tipc_nl_node_get_monitor(struct sk_buff *skb, struct genl_info *info)
2358 {
2359 struct net *net = sock_net(skb->sk);
2360 struct tipc_nl_msg msg;
2361 int err;
2362
2363 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2364 if (!msg.skb)
2365 return -ENOMEM;
2366 msg.portid = info->snd_portid;
2367 msg.seq = info->snd_seq;
2368
2369 err = __tipc_nl_add_monitor_prop(net, &msg);
2370 if (err) {
2371 nlmsg_free(msg.skb);
2372 return err;
2373 }
2374
2375 return genlmsg_reply(msg.skb, info);
2376 }
2377
2378 int tipc_nl_node_dump_monitor(struct sk_buff *skb, struct netlink_callback *cb)
2379 {
2380 struct net *net = sock_net(skb->sk);
2381 u32 prev_bearer = cb->args[0];
2382 struct tipc_nl_msg msg;
2383 int bearer_id;
2384 int err;
2385
2386 if (prev_bearer == MAX_BEARERS)
2387 return 0;
2388
2389 msg.skb = skb;
2390 msg.portid = NETLINK_CB(cb->skb).portid;
2391 msg.seq = cb->nlh->nlmsg_seq;
2392
2393 rtnl_lock();
2394 for (bearer_id = prev_bearer; bearer_id < MAX_BEARERS; bearer_id++) {
2395 err = __tipc_nl_add_monitor(net, &msg, bearer_id);
2396 if (err)
2397 break;
2398 }
2399 rtnl_unlock();
2400 cb->args[0] = bearer_id;
2401
2402 return skb->len;
2403 }
2404
2405 int tipc_nl_node_dump_monitor_peer(struct sk_buff *skb,
2406 struct netlink_callback *cb)
2407 {
2408 struct net *net = sock_net(skb->sk);
2409 u32 prev_node = cb->args[1];
2410 u32 bearer_id = cb->args[2];
2411 int done = cb->args[0];
2412 struct tipc_nl_msg msg;
2413 int err;
2414
2415 if (!prev_node) {
2416 struct nlattr **attrs;
2417 struct nlattr *mon[TIPC_NLA_MON_MAX + 1];
2418
2419 err = tipc_nlmsg_parse(cb->nlh, &attrs);
2420 if (err)
2421 return err;
2422
2423 if (!attrs[TIPC_NLA_MON])
2424 return -EINVAL;
2425
2426 err = nla_parse_nested(mon, TIPC_NLA_MON_MAX,
2427 attrs[TIPC_NLA_MON],
2428 tipc_nl_monitor_policy, NULL);
2429 if (err)
2430 return err;
2431
2432 if (!mon[TIPC_NLA_MON_REF])
2433 return -EINVAL;
2434
2435 bearer_id = nla_get_u32(mon[TIPC_NLA_MON_REF]);
2436
2437 if (bearer_id >= MAX_BEARERS)
2438 return -EINVAL;
2439 }
2440
2441 if (done)
2442 return 0;
2443
2444 msg.skb = skb;
2445 msg.portid = NETLINK_CB(cb->skb).portid;
2446 msg.seq = cb->nlh->nlmsg_seq;
2447
2448 rtnl_lock();
2449 err = tipc_nl_add_monitor_peer(net, &msg, bearer_id, &prev_node);
2450 if (!err)
2451 done = 1;
2452
2453 rtnl_unlock();
2454 cb->args[0] = done;
2455 cb->args[1] = prev_node;
2456 cb->args[2] = bearer_id;
2457
2458 return skb->len;
2459 }
2460
2461 u32 tipc_node_get_addr(struct tipc_node *node)
2462 {
2463 return (node) ? node->addr : 0;
2464 }
2465
2466 /**
2467 * tipc_node_dump - dump TIPC node data
2468 * @n: tipc node to be dumped
2469 * @more: dump more?
2470 * - false: dump only tipc node data
2471 * - true: dump node link data as well
2472 * @buf: returned buffer of dump data in format
2473 */
2474 int tipc_node_dump(struct tipc_node *n, bool more, char *buf)
2475 {
2476 int i = 0;
2477 size_t sz = (more) ? NODE_LMAX : NODE_LMIN;
2478
2479 if (!n) {
2480 i += scnprintf(buf, sz, "node data: (null)\n");
2481 return i;
2482 }
2483
2484 i += scnprintf(buf, sz, "node data: %x", n->addr);
2485 i += scnprintf(buf + i, sz - i, " %x", n->state);
2486 i += scnprintf(buf + i, sz - i, " %d", n->active_links[0]);
2487 i += scnprintf(buf + i, sz - i, " %d", n->active_links[1]);
2488 i += scnprintf(buf + i, sz - i, " %x", n->action_flags);
2489 i += scnprintf(buf + i, sz - i, " %u", n->failover_sent);
2490 i += scnprintf(buf + i, sz - i, " %u", n->sync_point);
2491 i += scnprintf(buf + i, sz - i, " %d", n->link_cnt);
2492 i += scnprintf(buf + i, sz - i, " %u", n->working_links);
2493 i += scnprintf(buf + i, sz - i, " %x", n->capabilities);
2494 i += scnprintf(buf + i, sz - i, " %lu\n", n->keepalive_intv);
2495
2496 if (!more)
2497 return i;
2498
2499 i += scnprintf(buf + i, sz - i, "link_entry[0]:\n");
2500 i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[0].mtu);
2501 i += scnprintf(buf + i, sz - i, " media: ");
2502 i += tipc_media_addr_printf(buf + i, sz - i, &n->links[0].maddr);
2503 i += scnprintf(buf + i, sz - i, "\n");
2504 i += tipc_link_dump(n->links[0].link, TIPC_DUMP_NONE, buf + i);
2505 i += scnprintf(buf + i, sz - i, " inputq: ");
2506 i += tipc_list_dump(&n->links[0].inputq, false, buf + i);
2507
2508 i += scnprintf(buf + i, sz - i, "link_entry[1]:\n");
2509 i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[1].mtu);
2510 i += scnprintf(buf + i, sz - i, " media: ");
2511 i += tipc_media_addr_printf(buf + i, sz - i, &n->links[1].maddr);
2512 i += scnprintf(buf + i, sz - i, "\n");
2513 i += tipc_link_dump(n->links[1].link, TIPC_DUMP_NONE, buf + i);
2514 i += scnprintf(buf + i, sz - i, " inputq: ");
2515 i += tipc_list_dump(&n->links[1].inputq, false, buf + i);
2516
2517 i += scnprintf(buf + i, sz - i, "bclink:\n ");
2518 i += tipc_link_dump(n->bc_entry.link, TIPC_DUMP_NONE, buf + i);
2519
2520 return i;
2521 }
Linux with added FPC-III support