sbin/hammer: Add /* not reached */ (missing ones in 052fd72b)

[dragonfly.git] / sbin / hammer / cmd_dedup.c

/*
 * Copyright (c) 2010 The DragonFly Project.  All rights reserved.
 *
 * This code is derived from software contributed to The DragonFly Project
 * by Ilya Dryomov <idryomov@gmail.com>
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 * 3. Neither the name of The DragonFly Project nor the names of its
 *    contributors may be used to endorse or promote products derived
 *    from this software without specific, prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#include <libutil.h>
#include <crypto/sha2/sha2.h>

#include "hammer.h"

#define DEDUP_BUF (64 * 1024)

/* Sorted list of block CRCs - light version for dedup-simulate */
struct sim_dedup_entry_rb_tree;
RB_HEAD(sim_dedup_entry_rb_tree, sim_dedup_entry) sim_dedup_tree =
                                        RB_INITIALIZER(&sim_dedup_tree);
RB_PROTOTYPE2(sim_dedup_entry_rb_tree, sim_dedup_entry, rb_entry,
                rb_sim_dedup_entry_compare, hammer_crc_t);

struct sim_dedup_entry {
        hammer_crc_t    crc;
        uint64_t        ref_blks; /* number of blocks referenced */
        uint64_t        ref_size; /* size of data referenced */
        RB_ENTRY(sim_dedup_entry) rb_entry;
};

struct dedup_entry {
        struct hammer_btree_leaf_elm leaf;
        union {
                struct {
                        uint64_t ref_blks;
                        uint64_t ref_size;
                } de;
                RB_HEAD(sha_dedup_entry_rb_tree, sha_dedup_entry) fict_root;
        } u;
        uint8_t flags;
        RB_ENTRY(dedup_entry) rb_entry;
};

#define HAMMER_DEDUP_ENTRY_FICTITIOUS   0x0001

struct sha_dedup_entry {
        struct hammer_btree_leaf_elm    leaf;
        uint64_t                        ref_blks;
        uint64_t                        ref_size;
        uint8_t                         sha_hash[SHA256_DIGEST_LENGTH];
        RB_ENTRY(sha_dedup_entry)       fict_entry;
};

/* Sorted list of HAMMER B-Tree keys */
struct dedup_entry_rb_tree;
struct sha_dedup_entry_rb_tree;

RB_HEAD(dedup_entry_rb_tree, dedup_entry) dedup_tree =
                                        RB_INITIALIZER(&dedup_tree);
RB_PROTOTYPE2(dedup_entry_rb_tree, dedup_entry, rb_entry,
                rb_dedup_entry_compare, hammer_crc_t);

RB_PROTOTYPE(sha_dedup_entry_rb_tree, sha_dedup_entry, fict_entry,
                rb_sha_dedup_entry_compare);

/*
 * Pass2 list - contains entries that were not dedup'ed because ioctl failed
 */
STAILQ_HEAD(, pass2_dedup_entry) pass2_dedup_queue =
                                STAILQ_HEAD_INITIALIZER(pass2_dedup_queue);

struct pass2_dedup_entry {
        struct hammer_btree_leaf_elm    leaf;
        STAILQ_ENTRY(pass2_dedup_entry) sq_entry;
};

#define DEDUP_PASS2     0x0001 /* process_btree_elm() mode */

static int SigInfoFlag;
static int SigAlrmFlag;
static int64_t DedupDataReads;
static int64_t DedupCurrentRecords;
static int64_t DedupTotalRecords;
static uint32_t DedupCrcStart;
static uint32_t DedupCrcEnd;
static uint64_t MemoryUse;

/* PFS global ids - we deal with just one PFS at a run */
static int glob_fd;
static struct hammer_ioc_pseudofs_rw glob_pfs;

/*
 * Global accounting variables
 *
 * Last three don't have to be 64-bit, just to be safe..
 */
static uint64_t dedup_alloc_size;
static uint64_t dedup_ref_size;
static uint64_t dedup_skipped_size;
static uint64_t dedup_crc_failures;
static uint64_t dedup_sha_failures;
static uint64_t dedup_underflows;
static uint64_t dedup_successes_count;
static uint64_t dedup_successes_bytes;

static int rb_sim_dedup_entry_compare(struct sim_dedup_entry *sim_de1,
                                struct sim_dedup_entry *sim_de2);
static int rb_dedup_entry_compare(struct dedup_entry *de1,
                                struct dedup_entry *de2);
static int rb_sha_dedup_entry_compare(struct sha_dedup_entry *sha_de1,
                                struct sha_dedup_entry *sha_de2);
