discover.c 12.8 KB
Newer Older
P
Per Liden 已提交
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
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


/**
52
 * struct tipc_link_req - information about an ongoing link setup request
53
 * @bearer_id: identity of bearer issuing requests
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
	u32 domain;
66
	int num_nodes;
67
	spinlock_t lock;
P
Per Liden 已提交
68 69
	struct sk_buff *buf;
	struct timer_list timer;
70
	unsigned long timer_intv;
P
Per Liden 已提交
71 72
};

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

Y
Ying Xue 已提交
86 87 88 89 90
	msg = buf_msg(buf);
	tipc_msg_init(msg, LINK_CONFIG, type, INT_H_SIZE, dest_domain);
	msg_set_non_seq(msg, 1);
	msg_set_node_sig(msg, tipc_random);
	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);
P
Per Liden 已提交
93 94
}

95 96 97 98 99 100
/**
 * 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
 */
101
static void disc_dupl_alert(struct tipc_bearer *b_ptr, u32 node_addr,
102 103 104 105 106
			    struct tipc_media_addr *media_addr)
{
	char node_addr_str[16];
	char media_addr_str[64];

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

P
Per Liden 已提交
114
/**
115
 * tipc_disc_rcv - handle incoming discovery message (request or response)
116
 * @net: the applicable net namespace
P
Per Liden 已提交
117
 * @buf: buffer containing message
118
 * @bearer: bearer that message arrived on
P
Per Liden 已提交
119
 */
120 121
void tipc_disc_rcv(struct net *net, struct sk_buff *buf,
		   struct tipc_bearer *bearer)
P
Per Liden 已提交
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;
P
Per Liden 已提交
128
	struct tipc_msg *msg = buf_msg(buf);
129 130
	u32 ddom = msg_dest_domain(msg);
	u32 onode = msg_prevnode(msg);
P
Per Liden 已提交
131
	u32 net_id = msg_bc_netid(msg);
132
	u32 mtyp = msg_type(msg);
133
	u32 signature = msg_node_sig(msg);
134 135 136 137 138 139
	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 已提交
140

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

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

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

164 165 166 167 168 169 170 171 172
	/* Locate, or if necessary, create, node: */
	node = tipc_node_find(onode);
	if (!node)
		node = tipc_node_create(onode);
	if (!node)
		return;

	tipc_node_lock(node);
	link = node->links[bearer->identity];
173

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

179

180
	/* These three flags give us eight permutations: */
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 233 234 235
	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;
236 237
	}

238 239 240 241 242 243 244 245 246 247 248
	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 已提交
249
		}
250 251
	}

252 253
	/* Send response, if necessary */
	if (respond && (mtyp == DSC_REQ_MSG)) {
Y
Ying Xue 已提交
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
		}
P
Per Liden 已提交
260
	}
261
	tipc_node_unlock(node);
P
Per Liden 已提交
262 263 264
}

/**
265
 * disc_update - update frequency of periodic link setup requests
P
Per Liden 已提交
266
 * @req: ptr to link request structure
267 268 269
 *
 * 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 已提交
270
 */
271
static void disc_update(struct tipc_link_req *req)
P
Per Liden 已提交
272
{
273 274 275 276
	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;
277
			mod_timer(&req->timer, jiffies + req->timer_intv);
P
Per Liden 已提交
278 279
		}
	}
280
}
P
Per Liden 已提交
281

282 283 284 285
/**
 * tipc_disc_add_dest - increment set of discovered nodes
 * @req: ptr to link request structure
 */
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 295 296
}

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

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

316
	spin_lock_bh(&req->lock);
P
Per Liden 已提交
317

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

324 325 326 327 328 329 330
	/*
	 * 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
	 */
331
	tipc_bearer_send(req->bearer_id, req->buf, &req->dest);
332

333 334 335 336 337 338 339 340 341

	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;

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

/**
348
 * tipc_disc_create - create object to send periodic link setup requests
349
 * @net: the applicable net namespace
P
Per Liden 已提交
350 351
 * @b_ptr: ptr to bearer issuing requests
 * @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.
P
Per Liden 已提交
355
 */
356 357
int tipc_disc_create(struct net *net, struct tipc_bearer *b_ptr,
		     struct tipc_media_addr *dest)
P
Per Liden 已提交
358
{
359
	struct tipc_link_req *req;
P
Per Liden 已提交
360

361
	req = kmalloc(sizeof(*req), GFP_ATOMIC);
P
Per Liden 已提交
362
	if (!req)
363
		return -ENOMEM;
P
Per Liden 已提交
364

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

371
	tipc_disc_init_msg(net, req->buf, DSC_REQ_MSG, b_ptr);
P
Per Liden 已提交
372
	memcpy(&req->dest, dest, sizeof(*dest));
373 374
	req->bearer_id = b_ptr->identity;
	req->domain = b_ptr->domain;
375
	req->num_nodes = 0;
P
Per Liden 已提交
376
	req->timer_intv = TIPC_LINK_REQ_INIT;
377
	spin_lock_init(&req->lock);
378 379
	setup_timer(&req->timer, disc_timeout, (unsigned long)req);
	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 383 384 385 386 387 388
	return 0;
}

/**
 * tipc_disc_delete - destroy object sending periodic link setup requests
 * @req: ptr to link request structure
 */
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
}
Y
Ying Xue 已提交
395 396 397

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

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