% # -*- mode:c; style:ruby; coding: utf-8; indent-tabs-mode: nil -*- % # Copyright (c) 2018 Takashi Kokubun. All rights reserved. % # % # This file is a part of the programming language Ruby. Permission is hereby % # granted, to either redistribute and/or modify this file, provided that the % # conditions mentioned in the file COPYING are met. Consult the file for % # details. % % trace_enablable_insns = [ % 'opt_send_without_block', % 'send', % 'invokeblock', % 'invokesuper', % ] % fprintf(f, "{\n"); { % # compiler: Prepare operands which may be used by `insn.call_attribute` % insn.opes.each_with_index do |ope, i| MAYBE_UNUSED(<%= ope.fetch(:decl) %>) = (<%= ope.fetch(:type) %>)operands[<%= i %>]; % end % % # JIT: Declare variables for operands, popped values and return values % ret_decls = insn.rets.map { |r| "MAYBE_UNUSED(#{r.fetch(:type)}) #{r.fetch(:name)}"} # TODO: fix #declarations to return Hash... % insn.declarations.each do |decl| % next if dispatched && ret_decls.include?(decl) # return value should be propagated to dispatcher. TODO: assert it's the same as dispatcher fprintf(f, " <%= decl %>;\n"); % end % # JIT: Set const expressions for `RubyVM::OperandsUnifications` insn % insn.preamble.each do |amble| fprintf(f, "<%= amble.expr %>\n"); % end % % # JIT: Initialize operands % insn.opes.each_with_index do |ope, i| fprintf(f, " <%= ope.fetch(:name) %> = (<%= ope.fetch(:type) %>)0x%"PRIxVALUE";", operands[<%= i %>]); % case ope.fetch(:type) % when 'ID' comment_id(f, (ID)operands[<%= i %>]); % when 'CALL_INFO' comment_id(f, ((CALL_INFO)operands[<%= i %>])->mid); % when 'VALUE' if (SYMBOL_P((VALUE)operands[<%= i %>])) comment_id(f, SYM2ID((VALUE)operands[<%= i %>])); % end fprintf(f, "\n"); % end % % # JIT: Initialize popped values % insn.pops.reverse_each.with_index.reverse_each do |pop, i| fprintf(f, " <%= pop.fetch(:name) %> = stack[%d];\n", b->stack_size - <%= i + 1 %>); % end % % # JIT: move sp and pc if necessary % if insn.handles_frame? fprintf(f, " reg_cfp->pc = original_body_iseq + %d;\n", next_pos); /* ADD_PC(INSN_ATTR(width)); */ fprintf(f, " reg_cfp->sp = (VALUE *)reg_cfp->bp + %d;\n", b->stack_size + 1 - <%= insn.pops.size %>); /* POPN(INSN_ATTR(popn)); */ % else fprintf(f, " reg_cfp->pc = original_body_iseq + %d;\n", pos); fprintf(f, " reg_cfp->sp = (VALUE *)reg_cfp->bp + %d;\n", b->stack_size + 1); % end % % # JIT: Print insn body in insns.def <%= render 'mjit_compile_insn_body', locals: { insn: insn } -%> % % # JIT: Set return values % unless dispatched % insn.rets.reverse_each.with_index do |ret, i| % # TOPN(n) = ... fprintf(f, " stack[%d] = <%= ret.fetch(:name) %>;\n", b->stack_size + (int)<%= insn.call_attribute('sp_inc') %> - <%= i + 1 %>); % end % end % % # JIT: We should evaluate ISeq modified for TracePoint if it's enabled. Note: This is slow. % if trace_enablable_insns.include?(insn.name) fprintf(f, " if (UNLIKELY(ruby_vm_event_enabled_flags & ISEQ_TRACE_EVENTS)) {\n"); fprintf(f, " reg_cfp->sp = (VALUE *)reg_cfp->bp + %d;\n", b->stack_size + (int)<%= insn.call_attribute('sp_inc') %> + 1); fprintf(f, " return Qundef; /* cancel JIT */\n"); fprintf(f, " }\n"); % end % % # compiler: Move JIT compiler's internal stack pointer % unless dispatched b->stack_size += <%= insn.call_attribute('sp_inc') %>; % end } fprintf(f, "}\n"); % % # compiler: If insn has conditional JUMP, the branch which is not targeted by JUMP should be compiled too. % if insn.expr.expr =~ /if\s+\([^{}]+\)\s+\{[^{}]+JUMP\([^)]+\);[^{}]+\}/ compile_insns(f, body, b->stack_size, pos + insn_len(insn), status); % end % % # compiler: If insn returns (leave) or does longjmp (throw), the branch should no longer be compiled. TODO: create attr for it? % if insn.expr.expr =~ /\sTHROW_EXCEPTION\([^)]+\);/ || insn.expr.expr =~ /\sRESTORE_REGS\(\);/ b->finish_p = TRUE; % end