source: mainline/uspace/lib/c/include/adt/dyn_array.h@ 241f1985

/*
 * Copyright (c) 2015 Michal Koutny
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - 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.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
 */

/** @addtogroup libc
 * @{
 */
/** @file
 */

#ifndef LIBC_DYN_ARRAY_H_
#define LIBC_DYN_ARRAY_H_

#include <stdbool.h>
#include <stddef.h>

typedef struct {
        /** Data buffer of array */
        void *_data;
        /** Size on bytes of a single item */
        size_t _item_size;

        /** Allocated space (in items) of the array */
        size_t capacity;
        /** No. of items in the array */
        size_t size;
} dyn_array_t;

/** Initialize dynamic array
 *
 * @param[in]  capacity  initial capacity of array
 *
 * @return void
 */
#define dyn_array_initialize(dyn_array, type)                                  \
        _dyn_array_initialize((dyn_array), sizeof(type))


/** Dynamic array accessor
 *
 * @return lvalue for the given item
 */
#define dyn_array_at(dyn_array, type, index)                                   \
        (*((type *) (dyn_array)->_data + index))


/** Access last element
 *
 * @return lvalue for the last item
 */
#define dyn_array_last(dyn_array, type)                                        \
        (*((type *) (dyn_array)->_data + ((dyn_array)->size - 1)))


/** Insert item at given position, shift rest of array
 *
 * @return EOK on success
 * @return ENOMEM on failure
 */
#define dyn_array_insert(dyn_array, type, index, value)                        \
({                                                                             \
        size_t _index = (index);                                               \
        dyn_array_t *_da = (dyn_array);                                        \
        int rc = dyn_array_reserve(_da, _da->size + 1);                        \
        if (!rc) {                                                             \
                _dyn_array_shift(_da, _index, 1);                              \
                dyn_array_at(_da, type, _index) = (value);                     \
        }                                                                      \
        rc;                                                                    \
})

/** Insert item at the end of array
 *
 * @return EOK on success
 * @return ENOMEM on failure
 */
#define dyn_array_append(dyn_array, type, value)                               \
        dyn_array_insert(dyn_array, type, (dyn_array)->size, (value))


/** Dynamic array iteration
 *
 * @param[in]  dyn_array   dyn_array_t (not pointer)
 * @param[in]  it          name of variable used as iterator, it's pointer
 *                         to @p type
 */
#define dyn_array_foreach(dyn_array, type, it)                                 \
        for (type *it = NULL; it == NULL; it = (type *)1)                      \
            for (type *_it = (type *)(dyn_array)._data;                        \
            it = _it, _it != ((type *)(dyn_array)._data + (dyn_array).size);   \
            ++_it)

/** Find first occurence of value
 *
 * @param[in]  dyn_array   dyn_array_t *
 * @param[in]  value       value to search for
 *
 * @return  index of found value or size of array when no found
 */
#define dyn_array_find(dyn_array, type, value)                                 \
({                                                                             \
        size_t _result = (dyn_array)->size;                                    \
        dyn_array_foreach(*(dyn_array), type, _it) {                           \
                if (*_it == value) {                                           \
                        _result = _it - (type *)(dyn_array)->_data;            \
                        break;                                                 \
                }                                                              \
        }                                                                      \
        _result;                                                               \
})

extern void dyn_array_destroy(dyn_array_t *);
extern void dyn_array_remove(dyn_array_t *, size_t);
void dyn_array_clear(dyn_array_t *);
void dyn_array_clear_range(dyn_array_t *, size_t, size_t);
extern int dyn_array_concat(dyn_array_t *, dyn_array_t *);
extern int dyn_array_reserve(dyn_array_t *, size_t);

extern void _dyn_array_initialize(dyn_array_t *, size_t);
extern void _dyn_array_shift(dyn_array_t *, size_t, size_t);
extern void _dyn_array_unshift(dyn_array_t *, size_t, size_t);

#endif

/** @}
 */