discover.c 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352
  1. /*
  2. * net/tipc/discover.c
  3. *
  4. * Copyright (c) 2003-2006, Ericsson AB
  5. * Copyright (c) 2005-2006, 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 "discover.h"
  39. #define TIPC_LINK_REQ_INIT 125 /* min delay during bearer start up */
  40. #define TIPC_LINK_REQ_FAST 2000 /* normal delay if bearer has no links */
  41. #define TIPC_LINK_REQ_SLOW 600000 /* normal delay if bearer has links */
  42. /*
  43. * TODO: Most of the inter-cluster setup stuff should be
  44. * rewritten, and be made conformant with specification.
  45. */
  46. /**
  47. * struct link_req - information about an ongoing link setup request
  48. * @bearer: bearer issuing requests
  49. * @dest: destination address for request messages
  50. * @domain: network domain to which links can be established
  51. * @num_nodes: number of nodes currently discovered (i.e. with an active link)
  52. * @buf: request message to be (repeatedly) sent
  53. * @timer: timer governing period between requests
  54. * @timer_intv: current interval between requests (in ms)
  55. */
  56. struct link_req {
  57. struct tipc_bearer *bearer;
  58. struct tipc_media_addr dest;
  59. u32 domain;
  60. int num_nodes;
  61. struct sk_buff *buf;
  62. struct timer_list timer;
  63. unsigned int timer_intv;
  64. };
  65. /**
  66. * tipc_disc_init_msg - initialize a link setup message
  67. * @type: message type (request or response)
  68. * @dest_domain: network domain of node(s) which should respond to message
  69. * @b_ptr: ptr to bearer issuing message
  70. */
  71. static struct sk_buff *tipc_disc_init_msg(u32 type,
  72. u32 dest_domain,
  73. struct tipc_bearer *b_ptr)
  74. {
  75. struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE);
  76. struct tipc_msg *msg;
  77. if (buf) {
  78. msg = buf_msg(buf);
  79. tipc_msg_init(msg, LINK_CONFIG, type, INT_H_SIZE, dest_domain);
  80. msg_set_non_seq(msg, 1);
  81. msg_set_dest_domain(msg, dest_domain);
  82. msg_set_bc_netid(msg, tipc_net_id);
  83. msg_set_media_addr(msg, &b_ptr->addr);
  84. }
  85. return buf;
  86. }
  87. /**
  88. * disc_dupl_alert - issue node address duplication alert
  89. * @b_ptr: pointer to bearer detecting duplication
  90. * @node_addr: duplicated node address
  91. * @media_addr: media address advertised by duplicated node
  92. */
  93. static void disc_dupl_alert(struct tipc_bearer *b_ptr, u32 node_addr,
  94. struct tipc_media_addr *media_addr)
  95. {
  96. char node_addr_str[16];
  97. char media_addr_str[64];
  98. struct print_buf pb;
  99. tipc_addr_string_fill(node_addr_str, node_addr);
  100. tipc_printbuf_init(&pb, media_addr_str, sizeof(media_addr_str));
  101. tipc_media_addr_printf(&pb, media_addr);
  102. tipc_printbuf_validate(&pb);
  103. warn("Duplicate %s using %s seen on <%s>\n",
  104. node_addr_str, media_addr_str, b_ptr->name);
  105. }
  106. /**
  107. * tipc_disc_recv_msg - handle incoming link setup message (request or response)
  108. * @buf: buffer containing message
  109. * @b_ptr: bearer that message arrived on
  110. */
  111. void tipc_disc_recv_msg(struct sk_buff *buf, struct tipc_bearer *b_ptr)
  112. {
  113. struct tipc_node *n_ptr;
  114. struct link *link;
  115. struct tipc_media_addr media_addr, *addr;
  116. struct sk_buff *rbuf;
  117. struct tipc_msg *msg = buf_msg(buf);
  118. u32 dest = msg_dest_domain(msg);
  119. u32 orig = msg_prevnode(msg);
  120. u32 net_id = msg_bc_netid(msg);
  121. u32 type = msg_type(msg);
  122. int link_fully_up;
  123. msg_get_media_addr(msg, &media_addr);
  124. buf_discard(buf);
  125. /* Validate discovery message from requesting node */
  126. if (net_id != tipc_net_id)
  127. return;
  128. if (!tipc_addr_domain_valid(dest))
  129. return;
  130. if (!tipc_addr_node_valid(orig))
  131. return;
  132. if (orig == tipc_own_addr) {
  133. if (memcmp(&media_addr, &b_ptr->addr, sizeof(media_addr)))
  134. disc_dupl_alert(b_ptr, tipc_own_addr, &media_addr);
  135. return;
  136. }
  137. if (!tipc_in_scope(dest, tipc_own_addr))
  138. return;
  139. if (!tipc_in_scope(b_ptr->link_req->domain, orig))
  140. return;
  141. /* Locate structure corresponding to requesting node */
  142. n_ptr = tipc_node_find(orig);
  143. if (!n_ptr) {
  144. n_ptr = tipc_node_create(orig);
  145. if (!n_ptr)
  146. return;
  147. }
  148. tipc_node_lock(n_ptr);
  149. /* Don't talk to neighbor during cleanup after last session */
  150. if (n_ptr->cleanup_required) {
  151. tipc_node_unlock(n_ptr);
  152. return;
  153. }
  154. link = n_ptr->links[b_ptr->identity];
  155. /* Create a link endpoint for this bearer, if necessary */
  156. if (!link) {
  157. link = tipc_link_create(n_ptr, b_ptr, &media_addr);
  158. if (!link) {
  159. tipc_node_unlock(n_ptr);
  160. return;
  161. }
  162. }
  163. /*
  164. * Ensure requesting node's media address is correct
  165. *
  166. * If media address doesn't match and the link is working, reject the
  167. * request (must be from a duplicate node).
  168. *
  169. * If media address doesn't match and the link is not working, accept
  170. * the new media address and reset the link to ensure it starts up
  171. * cleanly.
  172. */
  173. addr = &link->media_addr;
  174. if (memcmp(addr, &media_addr, sizeof(*addr))) {
  175. if (tipc_link_is_up(link) || (!link->started)) {
  176. disc_dupl_alert(b_ptr, orig, &media_addr);
  177. tipc_node_unlock(n_ptr);
  178. return;
  179. }
  180. warn("Resetting link <%s>, peer interface address changed\n",
  181. link->name);
  182. memcpy(addr, &media_addr, sizeof(*addr));
  183. tipc_link_reset(link);
  184. }
  185. /* Accept discovery message & send response, if necessary */
  186. link_fully_up = link_working_working(link);
  187. if ((type == DSC_REQ_MSG) && !link_fully_up && !b_ptr->blocked) {
  188. rbuf = tipc_disc_init_msg(DSC_RESP_MSG, orig, b_ptr);
  189. if (rbuf) {
  190. b_ptr->media->send_msg(rbuf, b_ptr, &media_addr);
  191. buf_discard(rbuf);
  192. }
  193. }
  194. tipc_node_unlock(n_ptr);
  195. }
  196. /**
  197. * disc_update - update frequency of periodic link setup requests
  198. * @req: ptr to link request structure
  199. */
  200. static void disc_update(struct link_req *req)
  201. {
  202. if (req->timer_intv == TIPC_LINK_REQ_SLOW) {
  203. if (!req->bearer->nodes.count) {
  204. req->timer_intv = TIPC_LINK_REQ_FAST;
  205. k_start_timer(&req->timer, req->timer_intv);
  206. }
  207. } else if (req->timer_intv == TIPC_LINK_REQ_FAST) {
  208. if (req->bearer->nodes.count) {
  209. req->timer_intv = TIPC_LINK_REQ_SLOW;
  210. k_start_timer(&req->timer, req->timer_intv);
  211. }
  212. } else {
  213. /* leave timer "as is" if haven't yet reached a "normal" rate */
  214. }
  215. }
  216. /**
  217. * tipc_disc_add_dest - increment set of discovered nodes
  218. * @req: ptr to link request structure
  219. */
  220. void tipc_disc_add_dest(struct link_req *req)
  221. {
  222. req->num_nodes++;
  223. disc_update(req);
  224. }
  225. /**
  226. * tipc_disc_remove_dest - decrement set of discovered nodes
  227. * @req: ptr to link request structure
  228. */
  229. void tipc_disc_remove_dest(struct link_req *req)
  230. {
  231. req->num_nodes--;
  232. disc_update(req);
  233. }
  234. /**
  235. * disc_send_msg - send link setup request message
  236. * @req: ptr to link request structure
  237. */
  238. static void disc_send_msg(struct link_req *req)
  239. {
  240. if (!req->bearer->blocked)
  241. tipc_bearer_send(req->bearer, req->buf, &req->dest);
  242. }
  243. /**
  244. * disc_timeout - send a periodic link setup request
  245. * @req: ptr to link request structure
  246. *
  247. * Called whenever a link setup request timer associated with a bearer expires.
  248. */
  249. static void disc_timeout(struct link_req *req)
  250. {
  251. spin_lock_bh(&req->bearer->lock);
  252. disc_send_msg(req);
  253. if ((req->timer_intv == TIPC_LINK_REQ_SLOW) ||
  254. (req->timer_intv == TIPC_LINK_REQ_FAST)) {
  255. /* leave timer interval "as is" if already at a "normal" rate */
  256. } else {
  257. req->timer_intv *= 2;
  258. if (req->timer_intv > TIPC_LINK_REQ_FAST)
  259. req->timer_intv = TIPC_LINK_REQ_FAST;
  260. if ((req->timer_intv == TIPC_LINK_REQ_FAST) &&
  261. (req->bearer->nodes.count))
  262. req->timer_intv = TIPC_LINK_REQ_SLOW;
  263. }
  264. k_start_timer(&req->timer, req->timer_intv);
  265. spin_unlock_bh(&req->bearer->lock);
  266. }
  267. /**
  268. * tipc_disc_create - create object to send periodic link setup requests
  269. * @b_ptr: ptr to bearer issuing requests
  270. * @dest: destination address for request messages
  271. * @dest_domain: network domain to which links can be established
  272. *
  273. * Returns 0 if successful, otherwise -errno.
  274. */
  275. int tipc_disc_create(struct tipc_bearer *b_ptr,
  276. struct tipc_media_addr *dest, u32 dest_domain)
  277. {
  278. struct link_req *req;
  279. req = kmalloc(sizeof(*req), GFP_ATOMIC);
  280. if (!req)
  281. return -ENOMEM;
  282. req->buf = tipc_disc_init_msg(DSC_REQ_MSG, dest_domain, b_ptr);
  283. if (!req->buf) {
  284. kfree(req);
  285. return -ENOMSG;
  286. }
  287. memcpy(&req->dest, dest, sizeof(*dest));
  288. req->bearer = b_ptr;
  289. req->domain = dest_domain;
  290. req->num_nodes = 0;
  291. req->timer_intv = TIPC_LINK_REQ_INIT;
  292. k_init_timer(&req->timer, (Handler)disc_timeout, (unsigned long)req);
  293. k_start_timer(&req->timer, req->timer_intv);
  294. b_ptr->link_req = req;
  295. disc_send_msg(req);
  296. return 0;
  297. }
  298. /**
  299. * tipc_disc_delete - destroy object sending periodic link setup requests
  300. * @req: ptr to link request structure
  301. */
  302. void tipc_disc_delete(struct link_req *req)
  303. {
  304. k_cancel_timer(&req->timer);
  305. k_term_timer(&req->timer);
  306. buf_discard(req->buf);
  307. kfree(req);
  308. }