tommytypes.h

Go to the documentation of this file.

/*
 * Copyright (c) 2010, Andrea Mazzoleni. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */
 
#ifndef __TOMMYTYPES_H
#define __TOMMYTYPES_H
 
/******************************************************************************/
/* types */
 
#include <stddef.h>
 
#if defined(_MSC_VER)
typedef unsigned tommy_uint32_t; 
typedef unsigned _int64 tommy_uint64_t; 
typedef size_t tommy_uintptr_t; 
#else
#include <stdint.h>
typedef uint32_t tommy_uint32_t; 
typedef uint64_t tommy_uint64_t; 
typedef uintptr_t tommy_uintptr_t; 
#endif
typedef size_t tommy_size_t; 
typedef ptrdiff_t tommy_ptrdiff_t; 
typedef int tommy_bool_t; 
typedef tommy_uint32_t tommy_uint_t;
 
typedef tommy_uint32_t tommy_count_t;
 
#ifdef __cplusplus
#define tommy_cast(type, value) static_cast<type>(value)
#else
#define tommy_cast(type, value) (value)
#endif
 
/******************************************************************************/
/* heap */
 
/* by default uses malloc/calloc/realloc/free */
 
#if !defined(tommy_malloc) || !defined(tommy_calloc) || !defined(tommy_realloc) || !defined(tommy_free)
#include <stdlib.h>
#endif
#if !defined(tommy_malloc)
#define tommy_malloc malloc
#endif
#if !defined(tommy_calloc)
#define tommy_calloc calloc
#endif
#if !defined(tommy_realloc)
#define tommy_realloc realloc
#endif
#if !defined(tommy_free)
#define tommy_free free
#endif
 
/******************************************************************************/
/* modificators */
 
#if !defined(tommy_inline)
#if defined(_MSC_VER) || defined(__GNUC__)
#define tommy_inline static __inline
#else
#define tommy_inline static
#endif
#endif
 
#if !defined(tommy_restrict)
#if __STDC_VERSION__ >= 199901L
#define tommy_restrict restrict
#elif defined(_MSC_VER) || defined(__GNUC__)
#define tommy_restrict __restrict
#else
#define tommy_restrict
#endif
#endif
 
#if !defined(tommy_likely)
#if defined(__GNUC__)
#define tommy_likely(x) __builtin_expect(!!(x), 1)
#else
#define tommy_likely(x) (x)
#endif
#endif
 
#if !defined(tommy_unlikely)
#if defined(__GNUC__)
#define tommy_unlikely(x) __builtin_expect(!!(x), 0)
#else
#define tommy_unlikely(x) (x)
#endif
#endif
 
/******************************************************************************/
/* key */
 
typedef tommy_uint32_t tommy_key_t;
 
#define TOMMY_KEY_BIT (sizeof(tommy_key_t) * 8)
 
/******************************************************************************/
/* node */
 
typedef struct tommy_node_struct {
    struct tommy_node_struct* next;
 
    struct tommy_node_struct* prev;
 
    void* data;
 
    tommy_key_t key;
} tommy_node;
 
/******************************************************************************/
/* compare */
 
typedef int tommy_compare_func(const void* obj_a, const void* obj_b);
 
typedef int tommy_search_func(const void* arg, const void* obj);
 
typedef void tommy_foreach_func(void* obj);
 
typedef void tommy_foreach_arg_func(void* arg, void* obj);
 
/******************************************************************************/
/* bit hacks */
 
#if defined(_MSC_VER) && !defined(__cplusplus)
#include <intrin.h>
#pragma intrinsic(_BitScanReverse)
#pragma intrinsic(_BitScanForward)
#endif
 
#define TOMMY_ILOG2(value) ((value) == 256 ? 8 : (value) == 128 ? 7 : (value) == 64 ? 6 : (value) == 32 ? 5 : (value) == 16 ? 4 : (value) == 8 ? 3 : (value) == 4 ? 2 : (value) == 2 ? 1 : 0)
 
tommy_inline tommy_uint_t tommy_ilog2_u32(tommy_uint32_t value)
{
#if defined(_MSC_VER)
    unsigned long count;
    _BitScanReverse(&count, value);
    return count;
#elif defined(__GNUC__)
    /*
     * GCC implements __builtin_clz(x) as "__builtin_clz(x) = bsr(x) ^ 31"
     *
     * Where "x ^ 31 = 31 - x", but gcc does not optimize "31 - __builtin_clz(x)" to bsr(x),
     * but generates 31 - (bsr(x) xor 31).
     *
     * So we write "__builtin_clz(x) ^ 31" instead of "31 - __builtin_clz(x)",
     * to allow the double xor to be optimized out.
     */
    return __builtin_clz(value) ^ 31;
#else
    /* Find the log base 2 of an N-bit integer in O(lg(N)) operations with multiply and lookup */
    /* from http://graphics.stanford.edu/~seander/bithacks.html */
    static unsigned char TOMMY_DE_BRUIJN_INDEX_ILOG2[32] = {
        0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30,
        8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31
    };
 
    value |= value >> 1;
    value |= value >> 2;
    value |= value >> 4;
    value |= value >> 8;
    value |= value >> 16;
 
    return TOMMY_DE_BRUIJN_INDEX_ILOG2[(tommy_uint32_t)(value * 0x07C4ACDDU) >> 27];
#endif
}
 
tommy_inline tommy_uint_t tommy_ctz_u32(tommy_uint32_t value)
{
#if defined(_MSC_VER)
    unsigned long count;
    _BitScanForward(&count, value);
    return count;
#elif defined(__GNUC__)
    return __builtin_ctz(value);
#else
    /* Count the consecutive zero bits (trailing) on the right with multiply and lookup */
    /* from http://graphics.stanford.edu/~seander/bithacks.html */
    static const unsigned char TOMMY_DE_BRUIJN_INDEX_CTZ[32] = {
        0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,
        31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9
    };
 
    return TOMMY_DE_BRUIJN_INDEX_CTZ[(tommy_uint32_t)(((value & - value) * 0x077CB531U)) >> 27];
#endif
}
 
tommy_inline tommy_uint32_t tommy_roundup_pow2_u32(tommy_uint32_t value)
{
    /* Round up to the next highest power of 2 */
    /* from http://www-graphics.stanford.edu/~seander/bithacks.html */
 
    --value;
    value |= value >> 1;
    value |= value >> 2;
    value |= value >> 4;
    value |= value >> 8;
    value |= value >> 16;
    ++value;
 
    return value;
}
#endif