2 * net/tipc/name_table.c: TIPC name table code
4 * Copyright (c) 2000-2006, 2014-2015, 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.
40 #include "name_table.h"
41 #include "name_distr.h"
47 #include <net/genetlink.h>
49 #define TIPC_NAMETBL_SIZE 1024 /* must be a power of 2 */
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 static int hash(int x)
110 return x & (TIPC_NAMETBL_SIZE - 1);
114 * publ_create - create a publication structure
116 static struct publication *publ_create(u32 type, u32 lower, u32 upper,
117 u32 scope, u32 node, u32 port_ref,
120 struct publication *publ = kzalloc(sizeof(*publ), GFP_ATOMIC);
122 pr_warn("Publication creation failure, no memory\n");
131 publ->ref = port_ref;
133 INIT_LIST_HEAD(&publ->pport_list);
138 * tipc_subseq_alloc - allocate a specified number of sub-sequence structures
140 static struct sub_seq *tipc_subseq_alloc(u32 cnt)
142 return kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC);
146 * tipc_nameseq_create - create a name sequence structure for the specified 'type'
148 * Allocates a single sub-sequence structure and sets it to all 0's.
150 static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head)
152 struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC);
153 struct sub_seq *sseq = tipc_subseq_alloc(1);
155 if (!nseq || !sseq) {
156 pr_warn("Name sequence creation failed, no memory\n");
162 spin_lock_init(&nseq->lock);
166 INIT_HLIST_NODE(&nseq->ns_list);
167 INIT_LIST_HEAD(&nseq->subscriptions);
168 hlist_add_head_rcu(&nseq->ns_list, seq_head);
173 * nameseq_find_subseq - find sub-sequence (if any) matching a name instance
175 * Very time-critical, so binary searches through sub-sequence array.
177 static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq,
180 struct sub_seq *sseqs = nseq->sseqs;
182 int high = nseq->first_free - 1;
185 while (low <= high) {
186 mid = (low + high) / 2;
187 if (instance < sseqs[mid].lower)
189 else if (instance > sseqs[mid].upper)
198 * nameseq_locate_subseq - determine position of name instance in sub-sequence
200 * Returns index in sub-sequence array of the entry that contains the specified
201 * instance value; if no entry contains that value, returns the position
202 * where a new entry for it would be inserted in the array.
204 * Note: Similar to binary search code for locating a sub-sequence.
206 static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance)
208 struct sub_seq *sseqs = nseq->sseqs;
210 int high = nseq->first_free - 1;
213 while (low <= high) {
214 mid = (low + high) / 2;
215 if (instance < sseqs[mid].lower)
217 else if (instance > sseqs[mid].upper)
226 * tipc_nameseq_insert_publ
228 static struct publication *tipc_nameseq_insert_publ(struct net *net,
229 struct name_seq *nseq,
231 u32 upper, u32 scope,
232 u32 node, u32 port, u32 key)
234 struct tipc_subscription *s;
235 struct tipc_subscription *st;
236 struct publication *publ;
237 struct sub_seq *sseq;
238 struct name_info *info;
239 int created_subseq = 0;
241 sseq = nameseq_find_subseq(nseq, lower);
244 /* Lower end overlaps existing entry => need an exact match */
245 if ((sseq->lower != lower) || (sseq->upper != upper)) {
251 /* Check if an identical publication already exists */
252 list_for_each_entry(publ, &info->zone_list, zone_list) {
253 if ((publ->ref == port) && (publ->key == key) &&
254 (!publ->node || (publ->node == node)))
259 struct sub_seq *freesseq;
261 /* Find where lower end should be inserted */
262 inspos = nameseq_locate_subseq(nseq, lower);
264 /* Fail if upper end overlaps into an existing entry */
265 if ((inspos < nseq->first_free) &&
266 (upper >= nseq->sseqs[inspos].lower)) {
270 /* Ensure there is space for new sub-sequence */
271 if (nseq->first_free == nseq->alloc) {
272 struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2);
275 pr_warn("Cannot publish {%u,%u,%u}, no memory\n",
279 memcpy(sseqs, nseq->sseqs,
280 nseq->alloc * sizeof(struct sub_seq));
286 info = kzalloc(sizeof(*info), GFP_ATOMIC);
288 pr_warn("Cannot publish {%u,%u,%u}, no memory\n",
293 INIT_LIST_HEAD(&info->node_list);
294 INIT_LIST_HEAD(&info->cluster_list);
295 INIT_LIST_HEAD(&info->zone_list);
297 /* Insert new sub-sequence */
298 sseq = &nseq->sseqs[inspos];
299 freesseq = &nseq->sseqs[nseq->first_free];
300 memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq));
301 memset(sseq, 0, sizeof(*sseq));
309 /* Insert a publication */
310 publ = publ_create(type, lower, upper, scope, node, port, key);
314 list_add(&publ->zone_list, &info->zone_list);
315 info->zone_list_size++;
317 if (in_own_cluster(net, node)) {
318 list_add(&publ->cluster_list, &info->cluster_list);
319 info->cluster_list_size++;
322 if (in_own_node(net, node)) {
323 list_add(&publ->node_list, &info->node_list);
324 info->node_list_size++;
327 /* Any subscriptions waiting for notification? */
328 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
329 tipc_subscrp_report_overlap(s, publ->lower, publ->upper,
330 TIPC_PUBLISHED, publ->ref,
331 publ->node, publ->scope,
338 * tipc_nameseq_remove_publ
340 * NOTE: There may be cases where TIPC is asked to remove a publication
341 * that is not in the name table. For example, if another node issues a
342 * publication for a name sequence that overlaps an existing name sequence
343 * the publication will not be recorded, which means the publication won't
344 * be found when the name sequence is later withdrawn by that node.
345 * A failed withdraw request simply returns a failure indication and lets the
346 * caller issue any error or warning messages associated with such a problem.
348 static struct publication *tipc_nameseq_remove_publ(struct net *net,
349 struct name_seq *nseq,
353 struct publication *publ;
354 struct sub_seq *sseq = nameseq_find_subseq(nseq, inst);
355 struct name_info *info;
356 struct sub_seq *free;
357 struct tipc_subscription *s, *st;
358 int removed_subseq = 0;
365 /* Locate publication, if it exists */
366 list_for_each_entry(publ, &info->zone_list, zone_list) {
367 if ((publ->key == key) && (publ->ref == ref) &&
368 (!publ->node || (publ->node == node)))
374 /* Remove publication from zone scope list */
375 list_del(&publ->zone_list);
376 info->zone_list_size--;
378 /* Remove publication from cluster scope list, if present */
379 if (in_own_cluster(net, node)) {
380 list_del(&publ->cluster_list);
381 info->cluster_list_size--;
384 /* Remove publication from node scope list, if present */
385 if (in_own_node(net, node)) {
386 list_del(&publ->node_list);
387 info->node_list_size--;
390 /* Contract subseq list if no more publications for that subseq */
391 if (list_empty(&info->zone_list)) {
393 free = &nseq->sseqs[nseq->first_free--];
394 memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq));
398 /* Notify any waiting subscriptions */
399 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
400 tipc_subscrp_report_overlap(s, publ->lower, publ->upper,
401 TIPC_WITHDRAWN, publ->ref,
402 publ->node, publ->scope,
410 * tipc_nameseq_subscribe - attach a subscription, and optionally
411 * issue the prescribed number of events if there is any sub-
412 * sequence overlapping with the requested sequence
414 static void tipc_nameseq_subscribe(struct name_seq *nseq,
415 struct tipc_subscription *sub)
417 struct sub_seq *sseq = nseq->sseqs;
418 struct tipc_name_seq ns;
419 struct tipc_subscr *s = &sub->evt.s;
422 ns.type = tipc_sub_read(s, seq.type);
423 ns.lower = tipc_sub_read(s, seq.lower);
424 ns.upper = tipc_sub_read(s, seq.upper);
425 no_status = tipc_sub_read(s, filter) & TIPC_SUB_NO_STATUS;
427 tipc_subscrp_get(sub);
428 list_add(&sub->nameseq_list, &nseq->subscriptions);
430 if (no_status || !sseq)
433 while (sseq != &nseq->sseqs[nseq->first_free]) {
434 if (tipc_subscrp_check_overlap(&ns, sseq->lower, sseq->upper)) {
435 struct publication *crs;
436 struct name_info *info = sseq->info;
439 list_for_each_entry(crs, &info->zone_list, zone_list) {
440 tipc_subscrp_report_overlap(sub, sseq->lower,
453 static struct name_seq *nametbl_find_seq(struct net *net, u32 type)
455 struct tipc_net *tn = net_generic(net, tipc_net_id);
456 struct hlist_head *seq_head;
459 seq_head = &tn->nametbl->seq_hlist[hash(type)];
460 hlist_for_each_entry_rcu(ns, seq_head, ns_list) {
461 if (ns->type == type)
468 struct publication *tipc_nametbl_insert_publ(struct net *net, u32 type,
469 u32 lower, u32 upper, u32 scope,
470 u32 node, u32 port, u32 key)
472 struct tipc_net *tn = net_generic(net, tipc_net_id);
473 struct publication *publ;
474 struct name_seq *seq = nametbl_find_seq(net, type);
475 int index = hash(type);
477 if ((scope < TIPC_ZONE_SCOPE) || (scope > TIPC_NODE_SCOPE) ||
479 pr_debug("Failed to publish illegal {%u,%u,%u} with scope %u\n",
480 type, lower, upper, scope);
485 seq = tipc_nameseq_create(type, &tn->nametbl->seq_hlist[index]);
489 spin_lock_bh(&seq->lock);
490 publ = tipc_nameseq_insert_publ(net, seq, type, lower, upper,
491 scope, node, port, key);
492 spin_unlock_bh(&seq->lock);
496 struct publication *tipc_nametbl_remove_publ(struct net *net, u32 type,
497 u32 lower, u32 node, u32 ref,
500 struct publication *publ;
501 struct name_seq *seq = nametbl_find_seq(net, type);
506 spin_lock_bh(&seq->lock);
507 publ = tipc_nameseq_remove_publ(net, seq, lower, node, ref, key);
508 if (!seq->first_free && list_empty(&seq->subscriptions)) {
509 hlist_del_init_rcu(&seq->ns_list);
511 spin_unlock_bh(&seq->lock);
515 spin_unlock_bh(&seq->lock);
520 * tipc_nametbl_translate - perform name translation
522 * On entry, 'destnode' is the search domain used during translation.
525 * - if name translation is deferred to another node/cluster/zone,
526 * leaves 'destnode' unchanged (will be non-zero) and returns 0
527 * - if name translation is attempted and succeeds, sets 'destnode'
528 * to publishing node and returns port reference (will be non-zero)
529 * - if name translation is attempted and fails, sets 'destnode' to 0
532 u32 tipc_nametbl_translate(struct net *net, u32 type, u32 instance,
535 struct tipc_net *tn = net_generic(net, tipc_net_id);
536 struct sub_seq *sseq;
537 struct name_info *info;
538 struct publication *publ;
539 struct name_seq *seq;
543 if (!tipc_in_scope(*destnode, tn->own_addr))
547 seq = nametbl_find_seq(net, type);
550 spin_lock_bh(&seq->lock);
551 sseq = nameseq_find_subseq(seq, instance);
556 /* Closest-First Algorithm */
557 if (likely(!*destnode)) {
558 if (!list_empty(&info->node_list)) {
559 publ = list_first_entry(&info->node_list,
562 list_move_tail(&publ->node_list,
564 } else if (!list_empty(&info->cluster_list)) {
565 publ = list_first_entry(&info->cluster_list,
568 list_move_tail(&publ->cluster_list,
569 &info->cluster_list);
571 publ = list_first_entry(&info->zone_list,
574 list_move_tail(&publ->zone_list,
579 /* Round-Robin Algorithm */
580 else if (*destnode == tn->own_addr) {
581 if (list_empty(&info->node_list))
583 publ = list_first_entry(&info->node_list, struct publication,
585 list_move_tail(&publ->node_list, &info->node_list);
586 } else if (in_own_cluster_exact(net, *destnode)) {
587 if (list_empty(&info->cluster_list))
589 publ = list_first_entry(&info->cluster_list, struct publication,
591 list_move_tail(&publ->cluster_list, &info->cluster_list);
593 publ = list_first_entry(&info->zone_list, struct publication,
595 list_move_tail(&publ->zone_list, &info->zone_list);
601 spin_unlock_bh(&seq->lock);
608 bool tipc_nametbl_lookup(struct net *net, u32 type, u32 instance, u32 scope,
609 struct list_head *dsts, int *dstcnt, u32 exclude,
612 u32 self = tipc_own_addr(net);
613 struct publication *publ;
614 struct name_info *info;
615 struct name_seq *seq;
616 struct sub_seq *sseq;
620 seq = nametbl_find_seq(net, type);
623 spin_lock_bh(&seq->lock);
624 sseq = nameseq_find_subseq(seq, instance);
627 list_for_each_entry(publ, &info->zone_list, zone_list) {
628 if (publ->scope != scope)
630 if (publ->ref == exclude && publ->node == self)
632 tipc_dest_push(dsts, publ->node, publ->ref);
636 list_move_tail(&publ->zone_list, &info->zone_list);
640 spin_unlock_bh(&seq->lock);
643 return !list_empty(dsts);
646 int tipc_nametbl_mc_lookup(struct net *net, u32 type, u32 lower, u32 upper,
647 u32 scope, bool exact, struct list_head *dports)
649 struct sub_seq *sseq_stop;
650 struct name_info *info;
651 struct publication *p;
652 struct name_seq *seq;
653 struct sub_seq *sseq;
657 seq = nametbl_find_seq(net, type);
661 spin_lock_bh(&seq->lock);
662 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower);
663 sseq_stop = seq->sseqs + seq->first_free;
664 for (; sseq != sseq_stop; sseq++) {
665 if (sseq->lower > upper)
668 list_for_each_entry(p, &info->node_list, node_list) {
669 if (p->scope == scope || (!exact && p->scope < scope))
670 tipc_dest_push(dports, 0, p->ref);
673 if (info->cluster_list_size != info->node_list_size)
676 spin_unlock_bh(&seq->lock);
682 /* tipc_nametbl_lookup_dst_nodes - find broadcast destination nodes
683 * - Creates list of nodes that overlap the given multicast address
684 * - Determines if any node local ports overlap
686 void tipc_nametbl_lookup_dst_nodes(struct net *net, u32 type, u32 lower,
687 u32 upper, struct tipc_nlist *nodes)
689 struct sub_seq *sseq, *stop;
690 struct publication *publ;
691 struct name_info *info;
692 struct name_seq *seq;
695 seq = nametbl_find_seq(net, type);
699 spin_lock_bh(&seq->lock);
700 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower);
701 stop = seq->sseqs + seq->first_free;
702 for (; sseq != stop && sseq->lower <= upper; sseq++) {
704 list_for_each_entry(publ, &info->zone_list, zone_list) {
705 tipc_nlist_add(nodes, publ->node);
708 spin_unlock_bh(&seq->lock);
713 /* tipc_nametbl_build_group - build list of communication group members
715 void tipc_nametbl_build_group(struct net *net, struct tipc_group *grp,
718 struct sub_seq *sseq, *stop;
719 struct name_info *info;
720 struct publication *p;
721 struct name_seq *seq;
724 seq = nametbl_find_seq(net, type);
728 spin_lock_bh(&seq->lock);
730 stop = seq->sseqs + seq->first_free;
731 for (; sseq != stop; sseq++) {
733 list_for_each_entry(p, &info->zone_list, zone_list) {
734 if (p->scope != scope)
736 tipc_group_add_member(grp, p->node, p->ref, p->lower);
739 spin_unlock_bh(&seq->lock);
745 * tipc_nametbl_publish - add name publication to network name tables
747 struct publication *tipc_nametbl_publish(struct net *net, u32 type, u32 lower,
748 u32 upper, u32 scope, u32 port_ref,
751 struct publication *publ;
752 struct sk_buff *buf = NULL;
753 struct tipc_net *tn = net_generic(net, tipc_net_id);
755 spin_lock_bh(&tn->nametbl_lock);
756 if (tn->nametbl->local_publ_count >= TIPC_MAX_PUBLICATIONS) {
757 pr_warn("Publication failed, local publication limit reached (%u)\n",
758 TIPC_MAX_PUBLICATIONS);
759 spin_unlock_bh(&tn->nametbl_lock);
763 publ = tipc_nametbl_insert_publ(net, type, lower, upper, scope,
764 tn->own_addr, port_ref, key);
766 tn->nametbl->local_publ_count++;
767 buf = tipc_named_publish(net, publ);
768 /* Any pending external events? */
769 tipc_named_process_backlog(net);
771 spin_unlock_bh(&tn->nametbl_lock);
774 tipc_node_broadcast(net, buf);
779 * tipc_nametbl_withdraw - withdraw name publication from network name tables
781 int tipc_nametbl_withdraw(struct net *net, u32 type, u32 lower, u32 ref,
784 struct publication *publ;
785 struct sk_buff *skb = NULL;
786 struct tipc_net *tn = net_generic(net, tipc_net_id);
788 spin_lock_bh(&tn->nametbl_lock);
789 publ = tipc_nametbl_remove_publ(net, type, lower, tn->own_addr,
792 tn->nametbl->local_publ_count--;
793 skb = tipc_named_withdraw(net, publ);
794 /* Any pending external events? */
795 tipc_named_process_backlog(net);
796 list_del_init(&publ->pport_list);
797 kfree_rcu(publ, rcu);
799 pr_err("Unable to remove local publication\n"
800 "(type=%u, lower=%u, ref=%u, key=%u)\n",
801 type, lower, ref, key);
803 spin_unlock_bh(&tn->nametbl_lock);
806 tipc_node_broadcast(net, skb);
813 * tipc_nametbl_subscribe - add a subscription object to the name table
815 void tipc_nametbl_subscribe(struct tipc_subscription *sub)
817 struct tipc_server *srv = sub->server;
818 struct tipc_net *tn = tipc_net(srv->net);
819 struct tipc_subscr *s = &sub->evt.s;
820 u32 type = tipc_sub_read(s, seq.type);
821 int index = hash(type);
822 struct name_seq *seq;
823 struct tipc_name_seq ns;
825 spin_lock_bh(&tn->nametbl_lock);
826 seq = nametbl_find_seq(srv->net, type);
828 seq = tipc_nameseq_create(type, &tn->nametbl->seq_hlist[index]);
830 spin_lock_bh(&seq->lock);
831 tipc_nameseq_subscribe(seq, sub);
832 spin_unlock_bh(&seq->lock);
834 ns.type = tipc_sub_read(s, seq.type);
835 ns.lower = tipc_sub_read(s, seq.lower);
836 ns.upper = tipc_sub_read(s, seq.upper);
837 pr_warn("Failed to create subscription for {%u,%u,%u}\n",
838 ns.type, ns.lower, ns.upper);
840 spin_unlock_bh(&tn->nametbl_lock);
844 * tipc_nametbl_unsubscribe - remove a subscription object from name table
846 void tipc_nametbl_unsubscribe(struct tipc_subscription *sub)
848 struct tipc_server *srv = sub->server;
849 struct tipc_subscr *s = &sub->evt.s;
850 struct tipc_net *tn = tipc_net(srv->net);
851 struct name_seq *seq;
852 u32 type = tipc_sub_read(s, seq.type);
854 spin_lock_bh(&tn->nametbl_lock);
855 seq = nametbl_find_seq(srv->net, type);
857 spin_lock_bh(&seq->lock);
858 list_del_init(&sub->nameseq_list);
859 tipc_subscrp_put(sub);
860 if (!seq->first_free && list_empty(&seq->subscriptions)) {
861 hlist_del_init_rcu(&seq->ns_list);
863 spin_unlock_bh(&seq->lock);
866 spin_unlock_bh(&seq->lock);
869 spin_unlock_bh(&tn->nametbl_lock);
872 int tipc_nametbl_init(struct net *net)
874 struct tipc_net *tn = net_generic(net, tipc_net_id);
875 struct name_table *tipc_nametbl;
878 tipc_nametbl = kzalloc(sizeof(*tipc_nametbl), GFP_ATOMIC);
882 for (i = 0; i < TIPC_NAMETBL_SIZE; i++)
883 INIT_HLIST_HEAD(&tipc_nametbl->seq_hlist[i]);
885 INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_ZONE_SCOPE]);
886 INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_CLUSTER_SCOPE]);
887 INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_NODE_SCOPE]);
888 tn->nametbl = tipc_nametbl;
889 spin_lock_init(&tn->nametbl_lock);
894 * tipc_purge_publications - remove all publications for a given type
896 * tipc_nametbl_lock must be held when calling this function
898 static void tipc_purge_publications(struct net *net, struct name_seq *seq)
900 struct publication *publ, *safe;
901 struct sub_seq *sseq;
902 struct name_info *info;
904 spin_lock_bh(&seq->lock);
907 list_for_each_entry_safe(publ, safe, &info->zone_list, zone_list) {
908 tipc_nameseq_remove_publ(net, seq, publ->lower, publ->node,
909 publ->ref, publ->key);
910 kfree_rcu(publ, rcu);
912 hlist_del_init_rcu(&seq->ns_list);
914 spin_unlock_bh(&seq->lock);
919 void tipc_nametbl_stop(struct net *net)
922 struct name_seq *seq;
923 struct hlist_head *seq_head;
924 struct tipc_net *tn = net_generic(net, tipc_net_id);
925 struct name_table *tipc_nametbl = tn->nametbl;
927 /* Verify name table is empty and purge any lingering
928 * publications, then release the name table
930 spin_lock_bh(&tn->nametbl_lock);
931 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) {
932 if (hlist_empty(&tipc_nametbl->seq_hlist[i]))
934 seq_head = &tipc_nametbl->seq_hlist[i];
935 hlist_for_each_entry_rcu(seq, seq_head, ns_list) {
936 tipc_purge_publications(net, seq);
939 spin_unlock_bh(&tn->nametbl_lock);
946 static int __tipc_nl_add_nametable_publ(struct tipc_nl_msg *msg,
947 struct name_seq *seq,
948 struct sub_seq *sseq, u32 *last_publ)
951 struct nlattr *attrs;
953 struct publication *p;
956 list_for_each_entry(p, &sseq->info->zone_list, zone_list)
957 if (p->key == *last_publ)
959 if (p->key != *last_publ)
962 p = list_first_entry(&sseq->info->zone_list, struct publication,
966 list_for_each_entry_from(p, &sseq->info->zone_list, zone_list) {
969 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq,
970 &tipc_genl_family, NLM_F_MULTI,
971 TIPC_NL_NAME_TABLE_GET);
975 attrs = nla_nest_start(msg->skb, TIPC_NLA_NAME_TABLE);
979 publ = nla_nest_start(msg->skb, TIPC_NLA_NAME_TABLE_PUBL);
983 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_TYPE, seq->type))
985 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_LOWER, sseq->lower))
987 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_UPPER, sseq->upper))
989 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_SCOPE, p->scope))
991 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_NODE, p->node))
993 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_REF, p->ref))
995 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_KEY, p->key))
998 nla_nest_end(msg->skb, publ);
999 nla_nest_end(msg->skb, attrs);
1000 genlmsg_end(msg->skb, hdr);
1007 nla_nest_cancel(msg->skb, publ);
1009 nla_nest_cancel(msg->skb, attrs);
1011 genlmsg_cancel(msg->skb, hdr);
1016 static int __tipc_nl_subseq_list(struct tipc_nl_msg *msg, struct name_seq *seq,
1017 u32 *last_lower, u32 *last_publ)
1019 struct sub_seq *sseq;
1020 struct sub_seq *sseq_start;
1024 sseq_start = nameseq_find_subseq(seq, *last_lower);
1028 sseq_start = seq->sseqs;
1031 for (sseq = sseq_start; sseq != &seq->sseqs[seq->first_free]; sseq++) {
1032 err = __tipc_nl_add_nametable_publ(msg, seq, sseq, last_publ);
1034 *last_lower = sseq->lower;
1043 static int tipc_nl_seq_list(struct net *net, struct tipc_nl_msg *msg,
1044 u32 *last_type, u32 *last_lower, u32 *last_publ)
1046 struct tipc_net *tn = net_generic(net, tipc_net_id);
1047 struct hlist_head *seq_head;
1048 struct name_seq *seq = NULL;
1053 i = hash(*last_type);
1057 for (; i < TIPC_NAMETBL_SIZE; i++) {
1058 seq_head = &tn->nametbl->seq_hlist[i];
1061 seq = nametbl_find_seq(net, *last_type);
1065 hlist_for_each_entry_rcu(seq, seq_head, ns_list)
1071 hlist_for_each_entry_from_rcu(seq, ns_list) {
1072 spin_lock_bh(&seq->lock);
1073 err = __tipc_nl_subseq_list(msg, seq, last_lower,
1077 *last_type = seq->type;
1078 spin_unlock_bh(&seq->lock);
1081 spin_unlock_bh(&seq->lock);
1088 int tipc_nl_name_table_dump(struct sk_buff *skb, struct netlink_callback *cb)
1091 int done = cb->args[3];
1092 u32 last_type = cb->args[0];
1093 u32 last_lower = cb->args[1];
1094 u32 last_publ = cb->args[2];
1095 struct net *net = sock_net(skb->sk);
1096 struct tipc_nl_msg msg;
1102 msg.portid = NETLINK_CB(cb->skb).portid;
1103 msg.seq = cb->nlh->nlmsg_seq;
1106 err = tipc_nl_seq_list(net, &msg, &last_type, &last_lower, &last_publ);
1109 } else if (err != -EMSGSIZE) {
1110 /* We never set seq or call nl_dump_check_consistent() this
1111 * means that setting prev_seq here will cause the consistence
1112 * check to fail in the netlink callback handler. Resulting in
1113 * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if
1120 cb->args[0] = last_type;
1121 cb->args[1] = last_lower;
1122 cb->args[2] = last_publ;
1128 struct tipc_dest *tipc_dest_find(struct list_head *l, u32 node, u32 port)
1130 u64 value = (u64)node << 32 | port;
1131 struct tipc_dest *dst;
1133 list_for_each_entry(dst, l, list) {
1134 if (dst->value != value)
1141 bool tipc_dest_push(struct list_head *l, u32 node, u32 port)
1143 u64 value = (u64)node << 32 | port;
1144 struct tipc_dest *dst;
1146 if (tipc_dest_find(l, node, port))
1149 dst = kmalloc(sizeof(*dst), GFP_ATOMIC);
1153 list_add(&dst->list, l);
1157 bool tipc_dest_pop(struct list_head *l, u32 *node, u32 *port)
1159 struct tipc_dest *dst;
1163 dst = list_first_entry(l, typeof(*dst), list);
1168 list_del(&dst->list);
1173 bool tipc_dest_del(struct list_head *l, u32 node, u32 port)
1175 struct tipc_dest *dst;
1177 dst = tipc_dest_find(l, node, port);
1180 list_del(&dst->list);
1185 void tipc_dest_list_purge(struct list_head *l)
1187 struct tipc_dest *dst, *tmp;
1189 list_for_each_entry_safe(dst, tmp, l, list) {
1190 list_del(&dst->list);
1195 int tipc_dest_list_len(struct list_head *l)
1197 struct tipc_dest *dst;
1200 list_for_each_entry(dst, l, list) {