sources/list.c

Go to the documentation of this file.

/*
** Copyright 2009-2011, helixis.org
** 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.
**
** Neither the name of the helixis.org nor the names of its contributors may be used to endorse or promote
** products derived from this software without specific prior written permission.
**
** 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 HOLDER 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.
*/

/*
** INCLUDES
*/

#include "hlx/core.h"
#include "helixis_internal.h"

/*
** EXTERNALS
*/

extern hlx_api gl_api;

/*
** FUNCTIONS
*/

void hlx_list_construct(hlx_list* list)
{
    list->first = 0;
    list->last = 0;
    list->size = 0;
}

void hlx_list_destruct(hlx_list* list)
{
    hlx_list_clear(list);
}

hlx_list_node* hlx_list_push_front(hlx_list* list, void* data)
{
        hlx_list_node* node;

        node = gl_api.malloc_entry(sizeof(*node));
        if (node == 0)
                return (0);
        node->data = data;
        node->next = list->first;
        node->parent = 0;
        if (!list->first)
                list->last = node;
        else
                list->first->parent = node;
        list->first = node;
#ifdef HLX_BUILD_WITH_PARALLEL_THREADING
        gl_api.atomic_incr_entry(&list->size);
#else
        ++list->size;
#endif
        return (list->first);
}

hlx_list_node* hlx_list_push_back(hlx_list* list, void* data)
{
        hlx_list_node* node;
        hlx_list_node* tmp;

        node = gl_api.malloc_entry(sizeof(*node));
        if (node == 0)
                return (0);
        tmp = list->first;
        node->data = data;
        node->next = 0;
        if (!list->last)
                list->first = node;
        else
                list->last->next = node;
        node->parent = list->last;
        list->last = node;
#ifdef HLX_BUILD_WITH_PARALLEL_THREADING
       gl_api.atomic_incr_entry(&list->size);
#else
        ++list->size;
#endif
        return (list->last);
}

hlx_list_node* hlx_list_find(const hlx_list* list, void* data)
{
        hlx_list_node* it;

        for (it = list->first; it; it = it->next)
                if (it->data == data)
                        break;
        return (it);
}

hlx_list_node* hlx_list_get(const hlx_list* list, unsigned int pos)
{
    hlx_list_node* it;
    unsigned int i;

    for (i = 0, it = list->first; it; it = it->next, ++i)
            if (i == pos)
               return (it);
    return (0);
}

void hlx_list_erase(hlx_list* list, hlx_list_node* node)
{
    hlx_list_node* it;
        hlx_list_node* prev;

        for (it = list->first, prev = 0; it; it = it->next)
        {
                if (it == node)
                {
                        if (!prev)
                                list->first = it->next;
                        else
                                prev->next = it->next;
                        if (!it->next)
                                list->last = prev;
                        gl_api.free_entry(node);
#ifdef HLX_BUILD_WITH_PARALLEL_THREADING
                        gl_api.atomic_decr_entry(&list->size);
#else
                        --list->size;
#endif
                        return;
                }
                prev = it;
        }
}

void hlx_list_clear(hlx_list* list)
{
        hlx_list_node* it;
        hlx_list_node* tmp;

        it = list->first;
        while (it)
        {
                tmp = it;
                it = it->next;
                gl_api.free_entry(tmp);
#ifdef HLX_BUILD_WITH_PARALLEL_THREADING
                gl_api.atomic_decr_entry(&list->size);
#else
                --list->size;
#endif
        }
        list->first = 0;
        list->last = 0;
}

void hlx_list_clear_data(hlx_list* list)
{
        hlx_list_node* it;
        hlx_list_node* tmp;

        it = list->first;
        while (it)
        {
                tmp = it;
                it = it->next;
                gl_api.free_entry(tmp->data);
                gl_api.free_entry(tmp);
#ifdef HLX_BUILD_WITH_PARALLEL_THREADING
                gl_api.atomic_decr_entry(&list->size);
#else
                --list->size;
#endif
        }
        list->first = 0;
        list->last = 0;
}

unsigned int hlx_list_empty(const hlx_list* list)
{
    return (list->size == 0);
}

unsigned int hlx_listsize(const hlx_list* list)
{
    return (list->size);
}

/*
** END OF FILE
*/