backends/brass/brass_compact.cc

Go to the documentation of this file.

/* Copyright (C) 2004,2005,2006,2007,2008,2009,2010 Olly Betts
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation; either version 2 of the
 * License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301
 * USA
 */

#include <config.h>

#include <xapian/compactor.h>

#include <algorithm>
#include <queue>

#include <cstdio>

#include "safeerrno.h"
#include <sys/types.h>
#include "safesysstat.h"

#include "brass_table.h"
#include "brass_compact.h"
#include "brass_cursor.h"
#include "internaltypes.h"
#include "pack.h"
#include "utils.h"
#include "valuestats.h"

#include "../byte_length_strings.h"
#include "../prefix_compressed_strings.h"
#include <xapian.h>

using namespace std;

// Put all the helpers in a namespace to avoid symbols colliding with those of
// the same name in flint_compact.cc.
namespace BrassCompact {

static inline bool
is_metainfo_key(const string & key)
{
    return key.size() == 1 && key[0] == '\0';
}

static inline bool
is_user_metadata_key(const string & key)
{
    return key.size() > 1 && key[0] == '\0' && key[1] == '\xc0';
}

static inline bool
is_valuestats_key(const string & key)
{
    return key.size() > 1 && key[0] == '\0' && key[1] == '\xd0';
}

static inline bool
is_valuechunk_key(const string & key)
{
    return key.size() > 1 && key[0] == '\0' && key[1] == '\xd8';
}

static inline bool
is_doclenchunk_key(const string & key)
{
    return key.size() > 1 && key[0] == '\0' && key[1] == '\xe0';
}

class PostlistCursor : private BrassCursor {
    Xapian::docid offset;

  public:
    string key, tag;
    Xapian::docid firstdid;
    Xapian::termcount tf, cf;

    PostlistCursor(BrassTable *in, Xapian::docid offset_)
        : BrassCursor(in), offset(offset_), firstdid(0)
    {
        find_entry(string());
        next();
    }

    ~PostlistCursor()
    {
        delete BrassCursor::get_table();
    }

