discover.c 12.8 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/discover.c
3
 *
4
 * Copyright (c) 2003-2006, 2014-2015, Ericsson AB
5
 * Copyright (c) 2005-2006, 2010-2011, Wind River Systems
P
Per Liden 已提交
6 7
 * All rights reserved.
 *
P
Per Liden 已提交
8
 * Redistribution and use in source and binary forms, with or without
P
Per Liden 已提交
9 10
 * modification, are permitted provided that the following conditions are met:
 *
P
Per Liden 已提交
11 12 13 14 15 16 17 18
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the names of the copyright holders nor the names of its
 *    contributors may be used to endorse or promote products derived from
 *    this software without specific prior written permission.
P
Per Liden 已提交
19
 *
P
Per Liden 已提交
20 21 22 23 24 25 26 27 28 29 30 31 32 33
 * Alternatively, this software may be distributed under the terms of the
 * GNU General Public License ("GPL") version 2 as published by the Free
 * Software Foundation.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
P
Per Liden 已提交
34 35 36 37 38 39 40
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "core.h"
#include "link.h"
#include "discover.h"

41 42 43 44 45 46 47 48
/* min delay during bearer start up */
#define TIPC_LINK_REQ_INIT	msecs_to_jiffies(125)
/* max delay if bearer has no links */
#define TIPC_LINK_REQ_FAST	msecs_to_jiffies(1000)
/* max delay if bearer has links */
#define TIPC_LINK_REQ_SLOW	msecs_to_jiffies(60000)
/* indicates no timer in use */
#define TIPC_LINK_REQ_INACTIVE	0xffffffff
P
Per Liden 已提交
49 50

/**
51
 * struct tipc_link_req - information about an ongoing link setup request
52
 * @bearer_id: identity of bearer issuing requests
53
 * @net: network namespace instance
P
Per Liden 已提交
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
P
Per Liden 已提交
58 59 60 61
 * @buf: request message to be (repeatedly) sent
 * @timer: timer governing period between requests
 * @timer_intv: current interval between requests (in ms)
 */
62
struct tipc_link_req {
63
	u32 bearer_id;
P
Per Liden 已提交
64
	struct tipc_media_addr dest;
65
	struct net *net;
66
	u32 domain;
67
	int num_nodes;
68
	spinlock_t lock;
P
Per Liden 已提交
69 70
	struct sk_buff *buf;
	struct timer_list timer;
71
	unsigned long timer_intv;
P
Per Liden 已提交
72 73
};

74
/**
75
 * tipc_disc_init_msg - initialize a link setup message
76
 * @net: the applicable net namespace
P
Per Liden 已提交
77 78 79
 * @type: message type (request or response)
 * @b_ptr: ptr to bearer issuing message
 */
80
static void tipc_disc_init_msg(struct net *net, struct sk_buff *buf, u32 type,
Y
Ying Xue 已提交
81
			       struct tipc_bearer *b_ptr)
P
Per Liden 已提交
82
{
83
	struct tipc_net *tn = net_generic(net, tipc_net_id);
P
Per Liden 已提交
84
	struct tipc_msg *msg;
85
	u32 dest_domain = b_ptr->domain;
P
Per Liden 已提交
86

Y
Ying Xue 已提交
87
	msg = buf_msg(buf);
88
	tipc_msg_init(net, msg, LINK_CONFIG, type, INT_H_SIZE, dest_domain);
Y
Ying Xue 已提交
89
	msg_set_non_seq(msg, 1);
90
	msg_set_node_sig(msg, tn->random);
Y
Ying Xue 已提交
91
	msg_set_dest_domain(msg, dest_domain);
92
	msg_set_bc_netid(msg, tn->net_id);
93
	b_ptr->media->addr2msg(msg_media_addr(msg), &b_ptr->addr);
P
Per Liden 已提交
94 95
}

96 97 98 99 100 101
/**
 * disc_dupl_alert - issue node address duplication alert
 * @b_ptr: pointer to bearer detecting duplication
 * @node_addr: duplicated node address
 * @media_addr: media address advertised by duplicated node
 */
102
static void disc_dupl_alert(struct tipc_bearer *b_ptr, u32 node_addr,
103 104 105 106 107
			    struct tipc_media_addr *media_addr)
{
	char node_addr_str[16];
	char media_addr_str[64];

108
	tipc_addr_string_fill(node_addr_str, node_addr);
109 110
	tipc_media_addr_printf(media_addr_str, sizeof(media_addr_str),
			       media_addr);
111 112
	pr_warn("Duplicate %s using %s seen on <%s>\n", node_addr_str,
		media_addr_str, b_ptr->name);
113 114
}