typedef int (*scan_pfs_cb_t)(hammer_btree_leaf_elm_t scan_leaf, int flags);
static void scan_pfs(char *filesystem, scan_pfs_cb_t func, const char *id);
static int collect_btree_elm(hammer_btree_leaf_elm_t scan_leaf, int flags);
static int count_btree_elm(hammer_btree_leaf_elm_t scan_leaf, int flags);
static int process_btree_elm(hammer_btree_leaf_elm_t scan_leaf, int flags);
static int upgrade_chksum(hammer_btree_leaf_elm_t leaf, uint8_t *sha_hash);
static void dump_simulated_dedup(void);
static void dump_real_dedup(void);
static void dedup_usage(int code);

RB_GENERATE2(sim_dedup_entry_rb_tree, sim_dedup_entry, rb_entry,
                rb_sim_dedup_entry_compare, hammer_crc_t, crc);
RB_GENERATE2(dedup_entry_rb_tree, dedup_entry, rb_entry,
                rb_dedup_entry_compare, hammer_crc_t, leaf.data_crc);
RB_GENERATE(sha_dedup_entry_rb_tree, sha_dedup_entry, fict_entry,
                rb_sha_dedup_entry_compare);

static int
rb_sim_dedup_entry_compare(struct sim_dedup_entry *sim_de1,
                        struct sim_dedup_entry *sim_de2)
{
        if (sim_de1->crc < sim_de2->crc)
                return (-1);
        if (sim_de1->crc > sim_de2->crc)
                return (1);

        return (0);
}

static int
rb_dedup_entry_compare(struct dedup_entry *de1, struct dedup_entry *de2)
{
        if (de1->leaf.data_crc < de2->leaf.data_crc)
                return (-1);
        if (de1->leaf.data_crc > de2->leaf.data_crc)
                return (1);

        return (0);
}

static int
rb_sha_dedup_entry_compare(struct sha_dedup_entry *sha_de1,
                        struct sha_dedup_entry *sha_de2)
{
        unsigned long *h1 = (unsigned long *)&sha_de1->sha_hash;
        unsigned long *h2 = (unsigned long *)&sha_de2->sha_hash;
        int i;

        for (i = 0; i < SHA256_DIGEST_LENGTH / (int)sizeof(unsigned long); ++i) {
                if (h1[i] < h2[i])
                        return (-1);
                if (h1[i] > h2[i])
                        return (1);
        }

        return (0);
}

/*
 * dedup-simulate <filesystem>
 */
void
hammer_cmd_dedup_simulate(char **av, int ac)
{
        struct sim_dedup_entry *sim_de;

        if (ac != 1) {
                dedup_usage(1);
                /* not reached */
        }

        glob_fd = getpfs(&glob_pfs, av[0]);

        /*
         * Collection passes (memory limited)
         */
        printf("Dedup-simulate running\n");
        do {
                DedupCrcStart = DedupCrcEnd;
                DedupCrcEnd = 0;
                MemoryUse = 0;

                if (VerboseOpt) {
                        printf("B-Tree pass  crc-range %08x-max\n",
                                DedupCrcStart);
                        fflush(stdout);
                }
                scan_pfs(av[0], collect_btree_elm, "simu-pass");

                if (VerboseOpt >= 2)
                        dump_simulated_dedup();

                /*
                 * Calculate simulated dedup ratio and get rid of the tree
                 */
                while ((sim_de = RB_ROOT(&sim_dedup_tree)) != NULL) {
                        assert(sim_de->ref_blks != 0);
                        dedup_ref_size += sim_de->ref_size;
                        dedup_alloc_size += sim_de->ref_size / sim_de->ref_blks;

                        RB_REMOVE(sim_dedup_entry_rb_tree, &sim_dedup_tree, sim_de);
                        free(sim_de);
                }
                if (DedupCrcEnd && VerboseOpt == 0)
                        printf(".");
        } while (DedupCrcEnd);

        printf("Dedup-simulate %s succeeded\n", av[0]);
        relpfs(glob_fd, &glob_pfs);

        printf("Simulated dedup ratio = %.2f\n",
            (dedup_alloc_size != 0) ?
                (double)dedup_ref_size / dedup_alloc_size : 0);
}

/*
 * dedup <filesystem>
 */
