C-Breeze
C Compiler Infrastructure

[ Project home page]
Main Page   Modules   Namespace List   Class Hierarchy   Alphabetical List   Compound List   File List   Namespace Members   Compound Members   File Members   Related Pages  

enumnode.cc

Go to the documentation of this file.
00001 // $Id: enumnode.cc,v 1.3 2003/08/07 23:13:03 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 enumNode::enumNode(const Coord coord)
00045   : sueNode(Enum, coord)
00046 {}
00047 
00048 // --- Was BuildEnum from sue.c
00049 
00050 enumNode::enumNode(idNode *id, decl_list * values, 
00051                    const Coord enum_coord, const Coord left_coord,
00052                    const Coord the_right_coord)
00053   : sueNode(Enum, enum_coord)
00054 {
00055   // -- NOTE: This no longer tests for incomplete enums
00056   // (which are illegal).
00057 
00058   set_name_fields(id, values, left_coord, the_right_coord);
00059 }
00060 
00061 // ------------------------------------------------------------
00062 //  Walker
00063 // ------------------------------------------------------------
00064 
00065 void enumNode::visit(Visitor * the_visitor) 
00066 {
00067   the_visitor->at_enum(this);
00068 }
00069 
00070 void enumNode::walk(Walker & the_walker)
00071 {
00072   Walker::Order ord = the_walker.order(); 
00073 
00074   if (ord == Walker::Preorder || ord == Walker::Both)
00075     the_walker.at_enum(this, Walker::Preorder);
00076 
00077   if (the_walker.depth() == Walker::Subtree) {
00078     // -- Visit the children 
00079 
00080     //if (elaborated() && spec())
00081     //  spec()->walk(the_walker);
00082   }
00083 
00084   if (ord == Walker::Postorder || ord == Walker::Both)
00085     the_walker.at_enum(this, Walker::Postorder);
00086 }
00087 
00088 // ------------------------------------------------------------
00089 //  Changer
00090 // ------------------------------------------------------------
00091 
00092 Node * enumNode::change(Changer & the_changer, bool redispatch)
00093 {
00094   Changer::Order ord = the_changer.order(); 
00095   enumNode * the_enum = this;
00096 
00097   if ((ord == Changer::Preorder || ord == Changer::Both) && ! redispatch)
00098     the_enum = (enumNode *) the_changer.at_enum(the_enum, Changer::Preorder);
00099 
00100   if (the_enum) {
00101 
00102     if (the_enum != this)
00103       return the_enum->change(the_changer, true);
00104 
00105     // suespecNode * old_spec = the_enum->spec();
00106     // if (the_enum->elaborated() && old_spec) {
00107     //  suespecNode * new_spec = (suespecNode *) old_spec->change(the_changer);
00108     //  if (old_spec != new_spec) {
00109     //  if (the_changer.delete_old())
00110     //    delete old_spec;
00111     //        the_enum->spec(new_spec);
00112     //      }
00113     // }
00114 
00115   }
00116 
00117   if ((ord == Changer::Postorder || ord == Changer::Both) && ! redispatch)
00118     the_enum = (enumNode *) the_changer.at_enum(the_enum, Changer::Postorder);
00119 
00120   return the_enum;
00121 }
00122 
00123 
00124 // ------------------------------------------------------------
00125 // Destructor
00126 // ------------------------------------------------------------
00127 
00128 enumNode::~enumNode()
00129 {
00130 }

Generated on August 27, 2003
Back to the C-Breeze home page