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
207
208
209
210
211
212
213
|
#ifndef SRL_STACK_H_
#define SRL_STACK_H_
#ifndef srl_stack_type_t
#error define srl_stack_type_t before including srl_stack.h
#endif
#include <stdlib.h>
#include <assert.h>
#include "srl_inline.h"
#include "srl_common.h"
#define DEBUG_ASSERT_STACK_PTR(stack, ptr) \
assert((ptr) >= (stack)->begin && (ptr) <= (stack)->end)
#define DEBUG_ASSERT_STACK_SANE(stack) STMT_START { \
assert((stack) != NULL); \
assert((stack)->begin != NULL); \
assert((stack)->end != NULL); \
assert((stack)->begin <= (stack)->end); \
assert((stack)->ptr == NULL || \
((stack)->ptr >= (stack)->begin && (stack)->ptr <= (stack)->end)); \
assert(((stack)->ptr == NULL && (stack)->depth == -1) || \
((stack)->ptr - (stack)->begin) == (stack)->depth); \
} STMT_END
#ifdef TRACE_STACK
# define SRL_STACK_TRACE(msg, args...) \
fprintf(stderr, "%s:%d:%s(): "msg"\n", __FILE__, __LINE__, __func__, args)
#else
# define SRL_STACK_TRACE(msg, args...)
#endif
#define SRL_STACK_SIZE(stack) (((stack)->end - (stack)->begin) + 1)
#define SRL_STACK_SPACE(stack) (((stack)->ptr - (stack)->begin) + 1)
#define SRL_STACK_DEPTH(stack) ((stack)->depth)
typedef struct srl_stack srl_stack_t;
typedef struct srl_stack * srl_stack_ptr;
struct srl_stack {
IV depth; /* benchmarking showed that calculating depth takes up to 5%, so we store it */
srl_stack_type_t *ptr, *begin, *end;
};
/* Allocate new arrfer (but not the stack struct */
SRL_STATIC_INLINE int
srl_stack_init(pTHX_ srl_stack_t * stack, size_t size)
{
assert(size > 0);
assert(stack != NULL);
stack->begin = NULL;
Newx(stack->begin, size, srl_stack_type_t);
if (expect_false(stack->begin == NULL))
return 1;
stack->end = stack->begin + size - 1;
stack->ptr = NULL;
stack->depth = -1;
assert(SRL_STACK_SIZE(stack) == (int) size);
return 0;
}
SRL_STATIC_INLINE void
srl_stack_grow(pTHX_ srl_stack_t *stack)
{
ptrdiff_t pos = SRL_STACK_DEPTH(stack);
size_t new_size = SRL_STACK_SIZE(stack) * 2;
assert(new_size <= 1024 * 1024);
Renew(stack->begin, new_size, srl_stack_type_t);
if (stack->begin == NULL)
croak("Out of memory");
stack->end = stack->begin + new_size - 1;
stack->ptr = stack->begin + pos;
DEBUG_ASSERT_STACK_SANE(stack);
assert(SRL_STACK_SIZE(stack) == (int) new_size);
SRL_STACK_TRACE("grew stack to size %zu", new_size);
}
/* Free stack arrfer (not not the stack struct */
SRL_STATIC_INLINE void
srl_stack_deinit(pTHX_ srl_stack_t *stack)
{
if (stack == NULL || stack->begin == NULL) return;
Safefree(stack->begin);
}
SRL_STATIC_INLINE int
srl_stack_copy(pTHX_ srl_stack_t *from, srl_stack_t *to)
{
size_t size;
assert(from != NULL);
assert(to != NULL);
to->begin = NULL;
size = SRL_STACK_SIZE(from);
Newx(to->begin, size, srl_stack_type_t);
if (expect_false(to->begin == NULL))
return 1;
if (from->ptr == NULL) {
to->ptr = NULL;
} else {
Copy(from->begin, to->begin, SRL_STACK_SPACE(from), srl_stack_type_t);
to->ptr = to->begin + from->depth;
}
to->end = to->begin + size - 1;
to->depth = from->depth;
DEBUG_ASSERT_STACK_SANE(to);
assert(SRL_STACK_SIZE(to) == (int) size);
return 0;
}
#define srl_stack_clear(stack) STMT_START { \
DEBUG_ASSERT_STACK_SANE(stack); \
(stack)->ptr = NULL; \
(stack)->depth = -1; \
} STMT_END
#define srl_stack_ptr(stack) ((stack)->ptr)
#define srl_stack_empty(stack) ((stack)->ptr == NULL)
#define srl_stack_full(stack) ((stack)->ptr >= (stack)->end)
#define srl_stack_push_ptr(stack, val_ptr) STMT_START { \
DEBUG_ASSERT_STACK_SANE(stack); \
\
if (expect_false(srl_stack_empty(stack))) { \
(stack)->ptr = (stack)->begin; \
(val_ptr) = (stack)->begin; \
} else { \
if (expect_false(srl_stack_full(stack))) \
srl_stack_grow(aTHX_ (stack)); \
\
(val_ptr) = ++(stack)->ptr; \
} \
\
(stack)->depth++; \
\
DEBUG_ASSERT_STACK_SANE(stack); \
SRL_STACK_TRACE("pushed value on stack, current depth %d", \
(int) SRL_STACK_DEPTH(stack)); \
} STMT_END
#define srl_stack_push_val(stack, val) STMT_START { \
DEBUG_ASSERT_STACK_SANE(stack); \
\
if (expect_false(srl_stack_empty(stack))) { \
(stack)->ptr = (stack)->begin; \
} else { \
if (expect_false(srl_stack_full(stack))) \
srl_stack_grow(aTHX_ (stack)); \
\
(stack)->ptr++; \
} \
\
*(stack)->ptr = (val); \
(stack)->depth++; \
\
DEBUG_ASSERT_STACK_SANE(stack); \
SRL_STACK_TRACE("pushed value on stack, current depth %d", \
(int) SRL_STACK_DEPTH(stack)); \
} STMT_END
#define srl_stack_pop_nocheck(stack) STMT_START { \
DEBUG_ASSERT_STACK_SANE(stack); \
\
if (expect_false((stack)->ptr == (stack)->begin)) { \
(stack)->ptr = NULL; \
} else { \
(stack)->ptr--; \
} \
\
(stack)->depth--; \
\
DEBUG_ASSERT_STACK_SANE(stack); \
SRL_STACK_TRACE("poped stack, current depth %d", \
(int) SRL_STACK_DEPTH(stack)); \
} STMT_END
#define srl_stack_pop(stack) STMT_START { \
if (expect_false(srl_stack_empty(stack))) \
croak("Pop empty stack"); \
\
srl_stack_pop_nocheck(stack); \
} STMT_END
SRL_STATIC_INLINE srl_stack_type_t
srl_stack_peek_nocheck(pTHX_ srl_stack_t *stack)
{
DEBUG_ASSERT_STACK_SANE(stack);
return *stack->ptr;
}
SRL_STATIC_INLINE srl_stack_type_t
srl_stack_peek(pTHX_ srl_stack_t *stack)
{
DEBUG_ASSERT_STACK_SANE(stack);
if (expect_false(srl_stack_empty(stack)))
croak("srl_stack_peek on empty stack");
return srl_stack_peek_nocheck(aTHX_ stack);
}
#endif
|