void
hammer_cmd_dedup(char **av, int ac)
{
        struct dedup_entry *de;
        struct sha_dedup_entry *sha_de;
        struct pass2_dedup_entry *pass2_de;
        char *tmp;
        char buf[8];
        int needfree = 0;

        if (TimeoutOpt > 0)
                alarm(TimeoutOpt);

        if (ac != 1) {
                dedup_usage(1);
                /* not reached */
        }

        STAILQ_INIT(&pass2_dedup_queue);

        glob_fd = getpfs(&glob_pfs, av[0]);

        /*
         * A cycle file is _required_ for resuming dedup after the timeout
         * specified with -t has expired. If no -c option, then place a
         * .dedup.cycle file either in the PFS snapshots directory or in
         * the default snapshots directory.
         */
        if (!CyclePath) {
                if (glob_pfs.ondisk->snapshots[0] != '/')
                        asprintf(&tmp, "%s/%s/.dedup.cycle",
                            SNAPSHOTS_BASE, av[0]);
                else
                        asprintf(&tmp, "%s/.dedup.cycle",
                            glob_pfs.ondisk->snapshots);
                CyclePath = tmp;
                needfree = 1;
        }

        /*
         * Pre-pass to cache the btree
         */
        scan_pfs(av[0], count_btree_elm, "pre-pass ");
        DedupTotalRecords = DedupCurrentRecords;

        /*
         * Collection passes (memory limited)
         */
        printf("Dedup running\n");
        do {
                DedupCrcStart = DedupCrcEnd;
                DedupCrcEnd = 0;
                MemoryUse = 0;

                if (VerboseOpt) {
                        printf("B-Tree pass  crc-range %08x-max\n",
                                DedupCrcStart);
                        fflush(stdout);
                }
                scan_pfs(av[0], process_btree_elm, "main-pass");

                while ((pass2_de = STAILQ_FIRST(&pass2_dedup_queue)) != NULL) {
                        if (process_btree_elm(&pass2_de->leaf, DEDUP_PASS2))
                                dedup_skipped_size -= pass2_de->leaf.data_len;

                        STAILQ_REMOVE_HEAD(&pass2_dedup_queue, sq_entry);
                        free(pass2_de);
                }
                assert(STAILQ_EMPTY(&pass2_dedup_queue));

                if (VerboseOpt >= 2)
                        dump_real_dedup();

                /*
                 * Calculate dedup ratio and get rid of the trees
                 */
                while ((de = RB_ROOT(&dedup_tree)) != NULL) {
                        if (de->flags & HAMMER_DEDUP_ENTRY_FICTITIOUS) {
                                while ((sha_de = RB_ROOT(&de->u.fict_root)) != NULL) {
                                        assert(sha_de->ref_blks != 0);
                                        dedup_ref_size += sha_de->ref_size;
                                        dedup_alloc_size += sha_de->ref_size / sha_de->ref_blks;

                                        RB_REMOVE(sha_dedup_entry_rb_tree,
                                                        &de->u.fict_root, sha_de);
                                        free(sha_de);
                                }
                                assert(RB_EMPTY(&de->u.fict_root));
                        } else {
                                assert(de->u.de.ref_blks != 0);
                                dedup_ref_size += de->u.de.ref_size;
                                dedup_alloc_size += de->u.de.ref_size / de->u.de.ref_blks;
                        }

                        RB_REMOVE(dedup_entry_rb_tree, &dedup_tree, de);
                        free(de);
                }
                assert(RB_EMPTY(&dedup_tree));
                if (DedupCrcEnd && VerboseOpt == 0)
                        printf(".");
        } while (DedupCrcEnd);

        printf("Dedup %s succeeded\n", av[0]);
        relpfs(glob_fd, &glob_pfs);

        humanize_unsigned(buf, sizeof(buf), dedup_ref_size, "B", 1024);
        printf("Dedup ratio = %.2f (in this run)\n"
               "    %8s referenced\n",
               ((dedup_alloc_size != 0) ?
                        (double)dedup_ref_size / dedup_alloc_size : 0),
               buf
        );
        humanize_unsigned(buf, sizeof(buf), dedup_alloc_size, "B", 1024);
        printf("    %8s allocated\n", buf);
        humanize_unsigned(buf, sizeof(buf), dedup_skipped_size, "B", 1024);
        printf("    %8s skipped\n", buf);
        printf("    %8jd CRC collisions\n"
               "    %8jd SHA collisions\n"
               "    %8jd big-block underflows\n"
               "    %8jd new dedup records\n"
               "    %8jd new dedup bytes\n",
               (intmax_t)dedup_crc_failures,
               (intmax_t)dedup_sha_failures,
               (intmax_t)dedup_underflows,
               (intmax_t)dedup_successes_count,
               (intmax_t)dedup_successes_bytes
        );

        /* Once completed remove cycle file */
        hammer_reset_cycle();

        /* We don't want to mess up with other directives */
        if (needfree) {
                free(tmp);
                CyclePath = NULL;
        }
}

static int
count_btree_elm(hammer_btree_leaf_elm_t scan_leaf __unused, int flags __unused)
{
        return(1);
}

