discover.c 9.2 KB

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