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
|
/* Boolector: Satisfiability Modulo Theories (SMT) solver.
*
* Copyright (C) 2007-2021 by the authors listed in the AUTHORS file.
*
* This file is part of Boolector.
* See COPYING for more information on using this software.
*/
#include "test.h"
extern "C" {
#include "utils/btorstack.h"
}
class TestStack : public TestMm
{
};
TEST_F (TestStack, init_release)
{
BtorIntStack stack;
BTOR_INIT_STACK (d_mm, stack);
BTOR_RELEASE_STACK (stack);
}
TEST_F (TestStack, functionality)
{
BtorIntStack stack;
BTOR_INIT_STACK (d_mm, stack);
ASSERT_EQ (BTOR_COUNT_STACK (stack), 0u);
ASSERT_TRUE (BTOR_EMPTY_STACK (stack));
ASSERT_EQ (BTOR_SIZE_STACK (stack), 0u);
ASSERT_TRUE (BTOR_FULL_STACK (stack));
BTOR_PUSH_STACK (stack, 1);
ASSERT_EQ (BTOR_COUNT_STACK (stack), 1u);
ASSERT_FALSE (BTOR_EMPTY_STACK (stack));
ASSERT_EQ (BTOR_SIZE_STACK (stack), 1u);
ASSERT_TRUE (BTOR_FULL_STACK (stack));
BTOR_PUSH_STACK (stack, 2);
ASSERT_EQ (BTOR_COUNT_STACK (stack), 2u);
ASSERT_FALSE (BTOR_EMPTY_STACK (stack));
ASSERT_EQ (BTOR_SIZE_STACK (stack), 2u);
ASSERT_TRUE (BTOR_FULL_STACK (stack));
BTOR_PUSH_STACK (stack, 3);
ASSERT_EQ (BTOR_COUNT_STACK (stack), 3u);
ASSERT_FALSE (BTOR_EMPTY_STACK (stack));
ASSERT_EQ (BTOR_SIZE_STACK (stack), 4u);
ASSERT_FALSE (BTOR_FULL_STACK (stack));
ASSERT_EQ (BTOR_POP_STACK (stack), 3);
ASSERT_EQ (BTOR_COUNT_STACK (stack), 2u);
ASSERT_FALSE (BTOR_EMPTY_STACK (stack));
ASSERT_EQ (BTOR_SIZE_STACK (stack), 4u);
ASSERT_FALSE (BTOR_FULL_STACK (stack));
ASSERT_EQ (BTOR_POP_STACK (stack), 2);
ASSERT_EQ (BTOR_COUNT_STACK (stack), 1u);
ASSERT_FALSE (BTOR_EMPTY_STACK (stack));
ASSERT_EQ (BTOR_SIZE_STACK (stack), 4u);
ASSERT_FALSE (BTOR_FULL_STACK (stack));
ASSERT_EQ (BTOR_POP_STACK (stack), 1);
ASSERT_EQ (BTOR_COUNT_STACK (stack), 0u);
ASSERT_TRUE (BTOR_EMPTY_STACK (stack));
ASSERT_EQ (BTOR_SIZE_STACK (stack), 4u);
ASSERT_FALSE (BTOR_FULL_STACK (stack));
BTOR_RELEASE_STACK (stack);
}
TEST_F (TestStack, fit)
{
BtorIntStack stack;
int32_t i;
BTOR_INIT_STACK (d_mm, stack);
for (i = 0; i < 100; i++)
{
BTOR_FIT_STACK (stack, i);
stack.start[i] = i;
}
for (i = 0; i < 100; i++)
{
ASSERT_EQ (stack.start[i], i);
}
BTOR_FIT_STACK (stack, 999);
for (i = 100; i < 1000; i++)
{
ASSERT_FALSE (stack.start[i]);
}
BTOR_RELEASE_STACK (stack);
}
TEST_F (TestStack, reset)
{
BtorIntStack stack;
BTOR_INIT_STACK (d_mm, stack);
BTOR_PUSH_STACK (stack, 1);
BTOR_PUSH_STACK (stack, 2);
BTOR_PUSH_STACK (stack, 3);
ASSERT_EQ (BTOR_COUNT_STACK (stack), 3u);
ASSERT_FALSE (BTOR_EMPTY_STACK (stack));
ASSERT_EQ (BTOR_SIZE_STACK (stack), 4u);
ASSERT_FALSE (BTOR_FULL_STACK (stack));
BTOR_RESET_STACK (stack);
ASSERT_EQ (BTOR_COUNT_STACK (stack), 0u);
ASSERT_TRUE (BTOR_EMPTY_STACK (stack));
ASSERT_EQ (BTOR_SIZE_STACK (stack), 4u);
ASSERT_FALSE (BTOR_FULL_STACK (stack));
BTOR_RELEASE_STACK (stack);
}
|
