Gecko [ www.finalhopeacademy.com ]

Name	Size	Permission
.libs	[ DIR ]	drwxr-xr-x
README	49 B	-rw-rw-r--
xc_align.h	445 B	-rw-rw-r--
xc_foreachcoresig.h	589 B	-rw-rw-r--
xc_stack.c	1.12 KB	-rw-rw-r--
xc_stack.h	507 B	-rw-rw-r--
xc_stack.lo	312 B	-rw-r--r--
xc_trace.c	619 B	-rw-rw-r--
xc_trace.h	1.25 KB	-rw-rw-r--
xc_trace.lo	312 B	-rw-r--r--
xc_vector.h	1.3 KB	-rw-rw-r--

Code Editor : xc_stack.c

#include <stdlib.h>
#include "xc_trace.h"
#include "xc_stack.h"

typedef xc_stack_t* S;

void xc_stack_init_ex(S stack, int initsize)
{
	stack->cnt = 0;
	stack->size = initsize;
	stack->data = malloc(sizeof(void *) * stack->size);
}

void xc_stack_destroy(S stack)
{
	free(stack->data);
}

void xc_stack_push(S stack, void *item)
{
	if (stack->cnt == stack->size) {
		stack->size <<= 1;
		stack->data = realloc(stack->data, sizeof(void *) * stack->size);
	}
	stack->data[stack->cnt++] = item;
}

void* xc_stack_pop(S stack)
{
	assert(stack != NULL);
	assert(stack->size > 0);
	return stack->data[--stack->cnt];
}

void* xc_stack_top(S stack)
{
	assert(stack != NULL);
	assert(stack->cnt > 0);
	return stack->data[stack->cnt-1];
}

void* xc_stack_get(S stack, int n)
{
	assert(stack != NULL);
	assert(stack->cnt > 0);
	return stack->data[n];
}

int xc_stack_count(S stack)
{
	assert(stack != NULL);
	return stack->cnt;
}

void xc_stack_reverse(S stack)
{
	int i, j;
	void *tmp;

assert(stack != NULL);
	for (i = 0, j = stack->cnt - 1; i < j; i ++, j --) {
		tmp = stack->data[i];
		stack->data[i] = stack->data[j];
		stack->data[j] = tmp;
	}
}

${this.title}

Code Editor : xc_stack.c