-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbfstack.h
More file actions
149 lines (108 loc) · 4.18 KB
/
bfstack.h
File metadata and controls
149 lines (108 loc) · 4.18 KB
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
/*------------------------------------------------------------------------*/
/* Copyright (c) 2005 - 2010 Armin Biere, Johannes Kepler University. */
/*------------------------------------------------------------------------*/
#ifndef BOOLEFORCE_stack_h_INCLUDED
#define BOOLEFORCE_stack_h_INCLUDED
/*------------------------------------------------------------------------*/
#define PtrStack(Type) Type ## PtrStack
#define DeclarePtrStack(Type) \
typedef struct PtrStack(Type) PtrStack(Type); \
\
struct PtrStack(Type) \
{ \
Type ** start; \
Type ** last; \
Type ** end; \
};
/*------------------------------------------------------------------------*/
#define Stack(Type) Type ## Stack
#define DeclareStack(Type) \
typedef struct Stack(Type) Stack(Type); \
\
struct Stack(Type) \
{ \
Type * start; \
Type * last; \
Type * end; \
};
/*------------------------------------------------------------------------*/
DeclareStack (char);
DeclareStack (int);
DeclareStack (unsigned);
/*------------------------------------------------------------------------*/
#define count_stack(stack) \
((int)((stack).last - (stack).start))
/*------------------------------------------------------------------------*/
#define size_stack(stack) \
((stack).end - (stack).start)
/*------------------------------------------------------------------------*/
#define empty_stack(stack) \
((stack).last == (stack).start)
/*------------------------------------------------------------------------*/
#define full_stack(stack) \
((stack).last == (stack).end)
/*------------------------------------------------------------------------*/
#define bytes_stack(stack) \
(sizeof((stack).start[0]) * size_stack(stack))
/*------------------------------------------------------------------------*/
#define enlarge_stack(stack) \
do { \
int old_size = size_stack(stack); \
int new_size = old_size ? 2 * old_size : 2; \
size_t old_bytes = old_size * sizeof ((stack).start[0]); \
size_t new_bytes = new_size * sizeof ((stack).start[0]); \
(stack).start = booleforce_enlarge ((stack).start, old_bytes, new_bytes); \
(stack).last = (stack).start + old_size; \
(stack).end = (stack).start + new_size; \
} while(0)
/*------------------------------------------------------------------------*/
#define push_stack(stack,data) \
do { \
if (full_stack (stack)) \
enlarge_stack (stack); \
*(stack).last++ = (data); \
} while(0)
/*------------------------------------------------------------------------*/
#define pop_stack(stack) \
(assert (count_stack (stack)),*--(stack).last)
/*------------------------------------------------------------------------*/
#define top_stack(stack) \
(assert (count_stack (stack)),(stack).last[-1])
/*------------------------------------------------------------------------*/
#define init_stack(stack) \
do { \
(stack).start = 0; \
(stack).last = 0; \
(stack).end = 0; \
} while (0)
/*------------------------------------------------------------------------*/
#define release_stack(stack) \
do { \
booleforce_delete ((stack).start, bytes_stack (stack)); \
init_stack (stack); \
} while(0)
/*------------------------------------------------------------------------*/
#define DELETE_STACK(stack) \
do { \
assert (stack); \
release_stack (*(stack)); \
booleforce_delete (stack, sizeof (*(stack))); \
} while(0)
/*------------------------------------------------------------------------*/
#define reset_stack(stack,new_count) \
do { \
assert (0 <= (new_count)); \
assert (new_count <= count_stack (stack)); \
(stack).last = (stack).start + (new_count); \
} while(0)
/*------------------------------------------------------------------------*/
#define forall_stack(stack,it) \
for (it = (stack).start; it != (stack).last; it++)
/*------------------------------------------------------------------------*/
#define stack2ints(stack) \
booleforce_intcpy ((stack).start, count_stack (stack))
/*------------------------------------------------------------------------*/
#define stack2unsigneds(s) \
(unsigned*) booleforce_intcpy ((int*)((s).start), count_stack (s))
/*------------------------------------------------------------------------*/
#endif