blob: e5c5fec21d0fa4e4e912f22db60b1723c780f3c7 (
plain)
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
|
// file : build/scope -*- C++ -*-
// copyright : Copyright (c) 2014-2015 Code Synthesis Tools CC
// license : MIT; see accompanying LICENSE file
#ifndef BUILD_SCOPE
#define BUILD_SCOPE
#include <unordered_set>
#include <build/path>
#include <build/path-map>
#include <build/variable>
#include <build/prerequisite>
namespace build
{
class scope
{
public:
typedef build::path path_type;
const path_type&
path () const {return i_->first;} // Absolute and normalized.
scope*
parent () const {return parent_;}
// Variable lookup.
//
public:
value_proxy
operator[] (const std::string&);
value_proxy
operator[] (const variable&);
private:
friend class scope_map;
typedef path_map<scope>::const_iterator iterator;
scope (): variables (*this) {}
void
init (const iterator& i, scope* p) {i_ = i; parent_ = p;}
void
parent (scope& p) {parent_ = &p;}
public:
variable_map variables;
prerequisite_set prerequisites;
// Set of buildfiles already loaded for this scope. The included
// buildfiles are checked against project root scope while
// imported -- against the overall root scope (root_scope).
//
std::unordered_set<path_type> buildfiles;
private:
iterator i_;
scope* parent_;
};
class scope_map: public path_map<scope>
{
public:
// Note that we assume the first insertion into the map is that
// of the root scope.
//
scope&
operator[] (const path&);
// Find the most qualified scope that encompasses this path.
//
scope&
find (const path&);
private:
typedef path_map<scope> base;
};
extern scope_map scopes;
extern scope* root_scope;
}
#endif // BUILD_SCOPE
|
