SmartAudio/package/allwinner/tina_multimedia/libcedarc/base/CdcMessageQueue.c

289 lines
6.0 KiB
C
Executable File

/*
* Copyright (c) 2008-2016 Allwinner Technology Co. Ltd.
* All rights reserved.
*
* File : messageQueue.c
* Description : message queue
* History :
*
*/
#include <unistd.h>
#include <stdlib.h>
#include <pthread.h>
#include <malloc.h>
#include <semaphore.h>
#include <string.h>
#include <time.h>
#include "log.h"
#include "CdcMessageQueue.h"
typedef struct MessageNode MessageNode;
struct MessageNode
{
MessageNode* next;
int valid;
CdcMessage *msg;
};
typedef struct MessageQueueContext
{
char* pName;
MessageNode* pHead;
int nCount;
MessageNode* Nodes;
int nMaxMessageNum;
size_t nMessageSize;
pthread_mutex_t mutex;
sem_t sem;
}MessageQueueContext;
CdcMessageQueue* CdcMessageQueueCreate(int nMaxMessageNum, const char* pName)
{
MessageQueueContext* mqCtx;
size_t nMessageSize = sizeof(CdcMessage);
logd("nMessageSize = %d",(int)nMessageSize);
mqCtx = (MessageQueueContext*)malloc(sizeof(MessageQueueContext));
if(mqCtx == NULL)
{
loge("%s, allocate memory fail.", pName);
return NULL;
}
memset(mqCtx, 0, sizeof(MessageQueueContext));
if(pName != NULL)
mqCtx->pName = strdup(pName);
mqCtx->Nodes = (MessageNode*)calloc(nMaxMessageNum, sizeof(MessageNode));
if(mqCtx->Nodes == NULL)
{
loge("%s, allocate memory for message nodes fail.", mqCtx->pName);
if(mqCtx->pName != NULL)
free(mqCtx->pName);
free(mqCtx);
return NULL;
}
int i;
for (i = 0; i < nMaxMessageNum; i++)
{
mqCtx->Nodes[i].msg = calloc(1, nMessageSize);
if (mqCtx->Nodes[i].msg == NULL)
{
int j;
for (j = 0; j < i; j++)
free(mqCtx->Nodes[j].msg);
free(mqCtx->pName);
free(mqCtx->Nodes);
free(mqCtx);
return NULL;
}
}
mqCtx->nMaxMessageNum = nMaxMessageNum;
mqCtx->nMessageSize = nMessageSize;
pthread_mutex_init(&mqCtx->mutex, NULL);
sem_init(&mqCtx->sem, 0, 0);
return (CdcMessageQueue*)mqCtx;
}
void CdcMessageQueueDestroy(CdcMessageQueue* mq)
{
MessageQueueContext* mqCtx;
mqCtx = (MessageQueueContext*)mq;
int i;
for (i = 0; i < mqCtx->nMaxMessageNum; i++)
free(mqCtx->Nodes[i].msg);
if(mqCtx->Nodes != NULL)
{
free(mqCtx->Nodes);
}
pthread_mutex_destroy(&mqCtx->mutex);
sem_destroy(&mqCtx->sem);
if(mqCtx->pName != NULL)
free(mqCtx->pName);
free(mqCtx);
return;
}
int CdcMessageQueuePostMessage(CdcMessageQueue* mq, CdcMessage* m)
{
MessageQueueContext* mqCtx;
MessageNode* node;
MessageNode* ptr;
int i;
mqCtx = (MessageQueueContext*)mq;
pthread_mutex_lock(&mqCtx->mutex);
if(mqCtx->nCount >= mqCtx->nMaxMessageNum)
{
loge("%s, message count exceed, current message count = %d, max message count = %d",
mqCtx->pName, mqCtx->nCount, mqCtx->nMaxMessageNum);
pthread_mutex_unlock(&mqCtx->mutex);
return -1;
}
node = NULL;
ptr = mqCtx->Nodes;
for(i=0; i<mqCtx->nMaxMessageNum; i++, ptr++)
{
if(ptr->valid == 0)
{
node = ptr;
break;
}
}
memcpy(node->msg, m, mqCtx->nMessageSize);
node->valid = 1;
node->next = NULL;
ptr = mqCtx->pHead;
if(ptr == NULL)
mqCtx->pHead = node;
else
{
while(ptr->next != NULL)
ptr = ptr->next;
ptr->next = node;
}
mqCtx->nCount++;
pthread_mutex_unlock(&mqCtx->mutex);
sem_post(&mqCtx->sem);
return 0;
}
int CdcMessageQueueWaitMessage(CdcMessageQueue* mq, int64_t timeout)
{
CEDARC_UNUSE(CdcMessageQueueWaitMessage);
if (SemTimedWait(&mq->sem, timeout) < 0)
return -1;
sem_post(&mq->sem);
return mq->nCount;
}
int CdcMessageQueueGetMessage(CdcMessageQueue* mq, CdcMessage* m)
{
CEDARC_UNUSE(CdcMessageQueueGetMessage);
return CdcMessageQueueTryGetMessage(mq, m, -1);
}
int CdcMessageQueueTryGetMessage(CdcMessageQueue* mq, CdcMessage* m, int64_t timeout)
{
MessageQueueContext* mqCtx;
MessageNode* node;
mqCtx = (MessageQueueContext*)mq;
if(SemTimedWait(&mqCtx->sem, timeout) < 0)
{
return -1;
}
pthread_mutex_lock(&mqCtx->mutex);
if(mqCtx->nCount <= 0)
{
logv("%s, no message.", mqCtx->pName);
pthread_mutex_unlock(&mqCtx->mutex);
return -1;
}
node = mqCtx->pHead;
mqCtx->pHead = node->next;
memcpy(m, node->msg, mqCtx->nMessageSize);
node->valid = 0;
mqCtx->nCount--;
pthread_mutex_unlock(&mqCtx->mutex);
return 0;
}
int CdcMessageQueueFlush(CdcMessageQueue* mq)
{
CEDARC_UNUSE(CdcMessageQueueFlush);
MessageQueueContext* mqCtx;
int i;
mqCtx = (MessageQueueContext*)mq;
logi("%s, flush messages.", mqCtx->pName);
pthread_mutex_lock(&mqCtx->mutex);
mqCtx->pHead = NULL;
mqCtx->nCount = 0;
for(i=0; i<mqCtx->nMaxMessageNum; i++)
{
mqCtx->Nodes[i].valid = 0;
}
do
{
if(sem_getvalue(&mqCtx->sem, &i) != 0 || i == 0)
break;
sem_trywait(&mqCtx->sem);
} while(1);
pthread_mutex_unlock(&mqCtx->mutex);
return 0;
}
int CdcMessageQueueGetCount(CdcMessageQueue* mq)
{
CEDARC_UNUSE(CdcMessageQueueGetCount);
MessageQueueContext* mqCtx;
mqCtx = (MessageQueueContext*)mq;
return mqCtx->nCount;
}
int SemTimedWait(sem_t* sem, int64_t time_ms)
{
int err;
if(time_ms == -1)
{
err = sem_wait(sem);
}
else
{
struct timespec ts;
clock_gettime(CLOCK_REALTIME, &ts);
ts.tv_nsec += time_ms % 1000 * 1000 * 1000;
ts.tv_sec += time_ms / 1000 + ts.tv_nsec / (1000 * 1000 * 1000);
ts.tv_nsec = ts.tv_nsec % (1000*1000*1000);
err = sem_timedwait(sem, &ts);
}
return err;
}