sources/parallel/parallel_task_groups.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"

#if defined(HLX_BUILD_WITH_PARALLEL_THREADING)

#ifdef __cplusplus
extern "C"      {
#endif

/*
** EXTERNALS
*/

extern hlx_api gl_api;

/*
** FUNCTIONS
*/

void hlx_group_construct(hlx_group* group)
{
        group->id = (hlx_group_id)group;
        hlx_list_construct(&group->tasks);
        queue_new(&group->buf_tasks, MAX_TASK_PER_GROUP);
        gl_api.thread_api.thread_construct(&(group->thread));
        group->size = 0;
        group->active_count = 0;
}

void hlx_group_destruct(hlx_group* group)
{
        hlx_list_node* it = group->tasks.first;
        hlx_task* task;

        while (it != 0)
        {
                task = it->data;
                if (task->stack != 0)
                        gl_api.free_entry(task->stack);
                gl_api.free_entry(it->data);
                it = it->next;
        }
        hlx_list_clear(&group->tasks);
        while (queue_dequeue(group->buf_tasks, (void**)&task))
        {
                if (task->stack != 0)
                        gl_api.free_entry(task->stack);
                gl_api.free_entry(task);
        }
        queue_delete(group->buf_tasks, 0, 0);
        gl_api.thread_api.thread_destruct(&(group->thread));
}

void hlx_group_flush_task_buffer(hlx_group* group)
{
        hlx_task* task;

  task = 0;
        while (queue_dequeue(group->buf_tasks, (void**)&task))
                hlx_list_push_back(&group->tasks, task);
}

void hlx_group_bufferize_task(hlx_group* group, hlx_task* task)
{
        if (!queue_enqueue(group->buf_tasks, task))
                queue_guaranteed_enqueue(group->buf_tasks, task);
        if (task->status == HLX_TASK_STATUS_RUN)
                gl_api.atomic_incr_entry(&group->active_count);
        gl_api.thread_api.thread_resume(&(group->thread));
}

void hlx_group_add_task(hlx_group* group, hlx_task* task)
{
        hlx_list_push_back(&group->tasks, task);
        if (task->status == HLX_TASK_STATUS_RUN)
                gl_api.atomic_incr_entry(&group->active_count);
        gl_api.thread_api.thread_resume(&(group->thread));

}

void hlx_group_del_task(hlx_group* group, hlx_task* task)
{
        hlx_list_node* it;

        if ((it = hlx_list_find(&group->tasks, task)) == 0)
                return;
        if (task->status == HLX_TASK_STATUS_RUN)
                gl_api.atomic_decr_entry(&group->active_count);
        gl_api.free_entry(it->data);
        hlx_list_erase(&group->tasks, it);
}

atom_t hlx_group_get_size(hlx_group* group)
{
        atom_t queue_size;

        queue_query(group->buf_tasks, QUEUE_QUERY_ELEMENT_COUNT, 0, &queue_size);
        return (group->tasks.size + queue_size);
}

#endif /* !HLX_BUILD_WITH_PARALLEL_THREADING */

#ifdef __cplusplus
}
#endif

/*
** END OF FILE
*/