Circular queue related design and implementation reference 1

Circular queue related design and implementation reference 1

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h> 

#define QueueSize 200 
typedef char datatype;  
// Data elements of the queue  
typedef struct  
{
      
     int front;  
     int rear;  
    
     int count;  // Counter , Used to record the number of elements  
 // datatype data[QueueSize]; // The data content  
     char* pdata;
     int size; 
}cirqueue;  

cirqueue cq={
    0};
// Empty team  
int InitQueue(cirqueue *q,int size)  
{
      
     q->front = q->rear = 0;  
     q->count = 0;  
     q->pdata = (char*)malloc(size);
     q->size = size;
     if(q->pdata == NULL)
     	return -1;
      return 0;
}  
void DeInitQueue( cirqueue *q)
{
    
	if (q->pdata)
	{
    
		free(q->pdata);
		memset(q,0,sizeof(cirqueue));
	}
	
}

// Judge that the team is full  
int QueueFull(cirqueue *q)  
{
      
     return (q->count == q->size);  
}  


// Judge team empty  
int QueueEmpty(cirqueue *q)  
{
      
     return (q->count == 0);  
}  

int Queue_Data_len( cirqueue *q)
{
    
	return q->count;
}
int Queue_Left_Space( cirqueue *q)
{
    
	return (q->size-q->count);
}

// The team  
void EnQueue(cirqueue *q, datatype x)  
{
      
     assert(QueueFull(q) == 0); //q full , To terminate the program  
  
     q->count++;  
     q->pdata[q->rear] = x;  
     q->rear = (q->rear + 1)%q->size; // Cyclic queue design , Prevent memory waste  
} 
void en_queue_multi(cirqueue *cq, unsigned char *data, int len )
{
    
	int copy_len;
	int left_len;
	int idx = 0;
	
	left_len = Queue_Left_Space(cq);
	
	if (left_len < len) {
    
		printf( "%s circle_queue space left,not enough,need=%d\n", __func__,len);
		copy_len = left_len;
	}
	else
		copy_len = len;
	while(copy_len--) 
	{
    
		EnQueue(cq,*(data+idx));
		idx ++ ;
	}

}

// Out of the team  
datatype DeQueue(cirqueue *q)  
{
      
     datatype temp;  
  
     assert(QueueEmpty(q) == 0);//q empty , Then terminate the procedure , Print error messages  
  
     temp = q->pdata[q->front];  
     q->count--;  
     q->front = (q->front + 1)%q->size;  
     return temp;  
}  
int de_queue_multi( cirqueue *cq, unsigned char *data, int len)
{
    
	int copy_len;
	int total_len;
	int idx = 0;
	total_len = Queue_Data_len(cq);
	
	if (total_len < len) {
    
		printf( "%s circle_queue data only=%d ,need=%d\n", __func__,total_len,len);
		copy_len = total_len;
	}
	else
		copy_len = len;
	while(copy_len--) 
	{
    
		*(data+idx)=DeQueue(cq);
		idx ++ ;
	}

}
void Peek_Queue( cirqueue *q, unsigned char *data)
{
    
	if (QueueEmpty(q)) {
    
		printf("%s circle_queue is empty, data is invalid\n", __func__);
		return;
	}
	*data = q->pdata[q->front];
}

void cirqueue_test(void)
{
    
	printf("cirqueue_test=%s\n",__DATE__);
	
	InitQueue(&cq,QueueSize);
	EnQueue(&cq,0x12);
	EnQueue(&cq,0x34);
	unsigned char data[5]={
    0x12,0x78,0x89,0x68,0x59};
	en_queue_multi(&cq,data,5);
	printf("Queue_Data_len=%d\n",Queue_Data_len(&cq));
	
	printf("Queue_Left_Space=%d\n",Queue_Left_Space(&cq));
	int len = Queue_Data_len(&cq);
	int i = 0;
	unsigned char data_temp = 0;
	Peek_Queue(&cq,&data_temp);
	printf("data_temp=0x%x\n",data_temp);
	for(i=0;i<len;i++)
		printf("Queue data[%d]=0x%x\n",i,DeQueue(&cq)&0xff);
		
	printf("Queue_Data_len=%d\n",Queue_Data_len(&cq));
	printf("Queue_Left_Space=%d\n",Queue_Left_Space(&cq));
	DeInitQueue(&cq);
	
}