1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
|
/*
+----------------------------------------------------------------------+
| APD Profiler & Debugger
+----------------------------------------------------------------------+
| Copyright (c) 2001-2002 Community Connect Inc.
+----------------------------------------------------------------------+
| This source file is subject to version 2.02 of the PHP license, |
| that is bundled with this package in the file LICENSE, and is |
| available at through the world-wide-web at |
| http://www.php.net/license/2_02.txt. |
| If you did not receive a copy of the PHP license and are unable to |
| obtain it through the world-wide-web, please send a note to |
| license@php.net so we can mail you a copy immediately. |
+----------------------------------------------------------------------+
| Authors: Daniel Cowgill <dcowgill@communityconnect.com> |
| George Schlossnagle <george@lethargy.org> |
+----------------------------------------------------------------------+
*/
#include "apd_stack.h"
#include "apd_lib.h"
#include <assert.h>
#include <stdlib.h>
enum { START_SIZE = 1, GROW_FACTOR = 2 };
struct apd_stack_t {
int top;
int size;
void** elements;
};
apd_stack_t* apd_stack_create()
{
apd_stack_t* s;
s = (apd_stack_t*) apd_emalloc(sizeof(apd_stack_t));
s->top = 0;
s->size = START_SIZE;
s->elements = apd_emalloc(sizeof(void*) * s->size);
return s;
}
void apd_stack_destroy(apd_stack_t* stack)
{
apd_efree(stack->elements);
apd_efree(stack);
}
void apd_stack_push(apd_stack_t* stack, void* ptr)
{
if (stack->top >= stack->size) {
while (stack->top >= stack->size) {
stack->size *= GROW_FACTOR;
}
stack->elements = apd_erealloc(stack->elements,
stack->size * sizeof(void*));
}
stack->elements[stack->top++] = ptr;
}
void* apd_stack_pop(apd_stack_t* stack)
{
assert(!apd_stack_isempty(stack));
return stack->elements[--stack->top];
}
int apd_stack_isempty(apd_stack_t* stack)
{
return stack->top == 0;
}
void** apd_stack_toarray(apd_stack_t* stack)
{
return stack->elements;
}
int apd_stack_getsize(apd_stack_t* stack)
{
return stack->top;
}
void apd_stack_apply(apd_stack_t* stack, void (*funcPtr)(void*))
{
int i;
for (i = 0; i < stack->top; i++) {
funcPtr(stack->elements[i]);
}
}
|
