/*==============================================================================
*
*                            PUBLIC DOMAIN NOTICE
*               National Center for Biotechnology Information
*
*  This software/database is a "United States Government Work" under the
*  terms of the United States Copyright Act.  It was written as part of
*  the author's official duties as a United States Government employee and
*  thus cannot be copyrighted.  This software/database is freely available
*  to the public for use. The National Library of Medicine and the U.S.
*  Government have not placed any restriction on its use or reproduction.
*
*  Although all reasonable efforts have been taken to ensure the accuracy
*  and reliability of the software and data, the NLM and the U.S.
*  Government do not and cannot warrant the performance or results that
*  may be obtained by using this software or data. The NLM and the U.S.
*  Government disclaim all warranties, express or implied, including
*  warranties of performance, merchantability or fitness for any particular
*  purpose.
*
*  Please cite the author in any work or product based on this material.
*
* ===========================================================================
*/
#include <align/extern.h>

#include <klib/log.h>
#include <klib/rc.h>
#include <klib/sort.h>
#include <klib/data-buffer.h>
#include <klib/container.h>
#include <klib/checksum.h>
#include <klib/text.h>
#include <kfs/mmap.h>
#include <kfs/file.h>
#include <kdb/manager.h>
#include <vdb/database.h>
#include <vdb/table.h>
#include <vdb/cursor.h>
#include <vdb/manager.h>
#include <vdb/vdb-priv.h>
#include <sra/sradb.h>

#include <align/writer-reference.h>
#include <align/writer-refseq.h>
#include <align/refseq-mgr.h>
#include <align/align.h>
#include "refseq-mgr-priv.h"
#include "writer-ref.h"
#include "reader-cmn.h"
#include "reference-cmn.h"
#include "debug.h"
#include <os-native.h>
#include <sysalloc.h>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <assert.h>

/*
 * ReferenceSeq objects:
 *  ReferenceSeq objects may be unattached, i.e. they might not yet represent an
 *  actual sequence.
 *
 *  ReferenceSeq objects may be attached, i.e. they represent a sequence from
 *  either RefSeq or a fasta file.
 *
 *  A ReferenceSeq object may be refered to by more than one id, but a
 *  ReferenceSeq object has only one canonical id.
 *
 *  More than one ReferenceSeq object may be associated with the same seqId.
 *
 *  More than one ReferenceSeq object may be attached to the same sequence.
 *  This will cause the REFERENCE table to have more than one copy of the
 *  sequence.
 *
 *  ReferenceSeq objects may be created from the config file.  These objects
 *  will have an id, a seqId, but no fastaSeqId.  These are unattached.
 *
 *  ReferenceSeq objects may be created from explicit fasta files.  These
 *  objects will have a fastaSeqId, but *** NO id OR seqId ***. These are
 *  attached.
 *
 *  ReferenceSeq objects may be created on the fly by requesting an id that
 *  isn't already in the collection.  These objects will have the requested id.
 *
 * When a reference is requested (by id):
 *  Resolve the id to a ReferenceSeq object.
 *  If the object is unattached, attach it to a sequence.
 *  If the sequence is not yet written to the REFERENCE table, write it to the
 *  REFERENCE table.  NAME gets id; SEQID gets seqId unless seqId is null, then
 *  SEQID gets id.
 *
 * Resolving id's to ReferenceSeq objects:
 *  Search the id index and if the found object is attached, return it.
 *  Search the identifiers in the fastaSeqIds or seqIds.
 *  If different objects were found from both searches, use sequence length and
 *  MD5 to break the tie (if both match then use RefSeq).  If no sequence length
 *  or MD5 then fail.
 *  If no objects were found from either search, then create a new unattached
 *  ReferenceSeq object.
 *  If the object's id is null, set it to the id.
 *  It the object was not found in the id index, add it.
 *
 * Attaching ReferenceSeq objects to sequences:
 *  Search RefSeq for seqId.
 *  Else search RefSeq for id.
 *  Else search for seqId in the loaded fasta files.
 *  Else search data directory for id.fasta or id.fa; load it or fail.
 *  Else search data directory for seqId.fasta or seqId.fa; load it or fail.
 *  Else fail.
 *  If failed, mark the object as dead.
 *
 *
 *
 * Config file:
 *  The config file consists of lines containing whitespace (preferably tab)
 *  seperated fields.  The fields are:
 *      NAME (unique)
 *      SEQID
 *      extra (optional)
 *
 *  There is one ReferenceSeq object created per record in the config file.
 *  NAME is stored in id; SEQID is stored in seqId; if extra contains the word
 *  'circular' (case-insensitive), true is stored in circular.  These
 *  ReferenceSeq object are created in the unattached state, i.e. not attached
 *  to a fasta file or a RefSeq library object.
 *
 *  If SEQID is equal to UNMAPPED_SEQID_VALUE (see below) the Reference will be
 *  considered to be unmapped.
 *
 * Fasta files:
 *  Fasta file consists of one of more sequences.  A sequence in a fasta file
 *  consists of a seqid line followed by lines containing the bases of the
 *  sequence.  A seqid line starts with '>' and the next word (whitespace
 *  delimited) is the seqid.  The seqid may consist of '|' delimited identifiers
 *  (this is purposely vague).  The fasta seqid is stored in fastaSeqId.
 *
 * Fasta files may be loaded explicitly:
 *  When a fasta file is loaded explicitly, a new ReferenceSeq object is created
 *  (with id == NULL) for each sequence found in the file.
 *
 * Fasta files may be loaded implicitly:
 *  When an id can't be found in the set of ReferenceSeq objects and can't be
 *  found as an accession by RefSeq, an attempt is made to load a fasta file
 *  named <id>.fasta or <id>.fa in the directory given to the constructor.  If
 *  this succeeds, a new ReferenceSeq object with the given id is attached to
 *  the sequence.  In this situation, to avoid ambiquity, there can be only one
 *  sequence in the fasta file.
 *
 */

#define UNMAPPED_SEQID_VALUE "*UNMAPPED"

enum ReferenceSeqType {
    rst_unattached,
    rst_local,
    rst_refSeqById,
    rst_refSeqBySeqId,
    rst_unmapped,
    rst_renamed,
    rst_dead
};

struct ReferenceSeq {
    ReferenceMgr *mgr;
    char *id;
    char *seqId;
    char *fastaSeqId;

    char **used;
    unsigned num_used;
    
    /* ref table position */
    int64_t start_rowid;
    /* total reference length */
    INSDC_coord_len seq_len;
    int type;
    bool circular;
    uint8_t md5[16];
    union {
        struct {
            KDataBuffer buf;
            uint8_t const *data;
        } local;
        RefSeq const *refseq;
    } u;
};

#define BUCKET_BITS (12U)
#define BUCKETS (1U << BUCKET_BITS)
#define BUCKET_MASK (BUCKETS - 1U)

typedef struct {
    unsigned count;
    unsigned *index;
} Bucket;

typedef struct {
    int length, type;
} compress_buffer_t;

struct ReferenceMgr {
    TableWriterRef const *writer;
    KDirectory const *dir;
    RefSeqMgr const *rmgr;
    VDatabase *db;
    ReferenceSeq *refSeq;       /* == refSeqs.base      */
    
    int64_t ref_rowid;
    
    size_t cache;
    
    uint32_t options;
    uint32_t num_open_max;
    uint32_t num_open;
    uint32_t max_seq_len;
    
    KDataBuffer compress;       /* [compress_buffer_t]  */
    KDataBuffer seq;            /* [byte](max_seq_len)  */
    KDataBuffer refSeqs;        /* [ReferenceSeq]       */

    Bucket used[BUCKETS];
    Bucket ht[BUCKETS];
};

static unsigned hash(unsigned const length, char const key[])
{
    /* FNV-1a hash with folding */
    uint64_t h = 0xcbf29ce484222325ull;
    unsigned i;
    
    for (i = 0; i < length; ++i) {
        int const ch = key[i];
        uint64_t const octet = (uint8_t)toupper(ch);

        h = (h ^ octet) * 0x100000001b3ull;
    }
    return (unsigned)(((h ^ (h >> 32))) & ((uint64_t)BUCKET_MASK));
}

static unsigned hash0(char const key[])
{
    /* FNV-1a hash with folding */
    uint64_t h = 0xcbf29ce484222325ull;
    unsigned i;
    
    for (i = 0; ; ++i) {
        int const ch = key[i];
        if (ch != '\0') {
            uint64_t const octet = (uint8_t)toupper(ch);
            h = (h ^ octet) * 0x100000001b3ull;
            continue;
        }
        break;
    }
    return (unsigned)(((h ^ (h >> 32))) & ((uint64_t)BUCKET_MASK));
}

static void addToHashBucket(Bucket *const bucket, unsigned const index)
{
    unsigned i;
    void *tmp = NULL;
    
    for (i = 0; i < bucket->count; ++i) {
        if (bucket->index[i] == index)
            return;
    }
    
    tmp = realloc(bucket->index, (1 + bucket->count) * sizeof(bucket->index[0]));
    assert(tmp != NULL);
	if (tmp == NULL)
        abort();

    bucket->index = tmp;
    bucket->index[bucket->count++] = index;
}

static void addToHashTable(ReferenceMgr *const self, ReferenceSeq const *const rs)
{
    unsigned const index = rs - self->refSeq;
    
    if (rs->id)
        addToHashBucket(&self->ht[hash0(rs->id)], index);
    if (rs->seqId)
        addToHashBucket(&self->ht[hash0(rs->seqId)], index);
}

static
void CC ReferenceSeq_Whack(ReferenceSeq *self)
{
    unsigned i;
    
    for (i = 0; i < self->num_used; ++i)
        free(self->used[i]);

    if (self->type == rst_local) {
        KDataBufferWhack(&self->u.local.buf);
    }
    else if (self->type == rst_refSeqById || self->type == rst_refSeqBySeqId) {
        RefSeq_Release(self->u.refseq);
    }
    free(self->id);
    free(self->seqId);
    free(self->fastaSeqId);
    free(self->used);
}

struct OpenConfigFile_ctx {
    char const *name;
    KDirectory const *dir;
    KFile const **kfp;
    rc_t rc;
};

static
bool OpenConfigFile(char const server[], char const volume[], void *Ctx)
{
    struct OpenConfigFile_ctx *ctx = Ctx;
    KDirectory const *dir;
    
    if(volume == NULL) {
        ctx->rc = KDirectoryOpenDirRead(ctx->dir, &dir, false, "%s", server);
    } else {
        ctx->rc = KDirectoryOpenDirRead(ctx->dir, &dir, false, "%s/%s", server, volume);
    }
    if (ctx->rc == 0) {
        ctx->rc = KDirectoryOpenFileRead(dir, ctx->kfp, "%s", ctx->name);
        KDirectoryRelease(dir);
        if (ctx->rc == 0) {
            return true;
        }
    }
    return false;
}

static
rc_t FindAndOpenConfigFile(RefSeqMgr const *const rmgr,
                           KDirectory const *const dir,
                           KFile const **const kfp, char const conf[])
{
    rc_t rc = KDirectoryOpenFileRead(dir, kfp, "%s", conf);
    
    if (rc) {
        struct OpenConfigFile_ctx ctx;

        ctx.name = conf;
        ctx.dir = dir;
        ctx.kfp = kfp;
        ctx.rc = 0;
        
        rc = RefSeqMgr_ForEachVolume(rmgr, OpenConfigFile, &ctx);
        if (rc == 0 && *kfp == NULL) {
            rc = RC(rcAlign, rcIndex, rcConstructing, rcFile, rcNotFound);
        }
    }
    return rc;
}

enum comparison_weights {
    no_match        = 0,
    substring_match = (1u << 0),
    expected_prefix = (1u << 1),
    exact_match     = (1u << 2),
    seqId_match     = (1u << 3),
    id_match        = (1u << 4),
    seq_len_match   = (1u << 5),
    md5_match       = (1u << 6),
    attached        = (1u << 7)
};

static
unsigned str_weight(char const str[], char const qry[], unsigned const qry_len)
{
    char const *const fnd = strcasestr(str, qry);
    unsigned wt = no_match;
    
    if (fnd) {
        unsigned const fnd_len = (unsigned)string_size(fnd);
        unsigned const fndlen = (fnd_len > qry_len && fnd[qry_len] == '|') ? qry_len : fnd_len;
        
        if (fndlen == qry_len && (fnd == str || fnd[-1] == '|')) {
            wt |= substring_match;
            
            if (fnd == str) {
                if (fnd[fndlen] == '\0')
                    wt |= exact_match;
            }
            else {
                /* check for expected prefices */
                char const *ns = fnd - 1;
                
                while (ns != str && ns[-1] != '|')
                    --ns;
                
                if (   memcmp(ns, "ref|", 4) == 0
                    || memcmp(ns, "emb|", 4) == 0
                    || memcmp(ns, "dbj|", 4) == 0
                    || memcmp(ns, "tpg|", 4) == 0
                    || memcmp(ns, "tpe|", 4) == 0
                    || memcmp(ns, "tpd|", 4) == 0
                    || memcmp(ns, "gpp|", 4) == 0
                    || memcmp(ns,  "gb|", 3) == 0
                   )
                {
                    wt |= expected_prefix;
                }
            }
        }
    }
    return wt;
}

static void addToIndex(ReferenceMgr *const self, char const ID[],
                       ReferenceSeq *const rs)
{
    unsigned const n = rs->num_used;
    unsigned i;

    for (i = 0; i < n; ++i) {
        if (strcmp(ID, rs->used[i]) == 0)
            goto SKIP_INSERT_ID;
    }
    {
        unsigned const length = (unsigned)string_size(ID);
        char *id = string_dup(ID, length);
        void *tmp = realloc(rs->used, (n + 1) * sizeof(rs->used[0]));

        assert(tmp != NULL && id != NULL);
        if (tmp == NULL || id == NULL) abort();

        ++rs->num_used;
        rs->used = tmp;
        rs->used[n] = id;
    }
SKIP_INSERT_ID:
    addToHashBucket(&self->used[hash0(ID)], rs - self->refSeq);
}

static int findId(ReferenceMgr const *const self, char const id[])
{
    unsigned const hv = hash0(id);
    Bucket const *const bucket = &self->used[hv];
    unsigned const n = bucket->count;
    unsigned i;
    
    for (i = 0; i < n; ++i) {
        unsigned const index = bucket->index[i];
        ReferenceSeq const *rs = &self->refSeq[index];
        unsigned const m = rs->num_used;
        unsigned j;
        
        if (rs->type == rst_dead)
            continue;
        for (j = 0; j < m; ++j) {
            if (strcmp(id, rs->used[j]) == 0)
                return index;
        }
    }
    return -1;
}

