net.c revision d1bcb11544109114d72965afea7805cc3e16a83a
1/*
2 * net/tipc/net.c: TIPC network routing code
3 *
4 * Copyright (c) 1995-2006, Ericsson AB
5 * Copyright (c) 2005, 2010-2011, Wind River Systems
6 * 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 *
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.
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.
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
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
38#include "net.h"
39#include "name_distr.h"
40#include "subscr.h"
41#include "port.h"
42#include "config.h"
43
44/*
45 * The TIPC locking policy is designed to ensure a very fine locking
46 * granularity, permitting complete parallel access to individual
47 * port and node/link instances. The code consists of three major
48 * locking domains, each protected with their own disjunct set of locks.
49 *
50 * 1: The routing hierarchy.
51 *    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
56 *    hold any of their own locks.
57 *    Neither must it itself do any upcalls to the other two before
58 *    it has released tipc_net_lock and other protective locks.
59 *
60 *   Within the tipc_net_lock domain there are two sub-domains;'node' and
61 *   'bearer', where local write operations are permitted,
62 *   provided that those are protected by individual spin_locks
63 *   per instance. Code holding tipc_net_lock(read) and a node spin_lock
64 *   is permitted to poke around in both the node itself and its
65 *   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
68 *   or a node from the overall structure.
69 *   Correspondingly, individual bearers may change status within a
70 *   tipc_net_lock(read), protected by an individual spin_lock ber bearer
71 *   instance, but it needs tipc_net_lock(write) to remove/add any bearers.
72 *
73 *
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).
78 *
79 *     This layer has four different locks:
80 *     - The tipc_port spin_lock. This is protecting each port instance
81 *       from parallel data access and removal. Since we can not place
82 *       this lock in the port itself, it has been placed in the
83 *       corresponding reference table entry, which has the same life
84 *       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
87 *       only.
88 *     - 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
90 *       well be changed to a spin_lock)
91 *     - A spin lock to protect the registry of kernel/driver users (reg.c)
92 *     - A global spin_lock (tipc_port_lock), which only task is to ensure
93 *       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.
97 *
98 *  3: The name table (name_table.c, name_distr.c, subscription.c)
99 *     - There is one big read/write-lock (tipc_nametbl_lock) protecting the
100 *       overall name table structure. Nothing must be added/removed to
101 *       this structure without holding write access to it.
102 *     - There is one local spin_lock per sub_sequence, which can be seen
103 *       as a sub-domain to the tipc_nametbl_lock domain. It is used only
104 *       for translation operations, and is needed because a translation
105 *       steps the root of the 'publication' linked list between each lookup.
106 *       This is always used within the scope of a tipc_nametbl_lock(read).
107 *     - A local spin_lock protecting the queue of subscriber events.
108*/
109
110DEFINE_RWLOCK(tipc_net_lock);
111struct tipc_node **tipc_nodes;
112u32 tipc_highest_node;
113atomic_t tipc_num_links;
114
115static int net_start(void)
116{
117	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);
121
122	return tipc_nodes ? 0 : -ENOMEM;
123}
124
125static void net_stop(void)
126{
127	u32 n_num;
128
129	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;
133}
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)) {
142		buf_discard(buf);
143		return;
144	}
145
146	dnode = addr_domain(msg_lookup_scope(msg));
147	dport = tipc_nametbl_translate(msg_nametype(msg), msg_nameinst(msg), &dnode);
148	if (dport) {
149		msg_set_destnode(msg, dnode);
150		msg_set_destport(msg, dport);
151		tipc_net_route_msg(buf);
152		return;
153	}
154	tipc_reject_msg(buf, TIPC_ERR_NO_NAME);
155}
156
157void tipc_net_route_msg(struct sk_buff *buf)
158{
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)) {
169			buf_discard(buf);
170		} else {
171			tipc_reject_msg(buf, msg_destport(msg) ?
172					TIPC_ERR_NO_PORT : TIPC_ERR_NO_NAME);
173		}
174		return;
175	}
176
177	/* Handle message for this node */
178	dnode = msg_short(msg) ? tipc_own_addr : msg_destnode(msg);
179	if (tipc_in_scope(dnode, tipc_own_addr)) {
180		if (msg_isdata(msg)) {
181			if (msg_mcast(msg))
182				tipc_port_recv_mcast(buf, NULL);
183			else if (msg_destport(msg))
184				tipc_port_recv_msg(buf);
185			else
186				net_route_named_msg(buf);
187			return;
188		}
189		switch (msg_user(msg)) {
190		case NAME_DISTRIBUTOR:
191			tipc_named_recv(buf);
192			break;
193		case CONN_MANAGER:
194			tipc_port_recv_proto_msg(buf);
195			break;
196		default:
197			buf_discard(buf);
198		}
199		return;
200	}
201
202	/* Handle message for another node */
203	skb_trim(buf, msg_size(msg));
204	tipc_link_send(buf, dnode, msg_link_selector(msg));
205}
206
207int tipc_net_start(u32 addr)
208{
209	char addr_string[16];
210	int res;
211
212	if (tipc_mode != TIPC_NODE_MODE)
213		return -ENOPROTOOPT;
214
215	tipc_subscr_stop();
216	tipc_cfg_stop();
217
218	tipc_own_addr = addr;
219	tipc_mode = TIPC_NET_MODE;
220	tipc_named_reinit();
221	tipc_port_reinit();
222
223	res = net_start();
224	if (res)
225		return res;
226	res = tipc_bclink_init();
227	if (res)
228		return res;
229
230	tipc_k_signal((Handler)tipc_subscr_start, 0);
231	tipc_k_signal((Handler)tipc_cfg_init, 0);
232
233	info("Started in network mode\n");
234	info("Own node address %s, network identity %u\n",
235	     tipc_addr_string_fill(addr_string, tipc_own_addr), tipc_net_id);
236	return 0;
237}
238
239void tipc_net_stop(void)
240{
241	if (tipc_mode != TIPC_NET_MODE)
242		return;
243	write_lock_bh(&tipc_net_lock);
244	tipc_bearer_stop();
245	tipc_mode = TIPC_NODE_MODE;
246	tipc_bclink_stop();
247	net_stop();
248	write_unlock_bh(&tipc_net_lock);
249	info("Left network mode\n");
250}
251
252