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
|
/* 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/btorqueue.h"
}
BTOR_DECLARE_QUEUE (BtorUInt, uint32_t);
class TestQueue : public TestMm
{
};
TEST_F (TestQueue, init_release)
{
BtorUIntQueue queue;
BTOR_INIT_QUEUE (d_mm, queue);
BTOR_RELEASE_QUEUE (queue);
}
TEST_F (TestQueue, functionality)
{
BtorUIntQueue queue;
BTOR_INIT_QUEUE (d_mm, queue);
ASSERT_EQ (BTOR_COUNT_QUEUE (queue), 0u);
ASSERT_TRUE (BTOR_EMPTY_QUEUE (queue));
ASSERT_EQ (BTOR_SIZE_QUEUE (queue), 0u);
ASSERT_TRUE (BTOR_FULL_QUEUE (queue));
BTOR_ENQUEUE (queue, 1);
ASSERT_EQ (BTOR_COUNT_QUEUE (queue), 1u);
ASSERT_FALSE (BTOR_EMPTY_QUEUE (queue));
ASSERT_TRUE (BTOR_FULL_QUEUE (queue));
BTOR_ENQUEUE (queue, 2);
ASSERT_EQ (BTOR_COUNT_QUEUE (queue), 2u);
ASSERT_FALSE (BTOR_EMPTY_QUEUE (queue));
ASSERT_TRUE (BTOR_FULL_QUEUE (queue));
BTOR_ENQUEUE (queue, 3);
ASSERT_EQ (BTOR_COUNT_QUEUE (queue), 3u);
ASSERT_FALSE (BTOR_EMPTY_QUEUE (queue));
ASSERT_FALSE (BTOR_FULL_QUEUE (queue));
ASSERT_EQ (BTOR_DEQUEUE (queue), 1u);
ASSERT_EQ (BTOR_COUNT_QUEUE (queue), 2u);
ASSERT_FALSE (BTOR_EMPTY_QUEUE (queue));
ASSERT_FALSE (BTOR_FULL_QUEUE (queue));
ASSERT_EQ (BTOR_DEQUEUE (queue), 2u);
ASSERT_EQ (BTOR_COUNT_QUEUE (queue), 1u);
ASSERT_FALSE (BTOR_EMPTY_QUEUE (queue));
ASSERT_FALSE (BTOR_FULL_QUEUE (queue));
ASSERT_EQ (BTOR_DEQUEUE (queue), 3u);
ASSERT_EQ (BTOR_COUNT_QUEUE (queue), 0u);
ASSERT_TRUE (BTOR_EMPTY_QUEUE (queue));
ASSERT_FALSE (BTOR_FULL_QUEUE (queue));
ASSERT_LE (BTOR_SIZE_QUEUE (queue), 4u);
BTOR_RELEASE_QUEUE (queue);
}
TEST_F (TestQueue, reset)
{
BtorUIntQueue queue;
uint32_t i, j, k;
BTOR_INIT_QUEUE (d_mm, queue);
for (i = 0; i < 10000; i++) BTOR_ENQUEUE (queue, i);
ASSERT_EQ (BTOR_COUNT_QUEUE (queue), i);
ASSERT_FALSE (BTOR_EMPTY_QUEUE (queue));
ASSERT_EQ (BTOR_SIZE_QUEUE (queue), (uint32_t) (1 << 14));
ASSERT_FALSE (BTOR_FULL_QUEUE (queue));
for (j = 0; j < 5000; j++)
{
ASSERT_EQ (BTOR_DEQUEUE (queue), j);
}
for (k = 0; k < 100; k++)
{
for (j = 0; j < 5000; j++) BTOR_ENQUEUE (queue, j);
for (j = 0; j < 5000; j++) (void) BTOR_DEQUEUE (queue);
}
for (; i < (1 << 14); i++) BTOR_ENQUEUE (queue, i);
BTOR_RESET_QUEUE (queue);
ASSERT_EQ (BTOR_COUNT_QUEUE (queue), 0u);
ASSERT_TRUE (BTOR_EMPTY_QUEUE (queue));
ASSERT_EQ (BTOR_SIZE_QUEUE (queue), (uint32_t) (1 << 14));
ASSERT_FALSE (BTOR_FULL_QUEUE (queue));
BTOR_RELEASE_QUEUE (queue);
}
|
