discover.c 11.4 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/discover.c
3
 *
P
Per Liden 已提交
4
 * Copyright (c) 2003-2006, 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
P
Per Liden 已提交
49 50
 * @bearer: bearer issuing requests
 * @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
	struct tipc_bearer *bearer;
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 74
 * @type: message type (request or response)
 * @dest_domain: network domain of node(s) which should respond to message
 * @b_ptr: ptr to bearer issuing message
 */
75
static struct sk_buff *tipc_disc_init_msg(u32 type, u32 dest_domain,
76
					  struct tipc_bearer *b_ptr)
P
Per Liden 已提交
77
{
78
	struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE);
P
Per Liden 已提交
79 80 81 82
	struct tipc_msg *msg;

	if (buf) {
		msg = buf_msg(buf);
83
		tipc_msg_init(msg, LINK_CONFIG, type, INT_H_SIZE, dest_domain);
84
		msg_set_non_seq(msg, 1);
85
		msg_set_node_sig(msg, tipc_random);
P
Per Liden 已提交
86 87
		msg_set_dest_domain(msg, dest_domain);
		msg_set_bc_netid(msg, tipc_net_id);
88
		b_ptr->media->addr2msg(&b_ptr->addr, msg_media_addr(msg));
P
Per Liden 已提交
89 90 91 92
	}
	return buf;
}

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

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

P
Per Liden 已提交
112
/**
113
 * tipc_disc_recv_msg - handle incoming link setup message (request or response)
P
Per Liden 已提交
114
 * @buf: buffer containing message
115
 * @b_ptr: bearer that message arrived on
P
Per Liden 已提交
116
 */
