blob: f64375e7f99fa4081ce2a30629071ca3e546aa05 [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 *
Per Liden593a5f22006-01-11 19:14:19 +01004 * Copyright (c) 1995-2006, 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"
Per Lidenb97bf3f2006-01-02 19:04:38 +010041#include "port.h"
Jon Paul Maloy9816f062014-05-14 05:39:15 -040042#include "socket.h"
Allan Stephens672d99e2011-02-25 18:42:52 -050043#include "node.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010044#include "config.h"
45
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*/
106
Per Lidenb97bf3f2006-01-02 19:04:38 +0100107static void net_route_named_msg(struct sk_buff *buf)
108{
109 struct tipc_msg *msg = buf_msg(buf);
110 u32 dnode;
111 u32 dport;
112
113 if (!msg_named(msg)) {
Allan Stephens5f6d9122011-11-04 13:24:29 -0400114 kfree_skb(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100115 return;
116 }
117
118 dnode = addr_domain(msg_lookup_scope(msg));
Per Liden4323add2006-01-18 00:38:21 +0100119 dport = tipc_nametbl_translate(msg_nametype(msg), msg_nameinst(msg), &dnode);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100120 if (dport) {
121 msg_set_destnode(msg, dnode);
122 msg_set_destport(msg, dport);
Per Liden4323add2006-01-18 00:38:21 +0100123 tipc_net_route_msg(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100124 return;
125 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100126 tipc_reject_msg(buf, TIPC_ERR_NO_NAME);
127}
128
Per Liden4323add2006-01-18 00:38:21 +0100129void tipc_net_route_msg(struct sk_buff *buf)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100130{
131 struct tipc_msg *msg;
132 u32 dnode;
133
134 if (!buf)
135 return;
136 msg = buf_msg(buf);
137
Per Lidenb97bf3f2006-01-02 19:04:38 +0100138 /* Handle message for this node */
139 dnode = msg_short(msg) ? tipc_own_addr : msg_destnode(msg);
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000140 if (tipc_in_scope(dnode, tipc_own_addr)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100141 if (msg_isdata(msg)) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900142 if (msg_mcast(msg))
Ying Xue247f0f32014-02-18 16:06:46 +0800143 tipc_port_mcast_rcv(buf, NULL);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100144 else if (msg_destport(msg))
Jon Paul Maloy9816f062014-05-14 05:39:15 -0400145 tipc_sk_rcv(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100146 else
147 net_route_named_msg(buf);
148 return;
149 }
150 switch (msg_user(msg)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100151 case NAME_DISTRIBUTOR:
Ying Xue247f0f32014-02-18 16:06:46 +0800152 tipc_named_rcv(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100153 break;
154 case CONN_MANAGER:
Ying Xue247f0f32014-02-18 16:06:46 +0800155 tipc_port_proto_rcv(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100156 break;
157 default:
Allan Stephens5f6d9122011-11-04 13:24:29 -0400158 kfree_skb(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100159 }
160 return;
161 }
162
163 /* Handle message for another node */
Paul Gortmakerb2abd4c2010-09-08 13:31:24 +0000164 skb_trim(buf, msg_size(msg));
Ying Xue247f0f32014-02-18 16:06:46 +0800165 tipc_link_xmit(buf, dnode, msg_link_selector(msg));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100166}
167
Ying Xueeb8b00f2014-05-05 08:56:16 +0800168int tipc_net_start(u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100169{
170 char addr_string[16];
Ying Xueeb8b00f2014-05-05 08:56:16 +0800171 int res;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100172
Allan Stephens03194372008-05-21 14:55:04 -0700173 tipc_own_addr = addr;
Per Liden4323add2006-01-18 00:38:21 +0100174 tipc_named_reinit();
175 tipc_port_reinit();
Ying Xueeb8b00f2014-05-05 08:56:16 +0800176 res = tipc_bclink_init();
177 if (res)
178 return res;
179
Erik Hugnea5e7ac52014-04-03 08:28:01 +0200180 tipc_nametbl_publish(TIPC_CFG_SRV, tipc_own_addr, tipc_own_addr,
181 TIPC_ZONE_SCOPE, 0, tipc_own_addr);
Ying Xue7216cd92014-04-21 10:55:48 +0800182
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400183 pr_info("Started in network mode\n");
184 pr_info("Own node address %s, network identity %u\n",
185 tipc_addr_string_fill(addr_string, tipc_own_addr), tipc_net_id);
Ying Xueeb8b00f2014-05-05 08:56:16 +0800186 return 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100187}
188
Per Liden4323add2006-01-18 00:38:21 +0100189void tipc_net_stop(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100190{
Allan Stephensb58343f2011-11-08 13:48:28 -0500191 if (!tipc_own_addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100192 return;
Ying Xue46651c52014-03-27 12:54:36 +0800193
Erik Hugnea5e7ac52014-04-03 08:28:01 +0200194 tipc_nametbl_withdraw(TIPC_CFG_SRV, tipc_own_addr, 0, tipc_own_addr);
Ying Xuef97e4552014-04-21 10:55:44 +0800195 rtnl_lock();
Allan Stephens97f1b622011-10-20 09:48:05 -0400196 tipc_bearer_stop();
Per Liden4323add2006-01-18 00:38:21 +0100197 tipc_bclink_stop();
Ying Xue46651c52014-03-27 12:54:36 +0800198 tipc_node_stop();
Ying Xuef97e4552014-04-21 10:55:44 +0800199 rtnl_unlock();
Ying Xue46651c52014-03-27 12:54:36 +0800200
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400201 pr_info("Left network mode\n");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100202}