diff options
Diffstat (limited to 'TAO/TAO_IDL/be/be_visitor_typecode/struct_typecode.cpp')
| -rw-r--r-- | TAO/TAO_IDL/be/be_visitor_typecode/struct_typecode.cpp | 244 |
1 files changed, 244 insertions, 0 deletions
diff --git a/TAO/TAO_IDL/be/be_visitor_typecode/struct_typecode.cpp b/TAO/TAO_IDL/be/be_visitor_typecode/struct_typecode.cpp new file mode 100644 index 00000000000..5e3445f3f77 --- /dev/null +++ b/TAO/TAO_IDL/be/be_visitor_typecode/struct_typecode.cpp @@ -0,0 +1,244 @@ +// -*- C++ -*- + +//============================================================================= +/** + * @file struct_typecode.cpp + * + * $Id$ + * + * Structure TypeCode generation visitor. + * + * @author Ossama Othman <ossama@dre.vanderbilt.edu> + */ +//============================================================================= + + +#include <string> + + +TAO::be_visitor_struct_typecode::be_visitor_struct_typecode ( + be_visitor_context * ctx) + : be_visitor_typecode_defn (ctx) + , is_recursive_ (false) + , is_nested_ (false) +{ +} + +int +TAO::be_visitor_struct_typecode::visit_structure (be_structure * node) +{ + if (!node->is_defined ()) + { + return this->gen_forward_declared_typecode (node); + } + + // Check if we are repeated. + be_visitor_typecode_defn::QNode const * const qnode = + this->queue_lookup (this->tc_queue_, node); + + ACE_Unbounded_Queue<AST_Type *> recursion_queue; + + if (qnode + && node->in_recursion (recursion_queue)) + { + this->is_recursive_ = true; + return 0; + } + else if (this->queue_insert (this->tc_queue_, node, 0) == 0) + { + ACE_ERROR_RETURN ((LM_ERROR, + "(%N:%l) be_visitor_struct_typecode::" + "visit_type - " + "queue insert failed\n"), + -1); + } + + if (this->recursion_detect_ || this->is_nested_) + { + return 0; + } + + static bool const is_exception = false; + return this->visit (node, is_exception); +} + +int +TAO::be_visitor_struct_typecode::visit_exception (be_exception * node) +{ + if (this->recursion_detect_) + { + return 0; + } + + // No need to check for recursion since exceptions are never + // recursive. + + static bool const is_exception = true; + return this->visit (node, is_exception); +} + +int +TAO::be_visitor_struct_typecode::visit (AST_Structure * node, + bool is_exception) +{ + this->is_nested_ = true; + TAO_OutStream & os = *this->ctx_->stream (); + + os << be_nl << be_nl + << "// TAO_IDL - Generated from" << be_nl + << "// " << __FILE__ << ":" << __LINE__ << be_nl << be_nl; + + if (this->gen_member_typecodes (node) != 0) + { + ACE_ERROR_RETURN ((LM_ERROR, + "TAO::be_visitor_struct_typecode::visit_structure -" + " Unable to generate structure/exception field " + "TypeCodes.\n"), + -1); + } + + static ACE_CString const tao_fields ("_tao_fields_"); + ACE_CString const fields_name (tao_fields + + node->flat_name ()); + + // Generate array containing struct field characteristics. + os << "static TAO::TypeCode::Struct_Field<" << be_idt_nl + << "char const *," << be_nl + << "::CORBA::TypeCode_ptr const *> const "; + + if (node->nfields () == 0) + { + // Should only be possible for user exceptions with no fields. + os << "* const " << be_idt_nl + << fields_name.c_str () << " = 0;" << be_uidt_nl << be_uidt_nl; + } + else + { + os << be_idt_nl + << fields_name.c_str () << "[] =" << be_idt_nl + << "{" << be_idt_nl; + + if (this->visit_members (node) != 0) + { + return -1; + } + + os << be_uidt_nl + << "};" << be_uidt << be_uidt_nl << be_uidt_nl; + } + + static char const StringType[] = "char const *"; + static char const TypeCodeType[] = "::CORBA::TypeCode_ptr const *"; + static char const MemberArrayType[] = "TAO::TypeCode::Struct_Field"; + + // Generate the TypeCode instantiation. + os << "static "; + + if (this->is_recursive_) + { + os << "TAO::TypeCode::Recursive_Type<" << be_idt_nl; + } + + // -- TypeCodeBase -- + os << "TAO::TypeCode::Struct<" << be_idt_nl + << StringType << "," << be_nl + << TypeCodeType << "," << be_nl + << MemberArrayType << "<" << be_idt_nl + << StringType << "," << be_nl + << TypeCodeType << "> const *," << be_uidt_nl + << "TAO::Null_RefCount_Policy>"; + + if (this->is_recursive_) + { + os << "," << be_uidt_nl + << TypeCodeType << "," << be_nl + << MemberArrayType << "<" << be_idt_nl + << StringType << "," << be_nl + << TypeCodeType << "> const *>" << be_uidt; + } + + os << be_uidt_nl + << "_tao_tc_" << node->flat_name () << " (" << be_idt_nl + << "::CORBA::tk_" << (is_exception ? "except" : "struct") << "," + << be_nl + << "\"" << node->repoID () << "\"," << be_nl + << "\"" << node->original_local_name () << "\"," << be_nl + << "_tao_fields_" << node->flat_name () << "," << be_nl + << node->nfields () << ");" + << be_uidt_nl << be_nl; + + if (this->gen_typecode_ptr (be_type::narrow_from_decl (node)) != 0) + { + return -1; + } + + return 0; +} + +int +TAO::be_visitor_struct_typecode::gen_member_typecodes (AST_Structure * node) +{ + AST_Field ** member_ptr = 0; + size_t const count = node->nfields (); + + for (size_t i = 0; i < count; ++i) + { + node->field (member_ptr, i); + + be_type * const member_type = + be_type::narrow_from_decl ((*member_ptr)->field_type ()); + + if (this->is_typecode_generation_required (member_type) + && member_type->accept (this) != 0) + { + return -1; + } + + be_structure *bs = be_structure::narrow_from_decl (node); + if (bs) + { + be_visitor_typecode_defn::QNode const * const qnode = + this->queue_lookup (this->tc_queue_, bs); + + ACE_Unbounded_Queue<AST_Type *> recursion_queue; + if (qnode + && member_type->in_recursion (recursion_queue)) + { + this->is_recursive_ = true; + } + } + } + + return 0; +} + +int +TAO::be_visitor_struct_typecode::visit_members (AST_Structure * node) +{ + AST_Field ** member_ptr = 0; + size_t const count = node->nfields (); + TAO_OutStream & os = *this->ctx_->stream (); + + for (size_t i = 0; i < count; ++i) + { + node->field (member_ptr, i); + + be_decl * const member_decl = + be_decl::narrow_from_decl (*member_ptr); + + be_type * const member_type = + be_type::narrow_from_decl ((*member_ptr)->field_type ()); + + os << "{ " + << "\"" << member_decl->original_local_name () << "\", " + << "&" << member_type->tc_name () + << " }"; + + if (i < count - 1) + { + os << "," << be_nl; + } + } + + return 0; +} |