name_distr.c 11.6 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/name_distr.c: TIPC name distribution code
3
 *
4
 * Copyright (c) 2000-2006, 2014, Ericsson AB
5
 * Copyright (c) 2005, 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 "name_distr.h"

41 42 43 44 45 46 47 48 49 50 51 52 53 54 55
int sysctl_tipc_named_timeout __read_mostly = 2000;

/**
 * struct tipc_dist_queue - queue holding deferred name table updates
 */
static struct list_head tipc_dist_queue = LIST_HEAD_INIT(tipc_dist_queue);

struct distr_queue_item {
	struct distr_item i;
	u32 dtype;
	u32 node;
	unsigned long expires;
	struct list_head next;
};

P
Per Liden 已提交
56 57 58 59 60 61 62 63 64 65 66 67 68 69 70
/**
 * publ_to_item - add publication info to a publication message
 */
static void publ_to_item(struct distr_item *i, struct publication *p)
{
	i->type = htonl(p->type);
	i->lower = htonl(p->lower);
	i->upper = htonl(p->upper);
	i->ref = htonl(p->ref);
	i->key = htonl(p->key);
}

/**
 * named_prepare_buf - allocate & initialize a publication message
 */
71 72
static struct sk_buff *named_prepare_buf(struct net *net, u32 type, u32 size,
					 u32 dest)
P
Per Liden 已提交
73
{
74
	struct tipc_net *tn = net_generic(net, tipc_net_id);
75
	struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE + size);
P
Per Liden 已提交
76 77 78 79
	struct tipc_msg *msg;

	if (buf != NULL) {
		msg = buf_msg(buf);
80 81
		tipc_msg_init(tn->own_addr, msg, NAME_DISTRIBUTOR, type,
			      INT_H_SIZE, dest);
82
		msg_set_size(msg, INT_H_SIZE + size);
P
Per Liden 已提交
83 84 85 86
	}
	return buf;
}

87
void named_cluster_distribute(struct net *net, struct sk_buff *skb)
88
{
89
	struct tipc_net *tn = net_generic(net, tipc_net_id);
90
	struct sk_buff *oskb;
91 92
	struct tipc_node *node;
	u32 dnode;
93

94
	rcu_read_lock();
95
	list_for_each_entry_rcu(node, &tn->node_list, list) {
96
		dnode = node->addr;
97
		if (in_own_node(net, dnode))
98
			continue;
99
		if (!tipc_node_is_up(node))
100
			continue;
101
		oskb = pskb_copy(skb, GFP_ATOMIC);
102
		if (!oskb)
103
			break;
104
		msg_set_destnode(buf_msg(oskb), dnode);
105
		tipc_link_xmit_skb(net, oskb, dnode, dnode);
106
	}
107
	rcu_read_unlock();
108

109
	kfree_skb(skb);
110 111
}

P
Per Liden 已提交
112
/**
113
 * tipc_named_publish - tell other nodes about a new publication by this node
P
Per Liden 已提交
114
 */
115
struct sk_buff *tipc_named_publish(struct net *net, struct publication *publ)
P
Per Liden 已提交
116
{
117
	struct tipc_net *tn = net_generic(net, tipc_net_id);
P
Per Liden 已提交
118 119 120
	struct sk_buff *buf;
	struct distr_item *item;

121
	list_add_tail_rcu(&publ->local_list,
122
			  &tn->nametbl->publ_list[publ->scope]);
P
Per Liden 已提交
123

124
	if (publ->scope == TIPC_NODE_SCOPE)
125
		return NULL;
126

127
	buf = named_prepare_buf(net, PUBLICATION, ITEM_SIZE, 0);
P
Per Liden 已提交
128
	if (!buf) {
129
		pr_warn("Publication distribution failure\n");
130
		return NULL;
P
Per Liden 已提交
131 132 133 134
	}

	item = (struct distr_item *)msg_data(buf_msg(buf));
	publ_to_item(item, publ);
135
	return buf;
P
Per Liden 已提交
136 137 138
}

