246a23788dedc0d94aa5a1843f39d0b964cc77fe
[deliverable/linux.git] / net / tipc / discover.c
1 /*
2 * net/tipc/discover.c
3 *
4 * Copyright (c) 2003-2006, 2014, Ericsson AB
5 * Copyright (c) 2005-2006, 2010-2011, 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
37 #include "core.h"
38 #include "link.h"
39 #include "discover.h"
40
41 /* min delay during bearer start up */
42 #define TIPC_LINK_REQ_INIT msecs_to_jiffies(125)
43 /* max delay if bearer has no links */
44 #define TIPC_LINK_REQ_FAST msecs_to_jiffies(1000)
45 /* max delay if bearer has links */
46 #define TIPC_LINK_REQ_SLOW msecs_to_jiffies(60000)
47 /* indicates no timer in use */
48 #define TIPC_LINK_REQ_INACTIVE 0xffffffff
49
50
51 /**
52 * struct tipc_link_req - information about an ongoing link setup request
53 * @bearer_id: identity of bearer issuing requests
54 * @dest: destination address for request messages
55 * @domain: network domain to which links can be established
56 * @num_nodes: number of nodes currently discovered (i.e. with an active link)
57 * @lock: spinlock for controlling access to requests
58 * @buf: request message to be (repeatedly) sent
59 * @timer: timer governing period between requests
60 * @timer_intv: current interval between requests (in ms)
61 */
62 struct tipc_link_req {
63 u32 bearer_id;
64 struct tipc_media_addr dest;
65 u32 domain;
66 int num_nodes;
67 spinlock_t lock;
68 struct sk_buff *buf;
69 struct timer_list timer;
70 unsigned long timer_intv;
71 };
72
73 /**
74 * tipc_disc_init_msg - initialize a link setup message
75 * @net: the applicable net namespace
76 * @type: message type (request or response)
77 * @b_ptr: ptr to bearer issuing message
78 */
79 static void tipc_disc_init_msg(struct net *net, struct sk_buff *buf, u32 type,
80 struct tipc_bearer *b_ptr)
81 {
82 struct tipc_net *tn = net_generic(net, tipc_net_id);
83 struct tipc_msg *msg;
84 u32 dest_domain = b_ptr->domain;
85
86 msg = buf_msg(buf);
87 tipc_msg_init(msg, LINK_CONFIG, type, INT_H_SIZE, dest_domain);
88 msg_set_non_seq(msg, 1);
89 msg_set_node_sig(msg, tipc_random);
90 msg_set_dest_domain(msg, dest_domain);
91 msg_set_bc_netid(msg, tn->net_id);
92 b_ptr->media->addr2msg(msg_media_addr(msg), &b_ptr->addr);
93 }
94
95 /**
96 * disc_dupl_alert - issue node address duplication alert
97 * @b_ptr: pointer to bearer detecting duplication
98 * @node_addr: duplicated node address
99 * @media_addr: media address advertised by duplicated node
100 */
101 static void disc_dupl_alert(struct tipc_bearer *b_ptr, u32 node_addr,
102 struct tipc_media_addr *media_addr)
103 {
104 char node_addr_str[16];
105 char media_addr_str[64];
106
107 tipc_addr_string_fill(node_addr_str, node_addr);
108 tipc_media_addr_printf(media_addr_str, sizeof(media_addr_str),
109 media_addr);
110 pr_warn("Duplicate %s using %s seen on <%s>\n", node_addr_str,
111 media_addr_str, b_ptr->name);
112 }
113
114 /**
115 * tipc_disc_rcv - handle incoming discovery message (request or response)
116 * @net: the applicable net namespace
117 * @buf: buffer containing message
118 * @bearer: bearer that message arrived on
119 */
120 void tipc_disc_rcv(struct net *net, struct sk_buff *buf,
121 struct tipc_bearer *bearer)
122 {
123 struct tipc_net *tn = net_generic(net, tipc_net_id);
124 struct tipc_node *node;
125 struct tipc_link *link;
126 struct tipc_media_addr maddr;
127 struct sk_buff *rbuf;
128 struct tipc_msg *msg = buf_msg(buf);
129 u32 ddom = msg_dest_domain(msg);
130 u32 onode = msg_prevnode(msg);
131 u32 net_id = msg_bc_netid(msg);
132 u32 mtyp = msg_type(msg);
133 u32 signature = msg_node_sig(msg);
134 bool addr_match = false;
135 bool sign_match = false;
136 bool link_up = false;
137 bool accept_addr = false;
138 bool accept_sign = false;
139 bool respond = false;
140
141 bearer->media->msg2addr(bearer, &maddr, msg_media_addr(msg));
142 kfree_skb(buf);
143
144 /* Ensure message from node is valid and communication is permitted */
145 if (net_id != tn->net_id)
146 return;
147 if (maddr.broadcast)
148 return;
149 if (!tipc_addr_domain_valid(ddom))
150 return;
151 if (!tipc_addr_node_valid(onode))
152 return;
153
154 if (in_own_node(onode)) {
155 if (memcmp(&maddr, &bearer->addr, sizeof(maddr)))
156 disc_dupl_alert(bearer, tipc_own_addr, &maddr);
157 return;
158 }
159 if (!tipc_in_scope(ddom, tipc_own_addr))
160 return;
161 if (!tipc_in_scope(bearer->domain, onode))
162 return;
163
164 /* Locate, or if necessary, create, node: */
165 node = tipc_node_find(onode);
166 if (!node)
167 node = tipc_node_create(onode);
168 if (!node)
169 return;
170
171 tipc_node_lock(node);
172 link = node->links[bearer->identity];
173
174 /* Prepare to validate requesting node's signature and media address */
175 sign_match = (signature == node->signature);
176 addr_match = link && !memcmp(&link->media_addr, &maddr, sizeof(maddr));
177 link_up = link && tipc_link_is_up(link);
178
179
180 /* These three flags give us eight permutations: */
181
182 if (sign_match && addr_match && link_up) {
183 /* All is fine. Do nothing. */
184 } else if (sign_match && addr_match && !link_up) {
185 /* Respond. The link will come up in due time */
186 respond = true;
187 } else if (sign_match && !addr_match && link_up) {
188 /* Peer has changed i/f address without rebooting.
189 * If so, the link will reset soon, and the next
190 * discovery will be accepted. So we can ignore it.
191 * It may also be an cloned or malicious peer having
192 * chosen the same node address and signature as an
193 * existing one.
194 * Ignore requests until the link goes down, if ever.
195 */
196 disc_dupl_alert(bearer, onode, &maddr);
197 } else if (sign_match && !addr_match && !link_up) {
198 /* Peer link has changed i/f address without rebooting.
199 * It may also be a cloned or malicious peer; we can't
200 * distinguish between the two.
201 * The signature is correct, so we must accept.
202 */
203 accept_addr = true;
204 respond = true;
205 } else if (!sign_match && addr_match && link_up) {
206 /* Peer node rebooted. Two possibilities:
207 * - Delayed re-discovery; this link endpoint has already
208 * reset and re-established contact with the peer, before
209 * receiving a discovery message from that node.
210 * (The peer happened to receive one from this node first).
211 * - The peer came back so fast that our side has not
212 * discovered it yet. Probing from this side will soon
213 * reset the link, since there can be no working link
214 * endpoint at the peer end, and the link will re-establish.
215 * Accept the signature, since it comes from a known peer.
216 */
217 accept_sign = true;
218 } else if (!sign_match && addr_match && !link_up) {
219 /* The peer node has rebooted.
220 * Accept signature, since it is a known peer.
221 */
222 accept_sign = true;
223 respond = true;
224 } else if (!sign_match && !addr_match && link_up) {
225 /* Peer rebooted with new address, or a new/duplicate peer.
226 * Ignore until the link goes down, if ever.
227 */
228 disc_dupl_alert(bearer, onode, &maddr);
229 } else if (!sign_match && !addr_match && !link_up) {
230 /* Peer rebooted with new address, or it is a new peer.
231 * Accept signature and address.
232 */
233 accept_sign = true;
234 accept_addr = true;
235 respond = true;
236 }
237
238 if (accept_sign)
239 node->signature = signature;
240
241 if (accept_addr) {
242 if (!link)
243 link = tipc_link_create(node, bearer, &maddr);
244 if (link) {
245 memcpy(&link->media_addr, &maddr, sizeof(maddr));
246 tipc_link_reset(link);
247 } else {
248 respond = false;
249 }
250 }
251
252 /* Send response, if necessary */
253 if (respond && (mtyp == DSC_REQ_MSG)) {
254 rbuf = tipc_buf_acquire(INT_H_SIZE);
255 if (rbuf) {
256 tipc_disc_init_msg(net, rbuf, DSC_RESP_MSG, bearer);
257 tipc_bearer_send(bearer->identity, rbuf, &maddr);
258 kfree_skb(rbuf);
259 }
260 }
261 tipc_node_unlock(node);
262 }
263
264 /**
265 * disc_update - update frequency of periodic link setup requests
266 * @req: ptr to link request structure
267 *
268 * Reinitiates discovery process if discovery object has no associated nodes
269 * and is either not currently searching or is searching at a slow rate
270 */
271 static void disc_update(struct tipc_link_req *req)
272 {
273 if (!req->num_nodes) {
274 if ((req->timer_intv == TIPC_LINK_REQ_INACTIVE) ||
275 (req->timer_intv > TIPC_LINK_REQ_FAST)) {
276 req->timer_intv = TIPC_LINK_REQ_INIT;
277 mod_timer(&req->timer, jiffies + req->timer_intv);
278 }
279 }
280 }
281
282 /**
283 * tipc_disc_add_dest - increment set of discovered nodes
284 * @req: ptr to link request structure
285 */
286 void tipc_disc_add_dest(struct tipc_link_req *req)
287 {
288 spin_lock_bh(&req->lock);
289 req->num_nodes++;
290 spin_unlock_bh(&req->lock);
291 }
292
293 /**
294 * tipc_disc_remove_dest - decrement set of discovered nodes
295 * @req: ptr to link request structure
296 */
297 void tipc_disc_remove_dest(struct tipc_link_req *req)
298 {
299 spin_lock_bh(&req->lock);
300 req->num_nodes--;
301 disc_update(req);
302 spin_unlock_bh(&req->lock);
303 }
304
305 /**
306 * disc_timeout - send a periodic link setup request
307 * @data: ptr to link request structure
308 *
309 * Called whenever a link setup request timer associated with a bearer expires.
310 */
311 static void disc_timeout(unsigned long data)
312 {
313 struct tipc_link_req *req = (struct tipc_link_req *)data;
314 int max_delay;
315
316 spin_lock_bh(&req->lock);
317
318 /* Stop searching if only desired node has been found */
319 if (tipc_node(req->domain) && req->num_nodes) {
320 req->timer_intv = TIPC_LINK_REQ_INACTIVE;
321 goto exit;
322 }
323
324 /*
325 * Send discovery message, then update discovery timer
326 *
327 * Keep doubling time between requests until limit is reached;
328 * hold at fast polling rate if don't have any associated nodes,
329 * otherwise hold at slow polling rate
330 */
331 tipc_bearer_send(req->bearer_id, req->buf, &req->dest);
332
333
334 req->timer_intv *= 2;
335 if (req->num_nodes)
336 max_delay = TIPC_LINK_REQ_SLOW;
337 else
338 max_delay = TIPC_LINK_REQ_FAST;
339 if (req->timer_intv > max_delay)
340 req->timer_intv = max_delay;
341
342 mod_timer(&req->timer, jiffies + req->timer_intv);
343 exit:
344 spin_unlock_bh(&req->lock);
345 }
346
347 /**
348 * tipc_disc_create - create object to send periodic link setup requests
349 * @net: the applicable net namespace
350 * @b_ptr: ptr to bearer issuing requests
351 * @dest: destination address for request messages
352 * @dest_domain: network domain to which links can be established
353 *
354 * Returns 0 if successful, otherwise -errno.
355 */
356 int tipc_disc_create(struct net *net, struct tipc_bearer *b_ptr,
357 struct tipc_media_addr *dest)
358 {
359 struct tipc_link_req *req;
360
361 req = kmalloc(sizeof(*req), GFP_ATOMIC);
362 if (!req)
363 return -ENOMEM;
364
365 req->buf = tipc_buf_acquire(INT_H_SIZE);
366 if (!req->buf) {
367 kfree(req);
368 return -ENOMEM;
369 }
370
371 tipc_disc_init_msg(net, req->buf, DSC_REQ_MSG, b_ptr);
372 memcpy(&req->dest, dest, sizeof(*dest));
373 req->bearer_id = b_ptr->identity;
374 req->domain = b_ptr->domain;
375 req->num_nodes = 0;
376 req->timer_intv = TIPC_LINK_REQ_INIT;
377 spin_lock_init(&req->lock);
378 setup_timer(&req->timer, disc_timeout, (unsigned long)req);
379 mod_timer(&req->timer, jiffies + req->timer_intv);
380 b_ptr->link_req = req;
381 tipc_bearer_send(req->bearer_id, req->buf, &req->dest);
382 return 0;
383 }
384
385 /**
386 * tipc_disc_delete - destroy object sending periodic link setup requests
387 * @req: ptr to link request structure
388 */
389 void tipc_disc_delete(struct tipc_link_req *req)
390 {
391 del_timer_sync(&req->timer);
392 kfree_skb(req->buf);
393 kfree(req);
394 }
395
396 /**
397 * tipc_disc_reset - reset object to send periodic link setup requests
398 * @net: the applicable net namespace
399 * @b_ptr: ptr to bearer issuing requests
400 * @dest_domain: network domain to which links can be established
401 */
402 void tipc_disc_reset(struct net *net, struct tipc_bearer *b_ptr)
403 {
404 struct tipc_link_req *req = b_ptr->link_req;
405
406 spin_lock_bh(&req->lock);
407 tipc_disc_init_msg(net, req->buf, DSC_REQ_MSG, b_ptr);
408 req->bearer_id = b_ptr->identity;
409 req->domain = b_ptr->domain;
410 req->num_nodes = 0;
411 req->timer_intv = TIPC_LINK_REQ_INIT;
412 mod_timer(&req->timer, jiffies + req->timer_intv);
413 tipc_bearer_send(req->bearer_id, req->buf, &req->dest);
414 spin_unlock_bh(&req->lock);
415 }
This page took 0.047191 seconds and 5 git commands to generate.