static ReferenceSeq *newReferenceSeq(ReferenceMgr *const self, ReferenceSeq const *const template)
{
    unsigned const last_rs = (unsigned)self->refSeqs.elem_count;
    rc_t const rc = KDataBufferResize(&self->refSeqs, last_rs + 1);

    assert(rc == 0);
    if (rc) abort();

    self->refSeq = self->refSeqs.base;
    {
        ReferenceSeq *const rslt = &self->refSeq[last_rs];
        if (template)
            *rslt = *template;
        else
            memset(rslt, 0, sizeof(*rslt));
        rslt->mgr = self;
        return rslt;
    }
}

static
int64_t CC config_cmp(void const *A, void const *B, void *Data)
{
    struct {
        unsigned id;
        unsigned seqId;
        unsigned extra;
        unsigned extralen;
    } const *const a = A;
    struct {
        unsigned id;
        unsigned seqId;
        unsigned extra;
        unsigned extralen;
    } const *const b = B;
    char const *const data = Data;
    
    return strcmp(&data[a->id], &data[b->id]);
}

static
rc_t ReferenceMgr_ProcessConf(ReferenceMgr *const self, char Data[], unsigned const len)
{
    rc_t rc;
    unsigned i;
    unsigned j;
    struct {
        unsigned id;
        unsigned seqId;
        unsigned extra;
        unsigned extralen;
    } *data, tmp;
    KDataBuffer buf;
    
    memset(&buf, 0, sizeof(buf));
    buf.elem_bits = sizeof(data[0]) * 8;
    
    for (j = i = 0; i < len; ++j) {
        unsigned lineEnd;
        unsigned id;
        unsigned acc;
        unsigned ii;
        
        for (lineEnd = i; lineEnd != len; ++lineEnd) {
            int const ch = Data[lineEnd];
            
            if (ch == '\n')
                break;
            if (ch == '\r')
                break;
        }
        if (i == lineEnd) {
            ++i;
            continue;
        }
        Data[lineEnd] = '\0';
        for (id = i; id != lineEnd; ++id) {
            int const ch = Data[id];
            
            if (!isspace(ch))
                break;
        }
        for (ii = id; ii != lineEnd; ++ii) {
            int const ch = Data[ii];
            
            if (isspace(ch)) {
                Data[ii++] = '\0';
                break;
            }
        }
        for (acc = ii; acc < lineEnd; ++acc) {
            int const ch = Data[acc];
            
            if (!isspace(ch))
                break;
        }
        if (acc >= lineEnd)
            return RC(rcAlign, rcFile, rcReading, rcFormat, rcInvalid);
        
        for (ii = acc; ii != lineEnd; ++ii) {
            int const ch = Data[ii];
            
            if (isspace(ch)) {
                Data[ii++] = '\0';
                break;
            }
        }
        tmp.id = id;
        tmp.seqId = acc;
        tmp.extra = ii;
        tmp.extralen = lineEnd > ii ? lineEnd - ii : 0;
        
        if ((rc = KDataBufferResize(&buf, buf.elem_count + 1)) != 0) return rc;
        data = buf.base;
        
        data[buf.elem_count-1] = tmp;
        i = lineEnd + 1;
    }
    
    /* check unique */
    ksort(data, buf.elem_count, sizeof(data[0]), config_cmp, Data);
    for (i = 1; i < buf.elem_count; ++i) {
        if (strcmp(&Data[data[i-1].id], &Data[data[i].id]) == 0)
            return RC(rcAlign, rcIndex, rcConstructing, rcItem, rcExists);
    }

    for (i = 0; i != buf.elem_count; ++i) {
        unsigned const extralen = data[i].extralen;
        char const *const id    = &Data[data[i].id];
        char const *const seqId = &Data[data[i].seqId];
        char const *const extra = extralen ? &Data[data[i].extra] : NULL;
        bool circular = false;
        ReferenceSeq *rs;
        
        if (extra && extralen >= 8) {
            char const *const circ = strcasestr(extra, "circular");
            
            circular = circ && (circ == extra || isspace(circ[-1])) &&
                       (circ[8] == '\0' || isspace(circ[8]));
        }
        rs = newReferenceSeq(self, NULL);

        rs->id = string_dup(id, string_size(id));
        if (rs->id == NULL)
            return RC(rcAlign, rcFile, rcReading, rcMemory, rcExhausted);

        if (strcmp(seqId, UNMAPPED_SEQID_VALUE) == 0) {
            rs->type = rst_unmapped;
        }
        else {
            rs->seqId = string_dup(seqId, string_size(seqId));
            if (rs->seqId == NULL)
                return RC(rcAlign, rcFile, rcReading, rcMemory, rcExhausted);
        }
        rs->circular = circular;
        
        addToHashTable(self, rs);
    }
    KDataBufferWhack(&buf);
    return 0;
}

static
rc_t ReferenceMgr_Conf(ReferenceMgr *const self, char const conf[])
{
    rc_t rc;
    const KFile* kf = NULL;

    if (conf == NULL)
        return 0;
    
    rc = FindAndOpenConfigFile(self->rmgr, self->dir, &kf, conf);
    if (rc == 0) {
        uint64_t sz;
        KDataBuffer buf;
        
        rc = KFileSize(kf, &sz);
        assert(rc == 0);
        if (sz == 0)
            (void)PLOGMSG(klogWarn, (klogWarn, "Configuration file '$(file)' is empty", "file=%s", conf));
        else {
            rc = KDataBufferMakeBytes(&buf, sz + 1);
            if (rc == 0) {
                size_t nread;
                
                rc = KFileReadAll(kf, 0, buf.base, sz, &nread);
                if (rc == 0) {
                    assert(nread == sz);
                    ((char *)buf.base)[sz] = '\n'; /* make sure that last line is terminated */
                    rc = ReferenceMgr_ProcessConf(self, buf.base, (unsigned)(sz + 1));
                }
                KDataBufferWhack(&buf);
            }
        }
        KFileRelease(kf);
    }
    return rc;
}

static
rc_t FastaFile_GetSeqIds(KDataBuffer *const buf, char const data[], uint64_t const len)
{
    uint64_t pos;
    int st = 0;
    
    for (pos = 0; pos < len; ++pos) {
        int const ch = data[pos];
        
        if (st == 0) {
            if (ch == '>') {
                uint64_t const n = buf->elem_count;
                rc_t rc = KDataBufferResize(buf, n + 1);
                
                if (rc)
                    return rc;
                ((uint64_t *)buf->base)[n] = pos;
                st = 1;
            }
        }
        else if (ch == '\r' || ch == '\n') 
            st = 0;
    }
    return 0;
}

static
rc_t ImportFasta(ReferenceSeq *const obj, KDataBuffer const *const buf)
{
    unsigned seqId;
    unsigned seqIdLen;
    unsigned ln;
    unsigned src;
    unsigned dst;
    unsigned start=0;
    char *const data = buf->base;
    unsigned const len = buf->elem_count;
    char *fastaSeqId = NULL;
    rc_t rc;
    MD5State mds;
    
    if (len == 0)
        return 0;
    assert(data[0] == '>');
    
    for (ln = 1; ln != len; ++ln) {
        int const ch = data[ln];
        
        if (ch == '\r' || ch == '\n') {
            data[ln] = '\0';
            start = ln + 1;
            break;
        }
    }
    for (seqId = 1; seqId != ln; ++seqId) {
        if (!isspace(data[seqId]))
            break;
    }
    for (seqIdLen = 0; seqId + seqIdLen < ln; ++seqIdLen) {
        if (isspace(data[seqId + seqIdLen])) {
            ln = seqId + seqIdLen;
            data[ln] = '\0';
            break;
        }
    }
    if (seqIdLen == 0)
        return RC(rcAlign, rcFile, rcReading, rcData, rcInvalid);
    
    fastaSeqId = string_dup(&data[seqId], string_size(&data[seqId]));
    if (fastaSeqId == NULL)
        return RC(rcAlign, rcFile, rcReading, rcMemory, rcExhausted);
    
    MD5StateInit(&mds);
    for (dst = src = start; src != len; ++src) {
        int const ch = toupper(data[src]);
        
        if (isspace(ch))
            continue;
        
        if (strchr(INSDC_4na_map_CHARSET, ch) == NULL && ch != 'X')
            return RC(rcAlign, rcFile, rcReading, rcData, rcInvalid);
        
        data[dst] = ch == 'X' ? 'N' : ch;
        MD5StateAppend(&mds, data + dst, 1);
        ++dst;
    }
    MD5StateFinish(&mds, obj->md5);
    rc = KDataBufferSub(buf, &obj->u.local.buf, start, dst - start);
    if (rc == 0) {
        obj->fastaSeqId = fastaSeqId;
        obj->type = rst_local;
        obj->seq_len = dst - start;
    }
    else
        obj->type = rst_dead;
    return rc;
}

static KDataBuffer subBuffer(KDataBuffer const *const buf, uint64_t const offset, unsigned const length)
{
    KDataBuffer sub;
    memset(&sub, 0, sizeof(sub));
    KDataBufferSub(buf, &sub, offset, length);
    return sub;
}

static int compareSeqIdFields(unsigned const alen, char const a[], unsigned const blen, char const b[])
{
    unsigned i;

    for (i = 0; i < alen && i < blen; ++i) {
        int const cha = a[i];
        int const chb = b[i];
        int const diff = toupper(cha) - toupper(chb);

        if (diff < 0)
            return -1;

        if (diff > 0)
            return 1;

        if (cha == '\0')
            return 0;
    }
    return alen < blen ? -1 : alen == blen ? 0 : 1;
}

typedef struct {
    unsigned length;
    uint64_t offset;
} seqIdField_t;

static int64_t cmpSeqIdField(void const *A, void const *B, void *Ctx)
{
    char const *const data = Ctx;
    seqIdField_t const *a = A;
    seqIdField_t const *b = B;
    char const *avalue = &data[a->offset];
    unsigned const alen = a->length;
    char const *bvalue = &data[b->offset];
    unsigned const blen = b->length;
    int const diff = compareSeqIdFields(alen, avalue, blen, bvalue);

    return diff != 0 ? diff : a->offset < b->offset ? -1 : 1;
}

static bool isInKnownSet(unsigned const len, char const id[])
{
    if (len == 2 || len == 3) {
        int const id1 = id[0];
        int const id2 = id[1];

        if (len == 3) {
            int const id3 = id[2];

            if (id1 == 'd' && id2 == 'b' && id3 == 'j') return true;
            if (id1 == 'e' && id2 == 'm' && id3 == 'b') return true;
            if (id1 == 'g' && id2 == 'p' && id3 == 'p') return true;
            if (id1 == 'r' && id2 == 'e' && id3 == 'f') return true;
            if (id1 == 't' && id2 == 'p') {
                if (id3 == 'd' || id3 == 'e' || id3 == 'g') return true;
            }
            return false;
        }
        if (id1 == 'g') {
            if (id2 == 'b' || id2 == 'i')
                return true;
        }
    }
    return false;
}

static rc_t ImportFastaFileMany(ReferenceMgr *const self,
                                unsigned const seqIds, uint64_t const seqIdOffset[],
                                KDataBuffer const *const buf)
{
    unsigned const datalen = buf->elem_count;
    char *const data = buf->base;
    seqIdField_t *found = NULL;
    seqIdField_t *ignore = NULL;
    unsigned found_entries = 0;
    unsigned found_entries_max = seqIds;
    unsigned ignore_entries = 0;
    unsigned ignore_entries_max = 0;
    unsigned i;
    rc_t rc = 0;

    found = malloc(found_entries_max * sizeof(found[0]));
    assert(found);
    if (found == NULL)
        abort();

    for (i = 0; i < seqIds; ++i) {
        uint64_t const ofs = seqIdOffset[i];
        uint64_t const nxt = (i < seqIds - 1) ? seqIdOffset[i + 1] : datalen;
        unsigned const len = (unsigned)(nxt - ofs);
        unsigned j = 1;
        unsigned k;

        for (k = j; k < len; ++k) {
            int const ch = data[ofs + k];

            if (ch == '|' || isspace(ch)) {
                char const *const str = &data[ofs + j];
                unsigned const len = k - j;

                if (len > 0 && (isspace(ch) || !isInKnownSet(len, str))) {
                    if (found_entries == found_entries_max) {
                        unsigned const new_max = found_entries_max * 2;
                        void *const tmp = realloc(found, new_max * sizeof(found[0]));

                        assert(tmp);
                        if (tmp == NULL)
                            abort();

                        found = tmp;
                        found_entries_max = new_max;
                    }
                    found[found_entries].length = len;
                    found[found_entries].offset = ofs + j;
                    ++found_entries;
                }
                j = k + 1;
            }
            if (isspace(ch))
                break;
        }
    }
    ksort(found, found_entries, sizeof(found[0]), cmpSeqIdField, (void *)data);

    for (i = 1; i < found_entries; ++i) {
        unsigned const llen = ignore_entries_max > 0 ? ignore[ignore_entries - 1].length : 0;
        char const *const last = ignore_entries_max > 0 ? data + ignore[ignore_entries - 1].offset : 0;

        unsigned const plen = found[i - 1].length;
        char const *const prv = data + found[i - 1].offset;

        unsigned const qlen = found[i].length;
        char const *const qry = data + found[i].offset;

        bool const issame = compareSeqIdFields(plen, prv, qlen, qry) == 0;
        bool const islast = llen > 0 ? compareSeqIdFields(llen, last, qlen, qry) == 0 : false;

        if (issame && !islast) {
            if (ignore_entries == ignore_entries_max) {
                unsigned const new_max = ignore_entries_max == 0 ? (4096 / sizeof(ignore[0])) : (ignore_entries_max * 2);
                void *const tmp = realloc(ignore, new_max * sizeof(ignore[0]));

                assert(tmp);
                if (tmp == NULL)
                    abort();

                ignore = tmp;
                ignore_entries_max = new_max;
            }
            ignore[ignore_entries] = found[i - 1];
            ++ignore_entries;
        }
    }
    free(found);

    for (i = 0; i < seqIds; ++i) {
        unsigned index = 0;
        uint64_t const ofs = seqIdOffset[i];
        uint64_t const nxt = (i < seqIds - 1) ? seqIdOffset[i + 1] : datalen;
        unsigned const len = (unsigned)(nxt - ofs);
        unsigned j = 1;
        unsigned k;
        char const *const seqId = &data[ofs + 1];
        {
            ReferenceSeq new_seq;
            KDataBuffer sub = subBuffer(buf, ofs, len);

            memset(&new_seq, 0, sizeof(new_seq));
            rc = ImportFasta(&new_seq, &sub);
            KDataBufferWhack(&sub);
            if (rc) {
                PLOGERR(klogInfo, (klogInfo, rc, "Error reading '$(defline)'; ignored", "defline=%s", seqId));
                continue;
            }
            else {
                ReferenceSeq *p = newReferenceSeq(self, &new_seq);
                index = p - self->refSeq;
                addToHashBucket(&self->ht[hash0(seqId)], index);
            }
        }
        for (k = j; k < len; ++k) {
            int const ch = data[ofs + k];

            if (ch == '\0' || ch == '|' || isspace(ch)) {
                unsigned const length = k - j;
                uint64_t const offset = ofs + j;
                char const *const value = &data[offset];

                if (length == 0 || (!isspace(ch) && isInKnownSet(length, value)))
                    goto IGNORED;
                {
                    unsigned f = 0;
                    unsigned e = ignore_entries;

                    while (f < e) {
                        unsigned const m = f + (e - f) / 2;
                        unsigned const flen = ignore[m].length;
                        char const *const fnd = data + ignore[m].offset;
                        int const diff = compareSeqIdFields(length, value, flen, fnd);

                        if (diff == 0)
                            goto IGNORED;
                        if (diff < 0)
                            e = m;
                        else
                            f = m + 1;
                    }
                }
                addToHashBucket(&self->ht[hash(length, value)], index);
            IGNORED:
                j = k + 1;
                if (ch == '\0' || isspace(ch))
                    break;
            }
        }
    }

    free(ignore);
    return rc;
}

