单片机的FIFO(先入先出)循环行列完成

//////////////////////////////////////////////////////////

// 文件：FIFOQUEUE.C

//////////////////////////////////////////////////////////

＃i nclude “config.h”

//Queue Init
void QueueInit(struct FifoQueue *Queue)
{
Queue->front = Queue->rear;//初始化时行列头行列首相连
Queue->count = 0; //行列计数为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;
}
}

＃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);
}