discover.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301
  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. * @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 link_req {
  55. struct tipc_bearer *bearer;
  56. struct tipc_media_addr dest;
  57. struct sk_buff *buf;
  58. struct timer_list timer;
  59. unsigned int timer_intv;
  60. };
  61. /**
  62. * tipc_disc_init_msg - initialize a link setup message
  63. * @type: message type (request or response)
  64. * @dest_domain: network domain of node(s) which should respond to message
  65. * @b_ptr: ptr to bearer issuing message
  66. */
  67. static struct sk_buff *tipc_disc_init_msg(u32 type,
  68. u32 dest_domain,
  69. struct tipc_bearer *b_ptr)
  70. {
  71. struct sk_buff *buf = tipc_buf_acquire(DSC_H_SIZE);
  72. struct tipc_msg *msg;
  73. if (buf) {
  74. msg = buf_msg(buf);
  75. tipc_msg_init(msg, LINK_CONFIG, type, DSC_H_SIZE, dest_domain);
  76. msg_set_non_seq(msg, 1);
  77. msg_set_dest_domain(msg, dest_domain);
  78. msg_set_bc_netid(msg, tipc_net_id);
  79. msg_set_media_addr(msg, &b_ptr->addr);
  80. }
  81. return buf;
  82. }
  83. /**
  84. * disc_dupl_alert - issue node address duplication alert
  85. * @b_ptr: pointer to bearer detecting duplication
  86. * @node_addr: duplicated node address
  87. * @media_addr: media address advertised by duplicated node
  88. */
  89. static void disc_dupl_alert(struct tipc_bearer *b_ptr, u32 node_addr,
  90. struct tipc_media_addr *media_addr)
  91. {
  92. char node_addr_str[16];
  93. char media_addr_str[64];
  94. struct print_buf pb;
  95. tipc_addr_string_fill(node_addr_str, node_addr);
  96. tipc_printbuf_init(&pb, media_addr_str, sizeof(media_addr_str));
  97. tipc_media_addr_printf(&pb, media_addr);
  98. tipc_printbuf_validate(&pb);
  99. warn("Duplicate %s using %s seen on <%s>\n",
  100. node_addr_str, 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 link *link;
  110. struct tipc_media_addr media_addr;
  111. struct tipc_msg *msg = buf_msg(buf);
  112. u32 dest = msg_dest_domain(msg);
  113. u32 orig = msg_prevnode(msg);
  114. u32 net_id = msg_bc_netid(msg);
  115. u32 type = msg_type(msg);
  116. msg_get_media_addr(msg, &media_addr);
  117. buf_discard(buf);
  118. if (net_id != tipc_net_id)
  119. return;
  120. if (!tipc_addr_domain_valid(dest))
  121. return;
  122. if (!tipc_addr_node_valid(orig))
  123. return;
  124. if (orig == tipc_own_addr) {
  125. if (memcmp(&media_addr, &b_ptr->addr, sizeof(media_addr)))
  126. disc_dupl_alert(b_ptr, tipc_own_addr, &media_addr);
  127. return;
  128. }
  129. if (!tipc_in_scope(dest, tipc_own_addr))
  130. return;
  131. if (in_own_cluster(orig)) {
  132. /* Always accept link here */
  133. struct sk_buff *rbuf;
  134. struct tipc_media_addr *addr;
  135. struct tipc_node *n_ptr = tipc_node_find(orig);
  136. int link_fully_up;
  137. if (n_ptr == NULL) {
  138. n_ptr = tipc_node_create(orig);
  139. if (!n_ptr)
  140. return;
  141. }
  142. spin_lock_bh(&n_ptr->lock);
  143. /* Don't talk to neighbor during cleanup after last session */
  144. if (n_ptr->cleanup_required) {
  145. spin_unlock_bh(&n_ptr->lock);
  146. return;
  147. }
  148. link = n_ptr->links[b_ptr->identity];
  149. if (!link) {
  150. link = tipc_link_create(b_ptr, orig, &media_addr);
  151. if (!link) {
  152. spin_unlock_bh(&n_ptr->lock);
  153. return;
  154. }
  155. }
  156. addr = &link->media_addr;
  157. if (memcmp(addr, &media_addr, sizeof(*addr))) {
  158. if (tipc_link_is_up(link) || (!link->started)) {
  159. disc_dupl_alert(b_ptr, orig, &media_addr);
  160. spin_unlock_bh(&n_ptr->lock);
  161. return;
  162. }
  163. warn("Resetting link <%s>, peer interface address changed\n",
  164. link->name);
  165. memcpy(addr, &media_addr, sizeof(*addr));
  166. tipc_link_reset(link);
  167. }
  168. link_fully_up = link_working_working(link);
  169. spin_unlock_bh(&n_ptr->lock);
  170. if ((type == DSC_RESP_MSG) || link_fully_up)
  171. return;
  172. rbuf = tipc_disc_init_msg(DSC_RESP_MSG, orig, b_ptr);
  173. if (rbuf != NULL) {
  174. b_ptr->media->send_msg(rbuf, b_ptr, &media_addr);
  175. buf_discard(rbuf);
  176. }
  177. }
  178. }
  179. /**
  180. * tipc_disc_stop_link_req - stop sending periodic link setup requests
  181. * @req: ptr to link request structure
  182. */
  183. void tipc_disc_stop_link_req(struct link_req *req)
  184. {
  185. if (!req)
  186. return;
  187. k_cancel_timer(&req->timer);
  188. k_term_timer(&req->timer);
  189. buf_discard(req->buf);
  190. kfree(req);
  191. }
  192. /**
  193. * tipc_disc_update_link_req - update frequency of periodic link setup requests
  194. * @req: ptr to link request structure
  195. */
  196. void tipc_disc_update_link_req(struct link_req *req)
  197. {
  198. if (!req)
  199. return;
  200. if (req->timer_intv == TIPC_LINK_REQ_SLOW) {
  201. if (!req->bearer->nodes.count) {
  202. req->timer_intv = TIPC_LINK_REQ_FAST;
  203. k_start_timer(&req->timer, req->timer_intv);
  204. }
  205. } else if (req->timer_intv == TIPC_LINK_REQ_FAST) {
  206. if (req->bearer->nodes.count) {
  207. req->timer_intv = TIPC_LINK_REQ_SLOW;
  208. k_start_timer(&req->timer, req->timer_intv);
  209. }
  210. } else {
  211. /* leave timer "as is" if haven't yet reached a "normal" rate */
  212. }
  213. }
  214. /**
  215. * disc_timeout - send a periodic link setup request
  216. * @req: ptr to link request structure
  217. *
  218. * Called whenever a link setup request timer associated with a bearer expires.
  219. */
  220. static void disc_timeout(struct link_req *req)
  221. {
  222. spin_lock_bh(&req->bearer->lock);
  223. req->bearer->media->send_msg(req->buf, req->bearer, &req->dest);
  224. if ((req->timer_intv == TIPC_LINK_REQ_SLOW) ||
  225. (req->timer_intv == TIPC_LINK_REQ_FAST)) {
  226. /* leave timer interval "as is" if already at a "normal" rate */
  227. } else {
  228. req->timer_intv *= 2;
  229. if (req->timer_intv > TIPC_LINK_REQ_FAST)
  230. req->timer_intv = TIPC_LINK_REQ_FAST;
  231. if ((req->timer_intv == TIPC_LINK_REQ_FAST) &&
  232. (req->bearer->nodes.count))
  233. req->timer_intv = TIPC_LINK_REQ_SLOW;
  234. }
  235. k_start_timer(&req->timer, req->timer_intv);
  236. spin_unlock_bh(&req->bearer->lock);
  237. }
  238. /**
  239. * tipc_disc_init_link_req - start sending periodic link setup requests
  240. * @b_ptr: ptr to bearer issuing requests
  241. * @dest: destination address for request messages
  242. * @dest_domain: network domain of node(s) which should respond to message
  243. *
  244. * Returns pointer to link request structure, or NULL if unable to create.
  245. */
  246. struct link_req *tipc_disc_init_link_req(struct tipc_bearer *b_ptr,
  247. const struct tipc_media_addr *dest,
  248. u32 dest_domain)
  249. {
  250. struct link_req *req;
  251. req = kmalloc(sizeof(*req), GFP_ATOMIC);
  252. if (!req)
  253. return NULL;
  254. req->buf = tipc_disc_init_msg(DSC_REQ_MSG, dest_domain, b_ptr);
  255. if (!req->buf) {
  256. kfree(req);
  257. return NULL;
  258. }
  259. memcpy(&req->dest, dest, sizeof(*dest));
  260. req->bearer = b_ptr;
  261. req->timer_intv = TIPC_LINK_REQ_INIT;
  262. k_init_timer(&req->timer, (Handler)disc_timeout, (unsigned long)req);
  263. k_start_timer(&req->timer, req->timer_intv);
  264. return req;
  265. }