source: src/CodeGen/Generate.cc@ a0c7dc36

//
// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
//
// The contents of this file are covered under the licence agreement in the
// file "LICENCE" distributed with Cforall.
//
// Generate.cc --
//
// Author           : Richard C. Bilson
// Created On       : Mon May 18 07:44:20 2015
// Last Modified By : Andrew Beach
// Last Modified On : Fri Aug 18 15:39:00 2017
// Update Count     : 7
//
#include "Generate.h"

#include <iostream>                  // for ostream, endl, operator<<
#include <list>                      // for list
#include <string>                    // for operator<<

#include "CodeGenerator.h"           // for CodeGenerator, doSemicolon, oper...
#include "GenType.h"                 // for genPrettyType
#include "Common/PassVisitor.h"      // for PassVisitor
#include "Parser/LinkageSpec.h"      // for isBuiltin, isGeneratable
#include "SynTree/BaseSyntaxNode.h"  // for BaseSyntaxNode
#include "SynTree/Declaration.h"     // for Declaration
#include "SynTree/Type.h"            // for Type

using namespace std;

namespace CodeGen {
        namespace {
                /// Removes misc. nodes that should not exist in CodeGen
                struct TreeCleaner {
                        void visit( CompoundStmt * stmt );

                        static bool shouldClean( Declaration * );
                };

                void cleanTree( std::list< Declaration * > & translationUnit ) {
                        PassVisitor<TreeCleaner> cleaner;
                        filter( translationUnit, [](Declaration * decl) { return TreeCleaner::shouldClean(decl); }, false );
                        acceptAll( translationUnit, cleaner );
                } // cleanTree
        } // namespace

        void generate( std::list< Declaration* > translationUnit, std::ostream &os, bool doIntrinsics, bool pretty, bool generateC, bool lineMarks ) {
                cleanTree( translationUnit );

                CodeGen::CodeGenerator cgv( os, pretty, generateC, lineMarks );
                for ( auto & dcl : translationUnit ) {
                        if ( LinkageSpec::isGeneratable( dcl->get_linkage() ) && (doIntrinsics || ! LinkageSpec::isBuiltin( dcl->get_linkage() ) ) ) {
                                cgv.updateLocation( dcl );
                                dcl->accept(cgv);
                                if ( doSemicolon( dcl ) ) {
                                        os << ";";
                                } // if
                                os << std::endl;
                        } // if
                } // for
        }

        void generate( BaseSyntaxNode * node, std::ostream & os ) {
                if ( Type * type = dynamic_cast< Type * >( node ) ) {
                        os << CodeGen::genPrettyType( type, "" );
                } else {
                        CodeGen::CodeGenerator cgv( os, true, false, false );
                        node->accept( cgv );
                }
                os << std::endl;
        }

        namespace {
                void TreeCleaner::visit( CompoundStmt * cstmt ) {
                        filter( cstmt->kids, [](Statement * stmt) {
                                if ( DeclStmt * declStmt = dynamic_cast< DeclStmt * >( stmt ) ) {
                                        return shouldClean( declStmt->decl );
                                }
                                return false;
                        }, false );
                }

                bool TreeCleaner::shouldClean( Declaration * decl ) {
                        return dynamic_cast< TraitDecl * >( decl );
                }
        } // namespace
} // namespace CodeGen

// Local Variables: //
// tab-width: 4 //
// mode: c++ //
// compile-command: "make install" //
// End: //