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
232
233
|
//
// $Id$
//
// ============================================================================
//
// = LIBRARY
// TAO IDL
//
// = FILENAME
// gen_bounded_str_sequence_ch.cpp
//
// = DESCRIPTION
// Visitor generating code for Sequence in the client header
//
// = AUTHOR
// Michael Kircher
//
// ============================================================================
#include "be.h"
#include "be_visitor_sequence.h"
ACE_RCSID(be_visitor_sequence, gen_bounded_str_sequence_ch, "$Id$")
int
be_visitor_sequence_ch::gen_bounded_str_sequence (be_sequence *node)
{
TAO_OutStream *os = this->ctx_->stream ();
be_type *bt;
// retrieve the base type since we may need to do some code
// generation for the base type.
bt = be_type::narrow_from_decl (node->base_type ());
if (!bt)
{
ACE_ERROR_RETURN ((LM_ERROR,
"(%N:%l) be_visitor_sequence_ch::"
"visit_sequence - "
"Bad element type\n"), -1);
}
// generate the class name
be_type *pt; // base types
if (bt->node_type () == AST_Decl::NT_typedef)
{
// get the primitive base type of this typedef node
be_typedef *t = be_typedef::narrow_from_decl (bt);
pt = t->primitive_base_type ();
}
else
pt = bt;
const char * class_name = node->instance_name ();
// get the visitor for the type of the sequence
be_visitor_context ctx (*this->ctx_);
ctx.state (TAO_CodeGen::TAO_SEQUENCE_BASE_CH);
be_visitor *visitor = tao_cg->make_visitor (&ctx);
os->gen_ifdef_macro (class_name);
os->indent ();
// the accept is here the first time used and if an
// error occurs, it will occur here. Later no check
// for errors will be done.
if (pt->accept (visitor) == -1)
{
ACE_ERROR_RETURN ((LM_ERROR,
"(%N:%l) be_visitor_sequence_ch::"
"visit_sequence - "
"base type visit failed\n"),
-1);
}
*os << "class " << class_name << " : public TAO_Bounded_Base_Sequence" << be_nl
<< "{" << be_nl
<< "public:" << be_idt_nl;
// constructor
*os << class_name << " (void)" << be_nl
<< " : TAO_Bounded_Base_Sequence (" << node->max_size ()
<< ", allocbuf(" << node->max_size () << "))" << be_nl
<< "{" << be_nl
<< "}" << be_nl
<< be_nl;
// constructor
*os << class_name << " (CORBA::ULong length," << be_idt_nl
<< "char* *value," << be_nl
<< "CORBA::Boolean release = 0)" << be_uidt_nl
<< " : TAO_Bounded_Base_Sequence (" << node->max_size () << ", length, value, release)" << be_nl
<< "{" << be_nl
<< " this->_allocate_buffer (" << node->max_size () << ");" << be_nl
<< "}" << be_nl
<< be_nl;
// constructor
*os << class_name << " (const " << class_name << " &rhs)" << be_idt_nl
<< ": TAO_Bounded_Base_Sequence (rhs)" << be_uidt_nl
<< "{" << be_idt_nl
<< "char **tmp1 = allocbuf (this->maximum_);" << be_nl
<< "char ** const tmp2 = ACE_reinterpret_cast (char ** ACE_CAST_CONST, rhs.buffer_);" << be_nl
<< be_nl
<< "for (CORBA::ULong i=0; i < rhs.length_; i++)" << be_idt_nl
<< "tmp1[i] = CORBA::string_dup (tmp2[i]);" << be_uidt_nl
<< be_nl
<< "this->buffer_ = tmp1;" << be_uidt_nl
<< "}" << be_nl
<< be_nl;
// operator=
*os << class_name << " &operator= (const " << class_name << " &rhs)" << be_nl
<< "{" << be_idt_nl
<< "if (this == &rhs)" << be_idt_nl
<< "return *this;" << be_uidt_nl
<< be_nl
<< "if (this->release_)" << be_nl
<< "{ " << be_idt_nl
<< "char **tmp = ACE_reinterpret_cast (char **, this->buffer_);" << be_nl
<< be_nl
<< "for (CORBA::ULong i = 0; i < this->length_; ++i)" << be_nl
<< "{" << be_idt_nl
<< "CORBA::string_free (tmp[i]);" << be_nl
<< "tmp[i] = 0;" << be_uidt_nl
<< "}" << be_uidt_nl
<< "}" << be_nl
<< "else" << be_idt_nl
<< "this->buffer_ = allocbuf (rhs.maximum_);" << be_uidt_nl
<< be_nl
<< "TAO_Bounded_Base_Sequence::operator= (rhs);" << be_nl
<< be_nl
<< "char **tmp1 = ACE_reinterpret_cast (char **, this->buffer_);" << be_nl
<< "char ** const tmp2 = ACE_reinterpret_cast (char ** ACE_CAST_CONST, rhs.buffer_);" << be_nl
<< be_nl
<< "for (CORBA::ULong i = 0; i < rhs.length_; i++)" << be_idt_nl
<< "tmp1[i] = CORBA::string_dup (tmp2[i]);" << be_uidt_nl
<< "return *this;" << be_uidt_nl
<< "}" << be_nl
<< be_nl;
// destructor
*os << "~" << class_name << " (void)" << be_nl
<< "{" << be_idt_nl
<< "this->_deallocate_buffer ();" << be_uidt_nl
<< "}" << be_nl
<< be_nl;
// operator[]
*os << "TAO_String_Manager operator[] (CORBA::ULong index) const" << be_nl
<< "// read-write accessor" << be_nl
<< "{" << be_idt_nl
<< "ACE_ASSERT (index < this->maximum_);" << be_nl
<< "char **const tmp = ACE_reinterpret_cast (char ** ACE_CAST_CONST, this->buffer_);" << be_nl
<< "return TAO_String_Manager (tmp + index, this->release_);" << be_uidt_nl
<< "}" << be_nl
<< be_nl;
// allocbuf
*os << "static char **allocbuf (CORBA::ULong length)" << be_nl
<< "{" << be_idt_nl
<< "char **buf;" << be_nl
<< "ACE_NEW_RETURN (buf, char *[" << node->max_size () << "], 0);" << be_nl
<< "for (CORBA::ULong i = 0; i < " << node->max_size () << "; i++)" << be_idt_nl
<< "buf[i] = 0;" << be_uidt_nl
<< "return buf;" << be_uidt_nl
<< "}" << be_nl
<< be_nl;
// freebuf
*os << "static void freebuf (char **buffer)" << be_nl
<< "{" << be_idt_nl
<< "for (CORBA::ULong i = 0; i < " << node->max_size () << "; ++i)" << be_nl
<< "{" << be_idt_nl
<< "if (buffer[i] != 0)" << be_nl
<< "{" << be_idt_nl
<< "CORBA::string_free (buffer[i]);" << be_nl
<< "buffer[i] = 0;" << be_uidt_nl
<< "}" << be_uidt_nl
<< "}" << be_nl
<< "delete [] buffer;" << be_uidt_nl
<< "}" << be_nl
<< be_nl;
// allocate_buffer
*os << "virtual void _allocate_buffer (CORBA::ULong length)" << be_nl
<< "{" << be_idt_nl
<< "// For this class memory is never reallocated so the implementation" << be_nl
<< "// is *really* simple." << be_nl
<< "this->buffer_ = allocbuf (" << node->max_size () << ");" << be_uidt_nl
<< "}" << be_nl
<< be_nl;
// deallocate_bufffer
*os << "virtual void _deallocate_buffer (void)" << be_nl
<< "{" << be_idt_nl
<< "if (this->buffer_ == 0 || this->release_ == 0)" << be_idt_nl
<< "return;" << be_uidt_nl
<< "char **tmp = ACE_reinterpret_cast (char **, this->buffer_);" << be_nl
<< "freebuf (tmp);" << be_nl
<< "this->buffer_ = 0;" << be_uidt_nl
<< "}" << be_nl
<< be_nl;
// shrink_buffer
*os << "virtual void _shrink_buffer (CORBA::ULong nl,CORBA::ULong ol)" << be_nl
<< "{" << be_idt_nl
<< "char **tmp = ACE_reinterpret_cast (char **,this->buffer_);" << be_nl
<< be_nl
<< "for (CORBA::ULong i = nl; i < ol; ++i)" << be_nl
<< "{" << be_idt_nl
<< "CORBA::string_free (tmp[i]);" << be_nl
<< "tmp[i] = 0;" << be_uidt_nl
<< "}" << be_uidt_nl
<< "}" << be_nl
<< be_uidt_nl
<< "};" << be_nl;
os->gen_endif (); // endif macro
delete visitor;
return 0;
}
|
