Lines Matching refs:DTL_MISSING
1655 * DTL_MISSING: txgs for which the vdev has no valid copies of the data
1660 * scrub completion, DTL_SCRUB replaces DTL_MISSING in the range of
1669 * For leaf vdevs, DTL_MISSING and DTL_PARTIAL are identical: the device
1675 * A vdev's DTL_MISSING is a modified union of its children's DTL_MISSINGs,
1679 * thus, its DTL_MISSING consists of the set of txgs that appear in more than
1680 * two child DTL_MISSING maps.
1683 * for all vdevs, it suffices to know just the leaf vdevs' DTL_MISSING maps.
1741 ASSERT3U(range_tree_space(vd->vdev_dtl[DTL_MISSING]), !=, 0);
1744 rs = avl_first(&vd->vdev_dtl[DTL_MISSING]->rt_root);
1757 ASSERT3U(range_tree_space(vd->vdev_dtl[DTL_MISSING]), !=, 0);
1760 rs = avl_last(&vd->vdev_dtl[DTL_MISSING]->rt_root);
1782 range_tree_space(vd->vdev_dtl[DTL_MISSING]) == 0)
1843 * of the DTL_MISSING map, we put it into a reference
1850 * the reference tree into the new DTL_MISSING map.
1854 vd->vdev_dtl[DTL_MISSING], 1);
1859 vd->vdev_dtl[DTL_MISSING], 1);
1863 range_tree_walk(vd->vdev_dtl[DTL_MISSING],
1871 range_tree_walk(vd->vdev_dtl[DTL_MISSING],
1879 range_tree_space(vd->vdev_dtl[DTL_MISSING]) == 0 &&
1893 int s = (t == DTL_MISSING) ? DTL_OUTAGE: t;
1940 vd->vdev_dtl[DTL_MISSING], SM_ALLOC);
2002 range_tree_t *rt = vd->vdev_dtl[DTL_MISSING];
2130 if (range_tree_space(vd->vdev_dtl[DTL_MISSING]) != 0 &&
2934 if (vdev_dtl_contains(vd, DTL_MISSING, txg, 1))
2941 vdev_dtl_dirty(vd, DTL_MISSING, txg, 1);