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
|
//
// $Id$
//
// ============================================================================
//
// = LIBRARY
// TAO IDL
//
// = FILENAME
// be_visitor_scope.cpp
//
// = DESCRIPTION
// Visitor for the base be_scope node. This serves to maintain the current
// state (context) of code generation for the derived visitor.
//
// = AUTHOR
// Aniruddha Gokhale
//
// ============================================================================
#include "idl.h"
#include "idl_extern.h"
#include "be.h"
#include "be_visitor_scope.h"
ACE_RCSID(be, be_visitor_scope, "$Id$")
// ******************************************************
// Generic visitor for a scope.
// All elements that give rise to a scope inherit from
// this class
// ******************************************************
be_visitor_scope::be_visitor_scope (be_visitor_context *ctx)
: be_visitor_decl (ctx),
elem_number_ (0)
{
}
be_visitor_scope::~be_visitor_scope (void)
{
}
// visit the scope and its elements
int
be_visitor_scope::visit_scope (be_scope *node)
{
// proceed if the number of members in our scope is greater than 0
if (node->nmembers () > 0)
{
// initialize an iterator to iterate thru our scope
UTL_ScopeActiveIterator *si;
ACE_NEW_RETURN (si,
UTL_ScopeActiveIterator (node,
UTL_Scope::IK_decls),
-1);
this->elem_number_ = 0;
// continue until each element is visited
while (!si->is_done ())
{
AST_Decl *d = si->item ();
if (!d)
{
delete si;
ACE_ERROR_RETURN ((LM_ERROR,
"(%N:%l) be_visitor_scope::visit_scope - "
"bad node in this scope\n"), -1);
}
be_decl *bd = be_decl::narrow_from_decl (d);
// set the scope node as "node" in which the code is being generated
// so that elements in the node's scope can use it for code generation
this->ctx_->scope (node->decl ());
// set the node to be visited
this->ctx_->node (bd);
this->elem_number_++;
// do any pre processing using the next item info
if (this->pre_process (bd) == -1)
{
delete si;
ACE_ERROR_RETURN ((LM_ERROR,
"(%N:%l) be_visitor_scope::visit_scope - "
"pre processing failed\n"), -1);
}
if (bd == 0 || bd->accept (this) == -1)
{
delete si;
ACE_ERROR_RETURN ((LM_ERROR,
"(%N:%l) be_visitor_scope::visit_scope - "
"codegen for scope failed\n"), -1);
}
if (this->post_process (bd) == -1)
{
delete si;
ACE_ERROR_RETURN ((LM_ERROR,
"(%N:%l) be_visitor_scope::visit_scope - "
"post processing failed\n"), -1);
}
si->next ();
} // end of while loop
delete si;
} // end of if
#if 0
// For debugging the prefix...
be_decl* decl = node->decl ();
ACE_DEBUG ((LM_DEBUG, "Enter scope <%s> : [%s]\n",
decl->fullname (), decl->prefix ()));
if (decl->pragmas () != 0)
{
for (UTL_StrlistActiveIterator i(decl->pragmas ());
!i.is_done ();
i.next ())
{
String* s = i.item ();
ACE_DEBUG ((LM_DEBUG, " pragma = <%s>\n", s->get_string ()));
}
}
#endif
return 0;
}
int
be_visitor_scope::post_process (be_decl *)
{
return 0;
}
int
be_visitor_scope::pre_process (be_decl *)
{
return 0;
}
int
be_visitor_scope::elem_number (void)
{
// return the current element that we are working on
return this->elem_number_;
}
// find the element that succeeds "elem" in the list
int
be_visitor_scope::next_elem (be_decl *elem,
be_decl *&successor)
{
be_scope *node = 0;
if (!this->ctx_->scope () ||
!(node = this->ctx_->scope ()->scope ()))
{
ACE_ERROR_RETURN ((LM_ERROR,
"(%N:%l) be_visitor_scope::next_elem - "
"bad scope\n"), -1);
}
successor = 0;
// proceed if the number of members in our scope is greater than 0
if (node->nmembers () > 0)
{
// initialize an iterator to iterate thru our scope
UTL_ScopeActiveIterator *si;
ACE_NEW_RETURN (si,
UTL_ScopeActiveIterator (node,
UTL_Scope::IK_decls),
-1);
// continue until each element is visited
while (!si->is_done ())
{
be_decl *bd = be_decl::narrow_from_decl (si->item ());
if (!bd)
{
delete si;
ACE_ERROR_RETURN ((LM_ERROR,
"(%N:%l) be_visitor_scope::next_elem - "
"bad node in this scope\n"), -1);
}
if (bd == elem)
{
// find who is next to me
si->next ();
if (si->is_done ())
{
// nobody left in the list
delete si;
return 0;
}
successor = be_decl::narrow_from_decl (si->item ());
if (!successor)
{
delete si;
ACE_ERROR_RETURN ((LM_ERROR,
"(%N:%l) be_visitor_scope::next_elem - "
"bad node in this scope\n"), -1);
}
// nothing else to do
delete si;
return 0;
}
else
// proceed to the next element
si->next ();
} // end of while loop
delete si;
} // end of if
return 0;
}
idl_bool
be_visitor_scope::last_node (be_decl *bd)
{
be_decl *next = 0;
(void) this->next_elem (bd, next);
if (next)
// not the last
return 0;
// I am the last one
return 1;
}
|