117
void tipc_disc_recv_msg(struct sk_buff *buf, struct tipc_bearer *b_ptr)
P
Per Liden 已提交
118
{
119
	struct tipc_node *n_ptr;
120
	struct tipc_link *link;
121
	struct tipc_media_addr media_addr;
122
	struct sk_buff *rbuf;
P
Per Liden 已提交
123 124 125 126 127
	struct tipc_msg *msg = buf_msg(buf);
	u32 dest = msg_dest_domain(msg);
	u32 orig = msg_prevnode(msg);
	u32 net_id = msg_bc_netid(msg);
	u32 type = msg_type(msg);
128
	u32 signature = msg_node_sig(msg);
129
	int addr_mismatch;
130
	int link_fully_up;
P
Per Liden 已提交
131

132
	media_addr.broadcast = 1;
133
	b_ptr->media->msg2addr(b_ptr, &media_addr, msg_media_addr(msg));
134
	kfree_skb(buf);
P
Per Liden 已提交
135

136
	/* Ensure message from node is valid and communication is permitted */
P
Per Liden 已提交
137 138
	if (net_id != tipc_net_id)
		return;
139 140
	if (media_addr.broadcast)
		return;
141
	if (!tipc_addr_domain_valid(dest))
P
Per Liden 已提交
142
		return;
143
	if (!tipc_addr_node_valid(orig))
P
Per Liden 已提交
144
		return;
145
	if (orig == tipc_own_addr) {
146
		if (memcmp(&media_addr, &b_ptr->addr, sizeof(media_addr)))
147
			disc_dupl_alert(b_ptr, tipc_own_addr, &media_addr);
P
Per Liden 已提交
148
		return;
149
	}
150
	if (!tipc_in_scope(dest, tipc_own_addr))
P
Per Liden 已提交
151
		return;
152
	if (!tipc_in_scope(b_ptr->link_req->domain, orig))
153
		return;
154

155 156 157 158 159
	/* Locate structure corresponding to requesting node */
	n_ptr = tipc_node_find(orig);
	if (!n_ptr) {
		n_ptr = tipc_node_create(orig);
		if (!n_ptr)
160
			return;
161 162 163
	}
	tipc_node_lock(n_ptr);

164
	/* Prepare to validate requesting node's signature and media address */
165
	link = n_ptr->links[b_ptr->identity];
166 167
	addr_mismatch = (link != NULL) &&
		memcmp(&link->media_addr, &media_addr, sizeof(media_addr));
168

169 170 171 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
	/*
	 * Ensure discovery message's signature is correct
	 *
	 * If signature is incorrect and there is no working link to the node,
	 * accept the new signature but invalidate all existing links to the
	 * node so they won't re-activate without a new discovery message.
	 *
	 * If signature is incorrect and the requested link to the node is
	 * working, accept the new signature. (This is an instance of delayed
	 * rediscovery, where a link endpoint was able to re-establish contact
	 * with its peer endpoint on a node that rebooted before receiving a
	 * discovery message from that node.)
	 *
	 * If signature is incorrect and there is a working link to the node
	 * that is not the requested link, reject the request (must be from
	 * a duplicate node).
	 */
	if (signature != n_ptr->signature) {
		if (n_ptr->working_links == 0) {
			struct tipc_link *curr_link;
			int i;

			for (i = 0; i < MAX_BEARERS; i++) {
				curr_link = n_ptr->links[i];
				if (curr_link) {
					memset(&curr_link->media_addr, 0,
					       sizeof(media_addr));
					tipc_link_reset(curr_link);
				}
			}
			addr_mismatch = (link != NULL);
		} else if (tipc_link_is_up(link) && !addr_mismatch) {
			/* delayed rediscovery */
		} else {
			disc_dupl_alert(b_ptr, orig, &media_addr);
204 205
			tipc_node_unlock(n_ptr);
			return;
P
Per Liden 已提交
206
		}
207
		n_ptr->signature = signature;
208 209 210 211 212 213 214 215 216 217 218 219
	}

	/*
	 * Ensure requesting node's media address is correct
	 *
	 * If media address doesn't match and the link is working, reject the
	 * request (must be from a duplicate node).
	 *
	 * If media address doesn't match and the link is not working, accept
	 * the new media address and reset the link to ensure it starts up
	 * cleanly.
	 */
220 221
	if (addr_mismatch) {
		if (tipc_link_is_up(link)) {
222 223
			disc_dupl_alert(b_ptr, orig, &media_addr);
			tipc_node_unlock(n_ptr);
P
Per Liden 已提交
224
			return;
225 226 227 228 229 230 231 232 233 234 235 236 237
		} else {
			memcpy(&link->media_addr, &media_addr,
			       sizeof(media_addr));
			tipc_link_reset(link);
		}
	}

	/* Create a link endpoint for this bearer, if necessary */
	if (!link) {
		link = tipc_link_create(n_ptr, b_ptr, &media_addr);
		if (!link) {
			tipc_node_unlock(n_ptr);
			return;
P
Per Liden 已提交
238
		}
239 240 241 242
	}

	/* Accept discovery message & send response, if necessary */
	link_fully_up = link_working_working(link);
243

244
	if ((type == DSC_REQ_MSG) && !link_fully_up) {
245 246
		rbuf = tipc_disc_init_msg(DSC_RESP_MSG, orig, b_ptr);
		if (rbuf) {
247
			tipc_bearer_send(b_ptr, rbuf, &media_addr);
248
			kfree_skb(rbuf);
249
		}
P
Per Liden 已提交
250
	}
251 252

	tipc_node_unlock(n_ptr);
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 309 310 311
	/* Stop searching if only desired node has been found */
	if (tipc_node(req->domain) && req->num_nodes) {
		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 322
	tipc_bearer_send(req->bearer, req->buf, &req->dest);

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 346
int tipc_disc_create(struct tipc_bearer *b_ptr, struct tipc_media_addr *dest,
		     u32 dest_domain)
P
Per Liden 已提交
347
{
348
	struct tipc_link_req *req;
P
Per Liden 已提交
349

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

354
	req->buf = tipc_disc_init_msg(DSC_REQ_MSG, dest_domain, b_ptr);
P
Per Liden 已提交
355 356
	if (!req->buf) {
		kfree(req);
357
		return -ENOMSG;
P
Per Liden 已提交
358 359 360 361
	}

	memcpy(&req->dest, dest, sizeof(*dest));
	req->bearer = b_ptr;
362
	req->domain = dest_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, 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
}