discover.c 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312
  1. /*
  2. * net/tipc/discover.c
  3. *
  4. * Copyright (c) 2003-2006, Ericsson AB
  5. * Copyright (c) 2005-2006, 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. #include "port.h"
  40. #include "name_table.h"
  41. #define TIPC_LINK_REQ_INIT 125 /* min delay during bearer start up */
  42. #define TIPC_LINK_REQ_FAST 2000 /* normal delay if bearer has no links */
  43. #define TIPC_LINK_REQ_SLOW 600000 /* normal delay if bearer has links */
  44. /*
  45. * TODO: Most of the inter-cluster setup stuff should be
  46. * rewritten, and be made conformant with specification.
  47. */
  48. /**
  49. * struct link_req - information about an ongoing link setup request
  50. * @bearer: bearer issuing requests
  51. * @dest: destination address for request messages
  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 bearer *bearer;
  58. struct tipc_media_addr dest;
  59. struct sk_buff *buf;
  60. struct timer_list timer;
  61. unsigned int timer_intv;
  62. };
  63. /**
  64. * tipc_disc_init_msg - initialize a link setup message
  65. * @type: message type (request or response)
  66. * @req_links: number of links associated with message
  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,
  71. u32 req_links,
  72. u32 dest_domain,
  73. struct bearer *b_ptr)
  74. {
  75. struct sk_buff *buf = tipc_buf_acquire(DSC_H_SIZE);
  76. struct tipc_msg *msg;
  77. if (buf) {
  78. msg = buf_msg(buf);
  79. tipc_msg_init(msg, LINK_CONFIG, type, DSC_H_SIZE, dest_domain);
  80. msg_set_non_seq(msg, 1);
  81. msg_set_req_links(msg, req_links);
  82. msg_set_dest_domain(msg, dest_domain);
  83. msg_set_bc_netid(msg, tipc_net_id);
  84. msg_set_media_addr(msg, &b_ptr->publ.addr);
  85. }
  86. return buf;
  87. }
  88. /**
  89. * disc_dupl_alert - issue node address duplication alert
  90. * @b_ptr: pointer to bearer detecting duplication
  91. * @node_addr: duplicated node address
  92. * @media_addr: media address advertised by duplicated node
  93. */
  94. static void disc_dupl_alert(struct bearer *b_ptr, u32 node_addr,
  95. struct tipc_media_addr *media_addr)
  96. {
  97. char node_addr_str[16];
  98. char media_addr_str[64];
  99. struct print_buf pb;
  100. tipc_addr_string_fill(node_addr_str, node_addr);
  101. tipc_printbuf_init(&pb, media_addr_str, sizeof(media_addr_str));
  102. tipc_media_addr_printf(&pb, media_addr);
  103. tipc_printbuf_validate(&pb);
  104. warn("Duplicate %s using %s seen on <%s>\n",
  105. node_addr_str, media_addr_str, b_ptr->publ.name);
  106. }
  107. /**
  108. * tipc_disc_recv_msg - handle incoming link setup message (request or response)
  109. * @buf: buffer containing message
  110. * @b_ptr: bearer that message arrived on
  111. */
  112. void tipc_disc_recv_msg(struct sk_buff *buf, struct bearer *b_ptr)
  113. {
  114. struct link *link;
  115. struct tipc_media_addr media_addr;
  116. struct tipc_msg *msg = buf_msg(buf);
  117. u32 dest = msg_dest_domain(msg);
  118. u32 orig = msg_prevnode(msg);
  119. u32 net_id = msg_bc_netid(msg);
  120. u32 type = msg_type(msg);
  121. msg_get_media_addr(msg,&media_addr);
  122. msg_dbg(msg, "RECV:");
  123. buf_discard(buf);
  124. if (net_id != tipc_net_id)
  125. return;
  126. if (!tipc_addr_domain_valid(dest))
  127. return;
  128. if (!tipc_addr_node_valid(orig))
  129. return;
  130. if (orig == tipc_own_addr) {
  131. if (memcmp(&media_addr, &b_ptr->publ.addr, sizeof(media_addr)))
  132. disc_dupl_alert(b_ptr, tipc_own_addr, &media_addr);
  133. return;
  134. }
  135. if (!tipc_in_scope(dest, tipc_own_addr))
  136. return;
  137. if (in_own_cluster(orig)) {
  138. /* Always accept link here */
  139. struct sk_buff *rbuf;
  140. struct tipc_media_addr *addr;
  141. struct tipc_node *n_ptr = tipc_node_find(orig);
  142. int link_fully_up;
  143. dbg(" in own cluster\n");
  144. if (n_ptr == NULL) {
  145. n_ptr = tipc_node_create(orig);
  146. if (!n_ptr)
  147. return;
  148. }
  149. spin_lock_bh(&n_ptr->lock);
  150. /* Don't talk to neighbor during cleanup after last session */
  151. if (n_ptr->cleanup_required) {
  152. spin_unlock_bh(&n_ptr->lock);
  153. return;
  154. }
  155. link = n_ptr->links[b_ptr->identity];
  156. if (!link) {
  157. dbg("creating link\n");
  158. link = tipc_link_create(b_ptr, orig, &media_addr);
  159. if (!link) {
  160. spin_unlock_bh(&n_ptr->lock);
  161. return;
  162. }
  163. }
  164. addr = &link->media_addr;
  165. if (memcmp(addr, &media_addr, sizeof(*addr))) {
  166. if (tipc_link_is_up(link) || (!link->started)) {
  167. disc_dupl_alert(b_ptr, orig, &media_addr);
  168. spin_unlock_bh(&n_ptr->lock);
  169. return;
  170. }
  171. warn("Resetting link <%s>, peer interface address changed\n",
  172. link->name);
  173. memcpy(addr, &media_addr, sizeof(*addr));
  174. tipc_link_reset(link);
  175. }
  176. link_fully_up = link_working_working(link);
  177. spin_unlock_bh(&n_ptr->lock);
  178. if ((type == DSC_RESP_MSG) || link_fully_up)
  179. return;
  180. rbuf = tipc_disc_init_msg(DSC_RESP_MSG, 1, orig, b_ptr);
  181. if (rbuf != NULL) {
  182. msg_dbg(buf_msg(rbuf),"SEND:");
  183. b_ptr->media->send_msg(rbuf, &b_ptr->publ, &media_addr);
  184. buf_discard(rbuf);
  185. }
  186. }
  187. }
  188. /**
  189. * tipc_disc_stop_link_req - stop sending periodic link setup requests
  190. * @req: ptr to link request structure
  191. */
  192. void tipc_disc_stop_link_req(struct link_req *req)
  193. {
  194. if (!req)
  195. return;
  196. k_cancel_timer(&req->timer);
  197. k_term_timer(&req->timer);
  198. buf_discard(req->buf);
  199. kfree(req);
  200. }
  201. /**
  202. * tipc_disc_update_link_req - update frequency of periodic link setup requests
  203. * @req: ptr to link request structure
  204. */
  205. void tipc_disc_update_link_req(struct link_req *req)
  206. {
  207. if (!req)
  208. return;
  209. if (req->timer_intv == TIPC_LINK_REQ_SLOW) {
  210. if (!req->bearer->nodes.count) {
  211. req->timer_intv = TIPC_LINK_REQ_FAST;
  212. k_start_timer(&req->timer, req->timer_intv);
  213. }
  214. } else if (req->timer_intv == TIPC_LINK_REQ_FAST) {
  215. if (req->bearer->nodes.count) {
  216. req->timer_intv = TIPC_LINK_REQ_SLOW;
  217. k_start_timer(&req->timer, req->timer_intv);
  218. }
  219. } else {
  220. /* leave timer "as is" if haven't yet reached a "normal" rate */
  221. }
  222. }
  223. /**
  224. * disc_timeout - send a periodic link setup request
  225. * @req: ptr to link request structure
  226. *
  227. * Called whenever a link setup request timer associated with a bearer expires.
  228. */
  229. static void disc_timeout(struct link_req *req)
  230. {
  231. spin_lock_bh(&req->bearer->publ.lock);
  232. req->bearer->media->send_msg(req->buf, &req->bearer->publ, &req->dest);
  233. if ((req->timer_intv == TIPC_LINK_REQ_SLOW) ||
  234. (req->timer_intv == TIPC_LINK_REQ_FAST)) {
  235. /* leave timer interval "as is" if already at a "normal" rate */
  236. } else {
  237. req->timer_intv *= 2;
  238. if (req->timer_intv > TIPC_LINK_REQ_FAST)
  239. req->timer_intv = TIPC_LINK_REQ_FAST;
  240. if ((req->timer_intv == TIPC_LINK_REQ_FAST) &&
  241. (req->bearer->nodes.count))
  242. req->timer_intv = TIPC_LINK_REQ_SLOW;
  243. }
  244. k_start_timer(&req->timer, req->timer_intv);
  245. spin_unlock_bh(&req->bearer->publ.lock);
  246. }
  247. /**
  248. * tipc_disc_init_link_req - start sending periodic link setup requests
  249. * @b_ptr: ptr to bearer issuing requests
  250. * @dest: destination address for request messages
  251. * @dest_domain: network domain of node(s) which should respond to message
  252. * @req_links: max number of desired links
  253. *
  254. * Returns pointer to link request structure, or NULL if unable to create.
  255. */
  256. struct link_req *tipc_disc_init_link_req(struct bearer *b_ptr,
  257. const struct tipc_media_addr *dest,
  258. u32 dest_domain,
  259. u32 req_links)
  260. {
  261. struct link_req *req;
  262. req = kmalloc(sizeof(*req), GFP_ATOMIC);
  263. if (!req)
  264. return NULL;
  265. req->buf = tipc_disc_init_msg(DSC_REQ_MSG, req_links, dest_domain, b_ptr);
  266. if (!req->buf) {
  267. kfree(req);
  268. return NULL;
  269. }
  270. memcpy(&req->dest, dest, sizeof(*dest));
  271. req->bearer = b_ptr;
  272. req->timer_intv = TIPC_LINK_REQ_INIT;
  273. k_init_timer(&req->timer, (Handler)disc_timeout, (unsigned long)req);
  274. k_start_timer(&req->timer, req->timer_intv);
  275. return req;
  276. }