discover.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318
  1. /*
  2. * net/tipc/discover.c
  3. *
  4. * Copyright (c) 2003-2006, Ericsson AB
  5. * Copyright (c) 2005, 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. #if 0
  47. #define GET_NODE_INFO 300
  48. #define GET_NODE_INFO_RESULT 301
  49. #define FORWARD_LINK_PROBE 302
  50. #define LINK_REQUEST_REJECTED 303
  51. #define LINK_REQUEST_ACCEPTED 304
  52. #define DROP_LINK_REQUEST 305
  53. #define CHECK_LINK_COUNT 306
  54. #endif
  55. /*
  56. * TODO: Most of the inter-cluster setup stuff should be
  57. * rewritten, and be made conformant with specification.
  58. */
  59. /**
  60. * struct link_req - information about an ongoing link setup request
  61. * @bearer: bearer issuing requests
  62. * @dest: destination address for request messages
  63. * @buf: request message to be (repeatedly) sent
  64. * @timer: timer governing period between requests
  65. * @timer_intv: current interval between requests (in ms)
  66. */
  67. struct link_req {
  68. struct bearer *bearer;
  69. struct tipc_media_addr dest;
  70. struct sk_buff *buf;
  71. struct timer_list timer;
  72. unsigned int timer_intv;
  73. };
  74. #if 0
  75. int disc_create_link(const struct tipc_link_create *argv)
  76. {
  77. /*
  78. * Code for inter cluster link setup here
  79. */
  80. return TIPC_OK;
  81. }
  82. #endif
  83. /*
  84. * disc_lost_link(): A link has lost contact
  85. */
  86. void tipc_disc_link_event(u32 addr, char *name, int up)
  87. {
  88. if (in_own_cluster(addr))
  89. return;
  90. /*
  91. * Code for inter cluster link setup here
  92. */
  93. }
  94. /**
  95. * tipc_disc_init_msg - initialize a link setup message
  96. * @type: message type (request or response)
  97. * @req_links: number of links associated with message
  98. * @dest_domain: network domain of node(s) which should respond to message
  99. * @b_ptr: ptr to bearer issuing message
  100. */
  101. static struct sk_buff *tipc_disc_init_msg(u32 type,
  102. u32 req_links,
  103. u32 dest_domain,
  104. struct bearer *b_ptr)
  105. {
  106. struct sk_buff *buf = buf_acquire(DSC_H_SIZE);
  107. struct tipc_msg *msg;
  108. if (buf) {
  109. msg = buf_msg(buf);
  110. msg_init(msg, LINK_CONFIG, type, TIPC_OK, DSC_H_SIZE,
  111. dest_domain);
  112. msg_set_non_seq(msg);
  113. msg_set_req_links(msg, req_links);
  114. msg_set_dest_domain(msg, dest_domain);
  115. msg_set_bc_netid(msg, tipc_net_id);
  116. msg_set_media_addr(msg, &b_ptr->publ.addr);
  117. }
  118. return buf;
  119. }
  120. /**
  121. * tipc_disc_recv_msg - handle incoming link setup message (request or response)
  122. * @buf: buffer containing message
  123. */
  124. void tipc_disc_recv_msg(struct sk_buff *buf)
  125. {
  126. struct bearer *b_ptr = (struct bearer *)TIPC_SKB_CB(buf)->handle;
  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. return;
  145. if (!in_scope(dest, tipc_own_addr))
  146. return;
  147. if (is_slave(tipc_own_addr) && is_slave(orig))
  148. return;
  149. if (is_slave(orig) && !in_own_cluster(orig))
  150. return;
  151. if (in_own_cluster(orig)) {
  152. /* Always accept link here */
  153. struct sk_buff *rbuf;
  154. struct tipc_media_addr *addr;
  155. struct node *n_ptr = tipc_node_find(orig);
  156. int link_up;
  157. dbg(" in own cluster\n");
  158. if (n_ptr == NULL) {
  159. n_ptr = tipc_node_create(orig);
  160. }
  161. if (n_ptr == NULL) {
  162. warn("Memory squeeze; Failed to create node\n");
  163. return;
  164. }
  165. spin_lock_bh(&n_ptr->lock);
  166. link = n_ptr->links[b_ptr->identity];
  167. if (!link) {
  168. dbg("creating link\n");
  169. link = tipc_link_create(b_ptr, orig, &media_addr);
  170. if (!link) {
  171. spin_unlock_bh(&n_ptr->lock);
  172. return;
  173. }
  174. }
  175. addr = &link->media_addr;
  176. if (memcmp(addr, &media_addr, sizeof(*addr))) {
  177. char addr_string[16];
  178. warn("New bearer address for %s\n",
  179. addr_string_fill(addr_string, orig));
  180. memcpy(addr, &media_addr, sizeof(*addr));
  181. tipc_link_reset(link);
  182. }
  183. link_up = tipc_link_is_up(link);
  184. spin_unlock_bh(&n_ptr->lock);
  185. if ((type == DSC_RESP_MSG) || link_up)
  186. return;
  187. rbuf = tipc_disc_init_msg(DSC_RESP_MSG, 1, orig, b_ptr);
  188. if (rbuf != NULL) {
  189. msg_dbg(buf_msg(rbuf),"SEND:");
  190. b_ptr->media->send_msg(rbuf, &b_ptr->publ, &media_addr);
  191. buf_discard(rbuf);
  192. }
  193. }
  194. }
  195. /**
  196. * tipc_disc_stop_link_req - stop sending periodic link setup requests
  197. * @req: ptr to link request structure
  198. */
  199. void tipc_disc_stop_link_req(struct link_req *req)
  200. {
  201. if (!req)
  202. return;
  203. k_cancel_timer(&req->timer);
  204. k_term_timer(&req->timer);
  205. buf_discard(req->buf);
  206. kfree(req);
  207. }
  208. /**
  209. * tipc_disc_update_link_req - update frequency of periodic link setup requests
  210. * @req: ptr to link request structure
  211. */
  212. void tipc_disc_update_link_req(struct link_req *req)
  213. {
  214. if (!req)
  215. return;
  216. if (req->timer_intv == TIPC_LINK_REQ_SLOW) {
  217. if (!req->bearer->nodes.count) {
  218. req->timer_intv = TIPC_LINK_REQ_FAST;
  219. k_start_timer(&req->timer, req->timer_intv);
  220. }
  221. } else if (req->timer_intv == TIPC_LINK_REQ_FAST) {
  222. if (req->bearer->nodes.count) {
  223. req->timer_intv = TIPC_LINK_REQ_SLOW;
  224. k_start_timer(&req->timer, req->timer_intv);
  225. }
  226. } else {
  227. /* leave timer "as is" if haven't yet reached a "normal" rate */
  228. }
  229. }
  230. /**
  231. * disc_timeout - send a periodic link setup request
  232. * @req: ptr to link request structure
  233. *
  234. * Called whenever a link setup request timer associated with a bearer expires.
  235. */
  236. static void disc_timeout(struct link_req *req)
  237. {
  238. spin_lock_bh(&req->bearer->publ.lock);
  239. req->bearer->media->send_msg(req->buf, &req->bearer->publ, &req->dest);
  240. if ((req->timer_intv == TIPC_LINK_REQ_SLOW) ||
  241. (req->timer_intv == TIPC_LINK_REQ_FAST)) {
  242. /* leave timer interval "as is" if already at a "normal" rate */
  243. } else {
  244. req->timer_intv *= 2;
  245. if (req->timer_intv > TIPC_LINK_REQ_SLOW)
  246. req->timer_intv = TIPC_LINK_REQ_SLOW;
  247. if ((req->timer_intv == TIPC_LINK_REQ_FAST) &&
  248. (req->bearer->nodes.count))
  249. req->timer_intv = TIPC_LINK_REQ_SLOW;
  250. }
  251. k_start_timer(&req->timer, req->timer_intv);
  252. spin_unlock_bh(&req->bearer->publ.lock);
  253. }
  254. /**
  255. * tipc_disc_init_link_req - start sending periodic link setup requests
  256. * @b_ptr: ptr to bearer issuing requests
  257. * @dest: destination address for request messages
  258. * @dest_domain: network domain of node(s) which should respond to message
  259. * @req_links: max number of desired links
  260. *
  261. * Returns pointer to link request structure, or NULL if unable to create.
  262. */
  263. struct link_req *tipc_disc_init_link_req(struct bearer *b_ptr,
  264. const struct tipc_media_addr *dest,
  265. u32 dest_domain,
  266. u32 req_links)
  267. {
  268. struct link_req *req;
  269. req = (struct link_req *)kmalloc(sizeof(*req), GFP_ATOMIC);
  270. if (!req)
  271. return NULL;
  272. req->buf = tipc_disc_init_msg(DSC_REQ_MSG, req_links, dest_domain, b_ptr);
  273. if (!req->buf) {
  274. kfree(req);
  275. return NULL;
  276. }
  277. memcpy(&req->dest, dest, sizeof(*dest));
  278. req->bearer = b_ptr;
  279. req->timer_intv = TIPC_LINK_REQ_INIT;
  280. k_init_timer(&req->timer, (Handler)disc_timeout, (unsigned long)req);
  281. k_start_timer(&req->timer, req->timer_intv);
  282. return req;
  283. }