summaryrefslogtreecommitdiff
path: root/TAO/TAO_IDL/be_include/be_type.h
diff options
context:
space:
mode:
Diffstat (limited to 'TAO/TAO_IDL/be_include/be_type.h')
-rw-r--r--TAO/TAO_IDL/be_include/be_type.h13
1 files changed, 7 insertions, 6 deletions
diff --git a/TAO/TAO_IDL/be_include/be_type.h b/TAO/TAO_IDL/be_include/be_type.h
index b6dbeedf362..13d1d215217 100644
--- a/TAO/TAO_IDL/be_include/be_type.h
+++ b/TAO/TAO_IDL/be_include/be_type.h
@@ -53,10 +53,16 @@ public:
virtual int gen_out_impl (void);
// generate the _out implementation
+ virtual int gen_typecode (void) = 0;
+ // generate the typecode description
+
+ virtual long tc_size (void) = 0;
+ // return typecode size
+
UTL_ScopedName *tc_name (void);
// return the typecode name
- virtual const char *nested_type_name (be_decl *d,
+ virtual const char *nested_type_name (be_decl *d,
const char *suffix = 0,
const char *prefix = 0);
// type name of a node used when generating declarations
@@ -67,11 +73,6 @@ public:
// recursive simply using "base_type->node_type()" will not work, so
// the most "unaliased" type is needed.
- virtual idl_bool in_recursion (be_type *node = 0);
- // determine if we are involved in some kind of limited recursion. Most types
- // cannot be involved except structs and unions.
- // If the parameter is 0, we are trying to determine this for ourselves.
-
// Visiting
virtual int accept (be_visitor* visitor);