tommyarray.h

Go to the documentation of this file.

/*
 * Copyright (c) 2011, 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 __TOMMYARRAY_H
#define __TOMMYARRAY_H
 
#include "tommytypes.h"
 
#include <assert.h> /* for assert */
 
/******************************************************************************/
/* array */
 
#define TOMMY_ARRAY_BIT 6
 
typedef struct tommy_array_struct {
        void** bucket[TOMMY_SIZE_BIT]; 
        tommy_size_t bucket_max; 
        tommy_size_t count; 
        tommy_uint_t bucket_bit; 
} tommy_array;
 
TOMMY_API void tommy_array_init(tommy_array* array);
 
TOMMY_API void tommy_array_done(tommy_array* array);
 
TOMMY_API void tommy_array_grow(tommy_array* array, tommy_size_t size);
 
tommy_inline void** tommy_array_ref(tommy_array* array, tommy_size_t pos)
{
        tommy_uint_t bsr;
 
        assert(pos < array->count);
 
        /* get the highest bit set, in case of all 0, return 0 */
        bsr = tommy_ilog2(pos | 1);
 
        return &array->bucket[bsr][pos];
}
 
tommy_inline void tommy_array_set(tommy_array* array, tommy_size_t pos, void* element)
{
        *tommy_array_ref(array, pos) = element;
}
 
tommy_inline void* tommy_array_get(tommy_array* array, tommy_size_t pos)
{
        return *tommy_array_ref(array, pos);
}
 
tommy_inline void tommy_array_insert(tommy_array* array, void* element)
{
        tommy_size_t pos = array->count;
 
        tommy_array_grow(array, pos + 1);
 
        tommy_array_set(array, pos, element);
}
 
tommy_inline tommy_size_t tommy_array_size(tommy_array* array)
{
        return array->count;
}
 
TOMMY_API tommy_size_t tommy_array_memory_usage(tommy_array* array);
 
#endif