name_distr.c 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351
  1. /*
  2. * net/tipc/name_distr.c: TIPC name distribution code
  3. *
  4. * Copyright (c) 2000-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 "link.h"
  38. #include "name_distr.h"
  39. int sysctl_tipc_named_timeout __read_mostly = 2000;
  40. struct distr_queue_item {
  41. struct distr_item i;
  42. u32 dtype;
  43. u32 node;
  44. unsigned long expires;
  45. struct list_head next;
  46. };
  47. /**
  48. * publ_to_item - add publication info to a publication message
  49. */
  50. static void publ_to_item(struct distr_item *i, struct publication *p)
  51. {
  52. i->type = htonl(p->type);
  53. i->lower = htonl(p->lower);
  54. i->upper = htonl(p->upper);
  55. i->port = htonl(p->port);
  56. i->key = htonl(p->key);
  57. }
  58. /**
  59. * named_prepare_buf - allocate & initialize a publication message
  60. *
  61. * The buffer returned is of size INT_H_SIZE + payload size
  62. */
  63. static struct sk_buff *named_prepare_buf(struct net *net, u32 type, u32 size,
  64. u32 dest)
  65. {
  66. struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE + size, GFP_ATOMIC);
  67. u32 self = tipc_own_addr(net);
  68. struct tipc_msg *msg;
  69. if (buf != NULL) {
  70. msg = buf_msg(buf);
  71. tipc_msg_init(self, msg, NAME_DISTRIBUTOR,
  72. type, INT_H_SIZE, dest);
  73. msg_set_size(msg, INT_H_SIZE + size);
  74. }
  75. return buf;
  76. }
  77. /**
  78. * tipc_named_publish - tell other nodes about a new publication by this node
  79. */
  80. struct sk_buff *tipc_named_publish(struct net *net, struct publication *publ)
  81. {
  82. struct name_table *nt = tipc_name_table(net);
  83. struct distr_item *item;
  84. struct sk_buff *skb;
  85. if (publ->scope == TIPC_NODE_SCOPE) {
  86. list_add_tail_rcu(&publ->binding_node, &nt->node_scope);
  87. return NULL;
  88. }
  89. write_lock_bh(&nt->cluster_scope_lock);
  90. list_add_tail(&publ->binding_node, &nt->cluster_scope);
  91. write_unlock_bh(&nt->cluster_scope_lock);
  92. skb = named_prepare_buf(net, PUBLICATION, ITEM_SIZE, 0);
  93. if (!skb) {
  94. pr_warn("Publication distribution failure\n");
  95. return NULL;
  96. }
  97. item = (struct distr_item *)msg_data(buf_msg(skb));
  98. publ_to_item(item, publ);
  99. return skb;
  100. }
  101. /**
  102. * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node
  103. */
  104. struct sk_buff *tipc_named_withdraw(struct net *net, struct publication *publ)
  105. {
  106. struct name_table *nt = tipc_name_table(net);
  107. struct sk_buff *buf;
  108. struct distr_item *item;
  109. write_lock_bh(&nt->cluster_scope_lock);
  110. list_del(&publ->binding_node);
  111. write_unlock_bh(&nt->cluster_scope_lock);
  112. if (publ->scope == TIPC_NODE_SCOPE)
  113. return NULL;
  114. buf = named_prepare_buf(net, WITHDRAWAL, ITEM_SIZE, 0);
  115. if (!buf) {
  116. pr_warn("Withdrawal distribution failure\n");
  117. return NULL;
  118. }
  119. item = (struct distr_item *)msg_data(buf_msg(buf));
  120. publ_to_item(item, publ);
  121. return buf;
  122. }
  123. /**
  124. * named_distribute - prepare name info for bulk distribution to another node
  125. * @list: list of messages (buffers) to be returned from this function
  126. * @dnode: node to be updated
  127. * @pls: linked list of publication items to be packed into buffer chain
  128. */
  129. static void named_distribute(struct net *net, struct sk_buff_head *list,
  130. u32 dnode, struct list_head *pls)
  131. {
  132. struct publication *publ;
  133. struct sk_buff *skb = NULL;
  134. struct distr_item *item = NULL;
  135. u32 msg_dsz = ((tipc_node_get_mtu(net, dnode, 0) - INT_H_SIZE) /
  136. ITEM_SIZE) * ITEM_SIZE;
  137. u32 msg_rem = msg_dsz;
  138. list_for_each_entry(publ, pls, binding_node) {
  139. /* Prepare next buffer: */
  140. if (!skb) {
  141. skb = named_prepare_buf(net, PUBLICATION, msg_rem,
  142. dnode);
  143. if (!skb) {
  144. pr_warn("Bulk publication failure\n");
  145. return;
  146. }
  147. msg_set_bc_ack_invalid(buf_msg(skb), true);
  148. item = (struct distr_item *)msg_data(buf_msg(skb));
  149. }
  150. /* Pack publication into message: */
  151. publ_to_item(item, publ);
  152. item++;
  153. msg_rem -= ITEM_SIZE;
  154. /* Append full buffer to list: */
  155. if (!msg_rem) {
  156. __skb_queue_tail(list, skb);
  157. skb = NULL;
  158. msg_rem = msg_dsz;
  159. }
  160. }
  161. if (skb) {
  162. msg_set_size(buf_msg(skb), INT_H_SIZE + (msg_dsz - msg_rem));
  163. skb_trim(skb, INT_H_SIZE + (msg_dsz - msg_rem));
  164. __skb_queue_tail(list, skb);
  165. }
  166. }
  167. /**
  168. * tipc_named_node_up - tell specified node about all publications by this node
  169. */
  170. void tipc_named_node_up(struct net *net, u32 dnode)
  171. {
  172. struct name_table *nt = tipc_name_table(net);
  173. struct sk_buff_head head;
  174. __skb_queue_head_init(&head);
  175. read_lock_bh(&nt->cluster_scope_lock);
  176. named_distribute(net, &head, dnode, &nt->cluster_scope);
  177. tipc_node_xmit(net, &head, dnode, 0);
  178. read_unlock_bh(&nt->cluster_scope_lock);
  179. }
  180. /**
  181. * tipc_publ_purge - remove publication associated with a failed node
  182. *
  183. * Invoked for each publication issued by a newly failed node.
  184. * Removes publication structure from name table & deletes it.
  185. */
  186. static void tipc_publ_purge(struct net *net, struct publication *publ, u32 addr)
  187. {
  188. struct tipc_net *tn = tipc_net(net);
  189. struct publication *p;
  190. spin_lock_bh(&tn->nametbl_lock);
  191. p = tipc_nametbl_remove_publ(net, publ->type, publ->lower, publ->upper,
  192. publ->node, publ->key);
  193. if (p)
  194. tipc_node_unsubscribe(net, &p->binding_node, addr);
  195. spin_unlock_bh(&tn->nametbl_lock);
  196. if (p != publ) {
  197. pr_err("Unable to remove publication from failed node\n"
  198. " (type=%u, lower=%u, node=0x%x, port=%u, key=%u)\n",
  199. publ->type, publ->lower, publ->node, publ->port,
  200. publ->key);
  201. }
  202. if (p)
  203. kfree_rcu(p, rcu);
  204. }
  205. /**
  206. * tipc_dist_queue_purge - remove deferred updates from a node that went down
  207. */
  208. static void tipc_dist_queue_purge(struct net *net, u32 addr)
  209. {
  210. struct tipc_net *tn = net_generic(net, tipc_net_id);
  211. struct distr_queue_item *e, *tmp;
  212. spin_lock_bh(&tn->nametbl_lock);
  213. list_for_each_entry_safe(e, tmp, &tn->dist_queue, next) {
  214. if (e->node != addr)
  215. continue;
  216. list_del(&e->next);
  217. kfree(e);
  218. }
  219. spin_unlock_bh(&tn->nametbl_lock);
  220. }
  221. void tipc_publ_notify(struct net *net, struct list_head *nsub_list, u32 addr)
  222. {
  223. struct publication *publ, *tmp;
  224. list_for_each_entry_safe(publ, tmp, nsub_list, binding_node)
  225. tipc_publ_purge(net, publ, addr);
  226. tipc_dist_queue_purge(net, addr);
  227. }
  228. /**
  229. * tipc_update_nametbl - try to process a nametable update and notify
  230. * subscribers
  231. *
  232. * tipc_nametbl_lock must be held.
  233. * Returns the publication item if successful, otherwise NULL.
  234. */
  235. static bool tipc_update_nametbl(struct net *net, struct distr_item *i,
  236. u32 node, u32 dtype)
  237. {
  238. struct publication *p = NULL;
  239. u32 lower = ntohl(i->lower);
  240. u32 upper = ntohl(i->upper);
  241. u32 type = ntohl(i->type);
  242. u32 port = ntohl(i->port);
  243. u32 key = ntohl(i->key);
  244. if (dtype == PUBLICATION) {
  245. p = tipc_nametbl_insert_publ(net, type, lower, upper,
  246. TIPC_CLUSTER_SCOPE, node,
  247. port, key);
  248. if (p) {
  249. tipc_node_subscribe(net, &p->binding_node, node);
  250. return true;
  251. }
  252. } else if (dtype == WITHDRAWAL) {
  253. p = tipc_nametbl_remove_publ(net, type, lower,
  254. upper, node, key);
  255. if (p) {
  256. tipc_node_unsubscribe(net, &p->binding_node, node);
  257. kfree_rcu(p, rcu);
  258. return true;
  259. }
  260. pr_warn_ratelimited("Failed to remove binding %u,%u from %x\n",
  261. type, lower, node);
  262. } else {
  263. pr_warn("Unrecognized name table message received\n");
  264. }
  265. return false;
  266. }
  267. /**
  268. * tipc_named_rcv - process name table update messages sent by another node
  269. */
  270. void tipc_named_rcv(struct net *net, struct sk_buff_head *inputq)
  271. {
  272. struct tipc_net *tn = net_generic(net, tipc_net_id);
  273. struct tipc_msg *msg;
  274. struct distr_item *item;
  275. uint count;
  276. u32 node;
  277. struct sk_buff *skb;
  278. int mtype;
  279. spin_lock_bh(&tn->nametbl_lock);
  280. for (skb = skb_dequeue(inputq); skb; skb = skb_dequeue(inputq)) {
  281. skb_linearize(skb);
  282. msg = buf_msg(skb);
  283. mtype = msg_type(msg);
  284. item = (struct distr_item *)msg_data(msg);
  285. count = msg_data_sz(msg) / ITEM_SIZE;
  286. node = msg_orignode(msg);
  287. while (count--) {
  288. tipc_update_nametbl(net, item, node, mtype);
  289. item++;
  290. }
  291. kfree_skb(skb);
  292. }
  293. spin_unlock_bh(&tn->nametbl_lock);
  294. }
  295. /**
  296. * tipc_named_reinit - re-initialize local publications
  297. *
  298. * This routine is called whenever TIPC networking is enabled.
  299. * All name table entries published by this node are updated to reflect
  300. * the node's new network address.
  301. */
  302. void tipc_named_reinit(struct net *net)
  303. {
  304. struct name_table *nt = tipc_name_table(net);
  305. struct tipc_net *tn = tipc_net(net);
  306. struct publication *publ;
  307. u32 self = tipc_own_addr(net);
  308. spin_lock_bh(&tn->nametbl_lock);
  309. list_for_each_entry_rcu(publ, &nt->node_scope, binding_node)
  310. publ->node = self;
  311. list_for_each_entry_rcu(publ, &nt->cluster_scope, binding_node)
  312. publ->node = self;
  313. spin_unlock_bh(&tn->nametbl_lock);
  314. }