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
|
// file : CCF/IDL2/SemanticGraph/Translation.hpp
// author : Boris Kolpackov <boris@dre.vanderbilt.edu>
// cvs-id : $Id$
#ifndef CCF_IDL2_SEMANTIC_GRAPH_TRANSLATION_HPP
#define CCF_IDL2_SEMANTIC_GRAPH_TRANSLATION_HPP
#include <vector>
#include <string>
#include "CCF/IDL2/SemanticGraph/Elements.hpp"
namespace CCF
{
namespace IDL2
{
namespace SemanticGraph
{
class Root;
class TranslationRegion;
class TranslationUnit;
//
//
//
class ContainsPrincipal : public virtual Contains
{
public:
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
ContainsPrincipal ()
{
type_info (static_type_info ());
}
void
set_left_node (TranslationUnit& n);
void
set_right_node (TranslationRegion& n);
};
//
//
//
class ContainsImplied : public virtual Contains
{
public:
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
ContainsImplied (std::string const& name = "")
: name_ (name)
{
type_info (static_type_info ());
}
void
set_left_node (TranslationUnit& n);
void
set_right_node (TranslationRegion& n);
private:
std::string name_;
};
//
//
//
class ContainsRoot : public virtual Contains
{
public:
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
ContainsRoot ()
{
type_info (static_type_info ());
}
void
set_left_node (TranslationRegion& n);
void
set_right_node (Root& n);
};
//
//
//
class Includes : public virtual Contains
{
public:
Path
file () const
{
return file_;
}
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
Includes (Path const& file)
: file_ (file)
{
type_info (static_type_info ());
}
void
set_left_node (TranslationRegion& n);
void
set_right_node (TranslationRegion& n);
private:
Path file_;
};
//
//
//
class QuoteIncludes : public virtual Includes
{
public:
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
QuoteIncludes (Path const& file)
: Includes (file)
{
type_info (static_type_info ());
}
};
//
//
//
class BracketIncludes : public virtual Includes
{
public:
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
BracketIncludes (Path const& file)
: Includes (file)
{
type_info (static_type_info ());
}
};
//
//
//
class Root : public virtual Scope
{
public:
virtual SimpleName
name () const
{
return SimpleName ("");
}
virtual ScopedName
scoped_name () const
{
return ScopedName ("");
}
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
Root (Path const& path, unsigned long line)
: Node (path, line)
{
type_info (static_type_info ());
}
void
add_edge_right (Contains&)
{
// TranslationRegion contains Root
}
};
//
//
//
class TranslationRegion : public virtual Container
{
public:
Nameables
lookup (ScopedName const& name) const;
void
lookup (ScopedName const& name, Nameables& result) const;
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
TranslationRegion (Path const& path, unsigned long line)
: Node (path, line)
{
type_info (static_type_info ());
}
void
add_edge_right (Contains&)
{
}
};
class TranslationUnit : public virtual Container,
public Graph<Node, Edge>
{
public:
TranslationUnit (Path const& path, unsigned long line)
: Node (path, line)
{
type_info (static_type_info ());
}
Nameables
lookup (ScopedName const& name) const;
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
void
add_edge_left (ContainsPrincipal& e)
{
Container::add_edge_left (e);
}
void
add_edge_left (ContainsImplied& e)
{
Container::add_edge_left (e);
}
private:
TranslationUnit (TranslationUnit const&);
void operator= (TranslationUnit const&);
};
}
}
}
#include "CCF/IDL2/SemanticGraph/Translation.ipp"
#endif // CCF_IDL2_SEMANTIC_GRAPH_TRANSLATION_HPP
|
