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"
46 #include <net/genetlink.h>
48 #define TIPC_NAMETBL_SIZE 1024 /* must be a power of 2 */
51 * struct name_info - name sequence publication info
52 * @node_list: circular list of publications made by own node
53 * @cluster_list: circular list of publications made by own cluster
54 * @zone_list: circular list of publications made by own zone
55 * @node_list_size: number of entries in "node_list"
56 * @cluster_list_size: number of entries in "cluster_list"
57 * @zone_list_size: number of entries in "zone_list"
59 * Note: The zone list always contains at least one entry, since all
60 * publications of the associated name sequence belong to it.
61 * (The cluster and node lists may be empty.)
64 struct list_head node_list;
65 struct list_head cluster_list;
66 struct list_head zone_list;
68 u32 cluster_list_size;
73 * struct sub_seq - container for all published instances of a name sequence
74 * @lower: name sequence lower bound
75 * @upper: name sequence upper bound
76 * @info: pointer to name sequence publication info
81 struct name_info *info;
85 * struct name_seq - container for all published instances of a name type
86 * @type: 32 bit 'type' value for name sequence
87 * @sseq: pointer to dynamically-sized array of sub-sequences of this 'type';
88 * sub-sequences are sorted in ascending order
89 * @alloc: number of sub-sequences currently in array
90 * @first_free: array index of first unused sub-sequence entry
91 * @ns_list: links to adjacent name sequences in hash chain
92 * @subscriptions: list of subscriptions for this 'type'
93 * @lock: spinlock controlling access to publication lists of all sub-sequences
94 * @rcu: RCU callback head used for deferred freeing
98 struct sub_seq *sseqs;
101 struct hlist_node ns_list;
102 struct list_head subscriptions;
107 static int hash(int x)
109 return x & (TIPC_NAMETBL_SIZE - 1);
113 * publ_create - create a publication structure
115 static struct publication *publ_create(u32 type, u32 lower, u32 upper,
116 u32 scope, u32 node, u32 port_ref,
119 struct publication *publ = kzalloc(sizeof(*publ), GFP_ATOMIC);
121 pr_warn("Publication creation failure, no memory\n");
130 publ->ref = port_ref;
132 INIT_LIST_HEAD(&publ->pport_list);
137 * tipc_subseq_alloc - allocate a specified number of sub-sequence structures
139 static struct sub_seq *tipc_subseq_alloc(u32 cnt)
141 return kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC);
145 * tipc_nameseq_create - create a name sequence structure for the specified 'type'
147 * Allocates a single sub-sequence structure and sets it to all 0's.
149 static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head)
151 struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC);
152 struct sub_seq *sseq = tipc_subseq_alloc(1);
154 if (!nseq || !sseq) {
155 pr_warn("Name sequence creation failed, no memory\n");
161 spin_lock_init(&nseq->lock);
165 INIT_HLIST_NODE(&nseq->ns_list);
166 INIT_LIST_HEAD(&nseq->subscriptions);
167 hlist_add_head_rcu(&nseq->ns_list, seq_head);
172 * nameseq_find_subseq - find sub-sequence (if any) matching a name instance
174 * Very time-critical, so binary searches through sub-sequence array.
176 static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq,
179 struct sub_seq *sseqs = nseq->sseqs;
181 int high = nseq->first_free - 1;
184 while (low <= high) {
185 mid = (low + high) / 2;
186 if (instance < sseqs[mid].lower)
188 else if (instance > sseqs[mid].upper)
197 * nameseq_locate_subseq - determine position of name instance in sub-sequence
199 * Returns index in sub-sequence array of the entry that contains the specified
200 * instance value; if no entry contains that value, returns the position
201 * where a new entry for it would be inserted in the array.
203 * Note: Similar to binary search code for locating a sub-sequence.
205 static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance)
207 struct sub_seq *sseqs = nseq->sseqs;
209 int high = nseq->first_free - 1;
212 while (low <= high) {
213 mid = (low + high) / 2;
214 if (instance < sseqs[mid].lower)
216 else if (instance > sseqs[mid].upper)
225 * tipc_nameseq_insert_publ
227 static struct publication *tipc_nameseq_insert_publ(struct net *net,
228 struct name_seq *nseq,
230 u32 upper, u32 scope,
231 u32 node, u32 port, u32 key)
233 struct tipc_subscription *s;
234 struct tipc_subscription *st;
235 struct publication *publ;
236 struct sub_seq *sseq;
237 struct name_info *info;
238 int created_subseq = 0;
240 sseq = nameseq_find_subseq(nseq, lower);
243 /* Lower end overlaps existing entry => need an exact match */
244 if ((sseq->lower != lower) || (sseq->upper != upper)) {
250 /* Check if an identical publication already exists */
251 list_for_each_entry(publ, &info->zone_list, zone_list) {
252 if ((publ->ref == port) && (publ->key == key) &&
253 (!publ->node || (publ->node == node)))
258 struct sub_seq *freesseq;
260 /* Find where lower end should be inserted */
261 inspos = nameseq_locate_subseq(nseq, lower);
263 /* Fail if upper end overlaps into an existing entry */
264 if ((inspos < nseq->first_free) &&
265 (upper >= nseq->sseqs[inspos].lower)) {
269 /* Ensure there is space for new sub-sequence */
270 if (nseq->first_free == nseq->alloc) {
271 struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2);
274 pr_warn("Cannot publish {%u,%u,%u}, no memory\n",
278 memcpy(sseqs, nseq->sseqs,
279 nseq->alloc * sizeof(struct sub_seq));
285 info = kzalloc(sizeof(*info), GFP_ATOMIC);
287 pr_warn("Cannot publish {%u,%u,%u}, no memory\n",
292 INIT_LIST_HEAD(&info->node_list);
293 INIT_LIST_HEAD(&info->cluster_list);
294 INIT_LIST_HEAD(&info->zone_list);
296 /* Insert new sub-sequence */
297 sseq = &nseq->sseqs[inspos];
298 freesseq = &nseq->sseqs[nseq->first_free];
299 memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq));
300 memset(sseq, 0, sizeof(*sseq));
308 /* Insert a publication */
309 publ = publ_create(type, lower, upper, scope, node, port, key);
313 list_add(&publ->zone_list, &info->zone_list);
314 info->zone_list_size++;
316 if (in_own_cluster(net, node)) {
317 list_add(&publ->cluster_list, &info->cluster_list);
318 info->cluster_list_size++;
321 if (in_own_node(net, node)) {
322 list_add(&publ->node_list, &info->node_list);
323 info->node_list_size++;
326 /* Any subscriptions waiting for notification? */
327 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
328 tipc_subscrp_report_overlap(s, publ->lower, publ->upper,
329 TIPC_PUBLISHED, publ->ref,
330 publ->node, created_subseq);
336 * tipc_nameseq_remove_publ
338 * NOTE: There may be cases where TIPC is asked to remove a publication
339 * that is not in the name table. For example, if another node issues a
340 * publication for a name sequence that overlaps an existing name sequence
341 * the publication will not be recorded, which means the publication won't
342 * be found when the name sequence is later withdrawn by that node.
343 * A failed withdraw request simply returns a failure indication and lets the
344 * caller issue any error or warning messages associated with such a problem.
346 static struct publication *tipc_nameseq_remove_publ(struct net *net,
347 struct name_seq *nseq,
351 struct publication *publ;
352 struct sub_seq *sseq = nameseq_find_subseq(nseq, inst);
353 struct name_info *info;
354 struct sub_seq *free;
355 struct tipc_subscription *s, *st;
356 int removed_subseq = 0;
363 /* Locate publication, if it exists */
364 list_for_each_entry(publ, &info->zone_list, zone_list) {
365 if ((publ->key == key) && (publ->ref == ref) &&
366 (!publ->node || (publ->node == node)))
372 /* Remove publication from zone scope list */
373 list_del(&publ->zone_list);
374 info->zone_list_size--;
376 /* Remove publication from cluster scope list, if present */
377 if (in_own_cluster(net, node)) {
378 list_del(&publ->cluster_list);
379 info->cluster_list_size--;
382 /* Remove publication from node scope list, if present */
383 if (in_own_node(net, node)) {
384 list_del(&publ->node_list);
385 info->node_list_size--;
388 /* Contract subseq list if no more publications for that subseq */
389 if (list_empty(&info->zone_list)) {
391 free = &nseq->sseqs[nseq->first_free--];
392 memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq));
396 /* Notify any waiting subscriptions */
397 list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) {
398 tipc_subscrp_report_overlap(s, publ->lower, publ->upper,
399 TIPC_WITHDRAWN, publ->ref,
400 publ->node, removed_subseq);
407 * tipc_nameseq_subscribe - attach a subscription, and issue
408 * the prescribed number of events if there is any sub-
409 * sequence overlapping with the requested sequence
411 static void tipc_nameseq_subscribe(struct name_seq *nseq,
412 struct tipc_subscription *s)
414 struct sub_seq *sseq = nseq->sseqs;
415 struct tipc_name_seq ns;
417 tipc_subscrp_convert_seq(&s->evt.s.seq, s->swap, &ns);
419 list_add(&s->nameseq_list, &nseq->subscriptions);
424 while (sseq != &nseq->sseqs[nseq->first_free]) {
425 if (tipc_subscrp_check_overlap(&ns, sseq->lower, sseq->upper)) {
426 struct publication *crs;
427 struct name_info *info = sseq->info;
430 list_for_each_entry(crs, &info->zone_list, zone_list) {
431 tipc_subscrp_report_overlap(s, sseq->lower,
443 static struct name_seq *nametbl_find_seq(struct net *net, u32 type)
445 struct tipc_net *tn = net_generic(net, tipc_net_id);
446 struct hlist_head *seq_head;
449 seq_head = &tn->nametbl->seq_hlist[hash(type)];
450 hlist_for_each_entry_rcu(ns, seq_head, ns_list) {
451 if (ns->type == type)
458 struct publication *tipc_nametbl_insert_publ(struct net *net, u32 type,
459 u32 lower, u32 upper, u32 scope,
460 u32 node, u32 port, u32 key)
462 struct tipc_net *tn = net_generic(net, tipc_net_id);
463 struct publication *publ;
464 struct name_seq *seq = nametbl_find_seq(net, type);
465 int index = hash(type);
467 if ((scope < TIPC_ZONE_SCOPE) || (scope > TIPC_NODE_SCOPE) ||
469 pr_debug("Failed to publish illegal {%u,%u,%u} with scope %u\n",
470 type, lower, upper, scope);
475 seq = tipc_nameseq_create(type, &tn->nametbl->seq_hlist[index]);
479 spin_lock_bh(&seq->lock);
480 publ = tipc_nameseq_insert_publ(net, seq, type, lower, upper,
481 scope, node, port, key);
482 spin_unlock_bh(&seq->lock);
486 struct publication *tipc_nametbl_remove_publ(struct net *net, u32 type,
487 u32 lower, u32 node, u32 ref,
490 struct publication *publ;
491 struct name_seq *seq = nametbl_find_seq(net, type);
496 spin_lock_bh(&seq->lock);
497 publ = tipc_nameseq_remove_publ(net, seq, lower, node, ref, key);
498 if (!seq->first_free && list_empty(&seq->subscriptions)) {
499 hlist_del_init_rcu(&seq->ns_list);
501 spin_unlock_bh(&seq->lock);
505 spin_unlock_bh(&seq->lock);
510 * tipc_nametbl_translate - perform name translation
512 * On entry, 'destnode' is the search domain used during translation.
515 * - if name translation is deferred to another node/cluster/zone,
516 * leaves 'destnode' unchanged (will be non-zero) and returns 0
517 * - if name translation is attempted and succeeds, sets 'destnode'
518 * to publishing node and returns port reference (will be non-zero)
519 * - if name translation is attempted and fails, sets 'destnode' to 0
522 u32 tipc_nametbl_translate(struct net *net, u32 type, u32 instance,
525 struct tipc_net *tn = net_generic(net, tipc_net_id);
526 struct sub_seq *sseq;
527 struct name_info *info;
528 struct publication *publ;
529 struct name_seq *seq;
533 if (!tipc_in_scope(*destnode, tn->own_addr))
537 seq = nametbl_find_seq(net, type);
540 spin_lock_bh(&seq->lock);
541 sseq = nameseq_find_subseq(seq, instance);
546 /* Closest-First Algorithm */
547 if (likely(!*destnode)) {
548 if (!list_empty(&info->node_list)) {
549 publ = list_first_entry(&info->node_list,
552 list_move_tail(&publ->node_list,
554 } else if (!list_empty(&info->cluster_list)) {
555 publ = list_first_entry(&info->cluster_list,
558 list_move_tail(&publ->cluster_list,
559 &info->cluster_list);
561 publ = list_first_entry(&info->zone_list,
564 list_move_tail(&publ->zone_list,
569 /* Round-Robin Algorithm */
570 else if (*destnode == tn->own_addr) {
571 if (list_empty(&info->node_list))
573 publ = list_first_entry(&info->node_list, struct publication,
575 list_move_tail(&publ->node_list, &info->node_list);
576 } else if (in_own_cluster_exact(net, *destnode)) {
577 if (list_empty(&info->cluster_list))
579 publ = list_first_entry(&info->cluster_list, struct publication,
581 list_move_tail(&publ->cluster_list, &info->cluster_list);
583 publ = list_first_entry(&info->zone_list, struct publication,
585 list_move_tail(&publ->zone_list, &info->zone_list);
591 spin_unlock_bh(&seq->lock);
599 * tipc_nametbl_mc_translate - find multicast destinations
601 * Creates list of all local ports that overlap the given multicast address;
602 * also determines if any off-node ports overlap.
604 * Note: Publications with a scope narrower than 'limit' are ignored.
605 * (i.e. local node-scope publications mustn't receive messages arriving
606 * from another node, even if the multcast link brought it here)
608 * Returns non-zero if any off-node ports overlap
610 int tipc_nametbl_mc_translate(struct net *net, u32 type, u32 lower, u32 upper,
611 u32 limit, struct list_head *dports)
613 struct name_seq *seq;
614 struct sub_seq *sseq;
615 struct sub_seq *sseq_stop;
616 struct name_info *info;
620 seq = nametbl_find_seq(net, type);
624 spin_lock_bh(&seq->lock);
625 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower);
626 sseq_stop = seq->sseqs + seq->first_free;
627 for (; sseq != sseq_stop; sseq++) {
628 struct publication *publ;
630 if (sseq->lower > upper)
634 list_for_each_entry(publ, &info->node_list, node_list) {
635 if (publ->scope <= limit)
636 u32_push(dports, publ->ref);
639 if (info->cluster_list_size != info->node_list_size)
642 spin_unlock_bh(&seq->lock);
648 /* tipc_nametbl_lookup_dst_nodes - find broadcast destination nodes
649 * - Creates list of nodes that overlap the given multicast address
650 * - Determines if any node local ports overlap
652 void tipc_nametbl_lookup_dst_nodes(struct net *net, u32 type, u32 lower,
653 u32 upper, u32 domain,
654 struct tipc_nlist *nodes)
656 struct sub_seq *sseq, *stop;
657 struct publication *publ;
658 struct name_info *info;
659 struct name_seq *seq;
662 seq = nametbl_find_seq(net, type);
666 spin_lock_bh(&seq->lock);
667 sseq = seq->sseqs + nameseq_locate_subseq(seq, lower);
668 stop = seq->sseqs + seq->first_free;
669 for (; sseq->lower <= upper && sseq != stop; sseq++) {
671 list_for_each_entry(publ, &info->zone_list, zone_list) {
672 if (tipc_in_scope(domain, publ->node))
673 tipc_nlist_add(nodes, publ->node);
676 spin_unlock_bh(&seq->lock);
682 * tipc_nametbl_publish - add name publication to network name tables
684 struct publication *tipc_nametbl_publish(struct net *net, u32 type, u32 lower,
685 u32 upper, u32 scope, u32 port_ref,
688 struct publication *publ;
689 struct sk_buff *buf = NULL;
690 struct tipc_net *tn = net_generic(net, tipc_net_id);
692 spin_lock_bh(&tn->nametbl_lock);
693 if (tn->nametbl->local_publ_count >= TIPC_MAX_PUBLICATIONS) {
694 pr_warn("Publication failed, local publication limit reached (%u)\n",
695 TIPC_MAX_PUBLICATIONS);
696 spin_unlock_bh(&tn->nametbl_lock);
700 publ = tipc_nametbl_insert_publ(net, type, lower, upper, scope,
701 tn->own_addr, port_ref, key);
703 tn->nametbl->local_publ_count++;
704 buf = tipc_named_publish(net, publ);
705 /* Any pending external events? */
706 tipc_named_process_backlog(net);
708 spin_unlock_bh(&tn->nametbl_lock);
711 tipc_node_broadcast(net, buf);
716 * tipc_nametbl_withdraw - withdraw name publication from network name tables
718 int tipc_nametbl_withdraw(struct net *net, u32 type, u32 lower, u32 ref,
721 struct publication *publ;
722 struct sk_buff *skb = NULL;
723 struct tipc_net *tn = net_generic(net, tipc_net_id);
725 spin_lock_bh(&tn->nametbl_lock);
726 publ = tipc_nametbl_remove_publ(net, type, lower, tn->own_addr,
729 tn->nametbl->local_publ_count--;
730 skb = tipc_named_withdraw(net, publ);
731 /* Any pending external events? */
732 tipc_named_process_backlog(net);
733 list_del_init(&publ->pport_list);
734 kfree_rcu(publ, rcu);
736 pr_err("Unable to remove local publication\n"
737 "(type=%u, lower=%u, ref=%u, key=%u)\n",
738 type, lower, ref, key);
740 spin_unlock_bh(&tn->nametbl_lock);
743 tipc_node_broadcast(net, skb);
750 * tipc_nametbl_subscribe - add a subscription object to the name table
752 void tipc_nametbl_subscribe(struct tipc_subscription *s)
754 struct tipc_net *tn = net_generic(s->net, tipc_net_id);
755 u32 type = tipc_subscrp_convert_seq_type(s->evt.s.seq.type, s->swap);
756 int index = hash(type);
757 struct name_seq *seq;
758 struct tipc_name_seq ns;
760 spin_lock_bh(&tn->nametbl_lock);
761 seq = nametbl_find_seq(s->net, type);
763 seq = tipc_nameseq_create(type, &tn->nametbl->seq_hlist[index]);
765 spin_lock_bh(&seq->lock);
766 tipc_nameseq_subscribe(seq, s);
767 spin_unlock_bh(&seq->lock);
769 tipc_subscrp_convert_seq(&s->evt.s.seq, s->swap, &ns);
770 pr_warn("Failed to create subscription for {%u,%u,%u}\n",
771 ns.type, ns.lower, ns.upper);
773 spin_unlock_bh(&tn->nametbl_lock);
777 * tipc_nametbl_unsubscribe - remove a subscription object from name table
779 void tipc_nametbl_unsubscribe(struct tipc_subscription *s)
781 struct tipc_net *tn = net_generic(s->net, tipc_net_id);
782 struct name_seq *seq;
783 u32 type = tipc_subscrp_convert_seq_type(s->evt.s.seq.type, s->swap);
785 spin_lock_bh(&tn->nametbl_lock);
786 seq = nametbl_find_seq(s->net, type);
788 spin_lock_bh(&seq->lock);
789 list_del_init(&s->nameseq_list);
790 if (!seq->first_free && list_empty(&seq->subscriptions)) {
791 hlist_del_init_rcu(&seq->ns_list);
793 spin_unlock_bh(&seq->lock);
796 spin_unlock_bh(&seq->lock);
799 spin_unlock_bh(&tn->nametbl_lock);
802 int tipc_nametbl_init(struct net *net)
804 struct tipc_net *tn = net_generic(net, tipc_net_id);
805 struct name_table *tipc_nametbl;
808 tipc_nametbl = kzalloc(sizeof(*tipc_nametbl), GFP_ATOMIC);
812 for (i = 0; i < TIPC_NAMETBL_SIZE; i++)
813 INIT_HLIST_HEAD(&tipc_nametbl->seq_hlist[i]);
815 INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_ZONE_SCOPE]);
816 INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_CLUSTER_SCOPE]);
817 INIT_LIST_HEAD(&tipc_nametbl->publ_list[TIPC_NODE_SCOPE]);
818 tn->nametbl = tipc_nametbl;
819 spin_lock_init(&tn->nametbl_lock);
824 * tipc_purge_publications - remove all publications for a given type
826 * tipc_nametbl_lock must be held when calling this function
828 static void tipc_purge_publications(struct net *net, struct name_seq *seq)
830 struct publication *publ, *safe;
831 struct sub_seq *sseq;
832 struct name_info *info;
834 spin_lock_bh(&seq->lock);
837 list_for_each_entry_safe(publ, safe, &info->zone_list, zone_list) {
838 tipc_nameseq_remove_publ(net, seq, publ->lower, publ->node,
839 publ->ref, publ->key);
840 kfree_rcu(publ, rcu);
842 hlist_del_init_rcu(&seq->ns_list);
844 spin_unlock_bh(&seq->lock);
849 void tipc_nametbl_stop(struct net *net)
852 struct name_seq *seq;
853 struct hlist_head *seq_head;
854 struct tipc_net *tn = net_generic(net, tipc_net_id);
855 struct name_table *tipc_nametbl = tn->nametbl;
857 /* Verify name table is empty and purge any lingering
858 * publications, then release the name table
860 spin_lock_bh(&tn->nametbl_lock);
861 for (i = 0; i < TIPC_NAMETBL_SIZE; i++) {
862 if (hlist_empty(&tipc_nametbl->seq_hlist[i]))
864 seq_head = &tipc_nametbl->seq_hlist[i];
865 hlist_for_each_entry_rcu(seq, seq_head, ns_list) {
866 tipc_purge_publications(net, seq);
869 spin_unlock_bh(&tn->nametbl_lock);
876 static int __tipc_nl_add_nametable_publ(struct tipc_nl_msg *msg,
877 struct name_seq *seq,
878 struct sub_seq *sseq, u32 *last_publ)
881 struct nlattr *attrs;
883 struct publication *p;
886 list_for_each_entry(p, &sseq->info->zone_list, zone_list)
887 if (p->key == *last_publ)
889 if (p->key != *last_publ)
892 p = list_first_entry(&sseq->info->zone_list, struct publication,
896 list_for_each_entry_from(p, &sseq->info->zone_list, zone_list) {
899 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq,
900 &tipc_genl_family, NLM_F_MULTI,
901 TIPC_NL_NAME_TABLE_GET);
905 attrs = nla_nest_start(msg->skb, TIPC_NLA_NAME_TABLE);
909 publ = nla_nest_start(msg->skb, TIPC_NLA_NAME_TABLE_PUBL);
913 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_TYPE, seq->type))
915 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_LOWER, sseq->lower))
917 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_UPPER, sseq->upper))
919 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_SCOPE, p->scope))
921 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_NODE, p->node))
923 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_REF, p->ref))
925 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_KEY, p->key))
928 nla_nest_end(msg->skb, publ);
929 nla_nest_end(msg->skb, attrs);
930 genlmsg_end(msg->skb, hdr);
937 nla_nest_cancel(msg->skb, publ);
939 nla_nest_cancel(msg->skb, attrs);
941 genlmsg_cancel(msg->skb, hdr);
946 static int __tipc_nl_subseq_list(struct tipc_nl_msg *msg, struct name_seq *seq,
947 u32 *last_lower, u32 *last_publ)
949 struct sub_seq *sseq;
950 struct sub_seq *sseq_start;
954 sseq_start = nameseq_find_subseq(seq, *last_lower);
958 sseq_start = seq->sseqs;
961 for (sseq = sseq_start; sseq != &seq->sseqs[seq->first_free]; sseq++) {
962 err = __tipc_nl_add_nametable_publ(msg, seq, sseq, last_publ);
964 *last_lower = sseq->lower;
973 static int tipc_nl_seq_list(struct net *net, struct tipc_nl_msg *msg,
974 u32 *last_type, u32 *last_lower, u32 *last_publ)
976 struct tipc_net *tn = net_generic(net, tipc_net_id);
977 struct hlist_head *seq_head;
978 struct name_seq *seq = NULL;
983 i = hash(*last_type);
987 for (; i < TIPC_NAMETBL_SIZE; i++) {
988 seq_head = &tn->nametbl->seq_hlist[i];
991 seq = nametbl_find_seq(net, *last_type);
995 hlist_for_each_entry_rcu(seq, seq_head, ns_list)
1001 hlist_for_each_entry_from_rcu(seq, ns_list) {
1002 spin_lock_bh(&seq->lock);
1003 err = __tipc_nl_subseq_list(msg, seq, last_lower,
1007 *last_type = seq->type;
1008 spin_unlock_bh(&seq->lock);
1011 spin_unlock_bh(&seq->lock);
1018 int tipc_nl_name_table_dump(struct sk_buff *skb, struct netlink_callback *cb)
1021 int done = cb->args[3];
1022 u32 last_type = cb->args[0];
1023 u32 last_lower = cb->args[1];
1024 u32 last_publ = cb->args[2];
1025 struct net *net = sock_net(skb->sk);
1026 struct tipc_nl_msg msg;
1032 msg.portid = NETLINK_CB(cb->skb).portid;
1033 msg.seq = cb->nlh->nlmsg_seq;
1036 err = tipc_nl_seq_list(net, &msg, &last_type, &last_lower, &last_publ);
1039 } else if (err != -EMSGSIZE) {
1040 /* We never set seq or call nl_dump_check_consistent() this
1041 * means that setting prev_seq here will cause the consistence
1042 * check to fail in the netlink callback handler. Resulting in
1043 * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if
1050 cb->args[0] = last_type;
1051 cb->args[1] = last_lower;
1052 cb->args[2] = last_publ;
1058 bool u32_find(struct list_head *l, u32 value)
1060 struct u32_item *item;
1062 list_for_each_entry(item, l, list) {
1063 if (item->value == value)
1069 bool u32_push(struct list_head *l, u32 value)
1071 struct u32_item *item;
1073 list_for_each_entry(item, l, list) {
1074 if (item->value == value)
1077 item = kmalloc(sizeof(*item), GFP_ATOMIC);
1078 if (unlikely(!item))
1081 item->value = value;
1082 list_add(&item->list, l);
1086 u32 u32_pop(struct list_head *l)
1088 struct u32_item *item;
1093 item = list_first_entry(l, typeof(*item), list);
1094 value = item->value;
1095 list_del(&item->list);
1100 bool u32_del(struct list_head *l, u32 value)
1102 struct u32_item *item, *tmp;
1104 list_for_each_entry_safe(item, tmp, l, list) {
1105 if (item->value != value)
1107 list_del(&item->list);
1114 void u32_list_purge(struct list_head *l)
1116 struct u32_item *item, *tmp;
1118 list_for_each_entry_safe(item, tmp, l, list) {
1119 list_del(&item->list);
1124 int u32_list_len(struct list_head *l)
1126 struct u32_item *item;
1129 list_for_each_entry(item, l, list) {