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
|
// file : build2/utility.cxx -*- C++ -*-
// copyright : Copyright (c) 2014-2016 Code Synthesis Ltd
// license : MIT; see accompanying LICENSE file
#include <build2/utility>
#include <cstdlib> // strtol()
#include <build2/context>
#include <build2/variable>
#include <build2/diagnostics>
using namespace std;
namespace build2
{
//
// <build2/types>
//
ostream&
operator<< (ostream& os, const path& p)
{
return os << (stream_verb (os) < 2 ? diag_relative (p) : p.string ());
}
ostream&
operator<< (ostream& os, const dir_path& d)
{
if (stream_verb (os) < 2)
os << diag_relative (d); // Adds trailing '/'.
else
{
const string& s (d.string ());
// Print the directory with trailing '/'.
//
if (!s.empty ())
os << s << (dir_path::traits::is_separator (s.back ()) ? "" : "/");
}
return os;
}
//
// <build2/utility>
//
string&
trim (string& l)
{
/*
assert (trim (r = "") == "");
assert (trim (r = " ") == "");
assert (trim (r = " \t\r") == "");
assert (trim (r = "a") == "a");
assert (trim (r = " a") == "a");
assert (trim (r = "a ") == "a");
assert (trim (r = " \ta") == "a");
assert (trim (r = "a \r") == "a");
assert (trim (r = " a ") == "a");
assert (trim (r = " \ta \r") == "a");
*/
size_t i (0), n (l.size ());
for (char c;
i != n && ((c = l[i]) == ' ' || c == '\t' || c == '\r');
++i) ;
for (char c;
n != i && ((c = l[n - 1]) == ' ' || c == '\t' || c == '\r');
--n) ;
if (i != 0)
{
string s (l, i, n - i);
l.swap (s);
}
else if (n != l.size ())
l.resize (n);
return l;
}
const string empty_string;
const path empty_path;
const dir_path empty_dir_path;
void
append_options (cstrings& args, const lookup<const value>& l)
{
if (l)
append_options (args, as<strings> (*l));
}
void
hash_options (sha256& csum, const lookup<const value>& l)
{
if (l)
hash_options (csum, as<strings> (*l));
}
void
append_options (cstrings& args, const const_strings_value& sv)
{
if (!sv.empty ())
{
args.reserve (args.size () + sv.size ());
for (const string& s: sv)
args.push_back (s.c_str ());
}
}
void
hash_options (sha256& csum, const const_strings_value& sv)
{
for (const string& s: sv)
csum.append (s);
}
bool
find_option (const char* option, const lookup<const value>& l)
{
if (l)
{
for (const string& s: as<strings> (*l))
{
if (s == option)
return true;
}
}
return false;
}
unsigned int
to_version (const string& s)
{
// See tests/version.
//
auto parse = [&s] (size_t& p, const char* m, long min = 0, long max = 99)
-> unsigned int
{
if (s[p] == '-' || s[p] == '+') // stoi() allows these.
throw invalid_argument (m);
const char* b (s.c_str () + p);
char* e;
long r (strtol (b, &e, 10));
if (b == e || r < min || r > max)
throw invalid_argument (m);
p = e - s.c_str ();
return static_cast<unsigned int> (r);
};
auto bail = [] (const char* m) {throw invalid_argument (m);};
unsigned int ma, mi, bf, ab (0);
size_t p (0), n (s.size ());
ma = parse (p, "invalid major version");
if (p >= n || s[p] != '.')
bail ("'.' expected after major version");
mi = parse (++p, "invalid minor version");
if (p >= n || s[p] != '.')
bail ("'.' expected after minor version");
bf = parse (++p, "invalid bugfix version");
if (p < n)
{
if (s[p] != '-')
bail ("'-' expected after bugfix version");
char k (s[++p]);
if (k != '\0')
{
if (k != 'a' && k != 'b')
bail ("'a' or 'b' expected in release component");
ab = parse (++p, "invalid release component", 1, 49);
if (p != n)
bail ("junk after release component");
if (k == 'b')
ab += 50;
}
else
ab = 1;
}
// AABBCCDD
unsigned int r (ma * 1000000U +
mi * 10000U +
bf * 100U);
if (ab != 0)
{
if (r == 0)
bail ("0.0.0 version with release component");
r -= 100;
r += ab;
}
return r;
}
bool exception_unwinding_dtor = false;
}
|
