tipc: make tipc socket support net namespace
[deliverable/linux.git] / net / tipc / name_distr.c
CommitLineData
b97bf3fd
PL
1/*
2 * net/tipc/name_distr.c: TIPC name distribution code
c4307285 3 *
a5325ae5 4 * Copyright (c) 2000-2006, 2014, Ericsson AB
431697eb 5 * Copyright (c) 2005, 2010-2011, Wind River Systems
b97bf3fd
PL
6 * All rights reserved.
7 *
9ea1fd3c 8 * Redistribution and use in source and binary forms, with or without
b97bf3fd
PL
9 * modification, are permitted provided that the following conditions are met:
10 *
9ea1fd3c
PL
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
b97bf3fd 19 *
9ea1fd3c
PL
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
b97bf3fd
PL
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
b97bf3fd 38#include "link.h"
b97bf3fd
PL
39#include "name_distr.h"
40
a5325ae5
EH
41int sysctl_tipc_named_timeout __read_mostly = 2000;
42
43/**
44 * struct tipc_dist_queue - queue holding deferred name table updates
45 */
46static struct list_head tipc_dist_queue = LIST_HEAD_INIT(tipc_dist_queue);
47
48struct distr_queue_item {
49 struct distr_item i;
50 u32 dtype;
51 u32 node;
52 unsigned long expires;
53 struct list_head next;
54};
55
b97bf3fd
PL
56/**
57 * publ_to_item - add publication info to a publication message
58 */
b97bf3fd
PL
59static void publ_to_item(struct distr_item *i, struct publication *p)
60{
61 i->type = htonl(p->type);
62 i->lower = htonl(p->lower);
63 i->upper = htonl(p->upper);
64 i->ref = htonl(p->ref);
65 i->key = htonl(p->key);
b97bf3fd
PL
66}
67
68/**
69 * named_prepare_buf - allocate & initialize a publication message
70 */
b97bf3fd
PL
71static struct sk_buff *named_prepare_buf(u32 type, u32 size, u32 dest)
72{
741d9eb7 73 struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE + size);
b97bf3fd
PL
74 struct tipc_msg *msg;
75
76 if (buf != NULL) {
77 msg = buf_msg(buf);
741d9eb7
AS
78 tipc_msg_init(msg, NAME_DISTRIBUTOR, type, INT_H_SIZE, dest);
79 msg_set_size(msg, INT_H_SIZE + size);
b97bf3fd
PL
80 }
81 return buf;
82}
83
f2f9800d 84void named_cluster_distribute(struct net *net, struct sk_buff *skb)
8f92df6a 85{
f2f9800d 86 struct tipc_net *tn = net_generic(net, tipc_net_id);
a6ca1094 87 struct sk_buff *oskb;
dbdf6d24
JPM
88 struct tipc_node *node;
89 u32 dnode;
8f92df6a 90
6c7a762e 91 rcu_read_lock();
f2f9800d 92 list_for_each_entry_rcu(node, &tn->node_list, list) {
dbdf6d24
JPM
93 dnode = node->addr;
94 if (in_own_node(dnode))
95 continue;
96 if (!tipc_node_active_links(node))
97 continue;
a6ca1094
YX
98 oskb = skb_copy(skb, GFP_ATOMIC);
99 if (!oskb)
dbdf6d24 100 break;
a6ca1094 101 msg_set_destnode(buf_msg(oskb), dnode);
f2f9800d 102 tipc_link_xmit_skb(net, oskb, dnode, dnode);
8f92df6a 103 }
6c7a762e 104 rcu_read_unlock();
8f92df6a 105
a6ca1094 106 kfree_skb(skb);
8f92df6a
AS
107}
108
b97bf3fd 109/**
4323add6 110 * tipc_named_publish - tell other nodes about a new publication by this node
b97bf3fd 111 */
eab8c045 112struct sk_buff *tipc_named_publish(struct publication *publ)
b97bf3fd
PL
113{
114 struct sk_buff *buf;
115 struct distr_item *item;
116
97ede29e
YX
117 list_add_tail_rcu(&publ->local_list,
118 &tipc_nametbl->publ_list[publ->scope]);
b97bf3fd 119
1110b8d3 120 if (publ->scope == TIPC_NODE_SCOPE)
eab8c045 121 return NULL;
1110b8d3 122
b97bf3fd
PL
123 buf = named_prepare_buf(PUBLICATION, ITEM_SIZE, 0);
124 if (!buf) {
2cf8aa19 125 pr_warn("Publication distribution failure\n");
eab8c045 126 return NULL;
b97bf3fd
PL
127 }
128
129 item = (struct distr_item *)msg_data(buf_msg(buf));
130 publ_to_item(item, publ);
eab8c045 131 return buf;
b97bf3fd
PL
132}
133
134/**
4323add6 135 * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node
b97bf3fd 136 */
eab8c045 137struct sk_buff *tipc_named_withdraw(struct publication *publ)
b97bf3fd
PL
138{
139 struct sk_buff *buf;
140 struct distr_item *item;
141
142 list_del(&publ->local_list);
b97bf3fd 143
1110b8d3 144 if (publ->scope == TIPC_NODE_SCOPE)
eab8c045 145 return NULL;
1110b8d3 146
b97bf3fd
PL
147 buf = named_prepare_buf(WITHDRAWAL, ITEM_SIZE, 0);
148 if (!buf) {
2cf8aa19 149 pr_warn("Withdrawal distribution failure\n");
eab8c045 150 return NULL;
b97bf3fd
PL
151 }
152
153 item = (struct distr_item *)msg_data(buf_msg(buf));
154 publ_to_item(item, publ);
eab8c045 155 return buf;
b97bf3fd
PL
156}
157
dbdf6d24 158/**
e11aa059 159 * named_distribute - prepare name info for bulk distribution to another node
a6ca1094 160 * @list: list of messages (buffers) to be returned from this function
dbdf6d24
JPM
161 * @dnode: node to be updated
162 * @pls: linked list of publication items to be packed into buffer chain
e11aa059 163 */
f2f9800d
YX
164static void named_distribute(struct net *net, struct sk_buff_head *list,
165 u32 dnode, struct list_head *pls)
e11aa059
AS
166{
167 struct publication *publ;
a6ca1094 168 struct sk_buff *skb = NULL;
e11aa059 169 struct distr_item *item = NULL;
f2f9800d
YX
170 uint msg_dsz = (tipc_node_get_mtu(net, dnode, 0) / ITEM_SIZE) *
171 ITEM_SIZE;
1b61e70a 172 uint msg_rem = msg_dsz;
e11aa059 173
993bfe5d 174 list_for_each_entry(publ, pls, local_list) {
dbdf6d24 175 /* Prepare next buffer: */
a6ca1094 176 if (!skb) {
a6ca1094
YX
177 skb = named_prepare_buf(PUBLICATION, msg_rem, dnode);
178 if (!skb) {
2cf8aa19 179 pr_warn("Bulk publication failure\n");
e11aa059
AS
180 return;
181 }
a6ca1094 182 item = (struct distr_item *)msg_data(buf_msg(skb));
e11aa059 183 }
dbdf6d24
JPM
184
185 /* Pack publication into message: */
e11aa059
AS
186 publ_to_item(item, publ);
187 item++;
dbdf6d24
JPM
188 msg_rem -= ITEM_SIZE;
189
190 /* Append full buffer to list: */
191 if (!msg_rem) {
a6ca1094
YX
192 __skb_queue_tail(list, skb);
193 skb = NULL;
1b61e70a 194 msg_rem = msg_dsz;
e11aa059
AS
195 }
196 }
1b61e70a
YX
197 if (skb) {
198 msg_set_size(buf_msg(skb), INT_H_SIZE + (msg_dsz - msg_rem));
199 skb_trim(skb, INT_H_SIZE + (msg_dsz - msg_rem));
200 __skb_queue_tail(list, skb);
201 }
e11aa059
AS
202}
203
b97bf3fd 204/**
4323add6 205 * tipc_named_node_up - tell specified node about all publications by this node
b97bf3fd 206 */
f2f9800d 207void tipc_named_node_up(struct net *net, u32 dnode)
b97bf3fd 208{
a6ca1094
YX
209 struct sk_buff_head head;
210
211 __skb_queue_head_init(&head);
9aa88c2a 212
97ede29e 213 rcu_read_lock();
f2f9800d 214 named_distribute(net, &head, dnode,
993bfe5d 215 &tipc_nametbl->publ_list[TIPC_CLUSTER_SCOPE]);
f2f9800d 216 named_distribute(net, &head, dnode,
993bfe5d 217 &tipc_nametbl->publ_list[TIPC_ZONE_SCOPE]);
97ede29e 218 rcu_read_unlock();
9aa88c2a 219
f2f9800d 220 tipc_link_xmit(net, &head, dnode, dnode);
b97bf3fd
PL
221}
222
f2f9800d
YX
223static void tipc_publ_subscribe(struct net *net, struct publication *publ,
224 u32 addr)
a8f48af5
YX
225{
226 struct tipc_node *node;
227
228 if (in_own_node(addr))
229 return;
230
f2f9800d 231 node = tipc_node_find(net, addr);
a8f48af5
YX
232 if (!node) {
233 pr_warn("Node subscription rejected, unknown node 0x%x\n",
234 addr);
235 return;
236 }
237
238 tipc_node_lock(node);
239 list_add_tail(&publ->nodesub_list, &node->publ_list);
240 tipc_node_unlock(node);
241}
242
f2f9800d
YX
243static void tipc_publ_unsubscribe(struct net *net, struct publication *publ,
244 u32 addr)
a8f48af5
YX
245{
246 struct tipc_node *node;
247
f2f9800d 248 node = tipc_node_find(net, addr);
a8f48af5
YX
249 if (!node)
250 return;
251
252 tipc_node_lock(node);
253 list_del_init(&publ->nodesub_list);
254 tipc_node_unlock(node);
255}
256
b97bf3fd 257/**
a8f48af5 258 * tipc_publ_purge - remove publication associated with a failed node
c4307285
YH
259 *
260 * Invoked for each publication issued by a newly failed node.
b97bf3fd 261 * Removes publication structure from name table & deletes it.
b97bf3fd 262 */
f2f9800d 263static void tipc_publ_purge(struct net *net, struct publication *publ, u32 addr)
b97bf3fd
PL
264{
265 struct publication *p;
f131072c 266
97ede29e 267 spin_lock_bh(&tipc_nametbl_lock);
c4307285 268 p = tipc_nametbl_remove_publ(publ->type, publ->lower,
4323add6 269 publ->node, publ->ref, publ->key);
431697eb 270 if (p)
f2f9800d 271 tipc_publ_unsubscribe(net, p, addr);
97ede29e 272 spin_unlock_bh(&tipc_nametbl_lock);
f131072c 273
c4307285 274 if (p != publ) {
2cf8aa19
EH
275 pr_err("Unable to remove publication from failed node\n"
276 " (type=%u, lower=%u, node=0x%x, ref=%u, key=%u)\n",
277 publ->type, publ->lower, publ->node, publ->ref,
278 publ->key);
f131072c
AS
279 }
280
97ede29e 281 kfree_rcu(p, rcu);
b97bf3fd
PL
282}
283
f2f9800d 284void tipc_publ_notify(struct net *net, struct list_head *nsub_list, u32 addr)
a8f48af5
YX
285{
286 struct publication *publ, *tmp;
287
288 list_for_each_entry_safe(publ, tmp, nsub_list, nodesub_list)
f2f9800d 289 tipc_publ_purge(net, publ, addr);
a8f48af5
YX
290}
291
f4ad8a4b
EH
292/**
293 * tipc_update_nametbl - try to process a nametable update and notify
294 * subscribers
295 *
296 * tipc_nametbl_lock must be held.
297 * Returns the publication item if successful, otherwise NULL.
298 */
f2f9800d
YX
299static bool tipc_update_nametbl(struct net *net, struct distr_item *i,
300 u32 node, u32 dtype)
f4ad8a4b
EH
301{
302 struct publication *publ = NULL;
303
304 if (dtype == PUBLICATION) {
305 publ = tipc_nametbl_insert_publ(ntohl(i->type), ntohl(i->lower),
306 ntohl(i->upper),
307 TIPC_CLUSTER_SCOPE, node,
308 ntohl(i->ref), ntohl(i->key));
309 if (publ) {
f2f9800d 310 tipc_publ_subscribe(net, publ, node);
0fc4dffa 311 return true;
f4ad8a4b
EH
312 }
313 } else if (dtype == WITHDRAWAL) {
314 publ = tipc_nametbl_remove_publ(ntohl(i->type), ntohl(i->lower),
315 node, ntohl(i->ref),
316 ntohl(i->key));
317 if (publ) {
f2f9800d 318 tipc_publ_unsubscribe(net, publ, node);
97ede29e 319 kfree_rcu(publ, rcu);
0fc4dffa 320 return true;
f4ad8a4b
EH
321 }
322 } else {
323 pr_warn("Unrecognized name table message received\n");
324 }
0fc4dffa 325 return false;
f4ad8a4b
EH
326}
327
a5325ae5
EH
328/**
329 * tipc_named_add_backlog - add a failed name table update to the backlog
330 *
331 */
332static void tipc_named_add_backlog(struct distr_item *i, u32 type, u32 node)
333{
334 struct distr_queue_item *e;
335 unsigned long now = get_jiffies_64();
336
337 e = kzalloc(sizeof(*e), GFP_ATOMIC);
338 if (!e)
339 return;
340 e->dtype = type;
341 e->node = node;
342 e->expires = now + msecs_to_jiffies(sysctl_tipc_named_timeout);
343 memcpy(e, i, sizeof(*i));
344 list_add_tail(&e->next, &tipc_dist_queue);
345}
346
347/**
348 * tipc_named_process_backlog - try to process any pending name table updates
349 * from the network.
350 */
f2f9800d 351void tipc_named_process_backlog(struct net *net)
a5325ae5
EH
352{
353 struct distr_queue_item *e, *tmp;
354 char addr[16];
355 unsigned long now = get_jiffies_64();
356
357 list_for_each_entry_safe(e, tmp, &tipc_dist_queue, next) {
358 if (time_after(e->expires, now)) {
f2f9800d 359 if (!tipc_update_nametbl(net, &e->i, e->node, e->dtype))
a5325ae5
EH
360 continue;
361 } else {
362 tipc_addr_string_fill(addr, e->node);
363 pr_warn_ratelimited("Dropping name table update (%d) of {%u, %u, %u} from %s key=%u\n",
364 e->dtype, ntohl(e->i.type),
365 ntohl(e->i.lower),
366 ntohl(e->i.upper),
367 addr, ntohl(e->i.key));
368 }
369 list_del(&e->next);
370 kfree(e);
371 }
372}
373
b97bf3fd 374/**
247f0f3c 375 * tipc_named_rcv - process name table update message sent by another node
b97bf3fd 376 */
f2f9800d 377void tipc_named_rcv(struct net *net, struct sk_buff *buf)
b97bf3fd 378{
b97bf3fd
PL
379 struct tipc_msg *msg = buf_msg(buf);
380 struct distr_item *item = (struct distr_item *)msg_data(msg);
381 u32 count = msg_data_sz(msg) / ITEM_SIZE;
a5325ae5 382 u32 node = msg_orignode(msg);
b97bf3fd 383
97ede29e 384 spin_lock_bh(&tipc_nametbl_lock);
b97bf3fd 385 while (count--) {
f2f9800d 386 if (!tipc_update_nametbl(net, item, node, msg_type(msg)))
a5325ae5 387 tipc_named_add_backlog(item, msg_type(msg), node);
b97bf3fd
PL
388 item++;
389 }
f2f9800d 390 tipc_named_process_backlog(net);
97ede29e 391 spin_unlock_bh(&tipc_nametbl_lock);
5f6d9123 392 kfree_skb(buf);
b97bf3fd
PL
393}
394
395/**
1110b8d3 396 * tipc_named_reinit - re-initialize local publications
c4307285 397 *
945af1c3 398 * This routine is called whenever TIPC networking is enabled.
1110b8d3
AS
399 * All name table entries published by this node are updated to reflect
400 * the node's new network address.
b97bf3fd 401 */
4323add6 402void tipc_named_reinit(void)
b97bf3fd
PL
403{
404 struct publication *publ;
a909804f 405 int scope;
b97bf3fd 406
97ede29e 407 spin_lock_bh(&tipc_nametbl_lock);
945af1c3 408
1110b8d3 409 for (scope = TIPC_ZONE_SCOPE; scope <= TIPC_NODE_SCOPE; scope++)
97ede29e
YX
410 list_for_each_entry_rcu(publ, &tipc_nametbl->publ_list[scope],
411 local_list)
a909804f 412 publ->node = tipc_own_addr;
945af1c3 413
97ede29e 414 spin_unlock_bh(&tipc_nametbl_lock);
b97bf3fd 415}
This page took 0.704389 seconds and 5 git commands to generate.