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
|
// $Id$
// ============================================================================
//
// = LIBRARY
// TAO IDL
//
// = FILENAME
// be_typedef.cpp
//
// = DESCRIPTION
// Extension of class AST_Typedef that provides additional means for C++
// mapping.
//
// = AUTHOR
// Copyright 1994-1995 by Sun Microsystems, Inc.
// and
// Aniruddha Gokhale
//
// ============================================================================
#include "be_typedef.h"
#include "be_visitor.h"
#include "ace/Log_Msg.h"
ACE_RCSID (be,
be_typedef,
"$Id$")
be_typedef::be_typedef (void)
: COMMON_Base (),
AST_Decl (),
AST_Type (),
AST_Typedef (),
be_decl (),
be_type ()
{
}
be_typedef::be_typedef (AST_Type *bt,
UTL_ScopedName *n,
bool local,
bool abstract)
: COMMON_Base (bt->is_local () || local,
abstract),
AST_Decl (AST_Decl::NT_typedef,
n),
AST_Type (AST_Decl::NT_typedef,
n),
AST_Typedef (bt,
n,
bt->is_local () || local,
abstract),
be_decl (AST_Decl::NT_typedef,
n),
be_type (AST_Decl::NT_typedef,
n)
{
AST_Type *pbt = this->primitive_base_type ();
AST_Decl::NodeType nt = pbt->node_type ();
if (nt == AST_Decl::NT_sequence)
{
pbt->anonymous (false);
}
}
void
be_typedef::seen_in_sequence (bool val)
{
this->be_type::seen_in_sequence (val);
this->primitive_base_type ()->seen_in_sequence (val);
}
// Some compilers seems to have a problem with a function
// that's both virtual and overloaded.
bool
be_typedef::seen_in_operation (void) const
{
return this->be_type::seen_in_operation ();
}
void
be_typedef::seen_in_operation (bool val)
{
this->be_type::seen_in_operation (val);
}
// Given a typedef node, traverse the chain of base types until they are no
// more typedefs, and return that most primitive base type.
be_type *
be_typedef::primitive_base_type (void)
{
be_type *d = this;
be_typedef *temp = 0;
while (d && d->node_type () == AST_Decl::NT_typedef)
{
temp = be_typedef::narrow_from_decl (d);
d = be_type::narrow_from_decl (temp->base_type ());
}
return d;
}
AST_Decl::NodeType
be_typedef::base_node_type (void) const
{
be_typedef *td = const_cast<be_typedef *> (this);
be_type *base = be_type::narrow_from_decl (td->base_type ());
return base->base_node_type ();
}
void
be_typedef::destroy (void)
{
this->AST_Typedef::destroy ();
this->be_type::destroy ();
}
int
be_typedef::accept (be_visitor *visitor)
{
return visitor->visit_typedef (this);
}
// Narrowing.
IMPL_NARROW_METHODS2 (be_typedef, AST_Typedef, be_type)
IMPL_NARROW_FROM_DECL (be_typedef)
|
