]>
git.proxmox.com Git - mirror_zfs.git/blob - zfs/lib/libzcommon/list.c
4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License (the "License").
6 * You may not use this file except in compliance with the License.
8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 * or http://www.opensolaris.org/os/licensing.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
22 * Copyright 2007 Sun Microsystems, Inc. All rights reserved.
23 * Use is subject to license terms.
29 * Generic doubly-linked list implementation
33 #include <sys/list_impl.h>
34 #include <sys/types.h>
35 #include <sys/sysmacros.h>
36 #include <sys/debug.h>
38 #define list_d2l(a, obj) ((list_node_t *)(((char *)obj) + (a)->list_offset))
39 #define list_object(a, node) ((void *)(((char *)node) - (a)->list_offset))
40 #define list_empty(a) ((a)->list_head.list_next == &(a)->list_head)
42 #define list_insert_after_node(list, node, object) { \
43 list_node_t *lnew = list_d2l(list, object); \
44 lnew->list_prev = node; \
45 lnew->list_next = node->list_next; \
46 node->list_next->list_prev = lnew; \
47 node->list_next = lnew; \
50 #define list_insert_before_node(list, node, object) { \
51 list_node_t *lnew = list_d2l(list, object); \
52 lnew->list_next = node; \
53 lnew->list_prev = node->list_prev; \
54 node->list_prev->list_next = lnew; \
55 node->list_prev = lnew; \
59 list_create(list_t
*list
, size_t size
, size_t offset
)
63 ASSERT(size
>= offset
+ sizeof (list_node_t
));
65 list
->list_size
= size
;
66 list
->list_offset
= offset
;
67 list
->list_head
.list_next
= list
->list_head
.list_prev
=
72 list_destroy(list_t
*list
)
74 list_node_t
*node
= &list
->list_head
;
77 ASSERT(list
->list_head
.list_next
== node
);
78 ASSERT(list
->list_head
.list_prev
== node
);
80 node
->list_next
= node
->list_prev
= NULL
;
84 list_insert_after(list_t
*list
, void *object
, void *nobject
)
86 list_node_t
*lold
= list_d2l(list
, object
);
87 list_insert_after_node(list
, lold
, nobject
);
91 list_insert_before(list_t
*list
, void *object
, void *nobject
)
93 list_node_t
*lold
= list_d2l(list
, object
);
94 list_insert_before_node(list
, lold
, nobject
)
98 list_insert_head(list_t
*list
, void *object
)
100 list_node_t
*lold
= &list
->list_head
;
101 list_insert_after_node(list
, lold
, object
);
105 list_insert_tail(list_t
*list
, void *object
)
107 list_node_t
*lold
= &list
->list_head
;
108 list_insert_before_node(list
, lold
, object
);
112 list_remove(list_t
*list
, void *object
)
114 list_node_t
*lold
= list_d2l(list
, object
);
115 ASSERT(!list_empty(list
));
116 ASSERT(lold
->list_next
!= NULL
);
117 lold
->list_prev
->list_next
= lold
->list_next
;
118 lold
->list_next
->list_prev
= lold
->list_prev
;
119 lold
->list_next
= lold
->list_prev
= NULL
;
123 list_head(list_t
*list
)
125 if (list_empty(list
))
127 return (list_object(list
, list
->list_head
.list_next
));
131 list_tail(list_t
*list
)
133 if (list_empty(list
))
135 return (list_object(list
, list
->list_head
.list_prev
));
139 list_next(list_t
*list
, void *object
)
141 list_node_t
*node
= list_d2l(list
, object
);
143 if (node
->list_next
!= &list
->list_head
)
144 return (list_object(list
, node
->list_next
));
150 list_prev(list_t
*list
, void *object
)
152 list_node_t
*node
= list_d2l(list
, object
);
154 if (node
->list_prev
!= &list
->list_head
)
155 return (list_object(list
, node
->list_prev
));
161 * Insert src list after dst list. Empty src list thereafter.
164 list_move_tail(list_t
*dst
, list_t
*src
)
166 list_node_t
*dstnode
= &dst
->list_head
;
167 list_node_t
*srcnode
= &src
->list_head
;
169 ASSERT(dst
->list_size
== src
->list_size
);
170 ASSERT(dst
->list_offset
== src
->list_offset
);
175 dstnode
->list_prev
->list_next
= srcnode
->list_next
;
176 srcnode
->list_next
->list_prev
= dstnode
->list_prev
;
177 dstnode
->list_prev
= srcnode
->list_prev
;
178 srcnode
->list_prev
->list_next
= dstnode
;
181 srcnode
->list_next
= srcnode
->list_prev
= srcnode
;
185 list_link_active(list_node_t
*link
)
187 return (link
->list_next
!= NULL
);
191 list_is_empty(list_t
*list
)
193 return (list_empty(list
));