//////////////////////////////////////////////////////////
// 文件:FIFOQUEUE.h
//////////////////////////////////////////////////////////
#ifndef _FIFOQUEUE_H
#define _FIFOQUEUE_H
#define ElemType uint8
#define QueueSize 20
#define QueueFull 0
#define QueueEmpty 1
#define QueueOperateOk 2
struct FifoQueue
{
uint16 front;
uint16 rear;
uint16 count;
ElemType dat[QueueSize];
};
//Queue Initalize
extern void QueueInit(struct FifoQueue *Queue);
// Queue In
extern uint8 QueueIn(struct FifoQueue *Queue,ElemType sdat);
// Queue Out
extern uint8 QueueOut(struct FifoQueue *Queue,ElemType *sdat);
#endif
//////////////////////////////////////////////////////////
// 文件:FIFOQUEUE.C
//////////////////////////////////////////////////////////
#i nclude "config.h"
//Queue Init
void QueueInit(struct FifoQueue *Queue)
{
Queue->front = Queue->rear;
Queue->count = 0;
}
// Queue In
uint8 QueueIn(struct FifoQueue *Queue,ElemType sdat)
{
if((Queue->front == Queue->rear) && (Queue->count == QueueSize))
{ // full
return QueueFull;
}else
{ // in
Queue->dat[Queue->rear] = sdat;
Queue->rear = (Queue->rear + 1) % QueueSize;
Queue->count = Queue->count + 1;
return QueueOperateOk;
}
}
// Queue Out
uint8 QueueOut(struct FifoQueue *Queue,ElemType *sdat)
{
if((Queue->front == Queue->rear) && (Queue->count == 0))
{ // empty
return QueueEmpty;
}else
{ // out
*sdat = Queue->dat[Queue->front];
Queue->front = (Queue->front + 1) % QueueSize;
Queue->count = Queue->count - 1;
return QueueOperateOk;
}
}
//////////////////////////////////////////////////////////
// 文件:Main.C
//////////////////////////////////////////////////////////
#i nclude
#i nclude "config.h"
void main(void)
{
struct FifoQueue MyQueue;
ElemType sh;
uint8 i;
QueueInit(&MyQueue);
while(1)
{
for(i = 0;i < 30;i++)
{
if(QueueIn(&MyQueue,i) == QueueFull) break;
}
for(i = 0;i < 30;i++)
{
if(QueueOut(&MyQueue,&sh) == QueueEmpty) break;
}
}
while(1);
}