Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/name_table.c: TIPC name table code | |
c4307285 | 3 | * |
593a5f22 | 4 | * Copyright (c) 2000-2006, Ericsson AB |
f6f0a4d2 | 5 | * Copyright (c) 2004-2008, 2010-2011, Wind River Systems |
b97bf3fd PL |
6 | * All rights reserved. |
7 | * | |
9ea1fd3c | 8 | * Redistribution and use in source and binary forms, with or without |
b97bf3fd PL |
9 | * modification, are permitted provided that the following conditions are met: |
10 | * | |
9ea1fd3c PL |
11 | * 1. Redistributions of source code must retain the above copyright |
12 | * notice, this list of conditions and the following disclaimer. | |
13 | * 2. Redistributions in binary form must reproduce the above copyright | |
14 | * notice, this list of conditions and the following disclaimer in the | |
15 | * documentation and/or other materials provided with the distribution. | |
16 | * 3. Neither the names of the copyright holders nor the names of its | |
17 | * contributors may be used to endorse or promote products derived from | |
18 | * this software without specific prior written permission. | |
b97bf3fd | 19 | * |
9ea1fd3c PL |
20 | * Alternatively, this software may be distributed under the terms of the |
21 | * GNU General Public License ("GPL") version 2 as published by the Free | |
22 | * Software Foundation. | |
23 | * | |
24 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | |
25 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
26 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
27 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | |
28 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | |
29 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | |
30 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
31 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | |
32 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
33 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
b97bf3fd PL |
34 | * POSSIBILITY OF SUCH DAMAGE. |
35 | */ | |
36 | ||
37 | #include "core.h" | |
38 | #include "config.h" | |
b97bf3fd PL |
39 | #include "name_table.h" |
40 | #include "name_distr.h" | |
b97bf3fd PL |
41 | #include "subscr.h" |
42 | #include "port.h" | |
b97bf3fd | 43 | |
f046e7d9 | 44 | #define TIPC_NAMETBL_SIZE 1024 /* must be a power of 2 */ |
b97bf3fd PL |
45 | |
46 | /** | |
b52124a5 | 47 | * struct name_info - name sequence publication info |
968edbe1 AS |
48 | * @node_list: circular list of publications made by own node |
49 | * @cluster_list: circular list of publications made by own cluster | |
50 | * @zone_list: circular list of publications made by own zone | |
51 | * @node_list_size: number of entries in "node_list" | |
52 | * @cluster_list_size: number of entries in "cluster_list" | |
53 | * @zone_list_size: number of entries in "zone_list" | |
54 | * | |
55 | * Note: The zone list always contains at least one entry, since all | |
56 | * publications of the associated name sequence belong to it. | |
57 | * (The cluster and node lists may be empty.) | |
b97bf3fd | 58 | */ |
b52124a5 | 59 | struct name_info { |
f6f0a4d2 AS |
60 | struct list_head node_list; |
61 | struct list_head cluster_list; | |
62 | struct list_head zone_list; | |
968edbe1 AS |
63 | u32 node_list_size; |
64 | u32 cluster_list_size; | |
65 | u32 zone_list_size; | |
b97bf3fd PL |
66 | }; |
67 | ||
b52124a5 AS |
68 | /** |
69 | * struct sub_seq - container for all published instances of a name sequence | |
70 | * @lower: name sequence lower bound | |
71 | * @upper: name sequence upper bound | |
72 | * @info: pointer to name sequence publication info | |
73 | */ | |
b52124a5 AS |
74 | struct sub_seq { |
75 | u32 lower; | |
76 | u32 upper; | |
77 | struct name_info *info; | |
78 | }; | |
79 | ||
c4307285 | 80 | /** |
b97bf3fd PL |
81 | * struct name_seq - container for all published instances of a name type |
82 | * @type: 32 bit 'type' value for name sequence | |
83 | * @sseq: pointer to dynamically-sized array of sub-sequences of this 'type'; | |
84 | * sub-sequences are sorted in ascending order | |
85 | * @alloc: number of sub-sequences currently in array | |
f131072c | 86 | * @first_free: array index of first unused sub-sequence entry |
b97bf3fd PL |
87 | * @ns_list: links to adjacent name sequences in hash chain |
88 | * @subscriptions: list of subscriptions for this 'type' | |
307fdf5e | 89 | * @lock: spinlock controlling access to publication lists of all sub-sequences |
b97bf3fd | 90 | */ |
b97bf3fd PL |
91 | struct name_seq { |
92 | u32 type; | |
93 | struct sub_seq *sseqs; | |
94 | u32 alloc; | |
95 | u32 first_free; | |
96 | struct hlist_node ns_list; | |
97 | struct list_head subscriptions; | |
98 | spinlock_t lock; | |
99 | }; | |
100 | ||
101 | /** | |
102 | * struct name_table - table containing all existing port name publications | |
c4307285 | 103 | * @types: pointer to fixed-sized array of name sequence lists, |
b97bf3fd PL |
104 | * accessed via hashing on 'type'; name sequence lists are *not* sorted |
105 | * @local_publ_count: number of publications issued by this node | |
106 | */ | |
b97bf3fd PL |
107 | struct name_table { |
108 | struct hlist_head *types; | |
109 | u32 local_publ_count; | |
110 | }; | |
111 | ||
e3ec9c7d | 112 | static struct name_table table; |
34af946a | 113 | DEFINE_RWLOCK(tipc_nametbl_lock); |
b97bf3fd | 114 | |
05790c64 | 115 | static int hash(int x) |
b97bf3fd | 116 | { |
f046e7d9 | 117 | return x & (TIPC_NAMETBL_SIZE - 1); |
b97bf3fd PL |
118 | } |
119 | ||
120 | /** | |
121 | * publ_create - create a publication structure | |
122 | */ | |
c4307285 YH |
123 | static struct publication *publ_create(u32 type, u32 lower, u32 upper, |
124 | u32 scope, u32 node, u32 port_ref, | |
b97bf3fd PL |
125 | u32 key) |
126 | { | |
0da974f4 | 127 | struct publication *publ = kzalloc(sizeof(*publ), GFP_ATOMIC); |
b97bf3fd | 128 | if (publ == NULL) { |
2cf8aa19 | 129 | pr_warn("Publication creation failure, no memory\n"); |
1fc54d8f | 130 | return NULL; |
b97bf3fd PL |
131 | } |
132 | ||
b97bf3fd PL |
133 | publ->type = type; |
134 | publ->lower = lower; | |
135 | publ->upper = upper; | |
136 | publ->scope = scope; | |
137 | publ->node = node; | |
138 | publ->ref = port_ref; | |
139 | publ->key = key; | |
140 | INIT_LIST_HEAD(&publ->local_list); | |
141 | INIT_LIST_HEAD(&publ->pport_list); | |
142 | INIT_LIST_HEAD(&publ->subscr.nodesub_list); | |
143 | return publ; | |
144 | } | |
145 | ||
146 | /** | |
4323add6 | 147 | * tipc_subseq_alloc - allocate a specified number of sub-sequence structures |
b97bf3fd | 148 | */ |
988f088a | 149 | static struct sub_seq *tipc_subseq_alloc(u32 cnt) |
b97bf3fd | 150 | { |
0cee6bbe | 151 | return kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC); |
b97bf3fd PL |
152 | } |
153 | ||
154 | /** | |
4323add6 | 155 | * tipc_nameseq_create - create a name sequence structure for the specified 'type' |
c4307285 | 156 | * |
b97bf3fd PL |
157 | * Allocates a single sub-sequence structure and sets it to all 0's. |
158 | */ | |
988f088a | 159 | static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head) |
b97bf3fd | 160 | { |
0da974f4 | 161 | struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC); |
4323add6 | 162 | struct sub_seq *sseq = tipc_subseq_alloc(1); |
b97bf3fd PL |
163 | |
164 | if (!nseq || !sseq) { | |
2cf8aa19 | 165 | pr_warn("Name sequence creation failed, no memory\n"); |
b97bf3fd PL |
166 | kfree(nseq); |
167 | kfree(sseq); | |
1fc54d8f | 168 | return NULL; |
b97bf3fd PL |
169 | } |
170 | ||
34af946a | 171 | spin_lock_init(&nseq->lock); |
b97bf3fd PL |
172 | nseq->type = type; |
173 | nseq->sseqs = sseq; | |
b97bf3fd PL |
174 | nseq->alloc = 1; |
175 | INIT_HLIST_NODE(&nseq->ns_list); | |
176 | INIT_LIST_HEAD(&nseq->subscriptions); | |
177 | hlist_add_head(&nseq->ns_list, seq_head); | |
178 | return nseq; | |
179 | } | |
180 | ||
f7fb9d20 AS |
181 | /* |
182 | * nameseq_delete_empty - deletes a name sequence structure if now unused | |
183 | */ | |
184 | static void nameseq_delete_empty(struct name_seq *seq) | |
185 | { | |
186 | if (!seq->first_free && list_empty(&seq->subscriptions)) { | |
187 | hlist_del_init(&seq->ns_list); | |
188 | kfree(seq->sseqs); | |
189 | kfree(seq); | |
190 | } | |
191 | } | |
192 | ||
2c53040f | 193 | /** |
b97bf3fd | 194 | * nameseq_find_subseq - find sub-sequence (if any) matching a name instance |
c4307285 | 195 | * |
b97bf3fd PL |
196 | * Very time-critical, so binary searches through sub-sequence array. |
197 | */ | |
05790c64 SR |
198 | static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq, |
199 | u32 instance) | |
b97bf3fd PL |
200 | { |
201 | struct sub_seq *sseqs = nseq->sseqs; | |
202 | int low = 0; | |
203 | int high = nseq->first_free - 1; | |
204 | int mid; | |
205 | ||
206 | while (low <= high) { | |
207 | mid = (low + high) / 2; | |
208 | if (instance < sseqs[mid].lower) | |
209 | high = mid - 1; | |
210 | else if (instance > sseqs[mid].upper) | |
211 | low = mid + 1; | |
212 | else | |
213 | return &sseqs[mid]; | |
214 | } | |
1fc54d8f | 215 | return NULL; |
b97bf3fd PL |
216 | } |
217 | ||
218 | /** | |
219 | * nameseq_locate_subseq - determine position of name instance in sub-sequence | |
c4307285 | 220 | * |
b97bf3fd PL |
221 | * Returns index in sub-sequence array of the entry that contains the specified |
222 | * instance value; if no entry contains that value, returns the position | |
223 | * where a new entry for it would be inserted in the array. | |
224 | * | |
225 | * Note: Similar to binary search code for locating a sub-sequence. | |
226 | */ | |
b97bf3fd PL |
227 | static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance) |
228 | { | |
229 | struct sub_seq *sseqs = nseq->sseqs; | |
230 | int low = 0; | |
231 | int high = nseq->first_free - 1; | |
232 | int mid; | |
233 | ||
234 | while (low <= high) { | |
235 | mid = (low + high) / 2; | |
236 | if (instance < sseqs[mid].lower) | |
237 | high = mid - 1; | |
238 | else if (instance > sseqs[mid].upper) | |
239 | low = mid + 1; | |
240 | else | |
241 | return mid; | |
242 | } | |
243 | return low; | |
244 | } | |
245 | ||
246 | /** | |
617d3c7a | 247 | * tipc_nameseq_insert_publ |
b97bf3fd | 248 | */ |
988f088a AB |
249 | static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq, |
250 | u32 type, u32 lower, u32 upper, | |
251 | u32 scope, u32 node, u32 port, u32 key) | |
b97bf3fd | 252 | { |
fead3909 PG |
253 | struct tipc_subscription *s; |
254 | struct tipc_subscription *st; | |
b97bf3fd PL |
255 | struct publication *publ; |
256 | struct sub_seq *sseq; | |
b52124a5 | 257 | struct name_info *info; |
b97bf3fd PL |
258 | int created_subseq = 0; |
259 | ||
b97bf3fd | 260 | sseq = nameseq_find_subseq(nseq, lower); |
b97bf3fd PL |
261 | if (sseq) { |
262 | ||
263 | /* Lower end overlaps existing entry => need an exact match */ | |
b97bf3fd | 264 | if ((sseq->lower != lower) || (sseq->upper != upper)) { |
2cf8aa19 EH |
265 | pr_warn("Cannot publish {%u,%u,%u}, overlap error\n", |
266 | type, lower, upper); | |
1fc54d8f | 267 | return NULL; |
b97bf3fd | 268 | } |
b52124a5 AS |
269 | |
270 | info = sseq->info; | |
f80c24d9 AS |
271 | |
272 | /* Check if an identical publication already exists */ | |
273 | list_for_each_entry(publ, &info->zone_list, zone_list) { | |
274 | if ((publ->ref == port) && (publ->key == key) && | |
275 | (!publ->node || (publ->node == node))) | |
276 | return NULL; | |
277 | } | |
b97bf3fd PL |
278 | } else { |
279 | u32 inspos; | |
280 | struct sub_seq *freesseq; | |
281 | ||
282 | /* Find where lower end should be inserted */ | |
b97bf3fd PL |
283 | inspos = nameseq_locate_subseq(nseq, lower); |
284 | ||
285 | /* Fail if upper end overlaps into an existing entry */ | |
b97bf3fd PL |
286 | if ((inspos < nseq->first_free) && |
287 | (upper >= nseq->sseqs[inspos].lower)) { | |
2cf8aa19 EH |
288 | pr_warn("Cannot publish {%u,%u,%u}, overlap error\n", |
289 | type, lower, upper); | |
1fc54d8f | 290 | return NULL; |
b97bf3fd PL |
291 | } |
292 | ||
293 | /* Ensure there is space for new sub-sequence */ | |
b97bf3fd | 294 | if (nseq->first_free == nseq->alloc) { |
9ab230f8 AS |
295 | struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2); |
296 | ||
297 | if (!sseqs) { | |
2cf8aa19 EH |
298 | pr_warn("Cannot publish {%u,%u,%u}, no memory\n", |
299 | type, lower, upper); | |
1fc54d8f | 300 | return NULL; |
b97bf3fd | 301 | } |
9ab230f8 AS |
302 | memcpy(sseqs, nseq->sseqs, |
303 | nseq->alloc * sizeof(struct sub_seq)); | |
304 | kfree(nseq->sseqs); | |
305 | nseq->sseqs = sseqs; | |
306 | nseq->alloc *= 2; | |
b97bf3fd | 307 | } |
b97bf3fd | 308 | |
b52124a5 AS |
309 | info = kzalloc(sizeof(*info), GFP_ATOMIC); |
310 | if (!info) { | |
2cf8aa19 EH |
311 | pr_warn("Cannot publish {%u,%u,%u}, no memory\n", |
312 | type, lower, upper); | |
b52124a5 AS |
313 | return NULL; |
314 | } | |
315 | ||
f6f0a4d2 AS |
316 | INIT_LIST_HEAD(&info->node_list); |
317 | INIT_LIST_HEAD(&info->cluster_list); | |
318 | INIT_LIST_HEAD(&info->zone_list); | |
319 | ||
b97bf3fd | 320 | /* Insert new sub-sequence */ |
b97bf3fd PL |
321 | sseq = &nseq->sseqs[inspos]; |
322 | freesseq = &nseq->sseqs[nseq->first_free]; | |
0e65967e AS |
323 | memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq)); |
324 | memset(sseq, 0, sizeof(*sseq)); | |
b97bf3fd PL |
325 | nseq->first_free++; |
326 | sseq->lower = lower; | |
327 | sseq->upper = upper; | |
b52124a5 | 328 | sseq->info = info; |
b97bf3fd PL |
329 | created_subseq = 1; |
330 | } | |
b97bf3fd | 331 | |
617d3c7a | 332 | /* Insert a publication */ |
b97bf3fd PL |
333 | publ = publ_create(type, lower, upper, scope, node, port, key); |
334 | if (!publ) | |
1fc54d8f | 335 | return NULL; |
b97bf3fd | 336 | |
f6f0a4d2 | 337 | list_add(&publ->zone_list, &info->zone_list); |
b52124a5 | 338 | info->zone_list_size++; |
b97bf3fd | 339 | |
d4f5c12c | 340 | if (in_own_cluster(node)) { |
f6f0a4d2 | 341 | list_add(&publ->cluster_list, &info->cluster_list); |
b52124a5 | 342 | info->cluster_list_size++; |
b97bf3fd PL |
343 | } |
344 | ||
d4f5c12c | 345 | if (in_own_node(node)) { |
f6f0a4d2 | 346 | list_add(&publ->node_list, &info->node_list); |
b52124a5 | 347 | info->node_list_size++; |
b97bf3fd PL |
348 | } |
349 | ||
617d3c7a | 350 | /* Any subscriptions waiting for notification? */ |
b97bf3fd | 351 | list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { |
4323add6 PL |
352 | tipc_subscr_report_overlap(s, |
353 | publ->lower, | |
354 | publ->upper, | |
355 | TIPC_PUBLISHED, | |
c4307285 | 356 | publ->ref, |
4323add6 PL |
357 | publ->node, |
358 | created_subseq); | |
b97bf3fd PL |
359 | } |
360 | return publ; | |
361 | } | |
362 | ||
363 | /** | |
617d3c7a | 364 | * tipc_nameseq_remove_publ |
c4307285 | 365 | * |
f131072c AS |
366 | * NOTE: There may be cases where TIPC is asked to remove a publication |
367 | * that is not in the name table. For example, if another node issues a | |
368 | * publication for a name sequence that overlaps an existing name sequence | |
369 | * the publication will not be recorded, which means the publication won't | |
370 | * be found when the name sequence is later withdrawn by that node. | |
371 | * A failed withdraw request simply returns a failure indication and lets the | |
372 | * caller issue any error or warning messages associated with such a problem. | |
b97bf3fd | 373 | */ |
988f088a AB |
374 | static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 inst, |
375 | u32 node, u32 ref, u32 key) | |
b97bf3fd PL |
376 | { |
377 | struct publication *publ; | |
b97bf3fd | 378 | struct sub_seq *sseq = nameseq_find_subseq(nseq, inst); |
b52124a5 | 379 | struct name_info *info; |
b97bf3fd | 380 | struct sub_seq *free; |
fead3909 | 381 | struct tipc_subscription *s, *st; |
b97bf3fd PL |
382 | int removed_subseq = 0; |
383 | ||
f131072c | 384 | if (!sseq) |
1fc54d8f | 385 | return NULL; |
f131072c | 386 | |
b52124a5 AS |
387 | info = sseq->info; |
388 | ||
f6f0a4d2 | 389 | /* Locate publication, if it exists */ |
f6f0a4d2 AS |
390 | list_for_each_entry(publ, &info->zone_list, zone_list) { |
391 | if ((publ->key == key) && (publ->ref == ref) && | |
392 | (!publ->node || (publ->node == node))) | |
393 | goto found; | |
394 | } | |
395 | return NULL; | |
c4307285 | 396 | |
f6f0a4d2 AS |
397 | found: |
398 | /* Remove publication from zone scope list */ | |
f6f0a4d2 | 399 | list_del(&publ->zone_list); |
b52124a5 | 400 | info->zone_list_size--; |
b97bf3fd | 401 | |
f131072c | 402 | /* Remove publication from cluster scope list, if present */ |
d4f5c12c | 403 | if (in_own_cluster(node)) { |
f6f0a4d2 | 404 | list_del(&publ->cluster_list); |
b52124a5 | 405 | info->cluster_list_size--; |
b97bf3fd | 406 | } |
f131072c AS |
407 | |
408 | /* Remove publication from node scope list, if present */ | |
d4f5c12c | 409 | if (in_own_node(node)) { |
f6f0a4d2 | 410 | list_del(&publ->node_list); |
b52124a5 | 411 | info->node_list_size--; |
b97bf3fd | 412 | } |
b97bf3fd | 413 | |
f131072c | 414 | /* Contract subseq list if no more publications for that subseq */ |
f6f0a4d2 | 415 | if (list_empty(&info->zone_list)) { |
b52124a5 | 416 | kfree(info); |
b97bf3fd | 417 | free = &nseq->sseqs[nseq->first_free--]; |
0e65967e | 418 | memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq)); |
b97bf3fd PL |
419 | removed_subseq = 1; |
420 | } | |
421 | ||
f131072c | 422 | /* Notify any waiting subscriptions */ |
b97bf3fd | 423 | list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { |
4323add6 PL |
424 | tipc_subscr_report_overlap(s, |
425 | publ->lower, | |
426 | publ->upper, | |
c4307285 YH |
427 | TIPC_WITHDRAWN, |
428 | publ->ref, | |
4323add6 PL |
429 | publ->node, |
430 | removed_subseq); | |
b97bf3fd | 431 | } |
f131072c | 432 | |
b97bf3fd PL |
433 | return publ; |
434 | } | |
435 | ||
436 | /** | |
2c53040f | 437 | * tipc_nameseq_subscribe - attach a subscription, and issue |
b97bf3fd PL |
438 | * the prescribed number of events if there is any sub- |
439 | * sequence overlapping with the requested sequence | |
440 | */ | |
fead3909 | 441 | static void tipc_nameseq_subscribe(struct name_seq *nseq, |
ae8509c4 | 442 | struct tipc_subscription *s) |
b97bf3fd PL |
443 | { |
444 | struct sub_seq *sseq = nseq->sseqs; | |
445 | ||
446 | list_add(&s->nameseq_list, &nseq->subscriptions); | |
447 | ||
448 | if (!sseq) | |
449 | return; | |
450 | ||
451 | while (sseq != &nseq->sseqs[nseq->first_free]) { | |
f6f0a4d2 AS |
452 | if (tipc_subscr_overlap(s, sseq->lower, sseq->upper)) { |
453 | struct publication *crs; | |
454 | struct name_info *info = sseq->info; | |
b97bf3fd PL |
455 | int must_report = 1; |
456 | ||
f6f0a4d2 | 457 | list_for_each_entry(crs, &info->zone_list, zone_list) { |
c4307285 YH |
458 | tipc_subscr_report_overlap(s, |
459 | sseq->lower, | |
4323add6 PL |
460 | sseq->upper, |
461 | TIPC_PUBLISHED, | |
462 | crs->ref, | |
463 | crs->node, | |
464 | must_report); | |
b97bf3fd | 465 | must_report = 0; |
f6f0a4d2 | 466 | } |
b97bf3fd PL |
467 | } |
468 | sseq++; | |
469 | } | |
470 | } | |
471 | ||
472 | static struct name_seq *nametbl_find_seq(u32 type) | |
473 | { | |
474 | struct hlist_head *seq_head; | |
b97bf3fd PL |
475 | struct name_seq *ns; |
476 | ||
b97bf3fd | 477 | seq_head = &table.types[hash(type)]; |
b67bfe0d | 478 | hlist_for_each_entry(ns, seq_head, ns_list) { |
b29f1428 | 479 | if (ns->type == type) |
b97bf3fd | 480 | return ns; |
b97bf3fd PL |
481 | } |
482 | ||
1fc54d8f | 483 | return NULL; |
b97bf3fd PL |
484 | }; |
485 | ||
4323add6 PL |
486 | struct publication *tipc_nametbl_insert_publ(u32 type, u32 lower, u32 upper, |
487 | u32 scope, u32 node, u32 port, u32 key) | |
b97bf3fd PL |
488 | { |
489 | struct name_seq *seq = nametbl_find_seq(type); | |
490 | ||
8f177896 AS |
491 | if ((scope < TIPC_ZONE_SCOPE) || (scope > TIPC_NODE_SCOPE) || |
492 | (lower > upper)) { | |
2cf8aa19 EH |
493 | pr_debug("Failed to publish illegal {%u,%u,%u} with scope %u\n", |
494 | type, lower, upper, scope); | |
1fc54d8f | 495 | return NULL; |
b97bf3fd PL |
496 | } |
497 | ||
b29f1428 | 498 | if (!seq) |
4323add6 | 499 | seq = tipc_nameseq_create(type, &table.types[hash(type)]); |
b97bf3fd | 500 | if (!seq) |
1fc54d8f | 501 | return NULL; |
b97bf3fd | 502 | |
4323add6 PL |
503 | return tipc_nameseq_insert_publ(seq, type, lower, upper, |
504 | scope, node, port, key); | |
b97bf3fd PL |
505 | } |
506 | ||
c4307285 | 507 | struct publication *tipc_nametbl_remove_publ(u32 type, u32 lower, |
4323add6 | 508 | u32 node, u32 ref, u32 key) |
b97bf3fd PL |
509 | { |
510 | struct publication *publ; | |
511 | struct name_seq *seq = nametbl_find_seq(type); | |
512 | ||
513 | if (!seq) | |
1fc54d8f | 514 | return NULL; |
b97bf3fd | 515 | |
4323add6 | 516 | publ = tipc_nameseq_remove_publ(seq, lower, node, ref, key); |
f7fb9d20 | 517 | nameseq_delete_empty(seq); |
b97bf3fd PL |
518 | return publ; |
519 | } | |
520 | ||
2c53040f | 521 | /** |
bc9f8143 | 522 | * tipc_nametbl_translate - perform name translation |
b97bf3fd | 523 | * |
bc9f8143 AS |
524 | * On entry, 'destnode' is the search domain used during translation. |
525 | * | |
526 | * On exit: | |
527 | * - if name translation is deferred to another node/cluster/zone, | |
528 | * leaves 'destnode' unchanged (will be non-zero) and returns 0 | |
529 | * - if name translation is attempted and succeeds, sets 'destnode' | |
530 | * to publishing node and returns port reference (will be non-zero) | |
531 | * - if name translation is attempted and fails, sets 'destnode' to 0 | |
532 | * and returns 0 | |
b97bf3fd | 533 | */ |
4323add6 | 534 | u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode) |
b97bf3fd PL |
535 | { |
536 | struct sub_seq *sseq; | |
b52124a5 | 537 | struct name_info *info; |
f6f0a4d2 | 538 | struct publication *publ; |
b97bf3fd | 539 | struct name_seq *seq; |
f6f0a4d2 | 540 | u32 ref = 0; |
bc9f8143 | 541 | u32 node = 0; |
b97bf3fd | 542 | |
c68ca7b7 | 543 | if (!tipc_in_scope(*destnode, tipc_own_addr)) |
b97bf3fd PL |
544 | return 0; |
545 | ||
4323add6 | 546 | read_lock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
547 | seq = nametbl_find_seq(type); |
548 | if (unlikely(!seq)) | |
549 | goto not_found; | |
550 | sseq = nameseq_find_subseq(seq, instance); | |
551 | if (unlikely(!sseq)) | |
552 | goto not_found; | |
553 | spin_lock_bh(&seq->lock); | |
b52124a5 | 554 | info = sseq->info; |
b97bf3fd | 555 | |
617d3c7a | 556 | /* Closest-First Algorithm */ |
b97bf3fd | 557 | if (likely(!*destnode)) { |
f6f0a4d2 AS |
558 | if (!list_empty(&info->node_list)) { |
559 | publ = list_first_entry(&info->node_list, | |
560 | struct publication, | |
561 | node_list); | |
562 | list_move_tail(&publ->node_list, | |
563 | &info->node_list); | |
564 | } else if (!list_empty(&info->cluster_list)) { | |
565 | publ = list_first_entry(&info->cluster_list, | |
566 | struct publication, | |
567 | cluster_list); | |
568 | list_move_tail(&publ->cluster_list, | |
569 | &info->cluster_list); | |
8af4638a | 570 | } else { |
f6f0a4d2 AS |
571 | publ = list_first_entry(&info->zone_list, |
572 | struct publication, | |
573 | zone_list); | |
574 | list_move_tail(&publ->zone_list, | |
575 | &info->zone_list); | |
8af4638a | 576 | } |
b97bf3fd PL |
577 | } |
578 | ||
617d3c7a | 579 | /* Round-Robin Algorithm */ |
b97bf3fd | 580 | else if (*destnode == tipc_own_addr) { |
f6f0a4d2 AS |
581 | if (list_empty(&info->node_list)) |
582 | goto no_match; | |
583 | publ = list_first_entry(&info->node_list, struct publication, | |
584 | node_list); | |
585 | list_move_tail(&publ->node_list, &info->node_list); | |
336ebf5b | 586 | } else if (in_own_cluster_exact(*destnode)) { |
f6f0a4d2 AS |
587 | if (list_empty(&info->cluster_list)) |
588 | goto no_match; | |
589 | publ = list_first_entry(&info->cluster_list, struct publication, | |
590 | cluster_list); | |
591 | list_move_tail(&publ->cluster_list, &info->cluster_list); | |
b97bf3fd | 592 | } else { |
f6f0a4d2 AS |
593 | publ = list_first_entry(&info->zone_list, struct publication, |
594 | zone_list); | |
595 | list_move_tail(&publ->zone_list, &info->zone_list); | |
b97bf3fd | 596 | } |
f6f0a4d2 AS |
597 | |
598 | ref = publ->ref; | |
bc9f8143 | 599 | node = publ->node; |
f6f0a4d2 | 600 | no_match: |
b97bf3fd PL |
601 | spin_unlock_bh(&seq->lock); |
602 | not_found: | |
4323add6 | 603 | read_unlock_bh(&tipc_nametbl_lock); |
bc9f8143 | 604 | *destnode = node; |
f6f0a4d2 | 605 | return ref; |
b97bf3fd PL |
606 | } |
607 | ||
608 | /** | |
4323add6 | 609 | * tipc_nametbl_mc_translate - find multicast destinations |
c4307285 | 610 | * |
b97bf3fd PL |
611 | * Creates list of all local ports that overlap the given multicast address; |
612 | * also determines if any off-node ports overlap. | |
613 | * | |
614 | * Note: Publications with a scope narrower than 'limit' are ignored. | |
615 | * (i.e. local node-scope publications mustn't receive messages arriving | |
616 | * from another node, even if the multcast link brought it here) | |
c4307285 | 617 | * |
b97bf3fd PL |
618 | * Returns non-zero if any off-node ports overlap |
619 | */ | |
4323add6 | 620 | int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit, |
4584310b | 621 | struct tipc_port_list *dports) |
b97bf3fd PL |
622 | { |
623 | struct name_seq *seq; | |
624 | struct sub_seq *sseq; | |
625 | struct sub_seq *sseq_stop; | |
b52124a5 | 626 | struct name_info *info; |
b97bf3fd PL |
627 | int res = 0; |
628 | ||
4323add6 | 629 | read_lock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
630 | seq = nametbl_find_seq(type); |
631 | if (!seq) | |
632 | goto exit; | |
633 | ||
634 | spin_lock_bh(&seq->lock); | |
635 | ||
636 | sseq = seq->sseqs + nameseq_locate_subseq(seq, lower); | |
637 | sseq_stop = seq->sseqs + seq->first_free; | |
638 | for (; sseq != sseq_stop; sseq++) { | |
639 | struct publication *publ; | |
640 | ||
641 | if (sseq->lower > upper) | |
642 | break; | |
968edbe1 | 643 | |
b52124a5 | 644 | info = sseq->info; |
f6f0a4d2 AS |
645 | list_for_each_entry(publ, &info->node_list, node_list) { |
646 | if (publ->scope <= limit) | |
647 | tipc_port_list_add(dports, publ->ref); | |
968edbe1 AS |
648 | } |
649 | ||
b52124a5 | 650 | if (info->cluster_list_size != info->node_list_size) |
968edbe1 | 651 | res = 1; |
b97bf3fd PL |
652 | } |
653 | ||
654 | spin_unlock_bh(&seq->lock); | |
655 | exit: | |
4323add6 | 656 | read_unlock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
657 | return res; |
658 | } | |
659 | ||
c422f1bd | 660 | /* |
4323add6 | 661 | * tipc_nametbl_publish - add name publication to network name tables |
b97bf3fd | 662 | */ |
c4307285 | 663 | struct publication *tipc_nametbl_publish(u32 type, u32 lower, u32 upper, |
ae8509c4 | 664 | u32 scope, u32 port_ref, u32 key) |
b97bf3fd PL |
665 | { |
666 | struct publication *publ; | |
eab8c045 | 667 | struct sk_buff *buf = NULL; |
b97bf3fd | 668 | |
e6a04b1d | 669 | if (table.local_publ_count >= TIPC_MAX_PUBLICATIONS) { |
2cf8aa19 | 670 | pr_warn("Publication failed, local publication limit reached (%u)\n", |
e6a04b1d | 671 | TIPC_MAX_PUBLICATIONS); |
1fc54d8f | 672 | return NULL; |
b97bf3fd | 673 | } |
b97bf3fd | 674 | |
4323add6 | 675 | write_lock_bh(&tipc_nametbl_lock); |
4323add6 | 676 | publ = tipc_nametbl_insert_publ(type, lower, upper, scope, |
b97bf3fd | 677 | tipc_own_addr, port_ref, key); |
fd6eced8 AS |
678 | if (likely(publ)) { |
679 | table.local_publ_count++; | |
eab8c045 | 680 | buf = tipc_named_publish(publ); |
fd6eced8 | 681 | } |
4323add6 | 682 | write_unlock_bh(&tipc_nametbl_lock); |
eab8c045 YX |
683 | |
684 | if (buf) | |
685 | named_cluster_distribute(buf); | |
b97bf3fd PL |
686 | return publ; |
687 | } | |
688 | ||
689 | /** | |
4323add6 | 690 | * tipc_nametbl_withdraw - withdraw name publication from network name tables |
b97bf3fd | 691 | */ |
4323add6 | 692 | int tipc_nametbl_withdraw(u32 type, u32 lower, u32 ref, u32 key) |
b97bf3fd PL |
693 | { |
694 | struct publication *publ; | |
eab8c045 | 695 | struct sk_buff *buf; |
b97bf3fd | 696 | |
4323add6 PL |
697 | write_lock_bh(&tipc_nametbl_lock); |
698 | publ = tipc_nametbl_remove_publ(type, lower, tipc_own_addr, ref, key); | |
f131072c | 699 | if (likely(publ)) { |
b97bf3fd | 700 | table.local_publ_count--; |
eab8c045 | 701 | buf = tipc_named_withdraw(publ); |
4323add6 | 702 | write_unlock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
703 | list_del_init(&publ->pport_list); |
704 | kfree(publ); | |
eab8c045 YX |
705 | |
706 | if (buf) | |
707 | named_cluster_distribute(buf); | |
b97bf3fd PL |
708 | return 1; |
709 | } | |
4323add6 | 710 | write_unlock_bh(&tipc_nametbl_lock); |
2cf8aa19 EH |
711 | pr_err("Unable to remove local publication\n" |
712 | "(type=%u, lower=%u, ref=%u, key=%u)\n", | |
713 | type, lower, ref, key); | |
b97bf3fd PL |
714 | return 0; |
715 | } | |
716 | ||
717 | /** | |
4323add6 | 718 | * tipc_nametbl_subscribe - add a subscription object to the name table |
b97bf3fd | 719 | */ |
fead3909 | 720 | void tipc_nametbl_subscribe(struct tipc_subscription *s) |
b97bf3fd PL |
721 | { |
722 | u32 type = s->seq.type; | |
723 | struct name_seq *seq; | |
724 | ||
c4307285 | 725 | write_lock_bh(&tipc_nametbl_lock); |
b97bf3fd | 726 | seq = nametbl_find_seq(type); |
a016892c | 727 | if (!seq) |
4323add6 | 728 | seq = tipc_nameseq_create(type, &table.types[hash(type)]); |
0e65967e | 729 | if (seq) { |
c4307285 | 730 | spin_lock_bh(&seq->lock); |
c4307285 YH |
731 | tipc_nameseq_subscribe(seq, s); |
732 | spin_unlock_bh(&seq->lock); | |
733 | } else { | |
2cf8aa19 EH |
734 | pr_warn("Failed to create subscription for {%u,%u,%u}\n", |
735 | s->seq.type, s->seq.lower, s->seq.upper); | |
c4307285 YH |
736 | } |
737 | write_unlock_bh(&tipc_nametbl_lock); | |
b97bf3fd PL |
738 | } |
739 | ||
740 | /** | |
4323add6 | 741 | * tipc_nametbl_unsubscribe - remove a subscription object from name table |
b97bf3fd | 742 | */ |
fead3909 | 743 | void tipc_nametbl_unsubscribe(struct tipc_subscription *s) |
b97bf3fd PL |
744 | { |
745 | struct name_seq *seq; | |
746 | ||
c4307285 YH |
747 | write_lock_bh(&tipc_nametbl_lock); |
748 | seq = nametbl_find_seq(s->seq.type); | |
0e65967e | 749 | if (seq != NULL) { |
c4307285 YH |
750 | spin_lock_bh(&seq->lock); |
751 | list_del_init(&s->nameseq_list); | |
752 | spin_unlock_bh(&seq->lock); | |
f7fb9d20 | 753 | nameseq_delete_empty(seq); |
c4307285 YH |
754 | } |
755 | write_unlock_bh(&tipc_nametbl_lock); | |
b97bf3fd PL |
756 | } |
757 | ||
758 | ||
759 | /** | |
2c53040f | 760 | * subseq_list - print specified sub-sequence contents into the given buffer |
b97bf3fd | 761 | */ |
dc1aed37 | 762 | static int subseq_list(struct sub_seq *sseq, char *buf, int len, u32 depth, |
ae8509c4 | 763 | u32 index) |
b97bf3fd PL |
764 | { |
765 | char portIdStr[27]; | |
c2de5814 | 766 | const char *scope_str[] = {"", " zone", " cluster", " node"}; |
f6f0a4d2 AS |
767 | struct publication *publ; |
768 | struct name_info *info; | |
dc1aed37 | 769 | int ret; |
b97bf3fd | 770 | |
dc1aed37 | 771 | ret = tipc_snprintf(buf, len, "%-10u %-10u ", sseq->lower, sseq->upper); |
b97bf3fd | 772 | |
f6f0a4d2 | 773 | if (depth == 2) { |
dc1aed37 EH |
774 | ret += tipc_snprintf(buf - ret, len + ret, "\n"); |
775 | return ret; | |
b97bf3fd PL |
776 | } |
777 | ||
f6f0a4d2 AS |
778 | info = sseq->info; |
779 | ||
780 | list_for_each_entry(publ, &info->zone_list, zone_list) { | |
0e65967e | 781 | sprintf(portIdStr, "<%u.%u.%u:%u>", |
b97bf3fd PL |
782 | tipc_zone(publ->node), tipc_cluster(publ->node), |
783 | tipc_node(publ->node), publ->ref); | |
dc1aed37 | 784 | ret += tipc_snprintf(buf + ret, len - ret, "%-26s ", portIdStr); |
b97bf3fd | 785 | if (depth > 3) { |
dc1aed37 EH |
786 | ret += tipc_snprintf(buf + ret, len - ret, "%-10u %s", |
787 | publ->key, scope_str[publ->scope]); | |
b97bf3fd | 788 | } |
f6f0a4d2 | 789 | if (!list_is_last(&publ->zone_list, &info->zone_list)) |
dc1aed37 EH |
790 | ret += tipc_snprintf(buf + ret, len - ret, |
791 | "\n%33s", " "); | |
adccff34 | 792 | } |
b97bf3fd | 793 | |
dc1aed37 EH |
794 | ret += tipc_snprintf(buf + ret, len - ret, "\n"); |
795 | return ret; | |
b97bf3fd PL |
796 | } |
797 | ||
798 | /** | |
2c53040f | 799 | * nameseq_list - print specified name sequence contents into the given buffer |
b97bf3fd | 800 | */ |
dc1aed37 | 801 | static int nameseq_list(struct name_seq *seq, char *buf, int len, u32 depth, |
ae8509c4 | 802 | u32 type, u32 lowbound, u32 upbound, u32 index) |
b97bf3fd PL |
803 | { |
804 | struct sub_seq *sseq; | |
805 | char typearea[11]; | |
dc1aed37 | 806 | int ret = 0; |
b97bf3fd | 807 | |
0f15d364 | 808 | if (seq->first_free == 0) |
dc1aed37 | 809 | return 0; |
0f15d364 | 810 | |
b97bf3fd PL |
811 | sprintf(typearea, "%-10u", seq->type); |
812 | ||
813 | if (depth == 1) { | |
dc1aed37 EH |
814 | ret += tipc_snprintf(buf, len, "%s\n", typearea); |
815 | return ret; | |
b97bf3fd PL |
816 | } |
817 | ||
818 | for (sseq = seq->sseqs; sseq != &seq->sseqs[seq->first_free]; sseq++) { | |
819 | if ((lowbound <= sseq->upper) && (upbound >= sseq->lower)) { | |
dc1aed37 EH |
820 | ret += tipc_snprintf(buf + ret, len - ret, "%s ", |
821 | typearea); | |
307fdf5e | 822 | spin_lock_bh(&seq->lock); |
dc1aed37 EH |
823 | ret += subseq_list(sseq, buf + ret, len - ret, |
824 | depth, index); | |
307fdf5e | 825 | spin_unlock_bh(&seq->lock); |
b97bf3fd PL |
826 | sprintf(typearea, "%10s", " "); |
827 | } | |
828 | } | |
dc1aed37 | 829 | return ret; |
b97bf3fd PL |
830 | } |
831 | ||
832 | /** | |
833 | * nametbl_header - print name table header into the given buffer | |
834 | */ | |
dc1aed37 | 835 | static int nametbl_header(char *buf, int len, u32 depth) |
b97bf3fd | 836 | { |
c2de5814 AS |
837 | const char *header[] = { |
838 | "Type ", | |
839 | "Lower Upper ", | |
840 | "Port Identity ", | |
841 | "Publication Scope" | |
842 | }; | |
843 | ||
844 | int i; | |
dc1aed37 | 845 | int ret = 0; |
c2de5814 AS |
846 | |
847 | if (depth > 4) | |
848 | depth = 4; | |
849 | for (i = 0; i < depth; i++) | |
dc1aed37 EH |
850 | ret += tipc_snprintf(buf + ret, len - ret, header[i]); |
851 | ret += tipc_snprintf(buf + ret, len - ret, "\n"); | |
852 | return ret; | |
b97bf3fd PL |
853 | } |
854 | ||
855 | /** | |
856 | * nametbl_list - print specified name table contents into the given buffer | |
857 | */ | |
dc1aed37 | 858 | static int nametbl_list(char *buf, int len, u32 depth_info, |
ae8509c4 | 859 | u32 type, u32 lowbound, u32 upbound) |
b97bf3fd PL |
860 | { |
861 | struct hlist_head *seq_head; | |
b97bf3fd PL |
862 | struct name_seq *seq; |
863 | int all_types; | |
dc1aed37 | 864 | int ret = 0; |
b97bf3fd PL |
865 | u32 depth; |
866 | u32 i; | |
867 | ||
868 | all_types = (depth_info & TIPC_NTQ_ALLTYPES); | |
869 | depth = (depth_info & ~TIPC_NTQ_ALLTYPES); | |
870 | ||
871 | if (depth == 0) | |
dc1aed37 | 872 | return 0; |
b97bf3fd PL |
873 | |
874 | if (all_types) { | |
875 | /* display all entries in name table to specified depth */ | |
dc1aed37 | 876 | ret += nametbl_header(buf, len, depth); |
b97bf3fd PL |
877 | lowbound = 0; |
878 | upbound = ~0; | |
f046e7d9 | 879 | for (i = 0; i < TIPC_NAMETBL_SIZE; i++) { |
b97bf3fd | 880 | seq_head = &table.types[i]; |
b67bfe0d | 881 | hlist_for_each_entry(seq, seq_head, ns_list) { |
dc1aed37 EH |
882 | ret += nameseq_list(seq, buf + ret, len - ret, |
883 | depth, seq->type, | |
884 | lowbound, upbound, i); | |
b97bf3fd PL |
885 | } |
886 | } | |
887 | } else { | |
888 | /* display only the sequence that matches the specified type */ | |
889 | if (upbound < lowbound) { | |
dc1aed37 EH |
890 | ret += tipc_snprintf(buf + ret, len - ret, |
891 | "invalid name sequence specified\n"); | |
892 | return ret; | |
b97bf3fd | 893 | } |
dc1aed37 | 894 | ret += nametbl_header(buf + ret, len - ret, depth); |
b97bf3fd PL |
895 | i = hash(type); |
896 | seq_head = &table.types[i]; | |
b67bfe0d | 897 | hlist_for_each_entry(seq, seq_head, ns_list) { |
b97bf3fd | 898 | if (seq->type == type) { |
dc1aed37 EH |
899 | ret += nameseq_list(seq, buf + ret, len - ret, |
900 | depth, type, | |
901 | lowbound, upbound, i); | |
b97bf3fd PL |
902 | break; |
903 | } | |
904 | } | |
905 | } | |
dc1aed37 | 906 | return ret; |
b97bf3fd PL |
907 | } |
908 | ||
4323add6 | 909 | struct sk_buff *tipc_nametbl_get(const void *req_tlv_area, int req_tlv_space) |
b97bf3fd PL |
910 | { |
911 | struct sk_buff *buf; | |
912 | struct tipc_name_table_query *argv; | |
913 | struct tlv_desc *rep_tlv; | |
dc1aed37 EH |
914 | char *pb; |
915 | int pb_len; | |
b97bf3fd PL |
916 | int str_len; |
917 | ||
918 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NAME_TBL_QUERY)) | |
4323add6 | 919 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd | 920 | |
dc1aed37 | 921 | buf = tipc_cfg_reply_alloc(TLV_SPACE(ULTRA_STRING_MAX_LEN)); |
b97bf3fd PL |
922 | if (!buf) |
923 | return NULL; | |
924 | ||
925 | rep_tlv = (struct tlv_desc *)buf->data; | |
dc1aed37 EH |
926 | pb = TLV_DATA(rep_tlv); |
927 | pb_len = ULTRA_STRING_MAX_LEN; | |
b97bf3fd | 928 | argv = (struct tipc_name_table_query *)TLV_DATA(req_tlv_area); |
4323add6 | 929 | read_lock_bh(&tipc_nametbl_lock); |
dc1aed37 EH |
930 | str_len = nametbl_list(pb, pb_len, ntohl(argv->depth), |
931 | ntohl(argv->type), | |
932 | ntohl(argv->lowbound), ntohl(argv->upbound)); | |
4323add6 | 933 | read_unlock_bh(&tipc_nametbl_lock); |
dc1aed37 | 934 | str_len += 1; /* for "\0" */ |
b97bf3fd PL |
935 | skb_put(buf, TLV_SPACE(str_len)); |
936 | TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len); | |
937 | ||
938 | return buf; | |
939 | } | |
940 | ||
4323add6 | 941 | int tipc_nametbl_init(void) |
b97bf3fd | 942 | { |
f046e7d9 | 943 | table.types = kcalloc(TIPC_NAMETBL_SIZE, sizeof(struct hlist_head), |
4e3e6dcb | 944 | GFP_ATOMIC); |
b97bf3fd PL |
945 | if (!table.types) |
946 | return -ENOMEM; | |
947 | ||
b97bf3fd | 948 | table.local_publ_count = 0; |
b97bf3fd PL |
949 | return 0; |
950 | } | |
951 | ||
1bb8dce5 EH |
952 | /** |
953 | * tipc_purge_publications - remove all publications for a given type | |
954 | * | |
955 | * tipc_nametbl_lock must be held when calling this function | |
956 | */ | |
957 | static void tipc_purge_publications(struct name_seq *seq) | |
958 | { | |
959 | struct publication *publ, *safe; | |
960 | struct sub_seq *sseq; | |
961 | struct name_info *info; | |
962 | ||
963 | if (!seq->sseqs) { | |
964 | nameseq_delete_empty(seq); | |
965 | return; | |
966 | } | |
967 | sseq = seq->sseqs; | |
968 | info = sseq->info; | |
969 | list_for_each_entry_safe(publ, safe, &info->zone_list, zone_list) { | |
970 | tipc_nametbl_remove_publ(publ->type, publ->lower, publ->node, | |
971 | publ->ref, publ->key); | |
1621b94d | 972 | kfree(publ); |
1bb8dce5 EH |
973 | } |
974 | } | |
975 | ||
4323add6 | 976 | void tipc_nametbl_stop(void) |
b97bf3fd | 977 | { |
b97bf3fd | 978 | u32 i; |
1bb8dce5 EH |
979 | struct name_seq *seq; |
980 | struct hlist_head *seq_head; | |
981 | struct hlist_node *safe; | |
b97bf3fd | 982 | |
1bb8dce5 EH |
983 | /* Verify name table is empty and purge any lingering |
984 | * publications, then release the name table | |
985 | */ | |
4323add6 | 986 | write_lock_bh(&tipc_nametbl_lock); |
f046e7d9 | 987 | for (i = 0; i < TIPC_NAMETBL_SIZE; i++) { |
f705ab95 PG |
988 | if (hlist_empty(&table.types[i])) |
989 | continue; | |
1bb8dce5 EH |
990 | seq_head = &table.types[i]; |
991 | hlist_for_each_entry_safe(seq, safe, seq_head, ns_list) { | |
992 | tipc_purge_publications(seq); | |
993 | } | |
b97bf3fd PL |
994 | } |
995 | kfree(table.types); | |
996 | table.types = NULL; | |
4323add6 | 997 | write_unlock_bh(&tipc_nametbl_lock); |
b97bf3fd | 998 | } |