]>
git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blob - net/tipc/name_table.c
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 tipc_plist
*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 tipc_plist_push(dports
, publ
->ref
);
639 if (info
->cluster_list_size
!= info
->node_list_size
)
642 spin_unlock_bh(&seq
->lock
);
649 * tipc_nametbl_publish - add name publication to network name tables
651 struct publication
*tipc_nametbl_publish(struct net
*net
, u32 type
, u32 lower
,
652 u32 upper
, u32 scope
, u32 port_ref
,
655 struct publication
*publ
;
656 struct sk_buff
*buf
= NULL
;
657 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
659 spin_lock_bh(&tn
->nametbl_lock
);
660 if (tn
->nametbl
->local_publ_count
>= TIPC_MAX_PUBLICATIONS
) {
661 pr_warn("Publication failed, local publication limit reached (%u)\n",
662 TIPC_MAX_PUBLICATIONS
);
663 spin_unlock_bh(&tn
->nametbl_lock
);
667 publ
= tipc_nametbl_insert_publ(net
, type
, lower
, upper
, scope
,
668 tn
->own_addr
, port_ref
, key
);
670 tn
->nametbl
->local_publ_count
++;
671 buf
= tipc_named_publish(net
, publ
);
672 /* Any pending external events? */
673 tipc_named_process_backlog(net
);
675 spin_unlock_bh(&tn
->nametbl_lock
);
678 tipc_node_broadcast(net
, buf
);
683 * tipc_nametbl_withdraw - withdraw name publication from network name tables
685 int tipc_nametbl_withdraw(struct net
*net
, u32 type
, u32 lower
, u32 ref
,
688 struct publication
*publ
;
689 struct sk_buff
*skb
= NULL
;
690 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
692 spin_lock_bh(&tn
->nametbl_lock
);
693 publ
= tipc_nametbl_remove_publ(net
, type
, lower
, tn
->own_addr
,
696 tn
->nametbl
->local_publ_count
--;
697 skb
= tipc_named_withdraw(net
, publ
);
698 /* Any pending external events? */
699 tipc_named_process_backlog(net
);
700 list_del_init(&publ
->pport_list
);
701 kfree_rcu(publ
, rcu
);
703 pr_err("Unable to remove local publication\n"
704 "(type=%u, lower=%u, ref=%u, key=%u)\n",
705 type
, lower
, ref
, key
);
707 spin_unlock_bh(&tn
->nametbl_lock
);
710 tipc_node_broadcast(net
, skb
);
717 * tipc_nametbl_subscribe - add a subscription object to the name table
719 void tipc_nametbl_subscribe(struct tipc_subscription
*s
)
721 struct tipc_net
*tn
= net_generic(s
->net
, tipc_net_id
);
722 u32 type
= tipc_subscrp_convert_seq_type(s
->evt
.s
.seq
.type
, s
->swap
);
723 int index
= hash(type
);
724 struct name_seq
*seq
;
725 struct tipc_name_seq ns
;
727 spin_lock_bh(&tn
->nametbl_lock
);
728 seq
= nametbl_find_seq(s
->net
, type
);
730 seq
= tipc_nameseq_create(type
, &tn
->nametbl
->seq_hlist
[index
]);
732 spin_lock_bh(&seq
->lock
);
733 tipc_nameseq_subscribe(seq
, s
);
734 spin_unlock_bh(&seq
->lock
);
736 tipc_subscrp_convert_seq(&s
->evt
.s
.seq
, s
->swap
, &ns
);
737 pr_warn("Failed to create subscription for {%u,%u,%u}\n",
738 ns
.type
, ns
.lower
, ns
.upper
);
740 spin_unlock_bh(&tn
->nametbl_lock
);
744 * tipc_nametbl_unsubscribe - remove a subscription object from name table
746 void tipc_nametbl_unsubscribe(struct tipc_subscription
*s
)
748 struct tipc_net
*tn
= net_generic(s
->net
, tipc_net_id
);
749 struct name_seq
*seq
;
750 u32 type
= tipc_subscrp_convert_seq_type(s
->evt
.s
.seq
.type
, s
->swap
);
752 spin_lock_bh(&tn
->nametbl_lock
);
753 seq
= nametbl_find_seq(s
->net
, type
);
755 spin_lock_bh(&seq
->lock
);
756 list_del_init(&s
->nameseq_list
);
757 if (!seq
->first_free
&& list_empty(&seq
->subscriptions
)) {
758 hlist_del_init_rcu(&seq
->ns_list
);
760 spin_unlock_bh(&seq
->lock
);
763 spin_unlock_bh(&seq
->lock
);
766 spin_unlock_bh(&tn
->nametbl_lock
);
769 int tipc_nametbl_init(struct net
*net
)
771 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
772 struct name_table
*tipc_nametbl
;
775 tipc_nametbl
= kzalloc(sizeof(*tipc_nametbl
), GFP_ATOMIC
);
779 for (i
= 0; i
< TIPC_NAMETBL_SIZE
; i
++)
780 INIT_HLIST_HEAD(&tipc_nametbl
->seq_hlist
[i
]);
782 INIT_LIST_HEAD(&tipc_nametbl
->publ_list
[TIPC_ZONE_SCOPE
]);
783 INIT_LIST_HEAD(&tipc_nametbl
->publ_list
[TIPC_CLUSTER_SCOPE
]);
784 INIT_LIST_HEAD(&tipc_nametbl
->publ_list
[TIPC_NODE_SCOPE
]);
785 tn
->nametbl
= tipc_nametbl
;
786 spin_lock_init(&tn
->nametbl_lock
);
791 * tipc_purge_publications - remove all publications for a given type
793 * tipc_nametbl_lock must be held when calling this function
795 static void tipc_purge_publications(struct net
*net
, struct name_seq
*seq
)
797 struct publication
*publ
, *safe
;
798 struct sub_seq
*sseq
;
799 struct name_info
*info
;
801 spin_lock_bh(&seq
->lock
);
804 list_for_each_entry_safe(publ
, safe
, &info
->zone_list
, zone_list
) {
805 tipc_nameseq_remove_publ(net
, seq
, publ
->lower
, publ
->node
,
806 publ
->ref
, publ
->key
);
807 kfree_rcu(publ
, rcu
);
809 hlist_del_init_rcu(&seq
->ns_list
);
811 spin_unlock_bh(&seq
->lock
);
816 void tipc_nametbl_stop(struct net
*net
)
819 struct name_seq
*seq
;
820 struct hlist_head
*seq_head
;
821 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
822 struct name_table
*tipc_nametbl
= tn
->nametbl
;
824 /* Verify name table is empty and purge any lingering
825 * publications, then release the name table
827 spin_lock_bh(&tn
->nametbl_lock
);
828 for (i
= 0; i
< TIPC_NAMETBL_SIZE
; i
++) {
829 if (hlist_empty(&tipc_nametbl
->seq_hlist
[i
]))
831 seq_head
= &tipc_nametbl
->seq_hlist
[i
];
832 hlist_for_each_entry_rcu(seq
, seq_head
, ns_list
) {
833 tipc_purge_publications(net
, seq
);
836 spin_unlock_bh(&tn
->nametbl_lock
);
843 static int __tipc_nl_add_nametable_publ(struct tipc_nl_msg
*msg
,
844 struct name_seq
*seq
,
845 struct sub_seq
*sseq
, u32
*last_publ
)
848 struct nlattr
*attrs
;
850 struct publication
*p
;
853 list_for_each_entry(p
, &sseq
->info
->zone_list
, zone_list
)
854 if (p
->key
== *last_publ
)
856 if (p
->key
!= *last_publ
)
859 p
= list_first_entry(&sseq
->info
->zone_list
, struct publication
,
863 list_for_each_entry_from(p
, &sseq
->info
->zone_list
, zone_list
) {
866 hdr
= genlmsg_put(msg
->skb
, msg
->portid
, msg
->seq
,
867 &tipc_genl_family
, NLM_F_MULTI
,
868 TIPC_NL_NAME_TABLE_GET
);
872 attrs
= nla_nest_start(msg
->skb
, TIPC_NLA_NAME_TABLE
);
876 publ
= nla_nest_start(msg
->skb
, TIPC_NLA_NAME_TABLE_PUBL
);
880 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_TYPE
, seq
->type
))
882 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_LOWER
, sseq
->lower
))
884 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_UPPER
, sseq
->upper
))
886 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_SCOPE
, p
->scope
))
888 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_NODE
, p
->node
))
890 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_REF
, p
->ref
))
892 if (nla_put_u32(msg
->skb
, TIPC_NLA_PUBL_KEY
, p
->key
))
895 nla_nest_end(msg
->skb
, publ
);
896 nla_nest_end(msg
->skb
, attrs
);
897 genlmsg_end(msg
->skb
, hdr
);
904 nla_nest_cancel(msg
->skb
, publ
);
906 nla_nest_cancel(msg
->skb
, attrs
);
908 genlmsg_cancel(msg
->skb
, hdr
);
913 static int __tipc_nl_subseq_list(struct tipc_nl_msg
*msg
, struct name_seq
*seq
,
914 u32
*last_lower
, u32
*last_publ
)
916 struct sub_seq
*sseq
;
917 struct sub_seq
*sseq_start
;
921 sseq_start
= nameseq_find_subseq(seq
, *last_lower
);
925 sseq_start
= seq
->sseqs
;
928 for (sseq
= sseq_start
; sseq
!= &seq
->sseqs
[seq
->first_free
]; sseq
++) {
929 err
= __tipc_nl_add_nametable_publ(msg
, seq
, sseq
, last_publ
);
931 *last_lower
= sseq
->lower
;
940 static int tipc_nl_seq_list(struct net
*net
, struct tipc_nl_msg
*msg
,
941 u32
*last_type
, u32
*last_lower
, u32
*last_publ
)
943 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
944 struct hlist_head
*seq_head
;
945 struct name_seq
*seq
= NULL
;
950 i
= hash(*last_type
);
954 for (; i
< TIPC_NAMETBL_SIZE
; i
++) {
955 seq_head
= &tn
->nametbl
->seq_hlist
[i
];
958 seq
= nametbl_find_seq(net
, *last_type
);
962 hlist_for_each_entry_rcu(seq
, seq_head
, ns_list
)
968 hlist_for_each_entry_from_rcu(seq
, ns_list
) {
969 spin_lock_bh(&seq
->lock
);
970 err
= __tipc_nl_subseq_list(msg
, seq
, last_lower
,
974 *last_type
= seq
->type
;
975 spin_unlock_bh(&seq
->lock
);
978 spin_unlock_bh(&seq
->lock
);
985 int tipc_nl_name_table_dump(struct sk_buff
*skb
, struct netlink_callback
*cb
)
988 int done
= cb
->args
[3];
989 u32 last_type
= cb
->args
[0];
990 u32 last_lower
= cb
->args
[1];
991 u32 last_publ
= cb
->args
[2];
992 struct net
*net
= sock_net(skb
->sk
);
993 struct tipc_nl_msg msg
;
999 msg
.portid
= NETLINK_CB(cb
->skb
).portid
;
1000 msg
.seq
= cb
->nlh
->nlmsg_seq
;
1003 err
= tipc_nl_seq_list(net
, &msg
, &last_type
, &last_lower
, &last_publ
);
1006 } else if (err
!= -EMSGSIZE
) {
1007 /* We never set seq or call nl_dump_check_consistent() this
1008 * means that setting prev_seq here will cause the consistence
1009 * check to fail in the netlink callback handler. Resulting in
1010 * the NLMSG_DONE message having the NLM_F_DUMP_INTR flag set if
1017 cb
->args
[0] = last_type
;
1018 cb
->args
[1] = last_lower
;
1019 cb
->args
[2] = last_publ
;
1025 void tipc_plist_push(struct tipc_plist
*pl
, u32 port
)
1027 struct tipc_plist
*nl
;
1029 if (likely(!pl
->port
)) {
1033 if (pl
->port
== port
)
1035 list_for_each_entry(nl
, &pl
->list
, list
) {
1036 if (nl
->port
== port
)
1039 nl
= kmalloc(sizeof(*nl
), GFP_ATOMIC
);
1042 list_add(&nl
->list
, &pl
->list
);
1046 u32
tipc_plist_pop(struct tipc_plist
*pl
)
1048 struct tipc_plist
*nl
;
1051 if (likely(list_empty(&pl
->list
))) {
1056 nl
= list_first_entry(&pl
->list
, typeof(*nl
), list
);
1058 list_del(&nl
->list
);