name_distr.c 9.7 KB

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