backends/quartz/quartz_utils.h

Go to the documentation of this file.

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

#ifndef OM_HGUARD_QUARTZ_UTILS_H
#define OM_HGUARD_QUARTZ_UTILS_H

#include <xapian/types.h>

#include <string>

using namespace std;

#define CASSERT(a) {char assert[(a) ? 1 : -1];(void)assert;}

#define CASSERT_TYPE_UNSIGNED(T) CASSERT(static_cast<T>(-1) > 0)

typedef unsigned char       om_byte;
typedef unsigned int        om_uint32;
typedef int                 om_int32;

template<class T>
bool
unpack_uint(const char ** src,
            const char * src_end,
            T * resultptr)
{
    // Check unsigned
    CASSERT_TYPE_UNSIGNED(T);

    // Check byte is what it's meant to be
    CASSERT(sizeof(om_byte) == 1);

    unsigned int shift = 0;
    T result = 0;

    while (true) {
        if ((*src) == src_end) {
            *src = 0;
            return false;
        }

        om_byte part = static_cast<om_byte>(**src);
        (*src)++;

        // if new byte might cause overflow, and it does
        if (((shift > (sizeof(T) - 1) * 8 + 1) &&
             ((part & 0x7f) << (shift % 8)) >= 0x100) ||
            (shift >= sizeof(T) * 8))  {
            // Overflowed - move to end of this integer
            while (true) {
                if ((part & 0x80) == 0) return false;
                if ((*src) == src_end) {
                    *src = 0;
                    return false;
                }
                part = static_cast<om_byte>(**src);
                (*src)++;
            }
        }

        result += T(part & 0x7f) << shift;
        shift += 7;

        if ((part & 0x80) == 0) {
            if (resultptr) *resultptr = result;
            return true;
        }
    }
}


template<class T>
string
pack_uint(T value)
{
    // Check unsigned
    CASSERT_TYPE_UNSIGNED(T);

    if (value == 0) return string("", 1u);
    string result;

    while (value != 0) {
        om_byte part = static_cast<om_byte>(value & 0x7f);
        value = value >> 7;
        if (value) part |= 0x80;
        result.append(1u, char(part));
    }

    return result;
}

template<>
inline string
pack_uint<bool>(bool value)
{
    return string(1, static_cast<char>(value));
}

template<class T>
bool
unpack_uint_last(const char ** src, const char * src_end, T * resultptr)
{
    // Check unsigned
    CASSERT_TYPE_UNSIGNED(T);
    // Check byte is what it's meant to be
    CASSERT(sizeof(om_byte) == 1);

    if (src_end - *src > int(sizeof(T))) {
        // Would overflow
        *src = src_end;
        return false;
    }

    T result = 0;
    int shift = 0;
    while (*src != src_end) {
        result |= static_cast<T>(static_cast<om_byte>(**src)) << shift;
        ++(*src);
        shift += 8;
    }
    *resultptr = result;
    return true;
}

template<class T>
string
pack_uint_last(T value)
{
    // Check unsigned
    CASSERT_TYPE_UNSIGNED(T);

    string result;
    while (value) {
        result += char(value);
        value >>= 8;
    }
    return result;
}

template<class T>
string
pack_uint_preserving_sort(T value)
{
    // Check unsigned
    CASSERT_TYPE_UNSIGNED(T);

    string result;
    while (value != 0) {
        om_byte part = static_cast<om_byte>(value & 0xff);
        value = value >> 8;
        result.insert(string::size_type(0), 1u, char(part));
    }
    result.insert(string::size_type(0), 1u, char(result.size()));
    return result;
}

template<class T>
bool
unpack_uint_preserving_sort(const char ** src,
                            const char * src_end,
                            T * resultptr)
{
    if (*src == src_end) {
        *src = 0;
        return false;
    }

    unsigned int length = static_cast<om_byte>(**src);
    (*src)++;

    if (length > sizeof(T)) {
        *src += length;
        if (*src > src_end) {
            *src = 0;
        }
        return false;
    }

    // Can't be overflow now.
    T result = 0;
    while (length > 0) {
        result = result << 8;
        result += static_cast<om_byte>(**src);
        (*src)++;
        length--;
    }
    *resultptr = result;

    return true;
}

inline bool
unpack_string(const char ** src,
              const char * src_end,
              string & result)
{
    string::size_type length;
    if (!unpack_uint(src, src_end, &length)) {
        return false;
    }

    if (src_end - *src < 0 ||
        string::size_type(src_end - *src) < length) {
        src = 0;
        return false;
    }

    result = string(*src, length);
    *src += length;
    return true;
}

inline string
pack_string(string value)
{
    return pack_uint(value.size()) + value;
}

inline string
pack_string_preserving_sort(string value)
{
    string::size_type i = 0, j;
    while ((j = value.find('\0', i)) != string::npos) {
        value.replace(j, 1, "\0\xff", 2);
        i = j + 2;
    }
    value += '\0'; // FIXME temp...
    return value + '\0'; // Note - next byte mustn't be '\xff'...
}

inline bool
unpack_string_preserving_sort(const char ** src,
                              const char * src_end,
                              string & result)
{
    result = "";
    while (*src < src_end) {
        const char *begin = *src;
        while (**src) {
            ++(*src);
            if (*src == src_end) return false;
        }
        result += string(begin, *src - begin);
        ++(*src);
        if (*src == src_end) return false;
        if (**src != '\xff') {
            ++(*src); // FIXME temp
            return true;
        }
        result += '\0';
        ++(*src);
    }
    return false;
}

inline bool
unpack_bool(const char ** src,
            const char * src_end,
            bool * resultptr)
{
    if (*src == src_end) {
        *src = 0;
        return false;
    }
    switch (*((*src)++)) {
        case '0':
            if (resultptr) *resultptr = false;
            return true;
        case '1':
            if (resultptr) *resultptr = true;
            return true;
    }
    *src = 0;
    return false;
}

inline string
pack_bool(bool value)
{
    return value ? "1" : "0";
}

inline string
quartz_docid_to_key(Xapian::docid did)
{
    return pack_uint_last(did);
}

#endif /* OM_HGUARD_QUARTZ_UTILS_H */

---