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
|
/* Copyright 2009 Simon Richter <Simon.Richter@hogyros.de>
*
* Released under the GNU General Public Licence version 3.
*/
#include "header_output_visitor.hpp"
namespace foundry {
namespace tree {
header_output_visitor::header_output_visitor(std::ostream &out) :
out(out), state(fwddecl)
{
return;
}
void header_output_visitor::visit(root const &r)
{
descend(r.includes);
out << "#include <boost/intrusive_ptr.hpp>" << std::endl
<< "#include <list>" << std::endl;
state = fwddecl;
descend(r.global_namespace);
state = decl;
descend(r.global_namespace);
}
void header_output_visitor::visit(include_node const &n)
{
out << "#include " << (n.is_local?'"':'<') << n.name << (n.is_local?'"':'>') << std::endl;
}
void header_output_visitor::visit(namespace_node const &n)
{
if(!n.name.empty())
out << "namespace " << n.name << " {" << std::endl;
descend(n.namespaces);
descend(n.group);
if(!n.name.empty())
out << "}" << std::endl;
}
void header_output_visitor::visit(group_node const &n)
{
if(n.nodes.empty() && n.groups.empty())
return;
switch(state)
{
case fwddecl:
out << "struct " << n.name << ";" << std::endl
<< "typedef boost::intrusive_ptr<" << n.name << "> " << n.name << "_ptr;" << std::endl
<< "typedef " << n.name << " *" << n.name << "_weak_ptr;" << std::endl;
if(n.has_const_visitor)
out << "struct " << n.name << "_const_visitor;" << std::endl;
if(n.has_visitor)
out << "struct " << n.name << "_visitor;" << std::endl;
break;
case decl:
out << "struct " << n.name;
if(n.parent)
out << " : " << n.parent->name;
out << " {" << std::endl
<< " " << n.name << "(void) throw()";
if(!n.parent)
out << " : refcount(0)";
out << " { }" << std::endl
<< " virtual ~" << n.name << "(void) throw() { }" << std::endl;
if(n.has_visitor)
out << " virtual void apply(" << n.name << "_visitor &) = 0;" << std::endl;
if(n.has_const_visitor)
out << " virtual void apply(" << n.name << "_const_visitor &) const = 0;" << std::endl;
if(n.parent)
out << " using " << n.parent->name << "::apply;" << std::endl;
if(!n.parent)
out << " unsigned int refcount;" << std::endl;
descend(n.default_members);
out << "};" << std::endl;
if(!n.parent)
out << "inline void intrusive_ptr_add_ref(" << n.name << " *n) { ++n->refcount; }" << std::endl
<< "inline void intrusive_ptr_release(" << n.name << " *n) { if(!--n->refcount) delete n; }" << std::endl;
if(n.has_visitor)
{
out << "class " << n.name << "_visitor" << std::endl
<< "{" << std::endl
<< "public:" << std::endl
<< " virtual ~" << n.name << "_visitor(void) throw() { }" << std::endl
<< " inline void descend(" << n.name << " &n) { n.apply(*this); }" << std::endl
<< " template<typename T>" << std::endl
<< " inline void descend(boost::intrusive_ptr<T> const &p) { if(p) descend(*p); }" << std::endl;
if(n.ns->uses_lists)
out << " template<typename T, typename Alloc>" << std::endl
<< " inline void descend(std::list<T, Alloc> &l)" << std::endl
<< " {" << std::endl
<< " for(typename std::list<T, Alloc>::iterator i = l.begin(); i != l.end(); ++i)" << std::endl
<< " descend(*i);" << std::endl
<< " }" << std::endl;
state = visit_decl;
descend(n.groups);
descend(n.nodes);
state = decl;
out << "};" << std::endl;
}
if(n.has_const_visitor)
{
out << "class " << n.name << "_const_visitor" << std::endl
<< "{" << std::endl
<< "public:" << std::endl
<< " virtual ~" << n.name << "_const_visitor(void) throw() { }" << std::endl
<< " inline void descend(" << n.name << " const &n) { n.apply(*this); }" << std::endl
<< " template<typename T>" << std::endl
<< " inline void descend(boost::intrusive_ptr<T> const &p) { if(p) descend(*p); }" << std::endl;
if(n.ns->uses_lists)
out << " template<typename T, typename Alloc>" << std::endl
<< " inline void descend(std::list<T, Alloc> const &l)" << std::endl
<< " {" << std::endl
<< " for(typename std::list<T, Alloc>::const_iterator i = l.begin(); i != l.end(); ++i)" << std::endl
<< " descend(*i);" << std::endl
<< " }" << std::endl;
state = const_visit_decl;
descend(n.groups);
descend(n.nodes);
state = decl;
out << "};" << std::endl;
}
break;
case visit_decl:
case const_visit_decl:
break;
}
descend(n.groups);
descend(n.nodes);
}
void header_output_visitor::visit(node_node const &n)
{
bool first;
switch(state)
{
case fwddecl:
out << "struct " << n.name << ";" << std::endl
<< "typedef boost::intrusive_ptr<" << n.name << "> " << n.name << "_ptr;" << std::endl
<< "typedef " << n.name << " *" << n.name << "_weak_ptr;" << std::endl;
break;
case decl:
out << "struct " << n.name << " : " << n.group->name << std::endl
<< "{" << std::endl
<< " " << n.name << "(";
first = true;
for(std::list<data_member_node_ptr>::const_iterator i = n.members.begin();
i != n.members.end(); ++i)
{
if((**i).needs_init)
{
if(!first)
out << ", ";
(**i).type->apply(*this);
out << " " << (**i).name;
first = false;
}
}
out << ") throw()";
if(!first)
{
out << " : " << std::endl
<< " ";
first = true;
for(std::list<data_member_node_ptr>::const_iterator i = n.members.begin();
i != n.members.end(); ++i)
{
if((**i).needs_init)
{
if(!first)
out << ", ";
out << (**i).name << "(" << (**i).name << ")";
first = false;
}
}
}
out << " { }" << std::endl;
out << " virtual ~" << n.name << "(void) throw() { }" << std::endl;
for(group_node_weak_ptr i = n.group; i; i = i->parent)
{
if(i->has_visitor)
out << " virtual void apply(" << i->name << "_visitor &);" << std::endl;
if(i->has_const_visitor)
out << " virtual void apply(" << i->name << "_const_visitor &) const;" << std::endl;
}
descend(n.members);
out << "};" << std::endl;
break;
case visit_decl:
out << " virtual void visit(" << n.name << " &) = 0;" << std::endl
<< " inline void descend(" << n.name << " &n) { visit(n); }" << std::endl
<< " inline void descend(boost::intrusive_ptr<" << n.name << "> &p) { if(p) descend(*p); }" << std::endl;
break;
case const_visit_decl:
out << " virtual void visit(" << n.name << " const &) = 0;" << std::endl
<< " inline void descend(" << n.name << " const &n) { visit(n); }" << std::endl
<< " inline void descend(boost::intrusive_ptr<" << n.name << "> const &p) { if(p) descend(*p); }" << std::endl;
}
}
void header_output_visitor::visit(basic_type_node const &n)
{
out << n.name;
if(n.is_const)
out << " const";
if(n.is_volatile)
out << " volatile";
}
void header_output_visitor::visit(reference_type_node const &n)
{
descend(n.type);
out << "&";
}
void header_output_visitor::visit(pointer_type_node const &n)
{
descend(n.type);
out << "*";
if(n.is_const)
out << " const";
if(n.is_volatile)
out << " volatile";
}
void header_output_visitor::visit(template_type_node const &n)
{
out << n.name << "< ";
bool first = true;
for(std::list<type_node_ptr>::const_iterator i = n.template_args.begin();
i != n.template_args.end(); ++i)
{
if(!first)
{
out << ", ";
}
(**i).apply(*this);
first = false;
}
out << "> ";
}
void header_output_visitor::visit(data_member_node const &n)
{
out << " ";
descend(n.type);
out << " " << n.name << ";" << std::endl;
}
void header_output_visitor::visit(list_type_node const &n)
{
out << "std::list<";
descend(n.type);
out << "> ";
}
}
}
|
