name_distr.c 10.3 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, 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
42
43
44
45
46
47
48
49
 * POSSIBILITY OF SUCH DAMAGE.
 */

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

#define ITEM_SIZE sizeof(struct distr_item)

/**
 * struct distr_item - publication info distributed to other nodes
 * @type: name sequence type
 * @lower: name sequence lower bound
 * @upper: name sequence upper bound
 * @ref: publishing port reference
 * @key: publication key
50
 *
Per Liden's avatar
Per Liden committed
51
 * ===> All fields are stored in network byte order. <===
52
 *
Per Liden's avatar
Per Liden committed
53
54
55
56
 * First 3 fields identify (name or) name sequence being published.
 * Reference field uniquely identifies port that published name sequence.
 * Key field uniquely identifies publication, in the event a port has
 * multiple publications of the same name sequence.
57
58
 *
 * Note: There is no field that identifies the publishing node because it is
Per Liden's avatar
Per Liden committed
59
60
61
 * the same for all items contained within a publication message.
 */
struct distr_item {
Al Viro's avatar
Al Viro committed
62
63
64
65
66
	__be32 type;
	__be32 lower;
	__be32 upper;
	__be32 ref;
	__be32 key;
Per Liden's avatar
Per Liden committed
67
68
69
};

/**
70
71
72
 * 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
73
 */
74
75
76
77
struct publ_list {
	struct list_head list;
	u32 size;
};
Per Liden's avatar
Per Liden committed
78

79
80
81
82
83
static struct publ_list publ_zone = {
	.list = LIST_HEAD_INIT(publ_zone.list),
	.size = 0,
};

84
85
86
87
static struct publ_list publ_cluster = {
	.list = LIST_HEAD_INIT(publ_cluster.list),
	.size = 0,
};
Per Liden's avatar
Per Liden committed
88

89
90
91
92
93
94
95
96
97
98
99
100
101
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]		*/
};


Per Liden's avatar
Per Liden committed
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
/**
 * 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)
{
119
	struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE + size);
Per Liden's avatar
Per Liden committed
120
121
122
123
	struct tipc_msg *msg;

	if (buf != NULL) {
		msg = buf_msg(buf);
124
125
		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
126
127
128
129
	}
	return buf;
}

130
131
132
133
static void named_cluster_distribute(struct sk_buff *buf)
{
	struct sk_buff *buf_copy;
	struct tipc_node *n_ptr;
134
	struct tipc_link *l_ptr;
135

136
	read_lock_bh(&tipc_net_lock);
137
	list_for_each_entry(n_ptr, &tipc_node_list, list) {
138
139
140
		spin_lock_bh(&n_ptr->lock);
		l_ptr = n_ptr->active_links[n_ptr->addr & 1];
		if (l_ptr) {
141
			buf_copy = skb_copy(buf, GFP_ATOMIC);
142
143
			if (!buf_copy) {
				spin_unlock_bh(&n_ptr->lock);
144
				break;
145
			}
146
			msg_set_destnode(buf_msg(buf_copy), n_ptr->addr);
147
			__tipc_link_xmit(l_ptr, buf_copy);
148
		}
149
		spin_unlock_bh(&n_ptr->lock);
150
	}
151
	read_unlock_bh(&tipc_net_lock);
152

153
	kfree_skb(buf);
154
155
}

Per Liden's avatar
Per Liden committed
156
/**
157
 * tipc_named_publish - tell other nodes about a new publication by this node
Per Liden's avatar
Per Liden committed
158
 */
159
void tipc_named_publish(struct publication *publ)
Per Liden's avatar
Per Liden committed
160
161
162
163
{
	struct sk_buff *buf;
	struct distr_item *item;

164
165
	list_add_tail(&publ->local_list, &publ_lists[publ->scope]->list);
	publ_lists[publ->scope]->size++;
Per Liden's avatar
Per Liden committed
166

167
168
169
	if (publ->scope == TIPC_NODE_SCOPE)
		return;

Per Liden's avatar
Per Liden committed
170
171
	buf = named_prepare_buf(PUBLICATION, ITEM_SIZE, 0);
	if (!buf) {
172
		pr_warn("Publication distribution failure\n");
Per Liden's avatar
Per Liden committed
173
174
175
176
177
		return;
	}

	item = (struct distr_item *)msg_data(buf_msg(buf));
	publ_to_item(item, publ);
178
	named_cluster_distribute(buf);
Per Liden's avatar
Per Liden committed
179
180
181
}

