]>
Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/name_table.c: TIPC name table code | |
c4307285 | 3 | * |
e50e73e1 | 4 | * Copyright (c) 2000-2006, 2014-2018, Ericsson AB |
993bfe5d | 5 | * Copyright (c) 2004-2008, 2010-2014, Wind River Systems |
998d3907 | 6 | * Copyright (c) 2020-2021, Red Hat Inc |
b97bf3fd PL |
7 | * All rights reserved. |
8 | * | |
9ea1fd3c | 9 | * Redistribution and use in source and binary forms, with or without |
b97bf3fd PL |
10 | * modification, are permitted provided that the following conditions are met: |
11 | * | |
9ea1fd3c PL |
12 | * 1. Redistributions of source code must retain the above copyright |
13 | * notice, this list of conditions and the following disclaimer. | |
14 | * 2. Redistributions in binary form must reproduce the above copyright | |
15 | * notice, this list of conditions and the following disclaimer in the | |
16 | * documentation and/or other materials provided with the distribution. | |
17 | * 3. Neither the names of the copyright holders nor the names of its | |
18 | * contributors may be used to endorse or promote products derived from | |
19 | * this software without specific prior written permission. | |
b97bf3fd | 20 | * |
9ea1fd3c PL |
21 | * Alternatively, this software may be distributed under the terms of the |
22 | * GNU General Public License ("GPL") version 2 as published by the Free | |
23 | * Software Foundation. | |
24 | * | |
25 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | |
26 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
27 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
28 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | |
29 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | |
30 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | |
31 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
32 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | |
33 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
34 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
b97bf3fd PL |
35 | * POSSIBILITY OF SUCH DAMAGE. |
36 | */ | |
37 | ||
4ac1c8d0 | 38 | #include <net/sock.h> |
41b416f1 | 39 | #include <linux/list_sort.h> |
d5162f34 | 40 | #include <linux/rbtree_augmented.h> |
b97bf3fd | 41 | #include "core.h" |
22ae7cff | 42 | #include "netlink.h" |
b97bf3fd PL |
43 | #include "name_table.h" |
44 | #include "name_distr.h" | |
b97bf3fd | 45 | #include "subscr.h" |
1da46568 | 46 | #include "bcast.h" |
22ae7cff | 47 | #include "addr.h" |
1d7e1c25 | 48 | #include "node.h" |
75da2163 | 49 | #include "group.h" |
b97bf3fd PL |
50 | |
51 | /** | |
218527fe JM |
52 | * struct service_range - container for all bindings of a service range |
53 | * @lower: service range lower bound | |
54 | * @upper: service range upper bound | |
55 | * @tree_node: member of service range RB tree | |
d5162f34 | 56 | * @max: largest 'upper' in this node subtree |
218527fe JM |
57 | * @local_publ: list of identical publications made from this node |
58 | * Used by closest_first lookup and multicast lookup algorithm | |
59 | * @all_publ: all publications identical to this one, whatever node and scope | |
60 | * Used by round-robin lookup algorithm | |
b97bf3fd | 61 | */ |
218527fe | 62 | struct service_range { |
b52124a5 AS |
63 | u32 lower; |
64 | u32 upper; | |
218527fe | 65 | struct rb_node tree_node; |
d5162f34 | 66 | u32 max; |
218527fe JM |
67 | struct list_head local_publ; |
68 | struct list_head all_publ; | |
b52124a5 AS |
69 | }; |
70 | ||
c4307285 | 71 | /** |
218527fe JM |
72 | * struct tipc_service - container for all published instances of a service type |
73 | * @type: 32 bit 'type' value for service | |
41b416f1 | 74 | * @publ_cnt: increasing counter for publications in this service |
218527fe JM |
75 | * @ranges: rb tree containing all service ranges for this service |
76 | * @service_list: links to adjacent name ranges in hash chain | |
77 | * @subscriptions: list of subscriptions for this service type | |
78 | * @lock: spinlock controlling access to pertaining service ranges/publications | |
97ede29e | 79 | * @rcu: RCU callback head used for deferred freeing |
b97bf3fd | 80 | */ |
218527fe | 81 | struct tipc_service { |
b97bf3fd | 82 | u32 type; |
41b416f1 | 83 | u32 publ_cnt; |
218527fe JM |
84 | struct rb_root ranges; |
85 | struct hlist_node service_list; | |
b97bf3fd | 86 | struct list_head subscriptions; |
218527fe | 87 | spinlock_t lock; /* Covers service range list */ |
97ede29e | 88 | struct rcu_head rcu; |
b97bf3fd PL |
89 | }; |
90 | ||
d5162f34 TL |
91 | #define service_range_upper(sr) ((sr)->upper) |
92 | RB_DECLARE_CALLBACKS_MAX(static, sr_callbacks, | |
93 | struct service_range, tree_node, u32, max, | |
94 | service_range_upper) | |
95 | ||
96 | #define service_range_entry(rbtree_node) \ | |
97 | (container_of(rbtree_node, struct service_range, tree_node)) | |
98 | ||
99 | #define service_range_overlap(sr, start, end) \ | |
100 | ((sr)->lower <= (end) && (sr)->upper >= (start)) | |
101 | ||
102 | /** | |
103 | * service_range_foreach_match - iterate over tipc service rbtree for each | |
104 | * range match | |
105 | * @sr: the service range pointer as a loop cursor | |
106 | * @sc: the pointer to tipc service which holds the service range rbtree | |
5c5d6796 RD |
107 | * @start: beginning of the search range (end >= start) for matching |
108 | * @end: end of the search range (end >= start) for matching | |
d5162f34 TL |
109 | */ |
110 | #define service_range_foreach_match(sr, sc, start, end) \ | |
111 | for (sr = service_range_match_first((sc)->ranges.rb_node, \ | |
112 | start, \ | |
113 | end); \ | |
114 | sr; \ | |
115 | sr = service_range_match_next(&(sr)->tree_node, \ | |
116 | start, \ | |
117 | end)) | |
118 | ||
119 | /** | |
120 | * service_range_match_first - find first service range matching a range | |
121 | * @n: the root node of service range rbtree for searching | |
5c5d6796 RD |
122 | * @start: beginning of the search range (end >= start) for matching |
123 | * @end: end of the search range (end >= start) for matching | |
d5162f34 TL |
124 | * |
125 | * Return: the leftmost service range node in the rbtree that overlaps the | |
126 | * specific range if any. Otherwise, returns NULL. | |
127 | */ | |
128 | static struct service_range *service_range_match_first(struct rb_node *n, | |
129 | u32 start, u32 end) | |
130 | { | |
131 | struct service_range *sr; | |
132 | struct rb_node *l, *r; | |
133 | ||
134 | /* Non overlaps in tree at all? */ | |
135 | if (!n || service_range_entry(n)->max < start) | |
136 | return NULL; | |
137 | ||
138 | while (n) { | |
139 | l = n->rb_left; | |
140 | if (l && service_range_entry(l)->max >= start) { | |
141 | /* A leftmost overlap range node must be one in the left | |
142 | * subtree. If not, it has lower > end, then nodes on | |
143 | * the right side cannot satisfy the condition either. | |
144 | */ | |
145 | n = l; | |
146 | continue; | |
147 | } | |
148 | ||
149 | /* No one in the left subtree can match, return if this node is | |
150 | * an overlap i.e. leftmost. | |
151 | */ | |
152 | sr = service_range_entry(n); | |
153 | if (service_range_overlap(sr, start, end)) | |
154 | return sr; | |
155 | ||
156 | /* Ok, try to lookup on the right side */ | |
157 | r = n->rb_right; | |
158 | if (sr->lower <= end && | |
159 | r && service_range_entry(r)->max >= start) { | |
160 | n = r; | |
161 | continue; | |
162 | } | |
163 | break; | |
164 | } | |
165 | ||
166 | return NULL; | |
167 | } | |
168 | ||
169 | /** | |
170 | * service_range_match_next - find next service range matching a range | |
171 | * @n: a node in service range rbtree from which the searching starts | |
5c5d6796 RD |
172 | * @start: beginning of the search range (end >= start) for matching |
173 | * @end: end of the search range (end >= start) for matching | |
d5162f34 TL |
174 | * |
175 | * Return: the next service range node to the given node in the rbtree that | |
176 | * overlaps the specific range if any. Otherwise, returns NULL. | |
177 | */ | |
178 | static struct service_range *service_range_match_next(struct rb_node *n, | |
179 | u32 start, u32 end) | |
180 | { | |
181 | struct service_range *sr; | |
182 | struct rb_node *p, *r; | |
183 | ||
184 | while (n) { | |
185 | r = n->rb_right; | |
186 | if (r && service_range_entry(r)->max >= start) | |
187 | /* A next overlap range node must be one in the right | |
188 | * subtree. If not, it has lower > end, then any next | |
189 | * successor (- an ancestor) of this node cannot | |
190 | * satisfy the condition either. | |
191 | */ | |
192 | return service_range_match_first(r, start, end); | |
193 | ||
194 | /* No one in the right subtree can match, go up to find an | |
195 | * ancestor of this node which is parent of a left-hand child. | |
196 | */ | |
197 | while ((p = rb_parent(n)) && n == p->rb_right) | |
198 | n = p; | |
199 | if (!p) | |
200 | break; | |
201 | ||
202 | /* Return if this ancestor is an overlap */ | |
203 | sr = service_range_entry(p); | |
204 | if (service_range_overlap(sr, start, end)) | |
205 | return sr; | |
206 | ||
207 | /* Ok, try to lookup more from this ancestor */ | |
208 | if (sr->lower <= end) { | |
209 | n = p; | |
210 | continue; | |
211 | } | |
212 | break; | |
213 | } | |
214 | ||
215 | return NULL; | |
216 | } | |
217 | ||
05790c64 | 218 | static int hash(int x) |
b97bf3fd | 219 | { |
f046e7d9 | 220 | return x & (TIPC_NAMETBL_SIZE - 1); |
b97bf3fd PL |
221 | } |
222 | ||
223 | /** | |
218527fe | 224 | * tipc_publ_create - create a publication structure |
a45ffa68 JM |
225 | * @ua: the service range the user is binding to |
226 | * @sk: the address of the socket that is bound | |
5c5d6796 | 227 | * @key: publication key |
b97bf3fd | 228 | */ |
a45ffa68 JM |
229 | static struct publication *tipc_publ_create(struct tipc_uaddr *ua, |
230 | struct tipc_socket_addr *sk, | |
218527fe | 231 | u32 key) |
b97bf3fd | 232 | { |
998d3907 | 233 | struct publication *p = kzalloc(sizeof(*p), GFP_ATOMIC); |
218527fe | 234 | |
998d3907 | 235 | if (!p) |
1fc54d8f | 236 | return NULL; |
b97bf3fd | 237 | |
a45ffa68 JM |
238 | p->sr = ua->sr; |
239 | p->sk = *sk; | |
240 | p->scope = ua->scope; | |
998d3907 JM |
241 | p->key = key; |
242 | INIT_LIST_HEAD(&p->binding_sock); | |
243 | INIT_LIST_HEAD(&p->binding_node); | |
244 | INIT_LIST_HEAD(&p->local_publ); | |
245 | INIT_LIST_HEAD(&p->all_publ); | |
246 | INIT_LIST_HEAD(&p->list); | |
247 | return p; | |
b97bf3fd PL |
248 | } |
249 | ||
250 | /** | |
218527fe | 251 | * tipc_service_create - create a service structure for the specified 'type' |
6e44867b JM |
252 | * @net: network namespace |
253 | * @ua: address representing the service to be bound | |
c4307285 | 254 | * |
218527fe | 255 | * Allocates a single range structure and sets it to all 0's. |
b97bf3fd | 256 | */ |
6e44867b JM |
257 | static struct tipc_service *tipc_service_create(struct net *net, |
258 | struct tipc_uaddr *ua) | |
b97bf3fd | 259 | { |
6e44867b JM |
260 | struct name_table *nt = tipc_name_table(net); |
261 | struct tipc_service *service; | |
262 | struct hlist_head *hd; | |
b97bf3fd | 263 | |
6e44867b | 264 | service = kzalloc(sizeof(*service), GFP_ATOMIC); |
218527fe JM |
265 | if (!service) { |
266 | pr_warn("Service creation failed, no memory\n"); | |
1fc54d8f | 267 | return NULL; |
b97bf3fd PL |
268 | } |
269 | ||
218527fe | 270 | spin_lock_init(&service->lock); |
6e44867b | 271 | service->type = ua->sr.type; |
218527fe JM |
272 | service->ranges = RB_ROOT; |
273 | INIT_HLIST_NODE(&service->service_list); | |
274 | INIT_LIST_HEAD(&service->subscriptions); | |
6e44867b | 275 | hd = &nt->services[hash(ua->sr.type)]; |
218527fe JM |
276 | hlist_add_head_rcu(&service->service_list, hd); |
277 | return service; | |
b97bf3fd PL |
278 | } |
279 | ||
5f30721c JM |
280 | /* tipc_service_find_range - find service range matching publication parameters |
281 | */ | |
282 | static struct service_range *tipc_service_find_range(struct tipc_service *sc, | |
13c9d23f | 283 | struct tipc_uaddr *ua) |
5f30721c | 284 | { |
5f30721c JM |
285 | struct service_range *sr; |
286 | ||
13c9d23f | 287 | service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) { |
d5162f34 | 288 | /* Look for exact match */ |
13c9d23f | 289 | if (sr->lower == ua->sr.lower && sr->upper == ua->sr.upper) |
d5162f34 | 290 | return sr; |
5f30721c | 291 | } |
5f30721c | 292 | |
d5162f34 | 293 | return NULL; |
5f30721c JM |
294 | } |
295 | ||
218527fe | 296 | static struct service_range *tipc_service_create_range(struct tipc_service *sc, |
13c9d23f | 297 | struct publication *p) |
b97bf3fd | 298 | { |
218527fe | 299 | struct rb_node **n, *parent = NULL; |
d5162f34 | 300 | struct service_range *sr; |
13c9d23f JM |
301 | u32 lower = p->sr.lower; |
302 | u32 upper = p->sr.upper; | |
218527fe JM |
303 | |
304 | n = &sc->ranges.rb_node; | |
305 | while (*n) { | |
218527fe | 306 | parent = *n; |
d5162f34 TL |
307 | sr = service_range_entry(parent); |
308 | if (lower == sr->lower && upper == sr->upper) | |
309 | return sr; | |
310 | if (sr->max < upper) | |
311 | sr->max = upper; | |
312 | if (lower <= sr->lower) | |
313 | n = &parent->rb_left; | |
b97bf3fd | 314 | else |
d5162f34 | 315 | n = &parent->rb_right; |
b97bf3fd | 316 | } |
218527fe JM |
317 | sr = kzalloc(sizeof(*sr), GFP_ATOMIC); |
318 | if (!sr) | |
319 | return NULL; | |
320 | sr->lower = lower; | |
321 | sr->upper = upper; | |
d5162f34 | 322 | sr->max = upper; |
218527fe JM |
323 | INIT_LIST_HEAD(&sr->local_publ); |
324 | INIT_LIST_HEAD(&sr->all_publ); | |
325 | rb_link_node(&sr->tree_node, parent, n); | |
d5162f34 | 326 | rb_insert_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); |
218527fe | 327 | return sr; |
b97bf3fd PL |
328 | } |
329 | ||
b26b5aa9 JM |
330 | static bool tipc_service_insert_publ(struct net *net, |
331 | struct tipc_service *sc, | |
332 | struct publication *p) | |
b97bf3fd | 333 | { |
218527fe JM |
334 | struct tipc_subscription *sub, *tmp; |
335 | struct service_range *sr; | |
b26b5aa9 JM |
336 | struct publication *_p; |
337 | u32 node = p->sk.node; | |
218527fe | 338 | bool first = false; |
b26b5aa9 | 339 | bool res = false; |
5c834950 | 340 | u32 key = p->key; |
b52124a5 | 341 | |
b26b5aa9 | 342 | spin_lock_bh(&sc->lock); |
13c9d23f | 343 | sr = tipc_service_create_range(sc, p); |
37922ea4 | 344 | if (!sr) |
b26b5aa9 | 345 | goto exit; |
b97bf3fd | 346 | |
37922ea4 | 347 | first = list_empty(&sr->all_publ); |
b97bf3fd | 348 | |
218527fe | 349 | /* Return if the publication already exists */ |
b26b5aa9 | 350 | list_for_each_entry(_p, &sr->all_publ, all_publ) { |
5c834950 JM |
351 | if (_p->key == key && (!_p->sk.node || _p->sk.node == node)) { |
352 | pr_debug("Failed to bind duplicate %u,%u,%u/%u:%u/%u\n", | |
353 | p->sr.type, p->sr.lower, p->sr.upper, | |
354 | node, p->sk.ref, key); | |
b26b5aa9 | 355 | goto exit; |
5c834950 | 356 | } |
218527fe | 357 | } |
b97bf3fd | 358 | |
b26b5aa9 | 359 | if (in_own_node(net, p->sk.node)) |
218527fe JM |
360 | list_add(&p->local_publ, &sr->local_publ); |
361 | list_add(&p->all_publ, &sr->all_publ); | |
b26b5aa9 | 362 | p->id = sc->publ_cnt++; |
b97bf3fd | 363 | |
617d3c7a | 364 | /* Any subscriptions waiting for notification? */ |
218527fe | 365 | list_for_each_entry_safe(sub, tmp, &sc->subscriptions, service_list) { |
09f78b85 | 366 | tipc_sub_report_overlap(sub, p, TIPC_PUBLISHED, first); |
b97bf3fd | 367 | } |
b26b5aa9 JM |
368 | res = true; |
369 | exit: | |
370 | if (!res) | |
371 | pr_warn("Failed to bind to %u,%u,%u\n", | |
372 | p->sr.type, p->sr.lower, p->sr.upper); | |
373 | spin_unlock_bh(&sc->lock); | |
374 | return res; | |
b97bf3fd PL |
375 | } |
376 | ||
377 | /** | |
218527fe | 378 | * tipc_service_remove_publ - remove a publication from a service |
2c98da07 JM |
379 | * @r: service_range to remove publication from |
380 | * @sk: address publishing socket | |
5c5d6796 | 381 | * @key: target publication key |
b97bf3fd | 382 | */ |
2c98da07 JM |
383 | static struct publication *tipc_service_remove_publ(struct service_range *r, |
384 | struct tipc_socket_addr *sk, | |
385 | u32 key) | |
b97bf3fd | 386 | { |
218527fe | 387 | struct publication *p; |
2c98da07 | 388 | u32 node = sk->node; |
b52124a5 | 389 | |
2c98da07 | 390 | list_for_each_entry(p, &r->all_publ, all_publ) { |
998d3907 | 391 | if (p->key != key || (node && node != p->sk.node)) |
218527fe | 392 | continue; |
5f30721c JM |
393 | list_del(&p->all_publ); |
394 | list_del(&p->local_publ); | |
395 | return p; | |
f6f0a4d2 | 396 | } |
5f30721c | 397 | return NULL; |
b97bf3fd PL |
398 | } |
399 | ||
5c5d6796 | 400 | /* |
41b416f1 TL |
401 | * Code reused: time_after32() for the same purpose |
402 | */ | |
403 | #define publication_after(pa, pb) time_after32((pa)->id, (pb)->id) | |
404 | static int tipc_publ_sort(void *priv, struct list_head *a, | |
405 | struct list_head *b) | |
406 | { | |
407 | struct publication *pa, *pb; | |
408 | ||
409 | pa = container_of(a, struct publication, list); | |
410 | pb = container_of(b, struct publication, list); | |
411 | return publication_after(pa, pb); | |
412 | } | |
413 | ||
b97bf3fd | 414 | /** |
218527fe JM |
415 | * tipc_service_subscribe - attach a subscription, and optionally |
416 | * issue the prescribed number of events if there is any service | |
417 | * range overlapping with the requested range | |
5c5d6796 RD |
418 | * @service: the tipc_service to attach the @sub to |
419 | * @sub: the subscription to attach | |
b97bf3fd | 420 | */ |
218527fe | 421 | static void tipc_service_subscribe(struct tipc_service *service, |
8985ecc7 | 422 | struct tipc_subscription *sub) |
b97bf3fd | 423 | { |
41b416f1 TL |
424 | struct publication *p, *first, *tmp; |
425 | struct list_head publ_list; | |
218527fe | 426 | struct service_range *sr; |
429189ac | 427 | u32 filter, lower, upper; |
a4273c73 | 428 | |
429189ac JM |
429 | filter = sub->s.filter; |
430 | lower = sub->s.seq.lower; | |
431 | upper = sub->s.seq.upper; | |
b97bf3fd | 432 | |
da0a75e8 | 433 | tipc_sub_get(sub); |
218527fe | 434 | list_add(&sub->service_list, &service->subscriptions); |
b97bf3fd | 435 | |
41b416f1 | 436 | if (filter & TIPC_SUB_NO_STATUS) |
b97bf3fd PL |
437 | return; |
438 | ||
41b416f1 | 439 | INIT_LIST_HEAD(&publ_list); |
429189ac | 440 | service_range_foreach_match(sr, service, lower, upper) { |
41b416f1 | 441 | first = NULL; |
218527fe | 442 | list_for_each_entry(p, &sr->all_publ, all_publ) { |
41b416f1 TL |
443 | if (filter & TIPC_SUB_PORTS) |
444 | list_add_tail(&p->list, &publ_list); | |
445 | else if (!first || publication_after(first, p)) | |
446 | /* Pick this range's *first* publication */ | |
447 | first = p; | |
b97bf3fd | 448 | } |
41b416f1 TL |
449 | if (first) |
450 | list_add_tail(&first->list, &publ_list); | |
451 | } | |
452 | ||
453 | /* Sort the publications before reporting */ | |
454 | list_sort(NULL, &publ_list, tipc_publ_sort); | |
455 | list_for_each_entry_safe(p, tmp, &publ_list, list) { | |
09f78b85 | 456 | tipc_sub_report_overlap(sub, p, TIPC_PUBLISHED, true); |
41b416f1 | 457 | list_del_init(&p->list); |
b97bf3fd PL |
458 | } |
459 | } | |
460 | ||
6e44867b JM |
461 | static struct tipc_service *tipc_service_find(struct net *net, |
462 | struct tipc_uaddr *ua) | |
b97bf3fd | 463 | { |
218527fe JM |
464 | struct name_table *nt = tipc_name_table(net); |
465 | struct hlist_head *service_head; | |
466 | struct tipc_service *service; | |
b97bf3fd | 467 | |
6e44867b | 468 | service_head = &nt->services[hash(ua->sr.type)]; |
218527fe | 469 | hlist_for_each_entry_rcu(service, service_head, service_list) { |
6e44867b | 470 | if (service->type == ua->sr.type) |
218527fe JM |
471 | return service; |
472 | } | |
1fc54d8f | 473 | return NULL; |
b97bf3fd PL |
474 | }; |
475 | ||
a45ffa68 JM |
476 | struct publication *tipc_nametbl_insert_publ(struct net *net, |
477 | struct tipc_uaddr *ua, | |
478 | struct tipc_socket_addr *sk, | |
479 | u32 key) | |
b97bf3fd | 480 | { |
218527fe JM |
481 | struct tipc_service *sc; |
482 | struct publication *p; | |
b97bf3fd | 483 | |
a45ffa68 | 484 | p = tipc_publ_create(ua, sk, key); |
b26b5aa9 JM |
485 | if (!p) |
486 | return NULL; | |
487 | ||
6e44867b | 488 | sc = tipc_service_find(net, ua); |
218527fe | 489 | if (!sc) |
6e44867b | 490 | sc = tipc_service_create(net, ua); |
b26b5aa9 JM |
491 | if (sc && tipc_service_insert_publ(net, sc, p)) |
492 | return p; | |
493 | kfree(p); | |
494 | return NULL; | |
b97bf3fd PL |
495 | } |
496 | ||
2c98da07 JM |
497 | struct publication *tipc_nametbl_remove_publ(struct net *net, |
498 | struct tipc_uaddr *ua, | |
499 | struct tipc_socket_addr *sk, | |
500 | u32 key) | |
b97bf3fd | 501 | { |
5f30721c | 502 | struct tipc_subscription *sub, *tmp; |
218527fe | 503 | struct publication *p = NULL; |
2c98da07 JM |
504 | struct service_range *sr; |
505 | struct tipc_service *sc; | |
5f30721c | 506 | bool last; |
b97bf3fd | 507 | |
6e44867b | 508 | sc = tipc_service_find(net, ua); |
218527fe | 509 | if (!sc) |
5c834950 | 510 | goto exit; |
b97bf3fd | 511 | |
218527fe | 512 | spin_lock_bh(&sc->lock); |
13c9d23f | 513 | sr = tipc_service_find_range(sc, ua); |
5f30721c | 514 | if (!sr) |
5c834950 | 515 | goto unlock; |
2c98da07 | 516 | p = tipc_service_remove_publ(sr, sk, key); |
5f30721c | 517 | if (!p) |
5c834950 | 518 | goto unlock; |
5f30721c JM |
519 | |
520 | /* Notify any waiting subscriptions */ | |
521 | last = list_empty(&sr->all_publ); | |
522 | list_for_each_entry_safe(sub, tmp, &sc->subscriptions, service_list) { | |
09f78b85 | 523 | tipc_sub_report_overlap(sub, p, TIPC_WITHDRAWN, last); |
5f30721c | 524 | } |
be47e41d JM |
525 | |
526 | /* Remove service range item if this was its last publication */ | |
5f30721c | 527 | if (list_empty(&sr->all_publ)) { |
d5162f34 | 528 | rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); |
be47e41d JM |
529 | kfree(sr); |
530 | } | |
218527fe | 531 | |
09f78b85 | 532 | /* Delete service item if no more publications and subscriptions */ |
218527fe JM |
533 | if (RB_EMPTY_ROOT(&sc->ranges) && list_empty(&sc->subscriptions)) { |
534 | hlist_del_init_rcu(&sc->service_list); | |
535 | kfree_rcu(sc, rcu); | |
fb9962f3 | 536 | } |
5c834950 | 537 | unlock: |
218527fe | 538 | spin_unlock_bh(&sc->lock); |
5c834950 JM |
539 | exit: |
540 | if (!p) { | |
541 | pr_err("Failed to remove unknown binding: %u,%u,%u/%u:%u/%u\n", | |
542 | ua->sr.type, ua->sr.lower, ua->sr.upper, | |
543 | sk->node, sk->ref, key); | |
544 | } | |
218527fe | 545 | return p; |
b97bf3fd PL |
546 | } |
547 | ||
2c53040f | 548 | /** |
66db239c | 549 | * tipc_nametbl_lookup_anycast - perform service instance to socket translation |
5c5d6796 | 550 | * @net: network namespace |
908148bc JM |
551 | * @ua: service address to look up |
552 | * @sk: address to socket we want to find | |
66db239c | 553 | * |
908148bc JM |
554 | * On entry, a non-zero 'sk->node' indicates the node where we want lookup to be |
555 | * performed, which may not be this one. | |
bc9f8143 | 556 | * On exit: |
908148bc JM |
557 | * - If lookup is deferred to another node, leave 'sk->node' unchanged and |
558 | * return 'true'. | |
559 | * - If lookup is successful, set the 'sk->node' and 'sk->ref' (== portid) which | |
560 | * represent the bound socket and return 'true'. | |
561 | * - If lookup fails, return 'false' | |
f20889f7 JM |
562 | * |
563 | * Note that for legacy users (node configured with Z.C.N address format) the | |
908148bc | 564 | * 'closest-first' lookup algorithm must be maintained, i.e., if sk.node is 0 |
f20889f7 | 565 | * we must look in the local binding list first |
b97bf3fd | 566 | */ |
908148bc JM |
567 | bool tipc_nametbl_lookup_anycast(struct net *net, |
568 | struct tipc_uaddr *ua, | |
569 | struct tipc_socket_addr *sk) | |
b97bf3fd | 570 | { |
b89afb11 JM |
571 | struct tipc_net *tn = tipc_net(net); |
572 | bool legacy = tn->legacy_addr_format; | |
573 | u32 self = tipc_own_addr(net); | |
908148bc JM |
574 | u32 inst = ua->sa.instance; |
575 | struct service_range *r; | |
218527fe JM |
576 | struct tipc_service *sc; |
577 | struct publication *p; | |
908148bc JM |
578 | struct list_head *l; |
579 | bool res = false; | |
b97bf3fd | 580 | |
908148bc JM |
581 | if (!tipc_in_scope(legacy, sk->node, self)) |
582 | return true; | |
b97bf3fd | 583 | |
97ede29e | 584 | rcu_read_lock(); |
6e44867b | 585 | sc = tipc_service_find(net, ua); |
218527fe | 586 | if (unlikely(!sc)) |
d5162f34 | 587 | goto exit; |
218527fe JM |
588 | |
589 | spin_lock_bh(&sc->lock); | |
908148bc | 590 | service_range_foreach_match(r, sc, inst, inst) { |
d5162f34 | 591 | /* Select lookup algo: local, closest-first or round-robin */ |
908148bc JM |
592 | if (sk->node == self) { |
593 | l = &r->local_publ; | |
594 | if (list_empty(l)) | |
d5162f34 | 595 | continue; |
908148bc JM |
596 | p = list_first_entry(l, struct publication, local_publ); |
597 | list_move_tail(&p->local_publ, &r->local_publ); | |
598 | } else if (legacy && !sk->node && !list_empty(&r->local_publ)) { | |
599 | l = &r->local_publ; | |
600 | p = list_first_entry(l, struct publication, local_publ); | |
601 | list_move_tail(&p->local_publ, &r->local_publ); | |
d5162f34 | 602 | } else { |
908148bc JM |
603 | l = &r->all_publ; |
604 | p = list_first_entry(l, struct publication, all_publ); | |
605 | list_move_tail(&p->all_publ, &r->all_publ); | |
d5162f34 | 606 | } |
908148bc JM |
607 | *sk = p->sk; |
608 | res = true; | |
d5162f34 TL |
609 | /* Todo: as for legacy, pick the first matching range only, a |
610 | * "true" round-robin will be performed as needed. | |
611 | */ | |
612 | break; | |
b97bf3fd | 613 | } |
218527fe | 614 | spin_unlock_bh(&sc->lock); |
d5162f34 TL |
615 | |
616 | exit: | |
97ede29e | 617 | rcu_read_unlock(); |
908148bc | 618 | return res; |
b97bf3fd PL |
619 | } |
620 | ||
66db239c JM |
621 | /* tipc_nametbl_lookup_group(): lookup destinaton(s) in a communication group |
622 | * Returns a list of one (== group anycast) or more (== group multicast) | |
623 | * destination socket/node pairs matching the given address. | |
624 | * The requester may or may not want to exclude himself from the list. | |
625 | */ | |
006ed14e JM |
626 | bool tipc_nametbl_lookup_group(struct net *net, struct tipc_uaddr *ua, |
627 | struct list_head *dsts, int *dstcnt, | |
628 | u32 exclude, bool mcast) | |
ee106d7f JM |
629 | { |
630 | u32 self = tipc_own_addr(net); | |
006ed14e | 631 | u32 inst = ua->sa.instance; |
218527fe JM |
632 | struct service_range *sr; |
633 | struct tipc_service *sc; | |
634 | struct publication *p; | |
ee106d7f | 635 | |
ee106d7f JM |
636 | *dstcnt = 0; |
637 | rcu_read_lock(); | |
6e44867b | 638 | sc = tipc_service_find(net, ua); |
218527fe | 639 | if (unlikely(!sc)) |
ee106d7f | 640 | goto exit; |
218527fe JM |
641 | |
642 | spin_lock_bh(&sc->lock); | |
643 | ||
d5162f34 | 644 | /* Todo: a full search i.e. service_range_foreach_match() instead? */ |
006ed14e | 645 | sr = service_range_match_first(sc->ranges.rb_node, inst, inst); |
218527fe JM |
646 | if (!sr) |
647 | goto no_match; | |
648 | ||
649 | list_for_each_entry(p, &sr->all_publ, all_publ) { | |
006ed14e | 650 | if (p->scope != ua->scope) |
218527fe | 651 | continue; |
998d3907 | 652 | if (p->sk.ref == exclude && p->sk.node == self) |
218527fe | 653 | continue; |
998d3907 | 654 | tipc_dest_push(dsts, p->sk.node, p->sk.ref); |
218527fe | 655 | (*dstcnt)++; |
66db239c | 656 | if (mcast) |
218527fe JM |
657 | continue; |
658 | list_move_tail(&p->all_publ, &sr->all_publ); | |
659 | break; | |
ee106d7f | 660 | } |
218527fe JM |
661 | no_match: |
662 | spin_unlock_bh(&sc->lock); | |
ee106d7f JM |
663 | exit: |
664 | rcu_read_unlock(); | |
665 | return !list_empty(dsts); | |
666 | } | |
667 | ||
66db239c JM |
668 | /* tipc_nametbl_lookup_mcast_sockets(): look up node local destinaton sockets |
669 | * matching the given address | |
670 | * Used on nodes which have received a multicast/broadcast message | |
671 | * Returns a list of local sockets | |
672 | */ | |
45ceea2d JM |
673 | void tipc_nametbl_lookup_mcast_sockets(struct net *net, struct tipc_uaddr *ua, |
674 | bool exact, struct list_head *dports) | |
b97bf3fd | 675 | { |
218527fe JM |
676 | struct service_range *sr; |
677 | struct tipc_service *sc; | |
232d07b7 | 678 | struct publication *p; |
45ceea2d | 679 | u32 scope = ua->scope; |
b97bf3fd | 680 | |
97ede29e | 681 | rcu_read_lock(); |
6e44867b | 682 | sc = tipc_service_find(net, ua); |
218527fe | 683 | if (!sc) |
b97bf3fd PL |
684 | goto exit; |
685 | ||
218527fe | 686 | spin_lock_bh(&sc->lock); |
45ceea2d | 687 | service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) { |
218527fe | 688 | list_for_each_entry(p, &sr->local_publ, local_publ) { |
232d07b7 | 689 | if (p->scope == scope || (!exact && p->scope < scope)) |
998d3907 | 690 | tipc_dest_push(dports, 0, p->sk.ref); |
968edbe1 | 691 | } |
b97bf3fd | 692 | } |
218527fe | 693 | spin_unlock_bh(&sc->lock); |
b97bf3fd | 694 | exit: |
97ede29e | 695 | rcu_read_unlock(); |
b97bf3fd PL |
696 | } |
697 | ||
66db239c JM |
698 | /* tipc_nametbl_lookup_mcast_nodes(): look up all destination nodes matching |
699 | * the given address. Used in sending node. | |
700 | * Used on nodes which are sending out a multicast/broadcast message | |
701 | * Returns a list of nodes, including own node if applicable | |
2ae0b8af | 702 | */ |
833f8670 JM |
703 | void tipc_nametbl_lookup_mcast_nodes(struct net *net, struct tipc_uaddr *ua, |
704 | struct tipc_nlist *nodes) | |
2ae0b8af | 705 | { |
218527fe JM |
706 | struct service_range *sr; |
707 | struct tipc_service *sc; | |
708 | struct publication *p; | |
2ae0b8af JPM |
709 | |
710 | rcu_read_lock(); | |
6e44867b | 711 | sc = tipc_service_find(net, ua); |
218527fe | 712 | if (!sc) |
2ae0b8af JPM |
713 | goto exit; |
714 | ||
218527fe | 715 | spin_lock_bh(&sc->lock); |
833f8670 | 716 | service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) { |
218527fe | 717 | list_for_each_entry(p, &sr->all_publ, all_publ) { |
998d3907 | 718 | tipc_nlist_add(nodes, p->sk.node); |
2ae0b8af JPM |
719 | } |
720 | } | |
218527fe | 721 | spin_unlock_bh(&sc->lock); |
2ae0b8af JPM |
722 | exit: |
723 | rcu_read_unlock(); | |
724 | } | |
725 | ||
75da2163 JM |
726 | /* tipc_nametbl_build_group - build list of communication group members |
727 | */ | |
728 | void tipc_nametbl_build_group(struct net *net, struct tipc_group *grp, | |
6e44867b | 729 | struct tipc_uaddr *ua) |
75da2163 | 730 | { |
218527fe JM |
731 | struct service_range *sr; |
732 | struct tipc_service *sc; | |
75da2163 | 733 | struct publication *p; |
218527fe | 734 | struct rb_node *n; |
75da2163 JM |
735 | |
736 | rcu_read_lock(); | |
6e44867b | 737 | sc = tipc_service_find(net, ua); |
218527fe | 738 | if (!sc) |
75da2163 JM |
739 | goto exit; |
740 | ||
218527fe JM |
741 | spin_lock_bh(&sc->lock); |
742 | for (n = rb_first(&sc->ranges); n; n = rb_next(n)) { | |
743 | sr = container_of(n, struct service_range, tree_node); | |
744 | list_for_each_entry(p, &sr->all_publ, all_publ) { | |
6e44867b | 745 | if (p->scope != ua->scope) |
75da2163 | 746 | continue; |
6e44867b JM |
747 | tipc_group_add_member(grp, p->sk.node, p->sk.ref, |
748 | p->sr.lower); | |
75da2163 JM |
749 | } |
750 | } | |
218527fe | 751 | spin_unlock_bh(&sc->lock); |
75da2163 JM |
752 | exit: |
753 | rcu_read_unlock(); | |
754 | } | |
755 | ||
218527fe | 756 | /* tipc_nametbl_publish - add service binding to name table |
b97bf3fd | 757 | */ |
50a3499a JM |
758 | struct publication *tipc_nametbl_publish(struct net *net, struct tipc_uaddr *ua, |
759 | struct tipc_socket_addr *sk, u32 key) | |
b97bf3fd | 760 | { |
218527fe JM |
761 | struct name_table *nt = tipc_name_table(net); |
762 | struct tipc_net *tn = tipc_net(net); | |
763 | struct publication *p = NULL; | |
764 | struct sk_buff *skb = NULL; | |
cad2929d | 765 | u32 rc_dests; |
b97bf3fd | 766 | |
4ac1c8d0 | 767 | spin_lock_bh(&tn->nametbl_lock); |
218527fe JM |
768 | |
769 | if (nt->local_publ_count >= TIPC_MAX_PUBL) { | |
770 | pr_warn("Bind failed, max limit %u reached\n", TIPC_MAX_PUBL); | |
771 | goto exit; | |
b97bf3fd | 772 | } |
b97bf3fd | 773 | |
a45ffa68 | 774 | p = tipc_nametbl_insert_publ(net, ua, sk, key); |
218527fe JM |
775 | if (p) { |
776 | nt->local_publ_count++; | |
777 | skb = tipc_named_publish(net, p); | |
fd6eced8 | 778 | } |
cad2929d | 779 | rc_dests = nt->rc_dests; |
218527fe | 780 | exit: |
4ac1c8d0 | 781 | spin_unlock_bh(&tn->nametbl_lock); |
eab8c045 | 782 | |
218527fe | 783 | if (skb) |
cad2929d | 784 | tipc_node_broadcast(net, skb, rc_dests); |
218527fe | 785 | return p; |
cad2929d | 786 | |
b97bf3fd PL |
787 | } |
788 | ||
789 | /** | |
218527fe | 790 | * tipc_nametbl_withdraw - withdraw a service binding |
5c5d6796 | 791 | * @net: network namespace |
2c98da07 JM |
792 | * @ua: service address/range being unbound |
793 | * @sk: address of the socket being unbound from | |
5c5d6796 | 794 | * @key: target publication key |
b97bf3fd | 795 | */ |
2c98da07 JM |
796 | void tipc_nametbl_withdraw(struct net *net, struct tipc_uaddr *ua, |
797 | struct tipc_socket_addr *sk, u32 key) | |
b97bf3fd | 798 | { |
218527fe JM |
799 | struct name_table *nt = tipc_name_table(net); |
800 | struct tipc_net *tn = tipc_net(net); | |
5492390a | 801 | struct sk_buff *skb = NULL; |
218527fe | 802 | struct publication *p; |
cad2929d | 803 | u32 rc_dests; |
b97bf3fd | 804 | |
4ac1c8d0 | 805 | spin_lock_bh(&tn->nametbl_lock); |
218527fe | 806 | |
2c98da07 | 807 | p = tipc_nametbl_remove_publ(net, ua, sk, key); |
218527fe JM |
808 | if (p) { |
809 | nt->local_publ_count--; | |
810 | skb = tipc_named_withdraw(net, p); | |
218527fe JM |
811 | list_del_init(&p->binding_sock); |
812 | kfree_rcu(p, rcu); | |
5492390a | 813 | } |
cad2929d | 814 | rc_dests = nt->rc_dests; |
4ac1c8d0 | 815 | spin_unlock_bh(&tn->nametbl_lock); |
eab8c045 | 816 | |
2c98da07 | 817 | if (skb) |
cad2929d | 818 | tipc_node_broadcast(net, skb, rc_dests); |
b97bf3fd PL |
819 | } |
820 | ||
821 | /** | |
4323add6 | 822 | * tipc_nametbl_subscribe - add a subscription object to the name table |
5c5d6796 | 823 | * @sub: subscription to add |
b97bf3fd | 824 | */ |
c3317f4d | 825 | bool tipc_nametbl_subscribe(struct tipc_subscription *sub) |
b97bf3fd | 826 | { |
5c45ab24 | 827 | struct tipc_net *tn = tipc_net(sub->net); |
429189ac | 828 | u32 type = sub->s.seq.type; |
218527fe | 829 | struct tipc_service *sc; |
6e44867b | 830 | struct tipc_uaddr ua; |
c3317f4d | 831 | bool res = true; |
b97bf3fd | 832 | |
09f78b85 | 833 | tipc_uaddr(&ua, TIPC_SERVICE_RANGE, TIPC_NODE_SCOPE, type, |
429189ac | 834 | sub->s.seq.lower, sub->s.seq.upper); |
4ac1c8d0 | 835 | spin_lock_bh(&tn->nametbl_lock); |
6e44867b | 836 | sc = tipc_service_find(sub->net, &ua); |
218527fe | 837 | if (!sc) |
6e44867b | 838 | sc = tipc_service_create(sub->net, &ua); |
218527fe JM |
839 | if (sc) { |
840 | spin_lock_bh(&sc->lock); | |
841 | tipc_service_subscribe(sc, sub); | |
842 | spin_unlock_bh(&sc->lock); | |
c4307285 | 843 | } else { |
429189ac JM |
844 | pr_warn("Failed to subscribe for {%u,%u,%u}\n", |
845 | type, sub->s.seq.lower, sub->s.seq.upper); | |
c3317f4d | 846 | res = false; |
c4307285 | 847 | } |
4ac1c8d0 | 848 | spin_unlock_bh(&tn->nametbl_lock); |
c3317f4d | 849 | return res; |
b97bf3fd PL |
850 | } |
851 | ||
852 | /** | |
4323add6 | 853 | * tipc_nametbl_unsubscribe - remove a subscription object from name table |
5c5d6796 | 854 | * @sub: subscription to remove |
b97bf3fd | 855 | */ |
8985ecc7 | 856 | void tipc_nametbl_unsubscribe(struct tipc_subscription *sub) |
b97bf3fd | 857 | { |
5c45ab24 | 858 | struct tipc_net *tn = tipc_net(sub->net); |
218527fe | 859 | struct tipc_service *sc; |
6e44867b | 860 | struct tipc_uaddr ua; |
b97bf3fd | 861 | |
429189ac JM |
862 | tipc_uaddr(&ua, TIPC_SERVICE_RANGE, TIPC_NODE_SCOPE, |
863 | sub->s.seq.type, sub->s.seq.lower, sub->s.seq.upper); | |
4ac1c8d0 | 864 | spin_lock_bh(&tn->nametbl_lock); |
6e44867b | 865 | sc = tipc_service_find(sub->net, &ua); |
218527fe JM |
866 | if (!sc) |
867 | goto exit; | |
868 | ||
869 | spin_lock_bh(&sc->lock); | |
870 | list_del_init(&sub->service_list); | |
871 | tipc_sub_put(sub); | |
872 | ||
873 | /* Delete service item if no more publications and subscriptions */ | |
874 | if (RB_EMPTY_ROOT(&sc->ranges) && list_empty(&sc->subscriptions)) { | |
875 | hlist_del_init_rcu(&sc->service_list); | |
876 | kfree_rcu(sc, rcu); | |
c4307285 | 877 | } |
218527fe JM |
878 | spin_unlock_bh(&sc->lock); |
879 | exit: | |
4ac1c8d0 | 880 | spin_unlock_bh(&tn->nametbl_lock); |
b97bf3fd PL |
881 | } |
882 | ||
4ac1c8d0 | 883 | int tipc_nametbl_init(struct net *net) |
b97bf3fd | 884 | { |
218527fe JM |
885 | struct tipc_net *tn = tipc_net(net); |
886 | struct name_table *nt; | |
993bfe5d YX |
887 | int i; |
888 | ||
04b9ce48 | 889 | nt = kzalloc(sizeof(*nt), GFP_KERNEL); |
218527fe | 890 | if (!nt) |
b97bf3fd PL |
891 | return -ENOMEM; |
892 | ||
993bfe5d | 893 | for (i = 0; i < TIPC_NAMETBL_SIZE; i++) |
218527fe | 894 | INIT_HLIST_HEAD(&nt->services[i]); |
993bfe5d | 895 | |
218527fe JM |
896 | INIT_LIST_HEAD(&nt->node_scope); |
897 | INIT_LIST_HEAD(&nt->cluster_scope); | |
988f3f16 | 898 | rwlock_init(&nt->cluster_scope_lock); |
218527fe | 899 | tn->nametbl = nt; |
4ac1c8d0 | 900 | spin_lock_init(&tn->nametbl_lock); |
b97bf3fd PL |
901 | return 0; |
902 | } | |
903 | ||
1bb8dce5 | 904 | /** |
5c5d6796 RD |
905 | * tipc_service_delete - purge all publications for a service and delete it |
906 | * @net: the associated network namespace | |
907 | * @sc: tipc_service to delete | |
1bb8dce5 | 908 | */ |
218527fe | 909 | static void tipc_service_delete(struct net *net, struct tipc_service *sc) |
1bb8dce5 | 910 | { |
218527fe | 911 | struct service_range *sr, *tmpr; |
be47e41d | 912 | struct publication *p, *tmp; |
218527fe JM |
913 | |
914 | spin_lock_bh(&sc->lock); | |
915 | rbtree_postorder_for_each_entry_safe(sr, tmpr, &sc->ranges, tree_node) { | |
be47e41d | 916 | list_for_each_entry_safe(p, tmp, &sr->all_publ, all_publ) { |
2c98da07 | 917 | tipc_service_remove_publ(sr, &p->sk, p->key); |
218527fe JM |
918 | kfree_rcu(p, rcu); |
919 | } | |
d5162f34 | 920 | rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); |
be47e41d | 921 | kfree(sr); |
1bb8dce5 | 922 | } |
218527fe JM |
923 | hlist_del_init_rcu(&sc->service_list); |
924 | spin_unlock_bh(&sc->lock); | |
925 | kfree_rcu(sc, rcu); | |
1bb8dce5 EH |
926 | } |
927 | ||
4ac1c8d0 | 928 | void tipc_nametbl_stop(struct net *net) |
b97bf3fd | 929 | { |
218527fe JM |
930 | struct name_table *nt = tipc_name_table(net); |
931 | struct tipc_net *tn = tipc_net(net); | |
932 | struct hlist_head *service_head; | |
933 | struct tipc_service *service; | |
b97bf3fd PL |
934 | u32 i; |
935 | ||
1bb8dce5 EH |
936 | /* Verify name table is empty and purge any lingering |
937 | * publications, then release the name table | |
938 | */ | |
4ac1c8d0 | 939 | spin_lock_bh(&tn->nametbl_lock); |
f046e7d9 | 940 | for (i = 0; i < TIPC_NAMETBL_SIZE; i++) { |
218527fe | 941 | if (hlist_empty(&nt->services[i])) |
f705ab95 | 942 | continue; |
218527fe JM |
943 | service_head = &nt->services[i]; |
944 | hlist_for_each_entry_rcu(service, service_head, service_list) { | |
945 | tipc_service_delete(net, service); | |
1bb8dce5 | 946 | } |
b97bf3fd | 947 | } |
4ac1c8d0 | 948 | spin_unlock_bh(&tn->nametbl_lock); |
993bfe5d | 949 | |
97ede29e | 950 | synchronize_net(); |
218527fe | 951 | kfree(nt); |
b97bf3fd | 952 | } |
1593123a | 953 | |
d8182804 | 954 | static int __tipc_nl_add_nametable_publ(struct tipc_nl_msg *msg, |
218527fe JM |
955 | struct tipc_service *service, |
956 | struct service_range *sr, | |
957 | u32 *last_key) | |
1593123a | 958 | { |
1593123a | 959 | struct publication *p; |
218527fe JM |
960 | struct nlattr *attrs; |
961 | struct nlattr *b; | |
962 | void *hdr; | |
1593123a | 963 | |
218527fe JM |
964 | if (*last_key) { |
965 | list_for_each_entry(p, &sr->all_publ, all_publ) | |
966 | if (p->key == *last_key) | |
1593123a | 967 | break; |
218527fe | 968 | if (p->key != *last_key) |
1593123a RA |
969 | return -EPIPE; |
970 | } else { | |
218527fe JM |
971 | p = list_first_entry(&sr->all_publ, |
972 | struct publication, | |
e50e73e1 | 973 | all_publ); |
1593123a RA |
974 | } |
975 | ||
218527fe JM |
976 | list_for_each_entry_from(p, &sr->all_publ, all_publ) { |
977 | *last_key = p->key; | |
1593123a RA |
978 | |
979 | hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, | |
bfb3e5dd | 980 | &tipc_genl_family, NLM_F_MULTI, |
1593123a RA |
981 | TIPC_NL_NAME_TABLE_GET); |
982 | if (!hdr) | |
983 | return -EMSGSIZE; | |
984 | ||
ae0be8de | 985 | attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_NAME_TABLE); |
1593123a RA |
986 | if (!attrs) |
987 | goto msg_full; | |
988 | ||
ae0be8de | 989 | b = nla_nest_start_noflag(msg->skb, TIPC_NLA_NAME_TABLE_PUBL); |
218527fe | 990 | if (!b) |
1593123a RA |
991 | goto attr_msg_full; |
992 | ||
218527fe | 993 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_TYPE, service->type)) |
1593123a | 994 | goto publ_msg_full; |
218527fe | 995 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_LOWER, sr->lower)) |
1593123a | 996 | goto publ_msg_full; |
218527fe | 997 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_UPPER, sr->upper)) |
1593123a RA |
998 | goto publ_msg_full; |
999 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_SCOPE, p->scope)) | |
1000 | goto publ_msg_full; | |
998d3907 | 1001 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_NODE, p->sk.node)) |
1593123a | 1002 | goto publ_msg_full; |
998d3907 | 1003 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_REF, p->sk.ref)) |
1593123a RA |
1004 | goto publ_msg_full; |
1005 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_KEY, p->key)) | |
1006 | goto publ_msg_full; | |
1007 | ||
218527fe | 1008 | nla_nest_end(msg->skb, b); |
1593123a RA |
1009 | nla_nest_end(msg->skb, attrs); |
1010 | genlmsg_end(msg->skb, hdr); | |
1011 | } | |
218527fe | 1012 | *last_key = 0; |
1593123a RA |
1013 | |
1014 | return 0; | |
1015 | ||
1016 | publ_msg_full: | |
218527fe | 1017 | nla_nest_cancel(msg->skb, b); |
1593123a RA |
1018 | attr_msg_full: |
1019 | nla_nest_cancel(msg->skb, attrs); | |
1020 | msg_full: | |
1021 | genlmsg_cancel(msg->skb, hdr); | |
1022 | ||
1023 | return -EMSGSIZE; | |
1024 | } | |
1025 | ||
218527fe JM |
1026 | static int __tipc_nl_service_range_list(struct tipc_nl_msg *msg, |
1027 | struct tipc_service *sc, | |
1028 | u32 *last_lower, u32 *last_key) | |
1593123a | 1029 | { |
218527fe JM |
1030 | struct service_range *sr; |
1031 | struct rb_node *n; | |
1593123a RA |
1032 | int err; |
1033 | ||
218527fe JM |
1034 | for (n = rb_first(&sc->ranges); n; n = rb_next(n)) { |
1035 | sr = container_of(n, struct service_range, tree_node); | |
1036 | if (sr->lower < *last_lower) | |
1037 | continue; | |
1038 | err = __tipc_nl_add_nametable_publ(msg, sc, sr, last_key); | |
1593123a | 1039 | if (err) { |
218527fe | 1040 | *last_lower = sr->lower; |
1593123a RA |
1041 | return err; |
1042 | } | |
1043 | } | |
1044 | *last_lower = 0; | |
1593123a RA |
1045 | return 0; |
1046 | } | |
1047 | ||
218527fe JM |
1048 | static int tipc_nl_service_list(struct net *net, struct tipc_nl_msg *msg, |
1049 | u32 *last_type, u32 *last_lower, u32 *last_key) | |
1593123a | 1050 | { |
218527fe JM |
1051 | struct tipc_net *tn = tipc_net(net); |
1052 | struct tipc_service *service = NULL; | |
1053 | struct hlist_head *head; | |
6e44867b | 1054 | struct tipc_uaddr ua; |
1593123a RA |
1055 | int err; |
1056 | int i; | |
1057 | ||
1058 | if (*last_type) | |
1059 | i = hash(*last_type); | |
1060 | else | |
1061 | i = 0; | |
1062 | ||
1063 | for (; i < TIPC_NAMETBL_SIZE; i++) { | |
218527fe | 1064 | head = &tn->nametbl->services[i]; |
1593123a | 1065 | |
d1841533 HL |
1066 | if (*last_type || |
1067 | (!i && *last_key && (*last_lower == *last_key))) { | |
6e44867b JM |
1068 | tipc_uaddr(&ua, TIPC_SERVICE_RANGE, TIPC_NODE_SCOPE, |
1069 | *last_type, *last_lower, *last_lower); | |
1070 | service = tipc_service_find(net, &ua); | |
218527fe | 1071 | if (!service) |
1593123a RA |
1072 | return -EPIPE; |
1073 | } else { | |
218527fe | 1074 | hlist_for_each_entry_rcu(service, head, service_list) |
97ede29e | 1075 | break; |
218527fe | 1076 | if (!service) |
1593123a RA |
1077 | continue; |
1078 | } | |
1079 | ||
218527fe JM |
1080 | hlist_for_each_entry_from_rcu(service, service_list) { |
1081 | spin_lock_bh(&service->lock); | |
1082 | err = __tipc_nl_service_range_list(msg, service, | |
1083 | last_lower, | |
1084 | last_key); | |
1593123a RA |
1085 | |
1086 | if (err) { | |
218527fe JM |
1087 | *last_type = service->type; |
1088 | spin_unlock_bh(&service->lock); | |
1593123a RA |
1089 | return err; |
1090 | } | |
218527fe | 1091 | spin_unlock_bh(&service->lock); |
1593123a RA |
1092 | } |
1093 | *last_type = 0; | |
1094 | } | |
1095 | return 0; | |
1096 | } | |
1097 | ||
1098 | int tipc_nl_name_table_dump(struct sk_buff *skb, struct netlink_callback *cb) | |
1099 | { | |
218527fe | 1100 | struct net *net = sock_net(skb->sk); |
1593123a RA |
1101 | u32 last_type = cb->args[0]; |
1102 | u32 last_lower = cb->args[1]; | |
218527fe JM |
1103 | u32 last_key = cb->args[2]; |
1104 | int done = cb->args[3]; | |
1593123a | 1105 | struct tipc_nl_msg msg; |
218527fe | 1106 | int err; |
1593123a RA |
1107 | |
1108 | if (done) | |
1109 | return 0; | |
1110 | ||
1111 | msg.skb = skb; | |
1112 | msg.portid = NETLINK_CB(cb->skb).portid; | |
1113 | msg.seq = cb->nlh->nlmsg_seq; | |
1114 | ||
97ede29e | 1115 | rcu_read_lock(); |
218527fe JM |
1116 | err = tipc_nl_service_list(net, &msg, &last_type, |
1117 | &last_lower, &last_key); | |
1593123a RA |
1118 | if (!err) { |
1119 | done = 1; | |
1120 | } else if (err != -EMSGSIZE) { | |
1121 | /* We never set seq or call nl_dump_check_consistent() this | |
1122 | * means that setting prev_seq here will cause the consistence | |
1123 | * check to fail in the netlink callback handler. Resulting in | |
1124 | * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if | |
1125 | * we got an error. | |
1126 | */ | |
1127 | cb->prev_seq = 1; | |
1128 | } | |
97ede29e | 1129 | rcu_read_unlock(); |
1593123a RA |
1130 | |
1131 | cb->args[0] = last_type; | |
1132 | cb->args[1] = last_lower; | |
218527fe | 1133 | cb->args[2] = last_key; |
1593123a RA |
1134 | cb->args[3] = done; |
1135 | ||
1136 | return skb->len; | |
1137 | } | |
3c724acd | 1138 | |
a80ae530 | 1139 | struct tipc_dest *tipc_dest_find(struct list_head *l, u32 node, u32 port) |
3c724acd | 1140 | { |
a80ae530 | 1141 | struct tipc_dest *dst; |
3c724acd | 1142 | |
a80ae530 | 1143 | list_for_each_entry(dst, l, list) { |
30935198 HB |
1144 | if (dst->node == node && dst->port == port) |
1145 | return dst; | |
3c724acd | 1146 | } |
a80ae530 | 1147 | return NULL; |
4d8642d8 JPM |
1148 | } |
1149 | ||
a80ae530 | 1150 | bool tipc_dest_push(struct list_head *l, u32 node, u32 port) |
4d8642d8 | 1151 | { |
a80ae530 | 1152 | struct tipc_dest *dst; |
4d8642d8 | 1153 | |
a80ae530 | 1154 | if (tipc_dest_find(l, node, port)) |
4d8642d8 JPM |
1155 | return false; |
1156 | ||
a80ae530 JM |
1157 | dst = kmalloc(sizeof(*dst), GFP_ATOMIC); |
1158 | if (unlikely(!dst)) | |
1159 | return false; | |
30935198 HB |
1160 | dst->node = node; |
1161 | dst->port = port; | |
a80ae530 | 1162 | list_add(&dst->list, l); |
4d8642d8 JPM |
1163 | return true; |
1164 | } | |
1165 | ||
a80ae530 | 1166 | bool tipc_dest_pop(struct list_head *l, u32 *node, u32 *port) |
4d8642d8 | 1167 | { |
a80ae530 | 1168 | struct tipc_dest *dst; |
4d8642d8 JPM |
1169 | |
1170 | if (list_empty(l)) | |
a80ae530 JM |
1171 | return false; |
1172 | dst = list_first_entry(l, typeof(*dst), list); | |
1173 | if (port) | |
1174 | *port = dst->port; | |
1175 | if (node) | |
1176 | *node = dst->node; | |
1177 | list_del(&dst->list); | |
1178 | kfree(dst); | |
1179 | return true; | |
4d8642d8 JPM |
1180 | } |
1181 | ||
a80ae530 | 1182 | bool tipc_dest_del(struct list_head *l, u32 node, u32 port) |
4d8642d8 | 1183 | { |
a80ae530 | 1184 | struct tipc_dest *dst; |
4d8642d8 | 1185 | |
a80ae530 JM |
1186 | dst = tipc_dest_find(l, node, port); |
1187 | if (!dst) | |
1188 | return false; | |
1189 | list_del(&dst->list); | |
1190 | kfree(dst); | |
1191 | return true; | |
4d8642d8 JPM |
1192 | } |
1193 | ||
a80ae530 | 1194 | void tipc_dest_list_purge(struct list_head *l) |
4d8642d8 | 1195 | { |
a80ae530 | 1196 | struct tipc_dest *dst, *tmp; |
4d8642d8 | 1197 | |
a80ae530 JM |
1198 | list_for_each_entry_safe(dst, tmp, l, list) { |
1199 | list_del(&dst->list); | |
1200 | kfree(dst); | |
3c724acd JPM |
1201 | } |
1202 | } | |
1203 | ||
a80ae530 | 1204 | int tipc_dest_list_len(struct list_head *l) |
3c724acd | 1205 | { |
a80ae530 | 1206 | struct tipc_dest *dst; |
4d8642d8 | 1207 | int i = 0; |
3c724acd | 1208 | |
a80ae530 | 1209 | list_for_each_entry(dst, l, list) { |
4d8642d8 | 1210 | i++; |
3c724acd | 1211 | } |
4d8642d8 | 1212 | return i; |
3c724acd | 1213 | } |