P
Per Liden 已提交
115
/**
116
 * tipc_disc_rcv - handle incoming discovery message (request or response)
117
 * @net: the applicable net namespace
P
Per Liden 已提交
118
 * @buf: buffer containing message
119
 * @bearer: bearer that message arrived on
P
Per Liden 已提交
120
 */
121 122
void tipc_disc_rcv(struct net *net, struct sk_buff *buf,
		   struct tipc_bearer *bearer)
P
Per Liden 已提交
123
{
124
	struct tipc_net *tn = net_generic(net, tipc_net_id);
125
	struct tipc_node *node;
126
	struct tipc_link *link;
127
	struct tipc_media_addr maddr;
128
	struct sk_buff *rbuf;
P
Per Liden 已提交
129
	struct tipc_msg *msg = buf_msg(buf);
130 131
	u32 ddom = msg_dest_domain(msg);
	u32 onode = msg_prevnode(msg);
P
Per Liden 已提交
132
	u32 net_id = msg_bc_netid(msg);
133
	u32 mtyp = msg_type(msg);
134
	u32 signature = msg_node_sig(msg);
135 136 137 138 139 140
	bool addr_match = false;
	bool sign_match = false;
	bool link_up = false;
	bool accept_addr = false;
	bool accept_sign = false;
	bool respond = false;
P
Per Liden 已提交
141

142
	bearer->media->msg2addr(bearer, &maddr, msg_media_addr(msg));
143
	kfree_skb(buf);
P
Per Liden 已提交
144

145
	/* Ensure message from node is valid and communication is permitted */
146
	if (net_id != tn->net_id)
P
Per Liden 已提交
147
		return;
148
	if (maddr.broadcast)
149
		return;
150
	if (!tipc_addr_domain_valid(ddom))
P
Per Liden 已提交
151
		return;
152
	if (!tipc_addr_node_valid(onode))
P
Per Liden 已提交
153
		return;
154

155
	if (in_own_node(net, onode)) {
156
		if (memcmp(&maddr, &bearer->addr, sizeof(maddr)))
157
			disc_dupl_alert(bearer, tn->own_addr, &maddr);
P
Per Liden 已提交
158
		return;
159
	}
160
	if (!tipc_in_scope(ddom, tn->own_addr))
P
Per Liden 已提交
161
		return;
162
	if (!tipc_in_scope(bearer->domain, onode))
163
		return;
164

165
	node = tipc_node_create(net, onode);
166 167 168 169
	if (!node)
		return;
	tipc_node_lock(node);
	link = node->links[bearer->identity];
170

171
	/* Prepare to validate requesting node's signature and media address */
172 173 174
	sign_match = (signature == node->signature);
	addr_match = link && !memcmp(&link->media_addr, &maddr, sizeof(maddr));
	link_up = link && tipc_link_is_up(link);
175

176

177
	/* These three flags give us eight permutations: */
178

179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232
	if (sign_match && addr_match && link_up) {
		/* All is fine. Do nothing. */
	} else if (sign_match && addr_match && !link_up) {
		/* Respond. The link will come up in due time */
		respond = true;
	} else if (sign_match && !addr_match && link_up) {
		/* Peer has changed i/f address without rebooting.
		 * If so, the link will reset soon, and the next
		 * discovery will be accepted. So we can ignore it.
		 * It may also be an cloned or malicious peer having
		 * chosen the same node address and signature as an
		 * existing one.
		 * Ignore requests until the link goes down, if ever.
		 */
		disc_dupl_alert(bearer, onode, &maddr);
	} else if (sign_match && !addr_match && !link_up) {
		/* Peer link has changed i/f address without rebooting.
		 * It may also be a cloned or malicious peer; we can't
		 * distinguish between the two.
		 * The signature is correct, so we must accept.
		 */
		accept_addr = true;
		respond = true;
	} else if (!sign_match && addr_match && link_up) {
		/* Peer node rebooted. Two possibilities:
		 *  - Delayed re-discovery; this link endpoint has already
		 *    reset and re-established contact with the peer, before
		 *    receiving a discovery message from that node.
		 *    (The peer happened to receive one from this node first).
		 *  - The peer came back so fast that our side has not
		 *    discovered it yet. Probing from this side will soon
		 *    reset the link, since there can be no working link
		 *    endpoint at the peer end, and the link will re-establish.
		 *  Accept the signature, since it comes from a known peer.
		 */
		accept_sign = true;
	} else if (!sign_match && addr_match && !link_up) {
		/*  The peer node has rebooted.
		 *  Accept signature, since it is a known peer.
		 */
		accept_sign = true;
		respond = true;
	} else if (!sign_match && !addr_match && link_up) {
		/* Peer rebooted with new address, or a new/duplicate peer.
		 * Ignore until the link goes down, if ever.
		 */
		disc_dupl_alert(bearer, onode, &maddr);
	} else if (!sign_match && !addr_match && !link_up) {
		/* Peer rebooted with new address, or it is a new peer.
		 * Accept signature and address.
		*/
		accept_sign = true;
		accept_addr = true;
		respond = true;
233 234
	}

235 236 237 238 239 240 241 242 243 244 245
	if (accept_sign)
		node->signature = signature;

	if (accept_addr) {
		if (!link)
			link = tipc_link_create(node, bearer, &maddr);
		if (link) {
			memcpy(&link->media_addr, &maddr, sizeof(maddr));
			tipc_link_reset(link);
		} else {
			respond = false;
P
Per Liden 已提交
246
		}
247 248
	}

249 250
	/* Send response, if necessary */
	if (respond && (mtyp == DSC_REQ_MSG)) {
Y
Ying Xue 已提交
251
		rbuf = tipc_buf_acquire(INT_H_SIZE);
252
		if (rbuf) {
253
			tipc_disc_init_msg(net, rbuf, DSC_RESP_MSG, bearer);
254
			tipc_bearer_send(net, bearer->identity, rbuf, &maddr);
255
			kfree_skb(rbuf);
256
		}
P
Per Liden 已提交
257
	}
258
	tipc_node_unlock(node);
P
Per Liden 已提交
259 260 261
}