/**
139
 * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node
P
Per Liden 已提交
140
 */
141
struct sk_buff *tipc_named_withdraw(struct net *net, struct publication *publ)
P
Per Liden 已提交
142 143 144 145 146 147
{
	struct sk_buff *buf;
	struct distr_item *item;

	list_del(&publ->local_list);

148
	if (publ->scope == TIPC_NODE_SCOPE)
149
		return NULL;
150

151
	buf = named_prepare_buf(net, WITHDRAWAL, ITEM_SIZE, 0);
P
Per Liden 已提交
152
	if (!buf) {
153
		pr_warn("Withdrawal distribution failure\n");
154
		return NULL;
P
Per Liden 已提交
155 156 157 158
	}

	item = (struct distr_item *)msg_data(buf_msg(buf));
	publ_to_item(item, publ);
159
	return buf;
P
Per Liden 已提交
160 161
}

162
/**
163
 * named_distribute - prepare name info for bulk distribution to another node
164
 * @list: list of messages (buffers) to be returned from this function
165 166
 * @dnode: node to be updated
 * @pls: linked list of publication items to be packed into buffer chain
167
 */
168 169
static void named_distribute(struct net *net, struct sk_buff_head *list,
			     u32 dnode, struct list_head *pls)
170 171
{
	struct publication *publ;
172
	struct sk_buff *skb = NULL;
173
	struct distr_item *item = NULL;
174 175
	uint msg_dsz = (tipc_node_get_mtu(net, dnode, 0) / ITEM_SIZE) *
			ITEM_SIZE;
176
	uint msg_rem = msg_dsz;
177

178
	list_for_each_entry(publ, pls, local_list) {
179
		/* Prepare next buffer: */
180
		if (!skb) {
181 182
			skb = named_prepare_buf(net, PUBLICATION, msg_rem,
						dnode);
183
			if (!skb) {
184
				pr_warn("Bulk publication failure\n");
185 186
				return;
			}
187
			item = (struct distr_item *)msg_data(buf_msg(skb));
188
		}
189 190

		/* Pack publication into message: */
191 192
		publ_to_item(item, publ);
		item++;
193 194 195 196
		msg_rem -= ITEM_SIZE;

		/* Append full buffer to list: */
		if (!msg_rem) {
197 198
			__skb_queue_tail(list, skb);
			skb = NULL;
199
			msg_rem = msg_dsz;
200 201
		}
	}
202 203 204 205 206
	if (skb) {
		msg_set_size(buf_msg(skb), INT_H_SIZE + (msg_dsz - msg_rem));
		skb_trim(skb, INT_H_SIZE + (msg_dsz - msg_rem));
		__skb_queue_tail(list, skb);
	}
207 208
}

P
Per Liden 已提交
209
/**
210
 * tipc_named_node_up - tell specified node about all publications by this node
P
Per Liden 已提交
211
 */
212
void tipc_named_node_up(struct net *net, u32 dnode)
P
Per Liden 已提交
213
{
214
	struct tipc_net *tn = net_generic(net, tipc_net_id);
215 216 217
	struct sk_buff_head head;

	__skb_queue_head_init(&head);
218

219
	rcu_read_lock();
220
	named_distribute(net, &head, dnode,
221
			 &tn->nametbl->publ_list[TIPC_CLUSTER_SCOPE]);
222
	named_distribute(net, &head, dnode,
223
			 &tn->nametbl->publ_list[TIPC_ZONE_SCOPE]);
224
	rcu_read_unlock();
225

226
	tipc_link_xmit(net, &head, dnode, dnode);
P
Per Liden 已提交
227 228
}

229 230
static void tipc_publ_subscribe(struct net *net, struct publication *publ,
				u32 addr)
