net.c 8.0 KB

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