blob: 360c478b0b533511b344cf143c4c42197c9ccd76 [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 */
Allan Stephensb52124a2011-05-30 09:44:38 -040059struct name_info {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -040060 struct list_head node_list;
61 struct list_head cluster_list;
62 struct list_head zone_list;
Allan Stephens968edbe2008-07-14 22:45:33 -070063 u32 node_list_size;
64 u32 cluster_list_size;
65 u32 zone_list_size;
Per Lidenb97bf3f2006-01-02 19:04:38 +010066};
67
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090068/**
Allan Stephensb52124a2011-05-30 09:44:38 -040069 * struct sub_seq - container for all published instances of a name sequence
70 * @lower: name sequence lower bound
71 * @upper: name sequence upper bound
72 * @info: pointer to name sequence publication info
73 */
Allan Stephensb52124a2011-05-30 09:44:38 -040074struct sub_seq {
75 u32 lower;
76 u32 upper;
77 struct name_info *info;
78};
79
80/**
Per Lidenb97bf3f2006-01-02 19:04:38 +010081 * struct name_seq - container for all published instances of a name type
82 * @type: 32 bit 'type' value for name sequence
83 * @sseq: pointer to dynamically-sized array of sub-sequences of this 'type';
84 * sub-sequences are sorted in ascending order
85 * @alloc: number of sub-sequences currently in array
Allan Stephensf1310722006-06-25 23:51:37 -070086 * @first_free: array index of first unused sub-sequence entry
Per Lidenb97bf3f2006-01-02 19:04:38 +010087 * @ns_list: links to adjacent name sequences in hash chain
88 * @subscriptions: list of subscriptions for this 'type'
Allan Stephens307fdf52008-06-04 17:38:22 -070089 * @lock: spinlock controlling access to publication lists of all sub-sequences
Per Lidenb97bf3f2006-01-02 19:04:38 +010090 */
Per Lidenb97bf3f2006-01-02 19:04:38 +010091struct name_seq {
92 u32 type;
93 struct sub_seq *sseqs;
94 u32 alloc;
95 u32 first_free;
96 struct hlist_node ns_list;
97 struct list_head subscriptions;
98 spinlock_t lock;
99};
100
101/**
102 * struct name_table - table containing all existing port name publications
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900103 * @types: pointer to fixed-sized array of name sequence lists,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100104 * accessed via hashing on 'type'; name sequence lists are *not* sorted
105 * @local_publ_count: number of publications issued by this node
106 */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100107struct name_table {
108 struct hlist_head *types;
109 u32 local_publ_count;
110};
111
Allan Stephense3ec9c72010-12-31 18:59:34 +0000112static struct name_table table;
Ingo Molnar34af9462006-06-27 02:53:55 -0700113DEFINE_RWLOCK(tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100114
Sam Ravnborg05790c62006-03-20 22:37:04 -0800115static int hash(int x)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100116{
Eric Dumazeta02cec22010-09-22 20:43:57 +0000117 return x & (tipc_nametbl_size - 1);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100118}
119
120/**
121 * publ_create - create a publication structure
122 */
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900123static struct publication *publ_create(u32 type, u32 lower, u32 upper,
124 u32 scope, u32 node, u32 port_ref,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100125 u32 key)
126{
Panagiotis Issaris0da974f2006-07-21 14:51:30 -0700127 struct publication *publ = kzalloc(sizeof(*publ), GFP_ATOMIC);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100128 if (publ == NULL) {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400129 pr_warn("Publication creation failure, no memory\n");
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800130 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100131 }
132
Per Lidenb97bf3f2006-01-02 19:04:38 +0100133 publ->type = type;
134 publ->lower = lower;
135 publ->upper = upper;
136 publ->scope = scope;
137 publ->node = node;
138 publ->ref = port_ref;
139 publ->key = key;
140 INIT_LIST_HEAD(&publ->local_list);
141 INIT_LIST_HEAD(&publ->pport_list);
142 INIT_LIST_HEAD(&publ->subscr.nodesub_list);
143 return publ;
144}
145
146/**
Per Liden4323add2006-01-18 00:38:21 +0100147 * tipc_subseq_alloc - allocate a specified number of sub-sequence structures
Per Lidenb97bf3f2006-01-02 19:04:38 +0100148 */
Adrian Bunk988f0882006-03-20 22:37:52 -0800149static struct sub_seq *tipc_subseq_alloc(u32 cnt)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100150{
Panagiotis Issaris0da974f2006-07-21 14:51:30 -0700151 struct sub_seq *sseq = kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100152 return sseq;
153}
154
155/**
Per Liden4323add2006-01-18 00:38:21 +0100156 * tipc_nameseq_create - create a name sequence structure for the specified 'type'
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900157 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100158 * Allocates a single sub-sequence structure and sets it to all 0's.
159 */
Adrian Bunk988f0882006-03-20 22:37:52 -0800160static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100161{
Panagiotis Issaris0da974f2006-07-21 14:51:30 -0700162 struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC);
Per Liden4323add2006-01-18 00:38:21 +0100163 struct sub_seq *sseq = tipc_subseq_alloc(1);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100164
165 if (!nseq || !sseq) {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400166 pr_warn("Name sequence creation failed, no memory\n");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100167 kfree(nseq);
168 kfree(sseq);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800169 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100170 }
171
Ingo Molnar34af9462006-06-27 02:53:55 -0700172 spin_lock_init(&nseq->lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100173 nseq->type = type;
174 nseq->sseqs = sseq;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100175 nseq->alloc = 1;
176 INIT_HLIST_NODE(&nseq->ns_list);
177 INIT_LIST_HEAD(&nseq->subscriptions);
178 hlist_add_head(&nseq->ns_list, seq_head);
179 return nseq;
180}
181
Allan Stephensf7fb9d22012-04-26 17:53:03 -0400182/*
183 * nameseq_delete_empty - deletes a name sequence structure if now unused
184 */
185static void nameseq_delete_empty(struct name_seq *seq)
186{
187 if (!seq->first_free && list_empty(&seq->subscriptions)) {
188 hlist_del_init(&seq->ns_list);
189 kfree(seq->sseqs);
190 kfree(seq);
191 }
192}
193
Ben Hutchings2c530402012-07-10 10:55:09 +0000194/**
Per Lidenb97bf3f2006-01-02 19:04:38 +0100195 * nameseq_find_subseq - find sub-sequence (if any) matching a name instance
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900196 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100197 * Very time-critical, so binary searches through sub-sequence array.
198 */
Sam Ravnborg05790c62006-03-20 22:37:04 -0800199static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq,
200 u32 instance)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100201{
202 struct sub_seq *sseqs = nseq->sseqs;
203 int low = 0;
204 int high = nseq->first_free - 1;
205 int mid;
206
207 while (low <= high) {
208 mid = (low + high) / 2;
209 if (instance < sseqs[mid].lower)
210 high = mid - 1;
211 else if (instance > sseqs[mid].upper)
212 low = mid + 1;
213 else
214 return &sseqs[mid];
215 }
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800216 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100217}
218
219/**
220 * nameseq_locate_subseq - determine position of name instance in sub-sequence
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900221 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100222 * Returns index in sub-sequence array of the entry that contains the specified
223 * instance value; if no entry contains that value, returns the position
224 * where a new entry for it would be inserted in the array.
225 *
226 * Note: Similar to binary search code for locating a sub-sequence.
227 */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100228static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance)
229{
230 struct sub_seq *sseqs = nseq->sseqs;
231 int low = 0;
232 int high = nseq->first_free - 1;
233 int mid;
234
235 while (low <= high) {
236 mid = (low + high) / 2;
237 if (instance < sseqs[mid].lower)
238 high = mid - 1;
239 else if (instance > sseqs[mid].upper)
240 low = mid + 1;
241 else
242 return mid;
243 }
244 return low;
245}
246
247/**
Paul Gortmaker617d3c72012-04-30 15:29:02 -0400248 * tipc_nameseq_insert_publ
Per Lidenb97bf3f2006-01-02 19:04:38 +0100249 */
Adrian Bunk988f0882006-03-20 22:37:52 -0800250static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq,
251 u32 type, u32 lower, u32 upper,
252 u32 scope, u32 node, u32 port, u32 key)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100253{
Paul Gortmakerfead3902011-12-29 20:43:44 -0500254 struct tipc_subscription *s;
255 struct tipc_subscription *st;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100256 struct publication *publ;
257 struct sub_seq *sseq;
Allan Stephensb52124a2011-05-30 09:44:38 -0400258 struct name_info *info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100259 int created_subseq = 0;
260
Per Lidenb97bf3f2006-01-02 19:04:38 +0100261 sseq = nameseq_find_subseq(nseq, lower);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100262 if (sseq) {
263
264 /* Lower end overlaps existing entry => need an exact match */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100265 if ((sseq->lower != lower) || (sseq->upper != upper)) {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400266 pr_warn("Cannot publish {%u,%u,%u}, overlap error\n",
267 type, lower, upper);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800268 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100269 }
Allan Stephensb52124a2011-05-30 09:44:38 -0400270
271 info = sseq->info;
Allan Stephensf80c24d2011-11-03 11:12:01 -0400272
273 /* Check if an identical publication already exists */
274 list_for_each_entry(publ, &info->zone_list, zone_list) {
275 if ((publ->ref == port) && (publ->key == key) &&
276 (!publ->node || (publ->node == node)))
277 return NULL;
278 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100279 } else {
280 u32 inspos;
281 struct sub_seq *freesseq;
282
283 /* Find where lower end should be inserted */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100284 inspos = nameseq_locate_subseq(nseq, lower);
285
286 /* Fail if upper end overlaps into an existing entry */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100287 if ((inspos < nseq->first_free) &&
288 (upper >= nseq->sseqs[inspos].lower)) {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400289 pr_warn("Cannot publish {%u,%u,%u}, overlap error\n",
290 type, lower, upper);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800291 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100292 }
293
294 /* Ensure there is space for new sub-sequence */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100295 if (nseq->first_free == nseq->alloc) {
Allan Stephens9ab230f2006-06-25 23:37:24 -0700296 struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2);
297
298 if (!sseqs) {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400299 pr_warn("Cannot publish {%u,%u,%u}, no memory\n",
300 type, lower, upper);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800301 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100302 }
Allan Stephens9ab230f2006-06-25 23:37:24 -0700303 memcpy(sseqs, nseq->sseqs,
304 nseq->alloc * sizeof(struct sub_seq));
305 kfree(nseq->sseqs);
306 nseq->sseqs = sseqs;
307 nseq->alloc *= 2;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100308 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100309
Allan Stephensb52124a2011-05-30 09:44:38 -0400310 info = kzalloc(sizeof(*info), GFP_ATOMIC);
311 if (!info) {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400312 pr_warn("Cannot publish {%u,%u,%u}, no memory\n",
313 type, lower, upper);
Allan Stephensb52124a2011-05-30 09:44:38 -0400314 return NULL;
315 }
316
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400317 INIT_LIST_HEAD(&info->node_list);
318 INIT_LIST_HEAD(&info->cluster_list);
319 INIT_LIST_HEAD(&info->zone_list);
320
Per Lidenb97bf3f2006-01-02 19:04:38 +0100321 /* Insert new sub-sequence */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100322 sseq = &nseq->sseqs[inspos];
323 freesseq = &nseq->sseqs[nseq->first_free];
Allan Stephens0e659672010-12-31 18:59:32 +0000324 memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq));
325 memset(sseq, 0, sizeof(*sseq));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100326 nseq->first_free++;
327 sseq->lower = lower;
328 sseq->upper = upper;
Allan Stephensb52124a2011-05-30 09:44:38 -0400329 sseq->info = info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100330 created_subseq = 1;
331 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100332
Paul Gortmaker617d3c72012-04-30 15:29:02 -0400333 /* Insert a publication */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100334 publ = publ_create(type, lower, upper, scope, node, port, key);
335 if (!publ)
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800336 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100337
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400338 list_add(&publ->zone_list, &info->zone_list);
Allan Stephensb52124a2011-05-30 09:44:38 -0400339 info->zone_list_size++;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100340
Allan Stephensd4f5c122012-04-17 18:16:34 -0400341 if (in_own_cluster(node)) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400342 list_add(&publ->cluster_list, &info->cluster_list);
Allan Stephensb52124a2011-05-30 09:44:38 -0400343 info->cluster_list_size++;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100344 }
345
Allan Stephensd4f5c122012-04-17 18:16:34 -0400346 if (in_own_node(node)) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400347 list_add(&publ->node_list, &info->node_list);
Allan Stephensb52124a2011-05-30 09:44:38 -0400348 info->node_list_size++;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100349 }
350
Paul Gortmaker617d3c72012-04-30 15:29:02 -0400351 /* Any subscriptions waiting for notification? */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100352 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
Per Liden4323add2006-01-18 00:38:21 +0100353 tipc_subscr_report_overlap(s,
354 publ->lower,
355 publ->upper,
356 TIPC_PUBLISHED,
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900357 publ->ref,
Per Liden4323add2006-01-18 00:38:21 +0100358 publ->node,
359 created_subseq);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100360 }
361 return publ;
362}
363
364/**
Paul Gortmaker617d3c72012-04-30 15:29:02 -0400365 * tipc_nameseq_remove_publ
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900366 *
Allan Stephensf1310722006-06-25 23:51:37 -0700367 * NOTE: There may be cases where TIPC is asked to remove a publication
368 * that is not in the name table. For example, if another node issues a
369 * publication for a name sequence that overlaps an existing name sequence
370 * the publication will not be recorded, which means the publication won't
371 * be found when the name sequence is later withdrawn by that node.
372 * A failed withdraw request simply returns a failure indication and lets the
373 * caller issue any error or warning messages associated with such a problem.
Per Lidenb97bf3f2006-01-02 19:04:38 +0100374 */
Adrian Bunk988f0882006-03-20 22:37:52 -0800375static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 inst,
376 u32 node, u32 ref, u32 key)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100377{
378 struct publication *publ;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100379 struct sub_seq *sseq = nameseq_find_subseq(nseq, inst);
Allan Stephensb52124a2011-05-30 09:44:38 -0400380 struct name_info *info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100381 struct sub_seq *free;
Paul Gortmakerfead3902011-12-29 20:43:44 -0500382 struct tipc_subscription *s, *st;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100383 int removed_subseq = 0;
384
Allan Stephensf1310722006-06-25 23:51:37 -0700385 if (!sseq)
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800386 return NULL;
Allan Stephensf1310722006-06-25 23:51:37 -0700387
Allan Stephensb52124a2011-05-30 09:44:38 -0400388 info = sseq->info;
389
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400390 /* Locate publication, if it exists */
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400391 list_for_each_entry(publ, &info->zone_list, zone_list) {
392 if ((publ->key == key) && (publ->ref == ref) &&
393 (!publ->node || (publ->node == node)))
394 goto found;
395 }
396 return NULL;
397
398found:
Allan Stephensf1310722006-06-25 23:51:37 -0700399 /* Remove publication from zone scope list */
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400400 list_del(&publ->zone_list);
Allan Stephensb52124a2011-05-30 09:44:38 -0400401 info->zone_list_size--;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100402
Allan Stephensf1310722006-06-25 23:51:37 -0700403 /* Remove publication from cluster scope list, if present */
Allan Stephensd4f5c122012-04-17 18:16:34 -0400404 if (in_own_cluster(node)) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400405 list_del(&publ->cluster_list);
Allan Stephensb52124a2011-05-30 09:44:38 -0400406 info->cluster_list_size--;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100407 }
Allan Stephensf1310722006-06-25 23:51:37 -0700408
409 /* Remove publication from node scope list, if present */
Allan Stephensd4f5c122012-04-17 18:16:34 -0400410 if (in_own_node(node)) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400411 list_del(&publ->node_list);
Allan Stephensb52124a2011-05-30 09:44:38 -0400412 info->node_list_size--;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100413 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100414
Allan Stephensf1310722006-06-25 23:51:37 -0700415 /* Contract subseq list if no more publications for that subseq */
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400416 if (list_empty(&info->zone_list)) {
Allan Stephensb52124a2011-05-30 09:44:38 -0400417 kfree(info);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100418 free = &nseq->sseqs[nseq->first_free--];
Allan Stephens0e659672010-12-31 18:59:32 +0000419 memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100420 removed_subseq = 1;
421 }
422
Allan Stephensf1310722006-06-25 23:51:37 -0700423 /* Notify any waiting subscriptions */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100424 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
Per Liden4323add2006-01-18 00:38:21 +0100425 tipc_subscr_report_overlap(s,
426 publ->lower,
427 publ->upper,
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900428 TIPC_WITHDRAWN,
429 publ->ref,
Per Liden4323add2006-01-18 00:38:21 +0100430 publ->node,
431 removed_subseq);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100432 }
Allan Stephensf1310722006-06-25 23:51:37 -0700433
Per Lidenb97bf3f2006-01-02 19:04:38 +0100434 return publ;
435}
436
437/**
Ben Hutchings2c530402012-07-10 10:55:09 +0000438 * tipc_nameseq_subscribe - attach a subscription, and issue
Per Lidenb97bf3f2006-01-02 19:04:38 +0100439 * the prescribed number of events if there is any sub-
440 * sequence overlapping with the requested sequence
441 */
Paul Gortmakerfead3902011-12-29 20:43:44 -0500442static void tipc_nameseq_subscribe(struct name_seq *nseq,
443 struct tipc_subscription *s)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100444{
445 struct sub_seq *sseq = nseq->sseqs;
446
447 list_add(&s->nameseq_list, &nseq->subscriptions);
448
449 if (!sseq)
450 return;
451
452 while (sseq != &nseq->sseqs[nseq->first_free]) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400453 if (tipc_subscr_overlap(s, sseq->lower, sseq->upper)) {
454 struct publication *crs;
455 struct name_info *info = sseq->info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100456 int must_report = 1;
457
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400458 list_for_each_entry(crs, &info->zone_list, zone_list) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900459 tipc_subscr_report_overlap(s,
460 sseq->lower,
Per Liden4323add2006-01-18 00:38:21 +0100461 sseq->upper,
462 TIPC_PUBLISHED,
463 crs->ref,
464 crs->node,
465 must_report);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100466 must_report = 0;
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400467 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100468 }
469 sseq++;
470 }
471}
472
473static struct name_seq *nametbl_find_seq(u32 type)
474{
475 struct hlist_head *seq_head;
476 struct hlist_node *seq_node;
477 struct name_seq *ns;
478
Per Lidenb97bf3f2006-01-02 19:04:38 +0100479 seq_head = &table.types[hash(type)];
480 hlist_for_each_entry(ns, seq_node, seq_head, ns_list) {
Allan Stephensb29f1422010-12-31 18:59:25 +0000481 if (ns->type == type)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100482 return ns;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100483 }
484
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800485 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100486};
487
Per Liden4323add2006-01-18 00:38:21 +0100488struct publication *tipc_nametbl_insert_publ(u32 type, u32 lower, u32 upper,
489 u32 scope, u32 node, u32 port, u32 key)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100490{
491 struct name_seq *seq = nametbl_find_seq(type);
492
Allan Stephens8f177892012-04-26 17:57:17 -0400493 if ((scope < TIPC_ZONE_SCOPE) || (scope > TIPC_NODE_SCOPE) ||
494 (lower > upper)) {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400495 pr_debug("Failed to publish illegal {%u,%u,%u} with scope %u\n",
496 type, lower, upper, scope);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800497 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100498 }
499
Allan Stephensb29f1422010-12-31 18:59:25 +0000500 if (!seq)
Per Liden4323add2006-01-18 00:38:21 +0100501 seq = tipc_nameseq_create(type, &table.types[hash(type)]);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100502 if (!seq)
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800503 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100504
Per Liden4323add2006-01-18 00:38:21 +0100505 return tipc_nameseq_insert_publ(seq, type, lower, upper,
506 scope, node, port, key);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100507}
508
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900509struct publication *tipc_nametbl_remove_publ(u32 type, u32 lower,
Per Liden4323add2006-01-18 00:38:21 +0100510 u32 node, u32 ref, u32 key)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100511{
512 struct publication *publ;
513 struct name_seq *seq = nametbl_find_seq(type);
514
515 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 publ = tipc_nameseq_remove_publ(seq, lower, node, ref, key);
Allan Stephensf7fb9d22012-04-26 17:53:03 -0400519 nameseq_delete_empty(seq);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100520 return publ;
521}
522
Ben Hutchings2c530402012-07-10 10:55:09 +0000523/**
Allan Stephensbc9f8142011-11-07 17:00:54 -0500524 * tipc_nametbl_translate - perform name translation
Per Lidenb97bf3f2006-01-02 19:04:38 +0100525 *
Allan Stephensbc9f8142011-11-07 17:00:54 -0500526 * On entry, 'destnode' is the search domain used during translation.
527 *
528 * On exit:
529 * - if name translation is deferred to another node/cluster/zone,
530 * leaves 'destnode' unchanged (will be non-zero) and returns 0
531 * - if name translation is attempted and succeeds, sets 'destnode'
532 * to publishing node and returns port reference (will be non-zero)
533 * - if name translation is attempted and fails, sets 'destnode' to 0
534 * and returns 0
Per Lidenb97bf3f2006-01-02 19:04:38 +0100535 */
Per Liden4323add2006-01-18 00:38:21 +0100536u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100537{
538 struct sub_seq *sseq;
Allan Stephensb52124a2011-05-30 09:44:38 -0400539 struct name_info *info;
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400540 struct publication *publ;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100541 struct name_seq *seq;
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400542 u32 ref = 0;
Allan Stephensbc9f8142011-11-07 17:00:54 -0500543 u32 node = 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100544
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000545 if (!tipc_in_scope(*destnode, tipc_own_addr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100546 return 0;
547
Per Liden4323add2006-01-18 00:38:21 +0100548 read_lock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100549 seq = nametbl_find_seq(type);
550 if (unlikely(!seq))
551 goto not_found;
552 sseq = nameseq_find_subseq(seq, instance);
553 if (unlikely(!sseq))
554 goto not_found;
555 spin_lock_bh(&seq->lock);
Allan Stephensb52124a2011-05-30 09:44:38 -0400556 info = sseq->info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100557
Paul Gortmaker617d3c72012-04-30 15:29:02 -0400558 /* Closest-First Algorithm */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100559 if (likely(!*destnode)) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400560 if (!list_empty(&info->node_list)) {
561 publ = list_first_entry(&info->node_list,
562 struct publication,
563 node_list);
564 list_move_tail(&publ->node_list,
565 &info->node_list);
566 } else if (!list_empty(&info->cluster_list)) {
567 publ = list_first_entry(&info->cluster_list,
568 struct publication,
569 cluster_list);
570 list_move_tail(&publ->cluster_list,
571 &info->cluster_list);
Allan Stephens8af46382011-05-30 11:27:50 -0400572 } else {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400573 publ = list_first_entry(&info->zone_list,
574 struct publication,
575 zone_list);
576 list_move_tail(&publ->zone_list,
577 &info->zone_list);
Allan Stephens8af46382011-05-30 11:27:50 -0400578 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100579 }
580
Paul Gortmaker617d3c72012-04-30 15:29:02 -0400581 /* Round-Robin Algorithm */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100582 else if (*destnode == tipc_own_addr) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400583 if (list_empty(&info->node_list))
584 goto no_match;
585 publ = list_first_entry(&info->node_list, struct publication,
586 node_list);
587 list_move_tail(&publ->node_list, &info->node_list);
Allan Stephens336ebf52012-04-17 18:02:01 -0400588 } else if (in_own_cluster_exact(*destnode)) {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400589 if (list_empty(&info->cluster_list))
590 goto no_match;
591 publ = list_first_entry(&info->cluster_list, struct publication,
592 cluster_list);
593 list_move_tail(&publ->cluster_list, &info->cluster_list);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100594 } else {
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400595 publ = list_first_entry(&info->zone_list, struct publication,
596 zone_list);
597 list_move_tail(&publ->zone_list, &info->zone_list);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100598 }
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400599
600 ref = publ->ref;
Allan Stephensbc9f8142011-11-07 17:00:54 -0500601 node = publ->node;
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400602no_match:
Per Lidenb97bf3f2006-01-02 19:04:38 +0100603 spin_unlock_bh(&seq->lock);
604not_found:
Per Liden4323add2006-01-18 00:38:21 +0100605 read_unlock_bh(&tipc_nametbl_lock);
Allan Stephensbc9f8142011-11-07 17:00:54 -0500606 *destnode = node;
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400607 return ref;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100608}
609
610/**
Per Liden4323add2006-01-18 00:38:21 +0100611 * tipc_nametbl_mc_translate - find multicast destinations
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900612 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100613 * Creates list of all local ports that overlap the given multicast address;
614 * also determines if any off-node ports overlap.
615 *
616 * Note: Publications with a scope narrower than 'limit' are ignored.
617 * (i.e. local node-scope publications mustn't receive messages arriving
618 * from another node, even if the multcast link brought it here)
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900619 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100620 * Returns non-zero if any off-node ports overlap
621 */
Per Liden4323add2006-01-18 00:38:21 +0100622int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit,
Paul Gortmaker45843102011-12-29 20:33:30 -0500623 struct tipc_port_list *dports)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100624{
625 struct name_seq *seq;
626 struct sub_seq *sseq;
627 struct sub_seq *sseq_stop;
Allan Stephensb52124a2011-05-30 09:44:38 -0400628 struct name_info *info;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100629 int res = 0;
630
Per Liden4323add2006-01-18 00:38:21 +0100631 read_lock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100632 seq = nametbl_find_seq(type);
633 if (!seq)
634 goto exit;
635
636 spin_lock_bh(&seq->lock);
637
638 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower);
639 sseq_stop = seq->sseqs + seq->first_free;
640 for (; sseq != sseq_stop; sseq++) {
641 struct publication *publ;
642
643 if (sseq->lower > upper)
644 break;
Allan Stephens968edbe2008-07-14 22:45:33 -0700645
Allan Stephensb52124a2011-05-30 09:44:38 -0400646 info = sseq->info;
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400647 list_for_each_entry(publ, &info->node_list, node_list) {
648 if (publ->scope <= limit)
649 tipc_port_list_add(dports, publ->ref);
Allan Stephens968edbe2008-07-14 22:45:33 -0700650 }
651
Allan Stephensb52124a2011-05-30 09:44:38 -0400652 if (info->cluster_list_size != info->node_list_size)
Allan Stephens968edbe2008-07-14 22:45:33 -0700653 res = 1;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100654 }
655
656 spin_unlock_bh(&seq->lock);
657exit:
Per Liden4323add2006-01-18 00:38:21 +0100658 read_unlock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100659 return res;
660}
661
Allan Stephensc422f1b2011-11-02 15:49:40 -0400662/*
Per Liden4323add2006-01-18 00:38:21 +0100663 * tipc_nametbl_publish - add name publication to network name tables
Per Lidenb97bf3f2006-01-02 19:04:38 +0100664 */
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900665struct publication *tipc_nametbl_publish(u32 type, u32 lower, u32 upper,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100666 u32 scope, u32 port_ref, u32 key)
667{
668 struct publication *publ;
669
670 if (table.local_publ_count >= tipc_max_publications) {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400671 pr_warn("Publication failed, local publication limit reached (%u)\n",
672 tipc_max_publications);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800673 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100674 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100675
Per Liden4323add2006-01-18 00:38:21 +0100676 write_lock_bh(&tipc_nametbl_lock);
Per Liden4323add2006-01-18 00:38:21 +0100677 publ = tipc_nametbl_insert_publ(type, lower, upper, scope,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100678 tipc_own_addr, port_ref, key);
Allan Stephensfd6eced2011-11-09 14:22:52 -0500679 if (likely(publ)) {
680 table.local_publ_count++;
Per Liden4323add2006-01-18 00:38:21 +0100681 tipc_named_publish(publ);
Allan Stephensfd6eced2011-11-09 14:22:52 -0500682 }
Per Liden4323add2006-01-18 00:38:21 +0100683 write_unlock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100684 return publ;
685}
686
687/**
Per Liden4323add2006-01-18 00:38:21 +0100688 * tipc_nametbl_withdraw - withdraw name publication from network name tables
Per Lidenb97bf3f2006-01-02 19:04:38 +0100689 */
Per Liden4323add2006-01-18 00:38:21 +0100690int tipc_nametbl_withdraw(u32 type, u32 lower, u32 ref, u32 key)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100691{
692 struct publication *publ;
693
Per Liden4323add2006-01-18 00:38:21 +0100694 write_lock_bh(&tipc_nametbl_lock);
695 publ = tipc_nametbl_remove_publ(type, lower, tipc_own_addr, ref, key);
Allan Stephensf1310722006-06-25 23:51:37 -0700696 if (likely(publ)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100697 table.local_publ_count--;
Allan Stephens1110b8d2012-04-17 17:57:52 -0400698 tipc_named_withdraw(publ);
Per Liden4323add2006-01-18 00:38:21 +0100699 write_unlock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100700 list_del_init(&publ->pport_list);
701 kfree(publ);
702 return 1;
703 }
Per Liden4323add2006-01-18 00:38:21 +0100704 write_unlock_bh(&tipc_nametbl_lock);
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400705 pr_err("Unable to remove local publication\n"
706 "(type=%u, lower=%u, ref=%u, key=%u)\n",
707 type, lower, ref, key);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100708 return 0;
709}
710
711/**
Per Liden4323add2006-01-18 00:38:21 +0100712 * tipc_nametbl_subscribe - add a subscription object to the name table
Per Lidenb97bf3f2006-01-02 19:04:38 +0100713 */
Paul Gortmakerfead3902011-12-29 20:43:44 -0500714void tipc_nametbl_subscribe(struct tipc_subscription *s)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100715{
716 u32 type = s->seq.type;
717 struct name_seq *seq;
718
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900719 write_lock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100720 seq = nametbl_find_seq(type);
Allan Stephensa0168922010-12-31 18:59:35 +0000721 if (!seq)
Per Liden4323add2006-01-18 00:38:21 +0100722 seq = tipc_nameseq_create(type, &table.types[hash(type)]);
Allan Stephens0e659672010-12-31 18:59:32 +0000723 if (seq) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900724 spin_lock_bh(&seq->lock);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900725 tipc_nameseq_subscribe(seq, s);
726 spin_unlock_bh(&seq->lock);
727 } else {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400728 pr_warn("Failed to create subscription for {%u,%u,%u}\n",
729 s->seq.type, s->seq.lower, s->seq.upper);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900730 }
731 write_unlock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100732}
733
734/**
Per Liden4323add2006-01-18 00:38:21 +0100735 * tipc_nametbl_unsubscribe - remove a subscription object from name table
Per Lidenb97bf3f2006-01-02 19:04:38 +0100736 */
Paul Gortmakerfead3902011-12-29 20:43:44 -0500737void tipc_nametbl_unsubscribe(struct tipc_subscription *s)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100738{
739 struct name_seq *seq;
740
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900741 write_lock_bh(&tipc_nametbl_lock);
742 seq = nametbl_find_seq(s->seq.type);
Allan Stephens0e659672010-12-31 18:59:32 +0000743 if (seq != NULL) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900744 spin_lock_bh(&seq->lock);
745 list_del_init(&s->nameseq_list);
746 spin_unlock_bh(&seq->lock);
Allan Stephensf7fb9d22012-04-26 17:53:03 -0400747 nameseq_delete_empty(seq);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900748 }
749 write_unlock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100750}
751
752
753/**
Ben Hutchings2c530402012-07-10 10:55:09 +0000754 * subseq_list - print specified sub-sequence contents into the given buffer
Per Lidenb97bf3f2006-01-02 19:04:38 +0100755 */
Erik Hugnedc1aed32012-06-29 00:50:23 -0400756static int subseq_list(struct sub_seq *sseq, char *buf, int len, u32 depth,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100757 u32 index)
758{
759 char portIdStr[27];
Allan Stephensc2de5812010-08-17 11:00:14 +0000760 const char *scope_str[] = {"", " zone", " cluster", " node"};
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400761 struct publication *publ;
762 struct name_info *info;
Erik Hugnedc1aed32012-06-29 00:50:23 -0400763 int ret;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100764
Erik Hugnedc1aed32012-06-29 00:50:23 -0400765 ret = tipc_snprintf(buf, len, "%-10u %-10u ", sseq->lower, sseq->upper);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100766
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400767 if (depth == 2) {
Erik Hugnedc1aed32012-06-29 00:50:23 -0400768 ret += tipc_snprintf(buf - ret, len + ret, "\n");
769 return ret;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100770 }
771
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400772 info = sseq->info;
773
774 list_for_each_entry(publ, &info->zone_list, zone_list) {
Allan Stephens0e659672010-12-31 18:59:32 +0000775 sprintf(portIdStr, "<%u.%u.%u:%u>",
Per Lidenb97bf3f2006-01-02 19:04:38 +0100776 tipc_zone(publ->node), tipc_cluster(publ->node),
777 tipc_node(publ->node), publ->ref);
Erik Hugnedc1aed32012-06-29 00:50:23 -0400778 ret += tipc_snprintf(buf + ret, len - ret, "%-26s ", portIdStr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100779 if (depth > 3) {
Erik Hugnedc1aed32012-06-29 00:50:23 -0400780 ret += tipc_snprintf(buf + ret, len - ret, "%-10u %s",
781 publ->key, scope_str[publ->scope]);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100782 }
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400783 if (!list_is_last(&publ->zone_list, &info->zone_list))
Erik Hugnedc1aed32012-06-29 00:50:23 -0400784 ret += tipc_snprintf(buf + ret, len - ret,
785 "\n%33s", " ");
Allan Stephensf6f0a4d2011-05-30 10:48:48 -0400786 };
Per Lidenb97bf3f2006-01-02 19:04:38 +0100787
Erik Hugnedc1aed32012-06-29 00:50:23 -0400788 ret += tipc_snprintf(buf + ret, len - ret, "\n");
789 return ret;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100790}
791
792/**
Ben Hutchings2c530402012-07-10 10:55:09 +0000793 * nameseq_list - print specified name sequence contents into the given buffer
Per Lidenb97bf3f2006-01-02 19:04:38 +0100794 */
Erik Hugnedc1aed32012-06-29 00:50:23 -0400795static int nameseq_list(struct name_seq *seq, char *buf, int len, u32 depth,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100796 u32 type, u32 lowbound, u32 upbound, u32 index)
797{
798 struct sub_seq *sseq;
799 char typearea[11];
Erik Hugnedc1aed32012-06-29 00:50:23 -0400800 int ret = 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100801
Allan Stephens0f15d362008-06-04 17:37:59 -0700802 if (seq->first_free == 0)
Erik Hugnedc1aed32012-06-29 00:50:23 -0400803 return 0;
Allan Stephens0f15d362008-06-04 17:37:59 -0700804
Per Lidenb97bf3f2006-01-02 19:04:38 +0100805 sprintf(typearea, "%-10u", seq->type);
806
807 if (depth == 1) {
Erik Hugnedc1aed32012-06-29 00:50:23 -0400808 ret += tipc_snprintf(buf, len, "%s\n", typearea);
809 return ret;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100810 }
811
812 for (sseq = seq->sseqs; sseq != &seq->sseqs[seq->first_free]; sseq++) {
813 if ((lowbound <= sseq->upper) && (upbound >= sseq->lower)) {
Erik Hugnedc1aed32012-06-29 00:50:23 -0400814 ret += tipc_snprintf(buf + ret, len - ret, "%s ",
815 typearea);
Allan Stephens307fdf52008-06-04 17:38:22 -0700816 spin_lock_bh(&seq->lock);
Erik Hugnedc1aed32012-06-29 00:50:23 -0400817 ret += subseq_list(sseq, buf + ret, len - ret,
818 depth, index);
Allan Stephens307fdf52008-06-04 17:38:22 -0700819 spin_unlock_bh(&seq->lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100820 sprintf(typearea, "%10s", " ");
821 }
822 }
Erik Hugnedc1aed32012-06-29 00:50:23 -0400823 return ret;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100824}
825
826/**
827 * nametbl_header - print name table header into the given buffer
828 */
Erik Hugnedc1aed32012-06-29 00:50:23 -0400829static int nametbl_header(char *buf, int len, u32 depth)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100830{
Allan Stephensc2de5812010-08-17 11:00:14 +0000831 const char *header[] = {
832 "Type ",
833 "Lower Upper ",
834 "Port Identity ",
835 "Publication Scope"
836 };
Per Lidenb97bf3f2006-01-02 19:04:38 +0100837
Allan Stephensc2de5812010-08-17 11:00:14 +0000838 int i;
Erik Hugnedc1aed32012-06-29 00:50:23 -0400839 int ret = 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100840
Allan Stephensc2de5812010-08-17 11:00:14 +0000841 if (depth > 4)
842 depth = 4;
843 for (i = 0; i < depth; i++)
Erik Hugnedc1aed32012-06-29 00:50:23 -0400844 ret += tipc_snprintf(buf + ret, len - ret, header[i]);
845 ret += tipc_snprintf(buf + ret, len - ret, "\n");
846 return ret;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100847}
848
849/**
850 * nametbl_list - print specified name table contents into the given buffer
851 */
Erik Hugnedc1aed32012-06-29 00:50:23 -0400852static int nametbl_list(char *buf, int len, u32 depth_info,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100853 u32 type, u32 lowbound, u32 upbound)
854{
855 struct hlist_head *seq_head;
856 struct hlist_node *seq_node;
857 struct name_seq *seq;
858 int all_types;
Erik Hugnedc1aed32012-06-29 00:50:23 -0400859 int ret = 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100860 u32 depth;
861 u32 i;
862
863 all_types = (depth_info & TIPC_NTQ_ALLTYPES);
864 depth = (depth_info & ~TIPC_NTQ_ALLTYPES);
865
866 if (depth == 0)
Erik Hugnedc1aed32012-06-29 00:50:23 -0400867 return 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100868
869 if (all_types) {
870 /* display all entries in name table to specified depth */
Erik Hugnedc1aed32012-06-29 00:50:23 -0400871 ret += nametbl_header(buf, len, depth);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100872 lowbound = 0;
873 upbound = ~0;
874 for (i = 0; i < tipc_nametbl_size; i++) {
875 seq_head = &table.types[i];
876 hlist_for_each_entry(seq, seq_node, seq_head, ns_list) {
Erik Hugnedc1aed32012-06-29 00:50:23 -0400877 ret += nameseq_list(seq, buf + ret, len - ret,
878 depth, seq->type,
879 lowbound, upbound, i);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100880 }
881 }
882 } else {
883 /* display only the sequence that matches the specified type */
884 if (upbound < lowbound) {
Erik Hugnedc1aed32012-06-29 00:50:23 -0400885 ret += tipc_snprintf(buf + ret, len - ret,
886 "invalid name sequence specified\n");
887 return ret;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100888 }
Erik Hugnedc1aed32012-06-29 00:50:23 -0400889 ret += nametbl_header(buf + ret, len - ret, depth);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100890 i = hash(type);
891 seq_head = &table.types[i];
892 hlist_for_each_entry(seq, seq_node, seq_head, ns_list) {
893 if (seq->type == type) {
Erik Hugnedc1aed32012-06-29 00:50:23 -0400894 ret += nameseq_list(seq, buf + ret, len - ret,
895 depth, type,
896 lowbound, upbound, i);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100897 break;
898 }
899 }
900 }
Erik Hugnedc1aed32012-06-29 00:50:23 -0400901 return ret;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100902}
903
Per Liden4323add2006-01-18 00:38:21 +0100904struct sk_buff *tipc_nametbl_get(const void *req_tlv_area, int req_tlv_space)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100905{
906 struct sk_buff *buf;
907 struct tipc_name_table_query *argv;
908 struct tlv_desc *rep_tlv;
Erik Hugnedc1aed32012-06-29 00:50:23 -0400909 char *pb;
910 int pb_len;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100911 int str_len;
912
913 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NAME_TBL_QUERY))
Per Liden4323add2006-01-18 00:38:21 +0100914 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100915
Erik Hugnedc1aed32012-06-29 00:50:23 -0400916 buf = tipc_cfg_reply_alloc(TLV_SPACE(ULTRA_STRING_MAX_LEN));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100917 if (!buf)
918 return NULL;
919
920 rep_tlv = (struct tlv_desc *)buf->data;
Erik Hugnedc1aed32012-06-29 00:50:23 -0400921 pb = TLV_DATA(rep_tlv);
922 pb_len = ULTRA_STRING_MAX_LEN;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100923 argv = (struct tipc_name_table_query *)TLV_DATA(req_tlv_area);
Per Liden4323add2006-01-18 00:38:21 +0100924 read_lock_bh(&tipc_nametbl_lock);
Erik Hugnedc1aed32012-06-29 00:50:23 -0400925 str_len = nametbl_list(pb, pb_len, ntohl(argv->depth),
926 ntohl(argv->type),
927 ntohl(argv->lowbound), ntohl(argv->upbound));
Per Liden4323add2006-01-18 00:38:21 +0100928 read_unlock_bh(&tipc_nametbl_lock);
Erik Hugnedc1aed32012-06-29 00:50:23 -0400929 str_len += 1; /* for "\0" */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100930 skb_put(buf, TLV_SPACE(str_len));
931 TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len);
932
933 return buf;
934}
935
Per Liden4323add2006-01-18 00:38:21 +0100936int tipc_nametbl_init(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100937{
Allan Stephens4e3e6dc2008-05-12 15:41:53 -0700938 table.types = kcalloc(tipc_nametbl_size, sizeof(struct hlist_head),
939 GFP_ATOMIC);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100940 if (!table.types)
941 return -ENOMEM;
942
Per Lidenb97bf3f2006-01-02 19:04:38 +0100943 table.local_publ_count = 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100944 return 0;
945}
946
Per Liden4323add2006-01-18 00:38:21 +0100947void tipc_nametbl_stop(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100948{
Per Lidenb97bf3f2006-01-02 19:04:38 +0100949 u32 i;
950
951 if (!table.types)
952 return;
953
Allan Stephensf1310722006-06-25 23:51:37 -0700954 /* Verify name table is empty, then release it */
Per Liden4323add2006-01-18 00:38:21 +0100955 write_lock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100956 for (i = 0; i < tipc_nametbl_size; i++) {
Paul Gortmakerf705ab92012-07-11 17:35:01 -0400957 if (hlist_empty(&table.types[i]))
958 continue;
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400959 pr_err("nametbl_stop(): orphaned hash chain detected\n");
Paul Gortmakerf705ab92012-07-11 17:35:01 -0400960 break;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100961 }
962 kfree(table.types);
963 table.types = NULL;
Per Liden4323add2006-01-18 00:38:21 +0100964 write_unlock_bh(&tipc_nametbl_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100965}