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
|
//
// $Id$
//
// ============================================================================
//
// = LIBRARY
// TAO IDL
//
// = FILENAME
// gen_bounded_str_sequence_cs.cpp
//
// = DESCRIPTION
// Visitor generating code for Sequence in the client impl
//
// = AUTHOR
// Michael Kircher
//
// Modifications by Aniruddha Gokhale
//
// ============================================================================
#include "be.h"
#include "be_visitor_sequence.h"
ACE_RCSID(be_visitor_sequence, gen_bounded_str_sequence_cs, "$Id$")
int
be_visitor_sequence_cs::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_cs::"
"visit_sequence - "
"Bad element type\n"), -1);
}
const char * class_name = node->instance_name ();
static char full_class_name [NAMEBUFSIZE];
ACE_OS::memset (full_class_name, '\0', NAMEBUFSIZE);
if (node->is_nested ())
{
ACE_OS::sprintf (full_class_name, "%s::%s",
be_scope::narrow_from_scope (node->defined_in ())->decl ()->full_name (),
class_name);
}
else
{
ACE_OS::sprintf (full_class_name, "%s",
class_name);
}
// get the visitor for the type of the sequence
be_visitor_context ctx (*this->ctx_);
ctx.state (TAO_CodeGen::TAO_SEQUENCE_BASE_CS);
be_visitor *visitor = tao_cg->make_visitor (&ctx);
// !! branching in either compile time template instantiation
// or manual template instatiation
os->gen_ifdef_AHETI();
os->gen_ifdef_macro (class_name);
os->indent ();
// allocate_buffer
*os << "void" << be_nl
<< full_class_name << "::_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_ = " << full_class_name << "::allocbuf ("
<< node->max_size () << ");" << be_uidt_nl
<< "}" << be_nl
<< be_nl;
// deallocate_buffer
*os << "void" << be_nl
<< full_class_name << "::_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
<< full_class_name << "::freebuf (tmp);" << be_nl
<< "this->buffer_ = 0;" << be_uidt_nl
<< "}" << be_nl
<< be_nl;
// destructor
*os << full_class_name << "::~" << class_name << " (void)" << be_nl
<< "{" << be_idt_nl
<< "this->_deallocate_buffer ();" << be_uidt_nl
<< "}" << be_nl
<< be_nl;
// shrink_buffer
*os << "void" << be_nl
<< full_class_name << "::_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;
os->gen_endif (); // endif macro
// generate #endif for AHETI
os->gen_endif_AHETI();
delete visitor;
return 0;
}
|