/**
182
 * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node
Per Liden's avatar
Per Liden committed
183
 */
184
void tipc_named_withdraw(struct publication *publ)
Per Liden's avatar
Per Liden committed
185
186
187
188
189
{
	struct sk_buff *buf;
	struct distr_item *item;

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

192
193
194
	if (publ->scope == TIPC_NODE_SCOPE)
		return;

Per Liden's avatar
Per Liden committed
195
196
	buf = named_prepare_buf(WITHDRAWAL, ITEM_SIZE, 0);
	if (!buf) {
197
		pr_warn("Withdrawal distribution failure\n");
Per Liden's avatar
Per Liden committed
198
199
200
201
202
		return;
	}

	item = (struct distr_item *)msg_data(buf_msg(buf));
	publ_to_item(item, publ);
203
	named_cluster_distribute(buf);
Per Liden's avatar
Per Liden committed
204
205
}

206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
/*
 * named_distribute - prepare name info for bulk distribution to another node
 */
static void named_distribute(struct list_head *message_list, u32 node,
			     struct publ_list *pls, u32 max_item_buf)
{
	struct publication *publ;
	struct sk_buff *buf = NULL;
	struct distr_item *item = NULL;
	u32 left = 0;
	u32 rest = pls->size * ITEM_SIZE;

	list_for_each_entry(publ, &pls->list, local_list) {
		if (!buf) {
			left = (rest <= max_item_buf) ? rest : max_item_buf;
			rest -= left;
			buf = named_prepare_buf(PUBLICATION, left, node);
			if (!buf) {
224
				pr_warn("Bulk publication failure\n");
225
226
227
228
229
230
231
232
233
234
235
236
237
238
				return;
			}
			item = (struct distr_item *)msg_data(buf_msg(buf));
		}
		publ_to_item(item, publ);
		item++;
		left -= ITEM_SIZE;
		if (!left) {
			list_add_tail((struct list_head *)buf, message_list);
			buf = NULL;
		}
	}
}

Per Liden's avatar
Per Liden committed
239
/**
240
 * tipc_named_node_up - tell specified node about all publications by this node
Per Liden's avatar
Per Liden committed
241
 */
242
void tipc_named_node_up(unsigned long nodearg)
Per Liden's avatar
Per Liden committed
243
{
244
	struct tipc_node *n_ptr;
245
	struct tipc_link *l_ptr;
246
	struct list_head message_list;
247
	u32 node = (u32)nodearg;
248
249
250
251
	u32 max_item_buf = 0;

	/* compute maximum amount of publication data to send per message */
	read_lock_bh(&tipc_net_lock);
252
	n_ptr = tipc_node_find(node);
253
254
255
256
257
258
259
260
261
262
263
	if (n_ptr) {
		tipc_node_lock(n_ptr);
		l_ptr = n_ptr->active_links[0];
		if (l_ptr)
			max_item_buf = ((l_ptr->max_pkt - INT_H_SIZE) /
				ITEM_SIZE) * ITEM_SIZE;
		tipc_node_unlock(n_ptr);
	}
	read_unlock_bh(&tipc_net_lock);
	if (!max_item_buf)
		return;
Per Liden's avatar
Per Liden committed
264

265
266
267
	/* create list of publication messages, then send them as a unit */
	INIT_LIST_HEAD(&message_list);

268
	read_lock_bh(&tipc_nametbl_lock);
269
	named_distribute(&message_list, node, &publ_cluster, max_item_buf);
270
	named_distribute(&message_list, node, &publ_zone, max_item_buf);
271
	read_unlock_bh(&tipc_nametbl_lock);
272

273
	tipc_link_names_xmit(&message_list, node);
Per Liden's avatar
Per Liden committed
274
275
276
}