#define READ_CHUNK_SIZE (1024 * 1024)

static
rc_t ImportFastaFile(ReferenceMgr *const self, KFile const *kf,
                     ReferenceSeq *rslt)
{
    uint64_t file_size;
    rc_t rc = KFileSize(kf, &file_size);
    
    if (rc == 0) {
        KDataBuffer fbuf;

        rc = KDataBufferMakeBytes(&fbuf, file_size);
        if (rc == 0) {
            char *const data = fbuf.base;
            uint64_t inbuf = 0;

            while (inbuf < file_size) {
                uint64_t const remain = file_size - inbuf;
                size_t nread = 0;
                
                rc = KFileRead(kf, inbuf, &data[inbuf], remain > READ_CHUNK_SIZE ? READ_CHUNK_SIZE : remain, &nread);
                if (rc != 0 || nread == 0)
                    break;
                inbuf += nread;
            }
            if (rc == 0) {
                char const *const base = fbuf.base;
                KDataBuffer seqIdBuf;
                
                memset(&seqIdBuf, 0, sizeof(seqIdBuf));
                seqIdBuf.elem_bits = sizeof(file_size) * 8;
                
                rc = FastaFile_GetSeqIds(&seqIdBuf, base, file_size);
                if (rc == 0) {
                    uint64_t const *const seqIdOffset = seqIdBuf.base;
                    unsigned const seqIds = (unsigned)seqIdBuf.elem_count;

                    if (rslt) {
                        KDataBuffer sub = subBuffer(&fbuf, seqIdOffset[0], (unsigned)(file_size - seqIdOffset[0]));

                        if (seqIds > 1)
                            rc = RC(rcAlign, rcFile, rcReading, rcItem, rcUnexpected);
                        
                        rc = ImportFasta(rslt, &sub);
                        KDataBufferWhack(&sub);
                        if (rc == 0)
                            addToHashTable(self, rslt);
                    }
                    else {
                        ImportFastaFileMany(self, seqIds, seqIdOffset, &fbuf);
                    }
                }
                KDataBufferWhack(&seqIdBuf);
            }
            KDataBufferWhack(&fbuf);
        }
    }
    return rc;
}

static
rc_t OpenFastaFile(KFile const **const kf,
                   KDirectory const *const dir,
                   char const base[],
                   unsigned const len)
{
    char fname_a[4096];
    char *fname_h = NULL;
    char *fname = fname_a;
    rc_t rc;
    
    if (len + 7 >= sizeof(fname_a)) {
        fname_h = malloc(len + 7);
        if (fname_h)
            fname = fname_h;
        else
            return RC(rcAlign, rcFile, rcOpening, rcMemory, rcExhausted);
    }
    memmove(fname, base, len);
    memmove(fname + len, ".fasta", 7);
    
    ALIGN_CF_DBGF(("trying to open fasta file: %.s\n", fname));
    rc = KDirectoryOpenFileRead(dir, kf, "%s", fname);
    if (rc) {
        fname[len + 3] = '\0'; /* base.fasta -> base.fa */
        
        ALIGN_CF_DBGF(("trying to open fasta file: %.s\n", fname));
        rc = KDirectoryOpenFileRead(dir, kf, "%s", fname);
    }
    free(fname_h);
    return rc;
}

#if 1
void ReferenceSeq_Dump(ReferenceSeq const *const rs)
{
    static char const *types[] = {
        "'unattached'",
        "'fasta'",
        "'RefSeq-by-id'",
        "'RefSeq-by-seqid'",
        "'unmapped'",
        "'dead'"
    };
    unsigned j;
    
    ((void)types); /* stupid warning */
    ALIGN_CF_DBGF(("{ "));
    ALIGN_CF_DBGF(("type: %s, ", (rs->type < 0 || rs->type > rst_dead) ? "null" : types[rs->type]));
    
    if (rs->id)
        ALIGN_CF_DBGF(("id: '%s', ", rs->id));
    else
        ALIGN_CF_DBGF(("id: null, "));
    
    if (rs->seqId)
        ALIGN_CF_DBGF(("seqId: '%s', ", rs->seqId));
    else
        ALIGN_CF_DBGF(("seqId: null, "));
    
    if (rs->fastaSeqId)
        ALIGN_CF_DBGF(("fastaSeqId: '%s', ", rs->fastaSeqId));
    else
        ALIGN_CF_DBGF(("fastaSeqId: null, "));
    
    ALIGN_CF_DBGF(("seq-len: %u, ", rs->seq_len));
    ALIGN_CF_DBGF(("circular: %s, ", rs->circular ? "true" : "false"));
    
    ALIGN_CF_DBGF(("md5: '"));
    for (j = 0; j != 16; ++j)
        ALIGN_CF_DBGF(("%02X", rs->md5[j]));
    ALIGN_CF_DBGF(("', "));
    
    ALIGN_CF_DBGF(("keys: [ "));
    for (j = 0; j != rs->num_used; ++j) {
        char const *key = rs->used[j];
        
        ALIGN_CF_DBGF(("'%s', ", key));
    }
    ALIGN_CF_DBGF(("] }"));
}

LIB_EXPORT void ReferenceMgr_DumpConfig(ReferenceMgr const *const self)
{
    unsigned const n = (unsigned)self->refSeqs.elem_count;
    unsigned i;
    
    ALIGN_CF_DBGF(("config: [\n"));
    for (i = 0; i != n; ++i) {
        ALIGN_CF_DBGF(("\t"));
        ReferenceSeq_Dump(&self->refSeq[i]);
        ALIGN_CF_DBGF((",\n"));
    }
    ALIGN_CF_DBGF(("]\n"));
}
#endif

static
rc_t ReferenceSeq_GetRefSeqInfo(ReferenceSeq *const self)
{
    rc_t rc;
    uint8_t const *md5;
    
    assert(self != NULL);
    assert(self->type == rst_refSeqById || self->type == rst_refSeqBySeqId);
    
    if ((rc = RefSeq_Circular(self->u.refseq, &self->circular)) != 0)
        return rc;
    if ((rc = RefSeq_SeqLength(self->u.refseq, &self->seq_len)) != 0)
        return rc;
    if ((rc = RefSeq_MD5(self->u.refseq, &md5)) != 0)
        return rc;
    
    if (md5)
        memmove(self->md5, md5, 16);
    else
        memset(self->md5, 0, 16);
    return 0;
}


/* Try to attach to a RefSeq or a fasta file */
static
rc_t ReferenceSeq_Attach(ReferenceMgr *const self, ReferenceSeq *const rs)
{
    unsigned const seqid_len = rs->seqId ? (unsigned)string_size(rs->seqId) : 0;
    unsigned const id_len = rs->id ? (unsigned)string_size(rs->id) : 0;
    rc_t rc = 0;
    KFile const *kf = NULL;
    
    assert(rs->type == rst_unattached);
    assert(id_len != 0 || seqid_len != 0);
    
    if (seqid_len) {
        ALIGN_CF_DBGF(("trying to open refseq: %.*s\n", seqid_len, rs->seqId));
        if (RefSeqMgr_Exists(self->rmgr, rs->seqId, seqid_len, NULL) == 0) {
            rc = RefSeqMgr_GetSeq(self->rmgr, &rs->u.refseq, rs->seqId, seqid_len);
            if (rc == 0) {
                rs->type = rst_refSeqBySeqId;
                rc = ReferenceSeq_GetRefSeqInfo(rs);
            }
            return rc;
        }
    }
    if (id_len) {
        ALIGN_CF_DBGF(("trying to open refseq: %.*s\n", id_len, rs->id));
        if (RefSeqMgr_Exists(self->rmgr, rs->id, id_len, NULL) == 0) {
            rc = RefSeqMgr_GetSeq(self->rmgr, &rs->u.refseq, rs->id, id_len);
            if (rc == 0) {
                rs->type = rst_refSeqById;
                rc = ReferenceSeq_GetRefSeqInfo(rs);
            }
            return rc;
        }
    }
    if (id_len) {
        ALIGN_CF_DBGF(("trying to open fasta: %.*s\n", id_len, rs->id));
        rc = OpenFastaFile(&kf, self->dir, rs->id, id_len);
        if (rc && seqid_len) {
            ALIGN_CF_DBGF(("trying to open fasta: %.*s\n", seqid_len, rs->seqId));
            rc = OpenFastaFile(&kf, self->dir, rs->seqId, seqid_len);
        }
    }
    else {
        ALIGN_CF_DBGF(("trying to open fasta: %.*s\n", seqid_len, rs->seqId));
        rc = OpenFastaFile(&kf, self->dir, rs->seqId, seqid_len);
    }
    if (kf) {
        ReferenceSeq tmp = *rs;
        
        ALIGN_CF_DBGF(("importing fasta"));
        rc = ImportFastaFile(self, kf, rs);
        KFileRelease(kf);
        if (rc != 0)
            *rs = tmp;
        return rc;
    }
    return 0;
}

struct Candidate {
    int weight;
    unsigned index;
};

static int64_t CC cmpCandidate(void const *A, void const *B, void *Ctx)
{
    struct Candidate const *const a = A;
    struct Candidate const *const b = B;

    return (int64_t)(a->weight - b->weight);
}

static void sortCandidateList(unsigned const len, struct Candidate *list)
{
    if (len > 1)
        ksort(list, len, sizeof(list[0]), cmpCandidate, NULL);
}

static void candidates(ReferenceMgr *const self,
                       unsigned *const count,
                       struct Candidate **const rslt,
                       unsigned const idLen,
                       char const id[],
                       unsigned const seq_len,
                       uint8_t const md5[16])
{
    unsigned const hv = hash(idLen, id);
    Bucket const bucket = self->ht[hv];
    unsigned num_possible = 0;
    struct Candidate *possible = malloc(sizeof(possible[0]) * bucket.count);
    unsigned i;

    assert(possible != NULL);
    if (possible == NULL)
        abort();
    for (i = 0; i < bucket.count; ++i) {
        unsigned const index = bucket.index[i];
        ReferenceSeq *const rs = &self->refSeq[index];

        if (rs->type != rst_dead) {
            bool const sameId = rs->id != NULL && strcmp(rs->id, id) == 0;
            bool const sameSeqId = rs->seqId != NULL && strcasecmp(rs->seqId, id) == 0;
            int const sameFastaSeqId = rs->fastaSeqId != NULL ? str_weight(rs->fastaSeqId, id, idLen) : 0;
            struct Candidate nv;

            nv.weight = (sameId ? id_match : 0) | (sameSeqId ? seqId_match : 0) | sameFastaSeqId;
            nv.index = index;

            if (nv.weight > 0)
                possible[num_possible++] = nv;
        }
    }
    if (num_possible == 0) {
        free(possible);
        possible = NULL;
    }
    *count = num_possible;
    *rslt = possible;
}

static rc_t tryFastaOrRefSeq(ReferenceMgr *const self,
                     ReferenceSeq **const rslt,
                     unsigned const idLen,
                     char const id[],
                     bool *tryAgain)
{
    KFile const *kf = NULL;
    rc_t rc = 0;

    if (OpenFastaFile(&kf, self->dir, id, idLen) == 0) {
        /* found a fasta file; load it and try again */
        rc = ImportFastaFile(self, kf, NULL);
        if (rc == 0) {
            *tryAgain = true;
            return 0;
        }
    }
    /* didn't find a fasta file; try RefSeq */
    ALIGN_CF_DBGF(("trying to open refseq: %s\n", id));
    if (RefSeqMgr_Exists(self->rmgr, id, idLen, NULL) == 0) {
        ReferenceSeq *const seq = newReferenceSeq(self, NULL);

        rc = RefSeqMgr_GetSeq(self->rmgr, &seq->u.refseq, id, idLen);
        if (rc == 0) {
            unsigned const hv = hash(idLen, id);
            seq->id = string_dup(id, idLen);
            seq->type = rst_refSeqById;

            addToHashBucket(&self->ht[hv], seq - self->refSeq);

            ReferenceSeq_GetRefSeqInfo(seq);
            *rslt = seq;
        }
    }
    else {
        /* nothing found and out of options */
        rc = RC(rcAlign, rcFile, rcConstructing, rcId, rcNotFound);
    }
    return rc;
}

static void setSeqLenBit(ReferenceMgr *const self, unsigned const N, struct Candidate *const C, unsigned const seq_len)
{
    unsigned i;
    for (i = 0; i < N; ++i) {
        unsigned const index = C[i].index;
        ReferenceSeq const *const rs = &self->refSeq[index];

        if (seq_len == rs->seq_len)
            C[i].weight |= seq_len_match;
    }
}