/**
262
 * disc_update - update frequency of periodic link setup requests
P
Per Liden 已提交
263
 * @req: ptr to link request structure
264 265 266
 *
 * Reinitiates discovery process if discovery object has no associated nodes
 * and is either not currently searching or is searching at a slow rate
P
Per Liden 已提交
267
 */
268
static void disc_update(struct tipc_link_req *req)
P
Per Liden 已提交
269
{
270 271 272 273
	if (!req->num_nodes) {
		if ((req->timer_intv == TIPC_LINK_REQ_INACTIVE) ||
		    (req->timer_intv > TIPC_LINK_REQ_FAST)) {
			req->timer_intv = TIPC_LINK_REQ_INIT;
274
			mod_timer(&req->timer, jiffies + req->timer_intv);
P
Per Liden 已提交
275 276
		}
	}
277
}
P
Per Liden 已提交
278

279 280 281 282
/**
 * tipc_disc_add_dest - increment set of discovered nodes
 * @req: ptr to link request structure
 */
283
void tipc_disc_add_dest(struct tipc_link_req *req)
284
{
285
	spin_lock_bh(&req->lock);
286
	req->num_nodes++;
287
	spin_unlock_bh(&req->lock);
288 289 290 291 292 293
}

/**
 * tipc_disc_remove_dest - decrement set of discovered nodes
 * @req: ptr to link request structure
 */
294
void tipc_disc_remove_dest(struct tipc_link_req *req)
295
{
296
	spin_lock_bh(&req->lock);
297 298
	req->num_nodes--;
	disc_update(req);
299
	spin_unlock_bh(&req->lock);
300 301
}

P
Per Liden 已提交
302 303
/**
 * disc_timeout - send a periodic link setup request
304
 * @data: ptr to link request structure
305
 *
P
Per Liden 已提交
306 307
 * Called whenever a link setup request timer associated with a bearer expires.
 */
