Loading...
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
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
10 *
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.
19 *
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
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
38#include "link.h"
39#include "name_distr.h"
40
41int sysctl_tipc_named_timeout __read_mostly = 2000;
42
43struct distr_queue_item {
44 struct distr_item i;
45 u32 dtype;
46 u32 node;
47 unsigned long expires;
48 struct list_head next;
49};
50
51/**
52 * publ_to_item - add publication info to a publication message
53 */
54static void publ_to_item(struct distr_item *i, struct publication *p)
55{
56 i->type = htonl(p->type);
57 i->lower = htonl(p->lower);
58 i->upper = htonl(p->upper);
59 i->port = htonl(p->port);
60 i->key = htonl(p->key);
61}
62
63/**
64 * named_prepare_buf - allocate & initialize a publication message
65 *
66 * The buffer returned is of size INT_H_SIZE + payload size
67 */
68static struct sk_buff *named_prepare_buf(struct net *net, u32 type, u32 size,
69 u32 dest)
70{
71 struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE + size, GFP_ATOMIC);
72 u32 self = tipc_own_addr(net);
73 struct tipc_msg *msg;
74
75 if (buf != NULL) {
76 msg = buf_msg(buf);
77 tipc_msg_init(self, msg, NAME_DISTRIBUTOR,
78 type, INT_H_SIZE, dest);
79 msg_set_size(msg, INT_H_SIZE + size);
80 }
81 return buf;
82}
83
84/**
85 * tipc_named_publish - tell other nodes about a new publication by this node
86 */
87struct sk_buff *tipc_named_publish(struct net *net, struct publication *publ)
88{
89 struct name_table *nt = tipc_name_table(net);
90 struct distr_item *item;
91 struct sk_buff *skb;
92
93 if (publ->scope == TIPC_NODE_SCOPE) {
94 list_add_tail_rcu(&publ->binding_node, &nt->node_scope);
95 return NULL;
96 }
97 list_add_tail_rcu(&publ->binding_node, &nt->cluster_scope);
98
99 skb = named_prepare_buf(net, PUBLICATION, ITEM_SIZE, 0);
100 if (!skb) {
101 pr_warn("Publication distribution failure\n");
102 return NULL;
103 }
104
105 item = (struct distr_item *)msg_data(buf_msg(skb));
106 publ_to_item(item, publ);
107 return skb;
108}
109
110/**
111 * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node
112 */
113struct sk_buff *tipc_named_withdraw(struct net *net, struct publication *publ)
114{
115 struct sk_buff *buf;
116 struct distr_item *item;
117
118 list_del(&publ->binding_node);
119
120 if (publ->scope == TIPC_NODE_SCOPE)
121 return NULL;
122
123 buf = named_prepare_buf(net, WITHDRAWAL, ITEM_SIZE, 0);
124 if (!buf) {
125 pr_warn("Withdrawal distribution failure\n");
126 return NULL;
127 }
128
129 item = (struct distr_item *)msg_data(buf_msg(buf));
130 publ_to_item(item, publ);
131 return buf;
132}
133
134/**
135 * named_distribute - prepare name info for bulk distribution to another node
136 * @list: list of messages (buffers) to be returned from this function
137 * @dnode: node to be updated
138 * @pls: linked list of publication items to be packed into buffer chain
139 */
140static void named_distribute(struct net *net, struct sk_buff_head *list,
141 u32 dnode, struct list_head *pls)
142{
143 struct publication *publ;
144 struct sk_buff *skb = NULL;
145 struct distr_item *item = NULL;
146 u32 msg_dsz = ((tipc_node_get_mtu(net, dnode, 0) - INT_H_SIZE) /
147 ITEM_SIZE) * ITEM_SIZE;
148 u32 msg_rem = msg_dsz;
149
150 list_for_each_entry(publ, pls, binding_node) {
151 /* Prepare next buffer: */
152 if (!skb) {
153 skb = named_prepare_buf(net, PUBLICATION, msg_rem,
154 dnode);
155 if (!skb) {
156 pr_warn("Bulk publication failure\n");
157 return;
158 }
159 msg_set_bc_ack_invalid(buf_msg(skb), true);
160 item = (struct distr_item *)msg_data(buf_msg(skb));
161 }
162
163 /* Pack publication into message: */
164 publ_to_item(item, publ);
165 item++;
166 msg_rem -= ITEM_SIZE;
167
168 /* Append full buffer to list: */
169 if (!msg_rem) {
170 __skb_queue_tail(list, skb);
171 skb = NULL;
172 msg_rem = msg_dsz;
173 }
174 }
175 if (skb) {
176 msg_set_size(buf_msg(skb), INT_H_SIZE + (msg_dsz - msg_rem));
177 skb_trim(skb, INT_H_SIZE + (msg_dsz - msg_rem));
178 __skb_queue_tail(list, skb);
179 }
180}
181
182/**
183 * tipc_named_node_up - tell specified node about all publications by this node
184 */
185void tipc_named_node_up(struct net *net, u32 dnode)
186{
187 struct name_table *nt = tipc_name_table(net);
188 struct sk_buff_head head;
189
190 __skb_queue_head_init(&head);
191
192 rcu_read_lock();
193 named_distribute(net, &head, dnode, &nt->cluster_scope);
194 rcu_read_unlock();
195
196 tipc_node_xmit(net, &head, dnode, 0);
197}
198
199/**
200 * tipc_publ_purge - remove publication associated with a failed node
201 *
202 * Invoked for each publication issued by a newly failed node.
203 * Removes publication structure from name table & deletes it.
204 */
205static void tipc_publ_purge(struct net *net, struct publication *publ, u32 addr)
206{
207 struct tipc_net *tn = tipc_net(net);
208 struct publication *p;
209
210 spin_lock_bh(&tn->nametbl_lock);
211 p = tipc_nametbl_remove_publ(net, publ->type, publ->lower, publ->upper,
212 publ->node, publ->key);
213 if (p)
214 tipc_node_unsubscribe(net, &p->binding_node, addr);
215 spin_unlock_bh(&tn->nametbl_lock);
216
217 if (p != publ) {
218 pr_err("Unable to remove publication from failed node\n"
219 " (type=%u, lower=%u, node=0x%x, port=%u, key=%u)\n",
220 publ->type, publ->lower, publ->node, publ->port,
221 publ->key);
222 }
223
224 kfree_rcu(p, rcu);
225}
226
227/**
228 * tipc_dist_queue_purge - remove deferred updates from a node that went down
229 */
230static void tipc_dist_queue_purge(struct net *net, u32 addr)
231{
232 struct tipc_net *tn = net_generic(net, tipc_net_id);
233 struct distr_queue_item *e, *tmp;
234
235 spin_lock_bh(&tn->nametbl_lock);
236 list_for_each_entry_safe(e, tmp, &tn->dist_queue, next) {
237 if (e->node != addr)
238 continue;
239 list_del(&e->next);
240 kfree(e);
241 }
242 spin_unlock_bh(&tn->nametbl_lock);
243}
244
245void tipc_publ_notify(struct net *net, struct list_head *nsub_list, u32 addr)
246{
247 struct publication *publ, *tmp;
248
249 list_for_each_entry_safe(publ, tmp, nsub_list, binding_node)
250 tipc_publ_purge(net, publ, addr);
251 tipc_dist_queue_purge(net, addr);
252}
253
254/**
255 * tipc_update_nametbl - try to process a nametable update and notify
256 * subscribers
257 *
258 * tipc_nametbl_lock must be held.
259 * Returns the publication item if successful, otherwise NULL.
260 */
261static bool tipc_update_nametbl(struct net *net, struct distr_item *i,
262 u32 node, u32 dtype)
263{
264 struct publication *p = NULL;
265 u32 lower = ntohl(i->lower);
266 u32 upper = ntohl(i->upper);
267 u32 type = ntohl(i->type);
268 u32 port = ntohl(i->port);
269 u32 key = ntohl(i->key);
270
271 if (dtype == PUBLICATION) {
272 p = tipc_nametbl_insert_publ(net, type, lower, upper,
273 TIPC_CLUSTER_SCOPE, node,
274 port, key);
275 if (p) {
276 tipc_node_subscribe(net, &p->binding_node, node);
277 return true;
278 }
279 } else if (dtype == WITHDRAWAL) {
280 p = tipc_nametbl_remove_publ(net, type, lower,
281 upper, node, key);
282 if (p) {
283 tipc_node_unsubscribe(net, &p->binding_node, node);
284 kfree_rcu(p, rcu);
285 return true;
286 }
287 pr_warn_ratelimited("Failed to remove binding %u,%u from %x\n",
288 type, lower, node);
289 } else {
290 pr_warn("Unrecognized name table message received\n");
291 }
292 return false;
293}
294
295/**
296 * tipc_named_rcv - process name table update messages sent by another node
297 */
298void tipc_named_rcv(struct net *net, struct sk_buff_head *inputq)
299{
300 struct tipc_net *tn = net_generic(net, tipc_net_id);
301 struct tipc_msg *msg;
302 struct distr_item *item;
303 uint count;
304 u32 node;
305 struct sk_buff *skb;
306 int mtype;
307
308 spin_lock_bh(&tn->nametbl_lock);
309 for (skb = skb_dequeue(inputq); skb; skb = skb_dequeue(inputq)) {
310 skb_linearize(skb);
311 msg = buf_msg(skb);
312 mtype = msg_type(msg);
313 item = (struct distr_item *)msg_data(msg);
314 count = msg_data_sz(msg) / ITEM_SIZE;
315 node = msg_orignode(msg);
316 while (count--) {
317 tipc_update_nametbl(net, item, node, mtype);
318 item++;
319 }
320 kfree_skb(skb);
321 }
322 spin_unlock_bh(&tn->nametbl_lock);
323}
324
325/**
326 * tipc_named_reinit - re-initialize local publications
327 *
328 * This routine is called whenever TIPC networking is enabled.
329 * All name table entries published by this node are updated to reflect
330 * the node's new network address.
331 */
332void tipc_named_reinit(struct net *net)
333{
334 struct name_table *nt = tipc_name_table(net);
335 struct tipc_net *tn = tipc_net(net);
336 struct publication *publ;
337 u32 self = tipc_own_addr(net);
338
339 spin_lock_bh(&tn->nametbl_lock);
340
341 list_for_each_entry_rcu(publ, &nt->node_scope, binding_node)
342 publ->node = self;
343 list_for_each_entry_rcu(publ, &nt->cluster_scope, binding_node)
344 publ->node = self;
345
346 spin_unlock_bh(&tn->nametbl_lock);
347}
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
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
10 *
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.
19 *
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
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
38#include "link.h"
39#include "name_distr.h"
40
41#define ITEM_SIZE sizeof(struct distr_item)
42
43/**
44 * struct distr_item - publication info distributed to other nodes
45 * @type: name sequence type
46 * @lower: name sequence lower bound
47 * @upper: name sequence upper bound
48 * @ref: publishing port reference
49 * @key: publication key
50 *
51 * ===> All fields are stored in network byte order. <===
52 *
53 * First 3 fields identify (name or) name sequence being published.
54 * Reference field uniquely identifies port that published name sequence.
55 * Key field uniquely identifies publication, in the event a port has
56 * multiple publications of the same name sequence.
57 *
58 * Note: There is no field that identifies the publishing node because it is
59 * the same for all items contained within a publication message.
60 */
61struct distr_item {
62 __be32 type;
63 __be32 lower;
64 __be32 upper;
65 __be32 ref;
66 __be32 key;
67};
68
69/**
70 * struct publ_list - list of publications made by this node
71 * @list: circular list of publications
72 * @list_size: number of entries in list
73 */
74struct publ_list {
75 struct list_head list;
76 u32 size;
77};
78
79static struct publ_list publ_zone = {
80 .list = LIST_HEAD_INIT(publ_zone.list),
81 .size = 0,
82};
83
84static struct publ_list publ_cluster = {
85 .list = LIST_HEAD_INIT(publ_cluster.list),
86 .size = 0,
87};
88
89static struct publ_list publ_node = {
90 .list = LIST_HEAD_INIT(publ_node.list),
91 .size = 0,
92};
93
94static struct publ_list *publ_lists[] = {
95 NULL,
96 &publ_zone, /* publ_lists[TIPC_ZONE_SCOPE] */
97 &publ_cluster, /* publ_lists[TIPC_CLUSTER_SCOPE] */
98 &publ_node /* publ_lists[TIPC_NODE_SCOPE] */
99};
100
101
102/**
103 * publ_to_item - add publication info to a publication message
104 */
105static void publ_to_item(struct distr_item *i, struct publication *p)
106{
107 i->type = htonl(p->type);
108 i->lower = htonl(p->lower);
109 i->upper = htonl(p->upper);
110 i->ref = htonl(p->ref);
111 i->key = htonl(p->key);
112}
113
114/**
115 * named_prepare_buf - allocate & initialize a publication message
116 */
117static struct sk_buff *named_prepare_buf(u32 type, u32 size, u32 dest)
118{
119 struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE + size);
120 struct tipc_msg *msg;
121
122 if (buf != NULL) {
123 msg = buf_msg(buf);
124 tipc_msg_init(msg, NAME_DISTRIBUTOR, type, INT_H_SIZE, dest);
125 msg_set_size(msg, INT_H_SIZE + size);
126 }
127 return buf;
128}
129
130static void named_cluster_distribute(struct sk_buff *buf)
131{
132 struct sk_buff *buf_copy;
133 struct tipc_node *n_ptr;
134 struct tipc_link *l_ptr;
135
136 rcu_read_lock();
137 list_for_each_entry_rcu(n_ptr, &tipc_node_list, list) {
138 spin_lock_bh(&n_ptr->lock);
139 l_ptr = n_ptr->active_links[n_ptr->addr & 1];
140 if (l_ptr) {
141 buf_copy = skb_copy(buf, GFP_ATOMIC);
142 if (!buf_copy) {
143 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 rcu_read_unlock();
152
153 kfree_skb(buf);
154}
155
156/**
157 * tipc_named_publish - tell other nodes about a new publication by this node
158 */
159void tipc_named_publish(struct publication *publ)
160{
161 struct sk_buff *buf;
162 struct distr_item *item;
163
164 list_add_tail(&publ->local_list, &publ_lists[publ->scope]->list);
165 publ_lists[publ->scope]->size++;
166
167 if (publ->scope == TIPC_NODE_SCOPE)
168 return;
169
170 buf = named_prepare_buf(PUBLICATION, ITEM_SIZE, 0);
171 if (!buf) {
172 pr_warn("Publication distribution failure\n");
173 return;
174 }
175
176 item = (struct distr_item *)msg_data(buf_msg(buf));
177 publ_to_item(item, publ);
178 named_cluster_distribute(buf);
179}
180
181/**
182 * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node
183 */
184void tipc_named_withdraw(struct publication *publ)
185{
186 struct sk_buff *buf;
187 struct distr_item *item;
188
189 list_del(&publ->local_list);
190 publ_lists[publ->scope]->size--;
191
192 if (publ->scope == TIPC_NODE_SCOPE)
193 return;
194
195 buf = named_prepare_buf(WITHDRAWAL, ITEM_SIZE, 0);
196 if (!buf) {
197 pr_warn("Withdrawal distribution failure\n");
198 return;
199 }
200
201 item = (struct distr_item *)msg_data(buf_msg(buf));
202 publ_to_item(item, publ);
203 named_cluster_distribute(buf);
204}
205
206/*
207 * named_distribute - prepare name info for bulk distribution to another node
208 */
209static void named_distribute(struct list_head *message_list, u32 node,
210 struct publ_list *pls, u32 max_item_buf)
211{
212 struct publication *publ;
213 struct sk_buff *buf = NULL;
214 struct distr_item *item = NULL;
215 u32 left = 0;
216 u32 rest = pls->size * ITEM_SIZE;
217
218 list_for_each_entry(publ, &pls->list, local_list) {
219 if (!buf) {
220 left = (rest <= max_item_buf) ? rest : max_item_buf;
221 rest -= left;
222 buf = named_prepare_buf(PUBLICATION, left, node);
223 if (!buf) {
224 pr_warn("Bulk publication failure\n");
225 return;
226 }
227 item = (struct distr_item *)msg_data(buf_msg(buf));
228 }
229 publ_to_item(item, publ);
230 item++;
231 left -= ITEM_SIZE;
232 if (!left) {
233 list_add_tail((struct list_head *)buf, message_list);
234 buf = NULL;
235 }
236 }
237}
238
239/**
240 * tipc_named_node_up - tell specified node about all publications by this node
241 */
242void tipc_named_node_up(unsigned long nodearg)
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 u32 max_item_buf = 0;
249
250 /* compute maximum amount of publication data to send per message */
251 read_lock_bh(&tipc_net_lock);
252 n_ptr = tipc_node_find(node);
253 if (n_ptr) {
254 tipc_node_lock(n_ptr);
255 l_ptr = n_ptr->active_links[0];
256 if (l_ptr)
257 max_item_buf = ((l_ptr->max_pkt - INT_H_SIZE) /
258 ITEM_SIZE) * ITEM_SIZE;
259 tipc_node_unlock(n_ptr);
260 }
261 read_unlock_bh(&tipc_net_lock);
262 if (!max_item_buf)
263 return;
264
265 /* create list of publication messages, then send them as a unit */
266 INIT_LIST_HEAD(&message_list);
267
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);
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.
280 * Removes publication structure from name table & deletes it.
281 */
282static void named_purge_publ(struct publication *publ)
283{
284 struct publication *p;
285
286 write_lock_bh(&tipc_nametbl_lock);
287 p = tipc_nametbl_remove_publ(publ->type, publ->lower,
288 publ->node, publ->ref, publ->key);
289 if (p)
290 tipc_nodesub_unsubscribe(&p->subscr);
291 write_unlock_bh(&tipc_nametbl_lock);
292
293 if (p != publ) {
294 pr_err("Unable to remove publication from failed node\n"
295 " (type=%u, lower=%u, node=0x%x, ref=%u, key=%u)\n",
296 publ->type, publ->lower, publ->node, publ->ref,
297 publ->key);
298 }
299
300 kfree(p);
301}
302
303/**
304 * tipc_named_rcv - process name table update message sent by another node
305 */
306void tipc_named_rcv(struct sk_buff *buf)
307{
308 struct publication *publ;
309 struct tipc_msg *msg = buf_msg(buf);
310 struct distr_item *item = (struct distr_item *)msg_data(msg);
311 u32 count = msg_data_sz(msg) / ITEM_SIZE;
312
313 write_lock_bh(&tipc_nametbl_lock);
314 while (count--) {
315 if (msg_type(msg) == PUBLICATION) {
316 publ = tipc_nametbl_insert_publ(ntohl(item->type),
317 ntohl(item->lower),
318 ntohl(item->upper),
319 TIPC_CLUSTER_SCOPE,
320 msg_orignode(msg),
321 ntohl(item->ref),
322 ntohl(item->key));
323 if (publ) {
324 tipc_nodesub_subscribe(&publ->subscr,
325 msg_orignode(msg),
326 publ,
327 (net_ev_handler)
328 named_purge_publ);
329 }
330 } else if (msg_type(msg) == WITHDRAWAL) {
331 publ = tipc_nametbl_remove_publ(ntohl(item->type),
332 ntohl(item->lower),
333 msg_orignode(msg),
334 ntohl(item->ref),
335 ntohl(item->key));
336
337 if (publ) {
338 tipc_nodesub_unsubscribe(&publ->subscr);
339 kfree(publ);
340 } else {
341 pr_err("Unable to remove publication by node 0x%x\n"
342 " (type=%u, lower=%u, ref=%u, key=%u)\n",
343 msg_orignode(msg), ntohl(item->type),
344 ntohl(item->lower), ntohl(item->ref),
345 ntohl(item->key));
346 }
347 } else {
348 pr_warn("Unrecognized name table message received\n");
349 }
350 item++;
351 }
352 write_unlock_bh(&tipc_nametbl_lock);
353 kfree_skb(buf);
354}
355
356/**
357 * tipc_named_reinit - re-initialize local publications
358 *
359 * This routine is called whenever TIPC networking is enabled.
360 * All name table entries published by this node are updated to reflect
361 * the node's new network address.
362 */
363void tipc_named_reinit(void)
364{
365 struct publication *publ;
366 int scope;
367
368 write_lock_bh(&tipc_nametbl_lock);
369
370 for (scope = TIPC_ZONE_SCOPE; scope <= TIPC_NODE_SCOPE; scope++)
371 list_for_each_entry(publ, &publ_lists[scope]->list, local_list)
372 publ->node = tipc_own_addr;
373
374 write_unlock_bh(&tipc_nametbl_lock);
375}