static void setMD5Bit(ReferenceMgr *const self, unsigned const N, struct Candidate *const C, uint8_t const md5[])
{
    unsigned i;
    for (i = 0; i < N; ++i) {
        unsigned const index = C[i].index;
        ReferenceSeq const *const rs = &self->refSeq[index];

        if (memcmp(md5, rs->md5, 16) == 0)
            C[i].weight |= md5_match;
    }
}

static void setAttachedBit(ReferenceMgr *const self, unsigned const N, struct Candidate *const C)
{
    unsigned i;
    for (i = 0; i < N; ++i) {
        unsigned const index = C[i].index;
        ReferenceSeq const *const rs = &self->refSeq[index];

        if (rs->type != rst_unattached)
            C[i].weight |= attached;
    }
}

static ReferenceSeq *checkForMultiMapping(ReferenceMgr *const self, ReferenceSeq *const chosen, bool *const wasRenamed)
{
    unsigned const hv = hash0(chosen->seqId);
    Bucket const bucket = self->ht[hv];
    unsigned i;

    for (i = 0; i < bucket.count; ++i) {
        ReferenceSeq *qry = &self->refSeq[bucket.index[i]];
        if (qry == chosen || qry->type == rst_dead || qry->type == rst_unattached || qry->type == rst_renamed || qry->seqId == NULL)
            continue;
        if (strcasecmp(chosen->seqId, qry->seqId) == 0) {
            void *const oldId = chosen->id;

            chosen->type = rst_renamed;
            chosen->id = string_dup(qry->id, string_size(qry->id));
            *wasRenamed = true;
            free(oldId);
            return qry;
        }
    }
    return chosen;
}

static rc_t tryFasta(ReferenceMgr *const self,
                     ReferenceSeq **const rslt,
                     char const seqId[],
                     unsigned const seq_len,
                     uint8_t const md5[16])
{
    ReferenceSeq *const seq = *rslt;
    unsigned const hv = hash0(seqId);
    Bucket const bucket = self->ht[hv];
    unsigned best = bucket.count;
    unsigned best_score = 0;
    unsigned i;

    for (i = 0; i < bucket.count; ++i) {
        unsigned score = 0;
        ReferenceSeq *const qry = &self->refSeq[bucket.index[i]];

        if (qry != seq && qry->fastaSeqId != NULL) {
            char const *const substr = strcasestr(qry->fastaSeqId, seqId);
            if (substr != NULL) {
                unsigned const at = substr - qry->fastaSeqId;
                unsigned const slen = (unsigned)string_size(seqId);
                unsigned const qlen = (unsigned)string_size(qry->fastaSeqId);
                if (at == 0 && slen == qlen)
                    score |= exact_match;
                else {
                    bool const leftEdge = at == 0 || qry->fastaSeqId[at - 1] == '|';
                    bool const rightEdge = (at + slen) == qlen || qry->fastaSeqId[at + slen] == '|';

                    if (leftEdge && rightEdge)
                        score |= substring_match;
                }
            }
        }
        if (score == 0)
            continue;

        if (seq_len != 0 && qry->seq_len == seq_len)
            score |= seq_len_match;
        if (md5 != NULL && memcmp(md5, qry->md5, 16) == 0)
            score |= md5_match;
        if (score > best_score) {
            best = i;
            best_score = score;
        }
    }
    if (best != bucket.count) {
        *rslt = &self->refSeq[bucket.index[best]];
        return 0;
    }
    else {
        return RC(rcAlign, rcFile, rcConstructing, rcId, rcNotFound);
    }
}

static rc_t findSeq(ReferenceMgr *const self,
                    ReferenceSeq **const rslt,
                    char const id[],
                    unsigned const seq_len,
                    uint8_t const md5[16],
                    bool const allowMultiMapping,
                    bool wasRenamed[])
{
    unsigned const idLen = (unsigned)string_size(id);
    unsigned num_possible = 0;
    struct Candidate *possible = NULL;
    ReferenceSeq *chosen = NULL;
    rc_t rc = 0;

    candidates(self, &num_possible, &possible, idLen, id, seq_len, md5);
    if (num_possible == 0) {
        /* nothing was found; try a fasta file */
        bool tryAgain = false;
        rc_t const rc = tryFastaOrRefSeq(self, rslt, idLen, id, &tryAgain);

        if (rc != 0 && !tryAgain)
            return rc;

        return findSeq(self, rslt, id, seq_len, md5, allowMultiMapping, wasRenamed);
    }
    if (num_possible > 1) {
        if (seq_len != 0)
            setSeqLenBit(self, num_possible, possible, seq_len);
        if (md5 != NULL)
            setMD5Bit(self, num_possible, possible, md5);
        sortCandidateList(num_possible, possible);
        setAttachedBit(self, num_possible, possible);
        sortCandidateList(num_possible - 1, possible);
    }
    /* if there is no second best OR the best is better than the second best
     * then we have a clear choice
     */
    if (num_possible == 1 || (possible[num_possible - 1].weight & ~attached) > (possible[num_possible - 2].weight & ~attached)) {
        unsigned const index = possible[num_possible - 1].index;
        chosen = &self->refSeq[index];
    }
    free(possible);
    if (chosen == NULL) {
        /* there was no clear choice */
        return RC(rcAlign, rcFile, rcConstructing, rcId, rcAmbiguous);
    }
    if (chosen->seqId != NULL && !allowMultiMapping) {
        chosen = checkForMultiMapping(self, chosen, wasRenamed);
    }
    if (chosen->type == rst_unattached) {
        rc = ReferenceSeq_Attach(self, chosen);
        if (rc == 0 && chosen->type == rst_unattached) {
            /* still not attached; try seqId fasta */
            char const *const seqId = chosen->seqId;

            chosen->type = rst_dead;
            if (seqId)
                rc = tryFasta(self, &chosen, seqId, seq_len, md5);
            else
                rc = RC(rcAlign, rcFile, rcConstructing, rcId, rcNotFound);
        }
    }
    if (rc == 0) {
        if (chosen->id == NULL)
            chosen->id = string_dup(id, idLen);
        if (chosen->seqId == NULL && chosen->fastaSeqId != NULL)
            chosen->seqId = string_dup(chosen->fastaSeqId, string_size(chosen->fastaSeqId));
        *rslt = chosen;
    }
    if (rc)
        chosen->type = rst_dead;
    addToIndex(self, id, chosen);
    return rc;
}

static
rc_t ReferenceMgr_OpenSeq(ReferenceMgr *const self,
                          ReferenceSeq **const rslt,
                          char const id[],
                          unsigned const seq_len,
                          uint8_t const md5[16],
                          bool const allowMultiMapping,
                          bool wasRenamed[])
{
    int const fnd = findId(self, id);
    
    assert(rslt != NULL);
    *rslt = NULL;
    if (fnd >= 0) {
        ReferenceSeq *const obj = &self->refSeq[fnd];
        
        if (obj->type == rst_dead)
            return RC(rcAlign, rcIndex, rcSearching, rcItem, rcInvalid);
        if (obj->type == rst_renamed) {
            bool dummy = false;

            *wasRenamed = true;
            return ReferenceMgr_OpenSeq(self, rslt, obj->id, seq_len, md5, allowMultiMapping, &dummy);
        }
        if (obj->type == rst_refSeqBySeqId || obj->type == rst_refSeqById) {
            RefSeq const *dummy = NULL;
            char const *const key = (obj->type == rst_refSeqById) ? obj->id : obj->seqId;
            rc_t const rc = RefSeqMgr_GetSeq(self->rmgr, &dummy, key, (unsigned)string_size(key));
            
            assert(rc == 0);
            assert(dummy == obj->u.refseq);
        }
        *rslt = obj;
        return 0;
    }
    return findSeq(self, rslt, id, seq_len, md5, allowMultiMapping, wasRenamed);
}

LIB_EXPORT rc_t CC ReferenceMgr_SetCache(ReferenceMgr const *const self, size_t cache, uint32_t num_open)
{
    return RefSeqMgr_SetCache(self->rmgr, cache, num_open);
}

static
rc_t OpenDataDirectory(KDirectory const **rslt, char const path[])
{
    KDirectory *dir;
    rc_t rc = KDirectoryNativeDir(&dir);
    
    if (rc == 0) {
        if (path) {
            rc = KDirectoryOpenDirRead(dir, rslt, false, "%s", path);
            KDirectoryRelease(dir);
        }
        else
            *rslt = dir;
    }
    return rc;
}

LIB_EXPORT rc_t CC ReferenceMgr_Make(ReferenceMgr const **cself, VDatabase *db,
                                     VDBManager const* vmgr,
                                     const uint32_t options, char const conf[], char const path[],
                                     uint32_t max_seq_len, size_t cache, uint32_t num_open)
{
    rc_t rc;
    ReferenceMgr *self;
    uint32_t wopt = 0;
    
    if (cself == NULL)
        return RC(rcAlign, rcIndex, rcConstructing, rcParam, rcNull);
    
    wopt |= (options & ewrefmgr_co_allREADs) ? ewref_co_SaveRead : 0;
    wopt |= (options & ewrefmgr_co_Coverage) ? ewref_co_Coverage : 0;

    if (max_seq_len == 0)
        max_seq_len = TableWriterRefSeq_MAX_SEQ_LEN;
    
    self = calloc(1, sizeof(*self));
    if (self) {
        rc = KDataBufferMakeBytes(&self->seq, max_seq_len);
        if (rc == 0) {
            self->compress.elem_bits = sizeof(compress_buffer_t) * 8;
            self->refSeqs.elem_bits = sizeof(ReferenceSeq) * 8;
            
            self->options = options;
            self->cache = cache;
            self->num_open_max = num_open;
            self->max_seq_len = max_seq_len;
            if (db) VDatabaseAddRef(self->db = db);
            rc = OpenDataDirectory(&self->dir, path);
            if (rc == 0) {
                rc = RefSeqMgr_Make(&self->rmgr, vmgr, 0, cache, num_open);
                if (rc == 0) {
                    rc = ReferenceMgr_Conf(self, conf);
                    if (rc == 0) {
                        *cself = self;
                        ALIGN_DBG("conf %s, local path '%s'", conf ? conf : "", path ? path : "");
                        return 0;
                    }
                    (void)PLOGERR(klogErr, (klogErr, rc, "failed to open configuration $(file)", "file=%s/%s", path ? path : ".", conf));
                }
            }
        }
        ReferenceMgr_Release(self, false, NULL, false, NULL);
    }
    else
        rc = RC(rcAlign, rcIndex, rcConstructing, rcMemory, rcExhausted);

    ALIGN_DBGERR(rc);

    return rc;
}

#define ID_CHUNK_SZ 256

typedef struct TChunk32_struct {
    struct TChunk32_struct* next;
    uint32_t id[ID_CHUNK_SZ]; /*** will only work with positive ids **/
} TChunk32;

typedef struct AlignId32List_struct {
	TChunk32* head;
	TChunk32* tail;
	uint32_t  tail_qty;  /** number elements in the last chunk **/
	uint32_t  chunk_qty; /** number of chunks */
} AlignId32List;
typedef struct AlignIdList_struct {
	AlignId32List **sub_list;
	uint32_t        sub_list_count; 
} AlignIdList;

static uint64_t AlignId32ListCount(AlignId32List *l)
{ return (l->chunk_qty>0)?ID_CHUNK_SZ*(l->chunk_qty-1)+ l->tail_qty:0;}

static uint64_t AlignIdListCount(AlignIdList *l)
{
	uint64_t ret=0;
	if(l){
		uint32_t i;
		for(i=0;i<l->sub_list_count;i++){
			if(l->sub_list[i]){
				ret += AlignId32ListCount(l->sub_list[i]);
			}
		}
	}
	return ret;
}
static uint64_t AlignIdListFlatCopy(AlignIdList *l,int64_t *buf,uint64_t num_elem,bool do_sort)
{
	uint64_t res=0;
	uint32_t i,j;
	AlignId32List* cl;
	assert(l!=0);

	if((cl = l->sub_list[0])!=NULL){
		TChunk32* head  = cl->head;
		while(head !=  cl->tail){
			for(i=0;i<ID_CHUNK_SZ && res < num_elem;i++,res++){
				buf[res] = head->id[i];
			}
			head = head->next;
		}
		for(i=0;i<cl->tail_qty && res < num_elem;i++,res++){
			buf[res] = head->id[i];
		}
	}
	for(j = 1; j< l->sub_list_count && res < num_elem;j++){
		if((cl = l->sub_list[j])!=NULL){
			TChunk32* head  = cl->head;
			uint64_t  hi = ((uint64_t)j) << 32;
			while(head !=  cl->tail){
				for(i=0;i<ID_CHUNK_SZ && res < num_elem;i++,res++){
					buf[res] = hi | head->id[i];
				}
				head = head->next;
			}
			for(i=0;i<cl->tail_qty && res < num_elem;i++,res++){
				buf[res] = hi | head->id[i];
			}
		}
	}
	if(do_sort && res > 1) 
		ksort_int64_t(buf,res);
	return res;
}

static rc_t AlignId32ListAddId(AlignId32List *l,const uint32_t id)
{
	if(l->tail  == NULL){
		l->head = l->tail = malloc(sizeof(*l->tail));
		if(l->tail == NULL) return RC(rcAlign, rcTable, rcCommitting, rcMemory, rcExhausted);
		l->chunk_qty =1;
		l->tail_qty = 0;	
	}
	if(l->tail_qty == ID_CHUNK_SZ){/** chunk is full **/
		l->tail->next = malloc(sizeof(*l->tail));
		if(l->tail == NULL) return RC(rcAlign, rcTable, rcCommitting, rcMemory, rcExhausted);
		l->tail = l->tail->next;
		l->chunk_qty ++;
		l->tail_qty = 0;	
	}
	l->tail->id[l->tail_qty++]=id;
	return 0;
}

static rc_t AlignIdListAddId(AlignIdList *l,const int64_t id)
{
	uint32_t  sub_id,id32;
	if(id < 0) return RC(rcAlign, rcTable, rcCommitting, rcId, rcOutofrange);
	id32 = (uint32_t) id;
	sub_id = id >> 32;
	if(sub_id >= l->sub_list_count) return RC(rcAlign, rcTable, rcCommitting, rcId, rcOutofrange);
	if(l->sub_list[sub_id] == NULL){
		l->sub_list[sub_id] = calloc(1,sizeof(AlignId32List));
		if(l->sub_list[sub_id] == NULL) return RC(rcAlign, rcTable, rcCommitting, rcMemory, rcExhausted);
	}
	return AlignId32ListAddId(l->sub_list[sub_id],id32);
}

