/*

 * Copyright (C) 2012 David Anderson

 *

 * This file is part of JITCraft.

 *

 * JITCraft is free software: you can redistribute it and/or modify it under

 * the terms of the GNU General Public License as published by the Free

 * Software Foundation, either version 3 of the License, or (at your option)

 * any later version.

 * 

 * Foobar is distributed in the hope that it will be useful, but WITHOUT ANY

 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS

 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License along with

 * JITCraft. If not, see http://www.gnu.org/licenses/.

 */

#ifndef _include_bytecode_compiler_h_

#define _include_bytecode_compiler_h_

#include "AST.h"

#include "BytecodeEmitter.h"

#include "Code.h"

namespace jc {

class Module;

class BytecodeCompiler : public AstVisitor

{

    ParseTree *tree_;

    BytecodeEmitter emitter_;

    Module *module_;

    Type **locals_;

    Scope *scope_;

  public:

    class AutoEnterScope

    {

        BytecodeCompiler *bc_;

        Scope *saved_;

      public:

        AutoEnterScope(BytecodeCompiler *bc, Scope *scope)

          : bc_(bc),

            saved_(bc->scope_)

        {

            if (scope)

                bc->scope_ = scope;

        }

        ~AutoEnterScope() {

            bc_->scope_ = saved_;

        }

    };

  private:

    void leaveScope(Scope *scope);

    void visitForTest(Expression *expression, BytecodeEmitter::Label *label, bool onTrue);

    Code *compileFunction(Module *module, FunctionStatement *fun);

  public:

    BytecodeCompiler(ParseTree *tree);

    Module *compile();

  public:

    void visit(NameProxy *name);

    void visit(Assignment *node);

    void visit(BinaryExpression *node);

    void visit(ReturnStatement *node);

    void visit(ForStatement *node);

    void visit(BlockStatement *node);

    void visit(VariableDeclaration *node);

    void visit(IntegerLiteralExpression *node);

    void visit(ExpressionStatement *node);

    void visit(FunctionStatement *node);

    void visit(CallExpression *node);

    void visit(IfStatement *node);

    void visit(IndexExpression *node);

};

}

#endif // _include_bytecode_generator_h_