xref: /openbmc/linux/net/tipc/name_distr.c (revision 3b23dc52)
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 
41 int sysctl_tipc_named_timeout __read_mostly = 2000;
42 
43 struct 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  */
54 static 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  */
68 static 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  */
87 struct 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  */
113 struct 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  */
140 static 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  */
185 void 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  */
205 static 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  */
230 static 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 
245 void 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  */
261 static 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  */
298 void 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  */
332 void 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 }
348