static int
collect_btree_elm(hammer_btree_leaf_elm_t scan_leaf, int flags __unused)
{
        struct sim_dedup_entry *sim_de;

        /*
         * If we are using too much memory we have to clean some out, which
         * will cause the run to use multiple passes.  Be careful of integer
         * overflows!
         */
        if (MemoryUse > MemoryLimit) {
                DedupCrcEnd = DedupCrcStart +
                              (uint32_t)(DedupCrcEnd - DedupCrcStart - 1) / 2;
                if (VerboseOpt) {
                        printf("memory limit  crc-range %08x-%08x\n",
                                DedupCrcStart, DedupCrcEnd);
                        fflush(stdout);
                }
                for (;;) {
                        sim_de = RB_MAX(sim_dedup_entry_rb_tree,
                                        &sim_dedup_tree);
                        if (sim_de == NULL || sim_de->crc < DedupCrcEnd)
                                break;
                        RB_REMOVE(sim_dedup_entry_rb_tree,
                                  &sim_dedup_tree, sim_de);
                        MemoryUse -= sizeof(*sim_de);
                        free(sim_de);
                }
        }

        /*
         * Collect statistics based on the CRC only, do not try to read
         * any data blocks or run SHA hashes.
         */
        sim_de = RB_LOOKUP(sim_dedup_entry_rb_tree, &sim_dedup_tree,
                           scan_leaf->data_crc);

        if (sim_de == NULL) {
                sim_de = calloc(1, sizeof(*sim_de));
                sim_de->crc = scan_leaf->data_crc;
                RB_INSERT(sim_dedup_entry_rb_tree, &sim_dedup_tree, sim_de);
                MemoryUse += sizeof(*sim_de);
        }

        sim_de->ref_blks += 1;
        sim_de->ref_size += scan_leaf->data_len;
        return (1);
}

static __inline int
validate_dedup_pair(hammer_btree_leaf_elm_t p, hammer_btree_leaf_elm_t q)
{
        if (HAMMER_ZONE(p->data_offset) != HAMMER_ZONE(q->data_offset))
                return (1);
        if (p->data_len != q->data_len)
                return (1);

        return (0);
}

#define DEDUP_TECH_FAILURE      1
#define DEDUP_CMP_FAILURE       2
#define DEDUP_INVALID_ZONE      3
#define DEDUP_UNDERFLOW         4
#define DEDUP_VERS_FAILURE      5

static __inline int
deduplicate(hammer_btree_leaf_elm_t p, hammer_btree_leaf_elm_t q)
{
        struct hammer_ioc_dedup dedup;

        bzero(&dedup, sizeof(dedup));

        /*
         * If data_offset fields are the same there is no need to run ioctl,
         * candidate is already dedup'ed.
         */
        if (p->data_offset == q->data_offset)
                return (0);

        dedup.elm1 = p->base;
        dedup.elm2 = q->base;
        RunningIoctl = 1;
        if (ioctl(glob_fd, HAMMERIOC_DEDUP, &dedup) < 0) {
                if (errno == EOPNOTSUPP)
                        return (DEDUP_VERS_FAILURE); /* must be at least version 5 */
                /* Technical failure - locking or w/e */
                return (DEDUP_TECH_FAILURE);
        }
        if (dedup.head.flags & HAMMER_IOC_DEDUP_CMP_FAILURE)
                return (DEDUP_CMP_FAILURE);
        if (dedup.head.flags & HAMMER_IOC_DEDUP_INVALID_ZONE)
                return (DEDUP_INVALID_ZONE);
        if (dedup.head.flags & HAMMER_IOC_DEDUP_UNDERFLOW)
                return (DEDUP_UNDERFLOW);
        RunningIoctl = 0;
        ++dedup_successes_count;
        dedup_successes_bytes += p->data_len;
        return (0);
}

