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
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
|
// file : libbrep/common.hxx -*- C++ -*-
// copyright : Copyright (c) 2014-2018 Code Synthesis Ltd
// license : MIT; see accompanying LICENSE file
#ifndef LIBBREP_COMMON_HXX
#define LIBBREP_COMMON_HXX
#include <ratio>
#include <chrono>
#include <type_traits> // static_assert
#include <libbpkg/package-name.hxx>
#include <libbrep/types.hxx>
#include <libbrep/utility.hxx>
// The uint16_t value range is not fully covered by SMALLINT PostgreSQL type
// to which uint16_t is mapped by default.
//
#pragma db value(uint16_t) type("INTEGER")
namespace brep
{
// Use an image type to map bpkg::version to the database since there
// is no way to modify individual components directly.
//
#pragma db value
struct _version
{
uint16_t epoch;
string canonical_upstream;
string canonical_release;
uint16_t revision;
string upstream;
optional<string> release;
};
}
#include <libbpkg/manifest.hxx>
namespace brep
{
using optional_version = optional<bpkg::version>;
using _optional_version = optional<_version>;
}
// Prevent assert() macro expansion in get/set expressions. This should
// appear after all #include directives since the assert() macro is
// redefined in each <assert.h> inclusion.
//
#ifdef ODB_COMPILER
# undef assert
# define assert assert
void assert (int);
#endif
// We have to keep these mappings at the global scope instead of inside
// the brep namespace because they need to be also effective in the
// bpkg namespace from which we "borrow" types (and some of them use version).
//
#pragma db map type(bpkg::version) as(brep::_version) \
to(brep::_version{(?).epoch, \
(?).canonical_upstream, \
(?).canonical_release, \
(?).revision, \
(?).upstream, \
(?).release}) \
from(bpkg::version ((?).epoch, \
std::move ((?).upstream), \
std::move ((?).release), \
(?).revision, \
0))
#pragma db map type(brep::optional_version) as(brep::_optional_version) \
to((?) \
? brep::_version{(?)->epoch, \
(?)->canonical_upstream, \
(?)->canonical_release, \
(?)->revision, \
(?)->upstream, \
(?)->release} \
: brep::_optional_version ()) \
from((?) \
? bpkg::version ((?)->epoch, \
std::move ((?)->upstream), \
std::move ((?)->release), \
(?)->revision, \
0) \
: brep::optional_version ())
namespace brep
{
// path
//
#pragma db map type(path) as(string) to((?).string ()) from(brep::path (?))
using optional_path = optional<path>;
using optional_string = optional<string>;
#pragma db map type(optional_path) as(brep::optional_string) \
to((?) ? (?)->string () : brep::optional_string ()) \
from((?) ? brep::path (*(?)) : brep::optional_path ())
#pragma db map type(dir_path) as(string) \
to((?).string ()) from(brep::dir_path (?))
// Make sure that timestamp can be represented in nonoseconds without loss
// of accuracy, so the following ODB mapping is adequate.
//
static_assert(
std::ratio_greater_equal<timestamp::period,
std::chrono::nanoseconds::period>::value,
"The following timestamp ODB mapping is invalid");
// As it pointed out in libbutl/timestamp.mxx we will overflow in year 2262,
// but by that time some larger basic type will be available for mapping.
//
#pragma db map type(timestamp) as(uint64_t) \
to(std::chrono::duration_cast<std::chrono::nanoseconds> ( \
(?).time_since_epoch ()).count ()) \
from(brep::timestamp ( \
std::chrono::duration_cast<brep::timestamp::duration> ( \
std::chrono::nanoseconds (?))))
// version
//
using bpkg::version;
#pragma db value
struct canonical_version
{
uint16_t epoch;
string canonical_upstream;
string canonical_release;
uint16_t revision;
bool
empty () const noexcept
{
// Note that an empty canonical_upstream doesn't denote an empty
// canonical_version. Remeber, that canonical_upstream doesn't include
// rightmost digit-only zero components? So non-empty version("0") has
// an empty canonical_upstream.
//
return epoch == 0 && canonical_upstream.empty () &&
canonical_release.empty () && revision == 0;
}
// Change collation to ensure the proper comparison of the "absent" release
// with a specified one.
//
// The default collation for UTF8-encoded TEXT columns in PostgreSQL is
// UCA-compliant. This makes the statement 'a' < '~' to be false, which
// in turn makes the statement 2.1.alpha < 2.1 to be false as well.
//
// Unicode Collation Algorithm (UCA): http://unicode.org/reports/tr10/
//
#pragma db member(canonical_release) options("COLLATE \"C\"")
};
#pragma db value transient
struct upstream_version: version
{
#pragma db member(upstream_) virtual(string) \
get(this.upstream) \
set(this = brep::version (0, std::move (?), std::string (), 0, 0))
#pragma db member(release_) virtual(optional_string) \
get(this.release) \
set(this = brep::version ( \
0, std::move (this.upstream), std::move (?), 0, 0))
upstream_version () = default;
upstream_version (version v): version (move (v)) {}
upstream_version&
operator= (version v) {version& b (*this); b = v; return *this;}
void
init (const canonical_version& cv, const upstream_version& uv)
{
*this = version (cv.epoch, uv.upstream, uv.release, cv.revision, 0);
assert (cv.canonical_upstream == canonical_upstream &&
cv.canonical_release == canonical_release);
}
};
// Wildcard version. Satisfies any dependency constraint and is represented
// as 0+0 (which is also the "stub version"; since a real version is always
// greater than the stub version, we reuse it to signify a special case).
//
extern const version wildcard_version;
// package_name
//
using bpkg::package_name;
#pragma db value(package_name) type("CITEXT")
#pragma db map type("CITEXT") as("TEXT") to("(?)::CITEXT") from("(?)::TEXT")
// package_id
//
#pragma db value
struct package_id
{
package_name name;
canonical_version version;
package_id () = default;
package_id (package_name n, const brep::version& v)
: name (move (n)),
version {
v.epoch, v.canonical_upstream, v.canonical_release, v.revision}
{
}
};
// repository_type
//
using bpkg::repository_type;
using bpkg::to_repository_type;
#pragma db map type(repository_type) as(string) \
to(to_string (?)) \
from(brep::to_repository_type (?))
// repository_url
//
using bpkg::repository_url;
#pragma db map type(repository_url) as(string) \
to((?).string ()) \
from((?).empty () ? brep::repository_url () : brep::repository_url (?))
// repository_location
//
using bpkg::repository_location;
#pragma db value
struct _repository_location
{
repository_url url;
repository_type type;
};
// Note that the type() call fails for an empty repository location.
//
#pragma db map type(repository_location) as(_repository_location) \
to(brep::_repository_location {(?).url (), \
(?).empty () \
? brep::repository_type::pkg \
: (?).type ()}) \
from(brep::repository_location (std::move ((?).url), (?).type))
// Version comparison operators.
//
// They allow comparing objects that have epoch, canonical_upstream,
// canonical_release, and revision data members. The idea is that this
// works for both query members of types version and canonical_version
// as well as for comparing canonical_version to version.
//
template <typename T1, typename T2>
inline auto
compare_version_eq (const T1& x, const T2& y, bool revision)
-> decltype (x.epoch == y.epoch)
{
// Since we don't quite know what T1 and T2 are (and where the resulting
// expression will run), let's not push our luck with something like
// (!revision || x.revision == y.revision).
//
auto r (x.epoch == y.epoch &&
x.canonical_upstream == y.canonical_upstream &&
x.canonical_release == y.canonical_release);
return revision
? r && x.revision == y.revision
: r;
}
template <typename T1, typename T2>
inline auto
compare_version_ne (const T1& x, const T2& y, bool revision)
-> decltype (x.epoch == y.epoch)
{
auto r (x.epoch != y.epoch ||
x.canonical_upstream != y.canonical_upstream ||
x.canonical_release != y.canonical_release);
return revision
? r || x.revision != y.revision
: r;
}
template <typename T1, typename T2>
inline auto
compare_version_lt (const T1& x, const T2& y, bool revision)
-> decltype (x.epoch == y.epoch)
{
auto r (
x.epoch < y.epoch ||
(x.epoch == y.epoch && x.canonical_upstream < y.canonical_upstream) ||
(x.epoch == y.epoch && x.canonical_upstream == y.canonical_upstream &&
x.canonical_release < y.canonical_release));
return revision
? r ||
(x.epoch == y.epoch && x.canonical_upstream == y.canonical_upstream &&
x.canonical_release == y.canonical_release && x.revision < y.revision)
: r;
}
template <typename T1, typename T2>
inline auto
compare_version_le (const T1& x, const T2& y, bool revision)
-> decltype (x.epoch == y.epoch)
{
auto r (
x.epoch < y.epoch ||
(x.epoch == y.epoch && x.canonical_upstream < y.canonical_upstream));
return revision
? r ||
(x.epoch == y.epoch && x.canonical_upstream == y.canonical_upstream &&
x.canonical_release < y.canonical_release) ||
(x.epoch == y.epoch && x.canonical_upstream == y.canonical_upstream &&
x.canonical_release == y.canonical_release && x.revision <= y.revision)
: r ||
(x.epoch == y.epoch && x.canonical_upstream == y.canonical_upstream &&
x.canonical_release <= y.canonical_release);
}
template <typename T1, typename T2>
inline auto
compare_version_gt (const T1& x, const T2& y, bool revision)
-> decltype (x.epoch == y.epoch)
{
auto r (
x.epoch > y.epoch ||
(x.epoch == y.epoch && x.canonical_upstream > y.canonical_upstream) ||
(x.epoch == y.epoch && x.canonical_upstream == y.canonical_upstream &&
x.canonical_release > y.canonical_release));
return revision
? r ||
(x.epoch == y.epoch && x.canonical_upstream == y.canonical_upstream &&
x.canonical_release == y.canonical_release && x.revision > y.revision)
: r;
}
template <typename T1, typename T2>
inline auto
compare_version_ge (const T1& x, const T2& y, bool revision)
-> decltype (x.epoch == y.epoch)
{
auto r (
x.epoch > y.epoch ||
(x.epoch == y.epoch && x.canonical_upstream > y.canonical_upstream));
return revision
? r ||
(x.epoch == y.epoch && x.canonical_upstream == y.canonical_upstream &&
x.canonical_release > y.canonical_release) ||
(x.epoch == y.epoch && x.canonical_upstream == y.canonical_upstream &&
x.canonical_release == y.canonical_release && x.revision >= y.revision)
: r ||
(x.epoch == y.epoch && x.canonical_upstream == y.canonical_upstream &&
x.canonical_release >= y.canonical_release);
}
template <typename T>
inline auto
order_by_version_desc (
const T& x,
bool first = true) -> //decltype ("ORDER BY" + x.epoch)
decltype (x.epoch == 0)
{
return (first ? "ORDER BY" : ", ")
+ x.epoch + "DESC,"
+ x.canonical_upstream + "DESC,"
+ x.canonical_release + "DESC,"
+ x.revision + "DESC";
}
// Package id comparison operators.
//
inline bool
operator< (const package_id& x, const package_id& y)
{
if (int r = x.name.compare (y.name))
return r < 0;
return compare_version_lt (x.version, y.version, true);
}
// They allow comparing objects that have name and version data members. The
// idea is that this works for both query members of package id types (in
// particular in join conditions) as well as for values of package_id type.
//
template <typename T1, typename T2>
inline auto
operator== (const T1& x, const T2& y)
-> decltype (x.name == y.name && x.version.epoch == y.version.epoch)
{
return x.name == y.name && compare_version_eq (x.version, y.version, true);
}
template <typename T1, typename T2>
inline auto
operator!= (const T1& x, const T2& y)
-> decltype (x.name == y.name && x.version.epoch == y.version.epoch)
{
return x.name != y.name || compare_version_ne (x.version, y.version, true);
}
}
#endif // LIBBREP_COMMON_HXX
|