main.c(queue memcpy)

※main.c파일

#include <stdio.h>

#include "queue.h"



int main(void)

{

	Queue s1, s2;

	initQueue(&s1,10,sizeof(int));

	initQueue(&s2,100,sizeof(double));

	

	int i;

	i = 100;	push(&s1,&i);  

	i = 200;	push(&s1,&i);

	

	int re1;

	pop(&s1,&re1);	printf("s1 1st pop() : %d\n", re1);

	i = 300; 	push(&s1,&i);

	pop(&s1,&re1);	printf("s1 2nd pop() : %d\n", re1);

	pop(&s1,&re1);	printf("s1 3rd pop() : %d\n", re1);

	double d;

	d = 1.1; 	push(&s2,&d);

	d = 2.2;	push(&s2,&d);

	

	double re2;

	pop(&s2,&re2); 	printf("s2 1st pop() : %f\n",re2);

	d = 3.3;  push(&s2,&d);

	pop(&s2,&re2);	printf("s2 2nd pop() : %f\n",re2);

	pop(&s2,&re2); 	printf("s2 3rd pop() : %f\n",re2);

	

	cleanupQueue(&s1);

	cleanupQueue(&s2);

	

	return 0;

}

※queue.h파일

#ifndef QUEUE_H

#define QUEUE_H



typedef struct queue {

	void *array;

	int rear;

	int front;

	int size;

	int eleSize;

}Queue;





void initQueue(Queue *s, int size, int eleSize);

void cleanupQueue(Queue *s);



void push(Queue *s,  void *pData);

void pop(Queue *s,  void *pData);

#endif

※queue.c파일

#include <stdlib.h>

#include <stdio.h>

#include <assert.h>

#include <string.h> 

#include "queue.h"



void initQueue(Queue *s, int size, int eleSize)  

{

	s->array = malloc(eleSize*size);

	assert(s->array);

	s->eleSize = eleSize; 

	s->size = size;

	s->rear = 0;

	s->front = 0;

}



void cleanupQueue(Queue *s) 

{

	free(s->array);

}



void push(Queue *s,void *pData)

{

	assert(s->rear != s->size);

	//memcpy(&s->array[s->tos],pData,s->eleSize);  // void 포인터는 역참조할 때 타입캐스팅을 하고 참조해야한다.

	memcpy((unsigned char *)s->array + s->eleSize * s->rear, pData,s->eleSize);

	++s->rear;

}



void pop(Queue *s, void *pData)

{

	assert(s->front < s->rear);

	int index = s->front;

	++s->front;

	//memcpy(pData,&s->array[s->tos],s->eleSize);

	memcpy(pData,(unsigned char *)s->array + s->eleSize * index, s->eleSize);

}