    bool next() {
        if (!BrassCursor::next()) return false;
        // We put all chunks into the non-initial chunk form here, then fix up
        // the first chunk for each term in the merged database as we merge.
        read_tag();
        key = current_key;
        tag = current_tag;
        tf = cf = 0;
        if (is_metainfo_key(key)) return true;
        if (is_user_metadata_key(key)) return true;
        if (is_valuestats_key(key)) return true;
        if (is_valuechunk_key(key)) {
            const char * p = key.data();
            const char * end = p + key.length();
            p += 2;
            Xapian::valueno slot;
            if (!unpack_uint(&p, end, &slot))
                throw Xapian::DatabaseCorruptError("bad value key");
            Xapian::docid did;
            if (!unpack_uint_preserving_sort(&p, end, &did))
                throw Xapian::DatabaseCorruptError("bad value key");
            did += offset;

            key.assign("\0\xd8", 2);
            pack_uint(key, slot);
            pack_uint_preserving_sort(key, did);
            return true;
        }

        // Adjust key if this is *NOT* an initial chunk.
        // key is: pack_string_preserving_sort(key, tname)
        // plus optionally: pack_uint_preserving_sort(key, did)
        const char * d = key.data();
        const char * e = d + key.size();
        if (is_doclenchunk_key(key)) {
            d += 2;
        } else {
            string tname;
            if (!unpack_string_preserving_sort(&d, e, tname))
                throw Xapian::DatabaseCorruptError("Bad postlist key");
        }

        if (d == e) {
            // This is an initial chunk for a term, so adjust tag header.
            d = tag.data();
            e = d + tag.size();
            if (!unpack_uint(&d, e, &tf) ||
                !unpack_uint(&d, e, &cf) ||
                !unpack_uint(&d, e, &firstdid)) {
                throw Xapian::DatabaseCorruptError("Bad postlist key");
            }
            ++firstdid;
            tag.erase(0, d - tag.data());
        } else {
            // Not an initial chunk, so adjust key.
            size_t tmp = d - key.data();
            if (!unpack_uint_preserving_sort(&d, e, &firstdid) || d != e)
                throw Xapian::DatabaseCorruptError("Bad postlist key");
            if (is_doclenchunk_key(key)) {
                key.erase(tmp);
            } else {
                key.erase(tmp - 1);
            }
        }
        firstdid += offset;
        return true;
    }
};

class PostlistCursorGt {
  public:
    bool operator()(const PostlistCursor *a, const PostlistCursor *b) {
        if (a->key > b->key) return true;
        if (a->key != b->key) return false;
        return (a->firstdid > b->firstdid);
    }
};

static string
encode_valuestats(Xapian::doccount freq,
                  const string & lbound, const string & ubound)
{
    string value;
    pack_uint(value, freq);
    pack_string(value, lbound);
    // We don't store or count empty values, so neither of the bounds
    // can be empty.  So we can safely store an empty upper bound when
    // the bounds are equal.
    if (lbound != ubound) value += ubound;
    return value;
}

static void
merge_postlists(Xapian::Compactor & compactor,
                BrassTable * out, vector<Xapian::docid>::const_iterator offset,
                vector<string>::const_iterator b,
                vector<string>::const_iterator e,
                Xapian::docid last_docid)
{
    totlen_t tot_totlen = 0;
    Xapian::termcount doclen_lbound = static_cast<Xapian::termcount>(-1);
    Xapian::termcount wdf_ubound = 0;
    Xapian::termcount doclen_ubound = 0;
    priority_queue<PostlistCursor *, vector<PostlistCursor *>, PostlistCursorGt> pq;
    for ( ; b != e; ++b, ++offset) {
        BrassTable *in = new BrassTable("postlist", *b, true);
        in->open();
        if (in->empty()) {
            // Skip empty tables.
            delete in;
            continue;
        }

        // PostlistCursor takes ownership of BrassTable in and is
        // responsible for deleting it.
        PostlistCursor * cur = new PostlistCursor(in, *offset);
        // Merge the METAINFO tags from each database into one.
        // They have a key consisting of a single zero byte.
        // They may be absent, if the database contains no documents.  If it
        // has user metadata we'll still get here.
        if (is_metainfo_key(cur->key)) {
            const char * data = cur->tag.data();
            const char * end = data + cur->tag.size();
            Xapian::docid dummy_did = 0;
            if (!unpack_uint(&data, end, &dummy_did)) {
                throw Xapian::DatabaseCorruptError("Tag containing meta information is corrupt.");
            }

            Xapian::termcount doclen_lbound_tmp;
            if (!unpack_uint(&data, end, &doclen_lbound_tmp)) {
                throw Xapian::DatabaseCorruptError("Tag containing meta information is corrupt.");
            }
            doclen_lbound = min(doclen_lbound, doclen_lbound_tmp);

            Xapian::termcount wdf_ubound_tmp;
            if (!unpack_uint(&data, end, &wdf_ubound_tmp)) {
                throw Xapian::DatabaseCorruptError("Tag containing meta information is corrupt.");
            }
            wdf_ubound = max(wdf_ubound, wdf_ubound_tmp);

            Xapian::termcount doclen_ubound_tmp;
            if (!unpack_uint(&data, end, &doclen_ubound_tmp)) {
                throw Xapian::DatabaseCorruptError("Tag containing meta information is corrupt.");
            }
            doclen_ubound_tmp += wdf_ubound_tmp;
            doclen_ubound = max(doclen_ubound, doclen_ubound_tmp);

            totlen_t totlen = 0;
            if (!unpack_uint_last(&data, end, &totlen)) {
                throw Xapian::DatabaseCorruptError("Tag containing meta information is corrupt.");
            }
            tot_totlen += totlen;
            if (tot_totlen < totlen) {
                throw "totlen wrapped!";
            }
        }
        if (cur->next()) {
            pq.push(cur);
        } else {
            delete cur;
        }
    }

    {
        string tag;
        pack_uint(tag, last_docid);
        pack_uint(tag, doclen_lbound);
        pack_uint(tag, wdf_ubound);
        pack_uint(tag, doclen_ubound - wdf_ubound);
        pack_uint_last(tag, tot_totlen);
        out->add(string(1, '\0'), tag);
    }

    string last_key;
    {
        // Merge user metadata.
        vector<string> tags;
        while (!pq.empty()) {
            PostlistCursor * cur = pq.top();
            const string& key = cur->key;
            if (!is_user_metadata_key(key)) break;

            if (key != last_key) {
                if (tags.size() > 1) {
                    Assert(!last_key.empty());
                    out->add(last_key,
                             compactor.resolve_duplicate_metadata(last_key,
                                                                  tags.size(),
                                                                  &tags[0]));
                } else if (tags.size() == 1) {
                    Assert(!last_key.empty());
                    out->add(last_key, tags[0]);
                }
                tags.resize(0);
                last_key = key;
            }
            tags.push_back(cur->tag);

            pq.pop();
            if (cur->next()) {
                pq.push(cur);
            } else {
                delete cur;
            }
        }
        if (tags.size() > 1) {
            Assert(!last_key.empty());
            out->add(last_key,
                     compactor.resolve_duplicate_metadata(last_key,
                                                          tags.size(),
                                                          &tags[0]));
        } else if (tags.size() == 1) {
            Assert(!last_key.empty());
            out->add(last_key, tags[0]);
        }
    }

    {
        // Merge valuestats.
        Xapian::doccount freq = 0;
        string lbound, ubound;

        string last_tag;
        while (!pq.empty()) {
            PostlistCursor * cur = pq.top();
            const string& key = cur->key;
            if (!is_valuestats_key(key)) break;
            if (key != last_key) {
                // For the first valuestats key, last_key will be the previous
                // key we wrote, which we don't want to overwrite.  This is the
                // only time that freq will be 0, so check that.
                if (freq) {
                    out->add(last_key, encode_valuestats(freq, lbound, ubound));
                    freq = 0;
                }
                last_key = key;
            }

            const string & tag = cur->tag;

            const char * pos = tag.data();
            const char * end = pos + tag.size();

            Xapian::doccount f;
            string l, u;
            if (!unpack_uint(&pos, end, &f)) {
                if (*pos == 0) throw Xapian::DatabaseCorruptError("Incomplete stats item in value table");
                throw Xapian::RangeError("Frequency statistic in value table is too large");
            }
            if (!unpack_string(&pos, end, l)) {
                if (*pos == 0) throw Xapian::DatabaseCorruptError("Incomplete stats item in value table");
                throw Xapian::RangeError("Lower bound in value table is too large");
            }
            size_t len = end - pos;
            if (len == 0) {
                u = l;
            } else {
                u.assign(pos, len);
            }
            if (freq == 0) {
                freq = f;
                lbound = l;
                ubound = u;
            } else {
                freq += f;
                if (l < lbound) lbound = l;
                if (u > ubound) ubound = u;
            }

            pq.pop();
            if (cur->next()) {
                pq.push(cur);
            } else {
                delete cur;
            }
        }

        if (freq) {
            out->add(last_key, encode_valuestats(freq, lbound, ubound));
        }
    }

    // Merge valuestream chunks.
    while (!pq.empty()) {
        PostlistCursor * cur = pq.top();
        const string & key = cur->key;
        if (!is_valuechunk_key(key)) break;
        Assert(!is_user_metadata_key(key));
        out->add(key, cur->tag);
        pq.pop();
        if (cur->next()) {
            pq.push(cur);
        } else {
            delete cur;
        }
    }

    Xapian::termcount tf = 0, cf = 0; // Initialise to avoid warnings.
    vector<pair<Xapian::docid, string> > tags;
    while (true) {
        PostlistCursor * cur = NULL;
        if (!pq.empty()) {
            cur = pq.top();
            pq.pop();
        }
        Assert(cur == NULL || !is_user_metadata_key(cur->key));
        if (cur == NULL || cur->key != last_key) {
            if (!tags.empty()) {
                string first_tag;
                pack_uint(first_tag, tf);
                pack_uint(first_tag, cf);
                pack_uint(first_tag, tags[0].first - 1);
                string tag = tags[0].second;
                tag[0] = (tags.size() == 1) ? '1' : '0';
                first_tag += tag;
                out->add(last_key, first_tag);

                string term;
                if (!is_doclenchunk_key(last_key)) {
                    const char * p = last_key.data();
                    const char * end = p + last_key.size();
                    if (!unpack_string_preserving_sort(&p, end, term) || p != end)
                        throw Xapian::DatabaseCorruptError("Bad postlist chunk key");
                }

                vector<pair<Xapian::docid, string> >::const_iterator i;
                i = tags.begin();
                while (++i != tags.end()) {
                    tag = i->second;
                    tag[0] = (i + 1 == tags.end()) ? '1' : '0';
                    out->add(pack_brass_postlist_key(term, i->first), tag);
                }
            }
            tags.clear();
            if (cur == NULL) break;
            tf = cf = 0;
            last_key = cur->key;
        }
        tf += cur->tf;
        cf += cur->cf;
        tags.push_back(make_pair(cur->firstdid, cur->tag));
        if (cur->next()) {
            pq.push(cur);
        } else {
            delete cur;
        }
    }
}

struct MergeCursor : public BrassCursor {
    MergeCursor(BrassTable *in) : BrassCursor(in) {
        find_entry(string());
        next();
    }