static void AlignId32ListRelease(AlignId32List *l)
{
	if(l){
		while(l->head != l->tail){
			TChunk32* head = l->head;
			l->head = l->head->next;
			free(head);
		}
		free(l->head);
		free(l);
	}
}
static void AlignIdListRelease(AlignIdList *l)
{
        if(l){
		uint32_t i;
		for(i=0;i<l->sub_list_count;i++){
			AlignId32ListRelease(l->sub_list[i]);
		}
		free(l->sub_list);
		free(l);
        }
}


typedef struct {
    AlignIdList*	idlist;
    ReferenceSeqCoverage cover;
    INSDC_coord_len bin_seq_len;
} TCover;

static
void ReferenceMgr_TCoverRelease(TCover* c)
{
	if(c){
		AlignIdListRelease(c->idlist);
		c->idlist = NULL;
	}
}
static 
rc_t ReferenceMgr_TCoverSetMaxId(TCover* c,int64_t id)
{
	uint32_t  sub_id;
	if(id < 0) return RC(rcAlign, rcTable, rcCommitting, rcId, rcOutofrange);
	sub_id = id >> 32;
	if(c->idlist == NULL){
		c->idlist = calloc(1,sizeof(AlignIdList));
		if(c->idlist==NULL) return RC(rcAlign, rcTable, rcCommitting, rcMemory, rcExhausted);
		c->idlist->sub_list_count = sub_id+1;
		c->idlist->sub_list = calloc(c->idlist->sub_list_count,sizeof(c->idlist->sub_list[0]));
		if(c->idlist->sub_list == NULL) return RC(rcAlign, rcTable, rcCommitting, rcMemory, rcExhausted);
	} else {
		return RC(rcAlign, rcTable, rcCommitting, rcParam, rcUnexpected);
	}
	return 0;
}

static
rc_t CoverageGetSeqLen(ReferenceMgr const *const mgr, TCover data[], uint64_t const rows)
{
    TableReaderColumn acols[] =
    {
        {0, "(INSDC:coord:len)SEQ_LEN", {NULL}, 0, 0},
        {0, NULL, {NULL}, 0, 0}
    };
    VTable const *tbl;
    rc_t rc = VDatabaseOpenTableRead(mgr->db, &tbl, "REFERENCE");
    
    if (rc == 0) {
        TableReader const *reader;
        
        rc = TableReader_Make(&reader, tbl, acols, 0);
        if (rc == 0) {
            uint64_t i;
            
            for (i = 0; i != rows; ++i) {
                rc = TableReader_ReadRow(reader, i + 1);
                if (rc == 0 && acols->len > 0)
                    data[i].bin_seq_len = acols->base.coord_len[0];
            }
            TableReader_Whack(reader);
        }
        VTableRelease(tbl);
    }
    return rc;
}

static
rc_t ReferenceMgr_ReCover(const ReferenceMgr* cself, uint64_t ref_rows, rc_t (*const quitting)(void))
{
    rc_t rc = 0;
    uint64_t new_rows = 0;
    const TableWriterRefCoverage* cover_writer = NULL;
    
    TableReaderColumn acols[] =
    {
        {0, "REF_ID", {NULL}, 0, 0},
        {0, "REF_START", {NULL}, 0, 0},
        {0, "CIGAR_LONG",{NULL}, 0, 0},
        {0, "REF_POS",{NULL}, 0, 0},
        {0, NULL, {NULL}, 0, 0}
    };
    const int64_t** al_ref_id = &acols[0].base.i64;
    const INSDC_coord_zero** al_ref_start = &acols[1].base.coord0;
    const TableReaderColumn* cigar =  &acols[2];
    const INSDC_coord_zero** al_ref_pos = &acols[3].base.coord0;
    /* order is important see ReferenceSeqCoverage struct */
    struct {
        const char* nm;
	    const char* col;
        bool ids_only;
    } tbls[] = { {"PRIMARY_ALIGNMENT", "PRIMARY_ALIGNMENT_IDS",false},
        {"SECONDARY_ALIGNMENT", "SECONDARY_ALIGNMENT_IDS",false},
        {"EVIDENCE_INTERVAL", "EVIDENCE_INTERVAL_IDS", true} };
	int tbls_qty=(sizeof(tbls)/sizeof(tbls[0]));
    rc_t rc1 = 0;
    int64_t rr;
    uint32_t i;
    uint8_t* hilo=NULL;
    TCover* data = NULL;
    
    /* allocate mem for ref_rows of reference coverage*/
    if((data = calloc(ref_rows, (sizeof(*data) + cself->max_seq_len))) == NULL) {
		rc = RC(rcAlign, rcTable, rcCommitting, rcMemory, rcExhausted);
    } else {
		/** allocation for both data and hilo was done in 1 shot ***/
		hilo = (uint8_t *)&data[ref_rows];
        rc = CoverageGetSeqLen(cself, data, ref_rows);
    }
    /* grep through tables for coverage data */
    ALIGN_R_DBG("covering REFERENCE rowid range [1:%ld]",ref_rows);
    for(i = 0; rc == 0 && i < tbls_qty; i++) { /* TABLE LOOP STARTS */
        const VTable* table = NULL;
        const TableReader* reader = NULL;
        int64_t al_from;
        uint64_t al_qty;
        
        ALIGN_R_DBG("covering REFERENCE with %s", tbls[i].nm);
        if((rc = VDatabaseOpenTableRead(cself->db, &table, "%s", tbls[i].nm)) != 0) {
            if(GetRCState(rc) == rcNotFound) {
                ALIGN_R_DBG("table %s was not found, ignored", tbls[i].nm);
                rc = 0;
                continue;
            } else {
                break;
            }
        }
        if((rc = TableReader_Make(&reader, table, acols, cself->cache)) == 0 &&
           (rc = TableReader_IdRange(reader, &al_from, &al_qty)) == 0) {
            int64_t al_rowid;
            
            for(al_rowid = al_from; rc == 0 && al_rowid < al_from + al_qty; al_rowid++) {
                if((rc = TableReader_ReadRow(reader, al_rowid)) != 0) {
                    break;
                }
                rr    = **al_ref_id-1;
                /**** Record ALIGNMENT_IDS ***/
                if(  data[rr].idlist == NULL 
                   && (rc = ReferenceMgr_TCoverSetMaxId(data+rr,al_from + al_qty))!=0){
                    break; /*** out-of-memory ***/
                }
                if((rc = AlignIdListAddId(data[rr].idlist,al_rowid))!=0){
                    break; /*** out-of-memory ***/
                }
                /**** Done alignment ids ***/
                if(!tbls[i].ids_only) { /*** work on statistics ***/
                    char const *c = cigar->base.str;
                    const char *c_end = c + cigar->len;
                    int64_t const global_ref_pos = rr*cself->max_seq_len + **al_ref_start; /** global_ref_start **/
                    int64_t const global_refseq_start = global_ref_pos -  **al_ref_pos;   /** global_ref_start of current reference **/
                    unsigned const bin_no = (unsigned)(global_ref_pos / cself->max_seq_len);
                    TCover *const bin = &data[bin_no];
                    uint8_t *const cov = &hilo[global_ref_pos];
                    int64_t ref_offset = 0;
                    int64_t max_ref_offset = 0;
                    int64_t min_ref_offset = 0;
                    int64_t j;

                    while (rc == 0 && c < c_end) {
                        int op_len = (int)strtol(c, (char **)&c, 10);
                        int const op = *c++;
                        
                        switch (op){
                        case 'I':/* extra bases in the read **/
                            ++bin->cover.indels;
                        case 'S':/* skip in the read */
                            break;
                        case 'B':/* back up in the sequence */
                            if (ref_offset > op_len)
                                ref_offset -= op_len;
                            else
                                ref_offset = 0;
                            break;
                        case 'D': /** delete in the reference ***/
                            ++bin->cover.indels;
                        case 'N': /** expected skip in the reference ***/
                            ref_offset += op_len;
                            break;
                        case 'X':
                            bin->cover.mismatches += op_len;
                        case '=':
                            ref_offset += op_len;
                            break;
                        default:
                            rc = RC(rcAlign, rcTable, rcCommitting, rcData, rcUnrecognized);
                        }
                        if (min_ref_offset > ref_offset)
                            min_ref_offset = ref_offset;
                        if (max_ref_offset < ref_offset)
                            max_ref_offset = ref_offset;
                    }
                    for (j = min_ref_offset; j < max_ref_offset; ++j) {
                        unsigned const hl = cov[j];
                        
                        if (hl < UINT8_MAX)
                            cov[j] = hl + 1;
                    }
                    /*** check if OVERLAPS are needed ***/
                    {
                        int64_t min_rr = (global_ref_pos + min_ref_offset)/cself->max_seq_len;
                        int64_t max_rr = (global_ref_pos + max_ref_offset)/cself->max_seq_len;
                        
                        if(min_rr < 0) min_rr = 0;
                        if(max_rr >= ref_rows) max_rr = ref_rows -1;
                        
                        assert(min_rr<= max_rr);
                        
                        if(min_rr < max_rr){
                            int64_t  overlap_ref_pos; /** relative the beginning of the reference **/
                            uint32_t overlap_ref_len = (global_ref_pos + max_ref_offset) % cself->max_seq_len ;
                            
                            min_rr++;
                            if (global_ref_pos + min_ref_offset > global_refseq_start) {
                                overlap_ref_pos = global_ref_pos + min_ref_offset - global_refseq_start;
                            }
                            else {
                                overlap_ref_pos = 1;
                            }
                            for (; min_rr < max_rr; ++min_rr) {
                                if (  data[min_rr].cover.overlap_ref_pos[i] == 0 /*** NOT SET***/
                                    || overlap_ref_pos < data[min_rr].cover.overlap_ref_pos[i])
                                {
									data[min_rr].cover.overlap_ref_pos[i] = (INSDC_coord_zero)overlap_ref_pos;
                                }
                                data[min_rr].cover.overlap_ref_len[i] = cself->max_seq_len; /*** in between chunks get full length of overlap **/
                            }
                            if (  data[min_rr].cover.overlap_ref_pos[i] == 0
                                || overlap_ref_pos < data[min_rr].cover.overlap_ref_pos[i])
                            {
								data[min_rr].cover.overlap_ref_pos[i] = (INSDC_coord_zero)overlap_ref_pos;
                            }
                            if (overlap_ref_len > data[min_rr].cover.overlap_ref_len[i])
								data[min_rr].cover.overlap_ref_len[i] = overlap_ref_len;
                        }
                    }
                } /**** DONE WITH WORK ON STATISTICS ***/
                ALIGN_DBGERR(rc);
                rc = rc ? rc : quitting();
            }
		    /*** HAVE TO RELEASE **/
		    TableReader_Whack(reader);
		    VTableRelease(table);
		    /*** NOW SAVE AND RELEASE THE COLUMN ***/
		    if((rc = TableWriterRefCoverage_MakeIds(&cover_writer, cself->db, tbls[i].col)) == 0) {
                for(rr=0; rc ==0 &&  rr < ref_rows; rr ++){
                    uint64_t num_elem = AlignIdListCount(data[rr].idlist);
                    uint64_t num_elem_copied = 0;
                    if(num_elem > 0){
#define BUF_STACK_COUNT 128 * 1024
                        int64_t buf_stack[BUF_STACK_COUNT];
                        int64_t *buf_alloc = NULL;
                        int64_t *buf = buf_stack;
                        if(num_elem > BUF_STACK_COUNT){
                            buf=buf_alloc=malloc(num_elem*sizeof(buf[0]));
                            if(buf_alloc == NULL) 
                                rc = RC(rcAlign, rcTable, rcCommitting, rcMemory, rcExhausted);
                        }
                        if(rc == 0){
                            num_elem_copied = AlignIdListFlatCopy(data[rr].idlist,buf,num_elem,true);
                            assert(num_elem == num_elem_copied);
                        }
                        ReferenceMgr_TCoverRelease(data+rr); /** release memory ***/
                        if(rc == 0){
                            rc = TableWriterRefCoverage_WriteIds(cover_writer, rr+1, buf, (uint32_t)num_elem);
                        }
                        if(buf_alloc) free(buf_alloc);
                    } else {
                        rc = TableWriterRefCoverage_WriteIds(cover_writer, rr+1, NULL,0);
                    }
                }
                if(rc == 0){
                    rc = TableWriterRefCoverage_Whack(cover_writer, rc == 0, &new_rows);
                    if(rc == 0  && ref_rows != new_rows) {
                        rc = RC(rcAlign, rcTable, rcCommitting, rcData, rcInconsistent);
                    }
                }
                ALIGN_DBGERR(rc);
		    }
		} else {
			TableReader_Whack(reader);
			VTableRelease(table);
		}
	}/* TABLE LOOP ENDS **/
    /* prep and write coverage data */
	if(rc == 0) {
        uint64_t k;
        
		rc = TableWriterRefCoverage_MakeCoverage(&cover_writer, cself->db, 0);
		for (rr = 0, k = 0; rc == 0 && rr != ref_rows; ++rr, k += cself->max_seq_len) {
            unsigned hi = 0;
            unsigned lo = 255;
            
		    for (i = 0; i != data[rr].bin_seq_len; ++i) {
                unsigned const depth = hilo[k + i];
                
                if (hi < depth) hi = depth;
                if (lo > depth) lo = depth;
		    }
            data[rr].cover.high = hi;
            data[rr].cover.low  = lo;
		    rc = TableWriterRefCoverage_WriteCoverage(cover_writer,rr+1, &data[rr].cover);
		}
		free(data);
		rc1 = TableWriterRefCoverage_Whack(cover_writer, rc == 0, &new_rows);
		rc = rc ? rc : rc1;
		if(rc == 0 && ref_rows != new_rows) {
		    rc = RC(rcAlign, rcTable, rcCommitting, rcData, rcInconsistent);
		}
	}
    ALIGN_DBGERR(rc);
	return rc;
}

