C语言实现循环队列（未写完）

#include 
#include 
#include 
#define BUF_SIZE 8
#define true 1
#define false 0
//具体如何实现，我会在下面通过代码实现
//看看这一个结构体占多少个字节：*BUF 4个字节 int指向两个字节
typedef struct queue
{
    int *BUF;
    int front;
    int rear
}QUEUE;
//初始化：
void initQueue(QUEUE *queue_q)
{
    //队列分配内存
    queue_q->BUF = (int *)malloc(sizeof(int)*BUF_SIZE);
    if(queue_q->BUF!=NULL) //队列内存分配成功
    {
        queue_q->front = queue_q->rear = 0; //初始化头尾指针
    }
}

//判断队列空
unsigned char isemptyQueue(QUEUE *queue_q)
{
    if(queue_q->front == queue_q->rear)
    {
        return true;
    }
    else
        return false;
}
//判断队列满
unsigned char is_fullQueue(QUEUE *queue_q)
{
    if((queue_q->rear+1)%BUF_SIZE==queue_q->front)
    {
        return true;
    }
    else
        return false;
}
//入队入尾
void In_Queue(QUEUE *queue_q,int value)
{
    if(is_fullQueue(queue_q)!=true) //队列未满
    {
        queue_q->BUF[queue_q->rear] = value;
        queue_q->rear = (queue_q->rear+1)%BUF_SIZE;
    }
}
//出队出头
void out_Queue(QUEUE *queue_q , int *value)
  {
      if(isemptyQueue(queue_q) != true)        //队列未空
      {
         *value = queue_q->BUF[queue_q->front];
         queue_q->front = (queue_q->front + 1)%BUF_SIZE ;
      }
}
void bianli_a(QUEUE *queue_q)
{
    if(isemptyQueue(queue_q)!=true)
    {
        int ret = queue_q->front;
        while(ret!=queue_q->rear)
        {
            printf("%d",queue_q->BUF[ret]);
            ret = (ret+1)%BUF_SIZE;
        }
    }
}

int main()
{
    int val;
    QUEUE m;
    initQueue(&m);
    In_Queue(&m,1);
    In_Queue(&m,2);
    In_Queue(&m,3);
    In_Queue(&m,4);
    In_Queue(&m,5);
    In_Queue(&m,6);
    In_Queue(&m,7);
    In_Queue(&m,8);
    In_Queue(&m,9);
    out_Queue(&m,&val);
    bianli_a(&m);
    printf("n");

    return 0;
}