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
|
/*
This file is part of DepQBF.
DepQBF, a solver for quantified boolean formulae (QBF).
Copyright 2010 Florian Lonsing, Johannes Kepler University, Linz, Austria.
See also http://fmv.jku.at/depqbf for further information.
DepQBF 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, either version 3 of the License, or (at
your option) any later version.
DepQBF 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 DepQBF. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef QDPLL_STACK_H_INCLUDED
#define QDPLL_STACK_H_INCLUDED
#include "qdpll_mem.h"
#define QDPLL_DECLARE_STACK(name, type) \
typedef struct name ## Stack name ## Stack; \
struct name ## Stack { type * start; type * top; type * end; }
#define QDPLL_INIT_STACK(stack) \
do { \
(stack).start = (stack).top = (stack).end = 0; \
} while (0)
#define QDPLL_ADJUST_STACK(mm,stack,size) \
do { \
size_t old_size; \
if ((size) > 0 && (old_size = QDPLL_SIZE_STACK(stack)) < (size)) \
{ \
size_t elem_bytes = sizeof(*(stack).start); \
size_t old_count = QDPLL_COUNT_STACK (stack); \
(stack).start = qdpll_realloc((mm), (stack).start, \
old_size * elem_bytes, \
size * elem_bytes); \
(stack).top = (stack).start + old_count; \
(stack).end = (stack).start + size; \
} \
}while(0) \
#define QDPLL_COUNT_STACK(stack) ((stack).top - (stack).start)
#define QDPLL_EMPTY_STACK(stack) ((stack).top == (stack).start)
#define QDPLL_RESET_STACK(stack) do { (stack).top = (stack).start; } while (0)
#define QDPLL_SIZE_STACK(stack) ((stack).end - (stack).start)
#define QDPLL_FULL_STACK(stack) ((stack).top == (stack).end)
#define QDPLL_DELETE_STACK(mm, stack) \
do { \
qdpll_free((mm), (stack).start, \
QDPLL_SIZE_STACK(stack) * sizeof(*(stack).start)); \
QDPLL_INIT_STACK ((stack)); \
} while (0)
#define QDPLL_ENLARGE_STACK(mm, stack) \
do { \
size_t old_size = QDPLL_SIZE_STACK (stack), new_size; \
new_size = old_size ? 2 * old_size : 1; \
size_t old_count = QDPLL_COUNT_STACK (stack); \
size_t elem_bytes = sizeof(*(stack).start); \
(stack).start = qdpll_realloc((mm), (stack).start, \
old_size*elem_bytes, \
new_size*elem_bytes); \
(stack).top = (stack).start + old_count; \
(stack).end = (stack).start + new_size; \
} while (0)
#define QDPLL_PUSH_STACK(mm, stack,elem) \
do { \
if (QDPLL_FULL_STACK ((stack))) \
QDPLL_ENLARGE_STACK ((mm), (stack)); \
*((stack).top++) = (elem); \
} while (0)
#define QDPLL_POP_STACK(stack) (*--(stack).top)
QDPLL_DECLARE_STACK (VoidPtr, void *);
#endif
|
