discover.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386
  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. tipc_addr_string_fill(node_addr_str, node_addr);
  97. tipc_media_addr_printf(media_addr_str, sizeof(media_addr_str),
  98. media_addr);
  99. pr_warn("Duplicate %s using %s seen on <%s>\n", node_addr_str,
  100. media_addr_str, b_ptr->name);
  101. }
  102. /**
  103. * tipc_disc_recv_msg - handle incoming link setup message (request or response)
  104. * @buf: buffer containing message
  105. * @b_ptr: bearer that message arrived on
  106. */
  107. void tipc_disc_recv_msg(struct sk_buff *buf, struct tipc_bearer *b_ptr)
  108. {
  109. struct tipc_node *n_ptr;
  110. struct tipc_link *link;
  111. struct tipc_media_addr media_addr;
  112. struct sk_buff *rbuf;
  113. struct tipc_msg *msg = buf_msg(buf);
  114. u32 dest = msg_dest_domain(msg);
  115. u32 orig = msg_prevnode(msg);
  116. u32 net_id = msg_bc_netid(msg);
  117. u32 type = msg_type(msg);
  118. u32 signature = msg_node_sig(msg);
  119. int addr_mismatch;
  120. int link_fully_up;
  121. media_addr.broadcast = 1;
  122. b_ptr->media->msg2addr(&media_addr, msg_media_addr(msg));
  123. kfree_skb(buf);
  124. /* Ensure message from node is valid and communication is permitted */
  125. if (net_id != tipc_net_id)
  126. return;
  127. if (media_addr.broadcast)
  128. return;
  129. if (!tipc_addr_domain_valid(dest))
  130. return;
  131. if (!tipc_addr_node_valid(orig))
  132. return;
  133. if (orig == tipc_own_addr) {
  134. if (memcmp(&media_addr, &b_ptr->addr, sizeof(media_addr)))
  135. disc_dupl_alert(b_ptr, tipc_own_addr, &media_addr);
  136. return;
  137. }
  138. if (!tipc_in_scope(dest, tipc_own_addr))
  139. return;
  140. if (!tipc_in_scope(b_ptr->link_req->domain, orig))
  141. return;
  142. /* Locate structure corresponding to requesting node */
  143. n_ptr = tipc_node_find(orig);
  144. if (!n_ptr) {
  145. n_ptr = tipc_node_create(orig);
  146. if (!n_ptr)
  147. return;
  148. }
  149. tipc_node_lock(n_ptr);
  150. /* Prepare to validate requesting node's signature and media address */
  151. link = n_ptr->links[b_ptr->identity];
  152. addr_mismatch = (link != NULL) &&
  153. memcmp(&link->media_addr, &media_addr, sizeof(media_addr));
  154. /*
  155. * Ensure discovery message's signature is correct
  156. *
  157. * If signature is incorrect and there is no working link to the node,
  158. * accept the new signature but invalidate all existing links to the
  159. * node so they won't re-activate without a new discovery message.
  160. *
  161. * If signature is incorrect and the requested link to the node is
  162. * working, accept the new signature. (This is an instance of delayed
  163. * rediscovery, where a link endpoint was able to re-establish contact
  164. * with its peer endpoint on a node that rebooted before receiving a
  165. * discovery message from that node.)
  166. *
  167. * If signature is incorrect and there is a working link to the node
  168. * that is not the requested link, reject the request (must be from
  169. * a duplicate node).
  170. */
  171. if (signature != n_ptr->signature) {
  172. if (n_ptr->working_links == 0) {
  173. struct tipc_link *curr_link;
  174. int i;
  175. for (i = 0; i < MAX_BEARERS; i++) {
  176. curr_link = n_ptr->links[i];
  177. if (curr_link) {
  178. memset(&curr_link->media_addr, 0,
  179. sizeof(media_addr));
  180. tipc_link_reset(curr_link);
  181. }
  182. }
  183. addr_mismatch = (link != NULL);
  184. } else if (tipc_link_is_up(link) && !addr_mismatch) {
  185. /* delayed rediscovery */
  186. } else {
  187. disc_dupl_alert(b_ptr, orig, &media_addr);
  188. tipc_node_unlock(n_ptr);
  189. return;
  190. }
  191. n_ptr->signature = signature;
  192. }
  193. /*
  194. * Ensure requesting node's media address is correct
  195. *
  196. * If media address doesn't match and the link is working, reject the
  197. * request (must be from a duplicate node).
  198. *
  199. * If media address doesn't match and the link is not working, accept
  200. * the new media address and reset the link to ensure it starts up
  201. * cleanly.
  202. */
  203. if (addr_mismatch) {
  204. if (tipc_link_is_up(link)) {
  205. disc_dupl_alert(b_ptr, orig, &media_addr);
  206. tipc_node_unlock(n_ptr);
  207. return;
  208. } else {
  209. memcpy(&link->media_addr, &media_addr,
  210. sizeof(media_addr));
  211. tipc_link_reset(link);
  212. }
  213. }
  214. /* Create a link endpoint for this bearer, if necessary */
  215. if (!link) {
  216. link = tipc_link_create(n_ptr, b_ptr, &media_addr);
  217. if (!link) {
  218. tipc_node_unlock(n_ptr);
  219. return;
  220. }
  221. }
  222. /* Accept discovery message & send response, if necessary */
  223. link_fully_up = link_working_working(link);
  224. if ((type == DSC_REQ_MSG) && !link_fully_up && !b_ptr->blocked) {
  225. rbuf = tipc_disc_init_msg(DSC_RESP_MSG, orig, b_ptr);
  226. if (rbuf) {
  227. b_ptr->media->send_msg(rbuf, b_ptr, &media_addr);
  228. kfree_skb(rbuf);
  229. }
  230. }
  231. tipc_node_unlock(n_ptr);
  232. }
  233. /**
  234. * disc_update - update frequency of periodic link setup requests
  235. * @req: ptr to link request structure
  236. *
  237. * Reinitiates discovery process if discovery object has no associated nodes
  238. * and is either not currently searching or is searching at a slow rate
  239. */
  240. static void disc_update(struct tipc_link_req *req)
  241. {
  242. if (!req->num_nodes) {
  243. if ((req->timer_intv == TIPC_LINK_REQ_INACTIVE) ||
  244. (req->timer_intv > TIPC_LINK_REQ_FAST)) {
  245. req->timer_intv = TIPC_LINK_REQ_INIT;
  246. k_start_timer(&req->timer, req->timer_intv);
  247. }
  248. }
  249. }
  250. /**
  251. * tipc_disc_add_dest - increment set of discovered nodes
  252. * @req: ptr to link request structure
  253. */
  254. void tipc_disc_add_dest(struct tipc_link_req *req)
  255. {
  256. req->num_nodes++;
  257. }
  258. /**
  259. * tipc_disc_remove_dest - decrement set of discovered nodes
  260. * @req: ptr to link request structure
  261. */
  262. void tipc_disc_remove_dest(struct tipc_link_req *req)
  263. {
  264. req->num_nodes--;
  265. disc_update(req);
  266. }
  267. /**
  268. * disc_send_msg - send link setup request message
  269. * @req: ptr to link request structure
  270. */
  271. static void disc_send_msg(struct tipc_link_req *req)
  272. {
  273. if (!req->bearer->blocked)
  274. tipc_bearer_send(req->bearer, req->buf, &req->dest);
  275. }
  276. /**
  277. * disc_timeout - send a periodic link setup request
  278. * @req: ptr to link request structure
  279. *
  280. * Called whenever a link setup request timer associated with a bearer expires.
  281. */
  282. static void disc_timeout(struct tipc_link_req *req)
  283. {
  284. int max_delay;
  285. spin_lock_bh(&req->bearer->lock);
  286. /* Stop searching if only desired node has been found */
  287. if (tipc_node(req->domain) && req->num_nodes) {
  288. req->timer_intv = TIPC_LINK_REQ_INACTIVE;
  289. goto exit;
  290. }
  291. /*
  292. * Send discovery message, then update discovery timer
  293. *
  294. * Keep doubling time between requests until limit is reached;
  295. * hold at fast polling rate if don't have any associated nodes,
  296. * otherwise hold at slow polling rate
  297. */
  298. disc_send_msg(req);
  299. req->timer_intv *= 2;
  300. if (req->num_nodes)
  301. max_delay = TIPC_LINK_REQ_SLOW;
  302. else
  303. max_delay = TIPC_LINK_REQ_FAST;
  304. if (req->timer_intv > max_delay)
  305. req->timer_intv = max_delay;
  306. k_start_timer(&req->timer, req->timer_intv);
  307. exit:
  308. spin_unlock_bh(&req->bearer->lock);
  309. }
  310. /**
  311. * tipc_disc_create - create object to send periodic link setup requests
  312. * @b_ptr: ptr to bearer issuing requests
  313. * @dest: destination address for request messages
  314. * @dest_domain: network domain to which links can be established
  315. *
  316. * Returns 0 if successful, otherwise -errno.
  317. */
  318. int tipc_disc_create(struct tipc_bearer *b_ptr,
  319. struct tipc_media_addr *dest, u32 dest_domain)
  320. {
  321. struct tipc_link_req *req;
  322. req = kmalloc(sizeof(*req), GFP_ATOMIC);
  323. if (!req)
  324. return -ENOMEM;
  325. req->buf = tipc_disc_init_msg(DSC_REQ_MSG, dest_domain, b_ptr);
  326. if (!req->buf) {
  327. kfree(req);
  328. return -ENOMSG;
  329. }
  330. memcpy(&req->dest, dest, sizeof(*dest));
  331. req->bearer = b_ptr;
  332. req->domain = dest_domain;
  333. req->num_nodes = 0;
  334. req->timer_intv = TIPC_LINK_REQ_INIT;
  335. k_init_timer(&req->timer, (Handler)disc_timeout, (unsigned long)req);
  336. k_start_timer(&req->timer, req->timer_intv);
  337. b_ptr->link_req = req;
  338. disc_send_msg(req);
  339. return 0;
  340. }
  341. /**
  342. * tipc_disc_delete - destroy object sending periodic link setup requests
  343. * @req: ptr to link request structure
  344. */
  345. void tipc_disc_delete(struct tipc_link_req *req)
  346. {
  347. k_cancel_timer(&req->timer);
  348. k_term_timer(&req->timer);
  349. kfree_skb(req->buf);
  350. kfree(req);
  351. }