/*

 * CDDL HEADER START

 *

 * The contents of this file are subject to the terms of the

 * Common Development and Distribution License (the "License").

 * You may not use this file except in compliance with the License.

 *

 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE

 * or http://www.opensolaris.org/os/licensing.

 * See the License for the specific language governing permissions

 * and limitations under the License.

 *

 * When distributing Covered Code, include this CDDL HEADER in each

 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.

 * If applicable, add the following below this CDDL HEADER, with the

 * fields enclosed by brackets "[]" replaced with your own identifying

 * information: Portions Copyright [yyyy] [name of copyright owner]

 *

 * CDDL HEADER END

 */

/*

 * Use is subject to license terms.

 */

#pragma ident	"%Z%%M%	%I%	%E% SMI"

/*

 * Iterate over all children of the current object.  This includes the normal

 * dataset hierarchy, but also arbitrary hierarchies due to clones.  We want to

 * walk all datasets in the pool, and construct a directed graph of the form:

 *

 * 			home

 *                        |

 *                   +----+----+

 *                   |         |

 *                   v         v             ws

 *                  bar       baz             |

 *                             |              |

 *                             v              v

 *                          @yesterday ----> foo

 *

 * In order to construct this graph, we have to walk every dataset in the pool,

 * because the clone parent is stored as a property of the child, not the

 * parent.  The parent only keeps track of the number of clones.

 *

 * In the normal case (without clones) this would be rather expensive.  To avoid

 * unnecessary computation, we first try a walk of the subtree hierarchy

 * starting from the initial node.  At each dataset, we construct a node in the

 * graph and an edge leading from its parent.  If we don't see any snapshots

 * with a non-zero clone count, then we are finished.

 *

 * If we do find a cloned snapshot, then we finish the walk of the current

 * subtree, but indicate that we need to do a complete walk.  We then perform a

 * global walk of all datasets, avoiding the subtree we already processed.

 *

 * At the end of this, we'll end up with a directed graph of all relevant (and

 * possible some irrelevant) datasets in the system.  We need to both find our

 * limiting subgraph and determine a safe ordering in which to destroy the

 * datasets.  We do a topological ordering of our graph starting at our target

 * dataset, and then walk the results in reverse.

 *

 * It's possible for the graph to have cycles if, for example, the user renames

 * a clone to be the parent of its origin snapshot.  The user can request to

 * generate an error in this case, or ignore the cycle and continue.

 *

 * When removing datasets, we want to destroy the snapshots in chronological

 * order (because this is the most efficient method).  In order to accomplish

 * this, we store the creation transaction group with each vertex and keep each

 * vertex's edges sorted according to this value.  The topological sort will

 * automatically walk the snapshots in the correct order.

 */

#include <assert.h>

#include <libintl.h>

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <strings.h>

#include <unistd.h>

#include <libzfs.h>

#include "libzfs_impl.h"

#include "zfs_namecheck.h"

#define	MIN_EDGECOUNT	4

/*

 * Vertex structure.  Indexed by dataset name, this structure maintains a list

 * of edges to other vertices.

 */

struct zfs_edge;

typedef struct zfs_vertex {

	char			zv_dataset[ZFS_MAXNAMELEN];

	struct zfs_vertex	*zv_next;

	int			zv_visited;

	uint64_t		zv_txg;

	struct zfs_edge		**zv_edges;

	int			zv_edgecount;

	int			zv_edgealloc;

} zfs_vertex_t;

enum {

	VISIT_SEEN = 1,

	VISIT_SORT_PRE,

	VISIT_SORT_POST

};

/*

 * Edge structure.  Simply maintains a pointer to the destination vertex.  There

 * is no need to store the source vertex, since we only use edges in the context

 * of the source vertex.

 */

typedef struct zfs_edge {

	zfs_vertex_t		*ze_dest;

	struct zfs_edge		*ze_next;

} zfs_edge_t;

#define	ZFS_GRAPH_SIZE		1027	/* this could be dynamic some day */

/*

 * Graph structure.  Vertices are maintained in a hash indexed by dataset name.

 */

typedef struct zfs_graph {

	zfs_vertex_t		**zg_hash;

	size_t			zg_size;

	size_t			zg_nvertex;

} zfs_graph_t;

/*

 * Allocate a new edge pointing to the target vertex.

 */

static zfs_edge_t *

zfs_edge_create(libzfs_handle_t *hdl, zfs_vertex_t *dest)

{

	zfs_edge_t *zep = zfs_alloc(hdl, sizeof (zfs_edge_t));

	if (zep == NULL)

		return (NULL);

	zep->ze_dest = dest;

	return (zep);

}

