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
|
/* Copyright 2009 Simon Richter <Simon.Richter@hogyros.de>
*
* Released under the GNU General Public Licence version 3.
*/
#include "smartpointer_visitor.hpp"
namespace foundry {
namespace tree {
void smartpointer_visitor::visit(root &r)
{
ast_root = &r;
descend(r.global_namespace);
}
void smartpointer_visitor::visit(include_node &)
{
return;
}
void smartpointer_visitor::visit(namespace_node &n)
{
descend(n.namespaces);
descend(n.group);
}
void smartpointer_visitor::visit(group_node &n)
{
descend(n.groups);
descend(n.default_members);
descend(n.nodes);
}
void smartpointer_visitor::visit(node_node &n)
{
descend(n.members);
}
void smartpointer_visitor::visit(data_member_node &n)
{
descend(n.type);
if(is_node_type)
{
template_type_node_ptr nn = new template_type_node;
nn->name = "boost::intrusive_ptr";
nn->template_args.push_back(n.type);
n.type = nn;
include_node_ptr ni = new include_node;
ni->name = "boost/intrusive_ptr.hpp";
ni->is_local = false;
ast_root->includes.push_back(ni);
}
}
void smartpointer_visitor::visit(basic_type_node &n)
{
is_node_type = n.is_node;
if(is_node_type)
{
std::string ns;
for(namespace_node_weak_ptr i = n.ns; i; i = i->parent)
ns = i->name + "::" + ns;
n.name = ns + n.name;
}
}
void smartpointer_visitor::visit(reference_type_node &)
{
is_node_type = false;
}
void smartpointer_visitor::visit(pointer_type_node &)
{
is_node_type = false;
}
void smartpointer_visitor::visit(template_type_node &)
{
is_node_type = false;
}
void smartpointer_visitor::visit(list_type_node &n)
{
descend(n.type);
if(is_node_type)
{
template_type_node_ptr nn = new template_type_node;
nn->name = "boost::intrusive_ptr";
nn->template_args.push_back(n.type);
n.type = nn;
}
is_node_type = false;
}
}
}
|
