-
Notifications
You must be signed in to change notification settings - Fork 1.2k
Expand file tree
/
Copy pathset_test.cc
More file actions
256 lines (194 loc) · 6.87 KB
/
Copy pathset_test.cc
File metadata and controls
256 lines (194 loc) · 6.87 KB
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
248
249
250
251
252
253
254
255
256
// Copyright 2010 The RE2 Authors. All Rights Reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
#include "re2/set.h"
#include <stddef.h>
#include <utility>
#include <vector>
#include "gtest/gtest.h"
#include "re2/re2.h"
namespace re2 {
TEST(Set, Unanchored) {
RE2::Set s(RE2::DefaultOptions, RE2::UNANCHORED);
ASSERT_EQ(s.Size(), 0);
ASSERT_EQ(s.Add("foo", NULL), 0);
ASSERT_EQ(s.Size(), 1);
ASSERT_EQ(s.Add("(", NULL), -1);
ASSERT_EQ(s.Size(), 1);
ASSERT_EQ(s.Add("bar", NULL), 1);
ASSERT_EQ(s.Size(), 2);
ASSERT_EQ(s.Compile(), true);
ASSERT_EQ(s.Size(), 2);
ASSERT_EQ(s.Match("foobar", NULL), true);
ASSERT_EQ(s.Match("fooba", NULL), true);
ASSERT_EQ(s.Match("oobar", NULL), true);
std::vector<int> v;
ASSERT_EQ(s.Match("foobar", &v), true);
ASSERT_EQ(v.size(), size_t{2});
ASSERT_EQ(v[0], 0);
ASSERT_EQ(v[1], 1);
ASSERT_EQ(s.Match("fooba", &v), true);
ASSERT_EQ(v.size(), size_t{1});
ASSERT_EQ(v[0], 0);
ASSERT_EQ(s.Match("oobar", &v), true);
ASSERT_EQ(v.size(), size_t{1});
ASSERT_EQ(v[0], 1);
}
TEST(Set, UnanchoredFactored) {
RE2::Set s(RE2::DefaultOptions, RE2::UNANCHORED);
ASSERT_EQ(s.Add("foo", NULL), 0);
ASSERT_EQ(s.Add("(", NULL), -1);
ASSERT_EQ(s.Add("foobar", NULL), 1);
ASSERT_EQ(s.Compile(), true);
ASSERT_EQ(s.Match("foobar", NULL), true);
ASSERT_EQ(s.Match("obarfoobaroo", NULL), true);
ASSERT_EQ(s.Match("fooba", NULL), true);
ASSERT_EQ(s.Match("oobar", NULL), false);
std::vector<int> v;
ASSERT_EQ(s.Match("foobar", &v), true);
ASSERT_EQ(v.size(), size_t{2});
ASSERT_EQ(v[0], 0);
ASSERT_EQ(v[1], 1);
ASSERT_EQ(s.Match("obarfoobaroo", &v), true);
ASSERT_EQ(v.size(), size_t{2});
ASSERT_EQ(v[0], 0);
ASSERT_EQ(v[1], 1);
ASSERT_EQ(s.Match("fooba", &v), true);
ASSERT_EQ(v.size(), size_t{1});
ASSERT_EQ(v[0], 0);
ASSERT_EQ(s.Match("oobar", &v), false);
ASSERT_EQ(v.size(), size_t{0});
}
TEST(Set, UnanchoredDollar) {
RE2::Set s(RE2::DefaultOptions, RE2::UNANCHORED);
ASSERT_EQ(s.Add("foo$", NULL), 0);
ASSERT_EQ(s.Compile(), true);
ASSERT_EQ(s.Match("foo", NULL), true);
ASSERT_EQ(s.Match("foobar", NULL), false);
std::vector<int> v;
ASSERT_EQ(s.Match("foo", &v), true);
ASSERT_EQ(v.size(), size_t{1});
ASSERT_EQ(v[0], 0);
ASSERT_EQ(s.Match("foobar", &v), false);
ASSERT_EQ(v.size(), size_t{0});
}
TEST(Set, UnanchoredWordBoundary) {
RE2::Set s(RE2::DefaultOptions, RE2::UNANCHORED);
ASSERT_EQ(s.Add("foo\\b", NULL), 0);
ASSERT_EQ(s.Compile(), true);
ASSERT_EQ(s.Match("foo", NULL), true);
ASSERT_EQ(s.Match("foobar", NULL), false);
ASSERT_EQ(s.Match("foo bar", NULL), true);
std::vector<int> v;
ASSERT_EQ(s.Match("foo", &v), true);
ASSERT_EQ(v.size(), size_t{1});
ASSERT_EQ(v[0], 0);
ASSERT_EQ(s.Match("foobar", &v), false);
ASSERT_EQ(v.size(), size_t{0});
ASSERT_EQ(s.Match("foo bar", &v), true);
ASSERT_EQ(v.size(), size_t{1});
ASSERT_EQ(v[0], 0);
}
TEST(Set, Anchored) {
RE2::Set s(RE2::DefaultOptions, RE2::ANCHOR_BOTH);
ASSERT_EQ(s.Add("foo", NULL), 0);
ASSERT_EQ(s.Add("(", NULL), -1);
ASSERT_EQ(s.Add("bar", NULL), 1);
ASSERT_EQ(s.Compile(), true);
ASSERT_EQ(s.Match("foobar", NULL), false);
ASSERT_EQ(s.Match("fooba", NULL), false);
ASSERT_EQ(s.Match("oobar", NULL), false);
ASSERT_EQ(s.Match("foo", NULL), true);
ASSERT_EQ(s.Match("bar", NULL), true);
std::vector<int> v;
ASSERT_EQ(s.Match("foobar", &v), false);
ASSERT_EQ(v.size(), size_t{0});
ASSERT_EQ(s.Match("fooba", &v), false);
ASSERT_EQ(v.size(), size_t{0});
ASSERT_EQ(s.Match("oobar", &v), false);
ASSERT_EQ(v.size(), size_t{0});
ASSERT_EQ(s.Match("foo", &v), true);
ASSERT_EQ(v.size(), size_t{1});
ASSERT_EQ(v[0], 0);
ASSERT_EQ(s.Match("bar", &v), true);
ASSERT_EQ(v.size(), size_t{1});
ASSERT_EQ(v[0], 1);
}
TEST(Set, EmptyUnanchored) {
RE2::Set s(RE2::DefaultOptions, RE2::UNANCHORED);
ASSERT_EQ(s.Compile(), true);
ASSERT_EQ(s.Match("", NULL), false);
ASSERT_EQ(s.Match("foobar", NULL), false);
std::vector<int> v;
ASSERT_EQ(s.Match("", &v), false);
ASSERT_EQ(v.size(), size_t{0});
ASSERT_EQ(s.Match("foobar", &v), false);
ASSERT_EQ(v.size(), size_t{0});
}
TEST(Set, EmptyAnchored) {
RE2::Set s(RE2::DefaultOptions, RE2::ANCHOR_BOTH);
ASSERT_EQ(s.Compile(), true);
ASSERT_EQ(s.Match("", NULL), false);
ASSERT_EQ(s.Match("foobar", NULL), false);
std::vector<int> v;
ASSERT_EQ(s.Match("", &v), false);
ASSERT_EQ(v.size(), size_t{0});
ASSERT_EQ(s.Match("foobar", &v), false);
ASSERT_EQ(v.size(), size_t{0});
}
TEST(Set, Prefix) {
RE2::Set s(RE2::DefaultOptions, RE2::ANCHOR_BOTH);
ASSERT_EQ(s.Add("/prefix/\\d*", NULL), 0);
ASSERT_EQ(s.Compile(), true);
ASSERT_EQ(s.Match("/prefix", NULL), false);
ASSERT_EQ(s.Match("/prefix/", NULL), true);
ASSERT_EQ(s.Match("/prefix/42", NULL), true);
std::vector<int> v;
ASSERT_EQ(s.Match("/prefix", &v), false);
ASSERT_EQ(v.size(), size_t{0});
ASSERT_EQ(s.Match("/prefix/", &v), true);
ASSERT_EQ(v.size(), size_t{1});
ASSERT_EQ(v[0], 0);
ASSERT_EQ(s.Match("/prefix/42", &v), true);
ASSERT_EQ(v.size(), size_t{1});
ASSERT_EQ(v[0], 0);
}
TEST(Set, MoveSemantics) {
RE2::Set s1(RE2::DefaultOptions, RE2::UNANCHORED);
ASSERT_EQ(s1.Add("foo\\d+", NULL), 0);
ASSERT_EQ(s1.Compile(), true);
ASSERT_EQ(s1.Match("abc foo1 xyz", NULL), true);
ASSERT_EQ(s1.Match("abc bar2 xyz", NULL), false);
// The moved-to object should do what the moved-from object did.
RE2::Set s2 = std::move(s1);
ASSERT_EQ(s2.Match("abc foo1 xyz", NULL), true);
ASSERT_EQ(s2.Match("abc bar2 xyz", NULL), false);
// The moved-from object should have been reset and be reusable.
ASSERT_EQ(s1.Add("bar\\d+", NULL), 0);
ASSERT_EQ(s1.Compile(), true);
ASSERT_EQ(s1.Match("abc foo1 xyz", NULL), false);
ASSERT_EQ(s1.Match("abc bar2 xyz", NULL), true);
// Verify that "overwriting" works and also doesn't leak memory.
// (The latter will need a leak detector such as LeakSanitizer.)
s1 = std::move(s2);
ASSERT_EQ(s1.Match("abc foo1 xyz", NULL), true);
ASSERT_EQ(s1.Match("abc bar2 xyz", NULL), false);
}
// Regression test: self-move-assignment must not trigger use-after-free.
// RE2::Set::operator=(Set&&) previously called this->~Set() before checking
// for self-assignment, resulting in undefined behavior when this == &other.
TEST(Set, SelfMoveAssignment) {
RE2::Set s(RE2::DefaultOptions, RE2::UNANCHORED);
std::string err;
ASSERT_EQ(s.Add("foo.*bar", &err), 0);
ASSERT_EQ(s.Add("baz[0-9]+", &err), 1);
ASSERT_TRUE(s.Compile());
// Self-move-assignment: previously UB (use-after-free via placement new
// reading destroyed object). Must leave the set in a valid state.
s = std::move(s);
std::vector<int> matches;
// After self-move, the object must still be usable (or at least not crash).
// We rely on ASAN/MSan to detect any use-after-free.
(void)s.Match("fooXbar", &matches);
}
} // namespace re2