    ~MergeCursor() {
        delete BrassCursor::get_table();
    }
};

struct CursorGt {
    bool operator()(const BrassCursor *a, const BrassCursor *b) {
        if (b->after_end()) return false;
        if (a->after_end()) return true;
        return (a->current_key > b->current_key);
    }
};

static void
merge_spellings(BrassTable * out,
                vector<string>::const_iterator b,
                vector<string>::const_iterator e)
{
    priority_queue<MergeCursor *, vector<MergeCursor *>, CursorGt> pq;
    for ( ; b != e; ++b) {
        BrassTable *in = new BrassTable("spelling", *b, true, DONT_COMPRESS, true);
        in->open();
        if (!in->empty()) {
            // The MergeCursor takes ownership of BrassTable in and is
            // responsible for deleting it.
            pq.push(new MergeCursor(in));
        } else {
            delete in;
        }
    }

    while (!pq.empty()) {
        MergeCursor * cur = pq.top();
        pq.pop();

        string key = cur->current_key;
        if (pq.empty() || pq.top()->current_key > key) {
            // No need to merge the tags, just copy the (possibly compressed)
            // tag value.
            bool compressed = cur->read_tag(true);
            out->add(key, cur->current_tag, compressed);
            if (cur->next()) {
                pq.push(cur);
            } else {
                delete cur;
            }
            continue;
        }

        // Merge tag values with the same key:
        string tag;
        if (key[0] != 'W') {
            // We just want the union of words, so copy over the first instance
            // and skip any identical ones.
            priority_queue<PrefixCompressedStringItor *,
                           vector<PrefixCompressedStringItor *>,
                           PrefixCompressedStringItorGt> pqtag;
            // Stick all the MergeCursor pointers in a vector because their
            // current_tag members must remain valid while we're merging their
            // tags, but we need to call next() on them all afterwards.
            vector<MergeCursor *> vec;
            vec.reserve(pq.size());

            while (true) {
                cur->read_tag();
                pqtag.push(new PrefixCompressedStringItor(cur->current_tag));
                vec.push_back(cur);
                if (pq.empty() || pq.top()->current_key != key) break;
                cur = pq.top();
                pq.pop();
            }

            PrefixCompressedStringWriter wr(tag);
            string lastword;
            while (!pqtag.empty()) {
                PrefixCompressedStringItor * it = pqtag.top();
                string word = **it;
                if (word != lastword) {
                    lastword = word;
                    wr.append(lastword);
                }
                ++*it;
                pqtag.pop();
                if (!it->at_end()) {
                    pqtag.push(it);
                } else {
                    delete it;
                }
            }

            vector<MergeCursor *>::const_iterator i;
            for (i = vec.begin(); i != vec.end(); ++i) {
                cur = *i;
                if (cur->next()) {
                    pq.push(cur);
                } else {
                    delete cur;
                }
            }
        } else {
            // We want to sum the frequencies from tags for the same key.
            Xapian::termcount tot_freq = 0;
            while (true) {
                cur->read_tag();
                Xapian::termcount freq;
                const char * p = cur->current_tag.data();
                const char * end = p + cur->current_tag.size();
                if (!unpack_uint_last(&p, end, &freq) || freq == 0) {
                    throw Xapian::DatabaseCorruptError("Bad spelling word freq");
                }
                tot_freq += freq;
                if (cur->next()) {
                    pq.push(cur);
                } else {
                    delete cur;
                }
                if (pq.empty() || pq.top()->current_key != key) break;
                cur = pq.top();
                pq.pop();
            }
            tag.resize(0);
            pack_uint_last(tag, tot_freq);
        }
        out->add(key, tag);
    }
}

static void
merge_synonyms(BrassTable * out,
               vector<string>::const_iterator b,
               vector<string>::const_iterator e)
{
    priority_queue<MergeCursor *, vector<MergeCursor *>, CursorGt> pq;
    for ( ; b != e; ++b) {
        BrassTable *in = new BrassTable("synonym", *b, true, DONT_COMPRESS, true);
        in->open();
        if (!in->empty()) {
            // The MergeCursor takes ownership of BrassTable in and is
            // responsible for deleting it.
            pq.push(new MergeCursor(in));
        } else {
            delete in;
        }
    }

    while (!pq.empty()) {
        MergeCursor * cur = pq.top();
        pq.pop();

        string key = cur->current_key;
        if (pq.empty() || pq.top()->current_key > key) {
            // No need to merge the tags, just copy the (possibly compressed)
            // tag value.
            bool compressed = cur->read_tag(true);
            out->add(key, cur->current_tag, compressed);
            if (cur->next()) {
                pq.push(cur);
            } else {
                delete cur;
            }
            continue;
        }

        // Merge tag values with the same key:
        string tag;

        // We just want the union of words, so copy over the first instance
        // and skip any identical ones.
        priority_queue<ByteLengthPrefixedStringItor *,
                       vector<ByteLengthPrefixedStringItor *>,
                       ByteLengthPrefixedStringItorGt> pqtag;
        vector<MergeCursor *> vec;

        while (true) {
            cur->read_tag();
            pqtag.push(new ByteLengthPrefixedStringItor(cur->current_tag));
            vec.push_back(cur);
            if (pq.empty() || pq.top()->current_key != key) break;
            cur = pq.top();
            pq.pop();
        }

        string lastword;
        while (!pqtag.empty()) {
            ByteLengthPrefixedStringItor * it = pqtag.top();
            if (**it != lastword) {
                lastword = **it;
                tag += byte(lastword.size() ^ MAGIC_XOR_VALUE);
                tag += lastword;
            }
            ++*it;
            pqtag.pop();
            if (!it->at_end()) {
                pqtag.push(it);
            } else {
                delete it;
            }
        }

        vector<MergeCursor *>::const_iterator i;
        for (i = vec.begin(); i != vec.end(); ++i) {
            cur = *i;
            if (cur->next()) {
                pq.push(cur);
            } else {
                delete cur;
            }
        }

        out->add(key, tag);
    }
}

static void
multimerge_postlists(Xapian::Compactor & compactor,
                     BrassTable * out, const char * tmpdir,
                     Xapian::docid last_docid,
                     vector<string> tmp, vector<Xapian::docid> off)
{
    unsigned int c = 0;
    while (tmp.size() > 3) {
        vector<string> tmpout;
        tmpout.reserve(tmp.size() / 2);
        vector<Xapian::docid> newoff;
        newoff.resize(tmp.size() / 2);
        for (unsigned int i = 0, j; i < tmp.size(); i = j) {
            j = i + 2;
            if (j == tmp.size() - 1) ++j;

            string dest = tmpdir;
            char buf[64];
            sprintf(buf, "/tmp%u_%u.", c, i / 2);
            dest += buf;

            // Don't compress temporary tables, even if the final table would
            // be.
            BrassTable tmptab("postlist", dest, false);
            // Use maximum blocksize for temporary tables.
            tmptab.create_and_open(65536);

            merge_postlists(compactor, &tmptab, off.begin() + i,
                            tmp.begin() + i, tmp.begin() + j, 0);
            if (c > 0) {
                for (unsigned int k = i; k < j; ++k) {
                    unlink((tmp[k] + "DB").c_str());
                    unlink((tmp[k] + "baseA").c_str());
                    unlink((tmp[k] + "baseB").c_str());
                }
            }
            tmpout.push_back(dest);
            tmptab.flush_db();
            tmptab.commit(1);
        }
        swap(tmp, tmpout);
        swap(off, newoff);
        ++c;
    }
    merge_postlists(compactor,
                    out, off.begin(), tmp.begin(), tmp.end(), last_docid);
    if (c > 0) {
        for (size_t k = 0; k < tmp.size(); ++k) {
            unlink((tmp[k] + "DB").c_str());
            unlink((tmp[k] + "baseA").c_str());
            unlink((tmp[k] + "baseB").c_str());
        }
    }
}

static void
merge_docid_keyed(const char * tablename,
                  BrassTable *out, const vector<string> & inputs,
                  const vector<Xapian::docid> & offset, bool lazy)
{
    for (size_t i = 0; i < inputs.size(); ++i) {
        Xapian::docid off = offset[i];

        BrassTable in(tablename, inputs[i], true, DONT_COMPRESS, lazy);
        in.open();
        if (in.empty()) continue;

        BrassCursor cur(&in);
        cur.find_entry(string());

        string key;
        while (cur.next()) {
            // Adjust the key if this isn't the first database.
            if (off) {
                Xapian::docid did;
                const char * d = cur.current_key.data();
                const char * e = d + cur.current_key.size();
                if (!unpack_uint_preserving_sort(&d, e, &did)) {
                    string msg = "Bad key in ";
                    msg += inputs[i];
                    throw Xapian::DatabaseCorruptError(msg);
                }
                did += off;
                key.resize(0);
                pack_uint_preserving_sort(key, did);
                if (d != e) {
                    // Copy over the termname for the position table.
                    key.append(d, e - d);
                }
            } else {
                key = cur.current_key;
            }
            bool compressed = cur.read_tag(true);
            out->add(key, cur.current_tag, compressed);
        }
    }
}

}

