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]
23 * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Copyright (c) 2012 Pawel Jakub Dawidek <pawel@dawidek.net>.
25 * Copyright 2013 Nexenta Systems, Inc. All rights reserved.
41 * This is a private interface used to gather up all the datasets specified on
42 * the command line so that we can iterate over them in order.
44 * First, we iterate over all filesystems, gathering them together into an
45 * AVL tree. We report errors for any explicitly specified datasets
46 * that we couldn't open.
48 * When finished, we have an AVL tree of ZFS handles. We go through and execute
49 * the provided callback for each one, passing whatever data the user supplied.
52 typedef struct zfs_node
{
53 zfs_handle_t
*zn_handle
;
54 uu_avl_node_t zn_avlnode
;
57 typedef struct callback_data
{
61 zfs_sort_column_t
*cb_sortcol
;
62 zprop_list_t
**cb_proplist
;
65 uint8_t cb_props_table
[ZFS_NUM_PROPS
];
68 uu_avl_pool_t
*avl_pool
;
71 * Include snaps if they were requested or if this a zfs list where types
72 * were not specified and the "listsnapshots" property is set on this pool.
75 zfs_include_snapshots(zfs_handle_t
*zhp
, callback_data_t
*cb
)
79 if ((cb
->cb_flags
& ZFS_ITER_PROP_LISTSNAPS
) == 0)
80 return (cb
->cb_types
& ZFS_TYPE_SNAPSHOT
);
82 zph
= zfs_get_pool_handle(zhp
);
83 return (zpool_get_prop_int(zph
, ZPOOL_PROP_LISTSNAPS
, NULL
));
87 * Called for each dataset. If the object is of an appropriate type,
88 * add it to the avl tree and recurse over any children as necessary.
91 zfs_callback(zfs_handle_t
*zhp
, void *data
)
93 callback_data_t
*cb
= data
;
95 int include_snaps
= zfs_include_snapshots(zhp
, cb
);
97 if ((zfs_get_type(zhp
) & cb
->cb_types
) ||
98 ((zfs_get_type(zhp
) == ZFS_TYPE_SNAPSHOT
) && include_snaps
)) {
100 zfs_node_t
*node
= safe_malloc(sizeof (zfs_node_t
));
102 node
->zn_handle
= zhp
;
103 uu_avl_node_init(node
, &node
->zn_avlnode
, avl_pool
);
104 if (uu_avl_find(cb
->cb_avl
, node
, cb
->cb_sortcol
,
106 if (cb
->cb_proplist
) {
107 if ((*cb
->cb_proplist
) &&
108 !(*cb
->cb_proplist
)->pl_all
)
109 zfs_prune_proplist(zhp
,
112 if (zfs_expand_proplist(zhp
, cb
->cb_proplist
,
113 (cb
->cb_flags
& ZFS_ITER_RECVD_PROPS
),
114 (cb
->cb_flags
& ZFS_ITER_LITERAL_PROPS
))
120 uu_avl_insert(cb
->cb_avl
, node
, idx
);
128 * Recurse if necessary.
130 if (cb
->cb_flags
& ZFS_ITER_RECURSE
&&
131 ((cb
->cb_flags
& ZFS_ITER_DEPTH_LIMIT
) == 0 ||
132 cb
->cb_depth
< cb
->cb_depth_limit
)) {
134 if (zfs_get_type(zhp
) == ZFS_TYPE_FILESYSTEM
)
135 (void) zfs_iter_filesystems(zhp
, zfs_callback
, data
);
136 if ((zfs_get_type(zhp
) != ZFS_TYPE_SNAPSHOT
) && include_snaps
) {
137 (void) zfs_iter_snapshots(zhp
,
138 (cb
->cb_flags
& ZFS_ITER_SIMPLE
) != 0, zfs_callback
,
151 zfs_add_sort_column(zfs_sort_column_t
**sc
, const char *name
,
154 zfs_sort_column_t
*col
;
157 if ((prop
= zfs_name_to_prop(name
)) == ZPROP_INVAL
&&
158 !zfs_prop_user(name
))
161 col
= safe_malloc(sizeof (zfs_sort_column_t
));
164 col
->sc_reverse
= reverse
;
165 if (prop
== ZPROP_INVAL
) {
166 col
->sc_user_prop
= safe_malloc(strlen(name
) + 1);
167 (void) strcpy(col
->sc_user_prop
, name
);
174 (*sc
)->sc_last
->sc_next
= col
;
175 (*sc
)->sc_last
= col
;
182 zfs_free_sort_columns(zfs_sort_column_t
*sc
)
184 zfs_sort_column_t
*col
;
188 free(sc
->sc_user_prop
);
195 zfs_sort_only_by_name(const zfs_sort_column_t
*sc
)
197 return (sc
!= NULL
&& sc
->sc_next
== NULL
&&
198 sc
->sc_prop
== ZFS_PROP_NAME
);
203 zfs_compare(const void *larg
, const void *rarg
, void *unused
)
205 zfs_handle_t
*l
= ((zfs_node_t
*)larg
)->zn_handle
;
206 zfs_handle_t
*r
= ((zfs_node_t
*)rarg
)->zn_handle
;
207 const char *lname
= zfs_get_name(l
);
208 const char *rname
= zfs_get_name(r
);
210 uint64_t lcreate
, rcreate
;
213 lat
= (char *)strchr(lname
, '@');
214 rat
= (char *)strchr(rname
, '@');
221 ret
= strcmp(lname
, rname
);
224 * If we're comparing a dataset to one of its snapshots, we
225 * always make the full dataset first.
229 } else if (rat
== NULL
) {
233 * If we have two snapshots from the same dataset, then
234 * we want to sort them according to creation time. We
235 * use the hidden CREATETXG property to get an absolute
236 * ordering of snapshots.
238 lcreate
= zfs_prop_get_int(l
, ZFS_PROP_CREATETXG
);
239 rcreate
= zfs_prop_get_int(r
, ZFS_PROP_CREATETXG
);
242 * Both lcreate and rcreate being 0 means we don't have
243 * properties and we should compare full name.
245 if (lcreate
== 0 && rcreate
== 0)
246 ret
= strcmp(lat
+ 1, rat
+ 1);
247 else if (lcreate
< rcreate
)
249 else if (lcreate
> rcreate
)
263 * Sort datasets by specified columns.
265 * o Numeric types sort in ascending order.
266 * o String types sort in alphabetical order.
267 * o Types inappropriate for a row sort that row to the literal
268 * bottom, regardless of the specified ordering.
270 * If no sort columns are specified, or two datasets compare equally
271 * across all specified columns, they are sorted alphabetically by name
272 * with snapshots grouped under their parents.
275 zfs_sort(const void *larg
, const void *rarg
, void *data
)
277 zfs_handle_t
*l
= ((zfs_node_t
*)larg
)->zn_handle
;
278 zfs_handle_t
*r
= ((zfs_node_t
*)rarg
)->zn_handle
;
279 zfs_sort_column_t
*sc
= (zfs_sort_column_t
*)data
;
280 zfs_sort_column_t
*psc
;
282 for (psc
= sc
; psc
!= NULL
; psc
= psc
->sc_next
) {
283 char lbuf
[ZFS_MAXPROPLEN
], rbuf
[ZFS_MAXPROPLEN
];
286 boolean_t lvalid
, rvalid
;
290 * We group the checks below the generic code. If 'lstr' and
291 * 'rstr' are non-NULL, then we do a string based comparison.
292 * Otherwise, we compare 'lnum' and 'rnum'.
295 if (psc
->sc_prop
== ZPROP_INVAL
) {
296 nvlist_t
*luser
, *ruser
;
297 nvlist_t
*lval
, *rval
;
299 luser
= zfs_get_user_props(l
);
300 ruser
= zfs_get_user_props(r
);
302 lvalid
= (nvlist_lookup_nvlist(luser
,
303 psc
->sc_user_prop
, &lval
) == 0);
304 rvalid
= (nvlist_lookup_nvlist(ruser
,
305 psc
->sc_user_prop
, &rval
) == 0);
308 verify(nvlist_lookup_string(lval
,
309 ZPROP_VALUE
, &lstr
) == 0);
311 verify(nvlist_lookup_string(rval
,
312 ZPROP_VALUE
, &rstr
) == 0);
313 } else if (psc
->sc_prop
== ZFS_PROP_NAME
) {
314 lvalid
= rvalid
= B_TRUE
;
316 (void) strlcpy(lbuf
, zfs_get_name(l
), sizeof (lbuf
));
317 (void) strlcpy(rbuf
, zfs_get_name(r
), sizeof (rbuf
));
321 } else if (zfs_prop_is_string(psc
->sc_prop
)) {
322 lvalid
= (zfs_prop_get(l
, psc
->sc_prop
, lbuf
,
323 sizeof (lbuf
), NULL
, NULL
, 0, B_TRUE
) == 0);
324 rvalid
= (zfs_prop_get(r
, psc
->sc_prop
, rbuf
,
325 sizeof (rbuf
), NULL
, NULL
, 0, B_TRUE
) == 0);
330 lvalid
= zfs_prop_valid_for_type(psc
->sc_prop
,
331 zfs_get_type(l
), B_FALSE
);
332 rvalid
= zfs_prop_valid_for_type(psc
->sc_prop
,
333 zfs_get_type(r
), B_FALSE
);
336 (void) zfs_prop_get_numeric(l
, psc
->sc_prop
,
337 &lnum
, NULL
, NULL
, 0);
339 (void) zfs_prop_get_numeric(r
, psc
->sc_prop
,
340 &rnum
, NULL
, NULL
, 0);
343 if (!lvalid
&& !rvalid
)
351 ret
= strcmp(lstr
, rstr
);
352 else if (lnum
< rnum
)
354 else if (lnum
> rnum
)
358 if (psc
->sc_reverse
== B_TRUE
)
359 ret
= (ret
< 0) ? 1 : -1;
364 return (zfs_compare(larg
, rarg
, NULL
));
368 zfs_for_each(int argc
, char **argv
, int flags
, zfs_type_t types
,
369 zfs_sort_column_t
*sortcol
, zprop_list_t
**proplist
, int limit
,
370 zfs_iter_f callback
, void *data
)
372 callback_data_t cb
= {0};
377 avl_pool
= uu_avl_pool_create("zfs_pool", sizeof (zfs_node_t
),
378 offsetof(zfs_node_t
, zn_avlnode
), zfs_sort
, UU_DEFAULT
);
380 if (avl_pool
== NULL
)
383 cb
.cb_sortcol
= sortcol
;
385 cb
.cb_proplist
= proplist
;
387 cb
.cb_depth_limit
= limit
;
389 * If cb_proplist is provided then in the zfs_handles created we
390 * retain only those properties listed in cb_proplist and sortcol.
391 * The rest are pruned. So, the caller should make sure that no other
392 * properties other than those listed in cb_proplist/sortcol are
395 * If cb_proplist is NULL then we retain all the properties. We
396 * always retain the zoned property, which some other properties
397 * need (userquota & friends), and the createtxg property, which
398 * we need to sort snapshots.
400 if (cb
.cb_proplist
&& *cb
.cb_proplist
) {
401 zprop_list_t
*p
= *cb
.cb_proplist
;
404 if (p
->pl_prop
>= ZFS_PROP_TYPE
&&
405 p
->pl_prop
< ZFS_NUM_PROPS
) {
406 cb
.cb_props_table
[p
->pl_prop
] = B_TRUE
;
412 if (sortcol
->sc_prop
>= ZFS_PROP_TYPE
&&
413 sortcol
->sc_prop
< ZFS_NUM_PROPS
) {
414 cb
.cb_props_table
[sortcol
->sc_prop
] = B_TRUE
;
416 sortcol
= sortcol
->sc_next
;
419 cb
.cb_props_table
[ZFS_PROP_ZONED
] = B_TRUE
;
420 cb
.cb_props_table
[ZFS_PROP_CREATETXG
] = B_TRUE
;
422 (void) memset(cb
.cb_props_table
, B_TRUE
,
423 sizeof (cb
.cb_props_table
));
426 if ((cb
.cb_avl
= uu_avl_create(avl_pool
, NULL
, UU_DEFAULT
)) == NULL
)
431 * If given no arguments, iterate over all datasets.
433 cb
.cb_flags
|= ZFS_ITER_RECURSE
;
434 ret
= zfs_iter_root(g_zfs
, zfs_callback
, &cb
);
441 * If we're recursive, then we always allow filesystems as
442 * arguments. If we also are interested in snapshots, then we
443 * can take volumes as well.
446 if (flags
& ZFS_ITER_RECURSE
) {
447 argtype
|= ZFS_TYPE_FILESYSTEM
;
448 if (types
& ZFS_TYPE_SNAPSHOT
)
449 argtype
|= ZFS_TYPE_VOLUME
;
452 for (i
= 0; i
< argc
; i
++) {
453 if (flags
& ZFS_ITER_ARGS_CAN_BE_PATHS
) {
454 zhp
= zfs_path_to_zhandle(g_zfs
, argv
[i
],
457 zhp
= zfs_open(g_zfs
, argv
[i
], argtype
);
460 ret
|= zfs_callback(zhp
, &cb
);
467 * At this point we've got our AVL tree full of zfs handles, so iterate
468 * over each one and execute the real user callback.
470 for (node
= uu_avl_first(cb
.cb_avl
); node
!= NULL
;
471 node
= uu_avl_next(cb
.cb_avl
, node
))
472 ret
|= callback(node
->zn_handle
, data
);
475 * Finally, clean up the AVL tree.
477 if ((walk
= uu_avl_walk_start(cb
.cb_avl
, UU_WALK_ROBUST
)) == NULL
)
480 while ((node
= uu_avl_walk_next(walk
)) != NULL
) {
481 uu_avl_remove(cb
.cb_avl
, node
);
482 zfs_close(node
->zn_handle
);
486 uu_avl_walk_end(walk
);
487 uu_avl_destroy(cb
.cb_avl
);
488 uu_avl_pool_destroy(avl_pool
);