/*

 * Destroy an edge.

 */

static void

zfs_edge_destroy(zfs_edge_t *zep)

{

	free(zep);

}

/*

 * Allocate a new vertex with the given name.

 */

static zfs_vertex_t *

zfs_vertex_create(libzfs_handle_t *hdl, const char *dataset)

{

	zfs_vertex_t *zvp = zfs_alloc(hdl, sizeof (zfs_vertex_t));

	if (zvp == NULL)

		return (NULL);

	assert(strlen(dataset) < ZFS_MAXNAMELEN);

	(void) strlcpy(zvp->zv_dataset, dataset, sizeof (zvp->zv_dataset));

	if ((zvp->zv_edges = zfs_alloc(hdl,

	    MIN_EDGECOUNT * sizeof (void *))) == NULL) {

		free(zvp);

		return (NULL);

	}

	zvp->zv_edgealloc = MIN_EDGECOUNT;

	return (zvp);

}

/*

 * Destroy a vertex.  Frees up any associated edges.

 */

static void

zfs_vertex_destroy(zfs_vertex_t *zvp)

{

	int i;

	for (i = 0; i < zvp->zv_edgecount; i++)

		zfs_edge_destroy(zvp->zv_edges[i]);

	free(zvp->zv_edges);

	free(zvp);

}

/*

 * Given a vertex, add an edge to the destination vertex.

 */

static int

zfs_vertex_add_edge(libzfs_handle_t *hdl, zfs_vertex_t *zvp,

    zfs_vertex_t *dest)

{

	zfs_edge_t *zep = zfs_edge_create(hdl, dest);

	if (zep == NULL)

		return (-1);

	if (zvp->zv_edgecount == zvp->zv_edgealloc) {

		void *ptr;

		if ((ptr = zfs_realloc(hdl, zvp->zv_edges,

		    zvp->zv_edgealloc * sizeof (void *),

		    zvp->zv_edgealloc * 2 * sizeof (void *))) == NULL)

			return (-1);

		zvp->zv_edges = ptr;

		zvp->zv_edgealloc *= 2;

	}

	zvp->zv_edges[zvp->zv_edgecount++] = zep;

	return (0);

}

static int

zfs_edge_compare(const void *a, const void *b)

{

	const zfs_edge_t *ea = *((zfs_edge_t **)a);

	const zfs_edge_t *eb = *((zfs_edge_t **)b);

	if (ea->ze_dest->zv_txg < eb->ze_dest->zv_txg)

		return (-1);

	if (ea->ze_dest->zv_txg > eb->ze_dest->zv_txg)

		return (1);

	return (0);

}

/*

 * Sort the given vertex edges according to the creation txg of each vertex.

 */

static void

zfs_vertex_sort_edges(zfs_vertex_t *zvp)

{

	if (zvp->zv_edgecount == 0)

		return;

	qsort(zvp->zv_edges, zvp->zv_edgecount, sizeof (void *),

	    zfs_edge_compare);

}

/*

 * Construct a new graph object.  We allow the size to be specified as a

 * parameter so in the future we can size the hash according to the number of

 * datasets in the pool.

 */

static zfs_graph_t *

{

	zfs_graph_t *zgp = zfs_alloc(hdl, sizeof (zfs_graph_t));

	if (zgp == NULL)

		return (NULL);

	zgp->zg_size = size;

	if ((zgp->zg_hash = zfs_alloc(hdl,

	    size * sizeof (zfs_vertex_t *))) == NULL) {

		free(zgp);

		return (NULL);

	}

	return (zgp);

}

/*

 * Destroy a graph object.  We have to iterate over all the hash chains,

 * destroying each vertex in the process.

 */

static void

zfs_graph_destroy(zfs_graph_t *zgp)

{

	int i;

	zfs_vertex_t *current, *next;

	for (i = 0; i < zgp->zg_size; i++) {

		current = zgp->zg_hash[i];

		while (current != NULL) {

			next = current->zv_next;

			zfs_vertex_destroy(current);

			current = next;

		}

	}

	free(zgp->zg_hash);

	free(zgp);

}

/*

 * Graph hash function.  Classic bernstein k=33 hash function, taken from

 * usr/src/cmd/sgs/tools/common/strhash.c

 */

static size_t

zfs_graph_hash(zfs_graph_t *zgp, const char *str)

{

	size_t hash = 5381;

	int c;

	while ((c = *str++) != 0)

		hash = ((hash << 5) + hash) + c; /* hash * 33 + c */

	return (hash % zgp->zg_size);

}