LIB_EXPORT rc_t CC ReferenceMgr_Release(const ReferenceMgr *cself,
                                        const bool commit,
                                        uint64_t *const Rows,
                                        const bool build_coverage,
                                        rc_t (*const quitting)(void)
                                       )
{
    rc_t rc = 0;

    if (cself != NULL) {
        ReferenceMgr *const self = (ReferenceMgr *)cself;
        uint64_t rows = 0;
        unsigned i;

        rc = TableWriterRef_Whack(self->writer, commit, &rows);
        if (Rows) *Rows = rows;
        KDirectoryRelease(self->dir);

        for (i = 0; i != self->refSeqs.elem_count; ++i)
            ReferenceSeq_Whack(&self->refSeq[i]);

        KDataBufferWhack(&self->compress);
        KDataBufferWhack(&self->seq);
        KDataBufferWhack(&self->refSeqs);

        if (rc == 0 && build_coverage && commit && rows > 0)
            rc = ReferenceMgr_ReCover(cself, rows, quitting);
#if 0 
        {
            VTable* t = NULL;
            
            if (VDatabaseOpenTableUpdate(self->db, &t, "SECONDARY_ALIGNMENT") == 0) {
                VTableDropColumn(t, "TMP_MISMATCH");
                VTableDropColumn(t, "TMP_HAS_MISMATCH");
            }
            VTableRelease(t);
        }
#endif
        VDatabaseRelease(self->db);
        RefSeqMgr_Release(self->rmgr);
        free(self);
    }
    return rc;
}

static
rc_t ReferenceSeq_ReadDirect(ReferenceSeq *self,
                             int offset,
                             unsigned const len,
                             bool read_circular,
                             uint8_t buffer[],
                             unsigned* written,
                             bool force_linear)
{
    *written = 0;
    if (len == 0)
        return 0;
    
    if (read_circular || self->circular) {
        if (offset < 0) {
            unsigned const n = (-offset) / self->seq_len;
            offset = (self->seq_len * (n + 1) + offset) % self->seq_len;
        }
        else if (offset > self->seq_len)
            offset %= self->seq_len;
    }
    else if (offset >= self->seq_len)
        return RC(rcAlign, rcType, rcReading, rcOffset, rcOutofrange);
    
    if (self->type == rst_local) {
        uint8_t const *const src = self->u.local.buf.base;
        unsigned dst_off = 0;
        
        while (dst_off < len) {
            unsigned const writable = len - dst_off;
            unsigned const readable = self->seq_len - offset;
            unsigned const to_write = readable < writable ? readable : writable;
            
            memmove(&buffer[dst_off], &src[offset], to_write);
            *written += to_write;
            if (!self->circular)
                break;
            offset = 0;
            dst_off += to_write;
        }
        return 0;
    }
    else if (self->type == rst_refSeqById || self->type == rst_refSeqBySeqId) {
        unsigned to_write = len;
        
        if (!self->circular || force_linear) {
            unsigned const readable = self->seq_len - offset;
            
            if (to_write > readable)
                to_write = readable;
        }
        return RefSeq_Read(self->u.refseq, offset, to_write, buffer, written);
    }
    return RC(rcAlign, rcType, rcReading, rcType, rcInvalid);
}

static
rc_t ReferenceMgr_LoadSeq(ReferenceMgr *const self, ReferenceSeq *obj)
{
    KDataBuffer readBuf;
    rc_t rc = KDataBufferMake(&readBuf, 8, self->max_seq_len);
    
    if (rc == 0) {
        char const *const id = obj->id;
        char const *const seqId = obj->seqId ? obj->seqId : id;
        TableWriterRefData data;
        INSDC_coord_zero offset = 0;
        
        obj->start_rowid = self->ref_rowid + 1;
        data.name.buffer = id;
        data.name.elements = string_size(id);
        data.read.buffer = readBuf.base;
        data.seq_id.buffer = seqId;
        data.seq_id.elements = string_size(seqId);
        data.force_READ_write = obj->type == rst_local || (self->options & ewrefmgr_co_allREADs);
        data.circular = obj->circular;
        
        if (self->writer == NULL) {
            uint32_t wopt = 0;
            
            wopt |= (self->options & ewrefmgr_co_allREADs) ? ewref_co_SaveRead : 0;
            wopt |= (self->options & ewrefmgr_co_Coverage) ? ewref_co_Coverage : 0;
            if((rc = TableWriterRef_Make(&self->writer, self->db, wopt)) == 0) {
                TableWriterData mlen;
                
                mlen.buffer = &self->max_seq_len;
                mlen.elements = 1;
                rc = TableWriterRef_WriteDefaultData(self->writer, ewrefd_cn_MAX_SEQ_LEN, &mlen);
            }
        }
        while (rc == 0 && offset < obj->seq_len) {
            unsigned row_len;
            
            rc = ReferenceSeq_ReadDirect(obj, offset, self->max_seq_len, false,
                                         readBuf.base, &row_len, true);
            if (rc != 0 || row_len == 0) break;
            
            data.read.elements = row_len;
            rc = TableWriterRef_Write(self->writer, &data, NULL);
            offset += row_len;
            ++self->ref_rowid;
        }
        KDataBufferWhack(&readBuf);
    }
    return rc;
}

LIB_EXPORT rc_t CC ReferenceMgr_GetSeq(ReferenceMgr const *const cself,
                                       ReferenceSeq const **const seq,
                                       const char *const id,
                                       bool *const shouldUnmap,
                                       bool const allowMultiMapping,
                                       bool wasRenamed[])
{
    ReferenceMgr *const self = (ReferenceMgr *)cself;
    
    if  (self == NULL || seq == NULL || id == NULL)
        return RC(rcAlign, rcFile, rcConstructing, rcParam, rcNull);
    
    *seq = NULL;
    *shouldUnmap = false;
    {
        ReferenceSeq *obj;
        rc_t rc = ReferenceMgr_OpenSeq(self, &obj, id, 0, NULL, allowMultiMapping, wasRenamed);
        
        if (rc) return rc;
        if (obj->type == rst_unmapped) {
            *shouldUnmap = true;
            return 0;
        }
        if (obj->start_rowid == 0) {
            rc = ReferenceMgr_LoadSeq(self, obj);
            if (rc) return rc;
        }
        *seq = obj;
    }
    return 0;
}

LIB_EXPORT rc_t CC ReferenceMgr_Verify(ReferenceMgr const *const cself,
                                       char const id[],
                                       INSDC_coord_len const length,
                                       uint8_t const md5[16],
                                       bool const allowMultiMapping,
                                       bool wasRenamed[])
{
    if (cself == NULL || id == NULL)
        return RC(rcAlign, rcFile, rcValidating, rcParam, rcNull);
    {
        ReferenceMgr *self = (ReferenceMgr *)cself;
        ReferenceSeq *rseq;
        rc_t rc = ReferenceMgr_OpenSeq(self, &rseq, id, length, md5, allowMultiMapping, wasRenamed);
        
        if (rc) return rc;
        if (rseq->seq_len != length) {
            rc = RC(rcAlign, rcFile, rcValidating, rcSize, rcUnequal);
            ALIGN_DBGERRP("%s->%s SEQ_LEN verification", rc, id, rseq->seqId);
        }
        if (md5 && memcmp(md5, rseq->md5, sizeof(rseq->md5)) != 0) {
            unsigned i;
            
            rc = RC(rcAlign, rcTable, rcValidating, rcChecksum, rcUnequal);
            ALIGN_DBGERRP("%s->%s MD5 verification", rc, id, rseq->seqId);
            ALIGN_DBGF((" found '"));
            for(i = 0; i < sizeof(rseq->md5); i++) {
                ALIGN_DBGF(("%02hx", rseq->md5[i]));
            }
            ALIGN_DBGF(("'  != requested '"));
            for(i = 0; i < sizeof(rseq->md5); i++) {
                ALIGN_DBGF(("%02hx", md5[i]));
            }
            ALIGN_DBGF(("'\n"));
        } else {
            ALIGN_DBG("%s->%s MD5 verification ok", id, rseq->seqId);
        }
        if(rc == 0) {
            ALIGN_DBG("%s verification ok", id);
        } else {
            ALIGN_DBGERRP("%s verification", rc, id);
        }
        return rc;
    }
}

LIB_EXPORT rc_t CC ReferenceMgr_FastaPath(const ReferenceMgr* cself, const char* fasta_path)
{
    rc_t rc = 0;
    KDirectory* dir;

    if(cself == NULL || fasta_path == NULL) {
        rc = RC(rcAlign, rcFile, rcConstructing, rcParam, rcNull);
    } else if((rc = KDirectoryNativeDir(&dir)) == 0) {
        const KFile* kf;
        if((rc = KDirectoryOpenFileRead(dir, &kf, "%s", fasta_path)) == 0) {
            rc = ReferenceMgr_FastaFile(cself, kf);
            KFileRelease(kf);
        }
        KDirectoryRelease(dir);
    }
    ALIGN_DBGERRP("from file %s", rc, fasta_path);
    return rc;
}

LIB_EXPORT rc_t CC ReferenceMgr_FastaFile(const ReferenceMgr* cself, const KFile* file)
{
    if(cself == NULL || file == NULL) {
        return RC(rcAlign, rcFile, rcConstructing, rcParam, rcNull);
    }
    return ImportFastaFile((ReferenceMgr *)cself, file, NULL);
}

typedef struct {
    unsigned length: 28, gentype:4, type: 8, code: 8;
} cigar_bin_t;

static
rc_t cigar2offset_2(unsigned const cigar_len,
                    cigar_bin_t const cigar[],
                    unsigned const out_sz,
                    unsigned const out_used,
                    compress_buffer_t out_offset[],
                    INSDC_coord_len out_seq_len[],
                    INSDC_coord_len out_ref_len[],
                    INSDC_coord_len out_max_ref_len[])
{
    unsigned i;
    INSDC_coord_len seq_len = 0;
    INSDC_coord_len ref_len = 0;
    INSDC_coord_len max_ref_len = 0;
    
    for (i = 0; i < cigar_len; ++i) {
        unsigned const op_len = cigar[i].length;
        char const op = cigar[i].code;
        uint8_t const type = cigar[i].type;
        
        switch(op) {
            case 'M':
            case '=':
            case 'X':
                seq_len += op_len;
                ref_len += op_len;
                if(max_ref_len < ref_len)
                    max_ref_len = ref_len;
                break;
            case 'B':
                /* Complete Genomics CIGAR style specific:
                 overlap between consecutive reads
                 ex: sequence 6 bases: ACACTG, reference 2 bases: ACTG,
                 cigar will be: 2M2B2M
                 no need to move sequence position
                 */
            case 'S':
            case 'I':
                if (seq_len < out_sz) {
                    out_offset[seq_len].length = -op_len;
                    out_offset[seq_len].type   = type;
                    ALIGN_C_DBGF(("%s:%u: seq_pos: %u, ref_pos: %u, offset: %i\n", __func__, __LINE__, seq_len, ref_len, -op_len));
                    if (op == 'B') ref_len -= op_len;
                    else           seq_len += op_len;
                }
                else
                    return RC(rcAlign, rcFile, rcProcessing, rcData, rcInconsistent);
                break;
            case 'N':
            case 'D':
                if (seq_len < out_sz) {
                    out_offset[seq_len].length = op_len;
                    out_offset[seq_len].type   = type;
                    ALIGN_C_DBGF(("%s:%u: seq_pos: %u, ref_pos: %u, offset: %i\n", __func__, __LINE__, seq_len, ref_len, op_len));
                }
                else {
                    out_offset[seq_len-1].length = op_len;
                    out_offset[seq_len-1].type   = type;
                    ALIGN_C_DBGF(("%s:%u: seq_pos: %u, ref_pos: %u, offset: %i\n", __func__, __LINE__, seq_len-1, ref_len, op_len));
                }
                ref_len += op_len;
                if(max_ref_len < ref_len)
                    max_ref_len = ref_len;
                break;
            default:
                break;
        }
    }
    out_seq_len[0] = seq_len;
    out_ref_len[0] = ref_len;
    out_max_ref_len[0] = max_ref_len;
    
    ALIGN_C_DBGF(("%s:%u: SEQLEN: %u, REFLEN: %u, MAXREFLEN: %u\n", __func__, __LINE__, seq_len, ref_len, max_ref_len));
    
    return 0;
}

static char const cigar_op_codes[] = "MIDNSHP=XB";

static NCBI_align_ro_type const cigar_op_types[] = {
    NCBI_align_ro_normal,			/* M */
    NCBI_align_ro_normal,			/* I */
    NCBI_align_ro_normal,			/* D */
    NCBI_align_ro_intron_unknown,	/* N */
    NCBI_align_ro_soft_clip,		/* S */
    NCBI_align_ro_normal,			/* H */
    NCBI_align_ro_normal,			/* P */
    NCBI_align_ro_normal,			/* = */
    NCBI_align_ro_normal,			/* X */
    NCBI_align_ro_complete_genomics	/* B */
};

enum {
    gen_match_type,
    gen_insert_type,
    gen_delete_type,
    gen_ignore_type
};

static int const cigar_op_gentypes[] = {
    gen_match_type,			/* M */
    gen_insert_type,		/* I */
    gen_delete_type,		/* D */
    gen_delete_type,		/* N */
    gen_insert_type,		/* S */
    gen_ignore_type,		/* H */
    gen_ignore_type,		/* P */
    gen_match_type,			/* = */
    gen_match_type,			/* X */
    gen_insert_type			/* B */
};

static
rc_t cigar_bin(cigar_bin_t cigar[],
               unsigned const cigar_len,
               void const *cigar_in)
{
    unsigned i;
    uint32_t const *const cigar_bin = cigar_in;
    
    ALIGN_C_DBGF(("%s:%u: '", __func__, __LINE__));
    for (i = 0; i < cigar_len; ++i) {
        uint32_t c;
        
        memmove(&c, cigar_bin + i, 4);
        {
            int const op = c & 0x0F;
            int const len = c >> 4;
            
            if (op >= sizeof(cigar_op_codes)) {
                rc_t const rc = RC(rcAlign, rcFile, rcProcessing, rcData, rcUnrecognized);
                (void)PLOGERR(klogErr, (klogErr, rc, "Invalid or unrecognized CIGAR operation (binary code: $(opbin))", "opbin=%u", op));
                return rc;
            }
            ALIGN_C_DBGF(("%u%c", len, cigar_op_codes[op]));
            cigar[i].length = len;
            cigar[i].code = cigar_op_codes[op];
            cigar[i].type = cigar_op_types[op];
            cigar[i].gentype = cigar_op_gentypes[op];
        }
    }
    ALIGN_C_DBGF(("'[%u]\n", cigar_len));
    return 0;
}

