discriminant_cs.cpp
来自「这是广泛使用的通信开源项目,对于大容量,高并发的通讯要求完全能够胜任,他广泛可用」· C++ 代码 · 共 79 行
CPP
79 行
//
// discriminant_cs.cpp,v 1.5 2003/03/12 16:50:34 parsons Exp
//
// ============================================================================
//
// = LIBRARY
// TAO IDL
//
// = FILENAME
// discriminant_cs.cpp
//
// = DESCRIPTION
// Visitor generating code for discriminant of the union
//
// = AUTHOR
// Aniruddha Gokhale
//
// ============================================================================
ACE_RCSID (be_visitor_union,
discriminant_cs,
"discriminant_cs.cpp,v 1.5 2003/03/12 16:50:34 parsons Exp")
// *************************************************************************
// Visitor for discriminant in client stubs.
// *************************************************************************
be_visitor_union_discriminant_cs::be_visitor_union_discriminant_cs (
be_visitor_context *ctx
)
: be_visitor_decl (ctx)
{
}
be_visitor_union_discriminant_cs::~be_visitor_union_discriminant_cs (void)
{
}
int
be_visitor_union_discriminant_cs::visit_enum (be_enum *node)
{
be_union *bu =
this->ctx_->be_node_as_union (); // get the enclosing union backend
be_type *bt;
if (this->ctx_->alias ())
{
bt = this->ctx_->alias ();
}
else
{
bt = node;
}
if (bt->node_type () != AST_Decl::NT_typedef
&& bt->is_child (bu))
{
// Instantiate a visitor context with a copy of our context. This info
// will be modified based on what type of node we are visiting.
be_visitor_context ctx (*this->ctx_);
ctx.node (node);
// generate the typecode for the enum
be_visitor_enum_cs visitor (&ctx);
if (node->accept (&visitor) == -1)
{
ACE_ERROR_RETURN ((LM_ERROR,
"(%N:%l) be_visitor_union_discriminant_cs::"
"visit_enum - "
"codegen failed\n"),
-1);
}
}
return 0;
}
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?