static int
process_btree_elm(hammer_btree_leaf_elm_t scan_leaf, int flags)
{
        struct dedup_entry *de;
        struct sha_dedup_entry *sha_de, temp;
        struct pass2_dedup_entry *pass2_de;
        int error;

        /*
         * If we are using too much memory we have to clean some out, which
         * will cause the run to use multiple passes.  Be careful of integer
         * overflows!
         */
        while (MemoryUse > MemoryLimit) {
                DedupCrcEnd = DedupCrcStart +
                              (uint32_t)(DedupCrcEnd - DedupCrcStart - 1) / 2;
                if (VerboseOpt) {
                        printf("memory limit  crc-range %08x-%08x\n",
                                DedupCrcStart, DedupCrcEnd);
                        fflush(stdout);
                }

                for (;;) {
                        de = RB_MAX(dedup_entry_rb_tree, &dedup_tree);
                        if (de == NULL || de->leaf.data_crc < DedupCrcEnd)
                                break;
                        if (de->flags & HAMMER_DEDUP_ENTRY_FICTITIOUS) {
                                while ((sha_de = RB_ROOT(&de->u.fict_root)) !=
                                       NULL) {
                                        RB_REMOVE(sha_dedup_entry_rb_tree,
                                                  &de->u.fict_root, sha_de);
                                        MemoryUse -= sizeof(*sha_de);
                                        free(sha_de);
                                }
                        }
                        RB_REMOVE(dedup_entry_rb_tree, &dedup_tree, de);
                        MemoryUse -= sizeof(*de);
                        free(de);
                }
        }

        /*
         * Collect statistics based on the CRC.  Colliding CRCs usually
         * cause a SHA sub-tree to be created under the de.
         *
         * Trivial case if de not found.
         */
        de = RB_LOOKUP(dedup_entry_rb_tree, &dedup_tree, scan_leaf->data_crc);
        if (de == NULL) {
                de = calloc(1, sizeof(*de));
                de->leaf = *scan_leaf;
                RB_INSERT(dedup_entry_rb_tree, &dedup_tree, de);
                MemoryUse += sizeof(*de);
                goto upgrade_stats;
        }

        /*
         * Found entry in CRC tree
         */
        if (de->flags & HAMMER_DEDUP_ENTRY_FICTITIOUS) {
                /*
                 * Optimize the case where a CRC failure results in multiple
                 * SHA entries.  If we unconditionally issue a data-read a
                 * degenerate situation where a colliding CRC's second SHA
                 * entry contains the lion's share of the deduplication
                 * candidates will result in excessive data block reads.
                 *
                 * Deal with the degenerate case by looking for a matching
                 * data_offset/data_len in the SHA elements we already have
                 * before reading the data block and generating a new SHA.
                 */
                RB_FOREACH(sha_de, sha_dedup_entry_rb_tree, &de->u.fict_root) {
                        if (sha_de->leaf.data_offset ==
                                                scan_leaf->data_offset &&
                            sha_de->leaf.data_len == scan_leaf->data_len) {
                                memcpy(temp.sha_hash, sha_de->sha_hash,
                                        SHA256_DIGEST_LENGTH);
                                break;
                        }
                }

                /*
                 * Entry in CRC tree is fictitious, so we already had problems
                 * with this CRC. Upgrade (compute SHA) the candidate and
                 * dive into SHA subtree. If upgrade fails insert the candidate
                 * into Pass2 list (it will be processed later).
                 */
                if (sha_de == NULL) {
                        if (upgrade_chksum(scan_leaf, temp.sha_hash))
                                goto pass2_insert;

                        sha_de = RB_FIND(sha_dedup_entry_rb_tree,
                                         &de->u.fict_root, &temp);
                }

                /*
                 * Nothing in SHA subtree so far, so this is a new
                 * 'dataset'. Insert new entry into SHA subtree.
                 */
                if (sha_de == NULL) {
                        sha_de = calloc(1, sizeof(*sha_de));
                        sha_de->leaf = *scan_leaf;
                        memcpy(sha_de->sha_hash, temp.sha_hash,
                               SHA256_DIGEST_LENGTH);
                        RB_INSERT(sha_dedup_entry_rb_tree, &de->u.fict_root,
                                  sha_de);
                        MemoryUse += sizeof(*sha_de);
                        goto upgrade_stats_sha;
                }

                /*
                 * Found entry in SHA subtree, it means we have a potential
                 * dedup pair. Validate it (zones have to match and data_len
                 * field have to be the same too. If validation fails, treat
                 * it as a SHA collision (jump to sha256_failure).
                 */
                if (validate_dedup_pair(&sha_de->leaf, scan_leaf))
                        goto sha256_failure;

                /*
                 * We have a valid dedup pair (SHA match, validated).
                 *
                 * In case of technical failure (dedup pair was good, but
                 * ioctl failed anyways) insert the candidate into Pass2 list
                 * (we will try to dedup it after we are done with the rest of
                 * the tree).
                 *
                 * If ioctl fails because either of blocks is in the non-dedup
                 * zone (we can dedup only in LARGE_DATA and SMALL_DATA) don't
                 * bother with the candidate and terminate early.
                 *
                 * If ioctl fails because of big-block underflow replace the
                 * leaf node that found dedup entry represents with scan_leaf.
                 */
                error = deduplicate(&sha_de->leaf, scan_leaf);
                switch(error) {
                case 0:
                        goto upgrade_stats_sha;
                case DEDUP_TECH_FAILURE:
                        goto pass2_insert;
                case DEDUP_CMP_FAILURE:
                        goto sha256_failure;
                case DEDUP_INVALID_ZONE:
                        goto terminate_early;
                case DEDUP_UNDERFLOW:
                        ++dedup_underflows;
                        sha_de->leaf = *scan_leaf;
                        memcpy(sha_de->sha_hash, temp.sha_hash,
                                SHA256_DIGEST_LENGTH);
                        goto upgrade_stats_sha;
                case DEDUP_VERS_FAILURE:
                        errx(1, "HAMMER filesystem must be at least "
                                "version 5 to dedup");
                        /* not reached */
                default:
                        fprintf(stderr, "Unknown error\n");
                        goto terminate_early;
                }

                /*
                 * Ooh la la.. SHA-256 collision. Terminate early, there's
                 * nothing we can do here.
                 */
sha256_failure:
                ++dedup_sha_failures;
                goto terminate_early;
        } else {
                /*
                 * Candidate CRC is good for now (we found an entry in CRC
                 * tree and it's not fictitious). This means we have a
                 * potential dedup pair.
                 */
                if (validate_dedup_pair(&de->leaf, scan_leaf))
                        goto crc_failure;

                /*
                 * We have a valid dedup pair (CRC match, validated)
                 */
                error = deduplicate(&de->leaf, scan_leaf);
                switch(error) {
                case 0:
                        goto upgrade_stats;
                case DEDUP_TECH_FAILURE:
                        goto pass2_insert;
                case DEDUP_CMP_FAILURE:
                        goto crc_failure;
                case DEDUP_INVALID_ZONE:
                        goto terminate_early;
                case DEDUP_UNDERFLOW:
                        ++dedup_underflows;
                        de->leaf = *scan_leaf;
                        goto upgrade_stats;
                case DEDUP_VERS_FAILURE:
                        errx(1, "HAMMER filesystem must be at least "
                                "version 5 to dedup");
                        /* not reached */
                default:
                        fprintf(stderr, "Unknown error\n");
                        goto terminate_early;
                }

crc_failure:
                /*
                 * We got a CRC collision - either ioctl failed because of
                 * the comparison failure or validation of the potential
                 * dedup pair went bad. In all cases insert both blocks
                 * into SHA subtree (this requires checksum upgrade) and mark
                 * entry that corresponds to this CRC in the CRC tree
                 * fictitious, so that all futher operations with this CRC go
                 * through SHA subtree.
                 */
                ++dedup_crc_failures;

                /*
                 * Insert block that was represented by now fictitious dedup
                 * entry (create a new SHA entry and preserve stats of the
                 * old CRC one). If checksum upgrade fails insert the
                 * candidate into Pass2 list and return - keep both trees
                 * unmodified.
                 */
                sha_de = calloc(1, sizeof(*sha_de));
                sha_de->leaf = de->leaf;
                sha_de->ref_blks = de->u.de.ref_blks;
                sha_de->ref_size = de->u.de.ref_size;
                if (upgrade_chksum(&sha_de->leaf, sha_de->sha_hash)) {
                        free(sha_de);
                        goto pass2_insert;
                }
                MemoryUse += sizeof(*sha_de);

                RB_INIT(&de->u.fict_root);
                /*
                 * Here we can insert without prior checking because the tree
                 * is empty at this point
                 */
                RB_INSERT(sha_dedup_entry_rb_tree, &de->u.fict_root, sha_de);

                /*
                 * Mark entry in CRC tree fictitious
                 */
                de->flags |= HAMMER_DEDUP_ENTRY_FICTITIOUS;

                /*
                 * Upgrade checksum of the candidate and insert it into
                 * SHA subtree. If upgrade fails insert the candidate into
                 * Pass2 list.
                 */
                if (upgrade_chksum(scan_leaf, temp.sha_hash))
                        goto pass2_insert;
                sha_de = RB_FIND(sha_dedup_entry_rb_tree, &de->u.fict_root,
                                 &temp);
                if (sha_de != NULL)
                        /* There is an entry with this SHA already, but the only
                         * RB-tree element at this point is that entry we just
                         * added. We know for sure these blocks are different
                         * (this is crc_failure branch) so treat it as SHA
                         * collision.
                         */
                        goto sha256_failure;

                sha_de = calloc(1, sizeof(*sha_de));
                sha_de->leaf = *scan_leaf;
                memcpy(sha_de->sha_hash, temp.sha_hash, SHA256_DIGEST_LENGTH);
                RB_INSERT(sha_dedup_entry_rb_tree, &de->u.fict_root, sha_de);
                MemoryUse += sizeof(*sha_de);
                goto upgrade_stats_sha;
        }

upgrade_stats:
        de->u.de.ref_blks += 1;
        de->u.de.ref_size += scan_leaf->data_len;
        return (1);

upgrade_stats_sha:
        sha_de->ref_blks += 1;
        sha_de->ref_size += scan_leaf->data_len;
        return (1);

pass2_insert:
        /*
         * If in pass2 mode don't insert anything, fall through to
         * terminate_early
         */
        if ((flags & DEDUP_PASS2) == 0) {
                pass2_de = calloc(1, sizeof(*pass2_de));
                pass2_de->leaf = *scan_leaf;
                STAILQ_INSERT_TAIL(&pass2_dedup_queue, pass2_de, sq_entry);
                dedup_skipped_size += scan_leaf->data_len;
                return (1);
        }

terminate_early:
        /*
         * Early termination path. Fixup stats.
         */
        dedup_alloc_size += scan_leaf->data_len;
        dedup_ref_size += scan_leaf->data_len;
        return (0);
}