static
rc_t cigar_string(cigar_bin_t cigar[],
                  unsigned const cigar_len,
                  void const *cigar_in)
{
    unsigned i;
    unsigned j;
    char const *const cigar_string = cigar_in;
    
    ALIGN_C_DBGF(("%s:%u: '%s'[%u]\n", __func__, __LINE__, cigar_in, cigar_len));
    for (i = j = 0; j < cigar_len; ++j) {
        int len = 0;
        
        for (; ;) {
            int const ch = cigar_string[i++];
            
            if (isdigit(ch))
                len = (len * 10) + (ch - '0');
            else {
                int op;
                
                for (op = 0; op < sizeof(cigar_op_codes); ++op) {
                    if (ch == cigar_op_codes[op])
                        break;
                }
                if (op == sizeof(cigar_op_codes)) {
                    rc_t const rc = RC(rcAlign, rcFile, rcProcessing, rcData, rcUnrecognized);
                    (void)PLOGERR(klogErr, (klogErr, rc, "Invalid or unrecognized CIGAR operation '$(opcode)'", "opcode=%c", ch));
                    return rc;
                }
                cigar[j].length = len;
                cigar[j].code = cigar_op_codes[op];
                cigar[j].type = cigar_op_types[op];
                cigar[j].gentype = cigar_op_gentypes[op];
                break;
            }
        }
    }
    return 0;
}

static int cigar_string_op_count(char const cigar[])
{
    unsigned n = 0;
    int st = 0;
    int i = 0;
    
    for (; ;) {
        int const ch = cigar[i];
        
        if (ch == '\0')
        break;
        
        switch (st) {
            case 0:
                if (!isdigit(ch))
                return -1;
                ++st;
                break;
            case 1:
                if (!isdigit(ch)) {
                    ++n;
                    --st;
                }
                break;
        }
        ++i;
    }
    return st == 0 ? n : -1;
}

static unsigned cigar_remove_ignored(unsigned opcount, cigar_bin_t cigar[])
{
    unsigned i = opcount;
    
    while (i) {
        unsigned const oi = i;
        unsigned const type = cigar[--i].gentype;
        
        if (type == gen_ignore_type) {
            memmove(cigar + i, cigar + oi, (opcount - oi) * sizeof(cigar[0]));
            --opcount;
        }
    }
    return opcount;
}

static
rc_t cigar2offset(int const options,
                  unsigned const cigar_len,
                  void const *in_cigar,
                  unsigned const out_sz,
                  unsigned const out_used,
                  uint8_t const intron_type,
                  compress_buffer_t out_offset[],
                  INSDC_coord_len out_seq_len[],
                  INSDC_coord_len out_ref_len[],
                  INSDC_coord_len out_max_ref_len[],
                  INSDC_coord_len out_adjust[])
{
    bool const binary = (options & ewrefmgr_cmp_Binary) ? true : false;
    int const maxopcount = binary ? cigar_len : cigar_string_op_count(in_cigar);

    memset(out_offset, 0, out_used * sizeof(*out_offset));
    
    if (maxopcount > 0) {
        cigar_bin_t  scigar[256];
        cigar_bin_t *hcigar = NULL;
        cigar_bin_t *cigar = scigar;
        
        if (maxopcount > sizeof(scigar)/sizeof(scigar[0])) {
            hcigar = malloc(maxopcount * sizeof(hcigar[0]));
            
            if (hcigar == NULL) {
                rc_t const rc = RC(rcAlign, rcFile, rcProcessing, rcMemory, rcExhausted);
                (void)PLOGERR(klogErr, (klogErr, rc, "out of memory trying to allocate $(bytes) bytes for CIGAR operations", "bytes=%u", (unsigned)(maxopcount * sizeof(hcigar[0]))));
                return rc;
            }
            cigar = hcigar;
        }
        {
            rc_t const rc = (binary ? cigar_bin : cigar_string)(cigar,
                                                                maxopcount,
                                                                in_cigar);
            if (rc)
                return rc;
        }
        /* check for hard clipping if not accepted */
        if ((options & ewrefmgr_co_AcceptHardClip) == 0) {
            unsigned i;

            for (i = 0; i < maxopcount; ++i) {
                if (cigar[i].code == 'H') {
                    rc_t const rc = RC(rcAlign, rcFile, rcProcessing, rcData, rcNotAvailable);
                    (void)LOGERR(klogErr, rc, "Hard clipping of sequence data is not allowed");
                    return rc;
                }
            }
        }
        {
            unsigned first = 0;
            unsigned opcount = cigar_remove_ignored(maxopcount, cigar);
            
            out_adjust[0] = 0;
            if ((options & ewrefmgr_cmp_Exact) == 0) {
                /* remove any leading delete operations */
                for (first = 0; first < opcount; ++first) {
                    if (cigar[first].gentype != gen_delete_type)
                        break;
                    out_adjust[0] += cigar[first].length;
                }
                /* make sure any adjacent deletes and inserts are ordered so that
                 * the delete follows the insert
                 */
                {
                    unsigned i;
#if 1
                    for (i = first; i < opcount - 1; ) {
                        cigar_bin_t const cur = cigar[i + 0];
                        cigar_bin_t const nxt = cigar[i + 1];
                        
                        if (cur.gentype != gen_delete_type)
                            ;
                        else if (nxt.gentype == gen_delete_type) {
                            unsigned const type = (cur.type == NCBI_align_ro_normal && nxt.type == NCBI_align_ro_normal) ? NCBI_align_ro_normal : NCBI_align_ro_intron_unknown;
                            int const code = type == NCBI_align_ro_normal ? 'D' : 'N';
                            unsigned const length = cur.length + nxt.length;
                            
                            --opcount;
                            memmove(cigar + i, cigar + i + 1, (opcount - i) * sizeof(cigar[0]));
                            
                            cigar[i].type = type;
                            cigar[i].code = code;
                            cigar[i].length = length;

                            continue;
                        }
                        else if (nxt.gentype == gen_insert_type) {
                            if (nxt.type == NCBI_align_ro_complete_genomics) {
                                assert(i + 2 < opcount);
                                cigar[i + 0] = nxt;
                                cigar[i + 1] = cigar[i + 2];
                                cigar[i + 2] = cur;
                                ++i;
                            }
                            else {
                                cigar[i + 0] = nxt;
                                cigar[i + 1] = cur;
                            }
                        }
                        ++i;
                    }
#else
                    for (i = first + 1; i < opcount; ) {
                        if (cigar[i].gentype == gen_insert_type && cigar[i-1].gentype == gen_delete_type) {
                            cigar_bin_t const prv = cigar[i - 1];
                            cigar_bin_t const cur = cigar[i];
                            
                            cigar[  i] = prv;
                            cigar[--i] = cur;
                            if (i <= first + 1)
                                i  = first + 1;
                        }
                        else
                            ++i;
                    }
#endif
                }
                /* merge adjacent delete type operations D+D -> D else becomes N */
                {
                    unsigned i;
                    
                    for (i = first + 1; i < opcount;) {
                        if (cigar[i].gentype == gen_delete_type && cigar[i-1].gentype == gen_delete_type) {
                            cigar[i].length += cigar[i-1].length;
                            if (cigar[i].type == NCBI_align_ro_normal && cigar[i-1].type == NCBI_align_ro_normal) {
                                cigar[i].type = NCBI_align_ro_normal;
                                cigar[i].code = 'D';
                            }
                            else {
                                cigar[i].type = NCBI_align_ro_intron_unknown;
                                cigar[i].code = 'N';
                            }
                            memmove(cigar + i - 1, cigar + i, (opcount - i) * sizeof(cigar[0]));
                            --opcount;
                        }
                        else
                            ++i;
                    }
                }
            }
            /* remove any ignored operations */
            {
                unsigned i = opcount;
                
                while (i) {
                    unsigned const oi = i;
                    cigar_bin_t const op = cigar[--i];
                    
                    if (op.gentype == gen_ignore_type) {
                        memmove(cigar + i, cigar + oi, (opcount - oi) * sizeof(cigar[0]));
                        --opcount;
                    }
                }
            }
            /* make the intron the known type */
            {
                unsigned i;
                
                for (i = first; i < opcount; ++i) {
                    if (cigar[i].type == NCBI_align_ro_intron_unknown)
                        cigar[i].type = intron_type;
                }
            }
            {
                rc_t const rc = cigar2offset_2(opcount - first,
                                               cigar + first,
                                               out_sz,
                                               out_used,
                                               out_offset,
                                               out_seq_len,
                                               out_ref_len,
                                               out_max_ref_len);
                if (hcigar)
                    free(hcigar);
                return rc;
            }
        }
        {
        }
    }
    else {
        rc_t const rc = RC(rcAlign, rcFile, rcProcessing, rcData, rcUnrecognized);
        (void)PLOGERR(klogErr, (klogErr, rc, "Invalid CIGAR string '$(cigar)'", "cigar=%s", in_cigar));
        return rc;
    }
}

LIB_EXPORT rc_t CC ReferenceSeq_TranslateOffset_int(ReferenceSeq const *const cself,
                                                    INSDC_coord_zero const offset,
                                                    int64_t *const ref_id,
                                                    INSDC_coord_zero *const ref_start,
                                                    uint64_t *const global_ref_start)
{
    if(cself == NULL)
        return RC(rcAlign, rcFile, rcProcessing, rcSelf, rcNull);
        
    if (ref_id)
        *ref_id = cself->start_rowid + offset / cself->mgr->max_seq_len;
    
    if (ref_start)
        *ref_start = offset % cself->mgr->max_seq_len;
    
    if (global_ref_start)
        *global_ref_start = (cself->start_rowid - 1) * cself->mgr->max_seq_len + offset;
        
    return 0;
}

LIB_EXPORT rc_t CC ReferenceMgr_Compress(const ReferenceMgr* cself,
                                         uint32_t options,
                                         const char* id,
                                         INSDC_coord_zero offset,
                                         const char* seq,
                                         INSDC_coord_len seq_len,
                                         const void* cigar,
                                         uint32_t cigar_len,
                                         INSDC_coord_zero allele_offset,
                                         const char* allele,
                                         INSDC_coord_len allele_len,
                                         INSDC_coord_zero offset_in_allele,
                                         const void* allele_cigar,
                                         uint32_t allele_cigar_len,
                                         uint8_t const rna_orient,
                                         TableWriterAlgnData* data)
{
    rc_t rc = 0;
    bool shouldUnmap = false;
    bool wasRenamed = false;
    const ReferenceSeq* refseq;

    if(cself == NULL || id == NULL) {
        rc = RC(rcAlign, rcFile, rcProcessing, rcParam, rcNull);
    }
    else if((rc = ReferenceMgr_GetSeq(cself, &refseq, id, &shouldUnmap, false, &wasRenamed)) == 0) {
        assert(shouldUnmap == false);
        assert(wasRenamed == false);
        rc = ReferenceSeq_Compress(refseq, options, offset, seq, seq_len, cigar, cigar_len,
                                   allele_offset, allele, allele_len,offset_in_allele,
                                   allele_cigar, allele_cigar_len, rna_orient, data);
        ReferenceSeq_Release(refseq);
    }
    ALIGN_C_DBGERR(rc);
    return rc;
}

