name_distr.c 11.4 KB
Newer Older
Per Liden's avatar
Per Liden committed
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
Per Liden's avatar
Per Liden committed
6
7
 * All rights reserved.
 *
Per Liden's avatar
Per Liden committed
8
 * Redistribution and use in source and binary forms, with or without
Per Liden's avatar
Per Liden committed
9
10
 * modification, are permitted provided that the following conditions are met:
 *
Per Liden's avatar
Per Liden committed
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.
Per Liden's avatar
Per Liden committed
19
 *
Per Liden's avatar
Per Liden committed
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
Per Liden's avatar
Per Liden committed
34
35
36
37
38
39
40
41
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "core.h"
#include "link.h"
#include "name_distr.h"

/**
42
43
44
 * struct publ_list - list of publications made by this node
 * @list: circular list of publications
 * @list_size: number of entries in list
Per Liden's avatar
Per Liden committed
45
 */
46
47
48
49
struct publ_list {
	struct list_head list;
	u32 size;
};
Per Liden's avatar
Per Liden committed
50

51
52
53
54
55
static struct publ_list publ_zone = {
	.list = LIST_HEAD_INIT(publ_zone.list),
	.size = 0,
};

56
57
58
59
static struct publ_list publ_cluster = {
	.list = LIST_HEAD_INIT(publ_cluster.list),
	.size = 0,
};
Per Liden's avatar
Per Liden committed
60

61
62
63
64
65
66
67
68
69
70
71
72
73
static struct publ_list publ_node = {
	.list = LIST_HEAD_INIT(publ_node.list),
	.size = 0,
};

static struct publ_list *publ_lists[] = {
	NULL,
	&publ_zone,	/* publ_lists[TIPC_ZONE_SCOPE]		*/
	&publ_cluster,	/* publ_lists[TIPC_CLUSTER_SCOPE]	*/
	&publ_node	/* publ_lists[TIPC_NODE_SCOPE]		*/
};


74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
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;
};

Per Liden's avatar
Per Liden committed
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
/**
 * 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
 */
static struct sk_buff *named_prepare_buf(u32 type, u32 size, u32 dest)
{
106
	struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE + size);
Per Liden's avatar
Per Liden committed
107
108
109
110
	struct tipc_msg *msg;

	if (buf != NULL) {
		msg = buf_msg(buf);
111
112
		tipc_msg_init(msg, NAME_DISTRIBUTOR, type, INT_H_SIZE, dest);
		msg_set_size(msg, INT_H_SIZE + size);
Per Liden's avatar
Per Liden committed
113
114
115
116
	}
	return buf;
}

117
void named_cluster_distribute(struct sk_buff *buf)
118
{
119
120
121
	struct sk_buff *obuf;
	struct tipc_node *node;
	u32 dnode;
122

123
	rcu_read_lock();
124
125
126
127
128
129
130
131
132
133
	list_for_each_entry_rcu(node, &tipc_node_list, list) {
		dnode = node->addr;
		if (in_own_node(dnode))
			continue;
		if (!tipc_node_active_links(node))
			continue;
		obuf = skb_copy(buf, GFP_ATOMIC);
		if (!obuf)
			break;
		msg_set_destnode(buf_msg(obuf), dnode);
134
		tipc_link_xmit(obuf, dnode, dnode);
135
	}
136
	rcu_read_unlock();
137

138
	kfree_skb(buf);
139
140
}

Per Liden's avatar
Per Liden committed
141
/**
142
 * tipc_named_publish - tell other nodes about a new publication by this node
Per Liden's avatar
Per Liden committed
143
 */
144
struct sk_buff *tipc_named_publish(struct publication *publ)
Per Liden's avatar
Per Liden committed
145
146
147
148
{
	struct sk_buff *buf;
	struct distr_item *item;

149
150
	list_add_tail(&publ->local_list, &publ_lists[publ->scope]->list);
	publ_lists[publ->scope]->size++;
Per Liden's avatar
Per Liden committed
151

152
	if (publ->scope == TIPC_NODE_SCOPE)
153
		return NULL;
154

Per Liden's avatar
Per Liden committed
155
156
	buf = named_prepare_buf(PUBLICATION, ITEM_SIZE, 0);
	if (!buf) {
157
		pr_warn("Publication distribution failure\n");
158
		return NULL;
Per Liden's avatar
Per Liden committed
159
160
161
162
	}

	item = (struct distr_item *)msg_data(buf_msg(buf));
	publ_to_item(item, publ);
163
	return buf;
Per Liden's avatar
Per Liden committed
164
165
166
}

