net.c 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250
  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. #include "core.h"
  37. #include "net.h"
  38. #include "name_distr.h"
  39. #include "subscr.h"
  40. #include "port.h"
  41. #include "config.h"
  42. /*
  43. * The TIPC locking policy is designed to ensure a very fine locking
  44. * granularity, permitting complete parallel access to individual
  45. * port and node/link instances. The code consists of three major
  46. * locking domains, each protected with their own disjunct set of locks.
  47. *
  48. * 1: The routing hierarchy.
  49. * Comprises the structures 'zone', 'cluster', 'node', 'link'
  50. * and 'bearer'. The whole hierarchy is protected by a big
  51. * read/write lock, tipc_net_lock, to enssure that nothing is added
  52. * or removed while code is accessing any of these structures.
  53. * This layer must not be called from the two others while they
  54. * hold any of their own locks.
  55. * Neither must it itself do any upcalls to the other two before
  56. * it has released tipc_net_lock and other protective locks.
  57. *
  58. * Within the tipc_net_lock domain there are two sub-domains;'node' and
  59. * 'bearer', where local write operations are permitted,
  60. * provided that those are protected by individual spin_locks
  61. * per instance. Code holding tipc_net_lock(read) and a node spin_lock
  62. * is permitted to poke around in both the node itself and its
  63. * subordinate links. I.e, it can update link counters and queues,
  64. * change link state, send protocol messages, and alter the
  65. * "active_links" array in the node; but it can _not_ remove a link
  66. * or a node from the overall structure.
  67. * Correspondingly, individual bearers may change status within a
  68. * tipc_net_lock(read), protected by an individual spin_lock ber bearer
  69. * instance, but it needs tipc_net_lock(write) to remove/add any bearers.
  70. *
  71. *
  72. * 2: The transport level of the protocol.
  73. * This consists of the structures port, (and its user level
  74. * representations, such as user_port and tipc_sock), reference and
  75. * tipc_user (port.c, reg.c, socket.c).
  76. *
  77. * This layer has four different locks:
  78. * - The tipc_port spin_lock. This is protecting each port instance
  79. * from parallel data access and removal. Since we can not place
  80. * this lock in the port itself, it has been placed in the
  81. * corresponding reference table entry, which has the same life
  82. * cycle as the module. This entry is difficult to access from
  83. * outside the TIPC core, however, so a pointer to the lock has
  84. * been added in the port instance, -to be used for unlocking
  85. * only.
  86. * - A read/write lock to protect the reference table itself (teg.c).
  87. * (Nobody is using read-only access to this, so it can just as
  88. * well be changed to a spin_lock)
  89. * - A spin lock to protect the registry of kernel/driver users (reg.c)
  90. * - A global spin_lock (tipc_port_lock), which only task is to ensure
  91. * consistency where more than one port is involved in an operation,
  92. * i.e., whe a port is part of a linked list of ports.
  93. * There are two such lists; 'port_list', which is used for management,
  94. * and 'wait_list', which is used to queue ports during congestion.
  95. *
  96. * 3: The name table (name_table.c, name_distr.c, subscription.c)
  97. * - There is one big read/write-lock (tipc_nametbl_lock) protecting the
  98. * overall name table structure. Nothing must be added/removed to
  99. * this structure without holding write access to it.
  100. * - There is one local spin_lock per sub_sequence, which can be seen
  101. * as a sub-domain to the tipc_nametbl_lock domain. It is used only
  102. * for translation operations, and is needed because a translation
  103. * steps the root of the 'publication' linked list between each lookup.
  104. * This is always used within the scope of a tipc_nametbl_lock(read).
  105. * - A local spin_lock protecting the queue of subscriber events.
  106. */
  107. DEFINE_RWLOCK(tipc_net_lock);
  108. struct tipc_node **tipc_nodes;
  109. u32 tipc_highest_node;
  110. atomic_t tipc_num_links;
  111. static int net_start(void)
  112. {
  113. tipc_nodes = kcalloc(4096, sizeof(*tipc_nodes), GFP_ATOMIC);
  114. tipc_highest_node = 0;
  115. atomic_set(&tipc_num_links, 0);
  116. return tipc_nodes ? 0 : -ENOMEM;
  117. }
  118. static void net_stop(void)
  119. {
  120. u32 n_num;
  121. for (n_num = 1; n_num <= tipc_highest_node; n_num++)
  122. tipc_node_delete(tipc_nodes[n_num]);
  123. kfree(tipc_nodes);
  124. tipc_nodes = NULL;
  125. }
  126. static void net_route_named_msg(struct sk_buff *buf)
  127. {
  128. struct tipc_msg *msg = buf_msg(buf);
  129. u32 dnode;
  130. u32 dport;
  131. if (!msg_named(msg)) {
  132. buf_discard(buf);
  133. return;
  134. }
  135. dnode = addr_domain(msg_lookup_scope(msg));
  136. dport = tipc_nametbl_translate(msg_nametype(msg), msg_nameinst(msg), &dnode);
  137. if (dport) {
  138. msg_set_destnode(msg, dnode);
  139. msg_set_destport(msg, dport);
  140. tipc_net_route_msg(buf);
  141. return;
  142. }
  143. tipc_reject_msg(buf, TIPC_ERR_NO_NAME);
  144. }
  145. void tipc_net_route_msg(struct sk_buff *buf)
  146. {
  147. struct tipc_msg *msg;
  148. u32 dnode;
  149. if (!buf)
  150. return;
  151. msg = buf_msg(buf);
  152. msg_incr_reroute_cnt(msg);
  153. if (msg_reroute_cnt(msg) > 6) {
  154. if (msg_errcode(msg)) {
  155. buf_discard(buf);
  156. } else {
  157. tipc_reject_msg(buf, msg_destport(msg) ?
  158. TIPC_ERR_NO_PORT : TIPC_ERR_NO_NAME);
  159. }
  160. return;
  161. }
  162. /* Handle message for this node */
  163. dnode = msg_short(msg) ? tipc_own_addr : msg_destnode(msg);
  164. if (tipc_in_scope(dnode, tipc_own_addr)) {
  165. if (msg_isdata(msg)) {
  166. if (msg_mcast(msg))
  167. tipc_port_recv_mcast(buf, NULL);
  168. else if (msg_destport(msg))
  169. tipc_port_recv_msg(buf);
  170. else
  171. net_route_named_msg(buf);
  172. return;
  173. }
  174. switch (msg_user(msg)) {
  175. case NAME_DISTRIBUTOR:
  176. tipc_named_recv(buf);
  177. break;
  178. case CONN_MANAGER:
  179. tipc_port_recv_proto_msg(buf);
  180. break;
  181. default:
  182. buf_discard(buf);
  183. }
  184. return;
  185. }
  186. /* Handle message for another node */
  187. skb_trim(buf, msg_size(msg));
  188. tipc_link_send(buf, dnode, msg_link_selector(msg));
  189. }
  190. int tipc_net_start(u32 addr)
  191. {
  192. char addr_string[16];
  193. int res;
  194. if (tipc_mode != TIPC_NODE_MODE)
  195. return -ENOPROTOOPT;
  196. tipc_subscr_stop();
  197. tipc_cfg_stop();
  198. tipc_own_addr = addr;
  199. tipc_mode = TIPC_NET_MODE;
  200. tipc_named_reinit();
  201. tipc_port_reinit();
  202. res = net_start();
  203. if (res)
  204. return res;
  205. res = tipc_bclink_init();
  206. if (res)
  207. return res;
  208. tipc_k_signal((Handler)tipc_subscr_start, 0);
  209. tipc_k_signal((Handler)tipc_cfg_init, 0);
  210. info("Started in network mode\n");
  211. info("Own node address %s, network identity %u\n",
  212. tipc_addr_string_fill(addr_string, tipc_own_addr), tipc_net_id);
  213. return 0;
  214. }
  215. void tipc_net_stop(void)
  216. {
  217. if (tipc_mode != TIPC_NET_MODE)
  218. return;
  219. write_lock_bh(&tipc_net_lock);
  220. tipc_bearer_stop();
  221. tipc_mode = TIPC_NODE_MODE;
  222. tipc_bclink_stop();
  223. net_stop();
  224. write_unlock_bh(&tipc_net_lock);
  225. info("Left network mode\n");
  226. }