blob: 0b4505efb77651efe1409165442b838ecb7217bc (
plain)
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
|
//===----------------------- unittest_demangle.cpp ------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++98, c++03
#include "../src/cxa_demangle.cpp"
using namespace __cxxabiv1;
void testPODSmallVector() {
{ // {push/pop}_back
PODSmallVector<int, 1> PSV;
PSV.push_back(0);
PSV.push_back(1);
PSV.push_back(2);
PSV.push_back(3);
for (int i = 0; i < 4; ++i)
assert(PSV[i] == i);
PSV.pop_back();
for (int i = 0; i < 3; ++i)
assert(PSV[i] == i);
PSV.pop_back();
PSV.pop_back();
assert(!PSV.empty() && PSV.size() == 1);
PSV.pop_back();
assert(PSV.empty() && PSV.size() == 0);
}
{
PODSmallVector<int, 1> PSV1;
PSV1.push_back(1);
PSV1.push_back(2);
PSV1.push_back(3);
PODSmallVector<int, 1> PSV2;
std::swap(PSV1, PSV2);
assert(PSV1.size() == 0);
assert(PSV2.size() == 3);
int i = 1;
for (int x : PSV2) {
assert(x == i);
++i;
}
assert(i == 4);
std::swap(PSV1, PSV2);
assert(PSV1.size() == 3);
assert(PSV2.size() == 0);
i = 1;
for (int x : PSV1) {
assert(x == i);
++i;
}
assert(i == 4);
}
{
PODSmallVector<int, 10> PSV1;
PODSmallVector<int, 10> PSV2;
PSV1.push_back(0);
PSV1.push_back(1);
PSV1.push_back(2);
assert(PSV1.size() == 3);
assert(PSV2.size() == 0);
std::swap(PSV1, PSV2);
assert(PSV1.size() == 0);
assert(PSV2.size() == 3);
int i = 0;
for (int x : PSV2) {
assert(x == i);
++i;
}
for (int x : PSV1) {
assert(false);
(void)x;
}
}
}
void testSubstitutionTable() {
{
SubstitutionTable<2> Tab;
NameType Names[] = {{"MERP"}, {"MARP"}, {"MAMP"}};
Tab.pushPack();
Tab.pushSubstitutionIntoPack(&Names[0]);
Tab.pushSubstitutionIntoPack(&Names[1]);
Tab.pushSubstitutionIntoPack(&Names[2]);
int Index = 0;
for (Node* N : Tab.nthSubstitution(0)) {
assert(static_cast<NameType*>(N)->getName() == Names[Index].getName());
++Index;
}
assert(Index == 3);
Tab.popPack();
assert(Tab.empty() && Tab.size() == 0);
Tab.pushSubstitution(&Names[0]);
Tab.pushSubstitution(&Names[1]);
assert(!Tab.empty() && Tab.size() == 2);
int I = 0;
for (Node* N : Tab.nthSubstitution(0)) {
assert(static_cast<NameType*>(N)->getName() == "MERP");
assert(I == 0);
++I;
}
for (Node* N : Tab.nthSubstitution(1)) {
assert(static_cast<NameType*>(N)->getName() == "MARP");
assert(I == 1);
++I;
}
}
}
int main() {
testPODSmallVector();
testSubstitutionTable();
}
|