231 232 233
{
	struct tipc_node *node;

234
	if (in_own_node(net, addr))
235 236
		return;

237
	node = tipc_node_find(net, addr);
238 239 240 241 242 243 244 245 246
	if (!node) {
		pr_warn("Node subscription rejected, unknown node 0x%x\n",
			addr);
		return;
	}

	tipc_node_lock(node);
	list_add_tail(&publ->nodesub_list, &node->publ_list);
	tipc_node_unlock(node);
247
	tipc_node_put(node);
248 249
}

250 251
static void tipc_publ_unsubscribe(struct net *net, struct publication *publ,
				  u32 addr)
252 253 254
{
	struct tipc_node *node;

255
	node = tipc_node_find(net, addr);
256 257 258 259 260 261
	if (!node)
		return;

	tipc_node_lock(node);
	list_del_init(&publ->nodesub_list);
	tipc_node_unlock(node);
262
	tipc_node_put(node);
263 264
}

P
Per Liden 已提交
265
/**
266
 * tipc_publ_purge - remove publication associated with a failed node
267 268
 *
 * Invoked for each publication issued by a newly failed node.
P
Per Liden 已提交
269 270
 * Removes publication structure from name table & deletes it.
 */
271
static void tipc_publ_purge(struct net *net, struct publication *publ, u32 addr)
P
Per Liden 已提交
272
{
273
	struct tipc_net *tn = net_generic(net, tipc_net_id);
P
Per Liden 已提交
274
	struct publication *p;
275

276 277
	spin_lock_bh(&tn->nametbl_lock);
	p = tipc_nametbl_remove_publ(net, publ->type, publ->lower,
278
				     publ->node, publ->ref, publ->key);
279
	if (p)
280
		tipc_publ_unsubscribe(net, p, addr);
281
	spin_unlock_bh(&tn->nametbl_lock);
282

283
	if (p != publ) {
284 285 286 287
		pr_err("Unable to remove publication from failed node\n"
		       " (type=%u, lower=%u, node=0x%x, ref=%u, key=%u)\n",
		       publ->type, publ->lower, publ->node, publ->ref,
		       publ->key);
288 289
	}

290
	kfree_rcu(p, rcu);
P
Per Liden 已提交
291 292
}

293
void tipc_publ_notify(struct net *net, struct list_head *nsub_list, u32 addr)
294 295 296 297
{
	struct publication *publ, *tmp;

	list_for_each_entry_safe(publ, tmp, nsub_list, nodesub_list)
298
		tipc_publ_purge(net, publ, addr);
299 300
}

301 302 303 304 305 306 307
/**
 * tipc_update_nametbl - try to process a nametable update and notify
 *			 subscribers
 *
 * tipc_nametbl_lock must be held.
 * Returns the publication item if successful, otherwise NULL.
 */
308 309
static bool tipc_update_nametbl(struct net *net, struct distr_item *i,
				u32 node, u32 dtype)
310 311 312 313
{
	struct publication *publ = NULL;

	if (dtype == PUBLICATION) {
314 315
		publ = tipc_nametbl_insert_publ(net, ntohl(i->type),
						ntohl(i->lower),
316 317 318 319
						ntohl(i->upper),
						TIPC_CLUSTER_SCOPE, node,
						ntohl(i->ref), ntohl(i->key));
		if (publ) {
320
			tipc_publ_subscribe(net, publ, node);
E
Erik Hugne 已提交
321
			return true;
322 323
		}
	} else if (dtype == WITHDRAWAL) {
324 325
		publ = tipc_nametbl_remove_publ(net, ntohl(i->type),
						ntohl(i->lower),
326 327 328
						node, ntohl(i->ref),
						ntohl(i->key));
		if (publ) {
329
			tipc_publ_unsubscribe(net, publ, node);
330
			kfree_rcu(publ, rcu);
E
Erik Hugne 已提交
331
			return true;
332 333 334 335
		}
	} else {
		pr_warn("Unrecognized name table message received\n");
	}
E
Erik Hugne 已提交
336
	return false;
337 338
}

339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361
/**
 * tipc_named_add_backlog - add a failed name table update to the backlog
 *
 */