/**
167
 * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node
Per Liden's avatar
Per Liden committed
168
 */
169
struct sk_buff *tipc_named_withdraw(struct publication *publ)
Per Liden's avatar
Per Liden committed
170
171
172
173
174
{
	struct sk_buff *buf;
	struct distr_item *item;

	list_del(&publ->local_list);
175
	publ_lists[publ->scope]->size--;
Per Liden's avatar
Per Liden committed
176

177
	if (publ->scope == TIPC_NODE_SCOPE)
178
		return NULL;
179

Per Liden's avatar
Per Liden committed
180
181
	buf = named_prepare_buf(WITHDRAWAL, ITEM_SIZE, 0);
	if (!buf) {
182
		pr_warn("Withdrawal distribution failure\n");
183
		return NULL;
Per Liden's avatar
Per Liden committed
184
185
186
187
	}

	item = (struct distr_item *)msg_data(buf_msg(buf));
	publ_to_item(item, publ);
188
	return buf;
Per Liden's avatar
Per Liden committed
189
190
}

191
/**
192
 * named_distribute - prepare name info for bulk distribution to another node
193
194
195
 * @msg_list: list of messages (buffers) to be returned from this function
 * @dnode: node to be updated
 * @pls: linked list of publication items to be packed into buffer chain
196
 */
197
198
static void named_distribute(struct list_head *msg_list, u32 dnode,
			     struct publ_list *pls)
199
200
201
202
{
	struct publication *publ;
	struct sk_buff *buf = NULL;
	struct distr_item *item = NULL;
203
204
205
206
	uint dsz = pls->size * ITEM_SIZE;
	uint msg_dsz = (tipc_node_get_mtu(dnode, 0) / ITEM_SIZE) * ITEM_SIZE;
	uint rem = dsz;
	uint msg_rem = 0;
207
208

	list_for_each_entry(publ, &pls->list, local_list) {
209
		/* Prepare next buffer: */
210
		if (!buf) {
211
212
213
			msg_rem = min_t(uint, rem, msg_dsz);
			rem -= msg_rem;
			buf = named_prepare_buf(PUBLICATION, msg_rem, dnode);
214
			if (!buf) {
215
				pr_warn("Bulk publication failure\n");
216
217
218
219
				return;
			}
			item = (struct distr_item *)msg_data(buf_msg(buf));
		}
220
221

		/* Pack publication into message: */
222
223
		publ_to_item(item, publ);
		item++;
224
225
226
227
228
		msg_rem -= ITEM_SIZE;

		/* Append full buffer to list: */
		if (!msg_rem) {
			list_add_tail((struct list_head *)buf, msg_list);
229
230
231
232
233
			buf = NULL;
		}
	}
}

Per Liden's avatar
Per Liden committed
234
/**
235
 * tipc_named_node_up - tell specified node about all publications by this node
Per Liden's avatar
Per Liden committed
236
 */
237
void tipc_named_node_up(u32 dnode)
Per Liden's avatar
Per Liden committed
238
{
239
240
	LIST_HEAD(msg_list);
	struct sk_buff *buf_chain;
241

242
	read_lock_bh(&tipc_nametbl_lock);
243
244
	named_distribute(&msg_list, dnode, &publ_cluster);
	named_distribute(&msg_list, dnode, &publ_zone);
245
	read_unlock_bh(&tipc_nametbl_lock);
246

247
248
249
	/* Convert circular list to linear list and send: */
	buf_chain = (struct sk_buff *)msg_list.next;
	((struct sk_buff *)msg_list.prev)->next = NULL;
250
	tipc_link_xmit(buf_chain, dnode, dnode);
Per Liden's avatar
Per Liden committed
251
252
}

253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
static void tipc_publ_subscribe(struct publication *publ, u32 addr)
{
	struct tipc_node *node;

	if (in_own_node(addr))
		return;

	node = tipc_node_find(addr);
	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);
}

static void tipc_publ_unsubscribe(struct publication *publ, u32 addr)
{
	struct tipc_node *node;

	node = tipc_node_find(addr);
	if (!node)
		return;

	tipc_node_lock(node);
	list_del_init(&publ->nodesub_list);
	tipc_node_unlock(node);
}

Per Liden's avatar
Per Liden committed
285
/**
286
 * tipc_publ_purge - remove publication associated with a failed node
287
288
 *
 * Invoked for each publication issued by a newly failed node.
Per Liden's avatar
Per Liden committed
289
290
 * Removes publication structure from name table & deletes it.
 */
