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 | { |
0da974f4 | 151 | struct sub_seq *sseq = kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC); |
b97bf3fd PL |
152 | return sseq; |
153 | } | |
154 | ||
155 | /** | |
4323add6 | 156 | * tipc_nameseq_create - create a name sequence structure for the specified 'type' |
c4307285 | 157 | * |
b97bf3fd PL |
158 | * Allocates a single sub-sequence structure and sets it to all 0's. |
159 | */ | |
988f088a | 160 | static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head) |
b97bf3fd | 161 | { |
0da974f4 | 162 | struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC); |
4323add6 | 163 | struct sub_seq *sseq = tipc_subseq_alloc(1); |
b97bf3fd PL |
164 | |
165 | if (!nseq || !sseq) { | |
2cf8aa19 | 166 | pr_warn("Name sequence creation failed, no memory\n"); |
b97bf3fd PL |
167 | kfree(nseq); |
168 | kfree(sseq); | |
1fc54d8f | 169 | return NULL; |
b97bf3fd PL |
170 | } |
171 | ||
34af946a | 172 | spin_lock_init(&nseq->lock); |
b97bf3fd PL |
173 | nseq->type = type; |
174 | nseq->sseqs = sseq; | |
b97bf3fd PL |
175 | nseq->alloc = 1; |
176 | INIT_HLIST_NODE(&nseq->ns_list); | |
177 | INIT_LIST_HEAD(&nseq->subscriptions); | |
178 | hlist_add_head(&nseq->ns_list, seq_head); | |
179 | return nseq; | |
180 | } | |
181 | ||
f7fb9d20 AS |
182 | /* |
183 | * nameseq_delete_empty - deletes a name sequence structure if now unused | |
184 | */ | |
185 | static void nameseq_delete_empty(struct name_seq *seq) | |
186 | { | |
187 | if (!seq->first_free && list_empty(&seq->subscriptions)) { | |
188 | hlist_del_init(&seq->ns_list); | |
189 | kfree(seq->sseqs); | |
190 | kfree(seq); | |
191 | } | |
192 | } | |
193 | ||
2c53040f | 194 | /** |
b97bf3fd | 195 | * nameseq_find_subseq - find sub-sequence (if any) matching a name instance |
c4307285 | 196 | * |
b97bf3fd PL |
197 | * Very time-critical, so binary searches through sub-sequence array. |
198 | */ | |
05790c64 SR |
199 | static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq, |
200 | u32 instance) | |
b97bf3fd PL |
201 | { |
202 | struct sub_seq *sseqs = nseq->sseqs; | |
203 | int low = 0; | |
204 | int high = nseq->first_free - 1; | |
205 | int mid; | |
206 | ||
207 | while (low <= high) { | |
208 | mid = (low + high) / 2; | |
209 | if (instance < sseqs[mid].lower) | |
210 | high = mid - 1; | |
211 | else if (instance > sseqs[mid].upper) | |
212 | low = mid + 1; | |
213 | else | |
214 | return &sseqs[mid]; | |
215 | } | |
1fc54d8f | 216 | return NULL; |
b97bf3fd PL |
217 | } |
218 | ||
219 | /** | |
220 | * nameseq_locate_subseq - determine position of name instance in sub-sequence | |
c4307285 | 221 | * |
b97bf3fd PL |
222 | * Returns index in sub-sequence array of the entry that contains the specified |
223 | * instance value; if no entry contains that value, returns the position | |
224 | * where a new entry for it would be inserted in the array. | |
225 | * | |
226 | * Note: Similar to binary search code for locating a sub-sequence. | |
227 | */ | |
b97bf3fd PL |
228 | static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance) |
229 | { | |
230 | struct sub_seq *sseqs = nseq->sseqs; | |
231 | int low = 0; | |
232 | int high = nseq->first_free - 1; | |
233 | int mid; | |
234 | ||
235 | while (low <= high) { | |
236 | mid = (low + high) / 2; | |
237 | if (instance < sseqs[mid].lower) | |
238 | high = mid - 1; | |
239 | else if (instance > sseqs[mid].upper) | |
240 | low = mid + 1; | |
241 | else | |
242 | return mid; | |
243 | } | |
244 | return low; | |
245 | } | |
246 | ||
247 | /** | |
617d3c7a | 248 | * tipc_nameseq_insert_publ |
b97bf3fd | 249 | */ |
988f088a AB |
250 | static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq, |
251 | u32 type, u32 lower, u32 upper, | |
252 | u32 scope, u32 node, u32 port, u32 key) | |
b97bf3fd | 253 | { |
fead3909 PG |
254 | struct tipc_subscription *s; |
255 | struct tipc_subscription *st; | |
b97bf3fd PL |
256 | struct publication *publ; |
257 | struct sub_seq *sseq; | |
b52124a5 | 258 | struct name_info *info; |
b97bf3fd PL |
259 | int created_subseq = 0; |
260 | ||
b97bf3fd | 261 | sseq = nameseq_find_subseq(nseq, lower); |
b97bf3fd PL |
262 | if (sseq) { |
263 | ||
264 | /* Lower end overlaps existing entry => need an exact match */ | |
b97bf3fd | 265 | if ((sseq->lower != lower) || (sseq->upper != upper)) { |
2cf8aa19 EH |
266 | pr_warn("Cannot publish {%u,%u,%u}, overlap error\n", |
267 | type, lower, upper); | |
1fc54d8f | 268 | return NULL; |
b97bf3fd | 269 | } |
b52124a5 AS |
270 | |
271 | info = sseq->info; | |
f80c24d9 AS |
272 | |
273 | /* Check if an identical publication already exists */ | |
274 | list_for_each_entry(publ, &info->zone_list, zone_list) { | |
275 | if ((publ->ref == port) && (publ->key == key) && | |
276 | (!publ->node || (publ->node == node))) | |
277 | return NULL; | |
278 | } | |
b97bf3fd PL |
279 | } else { |
280 | u32 inspos; | |
281 | struct sub_seq *freesseq; | |
282 | ||
283 | /* Find where lower end should be inserted */ | |
b97bf3fd PL |
284 | inspos = nameseq_locate_subseq(nseq, lower); |
285 | ||
286 | /* Fail if upper end overlaps into an existing entry */ | |
b97bf3fd PL |
287 | if ((inspos < nseq->first_free) && |
288 | (upper >= nseq->sseqs[inspos].lower)) { | |
2cf8aa19 EH |
289 | pr_warn("Cannot publish {%u,%u,%u}, overlap error\n", |
290 | type, lower, upper); | |
1fc54d8f | 291 | return NULL; |
b97bf3fd PL |
292 | } |
293 | ||
294 | /* Ensure there is space for new sub-sequence */ | |
b97bf3fd | 295 | if (nseq->first_free == nseq->alloc) { |
9ab230f8 AS |
296 | struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2); |
297 | ||
298 | if (!sseqs) { | |
2cf8aa19 EH |
299 | pr_warn("Cannot publish {%u,%u,%u}, no memory\n", |
300 | type, lower, upper); | |
1fc54d8f | 301 | return NULL; |
b97bf3fd | 302 | } |
9ab230f8 AS |
303 | memcpy(sseqs, nseq->sseqs, |
304 | nseq->alloc * sizeof(struct sub_seq)); | |
305 | kfree(nseq->sseqs); | |
306 | nseq->sseqs = sseqs; | |
307 | nseq->alloc *= 2; | |
b97bf3fd | 308 | } |
b97bf3fd | 309 | |
b52124a5 AS |
310 | info = kzalloc(sizeof(*info), GFP_ATOMIC); |
311 | if (!info) { | |
2cf8aa19 EH |
312 | pr_warn("Cannot publish {%u,%u,%u}, no memory\n", |
313 | type, lower, upper); | |
b52124a5 AS |
314 | return NULL; |
315 | } | |
316 | ||
f6f0a4d2 AS |
317 | INIT_LIST_HEAD(&info->node_list); |
318 | INIT_LIST_HEAD(&info->cluster_list); | |
319 | INIT_LIST_HEAD(&info->zone_list); | |
320 | ||
b97bf3fd | 321 | /* Insert new sub-sequence */ |
b97bf3fd PL |
322 | sseq = &nseq->sseqs[inspos]; |
323 | freesseq = &nseq->sseqs[nseq->first_free]; | |
0e65967e AS |
324 | memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq)); |
325 | memset(sseq, 0, sizeof(*sseq)); | |
b97bf3fd PL |
326 | nseq->first_free++; |
327 | sseq->lower = lower; | |
328 | sseq->upper = upper; | |
b52124a5 | 329 | sseq->info = info; |
b97bf3fd PL |
330 | created_subseq = 1; |
331 | } | |
b97bf3fd | 332 | |
617d3c7a | 333 | /* Insert a publication */ |
b97bf3fd PL |
334 | publ = publ_create(type, lower, upper, scope, node, port, key); |
335 | if (!publ) | |
1fc54d8f | 336 | return NULL; |
b97bf3fd | 337 | |
f6f0a4d2 | 338 | list_add(&publ->zone_list, &info->zone_list); |
b52124a5 | 339 | info->zone_list_size++; |
b97bf3fd | 340 | |
d4f5c12c | 341 | if (in_own_cluster(node)) { |
f6f0a4d2 | 342 | list_add(&publ->cluster_list, &info->cluster_list); |
b52124a5 | 343 | info->cluster_list_size++; |
b97bf3fd PL |
344 | } |
345 | ||
d4f5c12c | 346 | if (in_own_node(node)) { |
f6f0a4d2 | 347 | list_add(&publ->node_list, &info->node_list); |
b52124a5 | 348 | info->node_list_size++; |
b97bf3fd PL |
349 | } |
350 | ||
617d3c7a | 351 | /* Any subscriptions waiting for notification? */ |
b97bf3fd | 352 | list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { |
4323add6 PL |
353 | tipc_subscr_report_overlap(s, |
354 | publ->lower, | |
355 | publ->upper, | |
356 | TIPC_PUBLISHED, | |
c4307285 | 357 | publ->ref, |
4323add6 PL |
358 | publ->node, |
359 | created_subseq); | |
b97bf3fd PL |
360 | } |
361 | return publ; | |
362 | } | |
363 | ||
364 | /** | |
617d3c7a | 365 | * tipc_nameseq_remove_publ |
c4307285 | 366 | * |
f131072c AS |
367 | * NOTE: There may be cases where TIPC is asked to remove a publication |
368 | * that is not in the name table. For example, if another node issues a | |
369 | * publication for a name sequence that overlaps an existing name sequence | |
370 | * the publication will not be recorded, which means the publication won't | |
371 | * be found when the name sequence is later withdrawn by that node. | |
372 | * A failed withdraw request simply returns a failure indication and lets the | |
373 | * caller issue any error or warning messages associated with such a problem. | |
b97bf3fd | 374 | */ |
988f088a AB |
375 | static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 inst, |
376 | u32 node, u32 ref, u32 key) | |
b97bf3fd PL |
377 | { |
378 | struct publication *publ; | |
b97bf3fd | 379 | struct sub_seq *sseq = nameseq_find_subseq(nseq, inst); |
b52124a5 | 380 | struct name_info *info; |
b97bf3fd | 381 | struct sub_seq *free; |
fead3909 | 382 | struct tipc_subscription *s, *st; |
b97bf3fd PL |
383 | int removed_subseq = 0; |
384 | ||
f131072c | 385 | if (!sseq) |
1fc54d8f | 386 | return NULL; |
f131072c | 387 | |
b52124a5 AS |
388 | info = sseq->info; |
389 | ||
f6f0a4d2 | 390 | /* Locate publication, if it exists */ |
f6f0a4d2 AS |
391 | list_for_each_entry(publ, &info->zone_list, zone_list) { |
392 | if ((publ->key == key) && (publ->ref == ref) && | |
393 | (!publ->node || (publ->node == node))) | |
394 | goto found; | |
395 | } | |
396 | return NULL; | |
c4307285 | 397 | |
f6f0a4d2 AS |
398 | found: |
399 | /* Remove publication from zone scope list */ | |
f6f0a4d2 | 400 | list_del(&publ->zone_list); |
b52124a5 | 401 | info->zone_list_size--; |
b97bf3fd | 402 | |
f131072c | 403 | /* Remove publication from cluster scope list, if present */ |
d4f5c12c | 404 | if (in_own_cluster(node)) { |
f6f0a4d2 | 405 | list_del(&publ->cluster_list); |
b52124a5 | 406 | info->cluster_list_size--; |
b97bf3fd | 407 | } |
f131072c AS |
408 | |
409 | /* Remove publication from node scope list, if present */ | |
d4f5c12c | 410 | if (in_own_node(node)) { |
f6f0a4d2 | 411 | list_del(&publ->node_list); |
b52124a5 | 412 | info->node_list_size--; |
b97bf3fd | 413 | } |
b97bf3fd | 414 | |
f131072c | 415 | /* Contract subseq list if no more publications for that subseq */ |
f6f0a4d2 | 416 | if (list_empty(&info->zone_list)) { |
b52124a5 | 417 | kfree(info); |
b97bf3fd | 418 | free = &nseq->sseqs[nseq->first_free--]; |
0e65967e | 419 | memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq)); |
b97bf3fd PL |
420 | removed_subseq = 1; |
421 | } | |
422 | ||
f131072c | 423 | /* Notify any waiting subscriptions */ |
b97bf3fd | 424 | list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { |
4323add6 PL |
425 | tipc_subscr_report_overlap(s, |
426 | publ->lower, | |
427 | publ->upper, | |
c4307285 YH |
428 | TIPC_WITHDRAWN, |
429 | publ->ref, | |
4323add6 PL |
430 | publ->node, |
431 | removed_subseq); | |
b97bf3fd | 432 | } |
f131072c | 433 | |
b97bf3fd PL |
434 | return publ; |
435 | } | |
436 | ||
437 | /** | |
2c53040f | 438 | * tipc_nameseq_subscribe - attach a subscription, and issue |
b97bf3fd PL |
439 | * the prescribed number of events if there is any sub- |
440 | * sequence overlapping with the requested sequence | |
441 | */ | |
fead3909 PG |
442 | static void tipc_nameseq_subscribe(struct name_seq *nseq, |
443 | struct tipc_subscription *s) | |
b97bf3fd PL |
444 | { |
445 | struct sub_seq *sseq = nseq->sseqs; | |
446 | ||
447 | list_add(&s->nameseq_list, &nseq->subscriptions); | |
448 | ||
449 | if (!sseq) | |
450 | return; | |
451 | ||
452 | while (sseq != &nseq->sseqs[nseq->first_free]) { | |
f6f0a4d2 AS |
453 | if (tipc_subscr_overlap(s, sseq->lower, sseq->upper)) { |
454 | struct publication *crs; | |
455 | struct name_info *info = sseq->info; | |
b97bf3fd PL |
456 | int must_report = 1; |
457 | ||
f6f0a4d2 | 458 | list_for_each_entry(crs, &info->zone_list, zone_list) { |
c4307285 YH |
459 | tipc_subscr_report_overlap(s, |
460 | sseq->lower, | |
4323add6 PL |
461 | sseq->upper, |
462 | TIPC_PUBLISHED, | |
463 | crs->ref, | |
464 | crs->node, | |
465 | must_report); | |
b97bf3fd | 466 | must_report = 0; |
f6f0a4d2 | 467 | } |
b97bf3fd PL |
468 | } |
469 | sseq++; | |
470 | } | |
471 | } | |
472 | ||
473 | static struct name_seq *nametbl_find_seq(u32 type) | |
474 | { | |
475 | struct hlist_head *seq_head; | |
b97bf3fd PL |
476 | struct name_seq *ns; |
477 | ||
b97bf3fd | 478 | seq_head = &table.types[hash(type)]; |
b67bfe0d | 479 | hlist_for_each_entry(ns, seq_head, ns_list) { |
b29f1428 | 480 | if (ns->type == type) |
b97bf3fd | 481 | return ns; |
b97bf3fd PL |
482 | } |
483 | ||
1fc54d8f | 484 | return NULL; |
b97bf3fd PL |
485 | }; |
486 | ||
4323add6 PL |
487 | struct publication *tipc_nametbl_insert_publ(u32 type, u32 lower, u32 upper, |
488 | u32 scope, u32 node, u32 port, u32 key) | |
b97bf3fd PL |
489 | { |
490 | struct name_seq *seq = nametbl_find_seq(type); | |
491 | ||
8f177896 AS |
492 | if ((scope < TIPC_ZONE_SCOPE) || (scope > TIPC_NODE_SCOPE) || |
493 | (lower > upper)) { | |
2cf8aa19 EH |
494 | pr_debug("Failed to publish illegal {%u,%u,%u} with scope %u\n", |
495 | type, lower, upper, scope); | |
1fc54d8f | 496 | return NULL; |
b97bf3fd PL |
497 | } |
498 | ||
b29f1428 | 499 | if (!seq) |
4323add6 | 500 | seq = tipc_nameseq_create(type, &table.types[hash(type)]); |
b97bf3fd | 501 | if (!seq) |
1fc54d8f | 502 | return NULL; |
b97bf3fd | 503 | |
4323add6 PL |
504 | return tipc_nameseq_insert_publ(seq, type, lower, upper, |
505 | scope, node, port, key); | |
b97bf3fd PL |
506 | } |
507 | ||
c4307285 | 508 | struct publication *tipc_nametbl_remove_publ(u32 type, u32 lower, |
4323add6 | 509 | u32 node, u32 ref, u32 key) |
b97bf3fd PL |
510 | { |
511 | struct publication *publ; | |
512 | struct name_seq *seq = nametbl_find_seq(type); | |
513 | ||
514 | if (!seq) | |
1fc54d8f | 515 | return NULL; |
b97bf3fd | 516 | |
4323add6 | 517 | publ = tipc_nameseq_remove_publ(seq, lower, node, ref, key); |
f7fb9d20 | 518 | nameseq_delete_empty(seq); |
b97bf3fd PL |
519 | return publ; |
520 | } | |
521 | ||
2c53040f | 522 | /** |
bc9f8143 | 523 | * tipc_nametbl_translate - perform name translation |
b97bf3fd | 524 | * |
bc9f8143 AS |
525 | * On entry, 'destnode' is the search domain used during translation. |
526 | * | |
527 | * On exit: | |
528 | * - if name translation is deferred to another node/cluster/zone, | |
529 | * leaves 'destnode' unchanged (will be non-zero) and returns 0 | |
530 | * - if name translation is attempted and succeeds, sets 'destnode' | |
531 | * to publishing node and returns port reference (will be non-zero) | |
532 | * - if name translation is attempted and fails, sets 'destnode' to 0 | |
533 | * and returns 0 | |
b97bf3fd | 534 | */ |
4323add6 | 535 | u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode) |
b97bf3fd PL |
536 | { |
537 | struct sub_seq *sseq; | |
b52124a5 | 538 | struct name_info *info; |
f6f0a4d2 | 539 | struct publication *publ; |
b97bf3fd | 540 | struct name_seq *seq; |
f6f0a4d2 | 541 | u32 ref = 0; |
bc9f8143 | 542 | u32 node = 0; |
b97bf3fd | 543 | |
c68ca7b7 | 544 | if (!tipc_in_scope(*destnode, tipc_own_addr)) |
b97bf3fd PL |
545 | return 0; |
546 | ||
4323add6 | 547 | read_lock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
548 | seq = nametbl_find_seq(type); |
549 | if (unlikely(!seq)) | |
550 | goto not_found; | |
551 | sseq = nameseq_find_subseq(seq, instance); | |
552 | if (unlikely(!sseq)) | |
553 | goto not_found; | |
554 | spin_lock_bh(&seq->lock); | |
b52124a5 | 555 | info = sseq->info; |
b97bf3fd | 556 | |
617d3c7a | 557 | /* Closest-First Algorithm */ |
b97bf3fd | 558 | if (likely(!*destnode)) { |
f6f0a4d2 AS |
559 | if (!list_empty(&info->node_list)) { |
560 | publ = list_first_entry(&info->node_list, | |
561 | struct publication, | |
562 | node_list); | |
563 | list_move_tail(&publ->node_list, | |
564 | &info->node_list); | |
565 | } else if (!list_empty(&info->cluster_list)) { | |
566 | publ = list_first_entry(&info->cluster_list, | |
567 | struct publication, | |
568 | cluster_list); | |
569 | list_move_tail(&publ->cluster_list, | |
570 | &info->cluster_list); | |
8af4638a | 571 | } else { |
f6f0a4d2 AS |
572 | publ = list_first_entry(&info->zone_list, |
573 | struct publication, | |
574 | zone_list); | |
575 | list_move_tail(&publ->zone_list, | |
576 | &info->zone_list); | |
8af4638a | 577 | } |
b97bf3fd PL |
578 | } |
579 | ||
617d3c7a | 580 | /* Round-Robin Algorithm */ |
b97bf3fd | 581 | else if (*destnode == tipc_own_addr) { |
f6f0a4d2 AS |
582 | if (list_empty(&info->node_list)) |
583 | goto no_match; | |
584 | publ = list_first_entry(&info->node_list, struct publication, | |
585 | node_list); | |
586 | list_move_tail(&publ->node_list, &info->node_list); | |
336ebf5b | 587 | } else if (in_own_cluster_exact(*destnode)) { |
f6f0a4d2 AS |
588 | if (list_empty(&info->cluster_list)) |
589 | goto no_match; | |
590 | publ = list_first_entry(&info->cluster_list, struct publication, | |
591 | cluster_list); | |
592 | list_move_tail(&publ->cluster_list, &info->cluster_list); | |
b97bf3fd | 593 | } else { |
f6f0a4d2 AS |
594 | publ = list_first_entry(&info->zone_list, struct publication, |
595 | zone_list); | |
596 | list_move_tail(&publ->zone_list, &info->zone_list); | |
b97bf3fd | 597 | } |
f6f0a4d2 AS |
598 | |
599 | ref = publ->ref; | |
bc9f8143 | 600 | node = publ->node; |
f6f0a4d2 | 601 | no_match: |
b97bf3fd PL |
602 | spin_unlock_bh(&seq->lock); |
603 | not_found: | |
4323add6 | 604 | read_unlock_bh(&tipc_nametbl_lock); |
bc9f8143 | 605 | *destnode = node; |
f6f0a4d2 | 606 | return ref; |
b97bf3fd PL |
607 | } |
608 | ||
609 | /** | |
4323add6 | 610 | * tipc_nametbl_mc_translate - find multicast destinations |
c4307285 | 611 | * |
b97bf3fd PL |
612 | * Creates list of all local ports that overlap the given multicast address; |
613 | * also determines if any off-node ports overlap. | |
614 | * | |
615 | * Note: Publications with a scope narrower than 'limit' are ignored. | |
616 | * (i.e. local node-scope publications mustn't receive messages arriving | |
617 | * from another node, even if the multcast link brought it here) | |
c4307285 | 618 | * |
b97bf3fd PL |
619 | * Returns non-zero if any off-node ports overlap |
620 | */ | |
4323add6 | 621 | int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit, |
4584310b | 622 | struct tipc_port_list *dports) |
b97bf3fd PL |
623 | { |
624 | struct name_seq *seq; | |
625 | struct sub_seq *sseq; | |
626 | struct sub_seq *sseq_stop; | |
b52124a5 | 627 | struct name_info *info; |
b97bf3fd PL |
628 | int res = 0; |
629 | ||
4323add6 | 630 | read_lock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
631 | seq = nametbl_find_seq(type); |
632 | if (!seq) | |
633 | goto exit; | |
634 | ||
635 | spin_lock_bh(&seq->lock); | |
636 | ||
637 | sseq = seq->sseqs + nameseq_locate_subseq(seq, lower); | |
638 | sseq_stop = seq->sseqs + seq->first_free; | |
639 | for (; sseq != sseq_stop; sseq++) { | |
640 | struct publication *publ; | |
641 | ||
642 | if (sseq->lower > upper) | |
643 | break; | |
968edbe1 | 644 | |
b52124a5 | 645 | info = sseq->info; |
f6f0a4d2 AS |
646 | list_for_each_entry(publ, &info->node_list, node_list) { |
647 | if (publ->scope <= limit) | |
648 | tipc_port_list_add(dports, publ->ref); | |
968edbe1 AS |
649 | } |
650 | ||
b52124a5 | 651 | if (info->cluster_list_size != info->node_list_size) |
968edbe1 | 652 | res = 1; |
b97bf3fd PL |
653 | } |
654 | ||
655 | spin_unlock_bh(&seq->lock); | |
656 | exit: | |
4323add6 | 657 | read_unlock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
658 | return res; |
659 | } | |
660 | ||
c422f1bd | 661 | /* |
4323add6 | 662 | * tipc_nametbl_publish - add name publication to network name tables |
b97bf3fd | 663 | */ |
c4307285 | 664 | struct publication *tipc_nametbl_publish(u32 type, u32 lower, u32 upper, |
b97bf3fd PL |
665 | u32 scope, u32 port_ref, u32 key) |
666 | { | |
667 | struct publication *publ; | |
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++; | |
4323add6 | 680 | tipc_named_publish(publ); |
fd6eced8 | 681 | } |
4323add6 | 682 | write_unlock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
683 | return publ; |
684 | } | |
685 | ||
686 | /** | |
4323add6 | 687 | * tipc_nametbl_withdraw - withdraw name publication from network name tables |
b97bf3fd | 688 | */ |
4323add6 | 689 | int tipc_nametbl_withdraw(u32 type, u32 lower, u32 ref, u32 key) |
b97bf3fd PL |
690 | { |
691 | struct publication *publ; | |
692 | ||
4323add6 PL |
693 | write_lock_bh(&tipc_nametbl_lock); |
694 | publ = tipc_nametbl_remove_publ(type, lower, tipc_own_addr, ref, key); | |
f131072c | 695 | if (likely(publ)) { |
b97bf3fd | 696 | table.local_publ_count--; |
1110b8d3 | 697 | tipc_named_withdraw(publ); |
4323add6 | 698 | write_unlock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
699 | list_del_init(&publ->pport_list); |
700 | kfree(publ); | |
701 | return 1; | |
702 | } | |
4323add6 | 703 | write_unlock_bh(&tipc_nametbl_lock); |
2cf8aa19 EH |
704 | pr_err("Unable to remove local publication\n" |
705 | "(type=%u, lower=%u, ref=%u, key=%u)\n", | |
706 | type, lower, ref, key); | |
b97bf3fd PL |
707 | return 0; |
708 | } | |
709 | ||
710 | /** | |
4323add6 | 711 | * tipc_nametbl_subscribe - add a subscription object to the name table |
b97bf3fd | 712 | */ |
fead3909 | 713 | void tipc_nametbl_subscribe(struct tipc_subscription *s) |
b97bf3fd PL |
714 | { |
715 | u32 type = s->seq.type; | |
716 | struct name_seq *seq; | |
717 | ||
c4307285 | 718 | write_lock_bh(&tipc_nametbl_lock); |
b97bf3fd | 719 | seq = nametbl_find_seq(type); |
a016892c | 720 | if (!seq) |
4323add6 | 721 | seq = tipc_nameseq_create(type, &table.types[hash(type)]); |
0e65967e | 722 | if (seq) { |
c4307285 | 723 | spin_lock_bh(&seq->lock); |
c4307285 YH |
724 | tipc_nameseq_subscribe(seq, s); |
725 | spin_unlock_bh(&seq->lock); | |
726 | } else { | |
2cf8aa19 EH |
727 | pr_warn("Failed to create subscription for {%u,%u,%u}\n", |
728 | s->seq.type, s->seq.lower, s->seq.upper); | |
c4307285 YH |
729 | } |
730 | write_unlock_bh(&tipc_nametbl_lock); | |
b97bf3fd PL |
731 | } |
732 | ||
733 | /** | |
4323add6 | 734 | * tipc_nametbl_unsubscribe - remove a subscription object from name table |
b97bf3fd | 735 | */ |
fead3909 | 736 | void tipc_nametbl_unsubscribe(struct tipc_subscription *s) |
b97bf3fd PL |
737 | { |
738 | struct name_seq *seq; | |
739 | ||
c4307285 YH |
740 | write_lock_bh(&tipc_nametbl_lock); |
741 | seq = nametbl_find_seq(s->seq.type); | |
0e65967e | 742 | if (seq != NULL) { |
c4307285 YH |
743 | spin_lock_bh(&seq->lock); |
744 | list_del_init(&s->nameseq_list); | |
745 | spin_unlock_bh(&seq->lock); | |
f7fb9d20 | 746 | nameseq_delete_empty(seq); |
c4307285 YH |
747 | } |
748 | write_unlock_bh(&tipc_nametbl_lock); | |
b97bf3fd PL |
749 | } |
750 | ||
751 | ||
752 | /** | |
2c53040f | 753 | * subseq_list - print specified sub-sequence contents into the given buffer |
b97bf3fd | 754 | */ |
dc1aed37 | 755 | static int subseq_list(struct sub_seq *sseq, char *buf, int len, u32 depth, |
b97bf3fd PL |
756 | u32 index) |
757 | { | |
758 | char portIdStr[27]; | |
c2de5814 | 759 | const char *scope_str[] = {"", " zone", " cluster", " node"}; |
f6f0a4d2 AS |
760 | struct publication *publ; |
761 | struct name_info *info; | |
dc1aed37 | 762 | int ret; |
b97bf3fd | 763 | |
dc1aed37 | 764 | ret = tipc_snprintf(buf, len, "%-10u %-10u ", sseq->lower, sseq->upper); |
b97bf3fd | 765 | |
f6f0a4d2 | 766 | if (depth == 2) { |
dc1aed37 EH |
767 | ret += tipc_snprintf(buf - ret, len + ret, "\n"); |
768 | return ret; | |
b97bf3fd PL |
769 | } |
770 | ||
f6f0a4d2 AS |
771 | info = sseq->info; |
772 | ||
773 | list_for_each_entry(publ, &info->zone_list, zone_list) { | |
0e65967e | 774 | sprintf(portIdStr, "<%u.%u.%u:%u>", |
b97bf3fd PL |
775 | tipc_zone(publ->node), tipc_cluster(publ->node), |
776 | tipc_node(publ->node), publ->ref); | |
dc1aed37 | 777 | ret += tipc_snprintf(buf + ret, len - ret, "%-26s ", portIdStr); |
b97bf3fd | 778 | if (depth > 3) { |
dc1aed37 EH |
779 | ret += tipc_snprintf(buf + ret, len - ret, "%-10u %s", |
780 | publ->key, scope_str[publ->scope]); | |
b97bf3fd | 781 | } |
f6f0a4d2 | 782 | if (!list_is_last(&publ->zone_list, &info->zone_list)) |
dc1aed37 EH |
783 | ret += tipc_snprintf(buf + ret, len - ret, |
784 | "\n%33s", " "); | |
adccff34 | 785 | } |
b97bf3fd | 786 | |
dc1aed37 EH |
787 | ret += tipc_snprintf(buf + ret, len - ret, "\n"); |
788 | return ret; | |
b97bf3fd PL |
789 | } |
790 | ||
791 | /** | |
2c53040f | 792 | * nameseq_list - print specified name sequence contents into the given buffer |
b97bf3fd | 793 | */ |
dc1aed37 | 794 | static int nameseq_list(struct name_seq *seq, char *buf, int len, u32 depth, |
b97bf3fd PL |
795 | u32 type, u32 lowbound, u32 upbound, u32 index) |
796 | { | |
797 | struct sub_seq *sseq; | |
798 | char typearea[11]; | |
dc1aed37 | 799 | int ret = 0; |
b97bf3fd | 800 | |
0f15d364 | 801 | if (seq->first_free == 0) |
dc1aed37 | 802 | return 0; |
0f15d364 | 803 | |
b97bf3fd PL |
804 | sprintf(typearea, "%-10u", seq->type); |
805 | ||
806 | if (depth == 1) { | |
dc1aed37 EH |
807 | ret += tipc_snprintf(buf, len, "%s\n", typearea); |
808 | return ret; | |
b97bf3fd PL |
809 | } |
810 | ||
811 | for (sseq = seq->sseqs; sseq != &seq->sseqs[seq->first_free]; sseq++) { | |
812 | if ((lowbound <= sseq->upper) && (upbound >= sseq->lower)) { | |
dc1aed37 EH |
813 | ret += tipc_snprintf(buf + ret, len - ret, "%s ", |
814 | typearea); | |
307fdf5e | 815 | spin_lock_bh(&seq->lock); |
dc1aed37 EH |
816 | ret += subseq_list(sseq, buf + ret, len - ret, |
817 | depth, index); | |
307fdf5e | 818 | spin_unlock_bh(&seq->lock); |
b97bf3fd PL |
819 | sprintf(typearea, "%10s", " "); |
820 | } | |
821 | } | |
dc1aed37 | 822 | return ret; |
b97bf3fd PL |
823 | } |
824 | ||
825 | /** | |
826 | * nametbl_header - print name table header into the given buffer | |
827 | */ | |
dc1aed37 | 828 | static int nametbl_header(char *buf, int len, u32 depth) |
b97bf3fd | 829 | { |
c2de5814 AS |
830 | const char *header[] = { |
831 | "Type ", | |
832 | "Lower Upper ", | |
833 | "Port Identity ", | |
834 | "Publication Scope" | |
835 | }; | |
836 | ||
837 | int i; | |
dc1aed37 | 838 | int ret = 0; |
c2de5814 AS |
839 | |
840 | if (depth > 4) | |
841 | depth = 4; | |
842 | for (i = 0; i < depth; i++) | |
dc1aed37 EH |
843 | ret += tipc_snprintf(buf + ret, len - ret, header[i]); |
844 | ret += tipc_snprintf(buf + ret, len - ret, "\n"); | |
845 | return ret; | |
b97bf3fd PL |
846 | } |
847 | ||
848 | /** | |
849 | * nametbl_list - print specified name table contents into the given buffer | |
850 | */ | |
dc1aed37 | 851 | static int nametbl_list(char *buf, int len, u32 depth_info, |
b97bf3fd PL |
852 | u32 type, u32 lowbound, u32 upbound) |
853 | { | |
854 | struct hlist_head *seq_head; | |
b97bf3fd PL |
855 | struct name_seq *seq; |
856 | int all_types; | |
dc1aed37 | 857 | int ret = 0; |
b97bf3fd PL |
858 | u32 depth; |
859 | u32 i; | |
860 | ||
861 | all_types = (depth_info & TIPC_NTQ_ALLTYPES); | |
862 | depth = (depth_info & ~TIPC_NTQ_ALLTYPES); | |
863 | ||
864 | if (depth == 0) | |
dc1aed37 | 865 | return 0; |
b97bf3fd PL |
866 | |
867 | if (all_types) { | |
868 | /* display all entries in name table to specified depth */ | |
dc1aed37 | 869 | ret += nametbl_header(buf, len, depth); |
b97bf3fd PL |
870 | lowbound = 0; |
871 | upbound = ~0; | |
f046e7d9 | 872 | for (i = 0; i < TIPC_NAMETBL_SIZE; i++) { |
b97bf3fd | 873 | seq_head = &table.types[i]; |
b67bfe0d | 874 | hlist_for_each_entry(seq, seq_head, ns_list) { |
dc1aed37 EH |
875 | ret += nameseq_list(seq, buf + ret, len - ret, |
876 | depth, seq->type, | |
877 | lowbound, upbound, i); | |
b97bf3fd PL |
878 | } |
879 | } | |
880 | } else { | |
881 | /* display only the sequence that matches the specified type */ | |
882 | if (upbound < lowbound) { | |
dc1aed37 EH |
883 | ret += tipc_snprintf(buf + ret, len - ret, |
884 | "invalid name sequence specified\n"); | |
885 | return ret; | |
b97bf3fd | 886 | } |
dc1aed37 | 887 | ret += nametbl_header(buf + ret, len - ret, depth); |
b97bf3fd PL |
888 | i = hash(type); |
889 | seq_head = &table.types[i]; | |
b67bfe0d | 890 | hlist_for_each_entry(seq, seq_head, ns_list) { |
b97bf3fd | 891 | if (seq->type == type) { |
dc1aed37 EH |
892 | ret += nameseq_list(seq, buf + ret, len - ret, |
893 | depth, type, | |
894 | lowbound, upbound, i); | |
b97bf3fd PL |
895 | break; |
896 | } | |
897 | } | |
898 | } | |
dc1aed37 | 899 | return ret; |
b97bf3fd PL |
900 | } |
901 | ||
4323add6 | 902 | struct sk_buff *tipc_nametbl_get(const void *req_tlv_area, int req_tlv_space) |
b97bf3fd PL |
903 | { |
904 | struct sk_buff *buf; | |
905 | struct tipc_name_table_query *argv; | |
906 | struct tlv_desc *rep_tlv; | |
dc1aed37 EH |
907 | char *pb; |
908 | int pb_len; | |
b97bf3fd PL |
909 | int str_len; |
910 | ||
911 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NAME_TBL_QUERY)) | |
4323add6 | 912 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd | 913 | |
dc1aed37 | 914 | buf = tipc_cfg_reply_alloc(TLV_SPACE(ULTRA_STRING_MAX_LEN)); |
b97bf3fd PL |
915 | if (!buf) |
916 | return NULL; | |
917 | ||
918 | rep_tlv = (struct tlv_desc *)buf->data; | |
dc1aed37 EH |
919 | pb = TLV_DATA(rep_tlv); |
920 | pb_len = ULTRA_STRING_MAX_LEN; | |
b97bf3fd | 921 | argv = (struct tipc_name_table_query *)TLV_DATA(req_tlv_area); |
4323add6 | 922 | read_lock_bh(&tipc_nametbl_lock); |
dc1aed37 EH |
923 | str_len = nametbl_list(pb, pb_len, ntohl(argv->depth), |
924 | ntohl(argv->type), | |
925 | ntohl(argv->lowbound), ntohl(argv->upbound)); | |
4323add6 | 926 | read_unlock_bh(&tipc_nametbl_lock); |
dc1aed37 | 927 | str_len += 1; /* for "\0" */ |
b97bf3fd PL |
928 | skb_put(buf, TLV_SPACE(str_len)); |
929 | TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len); | |
930 | ||
931 | return buf; | |
932 | } | |
933 | ||
4323add6 | 934 | int tipc_nametbl_init(void) |
b97bf3fd | 935 | { |
f046e7d9 | 936 | table.types = kcalloc(TIPC_NAMETBL_SIZE, sizeof(struct hlist_head), |
4e3e6dcb | 937 | GFP_ATOMIC); |
b97bf3fd PL |
938 | if (!table.types) |
939 | return -ENOMEM; | |
940 | ||
b97bf3fd | 941 | table.local_publ_count = 0; |
b97bf3fd PL |
942 | return 0; |
943 | } | |
944 | ||
4323add6 | 945 | void tipc_nametbl_stop(void) |
b97bf3fd | 946 | { |
b97bf3fd PL |
947 | u32 i; |
948 | ||
949 | if (!table.types) | |
950 | return; | |
951 | ||
f131072c | 952 | /* Verify name table is empty, then release it */ |
4323add6 | 953 | write_lock_bh(&tipc_nametbl_lock); |
f046e7d9 | 954 | for (i = 0; i < TIPC_NAMETBL_SIZE; i++) { |
f705ab95 PG |
955 | if (hlist_empty(&table.types[i])) |
956 | continue; | |
2cf8aa19 | 957 | pr_err("nametbl_stop(): orphaned hash chain detected\n"); |
f705ab95 | 958 | break; |
b97bf3fd PL |
959 | } |
960 | kfree(table.types); | |
961 | table.types = NULL; | |
4323add6 | 962 | write_unlock_bh(&tipc_nametbl_lock); |
b97bf3fd | 963 | } |