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