291
static void tipc_publ_purge(struct publication *publ, u32 addr)
Per Liden's avatar
Per Liden committed
292
293
{
	struct publication *p;
294

295
296
	write_lock_bh(&tipc_nametbl_lock);
	p = tipc_nametbl_remove_publ(publ->type, publ->lower,
297
				     publ->node, publ->ref, publ->key);
298
	if (p)
299
		tipc_publ_unsubscribe(p, addr);
300
	write_unlock_bh(&tipc_nametbl_lock);
301

302
	if (p != publ) {
303
304
305
306
		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);
307
308
	}

309
	kfree(p);
Per Liden's avatar
Per Liden committed
310
311
}

312
313
314
315
316
317
318
319
void tipc_publ_notify(struct list_head *nsub_list, u32 addr)
{
	struct publication *publ, *tmp;

	list_for_each_entry_safe(publ, tmp, nsub_list, nodesub_list)
		tipc_publ_purge(publ, addr);
}

320
321
322
323
324
325
326
/**
 * 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.
 */
Erik Hugne's avatar
Erik Hugne committed
327
static bool tipc_update_nametbl(struct distr_item *i, u32 node, u32 dtype)
328
329
330
331
332
333
334
335
336
{
	struct publication *publ = NULL;

	if (dtype == PUBLICATION) {
		publ = tipc_nametbl_insert_publ(ntohl(i->type), ntohl(i->lower),
						ntohl(i->upper),
						TIPC_CLUSTER_SCOPE, node,
						ntohl(i->ref), ntohl(i->key));
		if (publ) {
337
			tipc_publ_subscribe(publ, node);
Erik Hugne's avatar
Erik Hugne committed
338
			return true;
339
340
341
342
343
344
		}
	} else if (dtype == WITHDRAWAL) {
		publ = tipc_nametbl_remove_publ(ntohl(i->type), ntohl(i->lower),
						node, ntohl(i->ref),
						ntohl(i->key));
		if (publ) {
345
			tipc_publ_unsubscribe(publ, node);
346
			kfree(publ);
Erik Hugne's avatar
Erik Hugne committed
347
			return true;
348
349
350
351
		}
	} else {
		pr_warn("Unrecognized name table message received\n");
	}
Erik Hugne's avatar
Erik Hugne committed
352
	return false;
353
354
}

355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
/**
 * 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.
 */
void tipc_named_process_backlog(void)
{
	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)) {
			if (!tipc_update_nametbl(&e->i, e->node, e->dtype))
				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);
	}
}

Per Liden's avatar
Per Liden committed
401
/**
402
 * tipc_named_rcv - process name table update message sent by another node
Per Liden's avatar
Per Liden committed
403
 */
404
void tipc_named_rcv(struct sk_buff *buf)
Per Liden's avatar
Per Liden committed
405
406
407
408
{
	struct tipc_msg *msg = buf_msg(buf);
	struct distr_item *item = (struct distr_item *)msg_data(msg);
	u32 count = msg_data_sz(msg) / ITEM_SIZE;
409
	u32 node = msg_orignode(msg);
Per Liden's avatar
Per Liden committed
410

411
	write_lock_bh(&tipc_nametbl_lock);
Per Liden's avatar
Per Liden committed
412
	while (count--) {
413
414
		if (!tipc_update_nametbl(item, node, msg_type(msg)))
			tipc_named_add_backlog(item, msg_type(msg), node);
Per Liden's avatar
Per Liden committed
415
416
		item++;
	}
417
	tipc_named_process_backlog();
418
	write_unlock_bh(&tipc_nametbl_lock);
419
	kfree_skb(buf);
Per Liden's avatar
Per Liden committed
420
421
422
}

/**
423
 * tipc_named_reinit - re-initialize local publications
424
 *
425
 * This routine is called whenever TIPC networking is enabled.
426
427
 * All name table entries published by this node are updated to reflect
 * the node's new network address.
Per Liden's avatar
Per Liden committed
428
 */
429
void tipc_named_reinit(void)
Per Liden's avatar
Per Liden committed
430
431
{
	struct publication *publ;
432
	int scope;
Per Liden's avatar
Per Liden committed
433

434
	write_lock_bh(&tipc_nametbl_lock);
435

436
	for (scope = TIPC_ZONE_SCOPE; scope <= TIPC_NODE_SCOPE; scope++)
437
438
		list_for_each_entry(publ, &publ_lists[scope]->list, local_list)
			publ->node = tipc_own_addr;
439

440
	write_unlock_bh(&tipc_nametbl_lock);
Per Liden's avatar
Per Liden committed
441
}