discover.c 11 KB

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