blob: e78674891166087f9340963c6a62fa9d628eedfa [file] [log] [blame]
Per Lidenb97bf3f2006-01-02 19:04:38 +01001/*
2 * net/tipc/net.c: TIPC network routing code
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +09003 *
Jon Paul Maloy5a379072014-06-25 20:41:36 -05004 * Copyright (c) 1995-2006, 2014, Ericsson AB
Allan Stephens9df3b7e2011-02-24 13:20:20 -05005 * Copyright (c) 2005, 2010-2011, Wind River Systems
Per Lidenb97bf3f2006-01-02 19:04:38 +01006 * 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 *
Per Liden9ea1fd32006-01-11 13:30:43 +010011 * 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.
Per Lidenb97bf3f2006-01-02 19:04:38 +010023 *
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"
Per Lidenb97bf3f2006-01-02 19:04:38 +010038#include "net.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010039#include "name_distr.h"
40#include "subscr.h"
Jon Paul Maloy9816f062014-05-14 05:39:15 -040041#include "socket.h"
Allan Stephens672d99e2011-02-25 18:42:52 -050042#include "node.h"
Jon Paul Maloya6bf70f2015-05-14 10:46:13 -040043#include "bcast.h"
Richard Alpe49cc66e2016-03-04 17:04:42 +010044#include "netlink.h"
Richard Alpefd3cf2a2014-11-20 10:29:18 +010045
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090046/*
Per Lidenb97bf3f2006-01-02 19:04:38 +010047 * The TIPC locking policy is designed to ensure a very fine locking
48 * granularity, permitting complete parallel access to individual
Ying Xue7216cd92014-04-21 10:55:48 +080049 * port and node/link instances. The code consists of four major
Per Lidenb97bf3f2006-01-02 19:04:38 +010050 * locking domains, each protected with their own disjunct set of locks.
51 *
Ying Xue7216cd92014-04-21 10:55:48 +080052 * 1: The bearer level.
53 * RTNL lock is used to serialize the process of configuring bearer
54 * on update side, and RCU lock is applied on read side to make
55 * bearer instance valid on both paths of message transmission and
56 * reception.
Per Lidenb97bf3f2006-01-02 19:04:38 +010057 *
Ying Xue7216cd92014-04-21 10:55:48 +080058 * 2: The node and link level.
59 * All node instances are saved into two tipc_node_list and node_htable
60 * lists. The two lists are protected by node_list_lock on write side,
61 * and they are guarded with RCU lock on read side. Especially node
62 * instance is destroyed only when TIPC module is removed, and we can
63 * confirm that there has no any user who is accessing the node at the
64 * moment. Therefore, Except for iterating the two lists within RCU
65 * protection, it's no needed to hold RCU that we access node instance
66 * in other places.
Per Lidenb97bf3f2006-01-02 19:04:38 +010067 *
Ying Xue7216cd92014-04-21 10:55:48 +080068 * In addition, all members in node structure including link instances
69 * are protected by node spin lock.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090070 *
Ying Xue7216cd92014-04-21 10:55:48 +080071 * 3: The transport level of the protocol.
72 * This consists of the structures port, (and its user level
73 * representations, such as user_port and tipc_sock), reference and
74 * tipc_user (port.c, reg.c, socket.c).
Per Lidenb97bf3f2006-01-02 19:04:38 +010075 *
Ying Xue7216cd92014-04-21 10:55:48 +080076 * This layer has four different locks:
Per Lidenb97bf3f2006-01-02 19:04:38 +010077 * - The tipc_port spin_lock. This is protecting each port instance
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090078 * from parallel data access and removal. Since we can not place
79 * this lock in the port itself, it has been placed in the
Per Lidenb97bf3f2006-01-02 19:04:38 +010080 * corresponding reference table entry, which has the same life
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090081 * cycle as the module. This entry is difficult to access from
82 * outside the TIPC core, however, so a pointer to the lock has
83 * been added in the port instance, -to be used for unlocking
Per Lidenb97bf3f2006-01-02 19:04:38 +010084 * only.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090085 * - A read/write lock to protect the reference table itself (teg.c).
86 * (Nobody is using read-only access to this, so it can just as
Per Lidenb97bf3f2006-01-02 19:04:38 +010087 * well be changed to a spin_lock)
88 * - A spin lock to protect the registry of kernel/driver users (reg.c)
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090089 * - A global spin_lock (tipc_port_lock), which only task is to ensure
Per Lidenb97bf3f2006-01-02 19:04:38 +010090 * consistency where more than one port is involved in an operation,
91 * i.e., whe a port is part of a linked list of ports.
92 * There are two such lists; 'port_list', which is used for management,
93 * and 'wait_list', which is used to queue ports during congestion.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090094 *
Ying Xue7216cd92014-04-21 10:55:48 +080095 * 4: The name table (name_table.c, name_distr.c, subscription.c)
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090096 * - There is one big read/write-lock (tipc_nametbl_lock) protecting the
97 * overall name table structure. Nothing must be added/removed to
Per Lidenb97bf3f2006-01-02 19:04:38 +010098 * this structure without holding write access to it.
99 * - There is one local spin_lock per sub_sequence, which can be seen
Per Liden4323add2006-01-18 00:38:21 +0100100 * as a sub-domain to the tipc_nametbl_lock domain. It is used only
Per Lidenb97bf3f2006-01-02 19:04:38 +0100101 * for translation operations, and is needed because a translation
102 * steps the root of the 'publication' linked list between each lookup.
Per Liden4323add2006-01-18 00:38:21 +0100103 * This is always used within the scope of a tipc_nametbl_lock(read).
Per Lidenb97bf3f2006-01-02 19:04:38 +0100104 * - A local spin_lock protecting the queue of subscriber events.
105*/
Per Lidenb97bf3f2006-01-02 19:04:38 +0100106
Jon Maloyd50ccc22018-03-22 20:42:50 +0100107int tipc_net_init(struct net *net, u8 *node_id, u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100108{
Jon Maloyd50ccc22018-03-22 20:42:50 +0100109 if (tipc_own_id(net)) {
110 pr_info("Cannot configure node identity twice\n");
111 return -1;
112 }
113 pr_info("Started in network mode\n");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100114
Jon Maloyd50ccc22018-03-22 20:42:50 +0100115 if (node_id) {
116 tipc_set_node_id(net, node_id);
117 tipc_net_finalize(net, tipc_own_addr(net));
118 }
119 if (addr)
120 tipc_net_finalize(net, addr);
121 return 0;
122}
Herbert Xu40f9f432017-02-11 19:26:46 +0800123
Jon Maloyd50ccc22018-03-22 20:42:50 +0100124void tipc_net_finalize(struct net *net, u32 addr)
125{
126 tipc_set_node_addr(net, addr);
Herbert Xu40f9f432017-02-11 19:26:46 +0800127 smp_mb();
Ying Xue4ac1c8d2015-01-09 15:27:09 +0800128 tipc_named_reinit(net);
Ying Xuee05b31f2015-01-09 15:27:08 +0800129 tipc_sk_reinit(net);
Jon Maloy23fd3ea2018-03-22 20:42:49 +0100130 tipc_nametbl_publish(net, TIPC_CFG_SRV, addr, addr,
131 TIPC_CLUSTER_SCOPE, 0, addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100132}
133
Ying Xuef2f98002015-01-09 15:27:05 +0800134void tipc_net_stop(struct net *net)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100135{
Jon Maloy23fd3ea2018-03-22 20:42:49 +0100136 u32 self = tipc_own_addr(net);
Ying Xue34747532015-01-09 15:27:10 +0800137
Jon Maloy23fd3ea2018-03-22 20:42:49 +0100138 if (!self)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100139 return;
Ying Xue46651c52014-03-27 12:54:36 +0800140
Jon Maloy23fd3ea2018-03-22 20:42:49 +0100141 tipc_nametbl_withdraw(net, TIPC_CFG_SRV, self, 0, self);
Ying Xuef97e4552014-04-21 10:55:44 +0800142 rtnl_lock();
Ying Xuef2f98002015-01-09 15:27:05 +0800143 tipc_bearer_stop(net);
Ying Xuef2f98002015-01-09 15:27:05 +0800144 tipc_node_stop(net);
Ying Xuef97e4552014-04-21 10:55:44 +0800145 rtnl_unlock();
Ying Xue46651c52014-03-27 12:54:36 +0800146
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400147 pr_info("Left network mode\n");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100148}
Richard Alpefd3cf2a2014-11-20 10:29:18 +0100149
Ying Xuec93d3ba2015-01-09 15:27:04 +0800150static int __tipc_nl_add_net(struct net *net, struct tipc_nl_msg *msg)
Richard Alpefd3cf2a2014-11-20 10:29:18 +0100151{
Ying Xuec93d3ba2015-01-09 15:27:04 +0800152 struct tipc_net *tn = net_generic(net, tipc_net_id);
Jon Maloyd50ccc22018-03-22 20:42:50 +0100153 u64 *w0 = (u64 *)&tn->node_id[0];
154 u64 *w1 = (u64 *)&tn->node_id[8];
Richard Alpefd3cf2a2014-11-20 10:29:18 +0100155 struct nlattr *attrs;
Jon Maloyd50ccc22018-03-22 20:42:50 +0100156 void *hdr;
Richard Alpefd3cf2a2014-11-20 10:29:18 +0100157
Richard Alpebfb3e5d2015-02-09 09:50:03 +0100158 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
Richard Alpefd3cf2a2014-11-20 10:29:18 +0100159 NLM_F_MULTI, TIPC_NL_NET_GET);
160 if (!hdr)
161 return -EMSGSIZE;
162
163 attrs = nla_nest_start(msg->skb, TIPC_NLA_NET);
164 if (!attrs)
165 goto msg_full;
166
Ying Xuec93d3ba2015-01-09 15:27:04 +0800167 if (nla_put_u32(msg->skb, TIPC_NLA_NET_ID, tn->net_id))
Richard Alpefd3cf2a2014-11-20 10:29:18 +0100168 goto attr_msg_full;
Jon Maloyd50ccc22018-03-22 20:42:50 +0100169 if (nla_put_u64_64bit(msg->skb, TIPC_NLA_NET_NODEID, *w0, 0))
170 goto attr_msg_full;
171 if (nla_put_u64_64bit(msg->skb, TIPC_NLA_NET_NODEID_W1, *w1, 0))
172 goto attr_msg_full;
Richard Alpefd3cf2a2014-11-20 10:29:18 +0100173 nla_nest_end(msg->skb, attrs);
174 genlmsg_end(msg->skb, hdr);
175
176 return 0;
177
178attr_msg_full:
179 nla_nest_cancel(msg->skb, attrs);
180msg_full:
181 genlmsg_cancel(msg->skb, hdr);
182
183 return -EMSGSIZE;
184}
185
186int tipc_nl_net_dump(struct sk_buff *skb, struct netlink_callback *cb)
187{
Ying Xuec93d3ba2015-01-09 15:27:04 +0800188 struct net *net = sock_net(skb->sk);
Richard Alpefd3cf2a2014-11-20 10:29:18 +0100189 int err;
190 int done = cb->args[0];
191 struct tipc_nl_msg msg;
192
193 if (done)
194 return 0;
195
196 msg.skb = skb;
197 msg.portid = NETLINK_CB(cb->skb).portid;
198 msg.seq = cb->nlh->nlmsg_seq;
199
Ying Xuec93d3ba2015-01-09 15:27:04 +0800200 err = __tipc_nl_add_net(net, &msg);
Richard Alpefd3cf2a2014-11-20 10:29:18 +0100201 if (err)
202 goto out;
203
204 done = 1;
205out:
206 cb->args[0] = done;
207
208 return skb->len;
209}
Richard Alpe27c21412014-11-20 10:29:19 +0100210
Ying Xue5631f652018-02-14 13:38:03 +0800211int __tipc_nl_net_set(struct sk_buff *skb, struct genl_info *info)
Richard Alpe27c21412014-11-20 10:29:19 +0100212{
Richard Alpe27c21412014-11-20 10:29:19 +0100213 struct nlattr *attrs[TIPC_NLA_NET_MAX + 1];
Jon Maloy23fd3ea2018-03-22 20:42:49 +0100214 struct net *net = sock_net(skb->sk);
215 struct tipc_net *tn = tipc_net(net);
Ying Xuec93d3ba2015-01-09 15:27:04 +0800216 int err;
Richard Alpe27c21412014-11-20 10:29:19 +0100217
218 if (!info->attrs[TIPC_NLA_NET])
219 return -EINVAL;
220
221 err = nla_parse_nested(attrs, TIPC_NLA_NET_MAX,
Johannes Bergfceb6432017-04-12 14:34:07 +0200222 info->attrs[TIPC_NLA_NET], tipc_nl_net_policy,
Johannes Bergfe521452017-04-12 14:34:08 +0200223 info->extack);
Jon Maloyd50ccc22018-03-22 20:42:50 +0100224
Richard Alpe27c21412014-11-20 10:29:19 +0100225 if (err)
226 return err;
227
Jon Maloy23fd3ea2018-03-22 20:42:49 +0100228 /* Can't change net id once TIPC has joined a network */
229 if (tipc_own_addr(net))
230 return -EPERM;
231
Richard Alpe27c21412014-11-20 10:29:19 +0100232 if (attrs[TIPC_NLA_NET_ID]) {
233 u32 val;
234
Richard Alpe27c21412014-11-20 10:29:19 +0100235 val = nla_get_u32(attrs[TIPC_NLA_NET_ID]);
236 if (val < 1 || val > 9999)
237 return -EINVAL;
238
Ying Xuec93d3ba2015-01-09 15:27:04 +0800239 tn->net_id = val;
Richard Alpe27c21412014-11-20 10:29:19 +0100240 }
241
242 if (attrs[TIPC_NLA_NET_ADDR]) {
243 u32 addr;
244
Richard Alpe27c21412014-11-20 10:29:19 +0100245 addr = nla_get_u32(attrs[TIPC_NLA_NET_ADDR]);
Jon Maloy20263642018-03-22 20:42:47 +0100246 if (!addr)
Richard Alpe27c21412014-11-20 10:29:19 +0100247 return -EINVAL;
Jon Maloyb89afb12018-03-22 20:42:48 +0100248 tn->legacy_addr_format = true;
Jon Maloyd50ccc22018-03-22 20:42:50 +0100249 tipc_net_init(net, NULL, addr);
Richard Alpe27c21412014-11-20 10:29:19 +0100250 }
251
Jon Maloyd50ccc22018-03-22 20:42:50 +0100252 if (attrs[TIPC_NLA_NET_NODEID]) {
253 u8 node_id[NODE_ID_LEN];
254 u64 *w0 = (u64 *)&node_id[0];
255 u64 *w1 = (u64 *)&node_id[8];
256
257 *w0 = nla_get_u64(attrs[TIPC_NLA_NET_NODEID]);
258 *w1 = nla_get_u64(attrs[TIPC_NLA_NET_NODEID_W1]);
259 tipc_net_init(net, node_id, 0);
260 }
Richard Alpe27c21412014-11-20 10:29:19 +0100261 return 0;
262}
Ying Xue5631f652018-02-14 13:38:03 +0800263
264int tipc_nl_net_set(struct sk_buff *skb, struct genl_info *info)
265{
266 int err;
267
268 rtnl_lock();
269 err = __tipc_nl_net_set(skb, info);
270 rtnl_unlock();
271
272 return err;
273}