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