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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
|
/* Unit tests for ordered-hash-map.h.
Copyright (C) 2015-2020 Free Software Foundation, Inc.
This file is part of GCC.
GCC 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, or (at your option) any later
version.
GCC 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 GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "opts.h"
#include "hash-set.h"
#include "fixed-value.h"
#include "alias.h"
#include "flags.h"
#include "symtab.h"
#include "tree-core.h"
#include "stor-layout.h"
#include "tree.h"
#include "stringpool.h"
#include "ordered-hash-map.h"
#include "selftest.h"
#if CHECKING_P
namespace selftest {
/* Populate *OUT_KVS with the key/value pairs of M. */
template <typename HashMap, typename Key, typename Value>
static void
get_kv_pairs (const HashMap &m,
auto_vec<std::pair<Key, Value> > *out_kvs)
{
for (typename HashMap::iterator iter = m.begin ();
iter != m.end ();
++iter)
out_kvs->safe_push (std::make_pair ((*iter).first, (*iter).second));
}
/* Construct an ordered_hash_map <const char *, int> and verify that
various operations work correctly. */
static void
test_map_of_strings_to_int ()
{
ordered_hash_map <const char *, int> m;
const char *ostrich = "ostrich";
const char *elephant = "elephant";
const char *ant = "ant";
const char *spider = "spider";
const char *millipede = "Illacme plenipes";
const char *eric = "half a bee";
/* A fresh hash_map should be empty. */
ASSERT_EQ (0, m.elements ());
ASSERT_EQ (NULL, m.get (ostrich));
/* Populate the hash_map. */
ASSERT_EQ (false, m.put (ostrich, 2));
ASSERT_EQ (false, m.put (elephant, 4));
ASSERT_EQ (false, m.put (ant, 6));
ASSERT_EQ (false, m.put (spider, 8));
ASSERT_EQ (false, m.put (millipede, 750));
ASSERT_EQ (false, m.put (eric, 3));
/* Verify that we can recover the stored values. */
ASSERT_EQ (6, m.elements ());
ASSERT_EQ (2, *m.get (ostrich));
ASSERT_EQ (4, *m.get (elephant));
ASSERT_EQ (6, *m.get (ant));
ASSERT_EQ (8, *m.get (spider));
ASSERT_EQ (750, *m.get (millipede));
ASSERT_EQ (3, *m.get (eric));
/* Verify that the order of insertion is preserved. */
auto_vec<std::pair<const char *, int> > kvs;
get_kv_pairs (m, &kvs);
ASSERT_EQ (kvs.length (), 6);
ASSERT_EQ (kvs[0].first, ostrich);
ASSERT_EQ (kvs[0].second, 2);
ASSERT_EQ (kvs[1].first, elephant);
ASSERT_EQ (kvs[1].second, 4);
ASSERT_EQ (kvs[2].first, ant);
ASSERT_EQ (kvs[2].second, 6);
ASSERT_EQ (kvs[3].first, spider);
ASSERT_EQ (kvs[3].second, 8);
ASSERT_EQ (kvs[4].first, millipede);
ASSERT_EQ (kvs[4].second, 750);
ASSERT_EQ (kvs[5].first, eric);
ASSERT_EQ (kvs[5].second, 3);
}
/* Construct an ordered_hash_map using int_hash and verify that various
operations work correctly. */
static void
test_map_of_int_to_strings ()
{
const int EMPTY = -1;
const int DELETED = -2;
typedef int_hash <int, EMPTY, DELETED> int_hash_t;
ordered_hash_map <int_hash_t, const char *> m;
const char *ostrich = "ostrich";
const char *elephant = "elephant";
const char *ant = "ant";
const char *spider = "spider";
const char *millipede = "Illacme plenipes";
const char *eric = "half a bee";
/* A fresh hash_map should be empty. */
ASSERT_EQ (0, m.elements ());
ASSERT_EQ (NULL, m.get (2));
/* Populate the hash_map. */
ASSERT_EQ (false, m.put (2, ostrich));
ASSERT_EQ (false, m.put (4, elephant));
ASSERT_EQ (false, m.put (6, ant));
ASSERT_EQ (false, m.put (8, spider));
ASSERT_EQ (false, m.put (750, millipede));
ASSERT_EQ (false, m.put (3, eric));
/* Verify that we can recover the stored values. */
ASSERT_EQ (6, m.elements ());
ASSERT_EQ (*m.get (2), ostrich);
ASSERT_EQ (*m.get (4), elephant);
ASSERT_EQ (*m.get (6), ant);
ASSERT_EQ (*m.get (8), spider);
ASSERT_EQ (*m.get (750), millipede);
ASSERT_EQ (*m.get (3), eric);
/* Verify that the order of insertion is preserved. */
auto_vec<std::pair<int, const char *> > kvs;
get_kv_pairs (m, &kvs);
ASSERT_EQ (kvs.length (), 6);
ASSERT_EQ (kvs[0].first, 2);
ASSERT_EQ (kvs[0].second, ostrich);
ASSERT_EQ (kvs[1].first, 4);
ASSERT_EQ (kvs[1].second, elephant);
ASSERT_EQ (kvs[2].first, 6);
ASSERT_EQ (kvs[2].second, ant);
ASSERT_EQ (kvs[3].first, 8);
ASSERT_EQ (kvs[3].second, spider);
ASSERT_EQ (kvs[4].first, 750);
ASSERT_EQ (kvs[4].second, millipede);
ASSERT_EQ (kvs[5].first, 3);
ASSERT_EQ (kvs[5].second, eric);
}
/* Verify that we can remove items from an ordered_hash_map. */
static void
test_removal ()
{
ordered_hash_map <const char *, int> m;
const char *ostrich = "ostrich";
ASSERT_EQ (false, m.put (ostrich, 2));
ASSERT_EQ (1, m.elements ());
ASSERT_EQ (2, *m.get (ostrich));
{
auto_vec<std::pair<const char *, int> > kvs;
get_kv_pairs (m, &kvs);
ASSERT_EQ (kvs.length (), 1);
ASSERT_EQ (kvs[0].first, ostrich);
ASSERT_EQ (kvs[0].second, 2);
}
m.remove (ostrich);
ASSERT_EQ (0, m.elements ());
{
auto_vec<std::pair<const char *, int> > kvs;
get_kv_pairs (m, &kvs);
ASSERT_EQ (kvs.length (), 0);
}
/* Reinsertion (with a different value). */
ASSERT_EQ (false, m.put (ostrich, 42));
ASSERT_EQ (1, m.elements ());
ASSERT_EQ (42, *m.get (ostrich));
{
auto_vec<std::pair<const char *, int> > kvs;
get_kv_pairs (m, &kvs);
ASSERT_EQ (kvs.length (), 1);
ASSERT_EQ (kvs[0].first, ostrich);
ASSERT_EQ (kvs[0].second, 42);
}
}
/* Verify that ordered_hash_map's copy-ctor works. */
static void
test_copy_ctor ()
{
ordered_hash_map <const char *, int> m;
const char *ostrich = "ostrich";
ASSERT_EQ (false, m.put (ostrich, 2));
ASSERT_EQ (1, m.elements ());
ASSERT_EQ (2, *m.get (ostrich));
ordered_hash_map <const char *, int> copy (m);
ASSERT_EQ (1, copy.elements ());
ASSERT_EQ (2, *copy.get (ostrich));
/* Remove from source. */
m.remove (ostrich);
ASSERT_EQ (0, m.elements ());
/* Copy should be unaffected. */
ASSERT_EQ (1, copy.elements ());
ASSERT_EQ (2, *copy.get (ostrich));
}
/* Run all of the selftests within this file. */
void
ordered_hash_map_tests_cc_tests ()
{
test_map_of_strings_to_int ();
test_map_of_int_to_strings ();
test_removal ();
test_copy_ctor ();
}
} // namespace selftest
#endif /* CHECKING_P */
|
