discover.c 12.3 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 41
 * POSSIBILITY OF SUCH DAMAGE.
 */

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

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


/**
48
 * struct tipc_link_req - information about an ongoing link setup request
49
 * @bearer_id: identity of bearer issuing requests
P
Per Liden 已提交
50
 * @dest: destination address for request messages
51
 * @domain: network domain to which links can be established
52
 * @num_nodes: number of nodes currently discovered (i.e. with an active link)
53
 * @lock: spinlock for controlling access to requests
P
Per Liden 已提交
54 55 56 57
 * @buf: request message to be (repeatedly) sent
 * @timer: timer governing period between requests
 * @timer_intv: current interval between requests (in ms)
 */
58
struct tipc_link_req {
59
	u32 bearer_id;
P
Per Liden 已提交
60
	struct tipc_media_addr dest;
61
	u32 domain;
62
	int num_nodes;
63
	spinlock_t lock;
P
Per Liden 已提交
64 65 66 67 68
	struct sk_buff *buf;
	struct timer_list timer;
	unsigned int timer_intv;
};

69
/**
70
 * tipc_disc_init_msg - initialize a link setup message
P
Per Liden 已提交
71 72 73
 * @type: message type (request or response)
 * @b_ptr: ptr to bearer issuing message
 */
Y
Ying Xue 已提交
74 75
static void tipc_disc_init_msg(struct sk_buff *buf, u32 type,
			       struct tipc_bearer *b_ptr)
P
Per Liden 已提交
76 77
{
	struct tipc_msg *msg;
78
	u32 dest_domain = b_ptr->domain;
P
Per Liden 已提交
79

Y
Ying Xue 已提交
80 81 82 83 84 85
	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);
	msg_set_bc_netid(msg, tipc_net_id);
86
	b_ptr->media->addr2msg(msg_media_addr(msg), &b_ptr->addr);
P
Per Liden 已提交
87 88
}

89 90 91 92 93 94
/**
 * 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
 */
95
static void disc_dupl_alert(struct tipc_bearer *b_ptr, u32 node_addr,
96 97 98 99 100
			    struct tipc_media_addr *media_addr)
{
	char node_addr_str[16];
	char media_addr_str[64];

101
	tipc_addr_string_fill(node_addr_str, node_addr);
102 103
	tipc_media_addr_printf(media_addr_str, sizeof(media_addr_str),
			       media_addr);
104 105
	pr_warn("Duplicate %s using %s seen on <%s>\n", node_addr_str,
		media_addr_str, b_ptr->name);
106 107
}

P
Per Liden 已提交
108
/**
109
 * tipc_disc_rcv - handle incoming discovery message (request or response)
P
Per Liden 已提交
110
 * @buf: buffer containing message
111
 * @bearer: bearer that message arrived on
P
Per Liden 已提交
112
 */
113
void tipc_disc_rcv(struct sk_buff *buf, struct tipc_bearer *bearer)
P
Per Liden 已提交
114
{
115
	struct tipc_node *node;
116
	struct tipc_link *link;
117
	struct tipc_media_addr maddr;
118
	struct sk_buff *rbuf;
P
Per Liden 已提交
119
	struct tipc_msg *msg = buf_msg(buf);
120 121
	u32 ddom = msg_dest_domain(msg);
	u32 onode = msg_prevnode(msg);
P
Per Liden 已提交
122
	u32 net_id = msg_bc_netid(msg);
123
	u32 mtyp = msg_type(msg);
124
	u32 signature = msg_node_sig(msg);
125 126 127 128 129 130
	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 已提交
131

132
	bearer->media->msg2addr(bearer, &maddr, msg_media_addr(msg));
133
	kfree_skb(buf);
P
Per Liden 已提交
134

135
	/* Ensure message from node is valid and communication is permitted */
P
Per Liden 已提交
136 137
	if (net_id != tipc_net_id)
		return;
138
	if (maddr.broadcast)
139
		return;
140
	if (!tipc_addr_domain_valid(ddom))
P
Per Liden 已提交
141
		return;
142
	if (!tipc_addr_node_valid(onode))
P
Per Liden 已提交
143
		return;
144 145 146 147

	if (in_own_node(onode)) {
		if (memcmp(&maddr, &bearer->addr, sizeof(maddr)))
			disc_dupl_alert(bearer, tipc_own_addr, &maddr);
P
Per Liden 已提交
148
		return;
149
	}
150
	if (!tipc_in_scope(ddom, tipc_own_addr))
P
Per Liden 已提交
151
		return;
152
	if (!tipc_in_scope(bearer->domain, onode))
153
		return;
154

155 156 157 158 159 160 161 162 163
	/* 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];
164

165
	/* Prepare to validate requesting node's signature and media address */
166 167 168
	sign_match = (signature == node->signature);
	addr_match = link && !memcmp(&link->media_addr, &maddr, sizeof(maddr));
	link_up = link && tipc_link_is_up(link);
169

170

171
	/* These three flags give us eight permutations: */
172

173 174 175 176 177 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
	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;
227 228
	}

229 230 231 232 233 234 235 236 237 238 239
	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 已提交
240
		}
241 242
	}

243 244
	/* Send response, if necessary */
	if (respond && (mtyp == DSC_REQ_MSG)) {
Y
Ying Xue 已提交
245
		rbuf = tipc_buf_acquire(INT_H_SIZE);
246
		if (rbuf) {
247 248
			tipc_disc_init_msg(rbuf, DSC_RESP_MSG, bearer);
			tipc_bearer_send(bearer->identity, rbuf, &maddr);
249
			kfree_skb(rbuf);
250
		}
P
Per Liden 已提交
251
	}
252
	tipc_node_unlock(node);
