|
| 1 | + |
| 2 | +#ifndef _C1_ASSEMBLY_BUILDER_H_ |
| 3 | +#define _C1_ASSEMBLY_BUILDER_H_ |
| 4 | + |
| 5 | +#include <deque> |
| 6 | +#include <unordered_map> |
| 7 | +#include <string> |
| 8 | +#include <tuple> |
| 9 | + |
| 10 | +#include <llvm/IR/BasicBlock.h> |
| 11 | +#include <llvm/IR/Constants.h> |
| 12 | +#include <llvm/IR/DerivedTypes.h> |
| 13 | +#include <llvm/IR/Function.h> |
| 14 | +#include <llvm/IR/IRBuilder.h> |
| 15 | +#include <llvm/IR/LLVMContext.h> |
| 16 | +#include <llvm/IR/Module.h> |
| 17 | +#include <llvm/IR/Type.h> |
| 18 | +#include <llvm/IR/Verifier.h> |
| 19 | + |
| 20 | +#include <c1recognizer/error_reporter.h> |
| 21 | +#include <c1recognizer/syntax_tree.h> |
| 22 | + |
| 23 | +#include "runtime.h" |
| 24 | + |
| 25 | +class assembly_builder : public c1_recognizer::syntax_tree::syntax_tree_visitor |
| 26 | +{ |
| 27 | + virtual void visit(c1_recognizer::syntax_tree::assembly &node) override; |
| 28 | + virtual void visit(c1_recognizer::syntax_tree::func_def_syntax &node) override; |
| 29 | + virtual void visit(c1_recognizer::syntax_tree::cond_syntax &node) override; |
| 30 | + virtual void visit(c1_recognizer::syntax_tree::binop_expr_syntax &node) override; |
| 31 | + virtual void visit(c1_recognizer::syntax_tree::unaryop_expr_syntax &node) override; |
| 32 | + virtual void visit(c1_recognizer::syntax_tree::lval_syntax &node) override; |
| 33 | + virtual void visit(c1_recognizer::syntax_tree::literal_syntax &node) override; |
| 34 | + virtual void visit(c1_recognizer::syntax_tree::var_def_stmt_syntax &node) override; |
| 35 | + virtual void visit(c1_recognizer::syntax_tree::assign_stmt_syntax &node) override; |
| 36 | + virtual void visit(c1_recognizer::syntax_tree::func_call_stmt_syntax &node) override; |
| 37 | + virtual void visit(c1_recognizer::syntax_tree::block_syntax &node) override; |
| 38 | + virtual void visit(c1_recognizer::syntax_tree::if_stmt_syntax &node) override; |
| 39 | + virtual void visit(c1_recognizer::syntax_tree::while_stmt_syntax &node) override; |
| 40 | + virtual void visit(c1_recognizer::syntax_tree::empty_stmt_syntax &node) override; |
| 41 | + |
| 42 | + llvm::LLVMContext &context; |
| 43 | + llvm::IRBuilder<> builder; |
| 44 | + std::unique_ptr<llvm::Module> module; |
| 45 | + std::unique_ptr<runtime_info> runtime; |
| 46 | + |
| 47 | + llvm::Value *value_result; |
| 48 | + int const_result; |
| 49 | + |
| 50 | + llvm::Function *current_function; |
| 51 | + int bb_count; |
| 52 | + |
| 53 | + bool lval_as_rval; |
| 54 | + bool in_global; |
| 55 | + bool constexpr_expected; |
| 56 | + |
| 57 | + c1_recognizer::error_reporter &err; |
| 58 | + bool error_flag; |
| 59 | + |
| 60 | + public: |
| 61 | + assembly_builder(llvm::LLVMContext &ctx, c1_recognizer::error_reporter &error_stream) |
| 62 | + : context(ctx), builder(ctx), err(error_stream) {} |
| 63 | + |
| 64 | + void build(std::string name, std::shared_ptr<c1_recognizer::syntax_tree::syntax_tree_node> tree) |
| 65 | + { |
| 66 | + // Initialize environment. |
| 67 | + module = std::make_unique<llvm::Module>(name, context); |
| 68 | + runtime = std::make_unique<runtime_info>(module.get()); |
| 69 | + |
| 70 | + enter_scope(); |
| 71 | + for (auto t : runtime->get_language_symbols()) |
| 72 | + { |
| 73 | + llvm::GlobalValue *val; |
| 74 | + std::string name; |
| 75 | + bool is_function; |
| 76 | + bool is_const; |
| 77 | + bool is_array; |
| 78 | + std::tie(name, val, is_function, is_const, is_array) = t; |
| 79 | + if (is_function) |
| 80 | + functions[name] = static_cast<llvm::Function *>(val); |
| 81 | + else |
| 82 | + declare_variable(name, val, is_const, is_array); |
| 83 | + } |
| 84 | + |
| 85 | + lval_as_rval = true; |
| 86 | + in_global = true; |
| 87 | + constexpr_expected = false; |
| 88 | + error_flag = false; |
| 89 | + // Start building by starting iterate over the syntax tree. |
| 90 | + tree->accept(*this); |
| 91 | + // Finish by clear IRBuilder's insertion point and moving away built module. |
| 92 | + builder.ClearInsertionPoint(); |
| 93 | + exit_scope(); |
| 94 | + if (error_flag) |
| 95 | + { |
| 96 | + module.release(); |
| 97 | + runtime.release(); |
| 98 | + } |
| 99 | + } |
| 100 | + |
| 101 | + std::unique_ptr<llvm::Module> get_module() { return std::move(module); } |
| 102 | + std::unique_ptr<runtime_info> get_runtime_info() { return std::move(runtime); } |
| 103 | + |
| 104 | + private: |
| 105 | + void enter_scope() { variables.emplace_front(); } |
| 106 | + |
| 107 | + void exit_scope() { variables.pop_front(); } |
| 108 | + |
| 109 | + std::tuple<llvm::Value *, bool, bool> lookup_variable(std::string name) |
| 110 | + { |
| 111 | + for (auto m : variables) |
| 112 | + if (m.count(name)) |
| 113 | + return m[name]; |
| 114 | + return std::make_tuple((llvm::Value *)nullptr, false, false); |
| 115 | + } |
| 116 | + |
| 117 | + bool declare_variable(std::string name, llvm::Value *var_ptr, bool is_const, bool is_array) |
| 118 | + { |
| 119 | + if (variables.front().count(name)) |
| 120 | + return false; |
| 121 | + variables.front()[name] = std::make_tuple(var_ptr, is_const, is_array); |
| 122 | + return true; |
| 123 | + } |
| 124 | + |
| 125 | + std::deque<std::unordered_map<std::string, std::tuple<llvm::Value *, bool, bool>>> variables; |
| 126 | + |
| 127 | + std::unordered_map<std::string, llvm::Function *> functions; |
| 128 | +}; |
| 129 | + |
| 130 | +#endif |
0 commit comments