blob: 25c2975d86ee421fcf4790b80ed3489444aa8371 [file] [log] [blame]
Per Lidenb97bf3f2006-01-02 19:04:38 +01001/*
2 * net/tipc/name_table.c: TIPC name table code
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +09003 *
Per Liden593a5f22006-01-11 19:14:19 +01004 * Copyright (c) 2000-2006, Ericsson AB
Allan Stephensf6f0a4d2011-05-30 10:48:48 -04005 * Copyright (c) 2004-2008, 2010-2011, Wind River Systems
Per Lidenb97bf3f2006-01-02 19:04:38 +01006 * All rights reserved.
7 *
Per Liden9ea1fd32006-01-11 13:30:43 +01008 * Redistribution and use in source and binary forms, with or without
Per Lidenb97bf3f2006-01-02 19:04:38 +01009 * modification, are permitted provided that the following conditions are met:
10 *
Per Liden9ea1fd32006-01-11 13:30:43 +010011 * 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.
Per Lidenb97bf3f2006-01-02 19:04:38 +010019 *
Per Liden9ea1fd32006-01-11 13:30:43 +010020 * 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
Per Lidenb97bf3f2006-01-02 19:04:38 +010034 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
38#include "config.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010039#include "name_table.h"
40#include "name_distr.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010041#include "subscr.h"
42#include "port.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010043
Adrian Bunk988f0882006-03-20 22:37:52 -080044static int tipc_nametbl_size = 1024; /* must be a power of 2 */
Per Lidenb97bf3f2006-01-02 19:04:38 +010045
46/**
Allan Stephensb52124a2011-05-30 09:44:38 -040047 * struct name_info - name sequence publication info
Allan Stephens968edbe2008-07-14 22:45:33 -070048 * @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.)
Per Lidenb97bf3f2006-01-02 19:04:38 +010058 */
59
Allan Stephensb52124a2011-05-30 09:44:38 -040060struct name_info {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -040061 struct list_head node_list;
62 struct list_head cluster_list;
63 struct list_head zone_list;
Allan Stephens968edbe2008-07-14 22:45:33 -070064 u32 node_list_size;
65 u32 cluster_list_size;
66 u32 zone_list_size;
Per Lidenb97bf3f2006-01-02 19:04:38 +010067};
68
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090069/**
Allan Stephensb52124a2011-05-30 09:44:38 -040070 * 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
76struct sub_seq {
77 u32 lower;
78 u32 upper;
79 struct name_info *info;
80};
81
82/**
Per Lidenb97bf3f2006-01-02 19:04:38 +010083 * 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
Allan Stephensf1310722006-06-25 23:51:37 -070088 * @first_free: array index of first unused sub-sequence entry
Per Lidenb97bf3f2006-01-02 19:04:38 +010089 * @ns_list: links to adjacent name sequences in hash chain
90 * @subscriptions: list of subscriptions for this 'type'
Allan Stephens307fdf52008-06-04 17:38:22 -070091 * @lock: spinlock controlling access to publication lists of all sub-sequences
Per Lidenb97bf3f2006-01-02 19:04:38 +010092 */
93
94struct 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
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900106 * @types: pointer to fixed-sized array of name sequence lists,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100107 * accessed via hashing on 'type'; name sequence lists are *not* sorted
108 * @local_publ_count: number of publications issued by this node
109 */
110
111struct name_table {
112 struct hlist_head *types;
113 u32 local_publ_count;
114};
115
Allan Stephense3ec9c72010-12-31 18:59:34 +0000116static struct name_table table;
Ingo Molnar34af9462006-06-27 02:53:55 -0700117DEFINE_RWLOCK(tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100118
Sam Ravnborg05790c62006-03-20 22:37:04 -0800119static int hash(int x)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100120{
Eric Dumazeta02cec22010-09-22 20:43:57 +0000121 return x & (tipc_nametbl_size - 1);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100122}
123
124/**
125 * publ_create - create a publication structure
126 */
127
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900128static struct publication *publ_create(u32 type, u32 lower, u32 upper,
129 u32 scope, u32 node, u32 port_ref,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100130 u32 key)
131{
Panagiotis Issaris0da974f2006-07-21 14:51:30 -0700132 struct publication *publ = kzalloc(sizeof(*publ), GFP_ATOMIC);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100133 if (publ == NULL) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700134 warn("Publication creation failure, no memory\n");
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800135 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100136 }
137
Per Lidenb97bf3f2006-01-02 19:04:38 +0100138 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/**
Per Liden4323add2006-01-18 00:38:21 +0100152 * tipc_subseq_alloc - allocate a specified number of sub-sequence structures
Per Lidenb97bf3f2006-01-02 19:04:38 +0100153 */
154
Adrian Bunk988f0882006-03-20 22:37:52 -0800155static struct sub_seq *tipc_subseq_alloc(u32 cnt)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100156{
Panagiotis Issaris0da974f2006-07-21 14:51:30 -0700157 struct sub_seq *sseq = kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100158 return sseq;
159}
160
161/**
Per Liden4323add2006-01-18 00:38:21 +0100162 * tipc_nameseq_create - create a name sequence structure for the specified 'type'
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900163 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100164 * Allocates a single sub-sequence structure and sets it to all 0's.
165 */
166
Adrian Bunk988f0882006-03-20 22:37:52 -0800167static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100168{
Panagiotis Issaris0da974f2006-07-21 14:51:30 -0700169 struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC);
Per Liden4323add2006-01-18 00:38:21 +0100170 struct sub_seq *sseq = tipc_subseq_alloc(1);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100171
172 if (!nseq || !sseq) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700173 warn("Name sequence creation failed, no memory\n");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100174 kfree(nseq);
175 kfree(sseq);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800176 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100177 }
178
Ingo Molnar34af9462006-06-27 02:53:55 -0700179 spin_lock_init(&nseq->lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100180 nseq->type = type;
181 nseq->sseqs = sseq;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100182 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
189/**
190 * nameseq_find_subseq - find sub-sequence (if any) matching a name instance
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900191 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100192 * Very time-critical, so binary searches through sub-sequence array.
193 */
194
Sam Ravnborg05790c62006-03-20 22:37:04 -0800195static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq,
196 u32 instance)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100197{
198 struct sub_seq *sseqs = nseq->sseqs;
199 int low = 0;
200 int high = nseq->first_free - 1;
201 int mid;
202
203 while (low <= high) {
204 mid = (low + high) / 2;
205 if (instance < sseqs[mid].lower)
206 high = mid - 1;
207 else if (instance > sseqs[mid].upper)
208 low = mid + 1;
209 else
210 return &sseqs[mid];
211 }
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800212 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100213}
214
215/**
216 * nameseq_locate_subseq - determine position of name instance in sub-sequence
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900217 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100218 * Returns index in sub-sequence array of the entry that contains the specified
219 * instance value; if no entry contains that value, returns the position
220 * where a new entry for it would be inserted in the array.
221 *
222 * Note: Similar to binary search code for locating a sub-sequence.
223 */
224
225static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance)
226{
227 struct sub_seq *sseqs = nseq->sseqs;
228 int low = 0;
229 int high = nseq->first_free - 1;
230 int mid;
231
232 while (low <= high) {
233 mid = (low + high) / 2;
234 if (instance < sseqs[mid].lower)
235 high = mid - 1;
236 else if (instance > sseqs[mid].upper)
237 low = mid + 1;
238 else
239 return mid;
240 }
241 return low;
242}
243
244/**
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900245 * tipc_nameseq_insert_publ -
Per Lidenb97bf3f2006-01-02 19:04:38 +0100246 */
247
Adrian Bunk988f0882006-03-20 22:37:52 -0800248static 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)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100251{
Paul Gortmakerfead3902011-12-29 20:43:44 -0500252 struct tipc_subscription *s;
253 struct tipc_subscription *st;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100254 struct publication *publ;
255 struct sub_seq *sseq;
Allan Stephensb52124a2011-05-30 09:44:38 -0400256 struct name_info *info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100257 int created_subseq = 0;
258
Per Lidenb97bf3f2006-01-02 19:04:38 +0100259 sseq = nameseq_find_subseq(nseq, lower);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100260 if (sseq) {
261
262 /* Lower end overlaps existing entry => need an exact match */
263
264 if ((sseq->lower != lower) || (sseq->upper != upper)) {
Allan Stephensf1310722006-06-25 23:51:37 -0700265 warn("Cannot publish {%u,%u,%u}, overlap error\n",
266 type, lower, upper);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800267 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100268 }
Allan Stephensb52124a2011-05-30 09:44:38 -0400269
270 info = sseq->info;
Allan Stephensf80c24d2011-11-03 11:12:01 -0400271
272 /* Check if an identical publication already exists */
273 list_for_each_entry(publ, &info->zone_list, zone_list) {
274 if ((publ->ref == port) && (publ->key == key) &&
275 (!publ->node || (publ->node == node)))
276 return NULL;
277 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100278 } else {
279 u32 inspos;
280 struct sub_seq *freesseq;
281
282 /* Find where lower end should be inserted */
283
284 inspos = nameseq_locate_subseq(nseq, lower);
285
286 /* Fail if upper end overlaps into an existing entry */
287
288 if ((inspos < nseq->first_free) &&
289 (upper >= nseq->sseqs[inspos].lower)) {
Allan Stephensf1310722006-06-25 23:51:37 -0700290 warn("Cannot publish {%u,%u,%u}, overlap error\n",
291 type, lower, upper);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800292 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100293 }
294
295 /* Ensure there is space for new sub-sequence */
296
297 if (nseq->first_free == nseq->alloc) {
Allan Stephens9ab230f2006-06-25 23:37:24 -0700298 struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2);
299
300 if (!sseqs) {
Allan Stephensf1310722006-06-25 23:51:37 -0700301 warn("Cannot publish {%u,%u,%u}, no memory\n",
302 type, lower, upper);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800303 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100304 }
Allan Stephens9ab230f2006-06-25 23:37:24 -0700305 memcpy(sseqs, nseq->sseqs,
306 nseq->alloc * sizeof(struct sub_seq));
307 kfree(nseq->sseqs);
308 nseq->sseqs = sseqs;
309 nseq->alloc *= 2;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100310 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100311
Allan Stephensb52124a2011-05-30 09:44:38 -0400312 info = kzalloc(sizeof(*info), GFP_ATOMIC);
313 if (!info) {
314 warn("Cannot publish {%u,%u,%u}, no memory\n",
315 type, lower, upper);
316 return NULL;
317 }
318
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400319 INIT_LIST_HEAD(&info->node_list);
320 INIT_LIST_HEAD(&info->cluster_list);
321 INIT_LIST_HEAD(&info->zone_list);
322
Per Lidenb97bf3f2006-01-02 19:04:38 +0100323 /* Insert new sub-sequence */
324
Per Lidenb97bf3f2006-01-02 19:04:38 +0100325 sseq = &nseq->sseqs[inspos];
326 freesseq = &nseq->sseqs[nseq->first_free];
Allan Stephens0e659672010-12-31 18:59:32 +0000327 memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq));
328 memset(sseq, 0, sizeof(*sseq));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100329 nseq->first_free++;
330 sseq->lower = lower;
331 sseq->upper = upper;
Allan Stephensb52124a2011-05-30 09:44:38 -0400332 sseq->info = info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100333 created_subseq = 1;
334 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100335
336 /* Insert a publication: */
337
338 publ = publ_create(type, lower, upper, scope, node, port, key);
339 if (!publ)
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800340 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100341
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400342 list_add(&publ->zone_list, &info->zone_list);
Allan Stephensb52124a2011-05-30 09:44:38 -0400343 info->zone_list_size++;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100344
Allan Stephensd4f5c122012-04-17 18:16:34 -0400345 if (in_own_cluster(node)) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400346 list_add(&publ->cluster_list, &info->cluster_list);
Allan Stephensb52124a2011-05-30 09:44:38 -0400347 info->cluster_list_size++;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100348 }
349
Allan Stephensd4f5c122012-04-17 18:16:34 -0400350 if (in_own_node(node)) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400351 list_add(&publ->node_list, &info->node_list);
Allan Stephensb52124a2011-05-30 09:44:38 -0400352 info->node_list_size++;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100353 }
354
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900355 /*
356 * Any subscriptions waiting for notification?
Per Lidenb97bf3f2006-01-02 19:04:38 +0100357 */
358 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
Per Liden4323add2006-01-18 00:38:21 +0100359 tipc_subscr_report_overlap(s,
360 publ->lower,
361 publ->upper,
362 TIPC_PUBLISHED,
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900363 publ->ref,
Per Liden4323add2006-01-18 00:38:21 +0100364 publ->node,
365 created_subseq);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100366 }
367 return publ;
368}
369
370/**
Per Liden4323add2006-01-18 00:38:21 +0100371 * tipc_nameseq_remove_publ -
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900372 *
Allan Stephensf1310722006-06-25 23:51:37 -0700373 * NOTE: There may be cases where TIPC is asked to remove a publication
374 * that is not in the name table. For example, if another node issues a
375 * publication for a name sequence that overlaps an existing name sequence
376 * the publication will not be recorded, which means the publication won't
377 * be found when the name sequence is later withdrawn by that node.
378 * A failed withdraw request simply returns a failure indication and lets the
379 * caller issue any error or warning messages associated with such a problem.
Per Lidenb97bf3f2006-01-02 19:04:38 +0100380 */
381
Adrian Bunk988f0882006-03-20 22:37:52 -0800382static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 inst,
383 u32 node, u32 ref, u32 key)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100384{
385 struct publication *publ;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100386 struct sub_seq *sseq = nameseq_find_subseq(nseq, inst);
Allan Stephensb52124a2011-05-30 09:44:38 -0400387 struct name_info *info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100388 struct sub_seq *free;
Paul Gortmakerfead3902011-12-29 20:43:44 -0500389 struct tipc_subscription *s, *st;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100390 int removed_subseq = 0;
391
Allan Stephensf1310722006-06-25 23:51:37 -0700392 if (!sseq)
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800393 return NULL;
Allan Stephensf1310722006-06-25 23:51:37 -0700394
Allan Stephensb52124a2011-05-30 09:44:38 -0400395 info = sseq->info;
396
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400397 /* Locate publication, if it exists */
398
399 list_for_each_entry(publ, &info->zone_list, zone_list) {
400 if ((publ->key == key) && (publ->ref == ref) &&
401 (!publ->node || (publ->node == node)))
402 goto found;
403 }
404 return NULL;
405
406found:
Allan Stephensf1310722006-06-25 23:51:37 -0700407 /* Remove publication from zone scope list */
408
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400409 list_del(&publ->zone_list);
Allan Stephensb52124a2011-05-30 09:44:38 -0400410 info->zone_list_size--;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100411
Allan Stephensf1310722006-06-25 23:51:37 -0700412 /* Remove publication from cluster scope list, if present */
413
Allan Stephensd4f5c122012-04-17 18:16:34 -0400414 if (in_own_cluster(node)) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400415 list_del(&publ->cluster_list);
Allan Stephensb52124a2011-05-30 09:44:38 -0400416 info->cluster_list_size--;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100417 }
Allan Stephensf1310722006-06-25 23:51:37 -0700418
419 /* Remove publication from node scope list, if present */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100420
Allan Stephensd4f5c122012-04-17 18:16:34 -0400421 if (in_own_node(node)) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400422 list_del(&publ->node_list);
Allan Stephensb52124a2011-05-30 09:44:38 -0400423 info->node_list_size--;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100424 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100425
Allan Stephensf1310722006-06-25 23:51:37 -0700426 /* Contract subseq list if no more publications for that subseq */
427
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400428 if (list_empty(&info->zone_list)) {
Allan Stephensb52124a2011-05-30 09:44:38 -0400429 kfree(info);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100430 free = &nseq->sseqs[nseq->first_free--];
Allan Stephens0e659672010-12-31 18:59:32 +0000431 memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100432 removed_subseq = 1;
433 }
434
Allan Stephensf1310722006-06-25 23:51:37 -0700435 /* Notify any waiting subscriptions */
436
Per Lidenb97bf3f2006-01-02 19:04:38 +0100437 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
Per Liden4323add2006-01-18 00:38:21 +0100438 tipc_subscr_report_overlap(s,
439 publ->lower,
440 publ->upper,
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900441 TIPC_WITHDRAWN,
442 publ->ref,
Per Liden4323add2006-01-18 00:38:21 +0100443 publ->node,
444 removed_subseq);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100445 }
Allan Stephensf1310722006-06-25 23:51:37 -0700446
Per Lidenb97bf3f2006-01-02 19:04:38 +0100447 return publ;
448}
449
450/**
Per Liden4323add2006-01-18 00:38:21 +0100451 * tipc_nameseq_subscribe: attach a subscription, and issue
Per Lidenb97bf3f2006-01-02 19:04:38 +0100452 * the prescribed number of events if there is any sub-
453 * sequence overlapping with the requested sequence
454 */
455
Paul Gortmakerfead3902011-12-29 20:43:44 -0500456static void tipc_nameseq_subscribe(struct name_seq *nseq,
457 struct tipc_subscription *s)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100458{
459 struct sub_seq *sseq = nseq->sseqs;
460
461 list_add(&s->nameseq_list, &nseq->subscriptions);
462
463 if (!sseq)
464 return;
465
466 while (sseq != &nseq->sseqs[nseq->first_free]) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400467 if (tipc_subscr_overlap(s, sseq->lower, sseq->upper)) {
468 struct publication *crs;
469 struct name_info *info = sseq->info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100470 int must_report = 1;
471
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400472 list_for_each_entry(crs, &info->zone_list, zone_list) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900473 tipc_subscr_report_overlap(s,
474 sseq->lower,
Per Liden4323add2006-01-18 00:38:21 +0100475 sseq->upper,
476 TIPC_PUBLISHED,
477 crs->ref,
478 crs->node,
479 must_report);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100480 must_report = 0;
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400481 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100482 }
483 sseq++;
484 }
485}
486
487static struct name_seq *nametbl_find_seq(u32 type)
488{
489 struct hlist_head *seq_head;
490 struct hlist_node *seq_node;
491 struct name_seq *ns;
492
Per Lidenb97bf3f2006-01-02 19:04:38 +0100493 seq_head = &table.types[hash(type)];
494 hlist_for_each_entry(ns, seq_node, seq_head, ns_list) {
Allan Stephensb29f1422010-12-31 18:59:25 +0000495 if (ns->type == type)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100496 return ns;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100497 }
498
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800499 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100500};
501
Per Liden4323add2006-01-18 00:38:21 +0100502struct publication *tipc_nametbl_insert_publ(u32 type, u32 lower, u32 upper,
503 u32 scope, u32 node, u32 port, u32 key)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100504{
505 struct name_seq *seq = nametbl_find_seq(type);
506
Per Lidenb97bf3f2006-01-02 19:04:38 +0100507 if (lower > upper) {
Allan Stephensf1310722006-06-25 23:51:37 -0700508 warn("Failed to publish illegal {%u,%u,%u}\n",
Per Lidenb97bf3f2006-01-02 19:04:38 +0100509 type, lower, upper);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800510 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100511 }
512
Allan Stephensb29f1422010-12-31 18:59:25 +0000513 if (!seq)
Per Liden4323add2006-01-18 00:38:21 +0100514 seq = tipc_nameseq_create(type, &table.types[hash(type)]);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100515 if (!seq)
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800516 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100517
Per Liden4323add2006-01-18 00:38:21 +0100518 return tipc_nameseq_insert_publ(seq, type, lower, upper,
519 scope, node, port, key);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100520}
521
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900522struct publication *tipc_nametbl_remove_publ(u32 type, u32 lower,
Per Liden4323add2006-01-18 00:38:21 +0100523 u32 node, u32 ref, u32 key)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100524{
525 struct publication *publ;
526 struct name_seq *seq = nametbl_find_seq(type);
527
528 if (!seq)
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800529 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100530
Per Liden4323add2006-01-18 00:38:21 +0100531 publ = tipc_nameseq_remove_publ(seq, lower, node, ref, key);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100532
533 if (!seq->first_free && list_empty(&seq->subscriptions)) {
534 hlist_del_init(&seq->ns_list);
535 kfree(seq->sseqs);
536 kfree(seq);
537 }
538 return publ;
539}
540
541/*
Allan Stephensbc9f8142011-11-07 17:00:54 -0500542 * tipc_nametbl_translate - perform name translation
Per Lidenb97bf3f2006-01-02 19:04:38 +0100543 *
Allan Stephensbc9f8142011-11-07 17:00:54 -0500544 * On entry, 'destnode' is the search domain used during translation.
545 *
546 * On exit:
547 * - if name translation is deferred to another node/cluster/zone,
548 * leaves 'destnode' unchanged (will be non-zero) and returns 0
549 * - if name translation is attempted and succeeds, sets 'destnode'
550 * to publishing node and returns port reference (will be non-zero)
551 * - if name translation is attempted and fails, sets 'destnode' to 0
552 * and returns 0
Per Lidenb97bf3f2006-01-02 19:04:38 +0100553 */
554
Per Liden4323add2006-01-18 00:38:21 +0100555u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100556{
557 struct sub_seq *sseq;
Allan Stephensb52124a2011-05-30 09:44:38 -0400558 struct name_info *info;
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400559 struct publication *publ;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100560 struct name_seq *seq;
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400561 u32 ref = 0;
Allan Stephensbc9f8142011-11-07 17:00:54 -0500562 u32 node = 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100563
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000564 if (!tipc_in_scope(*destnode, tipc_own_addr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100565 return 0;
566
Per Liden4323add2006-01-18 00:38:21 +0100567 read_lock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100568 seq = nametbl_find_seq(type);
569 if (unlikely(!seq))
570 goto not_found;
571 sseq = nameseq_find_subseq(seq, instance);
572 if (unlikely(!sseq))
573 goto not_found;
574 spin_lock_bh(&seq->lock);
Allan Stephensb52124a2011-05-30 09:44:38 -0400575 info = sseq->info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100576
577 /* Closest-First Algorithm: */
578 if (likely(!*destnode)) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400579 if (!list_empty(&info->node_list)) {
580 publ = list_first_entry(&info->node_list,
581 struct publication,
582 node_list);
583 list_move_tail(&publ->node_list,
584 &info->node_list);
585 } else if (!list_empty(&info->cluster_list)) {
586 publ = list_first_entry(&info->cluster_list,
587 struct publication,
588 cluster_list);
589 list_move_tail(&publ->cluster_list,
590 &info->cluster_list);
Allan Stephens8af46382011-05-30 11:27:50 -0400591 } else {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400592 publ = list_first_entry(&info->zone_list,
593 struct publication,
594 zone_list);
595 list_move_tail(&publ->zone_list,
596 &info->zone_list);
Allan Stephens8af46382011-05-30 11:27:50 -0400597 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100598 }
599
600 /* Round-Robin Algorithm: */
601 else if (*destnode == tipc_own_addr) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400602 if (list_empty(&info->node_list))
603 goto no_match;
604 publ = list_first_entry(&info->node_list, struct publication,
605 node_list);
606 list_move_tail(&publ->node_list, &info->node_list);
Allan Stephens336ebf52012-04-17 18:02:01 -0400607 } else if (in_own_cluster_exact(*destnode)) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400608 if (list_empty(&info->cluster_list))
609 goto no_match;
610 publ = list_first_entry(&info->cluster_list, struct publication,
611 cluster_list);
612 list_move_tail(&publ->cluster_list, &info->cluster_list);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100613 } else {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400614 publ = list_first_entry(&info->zone_list, struct publication,
615 zone_list);
616 list_move_tail(&publ->zone_list, &info->zone_list);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100617 }
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400618
619 ref = publ->ref;
Allan Stephensbc9f8142011-11-07 17:00:54 -0500620 node = publ->node;
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400621no_match:
Per Lidenb97bf3f2006-01-02 19:04:38 +0100622 spin_unlock_bh(&seq->lock);
623not_found:
Per Liden4323add2006-01-18 00:38:21 +0100624 read_unlock_bh(&tipc_nametbl_lock);
Allan Stephensbc9f8142011-11-07 17:00:54 -0500625 *destnode = node;
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400626 return ref;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100627}
628
629/**
Per Liden4323add2006-01-18 00:38:21 +0100630 * tipc_nametbl_mc_translate - find multicast destinations
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900631 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100632 * Creates list of all local ports that overlap the given multicast address;
633 * also determines if any off-node ports overlap.
634 *
635 * Note: Publications with a scope narrower than 'limit' are ignored.
636 * (i.e. local node-scope publications mustn't receive messages arriving
637 * from another node, even if the multcast link brought it here)
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900638 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100639 * Returns non-zero if any off-node ports overlap
640 */
641
Per Liden4323add2006-01-18 00:38:21 +0100642int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit,
Paul Gortmaker45843102011-12-29 20:33:30 -0500643 struct tipc_port_list *dports)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100644{
645 struct name_seq *seq;
646 struct sub_seq *sseq;
647 struct sub_seq *sseq_stop;
Allan Stephensb52124a2011-05-30 09:44:38 -0400648 struct name_info *info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100649 int res = 0;
650
Per Liden4323add2006-01-18 00:38:21 +0100651 read_lock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100652 seq = nametbl_find_seq(type);
653 if (!seq)
654 goto exit;
655
656 spin_lock_bh(&seq->lock);
657
658 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower);
659 sseq_stop = seq->sseqs + seq->first_free;
660 for (; sseq != sseq_stop; sseq++) {
661 struct publication *publ;
662
663 if (sseq->lower > upper)
664 break;
Allan Stephens968edbe2008-07-14 22:45:33 -0700665
Allan Stephensb52124a2011-05-30 09:44:38 -0400666 info = sseq->info;
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400667 list_for_each_entry(publ, &info->node_list, node_list) {
668 if (publ->scope <= limit)
669 tipc_port_list_add(dports, publ->ref);
Allan Stephens968edbe2008-07-14 22:45:33 -0700670 }
671
Allan Stephensb52124a2011-05-30 09:44:38 -0400672 if (info->cluster_list_size != info->node_list_size)
Allan Stephens968edbe2008-07-14 22:45:33 -0700673 res = 1;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100674 }
675
676 spin_unlock_bh(&seq->lock);
677exit:
Per Liden4323add2006-01-18 00:38:21 +0100678 read_unlock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100679 return res;
680}
681
Allan Stephensc422f1b2011-11-02 15:49:40 -0400682/*
Per Liden4323add2006-01-18 00:38:21 +0100683 * tipc_nametbl_publish - add name publication to network name tables
Per Lidenb97bf3f2006-01-02 19:04:38 +0100684 */
685
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900686struct publication *tipc_nametbl_publish(u32 type, u32 lower, u32 upper,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100687 u32 scope, u32 port_ref, u32 key)
688{
689 struct publication *publ;
690
691 if (table.local_publ_count >= tipc_max_publications) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900692 warn("Publication failed, local publication limit reached (%u)\n",
Per Lidenb97bf3f2006-01-02 19:04:38 +0100693 tipc_max_publications);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800694 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100695 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100696
Per Liden4323add2006-01-18 00:38:21 +0100697 write_lock_bh(&tipc_nametbl_lock);
Per Liden4323add2006-01-18 00:38:21 +0100698 publ = tipc_nametbl_insert_publ(type, lower, upper, scope,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100699 tipc_own_addr, port_ref, key);
Allan Stephensfd6eced2011-11-09 14:22:52 -0500700 if (likely(publ)) {
701 table.local_publ_count++;
Per Liden4323add2006-01-18 00:38:21 +0100702 tipc_named_publish(publ);
Allan Stephensfd6eced2011-11-09 14:22:52 -0500703 }
Per Liden4323add2006-01-18 00:38:21 +0100704 write_unlock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100705 return publ;
706}
707
708/**
Per Liden4323add2006-01-18 00:38:21 +0100709 * tipc_nametbl_withdraw - withdraw name publication from network name tables
Per Lidenb97bf3f2006-01-02 19:04:38 +0100710 */
711
Per Liden4323add2006-01-18 00:38:21 +0100712int tipc_nametbl_withdraw(u32 type, u32 lower, u32 ref, u32 key)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100713{
714 struct publication *publ;
715
Per Liden4323add2006-01-18 00:38:21 +0100716 write_lock_bh(&tipc_nametbl_lock);
717 publ = tipc_nametbl_remove_publ(type, lower, tipc_own_addr, ref, key);
Allan Stephensf1310722006-06-25 23:51:37 -0700718 if (likely(publ)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100719 table.local_publ_count--;
Allan Stephens1110b8d2012-04-17 17:57:52 -0400720 tipc_named_withdraw(publ);
Per Liden4323add2006-01-18 00:38:21 +0100721 write_unlock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100722 list_del_init(&publ->pport_list);
723 kfree(publ);
724 return 1;
725 }
Per Liden4323add2006-01-18 00:38:21 +0100726 write_unlock_bh(&tipc_nametbl_lock);
Allan Stephensf1310722006-06-25 23:51:37 -0700727 err("Unable to remove local publication\n"
728 "(type=%u, lower=%u, ref=%u, key=%u)\n",
729 type, lower, ref, key);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100730 return 0;
731}
732
733/**
Per Liden4323add2006-01-18 00:38:21 +0100734 * tipc_nametbl_subscribe - add a subscription object to the name table
Per Lidenb97bf3f2006-01-02 19:04:38 +0100735 */
736
Paul Gortmakerfead3902011-12-29 20:43:44 -0500737void tipc_nametbl_subscribe(struct tipc_subscription *s)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100738{
739 u32 type = s->seq.type;
740 struct name_seq *seq;
741
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900742 write_lock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100743 seq = nametbl_find_seq(type);
Allan Stephensa0168922010-12-31 18:59:35 +0000744 if (!seq)
Per Liden4323add2006-01-18 00:38:21 +0100745 seq = tipc_nameseq_create(type, &table.types[hash(type)]);
Allan Stephens0e659672010-12-31 18:59:32 +0000746 if (seq) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900747 spin_lock_bh(&seq->lock);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900748 tipc_nameseq_subscribe(seq, s);
749 spin_unlock_bh(&seq->lock);
750 } else {
Allan Stephensf1310722006-06-25 23:51:37 -0700751 warn("Failed to create subscription for {%u,%u,%u}\n",
752 s->seq.type, s->seq.lower, s->seq.upper);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900753 }
754 write_unlock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100755}
756
757/**
Per Liden4323add2006-01-18 00:38:21 +0100758 * tipc_nametbl_unsubscribe - remove a subscription object from name table
Per Lidenb97bf3f2006-01-02 19:04:38 +0100759 */
760
Paul Gortmakerfead3902011-12-29 20:43:44 -0500761void tipc_nametbl_unsubscribe(struct tipc_subscription *s)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100762{
763 struct name_seq *seq;
764
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900765 write_lock_bh(&tipc_nametbl_lock);
766 seq = nametbl_find_seq(s->seq.type);
Allan Stephens0e659672010-12-31 18:59:32 +0000767 if (seq != NULL) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900768 spin_lock_bh(&seq->lock);
769 list_del_init(&s->nameseq_list);
770 spin_unlock_bh(&seq->lock);
771 if ((seq->first_free == 0) && list_empty(&seq->subscriptions)) {
772 hlist_del_init(&seq->ns_list);
773 kfree(seq->sseqs);
774 kfree(seq);
775 }
776 }
777 write_unlock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100778}
779
780
781/**
782 * subseq_list: print specified sub-sequence contents into the given buffer
783 */
784
785static void subseq_list(struct sub_seq *sseq, struct print_buf *buf, u32 depth,
786 u32 index)
787{
788 char portIdStr[27];
Allan Stephensc2de5812010-08-17 11:00:14 +0000789 const char *scope_str[] = {"", " zone", " cluster", " node"};
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400790 struct publication *publ;
791 struct name_info *info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100792
793 tipc_printf(buf, "%-10u %-10u ", sseq->lower, sseq->upper);
794
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400795 if (depth == 2) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100796 tipc_printf(buf, "\n");
797 return;
798 }
799
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400800 info = sseq->info;
801
802 list_for_each_entry(publ, &info->zone_list, zone_list) {
Allan Stephens0e659672010-12-31 18:59:32 +0000803 sprintf(portIdStr, "<%u.%u.%u:%u>",
Per Lidenb97bf3f2006-01-02 19:04:38 +0100804 tipc_zone(publ->node), tipc_cluster(publ->node),
805 tipc_node(publ->node), publ->ref);
806 tipc_printf(buf, "%-26s ", portIdStr);
807 if (depth > 3) {
Allan Stephensc2de5812010-08-17 11:00:14 +0000808 tipc_printf(buf, "%-10u %s", publ->key,
809 scope_str[publ->scope]);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100810 }
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400811 if (!list_is_last(&publ->zone_list, &info->zone_list))
812 tipc_printf(buf, "\n%33s", " ");
813 };
Per Lidenb97bf3f2006-01-02 19:04:38 +0100814
815 tipc_printf(buf, "\n");
816}
817
818/**
819 * nameseq_list: print specified name sequence contents into the given buffer
820 */
821
822static void nameseq_list(struct name_seq *seq, struct print_buf *buf, u32 depth,
823 u32 type, u32 lowbound, u32 upbound, u32 index)
824{
825 struct sub_seq *sseq;
826 char typearea[11];
827
Allan Stephens0f15d362008-06-04 17:37:59 -0700828 if (seq->first_free == 0)
829 return;
830
Per Lidenb97bf3f2006-01-02 19:04:38 +0100831 sprintf(typearea, "%-10u", seq->type);
832
833 if (depth == 1) {
834 tipc_printf(buf, "%s\n", typearea);
835 return;
836 }
837
838 for (sseq = seq->sseqs; sseq != &seq->sseqs[seq->first_free]; sseq++) {
839 if ((lowbound <= sseq->upper) && (upbound >= sseq->lower)) {
840 tipc_printf(buf, "%s ", typearea);
Allan Stephens307fdf52008-06-04 17:38:22 -0700841 spin_lock_bh(&seq->lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100842 subseq_list(sseq, buf, depth, index);
Allan Stephens307fdf52008-06-04 17:38:22 -0700843 spin_unlock_bh(&seq->lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100844 sprintf(typearea, "%10s", " ");
845 }
846 }
847}
848
849/**
850 * nametbl_header - print name table header into the given buffer
851 */
852
853static void nametbl_header(struct print_buf *buf, u32 depth)
854{
Allan Stephensc2de5812010-08-17 11:00:14 +0000855 const char *header[] = {
856 "Type ",
857 "Lower Upper ",
858 "Port Identity ",
859 "Publication Scope"
860 };
Per Lidenb97bf3f2006-01-02 19:04:38 +0100861
Allan Stephensc2de5812010-08-17 11:00:14 +0000862 int i;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100863
Allan Stephensc2de5812010-08-17 11:00:14 +0000864 if (depth > 4)
865 depth = 4;
866 for (i = 0; i < depth; i++)
867 tipc_printf(buf, header[i]);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100868 tipc_printf(buf, "\n");
869}
870
871/**
872 * nametbl_list - print specified name table contents into the given buffer
873 */
874
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900875static void nametbl_list(struct print_buf *buf, u32 depth_info,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100876 u32 type, u32 lowbound, u32 upbound)
877{
878 struct hlist_head *seq_head;
879 struct hlist_node *seq_node;
880 struct name_seq *seq;
881 int all_types;
882 u32 depth;
883 u32 i;
884
885 all_types = (depth_info & TIPC_NTQ_ALLTYPES);
886 depth = (depth_info & ~TIPC_NTQ_ALLTYPES);
887
888 if (depth == 0)
889 return;
890
891 if (all_types) {
892 /* display all entries in name table to specified depth */
893 nametbl_header(buf, depth);
894 lowbound = 0;
895 upbound = ~0;
896 for (i = 0; i < tipc_nametbl_size; i++) {
897 seq_head = &table.types[i];
898 hlist_for_each_entry(seq, seq_node, seq_head, ns_list) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900899 nameseq_list(seq, buf, depth, seq->type,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100900 lowbound, upbound, i);
901 }
902 }
903 } else {
904 /* display only the sequence that matches the specified type */
905 if (upbound < lowbound) {
906 tipc_printf(buf, "invalid name sequence specified\n");
907 return;
908 }
909 nametbl_header(buf, depth);
910 i = hash(type);
911 seq_head = &table.types[i];
912 hlist_for_each_entry(seq, seq_node, seq_head, ns_list) {
913 if (seq->type == type) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900914 nameseq_list(seq, buf, depth, type,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100915 lowbound, upbound, i);
916 break;
917 }
918 }
919 }
920}
921
Per Lidenb97bf3f2006-01-02 19:04:38 +0100922#define MAX_NAME_TBL_QUERY 32768
923
Per Liden4323add2006-01-18 00:38:21 +0100924struct sk_buff *tipc_nametbl_get(const void *req_tlv_area, int req_tlv_space)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100925{
926 struct sk_buff *buf;
927 struct tipc_name_table_query *argv;
928 struct tlv_desc *rep_tlv;
929 struct print_buf b;
930 int str_len;
931
932 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NAME_TBL_QUERY))
Per Liden4323add2006-01-18 00:38:21 +0100933 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100934
Per Liden4323add2006-01-18 00:38:21 +0100935 buf = tipc_cfg_reply_alloc(TLV_SPACE(MAX_NAME_TBL_QUERY));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100936 if (!buf)
937 return NULL;
938
939 rep_tlv = (struct tlv_desc *)buf->data;
Per Liden4323add2006-01-18 00:38:21 +0100940 tipc_printbuf_init(&b, TLV_DATA(rep_tlv), MAX_NAME_TBL_QUERY);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100941 argv = (struct tipc_name_table_query *)TLV_DATA(req_tlv_area);
Per Liden4323add2006-01-18 00:38:21 +0100942 read_lock_bh(&tipc_nametbl_lock);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900943 nametbl_list(&b, ntohl(argv->depth), ntohl(argv->type),
Per Lidenb97bf3f2006-01-02 19:04:38 +0100944 ntohl(argv->lowbound), ntohl(argv->upbound));
Per Liden4323add2006-01-18 00:38:21 +0100945 read_unlock_bh(&tipc_nametbl_lock);
946 str_len = tipc_printbuf_validate(&b);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100947
948 skb_put(buf, TLV_SPACE(str_len));
949 TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len);
950
951 return buf;
952}
953
Per Liden4323add2006-01-18 00:38:21 +0100954int tipc_nametbl_init(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100955{
Allan Stephens4e3e6dc2008-05-12 15:41:53 -0700956 table.types = kcalloc(tipc_nametbl_size, sizeof(struct hlist_head),
957 GFP_ATOMIC);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100958 if (!table.types)
959 return -ENOMEM;
960
Per Lidenb97bf3f2006-01-02 19:04:38 +0100961 table.local_publ_count = 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100962 return 0;
963}
964
Per Liden4323add2006-01-18 00:38:21 +0100965void tipc_nametbl_stop(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100966{
Per Lidenb97bf3f2006-01-02 19:04:38 +0100967 u32 i;
968
969 if (!table.types)
970 return;
971
Allan Stephensf1310722006-06-25 23:51:37 -0700972 /* Verify name table is empty, then release it */
973
Per Liden4323add2006-01-18 00:38:21 +0100974 write_lock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100975 for (i = 0; i < tipc_nametbl_size; i++) {
Allan Stephensf1310722006-06-25 23:51:37 -0700976 if (!hlist_empty(&table.types[i]))
977 err("tipc_nametbl_stop(): hash chain %u is non-null\n", i);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100978 }
979 kfree(table.types);
980 table.types = NULL;
Per Liden4323add2006-01-18 00:38:21 +0100981 write_unlock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100982}
Allan Stephensf1310722006-06-25 23:51:37 -0700983