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
|
// $Id$
// ============================================================================
//
// = LIBRARY
// TAO IDL
//
// = FILENAME
// be_exception.cpp
//
// = DESCRIPTION
// Extension of class AST_Exception that provides additional means for C++
// mapping of an interface.
//
// = 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_exception, "$Id$")
be_exception::be_exception (void)
{
this->size_type (be_decl::VARIABLE); // always the case
}
be_exception::be_exception (UTL_ScopedName *n,
UTL_StrList *p,
idl_bool local,
idl_bool abstract)
: AST_Decl (AST_Decl::NT_except,
n,
p),
AST_Structure (AST_Decl::NT_except,
n,
p,
local,
abstract),
UTL_Scope (AST_Decl::NT_except),
COMMON_Base (local,
abstract)
{
this->size_type (be_decl::VARIABLE); // Always the case.
}
// Are we or the parameter node involved in any recursion
idl_bool
be_exception::in_recursion (be_type *node)
{
if (node == 0)
{
// We are determining the recursive status for ourselves.
node = this;
}
// Proceed if the number of members in our scope is greater than 0.
if (this->nmembers () > 0)
{
// Initialize an iterator to iterate thru our scope.
UTL_ScopeActiveIterator *si = 0;
ACE_NEW_RETURN (si,
UTL_ScopeActiveIterator (this,
UTL_Scope::IK_decls),
-1);
// Continue until each element is visited.
while (!si->is_done ())
{
be_field *field = be_field::narrow_from_decl (si->item ());
if (field == 0)
{
delete si;
ACE_ERROR_RETURN ((LM_ERROR,
ACE_TEXT ("(%N:%l) be_exception::")
ACE_TEXT ("in_recursion - ")
ACE_TEXT ("bad field node\n")),
0);
}
be_type *type = be_type::narrow_from_decl (field->field_type ());
if (type == 0)
{
delete si;
ACE_ERROR_RETURN ((LM_ERROR,
ACE_TEXT ("(%N:%l) be_exception::")
ACE_TEXT ("in_recursion - ")
ACE_TEXT ("bad field type\n")),
0);
}
if (type->in_recursion (node))
{
delete si;
return 1;
}
si->next ();
}
delete si;
}
// Not in recursion
return 0;
}
void
be_exception::destroy (void)
{
// Call the destroy methods of our base classes.
be_scope::destroy ();
be_type::destroy ();
}
int
be_exception::accept (be_visitor *visitor)
{
return visitor->visit_exception (this);
}
// Narrowing
IMPL_NARROW_METHODS3 (be_exception, AST_Exception, be_scope, be_type)
IMPL_NARROW_FROM_DECL (be_exception)
IMPL_NARROW_FROM_SCOPE (be_exception)
|
