ctrump/parser/Environment.hpp

Go to the documentation of this file.

/*
 Copyright (c) 2009, National Institute of Advanced Industrial Science
 and Technology.  All rights reserved.
 
 Redistribution and use in source and binary forms, with or without
 modification, are permitted provided that the following conditions are
 met:
 
   * Redistributions of source code must retain the above copyright
     notice, this list of conditions and the following disclaimer.
 
   * Redistributions in binary form must reproduce the above copyright
     notice, this list of conditions and the following disclaimer in
     the documentation and/or other materials provided with the
     distribution.
 
   * Neither the name of Fixstars Corporation nor the names of its
     contributors may be used to endorse or promote products derived
     from this software without specific prior written permission.
 
 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT
 OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/

#ifndef CFRONT_ENVIRONMENT_HPP
#define CFRONT_ENVIRONMENT_HPP

#include <string>
#include <map>
#include <list>
#include <algorithm>

#include <antlr/AST.hpp>
#include "NameDescription.hpp"
#include "Type.hpp"

#ifdef PARSER_DEBUG
#include <sstream>
#endif

namespace cfront {

typedef std::map<std::string, NameDescription> OrdinaryNames;

typedef std::map<std::string, NameDescription> TagNames;

class Environment {
public:
    Environment(Environment* outer = NULL)
        : outer_(outer)
    {
    }

    Environment* getOuterEnv() const
    {
        return outer_;
    }

    bool addOrdinaryName(const std::string& name, Type* type, 
                         NameDescription::StorageClassSpecTag storageSpec,
                         NameDescription::DeclarationLocation loc,
                         NameDescription** nd)
    {
        OrdinaryNames::iterator i = ordinaryNames_.find(name);
        if (i != ordinaryNames_.end()) {
            NameDescription& tnd = i->second;
            Type* t = tnd.getType();
            if (t == NULL) {
                // add type to this name.
                tnd.setType(type);
                *nd = &tnd;
                return true;
            } else {
                // type has already been specified - check the compatibility.
            }
            return false;
        }
        
        OrdinaryNames::value_type v =
            OrdinaryNames::value_type(name,
                                      NameDescription(type, storageSpec, loc));
        std::pair<OrdinaryNames::iterator, bool> p = ordinaryNames_.insert(v);
        *nd = &(p.first->second);
        return true;
    }

    Environment* lookupOrdinaryName(const std::string& name,
                                    NameDescription** nd)
    {
        OrdinaryNames::iterator i = ordinaryNames_.find(name);
        if (i != ordinaryNames_.end()) {
            *nd = &(i->second);
            return this;
        } else {
            if (outer_ == NULL) {
                return NULL;
            } else {
                return outer_->lookupOrdinaryName(name, nd);
            }
        }
    }

    bool addTagName(const std::string& name, Type* type,
                    NameDescription::DeclarationLocation loc)
    {
        TagNames::iterator i = tagNames_.find(name);
        if (i != tagNames_.end()) {
            NameDescription& nd = i->second;
            Type* t = nd.getType();
            if (t == NULL) {
                // make the incomplete type complete.
                nd.setType(type);
                return true;
            } else {
                return false;
            }
        }
        tagNames_[name] = NameDescription(type, NameDescription::SS_NONE, loc);
        if (outer_ == NULL) {
            return true;
        } else {
            // add the tag name recursively.
            return outer_->addTagName(name, type, loc);
        }
    }

    Environment* lookupTagName(const std::string& name,
                               NameDescription** nd)
    {
        TagNames::iterator i = tagNames_.find(name);
        if (i != tagNames_.end()) {
            *nd = &(i->second);
            return this;
        } else {
            if (outer_ == NULL) {
                return NULL;
            } else {
                return outer_->lookupTagName(name, nd);
            }
        }
    }

#ifdef PARSER_DEBUG
    std::string toString() const
    {
        std::stringstream ss;
        ss << "OrdinaryNames: ";
        for (OrdinaryNames::const_iterator i = ordinaryNames_.begin();
             i != ordinaryNames_.end(); ++i) {
            ss << "[" << i->first << ", " << i->second.getType()->toString() << "]";
        }
        if (outer_ != NULL) {
            //ss << "\nOuter: " << outer_->toString();
        }

        return ss.str();
    }
#endif

private:
    Environment* outer_;

    OrdinaryNames ordinaryNames_;
    TagNames tagNames_;

};


} // namespace cfront


#endif

/*
 * Local Variables:
 * mode: C++
 * c-basic-offset: 4
 * indent-tabs-mode: nil
 * End:
 */

---