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.
26 #pragma ident "%Z%%M% %I% %E% SMI"
38 #include "zpool_util.h"
41 * Private interface for iterating over pools specified on the command line.
42 * Most consumers will call for_each_pool, but in order to support iostat, we
43 * allow fined grained control through the zpool_list_t interface.
46 typedef struct zpool_node {
47 zpool_handle_t *zn_handle;
48 uu_avl_node_t zn_avlnode;
55 uu_avl_pool_t *zl_pool;
56 zprop_list_t **zl_proplist;
61 zpool_compare(const void *larg, const void *rarg, void *unused)
63 zpool_handle_t *l = ((zpool_node_t *)larg)->zn_handle;
64 zpool_handle_t *r = ((zpool_node_t *)rarg)->zn_handle;
65 const char *lname = zpool_get_name(l);
66 const char *rname = zpool_get_name(r);
68 return (strcmp(lname, rname));
72 * Callback function for pool_list_get(). Adds the given pool to the AVL tree
76 add_pool(zpool_handle_t *zhp, void *data)
78 zpool_list_t *zlp = data;
79 zpool_node_t *node = safe_malloc(sizeof (zpool_node_t));
82 node->zn_handle = zhp;
83 uu_avl_node_init(node, &node->zn_avlnode, zlp->zl_pool);
84 if (uu_avl_find(zlp->zl_avl, node, NULL, &idx) == NULL) {
85 if (zlp->zl_proplist &&
86 zpool_expand_proplist(zhp, zlp->zl_proplist) != 0) {
91 uu_avl_insert(zlp->zl_avl, node, idx);
102 * Create a list of pools based on the given arguments. If we're given no
103 * arguments, then iterate over all pools in the system and add them to the AVL
104 * tree. Otherwise, add only those pool explicitly specified on the command
108 pool_list_get(int argc, char **argv, zprop_list_t **proplist, int *err)
112 zlp = safe_malloc(sizeof (zpool_list_t));
114 zlp->zl_pool = uu_avl_pool_create("zfs_pool", sizeof (zpool_node_t),
115 offsetof(zpool_node_t, zn_avlnode), zpool_compare, UU_DEFAULT);
117 if (zlp->zl_pool == NULL)
120 if ((zlp->zl_avl = uu_avl_create(zlp->zl_pool, NULL,
121 UU_DEFAULT)) == NULL)
124 zlp->zl_proplist = proplist;
127 (void) zpool_iter(g_zfs, add_pool, zlp);
128 zlp->zl_findall = B_TRUE;
132 for (i = 0; i < argc; i++) {
135 if (zhp = zpool_open_canfail(g_zfs, argv[i])) {
136 if (add_pool(zhp, zlp) != 0)
148 * Search for any new pools, adding them to the list. We only add pools when no
149 * options were given on the command line. Otherwise, we keep the list fixed as
150 * those that were explicitly specified.
153 pool_list_update(zpool_list_t *zlp)
156 (void) zpool_iter(g_zfs, add_pool, zlp);
160 * Iterate over all pools in the list, executing the callback for each
163 pool_list_iter(zpool_list_t *zlp, int unavail, zpool_iter_f func,
166 zpool_node_t *node, *next_node;
169 for (node = uu_avl_first(zlp->zl_avl); node != NULL; node = next_node) {
170 next_node = uu_avl_next(zlp->zl_avl, node);
171 if (zpool_get_state(node->zn_handle) != POOL_STATE_UNAVAIL ||
173 ret |= func(node->zn_handle, data);
180 * Remove the given pool from the list. When running iostat, we want to remove
181 * those pools that no longer exist.
184 pool_list_remove(zpool_list_t *zlp, zpool_handle_t *zhp)
186 zpool_node_t search, *node;
188 search.zn_handle = zhp;
189 if ((node = uu_avl_find(zlp->zl_avl, &search, NULL, NULL)) != NULL) {
190 uu_avl_remove(zlp->zl_avl, node);
191 zpool_close(node->zn_handle);
197 * Free all the handles associated with this list.
200 pool_list_free(zpool_list_t *zlp)
205 if ((walk = uu_avl_walk_start(zlp->zl_avl, UU_WALK_ROBUST)) == NULL) {
206 (void) fprintf(stderr,
207 gettext("internal error: out of memory"));
211 while ((node = uu_avl_walk_next(walk)) != NULL) {
212 uu_avl_remove(zlp->zl_avl, node);
213 zpool_close(node->zn_handle);
217 uu_avl_walk_end(walk);
218 uu_avl_destroy(zlp->zl_avl);
219 uu_avl_pool_destroy(zlp->zl_pool);
225 * Returns the number of elements in the pool list.
228 pool_list_count(zpool_list_t *zlp)
230 return (uu_avl_numnodes(zlp->zl_avl));
234 * High level function which iterates over all pools given on the command line,
235 * using the pool_list_* interfaces.
238 for_each_pool(int argc, char **argv, boolean_t unavail,
239 zprop_list_t **proplist, zpool_iter_f func, void *data)
244 if ((list = pool_list_get(argc, argv, proplist, &ret)) == NULL)
247 if (pool_list_iter(list, unavail, func, data) != 0)
250 pool_list_free(list);