ChangeLogTag: Mon Oct 2 14:59:44 2000 Jeff Parsons <parsons@cs.wustl.edu>

1 files changed, 2 insertions, 65 deletions

diff --git a/TAO/TAO_IDL/be/be_exception.cpp b/TAO/TAO_IDL/be/be_exception.cpp
index 5d35ad7320f..5581a1c2fc6 100644
--- a/TAO/TAO_IDL/be/be_exception.cpp
+++ b/TAO/TAO_IDL/be/be_exception.cpp
@@ -47,71 +47,8 @@ be_exception::be_exception (UTL_ScopedName *n,
     COMMON_Base (local, 
                  abstract)
 {
-  this->size_type (be_decl::VARIABLE); // Always the case.
-}
-
-// Are we or the parameter node involved in any recursion
-idl_bool
-be_exception::in_recursion (be_type *node)
-{
-  if (node == 0)
-    {
-      // We are determining the recursive status for ourselves.
-      node = this;
-    }
-
-  // Proceed if the number of members in our scope is greater than 0.
-  if (this->nmembers () > 0)
-    {
-      // Initialize an iterator to iterate thru our scope.
-      UTL_ScopeActiveIterator *si = 0;
-      ACE_NEW_RETURN (si,
-                      UTL_ScopeActiveIterator (this,
-                                               UTL_Scope::IK_decls),
-                      -1);
-      // Continue until each element is visited.
-      while (!si->is_done ())
-        {
-          be_field *field = be_field::narrow_from_decl (si->item ());
-
-          if (field == 0)
-            {
-              delete si;
-
-              ACE_ERROR_RETURN ((LM_ERROR,
-                                 ACE_TEXT ("(%N:%l) be_exception::")
-                                 ACE_TEXT ("in_recursion - ")
-                                 ACE_TEXT ("bad field node\n")),
-                                0);
-            }
-
-          be_type *type = be_type::narrow_from_decl (field->field_type ());
-
-          if (type == 0)
-            {
-              delete si;
-
-              ACE_ERROR_RETURN ((LM_ERROR,
-                                 ACE_TEXT ("(%N:%l) be_exception::")
-                                 ACE_TEXT ("in_recursion - ")
-                                 ACE_TEXT ("bad field type\n")),
-                                0);
-            }
-
-          if (type->in_recursion (node))
-            {
-              delete si;
-              return 1;
-            }
-
-          si->next ();
-        } 
-
-      delete si;
-    } 
-
-  // Not in recursion
-  return 0;
+  // Always the case.
+  this->size_type (be_decl::VARIABLE);
 }
 
 void