name_distr.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377
  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. /**
  41. * struct tipc_dist_queue - queue holding deferred name table updates
  42. */
  43. static struct list_head tipc_dist_queue = LIST_HEAD_INIT(tipc_dist_queue);
  44. struct distr_queue_item {
  45. struct distr_item i;
  46. u32 dtype;
  47. u32 node;
  48. unsigned long expires;
  49. struct list_head next;
  50. };
  51. /**
  52. * publ_to_item - add publication info to a publication message
  53. */
  54. static void publ_to_item(struct distr_item *i, struct publication *p)
  55. {
  56. i->type = htonl(p->type);
  57. i->lower = htonl(p->lower);
  58. i->upper = htonl(p->upper);
  59. i->ref = htonl(p->ref);
  60. i->key = htonl(p->key);
  61. }
  62. /**
  63. * named_prepare_buf - allocate & initialize a publication message
  64. */
  65. static struct sk_buff *named_prepare_buf(struct net *net, u32 type, u32 size,
  66. u32 dest)
  67. {
  68. struct tipc_net *tn = net_generic(net, tipc_net_id);
  69. struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE + size);
  70. struct tipc_msg *msg;
  71. if (buf != NULL) {
  72. msg = buf_msg(buf);
  73. tipc_msg_init(tn->own_addr, msg, NAME_DISTRIBUTOR, type,
  74. INT_H_SIZE, dest);
  75. msg_set_size(msg, INT_H_SIZE + size);
  76. }
  77. return buf;
  78. }
  79. /**
  80. * tipc_named_publish - tell other nodes about a new publication by this node
  81. */
  82. struct sk_buff *tipc_named_publish(struct net *net, struct publication *publ)
  83. {
  84. struct tipc_net *tn = net_generic(net, tipc_net_id);
  85. struct sk_buff *buf;
  86. struct distr_item *item;
  87. list_add_tail_rcu(&publ->local_list,
  88. &tn->nametbl->publ_list[publ->scope]);
  89. if (publ->scope == TIPC_NODE_SCOPE)
  90. return NULL;
  91. buf = named_prepare_buf(net, PUBLICATION, ITEM_SIZE, 0);
  92. if (!buf) {
  93. pr_warn("Publication distribution failure\n");
  94. return NULL;
  95. }
  96. item = (struct distr_item *)msg_data(buf_msg(buf));
  97. publ_to_item(item, publ);
  98. return buf;
  99. }
  100. /**
  101. * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node
  102. */
  103. struct sk_buff *tipc_named_withdraw(struct net *net, struct publication *publ)
  104. {
  105. struct sk_buff *buf;
  106. struct distr_item *item;
  107. list_del(&publ->local_list);
  108. if (publ->scope == TIPC_NODE_SCOPE)
  109. return NULL;
  110. buf = named_prepare_buf(net, WITHDRAWAL, ITEM_SIZE, 0);
  111. if (!buf) {
  112. pr_warn("Withdrawal distribution failure\n");
  113. return NULL;
  114. }
  115. item = (struct distr_item *)msg_data(buf_msg(buf));
  116. publ_to_item(item, publ);
  117. return buf;
  118. }
  119. /**
  120. * named_distribute - prepare name info for bulk distribution to another node
  121. * @list: list of messages (buffers) to be returned from this function
  122. * @dnode: node to be updated
  123. * @pls: linked list of publication items to be packed into buffer chain
  124. */
  125. static void named_distribute(struct net *net, struct sk_buff_head *list,
  126. u32 dnode, struct list_head *pls)
  127. {
  128. struct publication *publ;
  129. struct sk_buff *skb = NULL;
  130. struct distr_item *item = NULL;
  131. uint msg_dsz = (tipc_node_get_mtu(net, dnode, 0) / ITEM_SIZE) *
  132. ITEM_SIZE;
  133. uint msg_rem = msg_dsz;
  134. list_for_each_entry(publ, pls, local_list) {
  135. /* Prepare next buffer: */
  136. if (!skb) {
  137. skb = named_prepare_buf(net, PUBLICATION, msg_rem,
  138. dnode);
  139. if (!skb) {
  140. pr_warn("Bulk publication failure\n");
  141. return;
  142. }
  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 tipc_net *tn = net_generic(net, tipc_net_id);
  168. struct sk_buff_head head;
  169. __skb_queue_head_init(&head);
  170. rcu_read_lock();
  171. named_distribute(net, &head, dnode,
  172. &tn->nametbl->publ_list[TIPC_CLUSTER_SCOPE]);
  173. named_distribute(net, &head, dnode,
  174. &tn->nametbl->publ_list[TIPC_ZONE_SCOPE]);
  175. rcu_read_unlock();
  176. tipc_node_xmit(net, &head, dnode, 0);
  177. }
  178. /**
  179. * tipc_publ_purge - remove publication associated with a failed node
  180. *
  181. * Invoked for each publication issued by a newly failed node.
  182. * Removes publication structure from name table & deletes it.
  183. */
  184. static void tipc_publ_purge(struct net *net, struct publication *publ, u32 addr)
  185. {
  186. struct tipc_net *tn = net_generic(net, tipc_net_id);
  187. struct publication *p;
  188. spin_lock_bh(&tn->nametbl_lock);
  189. p = tipc_nametbl_remove_publ(net, publ->type, publ->lower,
  190. publ->node, publ->ref, publ->key);
  191. if (p)
  192. tipc_node_unsubscribe(net, &p->nodesub_list, addr);
  193. spin_unlock_bh(&tn->nametbl_lock);
  194. if (p != publ) {
  195. pr_err("Unable to remove publication from failed node\n"
  196. " (type=%u, lower=%u, node=0x%x, ref=%u, key=%u)\n",
  197. publ->type, publ->lower, publ->node, publ->ref,
  198. publ->key);
  199. }
  200. kfree_rcu(p, rcu);
  201. }
  202. void tipc_publ_notify(struct net *net, struct list_head *nsub_list, u32 addr)
  203. {
  204. struct publication *publ, *tmp;
  205. list_for_each_entry_safe(publ, tmp, nsub_list, nodesub_list)
  206. tipc_publ_purge(net, publ, addr);
  207. }
  208. /**
  209. * tipc_update_nametbl - try to process a nametable update and notify
  210. * subscribers
  211. *
  212. * tipc_nametbl_lock must be held.
  213. * Returns the publication item if successful, otherwise NULL.
  214. */
  215. static bool tipc_update_nametbl(struct net *net, struct distr_item *i,
  216. u32 node, u32 dtype)
  217. {
  218. struct publication *publ = NULL;
  219. if (dtype == PUBLICATION) {
  220. publ = tipc_nametbl_insert_publ(net, ntohl(i->type),
  221. ntohl(i->lower),
  222. ntohl(i->upper),
  223. TIPC_CLUSTER_SCOPE, node,
  224. ntohl(i->ref), ntohl(i->key));
  225. if (publ) {
  226. tipc_node_subscribe(net, &publ->nodesub_list, node);
  227. return true;
  228. }
  229. } else if (dtype == WITHDRAWAL) {
  230. publ = tipc_nametbl_remove_publ(net, ntohl(i->type),
  231. ntohl(i->lower),
  232. node, ntohl(i->ref),
  233. ntohl(i->key));
  234. if (publ) {
  235. tipc_node_unsubscribe(net, &publ->nodesub_list, node);
  236. kfree_rcu(publ, rcu);
  237. return true;
  238. }
  239. } else {
  240. pr_warn("Unrecognized name table message received\n");
  241. }
  242. return false;
  243. }
  244. /**
  245. * tipc_named_add_backlog - add a failed name table update to the backlog
  246. *
  247. */
  248. static void tipc_named_add_backlog(struct distr_item *i, u32 type, u32 node)
  249. {
  250. struct distr_queue_item *e;
  251. unsigned long now = get_jiffies_64();
  252. e = kzalloc(sizeof(*e), GFP_ATOMIC);
  253. if (!e)
  254. return;
  255. e->dtype = type;
  256. e->node = node;
  257. e->expires = now + msecs_to_jiffies(sysctl_tipc_named_timeout);
  258. memcpy(e, i, sizeof(*i));
  259. list_add_tail(&e->next, &tipc_dist_queue);
  260. }
  261. /**
  262. * tipc_named_process_backlog - try to process any pending name table updates
  263. * from the network.
  264. */
  265. void tipc_named_process_backlog(struct net *net)
  266. {
  267. struct distr_queue_item *e, *tmp;
  268. char addr[16];
  269. unsigned long now = get_jiffies_64();
  270. list_for_each_entry_safe(e, tmp, &tipc_dist_queue, next) {
  271. if (time_after(e->expires, now)) {
  272. if (!tipc_update_nametbl(net, &e->i, e->node, e->dtype))
  273. continue;
  274. } else {
  275. tipc_addr_string_fill(addr, e->node);
  276. pr_warn_ratelimited("Dropping name table update (%d) of {%u, %u, %u} from %s key=%u\n",
  277. e->dtype, ntohl(e->i.type),
  278. ntohl(e->i.lower),
  279. ntohl(e->i.upper),
  280. addr, ntohl(e->i.key));
  281. }
  282. list_del(&e->next);
  283. kfree(e);
  284. }
  285. }
  286. /**
  287. * tipc_named_rcv - process name table update messages sent by another node
  288. */
  289. void tipc_named_rcv(struct net *net, struct sk_buff_head *inputq)
  290. {
  291. struct tipc_net *tn = net_generic(net, tipc_net_id);
  292. struct tipc_msg *msg;
  293. struct distr_item *item;
  294. uint count;
  295. u32 node;
  296. struct sk_buff *skb;
  297. int mtype;
  298. spin_lock_bh(&tn->nametbl_lock);
  299. for (skb = skb_dequeue(inputq); skb; skb = skb_dequeue(inputq)) {
  300. skb_linearize(skb);
  301. msg = buf_msg(skb);
  302. mtype = msg_type(msg);
  303. item = (struct distr_item *)msg_data(msg);
  304. count = msg_data_sz(msg) / ITEM_SIZE;
  305. node = msg_orignode(msg);
  306. while (count--) {
  307. if (!tipc_update_nametbl(net, item, node, mtype))
  308. tipc_named_add_backlog(item, mtype, node);
  309. item++;
  310. }
  311. kfree_skb(skb);
  312. tipc_named_process_backlog(net);
  313. }
  314. spin_unlock_bh(&tn->nametbl_lock);
  315. }
  316. /**
  317. * tipc_named_reinit - re-initialize local publications
  318. *
  319. * This routine is called whenever TIPC networking is enabled.
  320. * All name table entries published by this node are updated to reflect
  321. * the node's new network address.
  322. */
  323. void tipc_named_reinit(struct net *net)
  324. {
  325. struct tipc_net *tn = net_generic(net, tipc_net_id);
  326. struct publication *publ;
  327. int scope;
  328. spin_lock_bh(&tn->nametbl_lock);
  329. for (scope = TIPC_ZONE_SCOPE; scope <= TIPC_NODE_SCOPE; scope++)
  330. list_for_each_entry_rcu(publ, &tn->nametbl->publ_list[scope],
  331. local_list)
  332. publ->node = tn->own_addr;
  333. spin_unlock_bh(&tn->nametbl_lock);
  334. }