Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/node.h: Include file for TIPC node management routines | |
c4307285 | 3 | * |
cb1b7280 | 4 | * Copyright (c) 2000-2006, 2014-2015, Ericsson AB |
46651c59 | 5 | * Copyright (c) 2005, 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 | #ifndef _TIPC_NODE_H | |
38 | #define _TIPC_NODE_H | |
39 | ||
8f92df6a AS |
40 | #include "addr.h" |
41 | #include "net.h" | |
b97bf3fd | 42 | #include "bearer.h" |
16e166b8 | 43 | #include "msg.h" |
b97bf3fd | 44 | |
f2f9800d YX |
45 | /* Out-of-range value for node signature */ |
46 | #define INVALID_NODE_SIG 0x10000 | |
47 | ||
36e78a46 JPM |
48 | #define INVALID_BEARER_ID -1 |
49 | ||
aecb9bb8 | 50 | /* Flags used to take different actions according to flag type |
aecb9bb8 YX |
51 | * TIPC_NOTIFY_NODE_DOWN: notify node is down |
52 | * TIPC_NOTIFY_NODE_UP: notify node is up | |
7b8613e0 | 53 | * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type |
10f465c4 YX |
54 | */ |
55 | enum { | |
aecb9bb8 | 56 | TIPC_NOTIFY_NODE_DOWN = (1 << 3), |
50100a5e | 57 | TIPC_NOTIFY_NODE_UP = (1 << 4), |
c637c103 | 58 | TIPC_NOTIFY_LINK_UP = (1 << 6), |
2af5ae37 | 59 | TIPC_NOTIFY_LINK_DOWN = (1 << 7) |
10f465c4 | 60 | }; |
b4b56102 | 61 | |
fd556f20 JPM |
62 | /* Optional capabilities supported by this code version |
63 | */ | |
64 | enum { | |
65 | TIPC_BCAST_SYNCH = (1 << 1) | |
66 | }; | |
67 | ||
68 | #define TIPC_NODE_CAPABILITIES TIPC_BCAST_SYNCH | |
69 | ||
9d13ec65 JPM |
70 | struct tipc_link_entry { |
71 | struct tipc_link *link; | |
72 | u32 mtu; | |
d39bbd44 | 73 | struct sk_buff_head inputq; |
d3a43b90 | 74 | struct tipc_media_addr maddr; |
9d13ec65 JPM |
75 | }; |
76 | ||
52666986 JPM |
77 | struct tipc_bclink_entry { |
78 | struct tipc_link *link; | |
79 | struct sk_buff_head inputq1; | |
80 | struct sk_buff_head arrvq; | |
81 | struct sk_buff_head inputq2; | |
82 | struct sk_buff_head namedq; | |
83 | }; | |
84 | ||
b97bf3fd | 85 | /** |
6c00055a | 86 | * struct tipc_node - TIPC node structure |
b97bf3fd | 87 | * @addr: network address of node |
8a0f6ebe | 88 | * @ref: reference counter to node object |
b97bf3fd | 89 | * @lock: spinlock governing access to structure |
f2f9800d | 90 | * @net: the applicable net namespace |
672d99e1 | 91 | * @hash: links to adjacent nodes in unsorted hash chain |
c637c103 JPM |
92 | * @inputq: pointer to input queue containing messages for msg event |
93 | * @namedq: pointer to name table input queue with name table messages | |
36e78a46 | 94 | * @active_links: bearer ids of active links, used as index into links[] array |
9d13ec65 | 95 | * @links: array containing references to all links to node |
aecb9bb8 | 96 | * @action_flags: bit mask of different types of node actions |
6e498158 JPM |
97 | * @state: connectivity state vs peer node |
98 | * @sync_point: sequence number where synch/failover is finished | |
486f930a YX |
99 | * @list: links to adjacent nodes in sorted list of cluster's nodes |
100 | * @working_links: number of working links to node (both active and standby) | |
b97bf3fd | 101 | * @link_cnt: number of links to node |
7764d6e8 | 102 | * @capabilities: bitmap, indicating peer node's functional capabilities |
fc0eea69 | 103 | * @signature: node instance identifier |
7b8613e0 | 104 | * @link_id: local and remote bearer ids of changing link, if any |
a8f48af5 | 105 | * @publ_list: list of publications |
6c7a762e | 106 | * @rcu: rcu struct for tipc_node |
b97bf3fd | 107 | */ |
6c00055a | 108 | struct tipc_node { |
b97bf3fd | 109 | u32 addr; |
8a0f6ebe | 110 | struct kref kref; |
b97bf3fd | 111 | spinlock_t lock; |
f2f9800d | 112 | struct net *net; |
672d99e1 | 113 | struct hlist_node hash; |
36e78a46 | 114 | int active_links[2]; |
9d13ec65 | 115 | struct tipc_link_entry links[MAX_BEARERS]; |
52666986 | 116 | struct tipc_bclink_entry bc_entry; |
c637c103 | 117 | int action_flags; |
486f930a | 118 | struct list_head list; |
1a20cc25 | 119 | int state; |
6e498158 | 120 | u16 sync_point; |
b97bf3fd | 121 | int link_cnt; |
7764d6e8 JPM |
122 | u16 working_links; |
123 | u16 capabilities; | |
fc0eea69 | 124 | u32 signature; |
7b8613e0 | 125 | u32 link_id; |
a8f48af5 | 126 | struct list_head publ_list; |
02be61a9 | 127 | struct list_head conn_sks; |
8a1577c9 JPM |
128 | unsigned long keepalive_intv; |
129 | struct timer_list timer; | |
6c7a762e | 130 | struct rcu_head rcu; |
b97bf3fd PL |
131 | }; |
132 | ||
f2f9800d | 133 | struct tipc_node *tipc_node_find(struct net *net, u32 addr); |
8a0f6ebe | 134 | void tipc_node_put(struct tipc_node *node); |
f2f9800d | 135 | void tipc_node_stop(struct net *net); |
cf148816 JPM |
136 | void tipc_node_check_dest(struct net *net, u32 onode, |
137 | struct tipc_bearer *bearer, | |
138 | u16 capabilities, u32 signature, | |
139 | struct tipc_media_addr *maddr, | |
140 | bool *respond, bool *dupl_addr); | |
6144a996 | 141 | void tipc_node_delete_links(struct net *net, int bearer_id); |
a18c4bc3 PG |
142 | void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr); |
143 | void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr); | |
9d13ec65 | 144 | bool tipc_node_is_up(struct tipc_node *n); |
f2f9800d YX |
145 | int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 node, |
146 | char *linkname, size_t len); | |
9db9fdd1 | 147 | void tipc_node_unlock(struct tipc_node *node); |
af9b028e JPM |
148 | int tipc_node_xmit(struct net *net, struct sk_buff_head *list, u32 dnode, |
149 | int selector); | |
150 | int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dest, | |
151 | u32 selector); | |
f2f9800d YX |
152 | int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port); |
153 | void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port); | |
3e4b6ab5 RA |
154 | int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb); |
155 | ||
9db9fdd1 | 156 | static inline void tipc_node_lock(struct tipc_node *node) |
b97bf3fd | 157 | { |
9db9fdd1 | 158 | spin_lock_bh(&node->lock); |
b97bf3fd PL |
159 | } |
160 | ||
9d13ec65 | 161 | static inline struct tipc_link *node_active_link(struct tipc_node *n, int sel) |
16e166b8 | 162 | { |
36e78a46 JPM |
163 | int bearer_id = n->active_links[sel & 1]; |
164 | ||
165 | if (unlikely(bearer_id == INVALID_BEARER_ID)) | |
166 | return NULL; | |
16e166b8 | 167 | |
36e78a46 | 168 | return n->links[bearer_id].link; |
9d13ec65 | 169 | } |
16e166b8 | 170 | |
36e78a46 | 171 | static inline unsigned int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel) |
9d13ec65 JPM |
172 | { |
173 | struct tipc_node *n; | |
36e78a46 | 174 | int bearer_id; |
9d13ec65 | 175 | unsigned int mtu = MAX_MSG_SIZE; |
16e166b8 | 176 | |
9d13ec65 JPM |
177 | n = tipc_node_find(net, addr); |
178 | if (unlikely(!n)) | |
179 | return mtu; | |
36e78a46 JPM |
180 | |
181 | bearer_id = n->active_links[sel & 1]; | |
182 | if (likely(bearer_id != INVALID_BEARER_ID)) | |
183 | mtu = n->links[bearer_id].mtu; | |
9d13ec65 | 184 | tipc_node_put(n); |
16e166b8 JPM |
185 | return mtu; |
186 | } | |
187 | ||
b97bf3fd | 188 | #endif |