]>
Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/name_table.c: TIPC name table code | |
c4307285 | 3 | * |
3c724acd | 4 | * Copyright (c) 2000-2006, 2014-2015, Ericsson AB |
993bfe5d | 5 | * Copyright (c) 2004-2008, 2010-2014, 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 | ||
4ac1c8d0 | 37 | #include <net/sock.h> |
b97bf3fd | 38 | #include "core.h" |
22ae7cff | 39 | #include "netlink.h" |
b97bf3fd PL |
40 | #include "name_table.h" |
41 | #include "name_distr.h" | |
b97bf3fd | 42 | #include "subscr.h" |
1da46568 | 43 | #include "bcast.h" |
22ae7cff | 44 | #include "addr.h" |
1d7e1c25 | 45 | #include "node.h" |
22ae7cff | 46 | #include <net/genetlink.h> |
b97bf3fd | 47 | |
f046e7d9 | 48 | #define TIPC_NAMETBL_SIZE 1024 /* must be a power of 2 */ |
b97bf3fd PL |
49 | |
50 | /** | |
b52124a5 | 51 | * struct name_info - name sequence publication info |
968edbe1 AS |
52 | * @node_list: circular list of publications made by own node |
53 | * @cluster_list: circular list of publications made by own cluster | |
54 | * @zone_list: circular list of publications made by own zone | |
55 | * @node_list_size: number of entries in "node_list" | |
56 | * @cluster_list_size: number of entries in "cluster_list" | |
57 | * @zone_list_size: number of entries in "zone_list" | |
58 | * | |
59 | * Note: The zone list always contains at least one entry, since all | |
60 | * publications of the associated name sequence belong to it. | |
61 | * (The cluster and node lists may be empty.) | |
b97bf3fd | 62 | */ |
b52124a5 | 63 | struct name_info { |
f6f0a4d2 AS |
64 | struct list_head node_list; |
65 | struct list_head cluster_list; | |
66 | struct list_head zone_list; | |
968edbe1 AS |
67 | u32 node_list_size; |
68 | u32 cluster_list_size; | |
69 | u32 zone_list_size; | |
b97bf3fd PL |
70 | }; |
71 | ||
b52124a5 AS |
72 | /** |
73 | * struct sub_seq - container for all published instances of a name sequence | |
74 | * @lower: name sequence lower bound | |
75 | * @upper: name sequence upper bound | |
76 | * @info: pointer to name sequence publication info | |
77 | */ | |
b52124a5 AS |
78 | struct sub_seq { |
79 | u32 lower; | |
80 | u32 upper; | |
81 | struct name_info *info; | |
82 | }; | |
83 | ||
c4307285 | 84 | /** |
b97bf3fd PL |
85 | * struct name_seq - container for all published instances of a name type |
86 | * @type: 32 bit 'type' value for name sequence | |
87 | * @sseq: pointer to dynamically-sized array of sub-sequences of this 'type'; | |
88 | * sub-sequences are sorted in ascending order | |
89 | * @alloc: number of sub-sequences currently in array | |
f131072c | 90 | * @first_free: array index of first unused sub-sequence entry |
b97bf3fd PL |
91 | * @ns_list: links to adjacent name sequences in hash chain |
92 | * @subscriptions: list of subscriptions for this 'type' | |
307fdf5e | 93 | * @lock: spinlock controlling access to publication lists of all sub-sequences |
97ede29e | 94 | * @rcu: RCU callback head used for deferred freeing |
b97bf3fd | 95 | */ |
b97bf3fd PL |
96 | struct name_seq { |
97 | u32 type; | |
98 | struct sub_seq *sseqs; | |
99 | u32 alloc; | |
100 | u32 first_free; | |
101 | struct hlist_node ns_list; | |
102 | struct list_head subscriptions; | |
103 | spinlock_t lock; | |
97ede29e | 104 | struct rcu_head rcu; |
b97bf3fd PL |
105 | }; |
106 | ||
05790c64 | 107 | static int hash(int x) |
b97bf3fd | 108 | { |
f046e7d9 | 109 | return x & (TIPC_NAMETBL_SIZE - 1); |
b97bf3fd PL |
110 | } |
111 | ||
112 | /** | |
113 | * publ_create - create a publication structure | |
114 | */ | |
c4307285 YH |
115 | static struct publication *publ_create(u32 type, u32 lower, u32 upper, |
116 | u32 scope, u32 node, u32 port_ref, | |
b97bf3fd PL |
117 | u32 key) |
118 | { | |
0da974f4 | 119 | struct publication *publ = kzalloc(sizeof(*publ), GFP_ATOMIC); |
b97bf3fd | 120 | if (publ == NULL) { |
2cf8aa19 | 121 | pr_warn("Publication creation failure, no memory\n"); |
1fc54d8f | 122 | return NULL; |
b97bf3fd PL |
123 | } |
124 | ||
b97bf3fd PL |
125 | publ->type = type; |
126 | publ->lower = lower; | |
127 | publ->upper = upper; | |
128 | publ->scope = scope; | |
129 | publ->node = node; | |
130 | publ->ref = port_ref; | |
131 | publ->key = key; | |
b97bf3fd | 132 | INIT_LIST_HEAD(&publ->pport_list); |
b97bf3fd PL |
133 | return publ; |
134 | } | |
135 | ||
136 | /** | |
4323add6 | 137 | * tipc_subseq_alloc - allocate a specified number of sub-sequence structures |
b97bf3fd | 138 | */ |
988f088a | 139 | static struct sub_seq *tipc_subseq_alloc(u32 cnt) |
b97bf3fd | 140 | { |
0cee6bbe | 141 | return kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC); |
b97bf3fd PL |
142 | } |
143 | ||
144 | /** | |
4323add6 | 145 | * tipc_nameseq_create - create a name sequence structure for the specified 'type' |
c4307285 | 146 | * |
b97bf3fd PL |
147 | * Allocates a single sub-sequence structure and sets it to all 0's. |
148 | */ | |
988f088a | 149 | static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head) |
b97bf3fd | 150 | { |
0da974f4 | 151 | struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC); |
4323add6 | 152 | struct sub_seq *sseq = tipc_subseq_alloc(1); |
b97bf3fd PL |
153 | |
154 | if (!nseq || !sseq) { | |
2cf8aa19 | 155 | pr_warn("Name sequence creation failed, no memory\n"); |
b97bf3fd PL |
156 | kfree(nseq); |
157 | kfree(sseq); | |
1fc54d8f | 158 | return NULL; |
b97bf3fd PL |
159 | } |
160 | ||
34af946a | 161 | spin_lock_init(&nseq->lock); |
b97bf3fd PL |
162 | nseq->type = type; |
163 | nseq->sseqs = sseq; | |
b97bf3fd PL |
164 | nseq->alloc = 1; |
165 | INIT_HLIST_NODE(&nseq->ns_list); | |
166 | INIT_LIST_HEAD(&nseq->subscriptions); | |
97ede29e | 167 | hlist_add_head_rcu(&nseq->ns_list, seq_head); |
b97bf3fd PL |
168 | return nseq; |
169 | } | |
170 | ||
2c53040f | 171 | /** |
b97bf3fd | 172 | * nameseq_find_subseq - find sub-sequence (if any) matching a name instance |
c4307285 | 173 | * |
b97bf3fd PL |
174 | * Very time-critical, so binary searches through sub-sequence array. |
175 | */ | |
05790c64 SR |
176 | static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq, |
177 | u32 instance) | |
b97bf3fd PL |
178 | { |
179 | struct sub_seq *sseqs = nseq->sseqs; | |
180 | int low = 0; | |
181 | int high = nseq->first_free - 1; | |
182 | int mid; | |
183 | ||
184 | while (low <= high) { | |
185 | mid = (low + high) / 2; | |
186 | if (instance < sseqs[mid].lower) | |
187 | high = mid - 1; | |
188 | else if (instance > sseqs[mid].upper) | |
189 | low = mid + 1; | |
190 | else | |
191 | return &sseqs[mid]; | |
192 | } | |
1fc54d8f | 193 | return NULL; |
b97bf3fd PL |
194 | } |
195 | ||
196 | /** | |
197 | * nameseq_locate_subseq - determine position of name instance in sub-sequence | |
c4307285 | 198 | * |
b97bf3fd PL |
199 | * Returns index in sub-sequence array of the entry that contains the specified |
200 | * instance value; if no entry contains that value, returns the position | |
201 | * where a new entry for it would be inserted in the array. | |
202 | * | |
203 | * Note: Similar to binary search code for locating a sub-sequence. | |
204 | */ | |
b97bf3fd PL |
205 | static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance) |
206 | { | |
207 | struct sub_seq *sseqs = nseq->sseqs; | |
208 | int low = 0; | |
209 | int high = nseq->first_free - 1; | |
210 | int mid; | |
211 | ||
212 | while (low <= high) { | |
213 | mid = (low + high) / 2; | |
214 | if (instance < sseqs[mid].lower) | |
215 | high = mid - 1; | |
216 | else if (instance > sseqs[mid].upper) | |
217 | low = mid + 1; | |
218 | else | |
219 | return mid; | |
220 | } | |
221 | return low; | |
222 | } | |
223 | ||
224 | /** | |
617d3c7a | 225 | * tipc_nameseq_insert_publ |
b97bf3fd | 226 | */ |
34747539 YX |
227 | static struct publication *tipc_nameseq_insert_publ(struct net *net, |
228 | struct name_seq *nseq, | |
229 | u32 type, u32 lower, | |
230 | u32 upper, u32 scope, | |
231 | u32 node, u32 port, u32 key) | |
b97bf3fd | 232 | { |
fead3909 PG |
233 | struct tipc_subscription *s; |
234 | struct tipc_subscription *st; | |
b97bf3fd PL |
235 | struct publication *publ; |
236 | struct sub_seq *sseq; | |
b52124a5 | 237 | struct name_info *info; |
b97bf3fd PL |
238 | int created_subseq = 0; |
239 | ||
b97bf3fd | 240 | sseq = nameseq_find_subseq(nseq, lower); |
b97bf3fd PL |
241 | if (sseq) { |
242 | ||
243 | /* Lower end overlaps existing entry => need an exact match */ | |
b97bf3fd | 244 | if ((sseq->lower != lower) || (sseq->upper != upper)) { |
1fc54d8f | 245 | return NULL; |
b97bf3fd | 246 | } |
b52124a5 AS |
247 | |
248 | info = sseq->info; | |
f80c24d9 AS |
249 | |
250 | /* Check if an identical publication already exists */ | |
251 | list_for_each_entry(publ, &info->zone_list, zone_list) { | |
252 | if ((publ->ref == port) && (publ->key == key) && | |
253 | (!publ->node || (publ->node == node))) | |
254 | return NULL; | |
255 | } | |
b97bf3fd PL |
256 | } else { |
257 | u32 inspos; | |
258 | struct sub_seq *freesseq; | |
259 | ||
260 | /* Find where lower end should be inserted */ | |
b97bf3fd PL |
261 | inspos = nameseq_locate_subseq(nseq, lower); |
262 | ||
263 | /* Fail if upper end overlaps into an existing entry */ | |
b97bf3fd PL |
264 | if ((inspos < nseq->first_free) && |
265 | (upper >= nseq->sseqs[inspos].lower)) { | |
1fc54d8f | 266 | return NULL; |
b97bf3fd PL |
267 | } |
268 | ||
269 | /* Ensure there is space for new sub-sequence */ | |
b97bf3fd | 270 | if (nseq->first_free == nseq->alloc) { |
9ab230f8 AS |
271 | struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2); |
272 | ||
273 | if (!sseqs) { | |
2cf8aa19 EH |
274 | pr_warn("Cannot publish {%u,%u,%u}, no memory\n", |
275 | type, lower, upper); | |
1fc54d8f | 276 | return NULL; |
b97bf3fd | 277 | } |
9ab230f8 AS |
278 | memcpy(sseqs, nseq->sseqs, |
279 | nseq->alloc * sizeof(struct sub_seq)); | |
280 | kfree(nseq->sseqs); | |
281 | nseq->sseqs = sseqs; | |
282 | nseq->alloc *= 2; | |
b97bf3fd | 283 | } |
b97bf3fd | 284 | |
b52124a5 AS |
285 | info = kzalloc(sizeof(*info), GFP_ATOMIC); |
286 | if (!info) { | |
2cf8aa19 EH |
287 | pr_warn("Cannot publish {%u,%u,%u}, no memory\n", |
288 | type, lower, upper); | |
b52124a5 AS |
289 | return NULL; |
290 | } | |
291 | ||
f6f0a4d2 AS |
292 | INIT_LIST_HEAD(&info->node_list); |
293 | INIT_LIST_HEAD(&info->cluster_list); | |
294 | INIT_LIST_HEAD(&info->zone_list); | |
295 | ||
b97bf3fd | 296 | /* Insert new sub-sequence */ |
b97bf3fd PL |
297 | sseq = &nseq->sseqs[inspos]; |
298 | freesseq = &nseq->sseqs[nseq->first_free]; | |
0e65967e AS |
299 | memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq)); |
300 | memset(sseq, 0, sizeof(*sseq)); | |
b97bf3fd PL |
301 | nseq->first_free++; |
302 | sseq->lower = lower; | |
303 | sseq->upper = upper; | |
b52124a5 | 304 | sseq->info = info; |
b97bf3fd PL |
305 | created_subseq = 1; |
306 | } | |
b97bf3fd | 307 | |
617d3c7a | 308 | /* Insert a publication */ |
b97bf3fd PL |
309 | publ = publ_create(type, lower, upper, scope, node, port, key); |
310 | if (!publ) | |
1fc54d8f | 311 | return NULL; |
b97bf3fd | 312 | |
f6f0a4d2 | 313 | list_add(&publ->zone_list, &info->zone_list); |
b52124a5 | 314 | info->zone_list_size++; |
b97bf3fd | 315 | |
34747539 | 316 | if (in_own_cluster(net, node)) { |
f6f0a4d2 | 317 | list_add(&publ->cluster_list, &info->cluster_list); |
b52124a5 | 318 | info->cluster_list_size++; |
b97bf3fd PL |
319 | } |
320 | ||
34747539 | 321 | if (in_own_node(net, node)) { |
f6f0a4d2 | 322 | list_add(&publ->node_list, &info->node_list); |
b52124a5 | 323 | info->node_list_size++; |
b97bf3fd PL |
324 | } |
325 | ||
617d3c7a | 326 | /* Any subscriptions waiting for notification? */ |
b97bf3fd | 327 | list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { |
57f1d186 YX |
328 | tipc_subscrp_report_overlap(s, publ->lower, publ->upper, |
329 | TIPC_PUBLISHED, publ->ref, | |
330 | publ->node, created_subseq); | |
b97bf3fd PL |
331 | } |
332 | return publ; | |
333 | } | |
334 | ||
335 | /** | |
617d3c7a | 336 | * tipc_nameseq_remove_publ |
c4307285 | 337 | * |
f131072c AS |
338 | * NOTE: There may be cases where TIPC is asked to remove a publication |
339 | * that is not in the name table. For example, if another node issues a | |
340 | * publication for a name sequence that overlaps an existing name sequence | |
341 | * the publication will not be recorded, which means the publication won't | |
342 | * be found when the name sequence is later withdrawn by that node. | |
343 | * A failed withdraw request simply returns a failure indication and lets the | |
344 | * caller issue any error or warning messages associated with such a problem. | |
b97bf3fd | 345 | */ |
34747539 YX |
346 | static struct publication *tipc_nameseq_remove_publ(struct net *net, |
347 | struct name_seq *nseq, | |
348 | u32 inst, u32 node, | |
349 | u32 ref, u32 key) | |
b97bf3fd PL |
350 | { |
351 | struct publication *publ; | |
b97bf3fd | 352 | struct sub_seq *sseq = nameseq_find_subseq(nseq, inst); |
b52124a5 | 353 | struct name_info *info; |
b97bf3fd | 354 | struct sub_seq *free; |
fead3909 | 355 | struct tipc_subscription *s, *st; |
b97bf3fd PL |
356 | int removed_subseq = 0; |
357 | ||
f131072c | 358 | if (!sseq) |
1fc54d8f | 359 | return NULL; |
f131072c | 360 | |
b52124a5 AS |
361 | info = sseq->info; |
362 | ||
f6f0a4d2 | 363 | /* Locate publication, if it exists */ |
f6f0a4d2 AS |
364 | list_for_each_entry(publ, &info->zone_list, zone_list) { |
365 | if ((publ->key == key) && (publ->ref == ref) && | |
366 | (!publ->node || (publ->node == node))) | |
367 | goto found; | |
368 | } | |
369 | return NULL; | |
c4307285 | 370 | |
f6f0a4d2 AS |
371 | found: |
372 | /* Remove publication from zone scope list */ | |
f6f0a4d2 | 373 | list_del(&publ->zone_list); |
b52124a5 | 374 | info->zone_list_size--; |
b97bf3fd | 375 | |
f131072c | 376 | /* Remove publication from cluster scope list, if present */ |
34747539 | 377 | if (in_own_cluster(net, node)) { |
f6f0a4d2 | 378 | list_del(&publ->cluster_list); |
b52124a5 | 379 | info->cluster_list_size--; |
b97bf3fd | 380 | } |
f131072c AS |
381 | |
382 | /* Remove publication from node scope list, if present */ | |
34747539 | 383 | if (in_own_node(net, node)) { |
f6f0a4d2 | 384 | list_del(&publ->node_list); |
b52124a5 | 385 | info->node_list_size--; |
b97bf3fd | 386 | } |
b97bf3fd | 387 | |
f131072c | 388 | /* Contract subseq list if no more publications for that subseq */ |
f6f0a4d2 | 389 | if (list_empty(&info->zone_list)) { |
b52124a5 | 390 | kfree(info); |
b97bf3fd | 391 | free = &nseq->sseqs[nseq->first_free--]; |
0e65967e | 392 | memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq)); |
b97bf3fd PL |
393 | removed_subseq = 1; |
394 | } | |
395 | ||
f131072c | 396 | /* Notify any waiting subscriptions */ |
b97bf3fd | 397 | list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { |
57f1d186 YX |
398 | tipc_subscrp_report_overlap(s, publ->lower, publ->upper, |
399 | TIPC_WITHDRAWN, publ->ref, | |
400 | publ->node, removed_subseq); | |
b97bf3fd | 401 | } |
f131072c | 402 | |
b97bf3fd PL |
403 | return publ; |
404 | } | |
405 | ||
406 | /** | |
2c53040f | 407 | * tipc_nameseq_subscribe - attach a subscription, and issue |
b97bf3fd PL |
408 | * the prescribed number of events if there is any sub- |
409 | * sequence overlapping with the requested sequence | |
410 | */ | |
fead3909 | 411 | static void tipc_nameseq_subscribe(struct name_seq *nseq, |
ae8509c4 | 412 | struct tipc_subscription *s) |
b97bf3fd PL |
413 | { |
414 | struct sub_seq *sseq = nseq->sseqs; | |
a4273c73 PB |
415 | struct tipc_name_seq ns; |
416 | ||
417 | tipc_subscrp_convert_seq(&s->evt.s.seq, s->swap, &ns); | |
b97bf3fd | 418 | |
7efea60d | 419 | tipc_subscrp_get(s); |
b97bf3fd PL |
420 | list_add(&s->nameseq_list, &nseq->subscriptions); |
421 | ||
422 | if (!sseq) | |
423 | return; | |
424 | ||
425 | while (sseq != &nseq->sseqs[nseq->first_free]) { | |
a4273c73 | 426 | if (tipc_subscrp_check_overlap(&ns, sseq->lower, sseq->upper)) { |
f6f0a4d2 AS |
427 | struct publication *crs; |
428 | struct name_info *info = sseq->info; | |
b97bf3fd PL |
429 | int must_report = 1; |
430 | ||
f6f0a4d2 | 431 | list_for_each_entry(crs, &info->zone_list, zone_list) { |
57f1d186 YX |
432 | tipc_subscrp_report_overlap(s, sseq->lower, |
433 | sseq->upper, | |
434 | TIPC_PUBLISHED, | |
435 | crs->ref, crs->node, | |
436 | must_report); | |
b97bf3fd | 437 | must_report = 0; |
f6f0a4d2 | 438 | } |
b97bf3fd PL |
439 | } |
440 | sseq++; | |
441 | } | |
442 | } | |
443 | ||
4ac1c8d0 | 444 | static struct name_seq *nametbl_find_seq(struct net *net, u32 type) |
b97bf3fd | 445 | { |
4ac1c8d0 | 446 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
b97bf3fd | 447 | struct hlist_head *seq_head; |
b97bf3fd PL |
448 | struct name_seq *ns; |
449 | ||
4ac1c8d0 | 450 | seq_head = &tn->nametbl->seq_hlist[hash(type)]; |
97ede29e | 451 | hlist_for_each_entry_rcu(ns, seq_head, ns_list) { |
b29f1428 | 452 | if (ns->type == type) |
b97bf3fd | 453 | return ns; |
b97bf3fd PL |
454 | } |
455 | ||
1fc54d8f | 456 | return NULL; |
b97bf3fd PL |
457 | }; |
458 | ||
4ac1c8d0 YX |
459 | struct publication *tipc_nametbl_insert_publ(struct net *net, u32 type, |
460 | u32 lower, u32 upper, u32 scope, | |
461 | u32 node, u32 port, u32 key) | |
b97bf3fd | 462 | { |
4ac1c8d0 | 463 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
fb9962f3 | 464 | struct publication *publ; |
4ac1c8d0 | 465 | struct name_seq *seq = nametbl_find_seq(net, type); |
993bfe5d | 466 | int index = hash(type); |
b97bf3fd | 467 | |
8f177896 AS |
468 | if ((scope < TIPC_ZONE_SCOPE) || (scope > TIPC_NODE_SCOPE) || |
469 | (lower > upper)) { | |
2cf8aa19 EH |
470 | pr_debug("Failed to publish illegal {%u,%u,%u} with scope %u\n", |
471 | type, lower, upper, scope); | |
1fc54d8f | 472 | return NULL; |
b97bf3fd PL |
473 | } |
474 | ||
b29f1428 | 475 | if (!seq) |
4ac1c8d0 | 476 | seq = tipc_nameseq_create(type, &tn->nametbl->seq_hlist[index]); |
b97bf3fd | 477 | if (!seq) |
1fc54d8f | 478 | return NULL; |
b97bf3fd | 479 | |
fb9962f3 | 480 | spin_lock_bh(&seq->lock); |
34747539 | 481 | publ = tipc_nameseq_insert_publ(net, seq, type, lower, upper, |
4323add6 | 482 | scope, node, port, key); |
fb9962f3 YX |
483 | spin_unlock_bh(&seq->lock); |
484 | return publ; | |
b97bf3fd PL |
485 | } |
486 | ||
4ac1c8d0 YX |
487 | struct publication *tipc_nametbl_remove_publ(struct net *net, u32 type, |
488 | u32 lower, u32 node, u32 ref, | |
489 | u32 key) | |
b97bf3fd PL |
490 | { |
491 | struct publication *publ; | |
4ac1c8d0 | 492 | struct name_seq *seq = nametbl_find_seq(net, type); |
b97bf3fd PL |
493 | |
494 | if (!seq) | |
1fc54d8f | 495 | return NULL; |
b97bf3fd | 496 | |
fb9962f3 | 497 | spin_lock_bh(&seq->lock); |
34747539 | 498 | publ = tipc_nameseq_remove_publ(net, seq, lower, node, ref, key); |
fb9962f3 | 499 | if (!seq->first_free && list_empty(&seq->subscriptions)) { |
97ede29e | 500 | hlist_del_init_rcu(&seq->ns_list); |
fb9962f3 | 501 | kfree(seq->sseqs); |
97ede29e YX |
502 | spin_unlock_bh(&seq->lock); |
503 | kfree_rcu(seq, rcu); | |
fb9962f3 YX |
504 | return publ; |
505 | } | |
506 | spin_unlock_bh(&seq->lock); | |
b97bf3fd PL |
507 | return publ; |
508 | } | |
509 | ||
2c53040f | 510 | /** |
bc9f8143 | 511 | * tipc_nametbl_translate - perform name translation |
b97bf3fd | 512 | * |
bc9f8143 AS |
513 | * On entry, 'destnode' is the search domain used during translation. |
514 | * | |
515 | * On exit: | |
516 | * - if name translation is deferred to another node/cluster/zone, | |
517 | * leaves 'destnode' unchanged (will be non-zero) and returns 0 | |
518 | * - if name translation is attempted and succeeds, sets 'destnode' | |
519 | * to publishing node and returns port reference (will be non-zero) | |
520 | * - if name translation is attempted and fails, sets 'destnode' to 0 | |
521 | * and returns 0 | |
b97bf3fd | 522 | */ |
4ac1c8d0 YX |
523 | u32 tipc_nametbl_translate(struct net *net, u32 type, u32 instance, |
524 | u32 *destnode) | |
b97bf3fd | 525 | { |
34747539 | 526 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
b97bf3fd | 527 | struct sub_seq *sseq; |
b52124a5 | 528 | struct name_info *info; |
f6f0a4d2 | 529 | struct publication *publ; |
b97bf3fd | 530 | struct name_seq *seq; |
f6f0a4d2 | 531 | u32 ref = 0; |
bc9f8143 | 532 | u32 node = 0; |
b97bf3fd | 533 | |
34747539 | 534 | if (!tipc_in_scope(*destnode, tn->own_addr)) |
b97bf3fd PL |
535 | return 0; |
536 | ||
97ede29e | 537 | rcu_read_lock(); |
4ac1c8d0 | 538 | seq = nametbl_find_seq(net, type); |
b97bf3fd PL |
539 | if (unlikely(!seq)) |
540 | goto not_found; | |
fb9962f3 | 541 | spin_lock_bh(&seq->lock); |
b97bf3fd PL |
542 | sseq = nameseq_find_subseq(seq, instance); |
543 | if (unlikely(!sseq)) | |
fb9962f3 | 544 | goto no_match; |
b52124a5 | 545 | info = sseq->info; |
b97bf3fd | 546 | |
617d3c7a | 547 | /* Closest-First Algorithm */ |
b97bf3fd | 548 | if (likely(!*destnode)) { |
f6f0a4d2 AS |
549 | if (!list_empty(&info->node_list)) { |
550 | publ = list_first_entry(&info->node_list, | |
551 | struct publication, | |
552 | node_list); | |
553 | list_move_tail(&publ->node_list, | |
554 | &info->node_list); | |
555 | } else if (!list_empty(&info->cluster_list)) { | |
556 | publ = list_first_entry(&info->cluster_list, | |
557 | struct publication, | |
558 | cluster_list); | |
559 | list_move_tail(&publ->cluster_list, | |
560 | &info->cluster_list); | |
8af4638a | 561 | } else { |
f6f0a4d2 AS |
562 | publ = list_first_entry(&info->zone_list, |
563 | struct publication, | |
564 | zone_list); | |
565 | list_move_tail(&publ->zone_list, | |
566 | &info->zone_list); | |
8af4638a | 567 | } |
b97bf3fd PL |
568 | } |
569 | ||
617d3c7a | 570 | /* Round-Robin Algorithm */ |
34747539 | 571 | else if (*destnode == tn->own_addr) { |
f6f0a4d2 AS |
572 | if (list_empty(&info->node_list)) |
573 | goto no_match; | |
574 | publ = list_first_entry(&info->node_list, struct publication, | |
575 | node_list); | |
576 | list_move_tail(&publ->node_list, &info->node_list); | |
34747539 | 577 | } else if (in_own_cluster_exact(net, *destnode)) { |
f6f0a4d2 AS |
578 | if (list_empty(&info->cluster_list)) |
579 | goto no_match; | |
580 | publ = list_first_entry(&info->cluster_list, struct publication, | |
581 | cluster_list); | |
582 | list_move_tail(&publ->cluster_list, &info->cluster_list); | |
b97bf3fd | 583 | } else { |
f6f0a4d2 AS |
584 | publ = list_first_entry(&info->zone_list, struct publication, |
585 | zone_list); | |
586 | list_move_tail(&publ->zone_list, &info->zone_list); | |
b97bf3fd | 587 | } |
f6f0a4d2 AS |
588 | |
589 | ref = publ->ref; | |
bc9f8143 | 590 | node = publ->node; |
f6f0a4d2 | 591 | no_match: |
b97bf3fd PL |
592 | spin_unlock_bh(&seq->lock); |
593 | not_found: | |
97ede29e | 594 | rcu_read_unlock(); |
bc9f8143 | 595 | *destnode = node; |
f6f0a4d2 | 596 | return ref; |
b97bf3fd PL |
597 | } |
598 | ||
599 | /** | |
4323add6 | 600 | * tipc_nametbl_mc_translate - find multicast destinations |
c4307285 | 601 | * |
b97bf3fd PL |
602 | * Creates list of all local ports that overlap the given multicast address; |
603 | * also determines if any off-node ports overlap. | |
604 | * | |
605 | * Note: Publications with a scope narrower than 'limit' are ignored. | |
606 | * (i.e. local node-scope publications mustn't receive messages arriving | |
607 | * from another node, even if the multcast link brought it here) | |
c4307285 | 608 | * |
b97bf3fd PL |
609 | * Returns non-zero if any off-node ports overlap |
610 | */ | |
4ac1c8d0 | 611 | int tipc_nametbl_mc_translate(struct net *net, u32 type, u32 lower, u32 upper, |
4d8642d8 | 612 | u32 limit, struct list_head *dports) |
b97bf3fd PL |
613 | { |
614 | struct name_seq *seq; | |
615 | struct sub_seq *sseq; | |
616 | struct sub_seq *sseq_stop; | |
b52124a5 | 617 | struct name_info *info; |
b97bf3fd PL |
618 | int res = 0; |
619 | ||
97ede29e | 620 | rcu_read_lock(); |
4ac1c8d0 | 621 | seq = nametbl_find_seq(net, type); |
b97bf3fd PL |
622 | if (!seq) |
623 | goto exit; | |
624 | ||
625 | spin_lock_bh(&seq->lock); | |
b97bf3fd PL |
626 | sseq = seq->sseqs + nameseq_locate_subseq(seq, lower); |
627 | sseq_stop = seq->sseqs + seq->first_free; | |
628 | for (; sseq != sseq_stop; sseq++) { | |
629 | struct publication *publ; | |
630 | ||
631 | if (sseq->lower > upper) | |
632 | break; | |
968edbe1 | 633 | |
b52124a5 | 634 | info = sseq->info; |
f6f0a4d2 AS |
635 | list_for_each_entry(publ, &info->node_list, node_list) { |
636 | if (publ->scope <= limit) | |
4d8642d8 | 637 | u32_push(dports, publ->ref); |
968edbe1 AS |
638 | } |
639 | ||
b52124a5 | 640 | if (info->cluster_list_size != info->node_list_size) |
968edbe1 | 641 | res = 1; |
b97bf3fd | 642 | } |
b97bf3fd PL |
643 | spin_unlock_bh(&seq->lock); |
644 | exit: | |
97ede29e | 645 | rcu_read_unlock(); |
b97bf3fd PL |
646 | return res; |
647 | } | |
648 | ||
2ae0b8af JPM |
649 | /* tipc_nametbl_lookup_dst_nodes - find broadcast destination nodes |
650 | * - Creates list of nodes that overlap the given multicast address | |
651 | * - Determines if any node local ports overlap | |
652 | */ | |
653 | void tipc_nametbl_lookup_dst_nodes(struct net *net, u32 type, u32 lower, | |
654 | u32 upper, u32 domain, | |
655 | struct tipc_nlist *nodes) | |
656 | { | |
657 | struct sub_seq *sseq, *stop; | |
658 | struct publication *publ; | |
659 | struct name_info *info; | |
660 | struct name_seq *seq; | |
661 | ||
662 | rcu_read_lock(); | |
663 | seq = nametbl_find_seq(net, type); | |
664 | if (!seq) | |
665 | goto exit; | |
666 | ||
667 | spin_lock_bh(&seq->lock); | |
668 | sseq = seq->sseqs + nameseq_locate_subseq(seq, lower); | |
669 | stop = seq->sseqs + seq->first_free; | |
670 | for (; sseq->lower <= upper && sseq != stop; sseq++) { | |
671 | info = sseq->info; | |
672 | list_for_each_entry(publ, &info->zone_list, zone_list) { | |
673 | if (tipc_in_scope(domain, publ->node)) | |
674 | tipc_nlist_add(nodes, publ->node); | |
675 | } | |
676 | } | |
677 | spin_unlock_bh(&seq->lock); | |
678 | exit: | |
679 | rcu_read_unlock(); | |
680 | } | |
681 | ||
c422f1bd | 682 | /* |
4323add6 | 683 | * tipc_nametbl_publish - add name publication to network name tables |
b97bf3fd | 684 | */ |
f2f9800d YX |
685 | struct publication *tipc_nametbl_publish(struct net *net, u32 type, u32 lower, |
686 | u32 upper, u32 scope, u32 port_ref, | |
687 | u32 key) | |
b97bf3fd PL |
688 | { |
689 | struct publication *publ; | |
eab8c045 | 690 | struct sk_buff *buf = NULL; |
4ac1c8d0 | 691 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
b97bf3fd | 692 | |
4ac1c8d0 YX |
693 | spin_lock_bh(&tn->nametbl_lock); |
694 | if (tn->nametbl->local_publ_count >= TIPC_MAX_PUBLICATIONS) { | |
2cf8aa19 | 695 | pr_warn("Publication failed, local publication limit reached (%u)\n", |
e6a04b1d | 696 | TIPC_MAX_PUBLICATIONS); |
4ac1c8d0 | 697 | spin_unlock_bh(&tn->nametbl_lock); |
1fc54d8f | 698 | return NULL; |
b97bf3fd | 699 | } |
b97bf3fd | 700 | |
4ac1c8d0 | 701 | publ = tipc_nametbl_insert_publ(net, type, lower, upper, scope, |
34747539 | 702 | tn->own_addr, port_ref, key); |
fd6eced8 | 703 | if (likely(publ)) { |
4ac1c8d0 YX |
704 | tn->nametbl->local_publ_count++; |
705 | buf = tipc_named_publish(net, publ); | |
a5325ae5 | 706 | /* Any pending external events? */ |
f2f9800d | 707 | tipc_named_process_backlog(net); |
fd6eced8 | 708 | } |
4ac1c8d0 | 709 | spin_unlock_bh(&tn->nametbl_lock); |
eab8c045 YX |
710 | |
711 | if (buf) | |
1d7e1c25 | 712 | tipc_node_broadcast(net, buf); |
b97bf3fd PL |
713 | return publ; |
714 | } | |
715 | ||
716 | /** | |
4323add6 | 717 | * tipc_nametbl_withdraw - withdraw name publication from network name tables |
b97bf3fd | 718 | */ |
f2f9800d YX |
719 | int tipc_nametbl_withdraw(struct net *net, u32 type, u32 lower, u32 ref, |
720 | u32 key) | |
b97bf3fd PL |
721 | { |
722 | struct publication *publ; | |
5492390a | 723 | struct sk_buff *skb = NULL; |
4ac1c8d0 | 724 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
b97bf3fd | 725 | |
4ac1c8d0 | 726 | spin_lock_bh(&tn->nametbl_lock); |
34747539 | 727 | publ = tipc_nametbl_remove_publ(net, type, lower, tn->own_addr, |
4ac1c8d0 | 728 | ref, key); |
f131072c | 729 | if (likely(publ)) { |
4ac1c8d0 | 730 | tn->nametbl->local_publ_count--; |
34747539 | 731 | skb = tipc_named_withdraw(net, publ); |
a5325ae5 | 732 | /* Any pending external events? */ |
f2f9800d | 733 | tipc_named_process_backlog(net); |
b97bf3fd | 734 | list_del_init(&publ->pport_list); |
97ede29e | 735 | kfree_rcu(publ, rcu); |
5492390a YX |
736 | } else { |
737 | pr_err("Unable to remove local publication\n" | |
738 | "(type=%u, lower=%u, ref=%u, key=%u)\n", | |
739 | type, lower, ref, key); | |
740 | } | |
4ac1c8d0 | 741 | spin_unlock_bh(&tn->nametbl_lock); |
eab8c045 | 742 | |
5492390a | 743 | if (skb) { |
1d7e1c25 | 744 | tipc_node_broadcast(net, skb); |
b97bf3fd PL |
745 | return 1; |
746 | } | |
b97bf3fd PL |
747 | return 0; |
748 | } | |
749 | ||
750 | /** | |
4323add6 | 751 | * tipc_nametbl_subscribe - add a subscription object to the name table |
b97bf3fd | 752 | */ |
fead3909 | 753 | void tipc_nametbl_subscribe(struct tipc_subscription *s) |
b97bf3fd | 754 | { |
4ac1c8d0 | 755 | struct tipc_net *tn = net_generic(s->net, tipc_net_id); |
a4273c73 | 756 | u32 type = tipc_subscrp_convert_seq_type(s->evt.s.seq.type, s->swap); |
993bfe5d | 757 | int index = hash(type); |
b97bf3fd | 758 | struct name_seq *seq; |
a4273c73 | 759 | struct tipc_name_seq ns; |
b97bf3fd | 760 | |
4ac1c8d0 YX |
761 | spin_lock_bh(&tn->nametbl_lock); |
762 | seq = nametbl_find_seq(s->net, type); | |
a016892c | 763 | if (!seq) |
4ac1c8d0 | 764 | seq = tipc_nameseq_create(type, &tn->nametbl->seq_hlist[index]); |
0e65967e | 765 | if (seq) { |
c4307285 | 766 | spin_lock_bh(&seq->lock); |
c4307285 YH |
767 | tipc_nameseq_subscribe(seq, s); |
768 | spin_unlock_bh(&seq->lock); | |
769 | } else { | |
a4273c73 | 770 | tipc_subscrp_convert_seq(&s->evt.s.seq, s->swap, &ns); |
2cf8aa19 | 771 | pr_warn("Failed to create subscription for {%u,%u,%u}\n", |
a4273c73 | 772 | ns.type, ns.lower, ns.upper); |
c4307285 | 773 | } |
4ac1c8d0 | 774 | spin_unlock_bh(&tn->nametbl_lock); |
b97bf3fd PL |
775 | } |
776 | ||
777 | /** | |
4323add6 | 778 | * tipc_nametbl_unsubscribe - remove a subscription object from name table |
b97bf3fd | 779 | */ |
fead3909 | 780 | void tipc_nametbl_unsubscribe(struct tipc_subscription *s) |
b97bf3fd | 781 | { |
4ac1c8d0 | 782 | struct tipc_net *tn = net_generic(s->net, tipc_net_id); |
b97bf3fd | 783 | struct name_seq *seq; |
a4273c73 | 784 | u32 type = tipc_subscrp_convert_seq_type(s->evt.s.seq.type, s->swap); |
b97bf3fd | 785 | |
4ac1c8d0 | 786 | spin_lock_bh(&tn->nametbl_lock); |
a4273c73 | 787 | seq = nametbl_find_seq(s->net, type); |
0e65967e | 788 | if (seq != NULL) { |
c4307285 YH |
789 | spin_lock_bh(&seq->lock); |
790 | list_del_init(&s->nameseq_list); | |
7efea60d | 791 | tipc_subscrp_put(s); |
fb9962f3 | 792 | if (!seq->first_free && list_empty(&seq->subscriptions)) { |
97ede29e | 793 | hlist_del_init_rcu(&seq->ns_list); |
fb9962f3 | 794 | kfree(seq->sseqs); |
97ede29e YX |
795 | spin_unlock_bh(&seq->lock); |
796 | kfree_rcu(seq, rcu); | |
fb9962f3 YX |
797 | } else { |
798 | spin_unlock_bh(&seq->lock); | |
799 | } | |
c4307285 | 800 | } |
4ac1c8d0 | 801 | spin_unlock_bh(&tn->nametbl_lock); |
b97bf3fd PL |
802 | } |
803 | ||
4ac1c8d0 | 804 | int tipc_nametbl_init(struct net *net) |
b97bf3fd | 805 | { |
4ac1c8d0 YX |
806 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
807 | struct name_table *tipc_nametbl; | |
993bfe5d YX |
808 | int i; |
809 | ||
810 | tipc_nametbl = kzalloc(sizeof(*tipc_nametbl), GFP_ATOMIC); | |
811 | if (!tipc_nametbl) | |
b97bf3fd PL |
812 | return -ENOMEM; |
813 | ||
993bfe5d YX |
814 | for (i = 0; i < TIPC_NAMETBL_SIZE; i++) |
815 | INIT_HLIST_HEAD(&tipc_nametbl->seq_hlist[i]); | |
816 | ||
817 | INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_ZONE_SCOPE]); | |
818 | INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_CLUSTER_SCOPE]); | |
819 | INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_NODE_SCOPE]); | |
4ac1c8d0 YX |
820 | tn->nametbl = tipc_nametbl; |
821 | spin_lock_init(&tn->nametbl_lock); | |
b97bf3fd PL |
822 | return 0; |
823 | } | |
824 | ||
1bb8dce5 EH |
825 | /** |
826 | * tipc_purge_publications - remove all publications for a given type | |
827 | * | |
828 | * tipc_nametbl_lock must be held when calling this function | |
829 | */ | |
4ac1c8d0 | 830 | static void tipc_purge_publications(struct net *net, struct name_seq *seq) |
1bb8dce5 EH |
831 | { |
832 | struct publication *publ, *safe; | |
833 | struct sub_seq *sseq; | |
834 | struct name_info *info; | |
835 | ||
fb9962f3 | 836 | spin_lock_bh(&seq->lock); |
1bb8dce5 EH |
837 | sseq = seq->sseqs; |
838 | info = sseq->info; | |
839 | list_for_each_entry_safe(publ, safe, &info->zone_list, zone_list) { | |
8460504b YX |
840 | tipc_nameseq_remove_publ(net, seq, publ->lower, publ->node, |
841 | publ->ref, publ->key); | |
97ede29e | 842 | kfree_rcu(publ, rcu); |
1bb8dce5 | 843 | } |
97ede29e YX |
844 | hlist_del_init_rcu(&seq->ns_list); |
845 | kfree(seq->sseqs); | |
023160bc | 846 | spin_unlock_bh(&seq->lock); |
fb9962f3 | 847 | |
97ede29e | 848 | kfree_rcu(seq, rcu); |
1bb8dce5 EH |
849 | } |
850 | ||
4ac1c8d0 | 851 | void tipc_nametbl_stop(struct net *net) |
b97bf3fd | 852 | { |
b97bf3fd | 853 | u32 i; |
1bb8dce5 EH |
854 | struct name_seq *seq; |
855 | struct hlist_head *seq_head; | |
4ac1c8d0 YX |
856 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
857 | struct name_table *tipc_nametbl = tn->nametbl; | |
b97bf3fd | 858 | |
1bb8dce5 EH |
859 | /* Verify name table is empty and purge any lingering |
860 | * publications, then release the name table | |
861 | */ | |
4ac1c8d0 | 862 | spin_lock_bh(&tn->nametbl_lock); |
f046e7d9 | 863 | for (i = 0; i < TIPC_NAMETBL_SIZE; i++) { |
993bfe5d | 864 | if (hlist_empty(&tipc_nametbl->seq_hlist[i])) |
f705ab95 | 865 | continue; |
993bfe5d | 866 | seq_head = &tipc_nametbl->seq_hlist[i]; |
97ede29e | 867 | hlist_for_each_entry_rcu(seq, seq_head, ns_list) { |
4ac1c8d0 | 868 | tipc_purge_publications(net, seq); |
1bb8dce5 | 869 | } |
b97bf3fd | 870 | } |
4ac1c8d0 | 871 | spin_unlock_bh(&tn->nametbl_lock); |
993bfe5d | 872 | |
97ede29e | 873 | synchronize_net(); |
993bfe5d YX |
874 | kfree(tipc_nametbl); |
875 | ||
b97bf3fd | 876 | } |
1593123a | 877 | |
d8182804 RA |
878 | static int __tipc_nl_add_nametable_publ(struct tipc_nl_msg *msg, |
879 | struct name_seq *seq, | |
880 | struct sub_seq *sseq, u32 *last_publ) | |
1593123a RA |
881 | { |
882 | void *hdr; | |
883 | struct nlattr *attrs; | |
884 | struct nlattr *publ; | |
885 | struct publication *p; | |
886 | ||
887 | if (*last_publ) { | |
888 | list_for_each_entry(p, &sseq->info->zone_list, zone_list) | |
889 | if (p->key == *last_publ) | |
890 | break; | |
891 | if (p->key != *last_publ) | |
892 | return -EPIPE; | |
893 | } else { | |
894 | p = list_first_entry(&sseq->info->zone_list, struct publication, | |
895 | zone_list); | |
896 | } | |
897 | ||
898 | list_for_each_entry_from(p, &sseq->info->zone_list, zone_list) { | |
899 | *last_publ = p->key; | |
900 | ||
901 | hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, | |
bfb3e5dd | 902 | &tipc_genl_family, NLM_F_MULTI, |
1593123a RA |
903 | TIPC_NL_NAME_TABLE_GET); |
904 | if (!hdr) | |
905 | return -EMSGSIZE; | |
906 | ||
907 | attrs = nla_nest_start(msg->skb, TIPC_NLA_NAME_TABLE); | |
908 | if (!attrs) | |
909 | goto msg_full; | |
910 | ||
911 | publ = nla_nest_start(msg->skb, TIPC_NLA_NAME_TABLE_PUBL); | |
912 | if (!publ) | |
913 | goto attr_msg_full; | |
914 | ||
915 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_TYPE, seq->type)) | |
916 | goto publ_msg_full; | |
917 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_LOWER, sseq->lower)) | |
918 | goto publ_msg_full; | |
919 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_UPPER, sseq->upper)) | |
920 | goto publ_msg_full; | |
921 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_SCOPE, p->scope)) | |
922 | goto publ_msg_full; | |
923 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_NODE, p->node)) | |
924 | goto publ_msg_full; | |
925 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_REF, p->ref)) | |
926 | goto publ_msg_full; | |
927 | if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_KEY, p->key)) | |
928 | goto publ_msg_full; | |
929 | ||
930 | nla_nest_end(msg->skb, publ); | |
931 | nla_nest_end(msg->skb, attrs); | |
932 | genlmsg_end(msg->skb, hdr); | |
933 | } | |
934 | *last_publ = 0; | |
935 | ||
936 | return 0; | |
937 | ||
938 | publ_msg_full: | |
939 | nla_nest_cancel(msg->skb, publ); | |
940 | attr_msg_full: | |
941 | nla_nest_cancel(msg->skb, attrs); | |
942 | msg_full: | |
943 | genlmsg_cancel(msg->skb, hdr); | |
944 | ||
945 | return -EMSGSIZE; | |
946 | } | |
947 | ||
d8182804 RA |
948 | static int __tipc_nl_subseq_list(struct tipc_nl_msg *msg, struct name_seq *seq, |
949 | u32 *last_lower, u32 *last_publ) | |
1593123a RA |
950 | { |
951 | struct sub_seq *sseq; | |
952 | struct sub_seq *sseq_start; | |
953 | int err; | |
954 | ||
955 | if (*last_lower) { | |
956 | sseq_start = nameseq_find_subseq(seq, *last_lower); | |
957 | if (!sseq_start) | |
958 | return -EPIPE; | |
959 | } else { | |
960 | sseq_start = seq->sseqs; | |
961 | } | |
962 | ||
963 | for (sseq = sseq_start; sseq != &seq->sseqs[seq->first_free]; sseq++) { | |
964 | err = __tipc_nl_add_nametable_publ(msg, seq, sseq, last_publ); | |
965 | if (err) { | |
966 | *last_lower = sseq->lower; | |
967 | return err; | |
968 | } | |
969 | } | |
970 | *last_lower = 0; | |
971 | ||
972 | return 0; | |
973 | } | |
974 | ||
4ac1c8d0 YX |
975 | static int tipc_nl_seq_list(struct net *net, struct tipc_nl_msg *msg, |
976 | u32 *last_type, u32 *last_lower, u32 *last_publ) | |
1593123a | 977 | { |
4ac1c8d0 | 978 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
1593123a | 979 | struct hlist_head *seq_head; |
97ede29e | 980 | struct name_seq *seq = NULL; |
1593123a RA |
981 | int err; |
982 | int i; | |
983 | ||
984 | if (*last_type) | |
985 | i = hash(*last_type); | |
986 | else | |
987 | i = 0; | |
988 | ||
989 | for (; i < TIPC_NAMETBL_SIZE; i++) { | |
4ac1c8d0 | 990 | seq_head = &tn->nametbl->seq_hlist[i]; |
1593123a RA |
991 | |
992 | if (*last_type) { | |
4ac1c8d0 | 993 | seq = nametbl_find_seq(net, *last_type); |
1593123a RA |
994 | if (!seq) |
995 | return -EPIPE; | |
996 | } else { | |
97ede29e YX |
997 | hlist_for_each_entry_rcu(seq, seq_head, ns_list) |
998 | break; | |
1593123a RA |
999 | if (!seq) |
1000 | continue; | |
1001 | } | |
1002 | ||
97ede29e | 1003 | hlist_for_each_entry_from_rcu(seq, ns_list) { |
1593123a | 1004 | spin_lock_bh(&seq->lock); |
1593123a RA |
1005 | err = __tipc_nl_subseq_list(msg, seq, last_lower, |
1006 | last_publ); | |
1007 | ||
1008 | if (err) { | |
1009 | *last_type = seq->type; | |
1010 | spin_unlock_bh(&seq->lock); | |
1011 | return err; | |
1012 | } | |
1013 | spin_unlock_bh(&seq->lock); | |
1014 | } | |
1015 | *last_type = 0; | |
1016 | } | |
1017 | return 0; | |
1018 | } | |
1019 | ||
1020 | int tipc_nl_name_table_dump(struct sk_buff *skb, struct netlink_callback *cb) | |
1021 | { | |
1022 | int err; | |
1023 | int done = cb->args[3]; | |
1024 | u32 last_type = cb->args[0]; | |
1025 | u32 last_lower = cb->args[1]; | |
1026 | u32 last_publ = cb->args[2]; | |
4ac1c8d0 | 1027 | struct net *net = sock_net(skb->sk); |
1593123a RA |
1028 | struct tipc_nl_msg msg; |
1029 | ||
1030 | if (done) | |
1031 | return 0; | |
1032 | ||
1033 | msg.skb = skb; | |
1034 | msg.portid = NETLINK_CB(cb->skb).portid; | |
1035 | msg.seq = cb->nlh->nlmsg_seq; | |
1036 | ||
97ede29e | 1037 | rcu_read_lock(); |
4ac1c8d0 | 1038 | err = tipc_nl_seq_list(net, &msg, &last_type, &last_lower, &last_publ); |
1593123a RA |
1039 | if (!err) { |
1040 | done = 1; | |
1041 | } else if (err != -EMSGSIZE) { | |
1042 | /* We never set seq or call nl_dump_check_consistent() this | |
1043 | * means that setting prev_seq here will cause the consistence | |
1044 | * check to fail in the netlink callback handler. Resulting in | |
1045 | * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if | |
1046 | * we got an error. | |
1047 | */ | |
1048 | cb->prev_seq = 1; | |
1049 | } | |
97ede29e | 1050 | rcu_read_unlock(); |
1593123a RA |
1051 | |
1052 | cb->args[0] = last_type; | |
1053 | cb->args[1] = last_lower; | |
1054 | cb->args[2] = last_publ; | |
1055 | cb->args[3] = done; | |
1056 | ||
1057 | return skb->len; | |
1058 | } | |
3c724acd | 1059 | |
4d8642d8 | 1060 | bool u32_find(struct list_head *l, u32 value) |
3c724acd | 1061 | { |
4d8642d8 | 1062 | struct u32_item *item; |
3c724acd | 1063 | |
4d8642d8 JPM |
1064 | list_for_each_entry(item, l, list) { |
1065 | if (item->value == value) | |
1066 | return true; | |
3c724acd | 1067 | } |
4d8642d8 JPM |
1068 | return false; |
1069 | } | |
1070 | ||
1071 | bool u32_push(struct list_head *l, u32 value) | |
1072 | { | |
1073 | struct u32_item *item; | |
1074 | ||
1075 | list_for_each_entry(item, l, list) { | |
1076 | if (item->value == value) | |
1077 | return false; | |
1078 | } | |
1079 | item = kmalloc(sizeof(*item), GFP_ATOMIC); | |
1080 | if (unlikely(!item)) | |
1081 | return false; | |
1082 | ||
1083 | item->value = value; | |
1084 | list_add(&item->list, l); | |
1085 | return true; | |
1086 | } | |
1087 | ||
1088 | u32 u32_pop(struct list_head *l) | |
1089 | { | |
1090 | struct u32_item *item; | |
1091 | u32 value = 0; | |
1092 | ||
1093 | if (list_empty(l)) | |
1094 | return 0; | |
1095 | item = list_first_entry(l, typeof(*item), list); | |
1096 | value = item->value; | |
1097 | list_del(&item->list); | |
1098 | kfree(item); | |
1099 | return value; | |
1100 | } | |
1101 | ||
1102 | bool u32_del(struct list_head *l, u32 value) | |
1103 | { | |
1104 | struct u32_item *item, *tmp; | |
1105 | ||
1106 | list_for_each_entry_safe(item, tmp, l, list) { | |
1107 | if (item->value != value) | |
1108 | continue; | |
1109 | list_del(&item->list); | |
1110 | kfree(item); | |
1111 | return true; | |
3c724acd | 1112 | } |
4d8642d8 JPM |
1113 | return false; |
1114 | } | |
1115 | ||
1116 | void u32_list_purge(struct list_head *l) | |
1117 | { | |
1118 | struct u32_item *item, *tmp; | |
1119 | ||
1120 | list_for_each_entry_safe(item, tmp, l, list) { | |
1121 | list_del(&item->list); | |
1122 | kfree(item); | |
3c724acd JPM |
1123 | } |
1124 | } | |
1125 | ||
4d8642d8 | 1126 | int u32_list_len(struct list_head *l) |
3c724acd | 1127 | { |
4d8642d8 JPM |
1128 | struct u32_item *item; |
1129 | int i = 0; | |
3c724acd | 1130 | |
4d8642d8 JPM |
1131 | list_for_each_entry(item, l, list) { |
1132 | i++; | |
3c724acd | 1133 | } |
4d8642d8 | 1134 | return i; |
3c724acd | 1135 | } |