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
|
// file : build/prerequisite.cxx -*- C++ -*-
// copyright : Copyright (c) 2014-2015 Code Synthesis Tools CC
// license : MIT; see accompanying LICENSE file
#include <build/prerequisite>
#include <ostream>
#include <build/scope>
#include <build/target> // target_type
#include <build/context>
#include <build/diagnostics>
using namespace std;
namespace build
{
ostream&
operator<< (ostream& os, const prerequisite& p)
{
if (p.target != nullptr)
os << *p.target;
else
{
os << p.type.name << '{';
// Print scope unless the directory is absolute.
//
if (!p.dir.absolute ())
{
string s (diag_relative_work (p.scope.path ()));
if (!s.empty () && s.back () != path::traits::directory_separator)
os << s << path::traits::directory_separator << ": ";
}
// Print directory.
//
if (!p.dir.empty ())
{
string s (diag_relative_work (p.dir));
if (!s.empty () && s.back () != path::traits::directory_separator)
os << s << path::traits::directory_separator;
}
os << p.name;
if (p.ext != nullptr && !p.ext->empty ())
os << '.' << *p.ext;
os << '}';
}
return os;
}
bool
operator< (const prerequisite& x, const prerequisite& y)
{
//@@ TODO: use compare() to compare once.
// Unspecified and specified extension are assumed equal. The
// extension strings are from the pool, so we can just compare
// pointers.
//
return
(x.type.id < y.type.id) ||
(x.type.id == y.type.id && x.name < y.name) ||
(x.type.id == y.type.id && x.name == y.name && x.dir < y.dir) ||
(x.type.id == y.type.id && x.name == y.name && x.dir == y.dir &&
x.ext != nullptr && y.ext != nullptr && x.ext < y.ext);
}
// prerequisite_set
//
auto prerequisite_set::
insert (const target_type& tt,
path dir,
std::string name,
const std::string* ext,
scope& s,
tracer& trace) -> pair<prerequisite&, bool>
{
//@@ OPT: would be nice to somehow first check if this prerequisite is
// already in the set before allocating a new instance.
// Find or insert.
//
auto r (emplace (tt, move (dir), move (name), ext, s));
prerequisite& p (const_cast<prerequisite&> (*r.first));
// Update extension if the existing prerequisite has it unspecified.
//
if (p.ext != ext)
{
level4 ([&]{
diag_record r (trace);
r << "assuming prerequisite " << p << " is the same as the "
<< "one with ";
if (ext == nullptr)
r << "unspecified extension";
else if (ext->empty ())
r << "no extension";
else
r << "extension " << *ext;
});
if (ext != nullptr)
p.ext = ext;
}
return pair<prerequisite&, bool> (p, r.second);
}
}
|
