추상 구문 트리를 제가 만든 vm의 바이트코드로 컴파일하고 싶습니다

Question

원래 제가 혼자서 만들려고 했는데 도저히 제 실력으로는 안됄거 같아서 질문합니다ㅠㅠvm의 소스코드는 다음과 같습니다vm.hpp//#include "game.hpp"#include "nanbox.hpp"using namespace std;namespace stork { enum class bytecode : uint8_t { PRINT, JMP, IADD, ISUB, IMUL, IDIV, FADD, FSUB, FMUL, FDIV, LOAD, LOAD_ARRAY, STORE, ADD_ONE, GLOAD, GLOAD_ARRAY, GSTORE, SLOAD, LOOP, IEQ, ILT, IGT, ILTE, IGTE, FEQ, FLT, FGT, FLTE, FGTE, JF, JT, HALT, CALL, RET, LOAD_ARG, NEW, THIS, CLOAD_FROM_THIS, CSTORE_FROM_THIS, CLOAD, FORLOOP, IFORLOOP_LT, IFORLOOP_GT, IFORLOOP_LTE, IFORLOOP_GTE, FFORLOOP_LT, FFORLOOP_GT, FFORLOOP_LTE, FFORLOOP_GTE, GAME_INIT, }; class VM { public: VM(vector Code, vector Stack, vector Stack_ptr, vector> functionMeta, vector> classMetadata, int globalsize); ~VM(); void exec(); private: int sp = 0; int ip = 0; //game* Game; vector code; vector stack; vector stack_ptr; shared_ptr ctx; vector> metadata; vector> cmetadata; //shared_ptr thisClass; VALUE This; ClassContext* thisClass; //int32_t* locals; vector globals; inline void call(int func_index) { // expects all args are already on the stack int funcIndex = func_index; // index of the target function in fn metadata array int numArgs = metadata[funcIndex]->numArgs; // set context to new context which points to: parent context, return address, function metadata ctx = make_shared(ctx, ip, metadata[funcIndex]); // copy args from the stack into the new context int firstArg = (sp + 1); for (int i = 0; i < numArgs; i++) { ctx->locals[i] = stack[firstArg + i]; } ip = metadata[funcIndex]->address; // jump to the function location } inline void call_method(int func_index, ClassContext* this, int firstarg) { // expects all args are already on the stack thisClass = _this; int funcIndex = func_index; // index of the target function in fn metadata array int numArgs = metadata[funcIndex]->numArgs; // index of the target function in fn metadata array // set context to new context which points to: parent context, return address, function metadata ctx = make_shared(ctx, ip, metadata[funcIndex]); // copy args from the stack into the new context int firstArg = first_arg; for (int i = 0; i < numArgs; i++) { ctx->locals[i] = stack[firstArg + i]; } ip = metadata[funcIndex]->address; // jump to the function location } };};vm.cpp#include "vm.hpp"namespace stork { VM::VM(vector Code, vector Stack, vector Stack_ptr, vector> functionMeta, vector> classMetadata, int globalsize) { this->code = Code; this->stack = Stack; this->stack_ptr = Stack_ptr; //locals = new int32_t[datasize]; vector(globalsize).swap(this->globals); this->metadata = functionMeta; this->cmetadata = classMetadata; } VM::~VM() { //delete[] Call_stack; } void VM::exec() { ip = metadata[0]->address; ctx = make_shared(nullptr, 0, metadata[0]); int funcIndex; int numArgs; int firstArg; VALUE newClass; bool running = true; HeapValue* val; sp = stack_ptr[ip]; bytecode opcode = code[ip]; //Game = new game; while (running) { ip++; switch (opcode) { case bytecode::PRINT: print_value(stack[sp]); printf(" "); break; case bytecode::JMP: ip = stack[sp]; break; case bytecode::IADD: stack[stack[sp]] = create_integer(stack[sp + 1] + stack[sp + 2]); break; case bytecode::ISUB: stack[stack[sp]] = create_integer(stack[sp + 1] - stack[sp + 2]); break; case bytecode::IMUL: stack[stack[sp]] = create_integer(stack[sp + 1] * stack[sp + 2]); break; case bytecode::IDIV: stack[stack[sp]] = create_integer(stack[sp + 1] / stack[sp + 2]); break; case bytecode::FADD: stack[stack[sp]] = create_float(stack[sp + 1] + stack[sp + 2]); break; case bytecode::FSUB: stack[stack[sp]] = create_float(stack[sp + 1] - stack[sp + 2]); break; case bytecode::FMUL: stack[stack[sp]] = create_float(stack[sp + 1] * stack[sp + 2]); break; case bytecode::FDIV: stack[stack[sp]] = create_float(stack[sp + 1] / stack[sp + 2]); break; case bytecode::GLOAD: stack[stack[sp]] = globals[stack[sp + 1]]; break; case bytecode::LOAD: stack[stack[sp]] = ctx->locals[stack[sp + 1]]; break; case bytecode::SLOAD: stack[stack[sp]] = stack[stack[sp + 1]]; break; case bytecode::LOAD_ARRAY: stack[stack[sp]] = decode_pointer(ctx->locals[stack[sp + 1]])->as_array.data[stack[sp + 2]]; break; case bytecode::GLOAD_ARRAY: stack[stack[sp]] = decode_pointer(globals[stack[sp + 1]])->as_array.data[stack[sp + 2]]; break; case bytecode::STORE: ctx->locals[stack[sp]] = stack[sp + 1]; break; case bytecode::GSTORE: globals[stack[sp]] = stack[sp + 1]; break; case bytecode::ADD_ONE: ctx->locals[stack[sp]]++; break; case bytecode::LOOP: if (stack[sp] < stack[sp + 1]) { stack[sp]++; ip = stack[sp + 2]; } else { stack[sp] = 0; } break; case bytecode::IEQ: stack[stack[sp]] = (decode_integer(stack[sp + 1]) == decode_integer(stack[sp + 2])); break; case bytecode::ILT: stack[stack[sp]] = (decode_integer(stack[sp + 1]) < decode_integer(stack[sp + 2])); break; case bytecode::ILTE: stack[stack[sp]] = (decode_integer(stack[sp + 1]) <= decode_integer(stack[sp + 2])); break; case bytecode::IGT: stack[stack[sp]] = (decode_integer(stack[sp + 1]) > decode_integer(stack[sp + 2])); break; case bytecode::IGTE: stack[stack[sp]] = (decode_integer(stack[sp + 1]) >= decode_integer(stack[sp + 2])); break; case bytecode::FEQ: stack[stack[sp]] = (decode_float(stack[sp + 1]) == decode_float(stack[sp + 2])); break; case bytecode::FLT: stack[stack[sp]] = (decode_float(stack[sp + 1]) < decode_float(stack[sp + 2])); break; case bytecode::FLTE: stack[stack[sp]] = (decode_float(stack[sp + 1]) <= decode_float(stack[sp + 2])); break; case bytecode::FGT: stack[stack[sp]] = (decode_float(stack[sp + 1]) > decode_float(stack[sp + 2])); break; case bytecode::FGTE: stack[stack[sp]] = (decode_float(stack[sp + 1]) >= decode_float(stack[sp + 2])); break; case bytecode::JF: if (stack[sp] == false) { ip = stack[sp + 1]; } break; case bytecode::JT: if (stack[sp] == true) { ip = stack[sp + 1]; } break; case bytecode::HALT: running = 0; break; case bytecode::CALL: call(stack[sp]); break; case bytecode::RET: ip = ctx->returnIp; ctx = ctx->invokingContext; break; case bytecode::NEW: newClass = create_object(make_shared(cmetadata[stack[sp + 1]])); val = decode_pointer(newClass); call_method(val->as_object.class_pointer->constructor, val->as_object.class_pointer, sp + 2); //val->as_object.class_pointer->metadata->numConstructor stack[stack[sp]] = newClass; break; case bytecode::THIS: break; case bytecode::CLOAD_FROM_THIS: stack[stack[sp]] = thisClass->members[stack[sp + 1]]; break; case bytecode::CSTORE_FROM_THIS: thisClass->members[stack[sp]] = stack[sp + 1]; break; case bytecode::CLOAD: stack[stack[sp]] = decode_pointer(stack[sp + 1])->as_object.class_pointer->members[stack[sp + 2]]; break; case bytecode::FORLOOP: if (stack[sp]) { ctx->locals[stack[sp + 1]]++; ip = stack[sp + 2]; } else { ctx->locals[stack[sp + 1]] = 0; } break; case bytecode::IFORLOOP_LT: if (decode_integer(ctx->locals[stack[sp]]) < decode_integer(stack[sp + 1])) { ctx->locals[stack[sp]]++; ip = stack[sp + 2]; } else { ctx->locals[stack[sp]] = 0; } break; case bytecode::IFORLOOP_GT: if (decode_integer(ctx->locals[stack[sp]]) > decode_integer(stack[sp + 1])) { ctx->locals[stack[sp]]++; ip = stack[sp + 2]; } else { ctx->locals[stack[sp]] = 0; } break; case bytecode::IFORLOOP_LTE: if (decode_integer(ctx->locals[stack[sp]]) <= decode_integer(stack[sp + 1])) { ctx->locals[stack[sp]]++; ip = stack[sp + 2]; } else { ctx->locals[stack[sp]] = 0; } break; case bytecode::IFORLOOP_GTE: if (decode_integer(ctx->locals[stack[sp]]) >= decode_integer(stack[sp + 1])) { ctx->locals[stack[sp]]++; ip = stack[sp + 2]; } else { ctx->locals[stack[sp]] = 0; } break; case bytecode::FFORLOOP_LT: if (decode_float(ctx->locals[stack[sp]]) < decode_float(stack[sp + 1])) { ctx->locals[stack[sp]]++; ip = stack[sp + 2]; } else { ctx->locals[stack[sp]] = 0; } break; case bytecode::FFORLOOP_GT: if (decode_float(ctx->locals[stack[sp]]) > decode_float(stack[sp + 1])) { ctx->locals[stack[sp]]++; ip = stack[sp + 2]; } else { ctx->locals[stack[sp]] = 0; } break; case bytecode::FFORLOOP_LTE: if (decode_float(ctx->locals[stack[sp]]) <= decode_float(stack[sp + 1])) { ctx->locals[stack[sp]]++; ip = stack[sp + 2]; } else { ctx->locals[stack[sp]] = 0; } break; case bytecode::FFORLOOP_GTE: if (decode_float(ctx->locals[stack[sp]]) >= decode_float(stack[sp + 1])) { ctx->locals[stack[sp]]++; ip = stack[sp + 2]; } else { ctx->locals[stack[sp]] = 0; } break; case bytecode::GAME_INIT: //Game->init(decode_packed_string(&stack[sp]), decode_integer(stack[sp + 1]), decode_integer(stack[sp + 2]), decode_integer(stack[sp + 3]), decode_integer(stack[sp + 4]), stack[sp + 5] == kTrue); break; } sp = stack_ptr[ip]; opcode = code[ip]; } //delete Game; }}

캐티 · Answer

안 그래도 복잡할 코드인데 이렇게 일렬로 보니 더 어려운 것 같습니다. 오 이번엔 오타가 나지 않았네요.

추상 구문 트리를 제가 만든 vm의 바이트코드로 컴파일하고 싶습니다

1개의 답변

Q&A 목록