blob: 3baf55ee098522ac352aa18d46ca8bd079864e4e [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
Per Lidenb97bf3f2006-01-02 19:04:38 +01005 * Copyright (c) 2005, 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_table.h"
40#include "name_distr.h"
41#include "subscr.h"
42#include "link.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010043#include "port.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
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090049 * port and node/link instances. The code consists of three major
Per Lidenb97bf3f2006-01-02 19:04:38 +010050 * locking domains, each protected with their own disjunct set of locks.
51 *
52 * 1: The routing hierarchy.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090053 * Comprises the structures 'zone', 'cluster', 'node', 'link'
54 * and 'bearer'. The whole hierarchy is protected by a big
55 * read/write lock, tipc_net_lock, to enssure that nothing is added
56 * or removed while code is accessing any of these structures.
57 * This layer must not be called from the two others while they
Per Lidenb97bf3f2006-01-02 19:04:38 +010058 * hold any of their own locks.
59 * Neither must it itself do any upcalls to the other two before
Per Liden4323add2006-01-18 00:38:21 +010060 * it has released tipc_net_lock and other protective locks.
Per Lidenb97bf3f2006-01-02 19:04:38 +010061 *
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090062 * Within the tipc_net_lock domain there are two sub-domains;'node' and
Per Lidenb97bf3f2006-01-02 19:04:38 +010063 * 'bearer', where local write operations are permitted,
64 * provided that those are protected by individual spin_locks
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090065 * per instance. Code holding tipc_net_lock(read) and a node spin_lock
Per Lidenb97bf3f2006-01-02 19:04:38 +010066 * is permitted to poke around in both the node itself and its
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090067 * subordinate links. I.e, it can update link counters and queues,
68 * change link state, send protocol messages, and alter the
69 * "active_links" array in the node; but it can _not_ remove a link
Per Lidenb97bf3f2006-01-02 19:04:38 +010070 * or a node from the overall structure.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090071 * Correspondingly, individual bearers may change status within a
72 * tipc_net_lock(read), protected by an individual spin_lock ber bearer
Per Liden4323add2006-01-18 00:38:21 +010073 * instance, but it needs tipc_net_lock(write) to remove/add any bearers.
Per Lidenb97bf3f2006-01-02 19:04:38 +010074 *
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090075 *
76 * 2: The transport level of the protocol.
77 * This consists of the structures port, (and its user level
78 * representations, such as user_port and tipc_sock), reference and
79 * tipc_user (port.c, reg.c, socket.c).
Per Lidenb97bf3f2006-01-02 19:04:38 +010080 *
81 * This layer has four different locks:
82 * - The tipc_port spin_lock. This is protecting each port instance
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090083 * from parallel data access and removal. Since we can not place
84 * this lock in the port itself, it has been placed in the
Per Lidenb97bf3f2006-01-02 19:04:38 +010085 * corresponding reference table entry, which has the same life
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090086 * cycle as the module. This entry is difficult to access from
87 * outside the TIPC core, however, so a pointer to the lock has
88 * been added in the port instance, -to be used for unlocking
Per Lidenb97bf3f2006-01-02 19:04:38 +010089 * only.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090090 * - A read/write lock to protect the reference table itself (teg.c).
91 * (Nobody is using read-only access to this, so it can just as
Per Lidenb97bf3f2006-01-02 19:04:38 +010092 * well be changed to a spin_lock)
93 * - A spin lock to protect the registry of kernel/driver users (reg.c)
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090094 * - A global spin_lock (tipc_port_lock), which only task is to ensure
Per Lidenb97bf3f2006-01-02 19:04:38 +010095 * consistency where more than one port is involved in an operation,
96 * i.e., whe a port is part of a linked list of ports.
97 * There are two such lists; 'port_list', which is used for management,
98 * and 'wait_list', which is used to queue ports during congestion.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090099 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100100 * 3: The name table (name_table.c, name_distr.c, subscription.c)
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900101 * - There is one big read/write-lock (tipc_nametbl_lock) protecting the
102 * overall name table structure. Nothing must be added/removed to
Per Lidenb97bf3f2006-01-02 19:04:38 +0100103 * this structure without holding write access to it.
104 * - There is one local spin_lock per sub_sequence, which can be seen
Per Liden4323add2006-01-18 00:38:21 +0100105 * as a sub-domain to the tipc_nametbl_lock domain. It is used only
Per Lidenb97bf3f2006-01-02 19:04:38 +0100106 * for translation operations, and is needed because a translation
107 * steps the root of the 'publication' linked list between each lookup.
Per Liden4323add2006-01-18 00:38:21 +0100108 * This is always used within the scope of a tipc_nametbl_lock(read).
Per Lidenb97bf3f2006-01-02 19:04:38 +0100109 * - A local spin_lock protecting the queue of subscriber events.
110*/
111
Ingo Molnar34af9462006-06-27 02:53:55 -0700112DEFINE_RWLOCK(tipc_net_lock);
Allan Stephens51f98a82010-12-31 18:59:16 +0000113struct network tipc_net;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100114
Allan Stephens8f92df62010-12-31 18:59:19 +0000115static int net_start(void)
116{
117 tipc_net.nodes = kcalloc(tipc_max_nodes + 1,
118 sizeof(*tipc_net.nodes), GFP_ATOMIC);
119 tipc_net.highest_node = 0;
120
121 return tipc_net.nodes ? 0 : -ENOMEM;
122}
123
Per Liden4323add2006-01-18 00:38:21 +0100124static void net_stop(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100125{
Allan Stephens8f92df62010-12-31 18:59:19 +0000126 u32 n_num;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100127
Allan Stephens8f92df62010-12-31 18:59:19 +0000128 for (n_num = 1; n_num <= tipc_net.highest_node; n_num++)
129 tipc_node_delete(tipc_net.nodes[n_num]);
130 kfree(tipc_net.nodes);
131 tipc_net.nodes = NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100132}
133
134static void net_route_named_msg(struct sk_buff *buf)
135{
136 struct tipc_msg *msg = buf_msg(buf);
137 u32 dnode;
138 u32 dport;
139
140 if (!msg_named(msg)) {
Per Liden4323add2006-01-18 00:38:21 +0100141 msg_dbg(msg, "tipc_net->drop_nam:");
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);
148 dbg("tipc_net->lookup<%u,%u>-><%u,%x>\n",
Per Lidenb97bf3f2006-01-02 19:04:38 +0100149 msg_nametype(msg), msg_nameinst(msg), dport, dnode);
150 if (dport) {
151 msg_set_destnode(msg, dnode);
152 msg_set_destport(msg, dport);
Per Liden4323add2006-01-18 00:38:21 +0100153 tipc_net_route_msg(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100154 return;
155 }
Per Liden4323add2006-01-18 00:38:21 +0100156 msg_dbg(msg, "tipc_net->rej:NO NAME: ");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100157 tipc_reject_msg(buf, TIPC_ERR_NO_NAME);
158}
159
Per Liden4323add2006-01-18 00:38:21 +0100160void tipc_net_route_msg(struct sk_buff *buf)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100161{
162 struct tipc_msg *msg;
163 u32 dnode;
164
165 if (!buf)
166 return;
167 msg = buf_msg(buf);
168
169 msg_incr_reroute_cnt(msg);
170 if (msg_reroute_cnt(msg) > 6) {
171 if (msg_errcode(msg)) {
172 msg_dbg(msg, "NET>DISC>:");
173 buf_discard(buf);
174 } else {
175 msg_dbg(msg, "NET>REJ>:");
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900176 tipc_reject_msg(buf, msg_destport(msg) ?
Per Lidenb97bf3f2006-01-02 19:04:38 +0100177 TIPC_ERR_NO_PORT : TIPC_ERR_NO_NAME);
178 }
179 return;
180 }
181
Per Liden4323add2006-01-18 00:38:21 +0100182 msg_dbg(msg, "tipc_net->rout: ");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100183
184 /* Handle message for this node */
185 dnode = msg_short(msg) ? tipc_own_addr : msg_destnode(msg);
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000186 if (tipc_in_scope(dnode, tipc_own_addr)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100187 if (msg_isdata(msg)) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900188 if (msg_mcast(msg))
Per Liden4323add2006-01-18 00:38:21 +0100189 tipc_port_recv_mcast(buf, NULL);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100190 else if (msg_destport(msg))
Per Liden4323add2006-01-18 00:38:21 +0100191 tipc_port_recv_msg(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100192 else
193 net_route_named_msg(buf);
194 return;
195 }
196 switch (msg_user(msg)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100197 case NAME_DISTRIBUTOR:
Per Liden4323add2006-01-18 00:38:21 +0100198 tipc_named_recv(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100199 break;
200 case CONN_MANAGER:
Per Liden4323add2006-01-18 00:38:21 +0100201 tipc_port_recv_proto_msg(buf);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100202 break;
203 default:
204 msg_dbg(msg,"DROP/NET/<REC<");
205 buf_discard(buf);
206 }
207 return;
208 }
209
210 /* Handle message for another node */
211 msg_dbg(msg, "NET>SEND>: ");
Paul Gortmakerb2abd4c2010-09-08 13:31:24 +0000212 skb_trim(buf, msg_size(msg));
Per Liden4323add2006-01-18 00:38:21 +0100213 tipc_link_send(buf, dnode, msg_link_selector(msg));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100214}
215
Allan Stephens03194372008-05-21 14:55:04 -0700216int tipc_net_start(u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100217{
218 char addr_string[16];
219 int res;
220
221 if (tipc_mode != TIPC_NODE_MODE)
222 return -ENOPROTOOPT;
223
Allan Stephens03194372008-05-21 14:55:04 -0700224 tipc_subscr_stop();
225 tipc_cfg_stop();
226
227 tipc_own_addr = addr;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100228 tipc_mode = TIPC_NET_MODE;
Per Liden4323add2006-01-18 00:38:21 +0100229 tipc_named_reinit();
230 tipc_port_reinit();
Per Lidenb97bf3f2006-01-02 19:04:38 +0100231
Allan Stephens8f92df62010-12-31 18:59:19 +0000232 res = net_start();
233 if (res)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100234 return res;
Allan Stephens8f92df62010-12-31 18:59:19 +0000235 res = tipc_bclink_init();
236 if (res)
237 return res;
Allan Stephens03194372008-05-21 14:55:04 -0700238
Per Liden4323add2006-01-18 00:38:21 +0100239 tipc_k_signal((Handler)tipc_subscr_start, 0);
240 tipc_k_signal((Handler)tipc_cfg_init, 0);
Allan Stephens03194372008-05-21 14:55:04 -0700241
Per Lidenb97bf3f2006-01-02 19:04:38 +0100242 info("Started in network mode\n");
243 info("Own node address %s, network identity %u\n",
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000244 tipc_addr_string_fill(addr_string, tipc_own_addr), tipc_net_id);
Allan Stephens0e35fd52008-07-14 22:44:01 -0700245 return 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100246}
247
Per Liden4323add2006-01-18 00:38:21 +0100248void tipc_net_stop(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100249{
250 if (tipc_mode != TIPC_NET_MODE)
251 return;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900252 write_lock_bh(&tipc_net_lock);
Per Liden4323add2006-01-18 00:38:21 +0100253 tipc_bearer_stop();
Per Lidenb97bf3f2006-01-02 19:04:38 +0100254 tipc_mode = TIPC_NODE_MODE;
Per Liden4323add2006-01-18 00:38:21 +0100255 tipc_bclink_stop();
Per Lidenb97bf3f2006-01-02 19:04:38 +0100256 net_stop();
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900257 write_unlock_bh(&tipc_net_lock);
Frans Popa570f092010-03-24 07:57:29 +0000258 info("Left network mode\n");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100259}
260