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
|
// $Id$
// ============================================================================
//
// = LIBRARY
// TAO IDL
//
// = FILENAME
// be_operation.cpp
//
// = DESCRIPTION
// Extension of class AST_Operation that provides additional means for C++
// mapping.
//
// = AUTHOR
// Copyright 1994-1995 by Sun Microsystems, Inc.
// and
// Aniruddha Gokhale
//
// ============================================================================
#include "idl.h"
#include "idl_extern.h"
#include "be.h"
ACE_RCSID(be, be_operation, "$Id$")
/*
* BE_Operation
*/
be_operation::be_operation (void)
: argument_count_ (-1),
has_native_ (0)
{
}
be_operation::be_operation (AST_Type *rt, AST_Operation::Flags fl,
UTL_ScopedName *n, UTL_StrList *p)
: AST_Operation (rt, fl, n, p),
AST_Decl (AST_Decl::NT_op, n, p),
UTL_Scope (AST_Decl::NT_op),
argument_count_ (-1),
has_native_ (0)
{
}
// compute total number of members
int
be_operation::compute_argument_attr (void)
{
if (this->argument_count_ != -1)
return 0;
this->argument_count_ = 0;
// if there are elements in this scope
if (this->nmembers () > 0)
{
// instantiate a scope iterator.
UTL_ScopeActiveIterator *si =
new UTL_ScopeActiveIterator (this, UTL_Scope::IK_decls);
while (!(si->is_done ()))
{
// get the next AST decl node
AST_Decl *d = si->item ();
if (d->node_type () == AST_Decl::NT_argument)
{
this->argument_count_++;
be_argument *arg = be_argument::narrow_from_decl (d);
be_type* type =
be_type::narrow_from_decl (arg->field_type ());
if (type->base_node_type () == AST_Decl::NT_native)
this->has_native_ = 1;
}
si->next ();
} // end of while
delete si; // free the iterator object
}
be_type* type = be_type::narrow_from_decl (this->return_type ());
if (type->base_node_type () == AST_Decl::NT_native)
this->has_native_ = 1;
return 0;
}
// return the member count
int
be_operation::argument_count (void)
{
this->compute_argument_attr ();
return this->argument_count_;
}
// return if any argument or the return type is a <native> type.
int
be_operation::has_native (void)
{
this->compute_argument_attr ();
return this->has_native_;
}
be_argument *
be_operation::add_argument_to_scope (be_argument *arg)
{
this->add_to_scope (arg);
this->add_to_referenced (arg, 0);
return arg;
}
// compute the size type of the node in question
int
be_operation::compute_size_type (void)
{
UTL_ScopeActiveIterator *si;
AST_Decl *d;
be_decl *bd;
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 ();
bd = be_decl::narrow_from_decl (d);
if (bd != 0)
{
// our sizetype depends on the sizetype of our members. Although
// previous value of sizetype may get overwritten, we are
// guaranteed by the "size_type" call that once the value reached
// be_decl::VARIABLE, nothing else can overwrite it.
this->size_type (bd->size_type ());
}
else
{
ACE_DEBUG ((LM_DEBUG,
"WARNING (%N:%l) be_operation::compute_size_type - "
"narrow_from_decl returned 0\n"));
}
si->next ();
} // end of while
delete si; // free the iterator object
}
return 0;
}
int
be_operation::accept (be_visitor *visitor)
{
return visitor->visit_operation (this);
}
// Narrowing
IMPL_NARROW_METHODS3 (be_operation, AST_Operation, be_scope, be_decl)
IMPL_NARROW_FROM_DECL (be_operation)
IMPL_NARROW_FROM_SCOPE (be_operation)
|
