C-Breeze Compiler Infrastructure

00001 // $Id: structnode.cc,v 1.3 2003/08/07 23:13:12 pnav Exp $
00002 // ----------------------------------------------------------------------
00003 //
00004 //  C-Breeze
00005 //  C Compiler Framework
00006 // 
00007 //  Copyright (c) 2000 University of Texas at Austin
00008 // 
00009 //  Samuel Z. Guyer
00010 //  Daniel A. Jimenez
00011 //  Calvin Lin
00012 // 
00013 //  Permission is hereby granted, free of charge, to any person
00014 //  obtaining a copy of this software and associated documentation
00015 //  files (the "Software"), to deal in the Software without
00016 //  restriction, including without limitation the rights to use, copy,
00017 //  modify, merge, publish, distribute, sublicense, and/or sell copies
00018 //  of the Software, and to permit persons to whom the Software is
00019 //  furnished to do so, subject to the following conditions:
00020 //  
00021 //  The above copyright notice and this permission notice shall be
00022 //  included in all copies or substantial portions of the Software.
00023 //  
00024 //  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00025 //  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00026 //  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00027 //  NONINFRINGEMENT.  IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT
00028 //  AUSTIN BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
00029 //  IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
00030 //  OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
00031 //  THE SOFTWARE.
00032 //
00033 //  We acknowledge the C-to-C Translator from MIT Laboratory for
00034 //  Computer Science for inspiring parts of the C-Breeze design.
00035 //
00036 // ----------------------------------------------------------------------
00037 
00038 #include "c_breeze.h"
00039 
00040 // --------------------------------------------------------------------
00041 // Constructors
00042 // --------------------------------------------------------------------
00043 
00044 structNode::structNode(const Coord coord)
00045   : sueNode(Struct, coord)
00046 {}
00047 
00048 // ------------------------------------------------------------
00049 //  Walker
00050 // ------------------------------------------------------------
00051 
00052 void structNode::visit(Visitor * the_visitor) 
00053 {
00054   the_visitor->at_struct(this);
00055 }
00056 
00057 void structNode::walk(Walker & the_walker)
00058 {
00059   Walker::Order ord = the_walker.order(); 
00060 
00061   if (ord == Walker::Preorder || ord == Walker::Both)
00062     the_walker.at_struct(this, Walker::Preorder);
00063 
00064   if (the_walker.depth() == Walker::Subtree) {
00065     // -- Visit the children 
00066 
00067     //    if (elaborated() && spec())
00068     //      spec()->walk(the_walker);
00069   }
00070 
00071   if (ord == Walker::Postorder || ord == Walker::Both)
00072     the_walker.at_struct(this, Walker::Postorder);
00073 }
00074 
00075 // ------------------------------------------------------------
00076 //  Changer
00077 // ------------------------------------------------------------
00078 
00079 Node * structNode::change(Changer & the_changer, bool redispatch)
00080 {
00081   Changer::Order ord = the_changer.order(); 
00082   structNode * the_struct = this;
00083 
00084   if ((ord == Changer::Preorder || ord == Changer::Both) && ! redispatch)
00085     the_struct = (structNode *) the_changer.at_struct(the_struct, Changer::Preorder);
00086 
00087   if (the_struct) {
00088 
00089     if (the_struct != this)
00090       return the_struct->change(the_changer, true);
00091 
00092     //    suespecNode * old_spec = the_struct->spec();
00093     //    if (the_struct->elaborated() && old_spec) {
00094     //      suespecNode * new_spec = (suespecNode *) old_spec->change(the_changer);
00095     //      if (old_spec != new_spec) {
00096     //  if (the_changer.delete_old())
00097     //    delete old_spec;
00098     //        the_struct->spec(new_spec);
00099     //      }
00100     //    }
00101 
00102   }
00103 
00104   if ((ord == Changer::Postorder || ord == Changer::Both) && ! redispatch)
00105     the_struct = (structNode *) the_changer.at_struct(the_struct, Changer::Postorder);
00106 
00107   return the_struct;
00108 }
00109 
00110 
00111 // ------------------------------------------------------------
00112 // Destructor
00113 // ------------------------------------------------------------
00114 
00115 structNode::~structNode()
00116 {
00117 }