12#include "ruby/internal/config.h"
22#include "internal/array.h"
23#include "internal/compile.h"
24#include "internal/complex.h"
25#include "internal/encoding.h"
26#include "internal/error.h"
27#include "internal/gc.h"
28#include "internal/hash.h"
29#include "internal/io.h"
30#include "internal/numeric.h"
31#include "internal/object.h"
32#include "internal/rational.h"
33#include "internal/re.h"
34#include "internal/ruby_parser.h"
35#include "internal/symbol.h"
36#include "internal/thread.h"
37#include "internal/variable.h"
43#include "vm_callinfo.h"
49#include "insns_info.inc"
51#define FIXNUM_INC(n, i) ((n)+(INT2FIX(i)&~FIXNUM_FLAG))
85 unsigned int rescued: 2;
86 unsigned int unremovable: 1;
91 enum ruby_vminsn_type insn_id;
121 const void *ensure_node;
126const ID rb_iseq_shared_exc_local_tbl[] = {idERROR_INFO};
146#define compile_debug CPDEBUG
148#define compile_debug ISEQ_COMPILE_DATA(iseq)->option->debug_level
153#define compile_debug_print_indent(level) \
154 ruby_debug_print_indent((level), compile_debug, gl_node_level * 2)
156#define debugp(header, value) (void) \
157 (compile_debug_print_indent(1) && \
158 ruby_debug_print_value(1, compile_debug, (header), (value)))
160#define debugi(header, id) (void) \
161 (compile_debug_print_indent(1) && \
162 ruby_debug_print_id(1, compile_debug, (header), (id)))
164#define debugp_param(header, value) (void) \
165 (compile_debug_print_indent(1) && \
166 ruby_debug_print_value(1, compile_debug, (header), (value)))
168#define debugp_verbose(header, value) (void) \
169 (compile_debug_print_indent(2) && \
170 ruby_debug_print_value(2, compile_debug, (header), (value)))
172#define debugp_verbose_node(header, value) (void) \
173 (compile_debug_print_indent(10) && \
174 ruby_debug_print_value(10, compile_debug, (header), (value)))
176#define debug_node_start(node) ((void) \
177 (compile_debug_print_indent(1) && \
178 (ruby_debug_print_node(1, CPDEBUG, "", (const NODE *)(node)), gl_node_level)), \
181#define debug_node_end() gl_node_level --
185#define debugi(header, id) ((void)0)
186#define debugp(header, value) ((void)0)
187#define debugp_verbose(header, value) ((void)0)
188#define debugp_verbose_node(header, value) ((void)0)
189#define debugp_param(header, value) ((void)0)
190#define debug_node_start(node) ((void)0)
191#define debug_node_end() ((void)0)
194#if CPDEBUG > 1 || CPDEBUG < 0
196#define printf ruby_debug_printf
197#define debugs if (compile_debug_print_indent(1)) ruby_debug_printf
198#define debug_compile(msg, v) ((void)(compile_debug_print_indent(1) && fputs((msg), stderr)), (v))
200#define debugs if(0)printf
201#define debug_compile(msg, v) (v)
204#define LVAR_ERRINFO (1)
207#define NEW_LABEL(l) new_label_body(iseq, (l))
208#define LABEL_FORMAT "<L%03d>"
210#define NEW_ISEQ(node, name, type, line_no) \
211 new_child_iseq(iseq, (node), rb_fstring(name), 0, (type), (line_no))
213#define NEW_CHILD_ISEQ(node, name, type, line_no) \
214 new_child_iseq(iseq, (node), rb_fstring(name), iseq, (type), (line_no))
216#define NEW_CHILD_ISEQ_WITH_CALLBACK(callback_func, name, type, line_no) \
217 new_child_iseq_with_callback(iseq, (callback_func), (name), iseq, (type), (line_no))
220#define ADD_SEQ(seq1, seq2) \
221 APPEND_LIST((seq1), (seq2))
224#define ADD_INSN(seq, line_node, insn) \
225 ADD_ELEM((seq), (LINK_ELEMENT *) new_insn_body(iseq, nd_line(line_node), nd_node_id(line_node), BIN(insn), 0))
228#define ADD_SYNTHETIC_INSN(seq, line_no, node_id, insn) \
229 ADD_ELEM((seq), (LINK_ELEMENT *) new_insn_body(iseq, (line_no), (node_id), BIN(insn), 0))
232#define INSERT_BEFORE_INSN(next, line_no, node_id, insn) \
233 ELEM_INSERT_PREV(&(next)->link, (LINK_ELEMENT *) new_insn_body(iseq, line_no, node_id, BIN(insn), 0))
236#define INSERT_AFTER_INSN(prev, line_no, node_id, insn) \
237 ELEM_INSERT_NEXT(&(prev)->link, (LINK_ELEMENT *) new_insn_body(iseq, line_no, node_id, BIN(insn), 0))
240#define ADD_INSN1(seq, line_node, insn, op1) \
241 ADD_ELEM((seq), (LINK_ELEMENT *) \
242 new_insn_body(iseq, nd_line(line_node), nd_node_id(line_node), BIN(insn), 1, (VALUE)(op1)))
245#define INSERT_BEFORE_INSN1(next, line_no, node_id, insn, op1) \
246 ELEM_INSERT_PREV(&(next)->link, (LINK_ELEMENT *) \
247 new_insn_body(iseq, line_no, node_id, BIN(insn), 1, (VALUE)(op1)))
250#define INSERT_AFTER_INSN1(prev, line_no, node_id, insn, op1) \
251 ELEM_INSERT_NEXT(&(prev)->link, (LINK_ELEMENT *) \
252 new_insn_body(iseq, line_no, node_id, BIN(insn), 1, (VALUE)(op1)))
254#define LABEL_REF(label) ((label)->refcnt++)
257#define ADD_INSNL(seq, line_node, insn, label) (ADD_INSN1(seq, line_node, insn, label), LABEL_REF(label))
259#define ADD_INSN2(seq, line_node, insn, op1, op2) \
260 ADD_ELEM((seq), (LINK_ELEMENT *) \
261 new_insn_body(iseq, nd_line(line_node), nd_node_id(line_node), BIN(insn), 2, (VALUE)(op1), (VALUE)(op2)))
263#define ADD_INSN3(seq, line_node, insn, op1, op2, op3) \
264 ADD_ELEM((seq), (LINK_ELEMENT *) \
265 new_insn_body(iseq, nd_line(line_node), nd_node_id(line_node), BIN(insn), 3, (VALUE)(op1), (VALUE)(op2), (VALUE)(op3)))
268#define ADD_SEND(seq, line_node, id, argc) \
269 ADD_SEND_R((seq), (line_node), (id), (argc), NULL, (VALUE)INT2FIX(0), NULL)
271#define ADD_SEND_WITH_FLAG(seq, line_node, id, argc, flag) \
272 ADD_SEND_R((seq), (line_node), (id), (argc), NULL, (VALUE)(flag), NULL)
274#define ADD_SEND_WITH_BLOCK(seq, line_node, id, argc, block) \
275 ADD_SEND_R((seq), (line_node), (id), (argc), (block), (VALUE)INT2FIX(0), NULL)
277#define ADD_CALL_RECEIVER(seq, line_node) \
278 ADD_INSN((seq), (line_node), putself)
280#define ADD_CALL(seq, line_node, id, argc) \
281 ADD_SEND_R((seq), (line_node), (id), (argc), NULL, (VALUE)INT2FIX(VM_CALL_FCALL), NULL)
283#define ADD_CALL_WITH_BLOCK(seq, line_node, id, argc, block) \
284 ADD_SEND_R((seq), (line_node), (id), (argc), (block), (VALUE)INT2FIX(VM_CALL_FCALL), NULL)
286#define ADD_SEND_R(seq, line_node, id, argc, block, flag, keywords) \
287 ADD_ELEM((seq), (LINK_ELEMENT *) new_insn_send(iseq, nd_line(line_node), nd_node_id(line_node), (id), (VALUE)(argc), (block), (VALUE)(flag), (keywords)))
289#define ADD_TRACE(seq, event) \
290 ADD_ELEM((seq), (LINK_ELEMENT *)new_trace_body(iseq, (event), 0))
291#define ADD_TRACE_WITH_DATA(seq, event, data) \
292 ADD_ELEM((seq), (LINK_ELEMENT *)new_trace_body(iseq, (event), (data)))
294static void iseq_add_getlocal(
rb_iseq_t *iseq,
LINK_ANCHOR *
const seq,
const NODE *
const line_node,
int idx,
int level);
295static void iseq_add_setlocal(
rb_iseq_t *iseq,
LINK_ANCHOR *
const seq,
const NODE *
const line_node,
int idx,
int level);
297#define ADD_GETLOCAL(seq, line_node, idx, level) iseq_add_getlocal(iseq, (seq), (line_node), (idx), (level))
298#define ADD_SETLOCAL(seq, line_node, idx, level) iseq_add_setlocal(iseq, (seq), (line_node), (idx), (level))
301#define ADD_LABEL(seq, label) \
302 ADD_ELEM((seq), (LINK_ELEMENT *) (label))
304#define APPEND_LABEL(seq, before, label) \
305 APPEND_ELEM((seq), (before), (LINK_ELEMENT *) (label))
307#define ADD_ADJUST(seq, line_node, label) \
308 ADD_ELEM((seq), (LINK_ELEMENT *) new_adjust_body(iseq, (label), nd_line(line_node)))
310#define ADD_ADJUST_RESTORE(seq, label) \
311 ADD_ELEM((seq), (LINK_ELEMENT *) new_adjust_body(iseq, (label), -1))
313#define LABEL_UNREMOVABLE(label) \
314 ((label) ? (LABEL_REF(label), (label)->unremovable=1) : 0)
315#define ADD_CATCH_ENTRY(type, ls, le, iseqv, lc) do { \
316 VALUE _e = rb_ary_new3(5, (type), \
317 (VALUE)(ls) | 1, (VALUE)(le) | 1, \
318 (VALUE)(iseqv), (VALUE)(lc) | 1); \
319 LABEL_UNREMOVABLE(ls); \
322 if (NIL_P(ISEQ_COMPILE_DATA(iseq)->catch_table_ary)) \
323 RB_OBJ_WRITE(iseq, &ISEQ_COMPILE_DATA(iseq)->catch_table_ary, rb_ary_hidden_new(3)); \
324 rb_ary_push(ISEQ_COMPILE_DATA(iseq)->catch_table_ary, freeze_hide_obj(_e)); \
328#define COMPILE(anchor, desc, node) \
329 (debug_compile("== " desc "\n", \
330 iseq_compile_each(iseq, (anchor), (node), 0)))
333#define COMPILE_POPPED(anchor, desc, node) \
334 (debug_compile("== " desc "\n", \
335 iseq_compile_each(iseq, (anchor), (node), 1)))
338#define COMPILE_(anchor, desc, node, popped) \
339 (debug_compile("== " desc "\n", \
340 iseq_compile_each(iseq, (anchor), (node), (popped))))
342#define COMPILE_RECV(anchor, desc, node, recv) \
343 (private_recv_p(node) ? \
344 (ADD_INSN(anchor, node, putself), VM_CALL_FCALL) : \
345 COMPILE(anchor, desc, recv) ? 0 : -1)
347#define OPERAND_AT(insn, idx) \
348 (((INSN*)(insn))->operands[(idx)])
350#define INSN_OF(insn) \
351 (((INSN*)(insn))->insn_id)
353#define IS_INSN(link) ((link)->type == ISEQ_ELEMENT_INSN)
354#define IS_LABEL(link) ((link)->type == ISEQ_ELEMENT_LABEL)
355#define IS_ADJUST(link) ((link)->type == ISEQ_ELEMENT_ADJUST)
356#define IS_TRACE(link) ((link)->type == ISEQ_ELEMENT_TRACE)
357#define IS_INSN_ID(iobj, insn) (INSN_OF(iobj) == BIN(insn))
358#define IS_NEXT_INSN_ID(link, insn) \
359 ((link)->next && IS_INSN((link)->next) && IS_INSN_ID((link)->next, insn))
367append_compile_error(const
rb_iseq_t *iseq,
int line, const
char *fmt, ...)
369 VALUE err_info = ISEQ_COMPILE_DATA(iseq)->err_info;
370 VALUE file = rb_iseq_path(iseq);
375 err = rb_syntax_error_append(err, file, line, -1, NULL, fmt, args);
377 if (
NIL_P(err_info)) {
378 RB_OBJ_WRITE(iseq, &ISEQ_COMPILE_DATA(iseq)->err_info, err);
381 else if (!err_info) {
392compile_bug(
rb_iseq_t *iseq,
int line,
const char *fmt, ...)
396 rb_report_bug_valist(rb_iseq_path(iseq), line, fmt, args);
402#define COMPILE_ERROR append_compile_error
404#define ERROR_ARGS_AT(n) iseq, nd_line(n),
405#define ERROR_ARGS ERROR_ARGS_AT(node)
407#define EXPECT_NODE(prefix, node, ndtype, errval) \
409 const NODE *error_node = (node); \
410 enum node_type error_type = nd_type(error_node); \
411 if (error_type != (ndtype)) { \
412 COMPILE_ERROR(ERROR_ARGS_AT(error_node) \
413 prefix ": " #ndtype " is expected, but %s", \
414 ruby_node_name(error_type)); \
419#define EXPECT_NODE_NONULL(prefix, parent, ndtype, errval) \
421 COMPILE_ERROR(ERROR_ARGS_AT(parent) \
422 prefix ": must be " #ndtype ", but 0"); \
426#define UNKNOWN_NODE(prefix, node, errval) \
428 const NODE *error_node = (node); \
429 COMPILE_ERROR(ERROR_ARGS_AT(error_node) prefix ": unknown node (%s)", \
430 ruby_node_name(nd_type(error_node))); \
437#define CHECK(sub) if (!(sub)) {BEFORE_RETURN;return COMPILE_NG;}
438#define NO_CHECK(sub) (void)(sub)
441#define DECL_ANCHOR(name) \
442 LINK_ANCHOR name[1] = {{{ISEQ_ELEMENT_ANCHOR,},&name[0].anchor}}
443#define INIT_ANCHOR(name) \
444 ((name->last = &name->anchor)->next = NULL)
447freeze_hide_obj(
VALUE obj)
450 RBASIC_CLEAR_CLASS(obj);
454#include "optinsn.inc"
455#if OPT_INSTRUCTIONS_UNIFICATION
456#include "optunifs.inc"
461#define ISEQ_ARG iseq,
462#define ISEQ_ARG_DECLARE rb_iseq_t *iseq,
465#define ISEQ_ARG_DECLARE
469#define gl_node_level ISEQ_COMPILE_DATA(iseq)->node_level
475static int insn_data_length(
INSN *iobj);
476static int calc_sp_depth(
int depth,
INSN *iobj);
478static INSN *new_insn_body(
rb_iseq_t *iseq,
int line_no,
int node_id,
enum ruby_vminsn_type insn_id,
int argc, ...);
491static int iseq_set_exception_local_table(
rb_iseq_t *iseq);
495static int iseq_set_exception_table(
rb_iseq_t *iseq);
496static int iseq_set_optargs_table(
rb_iseq_t *iseq);
499static int compile_hash(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *node,
int method_call_keywords,
int popped);
506verify_list(ISEQ_ARG_DECLARE
const char *info,
LINK_ANCHOR *
const anchor)
512 if (!compile_debug)
return;
514 list = anchor->anchor.next;
515 plist = &anchor->anchor;
517 if (plist != list->prev) {
524 if (anchor->last != plist && anchor->last != 0) {
529 rb_bug(
"list verify error: %08x (%s)", flag, info);
534#define verify_list(info, anchor) verify_list(iseq, (info), (anchor))
541 VALUE *original = rb_iseq_original_iseq(iseq);
543 while (i < ISEQ_BODY(iseq)->iseq_size) {
544 VALUE insn = original[i];
545 const char *types = insn_op_types(insn);
547 for (
int j=0; types[j]; j++) {
548 if (types[j] == TS_CALLDATA) {
552 if (cc != vm_cc_empty()) {
554 rb_bug(
"call cache is not initialized by vm_cc_empty()");
561 for (
unsigned int i=0; i<ISEQ_BODY(iseq)->ci_size; i++) {
562 struct rb_call_data *cd = &ISEQ_BODY(iseq)->call_data[i];
565 if (cc != NULL && cc != vm_cc_empty()) {
567 rb_bug(
"call cache is not initialized by vm_cc_empty()");
579 elem->prev = anchor->last;
580 anchor->last->next = elem;
582 verify_list(
"add", anchor);
592 elem->next = before->next;
593 elem->next->prev = elem;
595 if (before == anchor->last) anchor->last = elem;
596 verify_list(
"add", anchor);
599#define ADD_ELEM(anchor, elem) ADD_ELEM(iseq, (anchor), (elem))
600#define APPEND_ELEM(anchor, before, elem) APPEND_ELEM(iseq, (anchor), (before), (elem))
604branch_coverage_valid_p(
rb_iseq_t *iseq,
int first_line)
606 if (!ISEQ_COVERAGE(iseq))
return 0;
607 if (!ISEQ_BRANCH_COVERAGE(iseq))
return 0;
608 if (first_line <= 0)
return 0;
612#define PTR2NUM(x) (rb_int2inum((intptr_t)(void *)(x)))
617 const int first_lineno = loc->beg_pos.lineno, first_column = loc->beg_pos.column;
618 const int last_lineno = loc->end_pos.lineno, last_column = loc->end_pos.column;
621 rb_hash_aset(structure, key, branch);
633 if (!branch_coverage_valid_p(iseq, loc->beg_pos.lineno))
return Qundef;
644 VALUE branch_base = rb_hash_aref(structure, key);
647 if (
NIL_P(branch_base)) {
648 branch_base = setup_branch(loc,
type, structure, key);
649 branches = rb_hash_new();
661generate_dummy_line_node(
int lineno,
int node_id)
664 nd_set_line(&dummy, lineno);
665 nd_set_node_id(&dummy, node_id);
672 if (!branch_coverage_valid_p(iseq, loc->beg_pos.lineno))
return;
683 VALUE branch = rb_hash_aref(branches, key);
687 branch = setup_branch(loc,
type, branches, key);
697 ADD_TRACE_WITH_DATA(seq, RUBY_EVENT_COVERAGE_BRANCH, counter_idx);
698 ADD_SYNTHETIC_INSN(seq, loc->end_pos.lineno, node_id, nop);
701#define ISEQ_LAST_LINE(iseq) (ISEQ_COMPILE_DATA(iseq)->last_line)
704validate_label(st_data_t name, st_data_t label, st_data_t arg)
708 if (!lobj->link.next) {
710 COMPILE_ERROR(iseq, lobj->position,
711 "%"PRIsVALUE
": undefined label",
721 st_foreach(labels_table, validate_label, (st_data_t)iseq);
722 st_free_table(labels_table);
726get_nd_recv(
const NODE *node)
728 switch (nd_type(node)) {
730 return RNODE_CALL(node)->nd_recv;
732 return RNODE_OPCALL(node)->nd_recv;
736 return RNODE_QCALL(node)->nd_recv;
740 return RNODE_ATTRASGN(node)->nd_recv;
742 return RNODE_OP_ASGN1(node)->nd_recv;
744 return RNODE_OP_ASGN2(node)->nd_recv;
746 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(node)));
751get_node_call_nd_mid(
const NODE *node)
753 switch (nd_type(node)) {
755 return RNODE_CALL(node)->nd_mid;
757 return RNODE_OPCALL(node)->nd_mid;
759 return RNODE_FCALL(node)->nd_mid;
761 return RNODE_QCALL(node)->nd_mid;
763 return RNODE_VCALL(node)->nd_mid;
765 return RNODE_ATTRASGN(node)->nd_mid;
767 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(node)));
772get_nd_args(
const NODE *node)
774 switch (nd_type(node)) {
776 return RNODE_CALL(node)->nd_args;
778 return RNODE_OPCALL(node)->nd_args;
780 return RNODE_FCALL(node)->nd_args;
782 return RNODE_QCALL(node)->nd_args;
786 return RNODE_ATTRASGN(node)->nd_args;
788 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(node)));
793get_node_colon_nd_mid(
const NODE *node)
795 switch (nd_type(node)) {
797 return RNODE_COLON2(node)->nd_mid;
799 return RNODE_COLON3(node)->nd_mid;
801 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(node)));
806get_nd_vid(
const NODE *node)
808 switch (nd_type(node)) {
810 return RNODE_LASGN(node)->nd_vid;
812 return RNODE_DASGN(node)->nd_vid;
814 return RNODE_IASGN(node)->nd_vid;
816 return RNODE_CVASGN(node)->nd_vid;
818 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(node)));
823get_nd_value(
const NODE *node)
825 switch (nd_type(node)) {
827 return RNODE_LASGN(node)->nd_value;
829 return RNODE_DASGN(node)->nd_value;
831 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(node)));
836get_string_value(
const NODE *node)
838 switch (nd_type(node)) {
840 return rb_node_str_string_val(node);
842 return rb_node_file_path_val(node);
844 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(node)));
854 (*ifunc->func)(iseq, ret, ifunc->data);
856 ADD_SYNTHETIC_INSN(ret, ISEQ_COMPILE_DATA(iseq)->last_line, -1, leave);
858 CHECK(iseq_setup_insn(iseq, ret));
859 return iseq_setup(iseq, ret);
862static bool drop_unreachable_return(
LINK_ANCHOR *ret);
871 NO_CHECK(COMPILE(ret,
"nil", node));
872 iseq_set_local_table(iseq, 0, 0);
875 else if (nd_type_p(node, NODE_SCOPE)) {
877 iseq_set_local_table(iseq, RNODE_SCOPE(node)->nd_tbl, (
NODE *)RNODE_SCOPE(node)->nd_args);
878 iseq_set_arguments(iseq, ret, (
NODE *)RNODE_SCOPE(node)->nd_args);
880 switch (ISEQ_BODY(iseq)->
type) {
881 case ISEQ_TYPE_BLOCK:
883 LABEL *start = ISEQ_COMPILE_DATA(iseq)->start_label = NEW_LABEL(0);
884 LABEL *end = ISEQ_COMPILE_DATA(iseq)->end_label = NEW_LABEL(0);
886 start->rescued = LABEL_RESCUE_BEG;
887 end->rescued = LABEL_RESCUE_END;
890 ADD_SYNTHETIC_INSN(ret, ISEQ_BODY(iseq)->location.first_lineno, -1, nop);
891 ADD_LABEL(ret, start);
892 CHECK(COMPILE(ret,
"block body", RNODE_SCOPE(node)->nd_body));
895 ISEQ_COMPILE_DATA(iseq)->last_line = ISEQ_BODY(iseq)->location.code_location.end_pos.lineno;
898 ADD_CATCH_ENTRY(CATCH_TYPE_REDO, start, end, NULL, start);
899 ADD_CATCH_ENTRY(CATCH_TYPE_NEXT, start, end, NULL, end);
902 case ISEQ_TYPE_CLASS:
905 CHECK(COMPILE(ret,
"scoped node", RNODE_SCOPE(node)->nd_body));
907 ISEQ_COMPILE_DATA(iseq)->last_line = nd_line(node);
910 case ISEQ_TYPE_METHOD:
912 ISEQ_COMPILE_DATA(iseq)->root_node = RNODE_SCOPE(node)->nd_body;
914 CHECK(COMPILE(ret,
"scoped node", RNODE_SCOPE(node)->nd_body));
915 ISEQ_COMPILE_DATA(iseq)->root_node = RNODE_SCOPE(node)->nd_body;
917 ISEQ_COMPILE_DATA(iseq)->last_line = nd_line(node);
921 CHECK(COMPILE(ret,
"scoped node", RNODE_SCOPE(node)->nd_body));
928#define INVALID_ISEQ_TYPE(type) \
929 ISEQ_TYPE_##type: m = #type; goto invalid_iseq_type
930 switch (ISEQ_BODY(iseq)->
type) {
931 case INVALID_ISEQ_TYPE(
METHOD);
932 case INVALID_ISEQ_TYPE(CLASS);
933 case INVALID_ISEQ_TYPE(BLOCK);
934 case INVALID_ISEQ_TYPE(EVAL);
935 case INVALID_ISEQ_TYPE(MAIN);
936 case INVALID_ISEQ_TYPE(TOP);
937#undef INVALID_ISEQ_TYPE
938 case ISEQ_TYPE_RESCUE:
939 iseq_set_exception_local_table(iseq);
940 CHECK(COMPILE(ret,
"rescue", node));
942 case ISEQ_TYPE_ENSURE:
943 iseq_set_exception_local_table(iseq);
944 CHECK(COMPILE_POPPED(ret,
"ensure", node));
946 case ISEQ_TYPE_PLAIN:
947 CHECK(COMPILE(ret,
"ensure", node));
950 COMPILE_ERROR(ERROR_ARGS
"unknown scope: %d", ISEQ_BODY(iseq)->
type);
953 COMPILE_ERROR(ERROR_ARGS
"compile/ISEQ_TYPE_%s should not be reached", m);
958 if (ISEQ_BODY(iseq)->
type == ISEQ_TYPE_RESCUE || ISEQ_BODY(iseq)->
type == ISEQ_TYPE_ENSURE) {
959 NODE dummy_line_node = generate_dummy_line_node(0, -1);
960 ADD_GETLOCAL(ret, &dummy_line_node, LVAR_ERRINFO, 0);
961 ADD_INSN1(ret, &dummy_line_node,
throw,
INT2FIX(0) );
963 else if (!drop_unreachable_return(ret)) {
964 ADD_SYNTHETIC_INSN(ret, ISEQ_COMPILE_DATA(iseq)->last_line, -1, leave);
968 if (ISEQ_COMPILE_DATA(iseq)->labels_table) {
969 st_table *labels_table = ISEQ_COMPILE_DATA(iseq)->labels_table;
970 ISEQ_COMPILE_DATA(iseq)->labels_table = 0;
971 validate_labels(iseq, labels_table);
974 CHECK(iseq_setup_insn(iseq, ret));
975 return iseq_setup(iseq, ret);
979rb_iseq_translate_threaded_code(
rb_iseq_t *iseq)
981#if OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE
982 const void *
const *table = rb_vm_get_insns_address_table();
984 VALUE *encoded = (
VALUE *)ISEQ_BODY(iseq)->iseq_encoded;
986 for (i = 0; i < ISEQ_BODY(iseq)->iseq_size; ) {
987 int insn = (int)ISEQ_BODY(iseq)->iseq_encoded[i];
988 int len = insn_len(insn);
989 encoded[i] = (
VALUE)table[insn];
996 rb_yjit_live_iseq_count++;
997 rb_yjit_iseq_alloc_count++;
1004rb_iseq_original_iseq(
const rb_iseq_t *iseq)
1006 VALUE *original_code;
1008 if (ISEQ_ORIGINAL_ISEQ(iseq))
return ISEQ_ORIGINAL_ISEQ(iseq);
1009 original_code = ISEQ_ORIGINAL_ISEQ_ALLOC(iseq, ISEQ_BODY(iseq)->iseq_size);
1010 MEMCPY(original_code, ISEQ_BODY(iseq)->iseq_encoded,
VALUE, ISEQ_BODY(iseq)->iseq_size);
1012#if OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE
1016 for (i = 0; i < ISEQ_BODY(iseq)->iseq_size; ) {
1017 const void *addr = (
const void *)original_code[i];
1018 const int insn = rb_vm_insn_addr2insn(addr);
1020 original_code[i] = insn;
1021 i += insn_len(insn);
1025 return original_code;
1038#if defined(__sparc) && SIZEOF_VOIDP == 4 && defined(__GNUC__)
1039 #define STRICT_ALIGNMENT
1045#if defined(__OpenBSD__)
1046 #include <sys/endian.h>
1047 #ifdef __STRICT_ALIGNMENT
1048 #define STRICT_ALIGNMENT
1052#ifdef STRICT_ALIGNMENT
1053 #if defined(HAVE_TRUE_LONG_LONG) && SIZEOF_LONG_LONG > SIZEOF_VALUE
1054 #define ALIGNMENT_SIZE SIZEOF_LONG_LONG
1056 #define ALIGNMENT_SIZE SIZEOF_VALUE
1058 #define PADDING_SIZE_MAX ((size_t)((ALIGNMENT_SIZE) - 1))
1059 #define ALIGNMENT_SIZE_MASK PADDING_SIZE_MAX
1062 #define PADDING_SIZE_MAX 0
1065#ifdef STRICT_ALIGNMENT
1068calc_padding(
void *ptr,
size_t size)
1073 mis = (size_t)ptr & ALIGNMENT_SIZE_MASK;
1075 padding = ALIGNMENT_SIZE - mis;
1081#if ALIGNMENT_SIZE > SIZEOF_VALUE
1082 if (size ==
sizeof(
VALUE) && padding ==
sizeof(
VALUE)) {
1096#ifdef STRICT_ALIGNMENT
1097 size_t padding = calc_padding((
void *)&storage->buff[storage->pos], size);
1099 const size_t padding = 0;
1102 if (size >= INT_MAX - padding) rb_memerror();
1103 if (storage->pos + size + padding > storage->size) {
1104 unsigned int alloc_size = storage->size;
1106 while (alloc_size < size + PADDING_SIZE_MAX) {
1107 if (alloc_size >= INT_MAX / 2) rb_memerror();
1110 storage->next = (
void *)
ALLOC_N(
char, alloc_size +
1112 storage = *arena = storage->next;
1115 storage->size = alloc_size;
1116#ifdef STRICT_ALIGNMENT
1117 padding = calc_padding((
void *)&storage->buff[storage->pos], size);
1121#ifdef STRICT_ALIGNMENT
1122 storage->pos += (int)padding;
1125 ptr = (
void *)&storage->buff[storage->pos];
1126 storage->pos += (int)size;
1131compile_data_alloc(
rb_iseq_t *iseq,
size_t size)
1134 return compile_data_alloc_with_arena(arena, size);
1138compile_data_alloc2(
rb_iseq_t *iseq,
size_t x,
size_t y)
1141 return compile_data_alloc(iseq, size);
1145compile_data_calloc2(
rb_iseq_t *iseq,
size_t x,
size_t y)
1148 void *p = compile_data_alloc(iseq, size);
1157 return (
INSN *)compile_data_alloc_with_arena(arena,
sizeof(
INSN));
1161compile_data_alloc_label(
rb_iseq_t *iseq)
1163 return (
LABEL *)compile_data_alloc(iseq,
sizeof(
LABEL));
1167compile_data_alloc_adjust(
rb_iseq_t *iseq)
1169 return (
ADJUST *)compile_data_alloc(iseq,
sizeof(
ADJUST));
1173compile_data_alloc_trace(
rb_iseq_t *iseq)
1175 return (
TRACE *)compile_data_alloc(iseq,
sizeof(
TRACE));
1184 elem2->next = elem1->next;
1185 elem2->prev = elem1;
1186 elem1->next = elem2;
1188 elem2->next->prev = elem2;
1198 elem2->prev = elem1->prev;
1199 elem2->next = elem1;
1200 elem1->prev = elem2;
1202 elem2->prev->next = elem2;
1212 elem2->prev = elem1->prev;
1213 elem2->next = elem1->next;
1215 elem1->prev->next = elem2;
1218 elem1->next->prev = elem2;
1225 elem->prev->next = elem->next;
1227 elem->next->prev = elem->prev;
1234 return anchor->anchor.next;
1240 return anchor->last;
1247 switch (elem->type) {
1248 case ISEQ_ELEMENT_INSN:
1249 case ISEQ_ELEMENT_ADJUST:
1259LIST_INSN_SIZE_ONE(
const LINK_ANCHOR *
const anchor)
1261 LINK_ELEMENT *first_insn = ELEM_FIRST_INSN(FIRST_ELEMENT(anchor));
1262 if (first_insn != NULL &&
1263 ELEM_FIRST_INSN(first_insn->next) == NULL) {
1272LIST_INSN_SIZE_ZERO(
const LINK_ANCHOR *
const anchor)
1274 if (ELEM_FIRST_INSN(FIRST_ELEMENT(anchor)) == NULL) {
1292 if (anc2->anchor.next) {
1295 anc1->last->next = anc2->anchor.next;
1296 anc2->anchor.next->prev = anc1->last;
1297 anc1->last = anc2->last;
1302 verify_list(
"append", anc1);
1305#define APPEND_LIST(anc1, anc2) APPEND_LIST(iseq, (anc1), (anc2))
1314 printf(
"anch: %p, frst: %p, last: %p\n", (
void *)&anchor->anchor,
1315 (
void *)anchor->anchor.next, (
void *)anchor->last);
1317 printf(
"curr: %p, next: %p, prev: %p, type: %d\n", (
void *)list, (
void *)list->next,
1318 (
void *)list->prev, (
int)list->type);
1323 dump_disasm_list_with_cursor(anchor->anchor.next, cur, 0);
1324 verify_list(
"debug list", anchor);
1327#define debug_list(anc, cur) debug_list(iseq, (anc), (cur))
1330#define debug_list(anc, cur) ((void)0)
1336 TRACE *trace = compile_data_alloc_trace(iseq);
1338 trace->link.type = ISEQ_ELEMENT_TRACE;
1339 trace->link.next = NULL;
1340 trace->event = event;
1347new_label_body(
rb_iseq_t *iseq,
long line)
1349 LABEL *labelobj = compile_data_alloc_label(iseq);
1351 labelobj->link.type = ISEQ_ELEMENT_LABEL;
1352 labelobj->link.next = 0;
1354 labelobj->label_no = ISEQ_COMPILE_DATA(iseq)->label_no++;
1355 labelobj->sc_state = 0;
1357 labelobj->refcnt = 0;
1359 labelobj->rescued = LABEL_RESCUE_NONE;
1360 labelobj->unremovable = 0;
1361 labelobj->position = -1;
1368 ADJUST *adjust = compile_data_alloc_adjust(iseq);
1369 adjust->link.type = ISEQ_ELEMENT_ADJUST;
1370 adjust->link.next = 0;
1371 adjust->label = label;
1372 adjust->line_no = line;
1373 LABEL_UNREMOVABLE(label);
1380 const char *types = insn_op_types(insn->insn_id);
1381 for (
int j = 0; types[j]; j++) {
1382 char type = types[j];
1389 func(&OPERAND_AT(insn, j), data);
1398iseq_insn_each_object_write_barrier(
VALUE * obj,
VALUE iseq)
1404new_insn_core(
rb_iseq_t *iseq,
int line_no,
int node_id,
int insn_id,
int argc,
VALUE *argv)
1406 INSN *iobj = compile_data_alloc_insn(iseq);
1410 iobj->link.type = ISEQ_ELEMENT_INSN;
1411 iobj->link.next = 0;
1412 iobj->insn_id = insn_id;
1413 iobj->insn_info.line_no = line_no;
1414 iobj->insn_info.node_id = node_id;
1415 iobj->insn_info.events = 0;
1416 iobj->operands = argv;
1417 iobj->operand_size = argc;
1420 iseq_insn_each_markable_object(iobj, iseq_insn_each_object_write_barrier, (
VALUE)iseq);
1426new_insn_body(
rb_iseq_t *iseq,
int line_no,
int node_id,
enum ruby_vminsn_type insn_id,
int argc, ...)
1428 VALUE *operands = 0;
1432 va_start(argv, argc);
1433 operands = compile_data_alloc2(iseq,
sizeof(
VALUE), argc);
1434 for (i = 0; i < argc; i++) {
1440 return new_insn_core(iseq, line_no, node_id, insn_id, argc, operands);
1444insn_replace_with_operands(
rb_iseq_t *iseq,
INSN *iobj,
enum ruby_vminsn_type insn_id,
int argc, ...)
1446 VALUE *operands = 0;
1450 va_start(argv, argc);
1451 operands = compile_data_alloc2(iseq,
sizeof(
VALUE), argc);
1452 for (i = 0; i < argc; i++) {
1459 iobj->insn_id = insn_id;
1460 iobj->operand_size = argc;
1461 iobj->operands = operands;
1462 iseq_insn_each_markable_object(iobj, iseq_insn_each_object_write_barrier, (
VALUE)iseq);
1470 VM_ASSERT(argc >= 0);
1473 flag |= VM_CALL_KWARG;
1474 argc += kw_arg->keyword_len;
1477 if (!(flag & (VM_CALL_ARGS_SPLAT | VM_CALL_ARGS_BLOCKARG | VM_CALL_KWARG | VM_CALL_KW_SPLAT | VM_CALL_FORWARDING))
1478 && !has_blockiseq) {
1479 flag |= VM_CALL_ARGS_SIMPLE;
1482 ISEQ_BODY(iseq)->ci_size++;
1483 const struct rb_callinfo *ci = vm_ci_new(mid, flag, argc, kw_arg);
1491 VALUE *operands = compile_data_calloc2(iseq,
sizeof(
VALUE), 2);
1494 operands[1] = (
VALUE)blockiseq;
1501 if (vm_ci_flag((
struct rb_callinfo *)ci) & VM_CALL_FORWARDING) {
1502 insn = new_insn_core(iseq, line_no, node_id, BIN(sendforward), 2, operands);
1505 insn = new_insn_core(iseq, line_no, node_id, BIN(send), 2, operands);
1518 VALUE ast_value = rb_ruby_ast_new(node);
1520 debugs(
"[new_child_iseq]> ---------------------------------------\n");
1521 int isolated_depth = ISEQ_COMPILE_DATA(iseq)->isolated_depth;
1522 ret_iseq = rb_iseq_new_with_opt(ast_value, name,
1523 rb_iseq_path(iseq), rb_iseq_realpath(iseq),
1525 isolated_depth ? isolated_depth + 1 : 0,
1526 type, ISEQ_COMPILE_DATA(iseq)->option,
1527 ISEQ_BODY(iseq)->variable.script_lines);
1528 debugs(
"[new_child_iseq]< ---------------------------------------\n");
1538 debugs(
"[new_child_iseq_with_callback]> ---------------------------------------\n");
1539 ret_iseq = rb_iseq_new_with_callback(ifunc, name,
1540 rb_iseq_path(iseq), rb_iseq_realpath(iseq),
1541 line_no, parent,
type, ISEQ_COMPILE_DATA(iseq)->option);
1542 debugs(
"[new_child_iseq_with_callback]< ---------------------------------------\n");
1550 ISEQ_COMPILE_DATA(iseq)->catch_except_p =
true;
1551 if (ISEQ_BODY(iseq)->parent_iseq != NULL) {
1552 if (ISEQ_COMPILE_DATA(ISEQ_BODY(iseq)->parent_iseq)) {
1553 set_catch_except_p((
rb_iseq_t *) ISEQ_BODY(iseq)->parent_iseq);
1576 while (pos < body->iseq_size) {
1577 insn = rb_vm_insn_decode(body->iseq_encoded[pos]);
1578 if (insn == BIN(
throw)) {
1579 set_catch_except_p(iseq);
1582 pos += insn_len(insn);
1588 for (i = 0; i < ct->size; i++) {
1590 UNALIGNED_MEMBER_PTR(ct, entries[i]);
1591 if (entry->type != CATCH_TYPE_BREAK
1592 && entry->type != CATCH_TYPE_NEXT
1593 && entry->type != CATCH_TYPE_REDO) {
1595 ISEQ_COMPILE_DATA(iseq)->catch_except_p =
true;
1602iseq_insert_nop_between_end_and_cont(
rb_iseq_t *iseq)
1604 VALUE catch_table_ary = ISEQ_COMPILE_DATA(iseq)->catch_table_ary;
1605 if (
NIL_P(catch_table_ary))
return;
1606 unsigned int i, tlen = (
unsigned int)
RARRAY_LEN(catch_table_ary);
1608 for (i = 0; i < tlen; i++) {
1614 enum rb_catch_type ct = (
enum rb_catch_type)(ptr[0] & 0xffff);
1616 if (ct != CATCH_TYPE_BREAK
1617 && ct != CATCH_TYPE_NEXT
1618 && ct != CATCH_TYPE_REDO) {
1620 for (e = end; e && (IS_LABEL(e) || IS_TRACE(e)); e = e->next) {
1622 INSN *nop = new_insn_core(iseq, 0, -1, BIN(nop), 0, 0);
1623 ELEM_INSERT_NEXT(end, &nop->link);
1636 if (
RTEST(ISEQ_COMPILE_DATA(iseq)->err_info))
1641 if (compile_debug > 5)
1642 dump_disasm_list(FIRST_ELEMENT(anchor));
1644 debugs(
"[compile step 3.1 (iseq_optimize)]\n");
1645 iseq_optimize(iseq, anchor);
1647 if (compile_debug > 5)
1648 dump_disasm_list(FIRST_ELEMENT(anchor));
1650 if (ISEQ_COMPILE_DATA(iseq)->option->instructions_unification) {
1651 debugs(
"[compile step 3.2 (iseq_insns_unification)]\n");
1652 iseq_insns_unification(iseq, anchor);
1653 if (compile_debug > 5)
1654 dump_disasm_list(FIRST_ELEMENT(anchor));
1657 debugs(
"[compile step 3.4 (iseq_insert_nop_between_end_and_cont)]\n");
1658 iseq_insert_nop_between_end_and_cont(iseq);
1659 if (compile_debug > 5)
1660 dump_disasm_list(FIRST_ELEMENT(anchor));
1668 if (
RTEST(ISEQ_COMPILE_DATA(iseq)->err_info))
1671 debugs(
"[compile step 4.1 (iseq_set_sequence)]\n");
1672 if (!iseq_set_sequence(iseq, anchor))
return COMPILE_NG;
1673 if (compile_debug > 5)
1674 dump_disasm_list(FIRST_ELEMENT(anchor));
1676 debugs(
"[compile step 4.2 (iseq_set_exception_table)]\n");
1677 if (!iseq_set_exception_table(iseq))
return COMPILE_NG;
1679 debugs(
"[compile step 4.3 (set_optargs_table)] \n");
1680 if (!iseq_set_optargs_table(iseq))
return COMPILE_NG;
1682 debugs(
"[compile step 5 (iseq_translate_threaded_code)] \n");
1683 if (!rb_iseq_translate_threaded_code(iseq))
return COMPILE_NG;
1685 debugs(
"[compile step 6 (update_catch_except_flags)] \n");
1687 update_catch_except_flags(iseq, ISEQ_BODY(iseq));
1689 debugs(
"[compile step 6.1 (remove unused catch tables)] \n");
1691 if (!ISEQ_COMPILE_DATA(iseq)->catch_except_p && ISEQ_BODY(iseq)->catch_table) {
1692 xfree(ISEQ_BODY(iseq)->catch_table);
1693 ISEQ_BODY(iseq)->catch_table = NULL;
1696#if VM_INSN_INFO_TABLE_IMPL == 2
1697 if (ISEQ_BODY(iseq)->insns_info.succ_index_table == NULL) {
1698 debugs(
"[compile step 7 (rb_iseq_insns_info_encode_positions)] \n");
1699 rb_iseq_insns_info_encode_positions(iseq);
1703 if (compile_debug > 1) {
1704 VALUE str = rb_iseq_disasm(iseq);
1707 verify_call_cache(iseq);
1708 debugs(
"[compile step: finish]\n");
1714iseq_set_exception_local_table(
rb_iseq_t *iseq)
1716 ISEQ_BODY(iseq)->local_table_size = numberof(rb_iseq_shared_exc_local_tbl);
1717 ISEQ_BODY(iseq)->local_table = rb_iseq_shared_exc_local_tbl;
1725 while (iseq != ISEQ_BODY(iseq)->local_iseq) {
1727 iseq = ISEQ_BODY(iseq)->parent_iseq;
1733get_dyna_var_idx_at_raw(
const rb_iseq_t *iseq,
ID id)
1737 for (i = 0; i < ISEQ_BODY(iseq)->local_table_size; i++) {
1738 if (ISEQ_BODY(iseq)->local_table[i] == id) {
1748 int idx = get_dyna_var_idx_at_raw(ISEQ_BODY(iseq)->local_iseq,
id);
1751 COMPILE_ERROR(iseq, ISEQ_LAST_LINE(iseq),
1752 "get_local_var_idx: %d", idx);
1759get_dyna_var_idx(
const rb_iseq_t *iseq,
ID id,
int *level,
int *ls)
1761 int lv = 0, idx = -1;
1762 const rb_iseq_t *
const topmost_iseq = iseq;
1765 idx = get_dyna_var_idx_at_raw(iseq,
id);
1769 iseq = ISEQ_BODY(iseq)->parent_iseq;
1774 COMPILE_ERROR(topmost_iseq, ISEQ_LAST_LINE(topmost_iseq),
1775 "get_dyna_var_idx: -1");
1779 *ls = ISEQ_BODY(iseq)->local_table_size;
1784iseq_local_block_param_p(
const rb_iseq_t *iseq,
unsigned int idx,
unsigned int level)
1788 iseq = ISEQ_BODY(iseq)->parent_iseq;
1791 body = ISEQ_BODY(iseq);
1792 if (body->local_iseq == iseq &&
1793 body->
param.flags.has_block &&
1794 body->local_table_size - body->
param.block_start == idx) {
1803iseq_block_param_id_p(
const rb_iseq_t *iseq,
ID id,
int *pidx,
int *plevel)
1806 int idx = get_dyna_var_idx(iseq,
id, &level, &ls);
1807 if (iseq_local_block_param_p(iseq, ls - idx, level)) {
1818access_outer_variables(
const rb_iseq_t *iseq,
int level,
ID id,
bool write)
1820 int isolated_depth = ISEQ_COMPILE_DATA(iseq)->isolated_depth;
1822 if (isolated_depth && level >= isolated_depth) {
1823 if (
id == rb_intern(
"yield")) {
1824 COMPILE_ERROR(iseq, ISEQ_LAST_LINE(iseq),
"can not yield from isolated Proc");
1827 COMPILE_ERROR(iseq, ISEQ_LAST_LINE(iseq),
"can not access variable '%s' from isolated Proc", rb_id2name(
id));
1831 for (
int i=0; i<level; i++) {
1833 struct rb_id_table *ovs = ISEQ_BODY(iseq)->outer_variables;
1836 ovs = ISEQ_BODY(iseq)->outer_variables = rb_id_table_create(8);
1839 if (rb_id_table_lookup(ISEQ_BODY(iseq)->outer_variables,
id, &val)) {
1840 if (write && !val) {
1841 rb_id_table_insert(ISEQ_BODY(iseq)->outer_variables,
id,
Qtrue);
1845 rb_id_table_insert(ISEQ_BODY(iseq)->outer_variables,
id, RBOOL(write));
1848 iseq = ISEQ_BODY(iseq)->parent_iseq;
1853iseq_lvar_id(
const rb_iseq_t *iseq,
int idx,
int level)
1855 for (
int i=0; i<level; i++) {
1856 iseq = ISEQ_BODY(iseq)->parent_iseq;
1859 ID id = ISEQ_BODY(iseq)->local_table[ISEQ_BODY(iseq)->local_table_size - idx];
1867 if (iseq_local_block_param_p(iseq, idx, level)) {
1868 ADD_INSN2(seq, line_node, getblockparam,
INT2FIX((idx) + VM_ENV_DATA_SIZE - 1),
INT2FIX(level));
1871 ADD_INSN2(seq, line_node, getlocal,
INT2FIX((idx) + VM_ENV_DATA_SIZE - 1),
INT2FIX(level));
1873 if (level > 0) access_outer_variables(iseq, level, iseq_lvar_id(iseq, idx, level),
Qfalse);
1879 if (iseq_local_block_param_p(iseq, idx, level)) {
1880 ADD_INSN2(seq, line_node, setblockparam,
INT2FIX((idx) + VM_ENV_DATA_SIZE - 1),
INT2FIX(level));
1883 ADD_INSN2(seq, line_node, setlocal,
INT2FIX((idx) + VM_ENV_DATA_SIZE - 1),
INT2FIX(level));
1885 if (level > 0) access_outer_variables(iseq, level, iseq_lvar_id(iseq, idx, level),
Qtrue);
1894 if (body->
param.flags.has_opt ||
1895 body->
param.flags.has_post ||
1896 body->
param.flags.has_rest ||
1897 body->
param.flags.has_block ||
1898 body->
param.flags.has_kw ||
1899 body->
param.flags.has_kwrest) {
1901 if (body->
param.flags.has_block) {
1902 body->
param.size = body->
param.block_start + 1;
1904 else if (body->
param.flags.has_kwrest) {
1905 body->
param.size = body->
param.keyword->rest_start + 1;
1907 else if (body->
param.flags.has_kw) {
1908 body->
param.size = body->
param.keyword->bits_start + 1;
1910 else if (body->
param.flags.has_post) {
1913 else if (body->
param.flags.has_rest) {
1914 body->
param.size = body->
param.rest_start + 1;
1916 else if (body->
param.flags.has_opt) {
1934 struct rb_iseq_param_keyword *keyword;
1937 int kw = 0, rkw = 0, di = 0, i;
1939 body->
param.flags.has_kw = TRUE;
1940 body->
param.keyword = keyword =
ZALLOC_N(
struct rb_iseq_param_keyword, 1);
1944 node = node->nd_next;
1947 keyword->bits_start = arg_size++;
1949 node = args->kw_args;
1951 const NODE *val_node = get_nd_value(node->nd_body);
1954 if (val_node == NODE_SPECIAL_REQUIRED_KEYWORD) {
1958 switch (nd_type(val_node)) {
1960 dv = rb_node_sym_string_val(val_node);
1963 dv = rb_node_regx_string_val(val_node);
1966 dv = rb_node_line_lineno_val(val_node);
1969 dv = rb_node_integer_literal_val(val_node);
1972 dv = rb_node_float_literal_val(val_node);
1975 dv = rb_node_rational_literal_val(val_node);
1977 case NODE_IMAGINARY:
1978 dv = rb_node_imaginary_literal_val(val_node);
1981 dv = rb_node_encoding_val(val_node);
1993 NO_CHECK(COMPILE_POPPED(optargs,
"kwarg", RNODE(node)));
1997 keyword->num = ++di;
2001 node = node->nd_next;
2006 if (RNODE_DVAR(args->kw_rest_arg)->nd_vid != 0) {
2007 ID kw_id = ISEQ_BODY(iseq)->local_table[arg_size];
2008 keyword->rest_start = arg_size++;
2009 body->
param.flags.has_kwrest = TRUE;
2011 if (kw_id == idPow) body->
param.flags.anon_kwrest = TRUE;
2013 keyword->required_num = rkw;
2014 keyword->table = &body->local_table[keyword->bits_start - keyword->num];
2019 for (i = 0; i <
RARRAY_LEN(default_values); i++) {
2021 if (dv == complex_mark) dv =
Qundef;
2025 keyword->default_values = dvs;
2034 if (!body->
param.flags.use_block) {
2035 body->
param.flags.use_block = 1;
2040 st_data_t key = (st_data_t)rb_intern_str(body->location.label);
2041 set_insert(vm->unused_block_warning_table, key);
2049 debugs(
"iseq_set_arguments: %s\n", node_args ?
"" :
"0");
2053 struct rb_args_info *args = &RNODE_ARGS(node_args)->nd_ainfo;
2059 EXPECT_NODE(
"iseq_set_arguments", node_args, NODE_ARGS, COMPILE_NG);
2061 body->
param.flags.ruby2_keywords = args->ruby2_keywords;
2062 body->
param.lead_num = arg_size = (int)args->pre_args_num;
2063 if (body->
param.lead_num > 0) body->
param.flags.has_lead = TRUE;
2064 debugs(
" - argc: %d\n", body->
param.lead_num);
2066 rest_id = args->rest_arg;
2067 if (rest_id == NODE_SPECIAL_EXCESSIVE_COMMA) {
2071 block_id = args->block_arg;
2073 bool optimized_forward = (args->forwarding && args->pre_args_num == 0 && !args->opt_args);
2075 if (optimized_forward) {
2080 if (args->opt_args) {
2088 label = NEW_LABEL(nd_line(RNODE(node)));
2090 ADD_LABEL(optargs, label);
2091 NO_CHECK(COMPILE_POPPED(optargs,
"optarg", node->nd_body));
2092 node = node->nd_next;
2097 label = NEW_LABEL(nd_line(node_args));
2099 ADD_LABEL(optargs, label);
2104 for (j = 0; j < i+1; j++) {
2109 body->
param.flags.has_opt = TRUE;
2110 body->
param.opt_num = i;
2111 body->
param.opt_table = opt_table;
2116 body->
param.rest_start = arg_size++;
2117 body->
param.flags.has_rest = TRUE;
2118 if (rest_id ==
'*') body->
param.flags.anon_rest = TRUE;
2122 if (args->first_post_arg) {
2123 body->
param.post_start = arg_size;
2124 body->
param.post_num = args->post_args_num;
2125 body->
param.flags.has_post = TRUE;
2126 arg_size += args->post_args_num;
2128 if (body->
param.flags.has_rest) {
2129 body->
param.post_start = body->
param.rest_start + 1;
2133 if (args->kw_args) {
2134 arg_size = iseq_set_arguments_keywords(iseq, optargs, args, arg_size);
2136 else if (args->kw_rest_arg && !optimized_forward) {
2137 ID kw_id = ISEQ_BODY(iseq)->local_table[arg_size];
2138 struct rb_iseq_param_keyword *keyword =
ZALLOC_N(
struct rb_iseq_param_keyword, 1);
2139 keyword->rest_start = arg_size++;
2140 body->
param.keyword = keyword;
2141 body->
param.flags.has_kwrest = TRUE;
2143 static ID anon_kwrest = 0;
2144 if (!anon_kwrest) anon_kwrest = rb_intern(
"**");
2145 if (kw_id == anon_kwrest) body->
param.flags.anon_kwrest = TRUE;
2147 else if (args->no_kwarg) {
2148 body->
param.flags.accepts_no_kwarg = TRUE;
2152 body->
param.block_start = arg_size++;
2153 body->
param.flags.has_block = TRUE;
2154 iseq_set_use_block(iseq);
2158 if (optimized_forward) {
2159 body->
param.flags.use_block = 1;
2160 body->
param.flags.forwardable = TRUE;
2164 iseq_calc_param_size(iseq);
2165 body->
param.size = arg_size;
2167 if (args->pre_init) {
2168 NO_CHECK(COMPILE_POPPED(optargs,
"init arguments (m)", args->pre_init));
2170 if (args->post_init) {
2171 NO_CHECK(COMPILE_POPPED(optargs,
"init arguments (p)", args->post_init));
2174 if (body->type == ISEQ_TYPE_BLOCK) {
2175 if (body->
param.flags.has_opt == FALSE &&
2176 body->
param.flags.has_post == FALSE &&
2177 body->
param.flags.has_rest == FALSE &&
2178 body->
param.flags.has_kw == FALSE &&
2179 body->
param.flags.has_kwrest == FALSE) {
2181 if (body->
param.lead_num == 1 && last_comma == 0) {
2183 body->
param.flags.ambiguous_param0 = TRUE;
2195 unsigned int size = tbl ? tbl->size : 0;
2196 unsigned int offset = 0;
2199 struct rb_args_info *args = &RNODE_ARGS(node_args)->nd_ainfo;
2204 if (args->forwarding && args->pre_args_num == 0 && !args->opt_args) {
2213 MEMCPY(ids, tbl->ids + offset,
ID, size);
2214 ISEQ_BODY(iseq)->local_table = ids;
2216 ISEQ_BODY(iseq)->local_table_size = size;
2218 debugs(
"iseq_set_local_table: %u\n", ISEQ_BODY(iseq)->local_table_size);
2230 else if ((tlit = OBJ_BUILTIN_TYPE(lit)) == -1) {
2233 else if ((tval = OBJ_BUILTIN_TYPE(val)) == -1) {
2236 else if (tlit != tval) {
2246 long x =
FIX2LONG(rb_big_cmp(lit, val));
2254 return rb_float_cmp(lit, val);
2257 const struct RRational *rat1 = RRATIONAL(val);
2258 const struct RRational *rat2 = RRATIONAL(lit);
2259 return rb_iseq_cdhash_cmp(rat1->num, rat2->num) || rb_iseq_cdhash_cmp(rat1->den, rat2->den);
2262 const struct RComplex *comp1 = RCOMPLEX(val);
2263 const struct RComplex *comp2 = RCOMPLEX(lit);
2264 return rb_iseq_cdhash_cmp(comp1->real, comp2->real) || rb_iseq_cdhash_cmp(comp1->imag, comp2->imag);
2267 return rb_reg_equal(val, lit) ? 0 : -1;
2275rb_iseq_cdhash_hash(
VALUE a)
2277 switch (OBJ_BUILTIN_TYPE(a)) {
2280 return (st_index_t)a;
2288 return rb_rational_hash(a);
2290 return rb_complex_hash(a);
2300 rb_iseq_cdhash_hash,
2314 rb_hash_aset(data->hash, key,
INT2FIX(lobj->position - (data->pos+data->len)));
2322 return INT2FIX(ISEQ_BODY(iseq)->ivc_size++);
2329 struct rb_id_table *tbl = ISEQ_COMPILE_DATA(iseq)->ivar_cache_table;
2331 if (rb_id_table_lookup(tbl,
id,&val)) {
2336 tbl = rb_id_table_create(1);
2337 ISEQ_COMPILE_DATA(iseq)->ivar_cache_table = tbl;
2339 val =
INT2FIX(ISEQ_BODY(iseq)->icvarc_size++);
2340 rb_id_table_insert(tbl,
id,val);
2344#define BADINSN_DUMP(anchor, list, dest) \
2345 dump_disasm_list_with_cursor(FIRST_ELEMENT(anchor), list, dest)
2347#define BADINSN_ERROR \
2348 (xfree(generated_iseq), \
2349 xfree(insns_info), \
2350 BADINSN_DUMP(anchor, list, NULL), \
2356 int stack_max = 0, sp = 0, line = 0;
2359 for (list = FIRST_ELEMENT(anchor); list; list = list->next) {
2360 if (IS_LABEL(list)) {
2366 for (list = FIRST_ELEMENT(anchor); list; list = list->next) {
2367 switch (list->type) {
2368 case ISEQ_ELEMENT_INSN:
2376 sp = calc_sp_depth(sp, iobj);
2378 BADINSN_DUMP(anchor, list, NULL);
2379 COMPILE_ERROR(iseq, iobj->insn_info.line_no,
2380 "argument stack underflow (%d)", sp);
2383 if (sp > stack_max) {
2387 line = iobj->insn_info.line_no;
2389 operands = iobj->operands;
2390 insn = iobj->insn_id;
2391 types = insn_op_types(insn);
2392 len = insn_len(insn);
2395 if (iobj->operand_size !=
len - 1) {
2397 BADINSN_DUMP(anchor, list, NULL);
2398 COMPILE_ERROR(iseq, iobj->insn_info.line_no,
2399 "operand size miss! (%d for %d)",
2400 iobj->operand_size,
len - 1);
2404 for (j = 0; types[j]; j++) {
2405 if (types[j] == TS_OFFSET) {
2409 BADINSN_DUMP(anchor, list, NULL);
2410 COMPILE_ERROR(iseq, iobj->insn_info.line_no,
2411 "unknown label: "LABEL_FORMAT, lobj->label_no);
2414 if (lobj->sp == -1) {
2417 else if (lobj->sp != sp) {
2418 debugs(
"%s:%d: sp inconsistency found but ignored (" LABEL_FORMAT
" sp: %d, calculated sp: %d)\n",
2419 RSTRING_PTR(rb_iseq_path(iseq)), line,
2420 lobj->label_no, lobj->sp, sp);
2426 case ISEQ_ELEMENT_LABEL:
2429 if (lobj->sp == -1) {
2433 if (lobj->sp != sp) {
2434 debugs(
"%s:%d: sp inconsistency found but ignored (" LABEL_FORMAT
" sp: %d, calculated sp: %d)\n",
2435 RSTRING_PTR(rb_iseq_path(iseq)), line,
2436 lobj->label_no, lobj->sp, sp);
2442 case ISEQ_ELEMENT_TRACE:
2447 case ISEQ_ELEMENT_ADJUST:
2452 sp = adjust->label ? adjust->label->sp : 0;
2453 if (adjust->line_no != -1 && orig_sp - sp < 0) {
2454 BADINSN_DUMP(anchor, list, NULL);
2455 COMPILE_ERROR(iseq, adjust->line_no,
2456 "iseq_set_sequence: adjust bug %d < %d",
2463 BADINSN_DUMP(anchor, list, NULL);
2464 COMPILE_ERROR(iseq, line,
"unknown list type: %d", list->type);
2473 int insns_info_index,
int code_index,
const INSN *iobj)
2475 if (insns_info_index == 0 ||
2476 insns_info[insns_info_index-1].line_no != iobj->insn_info.line_no ||
2477#ifdef USE_ISEQ_NODE_ID
2478 insns_info[insns_info_index-1].node_id != iobj->insn_info.node_id ||
2480 insns_info[insns_info_index-1].events != iobj->insn_info.events) {
2481 insns_info[insns_info_index].line_no = iobj->insn_info.line_no;
2482#ifdef USE_ISEQ_NODE_ID
2483 insns_info[insns_info_index].node_id = iobj->insn_info.node_id;
2485 insns_info[insns_info_index].events = iobj->insn_info.events;
2486 positions[insns_info_index] = code_index;
2494 int insns_info_index,
int code_index,
const ADJUST *adjust)
2496 insns_info[insns_info_index].line_no = adjust->line_no;
2497 insns_info[insns_info_index].node_id = -1;
2498 insns_info[insns_info_index].events = 0;
2499 positions[insns_info_index] = code_index;
2504array_to_idlist(
VALUE arr)
2509 for (
long i = 0; i < size; i++) {
2518idlist_to_array(
const ID *ids)
2535 unsigned int *positions;
2537 VALUE *generated_iseq;
2541 int insn_num, code_index, insns_info_index, sp = 0;
2542 int stack_max = fix_sp_depth(iseq, anchor);
2544 if (stack_max < 0)
return COMPILE_NG;
2547 insn_num = code_index = 0;
2548 for (list = FIRST_ELEMENT(anchor); list; list = list->next) {
2549 switch (list->type) {
2550 case ISEQ_ELEMENT_INSN:
2554 sp = calc_sp_depth(sp, iobj);
2556 events = iobj->insn_info.events |= events;
2557 if (ISEQ_COVERAGE(iseq)) {
2558 if (ISEQ_LINE_COVERAGE(iseq) && (events & RUBY_EVENT_COVERAGE_LINE) &&
2559 !(rb_get_coverage_mode() & COVERAGE_TARGET_ONESHOT_LINES)) {
2560 int line = iobj->insn_info.line_no - 1;
2561 if (line >= 0 && line <
RARRAY_LEN(ISEQ_LINE_COVERAGE(iseq))) {
2565 if (ISEQ_BRANCH_COVERAGE(iseq) && (events & RUBY_EVENT_COVERAGE_BRANCH)) {
2566 while (
RARRAY_LEN(ISEQ_PC2BRANCHINDEX(iseq)) <= code_index) {
2572 code_index += insn_data_length(iobj);
2577 case ISEQ_ELEMENT_LABEL:
2580 lobj->position = code_index;
2581 if (lobj->sp != sp) {
2582 debugs(
"%s: sp inconsistency found but ignored (" LABEL_FORMAT
" sp: %d, calculated sp: %d)\n",
2583 RSTRING_PTR(rb_iseq_path(iseq)),
2584 lobj->label_no, lobj->sp, sp);
2589 case ISEQ_ELEMENT_TRACE:
2592 events |= trace->event;
2593 if (trace->event & RUBY_EVENT_COVERAGE_BRANCH) data = trace->data;
2596 case ISEQ_ELEMENT_ADJUST:
2599 if (adjust->line_no != -1) {
2601 sp = adjust->label ? adjust->label->sp : 0;
2602 if (orig_sp - sp > 0) {
2603 if (orig_sp - sp > 1) code_index++;
2617 positions =
ALLOC_N(
unsigned int, insn_num);
2618 if (ISEQ_IS_SIZE(body)) {
2622 body->is_entries = NULL;
2625 if (body->ci_size) {
2629 body->call_data = NULL;
2631 ISEQ_COMPILE_DATA(iseq)->ci_index = 0;
2638 iseq_bits_t * mark_offset_bits;
2639 int code_size = code_index;
2641 bool needs_bitmap =
false;
2643 if (ISEQ_MBITS_BUFLEN(code_index) == 1) {
2644 mark_offset_bits = &ISEQ_COMPILE_DATA(iseq)->mark_bits.single;
2645 ISEQ_COMPILE_DATA(iseq)->is_single_mark_bit =
true;
2648 mark_offset_bits =
ZALLOC_N(iseq_bits_t, ISEQ_MBITS_BUFLEN(code_index));
2649 ISEQ_COMPILE_DATA(iseq)->mark_bits.list = mark_offset_bits;
2650 ISEQ_COMPILE_DATA(iseq)->is_single_mark_bit =
false;
2653 ISEQ_COMPILE_DATA(iseq)->iseq_encoded = (
void *)generated_iseq;
2654 ISEQ_COMPILE_DATA(iseq)->iseq_size = code_index;
2656 list = FIRST_ELEMENT(anchor);
2657 insns_info_index = code_index = sp = 0;
2660 switch (list->type) {
2661 case ISEQ_ELEMENT_INSN:
2669 sp = calc_sp_depth(sp, iobj);
2671 operands = iobj->operands;
2672 insn = iobj->insn_id;
2673 generated_iseq[code_index] = insn;
2674 types = insn_op_types(insn);
2675 len = insn_len(insn);
2677 for (j = 0; types[j]; j++) {
2678 char type = types[j];
2686 generated_iseq[code_index + 1 + j] = lobj->position - (code_index +
len);
2691 VALUE map = operands[j];
2694 data.pos = code_index;
2698 rb_hash_rehash(map);
2699 freeze_hide_obj(map);
2700 generated_iseq[code_index + 1 + j] = map;
2701 ISEQ_MBITS_SET(mark_offset_bits, code_index + 1 + j);
2703 needs_bitmap =
true;
2708 generated_iseq[code_index + 1 + j] =
FIX2INT(operands[j]);
2713 VALUE v = operands[j];
2714 generated_iseq[code_index + 1 + j] = v;
2718 ISEQ_MBITS_SET(mark_offset_bits, code_index + 1 + j);
2719 needs_bitmap =
true;
2726 unsigned int ic_index = ISEQ_COMPILE_DATA(iseq)->ic_index++;
2727 IC ic = &ISEQ_IS_ENTRY_START(body,
type)[ic_index].ic_cache;
2728 if (UNLIKELY(ic_index >= body->ic_size)) {
2729 BADINSN_DUMP(anchor, &iobj->link, 0);
2730 COMPILE_ERROR(iseq, iobj->insn_info.line_no,
2731 "iseq_set_sequence: ic_index overflow: index: %d, size: %d",
2732 ic_index, ISEQ_IS_SIZE(body));
2735 ic->
segments = array_to_idlist(operands[j]);
2737 generated_iseq[code_index + 1 + j] = (
VALUE)ic;
2742 unsigned int ic_index =
FIX2UINT(operands[j]);
2744 IVC cache = ((
IVC)&body->is_entries[ic_index]);
2746 if (insn == BIN(setinstancevariable)) {
2747 cache->iv_set_name =
SYM2ID(operands[j - 1]);
2750 cache->iv_set_name = 0;
2753 vm_ic_attr_index_initialize(cache, INVALID_SHAPE_ID);
2758 unsigned int ic_index =
FIX2UINT(operands[j]);
2759 IC ic = &ISEQ_IS_ENTRY_START(body,
type)[ic_index].ic_cache;
2760 if (UNLIKELY(ic_index >= ISEQ_IS_SIZE(body))) {
2761 BADINSN_DUMP(anchor, &iobj->link, 0);
2762 COMPILE_ERROR(iseq, iobj->insn_info.line_no,
2763 "iseq_set_sequence: ic_index overflow: index: %d, size: %d",
2764 ic_index, ISEQ_IS_SIZE(body));
2766 generated_iseq[code_index + 1 + j] = (
VALUE)ic;
2773 RUBY_ASSERT(ISEQ_COMPILE_DATA(iseq)->ci_index <= body->ci_size);
2774 struct rb_call_data *cd = &body->call_data[ISEQ_COMPILE_DATA(iseq)->ci_index++];
2776 cd->cc = vm_cc_empty();
2777 generated_iseq[code_index + 1 + j] = (
VALUE)cd;
2781 generated_iseq[code_index + 1 + j] =
SYM2ID(operands[j]);
2784 generated_iseq[code_index + 1 + j] = operands[j];
2787 generated_iseq[code_index + 1 + j] = operands[j];
2790 BADINSN_ERROR(iseq, iobj->insn_info.line_no,
2791 "unknown operand type: %c",
type);
2795 if (add_insn_info(insns_info, positions, insns_info_index, code_index, iobj)) insns_info_index++;
2799 case ISEQ_ELEMENT_LABEL:
2802 if (lobj->sp != sp) {
2803 debugs(
"%s: sp inconsistency found but ignored (" LABEL_FORMAT
" sp: %d, calculated sp: %d)\n",
2804 RSTRING_PTR(rb_iseq_path(iseq)),
2805 lobj->label_no, lobj->sp, sp);
2810 case ISEQ_ELEMENT_ADJUST:
2815 if (adjust->label) {
2816 sp = adjust->label->sp;
2822 if (adjust->line_no != -1) {
2823 const int diff = orig_sp - sp;
2825 if (insns_info_index == 0) {
2826 COMPILE_ERROR(iseq, adjust->line_no,
2827 "iseq_set_sequence: adjust bug (ISEQ_ELEMENT_ADJUST must not be the first in iseq)");
2829 if (add_adjust_info(insns_info, positions, insns_info_index, code_index, adjust)) insns_info_index++;
2832 generated_iseq[code_index++] = BIN(adjuststack);
2833 generated_iseq[code_index++] = orig_sp - sp;
2835 else if (diff == 1) {
2836 generated_iseq[code_index++] = BIN(pop);
2838 else if (diff < 0) {
2839 int label_no = adjust->label ? adjust->label->label_no : -1;
2840 xfree(generated_iseq);
2843 if (ISEQ_MBITS_BUFLEN(code_size) > 1) {
2844 xfree(mark_offset_bits);
2846 debug_list(anchor, list);
2847 COMPILE_ERROR(iseq, adjust->line_no,
2848 "iseq_set_sequence: adjust bug to %d %d < %d",
2849 label_no, orig_sp, sp);
2862 body->iseq_encoded = (
void *)generated_iseq;
2863 body->iseq_size = code_index;
2864 body->stack_max = stack_max;
2866 if (ISEQ_COMPILE_DATA(iseq)->is_single_mark_bit) {
2867 body->mark_bits.single = ISEQ_COMPILE_DATA(iseq)->mark_bits.single;
2871 body->mark_bits.list = mark_offset_bits;
2874 body->mark_bits.list = NULL;
2875 ISEQ_COMPILE_DATA(iseq)->mark_bits.list = NULL;
2876 ruby_xfree(mark_offset_bits);
2881 body->insns_info.body = insns_info;
2882 body->insns_info.positions = positions;
2885 body->insns_info.body = insns_info;
2886 REALLOC_N(positions,
unsigned int, insns_info_index);
2887 body->insns_info.positions = positions;
2888 body->insns_info.size = insns_info_index;
2894label_get_position(
LABEL *lobj)
2896 return lobj->position;
2900label_get_sp(
LABEL *lobj)
2906iseq_set_exception_table(
rb_iseq_t *iseq)
2908 const VALUE *tptr, *ptr;
2909 unsigned int tlen, i;
2912 ISEQ_BODY(iseq)->catch_table = NULL;
2914 VALUE catch_table_ary = ISEQ_COMPILE_DATA(iseq)->catch_table_ary;
2915 if (
NIL_P(catch_table_ary))
return COMPILE_OK;
2923 for (i = 0; i < table->size; i++) {
2926 entry = UNALIGNED_MEMBER_PTR(table, entries[i]);
2927 entry->type = (
enum rb_catch_type)(ptr[0] & 0xffff);
2928 pos = label_get_position((
LABEL *)(ptr[1] & ~1));
2930 entry->start = (
unsigned int)pos;
2931 pos = label_get_position((
LABEL *)(ptr[2] & ~1));
2933 entry->end = (
unsigned int)pos;
2940 entry->cont = label_get_position(lobj);
2941 entry->sp = label_get_sp(lobj);
2944 if (entry->type == CATCH_TYPE_RESCUE ||
2945 entry->type == CATCH_TYPE_BREAK ||
2946 entry->type == CATCH_TYPE_NEXT) {
2955 ISEQ_BODY(iseq)->catch_table = table;
2956 RB_OBJ_WRITE(iseq, &ISEQ_COMPILE_DATA(iseq)->catch_table_ary, 0);
2977 VALUE *opt_table = (
VALUE *)ISEQ_BODY(iseq)->param.opt_table;
2979 if (ISEQ_BODY(iseq)->param.flags.has_opt) {
2980 for (i = 0; i < ISEQ_BODY(iseq)->param.opt_num + 1; i++) {
2981 opt_table[i] = label_get_position((
LABEL *)opt_table[i]);
2988get_destination_insn(
INSN *iobj)
2994 list = lobj->link.next;
2996 switch (list->type) {
2997 case ISEQ_ELEMENT_INSN:
2998 case ISEQ_ELEMENT_ADJUST:
3000 case ISEQ_ELEMENT_LABEL:
3003 case ISEQ_ELEMENT_TRACE:
3006 events |= trace->event;
3014 if (list && IS_INSN(list)) {
3016 iobj->insn_info.events |= events;
3022get_next_insn(
INSN *iobj)
3027 if (IS_INSN(list) || IS_ADJUST(list)) {
3036get_prev_insn(
INSN *iobj)
3041 if (IS_INSN(list) || IS_ADJUST(list)) {
3050unref_destination(
INSN *iobj,
int pos)
3052 LABEL *lobj = (
LABEL *)OPERAND_AT(iobj, pos);
3054 if (!lobj->refcnt) ELEM_REMOVE(&lobj->link);
3058replace_destination(
INSN *dobj,
INSN *nobj)
3060 VALUE n = OPERAND_AT(nobj, 0);
3063 if (dl == nl)
return false;
3066 OPERAND_AT(dobj, 0) = n;
3067 if (!dl->refcnt) ELEM_REMOVE(&dl->link);
3072find_destination(
INSN *i)
3074 int pos,
len = insn_len(i->insn_id);
3075 for (pos = 0; pos <
len; ++pos) {
3076 if (insn_op_types(i->insn_id)[pos] == TS_OFFSET) {
3077 return (
LABEL *)OPERAND_AT(i, pos);
3087 int *unref_counts = 0, nlabels = ISEQ_COMPILE_DATA(iseq)->label_no;
3090 unref_counts =
ALLOCA_N(
int, nlabels);
3091 MEMZERO(unref_counts,
int, nlabels);
3096 if (IS_INSN_ID(i, leave)) {
3100 else if ((lab = find_destination((
INSN *)i)) != 0) {
3101 unref_counts[lab->label_no]++;
3104 else if (IS_LABEL(i)) {
3106 if (lab->unremovable)
return 0;
3107 if (lab->refcnt > unref_counts[lab->label_no]) {
3108 if (i == first)
return 0;
3113 else if (IS_TRACE(i)) {
3116 else if (IS_ADJUST(i)) {
3120 }
while ((i = i->next) != 0);
3125 VALUE insn = INSN_OF(i);
3126 int pos,
len = insn_len(insn);
3127 for (pos = 0; pos <
len; ++pos) {
3128 switch (insn_op_types(insn)[pos]) {
3130 unref_destination((
INSN *)i, pos);
3139 }
while ((i != end) && (i = i->next) != 0);
3146 switch (OPERAND_AT(iobj, 0)) {
3148 ELEM_REMOVE(&iobj->link);
3151 ELEM_REMOVE(&iobj->link);
3154 iobj->insn_id = BIN(adjuststack);
3160is_frozen_putstring(
INSN *insn,
VALUE *op)
3162 if (IS_INSN_ID(insn, putstring) || IS_INSN_ID(insn, putchilledstring)) {
3163 *op = OPERAND_AT(insn, 0);
3166 else if (IS_INSN_ID(insn, putobject)) {
3167 *op = OPERAND_AT(insn, 0);
3198 INSN *niobj, *ciobj, *dup = 0;
3202 switch (INSN_OF(iobj)) {
3203 case BIN(putstring):
3204 case BIN(putchilledstring):
3210 case BIN(putobject):
3213 default:
return FALSE;
3216 ciobj = (
INSN *)get_next_insn(iobj);
3217 if (IS_INSN_ID(ciobj, jump)) {
3218 ciobj = (
INSN *)get_next_insn((
INSN*)OPERAND_AT(ciobj, 0));
3220 if (IS_INSN_ID(ciobj, dup)) {
3221 ciobj = (
INSN *)get_next_insn(dup = ciobj);
3223 if (!ciobj || !IS_INSN_ID(ciobj, checktype))
return FALSE;
3224 niobj = (
INSN *)get_next_insn(ciobj);
3229 switch (INSN_OF(niobj)) {
3231 if (OPERAND_AT(ciobj, 0) ==
type) {
3232 dest = (
LABEL *)OPERAND_AT(niobj, 0);
3235 case BIN(branchunless):
3236 if (OPERAND_AT(ciobj, 0) !=
type) {
3237 dest = (
LABEL *)OPERAND_AT(niobj, 0);
3243 line = ciobj->insn_info.line_no;
3244 node_id = ciobj->insn_info.node_id;
3246 if (niobj->link.next && IS_LABEL(niobj->link.next)) {
3247 dest = (
LABEL *)niobj->link.next;
3250 dest = NEW_LABEL(line);
3251 ELEM_INSERT_NEXT(&niobj->link, &dest->link);
3254 INSERT_AFTER_INSN1(iobj, line, node_id, jump, dest);
3256 if (!dup) INSERT_AFTER_INSN(iobj, line, node_id, pop);
3263 const struct rb_callinfo *nci = vm_ci_new(vm_ci_mid(ci),
3264 vm_ci_flag(ci) | add,
3274 const struct rb_callinfo *nci = vm_ci_new(vm_ci_mid(ci),
3282#define vm_ci_simple(ci) (vm_ci_flag(ci) & VM_CALL_ARGS_SIMPLE)
3290 optimize_checktype(iseq, iobj);
3292 if (IS_INSN_ID(iobj, jump)) {
3293 INSN *niobj, *diobj, *piobj;
3294 diobj = (
INSN *)get_destination_insn(iobj);
3295 niobj = (
INSN *)get_next_insn(iobj);
3297 if (diobj == niobj) {
3304 unref_destination(iobj, 0);
3305 ELEM_REMOVE(&iobj->link);
3308 else if (iobj != diobj && IS_INSN(&diobj->link) &&
3309 IS_INSN_ID(diobj, jump) &&
3310 OPERAND_AT(iobj, 0) != OPERAND_AT(diobj, 0) &&
3311 diobj->insn_info.events == 0) {
3322 if (replace_destination(iobj, diobj)) {
3323 remove_unreachable_chunk(iseq, iobj->link.next);
3327 else if (IS_INSN_ID(diobj, leave)) {
3340 unref_destination(iobj, 0);
3341 iobj->insn_id = BIN(leave);
3342 iobj->operand_size = 0;
3343 iobj->insn_info = diobj->insn_info;
3346 else if (IS_INSN(iobj->link.prev) &&
3347 (piobj = (
INSN *)iobj->link.prev) &&
3348 (IS_INSN_ID(piobj, branchif) ||
3349 IS_INSN_ID(piobj, branchunless))) {
3350 INSN *pdiobj = (
INSN *)get_destination_insn(piobj);
3351 if (niobj == pdiobj) {
3352 int refcnt = IS_LABEL(piobj->link.next) ?
3353 ((
LABEL *)piobj->link.next)->refcnt : 0;
3368 piobj->insn_id = (IS_INSN_ID(piobj, branchif))
3369 ? BIN(branchunless) : BIN(branchif);
3370 if (replace_destination(piobj, iobj) && refcnt <= 1) {
3371 ELEM_REMOVE(&iobj->link);
3378 else if (diobj == pdiobj) {
3392 INSN *popiobj = new_insn_core(iseq, iobj->insn_info.line_no, iobj->insn_info.node_id, BIN(pop), 0, 0);
3393 ELEM_REPLACE(&piobj->link, &popiobj->link);
3396 if (remove_unreachable_chunk(iseq, iobj->link.next)) {
3410 if (IS_INSN_ID(iobj, newrange)) {
3411 INSN *
const range = iobj;
3413 VALUE str_beg, str_end;
3415 if ((end = (
INSN *)get_prev_insn(range)) != 0 &&
3416 is_frozen_putstring(end, &str_end) &&
3417 (beg = (
INSN *)get_prev_insn(end)) != 0 &&
3418 is_frozen_putstring(beg, &str_beg)) {
3419 int excl =
FIX2INT(OPERAND_AT(range, 0));
3422 ELEM_REMOVE(&beg->link);
3423 ELEM_REMOVE(&end->link);
3424 range->insn_id = BIN(putobject);
3425 OPERAND_AT(range, 0) = lit_range;
3430 if (IS_INSN_ID(iobj, leave)) {
3431 remove_unreachable_chunk(iseq, iobj->link.next);
3443 if (IS_INSN_ID(iobj, duparray)) {
3445 if (IS_INSN(next) && (IS_INSN_ID(next, concatarray) || IS_INSN_ID(next, concattoarray))) {
3446 iobj->insn_id = BIN(putobject);
3456 if (IS_INSN_ID(iobj, duparray)) {
3458 if (IS_INSN(next) && (IS_INSN_ID(next, send))) {
3462 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 0 && blockiseq == NULL && vm_ci_mid(ci) == idFreeze) {
3463 VALUE ary = iobj->operands[0];
3466 insn_replace_with_operands(iseq, iobj, BIN(opt_ary_freeze), 2, ary, (
VALUE)ci);
3478 if (IS_INSN_ID(iobj, duphash)) {
3480 if (IS_INSN(next) && (IS_INSN_ID(next, send))) {
3484 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 0 && blockiseq == NULL && vm_ci_mid(ci) == idFreeze) {
3485 VALUE hash = iobj->operands[0];
3488 insn_replace_with_operands(iseq, iobj, BIN(opt_hash_freeze), 2, hash, (
VALUE)ci);
3500 if (IS_INSN_ID(iobj, newarray) && iobj->operands[0] ==
INT2FIX(0)) {
3502 if (IS_INSN(next) && (IS_INSN_ID(next, send))) {
3506 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 0 && blockiseq == NULL && vm_ci_mid(ci) == idFreeze) {
3507 insn_replace_with_operands(iseq, iobj, BIN(opt_ary_freeze), 2, rb_cArray_empty_frozen, (
VALUE)ci);
3519 if (IS_INSN_ID(iobj, newhash) && iobj->operands[0] ==
INT2FIX(0)) {
3521 if (IS_INSN(next) && (IS_INSN_ID(next, send))) {
3525 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 0 && blockiseq == NULL && vm_ci_mid(ci) == idFreeze) {
3526 insn_replace_with_operands(iseq, iobj, BIN(opt_hash_freeze), 2, rb_cHash_empty_frozen, (
VALUE)ci);
3532 if (IS_INSN_ID(iobj, branchif) ||
3533 IS_INSN_ID(iobj, branchnil) ||
3534 IS_INSN_ID(iobj, branchunless)) {
3543 INSN *nobj = (
INSN *)get_destination_insn(iobj);
3565 int stop_optimization =
3566 ISEQ_COVERAGE(iseq) && ISEQ_LINE_COVERAGE(iseq) &&
3567 nobj->link.type == ISEQ_ELEMENT_INSN &&
3568 nobj->insn_info.events;
3569 if (!stop_optimization) {
3570 INSN *pobj = (
INSN *)iobj->link.prev;
3573 if (!IS_INSN(&pobj->link))
3575 else if (IS_INSN_ID(pobj, dup))
3580 if (IS_INSN(&nobj->link) && IS_INSN_ID(nobj, jump)) {
3581 if (!replace_destination(iobj, nobj))
break;
3583 else if (prev_dup && IS_INSN_ID(nobj, dup) &&
3584 !!(nobj = (
INSN *)nobj->link.next) &&
3586 nobj->insn_id == iobj->insn_id) {
3602 if (!replace_destination(iobj, nobj))
break;
3630 if (prev_dup && IS_INSN(pobj->link.prev)) {
3631 pobj = (
INSN *)pobj->link.prev;
3633 if (IS_INSN_ID(pobj, putobject)) {
3634 cond = (IS_INSN_ID(iobj, branchif) ?
3635 OPERAND_AT(pobj, 0) !=
Qfalse :
3636 IS_INSN_ID(iobj, branchunless) ?
3637 OPERAND_AT(pobj, 0) ==
Qfalse :
3640 else if (IS_INSN_ID(pobj, putstring) ||
3641 IS_INSN_ID(pobj, duparray) ||
3642 IS_INSN_ID(pobj, newarray)) {
3643 cond = IS_INSN_ID(iobj, branchif);
3645 else if (IS_INSN_ID(pobj, putnil)) {
3646 cond = !IS_INSN_ID(iobj, branchif);
3649 if (prev_dup || !IS_INSN_ID(pobj, newarray)) {
3650 ELEM_REMOVE(iobj->link.prev);
3652 else if (!iseq_pop_newarray(iseq, pobj)) {
3653 pobj = new_insn_core(iseq, pobj->insn_info.line_no, pobj->insn_info.node_id, BIN(pop), 0, NULL);
3654 ELEM_INSERT_PREV(&iobj->link, &pobj->link);
3658 pobj = new_insn_core(iseq, pobj->insn_info.line_no, pobj->insn_info.node_id, BIN(putnil), 0, NULL);
3659 ELEM_INSERT_NEXT(&iobj->link, &pobj->link);
3661 iobj->insn_id = BIN(jump);
3665 unref_destination(iobj, 0);
3666 ELEM_REMOVE(&iobj->link);
3671 nobj = (
INSN *)get_destination_insn(nobj);
3676 if (IS_INSN_ID(iobj, pop)) {
3684 if (IS_INSN(prev)) {
3685 enum ruby_vminsn_type previ = ((
INSN *)prev)->insn_id;
3686 if (previ == BIN(putobject) || previ == BIN(putnil) ||
3687 previ == BIN(putself) || previ == BIN(putstring) ||
3688 previ == BIN(putchilledstring) ||
3689 previ == BIN(dup) ||
3690 previ == BIN(getlocal) ||
3691 previ == BIN(getblockparam) ||
3692 previ == BIN(getblockparamproxy) ||
3693 previ == BIN(getinstancevariable) ||
3694 previ == BIN(duparray)) {
3698 ELEM_REMOVE(&iobj->link);
3700 else if (previ == BIN(newarray) && iseq_pop_newarray(iseq, (
INSN*)prev)) {
3701 ELEM_REMOVE(&iobj->link);
3703 else if (previ == BIN(concatarray)) {
3705 INSERT_BEFORE_INSN1(piobj, piobj->insn_info.line_no, piobj->insn_info.node_id, splatarray,
Qfalse);
3706 INSN_OF(piobj) = BIN(pop);
3708 else if (previ == BIN(concatstrings)) {
3709 if (OPERAND_AT(prev, 0) ==
INT2FIX(1)) {
3713 ELEM_REMOVE(&iobj->link);
3714 INSN_OF(prev) = BIN(adjuststack);
3720 if (IS_INSN_ID(iobj, newarray) ||
3721 IS_INSN_ID(iobj, duparray) ||
3722 IS_INSN_ID(iobj, concatarray) ||
3723 IS_INSN_ID(iobj, splatarray) ||
3733 if (IS_INSN(next) && IS_INSN_ID(next, splatarray)) {
3739 if (IS_INSN_ID(iobj, newarray)) {
3741 if (IS_INSN(next) && IS_INSN_ID(next, expandarray) &&
3742 OPERAND_AT(next, 1) ==
INT2FIX(0)) {
3744 op1 = OPERAND_AT(iobj, 0);
3745 op2 = OPERAND_AT(next, 0);
3756 INSN_OF(iobj) = BIN(swap);
3757 iobj->operand_size = 0;
3766 INSN_OF(iobj) = BIN(opt_reverse);
3771 INSN_OF(iobj) = BIN(opt_reverse);
3772 OPERAND_AT(iobj, 0) = OPERAND_AT(next, 0);
3782 for (; diff > 0; diff--) {
3783 INSERT_BEFORE_INSN(iobj, iobj->insn_info.line_no, iobj->insn_info.node_id, pop);
3794 for (; diff < 0; diff++) {
3795 INSERT_BEFORE_INSN(iobj, iobj->insn_info.line_no, iobj->insn_info.node_id, putnil);
3802 if (IS_INSN_ID(iobj, duparray)) {
3811 if (IS_INSN(next) && IS_INSN_ID(next, expandarray)) {
3812 INSN_OF(iobj) = BIN(putobject);
3816 if (IS_INSN_ID(iobj, anytostring)) {
3824 if (IS_INSN(next) && IS_INSN_ID(next, concatstrings) &&
3825 OPERAND_AT(next, 0) ==
INT2FIX(1)) {
3830 if (IS_INSN_ID(iobj, putstring) || IS_INSN_ID(iobj, putchilledstring) ||
3838 if (IS_NEXT_INSN_ID(&iobj->link, concatstrings) &&
3839 RSTRING_LEN(OPERAND_AT(iobj, 0)) == 0) {
3840 INSN *next = (
INSN *)iobj->link.next;
3841 if ((OPERAND_AT(next, 0) = FIXNUM_INC(OPERAND_AT(next, 0), -1)) ==
INT2FIX(1)) {
3842 ELEM_REMOVE(&next->link);
3844 ELEM_REMOVE(&iobj->link);
3846 if (IS_NEXT_INSN_ID(&iobj->link, toregexp)) {
3847 INSN *next = (
INSN *)iobj->link.next;
3848 if (OPERAND_AT(next, 1) ==
INT2FIX(1)) {
3849 VALUE src = OPERAND_AT(iobj, 0);
3850 int opt = (int)
FIX2LONG(OPERAND_AT(next, 0));
3851 VALUE path = rb_iseq_path(iseq);
3852 int line = iobj->insn_info.line_no;
3853 VALUE errinfo = rb_errinfo();
3854 VALUE re = rb_reg_compile(src, opt, RSTRING_PTR(path), line);
3856 VALUE message = rb_attr_get(rb_errinfo(), idMesg);
3857 rb_set_errinfo(errinfo);
3858 COMPILE_ERROR(iseq, line,
"%" PRIsVALUE, message);
3861 ELEM_REMOVE(iobj->link.next);
3866 if (IS_INSN_ID(iobj, concatstrings)) {
3875 if (IS_INSN(next) && IS_INSN_ID(next, jump))
3876 next = get_destination_insn(jump = (
INSN *)next);
3877 if (IS_INSN(next) && IS_INSN_ID(next, concatstrings)) {
3878 int n =
FIX2INT(OPERAND_AT(iobj, 0)) +
FIX2INT(OPERAND_AT(next, 0)) - 1;
3879 OPERAND_AT(iobj, 0) =
INT2FIX(n);
3881 LABEL *label = ((
LABEL *)OPERAND_AT(jump, 0));
3882 if (!--label->refcnt) {
3883 ELEM_REMOVE(&label->link);
3886 label = NEW_LABEL(0);
3887 OPERAND_AT(jump, 0) = (
VALUE)label;
3890 ELEM_INSERT_NEXT(next, &label->link);
3891 CHECK(iseq_peephole_optimize(iseq, get_next_insn(jump), do_tailcallopt));
3899 if (do_tailcallopt &&
3900 (IS_INSN_ID(iobj, send) ||
3901 IS_INSN_ID(iobj, invokesuper))) {
3910 if (iobj->link.next) {
3913 if (!IS_INSN(next)) {
3917 switch (INSN_OF(next)) {
3926 next = get_destination_insn((
INSN *)next);
3940 if (IS_INSN_ID(piobj, send) ||
3941 IS_INSN_ID(piobj, invokesuper)) {
3942 if (OPERAND_AT(piobj, 1) == 0) {
3943 ci = ci_flag_set(iseq, ci, VM_CALL_TAILCALL);
3944 OPERAND_AT(piobj, 0) = (
VALUE)ci;
3949 ci = ci_flag_set(iseq, ci, VM_CALL_TAILCALL);
3950 OPERAND_AT(piobj, 0) = (
VALUE)ci;
3956 if (IS_INSN_ID(iobj, dup)) {
3957 if (IS_NEXT_INSN_ID(&iobj->link, setlocal)) {
3968 if (IS_NEXT_INSN_ID(set1, setlocal)) {
3970 if (OPERAND_AT(set1, 0) == OPERAND_AT(set2, 0) &&
3971 OPERAND_AT(set1, 1) == OPERAND_AT(set2, 1)) {
3973 ELEM_REMOVE(&iobj->link);
3986 else if (IS_NEXT_INSN_ID(set1, dup) &&
3987 IS_NEXT_INSN_ID(set1->next, setlocal)) {
3988 set2 = set1->next->next;
3989 if (OPERAND_AT(set1, 0) == OPERAND_AT(set2, 0) &&
3990 OPERAND_AT(set1, 1) == OPERAND_AT(set2, 1)) {
3991 ELEM_REMOVE(set1->next);
4005 if (IS_INSN_ID(iobj, getlocal)) {
4007 if (IS_NEXT_INSN_ID(niobj, dup)) {
4008 niobj = niobj->next;
4010 if (IS_NEXT_INSN_ID(niobj, setlocal)) {
4012 if (OPERAND_AT(iobj, 0) == OPERAND_AT(set1, 0) &&
4013 OPERAND_AT(iobj, 1) == OPERAND_AT(set1, 1)) {
4029 if (IS_INSN_ID(iobj, opt_invokebuiltin_delegate)) {
4030 if (IS_TRACE(iobj->link.next)) {
4031 if (IS_NEXT_INSN_ID(iobj->link.next, leave)) {
4032 iobj->insn_id = BIN(opt_invokebuiltin_delegate_leave);
4034 if (iobj == (
INSN *)list && bf->argc == 0 && (ISEQ_BODY(iseq)->builtin_attrs & BUILTIN_ATTR_LEAF)) {
4035 ISEQ_BODY(iseq)->builtin_attrs |= BUILTIN_ATTR_SINGLE_NOARG_LEAF;
4048 if (IS_INSN_ID(iobj, getblockparam)) {
4049 if (IS_NEXT_INSN_ID(&iobj->link, branchif) || IS_NEXT_INSN_ID(&iobj->link, branchunless)) {
4050 iobj->insn_id = BIN(getblockparamproxy);
4054 if (IS_INSN_ID(iobj, splatarray) && OPERAND_AT(iobj, 0) ==
false) {
4056 if (IS_NEXT_INSN_ID(niobj, duphash)) {
4057 niobj = niobj->next;
4059 unsigned int set_flags = 0, unset_flags = 0;
4072 if (IS_NEXT_INSN_ID(niobj, send)) {
4073 siobj = niobj->next;
4074 set_flags = VM_CALL_ARGS_SPLAT|VM_CALL_KW_SPLAT|VM_CALL_KW_SPLAT_MUT;
4075 unset_flags = VM_CALL_ARGS_BLOCKARG;
4090 else if ((IS_NEXT_INSN_ID(niobj, getlocal) || IS_NEXT_INSN_ID(niobj, getinstancevariable) ||
4091 IS_NEXT_INSN_ID(niobj, getblockparamproxy)) && (IS_NEXT_INSN_ID(niobj->next, send))) {
4092 siobj = niobj->next->next;
4093 set_flags = VM_CALL_ARGS_SPLAT|VM_CALL_KW_SPLAT|VM_CALL_KW_SPLAT_MUT|VM_CALL_ARGS_BLOCKARG;
4098 unsigned int flags = vm_ci_flag(ci);
4099 if ((flags & set_flags) == set_flags && !(flags & unset_flags)) {
4100 ((
INSN*)niobj)->insn_id = BIN(putobject);
4101 RB_OBJ_WRITE(iseq, &OPERAND_AT(niobj, 0), rb_hash_freeze(rb_hash_resurrect(OPERAND_AT(niobj, 0))));
4103 const struct rb_callinfo *nci = vm_ci_new(vm_ci_mid(ci),
4104 flags & ~VM_CALL_KW_SPLAT_MUT, vm_ci_argc(ci), vm_ci_kwarg(ci));
4106 OPERAND_AT(siobj, 0) = (
VALUE)nci;
4116insn_set_specialized_instruction(
rb_iseq_t *iseq,
INSN *iobj,
int insn_id)
4118 if (insn_id == BIN(opt_neq)) {
4119 VALUE original_ci = iobj->operands[0];
4120 VALUE new_ci = (
VALUE)new_callinfo(iseq, idEq, 1, 0, NULL, FALSE);
4121 insn_replace_with_operands(iseq, iobj, insn_id, 2, new_ci, original_ci);
4124 iobj->insn_id = insn_id;
4125 iobj->operand_size = insn_len(insn_id) - 1;
4135 if (IS_INSN_ID(iobj, newarray) && iobj->link.next &&
4136 IS_INSN(iobj->link.next)) {
4140 INSN *niobj = (
INSN *)iobj->link.next;
4141 if (IS_INSN_ID(niobj, send)) {
4143 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 0) {
4145 switch (vm_ci_mid(ci)) {
4147 method =
INT2FIX(VM_OPT_NEWARRAY_SEND_MAX);
4150 method =
INT2FIX(VM_OPT_NEWARRAY_SEND_MIN);
4153 method =
INT2FIX(VM_OPT_NEWARRAY_SEND_HASH);
4158 VALUE num = iobj->operands[0];
4159 insn_replace_with_operands(iseq, iobj, BIN(opt_newarray_send), 2, num, method);
4160 ELEM_REMOVE(&niobj->link);
4165 else if ((IS_INSN_ID(niobj, putstring) || IS_INSN_ID(niobj, putchilledstring) ||
4167 IS_NEXT_INSN_ID(&niobj->link, send)) {
4169 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 1 && vm_ci_mid(ci) == idPack) {
4170 VALUE num = iobj->operands[0];
4171 insn_replace_with_operands(iseq, iobj, BIN(opt_newarray_send), 2, FIXNUM_INC(num, 1),
INT2FIX(VM_OPT_NEWARRAY_SEND_PACK));
4172 ELEM_REMOVE(&iobj->link);
4173 ELEM_REMOVE(niobj->link.next);
4174 ELEM_INSERT_NEXT(&niobj->link, &iobj->link);
4180 else if ((IS_INSN_ID(niobj, putstring) || IS_INSN_ID(niobj, putchilledstring) ||
4182 IS_NEXT_INSN_ID(&niobj->link, getlocal) &&
4183 (niobj->link.next && IS_NEXT_INSN_ID(niobj->link.next, send))) {
4186 if (vm_ci_mid(ci) == idPack && vm_ci_argc(ci) == 2 &&
4187 (kwarg && kwarg->keyword_len == 1 && kwarg->keywords[0] ==
rb_id2sym(idBuffer))) {
4188 VALUE num = iobj->operands[0];
4189 insn_replace_with_operands(iseq, iobj, BIN(opt_newarray_send), 2, FIXNUM_INC(num, 2),
INT2FIX(VM_OPT_NEWARRAY_SEND_PACK_BUFFER));
4191 ELEM_REMOVE((niobj->link.next)->next);
4193 ELEM_REMOVE(&iobj->link);
4195 ELEM_INSERT_NEXT(niobj->link.next, &iobj->link);
4203 if ((IS_INSN_ID(niobj, putstring) || IS_INSN_ID(niobj, putchilledstring) ||
4204 IS_INSN_ID(niobj, putobject) ||
4205 IS_INSN_ID(niobj, putself) ||
4206 IS_INSN_ID(niobj, getlocal) ||
4207 IS_INSN_ID(niobj, getinstancevariable)) &&
4208 IS_NEXT_INSN_ID(&niobj->link, send)) {
4215 sendobj = sendobj->next;
4216 ci = (
struct rb_callinfo *)OPERAND_AT(sendobj, 0);
4217 }
while (vm_ci_simple(ci) && vm_ci_argc(ci) == 0 && IS_NEXT_INSN_ID(sendobj, send));
4220 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 1 && vm_ci_mid(ci) == idIncludeP) {
4221 VALUE num = iobj->operands[0];
4223 insn_replace_with_operands(iseq, sendins, BIN(opt_newarray_send), 2, FIXNUM_INC(num, 1),
INT2FIX(VM_OPT_NEWARRAY_SEND_INCLUDE_P));
4225 ELEM_REMOVE(&iobj->link);
4239 if (IS_INSN_ID(iobj, duparray) && iobj->link.next && IS_INSN(iobj->link.next)) {
4240 INSN *niobj = (
INSN *)iobj->link.next;
4241 if ((IS_INSN_ID(niobj, getlocal) ||
4242 IS_INSN_ID(niobj, getinstancevariable) ||
4243 IS_INSN_ID(niobj, putself)) &&
4244 IS_NEXT_INSN_ID(&niobj->link, send)) {
4251 sendobj = sendobj->next;
4252 ci = (
struct rb_callinfo *)OPERAND_AT(sendobj, 0);
4253 }
while (vm_ci_simple(ci) && vm_ci_argc(ci) == 0 && IS_NEXT_INSN_ID(sendobj, send));
4255 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 1 && vm_ci_mid(ci) == idIncludeP) {
4257 VALUE ary = iobj->operands[0];
4261 insn_replace_with_operands(iseq, sendins, BIN(opt_duparray_send), 3, ary,
rb_id2sym(idIncludeP),
INT2FIX(1));
4264 ELEM_REMOVE(&iobj->link);
4271 if (IS_INSN_ID(iobj, send)) {
4275#define SP_INSN(opt) insn_set_specialized_instruction(iseq, iobj, BIN(opt_##opt))
4276 if (vm_ci_simple(ci)) {
4277 switch (vm_ci_argc(ci)) {
4279 switch (vm_ci_mid(ci)) {
4280 case idLength: SP_INSN(length);
return COMPILE_OK;
4281 case idSize: SP_INSN(size);
return COMPILE_OK;
4282 case idEmptyP: SP_INSN(empty_p);
return COMPILE_OK;
4283 case idNilP: SP_INSN(nil_p);
return COMPILE_OK;
4284 case idSucc: SP_INSN(succ);
return COMPILE_OK;
4285 case idNot: SP_INSN(not);
return COMPILE_OK;
4289 switch (vm_ci_mid(ci)) {
4290 case idPLUS: SP_INSN(plus);
return COMPILE_OK;
4291 case idMINUS: SP_INSN(minus);
return COMPILE_OK;
4292 case idMULT: SP_INSN(mult);
return COMPILE_OK;
4293 case idDIV: SP_INSN(div);
return COMPILE_OK;
4294 case idMOD: SP_INSN(mod);
return COMPILE_OK;
4295 case idEq: SP_INSN(eq);
return COMPILE_OK;
4296 case idNeq: SP_INSN(neq);
return COMPILE_OK;
4297 case idEqTilde:SP_INSN(regexpmatch2);
return COMPILE_OK;
4298 case idLT: SP_INSN(lt);
return COMPILE_OK;
4299 case idLE: SP_INSN(le);
return COMPILE_OK;
4300 case idGT: SP_INSN(gt);
return COMPILE_OK;
4301 case idGE: SP_INSN(ge);
return COMPILE_OK;
4302 case idLTLT: SP_INSN(ltlt);
return COMPILE_OK;
4303 case idAREF: SP_INSN(aref);
return COMPILE_OK;
4304 case idAnd: SP_INSN(and);
return COMPILE_OK;
4305 case idOr: SP_INSN(or);
return COMPILE_OK;
4309 switch (vm_ci_mid(ci)) {
4310 case idASET: SP_INSN(aset);
return COMPILE_OK;
4316 if ((vm_ci_flag(ci) & (VM_CALL_ARGS_BLOCKARG | VM_CALL_FORWARDING)) == 0 && blockiseq == NULL) {
4317 iobj->insn_id = BIN(opt_send_without_block);
4318 iobj->operand_size = insn_len(iobj->insn_id) - 1;
4329 switch (ISEQ_BODY(iseq)->
type) {
4331 case ISEQ_TYPE_EVAL:
4332 case ISEQ_TYPE_MAIN:
4334 case ISEQ_TYPE_RESCUE:
4335 case ISEQ_TYPE_ENSURE:
4347 const int do_peepholeopt = ISEQ_COMPILE_DATA(iseq)->option->peephole_optimization;
4348 const int do_tailcallopt = tailcallable_p(iseq) &&
4349 ISEQ_COMPILE_DATA(iseq)->option->tailcall_optimization;
4350 const int do_si = ISEQ_COMPILE_DATA(iseq)->option->specialized_instruction;
4351 const int do_ou = ISEQ_COMPILE_DATA(iseq)->option->operands_unification;
4352 int rescue_level = 0;
4353 int tailcallopt = do_tailcallopt;
4355 list = FIRST_ELEMENT(anchor);
4357 int do_block_optimization = 0;
4358 LABEL * block_loop_label = NULL;
4361 if (ISEQ_BODY(iseq)->
type == ISEQ_TYPE_BLOCK) {
4362 do_block_optimization = 1;
4367 if (IS_INSN(le) && IS_INSN_ID((
INSN *)le, nop) && IS_LABEL(le->next)) {
4368 block_loop_label = (
LABEL *)le->next;
4373 if (IS_INSN(list)) {
4374 if (do_peepholeopt) {
4375 iseq_peephole_optimize(iseq, list, tailcallopt);
4378 iseq_specialized_instruction(iseq, (
INSN *)list);
4381 insn_operands_unification((
INSN *)list);
4384 if (do_block_optimization) {
4387 if (IS_INSN_ID(item,
throw)) {
4388 do_block_optimization = 0;
4393 const char *types = insn_op_types(item->insn_id);
4394 for (
int j = 0; types[j]; j++) {
4395 if (types[j] == TS_OFFSET) {
4400 LABEL * target = (
LABEL *)OPERAND_AT(item, j);
4401 if (target == block_loop_label) {
4402 do_block_optimization = 0;
4409 if (IS_LABEL(list)) {
4410 switch (((
LABEL *)list)->rescued) {
4411 case LABEL_RESCUE_BEG:
4413 tailcallopt = FALSE;
4415 case LABEL_RESCUE_END:
4416 if (!--rescue_level) tailcallopt = do_tailcallopt;
4423 if (do_block_optimization) {
4425 if (IS_INSN(le) && IS_INSN_ID((
INSN *)le, nop)) {
4432#if OPT_INSTRUCTIONS_UNIFICATION
4440 VALUE *operands = 0, *ptr = 0;
4444 for (i = 0; i < size; i++) {
4445 iobj = (
INSN *)list;
4446 argc += iobj->operand_size;
4451 ptr = operands = compile_data_alloc2(iseq,
sizeof(
VALUE), argc);
4456 for (i = 0; i < size; i++) {
4457 iobj = (
INSN *)list;
4458 MEMCPY(ptr, iobj->operands,
VALUE, iobj->operand_size);
4459 ptr += iobj->operand_size;
4463 return new_insn_core(iseq, iobj->insn_info.line_no, iobj->insn_info.node_id, insn_id, argc, operands);
4475#if OPT_INSTRUCTIONS_UNIFICATION
4481 list = FIRST_ELEMENT(anchor);
4483 if (IS_INSN(list)) {
4484 iobj = (
INSN *)list;
4486 if (unified_insns_data[
id] != 0) {
4487 const int *
const *entry = unified_insns_data[id];
4488 for (j = 1; j < (intptr_t)entry[0]; j++) {
4489 const int *unified = entry[j];
4491 for (k = 2; k < unified[1]; k++) {
4493 ((
INSN *)li)->insn_id != unified[k]) {
4500 new_unified_insn(iseq, unified[0], unified[1] - 1,
4505 niobj->link.next = li;
4524all_string_result_p(
const NODE *node)
4526 if (!node)
return FALSE;
4527 switch (nd_type(node)) {
4528 case NODE_STR:
case NODE_DSTR:
case NODE_FILE:
4530 case NODE_IF:
case NODE_UNLESS:
4531 if (!RNODE_IF(node)->nd_body || !RNODE_IF(node)->nd_else)
return FALSE;
4532 if (all_string_result_p(RNODE_IF(node)->nd_body))
4533 return all_string_result_p(RNODE_IF(node)->nd_else);
4535 case NODE_AND:
case NODE_OR:
4536 if (!RNODE_AND(node)->nd_2nd)
4537 return all_string_result_p(RNODE_AND(node)->nd_1st);
4538 if (!all_string_result_p(RNODE_AND(node)->nd_1st))
4540 return all_string_result_p(RNODE_AND(node)->nd_2nd);
4550 const NODE *lit_node;
4558 VALUE s = rb_str_new_mutable_parser_string(str);
4560 VALUE error = rb_reg_check_preprocess(s);
4561 if (!
NIL_P(error)) {
4562 COMPILE_ERROR(args->iseq, nd_line(node),
"%" PRIsVALUE, error);
4566 if (
NIL_P(args->lit)) {
4568 args->lit_node = node;
4577flush_dstr_fragment(
struct dstr_ctxt *args)
4579 if (!
NIL_P(args->lit)) {
4581 VALUE lit = args->lit;
4583 lit = rb_fstring(lit);
4584 ADD_INSN1(args->ret, args->lit_node, putobject, lit);
4591compile_dstr_fragments_0(
struct dstr_ctxt *args,
const NODE *
const node)
4593 const struct RNode_LIST *list = RNODE_DSTR(node)->nd_next;
4597 CHECK(append_dstr_fragment(args, node, str));
4601 const NODE *
const head = list->nd_head;
4602 if (nd_type_p(head, NODE_STR)) {
4603 CHECK(append_dstr_fragment(args, node, RNODE_STR(head)->
string));
4605 else if (nd_type_p(head, NODE_DSTR)) {
4606 CHECK(compile_dstr_fragments_0(args, head));
4609 flush_dstr_fragment(args);
4611 CHECK(COMPILE(args->ret,
"each string", head));
4623 .iseq = iseq, .ret = ret,
4624 .lit =
Qnil, .lit_node = NULL,
4625 .cnt = 0, .dregx = dregx,
4627 CHECK(compile_dstr_fragments_0(&args, node));
4628 flush_dstr_fragment(&args);
4638 while (node && nd_type_p(node, NODE_BLOCK)) {
4639 CHECK(COMPILE_(ret,
"BLOCK body", RNODE_BLOCK(node)->nd_head,
4640 (RNODE_BLOCK(node)->nd_next ? 1 : popped)));
4641 node = RNODE_BLOCK(node)->nd_next;
4644 CHECK(COMPILE_(ret,
"BLOCK next", RNODE_BLOCK(node)->nd_next, popped));
4653 if (!RNODE_DSTR(node)->nd_next) {
4654 VALUE lit = rb_node_dstr_string_val(node);
4655 ADD_INSN1(ret, node, putstring, lit);
4659 CHECK(compile_dstr_fragments(iseq, ret, node, &cnt, FALSE));
4660 ADD_INSN1(ret, node, concatstrings,
INT2FIX(cnt));
4669 int cflag = (int)RNODE_DREGX(node)->as.nd_cflag;
4671 if (!RNODE_DREGX(node)->nd_next) {
4673 VALUE src = rb_node_dregx_string_val(node);
4674 VALUE match = rb_reg_compile(src, cflag, NULL, 0);
4675 ADD_INSN1(ret, node, putobject, match);
4681 CHECK(compile_dstr_fragments(iseq, ret, node, &cnt, TRUE));
4685 ADD_INSN(ret, node, pop);
4695 const int line = nd_line(node);
4696 LABEL *lend = NEW_LABEL(line);
4697 rb_num_t cnt = ISEQ_FLIP_CNT_INCREMENT(ISEQ_BODY(iseq)->local_iseq)
4698 + VM_SVAR_FLIPFLOP_START;
4701 ADD_INSN2(ret, node, getspecial, key,
INT2FIX(0));
4702 ADD_INSNL(ret, node, branchif, lend);
4705 CHECK(COMPILE(ret,
"flip2 beg", RNODE_FLIP2(node)->nd_beg));
4706 ADD_INSNL(ret, node, branchunless, else_label);
4707 ADD_INSN1(ret, node, putobject,
Qtrue);
4708 ADD_INSN1(ret, node, setspecial, key);
4710 ADD_INSNL(ret, node, jump, then_label);
4714 ADD_LABEL(ret, lend);
4715 CHECK(COMPILE(ret,
"flip2 end", RNODE_FLIP2(node)->nd_end));
4716 ADD_INSNL(ret, node, branchunless, then_label);
4717 ADD_INSN1(ret, node, putobject,
Qfalse);
4718 ADD_INSN1(ret, node, setspecial, key);
4719 ADD_INSNL(ret, node, jump, then_label);
4728#define COMPILE_SINGLE 2
4735 LABEL *label = NEW_LABEL(nd_line(cond));
4736 if (!then_label) then_label = label;
4737 else if (!else_label) else_label = label;
4739 CHECK(compile_branch_condition(iseq, seq, cond, then_label, else_label));
4741 if (LIST_INSN_SIZE_ONE(seq)) {
4742 INSN *insn = (
INSN *)ELEM_FIRST_INSN(FIRST_ELEMENT(seq));
4743 if (insn->insn_id == BIN(jump) && (
LABEL *)(insn->operands[0]) == label)
4746 if (!label->refcnt) {
4747 return COMPILE_SINGLE;
4749 ADD_LABEL(seq, label);
4759 DECL_ANCHOR(ignore);
4762 switch (nd_type(cond)) {
4764 CHECK(ok = compile_logical(iseq, ret, RNODE_AND(cond)->nd_1st, NULL, else_label));
4765 cond = RNODE_AND(cond)->nd_2nd;
4766 if (ok == COMPILE_SINGLE) {
4767 INIT_ANCHOR(ignore);
4769 then_label = NEW_LABEL(nd_line(cond));
4773 CHECK(ok = compile_logical(iseq, ret, RNODE_OR(cond)->nd_1st, then_label, NULL));
4774 cond = RNODE_OR(cond)->nd_2nd;
4775 if (ok == COMPILE_SINGLE) {
4776 INIT_ANCHOR(ignore);
4778 else_label = NEW_LABEL(nd_line(cond));
4788 case NODE_IMAGINARY:
4795 ADD_INSNL(ret, cond, jump, then_label);
4800 ADD_INSNL(ret, cond, jump, else_label);
4806 CHECK(COMPILE_POPPED(ret,
"branch condition", cond));
4807 ADD_INSNL(ret, cond, jump, then_label);
4810 CHECK(compile_flip_flop(iseq, ret, cond, TRUE, then_label, else_label));
4813 CHECK(compile_flip_flop(iseq, ret, cond, FALSE, then_label, else_label));
4816 CHECK(compile_defined_expr(iseq, ret, cond,
Qfalse, ret == ignore));
4820 DECL_ANCHOR(cond_seq);
4821 INIT_ANCHOR(cond_seq);
4823 CHECK(COMPILE(cond_seq,
"branch condition", cond));
4825 if (LIST_INSN_SIZE_ONE(cond_seq)) {
4826 INSN *insn = (
INSN *)ELEM_FIRST_INSN(FIRST_ELEMENT(cond_seq));
4827 if (insn->insn_id == BIN(putobject)) {
4828 if (
RTEST(insn->operands[0])) {
4829 ADD_INSNL(ret, cond, jump, then_label);
4834 ADD_INSNL(ret, cond, jump, else_label);
4839 ADD_SEQ(ret, cond_seq);
4844 ADD_INSNL(ret, cond, branchunless, else_label);
4845 ADD_INSNL(ret, cond, jump, then_label);
4852keyword_node_p(
const NODE *
const node)
4854 return nd_type_p(node, NODE_HASH) && (RNODE_HASH(node)->nd_brace & HASH_BRACE) != HASH_BRACE;
4860 switch (nd_type(node)) {
4862 return rb_node_sym_string_val(node);
4864 UNKNOWN_NODE(
"get_symbol_value", node,
Qnil);
4871 NODE *node = node_hash->nd_head;
4872 VALUE hash = rb_hash_new();
4875 for (
int i = 0; node != NULL; i++, node = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next) {
4876 VALUE key = get_symbol_value(iseq, RNODE_LIST(node)->nd_head);
4877 VALUE idx = rb_hash_aref(hash, key);
4882 rb_hash_aset(hash, key,
INT2FIX(i));
4892 const NODE *
const root_node,
4900 if (RNODE_HASH(root_node)->nd_head && nd_type_p(RNODE_HASH(root_node)->nd_head, NODE_LIST)) {
4901 const NODE *node = RNODE_HASH(root_node)->nd_head;
4905 const NODE *key_node = RNODE_LIST(node)->nd_head;
4909 if (key_node && nd_type_p(key_node, NODE_SYM)) {
4914 *flag |= VM_CALL_KW_SPLAT;
4915 if (seen_nodes > 1 || RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next) {
4920 *flag |= VM_CALL_KW_SPLAT_MUT;
4925 node = RNODE_LIST(node)->nd_next;
4926 node = RNODE_LIST(node)->nd_next;
4930 node = RNODE_HASH(root_node)->nd_head;
4933 VALUE key_index = node_hash_unique_key_index(iseq, RNODE_HASH(root_node), &
len);
4936 VALUE *keywords = kw_arg->keywords;
4939 kw_arg->references = 0;
4940 kw_arg->keyword_len =
len;
4942 *kw_arg_ptr = kw_arg;
4944 for (i=0; node != NULL; i++, node = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next) {
4945 const NODE *key_node = RNODE_LIST(node)->nd_head;
4946 const NODE *val_node = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_head;
4949 keywords[j] = get_symbol_value(iseq, key_node);
4953 NO_CHECK(COMPILE_(ret,
"keyword values", val_node, popped));
4967 for (; node;
len++, node = RNODE_LIST(node)->nd_next) {
4969 EXPECT_NODE(
"compile_args", node, NODE_LIST, -1);
4972 if (RNODE_LIST(node)->nd_next == NULL && keyword_node_p(RNODE_LIST(node)->nd_head)) {
4973 *kwnode_ptr = RNODE_LIST(node)->nd_head;
4976 RUBY_ASSERT(!keyword_node_p(RNODE_LIST(node)->nd_head));
4977 NO_CHECK(COMPILE_(ret,
"array element", RNODE_LIST(node)->nd_head, FALSE));
4985frozen_string_literal_p(
const rb_iseq_t *iseq)
4987 return ISEQ_COMPILE_DATA(iseq)->option->frozen_string_literal > 0;
4991static_literal_node_p(
const NODE *node,
const rb_iseq_t *iseq,
bool hash_key)
4993 switch (nd_type(node)) {
5001 case NODE_IMAGINARY:
5008 return hash_key || frozen_string_literal_p(iseq);
5017 switch (nd_type(node)) {
5019 return rb_node_integer_literal_val(node);
5021 return rb_node_float_literal_val(node);
5023 return rb_node_rational_literal_val(node);
5024 case NODE_IMAGINARY:
5025 return rb_node_imaginary_literal_val(node);
5033 return rb_node_sym_string_val(node);
5035 return rb_node_regx_string_val(node);
5037 return rb_node_line_lineno_val(node);
5039 return rb_node_encoding_val(node);
5042 if (ISEQ_COMPILE_DATA(iseq)->option->debug_frozen_string_literal ||
RTEST(
ruby_debug)) {
5043 VALUE lit = get_string_value(node);
5044 return rb_str_with_debug_created_info(lit, rb_iseq_path(iseq), (
int)nd_line(node));
5047 return get_string_value(node);
5050 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(node)));
5057 const NODE *line_node = node;
5059 if (nd_type_p(node, NODE_ZLIST)) {
5061 ADD_INSN1(ret, line_node, newarray,
INT2FIX(0));
5066 EXPECT_NODE(
"compile_array", node, NODE_LIST, -1);
5069 for (; node; node = RNODE_LIST(node)->nd_next) {
5070 NO_CHECK(COMPILE_(ret,
"array element", RNODE_LIST(node)->nd_head, popped));
5112 const int max_stack_len = 0x100;
5113 const int min_tmp_ary_len = 0x40;
5117#define FLUSH_CHUNK \
5119 if (first_chunk) ADD_INSN1(ret, line_node, newarray, INT2FIX(stack_len)); \
5120 else ADD_INSN1(ret, line_node, pushtoarray, INT2FIX(stack_len)); \
5121 first_chunk = FALSE; \
5129 if (static_literal_node_p(RNODE_LIST(node)->nd_head, iseq,
false)) {
5131 const NODE *node_tmp = RNODE_LIST(node)->nd_next;
5132 for (; node_tmp && static_literal_node_p(RNODE_LIST(node_tmp)->nd_head, iseq,
false); node_tmp = RNODE_LIST(node_tmp)->nd_next)
5135 if ((first_chunk && stack_len == 0 && !node_tmp) || count >= min_tmp_ary_len) {
5140 for (; count; count--, node = RNODE_LIST(node)->nd_next)
5141 rb_ary_push(ary, static_literal_value(RNODE_LIST(node)->nd_head, iseq));
5147 ADD_INSN1(ret, line_node, duparray, ary);
5148 first_chunk = FALSE;
5151 ADD_INSN1(ret, line_node, putobject, ary);
5152 ADD_INSN(ret, line_node, concattoarray);
5159 for (; count; count--, node = RNODE_LIST(node)->nd_next) {
5161 EXPECT_NODE(
"compile_array", node, NODE_LIST, -1);
5164 if (!RNODE_LIST(node)->nd_next && keyword_node_p(RNODE_LIST(node)->nd_head)) {
5166 if (stack_len == 0 && first_chunk) {
5167 ADD_INSN1(ret, line_node, newarray,
INT2FIX(0));
5172 NO_CHECK(COMPILE_(ret,
"array element", RNODE_LIST(node)->nd_head, 0));
5173 ADD_INSN(ret, line_node, pushtoarraykwsplat);
5177 NO_CHECK(COMPILE_(ret,
"array element", RNODE_LIST(node)->nd_head, 0));
5182 if (stack_len >= max_stack_len) FLUSH_CHUNK;
5192static_literal_node_pair_p(
const NODE *node,
const rb_iseq_t *iseq)
5194 return RNODE_LIST(node)->nd_head && static_literal_node_p(RNODE_LIST(node)->nd_head, iseq,
true) && static_literal_node_p(RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_head, iseq,
false);
5200 const NODE *line_node = node;
5202 node = RNODE_HASH(node)->nd_head;
5204 if (!node || nd_type_p(node, NODE_ZLIST)) {
5206 ADD_INSN1(ret, line_node, newhash,
INT2FIX(0));
5211 EXPECT_NODE(
"compile_hash", node, NODE_LIST, -1);
5214 for (; node; node = RNODE_LIST(node)->nd_next) {
5215 NO_CHECK(COMPILE_(ret,
"hash element", RNODE_LIST(node)->nd_head, popped));
5238 const int max_stack_len = 0x100;
5239 const int min_tmp_hash_len = 0x800;
5241 int first_chunk = 1;
5242 DECL_ANCHOR(anchor);
5243 INIT_ANCHOR(anchor);
5246#define FLUSH_CHUNK() \
5248 if (first_chunk) { \
5249 APPEND_LIST(ret, anchor); \
5250 ADD_INSN1(ret, line_node, newhash, INT2FIX(stack_len)); \
5253 ADD_INSN1(ret, line_node, putspecialobject, INT2FIX(VM_SPECIAL_OBJECT_VMCORE)); \
5254 ADD_INSN(ret, line_node, swap); \
5255 APPEND_LIST(ret, anchor); \
5256 ADD_SEND(ret, line_node, id_core_hash_merge_ptr, INT2FIX(stack_len + 1)); \
5258 INIT_ANCHOR(anchor); \
5259 first_chunk = stack_len = 0; \
5266 if (static_literal_node_pair_p(node, iseq)) {
5268 const NODE *node_tmp = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next;
5269 for (; node_tmp && static_literal_node_pair_p(node_tmp, iseq); node_tmp = RNODE_LIST(RNODE_LIST(node_tmp)->nd_next)->nd_next)
5272 if ((first_chunk && stack_len == 0 && !node_tmp) || count >= min_tmp_hash_len) {
5277 for (; count; count--, node = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next) {
5279 elem[0] = static_literal_value(RNODE_LIST(node)->nd_head, iseq);
5280 elem[1] = static_literal_value(RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_head, iseq);
5291 ADD_INSN1(ret, line_node, duphash, hash);
5295 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
5296 ADD_INSN(ret, line_node, swap);
5298 ADD_INSN1(ret, line_node, putobject, hash);
5300 ADD_SEND(ret, line_node, id_core_hash_merge_kwd,
INT2FIX(2));
5307 for (; count; count--, node = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next) {
5310 EXPECT_NODE(
"compile_hash", node, NODE_LIST, -1);
5313 if (RNODE_LIST(node)->nd_head) {
5315 NO_CHECK(COMPILE_(anchor,
"hash key element", RNODE_LIST(node)->nd_head, 0));
5316 NO_CHECK(COMPILE_(anchor,
"hash value element", RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_head, 0));
5320 if (stack_len >= max_stack_len) FLUSH_CHUNK();
5326 const NODE *kw = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_head;
5327 int empty_kw = nd_type_p(kw, NODE_HASH) && (!RNODE_HASH(kw)->nd_head);
5328 int first_kw = first_chunk && stack_len == 0;
5329 int last_kw = !RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next;
5330 int only_kw = last_kw && first_kw;
5332 empty_kw = empty_kw || nd_type_p(kw, NODE_NIL);
5334 if (only_kw && method_call_keywords) {
5342 NO_CHECK(COMPILE(ret,
"keyword splat", kw));
5344 else if (first_kw) {
5348 ADD_INSN1(ret, line_node, newhash,
INT2FIX(0));
5355 if (only_kw && method_call_keywords) {
5361 NO_CHECK(COMPILE(ret,
"keyword splat", kw));
5368 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
5369 if (first_kw) ADD_INSN1(ret, line_node, newhash,
INT2FIX(0));
5370 else ADD_INSN(ret, line_node, swap);
5372 NO_CHECK(COMPILE(ret,
"keyword splat", kw));
5374 ADD_SEND(ret, line_node, id_core_hash_merge_kwd,
INT2FIX(2));
5389rb_node_case_when_optimizable_literal(
const NODE *
const node)
5391 switch (nd_type(node)) {
5393 return rb_node_integer_literal_val(node);
5395 VALUE v = rb_node_float_literal_val(node);
5404 case NODE_IMAGINARY:
5413 return rb_node_sym_string_val(node);
5415 return rb_node_line_lineno_val(node);
5417 return rb_node_str_string_val(node);
5419 return rb_node_file_path_val(node);
5426 LABEL *l1,
int only_special_literals,
VALUE literals)
5429 const NODE *val = RNODE_LIST(vals)->nd_head;
5430 VALUE lit = rb_node_case_when_optimizable_literal(val);
5433 only_special_literals = 0;
5435 else if (
NIL_P(rb_hash_lookup(literals, lit))) {
5436 rb_hash_aset(literals, lit, (
VALUE)(l1) | 1);
5439 if (nd_type_p(val, NODE_STR) || nd_type_p(val, NODE_FILE)) {
5440 debugp_param(
"nd_lit", get_string_value(val));
5441 lit = get_string_value(val);
5442 ADD_INSN1(cond_seq, val, putobject, lit);
5446 if (!COMPILE(cond_seq,
"when cond", val))
return -1;
5450 ADD_INSN1(cond_seq, vals, topn,
INT2FIX(1));
5451 ADD_CALL(cond_seq, vals, idEqq,
INT2FIX(1));
5452 ADD_INSNL(cond_seq, val, branchif, l1);
5453 vals = RNODE_LIST(vals)->nd_next;
5455 return only_special_literals;
5460 LABEL *l1,
int only_special_literals,
VALUE literals)
5462 const NODE *line_node = vals;
5464 switch (nd_type(vals)) {
5466 if (when_vals(iseq, cond_seq, vals, l1, only_special_literals, literals) < 0)
5470 ADD_INSN (cond_seq, line_node, dup);
5471 CHECK(COMPILE(cond_seq,
"when splat", RNODE_SPLAT(vals)->nd_head));
5472 ADD_INSN1(cond_seq, line_node, splatarray,
Qfalse);
5473 ADD_INSN1(cond_seq, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_CASE | VM_CHECKMATCH_ARRAY));
5474 ADD_INSNL(cond_seq, line_node, branchif, l1);
5477 CHECK(when_splat_vals(iseq, cond_seq, RNODE_ARGSCAT(vals)->nd_head, l1, only_special_literals, literals));
5478 CHECK(when_splat_vals(iseq, cond_seq, RNODE_ARGSCAT(vals)->nd_body, l1, only_special_literals, literals));
5481 CHECK(when_splat_vals(iseq, cond_seq, RNODE_ARGSPUSH(vals)->nd_head, l1, only_special_literals, literals));
5482 ADD_INSN (cond_seq, line_node, dup);
5483 CHECK(COMPILE(cond_seq,
"when argspush body", RNODE_ARGSPUSH(vals)->nd_body));
5484 ADD_INSN1(cond_seq, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_CASE));
5485 ADD_INSNL(cond_seq, line_node, branchif, l1);
5488 ADD_INSN (cond_seq, line_node, dup);
5489 CHECK(COMPILE(cond_seq,
"when val", vals));
5490 ADD_INSN1(cond_seq, line_node, splatarray,
Qfalse);
5491 ADD_INSN1(cond_seq, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_CASE | VM_CHECKMATCH_ARRAY));
5492 ADD_INSNL(cond_seq, line_node, branchif, l1);
5585 const NODE *line_node;
5600add_masgn_lhs_node(
struct masgn_state *state,
int lhs_pos,
const NODE *line_node,
int argc,
INSN *before_insn)
5603 rb_bug(
"no masgn_state");
5612 memo->before_insn = before_insn;
5613 memo->line_node = line_node;
5614 memo->argn = state->num_args + 1;
5615 memo->num_args = argc;
5616 state->num_args += argc;
5617 memo->lhs_pos = lhs_pos;
5619 if (!state->first_memo) {
5620 state->first_memo = memo;
5623 state->last_memo->next = memo;
5625 state->last_memo = memo;
5635 switch (nd_type(node)) {
5636 case NODE_ATTRASGN: {
5638 const NODE *line_node = node;
5640 CHECK(COMPILE_POPPED(pre,
"masgn lhs (NODE_ATTRASGN)", node));
5642 bool safenav_call =
false;
5644 iobj = (
INSN *)get_prev_insn((
INSN *)insn_element);
5646 ELEM_REMOVE(insn_element);
5647 if (!IS_INSN_ID(iobj, send)) {
5648 safenav_call =
true;
5649 iobj = (
INSN *)get_prev_insn(iobj);
5650 ELEM_INSERT_NEXT(&iobj->link, insn_element);
5652 (pre->last = iobj->link.prev)->next = 0;
5655 int argc = vm_ci_argc(ci) + 1;
5656 ci = ci_argc_set(iseq, ci, argc);
5657 OPERAND_AT(iobj, 0) = (
VALUE)ci;
5661 ADD_INSN(lhs, line_node, swap);
5664 ADD_INSN1(lhs, line_node, topn,
INT2FIX(argc));
5667 if (!add_masgn_lhs_node(state, lhs_pos, line_node, argc, (
INSN *)LAST_ELEMENT(lhs))) {
5671 iobj->link.prev = lhs->last;
5672 lhs->last->next = &iobj->link;
5673 for (lhs->last = &iobj->link; lhs->last->next; lhs->last = lhs->last->next);
5674 if (vm_ci_flag(ci) & VM_CALL_ARGS_SPLAT) {
5675 int argc = vm_ci_argc(ci);
5676 bool dupsplat =
false;
5677 ci = ci_argc_set(iseq, ci, argc - 1);
5678 if (!(vm_ci_flag(ci) & VM_CALL_ARGS_SPLAT_MUT)) {
5685 ci = ci_flag_set(iseq, ci, VM_CALL_ARGS_SPLAT_MUT);
5687 OPERAND_AT(iobj, 0) = (
VALUE)ci;
5696 int line_no = nd_line(line_node);
5697 int node_id = nd_node_id(line_node);
5700 INSERT_BEFORE_INSN(iobj, line_no, node_id, swap);
5701 INSERT_BEFORE_INSN1(iobj, line_no, node_id, splatarray,
Qtrue);
5702 INSERT_BEFORE_INSN(iobj, line_no, node_id, swap);
5704 INSERT_BEFORE_INSN1(iobj, line_no, node_id, pushtoarray,
INT2FIX(1));
5706 if (!safenav_call) {
5707 ADD_INSN(lhs, line_node, pop);
5709 ADD_INSN(lhs, line_node, pop);
5712 for (
int i=0; i < argc; i++) {
5713 ADD_INSN(post, line_node, pop);
5718 DECL_ANCHOR(nest_rhs);
5719 INIT_ANCHOR(nest_rhs);
5720 DECL_ANCHOR(nest_lhs);
5721 INIT_ANCHOR(nest_lhs);
5723 int prev_level = state->lhs_level;
5724 bool prev_nested = state->nested;
5726 state->lhs_level = lhs_pos - 1;
5727 CHECK(compile_massign0(iseq, pre, nest_rhs, nest_lhs, post, node, state, 1));
5728 state->lhs_level = prev_level;
5729 state->nested = prev_nested;
5731 ADD_SEQ(lhs, nest_rhs);
5732 ADD_SEQ(lhs, nest_lhs);
5736 if (!RNODE_CDECL(node)->nd_vid) {
5740 CHECK(COMPILE_POPPED(pre,
"masgn lhs (NODE_CDECL)", node));
5743 iobj = (
INSN *)insn_element;
5746 ELEM_REMOVE(insn_element);
5747 pre->last = iobj->link.prev;
5750 if (!add_masgn_lhs_node(state, lhs_pos, node, 1, (
INSN *)LAST_ELEMENT(lhs))) {
5754 ADD_INSN(post, node, pop);
5759 DECL_ANCHOR(anchor);
5760 INIT_ANCHOR(anchor);
5761 CHECK(COMPILE_POPPED(anchor,
"masgn lhs", node));
5762 ELEM_REMOVE(FIRST_ELEMENT(anchor));
5763 ADD_SEQ(lhs, anchor);
5774 CHECK(compile_massign_opt_lhs(iseq, ret, RNODE_LIST(lhsn)->nd_next));
5775 CHECK(compile_massign_lhs(iseq, ret, ret, ret, ret, RNODE_LIST(lhsn)->nd_head, NULL, 0));
5782 const NODE *rhsn,
const NODE *orig_lhsn)
5785 const int memsize = numberof(mem);
5787 int llen = 0, rlen = 0;
5789 const NODE *lhsn = orig_lhsn;
5791#define MEMORY(v) { \
5793 if (memindex == memsize) return 0; \
5794 for (i=0; i<memindex; i++) { \
5795 if (mem[i] == (v)) return 0; \
5797 mem[memindex++] = (v); \
5800 if (rhsn == 0 || !nd_type_p(rhsn, NODE_LIST)) {
5805 const NODE *ln = RNODE_LIST(lhsn)->nd_head;
5806 switch (nd_type(ln)) {
5811 MEMORY(get_nd_vid(ln));
5816 lhsn = RNODE_LIST(lhsn)->nd_next;
5822 NO_CHECK(COMPILE_POPPED(ret,
"masgn val (popped)", RNODE_LIST(rhsn)->nd_head));
5825 NO_CHECK(COMPILE(ret,
"masgn val", RNODE_LIST(rhsn)->nd_head));
5827 rhsn = RNODE_LIST(rhsn)->nd_next;
5832 for (i=0; i<llen-rlen; i++) {
5833 ADD_INSN(ret, orig_lhsn, putnil);
5837 compile_massign_opt_lhs(iseq, ret, orig_lhsn);
5844 const NODE *rhsn = RNODE_MASGN(node)->nd_value;
5845 const NODE *splatn = RNODE_MASGN(node)->nd_args;
5846 const NODE *lhsn = RNODE_MASGN(node)->nd_head;
5847 const NODE *lhsn_count = lhsn;
5848 int lhs_splat = (splatn && NODE_NAMED_REST_P(splatn)) ? 1 : 0;
5853 while (lhsn_count) {
5855 lhsn_count = RNODE_LIST(lhsn_count)->nd_next;
5858 CHECK(compile_massign_lhs(iseq, pre, rhs, lhs, post, RNODE_LIST(lhsn)->nd_head, state, (llen - lpos) + lhs_splat + state->lhs_level));
5860 lhsn = RNODE_LIST(lhsn)->nd_next;
5864 if (nd_type_p(splatn, NODE_POSTARG)) {
5866 const NODE *postn = RNODE_POSTARG(splatn)->nd_2nd;
5867 const NODE *restn = RNODE_POSTARG(splatn)->nd_1st;
5868 int plen = (int)RNODE_LIST(postn)->as.nd_alen;
5870 int flag = 0x02 | (NODE_NAMED_REST_P(restn) ? 0x01 : 0x00);
5872 ADD_INSN2(lhs, splatn, expandarray,
INT2FIX(plen),
INT2FIX(flag));
5874 if (NODE_NAMED_REST_P(restn)) {
5875 CHECK(compile_massign_lhs(iseq, pre, rhs, lhs, post, restn, state, 1 + plen + state->lhs_level));
5878 CHECK(compile_massign_lhs(iseq, pre, rhs, lhs, post, RNODE_LIST(postn)->nd_head, state, (plen - ppos) + state->lhs_level));
5880 postn = RNODE_LIST(postn)->nd_next;
5885 CHECK(compile_massign_lhs(iseq, pre, rhs, lhs, post, splatn, state, 1 + state->lhs_level));
5889 if (!state->nested) {
5890 NO_CHECK(COMPILE(rhs,
"normal masgn rhs", rhsn));
5894 ADD_INSN(rhs, node, dup);
5896 ADD_INSN2(rhs, node, expandarray,
INT2FIX(llen),
INT2FIX(lhs_splat));
5903 if (!popped || RNODE_MASGN(node)->nd_args || !compile_massign_opt(iseq, ret, RNODE_MASGN(node)->nd_value, RNODE_MASGN(node)->nd_head)) {
5905 state.lhs_level = popped ? 0 : 1;
5908 state.first_memo = NULL;
5909 state.last_memo = NULL;
5919 int ok = compile_massign0(iseq, pre, rhs, lhs, post, node, &state, popped);
5923 VALUE topn_arg =
INT2FIX((state.num_args - memo->argn) + memo->lhs_pos);
5924 for (
int i = 0; i < memo->num_args; i++) {
5925 INSERT_BEFORE_INSN1(memo->before_insn, nd_line(memo->line_node), nd_node_id(memo->line_node), topn, topn_arg);
5927 tmp_memo = memo->next;
5936 if (!popped && state.num_args >= 1) {
5938 ADD_INSN1(ret, node, setn,
INT2FIX(state.num_args));
5950 switch (nd_type(node)) {
5952 rb_ary_unshift(arr,
ID2SYM(RNODE_CONST(node)->nd_vid));
5955 rb_ary_unshift(arr,
ID2SYM(RNODE_COLON3(node)->nd_mid));
5956 rb_ary_unshift(arr,
ID2SYM(idNULL));
5959 rb_ary_unshift(arr,
ID2SYM(RNODE_COLON2(node)->nd_mid));
5960 node = RNODE_COLON2(node)->nd_head;
5969compile_const_prefix(
rb_iseq_t *iseq,
const NODE *
const node,
5972 switch (nd_type(node)) {
5974 debugi(
"compile_const_prefix - colon", RNODE_CONST(node)->nd_vid);
5975 ADD_INSN1(body, node, putobject,
Qtrue);
5976 ADD_INSN1(body, node, getconstant,
ID2SYM(RNODE_CONST(node)->nd_vid));
5979 debugi(
"compile_const_prefix - colon3", RNODE_COLON3(node)->nd_mid);
5980 ADD_INSN(body, node, pop);
5981 ADD_INSN1(body, node, putobject, rb_cObject);
5982 ADD_INSN1(body, node, putobject,
Qtrue);
5983 ADD_INSN1(body, node, getconstant,
ID2SYM(RNODE_COLON3(node)->nd_mid));
5986 CHECK(compile_const_prefix(iseq, RNODE_COLON2(node)->nd_head, pref, body));
5987 debugi(
"compile_const_prefix - colon2", RNODE_COLON2(node)->nd_mid);
5988 ADD_INSN1(body, node, putobject,
Qfalse);
5989 ADD_INSN1(body, node, getconstant,
ID2SYM(RNODE_COLON2(node)->nd_mid));
5992 CHECK(COMPILE(pref,
"const colon2 prefix", node));
6001 if (nd_type_p(cpath, NODE_COLON3)) {
6003 ADD_INSN1(ret, cpath, putobject, rb_cObject);
6004 return VM_DEFINECLASS_FLAG_SCOPED;
6006 else if (nd_type_p(cpath, NODE_COLON2) && RNODE_COLON2(cpath)->nd_head) {
6008 NO_CHECK(COMPILE(ret,
"nd_else->nd_head", RNODE_COLON2(cpath)->nd_head));
6009 return VM_DEFINECLASS_FLAG_SCOPED;
6013 ADD_INSN1(ret, cpath, putspecialobject,
6014 INT2FIX(VM_SPECIAL_OBJECT_CONST_BASE));
6020private_recv_p(
const NODE *node)
6022 NODE *recv = get_nd_recv(node);
6023 if (recv && nd_type_p(recv, NODE_SELF)) {
6024 return RNODE_SELF(recv)->nd_state != 0;
6031 const NODE *
const node,
LABEL **lfinish,
VALUE needstr,
bool ignore);
6034compile_call(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
const enum node_type
type,
const NODE *
const line_node,
int popped,
bool assume_receiver);
6041 enum defined_type expr_type = DEFINED_NOT_DEFINED;
6042 enum node_type
type;
6043 const int line = nd_line(node);
6044 const NODE *line_node = node;
6046 switch (
type = nd_type(node)) {
6050 expr_type = DEFINED_NIL;
6053 expr_type = DEFINED_SELF;
6056 expr_type = DEFINED_TRUE;
6059 expr_type = DEFINED_FALSE;
6064 const NODE *vals = (nd_type(node) == NODE_HASH) ? RNODE_HASH(node)->nd_head : node;
6068 if (RNODE_LIST(vals)->nd_head) {
6069 defined_expr0(iseq, ret, RNODE_LIST(vals)->nd_head, lfinish,
Qfalse,
false);
6072 lfinish[1] = NEW_LABEL(line);
6074 ADD_INSNL(ret, line_node, branchunless, lfinish[1]);
6076 }
while ((vals = RNODE_LIST(vals)->nd_next) != NULL);
6089 case NODE_IMAGINARY:
6094 expr_type = DEFINED_EXPR;
6098 defined_expr0(iseq, ret, RNODE_LIST(node)->nd_head, lfinish,
Qfalse,
false);
6100 lfinish[1] = NEW_LABEL(line);
6102 ADD_INSNL(ret, line_node, branchunless, lfinish[1]);
6103 expr_type = DEFINED_EXPR;
6109 expr_type = DEFINED_LVAR;
6112#define PUSH_VAL(type) (needstr == Qfalse ? Qtrue : rb_iseq_defined_string(type))
6114 ADD_INSN3(ret, line_node, definedivar,
6115 ID2SYM(RNODE_IVAR(node)->nd_vid), get_ivar_ic_value(iseq,RNODE_IVAR(node)->nd_vid), PUSH_VAL(DEFINED_IVAR));
6119 ADD_INSN(ret, line_node, putnil);
6120 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_GVAR),
6121 ID2SYM(RNODE_GVAR(node)->nd_vid), PUSH_VAL(DEFINED_GVAR));
6125 ADD_INSN(ret, line_node, putnil);
6126 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_CVAR),
6127 ID2SYM(RNODE_CVAR(node)->nd_vid), PUSH_VAL(DEFINED_CVAR));
6131 ADD_INSN(ret, line_node, putnil);
6132 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_CONST),
6133 ID2SYM(RNODE_CONST(node)->nd_vid), PUSH_VAL(DEFINED_CONST));
6137 lfinish[1] = NEW_LABEL(line);
6139 defined_expr0(iseq, ret, RNODE_COLON2(node)->nd_head, lfinish,
Qfalse,
false);
6140 ADD_INSNL(ret, line_node, branchunless, lfinish[1]);
6141 NO_CHECK(COMPILE(ret,
"defined/colon2#nd_head", RNODE_COLON2(node)->nd_head));
6144 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_CONST_FROM),
6145 ID2SYM(RNODE_COLON2(node)->nd_mid), PUSH_VAL(DEFINED_CONST));
6148 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_METHOD),
6149 ID2SYM(RNODE_COLON2(node)->nd_mid), PUSH_VAL(DEFINED_METHOD));
6153 ADD_INSN1(ret, line_node, putobject, rb_cObject);
6154 ADD_INSN3(ret, line_node, defined,
6155 INT2FIX(DEFINED_CONST_FROM),
ID2SYM(RNODE_COLON3(node)->nd_mid), PUSH_VAL(DEFINED_CONST));
6163 case NODE_ATTRASGN:{
6164 const int explicit_receiver =
6165 (
type == NODE_CALL ||
type == NODE_OPCALL ||
6166 (
type == NODE_ATTRASGN && !private_recv_p(node)));
6168 if (get_nd_args(node) || explicit_receiver) {
6170 lfinish[1] = NEW_LABEL(line);
6173 lfinish[2] = NEW_LABEL(line);
6176 if (get_nd_args(node)) {
6177 defined_expr0(iseq, ret, get_nd_args(node), lfinish,
Qfalse,
false);
6178 ADD_INSNL(ret, line_node, branchunless, lfinish[1]);
6180 if (explicit_receiver) {
6181 defined_expr0(iseq, ret, get_nd_recv(node), lfinish,
Qfalse,
true);
6182 switch (nd_type(get_nd_recv(node))) {
6188 ADD_INSNL(ret, line_node, branchunless, lfinish[2]);
6189 compile_call(iseq, ret, get_nd_recv(node), nd_type(get_nd_recv(node)), line_node, 0,
true);
6192 ADD_INSNL(ret, line_node, branchunless, lfinish[1]);
6193 NO_CHECK(COMPILE(ret,
"defined/recv", get_nd_recv(node)));
6197 ADD_INSN(ret, line_node, dup);
6199 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_METHOD),
6200 ID2SYM(get_node_call_nd_mid(node)), PUSH_VAL(DEFINED_METHOD));
6203 ADD_INSN(ret, line_node, putself);
6205 ADD_INSN(ret, line_node, dup);
6207 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_FUNC),
6208 ID2SYM(get_node_call_nd_mid(node)), PUSH_VAL(DEFINED_METHOD));
6214 ADD_INSN(ret, line_node, putnil);
6215 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_YIELD), 0,
6216 PUSH_VAL(DEFINED_YIELD));
6217 iseq_set_use_block(ISEQ_BODY(iseq)->local_iseq);
6222 ADD_INSN(ret, line_node, putnil);
6223 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_REF),
6224 INT2FIX((RNODE_BACK_REF(node)->nd_nth << 1) | (
type == NODE_BACK_REF)),
6225 PUSH_VAL(DEFINED_GVAR));
6230 ADD_INSN(ret, line_node, putnil);
6231 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_ZSUPER), 0,
6232 PUSH_VAL(DEFINED_ZSUPER));
6238 case NODE_OP_ASGN_OR:
6239 case NODE_OP_ASGN_AND:
6248 expr_type = DEFINED_ASGN;
6255 VALUE str = rb_iseq_defined_string(expr_type);
6256 ADD_INSN1(ret, line_node, putobject, str);
6259 ADD_INSN1(ret, line_node, putobject,
Qtrue);
6266 ADD_SYNTHETIC_INSN(ret, 0, -1, putnil);
6267 iseq_set_exception_local_table(iseq);
6272 const NODE *
const node,
LABEL **lfinish,
VALUE needstr,
bool ignore)
6275 defined_expr0(iseq, ret, node, lfinish, needstr,
false);
6277 int line = nd_line(node);
6278 LABEL *lstart = NEW_LABEL(line);
6279 LABEL *lend = NEW_LABEL(line);
6282 rb_iseq_new_with_callback_new_callback(build_defined_rescue_iseq, NULL);
6283 rescue = NEW_CHILD_ISEQ_WITH_CALLBACK(ifunc,
6285 ISEQ_BODY(iseq)->location.label),
6286 ISEQ_TYPE_RESCUE, 0);
6287 lstart->rescued = LABEL_RESCUE_BEG;
6288 lend->rescued = LABEL_RESCUE_END;
6289 APPEND_LABEL(ret, lcur, lstart);
6290 ADD_LABEL(ret, lend);
6292 ADD_CATCH_ENTRY(CATCH_TYPE_RESCUE, lstart, lend, rescue, lfinish[1]);
6300 const int line = nd_line(node);
6301 const NODE *line_node = node;
6302 if (!RNODE_DEFINED(node)->nd_head) {
6303 VALUE str = rb_iseq_defined_string(DEFINED_NIL);
6304 ADD_INSN1(ret, line_node, putobject, str);
6309 lfinish[0] = NEW_LABEL(line);
6312 defined_expr(iseq, ret, RNODE_DEFINED(node)->nd_head, lfinish, needstr, ignore);
6314 ELEM_INSERT_NEXT(last, &new_insn_body(iseq, nd_line(line_node), nd_node_id(line_node), BIN(putnil), 0)->link);
6315 ADD_INSN(ret, line_node, swap);
6317 ADD_LABEL(ret, lfinish[2]);
6319 ADD_INSN(ret, line_node, pop);
6320 ADD_LABEL(ret, lfinish[1]);
6322 ADD_LABEL(ret, lfinish[0]);
6328make_name_for_block(
const rb_iseq_t *orig_iseq)
6333 if (ISEQ_BODY(orig_iseq)->parent_iseq != 0) {
6334 while (ISEQ_BODY(orig_iseq)->local_iseq != iseq) {
6335 if (ISEQ_BODY(iseq)->
type == ISEQ_TYPE_BLOCK) {
6338 iseq = ISEQ_BODY(iseq)->parent_iseq;
6343 return rb_sprintf(
"block in %"PRIsVALUE, ISEQ_BODY(iseq)->location.label);
6346 return rb_sprintf(
"block (%d levels) in %"PRIsVALUE, level, ISEQ_BODY(iseq)->location.label);
6355 enl->ensure_node = node;
6356 enl->prev = ISEQ_COMPILE_DATA(iseq)->ensure_node_stack;
6358 ISEQ_COMPILE_DATA(iseq)->ensure_node_stack = enl;
6368 while (erange->next != 0) {
6369 erange = erange->next;
6373 ne->end = erange->end;
6374 erange->end = lstart;
6380can_add_ensure_iseq(
const rb_iseq_t *iseq)
6383 if (ISEQ_COMPILE_DATA(iseq)->in_rescue && (e = ISEQ_COMPILE_DATA(iseq)->ensure_node_stack) != NULL) {
6385 if (e->ensure_node)
return false;
6398 ISEQ_COMPILE_DATA(iseq)->ensure_node_stack;
6400 DECL_ANCHOR(ensure);
6402 INIT_ANCHOR(ensure);
6404 if (enlp->erange != NULL) {
6405 DECL_ANCHOR(ensure_part);
6406 LABEL *lstart = NEW_LABEL(0);
6407 LABEL *lend = NEW_LABEL(0);
6408 INIT_ANCHOR(ensure_part);
6410 add_ensure_range(iseq, enlp->erange, lstart, lend);
6412 ISEQ_COMPILE_DATA(iseq)->ensure_node_stack = enlp->prev;
6413 ADD_LABEL(ensure_part, lstart);
6414 NO_CHECK(COMPILE_POPPED(ensure_part,
"ensure part", enlp->ensure_node));
6415 ADD_LABEL(ensure_part, lend);
6416 ADD_SEQ(ensure, ensure_part);
6425 ISEQ_COMPILE_DATA(iseq)->ensure_node_stack = prev_enlp;
6426 ADD_SEQ(ret, ensure);
6431check_keyword(
const NODE *node)
6435 if (nd_type_p(node, NODE_LIST)) {
6436 while (RNODE_LIST(node)->nd_next) {
6437 node = RNODE_LIST(node)->nd_next;
6439 node = RNODE_LIST(node)->nd_head;
6442 return keyword_node_p(node);
6447keyword_node_single_splat_p(
NODE *kwnode)
6451 NODE *node = RNODE_HASH(kwnode)->nd_head;
6452 return RNODE_LIST(node)->nd_head == NULL &&
6453 RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next == NULL;
6458 NODE *kwnode,
unsigned int *flag_ptr)
6460 *flag_ptr |= VM_CALL_KW_SPLAT_MUT;
6461 ADD_INSN1(args, argn, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
6462 ADD_INSN1(args, argn, newhash,
INT2FIX(0));
6463 compile_hash(iseq, args, kwnode, TRUE, FALSE);
6464 ADD_SEND(args, argn, id_core_hash_merge_kwd,
INT2FIX(2));
6467#define SPLATARRAY_FALSE 0
6468#define SPLATARRAY_TRUE 1
6469#define DUP_SINGLE_KW_SPLAT 2
6473 unsigned int *dup_rest,
unsigned int *flag_ptr,
struct rb_callinfo_kwarg **kwarg_ptr)
6475 if (!argn)
return 0;
6477 NODE *kwnode = NULL;
6479 switch (nd_type(argn)) {
6482 int len = compile_args(iseq, args, argn, &kwnode);
6483 RUBY_ASSERT(flag_ptr == NULL || (*flag_ptr & VM_CALL_ARGS_SPLAT) == 0);
6486 if (compile_keyword_arg(iseq, args, kwnode, kwarg_ptr, flag_ptr)) {
6490 if (keyword_node_single_splat_p(kwnode) && (*dup_rest & DUP_SINGLE_KW_SPLAT)) {
6491 compile_single_keyword_splat_mutable(iseq, args, argn, kwnode, flag_ptr);
6494 compile_hash(iseq, args, kwnode, TRUE, FALSE);
6503 NO_CHECK(COMPILE(args,
"args (splat)", RNODE_SPLAT(argn)->nd_head));
6504 ADD_INSN1(args, argn, splatarray, RBOOL(*dup_rest & SPLATARRAY_TRUE));
6505 if (*dup_rest & SPLATARRAY_TRUE) *dup_rest &= ~SPLATARRAY_TRUE;
6506 if (flag_ptr) *flag_ptr |= VM_CALL_ARGS_SPLAT;
6507 RUBY_ASSERT(flag_ptr == NULL || (*flag_ptr & VM_CALL_KW_SPLAT) == 0);
6510 case NODE_ARGSCAT: {
6511 if (flag_ptr) *flag_ptr |= VM_CALL_ARGS_SPLAT;
6512 int argc = setup_args_core(iseq, args, RNODE_ARGSCAT(argn)->nd_head, dup_rest, NULL, NULL);
6513 bool args_pushed =
false;
6515 if (nd_type_p(RNODE_ARGSCAT(argn)->nd_body, NODE_LIST)) {
6516 int rest_len = compile_args(iseq, args, RNODE_ARGSCAT(argn)->nd_body, &kwnode);
6517 if (kwnode) rest_len--;
6518 ADD_INSN1(args, argn, pushtoarray,
INT2FIX(rest_len));
6522 RUBY_ASSERT(!check_keyword(RNODE_ARGSCAT(argn)->nd_body));
6523 NO_CHECK(COMPILE(args,
"args (cat: splat)", RNODE_ARGSCAT(argn)->nd_body));
6526 if (nd_type_p(RNODE_ARGSCAT(argn)->nd_head, NODE_LIST)) {
6527 ADD_INSN1(args, argn, splatarray, RBOOL(*dup_rest & SPLATARRAY_TRUE));
6528 if (*dup_rest & SPLATARRAY_TRUE) *dup_rest &= ~SPLATARRAY_TRUE;
6531 else if (!args_pushed) {
6532 ADD_INSN(args, argn, concattoarray);
6538 *flag_ptr |= VM_CALL_KW_SPLAT;
6539 compile_hash(iseq, args, kwnode, TRUE, FALSE);
6545 case NODE_ARGSPUSH: {
6546 if (flag_ptr) *flag_ptr |= VM_CALL_ARGS_SPLAT;
6547 int argc = setup_args_core(iseq, args, RNODE_ARGSPUSH(argn)->nd_head, dup_rest, NULL, NULL);
6549 if (nd_type_p(RNODE_ARGSPUSH(argn)->nd_body, NODE_LIST)) {
6550 int rest_len = compile_args(iseq, args, RNODE_ARGSPUSH(argn)->nd_body, &kwnode);
6551 if (kwnode) rest_len--;
6552 ADD_INSN1(args, argn, newarray,
INT2FIX(rest_len));
6553 ADD_INSN1(args, argn, pushtoarray,
INT2FIX(1));
6556 if (keyword_node_p(RNODE_ARGSPUSH(argn)->nd_body)) {
6557 kwnode = RNODE_ARGSPUSH(argn)->nd_body;
6560 NO_CHECK(COMPILE(args,
"args (cat: splat)", RNODE_ARGSPUSH(argn)->nd_body));
6561 ADD_INSN1(args, argn, pushtoarray,
INT2FIX(1));
6567 *flag_ptr |= VM_CALL_KW_SPLAT;
6568 if (!keyword_node_single_splat_p(kwnode)) {
6569 *flag_ptr |= VM_CALL_KW_SPLAT_MUT;
6570 compile_hash(iseq, args, kwnode, TRUE, FALSE);
6572 else if (*dup_rest & DUP_SINGLE_KW_SPLAT) {
6573 compile_single_keyword_splat_mutable(iseq, args, argn, kwnode, flag_ptr);
6576 compile_hash(iseq, args, kwnode, TRUE, FALSE);
6584 UNKNOWN_NODE(
"setup_arg", argn,
Qnil);
6590setup_args_splat_mut(
unsigned int *flag,
int dup_rest,
int initial_dup_rest)
6592 if ((*flag & VM_CALL_ARGS_SPLAT) && dup_rest != initial_dup_rest) {
6593 *flag |= VM_CALL_ARGS_SPLAT_MUT;
6598setup_args_dup_rest_p(
const NODE *argn)
6600 switch(nd_type(argn)) {
6611 case NODE_IMAGINARY:
6624 return setup_args_dup_rest_p(RNODE_COLON2(argn)->nd_head);
6627 if (setup_args_dup_rest_p(RNODE_LIST(argn)->nd_head)) {
6630 argn = RNODE_LIST(argn)->nd_next;
6643 unsigned int dup_rest = SPLATARRAY_TRUE, initial_dup_rest;
6646 const NODE *check_arg = nd_type_p(argn, NODE_BLOCK_PASS) ?
6647 RNODE_BLOCK_PASS(argn)->nd_head : argn;
6650 switch(nd_type(check_arg)) {
6653 dup_rest = SPLATARRAY_FALSE;
6657 dup_rest = !nd_type_p(RNODE_ARGSCAT(check_arg)->nd_head, NODE_LIST);
6659 case(NODE_ARGSPUSH):
6661 dup_rest = !((nd_type_p(RNODE_ARGSPUSH(check_arg)->nd_head, NODE_SPLAT) ||
6662 (nd_type_p(RNODE_ARGSPUSH(check_arg)->nd_head, NODE_ARGSCAT) &&
6663 nd_type_p(RNODE_ARGSCAT(RNODE_ARGSPUSH(check_arg)->nd_head)->nd_head, NODE_LIST))) &&
6664 nd_type_p(RNODE_ARGSPUSH(check_arg)->nd_body, NODE_HASH) &&
6665 !RNODE_HASH(RNODE_ARGSPUSH(check_arg)->nd_body)->nd_brace);
6667 if (dup_rest == SPLATARRAY_FALSE) {
6669 NODE *node = RNODE_HASH(RNODE_ARGSPUSH(check_arg)->nd_body)->nd_head;
6671 NODE *key_node = RNODE_LIST(node)->nd_head;
6672 if (key_node && setup_args_dup_rest_p(key_node)) {
6673 dup_rest = SPLATARRAY_TRUE;
6677 node = RNODE_LIST(node)->nd_next;
6678 NODE *value_node = RNODE_LIST(node)->nd_head;
6679 if (setup_args_dup_rest_p(value_node)) {
6680 dup_rest = SPLATARRAY_TRUE;
6684 node = RNODE_LIST(node)->nd_next;
6693 if (check_arg != argn && setup_args_dup_rest_p(RNODE_BLOCK_PASS(argn)->nd_body)) {
6695 dup_rest = SPLATARRAY_TRUE | DUP_SINGLE_KW_SPLAT;
6698 initial_dup_rest = dup_rest;
6700 if (argn && nd_type_p(argn, NODE_BLOCK_PASS)) {
6701 DECL_ANCHOR(arg_block);
6702 INIT_ANCHOR(arg_block);
6704 if (RNODE_BLOCK_PASS(argn)->forwarding && ISEQ_BODY(ISEQ_BODY(iseq)->local_iseq)->param.flags.forwardable) {
6705 int idx = ISEQ_BODY(ISEQ_BODY(iseq)->local_iseq)->local_table_size;
6707 RUBY_ASSERT(nd_type_p(RNODE_BLOCK_PASS(argn)->nd_head, NODE_ARGSPUSH));
6708 const NODE * arg_node =
6709 RNODE_ARGSPUSH(RNODE_BLOCK_PASS(argn)->nd_head)->nd_head;
6716 if (nd_type_p(arg_node, NODE_ARGSCAT)) {
6717 argc += setup_args_core(iseq, args, RNODE_ARGSCAT(arg_node)->nd_head, &dup_rest, flag, keywords);
6720 *flag |= VM_CALL_FORWARDING;
6722 ADD_GETLOCAL(args, argn, idx, get_lvar_level(iseq));
6723 setup_args_splat_mut(flag, dup_rest, initial_dup_rest);
6727 *flag |= VM_CALL_ARGS_BLOCKARG;
6729 NO_CHECK(COMPILE(arg_block,
"block", RNODE_BLOCK_PASS(argn)->nd_body));
6732 if (LIST_INSN_SIZE_ONE(arg_block)) {
6734 if (IS_INSN(elem)) {
6736 if (iobj->insn_id == BIN(getblockparam)) {
6737 iobj->insn_id = BIN(getblockparamproxy);
6741 ret =
INT2FIX(setup_args_core(iseq, args, RNODE_BLOCK_PASS(argn)->nd_head, &dup_rest, flag, keywords));
6742 ADD_SEQ(args, arg_block);
6745 ret =
INT2FIX(setup_args_core(iseq, args, argn, &dup_rest, flag, keywords));
6747 setup_args_splat_mut(flag, dup_rest, initial_dup_rest);
6754 const NODE *body = ptr;
6755 int line = nd_line(body);
6757 const rb_iseq_t *block = NEW_CHILD_ISEQ(body, make_name_for_block(ISEQ_BODY(iseq)->parent_iseq), ISEQ_TYPE_BLOCK, line);
6759 ADD_INSN1(ret, body, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
6760 ADD_CALL_WITH_BLOCK(ret, body, id_core_set_postexe, argc, block);
6762 iseq_set_local_table(iseq, 0, 0);
6770 int line = nd_line(node);
6771 const NODE *line_node = node;
6772 LABEL *fail_label = NEW_LABEL(line), *end_label = NEW_LABEL(line);
6774#if !(defined(NAMED_CAPTURE_BY_SVAR) && NAMED_CAPTURE_BY_SVAR-0)
6775 ADD_INSN1(ret, line_node, getglobal,
ID2SYM(idBACKREF));
6779 ADD_INSN(ret, line_node, dup);
6780 ADD_INSNL(ret, line_node, branchunless, fail_label);
6782 for (vars = node; vars; vars = RNODE_BLOCK(vars)->nd_next) {
6784 if (RNODE_BLOCK(vars)->nd_next) {
6785 ADD_INSN(ret, line_node, dup);
6788 NO_CHECK(COMPILE_POPPED(ret,
"capture", RNODE_BLOCK(vars)->nd_head));
6790 cap = new_insn_send(iseq, nd_line(line_node), nd_node_id(line_node), idAREF,
INT2FIX(1),
6793#if !defined(NAMED_CAPTURE_SINGLE_OPT) || NAMED_CAPTURE_SINGLE_OPT-0
6794 if (!RNODE_BLOCK(vars)->nd_next && vars == node) {
6799 ADD_INSNL(nom, line_node, jump, end_label);
6800 ADD_LABEL(nom, fail_label);
6802 ADD_INSN(nom, line_node, pop);
6803 ADD_INSN(nom, line_node, putnil);
6805 ADD_LABEL(nom, end_label);
6806 (nom->last->next = cap->link.next)->prev = nom->last;
6807 (cap->link.next = nom->anchor.next)->prev = &cap->link;
6812 ADD_INSNL(ret, line_node, jump, end_label);
6813 ADD_LABEL(ret, fail_label);
6814 ADD_INSN(ret, line_node, pop);
6815 for (vars = node; vars; vars = RNODE_BLOCK(vars)->nd_next) {
6817 NO_CHECK(COMPILE_POPPED(ret,
"capture", RNODE_BLOCK(vars)->nd_head));
6819 ((
INSN*)last)->insn_id = BIN(putnil);
6820 ((
INSN*)last)->operand_size = 0;
6822 ADD_LABEL(ret, end_label);
6826optimizable_range_item_p(
const NODE *n)
6828 if (!n)
return FALSE;
6829 switch (nd_type(n)) {
6842optimized_range_item(
const NODE *n)
6844 switch (nd_type(n)) {
6846 return rb_node_line_lineno_val(n);
6848 return rb_node_integer_literal_val(n);
6850 return rb_node_float_literal_val(n);
6852 return rb_node_rational_literal_val(n);
6853 case NODE_IMAGINARY:
6854 return rb_node_imaginary_literal_val(n);
6858 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(n)));
6865 const NODE *
const node_body =
type == NODE_IF ? RNODE_IF(node)->nd_body : RNODE_UNLESS(node)->nd_else;
6866 const NODE *
const node_else =
type == NODE_IF ? RNODE_IF(node)->nd_else : RNODE_UNLESS(node)->nd_body;
6868 const int line = nd_line(node);
6869 const NODE *line_node = node;
6870 DECL_ANCHOR(cond_seq);
6871 LABEL *then_label, *else_label, *end_label;
6874 INIT_ANCHOR(cond_seq);
6875 then_label = NEW_LABEL(line);
6876 else_label = NEW_LABEL(line);
6879 NODE *cond = RNODE_IF(node)->nd_cond;
6880 if (nd_type(cond) == NODE_BLOCK) {
6881 cond = RNODE_BLOCK(cond)->nd_head;
6884 CHECK(compile_branch_condition(iseq, cond_seq, cond, then_label, else_label));
6885 ADD_SEQ(ret, cond_seq);
6887 if (then_label->refcnt && else_label->refcnt) {
6888 branches = decl_branch_base(iseq, PTR2NUM(node), nd_code_loc(node),
type == NODE_IF ?
"if" :
"unless");
6891 if (then_label->refcnt) {
6892 ADD_LABEL(ret, then_label);
6894 DECL_ANCHOR(then_seq);
6895 INIT_ANCHOR(then_seq);
6896 CHECK(COMPILE_(then_seq,
"then", node_body, popped));
6898 if (else_label->refcnt) {
6899 const NODE *
const coverage_node = node_body ? node_body : node;
6900 add_trace_branch_coverage(
6903 nd_code_loc(coverage_node),
6904 nd_node_id(coverage_node),
6906 type == NODE_IF ?
"then" :
"else",
6908 end_label = NEW_LABEL(line);
6909 ADD_INSNL(then_seq, line_node, jump, end_label);
6911 ADD_INSN(then_seq, line_node, pop);
6914 ADD_SEQ(ret, then_seq);
6917 if (else_label->refcnt) {
6918 ADD_LABEL(ret, else_label);
6920 DECL_ANCHOR(else_seq);
6921 INIT_ANCHOR(else_seq);
6922 CHECK(COMPILE_(else_seq,
"else", node_else, popped));
6924 if (then_label->refcnt) {
6925 const NODE *
const coverage_node = node_else ? node_else : node;
6926 add_trace_branch_coverage(
6929 nd_code_loc(coverage_node),
6930 nd_node_id(coverage_node),
6932 type == NODE_IF ?
"else" :
"then",
6935 ADD_SEQ(ret, else_seq);
6939 ADD_LABEL(ret, end_label);
6949 const NODE *node = orig_node;
6950 LABEL *endlabel, *elselabel;
6952 DECL_ANCHOR(body_seq);
6953 DECL_ANCHOR(cond_seq);
6954 int only_special_literals = 1;
6955 VALUE literals = rb_hash_new();
6957 enum node_type
type;
6958 const NODE *line_node;
6963 INIT_ANCHOR(body_seq);
6964 INIT_ANCHOR(cond_seq);
6966 RHASH_TBL_RAW(literals)->type = &cdhash_type;
6968 CHECK(COMPILE(head,
"case base", RNODE_CASE(node)->nd_head));
6970 branches = decl_branch_base(iseq, PTR2NUM(node), nd_code_loc(node),
"case");
6972 node = RNODE_CASE(node)->nd_body;
6973 EXPECT_NODE(
"NODE_CASE", node, NODE_WHEN, COMPILE_NG);
6974 type = nd_type(node);
6975 line = nd_line(node);
6978 endlabel = NEW_LABEL(line);
6979 elselabel = NEW_LABEL(line);
6983 while (
type == NODE_WHEN) {
6986 l1 = NEW_LABEL(line);
6987 ADD_LABEL(body_seq, l1);
6988 ADD_INSN(body_seq, line_node, pop);
6990 const NODE *
const coverage_node = RNODE_WHEN(node)->nd_body ? RNODE_WHEN(node)->nd_body : node;
6991 add_trace_branch_coverage(
6994 nd_code_loc(coverage_node),
6995 nd_node_id(coverage_node),
7000 CHECK(COMPILE_(body_seq,
"when body", RNODE_WHEN(node)->nd_body, popped));
7001 ADD_INSNL(body_seq, line_node, jump, endlabel);
7003 vals = RNODE_WHEN(node)->nd_head;
7005 switch (nd_type(vals)) {
7007 only_special_literals = when_vals(iseq, cond_seq, vals, l1, only_special_literals, literals);
7008 if (only_special_literals < 0)
return COMPILE_NG;
7013 only_special_literals = 0;
7014 CHECK(when_splat_vals(iseq, cond_seq, vals, l1, only_special_literals, literals));
7017 UNKNOWN_NODE(
"NODE_CASE", vals, COMPILE_NG);
7021 EXPECT_NODE_NONULL(
"NODE_CASE", node, NODE_LIST, COMPILE_NG);
7024 node = RNODE_WHEN(node)->nd_next;
7028 type = nd_type(node);
7029 line = nd_line(node);
7034 ADD_LABEL(cond_seq, elselabel);
7035 ADD_INSN(cond_seq, line_node, pop);
7036 add_trace_branch_coverage(iseq, cond_seq, nd_code_loc(node), nd_node_id(node), branch_id,
"else", branches);
7037 CHECK(COMPILE_(cond_seq,
"else", node, popped));
7038 ADD_INSNL(cond_seq, line_node, jump, endlabel);
7041 debugs(
"== else (implicit)\n");
7042 ADD_LABEL(cond_seq, elselabel);
7043 ADD_INSN(cond_seq, orig_node, pop);
7044 add_trace_branch_coverage(iseq, cond_seq, nd_code_loc(orig_node), nd_node_id(orig_node), branch_id,
"else", branches);
7046 ADD_INSN(cond_seq, orig_node, putnil);
7048 ADD_INSNL(cond_seq, orig_node, jump, endlabel);
7051 if (only_special_literals && ISEQ_COMPILE_DATA(iseq)->option->specialized_instruction) {
7052 ADD_INSN(ret, orig_node, dup);
7053 ADD_INSN2(ret, orig_node, opt_case_dispatch, literals, elselabel);
7055 LABEL_REF(elselabel);
7058 ADD_SEQ(ret, cond_seq);
7059 ADD_SEQ(ret, body_seq);
7060 ADD_LABEL(ret, endlabel);
7069 const NODE *node = RNODE_CASE2(orig_node)->nd_body;
7071 DECL_ANCHOR(body_seq);
7075 branches = decl_branch_base(iseq, PTR2NUM(orig_node), nd_code_loc(orig_node),
"case");
7077 INIT_ANCHOR(body_seq);
7078 endlabel = NEW_LABEL(nd_line(node));
7080 while (node && nd_type_p(node, NODE_WHEN)) {
7081 const int line = nd_line(node);
7082 LABEL *l1 = NEW_LABEL(line);
7083 ADD_LABEL(body_seq, l1);
7085 const NODE *
const coverage_node = RNODE_WHEN(node)->nd_body ? RNODE_WHEN(node)->nd_body : node;
7086 add_trace_branch_coverage(
7089 nd_code_loc(coverage_node),
7090 nd_node_id(coverage_node),
7095 CHECK(COMPILE_(body_seq,
"when", RNODE_WHEN(node)->nd_body, popped));
7096 ADD_INSNL(body_seq, node, jump, endlabel);
7098 vals = RNODE_WHEN(node)->nd_head;
7100 EXPECT_NODE_NONULL(
"NODE_WHEN", node, NODE_LIST, COMPILE_NG);
7102 switch (nd_type(vals)) {
7106 val = RNODE_LIST(vals)->nd_head;
7107 lnext = NEW_LABEL(nd_line(val));
7108 debug_compile(
"== when2\n", (
void)0);
7109 CHECK(compile_branch_condition(iseq, ret, val, l1, lnext));
7110 ADD_LABEL(ret, lnext);
7111 vals = RNODE_LIST(vals)->nd_next;
7117 ADD_INSN(ret, vals, putnil);
7118 CHECK(COMPILE(ret,
"when2/cond splat", vals));
7119 ADD_INSN1(ret, vals, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_WHEN | VM_CHECKMATCH_ARRAY));
7120 ADD_INSNL(ret, vals, branchif, l1);
7123 UNKNOWN_NODE(
"NODE_WHEN", vals, COMPILE_NG);
7125 node = RNODE_WHEN(node)->nd_next;
7128 const NODE *
const coverage_node = node ? node : orig_node;
7129 add_trace_branch_coverage(
7132 nd_code_loc(coverage_node),
7133 nd_node_id(coverage_node),
7137 CHECK(COMPILE_(ret,
"else", node, popped));
7138 ADD_INSNL(ret, orig_node, jump, endlabel);
7140 ADD_SEQ(ret, body_seq);
7141 ADD_LABEL(ret, endlabel);
7145static int iseq_compile_pattern_match(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
LABEL *unmatched,
bool in_single_pattern,
bool in_alt_pattern,
int base_index,
bool use_deconstructed_cache);
7147static int iseq_compile_pattern_constant(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
LABEL *match_failed,
bool in_single_pattern,
int base_index);
7148static int iseq_compile_array_deconstruct(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
LABEL *deconstruct,
LABEL *deconstructed,
LABEL *match_failed,
LABEL *type_error,
bool in_single_pattern,
int base_index,
bool use_deconstructed_cache);
7149static int iseq_compile_pattern_set_general_errmsg(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
VALUE errmsg,
int base_index);
7150static int iseq_compile_pattern_set_length_errmsg(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
VALUE errmsg,
VALUE pattern_length,
int base_index);
7151static int iseq_compile_pattern_set_eqq_errmsg(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
int base_index);
7153#define CASE3_BI_OFFSET_DECONSTRUCTED_CACHE 0
7154#define CASE3_BI_OFFSET_ERROR_STRING 1
7155#define CASE3_BI_OFFSET_KEY_ERROR_P 2
7156#define CASE3_BI_OFFSET_KEY_ERROR_MATCHEE 3
7157#define CASE3_BI_OFFSET_KEY_ERROR_KEY 4
7160iseq_compile_pattern_each(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
LABEL *matched,
LABEL *unmatched,
bool in_single_pattern,
bool in_alt_pattern,
int base_index,
bool use_deconstructed_cache)
7162 const int line = nd_line(node);
7163 const NODE *line_node = node;
7165 switch (nd_type(node)) {
7219 const NODE *args = RNODE_ARYPTN(node)->pre_args;
7220 const int pre_args_num = RNODE_ARYPTN(node)->pre_args ?
rb_long2int(RNODE_LIST(RNODE_ARYPTN(node)->pre_args)->as.nd_alen) : 0;
7221 const int post_args_num = RNODE_ARYPTN(node)->post_args ?
rb_long2int(RNODE_LIST(RNODE_ARYPTN(node)->post_args)->as.nd_alen) : 0;
7223 const int min_argc = pre_args_num + post_args_num;
7224 const int use_rest_num = RNODE_ARYPTN(node)->rest_arg && (NODE_NAMED_REST_P(RNODE_ARYPTN(node)->rest_arg) ||
7225 (!NODE_NAMED_REST_P(RNODE_ARYPTN(node)->rest_arg) && post_args_num > 0));
7227 LABEL *match_failed, *type_error, *deconstruct, *deconstructed;
7229 match_failed = NEW_LABEL(line);
7230 type_error = NEW_LABEL(line);
7231 deconstruct = NEW_LABEL(line);
7232 deconstructed = NEW_LABEL(line);
7235 ADD_INSN1(ret, line_node, putobject,
INT2FIX(0));
7236 ADD_INSN(ret, line_node, swap);
7242 CHECK(iseq_compile_pattern_constant(iseq, ret, node, match_failed, in_single_pattern, base_index));
7244 CHECK(iseq_compile_array_deconstruct(iseq, ret, node, deconstruct, deconstructed, match_failed, type_error, in_single_pattern, base_index, use_deconstructed_cache));
7246 ADD_INSN(ret, line_node, dup);
7247 ADD_SEND(ret, line_node, idLength,
INT2FIX(0));
7248 ADD_INSN1(ret, line_node, putobject,
INT2FIX(min_argc));
7249 ADD_SEND(ret, line_node, RNODE_ARYPTN(node)->rest_arg ? idGE : idEq,
INT2FIX(1));
7250 if (in_single_pattern) {
7251 CHECK(iseq_compile_pattern_set_length_errmsg(iseq, ret, node,
7252 RNODE_ARYPTN(node)->rest_arg ? rb_fstring_lit(
"%p length mismatch (given %p, expected %p+)") :
7253 rb_fstring_lit(
"%p length mismatch (given %p, expected %p)"),
7254 INT2FIX(min_argc), base_index + 1 ));
7256 ADD_INSNL(ret, line_node, branchunless, match_failed);
7258 for (i = 0; i < pre_args_num; i++) {
7259 ADD_INSN(ret, line_node, dup);
7260 ADD_INSN1(ret, line_node, putobject,
INT2FIX(i));
7261 ADD_SEND(ret, line_node, idAREF,
INT2FIX(1));
7262 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_LIST(args)->nd_head, match_failed, in_single_pattern, in_alt_pattern, base_index + 1 ,
false));
7263 args = RNODE_LIST(args)->nd_next;
7266 if (RNODE_ARYPTN(node)->rest_arg) {
7267 if (NODE_NAMED_REST_P(RNODE_ARYPTN(node)->rest_arg)) {
7268 ADD_INSN(ret, line_node, dup);
7269 ADD_INSN1(ret, line_node, putobject,
INT2FIX(pre_args_num));
7270 ADD_INSN1(ret, line_node, topn,
INT2FIX(1));
7271 ADD_SEND(ret, line_node, idLength,
INT2FIX(0));
7272 ADD_INSN1(ret, line_node, putobject,
INT2FIX(min_argc));
7273 ADD_SEND(ret, line_node, idMINUS,
INT2FIX(1));
7274 ADD_INSN1(ret, line_node, setn,
INT2FIX(4));
7275 ADD_SEND(ret, line_node, idAREF,
INT2FIX(2));
7277 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_ARYPTN(node)->rest_arg, match_failed, in_single_pattern, in_alt_pattern, base_index + 1 ,
false));
7280 if (post_args_num > 0) {
7281 ADD_INSN(ret, line_node, dup);
7282 ADD_SEND(ret, line_node, idLength,
INT2FIX(0));
7283 ADD_INSN1(ret, line_node, putobject,
INT2FIX(min_argc));
7284 ADD_SEND(ret, line_node, idMINUS,
INT2FIX(1));
7285 ADD_INSN1(ret, line_node, setn,
INT2FIX(2));
7286 ADD_INSN(ret, line_node, pop);
7291 args = RNODE_ARYPTN(node)->post_args;
7292 for (i = 0; i < post_args_num; i++) {
7293 ADD_INSN(ret, line_node, dup);
7295 ADD_INSN1(ret, line_node, putobject,
INT2FIX(pre_args_num + i));
7296 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7297 ADD_SEND(ret, line_node, idPLUS,
INT2FIX(1));
7299 ADD_SEND(ret, line_node, idAREF,
INT2FIX(1));
7300 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_LIST(args)->nd_head, match_failed, in_single_pattern, in_alt_pattern, base_index + 1 ,
false));
7301 args = RNODE_LIST(args)->nd_next;
7304 ADD_INSN(ret, line_node, pop);
7306 ADD_INSN(ret, line_node, pop);
7308 ADD_INSNL(ret, line_node, jump, matched);
7309 ADD_INSN(ret, line_node, putnil);
7311 ADD_INSN(ret, line_node, putnil);
7314 ADD_LABEL(ret, type_error);
7315 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
7317 ADD_INSN1(ret, line_node, putobject, rb_fstring_lit(
"deconstruct must return Array"));
7318 ADD_SEND(ret, line_node, id_core_raise,
INT2FIX(2));
7319 ADD_INSN(ret, line_node, pop);
7321 ADD_LABEL(ret, match_failed);
7322 ADD_INSN(ret, line_node, pop);
7324 ADD_INSN(ret, line_node, pop);
7326 ADD_INSNL(ret, line_node, jump, unmatched);
7379 const NODE *args = RNODE_FNDPTN(node)->args;
7380 const int args_num = RNODE_FNDPTN(node)->args ?
rb_long2int(RNODE_LIST(RNODE_FNDPTN(node)->args)->as.nd_alen) : 0;
7382 LABEL *match_failed, *type_error, *deconstruct, *deconstructed;
7383 match_failed = NEW_LABEL(line);
7384 type_error = NEW_LABEL(line);
7385 deconstruct = NEW_LABEL(line);
7386 deconstructed = NEW_LABEL(line);
7388 CHECK(iseq_compile_pattern_constant(iseq, ret, node, match_failed, in_single_pattern, base_index));
7390 CHECK(iseq_compile_array_deconstruct(iseq, ret, node, deconstruct, deconstructed, match_failed, type_error, in_single_pattern, base_index, use_deconstructed_cache));
7392 ADD_INSN(ret, line_node, dup);
7393 ADD_SEND(ret, line_node, idLength,
INT2FIX(0));
7394 ADD_INSN1(ret, line_node, putobject,
INT2FIX(args_num));
7395 ADD_SEND(ret, line_node, idGE,
INT2FIX(1));
7396 if (in_single_pattern) {
7397 CHECK(iseq_compile_pattern_set_length_errmsg(iseq, ret, node, rb_fstring_lit(
"%p length mismatch (given %p, expected %p+)"),
INT2FIX(args_num), base_index + 1 ));
7399 ADD_INSNL(ret, line_node, branchunless, match_failed);
7402 LABEL *while_begin = NEW_LABEL(nd_line(node));
7403 LABEL *next_loop = NEW_LABEL(nd_line(node));
7404 LABEL *find_succeeded = NEW_LABEL(line);
7405 LABEL *find_failed = NEW_LABEL(nd_line(node));
7408 ADD_INSN(ret, line_node, dup);
7409 ADD_SEND(ret, line_node, idLength,
INT2FIX(0));
7411 ADD_INSN(ret, line_node, dup);
7412 ADD_INSN1(ret, line_node, putobject,
INT2FIX(args_num));
7413 ADD_SEND(ret, line_node, idMINUS,
INT2FIX(1));
7415 ADD_INSN1(ret, line_node, putobject,
INT2FIX(0));
7417 ADD_LABEL(ret, while_begin);
7419 ADD_INSN(ret, line_node, dup);
7420 ADD_INSN1(ret, line_node, topn,
INT2FIX(2));
7421 ADD_SEND(ret, line_node, idLE,
INT2FIX(1));
7422 ADD_INSNL(ret, line_node, branchunless, find_failed);
7424 for (j = 0; j < args_num; j++) {
7425 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7426 ADD_INSN1(ret, line_node, topn,
INT2FIX(1));
7428 ADD_INSN1(ret, line_node, putobject,
INT2FIX(j));
7429 ADD_SEND(ret, line_node, idPLUS,
INT2FIX(1));
7431 ADD_SEND(ret, line_node, idAREF,
INT2FIX(1));
7433 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_LIST(args)->nd_head, next_loop, in_single_pattern, in_alt_pattern, base_index + 4 ,
false));
7434 args = RNODE_LIST(args)->nd_next;
7437 if (NODE_NAMED_REST_P(RNODE_FNDPTN(node)->pre_rest_arg)) {
7438 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7439 ADD_INSN1(ret, line_node, putobject,
INT2FIX(0));
7440 ADD_INSN1(ret, line_node, topn,
INT2FIX(2));
7441 ADD_SEND(ret, line_node, idAREF,
INT2FIX(2));
7442 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_FNDPTN(node)->pre_rest_arg, find_failed, in_single_pattern, in_alt_pattern, base_index + 4 ,
false));
7444 if (NODE_NAMED_REST_P(RNODE_FNDPTN(node)->post_rest_arg)) {
7445 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7446 ADD_INSN1(ret, line_node, topn,
INT2FIX(1));
7447 ADD_INSN1(ret, line_node, putobject,
INT2FIX(args_num));
7448 ADD_SEND(ret, line_node, idPLUS,
INT2FIX(1));
7449 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7450 ADD_SEND(ret, line_node, idAREF,
INT2FIX(2));
7451 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_FNDPTN(node)->post_rest_arg, find_failed, in_single_pattern, in_alt_pattern, base_index + 4 ,
false));
7453 ADD_INSNL(ret, line_node, jump, find_succeeded);
7455 ADD_LABEL(ret, next_loop);
7456 ADD_INSN1(ret, line_node, putobject,
INT2FIX(1));
7457 ADD_SEND(ret, line_node, idPLUS,
INT2FIX(1));
7458 ADD_INSNL(ret, line_node, jump, while_begin);
7460 ADD_LABEL(ret, find_failed);
7461 ADD_INSN1(ret, line_node, adjuststack,
INT2FIX(3));
7462 if (in_single_pattern) {
7463 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
7464 ADD_INSN1(ret, line_node, putobject, rb_fstring_lit(
"%p does not match to find pattern"));
7465 ADD_INSN1(ret, line_node, topn,
INT2FIX(2));
7466 ADD_SEND(ret, line_node, id_core_sprintf,
INT2FIX(2));
7467 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_ERROR_STRING + 1 ));
7469 ADD_INSN1(ret, line_node, putobject,
Qfalse);
7470 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_P + 2 ));
7472 ADD_INSN(ret, line_node, pop);
7473 ADD_INSN(ret, line_node, pop);
7475 ADD_INSNL(ret, line_node, jump, match_failed);
7476 ADD_INSN1(ret, line_node, dupn,
INT2FIX(3));
7478 ADD_LABEL(ret, find_succeeded);
7479 ADD_INSN1(ret, line_node, adjuststack,
INT2FIX(3));
7482 ADD_INSN(ret, line_node, pop);
7483 ADD_INSNL(ret, line_node, jump, matched);
7484 ADD_INSN(ret, line_node, putnil);
7486 ADD_LABEL(ret, type_error);
7487 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
7489 ADD_INSN1(ret, line_node, putobject, rb_fstring_lit(
"deconstruct must return Array"));
7490 ADD_SEND(ret, line_node, id_core_raise,
INT2FIX(2));
7491 ADD_INSN(ret, line_node, pop);
7493 ADD_LABEL(ret, match_failed);
7494 ADD_INSN(ret, line_node, pop);
7495 ADD_INSNL(ret, line_node, jump, unmatched);
7559 LABEL *match_failed, *type_error;
7562 match_failed = NEW_LABEL(line);
7563 type_error = NEW_LABEL(line);
7565 if (RNODE_HSHPTN(node)->nd_pkwargs && !RNODE_HSHPTN(node)->nd_pkwrestarg) {
7566 const NODE *kw_args = RNODE_HASH(RNODE_HSHPTN(node)->nd_pkwargs)->nd_head;
7567 keys =
rb_ary_new_capa(kw_args ? RNODE_LIST(kw_args)->as.nd_alen/2 : 0);
7569 rb_ary_push(keys, get_symbol_value(iseq, RNODE_LIST(kw_args)->nd_head));
7570 kw_args = RNODE_LIST(RNODE_LIST(kw_args)->nd_next)->nd_next;
7574 CHECK(iseq_compile_pattern_constant(iseq, ret, node, match_failed, in_single_pattern, base_index));
7576 ADD_INSN(ret, line_node, dup);
7577 ADD_INSN1(ret, line_node, putobject,
ID2SYM(rb_intern(
"deconstruct_keys")));
7578 ADD_SEND(ret, line_node, idRespond_to,
INT2FIX(1));
7579 if (in_single_pattern) {
7580 CHECK(iseq_compile_pattern_set_general_errmsg(iseq, ret, node, rb_fstring_lit(
"%p does not respond to #deconstruct_keys"), base_index + 1 ));
7582 ADD_INSNL(ret, line_node, branchunless, match_failed);
7585 ADD_INSN(ret, line_node, putnil);
7588 ADD_INSN1(ret, line_node, duparray, keys);
7591 ADD_SEND(ret, line_node, rb_intern(
"deconstruct_keys"),
INT2FIX(1));
7593 ADD_INSN(ret, line_node, dup);
7595 ADD_INSNL(ret, line_node, branchunless, type_error);
7597 if (RNODE_HSHPTN(node)->nd_pkwrestarg) {
7598 ADD_SEND(ret, line_node, rb_intern(
"dup"),
INT2FIX(0));
7601 if (RNODE_HSHPTN(node)->nd_pkwargs) {
7605 args = RNODE_HASH(RNODE_HSHPTN(node)->nd_pkwargs)->nd_head;
7607 DECL_ANCHOR(match_values);
7608 INIT_ANCHOR(match_values);
7609 keys_num =
rb_long2int(RNODE_LIST(args)->as.nd_alen) / 2;
7610 for (i = 0; i < keys_num; i++) {
7611 NODE *key_node = RNODE_LIST(args)->nd_head;
7612 NODE *value_node = RNODE_LIST(RNODE_LIST(args)->nd_next)->nd_head;
7613 VALUE key = get_symbol_value(iseq, key_node);
7615 ADD_INSN(ret, line_node, dup);
7616 ADD_INSN1(ret, line_node, putobject, key);
7617 ADD_SEND(ret, line_node, rb_intern(
"key?"),
INT2FIX(1));
7618 if (in_single_pattern) {
7619 LABEL *match_succeeded;
7620 match_succeeded = NEW_LABEL(line);
7622 ADD_INSN(ret, line_node, dup);
7623 ADD_INSNL(ret, line_node, branchif, match_succeeded);
7625 ADD_INSN1(ret, line_node, putobject,
rb_str_freeze(rb_sprintf(
"key not found: %+"PRIsVALUE, key)));
7626 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_ERROR_STRING + 2 ));
7627 ADD_INSN1(ret, line_node, putobject,
Qtrue);
7628 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_P + 3 ));
7629 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7630 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_MATCHEE + 4 ));
7631 ADD_INSN1(ret, line_node, putobject, key);
7632 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_KEY + 5 ));
7634 ADD_INSN1(ret, line_node, adjuststack,
INT2FIX(4));
7636 ADD_LABEL(ret, match_succeeded);
7638 ADD_INSNL(ret, line_node, branchunless, match_failed);
7640 ADD_INSN(match_values, line_node, dup);
7641 ADD_INSN1(match_values, line_node, putobject, key);
7642 ADD_SEND(match_values, line_node, RNODE_HSHPTN(node)->nd_pkwrestarg ? rb_intern(
"delete") : idAREF,
INT2FIX(1));
7643 CHECK(iseq_compile_pattern_match(iseq, match_values, value_node, match_failed, in_single_pattern, in_alt_pattern, base_index + 1 ,
false));
7644 args = RNODE_LIST(RNODE_LIST(args)->nd_next)->nd_next;
7646 ADD_SEQ(ret, match_values);
7650 ADD_INSN(ret, line_node, dup);
7651 ADD_SEND(ret, line_node, idEmptyP,
INT2FIX(0));
7652 if (in_single_pattern) {
7653 CHECK(iseq_compile_pattern_set_general_errmsg(iseq, ret, node, rb_fstring_lit(
"%p is not empty"), base_index + 1 ));
7655 ADD_INSNL(ret, line_node, branchunless, match_failed);
7658 if (RNODE_HSHPTN(node)->nd_pkwrestarg) {
7659 if (RNODE_HSHPTN(node)->nd_pkwrestarg == NODE_SPECIAL_NO_REST_KEYWORD) {
7660 ADD_INSN(ret, line_node, dup);
7661 ADD_SEND(ret, line_node, idEmptyP,
INT2FIX(0));
7662 if (in_single_pattern) {
7663 CHECK(iseq_compile_pattern_set_general_errmsg(iseq, ret, node, rb_fstring_lit(
"rest of %p is not empty"), base_index + 1 ));
7665 ADD_INSNL(ret, line_node, branchunless, match_failed);
7668 ADD_INSN(ret, line_node, dup);
7669 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_HSHPTN(node)->nd_pkwrestarg, match_failed, in_single_pattern, in_alt_pattern, base_index + 1 ,
false));
7673 ADD_INSN(ret, line_node, pop);
7674 ADD_INSNL(ret, line_node, jump, matched);
7675 ADD_INSN(ret, line_node, putnil);
7677 ADD_LABEL(ret, type_error);
7678 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
7680 ADD_INSN1(ret, line_node, putobject, rb_fstring_lit(
"deconstruct_keys must return Hash"));
7681 ADD_SEND(ret, line_node, id_core_raise,
INT2FIX(2));
7682 ADD_INSN(ret, line_node, pop);
7684 ADD_LABEL(ret, match_failed);
7685 ADD_INSN(ret, line_node, pop);
7686 ADD_INSNL(ret, line_node, jump, unmatched);
7695 case NODE_IMAGINARY:
7723 CHECK(COMPILE(ret,
"case in literal", node));
7724 if (in_single_pattern) {
7725 ADD_INSN1(ret, line_node, dupn,
INT2FIX(2));
7727 ADD_INSN1(ret, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_CASE));
7728 if (in_single_pattern) {
7729 CHECK(iseq_compile_pattern_set_eqq_errmsg(iseq, ret, node, base_index + 2 ));
7731 ADD_INSNL(ret, line_node, branchif, matched);
7732 ADD_INSNL(ret, line_node, jump, unmatched);
7736 ID id = RNODE_LASGN(node)->nd_vid;
7737 int idx = ISEQ_BODY(body->local_iseq)->local_table_size - get_local_var_idx(iseq,
id);
7739 if (in_alt_pattern) {
7740 const char *name = rb_id2name(
id);
7741 if (name && strlen(name) > 0 && name[0] !=
'_') {
7742 COMPILE_ERROR(ERROR_ARGS
"illegal variable in alternative pattern (%"PRIsVALUE
")",
7748 ADD_SETLOCAL(ret, line_node, idx, get_lvar_level(iseq));
7749 ADD_INSNL(ret, line_node, jump, matched);
7754 ID id = RNODE_DASGN(node)->nd_vid;
7756 idx = get_dyna_var_idx(iseq,
id, &lv, &ls);
7758 if (in_alt_pattern) {
7759 const char *name = rb_id2name(
id);
7760 if (name && strlen(name) > 0 && name[0] !=
'_') {
7761 COMPILE_ERROR(ERROR_ARGS
"illegal variable in alternative pattern (%"PRIsVALUE
")",
7768 COMPILE_ERROR(ERROR_ARGS
"NODE_DASGN: unknown id (%"PRIsVALUE
")",
7772 ADD_SETLOCAL(ret, line_node, ls - idx, lv);
7773 ADD_INSNL(ret, line_node, jump, matched);
7778 LABEL *match_failed;
7779 match_failed = unmatched;
7780 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_IF(node)->nd_body, unmatched, in_single_pattern, in_alt_pattern, base_index, use_deconstructed_cache));
7781 CHECK(COMPILE(ret,
"case in if", RNODE_IF(node)->nd_cond));
7782 if (in_single_pattern) {
7783 LABEL *match_succeeded;
7784 match_succeeded = NEW_LABEL(line);
7786 ADD_INSN(ret, line_node, dup);
7787 if (nd_type_p(node, NODE_IF)) {
7788 ADD_INSNL(ret, line_node, branchif, match_succeeded);
7791 ADD_INSNL(ret, line_node, branchunless, match_succeeded);
7794 ADD_INSN1(ret, line_node, putobject, rb_fstring_lit(
"guard clause does not return true"));
7795 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_ERROR_STRING + 1 ));
7796 ADD_INSN1(ret, line_node, putobject,
Qfalse);
7797 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_P + 2 ));
7799 ADD_INSN(ret, line_node, pop);
7800 ADD_INSN(ret, line_node, pop);
7802 ADD_LABEL(ret, match_succeeded);
7804 if (nd_type_p(node, NODE_IF)) {
7805 ADD_INSNL(ret, line_node, branchunless, match_failed);
7808 ADD_INSNL(ret, line_node, branchif, match_failed);
7810 ADD_INSNL(ret, line_node, jump, matched);
7815 LABEL *match_failed;
7816 match_failed = NEW_LABEL(line);
7818 n = RNODE_HASH(node)->nd_head;
7819 if (! (nd_type_p(n, NODE_LIST) && RNODE_LIST(n)->as.nd_alen == 2)) {
7820 COMPILE_ERROR(ERROR_ARGS
"unexpected node");
7824 ADD_INSN(ret, line_node, dup);
7825 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_LIST(n)->nd_head, match_failed, in_single_pattern, in_alt_pattern, base_index + 1 , use_deconstructed_cache));
7826 CHECK(iseq_compile_pattern_each(iseq, ret, RNODE_LIST(RNODE_LIST(n)->nd_next)->nd_head, matched, match_failed, in_single_pattern, in_alt_pattern, base_index,
false));
7827 ADD_INSN(ret, line_node, putnil);
7829 ADD_LABEL(ret, match_failed);
7830 ADD_INSN(ret, line_node, pop);
7831 ADD_INSNL(ret, line_node, jump, unmatched);
7835 LABEL *match_succeeded, *fin;
7836 match_succeeded = NEW_LABEL(line);
7837 fin = NEW_LABEL(line);
7839 ADD_INSN(ret, line_node, dup);
7840 CHECK(iseq_compile_pattern_each(iseq, ret, RNODE_OR(node)->nd_1st, match_succeeded, fin, in_single_pattern,
true, base_index + 1 , use_deconstructed_cache));
7841 ADD_LABEL(ret, match_succeeded);
7842 ADD_INSN(ret, line_node, pop);
7843 ADD_INSNL(ret, line_node, jump, matched);
7844 ADD_INSN(ret, line_node, putnil);
7845 ADD_LABEL(ret, fin);
7846 CHECK(iseq_compile_pattern_each(iseq, ret, RNODE_OR(node)->nd_2nd, matched, unmatched, in_single_pattern,
true, base_index, use_deconstructed_cache));
7850 UNKNOWN_NODE(
"NODE_IN", node, COMPILE_NG);
7856iseq_compile_pattern_match(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
LABEL *unmatched,
bool in_single_pattern,
bool in_alt_pattern,
int base_index,
bool use_deconstructed_cache)
7858 LABEL *fin = NEW_LABEL(nd_line(node));
7859 CHECK(iseq_compile_pattern_each(iseq, ret, node, fin, unmatched, in_single_pattern, in_alt_pattern, base_index, use_deconstructed_cache));
7860 ADD_LABEL(ret, fin);
7865iseq_compile_pattern_constant(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
LABEL *match_failed,
bool in_single_pattern,
int base_index)
7867 const NODE *line_node = node;
7869 if (RNODE_ARYPTN(node)->nd_pconst) {
7870 ADD_INSN(ret, line_node, dup);
7871 CHECK(COMPILE(ret,
"constant", RNODE_ARYPTN(node)->nd_pconst));
7872 if (in_single_pattern) {
7873 ADD_INSN1(ret, line_node, dupn,
INT2FIX(2));
7875 ADD_INSN1(ret, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_CASE));
7876 if (in_single_pattern) {
7877 CHECK(iseq_compile_pattern_set_eqq_errmsg(iseq, ret, node, base_index + 3 ));
7879 ADD_INSNL(ret, line_node, branchunless, match_failed);
7886iseq_compile_array_deconstruct(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
LABEL *deconstruct,
LABEL *deconstructed,
LABEL *match_failed,
LABEL *type_error,
bool in_single_pattern,
int base_index,
bool use_deconstructed_cache)
7888 const NODE *line_node = node;
7892 if (use_deconstructed_cache) {
7894 ADD_INSN1(ret, line_node, topn,
INT2FIX(base_index + CASE3_BI_OFFSET_DECONSTRUCTED_CACHE));
7895 ADD_INSNL(ret, line_node, branchnil, deconstruct);
7898 ADD_INSN1(ret, line_node, topn,
INT2FIX(base_index + CASE3_BI_OFFSET_DECONSTRUCTED_CACHE));
7899 ADD_INSNL(ret, line_node, branchunless, match_failed);
7902 ADD_INSN(ret, line_node, pop);
7903 ADD_INSN1(ret, line_node, topn,
INT2FIX(base_index + CASE3_BI_OFFSET_DECONSTRUCTED_CACHE - 1 ));
7904 ADD_INSNL(ret, line_node, jump, deconstructed);
7907 ADD_INSNL(ret, line_node, jump, deconstruct);
7910 ADD_LABEL(ret, deconstruct);
7911 ADD_INSN(ret, line_node, dup);
7912 ADD_INSN1(ret, line_node, putobject,
ID2SYM(rb_intern(
"deconstruct")));
7913 ADD_SEND(ret, line_node, idRespond_to,
INT2FIX(1));
7916 if (use_deconstructed_cache) {
7917 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_DECONSTRUCTED_CACHE + 1 ));
7920 if (in_single_pattern) {
7921 CHECK(iseq_compile_pattern_set_general_errmsg(iseq, ret, node, rb_fstring_lit(
"%p does not respond to #deconstruct"), base_index + 1 ));
7924 ADD_INSNL(ret, line_node, branchunless, match_failed);
7926 ADD_SEND(ret, line_node, rb_intern(
"deconstruct"),
INT2FIX(0));
7929 if (use_deconstructed_cache) {
7930 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_DECONSTRUCTED_CACHE));
7933 ADD_INSN(ret, line_node, dup);
7935 ADD_INSNL(ret, line_node, branchunless, type_error);
7937 ADD_LABEL(ret, deconstructed);
7953 const int line = nd_line(node);
7954 const NODE *line_node = node;
7955 LABEL *match_succeeded = NEW_LABEL(line);
7957 ADD_INSN(ret, line_node, dup);
7958 ADD_INSNL(ret, line_node, branchif, match_succeeded);
7960 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
7961 ADD_INSN1(ret, line_node, putobject, errmsg);
7962 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7963 ADD_SEND(ret, line_node, id_core_sprintf,
INT2FIX(2));
7964 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_ERROR_STRING + 1 ));
7966 ADD_INSN1(ret, line_node, putobject,
Qfalse);
7967 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_P + 2 ));
7969 ADD_INSN(ret, line_node, pop);
7970 ADD_INSN(ret, line_node, pop);
7971 ADD_LABEL(ret, match_succeeded);
7987 const int line = nd_line(node);
7988 const NODE *line_node = node;
7989 LABEL *match_succeeded = NEW_LABEL(line);
7991 ADD_INSN(ret, line_node, dup);
7992 ADD_INSNL(ret, line_node, branchif, match_succeeded);
7994 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
7995 ADD_INSN1(ret, line_node, putobject, errmsg);
7996 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7997 ADD_INSN(ret, line_node, dup);
7998 ADD_SEND(ret, line_node, idLength,
INT2FIX(0));
7999 ADD_INSN1(ret, line_node, putobject, pattern_length);
8000 ADD_SEND(ret, line_node, id_core_sprintf,
INT2FIX(4));
8001 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_ERROR_STRING + 1 ));
8003 ADD_INSN1(ret, line_node, putobject,
Qfalse);
8004 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_P + 2));
8006 ADD_INSN(ret, line_node, pop);
8007 ADD_INSN(ret, line_node, pop);
8008 ADD_LABEL(ret, match_succeeded);
8014iseq_compile_pattern_set_eqq_errmsg(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
int base_index)
8024 const int line = nd_line(node);
8025 const NODE *line_node = node;
8026 LABEL *match_succeeded = NEW_LABEL(line);
8028 ADD_INSN(ret, line_node, dup);
8029 ADD_INSNL(ret, line_node, branchif, match_succeeded);
8031 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
8032 ADD_INSN1(ret, line_node, putobject, rb_fstring_lit(
"%p === %p does not return true"));
8033 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
8034 ADD_INSN1(ret, line_node, topn,
INT2FIX(5));
8035 ADD_SEND(ret, line_node, id_core_sprintf,
INT2FIX(3));
8036 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_ERROR_STRING + 1 ));
8038 ADD_INSN1(ret, line_node, putobject,
Qfalse);
8039 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_P + 2 ));
8041 ADD_INSN(ret, line_node, pop);
8042 ADD_INSN(ret, line_node, pop);
8044 ADD_LABEL(ret, match_succeeded);
8045 ADD_INSN1(ret, line_node, setn,
INT2FIX(2));
8046 ADD_INSN(ret, line_node, pop);
8047 ADD_INSN(ret, line_node, pop);
8055 const NODE *pattern;
8056 const NODE *node = orig_node;
8057 LABEL *endlabel, *elselabel;
8059 DECL_ANCHOR(body_seq);
8060 DECL_ANCHOR(cond_seq);
8062 enum node_type
type;
8063 const NODE *line_node;
8066 bool single_pattern;
8069 INIT_ANCHOR(body_seq);
8070 INIT_ANCHOR(cond_seq);
8072 branches = decl_branch_base(iseq, PTR2NUM(node), nd_code_loc(node),
"case");
8074 node = RNODE_CASE3(node)->nd_body;
8075 EXPECT_NODE(
"NODE_CASE3", node, NODE_IN, COMPILE_NG);
8076 type = nd_type(node);
8077 line = nd_line(node);
8079 single_pattern = !RNODE_IN(node)->nd_next;
8081 endlabel = NEW_LABEL(line);
8082 elselabel = NEW_LABEL(line);
8084 if (single_pattern) {
8086 ADD_INSN(head, line_node, putnil);
8087 ADD_INSN(head, line_node, putnil);
8088 ADD_INSN1(head, line_node, putobject,
Qfalse);
8089 ADD_INSN(head, line_node, putnil);
8091 ADD_INSN(head, line_node, putnil);
8093 CHECK(COMPILE(head,
"case base", RNODE_CASE3(orig_node)->nd_head));
8097 while (
type == NODE_IN) {
8101 ADD_INSN(body_seq, line_node, putnil);
8103 l1 = NEW_LABEL(line);
8104 ADD_LABEL(body_seq, l1);
8105 ADD_INSN1(body_seq, line_node, adjuststack,
INT2FIX(single_pattern ? 6 : 2));
8107 const NODE *
const coverage_node = RNODE_IN(node)->nd_body ? RNODE_IN(node)->nd_body : node;
8108 add_trace_branch_coverage(
8111 nd_code_loc(coverage_node),
8112 nd_node_id(coverage_node),
8117 CHECK(COMPILE_(body_seq,
"in body", RNODE_IN(node)->nd_body, popped));
8118 ADD_INSNL(body_seq, line_node, jump, endlabel);
8120 pattern = RNODE_IN(node)->nd_head;
8122 int pat_line = nd_line(pattern);
8123 LABEL *next_pat = NEW_LABEL(pat_line);
8124 ADD_INSN (cond_seq, pattern, dup);
8126 CHECK(iseq_compile_pattern_each(iseq, cond_seq, pattern, l1, next_pat, single_pattern,
false, 2,
true));
8127 ADD_LABEL(cond_seq, next_pat);
8128 LABEL_UNREMOVABLE(next_pat);
8131 COMPILE_ERROR(ERROR_ARGS
"unexpected node");
8135 node = RNODE_IN(node)->nd_next;
8139 type = nd_type(node);
8140 line = nd_line(node);
8145 ADD_LABEL(cond_seq, elselabel);
8146 ADD_INSN(cond_seq, line_node, pop);
8147 ADD_INSN(cond_seq, line_node, pop);
8148 add_trace_branch_coverage(iseq, cond_seq, nd_code_loc(node), nd_node_id(node), branch_id,
"else", branches);
8149 CHECK(COMPILE_(cond_seq,
"else", node, popped));
8150 ADD_INSNL(cond_seq, line_node, jump, endlabel);
8151 ADD_INSN(cond_seq, line_node, putnil);
8153 ADD_INSN(cond_seq, line_node, putnil);
8157 debugs(
"== else (implicit)\n");
8158 ADD_LABEL(cond_seq, elselabel);
8159 add_trace_branch_coverage(iseq, cond_seq, nd_code_loc(orig_node), nd_node_id(orig_node), branch_id,
"else", branches);
8160 ADD_INSN1(cond_seq, orig_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
8162 if (single_pattern) {
8170 LABEL *key_error, *fin;
8173 key_error = NEW_LABEL(line);
8174 fin = NEW_LABEL(line);
8177 kw_arg->references = 0;
8178 kw_arg->keyword_len = 2;
8179 kw_arg->keywords[0] =
ID2SYM(rb_intern(
"matchee"));
8180 kw_arg->keywords[1] =
ID2SYM(rb_intern(
"key"));
8182 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(CASE3_BI_OFFSET_KEY_ERROR_P + 2));
8183 ADD_INSNL(cond_seq, orig_node, branchif, key_error);
8185 ADD_INSN1(cond_seq, orig_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
8186 ADD_INSN1(cond_seq, orig_node, putobject, rb_fstring_lit(
"%p: %s"));
8187 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(4));
8188 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(CASE3_BI_OFFSET_ERROR_STRING + 6));
8189 ADD_SEND(cond_seq, orig_node, id_core_sprintf,
INT2FIX(3));
8190 ADD_SEND(cond_seq, orig_node, id_core_raise,
INT2FIX(2));
8191 ADD_INSNL(cond_seq, orig_node, jump, fin);
8193 ADD_LABEL(cond_seq, key_error);
8195 ADD_INSN1(cond_seq, orig_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
8196 ADD_INSN1(cond_seq, orig_node, putobject, rb_fstring_lit(
"%p: %s"));
8197 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(4));
8198 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(CASE3_BI_OFFSET_ERROR_STRING + 6));
8199 ADD_SEND(cond_seq, orig_node, id_core_sprintf,
INT2FIX(3));
8200 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(CASE3_BI_OFFSET_KEY_ERROR_MATCHEE + 4));
8201 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(CASE3_BI_OFFSET_KEY_ERROR_KEY + 5));
8202 ADD_SEND_R(cond_seq, orig_node, rb_intern(
"new"),
INT2FIX(1), NULL,
INT2FIX(VM_CALL_KWARG), kw_arg);
8203 ADD_SEND(cond_seq, orig_node, id_core_raise,
INT2FIX(1));
8205 ADD_LABEL(cond_seq, fin);
8209 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(2));
8210 ADD_SEND(cond_seq, orig_node, id_core_raise,
INT2FIX(2));
8212 ADD_INSN1(cond_seq, orig_node, adjuststack,
INT2FIX(single_pattern ? 7 : 3));
8214 ADD_INSN(cond_seq, orig_node, putnil);
8216 ADD_INSNL(cond_seq, orig_node, jump, endlabel);
8217 ADD_INSN1(cond_seq, orig_node, dupn,
INT2FIX(single_pattern ? 5 : 1));
8219 ADD_INSN(cond_seq, line_node, putnil);
8223 ADD_SEQ(ret, cond_seq);
8224 ADD_SEQ(ret, body_seq);
8225 ADD_LABEL(ret, endlabel);
8229#undef CASE3_BI_OFFSET_DECONSTRUCTED_CACHE
8230#undef CASE3_BI_OFFSET_ERROR_STRING
8231#undef CASE3_BI_OFFSET_KEY_ERROR_P
8232#undef CASE3_BI_OFFSET_KEY_ERROR_MATCHEE
8233#undef CASE3_BI_OFFSET_KEY_ERROR_KEY
8238 const int line = (int)nd_line(node);
8239 const NODE *line_node = node;
8241 LABEL *prev_start_label = ISEQ_COMPILE_DATA(iseq)->start_label;
8242 LABEL *prev_end_label = ISEQ_COMPILE_DATA(iseq)->end_label;
8243 LABEL *prev_redo_label = ISEQ_COMPILE_DATA(iseq)->redo_label;
8244 int prev_loopval_popped = ISEQ_COMPILE_DATA(iseq)->loopval_popped;
8249 LABEL *next_label = ISEQ_COMPILE_DATA(iseq)->start_label = NEW_LABEL(line);
8250 LABEL *redo_label = ISEQ_COMPILE_DATA(iseq)->redo_label = NEW_LABEL(line);
8251 LABEL *break_label = ISEQ_COMPILE_DATA(iseq)->end_label = NEW_LABEL(line);
8252 LABEL *end_label = NEW_LABEL(line);
8253 LABEL *adjust_label = NEW_LABEL(line);
8255 LABEL *next_catch_label = NEW_LABEL(line);
8256 LABEL *tmp_label = NULL;
8258 ISEQ_COMPILE_DATA(iseq)->loopval_popped = 0;
8259 push_ensure_entry(iseq, &enl, NULL, NULL);
8261 if (RNODE_WHILE(node)->nd_state == 1) {
8262 ADD_INSNL(ret, line_node, jump, next_label);
8265 tmp_label = NEW_LABEL(line);
8266 ADD_INSNL(ret, line_node, jump, tmp_label);
8268 ADD_LABEL(ret, adjust_label);
8269 ADD_INSN(ret, line_node, putnil);
8270 ADD_LABEL(ret, next_catch_label);
8271 ADD_INSN(ret, line_node, pop);
8272 ADD_INSNL(ret, line_node, jump, next_label);
8273 if (tmp_label) ADD_LABEL(ret, tmp_label);
8275 ADD_LABEL(ret, redo_label);
8276 branches = decl_branch_base(iseq, PTR2NUM(node), nd_code_loc(node),
type == NODE_WHILE ?
"while" :
"until");
8278 const NODE *
const coverage_node = RNODE_WHILE(node)->nd_body ? RNODE_WHILE(node)->nd_body : node;
8279 add_trace_branch_coverage(
8282 nd_code_loc(coverage_node),
8283 nd_node_id(coverage_node),
8288 CHECK(COMPILE_POPPED(ret,
"while body", RNODE_WHILE(node)->nd_body));
8289 ADD_LABEL(ret, next_label);
8291 if (
type == NODE_WHILE) {
8292 CHECK(compile_branch_condition(iseq, ret, RNODE_WHILE(node)->nd_cond,
8293 redo_label, end_label));
8297 CHECK(compile_branch_condition(iseq, ret, RNODE_WHILE(node)->nd_cond,
8298 end_label, redo_label));
8301 ADD_LABEL(ret, end_label);
8302 ADD_ADJUST_RESTORE(ret, adjust_label);
8304 if (UNDEF_P(RNODE_WHILE(node)->nd_state)) {
8306 COMPILE_ERROR(ERROR_ARGS
"unsupported: putundef");
8310 ADD_INSN(ret, line_node, putnil);
8313 ADD_LABEL(ret, break_label);
8316 ADD_INSN(ret, line_node, pop);
8319 ADD_CATCH_ENTRY(CATCH_TYPE_BREAK, redo_label, break_label, NULL,
8321 ADD_CATCH_ENTRY(CATCH_TYPE_NEXT, redo_label, break_label, NULL,
8323 ADD_CATCH_ENTRY(CATCH_TYPE_REDO, redo_label, break_label, NULL,
8324 ISEQ_COMPILE_DATA(iseq)->redo_label);
8326 ISEQ_COMPILE_DATA(iseq)->start_label = prev_start_label;
8327 ISEQ_COMPILE_DATA(iseq)->end_label = prev_end_label;
8328 ISEQ_COMPILE_DATA(iseq)->redo_label = prev_redo_label;
8329 ISEQ_COMPILE_DATA(iseq)->loopval_popped = prev_loopval_popped;
8330 ISEQ_COMPILE_DATA(iseq)->ensure_node_stack = ISEQ_COMPILE_DATA(iseq)->ensure_node_stack->prev;
8337 const int line = nd_line(node);
8338 const NODE *line_node = node;
8339 const rb_iseq_t *prevblock = ISEQ_COMPILE_DATA(iseq)->current_block;
8340 LABEL *retry_label = NEW_LABEL(line);
8341 LABEL *retry_end_l = NEW_LABEL(line);
8344 ADD_LABEL(ret, retry_label);
8345 if (nd_type_p(node, NODE_FOR)) {
8346 CHECK(COMPILE(ret,
"iter caller (for)", RNODE_FOR(node)->nd_iter));
8348 ISEQ_COMPILE_DATA(iseq)->current_block = child_iseq =
8349 NEW_CHILD_ISEQ(RNODE_FOR(node)->nd_body, make_name_for_block(iseq),
8350 ISEQ_TYPE_BLOCK, line);
8351 ADD_SEND_WITH_BLOCK(ret, line_node, idEach,
INT2FIX(0), child_iseq);
8354 ISEQ_COMPILE_DATA(iseq)->current_block = child_iseq =
8355 NEW_CHILD_ISEQ(RNODE_ITER(node)->nd_body, make_name_for_block(iseq),
8356 ISEQ_TYPE_BLOCK, line);
8357 CHECK(COMPILE(ret,
"iter caller", RNODE_ITER(node)->nd_iter));
8371 iobj = IS_INSN(last_elem) ? (
INSN*) last_elem : (
INSN*) get_prev_insn((
INSN*) last_elem);
8372 while (!IS_INSN_ID(iobj, send) && !IS_INSN_ID(iobj, invokesuper) && !IS_INSN_ID(iobj, sendforward) && !IS_INSN_ID(iobj, invokesuperforward)) {
8373 iobj = (
INSN*) get_prev_insn(iobj);
8375 ELEM_INSERT_NEXT(&iobj->link, (
LINK_ELEMENT*) retry_end_l);
8379 if (&iobj->link == LAST_ELEMENT(ret)) {
8385 ADD_INSN(ret, line_node, pop);
8388 ISEQ_COMPILE_DATA(iseq)->current_block = prevblock;
8390 ADD_CATCH_ENTRY(CATCH_TYPE_BREAK, retry_label, retry_end_l, child_iseq, retry_end_l);
8400 const NODE *line_node = node;
8401 const NODE *var = RNODE_FOR_MASGN(node)->nd_var;
8402 LABEL *not_single = NEW_LABEL(nd_line(var));
8403 LABEL *not_ary = NEW_LABEL(nd_line(var));
8404 CHECK(COMPILE(ret,
"for var", var));
8405 ADD_INSN(ret, line_node, dup);
8406 ADD_CALL(ret, line_node, idLength,
INT2FIX(0));
8407 ADD_INSN1(ret, line_node, putobject,
INT2FIX(1));
8408 ADD_CALL(ret, line_node, idEq,
INT2FIX(1));
8409 ADD_INSNL(ret, line_node, branchunless, not_single);
8410 ADD_INSN(ret, line_node, dup);
8411 ADD_INSN1(ret, line_node, putobject,
INT2FIX(0));
8412 ADD_CALL(ret, line_node, idAREF,
INT2FIX(1));
8413 ADD_INSN1(ret, line_node, putobject,
rb_cArray);
8414 ADD_INSN(ret, line_node, swap);
8415 ADD_CALL(ret, line_node, rb_intern(
"try_convert"),
INT2FIX(1));
8416 ADD_INSN(ret, line_node, dup);
8417 ADD_INSNL(ret, line_node, branchunless, not_ary);
8418 ADD_INSN(ret, line_node, swap);
8419 ADD_LABEL(ret, not_ary);
8420 ADD_INSN(ret, line_node, pop);
8421 ADD_LABEL(ret, not_single);
8428 const NODE *line_node = node;
8429 unsigned long throw_flag = 0;
8431 if (ISEQ_COMPILE_DATA(iseq)->redo_label != 0 && can_add_ensure_iseq(iseq)) {
8433 LABEL *splabel = NEW_LABEL(0);
8434 ADD_LABEL(ret, splabel);
8435 ADD_ADJUST(ret, line_node, ISEQ_COMPILE_DATA(iseq)->redo_label);
8436 CHECK(COMPILE_(ret,
"break val (while/until)", RNODE_BREAK(node)->nd_stts,
8437 ISEQ_COMPILE_DATA(iseq)->loopval_popped));
8438 add_ensure_iseq(ret, iseq, 0);
8439 ADD_INSNL(ret, line_node, jump, ISEQ_COMPILE_DATA(iseq)->end_label);
8440 ADD_ADJUST_RESTORE(ret, splabel);
8443 ADD_INSN(ret, line_node, putnil);
8450 if (!ISEQ_COMPILE_DATA(ip)) {
8455 if (ISEQ_COMPILE_DATA(ip)->redo_label != 0) {
8456 throw_flag = VM_THROW_NO_ESCAPE_FLAG;
8458 else if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_BLOCK) {
8461 else if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_EVAL) {
8462 COMPILE_ERROR(ERROR_ARGS
"Can't escape from eval with break");
8466 ip = ISEQ_BODY(ip)->parent_iseq;
8471 CHECK(COMPILE(ret,
"break val (block)", RNODE_BREAK(node)->nd_stts));
8472 ADD_INSN1(ret, line_node,
throw,
INT2FIX(throw_flag | TAG_BREAK));
8474 ADD_INSN(ret, line_node, pop);
8478 COMPILE_ERROR(ERROR_ARGS
"Invalid break");
8487 const NODE *line_node = node;
8488 unsigned long throw_flag = 0;
8490 if (ISEQ_COMPILE_DATA(iseq)->redo_label != 0 && can_add_ensure_iseq(iseq)) {
8491 LABEL *splabel = NEW_LABEL(0);
8492 debugs(
"next in while loop\n");
8493 ADD_LABEL(ret, splabel);
8494 CHECK(COMPILE(ret,
"next val/valid syntax?", RNODE_NEXT(node)->nd_stts));
8495 add_ensure_iseq(ret, iseq, 0);
8496 ADD_ADJUST(ret, line_node, ISEQ_COMPILE_DATA(iseq)->redo_label);
8497 ADD_INSNL(ret, line_node, jump, ISEQ_COMPILE_DATA(iseq)->start_label);
8498 ADD_ADJUST_RESTORE(ret, splabel);
8500 ADD_INSN(ret, line_node, putnil);
8503 else if (ISEQ_COMPILE_DATA(iseq)->end_label && can_add_ensure_iseq(iseq)) {
8504 LABEL *splabel = NEW_LABEL(0);
8505 debugs(
"next in block\n");
8506 ADD_LABEL(ret, splabel);
8507 ADD_ADJUST(ret, line_node, ISEQ_COMPILE_DATA(iseq)->start_label);
8508 CHECK(COMPILE(ret,
"next val", RNODE_NEXT(node)->nd_stts));
8509 add_ensure_iseq(ret, iseq, 0);
8510 ADD_INSNL(ret, line_node, jump, ISEQ_COMPILE_DATA(iseq)->end_label);
8511 ADD_ADJUST_RESTORE(ret, splabel);
8514 ADD_INSN(ret, line_node, putnil);
8521 if (!ISEQ_COMPILE_DATA(ip)) {
8526 throw_flag = VM_THROW_NO_ESCAPE_FLAG;
8527 if (ISEQ_COMPILE_DATA(ip)->redo_label != 0) {
8531 else if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_BLOCK) {
8534 else if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_EVAL) {
8535 COMPILE_ERROR(ERROR_ARGS
"Can't escape from eval with next");
8539 ip = ISEQ_BODY(ip)->parent_iseq;
8542 CHECK(COMPILE(ret,
"next val", RNODE_NEXT(node)->nd_stts));
8543 ADD_INSN1(ret, line_node,
throw,
INT2FIX(throw_flag | TAG_NEXT));
8546 ADD_INSN(ret, line_node, pop);
8550 COMPILE_ERROR(ERROR_ARGS
"Invalid next");
8560 const NODE *line_node = node;
8562 if (ISEQ_COMPILE_DATA(iseq)->redo_label && can_add_ensure_iseq(iseq)) {
8563 LABEL *splabel = NEW_LABEL(0);
8564 debugs(
"redo in while");
8565 ADD_LABEL(ret, splabel);
8566 ADD_ADJUST(ret, line_node, ISEQ_COMPILE_DATA(iseq)->redo_label);
8567 add_ensure_iseq(ret, iseq, 0);
8568 ADD_INSNL(ret, line_node, jump, ISEQ_COMPILE_DATA(iseq)->redo_label);
8569 ADD_ADJUST_RESTORE(ret, splabel);
8571 ADD_INSN(ret, line_node, putnil);
8574 else if (ISEQ_BODY(iseq)->
type != ISEQ_TYPE_EVAL && ISEQ_COMPILE_DATA(iseq)->start_label && can_add_ensure_iseq(iseq)) {
8575 LABEL *splabel = NEW_LABEL(0);
8577 debugs(
"redo in block");
8578 ADD_LABEL(ret, splabel);
8579 add_ensure_iseq(ret, iseq, 0);
8580 ADD_ADJUST(ret, line_node, ISEQ_COMPILE_DATA(iseq)->start_label);
8581 ADD_INSNL(ret, line_node, jump, ISEQ_COMPILE_DATA(iseq)->start_label);
8582 ADD_ADJUST_RESTORE(ret, splabel);
8585 ADD_INSN(ret, line_node, putnil);
8592 if (!ISEQ_COMPILE_DATA(ip)) {
8597 if (ISEQ_COMPILE_DATA(ip)->redo_label != 0) {
8600 else if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_BLOCK) {
8603 else if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_EVAL) {
8604 COMPILE_ERROR(ERROR_ARGS
"Can't escape from eval with redo");
8608 ip = ISEQ_BODY(ip)->parent_iseq;
8611 ADD_INSN(ret, line_node, putnil);
8612 ADD_INSN1(ret, line_node,
throw,
INT2FIX(VM_THROW_NO_ESCAPE_FLAG | TAG_REDO));
8615 ADD_INSN(ret, line_node, pop);
8619 COMPILE_ERROR(ERROR_ARGS
"Invalid redo");
8629 const NODE *line_node = node;
8631 if (ISEQ_BODY(iseq)->
type == ISEQ_TYPE_RESCUE) {
8632 ADD_INSN(ret, line_node, putnil);
8633 ADD_INSN1(ret, line_node,
throw,
INT2FIX(TAG_RETRY));
8636 ADD_INSN(ret, line_node, pop);
8640 COMPILE_ERROR(ERROR_ARGS
"Invalid retry");
8649 const int line = nd_line(node);
8650 const NODE *line_node = node;
8651 LABEL *lstart = NEW_LABEL(line);
8652 LABEL *lend = NEW_LABEL(line);
8653 LABEL *lcont = NEW_LABEL(line);
8654 const rb_iseq_t *rescue = NEW_CHILD_ISEQ(RNODE_RESCUE(node)->nd_resq,
8656 ISEQ_BODY(iseq)->location.label),
8657 ISEQ_TYPE_RESCUE, line);
8659 lstart->rescued = LABEL_RESCUE_BEG;
8660 lend->rescued = LABEL_RESCUE_END;
8661 ADD_LABEL(ret, lstart);
8663 bool prev_in_rescue = ISEQ_COMPILE_DATA(iseq)->in_rescue;
8664 ISEQ_COMPILE_DATA(iseq)->in_rescue =
true;
8666 CHECK(COMPILE(ret,
"rescue head", RNODE_RESCUE(node)->nd_head));
8668 ISEQ_COMPILE_DATA(iseq)->in_rescue = prev_in_rescue;
8670 ADD_LABEL(ret, lend);
8671 if (RNODE_RESCUE(node)->nd_else) {
8672 ADD_INSN(ret, line_node, pop);
8673 CHECK(COMPILE(ret,
"rescue else", RNODE_RESCUE(node)->nd_else));
8675 ADD_INSN(ret, line_node, nop);
8676 ADD_LABEL(ret, lcont);
8679 ADD_INSN(ret, line_node, pop);
8683 ADD_CATCH_ENTRY(CATCH_TYPE_RESCUE, lstart, lend, rescue, lcont);
8684 ADD_CATCH_ENTRY(CATCH_TYPE_RETRY, lend, lcont, NULL, lstart);
8691 const int line = nd_line(node);
8692 const NODE *line_node = node;
8693 const NODE *resq = node;
8695 LABEL *label_miss, *label_hit;
8698 label_miss = NEW_LABEL(line);
8699 label_hit = NEW_LABEL(line);
8701 narg = RNODE_RESBODY(resq)->nd_args;
8703 switch (nd_type(narg)) {
8706 ADD_GETLOCAL(ret, line_node, LVAR_ERRINFO, 0);
8707 CHECK(COMPILE(ret,
"rescue arg", RNODE_LIST(narg)->nd_head));
8708 ADD_INSN1(ret, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_RESCUE));
8709 ADD_INSNL(ret, line_node, branchif, label_hit);
8710 narg = RNODE_LIST(narg)->nd_next;
8716 ADD_GETLOCAL(ret, line_node, LVAR_ERRINFO, 0);
8717 CHECK(COMPILE(ret,
"rescue/cond splat", narg));
8718 ADD_INSN1(ret, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_RESCUE | VM_CHECKMATCH_ARRAY));
8719 ADD_INSNL(ret, line_node, branchif, label_hit);
8722 UNKNOWN_NODE(
"NODE_RESBODY", narg, COMPILE_NG);
8726 ADD_GETLOCAL(ret, line_node, LVAR_ERRINFO, 0);
8728 ADD_INSN1(ret, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_RESCUE));
8729 ADD_INSNL(ret, line_node, branchif, label_hit);
8731 ADD_INSNL(ret, line_node, jump, label_miss);
8732 ADD_LABEL(ret, label_hit);
8735 if (RNODE_RESBODY(resq)->nd_exc_var) {
8736 CHECK(COMPILE_POPPED(ret,
"resbody exc_var", RNODE_RESBODY(resq)->nd_exc_var));
8739 if (nd_type(RNODE_RESBODY(resq)->nd_body) == NODE_BEGIN && RNODE_BEGIN(RNODE_RESBODY(resq)->nd_body)->nd_body == NULL && !RNODE_RESBODY(resq)->nd_exc_var) {
8741 ADD_SYNTHETIC_INSN(ret, nd_line(RNODE_RESBODY(resq)->nd_body), -1, putnil);
8744 CHECK(COMPILE(ret,
"resbody body", RNODE_RESBODY(resq)->nd_body));
8747 if (ISEQ_COMPILE_DATA(iseq)->option->tailcall_optimization) {
8748 ADD_INSN(ret, line_node, nop);
8750 ADD_INSN(ret, line_node, leave);
8751 ADD_LABEL(ret, label_miss);
8752 resq = RNODE_RESBODY(resq)->nd_next;
8760 const int line = nd_line(RNODE_ENSURE(node)->nd_ensr);
8761 const NODE *line_node = node;
8763 const rb_iseq_t *ensure = NEW_CHILD_ISEQ(RNODE_ENSURE(node)->nd_ensr,
8765 ISEQ_TYPE_ENSURE, line);
8766 LABEL *lstart = NEW_LABEL(line);
8767 LABEL *lend = NEW_LABEL(line);
8768 LABEL *lcont = NEW_LABEL(line);
8776 CHECK(COMPILE_POPPED(ensr,
"ensure ensr", RNODE_ENSURE(node)->nd_ensr));
8778 last_leave = last && IS_INSN(last) && IS_INSN_ID(last, leave);
8783 push_ensure_entry(iseq, &enl, &er, RNODE_ENSURE(node)->nd_ensr);
8785 ADD_LABEL(ret, lstart);
8786 CHECK(COMPILE_(ret,
"ensure head", RNODE_ENSURE(node)->nd_head, (popped | last_leave)));
8787 ADD_LABEL(ret, lend);
8789 if (!popped && last_leave) ADD_INSN(ret, line_node, putnil);
8790 ADD_LABEL(ret, lcont);
8791 if (last_leave) ADD_INSN(ret, line_node, pop);
8793 erange = ISEQ_COMPILE_DATA(iseq)->ensure_node_stack->erange;
8794 if (lstart->link.next != &lend->link) {
8796 ADD_CATCH_ENTRY(CATCH_TYPE_ENSURE, erange->begin, erange->end,
8798 erange = erange->next;
8802 ISEQ_COMPILE_DATA(iseq)->ensure_node_stack = enl.prev;
8809 const NODE *line_node = node;
8812 enum rb_iseq_type
type = ISEQ_BODY(iseq)->type;
8814 enum rb_iseq_type t =
type;
8815 const NODE *retval = RNODE_RETURN(node)->nd_stts;
8818 while (t == ISEQ_TYPE_RESCUE || t == ISEQ_TYPE_ENSURE) {
8819 if (!(is = ISEQ_BODY(is)->parent_iseq))
break;
8820 t = ISEQ_BODY(is)->type;
8824 case ISEQ_TYPE_MAIN:
8826 rb_warn(
"argument of top-level return is ignored");
8830 type = ISEQ_TYPE_METHOD;
8837 if (
type == ISEQ_TYPE_METHOD) {
8838 splabel = NEW_LABEL(0);
8839 ADD_LABEL(ret, splabel);
8840 ADD_ADJUST(ret, line_node, 0);
8843 CHECK(COMPILE(ret,
"return nd_stts (return val)", retval));
8845 if (
type == ISEQ_TYPE_METHOD && can_add_ensure_iseq(iseq)) {
8846 add_ensure_iseq(ret, iseq, 1);
8848 ADD_INSN(ret, line_node, leave);
8849 ADD_ADJUST_RESTORE(ret, splabel);
8852 ADD_INSN(ret, line_node, putnil);
8856 ADD_INSN1(ret, line_node,
throw,
INT2FIX(TAG_RETURN));
8858 ADD_INSN(ret, line_node, pop);
8869 if (!i)
return false;
8870 if (IS_TRACE(i)) i = i->prev;
8871 if (!IS_INSN(i) || !IS_INSN_ID(i, putnil))
return false;
8873 if (IS_ADJUST(i)) i = i->prev;
8874 if (!IS_INSN(i))
return false;
8875 switch (INSN_OF(i)) {
8882 (ret->last = last->prev)->next = NULL;
8889 CHECK(COMPILE_(ret,
"nd_body", node, popped));
8891 if (!popped && !all_string_result_p(node)) {
8892 const NODE *line_node = node;
8893 const unsigned int flag = VM_CALL_FCALL;
8897 ADD_INSN(ret, line_node, dup);
8898 ADD_INSN1(ret, line_node, objtostring, new_callinfo(iseq, idTo_s, 0, flag, NULL, FALSE));
8899 ADD_INSN(ret, line_node, anytostring);
8907 int idx = ISEQ_BODY(ISEQ_BODY(iseq)->local_iseq)->local_table_size - get_local_var_idx(iseq,
id);
8909 debugs(
"id: %s idx: %d\n", rb_id2name(
id), idx);
8910 ADD_GETLOCAL(ret, line_node, idx, get_lvar_level(iseq));
8916 LABEL *else_label = NEW_LABEL(nd_line(line_node));
8919 br = decl_branch_base(iseq, PTR2NUM(node), nd_code_loc(node),
"&.");
8921 ADD_INSN(recv, line_node, dup);
8922 ADD_INSNL(recv, line_node, branchnil, else_label);
8923 add_trace_branch_coverage(iseq, recv, nd_code_loc(node), nd_node_id(node), 0,
"then", br);
8931 if (!else_label)
return;
8932 end_label = NEW_LABEL(nd_line(line_node));
8933 ADD_INSNL(ret, line_node, jump, end_label);
8934 ADD_LABEL(ret, else_label);
8935 add_trace_branch_coverage(iseq, ret, nd_code_loc(node), nd_node_id(node), 1,
"else", branches);
8936 ADD_LABEL(ret, end_label);
8945 if (get_nd_recv(node) &&
8946 (nd_type_p(get_nd_recv(node), NODE_STR) || nd_type_p(get_nd_recv(node), NODE_FILE)) &&
8947 (get_node_call_nd_mid(node) == idFreeze || get_node_call_nd_mid(node) == idUMinus) &&
8948 get_nd_args(node) == NULL &&
8949 ISEQ_COMPILE_DATA(iseq)->current_block == NULL &&
8950 ISEQ_COMPILE_DATA(iseq)->option->specialized_instruction) {
8951 VALUE str = get_string_value(get_nd_recv(node));
8952 if (get_node_call_nd_mid(node) == idUMinus) {
8953 ADD_INSN2(ret, line_node, opt_str_uminus, str,
8954 new_callinfo(iseq, idUMinus, 0, 0, NULL, FALSE));
8957 ADD_INSN2(ret, line_node, opt_str_freeze, str,
8958 new_callinfo(iseq, idFreeze, 0, 0, NULL, FALSE));
8962 ADD_INSN(ret, line_node, pop);
8970iseq_has_builtin_function_table(
const rb_iseq_t *iseq)
8972 return ISEQ_COMPILE_DATA(iseq)->builtin_function_table != NULL;
8976iseq_builtin_function_lookup(
const rb_iseq_t *iseq,
const char *name)
8979 const struct rb_builtin_function *table = ISEQ_COMPILE_DATA(iseq)->builtin_function_table;
8980 for (i=0; table[i].index != -1; i++) {
8981 if (strcmp(table[i].name, name) == 0) {
8989iseq_builtin_function_name(
const enum node_type
type,
const NODE *recv,
ID mid)
8991 const char *name = rb_id2name(mid);
8992 static const char prefix[] =
"__builtin_";
8993 const size_t prefix_len =
sizeof(prefix) - 1;
8998 switch (nd_type(recv)) {
9000 if (RNODE_VCALL(recv)->nd_mid == rb_intern(
"__builtin")) {
9005 if (RNODE_CONST(recv)->nd_vid == rb_intern(
"Primitive")) {
9015 if (UNLIKELY(strncmp(prefix, name, prefix_len) == 0)) {
9016 return &name[prefix_len];
9025delegate_call_p(
const rb_iseq_t *iseq,
unsigned int argc,
const LINK_ANCHOR *args,
unsigned int *pstart_index)
9032 else if (argc <= ISEQ_BODY(iseq)->local_table_size) {
9033 unsigned int start=0;
9038 argc + start <= ISEQ_BODY(iseq)->local_table_size;
9042 for (
unsigned int i=start; i-start<argc; i++) {
9043 if (IS_INSN(elem) &&
9044 INSN_OF(elem) == BIN(getlocal)) {
9045 int local_index =
FIX2INT(OPERAND_AT(elem, 0));
9046 int local_level =
FIX2INT(OPERAND_AT(elem, 1));
9048 if (local_level == 0) {
9049 unsigned int index = ISEQ_BODY(iseq)->local_table_size - (local_index - VM_ENV_DATA_SIZE + 1);
9051 fprintf(stderr,
"lvar:%s (%d), id:%s (%d) local_index:%d, local_size:%d\n",
9052 rb_id2name(ISEQ_BODY(iseq)->local_table[i]), i,
9053 rb_id2name(ISEQ_BODY(iseq)->local_table[index]), index,
9054 local_index, (
int)ISEQ_BODY(iseq)->local_table_size);
9078 *pstart_index = start;
9092 if (!node)
goto no_arg;
9094 if (!nd_type_p(node, NODE_LIST))
goto bad_arg;
9095 const NODE *next = RNODE_LIST(node)->nd_next;
9097 node = RNODE_LIST(node)->nd_head;
9098 if (!node)
goto no_arg;
9099 switch (nd_type(node)) {
9101 symbol = rb_node_sym_string_val(node);
9107 if (!
SYMBOL_P(symbol))
goto non_symbol_arg;
9110 if (strcmp(RSTRING_PTR(
string),
"leaf") == 0) {
9111 ISEQ_BODY(iseq)->builtin_attrs |= BUILTIN_ATTR_LEAF;
9113 else if (strcmp(RSTRING_PTR(
string),
"inline_block") == 0) {
9114 ISEQ_BODY(iseq)->builtin_attrs |= BUILTIN_ATTR_INLINE_BLOCK;
9116 else if (strcmp(RSTRING_PTR(
string),
"use_block") == 0) {
9117 iseq_set_use_block(iseq);
9119 else if (strcmp(RSTRING_PTR(
string),
"c_trace") == 0) {
9121 ISEQ_BODY(iseq)->builtin_attrs |= BUILTIN_ATTR_C_TRACE;
9130 COMPILE_ERROR(ERROR_ARGS
"attr!: no argument");
9133 COMPILE_ERROR(ERROR_ARGS
"non symbol argument to attr!: %s", rb_builtin_class_name(symbol));
9136 COMPILE_ERROR(ERROR_ARGS
"unknown argument to attr!: %s", RSTRING_PTR(
string));
9139 UNKNOWN_NODE(
"attr!", node, COMPILE_NG);
9147 if (!node)
goto no_arg;
9148 if (!nd_type_p(node, NODE_LIST))
goto bad_arg;
9149 if (RNODE_LIST(node)->nd_next)
goto too_many_arg;
9150 node = RNODE_LIST(node)->nd_head;
9151 if (!node)
goto no_arg;
9152 switch (nd_type(node)) {
9154 name = rb_node_sym_string_val(node);
9159 if (!
SYMBOL_P(name))
goto non_symbol_arg;
9161 compile_lvar(iseq, ret, line_node,
SYM2ID(name));
9165 COMPILE_ERROR(ERROR_ARGS
"arg!: no argument");
9168 COMPILE_ERROR(ERROR_ARGS
"arg!: too many argument");
9171 COMPILE_ERROR(ERROR_ARGS
"non symbol argument to arg!: %s",
9172 rb_builtin_class_name(name));
9175 UNKNOWN_NODE(
"arg!", node, COMPILE_NG);
9181 const NODE *node = ISEQ_COMPILE_DATA(iseq)->root_node;
9182 if (nd_type(node) == NODE_IF && RNODE_IF(node)->nd_cond == cond_node) {
9183 return RNODE_IF(node)->nd_body;
9186 rb_bug(
"mandatory_node: can't find mandatory node");
9191compile_builtin_mandatory_only_method(
rb_iseq_t *iseq,
const NODE *node,
const NODE *line_node)
9195 .pre_args_num = ISEQ_BODY(iseq)->param.lead_num,
9198 rb_node_init(RNODE(&args_node), NODE_ARGS);
9199 args_node.nd_ainfo = args;
9202 const int skip_local_size = ISEQ_BODY(iseq)->param.size - ISEQ_BODY(iseq)->param.lead_num;
9203 const int table_size = ISEQ_BODY(iseq)->local_table_size - skip_local_size;
9207 tbl->size = table_size;
9212 for (i=0; i<ISEQ_BODY(iseq)->param.lead_num; i++) {
9213 tbl->ids[i] = ISEQ_BODY(iseq)->local_table[i];
9216 for (; i<table_size; i++) {
9217 tbl->ids[i] = ISEQ_BODY(iseq)->local_table[i + skip_local_size];
9221 rb_node_init(RNODE(&scope_node), NODE_SCOPE);
9222 scope_node.nd_tbl = tbl;
9223 scope_node.nd_body = mandatory_node(iseq, node);
9224 scope_node.nd_parent = NULL;
9225 scope_node.nd_args = &args_node;
9227 VALUE ast_value = rb_ruby_ast_new(RNODE(&scope_node));
9230 rb_iseq_new_with_opt(ast_value, rb_iseq_base_label(iseq),
9231 rb_iseq_path(iseq), rb_iseq_realpath(iseq),
9232 nd_line(line_node), NULL, 0,
9233 ISEQ_TYPE_METHOD, ISEQ_COMPILE_DATA(iseq)->option,
9234 ISEQ_BODY(iseq)->variable.script_lines);
9235 RB_OBJ_WRITE(iseq, &ISEQ_BODY(iseq)->mandatory_only_iseq, (
VALUE)mandatory_only_iseq);
9245 NODE *args_node = get_nd_args(node);
9247 if (parent_block != NULL) {
9248 COMPILE_ERROR(ERROR_ARGS_AT(line_node)
"should not call builtins here.");
9252# define BUILTIN_INLINE_PREFIX "_bi"
9253 char inline_func[
sizeof(BUILTIN_INLINE_PREFIX) +
DECIMAL_SIZE_OF(
int)];
9254 bool cconst =
false;
9259 if (strcmp(
"cstmt!", builtin_func) == 0 ||
9260 strcmp(
"cexpr!", builtin_func) == 0) {
9263 else if (strcmp(
"cconst!", builtin_func) == 0) {
9266 else if (strcmp(
"cinit!", builtin_func) == 0) {
9270 else if (strcmp(
"attr!", builtin_func) == 0) {
9271 return compile_builtin_attr(iseq, args_node);
9273 else if (strcmp(
"arg!", builtin_func) == 0) {
9274 return compile_builtin_arg(iseq, ret, args_node, line_node, popped);
9276 else if (strcmp(
"mandatory_only?", builtin_func) == 0) {
9278 rb_bug(
"mandatory_only? should be in if condition");
9280 else if (!LIST_INSN_SIZE_ZERO(ret)) {
9281 rb_bug(
"mandatory_only? should be put on top");
9284 ADD_INSN1(ret, line_node, putobject,
Qfalse);
9285 return compile_builtin_mandatory_only_method(iseq, node, line_node);
9288 rb_bug(
"can't find builtin function:%s", builtin_func);
9291 COMPILE_ERROR(ERROR_ARGS
"can't find builtin function:%s", builtin_func);
9295 int inline_index = nd_line(node);
9296 snprintf(inline_func,
sizeof(inline_func), BUILTIN_INLINE_PREFIX
"%d", inline_index);
9297 builtin_func = inline_func;
9303 typedef VALUE(*builtin_func0)(
void *,
VALUE);
9304 VALUE const_val = (*(builtin_func0)(uintptr_t)bf->func_ptr)(NULL,
Qnil);
9305 ADD_INSN1(ret, line_node, putobject, const_val);
9311 unsigned int flag = 0;
9313 VALUE argc = setup_args(iseq, args, args_node, &flag, &keywords);
9315 if (
FIX2INT(argc) != bf->argc) {
9316 COMPILE_ERROR(ERROR_ARGS
"argc is not match for builtin function:%s (expect %d but %d)",
9317 builtin_func, bf->argc,
FIX2INT(argc));
9321 unsigned int start_index;
9322 if (delegate_call_p(iseq,
FIX2INT(argc), args, &start_index)) {
9323 ADD_INSN2(ret, line_node, opt_invokebuiltin_delegate, bf,
INT2FIX(start_index));
9327 ADD_INSN1(ret, line_node, invokebuiltin, bf);
9330 if (popped) ADD_INSN(ret, line_node, pop);
9336compile_call(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
const enum node_type
type,
const NODE *
const line_node,
int popped,
bool assume_receiver)
9344 ID mid = get_node_call_nd_mid(node);
9346 unsigned int flag = 0;
9348 const rb_iseq_t *parent_block = ISEQ_COMPILE_DATA(iseq)->current_block;
9349 LABEL *else_label = NULL;
9352 ISEQ_COMPILE_DATA(iseq)->current_block = NULL;
9358 if (nd_type_p(node, NODE_VCALL)) {
9363 CONST_ID(id_answer,
"the_answer_to_life_the_universe_and_everything");
9365 if (mid == id_bitblt) {
9366 ADD_INSN(ret, line_node, bitblt);
9369 else if (mid == id_answer) {
9370 ADD_INSN(ret, line_node, answer);
9382 if (nd_type_p(node, NODE_FCALL) &&
9383 (mid == goto_id || mid == label_id)) {
9386 st_table *labels_table = ISEQ_COMPILE_DATA(iseq)->labels_table;
9389 if (!labels_table) {
9390 labels_table = st_init_numtable();
9391 ISEQ_COMPILE_DATA(iseq)->labels_table = labels_table;
9394 COMPILE_ERROR(ERROR_ARGS
"invalid goto/label format");
9398 if (mid == goto_id) {
9399 ADD_INSNL(ret, line_node, jump, label);
9402 ADD_LABEL(ret, label);
9409 const char *builtin_func;
9410 if (UNLIKELY(iseq_has_builtin_function_table(iseq)) &&
9411 (builtin_func = iseq_builtin_function_name(
type, get_nd_recv(node), mid)) != NULL) {
9412 return compile_builtin_function_call(iseq, ret, node, line_node, popped, parent_block, args, builtin_func);
9416 if (!assume_receiver) {
9417 if (
type == NODE_CALL ||
type == NODE_OPCALL ||
type == NODE_QCALL) {
9420 if (mid == idCall &&
9421 nd_type_p(get_nd_recv(node), NODE_LVAR) &&
9422 iseq_block_param_id_p(iseq, RNODE_LVAR(get_nd_recv(node))->nd_vid, &idx, &level)) {
9423 ADD_INSN2(recv, get_nd_recv(node), getblockparamproxy,
INT2FIX(idx + VM_ENV_DATA_SIZE - 1),
INT2FIX(level));
9425 else if (private_recv_p(node)) {
9426 ADD_INSN(recv, node, putself);
9427 flag |= VM_CALL_FCALL;
9430 CHECK(COMPILE(recv,
"recv", get_nd_recv(node)));
9433 if (
type == NODE_QCALL) {
9434 else_label = qcall_branch_start(iseq, recv, &branches, node, line_node);
9437 else if (
type == NODE_FCALL ||
type == NODE_VCALL) {
9438 ADD_CALL_RECEIVER(recv, line_node);
9443 if (
type != NODE_VCALL) {
9444 argc = setup_args(iseq, args, get_nd_args(node), &flag, &keywords);
9445 CHECK(!
NIL_P(argc));
9453 bool inline_new = ISEQ_COMPILE_DATA(iseq)->option->specialized_instruction &&
9454 mid == rb_intern(
"new") &&
9455 parent_block == NULL &&
9456 !(flag & VM_CALL_ARGS_BLOCKARG);
9459 ADD_INSN(ret, node, putnil);
9460 ADD_INSN(ret, node, swap);
9465 debugp_param(
"call args argc", argc);
9466 debugp_param(
"call method",
ID2SYM(mid));
9468 switch ((
int)
type) {
9470 flag |= VM_CALL_VCALL;
9473 flag |= VM_CALL_FCALL;
9476 if ((flag & VM_CALL_ARGS_BLOCKARG) && (flag & VM_CALL_KW_SPLAT) && !(flag & VM_CALL_KW_SPLAT_MUT)) {
9477 ADD_INSN(ret, line_node, splatkw);
9480 LABEL *not_basic_new = NEW_LABEL(nd_line(node));
9481 LABEL *not_basic_new_finish = NEW_LABEL(nd_line(node));
9486 if (flag & VM_CALL_FORWARDING) {
9487 ci = (
VALUE)new_callinfo(iseq, mid,
NUM2INT(argc) + 1, flag, keywords, 0);
9490 ci = (
VALUE)new_callinfo(iseq, mid,
NUM2INT(argc), flag, keywords, 0);
9492 ADD_INSN2(ret, node, opt_new, ci, not_basic_new);
9493 LABEL_REF(not_basic_new);
9496 ADD_SEND_R(ret, line_node, rb_intern(
"initialize"), argc, parent_block,
INT2FIX(flag | VM_CALL_FCALL), keywords);
9497 ADD_INSNL(ret, line_node, jump, not_basic_new_finish);
9499 ADD_LABEL(ret, not_basic_new);
9501 ADD_SEND_R(ret, line_node, mid, argc, parent_block,
INT2FIX(flag), keywords);
9502 ADD_INSN(ret, line_node, swap);
9504 ADD_LABEL(ret, not_basic_new_finish);
9505 ADD_INSN(ret, line_node, pop);
9508 ADD_SEND_R(ret, line_node, mid, argc, parent_block,
INT2FIX(flag), keywords);
9511 qcall_branch_end(iseq, ret, else_label, branches, node, line_node);
9513 ADD_INSN(ret, line_node, pop);
9521 const int line = nd_line(node);
9523 unsigned int flag = 0;
9525 ID id = RNODE_OP_ASGN1(node)->nd_mid;
9551 ADD_INSN(ret, node, putnil);
9553 asgnflag = COMPILE_RECV(ret,
"NODE_OP_ASGN1 recv", node, RNODE_OP_ASGN1(node)->nd_recv);
9554 CHECK(asgnflag != -1);
9555 switch (nd_type(RNODE_OP_ASGN1(node)->nd_index)) {
9560 argc = setup_args(iseq, ret, RNODE_OP_ASGN1(node)->nd_index, &flag, NULL);
9561 CHECK(!
NIL_P(argc));
9563 int dup_argn =
FIX2INT(argc) + 1;
9564 ADD_INSN1(ret, node, dupn,
INT2FIX(dup_argn));
9566 ADD_SEND_R(ret, node, idAREF, argc, NULL,
INT2FIX(flag & ~VM_CALL_ARGS_SPLAT_MUT), NULL);
9568 if (
id == idOROP ||
id == idANDOP) {
9577 LABEL *label = NEW_LABEL(line);
9578 LABEL *lfin = NEW_LABEL(line);
9580 ADD_INSN(ret, node, dup);
9582 ADD_INSNL(ret, node, branchif, label);
9585 ADD_INSNL(ret, node, branchunless, label);
9587 ADD_INSN(ret, node, pop);
9589 CHECK(COMPILE(ret,
"NODE_OP_ASGN1 nd_rvalue: ", RNODE_OP_ASGN1(node)->nd_rvalue));
9591 ADD_INSN1(ret, node, setn,
INT2FIX(dup_argn+1));
9593 if (flag & VM_CALL_ARGS_SPLAT) {
9594 if (!(flag & VM_CALL_ARGS_SPLAT_MUT)) {
9595 ADD_INSN(ret, node, swap);
9596 ADD_INSN1(ret, node, splatarray,
Qtrue);
9597 ADD_INSN(ret, node, swap);
9598 flag |= VM_CALL_ARGS_SPLAT_MUT;
9600 ADD_INSN1(ret, node, pushtoarray,
INT2FIX(1));
9601 ADD_SEND_R(ret, node, idASET, argc, NULL,
INT2FIX(flag), NULL);
9604 ADD_SEND_R(ret, node, idASET, FIXNUM_INC(argc, 1), NULL,
INT2FIX(flag), NULL);
9606 ADD_INSN(ret, node, pop);
9607 ADD_INSNL(ret, node, jump, lfin);
9608 ADD_LABEL(ret, label);
9610 ADD_INSN1(ret, node, setn,
INT2FIX(dup_argn+1));
9612 ADD_INSN1(ret, node, adjuststack,
INT2FIX(dup_argn+1));
9613 ADD_LABEL(ret, lfin);
9616 CHECK(COMPILE(ret,
"NODE_OP_ASGN1 nd_rvalue: ", RNODE_OP_ASGN1(node)->nd_rvalue));
9617 ADD_SEND(ret, node,
id,
INT2FIX(1));
9619 ADD_INSN1(ret, node, setn,
INT2FIX(dup_argn+1));
9621 if (flag & VM_CALL_ARGS_SPLAT) {
9622 if (flag & VM_CALL_KW_SPLAT) {
9623 ADD_INSN1(ret, node, topn,
INT2FIX(2));
9624 if (!(flag & VM_CALL_ARGS_SPLAT_MUT)) {
9625 ADD_INSN1(ret, node, splatarray,
Qtrue);
9626 flag |= VM_CALL_ARGS_SPLAT_MUT;
9628 ADD_INSN(ret, node, swap);
9629 ADD_INSN1(ret, node, pushtoarray,
INT2FIX(1));
9630 ADD_INSN1(ret, node, setn,
INT2FIX(2));
9631 ADD_INSN(ret, node, pop);
9634 if (!(flag & VM_CALL_ARGS_SPLAT_MUT)) {
9635 ADD_INSN(ret, node, swap);
9636 ADD_INSN1(ret, node, splatarray,
Qtrue);
9637 ADD_INSN(ret, node, swap);
9638 flag |= VM_CALL_ARGS_SPLAT_MUT;
9640 ADD_INSN1(ret, node, pushtoarray,
INT2FIX(1));
9642 ADD_SEND_R(ret, node, idASET, argc, NULL,
INT2FIX(flag), NULL);
9645 ADD_SEND_R(ret, node, idASET, FIXNUM_INC(argc, 1), NULL,
INT2FIX(flag), NULL);
9647 ADD_INSN(ret, node, pop);
9655 const int line = nd_line(node);
9656 ID atype = RNODE_OP_ASGN2(node)->nd_mid;
9657 ID vid = RNODE_OP_ASGN2(node)->nd_vid, aid = rb_id_attrset(vid);
9659 LABEL *lfin = NEW_LABEL(line);
9660 LABEL *lcfin = NEW_LABEL(line);
9715 asgnflag = COMPILE_RECV(ret,
"NODE_OP_ASGN2#recv", node, RNODE_OP_ASGN2(node)->nd_recv);
9716 CHECK(asgnflag != -1);
9717 if (RNODE_OP_ASGN2(node)->nd_aid) {
9718 lskip = NEW_LABEL(line);
9719 ADD_INSN(ret, node, dup);
9720 ADD_INSNL(ret, node, branchnil, lskip);
9722 ADD_INSN(ret, node, dup);
9723 ADD_SEND_WITH_FLAG(ret, node, vid,
INT2FIX(0),
INT2FIX(asgnflag));
9725 if (atype == idOROP || atype == idANDOP) {
9727 ADD_INSN(ret, node, dup);
9729 if (atype == idOROP) {
9730 ADD_INSNL(ret, node, branchif, lcfin);
9733 ADD_INSNL(ret, node, branchunless, lcfin);
9736 ADD_INSN(ret, node, pop);
9738 CHECK(COMPILE(ret,
"NODE_OP_ASGN2 val", RNODE_OP_ASGN2(node)->nd_value));
9740 ADD_INSN(ret, node, swap);
9741 ADD_INSN1(ret, node, topn,
INT2FIX(1));
9743 ADD_SEND_WITH_FLAG(ret, node, aid,
INT2FIX(1),
INT2FIX(asgnflag));
9744 ADD_INSNL(ret, node, jump, lfin);
9746 ADD_LABEL(ret, lcfin);
9748 ADD_INSN(ret, node, swap);
9751 ADD_LABEL(ret, lfin);
9754 CHECK(COMPILE(ret,
"NODE_OP_ASGN2 val", RNODE_OP_ASGN2(node)->nd_value));
9755 ADD_SEND(ret, node, atype,
INT2FIX(1));
9757 ADD_INSN(ret, node, swap);
9758 ADD_INSN1(ret, node, topn,
INT2FIX(1));
9760 ADD_SEND_WITH_FLAG(ret, node, aid,
INT2FIX(1),
INT2FIX(asgnflag));
9762 if (lskip && popped) {
9763 ADD_LABEL(ret, lskip);
9765 ADD_INSN(ret, node, pop);
9766 if (lskip && !popped) {
9767 ADD_LABEL(ret, lskip);
9772static int compile_shareable_constant_value(
rb_iseq_t *iseq,
LINK_ANCHOR *ret,
enum rb_parser_shareability shareable,
const NODE *lhs,
const NODE *value);
9777 const int line = nd_line(node);
9782 switch (nd_type(RNODE_OP_CDECL(node)->nd_head)) {
9784 ADD_INSN1(ret, node, putobject, rb_cObject);
9787 CHECK(COMPILE(ret,
"NODE_OP_CDECL/colon2#nd_head", RNODE_COLON2(RNODE_OP_CDECL(node)->nd_head)->nd_head));
9790 COMPILE_ERROR(ERROR_ARGS
"%s: invalid node in NODE_OP_CDECL",
9791 ruby_node_name(nd_type(RNODE_OP_CDECL(node)->nd_head)));
9794 mid = get_node_colon_nd_mid(RNODE_OP_CDECL(node)->nd_head);
9796 if (RNODE_OP_CDECL(node)->nd_aid == idOROP) {
9797 lassign = NEW_LABEL(line);
9798 ADD_INSN(ret, node, dup);
9799 ADD_INSN3(ret, node, defined,
INT2FIX(DEFINED_CONST_FROM),
9801 ADD_INSNL(ret, node, branchunless, lassign);
9803 ADD_INSN(ret, node, dup);
9804 ADD_INSN1(ret, node, putobject,
Qtrue);
9805 ADD_INSN1(ret, node, getconstant,
ID2SYM(mid));
9807 if (RNODE_OP_CDECL(node)->nd_aid == idOROP || RNODE_OP_CDECL(node)->nd_aid == idANDOP) {
9808 lfin = NEW_LABEL(line);
9809 if (!popped) ADD_INSN(ret, node, dup);
9810 if (RNODE_OP_CDECL(node)->nd_aid == idOROP)
9811 ADD_INSNL(ret, node, branchif, lfin);
9813 ADD_INSNL(ret, node, branchunless, lfin);
9815 if (!popped) ADD_INSN(ret, node, pop);
9816 if (lassign) ADD_LABEL(ret, lassign);
9817 CHECK(compile_shareable_constant_value(iseq, ret, RNODE_OP_CDECL(node)->shareability, RNODE_OP_CDECL(node)->nd_head, RNODE_OP_CDECL(node)->nd_value));
9820 ADD_INSN1(ret, node, topn,
INT2FIX(1));
9822 ADD_INSN1(ret, node, dupn,
INT2FIX(2));
9823 ADD_INSN(ret, node, swap);
9825 ADD_INSN1(ret, node, setconstant,
ID2SYM(mid));
9826 ADD_LABEL(ret, lfin);
9827 if (!popped) ADD_INSN(ret, node, swap);
9828 ADD_INSN(ret, node, pop);
9831 CHECK(compile_shareable_constant_value(iseq, ret, RNODE_OP_CDECL(node)->shareability, RNODE_OP_CDECL(node)->nd_head, RNODE_OP_CDECL(node)->nd_value));
9833 ADD_CALL(ret, node, RNODE_OP_CDECL(node)->nd_aid,
INT2FIX(1));
9835 ADD_INSN(ret, node, swap);
9837 ADD_INSN1(ret, node, topn,
INT2FIX(1));
9838 ADD_INSN(ret, node, swap);
9840 ADD_INSN1(ret, node, setconstant,
ID2SYM(mid));
9848 const int line = nd_line(node);
9849 LABEL *lfin = NEW_LABEL(line);
9852 if (
type == NODE_OP_ASGN_OR && !nd_type_p(RNODE_OP_ASGN_OR(node)->nd_head, NODE_IVAR)) {
9856 defined_expr(iseq, ret, RNODE_OP_ASGN_OR(node)->nd_head, lfinish,
Qfalse,
false);
9857 lassign = lfinish[1];
9859 lassign = NEW_LABEL(line);
9861 ADD_INSNL(ret, node, branchunless, lassign);
9864 lassign = NEW_LABEL(line);
9867 CHECK(COMPILE(ret,
"NODE_OP_ASGN_AND/OR#nd_head", RNODE_OP_ASGN_OR(node)->nd_head));
9870 ADD_INSN(ret, node, dup);
9873 if (
type == NODE_OP_ASGN_AND) {
9874 ADD_INSNL(ret, node, branchunless, lfin);
9877 ADD_INSNL(ret, node, branchif, lfin);
9881 ADD_INSN(ret, node, pop);
9884 ADD_LABEL(ret, lassign);
9885 CHECK(COMPILE_(ret,
"NODE_OP_ASGN_AND/OR#nd_value", RNODE_OP_ASGN_OR(node)->nd_value, popped));
9886 ADD_LABEL(ret, lfin);
9896 unsigned int flag = 0;
9898 const rb_iseq_t *parent_block = ISEQ_COMPILE_DATA(iseq)->current_block;
9902 ISEQ_COMPILE_DATA(iseq)->current_block = NULL;
9904 if (
type == NODE_SUPER) {
9905 VALUE vargc = setup_args(iseq, args, RNODE_SUPER(node)->nd_args, &flag, &keywords);
9906 CHECK(!
NIL_P(vargc));
9908 if ((flag & VM_CALL_ARGS_BLOCKARG) && (flag & VM_CALL_KW_SPLAT) && !(flag & VM_CALL_KW_SPLAT_MUT)) {
9909 ADD_INSN(args, node, splatkw);
9912 if (flag & VM_CALL_ARGS_BLOCKARG) {
9919 const rb_iseq_t *liseq = body->local_iseq;
9921 const struct rb_iseq_param_keyword *
const local_kwd = local_body->
param.keyword;
9922 int lvar_level = get_lvar_level(iseq);
9924 argc = local_body->
param.lead_num;
9927 for (i = 0; i < local_body->
param.lead_num; i++) {
9928 int idx = local_body->local_table_size - i;
9929 ADD_GETLOCAL(args, node, idx, lvar_level);
9933 if (local_body->
param.flags.forwardable) {
9934 flag |= VM_CALL_FORWARDING;
9935 int idx = local_body->local_table_size - get_local_var_idx(liseq, idDot3);
9936 ADD_GETLOCAL(args, node, idx, lvar_level);
9939 if (local_body->
param.flags.has_opt) {
9942 for (j = 0; j < local_body->
param.opt_num; j++) {
9943 int idx = local_body->local_table_size - (i + j);
9944 ADD_GETLOCAL(args, node, idx, lvar_level);
9949 if (local_body->
param.flags.has_rest) {
9951 int idx = local_body->local_table_size - local_body->
param.rest_start;
9952 ADD_GETLOCAL(args, node, idx, lvar_level);
9953 ADD_INSN1(args, node, splatarray, RBOOL(local_body->
param.flags.has_post));
9955 argc = local_body->
param.rest_start + 1;
9956 flag |= VM_CALL_ARGS_SPLAT;
9958 if (local_body->
param.flags.has_post) {
9960 int post_len = local_body->
param.post_num;
9961 int post_start = local_body->
param.post_start;
9963 if (local_body->
param.flags.has_rest) {
9965 for (j=0; j<post_len; j++) {
9966 int idx = local_body->local_table_size - (post_start + j);
9967 ADD_GETLOCAL(args, node, idx, lvar_level);
9969 ADD_INSN1(args, node, pushtoarray,
INT2FIX(j));
9970 flag |= VM_CALL_ARGS_SPLAT_MUT;
9975 for (j=0; j<post_len; j++) {
9976 int idx = local_body->local_table_size - (post_start + j);
9977 ADD_GETLOCAL(args, node, idx, lvar_level);
9979 argc = post_len + post_start;
9983 if (local_body->
param.flags.has_kw) {
9984 int local_size = local_body->local_table_size;
9987 ADD_INSN1(args, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
9989 if (local_body->
param.flags.has_kwrest) {
9990 int idx = local_body->local_table_size - local_kwd->rest_start;
9991 ADD_GETLOCAL(args, node, idx, lvar_level);
9993 ADD_SEND (args, node, rb_intern(
"dup"),
INT2FIX(0));
9996 ADD_INSN1(args, node, newhash,
INT2FIX(0));
9998 for (i = 0; i < local_kwd->num; ++i) {
9999 ID id = local_kwd->table[i];
10000 int idx = local_size - get_local_var_idx(liseq,
id);
10001 ADD_INSN1(args, node, putobject,
ID2SYM(
id));
10002 ADD_GETLOCAL(args, node, idx, lvar_level);
10004 ADD_SEND(args, node, id_core_hash_merge_ptr,
INT2FIX(i * 2 + 1));
10005 flag |= VM_CALL_KW_SPLAT| VM_CALL_KW_SPLAT_MUT;
10007 else if (local_body->
param.flags.has_kwrest) {
10008 int idx = local_body->local_table_size - local_kwd->rest_start;
10009 ADD_GETLOCAL(args, node, idx, lvar_level);
10011 flag |= VM_CALL_KW_SPLAT;
10015 if (use_block && parent_block == NULL) {
10016 iseq_set_use_block(ISEQ_BODY(iseq)->local_iseq);
10019 flag |= VM_CALL_SUPER | VM_CALL_FCALL;
10020 if (
type == NODE_ZSUPER) flag |= VM_CALL_ZSUPER;
10021 ADD_INSN(ret, node, putself);
10022 ADD_SEQ(ret, args);
10024 const struct rb_callinfo * ci = new_callinfo(iseq, 0, argc, flag, keywords, parent_block != NULL);
10026 if (vm_ci_flag(ci) & VM_CALL_FORWARDING) {
10027 ADD_INSN2(ret, node, invokesuperforward, ci, parent_block);
10030 ADD_INSN2(ret, node, invokesuper, ci, parent_block);
10034 ADD_INSN(ret, node, pop);
10044 unsigned int flag = 0;
10049 switch (ISEQ_BODY(ISEQ_BODY(iseq)->local_iseq)->
type) {
10050 case ISEQ_TYPE_TOP:
10051 case ISEQ_TYPE_MAIN:
10052 case ISEQ_TYPE_CLASS:
10053 COMPILE_ERROR(ERROR_ARGS
"Invalid yield");
10058 if (RNODE_YIELD(node)->nd_head) {
10059 argc = setup_args(iseq, args, RNODE_YIELD(node)->nd_head, &flag, &keywords);
10060 CHECK(!
NIL_P(argc));
10066 ADD_SEQ(ret, args);
10067 ADD_INSN1(ret, node, invokeblock, new_callinfo(iseq, 0,
FIX2INT(argc), flag, keywords, FALSE));
10068 iseq_set_use_block(ISEQ_BODY(iseq)->local_iseq);
10071 ADD_INSN(ret, node, pop);
10076 for (; tmp_iseq != ISEQ_BODY(iseq)->local_iseq; level++ ) {
10077 tmp_iseq = ISEQ_BODY(tmp_iseq)->parent_iseq;
10079 if (level > 0) access_outer_variables(iseq, level, rb_intern(
"yield"),
true);
10092 switch ((
int)
type) {
10094 ADD_INSN1(recv, node, putobject, rb_node_regx_string_val(node));
10095 ADD_INSN2(val, node, getspecial,
INT2FIX(0),
10099 CHECK(COMPILE(recv,
"receiver", RNODE_MATCH2(node)->nd_recv));
10100 CHECK(COMPILE(val,
"value", RNODE_MATCH2(node)->nd_value));
10103 CHECK(COMPILE(recv,
"receiver", RNODE_MATCH3(node)->nd_value));
10104 CHECK(COMPILE(val,
"value", RNODE_MATCH3(node)->nd_recv));
10108 ADD_SEQ(ret, recv);
10110 ADD_SEND(ret, node, idEqTilde,
INT2FIX(1));
10112 if (nd_type_p(node, NODE_MATCH2) && RNODE_MATCH2(node)->nd_args) {
10113 compile_named_capture_assign(iseq, ret, RNODE_MATCH2(node)->nd_args);
10117 ADD_INSN(ret, node, pop);
10128 if (ISEQ_COMPILE_DATA(iseq)->option->inline_const_cache &&
10129 (segments = collect_const_segments(iseq, node))) {
10130 ISEQ_BODY(iseq)->ic_size++;
10131 ADD_INSN1(ret, node, opt_getconstant_path, segments);
10141 CHECK(compile_const_prefix(iseq, node, pref, body));
10142 if (LIST_INSN_SIZE_ZERO(pref)) {
10143 ADD_INSN(ret, node, putnil);
10144 ADD_SEQ(ret, body);
10147 ADD_SEQ(ret, pref);
10148 ADD_SEQ(ret, body);
10154 ADD_CALL_RECEIVER(ret, node);
10155 CHECK(COMPILE(ret,
"colon2#nd_head", RNODE_COLON2(node)->nd_head));
10156 ADD_CALL(ret, node, RNODE_COLON2(node)->nd_mid,
INT2FIX(1));
10159 ADD_INSN(ret, node, pop);
10167 debugi(
"colon3#nd_mid", RNODE_COLON3(node)->nd_mid);
10170 if (ISEQ_COMPILE_DATA(iseq)->option->inline_const_cache) {
10171 ISEQ_BODY(iseq)->ic_size++;
10172 VALUE segments = rb_ary_new_from_args(2,
ID2SYM(idNULL),
ID2SYM(RNODE_COLON3(node)->nd_mid));
10173 ADD_INSN1(ret, node, opt_getconstant_path, segments);
10177 ADD_INSN1(ret, node, putobject, rb_cObject);
10178 ADD_INSN1(ret, node, putobject,
Qtrue);
10179 ADD_INSN1(ret, node, getconstant,
ID2SYM(RNODE_COLON3(node)->nd_mid));
10183 ADD_INSN(ret, node, pop);
10192 const NODE *b = RNODE_DOT2(node)->nd_beg;
10193 const NODE *e = RNODE_DOT2(node)->nd_end;
10195 if (optimizable_range_item_p(b) && optimizable_range_item_p(e)) {
10197 VALUE bv = optimized_range_item(b);
10198 VALUE ev = optimized_range_item(e);
10200 ADD_INSN1(ret, node, putobject, val);
10205 CHECK(COMPILE_(ret,
"min", b, popped));
10206 CHECK(COMPILE_(ret,
"max", e, popped));
10208 ADD_INSN1(ret, node, newrange, flag);
10218 if (ISEQ_BODY(iseq)->
type == ISEQ_TYPE_RESCUE) {
10219 ADD_GETLOCAL(ret, node, LVAR_ERRINFO, 0);
10225 if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_RESCUE) {
10228 ip = ISEQ_BODY(ip)->parent_iseq;
10232 ADD_GETLOCAL(ret, node, LVAR_ERRINFO, level);
10235 ADD_INSN(ret, node, putnil);
10246 LABEL *end_label = NEW_LABEL(nd_line(node));
10247 const NODE *default_value = get_nd_value(RNODE_KW_ARG(node)->nd_body);
10249 if (default_value == NODE_SPECIAL_REQUIRED_KEYWORD) {
10251 COMPILE_ERROR(ERROR_ARGS
"unreachable");
10254 else if (nd_type_p(default_value, NODE_SYM) ||
10255 nd_type_p(default_value, NODE_REGX) ||
10256 nd_type_p(default_value, NODE_LINE) ||
10257 nd_type_p(default_value, NODE_INTEGER) ||
10258 nd_type_p(default_value, NODE_FLOAT) ||
10259 nd_type_p(default_value, NODE_RATIONAL) ||
10260 nd_type_p(default_value, NODE_IMAGINARY) ||
10261 nd_type_p(default_value, NODE_NIL) ||
10262 nd_type_p(default_value, NODE_TRUE) ||
10263 nd_type_p(default_value, NODE_FALSE)) {
10264 COMPILE_ERROR(ERROR_ARGS
"unreachable");
10272 int kw_bits_idx = body->local_table_size - body->
param.keyword->bits_start;
10273 int keyword_idx = body->
param.keyword->num;
10275 ADD_INSN2(ret, node, checkkeyword,
INT2FIX(kw_bits_idx + VM_ENV_DATA_SIZE - 1),
INT2FIX(keyword_idx));
10276 ADD_INSNL(ret, node, branchif, end_label);
10277 CHECK(COMPILE_POPPED(ret,
"keyword default argument", RNODE_KW_ARG(node)->nd_body));
10278 ADD_LABEL(ret, end_label);
10288 unsigned int flag = 0;
10289 ID mid = RNODE_ATTRASGN(node)->nd_mid;
10291 LABEL *else_label = NULL;
10296 argc = setup_args(iseq, args, RNODE_ATTRASGN(node)->nd_args, &flag, NULL);
10297 CHECK(!
NIL_P(argc));
10299 int asgnflag = COMPILE_RECV(recv,
"recv", node, RNODE_ATTRASGN(node)->nd_recv);
10300 CHECK(asgnflag != -1);
10301 flag |= (
unsigned int)asgnflag;
10303 debugp_param(
"argc", argc);
10304 debugp_param(
"nd_mid",
ID2SYM(mid));
10308 mid = rb_id_attrset(mid);
10309 else_label = qcall_branch_start(iseq, recv, &branches, node, node);
10312 ADD_INSN(ret, node, putnil);
10313 ADD_SEQ(ret, recv);
10314 ADD_SEQ(ret, args);
10316 if (flag & VM_CALL_ARGS_SPLAT) {
10317 ADD_INSN(ret, node, dup);
10318 ADD_INSN1(ret, node, putobject,
INT2FIX(-1));
10319 ADD_SEND_WITH_FLAG(ret, node, idAREF,
INT2FIX(1),
INT2FIX(asgnflag));
10320 ADD_INSN1(ret, node, setn, FIXNUM_INC(argc, 2));
10321 ADD_INSN (ret, node, pop);
10324 ADD_INSN1(ret, node, setn, FIXNUM_INC(argc, 1));
10328 ADD_SEQ(ret, recv);
10329 ADD_SEQ(ret, args);
10331 ADD_SEND_WITH_FLAG(ret, node, mid, argc,
INT2FIX(flag));
10332 qcall_branch_end(iseq, ret, else_label, branches, node, node);
10333 ADD_INSN(ret, node, pop);
10340 ADD_INSN1(ret, value, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
10348 ADD_SEND_WITH_FLAG(ret, value, rb_intern(
"make_shareable_copy"),
INT2FIX(1),
INT2FIX(VM_CALL_ARGS_SIMPLE));
10355 ADD_SEND_WITH_FLAG(ret, value, rb_intern(
"make_shareable"),
INT2FIX(1),
INT2FIX(VM_CALL_ARGS_SIMPLE));
10362node_const_decl_val(
const NODE *node)
10365 switch (nd_type(node)) {
10367 if (RNODE_CDECL(node)->nd_vid) {
10368 path = rb_id2str(RNODE_CDECL(node)->nd_vid);
10372 node = RNODE_CDECL(node)->nd_else;
10380 rb_str_append(path, rb_id2str(RNODE_COLON3(node)->nd_mid));
10383 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(node)));
10389 for (; node && nd_type_p(node, NODE_COLON2); node = RNODE_COLON2(node)->nd_head) {
10390 rb_ary_push(path, rb_id2str(RNODE_COLON2(node)->nd_mid));
10392 if (node && nd_type_p(node, NODE_CONST)) {
10394 rb_ary_push(path, rb_id2str(RNODE_CONST(node)->nd_vid));
10396 else if (node && nd_type_p(node, NODE_COLON3)) {
10398 rb_ary_push(path, rb_id2str(RNODE_COLON3(node)->nd_mid));
10408 path = rb_fstring(path);
10413const_decl_path(
NODE *dest)
10416 if (!nd_type_p(dest, NODE_CALL)) {
10417 path = node_const_decl_val(dest);
10428 VALUE path = const_decl_path(dest);
10429 ADD_INSN1(ret, value, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
10430 CHECK(COMPILE(ret,
"compile_ensure_shareable_node", value));
10431 ADD_INSN1(ret, value, putobject, path);
10433 ADD_SEND_WITH_FLAG(ret, value, rb_intern(
"ensure_shareable"),
INT2FIX(2),
INT2FIX(VM_CALL_ARGS_SIMPLE));
10438#ifndef SHAREABLE_BARE_EXPRESSION
10439#define SHAREABLE_BARE_EXPRESSION 1
10443compile_shareable_literal_constant(
rb_iseq_t *iseq,
LINK_ANCHOR *ret,
enum rb_parser_shareability shareable,
NODE *dest,
const NODE *node,
size_t level,
VALUE *value_p,
int *shareable_literal_p)
10445# define compile_shareable_literal_constant_next(node, anchor, value_p, shareable_literal_p) \
10446 compile_shareable_literal_constant(iseq, anchor, shareable, dest, node, level+1, value_p, shareable_literal_p)
10448 DECL_ANCHOR(anchor);
10450 enum node_type
type = node ? nd_type(node) : NODE_NIL;
10462 *value_p = rb_node_sym_string_val(node);
10465 *value_p = rb_node_regx_string_val(node);
10468 *value_p = rb_node_line_lineno_val(node);
10471 *value_p = rb_node_integer_literal_val(node);
10474 *value_p = rb_node_float_literal_val(node);
10476 case NODE_RATIONAL:
10477 *value_p = rb_node_rational_literal_val(node);
10479 case NODE_IMAGINARY:
10480 *value_p = rb_node_imaginary_literal_val(node);
10482 case NODE_ENCODING:
10483 *value_p = rb_node_encoding_val(node);
10486 CHECK(COMPILE(ret,
"shareable_literal_constant", node));
10487 *shareable_literal_p = 1;
10491 CHECK(COMPILE(ret,
"shareable_literal_constant", node));
10492 if (shareable == rb_parser_shareable_literal) {
10498 ADD_SEND_WITH_FLAG(ret, node, idUMinus,
INT2FIX(0),
INT2FIX(VM_CALL_ARGS_SIMPLE));
10501 *shareable_literal_p = 1;
10505 VALUE lit = rb_node_str_string_val(node);
10506 ADD_INSN1(ret, node, putobject, lit);
10509 *shareable_literal_p = 1;
10515 VALUE lit = rb_node_file_path_val(node);
10516 ADD_INSN1(ret, node, putobject, lit);
10519 *shareable_literal_p = 1;
10527 ADD_INSN1(ret, node, putobject, lit);
10530 *shareable_literal_p = 1;
10536 INIT_ANCHOR(anchor);
10538 for (
NODE *n = (
NODE *)node; n; n = RNODE_LIST(n)->nd_next) {
10540 int shareable_literal_p2;
10541 NODE *elt = RNODE_LIST(n)->nd_head;
10543 CHECK(compile_shareable_literal_constant_next(elt, anchor, &val, &shareable_literal_p2));
10544 if (shareable_literal_p2) {
10547 else if (
RTEST(lit)) {
10553 if (!UNDEF_P(val)) {
10565 if (!RNODE_HASH(node)->nd_brace) {
10567 *shareable_literal_p = 0;
10570 for (
NODE *n = RNODE_HASH(node)->nd_head; n; n = RNODE_LIST(RNODE_LIST(n)->nd_next)->nd_next) {
10571 if (!RNODE_LIST(n)->nd_head) {
10573 goto compile_shareable;
10577 INIT_ANCHOR(anchor);
10578 lit = rb_hash_new();
10579 for (
NODE *n = RNODE_HASH(node)->nd_head; n; n = RNODE_LIST(RNODE_LIST(n)->nd_next)->nd_next) {
10581 VALUE value_val = 0;
10582 int shareable_literal_p2;
10583 NODE *key = RNODE_LIST(n)->nd_head;
10584 NODE *val = RNODE_LIST(RNODE_LIST(n)->nd_next)->nd_head;
10585 CHECK(compile_shareable_literal_constant_next(key, anchor, &key_val, &shareable_literal_p2));
10586 if (shareable_literal_p2) {
10589 else if (
RTEST(lit)) {
10590 rb_hash_clear(lit);
10593 CHECK(compile_shareable_literal_constant_next(val, anchor, &value_val, &shareable_literal_p2));
10594 if (shareable_literal_p2) {
10597 else if (
RTEST(lit)) {
10598 rb_hash_clear(lit);
10602 if (!UNDEF_P(key_val) && !UNDEF_P(value_val)) {
10603 rb_hash_aset(lit, key_val, value_val);
10606 rb_hash_clear(lit);
10617 if (shareable == rb_parser_shareable_literal &&
10618 (SHAREABLE_BARE_EXPRESSION || level > 0)) {
10619 CHECK(compile_ensure_shareable_node(iseq, ret, dest, node));
10621 *shareable_literal_p = 1;
10624 CHECK(COMPILE(ret,
"shareable_literal_constant", node));
10626 *shareable_literal_p = 0;
10632 if (nd_type(node) == NODE_LIST) {
10633 ADD_INSN1(anchor, node, newarray,
INT2FIX(RNODE_LIST(node)->as.nd_alen));
10635 else if (nd_type(node) == NODE_HASH) {
10636 int len = (int)RNODE_LIST(RNODE_HASH(node)->nd_head)->as.nd_alen;
10637 ADD_INSN1(anchor, node, newhash,
INT2FIX(
len));
10640 *shareable_literal_p = 0;
10641 ADD_SEQ(ret, anchor);
10647 if (nd_type(node) == NODE_LIST) {
10648 ADD_INSN1(anchor, node, newarray,
INT2FIX(RNODE_LIST(node)->as.nd_alen));
10650 else if (nd_type(node) == NODE_HASH) {
10651 int len = (int)RNODE_LIST(RNODE_HASH(node)->nd_head)->as.nd_alen;
10652 ADD_INSN1(anchor, node, newhash,
INT2FIX(
len));
10654 CHECK(compile_make_shareable_node(iseq, ret, anchor, node,
false));
10656 *shareable_literal_p = 1;
10660 ADD_INSN1(ret, node, putobject, val);
10663 *shareable_literal_p = 1;
10670compile_shareable_constant_value(
rb_iseq_t *iseq,
LINK_ANCHOR *ret,
enum rb_parser_shareability shareable,
const NODE *lhs,
const NODE *value)
10674 DECL_ANCHOR(anchor);
10675 INIT_ANCHOR(anchor);
10677 switch (shareable) {
10678 case rb_parser_shareable_none:
10679 CHECK(COMPILE(ret,
"compile_shareable_constant_value", value));
10682 case rb_parser_shareable_literal:
10683 CHECK(compile_shareable_literal_constant(iseq, anchor, shareable, (
NODE *)lhs, value, 0, &val, &literal_p));
10684 ADD_SEQ(ret, anchor);
10687 case rb_parser_shareable_copy:
10688 case rb_parser_shareable_everything:
10689 CHECK(compile_shareable_literal_constant(iseq, anchor, shareable, (
NODE *)lhs, value, 0, &val, &literal_p));
10691 CHECK(compile_make_shareable_node(iseq, ret, anchor, value, shareable == rb_parser_shareable_copy));
10694 ADD_SEQ(ret, anchor);
10698 rb_bug(
"unexpected rb_parser_shareability: %d", shareable);
10715 int lineno = ISEQ_COMPILE_DATA(iseq)->last_line;
10716 if (lineno == 0) lineno =
FIX2INT(rb_iseq_first_lineno(iseq));
10717 debugs(
"node: NODE_NIL(implicit)\n");
10718 ADD_SYNTHETIC_INSN(ret, lineno, -1, putnil);
10722 return iseq_compile_each0(iseq, ret, node, popped);
10728 const int line = (int)nd_line(node);
10729 const enum node_type
type = nd_type(node);
10732 if (ISEQ_COMPILE_DATA(iseq)->last_line == line) {
10736 if (nd_fl_newline(node)) {
10738 ISEQ_COMPILE_DATA(iseq)->last_line = line;
10739 if (line > 0 && ISEQ_COVERAGE(iseq) && ISEQ_LINE_COVERAGE(iseq)) {
10740 event |= RUBY_EVENT_COVERAGE_LINE;
10742 ADD_TRACE(ret, event);
10746 debug_node_start(node);
10747#undef BEFORE_RETURN
10748#define BEFORE_RETURN debug_node_end()
10752 CHECK(compile_block(iseq, ret, node, popped));
10756 CHECK(compile_if(iseq, ret, node, popped,
type));
10759 CHECK(compile_case(iseq, ret, node, popped));
10762 CHECK(compile_case2(iseq, ret, node, popped));
10765 CHECK(compile_case3(iseq, ret, node, popped));
10769 CHECK(compile_loop(iseq, ret, node, popped,
type));
10773 CHECK(compile_iter(iseq, ret, node, popped));
10775 case NODE_FOR_MASGN:
10776 CHECK(compile_for_masgn(iseq, ret, node, popped));
10779 CHECK(compile_break(iseq, ret, node, popped));
10782 CHECK(compile_next(iseq, ret, node, popped));
10785 CHECK(compile_redo(iseq, ret, node, popped));
10788 CHECK(compile_retry(iseq, ret, node, popped));
10791 CHECK(COMPILE_(ret,
"NODE_BEGIN", RNODE_BEGIN(node)->nd_body, popped));
10795 CHECK(compile_rescue(iseq, ret, node, popped));
10798 CHECK(compile_resbody(iseq, ret, node, popped));
10801 CHECK(compile_ensure(iseq, ret, node, popped));
10806 LABEL *end_label = NEW_LABEL(line);
10807 CHECK(COMPILE(ret,
"nd_1st", RNODE_OR(node)->nd_1st));
10809 ADD_INSN(ret, node, dup);
10811 if (
type == NODE_AND) {
10812 ADD_INSNL(ret, node, branchunless, end_label);
10815 ADD_INSNL(ret, node, branchif, end_label);
10818 ADD_INSN(ret, node, pop);
10820 CHECK(COMPILE_(ret,
"nd_2nd", RNODE_OR(node)->nd_2nd, popped));
10821 ADD_LABEL(ret, end_label);
10826 bool prev_in_masgn = ISEQ_COMPILE_DATA(iseq)->in_masgn;
10827 ISEQ_COMPILE_DATA(iseq)->in_masgn =
true;
10828 compile_massign(iseq, ret, node, popped);
10829 ISEQ_COMPILE_DATA(iseq)->in_masgn = prev_in_masgn;
10834 ID id = RNODE_LASGN(node)->nd_vid;
10835 int idx = ISEQ_BODY(body->local_iseq)->local_table_size - get_local_var_idx(iseq,
id);
10837 debugs(
"lvar: %s idx: %d\n", rb_id2name(
id), idx);
10838 CHECK(COMPILE(ret,
"rvalue", RNODE_LASGN(node)->nd_value));
10841 ADD_INSN(ret, node, dup);
10843 ADD_SETLOCAL(ret, node, idx, get_lvar_level(iseq));
10848 ID id = RNODE_DASGN(node)->nd_vid;
10849 CHECK(COMPILE(ret,
"dvalue", RNODE_DASGN(node)->nd_value));
10850 debugi(
"dassn id", rb_id2str(
id) ?
id :
'*');
10853 ADD_INSN(ret, node, dup);
10856 idx = get_dyna_var_idx(iseq,
id, &lv, &ls);
10859 COMPILE_ERROR(ERROR_ARGS
"NODE_DASGN: unknown id (%"PRIsVALUE
")",
10863 ADD_SETLOCAL(ret, node, ls - idx, lv);
10867 CHECK(COMPILE(ret,
"lvalue", RNODE_GASGN(node)->nd_value));
10870 ADD_INSN(ret, node, dup);
10872 ADD_INSN1(ret, node, setglobal,
ID2SYM(RNODE_GASGN(node)->nd_vid));
10876 CHECK(COMPILE(ret,
"lvalue", RNODE_IASGN(node)->nd_value));
10878 ADD_INSN(ret, node, dup);
10880 ADD_INSN2(ret, node, setinstancevariable,
10881 ID2SYM(RNODE_IASGN(node)->nd_vid),
10882 get_ivar_ic_value(iseq,RNODE_IASGN(node)->nd_vid));
10886 if (RNODE_CDECL(node)->nd_vid) {
10887 CHECK(compile_shareable_constant_value(iseq, ret, RNODE_CDECL(node)->shareability, node, RNODE_CDECL(node)->nd_value));
10890 ADD_INSN(ret, node, dup);
10893 ADD_INSN1(ret, node, putspecialobject,
10894 INT2FIX(VM_SPECIAL_OBJECT_CONST_BASE));
10895 ADD_INSN1(ret, node, setconstant,
ID2SYM(RNODE_CDECL(node)->nd_vid));
10898 compile_cpath(ret, iseq, RNODE_CDECL(node)->nd_else);
10899 CHECK(compile_shareable_constant_value(iseq, ret, RNODE_CDECL(node)->shareability, node, RNODE_CDECL(node)->nd_value));
10900 ADD_INSN(ret, node, swap);
10903 ADD_INSN1(ret, node, topn,
INT2FIX(1));
10904 ADD_INSN(ret, node, swap);
10907 ADD_INSN1(ret, node, setconstant,
ID2SYM(get_node_colon_nd_mid(RNODE_CDECL(node)->nd_else)));
10912 CHECK(COMPILE(ret,
"cvasgn val", RNODE_CVASGN(node)->nd_value));
10914 ADD_INSN(ret, node, dup);
10916 ADD_INSN2(ret, node, setclassvariable,
10917 ID2SYM(RNODE_CVASGN(node)->nd_vid),
10918 get_cvar_ic_value(iseq, RNODE_CVASGN(node)->nd_vid));
10921 case NODE_OP_ASGN1:
10922 CHECK(compile_op_asgn1(iseq, ret, node, popped));
10924 case NODE_OP_ASGN2:
10925 CHECK(compile_op_asgn2(iseq, ret, node, popped));
10927 case NODE_OP_CDECL:
10928 CHECK(compile_op_cdecl(iseq, ret, node, popped));
10930 case NODE_OP_ASGN_AND:
10931 case NODE_OP_ASGN_OR:
10932 CHECK(compile_op_log(iseq, ret, node, popped,
type));
10936 if (compile_call_precheck_freeze(iseq, ret, node, node, popped) == TRUE) {
10942 if (compile_call(iseq, ret, node,
type, node, popped,
false) == COMPILE_NG) {
10948 CHECK(compile_super(iseq, ret, node, popped,
type));
10951 CHECK(compile_array(iseq, ret, node, popped, TRUE) >= 0);
10956 ADD_INSN1(ret, node, newarray,
INT2FIX(0));
10961 CHECK(compile_hash(iseq, ret, node, FALSE, popped) >= 0);
10964 CHECK(compile_return(iseq, ret, node, popped));
10967 CHECK(compile_yield(iseq, ret, node, popped));
10971 compile_lvar(iseq, ret, node, RNODE_LVAR(node)->nd_vid);
10977 debugi(
"nd_vid", RNODE_DVAR(node)->nd_vid);
10979 idx = get_dyna_var_idx(iseq, RNODE_DVAR(node)->nd_vid, &lv, &ls);
10981 COMPILE_ERROR(ERROR_ARGS
"unknown dvar (%"PRIsVALUE
")",
10982 rb_id2str(RNODE_DVAR(node)->nd_vid));
10985 ADD_GETLOCAL(ret, node, ls - idx, lv);
10990 ADD_INSN1(ret, node, getglobal,
ID2SYM(RNODE_GVAR(node)->nd_vid));
10992 ADD_INSN(ret, node, pop);
10997 debugi(
"nd_vid", RNODE_IVAR(node)->nd_vid);
10999 ADD_INSN2(ret, node, getinstancevariable,
11000 ID2SYM(RNODE_IVAR(node)->nd_vid),
11001 get_ivar_ic_value(iseq, RNODE_IVAR(node)->nd_vid));
11006 debugi(
"nd_vid", RNODE_CONST(node)->nd_vid);
11008 if (ISEQ_COMPILE_DATA(iseq)->option->inline_const_cache) {
11010 VALUE segments = rb_ary_new_from_args(1,
ID2SYM(RNODE_CONST(node)->nd_vid));
11011 ADD_INSN1(ret, node, opt_getconstant_path, segments);
11015 ADD_INSN(ret, node, putnil);
11016 ADD_INSN1(ret, node, putobject,
Qtrue);
11017 ADD_INSN1(ret, node, getconstant,
ID2SYM(RNODE_CONST(node)->nd_vid));
11021 ADD_INSN(ret, node, pop);
11027 ADD_INSN2(ret, node, getclassvariable,
11028 ID2SYM(RNODE_CVAR(node)->nd_vid),
11029 get_cvar_ic_value(iseq, RNODE_CVAR(node)->nd_vid));
11033 case NODE_NTH_REF:{
11035 if (!RNODE_NTH_REF(node)->nd_nth) {
11036 ADD_INSN(ret, node, putnil);
11039 ADD_INSN2(ret, node, getspecial,
INT2FIX(1) ,
11040 INT2FIX(RNODE_NTH_REF(node)->nd_nth << 1));
11044 case NODE_BACK_REF:{
11046 ADD_INSN2(ret, node, getspecial,
INT2FIX(1) ,
11047 INT2FIX(0x01 | (RNODE_BACK_REF(node)->nd_nth << 1)));
11054 CHECK(compile_match(iseq, ret, node, popped,
type));
11058 ADD_INSN1(ret, node, putobject, rb_node_sym_string_val(node));
11064 ADD_INSN1(ret, node, putobject, rb_node_line_lineno_val(node));
11068 case NODE_ENCODING:{
11070 ADD_INSN1(ret, node, putobject, rb_node_encoding_val(node));
11074 case NODE_INTEGER:{
11075 VALUE lit = rb_node_integer_literal_val(node);
11076 debugp_param(
"integer", lit);
11078 ADD_INSN1(ret, node, putobject, lit);
11084 VALUE lit = rb_node_float_literal_val(node);
11085 debugp_param(
"float", lit);
11087 ADD_INSN1(ret, node, putobject, lit);
11092 case NODE_RATIONAL:{
11093 VALUE lit = rb_node_rational_literal_val(node);
11094 debugp_param(
"rational", lit);
11096 ADD_INSN1(ret, node, putobject, lit);
11101 case NODE_IMAGINARY:{
11102 VALUE lit = rb_node_imaginary_literal_val(node);
11103 debugp_param(
"imaginary", lit);
11105 ADD_INSN1(ret, node, putobject, lit);
11112 debugp_param(
"nd_lit", get_string_value(node));
11114 VALUE lit = get_string_value(node);
11117 option->frozen_string_literal != ISEQ_FROZEN_STRING_LITERAL_DISABLED) {
11118 lit = rb_str_with_debug_created_info(lit, rb_iseq_path(iseq), line);
11120 switch (option->frozen_string_literal) {
11121 case ISEQ_FROZEN_STRING_LITERAL_UNSET:
11122 ADD_INSN1(ret, node, putchilledstring, lit);
11124 case ISEQ_FROZEN_STRING_LITERAL_DISABLED:
11125 ADD_INSN1(ret, node, putstring, lit);
11127 case ISEQ_FROZEN_STRING_LITERAL_ENABLED:
11128 ADD_INSN1(ret, node, putobject, lit);
11131 rb_bug(
"invalid frozen_string_literal");
11138 compile_dstr(iseq, ret, node);
11141 ADD_INSN(ret, node, pop);
11146 ADD_CALL_RECEIVER(ret, node);
11147 VALUE str = rb_node_str_string_val(node);
11148 ADD_INSN1(ret, node, putobject, str);
11150 ADD_CALL(ret, node, idBackquote,
INT2FIX(1));
11153 ADD_INSN(ret, node, pop);
11158 ADD_CALL_RECEIVER(ret, node);
11159 compile_dstr(iseq, ret, node);
11160 ADD_CALL(ret, node, idBackquote,
INT2FIX(1));
11163 ADD_INSN(ret, node, pop);
11168 CHECK(compile_evstr(iseq, ret, RNODE_EVSTR(node)->nd_body, popped));
11172 VALUE lit = rb_node_regx_string_val(node);
11173 ADD_INSN1(ret, node, putobject, lit);
11179 compile_dregx(iseq, ret, node, popped);
11182 int ic_index = body->ise_size++;
11184 block_iseq = NEW_CHILD_ISEQ(RNODE_ONCE(node)->nd_body, make_name_for_block(iseq), ISEQ_TYPE_PLAIN, line);
11186 ADD_INSN2(ret, node, once, block_iseq,
INT2FIX(ic_index));
11190 ADD_INSN(ret, node, pop);
11194 case NODE_ARGSCAT:{
11196 CHECK(COMPILE(ret,
"argscat head", RNODE_ARGSCAT(node)->nd_head));
11197 ADD_INSN1(ret, node, splatarray,
Qfalse);
11198 ADD_INSN(ret, node, pop);
11199 CHECK(COMPILE(ret,
"argscat body", RNODE_ARGSCAT(node)->nd_body));
11200 ADD_INSN1(ret, node, splatarray,
Qfalse);
11201 ADD_INSN(ret, node, pop);
11204 CHECK(COMPILE(ret,
"argscat head", RNODE_ARGSCAT(node)->nd_head));
11205 const NODE *body_node = RNODE_ARGSCAT(node)->nd_body;
11206 if (nd_type_p(body_node, NODE_LIST)) {
11207 CHECK(compile_array(iseq, ret, body_node, popped, FALSE) >= 0);
11210 CHECK(COMPILE(ret,
"argscat body", body_node));
11211 ADD_INSN(ret, node, concattoarray);
11216 case NODE_ARGSPUSH:{
11218 CHECK(COMPILE(ret,
"argspush head", RNODE_ARGSPUSH(node)->nd_head));
11219 ADD_INSN1(ret, node, splatarray,
Qfalse);
11220 ADD_INSN(ret, node, pop);
11221 CHECK(COMPILE_(ret,
"argspush body", RNODE_ARGSPUSH(node)->nd_body, popped));
11224 CHECK(COMPILE(ret,
"argspush head", RNODE_ARGSPUSH(node)->nd_head));
11225 const NODE *body_node = RNODE_ARGSPUSH(node)->nd_body;
11226 if (keyword_node_p(body_node)) {
11227 CHECK(COMPILE_(ret,
"array element", body_node, FALSE));
11228 ADD_INSN(ret, node, pushtoarraykwsplat);
11230 else if (static_literal_node_p(body_node, iseq,
false)) {
11231 ADD_INSN1(ret, body_node, putobject, static_literal_value(body_node, iseq));
11232 ADD_INSN1(ret, node, pushtoarray,
INT2FIX(1));
11235 CHECK(COMPILE_(ret,
"array element", body_node, FALSE));
11236 ADD_INSN1(ret, node, pushtoarray,
INT2FIX(1));
11242 CHECK(COMPILE(ret,
"splat", RNODE_SPLAT(node)->nd_head));
11243 ADD_INSN1(ret, node, splatarray,
Qtrue);
11246 ADD_INSN(ret, node, pop);
11251 ID mid = RNODE_DEFN(node)->nd_mid;
11252 const rb_iseq_t *method_iseq = NEW_ISEQ(RNODE_DEFN(node)->nd_defn,
11254 ISEQ_TYPE_METHOD, line);
11256 debugp_param(
"defn/iseq", rb_iseqw_new(method_iseq));
11257 ADD_INSN2(ret, node, definemethod,
ID2SYM(mid), method_iseq);
11261 ADD_INSN1(ret, node, putobject,
ID2SYM(mid));
11267 ID mid = RNODE_DEFS(node)->nd_mid;
11268 const rb_iseq_t * singleton_method_iseq = NEW_ISEQ(RNODE_DEFS(node)->nd_defn,
11270 ISEQ_TYPE_METHOD, line);
11272 debugp_param(
"defs/iseq", rb_iseqw_new(singleton_method_iseq));
11273 CHECK(COMPILE(ret,
"defs: recv", RNODE_DEFS(node)->nd_recv));
11274 ADD_INSN2(ret, node, definesmethod,
ID2SYM(mid), singleton_method_iseq);
11278 ADD_INSN1(ret, node, putobject,
ID2SYM(mid));
11283 ADD_INSN1(ret, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
11284 ADD_INSN1(ret, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_CBASE));
11285 CHECK(COMPILE(ret,
"alias arg1", RNODE_ALIAS(node)->nd_1st));
11286 CHECK(COMPILE(ret,
"alias arg2", RNODE_ALIAS(node)->nd_2nd));
11287 ADD_SEND(ret, node, id_core_set_method_alias,
INT2FIX(3));
11290 ADD_INSN(ret, node, pop);
11295 ADD_INSN1(ret, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
11296 ADD_INSN1(ret, node, putobject,
ID2SYM(RNODE_VALIAS(node)->nd_alias));
11297 ADD_INSN1(ret, node, putobject,
ID2SYM(RNODE_VALIAS(node)->nd_orig));
11298 ADD_SEND(ret, node, id_core_set_variable_alias,
INT2FIX(2));
11301 ADD_INSN(ret, node, pop);
11308 for (
long i = 0; i < ary->len; i++) {
11309 ADD_INSN1(ret, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
11310 ADD_INSN1(ret, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_CBASE));
11311 CHECK(COMPILE(ret,
"undef arg", ary->data[i]));
11312 ADD_SEND(ret, node, id_core_undef_method,
INT2FIX(2));
11314 if (i < ary->
len - 1) {
11315 ADD_INSN(ret, node, pop);
11320 ADD_INSN(ret, node, pop);
11325 const rb_iseq_t *class_iseq = NEW_CHILD_ISEQ(RNODE_CLASS(node)->nd_body,
11326 rb_str_freeze(rb_sprintf(
"<class:%"PRIsVALUE
">", rb_id2str(get_node_colon_nd_mid(RNODE_CLASS(node)->nd_cpath)))),
11327 ISEQ_TYPE_CLASS, line);
11328 const int flags = VM_DEFINECLASS_TYPE_CLASS |
11329 (RNODE_CLASS(node)->nd_super ? VM_DEFINECLASS_FLAG_HAS_SUPERCLASS : 0) |
11330 compile_cpath(ret, iseq, RNODE_CLASS(node)->nd_cpath);
11332 CHECK(COMPILE(ret,
"super", RNODE_CLASS(node)->nd_super));
11333 ADD_INSN3(ret, node, defineclass,
ID2SYM(get_node_colon_nd_mid(RNODE_CLASS(node)->nd_cpath)), class_iseq,
INT2FIX(flags));
11337 ADD_INSN(ret, node, pop);
11342 const rb_iseq_t *module_iseq = NEW_CHILD_ISEQ(RNODE_MODULE(node)->nd_body,
11343 rb_str_freeze(rb_sprintf(
"<module:%"PRIsVALUE
">", rb_id2str(get_node_colon_nd_mid(RNODE_MODULE(node)->nd_cpath)))),
11344 ISEQ_TYPE_CLASS, line);
11345 const int flags = VM_DEFINECLASS_TYPE_MODULE |
11346 compile_cpath(ret, iseq, RNODE_MODULE(node)->nd_cpath);
11348 ADD_INSN (ret, node, putnil);
11349 ADD_INSN3(ret, node, defineclass,
ID2SYM(get_node_colon_nd_mid(RNODE_MODULE(node)->nd_cpath)), module_iseq,
INT2FIX(flags));
11353 ADD_INSN(ret, node, pop);
11359 const rb_iseq_t *singleton_class = NEW_ISEQ(RNODE_SCLASS(node)->nd_body, rb_fstring_lit(
"singleton class"),
11360 ISEQ_TYPE_CLASS, line);
11362 CHECK(COMPILE(ret,
"sclass#recv", RNODE_SCLASS(node)->nd_recv));
11363 ADD_INSN (ret, node, putnil);
11364 CONST_ID(singletonclass,
"singletonclass");
11365 ADD_INSN3(ret, node, defineclass,
11366 ID2SYM(singletonclass), singleton_class,
11367 INT2FIX(VM_DEFINECLASS_TYPE_SINGLETON_CLASS));
11371 ADD_INSN(ret, node, pop);
11376 CHECK(compile_colon2(iseq, ret, node, popped));
11379 CHECK(compile_colon3(iseq, ret, node, popped));
11382 CHECK(compile_dots(iseq, ret, node, popped, FALSE));
11385 CHECK(compile_dots(iseq, ret, node, popped, TRUE));
11389 LABEL *lend = NEW_LABEL(line);
11390 LABEL *ltrue = NEW_LABEL(line);
11391 LABEL *lfalse = NEW_LABEL(line);
11392 CHECK(compile_flip_flop(iseq, ret, node,
type == NODE_FLIP2,
11394 ADD_LABEL(ret, ltrue);
11395 ADD_INSN1(ret, node, putobject,
Qtrue);
11396 ADD_INSNL(ret, node, jump, lend);
11397 ADD_LABEL(ret, lfalse);
11398 ADD_INSN1(ret, node, putobject,
Qfalse);
11399 ADD_LABEL(ret, lend);
11404 ADD_INSN(ret, node, putself);
11410 ADD_INSN(ret, node, putnil);
11416 ADD_INSN1(ret, node, putobject,
Qtrue);
11422 ADD_INSN1(ret, node, putobject,
Qfalse);
11427 CHECK(compile_errinfo(iseq, ret, node, popped));
11431 CHECK(compile_defined_expr(iseq, ret, node,
Qtrue,
false));
11434 case NODE_POSTEXE:{
11438 int is_index = body->ise_size++;
11440 rb_iseq_new_with_callback_new_callback(build_postexe_iseq, RNODE_POSTEXE(node)->nd_body);
11442 NEW_CHILD_ISEQ_WITH_CALLBACK(ifunc, rb_fstring(make_name_for_block(iseq)), ISEQ_TYPE_BLOCK, line);
11444 ADD_INSN2(ret, node, once, once_iseq,
INT2FIX(is_index));
11448 ADD_INSN(ret, node, pop);
11453 CHECK(compile_kw_arg(iseq, ret, node, popped));
11456 compile_dstr(iseq, ret, node);
11458 ADD_INSN(ret, node, intern);
11461 ADD_INSN(ret, node, pop);
11465 case NODE_ATTRASGN:
11466 CHECK(compile_attrasgn(iseq, ret, node, popped));
11470 const rb_iseq_t *block = NEW_CHILD_ISEQ(RNODE_LAMBDA(node)->nd_body, make_name_for_block(iseq), ISEQ_TYPE_BLOCK, line);
11473 ADD_INSN1(ret, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
11474 ADD_CALL_WITH_BLOCK(ret, node, idLambda, argc, block);
11478 ADD_INSN(ret, node, pop);
11483 UNKNOWN_NODE(
"iseq_compile_each", node, COMPILE_NG);
11498insn_data_length(
INSN *iobj)
11500 return insn_len(iobj->insn_id);
11504calc_sp_depth(
int depth,
INSN *insn)
11506 return comptime_insn_stack_increase(depth, insn->insn_id, insn->operands);
11510opobj_inspect(
VALUE obj)
11530insn_data_to_s_detail(
INSN *iobj)
11532 VALUE str = rb_sprintf(
"%-20s ", insn_name(iobj->insn_id));
11534 if (iobj->operands) {
11535 const char *types = insn_op_types(iobj->insn_id);
11538 for (j = 0; types[j]; j++) {
11539 char type = types[j];
11545 rb_str_catf(str, LABEL_FORMAT, lobj->label_no);
11563 VALUE v = OPERAND_AT(iobj, j);
11578 rb_str_catf(str,
"<ivc:%d>",
FIX2INT(OPERAND_AT(iobj, j)));
11581 rb_str_catf(str,
"<icvarc:%d>",
FIX2INT(OPERAND_AT(iobj, j)));
11584 rb_str_catf(str,
"<ise:%d>",
FIX2INT(OPERAND_AT(iobj, j)));
11590 if (vm_ci_mid(ci)) rb_str_catf(str,
"%"PRIsVALUE, rb_id2str(vm_ci_mid(ci)));
11591 rb_str_catf(str,
", %d>", vm_ci_argc(ci));
11599 void *func = (
void *)OPERAND_AT(iobj, j);
11602 if (dladdr(func, &info) && info.dli_sname) {
11607 rb_str_catf(str,
"<%p>", func);
11617 if (types[j + 1]) {
11628 dump_disasm_list_with_cursor(link, NULL, NULL);
11639 printf(
"-- raw disasm--------\n");
11642 if (curr) printf(curr == link ?
"*" :
" ");
11643 switch (link->type) {
11644 case ISEQ_ELEMENT_INSN:
11646 iobj = (
INSN *)link;
11647 str = insn_data_to_s_detail(iobj);
11648 printf(
" %04d %-65s(%4u)\n", pos,
StringValueCStr(str), iobj->insn_info.line_no);
11649 pos += insn_data_length(iobj);
11652 case ISEQ_ELEMENT_LABEL:
11654 lobj = (
LABEL *)link;
11655 printf(LABEL_FORMAT
" [sp: %d, unremovable: %d, refcnt: %d]%s\n", lobj->label_no, lobj->sp, lobj->unremovable, lobj->refcnt,
11656 dest == lobj ?
" <---" :
"");
11659 case ISEQ_ELEMENT_TRACE:
11662 printf(
" trace: %0x\n", trace->event);
11665 case ISEQ_ELEMENT_ADJUST:
11668 printf(
" adjust: [label: %d]\n", adjust->label ? adjust->label->label_no : -1);
11673 rb_raise(
rb_eSyntaxError,
"dump_disasm_list error: %d\n", (
int)link->type);
11677 printf(
"---------------------\n");
11682rb_insn_len(
VALUE insn)
11684 return insn_len(insn);
11688rb_insns_name(
int i)
11690 return insn_name(i);
11694rb_insns_name_array(
void)
11698 for (i = 0; i < VM_INSTRUCTION_SIZE; i++) {
11709 obj = rb_to_symbol_type(obj);
11711 if (st_lookup(labels_table, obj, &tmp) == 0) {
11712 label = NEW_LABEL(0);
11713 st_insert(labels_table, obj, (st_data_t)label);
11716 label = (
LABEL *)tmp;
11723get_exception_sym2type(
VALUE sym)
11725 static VALUE symRescue, symEnsure, symRetry;
11726 static VALUE symBreak, symRedo, symNext;
11728 if (symRescue == 0) {
11737 if (sym == symRescue)
return CATCH_TYPE_RESCUE;
11738 if (sym == symEnsure)
return CATCH_TYPE_ENSURE;
11739 if (sym == symRetry)
return CATCH_TYPE_RETRY;
11740 if (sym == symBreak)
return CATCH_TYPE_BREAK;
11741 if (sym == symRedo)
return CATCH_TYPE_REDO;
11742 if (sym == symNext)
return CATCH_TYPE_NEXT;
11743 rb_raise(
rb_eSyntaxError,
"invalid exception symbol: %+"PRIsVALUE, sym);
11756 LABEL *lstart, *lend, *lcont;
11771 lstart = register_label(iseq, labels_table,
RARRAY_AREF(v, 2));
11772 lend = register_label(iseq, labels_table,
RARRAY_AREF(v, 3));
11773 lcont = register_label(iseq, labels_table,
RARRAY_AREF(v, 4));
11777 if (
type == CATCH_TYPE_RESCUE ||
11778 type == CATCH_TYPE_BREAK ||
11779 type == CATCH_TYPE_NEXT) {
11785 ADD_CATCH_ENTRY(
type, lstart, lend, eiseq, lcont);
11793insn_make_insn_table(
void)
11797 table = st_init_numtable_with_size(VM_INSTRUCTION_SIZE);
11799 for (i=0; i<VM_INSTRUCTION_SIZE; i++) {
11813 iseqw = rb_iseq_load(op, (
VALUE)iseq,
Qnil);
11815 else if (
CLASS_OF(op) == rb_cISeq) {
11822 loaded_iseq = rb_iseqw_to_iseq(iseqw);
11823 return loaded_iseq;
11831 unsigned int flag = 0;
11842 if (!
NIL_P(vorig_argc)) orig_argc =
FIX2INT(vorig_argc);
11844 if (!
NIL_P(vkw_arg)) {
11847 size_t n = rb_callinfo_kwarg_bytes(
len);
11850 kw_arg->references = 0;
11851 kw_arg->keyword_len =
len;
11852 for (i = 0; i <
len; i++) {
11855 kw_arg->keywords[i] = kw;
11860 const struct rb_callinfo *ci = new_callinfo(iseq, mid, orig_argc, flag, kw_arg, (flag & VM_CALL_ARGS_SIMPLE) == 0);
11866event_name_to_flag(
VALUE sym)
11868#define CHECK_EVENT(ev) if (sym == ID2SYM(rb_intern_const(#ev))) return ev;
11889 int line_no = 0, node_id = -1, insn_idx = 0;
11890 int ret = COMPILE_OK;
11895 static struct st_table *insn_table;
11897 if (insn_table == 0) {
11898 insn_table = insn_make_insn_table();
11901 for (i=0; i<
len; i++) {
11907 ADD_TRACE(anchor, event);
11910 LABEL *label = register_label(iseq, labels_table, obj);
11911 ADD_LABEL(anchor, label);
11928 if (st_lookup(insn_table, (st_data_t)insn, &insn_id) == 0) {
11930 COMPILE_ERROR(iseq, line_no,
11931 "unknown instruction: %+"PRIsVALUE, insn);
11936 if (argc != insn_len((
VALUE)insn_id)-1) {
11937 COMPILE_ERROR(iseq, line_no,
11938 "operand size mismatch");
11944 argv = compile_data_calloc2(iseq,
sizeof(
VALUE), argc);
11949 (
enum ruby_vminsn_type)insn_id, argc, argv));
11951 for (j=0; j<argc; j++) {
11953 switch (insn_op_type((
VALUE)insn_id, j)) {
11955 LABEL *label = register_label(iseq, labels_table, op);
11956 argv[j] = (
VALUE)label;
11971 VALUE v = (
VALUE)iseq_build_load_iseq(iseq, op);
11982 if (
NUM2UINT(op) >= ISEQ_BODY(iseq)->ise_size) {
11983 ISEQ_BODY(iseq)->ise_size =
NUM2INT(op) + 1;
11989 op = rb_to_array_type(op);
11993 sym = rb_to_symbol_type(sym);
11998 argv[j] = segments;
12000 ISEQ_BODY(iseq)->ic_size++;
12005 if (
NUM2UINT(op) >= ISEQ_BODY(iseq)->ivc_size) {
12006 ISEQ_BODY(iseq)->ivc_size =
NUM2INT(op) + 1;
12011 if (
NUM2UINT(op) >= ISEQ_BODY(iseq)->icvarc_size) {
12012 ISEQ_BODY(iseq)->icvarc_size =
NUM2INT(op) + 1;
12016 argv[j] = iseq_build_callinfo_from_hash(iseq, op);
12019 argv[j] = rb_to_symbol_type(op);
12026 RHASH_TBL_RAW(map)->type = &cdhash_type;
12027 op = rb_to_array_type(op);
12032 register_label(iseq, labels_table, sym);
12033 rb_hash_aset(map, key, (
VALUE)label | 1);
12042#if SIZEOF_VALUE <= SIZEOF_LONG
12047 argv[j] = (
VALUE)funcptr;
12058 (
enum ruby_vminsn_type)insn_id, argc, NULL));
12062 rb_raise(
rb_eTypeError,
"unexpected object for instruction");
12067 validate_labels(iseq, labels_table);
12068 if (!ret)
return ret;
12069 return iseq_setup(iseq, anchor);
12072#define CHECK_ARRAY(v) rb_to_array_type(v)
12073#define CHECK_SYMBOL(v) rb_to_symbol_type(v)
12078 VALUE val = rb_hash_aref(param, sym);
12083 else if (!
NIL_P(val)) {
12084 rb_raise(
rb_eTypeError,
"invalid %+"PRIsVALUE
" Fixnum: %+"PRIsVALUE,
12090static const struct rb_iseq_param_keyword *
12096 VALUE key, sym, default_val;
12099 struct rb_iseq_param_keyword *keyword =
ZALLOC(
struct rb_iseq_param_keyword);
12101 ISEQ_BODY(iseq)->param.flags.has_kw = TRUE;
12103 keyword->num =
len;
12104#define SYM(s) ID2SYM(rb_intern_const(#s))
12105 (void)int_param(&keyword->bits_start, params, SYM(kwbits));
12106 i = keyword->bits_start - keyword->num;
12107 ids = (
ID *)&ISEQ_BODY(iseq)->local_table[i];
12111 for (i = 0; i <
len; i++) {
12115 goto default_values;
12118 keyword->required_num++;
12122 default_len =
len - i;
12123 if (default_len == 0) {
12124 keyword->table = ids;
12127 else if (default_len < 0) {
12133 for (j = 0; i <
len; i++, j++) {
12147 rb_raise(
rb_eTypeError,
"keyword default has unsupported len %+"PRIsVALUE, key);
12153 keyword->table = ids;
12154 keyword->default_values = dvs;
12160iseq_insn_each_object_mark_and_move(
VALUE * obj,
VALUE _)
12162 rb_gc_mark_and_move(obj);
12169 size_t size =
sizeof(
INSN);
12170 unsigned int pos = 0;
12173#ifdef STRICT_ALIGNMENT
12174 size_t padding = calc_padding((
void *)&storage->buff[pos], size);
12176 const size_t padding = 0;
12178 size_t offset = pos + size + padding;
12179 if (offset > storage->size || offset > storage->pos) {
12181 storage = storage->next;
12184#ifdef STRICT_ALIGNMENT
12185 pos += (int)padding;
12188 iobj = (
INSN *)&storage->buff[pos];
12190 if (iobj->operands) {
12191 iseq_insn_each_markable_object(iobj, iseq_insn_each_object_mark_and_move, (
VALUE)0);
12204 .flags = RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
12211#define SYM(s) ID2SYM(rb_intern_const(#s))
12213 unsigned int arg_size, local_size, stack_max;
12215 struct st_table *labels_table = st_init_numtable();
12217 VALUE arg_opt_labels = rb_hash_aref(params, SYM(opt));
12218 VALUE keywords = rb_hash_aref(params, SYM(keyword));
12220 DECL_ANCHOR(anchor);
12221 INIT_ANCHOR(anchor);
12224 ISEQ_BODY(iseq)->local_table_size =
len;
12225 ISEQ_BODY(iseq)->local_table = tbl =
len > 0 ? (
ID *)
ALLOC_N(
ID, ISEQ_BODY(iseq)->local_table_size) : NULL;
12227 for (i = 0; i <
len; i++) {
12230 if (sym_arg_rest == lv) {
12238#define INT_PARAM(F) int_param(&ISEQ_BODY(iseq)->param.F, params, SYM(F))
12239 if (INT_PARAM(lead_num)) {
12240 ISEQ_BODY(iseq)->param.flags.has_lead = TRUE;
12242 if (INT_PARAM(post_num)) ISEQ_BODY(iseq)->param.flags.has_post = TRUE;
12243 if (INT_PARAM(post_start)) ISEQ_BODY(iseq)->param.flags.has_post = TRUE;
12244 if (INT_PARAM(rest_start)) ISEQ_BODY(iseq)->param.flags.has_rest = TRUE;
12245 if (INT_PARAM(block_start)) ISEQ_BODY(iseq)->param.flags.has_block = TRUE;
12248#define INT_PARAM(F) F = (int_param(&x, misc, SYM(F)) ? (unsigned int)x : 0)
12250 INT_PARAM(arg_size);
12251 INT_PARAM(local_size);
12252 INT_PARAM(stack_max);
12257#ifdef USE_ISEQ_NODE_ID
12258 node_ids = rb_hash_aref(misc,
ID2SYM(rb_intern(
"node_ids")));
12266 ISEQ_BODY(iseq)->param.flags.has_opt = !!(
len - 1 >= 0);
12268 if (ISEQ_BODY(iseq)->param.flags.has_opt) {
12271 for (i = 0; i <
len; i++) {
12273 LABEL *label = register_label(iseq, labels_table, ent);
12274 opt_table[i] = (
VALUE)label;
12277 ISEQ_BODY(iseq)->param.opt_num =
len - 1;
12278 ISEQ_BODY(iseq)->param.opt_table = opt_table;
12281 else if (!
NIL_P(arg_opt_labels)) {
12282 rb_raise(
rb_eTypeError,
":opt param is not an array: %+"PRIsVALUE,
12287 ISEQ_BODY(iseq)->param.keyword = iseq_build_kw(iseq, params, keywords);
12289 else if (!
NIL_P(keywords)) {
12290 rb_raise(
rb_eTypeError,
":keywords param is not an array: %+"PRIsVALUE,
12294 if (
Qtrue == rb_hash_aref(params, SYM(ambiguous_param0))) {
12295 ISEQ_BODY(iseq)->param.flags.ambiguous_param0 = TRUE;
12298 if (
Qtrue == rb_hash_aref(params, SYM(use_block))) {
12299 ISEQ_BODY(iseq)->param.flags.use_block = TRUE;
12302 if (int_param(&i, params, SYM(kwrest))) {
12303 struct rb_iseq_param_keyword *keyword = (
struct rb_iseq_param_keyword *)ISEQ_BODY(iseq)->param.keyword;
12304 if (keyword == NULL) {
12305 ISEQ_BODY(iseq)->param.keyword = keyword =
ZALLOC(
struct rb_iseq_param_keyword);
12307 keyword->rest_start = i;
12308 ISEQ_BODY(iseq)->param.flags.has_kwrest = TRUE;
12311 iseq_calc_param_size(iseq);
12314 iseq_build_from_ary_exception(iseq, labels_table, exception);
12317 iseq_build_from_ary_body(iseq, anchor, body, node_ids, labels_wrapper);
12319 ISEQ_BODY(iseq)->param.size = arg_size;
12320 ISEQ_BODY(iseq)->local_table_size = local_size;
12321 ISEQ_BODY(iseq)->stack_max = stack_max;
12331 while (body->type == ISEQ_TYPE_BLOCK ||
12332 body->type == ISEQ_TYPE_RESCUE ||
12333 body->type == ISEQ_TYPE_ENSURE ||
12334 body->type == ISEQ_TYPE_EVAL ||
12335 body->type == ISEQ_TYPE_MAIN
12339 for (i = 0; i < body->local_table_size; i++) {
12340 if (body->local_table[i] ==
id) {
12344 iseq = body->parent_iseq;
12345 body = ISEQ_BODY(iseq);
12358 for (i=0; i<body->local_table_size; i++) {
12359 if (body->local_table[i] ==
id) {
12369#ifndef IBF_ISEQ_DEBUG
12370#define IBF_ISEQ_DEBUG 0
12373#ifndef IBF_ISEQ_ENABLE_LOCAL_BUFFER
12374#define IBF_ISEQ_ENABLE_LOCAL_BUFFER 0
12377typedef uint32_t ibf_offset_t;
12378#define IBF_OFFSET(ptr) ((ibf_offset_t)(VALUE)(ptr))
12380#define IBF_MAJOR_VERSION ISEQ_MAJOR_VERSION
12382#define IBF_DEVEL_VERSION 4
12383#define IBF_MINOR_VERSION (ISEQ_MINOR_VERSION * 10000 + IBF_DEVEL_VERSION)
12385#define IBF_MINOR_VERSION ISEQ_MINOR_VERSION
12388static const char IBF_ENDIAN_MARK =
12389#ifdef WORDS_BIGENDIAN
12398 uint32_t major_version;
12399 uint32_t minor_version;
12401 uint32_t extra_size;
12403 uint32_t iseq_list_size;
12404 uint32_t global_object_list_size;
12405 ibf_offset_t iseq_list_offset;
12406 ibf_offset_t global_object_list_offset;
12427 unsigned int obj_list_size;
12428 ibf_offset_t obj_list_offset;
12447pinned_list_mark(
void *ptr)
12451 for (i = 0; i < list->size; i++) {
12452 if (list->buffer[i]) {
12453 rb_gc_mark(list->buffer[i]);
12465 0, 0, RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_EMBEDDABLE
12469pinned_list_fetch(
VALUE list,
long offset)
12475 if (offset >= ptr->size) {
12476 rb_raise(
rb_eIndexError,
"object index out of range: %ld", offset);
12479 return ptr->buffer[offset];
12483pinned_list_store(
VALUE list,
long offset,
VALUE object)
12489 if (offset >= ptr->size) {
12490 rb_raise(
rb_eIndexError,
"object index out of range: %ld", offset);
12497pinned_list_new(
long size)
12499 size_t memsize = offsetof(
struct pinned_list, buffer) + size *
sizeof(
VALUE);
12500 VALUE obj_list = rb_data_typed_object_zalloc(0, memsize, &pinned_list_type);
12501 struct pinned_list * ptr = RTYPEDDATA_GET_DATA(obj_list);
12507ibf_dump_pos(
struct ibf_dump *dump)
12509 long pos = RSTRING_LEN(dump->current_buffer->str);
12510#if SIZEOF_LONG > SIZEOF_INT
12511 if (pos >= UINT_MAX) {
12515 return (
unsigned int)pos;
12519ibf_dump_align(
struct ibf_dump *dump,
size_t align)
12521 ibf_offset_t pos = ibf_dump_pos(dump);
12523 static const char padding[
sizeof(
VALUE)];
12524 size_t size = align - ((size_t)pos % align);
12525#if SIZEOF_LONG > SIZEOF_INT
12526 if (pos + size >= UINT_MAX) {
12530 for (; size >
sizeof(padding); size -=
sizeof(padding)) {
12531 rb_str_cat(dump->current_buffer->str, padding,
sizeof(padding));
12533 rb_str_cat(dump->current_buffer->str, padding, size);
12538ibf_dump_write(
struct ibf_dump *dump,
const void *buff,
unsigned long size)
12540 ibf_offset_t pos = ibf_dump_pos(dump);
12541#if SIZEOF_LONG > SIZEOF_INT
12543 if (size >= UINT_MAX || pos + size >= UINT_MAX) {
12547 rb_str_cat(dump->current_buffer->str, (
const char *)buff, size);
12552ibf_dump_write_byte(
struct ibf_dump *dump,
unsigned char byte)
12554 return ibf_dump_write(dump, &
byte,
sizeof(
unsigned char));
12558ibf_dump_overwrite(
struct ibf_dump *dump,
void *buff,
unsigned int size,
long offset)
12560 VALUE str = dump->current_buffer->str;
12561 char *ptr = RSTRING_PTR(str);
12562 if ((
unsigned long)(size + offset) > (
unsigned long)RSTRING_LEN(str))
12563 rb_bug(
"ibf_dump_overwrite: overflow");
12564 memcpy(ptr + offset, buff, size);
12568ibf_load_ptr(
const struct ibf_load *load, ibf_offset_t *offset,
int size)
12570 ibf_offset_t beg = *offset;
12572 return load->current_buffer->buff + beg;
12576ibf_load_alloc(
const struct ibf_load *load, ibf_offset_t offset,
size_t x,
size_t y)
12578 void *buff = ruby_xmalloc2(x, y);
12579 size_t size = x * y;
12580 memcpy(buff, load->current_buffer->buff + offset, size);
12584#define IBF_W_ALIGN(type) (RUBY_ALIGNOF(type) > 1 ? ibf_dump_align(dump, RUBY_ALIGNOF(type)) : (void)0)
12586#define IBF_W(b, type, n) (IBF_W_ALIGN(type), (type *)(VALUE)IBF_WP(b, type, n))
12587#define IBF_WV(variable) ibf_dump_write(dump, &(variable), sizeof(variable))
12588#define IBF_WP(b, type, n) ibf_dump_write(dump, (b), sizeof(type) * (n))
12589#define IBF_R(val, type, n) (type *)ibf_load_alloc(load, IBF_OFFSET(val), sizeof(type), (n))
12590#define IBF_ZERO(variable) memset(&(variable), 0, sizeof(variable))
12593ibf_table_lookup(
struct st_table *table, st_data_t key)
12597 if (st_lookup(table, key, &val)) {
12606ibf_table_find_or_insert(
struct st_table *table, st_data_t key)
12608 int index = ibf_table_lookup(table, key);
12611 index = (int)table->num_entries;
12612 st_insert(table, key, (st_data_t)index);
12620static void ibf_dump_object_list(
struct ibf_dump *dump, ibf_offset_t *obj_list_offset,
unsigned int *obj_list_size);
12626ibf_dump_object_table_new(
void)
12628 st_table *obj_table = st_init_numtable();
12629 st_insert(obj_table, (st_data_t)
Qnil, (st_data_t)0);
12637 return ibf_table_find_or_insert(dump->current_buffer->obj_table, (st_data_t)obj);
12643 if (
id == 0 || rb_id2name(
id) == NULL) {
12646 return ibf_dump_object(dump,
rb_id2sym(
id));
12650ibf_load_id(
const struct ibf_load *load,
const ID id_index)
12652 if (id_index == 0) {
12655 VALUE sym = ibf_load_object(load, id_index);
12665static ibf_offset_t ibf_dump_iseq_each(
struct ibf_dump *dump,
const rb_iseq_t *iseq);
12670 if (iseq == NULL) {
12674 return ibf_table_find_or_insert(dump->iseq_table, (st_data_t)iseq);
12678static unsigned char
12679ibf_load_byte(
const struct ibf_load *load, ibf_offset_t *offset)
12681 if (*offset >= load->current_buffer->size) { rb_raise(
rb_eRuntimeError,
"invalid bytecode"); }
12682 return (
unsigned char)load->current_buffer->buff[(*offset)++];
12698 if (
sizeof(
VALUE) > 8 || CHAR_BIT != 8) {
12699 ibf_dump_write(dump, &x,
sizeof(
VALUE));
12703 enum { max_byte_length =
sizeof(
VALUE) + 1 };
12705 unsigned char bytes[max_byte_length];
12708 for (n = 0; n <
sizeof(
VALUE) && (x >> (7 - n)); n++, x >>= 8) {
12709 bytes[max_byte_length - 1 - n] = (
unsigned char)x;
12715 bytes[max_byte_length - 1 - n] = (
unsigned char)x;
12718 ibf_dump_write(dump, bytes + max_byte_length - n, n);
12722ibf_load_small_value(
const struct ibf_load *load, ibf_offset_t *offset)
12724 if (
sizeof(
VALUE) > 8 || CHAR_BIT != 8) {
12725 union {
char s[
sizeof(
VALUE)];
VALUE v; } x;
12727 memcpy(x.s, load->current_buffer->buff + *offset,
sizeof(
VALUE));
12728 *offset +=
sizeof(
VALUE);
12733 enum { max_byte_length =
sizeof(
VALUE) + 1 };
12735 const unsigned char *buffer = (
const unsigned char *)load->current_buffer->buff;
12736 const unsigned char c = buffer[*offset];
12740 c == 0 ? 9 : ntz_int32(c) + 1;
12743 if (*offset + n > load->current_buffer->size) {
12748 for (i = 1; i < n; i++) {
12750 x |= (
VALUE)buffer[*offset + i];
12764 ibf_dump_write_small_value(dump, (
VALUE)bf->index);
12766 size_t len = strlen(bf->name);
12767 ibf_dump_write_small_value(dump, (
VALUE)
len);
12768 ibf_dump_write(dump, bf->name,
len);
12772ibf_load_builtin(
const struct ibf_load *load, ibf_offset_t *offset)
12774 int i = (int)ibf_load_small_value(load, offset);
12775 int len = (int)ibf_load_small_value(load, offset);
12776 const char *name = (
char *)ibf_load_ptr(load, offset,
len);
12779 fprintf(stderr,
"%.*s!!\n",
len, name);
12783 if (table == NULL) rb_raise(rb_eArgError,
"builtin function table is not provided");
12784 if (strncmp(table[i].name, name,
len) != 0) {
12785 rb_raise(rb_eArgError,
"builtin function index (%d) mismatch (expect %s but %s)", i, name, table[i].name);
12796 const int iseq_size = body->iseq_size;
12798 const VALUE *orig_code = rb_iseq_original_iseq(iseq);
12800 ibf_offset_t offset = ibf_dump_pos(dump);
12802 for (code_index=0; code_index<iseq_size;) {
12803 const VALUE insn = orig_code[code_index++];
12804 const char *types = insn_op_types(insn);
12809 ibf_dump_write_small_value(dump, insn);
12812 for (op_index=0; types[op_index]; op_index++, code_index++) {
12813 VALUE op = orig_code[code_index];
12816 switch (types[op_index]) {
12819 wv = ibf_dump_object(dump, op);
12828 wv = ibf_dump_object(dump, arr);
12836 wv = is - ISEQ_IS_ENTRY_START(body, types[op_index]);
12844 wv = ibf_dump_id(dump, (
ID)op);
12856 ibf_dump_write_small_value(dump, wv);
12866ibf_load_code(
const struct ibf_load *load,
rb_iseq_t *iseq, ibf_offset_t bytecode_offset, ibf_offset_t bytecode_size,
unsigned int iseq_size)
12869 unsigned int code_index;
12870 ibf_offset_t reading_pos = bytecode_offset;
12874 struct rb_call_data *cd_entries = load_body->call_data;
12877 iseq_bits_t * mark_offset_bits;
12879 iseq_bits_t tmp[1] = {0};
12881 if (ISEQ_MBITS_BUFLEN(iseq_size) == 1) {
12882 mark_offset_bits = tmp;
12885 mark_offset_bits =
ZALLOC_N(iseq_bits_t, ISEQ_MBITS_BUFLEN(iseq_size));
12887 bool needs_bitmap =
false;
12889 for (code_index=0; code_index<iseq_size;) {
12891 const VALUE insn = code[code_index] = ibf_load_small_value(load, &reading_pos);
12892 const char *types = insn_op_types(insn);
12898 for (op_index=0; types[op_index]; op_index++, code_index++) {
12899 const char operand_type = types[op_index];
12900 switch (operand_type) {
12903 VALUE op = ibf_load_small_value(load, &reading_pos);
12904 VALUE v = ibf_load_object(load, op);
12905 code[code_index] = v;
12908 ISEQ_MBITS_SET(mark_offset_bits, code_index);
12909 needs_bitmap =
true;
12915 VALUE op = ibf_load_small_value(load, &reading_pos);
12916 VALUE v = ibf_load_object(load, op);
12917 v = rb_hash_dup(v);
12918 RHASH_TBL_RAW(v)->type = &cdhash_type;
12920 freeze_hide_obj(v);
12925 pinned_list_store(load->current_buffer->obj_list, (
long)op, v);
12927 code[code_index] = v;
12928 ISEQ_MBITS_SET(mark_offset_bits, code_index);
12930 needs_bitmap =
true;
12935 VALUE op = (
VALUE)ibf_load_small_value(load, &reading_pos);
12937 code[code_index] = v;
12940 ISEQ_MBITS_SET(mark_offset_bits, code_index);
12941 needs_bitmap =
true;
12947 VALUE op = ibf_load_small_value(load, &reading_pos);
12948 VALUE arr = ibf_load_object(load, op);
12950 IC ic = &ISEQ_IS_IC_ENTRY(load_body, ic_index++);
12951 ic->
segments = array_to_idlist(arr);
12953 code[code_index] = (
VALUE)ic;
12960 unsigned int op = (
unsigned int)ibf_load_small_value(load, &reading_pos);
12962 ISE ic = ISEQ_IS_ENTRY_START(load_body, operand_type) + op;
12963 code[code_index] = (
VALUE)ic;
12965 if (operand_type == TS_IVC) {
12968 if (insn == BIN(setinstancevariable)) {
12969 ID iv_name = (
ID)code[code_index - 1];
12970 cache->iv_set_name = iv_name;
12973 cache->iv_set_name = 0;
12976 vm_ic_attr_index_initialize(cache, INVALID_SHAPE_ID);
12983 code[code_index] = (
VALUE)cd_entries++;
12988 VALUE op = ibf_load_small_value(load, &reading_pos);
12989 code[code_index] = ibf_load_id(load, (
ID)(
VALUE)op);
12996 code[code_index] = (
VALUE)ibf_load_builtin(load, &reading_pos);
12999 code[code_index] = ibf_load_small_value(load, &reading_pos);
13003 if (insn_len(insn) != op_index+1) {
13008 load_body->iseq_encoded = code;
13009 load_body->iseq_size = code_index;
13011 if (ISEQ_MBITS_BUFLEN(load_body->iseq_size) == 1) {
13012 load_body->mark_bits.single = mark_offset_bits[0];
13015 if (needs_bitmap) {
13016 load_body->mark_bits.list = mark_offset_bits;
13019 load_body->mark_bits.list = 0;
13020 ruby_xfree(mark_offset_bits);
13025 RUBY_ASSERT(reading_pos == bytecode_offset + bytecode_size);
13032 int opt_num = ISEQ_BODY(iseq)->param.opt_num;
13035 IBF_W_ALIGN(
VALUE);
13036 return ibf_dump_write(dump, ISEQ_BODY(iseq)->param.opt_table,
sizeof(
VALUE) * (opt_num + 1));
13039 return ibf_dump_pos(dump);
13044ibf_load_param_opt_table(
const struct ibf_load *load, ibf_offset_t opt_table_offset,
int opt_num)
13048 MEMCPY(table, load->current_buffer->buff + opt_table_offset,
VALUE, opt_num+1);
13059 const struct rb_iseq_param_keyword *kw = ISEQ_BODY(iseq)->param.keyword;
13062 struct rb_iseq_param_keyword dump_kw = *kw;
13063 int dv_num = kw->num - kw->required_num;
13068 for (i=0; i<kw->num; i++) ids[i] = (
ID)ibf_dump_id(dump, kw->table[i]);
13069 for (i=0; i<dv_num; i++) dvs[i] = (
VALUE)ibf_dump_object(dump, kw->default_values[i]);
13071 dump_kw.table = IBF_W(ids,
ID, kw->num);
13072 dump_kw.default_values = IBF_W(dvs,
VALUE, dv_num);
13073 IBF_W_ALIGN(
struct rb_iseq_param_keyword);
13074 return ibf_dump_write(dump, &dump_kw,
sizeof(
struct rb_iseq_param_keyword) * 1);
13081static const struct rb_iseq_param_keyword *
13082ibf_load_param_keyword(
const struct ibf_load *load, ibf_offset_t param_keyword_offset)
13084 if (param_keyword_offset) {
13085 struct rb_iseq_param_keyword *kw = IBF_R(param_keyword_offset,
struct rb_iseq_param_keyword, 1);
13086 int dv_num = kw->num - kw->required_num;
13087 VALUE *dvs = dv_num ? IBF_R(kw->default_values,
VALUE, dv_num) : NULL;
13090 for (i=0; i<dv_num; i++) {
13091 dvs[i] = ibf_load_object(load, dvs[i]);
13097 kw->default_values = dvs;
13108 ibf_offset_t offset = ibf_dump_pos(dump);
13112 for (i = 0; i < ISEQ_BODY(iseq)->insns_info.size; i++) {
13113 ibf_dump_write_small_value(dump, entries[i].line_no);
13114#ifdef USE_ISEQ_NODE_ID
13115 ibf_dump_write_small_value(dump, entries[i].node_id);
13117 ibf_dump_write_small_value(dump, entries[i].events);
13124ibf_load_insns_info_body(
const struct ibf_load *load, ibf_offset_t body_offset,
unsigned int size)
13126 ibf_offset_t reading_pos = body_offset;
13130 for (i = 0; i < size; i++) {
13131 entries[i].line_no = (int)ibf_load_small_value(load, &reading_pos);
13132#ifdef USE_ISEQ_NODE_ID
13133 entries[i].node_id = (int)ibf_load_small_value(load, &reading_pos);
13135 entries[i].events = (
rb_event_flag_t)ibf_load_small_value(load, &reading_pos);
13142ibf_dump_insns_info_positions(
struct ibf_dump *dump,
const unsigned int *positions,
unsigned int size)
13144 ibf_offset_t offset = ibf_dump_pos(dump);
13146 unsigned int last = 0;
13148 for (i = 0; i < size; i++) {
13149 ibf_dump_write_small_value(dump, positions[i] - last);
13150 last = positions[i];
13156static unsigned int *
13157ibf_load_insns_info_positions(
const struct ibf_load *load, ibf_offset_t positions_offset,
unsigned int size)
13159 ibf_offset_t reading_pos = positions_offset;
13160 unsigned int *positions =
ALLOC_N(
unsigned int, size);
13162 unsigned int last = 0;
13164 for (i = 0; i < size; i++) {
13165 positions[i] = last + (
unsigned int)ibf_load_small_value(load, &reading_pos);
13166 last = positions[i];
13176 const int size = body->local_table_size;
13180 for (i=0; i<size; i++) {
13181 VALUE v = ibf_dump_id(dump, body->local_table[i]);
13184 v = ibf_dump_object(dump,
ULONG2NUM(body->local_table[i]));
13190 return ibf_dump_write(dump, table,
sizeof(
ID) * size);
13194ibf_load_local_table(
const struct ibf_load *load, ibf_offset_t local_table_offset,
int size)
13197 ID *table = IBF_R(local_table_offset,
ID, size);
13200 for (i=0; i<size; i++) {
13201 table[i] = ibf_load_id(load, table[i]);
13216 int *iseq_indices =
ALLOCA_N(
int, table->size);
13219 for (i=0; i<table->size; i++) {
13220 iseq_indices[i] = ibf_dump_iseq(dump, table->entries[i].iseq);
13223 const ibf_offset_t offset = ibf_dump_pos(dump);
13225 for (i=0; i<table->size; i++) {
13226 ibf_dump_write_small_value(dump, iseq_indices[i]);
13227 ibf_dump_write_small_value(dump, table->entries[i].type);
13228 ibf_dump_write_small_value(dump, table->entries[i].start);
13229 ibf_dump_write_small_value(dump, table->entries[i].end);
13230 ibf_dump_write_small_value(dump, table->entries[i].cont);
13231 ibf_dump_write_small_value(dump, table->entries[i].sp);
13236 return ibf_dump_pos(dump);
13241ibf_load_catch_table(
const struct ibf_load *load, ibf_offset_t catch_table_offset,
unsigned int size,
const rb_iseq_t *parent_iseq)
13244 struct iseq_catch_table *table = ruby_xcalloc(1, iseq_catch_table_bytes(size));
13245 table->size = size;
13246 ISEQ_BODY(parent_iseq)->catch_table = table;
13248 ibf_offset_t reading_pos = catch_table_offset;
13251 for (i=0; i<table->size; i++) {
13252 int iseq_index = (int)ibf_load_small_value(load, &reading_pos);
13253 table->entries[i].type = (
enum rb_catch_type)ibf_load_small_value(load, &reading_pos);
13254 table->entries[i].start = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13255 table->entries[i].end = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13256 table->entries[i].cont = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13257 table->entries[i].sp = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13260 RB_OBJ_WRITE(parent_iseq, UNALIGNED_MEMBER_PTR(&table->entries[i], iseq), catch_iseq);
13264 ISEQ_BODY(parent_iseq)->catch_table = NULL;
13272 const unsigned int ci_size = body->ci_size;
13275 ibf_offset_t offset = ibf_dump_pos(dump);
13279 for (i = 0; i < ci_size; i++) {
13282 ibf_dump_write_small_value(dump, ibf_dump_id(dump, vm_ci_mid(ci)));
13283 ibf_dump_write_small_value(dump, vm_ci_flag(ci));
13284 ibf_dump_write_small_value(dump, vm_ci_argc(ci));
13288 int len = kwarg->keyword_len;
13289 ibf_dump_write_small_value(dump,
len);
13290 for (
int j=0; j<
len; j++) {
13291 VALUE keyword = ibf_dump_object(dump, kwarg->keywords[j]);
13292 ibf_dump_write_small_value(dump, keyword);
13296 ibf_dump_write_small_value(dump, 0);
13301 ibf_dump_write_small_value(dump, (
VALUE)-1);
13319static enum rb_id_table_iterator_result
13320store_outer_variable(
ID id,
VALUE val,
void *dump)
13325 pair->name = rb_id2str(
id);
13327 return ID_TABLE_CONTINUE;
13331outer_variable_cmp(
const void *a,
const void *b,
void *arg)
13339 else if (!bp->name) {
13349 struct rb_id_table * ovs = ISEQ_BODY(iseq)->outer_variables;
13351 ibf_offset_t offset = ibf_dump_pos(dump);
13353 size_t size = ovs ? rb_id_table_size(ovs) : 0;
13354 ibf_dump_write_small_value(dump, (
VALUE)size);
13363 rb_id_table_foreach(ovs, store_outer_variable, ovlist);
13365 for (
size_t i = 0; i < size; ++i) {
13366 ID id = ovlist->pairs[i].id;
13367 ID val = ovlist->pairs[i].val;
13368 ibf_dump_write_small_value(dump, ibf_dump_id(dump,
id));
13369 ibf_dump_write_small_value(dump, val);
13378ibf_load_ci_entries(
const struct ibf_load *load,
13379 ibf_offset_t ci_entries_offset,
13380 unsigned int ci_size,
13388 ibf_offset_t reading_pos = ci_entries_offset;
13395 for (i = 0; i < ci_size; i++) {
13396 VALUE mid_index = ibf_load_small_value(load, &reading_pos);
13397 if (mid_index != (
VALUE)-1) {
13398 ID mid = ibf_load_id(load, mid_index);
13399 unsigned int flag = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13400 unsigned int argc = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13403 int kwlen = (int)ibf_load_small_value(load, &reading_pos);
13406 kwarg->references = 0;
13407 kwarg->keyword_len = kwlen;
13408 for (
int j=0; j<kwlen; j++) {
13409 VALUE keyword = ibf_load_small_value(load, &reading_pos);
13410 kwarg->keywords[j] = ibf_load_object(load, keyword);
13414 cds[i].ci = vm_ci_new(mid, flag, argc, kwarg);
13416 cds[i].cc = vm_cc_empty();
13427ibf_load_outer_variables(
const struct ibf_load * load, ibf_offset_t outer_variables_offset)
13429 ibf_offset_t reading_pos = outer_variables_offset;
13433 size_t table_size = (size_t)ibf_load_small_value(load, &reading_pos);
13435 if (table_size > 0) {
13436 tbl = rb_id_table_create(table_size);
13439 for (
size_t i = 0; i < table_size; i++) {
13440 ID key = ibf_load_id(load, (
ID)ibf_load_small_value(load, &reading_pos));
13441 VALUE value = ibf_load_small_value(load, &reading_pos);
13442 if (!key) key = rb_make_temporary_id(i);
13443 rb_id_table_insert(tbl, key, value);
13452 RUBY_ASSERT(dump->current_buffer == &dump->global_buffer);
13454 unsigned int *positions;
13458 const VALUE location_pathobj_index = ibf_dump_object(dump, body->location.pathobj);
13459 const VALUE location_base_label_index = ibf_dump_object(dump, body->location.base_label);
13460 const VALUE location_label_index = ibf_dump_object(dump, body->location.label);
13462#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13463 ibf_offset_t iseq_start = ibf_dump_pos(dump);
13468 buffer.obj_table = ibf_dump_object_table_new();
13469 dump->current_buffer = &buffer;
13472 const ibf_offset_t bytecode_offset = ibf_dump_code(dump, iseq);
13473 const ibf_offset_t bytecode_size = ibf_dump_pos(dump) - bytecode_offset;
13474 const ibf_offset_t param_opt_table_offset = ibf_dump_param_opt_table(dump, iseq);
13475 const ibf_offset_t param_keyword_offset = ibf_dump_param_keyword(dump, iseq);
13476 const ibf_offset_t insns_info_body_offset = ibf_dump_insns_info_body(dump, iseq);
13478 positions = rb_iseq_insns_info_decode_positions(ISEQ_BODY(iseq));
13479 const ibf_offset_t insns_info_positions_offset = ibf_dump_insns_info_positions(dump, positions, body->insns_info.size);
13480 ruby_xfree(positions);
13482 const ibf_offset_t local_table_offset = ibf_dump_local_table(dump, iseq);
13483 const unsigned int catch_table_size = body->catch_table ? body->catch_table->size : 0;
13484 const ibf_offset_t catch_table_offset = ibf_dump_catch_table(dump, iseq);
13485 const int parent_iseq_index = ibf_dump_iseq(dump, ISEQ_BODY(iseq)->parent_iseq);
13486 const int local_iseq_index = ibf_dump_iseq(dump, ISEQ_BODY(iseq)->local_iseq);
13487 const int mandatory_only_iseq_index = ibf_dump_iseq(dump, ISEQ_BODY(iseq)->mandatory_only_iseq);
13488 const ibf_offset_t ci_entries_offset = ibf_dump_ci_entries(dump, iseq);
13489 const ibf_offset_t outer_variables_offset = ibf_dump_outer_variables(dump, iseq);
13491#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13492 ibf_offset_t local_obj_list_offset;
13493 unsigned int local_obj_list_size;
13495 ibf_dump_object_list(dump, &local_obj_list_offset, &local_obj_list_size);
13498 ibf_offset_t body_offset = ibf_dump_pos(dump);
13501 unsigned int param_flags =
13502 (body->
param.flags.has_lead << 0) |
13503 (body->
param.flags.has_opt << 1) |
13504 (body->
param.flags.has_rest << 2) |
13505 (body->
param.flags.has_post << 3) |
13506 (body->
param.flags.has_kw << 4) |
13507 (body->
param.flags.has_kwrest << 5) |
13508 (body->
param.flags.has_block << 6) |
13509 (body->
param.flags.ambiguous_param0 << 7) |
13510 (body->
param.flags.accepts_no_kwarg << 8) |
13511 (body->
param.flags.ruby2_keywords << 9) |
13512 (body->
param.flags.anon_rest << 10) |
13513 (body->
param.flags.anon_kwrest << 11) |
13514 (body->
param.flags.use_block << 12) |
13515 (body->
param.flags.forwardable << 13) ;
13517#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13518# define IBF_BODY_OFFSET(x) (x)
13520# define IBF_BODY_OFFSET(x) (body_offset - (x))
13523 ibf_dump_write_small_value(dump, body->type);
13524 ibf_dump_write_small_value(dump, body->iseq_size);
13525 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(bytecode_offset));
13526 ibf_dump_write_small_value(dump, bytecode_size);
13527 ibf_dump_write_small_value(dump, param_flags);
13528 ibf_dump_write_small_value(dump, body->
param.size);
13529 ibf_dump_write_small_value(dump, body->
param.lead_num);
13530 ibf_dump_write_small_value(dump, body->
param.opt_num);
13531 ibf_dump_write_small_value(dump, body->
param.rest_start);
13532 ibf_dump_write_small_value(dump, body->
param.post_start);
13533 ibf_dump_write_small_value(dump, body->
param.post_num);
13534 ibf_dump_write_small_value(dump, body->
param.block_start);
13535 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(param_opt_table_offset));
13536 ibf_dump_write_small_value(dump, param_keyword_offset);
13537 ibf_dump_write_small_value(dump, location_pathobj_index);
13538 ibf_dump_write_small_value(dump, location_base_label_index);
13539 ibf_dump_write_small_value(dump, location_label_index);
13540 ibf_dump_write_small_value(dump, body->location.first_lineno);
13541 ibf_dump_write_small_value(dump, body->location.node_id);
13542 ibf_dump_write_small_value(dump, body->location.code_location.beg_pos.lineno);
13543 ibf_dump_write_small_value(dump, body->location.code_location.beg_pos.column);
13544 ibf_dump_write_small_value(dump, body->location.code_location.end_pos.lineno);
13545 ibf_dump_write_small_value(dump, body->location.code_location.end_pos.column);
13546 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(insns_info_body_offset));
13547 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(insns_info_positions_offset));
13548 ibf_dump_write_small_value(dump, body->insns_info.size);
13549 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(local_table_offset));
13550 ibf_dump_write_small_value(dump, catch_table_size);
13551 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(catch_table_offset));
13552 ibf_dump_write_small_value(dump, parent_iseq_index);
13553 ibf_dump_write_small_value(dump, local_iseq_index);
13554 ibf_dump_write_small_value(dump, mandatory_only_iseq_index);
13555 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(ci_entries_offset));
13556 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(outer_variables_offset));
13557 ibf_dump_write_small_value(dump, body->variable.flip_count);
13558 ibf_dump_write_small_value(dump, body->local_table_size);
13559 ibf_dump_write_small_value(dump, body->ivc_size);
13560 ibf_dump_write_small_value(dump, body->icvarc_size);
13561 ibf_dump_write_small_value(dump, body->ise_size);
13562 ibf_dump_write_small_value(dump, body->ic_size);
13563 ibf_dump_write_small_value(dump, body->ci_size);
13564 ibf_dump_write_small_value(dump, body->stack_max);
13565 ibf_dump_write_small_value(dump, body->builtin_attrs);
13566 ibf_dump_write_small_value(dump, body->prism ? 1 : 0);
13568#undef IBF_BODY_OFFSET
13570#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13571 ibf_offset_t iseq_length_bytes = ibf_dump_pos(dump);
13573 dump->current_buffer = saved_buffer;
13574 ibf_dump_write(dump, RSTRING_PTR(buffer.str), iseq_length_bytes);
13576 ibf_offset_t offset = ibf_dump_pos(dump);
13577 ibf_dump_write_small_value(dump, iseq_start);
13578 ibf_dump_write_small_value(dump, iseq_length_bytes);
13579 ibf_dump_write_small_value(dump, body_offset);
13581 ibf_dump_write_small_value(dump, local_obj_list_offset);
13582 ibf_dump_write_small_value(dump, local_obj_list_size);
13584 st_free_table(buffer.obj_table);
13588 return body_offset;
13593ibf_load_location_str(
const struct ibf_load *load,
VALUE str_index)
13595 VALUE str = ibf_load_object(load, str_index);
13597 str = rb_fstring(str);
13607 ibf_offset_t reading_pos = offset;
13609#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13611 load->current_buffer = &load->global_buffer;
13613 const ibf_offset_t iseq_start = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13614 const ibf_offset_t iseq_length_bytes = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13615 const ibf_offset_t body_offset = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13618 buffer.buff = load->global_buffer.buff + iseq_start;
13619 buffer.size = iseq_length_bytes;
13620 buffer.obj_list_offset = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13621 buffer.obj_list_size = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13622 buffer.obj_list = pinned_list_new(buffer.obj_list_size);
13624 load->current_buffer = &buffer;
13625 reading_pos = body_offset;
13628#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13629# define IBF_BODY_OFFSET(x) (x)
13631# define IBF_BODY_OFFSET(x) (offset - (x))
13634 const unsigned int type = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13635 const unsigned int iseq_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13636 const ibf_offset_t bytecode_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13637 const ibf_offset_t bytecode_size = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13638 const unsigned int param_flags = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13639 const unsigned int param_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13640 const int param_lead_num = (int)ibf_load_small_value(load, &reading_pos);
13641 const int param_opt_num = (int)ibf_load_small_value(load, &reading_pos);
13642 const int param_rest_start = (int)ibf_load_small_value(load, &reading_pos);
13643 const int param_post_start = (int)ibf_load_small_value(load, &reading_pos);
13644 const int param_post_num = (int)ibf_load_small_value(load, &reading_pos);
13645 const int param_block_start = (int)ibf_load_small_value(load, &reading_pos);
13646 const ibf_offset_t param_opt_table_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13647 const ibf_offset_t param_keyword_offset = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13648 const VALUE location_pathobj_index = ibf_load_small_value(load, &reading_pos);
13649 const VALUE location_base_label_index = ibf_load_small_value(load, &reading_pos);
13650 const VALUE location_label_index = ibf_load_small_value(load, &reading_pos);
13651 const int location_first_lineno = (int)ibf_load_small_value(load, &reading_pos);
13652 const int location_node_id = (int)ibf_load_small_value(load, &reading_pos);
13653 const int location_code_location_beg_pos_lineno = (int)ibf_load_small_value(load, &reading_pos);
13654 const int location_code_location_beg_pos_column = (int)ibf_load_small_value(load, &reading_pos);
13655 const int location_code_location_end_pos_lineno = (int)ibf_load_small_value(load, &reading_pos);
13656 const int location_code_location_end_pos_column = (int)ibf_load_small_value(load, &reading_pos);
13657 const ibf_offset_t insns_info_body_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13658 const ibf_offset_t insns_info_positions_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13659 const unsigned int insns_info_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13660 const ibf_offset_t local_table_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13661 const unsigned int catch_table_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13662 const ibf_offset_t catch_table_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13663 const int parent_iseq_index = (int)ibf_load_small_value(load, &reading_pos);
13664 const int local_iseq_index = (int)ibf_load_small_value(load, &reading_pos);
13665 const int mandatory_only_iseq_index = (int)ibf_load_small_value(load, &reading_pos);
13666 const ibf_offset_t ci_entries_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13667 const ibf_offset_t outer_variables_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13668 const rb_snum_t variable_flip_count = (rb_snum_t)ibf_load_small_value(load, &reading_pos);
13669 const unsigned int local_table_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13671 const unsigned int ivc_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13672 const unsigned int icvarc_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13673 const unsigned int ise_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13674 const unsigned int ic_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13676 const unsigned int ci_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13677 const unsigned int stack_max = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13678 const unsigned int builtin_attrs = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13679 const bool prism = (bool)ibf_load_small_value(load, &reading_pos);
13682 VALUE path = ibf_load_object(load, location_pathobj_index);
13687 realpath = path = rb_fstring(path);
13690 VALUE pathobj = path;
13696 if (!
NIL_P(realpath)) {
13698 rb_raise(rb_eArgError,
"unexpected realpath %"PRIxVALUE
13699 "(%x), path=%+"PRIsVALUE,
13700 realpath,
TYPE(realpath), path);
13702 realpath = rb_fstring(realpath);
13708 rb_iseq_pathobj_set(iseq, path, realpath);
13713 VALUE dummy_frame = rb_vm_push_frame_fname(ec, path);
13715#undef IBF_BODY_OFFSET
13717 load_body->type =
type;
13718 load_body->stack_max = stack_max;
13719 load_body->
param.flags.has_lead = (param_flags >> 0) & 1;
13720 load_body->
param.flags.has_opt = (param_flags >> 1) & 1;
13721 load_body->
param.flags.has_rest = (param_flags >> 2) & 1;
13722 load_body->
param.flags.has_post = (param_flags >> 3) & 1;
13723 load_body->
param.flags.has_kw = FALSE;
13724 load_body->
param.flags.has_kwrest = (param_flags >> 5) & 1;
13725 load_body->
param.flags.has_block = (param_flags >> 6) & 1;
13726 load_body->
param.flags.ambiguous_param0 = (param_flags >> 7) & 1;
13727 load_body->
param.flags.accepts_no_kwarg = (param_flags >> 8) & 1;
13728 load_body->
param.flags.ruby2_keywords = (param_flags >> 9) & 1;
13729 load_body->
param.flags.anon_rest = (param_flags >> 10) & 1;
13730 load_body->
param.flags.anon_kwrest = (param_flags >> 11) & 1;
13731 load_body->
param.flags.use_block = (param_flags >> 12) & 1;
13732 load_body->
param.flags.forwardable = (param_flags >> 13) & 1;
13733 load_body->
param.size = param_size;
13734 load_body->
param.lead_num = param_lead_num;
13735 load_body->
param.opt_num = param_opt_num;
13736 load_body->
param.rest_start = param_rest_start;
13737 load_body->
param.post_start = param_post_start;
13738 load_body->
param.post_num = param_post_num;
13739 load_body->
param.block_start = param_block_start;
13740 load_body->local_table_size = local_table_size;
13741 load_body->ci_size = ci_size;
13742 load_body->insns_info.size = insns_info_size;
13744 ISEQ_COVERAGE_SET(iseq,
Qnil);
13745 ISEQ_ORIGINAL_ISEQ_CLEAR(iseq);
13746 load_body->variable.flip_count = variable_flip_count;
13747 load_body->variable.script_lines =
Qnil;
13749 load_body->location.first_lineno = location_first_lineno;
13750 load_body->location.node_id = location_node_id;
13751 load_body->location.code_location.beg_pos.lineno = location_code_location_beg_pos_lineno;
13752 load_body->location.code_location.beg_pos.column = location_code_location_beg_pos_column;
13753 load_body->location.code_location.end_pos.lineno = location_code_location_end_pos_lineno;
13754 load_body->location.code_location.end_pos.column = location_code_location_end_pos_column;
13755 load_body->builtin_attrs = builtin_attrs;
13756 load_body->prism = prism;
13758 load_body->ivc_size = ivc_size;
13759 load_body->icvarc_size = icvarc_size;
13760 load_body->ise_size = ise_size;
13761 load_body->ic_size = ic_size;
13763 if (ISEQ_IS_SIZE(load_body)) {
13767 load_body->is_entries = NULL;
13769 ibf_load_ci_entries(load, ci_entries_offset, ci_size, &load_body->call_data);
13770 load_body->outer_variables = ibf_load_outer_variables(load, outer_variables_offset);
13771 load_body->
param.opt_table = ibf_load_param_opt_table(load, param_opt_table_offset, param_opt_num);
13772 load_body->
param.keyword = ibf_load_param_keyword(load, param_keyword_offset);
13773 load_body->
param.flags.has_kw = (param_flags >> 4) & 1;
13774 load_body->insns_info.body = ibf_load_insns_info_body(load, insns_info_body_offset, insns_info_size);
13775 load_body->insns_info.positions = ibf_load_insns_info_positions(load, insns_info_positions_offset, insns_info_size);
13776 load_body->local_table = ibf_load_local_table(load, local_table_offset, local_table_size);
13777 ibf_load_catch_table(load, catch_table_offset, catch_table_size, iseq);
13781 const rb_iseq_t *mandatory_only_iseq = ibf_load_iseq(load, (
const rb_iseq_t *)(
VALUE)mandatory_only_iseq_index);
13783 RB_OBJ_WRITE(iseq, &load_body->parent_iseq, parent_iseq);
13784 RB_OBJ_WRITE(iseq, &load_body->local_iseq, local_iseq);
13785 RB_OBJ_WRITE(iseq, &load_body->mandatory_only_iseq, mandatory_only_iseq);
13788 if (load_body->
param.keyword != NULL) {
13790 struct rb_iseq_param_keyword *keyword = (
struct rb_iseq_param_keyword *) load_body->
param.keyword;
13791 keyword->table = &load_body->local_table[keyword->bits_start - keyword->num];
13794 ibf_load_code(load, iseq, bytecode_offset, bytecode_size, iseq_size);
13795#if VM_INSN_INFO_TABLE_IMPL == 2
13796 rb_iseq_insns_info_encode_positions(iseq);
13799 rb_iseq_translate_threaded_code(iseq);
13801#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13802 load->current_buffer = &load->global_buffer;
13805 RB_OBJ_WRITE(iseq, &load_body->location.base_label, ibf_load_location_str(load, location_base_label_index));
13806 RB_OBJ_WRITE(iseq, &load_body->location.label, ibf_load_location_str(load, location_label_index));
13808#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13809 load->current_buffer = saved_buffer;
13811 verify_call_cache(iseq);
13814 rb_vm_pop_frame_no_int(ec);
13824ibf_dump_iseq_list_i(st_data_t key, st_data_t val, st_data_t ptr)
13829 ibf_offset_t offset = ibf_dump_iseq_each(args->dump, iseq);
13832 return ST_CONTINUE;
13842 args.offset_list = offset_list;
13844 st_foreach(dump->iseq_table, ibf_dump_iseq_list_i, (st_data_t)&args);
13847 st_index_t size = dump->iseq_table->num_entries;
13848 ibf_offset_t *offsets =
ALLOCA_N(ibf_offset_t, size);
13850 for (i = 0; i < size; i++) {
13854 ibf_dump_align(dump,
sizeof(ibf_offset_t));
13855 header->iseq_list_offset = ibf_dump_write(dump, offsets,
sizeof(ibf_offset_t) * size);
13856 header->iseq_list_size = (
unsigned int)size;
13859#define IBF_OBJECT_INTERNAL FL_PROMOTED0
13868 unsigned int type: 5;
13869 unsigned int special_const: 1;
13870 unsigned int frozen: 1;
13871 unsigned int internal: 1;
13874enum ibf_object_class_index {
13875 IBF_OBJECT_CLASS_OBJECT,
13876 IBF_OBJECT_CLASS_ARRAY,
13877 IBF_OBJECT_CLASS_STANDARD_ERROR,
13878 IBF_OBJECT_CLASS_NO_MATCHING_PATTERN_ERROR,
13879 IBF_OBJECT_CLASS_TYPE_ERROR,
13880 IBF_OBJECT_CLASS_NO_MATCHING_PATTERN_KEY_ERROR,
13890 long keyval[FLEX_ARY_LEN];
13903 BDIGIT digits[FLEX_ARY_LEN];
13906enum ibf_object_data_type {
13907 IBF_OBJECT_DATA_ENCODING,
13918#define IBF_ALIGNED_OFFSET(align, offset) \
13919 ((((offset) - 1) / (align) + 1) * (align))
13920#define IBF_OBJBODY(type, offset) (const type *)\
13921 ibf_load_check_offset(load, IBF_ALIGNED_OFFSET(RUBY_ALIGNOF(type), offset))
13924ibf_load_check_offset(
const struct ibf_load *load,
size_t offset)
13926 if (offset >= load->current_buffer->size) {
13927 rb_raise(
rb_eIndexError,
"object offset out of range: %"PRIdSIZE, offset);
13929 return load->current_buffer->buff + offset;
13932NORETURN(
static void ibf_dump_object_unsupported(
struct ibf_dump *dump,
VALUE obj));
13935ibf_dump_object_unsupported(
struct ibf_dump *dump,
VALUE obj)
13938 rb_raw_obj_info(buff,
sizeof(buff), obj);
13947 rb_raise(rb_eArgError,
"unsupported");
13954 enum ibf_object_class_index cindex;
13955 if (obj == rb_cObject) {
13956 cindex = IBF_OBJECT_CLASS_OBJECT;
13959 cindex = IBF_OBJECT_CLASS_ARRAY;
13962 cindex = IBF_OBJECT_CLASS_STANDARD_ERROR;
13965 cindex = IBF_OBJECT_CLASS_NO_MATCHING_PATTERN_ERROR;
13968 cindex = IBF_OBJECT_CLASS_TYPE_ERROR;
13971 cindex = IBF_OBJECT_CLASS_NO_MATCHING_PATTERN_KEY_ERROR;
13974 rb_obj_info_dump(obj);
13976 rb_bug(
"unsupported class");
13978 ibf_dump_write_small_value(dump, (
VALUE)cindex);
13984 enum ibf_object_class_index cindex = (
enum ibf_object_class_index)ibf_load_small_value(load, &offset);
13987 case IBF_OBJECT_CLASS_OBJECT:
13989 case IBF_OBJECT_CLASS_ARRAY:
13991 case IBF_OBJECT_CLASS_STANDARD_ERROR:
13993 case IBF_OBJECT_CLASS_NO_MATCHING_PATTERN_ERROR:
13995 case IBF_OBJECT_CLASS_TYPE_ERROR:
13997 case IBF_OBJECT_CLASS_NO_MATCHING_PATTERN_KEY_ERROR:
14001 rb_raise(rb_eArgError,
"ibf_load_object_class: unknown class (%d)", (
int)cindex);
14009 (void)IBF_W(&dbl,
double, 1);
14015 const double *dblp = IBF_OBJBODY(
double, offset);
14022 long encindex = (long)rb_enc_get_index(obj);
14023 long len = RSTRING_LEN(obj);
14024 const char *ptr = RSTRING_PTR(obj);
14026 if (encindex > RUBY_ENCINDEX_BUILTIN_MAX) {
14027 rb_encoding *enc = rb_enc_from_index((
int)encindex);
14028 const char *enc_name = rb_enc_name(enc);
14029 encindex = RUBY_ENCINDEX_BUILTIN_MAX + ibf_dump_object(dump,
rb_str_new2(enc_name));
14032 ibf_dump_write_small_value(dump, encindex);
14033 ibf_dump_write_small_value(dump,
len);
14034 IBF_WP(ptr,
char,
len);
14040 ibf_offset_t reading_pos = offset;
14042 int encindex = (int)ibf_load_small_value(load, &reading_pos);
14043 const long len = (long)ibf_load_small_value(load, &reading_pos);
14044 const char *ptr = load->current_buffer->buff + reading_pos;
14046 if (encindex > RUBY_ENCINDEX_BUILTIN_MAX) {
14047 VALUE enc_name_str = ibf_load_object(load, encindex - RUBY_ENCINDEX_BUILTIN_MAX);
14048 encindex = rb_enc_find_index(RSTRING_PTR(enc_name_str));
14052 if (header->frozen && !header->internal) {
14053 str = rb_enc_literal_str(ptr,
len, rb_enc_from_index(encindex));
14056 str = rb_enc_str_new(ptr,
len, rb_enc_from_index(encindex));
14059 if (header->frozen) str = rb_fstring(str);
14070 regexp.srcstr = (long)ibf_dump_object(dump, srcstr);
14072 ibf_dump_write_byte(dump, (
unsigned char)regexp.option);
14073 ibf_dump_write_small_value(dump, regexp.srcstr);
14080 regexp.option = ibf_load_byte(load, &offset);
14081 regexp.srcstr = ibf_load_small_value(load, &offset);
14083 VALUE srcstr = ibf_load_object(load, regexp.srcstr);
14084 VALUE reg = rb_reg_compile(srcstr, (
int)regexp.option, NULL, 0);
14096 ibf_dump_write_small_value(dump,
len);
14097 for (i=0; i<
len; i++) {
14098 long index = (long)ibf_dump_object(dump,
RARRAY_AREF(obj, i));
14099 ibf_dump_write_small_value(dump, index);
14106 ibf_offset_t reading_pos = offset;
14108 const long len = (long)ibf_load_small_value(load, &reading_pos);
14113 for (i=0; i<
len; i++) {
14114 const VALUE index = ibf_load_small_value(load, &reading_pos);
14124ibf_dump_object_hash_i(st_data_t key, st_data_t val, st_data_t ptr)
14128 VALUE key_index = ibf_dump_object(dump, (
VALUE)key);
14129 VALUE val_index = ibf_dump_object(dump, (
VALUE)val);
14131 ibf_dump_write_small_value(dump, key_index);
14132 ibf_dump_write_small_value(dump, val_index);
14133 return ST_CONTINUE;
14140 ibf_dump_write_small_value(dump, (
VALUE)
len);
14148 long len = (long)ibf_load_small_value(load, &offset);
14149 VALUE obj = rb_hash_new_with_size(
len);
14152 for (i = 0; i <
len; i++) {
14153 VALUE key_index = ibf_load_small_value(load, &offset);
14154 VALUE val_index = ibf_load_small_value(load, &offset);
14156 VALUE key = ibf_load_object(load, key_index);
14157 VALUE val = ibf_load_object(load, val_index);
14158 rb_hash_aset(obj, key, val);
14160 rb_hash_rehash(obj);
14176 range.class_index = 0;
14179 range.beg = (long)ibf_dump_object(dump, beg);
14180 range.end = (long)ibf_dump_object(dump, end);
14186 rb_raise(
rb_eNotImpError,
"ibf_dump_object_struct: unsupported class %"PRIsVALUE,
14195 VALUE beg = ibf_load_object(load, range->beg);
14196 VALUE end = ibf_load_object(load, range->end);
14206 ssize_t
len = BIGNUM_LEN(obj);
14207 ssize_t slen = BIGNUM_SIGN(obj) > 0 ?
len :
len * -1;
14208 BDIGIT *d = BIGNUM_DIGITS(obj);
14210 (void)IBF_W(&slen, ssize_t, 1);
14211 IBF_WP(d, BDIGIT,
len);
14218 int sign = bignum->slen > 0;
14219 ssize_t
len = sign > 0 ? bignum->slen : -1 * bignum->slen;
14220 const int big_unpack_flags =
14223 VALUE obj = rb_integer_unpack(bignum->digits,
len,
sizeof(BDIGIT), 0,
14234 if (rb_data_is_encoding(obj)) {
14236 const char *name = rb_enc_name(enc);
14237 long len = strlen(name) + 1;
14239 data[0] = IBF_OBJECT_DATA_ENCODING;
14241 (void)IBF_W(data,
long, 2);
14242 IBF_WP(name,
char,
len);
14245 ibf_dump_object_unsupported(dump, obj);
14252 const long *body = IBF_OBJBODY(
long, offset);
14253 const enum ibf_object_data_type
type = (
enum ibf_object_data_type)body[0];
14255 const char *data = (
const char *)&body[2];
14258 case IBF_OBJECT_DATA_ENCODING:
14260 VALUE encobj = rb_enc_from_encoding(rb_enc_find(data));
14265 return ibf_load_object_unsupported(load, header, offset);
14269ibf_dump_object_complex_rational(
struct ibf_dump *dump,
VALUE obj)
14272 data[0] = (long)ibf_dump_object(dump, RCOMPLEX(obj)->real);
14273 data[1] = (long)ibf_dump_object(dump, RCOMPLEX(obj)->imag);
14275 (void)IBF_W(data,
long, 2);
14279ibf_load_object_complex_rational(
const struct ibf_load *load,
const struct ibf_object_header *header, ibf_offset_t offset)
14282 VALUE a = ibf_load_object(load, nums->a);
14283 VALUE b = ibf_load_object(load, nums->b);
14295 ibf_dump_object_string(dump,
rb_sym2str(obj));
14301 ibf_offset_t reading_pos = offset;
14303 int encindex = (int)ibf_load_small_value(load, &reading_pos);
14304 const long len = (long)ibf_load_small_value(load, &reading_pos);
14305 const char *ptr = load->current_buffer->buff + reading_pos;
14307 if (encindex > RUBY_ENCINDEX_BUILTIN_MAX) {
14308 VALUE enc_name_str = ibf_load_object(load, encindex - RUBY_ENCINDEX_BUILTIN_MAX);
14309 encindex = rb_enc_find_index(RSTRING_PTR(enc_name_str));
14312 ID id = rb_intern3(ptr,
len, rb_enc_from_index(encindex));
14316typedef void (*ibf_dump_object_function)(
struct ibf_dump *dump,
VALUE obj);
14317static const ibf_dump_object_function dump_object_functions[
RUBY_T_MASK+1] = {
14318 ibf_dump_object_unsupported,
14319 ibf_dump_object_unsupported,
14320 ibf_dump_object_class,
14321 ibf_dump_object_unsupported,
14322 ibf_dump_object_float,
14323 ibf_dump_object_string,
14324 ibf_dump_object_regexp,
14325 ibf_dump_object_array,
14326 ibf_dump_object_hash,
14327 ibf_dump_object_struct,
14328 ibf_dump_object_bignum,
14329 ibf_dump_object_unsupported,
14330 ibf_dump_object_data,
14331 ibf_dump_object_unsupported,
14332 ibf_dump_object_complex_rational,
14333 ibf_dump_object_complex_rational,
14334 ibf_dump_object_unsupported,
14335 ibf_dump_object_unsupported,
14336 ibf_dump_object_unsupported,
14337 ibf_dump_object_unsupported,
14338 ibf_dump_object_symbol,
14339 ibf_dump_object_unsupported,
14340 ibf_dump_object_unsupported,
14341 ibf_dump_object_unsupported,
14342 ibf_dump_object_unsupported,
14343 ibf_dump_object_unsupported,
14344 ibf_dump_object_unsupported,
14345 ibf_dump_object_unsupported,
14346 ibf_dump_object_unsupported,
14347 ibf_dump_object_unsupported,
14348 ibf_dump_object_unsupported,
14349 ibf_dump_object_unsupported,
14355 unsigned char byte =
14356 (header.type << 0) |
14357 (header.special_const << 5) |
14358 (header.frozen << 6) |
14359 (header.internal << 7);
14365ibf_load_object_object_header(const struct
ibf_load *load, ibf_offset_t *offset)
14367 unsigned char byte = ibf_load_byte(load, offset);
14370 header.type = (
byte >> 0) & 0x1f;
14371 header.special_const = (
byte >> 5) & 0x01;
14372 header.frozen = (
byte >> 6) & 0x01;
14373 header.internal = (
byte >> 7) & 0x01;
14382 ibf_offset_t current_offset;
14383 IBF_ZERO(obj_header);
14384 obj_header.type =
TYPE(obj);
14386 IBF_W_ALIGN(ibf_offset_t);
14387 current_offset = ibf_dump_pos(dump);
14392 obj_header.special_const = TRUE;
14393 obj_header.frozen = TRUE;
14394 obj_header.internal = TRUE;
14395 ibf_dump_object_object_header(dump, obj_header);
14396 ibf_dump_write_small_value(dump, obj);
14400 obj_header.special_const = FALSE;
14401 obj_header.frozen =
OBJ_FROZEN(obj) ? TRUE : FALSE;
14402 ibf_dump_object_object_header(dump, obj_header);
14403 (*dump_object_functions[obj_header.type])(dump, obj);
14406 return current_offset;
14410static const ibf_load_object_function load_object_functions[
RUBY_T_MASK+1] = {
14411 ibf_load_object_unsupported,
14412 ibf_load_object_unsupported,
14413 ibf_load_object_class,
14414 ibf_load_object_unsupported,
14415 ibf_load_object_float,
14416 ibf_load_object_string,
14417 ibf_load_object_regexp,
14418 ibf_load_object_array,
14419 ibf_load_object_hash,
14420 ibf_load_object_struct,
14421 ibf_load_object_bignum,
14422 ibf_load_object_unsupported,
14423 ibf_load_object_data,
14424 ibf_load_object_unsupported,
14425 ibf_load_object_complex_rational,
14426 ibf_load_object_complex_rational,
14427 ibf_load_object_unsupported,
14428 ibf_load_object_unsupported,
14429 ibf_load_object_unsupported,
14430 ibf_load_object_unsupported,
14431 ibf_load_object_symbol,
14432 ibf_load_object_unsupported,
14433 ibf_load_object_unsupported,
14434 ibf_load_object_unsupported,
14435 ibf_load_object_unsupported,
14436 ibf_load_object_unsupported,
14437 ibf_load_object_unsupported,
14438 ibf_load_object_unsupported,
14439 ibf_load_object_unsupported,
14440 ibf_load_object_unsupported,
14441 ibf_load_object_unsupported,
14442 ibf_load_object_unsupported,
14446ibf_load_object(
const struct ibf_load *load,
VALUE object_index)
14448 if (object_index == 0) {
14452 VALUE obj = pinned_list_fetch(load->current_buffer->obj_list, (
long)object_index);
14454 ibf_offset_t *offsets = (ibf_offset_t *)(load->current_buffer->obj_list_offset + load->current_buffer->buff);
14455 ibf_offset_t offset = offsets[object_index];
14456 const struct ibf_object_header header = ibf_load_object_object_header(load, &offset);
14459 fprintf(stderr,
"ibf_load_object: list=%#x offsets=%p offset=%#x\n",
14460 load->current_buffer->obj_list_offset, (
void *)offsets, offset);
14461 fprintf(stderr,
"ibf_load_object: type=%#x special=%d frozen=%d internal=%d\n",
14462 header.type, header.special_const, header.frozen, header.internal);
14464 if (offset >= load->current_buffer->size) {
14465 rb_raise(
rb_eIndexError,
"object offset out of range: %u", offset);
14468 if (header.special_const) {
14469 ibf_offset_t reading_pos = offset;
14471 obj = ibf_load_small_value(load, &reading_pos);
14474 obj = (*load_object_functions[header.type])(load, &header, offset);
14477 pinned_list_store(load->current_buffer->obj_list, (
long)object_index, obj);
14480 fprintf(stderr,
"ibf_load_object: index=%#"PRIxVALUE
" obj=%#"PRIxVALUE
"\n",
14481 object_index, obj);
14494ibf_dump_object_list_i(st_data_t key, st_data_t val, st_data_t ptr)
14499 ibf_offset_t offset = ibf_dump_object_object(args->dump, obj);
14502 return ST_CONTINUE;
14506ibf_dump_object_list(
struct ibf_dump *dump, ibf_offset_t *obj_list_offset,
unsigned int *obj_list_size)
14508 st_table *obj_table = dump->current_buffer->obj_table;
14513 args.offset_list = offset_list;
14515 st_foreach(obj_table, ibf_dump_object_list_i, (st_data_t)&args);
14517 IBF_W_ALIGN(ibf_offset_t);
14518 *obj_list_offset = ibf_dump_pos(dump);
14520 st_index_t size = obj_table->num_entries;
14523 for (i=0; i<size; i++) {
14528 *obj_list_size = (
unsigned int)size;
14532ibf_dump_mark(
void *ptr)
14535 rb_gc_mark(dump->global_buffer.str);
14537 rb_mark_set(dump->global_buffer.obj_table);
14538 rb_mark_set(dump->iseq_table);
14542ibf_dump_free(
void *ptr)
14545 if (dump->global_buffer.obj_table) {
14546 st_free_table(dump->global_buffer.obj_table);
14547 dump->global_buffer.obj_table = 0;
14549 if (dump->iseq_table) {
14550 st_free_table(dump->iseq_table);
14551 dump->iseq_table = 0;
14556ibf_dump_memsize(
const void *ptr)
14560 if (dump->iseq_table) size += st_memsize(dump->iseq_table);
14561 if (dump->global_buffer.obj_table) size += st_memsize(dump->global_buffer.obj_table);
14567 {ibf_dump_mark, ibf_dump_free, ibf_dump_memsize,},
14568 0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_EMBEDDABLE
14574 dump->global_buffer.obj_table = NULL;
14575 dump->iseq_table = NULL;
14578 dump->global_buffer.obj_table = ibf_dump_object_table_new();
14579 dump->iseq_table = st_init_numtable();
14581 dump->current_buffer = &dump->global_buffer;
14592 if (ISEQ_BODY(iseq)->parent_iseq != NULL ||
14593 ISEQ_BODY(iseq)->local_iseq != iseq) {
14596 if (
RTEST(ISEQ_COVERAGE(iseq))) {
14601 ibf_dump_setup(dump, dump_obj);
14603 ibf_dump_write(dump, &header,
sizeof(header));
14604 ibf_dump_iseq(dump, iseq);
14606 header.magic[0] =
'Y';
14607 header.magic[1] =
'A';
14608 header.magic[2] =
'R';
14609 header.magic[3] =
'B';
14610 header.major_version = IBF_MAJOR_VERSION;
14611 header.minor_version = IBF_MINOR_VERSION;
14612 header.endian = IBF_ENDIAN_MARK;
14614 ibf_dump_iseq_list(dump, &header);
14615 ibf_dump_object_list(dump, &header.global_object_list_offset, &header.global_object_list_size);
14616 header.size = ibf_dump_pos(dump);
14619 VALUE opt_str = opt;
14622 ibf_dump_write(dump, ptr, header.extra_size);
14625 header.extra_size = 0;
14628 ibf_dump_overwrite(dump, &header,
sizeof(header), 0);
14630 str = dump->global_buffer.str;
14635static const ibf_offset_t *
14636ibf_iseq_list(
const struct ibf_load *load)
14638 return (
const ibf_offset_t *)(load->global_buffer.buff + load->header->iseq_list_offset);
14642rb_ibf_load_iseq_complete(
rb_iseq_t *iseq)
14646 ibf_offset_t offset = ibf_iseq_list(load)[iseq->aux.loader.index];
14649 fprintf(stderr,
"rb_ibf_load_iseq_complete: index=%#x offset=%#x size=%#x\n",
14650 iseq->aux.loader.index, offset,
14651 load->header->size);
14653 ibf_load_iseq_each(load, iseq, offset);
14654 ISEQ_COMPILE_DATA_CLEAR(iseq);
14656 rb_iseq_init_trace(iseq);
14657 load->iseq = prev_src_iseq;
14664 rb_ibf_load_iseq_complete((
rb_iseq_t *)iseq);
14672 int iseq_index = (int)(
VALUE)index_iseq;
14675 fprintf(stderr,
"ibf_load_iseq: index_iseq=%p iseq_list=%p\n",
14676 (
void *)index_iseq, (
void *)load->iseq_list);
14678 if (iseq_index == -1) {
14682 VALUE iseqv = pinned_list_fetch(load->iseq_list, iseq_index);
14685 fprintf(stderr,
"ibf_load_iseq: iseqv=%p\n", (
void *)iseqv);
14693 fprintf(stderr,
"ibf_load_iseq: new iseq=%p\n", (
void *)iseq);
14696 iseq->aux.loader.obj = load->loader_obj;
14697 iseq->aux.loader.index = iseq_index;
14699 fprintf(stderr,
"ibf_load_iseq: iseq=%p loader_obj=%p index=%d\n",
14700 (
void *)iseq, (
void *)load->loader_obj, iseq_index);
14702 pinned_list_store(load->iseq_list, iseq_index, (
VALUE)iseq);
14704 if (!USE_LAZY_LOAD || GET_VM()->builtin_function_table) {
14706 fprintf(stderr,
"ibf_load_iseq: loading iseq=%p\n", (
void *)iseq);
14708 rb_ibf_load_iseq_complete(iseq);
14712 fprintf(stderr,
"ibf_load_iseq: iseq=%p loaded %p\n",
14713 (
void *)iseq, (
void *)load->iseq);
14721ibf_load_setup_bytes(
struct ibf_load *load,
VALUE loader_obj,
const char *bytes,
size_t size)
14724 load->loader_obj = loader_obj;
14725 load->global_buffer.buff = bytes;
14726 load->header = header;
14727 load->global_buffer.size = header->size;
14728 load->global_buffer.obj_list_offset = header->global_object_list_offset;
14729 load->global_buffer.obj_list_size = header->global_object_list_size;
14730 RB_OBJ_WRITE(loader_obj, &load->iseq_list, pinned_list_new(header->iseq_list_size));
14731 RB_OBJ_WRITE(loader_obj, &load->global_buffer.obj_list, pinned_list_new(load->global_buffer.obj_list_size));
14734 load->current_buffer = &load->global_buffer;
14736 if (size < header->size) {
14739 if (strncmp(header->magic,
"YARB", 4) != 0) {
14742 if (header->major_version != IBF_MAJOR_VERSION ||
14743 header->minor_version != IBF_MINOR_VERSION) {
14745 header->major_version, header->minor_version, IBF_MAJOR_VERSION, IBF_MINOR_VERSION);
14747 if (header->endian != IBF_ENDIAN_MARK) {
14753 if (header->iseq_list_offset %
RUBY_ALIGNOF(ibf_offset_t)) {
14754 rb_raise(rb_eArgError,
"unaligned iseq list offset: %u",
14755 header->iseq_list_offset);
14757 if (load->global_buffer.obj_list_offset %
RUBY_ALIGNOF(ibf_offset_t)) {
14758 rb_raise(rb_eArgError,
"unaligned object list offset: %u",
14759 load->global_buffer.obj_list_offset);
14772 if (USE_LAZY_LOAD) {
14773 str =
rb_str_new(RSTRING_PTR(str), RSTRING_LEN(str));
14776 ibf_load_setup_bytes(load, loader_obj, RSTRING_PTR(str), RSTRING_LEN(str));
14781ibf_loader_mark(
void *ptr)
14784 rb_gc_mark(load->str);
14785 rb_gc_mark(load->iseq_list);
14786 rb_gc_mark(load->global_buffer.obj_list);
14790ibf_loader_free(
void *ptr)
14797ibf_loader_memsize(
const void *ptr)
14804 {ibf_loader_mark, ibf_loader_free, ibf_loader_memsize,},
14805 0, 0, RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_FREE_IMMEDIATELY
14809rb_iseq_ibf_load(
VALUE str)
14815 ibf_load_setup(load, loader_obj, str);
14816 iseq = ibf_load_iseq(load, 0);
14823rb_iseq_ibf_load_bytes(
const char *bytes,
size_t size)
14829 ibf_load_setup_bytes(load, loader_obj, bytes, size);
14830 iseq = ibf_load_iseq(load, 0);
14837rb_iseq_ibf_load_extra_data(
VALUE str)
14843 ibf_load_setup(load, loader_obj, str);
14844 extra_str =
rb_str_new(load->global_buffer.buff + load->header->size, load->header->extra_size);
14849#include "prism_compile.c"
#define RUBY_ASSERT(...)
Asserts that the given expression is truthy if and only if RUBY_DEBUG is truthy.
#define RUBY_ALIGNOF
Wraps (or simulates) alignof.
#define RUBY_EVENT_END
Encountered an end of a class clause.
#define RUBY_EVENT_C_CALL
A method, written in C, is called.
#define RUBY_EVENT_B_RETURN
Encountered a next statement.
#define RUBY_EVENT_CLASS
Encountered a new class.
#define RUBY_EVENT_NONE
No events.
#define RUBY_EVENT_LINE
Encountered a new line.
#define RUBY_EVENT_RETURN
Encountered a return statement.
#define RUBY_EVENT_C_RETURN
Return from a method, written in C.
#define RUBY_EVENT_B_CALL
Encountered an yield statement.
uint32_t rb_event_flag_t
Represents event(s).
#define RUBY_EVENT_CALL
A method, written in Ruby, is called.
#define RUBY_EVENT_RESCUE
Encountered a rescue statement.
#define rb_str_new2
Old name of rb_str_new_cstr.
#define T_COMPLEX
Old name of RUBY_T_COMPLEX.
#define TYPE(_)
Old name of rb_type.
#define NUM2ULONG
Old name of RB_NUM2ULONG.
#define NUM2LL
Old name of RB_NUM2LL.
#define REALLOC_N
Old name of RB_REALLOC_N.
#define ALLOCV
Old name of RB_ALLOCV.
#define RFLOAT_VALUE
Old name of rb_float_value.
#define T_STRING
Old name of RUBY_T_STRING.
#define xfree
Old name of ruby_xfree.
#define Qundef
Old name of RUBY_Qundef.
#define INT2FIX
Old name of RB_INT2FIX.
#define OBJ_FROZEN
Old name of RB_OBJ_FROZEN.
#define rb_str_cat2
Old name of rb_str_cat_cstr.
#define T_NIL
Old name of RUBY_T_NIL.
#define UNREACHABLE
Old name of RBIMPL_UNREACHABLE.
#define T_FLOAT
Old name of RUBY_T_FLOAT.
#define ID2SYM
Old name of RB_ID2SYM.
#define T_BIGNUM
Old name of RUBY_T_BIGNUM.
#define SPECIAL_CONST_P
Old name of RB_SPECIAL_CONST_P.
#define OBJ_FREEZE
Old name of RB_OBJ_FREEZE.
#define ULONG2NUM
Old name of RB_ULONG2NUM.
#define UNREACHABLE_RETURN
Old name of RBIMPL_UNREACHABLE_RETURN.
#define SYM2ID
Old name of RB_SYM2ID.
#define FIX2UINT
Old name of RB_FIX2UINT.
#define ZALLOC
Old name of RB_ZALLOC.
#define CLASS_OF
Old name of rb_class_of.
#define FIXABLE
Old name of RB_FIXABLE.
#define xmalloc
Old name of ruby_xmalloc.
#define LONG2FIX
Old name of RB_INT2FIX.
#define FIX2INT
Old name of RB_FIX2INT.
#define NUM2UINT
Old name of RB_NUM2UINT.
#define ZALLOC_N
Old name of RB_ZALLOC_N.
#define ASSUME
Old name of RBIMPL_ASSUME.
#define T_RATIONAL
Old name of RUBY_T_RATIONAL.
#define T_HASH
Old name of RUBY_T_HASH.
#define ALLOC_N
Old name of RB_ALLOC_N.
#define FL_SET
Old name of RB_FL_SET.
#define Qtrue
Old name of RUBY_Qtrue.
#define NUM2INT
Old name of RB_NUM2INT.
#define Qnil
Old name of RUBY_Qnil.
#define Qfalse
Old name of RUBY_Qfalse.
#define FIX2LONG
Old name of RB_FIX2LONG.
#define T_ARRAY
Old name of RUBY_T_ARRAY.
#define NIL_P
Old name of RB_NIL_P.
#define T_SYMBOL
Old name of RUBY_T_SYMBOL.
#define DBL2NUM
Old name of rb_float_new.
#define BUILTIN_TYPE
Old name of RB_BUILTIN_TYPE.
#define NUM2LONG
Old name of RB_NUM2LONG.
#define FL_UNSET
Old name of RB_FL_UNSET.
#define UINT2NUM
Old name of RB_UINT2NUM.
#define FIXNUM_P
Old name of RB_FIXNUM_P.
#define CONST_ID
Old name of RUBY_CONST_ID.
#define ALLOCV_END
Old name of RB_ALLOCV_END.
#define SYMBOL_P
Old name of RB_SYMBOL_P.
#define T_REGEXP
Old name of RUBY_T_REGEXP.
#define ruby_debug
This variable controls whether the interpreter is in debug mode.
VALUE rb_eNotImpError
NotImplementedError exception.
VALUE rb_eStandardError
StandardError exception.
VALUE rb_eTypeError
TypeError exception.
VALUE rb_eNoMatchingPatternError
NoMatchingPatternError exception.
void rb_exc_fatal(VALUE mesg)
Raises a fatal error in the current thread.
VALUE rb_eRuntimeError
RuntimeError exception.
void rb_warn(const char *fmt,...)
Identical to rb_warning(), except it reports unless $VERBOSE is nil.
VALUE rb_eNoMatchingPatternKeyError
NoMatchingPatternKeyError exception.
VALUE rb_eIndexError
IndexError exception.
VALUE rb_eSyntaxError
SyntaxError exception.
@ RB_WARN_CATEGORY_STRICT_UNUSED_BLOCK
Warning is for checking unused block strictly.
VALUE rb_obj_reveal(VALUE obj, VALUE klass)
Make a hidden object visible again.
VALUE rb_cArray
Array class.
VALUE rb_obj_hide(VALUE obj)
Make the object invisible from Ruby code.
VALUE rb_cHash
Hash class.
VALUE rb_inspect(VALUE obj)
Generates a human-readable textual representation of the given object.
VALUE rb_cRange
Range class.
VALUE rb_obj_is_kind_of(VALUE obj, VALUE klass)
Queries if the given object is an instance (of possibly descendants) of the given class.
VALUE rb_obj_freeze(VALUE obj)
Just calls rb_obj_freeze_inline() inside.
#define RB_OBJ_WRITTEN(old, oldv, young)
Identical to RB_OBJ_WRITE(), except it doesn't write any values, but only a WB declaration.
#define RB_OBJ_WRITE(old, slot, young)
Declaration of a "back" pointer.
VALUE rb_ary_reverse(VALUE ary)
Destructively reverses the passed array in-place.
VALUE rb_ary_dup(VALUE ary)
Duplicates an array.
VALUE rb_ary_cat(VALUE ary, const VALUE *train, long len)
Destructively appends multiple elements at the end of the array.
VALUE rb_ary_new(void)
Allocates a new, empty array.
VALUE rb_ary_new_capa(long capa)
Identical to rb_ary_new(), except it additionally specifies how many rooms of objects it should alloc...
VALUE rb_ary_hidden_new(long capa)
Allocates a hidden (no class) empty array.
VALUE rb_ary_clear(VALUE ary)
Destructively removes everything form an array.
VALUE rb_ary_push(VALUE ary, VALUE elem)
Special case of rb_ary_cat() that it adds only one element.
VALUE rb_ary_freeze(VALUE obj)
Freeze an array, preventing further modifications.
VALUE rb_ary_entry(VALUE ary, long off)
Queries an element of an array.
VALUE rb_ary_join(VALUE ary, VALUE sep)
Recursively stringises the elements of the passed array, flattens that result, then joins the sequenc...
void rb_ary_store(VALUE ary, long key, VALUE val)
Destructively stores the passed value to the passed array's passed index.
#define INTEGER_PACK_NATIVE_BYTE_ORDER
Means either INTEGER_PACK_MSBYTE_FIRST or INTEGER_PACK_LSBYTE_FIRST, depending on the host processor'...
#define INTEGER_PACK_NEGATIVE
Interprets the input as a signed negative number (unpack only).
#define INTEGER_PACK_LSWORD_FIRST
Stores/interprets the least significant word as the first word.
int rb_is_const_id(ID id)
Classifies the given ID, then sees if it is a constant.
int rb_is_attrset_id(ID id)
Classifies the given ID, then sees if it is an attribute writer.
int rb_range_values(VALUE range, VALUE *begp, VALUE *endp, int *exclp)
Deconstructs a range into its components.
VALUE rb_range_new(VALUE beg, VALUE end, int excl)
Creates a new Range.
VALUE rb_rational_new(VALUE num, VALUE den)
Constructs a Rational, with reduction.
int rb_reg_options(VALUE re)
Queries the options of the passed regular expression.
VALUE rb_str_append(VALUE dst, VALUE src)
Identical to rb_str_buf_append(), except it converts the right hand side before concatenating.
VALUE rb_str_tmp_new(long len)
Allocates a "temporary" string.
int rb_str_hash_cmp(VALUE str1, VALUE str2)
Compares two strings.
#define rb_str_new(str, len)
Allocates an instance of rb_cString.
st_index_t rb_str_hash(VALUE str)
Calculates a hash value of a string.
VALUE rb_str_cat(VALUE dst, const char *src, long srclen)
Destructively appends the passed contents to the string.
VALUE rb_str_buf_append(VALUE dst, VALUE src)
Identical to rb_str_cat_cstr(), except it takes Ruby's string instead of C's.
int rb_str_cmp(VALUE lhs, VALUE rhs)
Compares two strings, as in strcmp(3).
VALUE rb_str_concat(VALUE dst, VALUE src)
Identical to rb_str_append(), except it also accepts an integer as a codepoint.
VALUE rb_str_freeze(VALUE str)
This is the implementation of String#freeze.
#define rb_str_new_cstr(str)
Identical to rb_str_new, except it assumes the passed pointer is a pointer to a C string.
VALUE rb_class_name(VALUE obj)
Queries the name of the given object's class.
static ID rb_intern_const(const char *str)
This is a "tiny optimisation" over rb_intern().
VALUE rb_id2sym(ID id)
Allocates an instance of rb_cSymbol that has the given id.
VALUE rb_sym2str(VALUE symbol)
Obtain a frozen string representation of a symbol (not including the leading colon).
ID rb_sym2id(VALUE obj)
Converts an instance of rb_cSymbol into an ID.
int len
Length of the buffer.
VALUE rb_ractor_make_shareable(VALUE obj)
Destructively transforms the passed object so that multiple Ractors can share it.
#define DECIMAL_SIZE_OF(expr)
An approximation of decimal representation size.
void ruby_qsort(void *, const size_t, const size_t, int(*)(const void *, const void *, void *), void *)
Reentrant implementation of quick sort.
#define rb_long2int
Just another name of rb_long2int_inline.
#define MEMCPY(p1, p2, type, n)
Handy macro to call memcpy.
#define ALLOCA_N(type, n)
#define MEMZERO(p, type, n)
Handy macro to erase a region of memory.
#define RB_GC_GUARD(v)
Prevents premature destruction of local objects.
#define RB_ALLOCV(v, n)
Identical to RB_ALLOCV_N(), except that it allocates a number of bytes and returns a void* .
VALUE type(ANYARGS)
ANYARGS-ed function type.
void rb_hash_foreach(VALUE q, int_type *w, VALUE e)
Iteration over the given hash.
#define RBIMPL_ATTR_NORETURN()
Wraps (or simulates) [[noreturn]]
#define RARRAY_LEN
Just another name of rb_array_len.
static int RARRAY_LENINT(VALUE ary)
Identical to rb_array_len(), except it differs for the return type.
static void RARRAY_ASET(VALUE ary, long i, VALUE v)
Assigns an object in an array.
#define RARRAY_AREF(a, i)
#define RARRAY_CONST_PTR
Just another name of rb_array_const_ptr.
static VALUE RBASIC_CLASS(VALUE obj)
Queries the class of an object.
#define RUBY_DEFAULT_FREE
This is a value you can set to RData::dfree.
void(* RUBY_DATA_FUNC)(void *)
This is the type of callbacks registered to RData.
#define RHASH_SIZE(h)
Queries the size of the hash.
static VALUE RREGEXP_SRC(VALUE rexp)
Convenient getter function.
#define StringValue(v)
Ensures that the parameter object is a String.
#define StringValuePtr(v)
Identical to StringValue, except it returns a char*.
static int RSTRING_LENINT(VALUE str)
Identical to RSTRING_LEN(), except it differs for the return type.
#define StringValueCStr(v)
Identical to StringValuePtr, except it additionally checks for the contents for viability as a C stri...
#define RTYPEDDATA_DATA(v)
Convenient getter macro.
#define TypedData_Get_Struct(obj, type, data_type, sval)
Obtains a C struct from inside of a wrapper Ruby object.
#define TypedData_Wrap_Struct(klass, data_type, sval)
Converts sval, a pointer to your struct, into a Ruby object.
#define TypedData_Make_Struct(klass, type, data_type, sval)
Identical to TypedData_Wrap_Struct, except it allocates a new data region internally instead of takin...
void rb_p(VALUE obj)
Inspects an object.
#define RTEST
This is an old name of RB_TEST.
#define _(args)
This was a transition path from K&R to ANSI.
Internal header for Complex.
Internal header for Rational.
const ID * segments
A null-terminated list of ids, used to represent a constant's path idNULL is used to represent the ::...
This is the struct that holds necessary info for a struct.
const char * wrap_struct_name
Name of structs of this kind.
struct rb_iseq_constant_body::@154 param
parameter information
uintptr_t ID
Type that represents a Ruby identifier such as a variable name.
#define SIZEOF_VALUE
Identical to sizeof(VALUE), except it is a macro that can also be used inside of preprocessor directi...
uintptr_t VALUE
Type that represents a Ruby object.
static bool RB_FLOAT_TYPE_P(VALUE obj)
Queries if the object is an instance of rb_cFloat.
static bool rb_integer_type_p(VALUE obj)
Queries if the object is an instance of rb_cInteger.
static bool RB_TYPE_P(VALUE obj, enum ruby_value_type t)
Queries if the given object is of given type.
@ RUBY_T_MASK
Bitmask of ruby_value_type.