tipc: remove 'has_redundant_link' flag from STATE link protocol messages
[deliverable/linux.git] / net / tipc / discover.c
CommitLineData
b97bf3fd
PL
1/*
2 * net/tipc/discover.c
c4307285 3 *
9da1c8b6 4 * Copyright (c) 2003-2006, Ericsson AB
2d627b92 5 * Copyright (c) 2005-2006, 2010-2011, Wind River Systems
b97bf3fd
PL
6 * All rights reserved.
7 *
9ea1fd3c 8 * Redistribution and use in source and binary forms, with or without
b97bf3fd
PL
9 * modification, are permitted provided that the following conditions are met:
10 *
9ea1fd3c
PL
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.
b97bf3fd 19 *
9ea1fd3c
PL
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
b97bf3fd
PL
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
b97bf3fd 38#include "link.h"
b97bf3fd 39#include "discover.h"
b97bf3fd
PL
40
41#define TIPC_LINK_REQ_INIT 125 /* min delay during bearer start up */
972a77fb
AS
42#define TIPC_LINK_REQ_FAST 1000 /* max delay if bearer has no links */
43#define TIPC_LINK_REQ_SLOW 60000 /* max delay if bearer has links */
44#define TIPC_LINK_REQ_INACTIVE 0xffffffff /* indicates no timer in use */
b97bf3fd
PL
45
46
47/**
a18c4bc3 48 * struct tipc_link_req - information about an ongoing link setup request
b97bf3fd
PL
49 * @bearer: bearer issuing requests
50 * @dest: destination address for request messages
66e019a6 51 * @domain: network domain to which links can be established
1209966c 52 * @num_nodes: number of nodes currently discovered (i.e. with an active link)
b97bf3fd
PL
53 * @buf: request message to be (repeatedly) sent
54 * @timer: timer governing period between requests
55 * @timer_intv: current interval between requests (in ms)
56 */
a18c4bc3 57struct tipc_link_req {
2d627b92 58 struct tipc_bearer *bearer;
b97bf3fd 59 struct tipc_media_addr dest;
66e019a6 60 u32 domain;
1209966c 61 int num_nodes;
b97bf3fd
PL
62 struct sk_buff *buf;
63 struct timer_list timer;
64 unsigned int timer_intv;
65};
66
c4307285 67/**
4323add6 68 * tipc_disc_init_msg - initialize a link setup message
b97bf3fd 69 * @type: message type (request or response)
b97bf3fd
PL
70 * @dest_domain: network domain of node(s) which should respond to message
71 * @b_ptr: ptr to bearer issuing message
72 */
ae8509c4 73static struct sk_buff *tipc_disc_init_msg(u32 type, u32 dest_domain,
2d627b92 74 struct tipc_bearer *b_ptr)
b97bf3fd 75{
d901a42b 76 struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE);
b97bf3fd
PL
77 struct tipc_msg *msg;
78
79 if (buf) {
80 msg = buf_msg(buf);
d901a42b 81 tipc_msg_init(msg, LINK_CONFIG, type, INT_H_SIZE, dest_domain);
40aecb1b 82 msg_set_non_seq(msg, 1);
fc0eea69 83 msg_set_node_sig(msg, tipc_random);
b97bf3fd
PL
84 msg_set_dest_domain(msg, dest_domain);
85 msg_set_bc_netid(msg, tipc_net_id);
3d749a6a 86 b_ptr->media->addr2msg(&b_ptr->addr, msg_media_addr(msg));
b97bf3fd
PL
87 }
88 return buf;
89}
90
e91ed0bc
AS
91/**
92 * disc_dupl_alert - issue node address duplication alert
93 * @b_ptr: pointer to bearer detecting duplication
94 * @node_addr: duplicated node address
95 * @media_addr: media address advertised by duplicated node
96 */
2d627b92 97static void disc_dupl_alert(struct tipc_bearer *b_ptr, u32 node_addr,
e91ed0bc
AS
98 struct tipc_media_addr *media_addr)
99{
100 char node_addr_str[16];
101 char media_addr_str[64];
e91ed0bc 102
c68ca7b7 103 tipc_addr_string_fill(node_addr_str, node_addr);
dc1aed37
EH
104 tipc_media_addr_printf(media_addr_str, sizeof(media_addr_str),
105 media_addr);
2cf8aa19
EH
106 pr_warn("Duplicate %s using %s seen on <%s>\n", node_addr_str,
107 media_addr_str, b_ptr->name);
e91ed0bc
AS
108}
109
b97bf3fd 110/**
4323add6 111 * tipc_disc_recv_msg - handle incoming link setup message (request or response)
b97bf3fd 112 * @buf: buffer containing message
1265a021 113 * @b_ptr: bearer that message arrived on
b97bf3fd 114 */
2d627b92 115void tipc_disc_recv_msg(struct sk_buff *buf, struct tipc_bearer *b_ptr)
b97bf3fd 116{
a728750e 117 struct tipc_node *n_ptr;
a18c4bc3 118 struct tipc_link *link;
97878a40 119 struct tipc_media_addr media_addr;
a728750e 120 struct sk_buff *rbuf;
b97bf3fd
PL
121 struct tipc_msg *msg = buf_msg(buf);
122 u32 dest = msg_dest_domain(msg);
123 u32 orig = msg_prevnode(msg);
124 u32 net_id = msg_bc_netid(msg);
125 u32 type = msg_type(msg);
fc0eea69 126 u32 signature = msg_node_sig(msg);
97878a40 127 int addr_mismatch;
a728750e 128 int link_fully_up;
b97bf3fd 129
d6d4577a 130 media_addr.broadcast = 1;
8aeb89f2 131 b_ptr->media->msg2addr(b_ptr, &media_addr, msg_media_addr(msg));
5f6d9123 132 kfree_skb(buf);
b97bf3fd 133
97878a40 134 /* Ensure message from node is valid and communication is permitted */
b97bf3fd
PL
135 if (net_id != tipc_net_id)
136 return;
d6d4577a
AS
137 if (media_addr.broadcast)
138 return;
4323add6 139 if (!tipc_addr_domain_valid(dest))
b97bf3fd 140 return;
4323add6 141 if (!tipc_addr_node_valid(orig))
b97bf3fd 142 return;
e91ed0bc 143 if (orig == tipc_own_addr) {
2d627b92 144 if (memcmp(&media_addr, &b_ptr->addr, sizeof(media_addr)))
e91ed0bc 145 disc_dupl_alert(b_ptr, tipc_own_addr, &media_addr);
b97bf3fd 146 return;
e91ed0bc 147 }
c68ca7b7 148 if (!tipc_in_scope(dest, tipc_own_addr))
b97bf3fd 149 return;
66e019a6 150 if (!tipc_in_scope(b_ptr->link_req->domain, orig))
a728750e 151 return;
5a68d5ee 152
a728750e
AS
153 /* Locate structure corresponding to requesting node */
154 n_ptr = tipc_node_find(orig);
155 if (!n_ptr) {
156 n_ptr = tipc_node_create(orig);
157 if (!n_ptr)
5a68d5ee 158 return;
a728750e
AS
159 }
160 tipc_node_lock(n_ptr);
161
97878a40 162 /* Prepare to validate requesting node's signature and media address */
a728750e 163 link = n_ptr->links[b_ptr->identity];
97878a40
AS
164 addr_mismatch = (link != NULL) &&
165 memcmp(&link->media_addr, &media_addr, sizeof(media_addr));
a728750e 166
97878a40
AS
167 /*
168 * Ensure discovery message's signature is correct
169 *
170 * If signature is incorrect and there is no working link to the node,
171 * accept the new signature but invalidate all existing links to the
172 * node so they won't re-activate without a new discovery message.
173 *
174 * If signature is incorrect and the requested link to the node is
175 * working, accept the new signature. (This is an instance of delayed
176 * rediscovery, where a link endpoint was able to re-establish contact
177 * with its peer endpoint on a node that rebooted before receiving a
178 * discovery message from that node.)
179 *
180 * If signature is incorrect and there is a working link to the node
181 * that is not the requested link, reject the request (must be from
182 * a duplicate node).
183 */
184 if (signature != n_ptr->signature) {
185 if (n_ptr->working_links == 0) {
186 struct tipc_link *curr_link;
187 int i;
188
189 for (i = 0; i < MAX_BEARERS; i++) {
190 curr_link = n_ptr->links[i];
191 if (curr_link) {
192 memset(&curr_link->media_addr, 0,
193 sizeof(media_addr));
194 tipc_link_reset(curr_link);
195 }
196 }
197 addr_mismatch = (link != NULL);
198 } else if (tipc_link_is_up(link) && !addr_mismatch) {
199 /* delayed rediscovery */
200 } else {
201 disc_dupl_alert(b_ptr, orig, &media_addr);
a728750e
AS
202 tipc_node_unlock(n_ptr);
203 return;
b97bf3fd 204 }
97878a40 205 n_ptr->signature = signature;
a728750e
AS
206 }
207
208 /*
209 * Ensure requesting node's media address is correct
210 *
211 * If media address doesn't match and the link is working, reject the
212 * request (must be from a duplicate node).
213 *
214 * If media address doesn't match and the link is not working, accept
215 * the new media address and reset the link to ensure it starts up
216 * cleanly.
217 */
97878a40
AS
218 if (addr_mismatch) {
219 if (tipc_link_is_up(link)) {
a728750e
AS
220 disc_dupl_alert(b_ptr, orig, &media_addr);
221 tipc_node_unlock(n_ptr);
b97bf3fd 222 return;
97878a40
AS
223 } else {
224 memcpy(&link->media_addr, &media_addr,
225 sizeof(media_addr));
226 tipc_link_reset(link);
227 }
228 }
229
230 /* Create a link endpoint for this bearer, if necessary */
231 if (!link) {
232 link = tipc_link_create(n_ptr, b_ptr, &media_addr);
233 if (!link) {
234 tipc_node_unlock(n_ptr);
235 return;
b97bf3fd 236 }
a728750e
AS
237 }
238
239 /* Accept discovery message & send response, if necessary */
240 link_fully_up = link_working_working(link);
fa2bae2d 241
512137ee 242 if ((type == DSC_REQ_MSG) && !link_fully_up) {
fa2bae2d
AS
243 rbuf = tipc_disc_init_msg(DSC_RESP_MSG, orig, b_ptr);
244 if (rbuf) {
3c294cb3 245 tipc_bearer_send(b_ptr, rbuf, &media_addr);
5f6d9123 246 kfree_skb(rbuf);
fa2bae2d 247 }
b97bf3fd 248 }
fa2bae2d
AS
249
250 tipc_node_unlock(n_ptr);
b97bf3fd
PL
251}
252
b97bf3fd 253/**
1209966c 254 * disc_update - update frequency of periodic link setup requests
b97bf3fd 255 * @req: ptr to link request structure
972a77fb
AS
256 *
257 * Reinitiates discovery process if discovery object has no associated nodes
258 * and is either not currently searching or is searching at a slow rate
b97bf3fd 259 */
a18c4bc3 260static void disc_update(struct tipc_link_req *req)
b97bf3fd 261{
972a77fb
AS
262 if (!req->num_nodes) {
263 if ((req->timer_intv == TIPC_LINK_REQ_INACTIVE) ||
264 (req->timer_intv > TIPC_LINK_REQ_FAST)) {
265 req->timer_intv = TIPC_LINK_REQ_INIT;
b97bf3fd
PL
266 k_start_timer(&req->timer, req->timer_intv);
267 }
b97bf3fd 268 }
c4307285 269}
b97bf3fd 270
1209966c
AS
271/**
272 * tipc_disc_add_dest - increment set of discovered nodes
273 * @req: ptr to link request structure
274 */
a18c4bc3 275void tipc_disc_add_dest(struct tipc_link_req *req)
1209966c
AS
276{
277 req->num_nodes++;
1209966c
AS
278}
279
280/**
281 * tipc_disc_remove_dest - decrement set of discovered nodes
282 * @req: ptr to link request structure
283 */
a18c4bc3 284void tipc_disc_remove_dest(struct tipc_link_req *req)
1209966c
AS
285{
286 req->num_nodes--;
287 disc_update(req);
288}
289
b97bf3fd
PL
290/**
291 * disc_timeout - send a periodic link setup request
292 * @req: ptr to link request structure
c4307285 293 *
b97bf3fd
PL
294 * Called whenever a link setup request timer associated with a bearer expires.
295 */
a18c4bc3 296static void disc_timeout(struct tipc_link_req *req)
b97bf3fd 297{
972a77fb
AS
298 int max_delay;
299
2d627b92 300 spin_lock_bh(&req->bearer->lock);
b97bf3fd 301
972a77fb 302 /* Stop searching if only desired node has been found */
972a77fb
AS
303 if (tipc_node(req->domain) && req->num_nodes) {
304 req->timer_intv = TIPC_LINK_REQ_INACTIVE;
305 goto exit;
b97bf3fd 306 }
b97bf3fd 307
972a77fb
AS
308 /*
309 * Send discovery message, then update discovery timer
310 *
311 * Keep doubling time between requests until limit is reached;
312 * hold at fast polling rate if don't have any associated nodes,
313 * otherwise hold at slow polling rate
314 */
512137ee
EH
315 tipc_bearer_send(req->bearer, req->buf, &req->dest);
316
972a77fb
AS
317
318 req->timer_intv *= 2;
319 if (req->num_nodes)
320 max_delay = TIPC_LINK_REQ_SLOW;
321 else
322 max_delay = TIPC_LINK_REQ_FAST;
323 if (req->timer_intv > max_delay)
324 req->timer_intv = max_delay;
325
326 k_start_timer(&req->timer, req->timer_intv);
327exit:
2d627b92 328 spin_unlock_bh(&req->bearer->lock);
b97bf3fd
PL
329}
330
331/**
3a777ff8 332 * tipc_disc_create - create object to send periodic link setup requests
b97bf3fd
PL
333 * @b_ptr: ptr to bearer issuing requests
334 * @dest: destination address for request messages
66e019a6 335 * @dest_domain: network domain to which links can be established
c4307285 336 *
3a777ff8 337 * Returns 0 if successful, otherwise -errno.
b97bf3fd 338 */
ae8509c4
PG
339int tipc_disc_create(struct tipc_bearer *b_ptr, struct tipc_media_addr *dest,
340 u32 dest_domain)
b97bf3fd 341{
a18c4bc3 342 struct tipc_link_req *req;
b97bf3fd 343
9df3f3d2 344 req = kmalloc(sizeof(*req), GFP_ATOMIC);
b97bf3fd 345 if (!req)
3a777ff8 346 return -ENOMEM;
b97bf3fd 347
2e07dda1 348 req->buf = tipc_disc_init_msg(DSC_REQ_MSG, dest_domain, b_ptr);
b97bf3fd
PL
349 if (!req->buf) {
350 kfree(req);
3a777ff8 351 return -ENOMSG;
b97bf3fd
PL
352 }
353
354 memcpy(&req->dest, dest, sizeof(*dest));
355 req->bearer = b_ptr;
66e019a6 356 req->domain = dest_domain;
1209966c 357 req->num_nodes = 0;
b97bf3fd
PL
358 req->timer_intv = TIPC_LINK_REQ_INIT;
359 k_init_timer(&req->timer, (Handler)disc_timeout, (unsigned long)req);
360 k_start_timer(&req->timer, req->timer_intv);
3a777ff8 361 b_ptr->link_req = req;
512137ee 362 tipc_bearer_send(req->bearer, req->buf, &req->dest);
3a777ff8
AS
363 return 0;
364}
365
366/**
367 * tipc_disc_delete - destroy object sending periodic link setup requests
368 * @req: ptr to link request structure
369 */
a18c4bc3 370void tipc_disc_delete(struct tipc_link_req *req)
3a777ff8
AS
371{
372 k_cancel_timer(&req->timer);
373 k_term_timer(&req->timer);
5f6d9123 374 kfree_skb(req->buf);
3a777ff8 375 kfree(req);
c4307285 376}
This page took 0.920331 seconds and 5 git commands to generate.