2 * net/tipc/name_table.c: TIPC name table code
4 * Copyright (c) 2000-2006, 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"
44 static int tipc_nametbl_size = 1024; /* must be a power of 2 */
47 * struct name_info - name sequence publication info
48 * @node_list: circular list of publications made by own node
49 * @cluster_list: circular list of publications made by own cluster
50 * @zone_list: circular list of publications made by own zone
51 * @node_list_size: number of entries in "node_list"
52 * @cluster_list_size: number of entries in "cluster_list"
53 * @zone_list_size: number of entries in "zone_list"
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.)
61 struct list_head node_list;
62 struct list_head cluster_list;
63 struct list_head zone_list;
65 u32 cluster_list_size;
70 * struct sub_seq - container for all published instances of a name sequence
71 * @lower: name sequence lower bound
72 * @upper: name sequence upper bound
73 * @info: pointer to name sequence publication info
79 struct name_info *info;
83 * struct name_seq - container for all published instances of a name type
84 * @type: 32 bit 'type' value for name sequence
85 * @sseq: pointer to dynamically-sized array of sub-sequences of this 'type';
86 * sub-sequences are sorted in ascending order
87 * @alloc: number of sub-sequences currently in array
88 * @first_free: array index of first unused sub-sequence entry
89 * @ns_list: links to adjacent name sequences in hash chain
90 * @subscriptions: list of subscriptions for this 'type'
91 * @lock: spinlock controlling access to publication lists of all sub-sequences
96 struct sub_seq *sseqs;
99 struct hlist_node ns_list;
100 struct list_head subscriptions;
105 * struct name_table - table containing all existing port name publications
106 * @types: pointer to fixed-sized array of name sequence lists,
107 * accessed via hashing on 'type'; name sequence lists are *not* sorted
108 * @local_publ_count: number of publications issued by this node
112 struct hlist_head *types;
113 u32 local_publ_count;
116 static struct name_table table;
117 DEFINE_RWLOCK(tipc_nametbl_lock);
119 static int hash(int x)
121 return x & (tipc_nametbl_size - 1);
125 * 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 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
155 static struct sub_seq *tipc_subseq_alloc(u32 cnt)
157 struct sub_seq *sseq = kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC);
162 * tipc_nameseq_create - create a name sequence structure for the specified 'type'
164 * Allocates a single sub-sequence structure and sets it to all 0's.
167 static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head)
169 struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC);
170 struct sub_seq *sseq = tipc_subseq_alloc(1);
172 if (!nseq || !sseq) {
173 warn("Name sequence creation failed, no memory\n");
179 spin_lock_init(&nseq->lock);
183 INIT_HLIST_NODE(&nseq->ns_list);
184 INIT_LIST_HEAD(&nseq->subscriptions);
185 hlist_add_head(&nseq->ns_list, seq_head);
190 * nameseq_find_subseq - find sub-sequence (if any) matching a name instance
192 * Very time-critical, so binary searches through sub-sequence array.
195 static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq,
198 struct sub_seq *sseqs = nseq->sseqs;
200 int high = nseq->first_free - 1;
203 while (low <= high) {
204 mid = (low + high) / 2;
205 if (instance < sseqs[mid].lower)
207 else if (instance > sseqs[mid].upper)
216 * nameseq_locate_subseq - determine position of name instance in sub-sequence
218 * Returns index in sub-sequence array of the entry that contains the specified
219 * instance value; if no entry contains that value, returns the position
220 * where a new entry for it would be inserted in the array.
222 * Note: Similar to binary search code for locating a sub-sequence.
225 static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance)
227 struct sub_seq *sseqs = nseq->sseqs;
229 int high = nseq->first_free - 1;
232 while (low <= high) {
233 mid = (low + high) / 2;
234 if (instance < sseqs[mid].lower)
236 else if (instance > sseqs[mid].upper)
245 * tipc_nameseq_insert_publ -
248 static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq,
249 u32 type, u32 lower, u32 upper,
250 u32 scope, u32 node, u32 port, u32 key)
252 struct tipc_subscription *s;
253 struct tipc_subscription *st;
254 struct publication *publ;
255 struct sub_seq *sseq;
256 struct name_info *info;
257 int created_subseq = 0;
259 sseq = nameseq_find_subseq(nseq, lower);
262 /* Lower end overlaps existing entry => need an exact match */
264 if ((sseq->lower != lower) || (sseq->upper != upper)) {
265 warn("Cannot publish {%u,%u,%u}, overlap error\n",
272 /* Check if an identical publication already exists */
273 list_for_each_entry(publ, &info->zone_list, zone_list) {
274 if ((publ->ref == port) && (publ->key == key) &&
275 (!publ->node || (publ->node == node)))
280 struct sub_seq *freesseq;
282 /* Find where lower end should be inserted */
284 inspos = nameseq_locate_subseq(nseq, lower);
286 /* Fail if upper end overlaps into an existing entry */
288 if ((inspos < nseq->first_free) &&
289 (upper >= nseq->sseqs[inspos].lower)) {
290 warn("Cannot publish {%u,%u,%u}, overlap error\n",
295 /* Ensure there is space for new sub-sequence */
297 if (nseq->first_free == nseq->alloc) {
298 struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2);
301 warn("Cannot publish {%u,%u,%u}, no memory\n",
305 memcpy(sseqs, nseq->sseqs,
306 nseq->alloc * sizeof(struct sub_seq));
312 info = kzalloc(sizeof(*info), GFP_ATOMIC);
314 warn("Cannot publish {%u,%u,%u}, no memory\n",
319 INIT_LIST_HEAD(&info->node_list);
320 INIT_LIST_HEAD(&info->cluster_list);
321 INIT_LIST_HEAD(&info->zone_list);
323 /* Insert new sub-sequence */
325 sseq = &nseq->sseqs[inspos];
326 freesseq = &nseq->sseqs[nseq->first_free];
327 memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq));
328 memset(sseq, 0, sizeof(*sseq));
336 /* Insert a publication: */
338 publ = publ_create(type, lower, upper, scope, node, port, key);
342 list_add(&publ->zone_list, &info->zone_list);
343 info->zone_list_size++;
345 if (in_own_cluster(node)) {
346 list_add(&publ->cluster_list, &info->cluster_list);
347 info->cluster_list_size++;
350 if (node == tipc_own_addr) {
351 list_add(&publ->node_list, &info->node_list);
352 info->node_list_size++;
356 * Any subscriptions waiting for notification?
358 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
359 tipc_subscr_report_overlap(s,
371 * tipc_nameseq_remove_publ -
373 * NOTE: There may be cases where TIPC is asked to remove a publication
374 * that is not in the name table. For example, if another node issues a
375 * publication for a name sequence that overlaps an existing name sequence
376 * the publication will not be recorded, which means the publication won't
377 * be found when the name sequence is later withdrawn by that node.
378 * A failed withdraw request simply returns a failure indication and lets the
379 * caller issue any error or warning messages associated with such a problem.
382 static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 inst,
383 u32 node, u32 ref, u32 key)
385 struct publication *publ;
386 struct sub_seq *sseq = nameseq_find_subseq(nseq, inst);
387 struct name_info *info;
388 struct sub_seq *free;
389 struct tipc_subscription *s, *st;
390 int removed_subseq = 0;
397 /* Locate publication, if it exists */
399 list_for_each_entry(publ, &info->zone_list, zone_list) {
400 if ((publ->key == key) && (publ->ref == ref) &&
401 (!publ->node || (publ->node == node)))
407 /* Remove publication from zone scope list */
409 list_del(&publ->zone_list);
410 info->zone_list_size--;
412 /* Remove publication from cluster scope list, if present */
414 if (in_own_cluster(node)) {
415 list_del(&publ->cluster_list);
416 info->cluster_list_size--;
419 /* Remove publication from node scope list, if present */
421 if (node == tipc_own_addr) {
422 list_del(&publ->node_list);
423 info->node_list_size--;
426 /* Contract subseq list if no more publications for that subseq */
428 if (list_empty(&info->zone_list)) {
430 free = &nseq->sseqs[nseq->first_free--];
431 memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq));
435 /* Notify any waiting subscriptions */
437 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
438 tipc_subscr_report_overlap(s,
451 * tipc_nameseq_subscribe: attach a subscription, and issue
452 * the prescribed number of events if there is any sub-
453 * sequence overlapping with the requested sequence
456 static void tipc_nameseq_subscribe(struct name_seq *nseq,
457 struct tipc_subscription *s)
459 struct sub_seq *sseq = nseq->sseqs;
461 list_add(&s->nameseq_list, &nseq->subscriptions);
466 while (sseq != &nseq->sseqs[nseq->first_free]) {
467 if (tipc_subscr_overlap(s, sseq->lower, sseq->upper)) {
468 struct publication *crs;
469 struct name_info *info = sseq->info;
472 list_for_each_entry(crs, &info->zone_list, zone_list) {
473 tipc_subscr_report_overlap(s,
487 static struct name_seq *nametbl_find_seq(u32 type)
489 struct hlist_head *seq_head;
490 struct hlist_node *seq_node;
493 seq_head = &table.types[hash(type)];
494 hlist_for_each_entry(ns, seq_node, seq_head, ns_list) {
495 if (ns->type == type)
502 struct publication *tipc_nametbl_insert_publ(u32 type, u32 lower, u32 upper,
503 u32 scope, u32 node, u32 port, u32 key)
505 struct name_seq *seq = nametbl_find_seq(type);
508 warn("Failed to publish illegal {%u,%u,%u}\n",
514 seq = tipc_nameseq_create(type, &table.types[hash(type)]);
518 return tipc_nameseq_insert_publ(seq, type, lower, upper,
519 scope, node, port, key);
522 struct publication *tipc_nametbl_remove_publ(u32 type, u32 lower,
523 u32 node, u32 ref, u32 key)
525 struct publication *publ;
526 struct name_seq *seq = nametbl_find_seq(type);
531 publ = tipc_nameseq_remove_publ(seq, lower, node, ref, key);
533 if (!seq->first_free && list_empty(&seq->subscriptions)) {
534 hlist_del_init(&seq->ns_list);
542 * tipc_nametbl_translate - perform name translation
544 * On entry, 'destnode' is the search domain used during translation.
547 * - if name translation is deferred to another node/cluster/zone,
548 * leaves 'destnode' unchanged (will be non-zero) and returns 0
549 * - if name translation is attempted and succeeds, sets 'destnode'
550 * to publishing node and returns port reference (will be non-zero)
551 * - if name translation is attempted and fails, sets 'destnode' to 0
555 u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode)
557 struct sub_seq *sseq;
558 struct name_info *info;
559 struct publication *publ;
560 struct name_seq *seq;
564 if (!tipc_in_scope(*destnode, tipc_own_addr))
567 read_lock_bh(&tipc_nametbl_lock);
568 seq = nametbl_find_seq(type);
571 sseq = nameseq_find_subseq(seq, instance);
574 spin_lock_bh(&seq->lock);
577 /* Closest-First Algorithm: */
578 if (likely(!*destnode)) {
579 if (!list_empty(&info->node_list)) {
580 publ = list_first_entry(&info->node_list,
583 list_move_tail(&publ->node_list,
585 } else if (!list_empty(&info->cluster_list)) {
586 publ = list_first_entry(&info->cluster_list,
589 list_move_tail(&publ->cluster_list,
590 &info->cluster_list);
592 publ = list_first_entry(&info->zone_list,
595 list_move_tail(&publ->zone_list,
600 /* Round-Robin Algorithm: */
601 else if (*destnode == tipc_own_addr) {
602 if (list_empty(&info->node_list))
604 publ = list_first_entry(&info->node_list, struct publication,
606 list_move_tail(&publ->node_list, &info->node_list);
607 } else if (in_own_cluster(*destnode)) {
608 if (list_empty(&info->cluster_list))
610 publ = list_first_entry(&info->cluster_list, struct publication,
612 list_move_tail(&publ->cluster_list, &info->cluster_list);
614 publ = list_first_entry(&info->zone_list, struct publication,
616 list_move_tail(&publ->zone_list, &info->zone_list);
622 spin_unlock_bh(&seq->lock);
624 read_unlock_bh(&tipc_nametbl_lock);
630 * tipc_nametbl_mc_translate - find multicast destinations
632 * Creates list of all local ports that overlap the given multicast address;
633 * also determines if any off-node ports overlap.
635 * Note: Publications with a scope narrower than 'limit' are ignored.
636 * (i.e. local node-scope publications mustn't receive messages arriving
637 * from another node, even if the multcast link brought it here)
639 * Returns non-zero if any off-node ports overlap
642 int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit,
643 struct tipc_port_list *dports)
645 struct name_seq *seq;
646 struct sub_seq *sseq;
647 struct sub_seq *sseq_stop;
648 struct name_info *info;
651 read_lock_bh(&tipc_nametbl_lock);
652 seq = nametbl_find_seq(type);
656 spin_lock_bh(&seq->lock);
658 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower);
659 sseq_stop = seq->sseqs + seq->first_free;
660 for (; sseq != sseq_stop; sseq++) {
661 struct publication *publ;
663 if (sseq->lower > upper)
667 list_for_each_entry(publ, &info->node_list, node_list) {
668 if (publ->scope <= limit)
669 tipc_port_list_add(dports, publ->ref);
672 if (info->cluster_list_size != info->node_list_size)
676 spin_unlock_bh(&seq->lock);
678 read_unlock_bh(&tipc_nametbl_lock);
683 * tipc_nametbl_publish - add name publication to network name tables
686 struct publication *tipc_nametbl_publish(u32 type, u32 lower, u32 upper,
687 u32 scope, u32 port_ref, u32 key)
689 struct publication *publ;
691 if (table.local_publ_count >= tipc_max_publications) {
692 warn("Publication failed, local publication limit reached (%u)\n",
693 tipc_max_publications);
697 write_lock_bh(&tipc_nametbl_lock);
698 table.local_publ_count++;
699 publ = tipc_nametbl_insert_publ(type, lower, upper, scope,
700 tipc_own_addr, port_ref, key);
701 if (publ && (scope != TIPC_NODE_SCOPE))
702 tipc_named_publish(publ);
703 write_unlock_bh(&tipc_nametbl_lock);
708 * tipc_nametbl_withdraw - withdraw name publication from network name tables
711 int tipc_nametbl_withdraw(u32 type, u32 lower, u32 ref, u32 key)
713 struct publication *publ;
715 write_lock_bh(&tipc_nametbl_lock);
716 publ = tipc_nametbl_remove_publ(type, lower, tipc_own_addr, ref, key);
718 table.local_publ_count--;
719 if (publ->scope != TIPC_NODE_SCOPE)
720 tipc_named_withdraw(publ);
721 write_unlock_bh(&tipc_nametbl_lock);
722 list_del_init(&publ->pport_list);
726 write_unlock_bh(&tipc_nametbl_lock);
727 err("Unable to remove local publication\n"
728 "(type=%u, lower=%u, ref=%u, key=%u)\n",
729 type, lower, ref, key);
734 * tipc_nametbl_subscribe - add a subscription object to the name table
737 void tipc_nametbl_subscribe(struct tipc_subscription *s)
739 u32 type = s->seq.type;
740 struct name_seq *seq;
742 write_lock_bh(&tipc_nametbl_lock);
743 seq = nametbl_find_seq(type);
745 seq = tipc_nameseq_create(type, &table.types[hash(type)]);
747 spin_lock_bh(&seq->lock);
748 tipc_nameseq_subscribe(seq, s);
749 spin_unlock_bh(&seq->lock);
751 warn("Failed to create subscription for {%u,%u,%u}\n",
752 s->seq.type, s->seq.lower, s->seq.upper);
754 write_unlock_bh(&tipc_nametbl_lock);
758 * tipc_nametbl_unsubscribe - remove a subscription object from name table
761 void tipc_nametbl_unsubscribe(struct tipc_subscription *s)
763 struct name_seq *seq;
765 write_lock_bh(&tipc_nametbl_lock);
766 seq = nametbl_find_seq(s->seq.type);
768 spin_lock_bh(&seq->lock);
769 list_del_init(&s->nameseq_list);
770 spin_unlock_bh(&seq->lock);
771 if ((seq->first_free == 0) && list_empty(&seq->subscriptions)) {
772 hlist_del_init(&seq->ns_list);
777 write_unlock_bh(&tipc_nametbl_lock);
782 * subseq_list: print specified sub-sequence contents into the given buffer
785 static void subseq_list(struct sub_seq *sseq, struct print_buf *buf, u32 depth,
789 const char *scope_str[] = {"", " zone", " cluster", " node"};
790 struct publication *publ;
791 struct name_info *info;
793 tipc_printf(buf, "%-10u %-10u ", sseq->lower, sseq->upper);
796 tipc_printf(buf, "\n");
802 list_for_each_entry(publ, &info->zone_list, zone_list) {
803 sprintf(portIdStr, "<%u.%u.%u:%u>",
804 tipc_zone(publ->node), tipc_cluster(publ->node),
805 tipc_node(publ->node), publ->ref);
806 tipc_printf(buf, "%-26s ", portIdStr);
808 tipc_printf(buf, "%-10u %s", publ->key,
809 scope_str[publ->scope]);
811 if (!list_is_last(&publ->zone_list, &info->zone_list))
812 tipc_printf(buf, "\n%33s", " ");
815 tipc_printf(buf, "\n");
819 * nameseq_list: print specified name sequence contents into the given buffer
822 static void nameseq_list(struct name_seq *seq, struct print_buf *buf, u32 depth,
823 u32 type, u32 lowbound, u32 upbound, u32 index)
825 struct sub_seq *sseq;
828 if (seq->first_free == 0)
831 sprintf(typearea, "%-10u", seq->type);
834 tipc_printf(buf, "%s\n", typearea);
838 for (sseq = seq->sseqs; sseq != &seq->sseqs[seq->first_free]; sseq++) {
839 if ((lowbound <= sseq->upper) && (upbound >= sseq->lower)) {
840 tipc_printf(buf, "%s ", typearea);
841 spin_lock_bh(&seq->lock);
842 subseq_list(sseq, buf, depth, index);
843 spin_unlock_bh(&seq->lock);
844 sprintf(typearea, "%10s", " ");
850 * nametbl_header - print name table header into the given buffer
853 static void nametbl_header(struct print_buf *buf, u32 depth)
855 const char *header[] = {
866 for (i = 0; i < depth; i++)
867 tipc_printf(buf, header[i]);
868 tipc_printf(buf, "\n");
872 * nametbl_list - print specified name table contents into the given buffer
875 static void nametbl_list(struct print_buf *buf, u32 depth_info,
876 u32 type, u32 lowbound, u32 upbound)
878 struct hlist_head *seq_head;
879 struct hlist_node *seq_node;
880 struct name_seq *seq;
885 all_types = (depth_info & TIPC_NTQ_ALLTYPES);
886 depth = (depth_info & ~TIPC_NTQ_ALLTYPES);
892 /* display all entries in name table to specified depth */
893 nametbl_header(buf, depth);
896 for (i = 0; i < tipc_nametbl_size; i++) {
897 seq_head = &table.types[i];
898 hlist_for_each_entry(seq, seq_node, seq_head, ns_list) {
899 nameseq_list(seq, buf, depth, seq->type,
900 lowbound, upbound, i);
904 /* display only the sequence that matches the specified type */
905 if (upbound < lowbound) {
906 tipc_printf(buf, "invalid name sequence specified\n");
909 nametbl_header(buf, depth);
911 seq_head = &table.types[i];
912 hlist_for_each_entry(seq, seq_node, seq_head, ns_list) {
913 if (seq->type == type) {
914 nameseq_list(seq, buf, depth, type,
915 lowbound, upbound, i);
922 #define MAX_NAME_TBL_QUERY 32768
924 struct sk_buff *tipc_nametbl_get(const void *req_tlv_area, int req_tlv_space)
927 struct tipc_name_table_query *argv;
928 struct tlv_desc *rep_tlv;
932 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NAME_TBL_QUERY))
933 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
935 buf = tipc_cfg_reply_alloc(TLV_SPACE(MAX_NAME_TBL_QUERY));
939 rep_tlv = (struct tlv_desc *)buf->data;
940 tipc_printbuf_init(&b, TLV_DATA(rep_tlv), MAX_NAME_TBL_QUERY);
941 argv = (struct tipc_name_table_query *)TLV_DATA(req_tlv_area);
942 read_lock_bh(&tipc_nametbl_lock);
943 nametbl_list(&b, ntohl(argv->depth), ntohl(argv->type),
944 ntohl(argv->lowbound), ntohl(argv->upbound));
945 read_unlock_bh(&tipc_nametbl_lock);
946 str_len = tipc_printbuf_validate(&b);
948 skb_put(buf, TLV_SPACE(str_len));
949 TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len);
954 int tipc_nametbl_init(void)
956 table.types = kcalloc(tipc_nametbl_size, sizeof(struct hlist_head),
961 table.local_publ_count = 0;
965 void tipc_nametbl_stop(void)
972 /* Verify name table is empty, then release it */
974 write_lock_bh(&tipc_nametbl_lock);
975 for (i = 0; i < tipc_nametbl_size; i++) {
976 if (!hlist_empty(&table.types[i]))
977 err("tipc_nametbl_stop(): hash chain %u is non-null\n", i);
981 write_unlock_bh(&tipc_nametbl_lock);