static int
upgrade_chksum(hammer_btree_leaf_elm_t leaf, uint8_t *sha_hash)
{
        struct hammer_ioc_data data;
        char *buf = malloc(DEDUP_BUF);
        SHA256_CTX ctx;
        int error;

        bzero(&data, sizeof(data));
        data.elm = leaf->base;
        data.ubuf = buf;
        data.size = DEDUP_BUF;

        error = 0;
        if (ioctl(glob_fd, HAMMERIOC_GET_DATA, &data) < 0) {
                fprintf(stderr, "Get-data failed: %s\n", strerror(errno));
                error = 1;
                goto done;
        }
        DedupDataReads += leaf->data_len;

        if (data.leaf.data_len != leaf->data_len) {
                error = 1;
                goto done;
        }

        if (data.leaf.base.btype == HAMMER_BTREE_TYPE_RECORD &&
            data.leaf.base.rec_type == HAMMER_RECTYPE_DATA) {
                SHA256_Init(&ctx);
                SHA256_Update(&ctx, (void *)buf, data.leaf.data_len);
                SHA256_Final(sha_hash, &ctx);
        }

done:
        free(buf);
        return (error);
}

static void
sigAlrm(int signo __unused)
{
        SigAlrmFlag = 1;
}

static void
sigInfo(int signo __unused)
{
        SigInfoFlag = 1;
}

