space_map.c revision a234c3c9d43545879dbc055e14b73c147cc93aff
/*
* 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
* 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
*/
/*
* Copyright 2009 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#include <sys/zfs_context.h>
#include <sys/space_map.h>
/*
* Space map routines.
* NOTE: caller is responsible for all locking.
*/
static int
{
return (0);
return (-1);
}
return (0);
return (1);
}
return (0);
}
void
{
}
void
{
}
void
{
int merge_before, merge_after;
zfs_panic_recover("zfs: allocating allocated segment"
"(offset=%llu size=%llu)\n",
return;
}
/* Make sure we don't overlap with either of our neighbors */
if (merge_before && merge_after) {
if (sm->sm_pp_root) {
}
} else if (merge_before) {
if (sm->sm_pp_root)
} else if (merge_after) {
if (sm->sm_pp_root)
} else {
}
if (sm->sm_pp_root)
}
void
{
int left_over, right_over;
/* Make sure we completely overlap with someone */
zfs_panic_recover("zfs: freeing free segment "
"(offset=%llu size=%llu)",
return;
}
if (sm->sm_pp_root)
if (left_over && right_over) {
if (sm->sm_pp_root)
} else if (left_over) {
} else if (right_over) {
} else {
}
}
{
}
void
{
}
}
void
{
}
/*
* Wait for any in-progress space_map_load() to complete.
*/
void
{
while (sm->sm_loading)
}
/*
* Note: space_map_load() will drop sm_lock across dmu_read() calls.
* The caller must be OK with this.
*/
int
{
int error = 0;
return (0);
}
dprintf("object=%llu offset=%llx size=%llx\n",
if (error != 0)
break;
if (SM_DEBUG_DECODE(e)) /* Skip debug entries */
continue;
(SM_TYPE_DECODE(e) == maptype ?
}
}
if (error == 0) {
} else {
}
return (error);
}
void
{
}
{
else
return (-1ULL);
}
{
if (start != -1ULL)
return (start);
}
void
{
}
void
{
}
/*
* Note: space_map_sync() will drop sm_lock across dmu_write() calls.
*/
void
{
return;
dprintf("object %4llu, txg %llu, pass %d, %c, count %lu, space %llx\n",
else
while (size) {
if (entry == entry_map_end) {
}
}
}
}
}
void
{
smo->smo_objsize = 0;
}
/*
* Space map reference trees.
*
* A space map is a collection of integers. Every integer is either
* in the map, or it's not. A space map reference tree generalizes
* the idea: it allows its members to have arbitrary reference counts,
* as opposed to the implicit reference count of 0 or 1 in a space map.
* This representation comes in handy when computing the union or
* intersection of multiple space maps. For example, the union of
* N space maps is the subset of the reference tree with refcnt >= 1.
* The intersection of N space maps is the subset with refcnt >= N.
*
* [It's very much like a Fourier transform. Unions and intersections
* are hard to perform in the 'space map domain', so we convert the maps
* into the 'reference count domain', where it's trivial, then invert.]
*
* vdev_dtl_reassess() uses computations of this form to determine
* DTL_MISSING and DTL_OUTAGE for interior vdevs -- e.g. a RAID-Z vdev
* has an outage wherever refcnt >= vdev_nparity + 1, and a mirror vdev
* has an outage wherever refcnt >= vdev_children.
*/
static int
{
return (-1);
return (1);
return (-1);
return (1);
return (0);
}
void
{
}
void
{
avl_destroy(t);
}
static void
{
}
void
{
}
/*
* Convert (or add) a space map into a reference tree.
*/
void
{
}
/*
* Convert a reference tree into a space map. The space map will contain
* all members of the reference tree for which refcnt >= minref.
*/
void
{
if (start == -1ULL) {
}
} else {
if (start != -1ULL) {
start = -1ULL;
}
}
}
}