queue.c

Go to the documentation of this file.

#include <hipc/atomic.h>
#include <hipc/queue.h>

void hipcQueueInit(struct HIPC_queue *const que_p,
                   void *const buf_p,
                   const size_t item_size, const size_t n_slot)
{
    que_p->buf_p = buf_p;
    que_p->item_size = item_size;
    que_p->n_slot = n_slot;
    que_p->head = 0;
    que_p->tail = 0;
    HIPC_MEM_BARRIER;

    return;
}

size_t hipcQueueItemSize(struct HIPC_queue * const que_p)
{
    return que_p->item_size;
}

void *hipcQueueEmpty(struct HIPC_queue *const que_p)
{
    if (que_p->head == que_p->tail) {
        return NULL;
    }

    return ((unsigned char *) (que_p->buf_p)) +
        (que_p->head * que_p->item_size);
}

void hipcQueuePop(struct HIPC_queue *const que_p)
{
    HIPC_MEM_BARRIER;
    que_p->head = (que_p->head + 1) % que_p->n_slot;

    return;
}

void *hipcQueueFull(struct HIPC_queue const *const que_p)
{
    if (que_p->head == ((que_p->tail + 1) % que_p->n_slot)) {
        return NULL;
    }

    return ((unsigned char *) que_p->buf_p) +
        (que_p->tail * que_p->item_size);
}

void hipcQueuePush(struct HIPC_queue *const que_p)
{
    HIPC_MEM_BARRIER;
    que_p->tail = (que_p->tail + 1) % que_p->n_slot;

    return;
}

void hipcQueueClear(struct HIPC_queue *const que_p)
{
    HIPC_MEM_BARRIER;
    que_p->head = que_p->tail;

    return;
}