static void
scan_pfs(char *filesystem, scan_pfs_cb_t func, const char *id)
{
        struct hammer_ioc_mirror_rw mirror;
        hammer_ioc_mrecord_any_t mrec;
        struct hammer_btree_leaf_elm elm;
        char *buf = malloc(DEDUP_BUF);
        char buf1[8];
        char buf2[8];
        int offset, bytes;

        SigInfoFlag = 0;
        DedupDataReads = 0;
        DedupCurrentRecords = 0;
        signal(SIGINFO, sigInfo);
        signal(SIGALRM, sigAlrm);

        /*
         * Deduplication happens per element so hammer(8) is in full
         * control of the ioctl()s to actually perform it. SIGALRM
         * needs to be handled within hammer(8) but a checkpoint
         * is needed for resuming. Use cycle file for that.
         *
         * Try to obtain the previous obj_id from the cycle file and
         * if not available just start from the beginning.
         */
        bzero(&mirror, sizeof(mirror));
        hammer_key_beg_init(&mirror.key_beg);
        hammer_get_cycle(&mirror.key_beg, &mirror.tid_beg);

        if (mirror.key_beg.obj_id != (int64_t)HAMMER_MIN_OBJID) {
                if (VerboseOpt)
                        fprintf(stderr, "%s: mirror-read: Resuming at object %016jx\n",
                            id, (uintmax_t)mirror.key_beg.obj_id);
        }

        hammer_key_end_init(&mirror.key_end);

        mirror.tid_beg = glob_pfs.ondisk->sync_beg_tid;
        mirror.tid_end = glob_pfs.ondisk->sync_end_tid;
        mirror.head.flags |= HAMMER_IOC_MIRROR_NODATA; /* we want only keys */
        mirror.ubuf = buf;
        mirror.size = DEDUP_BUF;
        mirror.pfs_id = glob_pfs.pfs_id;
        mirror.shared_uuid = glob_pfs.ondisk->shared_uuid;

        if (VerboseOpt && DedupCrcStart == 0) {
                printf("%s %s: objspace %016jx:%04x %016jx:%04x\n",
                        id, filesystem,
                        (uintmax_t)mirror.key_beg.obj_id,
                        mirror.key_beg.localization,
                        (uintmax_t)mirror.key_end.obj_id,
                        mirror.key_end.localization);
                printf("%s %s: pfs_id %d\n",
                        id, filesystem, glob_pfs.pfs_id);
        }
        fflush(stdout);
        fflush(stderr);

        do {
                mirror.count = 0;
                mirror.pfs_id = glob_pfs.pfs_id;
                mirror.shared_uuid = glob_pfs.ondisk->shared_uuid;
                if (ioctl(glob_fd, HAMMERIOC_MIRROR_READ, &mirror) < 0) {
                        err(1, "Mirror-read %s failed", filesystem);
                        /* not reached */
                }
                if (mirror.head.flags & HAMMER_IOC_HEAD_ERROR) {
                        errx(1, "Mirror-read %s fatal error %d",
                                filesystem, mirror.head.error);
                        /* not reached */
                }
                if (mirror.count) {
                        offset = 0;
                        while (offset < mirror.count) {
                                mrec = (void *)((char *)buf + offset);
                                bytes = HAMMER_HEAD_DOALIGN(mrec->head.rec_size);
                                if (offset + bytes > mirror.count) {
                                        errx(1, "Misaligned record");
                                        /* not reached */
                                }
                                assert((mrec->head.type &
                                       HAMMER_MRECF_TYPE_MASK) ==
                                       HAMMER_MREC_TYPE_REC);
                                offset += bytes;
                                elm = mrec->rec.leaf;
                                if (elm.base.btype != HAMMER_BTREE_TYPE_RECORD)
                                        continue;
                                if (elm.base.rec_type != HAMMER_RECTYPE_DATA)
                                        continue;
                                ++DedupCurrentRecords;
                                if (DedupCrcStart != DedupCrcEnd) {
                                        if (elm.data_crc < DedupCrcStart)
                                                continue;
                                        if (DedupCrcEnd &&
                                            elm.data_crc >= DedupCrcEnd) {
                                                continue;
                                        }
                                }
                                func(&elm, 0);
                        }
                }
                mirror.key_beg = mirror.key_cur;
                if (DidInterrupt || SigAlrmFlag) {
                        if (VerboseOpt)
                                fprintf(stderr, "%s\n",
                                    (DidInterrupt ? "Interrupted" : "Timeout"));
                        hammer_set_cycle(&mirror.key_cur, mirror.tid_beg);
                        if (VerboseOpt)
                                fprintf(stderr, "Cyclefile %s updated for "
                                    "continuation\n", CyclePath);
                        exit(1);
                }
                if (SigInfoFlag) {
                        if (DedupTotalRecords) {
                                humanize_unsigned(buf1, sizeof(buf1),
                                                  DedupDataReads,
                                                  "B", 1024);
                                humanize_unsigned(buf2, sizeof(buf2),
                                                  dedup_successes_bytes,
                                                  "B", 1024);
                                fprintf(stderr, "%s count %7jd/%jd "
                                                "(%02d.%02d%%) "
                                                "ioread %s newddup %s\n",
                                        id,
                                        (intmax_t)DedupCurrentRecords,
                                        (intmax_t)DedupTotalRecords,
                                        (int)(DedupCurrentRecords * 100 /
                                                DedupTotalRecords),
                                        (int)(DedupCurrentRecords * 10000 /
                                                DedupTotalRecords % 100),
                                        buf1, buf2);
                        } else {
                                fprintf(stderr, "%s count %-7jd\n",
                                        id,
                                        (intmax_t)DedupCurrentRecords);
                        }
                        SigInfoFlag = 0;
                }
        } while (mirror.count != 0);

        signal(SIGINFO, SIG_IGN);
        signal(SIGALRM, SIG_IGN);

        free(buf);
}