using namespace BrassCompact;

void
compact_brass(Xapian::Compactor & compactor,
              const char * destdir, const vector<string> & sources,
              const vector<Xapian::docid> & offset, size_t block_size,
              Xapian::Compactor::compaction_level compaction, bool multipass,
              Xapian::docid last_docid) {
    enum table_type {
        POSTLIST, RECORD, TERMLIST, POSITION, VALUE, SPELLING, SYNONYM
    };
    struct table_list {
        // The "base name" of the table.
        const char * name;
        // The type.
        table_type type;
        // zlib compression strategy to use on tags.
        int compress_strategy;
        // Create tables after position lazily.
        bool lazy;
    };

    static const table_list tables[] = {
        // name         type            compress_strategy       lazy
        { "postlist",   POSTLIST,       DONT_COMPRESS,          false },
        { "record",     RECORD,         Z_DEFAULT_STRATEGY,     false },
        { "termlist",   TERMLIST,       Z_DEFAULT_STRATEGY,     false },
        { "position",   POSITION,       DONT_COMPRESS,          true },
        { "spelling",   SPELLING,       Z_DEFAULT_STRATEGY,     true },
        { "synonym",    SYNONYM,        Z_DEFAULT_STRATEGY,     true }
    };
    const table_list * tables_end = tables +
        (sizeof(tables) / sizeof(tables[0]));

    for (const table_list * t = tables; t < tables_end; ++t) {
        // The postlist table requires an N-way merge, adjusting the
        // headers of various blocks.  The spelling and synonym tables also
        // need special handling.  The other tables have keys sorted in
        // docid order, so we can merge them by simply copying all the keys
        // from each source table in turn.
        compactor.set_status(t->name, string());

        string dest = destdir;
        dest += '/';
        dest += t->name;
        dest += '.';

        bool output_will_exist = !t->lazy;

        // Sometimes stat can fail for benign reasons (e.g. >= 2GB file
        // on certain systems).
        bool bad_stat = false;

        off_t in_size = 0;

        vector<string> inputs;
        inputs.reserve(sources.size());
        size_t inputs_present = 0;
        for (vector<string>::const_iterator src = sources.begin();
             src != sources.end(); ++src) {
            string s(*src);
            s += t->name;
            s += '.';

            struct stat sb;
            if (stat(s + "DB", &sb) == 0) {
                in_size += sb.st_size / 1024;
                output_will_exist = true;
                ++inputs_present;
            } else if (errno != ENOENT) {
                // We get ENOENT for an optional table.
                bad_stat = true;
                output_will_exist = true;
                ++inputs_present;
            }
            inputs.push_back(s);
        }

        // If any inputs lack a termlist table, suppress it in the output.
        if (t->type == TERMLIST && inputs_present != sources.size()) {
            if (inputs_present != 0) {
                string m = str(inputs_present);
                m += " of ";
                m += str(sources.size());
                m += " inputs present, so suppressing output";
                compactor.set_status(t->name, m);
                continue;
            }
            output_will_exist = false;
        }

        if (!output_will_exist) {
            compactor.set_status(t->name, "doesn't exist");
            continue;
        }

        BrassTable out(t->name, dest, false, t->compress_strategy, t->lazy);
        if (!t->lazy) {
            out.create_and_open(block_size);
        } else {
            out.erase();
            out.set_block_size(block_size);
        }

        out.set_full_compaction(compaction != compactor.STANDARD);
        if (compaction == compactor.FULLER) out.set_max_item_size(1);

        switch (t->type) {
            case POSTLIST:
                if (multipass && inputs.size() > 3) {
                    multimerge_postlists(compactor, &out, destdir, last_docid,
                                         inputs, offset);
                } else {
                    merge_postlists(compactor, &out, offset.begin(),
                                    inputs.begin(), inputs.end(),
                                    last_docid);
                }
                break;
            case SPELLING:
                merge_spellings(&out, inputs.begin(), inputs.end());
                break;
            case SYNONYM:
                merge_synonyms(&out, inputs.begin(), inputs.end());
                break;
            default:
                // Position, Record, Termlist
                merge_docid_keyed(t->name, &out, inputs, offset, t->lazy);
                break;
        }

        // Commit as revision 1.
        out.flush_db();
        out.commit(1);

        off_t out_size = 0;
        if (!bad_stat) {
            struct stat sb;
            if (stat(dest + "DB", &sb) == 0) {
                out_size = sb.st_size / 1024;
            } else {
                bad_stat = (errno != ENOENT);
            }
        }
        if (bad_stat) {
            compactor.set_status(t->name, "Done (couldn't stat all the DB files)");
        } else {
            string status;
            if (out_size == in_size) {
                status = "Size unchanged (";
            } else {
                off_t delta;
                if (out_size < in_size) {
                    delta = in_size - out_size;
                    status = "Reduced by ";
                } else {
                    delta = out_size - in_size;
                    status = "INCREASED by ";
                }
                status += str(100 * delta / in_size);
                status += "% ";
                status += str(delta);
                status += "K (";
                status += str(in_size);
                status += "K -> ";
            }
            status += str(out_size);
            status += "K)";
            compactor.set_status(t->name, status);
        }
    }
}

---