/*

 * Given a dataset name, finds the associated vertex, creating it if necessary.

 */

static zfs_vertex_t *

zfs_graph_lookup(libzfs_handle_t *hdl, zfs_graph_t *zgp, const char *dataset,

    uint64_t txg)

{

	size_t idx = zfs_graph_hash(zgp, dataset);

	zfs_vertex_t *zvp;

	for (zvp = zgp->zg_hash[idx]; zvp != NULL; zvp = zvp->zv_next) {

		if (strcmp(zvp->zv_dataset, dataset) == 0) {

			if (zvp->zv_txg == 0)

				zvp->zv_txg = txg;

			return (zvp);

		}

	}

	if ((zvp = zfs_vertex_create(hdl, dataset)) == NULL)

		return (NULL);

	zvp->zv_next = zgp->zg_hash[idx];

	zvp->zv_txg = txg;

	zgp->zg_hash[idx] = zvp;

	zgp->zg_nvertex++;

	return (zvp);

}

/*

 * Given two dataset names, create an edge between them.  For the source vertex,

 * mark 'zv_visited' to indicate that we have seen this vertex, and not simply

 * created it as a destination of another edge.  If 'dest' is NULL, then this

 * is an individual vertex (i.e. the starting vertex), so don't add an edge.

 */

static int

zfs_graph_add(libzfs_handle_t *hdl, zfs_graph_t *zgp, const char *source,

    const char *dest, uint64_t txg)

{

	zfs_vertex_t *svp, *dvp;

	if ((svp = zfs_graph_lookup(hdl, zgp, source, 0)) == NULL)

		return (-1);

	svp->zv_visited = VISIT_SEEN;

	if (dest != NULL) {

		dvp = zfs_graph_lookup(hdl, zgp, dest, txg);

		if (dvp == NULL)

			return (-1);

		if (zfs_vertex_add_edge(hdl, svp, dvp) != 0)

			return (-1);

	}

	return (0);

}

/*

 */

static int

iterate_children(libzfs_handle_t *hdl, zfs_graph_t *zgp, const char *dataset)

{

	zfs_cmd_t zc = { 0 };

	zfs_vertex_t *zvp;

	/*

	 * Look up the source vertex, and avoid it if we've seen it before.

	 */

	zvp = zfs_graph_lookup(hdl, zgp, dataset, 0);

	if (zvp == NULL)

		return (-1);

	if (zvp->zv_visited == VISIT_SEEN)

		return (0);

	/*

	 */

	for ((void) strlcpy(zc.zc_name, dataset, sizeof (zc.zc_name));

	    ioctl(hdl->libzfs_fd, ZFS_IOC_DATASET_LIST_NEXT, &zc) == 0;

	    (void) strlcpy(zc.zc_name, dataset, sizeof (zc.zc_name))) {

		/*

		 * Ignore private dataset names.

		 */

		if (dataset_name_hidden(zc.zc_name))

			continue;

		/*

		 * Get statistics for this dataset, to determine the type of the

		 * dataset and clone statistics.  If this fails, the dataset has

		 * since been removed, and we're pretty much screwed anyway.

		 */

		if (ioctl(hdl->libzfs_fd, ZFS_IOC_OBJSET_STATS, &zc) != 0)

			continue;

		/*

		 * Add an edge between the parent and the child.

		 */

		if (zfs_graph_add(hdl, zgp, dataset, zc.zc_name,

		    zc.zc_objset_stats.dds_creation_txg) != 0)

			return (-1);

		/*

		 */

			return (-1);

	}

	/*

	 * Now iterate over all snapshots.

	 */

	bzero(&zc, sizeof (zc));

	for ((void) strlcpy(zc.zc_name, dataset, sizeof (zc.zc_name));

	    ioctl(hdl->libzfs_fd, ZFS_IOC_SNAPSHOT_LIST_NEXT, &zc) == 0;

	    (void) strlcpy(zc.zc_name, dataset, sizeof (zc.zc_name))) {

		/*

		 * Get statistics for this dataset, to determine the type of the

		 * dataset and clone statistics.  If this fails, the dataset has

		 * since been removed, and we're pretty much screwed anyway.

		 */

		if (ioctl(hdl->libzfs_fd, ZFS_IOC_OBJSET_STATS, &zc) != 0)

			continue;

		/*

		 * Add an edge between the parent and the child.

		 */

		if (zfs_graph_add(hdl, zgp, dataset, zc.zc_name,

		    zc.zc_objset_stats.dds_creation_txg) != 0)

			return (-1);

	}

	zvp->zv_visited = VISIT_SEEN;

}

/*