LIB_EXPORT rc_t CC ReferenceSeq_Compress(ReferenceSeq const *const cself,
                                         uint32_t options,
                                         INSDC_coord_zero offset,
                                         const char* seq, INSDC_coord_len seq_len,
                                         const void* cigar, uint32_t cigar_len,
                                         INSDC_coord_zero allele_offset, const char* allele,
                                         INSDC_coord_len allele_len,
                                         INSDC_coord_zero offset_in_allele,
                                         const void* allele_cigar, uint32_t allele_cigar_len,
                                         uint8_t const rna_orient,
                                         TableWriterAlgnData* data)
{
    rc_t rc = 0;
    ReferenceSeq *const self = (ReferenceSeq *)cself;

    if (self == NULL || seq == NULL || cigar == NULL || cigar_len == 0 || data == NULL ||
        (!(allele == NULL && allele_len == 0 && allele_cigar == NULL && allele_cigar_len == 0) &&
         !(allele != NULL && allele_cigar != NULL && allele_cigar_len != 0)))
    {
        return RC(rcAlign, rcFile, rcProcessing, rcParam, rcInvalid);
    }

    if (seq_len > self->mgr->compress.elem_count) {
        rc = KDataBufferResize(&self->mgr->compress, seq_len);
        if (rc) return rc;
    }
    {
        INSDC_coord_len i, seq_pos = 0, allele_ref_end = 0, ref_len = 0, rl = 0, max_rl = 0;
        INSDC_coord_zero* read_start = &((INSDC_coord_zero*)(data->read_start.buffer))[data->ploidy];
        INSDC_coord_len* read_len = &((INSDC_coord_len*)(data->read_len.buffer))[data->ploidy];
        bool* has_ref_offset, *has_mismatch;
        int32_t *const ref_offset       = (int32_t *)data->ref_offset.buffer;
        uint8_t *const ref_offset_type  = (uint8_t *)data->ref_offset_type.buffer;
        uint8_t *mismatch;
        uint8_t sref_buf[64 * 1024];
        void *href_buf = NULL;
        uint8_t *ref_buf = sref_buf;
        compress_buffer_t allele_off_buf[1024];
        INSDC_coord_len position_adjust = 0;
#if _DEBUGGING
        uint64_t i_ref_offset_elements, i_mismatch_elements;
        char x[4096];
#endif

        if(data->ploidy == 0) {
            data->has_ref_offset.elements = seq_len;
            data->ref_offset.elements = 0;
            data->has_mismatch.elements = seq_len;
            data->mismatch.elements = 0;
            *read_start = 0;
        }
        else {
            data->has_ref_offset.elements += seq_len;
            data->has_mismatch.elements += seq_len;
            *read_start = read_start[-1] + read_len[-1];
        }
        *read_len = seq_len;
        has_ref_offset = &((bool*)(data->has_ref_offset.buffer))[*read_start];
        has_mismatch = &((bool*)(data->has_mismatch.buffer))[*read_start];
        mismatch = (uint8_t*)(data->mismatch.buffer);

#if _DEBUGGING
        i_ref_offset_elements = data->ref_offset.elements;
        i_mismatch_elements = data->mismatch.elements;
        ALIGN_C_DBG("align%s '%.*s'[%u] to '%s:%s' at %i", (options & ewrefmgr_cmp_Exact) ? " EXACT" : "",
                    seq_len, seq, seq_len, cself->id, cself->seqId, offset);
#endif
        if(allele != NULL) {
            /* determine length of reference for subst by allele */
            ALIGN_C_DBG("apply allele %.*s[%u] at %i w/cigar below",
                        allele_len, allele, allele_len, allele_offset);
            rc = cigar2offset(options|ewrefmgr_cmp_Exact,
                              allele_cigar_len,
                              allele_cigar,
                              sizeof(allele_off_buf) / sizeof(*allele_off_buf),
                              allele_len,
                              ' ',
                              allele_off_buf,
                              &seq_pos,
                              &allele_ref_end,
                              &max_rl,
                              &position_adjust);
            /* where allele ends on reference */
            allele_ref_end += allele_offset;
        }
        if(rc == 0) {
            rc = cigar2offset(options,
                              cigar_len,
                              cigar,
                              (unsigned)self->mgr->compress.elem_count,
                              seq_len,
                              rna_orient,
                              self->mgr->compress.base,
                              &seq_pos,
                              &rl,
                              &max_rl,
                              &position_adjust);
            offset += position_adjust;
        }
        if (allele != NULL) {
            if (allele_ref_end < offset || offset + rl < allele_offset) {
                /* allele and alignment don't intersect             */
                /* TODO: [VDB-1585] try to make this recoverable    */
                rc = RC(rcAlign, rcFile, rcProcessing, rcData, rcInvalid);
                (void)PLOGERR(klogWarn, (klogWarn, rc,
                    "allele $(a) offset $(ao) $(ac) is not within referenced region in $(id) at offset $(ro) $(rc)",
                    "a=%.*s,ao=%i,ac=%.*s,id=%s,ro=%i,rc=%.*s",
                    allele_len, allele, allele_offset, (options & ewrefmgr_cmp_Binary) ? 0 : allele_cigar_len, allele_cigar,
                    self->seqId, offset, (options & ewrefmgr_cmp_Binary) ? 0 : cigar_len, cigar));
            }
        }
        if(rc == 0) {
            ref_len = rl;
            if((offset + max_rl) > self->seq_len && !self->circular) {
                max_rl = self->seq_len - offset;
                if(max_rl < rl) {
                    /* ref_len used for compression cannot be shorter than ref_len derived from cigar,
                       if there is a shortage it will fail later here */
                    max_rl = rl;
                }
                ALIGN_C_DBG("max_ref_len truncated to %u cause it goes beyond refseq length %lu at offset %i",
                             max_rl, cself->seq_len, offset);
            }
            ALIGN_C_DBG("chosen REF_LEN %u, ref len for match %u", ref_len, max_rl);

            if (seq_len != seq_pos) {
                rc = RC(rcAlign, rcFile, rcProcessing, rcData, rcInvalid);
            }
            if (rc == 0) {
                if (max_rl > sizeof(sref_buf)) {
                    if (href_buf)
                        free(href_buf);
                    href_buf = malloc(max_rl);
                    if (href_buf == NULL)
                        rc = RC(rcAlign, rcFile, rcProcessing, rcMemory, rcExhausted);
                    ref_buf = href_buf;
                }
            }
            if (rc == 0) {
                if(allele != NULL) {
                    /* subst allele in reference */
                    if(allele_offset <= offset) {
                        /* move allele start inside referenced chunk */
                        allele     += offset_in_allele;
                        allele_len -= offset_in_allele;
                        rl = 0;
                    } else {
                        /* fetch portion of reference which comes before allele */
                        rl = allele_offset - offset;
                        rc = ReferenceSeq_ReadDirect(self, offset, rl, true, ref_buf, &i, false);
                        if(rc == 0 && rl != i) {
                            /* here we need to test it otherwise excessive portion of allele could be fetch in next if */
                            rc = RC(rcAlign, rcFile, rcProcessing, rcRange, rcExcessive);
                        }
                    }
                    if(rc == 0 && allele_len < (max_rl - rl)) {
                        memmove(&ref_buf[rl], allele, allele_len);
                        rl += allele_len;
                        /* append tail of actual reference */
                        rc = ReferenceSeq_ReadDirect(self, allele_ref_end, max_rl - rl, true, &ref_buf[rl], &i, false);
                        rl += i;
                    } else if(rc == 0) {
                        /* allele is longer than needed */
                        memmove(&ref_buf[rl], allele, max_rl - rl);
                        rl = max_rl;
                    }
                }
                else {
                    rc = ReferenceSeq_ReadDirect(self, offset, max_rl, true, ref_buf, &rl, false);
                }
                if (rc != 0 || max_rl != rl) {
                    rc = rc ? rc : RC(rcAlign, rcFile, rcProcessing, rcRange, rcExcessive);
                    ALIGN_C_DBGERRP("refseq is shorter: at offset %i need %u bases", rc, offset, max_rl);
                }
                else {
                    compress_buffer_t *const compress_buf = self->mgr->compress.base;
                    unsigned ro = (unsigned)data->ref_offset.elements;
                    int ref_pos;
                    
                    for (seq_pos = 0, ref_pos = 0; seq_pos < seq_len; seq_pos++, ref_pos++) {
                        int const length = compress_buf[seq_pos].length;
                        int const type = compress_buf[seq_pos].type;

#if 0
                        ALIGN_C_DBG("seq_pos: %u, ref_pos: %i, offset: %i, type: %i, ro: %u", seq_pos, ref_pos, length, type, ro);
#endif
                        if (length == 0 && type == 0)
                            has_ref_offset[seq_pos] = 0;
                        else {
                            has_ref_offset[seq_pos] = 1;
                            ref_offset[ro] = length;
                            ref_offset_type[ro] = type;
                            ref_pos += length;
                            ++ro;
                        }
                        if (ref_pos < 0 || ref_pos >= max_rl ||
                            ((toupper(ref_buf[ref_pos]) != toupper(seq[seq_pos])) && (seq[seq_pos] != '=')))
                        {
                            has_mismatch[seq_pos] = 1;
                            mismatch[data->mismatch.elements++] = seq[seq_pos];
                        }
                        else {
                            has_mismatch[seq_pos] = 0;
                        }
                    }
                    data->ref_offset.elements = data->ref_offset_type.elements = ro;
                }
            }
        }
#if _DEBUGGING
        if(rc == 0) {
            int32_t j;
            memset(x, '-', sizeof(x) - 1);
            x[sizeof(x) - 2] = '\0';

            ALIGN_C_DBG("ref: %.*s [%u]", max_rl, ref_buf, max_rl);
            ALIGN_C_DBGF(("%s:%u: ref: ", __func__, __LINE__));
            for(seq_pos = 0, j = 0, rl = 0, i = 0; seq_pos < seq_len; seq_pos++, j++) {
                if(has_ref_offset[seq_pos]) {
                    if(ref_offset[i_ref_offset_elements + rl] > 0) {
                        ALIGN_C_DBGF(("%.*s", (uint32_t)(ref_offset[i_ref_offset_elements + rl]), &ref_buf[j]));
                    } else {
                        i = -ref_offset[i_ref_offset_elements + rl];
                    }
                    j += ref_offset[i_ref_offset_elements + rl];
                    rl++;
                }
                ALIGN_C_DBGF(("%c", (j < 0 || j >= max_rl) ? '-' : (i > 0) ? tolower(ref_buf[j]) : ref_buf[j]));
                if(i > 0 ) {
                    i--;
                }
            }
            ALIGN_C_DBGF(("\n%s:%u: seq: ", __func__, __LINE__));
            for(i = 0, j = 0; i < seq_len; i++) {
                if(has_ref_offset[i] && ref_offset[i_ref_offset_elements + j++] > 0) {
                    ALIGN_C_DBGF(("%.*s", ref_offset[i_ref_offset_elements + j - 1], x));
                }
                ALIGN_C_DBGF(("%c", seq[i]));
            }
            ALIGN_C_DBGF((" [%u]\n", seq_len));
            ALIGN_C_DBGF(("%s:%u: hro: ", __func__, __LINE__));
            for(i = 0, j = 0; i < seq_len; i++) {
                if(has_ref_offset[i] && ref_offset[i_ref_offset_elements + j++] > 0) {
                    ALIGN_C_DBGF(("%.*s", ref_offset[i_ref_offset_elements + j - 1], x));
                }
                ALIGN_C_DBGF(("%c", has_ref_offset[i] + '0'));
            }
            ALIGN_C_DBGF((", ro:"));
            for(i = i_ref_offset_elements; i < data->ref_offset.elements; i++) {
                ALIGN_C_DBGF((" %i,", ref_offset[i]));
            }
            ALIGN_C_DBGF(("[%u]\n", data->ref_offset.elements - i_ref_offset_elements));
            ALIGN_C_DBGF(("%s:%u: hmm: ", __func__, __LINE__));
            for(i = 0, j = 0; i < seq_len; i++) {
                if(has_ref_offset[i] && ref_offset[i_ref_offset_elements + j++] > 0) {
                    ALIGN_C_DBGF(("%.*s", ref_offset[i_ref_offset_elements + j - 1], x));
                }
                ALIGN_C_DBGF(("%c", has_mismatch[i] + '0'));
            }
            ALIGN_C_DBGF((", mm: '%.*s'[%u]\n", (int)(data->mismatch.elements - i_mismatch_elements),
                &mismatch[i_mismatch_elements], data->mismatch.elements - i_mismatch_elements));
        }
#endif
        if(rc == 0) {
            if(data->ploidy == 0) {
                int64_t *const ref_id = (int64_t *)data->ref_id.buffer;
                INSDC_coord_zero *const ref_start = (INSDC_coord_zero *)data->ref_start.buffer;
                uint64_t *const global_ref_start = (uint64_t *)data->global_ref_start.buffer;
                
                data->ref_1st_row_id = self->start_rowid;
                data->effective_offset = offset;
                data->ref_len = ref_len;
                ALIGN_C_DBGF(("%s:%u: reference 1st ROW_ID %li OFFSET %i REF_LEN %u",
                    __func__, __LINE__, data->ref_1st_row_id, data->effective_offset, data->ref_len));
                
                ReferenceSeq_TranslateOffset_int(self, offset, ref_id, ref_start, global_ref_start);
                
                if (ref_id) {
                    data->ref_id.elements = 1;
                    ALIGN_C_DBGF((" REF_ID %li", ref_id[0]));
                }
                if (ref_start) {
                    data->ref_start.elements = 1;
                    ALIGN_C_DBGF((" REF_START %i", ref_start[0]));
                }
                if (global_ref_start) {
                    data->global_ref_start.elements = 1;
                    ALIGN_C_DBGF((" GLOBAL_REF_START %lu", global_ref_start[0]));
                }
                ALIGN_C_DBGF(("\n"));
            } else {
                if(data->ref_1st_row_id != self->start_rowid || data->effective_offset != offset) {
                    rc = RC(rcAlign, rcFile, rcProcessing, rcData, rcInconsistent);
                    (void)PLOGERR(klogErr, (klogErr, rc,
                        "all reads in alignment record must align to same refseq at same location $(r1)@$(o1) <> $(r2):$(a2)@$(o2)",
                        "r1=%li,o1=%i,r2=%s,a2=%s,o2=%i", data->ref_1st_row_id, data->effective_offset, self->id, self->seqId, offset));
                } else if(data->ref_len != ref_len) {
                    rc = RC(rcAlign, rcFile, rcProcessing, rcData, rcInconsistent);
                    (void)PLOGERR(klogErr, (klogErr, rc,
                        "all reads in alignment record must have same size projection on refseq $(rl1) <> $(rl2) $(r):$(a)@$(o)",
                        "rl1=%u,rl2=%u,r=%s,a=%s,o=%i", data->ref_len, ref_len, self->id, self->seqId, offset));
                }
            }
        }
        if(rc == 0) {
            data->ploidy++;
            data->read_start.elements = data->ploidy;
            data->read_len.elements = data->ploidy;
        }
        if (href_buf)
            free(href_buf);
    }
    ALIGN_C_DBGERR(rc);
    return rc;
}

LIB_EXPORT rc_t CC ReferenceSeq_Read(const ReferenceSeq* cself, INSDC_coord_zero offset, INSDC_coord_len len,
                                     uint8_t* buffer, INSDC_coord_len* ref_len)
{
    rc_t rc = 0;

    if(cself == NULL || buffer == NULL || ref_len == NULL) {
        rc = RC(rcAlign, rcFile, rcReading, rcParam, rcNull);
    } else {
        rc = ReferenceSeq_ReadDirect((ReferenceSeq*)cself, offset, len, true, buffer, ref_len, false);
    }
    ALIGN_DBGERR(rc);
    return rc;
}

LIB_EXPORT rc_t CC ReferenceSeq_Get1stRow(const ReferenceSeq* cself, int64_t* row_id)
{
    rc_t rc = 0;

    if(cself == NULL || row_id == NULL) {
        rc = RC(rcAlign, rcFile, rcReading, rcParam, rcNull);
    } else {
        *row_id = cself->start_rowid;
    }
    return rc;
}

LIB_EXPORT rc_t CC ReferenceSeq_GetID(ReferenceSeq const *const self, char const **const rslt)
{
    assert(self != NULL);
    assert(rslt != NULL);
    *rslt = self->id;
    return 0;
}

LIB_EXPORT rc_t CC ReferenceSeq_AddCoverage(const ReferenceSeq* cself, INSDC_coord_zero offset, const ReferenceSeqCoverage* data)
{
    rc_t rc = 0;

    if(cself == NULL || data == NULL) {
        rc = RC(rcAlign, rcFile, rcReading, rcParam, rcNull);
    } else if(!(cself->mgr->options & ewrefmgr_co_Coverage)) {
        rc = RC(rcAlign, rcType, rcWriting, rcData, rcUnexpected);
        ALIGN_R_DBGERRP("coverage %s", rc, "data");
    } else if((rc = ReferenceSeq_ReOffset(cself->circular, cself->seq_len, &offset)) == 0) {
        rc = TableWriterRef_WriteCoverage(cself->mgr->writer, cself->start_rowid, offset, data);
    }
    ALIGN_DBGERR(rc);
    return rc;
}

LIB_EXPORT rc_t CC ReferenceSeq_Release(const ReferenceSeq *cself)
{
    return 0;
}
