name_distr.c 11 KB

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