discover.c 10 KB

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