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;
60 zpool_compare(const void *larg, const void *rarg, void *unused)
62 zpool_handle_t *l = ((zpool_node_t *)larg)->zn_handle;
63 zpool_handle_t *r = ((zpool_node_t *)rarg)->zn_handle;
64 const char *lname = zpool_get_name(l);
65 const char *rname = zpool_get_name(r);
67 return (strcmp(lname, rname));
71 * Callback function for pool_list_get(). Adds the given pool to the AVL tree
75 add_pool(zpool_handle_t *zhp, void *data)
77 zpool_list_t *zlp = data;
78 zpool_node_t *node = safe_malloc(sizeof (zpool_node_t));
81 node->zn_handle = zhp;
82 uu_avl_node_init(node, &node->zn_avlnode, zlp->zl_pool);
83 if (uu_avl_find(zlp->zl_avl, node, NULL, &idx) == NULL) {
84 uu_avl_insert(zlp->zl_avl, node, idx);
95 * Create a list of pools based on the given arguments. If we're given no
96 * arguments, then iterate over all pools in the system and add them to the AVL
97 * tree. Otherwise, add only those pool explicitly specified on the command
101 pool_list_get(int argc, char **argv, zpool_proplist_t **proplist, int *err)
105 zlp = safe_malloc(sizeof (zpool_list_t));
107 zlp->zl_pool = uu_avl_pool_create("zfs_pool", sizeof (zpool_node_t),
108 offsetof(zpool_node_t, zn_avlnode), zpool_compare, UU_DEFAULT);
110 if (zlp->zl_pool == NULL)
113 if ((zlp->zl_avl = uu_avl_create(zlp->zl_pool, NULL,
114 UU_DEFAULT)) == NULL)
118 (void) zpool_iter(g_zfs, add_pool, zlp);
119 zlp->zl_findall = B_TRUE;
123 for (i = 0; i < argc; i++) {
126 if ((zhp = zpool_open_canfail(g_zfs,
127 argv[i])) != NULL && add_pool(zhp, zlp) == 0) {
129 zpool_expand_proplist(zhp, proplist) != 0)
140 * Search for any new pools, adding them to the list. We only add pools when no
141 * options were given on the command line. Otherwise, we keep the list fixed as
142 * those that were explicitly specified.
145 pool_list_update(zpool_list_t *zlp)
148 (void) zpool_iter(g_zfs, add_pool, zlp);
152 * Iterate over all pools in the list, executing the callback for each
155 pool_list_iter(zpool_list_t *zlp, int unavail, zpool_iter_f func,
158 zpool_node_t *node, *next_node;
161 for (node = uu_avl_first(zlp->zl_avl); node != NULL; node = next_node) {
162 next_node = uu_avl_next(zlp->zl_avl, node);
163 if (zpool_get_state(node->zn_handle) != POOL_STATE_UNAVAIL ||
165 ret |= func(node->zn_handle, data);
172 * Remove the given pool from the list. When running iostat, we want to remove
173 * those pools that no longer exist.
176 pool_list_remove(zpool_list_t *zlp, zpool_handle_t *zhp)
178 zpool_node_t search, *node;
180 search.zn_handle = zhp;
181 if ((node = uu_avl_find(zlp->zl_avl, &search, NULL, NULL)) != NULL) {
182 uu_avl_remove(zlp->zl_avl, node);
183 zpool_close(node->zn_handle);
189 * Free all the handles associated with this list.
192 pool_list_free(zpool_list_t *zlp)
197 if ((walk = uu_avl_walk_start(zlp->zl_avl, UU_WALK_ROBUST)) == NULL) {
198 (void) fprintf(stderr,
199 gettext("internal error: out of memory"));
203 while ((node = uu_avl_walk_next(walk)) != NULL) {
204 uu_avl_remove(zlp->zl_avl, node);
205 zpool_close(node->zn_handle);
209 uu_avl_walk_end(walk);
210 uu_avl_destroy(zlp->zl_avl);
211 uu_avl_pool_destroy(zlp->zl_pool);
217 * Returns the number of elements in the pool list.
220 pool_list_count(zpool_list_t *zlp)
222 return (uu_avl_numnodes(zlp->zl_avl));
226 * High level function which iterates over all pools given on the command line,
227 * using the pool_list_* interfaces.
230 for_each_pool(int argc, char **argv, boolean_t unavail,
231 zpool_proplist_t **proplist, zpool_iter_f func, void *data)
236 if ((list = pool_list_get(argc, argv, proplist, &ret)) == NULL)
239 if (pool_list_iter(list, unavail, func, data) != 0)
242 pool_list_free(list);