static void
dump_simulated_dedup(void)
{
        struct sim_dedup_entry *sim_de;

        printf("=== Dumping simulated dedup entries:\n");
        RB_FOREACH(sim_de, sim_dedup_entry_rb_tree, &sim_dedup_tree) {
                printf("\tcrc=%08x cnt=%ju size=%ju\n",
                        sim_de->crc,
                        (intmax_t)sim_de->ref_blks,
                        (intmax_t)sim_de->ref_size);
        }
        printf("end of dump ===\n");
}

static void
dump_real_dedup(void)
{
        struct dedup_entry *de;
        struct sha_dedup_entry *sha_de;
        int i;

        printf("=== Dumping dedup entries:\n");
        RB_FOREACH(de, dedup_entry_rb_tree, &dedup_tree) {
                if (de->flags & HAMMER_DEDUP_ENTRY_FICTITIOUS) {
                        printf("\tcrc=%08x fictitious\n", de->leaf.data_crc);

                        RB_FOREACH(sha_de, sha_dedup_entry_rb_tree, &de->u.fict_root) {
                                printf("\t\tcrc=%08x cnt=%ju size=%ju\n\t"
                                       "\t\tsha=",
                                       sha_de->leaf.data_crc,
                                       (intmax_t)sha_de->ref_blks,
                                       (intmax_t)sha_de->ref_size);
                                for (i = 0; i < SHA256_DIGEST_LENGTH; ++i)
                                        printf("%02x", sha_de->sha_hash[i]);
                                printf("\n");
                        }
                } else {
                        printf("\tcrc=%08x cnt=%ju size=%ju\n",
                               de->leaf.data_crc,
                               (intmax_t)de->u.de.ref_blks,
                               (intmax_t)de->u.de.ref_size);
                }
        }
        printf("end of dump ===\n");
}

static void
dedup_usage(int code)
{
        fprintf(stderr,
                "hammer dedup-simulate <filesystem>\n"
                "hammer dedup <filesystem>\n"
        );
        exit(code);
}