net.c 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253
  1. /*
  2. * net/tipc/net.c: TIPC network routing code
  3. *
  4. * Copyright (c) 1995-2006, 2014, 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 "socket.h"
  41. #include "node.h"
  42. #include "config.h"
  43. static const struct nla_policy tipc_nl_net_policy[TIPC_NLA_NET_MAX + 1] = {
  44. [TIPC_NLA_NET_UNSPEC] = { .type = NLA_UNSPEC },
  45. [TIPC_NLA_NET_ID] = { .type = NLA_U32 }
  46. };
  47. /*
  48. * The TIPC locking policy is designed to ensure a very fine locking
  49. * granularity, permitting complete parallel access to individual
  50. * port and node/link instances. The code consists of four major
  51. * locking domains, each protected with their own disjunct set of locks.
  52. *
  53. * 1: The bearer level.
  54. * RTNL lock is used to serialize the process of configuring bearer
  55. * on update side, and RCU lock is applied on read side to make
  56. * bearer instance valid on both paths of message transmission and
  57. * reception.
  58. *
  59. * 2: The node and link level.
  60. * All node instances are saved into two tipc_node_list and node_htable
  61. * lists. The two lists are protected by node_list_lock on write side,
  62. * and they are guarded with RCU lock on read side. Especially node
  63. * instance is destroyed only when TIPC module is removed, and we can
  64. * confirm that there has no any user who is accessing the node at the
  65. * moment. Therefore, Except for iterating the two lists within RCU
  66. * protection, it's no needed to hold RCU that we access node instance
  67. * in other places.
  68. *
  69. * In addition, all members in node structure including link instances
  70. * are protected by node spin lock.
  71. *
  72. * 3: 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. * 4: 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. int tipc_net_start(struct net *net, u32 addr)
  108. {
  109. struct tipc_net *tn = net_generic(net, tipc_net_id);
  110. char addr_string[16];
  111. int res;
  112. tipc_own_addr = addr;
  113. tipc_named_reinit();
  114. tipc_sk_reinit();
  115. res = tipc_bclink_init();
  116. if (res)
  117. return res;
  118. tipc_nametbl_publish(net, TIPC_CFG_SRV, tipc_own_addr, tipc_own_addr,
  119. TIPC_ZONE_SCOPE, 0, tipc_own_addr);
  120. pr_info("Started in network mode\n");
  121. pr_info("Own node address %s, network identity %u\n",
  122. tipc_addr_string_fill(addr_string, tipc_own_addr),
  123. tn->net_id);
  124. return 0;
  125. }
  126. void tipc_net_stop(struct net *net)
  127. {
  128. if (!tipc_own_addr)
  129. return;
  130. tipc_nametbl_withdraw(net, TIPC_CFG_SRV, tipc_own_addr, 0,
  131. tipc_own_addr);
  132. rtnl_lock();
  133. tipc_bearer_stop(net);
  134. tipc_bclink_stop();
  135. tipc_node_stop(net);
  136. rtnl_unlock();
  137. pr_info("Left network mode\n");
  138. }
  139. static int __tipc_nl_add_net(struct net *net, struct tipc_nl_msg *msg)
  140. {
  141. struct tipc_net *tn = net_generic(net, tipc_net_id);
  142. void *hdr;
  143. struct nlattr *attrs;
  144. hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_v2_family,
  145. NLM_F_MULTI, TIPC_NL_NET_GET);
  146. if (!hdr)
  147. return -EMSGSIZE;
  148. attrs = nla_nest_start(msg->skb, TIPC_NLA_NET);
  149. if (!attrs)
  150. goto msg_full;
  151. if (nla_put_u32(msg->skb, TIPC_NLA_NET_ID, tn->net_id))
  152. goto attr_msg_full;
  153. nla_nest_end(msg->skb, attrs);
  154. genlmsg_end(msg->skb, hdr);
  155. return 0;
  156. attr_msg_full:
  157. nla_nest_cancel(msg->skb, attrs);
  158. msg_full:
  159. genlmsg_cancel(msg->skb, hdr);
  160. return -EMSGSIZE;
  161. }
  162. int tipc_nl_net_dump(struct sk_buff *skb, struct netlink_callback *cb)
  163. {
  164. struct net *net = sock_net(skb->sk);
  165. int err;
  166. int done = cb->args[0];
  167. struct tipc_nl_msg msg;
  168. if (done)
  169. return 0;
  170. msg.skb = skb;
  171. msg.portid = NETLINK_CB(cb->skb).portid;
  172. msg.seq = cb->nlh->nlmsg_seq;
  173. err = __tipc_nl_add_net(net, &msg);
  174. if (err)
  175. goto out;
  176. done = 1;
  177. out:
  178. cb->args[0] = done;
  179. return skb->len;
  180. }
  181. int tipc_nl_net_set(struct sk_buff *skb, struct genl_info *info)
  182. {
  183. struct net *net = genl_info_net(info);
  184. struct tipc_net *tn = net_generic(net, tipc_net_id);
  185. struct nlattr *attrs[TIPC_NLA_NET_MAX + 1];
  186. int err;
  187. if (!info->attrs[TIPC_NLA_NET])
  188. return -EINVAL;
  189. err = nla_parse_nested(attrs, TIPC_NLA_NET_MAX,
  190. info->attrs[TIPC_NLA_NET],
  191. tipc_nl_net_policy);
  192. if (err)
  193. return err;
  194. if (attrs[TIPC_NLA_NET_ID]) {
  195. u32 val;
  196. /* Can't change net id once TIPC has joined a network */
  197. if (tipc_own_addr)
  198. return -EPERM;
  199. val = nla_get_u32(attrs[TIPC_NLA_NET_ID]);
  200. if (val < 1 || val > 9999)
  201. return -EINVAL;
  202. tn->net_id = val;
  203. }
  204. if (attrs[TIPC_NLA_NET_ADDR]) {
  205. u32 addr;
  206. /* Can't change net addr once TIPC has joined a network */
  207. if (tipc_own_addr)
  208. return -EPERM;
  209. addr = nla_get_u32(attrs[TIPC_NLA_NET_ADDR]);
  210. if (!tipc_addr_node_valid(addr))
  211. return -EINVAL;
  212. rtnl_lock();
  213. tipc_net_start(net, addr);
  214. rtnl_unlock();
  215. }
  216. return 0;
  217. }