blob: f6303d79f7f53645881404668f5ed48d9742a22b [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"
Per Lidenb97bf3f2006-01-02 19:04:38 +010042#include "config.h"
43
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090044/*
Per Lidenb97bf3f2006-01-02 19:04:38 +010045 * The TIPC locking policy is designed to ensure a very fine locking
46 * granularity, permitting complete parallel access to individual
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090047 * port and node/link instances. The code consists of three major
Per Lidenb97bf3f2006-01-02 19:04:38 +010048 * locking domains, each protected with their own disjunct set of locks.
49 *
50 * 1: The routing hierarchy.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090051 * Comprises the structures 'zone', 'cluster', 'node', 'link'
52 * and 'bearer'. The whole hierarchy is protected by a big
53 * read/write lock, tipc_net_lock, to enssure that nothing is added
54 * or removed while code is accessing any of these structures.
55 * This layer must not be called from the two others while they
Per Lidenb97bf3f2006-01-02 19:04:38 +010056 * hold any of their own locks.
57 * Neither must it itself do any upcalls to the other two before
Per Liden4323add2006-01-18 00:38:21 +010058 * it has released tipc_net_lock and other protective locks.
Per Lidenb97bf3f2006-01-02 19:04:38 +010059 *
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090060 * Within the tipc_net_lock domain there are two sub-domains;'node' and
Per Lidenb97bf3f2006-01-02 19:04:38 +010061 * 'bearer', where local write operations are permitted,
62 * provided that those are protected by individual spin_locks
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090063 * per instance. Code holding tipc_net_lock(read) and a node spin_lock
Per Lidenb97bf3f2006-01-02 19:04:38 +010064 * is permitted to poke around in both the node itself and its
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090065 * subordinate links. I.e, it can update link counters and queues,
66 * change link state, send protocol messages, and alter the
67 * "active_links" array in the node; but it can _not_ remove a link
Per Lidenb97bf3f2006-01-02 19:04:38 +010068 * or a node from the overall structure.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090069 * Correspondingly, individual bearers may change status within a
70 * tipc_net_lock(read), protected by an individual spin_lock ber bearer
Per Liden4323add2006-01-18 00:38:21 +010071 * instance, but it needs tipc_net_lock(write) to remove/add any bearers.
Per Lidenb97bf3f2006-01-02 19:04:38 +010072 *
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090073 *
74 * 2: The transport level of the protocol.
75 * This consists of the structures port, (and its user level
76 * representations, such as user_port and tipc_sock), reference and
77 * tipc_user (port.c, reg.c, socket.c).
Per Lidenb97bf3f2006-01-02 19:04:38 +010078 *
79 * This layer has four different locks:
80 * - The tipc_port spin_lock. This is protecting each port instance
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090081 * from parallel data access and removal. Since we can not place
82 * this lock in the port itself, it has been placed in the
Per Lidenb97bf3f2006-01-02 19:04:38 +010083 * corresponding reference table entry, which has the same life
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090084 * cycle as the module. This entry is difficult to access from
85 * outside the TIPC core, however, so a pointer to the lock has
86 * been added in the port instance, -to be used for unlocking
Per Lidenb97bf3f2006-01-02 19:04:38 +010087 * only.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090088 * - A read/write lock to protect the reference table itself (teg.c).
89 * (Nobody is using read-only access to this, so it can just as
Per Lidenb97bf3f2006-01-02 19:04:38 +010090 * well be changed to a spin_lock)
91 * - A spin lock to protect the registry of kernel/driver users (reg.c)
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090092 * - A global spin_lock (tipc_port_lock), which only task is to ensure
Per Lidenb97bf3f2006-01-02 19:04:38 +010093 * consistency where more than one port is involved in an operation,
94 * i.e., whe a port is part of a linked list of ports.
95 * There are two such lists; 'port_list', which is used for management,
96 * and 'wait_list', which is used to queue ports during congestion.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090097 *
Per Lidenb97bf3f2006-01-02 19:04:38 +010098 * 3: The name table (name_table.c, name_distr.c, subscription.c)
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090099 * - There is one big read/write-lock (tipc_nametbl_lock) protecting the
100 * overall name table structure. Nothing must be added/removed to
Per Lidenb97bf3f2006-01-02 19:04:38 +0100101 * this structure without holding write access to it.
102 * - There is one local spin_lock per sub_sequence, which can be seen
Per Liden4323add2006-01-18 00:38:21 +0100103 * as a sub-domain to the tipc_nametbl_lock domain. It is used only
Per Lidenb97bf3f2006-01-02 19:04:38 +0100104 * for translation operations, and is needed because a translation
105 * steps the root of the 'publication' linked list between each lookup.
Per Liden4323add2006-01-18 00:38:21 +0100106 * This is always used within the scope of a tipc_nametbl_lock(read).
Per Lidenb97bf3f2006-01-02 19:04:38 +0100107 * - A local spin_lock protecting the queue of subscriber events.
108*/
109
Ingo Molnar34af9462006-06-27 02:53:55 -0700110DEFINE_RWLOCK(tipc_net_lock);
Allan Stephensd1bcb112011-02-25 10:01:58 -0500111struct tipc_node **tipc_nodes;
112u32 tipc_highest_node;
113atomic_t tipc_num_links;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100114
Allan Stephens8f92df62010-12-31 18:59:19 +0000115static int net_start(void)
116{
Allan Stephensd1bcb112011-02-25 10:01:58 -0500117 tipc_nodes = kcalloc(tipc_max_nodes + 1,
118 sizeof(*tipc_nodes), GFP_ATOMIC);
119 tipc_highest_node = 0;
120 atomic_set(&tipc_num_links, 0);
Allan Stephens8f92df62010-12-31 18:59:19 +0000121
Allan Stephensd1bcb112011-02-25 10:01:58 -0500122 return tipc_nodes ? 0 : -ENOMEM;
Allan Stephens8f92df62010-12-31 18:59:19 +0000123}
124
Per Liden4323add2006-01-18 00:38:21 +0100125static void net_stop(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100126{
Allan Stephens8f92df62010-12-31 18:59:19 +0000127 u32 n_num;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100128
Allan Stephensd1bcb112011-02-25 10:01:58 -0500129 for (n_num = 1; n_num <= tipc_highest_node; n_num++)
130 tipc_node_delete(tipc_nodes[n_num]);
131 kfree(tipc_nodes);
132 tipc_nodes = NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100133}
134
135static void net_route_named_msg(struct sk_buff *buf)
136{
137 struct tipc_msg *msg = buf_msg(buf);
138 u32 dnode;
139 u32 dport;
140
141 if (!msg_named(msg)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100142 buf_discard(buf);
143 return;
144 }
145
146 dnode = addr_domain(msg_lookup_scope(msg));
Per Liden4323add2006-01-18 00:38:21 +0100147 dport = tipc_nametbl_translate(msg_nametype(msg), msg_nameinst(msg), &dnode);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100148 if (dport) {
149 msg_set_destnode(msg, dnode);
150 msg_set_destport(msg, dport);
Per Liden4323add2006-01-18 00:38:21 +0100151 tipc_net_route_msg(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100152 return;
153 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100154 tipc_reject_msg(buf, TIPC_ERR_NO_NAME);
155}
156
Per Liden4323add2006-01-18 00:38:21 +0100157void tipc_net_route_msg(struct sk_buff *buf)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100158{
159 struct tipc_msg *msg;
160 u32 dnode;
161
162 if (!buf)
163 return;
164 msg = buf_msg(buf);
165
166 msg_incr_reroute_cnt(msg);
167 if (msg_reroute_cnt(msg) > 6) {
168 if (msg_errcode(msg)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100169 buf_discard(buf);
170 } else {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900171 tipc_reject_msg(buf, msg_destport(msg) ?
Per Lidenb97bf3f2006-01-02 19:04:38 +0100172 TIPC_ERR_NO_PORT : TIPC_ERR_NO_NAME);
173 }
174 return;
175 }
176
Per Lidenb97bf3f2006-01-02 19:04:38 +0100177 /* Handle message for this node */
178 dnode = msg_short(msg) ? tipc_own_addr : msg_destnode(msg);
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000179 if (tipc_in_scope(dnode, tipc_own_addr)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100180 if (msg_isdata(msg)) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900181 if (msg_mcast(msg))
Per Liden4323add2006-01-18 00:38:21 +0100182 tipc_port_recv_mcast(buf, NULL);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100183 else if (msg_destport(msg))
Per Liden4323add2006-01-18 00:38:21 +0100184 tipc_port_recv_msg(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100185 else
186 net_route_named_msg(buf);
187 return;
188 }
189 switch (msg_user(msg)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100190 case NAME_DISTRIBUTOR:
Per Liden4323add2006-01-18 00:38:21 +0100191 tipc_named_recv(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100192 break;
193 case CONN_MANAGER:
Per Liden4323add2006-01-18 00:38:21 +0100194 tipc_port_recv_proto_msg(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100195 break;
196 default:
Per Lidenb97bf3f2006-01-02 19:04:38 +0100197 buf_discard(buf);
198 }
199 return;
200 }
201
202 /* Handle message for another node */
Paul Gortmakerb2abd4c2010-09-08 13:31:24 +0000203 skb_trim(buf, msg_size(msg));
Per Liden4323add2006-01-18 00:38:21 +0100204 tipc_link_send(buf, dnode, msg_link_selector(msg));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100205}
206
Allan Stephens03194372008-05-21 14:55:04 -0700207int tipc_net_start(u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100208{
209 char addr_string[16];
210 int res;
211
212 if (tipc_mode != TIPC_NODE_MODE)
213 return -ENOPROTOOPT;
214
Allan Stephens03194372008-05-21 14:55:04 -0700215 tipc_subscr_stop();
216 tipc_cfg_stop();
217
218 tipc_own_addr = addr;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100219 tipc_mode = TIPC_NET_MODE;
Per Liden4323add2006-01-18 00:38:21 +0100220 tipc_named_reinit();
221 tipc_port_reinit();
Per Lidenb97bf3f2006-01-02 19:04:38 +0100222
Allan Stephens8f92df62010-12-31 18:59:19 +0000223 res = net_start();
224 if (res)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100225 return res;
Allan Stephens8f92df62010-12-31 18:59:19 +0000226 res = tipc_bclink_init();
227 if (res)
228 return res;
Allan Stephens03194372008-05-21 14:55:04 -0700229
Per Liden4323add2006-01-18 00:38:21 +0100230 tipc_k_signal((Handler)tipc_subscr_start, 0);
231 tipc_k_signal((Handler)tipc_cfg_init, 0);
Allan Stephens03194372008-05-21 14:55:04 -0700232
Per Lidenb97bf3f2006-01-02 19:04:38 +0100233 info("Started in network mode\n");
234 info("Own node address %s, network identity %u\n",
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000235 tipc_addr_string_fill(addr_string, tipc_own_addr), tipc_net_id);
Allan Stephens0e35fd52008-07-14 22:44:01 -0700236 return 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100237}
238
Per Liden4323add2006-01-18 00:38:21 +0100239void tipc_net_stop(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100240{
241 if (tipc_mode != TIPC_NET_MODE)
242 return;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900243 write_lock_bh(&tipc_net_lock);
Per Liden4323add2006-01-18 00:38:21 +0100244 tipc_bearer_stop();
Per Lidenb97bf3f2006-01-02 19:04:38 +0100245 tipc_mode = TIPC_NODE_MODE;
Per Liden4323add2006-01-18 00:38:21 +0100246 tipc_bclink_stop();
Per Lidenb97bf3f2006-01-02 19:04:38 +0100247 net_stop();
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900248 write_unlock_bh(&tipc_net_lock);
Frans Popa570f092010-03-24 07:57:29 +0000249 info("Left network mode\n");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100250}
251