blob: 24d3eb1daf4e1e7c4e1b61ce67ca741eb6918159 (
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
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
|
//
// $Id$
//
#include "idl.h"
#include "idl_extern.h"
#include "be.h"
ACE_RCSID(be, be_scope, "$Id$")
// Default Constructor
be_scope::be_scope (void)
: comma_ (0)
{
}
// Constructor
be_scope::be_scope (AST_Decl::NodeType type)
: UTL_Scope (type),
comma_ (0)
{
}
be_scope::~be_scope (void)
{
}
// Code generation methods
void
be_scope::comma (unsigned short comma)
{
this->comma_ = comma;
}
int
be_scope::comma (void) const
{
return this->comma_;
}
int
be_scope::gen_encapsulation (void)
{
UTL_ScopeActiveIterator *si;
AST_Decl *d;
be_decl *bd;
// if there are elements in this scope
if (this->nmembers () > 0)
{
// instantiate a scope iterator.
si = new UTL_ScopeActiveIterator (this, UTL_Scope::IK_decls);
while (!(si->is_done ()))
{
// get the next AST decl node
d = si->item ();
bd = be_decl::narrow_from_decl (d);
if (bd->gen_encapsulation () == -1)
{
// failure
return -1;
}
si->next ();
} // end of while
delete si; // free the iterator object
}
return 0;
}
long
be_scope::tc_encap_len (void)
{
UTL_ScopeActiveIterator *si;
AST_Decl *d;
be_decl *bd;
long encap_len = 0;
if (this->nmembers () > 0)
{
// if there are elements in this scope
si = new UTL_ScopeActiveIterator (this, UTL_Scope::IK_decls);
// instantiate a scope iterator.
while (!(si->is_done ()))
{
// get the next AST decl node
d = si->item ();
// NOTE: Our assumptin here is that whatever scope we are in, the
// node type that shows up here *MUST* be valid according to the
// IDL grammar. We do not check for this since the front end must
// have taken care of weeding out such errors
bd = be_decl::narrow_from_decl (d);
if (bd != 0)
{
encap_len += bd->tc_encap_len ();
}
else
{
ACE_DEBUG ((LM_DEBUG,
"WARNING (%N:%l): be_scope::tc_encap_len - "
"narrow_from_decl returned 0\n"));
}
si->next ();
} // end of while
delete si; // free the iterator object
}
return encap_len;
}
// return the scope created by this node (if one exists, else NULL)
be_decl *
be_scope::decl (void)
{
switch (this->scope_node_type())
{
case AST_Decl::NT_interface:
return be_interface::narrow_from_scope (this);
case AST_Decl::NT_module:
return be_module::narrow_from_scope (this);
case AST_Decl::NT_root:
return be_root::narrow_from_scope (this);
case AST_Decl::NT_except:
return be_exception::narrow_from_scope (this);
case AST_Decl::NT_union:
return be_union::narrow_from_scope (this);
case AST_Decl::NT_struct:
return be_structure::narrow_from_scope (this);
case AST_Decl::NT_enum:
return be_enum::narrow_from_scope (this);
case AST_Decl::NT_op:
return be_operation::narrow_from_scope (this);
default:
return (be_decl *)0;
}
}
int
be_scope::accept (be_visitor *visitor)
{
return visitor->visit_scope (this);
}
// narrowing methods
IMPL_NARROW_METHODS1 (be_scope, UTL_Scope)
IMPL_NARROW_FROM_SCOPE (be_scope)
|
