2 * net/tipc/name_table.c: TIPC name table code
4 * Copyright (c) 2000-2006, 2014, Ericsson AB
5 * Copyright (c) 2004-2008, 2010-2014, Wind River Systems
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
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.
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.
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
34 * POSSIBILITY OF SUCH DAMAGE.
39 #include "name_table.h"
40 #include "name_distr.h"
43 #define TIPC_NAMETBL_SIZE 1024 /* must be a power of 2 */
45 static const struct nla_policy
46 tipc_nl_name_table_policy[TIPC_NLA_NAME_TABLE_MAX + 1] = {
47 [TIPC_NLA_NAME_TABLE_UNSPEC] = { .type = NLA_UNSPEC },
48 [TIPC_NLA_NAME_TABLE_PUBL] = { .type = NLA_NESTED }
52 * struct name_info - name sequence publication info
53 * @node_list: circular list of publications made by own node
54 * @cluster_list: circular list of publications made by own cluster
55 * @zone_list: circular list of publications made by own zone
56 * @node_list_size: number of entries in "node_list"
57 * @cluster_list_size: number of entries in "cluster_list"
58 * @zone_list_size: number of entries in "zone_list"
60 * Note: The zone list always contains at least one entry, since all
61 * publications of the associated name sequence belong to it.
62 * (The cluster and node lists may be empty.)
65 struct list_head node_list;
66 struct list_head cluster_list;
67 struct list_head zone_list;
69 u32 cluster_list_size;
74 * struct sub_seq - container for all published instances of a name sequence
75 * @lower: name sequence lower bound
76 * @upper: name sequence upper bound
77 * @info: pointer to name sequence publication info
82 struct name_info *info;
86 * struct name_seq - container for all published instances of a name type
87 * @type: 32 bit 'type' value for name sequence
88 * @sseq: pointer to dynamically-sized array of sub-sequences of this 'type';
89 * sub-sequences are sorted in ascending order
90 * @alloc: number of sub-sequences currently in array
91 * @first_free: array index of first unused sub-sequence entry
92 * @ns_list: links to adjacent name sequences in hash chain
93 * @subscriptions: list of subscriptions for this 'type'
94 * @lock: spinlock controlling access to publication lists of all sub-sequences
95 * @rcu: RCU callback head used for deferred freeing
99 struct sub_seq *sseqs;
102 struct hlist_node ns_list;
103 struct list_head subscriptions;
108 struct name_table *tipc_nametbl;
109 DEFINE_SPINLOCK(tipc_nametbl_lock);
111 static int hash(int x)
113 return x & (TIPC_NAMETBL_SIZE - 1);
117 * publ_create - create a publication structure
119 static struct publication *publ_create(u32 type, u32 lower, u32 upper,
120 u32 scope, u32 node, u32 port_ref,
123 struct publication *publ = kzalloc(sizeof(*publ), GFP_ATOMIC);
125 pr_warn("Publication creation failure, no memory\n");
134 publ->ref = port_ref;
136 INIT_LIST_HEAD(&publ->pport_list);
141 * tipc_subseq_alloc - allocate a specified number of sub-sequence structures
143 static struct sub_seq *tipc_subseq_alloc(u32 cnt)
145 return kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC);
149 * tipc_nameseq_create - create a name sequence structure for the specified 'type'
151 * Allocates a single sub-sequence structure and sets it to all 0's.
153 static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head)
155 struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC);
156 struct sub_seq *sseq = tipc_subseq_alloc(1);
158 if (!nseq || !sseq) {
159 pr_warn("Name sequence creation failed, no memory\n");
165 spin_lock_init(&nseq->lock);
169 INIT_HLIST_NODE(&nseq->ns_list);
170 INIT_LIST_HEAD(&nseq->subscriptions);
171 hlist_add_head_rcu(&nseq->ns_list, seq_head);
176 * nameseq_find_subseq - find sub-sequence (if any) matching a name instance
178 * Very time-critical, so binary searches through sub-sequence array.
180 static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq,
183 struct sub_seq *sseqs = nseq->sseqs;
185 int high = nseq->first_free - 1;
188 while (low <= high) {
189 mid = (low + high) / 2;
190 if (instance < sseqs[mid].lower)
192 else if (instance > sseqs[mid].upper)
201 * nameseq_locate_subseq - determine position of name instance in sub-sequence
203 * Returns index in sub-sequence array of the entry that contains the specified
204 * instance value; if no entry contains that value, returns the position
205 * where a new entry for it would be inserted in the array.
207 * Note: Similar to binary search code for locating a sub-sequence.
209 static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance)
211 struct sub_seq *sseqs = nseq->sseqs;
213 int high = nseq->first_free - 1;
216 while (low <= high) {
217 mid = (low + high) / 2;
218 if (instance < sseqs[mid].lower)
220 else if (instance > sseqs[mid].upper)
229 * tipc_nameseq_insert_publ
231 static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq,
232 u32 type, u32 lower, u32 upper,
233 u32 scope, u32 node, u32 port, u32 key)
235 struct tipc_subscription *s;
236 struct tipc_subscription *st;
237 struct publication *publ;
238 struct sub_seq *sseq;
239 struct name_info *info;
240 int created_subseq = 0;
242 sseq = nameseq_find_subseq(nseq, lower);
245 /* Lower end overlaps existing entry => need an exact match */
246 if ((sseq->lower != lower) || (sseq->upper != upper)) {
252 /* Check if an identical publication already exists */
253 list_for_each_entry(publ, &info->zone_list, zone_list) {
254 if ((publ->ref == port) && (publ->key == key) &&
255 (!publ->node || (publ->node == node)))
260 struct sub_seq *freesseq;
262 /* Find where lower end should be inserted */
263 inspos = nameseq_locate_subseq(nseq, lower);
265 /* Fail if upper end overlaps into an existing entry */
266 if ((inspos < nseq->first_free) &&
267 (upper >= nseq->sseqs[inspos].lower)) {
271 /* Ensure there is space for new sub-sequence */
272 if (nseq->first_free == nseq->alloc) {
273 struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2);
276 pr_warn("Cannot publish {%u,%u,%u}, no memory\n",
280 memcpy(sseqs, nseq->sseqs,
281 nseq->alloc * sizeof(struct sub_seq));
287 info = kzalloc(sizeof(*info), GFP_ATOMIC);
289 pr_warn("Cannot publish {%u,%u,%u}, no memory\n",
294 INIT_LIST_HEAD(&info->node_list);
295 INIT_LIST_HEAD(&info->cluster_list);
296 INIT_LIST_HEAD(&info->zone_list);
298 /* Insert new sub-sequence */
299 sseq = &nseq->sseqs[inspos];
300 freesseq = &nseq->sseqs[nseq->first_free];
301 memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq));
302 memset(sseq, 0, sizeof(*sseq));
310 /* Insert a publication */
311 publ = publ_create(type, lower, upper, scope, node, port, key);
315 list_add(&publ->zone_list, &info->zone_list);
316 info->zone_list_size++;
318 if (in_own_cluster(node)) {
319 list_add(&publ->cluster_list, &info->cluster_list);
320 info->cluster_list_size++;
323 if (in_own_node(node)) {
324 list_add(&publ->node_list, &info->node_list);
325 info->node_list_size++;
328 /* Any subscriptions waiting for notification? */
329 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
330 tipc_subscr_report_overlap(s,
342 * tipc_nameseq_remove_publ
344 * NOTE: There may be cases where TIPC is asked to remove a publication
345 * that is not in the name table. For example, if another node issues a
346 * publication for a name sequence that overlaps an existing name sequence
347 * the publication will not be recorded, which means the publication won't
348 * be found when the name sequence is later withdrawn by that node.
349 * A failed withdraw request simply returns a failure indication and lets the
350 * caller issue any error or warning messages associated with such a problem.
352 static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 inst,
353 u32 node, u32 ref, u32 key)
355 struct publication *publ;
356 struct sub_seq *sseq = nameseq_find_subseq(nseq, inst);
357 struct name_info *info;
358 struct sub_seq *free;
359 struct tipc_subscription *s, *st;
360 int removed_subseq = 0;
367 /* Locate publication, if it exists */
368 list_for_each_entry(publ, &info->zone_list, zone_list) {
369 if ((publ->key == key) && (publ->ref == ref) &&
370 (!publ->node || (publ->node == node)))
376 /* Remove publication from zone scope list */
377 list_del(&publ->zone_list);
378 info->zone_list_size--;
380 /* Remove publication from cluster scope list, if present */
381 if (in_own_cluster(node)) {
382 list_del(&publ->cluster_list);
383 info->cluster_list_size--;
386 /* Remove publication from node scope list, if present */
387 if (in_own_node(node)) {
388 list_del(&publ->node_list);
389 info->node_list_size--;
392 /* Contract subseq list if no more publications for that subseq */
393 if (list_empty(&info->zone_list)) {
395 free = &nseq->sseqs[nseq->first_free--];
396 memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq));
400 /* Notify any waiting subscriptions */
401 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
402 tipc_subscr_report_overlap(s,
415 * tipc_nameseq_subscribe - attach a subscription, and issue
416 * the prescribed number of events if there is any sub-
417 * sequence overlapping with the requested sequence
419 static void tipc_nameseq_subscribe(struct name_seq *nseq,
420 struct tipc_subscription *s)
422 struct sub_seq *sseq = nseq->sseqs;
424 list_add(&s->nameseq_list, &nseq->subscriptions);
429 while (sseq != &nseq->sseqs[nseq->first_free]) {
430 if (tipc_subscr_overlap(s, sseq->lower, sseq->upper)) {
431 struct publication *crs;
432 struct name_info *info = sseq->info;
435 list_for_each_entry(crs, &info->zone_list, zone_list) {
436 tipc_subscr_report_overlap(s,
450 static struct name_seq *nametbl_find_seq(u32 type)
452 struct hlist_head *seq_head;
455 seq_head = &tipc_nametbl->seq_hlist[hash(type)];
456 hlist_for_each_entry_rcu(ns, seq_head, ns_list) {
457 if (ns->type == type)
464 struct publication *tipc_nametbl_insert_publ(u32 type, u32 lower, u32 upper,
465 u32 scope, u32 node, u32 port, u32 key)
467 struct publication *publ;
468 struct name_seq *seq = nametbl_find_seq(type);
469 int index = hash(type);
471 if ((scope < TIPC_ZONE_SCOPE) || (scope > TIPC_NODE_SCOPE) ||
473 pr_debug("Failed to publish illegal {%u,%u,%u} with scope %u\n",
474 type, lower, upper, scope);
479 seq = tipc_nameseq_create(type,
480 &tipc_nametbl->seq_hlist[index]);
484 spin_lock_bh(&seq->lock);
485 publ = tipc_nameseq_insert_publ(seq, type, lower, upper,
486 scope, node, port, key);
487 spin_unlock_bh(&seq->lock);
491 struct publication *tipc_nametbl_remove_publ(u32 type, u32 lower,
492 u32 node, u32 ref, u32 key)
494 struct publication *publ;
495 struct name_seq *seq = nametbl_find_seq(type);
500 spin_lock_bh(&seq->lock);
501 publ = tipc_nameseq_remove_publ(seq, lower, node, ref, key);
502 if (!seq->first_free && list_empty(&seq->subscriptions)) {
503 hlist_del_init_rcu(&seq->ns_list);
505 spin_unlock_bh(&seq->lock);
509 spin_unlock_bh(&seq->lock);
514 * tipc_nametbl_translate - perform name translation
516 * On entry, 'destnode' is the search domain used during translation.
519 * - if name translation is deferred to another node/cluster/zone,
520 * leaves 'destnode' unchanged (will be non-zero) and returns 0
521 * - if name translation is attempted and succeeds, sets 'destnode'
522 * to publishing node and returns port reference (will be non-zero)
523 * - if name translation is attempted and fails, sets 'destnode' to 0
526 u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode)
528 struct sub_seq *sseq;
529 struct name_info *info;
530 struct publication *publ;
531 struct name_seq *seq;
535 if (!tipc_in_scope(*destnode, tipc_own_addr))
539 seq = nametbl_find_seq(type);
542 spin_lock_bh(&seq->lock);
543 sseq = nameseq_find_subseq(seq, instance);
548 /* Closest-First Algorithm */
549 if (likely(!*destnode)) {
550 if (!list_empty(&info->node_list)) {
551 publ = list_first_entry(&info->node_list,
554 list_move_tail(&publ->node_list,
556 } else if (!list_empty(&info->cluster_list)) {
557 publ = list_first_entry(&info->cluster_list,
560 list_move_tail(&publ->cluster_list,
561 &info->cluster_list);
563 publ = list_first_entry(&info->zone_list,
566 list_move_tail(&publ->zone_list,
571 /* Round-Robin Algorithm */
572 else if (*destnode == tipc_own_addr) {
573 if (list_empty(&info->node_list))
575 publ = list_first_entry(&info->node_list, struct publication,
577 list_move_tail(&publ->node_list, &info->node_list);
578 } else if (in_own_cluster_exact(*destnode)) {
579 if (list_empty(&info->cluster_list))
581 publ = list_first_entry(&info->cluster_list, struct publication,
583 list_move_tail(&publ->cluster_list, &info->cluster_list);
585 publ = list_first_entry(&info->zone_list, struct publication,
587 list_move_tail(&publ->zone_list, &info->zone_list);
593 spin_unlock_bh(&seq->lock);
601 * tipc_nametbl_mc_translate - find multicast destinations
603 * Creates list of all local ports that overlap the given multicast address;
604 * also determines if any off-node ports overlap.
606 * Note: Publications with a scope narrower than 'limit' are ignored.
607 * (i.e. local node-scope publications mustn't receive messages arriving
608 * from another node, even if the multcast link brought it here)
610 * Returns non-zero if any off-node ports overlap
612 int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit,
613 struct tipc_port_list *dports)
615 struct name_seq *seq;
616 struct sub_seq *sseq;
617 struct sub_seq *sseq_stop;
618 struct name_info *info;
622 seq = nametbl_find_seq(type);
626 spin_lock_bh(&seq->lock);
627 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower);
628 sseq_stop = seq->sseqs + seq->first_free;
629 for (; sseq != sseq_stop; sseq++) {
630 struct publication *publ;
632 if (sseq->lower > upper)
636 list_for_each_entry(publ, &info->node_list, node_list) {
637 if (publ->scope <= limit)
638 tipc_port_list_add(dports, publ->ref);
641 if (info->cluster_list_size != info->node_list_size)
644 spin_unlock_bh(&seq->lock);
651 * tipc_nametbl_publish - add name publication to network name tables
653 struct publication *tipc_nametbl_publish(u32 type, u32 lower, u32 upper,
654 u32 scope, u32 port_ref, u32 key)
656 struct publication *publ;
657 struct sk_buff *buf = NULL;
659 spin_lock_bh(&tipc_nametbl_lock);
660 if (tipc_nametbl->local_publ_count >= TIPC_MAX_PUBLICATIONS) {
661 pr_warn("Publication failed, local publication limit reached (%u)\n",
662 TIPC_MAX_PUBLICATIONS);
663 spin_unlock_bh(&tipc_nametbl_lock);
667 publ = tipc_nametbl_insert_publ(type, lower, upper, scope,
668 tipc_own_addr, port_ref, key);
670 tipc_nametbl->local_publ_count++;
671 buf = tipc_named_publish(publ);
672 /* Any pending external events? */
673 tipc_named_process_backlog();
675 spin_unlock_bh(&tipc_nametbl_lock);
678 named_cluster_distribute(buf);
683 * tipc_nametbl_withdraw - withdraw name publication from network name tables
685 int tipc_nametbl_withdraw(u32 type, u32 lower, u32 ref, u32 key)
687 struct publication *publ;
688 struct sk_buff *skb = NULL;
690 spin_lock_bh(&tipc_nametbl_lock);
691 publ = tipc_nametbl_remove_publ(type, lower, tipc_own_addr, ref, key);
693 tipc_nametbl->local_publ_count--;
694 skb = tipc_named_withdraw(publ);
695 /* Any pending external events? */
696 tipc_named_process_backlog();
697 list_del_init(&publ->pport_list);
698 kfree_rcu(publ, rcu);
700 pr_err("Unable to remove local publication\n"
701 "(type=%u, lower=%u, ref=%u, key=%u)\n",
702 type, lower, ref, key);
704 spin_unlock_bh(&tipc_nametbl_lock);
707 named_cluster_distribute(skb);
714 * tipc_nametbl_subscribe - add a subscription object to the name table
716 void tipc_nametbl_subscribe(struct tipc_subscription *s)
718 u32 type = s->seq.type;
719 int index = hash(type);
720 struct name_seq *seq;
722 spin_lock_bh(&tipc_nametbl_lock);
723 seq = nametbl_find_seq(type);
725 seq = tipc_nameseq_create(type,
726 &tipc_nametbl->seq_hlist[index]);
728 spin_lock_bh(&seq->lock);
729 tipc_nameseq_subscribe(seq, s);
730 spin_unlock_bh(&seq->lock);
732 pr_warn("Failed to create subscription for {%u,%u,%u}\n",
733 s->seq.type, s->seq.lower, s->seq.upper);
735 spin_unlock_bh(&tipc_nametbl_lock);
739 * tipc_nametbl_unsubscribe - remove a subscription object from name table
741 void tipc_nametbl_unsubscribe(struct tipc_subscription *s)
743 struct name_seq *seq;
745 spin_lock_bh(&tipc_nametbl_lock);
746 seq = nametbl_find_seq(s->seq.type);
748 spin_lock_bh(&seq->lock);
749 list_del_init(&s->nameseq_list);
750 if (!seq->first_free && list_empty(&seq->subscriptions)) {
751 hlist_del_init_rcu(&seq->ns_list);
753 spin_unlock_bh(&seq->lock);
756 spin_unlock_bh(&seq->lock);
759 spin_unlock_bh(&tipc_nametbl_lock);
763 * subseq_list - print specified sub-sequence contents into the given buffer
765 static int subseq_list(struct sub_seq *sseq, char *buf, int len, u32 depth,
769 const char *scope_str[] = {"", " zone", " cluster", " node"};
770 struct publication *publ;
771 struct name_info *info;
774 ret = tipc_snprintf(buf, len, "%-10u %-10u ", sseq->lower, sseq->upper);
777 ret += tipc_snprintf(buf - ret, len + ret, "\n");
783 list_for_each_entry(publ, &info->zone_list, zone_list) {
784 sprintf(portIdStr, "<%u.%u.%u:%u>",
785 tipc_zone(publ->node), tipc_cluster(publ->node),
786 tipc_node(publ->node), publ->ref);
787 ret += tipc_snprintf(buf + ret, len - ret, "%-26s ", portIdStr);
789 ret += tipc_snprintf(buf + ret, len - ret, "%-10u %s",
790 publ->key, scope_str[publ->scope]);
792 if (!list_is_last(&publ->zone_list, &info->zone_list))
793 ret += tipc_snprintf(buf + ret, len - ret,
797 ret += tipc_snprintf(buf + ret, len - ret, "\n");
802 * nameseq_list - print specified name sequence contents into the given buffer
804 static int nameseq_list(struct name_seq *seq, char *buf, int len, u32 depth,
805 u32 type, u32 lowbound, u32 upbound, u32 index)
807 struct sub_seq *sseq;
811 if (seq->first_free == 0)
814 sprintf(typearea, "%-10u", seq->type);
817 ret += tipc_snprintf(buf, len, "%s\n", typearea);
821 for (sseq = seq->sseqs; sseq != &seq->sseqs[seq->first_free]; sseq++) {
822 if ((lowbound <= sseq->upper) && (upbound >= sseq->lower)) {
823 ret += tipc_snprintf(buf + ret, len - ret, "%s ",
825 spin_lock_bh(&seq->lock);
826 ret += subseq_list(sseq, buf + ret, len - ret,
828 spin_unlock_bh(&seq->lock);
829 sprintf(typearea, "%10s", " ");
836 * nametbl_header - print name table header into the given buffer
838 static int nametbl_header(char *buf, int len, u32 depth)
840 const char *header[] = {
852 for (i = 0; i < depth; i++)
853 ret += tipc_snprintf(buf + ret, len - ret, header[i]);
854 ret += tipc_snprintf(buf + ret, len - ret, "\n");
859 * nametbl_list - print specified name table contents into the given buffer
861 static int nametbl_list(char *buf, int len, u32 depth_info,
862 u32 type, u32 lowbound, u32 upbound)
864 struct hlist_head *seq_head;
865 struct name_seq *seq;
871 all_types = (depth_info & TIPC_NTQ_ALLTYPES);
872 depth = (depth_info & ~TIPC_NTQ_ALLTYPES);
878 /* display all entries in name table to specified depth */
879 ret += nametbl_header(buf, len, depth);
882 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) {
883 seq_head = &tipc_nametbl->seq_hlist[i];
884 hlist_for_each_entry_rcu(seq, seq_head, ns_list) {
885 ret += nameseq_list(seq, buf + ret, len - ret,
887 lowbound, upbound, i);
891 /* display only the sequence that matches the specified type */
892 if (upbound < lowbound) {
893 ret += tipc_snprintf(buf + ret, len - ret,
894 "invalid name sequence specified\n");
897 ret += nametbl_header(buf + ret, len - ret, depth);
899 seq_head = &tipc_nametbl->seq_hlist[i];
900 hlist_for_each_entry_rcu(seq, seq_head, ns_list) {
901 if (seq->type == type) {
902 ret += nameseq_list(seq, buf + ret, len - ret,
904 lowbound, upbound, i);
912 struct sk_buff *tipc_nametbl_get(const void *req_tlv_area, int req_tlv_space)
915 struct tipc_name_table_query *argv;
916 struct tlv_desc *rep_tlv;
921 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NAME_TBL_QUERY))
922 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
924 buf = tipc_cfg_reply_alloc(TLV_SPACE(ULTRA_STRING_MAX_LEN));
928 rep_tlv = (struct tlv_desc *)buf->data;
929 pb = TLV_DATA(rep_tlv);
930 pb_len = ULTRA_STRING_MAX_LEN;
931 argv = (struct tipc_name_table_query *)TLV_DATA(req_tlv_area);
933 str_len = nametbl_list(pb, pb_len, ntohl(argv->depth),
935 ntohl(argv->lowbound), ntohl(argv->upbound));
937 str_len += 1; /* for "\0" */
938 skb_put(buf, TLV_SPACE(str_len));
939 TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len);
944 int tipc_nametbl_init(void)
948 tipc_nametbl = kzalloc(sizeof(*tipc_nametbl), GFP_ATOMIC);
952 for (i = 0; i < TIPC_NAMETBL_SIZE; i++)
953 INIT_HLIST_HEAD(&tipc_nametbl->seq_hlist[i]);
955 INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_ZONE_SCOPE]);
956 INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_CLUSTER_SCOPE]);
957 INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_NODE_SCOPE]);
962 * tipc_purge_publications - remove all publications for a given type
964 * tipc_nametbl_lock must be held when calling this function
966 static void tipc_purge_publications(struct name_seq *seq)
968 struct publication *publ, *safe;
969 struct sub_seq *sseq;
970 struct name_info *info;
972 spin_lock_bh(&seq->lock);
975 list_for_each_entry_safe(publ, safe, &info->zone_list, zone_list) {
976 tipc_nametbl_remove_publ(publ->type, publ->lower, publ->node,
977 publ->ref, publ->key);
978 kfree_rcu(publ, rcu);
980 hlist_del_init_rcu(&seq->ns_list);
982 spin_unlock_bh(&seq->lock);
987 void tipc_nametbl_stop(void)
990 struct name_seq *seq;
991 struct hlist_head *seq_head;
993 /* Verify name table is empty and purge any lingering
994 * publications, then release the name table
996 spin_lock_bh(&tipc_nametbl_lock);
997 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) {
998 if (hlist_empty(&tipc_nametbl->seq_hlist[i]))
1000 seq_head = &tipc_nametbl->seq_hlist[i];
1001 hlist_for_each_entry_rcu(seq, seq_head, ns_list) {
1002 tipc_purge_publications(seq);
1005 spin_unlock_bh(&tipc_nametbl_lock);
1008 kfree(tipc_nametbl);
1012 static int __tipc_nl_add_nametable_publ(struct tipc_nl_msg *msg,
1013 struct name_seq *seq,
1014 struct sub_seq *sseq, u32 *last_publ)
1017 struct nlattr *attrs;
1018 struct nlattr *publ;
1019 struct publication *p;
1022 list_for_each_entry(p, &sseq->info->zone_list, zone_list)
1023 if (p->key == *last_publ)
1025 if (p->key != *last_publ)
1028 p = list_first_entry(&sseq->info->zone_list, struct publication,
1032 list_for_each_entry_from(p, &sseq->info->zone_list, zone_list) {
1033 *last_publ = p->key;
1035 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq,
1036 &tipc_genl_v2_family, NLM_F_MULTI,
1037 TIPC_NL_NAME_TABLE_GET);
1041 attrs = nla_nest_start(msg->skb, TIPC_NLA_NAME_TABLE);
1045 publ = nla_nest_start(msg->skb, TIPC_NLA_NAME_TABLE_PUBL);
1049 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_TYPE, seq->type))
1051 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_LOWER, sseq->lower))
1053 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_UPPER, sseq->upper))
1055 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_SCOPE, p->scope))
1057 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_NODE, p->node))
1059 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_REF, p->ref))
1061 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_KEY, p->key))
1064 nla_nest_end(msg->skb, publ);
1065 nla_nest_end(msg->skb, attrs);
1066 genlmsg_end(msg->skb, hdr);
1073 nla_nest_cancel(msg->skb, publ);
1075 nla_nest_cancel(msg->skb, attrs);
1077 genlmsg_cancel(msg->skb, hdr);
1082 static int __tipc_nl_subseq_list(struct tipc_nl_msg *msg, struct name_seq *seq,
1083 u32 *last_lower, u32 *last_publ)
1085 struct sub_seq *sseq;
1086 struct sub_seq *sseq_start;
1090 sseq_start = nameseq_find_subseq(seq, *last_lower);
1094 sseq_start = seq->sseqs;
1097 for (sseq = sseq_start; sseq != &seq->sseqs[seq->first_free]; sseq++) {
1098 err = __tipc_nl_add_nametable_publ(msg, seq, sseq, last_publ);
1100 *last_lower = sseq->lower;
1109 static int __tipc_nl_seq_list(struct tipc_nl_msg *msg, u32 *last_type,
1110 u32 *last_lower, u32 *last_publ)
1112 struct hlist_head *seq_head;
1113 struct name_seq *seq = NULL;
1118 i = hash(*last_type);
1122 for (; i < TIPC_NAMETBL_SIZE; i++) {
1123 seq_head = &tipc_nametbl->seq_hlist[i];
1126 seq = nametbl_find_seq(*last_type);
1130 hlist_for_each_entry_rcu(seq, seq_head, ns_list)
1136 hlist_for_each_entry_from_rcu(seq, ns_list) {
1137 spin_lock_bh(&seq->lock);
1138 err = __tipc_nl_subseq_list(msg, seq, last_lower,
1142 *last_type = seq->type;
1143 spin_unlock_bh(&seq->lock);
1146 spin_unlock_bh(&seq->lock);
1153 int tipc_nl_name_table_dump(struct sk_buff *skb, struct netlink_callback *cb)
1156 int done = cb->args[3];
1157 u32 last_type = cb->args[0];
1158 u32 last_lower = cb->args[1];
1159 u32 last_publ = cb->args[2];
1160 struct tipc_nl_msg msg;
1166 msg.portid = NETLINK_CB(cb->skb).portid;
1167 msg.seq = cb->nlh->nlmsg_seq;
1170 err = __tipc_nl_seq_list(&msg, &last_type, &last_lower, &last_publ);
1173 } else if (err != -EMSGSIZE) {
1174 /* We never set seq or call nl_dump_check_consistent() this
1175 * means that setting prev_seq here will cause the consistence
1176 * check to fail in the netlink callback handler. Resulting in
1177 * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if
1184 cb->args[0] = last_type;
1185 cb->args[1] = last_lower;
1186 cb->args[2] = last_publ;