static void tipc_named_add_backlog(struct distr_item *i, u32 type, u32 node)
{
	struct distr_queue_item *e;
	unsigned long now = get_jiffies_64();

	e = kzalloc(sizeof(*e), GFP_ATOMIC);
	if (!e)
		return;
	e->dtype = type;
	e->node = node;
	e->expires = now + msecs_to_jiffies(sysctl_tipc_named_timeout);
	memcpy(e, i, sizeof(*i));
	list_add_tail(&e->next, &tipc_dist_queue);
}

/**
 * tipc_named_process_backlog - try to process any pending name table updates
 * from the network.
 */
362
void tipc_named_process_backlog(struct net *net)
363 364 365 366 367 368 369
{
	struct distr_queue_item *e, *tmp;
	char addr[16];
	unsigned long now = get_jiffies_64();

	list_for_each_entry_safe(e, tmp, &tipc_dist_queue, next) {
		if (time_after(e->expires, now)) {
370
			if (!tipc_update_nametbl(net, &e->i, e->node, e->dtype))
371 372 373 374 375 376 377 378 379 380 381 382 383 384
				continue;
		} else {
			tipc_addr_string_fill(addr, e->node);
			pr_warn_ratelimited("Dropping name table update (%d) of {%u, %u, %u} from %s key=%u\n",
					    e->dtype, ntohl(e->i.type),
					    ntohl(e->i.lower),
					    ntohl(e->i.upper),
					    addr, ntohl(e->i.key));
		}
		list_del(&e->next);
		kfree(e);
	}
}

P
Per Liden 已提交
385
/**
386
 * tipc_named_rcv - process name table update messages sent by another node
P
Per Liden 已提交
387
 */
388
void tipc_named_rcv(struct net *net, struct sk_buff_head *inputq)
P
Per Liden 已提交
389
{
390
	struct tipc_net *tn = net_generic(net, tipc_net_id);
391 392 393 394 395 396
	struct tipc_msg *msg;
	struct distr_item *item;
	uint count;
	u32 node;
	struct sk_buff *skb;
	int mtype;
P
Per Liden 已提交
397

398
	spin_lock_bh(&tn->nametbl_lock);
399 400 401 402 403 404 405 406 407 408 409 410 411
	for (skb = skb_dequeue(inputq); skb; skb = skb_dequeue(inputq)) {
		msg = buf_msg(skb);
		mtype = msg_type(msg);
		item = (struct distr_item *)msg_data(msg);
		count = msg_data_sz(msg) / ITEM_SIZE;
		node = msg_orignode(msg);
		while (count--) {
			if (!tipc_update_nametbl(net, item, node, mtype))
				tipc_named_add_backlog(item, mtype, node);
			item++;
		}
		kfree_skb(skb);
		tipc_named_process_backlog(net);
P
Per Liden 已提交
412
	}
413
	spin_unlock_bh(&tn->nametbl_lock);
P
Per Liden 已提交
414 415 416
}

/**
417
 * tipc_named_reinit - re-initialize local publications
418
 *
419
 * This routine is called whenever TIPC networking is enabled.
420 421
 * All name table entries published by this node are updated to reflect
 * the node's new network address.
P
Per Liden 已提交
422
 */
423
void tipc_named_reinit(struct net *net)
P
Per Liden 已提交
424
{
425
	struct tipc_net *tn = net_generic(net, tipc_net_id);
P
Per Liden 已提交
426
	struct publication *publ;
427
	int scope;
P
Per Liden 已提交
428

429
	spin_lock_bh(&tn->nametbl_lock);
430

431
	for (scope = TIPC_ZONE_SCOPE; scope <= TIPC_NODE_SCOPE; scope++)
432
		list_for_each_entry_rcu(publ, &tn->nametbl->publ_list[scope],
433
					local_list)
434
			publ->node = tn->own_addr;
435

436
	spin_unlock_bh(&tn->nametbl_lock);
P
Per Liden 已提交
437
}