netease
/
SmartAudio
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
SmartAudio/lichee/brandy/u-boot-2011.09/sprite/queue.c

357 lines
8.3 KiB
C
Raw Normal View History

init
2018-07-13 01:31:50 +00:00
/*
* (C) Copyright 2007-2013
* Allwinner Technology Co., Ltd. <www.allwinnertech.com>
* Jerry Wang <wangflord@allwinnertech.com>
*
* See file CREDITS for list of people who contributed to this
* project.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of
* the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*/
#include <config.h>
#include <common.h>
#include <malloc.h>
#include <asm/arch/queue.h>
/*
************************************************************************************************************
*
* function
*
* name : initqueue
*
* parmeters :
*
* return :
*
* note :
*
*
************************************************************************************************************
*/
int initqueue(queue *q, int each_size, int buffer_count)
{
int i;
if(!q)
{
printf("initqueue: queue element is null\n");
return -1;
}
memset(q, 0, sizeof(queue));
q->count = buffer_count; //<2F><>ʹ<EFBFBD><CAB9>һ<EFBFBD><D2BB>buffer
q->size = each_size;
q->base_addr = (void *)malloc(buffer_count * each_size * 2);
if(!q->base_addr)
{
printf("create buffer memory failed\n");
return -2;
}
q->front = q->rear = 0;
//init buffer queue
q->element[0].data = (char *)q->base_addr + each_size;
for(i=1;i<buffer_count;i++)
{
q->element[i].data = q->element[i-1].data + each_size * 2;
q->element[i].len = 0;
}
return 0;
}
/*
************************************************************************************************************
*
* function
*
* name : destroyqueue
*
* parmeters :
*
* return :
*
* note :
*
*
************************************************************************************************************
*/
int destroyqueue(queue *q)
{
if(!q)
{
printf("destroyqueue: queue element is null\n");
return -1;
}
free(q->base_addr);
return 0;
}
/*
************************************************************************************************************
*
* function
*
* name : resetqueue
*
* parmeters :
*
* return :
*
* note :
*
*
************************************************************************************************************
*/
void resetqueue(queue *q)
{
int i;
q->front = q->rear = 0;
q->element[0].data = (char *)q->base_addr + q->size;
for(i=1;i<q->count;i++)
{
q->element[i].data = q->element[i-1].data + q->size * 2;
q->element[i].len = 0;
}
}
/*
************************************************************************************************************
*
* function
*
* name : enqueue
*
* parmeters :
*
* return :
*
* note :
*
*
************************************************************************************************************
*/
void enqueue(queue *q, int element)
{
;
}
/*
************************************************************************************************************
*
* function
*
* name : outqueue
*
* parmeters :
*
* return :
*
* note :
*
*
************************************************************************************************************
*/
void outqueue(queue *q, int *element)
{
;
}
/*
************************************************************************************************************
*
* function
*
* name : isqueueempty
*
* parmeters :
*
* return :
*
* note : <EFBFBD><EFBFBD><EFBFBD>ñ<EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>buffer<EFBFBD><EFBFBD><EFBFBD>õİ취<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͷβָ<EFBFBD><EFBFBD>ָ<EFBFBD><EFBFBD>ͬһ<EFBFBD><EFBFBD>bufferʱ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʾqueueΪ<EFBFBD><EFBFBD>
*
*
************************************************************************************************************
*/
int isqueueempty(queue *q)
{
return (q->front == q->rear)? 1:0;
}
/*
************************************************************************************************************
*
* function
*
* name : isqueueempty
*
* parmeters :
*
* return :
*
* note : <EFBFBD><EFBFBD><EFBFBD>ñ<EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>buffer<EFBFBD><EFBFBD><EFBFBD>õİ취<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͷβָ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>1<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͷָ<EFBFBD><EFBFBD>ʱ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʾqueueΪ<EFBFBD><EFBFBD>
*
*
************************************************************************************************************
*/
int isqueuefull(queue *q)
{
int tmp_rear;
tmp_rear = q->rear + 1;
if(tmp_rear > q->count)
{
tmp_rear = 0;
}
return (q->front == tmp_rear)? 1:0;
}
/*
************************************************************************************************************
*
* function
*
* name : inqueue_query
*
* parmeters :
*
* return :
*
* note : <EFBFBD><EFBFBD><EFBFBD>ԴӶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȡ<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>buffer<EFBFBD><EFBFBD>д<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݵ<EFBFBD>buffer<EFBFBD><EFBFBD>
* <EFBFBD><EFBFBD>ȡ<EFBFBD><EFBFBD><EFBFBD>ɹ<EFBFBD><EFBFBD><EFBFBD>rearָ<EFBFBD>벻<EFBFBD><EFBFBD>
*
************************************************************************************************************
*/
int inqueue_query(queue *q, queue_data *qdata)
{
int tmp_rear;
tmp_rear = q->rear + 1;
if(tmp_rear > q->count)
{
tmp_rear = 0;
}
if(q->front == tmp_rear) //<2F><><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1>queue<75><65>
{
//<2F>޷<EFBFBD>ʹ<EFBFBD><CAB9>rear<61><72>buffer
return -1;
}
qdata = &q->element[q->rear];
return 0;
}
/*
************************************************************************************************************
*
* function
*
* name : inqueue_ex
*
* parmeters :
*
* return :
*
* note : <EFBFBD><EFBFBD>pickqueue_ex<EFBFBD>黹<EFBFBD><EFBFBD>buffer<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>У<EFBFBD>rearָ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>1
*
*
*
************************************************************************************************************
*/
int inqueue_ex(queue *q)
{
int tmp_rear;
tmp_rear = q->rear + 1;
if(tmp_rear > q->count)
{
tmp_rear = 0;
}
if(q->front == tmp_rear) //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
{
//<2F>޷<EFBFBD>ʹ<EFBFBD><CAB9>rear<61><72>buffer
return -1;
}
q->rear = tmp_rear;
return 0;
}
/*
************************************************************************************************************
*
* function
*
* name : outqueue_query
*
* parmeters :
*
* return :
*
* note : <EFBFBD><EFBFBD>ѯ<EFBFBD><EFBFBD>ǰfront<EFBFBD><EFBFBD>buffer<EFBFBD>Ƿ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ã<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʱȡ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>frontָ<EFBFBD>벻<EFBFBD><EFBFBD>
*
*
************************************************************************************************************
*/
int outqueue_query(queue *q, queue_data *qdata, queue_data *next_qdata)
{
int next;
if(q->front == q->rear) //<2F><><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1>queue<75><65>
{
//<2F>޷<EFBFBD>ʹ<EFBFBD><CAB9>front<6E><74>buffer
return -1;
}
next = q->front + 1;
if(next > q->count)
{
next = 0;
}
qdata = &q->element[q->front];
next_qdata = &q->element[next];
return 0;
}
/*
************************************************************************************************************
*
* function
*
* name : outqueue
*
* parmeters :
*
* return :
*
* note : <EFBFBD><EFBFBD>queryqueue_ex<EFBFBD>黹<EFBFBD><EFBFBD>buffer<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>У<EFBFBD>frontָ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>1
*
*
************************************************************************************************************
*/
int outqueue_ex(queue *q)
{
int tmp_front;
if(q->front == q->rear) //<2F><><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1>queue<75>գ<EFBFBD><D5A3>޷<EFBFBD><DEB7>˳<EFBFBD><CBB3><EFBFBD>ǰbuffer
{
return -1;
}
tmp_front = q->front + 1;
if(tmp_front > q->count)
{
tmp_front = 0;
}
q->front = tmp_front;
return 0;
}