2 * net/tipc/name_table.c: TIPC name table code
4 * Copyright (c) 2000-2006, 2014, Ericsson AB
5 * Copyright (c) 2004-2008, 2010-2011, 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
98 struct sub_seq
*sseqs
;
101 struct hlist_node ns_list
;
102 struct list_head subscriptions
;
107 * struct name_table - table containing all existing port name publications
108 * @types: pointer to fixed-sized array of name sequence lists,
109 * accessed via hashing on 'type'; name sequence lists are *not* sorted
110 * @local_publ_count: number of publications issued by this node
113 struct hlist_head
*types
;
114 u32 local_publ_count
;
117 static struct name_table table
;
118 DEFINE_RWLOCK(tipc_nametbl_lock
);
120 static int hash(int x
)
122 return x
& (TIPC_NAMETBL_SIZE
- 1);
126 * publ_create - create a publication structure
128 static struct publication
*publ_create(u32 type
, u32 lower
, u32 upper
,
129 u32 scope
, u32 node
, u32 port_ref
,
132 struct publication
*publ
= kzalloc(sizeof(*publ
), GFP_ATOMIC
);
134 pr_warn("Publication creation failure, no memory\n");
143 publ
->ref
= port_ref
;
145 INIT_LIST_HEAD(&publ
->local_list
);
146 INIT_LIST_HEAD(&publ
->pport_list
);
147 INIT_LIST_HEAD(&publ
->subscr
.nodesub_list
);
152 * tipc_subseq_alloc - allocate a specified number of sub-sequence structures
154 static struct sub_seq
*tipc_subseq_alloc(u32 cnt
)
156 return kcalloc(cnt
, sizeof(struct sub_seq
), GFP_ATOMIC
);
160 * tipc_nameseq_create - create a name sequence structure for the specified 'type'
162 * Allocates a single sub-sequence structure and sets it to all 0's.
164 static struct name_seq
*tipc_nameseq_create(u32 type
, struct hlist_head
*seq_head
)
166 struct name_seq
*nseq
= kzalloc(sizeof(*nseq
), GFP_ATOMIC
);
167 struct sub_seq
*sseq
= tipc_subseq_alloc(1);
169 if (!nseq
|| !sseq
) {
170 pr_warn("Name sequence creation failed, no memory\n");
176 spin_lock_init(&nseq
->lock
);
180 INIT_HLIST_NODE(&nseq
->ns_list
);
181 INIT_LIST_HEAD(&nseq
->subscriptions
);
182 hlist_add_head(&nseq
->ns_list
, seq_head
);
187 * nameseq_delete_empty - deletes a name sequence structure if now unused
189 static void nameseq_delete_empty(struct name_seq
*seq
)
191 if (!seq
->first_free
&& list_empty(&seq
->subscriptions
)) {
192 hlist_del_init(&seq
->ns_list
);
199 * nameseq_find_subseq - find sub-sequence (if any) matching a name instance
201 * Very time-critical, so binary searches through sub-sequence array.
203 static struct sub_seq
*nameseq_find_subseq(struct name_seq
*nseq
,
206 struct sub_seq
*sseqs
= nseq
->sseqs
;
208 int high
= nseq
->first_free
- 1;
211 while (low
<= high
) {
212 mid
= (low
+ high
) / 2;
213 if (instance
< sseqs
[mid
].lower
)
215 else if (instance
> sseqs
[mid
].upper
)
224 * nameseq_locate_subseq - determine position of name instance in sub-sequence
226 * Returns index in sub-sequence array of the entry that contains the specified
227 * instance value; if no entry contains that value, returns the position
228 * where a new entry for it would be inserted in the array.
230 * Note: Similar to binary search code for locating a sub-sequence.
232 static u32
nameseq_locate_subseq(struct name_seq
*nseq
, u32 instance
)
234 struct sub_seq
*sseqs
= nseq
->sseqs
;
236 int high
= nseq
->first_free
- 1;
239 while (low
<= high
) {
240 mid
= (low
+ high
) / 2;
241 if (instance
< sseqs
[mid
].lower
)
243 else if (instance
> sseqs
[mid
].upper
)
252 * tipc_nameseq_insert_publ
254 static struct publication
*tipc_nameseq_insert_publ(struct name_seq
*nseq
,
255 u32 type
, u32 lower
, u32 upper
,
256 u32 scope
, u32 node
, u32 port
, u32 key
)
258 struct tipc_subscription
*s
;
259 struct tipc_subscription
*st
;
260 struct publication
*publ
;
261 struct sub_seq
*sseq
;
262 struct name_info
*info
;
263 int created_subseq
= 0;
265 sseq
= nameseq_find_subseq(nseq
, lower
);
268 /* Lower end overlaps existing entry => need an exact match */
269 if ((sseq
->lower
!= lower
) || (sseq
->upper
!= upper
)) {
275 /* Check if an identical publication already exists */
276 list_for_each_entry(publ
, &info
->zone_list
, zone_list
) {
277 if ((publ
->ref
== port
) && (publ
->key
== key
) &&
278 (!publ
->node
|| (publ
->node
== node
)))
283 struct sub_seq
*freesseq
;
285 /* Find where lower end should be inserted */
286 inspos
= nameseq_locate_subseq(nseq
, lower
);
288 /* Fail if upper end overlaps into an existing entry */
289 if ((inspos
< nseq
->first_free
) &&
290 (upper
>= nseq
->sseqs
[inspos
].lower
)) {
294 /* Ensure there is space for new sub-sequence */
295 if (nseq
->first_free
== nseq
->alloc
) {
296 struct sub_seq
*sseqs
= tipc_subseq_alloc(nseq
->alloc
* 2);
299 pr_warn("Cannot publish {%u,%u,%u}, no memory\n",
303 memcpy(sseqs
, nseq
->sseqs
,
304 nseq
->alloc
* sizeof(struct sub_seq
));
310 info
= kzalloc(sizeof(*info
), GFP_ATOMIC
);
312 pr_warn("Cannot publish {%u,%u,%u}, no memory\n",
317 INIT_LIST_HEAD(&info
->node_list
);
318 INIT_LIST_HEAD(&info
->cluster_list
);
319 INIT_LIST_HEAD(&info
->zone_list
);
321 /* Insert new sub-sequence */
322 sseq
= &nseq
->sseqs
[inspos
];
323 freesseq
= &nseq
->sseqs
[nseq
->first_free
];
324 memmove(sseq
+ 1, sseq
, (freesseq
- sseq
) * sizeof(*sseq
));
325 memset(sseq
, 0, sizeof(*sseq
));
333 /* Insert a publication */
334 publ
= publ_create(type
, lower
, upper
, scope
, node
, port
, key
);
338 list_add(&publ
->zone_list
, &info
->zone_list
);
339 info
->zone_list_size
++;
341 if (in_own_cluster(node
)) {
342 list_add(&publ
->cluster_list
, &info
->cluster_list
);
343 info
->cluster_list_size
++;
346 if (in_own_node(node
)) {
347 list_add(&publ
->node_list
, &info
->node_list
);
348 info
->node_list_size
++;
351 /* Any subscriptions waiting for notification? */
352 list_for_each_entry_safe(s
, st
, &nseq
->subscriptions
, nameseq_list
) {
353 tipc_subscr_report_overlap(s
,
365 * tipc_nameseq_remove_publ
367 * 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.
375 static struct publication
*tipc_nameseq_remove_publ(struct name_seq
*nseq
, u32 inst
,
376 u32 node
, u32 ref
, u32 key
)
378 struct publication
*publ
;
379 struct sub_seq
*sseq
= nameseq_find_subseq(nseq
, inst
);
380 struct name_info
*info
;
381 struct sub_seq
*free
;
382 struct tipc_subscription
*s
, *st
;
383 int removed_subseq
= 0;
390 /* Locate publication, if it exists */
391 list_for_each_entry(publ
, &info
->zone_list
, zone_list
) {
392 if ((publ
->key
== key
) && (publ
->ref
== ref
) &&
393 (!publ
->node
|| (publ
->node
== node
)))
399 /* Remove publication from zone scope list */
400 list_del(&publ
->zone_list
);
401 info
->zone_list_size
--;
403 /* Remove publication from cluster scope list, if present */
404 if (in_own_cluster(node
)) {
405 list_del(&publ
->cluster_list
);
406 info
->cluster_list_size
--;
409 /* Remove publication from node scope list, if present */
410 if (in_own_node(node
)) {
411 list_del(&publ
->node_list
);
412 info
->node_list_size
--;
415 /* Contract subseq list if no more publications for that subseq */
416 if (list_empty(&info
->zone_list
)) {
418 free
= &nseq
->sseqs
[nseq
->first_free
--];
419 memmove(sseq
, sseq
+ 1, (free
- (sseq
+ 1)) * sizeof(*sseq
));
423 /* Notify any waiting subscriptions */
424 list_for_each_entry_safe(s
, st
, &nseq
->subscriptions
, nameseq_list
) {
425 tipc_subscr_report_overlap(s
,
438 * tipc_nameseq_subscribe - attach a subscription, and issue
439 * the prescribed number of events if there is any sub-
440 * sequence overlapping with the requested sequence
442 static void tipc_nameseq_subscribe(struct name_seq
*nseq
,
443 struct tipc_subscription
*s
)
445 struct sub_seq
*sseq
= nseq
->sseqs
;
447 list_add(&s
->nameseq_list
, &nseq
->subscriptions
);
452 while (sseq
!= &nseq
->sseqs
[nseq
->first_free
]) {
453 if (tipc_subscr_overlap(s
, sseq
->lower
, sseq
->upper
)) {
454 struct publication
*crs
;
455 struct name_info
*info
= sseq
->info
;
458 list_for_each_entry(crs
, &info
->zone_list
, zone_list
) {
459 tipc_subscr_report_overlap(s
,
473 static struct name_seq
*nametbl_find_seq(u32 type
)
475 struct hlist_head
*seq_head
;
478 seq_head
= &table
.types
[hash(type
)];
479 hlist_for_each_entry(ns
, seq_head
, ns_list
) {
480 if (ns
->type
== type
)
487 struct publication
*tipc_nametbl_insert_publ(u32 type
, u32 lower
, u32 upper
,
488 u32 scope
, u32 node
, u32 port
, u32 key
)
490 struct name_seq
*seq
= nametbl_find_seq(type
);
492 if ((scope
< TIPC_ZONE_SCOPE
) || (scope
> TIPC_NODE_SCOPE
) ||
494 pr_debug("Failed to publish illegal {%u,%u,%u} with scope %u\n",
495 type
, lower
, upper
, scope
);
500 seq
= tipc_nameseq_create(type
, &table
.types
[hash(type
)]);
504 return tipc_nameseq_insert_publ(seq
, type
, lower
, upper
,
505 scope
, node
, port
, key
);
508 struct publication
*tipc_nametbl_remove_publ(u32 type
, u32 lower
,
509 u32 node
, u32 ref
, u32 key
)
511 struct publication
*publ
;
512 struct name_seq
*seq
= nametbl_find_seq(type
);
517 publ
= tipc_nameseq_remove_publ(seq
, lower
, node
, ref
, key
);
518 nameseq_delete_empty(seq
);
523 * tipc_nametbl_translate - perform name translation
525 * On entry, 'destnode' is the search domain used during translation.
528 * - if name translation is deferred to another node/cluster/zone,
529 * leaves 'destnode' unchanged (will be non-zero) and returns 0
530 * - if name translation is attempted and succeeds, sets 'destnode'
531 * to publishing node and returns port reference (will be non-zero)
532 * - if name translation is attempted and fails, sets 'destnode' to 0
535 u32
tipc_nametbl_translate(u32 type
, u32 instance
, u32
*destnode
)
537 struct sub_seq
*sseq
;
538 struct name_info
*info
;
539 struct publication
*publ
;
540 struct name_seq
*seq
;
544 if (!tipc_in_scope(*destnode
, tipc_own_addr
))
547 read_lock_bh(&tipc_nametbl_lock
);
548 seq
= nametbl_find_seq(type
);
551 sseq
= nameseq_find_subseq(seq
, instance
);
554 spin_lock_bh(&seq
->lock
);
557 /* Closest-First Algorithm */
558 if (likely(!*destnode
)) {
559 if (!list_empty(&info
->node_list
)) {
560 publ
= list_first_entry(&info
->node_list
,
563 list_move_tail(&publ
->node_list
,
565 } else if (!list_empty(&info
->cluster_list
)) {
566 publ
= list_first_entry(&info
->cluster_list
,
569 list_move_tail(&publ
->cluster_list
,
570 &info
->cluster_list
);
572 publ
= list_first_entry(&info
->zone_list
,
575 list_move_tail(&publ
->zone_list
,
580 /* Round-Robin Algorithm */
581 else if (*destnode
== tipc_own_addr
) {
582 if (list_empty(&info
->node_list
))
584 publ
= list_first_entry(&info
->node_list
, struct publication
,
586 list_move_tail(&publ
->node_list
, &info
->node_list
);
587 } else if (in_own_cluster_exact(*destnode
)) {
588 if (list_empty(&info
->cluster_list
))
590 publ
= list_first_entry(&info
->cluster_list
, struct publication
,
592 list_move_tail(&publ
->cluster_list
, &info
->cluster_list
);
594 publ
= list_first_entry(&info
->zone_list
, struct publication
,
596 list_move_tail(&publ
->zone_list
, &info
->zone_list
);
602 spin_unlock_bh(&seq
->lock
);
604 read_unlock_bh(&tipc_nametbl_lock
);
610 * tipc_nametbl_mc_translate - find multicast destinations
612 * Creates list of all local ports that overlap the given multicast address;
613 * also determines if any off-node ports overlap.
615 * Note: Publications with a scope narrower than 'limit' are ignored.
616 * (i.e. local node-scope publications mustn't receive messages arriving
617 * from another node, even if the multcast link brought it here)
619 * Returns non-zero if any off-node ports overlap
621 int tipc_nametbl_mc_translate(u32 type
, u32 lower
, u32 upper
, u32 limit
,
622 struct tipc_port_list
*dports
)
624 struct name_seq
*seq
;
625 struct sub_seq
*sseq
;
626 struct sub_seq
*sseq_stop
;
627 struct name_info
*info
;
630 read_lock_bh(&tipc_nametbl_lock
);
631 seq
= nametbl_find_seq(type
);
635 spin_lock_bh(&seq
->lock
);
637 sseq
= seq
->sseqs
+ nameseq_locate_subseq(seq
, lower
);
638 sseq_stop
= seq
->sseqs
+ seq
->first_free
;
639 for (; sseq
!= sseq_stop
; sseq
++) {
640 struct publication
*publ
;
642 if (sseq
->lower
> upper
)
646 list_for_each_entry(publ
, &info
->node_list
, node_list
) {
647 if (publ
->scope
<= limit
)
648 tipc_port_list_add(dports
, publ
->ref
);
651 if (info
->cluster_list_size
!= info
->node_list_size
)
655 spin_unlock_bh(&seq
->lock
);
657 read_unlock_bh(&tipc_nametbl_lock
);
662 * tipc_nametbl_publish - add name publication to network name tables
664 struct publication
*tipc_nametbl_publish(u32 type
, u32 lower
, u32 upper
,
665 u32 scope
, u32 port_ref
, u32 key
)
667 struct publication
*publ
;
668 struct sk_buff
*buf
= NULL
;
670 if (table
.local_publ_count
>= TIPC_MAX_PUBLICATIONS
) {
671 pr_warn("Publication failed, local publication limit reached (%u)\n",
672 TIPC_MAX_PUBLICATIONS
);
676 write_lock_bh(&tipc_nametbl_lock
);
677 publ
= tipc_nametbl_insert_publ(type
, lower
, upper
, scope
,
678 tipc_own_addr
, port_ref
, key
);
680 table
.local_publ_count
++;
681 buf
= tipc_named_publish(publ
);
682 /* Any pending external events? */
683 tipc_named_process_backlog();
685 write_unlock_bh(&tipc_nametbl_lock
);
688 named_cluster_distribute(buf
);
693 * tipc_nametbl_withdraw - withdraw name publication from network name tables
695 int tipc_nametbl_withdraw(u32 type
, u32 lower
, u32 ref
, u32 key
)
697 struct publication
*publ
;
700 write_lock_bh(&tipc_nametbl_lock
);
701 publ
= tipc_nametbl_remove_publ(type
, lower
, tipc_own_addr
, ref
, key
);
703 table
.local_publ_count
--;
704 buf
= tipc_named_withdraw(publ
);
705 /* Any pending external events? */
706 tipc_named_process_backlog();
707 write_unlock_bh(&tipc_nametbl_lock
);
708 list_del_init(&publ
->pport_list
);
712 named_cluster_distribute(buf
);
715 write_unlock_bh(&tipc_nametbl_lock
);
716 pr_err("Unable to remove local publication\n"
717 "(type=%u, lower=%u, ref=%u, key=%u)\n",
718 type
, lower
, ref
, key
);
723 * tipc_nametbl_subscribe - add a subscription object to the name table
725 void tipc_nametbl_subscribe(struct tipc_subscription
*s
)
727 u32 type
= s
->seq
.type
;
728 struct name_seq
*seq
;
730 write_lock_bh(&tipc_nametbl_lock
);
731 seq
= nametbl_find_seq(type
);
733 seq
= tipc_nameseq_create(type
, &table
.types
[hash(type
)]);
735 spin_lock_bh(&seq
->lock
);
736 tipc_nameseq_subscribe(seq
, s
);
737 spin_unlock_bh(&seq
->lock
);
739 pr_warn("Failed to create subscription for {%u,%u,%u}\n",
740 s
->seq
.type
, s
->seq
.lower
, s
->seq
.upper
);
742 write_unlock_bh(&tipc_nametbl_lock
);
746 * tipc_nametbl_unsubscribe - remove a subscription object from name table
748 void tipc_nametbl_unsubscribe(struct tipc_subscription
*s
)
750 struct name_seq
*seq
;
752 write_lock_bh(&tipc_nametbl_lock
);
753 seq
= nametbl_find_seq(s
->seq
.type
);
755 spin_lock_bh(&seq
->lock
);
756 list_del_init(&s
->nameseq_list
);
757 spin_unlock_bh(&seq
->lock
);
758 nameseq_delete_empty(seq
);
760 write_unlock_bh(&tipc_nametbl_lock
);
765 * subseq_list - print specified sub-sequence contents into the given buffer
767 static int subseq_list(struct sub_seq
*sseq
, char *buf
, int len
, u32 depth
,
771 const char *scope_str
[] = {"", " zone", " cluster", " node"};
772 struct publication
*publ
;
773 struct name_info
*info
;
776 ret
= tipc_snprintf(buf
, len
, "%-10u %-10u ", sseq
->lower
, sseq
->upper
);
779 ret
+= tipc_snprintf(buf
- ret
, len
+ ret
, "\n");
785 list_for_each_entry(publ
, &info
->zone_list
, zone_list
) {
786 sprintf(portIdStr
, "<%u.%u.%u:%u>",
787 tipc_zone(publ
->node
), tipc_cluster(publ
->node
),
788 tipc_node(publ
->node
), publ
->ref
);
789 ret
+= tipc_snprintf(buf
+ ret
, len
- ret
, "%-26s ", portIdStr
);
791 ret
+= tipc_snprintf(buf
+ ret
, len
- ret
, "%-10u %s",
792 publ
->key
, scope_str
[publ
->scope
]);
794 if (!list_is_last(&publ
->zone_list
, &info
->zone_list
))
795 ret
+= tipc_snprintf(buf
+ ret
, len
- ret
,
799 ret
+= tipc_snprintf(buf
+ ret
, len
- ret
, "\n");
804 * nameseq_list - print specified name sequence contents into the given buffer
806 static int nameseq_list(struct name_seq
*seq
, char *buf
, int len
, u32 depth
,
807 u32 type
, u32 lowbound
, u32 upbound
, u32 index
)
809 struct sub_seq
*sseq
;
813 if (seq
->first_free
== 0)
816 sprintf(typearea
, "%-10u", seq
->type
);
819 ret
+= tipc_snprintf(buf
, len
, "%s\n", typearea
);
823 for (sseq
= seq
->sseqs
; sseq
!= &seq
->sseqs
[seq
->first_free
]; sseq
++) {
824 if ((lowbound
<= sseq
->upper
) && (upbound
>= sseq
->lower
)) {
825 ret
+= tipc_snprintf(buf
+ ret
, len
- ret
, "%s ",
827 spin_lock_bh(&seq
->lock
);
828 ret
+= subseq_list(sseq
, buf
+ ret
, len
- ret
,
830 spin_unlock_bh(&seq
->lock
);
831 sprintf(typearea
, "%10s", " ");
838 * nametbl_header - print name table header into the given buffer
840 static int nametbl_header(char *buf
, int len
, u32 depth
)
842 const char *header
[] = {
854 for (i
= 0; i
< depth
; i
++)
855 ret
+= tipc_snprintf(buf
+ ret
, len
- ret
, header
[i
]);
856 ret
+= tipc_snprintf(buf
+ ret
, len
- ret
, "\n");
861 * nametbl_list - print specified name table contents into the given buffer
863 static int nametbl_list(char *buf
, int len
, u32 depth_info
,
864 u32 type
, u32 lowbound
, u32 upbound
)
866 struct hlist_head
*seq_head
;
867 struct name_seq
*seq
;
873 all_types
= (depth_info
& TIPC_NTQ_ALLTYPES
);
874 depth
= (depth_info
& ~TIPC_NTQ_ALLTYPES
);
880 /* display all entries in name table to specified depth */
881 ret
+= nametbl_header(buf
, len
, depth
);
884 for (i
= 0; i
< TIPC_NAMETBL_SIZE
; i
++) {
885 seq_head
= &table
.types
[i
];
886 hlist_for_each_entry(seq
, seq_head
, ns_list
) {
887 ret
+= nameseq_list(seq
, buf
+ ret
, len
- ret
,
889 lowbound
, upbound
, i
);
893 /* display only the sequence that matches the specified type */
894 if (upbound
< lowbound
) {
895 ret
+= tipc_snprintf(buf
+ ret
, len
- ret
,
896 "invalid name sequence specified\n");
899 ret
+= nametbl_header(buf
+ ret
, len
- ret
, depth
);
901 seq_head
= &table
.types
[i
];
902 hlist_for_each_entry(seq
, seq_head
, ns_list
) {
903 if (seq
->type
== type
) {
904 ret
+= nameseq_list(seq
, buf
+ ret
, len
- ret
,
906 lowbound
, upbound
, i
);
914 struct sk_buff
*tipc_nametbl_get(const void *req_tlv_area
, int req_tlv_space
)
917 struct tipc_name_table_query
*argv
;
918 struct tlv_desc
*rep_tlv
;
923 if (!TLV_CHECK(req_tlv_area
, req_tlv_space
, TIPC_TLV_NAME_TBL_QUERY
))
924 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR
);
926 buf
= tipc_cfg_reply_alloc(TLV_SPACE(ULTRA_STRING_MAX_LEN
));
930 rep_tlv
= (struct tlv_desc
*)buf
->data
;
931 pb
= TLV_DATA(rep_tlv
);
932 pb_len
= ULTRA_STRING_MAX_LEN
;
933 argv
= (struct tipc_name_table_query
*)TLV_DATA(req_tlv_area
);
934 read_lock_bh(&tipc_nametbl_lock
);
935 str_len
= nametbl_list(pb
, pb_len
, ntohl(argv
->depth
),
937 ntohl(argv
->lowbound
), ntohl(argv
->upbound
));
938 read_unlock_bh(&tipc_nametbl_lock
);
939 str_len
+= 1; /* for "\0" */
940 skb_put(buf
, TLV_SPACE(str_len
));
941 TLV_SET(rep_tlv
, TIPC_TLV_ULTRA_STRING
, NULL
, str_len
);
946 int tipc_nametbl_init(void)
948 table
.types
= kcalloc(TIPC_NAMETBL_SIZE
, sizeof(struct hlist_head
),
953 table
.local_publ_count
= 0;
958 * tipc_purge_publications - remove all publications for a given type
960 * tipc_nametbl_lock must be held when calling this function
962 static void tipc_purge_publications(struct name_seq
*seq
)
964 struct publication
*publ
, *safe
;
965 struct sub_seq
*sseq
;
966 struct name_info
*info
;
969 nameseq_delete_empty(seq
);
974 list_for_each_entry_safe(publ
, safe
, &info
->zone_list
, zone_list
) {
975 tipc_nametbl_remove_publ(publ
->type
, publ
->lower
, publ
->node
,
976 publ
->ref
, publ
->key
);
981 void tipc_nametbl_stop(void)
984 struct name_seq
*seq
;
985 struct hlist_head
*seq_head
;
986 struct hlist_node
*safe
;
988 /* Verify name table is empty and purge any lingering
989 * publications, then release the name table
991 write_lock_bh(&tipc_nametbl_lock
);
992 for (i
= 0; i
< TIPC_NAMETBL_SIZE
; i
++) {
993 if (hlist_empty(&table
.types
[i
]))
995 seq_head
= &table
.types
[i
];
996 hlist_for_each_entry_safe(seq
, safe
, seq_head
, ns_list
) {
997 tipc_purge_publications(seq
);
1002 write_unlock_bh(&tipc_nametbl_lock
);
1005 int __tipc_nl_add_nametable_publ(struct tipc_nl_msg
*msg
, struct name_seq
*seq
,
1006 struct sub_seq
*sseq
, u32
*last_publ
)
1009 struct nlattr
*attrs
;
1010 struct nlattr
*publ
;
1011 struct publication
*p
;
1014 list_for_each_entry(p
, &sseq
->info
->zone_list
, zone_list
)
1015 if (p
->key
== *last_publ
)
1017 if (p
->key
!= *last_publ
)
1020 p
= list_first_entry(&sseq
->info
->zone_list
, struct publication
,
1024 list_for_each_entry_from(p
, &sseq
->info
->zone_list
, zone_list
) {
1025 *last_publ
= p
->key
;
1027 hdr
= genlmsg_put(msg
->skb
, msg
->portid
, msg
->seq
,
1028 &tipc_genl_v2_family
, NLM_F_MULTI
,
1029 TIPC_NL_NAME_TABLE_GET
);
1033 attrs
= nla_nest_start(msg
->skb
, TIPC_NLA_NAME_TABLE
);
1037 publ
= nla_nest_start(msg
->skb
, TIPC_NLA_NAME_TABLE_PUBL
);
1041 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_TYPE
, seq
->type
))
1043 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_LOWER
, sseq
->lower
))
1045 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_UPPER
, sseq
->upper
))
1047 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_SCOPE
, p
->scope
))
1049 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_NODE
, p
->node
))
1051 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_REF
, p
->ref
))
1053 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_KEY
, p
->key
))
1056 nla_nest_end(msg
->skb
, publ
);
1057 nla_nest_end(msg
->skb
, attrs
);
1058 genlmsg_end(msg
->skb
, hdr
);
1065 nla_nest_cancel(msg
->skb
, publ
);
1067 nla_nest_cancel(msg
->skb
, attrs
);
1069 genlmsg_cancel(msg
->skb
, hdr
);
1074 int __tipc_nl_subseq_list(struct tipc_nl_msg
*msg
, struct name_seq
*seq
,
1075 u32
*last_lower
, u32
*last_publ
)
1077 struct sub_seq
*sseq
;
1078 struct sub_seq
*sseq_start
;
1082 sseq_start
= nameseq_find_subseq(seq
, *last_lower
);
1086 sseq_start
= seq
->sseqs
;
1089 for (sseq
= sseq_start
; sseq
!= &seq
->sseqs
[seq
->first_free
]; sseq
++) {
1090 err
= __tipc_nl_add_nametable_publ(msg
, seq
, sseq
, last_publ
);
1092 *last_lower
= sseq
->lower
;
1101 int __tipc_nl_seq_list(struct tipc_nl_msg
*msg
, u32
*last_type
, u32
*last_lower
,
1104 struct hlist_head
*seq_head
;
1105 struct name_seq
*seq
;
1110 i
= hash(*last_type
);
1114 for (; i
< TIPC_NAMETBL_SIZE
; i
++) {
1115 seq_head
= &table
.types
[i
];
1118 seq
= nametbl_find_seq(*last_type
);
1122 seq
= hlist_entry_safe((seq_head
)->first
,
1123 struct name_seq
, ns_list
);
1128 hlist_for_each_entry_from(seq
, ns_list
) {
1129 spin_lock_bh(&seq
->lock
);
1131 err
= __tipc_nl_subseq_list(msg
, seq
, last_lower
,
1135 *last_type
= seq
->type
;
1136 spin_unlock_bh(&seq
->lock
);
1139 spin_unlock_bh(&seq
->lock
);
1146 int tipc_nl_name_table_dump(struct sk_buff
*skb
, struct netlink_callback
*cb
)
1149 int done
= cb
->args
[3];
1150 u32 last_type
= cb
->args
[0];
1151 u32 last_lower
= cb
->args
[1];
1152 u32 last_publ
= cb
->args
[2];
1153 struct tipc_nl_msg msg
;
1159 msg
.portid
= NETLINK_CB(cb
->skb
).portid
;
1160 msg
.seq
= cb
->nlh
->nlmsg_seq
;
1162 read_lock_bh(&tipc_nametbl_lock
);
1164 err
= __tipc_nl_seq_list(&msg
, &last_type
, &last_lower
, &last_publ
);
1167 } else if (err
!= -EMSGSIZE
) {
1168 /* We never set seq or call nl_dump_check_consistent() this
1169 * means that setting prev_seq here will cause the consistence
1170 * check to fail in the netlink callback handler. Resulting in
1171 * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if
1177 read_unlock_bh(&tipc_nametbl_lock
);
1179 cb
->args
[0] = last_type
;
1180 cb
->args
[1] = last_lower
;
1181 cb
->args
[2] = last_publ
;