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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
|
#include "cstackInt.h"
/*
* = = == === ===== ======== ============= =====================
*/
CSTACK
cstack_new (CSTACK_CELL_FREE freeCell, void* clientdata)
{
CSTACK s = ALLOC (CSTACK_);
s->cell = NALLOC (CSTACK_INITIAL_SIZE, void*);
s->max = CSTACK_INITIAL_SIZE;
s->top = 0;
s->freeCell = freeCell;
s->clientData = clientdata;
return s;
}
void
cstack_del (CSTACK s)
{
if (s->freeCell && s->top) {
long int i;
for (i=0; i < s->top; i++) {
ASSERT_BOUNDS(i,s->max);
s->freeCell ( s->cell [i] );
}
}
ckfree ((char*) s->cell);
ckfree ((char*) s);
}
void
cstack_push (CSTACK s, void* item)
{
if (s->top >= s->max) {
long int new = s->max ? (2 * s->max) : CSTACK_INITIAL_SIZE;
void** cell = (void**) ckrealloc ((char*) s->cell, new * sizeof(void*));
ASSERT (cell,"Memory allocation failure for cstack");
s->max = new;
s->cell = cell;
}
ASSERT_BOUNDS(s->top,s->max);
s->cell [s->top] = item;
s->top ++;
}
void*
cstack_top (CSTACK s)
{
ASSERT_BOUNDS(s->top-1,s->max);
return s->cell [s->top - 1];
}
void
cstack_pop (CSTACK s, long int n)
{
ASSERT (n >= 0, "Bad pop count");
if (n == 0) return;
if (s->freeCell) {
while (n) {
s->top --;
ASSERT_BOUNDS(s->top,s->max);
s->freeCell ( s->cell [s->top] );
n --;
}
} else {
s->top -= n;
}
}
void
cstack_trim (CSTACK s, long int n)
{
ASSERT (n >= 0, "Bad trimsize");
if (s->freeCell) {
while (s->top > n) {
s->top --;
ASSERT_BOUNDS(s->top,s->max);
s->freeCell ( s->cell [s->top] );
}
} else {
s->top = n;
}
}
void
cstack_drop (CSTACK s, long int n)
{
ASSERT (n >= 0, "Bad pop count");
if (n == 0) return;
s->top -= n;
}
void
cstack_move (CSTACK dst, CSTACK src)
{
ASSERT (dst->freeCell == src->freeCell, "Ownership mismatch");
/*
* Note: The destination takes ownership of the moved cell, thus there is
* no need to run free on them.
*/
while (src->top > 0) {
src->top --;
ASSERT_BOUNDS(src->top,src->max);
cstack_push (dst, src->cell [src->top] );
}
}
void
cstack_get (CSTACK s, long int n, CSTACK_DIRECTION dir, CSTACK_SLICE* slice)
{
ASSERT (n <= s->top, "Not enough elements in the cstack");
/*
* Note the double negation below. To get the normal order of the result,
* the order has to be reversed. To get the reverted order, nothing is to
* be done. So we revers on dir == cstack_normal.
*
* As optimization we know that direction is irrrelevant when returning a
* single element and thus we can use the code path not doing any
* allocations.
*/
if ((dir == cstack_revers) || (n < 2)) {
slice->dynamic = 0;
slice->cell = s->cell + (s->top - n);
} else {
int i;
slice->dynamic = 1;
slice->cell = NALLOC (n, void*);
for (i=0; i<n; i++) {
ASSERT_BOUNDS (i,n);
ASSERT_BOUNDS (s->top-i-1,s->top);
slice->cell [i] = s->cell [s->top-i-1];
}
}
}
void
cstack_rol (CSTACK s, long int n, long int steps)
{
long int i, j, start = s->top - n;
void** cell = s->cell;
void** tmp;
steps = steps % n;
while (steps < 0) steps += n;
steps = n - steps;
cell += start;
tmp = NALLOC(n,void*);
for (i = 0; i < n; i++) {
j = (i + steps) % n;
ASSERT_BOUNDS (i,n);
ASSERT_BOUNDS (j,n);
tmp[i] = cell [j];
}
for (i = 0; i < n; i++) {
ASSERT_BOUNDS (i,n);
cell [i] = tmp [i];
}
ckfree ((char*) tmp);
}
long int
cstack_size (CSTACK s)
{
return s->top;
}
void
cstack_clientdata_set (CSTACK s, void* clientdata)
{
s->clientData = clientdata;
}
void*
cstack_clientdata_get (CSTACK s)
{
return s->clientData;
}
/*
* = = == === ===== ======== ============= =====================
*/
/*
* Local Variables:
* mode: c
* c-basic-offset: 4
* fill-column: 78
* End:
*/
|
