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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
/*
* Copyright (C) 2005,2007,2009-2010 Timothy D. Morgan
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; version 3 of the License.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
* $Id: void_stack.c 169 2010-03-03 19:24:58Z tim $
*/
/**
* @file
*/
#include "void_stack.h"
void_stack* void_stack_new(unsigned short max_size)
{
void_stack* ret_val = talloc(NULL, void_stack);
if (ret_val != NULL)
{
memset(ret_val, 0, sizeof(*ret_val));
ret_val->elements = talloc_array(ret_val, void*, max_size);
if (ret_val->elements == NULL)
{
talloc_free(ret_val);
ret_val = NULL;
}
else
{
memset(ret_val->elements, 0, max_size*sizeof(void*));
ret_val->max_size = max_size;
ret_val->top = 0;
}
}
return ret_val;
}
void_stack* void_stack_copy(const void_stack* v)
{
unsigned int i;
void_stack* ret_val;
if(v == NULL)
return NULL;
ret_val = void_stack_new(v->max_size);
if(ret_val == NULL)
return NULL;
for(i = 0; i < v->top; i++)
ret_val->elements[i] = v->elements[i];
ret_val->top = v->top;
return ret_val;
}
void_stack* void_stack_copy_reverse(const void_stack* v)
{
unsigned int i;
void_stack* ret_val;
if(v == NULL)
return NULL;
ret_val = void_stack_new(v->max_size);
if(ret_val == NULL)
return NULL;
for(i = 0; i < v->top; i++)
ret_val->elements[i] = v->elements[v->top-i-1];
ret_val->top = v->top;
return ret_val;
}
void void_stack_free(void_stack* stack)
{
talloc_free(stack);
}
void void_stack_free_deep(void_stack* stack)
{
unsigned short i;
for(i=0; i < stack->top; i++)
free(stack->elements[i]);
talloc_free(stack);
}
unsigned short void_stack_size(const void_stack* stack)
{
return stack->top;
}
void* void_stack_pop(void_stack* stack)
{
void* ret_val = NULL;
if(stack->top > 0)
{
ret_val = stack->elements[--(stack->top)];
stack->elements[stack->top] = NULL;
}
return ret_val;
}
bool void_stack_push(void_stack* stack, void* e)
{
if(stack->top < stack->max_size)
{
stack->elements[stack->top++] = e;
return true;
}
else
return false;
}
const void* void_stack_cur(const void_stack* stack)
{
void* ret_val = NULL;
if(stack->top > 0)
ret_val = stack->elements[stack->top-1];
return ret_val;
}
void_stack_iterator* void_stack_iterator_new(const void_stack* stack)
{
void_stack_iterator* ret_val = NULL;
if(stack != NULL)
{
ret_val = talloc(stack, void_stack_iterator);
if (ret_val != NULL)
{
ret_val->stack = stack;
ret_val->cur = 0;
}
}
return ret_val;
}
void void_stack_iterator_free(void_stack_iterator* iter)
{
talloc_free(iter);
}
const void* void_stack_iterator_next(void_stack_iterator* iter)
{
if(iter->cur < iter->stack->top)
return iter->stack->elements[iter->cur++];
else
return NULL;
}
|