P
Per Liden 已提交
253 254 255
}

/**
256
 * disc_update - update frequency of periodic link setup requests
P
Per Liden 已提交
257
 * @req: ptr to link request structure
258 259 260
 *
 * 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 已提交
261
 */
262
static void disc_update(struct tipc_link_req *req)
P
Per Liden 已提交
263
{
264 265 266 267
	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;
P
Per Liden 已提交
268 269 270
			k_start_timer(&req->timer, req->timer_intv);
		}
	}
271
}
P
Per Liden 已提交
272

273 274 275 276
/**
 * tipc_disc_add_dest - increment set of discovered nodes
 * @req: ptr to link request structure
 */
277
void tipc_disc_add_dest(struct tipc_link_req *req)
278
{
279
	spin_lock_bh(&req->lock);
280
	req->num_nodes++;
281
	spin_unlock_bh(&req->lock);
282 283 284 285 286 287
}

/**
 * tipc_disc_remove_dest - decrement set of discovered nodes
 * @req: ptr to link request structure
 */
288
void tipc_disc_remove_dest(struct tipc_link_req *req)
289
{
290
	spin_lock_bh(&req->lock);
291 292
	req->num_nodes--;
	disc_update(req);
293
	spin_unlock_bh(&req->lock);
294 295
}

P
Per Liden 已提交
296 297 298
/**
 * disc_timeout - send a periodic link setup request
 * @req: ptr to link request structure
299
 *
P
Per Liden 已提交
300 301
 * Called whenever a link setup request timer associated with a bearer expires.
 */
302
static void disc_timeout(struct tipc_link_req *req)
P
Per Liden 已提交
303
{
304 305
	int max_delay;

306
	spin_lock_bh(&req->lock);
P
Per Liden 已提交
307

308
	/* Stop searching if only desired node has been found */
309
	if (tipc_node(req->domain) && req->num_nodes) {
310 311
		req->timer_intv = TIPC_LINK_REQ_INACTIVE;
		goto exit;
P
Per Liden 已提交
312 313
	}

314 315 316 317 318 319 320
	/*
	 * 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
	 */
321
	tipc_bearer_send(req->bearer_id, req->buf, &req->dest);
322

323 324 325 326 327 328 329 330 331 332 333

	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;

	k_start_timer(&req->timer, req->timer_intv);
exit:
334
	spin_unlock_bh(&req->lock);
P
Per Liden 已提交
335 336 337
}

/**
338
 * tipc_disc_create - create object to send periodic link setup requests
P
Per Liden 已提交
339 340
 * @b_ptr: ptr to bearer issuing requests
 * @dest: destination address for request messages
341
 * @dest_domain: network domain to which links can be established
342
 *
343
 * Returns 0 if successful, otherwise -errno.
P
Per Liden 已提交
344
 */
345
int tipc_disc_create(struct tipc_bearer *b_ptr, struct tipc_media_addr *dest)
P
Per Liden 已提交
346
{
347
	struct tipc_link_req *req;
P
Per Liden 已提交
348

349
	req = kmalloc(sizeof(*req), GFP_ATOMIC);
P
Per Liden 已提交
350
	if (!req)
351
		return -ENOMEM;
P
Per Liden 已提交
352

Y
Ying Xue 已提交
353
	req->buf = tipc_buf_acquire(INT_H_SIZE);
Y
Ying Xue 已提交
354 355
	if (!req->buf) {
		kfree(req);
Y
Ying Xue 已提交
356
		return -ENOMEM;
Y
Ying Xue 已提交
357
	}
P
Per Liden 已提交
358

Y
Ying Xue 已提交
359
	tipc_disc_init_msg(req->buf, DSC_REQ_MSG, b_ptr);
P
Per Liden 已提交
360
	memcpy(&req->dest, dest, sizeof(*dest));
361 362
	req->bearer_id = b_ptr->identity;
	req->domain = b_ptr->domain;
363
	req->num_nodes = 0;
P
Per Liden 已提交
364
	req->timer_intv = TIPC_LINK_REQ_INIT;
365
	spin_lock_init(&req->lock);
P
Per Liden 已提交
366 367
	k_init_timer(&req->timer, (Handler)disc_timeout, (unsigned long)req);
	k_start_timer(&req->timer, req->timer_intv);
368
	b_ptr->link_req = req;
369
	tipc_bearer_send(req->bearer_id, req->buf, &req->dest);
370 371 372 373 374 375 376
	return 0;
}

/**
 * tipc_disc_delete - destroy object sending periodic link setup requests
 * @req: ptr to link request structure
 */
377
void tipc_disc_delete(struct tipc_link_req *req)
378 379 380
{
	k_cancel_timer(&req->timer);
	k_term_timer(&req->timer);
381
	kfree_skb(req->buf);
382
	kfree(req);
383
}
Y
Ying Xue 已提交
384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403

/**
 * tipc_disc_reset - reset object to send periodic link setup requests
 * @b_ptr: ptr to bearer issuing requests
 * @dest_domain: network domain to which links can be established
 */
void tipc_disc_reset(struct tipc_bearer *b_ptr)
{
	struct tipc_link_req *req = b_ptr->link_req;

	spin_lock_bh(&req->lock);
	tipc_disc_init_msg(req->buf, DSC_REQ_MSG, b_ptr);
	req->bearer_id = b_ptr->identity;
	req->domain = b_ptr->domain;
	req->num_nodes = 0;
	req->timer_intv = TIPC_LINK_REQ_INIT;
	k_start_timer(&req->timer, req->timer_intv);
	tipc_bearer_send(req->bearer_id, req->buf, &req->dest);
	spin_unlock_bh(&req->lock);
}