discover.c 9.4 KB

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