308
static void disc_timeout(unsigned long data)
P
Per Liden 已提交
309
{
310
	struct tipc_link_req *req = (struct tipc_link_req *)data;
311 312
	int max_delay;

313
	spin_lock_bh(&req->lock);
P
Per Liden 已提交
314

315
	/* Stop searching if only desired node has been found */
316
	if (tipc_node(req->domain) && req->num_nodes) {
317 318
		req->timer_intv = TIPC_LINK_REQ_INACTIVE;
		goto exit;
P
Per Liden 已提交
319 320
	}

321 322 323 324 325 326 327
	/*
	 * Send discovery message, then update discovery timer
	 *
	 * Keep doubling time between requests until limit is reached;
	 * hold at fast polling rate if don't have any associated nodes,
	 * otherwise hold at slow polling rate
	 */
328
	tipc_bearer_send(req->net, req->bearer_id, req->buf, &req->dest);
329

330 331 332 333 334 335 336 337 338

	req->timer_intv *= 2;
	if (req->num_nodes)
		max_delay = TIPC_LINK_REQ_SLOW;
	else
		max_delay = TIPC_LINK_REQ_FAST;
	if (req->timer_intv > max_delay)
		req->timer_intv = max_delay;

339
	mod_timer(&req->timer, jiffies + req->timer_intv);
340
exit:
341
	spin_unlock_bh(&req->lock);
P
Per Liden 已提交
342 343 344
}

/**
345
 * tipc_disc_create - create object to send periodic link setup requests
346
 * @net: the applicable net namespace
P
Per Liden 已提交
347 348
 * @b_ptr: ptr to bearer issuing requests
 * @dest: destination address for request messages
349
 * @dest_domain: network domain to which links can be established
350
 *
351
 * Returns 0 if successful, otherwise -errno.
P
Per Liden 已提交
352
 */
353 354
int tipc_disc_create(struct net *net, struct tipc_bearer *b_ptr,
		     struct tipc_media_addr *dest)
P
Per Liden 已提交
355
{
356
	struct tipc_link_req *req;
P
Per Liden 已提交
357

358
	req = kmalloc(sizeof(*req), GFP_ATOMIC);
P
Per Liden 已提交
359
	if (!req)
360
		return -ENOMEM;
P
Per Liden 已提交
361

Y
Ying Xue 已提交
362
	req->buf = tipc_buf_acquire(INT_H_SIZE);
Y
Ying Xue 已提交
363 364
	if (!req->buf) {
		kfree(req);
Y
Ying Xue 已提交
365
		return -ENOMEM;
Y
Ying Xue 已提交
366
	}
P
Per Liden 已提交
367

368
	tipc_disc_init_msg(net, req->buf, DSC_REQ_MSG, b_ptr);
P
Per Liden 已提交
369
	memcpy(&req->dest, dest, sizeof(*dest));
370
	req->net = net;
371 372
	req->bearer_id = b_ptr->identity;
	req->domain = b_ptr->domain;
373
	req->num_nodes = 0;
P
Per Liden 已提交
374
	req->timer_intv = TIPC_LINK_REQ_INIT;
375
	spin_lock_init(&req->lock);
376 377
	setup_timer(&req->timer, disc_timeout, (unsigned long)req);
	mod_timer(&req->timer, jiffies + req->timer_intv);
378
	b_ptr->link_req = req;
379
	tipc_bearer_send(net, req->bearer_id, req->buf, &req->dest);
380 381 382 383 384 385 386
	return 0;
}

/**
 * tipc_disc_delete - destroy object sending periodic link setup requests
 * @req: ptr to link request structure
 */
387
void tipc_disc_delete(struct tipc_link_req *req)
388
{
389
	del_timer_sync(&req->timer);
390
	kfree_skb(req->buf);
391
	kfree(req);
392
}
Y
Ying Xue 已提交
393 394 395

/**
 * tipc_disc_reset - reset object to send periodic link setup requests
396
 * @net: the applicable net namespace
Y
Ying Xue 已提交
397 398 399
 * @b_ptr: ptr to bearer issuing requests
 * @dest_domain: network domain to which links can be established
 */
400
void tipc_disc_reset(struct net *net, struct tipc_bearer *b_ptr)
Y
Ying Xue 已提交
401 402 403 404
{
	struct tipc_link_req *req = b_ptr->link_req;

	spin_lock_bh(&req->lock);
405
	tipc_disc_init_msg(net, req->buf, DSC_REQ_MSG, b_ptr);
406
	req->net = net;
Y
Ying Xue 已提交
407 408 409 410
	req->bearer_id = b_ptr->identity;
	req->domain = b_ptr->domain;
	req->num_nodes = 0;
	req->timer_intv = TIPC_LINK_REQ_INIT;
411
	mod_timer(&req->timer, jiffies + req->timer_intv);
412
	tipc_bearer_send(net, req->bearer_id, req->buf, &req->dest);
Y
Ying Xue 已提交
413 414
	spin_unlock_bh(&req->lock);
}