diff options
Diffstat (limited to 'TAO/TAO_IDL/be/be_visitor_scope.cpp')
| -rw-r--r-- | TAO/TAO_IDL/be/be_visitor_scope.cpp | 244 |
1 files changed, 244 insertions, 0 deletions
diff --git a/TAO/TAO_IDL/be/be_visitor_scope.cpp b/TAO/TAO_IDL/be/be_visitor_scope.cpp new file mode 100644 index 00000000000..52504b81847 --- /dev/null +++ b/TAO/TAO_IDL/be/be_visitor_scope.cpp @@ -0,0 +1,244 @@ +// +// $Id$ +// + +// ============================================================================ +// +// = LIBRARY +// TAO IDL +// +// = FILENAME +// be_visitor_scope.cpp +// +// = DESCRIPTION +// Visitor for the base be_scope node. This serves to maintain the current +// state (context) of code generation for the derived visitor. +// +// = AUTHOR +// Aniruddha Gokhale +// +// ============================================================================ + +#include "be_argument.h" +#include "be_scope.h" +#include "be_visitor_scope.h" +#include "be_visitor_context.h" +#include "ace/Log_Msg.h" + +ACE_RCSID (be, + be_visitor_scope, + "$Id$") + +// ****************************************************** +// Generic visitor for a scope. +// All elements that give rise to a scope inherit from +// this class. +// ****************************************************** + +be_visitor_scope::be_visitor_scope (be_visitor_context *ctx) + : be_visitor_decl (ctx), + elem_number_ (0) +{ +} + +be_visitor_scope::~be_visitor_scope (void) +{ +} + +// Visit the scope and its elements. +int +be_visitor_scope::visit_scope (be_scope *node) +{ + // Proceed if the number of members in our scope is greater than 0. + this->elem_number_ = 0; + + for (UTL_ScopeActiveIterator si (node, UTL_Scope::IK_decls); + !si.is_done (); + si.next ()) + { + AST_Decl *d = si.item (); + + if (d == 0) + { + ACE_ERROR_RETURN ((LM_ERROR, + "(%N:%l) be_visitor_scope::visit_scope - " + "bad node in this scope\n"), + -1); + } + + be_decl *bd = be_decl::narrow_from_decl (d); + + // Set the scope node as "node" in which the code is being + // generated so that elements in the node's scope can use it + // for code generation. + this->ctx_->scope (node->decl ()); + + // Set the node to be visited. + this->ctx_->node (bd); + this->elem_number_++; + + // Do any pre processing using the next item info. + if (this->pre_process (bd) == -1) + { + ACE_ERROR_RETURN ((LM_ERROR, + "(%N:%l) be_visitor_scope::visit_scope - " + "pre processing failed\n"), + -1); + } + + // Send the visitor. + if (bd == 0 || bd->accept (this) == -1) + { + ACE_ERROR_RETURN ((LM_ERROR, + "(%N:%l) be_visitor_scope::visit_scope - " + "codegen for scope failed\n"), + -1); + } + + // Do any post processing using this item info. + if (this->post_process (bd) == -1) + { + ACE_ERROR_RETURN ((LM_ERROR, + "(%N:%l) be_visitor_scope::visit_scope - " + "post processing failed\n"), + -1); + } + } + + return 0; +} + +int +be_visitor_scope::post_process (be_decl *) +{ + return 0; +} + +int +be_visitor_scope::pre_process (be_decl *) +{ + return 0; +} + +int +be_visitor_scope::elem_number (void) +{ + // Return the current element that we are working on. + return this->elem_number_; +} + +// Find the element that succeeds "elem" in the list. +int +be_visitor_scope::next_elem (be_decl *elem, + be_decl *&successor) +{ + be_decl *ctx_scope = this->ctx_->scope (); + be_scope *node = 0; + + if (ctx_scope != 0) + { + node = ctx_scope->scope (); + } + + if (ctx_scope == 0 || node == 0) + { + ACE_ERROR_RETURN ((LM_ERROR, + "(%N:%l) be_visitor_scope::next_elem - " + "bad scope\n"), + -1); + } + + successor = 0; + + // Initialize an iterator to iterate thru our scope. + for (UTL_ScopeActiveIterator si (node, UTL_Scope::IK_decls); + !si.is_done (); + si.next ()) + { + be_decl *bd = be_decl::narrow_from_decl (si.item ()); + + if (bd == 0) + { + ACE_ERROR_RETURN ((LM_ERROR, + "(%N:%l) be_visitor_scope::next_elem - " + "bad node in this scope\n"), + -1); + } + + if (bd != elem) + { + continue; + } + + // Find who is next to me. + si.next (); + + if (si.is_done ()) + { + // Nobody left in the list. + return 0; + } + + successor = be_decl::narrow_from_decl (si.item ()); + + if (successor == 0) + { + ACE_ERROR_RETURN ((LM_ERROR, + "(%N:%l) be_visitor_scope::next_elem - " + "bad node in this scope\n"), + -1); + } + + // Nothing else to do. + return 0; + } + + return 0; +} + +bool +be_visitor_scope::last_node (be_decl *bd) +{ + be_decl *next = 0; + (void) this->next_elem (bd, + next); + + if (next != 0) + { + // Not the last. + return 0; + } + + // I am the last one. + return 1; +} + +bool +be_visitor_scope::last_inout_or_out_node (be_decl *) +{ + // Return true if we are the last inout or out argument. + be_decl *next = 0; + (void) this->next_elem (this->ctx_->node (), + next); + + while (next != 0) + { + be_argument *arg = be_argument::narrow_from_decl (next); + + if (arg->direction () == AST_Argument::dir_INOUT + || arg->direction () == AST_Argument::dir_OUT) + { + // Not the last. + return 0; + } + + be_decl *next_next = 0; + this->next_elem (next, + next_next); + + next = next_next; + } + + // I am the last one. + return 1; +} |