/**
277
 * named_purge_publ - remove publication associated with a failed node
278
279
 *
 * Invoked for each publication issued by a newly failed node.
Per Liden's avatar
Per Liden committed
280
281
 * Removes publication structure from name table & deletes it.
 */
282
static void named_purge_publ(struct publication *publ)
Per Liden's avatar
Per Liden committed
283
284
{
	struct publication *p;
285

286
287
	write_lock_bh(&tipc_nametbl_lock);
	p = tipc_nametbl_remove_publ(publ->type, publ->lower,
288
				     publ->node, publ->ref, publ->key);
289
290
	if (p)
		tipc_nodesub_unsubscribe(&p->subscr);
291
	write_unlock_bh(&tipc_nametbl_lock);
292

293
	if (p != publ) {
294
295
296
297
		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);
298
299
	}

300
	kfree(p);
Per Liden's avatar
Per Liden committed
301
302
303
}

/**
304
 * tipc_named_rcv - process name table update message sent by another node
Per Liden's avatar
Per Liden committed
305
 */
306
void tipc_named_rcv(struct sk_buff *buf)
Per Liden's avatar
Per Liden committed
307
308
309
310
311
312
{
	struct publication *publ;
	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;

313
	write_lock_bh(&tipc_nametbl_lock);
Per Liden's avatar
Per Liden committed
314
315
	while (count--) {
		if (msg_type(msg) == PUBLICATION) {
316
			publ = tipc_nametbl_insert_publ(ntohl(item->type),
317
318
319
							ntohl(item->lower),
							ntohl(item->upper),
							TIPC_CLUSTER_SCOPE,
320
							msg_orignode(msg),
321
322
							ntohl(item->ref),
							ntohl(item->key));
Per Liden's avatar
Per Liden committed
323
			if (publ) {
324
325
				tipc_nodesub_subscribe(&publ->subscr,
						       msg_orignode(msg),
326
						       publ,
327
328
						       (net_ev_handler)
						       named_purge_publ);
Per Liden's avatar
Per Liden committed
329
330
			}
		} else if (msg_type(msg) == WITHDRAWAL) {
331
332
333
334
335
			publ = tipc_nametbl_remove_publ(ntohl(item->type),
							ntohl(item->lower),
							msg_orignode(msg),
							ntohl(item->ref),
							ntohl(item->key));
Per Liden's avatar
Per Liden committed
336
337

			if (publ) {
338
				tipc_nodesub_unsubscribe(&publ->subscr);
339
				kfree(publ);
340
			} else {
341
342
343
344
345
				pr_err("Unable to remove publication by node 0x%x\n"
				       " (type=%u, lower=%u, ref=%u, key=%u)\n",
				       msg_orignode(msg), ntohl(item->type),
				       ntohl(item->lower), ntohl(item->ref),
				       ntohl(item->key));
Per Liden's avatar
Per Liden committed
346
347
			}
		} else {
348
			pr_warn("Unrecognized name table message received\n");
Per Liden's avatar
Per Liden committed
349
350
351
		}
		item++;
	}
352
	write_unlock_bh(&tipc_nametbl_lock);
353
	kfree_skb(buf);
Per Liden's avatar
Per Liden committed
354
355
356
}

/**
357
 * tipc_named_reinit - re-initialize local publications
358
 *
359
 * This routine is called whenever TIPC networking is enabled.
360
361
 * 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
362
 */
363
void tipc_named_reinit(void)
Per Liden's avatar
Per Liden committed
364
365
{
	struct publication *publ;
366
	int scope;
Per Liden's avatar
Per Liden committed
367

368
	write_lock_bh(&tipc_nametbl_lock);
369

370
	for (scope = TIPC_ZONE_SCOPE; scope <= TIPC_NODE_SCOPE; scope++)
371
372
		list_for_each_entry(publ, &publ_lists[scope]->list, local_list)
			publ->node = tipc_own_addr;
373

374
	write_unlock_bh(&tipc_nametbl_lock);
Per Liden's avatar
Per Liden committed
375
}