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
|
// file : tests/wildcard/driver.cxx -*- C++ -*-
// copyright : Copyright (c) 2014-2017 Code Synthesis Ltd
// license : MIT; see accompanying LICENSE file
#include <map>
#include <string>
#include <vector>
#include <cassert>
#include <iostream>
#include <algorithm> // sort()
#include <exception>
#include <libbutl/path.hxx>
#include <libbutl/utility.hxx> // operator<<(ostream, exception)
#include <libbutl/optional.hxx>
#include <libbutl/filesystem.hxx>
using namespace std;
using namespace butl;
// Disable arguments globbing that may be enabled by default for MinGW runtime.
//
// Note that if _CRT_glob symbol is not defined explicitly, then runtime will
// be bound to the one defined in the implicitly linked libmingw32.a library.
// Yet another (but more troublesome) way is to link CRT_noglob.o (from MinGW
// libraries directory) that provides exactly the same symbol definition.
//
#ifdef __MINGW32__
int _CRT_glob = 0;
#endif
// Usages:
//
// argv[0] -mn <pattern> <name>
// argv[0] -sd [-n] <pattern> [<dir>]
// argv[0] -sp [-n] <pattern> <path> [<dir>]
//
// Execute actions specified by the first option. Exit with code 0 if succeed,
// 1 if fail, 2 on the underlying OS error (print error description to STDERR).
//
// -mn
// Match a name against the pattern.
//
// -sd
// Search for paths matching the pattern in the directory specified (absent
// directory means the current one). Print the matching canonicalized paths
// to STDOUT in the ascending order. Succeed if at least one matching path
// is found. For each matching path we will assert that it is also get
// matched being searched in the directory tree represented by this path
// itself.
//
// Note that the driver excludes from search file system entries which names
// start from dot, unless the pattern explicitly matches them.
//
// -sp
// Same as above, but behaves as if the directory tree being searched
// through contains only the specified entry. The start directory is used if
// the first pattern component is a self-matching wildcard.
//
// -n
// Do not sort paths found. Meaningful in combination with -sd or -sp
// options and must follow it, if specified in the command line.
//
int
main (int argc, const char* argv[])
try
{
assert (argc >= 2);
string op (argv[1]);
if (op == "-mn")
{
assert (argc == 4);
string pattern (argv[2]);
string name (argv[3]);
return path_match (pattern, name) ? 0 : 1;
}
else if (op == "-sd" || op == "-sp")
{
assert (argc >= (op == "-sd" ? 3 : 4));
bool sort (true);
int i (2);
for (; i != argc; ++i)
{
string o (argv[i]);
if (o == "-n")
sort = false;
else
break; // End of options.
}
assert (i != argc); // Still need pattern.
path pattern (argv[i++]);
optional<path> entry;
if (op == "-sp")
entry = path (argv[i++]);
dir_path start;
if (i != argc)
start = dir_path (argv[i++]);
assert (i == argc); // All args parsed,
vector<path> paths;
map<path, size_t> path_count;
auto add = [&paths, &path_count, &start] (path&& p,
const string& pt,
bool interim)
{
bool pd (!pt.empty () && pt[0] == '.'); // Dot-started pattern.
const path& fp (!p.empty ()
? p
: path_cast<path> (!start.empty ()
? start
: path::current_directory ()));
const string& s (fp.leaf ().string ());
assert (!s.empty ());
bool ld (s[0] == '.'); // Dot-started leaf.
// Skip dot-started names if pattern is not dot-started.
//
bool skip (ld && !pd);
if (interim)
return !skip;
if (!skip)
{
p.canonicalize ();
auto i (path_count.find (p));
if (i == path_count.end ())
path_count[p] = 1;
else
++(i->second);
paths.emplace_back (move (p));
}
return true;
};
if (!entry)
path_search (pattern, add, start);
else
path_search (pattern, *entry, add, start);
// Test search in the directory tree represented by the path.
//
for (const auto& p: path_count)
{
// Will match multiple times if the pattern contains several recursive
// components.
//
size_t match_count (0);
auto check = [&p, &match_count] (path&& pe, const string&, bool interim)
{
if (pe == p.first)
{
if (!interim)
++match_count;
else
// For self-matching the callback is first called in the interim
// mode (through the preopen function) with an empty path.
//
assert (pe.empty ());
}
return true;
};
path_search (pattern, p.first, check, start);
assert (match_count == p.second);
// Test path match.
//
assert (path_match (pattern, p.first, start));
}
// Print the found paths.
//
if (sort)
std::sort (paths.begin (), paths.end ());
for (const auto& p: paths)
cout << p.representation () << endl;
return paths.empty () ? 1 : 0;
}
else
assert (false);
}
catch (const invalid_path& e)
{
cerr << e << ": " << e.path << endl;
return 2;
}
catch (const exception& e)
{
cerr << e << endl;
return 2;
}
|
