Lines Matching defs:pool
28 * walk all datasets in the pool, and construct a directed graph of the form:
40 * In order to construct this graph, we have to walk every dataset in the pool,
253 * datasets in the pool.
531 * Otherwise, start at the root of the pool and iterate over all datasets.
545 * Determine pool name and try again.
548 char *pool = zfs_alloc(hdl, len);
550 if (pool == NULL) {
554 (void) strlcpy(pool, dataset, len);
556 if (iterate_children(hdl, zgp, pool) == -1 ||
557 zfs_graph_add(hdl, zgp, pool, NULL, 0) != 0) {
558 free(pool);
562 free(pool);